blob: 40408d595c08da0163e9a2c4c358e0293d4cebce [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 */
David S. Miller5ce2d482008-07-08 17:06:30 -0700167 if (skb_queue_len(&sch->q) < qdisc_dev(sch)->tx_queue_len)
Thomas Graf18e3fb842005-11-05 21:14:21 +0100168 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++;
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700191 q->bytesin += qdisc_pkt_len(skb);
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
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700229 if (q->backlog + qdisc_pkt_len(skb) <= q->limit) {
230 q->backlog += qdisc_pkt_len(skb);
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 struct sk_buff *gred_dequeue(struct Qdisc* sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244{
245 struct sk_buff *skb;
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100246 struct gred_sched *t = qdisc_priv(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100248 skb = qdisc_dequeue_head(sch);
249
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250 if (skb) {
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100251 struct gred_sched_data *q;
Thomas Graf18e3fb842005-11-05 21:14:21 +0100252 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 {
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700260 q->backlog -= qdisc_pkt_len(skb);
Thomas Graf18e3fb842005-11-05 21:14:21 +0100261
Thomas Grafdea3f622005-11-05 21:14:09 +0100262 if (!q->backlog && !gred_wred_mode(t))
Thomas Graf22b33422005-11-05 21:14:16 +0100263 red_start_of_idle_period(&q->parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264 }
Thomas Graf18e3fb842005-11-05 21:14:21 +0100265
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266 return skb;
267 }
268
Thomas Grafd8f64e12005-11-05 21:14:26 +0100269 if (gred_wred_mode(t) && !red_is_idling(&t->wred_set))
Thomas Graf70517032005-11-05 21:14:23 +0100270 red_start_of_idle_period(&t->wred_set);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271
272 return NULL;
273}
274
275static unsigned int gred_drop(struct Qdisc* sch)
276{
277 struct sk_buff *skb;
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100278 struct gred_sched *t = qdisc_priv(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100280 skb = qdisc_dequeue_tail(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281 if (skb) {
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700282 unsigned int len = qdisc_pkt_len(skb);
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100283 struct gred_sched_data *q;
Thomas Graf18e3fb842005-11-05 21:14:21 +0100284 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 {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700292 q->backlog -= len;
Thomas Graf22b33422005-11-05 21:14:16 +0100293 q->stats.other++;
Thomas Graf18e3fb842005-11-05 21:14:21 +0100294
Thomas Grafdea3f622005-11-05 21:14:09 +0100295 if (!q->backlog && !gred_wred_mode(t))
Thomas Graf22b33422005-11-05 21:14:16 +0100296 red_start_of_idle_period(&q->parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700297 }
298
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100299 qdisc_drop(skb, sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700300 return len;
301 }
302
Thomas Grafd8f64e12005-11-05 21:14:26 +0100303 if (gred_wred_mode(t) && !red_is_idling(&t->wred_set))
Thomas Graf70517032005-11-05 21:14:23 +0100304 red_start_of_idle_period(&t->wred_set);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306 return 0;
307
308}
309
310static void gred_reset(struct Qdisc* sch)
311{
312 int i;
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100313 struct gred_sched *t = qdisc_priv(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314
Thomas Grafedf7a7b2005-11-05 21:14:19 +0100315 qdisc_reset_queue(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900317 for (i = 0; i < t->DPs; i++) {
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100318 struct gred_sched_data *q = t->tab[i];
319
320 if (!q)
321 continue;
322
Thomas Graf22b33422005-11-05 21:14:16 +0100323 red_restart(&q->parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324 q->backlog = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325 }
326}
327
Thomas Graf66396072005-11-05 21:14:13 +0100328static inline void gred_destroy_vq(struct gred_sched_data *q)
329{
330 kfree(q);
331}
332
Patrick McHardy1e904742008-01-22 22:11:17 -0800333static inline int gred_change_table_def(struct Qdisc *sch, struct nlattr *dps)
Thomas Graf66396072005-11-05 21:14:13 +0100334{
335 struct gred_sched *table = qdisc_priv(sch);
336 struct tc_gred_sopt *sopt;
337 int i;
338
Patrick McHardy27a34212008-01-23 20:35:39 -0800339 if (dps == NULL)
Thomas Graf66396072005-11-05 21:14:13 +0100340 return -EINVAL;
341
Patrick McHardy1e904742008-01-22 22:11:17 -0800342 sopt = nla_data(dps);
Thomas Graf66396072005-11-05 21:14:13 +0100343
344 if (sopt->DPs > MAX_DPs || sopt->DPs == 0 || sopt->def_DP >= sopt->DPs)
345 return -EINVAL;
346
347 sch_tree_lock(sch);
348 table->DPs = sopt->DPs;
349 table->def = sopt->def_DP;
Thomas Grafb38c7ee2005-11-05 21:14:27 +0100350 table->red_flags = sopt->flags;
Thomas Graf66396072005-11-05 21:14:13 +0100351
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);
358
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;
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900375 }
Thomas Graf66396072005-11-05 21:14:13 +0100376 }
377
Thomas Graf66396072005-11-05 21:14:13 +0100378 return 0;
379}
380
Thomas Graff62d6b92005-11-05 21:14:15 +0100381static inline int gred_change_vq(struct Qdisc *sch, int dp,
382 struct tc_gred_qopt *ctl, int prio, u8 *stab)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383{
384 struct gred_sched *table = qdisc_priv(sch);
385 struct gred_sched_data *q;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386
Thomas Graff62d6b92005-11-05 21:14:15 +0100387 if (table->tab[dp] == NULL) {
Panagiotis Issaris0da974f2006-07-21 14:51:30 -0700388 table->tab[dp] = kzalloc(sizeof(*q), GFP_KERNEL);
Thomas Graff62d6b92005-11-05 21:14:15 +0100389 if (table->tab[dp] == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390 return -ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391 }
392
Thomas Graff62d6b92005-11-05 21:14:15 +0100393 q = table->tab[dp];
394 q->DP = dp;
395 q->prio = prio;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700396 q->limit = ctl->limit;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700397
Thomas Graf22b33422005-11-05 21:14:16 +0100398 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
Thomas Graff62d6b92005-11-05 21:14:15 +0100405 return 0;
406}
407
Patrick McHardy27a34212008-01-23 20:35:39 -0800408static 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
Patrick McHardy1e904742008-01-22 22:11:17 -0800414static int gred_change(struct Qdisc *sch, struct nlattr *opt)
Thomas Graff62d6b92005-11-05 21:14:15 +0100415{
416 struct gred_sched *table = qdisc_priv(sch);
417 struct tc_gred_qopt *ctl;
Patrick McHardy1e904742008-01-22 22:11:17 -0800418 struct nlattr *tb[TCA_GRED_MAX + 1];
Patrick McHardycee63722008-01-23 20:33:32 -0800419 int err, prio = GRED_DEF_PRIO;
Thomas Graff62d6b92005-11-05 21:14:15 +0100420 u8 *stab;
421
Patrick McHardycee63722008-01-23 20:33:32 -0800422 if (opt == NULL)
Thomas Graff62d6b92005-11-05 21:14:15 +0100423 return -EINVAL;
424
Patrick McHardy27a34212008-01-23 20:35:39 -0800425 err = nla_parse_nested(tb, TCA_GRED_MAX, opt, gred_policy);
Patrick McHardycee63722008-01-23 20:33:32 -0800426 if (err < 0)
427 return err;
428
Patrick McHardy1e904742008-01-22 22:11:17 -0800429 if (tb[TCA_GRED_PARMS] == NULL && tb[TCA_GRED_STAB] == NULL)
Thomas Graff62d6b92005-11-05 21:14:15 +0100430 return gred_change_table_def(sch, opt);
431
Patrick McHardy1e904742008-01-22 22:11:17 -0800432 if (tb[TCA_GRED_PARMS] == NULL ||
Patrick McHardy27a34212008-01-23 20:35:39 -0800433 tb[TCA_GRED_STAB] == NULL)
Thomas Graff62d6b92005-11-05 21:14:15 +0100434 return -EINVAL;
435
Patrick McHardycee63722008-01-23 20:33:32 -0800436 err = -EINVAL;
Patrick McHardy1e904742008-01-22 22:11:17 -0800437 ctl = nla_data(tb[TCA_GRED_PARMS]);
438 stab = nla_data(tb[TCA_GRED_STAB]);
Thomas Graff62d6b92005-11-05 21:14:15 +0100439
440 if (ctl->DP >= table->DPs)
441 goto errout;
442
443 if (gred_rio_mode(table)) {
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;
456 }
457
458 sch_tree_lock(sch);
459
460 err = gred_change_vq(sch, ctl->DP, ctl, prio, stab);
461 if (err < 0)
462 goto errout_locked;
463
Thomas Grafd6fd4e92005-11-05 21:14:10 +0100464 if (gred_rio_mode(table)) {
Thomas Grafdea3f622005-11-05 21:14:09 +0100465 gred_disable_wred_mode(table);
466 if (gred_wred_mode_check(sch))
467 gred_enable_wred_mode(table);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700468 }
469
Thomas Graff62d6b92005-11-05 21:14:15 +0100470 err = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700471
Thomas Graff62d6b92005-11-05 21:14:15 +0100472errout_locked:
473 sch_tree_unlock(sch);
474errout:
475 return err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476}
477
Patrick McHardy1e904742008-01-22 22:11:17 -0800478static int gred_init(struct Qdisc *sch, struct nlattr *opt)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700479{
Patrick McHardy1e904742008-01-22 22:11:17 -0800480 struct nlattr *tb[TCA_GRED_MAX + 1];
Patrick McHardycee63722008-01-23 20:33:32 -0800481 int err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700482
Patrick McHardycee63722008-01-23 20:33:32 -0800483 if (opt == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484 return -EINVAL;
485
Patrick McHardy27a34212008-01-23 20:35:39 -0800486 err = nla_parse_nested(tb, TCA_GRED_MAX, opt, gred_policy);
Patrick McHardycee63722008-01-23 20:33:32 -0800487 if (err < 0)
488 return err;
489
Patrick McHardy1e904742008-01-22 22:11:17 -0800490 if (tb[TCA_GRED_PARMS] || tb[TCA_GRED_STAB])
Thomas Graf66396072005-11-05 21:14:13 +0100491 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700492
Patrick McHardy1e904742008-01-22 22:11:17 -0800493 return gred_change_table_def(sch, tb[TCA_GRED_DPS]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700494}
495
496static int gred_dump(struct Qdisc *sch, struct sk_buff *skb)
497{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700498 struct gred_sched *table = qdisc_priv(sch);
Patrick McHardy1e904742008-01-22 22:11:17 -0800499 struct nlattr *parms, *opts = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700500 int i;
Thomas Grafe0636822005-11-05 21:14:12 +0100501 struct tc_gred_sopt sopt = {
502 .DPs = table->DPs,
503 .def_DP = table->def,
504 .grio = gred_rio_mode(table),
Thomas Grafb38c7ee2005-11-05 21:14:27 +0100505 .flags = table->red_flags,
Thomas Grafe0636822005-11-05 21:14:12 +0100506 };
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507
Patrick McHardy1e904742008-01-22 22:11:17 -0800508 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;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515
Thomas Graf05f1cc02005-11-05 21:14:11 +0100516 for (i = 0; i < MAX_DPs; i++) {
517 struct gred_sched_data *q = table->tab[i];
518 struct tc_gred_qopt opt;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700519
Thomas Graf05f1cc02005-11-05 21:14:11 +0100520 memset(&opt, 0, sizeof(opt));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700521
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
Thomas Graf05f1cc02005-11-05 21:14:11 +0100527 opt.DP = MAX_DPs + i;
528 goto append_opt;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700529 }
530
Thomas Graf05f1cc02005-11-05 21:14:11 +0100531 opt.limit = q->limit;
532 opt.DP = q->DP;
533 opt.backlog = q->backlog;
534 opt.prio = q->prio;
Thomas Graf22b33422005-11-05 21:14:16 +0100535 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;
Thomas Graf05f1cc02005-11-05 21:14:11 +0100544 opt.packets = q->packetsin;
545 opt.bytesin = q->bytesin;
546
Thomas Graf22b33422005-11-05 21:14:16 +0100547 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;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700551 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552
Thomas Graf22b33422005-11-05 21:14:16 +0100553 opt.qave = red_calc_qavg(&q->parms, q->parms.qavg);
554
Thomas Graf05f1cc02005-11-05 21:14:11 +0100555append_opt:
Patrick McHardy1e904742008-01-22 22:11:17 -0800556 if (nla_append(skb, sizeof(opt), &opt) < 0)
557 goto nla_put_failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700558 }
559
Patrick McHardy1e904742008-01-22 22:11:17 -0800560 nla_nest_end(skb, parms);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700561
Patrick McHardy1e904742008-01-22 22:11:17 -0800562 return nla_nest_end(skb, opts);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700563
Patrick McHardy1e904742008-01-22 22:11:17 -0800564nla_put_failure:
Thomas Grafbc3ed282008-06-03 16:36:54 -0700565 nla_nest_cancel(skb, opts);
566 return -EMSGSIZE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700567}
568
569static void gred_destroy(struct Qdisc *sch)
570{
571 struct gred_sched *table = qdisc_priv(sch);
572 int i;
573
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100574 for (i = 0; i < table->DPs; i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700575 if (table->tab[i])
Thomas Graf66396072005-11-05 21:14:13 +0100576 gred_destroy_vq(table->tab[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700577 }
578}
579
Eric Dumazet20fea082007-11-14 01:44:41 -0800580static struct Qdisc_ops gred_qdisc_ops __read_mostly = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700581 .id = "gred",
582 .priv_size = sizeof(struct gred_sched),
583 .enqueue = gred_enqueue,
584 .dequeue = gred_dequeue,
Jarek Poplawski8e3af972008-10-31 00:45:55 -0700585 .peek = qdisc_peek_head,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700586 .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}
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100599
600static void __exit gred_module_exit(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700601{
602 unregister_qdisc(&gred_qdisc_ops);
603}
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100604
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605module_init(gred_module_init)
606module_exit(gred_module_exit)
Thomas Graf1e4dfaf2005-11-05 21:14:25 +0100607
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608MODULE_LICENSE("GPL");