[mirror_ubuntu-bionic-kernel.git] / net / sched / cls_tcindex.c

/*
 * net/sched/cls_tcindex.c	Packet classifier for skb->tc_index
 *
 * Written 1998,1999 by Werner Almesberger, EPFL ICA
 */

#include <linux/module.h>
#include <linux/types.h>
#include <linux/kernel.h>
#include <linux/skbuff.h>
#include <linux/errno.h>
#include <linux/slab.h>
#include <net/act_api.h>
#include <net/netlink.h>
#include <net/pkt_cls.h>

/*
 * Passing parameters to the root seems to be done more awkwardly than really
 * necessary. At least, u32 doesn't seem to use such dirty hacks. To be
 * verified. FIXME.
 */

#define PERFECT_HASH_THRESHOLD	64	/* use perfect hash if not bigger */
#define DEFAULT_HASH_SIZE	64	/* optimized for diffserv */


struct tcindex_filter_result {
	struct tcf_exts		exts;
	struct tcf_result	res;
};

struct tcindex_filter {
	u16 key;
	struct tcindex_filter_result result;
	struct tcindex_filter *next;
};


struct tcindex_data {
	struct tcindex_filter_result *perfect; /* perfect hash; NULL if none */
	struct tcindex_filter **h; /* imperfect hash; only used if !perfect;
				      NULL if unused */
	u16 mask;		/* AND key with mask */
	int shift;		/* shift ANDed key to the right */
	int hash;		/* hash table size; 0 if undefined */
	int alloc_hash;		/* allocated size */
	int fall_through;	/* 0: only classify if explicit match */
};

static inline int
tcindex_filter_is_set(struct tcindex_filter_result *r)
{
	return tcf_exts_is_predicative(&r->exts) || r->res.classid;
}

static struct tcindex_filter_result *
tcindex_lookup(struct tcindex_data *p, u16 key)
{
	struct tcindex_filter *f;

	if (p->perfect)
		return tcindex_filter_is_set(p->perfect + key) ?
			p->perfect + key : NULL;
	else if (p->h) {
		for (f = p->h[key % p->hash]; f; f = f->next)
			if (f->key == key)
				return &f->result;
	}

	return NULL;
}


static int tcindex_classify(struct sk_buff *skb, const struct tcf_proto *tp,
			    struct tcf_result *res)
{
	struct tcindex_data *p = tp->root;
	struct tcindex_filter_result *f;
	int key = (skb->tc_index & p->mask) >> p->shift;

	pr_debug("tcindex_classify(skb %p,tp %p,res %p),p %p\n",
		 skb, tp, res, p);

	f = tcindex_lookup(p, key);
	if (!f) {
		if (!p->fall_through)
			return -1;
		res->classid = TC_H_MAKE(TC_H_MAJ(tp->q->handle), key);
		res->class = 0;
		pr_debug("alg 0x%x\n", res->classid);
		return 0;
	}
	*res = f->res;
	pr_debug("map 0x%x\n", res->classid);

	return tcf_exts_exec(skb, &f->exts, res);
}


static unsigned long tcindex_get(struct tcf_proto *tp, u32 handle)
{
	struct tcindex_data *p = tp->root;
	struct tcindex_filter_result *r;

	pr_debug("tcindex_get(tp %p,handle 0x%08x)\n", tp, handle);
	if (p->perfect && handle >= p->alloc_hash)
		return 0;
	r = tcindex_lookup(p, handle);
	return r && tcindex_filter_is_set(r) ? (unsigned long) r : 0UL;
}


static void tcindex_put(struct tcf_proto *tp, unsigned long f)
{
	pr_debug("tcindex_put(tp %p,f 0x%lx)\n", tp, f);
}


static int tcindex_init(struct tcf_proto *tp)
{
	struct tcindex_data *p;

	pr_debug("tcindex_init(tp %p)\n", tp);
	p = kzalloc(sizeof(struct tcindex_data), GFP_KERNEL);
	if (!p)
		return -ENOMEM;

	p->mask = 0xffff;
	p->hash = DEFAULT_HASH_SIZE;
	p->fall_through = 1;

	tp->root = p;
	return 0;
}


static int
__tcindex_delete(struct tcf_proto *tp, unsigned long arg, int lock)
{
	struct tcindex_data *p = tp->root;
	struct tcindex_filter_result *r = (struct tcindex_filter_result *) arg;
	struct tcindex_filter *f = NULL;

	pr_debug("tcindex_delete(tp %p,arg 0x%lx),p %p,f %p\n", tp, arg, p, f);
	if (p->perfect) {
		if (!r->res.class)
			return -ENOENT;
	} else {
		int i;
		struct tcindex_filter **walk = NULL;

		for (i = 0; i < p->hash; i++)
			for (walk = p->h+i; *walk; walk = &(*walk)->next)
				if (&(*walk)->result == r)
					goto found;
		return -ENOENT;

found:
		f = *walk;
		if (lock)
			tcf_tree_lock(tp);
		*walk = f->next;
		if (lock)
			tcf_tree_unlock(tp);
	}
	tcf_unbind_filter(tp, &r->res);
	tcf_exts_destroy(tp, &r->exts);
	kfree(f);
	return 0;
}

