reassembly.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775
  1. /*
  2. * IPv6 fragment reassembly
  3. * Linux INET6 implementation
  4. *
  5. * Authors:
  6. * Pedro Roque <roque@di.fc.ul.pt>
  7. *
  8. * $Id: reassembly.c,v 1.26 2001/03/07 22:00:57 davem Exp $
  9. *
  10. * Based on: net/ipv4/ip_fragment.c
  11. *
  12. * This program is free software; you can redistribute it and/or
  13. * modify it under the terms of the GNU General Public License
  14. * as published by the Free Software Foundation; either version
  15. * 2 of the License, or (at your option) any later version.
  16. */
  17. /*
  18. * Fixes:
  19. * Andi Kleen Make it work with multiple hosts.
  20. * More RFC compliance.
  21. *
  22. * Horst von Brand Add missing #include <linux/string.h>
  23. * Alexey Kuznetsov SMP races, threading, cleanup.
  24. * Patrick McHardy LRU queue of frag heads for evictor.
  25. * Mitsuru KANDA @USAGI Register inet6_protocol{}.
  26. * David Stevens and
  27. * YOSHIFUJI,H. @USAGI Always remove fragment header to
  28. * calculate ICV correctly.
  29. */
  30. #include <linux/errno.h>
  31. #include <linux/types.h>
  32. #include <linux/string.h>
  33. #include <linux/socket.h>
  34. #include <linux/sockios.h>
  35. #include <linux/jiffies.h>
  36. #include <linux/net.h>
  37. #include <linux/list.h>
  38. #include <linux/netdevice.h>
  39. #include <linux/in6.h>
  40. #include <linux/ipv6.h>
  41. #include <linux/icmpv6.h>
  42. #include <linux/random.h>
  43. #include <linux/jhash.h>
  44. #include <linux/skbuff.h>
  45. #include <net/sock.h>
  46. #include <net/snmp.h>
  47. #include <net/ipv6.h>
  48. #include <net/ip6_route.h>
  49. #include <net/protocol.h>
  50. #include <net/transp_v6.h>
  51. #include <net/rawv6.h>
  52. #include <net/ndisc.h>
  53. #include <net/addrconf.h>
  54. #include <net/inet_frag.h>
  55. struct ip6frag_skb_cb
  56. {
  57. struct inet6_skb_parm h;
  58. int offset;
  59. };
  60. #define FRAG6_CB(skb) ((struct ip6frag_skb_cb*)((skb)->cb))
  61. /*
  62. * Equivalent of ipv4 struct ipq
  63. */
  64. struct frag_queue
  65. {
  66. struct inet_frag_queue q;
  67. __be32 id; /* fragment id */
  68. struct in6_addr saddr;
  69. struct in6_addr daddr;
  70. int iif;
  71. unsigned int csum;
  72. __u16 nhoffset;
  73. };
  74. static struct inet_frags ip6_frags;
  75. int ip6_frag_nqueues(struct net *net)
  76. {
  77. return net->ipv6.frags.nqueues;
  78. }
  79. int ip6_frag_mem(struct net *net)
  80. {
  81. return atomic_read(&net->ipv6.frags.mem);
  82. }
  83. static int ip6_frag_reasm(struct frag_queue *fq, struct sk_buff *prev,
  84. struct net_device *dev);
  85. /*
  86. * callers should be careful not to use the hash value outside the ipfrag_lock
  87. * as doing so could race with ipfrag_hash_rnd being recalculated.
  88. */
  89. static unsigned int ip6qhashfn(__be32 id, struct in6_addr *saddr,
  90. struct in6_addr *daddr)
  91. {
  92. u32 a, b, c;
  93. a = (__force u32)saddr->s6_addr32[0];
  94. b = (__force u32)saddr->s6_addr32[1];
  95. c = (__force u32)saddr->s6_addr32[2];
  96. a += JHASH_GOLDEN_RATIO;
  97. b += JHASH_GOLDEN_RATIO;
  98. c += ip6_frags.rnd;
  99. __jhash_mix(a, b, c);
  100. a += (__force u32)saddr->s6_addr32[3];
  101. b += (__force u32)daddr->s6_addr32[0];
  102. c += (__force u32)daddr->s6_addr32[1];
  103. __jhash_mix(a, b, c);
  104. a += (__force u32)daddr->s6_addr32[2];
  105. b += (__force u32)daddr->s6_addr32[3];
  106. c += (__force u32)id;
  107. __jhash_mix(a, b, c);
  108. return c & (INETFRAGS_HASHSZ - 1);
  109. }
  110. static unsigned int ip6_hashfn(struct inet_frag_queue *q)
  111. {
  112. struct frag_queue *fq;
  113. fq = container_of(q, struct frag_queue, q);
  114. return ip6qhashfn(fq->id, &fq->saddr, &fq->daddr);
  115. }
  116. int ip6_frag_match(struct inet_frag_queue *q, void *a)
  117. {
  118. struct frag_queue *fq;
  119. struct ip6_create_arg *arg = a;
  120. fq = container_of(q, struct frag_queue, q);
  121. return (fq->id == arg->id &&
  122. ipv6_addr_equal(&fq->saddr, arg->src) &&
  123. ipv6_addr_equal(&fq->daddr, arg->dst));
  124. }
  125. EXPORT_SYMBOL(ip6_frag_match);
  126. /* Memory Tracking Functions. */
  127. static inline void frag_kfree_skb(struct netns_frags *nf,
  128. struct sk_buff *skb, int *work)
  129. {
  130. if (work)
  131. *work -= skb->truesize;
  132. atomic_sub(skb->truesize, &nf->mem);
  133. kfree_skb(skb);
  134. }
  135. void ip6_frag_init(struct inet_frag_queue *q, void *a)
  136. {
  137. struct frag_queue *fq = container_of(q, struct frag_queue, q);
  138. struct ip6_create_arg *arg = a;
  139. fq->id = arg->id;
  140. ipv6_addr_copy(&fq->saddr, arg->src);
  141. ipv6_addr_copy(&fq->daddr, arg->dst);
  142. }
  143. EXPORT_SYMBOL(ip6_frag_init);
  144. /* Destruction primitives. */
  145. static __inline__ void fq_put(struct frag_queue *fq)
  146. {
  147. inet_frag_put(&fq->q, &ip6_frags);
  148. }
  149. /* Kill fq entry. It is not destroyed immediately,
  150. * because caller (and someone more) holds reference count.
  151. */
  152. static __inline__ void fq_kill(struct frag_queue *fq)
  153. {
  154. inet_frag_kill(&fq->q, &ip6_frags);
  155. }
  156. static void ip6_evictor(struct net *net, struct inet6_dev *idev)
  157. {
  158. int evicted;
  159. evicted = inet_frag_evictor(&net->ipv6.frags, &ip6_frags);
  160. if (evicted)
  161. IP6_ADD_STATS_BH(idev, IPSTATS_MIB_REASMFAILS, evicted);
  162. }
  163. static void ip6_frag_expire(unsigned long data)
  164. {
  165. struct frag_queue *fq;
  166. struct net_device *dev = NULL;
  167. struct net *net;
  168. fq = container_of((struct inet_frag_queue *)data, struct frag_queue, q);
  169. spin_lock(&fq->q.lock);
  170. if (fq->q.last_in & INET_FRAG_COMPLETE)
  171. goto out;
  172. fq_kill(fq);
  173. net = container_of(fq->q.net, struct net, ipv6.frags);
  174. dev = dev_get_by_index(net, fq->iif);
  175. if (!dev)
  176. goto out;
  177. rcu_read_lock();
  178. IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMTIMEOUT);
  179. IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMFAILS);
  180. rcu_read_unlock();
  181. /* Don't send error if the first segment did not arrive. */
  182. if (!(fq->q.last_in & INET_FRAG_FIRST_IN) || !fq->q.fragments)
  183. goto out;
  184. /*
  185. But use as source device on which LAST ARRIVED
  186. segment was received. And do not use fq->dev
  187. pointer directly, device might already disappeared.
  188. */
  189. fq->q.fragments->dev = dev;
  190. icmpv6_send(fq->q.fragments, ICMPV6_TIME_EXCEED, ICMPV6_EXC_FRAGTIME, 0, dev);
  191. out:
  192. if (dev)
  193. dev_put(dev);
  194. spin_unlock(&fq->q.lock);
  195. fq_put(fq);
  196. }
  197. static __inline__ struct frag_queue *
  198. fq_find(struct net *net, __be32 id, struct in6_addr *src, struct in6_addr *dst,
  199. struct inet6_dev *idev)
  200. {
  201. struct inet_frag_queue *q;
  202. struct ip6_create_arg arg;
  203. unsigned int hash;
  204. arg.id = id;
  205. arg.src = src;
  206. arg.dst = dst;
  207. read_lock(&ip6_frags.lock);
  208. hash = ip6qhashfn(id, src, dst);
  209. q = inet_frag_find(&net->ipv6.frags, &ip6_frags, &arg, hash);
  210. if (q == NULL)
  211. goto oom;
  212. return container_of(q, struct frag_queue, q);
  213. oom:
  214. IP6_INC_STATS_BH(idev, IPSTATS_MIB_REASMFAILS);
  215. return NULL;
  216. }
  217. static int ip6_frag_queue(struct frag_queue *fq, struct sk_buff *skb,
  218. struct frag_hdr *fhdr, int nhoff)
  219. {
  220. struct sk_buff *prev, *next;
  221. struct net_device *dev;
  222. int offset, end;
  223. if (fq->q.last_in & INET_FRAG_COMPLETE)
  224. goto err;
  225. offset = ntohs(fhdr->frag_off) & ~0x7;
  226. end = offset + (ntohs(ipv6_hdr(skb)->payload_len) -
  227. ((u8 *)(fhdr + 1) - (u8 *)(ipv6_hdr(skb) + 1)));
  228. if ((unsigned int)end > IPV6_MAXPLEN) {
  229. IP6_INC_STATS_BH(ip6_dst_idev(skb->dst),
  230. IPSTATS_MIB_INHDRERRORS);
  231. icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
  232. ((u8 *)&fhdr->frag_off -
  233. skb_network_header(skb)));
  234. return -1;
  235. }
  236. if (skb->ip_summed == CHECKSUM_COMPLETE) {
  237. const unsigned char *nh = skb_network_header(skb);
  238. skb->csum = csum_sub(skb->csum,
  239. csum_partial(nh, (u8 *)(fhdr + 1) - nh,
  240. 0));
  241. }
  242. /* Is this the final fragment? */
  243. if (!(fhdr->frag_off & htons(IP6_MF))) {
  244. /* If we already have some bits beyond end
  245. * or have different end, the segment is corrupted.
  246. */
  247. if (end < fq->q.len ||
  248. ((fq->q.last_in & INET_FRAG_LAST_IN) && end != fq->q.len))
  249. goto err;
  250. fq->q.last_in |= INET_FRAG_LAST_IN;
  251. fq->q.len = end;
  252. } else {
  253. /* Check if the fragment is rounded to 8 bytes.
  254. * Required by the RFC.
  255. */
  256. if (end & 0x7) {
  257. /* RFC2460 says always send parameter problem in
  258. * this case. -DaveM
  259. */
  260. IP6_INC_STATS_BH(ip6_dst_idev(skb->dst),
  261. IPSTATS_MIB_INHDRERRORS);
  262. icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
  263. offsetof(struct ipv6hdr, payload_len));
  264. return -1;
  265. }
  266. if (end > fq->q.len) {
  267. /* Some bits beyond end -> corruption. */
  268. if (fq->q.last_in & INET_FRAG_LAST_IN)
  269. goto err;
  270. fq->q.len = end;
  271. }
  272. }
  273. if (end == offset)
  274. goto err;
  275. /* Point into the IP datagram 'data' part. */
  276. if (!pskb_pull(skb, (u8 *) (fhdr + 1) - skb->data))
  277. goto err;
  278. if (pskb_trim_rcsum(skb, end - offset))
  279. goto err;
  280. /* Find out which fragments are in front and at the back of us
  281. * in the chain of fragments so far. We must know where to put
  282. * this fragment, right?
  283. */
  284. prev = NULL;
  285. for(next = fq->q.fragments; next != NULL; next = next->next) {
  286. if (FRAG6_CB(next)->offset >= offset)
  287. break; /* bingo! */
  288. prev = next;
  289. }
  290. /* We found where to put this one. Check for overlap with
  291. * preceding fragment, and, if needed, align things so that
  292. * any overlaps are eliminated.
  293. */
  294. if (prev) {
  295. int i = (FRAG6_CB(prev)->offset + prev->len) - offset;
  296. if (i > 0) {
  297. offset += i;
  298. if (end <= offset)
  299. goto err;
  300. if (!pskb_pull(skb, i))
  301. goto err;
  302. if (skb->ip_summed != CHECKSUM_UNNECESSARY)
  303. skb->ip_summed = CHECKSUM_NONE;
  304. }
  305. }
  306. /* Look for overlap with succeeding segments.
  307. * If we can merge fragments, do it.
  308. */
  309. while (next && FRAG6_CB(next)->offset < end) {
  310. int i = end - FRAG6_CB(next)->offset; /* overlap is 'i' bytes */
  311. if (i < next->len) {
  312. /* Eat head of the next overlapped fragment
  313. * and leave the loop. The next ones cannot overlap.
  314. */
  315. if (!pskb_pull(next, i))
  316. goto err;
  317. FRAG6_CB(next)->offset += i; /* next fragment */
  318. fq->q.meat -= i;
  319. if (next->ip_summed != CHECKSUM_UNNECESSARY)
  320. next->ip_summed = CHECKSUM_NONE;
  321. break;
  322. } else {
  323. struct sk_buff *free_it = next;
  324. /* Old fragment is completely overridden with
  325. * new one drop it.
  326. */
  327. next = next->next;
  328. if (prev)
  329. prev->next = next;
  330. else
  331. fq->q.fragments = next;
  332. fq->q.meat -= free_it->len;
  333. frag_kfree_skb(fq->q.net, free_it, NULL);
  334. }
  335. }
  336. FRAG6_CB(skb)->offset = offset;
  337. /* Insert this fragment in the chain of fragments. */
  338. skb->next = next;
  339. if (prev)
  340. prev->next = skb;
  341. else
  342. fq->q.fragments = skb;
  343. dev = skb->dev;
  344. if (dev) {
  345. fq->iif = dev->ifindex;
  346. skb->dev = NULL;
  347. }
  348. fq->q.stamp = skb->tstamp;
  349. fq->q.meat += skb->len;
  350. atomic_add(skb->truesize, &fq->q.net->mem);
  351. /* The first fragment.
  352. * nhoffset is obtained from the first fragment, of course.
  353. */
  354. if (offset == 0) {
  355. fq->nhoffset = nhoff;
  356. fq->q.last_in |= INET_FRAG_FIRST_IN;
  357. }
  358. if (fq->q.last_in == (INET_FRAG_FIRST_IN | INET_FRAG_LAST_IN) &&
  359. fq->q.meat == fq->q.len)
  360. return ip6_frag_reasm(fq, prev, dev);
  361. write_lock(&ip6_frags.lock);
  362. list_move_tail(&fq->q.lru_list, &fq->q.net->lru_list);
  363. write_unlock(&ip6_frags.lock);
  364. return -1;
  365. err:
  366. IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMFAILS);
  367. kfree_skb(skb);
  368. return -1;
  369. }
  370. /*
  371. * Check if this packet is complete.
  372. * Returns NULL on failure by any reason, and pointer
  373. * to current nexthdr field in reassembled frame.
  374. *
  375. * It is called with locked fq, and caller must check that
  376. * queue is eligible for reassembly i.e. it is not COMPLETE,
  377. * the last and the first frames arrived and all the bits are here.
  378. */
  379. static int ip6_frag_reasm(struct frag_queue *fq, struct sk_buff *prev,
  380. struct net_device *dev)
  381. {
  382. struct sk_buff *fp, *head = fq->q.fragments;
  383. int payload_len;
  384. unsigned int nhoff;
  385. fq_kill(fq);
  386. /* Make the one we just received the head. */
  387. if (prev) {
  388. head = prev->next;
  389. fp = skb_clone(head, GFP_ATOMIC);
  390. if (!fp)
  391. goto out_oom;
  392. fp->next = head->next;
  393. prev->next = fp;
  394. skb_morph(head, fq->q.fragments);
  395. head->next = fq->q.fragments->next;
  396. kfree_skb(fq->q.fragments);
  397. fq->q.fragments = head;
  398. }
  399. BUG_TRAP(head != NULL);
  400. BUG_TRAP(FRAG6_CB(head)->offset == 0);
  401. /* Unfragmented part is taken from the first segment. */
  402. payload_len = ((head->data - skb_network_header(head)) -
  403. sizeof(struct ipv6hdr) + fq->q.len -
  404. sizeof(struct frag_hdr));
  405. if (payload_len > IPV6_MAXPLEN)
  406. goto out_oversize;
  407. /* Head of list must not be cloned. */
  408. if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC))
  409. goto out_oom;
  410. /* If the first fragment is fragmented itself, we split
  411. * it to two chunks: the first with data and paged part
  412. * and the second, holding only fragments. */
  413. if (skb_shinfo(head)->frag_list) {
  414. struct sk_buff *clone;
  415. int i, plen = 0;
  416. if ((clone = alloc_skb(0, GFP_ATOMIC)) == NULL)
  417. goto out_oom;
  418. clone->next = head->next;
  419. head->next = clone;
  420. skb_shinfo(clone)->frag_list = skb_shinfo(head)->frag_list;
  421. skb_shinfo(head)->frag_list = NULL;
  422. for (i=0; i<skb_shinfo(head)->nr_frags; i++)
  423. plen += skb_shinfo(head)->frags[i].size;
  424. clone->len = clone->data_len = head->data_len - plen;
  425. head->data_len -= clone->len;
  426. head->len -= clone->len;
  427. clone->csum = 0;
  428. clone->ip_summed = head->ip_summed;
  429. atomic_add(clone->truesize, &fq->q.net->mem);
  430. }
  431. /* We have to remove fragment header from datagram and to relocate
  432. * header in order to calculate ICV correctly. */
  433. nhoff = fq->nhoffset;
  434. skb_network_header(head)[nhoff] = skb_transport_header(head)[0];
  435. memmove(head->head + sizeof(struct frag_hdr), head->head,
  436. (head->data - head->head) - sizeof(struct frag_hdr));
  437. head->mac_header += sizeof(struct frag_hdr);
  438. head->network_header += sizeof(struct frag_hdr);
  439. skb_shinfo(head)->frag_list = head->next;
  440. skb_reset_transport_header(head);
  441. skb_push(head, head->data - skb_network_header(head));
  442. atomic_sub(head->truesize, &fq->q.net->mem);
  443. for (fp=head->next; fp; fp = fp->next) {
  444. head->data_len += fp->len;
  445. head->len += fp->len;
  446. if (head->ip_summed != fp->ip_summed)
  447. head->ip_summed = CHECKSUM_NONE;
  448. else if (head->ip_summed == CHECKSUM_COMPLETE)
  449. head->csum = csum_add(head->csum, fp->csum);
  450. head->truesize += fp->truesize;
  451. atomic_sub(fp->truesize, &fq->q.net->mem);
  452. }
  453. head->next = NULL;
  454. head->dev = dev;
  455. head->tstamp = fq->q.stamp;
  456. ipv6_hdr(head)->payload_len = htons(payload_len);
  457. IP6CB(head)->nhoff = nhoff;
  458. /* Yes, and fold redundant checksum back. 8) */
  459. if (head->ip_summed == CHECKSUM_COMPLETE)
  460. head->csum = csum_partial(skb_network_header(head),
  461. skb_network_header_len(head),
  462. head->csum);
  463. rcu_read_lock();
  464. IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMOKS);
  465. rcu_read_unlock();
  466. fq->q.fragments = NULL;
  467. return 1;
  468. out_oversize:
  469. if (net_ratelimit())
  470. printk(KERN_DEBUG "ip6_frag_reasm: payload len = %d\n", payload_len);
  471. goto out_fail;
  472. out_oom:
  473. if (net_ratelimit())
  474. printk(KERN_DEBUG "ip6_frag_reasm: no memory for reassembly\n");
  475. out_fail:
  476. rcu_read_lock();
  477. IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMFAILS);
  478. rcu_read_unlock();
  479. return -1;
  480. }
  481. static int ipv6_frag_rcv(struct sk_buff *skb)
  482. {
  483. struct frag_hdr *fhdr;
  484. struct frag_queue *fq;
  485. struct ipv6hdr *hdr = ipv6_hdr(skb);
  486. struct net *net;
  487. IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMREQDS);
  488. /* Jumbo payload inhibits frag. header */
  489. if (hdr->payload_len==0) {
  490. IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_INHDRERRORS);
  491. icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
  492. skb_network_header_len(skb));
  493. return -1;
  494. }
  495. if (!pskb_may_pull(skb, (skb_transport_offset(skb) +
  496. sizeof(struct frag_hdr)))) {
  497. IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_INHDRERRORS);
  498. icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
  499. skb_network_header_len(skb));
  500. return -1;
  501. }
  502. hdr = ipv6_hdr(skb);
  503. fhdr = (struct frag_hdr *)skb_transport_header(skb);
  504. if (!(fhdr->frag_off & htons(0xFFF9))) {
  505. /* It is not a fragmented frame */
  506. skb->transport_header += sizeof(struct frag_hdr);
  507. IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMOKS);
  508. IP6CB(skb)->nhoff = (u8 *)fhdr - skb_network_header(skb);
  509. return 1;
  510. }
  511. net = dev_net(skb->dev);
  512. if (atomic_read(&net->ipv6.frags.mem) > net->ipv6.frags.high_thresh)
  513. ip6_evictor(net, ip6_dst_idev(skb->dst));
  514. if ((fq = fq_find(net, fhdr->identification, &hdr->saddr, &hdr->daddr,
  515. ip6_dst_idev(skb->dst))) != NULL) {
  516. int ret;
  517. spin_lock(&fq->q.lock);
  518. ret = ip6_frag_queue(fq, skb, fhdr, IP6CB(skb)->nhoff);
  519. spin_unlock(&fq->q.lock);
  520. fq_put(fq);
  521. return ret;
  522. }
  523. IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMFAILS);
  524. kfree_skb(skb);
  525. return -1;
  526. }
  527. static struct inet6_protocol frag_protocol =
  528. {
  529. .handler = ipv6_frag_rcv,
  530. .flags = INET6_PROTO_NOPOLICY,
  531. };
  532. #ifdef CONFIG_SYSCTL
  533. static struct ctl_table ip6_frags_ctl_table[] = {
  534. {
  535. .ctl_name = NET_IPV6_IP6FRAG_HIGH_THRESH,
  536. .procname = "ip6frag_high_thresh",
  537. .data = &init_net.ipv6.frags.high_thresh,
  538. .maxlen = sizeof(int),
  539. .mode = 0644,
  540. .proc_handler = &proc_dointvec
  541. },
  542. {
  543. .ctl_name = NET_IPV6_IP6FRAG_LOW_THRESH,
  544. .procname = "ip6frag_low_thresh",
  545. .data = &init_net.ipv6.frags.low_thresh,
  546. .maxlen = sizeof(int),
  547. .mode = 0644,
  548. .proc_handler = &proc_dointvec
  549. },
  550. {
  551. .ctl_name = NET_IPV6_IP6FRAG_TIME,
  552. .procname = "ip6frag_time",
  553. .data = &init_net.ipv6.frags.timeout,
  554. .maxlen = sizeof(int),
  555. .mode = 0644,
  556. .proc_handler = &proc_dointvec_jiffies,
  557. .strategy = &sysctl_jiffies,
  558. },
  559. {
  560. .ctl_name = NET_IPV6_IP6FRAG_SECRET_INTERVAL,
  561. .procname = "ip6frag_secret_interval",
  562. .data = &ip6_frags.secret_interval,
  563. .maxlen = sizeof(int),
  564. .mode = 0644,
  565. .proc_handler = &proc_dointvec_jiffies,
  566. .strategy = &sysctl_jiffies
  567. },
  568. { }
  569. };
  570. static int ip6_frags_sysctl_register(struct net *net)
  571. {
  572. struct ctl_table *table;
  573. struct ctl_table_header *hdr;
  574. table = ip6_frags_ctl_table;
  575. if (net != &init_net) {
  576. table = kmemdup(table, sizeof(ip6_frags_ctl_table), GFP_KERNEL);
  577. if (table == NULL)
  578. goto err_alloc;
  579. table[0].data = &net->ipv6.frags.high_thresh;
  580. table[1].data = &net->ipv6.frags.low_thresh;
  581. table[2].data = &net->ipv6.frags.timeout;
  582. table[3].mode &= ~0222;
  583. }
  584. hdr = register_net_sysctl_table(net, net_ipv6_ctl_path, table);
  585. if (hdr == NULL)
  586. goto err_reg;
  587. net->ipv6.sysctl.frags_hdr = hdr;
  588. return 0;
  589. err_reg:
  590. if (net != &init_net)
  591. kfree(table);
  592. err_alloc:
  593. return -ENOMEM;
  594. }
  595. static void ip6_frags_sysctl_unregister(struct net *net)
  596. {
  597. struct ctl_table *table;
  598. table = net->ipv6.sysctl.frags_hdr->ctl_table_arg;
  599. unregister_net_sysctl_table(net->ipv6.sysctl.frags_hdr);
  600. kfree(table);
  601. }
  602. #else
  603. static inline int ip6_frags_sysctl_register(struct net *net)
  604. {
  605. return 0;
  606. }
  607. static inline void ip6_frags_sysctl_unregister(struct net *net)
  608. {
  609. }
  610. #endif
  611. static int ipv6_frags_init_net(struct net *net)
  612. {
  613. net->ipv6.frags.high_thresh = 256 * 1024;
  614. net->ipv6.frags.low_thresh = 192 * 1024;
  615. net->ipv6.frags.timeout = IPV6_FRAG_TIMEOUT;
  616. inet_frags_init_net(&net->ipv6.frags);
  617. return ip6_frags_sysctl_register(net);
  618. }
  619. static void ipv6_frags_exit_net(struct net *net)
  620. {
  621. ip6_frags_sysctl_unregister(net);
  622. inet_frags_exit_net(&net->ipv6.frags, &ip6_frags);
  623. }
  624. static struct pernet_operations ip6_frags_ops = {
  625. .init = ipv6_frags_init_net,
  626. .exit = ipv6_frags_exit_net,
  627. };
  628. int __init ipv6_frag_init(void)
  629. {
  630. int ret;
  631. ret = inet6_add_protocol(&frag_protocol, IPPROTO_FRAGMENT);
  632. if (ret)
  633. goto out;
  634. register_pernet_subsys(&ip6_frags_ops);
  635. ip6_frags.hashfn = ip6_hashfn;
  636. ip6_frags.constructor = ip6_frag_init;
  637. ip6_frags.destructor = NULL;
  638. ip6_frags.skb_free = NULL;
  639. ip6_frags.qsize = sizeof(struct frag_queue);
  640. ip6_frags.match = ip6_frag_match;
  641. ip6_frags.frag_expire = ip6_frag_expire;
  642. ip6_frags.secret_interval = 10 * 60 * HZ;
  643. inet_frags_init(&ip6_frags);
  644. out:
  645. return ret;
  646. }
  647. void ipv6_frag_exit(void)
  648. {
  649. inet_frags_fini(&ip6_frags);
  650. unregister_pernet_subsys(&ip6_frags_ops);
  651. inet6_del_protocol(&frag_protocol, IPPROTO_FRAGMENT);
  652. }