[mirror_ubuntu-bionic-kernel.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;
		u8		  *ptr;
	} stack[TC_U32_MAXDEPTH];

	struct tc_u_hnode *ht = (struct tc_u_hnode*)tp->root;
	u8 *ptr = skb_network_header(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++) {

			if ((*(__be32*)(ptr+key->off+(off2&key->offmask))^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].ptr = ptr;
		sdepth++;

		ht = n->ht_down;
		sel = 0;
		if (ht->divisor)
			sel = ht->divisor&u32_hash_fold(*(__be32*)(ptr+n->sel.hoff), &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)
				off2 += ntohs(n->sel.offmask & *(__be16*)(ptr+n->sel.offoff)) >>n->sel.offshift;
			off2 &= ~3;
		}
		if (n->sel.flags&TC_U32_EAT) {
			ptr += off2;
			off2 = 0;
		}

		if (ptr < skb_tail_pointer(skb))
			goto next_ht;
	}

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

deadloop:
	if (net_ratelimit())
		printk("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)
{
	printk("u32 classifier\n");
#ifdef CONFIG_CLS_U32_PERF
	printk("    Performance counters on\n");
#endif
#ifdef CONFIG_NET_CLS_IND
	printk("    input device check on \n");
#endif
#ifdef CONFIG_NET_CLS_ACT
	printk("    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;
	101	u8 *ptr;
	102	} stack[TC_U32_MAXDEPTH];
	103
	104	struct tc_u_hnode ht = (struct tc_u_hnode)tp->root;
d56f90a7	105	u8 *ptr = skb_network_header(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++) {
	137
0382b9c3	138	if (((__be32)(ptr+key->off+(off2&key->offmask))^key->val)&key->mask) {
1da177e4 LT	139	n = n->next;
	140	goto next_knode;
	141	}
	142	#ifdef CONFIG_CLS_U32_PERF
	143	n->pf->kcnts[j] +=1;
	144	j++;
	145	#endif
	146	}
	147	if (n->ht_down == NULL) {
	148	check_terminal:
	149	if (n->sel.flags&TC_U32_TERMINAL) {
	150
	151	*res = n->res;
	152	#ifdef CONFIG_NET_CLS_IND
	153	if (!tcf_match_indev(skb, n->indev)) {
	154	n = n->next;
	155	goto next_knode;
	156	}
	157	#endif
	158	#ifdef CONFIG_CLS_U32_PERF
	159	n->pf->rhit +=1;
	160	#endif
	161	r = tcf_exts_exec(skb, &n->exts, res);
	162	if (r < 0) {
	163	n = n->next;
	164	goto next_knode;
	165	}
	166
	167	return r;
	168	}
	169	n = n->next;
	170	goto next_knode;
	171	}
	172
	173	/* PUSH */
	174	if (sdepth >= TC_U32_MAXDEPTH)
	175	goto deadloop;
	176	stack[sdepth].knode = n;
	177	stack[sdepth].ptr = ptr;
	178	sdepth++;
	179
	180	ht = n->ht_down;
	181	sel = 0;
	182	if (ht->divisor)
0382b9c3	183	sel = ht->divisor&u32_hash_fold((__be32)(ptr+n->sel.hoff), &n->sel,n->fshift);
1da177e4 LT	184
	185	if (!(n->sel.flags&(TC_U32_VAROFFSET\|TC_U32_OFFSET\|TC_U32_EAT)))
	186	goto next_ht;
	187
	188	if (n->sel.flags&(TC_U32_OFFSET\|TC_U32_VAROFFSET)) {
	189	off2 = n->sel.off + 3;
	190	if (n->sel.flags&TC_U32_VAROFFSET)
0382b9c3	191	off2 += ntohs(n->sel.offmask & (__be16)(ptr+n->sel.offoff)) >>n->sel.offshift;
1da177e4 LT	192	off2 &= ~3;
	193	}
	194	if (n->sel.flags&TC_U32_EAT) {
	195	ptr += off2;
	196	off2 = 0;
	197	}
	198
27a884dc	199	if (ptr < skb_tail_pointer(skb))
1da177e4 LT	200	goto next_ht;
	201	}
	202
	203	/* POP */
	204	if (sdepth--) {
	205	n = stack[sdepth].knode;
	206	ht = n->ht_up;
	207	ptr = stack[sdepth].ptr;
	208	goto check_terminal;
	209	}
	210	return -1;
	211
	212	deadloop:
	213	if (net_ratelimit())
	214	printk("cls_u32: dead loop\n");
	215	return -1;
	216	}
	217
	218	static __inline__ struct tc_u_hnode *
	219	u32_lookup_ht(struct tc_u_common *tp_c, u32 handle)
	220	{
	221	struct tc_u_hnode *ht;
	222
	223	for (ht = tp_c->hlist; ht; ht = ht->next)
	224	if (ht->handle == handle)
	225	break;
	226
	227	return ht;
	228	}
	229
	230	static __inline__ struct tc_u_knode *
	231	u32_lookup_key(struct tc_u_hnode *ht, u32 handle)
	232	{
	233	unsigned sel;
	234	struct tc_u_knode *n = NULL;
	235
	236	sel = TC_U32_HASH(handle);
	237	if (sel > ht->divisor)
	238	goto out;
	239
	240	for (n = ht->ht[sel]; n; n = n->next)
	241	if (n->handle == handle)
	242	break;
	243	out:
	244	return n;
	245	}
	246
	247
	248	static unsigned long u32_get(struct tcf_proto *tp, u32 handle)
	249	{
	250	struct tc_u_hnode *ht;
	251	struct tc_u_common *tp_c = tp->data;
	252
	253	if (TC_U32_HTID(handle) == TC_U32_ROOT)
	254	ht = tp->root;
	255	else
	256	ht = u32_lookup_ht(tp_c, TC_U32_HTID(handle));
	257
	258	if (!ht)
	259	return 0;
	260
	261	if (TC_U32_KEY(handle) == 0)
	262	return (unsigned long)ht;
	263
264	return (unsigned long)u32_lookup_key(ht, handle);
265	}
266
267	static void u32_put(struct tcf_proto *tp, unsigned long f)
268	{
269	}
270
271	static u32 gen_new_htid(struct tc_u_common *tp_c)
272	{
273	int i = 0x800;
274
275	do {
276	if (++tp_c->hgenerator == 0x7FF)
277	tp_c->hgenerator = 1;
278	} while (--i>0 && u32_lookup_ht(tp_c, (tp_c->hgenerator\|0x800)<<20));
279
280	return i > 0 ? (tp_c->hgenerator\|0x800)<<20 : 0;
281	}
282
283	static int u32_init(struct tcf_proto *tp)
284	{
285	struct tc_u_hnode *root_ht;
286	struct tc_u_common *tp_c;
287
72b25a91	288	tp_c = tp->q->u32_node;
1da177e4	289
0da974f4	290	root_ht = kzalloc(sizeof(*root_ht), GFP_KERNEL);
1da177e4 LT	291	if (root_ht == NULL)
	292	return -ENOBUFS;
	293
1da177e4 LT	294	root_ht->divisor = 0;
	295	root_ht->refcnt++;
	296	root_ht->handle = tp_c ? gen_new_htid(tp_c) : 0x80000000;
	297	root_ht->prio = tp->prio;
	298
	299	if (tp_c == NULL) {
0da974f4	300	tp_c = kzalloc(sizeof(*tp_c), GFP_KERNEL);
1da177e4 LT	301	if (tp_c == NULL) {
	302	kfree(root_ht);
	303	return -ENOBUFS;
	304	}
1da177e4	305	tp_c->q = tp->q;
72b25a91	306	tp->q->u32_node = tp_c;
1da177e4 LT	307	}
	308
	309	tp_c->refcnt++;
	310	root_ht->next = tp_c->hlist;
	311	tp_c->hlist = root_ht;
	312	root_ht->tp_c = tp_c;
	313
	314	tp->root = root_ht;
	315	tp->data = tp_c;
	316	return 0;
	317	}
	318
	319	static int u32_destroy_key(struct tcf_proto tp, struct tc_u_knode n)
	320	{
	321	tcf_unbind_filter(tp, &n->res);
	322	tcf_exts_destroy(tp, &n->exts);
	323	if (n->ht_down)
	324	n->ht_down->refcnt--;
	325	#ifdef CONFIG_CLS_U32_PERF
1ae39a43	326	kfree(n->pf);
1da177e4 LT	327	#endif
	328	kfree(n);
	329	return 0;
	330	}
	331
	332	static int u32_delete_key(struct tcf_proto tp, struct tc_u_knode key)
	333	{
	334	struct tc_u_knode **kp;
	335	struct tc_u_hnode *ht = key->ht_up;
	336
	337	if (ht) {
	338	for (kp = &ht->ht[TC_U32_HASH(key->handle)]; kp; kp = &(kp)->next) {
	339	if (*kp == key) {
	340	tcf_tree_lock(tp);
	341	*kp = key->next;
	342	tcf_tree_unlock(tp);
	343
	344	u32_destroy_key(tp, key);
	345	return 0;
	346	}
	347	}
	348	}
547b792c	349	WARN_ON(1);
1da177e4 LT	350	return 0;
	351	}
	352
	353	static void u32_clear_hnode(struct tcf_proto tp, struct tc_u_hnode ht)
	354	{
	355	struct tc_u_knode *n;
	356	unsigned h;
	357
	358	for (h=0; h<=ht->divisor; h++) {
	359	while ((n = ht->ht[h]) != NULL) {
	360	ht->ht[h] = n->next;
	361
	362	u32_destroy_key(tp, n);
	363	}
	364	}
	365	}
	366
	367	static int u32_destroy_hnode(struct tcf_proto tp, struct tc_u_hnode ht)
	368	{
	369	struct tc_u_common *tp_c = tp->data;
	370	struct tc_u_hnode **hn;
	371
547b792c	372	WARN_ON(ht->refcnt);
1da177e4 LT	373
	374	u32_clear_hnode(tp, ht);
	375
	376	for (hn = &tp_c->hlist; hn; hn = &(hn)->next) {
	377	if (*hn == ht) {
	378	*hn = ht->next;
	379	kfree(ht);
	380	return 0;
	381	}
	382	}
	383
547b792c	384	WARN_ON(1);
1da177e4 LT	385	return -ENOENT;
	386	}
	387
	388	static void u32_destroy(struct tcf_proto *tp)
	389	{
	390	struct tc_u_common *tp_c = tp->data;
47a1a1d4	391	struct tc_u_hnode *root_ht = tp->root;
1da177e4	392
547b792c	393	WARN_ON(root_ht == NULL);
1da177e4 LT	394
	395	if (root_ht && --root_ht->refcnt == 0)
	396	u32_destroy_hnode(tp, root_ht);
	397
	398	if (--tp_c->refcnt == 0) {
	399	struct tc_u_hnode *ht;
1da177e4	400
72b25a91	401	tp->q->u32_node = NULL;
1da177e4	402
e56cfad1 JP	403	for (ht = tp_c->hlist; ht; ht = ht->next) {
e56cfad1 JP	404	ht->refcnt--;
1da177e4	405	u32_clear_hnode(tp, ht);
e56cfad1	406	}
1da177e4 LT	407
	408	while ((ht = tp_c->hlist) != NULL) {
	409	tp_c->hlist = ht->next;
	410
547b792c	411	WARN_ON(ht->refcnt != 0);
1da177e4 LT	412
1da177e4 LT	413	kfree(ht);
3ff50b79	414	}
1da177e4 LT	415
	416	kfree(tp_c);
	417	}
	418
	419	tp->data = NULL;
	420	}
	421
	422	static int u32_delete(struct tcf_proto *tp, unsigned long arg)
	423	{
	424	struct tc_u_hnode ht = (struct tc_u_hnode)arg;
	425
	426	if (ht == NULL)
	427	return 0;
	428
	429	if (TC_U32_KEY(ht->handle))
	430	return u32_delete_key(tp, (struct tc_u_knode*)ht);
	431
	432	if (tp->root == ht)
	433	return -EINVAL;
	434
e56cfad1 JP	435	if (ht->refcnt == 1) {
e56cfad1 JP	436	ht->refcnt--;
1da177e4	437	u32_destroy_hnode(tp, ht);
e56cfad1 JP	438	} else {
	439	return -EBUSY;
	440	}
1da177e4 LT	441
	442	return 0;
	443	}
	444
	445	static u32 gen_new_kid(struct tc_u_hnode *ht, u32 handle)
	446	{
	447	struct tc_u_knode *n;
	448	unsigned i = 0x7FF;
	449
	450	for (n=ht->ht[TC_U32_HASH(handle)]; n; n = n->next)
	451	if (i < TC_U32_NODE(n->handle))
	452	i = TC_U32_NODE(n->handle);
	453	i++;
	454
	455	return handle\|(i>0xFFF ? 0xFFF : i);
	456	}
	457
