[net-next-2.6.git] / net / sched / cls_u32.c

/*
 * net/sched/cls_u32.c	Ugly (or Universal) 32bit key 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:	Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
 *
 *	The filters are packed to hash tables of key nodes
 *	with a set of 32bit key/mask pairs at every node.
 *	Nodes reference next level hash tables etc.
 *
 *	This scheme is the best universal classifier I managed to
 *	invent; it is not super-fast, but it is not slow (provided you
 *	program it correctly), and general enough.  And its relative
 *	speed grows as the number of rules becomes larger.
 *
 *	It seems that it represents the best middle point between
 *	speed and manageability both by human and by machine.
 *
 *	It is especially useful for link sharing combined with QoS;
 *	pure RSVP doesn't need such a general approach and can use
 *	much simpler (and faster) schemes, sort of cls_rsvp.c.
 *
 *	JHS: We should remove the CONFIG_NET_CLS_IND from here
 *	eventually when the meta match extension is made available
 *
 *	nfmark match added by Catalin(ux aka Dino) BOIE <catab at umbrella.ro>
 */

#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 tc_u_knode
{
	struct tc_u_knode	*next;
	u32			handle;
	struct tc_u_hnode	*ht_up;
	struct tcf_exts		exts;
#ifdef CONFIG_NET_CLS_IND
	char                     indev[IFNAMSIZ];
#endif
	u8			fshift;
	struct tcf_result	res;
	struct tc_u_hnode	*ht_down;
#ifdef CONFIG_CLS_U32_PERF
	struct tc_u32_pcnt	*pf;
#endif
#ifdef CONFIG_CLS_U32_MARK
	struct tc_u32_mark	mark;
#endif
	struct tc_u32_sel	sel;
};

struct tc_u_hnode
{
	struct tc_u_hnode	*next;
	u32			handle;
	u32			prio;
	struct tc_u_common	*tp_c;
	int			refcnt;
	unsigned		divisor;
	struct tc_u_knode	*ht[1];
};

struct tc_u_common
{
	struct tc_u_hnode	*hlist;
	struct Qdisc		*q;
	int			refcnt;
	u32			hgenerator;
};

static const struct tcf_ext_map u32_ext_map = {
	.action = TCA_U32_ACT,
	.police = TCA_U32_POLICE
};

static __inline__ unsigned u32_hash_fold(__be32 key, struct tc_u32_sel *sel, u8 fshift)
{
	unsigned h = ntohl(key & sel->hmask)>>fshift;

	return h;
}

static int u32_classify(struct sk_buff *skb, struct tcf_proto *tp, struct tcf_result *res)
{
	struct {
		struct tc_u_knode *knode;
		unsigned int	  off;
	} stack[TC_U32_MAXDEPTH];

	struct tc_u_hnode *ht = (struct tc_u_hnode*)tp->root;
	unsigned int off = skb_network_offset(skb);
	struct tc_u_knode *n;
	int sdepth = 0;
	int off2 = 0;
	int sel = 0;
#ifdef CONFIG_CLS_U32_PERF
	int j;
#endif
	int i, r;

next_ht:
	n = ht->ht[sel];

next_knode:
	if (n) {
		struct tc_u32_key *key = n->sel.keys;

#ifdef CONFIG_CLS_U32_PERF
		n->pf->rcnt +=1;
		j = 0;
#endif

#ifdef CONFIG_CLS_U32_MARK
		if ((skb->mark & n->mark.mask) != n->mark.val) {
			n = n->next;
			goto next_knode;
		} else {
			n->mark.success++;
		}
#endif

		for (i = n->sel.nkeys; i>0; i--, key++) {
			int toff = off + key->off + (off2 & key->offmask);
			__be32 *data, _data;

			if (skb_headroom(skb) + toff > INT_MAX)
				goto out;

			data = skb_header_pointer(skb, toff, 4, &_data);
			if (!data)
				goto out;
			if ((*data ^ key->val) & key->mask) {
				n = n->next;
				goto next_knode;
			}
#ifdef CONFIG_CLS_U32_PERF
			n->pf->kcnts[j] +=1;
			j++;
#endif
		}
		if (n->ht_down == NULL) {
check_terminal:
			if (n->sel.flags&TC_U32_TERMINAL) {

				*res = n->res;
#ifdef CONFIG_NET_CLS_IND
				if (!tcf_match_indev(skb, n->indev)) {
					n = n->next;
					goto next_knode;
				}
#endif
#ifdef CONFIG_CLS_U32_PERF
				n->pf->rhit +=1;
#endif
				r = tcf_exts_exec(skb, &n->exts, res);
				if (r < 0) {
					n = n->next;
					goto next_knode;
				}

				return r;
			}
			n = n->next;
			goto next_knode;
		}

		/* PUSH */
		if (sdepth >= TC_U32_MAXDEPTH)
			goto deadloop;
		stack[sdepth].knode = n;
		stack[sdepth].off = off;
		sdepth++;

		ht = n->ht_down;
		sel = 0;
		if (ht->divisor) {
			__be32 *data, _data;

			data = skb_header_pointer(skb, off + n->sel.hoff, 4,
						  &_data);
			if (!data)
				goto out;
			sel = ht->divisor & u32_hash_fold(*data, &n->sel,
							  n->fshift);
		}
		if (!(n->sel.flags&(TC_U32_VAROFFSET|TC_U32_OFFSET|TC_U32_EAT)))
			goto next_ht;

		if (n->sel.flags&(TC_U32_OFFSET|TC_U32_VAROFFSET)) {
			off2 = n->sel.off + 3;
			if (n->sel.flags & TC_U32_VAROFFSET) {
				__be16 *data, _data;

				data = skb_header_pointer(skb,
							  off + n->sel.offoff,
							  2, &_data);
				if (!data)
					goto out;
				off2 += ntohs(n->sel.offmask & *data) >>
					n->sel.offshift;
			}
			off2 &= ~3;
		}
		if (n->sel.flags&TC_U32_EAT) {
			off += off2;
			off2 = 0;
		}

		if (off < skb->len)
			goto next_ht;
	}

	/* POP */
	if (sdepth--) {
		n = stack[sdepth].knode;
		ht = n->ht_up;
		off = stack[sdepth].off;
		goto check_terminal;
	}
out:
	return -1;

deadloop:
	if (net_ratelimit())
		printk(KERN_WARNING "cls_u32: dead loop\n");
	return -1;
}

static __inline__ struct tc_u_hnode *
u32_lookup_ht(struct tc_u_common *tp_c, u32 handle)
{
	struct tc_u_hnode *ht;

	for (ht = tp_c->hlist; ht; ht = ht->next)
		if (ht->handle == handle)
			break;

	return ht;
}

static __inline__ struct tc_u_knode *
u32_lookup_key(struct tc_u_hnode *ht, u32 handle)
{
	unsigned sel;
	struct tc_u_knode *n = NULL;

	sel = TC_U32_HASH(handle);
	if (sel > ht->divisor)
		goto out;

	for (n = ht->ht[sel]; n; n = n->next)
		if (n->handle == handle)
			break;
out:
	return n;
}


