DataProto.c 16 KB

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