[deliverable/linux.git] / net / sched / cls_basic.c

/*
 * net/sched/cls_basic.c	Basic Packet 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:	Thomas Graf <tgraf@suug.ch>
 */

#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/rtnetlink.h>
#include <linux/skbuff.h>
#include <net/netlink.h>
#include <net/act_api.h>
#include <net/pkt_cls.h>

struct basic_head {
	u32			hgenerator;
	struct list_head	flist;
	struct rcu_head		rcu;
};

struct basic_filter {
	u32			handle;
	struct tcf_exts		exts;
	struct tcf_ematch_tree	ematches;
	struct tcf_result	res;
	struct tcf_proto	*tp;
	struct list_head	link;
	struct rcu_head		rcu;
};

static int basic_classify(struct sk_buff *skb, const struct tcf_proto *tp,
			  struct tcf_result *res)
{
	int r;
	struct basic_head *head = rcu_dereference_bh(tp->root);
	struct basic_filter *f;

	list_for_each_entry_rcu(f, &head->flist, link) {
		if (!tcf_em_tree_match(skb, &f->ematches, NULL))
			continue;
		*res = f->res;
		r = tcf_exts_exec(skb, &f->exts, res);
		if (r < 0)
			continue;
		return r;
	}
	return -1;
}

static unsigned long basic_get(struct tcf_proto *tp, u32 handle)
{
	unsigned long l = 0UL;
	struct basic_head *head = rtnl_dereference(tp->root);
	struct basic_filter *f;

	if (head == NULL)
		return 0UL;

	list_for_each_entry(f, &head->flist, link)
		if (f->handle == handle)
			l = (unsigned long) f;

	return l;
}

static int basic_init(struct tcf_proto *tp)
{
	struct basic_head *head;

	head = kzalloc(sizeof(*head), GFP_KERNEL);
	if (head == NULL)
		return -ENOBUFS;
	INIT_LIST_HEAD(&head->flist);
	rcu_assign_pointer(tp->root, head);
	return 0;
}

static void basic_delete_filter(struct rcu_head *head)
{
	struct basic_filter *f = container_of(head, struct basic_filter, rcu);

	tcf_exts_destroy(&f->exts);
	tcf_em_tree_destroy(&f->ematches);
	kfree(f);
}

static void basic_destroy(struct tcf_proto *tp)
{
	struct basic_head *head = rtnl_dereference(tp->root);
	struct basic_filter *f, *n;

	list_for_each_entry_safe(f, n, &head->flist, link) {
		list_del_rcu(&f->link);
		tcf_unbind_filter(tp, &f->res);
		call_rcu(&f->rcu, basic_delete_filter);
	}
	RCU_INIT_POINTER(tp->root, NULL);
	kfree_rcu(head, rcu);
}

static int basic_delete(struct tcf_proto *tp, unsigned long arg)
{
	struct basic_filter *f = (struct basic_filter *) arg;

	list_del_rcu(&f->link);
	tcf_unbind_filter(tp, &f->res);
	call_rcu(&f->rcu, basic_delete_filter);
	return 0;
}

static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
	[TCA_BASIC_CLASSID]	= { .type = NLA_U32 },
	[TCA_BASIC_EMATCHES]	= { .type = NLA_NESTED },
};

static int basic_set_parms(struct net *net, struct tcf_proto *tp,
			   struct basic_filter *f, unsigned long base,
			   struct nlattr **tb,
			   struct nlattr *est, bool ovr)
{
	int err;
	struct tcf_exts e;
	struct tcf_ematch_tree t;

	tcf_exts_init(&e, TCA_BASIC_ACT, TCA_BASIC_POLICE);
	err = tcf_exts_validate(net, tp, tb, est, &e, ovr);
	if (err < 0)
		return err;

	err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES], &t);
	if (err < 0)
		goto errout;

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

	tcf_exts_change(tp, &f->exts, &e);
	tcf_em_tree_change(tp, &f->ematches, &t);
	f->tp = tp;

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