6fa8c014 PM	458	static const struct nla_policy u32_policy[TCA_U32_MAX + 1] = {
	459	[TCA_U32_CLASSID] = { .type = NLA_U32 },
	460	[TCA_U32_HASH] = { .type = NLA_U32 },
	461	[TCA_U32_LINK] = { .type = NLA_U32 },
	462	[TCA_U32_DIVISOR] = { .type = NLA_U32 },
	463	[TCA_U32_SEL] = { .len = sizeof(struct tc_u32_sel) },
	464	[TCA_U32_INDEV] = { .type = NLA_STRING, .len = IFNAMSIZ },
	465	[TCA_U32_MARK] = { .len = sizeof(struct tc_u32_mark) },
	466	};
	467
1da177e4 LT	468	static int u32_set_parms(struct tcf_proto *tp, unsigned long base,
1da177e4 LT	469	struct tc_u_hnode *ht,
add93b61 PM	470	struct tc_u_knode n, struct nlattr *tb,
add93b61 PM	471	struct nlattr *est)
1da177e4 LT	472	{
	473	int err;
	474	struct tcf_exts e;
	475
	476	err = tcf_exts_validate(tp, tb, est, &e, &u32_ext_map);
	477	if (err < 0)
	478	return err;
	479
	480	err = -EINVAL;
add93b61	481	if (tb[TCA_U32_LINK]) {
1587bac4	482	u32 handle = nla_get_u32(tb[TCA_U32_LINK]);
47a1a1d4	483	struct tc_u_hnode ht_down = NULL, ht_old;
1da177e4 LT	484
	485	if (TC_U32_KEY(handle))
	486	goto errout;
	487
	488	if (handle) {
	489	ht_down = u32_lookup_ht(ht->tp_c, handle);
	490
	491	if (ht_down == NULL)
	492	goto errout;
	493	ht_down->refcnt++;
	494	}
	495
	496	tcf_tree_lock(tp);
47a1a1d4 PM	497	ht_old = n->ht_down;
47a1a1d4 PM	498	n->ht_down = ht_down;
1da177e4 LT	499	tcf_tree_unlock(tp);
1da177e4 LT	500
47a1a1d4 PM	501	if (ht_old)
47a1a1d4 PM	502	ht_old->refcnt--;
1da177e4	503	}
add93b61	504	if (tb[TCA_U32_CLASSID]) {
1587bac4	505	n->res.classid = nla_get_u32(tb[TCA_U32_CLASSID]);
1da177e4 LT	506	tcf_bind_filter(tp, &n->res, base);
	507	}
	508
	509	#ifdef CONFIG_NET_CLS_IND
add93b61 PM	510	if (tb[TCA_U32_INDEV]) {
add93b61 PM	511	err = tcf_change_indev(tp, n->indev, tb[TCA_U32_INDEV]);
1da177e4 LT	512	if (err < 0)
	513	goto errout;
	514	}
	515	#endif
	516	tcf_exts_change(tp, &n->exts, &e);
	517
	518	return 0;
	519	errout:
	520	tcf_exts_destroy(tp, &e);
	521	return err;
	522	}
	523
	524	static int u32_change(struct tcf_proto *tp, unsigned long base, u32 handle,
add93b61	525	struct nlattr **tca,
1da177e4 LT	526	unsigned long *arg)
	527	{
	528	struct tc_u_common *tp_c = tp->data;
	529	struct tc_u_hnode *ht;
	530	struct tc_u_knode *n;
	531	struct tc_u32_sel *s;
add93b61 PM	532	struct nlattr *opt = tca[TCA_OPTIONS];
add93b61 PM	533	struct nlattr *tb[TCA_U32_MAX + 1];
1da177e4 LT	534	u32 htid;
	535	int err;
	536
	537	if (opt == NULL)
	538	return handle ? -EINVAL : 0;
	539
6fa8c014	540	err = nla_parse_nested(tb, TCA_U32_MAX, opt, u32_policy);
cee63723 PM	541	if (err < 0)
cee63723 PM	542	return err;
1da177e4 LT	543
	544	if ((n = (struct tc_u_knode)arg) != NULL) {
	545	if (TC_U32_KEY(n->handle) == 0)
	546	return -EINVAL;
	547
add93b61	548	return u32_set_parms(tp, base, n->ht_up, n, tb, tca[TCA_RATE]);
1da177e4 LT	549	}
1da177e4 LT	550
add93b61	551	if (tb[TCA_U32_DIVISOR]) {
1587bac4	552	unsigned divisor = nla_get_u32(tb[TCA_U32_DIVISOR]);
1da177e4 LT	553
	554	if (--divisor > 0x100)
	555	return -EINVAL;
	556	if (TC_U32_KEY(handle))
	557	return -EINVAL;
	558	if (handle == 0) {
	559	handle = gen_new_htid(tp->data);
	560	if (handle == 0)
	561	return -ENOMEM;
	562	}
0da974f4	563	ht = kzalloc(sizeof(ht) + divisorsizeof(void*), GFP_KERNEL);
1da177e4 LT	564	if (ht == NULL)
1da177e4 LT	565	return -ENOBUFS;
1da177e4	566	ht->tp_c = tp_c;
e56cfad1	567	ht->refcnt = 1;
1da177e4 LT	568	ht->divisor = divisor;
	569	ht->handle = handle;
	570	ht->prio = tp->prio;
	571	ht->next = tp_c->hlist;
	572	tp_c->hlist = ht;
	573	*arg = (unsigned long)ht;
	574	return 0;
	575	}
	576
add93b61	577	if (tb[TCA_U32_HASH]) {
1587bac4	578	htid = nla_get_u32(tb[TCA_U32_HASH]);
1da177e4 LT	579	if (TC_U32_HTID(htid) == TC_U32_ROOT) {
	580	ht = tp->root;
	581	htid = ht->handle;
	582	} else {
	583	ht = u32_lookup_ht(tp->data, TC_U32_HTID(htid));
	584	if (ht == NULL)
	585	return -EINVAL;
	586	}
	587	} else {
	588	ht = tp->root;
	589	htid = ht->handle;
	590	}
	591
	592	if (ht->divisor < TC_U32_HASH(htid))
	593	return -EINVAL;
	594
	595	if (handle) {
	596	if (TC_U32_HTID(handle) && TC_U32_HTID(handle^htid))
	597	return -EINVAL;
	598	handle = htid \| TC_U32_NODE(handle);
	599	} else
	600	handle = gen_new_kid(ht, htid);
	601
6fa8c014	602	if (tb[TCA_U32_SEL] == NULL)
1da177e4 LT	603	return -EINVAL;
1da177e4 LT	604
add93b61	605	s = nla_data(tb[TCA_U32_SEL]);
1da177e4	606
0da974f4	607	n = kzalloc(sizeof(n) + s->nkeyssizeof(struct tc_u32_key), GFP_KERNEL);
1da177e4 LT	608	if (n == NULL)
	609	return -ENOBUFS;
	610
1da177e4	611	#ifdef CONFIG_CLS_U32_PERF
0da974f4	612	n->pf = kzalloc(sizeof(struct tc_u32_pcnt) + s->nkeys*sizeof(u64), GFP_KERNEL);
1da177e4 LT	613	if (n->pf == NULL) {
	614	kfree(n);
	615	return -ENOBUFS;
	616	}
1da177e4 LT	617	#endif
	618
	619	memcpy(&n->sel, s, sizeof(s) + s->nkeyssizeof(struct tc_u32_key));
	620	n->ht_up = ht;
	621	n->handle = handle;
b2268016	622	n->fshift = s->hmask ? ffs(ntohl(s->hmask)) - 1 : 0;
1da177e4 LT	623
1da177e4 LT	624	#ifdef CONFIG_CLS_U32_MARK
add93b61	625	if (tb[TCA_U32_MARK]) {
1da177e4 LT	626	struct tc_u32_mark *mark;
1da177e4 LT	627
add93b61	628	mark = nla_data(tb[TCA_U32_MARK]);
1da177e4 LT	629	memcpy(&n->mark, mark, sizeof(struct tc_u32_mark));
	630	n->mark.success = 0;
	631	}
	632	#endif
	633
add93b61	634	err = u32_set_parms(tp, base, ht, n, tb, tca[TCA_RATE]);
1da177e4 LT	635	if (err == 0) {
	636	struct tc_u_knode **ins;
	637	for (ins = &ht->ht[TC_U32_HASH(handle)]; ins; ins = &(ins)->next)
	638	if (TC_U32_NODE(handle) < TC_U32_NODE((*ins)->handle))
	639	break;
	640
	641	n->next = *ins;
6f573214	642	tcf_tree_lock(tp);
1da177e4	643	*ins = n;
6f573214	644	tcf_tree_unlock(tp);
1da177e4 LT	645
	646	*arg = (unsigned long)n;
	647	return 0;
	648	}
	649	#ifdef CONFIG_CLS_U32_PERF
1ae39a43	650	kfree(n->pf);
1da177e4 LT	651	#endif
	652	kfree(n);
	653	return err;
	654	}
	655
	656	static void u32_walk(struct tcf_proto tp, struct tcf_walker arg)
	657	{
	658	struct tc_u_common *tp_c = tp->data;
	659	struct tc_u_hnode *ht;
	660	struct tc_u_knode *n;
	661	unsigned h;
	662
	663	if (arg->stop)
	664	return;
	665
	666	for (ht = tp_c->hlist; ht; ht = ht->next) {
	667	if (ht->prio != tp->prio)
	668	continue;
	669	if (arg->count >= arg->skip) {
	670	if (arg->fn(tp, (unsigned long)ht, arg) < 0) {
	671	arg->stop = 1;
	672	return;
	673	}
	674	}
	675	arg->count++;
	676	for (h = 0; h <= ht->divisor; h++) {
	677	for (n = ht->ht[h]; n; n = n->next) {
	678	if (arg->count < arg->skip) {
	679	arg->count++;
	680	continue;
	681	}
	682	if (arg->fn(tp, (unsigned long)n, arg) < 0) {
	683	arg->stop = 1;
	684	return;
	685	}
	686	arg->count++;
	687	}
	688	}
	689	}
	690	}
	691
	692	static int u32_dump(struct tcf_proto *tp, unsigned long fh,
	693	struct sk_buff skb, struct tcmsg t)
	694	{
	695	struct tc_u_knode n = (struct tc_u_knode)fh;
4b3550ef	696	struct nlattr *nest;
1da177e4 LT	697
	698	if (n == NULL)
	699	return skb->len;
	700
	701	t->tcm_handle = n->handle;
	702
4b3550ef PM	703	nest = nla_nest_start(skb, TCA_OPTIONS);
	704	if (nest == NULL)
	705	goto nla_put_failure;
1da177e4 LT	706
	707	if (TC_U32_KEY(n->handle) == 0) {
	708	struct tc_u_hnode ht = (struct tc_u_hnode)fh;
	709	u32 divisor = ht->divisor+1;
24beeab5	710	NLA_PUT_U32(skb, TCA_U32_DIVISOR, divisor);
1da177e4	711	} else {
add93b61	712	NLA_PUT(skb, TCA_U32_SEL,
1da177e4 LT	713	sizeof(n->sel) + n->sel.nkeys*sizeof(struct tc_u32_key),
	714	&n->sel);
	715	if (n->ht_up) {
	716	u32 htid = n->handle & 0xFFFFF000;
24beeab5	717	NLA_PUT_U32(skb, TCA_U32_HASH, htid);
1da177e4 LT	718	}
1da177e4 LT	719	if (n->res.classid)
24beeab5	720	NLA_PUT_U32(skb, TCA_U32_CLASSID, n->res.classid);
1da177e4	721	if (n->ht_down)
24beeab5	722	NLA_PUT_U32(skb, TCA_U32_LINK, n->ht_down->handle);
1da177e4 LT	723
	724	#ifdef CONFIG_CLS_U32_MARK
	725	if (n->mark.val \|\| n->mark.mask)
add93b61	726	NLA_PUT(skb, TCA_U32_MARK, sizeof(n->mark), &n->mark);
1da177e4 LT	727	#endif
	728
	729	if (tcf_exts_dump(skb, &n->exts, &u32_ext_map) < 0)
add93b61	730	goto nla_put_failure;
1da177e4 LT	731
	732	#ifdef CONFIG_NET_CLS_IND
	733	if(strlen(n->indev))
57e1c487	734	NLA_PUT_STRING(skb, TCA_U32_INDEV, n->indev);
1da177e4 LT	735	#endif
1da177e4 LT	736	#ifdef CONFIG_CLS_U32_PERF
add93b61	737	NLA_PUT(skb, TCA_U32_PCNT,
1da177e4 LT	738	sizeof(struct tc_u32_pcnt) + n->sel.nkeys*sizeof(u64),
	739	n->pf);
	740	#endif
	741	}
	742
4b3550ef PM	743	nla_nest_end(skb, nest);
4b3550ef PM	744
1da177e4 LT	745	if (TC_U32_KEY(n->handle))
1da177e4 LT	746	if (tcf_exts_dump_stats(skb, &n->exts, &u32_ext_map) < 0)
add93b61	747	goto nla_put_failure;
1da177e4 LT	748	return skb->len;
1da177e4 LT	749
add93b61	750	nla_put_failure:
4b3550ef	751	nla_nest_cancel(skb, nest);
1da177e4 LT	752	return -1;
	753	}
	754