static int tcindex_delete(struct tcf_proto *tp, unsigned long arg)
{
	return __tcindex_delete(tp, arg, 1);
}

static inline int
valid_perfect_hash(struct tcindex_data *p)
{
	return  p->hash > (p->mask >> p->shift);
}

static const struct nla_policy tcindex_policy[TCA_TCINDEX_MAX + 1] = {
	[TCA_TCINDEX_HASH]		= { .type = NLA_U32 },
	[TCA_TCINDEX_MASK]		= { .type = NLA_U16 },
	[TCA_TCINDEX_SHIFT]		= { .type = NLA_U32 },
	[TCA_TCINDEX_FALL_THROUGH]	= { .type = NLA_U32 },
	[TCA_TCINDEX_CLASSID]		= { .type = NLA_U32 },
};

static void tcindex_filter_result_init(struct tcindex_filter_result *r)
{
	memset(r, 0, sizeof(*r));
	tcf_exts_init(&r->exts, TCA_TCINDEX_ACT, TCA_TCINDEX_POLICE);
}

static int
tcindex_set_parms(struct net *net, struct tcf_proto *tp, unsigned long base,
		  u32 handle, struct tcindex_data *p,
		  struct tcindex_filter_result *r, struct nlattr **tb,
		 struct nlattr *est)
{
	int err, balloc = 0;
	struct tcindex_filter_result new_filter_result, *old_r = r;
	struct tcindex_filter_result cr;
	struct tcindex_data cp;
	struct tcindex_filter *f = NULL; /* make gcc behave */
	struct tcf_exts e;

	tcf_exts_init(&e, TCA_TCINDEX_ACT, TCA_TCINDEX_POLICE);
	err = tcf_exts_validate(net, tp, tb, est, &e);
	if (err < 0)
		return err;

	memcpy(&cp, p, sizeof(cp));
	tcindex_filter_result_init(&new_filter_result);

	tcindex_filter_result_init(&cr);
	if (old_r)
		cr.res = r->res;

	if (tb[TCA_TCINDEX_HASH])
		cp.hash = nla_get_u32(tb[TCA_TCINDEX_HASH]);

	if (tb[TCA_TCINDEX_MASK])
		cp.mask = nla_get_u16(tb[TCA_TCINDEX_MASK]);

	if (tb[TCA_TCINDEX_SHIFT])
		cp.shift = nla_get_u32(tb[TCA_TCINDEX_SHIFT]);

	err = -EBUSY;
	/* Hash already allocated, make sure that we still meet the
	 * requirements for the allocated hash.
	 */
	if (cp.perfect) {
		if (!valid_perfect_hash(&cp) ||
		    cp.hash > cp.alloc_hash)
			goto errout;
	} else if (cp.h && cp.hash != cp.alloc_hash)
		goto errout;

	err = -EINVAL;
	if (tb[TCA_TCINDEX_FALL_THROUGH])
		cp.fall_through = nla_get_u32(tb[TCA_TCINDEX_FALL_THROUGH]);

	if (!cp.hash) {
		/* Hash not specified, use perfect hash if the upper limit
		 * of the hashing index is below the threshold.
		 */
		if ((cp.mask >> cp.shift) < PERFECT_HASH_THRESHOLD)
			cp.hash = (cp.mask >> cp.shift) + 1;
		else
			cp.hash = DEFAULT_HASH_SIZE;
	}

	if (!cp.perfect && !cp.h)
		cp.alloc_hash = cp.hash;

	/* Note: this could be as restrictive as if (handle & ~(mask >> shift))
	 * but then, we'd fail handles that may become valid after some future
	 * mask change. While this is extremely unlikely to ever matter,
	 * the check below is safer (and also more backwards-compatible).
	 */
	if (cp.perfect || valid_perfect_hash(&cp))
		if (handle >= cp.alloc_hash)
			goto errout;


	err = -ENOMEM;
	if (!cp.perfect && !cp.h) {
		if (valid_perfect_hash(&cp)) {
			int i;

			cp.perfect = kcalloc(cp.hash, sizeof(*r), GFP_KERNEL);
			if (!cp.perfect)
				goto errout;
			for (i = 0; i < cp.hash; i++)
				tcf_exts_init(&cp.perfect[i].exts, TCA_TCINDEX_ACT,
					      TCA_TCINDEX_POLICE);
			balloc = 1;
		} else {
			cp.h = kcalloc(cp.hash, sizeof(f), GFP_KERNEL);
			if (!cp.h)
				goto errout;
			balloc = 2;
		}
	}

	if (cp.perfect)
		r = cp.perfect + handle;
	else
		r = tcindex_lookup(&cp, handle) ? : &new_filter_result;

