DataProto.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556
  1. /**
  2. * @file DataProto.c
  3. * @author Ambroz Bizjak <ambrop7@gmail.com>
  4. *
  5. * @section LICENSE
  6. *
  7. * This file is part of BadVPN.
  8. *
  9. * BadVPN is free software: you can redistribute it and/or modify
  10. * it under the terms of the GNU General Public License version 2
  11. * as published by the Free Software Foundation.
  12. *
  13. * BadVPN is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License along
  19. * with this program; if not, write to the Free Software Foundation, Inc.,
  20. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  21. */
  22. #include <stdlib.h>
  23. #include <string.h>
  24. #include <limits.h>
  25. #include <protocol/dataproto.h>
  26. #include <misc/byteorder.h>
  27. #include <base/BLog.h>
  28. #include <client/DataProto.h>
  29. #include <generated/blog_channel_DataProto.h>
  30. static void monitor_handler (DataProtoSink *o);
  31. static void refresh_up_job (DataProtoSink *o);
  32. static void receive_timer_handler (DataProtoSink *o);
  33. static void notifier_handler (DataProtoSink *o, uint8_t *data, int data_len);
  34. static void up_job_handler (DataProtoSink *o);
  35. static void flow_buffer_free (struct DataProtoFlow_buffer *b);
  36. static void flow_buffer_attach (struct DataProtoFlow_buffer *b, DataProtoSink *sink);
  37. static void flow_buffer_detach (struct DataProtoFlow_buffer *b);
  38. static void flow_buffer_schedule_detach (struct DataProtoFlow_buffer *b);
  39. static void flow_buffer_finish_detach (struct DataProtoFlow_buffer *b);
  40. static void flow_buffer_qflow_handler_busy (struct DataProtoFlow_buffer *b);
  41. void monitor_handler (DataProtoSink *o)
  42. {
  43. DebugObject_Access(&o->d_obj);
  44. // send keep-alive
  45. PacketRecvBlocker_AllowBlockedPacket(&o->ka_blocker);
  46. }
  47. void refresh_up_job (DataProtoSink *o)
  48. {
  49. if (o->up != o->up_report) {
  50. BPending_Set(&o->up_job);
  51. } else {
  52. BPending_Unset(&o->up_job);
  53. }
  54. }
  55. void receive_timer_handler (DataProtoSink *o)
  56. {
  57. DebugObject_Access(&o->d_obj);
  58. // consider down
  59. o->up = 0;
  60. refresh_up_job(o);
  61. }
  62. void notifier_handler (DataProtoSink *o, uint8_t *data, int data_len)
  63. {
  64. DebugObject_Access(&o->d_obj);
  65. ASSERT(data_len >= sizeof(struct dataproto_header))
  66. int flags = 0;
  67. // if we are receiving keepalives, set the flag
  68. if (BTimer_IsRunning(&o->receive_timer)) {
  69. flags |= DATAPROTO_FLAGS_RECEIVING_KEEPALIVES;
  70. }
  71. // modify existing packet here
  72. struct dataproto_header *header = (struct dataproto_header *)data;
  73. header->flags = htol8(flags);
  74. }
  75. void up_job_handler (DataProtoSink *o)
  76. {
  77. DebugObject_Access(&o->d_obj);
  78. ASSERT(o->up != o->up_report)
  79. o->up_report = o->up;
  80. o->handler(o->user, o->up);
  81. return;
  82. }
  83. void source_router_handler (DataProtoSource *o, uint8_t *buf, int recv_len)
  84. {
  85. DebugObject_Access(&o->d_obj);
  86. ASSERT(buf)
  87. ASSERT(recv_len >= 0)
  88. ASSERT(recv_len <= o->frame_mtu)
  89. // remember packet
  90. o->current_buf = buf;
  91. o->current_recv_len = recv_len;
  92. // call handler
  93. o->handler(o->user, buf + DATAPROTO_MAX_OVERHEAD, recv_len);
  94. return;
  95. }
  96. void flow_buffer_free (struct DataProtoFlow_buffer *b)
  97. {
  98. ASSERT(!b->sink)
  99. // free route buffer
  100. RouteBuffer_Free(&b->rbuf);
  101. // free inactivity monitor
  102. if (b->inactivity_time >= 0) {
  103. PacketPassInactivityMonitor_Free(&b->monitor);
  104. }
  105. // free connector
  106. PacketPassConnector_Free(&b->connector);
  107. // free buffer structure
  108. free(b);
  109. }
  110. void flow_buffer_attach (struct DataProtoFlow_buffer *b, DataProtoSink *sink)
  111. {
  112. ASSERT(!b->sink)
  113. // init queue flow
  114. PacketPassFairQueueFlow_Init(&b->sink_qflow, &sink->queue);
  115. // connect to queue flow
  116. PacketPassConnector_ConnectOutput(&b->connector, PacketPassFairQueueFlow_GetInput(&b->sink_qflow));
  117. // set DataProto
  118. b->sink = sink;
  119. }
  120. void flow_buffer_detach (struct DataProtoFlow_buffer *b)
  121. {
  122. ASSERT(b->sink)
  123. PacketPassFairQueueFlow_AssertFree(&b->sink_qflow);
  124. // disconnect from queue flow
  125. PacketPassConnector_DisconnectOutput(&b->connector);
  126. // free queue flow
  127. PacketPassFairQueueFlow_Free(&b->sink_qflow);
  128. // clear reference to this buffer in the sink
  129. if (b->sink->detaching_buffer == b) {
  130. b->sink->detaching_buffer = NULL;
  131. }
  132. // set no DataProto
  133. b->sink = NULL;
  134. }
  135. void flow_buffer_schedule_detach (struct DataProtoFlow_buffer *b)
  136. {
  137. ASSERT(b->sink)
  138. ASSERT(PacketPassFairQueueFlow_IsBusy(&b->sink_qflow))
  139. ASSERT(!b->sink->detaching_buffer || b->sink->detaching_buffer == b)
  140. if (b->sink->detaching_buffer == b) {
  141. return;
  142. }
  143. // request cancel
  144. PacketPassFairQueueFlow_RequestCancel(&b->sink_qflow);
  145. // set busy handler
  146. PacketPassFairQueueFlow_SetBusyHandler(&b->sink_qflow, (PacketPassFairQueue_handler_busy)flow_buffer_qflow_handler_busy, b);
  147. // remember this buffer in the sink so it can handle us if it goes away
  148. b->sink->detaching_buffer = b;
  149. }
  150. void flow_buffer_finish_detach (struct DataProtoFlow_buffer *b)
  151. {
  152. ASSERT(b->sink)
  153. ASSERT(b->sink->detaching_buffer == b)
  154. PacketPassFairQueueFlow_AssertFree(&b->sink_qflow);
  155. // detach
  156. flow_buffer_detach(b);
  157. if (!b->flow) {
  158. // free
  159. flow_buffer_free(b);
  160. } else if (b->flow->sink_desired) {
  161. // attach
  162. flow_buffer_attach(b, b->flow->sink_desired);
  163. }
  164. }
  165. void flow_buffer_qflow_handler_busy (struct DataProtoFlow_buffer *b)
  166. {
  167. ASSERT(b->sink)
  168. ASSERT(b->sink->detaching_buffer == b)
  169. PacketPassFairQueueFlow_AssertFree(&b->sink_qflow);
  170. flow_buffer_finish_detach(b);
  171. }
  172. int DataProtoSink_Init (DataProtoSink *o, BReactor *reactor, PacketPassInterface *output, btime_t keepalive_time, btime_t tolerance_time, DataProtoSink_handler handler, void *user)
  173. {
  174. ASSERT(PacketPassInterface_HasCancel(output))
  175. ASSERT(PacketPassInterface_GetMTU(output) >= DATAPROTO_MAX_OVERHEAD)
  176. // init arguments
  177. o->reactor = reactor;
  178. o->handler = handler;
  179. o->user = user;
  180. // set frame MTU
  181. o->frame_mtu = PacketPassInterface_GetMTU(output) - DATAPROTO_MAX_OVERHEAD;
  182. // init notifier
  183. PacketPassNotifier_Init(&o->notifier, output, BReactor_PendingGroup(o->reactor));
  184. PacketPassNotifier_SetHandler(&o->notifier, (PacketPassNotifier_handler_notify)notifier_handler, o);
  185. // init monitor
  186. PacketPassInactivityMonitor_Init(&o->monitor, PacketPassNotifier_GetInput(&o->notifier), o->reactor, keepalive_time, (PacketPassInactivityMonitor_handler)monitor_handler, o);
  187. PacketPassInactivityMonitor_Force(&o->monitor);
  188. // init queue
  189. if (!PacketPassFairQueue_Init(&o->queue, PacketPassInactivityMonitor_GetInput(&o->monitor), BReactor_PendingGroup(o->reactor), 1, 1)) {
  190. BLog(BLOG_ERROR, "PacketPassFairQueue_Init failed");
  191. goto fail1;
  192. }
  193. // init keepalive queue flow
  194. PacketPassFairQueueFlow_Init(&o->ka_qflow, &o->queue);
  195. // init keepalive source
  196. DataProtoKeepaliveSource_Init(&o->ka_source, BReactor_PendingGroup(o->reactor));
  197. // init keepalive blocker
  198. PacketRecvBlocker_Init(&o->ka_blocker, DataProtoKeepaliveSource_GetOutput(&o->ka_source), BReactor_PendingGroup(o->reactor));
  199. // init keepalive buffer
  200. if (!SinglePacketBuffer_Init(&o->ka_buffer, PacketRecvBlocker_GetOutput(&o->ka_blocker), PacketPassFairQueueFlow_GetInput(&o->ka_qflow), BReactor_PendingGroup(o->reactor))) {
  201. BLog(BLOG_ERROR, "SinglePacketBuffer_Init failed");
  202. goto fail2;
  203. }
  204. // init receive timer
  205. BTimer_Init(&o->receive_timer, tolerance_time, (BTimer_handler)receive_timer_handler, o);
  206. // init handler job
  207. BPending_Init(&o->up_job, BReactor_PendingGroup(o->reactor), (BPending_handler)up_job_handler, o);
  208. // set not up
  209. o->up = 0;
  210. o->up_report = 0;
  211. // set no detaching buffer
  212. o->detaching_buffer = NULL;
  213. DebugCounter_Init(&o->d_ctr);
  214. DebugObject_Init(&o->d_obj);
  215. return 1;
  216. fail2:
  217. PacketRecvBlocker_Free(&o->ka_blocker);
  218. DataProtoKeepaliveSource_Free(&o->ka_source);
  219. PacketPassFairQueueFlow_Free(&o->ka_qflow);
  220. PacketPassFairQueue_Free(&o->queue);
  221. fail1:
  222. PacketPassInactivityMonitor_Free(&o->monitor);
  223. PacketPassNotifier_Free(&o->notifier);
  224. return 0;
  225. }
  226. void DataProtoSink_Free (DataProtoSink *o)
  227. {
  228. DebugObject_Free(&o->d_obj);
  229. DebugCounter_Free(&o->d_ctr);
  230. // allow freeing queue flows
  231. PacketPassFairQueue_PrepareFree(&o->queue);
  232. // release detaching buffer
  233. if (o->detaching_buffer) {
  234. ASSERT(!o->detaching_buffer->flow || o->detaching_buffer->flow->sink_desired != o)
  235. flow_buffer_finish_detach(o->detaching_buffer);
  236. }
  237. // free handler job
  238. BPending_Free(&o->up_job);
  239. // free receive timer
  240. BReactor_RemoveTimer(o->reactor, &o->receive_timer);
  241. // free keepalive buffer
  242. SinglePacketBuffer_Free(&o->ka_buffer);
  243. // free keepalive blocker
  244. PacketRecvBlocker_Free(&o->ka_blocker);
  245. // free keepalive source
  246. DataProtoKeepaliveSource_Free(&o->ka_source);
  247. // free keepalive queue flow
  248. PacketPassFairQueueFlow_Free(&o->ka_qflow);
  249. // free queue
  250. PacketPassFairQueue_Free(&o->queue);
  251. // free monitor
  252. PacketPassInactivityMonitor_Free(&o->monitor);
  253. // free notifier
  254. PacketPassNotifier_Free(&o->notifier);
  255. }
  256. void DataProtoSink_Received (DataProtoSink *o, int peer_receiving)
  257. {
  258. ASSERT(peer_receiving == 0 || peer_receiving == 1)
  259. DebugObject_Access(&o->d_obj);
  260. // reset receive timer
  261. BReactor_SetTimer(o->reactor, &o->receive_timer);
  262. if (!peer_receiving) {
  263. // peer reports not receiving, consider down
  264. o->up = 0;
  265. // send keep-alive to converge faster
  266. PacketRecvBlocker_AllowBlockedPacket(&o->ka_blocker);
  267. } else {
  268. // consider up
  269. o->up = 1;
  270. }
  271. refresh_up_job(o);
  272. }
  273. int DataProtoSource_Init (DataProtoSource *o, PacketRecvInterface *input, DataProtoSource_handler handler, void *user, BReactor *reactor)
  274. {
  275. ASSERT(PacketRecvInterface_GetMTU(input) <= INT_MAX - DATAPROTO_MAX_OVERHEAD)
  276. ASSERT(handler)
  277. // init arguments
  278. o->handler = handler;
  279. o->user = user;
  280. o->reactor = reactor;
  281. // remember frame MTU
  282. o->frame_mtu = PacketRecvInterface_GetMTU(input);
  283. // init router
  284. if (!PacketRouter_Init(&o->router, DATAPROTO_MAX_OVERHEAD + o->frame_mtu, DATAPROTO_MAX_OVERHEAD, input, (PacketRouter_handler)source_router_handler, o, BReactor_PendingGroup(reactor))) {
  285. BLog(BLOG_ERROR, "PacketRouter_Init failed");
  286. goto fail0;
  287. }
  288. DebugCounter_Init(&o->d_ctr);
  289. DebugObject_Init(&o->d_obj);
  290. return 1;
  291. fail0:
  292. return 0;
  293. }
  294. void DataProtoSource_Free (DataProtoSource *o)
  295. {
  296. DebugObject_Free(&o->d_obj);
  297. DebugCounter_Free(&o->d_ctr);
  298. // free router
  299. PacketRouter_Free(&o->router);
  300. }
  301. int DataProtoFlow_Init (DataProtoFlow *o, DataProtoSource *source, peerid_t source_id, peerid_t dest_id, int num_packets, int inactivity_time, void *user,
  302. DataProtoFlow_handler_inactivity handler_inactivity)
  303. {
  304. DebugObject_Access(&source->d_obj);
  305. ASSERT(num_packets > 0)
  306. ASSERT(!(inactivity_time >= 0) || handler_inactivity)
  307. // init arguments
  308. o->source = source;
  309. o->source_id = source_id;
  310. o->dest_id = dest_id;
  311. // set no desired sink
  312. o->sink_desired = NULL;
  313. // allocate buffer structure
  314. struct DataProtoFlow_buffer *b = malloc(sizeof(*b));
  315. if (!b) {
  316. BLog(BLOG_ERROR, "malloc failed");
  317. goto fail0;
  318. }
  319. o->b = b;
  320. // set parent
  321. b->flow = o;
  322. // remember inactivity time
  323. b->inactivity_time = inactivity_time;
  324. // init connector
  325. PacketPassConnector_Init(&b->connector, DATAPROTO_MAX_OVERHEAD + source->frame_mtu, BReactor_PendingGroup(source->reactor));
  326. // init inactivity monitor
  327. PacketPassInterface *buf_out = PacketPassConnector_GetInput(&b->connector);
  328. if (b->inactivity_time >= 0) {
  329. PacketPassInactivityMonitor_Init(&b->monitor, buf_out, source->reactor, b->inactivity_time, handler_inactivity, user);
  330. buf_out = PacketPassInactivityMonitor_GetInput(&b->monitor);
  331. }
  332. // init route buffer
  333. if (!RouteBuffer_Init(&b->rbuf, DATAPROTO_MAX_OVERHEAD + source->frame_mtu, buf_out, num_packets)) {
  334. BLog(BLOG_ERROR, "RouteBuffer_Init failed");
  335. goto fail1;
  336. }
  337. // set no sink
  338. b->sink = NULL;
  339. DebugCounter_Increment(&source->d_ctr);
  340. DebugObject_Init(&o->d_obj);
  341. return 1;
  342. fail1:
  343. if (b->inactivity_time >= 0) {
  344. PacketPassInactivityMonitor_Free(&b->monitor);
  345. }
  346. PacketPassConnector_Free(&b->connector);
  347. free(b);
  348. fail0:
  349. return 0;
  350. }
  351. void DataProtoFlow_Free (DataProtoFlow *o)
  352. {
  353. DebugObject_Free(&o->d_obj);
  354. DebugCounter_Decrement(&o->source->d_ctr);
  355. ASSERT(!o->sink_desired)
  356. struct DataProtoFlow_buffer *b = o->b;
  357. if (b->sink) {
  358. if (PacketPassFairQueueFlow_IsBusy(&b->sink_qflow)) {
  359. // schedule detach, free buffer after detach
  360. flow_buffer_schedule_detach(b);
  361. b->flow = NULL;
  362. // remove inactivity handler
  363. if (b->inactivity_time >= 0) {
  364. PacketPassInactivityMonitor_SetHandler(&b->monitor, NULL, NULL);
  365. }
  366. } else {
  367. // detach and free buffer now
  368. flow_buffer_detach(b);
  369. flow_buffer_free(b);
  370. }
  371. } else {
  372. // free buffer
  373. flow_buffer_free(b);
  374. }
  375. }
  376. void DataProtoFlow_Route (DataProtoFlow *o, int more)
  377. {
  378. DebugObject_Access(&o->d_obj);
  379. PacketRouter_AssertRoute(&o->source->router);
  380. ASSERT(o->source->current_buf)
  381. ASSERT(more == 0 || more == 1)
  382. struct DataProtoFlow_buffer *b = o->b;
  383. // write header
  384. struct dataproto_header *header = (struct dataproto_header *)o->source->current_buf;
  385. // don't set flags, it will be set in notifier_handler
  386. header->from_id = htol16(o->source_id);
  387. header->num_peer_ids = htol16(1);
  388. struct dataproto_peer_id *id = (struct dataproto_peer_id *)(header + 1);
  389. id->id = htol16(o->dest_id);
  390. // route
  391. uint8_t *next_buf;
  392. if (!PacketRouter_Route(&o->source->router, DATAPROTO_MAX_OVERHEAD + o->source->current_recv_len, &b->rbuf,
  393. &next_buf, DATAPROTO_MAX_OVERHEAD, (more ? o->source->current_recv_len : 0)
  394. )) {
  395. BLog(BLOG_NOTICE, "buffer full: %d->%d", (int)o->source_id, (int)o->dest_id);
  396. return;
  397. }
  398. // remember next buffer, or don't allow further routing if more==0
  399. o->source->current_buf = (more ? next_buf : NULL);
  400. }
  401. void DataProtoFlow_Attach (DataProtoFlow *o, DataProtoSink *sink)
  402. {
  403. DebugObject_Access(&o->d_obj);
  404. DebugObject_Access(&sink->d_obj);
  405. ASSERT(!o->sink_desired)
  406. ASSERT(sink)
  407. ASSERT(o->source->frame_mtu <= sink->frame_mtu)
  408. struct DataProtoFlow_buffer *b = o->b;
  409. if (b->sink) {
  410. if (PacketPassFairQueueFlow_IsBusy(&b->sink_qflow)) {
  411. // schedule detach and reattach
  412. flow_buffer_schedule_detach(b);
  413. } else {
  414. // detach and reattach now
  415. flow_buffer_detach(b);
  416. flow_buffer_attach(b, sink);
  417. }
  418. } else {
  419. // attach
  420. flow_buffer_attach(b, sink);
  421. }
  422. // set desired sink
  423. o->sink_desired = sink;
  424. DebugCounter_Increment(&sink->d_ctr);
  425. }
  426. void DataProtoFlow_Detach (DataProtoFlow *o)
  427. {
  428. DebugObject_Access(&o->d_obj);
  429. ASSERT(o->sink_desired)
  430. struct DataProtoFlow_buffer *b = o->b;
  431. ASSERT(b->sink)
  432. DataProtoSink *sink = o->sink_desired;
  433. if (PacketPassFairQueueFlow_IsBusy(&b->sink_qflow)) {
  434. // schedule detach
  435. flow_buffer_schedule_detach(b);
  436. } else {
  437. // detach now
  438. flow_buffer_detach(b);
  439. }
  440. // set no desired sink
  441. o->sink_desired = NULL;
  442. DebugCounter_Decrement(&sink->d_ctr);
  443. }