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/slab.h>
22 #include <linux/types.h>
23 #include <linux/kernel.h>
24 #include <linux/string.h>
25 #include <linux/errno.h>
26 #include <linux/skbuff.h>
27 #include <net/netlink.h>
28 #include <net/pkt_sched.h>
31 struct multiq_sched_data {
35 struct tcf_proto *filter_list;
36 struct Qdisc **queues;
41 multiq_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
43 struct multiq_sched_data *q = qdisc_priv(sch);
45 struct tcf_result res;
48 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
49 err = tc_classify(skb, q->filter_list, &res);
50 #ifdef CONFIG_NET_CLS_ACT
54 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
59 band = skb_get_queue_mapping(skb);
64 return q->queues[band];
68 multiq_enqueue(struct sk_buff *skb, struct Qdisc *sch)
73 qdisc = multiq_classify(skb, sch, &ret);
74 #ifdef CONFIG_NET_CLS_ACT
77 if (ret & __NET_XMIT_BYPASS)
84 ret = qdisc_enqueue(skb, qdisc);
85 if (ret == NET_XMIT_SUCCESS) {
87 return NET_XMIT_SUCCESS;
89 if (net_xmit_drop_count(ret))
94 static struct sk_buff *multiq_dequeue(struct Qdisc *sch)
96 struct multiq_sched_data *q = qdisc_priv(sch);
101 for (band = 0; band < q->bands; band++) {
102 /* cycle through bands to ensure fairness */
104 if (q->curband >= q->bands)
107 /* Check that target subqueue is available before
108 * pulling an skb to avoid head-of-line blocking.
110 if (!netif_xmit_stopped(
111 netdev_get_tx_queue(qdisc_dev(sch), q->curband))) {
112 qdisc = q->queues[q->curband];
113 skb = qdisc->dequeue(qdisc);
115 qdisc_bstats_update(sch, skb);
125 static struct sk_buff *multiq_peek(struct Qdisc *sch)
127 struct multiq_sched_data *q = qdisc_priv(sch);
128 unsigned int curband = q->curband;
133 for (band = 0; band < q->bands; band++) {
134 /* cycle through bands to ensure fairness */
136 if (curband >= q->bands)
139 /* Check that target subqueue is available before
140 * pulling an skb to avoid head-of-line blocking.
142 if (!netif_xmit_stopped(
143 netdev_get_tx_queue(qdisc_dev(sch), curband))) {
144 qdisc = q->queues[curband];
145 skb = qdisc->ops->peek(qdisc);
154 static unsigned int multiq_drop(struct Qdisc *sch)
156 struct multiq_sched_data *q = qdisc_priv(sch);
161 for (band = q->bands - 1; band >= 0; band--) {
162 qdisc = q->queues[band];
163 if (qdisc->ops->drop) {
164 len = qdisc->ops->drop(qdisc);
176 multiq_reset(struct Qdisc *sch)
179 struct multiq_sched_data *q = qdisc_priv(sch);
181 for (band = 0; band < q->bands; band++)
182 qdisc_reset(q->queues[band]);
188 multiq_destroy(struct Qdisc *sch)
191 struct multiq_sched_data *q = qdisc_priv(sch);
193 tcf_destroy_chain(&q->filter_list);
194 for (band = 0; band < q->bands; band++)
195 qdisc_destroy(q->queues[band]);
200 static int multiq_tune(struct Qdisc *sch, struct nlattr *opt)
202 struct multiq_sched_data *q = qdisc_priv(sch);
203 struct tc_multiq_qopt *qopt;
206 if (!netif_is_multiqueue(qdisc_dev(sch)))
208 if (nla_len(opt) < sizeof(*qopt))
211 qopt = nla_data(opt);
213 qopt->bands = qdisc_dev(sch)->real_num_tx_queues;
216 q->bands = qopt->bands;
217 for (i = q->bands; i < q->max_bands; i++) {
218 if (q->queues[i] != &noop_qdisc) {
219 struct Qdisc *child = q->queues[i];
220 q->queues[i] = &noop_qdisc;
221 qdisc_tree_decrease_qlen(child, child->q.qlen);
222 qdisc_destroy(child);
226 sch_tree_unlock(sch);
228 for (i = 0; i < q->bands; i++) {
229 if (q->queues[i] == &noop_qdisc) {
230 struct Qdisc *child, *old;
231 child = qdisc_create_dflt(sch->dev_queue,
233 TC_H_MAKE(sch->handle,
238 q->queues[i] = child;
240 if (old != &noop_qdisc) {
241 qdisc_tree_decrease_qlen(old,
245 sch_tree_unlock(sch);
252 static int multiq_init(struct Qdisc *sch, struct nlattr *opt)
254 struct multiq_sched_data *q = qdisc_priv(sch);
262 q->max_bands = qdisc_dev(sch)->num_tx_queues;
264 q->queues = kcalloc(q->max_bands, sizeof(struct Qdisc *), GFP_KERNEL);
267 for (i = 0; i < q->max_bands; i++)
268 q->queues[i] = &noop_qdisc;
270 err = multiq_tune(sch, opt);
278 static int multiq_dump(struct Qdisc *sch, struct sk_buff *skb)
280 struct multiq_sched_data *q = qdisc_priv(sch);
281 unsigned char *b = skb_tail_pointer(skb);
282 struct tc_multiq_qopt opt;
284 opt.bands = q->bands;
285 opt.max_bands = q->max_bands;
287 if (nla_put(skb, TCA_OPTIONS, sizeof(opt), &opt))
288 goto nla_put_failure;
297 static int multiq_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
300 struct multiq_sched_data *q = qdisc_priv(sch);
301 unsigned long band = arg - 1;
307 *old = q->queues[band];
308 q->queues[band] = new;
309 qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
311 sch_tree_unlock(sch);
316 static struct Qdisc *
317 multiq_leaf(struct Qdisc *sch, unsigned long arg)
319 struct multiq_sched_data *q = qdisc_priv(sch);
320 unsigned long band = arg - 1;
322 return q->queues[band];
325 static unsigned long multiq_get(struct Qdisc *sch, u32 classid)
327 struct multiq_sched_data *q = qdisc_priv(sch);
328 unsigned long band = TC_H_MIN(classid);
330 if (band - 1 >= q->bands)
335 static unsigned long multiq_bind(struct Qdisc *sch, unsigned long parent,
338 return multiq_get(sch, classid);
342 static void multiq_put(struct Qdisc *q, unsigned long cl)
346 static int multiq_dump_class(struct Qdisc *sch, unsigned long cl,
347 struct sk_buff *skb, struct tcmsg *tcm)
349 struct multiq_sched_data *q = qdisc_priv(sch);
351 tcm->tcm_handle |= TC_H_MIN(cl);
352 tcm->tcm_info = q->queues[cl - 1]->handle;
356 static int multiq_dump_class_stats(struct Qdisc *sch, unsigned long cl,
359 struct multiq_sched_data *q = qdisc_priv(sch);
362 cl_q = q->queues[cl - 1];
363 cl_q->qstats.qlen = cl_q->q.qlen;
364 if (gnet_stats_copy_basic(d, &cl_q->bstats) < 0 ||
365 gnet_stats_copy_queue(d, &cl_q->qstats) < 0)
371 static void multiq_walk(struct Qdisc *sch, struct qdisc_walker *arg)
373 struct multiq_sched_data *q = qdisc_priv(sch);
379 for (band = 0; band < q->bands; band++) {
380 if (arg->count < arg->skip) {
384 if (arg->fn(sch, band + 1, arg) < 0) {
392 static struct tcf_proto **multiq_find_tcf(struct Qdisc *sch, unsigned long cl)
394 struct multiq_sched_data *q = qdisc_priv(sch);
398 return &q->filter_list;
401 static const struct Qdisc_class_ops multiq_class_ops = {
402 .graft = multiq_graft,
407 .tcf_chain = multiq_find_tcf,
408 .bind_tcf = multiq_bind,
409 .unbind_tcf = multiq_put,
410 .dump = multiq_dump_class,
411 .dump_stats = multiq_dump_class_stats,
414 static struct Qdisc_ops multiq_qdisc_ops __read_mostly = {
416 .cl_ops = &multiq_class_ops,
418 .priv_size = sizeof(struct multiq_sched_data),
419 .enqueue = multiq_enqueue,
420 .dequeue = multiq_dequeue,
424 .reset = multiq_reset,
425 .destroy = multiq_destroy,
426 .change = multiq_tune,
428 .owner = THIS_MODULE,
431 static int __init multiq_module_init(void)
433 return register_qdisc(&multiq_qdisc_ops);
436 static void __exit multiq_module_exit(void)
438 unregister_qdisc(&multiq_qdisc_ops);
441 module_init(multiq_module_init)
442 module_exit(multiq_module_exit)
444 MODULE_LICENSE("GPL");