[deliverable/linux.git] / net / sched / sch_prio.c

/*
 * net/sched/sch_prio.c	Simple 3-band priority "scheduler".
 *
 *		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>
 * Fixes:       19990609: J Hadi Salim <hadi@nortelnetworks.com>:
 *              Init --  EINVAL when opt undefined
 */

#include <linux/module.h>
#include <linux/types.h>
#include <linux/kernel.h>
#include <linux/string.h>
#include <linux/errno.h>
#include <linux/skbuff.h>
#include <net/netlink.h>
#include <net/pkt_sched.h>


struct prio_sched_data
{
	int bands;
	struct tcf_proto *filter_list;
	u8  prio2band[TC_PRIO_MAX+1];
	struct Qdisc *queues[TCQ_PRIO_BANDS];
};


static struct Qdisc *
prio_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	u32 band = skb->priority;
	struct tcf_result res;
	int err;

	*qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
	if (TC_H_MAJ(skb->priority) != sch->handle) {
		err = tc_classify(skb, q->filter_list, &res);
#ifdef CONFIG_NET_CLS_ACT
		switch (err) {
		case TC_ACT_STOLEN:
		case TC_ACT_QUEUED:
			*qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
		case TC_ACT_SHOT:
			return NULL;
		}
#endif
		if (!q->filter_list || err < 0) {
			if (TC_H_MAJ(band))
				band = 0;
			return q->queues[q->prio2band[band&TC_PRIO_MAX]];
		}
		band = res.classid;
	}
	band = TC_H_MIN(band) - 1;
	if (band >= q->bands)
		return q->queues[q->prio2band[0]];

	return q->queues[band];
}

static int
prio_enqueue(struct sk_buff *skb, struct Qdisc *sch)
{
	struct Qdisc *qdisc;
	int ret;

	qdisc = prio_classify(skb, sch, &ret);
#ifdef CONFIG_NET_CLS_ACT
	if (qdisc == NULL) {

		if (ret & __NET_XMIT_BYPASS)
			sch->qstats.drops++;
		kfree_skb(skb);
		return ret;
	}
#endif

	ret = qdisc_enqueue(skb, qdisc);
	if (ret == NET_XMIT_SUCCESS) {
		sch->bstats.bytes += qdisc_pkt_len(skb);
		sch->bstats.packets++;
		sch->q.qlen++;
		return NET_XMIT_SUCCESS;
	}
	if (net_xmit_drop_count(ret))
		sch->qstats.drops++;
	return ret;
}

static struct sk_buff *prio_peek(struct Qdisc *sch)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	int prio;

	for (prio = 0; prio < q->bands; prio++) {
		struct Qdisc *qdisc = q->queues[prio];
		struct sk_buff *skb = qdisc->ops->peek(qdisc);
		if (skb)
			return skb;
	}
	return NULL;
}

static struct sk_buff *prio_dequeue(struct Qdisc* sch)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	int prio;

	for (prio = 0; prio < q->bands; prio++) {
		struct Qdisc *qdisc = q->queues[prio];
		struct sk_buff *skb = qdisc->dequeue(qdisc);
		if (skb) {
			sch->q.qlen--;
			return skb;
		}
	}
	return NULL;

}

static unsigned int prio_drop(struct Qdisc* sch)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	int prio;
	unsigned int len;
	struct Qdisc *qdisc;

	for (prio = q->bands-1; prio >= 0; prio--) {
		qdisc = q->queues[prio];
		if (qdisc->ops->drop && (len = qdisc->ops->drop(qdisc)) != 0) {
			sch->q.qlen--;
			return len;
		}
	}
	return 0;
}


static void
prio_reset(struct Qdisc* sch)
{
	int prio;
	struct prio_sched_data *q = qdisc_priv(sch);

	for (prio=0; prio<q->bands; prio++)
		qdisc_reset(q->queues[prio]);
	sch->q.qlen = 0;
}

static void
prio_destroy(struct Qdisc* sch)
{
	int prio;
	struct prio_sched_data *q = qdisc_priv(sch);

	tcf_destroy_chain(&q->filter_list);
	for (prio=0; prio<q->bands; prio++)
		qdisc_destroy(q->queues[prio]);
}

