demand.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465
  1. /*
  2. * demand.c - Support routines for demand-dialling.
  3. *
  4. * Copyright (c) 1996-2002 Paul Mackerras. 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. *
  13. * 2. The name(s) of the authors of this software must not be used to
  14. * endorse or promote products derived from this software without
  15. * prior written permission.
  16. *
  17. * 3. Redistributions of any form whatsoever must retain the following
  18. * acknowledgment:
  19. * "This product includes software developed by Paul Mackerras
  20. * <paulus@samba.org>".
  21. *
  22. * THE AUTHORS OF THIS SOFTWARE DISCLAIM ALL WARRANTIES WITH REGARD TO
  23. * THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
  24. * AND FITNESS, IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
  25. * SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  26. * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN
  27. * AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
  28. * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  29. */
  30. #include "netif/ppp/ppp_opts.h"
  31. #if PPP_SUPPORT && DEMAND_SUPPORT /* don't build if not configured for use in lwipopts.h */
  32. #include <stdio.h>
  33. #include <stdlib.h>
  34. #include <string.h>
  35. #include <errno.h>
  36. #include <fcntl.h>
  37. #include <netdb.h>
  38. #include <unistd.h>
  39. #include <syslog.h>
  40. #include <sys/param.h>
  41. #include <sys/types.h>
  42. #include <sys/wait.h>
  43. #include <sys/time.h>
  44. #include <sys/resource.h>
  45. #include <sys/stat.h>
  46. #include <sys/socket.h>
  47. #include <netinet/in.h>
  48. #include <arpa/inet.h>
  49. #ifdef PPP_FILTER
  50. #include <pcap-bpf.h>
  51. #endif
  52. #include "netif/ppp/ppp_impl.h"
  53. #include "netif/ppp/fsm.h"
  54. #include "netif/ppp/ipcp.h"
  55. #include "netif/ppp/lcp.h"
  56. char *frame;
  57. int framelen;
  58. int framemax;
  59. int escape_flag;
  60. int flush_flag;
  61. int fcs;
  62. struct packet {
  63. int length;
  64. struct packet *next;
  65. unsigned char data[1];
  66. };
  67. struct packet *pend_q;
  68. struct packet *pend_qtail;
  69. static int active_packet (unsigned char *, int);
  70. /*
  71. * demand_conf - configure the interface for doing dial-on-demand.
  72. */
  73. void
  74. demand_conf()
  75. {
  76. int i;
  77. const struct protent *protp;
  78. /* framemax = lcp_allowoptions[0].mru;
  79. if (framemax < PPP_MRU) */
  80. framemax = PPP_MRU;
  81. framemax += PPP_HDRLEN + PPP_FCSLEN;
  82. frame = malloc(framemax);
  83. if (frame == NULL)
  84. novm("demand frame");
  85. framelen = 0;
  86. pend_q = NULL;
  87. escape_flag = 0;
  88. flush_flag = 0;
  89. fcs = PPP_INITFCS;
  90. netif_set_mtu(pcb, LWIP_MIN(lcp_allowoptions[0].mru, PPP_MRU));
  91. if (ppp_send_config(pcb, PPP_MRU, (u32_t) 0, 0, 0) < 0
  92. || ppp_recv_config(pcb, PPP_MRU, (u32_t) 0, 0, 0) < 0)
  93. fatal("Couldn't set up demand-dialled PPP interface: %m");
  94. #ifdef PPP_FILTER
  95. set_filters(&pass_filter, &active_filter);
  96. #endif
  97. /*
  98. * Call the demand_conf procedure for each protocol that's got one.
  99. */
  100. for (i = 0; (protp = protocols[i]) != NULL; ++i)
  101. if (protp->demand_conf != NULL)
  102. ((*protp->demand_conf)(pcb));
  103. /* FIXME: find a way to die() here */
  104. #if 0
  105. if (!((*protp->demand_conf)(pcb)))
  106. die(1);
  107. #endif
  108. }
  109. /*
  110. * demand_block - set each network protocol to block further packets.
  111. */
  112. void
  113. demand_block()
  114. {
  115. int i;
  116. const struct protent *protp;
  117. for (i = 0; (protp = protocols[i]) != NULL; ++i)
  118. if (protp->demand_conf != NULL)
  119. sifnpmode(pcb, protp->protocol & ~0x8000, NPMODE_QUEUE);
  120. get_loop_output();
  121. }
  122. /*
  123. * demand_discard - set each network protocol to discard packets
  124. * with an error.
  125. */
  126. void
  127. demand_discard()
  128. {
  129. struct packet *pkt, *nextpkt;
  130. int i;
  131. const struct protent *protp;
  132. for (i = 0; (protp = protocols[i]) != NULL; ++i)
  133. if (protp->demand_conf != NULL)
  134. sifnpmode(pcb, protp->protocol & ~0x8000, NPMODE_ERROR);
  135. get_loop_output();
  136. /* discard all saved packets */
  137. for (pkt = pend_q; pkt != NULL; pkt = nextpkt) {
  138. nextpkt = pkt->next;
  139. free(pkt);
  140. }
  141. pend_q = NULL;
  142. framelen = 0;
  143. flush_flag = 0;
  144. escape_flag = 0;
  145. fcs = PPP_INITFCS;
  146. }
  147. /*
  148. * demand_unblock - set each enabled network protocol to pass packets.
  149. */
  150. void
  151. demand_unblock()
  152. {
  153. int i;
  154. const struct protent *protp;
  155. for (i = 0; (protp = protocols[i]) != NULL; ++i)
  156. if (protp->demand_conf != NULL)
  157. sifnpmode(pcb, protp->protocol & ~0x8000, NPMODE_PASS);
  158. }
  159. /*
  160. * FCS lookup table as calculated by genfcstab.
  161. */
  162. static u_short fcstab[256] = {
  163. 0x0000, 0x1189, 0x2312, 0x329b, 0x4624, 0x57ad, 0x6536, 0x74bf,
  164. 0x8c48, 0x9dc1, 0xaf5a, 0xbed3, 0xca6c, 0xdbe5, 0xe97e, 0xf8f7,
  165. 0x1081, 0x0108, 0x3393, 0x221a, 0x56a5, 0x472c, 0x75b7, 0x643e,
  166. 0x9cc9, 0x8d40, 0xbfdb, 0xae52, 0xdaed, 0xcb64, 0xf9ff, 0xe876,
  167. 0x2102, 0x308b, 0x0210, 0x1399, 0x6726, 0x76af, 0x4434, 0x55bd,
  168. 0xad4a, 0xbcc3, 0x8e58, 0x9fd1, 0xeb6e, 0xfae7, 0xc87c, 0xd9f5,
  169. 0x3183, 0x200a, 0x1291, 0x0318, 0x77a7, 0x662e, 0x54b5, 0x453c,
  170. 0xbdcb, 0xac42, 0x9ed9, 0x8f50, 0xfbef, 0xea66, 0xd8fd, 0xc974,
  171. 0x4204, 0x538d, 0x6116, 0x709f, 0x0420, 0x15a9, 0x2732, 0x36bb,
  172. 0xce4c, 0xdfc5, 0xed5e, 0xfcd7, 0x8868, 0x99e1, 0xab7a, 0xbaf3,
  173. 0x5285, 0x430c, 0x7197, 0x601e, 0x14a1, 0x0528, 0x37b3, 0x263a,
  174. 0xdecd, 0xcf44, 0xfddf, 0xec56, 0x98e9, 0x8960, 0xbbfb, 0xaa72,
  175. 0x6306, 0x728f, 0x4014, 0x519d, 0x2522, 0x34ab, 0x0630, 0x17b9,
  176. 0xef4e, 0xfec7, 0xcc5c, 0xddd5, 0xa96a, 0xb8e3, 0x8a78, 0x9bf1,
  177. 0x7387, 0x620e, 0x5095, 0x411c, 0x35a3, 0x242a, 0x16b1, 0x0738,
  178. 0xffcf, 0xee46, 0xdcdd, 0xcd54, 0xb9eb, 0xa862, 0x9af9, 0x8b70,
  179. 0x8408, 0x9581, 0xa71a, 0xb693, 0xc22c, 0xd3a5, 0xe13e, 0xf0b7,
  180. 0x0840, 0x19c9, 0x2b52, 0x3adb, 0x4e64, 0x5fed, 0x6d76, 0x7cff,
  181. 0x9489, 0x8500, 0xb79b, 0xa612, 0xd2ad, 0xc324, 0xf1bf, 0xe036,
  182. 0x18c1, 0x0948, 0x3bd3, 0x2a5a, 0x5ee5, 0x4f6c, 0x7df7, 0x6c7e,
  183. 0xa50a, 0xb483, 0x8618, 0x9791, 0xe32e, 0xf2a7, 0xc03c, 0xd1b5,
  184. 0x2942, 0x38cb, 0x0a50, 0x1bd9, 0x6f66, 0x7eef, 0x4c74, 0x5dfd,
  185. 0xb58b, 0xa402, 0x9699, 0x8710, 0xf3af, 0xe226, 0xd0bd, 0xc134,
  186. 0x39c3, 0x284a, 0x1ad1, 0x0b58, 0x7fe7, 0x6e6e, 0x5cf5, 0x4d7c,
  187. 0xc60c, 0xd785, 0xe51e, 0xf497, 0x8028, 0x91a1, 0xa33a, 0xb2b3,
  188. 0x4a44, 0x5bcd, 0x6956, 0x78df, 0x0c60, 0x1de9, 0x2f72, 0x3efb,
  189. 0xd68d, 0xc704, 0xf59f, 0xe416, 0x90a9, 0x8120, 0xb3bb, 0xa232,
  190. 0x5ac5, 0x4b4c, 0x79d7, 0x685e, 0x1ce1, 0x0d68, 0x3ff3, 0x2e7a,
  191. 0xe70e, 0xf687, 0xc41c, 0xd595, 0xa12a, 0xb0a3, 0x8238, 0x93b1,
  192. 0x6b46, 0x7acf, 0x4854, 0x59dd, 0x2d62, 0x3ceb, 0x0e70, 0x1ff9,
  193. 0xf78f, 0xe606, 0xd49d, 0xc514, 0xb1ab, 0xa022, 0x92b9, 0x8330,
  194. 0x7bc7, 0x6a4e, 0x58d5, 0x495c, 0x3de3, 0x2c6a, 0x1ef1, 0x0f78
  195. };
  196. /*
  197. * loop_chars - process characters received from the loopback.
  198. * Calls loop_frame when a complete frame has been accumulated.
  199. * Return value is 1 if we need to bring up the link, 0 otherwise.
  200. */
  201. int
  202. loop_chars(p, n)
  203. unsigned char *p;
  204. int n;
  205. {
  206. int c, rv;
  207. rv = 0;
  208. /* check for synchronous connection... */
  209. if ( (p[0] == 0xFF) && (p[1] == 0x03) ) {
  210. rv = loop_frame(p,n);
  211. return rv;
  212. }
  213. for (; n > 0; --n) {
  214. c = *p++;
  215. if (c == PPP_FLAG) {
  216. if (!escape_flag && !flush_flag
  217. && framelen > 2 && fcs == PPP_GOODFCS) {
  218. framelen -= 2;
  219. if (loop_frame((unsigned char *)frame, framelen))
  220. rv = 1;
  221. }
  222. framelen = 0;
  223. flush_flag = 0;
  224. escape_flag = 0;
  225. fcs = PPP_INITFCS;
  226. continue;
  227. }
  228. if (flush_flag)
  229. continue;
  230. if (escape_flag) {
  231. c ^= PPP_TRANS;
  232. escape_flag = 0;
  233. } else if (c == PPP_ESCAPE) {
  234. escape_flag = 1;
  235. continue;
  236. }
  237. if (framelen >= framemax) {
  238. flush_flag = 1;
  239. continue;
  240. }
  241. frame[framelen++] = c;
  242. fcs = PPP_FCS(fcs, c);
  243. }
  244. return rv;
  245. }
  246. /*
  247. * loop_frame - given a frame obtained from the loopback,
  248. * decide whether to bring up the link or not, and, if we want
  249. * to transmit this frame later, put it on the pending queue.
  250. * Return value is 1 if we need to bring up the link, 0 otherwise.
  251. * We assume that the kernel driver has already applied the
  252. * pass_filter, so we won't get packets it rejected.
  253. * We apply the active_filter to see if we want this packet to
  254. * bring up the link.
  255. */
  256. int
  257. loop_frame(frame, len)
  258. unsigned char *frame;
  259. int len;
  260. {
  261. struct packet *pkt;
  262. /* dbglog("from loop: %P", frame, len); */
  263. if (len < PPP_HDRLEN)
  264. return 0;
  265. if ((PPP_PROTOCOL(frame) & 0x8000) != 0)
  266. return 0; /* shouldn't get any of these anyway */
  267. if (!active_packet(frame, len))
  268. return 0;
  269. pkt = (struct packet *) malloc(sizeof(struct packet) + len);
  270. if (pkt != NULL) {
  271. pkt->length = len;
  272. pkt->next = NULL;
  273. memcpy(pkt->data, frame, len);
  274. if (pend_q == NULL)
  275. pend_q = pkt;
  276. else
  277. pend_qtail->next = pkt;
  278. pend_qtail = pkt;
  279. }
  280. return 1;
  281. }
  282. /*
  283. * demand_rexmit - Resend all those frames which we got via the
  284. * loopback, now that the real serial link is up.
  285. */
  286. void
  287. demand_rexmit(proto, newip)
  288. int proto;
  289. u32_t newip;
  290. {
  291. struct packet *pkt, *prev, *nextpkt;
  292. unsigned short checksum;
  293. unsigned short pkt_checksum = 0;
  294. unsigned iphdr;
  295. struct timeval tv;
  296. char cv = 0;
  297. char ipstr[16];
  298. prev = NULL;
  299. pkt = pend_q;
  300. pend_q = NULL;
  301. tv.tv_sec = 1;
  302. tv.tv_usec = 0;
  303. select(0,NULL,NULL,NULL,&tv); /* Sleep for 1 Seconds */
  304. for (; pkt != NULL; pkt = nextpkt) {
  305. nextpkt = pkt->next;
  306. if (PPP_PROTOCOL(pkt->data) == proto) {
  307. if ( (proto == PPP_IP) && newip ) {
  308. /* Get old checksum */
  309. iphdr = (pkt->data[4] & 15) << 2;
  310. checksum = *((unsigned short *) (pkt->data+14));
  311. if (checksum == 0xFFFF) {
  312. checksum = 0;
  313. }
  314. if (pkt->data[13] == 17) {
  315. pkt_checksum = *((unsigned short *) (pkt->data+10+iphdr));
  316. if (pkt_checksum) {
  317. cv = 1;
  318. if (pkt_checksum == 0xFFFF) {
  319. pkt_checksum = 0;
  320. }
  321. }
  322. else {
  323. cv = 0;
  324. }
  325. }
  326. if (pkt->data[13] == 6) {
  327. pkt_checksum = *((unsigned short *) (pkt->data+20+iphdr));
  328. cv = 1;
  329. if (pkt_checksum == 0xFFFF) {
  330. pkt_checksum = 0;
  331. }
  332. }
  333. /* Delete old Source-IP-Address */
  334. checksum -= *((unsigned short *) (pkt->data+16)) ^ 0xFFFF;
  335. checksum -= *((unsigned short *) (pkt->data+18)) ^ 0xFFFF;
  336. pkt_checksum -= *((unsigned short *) (pkt->data+16)) ^ 0xFFFF;
  337. pkt_checksum -= *((unsigned short *) (pkt->data+18)) ^ 0xFFFF;
  338. /* Change Source-IP-Address */
  339. * ((u32_t *) (pkt->data + 16)) = newip;
  340. /* Add new Source-IP-Address */
  341. checksum += *((unsigned short *) (pkt->data+16)) ^ 0xFFFF;
  342. checksum += *((unsigned short *) (pkt->data+18)) ^ 0xFFFF;
  343. pkt_checksum += *((unsigned short *) (pkt->data+16)) ^ 0xFFFF;
  344. pkt_checksum += *((unsigned short *) (pkt->data+18)) ^ 0xFFFF;
  345. /* Write new checksum */
  346. if (!checksum) {
  347. checksum = 0xFFFF;
  348. }
  349. *((unsigned short *) (pkt->data+14)) = checksum;
  350. if (pkt->data[13] == 6) {
  351. *((unsigned short *) (pkt->data+20+iphdr)) = pkt_checksum;
  352. }
  353. if (cv && (pkt->data[13] == 17) ) {
  354. *((unsigned short *) (pkt->data+10+iphdr)) = pkt_checksum;
  355. }
  356. /* Log Packet */
  357. strcpy(ipstr,inet_ntoa(*( (struct in_addr *) (pkt->data+16))));
  358. if (pkt->data[13] == 1) {
  359. syslog(LOG_INFO,"Open ICMP %s -> %s\n",
  360. ipstr,
  361. inet_ntoa(*( (struct in_addr *) (pkt->data+20))));
  362. } else {
  363. syslog(LOG_INFO,"Open %s %s:%d -> %s:%d\n",
  364. pkt->data[13] == 6 ? "TCP" : "UDP",
  365. ipstr,
  366. ntohs(*( (short *) (pkt->data+iphdr+4))),
  367. inet_ntoa(*( (struct in_addr *) (pkt->data+20))),
  368. ntohs(*( (short *) (pkt->data+iphdr+6))));
  369. }
  370. }
  371. output(pcb, pkt->data, pkt->length);
  372. free(pkt);
  373. } else {
  374. if (prev == NULL)
  375. pend_q = pkt;
  376. else
  377. prev->next = pkt;
  378. prev = pkt;
  379. }
  380. }
  381. pend_qtail = prev;
  382. if (prev != NULL)
  383. prev->next = NULL;
  384. }
  385. /*
  386. * Scan a packet to decide whether it is an "active" packet,
  387. * that is, whether it is worth bringing up the link for.
  388. */
  389. static int
  390. active_packet(p, len)
  391. unsigned char *p;
  392. int len;
  393. {
  394. int proto, i;
  395. const struct protent *protp;
  396. if (len < PPP_HDRLEN)
  397. return 0;
  398. proto = PPP_PROTOCOL(p);
  399. #ifdef PPP_FILTER
  400. p[0] = 1; /* outbound packet indicator */
  401. if ((pass_filter.bf_len != 0
  402. && bpf_filter(pass_filter.bf_insns, p, len, len) == 0)
  403. || (active_filter.bf_len != 0
  404. && bpf_filter(active_filter.bf_insns, p, len, len) == 0)) {
  405. p[0] = 0xff;
  406. return 0;
  407. }
  408. p[0] = 0xff;
  409. #endif
  410. for (i = 0; (protp = protocols[i]) != NULL; ++i) {
  411. if (protp->protocol < 0xC000 && (protp->protocol & ~0x8000) == proto) {
  412. if (protp->active_pkt == NULL)
  413. return 1;
  414. return (*protp->active_pkt)(p, len);
  415. }
  416. }
  417. return 0; /* not a supported protocol !!?? */
  418. }
  419. #endif /* PPP_SUPPORT && DEMAND_SUPPORT */