[net-next-2.6.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 *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(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)
{
}

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