[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 <asm/uaccess.h>
#include <asm/system.h>
#include <linux/bitops.h>
#include <linux/types.h>
#include <linux/kernel.h>
#include <linux/sched.h>
#include <linux/string.h>
#include <linux/mm.h>
#include <linux/socket.h>
#include <linux/sockios.h>
#include <linux/in.h>
#include <linux/errno.h>
#include <linux/interrupt.h>
#include <linux/if_ether.h>
#include <linux/inet.h>
#include <linux/netdevice.h>
#include <linux/etherdevice.h>
#include <linux/notifier.h>
#include <net/ip.h>
#include <net/route.h>
#include <linux/skbuff.h>
#include <net/sock.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;

	*qerr = NET_XMIT_BYPASS;
	if (TC_H_MAJ(skb->priority) != sch->handle) {
#ifdef CONFIG_NET_CLS_ACT
		switch (tc_classify(skb, q->filter_list, &res)) {
		case TC_ACT_STOLEN:
		case TC_ACT_QUEUED:
			*qerr = NET_XMIT_SUCCESS;
		case TC_ACT_SHOT:
			return NULL;
		};

		if (!q->filter_list ) {
#else
		if (!q->filter_list || tc_classify(skb, q->filter_list, &res)) {
#endif
			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

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


static int
prio_requeue(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

	if ((ret = qdisc->ops->requeue(skb, qdisc)) == NET_XMIT_SUCCESS) {
		sch->q.qlen++;
		sch->qstats.requeues++;
		return 0;
	}
	sch->qstats.drops++;
	return NET_XMIT_DROP;
}


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

	for (prio = 0; prio < q->bands; prio++) {
		qdisc = q->queues[prio];
		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);
	struct tcf_proto *tp;

	while ((tp = q->filter_list) != NULL) {
		q->filter_list = tp->next;
		tcf_destroy(tp);
	}

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

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

	if (opt->rta_len < RTA_LENGTH(sizeof(*qopt)))
		return -EINVAL;
	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 = xchg(&q->queues[i], &noop_qdisc);
		if (child != &noop_qdisc)
			qdisc_destroy(child);
	}
	sch_tree_unlock(sch);

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

				if (child != &noop_qdisc)
					qdisc_destroy(child);
				sch_tree_unlock(sch);
			}
		}
	}
	return 0;
}

static int prio_init(struct Qdisc *sch, struct rtattr *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;
	struct tc_prio_qopt opt;

	opt.bands = q->bands;
	memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX+1);
	RTA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
	return skb->len;

rtattr_failure:
	skb_trim(skb, b - skb->data);
	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 (band >= q->bands)
		return -EINVAL;

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

	sch_tree_lock(sch);
	*old = q->queues[band];
	q->queues[band] = new;
	sch->q.qlen -= (*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;

	if (band >= q->bands)
		return NULL;

	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_change(struct Qdisc *sch, u32 handle, u32 parent, struct rtattr **tca, unsigned long *arg)
{
	unsigned long cl = *arg;
	struct prio_sched_data *q = qdisc_priv(sch);

	if (cl - 1 > q->bands)
		return -ENOENT;
	return 0;
}

static int prio_delete(struct Qdisc *sch, unsigned long cl)
{
	struct prio_sched_data *q = qdisc_priv(sch);
	if (cl - 1 > q->bands)
		return -ENOENT;
	return 0;
}


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);

	if (cl - 1 > q->bands)
		return -ENOENT;
	tcm->tcm_handle |= TC_H_MIN(cl);
	if (q->queues[cl-1])
		tcm->tcm_info = q->queues[cl-1]->handle;
	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 struct Qdisc_class_ops prio_class_ops = {
	.graft		=	prio_graft,
	.leaf		=	prio_leaf,
	.get		=	prio_get,
	.put		=	prio_put,
	.change		=	prio_change,
	.delete		=	prio_delete,
	.walk		=	prio_walk,
	.tcf_chain	=	prio_find_tcf,
	.bind_tcf	=	prio_bind,
	.unbind_tcf	=	prio_put,
	.dump		=	prio_dump_class,
};

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