reassembly.c 20 KB

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