static unsigned long u32_get(struct tcf_proto *tp, u32 handle)
{
	struct tc_u_hnode *ht;
	struct tc_u_common *tp_c = tp->data;

	if (TC_U32_HTID(handle) == TC_U32_ROOT)
		ht = tp->root;
	else
		ht = u32_lookup_ht(tp_c, TC_U32_HTID(handle));

	if (!ht)
		return 0;

	if (TC_U32_KEY(handle) == 0)
		return (unsigned long)ht;

	return (unsigned long)u32_lookup_key(ht, handle);
}

static void u32_put(struct tcf_proto *tp, unsigned long f)
{
}

static u32 gen_new_htid(struct tc_u_common *tp_c)
{
	int i = 0x800;

	do {
		if (++tp_c->hgenerator == 0x7FF)
			tp_c->hgenerator = 1;
	} while (--i>0 && u32_lookup_ht(tp_c, (tp_c->hgenerator|0x800)<<20));

	return i > 0 ? (tp_c->hgenerator|0x800)<<20 : 0;
}

static int u32_init(struct tcf_proto *tp)
{
	struct tc_u_hnode *root_ht;
	struct tc_u_common *tp_c;

	tp_c = tp->q->u32_node;

	root_ht = kzalloc(sizeof(*root_ht), GFP_KERNEL);
	if (root_ht == NULL)
		return -ENOBUFS;

	root_ht->divisor = 0;
	root_ht->refcnt++;
	root_ht->handle = tp_c ? gen_new_htid(tp_c) : 0x80000000;
	root_ht->prio = tp->prio;

	if (tp_c == NULL) {
		tp_c = kzalloc(sizeof(*tp_c), GFP_KERNEL);
		if (tp_c == NULL) {
			kfree(root_ht);
			return -ENOBUFS;
		}
		tp_c->q = tp->q;
		tp->q->u32_node = tp_c;
	}

	tp_c->refcnt++;
	root_ht->next = tp_c->hlist;
	tp_c->hlist = root_ht;
	root_ht->tp_c = tp_c;

	tp->root = root_ht;
	tp->data = tp_c;
	return 0;
}

static int u32_destroy_key(struct tcf_proto *tp, struct tc_u_knode *n)
{
	tcf_unbind_filter(tp, &n->res);
	tcf_exts_destroy(tp, &n->exts);
	if (n->ht_down)
		n->ht_down->refcnt--;
#ifdef CONFIG_CLS_U32_PERF
	kfree(n->pf);
#endif
	kfree(n);
	return 0;
}

static int u32_delete_key(struct tcf_proto *tp, struct tc_u_knode* key)
{
	struct tc_u_knode **kp;
	struct tc_u_hnode *ht = key->ht_up;

	if (ht) {
		for (kp = &ht->ht[TC_U32_HASH(key->handle)]; *kp; kp = &(*kp)->next) {
			if (*kp == key) {
				tcf_tree_lock(tp);
				*kp = key->next;
				tcf_tree_unlock(tp);

				u32_destroy_key(tp, key);
				return 0;
			}
		}
	}
	WARN_ON(1);
	return 0;
}

static void u32_clear_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht)
{
	struct tc_u_knode *n;
	unsigned h;

	for (h=0; h<=ht->divisor; h++) {
		while ((n = ht->ht[h]) != NULL) {
			ht->ht[h] = n->next;

			u32_destroy_key(tp, n);
		}
	}
}

static int u32_destroy_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht)
{
	struct tc_u_common *tp_c = tp->data;
	struct tc_u_hnode **hn;

	WARN_ON(ht->refcnt);

	u32_clear_hnode(tp, ht);

	for (hn = &tp_c->hlist; *hn; hn = &(*hn)->next) {
		if (*hn == ht) {
			*hn = ht->next;
			kfree(ht);
			return 0;
		}
	}

	WARN_ON(1);
	return -ENOENT;
}

static void u32_destroy(struct tcf_proto *tp)
{
	struct tc_u_common *tp_c = tp->data;
	struct tc_u_hnode *root_ht = tp->root;

	WARN_ON(root_ht == NULL);

	if (root_ht && --root_ht->refcnt == 0)
		u32_destroy_hnode(tp, root_ht);

	if (--tp_c->refcnt == 0) {
		struct tc_u_hnode *ht;

		tp->q->u32_node = NULL;

		for (ht = tp_c->hlist; ht; ht = ht->next) {
			ht->refcnt--;
			u32_clear_hnode(tp, ht);
		}

		while ((ht = tp_c->hlist) != NULL) {
			tp_c->hlist = ht->next;

			WARN_ON(ht->refcnt != 0);

			kfree(ht);
		}

		kfree(tp_c);
	}

	tp->data = NULL;
}

static int u32_delete(struct tcf_proto *tp, unsigned long arg)
{
	struct tc_u_hnode *ht = (struct tc_u_hnode*)arg;

	if (ht == NULL)
		return 0;

	if (TC_U32_KEY(ht->handle))
		return u32_delete_key(tp, (struct tc_u_knode*)ht);

	if (tp->root == ht)
		return -EINVAL;

	if (ht->refcnt == 1) {
		ht->refcnt--;
		u32_destroy_hnode(tp, ht);
	} else {
		return -EBUSY;
	}

	return 0;
}

static u32 gen_new_kid(struct tc_u_hnode *ht, u32 handle)
{
	struct tc_u_knode *n;
	unsigned i = 0x7FF;

	for (n=ht->ht[TC_U32_HASH(handle)]; n; n = n->next)
		if (i < TC_U32_NODE(n->handle))
			i = TC_U32_NODE(n->handle);
	i++;

	return handle|(i>0xFFF ? 0xFFF : i);
}

static const struct nla_policy u32_policy[TCA_U32_MAX + 1] = {
	[TCA_U32_CLASSID]	= { .type = NLA_U32 },
	[TCA_U32_HASH]		= { .type = NLA_U32 },
	[TCA_U32_LINK]		= { .type = NLA_U32 },
	[TCA_U32_DIVISOR]	= { .type = NLA_U32 },
	[TCA_U32_SEL]		= { .len = sizeof(struct tc_u32_sel) },
	[TCA_U32_INDEV]		= { .type = NLA_STRING, .len = IFNAMSIZ },
	[TCA_U32_MARK]		= { .len = sizeof(struct tc_u32_mark) },
};

static int u32_set_parms(struct tcf_proto *tp, unsigned long base,
			 struct tc_u_hnode *ht,
			 struct tc_u_knode *n, struct nlattr **tb,
			 struct nlattr *est)
{
	int err;
	struct tcf_exts e;

	err = tcf_exts_validate(tp, tb, est, &e, &u32_ext_map);
	if (err < 0)
		return err;

