[linux-block.git] / net / sched / cls_route.c

/*
 * net/sched/cls_route.c	ROUTE4 classifier.
 *
 *		This program is free software; you can redistribute it and/or
 *		modify it under the terms of the GNU General Public License
 *		as published by the Free Software Foundation; either version
 *		2 of the License, or (at your option) any later version.
 *
 * Authors:	Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
 */

#include <linux/module.h>
#include <linux/slab.h>
#include <linux/types.h>
#include <linux/kernel.h>
#include <linux/string.h>
#include <linux/errno.h>
#include <linux/skbuff.h>
#include <net/dst.h>
#include <net/route.h>
#include <net/netlink.h>
#include <net/act_api.h>
#include <net/pkt_cls.h>

/*
 * 1. For now we assume that route tags < 256.
 *    It allows to use direct table lookups, instead of hash tables.
 * 2. For now we assume that "from TAG" and "fromdev DEV" statements
 *    are mutually  exclusive.
 * 3. "to TAG from ANY" has higher priority, than "to ANY from XXX"
 */

struct route4_fastmap {
	struct route4_filter	*filter;
	u32			id;
	int			iif;
};

struct route4_head {
	struct route4_fastmap	fastmap[16];
	struct route4_bucket	*table[256 + 1];
};

struct route4_bucket {
	/* 16 FROM buckets + 16 IIF buckets + 1 wildcard bucket */
	struct route4_filter	*ht[16 + 16 + 1];
};

struct route4_filter {
	struct route4_filter	*next;
	u32			id;
	int			iif;

	struct tcf_result	res;
	struct tcf_exts		exts;
	u32			handle;
	struct route4_bucket	*bkt;
};

#define ROUTE4_FAILURE ((struct route4_filter *)(-1L))

static const struct tcf_ext_map route_ext_map = {
	.police = TCA_ROUTE4_POLICE,
	.action = TCA_ROUTE4_ACT
};

static inline int route4_fastmap_hash(u32 id, int iif)
{
	return id & 0xF;
}

static void
route4_reset_fastmap(struct Qdisc *q, struct route4_head *head, u32 id)
{
	spinlock_t *root_lock = qdisc_root_sleeping_lock(q);

	spin_lock_bh(root_lock);
	memset(head->fastmap, 0, sizeof(head->fastmap));
	spin_unlock_bh(root_lock);
}

static void
route4_set_fastmap(struct route4_head *head, u32 id, int iif,
		   struct route4_filter *f)
{
	int h = route4_fastmap_hash(id, iif);

	head->fastmap[h].id = id;
	head->fastmap[h].iif = iif;
	head->fastmap[h].filter = f;
}

static inline int route4_hash_to(u32 id)
{
	return id & 0xFF;
}

static inline int route4_hash_from(u32 id)
{
	return (id >> 16) & 0xF;
}

static inline int route4_hash_iif(int iif)
{
	return 16 + ((iif >> 16) & 0xF);
}

static inline int route4_hash_wild(void)
{
	return 32;
}

#define ROUTE4_APPLY_RESULT()					\
{								\
	*res = f->res;						\
	if (tcf_exts_is_available(&f->exts)) {			\
		int r = tcf_exts_exec(skb, &f->exts, res);	\
		if (r < 0) {					\
			dont_cache = 1;				\
			continue;				\
		}						\
		return r;					\
	} else if (!dont_cache)					\
		route4_set_fastmap(head, id, iif, f);		\
	return 0;						\
}

static int route4_classify(struct sk_buff *skb, const struct tcf_proto *tp,
			   struct tcf_result *res)
{
	struct route4_head *head = (struct route4_head *)tp->root;
	struct dst_entry *dst;
	struct route4_bucket *b;
	struct route4_filter *f;
	u32 id, h;
	int iif, dont_cache = 0;

	dst = skb_dst(skb);
	if (!dst)
		goto failure;

	id = dst->tclassid;
	if (head == NULL)
		goto old_method;

	iif = inet_iif(skb);

	h = route4_fastmap_hash(id, iif);
	if (id == head->fastmap[h].id &&
	    iif == head->fastmap[h].iif &&
	    (f = head->fastmap[h].filter) != NULL) {
		if (f == ROUTE4_FAILURE)
			goto failure;

		*res = f->res;
		return 0;
	}

	h = route4_hash_to(id);

restart:
	b = head->table[h];
	if (b) {
		for (f = b->ht[route4_hash_from(id)]; f; f = f->next)
			if (f->id == id)
				ROUTE4_APPLY_RESULT();

		for (f = b->ht[route4_hash_iif(iif)]; f; f = f->next)
			if (f->iif == iif)
				ROUTE4_APPLY_RESULT();

		for (f = b->ht[route4_hash_wild()]; f; f = f->next)
			ROUTE4_APPLY_RESULT();

	}
	if (h < 256) {
		h = 256;
		id &= ~0xFFFF;
		goto restart;
	}

	if (!dont_cache)
		route4_set_fastmap(head, id, iif, ROUTE4_FAILURE);
failure:
	return -1;

old_method:
	if (id && (TC_H_MAJ(id) == 0 ||
		   !(TC_H_MAJ(id^tp->q->handle)))) {
		res->classid = id;
		res->class = 0;
		return 0;
	}
	return -1;
}