	if (r == &new_filter_result) {
		f = kzalloc(sizeof(*f), GFP_KERNEL);
		if (!f)
			goto errout_alloc;
	}

	if (tb[TCA_TCINDEX_CLASSID]) {
		cr.res.classid = nla_get_u32(tb[TCA_TCINDEX_CLASSID]);
		tcf_bind_filter(tp, &cr.res, base);
	}

	if (old_r)
		tcf_exts_change(tp, &r->exts, &e);
	else
		tcf_exts_change(tp, &cr.exts, &e);

	tcf_tree_lock(tp);
	if (old_r && old_r != r)
		tcindex_filter_result_init(old_r);

	memcpy(p, &cp, sizeof(cp));
	r->res = cr.res;

	if (r == &new_filter_result) {
		struct tcindex_filter **fp;

		f->key = handle;
		f->result = new_filter_result;
		f->next = NULL;
		for (fp = p->h+(handle % p->hash); *fp; fp = &(*fp)->next)
			/* nothing */;
		*fp = f;
	}
	tcf_tree_unlock(tp);

	return 0;

errout_alloc:
	if (balloc == 1)
		kfree(cp.perfect);
	else if (balloc == 2)
		kfree(cp.h);
errout:
	tcf_exts_destroy(tp, &e);
	return err;
}

static int
tcindex_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 nlattr *opt = tca[TCA_OPTIONS];
	struct nlattr *tb[TCA_TCINDEX_MAX + 1];
	struct tcindex_data *p = tp->root;
	struct tcindex_filter_result *r = (struct tcindex_filter_result *) *arg;
	int err;

	pr_debug("tcindex_change(tp %p,handle 0x%08x,tca %p,arg %p),opt %p,"
	    "p %p,r %p,*arg 0x%lx\n",
	    tp, handle, tca, arg, opt, p, r, arg ? *arg : 0L);

	if (!opt)
		return 0;

	err = nla_parse_nested(tb, TCA_TCINDEX_MAX, opt, tcindex_policy);
	if (err < 0)
		return err;

	return tcindex_set_parms(net, tp, base, handle, p, r, tb,
				 tca[TCA_RATE]);
}


static void tcindex_walk(struct tcf_proto *tp, struct tcf_walker *walker)
{
	struct tcindex_data *p = tp->root;
	struct tcindex_filter *f, *next;
	int i;

	pr_debug("tcindex_walk(tp %p,walker %p),p %p\n", tp, walker, p);
	if (p->perfect) {
		for (i = 0; i < p->hash; i++) {
			if (!p->perfect[i].res.class)
				continue;
			if (walker->count >= walker->skip) {
				if (walker->fn(tp,
				    (unsigned long) (p->perfect+i), walker)
				     < 0) {
					walker->stop = 1;
					return;
				}
			}
			walker->count++;
		}
	}
	if (!p->h)
		return;
	for (i = 0; i < p->hash; i++) {
		for (f = p->h[i]; f; f = next) {
			next = f->next;
			if (walker->count >= walker->skip) {
				if (walker->fn(tp, (unsigned long) &f->result,
				    walker) < 0) {
					walker->stop = 1;
					return;
				}
			}
			walker->count++;
		}
	}
}


static int tcindex_destroy_element(struct tcf_proto *tp,
    unsigned long arg, struct tcf_walker *walker)
{
	return __tcindex_delete(tp, arg, 0);
}


static void tcindex_destroy(struct tcf_proto *tp)
{
	struct tcindex_data *p = tp->root;
	struct tcf_walker walker;

	pr_debug("tcindex_destroy(tp %p),p %p\n", tp, p);
	walker.count = 0;
	walker.skip = 0;
	walker.fn = &tcindex_destroy_element;
	tcindex_walk(tp, &walker);
	kfree(p->perfect);
	kfree(p->h);
	kfree(p);
	tp->root = NULL;
}


static int tcindex_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
    struct sk_buff *skb, struct tcmsg *t)
{
	struct tcindex_data *p = tp->root;
	struct tcindex_filter_result *r = (struct tcindex_filter_result *) fh;
	unsigned char *b = skb_tail_pointer(skb);
	struct nlattr *nest;

	pr_debug("tcindex_dump(tp %p,fh 0x%lx,skb %p,t %p),p %p,r %p,b %p\n",
		 tp, fh, skb, t, p, r, b);
	pr_debug("p->perfect %p p->h %p\n", p->perfect, p->h);

	nest = nla_nest_start(skb, TCA_OPTIONS);
	if (nest == NULL)
		goto nla_put_failure;

