[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_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;
		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

	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 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 = xchg(&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;
			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);
				child = xchg(&q->queues[i], child);

				if (child != &noop_qdisc) {
					qdisc_tree_decrease_qlen(child,
								 child->q.qlen);
					qdisc_destroy(child);
				}
				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 nlattr *nest;
	struct tc_prio_qopt opt;

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

	nest = nla_nest_compat_start(skb, TCA_OPTIONS, sizeof(opt), &opt);
	if (nest == NULL)
		goto nla_put_failure;
	nla_nest_compat_end(skb, nest);

	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 (band >= q->bands)
		return -EINVAL;

	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;

	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 nlattr **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 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,
	.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,
	.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,
	.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>
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
29f1df6c	41	*qerr = 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:
	47	case TC_ACT_QUEUED:
	48	*qerr = NET_XMIT_SUCCESS;
	49	case TC_ACT_SHOT:
	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 JHS	76
29f1df6c JHS	77	if (ret == NET_XMIT_BYPASS)
1da177e4 LT	78	sch->qstats.drops++;
	79	kfree_skb(skb);
	80	return ret;
	81	}
	82	#endif
	83
	84	if ((ret = qdisc->enqueue(skb, qdisc)) == NET_XMIT_SUCCESS) {
	85	sch->bstats.bytes += skb->len;
	86	sch->bstats.packets++;
	87	sch->q.qlen++;
	88	return NET_XMIT_SUCCESS;
	89	}
	90	sch->qstats.drops++;
10297b99	91	return ret;
1da177e4 LT	92	}
	93
	94
	95	static int
	96	prio_requeue(struct sk_buff skb, struct Qdisc sch)
	97	{
	98	struct Qdisc *qdisc;
	99	int ret;
	100
	101	qdisc = prio_classify(skb, sch, &ret);
	102	#ifdef CONFIG_NET_CLS_ACT
	103	if (qdisc == NULL) {
29f1df6c	104	if (ret == NET_XMIT_BYPASS)
1da177e4 LT	105	sch->qstats.drops++;
	106	kfree_skb(skb);
	107	return ret;
	108	}
	109	#endif
	110
	111	if ((ret = qdisc->ops->requeue(skb, qdisc)) == NET_XMIT_SUCCESS) {
	112	sch->q.qlen++;
	113	sch->qstats.requeues++;
	114	return 0;
	115	}
	116	sch->qstats.drops++;
	117	return NET_XMIT_DROP;
	118	}
	119
	120
1d8ae3fd	121	static struct sk_buff prio_dequeue(struct Qdisc sch)
1da177e4	122	{
1da177e4 LT	123	struct prio_sched_data *q = qdisc_priv(sch);
1da177e4 LT	124	int prio;
1da177e4 LT	125
1da177e4 LT	126	for (prio = 0; prio < q->bands; prio++) {
1d8ae3fd DM	127	struct Qdisc *qdisc = q->queues[prio];
	128	struct sk_buff *skb = qdisc->dequeue(qdisc);
	129	if (skb) {
	130	sch->q.qlen--;
	131	return skb;
1da177e4 LT	132	}
	133	}
	134	return NULL;
	135
	136	}
	137
	138	static unsigned int prio_drop(struct Qdisc* sch)
	139	{
	140	struct prio_sched_data *q = qdisc_priv(sch);
	141	int prio;
	142	unsigned int len;
	143	struct Qdisc *qdisc;
	144
	145	for (prio = q->bands-1; prio >= 0; prio--) {
	146	qdisc = q->queues[prio];
6d037a26	147	if (qdisc->ops->drop && (len = qdisc->ops->drop(qdisc)) != 0) {
1da177e4 LT	148	sch->q.qlen--;
	149	return len;
	150	}
	151	}
	152	return 0;
	153	}
	154
	155
	156	static void
	157	prio_reset(struct Qdisc* sch)
	158	{
	159	int prio;
	160	struct prio_sched_data *q = qdisc_priv(sch);
	161
	162	for (prio=0; prio<q->bands; prio++)
	163	qdisc_reset(q->queues[prio]);
	164	sch->q.qlen = 0;
	165	}
	166
	167	static void
	168	prio_destroy(struct Qdisc* sch)
	169	{
	170	int prio;
	171	struct prio_sched_data *q = qdisc_priv(sch);
1da177e4	172
ff31ab56	173	tcf_destroy_chain(&q->filter_list);
1da177e4 LT	174	for (prio=0; prio<q->bands; prio++)
	175	qdisc_destroy(q->queues[prio]);
	176	}
	177