static inline u32 to_hash(u32 id)
{
	u32 h = id & 0xFF;

	if (id & 0x8000)
		h += 256;
	return h;
}

static inline u32 from_hash(u32 id)
{
	id &= 0xFFFF;
	if (id == 0xFFFF)
		return 32;
	if (!(id & 0x8000)) {
		if (id > 255)
			return 256;
		return id & 0xF;
	}
	return 16 + (id & 0xF);
}

static unsigned long route4_get(struct tcf_proto *tp, u32 handle)
{
	struct route4_head *head = (struct route4_head *)tp->root;
	struct route4_bucket *b;
	struct route4_filter *f;
	unsigned int h1, h2;

	if (!head)
		return 0;

	h1 = to_hash(handle);
	if (h1 > 256)
		return 0;

	h2 = from_hash(handle >> 16);
	if (h2 > 32)
		return 0;

	b = head->table[h1];
	if (b) {
		for (f = b->ht[h2]; f; f = f->next)
			if (f->handle == handle)
				return (unsigned long)f;
	}
	return 0;
}

static void route4_put(struct tcf_proto *tp, unsigned long f)
{
}

static int route4_init(struct tcf_proto *tp)
{
	return 0;
}

static void
route4_delete_filter(struct tcf_proto *tp, struct route4_filter *f)
{
	tcf_unbind_filter(tp, &f->res);
	tcf_exts_destroy(tp, &f->exts);
	kfree(f);
}

static void route4_destroy(struct tcf_proto *tp)
{
	struct route4_head *head = tp->root;
	int h1, h2;

	if (head == NULL)
		return;

	for (h1 = 0; h1 <= 256; h1++) {
		struct route4_bucket *b;

		b = head->table[h1];
		if (b) {
			for (h2 = 0; h2 <= 32; h2++) {
				struct route4_filter *f;

				while ((f = b->ht[h2]) != NULL) {
					b->ht[h2] = f->next;
					route4_delete_filter(tp, f);
				}
			}
			kfree(b);
		}
	}
	kfree(head);
}

static int route4_delete(struct tcf_proto *tp, unsigned long arg)
{
	struct route4_head *head = (struct route4_head *)tp->root;
	struct route4_filter **fp, *f = (struct route4_filter *)arg;
	unsigned int h = 0;
	struct route4_bucket *b;
	int i;

	if (!head || !f)
		return -EINVAL;

	h = f->handle;
	b = f->bkt;

	for (fp = &b->ht[from_hash(h >> 16)]; *fp; fp = &(*fp)->next) {
		if (*fp == f) {
			tcf_tree_lock(tp);
			*fp = f->next;
			tcf_tree_unlock(tp);

			route4_reset_fastmap(tp->q, head, f->id);
			route4_delete_filter(tp, f);

			/* Strip tree */

			for (i = 0; i <= 32; i++)
				if (b->ht[i])
					return 0;

			/* OK, session has no flows */
			tcf_tree_lock(tp);
			head->table[to_hash(h)] = NULL;
			tcf_tree_unlock(tp);

			kfree(b);
			return 0;
		}
	}
	return 0;
}

static const struct nla_policy route4_policy[TCA_ROUTE4_MAX + 1] = {
	[TCA_ROUTE4_CLASSID]	= { .type = NLA_U32 },
	[TCA_ROUTE4_TO]		= { .type = NLA_U32 },
	[TCA_ROUTE4_FROM]	= { .type = NLA_U32 },
	[TCA_ROUTE4_IIF]	= { .type = NLA_U32 },
};

static int route4_set_parms(struct tcf_proto *tp, unsigned long base,
	struct route4_filter *f, u32 handle, struct route4_head *head,
	struct nlattr **tb, struct nlattr *est, int new)
{
	int err;
	u32 id = 0, to = 0, nhandle = 0x8000;
	struct route4_filter *fp;
	unsigned int h1;
	struct route4_bucket *b;
	struct tcf_exts e;

	err = tcf_exts_validate(tp, tb, est, &e, &route_ext_map);
	if (err < 0)
		return err;

	err = -EINVAL;
	if (tb[TCA_ROUTE4_TO]) {
		if (new && handle & 0x8000)
			goto errout;
		to = nla_get_u32(tb[TCA_ROUTE4_TO]);
		if (to > 0xFF)
			goto errout;
		nhandle = to;
	}

	if (tb[TCA_ROUTE4_FROM]) {
		if (tb[TCA_ROUTE4_IIF])
			goto errout;
		id = nla_get_u32(tb[TCA_ROUTE4_FROM]);
		if (id > 0xFF)
			goto errout;
		nhandle |= id << 16;
	} else if (tb[TCA_ROUTE4_IIF]) {
		id = nla_get_u32(tb[TCA_ROUTE4_IIF]);
		if (id > 0x7FFF)
			goto errout;
		nhandle |= (id | 0x8000) << 16;
	} else
		nhandle |= 0xFFFF << 16;

	if (handle && new) {
		nhandle |= handle & 0x7F00;
		if (nhandle != handle)
			goto errout;
	}

