]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * net/core/dst.c Protocol independent destination cache. | |
3 | * | |
4 | * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru> | |
5 | * | |
6 | */ | |
7 | ||
8 | #include <linux/bitops.h> | |
9 | #include <linux/errno.h> | |
10 | #include <linux/init.h> | |
11 | #include <linux/kernel.h> | |
86bba269 | 12 | #include <linux/workqueue.h> |
1da177e4 LT |
13 | #include <linux/mm.h> |
14 | #include <linux/module.h> | |
5a0e3ad6 | 15 | #include <linux/slab.h> |
1da177e4 | 16 | #include <linux/netdevice.h> |
1da177e4 LT |
17 | #include <linux/skbuff.h> |
18 | #include <linux/string.h> | |
19 | #include <linux/types.h> | |
e9dc8653 | 20 | #include <net/net_namespace.h> |
2fc1b5dd | 21 | #include <linux/sched.h> |
268bb0ce | 22 | #include <linux/prefetch.h> |
61adedf3 | 23 | #include <net/lwtunnel.h> |
1da177e4 LT |
24 | |
25 | #include <net/dst.h> | |
f38a9eb1 | 26 | #include <net/dst_metadata.h> |
1da177e4 | 27 | |
86bba269 ED |
28 | /* |
29 | * Theory of operations: | |
30 | * 1) We use a list, protected by a spinlock, to add | |
31 | * new entries from both BH and non-BH context. | |
32 | * 2) In order to keep spinlock held for a small delay, | |
33 | * we use a second list where are stored long lived | |
34 | * entries, that are handled by the garbage collect thread | |
35 | * fired by a workqueue. | |
36 | * 3) This list is guarded by a mutex, | |
37 | * so that the gc_task and dst_dev_event() can be synchronized. | |
1da177e4 | 38 | */ |
1da177e4 | 39 | |
86bba269 ED |
40 | /* |
41 | * We want to keep lock & list close together | |
42 | * to dirty as few cache lines as possible in __dst_free(). | |
43 | * As this is not a very strong hint, we dont force an alignment on SMP. | |
44 | */ | |
45 | static struct { | |
46 | spinlock_t lock; | |
598ed936 | 47 | struct dst_entry *list; |
86bba269 ED |
48 | unsigned long timer_inc; |
49 | unsigned long timer_expires; | |
50 | } dst_garbage = { | |
51 | .lock = __SPIN_LOCK_UNLOCKED(dst_garbage.lock), | |
52 | .timer_inc = DST_GC_MAX, | |
53 | }; | |
54 | static void dst_gc_task(struct work_struct *work); | |
598ed936 | 55 | static void ___dst_free(struct dst_entry *dst); |
1da177e4 | 56 | |
86bba269 | 57 | static DECLARE_DELAYED_WORK(dst_gc_work, dst_gc_task); |
1da177e4 | 58 | |
86bba269 ED |
59 | static DEFINE_MUTEX(dst_gc_mutex); |
60 | /* | |
61 | * long lived entries are maintained in this list, guarded by dst_gc_mutex | |
62 | */ | |
63 | static struct dst_entry *dst_busy_list; | |
64 | ||
65 | static void dst_gc_task(struct work_struct *work) | |
1da177e4 LT |
66 | { |
67 | int delayed = 0; | |
86bba269 ED |
68 | int work_performed = 0; |
69 | unsigned long expires = ~0L; | |
70 | struct dst_entry *dst, *next, head; | |
71 | struct dst_entry *last = &head; | |
1da177e4 | 72 | |
86bba269 ED |
73 | mutex_lock(&dst_gc_mutex); |
74 | next = dst_busy_list; | |
1da177e4 | 75 | |
86bba269 ED |
76 | loop: |
77 | while ((dst = next) != NULL) { | |
78 | next = dst->next; | |
79 | prefetch(&next->next); | |
2fc1b5dd | 80 | cond_resched(); |
86bba269 ED |
81 | if (likely(atomic_read(&dst->__refcnt))) { |
82 | last->next = dst; | |
83 | last = dst; | |
1da177e4 LT |
84 | delayed++; |
85 | continue; | |
86 | } | |
86bba269 | 87 | work_performed++; |
1da177e4 LT |
88 | |
89 | dst = dst_destroy(dst); | |
90 | if (dst) { | |
91 | /* NOHASH and still referenced. Unless it is already | |
92 | * on gc list, invalidate it and add to gc list. | |
93 | * | |
94 | * Note: this is temporary. Actually, NOHASH dst's | |
95 | * must be obsoleted when parent is obsoleted. | |
96 | * But we do not have state "obsoleted, but | |
97 | * referenced by parent", so it is right. | |
98 | */ | |
f5b0a874 | 99 | if (dst->obsolete > 0) |
1da177e4 LT |
100 | continue; |
101 | ||
102 | ___dst_free(dst); | |
86bba269 ED |
103 | dst->next = next; |
104 | next = dst; | |
1da177e4 LT |
105 | } |
106 | } | |
86bba269 ED |
107 | |
108 | spin_lock_bh(&dst_garbage.lock); | |
109 | next = dst_garbage.list; | |
110 | if (next) { | |
111 | dst_garbage.list = NULL; | |
112 | spin_unlock_bh(&dst_garbage.lock); | |
113 | goto loop; | |
1da177e4 | 114 | } |
86bba269 ED |
115 | last->next = NULL; |
116 | dst_busy_list = head.next; | |
117 | if (!dst_busy_list) | |
118 | dst_garbage.timer_inc = DST_GC_MAX; | |
119 | else { | |
120 | /* | |
121 | * if we freed less than 1/10 of delayed entries, | |
122 | * we can sleep longer. | |
123 | */ | |
124 | if (work_performed <= delayed/10) { | |
125 | dst_garbage.timer_expires += dst_garbage.timer_inc; | |
126 | if (dst_garbage.timer_expires > DST_GC_MAX) | |
127 | dst_garbage.timer_expires = DST_GC_MAX; | |
128 | dst_garbage.timer_inc += DST_GC_INC; | |
129 | } else { | |
130 | dst_garbage.timer_inc = DST_GC_INC; | |
131 | dst_garbage.timer_expires = DST_GC_MIN; | |
132 | } | |
133 | expires = dst_garbage.timer_expires; | |
134 | /* | |
598ed936 | 135 | * if the next desired timer is more than 4 seconds in the |
136 | * future then round the timer to whole seconds | |
86bba269 ED |
137 | */ |
138 | if (expires > 4*HZ) | |
139 | expires = round_jiffies_relative(expires); | |
140 | schedule_delayed_work(&dst_gc_work, expires); | |
f0098f78 | 141 | } |
86bba269 ED |
142 | |
143 | spin_unlock_bh(&dst_garbage.lock); | |
144 | mutex_unlock(&dst_gc_mutex); | |
1da177e4 LT |
145 | } |
146 | ||
ede2059d | 147 | int dst_discard_out(struct net *net, struct sock *sk, struct sk_buff *skb) |
1da177e4 LT |
148 | { |
149 | kfree_skb(skb); | |
150 | return 0; | |
151 | } | |
ede2059d | 152 | EXPORT_SYMBOL(dst_discard_out); |
1da177e4 | 153 | |
3fb07daf | 154 | const struct dst_metrics dst_default_metrics = { |
a37e6e34 ED |
155 | /* This initializer is needed to force linker to place this variable |
156 | * into const section. Otherwise it might end into bss section. | |
157 | * We really want to avoid false sharing on this variable, and catch | |
158 | * any writes on it. | |
159 | */ | |
3fb07daf | 160 | .refcnt = ATOMIC_INIT(1), |
a37e6e34 ED |
161 | }; |
162 | ||
f38a9eb1 TG |
163 | void dst_init(struct dst_entry *dst, struct dst_ops *ops, |
164 | struct net_device *dev, int initial_ref, int initial_obsolete, | |
165 | unsigned short flags) | |
1da177e4 | 166 | { |
cf911662 | 167 | dst->child = NULL; |
5c1e6aa3 DM |
168 | dst->dev = dev; |
169 | if (dev) | |
170 | dev_hold(dev); | |
1da177e4 | 171 | dst->ops = ops; |
3fb07daf | 172 | dst_init_metrics(dst, dst_default_metrics.metrics, true); |
cf911662 | 173 | dst->expires = 0UL; |
5c1e6aa3 | 174 | dst->path = dst; |
ecd98837 | 175 | dst->from = NULL; |
cf911662 DM |
176 | #ifdef CONFIG_XFRM |
177 | dst->xfrm = NULL; | |
178 | #endif | |
5c1e6aa3 | 179 | dst->input = dst_discard; |
ede2059d | 180 | dst->output = dst_discard_out; |
cf911662 | 181 | dst->error = 0; |
5c1e6aa3 | 182 | dst->obsolete = initial_obsolete; |
cf911662 DM |
183 | dst->header_len = 0; |
184 | dst->trailer_len = 0; | |
185 | #ifdef CONFIG_IP_ROUTE_CLASSID | |
186 | dst->tclassid = 0; | |
1da177e4 | 187 | #endif |
61adedf3 | 188 | dst->lwtstate = NULL; |
5c1e6aa3 | 189 | atomic_set(&dst->__refcnt, initial_ref); |
cf911662 | 190 | dst->__use = 0; |
5c1e6aa3 DM |
191 | dst->lastuse = jiffies; |
192 | dst->flags = flags; | |
cf911662 | 193 | dst->next = NULL; |
957c665f DM |
194 | if (!(flags & DST_NOCOUNT)) |
195 | dst_entries_add(ops, 1); | |
f38a9eb1 TG |
196 | } |
197 | EXPORT_SYMBOL(dst_init); | |
198 | ||
199 | void *dst_alloc(struct dst_ops *ops, struct net_device *dev, | |
200 | int initial_ref, int initial_obsolete, unsigned short flags) | |
201 | { | |
202 | struct dst_entry *dst; | |
203 | ||
204 | if (ops->gc && dst_entries_get_fast(ops) > ops->gc_thresh) { | |
205 | if (ops->gc(ops)) | |
206 | return NULL; | |
207 | } | |
208 | ||
209 | dst = kmem_cache_alloc(ops->kmem_cachep, GFP_ATOMIC); | |
210 | if (!dst) | |
211 | return NULL; | |
212 | ||
213 | dst_init(dst, ops, dev, initial_ref, initial_obsolete, flags); | |
214 | ||
1da177e4 LT |
215 | return dst; |
216 | } | |
598ed936 | 217 | EXPORT_SYMBOL(dst_alloc); |
1da177e4 | 218 | |
598ed936 | 219 | static void ___dst_free(struct dst_entry *dst) |
1da177e4 LT |
220 | { |
221 | /* The first case (dev==NULL) is required, when | |
222 | protocol module is unloaded. | |
223 | */ | |
aad88724 ED |
224 | if (dst->dev == NULL || !(dst->dev->flags&IFF_UP)) { |
225 | dst->input = dst_discard; | |
ede2059d | 226 | dst->output = dst_discard_out; |
aad88724 | 227 | } |
f5b0a874 | 228 | dst->obsolete = DST_OBSOLETE_DEAD; |
1da177e4 LT |
229 | } |
230 | ||
598ed936 | 231 | void __dst_free(struct dst_entry *dst) |
1da177e4 | 232 | { |
86bba269 | 233 | spin_lock_bh(&dst_garbage.lock); |
1da177e4 | 234 | ___dst_free(dst); |
86bba269 ED |
235 | dst->next = dst_garbage.list; |
236 | dst_garbage.list = dst; | |
237 | if (dst_garbage.timer_inc > DST_GC_INC) { | |
238 | dst_garbage.timer_inc = DST_GC_INC; | |
239 | dst_garbage.timer_expires = DST_GC_MIN; | |
41f63c53 TH |
240 | mod_delayed_work(system_wq, &dst_gc_work, |
241 | dst_garbage.timer_expires); | |
1da177e4 | 242 | } |
86bba269 | 243 | spin_unlock_bh(&dst_garbage.lock); |
1da177e4 | 244 | } |
d79d9913 | 245 | EXPORT_SYMBOL(__dst_free); |
1da177e4 LT |
246 | |
247 | struct dst_entry *dst_destroy(struct dst_entry * dst) | |
248 | { | |
249 | struct dst_entry *child; | |
1da177e4 LT |
250 | |
251 | smp_rmb(); | |
252 | ||
1da177e4 LT |
253 | child = dst->child; |
254 | ||
957c665f DM |
255 | if (!(dst->flags & DST_NOCOUNT)) |
256 | dst_entries_add(dst->ops, -1); | |
1da177e4 LT |
257 | |
258 | if (dst->ops->destroy) | |
259 | dst->ops->destroy(dst); | |
260 | if (dst->dev) | |
261 | dev_put(dst->dev); | |
f38a9eb1 | 262 | |
e252b3d1 WC |
263 | lwtstate_put(dst->lwtstate); |
264 | ||
f38a9eb1 | 265 | if (dst->flags & DST_METADATA) |
d71785ff | 266 | metadata_dst_free((struct metadata_dst *)dst); |
f38a9eb1 TG |
267 | else |
268 | kmem_cache_free(dst->ops->kmem_cachep, dst); | |
1da177e4 LT |
269 | |
270 | dst = child; | |
52df157f WW |
271 | if (dst) |
272 | dst_release_immediate(dst); | |
1da177e4 LT |
273 | return NULL; |
274 | } | |
598ed936 | 275 | EXPORT_SYMBOL(dst_destroy); |
1da177e4 | 276 | |
f8864972 ED |
277 | static void dst_destroy_rcu(struct rcu_head *head) |
278 | { | |
279 | struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head); | |
280 | ||
281 | dst = dst_destroy(dst); | |
f8864972 ED |
282 | } |
283 | ||
4a6ce2b6 WW |
284 | /* Operations to mark dst as DEAD and clean up the net device referenced |
285 | * by dst: | |
286 | * 1. put the dst under loopback interface and discard all tx/rx packets | |
287 | * on this route. | |
288 | * 2. release the net_device | |
289 | * This function should be called when removing routes from the fib tree | |
290 | * in preparation for a NETDEV_DOWN/NETDEV_UNREGISTER event and also to | |
291 | * make the next dst_ops->check() fail. | |
292 | */ | |
293 | void dst_dev_put(struct dst_entry *dst) | |
294 | { | |
295 | struct net_device *dev = dst->dev; | |
296 | ||
297 | dst->obsolete = DST_OBSOLETE_DEAD; | |
298 | if (dst->ops->ifdown) | |
299 | dst->ops->ifdown(dst, dev, true); | |
300 | dst->input = dst_discard; | |
301 | dst->output = dst_discard_out; | |
302 | dst->dev = dev_net(dst->dev)->loopback_dev; | |
303 | dev_hold(dst->dev); | |
304 | dev_put(dev); | |
305 | } | |
306 | EXPORT_SYMBOL(dst_dev_put); | |
307 | ||
8d330868 IJ |
308 | void dst_release(struct dst_entry *dst) |
309 | { | |
310 | if (dst) { | |
598ed936 | 311 | int newrefcnt; |
5f56f409 WW |
312 | unsigned short destroy_after_rcu = dst->flags & |
313 | (DST_NOCACHE | DST_NOGC); | |
ef711cf1 | 314 | |
598ed936 | 315 | newrefcnt = atomic_dec_return(&dst->__refcnt); |
8bf4ada2 KK |
316 | if (unlikely(newrefcnt < 0)) |
317 | net_warn_ratelimited("%s: dst:%p refcnt:%d\n", | |
318 | __func__, dst, newrefcnt); | |
5f56f409 | 319 | if (!newrefcnt && unlikely(destroy_after_rcu)) |
f8864972 | 320 | call_rcu(&dst->rcu_head, dst_destroy_rcu); |
8d330868 IJ |
321 | } |
322 | } | |
323 | EXPORT_SYMBOL(dst_release); | |
324 | ||
5f56f409 WW |
325 | void dst_release_immediate(struct dst_entry *dst) |
326 | { | |
327 | if (dst) { | |
328 | int newrefcnt; | |
329 | ||
330 | newrefcnt = atomic_dec_return(&dst->__refcnt); | |
331 | if (unlikely(newrefcnt < 0)) | |
332 | net_warn_ratelimited("%s: dst:%p refcnt:%d\n", | |
333 | __func__, dst, newrefcnt); | |
334 | if (!newrefcnt) | |
335 | dst_destroy(dst); | |
336 | } | |
337 | } | |
338 | EXPORT_SYMBOL(dst_release_immediate); | |
339 | ||
62fa8a84 DM |
340 | u32 *dst_cow_metrics_generic(struct dst_entry *dst, unsigned long old) |
341 | { | |
3fb07daf | 342 | struct dst_metrics *p = kmalloc(sizeof(*p), GFP_ATOMIC); |
62fa8a84 DM |
343 | |
344 | if (p) { | |
3fb07daf | 345 | struct dst_metrics *old_p = (struct dst_metrics *)__DST_METRICS_PTR(old); |
62fa8a84 DM |
346 | unsigned long prev, new; |
347 | ||
3fb07daf ED |
348 | atomic_set(&p->refcnt, 1); |
349 | memcpy(p->metrics, old_p->metrics, sizeof(p->metrics)); | |
62fa8a84 DM |
350 | |
351 | new = (unsigned long) p; | |
352 | prev = cmpxchg(&dst->_metrics, old, new); | |
353 | ||
354 | if (prev != old) { | |
355 | kfree(p); | |
3fb07daf | 356 | p = (struct dst_metrics *)__DST_METRICS_PTR(prev); |
62fa8a84 DM |
357 | if (prev & DST_METRICS_READ_ONLY) |
358 | p = NULL; | |
3fb07daf ED |
359 | } else if (prev & DST_METRICS_REFCOUNTED) { |
360 | if (atomic_dec_and_test(&old_p->refcnt)) | |
361 | kfree(old_p); | |
62fa8a84 DM |
362 | } |
363 | } | |
3fb07daf ED |
364 | BUILD_BUG_ON(offsetof(struct dst_metrics, metrics) != 0); |
365 | return (u32 *)p; | |
62fa8a84 DM |
366 | } |
367 | EXPORT_SYMBOL(dst_cow_metrics_generic); | |
368 | ||
369 | /* Caller asserts that dst_metrics_read_only(dst) is false. */ | |
370 | void __dst_destroy_metrics_generic(struct dst_entry *dst, unsigned long old) | |
371 | { | |
372 | unsigned long prev, new; | |
373 | ||
3fb07daf | 374 | new = ((unsigned long) &dst_default_metrics) | DST_METRICS_READ_ONLY; |
62fa8a84 DM |
375 | prev = cmpxchg(&dst->_metrics, old, new); |
376 | if (prev == old) | |
377 | kfree(__DST_METRICS_PTR(old)); | |
378 | } | |
379 | EXPORT_SYMBOL(__dst_destroy_metrics_generic); | |
380 | ||
f38a9eb1 TG |
381 | static struct dst_ops md_dst_ops = { |
382 | .family = AF_UNSPEC, | |
383 | }; | |
384 | ||
ede2059d | 385 | static int dst_md_discard_out(struct net *net, struct sock *sk, struct sk_buff *skb) |
f38a9eb1 TG |
386 | { |
387 | WARN_ONCE(1, "Attempting to call output on metadata dst\n"); | |
388 | kfree_skb(skb); | |
389 | return 0; | |
390 | } | |
391 | ||
392 | static int dst_md_discard(struct sk_buff *skb) | |
393 | { | |
394 | WARN_ONCE(1, "Attempting to call input on metadata dst\n"); | |
395 | kfree_skb(skb); | |
396 | return 0; | |
397 | } | |
398 | ||
d3aa45ce | 399 | static void __metadata_dst_init(struct metadata_dst *md_dst, u8 optslen) |
f38a9eb1 | 400 | { |
f38a9eb1 TG |
401 | struct dst_entry *dst; |
402 | ||
f38a9eb1 TG |
403 | dst = &md_dst->dst; |
404 | dst_init(dst, &md_dst_ops, NULL, 1, DST_OBSOLETE_NONE, | |
405 | DST_METADATA | DST_NOCACHE | DST_NOCOUNT); | |
406 | ||
407 | dst->input = dst_md_discard; | |
ede2059d | 408 | dst->output = dst_md_discard_out; |
f38a9eb1 TG |
409 | |
410 | memset(dst + 1, 0, sizeof(*md_dst) + optslen - sizeof(*dst)); | |
d3aa45ce AS |
411 | } |
412 | ||
413 | struct metadata_dst *metadata_dst_alloc(u8 optslen, gfp_t flags) | |
414 | { | |
415 | struct metadata_dst *md_dst; | |
416 | ||
417 | md_dst = kmalloc(sizeof(*md_dst) + optslen, flags); | |
418 | if (!md_dst) | |
419 | return NULL; | |
420 | ||
421 | __metadata_dst_init(md_dst, optslen); | |
f38a9eb1 TG |
422 | |
423 | return md_dst; | |
424 | } | |
425 | EXPORT_SYMBOL_GPL(metadata_dst_alloc); | |
426 | ||
d71785ff PA |
427 | void metadata_dst_free(struct metadata_dst *md_dst) |
428 | { | |
429 | #ifdef CONFIG_DST_CACHE | |
430 | dst_cache_destroy(&md_dst->u.tun_info.dst_cache); | |
431 | #endif | |
432 | kfree(md_dst); | |
433 | } | |
434 | ||
d3aa45ce AS |
435 | struct metadata_dst __percpu *metadata_dst_alloc_percpu(u8 optslen, gfp_t flags) |
436 | { | |
437 | int cpu; | |
438 | struct metadata_dst __percpu *md_dst; | |
439 | ||
440 | md_dst = __alloc_percpu_gfp(sizeof(struct metadata_dst) + optslen, | |
441 | __alignof__(struct metadata_dst), flags); | |
442 | if (!md_dst) | |
443 | return NULL; | |
444 | ||
445 | for_each_possible_cpu(cpu) | |
446 | __metadata_dst_init(per_cpu_ptr(md_dst, cpu), optslen); | |
447 | ||
448 | return md_dst; | |
449 | } | |
450 | EXPORT_SYMBOL_GPL(metadata_dst_alloc_percpu); | |
451 | ||
1da177e4 LT |
452 | /* Dirty hack. We did it in 2.2 (in __dst_free), |
453 | * we have _very_ good reasons not to repeat | |
454 | * this mistake in 2.3, but we have no choice | |
455 | * now. _It_ _is_ _explicit_ _deliberate_ | |
456 | * _race_ _condition_. | |
457 | * | |
458 | * Commented and originally written by Alexey. | |
459 | */ | |
56115511 | 460 | static void dst_ifdown(struct dst_entry *dst, struct net_device *dev, |
461 | int unregister) | |
1da177e4 LT |
462 | { |
463 | if (dst->ops->ifdown) | |
464 | dst->ops->ifdown(dst, dev, unregister); | |
465 | ||
466 | if (dev != dst->dev) | |
467 | return; | |
468 | ||
469 | if (!unregister) { | |
aad88724 | 470 | dst->input = dst_discard; |
ede2059d | 471 | dst->output = dst_discard_out; |
1da177e4 | 472 | } else { |
c346dca1 | 473 | dst->dev = dev_net(dst->dev)->loopback_dev; |
de3cb747 | 474 | dev_hold(dst->dev); |
1da177e4 | 475 | dev_put(dev); |
1da177e4 LT |
476 | } |
477 | } | |
478 | ||
598ed936 | 479 | static int dst_dev_event(struct notifier_block *this, unsigned long event, |
480 | void *ptr) | |
1da177e4 | 481 | { |
351638e7 | 482 | struct net_device *dev = netdev_notifier_info_to_dev(ptr); |
86bba269 | 483 | struct dst_entry *dst, *last = NULL; |
1da177e4 LT |
484 | |
485 | switch (event) { | |
0115e8e3 | 486 | case NETDEV_UNREGISTER_FINAL: |
1da177e4 | 487 | case NETDEV_DOWN: |
86bba269 ED |
488 | mutex_lock(&dst_gc_mutex); |
489 | for (dst = dst_busy_list; dst; dst = dst->next) { | |
490 | last = dst; | |
491 | dst_ifdown(dst, dev, event != NETDEV_DOWN); | |
492 | } | |
493 | ||
494 | spin_lock_bh(&dst_garbage.lock); | |
495 | dst = dst_garbage.list; | |
496 | dst_garbage.list = NULL; | |
f186ce61 KJ |
497 | /* The code in dst_ifdown places a hold on the loopback device. |
498 | * If the gc entry processing is set to expire after a lengthy | |
499 | * interval, this hold can cause netdev_wait_allrefs() to hang | |
500 | * out and wait for a long time -- until the the loopback | |
501 | * interface is released. If we're really unlucky, it'll emit | |
502 | * pr_emerg messages to console too. Reset the interval here, | |
503 | * so dst cleanups occur in a more timely fashion. | |
504 | */ | |
505 | if (dst_garbage.timer_inc > DST_GC_INC) { | |
506 | dst_garbage.timer_inc = DST_GC_INC; | |
507 | dst_garbage.timer_expires = DST_GC_MIN; | |
508 | mod_delayed_work(system_wq, &dst_gc_work, | |
509 | dst_garbage.timer_expires); | |
510 | } | |
86bba269 ED |
511 | spin_unlock_bh(&dst_garbage.lock); |
512 | ||
513 | if (last) | |
514 | last->next = dst; | |
515 | else | |
516 | dst_busy_list = dst; | |
598ed936 | 517 | for (; dst; dst = dst->next) |
1da177e4 | 518 | dst_ifdown(dst, dev, event != NETDEV_DOWN); |
86bba269 | 519 | mutex_unlock(&dst_gc_mutex); |
1da177e4 LT |
520 | break; |
521 | } | |
522 | return NOTIFY_DONE; | |
523 | } | |
524 | ||
525 | static struct notifier_block dst_dev_notifier = { | |
526 | .notifier_call = dst_dev_event, | |
332dd96f | 527 | .priority = -10, /* must be called after other network notifiers */ |
1da177e4 LT |
528 | }; |
529 | ||
f38a9eb1 | 530 | void __init dst_subsys_init(void) |
1da177e4 LT |
531 | { |
532 | register_netdevice_notifier(&dst_dev_notifier); | |
533 | } |