DataProto.c 16 KB

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