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))
97 multiq_requeue(struct sk_buff *skb, struct Qdisc *sch)
102 qdisc = multiq_classify(skb, sch, &ret);
103 #ifdef CONFIG_NET_CLS_ACT
105 if (ret & __NET_XMIT_BYPASS)
112 ret = qdisc->ops->requeue(skb, qdisc);
113 if (ret == NET_XMIT_SUCCESS) {
115 sch->qstats.requeues++;
116 return NET_XMIT_SUCCESS;
118 if (net_xmit_drop_count(ret))
124 static struct sk_buff *multiq_dequeue(struct Qdisc *sch)
126 struct multiq_sched_data *q = qdisc_priv(sch);
131 for (band = 0; band < q->bands; band++) {
132 /* cycle through bands to ensure fairness */
134 if (q->curband >= q->bands)
137 /* Check that target subqueue is available before
138 * pulling an skb to avoid excessive requeues
140 if (!__netif_subqueue_stopped(qdisc_dev(sch), q->curband)) {
141 qdisc = q->queues[q->curband];
142 skb = qdisc->dequeue(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 struct Qdisc *child = xchg(&q->queues[i], &noop_qdisc);
218 if (child != &noop_qdisc) {
219 qdisc_tree_decrease_qlen(child, child->q.qlen);
220 qdisc_destroy(child);
224 sch_tree_unlock(sch);
226 for (i = 0; i < q->bands; i++) {
227 if (q->queues[i] == &noop_qdisc) {
229 child = qdisc_create_dflt(qdisc_dev(sch),
232 TC_H_MAKE(sch->handle,
236 child = xchg(&q->queues[i], child);
238 if (child != &noop_qdisc) {
239 qdisc_tree_decrease_qlen(child,
241 qdisc_destroy(child);
243 sch_tree_unlock(sch);
250 static int multiq_init(struct Qdisc *sch, struct nlattr *opt)
252 struct multiq_sched_data *q = qdisc_priv(sch);
260 q->max_bands = qdisc_dev(sch)->num_tx_queues;
262 q->queues = kcalloc(q->max_bands, sizeof(struct Qdisc *), GFP_KERNEL);
265 for (i = 0; i < q->max_bands; i++)
266 q->queues[i] = &noop_qdisc;
268 return multiq_tune(sch, opt);
271 static int multiq_dump(struct Qdisc *sch, struct sk_buff *skb)
273 struct multiq_sched_data *q = qdisc_priv(sch);
274 unsigned char *b = skb_tail_pointer(skb);
275 struct tc_multiq_qopt opt;
277 opt.bands = q->bands;
278 opt.max_bands = q->max_bands;
280 NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
289 static int multiq_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
292 struct multiq_sched_data *q = qdisc_priv(sch);
293 unsigned long band = arg - 1;
295 if (band >= q->bands)
302 *old = q->queues[band];
303 q->queues[band] = new;
304 qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
306 sch_tree_unlock(sch);
311 static struct Qdisc *
312 multiq_leaf(struct Qdisc *sch, unsigned long arg)
314 struct multiq_sched_data *q = qdisc_priv(sch);
315 unsigned long band = arg - 1;
317 if (band >= q->bands)
320 return q->queues[band];
323 static unsigned long multiq_get(struct Qdisc *sch, u32 classid)
325 struct multiq_sched_data *q = qdisc_priv(sch);
326 unsigned long band = TC_H_MIN(classid);
328 if (band - 1 >= q->bands)
333 static unsigned long multiq_bind(struct Qdisc *sch, unsigned long parent,
336 return multiq_get(sch, classid);
340 static void multiq_put(struct Qdisc *q, unsigned long cl)
345 static int multiq_change(struct Qdisc *sch, u32 handle, u32 parent,
346 struct nlattr **tca, unsigned long *arg)
348 unsigned long cl = *arg;
349 struct multiq_sched_data *q = qdisc_priv(sch);
351 if (cl - 1 > q->bands)
356 static int multiq_delete(struct Qdisc *sch, unsigned long cl)
358 struct multiq_sched_data *q = qdisc_priv(sch);
359 if (cl - 1 > q->bands)
365 static int multiq_dump_class(struct Qdisc *sch, unsigned long cl,
366 struct sk_buff *skb, struct tcmsg *tcm)
368 struct multiq_sched_data *q = qdisc_priv(sch);
370 if (cl - 1 > q->bands)
372 tcm->tcm_handle |= TC_H_MIN(cl);
374 tcm->tcm_info = q->queues[cl-1]->handle;
378 static int multiq_dump_class_stats(struct Qdisc *sch, unsigned long cl,
381 struct multiq_sched_data *q = qdisc_priv(sch);
384 cl_q = q->queues[cl - 1];
385 if (gnet_stats_copy_basic(d, &cl_q->bstats) < 0 ||
386 gnet_stats_copy_queue(d, &cl_q->qstats) < 0)
392 static void multiq_walk(struct Qdisc *sch, struct qdisc_walker *arg)
394 struct multiq_sched_data *q = qdisc_priv(sch);
400 for (band = 0; band < q->bands; band++) {
401 if (arg->count < arg->skip) {
405 if (arg->fn(sch, band+1, arg) < 0) {
413 static struct tcf_proto **multiq_find_tcf(struct Qdisc *sch, unsigned long cl)
415 struct multiq_sched_data *q = qdisc_priv(sch);
419 return &q->filter_list;
422 static const struct Qdisc_class_ops multiq_class_ops = {
423 .graft = multiq_graft,
427 .change = multiq_change,
428 .delete = multiq_delete,
430 .tcf_chain = multiq_find_tcf,
431 .bind_tcf = multiq_bind,
432 .unbind_tcf = multiq_put,
433 .dump = multiq_dump_class,
434 .dump_stats = multiq_dump_class_stats,
437 static struct Qdisc_ops multiq_qdisc_ops __read_mostly = {
439 .cl_ops = &multiq_class_ops,
441 .priv_size = sizeof(struct multiq_sched_data),
442 .enqueue = multiq_enqueue,
443 .dequeue = multiq_dequeue,
444 .requeue = multiq_requeue,
447 .reset = multiq_reset,
448 .destroy = multiq_destroy,
449 .change = multiq_tune,
451 .owner = THIS_MODULE,
454 static int __init multiq_module_init(void)
456 return register_qdisc(&multiq_qdisc_ops);
459 static void __exit multiq_module_exit(void)
461 unregister_qdisc(&multiq_qdisc_ops);
464 module_init(multiq_module_init)
465 module_exit(multiq_module_exit)
467 MODULE_LICENSE("GPL");