[INET]: Omit double hash calculations in xxx_frag_intern
[linux-2.6/kvm.git] / net / ipv6 / reassembly.c
blob0a1bf43bd489e8fca1ffe91f8698a7b0ddff68c3
1 /*
2 * IPv6 fragment reassembly
3 * Linux INET6 implementation
5 * Authors:
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.
19 * Fixes:
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{}.
27 * David Stevens and
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>
47 #include <net/sock.h>
48 #include <net/snmp.h>
50 #include <net/ipv6.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>
59 struct ip6frag_skb_cb
61 struct inet6_skb_parm h;
62 int offset;
65 #define FRAG6_CB(skb) ((struct ip6frag_skb_cb*)((skb)->cb))
69 * Equivalent of ipv4 struct ipq
72 struct frag_queue
74 struct inet_frag_queue q;
76 __be32 id; /* fragment id */
77 struct in6_addr saddr;
78 struct in6_addr daddr;
80 int iif;
81 unsigned int csum;
82 __u16 nhoffset;
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)
114 u32 a, b, c;
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;
122 c += ip6_frags.rnd;
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 /* Memory Tracking Functions. */
147 static inline void frag_kfree_skb(struct sk_buff *skb, int *work)
149 if (work)
150 *work -= skb->truesize;
151 atomic_sub(skb->truesize, &ip6_frags.mem);
152 kfree_skb(skb);
155 static void ip6_frag_free(struct inet_frag_queue *fq)
157 kfree(container_of(fq, struct frag_queue, q));
160 static inline struct frag_queue *frag_alloc_queue(void)
162 struct frag_queue *fq = kzalloc(sizeof(struct frag_queue), GFP_ATOMIC);
164 if(!fq)
165 return NULL;
166 atomic_add(sizeof(struct frag_queue), &ip6_frags.mem);
167 return fq;
170 /* Destruction primitives. */
172 static __inline__ void fq_put(struct frag_queue *fq)
174 inet_frag_put(&fq->q, &ip6_frags);
177 /* Kill fq entry. It is not destroyed immediately,
178 * because caller (and someone more) holds reference count.
180 static __inline__ void fq_kill(struct frag_queue *fq)
182 inet_frag_kill(&fq->q, &ip6_frags);
185 static void ip6_evictor(struct inet6_dev *idev)
187 int evicted;
189 evicted = inet_frag_evictor(&ip6_frags);
190 if (evicted)
191 IP6_ADD_STATS_BH(idev, IPSTATS_MIB_REASMFAILS, evicted);
194 static void ip6_frag_expire(unsigned long data)
196 struct frag_queue *fq = (struct frag_queue *) data;
197 struct net_device *dev = NULL;
199 spin_lock(&fq->q.lock);
201 if (fq->q.last_in & COMPLETE)
202 goto out;
204 fq_kill(fq);
206 dev = dev_get_by_index(&init_net, fq->iif);
207 if (!dev)
208 goto out;
210 rcu_read_lock();
211 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMTIMEOUT);
212 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMFAILS);
213 rcu_read_unlock();
215 /* Don't send error if the first segment did not arrive. */
216 if (!(fq->q.last_in&FIRST_IN) || !fq->q.fragments)
217 goto out;
220 But use as source device on which LAST ARRIVED
221 segment was received. And do not use fq->dev
222 pointer directly, device might already disappeared.
224 fq->q.fragments->dev = dev;
225 icmpv6_send(fq->q.fragments, ICMPV6_TIME_EXCEED, ICMPV6_EXC_FRAGTIME, 0, dev);
226 out:
227 if (dev)
228 dev_put(dev);
229 spin_unlock(&fq->q.lock);
230 fq_put(fq);
233 /* Creation primitives. */
236 static struct frag_queue *ip6_frag_intern(struct frag_queue *fq_in,
237 unsigned int hash)
239 struct frag_queue *fq;
240 #ifdef CONFIG_SMP
241 struct hlist_node *n;
242 #endif
244 write_lock(&ip6_frags.lock);
245 #ifdef CONFIG_SMP
246 hlist_for_each_entry(fq, n, &ip6_frags.hash[hash], q.list) {
247 if (fq->id == fq_in->id &&
248 ipv6_addr_equal(&fq_in->saddr, &fq->saddr) &&
249 ipv6_addr_equal(&fq_in->daddr, &fq->daddr)) {
250 atomic_inc(&fq->q.refcnt);
251 write_unlock(&ip6_frags.lock);
252 fq_in->q.last_in |= COMPLETE;
253 fq_put(fq_in);
254 return fq;
257 #endif
258 fq = fq_in;
260 if (!mod_timer(&fq->q.timer, jiffies + ip6_frags_ctl.timeout))
261 atomic_inc(&fq->q.refcnt);
263 atomic_inc(&fq->q.refcnt);
264 hlist_add_head(&fq->q.list, &ip6_frags.hash[hash]);
265 INIT_LIST_HEAD(&fq->q.lru_list);
266 list_add_tail(&fq->q.lru_list, &ip6_frags.lru_list);
267 ip6_frags.nqueues++;
268 write_unlock(&ip6_frags.lock);
269 return fq;
273 static struct frag_queue *
274 ip6_frag_create(__be32 id, struct in6_addr *src, struct in6_addr *dst,
275 struct inet6_dev *idev, unsigned int hash)
277 struct frag_queue *fq;
279 if ((fq = frag_alloc_queue()) == NULL)
280 goto oom;
282 fq->id = id;
283 ipv6_addr_copy(&fq->saddr, src);
284 ipv6_addr_copy(&fq->daddr, dst);
286 init_timer(&fq->q.timer);
287 fq->q.timer.function = ip6_frag_expire;
288 fq->q.timer.data = (long) fq;
289 spin_lock_init(&fq->q.lock);
290 atomic_set(&fq->q.refcnt, 1);
292 return ip6_frag_intern(fq, hash);
294 oom:
295 IP6_INC_STATS_BH(idev, IPSTATS_MIB_REASMFAILS);
296 return NULL;
299 static __inline__ struct frag_queue *
300 fq_find(__be32 id, struct in6_addr *src, struct in6_addr *dst,
301 struct inet6_dev *idev)
303 struct frag_queue *fq;
304 struct hlist_node *n;
305 unsigned int hash;
307 read_lock(&ip6_frags.lock);
308 hash = ip6qhashfn(id, src, dst);
309 hlist_for_each_entry(fq, n, &ip6_frags.hash[hash], q.list) {
310 if (fq->id == id &&
311 ipv6_addr_equal(src, &fq->saddr) &&
312 ipv6_addr_equal(dst, &fq->daddr)) {
313 atomic_inc(&fq->q.refcnt);
314 read_unlock(&ip6_frags.lock);
315 return fq;
318 read_unlock(&ip6_frags.lock);
320 return ip6_frag_create(id, src, dst, idev, hash);
324 static int ip6_frag_queue(struct frag_queue *fq, struct sk_buff *skb,
325 struct frag_hdr *fhdr, int nhoff)
327 struct sk_buff *prev, *next;
328 struct net_device *dev;
329 int offset, end;
331 if (fq->q.last_in & COMPLETE)
332 goto err;
334 offset = ntohs(fhdr->frag_off) & ~0x7;
335 end = offset + (ntohs(ipv6_hdr(skb)->payload_len) -
336 ((u8 *)(fhdr + 1) - (u8 *)(ipv6_hdr(skb) + 1)));
338 if ((unsigned int)end > IPV6_MAXPLEN) {
339 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst),
340 IPSTATS_MIB_INHDRERRORS);
341 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
342 ((u8 *)&fhdr->frag_off -
343 skb_network_header(skb)));
344 return -1;
347 if (skb->ip_summed == CHECKSUM_COMPLETE) {
348 const unsigned char *nh = skb_network_header(skb);
349 skb->csum = csum_sub(skb->csum,
350 csum_partial(nh, (u8 *)(fhdr + 1) - nh,
351 0));
354 /* Is this the final fragment? */
355 if (!(fhdr->frag_off & htons(IP6_MF))) {
356 /* If we already have some bits beyond end
357 * or have different end, the segment is corrupted.
359 if (end < fq->q.len ||
360 ((fq->q.last_in & LAST_IN) && end != fq->q.len))
361 goto err;
362 fq->q.last_in |= LAST_IN;
363 fq->q.len = end;
364 } else {
365 /* Check if the fragment is rounded to 8 bytes.
366 * Required by the RFC.
368 if (end & 0x7) {
369 /* RFC2460 says always send parameter problem in
370 * this case. -DaveM
372 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst),
373 IPSTATS_MIB_INHDRERRORS);
374 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
375 offsetof(struct ipv6hdr, payload_len));
376 return -1;
378 if (end > fq->q.len) {
379 /* Some bits beyond end -> corruption. */
380 if (fq->q.last_in & LAST_IN)
381 goto err;
382 fq->q.len = end;
386 if (end == offset)
387 goto err;
389 /* Point into the IP datagram 'data' part. */
390 if (!pskb_pull(skb, (u8 *) (fhdr + 1) - skb->data))
391 goto err;
393 if (pskb_trim_rcsum(skb, end - offset))
394 goto err;
396 /* Find out which fragments are in front and at the back of us
397 * in the chain of fragments so far. We must know where to put
398 * this fragment, right?
400 prev = NULL;
401 for(next = fq->q.fragments; next != NULL; next = next->next) {
402 if (FRAG6_CB(next)->offset >= offset)
403 break; /* bingo! */
404 prev = next;
407 /* We found where to put this one. Check for overlap with
408 * preceding fragment, and, if needed, align things so that
409 * any overlaps are eliminated.
411 if (prev) {
412 int i = (FRAG6_CB(prev)->offset + prev->len) - offset;
414 if (i > 0) {
415 offset += i;
416 if (end <= offset)
417 goto err;
418 if (!pskb_pull(skb, i))
419 goto err;
420 if (skb->ip_summed != CHECKSUM_UNNECESSARY)
421 skb->ip_summed = CHECKSUM_NONE;
425 /* Look for overlap with succeeding segments.
426 * If we can merge fragments, do it.
428 while (next && FRAG6_CB(next)->offset < end) {
429 int i = end - FRAG6_CB(next)->offset; /* overlap is 'i' bytes */
431 if (i < next->len) {
432 /* Eat head of the next overlapped fragment
433 * and leave the loop. The next ones cannot overlap.
435 if (!pskb_pull(next, i))
436 goto err;
437 FRAG6_CB(next)->offset += i; /* next fragment */
438 fq->q.meat -= i;
439 if (next->ip_summed != CHECKSUM_UNNECESSARY)
440 next->ip_summed = CHECKSUM_NONE;
441 break;
442 } else {
443 struct sk_buff *free_it = next;
445 /* Old fragment is completely overridden with
446 * new one drop it.
448 next = next->next;
450 if (prev)
451 prev->next = next;
452 else
453 fq->q.fragments = next;
455 fq->q.meat -= free_it->len;
456 frag_kfree_skb(free_it, NULL);
460 FRAG6_CB(skb)->offset = offset;
462 /* Insert this fragment in the chain of fragments. */
463 skb->next = next;
464 if (prev)
465 prev->next = skb;
466 else
467 fq->q.fragments = skb;
469 dev = skb->dev;
470 if (dev) {
471 fq->iif = dev->ifindex;
472 skb->dev = NULL;
474 fq->q.stamp = skb->tstamp;
475 fq->q.meat += skb->len;
476 atomic_add(skb->truesize, &ip6_frags.mem);
478 /* The first fragment.
479 * nhoffset is obtained from the first fragment, of course.
481 if (offset == 0) {
482 fq->nhoffset = nhoff;
483 fq->q.last_in |= FIRST_IN;
486 if (fq->q.last_in == (FIRST_IN | LAST_IN) && fq->q.meat == fq->q.len)
487 return ip6_frag_reasm(fq, prev, dev);
489 write_lock(&ip6_frags.lock);
490 list_move_tail(&fq->q.lru_list, &ip6_frags.lru_list);
491 write_unlock(&ip6_frags.lock);
492 return -1;
494 err:
495 IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMFAILS);
496 kfree_skb(skb);
497 return -1;
501 * Check if this packet is complete.
502 * Returns NULL on failure by any reason, and pointer
503 * to current nexthdr field in reassembled frame.
505 * It is called with locked fq, and caller must check that
506 * queue is eligible for reassembly i.e. it is not COMPLETE,
507 * the last and the first frames arrived and all the bits are here.
509 static int ip6_frag_reasm(struct frag_queue *fq, struct sk_buff *prev,
510 struct net_device *dev)
512 struct sk_buff *fp, *head = fq->q.fragments;
513 int payload_len;
514 unsigned int nhoff;
516 fq_kill(fq);
518 /* Make the one we just received the head. */
519 if (prev) {
520 head = prev->next;
521 fp = skb_clone(head, GFP_ATOMIC);
523 if (!fp)
524 goto out_oom;
526 fp->next = head->next;
527 prev->next = fp;
529 skb_morph(head, fq->q.fragments);
530 head->next = fq->q.fragments->next;
532 kfree_skb(fq->q.fragments);
533 fq->q.fragments = head;
536 BUG_TRAP(head != NULL);
537 BUG_TRAP(FRAG6_CB(head)->offset == 0);
539 /* Unfragmented part is taken from the first segment. */
540 payload_len = ((head->data - skb_network_header(head)) -
541 sizeof(struct ipv6hdr) + fq->q.len -
542 sizeof(struct frag_hdr));
543 if (payload_len > IPV6_MAXPLEN)
544 goto out_oversize;
546 /* Head of list must not be cloned. */
547 if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC))
548 goto out_oom;
550 /* If the first fragment is fragmented itself, we split
551 * it to two chunks: the first with data and paged part
552 * and the second, holding only fragments. */
553 if (skb_shinfo(head)->frag_list) {
554 struct sk_buff *clone;
555 int i, plen = 0;
557 if ((clone = alloc_skb(0, GFP_ATOMIC)) == NULL)
558 goto out_oom;
559 clone->next = head->next;
560 head->next = clone;
561 skb_shinfo(clone)->frag_list = skb_shinfo(head)->frag_list;
562 skb_shinfo(head)->frag_list = NULL;
563 for (i=0; i<skb_shinfo(head)->nr_frags; i++)
564 plen += skb_shinfo(head)->frags[i].size;
565 clone->len = clone->data_len = head->data_len - plen;
566 head->data_len -= clone->len;
567 head->len -= clone->len;
568 clone->csum = 0;
569 clone->ip_summed = head->ip_summed;
570 atomic_add(clone->truesize, &ip6_frags.mem);
573 /* We have to remove fragment header from datagram and to relocate
574 * header in order to calculate ICV correctly. */
575 nhoff = fq->nhoffset;
576 skb_network_header(head)[nhoff] = skb_transport_header(head)[0];
577 memmove(head->head + sizeof(struct frag_hdr), head->head,
578 (head->data - head->head) - sizeof(struct frag_hdr));
579 head->mac_header += sizeof(struct frag_hdr);
580 head->network_header += sizeof(struct frag_hdr);
582 skb_shinfo(head)->frag_list = head->next;
583 skb_reset_transport_header(head);
584 skb_push(head, head->data - skb_network_header(head));
585 atomic_sub(head->truesize, &ip6_frags.mem);
587 for (fp=head->next; fp; fp = fp->next) {
588 head->data_len += fp->len;
589 head->len += fp->len;
590 if (head->ip_summed != fp->ip_summed)
591 head->ip_summed = CHECKSUM_NONE;
592 else if (head->ip_summed == CHECKSUM_COMPLETE)
593 head->csum = csum_add(head->csum, fp->csum);
594 head->truesize += fp->truesize;
595 atomic_sub(fp->truesize, &ip6_frags.mem);
598 head->next = NULL;
599 head->dev = dev;
600 head->tstamp = fq->q.stamp;
601 ipv6_hdr(head)->payload_len = htons(payload_len);
602 IP6CB(head)->nhoff = nhoff;
604 /* Yes, and fold redundant checksum back. 8) */
605 if (head->ip_summed == CHECKSUM_COMPLETE)
606 head->csum = csum_partial(skb_network_header(head),
607 skb_network_header_len(head),
608 head->csum);
610 rcu_read_lock();
611 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMOKS);
612 rcu_read_unlock();
613 fq->q.fragments = NULL;
614 return 1;
616 out_oversize:
617 if (net_ratelimit())
618 printk(KERN_DEBUG "ip6_frag_reasm: payload len = %d\n", payload_len);
619 goto out_fail;
620 out_oom:
621 if (net_ratelimit())
622 printk(KERN_DEBUG "ip6_frag_reasm: no memory for reassembly\n");
623 out_fail:
624 rcu_read_lock();
625 IP6_INC_STATS_BH(__in6_dev_get(dev), IPSTATS_MIB_REASMFAILS);
626 rcu_read_unlock();
627 return -1;
630 static int ipv6_frag_rcv(struct sk_buff *skb)
632 struct frag_hdr *fhdr;
633 struct frag_queue *fq;
634 struct ipv6hdr *hdr = ipv6_hdr(skb);
636 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMREQDS);
638 /* Jumbo payload inhibits frag. header */
639 if (hdr->payload_len==0) {
640 IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_INHDRERRORS);
641 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
642 skb_network_header_len(skb));
643 return -1;
645 if (!pskb_may_pull(skb, (skb_transport_offset(skb) +
646 sizeof(struct frag_hdr)))) {
647 IP6_INC_STATS(ip6_dst_idev(skb->dst), IPSTATS_MIB_INHDRERRORS);
648 icmpv6_param_prob(skb, ICMPV6_HDR_FIELD,
649 skb_network_header_len(skb));
650 return -1;
653 hdr = ipv6_hdr(skb);
654 fhdr = (struct frag_hdr *)skb_transport_header(skb);
656 if (!(fhdr->frag_off & htons(0xFFF9))) {
657 /* It is not a fragmented frame */
658 skb->transport_header += sizeof(struct frag_hdr);
659 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMOKS);
661 IP6CB(skb)->nhoff = (u8 *)fhdr - skb_network_header(skb);
662 return 1;
665 if (atomic_read(&ip6_frags.mem) > ip6_frags_ctl.high_thresh)
666 ip6_evictor(ip6_dst_idev(skb->dst));
668 if ((fq = fq_find(fhdr->identification, &hdr->saddr, &hdr->daddr,
669 ip6_dst_idev(skb->dst))) != NULL) {
670 int ret;
672 spin_lock(&fq->q.lock);
674 ret = ip6_frag_queue(fq, skb, fhdr, IP6CB(skb)->nhoff);
676 spin_unlock(&fq->q.lock);
677 fq_put(fq);
678 return ret;
681 IP6_INC_STATS_BH(ip6_dst_idev(skb->dst), IPSTATS_MIB_REASMFAILS);
682 kfree_skb(skb);
683 return -1;
686 static struct inet6_protocol frag_protocol =
688 .handler = ipv6_frag_rcv,
689 .flags = INET6_PROTO_NOPOLICY,
692 void __init ipv6_frag_init(void)
694 if (inet6_add_protocol(&frag_protocol, IPPROTO_FRAGMENT) < 0)
695 printk(KERN_ERR "ipv6_frag_init: Could not register protocol\n");
697 ip6_frags.ctl = &ip6_frags_ctl;
698 ip6_frags.hashfn = ip6_hashfn;
699 ip6_frags.destructor = ip6_frag_free;
700 ip6_frags.skb_free = NULL;
701 ip6_frags.qsize = sizeof(struct frag_queue);
702 inet_frags_init(&ip6_frags);