reassembly.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657
  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(void)
  76. {
  77. return ip6_frags.nqueues;
  78. }
  79. int ip6_frag_mem(void)
  80. {
  81. return atomic_read(&ip6_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 sk_buff *skb, int *work)
  128. {
  129. if (work)
  130. *work -= skb->truesize;
  131. atomic_sub(skb->truesize, &ip6_frags.mem);
  132. kfree_skb(skb);
  133. }
  134. void ip6_frag_init(struct inet_frag_queue *q, void *a)
  135. {
  136. struct frag_queue *fq = container_of(q, struct frag_queue, q);
  137. struct ip6_create_arg *arg = a;
  138. fq->id = arg->id;
  139. ipv6_addr_copy(&fq->saddr, arg->src);
  140. ipv6_addr_copy(&fq->daddr, arg->dst);
  141. }
  142. EXPORT_SYMBOL(ip6_frag_init);
  143. /* Destruction primitives. */
  144. static __inline__ void fq_put(struct frag_queue *fq)
  145. {
  146. inet_frag_put(&fq->q, &ip6_frags);
  147. }
  148. /* Kill fq entry. It is not destroyed immediately,
  149. * because caller (and someone more) holds reference count.
  150. */
  151. static __inline__ void fq_kill(struct frag_queue *fq)
  152. {
  153. inet_frag_kill(&fq->q, &ip6_frags);
  154. }
  155. static void ip6_evictor(struct inet6_dev *idev)
  156. {
  157. int evicted;
  158. evicted = inet_frag_evictor(&ip6_frags);
  159. if (evicted)
  160. IP6_ADD_STATS_BH(idev, IPSTATS_MIB_REASMFAILS, evicted);
  161. }
  162. static void ip6_frag_expire(unsigned long data)
  163. {
  164. struct frag_queue *fq;
  165. struct net_device *dev = NULL;
  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 & COMPLETE)
  169. goto out;
  170. fq_kill(fq);
  171. dev = dev_get_by_index(&init_net, fq->iif);
  172. if (!dev)
  173. goto out;
  174. rcu_read_lock();
  175. IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMTIMEOUT);
  176. IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMFAILS);
  177. rcu_read_unlock();
  178. /* Don't send error if the first segment did not arrive. */
  179. if (!(fq->q.last_in&FIRST_IN) || !fq->q.fragments)
  180. goto out;
  181. /*
  182. But use as source device on which LAST ARRIVED
  183. segment was received. And do not use fq->dev
  184. pointer directly, device might already disappeared.
  185. */
  186. fq->q.fragments->dev = dev;
  187. icmpv6_send(fq->q.fragments, ICMPV6_TIME_EXCEED, ICMPV6_EXC_FRAGTIME, 0, dev);
  188. out:
  189. if (dev)
  190. dev_put(dev);
  191. spin_unlock(&fq->q.lock);
  192. fq_put(fq);
  193. }
  194. static __inline__ struct frag_queue *
  195. fq_find(__be32 id, struct in6_addr *src, struct in6_addr *dst,
  196. struct inet6_dev *idev)
  197. {
  198. struct inet_frag_queue *q;
  199. struct ip6_create_arg arg;
  200. unsigned int hash;
  201. arg.id = id;
  202. arg.src = src;
  203. arg.dst = dst;
  204. hash = ip6qhashfn(id, src, dst);
  205. q = inet_frag_find(&ip6_frags, &arg, hash);
  206. if (q == NULL)
  207. goto oom;
  208. return container_of(q, struct frag_queue, q);
  209. oom:
  210. IP6_INC_STATS_BH(idev, IPSTATS_MIB_REASMFAILS);
  211. return NULL;
  212. }
  213. static int ip6_frag_queue(struct frag_queue *fq, struct sk_buff *skb,
  214. struct frag_hdr *fhdr, int nhoff)
  215. {
  216. struct sk_buff *prev, *next;
  217. struct net_device *dev;
  218. int offset, end;
  219. if (fq->q.last_in & COMPLETE)
  220. goto err;
  221. offset = ntohs(fhdr->frag_off) & ~0x7;
  222. end = offset + (ntohs(ipv6_hdr(skb)->payload_len) -
  223. ((u8 *)(fhdr + 1) - (u8 *)(ipv6_hdr(skb) + 1)));
  224. if ((unsigned int)end > IPV6_MAXPLEN) {
  225. IP6_INC_STATS_BH(ip6_dst_idev(skb->dst),
  226. IPSTATS_MIB_INHDRERRORS);
  227. icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
  228. ((u8 *)&fhdr->frag_off -
  229. skb_network_header(skb)));
  230. return -1;
  231. }
  232. if (skb->ip_summed == CHECKSUM_COMPLETE) {
  233. const unsigned char *nh = skb_network_header(skb);
  234. skb->csum = csum_sub(skb->csum,
  235. csum_partial(nh, (u8 *)(fhdr + 1) - nh,
  236. 0));
  237. }
  238. /* Is this the final fragment? */
  239. if (!(fhdr->frag_off & htons(IP6_MF))) {
  240. /* If we already have some bits beyond end
  241. * or have different end, the segment is corrupted.
  242. */
  243. if (end < fq->q.len ||
  244. ((fq->q.last_in & LAST_IN) && end != fq->q.len))
  245. goto err;
  246. fq->q.last_in |= LAST_IN;
  247. fq->q.len = end;
  248. } else {
  249. /* Check if the fragment is rounded to 8 bytes.
  250. * Required by the RFC.
  251. */
  252. if (end & 0x7) {
  253. /* RFC2460 says always send parameter problem in
  254. * this case. -DaveM
  255. */
  256. IP6_INC_STATS_BH(ip6_dst_idev(skb->dst),
  257. IPSTATS_MIB_INHDRERRORS);
  258. icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
  259. offsetof(struct ipv6hdr, payload_len));
  260. return -1;
  261. }
  262. if (end > fq->q.len) {
  263. /* Some bits beyond end -> corruption. */
  264. if (fq->q.last_in & LAST_IN)
  265. goto err;
  266. fq->q.len = end;
  267. }
  268. }
  269. if (end == offset)
  270. goto err;
  271. /* Point into the IP datagram 'data' part. */
  272. if (!pskb_pull(skb, (u8 *) (fhdr + 1) - skb->data))
  273. goto err;
  274. if (pskb_trim_rcsum(skb, end - offset))
  275. goto err;
  276. /* Find out which fragments are in front and at the back of us
  277. * in the chain of fragments so far. We must know where to put
  278. * this fragment, right?
  279. */
  280. prev = NULL;
  281. for(next = fq->q.fragments; next != NULL; next = next->next) {
  282. if (FRAG6_CB(next)->offset >= offset)
  283. break; /* bingo! */
  284. prev = next;
  285. }
  286. /* We found where to put this one. Check for overlap with
  287. * preceding fragment, and, if needed, align things so that
  288. * any overlaps are eliminated.
  289. */
  290. if (prev) {
  291. int i = (FRAG6_CB(prev)->offset + prev->len) - offset;
  292. if (i > 0) {
  293. offset += i;
  294. if (end <= offset)
  295. goto err;
  296. if (!pskb_pull(skb, i))
  297. goto err;
  298. if (skb->ip_summed != CHECKSUM_UNNECESSARY)
  299. skb->ip_summed = CHECKSUM_NONE;
  300. }
  301. }
  302. /* Look for overlap with succeeding segments.
  303. * If we can merge fragments, do it.
  304. */
  305. while (next && FRAG6_CB(next)->offset < end) {
  306. int i = end - FRAG6_CB(next)->offset; /* overlap is 'i' bytes */
  307. if (i < next->len) {
  308. /* Eat head of the next overlapped fragment
  309. * and leave the loop. The next ones cannot overlap.
  310. */
  311. if (!pskb_pull(next, i))
  312. goto err;
  313. FRAG6_CB(next)->offset += i; /* next fragment */
  314. fq->q.meat -= i;
  315. if (next->ip_summed != CHECKSUM_UNNECESSARY)
  316. next->ip_summed = CHECKSUM_NONE;
  317. break;
  318. } else {
  319. struct sk_buff *free_it = next;
  320. /* Old fragment is completely overridden with
  321. * new one drop it.
  322. */
  323. next = next->next;
  324. if (prev)
  325. prev->next = next;
  326. else
  327. fq->q.fragments = next;
  328. fq->q.meat -= free_it->len;
  329. frag_kfree_skb(free_it, NULL);
  330. }
  331. }
  332. FRAG6_CB(skb)->offset = offset;
  333. /* Insert this fragment in the chain of fragments. */
  334. skb->next = next;
  335. if (prev)
  336. prev->next = skb;
  337. else
  338. fq->q.fragments = skb;
  339. dev = skb->dev;
  340. if (dev) {
  341. fq->iif = dev->ifindex;
  342. skb->dev = NULL;
  343. }
  344. fq->q.stamp = skb->tstamp;
  345. fq->q.meat += skb->len;
  346. atomic_add(skb->truesize, &ip6_frags.mem);
  347. /* The first fragment.
  348. * nhoffset is obtained from the first fragment, of course.
  349. */
  350. if (offset == 0) {
  351. fq->nhoffset = nhoff;
  352. fq->q.last_in |= FIRST_IN;
  353. }
  354. if (fq->q.last_in == (FIRST_IN | LAST_IN) && fq->q.meat == fq->q.len)
  355. return ip6_frag_reasm(fq, prev, dev);
  356. write_lock(&ip6_frags.lock);
  357. list_move_tail(&fq->q.lru_list, &ip6_frags.lru_list);
  358. write_unlock(&ip6_frags.lock);
  359. return -1;
  360. err:
  361. IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMFAILS);
  362. kfree_skb(skb);
  363. return -1;
  364. }
  365. /*
  366. * Check if this packet is complete.
  367. * Returns NULL on failure by any reason, and pointer
  368. * to current nexthdr field in reassembled frame.
  369. *
  370. * It is called with locked fq, and caller must check that
  371. * queue is eligible for reassembly i.e. it is not COMPLETE,
  372. * the last and the first frames arrived and all the bits are here.
  373. */
  374. static int ip6_frag_reasm(struct frag_queue *fq, struct sk_buff *prev,
  375. struct net_device *dev)
  376. {
  377. struct sk_buff *fp, *head = fq->q.fragments;
  378. int payload_len;
  379. unsigned int nhoff;
  380. fq_kill(fq);
  381. /* Make the one we just received the head. */
  382. if (prev) {
  383. head = prev->next;
  384. fp = skb_clone(head, GFP_ATOMIC);
  385. if (!fp)
  386. goto out_oom;
  387. fp->next = head->next;
  388. prev->next = fp;
  389. skb_morph(head, fq->q.fragments);
  390. head->next = fq->q.fragments->next;
  391. kfree_skb(fq->q.fragments);
  392. fq->q.fragments = head;
  393. }
  394. BUG_TRAP(head != NULL);
  395. BUG_TRAP(FRAG6_CB(head)->offset == 0);
  396. /* Unfragmented part is taken from the first segment. */
  397. payload_len = ((head->data - skb_network_header(head)) -
  398. sizeof(struct ipv6hdr) + fq->q.len -
  399. sizeof(struct frag_hdr));
  400. if (payload_len > IPV6_MAXPLEN)
  401. goto out_oversize;
  402. /* Head of list must not be cloned. */
  403. if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC))
  404. goto out_oom;
  405. /* If the first fragment is fragmented itself, we split
  406. * it to two chunks: the first with data and paged part
  407. * and the second, holding only fragments. */
  408. if (skb_shinfo(head)->frag_list) {
  409. struct sk_buff *clone;
  410. int i, plen = 0;
  411. if ((clone = alloc_skb(0, GFP_ATOMIC)) == NULL)
  412. goto out_oom;
  413. clone->next = head->next;
  414. head->next = clone;
  415. skb_shinfo(clone)->frag_list = skb_shinfo(head)->frag_list;
  416. skb_shinfo(head)->frag_list = NULL;
  417. for (i=0; i<skb_shinfo(head)->nr_frags; i++)
  418. plen += skb_shinfo(head)->frags[i].size;
  419. clone->len = clone->data_len = head->data_len - plen;
  420. head->data_len -= clone->len;
  421. head->len -= clone->len;
  422. clone->csum = 0;
  423. clone->ip_summed = head->ip_summed;
  424. atomic_add(clone->truesize, &ip6_frags.mem);
  425. }
  426. /* We have to remove fragment header from datagram and to relocate
  427. * header in order to calculate ICV correctly. */
  428. nhoff = fq->nhoffset;
  429. skb_network_header(head)[nhoff] = skb_transport_header(head)[0];
  430. memmove(head->head + sizeof(struct frag_hdr), head->head,
  431. (head->data - head->head) - sizeof(struct frag_hdr));
  432. head->mac_header += sizeof(struct frag_hdr);
  433. head->network_header += sizeof(struct frag_hdr);
  434. skb_shinfo(head)->frag_list = head->next;
  435. skb_reset_transport_header(head);
  436. skb_push(head, head->data - skb_network_header(head));
  437. atomic_sub(head->truesize, &ip6_frags.mem);
  438. for (fp=head->next; fp; fp = fp->next) {
  439. head->data_len += fp->len;
  440. head->len += fp->len;
  441. if (head->ip_summed != fp->ip_summed)
  442. head->ip_summed = CHECKSUM_NONE;
  443. else if (head->ip_summed == CHECKSUM_COMPLETE)
  444. head->csum = csum_add(head->csum, fp->csum);
  445. head->truesize += fp->truesize;
  446. atomic_sub(fp->truesize, &ip6_frags.mem);
  447. }
  448. head->next = NULL;
  449. head->dev = dev;
  450. head->tstamp = fq->q.stamp;
  451. ipv6_hdr(head)->payload_len = htons(payload_len);
  452. IP6CB(head)->nhoff = nhoff;
  453. /* Yes, and fold redundant checksum back. 8) */
  454. if (head->ip_summed == CHECKSUM_COMPLETE)
  455. head->csum = csum_partial(skb_network_header(head),
  456. skb_network_header_len(head),
  457. head->csum);
  458. rcu_read_lock();
  459. IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMOKS);
  460. rcu_read_unlock();
  461. fq->q.fragments = NULL;
  462. return 1;
  463. out_oversize:
  464. if (net_ratelimit())
  465. printk(KERN_DEBUG "ip6_frag_reasm: payload len = %d\n", payload_len);
  466. goto out_fail;
  467. out_oom:
  468. if (net_ratelimit())
  469. printk(KERN_DEBUG "ip6_frag_reasm: no memory for reassembly\n");
  470. out_fail:
  471. rcu_read_lock();
  472. IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMFAILS);
  473. rcu_read_unlock();
  474. return -1;
  475. }
  476. static int ipv6_frag_rcv(struct sk_buff *skb)
  477. {
  478. struct frag_hdr *fhdr;
  479. struct frag_queue *fq;
  480. struct ipv6hdr *hdr = ipv6_hdr(skb);
  481. IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMREQDS);
  482. /* Jumbo payload inhibits frag. header */
  483. if (hdr->payload_len==0) {
  484. IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_INHDRERRORS);
  485. icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
  486. skb_network_header_len(skb));
  487. return -1;
  488. }
  489. if (!pskb_may_pull(skb, (skb_transport_offset(skb) +
  490. sizeof(struct frag_hdr)))) {
  491. IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_INHDRERRORS);
  492. icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
  493. skb_network_header_len(skb));
  494. return -1;
  495. }
  496. hdr = ipv6_hdr(skb);
  497. fhdr = (struct frag_hdr *)skb_transport_header(skb);
  498. if (!(fhdr->frag_off & htons(0xFFF9))) {
  499. /* It is not a fragmented frame */
  500. skb->transport_header += sizeof(struct frag_hdr);
  501. IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMOKS);
  502. IP6CB(skb)->nhoff = (u8 *)fhdr - skb_network_header(skb);
  503. return 1;
  504. }
  505. if (atomic_read(&ip6_frags.mem) > init_net.ipv6.sysctl.frags.high_thresh)
  506. ip6_evictor(ip6_dst_idev(skb->dst));
  507. if ((fq = fq_find(fhdr->identification, &hdr->saddr, &hdr->daddr,
  508. ip6_dst_idev(skb->dst))) != NULL) {
  509. int ret;
  510. spin_lock(&fq->q.lock);
  511. ret = ip6_frag_queue(fq, skb, fhdr, IP6CB(skb)->nhoff);
  512. spin_unlock(&fq->q.lock);
  513. fq_put(fq);
  514. return ret;
  515. }
  516. IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMFAILS);
  517. kfree_skb(skb);
  518. return -1;
  519. }
  520. static struct inet6_protocol frag_protocol =
  521. {
  522. .handler = ipv6_frag_rcv,
  523. .flags = INET6_PROTO_NOPOLICY,
  524. };
  525. void ipv6_frag_sysctl_init(struct net *net)
  526. {
  527. ip6_frags.ctl = &net->ipv6.sysctl.frags;
  528. }
  529. int __init ipv6_frag_init(void)
  530. {
  531. int ret;
  532. ret = inet6_add_protocol(&frag_protocol, IPPROTO_FRAGMENT);
  533. if (ret)
  534. goto out;
  535. ip6_frags.hashfn = ip6_hashfn;
  536. ip6_frags.constructor = ip6_frag_init;
  537. ip6_frags.destructor = NULL;
  538. ip6_frags.skb_free = NULL;
  539. ip6_frags.qsize = sizeof(struct frag_queue);
  540. ip6_frags.match = ip6_frag_match;
  541. ip6_frags.frag_expire = ip6_frag_expire;
  542. inet_frags_init(&ip6_frags);
  543. out:
  544. return ret;
  545. }
  546. void ipv6_frag_exit(void)
  547. {
  548. inet_frags_fini(&ip6_frags);
  549. inet6_del_protocol(&frag_protocol, IPPROTO_FRAGMENT);
  550. }