[mirror_ubuntu-zesty-kernel.git] / net / core / dst.c

/*
 * 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>
#include <linux/workqueue.h>
#include <linux/mm.h>
#include <linux/module.h>
#include <linux/slab.h>
#include <linux/netdevice.h>
#include <linux/skbuff.h>
#include <linux/string.h>
#include <linux/types.h>
#include <net/net_namespace.h>
#include <linux/sched.h>

#include <net/dst.h>

/*
 * 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.
 */
#if RT_CACHE_DEBUG >= 2
static atomic_t			 dst_total = ATOMIC_INIT(0);
#endif

/*
 * 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;
	struct dst_entry	*list;
	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);
static void ___dst_free(struct dst_entry *dst);

static DECLARE_DELAYED_WORK(dst_gc_work, dst_gc_task);

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)
{
	int    delayed = 0;
	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

	mutex_lock(&dst_gc_mutex);
	next = dst_busy_list;

loop:
	while ((dst = next) != NULL) {
		next = dst->next;
		prefetch(&next->next);
		cond_resched();
		if (likely(atomic_read(&dst->__refcnt))) {
			last->next = dst;
			last = dst;
			delayed++;
			continue;
		}
		work_performed++;

		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);
			dst->next = next;
			next = dst;
		}
	}

	spin_lock_bh(&dst_garbage.lock);
	next = dst_garbage.list;
	if (next) {
		dst_garbage.list = NULL;
		spin_unlock_bh(&dst_garbage.lock);
		goto loop;
	}
	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;
		/*
		 * if the next desired timer is more than 4 seconds in the
		 * future then round the timer to whole seconds
		 */
		if (expires > 4*HZ)
			expires = round_jiffies_relative(expires);
		schedule_delayed_work(&dst_gc_work, expires);
	}

	spin_unlock_bh(&dst_garbage.lock);
	mutex_unlock(&dst_gc_mutex);
#if RT_CACHE_DEBUG >= 2
	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,
		elapsed.tv_sec * USEC_PER_SEC +
		  elapsed.tv_nsec / NSEC_PER_USEC);
#endif
}

int dst_discard(struct sk_buff *skb)
{
	kfree_skb(skb);
	return 0;
}
EXPORT_SYMBOL(dst_discard);

void *dst_alloc(struct dst_ops *ops)
{
	struct dst_entry *dst;

	if (ops->gc && atomic_read(&ops->entries) > ops->gc_thresh) {
		if (ops->gc(ops))
			return NULL;
	}
	dst = kmem_cache_zalloc(ops->kmem_cachep, GFP_ATOMIC);
	if (!dst)
		return NULL;
	atomic_set(&dst->__refcnt, 0);
	dst->ops = ops;
	dst->lastuse = jiffies;
	dst->path = dst;
	dst->input = dst->output = dst_discard;
#if RT_CACHE_DEBUG >= 2
	atomic_inc(&dst_total);
#endif
	atomic_inc(&ops->entries);
	return dst;
}
EXPORT_SYMBOL(dst_alloc);

static void ___dst_free(struct dst_entry *dst)
{
	/* The first case (dev==NULL) is required, when
	   protocol module is unloaded.
	 */
	if (dst->dev == NULL || !(dst->dev->flags&IFF_UP))
		dst->input = dst->output = dst_discard;
	dst->obsolete = 2;
}

void __dst_free(struct dst_entry *dst)
{
	spin_lock_bh(&dst_garbage.lock);
	___dst_free(dst);
	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;
		cancel_delayed_work(&dst_gc_work);
		schedule_delayed_work(&dst_gc_work, dst_garbage.timer_expires);
	}
	spin_unlock_bh(&dst_garbage.lock);
}
EXPORT_SYMBOL(__dst_free);

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)
		hh_cache_put(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);
#if RT_CACHE_DEBUG >= 2
	atomic_dec(&dst_total);
#endif
	kmem_cache_free(dst->ops->kmem_cachep, dst);

	dst = child;
	if (dst) {
		int nohash = dst->flags & DST_NOHASH;

		if (atomic_dec_and_test(&dst->__refcnt)) {
			/* We were real parent of this dst, so kill child. */
			if (nohash)
				goto again;
		} else {
			/* Child is still referenced, return it for freeing. */
			if (nohash)
				return dst;
			/* Child is still in his hash table */
		}
	}
	return NULL;
}
EXPORT_SYMBOL(dst_destroy);