2eb9d75c	755	static struct tcf_proto_ops cls_u32_ops __read_mostly = {
1da177e4 LT	756	.kind = "u32",
	757	.classify = u32_classify,
	758	.init = u32_init,
	759	.destroy = u32_destroy,
	760	.get = u32_get,
	761	.put = u32_put,
	762	.change = u32_change,
	763	.delete = u32_delete,
	764	.walk = u32_walk,
	765	.dump = u32_dump,
	766	.owner = THIS_MODULE,
	767	};
	768
	769	static int __init init_u32(void)
	770	{
	771	printk("u32 classifier\n");
	772	#ifdef CONFIG_CLS_U32_PERF
c0956bd2	773	printk(" Performance counters on\n");
1da177e4	774	#endif
1da177e4 LT	775	#ifdef CONFIG_NET_CLS_IND
	776	printk(" input device check on \n");
	777	#endif
	778	#ifdef CONFIG_NET_CLS_ACT
	779	printk(" Actions configured \n");
	780	#endif
	781	return register_tcf_proto_ops(&cls_u32_ops);
	782	}
	783
10297b99	784	static void __exit exit_u32(void)
1da177e4 LT	785	{
	786	unregister_tcf_proto_ops(&cls_u32_ops);
	787	}
	788
	789	module_init(init_u32)
	790	module_exit(exit_u32)
	791	MODULE_LICENSE("GPL");