	if (!fh) {
		t->tcm_handle = ~0; /* whatever ... */
		if (nla_put_u32(skb, TCA_TCINDEX_HASH, p->hash) ||
		    nla_put_u16(skb, TCA_TCINDEX_MASK, p->mask) ||
		    nla_put_u32(skb, TCA_TCINDEX_SHIFT, p->shift) ||
		    nla_put_u32(skb, TCA_TCINDEX_FALL_THROUGH, p->fall_through))
			goto nla_put_failure;
		nla_nest_end(skb, nest);
	} else {
		if (p->perfect) {
			t->tcm_handle = r-p->perfect;
		} else {
			struct tcindex_filter *f;
			int i;

			t->tcm_handle = 0;
			for (i = 0; !t->tcm_handle && i < p->hash; i++) {
				for (f = p->h[i]; !t->tcm_handle && f;
				     f = f->next) {
					if (&f->result == r)
						t->tcm_handle = f->key;
				}
			}
		}
		pr_debug("handle = %d\n", t->tcm_handle);
		if (r->res.class &&
		    nla_put_u32(skb, TCA_TCINDEX_CLASSID, r->res.classid))
			goto nla_put_failure;

		if (tcf_exts_dump(skb, &r->exts) < 0)
			goto nla_put_failure;
		nla_nest_end(skb, nest);

		if (tcf_exts_dump_stats(skb, &r->exts) < 0)
			goto nla_put_failure;
	}

	return skb->len;

nla_put_failure:
	nlmsg_trim(skb, b);
	return -1;
}

static struct tcf_proto_ops cls_tcindex_ops __read_mostly = {
	.kind		=	"tcindex",
	.classify	=	tcindex_classify,
	.init		=	tcindex_init,
	.destroy	=	tcindex_destroy,
	.get		=	tcindex_get,
	.put		=	tcindex_put,
	.change		=	tcindex_change,
	.delete		=	tcindex_delete,
	.walk		=	tcindex_walk,
	.dump		=	tcindex_dump,
	.owner		=	THIS_MODULE,
};

static int __init init_tcindex(void)
{
	return register_tcf_proto_ops(&cls_tcindex_ops);
}

static void __exit exit_tcindex(void)
{
	unregister_tcf_proto_ops(&cls_tcindex_ops);
}

module_init(init_tcindex)
module_exit(exit_tcindex)
MODULE_LICENSE("GPL");
Commit	Line	Data
1da177e4 LT	1	/*
	2	* net/sched/cls_tcindex.c Packet classifier for skb->tc_index
	3	*
	4	* Written 1998,1999 by Werner Almesberger, EPFL ICA
	5	*/
	6
1da177e4 LT	7	#include <linux/module.h>
	8	#include <linux/types.h>
	9	#include <linux/kernel.h>
	10	#include <linux/skbuff.h>
	11	#include <linux/errno.h>
5a0e3ad6	12	#include <linux/slab.h>
1da177e4	13	#include <net/act_api.h>
dc5fc579	14	#include <net/netlink.h>
1da177e4	15	#include <net/pkt_cls.h>
1da177e4	16
1da177e4 LT	17	/*
	18	* Passing parameters to the root seems to be done more awkwardly than really
	19	* necessary. At least, u32 doesn't seem to use such dirty hacks. To be
	20	* verified. FIXME.
	21	*/
	22
	23	#define PERFECT_HASH_THRESHOLD 64 /* use perfect hash if not bigger */
	24	#define DEFAULT_HASH_SIZE 64 /* optimized for diffserv */
	25
	26
1da177e4 LT	27	struct tcindex_filter_result {
	28	struct tcf_exts exts;
	29	struct tcf_result res;
	30	};
	31
	32	struct tcindex_filter {
	33	u16 key;
	34	struct tcindex_filter_result result;
	35	struct tcindex_filter *next;
	36	};
	37
	38
	39	struct tcindex_data {
	40	struct tcindex_filter_result perfect; / perfect hash; NULL if none */
	41	struct tcindex_filter *h; / imperfect hash; only used if !perfect;
	42	NULL if unused */
	43	u16 mask; /* AND key with mask */
	44	int shift; /* shift ANDed key to the right */
	45	int hash; /* hash table size; 0 if undefined */
	46	int alloc_hash; /* allocated size */
	47	int fall_through; /* 0: only classify if explicit match */
	48	};
	49
1da177e4 LT	50	static inline int
	51	tcindex_filter_is_set(struct tcindex_filter_result *r)
	52	{
	53	return tcf_exts_is_predicative(&r->exts) \|\| r->res.classid;
	54	}
	55
	56	static struct tcindex_filter_result *
	57	tcindex_lookup(struct tcindex_data *p, u16 key)
	58	{
	59	struct tcindex_filter *f;
	60
	61	if (p->perfect)
	62	return tcindex_filter_is_set(p->perfect + key) ?
	63	p->perfect + key : NULL;
	64	else if (p->h) {
	65	for (f = p->h[key % p->hash]; f; f = f->next)
	66	if (f->key == key)
	67	return &f->result;
	68	}
	69
	70	return NULL;
	71	}
	72
	73
