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