static int basic_change(struct net *net, struct sk_buff *in_skb,
			struct tcf_proto *tp, unsigned long base, u32 handle,
			struct nlattr **tca, unsigned long *arg, bool ovr)
{
	int err;
	struct basic_head *head = rtnl_dereference(tp->root);
	struct nlattr *tb[TCA_BASIC_MAX + 1];
	struct basic_filter *fold = (struct basic_filter *) *arg;
	struct basic_filter *fnew;

	if (tca[TCA_OPTIONS] == NULL)
		return -EINVAL;

	err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
			       basic_policy);
	if (err < 0)
		return err;

	if (fold != NULL) {
		if (handle && fold->handle != handle)
			return -EINVAL;
	}

	fnew = kzalloc(sizeof(*fnew), GFP_KERNEL);
	if (!fnew)
		return -ENOBUFS;

	tcf_exts_init(&fnew->exts, TCA_BASIC_ACT, TCA_BASIC_POLICE);
	err = -EINVAL;
	if (handle) {
		fnew->handle = handle;
	} else if (fold) {
		fnew->handle = fold->handle;
	} else {
		unsigned int i = 0x80000000;
		do {
			if (++head->hgenerator == 0x7FFFFFFF)
				head->hgenerator = 1;
		} while (--i > 0 && basic_get(tp, head->hgenerator));

		if (i <= 0) {
			pr_err("Insufficient number of handles\n");
			goto errout;
		}

		fnew->handle = head->hgenerator;
	}

	err = basic_set_parms(net, tp, fnew, base, tb, tca[TCA_RATE], ovr);
	if (err < 0)
		goto errout;

	*arg = (unsigned long)fnew;

	if (fold) {
		list_replace_rcu(&fold->link, &fnew->link);
		tcf_unbind_filter(tp, &fold->res);
		call_rcu(&fold->rcu, basic_delete_filter);
	} else {
		list_add_rcu(&fnew->link, &head->flist);
	}

	return 0;
errout:
	kfree(fnew);
	return err;
}

static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg)
{
	struct basic_head *head = rtnl_dereference(tp->root);
	struct basic_filter *f;

	list_for_each_entry(f, &head->flist, link) {
		if (arg->count < arg->skip)
			goto skip;

		if (arg->fn(tp, (unsigned long) f, arg) < 0) {
			arg->stop = 1;
			break;
		}
skip:
		arg->count++;
	}
}

static int basic_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
		      struct sk_buff *skb, struct tcmsg *t)
{
	struct basic_filter *f = (struct basic_filter *) fh;
	struct nlattr *nest;

	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->res.classid &&
	    nla_put_u32(skb, TCA_BASIC_CLASSID, f->res.classid))
		goto nla_put_failure;

	if (tcf_exts_dump(skb, &f->exts) < 0 ||
	    tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 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:
	nla_nest_cancel(skb, nest);
	return -1;
}

static struct tcf_proto_ops cls_basic_ops __read_mostly = {
	.kind		=	"basic",
	.classify	=	basic_classify,
	.init		=	basic_init,
	.destroy	=	basic_destroy,
	.get		=	basic_get,
	.change		=	basic_change,
	.delete		=	basic_delete,
	.walk		=	basic_walk,
	.dump		=	basic_dump,
	.owner		=	THIS_MODULE,
};

static int __init init_basic(void)
{
	return register_tcf_proto_ops(&cls_basic_ops);
}

static void __exit exit_basic(void)
{
	unregister_tcf_proto_ops(&cls_basic_ops);
}

module_init(init_basic)
module_exit(exit_basic)
MODULE_LICENSE("GPL");
Commit	Line	Data
1da177e4 LT	1	/*
	2	* net/sched/cls_basic.c Basic Packet 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: Thomas Graf <tgraf@suug.ch>
	10	*/
	11
1da177e4	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 LT	17	#include <linux/errno.h>
	18	#include <linux/rtnetlink.h>
	19	#include <linux/skbuff.h>