void dst_release(struct dst_entry *dst)
{
	if (dst) {
		int newrefcnt;

		smp_mb__before_atomic_dec();
		newrefcnt = atomic_dec_return(&dst->__refcnt);
		WARN_ON(newrefcnt < 0);
	}
}
EXPORT_SYMBOL(dst_release);

/* 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.
 */
static void dst_ifdown(struct dst_entry *dst, struct net_device *dev,
		       int unregister)
{
	if (dst->ops->ifdown)
		dst->ops->ifdown(dst, dev, unregister);

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

	if (!unregister) {
		dst->input = dst->output = dst_discard;
	} else {
		dst->dev = dev_net(dst->dev)->loopback_dev;
		dev_hold(dst->dev);
		dev_put(dev);
		if (dst->neighbour && dst->neighbour->dev == dev) {
			dst->neighbour->dev = dst->dev;
			dev_hold(dst->dev);
			dev_put(dev);
		}
	}
}

static int dst_dev_event(struct notifier_block *this, unsigned long event,
			 void *ptr)
{
	struct net_device *dev = ptr;
	struct dst_entry *dst, *last = NULL;

	switch (event) {
	case NETDEV_UNREGISTER:
	case NETDEV_DOWN:
		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;
		for (; dst; dst = dst->next)
			dst_ifdown(dst, dev, event != NETDEV_DOWN);
		mutex_unlock(&dst_gc_mutex);
		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);
}
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>
1da177e4 LT	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>
1da177e4 LT	22
	23	#include <net/dst.h>
	24
86bba269 ED	25	/*
	26	* Theory of operations:
	27	* 1) We use a list, protected by a spinlock, to add
	28	* new entries from both BH and non-BH context.
	29	* 2) In order to keep spinlock held for a small delay,
	30	* we use a second list where are stored long lived
	31	* entries, that are handled by the garbage collect thread
	32	* fired by a workqueue.
	33	* 3) This list is guarded by a mutex,
	34	* so that the gc_task and dst_dev_event() can be synchronized.
1da177e4	35	*/
4ec93edb	36	#if RT_CACHE_DEBUG >= 2
1da177e4 LT	37	static atomic_t dst_total = ATOMIC_INIT(0);
1da177e4 LT	38	#endif
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	{
1da177e4 LT	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;
	72	#if RT_CACHE_DEBUG >= 2
	73	ktime_t time_start = ktime_get();
	74	struct timespec elapsed;
	75	#endif
1da177e4	76
86bba269 ED	77	mutex_lock(&dst_gc_mutex);
86bba269 ED	78	next = dst_busy_list;
1da177e4	79
86bba269 ED	80	loop:
	81	while ((dst = next) != NULL) {
	82	next = dst->next;
	83	prefetch(&next->next);
2fc1b5dd	84	cond_resched();
86bba269 ED	85	if (likely(atomic_read(&dst->__refcnt))) {
	86	last->next = dst;
	87	last = dst;
1da177e4 LT	88	delayed++;
	89	continue;
	90	}
86bba269	91	work_performed++;
1da177e4 LT	92
	93	dst = dst_destroy(dst);
	94	if (dst) {
	95	/* NOHASH and still referenced. Unless it is already
	96	* on gc list, invalidate it and add to gc list.
	97	*
	98	* Note: this is temporary. Actually, NOHASH dst's
	99	* must be obsoleted when parent is obsoleted.
	100	* But we do not have state "obsoleted, but
	101	* referenced by parent", so it is right.
	102	*/
	103	if (dst->obsolete > 1)
	104	continue;
	105
	106	___dst_free(dst);
86bba269 ED	107	dst->next = next;
86bba269 ED	108	next = dst;
1da177e4 LT	109	}
1da177e4 LT	110	}
86bba269 ED	111
	112	spin_lock_bh(&dst_garbage.lock);
	113	next = dst_garbage.list;
	114	if (next) {
	115	dst_garbage.list = NULL;
	116	spin_unlock_bh(&dst_garbage.lock);
	117	goto loop;
1da177e4	118	}
86bba269 ED	119	last->next = NULL;
	120	dst_busy_list = head.next;
	121	if (!dst_busy_list)
	122	dst_garbage.timer_inc = DST_GC_MAX;
	123	else {
	124	/*
	125	* if we freed less than 1/10 of delayed entries,
	126	* we can sleep longer.
	127	*/
	128	if (work_performed <= delayed/10) {
	129	dst_garbage.timer_expires += dst_garbage.timer_inc;
	130	if (dst_garbage.timer_expires > DST_GC_MAX)
	131	dst_garbage.timer_expires = DST_GC_MAX;
	132	dst_garbage.timer_inc += DST_GC_INC;
	133	} else {
	134	dst_garbage.timer_inc = DST_GC_INC;
	135	dst_garbage.timer_expires = DST_GC_MIN;
	136	}
	137	expires = dst_garbage.timer_expires;
	138	/*
598ed936	139	* if the next desired timer is more than 4 seconds in the
598ed936	140	* future then round the timer to whole seconds
86bba269 ED	141	*/
	142	if (expires > 4*HZ)
	143	expires = round_jiffies_relative(expires);
	144	schedule_delayed_work(&dst_gc_work, expires);
f0098f78	145	}
86bba269 ED	146
	147	spin_unlock_bh(&dst_garbage.lock);
	148	mutex_unlock(&dst_gc_mutex);
1da177e4	149	#if RT_CACHE_DEBUG >= 2
86bba269 ED	150	elapsed = ktime_to_timespec(ktime_sub(ktime_get(), time_start));
	151	printk(KERN_DEBUG "dst_total: %d delayed: %d work_perf: %d"
	152	" expires: %lu elapsed: %lu us\n",
	153	atomic_read(&dst_total), delayed, work_performed,
	154	expires,
598ed936	155	elapsed.tv_sec * USEC_PER_SEC +
598ed936	156	elapsed.tv_nsec / NSEC_PER_USEC);
1da177e4	157	#endif
1da177e4 LT	158	}
1da177e4 LT	159
352e512c	160	int dst_discard(struct sk_buff *skb)
1da177e4 LT	161	{
	162	kfree_skb(skb);
	163	return 0;
	164	}
