]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - net/ipv4/inet_fragment.c
kcmp: make it depend on CHECKPOINT_RESTORE
[mirror_ubuntu-bionic-kernel.git] / net / ipv4 / inet_fragment.c
CommitLineData
7eb95156
PE
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>
321a3a99 19#include <linux/random.h>
1e4b8287
PE
20#include <linux/skbuff.h>
21#include <linux/rtnetlink.h>
5a0e3ad6 22#include <linux/slab.h>
7eb95156
PE
23
24#include <net/inet_frag.h>
25
321a3a99
PE
26static void inet_frag_secret_rebuild(unsigned long dummy)
27{
28 struct inet_frags *f = (struct inet_frags *)dummy;
29 unsigned long now = jiffies;
30 int i;
31
32 write_lock(&f->lock);
33 get_random_bytes(&f->rnd, sizeof(u32));
34 for (i = 0; i < INETFRAGS_HASHSZ; i++) {
35 struct inet_frag_queue *q;
36 struct hlist_node *p, *n;
37
38 hlist_for_each_entry_safe(q, p, n, &f->hash[i], list) {
39 unsigned int hval = f->hashfn(q);
40
41 if (hval != i) {
42 hlist_del(&q->list);
43
44 /* Relink to new hash chain. */
45 hlist_add_head(&q->list, &f->hash[hval]);
46 }
47 }
48 }
49 write_unlock(&f->lock);
50
3b4bc4a2 51 mod_timer(&f->secret_timer, now + f->secret_interval);
321a3a99
PE
52}
53
7eb95156
PE
54void inet_frags_init(struct inet_frags *f)
55{
56 int i;
57
58 for (i = 0; i < INETFRAGS_HASHSZ; i++)
59 INIT_HLIST_HEAD(&f->hash[i]);
60
7eb95156
PE
61 rwlock_init(&f->lock);
62
63 f->rnd = (u32) ((num_physpages ^ (num_physpages>>7)) ^
64 (jiffies ^ (jiffies >> 6)));
65
b24b8a24
PE
66 setup_timer(&f->secret_timer, inet_frag_secret_rebuild,
67 (unsigned long)f);
3b4bc4a2 68 f->secret_timer.expires = jiffies + f->secret_interval;
321a3a99 69 add_timer(&f->secret_timer);
7eb95156
PE
70}
71EXPORT_SYMBOL(inet_frags_init);
72
e5a2bb84
PE
73void inet_frags_init_net(struct netns_frags *nf)
74{
75 nf->nqueues = 0;
d433673e 76 init_frag_mem_limit(nf);
3140c25c 77 INIT_LIST_HEAD(&nf->lru_list);
3ef0eb0d 78 spin_lock_init(&nf->lru_lock);
e5a2bb84
PE
79}
80EXPORT_SYMBOL(inet_frags_init_net);
81
7eb95156
PE
82void inet_frags_fini(struct inet_frags *f)
83{
321a3a99 84 del_timer(&f->secret_timer);
7eb95156
PE
85}
86EXPORT_SYMBOL(inet_frags_fini);
277e650d 87
81566e83
PE
88void inet_frags_exit_net(struct netns_frags *nf, struct inet_frags *f)
89{
90 nf->low_thresh = 0;
e8e16b70
DM
91
92 local_bh_disable();
6b102865 93 inet_frag_evictor(nf, f, true);
e8e16b70 94 local_bh_enable();
6d7b857d
JDB
95
96 percpu_counter_destroy(&nf->mem);
81566e83
PE
97}
98EXPORT_SYMBOL(inet_frags_exit_net);
99
277e650d
PE
100static inline void fq_unlink(struct inet_frag_queue *fq, struct inet_frags *f)
101{
102 write_lock(&f->lock);
103 hlist_del(&fq->list);
e5a2bb84 104 fq->net->nqueues--;
277e650d 105 write_unlock(&f->lock);
3ef0eb0d 106 inet_frag_lru_del(fq);
277e650d
PE
107}
108
109void inet_frag_kill(struct inet_frag_queue *fq, struct inet_frags *f)
110{
111 if (del_timer(&fq->timer))
112 atomic_dec(&fq->refcnt);
113
bc578a54 114 if (!(fq->last_in & INET_FRAG_COMPLETE)) {
277e650d
PE
115 fq_unlink(fq, f);
116 atomic_dec(&fq->refcnt);
bc578a54 117 fq->last_in |= INET_FRAG_COMPLETE;
277e650d
PE
118 }
119}
277e650d 120EXPORT_SYMBOL(inet_frag_kill);
1e4b8287 121
6ddc0822 122static inline void frag_kfree_skb(struct netns_frags *nf, struct inet_frags *f,
d433673e 123 struct sk_buff *skb)
1e4b8287 124{
1e4b8287
PE
125 if (f->skb_free)
126 f->skb_free(skb);
127 kfree_skb(skb);
128}
129
130void inet_frag_destroy(struct inet_frag_queue *q, struct inet_frags *f,
131 int *work)
132{
133 struct sk_buff *fp;
6ddc0822 134 struct netns_frags *nf;
d433673e 135 unsigned int sum, sum_truesize = 0;
1e4b8287 136
547b792c
IJ
137 WARN_ON(!(q->last_in & INET_FRAG_COMPLETE));
138 WARN_ON(del_timer(&q->timer) != 0);
1e4b8287
PE
139
140 /* Release all fragment data. */
141 fp = q->fragments;
6ddc0822 142 nf = q->net;
1e4b8287
PE
143 while (fp) {
144 struct sk_buff *xp = fp->next;
145
d433673e
JDB
146 sum_truesize += fp->truesize;
147 frag_kfree_skb(nf, f, fp);
1e4b8287
PE
148 fp = xp;
149 }
d433673e 150 sum = sum_truesize + f->qsize;
1e4b8287 151 if (work)
d433673e
JDB
152 *work -= sum;
153 sub_frag_mem_limit(q, sum);
1e4b8287 154
c9547709
PE
155 if (f->destructor)
156 f->destructor(q);
157 kfree(q);
1e4b8287
PE
158
159}
160EXPORT_SYMBOL(inet_frag_destroy);
8e7999c4 161
6b102865 162int inet_frag_evictor(struct netns_frags *nf, struct inet_frags *f, bool force)
8e7999c4
PE
163{
164 struct inet_frag_queue *q;
165 int work, evicted = 0;
166
6b102865 167 if (!force) {
d433673e 168 if (frag_mem_limit(nf) <= nf->high_thresh)
6b102865
AW
169 return 0;
170 }
171
d433673e 172 work = frag_mem_limit(nf) - nf->low_thresh;
8e7999c4 173 while (work > 0) {
3ef0eb0d
JDB
174 spin_lock(&nf->lru_lock);
175
3140c25c 176 if (list_empty(&nf->lru_list)) {
3ef0eb0d 177 spin_unlock(&nf->lru_lock);
8e7999c4
PE
178 break;
179 }
180
3140c25c 181 q = list_first_entry(&nf->lru_list,
8e7999c4
PE
182 struct inet_frag_queue, lru_list);
183 atomic_inc(&q->refcnt);
3ef0eb0d 184 spin_unlock(&nf->lru_lock);
8e7999c4
PE
185
186 spin_lock(&q->lock);
bc578a54 187 if (!(q->last_in & INET_FRAG_COMPLETE))
8e7999c4
PE
188 inet_frag_kill(q, f);
189 spin_unlock(&q->lock);
190
191 if (atomic_dec_and_test(&q->refcnt))
192 inet_frag_destroy(q, f, &work);
193 evicted++;
194 }
195
196 return evicted;
197}
198EXPORT_SYMBOL(inet_frag_evictor);
2588fe1d 199
ac18e750
PE
200static struct inet_frag_queue *inet_frag_intern(struct netns_frags *nf,
201 struct inet_frag_queue *qp_in, struct inet_frags *f,
9a375803 202 void *arg)
2588fe1d
PE
203{
204 struct inet_frag_queue *qp;
205#ifdef CONFIG_SMP
206 struct hlist_node *n;
207#endif
9a375803 208 unsigned int hash;
2588fe1d
PE
209
210 write_lock(&f->lock);
9a375803
PE
211 /*
212 * While we stayed w/o the lock other CPU could update
213 * the rnd seed, so we need to re-calculate the hash
214 * chain. Fortunatelly the qp_in can be used to get one.
215 */
216 hash = f->hashfn(qp_in);
2588fe1d
PE
217#ifdef CONFIG_SMP
218 /* With SMP race we have to recheck hash table, because
219 * such entry could be created on other cpu, while we
220 * promoted read lock to write lock.
221 */
222 hlist_for_each_entry(qp, n, &f->hash[hash], list) {
ac18e750 223 if (qp->net == nf && f->match(qp, arg)) {
2588fe1d
PE
224 atomic_inc(&qp->refcnt);
225 write_unlock(&f->lock);
bc578a54 226 qp_in->last_in |= INET_FRAG_COMPLETE;
2588fe1d
PE
227 inet_frag_put(qp_in, f);
228 return qp;
229 }
230 }
231#endif
232 qp = qp_in;
b2fd5321 233 if (!mod_timer(&qp->timer, jiffies + nf->timeout))
2588fe1d
PE
234 atomic_inc(&qp->refcnt);
235
236 atomic_inc(&qp->refcnt);
237 hlist_add_head(&qp->list, &f->hash[hash]);
e5a2bb84 238 nf->nqueues++;
2588fe1d 239 write_unlock(&f->lock);
3ef0eb0d 240 inet_frag_lru_add(nf, qp);
2588fe1d
PE
241 return qp;
242}
e521db9d 243
ac18e750
PE
244static struct inet_frag_queue *inet_frag_alloc(struct netns_frags *nf,
245 struct inet_frags *f, void *arg)
e521db9d
PE
246{
247 struct inet_frag_queue *q;
248
249 q = kzalloc(f->qsize, GFP_ATOMIC);
250 if (q == NULL)
251 return NULL;
252
54db0cc2 253 q->net = nf;
c6fda282 254 f->constructor(q, arg);
d433673e
JDB
255 add_frag_mem_limit(q, f->qsize);
256
e521db9d
PE
257 setup_timer(&q->timer, f->frag_expire, (unsigned long)q);
258 spin_lock_init(&q->lock);
259 atomic_set(&q->refcnt, 1);
260
261 return q;
262}
c6fda282 263
ac18e750 264static struct inet_frag_queue *inet_frag_create(struct netns_frags *nf,
9a375803 265 struct inet_frags *f, void *arg)
c6fda282
PE
266{
267 struct inet_frag_queue *q;
268
ac18e750 269 q = inet_frag_alloc(nf, f, arg);
c6fda282
PE
270 if (q == NULL)
271 return NULL;
272
9a375803 273 return inet_frag_intern(nf, q, f, arg);
c6fda282 274}
abd6523d 275
ac18e750
PE
276struct inet_frag_queue *inet_frag_find(struct netns_frags *nf,
277 struct inet_frags *f, void *key, unsigned int hash)
56bca31f 278 __releases(&f->lock)
abd6523d
PE
279{
280 struct inet_frag_queue *q;
281 struct hlist_node *n;
282
abd6523d 283 hlist_for_each_entry(q, n, &f->hash[hash], list) {
ac18e750 284 if (q->net == nf && f->match(q, key)) {
abd6523d
PE
285 atomic_inc(&q->refcnt);
286 read_unlock(&f->lock);
287 return q;
288 }
289 }
290 read_unlock(&f->lock);
291
9a375803 292 return inet_frag_create(nf, f, key);
abd6523d
PE
293}
294EXPORT_SYMBOL(inet_frag_find);