[mirror_ubuntu-bionic-kernel.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 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 net *net, 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;

	tcf_exts_init(&e, TCA_ROUTE4_ACT, TCA_ROUTE4_POLICE);
	err = tcf_exts_validate(net, tp, tb, est, &e);
	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 net *net, 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(net, 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;

	tcf_exts_init(&f->exts, TCA_ROUTE4_ACT, TCA_ROUTE4_POLICE);
	err = route4_set_parms(net, 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) < 0)
		goto nla_put_failure;

	nla_nest_end(skb, nest);

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