352e512c	165	EXPORT_SYMBOL(dst_discard);
1da177e4	166
598ed936	167	void dst_alloc(struct dst_ops ops)
1da177e4	168	{
598ed936	169	struct dst_entry *dst;
1da177e4 LT	170
1da177e4 LT	171	if (ops->gc && atomic_read(&ops->entries) > ops->gc_thresh) {
569d3645	172	if (ops->gc(ops))
1da177e4 LT	173	return NULL;
1da177e4 LT	174	}
c3762229	175	dst = kmem_cache_zalloc(ops->kmem_cachep, GFP_ATOMIC);
1da177e4 LT	176	if (!dst)
1da177e4 LT	177	return NULL;
1da177e4 LT	178	atomic_set(&dst->__refcnt, 0);
	179	dst->ops = ops;
	180	dst->lastuse = jiffies;
	181	dst->path = dst;
c4b1010f	182	dst->input = dst->output = dst_discard;
4ec93edb	183	#if RT_CACHE_DEBUG >= 2
1da177e4 LT	184	atomic_inc(&dst_total);
	185	#endif
	186	atomic_inc(&ops->entries);
	187	return dst;
	188	}
598ed936	189	EXPORT_SYMBOL(dst_alloc);
1da177e4	190
598ed936	191	static void ___dst_free(struct dst_entry *dst)
1da177e4 LT	192	{
	193	/* The first case (dev==NULL) is required, when
	194	protocol module is unloaded.
	195	*/
598ed936	196	if (dst->dev == NULL \|\| !(dst->dev->flags&IFF_UP))
c4b1010f	197	dst->input = dst->output = dst_discard;
1da177e4 LT	198	dst->obsolete = 2;
	199	}
	200
598ed936	201	void __dst_free(struct dst_entry *dst)
1da177e4	202	{
86bba269	203	spin_lock_bh(&dst_garbage.lock);
1da177e4	204	___dst_free(dst);
86bba269 ED	205	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;
f262b59b	210	cancel_delayed_work(&dst_gc_work);
86bba269	211	schedule_delayed_work(&dst_gc_work, dst_garbage.timer_expires);
1da177e4	212	}
86bba269	213	spin_unlock_bh(&dst_garbage.lock);
1da177e4	214	}
d79d9913	215	EXPORT_SYMBOL(__dst_free);
1da177e4 LT	216
	217	struct dst_entry dst_destroy(struct dst_entry dst)
	218	{
	219	struct dst_entry *child;
	220	struct neighbour *neigh;
	221	struct hh_cache *hh;
	222
	223	smp_rmb();
	224
	225	again:
	226	neigh = dst->neighbour;
	227	hh = dst->hh;
	228	child = dst->child;
	229
	230	dst->hh = NULL;
34d101dd ED	231	if (hh)
34d101dd ED	232	hh_cache_put(hh);
1da177e4 LT	233
	234	if (neigh) {
	235	dst->neighbour = NULL;
	236	neigh_release(neigh);
	237	}
	238
	239	atomic_dec(&dst->ops->entries);
	240
	241	if (dst->ops->destroy)
	242	dst->ops->destroy(dst);
	243	if (dst->dev)
	244	dev_put(dst->dev);
4ec93edb	245	#if RT_CACHE_DEBUG >= 2
1da177e4 LT	246	atomic_dec(&dst_total);
	247	#endif
	248	kmem_cache_free(dst->ops->kmem_cachep, dst);
	249
	250	dst = child;
	251	if (dst) {
6775cab9 HX	252	int nohash = dst->flags & DST_NOHASH;
6775cab9 HX	253
1da177e4 LT	254	if (atomic_dec_and_test(&dst->__refcnt)) {
1da177e4 LT	255	/* We were real parent of this dst, so kill child. */
6775cab9	256	if (nohash)
1da177e4 LT	257	goto again;
	258	} else {
	259	/* Child is still referenced, return it for freeing. */
6775cab9	260	if (nohash)
1da177e4 LT	261	return dst;
	262	/* Child is still in his hash table */
	263	}
	264	}
	265	return NULL;
	266	}