	err = -EINVAL;
	if (tb[TCA_U32_LINK]) {
		u32 handle = nla_get_u32(tb[TCA_U32_LINK]);
		struct tc_u_hnode *ht_down = NULL, *ht_old;

		if (TC_U32_KEY(handle))
			goto errout;

		if (handle) {
			ht_down = u32_lookup_ht(ht->tp_c, handle);

			if (ht_down == NULL)
				goto errout;
			ht_down->refcnt++;
		}

		tcf_tree_lock(tp);
		ht_old = n->ht_down;
		n->ht_down = ht_down;
		tcf_tree_unlock(tp);

		if (ht_old)
			ht_old->refcnt--;
	}
	if (tb[TCA_U32_CLASSID]) {
		n->res.classid = nla_get_u32(tb[TCA_U32_CLASSID]);
		tcf_bind_filter(tp, &n->res, base);
	}

#ifdef CONFIG_NET_CLS_IND
	if (tb[TCA_U32_INDEV]) {
		err = tcf_change_indev(tp, n->indev, tb[TCA_U32_INDEV]);
		if (err < 0)
			goto errout;
	}
#endif
	tcf_exts_change(tp, &n->exts, &e);

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

static int u32_change(struct tcf_proto *tp, unsigned long base, u32 handle,
		      struct nlattr **tca,
		      unsigned long *arg)
{
	struct tc_u_common *tp_c = tp->data;
	struct tc_u_hnode *ht;
	struct tc_u_knode *n;
	struct tc_u32_sel *s;
	struct nlattr *opt = tca[TCA_OPTIONS];
	struct nlattr *tb[TCA_U32_MAX + 1];
	u32 htid;
	int err;

	if (opt == NULL)
		return handle ? -EINVAL : 0;

	err = nla_parse_nested(tb, TCA_U32_MAX, opt, u32_policy);
	if (err < 0)
		return err;

	if ((n = (struct tc_u_knode*)*arg) != NULL) {
		if (TC_U32_KEY(n->handle) == 0)
			return -EINVAL;

		return u32_set_parms(tp, base, n->ht_up, n, tb, tca[TCA_RATE]);
	}

	if (tb[TCA_U32_DIVISOR]) {
		unsigned divisor = nla_get_u32(tb[TCA_U32_DIVISOR]);

		if (--divisor > 0x100)
			return -EINVAL;
		if (TC_U32_KEY(handle))
			return -EINVAL;
		if (handle == 0) {
			handle = gen_new_htid(tp->data);
			if (handle == 0)
				return -ENOMEM;
		}
		ht = kzalloc(sizeof(*ht) + divisor*sizeof(void*), GFP_KERNEL);
		if (ht == NULL)
			return -ENOBUFS;
		ht->tp_c = tp_c;
		ht->refcnt = 1;
		ht->divisor = divisor;
		ht->handle = handle;
		ht->prio = tp->prio;
		ht->next = tp_c->hlist;
		tp_c->hlist = ht;
		*arg = (unsigned long)ht;
		return 0;
	}

	if (tb[TCA_U32_HASH]) {
		htid = nla_get_u32(tb[TCA_U32_HASH]);
		if (TC_U32_HTID(htid) == TC_U32_ROOT) {
			ht = tp->root;
			htid = ht->handle;
		} else {
			ht = u32_lookup_ht(tp->data, TC_U32_HTID(htid));
			if (ht == NULL)
				return -EINVAL;
		}
	} else {
		ht = tp->root;
		htid = ht->handle;
	}

	if (ht->divisor < TC_U32_HASH(htid))
		return -EINVAL;

	if (handle) {
		if (TC_U32_HTID(handle) && TC_U32_HTID(handle^htid))
			return -EINVAL;
		handle = htid | TC_U32_NODE(handle);
	} else
		handle = gen_new_kid(ht, htid);

	if (tb[TCA_U32_SEL] == NULL)
		return -EINVAL;

	s = nla_data(tb[TCA_U32_SEL]);

	n = kzalloc(sizeof(*n) + s->nkeys*sizeof(struct tc_u32_key), GFP_KERNEL);
	if (n == NULL)
		return -ENOBUFS;

#ifdef CONFIG_CLS_U32_PERF
	n->pf = kzalloc(sizeof(struct tc_u32_pcnt) + s->nkeys*sizeof(u64), GFP_KERNEL);
	if (n->pf == NULL) {
		kfree(n);
		return -ENOBUFS;
	}
#endif

	memcpy(&n->sel, s, sizeof(*s) + s->nkeys*sizeof(struct tc_u32_key));
	n->ht_up = ht;
	n->handle = handle;
	n->fshift = s->hmask ? ffs(ntohl(s->hmask)) - 1 : 0;

#ifdef CONFIG_CLS_U32_MARK
	if (tb[TCA_U32_MARK]) {
		struct tc_u32_mark *mark;

		mark = nla_data(tb[TCA_U32_MARK]);
		memcpy(&n->mark, mark, sizeof(struct tc_u32_mark));
		n->mark.success = 0;
	}
#endif

	err = u32_set_parms(tp, base, ht, n, tb, tca[TCA_RATE]);
	if (err == 0) {
		struct tc_u_knode **ins;
		for (ins = &ht->ht[TC_U32_HASH(handle)]; *ins; ins = &(*ins)->next)
			if (TC_U32_NODE(handle) < TC_U32_NODE((*ins)->handle))
				break;

		n->next = *ins;
		tcf_tree_lock(tp);
		*ins = n;
		tcf_tree_unlock(tp);

		*arg = (unsigned long)n;
		return 0;
	}
#ifdef CONFIG_CLS_U32_PERF
	kfree(n->pf);
#endif
	kfree(n);
	return err;
}

static void u32_walk(struct tcf_proto *tp, struct tcf_walker *arg)
{
	struct tc_u_common *tp_c = tp->data;
	struct tc_u_hnode *ht;
	struct tc_u_knode *n;
	unsigned h;

	if (arg->stop)
		return;

	for (ht = tp_c->hlist; ht; ht = ht->next) {
		if (ht->prio != tp->prio)
			continue;
		if (arg->count >= arg->skip) {
			if (arg->fn(tp, (unsigned long)ht, arg) < 0) {
				arg->stop = 1;
				return;
			}
		}
		arg->count++;
		for (h = 0; h <= ht->divisor; h++) {
			for (n = ht->ht[h]; n; n = n->next) {
				if (arg->count < arg->skip) {
					arg->count++;
					continue;
				}
				if (arg->fn(tp, (unsigned long)n, arg) < 0) {
					arg->stop = 1;
					return;
				}
				arg->count++;
			}
		}
	}
}

static int u32_dump(struct tcf_proto *tp, unsigned long fh,
		     struct sk_buff *skb, struct tcmsg *t)
{
	struct tc_u_knode *n = (struct tc_u_knode*)fh;
	struct nlattr *nest;

	if (n == NULL)
		return skb->len;

	t->tcm_handle = n->handle;

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

