2 * inet fragments management
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
9 * Authors: Pavel Emelyanov <xemul@openvz.org>
10 * Started as consolidation of ipv4/ip_fragment.c,
11 * ipv6/reassembly. and ipv6 nf conntrack reassembly
14 #include <linux/list.h>
15 #include <linux/spinlock.h>
16 #include <linux/module.h>
17 #include <linux/timer.h>
19 #include <linux/random.h>
20 #include <linux/skbuff.h>
21 #include <linux/rtnetlink.h>
23 #include <net/inet_frag.h>
25 static void inet_frag_secret_rebuild(unsigned long dummy)
27 struct inet_frags *f = (struct inet_frags *)dummy;
28 unsigned long now = jiffies;
32 get_random_bytes(&f->rnd, sizeof(u32));
33 for (i = 0; i < INETFRAGS_HASHSZ; i++) {
34 struct inet_frag_queue *q;
35 struct hlist_node *p, *n;
37 hlist_for_each_entry_safe(q, p, n, &f->hash[i], list) {
38 unsigned int hval = f->hashfn(q);
43 /* Relink to new hash chain. */
44 hlist_add_head(&q->list, &f->hash[hval]);
48 write_unlock(&f->lock);
50 mod_timer(&f->secret_timer, now + f->ctl->secret_interval);
53 void inet_frags_init(struct inet_frags *f)
57 for (i = 0; i < INETFRAGS_HASHSZ; i++)
58 INIT_HLIST_HEAD(&f->hash[i]);
60 INIT_LIST_HEAD(&f->lru_list);
61 rwlock_init(&f->lock);
63 f->rnd = (u32) ((num_physpages ^ (num_physpages>>7)) ^
64 (jiffies ^ (jiffies >> 6)));
67 atomic_set(&f->mem, 0);
69 init_timer(&f->secret_timer);
70 f->secret_timer.function = inet_frag_secret_rebuild;
71 f->secret_timer.data = (unsigned long)f;
72 f->secret_timer.expires = jiffies + f->ctl->secret_interval;
73 add_timer(&f->secret_timer);
75 EXPORT_SYMBOL(inet_frags_init);
77 void inet_frags_fini(struct inet_frags *f)
79 del_timer(&f->secret_timer);
81 EXPORT_SYMBOL(inet_frags_fini);
83 static inline void fq_unlink(struct inet_frag_queue *fq, struct inet_frags *f)
87 list_del(&fq->lru_list);
89 write_unlock(&f->lock);
92 void inet_frag_kill(struct inet_frag_queue *fq, struct inet_frags *f)
94 if (del_timer(&fq->timer))
95 atomic_dec(&fq->refcnt);
97 if (!(fq->last_in & COMPLETE)) {
99 atomic_dec(&fq->refcnt);
100 fq->last_in |= COMPLETE;
104 EXPORT_SYMBOL(inet_frag_kill);
106 static inline void frag_kfree_skb(struct inet_frags *f, struct sk_buff *skb,
110 *work -= skb->truesize;
112 atomic_sub(skb->truesize, &f->mem);
118 void inet_frag_destroy(struct inet_frag_queue *q, struct inet_frags *f,
123 BUG_TRAP(q->last_in & COMPLETE);
124 BUG_TRAP(del_timer(&q->timer) == 0);
126 /* Release all fragment data. */
129 struct sk_buff *xp = fp->next;
131 frag_kfree_skb(f, fp, work);
137 atomic_sub(f->qsize, &f->mem);
142 EXPORT_SYMBOL(inet_frag_destroy);
144 int inet_frag_evictor(struct inet_frags *f)
146 struct inet_frag_queue *q;
147 int work, evicted = 0;
149 work = atomic_read(&f->mem) - f->ctl->low_thresh;
152 if (list_empty(&f->lru_list)) {
153 read_unlock(&f->lock);
157 q = list_first_entry(&f->lru_list,
158 struct inet_frag_queue, lru_list);
159 atomic_inc(&q->refcnt);
160 read_unlock(&f->lock);
163 if (!(q->last_in & COMPLETE))
164 inet_frag_kill(q, f);
165 spin_unlock(&q->lock);
167 if (atomic_dec_and_test(&q->refcnt))
168 inet_frag_destroy(q, f, &work);
174 EXPORT_SYMBOL(inet_frag_evictor);