dc5fc579	20	#include <net/netlink.h>
1da177e4 LT	21	#include <net/act_api.h>
	22	#include <net/pkt_cls.h>
	23
cc7ec456	24	struct basic_head {
1da177e4 LT	25	u32 hgenerator;
1da177e4 LT	26	struct list_head flist;
9888faef	27	struct rcu_head rcu;
1da177e4 LT	28	};
1da177e4 LT	29
cc7ec456	30	struct basic_filter {
1da177e4 LT	31	u32 handle;
	32	struct tcf_exts exts;
	33	struct tcf_ematch_tree ematches;
	34	struct tcf_result res;
9888faef	35	struct tcf_proto *tp;
1da177e4	36	struct list_head link;
9888faef	37	struct rcu_head rcu;
1da177e4 LT	38	};
1da177e4 LT	39
dc7f9f6e	40	static int basic_classify(struct sk_buff skb, const struct tcf_proto tp,
1da177e4 LT	41	struct tcf_result *res)
	42	{
	43	int r;
9888faef	44	struct basic_head *head = rcu_dereference_bh(tp->root);
1da177e4 LT	45	struct basic_filter *f;
1da177e4 LT	46
9888faef	47	list_for_each_entry_rcu(f, &head->flist, link) {
1da177e4 LT	48	if (!tcf_em_tree_match(skb, &f->ematches, NULL))
	49	continue;
	50	*res = f->res;
	51	r = tcf_exts_exec(skb, &f->exts, res);
	52	if (r < 0)
	53	continue;
	54	return r;
	55	}
	56	return -1;
	57	}
	58
	59	static unsigned long basic_get(struct tcf_proto *tp, u32 handle)
	60	{
	61	unsigned long l = 0UL;
9888faef	62	struct basic_head *head = rtnl_dereference(tp->root);
1da177e4 LT	63	struct basic_filter *f;
	64
	65	if (head == NULL)
	66	return 0UL;
	67
	68	list_for_each_entry(f, &head->flist, link)
	69	if (f->handle == handle)
	70	l = (unsigned long) f;
	71
	72	return l;
	73	}
	74
1da177e4 LT	75	static int basic_init(struct tcf_proto *tp)
1da177e4 LT	76	{
d3fa76ee PM	77	struct basic_head *head;
	78
	79	head = kzalloc(sizeof(*head), GFP_KERNEL);
	80	if (head == NULL)
	81	return -ENOBUFS;
	82	INIT_LIST_HEAD(&head->flist);
9888faef	83	rcu_assign_pointer(tp->root, head);
1da177e4 LT	84	return 0;
	85	}
	86
9888faef	87	static void basic_delete_filter(struct rcu_head *head)
1da177e4	88	{
9888faef	89	struct basic_filter *f = container_of(head, struct basic_filter, rcu);
9888faef	90
18d0264f	91	tcf_exts_destroy(&f->exts);
82a470f1	92	tcf_em_tree_destroy(&f->ematches);
1da177e4 LT	93	kfree(f);
	94	}
	95
	96	static void basic_destroy(struct tcf_proto *tp)
	97	{
9888faef	98	struct basic_head *head = rtnl_dereference(tp->root);
1da177e4	99	struct basic_filter f, n;
10297b99	100
1da177e4	101	list_for_each_entry_safe(f, n, &head->flist, link) {
9888faef	102	list_del_rcu(&f->link);
18cdb37e	103	tcf_unbind_filter(tp, &f->res);
9888faef	104	call_rcu(&f->rcu, basic_delete_filter);
1da177e4	105	}
9888faef JF	106	RCU_INIT_POINTER(tp->root, NULL);
9888faef JF	107	kfree_rcu(head, rcu);
1da177e4 LT	108	}
	109
	110	static int basic_delete(struct tcf_proto *tp, unsigned long arg)
	111	{
e4386456	112	struct basic_filter f = (struct basic_filter ) arg;
1da177e4	113
e4386456 JP	114	list_del_rcu(&f->link);
	115	tcf_unbind_filter(tp, &f->res);
	116	call_rcu(&f->rcu, basic_delete_filter);
	117	return 0;
1da177e4 LT	118	}
1da177e4 LT	119
6fa8c014 PM	120	static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
	121	[TCA_BASIC_CLASSID] = { .type = NLA_U32 },
	122	[TCA_BASIC_EMATCHES] = { .type = NLA_NESTED },
	123	};
	124