	if (TC_U32_KEY(n->handle) == 0) {
		struct tc_u_hnode *ht = (struct tc_u_hnode*)fh;
		u32 divisor = ht->divisor+1;
		NLA_PUT_U32(skb, TCA_U32_DIVISOR, divisor);
	} else {
		NLA_PUT(skb, TCA_U32_SEL,
			sizeof(n->sel) + n->sel.nkeys*sizeof(struct tc_u32_key),
			&n->sel);
		if (n->ht_up) {
			u32 htid = n->handle & 0xFFFFF000;
			NLA_PUT_U32(skb, TCA_U32_HASH, htid);
		}
		if (n->res.classid)
			NLA_PUT_U32(skb, TCA_U32_CLASSID, n->res.classid);
		if (n->ht_down)
			NLA_PUT_U32(skb, TCA_U32_LINK, n->ht_down->handle);

#ifdef CONFIG_CLS_U32_MARK
		if (n->mark.val || n->mark.mask)
			NLA_PUT(skb, TCA_U32_MARK, sizeof(n->mark), &n->mark);
#endif

		if (tcf_exts_dump(skb, &n->exts, &u32_ext_map) < 0)
			goto nla_put_failure;

#ifdef CONFIG_NET_CLS_IND
		if(strlen(n->indev))
			NLA_PUT_STRING(skb, TCA_U32_INDEV, n->indev);
#endif
#ifdef CONFIG_CLS_U32_PERF
		NLA_PUT(skb, TCA_U32_PCNT,
		sizeof(struct tc_u32_pcnt) + n->sel.nkeys*sizeof(u64),
			n->pf);
#endif
	}

	nla_nest_end(skb, nest);

