2 * net/sched/sch_red.c Random Early Detection queue.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
9 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
12 * J Hadi Salim 980914: computation fixes
13 * Alexey Makarenko <makar@phoenix.kharkov.ua> 990814: qave on idle link was calculated incorrectly.
14 * J Hadi Salim 980816: ECN support
17 #include <linux/module.h>
18 #include <linux/types.h>
19 #include <linux/kernel.h>
20 #include <linux/skbuff.h>
21 #include <net/pkt_sched.h>
22 #include <net/pkt_cls.h>
23 #include <net/inet_ecn.h>
27 /* Parameters, settable by user:
28 -----------------------------
30 limit - bytes (must be > qth_max + burst)
32 Hard limit on queue length, should be chosen >qth_max
33 to allow packet bursts. This parameter does not
34 affect the algorithms behaviour and can be chosen
35 arbitrarily high (well, less than ram size)
36 Really, this limit will never be reached
37 if RED works correctly.
40 struct red_sched_data
{
41 u32 limit
; /* HARD maximal queue length */
43 struct timer_list adapt_timer
;
45 struct red_parms parms
;
47 struct red_stats stats
;
51 static inline int red_use_ecn(struct red_sched_data
*q
)
53 return q
->flags
& TC_RED_ECN
;
56 static inline int red_use_harddrop(struct red_sched_data
*q
)
58 return q
->flags
& TC_RED_HARDDROP
;
61 static int red_enqueue(struct sk_buff
*skb
, struct Qdisc
*sch
,
62 struct sk_buff
**to_free
)
64 struct red_sched_data
*q
= qdisc_priv(sch
);
65 struct Qdisc
*child
= q
->qdisc
;
68 q
->vars
.qavg
= red_calc_qavg(&q
->parms
,
70 child
->qstats
.backlog
);
72 if (red_is_idling(&q
->vars
))
73 red_end_of_idle_period(&q
->vars
);
75 switch (red_action(&q
->parms
, &q
->vars
, q
->vars
.qavg
)) {
80 qdisc_qstats_overlimit(sch
);
81 if (!red_use_ecn(q
) || !INET_ECN_set_ce(skb
)) {
90 qdisc_qstats_overlimit(sch
);
91 if (red_use_harddrop(q
) || !red_use_ecn(q
) ||
92 !INET_ECN_set_ce(skb
)) {
93 q
->stats
.forced_drop
++;
97 q
->stats
.forced_mark
++;
101 ret
= qdisc_enqueue(skb
, child
, to_free
);
102 if (likely(ret
== NET_XMIT_SUCCESS
)) {
103 qdisc_qstats_backlog_inc(sch
, skb
);
105 } else if (net_xmit_drop_count(ret
)) {
107 qdisc_qstats_drop(sch
);
112 qdisc_drop(skb
, sch
, to_free
);
116 static struct sk_buff
*red_dequeue(struct Qdisc
*sch
)
119 struct red_sched_data
*q
= qdisc_priv(sch
);
120 struct Qdisc
*child
= q
->qdisc
;
122 skb
= child
->dequeue(child
);
124 qdisc_bstats_update(sch
, skb
);
125 qdisc_qstats_backlog_dec(sch
, skb
);
128 if (!red_is_idling(&q
->vars
))
129 red_start_of_idle_period(&q
->vars
);
134 static struct sk_buff
*red_peek(struct Qdisc
*sch
)
136 struct red_sched_data
*q
= qdisc_priv(sch
);
137 struct Qdisc
*child
= q
->qdisc
;
139 return child
->ops
->peek(child
);
142 static void red_reset(struct Qdisc
*sch
)
144 struct red_sched_data
*q
= qdisc_priv(sch
);
146 qdisc_reset(q
->qdisc
);
147 sch
->qstats
.backlog
= 0;
149 red_restart(&q
->vars
);
152 static int red_offload(struct Qdisc
*sch
, bool enable
)
154 struct red_sched_data
*q
= qdisc_priv(sch
);
155 struct net_device
*dev
= qdisc_dev(sch
);
156 struct tc_red_qopt_offload opt
= {
157 .handle
= sch
->handle
,
158 .parent
= sch
->parent
,
161 if (!tc_can_offload(dev
) || !dev
->netdev_ops
->ndo_setup_tc
)
165 opt
.command
= TC_RED_REPLACE
;
166 opt
.set
.min
= q
->parms
.qth_min
>> q
->parms
.Wlog
;
167 opt
.set
.max
= q
->parms
.qth_max
>> q
->parms
.Wlog
;
168 opt
.set
.probability
= q
->parms
.max_P
;
169 opt
.set
.is_ecn
= red_use_ecn(q
);
171 opt
.command
= TC_RED_DESTROY
;
174 return dev
->netdev_ops
->ndo_setup_tc(dev
, TC_SETUP_QDISC_RED
, &opt
);
177 static void red_destroy(struct Qdisc
*sch
)
179 struct red_sched_data
*q
= qdisc_priv(sch
);
181 del_timer_sync(&q
->adapt_timer
);
182 red_offload(sch
, false);
183 qdisc_destroy(q
->qdisc
);
186 static const struct nla_policy red_policy
[TCA_RED_MAX
+ 1] = {
187 [TCA_RED_PARMS
] = { .len
= sizeof(struct tc_red_qopt
) },
188 [TCA_RED_STAB
] = { .len
= RED_STAB_SIZE
},
189 [TCA_RED_MAX_P
] = { .type
= NLA_U32
},
192 static int red_change(struct Qdisc
*sch
, struct nlattr
*opt
)
194 struct red_sched_data
*q
= qdisc_priv(sch
);
195 struct nlattr
*tb
[TCA_RED_MAX
+ 1];
196 struct tc_red_qopt
*ctl
;
197 struct Qdisc
*child
= NULL
;
204 err
= nla_parse_nested(tb
, TCA_RED_MAX
, opt
, red_policy
, NULL
);
208 if (tb
[TCA_RED_PARMS
] == NULL
||
209 tb
[TCA_RED_STAB
] == NULL
)
212 max_P
= tb
[TCA_RED_MAX_P
] ? nla_get_u32(tb
[TCA_RED_MAX_P
]) : 0;
214 ctl
= nla_data(tb
[TCA_RED_PARMS
]);
215 if (!red_check_params(ctl
->qth_min
, ctl
->qth_max
, ctl
->Wlog
))
218 if (ctl
->limit
> 0) {
219 child
= fifo_create_dflt(sch
, &bfifo_qdisc_ops
, ctl
->limit
);
221 return PTR_ERR(child
);
223 /* child is fifo, no need to check for noop_qdisc */
224 qdisc_hash_add(child
, true);
228 q
->flags
= ctl
->flags
;
229 q
->limit
= ctl
->limit
;
231 qdisc_tree_reduce_backlog(q
->qdisc
, q
->qdisc
->q
.qlen
,
232 q
->qdisc
->qstats
.backlog
);
233 qdisc_destroy(q
->qdisc
);
237 red_set_parms(&q
->parms
,
238 ctl
->qth_min
, ctl
->qth_max
, ctl
->Wlog
,
239 ctl
->Plog
, ctl
->Scell_log
,
240 nla_data(tb
[TCA_RED_STAB
]),
242 red_set_vars(&q
->vars
);
244 del_timer(&q
->adapt_timer
);
245 if (ctl
->flags
& TC_RED_ADAPTATIVE
)
246 mod_timer(&q
->adapt_timer
, jiffies
+ HZ
/2);
248 if (!q
->qdisc
->q
.qlen
)
249 red_start_of_idle_period(&q
->vars
);
251 sch_tree_unlock(sch
);
252 red_offload(sch
, true);
256 static inline void red_adaptative_timer(struct timer_list
*t
)
258 struct red_sched_data
*q
= from_timer(q
, t
, adapt_timer
);
259 struct Qdisc
*sch
= q
->sch
;
260 spinlock_t
*root_lock
= qdisc_lock(qdisc_root_sleeping(sch
));
262 spin_lock(root_lock
);
263 red_adaptative_algo(&q
->parms
, &q
->vars
);
264 mod_timer(&q
->adapt_timer
, jiffies
+ HZ
/2);
265 spin_unlock(root_lock
);
268 static int red_init(struct Qdisc
*sch
, struct nlattr
*opt
)
270 struct red_sched_data
*q
= qdisc_priv(sch
);
272 q
->qdisc
= &noop_qdisc
;
274 timer_setup(&q
->adapt_timer
, red_adaptative_timer
, 0);
275 return red_change(sch
, opt
);
278 static int red_dump_offload_stats(struct Qdisc
*sch
, struct tc_red_qopt
*opt
)
280 struct net_device
*dev
= qdisc_dev(sch
);
281 struct tc_red_qopt_offload hw_stats
= {
282 .command
= TC_RED_STATS
,
283 .handle
= sch
->handle
,
284 .parent
= sch
->parent
,
286 .stats
.bstats
= &sch
->bstats
,
287 .stats
.qstats
= &sch
->qstats
,
292 sch
->flags
&= ~TCQ_F_OFFLOADED
;
294 if (!tc_can_offload(dev
) || !dev
->netdev_ops
->ndo_setup_tc
)
297 err
= dev
->netdev_ops
->ndo_setup_tc(dev
, TC_SETUP_QDISC_RED
,
299 if (err
== -EOPNOTSUPP
)
303 sch
->flags
|= TCQ_F_OFFLOADED
;
308 static int red_dump(struct Qdisc
*sch
, struct sk_buff
*skb
)
310 struct red_sched_data
*q
= qdisc_priv(sch
);
311 struct nlattr
*opts
= NULL
;
312 struct tc_red_qopt opt
= {
315 .qth_min
= q
->parms
.qth_min
>> q
->parms
.Wlog
,
316 .qth_max
= q
->parms
.qth_max
>> q
->parms
.Wlog
,
317 .Wlog
= q
->parms
.Wlog
,
318 .Plog
= q
->parms
.Plog
,
319 .Scell_log
= q
->parms
.Scell_log
,
323 sch
->qstats
.backlog
= q
->qdisc
->qstats
.backlog
;
324 err
= red_dump_offload_stats(sch
, &opt
);
326 goto nla_put_failure
;
328 opts
= nla_nest_start(skb
, TCA_OPTIONS
);
330 goto nla_put_failure
;
331 if (nla_put(skb
, TCA_RED_PARMS
, sizeof(opt
), &opt
) ||
332 nla_put_u32(skb
, TCA_RED_MAX_P
, q
->parms
.max_P
))
333 goto nla_put_failure
;
334 return nla_nest_end(skb
, opts
);
337 nla_nest_cancel(skb
, opts
);
341 static int red_dump_stats(struct Qdisc
*sch
, struct gnet_dump
*d
)
343 struct red_sched_data
*q
= qdisc_priv(sch
);
344 struct net_device
*dev
= qdisc_dev(sch
);
345 struct tc_red_xstats st
= {
346 .early
= q
->stats
.prob_drop
+ q
->stats
.forced_drop
,
347 .pdrop
= q
->stats
.pdrop
,
348 .other
= q
->stats
.other
,
349 .marked
= q
->stats
.prob_mark
+ q
->stats
.forced_mark
,
352 if (sch
->flags
& TCQ_F_OFFLOADED
) {
353 struct red_stats hw_stats
= {0};
354 struct tc_red_qopt_offload hw_stats_request
= {
355 .command
= TC_RED_XSTATS
,
356 .handle
= sch
->handle
,
357 .parent
= sch
->parent
,
362 if (!dev
->netdev_ops
->ndo_setup_tc(dev
,
364 &hw_stats_request
)) {
365 st
.early
+= hw_stats
.prob_drop
+ hw_stats
.forced_drop
;
366 st
.pdrop
+= hw_stats
.pdrop
;
367 st
.other
+= hw_stats
.other
;
368 st
.marked
+= hw_stats
.prob_mark
+ hw_stats
.forced_mark
;
372 return gnet_stats_copy_app(d
, &st
, sizeof(st
));
375 static int red_dump_class(struct Qdisc
*sch
, unsigned long cl
,
376 struct sk_buff
*skb
, struct tcmsg
*tcm
)
378 struct red_sched_data
*q
= qdisc_priv(sch
);
380 tcm
->tcm_handle
|= TC_H_MIN(1);
381 tcm
->tcm_info
= q
->qdisc
->handle
;
385 static int red_graft(struct Qdisc
*sch
, unsigned long arg
, struct Qdisc
*new,
388 struct red_sched_data
*q
= qdisc_priv(sch
);
393 *old
= qdisc_replace(sch
, new, &q
->qdisc
);
397 static struct Qdisc
*red_leaf(struct Qdisc
*sch
, unsigned long arg
)
399 struct red_sched_data
*q
= qdisc_priv(sch
);
403 static unsigned long red_find(struct Qdisc
*sch
, u32 classid
)
408 static void red_walk(struct Qdisc
*sch
, struct qdisc_walker
*walker
)
411 if (walker
->count
>= walker
->skip
)
412 if (walker
->fn(sch
, 1, walker
) < 0) {
420 static const struct Qdisc_class_ops red_class_ops
= {
425 .dump
= red_dump_class
,
428 static struct Qdisc_ops red_qdisc_ops __read_mostly
= {
430 .priv_size
= sizeof(struct red_sched_data
),
431 .cl_ops
= &red_class_ops
,
432 .enqueue
= red_enqueue
,
433 .dequeue
= red_dequeue
,
437 .destroy
= red_destroy
,
438 .change
= red_change
,
440 .dump_stats
= red_dump_stats
,
441 .owner
= THIS_MODULE
,
444 static int __init
red_module_init(void)
446 return register_qdisc(&red_qdisc_ops
);
449 static void __exit
red_module_exit(void)
451 unregister_qdisc(&red_qdisc_ops
);
454 module_init(red_module_init
)
455 module_exit(red_module_exit
)
457 MODULE_LICENSE("GPL");