[mirror_ubuntu-zesty-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 int basic_classify(struct sk_buff *skb, const struct tcf_proto *tp,
			  struct tcf_result *res)
{
	int r;
	struct basic_head *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 = 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 = 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;
	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);
	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 = 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;

	tcf_exts_init(&f->exts, TCA_BASIC_ACT, TCA_BASIC_POLICE);
	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 = 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,
	.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
dc7f9f6e	37	static int basic_classify(struct sk_buff skb, const struct tcf_proto tp,
1da177e4 LT	38	struct tcf_result *res)
	39	{
	40	int r;
a8701a6c	41	struct basic_head *head = tp->root;
1da177e4 LT	42	struct basic_filter *f;
	43
	44	list_for_each_entry(f, &head->flist, link) {
	45	if (!tcf_em_tree_match(skb, &f->ematches, NULL))
	46	continue;
	47	*res = f->res;
	48	r = tcf_exts_exec(skb, &f->exts, res);
	49	if (r < 0)
	50	continue;
	51	return r;
	52	}
	53	return -1;
	54	}
	55
	56	static unsigned long basic_get(struct tcf_proto *tp, u32 handle)
	57	{
	58	unsigned long l = 0UL;
a8701a6c	59	struct basic_head *head = tp->root;
1da177e4 LT	60	struct basic_filter *f;
	61
	62	if (head == NULL)
	63	return 0UL;
	64
	65	list_for_each_entry(f, &head->flist, link)
	66	if (f->handle == handle)
	67	l = (unsigned long) f;
	68
	69	return l;
	70	}
	71
	72	static void basic_put(struct tcf_proto *tp, unsigned long f)
	73	{
	74	}
	75
	76	static int basic_init(struct tcf_proto *tp)
	77	{
d3fa76ee PM	78	struct basic_head *head;
	79
	80	head = kzalloc(sizeof(*head), GFP_KERNEL);
	81	if (head == NULL)
	82	return -ENOBUFS;
	83	INIT_LIST_HEAD(&head->flist);
	84	tp->root = head;
1da177e4 LT	85	return 0;
	86	}
	87
cc7ec456	88	static void basic_delete_filter(struct tcf_proto tp, struct basic_filter f)
1da177e4 LT	89	{
	90	tcf_unbind_filter(tp, &f->res);
	91	tcf_exts_destroy(tp, &f->exts);
	92	tcf_em_tree_destroy(tp, &f->ematches);
	93	kfree(f);
	94	}
	95
	96	static void basic_destroy(struct tcf_proto *tp)
	97	{
47a1a1d4	98	struct basic_head *head = tp->root;
1da177e4	99	struct basic_filter f, n;
10297b99	100
1da177e4 LT	101	list_for_each_entry_safe(f, n, &head->flist, link) {
	102	list_del(&f->link);
	103	basic_delete_filter(tp, f);
	104	}
31ba548f	105	kfree(head);
1da177e4 LT	106	}
	107
	108	static int basic_delete(struct tcf_proto *tp, unsigned long arg)
	109	{
a8701a6c	110	struct basic_head *head = tp->root;
1da177e4 LT	111	struct basic_filter t, f = (struct basic_filter *) arg;
	112
	113	list_for_each_entry(t, &head->flist, link)
	114	if (t == f) {
	115	tcf_tree_lock(tp);
	116	list_del(&t->link);
	117	tcf_tree_unlock(tp);
	118	basic_delete_filter(tp, t);
	119	return 0;
	120	}
	121
	122	return -ENOENT;
	123	}
	124
6fa8c014 PM	125	static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
	126	[TCA_BASIC_CLASSID] = { .type = NLA_U32 },
	127	[TCA_BASIC_EMATCHES] = { .type = NLA_NESTED },
	128	};
	129
c1b52739 BL	130	static int basic_set_parms(struct net net, struct tcf_proto tp,
	131	struct basic_filter *f, unsigned long base,
	132	struct nlattr **tb,
cc7ec456	133	struct nlattr *est)
1da177e4	134	{
6459082a	135	int err;
1da177e4 LT	136	struct tcf_exts e;
	137	struct tcf_ematch_tree t;
	138
5da57f42 WC	139	tcf_exts_init(&e, TCA_BASIC_ACT, TCA_BASIC_POLICE);
5da57f42 WC	140	err = tcf_exts_validate(net, tp, tb, est, &e);
1da177e4 LT	141	if (err < 0)
	142	return err;
	143
add93b61	144	err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES], &t);
1da177e4 LT	145	if (err < 0)
	146	goto errout;
	147
