dst.c 8.1 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11
/*
 * net/core/dst.c	Protocol independent destination cache.
 *
 * Authors:		Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
 *
 */

#include <linux/bitops.h>
#include <linux/errno.h>
#include <linux/init.h>
#include <linux/kernel.h>
12
#include <linux/workqueue.h>
L
Linus Torvalds 已提交
13 14
#include <linux/mm.h>
#include <linux/module.h>
15
#include <linux/slab.h>
L
Linus Torvalds 已提交
16 17 18 19
#include <linux/netdevice.h>
#include <linux/skbuff.h>
#include <linux/string.h>
#include <linux/types.h>
20
#include <net/net_namespace.h>
21
#include <linux/sched.h>
L
Linus Torvalds 已提交
22 23 24

#include <net/dst.h>

25 26 27 28 29 30 31 32 33 34
/*
 * Theory of operations:
 * 1) We use a list, protected by a spinlock, to add
 *    new entries from both BH and non-BH context.
 * 2) In order to keep spinlock held for a small delay,
 *    we use a second list where are stored long lived
 *    entries, that are handled by the garbage collect thread
 *    fired by a workqueue.
 * 3) This list is guarded by a mutex,
 *    so that the gc_task and dst_dev_event() can be synchronized.
L
Linus Torvalds 已提交
35
 */
36
#if RT_CACHE_DEBUG >= 2
L
Linus Torvalds 已提交
37 38 39
static atomic_t			 dst_total = ATOMIC_INIT(0);
#endif

40 41 42 43 44 45 46
/*
 * We want to keep lock & list close together
 * to dirty as few cache lines as possible in __dst_free().
 * As this is not a very strong hint, we dont force an alignment on SMP.
 */
static struct {
	spinlock_t		lock;
47
	struct dst_entry	*list;
48 49 50 51 52 53 54
	unsigned long		timer_inc;
	unsigned long		timer_expires;
} dst_garbage = {
	.lock = __SPIN_LOCK_UNLOCKED(dst_garbage.lock),
	.timer_inc = DST_GC_MAX,
};
static void dst_gc_task(struct work_struct *work);
55
static void ___dst_free(struct dst_entry *dst);
L
Linus Torvalds 已提交
56

57
static DECLARE_DELAYED_WORK(dst_gc_work, dst_gc_task);
L
Linus Torvalds 已提交
58

59 60 61 62 63 64 65
static DEFINE_MUTEX(dst_gc_mutex);
/*
 * long lived entries are maintained in this list, guarded by dst_gc_mutex
 */
static struct dst_entry         *dst_busy_list;

static void dst_gc_task(struct work_struct *work)
L
Linus Torvalds 已提交
66 67
{
	int    delayed = 0;
68 69 70 71 72 73 74 75
	int    work_performed = 0;
	unsigned long expires = ~0L;
	struct dst_entry *dst, *next, head;
	struct dst_entry *last = &head;
#if RT_CACHE_DEBUG >= 2
	ktime_t time_start = ktime_get();
	struct timespec elapsed;
#endif
L
Linus Torvalds 已提交
76

77 78
	mutex_lock(&dst_gc_mutex);
	next = dst_busy_list;
L
Linus Torvalds 已提交
79

80 81 82 83
loop:
	while ((dst = next) != NULL) {
		next = dst->next;
		prefetch(&next->next);
84
		cond_resched();
85 86 87
		if (likely(atomic_read(&dst->__refcnt))) {
			last->next = dst;
			last = dst;
L
Linus Torvalds 已提交
88 89 90
			delayed++;
			continue;
		}
91
		work_performed++;
L
Linus Torvalds 已提交
92 93 94 95 96 97 98 99 100 101 102 103 104 105 106

		dst = dst_destroy(dst);
		if (dst) {
			/* NOHASH and still referenced. Unless it is already
			 * on gc list, invalidate it and add to gc list.
			 *
			 * Note: this is temporary. Actually, NOHASH dst's
			 * must be obsoleted when parent is obsoleted.
			 * But we do not have state "obsoleted, but
			 * referenced by parent", so it is right.
			 */
			if (dst->obsolete > 1)
				continue;

			___dst_free(dst);
107 108
			dst->next = next;
			next = dst;
L
Linus Torvalds 已提交
109 110
		}
	}
111 112 113 114 115 116 117

	spin_lock_bh(&dst_garbage.lock);
	next = dst_garbage.list;
	if (next) {
		dst_garbage.list = NULL;
		spin_unlock_bh(&dst_garbage.lock);
		goto loop;
L
Linus Torvalds 已提交
118
	}
119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138
	last->next = NULL;
	dst_busy_list = head.next;
	if (!dst_busy_list)
		dst_garbage.timer_inc = DST_GC_MAX;
	else {
		/*
		 * if we freed less than 1/10 of delayed entries,
		 * we can sleep longer.
		 */
		if (work_performed <= delayed/10) {
			dst_garbage.timer_expires += dst_garbage.timer_inc;
			if (dst_garbage.timer_expires > DST_GC_MAX)
				dst_garbage.timer_expires = DST_GC_MAX;
			dst_garbage.timer_inc += DST_GC_INC;
		} else {
			dst_garbage.timer_inc = DST_GC_INC;
			dst_garbage.timer_expires = DST_GC_MIN;
		}
		expires = dst_garbage.timer_expires;
		/*
139 140
		 * if the next desired timer is more than 4 seconds in the
		 * future then round the timer to whole seconds
141 142 143 144
		 */
		if (expires > 4*HZ)
			expires = round_jiffies_relative(expires);
		schedule_delayed_work(&dst_gc_work, expires);
145
	}
146 147 148

	spin_unlock_bh(&dst_garbage.lock);
	mutex_unlock(&dst_gc_mutex);
L
Linus Torvalds 已提交
149
#if RT_CACHE_DEBUG >= 2
150 151 152 153 154
	elapsed = ktime_to_timespec(ktime_sub(ktime_get(), time_start));
	printk(KERN_DEBUG "dst_total: %d delayed: %d work_perf: %d"
		" expires: %lu elapsed: %lu us\n",
		atomic_read(&dst_total), delayed, work_performed,
		expires,
155 156
		elapsed.tv_sec * USEC_PER_SEC +
		  elapsed.tv_nsec / NSEC_PER_USEC);
L
Linus Torvalds 已提交
157 158 159
#endif
}

