Loading...
1/*
2 * Copyright (c) 2008, Intel Corporation.
3 *
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.
7 *
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
11 * more details.
12 *
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/>.
15 *
16 * Author: Alexander Duyck <alexander.h.duyck@intel.com>
17 */
18
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>
28
29
30struct multiq_sched_data {
31 u16 bands;
32 u16 max_bands;
33 u16 curband;
34 struct tcf_proto *filter_list;
35 struct Qdisc **queues;
36};
37
38
39static struct Qdisc *
40multiq_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
41{
42 struct multiq_sched_data *q = qdisc_priv(sch);
43 u32 band;
44 struct tcf_result res;
45 int err;
46
47 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
48 err = tc_classify(skb, q->filter_list, &res);
49#ifdef CONFIG_NET_CLS_ACT
50 switch (err) {
51 case TC_ACT_STOLEN:
52 case TC_ACT_QUEUED:
53 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
54 case TC_ACT_SHOT:
55 return NULL;
56 }
57#endif
58 band = skb_get_queue_mapping(skb);
59
60 if (band >= q->bands)
61 return q->queues[0];
62
63 return q->queues[band];
64}
65
66static int
67multiq_enqueue(struct sk_buff *skb, struct Qdisc *sch)
68{
69 struct Qdisc *qdisc;
70 int ret;
71
72 qdisc = multiq_classify(skb, sch, &ret);
73#ifdef CONFIG_NET_CLS_ACT
74 if (qdisc == NULL) {
75
76 if (ret & __NET_XMIT_BYPASS)
77 sch->qstats.drops++;
78 kfree_skb(skb);
79 return ret;
80 }
81#endif
82
83 ret = qdisc_enqueue(skb, qdisc);
84 if (ret == NET_XMIT_SUCCESS) {
85 sch->q.qlen++;
86 return NET_XMIT_SUCCESS;
87 }
88 if (net_xmit_drop_count(ret))
89 sch->qstats.drops++;
90 return ret;
91}
92
93static struct sk_buff *multiq_dequeue(struct Qdisc *sch)
94{
95 struct multiq_sched_data *q = qdisc_priv(sch);
96 struct Qdisc *qdisc;
97 struct sk_buff *skb;
98 int band;
99
100 for (band = 0; band < q->bands; band++) {
101 /* cycle through bands to ensure fairness */
102 q->curband++;
103 if (q->curband >= q->bands)
104 q->curband = 0;
105
106 /* Check that target subqueue is available before
107 * pulling an skb to avoid head-of-line blocking.
108 */
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);
113 if (skb) {
114 qdisc_bstats_update(sch, skb);
115 sch->q.qlen--;
116 return skb;
117 }
118 }
119 }
120 return NULL;
121
122}
123
124static struct sk_buff *multiq_peek(struct Qdisc *sch)
125{
126 struct multiq_sched_data *q = qdisc_priv(sch);
127 unsigned int curband = q->curband;
128 struct Qdisc *qdisc;
129 struct sk_buff *skb;
130 int band;
131
132 for (band = 0; band < q->bands; band++) {
133 /* cycle through bands to ensure fairness */
134 curband++;
135 if (curband >= q->bands)
136 curband = 0;
137
138 /* Check that target subqueue is available before
139 * pulling an skb to avoid head-of-line blocking.
140 */
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);
145 if (skb)
146 return skb;
147 }
148 }
149 return NULL;
150
151}
152
153static unsigned int multiq_drop(struct Qdisc *sch)
154{
155 struct multiq_sched_data *q = qdisc_priv(sch);
156 int band;
157 unsigned int len;
158 struct Qdisc *qdisc;
159
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);
164 if (len != 0) {
165 sch->q.qlen--;
166 return len;
167 }
168 }
169 }
170 return 0;
171}
172
173
174static void
175multiq_reset(struct Qdisc *sch)
176{
177 u16 band;
178 struct multiq_sched_data *q = qdisc_priv(sch);
179
180 for (band = 0; band < q->bands; band++)
181 qdisc_reset(q->queues[band]);
182 sch->q.qlen = 0;
183 q->curband = 0;
184}
185
186static void
187multiq_destroy(struct Qdisc *sch)
188{
189 int band;
190 struct multiq_sched_data *q = qdisc_priv(sch);
191
192 tcf_destroy_chain(&q->filter_list);
193 for (band = 0; band < q->bands; band++)
194 qdisc_destroy(q->queues[band]);
195
196 kfree(q->queues);
197}
198
199static int multiq_tune(struct Qdisc *sch, struct nlattr *opt)
200{
201 struct multiq_sched_data *q = qdisc_priv(sch);
202 struct tc_multiq_qopt *qopt;
203 int i;
204
205 if (!netif_is_multiqueue(qdisc_dev(sch)))
206 return -EOPNOTSUPP;
207 if (nla_len(opt) < sizeof(*qopt))
208 return -EINVAL;
209
210 qopt = nla_data(opt);
211
212 qopt->bands = qdisc_dev(sch)->real_num_tx_queues;
213
214 sch_tree_lock(sch);
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);
222 }
223 }
224
225 sch_tree_unlock(sch);
226
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,
231 &pfifo_qdisc_ops,
232 TC_H_MAKE(sch->handle,
233 i + 1));
234 if (child) {
235 sch_tree_lock(sch);
236 old = q->queues[i];
237 q->queues[i] = child;
238
239 if (old != &noop_qdisc) {
240 qdisc_tree_decrease_qlen(old,
241 old->q.qlen);
242 qdisc_destroy(old);
243 }
244 sch_tree_unlock(sch);
245 }
246 }
247 }
248 return 0;
249}
250
251static int multiq_init(struct Qdisc *sch, struct nlattr *opt)
252{
253 struct multiq_sched_data *q = qdisc_priv(sch);
254 int i, err;
255
256 q->queues = NULL;
257
258 if (opt == NULL)
259 return -EINVAL;
260
261 q->max_bands = qdisc_dev(sch)->num_tx_queues;
262
263 q->queues = kcalloc(q->max_bands, sizeof(struct Qdisc *), GFP_KERNEL);
264 if (!q->queues)
265 return -ENOBUFS;
266 for (i = 0; i < q->max_bands; i++)
267 q->queues[i] = &noop_qdisc;
268
269 err = multiq_tune(sch, opt);
270
271 if (err)
272 kfree(q->queues);
273
274 return err;
275}
276
277static int multiq_dump(struct Qdisc *sch, struct sk_buff *skb)
278{
279 struct multiq_sched_data *q = qdisc_priv(sch);
280 unsigned char *b = skb_tail_pointer(skb);
281 struct tc_multiq_qopt opt;
282
283 opt.bands = q->bands;
284 opt.max_bands = q->max_bands;
285
286 if (nla_put(skb, TCA_OPTIONS, sizeof(opt), &opt))
287 goto nla_put_failure;
288
289 return skb->len;
290
291nla_put_failure:
292 nlmsg_trim(skb, b);
293 return -1;
294}
295
296static int multiq_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
297 struct Qdisc **old)
298{
299 struct multiq_sched_data *q = qdisc_priv(sch);
300 unsigned long band = arg - 1;
301
302 if (new == NULL)
303 new = &noop_qdisc;
304
305 sch_tree_lock(sch);
306 *old = q->queues[band];
307 q->queues[band] = new;
308 qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
309 qdisc_reset(*old);
310 sch_tree_unlock(sch);
311
312 return 0;
313}
314
315static struct Qdisc *
316multiq_leaf(struct Qdisc *sch, unsigned long arg)
317{
318 struct multiq_sched_data *q = qdisc_priv(sch);
319 unsigned long band = arg - 1;
320
321 return q->queues[band];
322}
323
324static unsigned long multiq_get(struct Qdisc *sch, u32 classid)
325{
326 struct multiq_sched_data *q = qdisc_priv(sch);
327 unsigned long band = TC_H_MIN(classid);
328
329 if (band - 1 >= q->bands)
330 return 0;
331 return band;
332}
333
334static unsigned long multiq_bind(struct Qdisc *sch, unsigned long parent,
335 u32 classid)
336{
337 return multiq_get(sch, classid);
338}
339
340
341static void multiq_put(struct Qdisc *q, unsigned long cl)
342{
343}
344
345static int multiq_dump_class(struct Qdisc *sch, unsigned long cl,
346 struct sk_buff *skb, struct tcmsg *tcm)
347{
348 struct multiq_sched_data *q = qdisc_priv(sch);
349
350 tcm->tcm_handle |= TC_H_MIN(cl);
351 tcm->tcm_info = q->queues[cl - 1]->handle;
352 return 0;
353}
354
355static int multiq_dump_class_stats(struct Qdisc *sch, unsigned long cl,
356 struct gnet_dump *d)
357{
358 struct multiq_sched_data *q = qdisc_priv(sch);
359 struct Qdisc *cl_q;
360
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)
365 return -1;
366
367 return 0;
368}
369
370static void multiq_walk(struct Qdisc *sch, struct qdisc_walker *arg)
371{
372 struct multiq_sched_data *q = qdisc_priv(sch);
373 int band;
374
375 if (arg->stop)
376 return;
377
378 for (band = 0; band < q->bands; band++) {
379 if (arg->count < arg->skip) {
380 arg->count++;
381 continue;
382 }
383 if (arg->fn(sch, band + 1, arg) < 0) {
384 arg->stop = 1;
385 break;
386 }
387 arg->count++;
388 }
389}
390
391static struct tcf_proto **multiq_find_tcf(struct Qdisc *sch, unsigned long cl)
392{
393 struct multiq_sched_data *q = qdisc_priv(sch);
394
395 if (cl)
396 return NULL;
397 return &q->filter_list;
398}
399
400static const struct Qdisc_class_ops multiq_class_ops = {
401 .graft = multiq_graft,
402 .leaf = multiq_leaf,
403 .get = multiq_get,
404 .put = multiq_put,
405 .walk = multiq_walk,
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,
411};
412
413static struct Qdisc_ops multiq_qdisc_ops __read_mostly = {
414 .next = NULL,
415 .cl_ops = &multiq_class_ops,
416 .id = "multiq",
417 .priv_size = sizeof(struct multiq_sched_data),
418 .enqueue = multiq_enqueue,
419 .dequeue = multiq_dequeue,
420 .peek = multiq_peek,
421 .drop = multiq_drop,
422 .init = multiq_init,
423 .reset = multiq_reset,
424 .destroy = multiq_destroy,
425 .change = multiq_tune,
426 .dump = multiq_dump,
427 .owner = THIS_MODULE,
428};
429
430static int __init multiq_module_init(void)
431{
432 return register_qdisc(&multiq_qdisc_ops);
433}
434
435static void __exit multiq_module_exit(void)
436{
437 unregister_qdisc(&multiq_qdisc_ops);
438}
439
440module_init(multiq_module_init)
441module_exit(multiq_module_exit)
442
443MODULE_LICENSE("GPL");
1/*
2 * Copyright (c) 2008, Intel Corporation.
3 *
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.
7 *
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
11 * more details.
12 *
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/>.
15 *
16 * Author: Alexander Duyck <alexander.h.duyck@intel.com>
17 */
18
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>
28
29
30struct multiq_sched_data {
31 u16 bands;
32 u16 max_bands;
33 u16 curband;
34 struct tcf_proto __rcu *filter_list;
35 struct Qdisc **queues;
36};
37
38
39static struct Qdisc *
40multiq_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
41{
42 struct multiq_sched_data *q = qdisc_priv(sch);
43 u32 band;
44 struct tcf_result res;
45 struct tcf_proto *fl = rcu_dereference_bh(q->filter_list);
46 int err;
47
48 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
49 err = tc_classify(skb, fl, &res, false);
50#ifdef CONFIG_NET_CLS_ACT
51 switch (err) {
52 case TC_ACT_STOLEN:
53 case TC_ACT_QUEUED:
54 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
55 case TC_ACT_SHOT:
56 return NULL;
57 }
58#endif
59 band = skb_get_queue_mapping(skb);
60
61 if (band >= q->bands)
62 return q->queues[0];
63
64 return q->queues[band];
65}
66
67static int
68multiq_enqueue(struct sk_buff *skb, struct Qdisc *sch)
69{
70 struct Qdisc *qdisc;
71 int ret;
72
73 qdisc = multiq_classify(skb, sch, &ret);
74#ifdef CONFIG_NET_CLS_ACT
75 if (qdisc == NULL) {
76
77 if (ret & __NET_XMIT_BYPASS)
78 qdisc_qstats_drop(sch);
79 kfree_skb(skb);
80 return ret;
81 }
82#endif
83
84 ret = qdisc_enqueue(skb, qdisc);
85 if (ret == NET_XMIT_SUCCESS) {
86 sch->q.qlen++;
87 return NET_XMIT_SUCCESS;
88 }
89 if (net_xmit_drop_count(ret))
90 qdisc_qstats_drop(sch);
91 return ret;
92}
93
94static struct sk_buff *multiq_dequeue(struct Qdisc *sch)
95{
96 struct multiq_sched_data *q = qdisc_priv(sch);
97 struct Qdisc *qdisc;
98 struct sk_buff *skb;
99 int band;
100
101 for (band = 0; band < q->bands; band++) {
102 /* cycle through bands to ensure fairness */
103 q->curband++;
104 if (q->curband >= q->bands)
105 q->curband = 0;
106
107 /* Check that target subqueue is available before
108 * pulling an skb to avoid head-of-line blocking.
109 */
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);
114 if (skb) {
115 qdisc_bstats_update(sch, skb);
116 sch->q.qlen--;
117 return skb;
118 }
119 }
120 }
121 return NULL;
122
123}
124
125static struct sk_buff *multiq_peek(struct Qdisc *sch)
126{
127 struct multiq_sched_data *q = qdisc_priv(sch);
128 unsigned int curband = q->curband;
129 struct Qdisc *qdisc;
130 struct sk_buff *skb;
131 int band;
132
133 for (band = 0; band < q->bands; band++) {
134 /* cycle through bands to ensure fairness */
135 curband++;
136 if (curband >= q->bands)
137 curband = 0;
138
139 /* Check that target subqueue is available before
140 * pulling an skb to avoid head-of-line blocking.
141 */
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);
146 if (skb)
147 return skb;
148 }
149 }
150 return NULL;
151
152}
153
154static unsigned int multiq_drop(struct Qdisc *sch)
155{
156 struct multiq_sched_data *q = qdisc_priv(sch);
157 int band;
158 unsigned int len;
159 struct Qdisc *qdisc;
160
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);
165 if (len != 0) {
166 sch->q.qlen--;
167 return len;
168 }
169 }
170 }
171 return 0;
172}
173
174
175static void
176multiq_reset(struct Qdisc *sch)
177{
178 u16 band;
179 struct multiq_sched_data *q = qdisc_priv(sch);
180
181 for (band = 0; band < q->bands; band++)
182 qdisc_reset(q->queues[band]);
183 sch->q.qlen = 0;
184 q->curband = 0;
185}
186
187static void
188multiq_destroy(struct Qdisc *sch)
189{
190 int band;
191 struct multiq_sched_data *q = qdisc_priv(sch);
192
193 tcf_destroy_chain(&q->filter_list);
194 for (band = 0; band < q->bands; band++)
195 qdisc_destroy(q->queues[band]);
196
197 kfree(q->queues);
198}
199
200static int multiq_tune(struct Qdisc *sch, struct nlattr *opt)
201{
202 struct multiq_sched_data *q = qdisc_priv(sch);
203 struct tc_multiq_qopt *qopt;
204 int i;
205
206 if (!netif_is_multiqueue(qdisc_dev(sch)))
207 return -EOPNOTSUPP;
208 if (nla_len(opt) < sizeof(*qopt))
209 return -EINVAL;
210
211 qopt = nla_data(opt);
212
213 qopt->bands = qdisc_dev(sch)->real_num_tx_queues;
214
215 sch_tree_lock(sch);
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_reduce_backlog(child, child->q.qlen,
222 child->qstats.backlog);
223 qdisc_destroy(child);
224 }
225 }
226
227 sch_tree_unlock(sch);
228
229 for (i = 0; i < q->bands; i++) {
230 if (q->queues[i] == &noop_qdisc) {
231 struct Qdisc *child, *old;
232 child = qdisc_create_dflt(sch->dev_queue,
233 &pfifo_qdisc_ops,
234 TC_H_MAKE(sch->handle,
235 i + 1));
236 if (child) {
237 sch_tree_lock(sch);
238 old = q->queues[i];
239 q->queues[i] = child;
240
241 if (old != &noop_qdisc) {
242 qdisc_tree_reduce_backlog(old,
243 old->q.qlen,
244 old->qstats.backlog);
245 qdisc_destroy(old);
246 }
247 sch_tree_unlock(sch);
248 }
249 }
250 }
251 return 0;
252}
253
254static int multiq_init(struct Qdisc *sch, struct nlattr *opt)
255{
256 struct multiq_sched_data *q = qdisc_priv(sch);
257 int i, err;
258
259 q->queues = NULL;
260
261 if (opt == NULL)
262 return -EINVAL;
263
264 q->max_bands = qdisc_dev(sch)->num_tx_queues;
265
266 q->queues = kcalloc(q->max_bands, sizeof(struct Qdisc *), GFP_KERNEL);
267 if (!q->queues)
268 return -ENOBUFS;
269 for (i = 0; i < q->max_bands; i++)
270 q->queues[i] = &noop_qdisc;
271
272 err = multiq_tune(sch, opt);
273
274 if (err)
275 kfree(q->queues);
276
277 return err;
278}
279
280static int multiq_dump(struct Qdisc *sch, struct sk_buff *skb)
281{
282 struct multiq_sched_data *q = qdisc_priv(sch);
283 unsigned char *b = skb_tail_pointer(skb);
284 struct tc_multiq_qopt opt;
285
286 opt.bands = q->bands;
287 opt.max_bands = q->max_bands;
288
289 if (nla_put(skb, TCA_OPTIONS, sizeof(opt), &opt))
290 goto nla_put_failure;
291
292 return skb->len;
293
294nla_put_failure:
295 nlmsg_trim(skb, b);
296 return -1;
297}
298
299static int multiq_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
300 struct Qdisc **old)
301{
302 struct multiq_sched_data *q = qdisc_priv(sch);
303 unsigned long band = arg - 1;
304
305 if (new == NULL)
306 new = &noop_qdisc;
307
308 *old = qdisc_replace(sch, new, &q->queues[band]);
309 return 0;
310}
311
312static struct Qdisc *
313multiq_leaf(struct Qdisc *sch, unsigned long arg)
314{
315 struct multiq_sched_data *q = qdisc_priv(sch);
316 unsigned long band = arg - 1;
317
318 return q->queues[band];
319}
320
321static unsigned long multiq_get(struct Qdisc *sch, u32 classid)
322{
323 struct multiq_sched_data *q = qdisc_priv(sch);
324 unsigned long band = TC_H_MIN(classid);
325
326 if (band - 1 >= q->bands)
327 return 0;
328 return band;
329}
330
331static unsigned long multiq_bind(struct Qdisc *sch, unsigned long parent,
332 u32 classid)
333{
334 return multiq_get(sch, classid);
335}
336
337
338static void multiq_put(struct Qdisc *q, unsigned long cl)
339{
340}
341
342static int multiq_dump_class(struct Qdisc *sch, unsigned long cl,
343 struct sk_buff *skb, struct tcmsg *tcm)
344{
345 struct multiq_sched_data *q = qdisc_priv(sch);
346
347 tcm->tcm_handle |= TC_H_MIN(cl);
348 tcm->tcm_info = q->queues[cl - 1]->handle;
349 return 0;
350}
351
352static int multiq_dump_class_stats(struct Qdisc *sch, unsigned long cl,
353 struct gnet_dump *d)
354{
355 struct multiq_sched_data *q = qdisc_priv(sch);
356 struct Qdisc *cl_q;
357
358 cl_q = q->queues[cl - 1];
359 if (gnet_stats_copy_basic(d, NULL, &cl_q->bstats) < 0 ||
360 gnet_stats_copy_queue(d, NULL, &cl_q->qstats, cl_q->q.qlen) < 0)
361 return -1;
362
363 return 0;
364}
365
366static void multiq_walk(struct Qdisc *sch, struct qdisc_walker *arg)
367{
368 struct multiq_sched_data *q = qdisc_priv(sch);
369 int band;
370
371 if (arg->stop)
372 return;
373
374 for (band = 0; band < q->bands; band++) {
375 if (arg->count < arg->skip) {
376 arg->count++;
377 continue;
378 }
379 if (arg->fn(sch, band + 1, arg) < 0) {
380 arg->stop = 1;
381 break;
382 }
383 arg->count++;
384 }
385}
386
387static struct tcf_proto __rcu **multiq_find_tcf(struct Qdisc *sch,
388 unsigned long cl)
389{
390 struct multiq_sched_data *q = qdisc_priv(sch);
391
392 if (cl)
393 return NULL;
394 return &q->filter_list;
395}
396
397static const struct Qdisc_class_ops multiq_class_ops = {
398 .graft = multiq_graft,
399 .leaf = multiq_leaf,
400 .get = multiq_get,
401 .put = multiq_put,
402 .walk = multiq_walk,
403 .tcf_chain = multiq_find_tcf,
404 .bind_tcf = multiq_bind,
405 .unbind_tcf = multiq_put,
406 .dump = multiq_dump_class,
407 .dump_stats = multiq_dump_class_stats,
408};
409
410static struct Qdisc_ops multiq_qdisc_ops __read_mostly = {
411 .next = NULL,
412 .cl_ops = &multiq_class_ops,
413 .id = "multiq",
414 .priv_size = sizeof(struct multiq_sched_data),
415 .enqueue = multiq_enqueue,
416 .dequeue = multiq_dequeue,
417 .peek = multiq_peek,
418 .drop = multiq_drop,
419 .init = multiq_init,
420 .reset = multiq_reset,
421 .destroy = multiq_destroy,
422 .change = multiq_tune,
423 .dump = multiq_dump,
424 .owner = THIS_MODULE,
425};
426
427static int __init multiq_module_init(void)
428{
429 return register_qdisc(&multiq_qdisc_ops);
430}
431
432static void __exit multiq_module_exit(void)
433{
434 unregister_qdisc(&multiq_qdisc_ops);
435}
436
437module_init(multiq_module_init)
438module_exit(multiq_module_exit)
439
440MODULE_LICENSE("GPL");