DataProto.c 16 KB

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