c1b52739 BL	125	static int basic_set_parms(struct net net, struct tcf_proto tp,
	126	struct basic_filter *f, unsigned long base,
	127	struct nlattr **tb,
2f7ef2f8	128	struct nlattr *est, bool ovr)
1da177e4	129	{
6459082a	130	int err;
1da177e4 LT	131	struct tcf_exts e;
	132	struct tcf_ematch_tree t;
	133
5da57f42	134	tcf_exts_init(&e, TCA_BASIC_ACT, TCA_BASIC_POLICE);
2f7ef2f8	135	err = tcf_exts_validate(net, tp, tb, est, &e, ovr);
1da177e4 LT	136	if (err < 0)
	137	return err;
	138
add93b61	139	err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES], &t);
1da177e4 LT	140	if (err < 0)
	141	goto errout;
	142
add93b61	143	if (tb[TCA_BASIC_CLASSID]) {
1587bac4	144	f->res.classid = nla_get_u32(tb[TCA_BASIC_CLASSID]);
1da177e4 LT	145	tcf_bind_filter(tp, &f->res, base);
	146	}
	147
	148	tcf_exts_change(tp, &f->exts, &e);
	149	tcf_em_tree_change(tp, &f->ematches, &t);
9888faef	150	f->tp = tp;
1da177e4 LT	151
	152	return 0;
	153	errout:
18d0264f	154	tcf_exts_destroy(&e);
1da177e4 LT	155	return err;
	156	}
	157
c1b52739	158	static int basic_change(struct net net, struct sk_buff in_skb,
af4c6641	159	struct tcf_proto *tp, unsigned long base, u32 handle,
2f7ef2f8	160	struct nlattr *tca, unsigned long arg, bool ovr)
1da177e4	161	{
cee63723	162	int err;
9888faef	163	struct basic_head *head = rtnl_dereference(tp->root);
add93b61	164	struct nlattr *tb[TCA_BASIC_MAX + 1];
9888faef JF	165	struct basic_filter fold = (struct basic_filter ) *arg;
9888faef JF	166	struct basic_filter *fnew;
1da177e4	167
add93b61	168	if (tca[TCA_OPTIONS] == NULL)
1da177e4 LT	169	return -EINVAL;
1da177e4 LT	170
6fa8c014 PM	171	err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
6fa8c014 PM	172	basic_policy);
cee63723 PM	173	if (err < 0)
cee63723 PM	174	return err;
1da177e4	175
9888faef JF	176	if (fold != NULL) {
9888faef JF	177	if (handle && fold->handle != handle)
1da177e4	178	return -EINVAL;
1da177e4 LT	179	}
1da177e4 LT	180
9888faef	181	fnew = kzalloc(sizeof(*fnew), GFP_KERNEL);
bd42b788 JP	182	if (!fnew)
bd42b788 JP	183	return -ENOBUFS;
1da177e4	184
9888faef	185	tcf_exts_init(&fnew->exts, TCA_BASIC_ACT, TCA_BASIC_POLICE);
1da177e4	186	err = -EINVAL;
9888faef JF	187	if (handle) {
	188	fnew->handle = handle;
	189	} else if (fold) {
	190	fnew->handle = fold->handle;
	191	} else {
658270a0	192	unsigned int i = 0x80000000;
1da177e4 LT	193	do {
	194	if (++head->hgenerator == 0x7FFFFFFF)
	195	head->hgenerator = 1;
	196	} while (--i > 0 && basic_get(tp, head->hgenerator));
	197
	198	if (i <= 0) {
cc7ec456	199	pr_err("Insufficient number of handles\n");
1da177e4 LT	200	goto errout;
	201	}
	202
9888faef	203	fnew->handle = head->hgenerator;
1da177e4 LT	204	}
1da177e4 LT	205
9888faef	206	err = basic_set_parms(net, tp, fnew, base, tb, tca[TCA_RATE], ovr);
1da177e4 LT	207	if (err < 0)
	208	goto errout;
	209
