blob: a028409ee438c27d738deb1b065269a441a0f5f3 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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>
Eric Dumazet86bba262007-09-12 14:29:01 +020012#include <linux/workqueue.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070013#include <linux/mm.h>
14#include <linux/module.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090015#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016#include <linux/netdevice.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070017#include <linux/skbuff.h>
18#include <linux/string.h>
19#include <linux/types.h>
Eric W. Biedermane9dc8652007-09-12 13:02:17 +020020#include <net/net_namespace.h>
Eric Dumazet2fc1b5d2010-02-08 15:00:39 -080021#include <linux/sched.h>
Linus Torvalds268bb0c2011-05-20 12:50:29 -070022#include <linux/prefetch.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070023
24#include <net/dst.h>
25
Eric Dumazet86bba262007-09-12 14:29:01 +020026/*
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.
Linus Torvalds1da177e2005-04-16 15:20:36 -070036 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070037
Eric Dumazet86bba262007-09-12 14:29:01 +020038/*
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.
42 */
43static struct {
44 spinlock_t lock;
laurent chavey598ed932010-03-29 10:41:36 +000045 struct dst_entry *list;
Eric Dumazet86bba262007-09-12 14:29:01 +020046 unsigned long timer_inc;
47 unsigned long timer_expires;
48} dst_garbage = {
49 .lock = __SPIN_LOCK_UNLOCKED(dst_garbage.lock),
50 .timer_inc = DST_GC_MAX,
51};
52static void dst_gc_task(struct work_struct *work);
laurent chavey598ed932010-03-29 10:41:36 +000053static void ___dst_free(struct dst_entry *dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -070054
Eric Dumazet86bba262007-09-12 14:29:01 +020055static DECLARE_DELAYED_WORK(dst_gc_work, dst_gc_task);
Linus Torvalds1da177e2005-04-16 15:20:36 -070056
Eric Dumazet86bba262007-09-12 14:29:01 +020057static DEFINE_MUTEX(dst_gc_mutex);
58/*
59 * long lived entries are maintained in this list, guarded by dst_gc_mutex
60 */
61static struct dst_entry *dst_busy_list;
62
63static void dst_gc_task(struct work_struct *work)
Linus Torvalds1da177e2005-04-16 15:20:36 -070064{
65 int delayed = 0;
Eric Dumazet86bba262007-09-12 14:29:01 +020066 int work_performed = 0;
67 unsigned long expires = ~0L;
68 struct dst_entry *dst, *next, head;
69 struct dst_entry *last = &head;
Linus Torvalds1da177e2005-04-16 15:20:36 -070070
Eric Dumazet86bba262007-09-12 14:29:01 +020071 mutex_lock(&dst_gc_mutex);
72 next = dst_busy_list;
Linus Torvalds1da177e2005-04-16 15:20:36 -070073
Eric Dumazet86bba262007-09-12 14:29:01 +020074loop:
75 while ((dst = next) != NULL) {
76 next = dst->next;
77 prefetch(&next->next);
Eric Dumazet2fc1b5d2010-02-08 15:00:39 -080078 cond_resched();
Eric Dumazet86bba262007-09-12 14:29:01 +020079 if (likely(atomic_read(&dst->__refcnt))) {
80 last->next = dst;
81 last = dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -070082 delayed++;
83 continue;
84 }
Eric Dumazet86bba262007-09-12 14:29:01 +020085 work_performed++;
Linus Torvalds1da177e2005-04-16 15:20:36 -070086
87 dst = dst_destroy(dst);
88 if (dst) {
89 /* NOHASH and still referenced. Unless it is already
90 * on gc list, invalidate it and add to gc list.
91 *
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.
96 */
David S. Millerf5b0a872012-07-19 12:31:33 -070097 if (dst->obsolete > 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -070098 continue;
99
100 ___dst_free(dst);
Eric Dumazet86bba262007-09-12 14:29:01 +0200101 dst->next = next;
102 next = dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 }
104 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105
Eric Dumazet86bba262007-09-12 14:29:01 +0200106 spin_lock_bh(&dst_garbage.lock);
107 next = dst_garbage.list;
108 if (next) {
109 dst_garbage.list = NULL;
110 spin_unlock_bh(&dst_garbage.lock);
111 goto loop;
112 }
113 last->next = NULL;
114 dst_busy_list = head.next;
115 if (!dst_busy_list)
116 dst_garbage.timer_inc = DST_GC_MAX;
117 else {
118 /*
119 * if we freed less than 1/10 of delayed entries,
120 * we can sleep longer.
121 */
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;
127 } else {
128 dst_garbage.timer_inc = DST_GC_INC;
129 dst_garbage.timer_expires = DST_GC_MIN;
130 }
131 expires = dst_garbage.timer_expires;
132 /*
laurent chavey598ed932010-03-29 10:41:36 +0000133 * if the next desired timer is more than 4 seconds in the
134 * future then round the timer to whole seconds
Eric Dumazet86bba262007-09-12 14:29:01 +0200135 */
136 if (expires > 4*HZ)
137 expires = round_jiffies_relative(expires);
138 schedule_delayed_work(&dst_gc_work, expires);
139 }
140
141 spin_unlock_bh(&dst_garbage.lock);
142 mutex_unlock(&dst_gc_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143}
144
Eric Dumazetaad88722014-04-15 13:47:15 -0400145int dst_discard_sk(struct sock *sk, struct sk_buff *skb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700146{
147 kfree_skb(skb);
148 return 0;
149}
Eric Dumazetaad88722014-04-15 13:47:15 -0400150EXPORT_SYMBOL(dst_discard_sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151
Eric Dumazeta37e6e32012-08-07 10:55:45 +0000152const u32 dst_default_metrics[RTAX_MAX + 1] = {
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
156 * any writes on it.
157 */
158 [RTAX_MAX] = 0xdeadbeef,
159};
160
David S. Miller62fa8a82011-01-26 20:51:05 -0800161
David S. Miller5c1e6aa2011-04-28 14:13:38 -0700162void *dst_alloc(struct dst_ops *ops, struct net_device *dev,
David S. Miller5110effe2012-07-02 02:21:03 -0700163 int initial_ref, int initial_obsolete, unsigned short flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164{
laurent chavey598ed932010-03-29 10:41:36 +0000165 struct dst_entry *dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166
Eric Dumazetfc66f952010-10-08 06:37:34 +0000167 if (ops->gc && dst_entries_get_fast(ops) > ops->gc_thresh) {
Daniel Lezcano569d3642008-01-18 03:56:57 -0800168 if (ops->gc(ops))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169 return NULL;
170 }
David S. Millercf911662011-04-28 14:31:47 -0700171 dst = kmem_cache_alloc(ops->kmem_cachep, GFP_ATOMIC);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 if (!dst)
173 return NULL;
David S. Millercf911662011-04-28 14:31:47 -0700174 dst->child = NULL;
David S. Miller5c1e6aa2011-04-28 14:13:38 -0700175 dst->dev = dev;
176 if (dev)
177 dev_hold(dev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 dst->ops = ops;
David S. Miller62fa8a82011-01-26 20:51:05 -0800179 dst_init_metrics(dst, dst_default_metrics, true);
David S. Millercf911662011-04-28 14:31:47 -0700180 dst->expires = 0UL;
David S. Miller5c1e6aa2011-04-28 14:13:38 -0700181 dst->path = dst;
YOSHIFUJI Hideaki / 吉藤英明ecd98832013-02-20 00:29:08 +0000182 dst->from = NULL;
David S. Millercf911662011-04-28 14:31:47 -0700183#ifdef CONFIG_XFRM
184 dst->xfrm = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700185#endif
David S. Miller5c1e6aa2011-04-28 14:13:38 -0700186 dst->input = dst_discard;
Eric Dumazetaad88722014-04-15 13:47:15 -0400187 dst->output = dst_discard_sk;
David S. Millercf911662011-04-28 14:31:47 -0700188 dst->error = 0;
David S. Miller5c1e6aa2011-04-28 14:13:38 -0700189 dst->obsolete = initial_obsolete;
David S. Millercf911662011-04-28 14:31:47 -0700190 dst->header_len = 0;
191 dst->trailer_len = 0;
192#ifdef CONFIG_IP_ROUTE_CLASSID
193 dst->tclassid = 0;
194#endif
David S. Miller5c1e6aa2011-04-28 14:13:38 -0700195 atomic_set(&dst->__refcnt, initial_ref);
David S. Millercf911662011-04-28 14:31:47 -0700196 dst->__use = 0;
David S. Miller5c1e6aa2011-04-28 14:13:38 -0700197 dst->lastuse = jiffies;
198 dst->flags = flags;
David S. Miller5110effe2012-07-02 02:21:03 -0700199 dst->pending_confirm = 0;
David S. Millercf911662011-04-28 14:31:47 -0700200 dst->next = NULL;
David S. Miller957c6652011-06-24 15:25:00 -0700201 if (!(flags & DST_NOCOUNT))
202 dst_entries_add(ops, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203 return dst;
204}
laurent chavey598ed932010-03-29 10:41:36 +0000205EXPORT_SYMBOL(dst_alloc);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206
laurent chavey598ed932010-03-29 10:41:36 +0000207static void ___dst_free(struct dst_entry *dst)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208{
209 /* The first case (dev==NULL) is required, when
210 protocol module is unloaded.
211 */
Eric Dumazetaad88722014-04-15 13:47:15 -0400212 if (dst->dev == NULL || !(dst->dev->flags&IFF_UP)) {
213 dst->input = dst_discard;
214 dst->output = dst_discard_sk;
215 }
David S. Millerf5b0a872012-07-19 12:31:33 -0700216 dst->obsolete = DST_OBSOLETE_DEAD;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700217}
218
laurent chavey598ed932010-03-29 10:41:36 +0000219void __dst_free(struct dst_entry *dst)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700220{
Eric Dumazet86bba262007-09-12 14:29:01 +0200221 spin_lock_bh(&dst_garbage.lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222 ___dst_free(dst);
Eric Dumazet86bba262007-09-12 14:29:01 +0200223 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;
Tejun Heo41f63c52012-08-03 10:30:47 -0700228 mod_delayed_work(system_wq, &dst_gc_work,
229 dst_garbage.timer_expires);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700230 }
Eric Dumazet86bba262007-09-12 14:29:01 +0200231 spin_unlock_bh(&dst_garbage.lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700232}
Nicolas Dichteld79d9912010-07-19 23:51:38 +0000233EXPORT_SYMBOL(__dst_free);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234
235struct dst_entry *dst_destroy(struct dst_entry * dst)
236{
237 struct dst_entry *child;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238
239 smp_rmb();
240
241again:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242 child = dst->child;
243
David S. Miller957c6652011-06-24 15:25:00 -0700244 if (!(dst->flags & DST_NOCOUNT))
245 dst_entries_add(dst->ops, -1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246
247 if (dst->ops->destroy)
248 dst->ops->destroy(dst);
249 if (dst->dev)
250 dev_put(dst->dev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251 kmem_cache_free(dst->ops->kmem_cachep, dst);
252
253 dst = child;
254 if (dst) {
Herbert Xu6775cab2005-04-16 15:24:10 -0700255 int nohash = dst->flags & DST_NOHASH;
256
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 if (atomic_dec_and_test(&dst->__refcnt)) {
258 /* We were real parent of this dst, so kill child. */
Herbert Xu6775cab2005-04-16 15:24:10 -0700259 if (nohash)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 goto again;
261 } else {
262 /* Child is still referenced, return it for freeing. */
Herbert Xu6775cab2005-04-16 15:24:10 -0700263 if (nohash)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264 return dst;
265 /* Child is still in his hash table */
266 }
267 }
268 return NULL;
269}
laurent chavey598ed932010-03-29 10:41:36 +0000270EXPORT_SYMBOL(dst_destroy);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271
Eric Dumazetf8864972014-06-24 10:05:11 -0700272static void dst_destroy_rcu(struct rcu_head *head)
273{
274 struct dst_entry *dst = container_of(head, struct dst_entry, rcu_head);
275
276 dst = dst_destroy(dst);
277 if (dst)
278 __dst_free(dst);
279}
280
Ilpo Järvinen8d330862008-03-27 17:53:31 -0700281void dst_release(struct dst_entry *dst)
282{
283 if (dst) {
laurent chavey598ed932010-03-29 10:41:36 +0000284 int newrefcnt;
Eric Dumazetef711cf2008-11-14 00:53:54 -0800285
laurent chavey598ed932010-03-29 10:41:36 +0000286 newrefcnt = atomic_dec_return(&dst->__refcnt);
287 WARN_ON(newrefcnt < 0);
Eric Dumazetf8864972014-06-24 10:05:11 -0700288 if (unlikely(dst->flags & DST_NOCACHE) && !newrefcnt)
289 call_rcu(&dst->rcu_head, dst_destroy_rcu);
Ilpo Järvinen8d330862008-03-27 17:53:31 -0700290 }
291}
292EXPORT_SYMBOL(dst_release);
293
David S. Miller62fa8a82011-01-26 20:51:05 -0800294u32 *dst_cow_metrics_generic(struct dst_entry *dst, unsigned long old)
295{
296 u32 *p = kmalloc(sizeof(u32) * RTAX_MAX, GFP_ATOMIC);
297
298 if (p) {
299 u32 *old_p = __DST_METRICS_PTR(old);
300 unsigned long prev, new;
301
302 memcpy(p, old_p, sizeof(u32) * RTAX_MAX);
303
304 new = (unsigned long) p;
305 prev = cmpxchg(&dst->_metrics, old, new);
306
307 if (prev != old) {
308 kfree(p);
309 p = __DST_METRICS_PTR(prev);
310 if (prev & DST_METRICS_READ_ONLY)
311 p = NULL;
312 }
313 }
314 return p;
315}
316EXPORT_SYMBOL(dst_cow_metrics_generic);
317
318/* Caller asserts that dst_metrics_read_only(dst) is false. */
319void __dst_destroy_metrics_generic(struct dst_entry *dst, unsigned long old)
320{
321 unsigned long prev, new;
322
Eric Dumazetb30c5162011-05-24 13:29:50 -0400323 new = ((unsigned long) dst_default_metrics) | DST_METRICS_READ_ONLY;
David S. Miller62fa8a82011-01-26 20:51:05 -0800324 prev = cmpxchg(&dst->_metrics, old, new);
325 if (prev == old)
326 kfree(__DST_METRICS_PTR(old));
327}
328EXPORT_SYMBOL(__dst_destroy_metrics_generic);
329
Eric Dumazet27b75c92010-10-15 05:44:11 +0000330/**
Julian Anastasov932bc4d2013-03-21 11:57:58 +0200331 * __skb_dst_set_noref - sets skb dst, without a reference
Eric Dumazet27b75c92010-10-15 05:44:11 +0000332 * @skb: buffer
333 * @dst: dst entry
Julian Anastasov932bc4d2013-03-21 11:57:58 +0200334 * @force: if force is set, use noref version even for DST_NOCACHE entries
Eric Dumazet27b75c92010-10-15 05:44:11 +0000335 *
336 * Sets skb dst, assuming a reference was not taken on dst
337 * skb_dst_drop() should not dst_release() this dst
338 */
Julian Anastasov932bc4d2013-03-21 11:57:58 +0200339void __skb_dst_set_noref(struct sk_buff *skb, struct dst_entry *dst, bool force)
Eric Dumazet27b75c92010-10-15 05:44:11 +0000340{
341 WARN_ON(!rcu_read_lock_held() && !rcu_read_lock_bh_held());
342 /* If dst not in cache, we must take a reference, because
343 * dst_release() will destroy dst as soon as its refcount becomes zero
344 */
Julian Anastasov932bc4d2013-03-21 11:57:58 +0200345 if (unlikely((dst->flags & DST_NOCACHE) && !force)) {
Eric Dumazet27b75c92010-10-15 05:44:11 +0000346 dst_hold(dst);
347 skb_dst_set(skb, dst);
348 } else {
349 skb->_skb_refdst = (unsigned long)dst | SKB_DST_NOREF;
350 }
351}
Julian Anastasov932bc4d2013-03-21 11:57:58 +0200352EXPORT_SYMBOL(__skb_dst_set_noref);
Eric Dumazet27b75c92010-10-15 05:44:11 +0000353
Linus Torvalds1da177e2005-04-16 15:20:36 -0700354/* Dirty hack. We did it in 2.2 (in __dst_free),
355 * we have _very_ good reasons not to repeat
356 * this mistake in 2.3, but we have no choice
357 * now. _It_ _is_ _explicit_ _deliberate_
358 * _race_ _condition_.
359 *
360 * Commented and originally written by Alexey.
361 */
stephen hemminger56115512010-04-12 07:38:05 +0000362static void dst_ifdown(struct dst_entry *dst, struct net_device *dev,
363 int unregister)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700364{
365 if (dst->ops->ifdown)
366 dst->ops->ifdown(dst, dev, unregister);
367
368 if (dev != dst->dev)
369 return;
370
371 if (!unregister) {
Eric Dumazetaad88722014-04-15 13:47:15 -0400372 dst->input = dst_discard;
373 dst->output = dst_discard_sk;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700374 } else {
YOSHIFUJI Hideakic346dca2008-03-25 21:47:49 +0900375 dst->dev = dev_net(dst->dev)->loopback_dev;
Daniel Lezcanode3cb742007-09-25 19:16:28 -0700376 dev_hold(dst->dev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700377 dev_put(dev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378 }
379}
380
laurent chavey598ed932010-03-29 10:41:36 +0000381static int dst_dev_event(struct notifier_block *this, unsigned long event,
382 void *ptr)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383{
Jiri Pirko351638e2013-05-28 01:30:21 +0000384 struct net_device *dev = netdev_notifier_info_to_dev(ptr);
Eric Dumazet86bba262007-09-12 14:29:01 +0200385 struct dst_entry *dst, *last = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386
Linus Torvalds1da177e2005-04-16 15:20:36 -0700387 switch (event) {
Eric Dumazet0115e8e2012-08-22 17:19:46 +0000388 case NETDEV_UNREGISTER_FINAL:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389 case NETDEV_DOWN:
Eric Dumazet86bba262007-09-12 14:29:01 +0200390 mutex_lock(&dst_gc_mutex);
391 for (dst = dst_busy_list; dst; dst = dst->next) {
392 last = dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393 dst_ifdown(dst, dev, event != NETDEV_DOWN);
394 }
Eric Dumazet86bba262007-09-12 14:29:01 +0200395
396 spin_lock_bh(&dst_garbage.lock);
397 dst = dst_garbage.list;
398 dst_garbage.list = NULL;
399 spin_unlock_bh(&dst_garbage.lock);
400
401 if (last)
402 last->next = dst;
403 else
404 dst_busy_list = dst;
laurent chavey598ed932010-03-29 10:41:36 +0000405 for (; dst; dst = dst->next)
Eric Dumazet86bba262007-09-12 14:29:01 +0200406 dst_ifdown(dst, dev, event != NETDEV_DOWN);
Eric Dumazet86bba262007-09-12 14:29:01 +0200407 mutex_unlock(&dst_gc_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408 break;
409 }
410 return NOTIFY_DONE;
411}
412
413static struct notifier_block dst_dev_notifier = {
414 .notifier_call = dst_dev_event,
Eric Dumazet332dd962010-11-09 11:46:33 -0800415 .priority = -10, /* must be called after other network notifiers */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700416};
417
418void __init dst_init(void)
419{
420 register_netdevice_notifier(&dst_dev_notifier);
421}