2 * INET An implementation of the TCP/IP protocol suite for the LINUX
3 * operating system. INET is implemented using the BSD Socket
4 * interface as the means of communication with the user level.
6 * The IP fragmentation functionality.
8 * Version: $Id: ip_fragment.c,v 1.59 2002/01/12 07:54:56 davem Exp $
10 * Authors: Fred N. van Kempen <waltje@uWalt.NL.Mugnet.ORG>
11 * Alan Cox <Alan.Cox@linux.org>
14 * Alan Cox : Split from ip.c , see ip_input.c for history.
15 * David S. Miller : Begin massive cleanup...
16 * Andi Kleen : Add sysctls.
17 * xxxx : Overlapfrag bug.
18 * Ultima : ip_expire() kernel panic.
19 * Bill Hawes : Frag accounting and evictor fixes.
20 * John McDonald : 0 length frag bug.
21 * Alexey Kuznetsov: SMP races, threading, cleanup.
22 * Patrick McHardy : LRU queue of frag heads for evictor.
25 #include <linux/compiler.h>
26 #include <linux/module.h>
27 #include <linux/types.h>
29 #include <linux/jiffies.h>
30 #include <linux/skbuff.h>
31 #include <linux/list.h>
33 #include <linux/icmp.h>
34 #include <linux/netdevice.h>
35 #include <linux/jhash.h>
36 #include <linux/random.h>
40 #include <net/checksum.h>
41 #include <net/inetpeer.h>
42 #include <net/inet_frag.h>
43 #include <linux/tcp.h>
44 #include <linux/udp.h>
45 #include <linux/inet.h>
46 #include <linux/netfilter_ipv4.h>
48 /* NOTE. Logic of IP defragmentation is parallel to corresponding IPv6
49 * code now. If you change something here, _PLEASE_ update ipv6/reassembly.c
50 * as well. Or notify me, at least. --ANK
53 int sysctl_ipfrag_max_dist __read_mostly = 64;
57 struct inet_skb_parm h;
61 #define FRAG_CB(skb) ((struct ipfrag_skb_cb*)((skb)->cb))
63 /* Describe an entry in the "incomplete datagrams" queue. */
65 struct inet_frag_queue q;
74 struct inet_peer *peer;
77 struct inet_frags_ctl ip4_frags_ctl __read_mostly = {
79 * Fragment cache limits. We will commit 256K at one time. Should we
80 * cross that limit we will prune down to 192K. This should cope with
81 * even the most extreme cases without allowing an attacker to
82 * measurably harm machine performance.
84 .high_thresh = 256 * 1024,
85 .low_thresh = 192 * 1024,
88 * Important NOTE! Fragment queue must be destroyed before MSL expires.
89 * RFC791 is wrong proposing to prolongate timer each fragment arrival
92 .timeout = IP_FRAG_TIME,
93 .secret_interval = 10 * 60 * HZ,
96 static struct inet_frags ip4_frags;
98 int ip_frag_nqueues(void)
100 return ip4_frags.nqueues;
103 int ip_frag_mem(void)
105 return atomic_read(&ip4_frags.mem);
108 static int ip_frag_reasm(struct ipq *qp, struct sk_buff *prev,
109 struct net_device *dev);
111 static unsigned int ipqhashfn(__be16 id, __be32 saddr, __be32 daddr, u8 prot)
113 return jhash_3words((__force u32)id << 16 | prot,
114 (__force u32)saddr, (__force u32)daddr,
115 ip4_frags.rnd) & (INETFRAGS_HASHSZ - 1);
118 static unsigned int ip4_hashfn(struct inet_frag_queue *q)
122 ipq = container_of(q, struct ipq, q);
123 return ipqhashfn(ipq->id, ipq->saddr, ipq->daddr, ipq->protocol);
126 static int ip4_frag_equal(struct inet_frag_queue *q1,
127 struct inet_frag_queue *q2)
129 struct ipq *qp1, *qp2;
131 qp1 = container_of(q1, struct ipq, q);
132 qp2 = container_of(q2, struct ipq, q);
133 return (qp1->id == qp2->id &&
134 qp1->saddr == qp2->saddr &&
135 qp1->daddr == qp2->daddr &&
136 qp1->protocol == qp2->protocol &&
137 qp1->user == qp2->user);
140 /* Memory Tracking Functions. */
141 static __inline__ void frag_kfree_skb(struct sk_buff *skb, int *work)
144 *work -= skb->truesize;
145 atomic_sub(skb->truesize, &ip4_frags.mem);
149 static __inline__ void ip4_frag_free(struct inet_frag_queue *q)
153 qp = container_of(q, struct ipq, q);
155 inet_putpeer(qp->peer);
159 static __inline__ struct ipq *frag_alloc_queue(void)
161 struct ipq *qp = kzalloc(sizeof(struct ipq), GFP_ATOMIC);
165 atomic_add(sizeof(struct ipq), &ip4_frags.mem);
170 /* Destruction primitives. */
172 static __inline__ void ipq_put(struct ipq *ipq)
174 inet_frag_put(&ipq->q, &ip4_frags);
177 /* Kill ipq entry. It is not destroyed immediately,
178 * because caller (and someone more) holds reference count.
180 static void ipq_kill(struct ipq *ipq)
182 inet_frag_kill(&ipq->q, &ip4_frags);
185 /* Memory limiting on fragments. Evictor trashes the oldest
186 * fragment queue until we are back under the threshold.
188 static void ip_evictor(void)
192 evicted = inet_frag_evictor(&ip4_frags);
194 IP_ADD_STATS_BH(IPSTATS_MIB_REASMFAILS, evicted);
198 * Oops, a fragment queue timed out. Kill it and send an ICMP reply.
200 static void ip_expire(unsigned long arg)
202 struct ipq *qp = (struct ipq *) arg;
204 spin_lock(&qp->q.lock);
206 if (qp->q.last_in & COMPLETE)
211 IP_INC_STATS_BH(IPSTATS_MIB_REASMTIMEOUT);
212 IP_INC_STATS_BH(IPSTATS_MIB_REASMFAILS);
214 if ((qp->q.last_in&FIRST_IN) && qp->q.fragments != NULL) {
215 struct sk_buff *head = qp->q.fragments;
216 /* Send an ICMP "Fragment Reassembly Timeout" message. */
217 if ((head->dev = dev_get_by_index(&init_net, qp->iif)) != NULL) {
218 icmp_send(head, ICMP_TIME_EXCEEDED, ICMP_EXC_FRAGTIME, 0);
223 spin_unlock(&qp->q.lock);
227 /* Creation primitives. */
229 static struct ipq *ip_frag_intern(struct ipq *qp_in, unsigned int hash)
231 struct inet_frag_queue *q;
233 q = inet_frag_intern(&qp_in->q, &ip4_frags, hash);
234 return container_of(q, struct ipq, q);
237 /* Add an entry to the 'ipq' queue for a newly received IP datagram. */
238 static struct ipq *ip_frag_create(struct iphdr *iph, u32 user, unsigned int h)
242 if ((qp = frag_alloc_queue()) == NULL)
245 qp->protocol = iph->protocol;
247 qp->saddr = iph->saddr;
248 qp->daddr = iph->daddr;
250 qp->peer = sysctl_ipfrag_max_dist ? inet_getpeer(iph->saddr, 1) : NULL;
252 /* Initialize a timer for this entry. */
253 init_timer(&qp->q.timer);
254 qp->q.timer.data = (unsigned long) qp; /* pointer to queue */
255 qp->q.timer.function = ip_expire; /* expire function */
256 spin_lock_init(&qp->q.lock);
257 atomic_set(&qp->q.refcnt, 1);
259 return ip_frag_intern(qp, h);
262 LIMIT_NETDEBUG(KERN_ERR "ip_frag_create: no memory left !\n");
266 /* Find the correct entry in the "incomplete datagrams" queue for
267 * this IP datagram, and create new one, if nothing is found.
269 static inline struct ipq *ip_find(struct iphdr *iph, u32 user)
272 __be32 saddr = iph->saddr;
273 __be32 daddr = iph->daddr;
274 __u8 protocol = iph->protocol;
277 struct hlist_node *n;
279 read_lock(&ip4_frags.lock);
280 hash = ipqhashfn(id, saddr, daddr, protocol);
281 hlist_for_each_entry(qp, n, &ip4_frags.hash[hash], q.list) {
283 qp->saddr == saddr &&
284 qp->daddr == daddr &&
285 qp->protocol == protocol &&
287 atomic_inc(&qp->q.refcnt);
288 read_unlock(&ip4_frags.lock);
292 read_unlock(&ip4_frags.lock);
294 return ip_frag_create(iph, user, hash);
297 /* Is the fragment too far ahead to be part of ipq? */
298 static inline int ip_frag_too_far(struct ipq *qp)
300 struct inet_peer *peer = qp->peer;
301 unsigned int max = sysctl_ipfrag_max_dist;
302 unsigned int start, end;
310 end = atomic_inc_return(&peer->rid);
313 rc = qp->q.fragments && (end - start) > max;
316 IP_INC_STATS_BH(IPSTATS_MIB_REASMFAILS);
322 static int ip_frag_reinit(struct ipq *qp)
326 if (!mod_timer(&qp->q.timer, jiffies + ip4_frags_ctl.timeout)) {
327 atomic_inc(&qp->q.refcnt);
331 fp = qp->q.fragments;
333 struct sk_buff *xp = fp->next;
334 frag_kfree_skb(fp, NULL);
341 qp->q.fragments = NULL;
347 /* Add new segment to existing queue. */
348 static int ip_frag_queue(struct ipq *qp, struct sk_buff *skb)
350 struct sk_buff *prev, *next;
351 struct net_device *dev;
356 if (qp->q.last_in & COMPLETE)
359 if (!(IPCB(skb)->flags & IPSKB_FRAG_COMPLETE) &&
360 unlikely(ip_frag_too_far(qp)) &&
361 unlikely(err = ip_frag_reinit(qp))) {
366 offset = ntohs(ip_hdr(skb)->frag_off);
367 flags = offset & ~IP_OFFSET;
369 offset <<= 3; /* offset is in 8-byte chunks */
370 ihl = ip_hdrlen(skb);
372 /* Determine the position of this fragment. */
373 end = offset + skb->len - ihl;
376 /* Is this the final fragment? */
377 if ((flags & IP_MF) == 0) {
378 /* If we already have some bits beyond end
379 * or have different end, the segment is corrrupted.
381 if (end < qp->q.len ||
382 ((qp->q.last_in & LAST_IN) && end != qp->q.len))
384 qp->q.last_in |= LAST_IN;
389 if (skb->ip_summed != CHECKSUM_UNNECESSARY)
390 skb->ip_summed = CHECKSUM_NONE;
392 if (end > qp->q.len) {
393 /* Some bits beyond end -> corruption. */
394 if (qp->q.last_in & LAST_IN)
403 if (pskb_pull(skb, ihl) == NULL)
406 err = pskb_trim_rcsum(skb, end - offset);
410 /* Find out which fragments are in front and at the back of us
411 * in the chain of fragments so far. We must know where to put
412 * this fragment, right?
415 for (next = qp->q.fragments; next != NULL; next = next->next) {
416 if (FRAG_CB(next)->offset >= offset)
421 /* We found where to put this one. Check for overlap with
422 * preceding fragment, and, if needed, align things so that
423 * any overlaps are eliminated.
426 int i = (FRAG_CB(prev)->offset + prev->len) - offset;
434 if (!pskb_pull(skb, i))
436 if (skb->ip_summed != CHECKSUM_UNNECESSARY)
437 skb->ip_summed = CHECKSUM_NONE;
443 while (next && FRAG_CB(next)->offset < end) {
444 int i = end - FRAG_CB(next)->offset; /* overlap is 'i' bytes */
447 /* Eat head of the next overlapped fragment
448 * and leave the loop. The next ones cannot overlap.
450 if (!pskb_pull(next, i))
452 FRAG_CB(next)->offset += i;
454 if (next->ip_summed != CHECKSUM_UNNECESSARY)
455 next->ip_summed = CHECKSUM_NONE;
458 struct sk_buff *free_it = next;
460 /* Old fragment is completely overridden with
468 qp->q.fragments = next;
470 qp->q.meat -= free_it->len;
471 frag_kfree_skb(free_it, NULL);
475 FRAG_CB(skb)->offset = offset;
477 /* Insert this fragment in the chain of fragments. */
482 qp->q.fragments = skb;
486 qp->iif = dev->ifindex;
489 qp->q.stamp = skb->tstamp;
490 qp->q.meat += skb->len;
491 atomic_add(skb->truesize, &ip4_frags.mem);
493 qp->q.last_in |= FIRST_IN;
495 if (qp->q.last_in == (FIRST_IN | LAST_IN) && qp->q.meat == qp->q.len)
496 return ip_frag_reasm(qp, prev, dev);
498 write_lock(&ip4_frags.lock);
499 list_move_tail(&qp->q.lru_list, &ip4_frags.lru_list);
500 write_unlock(&ip4_frags.lock);
509 /* Build a new IP datagram from all its fragments. */
511 static int ip_frag_reasm(struct ipq *qp, struct sk_buff *prev,
512 struct net_device *dev)
515 struct sk_buff *fp, *head = qp->q.fragments;
522 /* Make the one we just received the head. */
525 fp = skb_clone(head, GFP_ATOMIC);
530 fp->next = head->next;
533 skb_morph(head, qp->q.fragments);
534 head->next = qp->q.fragments->next;
536 kfree_skb(qp->q.fragments);
537 qp->q.fragments = head;
540 BUG_TRAP(head != NULL);
541 BUG_TRAP(FRAG_CB(head)->offset == 0);
543 /* Allocate a new buffer for the datagram. */
544 ihlen = ip_hdrlen(head);
545 len = ihlen + qp->q.len;
551 /* Head of list must not be cloned. */
553 if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC))
556 /* If the first fragment is fragmented itself, we split
557 * it to two chunks: the first with data and paged part
558 * and the second, holding only fragments. */
559 if (skb_shinfo(head)->frag_list) {
560 struct sk_buff *clone;
563 if ((clone = alloc_skb(0, GFP_ATOMIC)) == NULL)
565 clone->next = head->next;
567 skb_shinfo(clone)->frag_list = skb_shinfo(head)->frag_list;
568 skb_shinfo(head)->frag_list = NULL;
569 for (i=0; i<skb_shinfo(head)->nr_frags; i++)
570 plen += skb_shinfo(head)->frags[i].size;
571 clone->len = clone->data_len = head->data_len - plen;
572 head->data_len -= clone->len;
573 head->len -= clone->len;
575 clone->ip_summed = head->ip_summed;
576 atomic_add(clone->truesize, &ip4_frags.mem);
579 skb_shinfo(head)->frag_list = head->next;
580 skb_push(head, head->data - skb_network_header(head));
581 atomic_sub(head->truesize, &ip4_frags.mem);
583 for (fp=head->next; fp; fp = fp->next) {
584 head->data_len += fp->len;
585 head->len += fp->len;
586 if (head->ip_summed != fp->ip_summed)
587 head->ip_summed = CHECKSUM_NONE;
588 else if (head->ip_summed == CHECKSUM_COMPLETE)
589 head->csum = csum_add(head->csum, fp->csum);
590 head->truesize += fp->truesize;
591 atomic_sub(fp->truesize, &ip4_frags.mem);
596 head->tstamp = qp->q.stamp;
600 iph->tot_len = htons(len);
601 IP_INC_STATS_BH(IPSTATS_MIB_REASMOKS);
602 qp->q.fragments = NULL;
606 LIMIT_NETDEBUG(KERN_ERR "IP: queue_glue: no memory for gluing "
612 "Oversized IP packet from %d.%d.%d.%d.\n",
615 IP_INC_STATS_BH(IPSTATS_MIB_REASMFAILS);
619 /* Process an incoming IP datagram fragment. */
620 int ip_defrag(struct sk_buff *skb, u32 user)
624 IP_INC_STATS_BH(IPSTATS_MIB_REASMREQDS);
626 /* Start by cleaning up the memory. */
627 if (atomic_read(&ip4_frags.mem) > ip4_frags_ctl.high_thresh)
630 /* Lookup (or create) queue header */
631 if ((qp = ip_find(ip_hdr(skb), user)) != NULL) {
634 spin_lock(&qp->q.lock);
636 ret = ip_frag_queue(qp, skb);
638 spin_unlock(&qp->q.lock);
643 IP_INC_STATS_BH(IPSTATS_MIB_REASMFAILS);
648 void __init ipfrag_init(void)
650 ip4_frags.ctl = &ip4_frags_ctl;
651 ip4_frags.hashfn = ip4_hashfn;
652 ip4_frags.destructor = ip4_frag_free;
653 ip4_frags.skb_free = NULL;
654 ip4_frags.qsize = sizeof(struct ipq);
655 ip4_frags.equal = ip4_frag_equal;
656 inet_frags_init(&ip4_frags);
659 EXPORT_SYMBOL(ip_defrag);