add93b61	148	if (tb[TCA_BASIC_CLASSID]) {
1587bac4	149	f->res.classid = nla_get_u32(tb[TCA_BASIC_CLASSID]);
1da177e4 LT	150	tcf_bind_filter(tp, &f->res, base);
	151	}
	152
	153	tcf_exts_change(tp, &f->exts, &e);
	154	tcf_em_tree_change(tp, &f->ematches, &t);
	155
	156	return 0;
	157	errout:
	158	tcf_exts_destroy(tp, &e);
	159	return err;
	160	}
	161
c1b52739	162	static int basic_change(struct net net, struct sk_buff in_skb,
af4c6641	163	struct tcf_proto *tp, unsigned long base, u32 handle,
add93b61	164	struct nlattr *tca, unsigned long arg)
1da177e4	165	{
cee63723	166	int err;
a8701a6c	167	struct basic_head *head = tp->root;
add93b61	168	struct nlattr *tb[TCA_BASIC_MAX + 1];
1da177e4 LT	169	struct basic_filter f = (struct basic_filter ) *arg;
1da177e4 LT	170
add93b61	171	if (tca[TCA_OPTIONS] == NULL)
1da177e4 LT	172	return -EINVAL;
1da177e4 LT	173
6fa8c014 PM	174	err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
6fa8c014 PM	175	basic_policy);
cee63723 PM	176	if (err < 0)
cee63723 PM	177	return err;
1da177e4 LT	178
	179	if (f != NULL) {
	180	if (handle && f->handle != handle)
	181	return -EINVAL;
c1b52739	182	return basic_set_parms(net, tp, f, base, tb, tca[TCA_RATE]);
1da177e4 LT	183	}
	184
	185	err = -ENOBUFS;
0da974f4	186	f = kzalloc(sizeof(*f), GFP_KERNEL);
1da177e4 LT	187	if (f == NULL)
1da177e4 LT	188	goto errout;
1da177e4	189
5da57f42	190	tcf_exts_init(&f->exts, TCA_BASIC_ACT, TCA_BASIC_POLICE);
1da177e4 LT	191	err = -EINVAL;
	192	if (handle)
	193	f->handle = handle;
	194	else {
658270a0	195	unsigned int i = 0x80000000;
1da177e4 LT	196	do {
	197	if (++head->hgenerator == 0x7FFFFFFF)
	198	head->hgenerator = 1;
	199	} while (--i > 0 && basic_get(tp, head->hgenerator));
	200
	201	if (i <= 0) {
cc7ec456	202	pr_err("Insufficient number of handles\n");
1da177e4 LT	203	goto errout;
	204	}
	205
	206	f->handle = head->hgenerator;
	207	}
	208
c1b52739	209	err = basic_set_parms(net, tp, f, base, tb, tca[TCA_RATE]);
1da177e4 LT	210	if (err < 0)
	211	goto errout;
	212
	213	tcf_tree_lock(tp);
	214	list_add(&f->link, &head->flist);
	215	tcf_tree_unlock(tp);
	216	*arg = (unsigned long) f;
	217
	218	return 0;
	219	errout:
	220	if (*arg == 0UL && f)
	221	kfree(f);
	222
	223	return err;
	224	}
	225
	226	static void basic_walk(struct tcf_proto tp, struct tcf_walker arg)
	227	{
a8701a6c	228	struct basic_head *head = 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,
	285	.put = basic_put,
	286	.change = basic_change,
	287	.delete = basic_delete,
	288	.walk = basic_walk,
	289	.dump = basic_dump,
	290	.owner = THIS_MODULE,
	291	};
	292
	293	static int __init init_basic(void)
	294	{
	295	return register_tcf_proto_ops(&cls_basic_ops);
	296	}
	297
10297b99	298	static void __exit exit_basic(void)
1da177e4 LT	299	{
	300	unregister_tcf_proto_ops(&cls_basic_ops);
	301	}
	302
	303	module_init(init_basic)
	304	module_exit(exit_basic)
	305	MODULE_LICENSE("GPL");
	306