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
->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 rwlock_init(&f
->lock
);
62 f
->rnd
= (u32
) ((num_physpages
^ (num_physpages
>>7)) ^
63 (jiffies
^ (jiffies
>> 6)));
65 setup_timer(&f
->secret_timer
, inet_frag_secret_rebuild
,
67 f
->secret_timer
.expires
= jiffies
+ f
->secret_interval
;
68 add_timer(&f
->secret_timer
);
70 EXPORT_SYMBOL(inet_frags_init
);
72 void inet_frags_init_net(struct netns_frags
*nf
)
75 atomic_set(&nf
->mem
, 0);
76 INIT_LIST_HEAD(&nf
->lru_list
);
78 EXPORT_SYMBOL(inet_frags_init_net
);
80 void inet_frags_fini(struct inet_frags
*f
)
82 del_timer(&f
->secret_timer
);
84 EXPORT_SYMBOL(inet_frags_fini
);
86 void inet_frags_exit_net(struct netns_frags
*nf
, struct inet_frags
*f
)
89 inet_frag_evictor(nf
, f
);
91 EXPORT_SYMBOL(inet_frags_exit_net
);
93 static inline void fq_unlink(struct inet_frag_queue
*fq
, struct inet_frags
*f
)
97 list_del(&fq
->lru_list
);
99 write_unlock(&f
->lock
);
102 void inet_frag_kill(struct inet_frag_queue
*fq
, struct inet_frags
*f
)
104 if (del_timer(&fq
->timer
))
105 atomic_dec(&fq
->refcnt
);
107 if (!(fq
->last_in
& COMPLETE
)) {
109 atomic_dec(&fq
->refcnt
);
110 fq
->last_in
|= COMPLETE
;
114 EXPORT_SYMBOL(inet_frag_kill
);
116 static inline void frag_kfree_skb(struct netns_frags
*nf
, struct inet_frags
*f
,
117 struct sk_buff
*skb
, int *work
)
120 *work
-= skb
->truesize
;
122 atomic_sub(skb
->truesize
, &nf
->mem
);
128 void inet_frag_destroy(struct inet_frag_queue
*q
, struct inet_frags
*f
,
132 struct netns_frags
*nf
;
134 BUG_TRAP(q
->last_in
& COMPLETE
);
135 BUG_TRAP(del_timer(&q
->timer
) == 0);
137 /* Release all fragment data. */
141 struct sk_buff
*xp
= fp
->next
;
143 frag_kfree_skb(nf
, f
, fp
, work
);
149 atomic_sub(f
->qsize
, &nf
->mem
);
156 EXPORT_SYMBOL(inet_frag_destroy
);
158 int inet_frag_evictor(struct netns_frags
*nf
, struct inet_frags
*f
)
160 struct inet_frag_queue
*q
;
161 int work
, evicted
= 0;
163 work
= atomic_read(&nf
->mem
) - nf
->low_thresh
;
166 if (list_empty(&nf
->lru_list
)) {
167 read_unlock(&f
->lock
);
171 q
= list_first_entry(&nf
->lru_list
,
172 struct inet_frag_queue
, lru_list
);
173 atomic_inc(&q
->refcnt
);
174 read_unlock(&f
->lock
);
177 if (!(q
->last_in
& COMPLETE
))
178 inet_frag_kill(q
, f
);
179 spin_unlock(&q
->lock
);
181 if (atomic_dec_and_test(&q
->refcnt
))
182 inet_frag_destroy(q
, f
, &work
);
188 EXPORT_SYMBOL(inet_frag_evictor
);
190 static struct inet_frag_queue
*inet_frag_intern(struct netns_frags
*nf
,
191 struct inet_frag_queue
*qp_in
, struct inet_frags
*f
,
192 unsigned int hash
, void *arg
)
194 struct inet_frag_queue
*qp
;
196 struct hlist_node
*n
;
199 write_lock(&f
->lock
);
201 /* With SMP race we have to recheck hash table, because
202 * such entry could be created on other cpu, while we
203 * promoted read lock to write lock.
205 hlist_for_each_entry(qp
, n
, &f
->hash
[hash
], list
) {
206 if (qp
->net
== nf
&& f
->match(qp
, arg
)) {
207 atomic_inc(&qp
->refcnt
);
208 write_unlock(&f
->lock
);
209 qp_in
->last_in
|= COMPLETE
;
210 inet_frag_put(qp_in
, f
);
216 if (!mod_timer(&qp
->timer
, jiffies
+ nf
->timeout
))
217 atomic_inc(&qp
->refcnt
);
219 atomic_inc(&qp
->refcnt
);
220 hlist_add_head(&qp
->list
, &f
->hash
[hash
]);
221 list_add_tail(&qp
->lru_list
, &nf
->lru_list
);
223 write_unlock(&f
->lock
);
227 static struct inet_frag_queue
*inet_frag_alloc(struct netns_frags
*nf
,
228 struct inet_frags
*f
, void *arg
)
230 struct inet_frag_queue
*q
;
232 q
= kzalloc(f
->qsize
, GFP_ATOMIC
);
236 f
->constructor(q
, arg
);
237 atomic_add(f
->qsize
, &nf
->mem
);
238 setup_timer(&q
->timer
, f
->frag_expire
, (unsigned long)q
);
239 spin_lock_init(&q
->lock
);
240 atomic_set(&q
->refcnt
, 1);
246 static struct inet_frag_queue
*inet_frag_create(struct netns_frags
*nf
,
247 struct inet_frags
*f
, void *arg
, unsigned int hash
)
249 struct inet_frag_queue
*q
;
251 q
= inet_frag_alloc(nf
, f
, arg
);
255 return inet_frag_intern(nf
, q
, f
, hash
, arg
);
258 struct inet_frag_queue
*inet_frag_find(struct netns_frags
*nf
,
259 struct inet_frags
*f
, void *key
, unsigned int hash
)
261 struct inet_frag_queue
*q
;
262 struct hlist_node
*n
;
265 hlist_for_each_entry(q
, n
, &f
->hash
[hash
], list
) {
266 if (q
->net
== nf
&& f
->match(q
, key
)) {
267 atomic_inc(&q
->refcnt
);
268 read_unlock(&f
->lock
);
272 read_unlock(&f
->lock
);
274 return inet_frag_create(nf
, f
, key
, hash
);
276 EXPORT_SYMBOL(inet_frag_find
);