blob: a4ca4517cdc82843e21e5245989a59e89aa53702 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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 *
Thomas Graf1e4dfaf92005-11-05 21:14:25 +010018 * For all the glorious comments look at include/net/red.h
Linus Torvalds1da177e2005-04-16 15:20:36 -070019 */
20
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090021#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#include <linux/module.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070023#include <linux/types.h>
24#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070025#include <linux/skbuff.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070026#include <net/pkt_sched.h>
Thomas Graf22b33422005-11-05 21:14:16 +010027#include <net/red.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070028
Thomas Graff62d6b92005-11-05 21:14:15 +010029#define GRED_DEF_PRIO (MAX_DPs / 2)
Thomas Graf716a1b42005-11-05 21:14:20 +010030#define GRED_VQ_MASK (MAX_DPs - 1)
Thomas Graff62d6b92005-11-05 21:14:15 +010031
Linus Torvalds1da177e2005-04-16 15:20:36 -070032struct gred_sched_data;
33struct gred_sched;
34
Eric Dumazetcc7ec452011-01-19 19:26:56 +000035struct gred_sched_data {
Linus Torvalds1da177e2005-04-16 15:20:36 -070036 u32 limit; /* HARD maximal queue length */
Eric Dumazeta73ed262011-12-09 02:46:45 +000037 u32 DP; /* the drop parameters */
Linus Torvalds1da177e2005-04-16 15:20:36 -070038 u32 bytesin; /* bytes seen on virtualQ so far*/
39 u32 packetsin; /* packets seen on virtualQ so far*/
40 u32 backlog; /* bytes on the virtualQ */
Thomas Graf1e4dfaf92005-11-05 21:14:25 +010041 u8 prio; /* the prio of this vq */
Linus Torvalds1da177e2005-04-16 15:20:36 -070042
Thomas Graf22b33422005-11-05 21:14:16 +010043 struct red_parms parms;
Eric Dumazeteeca6682012-01-05 02:25:16 +000044 struct red_vars vars;
Thomas Graf22b33422005-11-05 21:14:16 +010045 struct red_stats stats;
Linus Torvalds1da177e2005-04-16 15:20:36 -070046};
47
Thomas Grafdea3f622005-11-05 21:14:09 +010048enum {
49 GRED_WRED_MODE = 1,
Thomas Grafd6fd4e92005-11-05 21:14:10 +010050 GRED_RIO_MODE,
Thomas Grafdea3f622005-11-05 21:14:09 +010051};
52
Eric Dumazetcc7ec452011-01-19 19:26:56 +000053struct gred_sched {
Linus Torvalds1da177e2005-04-16 15:20:36 -070054 struct gred_sched_data *tab[MAX_DPs];
Thomas Grafdea3f622005-11-05 21:14:09 +010055 unsigned long flags;
Thomas Grafb38c7ee2005-11-05 21:14:27 +010056 u32 red_flags;
Thomas Graf1e4dfaf92005-11-05 21:14:25 +010057 u32 DPs;
58 u32 def;
Eric Dumazeteeca6682012-01-05 02:25:16 +000059 struct red_vars wred_set;
Linus Torvalds1da177e2005-04-16 15:20:36 -070060};
61
Thomas Grafdea3f622005-11-05 21:14:09 +010062static 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
Thomas Grafd6fd4e92005-11-05 21:14:10 +010077static 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
Thomas Grafdea3f622005-11-05 21:14:09 +010092static 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
David Wardc22e4642012-09-13 05:22:33 +0000105 for (n = i + 1; n < table->DPs; n++)
106 if (table->tab[n] && table->tab[n]->prio == q->prio)
Thomas Grafdea3f622005-11-05 21:14:09 +0100107 return 1;
108 }
109
110 return 0;
111}
112
Thomas Graf22b33422005-11-05 21:14:16 +0100113static inline unsigned int gred_backlog(struct gred_sched *table,
114 struct gred_sched_data *q,
115 struct Qdisc *sch)
116{
117 if (gred_wred_mode(table))
118 return sch->qstats.backlog;
119 else
120 return q->backlog;
121}
122
Thomas Graf716a1b42005-11-05 21:14:20 +0100123static inline u16 tc_index_to_dp(struct sk_buff *skb)
124{
125 return skb->tc_index & GRED_VQ_MASK;
126}
127
Eric Dumazeteeca6682012-01-05 02:25:16 +0000128static inline void gred_load_wred_set(const struct gred_sched *table,
Thomas Graf70517032005-11-05 21:14:23 +0100129 struct gred_sched_data *q)
130{
Eric Dumazeteeca6682012-01-05 02:25:16 +0000131 q->vars.qavg = table->wred_set.qavg;
132 q->vars.qidlestart = table->wred_set.qidlestart;
Thomas Graf70517032005-11-05 21:14:23 +0100133}
134
135static inline void gred_store_wred_set(struct gred_sched *table,
136 struct gred_sched_data *q)
137{
Eric Dumazeteeca6682012-01-05 02:25:16 +0000138 table->wred_set.qavg = q->vars.qavg;
David Wardba1bf472012-09-13 05:22:35 +0000139 table->wred_set.qidlestart = q->vars.qidlestart;
Thomas Graf70517032005-11-05 21:14:23 +0100140}
141
Thomas Grafb38c7ee2005-11-05 21:14:27 +0100142static inline int gred_use_ecn(struct gred_sched *t)
143{
144 return t->red_flags & TC_RED_ECN;
145}
146
Thomas Grafbdc450a2005-11-05 21:14:28 +0100147static inline int gred_use_harddrop(struct gred_sched *t)
148{
149 return t->red_flags & TC_RED_HARDDROP;
150}
151
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000152static int gred_enqueue(struct sk_buff *skb, struct Qdisc *sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153{
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000154 struct gred_sched_data *q = NULL;
155 struct gred_sched *t = qdisc_priv(sch);
Thomas Graf22b33422005-11-05 21:14:16 +0100156 unsigned long qavg = 0;
Thomas Graf4a591832005-11-05 21:14:22 +0100157 u16 dp = tc_index_to_dp(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000159 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) {
Thomas Graf18e3fb842005-11-05 21:14:21 +0100160 dp = t->def;
161
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000162 q = t->tab[dp];
163 if (!q) {
Thomas Graf18e3fb842005-11-05 21:14:21 +0100164 /* Pass through packets not assigned to a DP
165 * if no default DP has been configured. This
166 * allows for DP flows to be left untouched.
167 */
David S. Miller5ce2d482008-07-08 17:06:30 -0700168 if (skb_queue_len(&sch->q) < qdisc_dev(sch)->tx_queue_len)
Thomas Graf18e3fb842005-11-05 21:14:21 +0100169 return qdisc_enqueue_tail(skb, sch);
170 else
171 goto drop;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 }
Thomas Graf18e3fb842005-11-05 21:14:21 +0100173
Eric Dumazeteeca6682012-01-05 02:25:16 +0000174 /* fix tc_index? --could be controversial but needed for
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175 requeueing */
Thomas Graf18e3fb842005-11-05 21:14:21 +0100176 skb->tc_index = (skb->tc_index & ~GRED_VQ_MASK) | dp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 }
178
David Warde29fe832012-09-13 05:22:32 +0000179 /* sum up all the qaves of prios < ours to get the new qave */
Thomas Grafd6fd4e92005-11-05 21:14:10 +0100180 if (!gred_wred_mode(t) && gred_rio_mode(t)) {
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100181 int i;
182
183 for (i = 0; i < t->DPs; i++) {
184 if (t->tab[i] && t->tab[i]->prio < q->prio &&
Eric Dumazeteeca6682012-01-05 02:25:16 +0000185 !red_is_idling(&t->tab[i]->vars))
186 qavg += t->tab[i]->vars.qavg;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187 }
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100188
Linus Torvalds1da177e2005-04-16 15:20:36 -0700189 }
190
191 q->packetsin++;
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700192 q->bytesin += qdisc_pkt_len(skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700193
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100194 if (gred_wred_mode(t))
Thomas Graf70517032005-11-05 21:14:23 +0100195 gred_load_wred_set(t, q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700196
Eric Dumazeteeca6682012-01-05 02:25:16 +0000197 q->vars.qavg = red_calc_qavg(&q->parms,
198 &q->vars,
199 gred_backlog(t, q, sch));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200
Eric Dumazeteeca6682012-01-05 02:25:16 +0000201 if (red_is_idling(&q->vars))
202 red_end_of_idle_period(&q->vars);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203
Thomas Grafdea3f622005-11-05 21:14:09 +0100204 if (gred_wred_mode(t))
Thomas Graf70517032005-11-05 21:14:23 +0100205 gred_store_wred_set(t, q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206
Eric Dumazeteeca6682012-01-05 02:25:16 +0000207 switch (red_action(&q->parms, &q->vars, q->vars.qavg + qavg)) {
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000208 case RED_DONT_MARK:
209 break;
Thomas Graf22b33422005-11-05 21:14:16 +0100210
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000211 case RED_PROB_MARK:
John Fastabend25331d62014-09-28 11:53:29 -0700212 qdisc_qstats_overlimit(sch);
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000213 if (!gred_use_ecn(t) || !INET_ECN_set_ce(skb)) {
214 q->stats.prob_drop++;
215 goto congestion_drop;
216 }
Thomas Grafb38c7ee2005-11-05 21:14:27 +0100217
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000218 q->stats.prob_mark++;
219 break;
Thomas Graf22b33422005-11-05 21:14:16 +0100220
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000221 case RED_HARD_MARK:
John Fastabend25331d62014-09-28 11:53:29 -0700222 qdisc_qstats_overlimit(sch);
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000223 if (gred_use_harddrop(t) || !gred_use_ecn(t) ||
224 !INET_ECN_set_ce(skb)) {
225 q->stats.forced_drop++;
226 goto congestion_drop;
227 }
228 q->stats.forced_mark++;
229 break;
Thomas Graf22b33422005-11-05 21:14:16 +0100230 }
231
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700232 if (q->backlog + qdisc_pkt_len(skb) <= q->limit) {
233 q->backlog += qdisc_pkt_len(skb);
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100234 return qdisc_enqueue_tail(skb, sch);
Thomas Graf22b33422005-11-05 21:14:16 +0100235 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236
Thomas Graf22b33422005-11-05 21:14:16 +0100237 q->stats.pdrop++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238drop:
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100239 return qdisc_drop(skb, sch);
Thomas Grafc3b553c2005-11-05 21:14:18 +0100240
241congestion_drop:
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100242 qdisc_drop(skb, sch);
Thomas Grafc3b553c2005-11-05 21:14:18 +0100243 return NET_XMIT_CN;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244}
245
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000246static struct sk_buff *gred_dequeue(struct Qdisc *sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247{
248 struct sk_buff *skb;
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100249 struct gred_sched *t = qdisc_priv(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100251 skb = qdisc_dequeue_head(sch);
252
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253 if (skb) {
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100254 struct gred_sched_data *q;
Thomas Graf18e3fb842005-11-05 21:14:21 +0100255 u16 dp = tc_index_to_dp(skb);
256
257 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) {
Joe Perchese87cc472012-05-13 21:56:26 +0000258 net_warn_ratelimited("GRED: Unable to relocate VQ 0x%x after dequeue, screwing up backlog\n",
259 tc_index_to_dp(skb));
Thomas Graf18e3fb842005-11-05 21:14:21 +0100260 } else {
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700261 q->backlog -= qdisc_pkt_len(skb);
Thomas Graf18e3fb842005-11-05 21:14:21 +0100262
David Wardba1bf472012-09-13 05:22:35 +0000263 if (gred_wred_mode(t)) {
264 if (!sch->qstats.backlog)
265 red_start_of_idle_period(&t->wred_set);
266 } else {
267 if (!q->backlog)
268 red_start_of_idle_period(&q->vars);
269 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270 }
Thomas Graf18e3fb842005-11-05 21:14:21 +0100271
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272 return skb;
273 }
274
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275 return NULL;
276}
277
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000278static unsigned int gred_drop(struct Qdisc *sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279{
280 struct sk_buff *skb;
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100281 struct gred_sched *t = qdisc_priv(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100283 skb = qdisc_dequeue_tail(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700284 if (skb) {
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700285 unsigned int len = qdisc_pkt_len(skb);
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100286 struct gred_sched_data *q;
Thomas Graf18e3fb842005-11-05 21:14:21 +0100287 u16 dp = tc_index_to_dp(skb);
288
289 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) {
Joe Perchese87cc472012-05-13 21:56:26 +0000290 net_warn_ratelimited("GRED: Unable to relocate VQ 0x%x while dropping, screwing up backlog\n",
291 tc_index_to_dp(skb));
Thomas Graf18e3fb842005-11-05 21:14:21 +0100292 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293 q->backlog -= len;
Thomas Graf22b33422005-11-05 21:14:16 +0100294 q->stats.other++;
Thomas Graf18e3fb842005-11-05 21:14:21 +0100295
David Wardba1bf472012-09-13 05:22:35 +0000296 if (gred_wred_mode(t)) {
297 if (!sch->qstats.backlog)
298 red_start_of_idle_period(&t->wred_set);
299 } else {
300 if (!q->backlog)
301 red_start_of_idle_period(&q->vars);
302 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303 }
304
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100305 qdisc_drop(skb, sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306 return len;
307 }
308
Linus Torvalds1da177e2005-04-16 15:20:36 -0700309 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310}
311
Eric Dumazetcc7ec452011-01-19 19:26:56 +0000312static void gred_reset(struct Qdisc *sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313{
314 int i;
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100315 struct gred_sched *t = qdisc_priv(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100317 qdisc_reset_queue(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900319 for (i = 0; i < t->DPs; i++) {
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100320 struct gred_sched_data *q = t->tab[i];
321
322 if (!q)
323 continue;
324
Eric Dumazeteeca6682012-01-05 02:25:16 +0000325 red_restart(&q->vars);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326 q->backlog = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700327 }
328}
329
Thomas Graf66396072005-11-05 21:14:13 +0100330static inline void gred_destroy_vq(struct gred_sched_data *q)
331{
332 kfree(q);
333}
334
Patrick McHardy1e904742008-01-22 22:11:17 -0800335static inline int gred_change_table_def(struct Qdisc *sch, struct nlattr *dps)
Thomas Graf66396072005-11-05 21:14:13 +0100336{
337 struct gred_sched *table = qdisc_priv(sch);
338 struct tc_gred_sopt *sopt;
339 int i;
340
Patrick McHardy27a34212008-01-23 20:35:39 -0800341 if (dps == NULL)
Thomas Graf66396072005-11-05 21:14:13 +0100342 return -EINVAL;
343
Patrick McHardy1e904742008-01-22 22:11:17 -0800344 sopt = nla_data(dps);
Thomas Graf66396072005-11-05 21:14:13 +0100345
346 if (sopt->DPs > MAX_DPs || sopt->DPs == 0 || sopt->def_DP >= sopt->DPs)
347 return -EINVAL;
348
349 sch_tree_lock(sch);
350 table->DPs = sopt->DPs;
351 table->def = sopt->def_DP;
Thomas Grafb38c7ee2005-11-05 21:14:27 +0100352 table->red_flags = sopt->flags;
Thomas Graf66396072005-11-05 21:14:13 +0100353
354 /*
355 * Every entry point to GRED is synchronized with the above code
356 * and the DP is checked against DPs, i.e. shadowed VQs can no
357 * longer be found so we can unlock right here.
358 */
359 sch_tree_unlock(sch);
360
361 if (sopt->grio) {
362 gred_enable_rio_mode(table);
363 gred_disable_wred_mode(table);
364 if (gred_wred_mode_check(sch))
365 gred_enable_wred_mode(table);
366 } else {
367 gred_disable_rio_mode(table);
368 gred_disable_wred_mode(table);
369 }
370
371 for (i = table->DPs; i < MAX_DPs; i++) {
372 if (table->tab[i]) {
Yang Yingliangc17988a2013-12-23 17:38:58 +0800373 pr_warn("GRED: Warning: Destroying shadowed VQ 0x%x\n",
374 i);
Thomas Graf66396072005-11-05 21:14:13 +0100375 gred_destroy_vq(table->tab[i]);
376 table->tab[i] = NULL;
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900377 }
Thomas Graf66396072005-11-05 21:14:13 +0100378 }
379
Thomas Graf66396072005-11-05 21:14:13 +0100380 return 0;
381}
382
Thomas Graff62d6b92005-11-05 21:14:15 +0100383static inline int gred_change_vq(struct Qdisc *sch, int dp,
Eric Dumazeta73ed262011-12-09 02:46:45 +0000384 struct tc_gred_qopt *ctl, int prio,
Eric Dumazet869aa412011-12-15 22:09:45 +0000385 u8 *stab, u32 max_P,
386 struct gred_sched_data **prealloc)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700387{
388 struct gred_sched *table = qdisc_priv(sch);
Eric Dumazet869aa412011-12-15 22:09:45 +0000389 struct gred_sched_data *q = table->tab[dp];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390
Eric Dumazet869aa412011-12-15 22:09:45 +0000391 if (!q) {
392 table->tab[dp] = q = *prealloc;
393 *prealloc = NULL;
394 if (!q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700395 return -ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700396 }
397
Thomas Graff62d6b92005-11-05 21:14:15 +0100398 q->DP = dp;
399 q->prio = prio;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700400 q->limit = ctl->limit;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700401
Thomas Graf22b33422005-11-05 21:14:16 +0100402 if (q->backlog == 0)
Eric Dumazeteeca6682012-01-05 02:25:16 +0000403 red_end_of_idle_period(&q->vars);
Thomas Graf22b33422005-11-05 21:14:16 +0100404
405 red_set_parms(&q->parms,
406 ctl->qth_min, ctl->qth_max, ctl->Wlog, ctl->Plog,
Eric Dumazeta73ed262011-12-09 02:46:45 +0000407 ctl->Scell_log, stab, max_P);
Eric Dumazeteeca6682012-01-05 02:25:16 +0000408 red_set_vars(&q->vars);
Thomas Graff62d6b92005-11-05 21:14:15 +0100409 return 0;
410}
411
Patrick McHardy27a34212008-01-23 20:35:39 -0800412static const struct nla_policy gred_policy[TCA_GRED_MAX + 1] = {
413 [TCA_GRED_PARMS] = { .len = sizeof(struct tc_gred_qopt) },
414 [TCA_GRED_STAB] = { .len = 256 },
415 [TCA_GRED_DPS] = { .len = sizeof(struct tc_gred_sopt) },
Eric Dumazeta73ed262011-12-09 02:46:45 +0000416 [TCA_GRED_MAX_P] = { .type = NLA_U32 },
Patrick McHardy27a34212008-01-23 20:35:39 -0800417};
418
Patrick McHardy1e904742008-01-22 22:11:17 -0800419static int gred_change(struct Qdisc *sch, struct nlattr *opt)
Thomas Graff62d6b92005-11-05 21:14:15 +0100420{
421 struct gred_sched *table = qdisc_priv(sch);
422 struct tc_gred_qopt *ctl;
Patrick McHardy1e904742008-01-22 22:11:17 -0800423 struct nlattr *tb[TCA_GRED_MAX + 1];
Patrick McHardycee63722008-01-23 20:33:32 -0800424 int err, prio = GRED_DEF_PRIO;
Thomas Graff62d6b92005-11-05 21:14:15 +0100425 u8 *stab;
Eric Dumazeta73ed262011-12-09 02:46:45 +0000426 u32 max_P;
Eric Dumazet869aa412011-12-15 22:09:45 +0000427 struct gred_sched_data *prealloc;
Thomas Graff62d6b92005-11-05 21:14:15 +0100428
Patrick McHardycee63722008-01-23 20:33:32 -0800429 if (opt == NULL)
Thomas Graff62d6b92005-11-05 21:14:15 +0100430 return -EINVAL;
431
Patrick McHardy27a34212008-01-23 20:35:39 -0800432 err = nla_parse_nested(tb, TCA_GRED_MAX, opt, gred_policy);
Patrick McHardycee63722008-01-23 20:33:32 -0800433 if (err < 0)
434 return err;
435
Patrick McHardy1e904742008-01-22 22:11:17 -0800436 if (tb[TCA_GRED_PARMS] == NULL && tb[TCA_GRED_STAB] == NULL)
Thomas Graff62d6b92005-11-05 21:14:15 +0100437 return gred_change_table_def(sch, opt);
438
Patrick McHardy1e904742008-01-22 22:11:17 -0800439 if (tb[TCA_GRED_PARMS] == NULL ||
Patrick McHardy27a34212008-01-23 20:35:39 -0800440 tb[TCA_GRED_STAB] == NULL)
Thomas Graff62d6b92005-11-05 21:14:15 +0100441 return -EINVAL;
442
Eric Dumazeta73ed262011-12-09 02:46:45 +0000443 max_P = tb[TCA_GRED_MAX_P] ? nla_get_u32(tb[TCA_GRED_MAX_P]) : 0;
444
Patrick McHardycee63722008-01-23 20:33:32 -0800445 err = -EINVAL;
Patrick McHardy1e904742008-01-22 22:11:17 -0800446 ctl = nla_data(tb[TCA_GRED_PARMS]);
447 stab = nla_data(tb[TCA_GRED_STAB]);
Thomas Graff62d6b92005-11-05 21:14:15 +0100448
449 if (ctl->DP >= table->DPs)
450 goto errout;
451
452 if (gred_rio_mode(table)) {
453 if (ctl->prio == 0) {
454 int def_prio = GRED_DEF_PRIO;
455
456 if (table->tab[table->def])
457 def_prio = table->tab[table->def]->prio;
458
459 printk(KERN_DEBUG "GRED: DP %u does not have a prio "
460 "setting default to %d\n", ctl->DP, def_prio);
461
462 prio = def_prio;
463 } else
464 prio = ctl->prio;
465 }
466
Eric Dumazet869aa412011-12-15 22:09:45 +0000467 prealloc = kzalloc(sizeof(*prealloc), GFP_KERNEL);
Thomas Graff62d6b92005-11-05 21:14:15 +0100468 sch_tree_lock(sch);
469
Eric Dumazet869aa412011-12-15 22:09:45 +0000470 err = gred_change_vq(sch, ctl->DP, ctl, prio, stab, max_P, &prealloc);
Thomas Graff62d6b92005-11-05 21:14:15 +0100471 if (err < 0)
472 goto errout_locked;
473
Thomas Grafd6fd4e92005-11-05 21:14:10 +0100474 if (gred_rio_mode(table)) {
Thomas Grafdea3f622005-11-05 21:14:09 +0100475 gred_disable_wred_mode(table);
476 if (gred_wred_mode_check(sch))
477 gred_enable_wred_mode(table);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478 }
479
Thomas Graff62d6b92005-11-05 21:14:15 +0100480 err = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481
Thomas Graff62d6b92005-11-05 21:14:15 +0100482errout_locked:
483 sch_tree_unlock(sch);
Eric Dumazet869aa412011-12-15 22:09:45 +0000484 kfree(prealloc);
Thomas Graff62d6b92005-11-05 21:14:15 +0100485errout:
486 return err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700487}
488
Patrick McHardy1e904742008-01-22 22:11:17 -0800489static int gred_init(struct Qdisc *sch, struct nlattr *opt)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700490{
Patrick McHardy1e904742008-01-22 22:11:17 -0800491 struct nlattr *tb[TCA_GRED_MAX + 1];
Patrick McHardycee63722008-01-23 20:33:32 -0800492 int err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493
Patrick McHardycee63722008-01-23 20:33:32 -0800494 if (opt == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495 return -EINVAL;
496
Patrick McHardy27a34212008-01-23 20:35:39 -0800497 err = nla_parse_nested(tb, TCA_GRED_MAX, opt, gred_policy);
Patrick McHardycee63722008-01-23 20:33:32 -0800498 if (err < 0)
499 return err;
500
Patrick McHardy1e904742008-01-22 22:11:17 -0800501 if (tb[TCA_GRED_PARMS] || tb[TCA_GRED_STAB])
Thomas Graf66396072005-11-05 21:14:13 +0100502 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700503
Patrick McHardy1e904742008-01-22 22:11:17 -0800504 return gred_change_table_def(sch, tb[TCA_GRED_DPS]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700505}
506
507static int gred_dump(struct Qdisc *sch, struct sk_buff *skb)
508{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700509 struct gred_sched *table = qdisc_priv(sch);
Patrick McHardy1e904742008-01-22 22:11:17 -0800510 struct nlattr *parms, *opts = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511 int i;
Eric Dumazeta73ed262011-12-09 02:46:45 +0000512 u32 max_p[MAX_DPs];
Thomas Grafe0636822005-11-05 21:14:12 +0100513 struct tc_gred_sopt sopt = {
514 .DPs = table->DPs,
515 .def_DP = table->def,
516 .grio = gred_rio_mode(table),
Thomas Grafb38c7ee2005-11-05 21:14:27 +0100517 .flags = table->red_flags,
Thomas Grafe0636822005-11-05 21:14:12 +0100518 };
Linus Torvalds1da177e2005-04-16 15:20:36 -0700519
Patrick McHardy1e904742008-01-22 22:11:17 -0800520 opts = nla_nest_start(skb, TCA_OPTIONS);
521 if (opts == NULL)
522 goto nla_put_failure;
David S. Miller1b34ec42012-03-29 05:11:39 -0400523 if (nla_put(skb, TCA_GRED_DPS, sizeof(sopt), &sopt))
524 goto nla_put_failure;
Eric Dumazeta73ed262011-12-09 02:46:45 +0000525
526 for (i = 0; i < MAX_DPs; i++) {
527 struct gred_sched_data *q = table->tab[i];
528
529 max_p[i] = q ? q->parms.max_P : 0;
530 }
David S. Miller1b34ec42012-03-29 05:11:39 -0400531 if (nla_put(skb, TCA_GRED_MAX_P, sizeof(max_p), max_p))
532 goto nla_put_failure;
Eric Dumazeta73ed262011-12-09 02:46:45 +0000533
Patrick McHardy1e904742008-01-22 22:11:17 -0800534 parms = nla_nest_start(skb, TCA_GRED_PARMS);
535 if (parms == NULL)
536 goto nla_put_failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700537
Thomas Graf05f1cc02005-11-05 21:14:11 +0100538 for (i = 0; i < MAX_DPs; i++) {
539 struct gred_sched_data *q = table->tab[i];
540 struct tc_gred_qopt opt;
David Ward1fe37b12012-09-13 05:22:34 +0000541 unsigned long qavg;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700542
Thomas Graf05f1cc02005-11-05 21:14:11 +0100543 memset(&opt, 0, sizeof(opt));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700544
545 if (!q) {
546 /* hack -- fix at some point with proper message
547 This is how we indicate to tc that there is no VQ
548 at this DP */
549
Thomas Graf05f1cc02005-11-05 21:14:11 +0100550 opt.DP = MAX_DPs + i;
551 goto append_opt;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552 }
553
Thomas Graf05f1cc02005-11-05 21:14:11 +0100554 opt.limit = q->limit;
555 opt.DP = q->DP;
556 opt.backlog = q->backlog;
557 opt.prio = q->prio;
Thomas Graf22b33422005-11-05 21:14:16 +0100558 opt.qth_min = q->parms.qth_min >> q->parms.Wlog;
559 opt.qth_max = q->parms.qth_max >> q->parms.Wlog;
560 opt.Wlog = q->parms.Wlog;
561 opt.Plog = q->parms.Plog;
562 opt.Scell_log = q->parms.Scell_log;
563 opt.other = q->stats.other;
564 opt.early = q->stats.prob_drop;
565 opt.forced = q->stats.forced_drop;
566 opt.pdrop = q->stats.pdrop;
Thomas Graf05f1cc02005-11-05 21:14:11 +0100567 opt.packets = q->packetsin;
568 opt.bytesin = q->bytesin;
569
David Ward244b65d2012-04-15 12:31:45 +0000570 if (gred_wred_mode(table))
571 gred_load_wred_set(table, q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700572
David Ward1fe37b12012-09-13 05:22:34 +0000573 qavg = red_calc_qavg(&q->parms, &q->vars,
574 q->vars.qavg >> q->parms.Wlog);
575 opt.qave = qavg >> q->parms.Wlog;
Thomas Graf22b33422005-11-05 21:14:16 +0100576
Thomas Graf05f1cc02005-11-05 21:14:11 +0100577append_opt:
Patrick McHardy1e904742008-01-22 22:11:17 -0800578 if (nla_append(skb, sizeof(opt), &opt) < 0)
579 goto nla_put_failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700580 }
581
Patrick McHardy1e904742008-01-22 22:11:17 -0800582 nla_nest_end(skb, parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700583
Patrick McHardy1e904742008-01-22 22:11:17 -0800584 return nla_nest_end(skb, opts);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700585
Patrick McHardy1e904742008-01-22 22:11:17 -0800586nla_put_failure:
Thomas Grafbc3ed282008-06-03 16:36:54 -0700587 nla_nest_cancel(skb, opts);
588 return -EMSGSIZE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700589}
590
591static void gred_destroy(struct Qdisc *sch)
592{
593 struct gred_sched *table = qdisc_priv(sch);
594 int i;
595
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100596 for (i = 0; i < table->DPs; i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700597 if (table->tab[i])
Thomas Graf66396072005-11-05 21:14:13 +0100598 gred_destroy_vq(table->tab[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599 }
600}
601
Eric Dumazet20fea082007-11-14 01:44:41 -0800602static struct Qdisc_ops gred_qdisc_ops __read_mostly = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700603 .id = "gred",
604 .priv_size = sizeof(struct gred_sched),
605 .enqueue = gred_enqueue,
606 .dequeue = gred_dequeue,
Jarek Poplawski8e3af972008-10-31 00:45:55 -0700607 .peek = qdisc_peek_head,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608 .drop = gred_drop,
609 .init = gred_init,
610 .reset = gred_reset,
611 .destroy = gred_destroy,
612 .change = gred_change,
613 .dump = gred_dump,
614 .owner = THIS_MODULE,
615};
616
617static int __init gred_module_init(void)
618{
619 return register_qdisc(&gred_qdisc_ops);
620}
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100621
622static void __exit gred_module_exit(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700623{
624 unregister_qdisc(&gred_qdisc_ops);
625}
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100626
Linus Torvalds1da177e2005-04-16 15:20:36 -0700627module_init(gred_module_init)
628module_exit(gred_module_exit)
Thomas Graf1e4dfaf92005-11-05 21:14:25 +0100629
Linus Torvalds1da177e2005-04-16 15:20:36 -0700630MODULE_LICENSE("GPL");