598ed936	267	EXPORT_SYMBOL(dst_destroy);
1da177e4	268
8d330868 IJ	269	void dst_release(struct dst_entry *dst)
	270	{
	271	if (dst) {
598ed936	272	int newrefcnt;
ef711cf1	273
8d330868	274	smp_mb__before_atomic_dec();
598ed936	275	newrefcnt = atomic_dec_return(&dst->__refcnt);
598ed936	276	WARN_ON(newrefcnt < 0);
8d330868 IJ	277	}
	278	}
	279	EXPORT_SYMBOL(dst_release);
	280
1da177e4 LT	281	/* Dirty hack. We did it in 2.2 (in __dst_free),
	282	* we have _very_ good reasons not to repeat
	283	* this mistake in 2.3, but we have no choice
	284	* now. _It_ _is_ _explicit_ _deliberate_
	285	* _race_ _condition_.
	286	*
	287	* Commented and originally written by Alexey.
	288	*/
56115511	289	static void dst_ifdown(struct dst_entry dst, struct net_device dev,
56115511	290	int unregister)
1da177e4 LT	291	{
	292	if (dst->ops->ifdown)
	293	dst->ops->ifdown(dst, dev, unregister);
	294
	295	if (dev != dst->dev)
	296	return;
	297
	298	if (!unregister) {
c4b1010f	299	dst->input = dst->output = dst_discard;
1da177e4	300	} else {
c346dca1	301	dst->dev = dev_net(dst->dev)->loopback_dev;
de3cb747	302	dev_hold(dst->dev);
1da177e4 LT	303	dev_put(dev);
1da177e4 LT	304	if (dst->neighbour && dst->neighbour->dev == dev) {
5a3e55d6	305	dst->neighbour->dev = dst->dev;
64b7d961	306	dev_hold(dst->dev);
1da177e4	307	dev_put(dev);
1da177e4 LT	308	}
	309	}
	310	}
	311
598ed936	312	static int dst_dev_event(struct notifier_block *this, unsigned long event,
598ed936	313	void *ptr)
1da177e4 LT	314	{
1da177e4 LT	315	struct net_device *dev = ptr;
86bba269	316	struct dst_entry dst, last = NULL;
1da177e4 LT	317
	318	switch (event) {
	319	case NETDEV_UNREGISTER:
	320	case NETDEV_DOWN:
86bba269 ED	321	mutex_lock(&dst_gc_mutex);
	322	for (dst = dst_busy_list; dst; dst = dst->next) {
	323	last = dst;
	324	dst_ifdown(dst, dev, event != NETDEV_DOWN);
	325	}
	326
	327	spin_lock_bh(&dst_garbage.lock);
	328	dst = dst_garbage.list;
	329	dst_garbage.list = NULL;
	330	spin_unlock_bh(&dst_garbage.lock);
	331
	332	if (last)
	333	last->next = dst;
	334	else
	335	dst_busy_list = dst;
598ed936	336	for (; dst; dst = dst->next)
1da177e4	337	dst_ifdown(dst, dev, event != NETDEV_DOWN);
86bba269	338	mutex_unlock(&dst_gc_mutex);
1da177e4 LT	339	break;
	340	}
	341	return NOTIFY_DONE;
	342	}
	343
	344	static struct notifier_block dst_dev_notifier = {
	345	.notifier_call = dst_dev_event,
	346	};
	347
	348	void __init dst_init(void)
	349	{
	350	register_netdevice_notifier(&dst_dev_notifier);
	351	}