net: sched: sch: add extack to change class
[linux-2.6-block.git] / net / sched / sch_prio.c
CommitLineData
1da177e4
LT
1/*
2 * net/sched/sch_prio.c Simple 3-band priority "scheduler".
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
8 *
9 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
10297b99 10 * Fixes: 19990609: J Hadi Salim <hadi@nortelnetworks.com>:
1da177e4
LT
11 * Init -- EINVAL when opt undefined
12 */
13
1da177e4 14#include <linux/module.h>
5a0e3ad6 15#include <linux/slab.h>
1da177e4
LT
16#include <linux/types.h>
17#include <linux/kernel.h>
1da177e4 18#include <linux/string.h>
1da177e4 19#include <linux/errno.h>
1da177e4 20#include <linux/skbuff.h>
dc5fc579 21#include <net/netlink.h>
1da177e4 22#include <net/pkt_sched.h>
cf1facda 23#include <net/pkt_cls.h>
1da177e4 24
cc7ec456 25struct prio_sched_data {
1da177e4 26 int bands;
25d8c0d5 27 struct tcf_proto __rcu *filter_list;
6529eaba 28 struct tcf_block *block;
1da177e4
LT
29 u8 prio2band[TC_PRIO_MAX+1];
30 struct Qdisc *queues[TCQ_PRIO_BANDS];
31};
32
33
34static struct Qdisc *
35prio_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
36{
37 struct prio_sched_data *q = qdisc_priv(sch);
38 u32 band = skb->priority;
39 struct tcf_result res;
25d8c0d5 40 struct tcf_proto *fl;
bdba91ec 41 int err;
1da177e4 42
c27f339a 43 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
1da177e4 44 if (TC_H_MAJ(skb->priority) != sch->handle) {
25d8c0d5 45 fl = rcu_dereference_bh(q->filter_list);
87d83093 46 err = tcf_classify(skb, fl, &res, false);
1da177e4 47#ifdef CONFIG_NET_CLS_ACT
dbaaa07a 48 switch (err) {
1da177e4
LT
49 case TC_ACT_STOLEN:
50 case TC_ACT_QUEUED:
e25ea21f 51 case TC_ACT_TRAP:
378a2f09 52 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
f3ae608e 53 /* fall through */
1da177e4
LT
54 case TC_ACT_SHOT:
55 return NULL;
3ff50b79 56 }
1da177e4 57#endif
25d8c0d5 58 if (!fl || err < 0) {
1da177e4
LT
59 if (TC_H_MAJ(band))
60 band = 0;
cc7ec456 61 return q->queues[q->prio2band[band & TC_PRIO_MAX]];
1da177e4
LT
62 }
63 band = res.classid;
64 }
65 band = TC_H_MIN(band) - 1;
3e5c2d3b 66 if (band >= q->bands)
1d8ae3fd
DM
67 return q->queues[q->prio2band[0]];
68
1da177e4
LT
69 return q->queues[band];
70}
71
72static int
520ac30f 73prio_enqueue(struct sk_buff *skb, struct Qdisc *sch, struct sk_buff **to_free)
1da177e4
LT
74{
75 struct Qdisc *qdisc;
76 int ret;
77
78 qdisc = prio_classify(skb, sch, &ret);
79#ifdef CONFIG_NET_CLS_ACT
80 if (qdisc == NULL) {
29f1df6c 81
c27f339a 82 if (ret & __NET_XMIT_BYPASS)
25331d6c 83 qdisc_qstats_drop(sch);
39ad1297 84 __qdisc_drop(skb, to_free);
1da177e4
LT
85 return ret;
86 }
87#endif
88
520ac30f 89 ret = qdisc_enqueue(skb, qdisc, to_free);
5f86173b 90 if (ret == NET_XMIT_SUCCESS) {
6529d75a 91 qdisc_qstats_backlog_inc(sch, skb);
1da177e4
LT
92 sch->q.qlen++;
93 return NET_XMIT_SUCCESS;
94 }
378a2f09 95 if (net_xmit_drop_count(ret))
25331d6c 96 qdisc_qstats_drop(sch);
10297b99 97 return ret;
1da177e4
LT
98}
99
48a8f519
PM
100static struct sk_buff *prio_peek(struct Qdisc *sch)
101{
102 struct prio_sched_data *q = qdisc_priv(sch);
103 int prio;
104
105 for (prio = 0; prio < q->bands; prio++) {
106 struct Qdisc *qdisc = q->queues[prio];
107 struct sk_buff *skb = qdisc->ops->peek(qdisc);
108 if (skb)
109 return skb;
110 }
111 return NULL;
112}
1da177e4 113
cc7ec456 114static struct sk_buff *prio_dequeue(struct Qdisc *sch)
1da177e4 115{
1da177e4
LT
116 struct prio_sched_data *q = qdisc_priv(sch);
117 int prio;
1da177e4
LT
118
119 for (prio = 0; prio < q->bands; prio++) {
1d8ae3fd 120 struct Qdisc *qdisc = q->queues[prio];
3557619f 121 struct sk_buff *skb = qdisc_dequeue_peeked(qdisc);
1d8ae3fd 122 if (skb) {
9190b3b3 123 qdisc_bstats_update(sch, skb);
6529d75a 124 qdisc_qstats_backlog_dec(sch, skb);
1d8ae3fd
DM
125 sch->q.qlen--;
126 return skb;
1da177e4
LT
127 }
128 }
129 return NULL;
130
131}
132
1da177e4 133static void
cc7ec456 134prio_reset(struct Qdisc *sch)
1da177e4
LT
135{
136 int prio;
137 struct prio_sched_data *q = qdisc_priv(sch);
138
cc7ec456 139 for (prio = 0; prio < q->bands; prio++)
1da177e4 140 qdisc_reset(q->queues[prio]);
6529d75a 141 sch->qstats.backlog = 0;
1da177e4
LT
142 sch->q.qlen = 0;
143}
144
145static void
cc7ec456 146prio_destroy(struct Qdisc *sch)
1da177e4
LT
147{
148 int prio;
149 struct prio_sched_data *q = qdisc_priv(sch);
1da177e4 150
6529eaba 151 tcf_block_put(q->block);
cc7ec456 152 for (prio = 0; prio < q->bands; prio++)
1da177e4
LT
153 qdisc_destroy(q->queues[prio]);
154}
155
2030721c
AA
156static int prio_tune(struct Qdisc *sch, struct nlattr *opt,
157 struct netlink_ext_ack *extack)
1da177e4
LT
158{
159 struct prio_sched_data *q = qdisc_priv(sch);
3d7c8257
ED
160 struct Qdisc *queues[TCQ_PRIO_BANDS];
161 int oldbands = q->bands, i;
d62733c8 162 struct tc_prio_qopt *qopt;
1da177e4 163
1d8ae3fd
DM
164 if (nla_len(opt) < sizeof(*qopt))
165 return -EINVAL;
166 qopt = nla_data(opt);
d62733c8 167
1d8ae3fd 168 if (qopt->bands > TCQ_PRIO_BANDS || qopt->bands < 2)
1da177e4
LT
169 return -EINVAL;
170
cc7ec456 171 for (i = 0; i <= TC_PRIO_MAX; i++) {
1d8ae3fd 172 if (qopt->priomap[i] >= qopt->bands)
1da177e4
LT
173 return -EINVAL;
174 }
175
3d7c8257
ED
176 /* Before commit, make sure we can allocate all new qdiscs */
177 for (i = oldbands; i < qopt->bands; i++) {
178 queues[i] = qdisc_create_dflt(sch->dev_queue, &pfifo_qdisc_ops,
179 TC_H_MAKE(sch->handle, i + 1));
180 if (!queues[i]) {
181 while (i > oldbands)
182 qdisc_destroy(queues[--i]);
183 return -ENOMEM;
184 }
185 }
186
1da177e4 187 sch_tree_lock(sch);
1d8ae3fd 188 q->bands = qopt->bands;
1da177e4
LT
189 memcpy(q->prio2band, qopt->priomap, TC_PRIO_MAX+1);
190
3d7c8257 191 for (i = q->bands; i < oldbands; i++) {
b94c8afc 192 struct Qdisc *child = q->queues[i];
1da177e4 193
3d7c8257
ED
194 qdisc_tree_reduce_backlog(child, child->q.qlen,
195 child->qstats.backlog);
196 qdisc_destroy(child);
1da177e4 197 }
cbdf4511 198
49b49971 199 for (i = oldbands; i < q->bands; i++) {
3d7c8257 200 q->queues[i] = queues[i];
49b49971
JK
201 if (q->queues[i] != &noop_qdisc)
202 qdisc_hash_add(q->queues[i], true);
203 }
cbdf4511 204
3d7c8257 205 sch_tree_unlock(sch);
1da177e4
LT
206 return 0;
207}
208
e63d7dfd
AA
209static int prio_init(struct Qdisc *sch, struct nlattr *opt,
210 struct netlink_ext_ack *extack)
1da177e4 211{
6529eaba
JP
212 struct prio_sched_data *q = qdisc_priv(sch);
213 int err;
214
3d7c8257 215 if (!opt)
1da177e4 216 return -EINVAL;
1da177e4 217
69d78ef2 218 err = tcf_block_get(&q->block, &q->filter_list, sch);
6529eaba
JP
219 if (err)
220 return err;
221
2030721c 222 return prio_tune(sch, opt, extack);
1da177e4
LT
223}
224
225static int prio_dump(struct Qdisc *sch, struct sk_buff *skb)
226{
227 struct prio_sched_data *q = qdisc_priv(sch);
27a884dc 228 unsigned char *b = skb_tail_pointer(skb);
1da177e4
LT
229 struct tc_prio_qopt opt;
230
231 opt.bands = q->bands;
cc7ec456 232 memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX + 1);
d62733c8 233
1b34ec43
DM
234 if (nla_put(skb, TCA_OPTIONS, sizeof(opt), &opt))
235 goto nla_put_failure;
d62733c8 236
1da177e4
LT
237 return skb->len;
238
1e90474c 239nla_put_failure:
dc5fc579 240 nlmsg_trim(skb, b);
1da177e4
LT
241 return -1;
242}
243
244static int prio_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
245 struct Qdisc **old)
246{
247 struct prio_sched_data *q = qdisc_priv(sch);
248 unsigned long band = arg - 1;
249
1da177e4
LT
250 if (new == NULL)
251 new = &noop_qdisc;
252
86a7996c 253 *old = qdisc_replace(sch, new, &q->queues[band]);
1da177e4
LT
254 return 0;
255}
256
257static struct Qdisc *
258prio_leaf(struct Qdisc *sch, unsigned long arg)
259{
260 struct prio_sched_data *q = qdisc_priv(sch);
261 unsigned long band = arg - 1;
262
1da177e4
LT
263 return q->queues[band];
264}
265
143976ce 266static unsigned long prio_find(struct Qdisc *sch, u32 classid)
1da177e4
LT
267{
268 struct prio_sched_data *q = qdisc_priv(sch);
269 unsigned long band = TC_H_MIN(classid);
270
271 if (band - 1 >= q->bands)
272 return 0;
273 return band;
274}
275
276static unsigned long prio_bind(struct Qdisc *sch, unsigned long parent, u32 classid)
277{
143976ce 278 return prio_find(sch, classid);
1da177e4
LT
279}
280
281
143976ce 282static void prio_unbind(struct Qdisc *q, unsigned long cl)
1da177e4 283{
1da177e4
LT
284}
285
1da177e4
LT
286static int prio_dump_class(struct Qdisc *sch, unsigned long cl, struct sk_buff *skb,
287 struct tcmsg *tcm)
288{
289 struct prio_sched_data *q = qdisc_priv(sch);
290
1da177e4 291 tcm->tcm_handle |= TC_H_MIN(cl);
5b9a9ccf 292 tcm->tcm_info = q->queues[cl-1]->handle;
1da177e4
LT
293 return 0;
294}
295
2cf6c36c
JP
296static int prio_dump_class_stats(struct Qdisc *sch, unsigned long cl,
297 struct gnet_dump *d)
298{
299 struct prio_sched_data *q = qdisc_priv(sch);
300 struct Qdisc *cl_q;
301
302 cl_q = q->queues[cl - 1];
edb09eb1
ED
303 if (gnet_stats_copy_basic(qdisc_root_sleeping_running(sch),
304 d, NULL, &cl_q->bstats) < 0 ||
b0ab6f92 305 gnet_stats_copy_queue(d, NULL, &cl_q->qstats, cl_q->q.qlen) < 0)
2cf6c36c
JP
306 return -1;
307
308 return 0;
309}
310
1da177e4
LT
311static void prio_walk(struct Qdisc *sch, struct qdisc_walker *arg)
312{
313 struct prio_sched_data *q = qdisc_priv(sch);
314 int prio;
315
316 if (arg->stop)
317 return;
318
319 for (prio = 0; prio < q->bands; prio++) {
320 if (arg->count < arg->skip) {
321 arg->count++;
322 continue;
323 }
cc7ec456 324 if (arg->fn(sch, prio + 1, arg) < 0) {
1da177e4
LT
325 arg->stop = 1;
326 break;
327 }
328 arg->count++;
329 }
330}
331
6529eaba 332static struct tcf_block *prio_tcf_block(struct Qdisc *sch, unsigned long cl)
1da177e4
LT
333{
334 struct prio_sched_data *q = qdisc_priv(sch);
335
336 if (cl)
337 return NULL;
6529eaba 338 return q->block;
1da177e4
LT
339}
340
20fea08b 341static const struct Qdisc_class_ops prio_class_ops = {
1da177e4
LT
342 .graft = prio_graft,
343 .leaf = prio_leaf,
143976ce 344 .find = prio_find,
1da177e4 345 .walk = prio_walk,
6529eaba 346 .tcf_block = prio_tcf_block,
1da177e4 347 .bind_tcf = prio_bind,
143976ce 348 .unbind_tcf = prio_unbind,
1da177e4 349 .dump = prio_dump_class,
2cf6c36c 350 .dump_stats = prio_dump_class_stats,
1da177e4
LT
351};
352
20fea08b 353static struct Qdisc_ops prio_qdisc_ops __read_mostly = {
1da177e4
LT
354 .next = NULL,
355 .cl_ops = &prio_class_ops,
356 .id = "prio",
357 .priv_size = sizeof(struct prio_sched_data),
358 .enqueue = prio_enqueue,
359 .dequeue = prio_dequeue,
48a8f519 360 .peek = prio_peek,
1da177e4
LT
361 .init = prio_init,
362 .reset = prio_reset,
363 .destroy = prio_destroy,
364 .change = prio_tune,
365 .dump = prio_dump,
366 .owner = THIS_MODULE,
367};
368
369static int __init prio_module_init(void)
370{
1d8ae3fd 371 return register_qdisc(&prio_qdisc_ops);
1da177e4
LT
372}
373
10297b99 374static void __exit prio_module_exit(void)
1da177e4
LT
375{
376 unregister_qdisc(&prio_qdisc_ops);
377}
378
379module_init(prio_module_init)
380module_exit(prio_module_exit)
381
382MODULE_LICENSE("GPL");