arp.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515
  1. #include "all.h"
  2. #include "../ip/ip.h"
  3. #define DEBUG if(cons.flags&arpcache.flag)print
  4. #define ORDER 1 /* 1 send last frag first, faster */
  5. typedef struct Arpentry Arpentry;
  6. typedef struct Arpstats Arpstats;
  7. typedef struct Arpe Arpe;
  8. struct Arpe
  9. {
  10. uchar tpa[Pasize];
  11. uchar tha[Easize];
  12. };
  13. static int ipahash(uchar*);
  14. static void cmd_arp(int, char*[]);
  15. static
  16. struct
  17. {
  18. Lock;
  19. uchar null[Pasize];
  20. int start;
  21. int idgen;
  22. ulong flag;
  23. Msgbuf* unresol;
  24. struct
  25. {
  26. int laste;
  27. Arpe arpe[Ne];
  28. } abkt[Nb];
  29. } arpcache;
  30. int
  31. nhgets(uchar *p)
  32. {
  33. return (p[0]<<8) | p[1];
  34. }
  35. long
  36. nhgetl(uchar *p)
  37. {
  38. return (p[0]<<24) | (p[1]<<16) | (p[2]<<8) | p[3];
  39. }
  40. void
  41. hnputs(uchar *p, int x)
  42. {
  43. p[0] = x>>8;
  44. p[1] = x;
  45. }
  46. void
  47. hnputl(uchar *p, long x)
  48. {
  49. p[0] = x>>24;
  50. p[1] = x>>16;
  51. p[2] = x>>8;
  52. p[3] = x;
  53. }
  54. void
  55. arpstart(void)
  56. {
  57. if(arpcache.start == 0) {
  58. lock(&arpcache);
  59. if(arpcache.start == 0) {
  60. cmd_install("arp", "subcommand -- arp protocol", cmd_arp);
  61. arpcache.flag = flag_install("arp", "-- verbose");
  62. arpcache.start = 1;
  63. iprouteinit();
  64. }
  65. unlock(&arpcache);
  66. }
  67. }
  68. void
  69. arpreceive(Enpkt *ep, int l, Ifc *ifc)
  70. {
  71. Ilp* ilp;
  72. Arppkt *p, *q;
  73. Msgbuf *mb, **mbp;
  74. Arpe *a;
  75. uchar *tpa;
  76. int type, i, h;
  77. Timet t;
  78. if(l < Ensize+Arpsize)
  79. return;
  80. p = (Arppkt*)ep;
  81. if(nhgets(p->pro) != Iptype ||
  82. nhgets(p->hrd) != 1 ||
  83. p->pln != Pasize ||
  84. p->hln != Easize)
  85. return;
  86. type = nhgets(p->op);
  87. switch(type) {
  88. case Arprequest:
  89. /* update entry for this source */
  90. h = ipahash(p->spa);
  91. a = arpcache.abkt[h].arpe;
  92. lock(&arpcache);
  93. for(i=0; i<Ne; i++,a++) {
  94. if(memcmp(a->tpa, p->spa, Pasize) == 0) {
  95. memmove(a->tha, p->sha, Easize);
  96. break;
  97. }
  98. }
  99. unlock(&arpcache);
  100. if(memcmp(p->tpa, ifc->ipa, Pasize) != 0)
  101. break;
  102. DEBUG("rcv arp req for %I from %I\n", p->tpa, p->spa);
  103. mb = mballoc(Ensize+Arpsize, 0, Mbarp1);
  104. q = (Arppkt*)mb->data;
  105. memmove(q, p, Ensize+Arpsize);
  106. hnputs(q->op, Arpreply);
  107. memmove(q->tha, p->sha, Easize);
  108. memmove(q->tpa, p->spa, Pasize);
  109. memmove(q->sha, ifc->ea, Easize);
  110. memmove(q->spa, ifc->ipa, Pasize);
  111. memmove(q->d, q->s, Easize);
  112. send(ifc->reply, mb);
  113. break;
  114. case Arpreply:
  115. DEBUG("rcv arp rpl for %I is %E\n", p->spa, p->sha);
  116. h = ipahash(p->spa);
  117. a = arpcache.abkt[h].arpe;
  118. lock(&arpcache);
  119. for(i=0; i<Ne; i++,a++) {
  120. if(memcmp(a->tpa, p->spa, Pasize) == 0) {
  121. memmove(a->tha, p->sha, Easize);
  122. goto out;
  123. }
  124. }
  125. i = arpcache.abkt[h].laste + 1;
  126. if(i < 0 || i >= Ne)
  127. i = 0;
  128. arpcache.abkt[h].laste = i;
  129. a = &arpcache.abkt[h].arpe[i];
  130. memmove(a->tpa, p->spa, Pasize);
  131. memmove(a->tha, p->sha, Easize);
  132. /*
  133. * go thru unresolved queue
  134. */
  135. out:
  136. t = toytime();
  137. mbp = &arpcache.unresol;
  138. for(mb = *mbp; mb; mb = *mbp) {
  139. if(t >= mb->param) {
  140. *mbp = mb->next;
  141. unlock(&arpcache);
  142. mbfree(mb);
  143. lock(&arpcache);
  144. goto out;
  145. }
  146. ilp = mb->chan->pdata;
  147. tpa = ilp->ipgate;
  148. if(memcmp(a->tpa, tpa, Pasize) == 0) {
  149. *mbp = mb->next;
  150. mb->next = 0;
  151. unlock(&arpcache);
  152. ipsend(mb);
  153. lock(&arpcache);
  154. goto out;
  155. }
  156. mbp = &mb->next;
  157. }
  158. unlock(&arpcache);
  159. break;
  160. }
  161. }
  162. static
  163. int
  164. ipahash(uchar *p)
  165. {
  166. ulong h;
  167. h = p[0];
  168. h = h*7 + p[1];
  169. h = h*7 + p[2];
  170. h = h*7 + p[3];
  171. return h%Nb;
  172. }
  173. void
  174. ipsend1(Msgbuf *mb, Ifc *ifc, uchar *ipgate)
  175. {
  176. Msgbuf **mbp, *m;
  177. Ippkt *p;
  178. Arppkt *q;
  179. Arpe *a;
  180. int i, id, len, dlen, off;
  181. Timet t;
  182. p = (Ippkt*)mb->data;
  183. a = arpcache.abkt[ipahash(ipgate)].arpe;
  184. lock(&arpcache);
  185. for(i=0; i<Ne; i++,a++)
  186. if(memcmp(a->tpa, ipgate, Pasize) == 0)
  187. goto found;
  188. /*
  189. * queue ip pkt to be resolved later
  190. */
  191. again:
  192. i = 0; // q length
  193. t = toytime();
  194. mbp = &arpcache.unresol;
  195. for(m = *mbp; m; m = *mbp) {
  196. if(t >= m->param) {
  197. *mbp = m->next;
  198. unlock(&arpcache);
  199. mbfree(m);
  200. lock(&arpcache);
  201. goto again;
  202. }
  203. mbp = &m->next;
  204. i++;
  205. }
  206. if(mb->chan && i < 10) {
  207. mb->param = t + SECOND(10);
  208. mb->next = 0;
  209. *mbp = mb;
  210. unlock(&arpcache);
  211. } else {
  212. unlock(&arpcache);
  213. mbfree(mb);
  214. }
  215. /*
  216. * send an arp request
  217. */
  218. m = mballoc(Ensize+Arpsize, 0, Mbarp2);
  219. q = (Arppkt*)m->data;
  220. DEBUG("snd arp req target %I ip dest %I\n", ipgate, p->dst);
  221. memset(q->d, 0xff, Easize); /* broadcast */
  222. hnputs(q->type, Arptype);
  223. hnputs(q->hrd, 1);
  224. hnputs(q->pro, Iptype);
  225. q->hln = Easize;
  226. q->pln = Pasize;
  227. hnputs(q->op, Arprequest);
  228. memmove(q->sha, ifc->ea, Easize);
  229. memmove(q->spa, ifc->ipa, Pasize);
  230. memset(q->tha, 0, Easize);
  231. memmove(q->tpa, ipgate, Pasize);
  232. send(ifc->reply, m);
  233. return;
  234. found:
  235. len = mb->count; /* includes Ensize+Ipsize+Ilsize */
  236. memmove(p->d, a->tha, Easize);
  237. p->vihl = IP_VER|IP_HLEN;
  238. p->tos = 0;
  239. p->ttl = 255;
  240. id = arpcache.idgen;
  241. if(id == 0)
  242. id = toytime() * 80021;
  243. arpcache.idgen = id+1;
  244. unlock(&arpcache);
  245. hnputs(p->id, id);
  246. hnputs(p->type, Iptype);
  247. /*
  248. * If we dont need to fragment just send it
  249. */
  250. if(len <= ETHERMAXTU) {
  251. hnputs(p->length, len-Ensize);
  252. p->frag[0] = 0;
  253. p->frag[1] = 0;
  254. p->cksum[0] = 0;
  255. p->cksum[1] = 0;
  256. hnputs(p->cksum, ipcsum(&p->vihl));
  257. send(ifc->reply, mb);
  258. return;
  259. }
  260. off = 0;
  261. len -= Ensize+Ipsize; /* just ip data */
  262. while(len > 0) {
  263. dlen = (ETHERMAXTU-(Ensize+Ipsize)) & ~7;
  264. if(dlen > len)
  265. dlen = len;
  266. len -= dlen;
  267. /*
  268. * use first frag in place,
  269. * make copies of subsequent frags
  270. * this saves a copy of a MTU-size buffer
  271. */
  272. if(ORDER && off == 0) {
  273. m = 0;
  274. mb->count = (Ensize+Ipsize)+dlen;
  275. p = (Ippkt*)mb->data;
  276. } else {
  277. m = mballoc((Ensize+Ipsize)+dlen, 0, Mbip1);
  278. p = (Ippkt*)m->data;
  279. memmove(m->data, mb->data, Ensize+Ipsize);
  280. memmove(m->data+(Ensize+Ipsize),
  281. mb->data+(Ensize+Ipsize)+off, dlen);
  282. }
  283. hnputs(p->length, dlen+Ipsize);
  284. if(len == 0)
  285. hnputs(p->frag, off>>3);
  286. else
  287. hnputs(p->frag, (off>>3)|IP_MF);
  288. p->cksum[0] = 0;
  289. p->cksum[1] = 0;
  290. hnputs(p->cksum, ipcsum(&p->vihl));
  291. if(m)
  292. send(ifc->reply, m);
  293. off += dlen;
  294. }
  295. if(ORDER)
  296. send(ifc->reply, mb);
  297. else
  298. mbfree(mb);
  299. }
  300. void
  301. ipsend(Msgbuf *mb)
  302. {
  303. Ilp *ilp;
  304. Chan *cp;
  305. cp = mb->chan;
  306. if(cp == 0) {
  307. print("cp = 0\n");
  308. mbfree(mb);
  309. return;
  310. }
  311. ilp = cp->pdata;
  312. ipsend1(mb, cp->ifc, ilp->ipgate);
  313. }
  314. int
  315. ipforme(uchar addr[Pasize], Ifc *ifc)
  316. {
  317. ulong haddr;
  318. if(memcmp(addr, ifc->ipa, Pasize) == 0)
  319. return 1;
  320. haddr = nhgetl(addr);
  321. /* My subnet broadcast */
  322. if((haddr&ifc->mask) == (ifc->ipaddr&ifc->mask))
  323. return 1;
  324. /* Real ip broadcast */
  325. if(haddr == 0)
  326. return 1;
  327. /* Old style 255.255.255.255 address */
  328. if(haddr == ~0)
  329. return 1;
  330. return 0;
  331. }
  332. /*
  333. * ipcsum - Compute internet header checksums
  334. */
  335. int
  336. ipcsum(uchar *addr)
  337. {
  338. int len;
  339. ulong sum = 0;
  340. len = (addr[0]&0xf) << 2;
  341. while(len > 0) {
  342. sum += (addr[0]<<8) | addr[1] ;
  343. len -= 2;
  344. addr += 2;
  345. }
  346. sum = (sum & 0xffff) + (sum >> 16);
  347. sum = (sum & 0xffff) + (sum >> 16);
  348. return sum^0xffff;
  349. }
  350. /*
  351. * protcol checksum routine
  352. */
  353. static short endian = 1;
  354. static char* aendian = (char*)&endian;
  355. #define LITTLE *aendian
  356. int
  357. ptclcsum(uchar *addr, int len)
  358. {
  359. ulong losum, hisum, mdsum, x;
  360. ulong t1, t2;
  361. losum = 0;
  362. hisum = 0;
  363. mdsum = 0;
  364. x = 0;
  365. if((ulong)addr & 1) {
  366. if(len) {
  367. hisum += addr[0];
  368. len--;
  369. addr++;
  370. }
  371. x = 1;
  372. }
  373. while(len >= 16) {
  374. t1 = *(ushort*)(addr+0);
  375. t2 = *(ushort*)(addr+2); mdsum += t1;
  376. t1 = *(ushort*)(addr+4); mdsum += t2;
  377. t2 = *(ushort*)(addr+6); mdsum += t1;
  378. t1 = *(ushort*)(addr+8); mdsum += t2;
  379. t2 = *(ushort*)(addr+10); mdsum += t1;
  380. t1 = *(ushort*)(addr+12); mdsum += t2;
  381. t2 = *(ushort*)(addr+14); mdsum += t1;
  382. mdsum += t2;
  383. len -= 16;
  384. addr += 16;
  385. }
  386. while(len >= 2) {
  387. mdsum += *(ushort*)addr;
  388. len -= 2;
  389. addr += 2;
  390. }
  391. if(x) {
  392. if(len)
  393. losum += addr[0];
  394. if(LITTLE)
  395. losum += mdsum;
  396. else
  397. hisum += mdsum;
  398. } else {
  399. if(len)
  400. hisum += addr[0];
  401. if(LITTLE)
  402. hisum += mdsum;
  403. else
  404. losum += mdsum;
  405. }
  406. losum += hisum >> 8;
  407. losum += (hisum & 0xff) << 8;
  408. while(hisum = losum>>16)
  409. losum = hisum + (losum & 0xffff);
  410. return ~losum & 0xffff;
  411. }
  412. static
  413. void
  414. cmd_arp(int argc, char *argv[])
  415. {
  416. int h, i, j;
  417. Arpe *a;
  418. if(argc <= 1) {
  419. print("arp flush -- clear cache\n");
  420. print("arp print -- print cache\n");
  421. return;
  422. }
  423. for(i=1; i<argc; i++) {
  424. if(strcmp(argv[i], "flush") == 0) {
  425. lock(&arpcache);
  426. for(h=0; h<Nb; h++)
  427. memset(&arpcache.abkt[h], 0, sizeof(arpcache.abkt[0]));
  428. unlock(&arpcache);
  429. continue;
  430. }
  431. if(strcmp(argv[i], "print") == 0) {
  432. for(h=0; h<Nb; h++) {
  433. a = arpcache.abkt[h].arpe;
  434. for(j=0; j<Ne; j++,a++) {
  435. if(memcmp(arpcache.null, a->tpa, Pasize) == 0)
  436. continue;
  437. print("%-15I %E\n", a->tpa, a->tha);
  438. prflush();
  439. }
  440. }
  441. continue;
  442. }
  443. }
  444. }