[mirror_ubuntu-artful-kernel.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 basic_filter {
	u32			handle;
	struct tcf_exts		exts;
	struct tcf_ematch_tree	ematches;
	struct tcf_result	res;
	struct list_head	link;
};

static const struct tcf_ext_map basic_ext_map = {
	.action = TCA_BASIC_ACT,
	.police = TCA_BASIC_POLICE
};

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

	list_for_each_entry(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 = (struct basic_head *) 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 void basic_put(struct tcf_proto *tp, unsigned long f)
{
}

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);
	tp->root = head;
	return 0;
}

static void basic_delete_filter(struct tcf_proto *tp, struct basic_filter *f)
{
	tcf_unbind_filter(tp, &f->res);
	tcf_exts_destroy(tp, &f->exts);
	tcf_em_tree_destroy(tp, &f->ematches);
	kfree(f);
}

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

	list_for_each_entry_safe(f, n, &head->flist, link) {
		list_del(&f->link);
		basic_delete_filter(tp, f);
	}
	kfree(head);
}

static int basic_delete(struct tcf_proto *tp, unsigned long arg)
{
	struct basic_head *head = (struct basic_head *) tp->root;
	struct basic_filter *t, *f = (struct basic_filter *) arg;

	list_for_each_entry(t, &head->flist, link)
		if (t == f) {
			tcf_tree_lock(tp);
			list_del(&t->link);
			tcf_tree_unlock(tp);
			basic_delete_filter(tp, t);
			return 0;
		}

	return -ENOENT;
}

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)
{
	int err = -EINVAL;
	struct tcf_exts e;
	struct tcf_ematch_tree t;

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

	return 0;
errout:
	tcf_exts_destroy(tp, &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)
{
	int err;
	struct basic_head *head = (struct basic_head *) tp->root;
	struct nlattr *tb[TCA_BASIC_MAX + 1];
	struct basic_filter *f = (struct basic_filter *) *arg;

	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 (f != NULL) {
		if (handle && f->handle != handle)
			return -EINVAL;
		return basic_set_parms(net, tp, f, base, tb, tca[TCA_RATE]);
	}

	err = -ENOBUFS;
	f = kzalloc(sizeof(*f), GFP_KERNEL);
	if (f == NULL)
		goto errout;

	err = -EINVAL;
	if (handle)
		f->handle = 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;
		}

		f->handle = head->hgenerator;
	}

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

	tcf_tree_lock(tp);
	list_add(&f->link, &head->flist);
	tcf_tree_unlock(tp);
	*arg = (unsigned long) f;

	return 0;
errout:
	if (*arg == 0UL && f)
		kfree(f);

	return err;
}

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