2 * net/core/dst.c Protocol independent destination cache.
4 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
8 #include <linux/bitops.h>
9 #include <linux/errno.h>
10 #include <linux/init.h>
11 #include <linux/kernel.h>
12 #include <linux/workqueue.h>
14 #include <linux/module.h>
15 #include <linux/slab.h>
16 #include <linux/netdevice.h>
17 #include <linux/skbuff.h>
18 #include <linux/string.h>
19 #include <linux/types.h>
20 #include <net/net_namespace.h>
21 #include <linux/sched.h>
22 #include <linux/prefetch.h>
27 * Theory of operations:
28 * 1) We use a list, protected by a spinlock, to add
29 * new entries from both BH and non-BH context.
30 * 2) In order to keep spinlock held for a small delay,
31 * we use a second list where are stored long lived
32 * entries, that are handled by the garbage collect thread
33 * fired by a workqueue.
34 * 3) This list is guarded by a mutex,
35 * so that the gc_task and dst_dev_event() can be synchronized.
39 * We want to keep lock & list close together
40 * to dirty as few cache lines as possible in __dst_free().
41 * As this is not a very strong hint, we dont force an alignment on SMP.
45 struct dst_entry
*list
;
46 unsigned long timer_inc
;
47 unsigned long timer_expires
;
49 .lock
= __SPIN_LOCK_UNLOCKED(dst_garbage
.lock
),
50 .timer_inc
= DST_GC_MAX
,
52 static void dst_gc_task(struct work_struct
*work
);
53 static void ___dst_free(struct dst_entry
*dst
);
55 static DECLARE_DELAYED_WORK(dst_gc_work
, dst_gc_task
);
57 static DEFINE_MUTEX(dst_gc_mutex
);
59 * long lived entries are maintained in this list, guarded by dst_gc_mutex
61 static struct dst_entry
*dst_busy_list
;
63 static void dst_gc_task(struct work_struct
*work
)
66 int work_performed
= 0;
67 unsigned long expires
= ~0L;
68 struct dst_entry
*dst
, *next
, head
;
69 struct dst_entry
*last
= &head
;
71 mutex_lock(&dst_gc_mutex
);
75 while ((dst
= next
) != NULL
) {
77 prefetch(&next
->next
);
79 if (likely(atomic_read(&dst
->__refcnt
))) {
87 dst
= dst_destroy(dst
);
89 /* NOHASH and still referenced. Unless it is already
90 * on gc list, invalidate it and add to gc list.
92 * Note: this is temporary. Actually, NOHASH dst's
93 * must be obsoleted when parent is obsoleted.
94 * But we do not have state "obsoleted, but
95 * referenced by parent", so it is right.
97 if (dst
->obsolete
> 0)
106 spin_lock_bh(&dst_garbage
.lock
);
107 next
= dst_garbage
.list
;
109 dst_garbage
.list
= NULL
;
110 spin_unlock_bh(&dst_garbage
.lock
);
114 dst_busy_list
= head
.next
;
116 dst_garbage
.timer_inc
= DST_GC_MAX
;
119 * if we freed less than 1/10 of delayed entries,
120 * we can sleep longer.
122 if (work_performed
<= delayed
/10) {
123 dst_garbage
.timer_expires
+= dst_garbage
.timer_inc
;
124 if (dst_garbage
.timer_expires
> DST_GC_MAX
)
125 dst_garbage
.timer_expires
= DST_GC_MAX
;
126 dst_garbage
.timer_inc
+= DST_GC_INC
;
128 dst_garbage
.timer_inc
= DST_GC_INC
;
129 dst_garbage
.timer_expires
= DST_GC_MIN
;
131 expires
= dst_garbage
.timer_expires
;
133 * if the next desired timer is more than 4 seconds in the
134 * future then round the timer to whole seconds
137 expires
= round_jiffies_relative(expires
);
138 schedule_delayed_work(&dst_gc_work
, expires
);
141 spin_unlock_bh(&dst_garbage
.lock
);
142 mutex_unlock(&dst_gc_mutex
);
145 int dst_discard_sk(struct sock
*sk
, struct sk_buff
*skb
)
150 EXPORT_SYMBOL(dst_discard_sk
);
152 const struct dst_metrics dst_default_metrics
= {
153 /* This initializer is needed to force linker to place this variable
154 * into const section. Otherwise it might end into bss section.
155 * We really want to avoid false sharing on this variable, and catch
158 .refcnt
= ATOMIC_INIT(1),
162 void *dst_alloc(struct dst_ops
*ops
, struct net_device
*dev
,
163 int initial_ref
, int initial_obsolete
, unsigned short flags
)
165 struct dst_entry
*dst
;
167 if (ops
->gc
&& dst_entries_get_fast(ops
) > ops
->gc_thresh
) {
171 dst
= kmem_cache_alloc(ops
->kmem_cachep
, GFP_ATOMIC
);
179 dst_init_metrics(dst
, dst_default_metrics
.metrics
, true);
186 dst
->input
= dst_discard
;
187 dst
->output
= dst_discard_sk
;
189 dst
->obsolete
= initial_obsolete
;
191 dst
->trailer_len
= 0;
192 #ifdef CONFIG_IP_ROUTE_CLASSID
195 atomic_set(&dst
->__refcnt
, initial_ref
);
197 dst
->lastuse
= jiffies
;
199 dst
->pending_confirm
= 0;
201 if (!(flags
& DST_NOCOUNT
))
202 dst_entries_add(ops
, 1);
205 EXPORT_SYMBOL(dst_alloc
);
207 static void ___dst_free(struct dst_entry
*dst
)
209 /* The first case (dev==NULL) is required, when
210 protocol module is unloaded.
212 if (dst
->dev
== NULL
|| !(dst
->dev
->flags
&IFF_UP
)) {
213 dst
->input
= dst_discard
;
214 dst
->output
= dst_discard_sk
;
216 dst
->obsolete
= DST_OBSOLETE_DEAD
;
219 void __dst_free(struct dst_entry
*dst
)
221 spin_lock_bh(&dst_garbage
.lock
);
223 dst
->next
= dst_garbage
.list
;
224 dst_garbage
.list
= dst
;
225 if (dst_garbage
.timer_inc
> DST_GC_INC
) {
226 dst_garbage
.timer_inc
= DST_GC_INC
;
227 dst_garbage
.timer_expires
= DST_GC_MIN
;
228 mod_delayed_work(system_wq
, &dst_gc_work
,
229 dst_garbage
.timer_expires
);
231 spin_unlock_bh(&dst_garbage
.lock
);
233 EXPORT_SYMBOL(__dst_free
);
235 struct dst_entry
*dst_destroy(struct dst_entry
* dst
)
237 struct dst_entry
*child
;
244 if (!(dst
->flags
& DST_NOCOUNT
))
245 dst_entries_add(dst
->ops
, -1);
247 if (dst
->ops
->destroy
)
248 dst
->ops
->destroy(dst
);
251 kmem_cache_free(dst
->ops
->kmem_cachep
, dst
);
255 int nohash
= dst
->flags
& DST_NOHASH
;
257 if (atomic_dec_and_test(&dst
->__refcnt
)) {
258 /* We were real parent of this dst, so kill child. */
262 /* Child is still referenced, return it for freeing. */
265 /* Child is still in his hash table */
270 EXPORT_SYMBOL(dst_destroy
);
272 static void dst_destroy_rcu(struct rcu_head
*head
)
274 struct dst_entry
*dst
= container_of(head
, struct dst_entry
, rcu_head
);
276 dst
= dst_destroy(dst
);
281 void dst_release(struct dst_entry
*dst
)
285 unsigned short nocache
= dst
->flags
& DST_NOCACHE
;
287 newrefcnt
= atomic_dec_return(&dst
->__refcnt
);
288 WARN_ON(newrefcnt
< 0);
289 if (!newrefcnt
&& unlikely(nocache
))
290 call_rcu(&dst
->rcu_head
, dst_destroy_rcu
);
293 EXPORT_SYMBOL(dst_release
);
295 static struct kmem_cache
*metrics_cache
;
297 void *dst_alloc_metrics(gfp_t flags
)
299 return kmem_cache_alloc(metrics_cache
, flags
);
301 EXPORT_SYMBOL(dst_alloc_metrics
);
303 void dst_free_metrics(void *metrics
)
305 kmem_cache_free(metrics_cache
, metrics
);
307 EXPORT_SYMBOL(dst_free_metrics
);
309 u32
*dst_cow_metrics_generic(struct dst_entry
*dst
, unsigned long old
)
311 struct dst_metrics
*p
= dst_alloc_metrics(GFP_ATOMIC
);
314 struct dst_metrics
*old_p
= (struct dst_metrics
*)__DST_METRICS_PTR(old
);
315 unsigned long prev
, new;
317 atomic_set(&p
->refcnt
, 1);
318 memcpy(p
->metrics
, old_p
->metrics
, sizeof(p
->metrics
));
320 new = (unsigned long) p
;
321 prev
= cmpxchg(&dst
->_metrics
, old
, new);
325 p
= (struct dst_metrics
*)__DST_METRICS_PTR(prev
);
326 if (prev
& DST_METRICS_READ_ONLY
)
328 } else if (prev
& DST_METRICS_REFCOUNTED
) {
329 if (atomic_dec_and_test(&old_p
->refcnt
))
330 dst_free_metrics(old_p
);
333 BUILD_BUG_ON(offsetof(struct dst_metrics
, metrics
) != 0);
336 EXPORT_SYMBOL(dst_cow_metrics_generic
);
338 /* Caller asserts that dst_metrics_read_only(dst) is false. */
339 void __dst_destroy_metrics_generic(struct dst_entry
*dst
, unsigned long old
)
341 unsigned long prev
, new;
343 new = ((unsigned long) &dst_default_metrics
) | DST_METRICS_READ_ONLY
;
344 prev
= cmpxchg(&dst
->_metrics
, old
, new);
346 dst_free_metrics(__DST_METRICS_PTR(old
));
348 EXPORT_SYMBOL(__dst_destroy_metrics_generic
);
351 * __skb_dst_set_noref - sets skb dst, without a reference
354 * @force: if force is set, use noref version even for DST_NOCACHE entries
356 * Sets skb dst, assuming a reference was not taken on dst
357 * skb_dst_drop() should not dst_release() this dst
359 void __skb_dst_set_noref(struct sk_buff
*skb
, struct dst_entry
*dst
, bool force
)
361 WARN_ON(!rcu_read_lock_held() && !rcu_read_lock_bh_held());
362 /* If dst not in cache, we must take a reference, because
363 * dst_release() will destroy dst as soon as its refcount becomes zero
365 if (unlikely((dst
->flags
& DST_NOCACHE
) && !force
)) {
367 skb_dst_set(skb
, dst
);
369 skb
->_skb_refdst
= (unsigned long)dst
| SKB_DST_NOREF
;
372 EXPORT_SYMBOL(__skb_dst_set_noref
);
374 /* Dirty hack. We did it in 2.2 (in __dst_free),
375 * we have _very_ good reasons not to repeat
376 * this mistake in 2.3, but we have no choice
377 * now. _It_ _is_ _explicit_ _deliberate_
378 * _race_ _condition_.
380 * Commented and originally written by Alexey.
382 static void dst_ifdown(struct dst_entry
*dst
, struct net_device
*dev
,
385 if (dst
->ops
->ifdown
)
386 dst
->ops
->ifdown(dst
, dev
, unregister
);
392 dst
->input
= dst_discard
;
393 dst
->output
= dst_discard_sk
;
395 dst
->dev
= dev_net(dst
->dev
)->loopback_dev
;
401 static int dst_dev_event(struct notifier_block
*this, unsigned long event
,
404 struct net_device
*dev
= netdev_notifier_info_to_dev(ptr
);
405 struct dst_entry
*dst
, *last
= NULL
;
408 case NETDEV_UNREGISTER_FINAL
:
410 mutex_lock(&dst_gc_mutex
);
411 for (dst
= dst_busy_list
; dst
; dst
= dst
->next
) {
413 dst_ifdown(dst
, dev
, event
!= NETDEV_DOWN
);
416 spin_lock_bh(&dst_garbage
.lock
);
417 dst
= dst_garbage
.list
;
418 dst_garbage
.list
= NULL
;
419 spin_unlock_bh(&dst_garbage
.lock
);
425 for (; dst
; dst
= dst
->next
)
426 dst_ifdown(dst
, dev
, event
!= NETDEV_DOWN
);
427 mutex_unlock(&dst_gc_mutex
);
433 static struct notifier_block dst_dev_notifier
= {
434 .notifier_call
= dst_dev_event
,
435 .priority
= -10, /* must be called after other network notifiers */
438 void __init
dst_init(void)
440 register_netdevice_notifier(&dst_dev_notifier
);
441 metrics_cache
= kmem_cache_create("dst_metrics",
442 sizeof(struct dst_metrics
),
443 DST_METRICS_ALIGNMENT
,