	h1 = to_hash(nhandle);
	b = head->table[h1];
	if (!b) {
		err = -ENOBUFS;
		b = kzalloc(sizeof(struct route4_bucket), GFP_KERNEL);
		if (b == NULL)
			goto errout;

		tcf_tree_lock(tp);
		head->table[h1] = b;
		tcf_tree_unlock(tp);
	} else {
		unsigned int h2 = from_hash(nhandle >> 16);

		err = -EEXIST;
		for (fp = b->ht[h2]; fp; fp = fp->next)
			if (fp->handle == f->handle)
				goto errout;
	}

	tcf_tree_lock(tp);
	if (tb[TCA_ROUTE4_TO])
		f->id = to;

	if (tb[TCA_ROUTE4_FROM])
		f->id = to | id<<16;
	else if (tb[TCA_ROUTE4_IIF])
		f->iif = id;

	f->handle = nhandle;
	f->bkt = b;
	tcf_tree_unlock(tp);

	if (tb[TCA_ROUTE4_CLASSID]) {
		f->res.classid = nla_get_u32(tb[TCA_ROUTE4_CLASSID]);
		tcf_bind_filter(tp, &f->res, base);
	}

	tcf_exts_change(tp, &f->exts, &e);

	return 0;
errout:
	tcf_exts_destroy(tp, &e);
	return err;
}

static int route4_change(struct sk_buff *in_skb,
		       struct tcf_proto *tp, unsigned long base,
		       u32 handle,
		       struct nlattr **tca,
		       unsigned long *arg)
{
	struct route4_head *head = tp->root;
	struct route4_filter *f, *f1, **fp;
	struct route4_bucket *b;
	struct nlattr *opt = tca[TCA_OPTIONS];
	struct nlattr *tb[TCA_ROUTE4_MAX + 1];
	unsigned int h, th;
	u32 old_handle = 0;
	int err;

	if (opt == NULL)
		return handle ? -EINVAL : 0;

	err = nla_parse_nested(tb, TCA_ROUTE4_MAX, opt, route4_policy);
	if (err < 0)
		return err;

	f = (struct route4_filter *)*arg;
	if (f) {
		if (f->handle != handle && handle)
			return -EINVAL;

		if (f->bkt)
			old_handle = f->handle;

		err = route4_set_parms(tp, base, f, handle, head, tb,
			tca[TCA_RATE], 0);
		if (err < 0)
			return err;

		goto reinsert;
	}

	err = -ENOBUFS;
	if (head == NULL) {
		head = kzalloc(sizeof(struct route4_head), GFP_KERNEL);
		if (head == NULL)
			goto errout;

		tcf_tree_lock(tp);
		tp->root = head;
		tcf_tree_unlock(tp);
	}

	f = kzalloc(sizeof(struct route4_filter), GFP_KERNEL);
	if (f == NULL)
		goto errout;

	err = route4_set_parms(tp, base, f, handle, head, tb,
		tca[TCA_RATE], 1);
	if (err < 0)
		goto errout;

reinsert:
	h = from_hash(f->handle >> 16);
	for (fp = &f->bkt->ht[h]; (f1 = *fp) != NULL; fp = &f1->next)
		if (f->handle < f1->handle)
			break;

	f->next = f1;
	tcf_tree_lock(tp);
	*fp = f;

	if (old_handle && f->handle != old_handle) {
		th = to_hash(old_handle);
		h = from_hash(old_handle >> 16);
		b = head->table[th];
		if (b) {
			for (fp = &b->ht[h]; *fp; fp = &(*fp)->next) {
				if (*fp == f) {
					*fp = f->next;
					break;
				}
			}
		}
	}
	tcf_tree_unlock(tp);

	route4_reset_fastmap(tp->q, head, f->id);
	*arg = (unsigned long)f;
	return 0;

errout:
	kfree(f);
	return err;
}

static void route4_walk(struct tcf_proto *tp, struct tcf_walker *arg)
{
	struct route4_head *head = tp->root;
	unsigned int h, h1;

	if (head == NULL)
		arg->stop = 1;

	if (arg->stop)
		return;

	for (h = 0; h <= 256; h++) {
		struct route4_bucket *b = head->table[h];

		if (b) {
			for (h1 = 0; h1 <= 32; h1++) {
				struct route4_filter *f;

				for (f = b->ht[h1]; f; f = f->next) {
					if (arg->count < arg->skip) {
						arg->count++;
						continue;
					}
					if (arg->fn(tp, (unsigned long)f, arg) < 0) {
						arg->stop = 1;
						return;
					}
					arg->count++;
				}
			}
		}
	}
}

static int route4_dump(struct tcf_proto *tp, unsigned long fh,
		       struct sk_buff *skb, struct tcmsg *t)
{
	struct route4_filter *f = (struct route4_filter *)fh;
	unsigned char *b = skb_tail_pointer(skb);
	struct nlattr *nest;
	u32 id;

	if (f == NULL)
		return skb->len;

	t->tcm_handle = f->handle;

	nest = nla_nest_start(skb, TCA_OPTIONS);
	if (nest == NULL)
		goto nla_put_failure;