dc7f9f6e	74	static int tcindex_classify(struct sk_buff skb, const struct tcf_proto tp,
1da177e4 LT	75	struct tcf_result *res)
1da177e4 LT	76	{
a8701a6c	77	struct tcindex_data *p = tp->root;
1da177e4 LT	78	struct tcindex_filter_result *f;
	79	int key = (skb->tc_index & p->mask) >> p->shift;
	80
aa767bfe SH	81	pr_debug("tcindex_classify(skb %p,tp %p,res %p),p %p\n",
aa767bfe SH	82	skb, tp, res, p);
1da177e4 LT	83
	84	f = tcindex_lookup(p, key);
	85	if (!f) {
	86	if (!p->fall_through)
	87	return -1;
	88	res->classid = TC_H_MAKE(TC_H_MAJ(tp->q->handle), key);
	89	res->class = 0;
aa767bfe	90	pr_debug("alg 0x%x\n", res->classid);
1da177e4 LT	91	return 0;
	92	}
	93	*res = f->res;
aa767bfe	94	pr_debug("map 0x%x\n", res->classid);
1da177e4 LT	95
	96	return tcf_exts_exec(skb, &f->exts, res);
	97	}
	98
	99
	100	static unsigned long tcindex_get(struct tcf_proto *tp, u32 handle)
	101	{
a8701a6c	102	struct tcindex_data *p = tp->root;
1da177e4 LT	103	struct tcindex_filter_result *r;
1da177e4 LT	104
aa767bfe	105	pr_debug("tcindex_get(tp %p,handle 0x%08x)\n", tp, handle);
1da177e4 LT	106	if (p->perfect && handle >= p->alloc_hash)
	107	return 0;
	108	r = tcindex_lookup(p, handle);
	109	return r && tcindex_filter_is_set(r) ? (unsigned long) r : 0UL;
	110	}
	111
	112
	113	static void tcindex_put(struct tcf_proto *tp, unsigned long f)
	114	{
aa767bfe	115	pr_debug("tcindex_put(tp %p,f 0x%lx)\n", tp, f);
1da177e4 LT	116	}
	117
	118
	119	static int tcindex_init(struct tcf_proto *tp)
	120	{
	121	struct tcindex_data *p;
	122
aa767bfe SH	123	pr_debug("tcindex_init(tp %p)\n", tp);
aa767bfe SH	124	p = kzalloc(sizeof(struct tcindex_data), GFP_KERNEL);
1da177e4 LT	125	if (!p)
	126	return -ENOMEM;
	127
1da177e4 LT	128	p->mask = 0xffff;
	129	p->hash = DEFAULT_HASH_SIZE;
	130	p->fall_through = 1;
	131
	132	tp->root = p;
	133	return 0;
	134	}
	135
	136
	137	static int
	138	__tcindex_delete(struct tcf_proto *tp, unsigned long arg, int lock)
	139	{
a8701a6c	140	struct tcindex_data *p = tp->root;
1da177e4 LT	141	struct tcindex_filter_result r = (struct tcindex_filter_result ) arg;
	142	struct tcindex_filter *f = NULL;
	143
aa767bfe	144	pr_debug("tcindex_delete(tp %p,arg 0x%lx),p %p,f %p\n", tp, arg, p, f);
1da177e4 LT	145	if (p->perfect) {
	146	if (!r->res.class)
	147	return -ENOENT;
	148	} else {
	149	int i;
	150	struct tcindex_filter **walk = NULL;
	151
	152	for (i = 0; i < p->hash; i++)
	153	for (walk = p->h+i; walk; walk = &(walk)->next)
	154	if (&(*walk)->result == r)
	155	goto found;
	156	return -ENOENT;
	157
	158	found:
	159	f = *walk;
	160	if (lock)
	161	tcf_tree_lock(tp);
	162	*walk = f->next;
	163	if (lock)
	164	tcf_tree_unlock(tp);
	165	}
	166	tcf_unbind_filter(tp, &r->res);
	167	tcf_exts_destroy(tp, &r->exts);
a51482bd	168	kfree(f);
1da177e4 LT	169	return 0;
	170	}
	171
	172	static int tcindex_delete(struct tcf_proto *tp, unsigned long arg)
	173	{
	174	return __tcindex_delete(tp, arg, 1);
	175	}
	176
	177	static inline int
	178	valid_perfect_hash(struct tcindex_data *p)
	179	{
	180	return p->hash > (p->mask >> p->shift);
	181	}
	182
6fa8c014 PM	183	static const struct nla_policy tcindex_policy[TCA_TCINDEX_MAX + 1] = {
	184	[TCA_TCINDEX_HASH] = { .type = NLA_U32 },
	185	[TCA_TCINDEX_MASK] = { .type = NLA_U16 },
	186	[TCA_TCINDEX_SHIFT] = { .type = NLA_U32 },
	187	[TCA_TCINDEX_FALL_THROUGH] = { .type = NLA_U32 },
	188	[TCA_TCINDEX_CLASSID] = { .type = NLA_U32 },
	189	};
	190