static int prio_tune(struct Qdisc *sch, struct nlattr *opt)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	struct tc_prio_qopt *qopt;
	int i;

	if (nla_len(opt) < sizeof(*qopt))
		return -EINVAL;
	qopt = nla_data(opt);

	if (qopt->bands > TCQ_PRIO_BANDS || qopt->bands < 2)
		return -EINVAL;

	for (i=0; i<=TC_PRIO_MAX; i++) {
		if (qopt->priomap[i] >= qopt->bands)
			return -EINVAL;
	}

	sch_tree_lock(sch);
	q->bands = qopt->bands;
	memcpy(q->prio2band, qopt->priomap, TC_PRIO_MAX+1);

	for (i=q->bands; i<TCQ_PRIO_BANDS; i++) {
		struct Qdisc *child = q->queues[i];
		q->queues[i] = &noop_qdisc;
		if (child != &noop_qdisc) {
			qdisc_tree_decrease_qlen(child, child->q.qlen);
			qdisc_destroy(child);
		}
	}
	sch_tree_unlock(sch);

	for (i=0; i<q->bands; i++) {
		if (q->queues[i] == &noop_qdisc) {
			struct Qdisc *child, *old;
			child = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
						  &pfifo_qdisc_ops,
						  TC_H_MAKE(sch->handle, i + 1));
			if (child) {
				sch_tree_lock(sch);
				old = q->queues[i];
				q->queues[i] = child;

				if (old != &noop_qdisc) {
					qdisc_tree_decrease_qlen(old,
								 old->q.qlen);
					qdisc_destroy(old);
				}
				sch_tree_unlock(sch);
			}
		}
	}
	return 0;
}

static int prio_init(struct Qdisc *sch, struct nlattr *opt)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	int i;

	for (i=0; i<TCQ_PRIO_BANDS; i++)
		q->queues[i] = &noop_qdisc;

	if (opt == NULL) {
		return -EINVAL;
	} else {
		int err;

		if ((err= prio_tune(sch, opt)) != 0)
			return err;
	}
	return 0;
}

static int prio_dump(struct Qdisc *sch, struct sk_buff *skb)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	unsigned char *b = skb_tail_pointer(skb);
	struct tc_prio_qopt opt;

	opt.bands = q->bands;
	memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX+1);

	NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);

	return skb->len;

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

static int prio_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
		      struct Qdisc **old)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	unsigned long band = arg - 1;

	if (new == NULL)
		new = &noop_qdisc;

	sch_tree_lock(sch);
	*old = q->queues[band];
	q->queues[band] = new;
	qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
	qdisc_reset(*old);
	sch_tree_unlock(sch);

	return 0;
}

static struct Qdisc *
prio_leaf(struct Qdisc *sch, unsigned long arg)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	unsigned long band = arg - 1;

	return q->queues[band];
}

static unsigned long prio_get(struct Qdisc *sch, u32 classid)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	unsigned long band = TC_H_MIN(classid);

	if (band - 1 >= q->bands)
		return 0;
	return band;
}

static unsigned long prio_bind(struct Qdisc *sch, unsigned long parent, u32 classid)
{
	return prio_get(sch, classid);
}


static void prio_put(struct Qdisc *q, unsigned long cl)
{
	return;
}

static int prio_dump_class(struct Qdisc *sch, unsigned long cl, struct sk_buff *skb,
			   struct tcmsg *tcm)
{
	struct prio_sched_data *q = qdisc_priv(sch);

	tcm->tcm_handle |= TC_H_MIN(cl);
	tcm->tcm_info = q->queues[cl-1]->handle;
	return 0;
}

static int prio_dump_class_stats(struct Qdisc *sch, unsigned long cl,
				 struct gnet_dump *d)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	struct Qdisc *cl_q;

	cl_q = q->queues[cl - 1];
	if (gnet_stats_copy_basic(d, &cl_q->bstats) < 0 ||
	    gnet_stats_copy_queue(d, &cl_q->qstats) < 0)
		return -1;

	return 0;
}

static void prio_walk(struct Qdisc *sch, struct qdisc_walker *arg)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	int prio;

	if (arg->stop)
		return;

	for (prio = 0; prio < q->bands; prio++) {
		if (arg->count < arg->skip) {
			arg->count++;
			continue;
		}
		if (arg->fn(sch, prio+1, arg) < 0) {
			arg->stop = 1;
			break;
		}
		arg->count++;
	}
}

static struct tcf_proto ** prio_find_tcf(struct Qdisc *sch, unsigned long cl)
{
	struct prio_sched_data *q = qdisc_priv(sch);

