[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/slab.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 __rcu *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;
	struct tcf_proto *fl;
	int err;

	*qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
	if (TC_H_MAJ(skb->priority) != sch->handle) {
		fl = rcu_dereference_bh(q->filter_list);
		err = tc_classify(skb, fl, &res, false);
#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 (!fl || 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)
			qdisc_qstats_drop(sch);
		kfree_skb(skb);
		return ret;
	}
#endif

	ret = qdisc_enqueue(skb, qdisc);
	if (ret == NET_XMIT_SUCCESS) {
		qdisc_qstats_backlog_inc(sch, skb);
		sch->q.qlen++;
		return NET_XMIT_SUCCESS;
	}
	if (net_xmit_drop_count(ret))
		qdisc_qstats_drop(sch);
	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_peeked(qdisc);
		if (skb) {
			qdisc_bstats_update(sch, skb);
			qdisc_qstats_backlog_dec(sch, 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->qstats.backlog -= len;
			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->qstats.backlog = 0;
	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_reduce_backlog(child, child->q.qlen, child->qstats.backlog);
			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(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_reduce_backlog(old,
								  old->q.qlen,
								  old->qstats.backlog);
					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);

	if (nla_put(skb, TCA_OPTIONS, sizeof(opt), &opt))
		goto nla_put_failure;

	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;

	*old = qdisc_replace(sch, new, &q->queues[band]);
	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)
{
}

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