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, write to the Free Software Foundation, Inc., 59 Temple
15 * Place - Suite 330, Boston, MA 02111-1307 USA.
17 * Author: Alexander Duyck <alexander.h.duyck@intel.com>
20 #include <linux/module.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) {
85 sch->bstats.bytes += qdisc_pkt_len(skb);
86 sch->bstats.packets++;
88 return NET_XMIT_SUCCESS;
90 if (net_xmit_drop_count(ret))
95 static struct sk_buff *multiq_dequeue(struct Qdisc *sch)
97 struct multiq_sched_data *q = qdisc_priv(sch);
102 for (band = 0; band < q->bands; band++) {
103 /* cycle through bands to ensure fairness */
105 if (q->curband >= q->bands)
108 /* Check that target subqueue is available before
109 * pulling an skb to avoid head-of-line blocking.
111 if (!__netif_subqueue_stopped(qdisc_dev(sch), q->curband)) {
112 qdisc = q->queues[q->curband];
113 skb = qdisc->dequeue(qdisc);
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_subqueue_stopped(qdisc_dev(sch), curband)) {
142 qdisc = q->queues[curband];
143 skb = qdisc->ops->peek(qdisc);
152 static unsigned int multiq_drop(struct Qdisc *sch)
154 struct multiq_sched_data *q = qdisc_priv(sch);
159 for (band = q->bands-1; band >= 0; band--) {
160 qdisc = q->queues[band];
161 if (qdisc->ops->drop) {
162 len = qdisc->ops->drop(qdisc);
174 multiq_reset(struct Qdisc *sch)
177 struct multiq_sched_data *q = qdisc_priv(sch);
179 for (band = 0; band < q->bands; band++)
180 qdisc_reset(q->queues[band]);
186 multiq_destroy(struct Qdisc *sch)
189 struct multiq_sched_data *q = qdisc_priv(sch);
191 tcf_destroy_chain(&q->filter_list);
192 for (band = 0; band < q->bands; band++)
193 qdisc_destroy(q->queues[band]);
198 static int multiq_tune(struct Qdisc *sch, struct nlattr *opt)
200 struct multiq_sched_data *q = qdisc_priv(sch);
201 struct tc_multiq_qopt *qopt;
204 if (!netif_is_multiqueue(qdisc_dev(sch)))
206 if (nla_len(opt) < sizeof(*qopt))
209 qopt = nla_data(opt);
211 qopt->bands = qdisc_dev(sch)->real_num_tx_queues;
214 q->bands = qopt->bands;
215 for (i = q->bands; i < q->max_bands; i++) {
216 if (q->queues[i] != &noop_qdisc) {
217 struct Qdisc *child = xchg(&q->queues[i], &noop_qdisc);
218 qdisc_tree_decrease_qlen(child, child->q.qlen);
219 qdisc_destroy(child);
223 sch_tree_unlock(sch);
225 for (i = 0; i < q->bands; i++) {
226 if (q->queues[i] == &noop_qdisc) {
228 child = qdisc_create_dflt(qdisc_dev(sch),
231 TC_H_MAKE(sch->handle,
235 child = xchg(&q->queues[i], child);
237 if (child != &noop_qdisc) {
238 qdisc_tree_decrease_qlen(child,
240 qdisc_destroy(child);
242 sch_tree_unlock(sch);
249 static int multiq_init(struct Qdisc *sch, struct nlattr *opt)
251 struct multiq_sched_data *q = qdisc_priv(sch);
259 q->max_bands = qdisc_dev(sch)->num_tx_queues;
261 q->queues = kcalloc(q->max_bands, sizeof(struct Qdisc *), GFP_KERNEL);
264 for (i = 0; i < q->max_bands; i++)
265 q->queues[i] = &noop_qdisc;
267 err = multiq_tune(sch,opt);
275 static int multiq_dump(struct Qdisc *sch, struct sk_buff *skb)
277 struct multiq_sched_data *q = qdisc_priv(sch);
278 unsigned char *b = skb_tail_pointer(skb);
279 struct tc_multiq_qopt opt;
281 opt.bands = q->bands;
282 opt.max_bands = q->max_bands;
284 NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
293 static int multiq_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
296 struct multiq_sched_data *q = qdisc_priv(sch);
297 unsigned long band = arg - 1;
299 if (band >= q->bands)
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 if (band >= q->bands)
324 return q->queues[band];
327 static unsigned long multiq_get(struct Qdisc *sch, u32 classid)
329 struct multiq_sched_data *q = qdisc_priv(sch);
330 unsigned long band = TC_H_MIN(classid);
332 if (band - 1 >= q->bands)
337 static unsigned long multiq_bind(struct Qdisc *sch, unsigned long parent,
340 return multiq_get(sch, classid);
344 static void multiq_put(struct Qdisc *q, unsigned long cl)
349 static int multiq_change(struct Qdisc *sch, u32 handle, u32 parent,
350 struct nlattr **tca, unsigned long *arg)
352 unsigned long cl = *arg;
353 struct multiq_sched_data *q = qdisc_priv(sch);
355 if (cl - 1 > q->bands)
360 static int multiq_delete(struct Qdisc *sch, unsigned long cl)
362 struct multiq_sched_data *q = qdisc_priv(sch);
363 if (cl - 1 > q->bands)
369 static int multiq_dump_class(struct Qdisc *sch, unsigned long cl,
370 struct sk_buff *skb, struct tcmsg *tcm)
372 struct multiq_sched_data *q = qdisc_priv(sch);
374 if (cl - 1 > q->bands)
376 tcm->tcm_handle |= TC_H_MIN(cl);
378 tcm->tcm_info = q->queues[cl-1]->handle;
382 static int multiq_dump_class_stats(struct Qdisc *sch, unsigned long cl,
385 struct multiq_sched_data *q = qdisc_priv(sch);
388 cl_q = q->queues[cl - 1];
389 if (gnet_stats_copy_basic(d, &cl_q->bstats) < 0 ||
390 gnet_stats_copy_queue(d, &cl_q->qstats) < 0)
396 static void multiq_walk(struct Qdisc *sch, struct qdisc_walker *arg)
398 struct multiq_sched_data *q = qdisc_priv(sch);
404 for (band = 0; band < q->bands; band++) {
405 if (arg->count < arg->skip) {
409 if (arg->fn(sch, band+1, arg) < 0) {
417 static struct tcf_proto **multiq_find_tcf(struct Qdisc *sch, unsigned long cl)
419 struct multiq_sched_data *q = qdisc_priv(sch);
423 return &q->filter_list;
426 static const struct Qdisc_class_ops multiq_class_ops = {
427 .graft = multiq_graft,
431 .change = multiq_change,
432 .delete = multiq_delete,
434 .tcf_chain = multiq_find_tcf,
435 .bind_tcf = multiq_bind,
436 .unbind_tcf = multiq_put,
437 .dump = multiq_dump_class,
438 .dump_stats = multiq_dump_class_stats,
441 static struct Qdisc_ops multiq_qdisc_ops __read_mostly = {
443 .cl_ops = &multiq_class_ops,
445 .priv_size = sizeof(struct multiq_sched_data),
446 .enqueue = multiq_enqueue,
447 .dequeue = multiq_dequeue,
451 .reset = multiq_reset,
452 .destroy = multiq_destroy,
453 .change = multiq_tune,
455 .owner = THIS_MODULE,
458 static int __init multiq_module_init(void)
460 return register_qdisc(&multiq_qdisc_ops);
463 static void __exit multiq_module_exit(void)
465 unregister_qdisc(&multiq_qdisc_ops);
468 module_init(multiq_module_init)
469 module_exit(multiq_module_exit)
471 MODULE_LICENSE("GPL");