bf63ac73 CW	191	static void tcindex_filter_result_init(struct tcindex_filter_result *r)
	192	{
	193	memset(r, 0, sizeof(*r));
	194	tcf_exts_init(&r->exts, TCA_TCINDEX_ACT, TCA_TCINDEX_POLICE);
	195	}
	196
1da177e4	197	static int
c1b52739 BL	198	tcindex_set_parms(struct net net, struct tcf_proto tp, unsigned long base,
	199	u32 handle, struct tcindex_data *p,
	200	struct tcindex_filter_result r, struct nlattr *tb,
	201	struct nlattr *est)
1da177e4 LT	202	{
	203	int err, balloc = 0;
	204	struct tcindex_filter_result new_filter_result, *old_r = r;
	205	struct tcindex_filter_result cr;
	206	struct tcindex_data cp;
	207	struct tcindex_filter f = NULL; / make gcc behave */
	208	struct tcf_exts e;
	209
5da57f42 WC	210	tcf_exts_init(&e, TCA_TCINDEX_ACT, TCA_TCINDEX_POLICE);
5da57f42 WC	211	err = tcf_exts_validate(net, tp, tb, est, &e);
1da177e4 LT	212	if (err < 0)
1da177e4 LT	213	return err;
10297b99	214
1da177e4	215	memcpy(&cp, p, sizeof(cp));
bf63ac73	216	tcindex_filter_result_init(&new_filter_result);
1da177e4	217
bf63ac73	218	tcindex_filter_result_init(&cr);
1da177e4	219	if (old_r)
bf63ac73	220	cr.res = r->res;
1da177e4	221
6fa8c014	222	if (tb[TCA_TCINDEX_HASH])
1587bac4	223	cp.hash = nla_get_u32(tb[TCA_TCINDEX_HASH]);
1da177e4	224
6fa8c014	225	if (tb[TCA_TCINDEX_MASK])
1587bac4	226	cp.mask = nla_get_u16(tb[TCA_TCINDEX_MASK]);
1da177e4	227
6fa8c014	228	if (tb[TCA_TCINDEX_SHIFT])
1587bac4	229	cp.shift = nla_get_u32(tb[TCA_TCINDEX_SHIFT]);
1da177e4 LT	230
	231	err = -EBUSY;
	232	/* Hash already allocated, make sure that we still meet the
	233	* requirements for the allocated hash.
	234	*/
	235	if (cp.perfect) {
	236	if (!valid_perfect_hash(&cp) \|\|
	237	cp.hash > cp.alloc_hash)
	238	goto errout;
	239	} else if (cp.h && cp.hash != cp.alloc_hash)
	240	goto errout;
	241
	242	err = -EINVAL;
6fa8c014	243	if (tb[TCA_TCINDEX_FALL_THROUGH])
1587bac4	244	cp.fall_through = nla_get_u32(tb[TCA_TCINDEX_FALL_THROUGH]);
1da177e4 LT	245
	246	if (!cp.hash) {
	247	/* Hash not specified, use perfect hash if the upper limit
	248	* of the hashing index is below the threshold.
	249	*/
	250	if ((cp.mask >> cp.shift) < PERFECT_HASH_THRESHOLD)
cc7ec456	251	cp.hash = (cp.mask >> cp.shift) + 1;
1da177e4 LT	252	else
	253	cp.hash = DEFAULT_HASH_SIZE;
	254	}
	255
	256	if (!cp.perfect && !cp.h)
	257	cp.alloc_hash = cp.hash;
	258
	259	/* Note: this could be as restrictive as if (handle & ~(mask >> shift))
	260	* but then, we'd fail handles that may become valid after some future
	261	* mask change. While this is extremely unlikely to ever matter,
	262	* the check below is safer (and also more backwards-compatible).
	263	*/
	264	if (cp.perfect \|\| valid_perfect_hash(&cp))
	265	if (handle >= cp.alloc_hash)
	266	goto errout;
	267
	268
	269	err = -ENOMEM;
	270	if (!cp.perfect && !cp.h) {
	271	if (valid_perfect_hash(&cp)) {
bf63ac73 CW	272	int i;
bf63ac73 CW	273
0da974f4	274	cp.perfect = kcalloc(cp.hash, sizeof(*r), GFP_KERNEL);
1da177e4 LT	275	if (!cp.perfect)
1da177e4 LT	276	goto errout;
bf63ac73 CW	277	for (i = 0; i < cp.hash; i++)
	278	tcf_exts_init(&cp.perfect[i].exts, TCA_TCINDEX_ACT,
	279	TCA_TCINDEX_POLICE);
1da177e4 LT	280	balloc = 1;
1da177e4 LT	281	} else {
0da974f4	282	cp.h = kcalloc(cp.hash, sizeof(f), GFP_KERNEL);
1da177e4 LT	283	if (!cp.h)
1da177e4 LT	284	goto errout;
1da177e4 LT	285	balloc = 2;
	286	}
	287	}
	288
	289	if (cp.perfect)
	290	r = cp.perfect + handle;
	291	else
	292	r = tcindex_lookup(&cp, handle) ? : &new_filter_result;
	293
	294	if (r == &new_filter_result) {
0da974f4	295	f = kzalloc(sizeof(*f), GFP_KERNEL);
1da177e4 LT	296	if (!f)
1da177e4 LT	297	goto errout_alloc;
10297b99	298	}
1da177e4	299
add93b61	300	if (tb[TCA_TCINDEX_CLASSID]) {
1587bac4	301	cr.res.classid = nla_get_u32(tb[TCA_TCINDEX_CLASSID]);
1da177e4	302	tcf_bind_filter(tp, &cr.res, base);
10297b99	303	}
1da177e4	304
bf63ac73 CW	305	if (old_r)
	306	tcf_exts_change(tp, &r->exts, &e);
	307	else
	308	tcf_exts_change(tp, &cr.exts, &e);
1da177e4 LT	309
	310	tcf_tree_lock(tp);
	311	if (old_r && old_r != r)
bf63ac73	312	tcindex_filter_result_init(old_r);
1da177e4 LT	313
1da177e4 LT	314	memcpy(p, &cp, sizeof(cp));
bf63ac73	315	r->res = cr.res;
1da177e4 LT	316
	317	if (r == &new_filter_result) {
	318	struct tcindex_filter **fp;
	319
	320	f->key = handle;
	321	f->result = new_filter_result;
	322	f->next = NULL;
	323	for (fp = p->h+(handle % p->hash); fp; fp = &(fp)->next)
	324	/* nothing */;
	325	*fp = f;
10297b99	326	}
1da177e4 LT	327	tcf_tree_unlock(tp);
	328
	329	return 0;
	330
	331	errout_alloc:
	332	if (balloc == 1)
	333	kfree(cp.perfect);
	334	else if (balloc == 2)
	335	kfree(cp.h);
	336	errout:
	337	tcf_exts_destroy(tp, &e);
	338	return err;
	339	}
	340
	341	static int