	if (!(f->handle & 0x8000)) {
		id = f->id & 0xFF;
		if (nla_put_u32(skb, TCA_ROUTE4_TO, id))
			goto nla_put_failure;
	}
	if (f->handle & 0x80000000) {
		if ((f->handle >> 16) != 0xFFFF &&
		    nla_put_u32(skb, TCA_ROUTE4_IIF, f->iif))
			goto nla_put_failure;
	} else {
		id = f->id >> 16;
		if (nla_put_u32(skb, TCA_ROUTE4_FROM, id))
			goto nla_put_failure;
	}
	if (f->res.classid &&
	    nla_put_u32(skb, TCA_ROUTE4_CLASSID, f->res.classid))
		goto nla_put_failure;

	if (tcf_exts_dump(skb, &f->exts, &route_ext_map) < 0)
		goto nla_put_failure;

	nla_nest_end(skb, nest);

	if (tcf_exts_dump_stats(skb, &f->exts, &route_ext_map) < 0)
		goto nla_put_failure;

	return skb->len;

nla_put_failure:
	nlmsg_trim(skb, b);
	return -1;
}

static struct tcf_proto_ops cls_route4_ops __read_mostly = {
	.kind		=	"route",
	.classify	=	route4_classify,
	.init		=	route4_init,
	.destroy	=	route4_destroy,
	.get		=	route4_get,
	.put		=	route4_put,
	.change		=	route4_change,
	.delete		=	route4_delete,
	.walk		=	route4_walk,
	.dump		=	route4_dump,
	.owner		=	THIS_MODULE,
};

static int __init init_route4(void)
{
	return register_tcf_proto_ops(&cls_route4_ops);
}

static void __exit exit_route4(void)
{
	unregister_tcf_proto_ops(&cls_route4_ops);
}

module_init(init_route4)
module_exit(exit_route4)
MODULE_LICENSE("GPL");
Commit	Line	Data
1da177e4 LT	1	/*
	2	* net/sched/cls_route.c ROUTE4 classifier.
	3	*
	4	* This program is free software; you can redistribute it and/or
	5	* modify it under the terms of the GNU General Public License
	6	* as published by the Free Software Foundation; either version
	7	* 2 of the License, or (at your option) any later version.
	8	*
	9	* Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
	10	*/
	11
	12	#include <linux/module.h>
5a0e3ad6	13	#include <linux/slab.h>
1da177e4 LT	14	#include <linux/types.h>
1da177e4 LT	15	#include <linux/kernel.h>
1da177e4	16	#include <linux/string.h>
1da177e4	17	#include <linux/errno.h>
1da177e4	18	#include <linux/skbuff.h>
0ba48053 PM	19	#include <net/dst.h>
	20	#include <net/route.h>
	21	#include <net/netlink.h>
1da177e4 LT	22	#include <net/act_api.h>
	23	#include <net/pkt_cls.h>
	24
	25	/*
cc7ec456 ED	26	* 1. For now we assume that route tags < 256.
	27	* It allows to use direct table lookups, instead of hash tables.
	28	* 2. For now we assume that "from TAG" and "fromdev DEV" statements
	29	* are mutually exclusive.
	30	* 3. "to TAG from ANY" has higher priority, than "to ANY from XXX"
1da177e4 LT	31	*/
1da177e4 LT	32
cc7ec456	33	struct route4_fastmap {
1da177e4 LT	34	struct route4_filter *filter;
	35	u32 id;
	36	int iif;
	37	};
	38
cc7ec456	39	struct route4_head {
1da177e4	40	struct route4_fastmap fastmap[16];
cc7ec456	41	struct route4_bucket *table[256 + 1];
1da177e4 LT	42	};
1da177e4 LT	43
cc7ec456	44	struct route4_bucket {
1da177e4	45	/* 16 FROM buckets + 16 IIF buckets + 1 wildcard bucket */
cc7ec456	46	struct route4_filter *ht[16 + 16 + 1];
1da177e4 LT	47	};
1da177e4 LT	48
cc7ec456	49	struct route4_filter {
1da177e4 LT	50	struct route4_filter *next;
	51	u32 id;
	52	int iif;
	53
	54	struct tcf_result res;
	55	struct tcf_exts exts;
	56	u32 handle;
	57	struct route4_bucket *bkt;
	58	};
	59
cc7ec456	60	#define ROUTE4_FAILURE ((struct route4_filter *)(-1L))
1da177e4	61
5239008b	62	static const struct tcf_ext_map route_ext_map = {
1da177e4 LT	63	.police = TCA_ROUTE4_POLICE,
	64	.action = TCA_ROUTE4_ACT
	65	};
	66
cc7ec456	67	static inline int route4_fastmap_hash(u32 id, int iif)
1da177e4	68	{
cc7ec456	69	return id & 0xF;
1da177e4 LT	70	}
1da177e4 LT	71
cc7ec456 ED	72	static void
cc7ec456 ED	73	route4_reset_fastmap(struct Qdisc q, struct route4_head head, u32 id)
1da177e4	74	{
102396ae	75	spinlock_t *root_lock = qdisc_root_sleeping_lock(q);
15b458fa DM	76
15b458fa DM	77	spin_lock_bh(root_lock);
1da177e4	78	memset(head->fastmap, 0, sizeof(head->fastmap));
15b458fa	79	spin_unlock_bh(root_lock);
1da177e4 LT	80	}
1da177e4 LT	81
cc7ec456	82	static void
1da177e4 LT	83	route4_set_fastmap(struct route4_head *head, u32 id, int iif,
	84	struct route4_filter *f)
	85	{
	86	int h = route4_fastmap_hash(id, iif);
cc7ec456	87
1da177e4 LT	88	head->fastmap[h].id = id;
	89	head->fastmap[h].iif = iif;
	90	head->fastmap[h].filter = f;
	91	}
	92
