fa49916c23a030016d3fa4556655a6e6c98a52f0
[deliverable/linux.git] / net / ipv4 / inet_fragment.c
1 /*
2 * inet fragments management
3 *
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.
8 *
9 * Authors: Pavel Emelyanov <xemul@openvz.org>
10 * Started as consolidation of ipv4/ip_fragment.c,
11 * ipv6/reassembly. and ipv6 nf conntrack reassembly
12 */
13
14 #include <linux/list.h>
15 #include <linux/spinlock.h>
16 #include <linux/module.h>
17 #include <linux/timer.h>
18 #include <linux/mm.h>
19 #include <linux/random.h>
20 #include <linux/skbuff.h>
21 #include <linux/rtnetlink.h>
22 #include <linux/slab.h>
23
24 #include <net/sock.h>
25 #include <net/inet_frag.h>
26 #include <net/inet_ecn.h>
27
28 #define INETFRAGS_EVICT_BUCKETS 128
29 #define INETFRAGS_EVICT_MAX 512
30
31 /* don't rebuild inetfrag table with new secret more often than this */
32 #define INETFRAGS_MIN_REBUILD_INTERVAL (5 * HZ)
33
34 /* Given the OR values of all fragments, apply RFC 3168 5.3 requirements
35 * Value : 0xff if frame should be dropped.
36 * 0 or INET_ECN_CE value, to be ORed in to final iph->tos field
37 */
38 const u8 ip_frag_ecn_table[16] = {
39 /* at least one fragment had CE, and others ECT_0 or ECT_1 */
40 [IPFRAG_ECN_CE | IPFRAG_ECN_ECT_0] = INET_ECN_CE,
41 [IPFRAG_ECN_CE | IPFRAG_ECN_ECT_1] = INET_ECN_CE,
42 [IPFRAG_ECN_CE | IPFRAG_ECN_ECT_0 | IPFRAG_ECN_ECT_1] = INET_ECN_CE,
43
44 /* invalid combinations : drop frame */
45 [IPFRAG_ECN_NOT_ECT | IPFRAG_ECN_CE] = 0xff,
46 [IPFRAG_ECN_NOT_ECT | IPFRAG_ECN_ECT_0] = 0xff,
47 [IPFRAG_ECN_NOT_ECT | IPFRAG_ECN_ECT_1] = 0xff,
48 [IPFRAG_ECN_NOT_ECT | IPFRAG_ECN_ECT_0 | IPFRAG_ECN_ECT_1] = 0xff,
49 [IPFRAG_ECN_NOT_ECT | IPFRAG_ECN_CE | IPFRAG_ECN_ECT_0] = 0xff,
50 [IPFRAG_ECN_NOT_ECT | IPFRAG_ECN_CE | IPFRAG_ECN_ECT_1] = 0xff,
51 [IPFRAG_ECN_NOT_ECT | IPFRAG_ECN_CE | IPFRAG_ECN_ECT_0 | IPFRAG_ECN_ECT_1] = 0xff,
52 };
53 EXPORT_SYMBOL(ip_frag_ecn_table);
54
55 static unsigned int
56 inet_frag_hashfn(const struct inet_frags *f, const struct inet_frag_queue *q)
57 {
58 return f->hashfn(q) & (INETFRAGS_HASHSZ - 1);
59 }
60
61 static bool inet_frag_may_rebuild(struct inet_frags *f)
62 {
63 return time_after(jiffies,
64 f->last_rebuild_jiffies + INETFRAGS_MIN_REBUILD_INTERVAL);
65 }
66
67 static void inet_frag_secret_rebuild(struct inet_frags *f)
68 {
69 int i;
70
71 write_seqlock_bh(&f->rnd_seqlock);
72
73 if (!inet_frag_may_rebuild(f))
74 goto out;
75
76 get_random_bytes(&f->rnd, sizeof(u32));
77
78 for (i = 0; i < INETFRAGS_HASHSZ; i++) {
79 struct inet_frag_bucket *hb;
80 struct inet_frag_queue *q;
81 struct hlist_node *n;
82
83 hb = &f->hash[i];
84 spin_lock(&hb->chain_lock);
85
86 hlist_for_each_entry_safe(q, n, &hb->chain, list) {
87 unsigned int hval = inet_frag_hashfn(f, q);
88
89 if (hval != i) {
90 struct inet_frag_bucket *hb_dest;
91
92 hlist_del(&q->list);
93
94 /* Relink to new hash chain. */
95 hb_dest = &f->hash[hval];
96
97 /* This is the only place where we take
98 * another chain_lock while already holding
99 * one. As this will not run concurrently,
100 * we cannot deadlock on hb_dest lock below, if its
101 * already locked it will be released soon since
102 * other caller cannot be waiting for hb lock
103 * that we've taken above.
104 */
105 spin_lock_nested(&hb_dest->chain_lock,
106 SINGLE_DEPTH_NESTING);
107 hlist_add_head(&q->list, &hb_dest->chain);
108 spin_unlock(&hb_dest->chain_lock);
109 }
110 }
111 spin_unlock(&hb->chain_lock);
112 }
113
114 f->rebuild = false;
115 f->last_rebuild_jiffies = jiffies;
116 out:
117 write_sequnlock_bh(&f->rnd_seqlock);
118 }
119
120 static bool inet_fragq_should_evict(const struct inet_frag_queue *q)
121 {
122 return q->net->low_thresh == 0 ||
123 frag_mem_limit(q->net) >= q->net->low_thresh;
124 }
125
126 static unsigned int
127 inet_evict_bucket(struct inet_frags *f, struct inet_frag_bucket *hb)
128 {
129 struct inet_frag_queue *fq;
130 struct hlist_node *n;
131 unsigned int evicted = 0;
132 HLIST_HEAD(expired);
133
134 evict_again:
135 spin_lock(&hb->chain_lock);
136
137 hlist_for_each_entry_safe(fq, n, &hb->chain, list) {
138 if (!inet_fragq_should_evict(fq))
139 continue;
140
141 if (!del_timer(&fq->timer)) {
142 /* q expiring right now thus increment its refcount so
143 * it won't be freed under us and wait until the timer
144 * has finished executing then destroy it
145 */
146 atomic_inc(&fq->refcnt);
147 spin_unlock(&hb->chain_lock);
148 del_timer_sync(&fq->timer);
149 WARN_ON(atomic_read(&fq->refcnt) != 1);
150 inet_frag_put(fq, f);
151 goto evict_again;
152 }
153
154 /* suppress xmit of (icmp) error packet */
155 fq->flags &= ~INET_FRAG_FIRST_IN;
156 fq->flags |= INET_FRAG_EVICTED;
157 hlist_del(&fq->list);
158 hlist_add_head(&fq->list, &expired);
159 ++evicted;
160 }
161
162 spin_unlock(&hb->chain_lock);
163
164 hlist_for_each_entry_safe(fq, n, &expired, list)
165 f->frag_expire((unsigned long) fq);
166
167 return evicted;
168 }
169
170 static void inet_frag_worker(struct work_struct *work)
171 {
172 unsigned int budget = INETFRAGS_EVICT_BUCKETS;
173 unsigned int i, evicted = 0;
174 struct inet_frags *f;
175
176 f = container_of(work, struct inet_frags, frags_work);
177
178 BUILD_BUG_ON(INETFRAGS_EVICT_BUCKETS >= INETFRAGS_HASHSZ);
179
180 local_bh_disable();
181
182 for (i = ACCESS_ONCE(f->next_bucket); budget; --budget) {
183 evicted += inet_evict_bucket(f, &f->hash[i]);
184 i = (i + 1) & (INETFRAGS_HASHSZ - 1);
185 if (evicted > INETFRAGS_EVICT_MAX)
186 break;
187 }
188
189 f->next_bucket = i;
190
191 local_bh_enable();
192
193 if (f->rebuild && inet_frag_may_rebuild(f))
194 inet_frag_secret_rebuild(f);
195 }
196
197 static void inet_frag_schedule_worker(struct inet_frags *f)
198 {
199 if (unlikely(!work_pending(&f->frags_work)))
200 schedule_work(&f->frags_work);
201 }
202
203 void inet_frags_init(struct inet_frags *f)
204 {
205 int i;
206
207 INIT_WORK(&f->frags_work, inet_frag_worker);
208
209 for (i = 0; i < INETFRAGS_HASHSZ; i++) {
210 struct inet_frag_bucket *hb = &f->hash[i];
211
212 spin_lock_init(&hb->chain_lock);
213 INIT_HLIST_HEAD(&hb->chain);
214 }
215
216 seqlock_init(&f->rnd_seqlock);
217 f->last_rebuild_jiffies = 0;
218 }
219 EXPORT_SYMBOL(inet_frags_init);
220
221 void inet_frags_init_net(struct netns_frags *nf)
222 {
223 init_frag_mem_limit(nf);
224 }
225 EXPORT_SYMBOL(inet_frags_init_net);
226
227 void inet_frags_fini(struct inet_frags *f)
228 {
229 cancel_work_sync(&f->frags_work);
230 }
231 EXPORT_SYMBOL(inet_frags_fini);
232
233 void inet_frags_exit_net(struct netns_frags *nf, struct inet_frags *f)
234 {
235 unsigned int seq;
236 int i;
237
238 nf->low_thresh = 0;
239 local_bh_disable();
240
241 evict_again:
242 seq = read_seqbegin(&f->rnd_seqlock);
243
244 for (i = 0; i < INETFRAGS_HASHSZ ; i++)
245 inet_evict_bucket(f, &f->hash[i]);
246
247 if (read_seqretry(&f->rnd_seqlock, seq))
248 goto evict_again;
249
250 local_bh_enable();
251
252 percpu_counter_destroy(&nf->mem);
253 }
254 EXPORT_SYMBOL(inet_frags_exit_net);
255
256 static struct inet_frag_bucket *
257 get_frag_bucket_locked(struct inet_frag_queue *fq, struct inet_frags *f)
258 __acquires(hb->chain_lock)
259 {
260 struct inet_frag_bucket *hb;
261 unsigned int seq, hash;
262
263 restart:
264 seq = read_seqbegin(&f->rnd_seqlock);
265
266 hash = inet_frag_hashfn(f, fq);
267 hb = &f->hash[hash];
268
269 spin_lock(&hb->chain_lock);
270 if (read_seqretry(&f->rnd_seqlock, seq)) {
271 spin_unlock(&hb->chain_lock);
272 goto restart;
273 }
274
275 return hb;
276 }
277
278 static inline void fq_unlink(struct inet_frag_queue *fq, struct inet_frags *f)
279 {
280 struct inet_frag_bucket *hb;
281
282 hb = get_frag_bucket_locked(fq, f);
283 hlist_del(&fq->list);
284 spin_unlock(&hb->chain_lock);
285 }
286
287 void inet_frag_kill(struct inet_frag_queue *fq, struct inet_frags *f)
288 {
289 if (del_timer(&fq->timer))
290 atomic_dec(&fq->refcnt);
291
292 if (!(fq->flags & INET_FRAG_COMPLETE)) {
293 fq_unlink(fq, f);
294 atomic_dec(&fq->refcnt);
295 fq->flags |= INET_FRAG_COMPLETE;
296 }
297 }
298 EXPORT_SYMBOL(inet_frag_kill);
299
300 static inline void frag_kfree_skb(struct netns_frags *nf, struct inet_frags *f,
301 struct sk_buff *skb)
302 {
303 if (f->skb_free)
304 f->skb_free(skb);
305 kfree_skb(skb);
306 }
307
308 void inet_frag_destroy(struct inet_frag_queue *q, struct inet_frags *f)
309 {
310 struct sk_buff *fp;
311 struct netns_frags *nf;
312 unsigned int sum, sum_truesize = 0;
313
314 WARN_ON(!(q->flags & INET_FRAG_COMPLETE));
315 WARN_ON(del_timer(&q->timer) != 0);
316
317 /* Release all fragment data. */
318 fp = q->fragments;
319 nf = q->net;
320 while (fp) {
321 struct sk_buff *xp = fp->next;
322
323 sum_truesize += fp->truesize;
324 frag_kfree_skb(nf, f, fp);
325 fp = xp;
326 }
327 sum = sum_truesize + f->qsize;
328 sub_frag_mem_limit(q, sum);
329
330 if (f->destructor)
331 f->destructor(q);
332 kfree(q);
333 }
334 EXPORT_SYMBOL(inet_frag_destroy);
335
336 static struct inet_frag_queue *inet_frag_intern(struct netns_frags *nf,
337 struct inet_frag_queue *qp_in,
338 struct inet_frags *f,
339 void *arg)
340 {
341 struct inet_frag_bucket *hb = get_frag_bucket_locked(qp_in, f);
342 struct inet_frag_queue *qp;
343
344 #ifdef CONFIG_SMP
345 /* With SMP race we have to recheck hash table, because
346 * such entry could have been created on other cpu before
347 * we acquired hash bucket lock.
348 */
349 hlist_for_each_entry(qp, &hb->chain, list) {
350 if (qp->net == nf && f->match(qp, arg)) {
351 atomic_inc(&qp->refcnt);
352 spin_unlock(&hb->chain_lock);
353 qp_in->flags |= INET_FRAG_COMPLETE;
354 inet_frag_put(qp_in, f);
355 return qp;
356 }
357 }
358 #endif
359 qp = qp_in;
360 if (!mod_timer(&qp->timer, jiffies + nf->timeout))
361 atomic_inc(&qp->refcnt);
362
363 atomic_inc(&qp->refcnt);
364 hlist_add_head(&qp->list, &hb->chain);
365
366 spin_unlock(&hb->chain_lock);
367
368 return qp;
369 }
370
371 static struct inet_frag_queue *inet_frag_alloc(struct netns_frags *nf,
372 struct inet_frags *f,
373 void *arg)
374 {
375 struct inet_frag_queue *q;
376
377 if (frag_mem_limit(nf) > nf->high_thresh) {
378 inet_frag_schedule_worker(f);
379 return NULL;
380 }
381
382 q = kzalloc(f->qsize, GFP_ATOMIC);
383 if (q == NULL)
384 return NULL;
385
386 q->net = nf;
387 f->constructor(q, arg);
388 add_frag_mem_limit(q, f->qsize);
389
390 setup_timer(&q->timer, f->frag_expire, (unsigned long)q);
391 spin_lock_init(&q->lock);
392 atomic_set(&q->refcnt, 1);
393
394 return q;
395 }
396
397 static struct inet_frag_queue *inet_frag_create(struct netns_frags *nf,
398 struct inet_frags *f,
399 void *arg)
400 {
401 struct inet_frag_queue *q;
402
403 q = inet_frag_alloc(nf, f, arg);
404 if (q == NULL)
405 return NULL;
406
407 return inet_frag_intern(nf, q, f, arg);
408 }
409
410 struct inet_frag_queue *inet_frag_find(struct netns_frags *nf,
411 struct inet_frags *f, void *key,
412 unsigned int hash)
413 {
414 struct inet_frag_bucket *hb;
415 struct inet_frag_queue *q;
416 int depth = 0;
417
418 if (frag_mem_limit(nf) > nf->low_thresh)
419 inet_frag_schedule_worker(f);
420
421 hash &= (INETFRAGS_HASHSZ - 1);
422 hb = &f->hash[hash];
423
424 spin_lock(&hb->chain_lock);
425 hlist_for_each_entry(q, &hb->chain, list) {
426 if (q->net == nf && f->match(q, key)) {
427 atomic_inc(&q->refcnt);
428 spin_unlock(&hb->chain_lock);
429 return q;
430 }
431 depth++;
432 }
433 spin_unlock(&hb->chain_lock);
434
435 if (depth <= INETFRAGS_MAXDEPTH)
436 return inet_frag_create(nf, f, key);
437
438 if (inet_frag_may_rebuild(f)) {
439 if (!f->rebuild)
440 f->rebuild = true;
441 inet_frag_schedule_worker(f);
442 }
443
444 return ERR_PTR(-ENOBUFS);
445 }
446 EXPORT_SYMBOL(inet_frag_find);
447
448 void inet_frag_maybe_warn_overflow(struct inet_frag_queue *q,
449 const char *prefix)
450 {
451 static const char msg[] = "inet_frag_find: Fragment hash bucket"
452 " list length grew over limit " __stringify(INETFRAGS_MAXDEPTH)
453 ". Dropping fragment.\n";
454
455 if (PTR_ERR(q) == -ENOBUFS)
456 LIMIT_NETDEBUG(KERN_WARNING "%s%s", prefix, msg);
457 }
458 EXPORT_SYMBOL(inet_frag_maybe_warn_overflow);
This page took 0.040113 seconds and 4 git commands to generate.