9888faef JF	210	*arg = (unsigned long)fnew;
	211
	212	if (fold) {
	213	list_replace_rcu(&fold->link, &fnew->link);
18cdb37e	214	tcf_unbind_filter(tp, &fold->res);
9888faef JF	215	call_rcu(&fold->rcu, basic_delete_filter);
	216	} else {
	217	list_add_rcu(&fnew->link, &head->flist);
	218	}
1da177e4 LT	219
	220	return 0;
	221	errout:
9888faef	222	kfree(fnew);
1da177e4 LT	223	return err;
	224	}
	225
	226	static void basic_walk(struct tcf_proto tp, struct tcf_walker arg)
	227	{
9888faef	228	struct basic_head *head = rtnl_dereference(tp->root);
1da177e4 LT	229	struct basic_filter *f;
	230
	231	list_for_each_entry(f, &head->flist, link) {
	232	if (arg->count < arg->skip)
	233	goto skip;
	234
	235	if (arg->fn(tp, (unsigned long) f, arg) < 0) {
	236	arg->stop = 1;
	237	break;
	238	}
	239	skip:
	240	arg->count++;
	241	}
	242	}
	243
832d1d5b	244	static int basic_dump(struct net net, struct tcf_proto tp, unsigned long fh,
1da177e4 LT	245	struct sk_buff skb, struct tcmsg t)
	246	{
	247	struct basic_filter f = (struct basic_filter ) fh;
4b3550ef	248	struct nlattr *nest;
1da177e4 LT	249
	250	if (f == NULL)
	251	return skb->len;
	252
	253	t->tcm_handle = f->handle;
	254
4b3550ef PM	255	nest = nla_nest_start(skb, TCA_OPTIONS);
	256	if (nest == NULL)
	257	goto nla_put_failure;
1da177e4	258
1b34ec43 DM	259	if (f->res.classid &&
	260	nla_put_u32(skb, TCA_BASIC_CLASSID, f->res.classid))
	261	goto nla_put_failure;
e1e284a4	262
5da57f42	263	if (tcf_exts_dump(skb, &f->exts) < 0 \|\|
1da177e4	264	tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
add93b61	265	goto nla_put_failure;
1da177e4	266
4b3550ef	267	nla_nest_end(skb, nest);
4c46ee52	268
5da57f42	269	if (tcf_exts_dump_stats(skb, &f->exts) < 0)
4c46ee52	270	goto nla_put_failure;
4c46ee52	271
1da177e4 LT	272	return skb->len;
1da177e4 LT	273
add93b61	274	nla_put_failure:
4b3550ef	275	nla_nest_cancel(skb, nest);
1da177e4 LT	276	return -1;
	277	}
	278
2eb9d75c	279	static struct tcf_proto_ops cls_basic_ops __read_mostly = {
1da177e4 LT	280	.kind = "basic",
	281	.classify = basic_classify,
	282	.init = basic_init,
	283	.destroy = basic_destroy,
	284	.get = basic_get,
1da177e4 LT	285	.change = basic_change,
	286	.delete = basic_delete,
	287	.walk = basic_walk,
	288	.dump = basic_dump,
	289	.owner = THIS_MODULE,
	290	};
	291
	292	static int __init init_basic(void)
	293	{
	294	return register_tcf_proto_ops(&cls_basic_ops);
	295	}
	296
10297b99	297	static void __exit exit_basic(void)
1da177e4 LT	298	{
	299	unregister_tcf_proto_ops(&cls_basic_ops);
	300	}
	301
	302	module_init(init_basic)
	303	module_exit(exit_basic)
	304	MODULE_LICENSE("GPL");
	305