cc7ec456	93	static inline int route4_hash_to(u32 id)
1da177e4	94	{
cc7ec456	95	return id & 0xFF;
1da177e4 LT	96	}
1da177e4 LT	97
cc7ec456	98	static inline int route4_hash_from(u32 id)
1da177e4	99	{
cc7ec456	100	return (id >> 16) & 0xF;
1da177e4 LT	101	}
1da177e4 LT	102
cc7ec456	103	static inline int route4_hash_iif(int iif)
1da177e4	104	{
cc7ec456	105	return 16 + ((iif >> 16) & 0xF);
1da177e4 LT	106	}
1da177e4 LT	107
cc7ec456	108	static inline int route4_hash_wild(void)
1da177e4 LT	109	{
	110	return 32;
	111	}
	112
	113	#define ROUTE4_APPLY_RESULT() \
	114	{ \
	115	*res = f->res; \
	116	if (tcf_exts_is_available(&f->exts)) { \
	117	int r = tcf_exts_exec(skb, &f->exts, res); \
	118	if (r < 0) { \
	119	dont_cache = 1; \
	120	continue; \
	121	} \
	122	return r; \
	123	} else if (!dont_cache) \
	124	route4_set_fastmap(head, id, iif, f); \
	125	return 0; \
	126	}
	127
dc7f9f6e	128	static int route4_classify(struct sk_buff skb, const struct tcf_proto tp,
1da177e4 LT	129	struct tcf_result *res)
1da177e4 LT	130	{
cc7ec456	131	struct route4_head head = (struct route4_head )tp->root;
1da177e4 LT	132	struct dst_entry *dst;
	133	struct route4_bucket *b;
	134	struct route4_filter *f;
	135	u32 id, h;
	136	int iif, dont_cache = 0;
	137
cc7ec456 ED	138	dst = skb_dst(skb);
cc7ec456 ED	139	if (!dst)
1da177e4 LT	140	goto failure;
	141
	142	id = dst->tclassid;
	143	if (head == NULL)
	144	goto old_method;
	145
92101b3b	146	iif = inet_iif(skb);
1da177e4 LT	147
	148	h = route4_fastmap_hash(id, iif);
	149	if (id == head->fastmap[h].id &&
	150	iif == head->fastmap[h].iif &&
	151	(f = head->fastmap[h].filter) != NULL) {
	152	if (f == ROUTE4_FAILURE)
	153	goto failure;
	154
	155	*res = f->res;
	156	return 0;
	157	}
	158
	159	h = route4_hash_to(id);
	160
	161	restart:
cc7ec456 ED	162	b = head->table[h];
cc7ec456 ED	163	if (b) {
1da177e4 LT	164	for (f = b->ht[route4_hash_from(id)]; f; f = f->next)
	165	if (f->id == id)
	166	ROUTE4_APPLY_RESULT();
	167
	168	for (f = b->ht[route4_hash_iif(iif)]; f; f = f->next)
	169	if (f->iif == iif)
	170	ROUTE4_APPLY_RESULT();
	171
	172	for (f = b->ht[route4_hash_wild()]; f; f = f->next)
	173	ROUTE4_APPLY_RESULT();
	174
	175	}
	176	if (h < 256) {
	177	h = 256;
	178	id &= ~0xFFFF;
	179	goto restart;
	180	}
	181
	182	if (!dont_cache)
	183	route4_set_fastmap(head, id, iif, ROUTE4_FAILURE);
	184	failure:
	185	return -1;
	186
	187	old_method:
	188	if (id && (TC_H_MAJ(id) == 0 \|\|
	189	!(TC_H_MAJ(id^tp->q->handle)))) {
	190	res->classid = id;
	191	res->class = 0;
	192	return 0;
	193	}
	194	return -1;
	195	}
	196
	197	static inline u32 to_hash(u32 id)
	198	{
cc7ec456 ED	199	u32 h = id & 0xFF;
	200
	201	if (id & 0x8000)
1da177e4 LT	202	h += 256;
	203	return h;
	204	}
	205
	206	static inline u32 from_hash(u32 id)
	207	{
	208	id &= 0xFFFF;
	209	if (id == 0xFFFF)
	210	return 32;
	211	if (!(id & 0x8000)) {
	212	if (id > 255)
	213	return 256;
cc7ec456	214	return id & 0xF;
1da177e4	215	}
cc7ec456	216	return 16 + (id & 0xF);
1da177e4 LT	217	}
	218
	219	static unsigned long route4_get(struct tcf_proto *tp, u32 handle)
	220	{
cc7ec456	221	struct route4_head head = (struct route4_head )tp->root;
1da177e4 LT	222	struct route4_bucket *b;
1da177e4 LT	223	struct route4_filter *f;
cc7ec456	224	unsigned int h1, h2;
1da177e4 LT	225
	226	if (!head)
	227	return 0;
	228
	229	h1 = to_hash(handle);
	230	if (h1 > 256)
	231	return 0;
	232
cc7ec456	233	h2 = from_hash(handle >> 16);
1da177e4 LT	234	if (h2 > 32)
	235	return 0;
	236
cc7ec456 ED	237	b = head->table[h1];
cc7ec456 ED	238	if (b) {
1da177e4 LT	239	for (f = b->ht[h2]; f; f = f->next)
	240	if (f->handle == handle)
	241	return (unsigned long)f;
	242	}
	243	return 0;
	244	}
	245
	246	static void route4_put(struct tcf_proto *tp, unsigned long f)
	247	{
	248	}
	249
	250	static int route4_init(struct tcf_proto *tp)
	251	{
	252	return 0;
	253	}
	254
