DPReceive.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318
  1. /**
  2. * @file DPReceive.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 <stddef.h>
  23. #include <limits.h>
  24. #include <protocol/dataproto.h>
  25. #include <misc/byteorder.h>
  26. #include <misc/offset.h>
  27. #include <base/BLog.h>
  28. #include <client/DPReceive.h>
  29. #include <generated/blog_channel_DPReceive.h>
  30. static DPReceivePeer * find_peer (DPReceiveDevice *o, peerid_t id)
  31. {
  32. LinkedList2Node *node = LinkedList2_GetFirst(&o->peers_list);
  33. while (node) {
  34. DPReceivePeer *p = UPPER_OBJECT(node, DPReceivePeer, list_node);
  35. if (p->peer_id == id) {
  36. return p;
  37. }
  38. node = LinkedList2Node_Next(node);
  39. }
  40. return NULL;
  41. }
  42. static void receiver_recv_handler_send (DPReceiveReceiver *o, uint8_t *packet, int packet_len)
  43. {
  44. DebugObject_Access(&o->d_obj);
  45. ASSERT(o->peer)
  46. DPReceivePeer *peer = o->peer;
  47. DPReceiveDevice *device = peer->device;
  48. ASSERT(packet_len >= 0)
  49. ASSERT(packet_len <= device->packet_mtu)
  50. uint8_t *data = packet;
  51. int data_len = packet_len;
  52. int local = 0;
  53. DPReceivePeer *src_peer;
  54. DPReceivePeer *relay_dest_peer = NULL;
  55. // check header
  56. if (data_len < sizeof(struct dataproto_header)) {
  57. BLog(BLOG_WARNING, "no dataproto header");
  58. goto out;
  59. }
  60. struct dataproto_header *header = (struct dataproto_header *)data;
  61. data += sizeof(*header);
  62. data_len -= sizeof(*header);
  63. uint8_t flags = ltoh8(header->flags);
  64. peerid_t from_id = ltoh16(header->from_id);
  65. int num_ids = ltoh16(header->num_peer_ids);
  66. // check destination ID
  67. if (!(num_ids == 0 || num_ids == 1)) {
  68. BLog(BLOG_WARNING, "wrong number of destinations");
  69. goto out;
  70. }
  71. peerid_t to_id;
  72. if (num_ids == 1) {
  73. if (data_len < sizeof(to_id)) {
  74. BLog(BLOG_WARNING, "missing destination");
  75. goto out;
  76. }
  77. to_id = ((struct dataproto_peer_id *)data)->id;
  78. data += sizeof(to_id);
  79. data_len -= sizeof(to_id);
  80. }
  81. // check remaining data
  82. if (data_len > device->device_mtu) {
  83. BLog(BLOG_WARNING, "frame too large");
  84. goto out;
  85. }
  86. // inform sink of received packet
  87. if (peer->dp_sink) {
  88. DataProtoSink_Received(peer->dp_sink, !!(flags & DATAPROTO_FLAGS_RECEIVING_KEEPALIVES));
  89. }
  90. if (num_ids == 1) {
  91. // find source peer
  92. if (!(src_peer = find_peer(device, from_id))) {
  93. BLog(BLOG_INFO, "source peer %d not known", (int)from_id);
  94. goto out;
  95. }
  96. // is frame for device or another peer?
  97. if (device->have_peer_id && to_id == device->peer_id) {
  98. // let the frame decider analyze the frame
  99. FrameDeciderPeer_Analyze(src_peer->decider_peer, data, data_len);
  100. // pass frame to device
  101. local = 1;
  102. } else {
  103. // check if relaying is allowed
  104. if (!peer->is_relay_client) {
  105. BLog(BLOG_WARNING, "relaying not allowed");
  106. goto out;
  107. }
  108. // provided source ID must be the peer sending the frame
  109. if (src_peer != peer) {
  110. BLog(BLOG_WARNING, "relay source must be the sending peer");
  111. goto out;
  112. }
  113. // find destination peer
  114. DPReceivePeer *dest_peer = find_peer(device, to_id);
  115. if (!dest_peer) {
  116. BLog(BLOG_INFO, "relay destination peer not known");
  117. goto out;
  118. }
  119. // destination cannot be source
  120. if (dest_peer == src_peer) {
  121. BLog(BLOG_WARNING, "relay destination cannot be the source");
  122. goto out;
  123. }
  124. relay_dest_peer = dest_peer;
  125. }
  126. }
  127. out:
  128. // accept packet
  129. PacketPassInterface_Done(&o->recv_if);
  130. // pass packet to device
  131. if (local) {
  132. o->device->output_func(o->device->output_func_user, data, data_len);
  133. }
  134. // relay frame
  135. if (relay_dest_peer) {
  136. DPRelayRouter_SubmitFrame(&device->relay_router, &src_peer->relay_source, &relay_dest_peer->relay_sink, data, data_len, device->relay_flow_buffer_size, device->relay_flow_inactivity_time);
  137. }
  138. }
  139. int DPReceiveDevice_Init (DPReceiveDevice *o, int device_mtu, DPReceiveDevice_output_func output_func, void *output_func_user, BReactor *reactor, int relay_flow_buffer_size, int relay_flow_inactivity_time)
  140. {
  141. ASSERT(device_mtu >= 0)
  142. ASSERT(device_mtu <= INT_MAX - DATAPROTO_MAX_OVERHEAD)
  143. ASSERT(relay_flow_buffer_size > 0)
  144. // init arguments
  145. o->device_mtu = device_mtu;
  146. o->output_func = output_func;
  147. o->output_func_user = output_func_user;
  148. o->reactor = reactor;
  149. o->relay_flow_buffer_size = relay_flow_buffer_size;
  150. o->relay_flow_inactivity_time = relay_flow_inactivity_time;
  151. // remember packet MTU
  152. o->packet_mtu = DATAPROTO_MAX_OVERHEAD + o->device_mtu;
  153. // init relay router
  154. if (!DPRelayRouter_Init(&o->relay_router, o->device_mtu, o->reactor)) {
  155. BLog(BLOG_ERROR, "DPRelayRouter_Init failed");
  156. goto fail0;
  157. }
  158. // have no peer ID
  159. o->have_peer_id = 0;
  160. // set not freeing
  161. o->freeing = 0;
  162. // init peers list
  163. LinkedList2_Init(&o->peers_list);
  164. DebugObject_Init(&o->d_obj);
  165. return 1;
  166. fail0:
  167. return 0;
  168. }
  169. void DPReceiveDevice_Free (DPReceiveDevice *o)
  170. {
  171. DebugObject_Free(&o->d_obj);
  172. ASSERT(LinkedList2_IsEmpty(&o->peers_list))
  173. // free relay router
  174. DPRelayRouter_Free(&o->relay_router);
  175. }
  176. void DPReceiveDevice_SetPeerID (DPReceiveDevice *o, peerid_t peer_id)
  177. {
  178. DebugObject_Access(&o->d_obj);
  179. // remember peer ID
  180. o->peer_id = peer_id;
  181. o->have_peer_id = 1;
  182. }
  183. void DPReceivePeer_Init (DPReceivePeer *o, DPReceiveDevice *device, peerid_t peer_id, FrameDeciderPeer *decider_peer, int is_relay_client)
  184. {
  185. DebugObject_Access(&device->d_obj);
  186. ASSERT(is_relay_client == 0 || is_relay_client == 1)
  187. // init arguments
  188. o->device = device;
  189. o->peer_id = peer_id;
  190. o->decider_peer = decider_peer;
  191. o->is_relay_client = is_relay_client;
  192. // init relay source
  193. DPRelaySource_Init(&o->relay_source, &device->relay_router, o->peer_id, device->reactor);
  194. // init relay sink
  195. DPRelaySink_Init(&o->relay_sink, o->peer_id);
  196. // have no sink
  197. o->dp_sink = NULL;
  198. // insert to peers list
  199. LinkedList2_Append(&device->peers_list, &o->list_node);
  200. DebugCounter_Init(&o->d_receivers_ctr);
  201. DebugObject_Init(&o->d_obj);
  202. }
  203. void DPReceivePeer_Free (DPReceivePeer *o)
  204. {
  205. DebugObject_Free(&o->d_obj);
  206. DebugCounter_Free(&o->d_receivers_ctr);
  207. ASSERT(!o->dp_sink)
  208. // remove from peers list
  209. LinkedList2_Remove(&o->device->peers_list, &o->list_node);
  210. // free relay sink
  211. DPRelaySink_Free(&o->relay_sink);
  212. // free relay source
  213. DPRelaySource_Free(&o->relay_source);
  214. }
  215. void DPReceivePeer_AttachSink (DPReceivePeer *o, DataProtoSink *dp_sink)
  216. {
  217. DebugObject_Access(&o->d_obj);
  218. ASSERT(!o->dp_sink)
  219. ASSERT(dp_sink)
  220. // attach relay sink
  221. DPRelaySink_Attach(&o->relay_sink, dp_sink);
  222. o->dp_sink = dp_sink;
  223. }
  224. void DPReceivePeer_DetachSink (DPReceivePeer *o)
  225. {
  226. DebugObject_Access(&o->d_obj);
  227. ASSERT(o->dp_sink)
  228. // detach relay sink
  229. DPRelaySink_Detach(&o->relay_sink);
  230. o->dp_sink = NULL;
  231. }
  232. void DPReceiveReceiver_Init (DPReceiveReceiver *o, DPReceivePeer *peer)
  233. {
  234. DebugObject_Access(&peer->d_obj);
  235. DPReceiveDevice *device = peer->device;
  236. // init arguments
  237. o->peer = peer;
  238. // remember device
  239. o->device = device;
  240. // init receive interface
  241. PacketPassInterface_Init(&o->recv_if, device->packet_mtu, (PacketPassInterface_handler_send)receiver_recv_handler_send, o, BReactor_PendingGroup(device->reactor));
  242. DebugCounter_Increment(&peer->d_receivers_ctr);
  243. DebugObject_Init(&o->d_obj);
  244. }
  245. void DPReceiveReceiver_Free (DPReceiveReceiver *o)
  246. {
  247. DebugObject_Free(&o->d_obj);
  248. DebugCounter_Decrement(&o->peer->d_receivers_ctr);
  249. // free receive interface
  250. PacketPassInterface_Free(&o->recv_if);
  251. }
  252. PacketPassInterface * DPReceiveReceiver_GetInput (DPReceiveReceiver *o)
  253. {
  254. DebugObject_Access(&o->d_obj);
  255. return &o->recv_if;
  256. }