bridge.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366
  1. /* $Id: bridge.c 1242 2005-04-09 22:48:33Z aturner $ */
  2. /*
  3. * Copyright (c) 2001-2005 Aaron Turner.
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions
  8. * are met:
  9. *
  10. * 1. Redistributions of source code must retain the above copyright
  11. * notice, this list of conditions and the following disclaimer.
  12. * 2. Redistributions in binary form must reproduce the above copyright
  13. * notice, this list of conditions and the following disclaimer in the
  14. * documentation and/or other materials provided with the distribution.
  15. * 3. Neither the names of the copyright owners nor the names of its
  16. * contributors may be used to endorse or promote products derived from
  17. * this software without specific prior written permission.
  18. *
  19. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
  20. * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  21. * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  22. * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
  23. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  24. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
  25. * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  26. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
  27. * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
  28. * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  29. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  30. */
  31. #include "config.h"
  32. #include "defines.h"
  33. #include "common.h"
  34. #include <sys/time.h>
  35. #include <signal.h>
  36. #include <string.h>
  37. #include <netinet/in.h>
  38. #include <time.h>
  39. #include "tcpbridge.h"
  40. #include "edit_packet.h"
  41. #include "bridge.h"
  42. #include "send_packets.h"
  43. #include "rewrite_l2.h"
  44. extern tcpbridge_opt_t options;
  45. extern struct timeval begin, end;
  46. extern COUNTER bytes_sent, failed, pkts_sent;
  47. extern volatile int didsig;
  48. #ifdef DEBUG
  49. extern int debug;
  50. #endif
  51. static int live_callback(struct live_data_t *,
  52. struct pcap_pkthdr *, const u_char *);
  53. /*
  54. * First, prep our RB Tree which tracks where each (source)
  55. * MAC really lives so we don't create really nasty network
  56. * storms.
  57. */
  58. static struct macsrc_t *new_node(void);
  59. RB_HEAD(macsrc_tree, macsrc_t) macsrc_root;
  60. static int
  61. rbmacsrc_comp(struct macsrc_t *a, struct macsrc_t *b)
  62. {
  63. return (memcmp(a->key, b->key, ETHER_ADDR_LEN));
  64. }
  65. RB_PROTOTYPE(macsrc_tree, macsrc_t, node, rbmacsrc_comp)
  66. RB_GENERATE(macsrc_tree, macsrc_t, node, rbmacsrc_comp)
  67. void
  68. rbinit(void)
  69. {
  70. RB_INIT(&macsrc_root);
  71. }
  72. struct macsrc_t *
  73. new_node(void)
  74. {
  75. struct macsrc_t *node;
  76. node = (struct macsrc_t *)safe_malloc(sizeof(struct macsrc_t));
  77. memset(node, '\0', sizeof(struct macsrc_t));
  78. return (node);
  79. }
  80. /*
  81. * main loop for bridging mode
  82. */
  83. void
  84. do_bridge(pcap_t * pcap1, pcap_t * pcap2)
  85. {
  86. struct pollfd polls[2]; /* one for left & right pcap */
  87. int pollresult = 0;
  88. u_char source1 = PCAP_INT1;
  89. u_char source2 = PCAP_INT2;
  90. struct live_data_t livedata;
  91. /* define polls */
  92. polls[PCAP_INT1].fd = pcap_fileno(pcap1);
  93. polls[PCAP_INT2].fd = pcap_fileno(pcap2);
  94. polls[PCAP_INT1].events = POLLIN | POLLPRI;
  95. polls[PCAP_INT2].events = POLLIN | POLLPRI;
  96. polls[PCAP_INT1].revents = 0;
  97. polls[PCAP_INT2].revents = 0;
  98. /* register signals */
  99. didsig = 0;
  100. (void)signal(SIGINT, catcher);
  101. /*
  102. * loop until ctrl-C or we've sent enough packets
  103. * note that if -L wasn't specified, limit_send is
  104. * set to 0 so this will loop infinately
  105. */
  106. while ((options.limit_send == 0) || (options.limit_send != pkts_sent)) {
  107. if (didsig) {
  108. packet_stats(&begin, &end, bytes_sent, pkts_sent, failed);
  109. exit(1);
  110. }
  111. dbg(1, "limit_send: " COUNTER_SPEC " \t pkts_sent: " COUNTER_SPEC,
  112. options.limit_send, pkts_sent);
  113. /* poll for a packet on the two interfaces */
  114. pollresult = poll(polls, 2, options.poll_timeout);
  115. /* poll has returned, process the result */
  116. if (pollresult > 0) {
  117. /* success, got one or more packets */
  118. if (polls[PCAP_INT1].revents > 0) {
  119. dbg(2, "Processing first interface");
  120. livedata.source = source1;
  121. livedata.pcap = pcap1;
  122. pcap_dispatch(pcap1, -1, (pcap_handler) live_callback,
  123. (u_char *) & livedata);
  124. }
  125. /* check the other interface */
  126. if (polls[PCAP_INT2].revents > 0) {
  127. dbg(2, "Processing second interface");
  128. livedata.source = source2;
  129. livedata.pcap = pcap2;
  130. pcap_dispatch(pcap2, -1, (pcap_handler) live_callback,
  131. (u_char *) & livedata);
  132. }
  133. }
  134. else if (pollresult == 0) {
  135. dbg(3, "poll timeout exceeded...");
  136. /* do something here? */
  137. }
  138. else {
  139. /* poll error, probably a Ctrl-C */
  140. warnx("poll() error: %s", strerror(errno));
  141. }
  142. /* reset the result codes */
  143. polls[PCAP_INT1].revents = 0;
  144. polls[PCAP_INT2].revents = 0;
  145. /* go back to the top of the loop */
  146. }
  147. } /* do_bridge() */
  148. /*
  149. * This is the callback we use with pcap_dispatch to process
  150. * each packet recieved by libpcap on the two interfaces.
  151. */
  152. static int
  153. live_callback(struct live_data_t *livedata, struct pcap_pkthdr *pkthdr,
  154. const u_char * nextpkt)
  155. {
  156. ip_hdr_t *ip_hdr = NULL;
  157. libnet_t *l = NULL;
  158. u_char *pktdata = NULL; /* full packet buffer */
  159. #ifdef FORCE_ALIGN
  160. u_char *ipbuff = NULL; /* IP header and above buffer */
  161. #endif
  162. static int first_time = 1;
  163. int ret, newl2len, cache_mode;
  164. static unsigned long packetnum = 0;
  165. struct macsrc_t *node, finder; /* rb tree nodes */
  166. #ifdef DEBUG
  167. u_char dstmac[ETHER_ADDR_LEN];
  168. #endif
  169. packetnum++;
  170. dbg(2, "packet %d caplen %d", packetnum, pkthdr->caplen);
  171. /* only malloc the first time */
  172. if (first_time) {
  173. /* create packet buffers */
  174. pktdata = (u_char *)safe_malloc(MAXPACKET);
  175. #ifdef FORCE_ALIGN
  176. ipbuff = (u_char *)safe_malloc(MAXPACKET);
  177. #endif
  178. first_time = 0;
  179. } else {
  180. /* zero out the old packet info */
  181. memset(pktdata, '\0', MAXPACKET);
  182. #ifdef FORCE_ALIGN
  183. memset(ipbuff, '\0', MAXPACKET);
  184. #endif
  185. }
  186. /* lookup our source MAC in the tree */
  187. memcpy(&finder.key, &pktdata[ETHER_ADDR_LEN], ETHER_ADDR_LEN);
  188. #ifdef DEBUG
  189. memcpy(&dstmac, pktdata, ETHER_ADDR_LEN);
  190. dbg(1, "Source MAC: " MAC_FORMAT "\tDestin MAC: " MAC_FORMAT,
  191. MAC_STR(finder.key), MAC_STR(dstmac));
  192. #endif
  193. /* first, is this a packet sent locally? If so, ignore it */
  194. if ((memcmp(libnet_get_hwaddr(options.send1), &finder.key,
  195. ETHER_ADDR_LEN)) == 0) {
  196. dbg(1, "Packet matches the MAC of %s, skipping.", options.intf1);
  197. return (1);
  198. }
  199. else if ((memcmp(libnet_get_hwaddr(options.send2), &finder.key,
  200. ETHER_ADDR_LEN)) == 0) {
  201. dbg(1, "Packet matches the MAC of %s, skipping.", options.intf2);
  202. return (1);
  203. }
  204. node = RB_FIND(macsrc_tree, &macsrc_root, &finder);
  205. /* if we can't find the node, build a new one */
  206. if (node == NULL) {
  207. dbg(1, "Unable to find MAC in the tree");
  208. node = new_node();
  209. node->source = livedata->source;
  210. memcpy(&node->key, &finder.key, ETHER_ADDR_LEN);
  211. RB_INSERT(macsrc_tree, &macsrc_root, node);
  212. } /* otherwise compare sources */
  213. else if (node->source != livedata->source) {
  214. dbg(1,
  215. "Found the MAC and we had a source missmatch... skipping packet");
  216. /*
  217. * IMPORTANT!!!
  218. * Never send a packet out the same interface we sourced it on!
  219. */
  220. return (1);
  221. }
  222. /* what is our cache mode? */
  223. cache_mode = livedata->source == PCAP_INT1 ? CACHE_PRIMARY : CACHE_SECONDARY;
  224. /* Rewrite any Layer 2 data and copy the data to our local buffer */
  225. if ((newl2len = rewrite_l2(livedata->pcap, &pkthdr, pktdata, cache_mode))
  226. == 0) {
  227. warnx("Error rewriting layer 2 data... skipping packet %d", packetnum);
  228. return (1);
  229. }
  230. /*
  231. * send packets out the OTHER interface
  232. * and update the dst mac if necessary
  233. */
  234. if (node->source == PCAP_INT1) {
  235. dbg(2, "Packet source was %s... sending out on %s", options.intf1,
  236. options.intf2);
  237. l = options.send2;
  238. }
  239. else if (node->source == PCAP_INT2) {
  240. dbg(2, "Packet source was %s... sending out on %s", options.intf2,
  241. options.intf1);
  242. l = options.send1;
  243. } else {
  244. errx(1, "wtf? our node->source != PCAP_INT1 and != PCAP_INT2: %c",
  245. node->source);
  246. }
  247. if (get_l2protocol(nextpkt, pkthdr->caplen, livedata->linktype)
  248. == ETHERTYPE_IP) {
  249. dbg(3, "Packet is IP");
  250. #ifdef FORCE_ALIGN
  251. /*
  252. * copy layer 3 and up to our temp packet buffer
  253. * for now on, we have to edit the packetbuff because
  254. * just before we send the packet, we copy the packetbuff
  255. * back onto the pkt.data + newl2len buffer
  256. * we do all this work to prevent byte alignment issues
  257. */
  258. ip_hdr = (ip_hdr_t *) ipbuff;
  259. memcpy(ip_hdr, (&pktdata[newl2len]), pkthdr->caplen - newl2len);
  260. #else
  261. /*
  262. * on non-strict byte align systems, don't need to memcpy(),
  263. * just point to 14 bytes into the existing buffer
  264. */
  265. ip_hdr = (ip_hdr_t *) (&pktdata[newl2len]);
  266. #endif
  267. /* look for include or exclude CIDR match */
  268. if (options.xX.cidr != NULL) {
  269. if (!process_xX_by_cidr(options.xX.mode, options.xX.cidr, ip_hdr)) {
  270. return (1);
  271. }
  272. }
  273. }
  274. else {
  275. dbg(3, "Packet is not IP");
  276. /* non-IP packets have a NULL ip_hdr struct */
  277. ip_hdr = NULL;
  278. }
  279. #ifdef STRICT_ALIGN
  280. /*
  281. * put back the layer 3 and above back in the pkt.data buffer
  282. * we can't edit the packet at layer 3 or above beyond this point
  283. */
  284. memcpy(&pktdata[newl2len], ip_hdr, pkthdr->caplen - newl2len);
  285. #endif
  286. /*
  287. * write packet out on the network
  288. */
  289. do {
  290. ret = libnet_adv_write_link(l, pktdata, pkthdr->caplen);
  291. if (ret == -1) {
  292. /* Make note of failed writes due to full buffers */
  293. if (errno == ENOBUFS) {
  294. failed++;
  295. }
  296. else {
  297. errx(1, "libnet_adv_write_link(): %s", strerror(errno));
  298. }
  299. }
  300. } while (ret == -1 && !didsig);
  301. bytes_sent += pkthdr->caplen;
  302. pkts_sent++;
  303. dbg(1, "Sent packet " COUNTER_SPEC, pkts_sent);
  304. return (1);
  305. } /* live_callback() */
  306. /*
  307. Local Variables:
  308. mode:c
  309. indent-tabs-mode:nil
  310. c-basic-offset:4
  311. End:
  312. */