blob: 3a9d226ff1e41eba0492168f3166e4a9a3cb8f15 [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 Graf1e4dfaf2005-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
Linus Torvalds1da177e2005-04-16 15:20:36 -070021#include <linux/module.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#include <linux/types.h>
23#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include <linux/skbuff.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070025#include <net/pkt_sched.h>
Thomas Graf22b33422005-11-05 21:14:16 +010026#include <net/red.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070027
Thomas Graff62d6b92005-11-05 21:14:15 +010028#define GRED_DEF_PRIO (MAX_DPs / 2)
Thomas Graf716a1b42005-11-05 21:14:20 +010029#define GRED_VQ_MASK (MAX_DPs - 1)
Thomas Graff62d6b92005-11-05 21:14:15 +010030
Linus Torvalds1da177e2005-04-16 15:20:36 -070031struct gred_sched_data;
32struct gred_sched;
33
34struct gred_sched_data
35{
Linus Torvalds1da177e2005-04-16 15:20:36 -070036 u32 limit; /* HARD maximal queue length */
Linus Torvalds1da177e2005-04-16 15:20:36 -070037 u32 DP; /* the drop pramaters */
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 Graf1e4dfaf2005-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;
44 struct red_stats stats;
Linus Torvalds1da177e2005-04-16 15:20:36 -070045};
46
Thomas Grafdea3f622005-11-05 21:14:09 +010047enum {
48 GRED_WRED_MODE = 1,
Thomas Grafd6fd4e92005-11-05 21:14:10 +010049 GRED_RIO_MODE,
Thomas Grafdea3f622005-11-05 21:14:09 +010050};
51
Linus Torvalds1da177e2005-04-16 15:20:36 -070052struct gred_sched
53{
54 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 Graf1e4dfaf2005-11-05 21:14:25 +010057 u32 DPs;
58 u32 def;
Thomas Graf70517032005-11-05 21:14:23 +010059 struct red_parms 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
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
Thomas Graf22b33422005-11-05 21:14:16 +0100114static 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
Thomas Graf716a1b42005-11-05 21:14:20 +0100124static inline u16 tc_index_to_dp(struct sk_buff *skb)
125{
126 return skb->tc_index & GRED_VQ_MASK;
127}
128
Thomas Graf70517032005-11-05 21:14:23 +0100129static 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
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
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100152static int gred_enqueue(struct sk_buff *skb, struct Qdisc* sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700154 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
Thomas Graf716a1b42005-11-05 21:14:20 +0100159 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) {
Thomas Graf18e3fb842005-11-05 21:14:21 +0100160 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 */
167 if (skb_queue_len(&sch->q) < sch->dev->tx_queue_len)
168 return qdisc_enqueue_tail(skb, sch);
169 else
170 goto drop;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171 }
Thomas Graf18e3fb842005-11-05 21:14:21 +0100172
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173 /* fix tc_index? --could be controvesial but needed for
174 requeueing */
Thomas Graf18e3fb842005-11-05 21:14:21 +0100175 skb->tc_index = (skb->tc_index & ~GRED_VQ_MASK) | dp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176 }
177
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100178 /* sum up all the qaves of prios <= to ours to get the new qave */
Thomas Grafd6fd4e92005-11-05 21:14:10 +0100179 if (!gred_wred_mode(t) && gred_rio_mode(t)) {
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100180 int i;
181
182 for (i = 0; i < t->DPs; i++) {
183 if (t->tab[i] && t->tab[i]->prio < q->prio &&
Thomas Graf22b33422005-11-05 21:14:16 +0100184 !red_is_idling(&t->tab[i]->parms))
185 qavg +=t->tab[i]->parms.qavg;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186 }
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100187
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188 }
189
190 q->packetsin++;
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100191 q->bytesin += skb->len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700192
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100193 if (gred_wred_mode(t))
Thomas Graf70517032005-11-05 21:14:23 +0100194 gred_load_wred_set(t, q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195
Thomas Graf22b33422005-11-05 21:14:16 +0100196 q->parms.qavg = red_calc_qavg(&q->parms, gred_backlog(t, q, sch));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197
Thomas Graf22b33422005-11-05 21:14:16 +0100198 if (red_is_idling(&q->parms))
199 red_end_of_idle_period(&q->parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200
Thomas Grafdea3f622005-11-05 21:14:09 +0100201 if (gred_wred_mode(t))
Thomas Graf70517032005-11-05 21:14:23 +0100202 gred_store_wred_set(t, q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203
Thomas Graf22b33422005-11-05 21:14:16 +0100204 switch (red_action(&q->parms, q->parms.qavg + qavg)) {
205 case RED_DONT_MARK:
206 break;
207
208 case RED_PROB_MARK:
209 sch->qstats.overlimits++;
Thomas Grafb38c7ee2005-11-05 21:14:27 +0100210 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;
Thomas Graf22b33422005-11-05 21:14:16 +0100217
218 case RED_HARD_MARK:
219 sch->qstats.overlimits++;
Thomas Grafbdc450a2005-11-05 21:14:28 +0100220 if (gred_use_harddrop(t) || !gred_use_ecn(t) ||
221 !INET_ECN_set_ce(skb)) {
Thomas Grafb38c7ee2005-11-05 21:14:27 +0100222 q->stats.forced_drop++;
223 goto congestion_drop;
224 }
225 q->stats.forced_mark++;
226 break;
Thomas Graf22b33422005-11-05 21:14:16 +0100227 }
228
229 if (q->backlog + skb->len <= q->limit) {
230 q->backlog += skb->len;
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100231 return qdisc_enqueue_tail(skb, sch);
Thomas Graf22b33422005-11-05 21:14:16 +0100232 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700233
Thomas Graf22b33422005-11-05 21:14:16 +0100234 q->stats.pdrop++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700235drop:
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100236 return qdisc_drop(skb, sch);
Thomas Grafc3b553c2005-11-05 21:14:18 +0100237
238congestion_drop:
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100239 qdisc_drop(skb, sch);
Thomas Grafc3b553c2005-11-05 21:14:18 +0100240 return NET_XMIT_CN;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241}
242
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100243static int gred_requeue(struct sk_buff *skb, struct Qdisc* sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244{
Thomas Graf716a1b42005-11-05 21:14:20 +0100245 struct gred_sched *t = qdisc_priv(sch);
Thomas Graf18e3fb842005-11-05 21:14:21 +0100246 struct gred_sched_data *q;
247 u16 dp = tc_index_to_dp(skb);
Thomas Graf22b33422005-11-05 21:14:16 +0100248
Thomas Graf18e3fb842005-11-05 21:14:21 +0100249 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) {
250 if (net_ratelimit())
251 printk(KERN_WARNING "GRED: Unable to relocate VQ 0x%x "
252 "for requeue, screwing up backlog.\n",
253 tc_index_to_dp(skb));
254 } else {
255 if (red_is_idling(&q->parms))
256 red_end_of_idle_period(&q->parms);
257 q->backlog += skb->len;
258 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100260 return qdisc_requeue(skb, sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261}
262
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100263static struct sk_buff *gred_dequeue(struct Qdisc* sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264{
265 struct sk_buff *skb;
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100266 struct gred_sched *t = qdisc_priv(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100268 skb = qdisc_dequeue_head(sch);
269
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270 if (skb) {
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100271 struct gred_sched_data *q;
Thomas Graf18e3fb842005-11-05 21:14:21 +0100272 u16 dp = tc_index_to_dp(skb);
273
274 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) {
275 if (net_ratelimit())
276 printk(KERN_WARNING "GRED: Unable to relocate "
277 "VQ 0x%x after dequeue, screwing up "
278 "backlog.\n", tc_index_to_dp(skb));
279 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280 q->backlog -= skb->len;
Thomas Graf18e3fb842005-11-05 21:14:21 +0100281
Thomas Grafdea3f622005-11-05 21:14:09 +0100282 if (!q->backlog && !gred_wred_mode(t))
Thomas Graf22b33422005-11-05 21:14:16 +0100283 red_start_of_idle_period(&q->parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700284 }
Thomas Graf18e3fb842005-11-05 21:14:21 +0100285
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286 return skb;
287 }
288
Thomas Grafd8f64e12005-11-05 21:14:26 +0100289 if (gred_wred_mode(t) && !red_is_idling(&t->wred_set))
Thomas Graf70517032005-11-05 21:14:23 +0100290 red_start_of_idle_period(&t->wred_set);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291
292 return NULL;
293}
294
295static unsigned int gred_drop(struct Qdisc* sch)
296{
297 struct sk_buff *skb;
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100298 struct gred_sched *t = qdisc_priv(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100300 skb = qdisc_dequeue_tail(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301 if (skb) {
302 unsigned int len = skb->len;
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100303 struct gred_sched_data *q;
Thomas Graf18e3fb842005-11-05 21:14:21 +0100304 u16 dp = tc_index_to_dp(skb);
305
306 if (dp >= t->DPs || (q = t->tab[dp]) == NULL) {
307 if (net_ratelimit())
308 printk(KERN_WARNING "GRED: Unable to relocate "
309 "VQ 0x%x while dropping, screwing up "
310 "backlog.\n", tc_index_to_dp(skb));
311 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312 q->backlog -= len;
Thomas Graf22b33422005-11-05 21:14:16 +0100313 q->stats.other++;
Thomas Graf18e3fb842005-11-05 21:14:21 +0100314
Thomas Grafdea3f622005-11-05 21:14:09 +0100315 if (!q->backlog && !gred_wred_mode(t))
Thomas Graf22b33422005-11-05 21:14:16 +0100316 red_start_of_idle_period(&q->parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317 }
318
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100319 qdisc_drop(skb, sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320 return len;
321 }
322
Thomas Grafd8f64e12005-11-05 21:14:26 +0100323 if (gred_wred_mode(t) && !red_is_idling(&t->wred_set))
Thomas Graf70517032005-11-05 21:14:23 +0100324 red_start_of_idle_period(&t->wred_set);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326 return 0;
327
328}
329
330static void gred_reset(struct Qdisc* sch)
331{
332 int i;
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100333 struct gred_sched *t = qdisc_priv(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700334
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100335 qdisc_reset_queue(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700336
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900337 for (i = 0; i < t->DPs; i++) {
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100338 struct gred_sched_data *q = t->tab[i];
339
340 if (!q)
341 continue;
342
Thomas Graf22b33422005-11-05 21:14:16 +0100343 red_restart(&q->parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700344 q->backlog = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700345 }
346}
347
Thomas Graf66396072005-11-05 21:14:13 +0100348static inline void gred_destroy_vq(struct gred_sched_data *q)
349{
350 kfree(q);
351}
352
Patrick McHardy1e904742008-01-22 22:11:17 -0800353static inline int gred_change_table_def(struct Qdisc *sch, struct nlattr *dps)
Thomas Graf66396072005-11-05 21:14:13 +0100354{
355 struct gred_sched *table = qdisc_priv(sch);
356 struct tc_gred_sopt *sopt;
357 int i;
358
Patrick McHardy27a34212008-01-23 20:35:39 -0800359 if (dps == NULL)
Thomas Graf66396072005-11-05 21:14:13 +0100360 return -EINVAL;
361
Patrick McHardy1e904742008-01-22 22:11:17 -0800362 sopt = nla_data(dps);
Thomas Graf66396072005-11-05 21:14:13 +0100363
364 if (sopt->DPs > MAX_DPs || sopt->DPs == 0 || sopt->def_DP >= sopt->DPs)
365 return -EINVAL;
366
367 sch_tree_lock(sch);
368 table->DPs = sopt->DPs;
369 table->def = sopt->def_DP;
Thomas Grafb38c7ee2005-11-05 21:14:27 +0100370 table->red_flags = sopt->flags;
Thomas Graf66396072005-11-05 21:14:13 +0100371
372 /*
373 * Every entry point to GRED is synchronized with the above code
374 * and the DP is checked against DPs, i.e. shadowed VQs can no
375 * longer be found so we can unlock right here.
376 */
377 sch_tree_unlock(sch);
378
379 if (sopt->grio) {
380 gred_enable_rio_mode(table);
381 gred_disable_wred_mode(table);
382 if (gred_wred_mode_check(sch))
383 gred_enable_wred_mode(table);
384 } else {
385 gred_disable_rio_mode(table);
386 gred_disable_wred_mode(table);
387 }
388
389 for (i = table->DPs; i < MAX_DPs; i++) {
390 if (table->tab[i]) {
391 printk(KERN_WARNING "GRED: Warning: Destroying "
392 "shadowed VQ 0x%x\n", i);
393 gred_destroy_vq(table->tab[i]);
394 table->tab[i] = NULL;
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900395 }
Thomas Graf66396072005-11-05 21:14:13 +0100396 }
397
Thomas Graf66396072005-11-05 21:14:13 +0100398 return 0;
399}
400
Thomas Graff62d6b92005-11-05 21:14:15 +0100401static inline int gred_change_vq(struct Qdisc *sch, int dp,
402 struct tc_gred_qopt *ctl, int prio, u8 *stab)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403{
404 struct gred_sched *table = qdisc_priv(sch);
405 struct gred_sched_data *q;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406
Thomas Graff62d6b92005-11-05 21:14:15 +0100407 if (table->tab[dp] == NULL) {
Panagiotis Issaris0da974f2006-07-21 14:51:30 -0700408 table->tab[dp] = kzalloc(sizeof(*q), GFP_KERNEL);
Thomas Graff62d6b92005-11-05 21:14:15 +0100409 if (table->tab[dp] == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700410 return -ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700411 }
412
Thomas Graff62d6b92005-11-05 21:14:15 +0100413 q = table->tab[dp];
414 q->DP = dp;
415 q->prio = prio;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700416 q->limit = ctl->limit;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700417
Thomas Graf22b33422005-11-05 21:14:16 +0100418 if (q->backlog == 0)
419 red_end_of_idle_period(&q->parms);
420
421 red_set_parms(&q->parms,
422 ctl->qth_min, ctl->qth_max, ctl->Wlog, ctl->Plog,
423 ctl->Scell_log, stab);
424
Thomas Graff62d6b92005-11-05 21:14:15 +0100425 return 0;
426}
427
Patrick McHardy27a34212008-01-23 20:35:39 -0800428static const struct nla_policy gred_policy[TCA_GRED_MAX + 1] = {
429 [TCA_GRED_PARMS] = { .len = sizeof(struct tc_gred_qopt) },
430 [TCA_GRED_STAB] = { .len = 256 },
431 [TCA_GRED_DPS] = { .len = sizeof(struct tc_gred_sopt) },
432};
433
Patrick McHardy1e904742008-01-22 22:11:17 -0800434static int gred_change(struct Qdisc *sch, struct nlattr *opt)
Thomas Graff62d6b92005-11-05 21:14:15 +0100435{
436 struct gred_sched *table = qdisc_priv(sch);
437 struct tc_gred_qopt *ctl;
Patrick McHardy1e904742008-01-22 22:11:17 -0800438 struct nlattr *tb[TCA_GRED_MAX + 1];
Patrick McHardycee63722008-01-23 20:33:32 -0800439 int err, prio = GRED_DEF_PRIO;
Thomas Graff62d6b92005-11-05 21:14:15 +0100440 u8 *stab;
441
Patrick McHardycee63722008-01-23 20:33:32 -0800442 if (opt == NULL)
Thomas Graff62d6b92005-11-05 21:14:15 +0100443 return -EINVAL;
444
Patrick McHardy27a34212008-01-23 20:35:39 -0800445 err = nla_parse_nested(tb, TCA_GRED_MAX, opt, gred_policy);
Patrick McHardycee63722008-01-23 20:33:32 -0800446 if (err < 0)
447 return err;
448
Patrick McHardy1e904742008-01-22 22:11:17 -0800449 if (tb[TCA_GRED_PARMS] == NULL && tb[TCA_GRED_STAB] == NULL)
Thomas Graff62d6b92005-11-05 21:14:15 +0100450 return gred_change_table_def(sch, opt);
451
Patrick McHardy1e904742008-01-22 22:11:17 -0800452 if (tb[TCA_GRED_PARMS] == NULL ||
Patrick McHardy27a34212008-01-23 20:35:39 -0800453 tb[TCA_GRED_STAB] == NULL)
Thomas Graff62d6b92005-11-05 21:14:15 +0100454 return -EINVAL;
455
Patrick McHardycee63722008-01-23 20:33:32 -0800456 err = -EINVAL;
Patrick McHardy1e904742008-01-22 22:11:17 -0800457 ctl = nla_data(tb[TCA_GRED_PARMS]);
458 stab = nla_data(tb[TCA_GRED_STAB]);
Thomas Graff62d6b92005-11-05 21:14:15 +0100459
460 if (ctl->DP >= table->DPs)
461 goto errout;
462
463 if (gred_rio_mode(table)) {
464 if (ctl->prio == 0) {
465 int def_prio = GRED_DEF_PRIO;
466
467 if (table->tab[table->def])
468 def_prio = table->tab[table->def]->prio;
469
470 printk(KERN_DEBUG "GRED: DP %u does not have a prio "
471 "setting default to %d\n", ctl->DP, def_prio);
472
473 prio = def_prio;
474 } else
475 prio = ctl->prio;
476 }
477
478 sch_tree_lock(sch);
479
480 err = gred_change_vq(sch, ctl->DP, ctl, prio, stab);
481 if (err < 0)
482 goto errout_locked;
483
Thomas Grafd6fd4e92005-11-05 21:14:10 +0100484 if (gred_rio_mode(table)) {
Thomas Grafdea3f622005-11-05 21:14:09 +0100485 gred_disable_wred_mode(table);
486 if (gred_wred_mode_check(sch))
487 gred_enable_wred_mode(table);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700488 }
489
Thomas Graff62d6b92005-11-05 21:14:15 +0100490 err = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700491
Thomas Graff62d6b92005-11-05 21:14:15 +0100492errout_locked:
493 sch_tree_unlock(sch);
494errout:
495 return err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496}
497
Patrick McHardy1e904742008-01-22 22:11:17 -0800498static int gred_init(struct Qdisc *sch, struct nlattr *opt)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499{
Patrick McHardy1e904742008-01-22 22:11:17 -0800500 struct nlattr *tb[TCA_GRED_MAX + 1];
Patrick McHardycee63722008-01-23 20:33:32 -0800501 int err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700502
Patrick McHardycee63722008-01-23 20:33:32 -0800503 if (opt == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700504 return -EINVAL;
505
Patrick McHardy27a34212008-01-23 20:35:39 -0800506 err = nla_parse_nested(tb, TCA_GRED_MAX, opt, gred_policy);
Patrick McHardycee63722008-01-23 20:33:32 -0800507 if (err < 0)
508 return err;
509
Patrick McHardy1e904742008-01-22 22:11:17 -0800510 if (tb[TCA_GRED_PARMS] || tb[TCA_GRED_STAB])
Thomas Graf66396072005-11-05 21:14:13 +0100511 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512
Patrick McHardy1e904742008-01-22 22:11:17 -0800513 return gred_change_table_def(sch, tb[TCA_GRED_DPS]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700514}
515
516static int gred_dump(struct Qdisc *sch, struct sk_buff *skb)
517{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700518 struct gred_sched *table = qdisc_priv(sch);
Patrick McHardy1e904742008-01-22 22:11:17 -0800519 struct nlattr *parms, *opts = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 int i;
Thomas Grafe0636822005-11-05 21:14:12 +0100521 struct tc_gred_sopt sopt = {
522 .DPs = table->DPs,
523 .def_DP = table->def,
524 .grio = gred_rio_mode(table),
Thomas Grafb38c7ee2005-11-05 21:14:27 +0100525 .flags = table->red_flags,
Thomas Grafe0636822005-11-05 21:14:12 +0100526 };
Linus Torvalds1da177e2005-04-16 15:20:36 -0700527
Patrick McHardy1e904742008-01-22 22:11:17 -0800528 opts = nla_nest_start(skb, TCA_OPTIONS);
529 if (opts == NULL)
530 goto nla_put_failure;
531 NLA_PUT(skb, TCA_GRED_DPS, sizeof(sopt), &sopt);
532 parms = nla_nest_start(skb, TCA_GRED_PARMS);
533 if (parms == NULL)
534 goto nla_put_failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700535
Thomas Graf05f1cc02005-11-05 21:14:11 +0100536 for (i = 0; i < MAX_DPs; i++) {
537 struct gred_sched_data *q = table->tab[i];
538 struct tc_gred_qopt opt;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539
Thomas Graf05f1cc02005-11-05 21:14:11 +0100540 memset(&opt, 0, sizeof(opt));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541
542 if (!q) {
543 /* hack -- fix at some point with proper message
544 This is how we indicate to tc that there is no VQ
545 at this DP */
546
Thomas Graf05f1cc02005-11-05 21:14:11 +0100547 opt.DP = MAX_DPs + i;
548 goto append_opt;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700549 }
550
Thomas Graf05f1cc02005-11-05 21:14:11 +0100551 opt.limit = q->limit;
552 opt.DP = q->DP;
553 opt.backlog = q->backlog;
554 opt.prio = q->prio;
Thomas Graf22b33422005-11-05 21:14:16 +0100555 opt.qth_min = q->parms.qth_min >> q->parms.Wlog;
556 opt.qth_max = q->parms.qth_max >> q->parms.Wlog;
557 opt.Wlog = q->parms.Wlog;
558 opt.Plog = q->parms.Plog;
559 opt.Scell_log = q->parms.Scell_log;
560 opt.other = q->stats.other;
561 opt.early = q->stats.prob_drop;
562 opt.forced = q->stats.forced_drop;
563 opt.pdrop = q->stats.pdrop;
Thomas Graf05f1cc02005-11-05 21:14:11 +0100564 opt.packets = q->packetsin;
565 opt.bytesin = q->bytesin;
566
Thomas Graf22b33422005-11-05 21:14:16 +0100567 if (gred_wred_mode(table)) {
568 q->parms.qidlestart =
569 table->tab[table->def]->parms.qidlestart;
570 q->parms.qavg = table->tab[table->def]->parms.qavg;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700571 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700572
Thomas Graf22b33422005-11-05 21:14:16 +0100573 opt.qave = red_calc_qavg(&q->parms, q->parms.qavg);
574
Thomas Graf05f1cc02005-11-05 21:14:11 +0100575append_opt:
Patrick McHardy1e904742008-01-22 22:11:17 -0800576 if (nla_append(skb, sizeof(opt), &opt) < 0)
577 goto nla_put_failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700578 }
579
Patrick McHardy1e904742008-01-22 22:11:17 -0800580 nla_nest_end(skb, parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700581
Patrick McHardy1e904742008-01-22 22:11:17 -0800582 return nla_nest_end(skb, opts);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700583
Patrick McHardy1e904742008-01-22 22:11:17 -0800584nla_put_failure:
585 return nla_nest_cancel(skb, opts);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700586}
587
588static void gred_destroy(struct Qdisc *sch)
589{
590 struct gred_sched *table = qdisc_priv(sch);
591 int i;
592
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100593 for (i = 0; i < table->DPs; i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700594 if (table->tab[i])
Thomas Graf66396072005-11-05 21:14:13 +0100595 gred_destroy_vq(table->tab[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700596 }
597}
598
Eric Dumazet20fea082007-11-14 01:44:41 -0800599static struct Qdisc_ops gred_qdisc_ops __read_mostly = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600 .id = "gred",
601 .priv_size = sizeof(struct gred_sched),
602 .enqueue = gred_enqueue,
603 .dequeue = gred_dequeue,
604 .requeue = gred_requeue,
605 .drop = gred_drop,
606 .init = gred_init,
607 .reset = gred_reset,
608 .destroy = gred_destroy,
609 .change = gred_change,
610 .dump = gred_dump,
611 .owner = THIS_MODULE,
612};
613
614static int __init gred_module_init(void)
615{
616 return register_qdisc(&gred_qdisc_ops);
617}
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100618
619static void __exit gred_module_exit(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620{
621 unregister_qdisc(&gred_qdisc_ops);
622}
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100623
Linus Torvalds1da177e2005-04-16 15:20:36 -0700624module_init(gred_module_init)
625module_exit(gred_module_exit)
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100626
Linus Torvalds1da177e2005-04-16 15:20:36 -0700627MODULE_LICENSE("GPL");