	if (cl)
		return NULL;
	return &q->filter_list;
}

static const struct Qdisc_class_ops prio_class_ops = {
	.graft		=	prio_graft,
	.leaf		=	prio_leaf,
	.get		=	prio_get,
	.put		=	prio_put,
	.walk		=	prio_walk,
	.tcf_chain	=	prio_find_tcf,
	.bind_tcf	=	prio_bind,
	.unbind_tcf	=	prio_put,
	.dump		=	prio_dump_class,
	.dump_stats	=	prio_dump_class_stats,
};

static struct Qdisc_ops prio_qdisc_ops __read_mostly = {
	.next		=	NULL,
	.cl_ops		=	&prio_class_ops,
	.id		=	"prio",
	.priv_size	=	sizeof(struct prio_sched_data),
	.enqueue	=	prio_enqueue,
	.dequeue	=	prio_dequeue,
	.peek		=	prio_peek,
	.drop		=	prio_drop,
	.init		=	prio_init,
	.reset		=	prio_reset,
	.destroy	=	prio_destroy,
	.change		=	prio_tune,
	.dump		=	prio_dump,
	.owner		=	THIS_MODULE,
};

static int __init prio_module_init(void)
{
	return register_qdisc(&prio_qdisc_ops);
}

static void __exit prio_module_exit(void)
{
	unregister_qdisc(&prio_qdisc_ops);
}

module_init(prio_module_init)
module_exit(prio_module_exit)

MODULE_LICENSE("GPL");
Commit	Line	Data
1da177e4 LT	1	/*
	2	* net/sched/sch_prio.c Simple 3-band priority "scheduler".
	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>
10297b99	10	* Fixes: 19990609: J Hadi Salim <hadi@nortelnetworks.com>:
1da177e4 LT	11	* Init -- EINVAL when opt undefined
	12	*/
	13
1da177e4	14	#include <linux/module.h>
1da177e4 LT	15	#include <linux/types.h>
1da177e4 LT	16	#include <linux/kernel.h>
1da177e4	17	#include <linux/string.h>
1da177e4	18	#include <linux/errno.h>
1da177e4	19	#include <linux/skbuff.h>
dc5fc579	20	#include <net/netlink.h>
1da177e4 LT	21	#include <net/pkt_sched.h>
	22
	23
	24	struct prio_sched_data
	25	{
	26	int bands;
	27	struct tcf_proto *filter_list;
	28	u8 prio2band[TC_PRIO_MAX+1];
	29	struct Qdisc *queues[TCQ_PRIO_BANDS];
	30	};
	31
	32
	33	static struct Qdisc *
	34	prio_classify(struct sk_buff skb, struct Qdisc sch, int *qerr)
	35	{
	36	struct prio_sched_data *q = qdisc_priv(sch);
	37	u32 band = skb->priority;
	38	struct tcf_result res;
bdba91ec	39	int err;
1da177e4	40
c27f339a	41	*qerr = NET_XMIT_SUCCESS \| __NET_XMIT_BYPASS;
1da177e4	42	if (TC_H_MAJ(skb->priority) != sch->handle) {
bdba91ec	43	err = tc_classify(skb, q->filter_list, &res);
1da177e4	44	#ifdef CONFIG_NET_CLS_ACT
dbaaa07a	45	switch (err) {
1da177e4 LT	46	case TC_ACT_STOLEN:
1da177e4 LT	47	case TC_ACT_QUEUED:
378a2f09	48	*qerr = NET_XMIT_SUCCESS \| __NET_XMIT_STOLEN;
1da177e4 LT	49	case TC_ACT_SHOT:
1da177e4 LT	50	return NULL;
3ff50b79	51	}
1da177e4	52	#endif
bdba91ec	53	if (!q->filter_list \|\| err < 0) {
1da177e4 LT	54	if (TC_H_MAJ(band))
1da177e4 LT	55	band = 0;
1d8ae3fd	56	return q->queues[q->prio2band[band&TC_PRIO_MAX]];
1da177e4 LT	57	}
	58	band = res.classid;
	59	}
	60	band = TC_H_MIN(band) - 1;
3e5c2d3b	61	if (band >= q->bands)
1d8ae3fd DM	62	return q->queues[q->prio2band[0]];
1d8ae3fd DM	63
1da177e4 LT	64	return q->queues[band];
	65	}
	66
	67	static int
	68	prio_enqueue(struct sk_buff skb, struct Qdisc sch)
	69	{
	70	struct Qdisc *qdisc;
	71	int ret;
	72
	73	qdisc = prio_classify(skb, sch, &ret);
	74	#ifdef CONFIG_NET_CLS_ACT
	75	if (qdisc == NULL) {
29f1df6c	76
c27f339a	77	if (ret & __NET_XMIT_BYPASS)
1da177e4 LT	78	sch->qstats.drops++;
	79	kfree_skb(skb);
	80	return ret;
	81	}
	82	#endif
	83
5f86173b JK	84	ret = qdisc_enqueue(skb, qdisc);
5f86173b JK	85	if (ret == NET_XMIT_SUCCESS) {
0abf77e5	86	sch->bstats.bytes += qdisc_pkt_len(skb);
1da177e4 LT	87	sch->bstats.packets++;
	88	sch->q.qlen++;
	89	return NET_XMIT_SUCCESS;
	90	}
378a2f09 JP	91	if (net_xmit_drop_count(ret))
378a2f09 JP	92	sch->qstats.drops++;
10297b99	93	return ret;
1da177e4 LT	94	}
1da177e4 LT	95
48a8f519 PM	96	static struct sk_buff prio_peek(struct Qdisc sch)
	97	{
	98	struct prio_sched_data *q = qdisc_priv(sch);
	99	int prio;
	100
	101	for (prio = 0; prio < q->bands; prio++) {
	102	struct Qdisc *qdisc = q->queues[prio];
	103	struct sk_buff *skb = qdisc->ops->peek(qdisc);
	104	if (skb)
	105	return skb;
	106	}
	107	return NULL;
	108	}