160
int dst_discard(struct sk_buff *skb)
L
Linus Torvalds 已提交
161 162 163 164
{
	kfree_skb(skb);
	return 0;
}
165
EXPORT_SYMBOL(dst_discard);
L
Linus Torvalds 已提交
166

167
void *dst_alloc(struct dst_ops *ops)
L
Linus Torvalds 已提交
168
{
169
	struct dst_entry *dst;
L
Linus Torvalds 已提交
170 171

	if (ops->gc && atomic_read(&ops->entries) > ops->gc_thresh) {
172
		if (ops->gc(ops))
L
Linus Torvalds 已提交
173 174
			return NULL;
	}
175
	dst = kmem_cache_zalloc(ops->kmem_cachep, GFP_ATOMIC);
L
Linus Torvalds 已提交
176 177 178 179 180 181
	if (!dst)
		return NULL;
	atomic_set(&dst->__refcnt, 0);
	dst->ops = ops;
	dst->lastuse = jiffies;
	dst->path = dst;
182
	dst->input = dst->output = dst_discard;
183
#if RT_CACHE_DEBUG >= 2
L
Linus Torvalds 已提交
184 185 186 187 188
	atomic_inc(&dst_total);
#endif
	atomic_inc(&ops->entries);
	return dst;
}
189
EXPORT_SYMBOL(dst_alloc);
L
Linus Torvalds 已提交
190

191
static void ___dst_free(struct dst_entry *dst)
L
Linus Torvalds 已提交
192 193 194 195
{
	/* The first case (dev==NULL) is required, when
	   protocol module is unloaded.
	 */
196
	if (dst->dev == NULL || !(dst->dev->flags&IFF_UP))
197
		dst->input = dst->output = dst_discard;
L
Linus Torvalds 已提交
198 199 200
	dst->obsolete = 2;
}

201
void __dst_free(struct dst_entry *dst)
L
Linus Torvalds 已提交
202
{
203
	spin_lock_bh(&dst_garbage.lock);
L
Linus Torvalds 已提交
204
	___dst_free(dst);
205 206 207 208 209
	dst->next = dst_garbage.list;
	dst_garbage.list = dst;
	if (dst_garbage.timer_inc > DST_GC_INC) {
		dst_garbage.timer_inc = DST_GC_INC;
		dst_garbage.timer_expires = DST_GC_MIN;
210
		cancel_delayed_work(&dst_gc_work);
211
		schedule_delayed_work(&dst_gc_work, dst_garbage.timer_expires);
L
Linus Torvalds 已提交
212
	}
213
	spin_unlock_bh(&dst_garbage.lock);
L
Linus Torvalds 已提交
214
}
215
EXPORT_SYMBOL(__dst_free);
L
Linus Torvalds 已提交
216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244

struct dst_entry *dst_destroy(struct dst_entry * dst)
{
	struct dst_entry *child;
	struct neighbour *neigh;
	struct hh_cache *hh;

	smp_rmb();

again:
	neigh = dst->neighbour;
	hh = dst->hh;
	child = dst->child;

	dst->hh = NULL;
	if (hh && atomic_dec_and_test(&hh->hh_refcnt))
		kfree(hh);

