2 * Fair Queue CoDel discipline
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 * Copyright (C) 2012,2015 Eric Dumazet <edumazet@google.com>
12 #include <linux/module.h>
13 #include <linux/types.h>
14 #include <linux/kernel.h>
15 #include <linux/jiffies.h>
16 #include <linux/string.h>
18 #include <linux/errno.h>
19 #include <linux/init.h>
20 #include <linux/skbuff.h>
21 #include <linux/jhash.h>
22 #include <linux/slab.h>
23 #include <linux/vmalloc.h>
24 #include <net/netlink.h>
25 #include <net/pkt_sched.h>
26 #include <net/codel.h>
27 #include <net/codel_impl.h>
28 #include <net/codel_qdisc.h>
33 * Packets are classified (internal classifier or external) on flows.
34 * This is a Stochastic model (as we use a hash, several flows
35 * might be hashed on same slot)
36 * Each flow has a CoDel managed queue.
37 * Flows are linked onto two (Round Robin) lists,
38 * so that new flows have priority on old ones.
40 * For a given flow, packets are not reordered (CoDel uses a FIFO)
42 * ECN capability is on by default.
43 * Low memory footprint (64 bytes per flow)
46 struct fq_codel_flow
{
49 struct list_head flowchain
;
51 u32 dropped
; /* number of drops (or ECN marks) on this flow */
52 struct codel_vars cvars
;
53 }; /* please try to keep this structure <= 64 bytes */
55 struct fq_codel_sched_data
{
56 struct tcf_proto __rcu
*filter_list
; /* optional external classifier */
57 struct fq_codel_flow
*flows
; /* Flows table [flows_cnt] */
58 u32
*backlogs
; /* backlog table [flows_cnt] */
59 u32 flows_cnt
; /* number of flows */
60 u32 perturbation
; /* hash perturbation */
61 u32 quantum
; /* psched_mtu(qdisc_dev(sch)); */
64 struct codel_params cparams
;
65 struct codel_stats cstats
;
71 struct list_head new_flows
; /* list of new flows */
72 struct list_head old_flows
; /* list of old flows */
75 static unsigned int fq_codel_hash(const struct fq_codel_sched_data
*q
,
78 u32 hash
= skb_get_hash_perturb(skb
, q
->perturbation
);
80 return reciprocal_scale(hash
, q
->flows_cnt
);
83 static unsigned int fq_codel_classify(struct sk_buff
*skb
, struct Qdisc
*sch
,
86 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
87 struct tcf_proto
*filter
;
88 struct tcf_result res
;
91 if (TC_H_MAJ(skb
->priority
) == sch
->handle
&&
92 TC_H_MIN(skb
->priority
) > 0 &&
93 TC_H_MIN(skb
->priority
) <= q
->flows_cnt
)
94 return TC_H_MIN(skb
->priority
);
96 filter
= rcu_dereference_bh(q
->filter_list
);
98 return fq_codel_hash(q
, skb
) + 1;
100 *qerr
= NET_XMIT_SUCCESS
| __NET_XMIT_BYPASS
;
101 result
= tc_classify(skb
, filter
, &res
, false);
103 #ifdef CONFIG_NET_CLS_ACT
107 *qerr
= NET_XMIT_SUCCESS
| __NET_XMIT_STOLEN
;
112 if (TC_H_MIN(res
.classid
) <= q
->flows_cnt
)
113 return TC_H_MIN(res
.classid
);
118 /* helper functions : might be changed when/if skb use a standard list_head */
120 /* remove one skb from head of slot queue */
121 static inline struct sk_buff
*dequeue_head(struct fq_codel_flow
*flow
)
123 struct sk_buff
*skb
= flow
->head
;
125 flow
->head
= skb
->next
;
130 /* add skb to flow queue (tail add) */
131 static inline void flow_queue_add(struct fq_codel_flow
*flow
,
134 if (flow
->head
== NULL
)
137 flow
->tail
->next
= skb
;
142 static unsigned int fq_codel_drop(struct Qdisc
*sch
, unsigned int max_packets
,
143 struct sk_buff
**to_free
)
145 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
147 unsigned int maxbacklog
= 0, idx
= 0, i
, len
;
148 struct fq_codel_flow
*flow
;
149 unsigned int threshold
;
150 unsigned int mem
= 0;
152 /* Queue is full! Find the fat flow and drop packet(s) from it.
153 * This might sound expensive, but with 1024 flows, we scan
154 * 4KB of memory, and we dont need to handle a complex tree
155 * in fast path (packet queue/enqueue) with many cache misses.
156 * In stress mode, we'll try to drop 64 packets from the flow,
157 * amortizing this linear lookup to one cache line per drop.
159 for (i
= 0; i
< q
->flows_cnt
; i
++) {
160 if (q
->backlogs
[i
] > maxbacklog
) {
161 maxbacklog
= q
->backlogs
[i
];
166 /* Our goal is to drop half of this fat flow backlog */
167 threshold
= maxbacklog
>> 1;
169 flow
= &q
->flows
[idx
];
173 skb
= dequeue_head(flow
);
174 len
+= qdisc_pkt_len(skb
);
175 mem
+= skb
->truesize
;
176 __qdisc_drop(skb
, to_free
);
177 } while (++i
< max_packets
&& len
< threshold
);
180 q
->backlogs
[idx
] -= len
;
181 q
->memory_usage
-= mem
;
182 sch
->qstats
.drops
+= i
;
183 sch
->qstats
.backlog
-= len
;
188 static int fq_codel_enqueue(struct sk_buff
*skb
, struct Qdisc
*sch
,
189 struct sk_buff
**to_free
)
191 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
192 unsigned int idx
, prev_backlog
, prev_qlen
;
193 struct fq_codel_flow
*flow
;
194 int uninitialized_var(ret
);
195 unsigned int pkt_len
;
198 idx
= fq_codel_classify(skb
, sch
, &ret
);
200 if (ret
& __NET_XMIT_BYPASS
)
201 qdisc_qstats_drop(sch
);
202 __qdisc_drop(skb
, to_free
);
207 codel_set_enqueue_time(skb
);
208 flow
= &q
->flows
[idx
];
209 flow_queue_add(flow
, skb
);
210 q
->backlogs
[idx
] += qdisc_pkt_len(skb
);
211 qdisc_qstats_backlog_inc(sch
, skb
);
213 if (list_empty(&flow
->flowchain
)) {
214 list_add_tail(&flow
->flowchain
, &q
->new_flows
);
216 flow
->deficit
= q
->quantum
;
219 q
->memory_usage
+= skb
->truesize
;
220 memory_limited
= q
->memory_usage
> q
->memory_limit
;
221 if (++sch
->q
.qlen
<= sch
->limit
&& !memory_limited
)
222 return NET_XMIT_SUCCESS
;
224 prev_backlog
= sch
->qstats
.backlog
;
225 prev_qlen
= sch
->q
.qlen
;
227 /* save this packet length as it might be dropped by fq_codel_drop() */
228 pkt_len
= qdisc_pkt_len(skb
);
229 /* fq_codel_drop() is quite expensive, as it performs a linear search
230 * in q->backlogs[] to find a fat flow.
231 * So instead of dropping a single packet, drop half of its backlog
232 * with a 64 packets limit to not add a too big cpu spike here.
234 ret
= fq_codel_drop(sch
, q
->drop_batch_size
, to_free
);
236 prev_qlen
-= sch
->q
.qlen
;
237 prev_backlog
-= sch
->qstats
.backlog
;
238 q
->drop_overlimit
+= prev_qlen
;
240 q
->drop_overmemory
+= prev_qlen
;
242 /* As we dropped packet(s), better let upper stack know this.
243 * If we dropped a packet for this flow, return NET_XMIT_CN,
244 * but in this case, our parents wont increase their backlogs.
247 qdisc_tree_reduce_backlog(sch
, prev_qlen
- 1,
248 prev_backlog
- pkt_len
);
251 qdisc_tree_reduce_backlog(sch
, prev_qlen
, prev_backlog
);
252 return NET_XMIT_SUCCESS
;
255 /* This is the specific function called from codel_dequeue()
256 * to dequeue a packet from queue. Note: backlog is handled in
257 * codel, we dont need to reduce it here.
259 static struct sk_buff
*dequeue_func(struct codel_vars
*vars
, void *ctx
)
261 struct Qdisc
*sch
= ctx
;
262 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
263 struct fq_codel_flow
*flow
;
264 struct sk_buff
*skb
= NULL
;
266 flow
= container_of(vars
, struct fq_codel_flow
, cvars
);
268 skb
= dequeue_head(flow
);
269 q
->backlogs
[flow
- q
->flows
] -= qdisc_pkt_len(skb
);
270 q
->memory_usage
-= skb
->truesize
;
272 sch
->qstats
.backlog
-= qdisc_pkt_len(skb
);
277 static void drop_func(struct sk_buff
*skb
, void *ctx
)
279 struct Qdisc
*sch
= ctx
;
282 qdisc_qstats_drop(sch
);
285 static struct sk_buff
*fq_codel_dequeue(struct Qdisc
*sch
)
287 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
289 struct fq_codel_flow
*flow
;
290 struct list_head
*head
;
291 u32 prev_drop_count
, prev_ecn_mark
;
292 unsigned int prev_backlog
;
295 head
= &q
->new_flows
;
296 if (list_empty(head
)) {
297 head
= &q
->old_flows
;
298 if (list_empty(head
))
301 flow
= list_first_entry(head
, struct fq_codel_flow
, flowchain
);
303 if (flow
->deficit
<= 0) {
304 flow
->deficit
+= q
->quantum
;
305 list_move_tail(&flow
->flowchain
, &q
->old_flows
);
309 prev_drop_count
= q
->cstats
.drop_count
;
310 prev_ecn_mark
= q
->cstats
.ecn_mark
;
311 prev_backlog
= sch
->qstats
.backlog
;
313 skb
= codel_dequeue(sch
, &sch
->qstats
.backlog
, &q
->cparams
,
314 &flow
->cvars
, &q
->cstats
, qdisc_pkt_len
,
315 codel_get_enqueue_time
, drop_func
, dequeue_func
);
317 flow
->dropped
+= q
->cstats
.drop_count
- prev_drop_count
;
318 flow
->dropped
+= q
->cstats
.ecn_mark
- prev_ecn_mark
;
321 /* force a pass through old_flows to prevent starvation */
322 if ((head
== &q
->new_flows
) && !list_empty(&q
->old_flows
))
323 list_move_tail(&flow
->flowchain
, &q
->old_flows
);
325 list_del_init(&flow
->flowchain
);
328 qdisc_bstats_update(sch
, skb
);
329 flow
->deficit
-= qdisc_pkt_len(skb
);
330 /* We cant call qdisc_tree_reduce_backlog() if our qlen is 0,
331 * or HTB crashes. Defer it for next round.
333 if (q
->cstats
.drop_count
&& sch
->q
.qlen
) {
334 qdisc_tree_reduce_backlog(sch
, q
->cstats
.drop_count
,
336 q
->cstats
.drop_count
= 0;
337 q
->cstats
.drop_len
= 0;
342 static void fq_codel_flow_purge(struct fq_codel_flow
*flow
)
344 rtnl_kfree_skbs(flow
->head
, flow
->tail
);
348 static void fq_codel_reset(struct Qdisc
*sch
)
350 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
353 INIT_LIST_HEAD(&q
->new_flows
);
354 INIT_LIST_HEAD(&q
->old_flows
);
355 for (i
= 0; i
< q
->flows_cnt
; i
++) {
356 struct fq_codel_flow
*flow
= q
->flows
+ i
;
358 fq_codel_flow_purge(flow
);
359 INIT_LIST_HEAD(&flow
->flowchain
);
360 codel_vars_init(&flow
->cvars
);
362 memset(q
->backlogs
, 0, q
->flows_cnt
* sizeof(u32
));
364 sch
->qstats
.backlog
= 0;
368 static const struct nla_policy fq_codel_policy
[TCA_FQ_CODEL_MAX
+ 1] = {
369 [TCA_FQ_CODEL_TARGET
] = { .type
= NLA_U32
},
370 [TCA_FQ_CODEL_LIMIT
] = { .type
= NLA_U32
},
371 [TCA_FQ_CODEL_INTERVAL
] = { .type
= NLA_U32
},
372 [TCA_FQ_CODEL_ECN
] = { .type
= NLA_U32
},
373 [TCA_FQ_CODEL_FLOWS
] = { .type
= NLA_U32
},
374 [TCA_FQ_CODEL_QUANTUM
] = { .type
= NLA_U32
},
375 [TCA_FQ_CODEL_CE_THRESHOLD
] = { .type
= NLA_U32
},
376 [TCA_FQ_CODEL_DROP_BATCH_SIZE
] = { .type
= NLA_U32
},
377 [TCA_FQ_CODEL_MEMORY_LIMIT
] = { .type
= NLA_U32
},
380 static int fq_codel_change(struct Qdisc
*sch
, struct nlattr
*opt
)
382 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
383 struct nlattr
*tb
[TCA_FQ_CODEL_MAX
+ 1];
389 err
= nla_parse_nested(tb
, TCA_FQ_CODEL_MAX
, opt
, fq_codel_policy
);
392 if (tb
[TCA_FQ_CODEL_FLOWS
]) {
395 q
->flows_cnt
= nla_get_u32(tb
[TCA_FQ_CODEL_FLOWS
]);
397 q
->flows_cnt
> 65536)
402 if (tb
[TCA_FQ_CODEL_TARGET
]) {
403 u64 target
= nla_get_u32(tb
[TCA_FQ_CODEL_TARGET
]);
405 q
->cparams
.target
= (target
* NSEC_PER_USEC
) >> CODEL_SHIFT
;
408 if (tb
[TCA_FQ_CODEL_CE_THRESHOLD
]) {
409 u64 val
= nla_get_u32(tb
[TCA_FQ_CODEL_CE_THRESHOLD
]);
411 q
->cparams
.ce_threshold
= (val
* NSEC_PER_USEC
) >> CODEL_SHIFT
;
414 if (tb
[TCA_FQ_CODEL_INTERVAL
]) {
415 u64 interval
= nla_get_u32(tb
[TCA_FQ_CODEL_INTERVAL
]);
417 q
->cparams
.interval
= (interval
* NSEC_PER_USEC
) >> CODEL_SHIFT
;
420 if (tb
[TCA_FQ_CODEL_LIMIT
])
421 sch
->limit
= nla_get_u32(tb
[TCA_FQ_CODEL_LIMIT
]);
423 if (tb
[TCA_FQ_CODEL_ECN
])
424 q
->cparams
.ecn
= !!nla_get_u32(tb
[TCA_FQ_CODEL_ECN
]);
426 if (tb
[TCA_FQ_CODEL_QUANTUM
])
427 q
->quantum
= max(256U, nla_get_u32(tb
[TCA_FQ_CODEL_QUANTUM
]));
429 if (tb
[TCA_FQ_CODEL_DROP_BATCH_SIZE
])
430 q
->drop_batch_size
= min(1U, nla_get_u32(tb
[TCA_FQ_CODEL_DROP_BATCH_SIZE
]));
432 if (tb
[TCA_FQ_CODEL_MEMORY_LIMIT
])
433 q
->memory_limit
= min(1U << 31, nla_get_u32(tb
[TCA_FQ_CODEL_MEMORY_LIMIT
]));
435 while (sch
->q
.qlen
> sch
->limit
||
436 q
->memory_usage
> q
->memory_limit
) {
437 struct sk_buff
*skb
= fq_codel_dequeue(sch
);
439 q
->cstats
.drop_len
+= qdisc_pkt_len(skb
);
440 rtnl_kfree_skbs(skb
, skb
);
441 q
->cstats
.drop_count
++;
443 qdisc_tree_reduce_backlog(sch
, q
->cstats
.drop_count
, q
->cstats
.drop_len
);
444 q
->cstats
.drop_count
= 0;
445 q
->cstats
.drop_len
= 0;
447 sch_tree_unlock(sch
);
451 static void *fq_codel_zalloc(size_t sz
)
453 void *ptr
= kzalloc(sz
, GFP_KERNEL
| __GFP_NOWARN
);
460 static void fq_codel_free(void *addr
)
465 static void fq_codel_destroy(struct Qdisc
*sch
)
467 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
469 tcf_destroy_chain(&q
->filter_list
);
470 fq_codel_free(q
->backlogs
);
471 fq_codel_free(q
->flows
);
474 static int fq_codel_init(struct Qdisc
*sch
, struct nlattr
*opt
)
476 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
479 sch
->limit
= 10*1024;
481 q
->memory_limit
= 32 << 20; /* 32 MBytes */
482 q
->drop_batch_size
= 64;
483 q
->quantum
= psched_mtu(qdisc_dev(sch
));
484 q
->perturbation
= prandom_u32();
485 INIT_LIST_HEAD(&q
->new_flows
);
486 INIT_LIST_HEAD(&q
->old_flows
);
487 codel_params_init(&q
->cparams
);
488 codel_stats_init(&q
->cstats
);
489 q
->cparams
.ecn
= true;
490 q
->cparams
.mtu
= psched_mtu(qdisc_dev(sch
));
493 int err
= fq_codel_change(sch
, opt
);
499 q
->flows
= fq_codel_zalloc(q
->flows_cnt
*
500 sizeof(struct fq_codel_flow
));
503 q
->backlogs
= fq_codel_zalloc(q
->flows_cnt
* sizeof(u32
));
505 fq_codel_free(q
->flows
);
508 for (i
= 0; i
< q
->flows_cnt
; i
++) {
509 struct fq_codel_flow
*flow
= q
->flows
+ i
;
511 INIT_LIST_HEAD(&flow
->flowchain
);
512 codel_vars_init(&flow
->cvars
);
516 sch
->flags
|= TCQ_F_CAN_BYPASS
;
518 sch
->flags
&= ~TCQ_F_CAN_BYPASS
;
522 static int fq_codel_dump(struct Qdisc
*sch
, struct sk_buff
*skb
)
524 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
527 opts
= nla_nest_start(skb
, TCA_OPTIONS
);
529 goto nla_put_failure
;
531 if (nla_put_u32(skb
, TCA_FQ_CODEL_TARGET
,
532 codel_time_to_us(q
->cparams
.target
)) ||
533 nla_put_u32(skb
, TCA_FQ_CODEL_LIMIT
,
535 nla_put_u32(skb
, TCA_FQ_CODEL_INTERVAL
,
536 codel_time_to_us(q
->cparams
.interval
)) ||
537 nla_put_u32(skb
, TCA_FQ_CODEL_ECN
,
539 nla_put_u32(skb
, TCA_FQ_CODEL_QUANTUM
,
541 nla_put_u32(skb
, TCA_FQ_CODEL_DROP_BATCH_SIZE
,
542 q
->drop_batch_size
) ||
543 nla_put_u32(skb
, TCA_FQ_CODEL_MEMORY_LIMIT
,
545 nla_put_u32(skb
, TCA_FQ_CODEL_FLOWS
,
547 goto nla_put_failure
;
549 if (q
->cparams
.ce_threshold
!= CODEL_DISABLED_THRESHOLD
&&
550 nla_put_u32(skb
, TCA_FQ_CODEL_CE_THRESHOLD
,
551 codel_time_to_us(q
->cparams
.ce_threshold
)))
552 goto nla_put_failure
;
554 return nla_nest_end(skb
, opts
);
560 static int fq_codel_dump_stats(struct Qdisc
*sch
, struct gnet_dump
*d
)
562 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
563 struct tc_fq_codel_xstats st
= {
564 .type
= TCA_FQ_CODEL_XSTATS_QDISC
,
566 struct list_head
*pos
;
568 st
.qdisc_stats
.maxpacket
= q
->cstats
.maxpacket
;
569 st
.qdisc_stats
.drop_overlimit
= q
->drop_overlimit
;
570 st
.qdisc_stats
.ecn_mark
= q
->cstats
.ecn_mark
;
571 st
.qdisc_stats
.new_flow_count
= q
->new_flow_count
;
572 st
.qdisc_stats
.ce_mark
= q
->cstats
.ce_mark
;
573 st
.qdisc_stats
.memory_usage
= q
->memory_usage
;
574 st
.qdisc_stats
.drop_overmemory
= q
->drop_overmemory
;
577 list_for_each(pos
, &q
->new_flows
)
578 st
.qdisc_stats
.new_flows_len
++;
580 list_for_each(pos
, &q
->old_flows
)
581 st
.qdisc_stats
.old_flows_len
++;
582 sch_tree_unlock(sch
);
584 return gnet_stats_copy_app(d
, &st
, sizeof(st
));
587 static struct Qdisc
*fq_codel_leaf(struct Qdisc
*sch
, unsigned long arg
)
592 static unsigned long fq_codel_get(struct Qdisc
*sch
, u32 classid
)
597 static unsigned long fq_codel_bind(struct Qdisc
*sch
, unsigned long parent
,
600 /* we cannot bypass queue discipline anymore */
601 sch
->flags
&= ~TCQ_F_CAN_BYPASS
;
605 static void fq_codel_put(struct Qdisc
*q
, unsigned long cl
)
609 static struct tcf_proto __rcu
**fq_codel_find_tcf(struct Qdisc
*sch
,
612 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
616 return &q
->filter_list
;
619 static int fq_codel_dump_class(struct Qdisc
*sch
, unsigned long cl
,
620 struct sk_buff
*skb
, struct tcmsg
*tcm
)
622 tcm
->tcm_handle
|= TC_H_MIN(cl
);
626 static int fq_codel_dump_class_stats(struct Qdisc
*sch
, unsigned long cl
,
629 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
631 struct gnet_stats_queue qs
= { 0 };
632 struct tc_fq_codel_xstats xstats
;
634 if (idx
< q
->flows_cnt
) {
635 const struct fq_codel_flow
*flow
= &q
->flows
[idx
];
636 const struct sk_buff
*skb
;
638 memset(&xstats
, 0, sizeof(xstats
));
639 xstats
.type
= TCA_FQ_CODEL_XSTATS_CLASS
;
640 xstats
.class_stats
.deficit
= flow
->deficit
;
641 xstats
.class_stats
.ldelay
=
642 codel_time_to_us(flow
->cvars
.ldelay
);
643 xstats
.class_stats
.count
= flow
->cvars
.count
;
644 xstats
.class_stats
.lastcount
= flow
->cvars
.lastcount
;
645 xstats
.class_stats
.dropping
= flow
->cvars
.dropping
;
646 if (flow
->cvars
.dropping
) {
647 codel_tdiff_t delta
= flow
->cvars
.drop_next
-
650 xstats
.class_stats
.drop_next
= (delta
>= 0) ?
651 codel_time_to_us(delta
) :
652 -codel_time_to_us(-delta
);
661 sch_tree_unlock(sch
);
663 qs
.backlog
= q
->backlogs
[idx
];
664 qs
.drops
= flow
->dropped
;
666 if (gnet_stats_copy_queue(d
, NULL
, &qs
, qs
.qlen
) < 0)
668 if (idx
< q
->flows_cnt
)
669 return gnet_stats_copy_app(d
, &xstats
, sizeof(xstats
));
673 static void fq_codel_walk(struct Qdisc
*sch
, struct qdisc_walker
*arg
)
675 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
681 for (i
= 0; i
< q
->flows_cnt
; i
++) {
682 if (list_empty(&q
->flows
[i
].flowchain
) ||
683 arg
->count
< arg
->skip
) {
687 if (arg
->fn(sch
, i
+ 1, arg
) < 0) {
695 static const struct Qdisc_class_ops fq_codel_class_ops
= {
696 .leaf
= fq_codel_leaf
,
699 .tcf_chain
= fq_codel_find_tcf
,
700 .bind_tcf
= fq_codel_bind
,
701 .unbind_tcf
= fq_codel_put
,
702 .dump
= fq_codel_dump_class
,
703 .dump_stats
= fq_codel_dump_class_stats
,
704 .walk
= fq_codel_walk
,
707 static struct Qdisc_ops fq_codel_qdisc_ops __read_mostly
= {
708 .cl_ops
= &fq_codel_class_ops
,
710 .priv_size
= sizeof(struct fq_codel_sched_data
),
711 .enqueue
= fq_codel_enqueue
,
712 .dequeue
= fq_codel_dequeue
,
713 .peek
= qdisc_peek_dequeued
,
714 .init
= fq_codel_init
,
715 .reset
= fq_codel_reset
,
716 .destroy
= fq_codel_destroy
,
717 .change
= fq_codel_change
,
718 .dump
= fq_codel_dump
,
719 .dump_stats
= fq_codel_dump_stats
,
720 .owner
= THIS_MODULE
,
723 static int __init
fq_codel_module_init(void)
725 return register_qdisc(&fq_codel_qdisc_ops
);
728 static void __exit
fq_codel_module_exit(void)
730 unregister_qdisc(&fq_codel_qdisc_ops
);
733 module_init(fq_codel_module_init
)
734 module_exit(fq_codel_module_exit
)
735 MODULE_AUTHOR("Eric Dumazet");
736 MODULE_LICENSE("GPL");