2 * IPv6 fragment reassembly
3 * Linux INET6 implementation
6 * Pedro Roque <roque@di.fc.ul.pt>
8 * $Id: reassembly.c,v 1.26 2001/03/07 22:00:57 davem Exp $
10 * Based on: net/ipv4/ip_fragment.c
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.
20 * Andi Kleen Make it work with multiple hosts.
21 * More RFC compliance.
23 * Horst von Brand Add missing #include <linux/string.h>
24 * Alexey Kuznetsov SMP races, threading, cleanup.
25 * Patrick McHardy LRU queue of frag heads for evictor.
26 * Mitsuru KANDA @USAGI Register inet6_protocol{}.
28 * YOSHIFUJI,H. @USAGI Always remove fragment header to
29 * calculate ICV correctly.
31 #include <linux/errno.h>
32 #include <linux/types.h>
33 #include <linux/string.h>
34 #include <linux/socket.h>
35 #include <linux/sockios.h>
36 #include <linux/jiffies.h>
37 #include <linux/net.h>
38 #include <linux/list.h>
39 #include <linux/netdevice.h>
40 #include <linux/in6.h>
41 #include <linux/ipv6.h>
42 #include <linux/icmpv6.h>
43 #include <linux/random.h>
44 #include <linux/jhash.h>
45 #include <linux/skbuff.h>
51 #include <net/ip6_route.h>
52 #include <net/protocol.h>
53 #include <net/transp_v6.h>
54 #include <net/rawv6.h>
55 #include <net/ndisc.h>
56 #include <net/addrconf.h>
57 #include <net/inet_frag.h>
61 struct inet6_skb_parm h;
65 #define FRAG6_CB(skb) ((struct ip6frag_skb_cb*)((skb)->cb))
69 * Equivalent of ipv4 struct ipq
74 struct inet_frag_queue q;
76 __be32 id; /* fragment id */
77 struct in6_addr saddr;
78 struct in6_addr daddr;
85 struct inet_frags_ctl ip6_frags_ctl __read_mostly = {
86 .high_thresh = 256 * 1024,
87 .low_thresh = 192 * 1024,
88 .timeout = IPV6_FRAG_TIMEOUT,
89 .secret_interval = 10 * 60 * HZ,
92 static struct inet_frags ip6_frags;
94 int ip6_frag_nqueues(void)
96 return ip6_frags.nqueues;
99 int ip6_frag_mem(void)
101 return atomic_read(&ip6_frags.mem);
104 static int ip6_frag_reasm(struct frag_queue *fq, struct sk_buff *prev,
105 struct net_device *dev);
108 * callers should be careful not to use the hash value outside the ipfrag_lock
109 * as doing so could race with ipfrag_hash_rnd being recalculated.
111 static unsigned int ip6qhashfn(__be32 id, struct in6_addr *saddr,
112 struct in6_addr *daddr)
116 a = (__force u32)saddr->s6_addr32[0];
117 b = (__force u32)saddr->s6_addr32[1];
118 c = (__force u32)saddr->s6_addr32[2];
120 a += JHASH_GOLDEN_RATIO;
121 b += JHASH_GOLDEN_RATIO;
123 __jhash_mix(a, b, c);
125 a += (__force u32)saddr->s6_addr32[3];
126 b += (__force u32)daddr->s6_addr32[0];
127 c += (__force u32)daddr->s6_addr32[1];
128 __jhash_mix(a, b, c);
130 a += (__force u32)daddr->s6_addr32[2];
131 b += (__force u32)daddr->s6_addr32[3];
132 c += (__force u32)id;
133 __jhash_mix(a, b, c);
135 return c & (INETFRAGS_HASHSZ - 1);
138 static unsigned int ip6_hashfn(struct inet_frag_queue *q)
140 struct frag_queue *fq;
142 fq = container_of(q, struct frag_queue, q);
143 return ip6qhashfn(fq->id, &fq->saddr, &fq->daddr);
146 int ip6_frag_equal(struct inet_frag_queue *q1, struct inet_frag_queue *q2)
148 struct frag_queue *fq1, *fq2;
150 fq1 = container_of(q1, struct frag_queue, q);
151 fq2 = container_of(q2, struct frag_queue, q);
152 return (fq1->id == fq2->id &&
153 ipv6_addr_equal(&fq2->saddr, &fq1->saddr) &&
154 ipv6_addr_equal(&fq2->daddr, &fq1->daddr));
156 EXPORT_SYMBOL(ip6_frag_equal);
158 /* Memory Tracking Functions. */
159 static inline void frag_kfree_skb(struct sk_buff *skb, int *work)
162 *work -= skb->truesize;
163 atomic_sub(skb->truesize, &ip6_frags.mem);
167 static void ip6_frag_free(struct inet_frag_queue *fq)
169 kfree(container_of(fq, struct frag_queue, q));
172 static inline struct frag_queue *frag_alloc_queue(void)
174 struct frag_queue *fq = kzalloc(sizeof(struct frag_queue), GFP_ATOMIC);
178 atomic_add(sizeof(struct frag_queue), &ip6_frags.mem);
182 /* Destruction primitives. */
184 static __inline__ void fq_put(struct frag_queue *fq)
186 inet_frag_put(&fq->q, &ip6_frags);
189 /* Kill fq entry. It is not destroyed immediately,
190 * because caller (and someone more) holds reference count.
192 static __inline__ void fq_kill(struct frag_queue *fq)
194 inet_frag_kill(&fq->q, &ip6_frags);
197 static void ip6_evictor(struct inet6_dev *idev)
201 evicted = inet_frag_evictor(&ip6_frags);
203 IP6_ADD_STATS_BH(idev, IPSTATS_MIB_REASMFAILS, evicted);
206 static void ip6_frag_expire(unsigned long data)
208 struct frag_queue *fq = (struct frag_queue *) data;
209 struct net_device *dev = NULL;
211 spin_lock(&fq->q.lock);
213 if (fq->q.last_in & COMPLETE)
218 dev = dev_get_by_index(&init_net, fq->iif);
223 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMTIMEOUT);
224 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMFAILS);
227 /* Don't send error if the first segment did not arrive. */
228 if (!(fq->q.last_in&FIRST_IN) || !fq->q.fragments)
232 But use as source device on which LAST ARRIVED
233 segment was received. And do not use fq->dev
234 pointer directly, device might already disappeared.
236 fq->q.fragments->dev = dev;
237 icmpv6_send(fq->q.fragments, ICMPV6_TIME_EXCEED, ICMPV6_EXC_FRAGTIME, 0, dev);
241 spin_unlock(&fq->q.lock);
245 /* Creation primitives. */
248 static struct frag_queue *ip6_frag_intern(struct frag_queue *fq_in,
251 struct inet_frag_queue *q;
253 q = inet_frag_intern(&fq_in->q, &ip6_frags, hash);
254 return container_of(q, struct frag_queue, q);
258 static struct frag_queue *
259 ip6_frag_create(__be32 id, struct in6_addr *src, struct in6_addr *dst,
260 struct inet6_dev *idev, unsigned int hash)
262 struct frag_queue *fq;
264 if ((fq = frag_alloc_queue()) == NULL)
268 ipv6_addr_copy(&fq->saddr, src);
269 ipv6_addr_copy(&fq->daddr, dst);
271 init_timer(&fq->q.timer);
272 fq->q.timer.function = ip6_frag_expire;
273 fq->q.timer.data = (long) fq;
274 spin_lock_init(&fq->q.lock);
275 atomic_set(&fq->q.refcnt, 1);
277 return ip6_frag_intern(fq, hash);
280 IP6_INC_STATS_BH(idev, IPSTATS_MIB_REASMFAILS);
284 static __inline__ struct frag_queue *
285 fq_find(__be32 id, struct in6_addr *src, struct in6_addr *dst,
286 struct inet6_dev *idev)
288 struct frag_queue *fq;
289 struct hlist_node *n;
292 read_lock(&ip6_frags.lock);
293 hash = ip6qhashfn(id, src, dst);
294 hlist_for_each_entry(fq, n, &ip6_frags.hash[hash], q.list) {
296 ipv6_addr_equal(src, &fq->saddr) &&
297 ipv6_addr_equal(dst, &fq->daddr)) {
298 atomic_inc(&fq->q.refcnt);
299 read_unlock(&ip6_frags.lock);
303 read_unlock(&ip6_frags.lock);
305 return ip6_frag_create(id, src, dst, idev, hash);
309 static int ip6_frag_queue(struct frag_queue *fq, struct sk_buff *skb,
310 struct frag_hdr *fhdr, int nhoff)
312 struct sk_buff *prev, *next;
313 struct net_device *dev;
316 if (fq->q.last_in & COMPLETE)
319 offset = ntohs(fhdr->frag_off) & ~0x7;
320 end = offset + (ntohs(ipv6_hdr(skb)->payload_len) -
321 ((u8 *)(fhdr + 1) - (u8 *)(ipv6_hdr(skb) + 1)));
323 if ((unsigned int)end > IPV6_MAXPLEN) {
324 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst),
325 IPSTATS_MIB_INHDRERRORS);
326 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
327 ((u8 *)&fhdr->frag_off -
328 skb_network_header(skb)));
332 if (skb->ip_summed == CHECKSUM_COMPLETE) {
333 const unsigned char *nh = skb_network_header(skb);
334 skb->csum = csum_sub(skb->csum,
335 csum_partial(nh, (u8 *)(fhdr + 1) - nh,
339 /* Is this the final fragment? */
340 if (!(fhdr->frag_off & htons(IP6_MF))) {
341 /* If we already have some bits beyond end
342 * or have different end, the segment is corrupted.
344 if (end < fq->q.len ||
345 ((fq->q.last_in & LAST_IN) && end != fq->q.len))
347 fq->q.last_in |= LAST_IN;
350 /* Check if the fragment is rounded to 8 bytes.
351 * Required by the RFC.
354 /* RFC2460 says always send parameter problem in
357 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst),
358 IPSTATS_MIB_INHDRERRORS);
359 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
360 offsetof(struct ipv6hdr, payload_len));
363 if (end > fq->q.len) {
364 /* Some bits beyond end -> corruption. */
365 if (fq->q.last_in & LAST_IN)
374 /* Point into the IP datagram 'data' part. */
375 if (!pskb_pull(skb, (u8 *) (fhdr + 1) - skb->data))
378 if (pskb_trim_rcsum(skb, end - offset))
381 /* Find out which fragments are in front and at the back of us
382 * in the chain of fragments so far. We must know where to put
383 * this fragment, right?
386 for(next = fq->q.fragments; next != NULL; next = next->next) {
387 if (FRAG6_CB(next)->offset >= offset)
392 /* We found where to put this one. Check for overlap with
393 * preceding fragment, and, if needed, align things so that
394 * any overlaps are eliminated.
397 int i = (FRAG6_CB(prev)->offset + prev->len) - offset;
403 if (!pskb_pull(skb, i))
405 if (skb->ip_summed != CHECKSUM_UNNECESSARY)
406 skb->ip_summed = CHECKSUM_NONE;
410 /* Look for overlap with succeeding segments.
411 * If we can merge fragments, do it.
413 while (next && FRAG6_CB(next)->offset < end) {
414 int i = end - FRAG6_CB(next)->offset; /* overlap is 'i' bytes */
417 /* Eat head of the next overlapped fragment
418 * and leave the loop. The next ones cannot overlap.
420 if (!pskb_pull(next, i))
422 FRAG6_CB(next)->offset += i; /* next fragment */
424 if (next->ip_summed != CHECKSUM_UNNECESSARY)
425 next->ip_summed = CHECKSUM_NONE;
428 struct sk_buff *free_it = next;
430 /* Old fragment is completely overridden with
438 fq->q.fragments = next;
440 fq->q.meat -= free_it->len;
441 frag_kfree_skb(free_it, NULL);
445 FRAG6_CB(skb)->offset = offset;
447 /* Insert this fragment in the chain of fragments. */
452 fq->q.fragments = skb;
456 fq->iif = dev->ifindex;
459 fq->q.stamp = skb->tstamp;
460 fq->q.meat += skb->len;
461 atomic_add(skb->truesize, &ip6_frags.mem);
463 /* The first fragment.
464 * nhoffset is obtained from the first fragment, of course.
467 fq->nhoffset = nhoff;
468 fq->q.last_in |= FIRST_IN;
471 if (fq->q.last_in == (FIRST_IN | LAST_IN) && fq->q.meat == fq->q.len)
472 return ip6_frag_reasm(fq, prev, dev);
474 write_lock(&ip6_frags.lock);
475 list_move_tail(&fq->q.lru_list, &ip6_frags.lru_list);
476 write_unlock(&ip6_frags.lock);
480 IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMFAILS);
486 * Check if this packet is complete.
487 * Returns NULL on failure by any reason, and pointer
488 * to current nexthdr field in reassembled frame.
490 * It is called with locked fq, and caller must check that
491 * queue is eligible for reassembly i.e. it is not COMPLETE,
492 * the last and the first frames arrived and all the bits are here.
494 static int ip6_frag_reasm(struct frag_queue *fq, struct sk_buff *prev,
495 struct net_device *dev)
497 struct sk_buff *fp, *head = fq->q.fragments;
503 /* Make the one we just received the head. */
506 fp = skb_clone(head, GFP_ATOMIC);
511 fp->next = head->next;
514 skb_morph(head, fq->q.fragments);
515 head->next = fq->q.fragments->next;
517 kfree_skb(fq->q.fragments);
518 fq->q.fragments = head;
521 BUG_TRAP(head != NULL);
522 BUG_TRAP(FRAG6_CB(head)->offset == 0);
524 /* Unfragmented part is taken from the first segment. */
525 payload_len = ((head->data - skb_network_header(head)) -
526 sizeof(struct ipv6hdr) + fq->q.len -
527 sizeof(struct frag_hdr));
528 if (payload_len > IPV6_MAXPLEN)
531 /* Head of list must not be cloned. */
532 if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC))
535 /* If the first fragment is fragmented itself, we split
536 * it to two chunks: the first with data and paged part
537 * and the second, holding only fragments. */
538 if (skb_shinfo(head)->frag_list) {
539 struct sk_buff *clone;
542 if ((clone = alloc_skb(0, GFP_ATOMIC)) == NULL)
544 clone->next = head->next;
546 skb_shinfo(clone)->frag_list = skb_shinfo(head)->frag_list;
547 skb_shinfo(head)->frag_list = NULL;
548 for (i=0; i<skb_shinfo(head)->nr_frags; i++)
549 plen += skb_shinfo(head)->frags[i].size;
550 clone->len = clone->data_len = head->data_len - plen;
551 head->data_len -= clone->len;
552 head->len -= clone->len;
554 clone->ip_summed = head->ip_summed;
555 atomic_add(clone->truesize, &ip6_frags.mem);
558 /* We have to remove fragment header from datagram and to relocate
559 * header in order to calculate ICV correctly. */
560 nhoff = fq->nhoffset;
561 skb_network_header(head)[nhoff] = skb_transport_header(head)[0];
562 memmove(head->head + sizeof(struct frag_hdr), head->head,
563 (head->data - head->head) - sizeof(struct frag_hdr));
564 head->mac_header += sizeof(struct frag_hdr);
565 head->network_header += sizeof(struct frag_hdr);
567 skb_shinfo(head)->frag_list = head->next;
568 skb_reset_transport_header(head);
569 skb_push(head, head->data - skb_network_header(head));
570 atomic_sub(head->truesize, &ip6_frags.mem);
572 for (fp=head->next; fp; fp = fp->next) {
573 head->data_len += fp->len;
574 head->len += fp->len;
575 if (head->ip_summed != fp->ip_summed)
576 head->ip_summed = CHECKSUM_NONE;
577 else if (head->ip_summed == CHECKSUM_COMPLETE)
578 head->csum = csum_add(head->csum, fp->csum);
579 head->truesize += fp->truesize;
580 atomic_sub(fp->truesize, &ip6_frags.mem);
585 head->tstamp = fq->q.stamp;
586 ipv6_hdr(head)->payload_len = htons(payload_len);
587 IP6CB(head)->nhoff = nhoff;
589 /* Yes, and fold redundant checksum back. 8) */
590 if (head->ip_summed == CHECKSUM_COMPLETE)
591 head->csum = csum_partial(skb_network_header(head),
592 skb_network_header_len(head),
596 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMOKS);
598 fq->q.fragments = NULL;
603 printk(KERN_DEBUG "ip6_frag_reasm: payload len = %d\n", payload_len);
607 printk(KERN_DEBUG "ip6_frag_reasm: no memory for reassembly\n");
610 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMFAILS);
615 static int ipv6_frag_rcv(struct sk_buff *skb)
617 struct frag_hdr *fhdr;
618 struct frag_queue *fq;
619 struct ipv6hdr *hdr = ipv6_hdr(skb);
621 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMREQDS);
623 /* Jumbo payload inhibits frag. header */
624 if (hdr->payload_len==0) {
625 IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_INHDRERRORS);
626 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
627 skb_network_header_len(skb));
630 if (!pskb_may_pull(skb, (skb_transport_offset(skb) +
631 sizeof(struct frag_hdr)))) {
632 IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_INHDRERRORS);
633 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
634 skb_network_header_len(skb));
639 fhdr = (struct frag_hdr *)skb_transport_header(skb);
641 if (!(fhdr->frag_off & htons(0xFFF9))) {
642 /* It is not a fragmented frame */
643 skb->transport_header += sizeof(struct frag_hdr);
644 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMOKS);
646 IP6CB(skb)->nhoff = (u8 *)fhdr - skb_network_header(skb);
650 if (atomic_read(&ip6_frags.mem) > ip6_frags_ctl.high_thresh)
651 ip6_evictor(ip6_dst_idev(skb->dst));
653 if ((fq = fq_find(fhdr->identification, &hdr->saddr, &hdr->daddr,
654 ip6_dst_idev(skb->dst))) != NULL) {
657 spin_lock(&fq->q.lock);
659 ret = ip6_frag_queue(fq, skb, fhdr, IP6CB(skb)->nhoff);
661 spin_unlock(&fq->q.lock);
666 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMFAILS);
671 static struct inet6_protocol frag_protocol =
673 .handler = ipv6_frag_rcv,
674 .flags = INET6_PROTO_NOPOLICY,
677 void __init ipv6_frag_init(void)
679 if (inet6_add_protocol(&frag_protocol, IPPROTO_FRAGMENT) < 0)
680 printk(KERN_ERR "ipv6_frag_init: Could not register protocol\n");
682 ip6_frags.ctl = &ip6_frags_ctl;
683 ip6_frags.hashfn = ip6_hashfn;
684 ip6_frags.destructor = ip6_frag_free;
685 ip6_frags.skb_free = NULL;
686 ip6_frags.qsize = sizeof(struct frag_queue);
687 ip6_frags.equal = ip6_frag_equal;
688 inet_frags_init(&ip6_frags);