c1b52739	342	tcindex_change(struct net net, struct sk_buff in_skb,
af4c6641	343	struct tcf_proto *tp, unsigned long base, u32 handle,
add93b61	344	struct nlattr *tca, unsigned long arg)
1da177e4	345	{
add93b61 PM	346	struct nlattr *opt = tca[TCA_OPTIONS];
add93b61 PM	347	struct nlattr *tb[TCA_TCINDEX_MAX + 1];
a8701a6c	348	struct tcindex_data *p = tp->root;
1da177e4	349	struct tcindex_filter_result r = (struct tcindex_filter_result ) *arg;
cee63723	350	int err;
1da177e4	351
aa767bfe	352	pr_debug("tcindex_change(tp %p,handle 0x%08x,tca %p,arg %p),opt %p,"
1da177e4 LT	353	"p %p,r %p,*arg 0x%lx\n",
	354	tp, handle, tca, arg, opt, p, r, arg ? *arg : 0L);
	355
	356	if (!opt)
	357	return 0;
	358
6fa8c014	359	err = nla_parse_nested(tb, TCA_TCINDEX_MAX, opt, tcindex_policy);
cee63723 PM	360	if (err < 0)
cee63723 PM	361	return err;
1da177e4	362
c1b52739 BL	363	return tcindex_set_parms(net, tp, base, handle, p, r, tb,
c1b52739 BL	364	tca[TCA_RATE]);
1da177e4 LT	365	}
	366
	367
	368	static void tcindex_walk(struct tcf_proto tp, struct tcf_walker walker)
	369	{
a8701a6c	370	struct tcindex_data *p = tp->root;
aa767bfe	371	struct tcindex_filter f, next;
1da177e4 LT	372	int i;
1da177e4 LT	373
aa767bfe	374	pr_debug("tcindex_walk(tp %p,walker %p),p %p\n", tp, walker, p);
1da177e4 LT	375	if (p->perfect) {
	376	for (i = 0; i < p->hash; i++) {
	377	if (!p->perfect[i].res.class)
	378	continue;
	379	if (walker->count >= walker->skip) {
	380	if (walker->fn(tp,
	381	(unsigned long) (p->perfect+i), walker)
	382	< 0) {
	383	walker->stop = 1;
	384	return;
	385	}
	386	}
	387	walker->count++;
	388	}
	389	}
	390	if (!p->h)
	391	return;
	392	for (i = 0; i < p->hash; i++) {
	393	for (f = p->h[i]; f; f = next) {
	394	next = f->next;
	395	if (walker->count >= walker->skip) {
aa767bfe	396	if (walker->fn(tp, (unsigned long) &f->result,
1da177e4 LT	397	walker) < 0) {
	398	walker->stop = 1;
	399	return;
	400	}
	401	}
	402	walker->count++;
	403	}
	404	}
	405	}
	406
	407
	408	static int tcindex_destroy_element(struct tcf_proto *tp,
	409	unsigned long arg, struct tcf_walker *walker)
	410	{
	411	return __tcindex_delete(tp, arg, 0);
	412	}
	413
	414
	415	static void tcindex_destroy(struct tcf_proto *tp)
	416	{
a8701a6c	417	struct tcindex_data *p = tp->root;
1da177e4 LT	418	struct tcf_walker walker;
1da177e4 LT	419
aa767bfe	420	pr_debug("tcindex_destroy(tp %p),p %p\n", tp, p);
1da177e4 LT	421	walker.count = 0;
	422	walker.skip = 0;
	423	walker.fn = &tcindex_destroy_element;
aa767bfe	424	tcindex_walk(tp, &walker);
a51482bd JJ	425	kfree(p->perfect);
a51482bd JJ	426	kfree(p->h);
1da177e4 LT	427	kfree(p);
	428	tp->root = NULL;
	429	}
	430
	431