1da177e4	109
1d8ae3fd	110	static struct sk_buff prio_dequeue(struct Qdisc sch)
1da177e4	111	{
1da177e4 LT	112	struct prio_sched_data *q = qdisc_priv(sch);
1da177e4 LT	113	int prio;
1da177e4 LT	114
1da177e4 LT	115	for (prio = 0; prio < q->bands; prio++) {
1d8ae3fd DM	116	struct Qdisc *qdisc = q->queues[prio];
	117	struct sk_buff *skb = qdisc->dequeue(qdisc);
	118	if (skb) {
	119	sch->q.qlen--;
	120	return skb;
1da177e4 LT	121	}
	122	}
	123	return NULL;
	124
	125	}
	126
	127	static unsigned int prio_drop(struct Qdisc* sch)
	128	{
	129	struct prio_sched_data *q = qdisc_priv(sch);
	130	int prio;
	131	unsigned int len;
	132	struct Qdisc *qdisc;
	133
	134	for (prio = q->bands-1; prio >= 0; prio--) {
	135	qdisc = q->queues[prio];
6d037a26	136	if (qdisc->ops->drop && (len = qdisc->ops->drop(qdisc)) != 0) {
1da177e4 LT	137	sch->q.qlen--;
	138	return len;
	139	}
	140	}
	141	return 0;
	142	}
	143
	144
	145	static void
	146	prio_reset(struct Qdisc* sch)
	147	{
	148	int prio;
	149	struct prio_sched_data *q = qdisc_priv(sch);
	150
	151	for (prio=0; prio<q->bands; prio++)
	152	qdisc_reset(q->queues[prio]);
	153	sch->q.qlen = 0;
	154	}
	155
	156	static void
	157	prio_destroy(struct Qdisc* sch)
	158	{
	159	int prio;
	160	struct prio_sched_data *q = qdisc_priv(sch);
1da177e4	161
ff31ab56	162	tcf_destroy_chain(&q->filter_list);
1da177e4 LT	163	for (prio=0; prio<q->bands; prio++)
	164	qdisc_destroy(q->queues[prio]);
	165	}
	166
