blob: 2076d84203d179d0662fe1282be39edafec94a34 [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>
15#include <linux/netdevice.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016#include <linux/skbuff.h>
17#include <linux/string.h>
18#include <linux/types.h>
Eric W. Biedermane9dc8652007-09-12 13:02:17 +020019#include <net/net_namespace.h>
Eric Dumazet2fc1b5d2010-02-08 15:00:39 -080020#include <linux/sched.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070021
22#include <net/dst.h>
23
Eric Dumazet86bba262007-09-12 14:29:01 +020024/*
25 * Theory of operations:
26 * 1) We use a list, protected by a spinlock, to add
27 * new entries from both BH and non-BH context.
28 * 2) In order to keep spinlock held for a small delay,
29 * we use a second list where are stored long lived
30 * entries, that are handled by the garbage collect thread
31 * fired by a workqueue.
32 * 3) This list is guarded by a mutex,
33 * so that the gc_task and dst_dev_event() can be synchronized.
Linus Torvalds1da177e2005-04-16 15:20:36 -070034 */
YOSHIFUJI Hideaki4ec93ed2007-02-09 23:24:36 +090035#if RT_CACHE_DEBUG >= 2
Linus Torvalds1da177e2005-04-16 15:20:36 -070036static atomic_t dst_total = ATOMIC_INIT(0);
37#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070038
Eric Dumazet86bba262007-09-12 14:29:01 +020039/*
40 * We want to keep lock & list close together
41 * to dirty as few cache lines as possible in __dst_free().
42 * As this is not a very strong hint, we dont force an alignment on SMP.
43 */
44static struct {
45 spinlock_t lock;
laurent chavey598ed932010-03-29 10:41:36 +000046 struct dst_entry *list;
Eric Dumazet86bba262007-09-12 14:29:01 +020047 unsigned long timer_inc;
48 unsigned long timer_expires;
49} dst_garbage = {
50 .lock = __SPIN_LOCK_UNLOCKED(dst_garbage.lock),
51 .timer_inc = DST_GC_MAX,
52};
53static void dst_gc_task(struct work_struct *work);
laurent chavey598ed932010-03-29 10:41:36 +000054static void ___dst_free(struct dst_entry *dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -070055
Eric Dumazet86bba262007-09-12 14:29:01 +020056static DECLARE_DELAYED_WORK(dst_gc_work, dst_gc_task);
Linus Torvalds1da177e2005-04-16 15:20:36 -070057
Eric Dumazet86bba262007-09-12 14:29:01 +020058static DEFINE_MUTEX(dst_gc_mutex);
59/*
60 * long lived entries are maintained in this list, guarded by dst_gc_mutex
61 */
62static struct dst_entry *dst_busy_list;
63
64static void dst_gc_task(struct work_struct *work)
Linus Torvalds1da177e2005-04-16 15:20:36 -070065{
66 int delayed = 0;
Eric Dumazet86bba262007-09-12 14:29:01 +020067 int work_performed = 0;
68 unsigned long expires = ~0L;
69 struct dst_entry *dst, *next, head;
70 struct dst_entry *last = &head;
71#if RT_CACHE_DEBUG >= 2
72 ktime_t time_start = ktime_get();
73 struct timespec elapsed;
74#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070075
Eric Dumazet86bba262007-09-12 14:29:01 +020076 mutex_lock(&dst_gc_mutex);
77 next = dst_busy_list;
Linus Torvalds1da177e2005-04-16 15:20:36 -070078
Eric Dumazet86bba262007-09-12 14:29:01 +020079loop:
80 while ((dst = next) != NULL) {
81 next = dst->next;
82 prefetch(&next->next);
Eric Dumazet2fc1b5d2010-02-08 15:00:39 -080083 cond_resched();
Eric Dumazet86bba262007-09-12 14:29:01 +020084 if (likely(atomic_read(&dst->__refcnt))) {
85 last->next = dst;
86 last = dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -070087 delayed++;
88 continue;
89 }
Eric Dumazet86bba262007-09-12 14:29:01 +020090 work_performed++;
Linus Torvalds1da177e2005-04-16 15:20:36 -070091
92 dst = dst_destroy(dst);
93 if (dst) {
94 /* NOHASH and still referenced. Unless it is already
95 * on gc list, invalidate it and add to gc list.
96 *
97 * Note: this is temporary. Actually, NOHASH dst's
98 * must be obsoleted when parent is obsoleted.
99 * But we do not have state "obsoleted, but
100 * referenced by parent", so it is right.
101 */
102 if (dst->obsolete > 1)
103 continue;
104
105 ___dst_free(dst);
Eric Dumazet86bba262007-09-12 14:29:01 +0200106 dst->next = next;
107 next = dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108 }
109 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110
Eric Dumazet86bba262007-09-12 14:29:01 +0200111 spin_lock_bh(&dst_garbage.lock);
112 next = dst_garbage.list;
113 if (next) {
114 dst_garbage.list = NULL;
115 spin_unlock_bh(&dst_garbage.lock);
116 goto loop;
117 }
118 last->next = NULL;
119 dst_busy_list = head.next;
120 if (!dst_busy_list)
121 dst_garbage.timer_inc = DST_GC_MAX;
122 else {
123 /*
124 * if we freed less than 1/10 of delayed entries,
125 * we can sleep longer.
126 */
127 if (work_performed <= delayed/10) {
128 dst_garbage.timer_expires += dst_garbage.timer_inc;
129 if (dst_garbage.timer_expires > DST_GC_MAX)
130 dst_garbage.timer_expires = DST_GC_MAX;
131 dst_garbage.timer_inc += DST_GC_INC;
132 } else {
133 dst_garbage.timer_inc = DST_GC_INC;
134 dst_garbage.timer_expires = DST_GC_MIN;
135 }
136 expires = dst_garbage.timer_expires;
137 /*
laurent chavey598ed932010-03-29 10:41:36 +0000138 * if the next desired timer is more than 4 seconds in the
139 * future then round the timer to whole seconds
Eric Dumazet86bba262007-09-12 14:29:01 +0200140 */
141 if (expires > 4*HZ)
142 expires = round_jiffies_relative(expires);
143 schedule_delayed_work(&dst_gc_work, expires);
144 }
145
146 spin_unlock_bh(&dst_garbage.lock);
147 mutex_unlock(&dst_gc_mutex);
148#if RT_CACHE_DEBUG >= 2
149 elapsed = ktime_to_timespec(ktime_sub(ktime_get(), time_start));
150 printk(KERN_DEBUG "dst_total: %d delayed: %d work_perf: %d"
151 " expires: %lu elapsed: %lu us\n",
152 atomic_read(&dst_total), delayed, work_performed,
153 expires,
laurent chavey598ed932010-03-29 10:41:36 +0000154 elapsed.tv_sec * USEC_PER_SEC +
155 elapsed.tv_nsec / NSEC_PER_USEC);
Eric Dumazet86bba262007-09-12 14:29:01 +0200156#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157}
158
Herbert Xu352e5122007-11-13 21:34:06 -0800159int dst_discard(struct sk_buff *skb)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700160{
161 kfree_skb(skb);
162 return 0;
163}
Herbert Xu352e5122007-11-13 21:34:06 -0800164EXPORT_SYMBOL(dst_discard);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165
laurent chavey598ed932010-03-29 10:41:36 +0000166void *dst_alloc(struct dst_ops *ops)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167{
laurent chavey598ed932010-03-29 10:41:36 +0000168 struct dst_entry *dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169
170 if (ops->gc && atomic_read(&ops->entries) > ops->gc_thresh) {
Daniel Lezcano569d3642008-01-18 03:56:57 -0800171 if (ops->gc(ops))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 return NULL;
173 }
Robert P. J. Dayc3762222007-02-10 01:45:03 -0800174 dst = kmem_cache_zalloc(ops->kmem_cachep, GFP_ATOMIC);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175 if (!dst)
176 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 atomic_set(&dst->__refcnt, 0);
178 dst->ops = ops;
179 dst->lastuse = jiffies;
180 dst->path = dst;
Denis Chengc4b10102007-06-05 00:06:57 -0700181 dst->input = dst->output = dst_discard;
YOSHIFUJI Hideaki4ec93ed2007-02-09 23:24:36 +0900182#if RT_CACHE_DEBUG >= 2
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183 atomic_inc(&dst_total);
184#endif
185 atomic_inc(&ops->entries);
186 return dst;
187}
laurent chavey598ed932010-03-29 10:41:36 +0000188EXPORT_SYMBOL(dst_alloc);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700189
laurent chavey598ed932010-03-29 10:41:36 +0000190static void ___dst_free(struct dst_entry *dst)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700191{
192 /* The first case (dev==NULL) is required, when
193 protocol module is unloaded.
194 */
laurent chavey598ed932010-03-29 10:41:36 +0000195 if (dst->dev == NULL || !(dst->dev->flags&IFF_UP))
Denis Chengc4b10102007-06-05 00:06:57 -0700196 dst->input = dst->output = dst_discard;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197 dst->obsolete = 2;
198}
laurent chavey598ed932010-03-29 10:41:36 +0000199EXPORT_SYMBOL(__dst_free);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200
laurent chavey598ed932010-03-29 10:41:36 +0000201void __dst_free(struct dst_entry *dst)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202{
Eric Dumazet86bba262007-09-12 14:29:01 +0200203 spin_lock_bh(&dst_garbage.lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204 ___dst_free(dst);
Eric Dumazet86bba262007-09-12 14:29:01 +0200205 dst->next = dst_garbage.list;
206 dst_garbage.list = dst;
207 if (dst_garbage.timer_inc > DST_GC_INC) {
208 dst_garbage.timer_inc = DST_GC_INC;
209 dst_garbage.timer_expires = DST_GC_MIN;
Benjamin Theryf262b592008-09-12 16:16:37 -0700210 cancel_delayed_work(&dst_gc_work);
Eric Dumazet86bba262007-09-12 14:29:01 +0200211 schedule_delayed_work(&dst_gc_work, dst_garbage.timer_expires);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212 }
Eric Dumazet86bba262007-09-12 14:29:01 +0200213 spin_unlock_bh(&dst_garbage.lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214}
215
216struct dst_entry *dst_destroy(struct dst_entry * dst)
217{
218 struct dst_entry *child;
219 struct neighbour *neigh;
220 struct hh_cache *hh;
221
222 smp_rmb();
223
224again:
225 neigh = dst->neighbour;
226 hh = dst->hh;
227 child = dst->child;
228
229 dst->hh = NULL;
230 if (hh && atomic_dec_and_test(&hh->hh_refcnt))
231 kfree(hh);
232
233 if (neigh) {
234 dst->neighbour = NULL;
235 neigh_release(neigh);
236 }
237
238 atomic_dec(&dst->ops->entries);
239
240 if (dst->ops->destroy)
241 dst->ops->destroy(dst);
242 if (dst->dev)
243 dev_put(dst->dev);
YOSHIFUJI Hideaki4ec93ed2007-02-09 23:24:36 +0900244#if RT_CACHE_DEBUG >= 2
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245 atomic_dec(&dst_total);
246#endif
247 kmem_cache_free(dst->ops->kmem_cachep, dst);
248
249 dst = child;
250 if (dst) {
Herbert Xu6775cab2005-04-16 15:24:10 -0700251 int nohash = dst->flags & DST_NOHASH;
252
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253 if (atomic_dec_and_test(&dst->__refcnt)) {
254 /* We were real parent of this dst, so kill child. */
Herbert Xu6775cab2005-04-16 15:24:10 -0700255 if (nohash)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700256 goto again;
257 } else {
258 /* Child is still referenced, return it for freeing. */
Herbert Xu6775cab2005-04-16 15:24:10 -0700259 if (nohash)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 return dst;
261 /* Child is still in his hash table */
262 }
263 }
264 return NULL;
265}
laurent chavey598ed932010-03-29 10:41:36 +0000266EXPORT_SYMBOL(dst_destroy);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267
Ilpo Järvinen8d330862008-03-27 17:53:31 -0700268void dst_release(struct dst_entry *dst)
269{
270 if (dst) {
laurent chavey598ed932010-03-29 10:41:36 +0000271 int newrefcnt;
Eric Dumazetef711cf2008-11-14 00:53:54 -0800272
Ilpo Järvinen8d330862008-03-27 17:53:31 -0700273 smp_mb__before_atomic_dec();
laurent chavey598ed932010-03-29 10:41:36 +0000274 newrefcnt = atomic_dec_return(&dst->__refcnt);
275 WARN_ON(newrefcnt < 0);
Ilpo Järvinen8d330862008-03-27 17:53:31 -0700276 }
277}
278EXPORT_SYMBOL(dst_release);
279
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280/* Dirty hack. We did it in 2.2 (in __dst_free),
281 * we have _very_ good reasons not to repeat
282 * this mistake in 2.3, but we have no choice
283 * now. _It_ _is_ _explicit_ _deliberate_
284 * _race_ _condition_.
285 *
286 * Commented and originally written by Alexey.
287 */
288static inline void dst_ifdown(struct dst_entry *dst, struct net_device *dev,
289 int unregister)
290{
291 if (dst->ops->ifdown)
292 dst->ops->ifdown(dst, dev, unregister);
293
294 if (dev != dst->dev)
295 return;
296
297 if (!unregister) {
Denis Chengc4b10102007-06-05 00:06:57 -0700298 dst->input = dst->output = dst_discard;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299 } else {
YOSHIFUJI Hideakic346dca2008-03-25 21:47:49 +0900300 dst->dev = dev_net(dst->dev)->loopback_dev;
Daniel Lezcanode3cb742007-09-25 19:16:28 -0700301 dev_hold(dst->dev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700302 dev_put(dev);
303 if (dst->neighbour && dst->neighbour->dev == dev) {
Denis V. Lunev5a3e55d2007-12-07 00:38:10 -0800304 dst->neighbour->dev = dst->dev;
Eric Dumazet64b7d962007-12-11 02:00:30 -0800305 dev_hold(dst->dev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306 dev_put(dev);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700307 }
308 }
309}
310
laurent chavey598ed932010-03-29 10:41:36 +0000311static int dst_dev_event(struct notifier_block *this, unsigned long event,
312 void *ptr)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313{
314 struct net_device *dev = ptr;
Eric Dumazet86bba262007-09-12 14:29:01 +0200315 struct dst_entry *dst, *last = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317 switch (event) {
318 case NETDEV_UNREGISTER:
319 case NETDEV_DOWN:
Eric Dumazet86bba262007-09-12 14:29:01 +0200320 mutex_lock(&dst_gc_mutex);
321 for (dst = dst_busy_list; dst; dst = dst->next) {
322 last = dst;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323 dst_ifdown(dst, dev, event != NETDEV_DOWN);
324 }
Eric Dumazet86bba262007-09-12 14:29:01 +0200325
326 spin_lock_bh(&dst_garbage.lock);
327 dst = dst_garbage.list;
328 dst_garbage.list = NULL;
329 spin_unlock_bh(&dst_garbage.lock);
330
331 if (last)
332 last->next = dst;
333 else
334 dst_busy_list = dst;
laurent chavey598ed932010-03-29 10:41:36 +0000335 for (; dst; dst = dst->next)
Eric Dumazet86bba262007-09-12 14:29:01 +0200336 dst_ifdown(dst, dev, event != NETDEV_DOWN);
Eric Dumazet86bba262007-09-12 14:29:01 +0200337 mutex_unlock(&dst_gc_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700338 break;
339 }
340 return NOTIFY_DONE;
341}
342
343static struct notifier_block dst_dev_notifier = {
344 .notifier_call = dst_dev_event,
345};
346
347void __init dst_init(void)
348{
349 register_netdevice_notifier(&dst_dev_notifier);
350}