Commit | Line | Data |
---|---|---|
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 LT |
22 | #include <net/pkt_sched.h> |
23 | ||
24 | ||
cc7ec456 | 25 | struct prio_sched_data { |
1da177e4 LT |
26 | int bands; |
27 | struct tcf_proto *filter_list; | |
28 | u8 prio2band[TC_PRIO_MAX+1]; | |
29 | struct Qdisc *queues[TCQ_PRIO_BANDS]; | |
30 | }; | |
31 | ||
32 | ||
33 | static struct Qdisc * | |
34 | prio_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr) | |
35 | { | |
36 | struct prio_sched_data *q = qdisc_priv(sch); | |
37 | u32 band = skb->priority; | |
38 | struct tcf_result res; | |
bdba91ec | 39 | int err; |
1da177e4 | 40 | |
c27f339a | 41 | *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS; |
1da177e4 | 42 | if (TC_H_MAJ(skb->priority) != sch->handle) { |
bdba91ec | 43 | err = tc_classify(skb, q->filter_list, &res); |
1da177e4 | 44 | #ifdef CONFIG_NET_CLS_ACT |
dbaaa07a | 45 | switch (err) { |
1da177e4 LT |
46 | case TC_ACT_STOLEN: |
47 | case TC_ACT_QUEUED: | |
378a2f09 | 48 | *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN; |
1da177e4 LT |
49 | case TC_ACT_SHOT: |
50 | return NULL; | |
3ff50b79 | 51 | } |
1da177e4 | 52 | #endif |
bdba91ec | 53 | if (!q->filter_list || err < 0) { |
1da177e4 LT |
54 | if (TC_H_MAJ(band)) |
55 | band = 0; | |
cc7ec456 | 56 | return q->queues[q->prio2band[band & TC_PRIO_MAX]]; |
1da177e4 LT |
57 | } |
58 | band = res.classid; | |
59 | } | |
60 | band = TC_H_MIN(band) - 1; | |
3e5c2d3b | 61 | if (band >= q->bands) |
1d8ae3fd DM |
62 | return q->queues[q->prio2band[0]]; |
63 | ||
1da177e4 LT |
64 | return q->queues[band]; |
65 | } | |
66 | ||
67 | static int | |
68 | prio_enqueue(struct sk_buff *skb, struct Qdisc *sch) | |
69 | { | |
70 | struct Qdisc *qdisc; | |
71 | int ret; | |
72 | ||
73 | qdisc = prio_classify(skb, sch, &ret); | |
74 | #ifdef CONFIG_NET_CLS_ACT | |
75 | if (qdisc == NULL) { | |
29f1df6c | 76 | |
c27f339a | 77 | if (ret & __NET_XMIT_BYPASS) |
1da177e4 LT |
78 | sch->qstats.drops++; |
79 | kfree_skb(skb); | |
80 | return ret; | |
81 | } | |
82 | #endif | |
83 | ||
5f86173b JK |
84 | ret = qdisc_enqueue(skb, qdisc); |
85 | if (ret == NET_XMIT_SUCCESS) { | |
1da177e4 LT |
86 | sch->q.qlen++; |
87 | return NET_XMIT_SUCCESS; | |
88 | } | |
378a2f09 JP |
89 | if (net_xmit_drop_count(ret)) |
90 | sch->qstats.drops++; | |
10297b99 | 91 | return ret; |
1da177e4 LT |
92 | } |
93 | ||
48a8f519 PM |
94 | static struct sk_buff *prio_peek(struct Qdisc *sch) |
95 | { | |
96 | struct prio_sched_data *q = qdisc_priv(sch); | |
97 | int prio; | |
98 | ||
99 | for (prio = 0; prio < q->bands; prio++) { | |
100 | struct Qdisc *qdisc = q->queues[prio]; | |
101 | struct sk_buff *skb = qdisc->ops->peek(qdisc); | |
102 | if (skb) | |
103 | return skb; | |
104 | } | |
105 | return NULL; | |
106 | } | |
1da177e4 | 107 | |
cc7ec456 | 108 | static struct sk_buff *prio_dequeue(struct Qdisc *sch) |
1da177e4 | 109 | { |
1da177e4 LT |
110 | struct prio_sched_data *q = qdisc_priv(sch); |
111 | int prio; | |
1da177e4 LT |
112 | |
113 | for (prio = 0; prio < q->bands; prio++) { | |
1d8ae3fd | 114 | struct Qdisc *qdisc = q->queues[prio]; |
3557619f | 115 | struct sk_buff *skb = qdisc_dequeue_peeked(qdisc); |
1d8ae3fd | 116 | if (skb) { |
9190b3b3 | 117 | qdisc_bstats_update(sch, skb); |
1d8ae3fd DM |
118 | sch->q.qlen--; |
119 | return skb; | |
1da177e4 LT |
120 | } |
121 | } | |
122 | return NULL; | |
123 | ||
124 | } | |
125 | ||
cc7ec456 | 126 | static unsigned int prio_drop(struct Qdisc *sch) |
1da177e4 LT |
127 | { |
128 | struct prio_sched_data *q = qdisc_priv(sch); | |
129 | int prio; | |
130 | unsigned int len; | |
131 | struct Qdisc *qdisc; | |
132 | ||
133 | for (prio = q->bands-1; prio >= 0; prio--) { | |
134 | qdisc = q->queues[prio]; | |
6d037a26 | 135 | if (qdisc->ops->drop && (len = qdisc->ops->drop(qdisc)) != 0) { |
1da177e4 LT |
136 | sch->q.qlen--; |
137 | return len; | |
138 | } | |
139 | } | |
140 | return 0; | |
141 | } | |
142 | ||
143 | ||
144 | static void | |
cc7ec456 | 145 | prio_reset(struct Qdisc *sch) |
1da177e4 LT |
146 | { |
147 | int prio; | |
148 | struct prio_sched_data *q = qdisc_priv(sch); | |
149 | ||
cc7ec456 | 150 | for (prio = 0; prio < q->bands; prio++) |
1da177e4 LT |
151 | qdisc_reset(q->queues[prio]); |
152 | sch->q.qlen = 0; | |
153 | } | |
154 | ||
155 | static void | |
cc7ec456 | 156 | prio_destroy(struct Qdisc *sch) |
1da177e4 LT |
157 | { |
158 | int prio; | |
159 | struct prio_sched_data *q = qdisc_priv(sch); | |
1da177e4 | 160 | |
ff31ab56 | 161 | tcf_destroy_chain(&q->filter_list); |
cc7ec456 | 162 | for (prio = 0; prio < q->bands; prio++) |
1da177e4 LT |
163 | qdisc_destroy(q->queues[prio]); |
164 | } | |
165 | ||
1e90474c | 166 | static int prio_tune(struct Qdisc *sch, struct nlattr *opt) |
1da177e4 LT |
167 | { |
168 | struct prio_sched_data *q = qdisc_priv(sch); | |
d62733c8 | 169 | struct tc_prio_qopt *qopt; |
1da177e4 LT |
170 | int i; |
171 | ||
1d8ae3fd DM |
172 | if (nla_len(opt) < sizeof(*qopt)) |
173 | return -EINVAL; | |
174 | qopt = nla_data(opt); | |
d62733c8 | 175 | |
1d8ae3fd | 176 | if (qopt->bands > TCQ_PRIO_BANDS || qopt->bands < 2) |
1da177e4 LT |
177 | return -EINVAL; |
178 | ||
cc7ec456 | 179 | for (i = 0; i <= TC_PRIO_MAX; i++) { |
1d8ae3fd | 180 | if (qopt->priomap[i] >= qopt->bands) |
1da177e4 LT |
181 | return -EINVAL; |
182 | } | |
183 | ||
184 | sch_tree_lock(sch); | |
1d8ae3fd | 185 | q->bands = qopt->bands; |
1da177e4 LT |
186 | memcpy(q->prio2band, qopt->priomap, TC_PRIO_MAX+1); |
187 | ||
cc7ec456 | 188 | for (i = q->bands; i < TCQ_PRIO_BANDS; i++) { |
b94c8afc PM |
189 | struct Qdisc *child = q->queues[i]; |
190 | q->queues[i] = &noop_qdisc; | |
5e50da01 PM |
191 | if (child != &noop_qdisc) { |
192 | qdisc_tree_decrease_qlen(child, child->q.qlen); | |
1da177e4 | 193 | qdisc_destroy(child); |
5e50da01 | 194 | } |
1da177e4 LT |
195 | } |
196 | sch_tree_unlock(sch); | |
197 | ||
cc7ec456 | 198 | for (i = 0; i < q->bands; i++) { |
dd914b40 | 199 | if (q->queues[i] == &noop_qdisc) { |
b94c8afc | 200 | struct Qdisc *child, *old; |
cc7ec456 | 201 | |
3511c913 | 202 | child = qdisc_create_dflt(sch->dev_queue, |
bb949fbd | 203 | &pfifo_qdisc_ops, |
9f9afec4 | 204 | TC_H_MAKE(sch->handle, i + 1)); |
1da177e4 LT |
205 | if (child) { |
206 | sch_tree_lock(sch); | |
b94c8afc PM |
207 | old = q->queues[i]; |
208 | q->queues[i] = child; | |
1da177e4 | 209 | |
b94c8afc PM |
210 | if (old != &noop_qdisc) { |
211 | qdisc_tree_decrease_qlen(old, | |
212 | old->q.qlen); | |
213 | qdisc_destroy(old); | |
5e50da01 | 214 | } |
1da177e4 LT |
215 | sch_tree_unlock(sch); |
216 | } | |
217 | } | |
218 | } | |
219 | return 0; | |
220 | } | |
221 | ||
1e90474c | 222 | static int prio_init(struct Qdisc *sch, struct nlattr *opt) |
1da177e4 LT |
223 | { |
224 | struct prio_sched_data *q = qdisc_priv(sch); | |
225 | int i; | |
226 | ||
cc7ec456 | 227 | for (i = 0; i < TCQ_PRIO_BANDS; i++) |
1da177e4 LT |
228 | q->queues[i] = &noop_qdisc; |
229 | ||
230 | if (opt == NULL) { | |
231 | return -EINVAL; | |
232 | } else { | |
233 | int err; | |
234 | ||
cc7ec456 | 235 | if ((err = prio_tune(sch, opt)) != 0) |
1da177e4 LT |
236 | return err; |
237 | } | |
238 | return 0; | |
239 | } | |
240 | ||
241 | static int prio_dump(struct Qdisc *sch, struct sk_buff *skb) | |
242 | { | |
243 | struct prio_sched_data *q = qdisc_priv(sch); | |
27a884dc | 244 | unsigned char *b = skb_tail_pointer(skb); |
1da177e4 LT |
245 | struct tc_prio_qopt opt; |
246 | ||
247 | opt.bands = q->bands; | |
cc7ec456 | 248 | memcpy(&opt.priomap, q->prio2band, TC_PRIO_MAX + 1); |
d62733c8 | 249 | |
1b34ec43 DM |
250 | if (nla_put(skb, TCA_OPTIONS, sizeof(opt), &opt)) |
251 | goto nla_put_failure; | |
d62733c8 | 252 | |
1da177e4 LT |
253 | return skb->len; |
254 | ||
1e90474c | 255 | nla_put_failure: |
dc5fc579 | 256 | nlmsg_trim(skb, b); |
1da177e4 LT |
257 | return -1; |
258 | } | |
259 | ||
260 | static int prio_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new, | |
261 | struct Qdisc **old) | |
262 | { | |
263 | struct prio_sched_data *q = qdisc_priv(sch); | |
264 | unsigned long band = arg - 1; | |
265 | ||
1da177e4 LT |
266 | if (new == NULL) |
267 | new = &noop_qdisc; | |
268 | ||
269 | sch_tree_lock(sch); | |
270 | *old = q->queues[band]; | |
271 | q->queues[band] = new; | |
5e50da01 | 272 | qdisc_tree_decrease_qlen(*old, (*old)->q.qlen); |
1da177e4 LT |
273 | qdisc_reset(*old); |
274 | sch_tree_unlock(sch); | |
275 | ||
276 | return 0; | |
277 | } | |
278 | ||
279 | static struct Qdisc * | |
280 | prio_leaf(struct Qdisc *sch, unsigned long arg) | |
281 | { | |
282 | struct prio_sched_data *q = qdisc_priv(sch); | |
283 | unsigned long band = arg - 1; | |
284 | ||
1da177e4 LT |
285 | return q->queues[band]; |
286 | } | |
287 | ||
288 | static unsigned long prio_get(struct Qdisc *sch, u32 classid) | |
289 | { | |
290 | struct prio_sched_data *q = qdisc_priv(sch); | |
291 | unsigned long band = TC_H_MIN(classid); | |
292 | ||
293 | if (band - 1 >= q->bands) | |
294 | return 0; | |
295 | return band; | |
296 | } | |
297 | ||
298 | static unsigned long prio_bind(struct Qdisc *sch, unsigned long parent, u32 classid) | |
299 | { | |
300 | return prio_get(sch, classid); | |
301 | } | |
302 | ||
303 | ||
304 | static void prio_put(struct Qdisc *q, unsigned long cl) | |
305 | { | |
1da177e4 LT |
306 | } |
307 | ||
1da177e4 LT |
308 | static int prio_dump_class(struct Qdisc *sch, unsigned long cl, struct sk_buff *skb, |
309 | struct tcmsg *tcm) | |
310 | { | |
311 | struct prio_sched_data *q = qdisc_priv(sch); | |
312 | ||
1da177e4 | 313 | tcm->tcm_handle |= TC_H_MIN(cl); |
5b9a9ccf | 314 | tcm->tcm_info = q->queues[cl-1]->handle; |
1da177e4 LT |
315 | return 0; |
316 | } | |
317 | ||
2cf6c36c JP |
318 | static int prio_dump_class_stats(struct Qdisc *sch, unsigned long cl, |
319 | struct gnet_dump *d) | |
320 | { | |
321 | struct prio_sched_data *q = qdisc_priv(sch); | |
322 | struct Qdisc *cl_q; | |
323 | ||
324 | cl_q = q->queues[cl - 1]; | |
a19d2158 | 325 | cl_q->qstats.qlen = cl_q->q.qlen; |
2cf6c36c JP |
326 | if (gnet_stats_copy_basic(d, &cl_q->bstats) < 0 || |
327 | gnet_stats_copy_queue(d, &cl_q->qstats) < 0) | |
328 | return -1; | |
329 | ||
330 | return 0; | |
331 | } | |
332 | ||
1da177e4 LT |
333 | static void prio_walk(struct Qdisc *sch, struct qdisc_walker *arg) |
334 | { | |
335 | struct prio_sched_data *q = qdisc_priv(sch); | |
336 | int prio; | |
337 | ||
338 | if (arg->stop) | |
339 | return; | |
340 | ||
341 | for (prio = 0; prio < q->bands; prio++) { | |
342 | if (arg->count < arg->skip) { | |
343 | arg->count++; | |
344 | continue; | |
345 | } | |
cc7ec456 | 346 | if (arg->fn(sch, prio + 1, arg) < 0) { |
1da177e4 LT |
347 | arg->stop = 1; |
348 | break; | |
349 | } | |
350 | arg->count++; | |
351 | } | |
352 | } | |
353 | ||
cc7ec456 | 354 | static struct tcf_proto **prio_find_tcf(struct Qdisc *sch, unsigned long cl) |
1da177e4 LT |
355 | { |
356 | struct prio_sched_data *q = qdisc_priv(sch); | |
357 | ||
358 | if (cl) | |
359 | return NULL; | |
360 | return &q->filter_list; | |
361 | } | |
362 | ||
20fea08b | 363 | static const struct Qdisc_class_ops prio_class_ops = { |
1da177e4 LT |
364 | .graft = prio_graft, |
365 | .leaf = prio_leaf, | |
366 | .get = prio_get, | |
367 | .put = prio_put, | |
1da177e4 LT |
368 | .walk = prio_walk, |
369 | .tcf_chain = prio_find_tcf, | |
370 | .bind_tcf = prio_bind, | |
371 | .unbind_tcf = prio_put, | |
372 | .dump = prio_dump_class, | |
2cf6c36c | 373 | .dump_stats = prio_dump_class_stats, |
1da177e4 LT |
374 | }; |
375 | ||
20fea08b | 376 | static struct Qdisc_ops prio_qdisc_ops __read_mostly = { |
1da177e4 LT |
377 | .next = NULL, |
378 | .cl_ops = &prio_class_ops, | |
379 | .id = "prio", | |
380 | .priv_size = sizeof(struct prio_sched_data), | |
381 | .enqueue = prio_enqueue, | |
382 | .dequeue = prio_dequeue, | |
48a8f519 | 383 | .peek = prio_peek, |
1da177e4 LT |
384 | .drop = prio_drop, |
385 | .init = prio_init, | |
386 | .reset = prio_reset, | |
387 | .destroy = prio_destroy, | |
388 | .change = prio_tune, | |
389 | .dump = prio_dump, | |
390 | .owner = THIS_MODULE, | |
391 | }; | |
392 | ||
393 | static int __init prio_module_init(void) | |
394 | { | |
1d8ae3fd | 395 | return register_qdisc(&prio_qdisc_ops); |
1da177e4 LT |
396 | } |
397 | ||
10297b99 | 398 | static void __exit prio_module_exit(void) |
1da177e4 LT |
399 | { |
400 | unregister_qdisc(&prio_qdisc_ops); | |
401 | } | |
402 | ||
403 | module_init(prio_module_init) | |
404 | module_exit(prio_module_exit) | |
405 | ||
406 | MODULE_LICENSE("GPL"); |