	if (neigh) {
		dst->neighbour = NULL;
		neigh_release(neigh);
	}

	atomic_dec(&dst->ops->entries);

	if (dst->ops->destroy)
		dst->ops->destroy(dst);
	if (dst->dev)
		dev_put(dst->dev);
245
#if RT_CACHE_DEBUG >= 2
L
Linus Torvalds 已提交
246 247 248 249 250 251
	atomic_dec(&dst_total);
#endif
	kmem_cache_free(dst->ops->kmem_cachep, dst);

	dst = child;
	if (dst) {
H
Herbert Xu 已提交
252 253
		int nohash = dst->flags & DST_NOHASH;

L
Linus Torvalds 已提交
254 255
		if (atomic_dec_and_test(&dst->__refcnt)) {
			/* We were real parent of this dst, so kill child. */
H
Herbert Xu 已提交
256
			if (nohash)
L
Linus Torvalds 已提交
257 258 259
				goto again;
		} else {
			/* Child is still referenced, return it for freeing. */
H
Herbert Xu 已提交
260
			if (nohash)
L
Linus Torvalds 已提交
261 262 263 264 265 266
				return dst;
			/* Child is still in his hash table */
		}
	}
	return NULL;
}
267
EXPORT_SYMBOL(dst_destroy);
L
Linus Torvalds 已提交
268

I
Ilpo Järvinen 已提交
269 270 271
void dst_release(struct dst_entry *dst)
{
	if (dst) {
272
		int newrefcnt;
E
Eric Dumazet 已提交
273

I
Ilpo Järvinen 已提交
274
		smp_mb__before_atomic_dec();
275 276
		newrefcnt = atomic_dec_return(&dst->__refcnt);
		WARN_ON(newrefcnt < 0);
I
Ilpo Järvinen 已提交
277 278 279 280
	}
}
EXPORT_SYMBOL(dst_release);

L
Linus Torvalds 已提交
281 282 283 284 285 286 287 288
/* Dirty hack. We did it in 2.2 (in __dst_free),
 * we have _very_ good reasons not to repeat
 * this mistake in 2.3, but we have no choice
 * now. _It_ _is_ _explicit_ _deliberate_
 * _race_ _condition_.
 *
 * Commented and originally written by Alexey.
 */
S
stephen hemminger 已提交
289 290
static void dst_ifdown(struct dst_entry *dst, struct net_device *dev,
		       int unregister)
L
Linus Torvalds 已提交
291 292 293 294 295 296 297 298
{
	if (dst->ops->ifdown)
		dst->ops->ifdown(dst, dev, unregister);

	if (dev != dst->dev)
		return;

	if (!unregister) {
299
		dst->input = dst->output = dst_discard;
L
Linus Torvalds 已提交
300
	} else {
301
		dst->dev = dev_net(dst->dev)->loopback_dev;
302
		dev_hold(dst->dev);
L
Linus Torvalds 已提交
303 304
		dev_put(dev);
		if (dst->neighbour && dst->neighbour->dev == dev) {
305
			dst->neighbour->dev = dst->dev;
E
Eric Dumazet 已提交
306
			dev_hold(dst->dev);
L
Linus Torvalds 已提交
307 308 309 310 311
			dev_put(dev);
		}
	}
}

312 313
static int dst_dev_event(struct notifier_block *this, unsigned long event,
			 void *ptr)
L
Linus Torvalds 已提交
314 315
{
	struct net_device *dev = ptr;
316
	struct dst_entry *dst, *last = NULL;
L
Linus Torvalds 已提交
317 318 319 320

	switch (event) {
	case NETDEV_UNREGISTER:
	case NETDEV_DOWN:
321 322 323 324 325 326 327 328 329 330 331 332 333 334 335
		mutex_lock(&dst_gc_mutex);
		for (dst = dst_busy_list; dst; dst = dst->next) {
			last = dst;
			dst_ifdown(dst, dev, event != NETDEV_DOWN);
		}

		spin_lock_bh(&dst_garbage.lock);
		dst = dst_garbage.list;
		dst_garbage.list = NULL;
		spin_unlock_bh(&dst_garbage.lock);

		if (last)
			last->next = dst;
		else
			dst_busy_list = dst;
336
		for (; dst; dst = dst->next)
L
Linus Torvalds 已提交
337
			dst_ifdown(dst, dev, event != NETDEV_DOWN);
338
		mutex_unlock(&dst_gc_mutex);
L
Linus Torvalds 已提交
339 340 341 342 343 344 345 346 347 348 349 350 351
		break;
	}
	return NOTIFY_DONE;
}

static struct notifier_block dst_dev_notifier = {
	.notifier_call	= dst_dev_event,
};

void __init dst_init(void)
{
	register_netdevice_notifier(&dst_dev_notifier);
}