Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* flow.c: Generic flow cache. |
2 | * | |
3 | * Copyright (C) 2003 Alexey N. Kuznetsov (kuznet@ms2.inr.ac.ru) | |
4 | * Copyright (C) 2003 David S. Miller (davem@redhat.com) | |
5 | */ | |
6 | ||
7 | #include <linux/kernel.h> | |
8 | #include <linux/module.h> | |
9 | #include <linux/list.h> | |
10 | #include <linux/jhash.h> | |
11 | #include <linux/interrupt.h> | |
12 | #include <linux/mm.h> | |
13 | #include <linux/random.h> | |
14 | #include <linux/init.h> | |
15 | #include <linux/slab.h> | |
16 | #include <linux/smp.h> | |
17 | #include <linux/completion.h> | |
18 | #include <linux/percpu.h> | |
19 | #include <linux/bitops.h> | |
20 | #include <linux/notifier.h> | |
21 | #include <linux/cpu.h> | |
22 | #include <linux/cpumask.h> | |
4a3e2f71 | 23 | #include <linux/mutex.h> |
1da177e4 | 24 | #include <net/flow.h> |
60063497 | 25 | #include <linux/atomic.h> |
df71837d | 26 | #include <linux/security.h> |
ca925cf1 | 27 | #include <net/net_namespace.h> |
1da177e4 LT |
28 | |
29 | struct flow_cache_entry { | |
8e479560 TT |
30 | union { |
31 | struct hlist_node hlist; | |
32 | struct list_head gc_list; | |
33 | } u; | |
0542b69e | 34 | struct net *net; |
fe1a5f03 TT |
35 | u16 family; |
36 | u8 dir; | |
37 | u32 genid; | |
38 | struct flowi key; | |
39 | struct flow_cache_object *object; | |
1da177e4 LT |
40 | }; |
41 | ||
1da177e4 | 42 | struct flow_flush_info { |
fe1a5f03 | 43 | struct flow_cache *cache; |
d7997fe1 TT |
44 | atomic_t cpuleft; |
45 | struct completion completion; | |
1da177e4 | 46 | }; |
1da177e4 | 47 | |
d32d9bb8 ED |
48 | static struct kmem_cache *flow_cachep __read_mostly; |
49 | ||
d7997fe1 TT |
50 | #define flow_cache_hash_size(cache) (1 << (cache)->hash_shift) |
51 | #define FLOW_HASH_RND_PERIOD (10 * 60 * HZ) | |
1da177e4 LT |
52 | |
53 | static void flow_cache_new_hashrnd(unsigned long arg) | |
54 | { | |
d7997fe1 | 55 | struct flow_cache *fc = (void *) arg; |
1da177e4 LT |
56 | int i; |
57 | ||
6f912042 | 58 | for_each_possible_cpu(i) |
d7997fe1 | 59 | per_cpu_ptr(fc->percpu, i)->hash_rnd_recalc = 1; |
1da177e4 | 60 | |
d7997fe1 TT |
61 | fc->rnd_timer.expires = jiffies + FLOW_HASH_RND_PERIOD; |
62 | add_timer(&fc->rnd_timer); | |
1da177e4 LT |
63 | } |
64 | ||
ca925cf1 FD |
65 | static int flow_entry_valid(struct flow_cache_entry *fle, |
66 | struct netns_xfrm *xfrm) | |
fe1a5f03 | 67 | { |
ca925cf1 | 68 | if (atomic_read(&xfrm->flow_cache_genid) != fle->genid) |
fe1a5f03 TT |
69 | return 0; |
70 | if (fle->object && !fle->object->ops->check(fle->object)) | |
71 | return 0; | |
72 | return 1; | |
73 | } | |
74 | ||
ca925cf1 FD |
75 | static void flow_entry_kill(struct flow_cache_entry *fle, |
76 | struct netns_xfrm *xfrm) | |
134b0fc5 JM |
77 | { |
78 | if (fle->object) | |
fe1a5f03 | 79 | fle->object->ops->delete(fle->object); |
d32d9bb8 | 80 | kmem_cache_free(flow_cachep, fle); |
8e479560 TT |
81 | } |
82 | ||
83 | static void flow_cache_gc_task(struct work_struct *work) | |
84 | { | |
85 | struct list_head gc_list; | |
86 | struct flow_cache_entry *fce, *n; | |
ca925cf1 FD |
87 | struct netns_xfrm *xfrm = container_of(work, struct netns_xfrm, |
88 | flow_cache_gc_work); | |
8e479560 TT |
89 | |
90 | INIT_LIST_HEAD(&gc_list); | |
ca925cf1 FD |
91 | spin_lock_bh(&xfrm->flow_cache_gc_lock); |
92 | list_splice_tail_init(&xfrm->flow_cache_gc_list, &gc_list); | |
93 | spin_unlock_bh(&xfrm->flow_cache_gc_lock); | |
8e479560 TT |
94 | |
95 | list_for_each_entry_safe(fce, n, &gc_list, u.gc_list) | |
ca925cf1 | 96 | flow_entry_kill(fce, xfrm); |
8e479560 | 97 | } |
8e479560 TT |
98 | |
99 | static void flow_cache_queue_garbage(struct flow_cache_percpu *fcp, | |
ca925cf1 FD |
100 | int deleted, struct list_head *gc_list, |
101 | struct netns_xfrm *xfrm) | |
8e479560 TT |
102 | { |
103 | if (deleted) { | |
104 | fcp->hash_count -= deleted; | |
ca925cf1 FD |
105 | spin_lock_bh(&xfrm->flow_cache_gc_lock); |
106 | list_splice_tail(gc_list, &xfrm->flow_cache_gc_list); | |
107 | spin_unlock_bh(&xfrm->flow_cache_gc_lock); | |
108 | schedule_work(&xfrm->flow_cache_gc_work); | |
8e479560 | 109 | } |
134b0fc5 JM |
110 | } |
111 | ||
d7997fe1 TT |
112 | static void __flow_cache_shrink(struct flow_cache *fc, |
113 | struct flow_cache_percpu *fcp, | |
114 | int shrink_to) | |
1da177e4 | 115 | { |
8e479560 | 116 | struct flow_cache_entry *fle; |
b67bfe0d | 117 | struct hlist_node *tmp; |
8e479560 TT |
118 | LIST_HEAD(gc_list); |
119 | int i, deleted = 0; | |
ca925cf1 FD |
120 | struct netns_xfrm *xfrm = container_of(fc, struct netns_xfrm, |
121 | flow_cache_global); | |
1da177e4 | 122 | |
d7997fe1 | 123 | for (i = 0; i < flow_cache_hash_size(fc); i++) { |
fe1a5f03 | 124 | int saved = 0; |
1da177e4 | 125 | |
b67bfe0d | 126 | hlist_for_each_entry_safe(fle, tmp, |
8e479560 | 127 | &fcp->hash_table[i], u.hlist) { |
fe1a5f03 | 128 | if (saved < shrink_to && |
ca925cf1 | 129 | flow_entry_valid(fle, xfrm)) { |
fe1a5f03 | 130 | saved++; |
fe1a5f03 | 131 | } else { |
8e479560 TT |
132 | deleted++; |
133 | hlist_del(&fle->u.hlist); | |
134 | list_add_tail(&fle->u.gc_list, &gc_list); | |
fe1a5f03 | 135 | } |
1da177e4 LT |
136 | } |
137 | } | |
8e479560 | 138 | |
ca925cf1 | 139 | flow_cache_queue_garbage(fcp, deleted, &gc_list, xfrm); |
1da177e4 LT |
140 | } |
141 | ||
d7997fe1 TT |
142 | static void flow_cache_shrink(struct flow_cache *fc, |
143 | struct flow_cache_percpu *fcp) | |
1da177e4 | 144 | { |
d7997fe1 | 145 | int shrink_to = fc->low_watermark / flow_cache_hash_size(fc); |
1da177e4 | 146 | |
d7997fe1 | 147 | __flow_cache_shrink(fc, fcp, shrink_to); |
1da177e4 LT |
148 | } |
149 | ||
d7997fe1 TT |
150 | static void flow_new_hash_rnd(struct flow_cache *fc, |
151 | struct flow_cache_percpu *fcp) | |
1da177e4 | 152 | { |
d7997fe1 TT |
153 | get_random_bytes(&fcp->hash_rnd, sizeof(u32)); |
154 | fcp->hash_rnd_recalc = 0; | |
155 | __flow_cache_shrink(fc, fcp, 0); | |
1da177e4 LT |
156 | } |
157 | ||
d7997fe1 TT |
158 | static u32 flow_hash_code(struct flow_cache *fc, |
159 | struct flow_cache_percpu *fcp, | |
aa1c366e | 160 | const struct flowi *key, |
161 | size_t keysize) | |
1da177e4 | 162 | { |
dee9f4bc | 163 | const u32 *k = (const u32 *) key; |
aa1c366e | 164 | const u32 length = keysize * sizeof(flow_compare_t) / sizeof(u32); |
1da177e4 | 165 | |
aa1c366e | 166 | return jhash2(k, length, fcp->hash_rnd) |
a02cec21 | 167 | & (flow_cache_hash_size(fc) - 1); |
1da177e4 LT |
168 | } |
169 | ||
1da177e4 | 170 | /* I hear what you're saying, use memcmp. But memcmp cannot make |
aa1c366e | 171 | * important assumptions that we can here, such as alignment. |
1da177e4 | 172 | */ |
aa1c366e | 173 | static int flow_key_compare(const struct flowi *key1, const struct flowi *key2, |
174 | size_t keysize) | |
1da177e4 | 175 | { |
dee9f4bc | 176 | const flow_compare_t *k1, *k1_lim, *k2; |
1da177e4 | 177 | |
dee9f4bc | 178 | k1 = (const flow_compare_t *) key1; |
aa1c366e | 179 | k1_lim = k1 + keysize; |
1da177e4 | 180 | |
dee9f4bc | 181 | k2 = (const flow_compare_t *) key2; |
1da177e4 LT |
182 | |
183 | do { | |
184 | if (*k1++ != *k2++) | |
185 | return 1; | |
186 | } while (k1 < k1_lim); | |
187 | ||
188 | return 0; | |
189 | } | |
190 | ||
fe1a5f03 | 191 | struct flow_cache_object * |
dee9f4bc | 192 | flow_cache_lookup(struct net *net, const struct flowi *key, u16 family, u8 dir, |
fe1a5f03 | 193 | flow_resolve_t resolver, void *ctx) |
1da177e4 | 194 | { |
ca925cf1 | 195 | struct flow_cache *fc = &net->xfrm.flow_cache_global; |
d7997fe1 | 196 | struct flow_cache_percpu *fcp; |
8e479560 | 197 | struct flow_cache_entry *fle, *tfle; |
fe1a5f03 | 198 | struct flow_cache_object *flo; |
aa1c366e | 199 | size_t keysize; |
1da177e4 | 200 | unsigned int hash; |
1da177e4 LT |
201 | |
202 | local_bh_disable(); | |
7a9b2d59 | 203 | fcp = this_cpu_ptr(fc->percpu); |
1da177e4 LT |
204 | |
205 | fle = NULL; | |
fe1a5f03 | 206 | flo = NULL; |
aa1c366e | 207 | |
208 | keysize = flow_key_size(family); | |
209 | if (!keysize) | |
210 | goto nocache; | |
211 | ||
1da177e4 LT |
212 | /* Packet really early in init? Making flow_cache_init a |
213 | * pre-smp initcall would solve this. --RR */ | |
d7997fe1 | 214 | if (!fcp->hash_table) |
1da177e4 LT |
215 | goto nocache; |
216 | ||
d7997fe1 TT |
217 | if (fcp->hash_rnd_recalc) |
218 | flow_new_hash_rnd(fc, fcp); | |
1da177e4 | 219 | |
aa1c366e | 220 | hash = flow_hash_code(fc, fcp, key, keysize); |
b67bfe0d | 221 | hlist_for_each_entry(tfle, &fcp->hash_table[hash], u.hlist) { |
0542b69e | 222 | if (tfle->net == net && |
223 | tfle->family == family && | |
8e479560 | 224 | tfle->dir == dir && |
aa1c366e | 225 | flow_key_compare(key, &tfle->key, keysize) == 0) { |
8e479560 | 226 | fle = tfle; |
1da177e4 | 227 | break; |
8e479560 | 228 | } |
1da177e4 LT |
229 | } |
230 | ||
fe1a5f03 | 231 | if (unlikely(!fle)) { |
d7997fe1 TT |
232 | if (fcp->hash_count > fc->high_watermark) |
233 | flow_cache_shrink(fc, fcp); | |
1da177e4 | 234 | |
d32d9bb8 | 235 | fle = kmem_cache_alloc(flow_cachep, GFP_ATOMIC); |
1da177e4 | 236 | if (fle) { |
0542b69e | 237 | fle->net = net; |
1da177e4 LT |
238 | fle->family = family; |
239 | fle->dir = dir; | |
aa1c366e | 240 | memcpy(&fle->key, key, keysize * sizeof(flow_compare_t)); |
1da177e4 | 241 | fle->object = NULL; |
8e479560 | 242 | hlist_add_head(&fle->u.hlist, &fcp->hash_table[hash]); |
d7997fe1 | 243 | fcp->hash_count++; |
1da177e4 | 244 | } |
ca925cf1 | 245 | } else if (likely(fle->genid == atomic_read(&net->xfrm.flow_cache_genid))) { |
fe1a5f03 TT |
246 | flo = fle->object; |
247 | if (!flo) | |
248 | goto ret_object; | |
249 | flo = flo->ops->get(flo); | |
250 | if (flo) | |
251 | goto ret_object; | |
252 | } else if (fle->object) { | |
253 | flo = fle->object; | |
254 | flo->ops->delete(flo); | |
255 | fle->object = NULL; | |
1da177e4 LT |
256 | } |
257 | ||
258 | nocache: | |
fe1a5f03 TT |
259 | flo = NULL; |
260 | if (fle) { | |
261 | flo = fle->object; | |
262 | fle->object = NULL; | |
263 | } | |
264 | flo = resolver(net, key, family, dir, flo, ctx); | |
265 | if (fle) { | |
ca925cf1 | 266 | fle->genid = atomic_read(&net->xfrm.flow_cache_genid); |
fe1a5f03 TT |
267 | if (!IS_ERR(flo)) |
268 | fle->object = flo; | |
269 | else | |
270 | fle->genid--; | |
271 | } else { | |
8fbcec24 | 272 | if (!IS_ERR_OR_NULL(flo)) |
fe1a5f03 | 273 | flo->ops->delete(flo); |
1da177e4 | 274 | } |
fe1a5f03 TT |
275 | ret_object: |
276 | local_bh_enable(); | |
277 | return flo; | |
1da177e4 | 278 | } |
9e34a5b5 | 279 | EXPORT_SYMBOL(flow_cache_lookup); |
1da177e4 LT |
280 | |
281 | static void flow_cache_flush_tasklet(unsigned long data) | |
282 | { | |
283 | struct flow_flush_info *info = (void *)data; | |
d7997fe1 TT |
284 | struct flow_cache *fc = info->cache; |
285 | struct flow_cache_percpu *fcp; | |
8e479560 | 286 | struct flow_cache_entry *fle; |
b67bfe0d | 287 | struct hlist_node *tmp; |
8e479560 TT |
288 | LIST_HEAD(gc_list); |
289 | int i, deleted = 0; | |
ca925cf1 FD |
290 | struct netns_xfrm *xfrm = container_of(fc, struct netns_xfrm, |
291 | flow_cache_global); | |
1da177e4 | 292 | |
7a9b2d59 | 293 | fcp = this_cpu_ptr(fc->percpu); |
d7997fe1 | 294 | for (i = 0; i < flow_cache_hash_size(fc); i++) { |
b67bfe0d | 295 | hlist_for_each_entry_safe(fle, tmp, |
8e479560 | 296 | &fcp->hash_table[i], u.hlist) { |
ca925cf1 | 297 | if (flow_entry_valid(fle, xfrm)) |
1da177e4 LT |
298 | continue; |
299 | ||
8e479560 TT |
300 | deleted++; |
301 | hlist_del(&fle->u.hlist); | |
302 | list_add_tail(&fle->u.gc_list, &gc_list); | |
1da177e4 LT |
303 | } |
304 | } | |
305 | ||
ca925cf1 | 306 | flow_cache_queue_garbage(fcp, deleted, &gc_list, xfrm); |
8e479560 | 307 | |
1da177e4 LT |
308 | if (atomic_dec_and_test(&info->cpuleft)) |
309 | complete(&info->completion); | |
310 | } | |
311 | ||
8fdc929f CM |
312 | /* |
313 | * Return whether a cpu needs flushing. Conservatively, we assume | |
314 | * the presence of any entries means the core may require flushing, | |
315 | * since the flow_cache_ops.check() function may assume it's running | |
316 | * on the same core as the per-cpu cache component. | |
317 | */ | |
318 | static int flow_cache_percpu_empty(struct flow_cache *fc, int cpu) | |
319 | { | |
320 | struct flow_cache_percpu *fcp; | |
321 | int i; | |
322 | ||
27815032 | 323 | fcp = per_cpu_ptr(fc->percpu, cpu); |
8fdc929f CM |
324 | for (i = 0; i < flow_cache_hash_size(fc); i++) |
325 | if (!hlist_empty(&fcp->hash_table[i])) | |
326 | return 0; | |
327 | return 1; | |
328 | } | |
329 | ||
1da177e4 LT |
330 | static void flow_cache_flush_per_cpu(void *data) |
331 | { | |
332 | struct flow_flush_info *info = data; | |
1da177e4 LT |
333 | struct tasklet_struct *tasklet; |
334 | ||
50eab050 | 335 | tasklet = &this_cpu_ptr(info->cache->percpu)->flush_tasklet; |
1da177e4 LT |
336 | tasklet->data = (unsigned long)info; |
337 | tasklet_schedule(tasklet); | |
338 | } | |
339 | ||
ca925cf1 | 340 | void flow_cache_flush(struct net *net) |
1da177e4 LT |
341 | { |
342 | struct flow_flush_info info; | |
8fdc929f CM |
343 | cpumask_var_t mask; |
344 | int i, self; | |
345 | ||
346 | /* Track which cpus need flushing to avoid disturbing all cores. */ | |
347 | if (!alloc_cpumask_var(&mask, GFP_KERNEL)) | |
348 | return; | |
349 | cpumask_clear(mask); | |
1da177e4 LT |
350 | |
351 | /* Don't want cpus going down or up during this. */ | |
86ef5c9a | 352 | get_online_cpus(); |
ca925cf1 FD |
353 | mutex_lock(&net->xfrm.flow_flush_sem); |
354 | info.cache = &net->xfrm.flow_cache_global; | |
8fdc929f CM |
355 | for_each_online_cpu(i) |
356 | if (!flow_cache_percpu_empty(info.cache, i)) | |
357 | cpumask_set_cpu(i, mask); | |
358 | atomic_set(&info.cpuleft, cpumask_weight(mask)); | |
359 | if (atomic_read(&info.cpuleft) == 0) | |
360 | goto done; | |
361 | ||
1da177e4 LT |
362 | init_completion(&info.completion); |
363 | ||
364 | local_bh_disable(); | |
8fdc929f CM |
365 | self = cpumask_test_and_clear_cpu(smp_processor_id(), mask); |
366 | on_each_cpu_mask(mask, flow_cache_flush_per_cpu, &info, 0); | |
367 | if (self) | |
368 | flow_cache_flush_tasklet((unsigned long)&info); | |
1da177e4 LT |
369 | local_bh_enable(); |
370 | ||
371 | wait_for_completion(&info.completion); | |
8fdc929f CM |
372 | |
373 | done: | |
ca925cf1 | 374 | mutex_unlock(&net->xfrm.flow_flush_sem); |
86ef5c9a | 375 | put_online_cpus(); |
8fdc929f | 376 | free_cpumask_var(mask); |
1da177e4 LT |
377 | } |
378 | ||
c0ed1c14 SK |
379 | static void flow_cache_flush_task(struct work_struct *work) |
380 | { | |
ca925cf1 | 381 | struct netns_xfrm *xfrm = container_of(work, struct netns_xfrm, |
233c96fc | 382 | flow_cache_flush_work); |
ca925cf1 | 383 | struct net *net = container_of(xfrm, struct net, xfrm); |
c0ed1c14 | 384 | |
ca925cf1 FD |
385 | flow_cache_flush(net); |
386 | } | |
c0ed1c14 | 387 | |
ca925cf1 | 388 | void flow_cache_flush_deferred(struct net *net) |
c0ed1c14 | 389 | { |
ca925cf1 | 390 | schedule_work(&net->xfrm.flow_cache_flush_work); |
c0ed1c14 SK |
391 | } |
392 | ||
013dbb32 | 393 | static int flow_cache_cpu_prepare(struct flow_cache *fc, int cpu) |
1da177e4 | 394 | { |
83b6b1f5 ED |
395 | struct flow_cache_percpu *fcp = per_cpu_ptr(fc->percpu, cpu); |
396 | size_t sz = sizeof(struct hlist_head) * flow_cache_hash_size(fc); | |
d7997fe1 | 397 | |
83b6b1f5 ED |
398 | if (!fcp->hash_table) { |
399 | fcp->hash_table = kzalloc_node(sz, GFP_KERNEL, cpu_to_node(cpu)); | |
400 | if (!fcp->hash_table) { | |
401 | pr_err("NET: failed to allocate flow cache sz %zu\n", sz); | |
402 | return -ENOMEM; | |
403 | } | |
404 | fcp->hash_rnd_recalc = 1; | |
405 | fcp->hash_count = 0; | |
406 | tasklet_init(&fcp->flush_tasklet, flow_cache_flush_tasklet, 0); | |
407 | } | |
408 | return 0; | |
1da177e4 LT |
409 | } |
410 | ||
013dbb32 | 411 | static int flow_cache_cpu(struct notifier_block *nfb, |
1da177e4 LT |
412 | unsigned long action, |
413 | void *hcpu) | |
414 | { | |
ca925cf1 FD |
415 | struct flow_cache *fc = container_of(nfb, struct flow_cache, |
416 | hotcpu_notifier); | |
83b6b1f5 | 417 | int res, cpu = (unsigned long) hcpu; |
d7997fe1 TT |
418 | struct flow_cache_percpu *fcp = per_cpu_ptr(fc->percpu, cpu); |
419 | ||
83b6b1f5 ED |
420 | switch (action) { |
421 | case CPU_UP_PREPARE: | |
422 | case CPU_UP_PREPARE_FROZEN: | |
423 | res = flow_cache_cpu_prepare(fc, cpu); | |
424 | if (res) | |
425 | return notifier_from_errno(res); | |
426 | break; | |
427 | case CPU_DEAD: | |
428 | case CPU_DEAD_FROZEN: | |
d7997fe1 | 429 | __flow_cache_shrink(fc, fcp, 0); |
83b6b1f5 ED |
430 | break; |
431 | } | |
1da177e4 LT |
432 | return NOTIFY_OK; |
433 | } | |
1da177e4 | 434 | |
ca925cf1 | 435 | int flow_cache_init(struct net *net) |
1da177e4 LT |
436 | { |
437 | int i; | |
ca925cf1 FD |
438 | struct flow_cache *fc = &net->xfrm.flow_cache_global; |
439 | ||
d32d9bb8 ED |
440 | if (!flow_cachep) |
441 | flow_cachep = kmem_cache_create("flow_cache", | |
442 | sizeof(struct flow_cache_entry), | |
443 | 0, SLAB_PANIC, NULL); | |
ca925cf1 FD |
444 | spin_lock_init(&net->xfrm.flow_cache_gc_lock); |
445 | INIT_LIST_HEAD(&net->xfrm.flow_cache_gc_list); | |
446 | INIT_WORK(&net->xfrm.flow_cache_gc_work, flow_cache_gc_task); | |
447 | INIT_WORK(&net->xfrm.flow_cache_flush_work, flow_cache_flush_task); | |
448 | mutex_init(&net->xfrm.flow_flush_sem); | |
1da177e4 | 449 | |
d7997fe1 TT |
450 | fc->hash_shift = 10; |
451 | fc->low_watermark = 2 * flow_cache_hash_size(fc); | |
452 | fc->high_watermark = 4 * flow_cache_hash_size(fc); | |
453 | ||
d7997fe1 | 454 | fc->percpu = alloc_percpu(struct flow_cache_percpu); |
83b6b1f5 ED |
455 | if (!fc->percpu) |
456 | return -ENOMEM; | |
1da177e4 | 457 | |
e30a293e SB |
458 | cpu_notifier_register_begin(); |
459 | ||
83b6b1f5 ED |
460 | for_each_online_cpu(i) { |
461 | if (flow_cache_cpu_prepare(fc, i)) | |
6ccc3abd | 462 | goto err; |
83b6b1f5 | 463 | } |
d7997fe1 TT |
464 | fc->hotcpu_notifier = (struct notifier_block){ |
465 | .notifier_call = flow_cache_cpu, | |
466 | }; | |
e30a293e SB |
467 | __register_hotcpu_notifier(&fc->hotcpu_notifier); |
468 | ||
469 | cpu_notifier_register_done(); | |
1da177e4 | 470 | |
83b6b1f5 ED |
471 | setup_timer(&fc->rnd_timer, flow_cache_new_hashrnd, |
472 | (unsigned long) fc); | |
473 | fc->rnd_timer.expires = jiffies + FLOW_HASH_RND_PERIOD; | |
474 | add_timer(&fc->rnd_timer); | |
475 | ||
1da177e4 | 476 | return 0; |
6ccc3abd | 477 | |
478 | err: | |
479 | for_each_possible_cpu(i) { | |
480 | struct flow_cache_percpu *fcp = per_cpu_ptr(fc->percpu, i); | |
481 | kfree(fcp->hash_table); | |
482 | fcp->hash_table = NULL; | |
483 | } | |
484 | ||
e30a293e SB |
485 | cpu_notifier_register_done(); |
486 | ||
6ccc3abd | 487 | free_percpu(fc->percpu); |
488 | fc->percpu = NULL; | |
489 | ||
490 | return -ENOMEM; | |
1da177e4 | 491 | } |
ca925cf1 | 492 | EXPORT_SYMBOL(flow_cache_init); |
4a93f509 SK |
493 | |
494 | void flow_cache_fini(struct net *net) | |
495 | { | |
496 | int i; | |
497 | struct flow_cache *fc = &net->xfrm.flow_cache_global; | |
498 | ||
499 | del_timer_sync(&fc->rnd_timer); | |
500 | unregister_hotcpu_notifier(&fc->hotcpu_notifier); | |
501 | ||
502 | for_each_possible_cpu(i) { | |
503 | struct flow_cache_percpu *fcp = per_cpu_ptr(fc->percpu, i); | |
504 | kfree(fcp->hash_table); | |
505 | fcp->hash_table = NULL; | |
506 | } | |
507 | ||
508 | free_percpu(fc->percpu); | |
509 | fc->percpu = NULL; | |
510 | } | |
511 | EXPORT_SYMBOL(flow_cache_fini); |