MINI2440: remove __initdata from some structs
[linux-2.6/mini2440.git] / net / sched / sch_multiq.c
blob7db2c88ce585f04a7361b87dec3aa2760d65f1f3
1 /*
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
11 * more details.
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 {
31 u16 bands;
32 u16 max_bands;
33 u16 curband;
34 struct tcf_proto *filter_list;
35 struct Qdisc **queues;
39 static struct Qdisc *
40 multiq_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
42 struct multiq_sched_data *q = qdisc_priv(sch);
43 u32 band;
44 struct tcf_result res;
45 int err;
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;
57 #endif
58 band = skb_get_queue_mapping(skb);
60 if (band >= q->bands)
61 return q->queues[0];
63 return q->queues[band];
66 static int
67 multiq_enqueue(struct sk_buff *skb, struct Qdisc *sch)
69 struct Qdisc *qdisc;
70 int ret;
72 qdisc = multiq_classify(skb, sch, &ret);
73 #ifdef CONFIG_NET_CLS_ACT
74 if (qdisc == NULL) {
76 if (ret & __NET_XMIT_BYPASS)
77 sch->qstats.drops++;
78 kfree_skb(skb);
79 return ret;
81 #endif
83 ret = qdisc_enqueue(skb, qdisc);
84 if (ret == NET_XMIT_SUCCESS) {
85 sch->bstats.bytes += qdisc_pkt_len(skb);
86 sch->bstats.packets++;
87 sch->q.qlen++;
88 return NET_XMIT_SUCCESS;
90 if (net_xmit_drop_count(ret))
91 sch->qstats.drops++;
92 return ret;
95 static struct sk_buff *multiq_dequeue(struct Qdisc *sch)
97 struct multiq_sched_data *q = qdisc_priv(sch);
98 struct Qdisc *qdisc;
99 struct sk_buff *skb;
100 int band;
102 for (band = 0; band < q->bands; band++) {
103 /* cycle through bands to ensure fairness */
104 q->curband++;
105 if (q->curband >= q->bands)
106 q->curband = 0;
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);
114 if (skb) {
115 sch->q.qlen--;
116 return skb;
120 return NULL;
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;
128 struct Qdisc *qdisc;
129 struct sk_buff *skb;
130 int band;
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;
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);
144 if (skb)
145 return skb;
148 return NULL;
152 static unsigned int multiq_drop(struct Qdisc *sch)
154 struct multiq_sched_data *q = qdisc_priv(sch);
155 int band;
156 unsigned int len;
157 struct Qdisc *qdisc;
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);
163 if (len != 0) {
164 sch->q.qlen--;
165 return len;
169 return 0;
173 static void
174 multiq_reset(struct Qdisc *sch)
176 u16 band;
177 struct multiq_sched_data *q = qdisc_priv(sch);
179 for (band = 0; band < q->bands; band++)
180 qdisc_reset(q->queues[band]);
181 sch->q.qlen = 0;
182 q->curband = 0;
185 static void
186 multiq_destroy(struct Qdisc *sch)
188 int band;
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]);
195 kfree(q->queues);
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;
202 int i;
204 if (!netif_is_multiqueue(qdisc_dev(sch)))
205 return -EOPNOTSUPP;
206 if (nla_len(opt) < sizeof(*qopt))
207 return -EINVAL;
209 qopt = nla_data(opt);
211 qopt->bands = qdisc_dev(sch)->real_num_tx_queues;
213 sch_tree_lock(sch);
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 = q->queues[i];
218 q->queues[i] = &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) {
228 struct Qdisc *child, *old;
229 child = qdisc_create_dflt(qdisc_dev(sch),
230 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;
239 if (old != &noop_qdisc) {
240 qdisc_tree_decrease_qlen(old,
241 old->q.qlen);
242 qdisc_destroy(old);
244 sch_tree_unlock(sch);
248 return 0;
251 static int multiq_init(struct Qdisc *sch, struct nlattr *opt)
253 struct multiq_sched_data *q = qdisc_priv(sch);
254 int i, err;
256 q->queues = NULL;
258 if (opt == NULL)
259 return -EINVAL;
261 q->max_bands = qdisc_dev(sch)->num_tx_queues;
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;
269 err = multiq_tune(sch,opt);
271 if (err)
272 kfree(q->queues);
274 return err;
277 static int multiq_dump(struct Qdisc *sch, struct sk_buff *skb)
279 struct multiq_sched_data *q = qdisc_priv(sch);
280 unsigned char *b = skb_tail_pointer(skb);
281 struct tc_multiq_qopt opt;
283 opt.bands = q->bands;
284 opt.max_bands = q->max_bands;
286 NLA_PUT(skb, TCA_OPTIONS, sizeof(opt), &opt);
288 return skb->len;
290 nla_put_failure:
291 nlmsg_trim(skb, b);
292 return -1;
295 static int multiq_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
296 struct Qdisc **old)
298 struct multiq_sched_data *q = qdisc_priv(sch);
299 unsigned long band = arg - 1;
301 if (new == NULL)
302 new = &noop_qdisc;
304 sch_tree_lock(sch);
305 *old = q->queues[band];
306 q->queues[band] = new;
307 qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
308 qdisc_reset(*old);
309 sch_tree_unlock(sch);
311 return 0;
314 static struct Qdisc *
315 multiq_leaf(struct Qdisc *sch, unsigned long arg)
317 struct multiq_sched_data *q = qdisc_priv(sch);
318 unsigned long band = arg - 1;
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)
329 return 0;
330 return band;
333 static unsigned long multiq_bind(struct Qdisc *sch, unsigned long parent,
334 u32 classid)
336 return multiq_get(sch, classid);
340 static void multiq_put(struct Qdisc *q, unsigned long cl)
342 return;
345 static int multiq_dump_class(struct Qdisc *sch, unsigned long cl,
346 struct sk_buff *skb, struct tcmsg *tcm)
348 struct multiq_sched_data *q = qdisc_priv(sch);
350 tcm->tcm_handle |= TC_H_MIN(cl);
351 tcm->tcm_info = q->queues[cl-1]->handle;
352 return 0;
355 static int multiq_dump_class_stats(struct Qdisc *sch, unsigned long cl,
356 struct gnet_dump *d)
358 struct multiq_sched_data *q = qdisc_priv(sch);
359 struct Qdisc *cl_q;
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;
367 return 0;
370 static void multiq_walk(struct Qdisc *sch, struct qdisc_walker *arg)
372 struct multiq_sched_data *q = qdisc_priv(sch);
373 int band;
375 if (arg->stop)
376 return;
378 for (band = 0; band < q->bands; band++) {
379 if (arg->count < arg->skip) {
380 arg->count++;
381 continue;
383 if (arg->fn(sch, band+1, arg) < 0) {
384 arg->stop = 1;
385 break;
387 arg->count++;
391 static struct tcf_proto **multiq_find_tcf(struct Qdisc *sch, unsigned long cl)
393 struct multiq_sched_data *q = qdisc_priv(sch);
395 if (cl)
396 return NULL;
397 return &q->filter_list;
400 static 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,
413 static 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,
430 static int __init multiq_module_init(void)
432 return register_qdisc(&multiq_qdisc_ops);
435 static void __exit multiq_module_exit(void)
437 unregister_qdisc(&multiq_qdisc_ops);
440 module_init(multiq_module_init)
441 module_exit(multiq_module_exit)
443 MODULE_LICENSE("GPL");