[mirror_ubuntu-bionic-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/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 struct tcf_ext_map basic_ext_map = {
	.action = TCA_BASIC_ACT,
	.police = TCA_BASIC_POLICE
};

static int basic_classify(struct sk_buff *skb, 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 inline 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 = (struct basic_head *) xchg(&tp->root, NULL);
	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 inline int basic_set_parms(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;

	if (tb[TCA_BASIC_CLASSID])
		if (nla_len(tb[TCA_BASIC_CLASSID]) < sizeof(u32))
			return err;

	err = tcf_exts_validate(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 = *(u32*)nla_data(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 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], NULL);
	if (err < 0)
		return err;

	if (f != NULL) {
		if (handle && f->handle != handle)
			return -EINVAL;
		return basic_set_parms(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) {
			printk(KERN_ERR "Insufficient number of handles\n");
			goto errout;
		}

		f->handle = head->hgenerator;
	}

	err = basic_set_parms(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(skb, TCA_BASIC_CLASSID, sizeof(u32), &f->res.classid);

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