cc7ec456	255	static void
1da177e4 LT	256	route4_delete_filter(struct tcf_proto tp, struct route4_filter f)
	257	{
	258	tcf_unbind_filter(tp, &f->res);
	259	tcf_exts_destroy(tp, &f->exts);
	260	kfree(f);
	261	}
	262
	263	static void route4_destroy(struct tcf_proto *tp)
	264	{
47a1a1d4	265	struct route4_head *head = tp->root;
1da177e4 LT	266	int h1, h2;
	267
	268	if (head == NULL)
	269	return;
	270
cc7ec456	271	for (h1 = 0; h1 <= 256; h1++) {
1da177e4 LT	272	struct route4_bucket *b;
1da177e4 LT	273
cc7ec456 ED	274	b = head->table[h1];
	275	if (b) {
	276	for (h2 = 0; h2 <= 32; h2++) {
1da177e4 LT	277	struct route4_filter *f;
	278
	279	while ((f = b->ht[h2]) != NULL) {
	280	b->ht[h2] = f->next;
	281	route4_delete_filter(tp, f);
	282	}
	283	}
	284	kfree(b);
	285	}
	286	}
	287	kfree(head);
	288	}
	289
	290	static int route4_delete(struct tcf_proto *tp, unsigned long arg)
	291	{
cc7ec456 ED	292	struct route4_head head = (struct route4_head )tp->root;
	293	struct route4_filter *fp, f = (struct route4_filter *)arg;
	294	unsigned int h = 0;
1da177e4 LT	295	struct route4_bucket *b;
	296	int i;
	297
	298	if (!head \|\| !f)
	299	return -EINVAL;
	300
	301	h = f->handle;
	302	b = f->bkt;
	303
cc7ec456	304	for (fp = &b->ht[from_hash(h >> 16)]; fp; fp = &(fp)->next) {
1da177e4 LT	305	if (*fp == f) {
	306	tcf_tree_lock(tp);
	307	*fp = f->next;
	308	tcf_tree_unlock(tp);
	309
15b458fa	310	route4_reset_fastmap(tp->q, head, f->id);
1da177e4 LT	311	route4_delete_filter(tp, f);
	312
	313	/* Strip tree */
	314
cc7ec456	315	for (i = 0; i <= 32; i++)
1da177e4 LT	316	if (b->ht[i])
	317	return 0;
	318
	319	/* OK, session has no flows */
	320	tcf_tree_lock(tp);
	321	head->table[to_hash(h)] = NULL;
	322	tcf_tree_unlock(tp);
	323
	324	kfree(b);
	325	return 0;
	326	}
	327	}
	328	return 0;
	329	}
	330
6fa8c014 PM	331	static const struct nla_policy route4_policy[TCA_ROUTE4_MAX + 1] = {
	332	[TCA_ROUTE4_CLASSID] = { .type = NLA_U32 },
	333	[TCA_ROUTE4_TO] = { .type = NLA_U32 },
	334	[TCA_ROUTE4_FROM] = { .type = NLA_U32 },
	335	[TCA_ROUTE4_IIF] = { .type = NLA_U32 },
	336	};
	337