	if (TC_U32_KEY(n->handle))
		if (tcf_exts_dump_stats(skb, &n->exts, &u32_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_u32_ops __read_mostly = {
	.kind		=	"u32",
	.classify	=	u32_classify,
	.init		=	u32_init,
	.destroy	=	u32_destroy,
	.get		=	u32_get,
	.put		=	u32_put,
	.change		=	u32_change,
	.delete		=	u32_delete,
	.walk		=	u32_walk,
	.dump		=	u32_dump,
	.owner		=	THIS_MODULE,
};

static int __init init_u32(void)
{
	pr_info("u32 classifier\n");
#ifdef CONFIG_CLS_U32_PERF
	pr_info("    Performance counters on\n");
#endif
#ifdef CONFIG_NET_CLS_IND
	pr_info("    input device check on\n");
#endif
#ifdef CONFIG_NET_CLS_ACT
	pr_info("    Actions configured\n");
#endif
	return register_tcf_proto_ops(&cls_u32_ops);
}

static void __exit exit_u32(void)
{
	unregister_tcf_proto_ops(&cls_u32_ops);
}

module_init(init_u32)
module_exit(exit_u32)
MODULE_LICENSE("GPL");
Commit	Line	Data
1da177e4 LT	1	/*
	2	* net/sched/cls_u32.c Ugly (or Universal) 32bit key 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: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
	10	*
	11	* The filters are packed to hash tables of key nodes
	12	* with a set of 32bit key/mask pairs at every node.
	13	* Nodes reference next level hash tables etc.
	14	*
	15	* This scheme is the best universal classifier I managed to
	16	* invent; it is not super-fast, but it is not slow (provided you
	17	* program it correctly), and general enough. And its relative
	18	* speed grows as the number of rules becomes larger.
	19	*
	20	* It seems that it represents the best middle point between
	21	* speed and manageability both by human and by machine.
	22	*
	23	* It is especially useful for link sharing combined with QoS;
	24	* pure RSVP doesn't need such a general approach and can use
	25	* much simpler (and faster) schemes, sort of cls_rsvp.c.
	26	*
	27	* JHS: We should remove the CONFIG_NET_CLS_IND from here
	28	* eventually when the meta match extension is made available
	29	*
	30	* nfmark match added by Catalin(ux aka Dino) BOIE <catab at umbrella.ro>
	31	*/
	32
1da177e4	33	#include <linux/module.h>
5a0e3ad6	34	#include <linux/slab.h>
1da177e4 LT	35	#include <linux/types.h>
1da177e4 LT	36	#include <linux/kernel.h>
1da177e4	37	#include <linux/string.h>
1da177e4	38	#include <linux/errno.h>
1da177e4	39	#include <linux/rtnetlink.h>
1da177e4	40	#include <linux/skbuff.h>
0ba48053	41	#include <net/netlink.h>
1da177e4 LT	42	#include <net/act_api.h>
	43	#include <net/pkt_cls.h>
	44
	45	struct tc_u_knode
	46	{
	47	struct tc_u_knode *next;
	48	u32 handle;
	49	struct tc_u_hnode *ht_up;
	50	struct tcf_exts exts;
	51	#ifdef CONFIG_NET_CLS_IND
	52	char indev[IFNAMSIZ];
	53	#endif
	54	u8 fshift;
	55	struct tcf_result res;
	56	struct tc_u_hnode *ht_down;
	57	#ifdef CONFIG_CLS_U32_PERF
	58	struct tc_u32_pcnt *pf;
	59	#endif
	60	#ifdef CONFIG_CLS_U32_MARK
	61	struct tc_u32_mark mark;
	62	#endif
	63	struct tc_u32_sel sel;
	64	};
	65
	66	struct tc_u_hnode
	67	{
	68	struct tc_u_hnode *next;
	69	u32 handle;
	70	u32 prio;
	71	struct tc_u_common *tp_c;
	72	int refcnt;
	73	unsigned divisor;
	74	struct tc_u_knode *ht[1];
	75	};
	76
	77	struct tc_u_common
	78	{
1da177e4 LT	79	struct tc_u_hnode *hlist;
	80	struct Qdisc *q;
	81	int refcnt;
	82	u32 hgenerator;
	83	};
	84
5239008b	85	static const struct tcf_ext_map u32_ext_map = {
1da177e4 LT	86	.action = TCA_U32_ACT,
	87	.police = TCA_U32_POLICE
	88	};
	89
0382b9c3	90	static __inline__ unsigned u32_hash_fold(__be32 key, struct tc_u32_sel *sel, u8 fshift)
1da177e4	91	{
543821c6	92	unsigned h = ntohl(key & sel->hmask)>>fshift;
1da177e4 LT	93
	94	return h;
	95	}
	96
	97	static int u32_classify(struct sk_buff skb, struct tcf_proto tp, struct tcf_result *res)
	98	{
	99	struct {
	100	struct tc_u_knode *knode;
fbc2e7d9	101	unsigned int off;
1da177e4 LT	102	} stack[TC_U32_MAXDEPTH];
	103
	104	struct tc_u_hnode ht = (struct tc_u_hnode)tp->root;
fbc2e7d9	105	unsigned int off = skb_network_offset(skb);
1da177e4 LT	106	struct tc_u_knode *n;
	107	int sdepth = 0;
	108	int off2 = 0;
	109	int sel = 0;
	110	#ifdef CONFIG_CLS_U32_PERF
	111	int j;
	112	#endif
	113	int i, r;
	114
	115	next_ht:
	116	n = ht->ht[sel];
	117
	118	next_knode:
	119	if (n) {
	120	struct tc_u32_key *key = n->sel.keys;
	121
	122	#ifdef CONFIG_CLS_U32_PERF
	123	n->pf->rcnt +=1;
	124	j = 0;
	125	#endif
	126
	127	#ifdef CONFIG_CLS_U32_MARK
82e91ffe	128	if ((skb->mark & n->mark.mask) != n->mark.val) {
1da177e4 LT	129	n = n->next;
	130	goto next_knode;
	131	} else {
	132	n->mark.success++;
	133	}
	134	#endif
	135
	136	for (i = n->sel.nkeys; i>0; i--, key++) {
66d50d25	137	int toff = off + key->off + (off2 & key->offmask);
fbc2e7d9 CG	138	__be32 *data, _data;
fbc2e7d9 CG	139
4e18b3ed	140	if (skb_headroom(skb) + toff > INT_MAX)
66d50d25	141	goto out;
66d50d25	142
fbc2e7d9 CG	143	data = skb_header_pointer(skb, toff, 4, &_data);
	144	if (!data)
	145	goto out;
	146	if ((*data ^ key->val) & key->mask) {
1da177e4 LT	147	n = n->next;
	148	goto next_knode;
	149	}
	150	#ifdef CONFIG_CLS_U32_PERF
	151	n->pf->kcnts[j] +=1;
	152	j++;
	153	#endif
	154	}
	155	if (n->ht_down == NULL) {
	156	check_terminal:
	157	if (n->sel.flags&TC_U32_TERMINAL) {
	158
	159	*res = n->res;
	160	#ifdef CONFIG_NET_CLS_IND
	161	if (!tcf_match_indev(skb, n->indev)) {
	162	n = n->next;
	163	goto next_knode;
	164	}
	165	#endif
	166	#ifdef CONFIG_CLS_U32_PERF
	167	n->pf->rhit +=1;
	168	#endif
	169	r = tcf_exts_exec(skb, &n->exts, res);
	170	if (r < 0) {
	171	n = n->next;
	172	goto next_knode;
	173	}
	174
	175	return r;
	176	}
	177	n = n->next;
	178	goto next_knode;
	179	}
	180
	181	/* PUSH */
	182	if (sdepth >= TC_U32_MAXDEPTH)
	183	goto deadloop;
	184	stack[sdepth].knode = n;
fbc2e7d9	185	stack[sdepth].off = off;
1da177e4 LT	186	sdepth++;
	187
	188	ht = n->ht_down;
	189	sel = 0;
fbc2e7d9 CG	190	if (ht->divisor) {
	191	__be32 *data, _data;
	192
	193	data = skb_header_pointer(skb, off + n->sel.hoff, 4,
	194	&_data);
	195	if (!data)
	196	goto out;
	197	sel = ht->divisor & u32_hash_fold(*data, &n->sel,
	198	n->fshift);
	199	}
1da177e4 LT	200	if (!(n->sel.flags&(TC_U32_VAROFFSET\|TC_U32_OFFSET\|TC_U32_EAT)))
	201	goto next_ht;
	202
	203	if (n->sel.flags&(TC_U32_OFFSET\|TC_U32_VAROFFSET)) {
	204	off2 = n->sel.off + 3;
fbc2e7d9 CG	205	if (n->sel.flags & TC_U32_VAROFFSET) {
	206	__be16 *data, _data;
	207
	208	data = skb_header_pointer(skb,
	209	off + n->sel.offoff,
	210	2, &_data);
	211	if (!data)
	212	goto out;
	213	off2 += ntohs(n->sel.offmask & *data) >>
	214	n->sel.offshift;
	215	}
1da177e4 LT	216	off2 &= ~3;
	217	}
	218	if (n->sel.flags&TC_U32_EAT) {
fbc2e7d9	219	off += off2;
1da177e4 LT	220	off2 = 0;
	221	}
	222
fbc2e7d9	223	if (off < skb->len)
1da177e4 LT	224	goto next_ht;
	225	}
	226
	227	/* POP */
	228	if (sdepth--) {
	229	n = stack[sdepth].knode;
	230	ht = n->ht_up;
fbc2e7d9	231	off = stack[sdepth].off;
1da177e4 LT	232	goto check_terminal;
1da177e4 LT	233	}
fbc2e7d9	234	out:
1da177e4 LT	235	return -1;
	236
	237	deadloop:
	238	if (net_ratelimit())
6ff9c364	239	printk(KERN_WARNING "cls_u32: dead loop\n");
1da177e4 LT	240	return -1;
	241	}
	242
	243	static __inline__ struct tc_u_hnode *
	244	u32_lookup_ht(struct tc_u_common *tp_c, u32 handle)
	245	{
	246	struct tc_u_hnode *ht;
	247
	248	for (ht = tp_c->hlist; ht; ht = ht->next)
	249	if (ht->handle == handle)
	250	break;
	251
	252	return ht;
	253	}
	254
	255	static __inline__ struct tc_u_knode *
	256	u32_lookup_key(struct tc_u_hnode *ht, u32 handle)
	257	{
	258	unsigned sel;
	259	struct tc_u_knode *n = NULL;
	260
	261	sel = TC_U32_HASH(handle);
	262	if (sel > ht->divisor)
	263	goto out;
	264
	265	for (n = ht->ht[sel]; n; n = n->next)
	266	if (n->handle == handle)
	267	break;
	268	out:
	269	return n;
	270	}
	271
	272
	273	static unsigned long u32_get(struct tcf_proto *tp, u32 handle)
	274	{
	275	struct tc_u_hnode *ht;
	276	struct tc_u_common *tp_c = tp->data;
	277
	278	if (TC_U32_HTID(handle) == TC_U32_ROOT)
	279	ht = tp->root;
	280	else
	281	ht = u32_lookup_ht(tp_c, TC_U32_HTID(handle));
	282
	283	if (!ht)
	284	return 0;
	285
	286	if (TC_U32_KEY(handle) == 0)
	287	return (unsigned long)ht;
	288
	289	return (unsigned long)u32_lookup_key(ht, handle);
	290	}
	291
	292	static void u32_put(struct tcf_proto *tp, unsigned long f)
	293	{
	294	}
	295
	296	static u32 gen_new_htid(struct tc_u_common *tp_c)
	297	{
	298	int i = 0x800;
	299
	300	do {
	301	if (++tp_c->hgenerator == 0x7FF)
	302	tp_c->hgenerator = 1;
	303	} while (--i>0 && u32_lookup_ht(tp_c, (tp_c->hgenerator\|0x800)<<20));
304
305	return i > 0 ? (tp_c->hgenerator\|0x800)<<20 : 0;
306	}
307
308	static int u32_init(struct tcf_proto *tp)
309	{
310	struct tc_u_hnode *root_ht;
311	struct tc_u_common *tp_c;
312
72b25a91	313	tp_c = tp->q->u32_node;
1da177e4	314
0da974f4	315	root_ht = kzalloc(sizeof(*root_ht), GFP_KERNEL);
1da177e4 LT	316	if (root_ht == NULL)
	317	return -ENOBUFS;
	318
1da177e4 LT	319	root_ht->divisor = 0;
	320	root_ht->refcnt++;
	321	root_ht->handle = tp_c ? gen_new_htid(tp_c) : 0x80000000;
	322	root_ht->prio = tp->prio;
	323
	324	if (tp_c == NULL) {
0da974f4	325	tp_c = kzalloc(sizeof(*tp_c), GFP_KERNEL);
1da177e4 LT	326	if (tp_c == NULL) {
	327	kfree(root_ht);
	328	return -ENOBUFS;
	329	}
1da177e4	330	tp_c->q = tp->q;
72b25a91	331	tp->q->u32_node = tp_c;
1da177e4 LT	332	}
	333
	334	tp_c->refcnt++;
	335	root_ht->next = tp_c->hlist;
	336	tp_c->hlist = root_ht;
	337	root_ht->tp_c = tp_c;
	338
	339	tp->root = root_ht;
	340	tp->data = tp_c;
	341	return 0;
	342	}
	343
	344	static int u32_destroy_key(struct tcf_proto tp, struct tc_u_knode n)
	345	{
	346	tcf_unbind_filter(tp, &n->res);
	347	tcf_exts_destroy(tp, &n->exts);
	348	if (n->ht_down)
	349	n->ht_down->refcnt--;
	350	#ifdef CONFIG_CLS_U32_PERF
1ae39a43	351	kfree(n->pf);
1da177e4 LT	352	#endif
	353	kfree(n);
	354	return 0;
	355	}
	356
	357	static int u32_delete_key(struct tcf_proto tp, struct tc_u_knode key)
	358	{
	359	struct tc_u_knode **kp;
	360	struct tc_u_hnode *ht = key->ht_up;
	361
	362	if (ht) {
	363	for (kp = &ht->ht[TC_U32_HASH(key->handle)]; kp; kp = &(kp)->next) {
	364	if (*kp == key) {
	365	tcf_tree_lock(tp);
	366	*kp = key->next;
	367	tcf_tree_unlock(tp);
	368
	369	u32_destroy_key(tp, key);
	370	return 0;
	371	}
	372	}
	373	}
547b792c	374	WARN_ON(1);
1da177e4 LT	375	return 0;
	376	}
	377
	378	static void u32_clear_hnode(struct tcf_proto tp, struct tc_u_hnode ht)
	379	{
	380	struct tc_u_knode *n;
	381	unsigned h;
	382
	383	for (h=0; h<=ht->divisor; h++) {
	384	while ((n = ht->ht[h]) != NULL) {
	385	ht->ht[h] = n->next;
	386
	387	u32_destroy_key(tp, n);
	388	}
	389	}
	390	}
	391
	392	static int u32_destroy_hnode(struct tcf_proto tp, struct tc_u_hnode ht)
	393	{
	394	struct tc_u_common *tp_c = tp->data;
	395	struct tc_u_hnode **hn;
	396
547b792c	397	WARN_ON(ht->refcnt);
1da177e4 LT	398
	399	u32_clear_hnode(tp, ht);
	400
	401	for (hn = &tp_c->hlist; hn; hn = &(hn)->next) {
	402	if (*hn == ht) {
	403	*hn = ht->next;
	404	kfree(ht);
	405	return 0;
	406	}
	407	}
	408
547b792c	409	WARN_ON(1);
1da177e4 LT	410	return -ENOENT;
	411	}
	412
	413	static void u32_destroy(struct tcf_proto *tp)
	414	{
	415	struct tc_u_common *tp_c = tp->data;
47a1a1d4	416	struct tc_u_hnode *root_ht = tp->root;
1da177e4	417
547b792c	418	WARN_ON(root_ht == NULL);
1da177e4 LT	419
	420	if (root_ht && --root_ht->refcnt == 0)
	421	u32_destroy_hnode(tp, root_ht);
	422
	423	if (--tp_c->refcnt == 0) {
	424	struct tc_u_hnode *ht;
1da177e4	425
72b25a91	426	tp->q->u32_node = NULL;
1da177e4	427
e56cfad1 JP	428	for (ht = tp_c->hlist; ht; ht = ht->next) {
e56cfad1 JP	429	ht->refcnt--;
1da177e4	430	u32_clear_hnode(tp, ht);
e56cfad1	431	}
1da177e4 LT	432
	433	while ((ht = tp_c->hlist) != NULL) {
	434	tp_c->hlist = ht->next;
	435
547b792c	436	WARN_ON(ht->refcnt != 0);
1da177e4 LT	437
1da177e4 LT	438	kfree(ht);
3ff50b79	439	}
1da177e4 LT	440
	441	kfree(tp_c);
	442	}
	443
	444	tp->data = NULL;
	445	}
	446
	447	static int u32_delete(struct tcf_proto *tp, unsigned long arg)
	448	{
	449	struct tc_u_hnode ht = (struct tc_u_hnode)arg;
	450
	451	if (ht == NULL)
	452	return 0;
	453
	454	if (TC_U32_KEY(ht->handle))
	455	return u32_delete_key(tp, (struct tc_u_knode*)ht);
	456
	457	if (tp->root == ht)
	458	return -EINVAL;
	459
e56cfad1 JP	460	if (ht->refcnt == 1) {
e56cfad1 JP	461	ht->refcnt--;
1da177e4	462	u32_destroy_hnode(tp, ht);
e56cfad1 JP	463	} else {
	464	return -EBUSY;
	465	}
1da177e4 LT	466
	467	return 0;
	468	}
	469
	470	static u32 gen_new_kid(struct tc_u_hnode *ht, u32 handle)
	471	{
	472	struct tc_u_knode *n;
	473	unsigned i = 0x7FF;
	474
	475	for (n=ht->ht[TC_U32_HASH(handle)]; n; n = n->next)
	476	if (i < TC_U32_NODE(n->handle))
	477	i = TC_U32_NODE(n->handle);
	478	i++;
	479
	480	return handle\|(i>0xFFF ? 0xFFF : i);
	481	}
	482
6fa8c014 PM	483	static const struct nla_policy u32_policy[TCA_U32_MAX + 1] = {
	484	[TCA_U32_CLASSID] = { .type = NLA_U32 },
	485	[TCA_U32_HASH] = { .type = NLA_U32 },
	486	[TCA_U32_LINK] = { .type = NLA_U32 },
	487	[TCA_U32_DIVISOR] = { .type = NLA_U32 },
	488	[TCA_U32_SEL] = { .len = sizeof(struct tc_u32_sel) },
	489	[TCA_U32_INDEV] = { .type = NLA_STRING, .len = IFNAMSIZ },
	490	[TCA_U32_MARK] = { .len = sizeof(struct tc_u32_mark) },
	491	};
	492
1da177e4 LT	493	static int u32_set_parms(struct tcf_proto *tp, unsigned long base,
1da177e4 LT	494	struct tc_u_hnode *ht,
add93b61 PM	495	struct tc_u_knode n, struct nlattr *tb,
add93b61 PM	496	struct nlattr *est)
1da177e4 LT	497	{
	498	int err;
	499	struct tcf_exts e;
	500
	501	err = tcf_exts_validate(tp, tb, est, &e, &u32_ext_map);
	502	if (err < 0)
	503	return err;
	504
	505	err = -EINVAL;
add93b61	506	if (tb[TCA_U32_LINK]) {
1587bac4	507	u32 handle = nla_get_u32(tb[TCA_U32_LINK]);
47a1a1d4	508	struct tc_u_hnode ht_down = NULL, ht_old;
1da177e4 LT	509
	510	if (TC_U32_KEY(handle))
	511	goto errout;
	512
	513	if (handle) {
	514	ht_down = u32_lookup_ht(ht->tp_c, handle);
	515
	516	if (ht_down == NULL)
	517	goto errout;
	518	ht_down->refcnt++;
	519	}
	520
	521	tcf_tree_lock(tp);
47a1a1d4 PM	522	ht_old = n->ht_down;
47a1a1d4 PM	523	n->ht_down = ht_down;
1da177e4 LT	524	tcf_tree_unlock(tp);
1da177e4 LT	525
47a1a1d4 PM	526	if (ht_old)
47a1a1d4 PM	527	ht_old->refcnt--;
1da177e4	528	}
add93b61	529	if (tb[TCA_U32_CLASSID]) {
1587bac4	530	n->res.classid = nla_get_u32(tb[TCA_U32_CLASSID]);
1da177e4 LT	531	tcf_bind_filter(tp, &n->res, base);
	532	}
	533
	534	#ifdef CONFIG_NET_CLS_IND
add93b61 PM	535	if (tb[TCA_U32_INDEV]) {
add93b61 PM	536	err = tcf_change_indev(tp, n->indev, tb[TCA_U32_INDEV]);
1da177e4 LT	537	if (err < 0)
	538	goto errout;
	539	}
	540	#endif
	541	tcf_exts_change(tp, &n->exts, &e);
	542
	543	return 0;
	544	errout:
	545	tcf_exts_destroy(tp, &e);
	546	return err;
	547	}
	548
	549	static int u32_change(struct tcf_proto *tp, unsigned long base, u32 handle,
add93b61	550	struct nlattr **tca,
1da177e4 LT	551	unsigned long *arg)
	552	{
	553	struct tc_u_common *tp_c = tp->data;
	554	struct tc_u_hnode *ht;
	555	struct tc_u_knode *n;
	556	struct tc_u32_sel *s;
add93b61 PM	557	struct nlattr *opt = tca[TCA_OPTIONS];
add93b61 PM	558	struct nlattr *tb[TCA_U32_MAX + 1];
1da177e4 LT	559	u32 htid;
	560	int err;
	561
	562	if (opt == NULL)
	563	return handle ? -EINVAL : 0;
	564
6fa8c014	565	err = nla_parse_nested(tb, TCA_U32_MAX, opt, u32_policy);
cee63723 PM	566	if (err < 0)
cee63723 PM	567	return err;
1da177e4 LT	568
	569	if ((n = (struct tc_u_knode)arg) != NULL) {
	570	if (TC_U32_KEY(n->handle) == 0)
	571	return -EINVAL;
	572
add93b61	573	return u32_set_parms(tp, base, n->ht_up, n, tb, tca[TCA_RATE]);
1da177e4 LT	574	}
1da177e4 LT	575
add93b61	576	if (tb[TCA_U32_DIVISOR]) {
1587bac4	577	unsigned divisor = nla_get_u32(tb[TCA_U32_DIVISOR]);
1da177e4 LT	578
	579	if (--divisor > 0x100)
	580	return -EINVAL;
	581	if (TC_U32_KEY(handle))
	582	return -EINVAL;
	583	if (handle == 0) {
	584	handle = gen_new_htid(tp->data);
	585	if (handle == 0)
	586	return -ENOMEM;
	587	}
0da974f4	588	ht = kzalloc(sizeof(ht) + divisorsizeof(void*), GFP_KERNEL);
1da177e4 LT	589	if (ht == NULL)
1da177e4 LT	590	return -ENOBUFS;
1da177e4	591	ht->tp_c = tp_c;
e56cfad1	592	ht->refcnt = 1;
1da177e4 LT	593	ht->divisor = divisor;
	594	ht->handle = handle;
	595	ht->prio = tp->prio;
	596	ht->next = tp_c->hlist;
	597	tp_c->hlist = ht;
	598	*arg = (unsigned long)ht;
	599	return 0;
	600	}
	601
add93b61	602	if (tb[TCA_U32_HASH]) {
1587bac4	603	htid = nla_get_u32(tb[TCA_U32_HASH]);
1da177e4 LT	604	if (TC_U32_HTID(htid) == TC_U32_ROOT) {
	605	ht = tp->root;
	606	htid = ht->handle;
	607	} else {
	608	ht = u32_lookup_ht(tp->data, TC_U32_HTID(htid));
	609	if (ht == NULL)
	610	return -EINVAL;
	611	}
	612	} else {
	613	ht = tp->root;
	614	htid = ht->handle;
	615	}
	616
	617	if (ht->divisor < TC_U32_HASH(htid))
	618	return -EINVAL;
	619
	620	if (handle) {
	621	if (TC_U32_HTID(handle) && TC_U32_HTID(handle^htid))
	622	return -EINVAL;
	623	handle = htid \| TC_U32_NODE(handle);
	624	} else
	625	handle = gen_new_kid(ht, htid);
	626
6fa8c014	627	if (tb[TCA_U32_SEL] == NULL)
1da177e4 LT	628	return -EINVAL;
1da177e4 LT	629
add93b61	630	s = nla_data(tb[TCA_U32_SEL]);
1da177e4	631
0da974f4	632	n = kzalloc(sizeof(n) + s->nkeyssizeof(struct tc_u32_key), GFP_KERNEL);
1da177e4 LT	633	if (n == NULL)
	634	return -ENOBUFS;
	635
1da177e4	636	#ifdef CONFIG_CLS_U32_PERF
0da974f4	637	n->pf = kzalloc(sizeof(struct tc_u32_pcnt) + s->nkeys*sizeof(u64), GFP_KERNEL);
1da177e4 LT	638	if (n->pf == NULL) {
	639	kfree(n);
	640	return -ENOBUFS;
	641	}
1da177e4 LT	642	#endif
	643
	644	memcpy(&n->sel, s, sizeof(s) + s->nkeyssizeof(struct tc_u32_key));
	645	n->ht_up = ht;
	646	n->handle = handle;
b2268016	647	n->fshift = s->hmask ? ffs(ntohl(s->hmask)) - 1 : 0;
1da177e4 LT	648
1da177e4 LT	649	#ifdef CONFIG_CLS_U32_MARK
add93b61	650	if (tb[TCA_U32_MARK]) {
1da177e4 LT	651	struct tc_u32_mark *mark;
1da177e4 LT	652
add93b61	653	mark = nla_data(tb[TCA_U32_MARK]);
1da177e4 LT	654	memcpy(&n->mark, mark, sizeof(struct tc_u32_mark));
	655	n->mark.success = 0;
	656	}
	657	#endif
	658
add93b61	659	err = u32_set_parms(tp, base, ht, n, tb, tca[TCA_RATE]);
1da177e4 LT	660	if (err == 0) {
	661	struct tc_u_knode **ins;
	662	for (ins = &ht->ht[TC_U32_HASH(handle)]; ins; ins = &(ins)->next)
	663	if (TC_U32_NODE(handle) < TC_U32_NODE((*ins)->handle))
	664	break;
	665
	666	n->next = *ins;
6f573214	667	tcf_tree_lock(tp);
1da177e4	668	*ins = n;
6f573214	669	tcf_tree_unlock(tp);
1da177e4 LT	670
	671	*arg = (unsigned long)n;
	672	return 0;
	673	}
	674	#ifdef CONFIG_CLS_U32_PERF
1ae39a43	675	kfree(n->pf);
1da177e4 LT	676	#endif
	677	kfree(n);
	678	return err;
	679	}
	680
	681	static void u32_walk(struct tcf_proto tp, struct tcf_walker arg)
	682	{
	683	struct tc_u_common *tp_c = tp->data;
	684	struct tc_u_hnode *ht;
	685	struct tc_u_knode *n;
	686	unsigned h;
	687
	688	if (arg->stop)
	689	return;
	690
	691	for (ht = tp_c->hlist; ht; ht = ht->next) {
	692	if (ht->prio != tp->prio)
	693	continue;
	694	if (arg->count >= arg->skip) {
	695	if (arg->fn(tp, (unsigned long)ht, arg) < 0) {
	696	arg->stop = 1;
	697	return;
	698	}
	699	}
	700	arg->count++;
	701	for (h = 0; h <= ht->divisor; h++) {
	702	for (n = ht->ht[h]; n; n = n->next) {
	703	if (arg->count < arg->skip) {
	704	arg->count++;
	705	continue;
	706	}
	707	if (arg->fn(tp, (unsigned long)n, arg) < 0) {
	708	arg->stop = 1;
	709	return;
	710	}
	711	arg->count++;
	712	}
	713	}
	714	}
	715	}
	716
	717	static int u32_dump(struct tcf_proto *tp, unsigned long fh,
	718	struct sk_buff skb, struct tcmsg t)
	719	{
	720	struct tc_u_knode n = (struct tc_u_knode)fh;
4b3550ef	721	struct nlattr *nest;
1da177e4 LT	722
	723	if (n == NULL)
	724	return skb->len;
	725
	726	t->tcm_handle = n->handle;
	727
4b3550ef PM	728	nest = nla_nest_start(skb, TCA_OPTIONS);
	729	if (nest == NULL)
	730	goto nla_put_failure;
1da177e4 LT	731
	732	if (TC_U32_KEY(n->handle) == 0) {
	733	struct tc_u_hnode ht = (struct tc_u_hnode)fh;
	734	u32 divisor = ht->divisor+1;
24beeab5	735	NLA_PUT_U32(skb, TCA_U32_DIVISOR, divisor);
1da177e4	736	} else {
add93b61	737	NLA_PUT(skb, TCA_U32_SEL,
1da177e4 LT	738	sizeof(n->sel) + n->sel.nkeys*sizeof(struct tc_u32_key),
	739	&n->sel);
	740	if (n->ht_up) {
	741	u32 htid = n->handle & 0xFFFFF000;
24beeab5	742	NLA_PUT_U32(skb, TCA_U32_HASH, htid);
1da177e4 LT	743	}
1da177e4 LT	744	if (n->res.classid)
24beeab5	745	NLA_PUT_U32(skb, TCA_U32_CLASSID, n->res.classid);
1da177e4	746	if (n->ht_down)
24beeab5	747	NLA_PUT_U32(skb, TCA_U32_LINK, n->ht_down->handle);
1da177e4 LT	748
	749	#ifdef CONFIG_CLS_U32_MARK
	750	if (n->mark.val \|\| n->mark.mask)
add93b61	751	NLA_PUT(skb, TCA_U32_MARK, sizeof(n->mark), &n->mark);
1da177e4 LT	752	#endif
	753
	754	if (tcf_exts_dump(skb, &n->exts, &u32_ext_map) < 0)
add93b61	755	goto nla_put_failure;
1da177e4 LT	756
	757	#ifdef CONFIG_NET_CLS_IND
	758	if(strlen(n->indev))
57e1c487	759	NLA_PUT_STRING(skb, TCA_U32_INDEV, n->indev);
1da177e4 LT	760	#endif
1da177e4 LT	761	#ifdef CONFIG_CLS_U32_PERF
add93b61	762	NLA_PUT(skb, TCA_U32_PCNT,
1da177e4 LT	763	sizeof(struct tc_u32_pcnt) + n->sel.nkeys*sizeof(u64),
	764	n->pf);
	765	#endif
	766	}
	767
4b3550ef PM	768	nla_nest_end(skb, nest);
4b3550ef PM	769
1da177e4 LT	770	if (TC_U32_KEY(n->handle))
1da177e4 LT	771	if (tcf_exts_dump_stats(skb, &n->exts, &u32_ext_map) < 0)
add93b61	772	goto nla_put_failure;
1da177e4 LT	773	return skb->len;
1da177e4 LT	774
add93b61	775	nla_put_failure:
4b3550ef	776	nla_nest_cancel(skb, nest);
1da177e4 LT	777	return -1;
	778	}
	779
2eb9d75c	780	static struct tcf_proto_ops cls_u32_ops __read_mostly = {
1da177e4 LT	781	.kind = "u32",
	782	.classify = u32_classify,
	783	.init = u32_init,
	784	.destroy = u32_destroy,
	785	.get = u32_get,
	786	.put = u32_put,
	787	.change = u32_change,
	788	.delete = u32_delete,
	789	.walk = u32_walk,
	790	.dump = u32_dump,
	791	.owner = THIS_MODULE,
	792	};
	793
	794	static int __init init_u32(void)
	795	{
6ff9c364	796	pr_info("u32 classifier\n");
1da177e4	797	#ifdef CONFIG_CLS_U32_PERF
6ff9c364	798	pr_info(" Performance counters on\n");
1da177e4	799	#endif
1da177e4	800	#ifdef CONFIG_NET_CLS_IND
6ff9c364	801	pr_info(" input device check on\n");
1da177e4 LT	802	#endif
1da177e4 LT	803	#ifdef CONFIG_NET_CLS_ACT
6ff9c364	804	pr_info(" Actions configured\n");
1da177e4 LT	805	#endif
	806	return register_tcf_proto_ops(&cls_u32_ops);
	807	}
	808
10297b99	809	static void __exit exit_u32(void)
1da177e4 LT	810	{
	811	unregister_tcf_proto_ops(&cls_u32_ops);
	812	}
	813
	814	module_init(init_u32)
	815	module_exit(exit_u32)
	816	MODULE_LICENSE("GPL");