2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* 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>
|
2007-02-09 15:25:16 +01:00
|
|
|
* Fixes: 19990609: J Hadi Salim <hadi@nortelnetworks.com>:
|
2005-04-17 00:20:36 +02:00
|
|
|
* 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>
|
2007-03-26 08:06:12 +02:00
|
|
|
#include <net/netlink.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
#include <net/pkt_sched.h>
|
|
|
|
|
|
|
|
|
|
|
|
struct prio_sched_data
|
|
|
|
{
|
|
|
|
int bands;
|
2007-06-29 06:04:31 +02:00
|
|
|
int curband; /* for round-robin */
|
2005-04-17 00:20:36 +02:00
|
|
|
struct tcf_proto *filter_list;
|
|
|
|
u8 prio2band[TC_PRIO_MAX+1];
|
|
|
|
struct Qdisc *queues[TCQ_PRIO_BANDS];
|
2007-06-29 06:04:31 +02:00
|
|
|
int mq;
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
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;
|
2007-07-31 02:07:14 +02:00
|
|
|
int err;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-01-09 07:35:55 +01:00
|
|
|
*qerr = NET_XMIT_BYPASS;
|
2005-04-17 00:20:36 +02:00
|
|
|
if (TC_H_MAJ(skb->priority) != sch->handle) {
|
2007-07-31 02:07:14 +02:00
|
|
|
err = tc_classify(skb, q->filter_list, &res);
|
2005-04-17 00:20:36 +02:00
|
|
|
#ifdef CONFIG_NET_CLS_ACT
|
2007-08-31 07:35:46 +02:00
|
|
|
switch (err) {
|
2005-04-17 00:20:36 +02:00
|
|
|
case TC_ACT_STOLEN:
|
|
|
|
case TC_ACT_QUEUED:
|
|
|
|
*qerr = NET_XMIT_SUCCESS;
|
|
|
|
case TC_ACT_SHOT:
|
|
|
|
return NULL;
|
2007-04-21 02:09:22 +02:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
#endif
|
2007-07-31 02:07:14 +02:00
|
|
|
if (!q->filter_list || err < 0) {
|
2005-04-17 00:20:36 +02:00
|
|
|
if (TC_H_MAJ(band))
|
|
|
|
band = 0;
|
2007-06-29 06:04:31 +02:00
|
|
|
band = q->prio2band[band&TC_PRIO_MAX];
|
|
|
|
goto out;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
band = res.classid;
|
|
|
|
}
|
|
|
|
band = TC_H_MIN(band) - 1;
|
2007-05-14 11:57:19 +02:00
|
|
|
if (band >= q->bands)
|
2007-06-29 06:04:31 +02:00
|
|
|
band = q->prio2band[0];
|
|
|
|
out:
|
|
|
|
if (q->mq)
|
|
|
|
skb_set_queue_mapping(skb, band);
|
2005-04-17 00:20:36 +02:00
|
|
|
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) {
|
2006-01-09 07:35:55 +01:00
|
|
|
|
|
|
|
if (ret == NET_XMIT_BYPASS)
|
2005-04-17 00:20:36 +02:00
|
|
|
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++;
|
2007-02-09 15:25:16 +01:00
|
|
|
return ret;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
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) {
|
2006-01-09 07:35:55 +01:00
|
|
|
if (ret == NET_XMIT_BYPASS)
|
2005-04-17 00:20:36 +02:00
|
|
|
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++) {
|
2007-06-29 06:04:31 +02:00
|
|
|
/* Check if the target subqueue is available before
|
|
|
|
* pulling an skb. This way we avoid excessive requeues
|
|
|
|
* for slower queues.
|
|
|
|
*/
|
2007-10-24 05:50:58 +02:00
|
|
|
if (!__netif_subqueue_stopped(sch->dev, (q->mq ? prio : 0))) {
|
2007-06-29 06:04:31 +02:00
|
|
|
qdisc = q->queues[prio];
|
|
|
|
skb = qdisc->dequeue(qdisc);
|
|
|
|
if (skb) {
|
|
|
|
sch->q.qlen--;
|
|
|
|
return skb;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2007-06-29 06:04:31 +02:00
|
|
|
static struct sk_buff *rr_dequeue(struct Qdisc* sch)
|
|
|
|
{
|
|
|
|
struct sk_buff *skb;
|
|
|
|
struct prio_sched_data *q = qdisc_priv(sch);
|
|
|
|
struct Qdisc *qdisc;
|
|
|
|
int bandcount;
|
|
|
|
|
|
|
|
/* Only take one pass through the queues. If nothing is available,
|
|
|
|
* return nothing.
|
|
|
|
*/
|
|
|
|
for (bandcount = 0; bandcount < q->bands; bandcount++) {
|
|
|
|
/* Check if the target subqueue is available before
|
|
|
|
* pulling an skb. This way we avoid excessive requeues
|
|
|
|
* for slower queues. If the queue is stopped, try the
|
|
|
|
* next queue.
|
|
|
|
*/
|
2007-10-24 05:50:58 +02:00
|
|
|
if (!__netif_subqueue_stopped(sch->dev,
|
2007-06-29 06:04:31 +02:00
|
|
|
(q->mq ? q->curband : 0))) {
|
|
|
|
qdisc = q->queues[q->curband];
|
|
|
|
skb = qdisc->dequeue(qdisc);
|
|
|
|
if (skb) {
|
|
|
|
sch->q.qlen--;
|
|
|
|
q->curband++;
|
|
|
|
if (q->curband >= q->bands)
|
|
|
|
q->curband = 0;
|
|
|
|
return skb;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
q->curband++;
|
|
|
|
if (q->curband >= q->bands)
|
|
|
|
q->curband = 0;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
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];
|
2006-03-21 04:00:49 +01:00
|
|
|
if (qdisc->ops->drop && (len = qdisc->ops->drop(qdisc)) != 0) {
|
2005-04-17 00:20:36 +02:00
|
|
|
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);
|
|
|
|
|
2007-03-23 19:29:43 +01:00
|
|
|
tcf_destroy_chain(q->filter_list);
|
2005-04-17 00:20:36 +02:00
|
|
|
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);
|
2007-06-29 06:04:31 +02:00
|
|
|
struct tc_prio_qopt *qopt;
|
|
|
|
struct rtattr *tb[TCA_PRIO_MAX];
|
2005-04-17 00:20:36 +02:00
|
|
|
int i;
|
|
|
|
|
2007-06-29 06:04:31 +02:00
|
|
|
if (rtattr_parse_nested_compat(tb, TCA_PRIO_MAX, opt, qopt,
|
|
|
|
sizeof(*qopt)))
|
2005-04-17 00:20:36 +02:00
|
|
|
return -EINVAL;
|
2007-06-29 06:04:31 +02:00
|
|
|
q->bands = qopt->bands;
|
|
|
|
/* If we're multiqueue, make sure the number of incoming bands
|
|
|
|
* matches the number of queues on the device we're associating with.
|
|
|
|
* If the number of bands requested is zero, then set q->bands to
|
2007-07-31 02:13:45 +02:00
|
|
|
* dev->egress_subqueue_count. Also, the root qdisc must be the
|
|
|
|
* only one that is enabled for multiqueue, since it's the only one
|
|
|
|
* that interacts with the underlying device.
|
2007-06-29 06:04:31 +02:00
|
|
|
*/
|
|
|
|
q->mq = RTA_GET_FLAG(tb[TCA_PRIO_MQ - 1]);
|
|
|
|
if (q->mq) {
|
2007-07-31 02:13:45 +02:00
|
|
|
if (sch->parent != TC_H_ROOT)
|
2007-06-29 06:04:31 +02:00
|
|
|
return -EINVAL;
|
|
|
|
if (netif_is_multiqueue(sch->dev)) {
|
|
|
|
if (q->bands == 0)
|
|
|
|
q->bands = sch->dev->egress_subqueue_count;
|
|
|
|
else if (q->bands != sch->dev->egress_subqueue_count)
|
|
|
|
return -EINVAL;
|
|
|
|
} else
|
|
|
|
return -EOPNOTSUPP;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (q->bands > TCQ_PRIO_BANDS || q->bands < 2)
|
2005-04-17 00:20:36 +02:00
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
for (i=0; i<=TC_PRIO_MAX; i++) {
|
2007-06-29 06:04:31 +02:00
|
|
|
if (qopt->priomap[i] >= q->bands)
|
2005-04-17 00:20:36 +02:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
sch_tree_lock(sch);
|
|
|
|
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);
|
2006-11-30 02:36:20 +01:00
|
|
|
if (child != &noop_qdisc) {
|
|
|
|
qdisc_tree_decrease_qlen(child, child->q.qlen);
|
2005-04-17 00:20:36 +02:00
|
|
|
qdisc_destroy(child);
|
2006-11-30 02:36:20 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
sch_tree_unlock(sch);
|
|
|
|
|
2006-01-17 11:24:26 +01:00
|
|
|
for (i=0; i<q->bands; i++) {
|
|
|
|
if (q->queues[i] == &noop_qdisc) {
|
2005-04-17 00:20:36 +02:00
|
|
|
struct Qdisc *child;
|
2006-11-30 02:35:18 +01:00
|
|
|
child = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops,
|
|
|
|
TC_H_MAKE(sch->handle, i + 1));
|
2005-04-17 00:20:36 +02:00
|
|
|
if (child) {
|
|
|
|
sch_tree_lock(sch);
|
2006-01-17 11:24:26 +01:00
|
|
|
child = xchg(&q->queues[i], child);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-11-30 02:36:20 +01:00
|
|
|
if (child != &noop_qdisc) {
|
|
|
|
qdisc_tree_decrease_qlen(child,
|
|
|
|
child->q.qlen);
|
2005-04-17 00:20:36 +02:00
|
|
|
qdisc_destroy(child);
|
2006-11-30 02:36:20 +01:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
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);
|
2007-04-20 05:29:13 +02:00
|
|
|
unsigned char *b = skb_tail_pointer(skb);
|
2007-06-29 06:04:31 +02:00
|
|
|
struct rtattr *nest;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct tc_prio_qopt opt;
|
|
|
|
|
|
|
|
opt.bands = q->bands;
|
|
|
|
memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX+1);
|
2007-06-29 06:04:31 +02:00
|
|
|
|
|
|
|
nest = RTA_NEST_COMPAT(skb, TCA_OPTIONS, sizeof(opt), &opt);
|
|
|
|
if (q->mq)
|
|
|
|
RTA_PUT_FLAG(skb, TCA_PRIO_MQ);
|
|
|
|
RTA_NEST_COMPAT_END(skb, nest);
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
return skb->len;
|
|
|
|
|
|
|
|
rtattr_failure:
|
2007-03-26 08:06:12 +02:00
|
|
|
nlmsg_trim(skb, b);
|
2005-04-17 00:20:36 +02:00
|
|
|
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;
|
2006-11-30 02:36:20 +01:00
|
|
|
qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
|
2005-04-17 00:20:36 +02:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2007-01-31 21:21:24 +01:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
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,
|
2007-01-31 21:21:24 +01:00
|
|
|
.dump_stats = prio_dump_class_stats,
|
2005-04-17 00:20:36 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
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,
|
|
|
|
};
|
|
|
|
|
2007-06-29 06:04:31 +02:00
|
|
|
static struct Qdisc_ops rr_qdisc_ops = {
|
|
|
|
.next = NULL,
|
|
|
|
.cl_ops = &prio_class_ops,
|
|
|
|
.id = "rr",
|
|
|
|
.priv_size = sizeof(struct prio_sched_data),
|
|
|
|
.enqueue = prio_enqueue,
|
|
|
|
.dequeue = rr_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,
|
|
|
|
};
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
static int __init prio_module_init(void)
|
|
|
|
{
|
2007-06-29 06:04:31 +02:00
|
|
|
int err;
|
|
|
|
|
|
|
|
err = register_qdisc(&prio_qdisc_ops);
|
|
|
|
if (err < 0)
|
|
|
|
return err;
|
|
|
|
err = register_qdisc(&rr_qdisc_ops);
|
|
|
|
if (err < 0)
|
|
|
|
unregister_qdisc(&prio_qdisc_ops);
|
|
|
|
return err;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2007-02-09 15:25:16 +01:00
|
|
|
static void __exit prio_module_exit(void)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
unregister_qdisc(&prio_qdisc_ops);
|
2007-06-29 06:04:31 +02:00
|
|
|
unregister_qdisc(&rr_qdisc_ops);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
module_init(prio_module_init)
|
|
|
|
module_exit(prio_module_exit)
|
|
|
|
|
|
|
|
MODULE_LICENSE("GPL");
|
2007-06-29 06:04:31 +02:00
|
|
|
MODULE_ALIAS("sch_rr");
|