1da177e4 LT	338	static int route4_set_parms(struct tcf_proto *tp, unsigned long base,
1da177e4 LT	339	struct route4_filter f, u32 handle, struct route4_head head,
add93b61	340	struct nlattr *tb, struct nlattr est, int new)
1da177e4 LT	341	{
	342	int err;
	343	u32 id = 0, to = 0, nhandle = 0x8000;
	344	struct route4_filter *fp;
	345	unsigned int h1;
	346	struct route4_bucket *b;
	347	struct tcf_exts e;
	348
	349	err = tcf_exts_validate(tp, tb, est, &e, &route_ext_map);
	350	if (err < 0)
	351	return err;
	352
	353	err = -EINVAL;
add93b61	354	if (tb[TCA_ROUTE4_TO]) {
1da177e4 LT	355	if (new && handle & 0x8000)
1da177e4 LT	356	goto errout;
1587bac4	357	to = nla_get_u32(tb[TCA_ROUTE4_TO]);
1da177e4 LT	358	if (to > 0xFF)
	359	goto errout;
	360	nhandle = to;
	361	}
	362
add93b61 PM	363	if (tb[TCA_ROUTE4_FROM]) {
add93b61 PM	364	if (tb[TCA_ROUTE4_IIF])
1da177e4	365	goto errout;
1587bac4	366	id = nla_get_u32(tb[TCA_ROUTE4_FROM]);
1da177e4 LT	367	if (id > 0xFF)
	368	goto errout;
	369	nhandle \|= id << 16;
add93b61	370	} else if (tb[TCA_ROUTE4_IIF]) {
1587bac4	371	id = nla_get_u32(tb[TCA_ROUTE4_IIF]);
1da177e4 LT	372	if (id > 0x7FFF)
	373	goto errout;
	374	nhandle \|= (id \| 0x8000) << 16;
	375	} else
	376	nhandle \|= 0xFFFF << 16;
	377
	378	if (handle && new) {
	379	nhandle \|= handle & 0x7F00;
	380	if (nhandle != handle)
	381	goto errout;
	382	}
	383
	384	h1 = to_hash(nhandle);
cc7ec456 ED	385	b = head->table[h1];
cc7ec456 ED	386	if (!b) {
1da177e4	387	err = -ENOBUFS;
0da974f4	388	b = kzalloc(sizeof(struct route4_bucket), GFP_KERNEL);
1da177e4 LT	389	if (b == NULL)
1da177e4 LT	390	goto errout;
1da177e4 LT	391
	392	tcf_tree_lock(tp);
	393	head->table[h1] = b;
	394	tcf_tree_unlock(tp);
	395	} else {
	396	unsigned int h2 = from_hash(nhandle >> 16);
cc7ec456	397
1da177e4 LT	398	err = -EEXIST;
	399	for (fp = b->ht[h2]; fp; fp = fp->next)
	400	if (fp->handle == f->handle)
	401	goto errout;
	402	}
	403
	404	tcf_tree_lock(tp);
add93b61	405	if (tb[TCA_ROUTE4_TO])
1da177e4 LT	406	f->id = to;
1da177e4 LT	407
add93b61	408	if (tb[TCA_ROUTE4_FROM])
1da177e4	409	f->id = to \| id<<16;
add93b61	410	else if (tb[TCA_ROUTE4_IIF])
1da177e4 LT	411	f->iif = id;
	412
	413	f->handle = nhandle;
	414	f->bkt = b;
	415	tcf_tree_unlock(tp);
	416
add93b61	417	if (tb[TCA_ROUTE4_CLASSID]) {
1587bac4	418	f->res.classid = nla_get_u32(tb[TCA_ROUTE4_CLASSID]);
1da177e4 LT	419	tcf_bind_filter(tp, &f->res, base);
	420	}
	421
	422	tcf_exts_change(tp, &f->exts, &e);
	423
	424	return 0;
	425	errout:
	426	tcf_exts_destroy(tp, &e);
	427	return err;
	428	}
	429
