2 * Copyright (c) 2008, Intel Corporation.
4 * This program is free software; you can redistribute it and/or modify it
5 * under the terms and conditions of the GNU General Public License,
6 * version 2, as published by the Free Software Foundation.
8 * This program is distributed in the hope it will be useful, but WITHOUT
9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
13 * You should have received a copy of the GNU General Public License along with
14 * this program; if not, see <http://www.gnu.org/licenses/>.
16 * Author: Alexander Duyck <alexander.h.duyck@intel.com>
19 #include <linux/module.h>
20 #include <linux/slab.h>
21 #include <linux/types.h>
22 #include <linux/kernel.h>
23 #include <linux/string.h>
24 #include <linux/errno.h>
25 #include <linux/skbuff.h>
26 #include <net/netlink.h>
27 #include <net/pkt_sched.h>
30 struct multiq_sched_data
{
34 struct tcf_proto
*filter_list
;
35 struct Qdisc
**queues
;
40 multiq_classify(struct sk_buff
*skb
, struct Qdisc
*sch
, int *qerr
)
42 struct multiq_sched_data
*q
= qdisc_priv(sch
);
44 struct tcf_result res
;
47 *qerr
= NET_XMIT_SUCCESS
| __NET_XMIT_BYPASS
;
48 err
= tc_classify(skb
, q
->filter_list
, &res
);
49 #ifdef CONFIG_NET_CLS_ACT
53 *qerr
= NET_XMIT_SUCCESS
| __NET_XMIT_STOLEN
;
58 band
= skb_get_queue_mapping(skb
);
63 return q
->queues
[band
];
67 multiq_enqueue(struct sk_buff
*skb
, struct Qdisc
*sch
)
72 qdisc
= multiq_classify(skb
, sch
, &ret
);
73 #ifdef CONFIG_NET_CLS_ACT
76 if (ret
& __NET_XMIT_BYPASS
)
83 ret
= qdisc_enqueue(skb
, qdisc
);
84 if (ret
== NET_XMIT_SUCCESS
) {
86 return NET_XMIT_SUCCESS
;
88 if (net_xmit_drop_count(ret
))
93 static struct sk_buff
*multiq_dequeue(struct Qdisc
*sch
)
95 struct multiq_sched_data
*q
= qdisc_priv(sch
);
100 for (band
= 0; band
< q
->bands
; band
++) {
101 /* cycle through bands to ensure fairness */
103 if (q
->curband
>= q
->bands
)
106 /* Check that target subqueue is available before
107 * pulling an skb to avoid head-of-line blocking.
109 if (!netif_xmit_stopped(
110 netdev_get_tx_queue(qdisc_dev(sch
), q
->curband
))) {
111 qdisc
= q
->queues
[q
->curband
];
112 skb
= qdisc
->dequeue(qdisc
);
114 qdisc_bstats_update(sch
, skb
);
124 static struct sk_buff
*multiq_peek(struct Qdisc
*sch
)
126 struct multiq_sched_data
*q
= qdisc_priv(sch
);
127 unsigned int curband
= q
->curband
;
132 for (band
= 0; band
< q
->bands
; band
++) {
133 /* cycle through bands to ensure fairness */
135 if (curband
>= q
->bands
)
138 /* Check that target subqueue is available before
139 * pulling an skb to avoid head-of-line blocking.
141 if (!netif_xmit_stopped(
142 netdev_get_tx_queue(qdisc_dev(sch
), curband
))) {
143 qdisc
= q
->queues
[curband
];
144 skb
= qdisc
->ops
->peek(qdisc
);
153 static unsigned int multiq_drop(struct Qdisc
*sch
)
155 struct multiq_sched_data
*q
= qdisc_priv(sch
);
160 for (band
= q
->bands
- 1; band
>= 0; band
--) {
161 qdisc
= q
->queues
[band
];
162 if (qdisc
->ops
->drop
) {
163 len
= qdisc
->ops
->drop(qdisc
);
175 multiq_reset(struct Qdisc
*sch
)
178 struct multiq_sched_data
*q
= qdisc_priv(sch
);
180 for (band
= 0; band
< q
->bands
; band
++)
181 qdisc_reset(q
->queues
[band
]);
187 multiq_destroy(struct Qdisc
*sch
)
190 struct multiq_sched_data
*q
= qdisc_priv(sch
);
192 tcf_destroy_chain(&q
->filter_list
);
193 for (band
= 0; band
< q
->bands
; band
++)
194 qdisc_destroy(q
->queues
[band
]);
199 static int multiq_tune(struct Qdisc
*sch
, struct nlattr
*opt
)
201 struct multiq_sched_data
*q
= qdisc_priv(sch
);
202 struct tc_multiq_qopt
*qopt
;
205 if (!netif_is_multiqueue(qdisc_dev(sch
)))
207 if (nla_len(opt
) < sizeof(*qopt
))
210 qopt
= nla_data(opt
);
212 qopt
->bands
= qdisc_dev(sch
)->real_num_tx_queues
;
215 q
->bands
= qopt
->bands
;
216 for (i
= q
->bands
; i
< q
->max_bands
; i
++) {
217 if (q
->queues
[i
] != &noop_qdisc
) {
218 struct Qdisc
*child
= q
->queues
[i
];
219 q
->queues
[i
] = &noop_qdisc
;
220 qdisc_tree_decrease_qlen(child
, child
->q
.qlen
);
221 qdisc_destroy(child
);
225 sch_tree_unlock(sch
);
227 for (i
= 0; i
< q
->bands
; i
++) {
228 if (q
->queues
[i
] == &noop_qdisc
) {
229 struct Qdisc
*child
, *old
;
230 child
= qdisc_create_dflt(sch
->dev_queue
,
232 TC_H_MAKE(sch
->handle
,
237 q
->queues
[i
] = child
;
239 if (old
!= &noop_qdisc
) {
240 qdisc_tree_decrease_qlen(old
,
244 sch_tree_unlock(sch
);
251 static int multiq_init(struct Qdisc
*sch
, struct nlattr
*opt
)
253 struct multiq_sched_data
*q
= qdisc_priv(sch
);
261 q
->max_bands
= qdisc_dev(sch
)->num_tx_queues
;
263 q
->queues
= kcalloc(q
->max_bands
, sizeof(struct Qdisc
*), GFP_KERNEL
);
266 for (i
= 0; i
< q
->max_bands
; i
++)
267 q
->queues
[i
] = &noop_qdisc
;
269 err
= multiq_tune(sch
, opt
);
277 static int multiq_dump(struct Qdisc
*sch
, struct sk_buff
*skb
)
279 struct multiq_sched_data
*q
= qdisc_priv(sch
);
280 unsigned char *b
= skb_tail_pointer(skb
);
281 struct tc_multiq_qopt opt
;
283 opt
.bands
= q
->bands
;
284 opt
.max_bands
= q
->max_bands
;
286 if (nla_put(skb
, TCA_OPTIONS
, sizeof(opt
), &opt
))
287 goto nla_put_failure
;
296 static int multiq_graft(struct Qdisc
*sch
, unsigned long arg
, struct Qdisc
*new,
299 struct multiq_sched_data
*q
= qdisc_priv(sch
);
300 unsigned long band
= arg
- 1;
306 *old
= q
->queues
[band
];
307 q
->queues
[band
] = new;
308 qdisc_tree_decrease_qlen(*old
, (*old
)->q
.qlen
);
310 sch_tree_unlock(sch
);
315 static struct Qdisc
*
316 multiq_leaf(struct Qdisc
*sch
, unsigned long arg
)
318 struct multiq_sched_data
*q
= qdisc_priv(sch
);
319 unsigned long band
= arg
- 1;
321 return q
->queues
[band
];
324 static unsigned long multiq_get(struct Qdisc
*sch
, u32 classid
)
326 struct multiq_sched_data
*q
= qdisc_priv(sch
);
327 unsigned long band
= TC_H_MIN(classid
);
329 if (band
- 1 >= q
->bands
)
334 static unsigned long multiq_bind(struct Qdisc
*sch
, unsigned long parent
,
337 return multiq_get(sch
, classid
);
341 static void multiq_put(struct Qdisc
*q
, unsigned long cl
)
345 static int multiq_dump_class(struct Qdisc
*sch
, unsigned long cl
,
346 struct sk_buff
*skb
, struct tcmsg
*tcm
)
348 struct multiq_sched_data
*q
= qdisc_priv(sch
);
350 tcm
->tcm_handle
|= TC_H_MIN(cl
);
351 tcm
->tcm_info
= q
->queues
[cl
- 1]->handle
;
355 static int multiq_dump_class_stats(struct Qdisc
*sch
, unsigned long cl
,
358 struct multiq_sched_data
*q
= qdisc_priv(sch
);
361 cl_q
= q
->queues
[cl
- 1];
362 cl_q
->qstats
.qlen
= cl_q
->q
.qlen
;
363 if (gnet_stats_copy_basic(d
, &cl_q
->bstats
) < 0 ||
364 gnet_stats_copy_queue(d
, &cl_q
->qstats
) < 0)
370 static void multiq_walk(struct Qdisc
*sch
, struct qdisc_walker
*arg
)
372 struct multiq_sched_data
*q
= qdisc_priv(sch
);
378 for (band
= 0; band
< q
->bands
; band
++) {
379 if (arg
->count
< arg
->skip
) {
383 if (arg
->fn(sch
, band
+ 1, arg
) < 0) {
391 static struct tcf_proto
**multiq_find_tcf(struct Qdisc
*sch
, unsigned long cl
)
393 struct multiq_sched_data
*q
= qdisc_priv(sch
);
397 return &q
->filter_list
;
400 static const struct Qdisc_class_ops multiq_class_ops
= {
401 .graft
= multiq_graft
,
406 .tcf_chain
= multiq_find_tcf
,
407 .bind_tcf
= multiq_bind
,
408 .unbind_tcf
= multiq_put
,
409 .dump
= multiq_dump_class
,
410 .dump_stats
= multiq_dump_class_stats
,
413 static struct Qdisc_ops multiq_qdisc_ops __read_mostly
= {
415 .cl_ops
= &multiq_class_ops
,
417 .priv_size
= sizeof(struct multiq_sched_data
),
418 .enqueue
= multiq_enqueue
,
419 .dequeue
= multiq_dequeue
,
423 .reset
= multiq_reset
,
424 .destroy
= multiq_destroy
,
425 .change
= multiq_tune
,
427 .owner
= THIS_MODULE
,
430 static int __init
multiq_module_init(void)
432 return register_qdisc(&multiq_qdisc_ops
);
435 static void __exit
multiq_module_exit(void)
437 unregister_qdisc(&multiq_qdisc_ops
);
440 module_init(multiq_module_init
)
441 module_exit(multiq_module_exit
)
443 MODULE_LICENSE("GPL");