1e90474c	178	static int prio_tune(struct Qdisc sch, struct nlattr opt)
1da177e4 LT	179	{
1da177e4 LT	180	struct prio_sched_data *q = qdisc_priv(sch);
d62733c8	181	struct tc_prio_qopt *qopt;
1da177e4 LT	182	int i;
1da177e4 LT	183
1d8ae3fd DM	184	if (nla_len(opt) < sizeof(*qopt))
	185	return -EINVAL;
	186	qopt = nla_data(opt);
d62733c8	187
1d8ae3fd	188	if (qopt->bands > TCQ_PRIO_BANDS \|\| qopt->bands < 2)
1da177e4 LT	189	return -EINVAL;
	190
	191	for (i=0; i<=TC_PRIO_MAX; i++) {
1d8ae3fd	192	if (qopt->priomap[i] >= qopt->bands)
1da177e4 LT	193	return -EINVAL;
	194	}
	195
	196	sch_tree_lock(sch);
1d8ae3fd	197	q->bands = qopt->bands;
1da177e4 LT	198	memcpy(q->prio2band, qopt->priomap, TC_PRIO_MAX+1);
	199
	200	for (i=q->bands; i<TCQ_PRIO_BANDS; i++) {
	201	struct Qdisc *child = xchg(&q->queues[i], &noop_qdisc);
5e50da01 PM	202	if (child != &noop_qdisc) {
5e50da01 PM	203	qdisc_tree_decrease_qlen(child, child->q.qlen);
1da177e4	204	qdisc_destroy(child);
5e50da01	205	}
1da177e4 LT	206	}
	207	sch_tree_unlock(sch);
	208
dd914b40 AA	209	for (i=0; i<q->bands; i++) {
dd914b40 AA	210	if (q->queues[i] == &noop_qdisc) {
1da177e4	211	struct Qdisc *child;
5ce2d488	212	child = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
bb949fbd	213	&pfifo_qdisc_ops,
9f9afec4	214	TC_H_MAKE(sch->handle, i + 1));
1da177e4 LT	215	if (child) {
1da177e4 LT	216	sch_tree_lock(sch);
dd914b40	217	child = xchg(&q->queues[i], child);
1da177e4	218
5e50da01 PM	219	if (child != &noop_qdisc) {
	220	qdisc_tree_decrease_qlen(child,
	221	child->q.qlen);
1da177e4	222	qdisc_destroy(child);
5e50da01	223	}
1da177e4 LT	224	sch_tree_unlock(sch);
	225	}
	226	}
	227	}
	228	return 0;
	229	}
	230
1e90474c	231	static int prio_init(struct Qdisc sch, struct nlattr opt)
1da177e4 LT	232	{
	233	struct prio_sched_data *q = qdisc_priv(sch);
	234	int i;
	235
	236	for (i=0; i<TCQ_PRIO_BANDS; i++)
	237	q->queues[i] = &noop_qdisc;
	238
	239	if (opt == NULL) {
	240	return -EINVAL;
	241	} else {
	242	int err;
	243
	244	if ((err= prio_tune(sch, opt)) != 0)
	245	return err;
	246	}
	247	return 0;
	248	}
	249
	250	static int prio_dump(struct Qdisc sch, struct sk_buff skb)
	251	{
	252	struct prio_sched_data *q = qdisc_priv(sch);
27a884dc	253	unsigned char *b = skb_tail_pointer(skb);
1e90474c	254	struct nlattr *nest;
1da177e4 LT	255	struct tc_prio_qopt opt;
	256
	257	opt.bands = q->bands;
	258	memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX+1);
d62733c8	259
1e90474c PM	260	nest = nla_nest_compat_start(skb, TCA_OPTIONS, sizeof(opt), &opt);
	261	if (nest == NULL)
	262	goto nla_put_failure;
1e90474c	263	nla_nest_compat_end(skb, nest);
d62733c8	264
1da177e4 LT	265	return skb->len;
1da177e4 LT	266
1e90474c	267	nla_put_failure:
dc5fc579	268	nlmsg_trim(skb, b);
1da177e4 LT	269	return -1;
	270	}
	271
	272	static int prio_graft(struct Qdisc sch, unsigned long arg, struct Qdisc new,
	273	struct Qdisc **old)
	274	{
	275	struct prio_sched_data *q = qdisc_priv(sch);
	276	unsigned long band = arg - 1;
	277
	278	if (band >= q->bands)
	279	return -EINVAL;
	280
	281	if (new == NULL)
	282	new = &noop_qdisc;
	283
	284	sch_tree_lock(sch);
	285	*old = q->queues[band];
	286	q->queues[band] = new;
5e50da01	287	qdisc_tree_decrease_qlen(old, (old)->q.qlen);
1da177e4 LT	288	qdisc_reset(*old);
	289	sch_tree_unlock(sch);
	290
	291	return 0;
	292	}
	293
	294	static struct Qdisc *
	295	prio_leaf(struct Qdisc *sch, unsigned long arg)
	296	{
	297	struct prio_sched_data *q = qdisc_priv(sch);
	298	unsigned long band = arg - 1;
	299
	300	if (band >= q->bands)
	301	return NULL;
	302
	303	return q->queues[band];
	304	}
	305
	306	static unsigned long prio_get(struct Qdisc *sch, u32 classid)
	307	{
	308	struct prio_sched_data *q = qdisc_priv(sch);
	309	unsigned long band = TC_H_MIN(classid);
	310
	311	if (band - 1 >= q->bands)
	312	return 0;
	313	return band;
	314	}
	315
	316	static unsigned long prio_bind(struct Qdisc *sch, unsigned long parent, u32 classid)
	317	{
	318	return prio_get(sch, classid);
	319	}
	320
	321
	322	static void prio_put(struct Qdisc *q, unsigned long cl)
	323	{
	324	return;
	325	}
	326