1e90474c	167	static int prio_tune(struct Qdisc sch, struct nlattr opt)
1da177e4 LT	168	{
1da177e4 LT	169	struct prio_sched_data *q = qdisc_priv(sch);
d62733c8	170	struct tc_prio_qopt *qopt;
1da177e4 LT	171	int i;
1da177e4 LT	172
1d8ae3fd DM	173	if (nla_len(opt) < sizeof(*qopt))
	174	return -EINVAL;
	175	qopt = nla_data(opt);
d62733c8	176
1d8ae3fd	177	if (qopt->bands > TCQ_PRIO_BANDS \|\| qopt->bands < 2)
1da177e4 LT	178	return -EINVAL;
	179
	180	for (i=0; i<=TC_PRIO_MAX; i++) {
1d8ae3fd	181	if (qopt->priomap[i] >= qopt->bands)
1da177e4 LT	182	return -EINVAL;
	183	}
	184
	185	sch_tree_lock(sch);
1d8ae3fd	186	q->bands = qopt->bands;
1da177e4 LT	187	memcpy(q->prio2band, qopt->priomap, TC_PRIO_MAX+1);
	188
	189	for (i=q->bands; i<TCQ_PRIO_BANDS; i++) {
b94c8afc PM	190	struct Qdisc *child = q->queues[i];
b94c8afc PM	191	q->queues[i] = &noop_qdisc;
5e50da01 PM	192	if (child != &noop_qdisc) {
5e50da01 PM	193	qdisc_tree_decrease_qlen(child, child->q.qlen);
1da177e4	194	qdisc_destroy(child);
5e50da01	195	}
1da177e4 LT	196	}
	197	sch_tree_unlock(sch);
	198
dd914b40 AA	199	for (i=0; i<q->bands; i++) {
dd914b40 AA	200	if (q->queues[i] == &noop_qdisc) {
b94c8afc	201	struct Qdisc child, old;
5ce2d488	202	child = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
bb949fbd	203	&pfifo_qdisc_ops,
9f9afec4	204	TC_H_MAKE(sch->handle, i + 1));
1da177e4 LT	205	if (child) {
1da177e4 LT	206	sch_tree_lock(sch);
b94c8afc PM	207	old = q->queues[i];
b94c8afc PM	208	q->queues[i] = child;
1da177e4	209
b94c8afc PM	210	if (old != &noop_qdisc) {
	211	qdisc_tree_decrease_qlen(old,
	212	old->q.qlen);
	213	qdisc_destroy(old);
5e50da01	214	}
1da177e4 LT	215	sch_tree_unlock(sch);
	216	}
	217	}
	218	}
	219	return 0;
	220	}
	221
1e90474c	222	static int prio_init(struct Qdisc sch, struct nlattr opt)
1da177e4 LT	223	{
	224	struct prio_sched_data *q = qdisc_priv(sch);
	225	int i;
	226
	227	for (i=0; i<TCQ_PRIO_BANDS; i++)
	228	q->queues[i] = &noop_qdisc;
	229
	230	if (opt == NULL) {
	231	return -EINVAL;
	232	} else {
	233	int err;
	234
	235	if ((err= prio_tune(sch, opt)) != 0)
	236	return err;
	237	}
	238	return 0;
	239	}
	240
	241	static int prio_dump(struct Qdisc sch, struct sk_buff skb)
	242	{
	243	struct prio_sched_data *q = qdisc_priv(sch);
27a884dc	244	unsigned char *b = skb_tail_pointer(skb);
1da177e4 LT	245	struct tc_prio_qopt opt;
	246
	247	opt.bands = q->bands;
	248	memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX+1);
d62733c8	249
2c10b32b	250	NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
d62733c8	251
1da177e4 LT	252	return skb->len;
1da177e4 LT	253
1e90474c	254	nla_put_failure:
dc5fc579	255	nlmsg_trim(skb, b);
1da177e4 LT	256	return -1;
	257	}
	258
	259	static int prio_graft(struct Qdisc sch, unsigned long arg, struct Qdisc new,
	260	struct Qdisc **old)
	261	{
	262	struct prio_sched_data *q = qdisc_priv(sch);
	263	unsigned long band = arg - 1;
	264
1da177e4 LT	265	if (new == NULL)
	266	new = &noop_qdisc;
	267
	268	sch_tree_lock(sch);
	269	*old = q->queues[band];
	270	q->queues[band] = new;
5e50da01	271	qdisc_tree_decrease_qlen(old, (old)->q.qlen);
1da177e4 LT	272	qdisc_reset(*old);
	273	sch_tree_unlock(sch);
	274
	275	return 0;
	276	}
	277
	278	static struct Qdisc *
	279	prio_leaf(struct Qdisc *sch, unsigned long arg)
	280	{
	281	struct prio_sched_data *q = qdisc_priv(sch);
	282	unsigned long band = arg - 1;
	283
1da177e4 LT	284	return q->queues[band];
	285	}
	286
	287	static unsigned long prio_get(struct Qdisc *sch, u32 classid)
	288	{
	289	struct prio_sched_data *q = qdisc_priv(sch);
	290	unsigned long band = TC_H_MIN(classid);
	291
	292	if (band - 1 >= q->bands)
	293	return 0;
	294	return band;
	295	}
	296
	297	static unsigned long prio_bind(struct Qdisc *sch, unsigned long parent, u32 classid)
	298	{
	299	return prio_get(sch, classid);
	300	}
	301
	302
	303	static void prio_put(struct Qdisc *q, unsigned long cl)
	304	{
	305	return;
	306	}
	307
