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