832d1d5b	432	static int tcindex_dump(struct net net, struct tcf_proto tp, unsigned long fh,
1da177e4 LT	433	struct sk_buff skb, struct tcmsg t)
1da177e4 LT	434	{
a8701a6c	435	struct tcindex_data *p = tp->root;
1da177e4	436	struct tcindex_filter_result r = (struct tcindex_filter_result ) fh;
27a884dc	437	unsigned char *b = skb_tail_pointer(skb);
4b3550ef	438	struct nlattr *nest;
1da177e4	439
aa767bfe SH	440	pr_debug("tcindex_dump(tp %p,fh 0x%lx,skb %p,t %p),p %p,r %p,b %p\n",
	441	tp, fh, skb, t, p, r, b);
	442	pr_debug("p->perfect %p p->h %p\n", p->perfect, p->h);
4b3550ef PM	443
	444	nest = nla_nest_start(skb, TCA_OPTIONS);
	445	if (nest == NULL)
	446	goto nla_put_failure;
	447
1da177e4 LT	448	if (!fh) {
1da177e4 LT	449	t->tcm_handle = ~0; /* whatever ... */
1b34ec43 DM	450	if (nla_put_u32(skb, TCA_TCINDEX_HASH, p->hash) \|\|
	451	nla_put_u16(skb, TCA_TCINDEX_MASK, p->mask) \|\|
	452	nla_put_u32(skb, TCA_TCINDEX_SHIFT, p->shift) \|\|
	453	nla_put_u32(skb, TCA_TCINDEX_FALL_THROUGH, p->fall_through))
	454	goto nla_put_failure;
4b3550ef	455	nla_nest_end(skb, nest);
1da177e4 LT	456	} else {
	457	if (p->perfect) {
	458	t->tcm_handle = r-p->perfect;
	459	} else {
	460	struct tcindex_filter *f;
	461	int i;
	462
	463	t->tcm_handle = 0;
	464	for (i = 0; !t->tcm_handle && i < p->hash; i++) {
	465	for (f = p->h[i]; !t->tcm_handle && f;
	466	f = f->next) {
	467	if (&f->result == r)
	468	t->tcm_handle = f->key;
	469	}
	470	}
	471	}
aa767bfe	472	pr_debug("handle = %d\n", t->tcm_handle);
1b34ec43 DM	473	if (r->res.class &&
	474	nla_put_u32(skb, TCA_TCINDEX_CLASSID, r->res.classid))
	475	goto nla_put_failure;
1da177e4	476
5da57f42	477	if (tcf_exts_dump(skb, &r->exts) < 0)
add93b61	478	goto nla_put_failure;
4b3550ef	479	nla_nest_end(skb, nest);
1da177e4	480
5da57f42	481	if (tcf_exts_dump_stats(skb, &r->exts) < 0)
add93b61	482	goto nla_put_failure;
1da177e4	483	}
10297b99	484
1da177e4 LT	485	return skb->len;
1da177e4 LT	486
add93b61	487	nla_put_failure:
dc5fc579	488	nlmsg_trim(skb, b);
1da177e4 LT	489	return -1;
	490	}
	491
2eb9d75c	492	static struct tcf_proto_ops cls_tcindex_ops __read_mostly = {
1da177e4 LT	493	.kind = "tcindex",
	494	.classify = tcindex_classify,
	495	.init = tcindex_init,
	496	.destroy = tcindex_destroy,
	497	.get = tcindex_get,
	498	.put = tcindex_put,
	499	.change = tcindex_change,
	500	.delete = tcindex_delete,
	501	.walk = tcindex_walk,
	502	.dump = tcindex_dump,
	503	.owner = THIS_MODULE,
	504	};
	505
	506	static int __init init_tcindex(void)
	507	{
	508	return register_tcf_proto_ops(&cls_tcindex_ops);
	509	}
	510
10297b99	511	static void __exit exit_tcindex(void)
1da177e4 LT	512	{
	513	unregister_tcf_proto_ops(&cls_tcindex_ops);
	514	}
	515
	516	module_init(init_tcindex)
	517	module_exit(exit_tcindex)
	518	MODULE_LICENSE("GPL");