1da177e4 LT	308	static int prio_dump_class(struct Qdisc sch, unsigned long cl, struct sk_buff skb,
	309	struct tcmsg *tcm)
	310	{
	311	struct prio_sched_data *q = qdisc_priv(sch);
	312
1da177e4	313	tcm->tcm_handle \|= TC_H_MIN(cl);
5b9a9ccf	314	tcm->tcm_info = q->queues[cl-1]->handle;
1da177e4 LT	315	return 0;
	316	}
	317
2cf6c36c JP	318	static int prio_dump_class_stats(struct Qdisc *sch, unsigned long cl,
	319	struct gnet_dump *d)
	320	{
	321	struct prio_sched_data *q = qdisc_priv(sch);
	322	struct Qdisc *cl_q;
	323
	324	cl_q = q->queues[cl - 1];
	325	if (gnet_stats_copy_basic(d, &cl_q->bstats) < 0 \|\|
	326	gnet_stats_copy_queue(d, &cl_q->qstats) < 0)
	327	return -1;
	328
	329	return 0;
	330	}
	331
1da177e4 LT	332	static void prio_walk(struct Qdisc sch, struct qdisc_walker arg)
	333	{
	334	struct prio_sched_data *q = qdisc_priv(sch);
	335	int prio;
	336
	337	if (arg->stop)
	338	return;
	339
	340	for (prio = 0; prio < q->bands; prio++) {
	341	if (arg->count < arg->skip) {
	342	arg->count++;
	343	continue;
	344	}
	345	if (arg->fn(sch, prio+1, arg) < 0) {
	346	arg->stop = 1;
	347	break;
	348	}
	349	arg->count++;
	350	}
	351	}
	352
	353	static struct tcf_proto ** prio_find_tcf(struct Qdisc *sch, unsigned long cl)
	354	{
	355	struct prio_sched_data *q = qdisc_priv(sch);
	356
	357	if (cl)
	358	return NULL;
	359	return &q->filter_list;
	360	}
	361
20fea08b	362	static const struct Qdisc_class_ops prio_class_ops = {
1da177e4 LT	363	.graft = prio_graft,
	364	.leaf = prio_leaf,
	365	.get = prio_get,
	366	.put = prio_put,
1da177e4 LT	367	.walk = prio_walk,
	368	.tcf_chain = prio_find_tcf,
	369	.bind_tcf = prio_bind,
	370	.unbind_tcf = prio_put,
	371	.dump = prio_dump_class,
2cf6c36c	372	.dump_stats = prio_dump_class_stats,
1da177e4 LT	373	};
1da177e4 LT	374
20fea08b	375	static struct Qdisc_ops prio_qdisc_ops __read_mostly = {
1da177e4 LT	376	.next = NULL,
	377	.cl_ops = &prio_class_ops,
	378	.id = "prio",
	379	.priv_size = sizeof(struct prio_sched_data),
	380	.enqueue = prio_enqueue,
	381	.dequeue = prio_dequeue,
48a8f519	382	.peek = prio_peek,
1da177e4 LT	383	.drop = prio_drop,
	384	.init = prio_init,
	385	.reset = prio_reset,
	386	.destroy = prio_destroy,
	387	.change = prio_tune,
	388	.dump = prio_dump,
	389	.owner = THIS_MODULE,
	390	};
	391
	392	static int __init prio_module_init(void)
	393	{
1d8ae3fd	394	return register_qdisc(&prio_qdisc_ops);
1da177e4 LT	395	}
1da177e4 LT	396
10297b99	397	static void __exit prio_module_exit(void)
1da177e4 LT	398	{
	399	unregister_qdisc(&prio_qdisc_ops);
	400	}
	401
	402	module_init(prio_module_init)
	403	module_exit(prio_module_exit)
	404
	405	MODULE_LICENSE("GPL");