af4c6641 EB	430	static int route4_change(struct sk_buff *in_skb,
af4c6641 EB	431	struct tcf_proto *tp, unsigned long base,
1da177e4	432	u32 handle,
add93b61	433	struct nlattr **tca,
1da177e4 LT	434	unsigned long *arg)
	435	{
	436	struct route4_head *head = tp->root;
	437	struct route4_filter f, f1, **fp;
	438	struct route4_bucket *b;
add93b61 PM	439	struct nlattr *opt = tca[TCA_OPTIONS];
add93b61 PM	440	struct nlattr *tb[TCA_ROUTE4_MAX + 1];
1da177e4 LT	441	unsigned int h, th;
	442	u32 old_handle = 0;
	443	int err;
	444
	445	if (opt == NULL)
	446	return handle ? -EINVAL : 0;
	447
6fa8c014	448	err = nla_parse_nested(tb, TCA_ROUTE4_MAX, opt, route4_policy);
cee63723 PM	449	if (err < 0)
cee63723 PM	450	return err;
1da177e4	451
cc7ec456 ED	452	f = (struct route4_filter )arg;
cc7ec456 ED	453	if (f) {
1da177e4 LT	454	if (f->handle != handle && handle)
	455	return -EINVAL;
	456
	457	if (f->bkt)
	458	old_handle = f->handle;
	459
	460	err = route4_set_parms(tp, base, f, handle, head, tb,
add93b61	461	tca[TCA_RATE], 0);
1da177e4 LT	462	if (err < 0)
	463	return err;
	464
	465	goto reinsert;
	466	}
	467
	468	err = -ENOBUFS;
	469	if (head == NULL) {
0da974f4	470	head = kzalloc(sizeof(struct route4_head), GFP_KERNEL);
1da177e4 LT	471	if (head == NULL)
1da177e4 LT	472	goto errout;
1da177e4 LT	473
	474	tcf_tree_lock(tp);
	475	tp->root = head;
	476	tcf_tree_unlock(tp);
	477	}
	478
0da974f4	479	f = kzalloc(sizeof(struct route4_filter), GFP_KERNEL);
1da177e4 LT	480	if (f == NULL)
1da177e4 LT	481	goto errout;
1da177e4 LT	482
1da177e4 LT	483	err = route4_set_parms(tp, base, f, handle, head, tb,
add93b61	484	tca[TCA_RATE], 1);
1da177e4 LT	485	if (err < 0)
	486	goto errout;
	487
	488	reinsert:
	489	h = from_hash(f->handle >> 16);
cc7ec456	490	for (fp = &f->bkt->ht[h]; (f1 = *fp) != NULL; fp = &f1->next)
1da177e4 LT	491	if (f->handle < f1->handle)
	492	break;
	493
	494	f->next = f1;
	495	tcf_tree_lock(tp);
	496	*fp = f;
	497
	498	if (old_handle && f->handle != old_handle) {
	499	th = to_hash(old_handle);
	500	h = from_hash(old_handle >> 16);
cc7ec456 ED	501	b = head->table[th];
cc7ec456 ED	502	if (b) {
1da177e4 LT	503	for (fp = &b->ht[h]; fp; fp = &(fp)->next) {
	504	if (*fp == f) {
	505	*fp = f->next;
	506	break;
	507	}
	508	}
	509	}
	510	}
	511	tcf_tree_unlock(tp);
	512
15b458fa	513	route4_reset_fastmap(tp->q, head, f->id);
1da177e4 LT	514	*arg = (unsigned long)f;
	515	return 0;
	516
	517	errout:
a51482bd	518	kfree(f);
1da177e4 LT	519	return err;
	520	}
	521
	522	static void route4_walk(struct tcf_proto tp, struct tcf_walker arg)
	523	{
	524	struct route4_head *head = tp->root;
cc7ec456	525	unsigned int h, h1;
1da177e4 LT	526
	527	if (head == NULL)
	528	arg->stop = 1;
	529
	530	if (arg->stop)
	531	return;
	532
	533	for (h = 0; h <= 256; h++) {
	534	struct route4_bucket *b = head->table[h];
	535
	536	if (b) {
	537	for (h1 = 0; h1 <= 32; h1++) {
	538	struct route4_filter *f;
	539
	540	for (f = b->ht[h1]; f; f = f->next) {
	541	if (arg->count < arg->skip) {
	542	arg->count++;
	543	continue;
	544	}
	545	if (arg->fn(tp, (unsigned long)f, arg) < 0) {
	546	arg->stop = 1;
	547	return;
	548	}
	549	arg->count++;
	550	}
	551	}
	552	}
	553	}
	554	}
	555
	556	static int route4_dump(struct tcf_proto *tp, unsigned long fh,
	557	struct sk_buff skb, struct tcmsg t)
	558	{
cc7ec456	559	struct route4_filter f = (struct route4_filter )fh;
27a884dc	560	unsigned char *b = skb_tail_pointer(skb);
4b3550ef	561	struct nlattr *nest;
1da177e4 LT	562	u32 id;
	563
	564	if (f == NULL)
	565	return skb->len;
	566
	567	t->tcm_handle = f->handle;
	568
4b3550ef PM	569	nest = nla_nest_start(skb, TCA_OPTIONS);
	570	if (nest == NULL)
	571	goto nla_put_failure;
1da177e4	572
cc7ec456 ED	573	if (!(f->handle & 0x8000)) {
cc7ec456 ED	574	id = f->id & 0xFF;
1b34ec43 DM	575	if (nla_put_u32(skb, TCA_ROUTE4_TO, id))
1b34ec43 DM	576	goto nla_put_failure;
1da177e4	577	}
cc7ec456	578	if (f->handle & 0x80000000) {
1b34ec43 DM	579	if ((f->handle >> 16) != 0xFFFF &&
	580	nla_put_u32(skb, TCA_ROUTE4_IIF, f->iif))
	581	goto nla_put_failure;
1da177e4	582	} else {
cc7ec456	583	id = f->id >> 16;
1b34ec43 DM	584	if (nla_put_u32(skb, TCA_ROUTE4_FROM, id))
1b34ec43 DM	585	goto nla_put_failure;
1da177e4	586	}
1b34ec43 DM	587	if (f->res.classid &&
	588	nla_put_u32(skb, TCA_ROUTE4_CLASSID, f->res.classid))
	589	goto nla_put_failure;
1da177e4 LT	590
1da177e4 LT	591	if (tcf_exts_dump(skb, &f->exts, &route_ext_map) < 0)
add93b61	592	goto nla_put_failure;
1da177e4	593
4b3550ef	594	nla_nest_end(skb, nest);
1da177e4 LT	595
1da177e4 LT	596	if (tcf_exts_dump_stats(skb, &f->exts, &route_ext_map) < 0)
add93b61	597	goto nla_put_failure;
1da177e4 LT	598
	599	return skb->len;
	600
add93b61	601	nla_put_failure:
dc5fc579	602	nlmsg_trim(skb, b);
1da177e4 LT	603	return -1;
	604	}
	605
2eb9d75c	606	static struct tcf_proto_ops cls_route4_ops __read_mostly = {
1da177e4 LT	607	.kind = "route",
	608	.classify = route4_classify,
	609	.init = route4_init,
	610	.destroy = route4_destroy,
	611	.get = route4_get,
	612	.put = route4_put,
	613	.change = route4_change,
	614	.delete = route4_delete,
	615	.walk = route4_walk,
	616	.dump = route4_dump,
	617	.owner = THIS_MODULE,
	618	};
	619
	620	static int __init init_route4(void)
	621	{
	622	return register_tcf_proto_ops(&cls_route4_ops);
	623	}
	624
	625	static void __exit exit_route4(void)
	626	{
	627	unregister_tcf_proto_ops(&cls_route4_ops);
	628	}
	629
	630	module_init(init_route4)
	631	module_exit(exit_route4)
	632	MODULE_LICENSE("GPL");