1e90474c	327	static int prio_change(struct Qdisc sch, u32 handle, u32 parent, struct nlattr tca, unsigned long arg)
1da177e4 LT	328	{
	329	unsigned long cl = *arg;
	330	struct prio_sched_data *q = qdisc_priv(sch);
	331
	332	if (cl - 1 > q->bands)
	333	return -ENOENT;
	334	return 0;
	335	}
	336
	337	static int prio_delete(struct Qdisc *sch, unsigned long cl)
	338	{
	339	struct prio_sched_data *q = qdisc_priv(sch);
	340	if (cl - 1 > q->bands)
	341	return -ENOENT;
	342	return 0;
	343	}
	344
	345
	346	static int prio_dump_class(struct Qdisc sch, unsigned long cl, struct sk_buff skb,
	347	struct tcmsg *tcm)
	348	{
	349	struct prio_sched_data *q = qdisc_priv(sch);
	350
	351	if (cl - 1 > q->bands)
	352	return -ENOENT;
	353	tcm->tcm_handle \|= TC_H_MIN(cl);
	354	if (q->queues[cl-1])
	355	tcm->tcm_info = q->queues[cl-1]->handle;
	356	return 0;
	357	}
	358
2cf6c36c JP	359	static int prio_dump_class_stats(struct Qdisc *sch, unsigned long cl,
	360	struct gnet_dump *d)
	361	{
	362	struct prio_sched_data *q = qdisc_priv(sch);
	363	struct Qdisc *cl_q;
	364
	365	cl_q = q->queues[cl - 1];
	366	if (gnet_stats_copy_basic(d, &cl_q->bstats) < 0 \|\|
	367	gnet_stats_copy_queue(d, &cl_q->qstats) < 0)
	368	return -1;
	369
	370	return 0;
	371	}
	372
1da177e4 LT	373	static void prio_walk(struct Qdisc sch, struct qdisc_walker arg)
	374	{
	375	struct prio_sched_data *q = qdisc_priv(sch);
	376	int prio;
	377
	378	if (arg->stop)
	379	return;
	380
	381	for (prio = 0; prio < q->bands; prio++) {
	382	if (arg->count < arg->skip) {
	383	arg->count++;
	384	continue;
	385	}
	386	if (arg->fn(sch, prio+1, arg) < 0) {
	387	arg->stop = 1;
	388	break;
	389	}
	390	arg->count++;
	391	}
	392	}
	393
	394	static struct tcf_proto ** prio_find_tcf(struct Qdisc *sch, unsigned long cl)
	395	{
	396	struct prio_sched_data *q = qdisc_priv(sch);
	397
	398	if (cl)
	399	return NULL;
	400	return &q->filter_list;
	401	}
	402
20fea08b	403	static const struct Qdisc_class_ops prio_class_ops = {
1da177e4 LT	404	.graft = prio_graft,
	405	.leaf = prio_leaf,
	406	.get = prio_get,
	407	.put = prio_put,
	408	.change = prio_change,
	409	.delete = prio_delete,
	410	.walk = prio_walk,
	411	.tcf_chain = prio_find_tcf,
	412	.bind_tcf = prio_bind,
	413	.unbind_tcf = prio_put,
	414	.dump = prio_dump_class,
2cf6c36c	415	.dump_stats = prio_dump_class_stats,
1da177e4 LT	416	};
1da177e4 LT	417
20fea08b	418	static struct Qdisc_ops prio_qdisc_ops __read_mostly = {
1da177e4 LT	419	.next = NULL,
	420	.cl_ops = &prio_class_ops,
	421	.id = "prio",
	422	.priv_size = sizeof(struct prio_sched_data),
	423	.enqueue = prio_enqueue,
	424	.dequeue = prio_dequeue,
	425	.requeue = prio_requeue,
	426	.drop = prio_drop,
	427	.init = prio_init,
	428	.reset = prio_reset,
	429	.destroy = prio_destroy,
	430	.change = prio_tune,
	431	.dump = prio_dump,
	432	.owner = THIS_MODULE,
	433	};
	434
	435	static int __init prio_module_init(void)
	436	{
1d8ae3fd	437	return register_qdisc(&prio_qdisc_ops);
1da177e4 LT	438	}
1da177e4 LT	439
10297b99	440	static void __exit prio_module_exit(void)
1da177e4 LT	441	{
	442	unregister_qdisc(&prio_qdisc_ops);
	443	}
	444
	445	module_init(prio_module_init)
	446	module_exit(prio_module_exit)
	447
	448	MODULE_LICENSE("GPL");