leds: leds-pwm: Set led_classdev max_brightness
[linux-2.6-block.git] / net / sched / sch_gred.c
CommitLineData
1da177e4
LT
1/*
2 * net/sched/sch_gred.c Generic Random Early Detection queue.
3 *
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version
8 * 2 of the License, or (at your option) any later version.
9 *
10 * Authors: J Hadi Salim (hadi@cyberus.ca) 1998-2002
11 *
12 * 991129: - Bug fix with grio mode
13 * - a better sing. AvgQ mode with Grio(WRED)
14 * - A finer grained VQ dequeue based on sugestion
15 * from Ren Liu
16 * - More error checks
17 *
1e4dfaf9 18 * For all the glorious comments look at include/net/red.h
1da177e4
LT
19 */
20
1da177e4 21#include <linux/module.h>
1da177e4
LT
22#include <linux/types.h>
23#include <linux/kernel.h>
1da177e4 24#include <linux/skbuff.h>
1da177e4 25#include <net/pkt_sched.h>
22b33429 26#include <net/red.h>
1da177e4 27
f62d6b93 28#define GRED_DEF_PRIO (MAX_DPs / 2)
716a1b40 29#define GRED_VQ_MASK (MAX_DPs - 1)
f62d6b93 30
1da177e4
LT
31struct gred_sched_data;
32struct gred_sched;
33
34struct gred_sched_data
35{
1da177e4 36 u32 limit; /* HARD maximal queue length */
1da177e4 37 u32 DP; /* the drop pramaters */
1da177e4
LT
38 u32 bytesin; /* bytes seen on virtualQ so far*/
39 u32 packetsin; /* packets seen on virtualQ so far*/
40 u32 backlog; /* bytes on the virtualQ */
1e4dfaf9 41 u8 prio; /* the prio of this vq */
1da177e4 42
22b33429
TG
43 struct red_parms parms;
44 struct red_stats stats;
1da177e4
LT
45};
46
dea3f628
TG
47enum {
48 GRED_WRED_MODE = 1,
d6fd4e96 49 GRED_RIO_MODE,
dea3f628
TG
50};
51
1da177e4
LT
52struct gred_sched
53{
54 struct gred_sched_data *tab[MAX_DPs];
dea3f628 55 unsigned long flags;
b38c7eef 56 u32 red_flags;
1e4dfaf9
TG
57 u32 DPs;
58 u32 def;
7051703b 59 struct red_parms wred_set;
1da177e4
LT
60};
61
dea3f628
TG
62static inline int gred_wred_mode(struct gred_sched *table)
63{
64 return test_bit(GRED_WRED_MODE, &table->flags);
65}
66
67static inline void gred_enable_wred_mode(struct gred_sched *table)
68{
69 __set_bit(GRED_WRED_MODE, &table->flags);
70}
71
72static inline void gred_disable_wred_mode(struct gred_sched *table)
73{
74 __clear_bit(GRED_WRED_MODE, &table->flags);
75}
76
d6fd4e96
TG
77static inline int gred_rio_mode(struct gred_sched *table)
78{
79 return test_bit(GRED_RIO_MODE, &table->flags);
80}
81
82static inline void gred_enable_rio_mode(struct gred_sched *table)
83{
84 __set_bit(GRED_RIO_MODE, &table->flags);
85}
86
87static inline void gred_disable_rio_mode(struct gred_sched *table)
88{
89 __clear_bit(GRED_RIO_MODE, &table->flags);
90}
91
dea3f628
TG
92static inline int gred_wred_mode_check(struct Qdisc *sch)
93{
94 struct gred_sched *table = qdisc_priv(sch);
95 int i;
96
97 /* Really ugly O(n^2) but shouldn't be necessary too frequent. */
98 for (i = 0; i < table->DPs; i++) {
99 struct gred_sched_data *q = table->tab[i];
100 int n;
101
102 if (q == NULL)
103 continue;
104
105 for (n = 0; n < table->DPs; n++)
106 if (table->tab[n] && table->tab[n] != q &&
107 table->tab[n]->prio == q->prio)
108 return 1;
109 }
110
111 return 0;
112}
113
22b33429
TG
114static inline unsigned int gred_backlog(struct gred_sched *table,
115 struct gred_sched_data *q,
116 struct Qdisc *sch)
117{
118 if (gred_wred_mode(table))
119 return sch->qstats.backlog;
120 else
121 return q->backlog;
122}
123
716a1b40
TG
124static inline u16 tc_index_to_dp(struct sk_buff *skb)
125{
126 return skb->tc_index & GRED_VQ_MASK;
127}
128
7051703b
TG
129static inline void gred_load_wred_set(struct gred_sched *table,
130 struct gred_sched_data *q)
131{
132 q->parms.qavg = table->wred_set.qavg;
133 q->parms.qidlestart = table->wred_set.qidlestart;
134}
135
136static inline void gred_store_wred_set(struct gred_sched *table,
137 struct gred_sched_data *q)
138{
139 table->wred_set.qavg = q->parms.qavg;
140}
141
b38c7eef
TG
142static inline int gred_use_ecn(struct gred_sched *t)
143{
144 return t->red_flags & TC_RED_ECN;
145}
146
bdc450a0
TG
147static inline int gred_use_harddrop(struct gred_sched *t)
148{
149 return t->red_flags & TC_RED_HARDDROP;
150}
151
1e4dfaf9 152static int gred_enqueue(struct sk_buff *skb, struct Qdisc* sch)
1da177e4 153{
1da177e4
LT
154 struct gred_sched_data *q=NULL;
155 struct gred_sched *t= qdisc_priv(sch);
22b33429 156 unsigned long qavg = 0;
4a591834 157 u16 dp = tc_index_to_dp(skb);
1da177e4 158
716a1b40 159 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) {
18e3fb84
TG
160 dp = t->def;
161
162 if ((q = t->tab[dp]) == NULL) {
163 /* Pass through packets not assigned to a DP
164 * if no default DP has been configured. This
165 * allows for DP flows to be left untouched.
166 */
5ce2d488 167 if (skb_queue_len(&sch->q) < qdisc_dev(sch)->tx_queue_len)
18e3fb84
TG
168 return qdisc_enqueue_tail(skb, sch);
169 else
170 goto drop;
1da177e4 171 }
18e3fb84 172
1da177e4
LT
173 /* fix tc_index? --could be controvesial but needed for
174 requeueing */
18e3fb84 175 skb->tc_index = (skb->tc_index & ~GRED_VQ_MASK) | dp;
1da177e4
LT
176 }
177
1e4dfaf9 178 /* sum up all the qaves of prios <= to ours to get the new qave */
d6fd4e96 179 if (!gred_wred_mode(t) && gred_rio_mode(t)) {
1e4dfaf9
TG
180 int i;
181
182 for (i = 0; i < t->DPs; i++) {
183 if (t->tab[i] && t->tab[i]->prio < q->prio &&
22b33429
TG
184 !red_is_idling(&t->tab[i]->parms))
185 qavg +=t->tab[i]->parms.qavg;
1da177e4 186 }
1e4dfaf9 187
1da177e4
LT
188 }
189
190 q->packetsin++;
0abf77e5 191 q->bytesin += qdisc_pkt_len(skb);
1da177e4 192
1e4dfaf9 193 if (gred_wred_mode(t))
7051703b 194 gred_load_wred_set(t, q);
1da177e4 195
22b33429 196 q->parms.qavg = red_calc_qavg(&q->parms, gred_backlog(t, q, sch));
1da177e4 197
22b33429
TG
198 if (red_is_idling(&q->parms))
199 red_end_of_idle_period(&q->parms);
1da177e4 200
dea3f628 201 if (gred_wred_mode(t))
7051703b 202 gred_store_wred_set(t, q);
1da177e4 203
22b33429
TG
204 switch (red_action(&q->parms, q->parms.qavg + qavg)) {
205 case RED_DONT_MARK:
206 break;
1da177e4 207
22b33429
TG
208 case RED_PROB_MARK:
209 sch->qstats.overlimits++;
b38c7eef
TG
210 if (!gred_use_ecn(t) || !INET_ECN_set_ce(skb)) {
211 q->stats.prob_drop++;
212 goto congestion_drop;
213 }
214
215 q->stats.prob_mark++;
216 break;
22b33429
TG
217
218 case RED_HARD_MARK:
219 sch->qstats.overlimits++;
bdc450a0
TG
220 if (gred_use_harddrop(t) || !gred_use_ecn(t) ||
221 !INET_ECN_set_ce(skb)) {
b38c7eef
TG
222 q->stats.forced_drop++;
223 goto congestion_drop;
224 }
225 q->stats.forced_mark++;
226 break;
1da177e4 227 }
22b33429 228
0abf77e5
JK
229 if (q->backlog + qdisc_pkt_len(skb) <= q->limit) {
230 q->backlog += qdisc_pkt_len(skb);
edf7a7b1 231 return qdisc_enqueue_tail(skb, sch);
1da177e4 232 }
22b33429
TG
233
234 q->stats.pdrop++;
235drop:
edf7a7b1 236 return qdisc_drop(skb, sch);
c3b553cd
TG
237
238congestion_drop:
edf7a7b1 239 qdisc_drop(skb, sch);
c3b553cd 240 return NET_XMIT_CN;
1da177e4
LT
241}
242
1e4dfaf9 243static struct sk_buff *gred_dequeue(struct Qdisc* sch)
1da177e4
LT
244{
245 struct sk_buff *skb;
1e4dfaf9 246 struct gred_sched *t = qdisc_priv(sch);
1da177e4 247
edf7a7b1
TG
248 skb = qdisc_dequeue_head(sch);
249
1da177e4 250 if (skb) {
1e4dfaf9 251 struct gred_sched_data *q;
18e3fb84
TG
252 u16 dp = tc_index_to_dp(skb);
253
254 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) {
255 if (net_ratelimit())
256 printk(KERN_WARNING "GRED: Unable to relocate "
257 "VQ 0x%x after dequeue, screwing up "
258 "backlog.\n", tc_index_to_dp(skb));
259 } else {
0abf77e5 260 q->backlog -= qdisc_pkt_len(skb);
18e3fb84 261
dea3f628 262 if (!q->backlog && !gred_wred_mode(t))
22b33429 263 red_start_of_idle_period(&q->parms);
1da177e4 264 }
18e3fb84 265
1da177e4
LT
266 return skb;
267 }
268
d8f64e19 269 if (gred_wred_mode(t) && !red_is_idling(&t->wred_set))
7051703b 270 red_start_of_idle_period(&t->wred_set);
1da177e4
LT
271
272 return NULL;
273}
274
275static unsigned int gred_drop(struct Qdisc* sch)
276{
277 struct sk_buff *skb;
1e4dfaf9 278 struct gred_sched *t = qdisc_priv(sch);
1da177e4 279
edf7a7b1 280 skb = qdisc_dequeue_tail(sch);
1da177e4 281 if (skb) {
0abf77e5 282 unsigned int len = qdisc_pkt_len(skb);
1e4dfaf9 283 struct gred_sched_data *q;
18e3fb84
TG
284 u16 dp = tc_index_to_dp(skb);
285
286 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) {
287 if (net_ratelimit())
288 printk(KERN_WARNING "GRED: Unable to relocate "
289 "VQ 0x%x while dropping, screwing up "
290 "backlog.\n", tc_index_to_dp(skb));
291 } else {
1da177e4 292 q->backlog -= len;
22b33429 293 q->stats.other++;
18e3fb84 294
dea3f628 295 if (!q->backlog && !gred_wred_mode(t))
22b33429 296 red_start_of_idle_period(&q->parms);
1da177e4
LT
297 }
298
edf7a7b1 299 qdisc_drop(skb, sch);
1da177e4
LT
300 return len;
301 }
302
d8f64e19 303 if (gred_wred_mode(t) && !red_is_idling(&t->wred_set))
7051703b 304 red_start_of_idle_period(&t->wred_set);
1da177e4 305
1da177e4
LT
306 return 0;
307
308}
309
310static void gred_reset(struct Qdisc* sch)
311{
312 int i;
1e4dfaf9 313 struct gred_sched *t = qdisc_priv(sch);
1da177e4 314
edf7a7b1 315 qdisc_reset_queue(sch);
1da177e4 316
10297b99 317 for (i = 0; i < t->DPs; i++) {
1e4dfaf9
TG
318 struct gred_sched_data *q = t->tab[i];
319
320 if (!q)
321 continue;
322
22b33429 323 red_restart(&q->parms);
1da177e4 324 q->backlog = 0;
1da177e4
LT
325 }
326}
327
6639607e
TG
328static inline void gred_destroy_vq(struct gred_sched_data *q)
329{
330 kfree(q);
331}
332
1e90474c 333static inline int gred_change_table_def(struct Qdisc *sch, struct nlattr *dps)
1da177e4
LT
334{
335 struct gred_sched *table = qdisc_priv(sch);
1da177e4 336 struct tc_gred_sopt *sopt;
6639607e 337 int i;
1da177e4 338
27a3421e 339 if (dps == NULL)
1da177e4
LT
340 return -EINVAL;
341
1e90474c 342 sopt = nla_data(dps);
1da177e4 343
6639607e
TG
344 if (sopt->DPs > MAX_DPs || sopt->DPs == 0 || sopt->def_DP >= sopt->DPs)
345 return -EINVAL;
1da177e4 346
6639607e
TG
347 sch_tree_lock(sch);
348 table->DPs = sopt->DPs;
349 table->def = sopt->def_DP;
b38c7eef 350 table->red_flags = sopt->flags;
dea3f628 351
6639607e
TG
352 /*
353 * Every entry point to GRED is synchronized with the above code
354 * and the DP is checked against DPs, i.e. shadowed VQs can no
355 * longer be found so we can unlock right here.
356 */
357 sch_tree_unlock(sch);
dea3f628 358
6639607e
TG
359 if (sopt->grio) {
360 gred_enable_rio_mode(table);
361 gred_disable_wred_mode(table);
362 if (gred_wred_mode_check(sch))
363 gred_enable_wred_mode(table);
364 } else {
365 gred_disable_rio_mode(table);
366 gred_disable_wred_mode(table);
367 }
368
369 for (i = table->DPs; i < MAX_DPs; i++) {
370 if (table->tab[i]) {
371 printk(KERN_WARNING "GRED: Warning: Destroying "
372 "shadowed VQ 0x%x\n", i);
373 gred_destroy_vq(table->tab[i]);
374 table->tab[i] = NULL;
10297b99 375 }
6639607e 376 }
1da177e4 377
6639607e
TG
378 return 0;
379}
380
f62d6b93
TG
381static inline int gred_change_vq(struct Qdisc *sch, int dp,
382 struct tc_gred_qopt *ctl, int prio, u8 *stab)
6639607e
TG
383{
384 struct gred_sched *table = qdisc_priv(sch);
385 struct gred_sched_data *q;
f62d6b93
TG
386
387 if (table->tab[dp] == NULL) {
0da974f4 388 table->tab[dp] = kzalloc(sizeof(*q), GFP_KERNEL);
f62d6b93
TG
389 if (table->tab[dp] == NULL)
390 return -ENOMEM;
f62d6b93
TG
391 }
392
393 q = table->tab[dp];
394 q->DP = dp;
395 q->prio = prio;
f62d6b93 396 q->limit = ctl->limit;
22b33429
TG
397
398 if (q->backlog == 0)
399 red_end_of_idle_period(&q->parms);
400
401 red_set_parms(&q->parms,
402 ctl->qth_min, ctl->qth_max, ctl->Wlog, ctl->Plog,
403 ctl->Scell_log, stab);
404
f62d6b93
TG
405 return 0;
406}
407
27a3421e
PM
408static const struct nla_policy gred_policy[TCA_GRED_MAX + 1] = {
409 [TCA_GRED_PARMS] = { .len = sizeof(struct tc_gred_qopt) },
410 [TCA_GRED_STAB] = { .len = 256 },
411 [TCA_GRED_DPS] = { .len = sizeof(struct tc_gred_sopt) },
412};
413
1e90474c 414static int gred_change(struct Qdisc *sch, struct nlattr *opt)
f62d6b93
TG
415{
416 struct gred_sched *table = qdisc_priv(sch);
6639607e 417 struct tc_gred_qopt *ctl;
1e90474c 418 struct nlattr *tb[TCA_GRED_MAX + 1];
cee63723 419 int err, prio = GRED_DEF_PRIO;
f62d6b93 420 u8 *stab;
6639607e 421
cee63723 422 if (opt == NULL)
6639607e
TG
423 return -EINVAL;
424
27a3421e 425 err = nla_parse_nested(tb, TCA_GRED_MAX, opt, gred_policy);
cee63723
PM
426 if (err < 0)
427 return err;
428
1e90474c 429 if (tb[TCA_GRED_PARMS] == NULL && tb[TCA_GRED_STAB] == NULL)
f62d6b93 430 return gred_change_table_def(sch, opt);
1da177e4 431
1e90474c 432 if (tb[TCA_GRED_PARMS] == NULL ||
27a3421e 433 tb[TCA_GRED_STAB] == NULL)
f62d6b93 434 return -EINVAL;
1da177e4 435
cee63723 436 err = -EINVAL;
1e90474c
PM
437 ctl = nla_data(tb[TCA_GRED_PARMS]);
438 stab = nla_data(tb[TCA_GRED_STAB]);
a8aaa995
TG
439
440 if (ctl->DP >= table->DPs)
f62d6b93 441 goto errout;
1da177e4 442
d6fd4e96 443 if (gred_rio_mode(table)) {
f62d6b93
TG
444 if (ctl->prio == 0) {
445 int def_prio = GRED_DEF_PRIO;
446
447 if (table->tab[table->def])
448 def_prio = table->tab[table->def]->prio;
449
450 printk(KERN_DEBUG "GRED: DP %u does not have a prio "
451 "setting default to %d\n", ctl->DP, def_prio);
452
453 prio = def_prio;
454 } else
455 prio = ctl->prio;
1da177e4
LT
456 }
457
f62d6b93 458 sch_tree_lock(sch);
1da177e4 459
f62d6b93
TG
460 err = gred_change_vq(sch, ctl->DP, ctl, prio, stab);
461 if (err < 0)
462 goto errout_locked;
1da177e4 463
d6fd4e96 464 if (gred_rio_mode(table)) {
dea3f628
TG
465 gred_disable_wred_mode(table);
466 if (gred_wred_mode_check(sch))
467 gred_enable_wred_mode(table);
1da177e4
LT
468 }
469
f62d6b93 470 err = 0;
1da177e4 471
f62d6b93
TG
472errout_locked:
473 sch_tree_unlock(sch);
474errout:
475 return err;
1da177e4
LT
476}
477
1e90474c 478static int gred_init(struct Qdisc *sch, struct nlattr *opt)
1da177e4 479{
1e90474c 480 struct nlattr *tb[TCA_GRED_MAX + 1];
cee63723 481 int err;
1da177e4 482
cee63723 483 if (opt == NULL)
1da177e4
LT
484 return -EINVAL;
485
27a3421e 486 err = nla_parse_nested(tb, TCA_GRED_MAX, opt, gred_policy);
cee63723
PM
487 if (err < 0)
488 return err;
489
1e90474c 490 if (tb[TCA_GRED_PARMS] || tb[TCA_GRED_STAB])
6639607e 491 return -EINVAL;
1da177e4 492
1e90474c 493 return gred_change_table_def(sch, tb[TCA_GRED_DPS]);
1da177e4
LT
494}
495
496static int gred_dump(struct Qdisc *sch, struct sk_buff *skb)
497{
1da177e4 498 struct gred_sched *table = qdisc_priv(sch);
1e90474c 499 struct nlattr *parms, *opts = NULL;
1da177e4 500 int i;
e0636822
TG
501 struct tc_gred_sopt sopt = {
502 .DPs = table->DPs,
503 .def_DP = table->def,
504 .grio = gred_rio_mode(table),
b38c7eef 505 .flags = table->red_flags,
e0636822 506 };
1da177e4 507
1e90474c
PM
508 opts = nla_nest_start(skb, TCA_OPTIONS);
509 if (opts == NULL)
510 goto nla_put_failure;
511 NLA_PUT(skb, TCA_GRED_DPS, sizeof(sopt), &sopt);
512 parms = nla_nest_start(skb, TCA_GRED_PARMS);
513 if (parms == NULL)
514 goto nla_put_failure;
1da177e4 515
05f1cc01
TG
516 for (i = 0; i < MAX_DPs; i++) {
517 struct gred_sched_data *q = table->tab[i];
518 struct tc_gred_qopt opt;
1da177e4 519
05f1cc01 520 memset(&opt, 0, sizeof(opt));
1da177e4
LT
521
522 if (!q) {
523 /* hack -- fix at some point with proper message
524 This is how we indicate to tc that there is no VQ
525 at this DP */
526
05f1cc01
TG
527 opt.DP = MAX_DPs + i;
528 goto append_opt;
1da177e4
LT
529 }
530
05f1cc01
TG
531 opt.limit = q->limit;
532 opt.DP = q->DP;
533 opt.backlog = q->backlog;
534 opt.prio = q->prio;
22b33429
TG
535 opt.qth_min = q->parms.qth_min >> q->parms.Wlog;
536 opt.qth_max = q->parms.qth_max >> q->parms.Wlog;
537 opt.Wlog = q->parms.Wlog;
538 opt.Plog = q->parms.Plog;
539 opt.Scell_log = q->parms.Scell_log;
540 opt.other = q->stats.other;
541 opt.early = q->stats.prob_drop;
542 opt.forced = q->stats.forced_drop;
543 opt.pdrop = q->stats.pdrop;
05f1cc01
TG
544 opt.packets = q->packetsin;
545 opt.bytesin = q->bytesin;
546
22b33429
TG
547 if (gred_wred_mode(table)) {
548 q->parms.qidlestart =
549 table->tab[table->def]->parms.qidlestart;
550 q->parms.qavg = table->tab[table->def]->parms.qavg;
1da177e4 551 }
05f1cc01 552
22b33429
TG
553 opt.qave = red_calc_qavg(&q->parms, q->parms.qavg);
554
05f1cc01 555append_opt:
1e90474c
PM
556 if (nla_append(skb, sizeof(opt), &opt) < 0)
557 goto nla_put_failure;
1da177e4
LT
558 }
559
1e90474c 560 nla_nest_end(skb, parms);
1da177e4 561
1e90474c 562 return nla_nest_end(skb, opts);
1da177e4 563
1e90474c 564nla_put_failure:
bc3ed28c
TG
565 nla_nest_cancel(skb, opts);
566 return -EMSGSIZE;
1da177e4
LT
567}
568
569static void gred_destroy(struct Qdisc *sch)
570{
571 struct gred_sched *table = qdisc_priv(sch);
572 int i;
573
1e4dfaf9 574 for (i = 0; i < table->DPs; i++) {
1da177e4 575 if (table->tab[i])
6639607e 576 gred_destroy_vq(table->tab[i]);
1da177e4
LT
577 }
578}
579
20fea08b 580static struct Qdisc_ops gred_qdisc_ops __read_mostly = {
1da177e4
LT
581 .id = "gred",
582 .priv_size = sizeof(struct gred_sched),
583 .enqueue = gred_enqueue,
584 .dequeue = gred_dequeue,
8e3af978 585 .peek = qdisc_peek_head,
1da177e4
LT
586 .drop = gred_drop,
587 .init = gred_init,
588 .reset = gred_reset,
589 .destroy = gred_destroy,
590 .change = gred_change,
591 .dump = gred_dump,
592 .owner = THIS_MODULE,
593};
594
595static int __init gred_module_init(void)
596{
597 return register_qdisc(&gred_qdisc_ops);
598}
1e4dfaf9
TG
599
600static void __exit gred_module_exit(void)
1da177e4
LT
601{
602 unregister_qdisc(&gred_qdisc_ops);
603}
1e4dfaf9 604
1da177e4
LT
605module_init(gred_module_init)
606module_exit(gred_module_exit)
1e4dfaf9 607
1da177e4 608MODULE_LICENSE("GPL");