1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Fair Queue CoDel discipline
5 * Copyright (C) 2012,2015 Eric Dumazet <edumazet@google.com>
8 #include <linux/module.h>
9 #include <linux/types.h>
10 #include <linux/kernel.h>
11 #include <linux/jiffies.h>
12 #include <linux/string.h>
14 #include <linux/errno.h>
15 #include <linux/init.h>
16 #include <linux/skbuff.h>
17 #include <linux/jhash.h>
18 #include <linux/slab.h>
19 #include <linux/vmalloc.h>
20 #include <net/netlink.h>
21 #include <net/pkt_sched.h>
22 #include <net/pkt_cls.h>
23 #include <net/codel.h>
24 #include <net/codel_impl.h>
25 #include <net/codel_qdisc.h>
30 * Packets are classified (internal classifier or external) on flows.
31 * This is a Stochastic model (as we use a hash, several flows
32 * might be hashed on same slot)
33 * Each flow has a CoDel managed queue.
34 * Flows are linked onto two (Round Robin) lists,
35 * so that new flows have priority on old ones.
37 * For a given flow, packets are not reordered (CoDel uses a FIFO)
39 * ECN capability is on by default.
40 * Low memory footprint (64 bytes per flow)
43 struct fq_codel_flow
{
46 struct list_head flowchain
;
48 struct codel_vars cvars
;
49 }; /* please try to keep this structure <= 64 bytes */
51 struct fq_codel_sched_data
{
52 struct tcf_proto __rcu
*filter_list
; /* optional external classifier */
53 struct tcf_block
*block
;
54 struct fq_codel_flow
*flows
; /* Flows table [flows_cnt] */
55 u32
*backlogs
; /* backlog table [flows_cnt] */
56 u32 flows_cnt
; /* number of flows */
57 u32 quantum
; /* psched_mtu(qdisc_dev(sch)); */
60 struct codel_params cparams
;
61 struct codel_stats cstats
;
67 struct list_head new_flows
; /* list of new flows */
68 struct list_head old_flows
; /* list of old flows */
71 static unsigned int fq_codel_hash(const struct fq_codel_sched_data
*q
,
74 return reciprocal_scale(skb_get_hash(skb
), q
->flows_cnt
);
77 static unsigned int fq_codel_classify(struct sk_buff
*skb
, struct Qdisc
*sch
,
80 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
81 struct tcf_proto
*filter
;
82 struct tcf_result res
;
85 if (TC_H_MAJ(skb
->priority
) == sch
->handle
&&
86 TC_H_MIN(skb
->priority
) > 0 &&
87 TC_H_MIN(skb
->priority
) <= q
->flows_cnt
)
88 return TC_H_MIN(skb
->priority
);
90 filter
= rcu_dereference_bh(q
->filter_list
);
92 return fq_codel_hash(q
, skb
) + 1;
94 *qerr
= NET_XMIT_SUCCESS
| __NET_XMIT_BYPASS
;
95 result
= tcf_classify(skb
, filter
, &res
, false);
97 #ifdef CONFIG_NET_CLS_ACT
102 *qerr
= NET_XMIT_SUCCESS
| __NET_XMIT_STOLEN
;
108 if (TC_H_MIN(res
.classid
) <= q
->flows_cnt
)
109 return TC_H_MIN(res
.classid
);
114 /* helper functions : might be changed when/if skb use a standard list_head */
116 /* remove one skb from head of slot queue */
117 static inline struct sk_buff
*dequeue_head(struct fq_codel_flow
*flow
)
119 struct sk_buff
*skb
= flow
->head
;
121 flow
->head
= skb
->next
;
122 skb_mark_not_on_list(skb
);
126 /* add skb to flow queue (tail add) */
127 static inline void flow_queue_add(struct fq_codel_flow
*flow
,
130 if (flow
->head
== NULL
)
133 flow
->tail
->next
= skb
;
138 static unsigned int fq_codel_drop(struct Qdisc
*sch
, unsigned int max_packets
,
139 struct sk_buff
**to_free
)
141 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
143 unsigned int maxbacklog
= 0, idx
= 0, i
, len
;
144 struct fq_codel_flow
*flow
;
145 unsigned int threshold
;
146 unsigned int mem
= 0;
148 /* Queue is full! Find the fat flow and drop packet(s) from it.
149 * This might sound expensive, but with 1024 flows, we scan
150 * 4KB of memory, and we dont need to handle a complex tree
151 * in fast path (packet queue/enqueue) with many cache misses.
152 * In stress mode, we'll try to drop 64 packets from the flow,
153 * amortizing this linear lookup to one cache line per drop.
155 for (i
= 0; i
< q
->flows_cnt
; i
++) {
156 if (q
->backlogs
[i
] > maxbacklog
) {
157 maxbacklog
= q
->backlogs
[i
];
162 /* Our goal is to drop half of this fat flow backlog */
163 threshold
= maxbacklog
>> 1;
165 flow
= &q
->flows
[idx
];
169 skb
= dequeue_head(flow
);
170 len
+= qdisc_pkt_len(skb
);
171 mem
+= get_codel_cb(skb
)->mem_usage
;
172 __qdisc_drop(skb
, to_free
);
173 } while (++i
< max_packets
&& len
< threshold
);
175 /* Tell codel to increase its signal strength also */
176 flow
->cvars
.count
+= i
;
177 q
->backlogs
[idx
] -= len
;
178 q
->memory_usage
-= mem
;
179 sch
->qstats
.drops
+= i
;
180 sch
->qstats
.backlog
-= len
;
185 static int fq_codel_enqueue(struct sk_buff
*skb
, struct Qdisc
*sch
,
186 struct sk_buff
**to_free
)
188 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
189 unsigned int idx
, prev_backlog
, prev_qlen
;
190 struct fq_codel_flow
*flow
;
191 int uninitialized_var(ret
);
192 unsigned int pkt_len
;
195 idx
= fq_codel_classify(skb
, sch
, &ret
);
197 if (ret
& __NET_XMIT_BYPASS
)
198 qdisc_qstats_drop(sch
);
199 __qdisc_drop(skb
, to_free
);
204 codel_set_enqueue_time(skb
);
205 flow
= &q
->flows
[idx
];
206 flow_queue_add(flow
, skb
);
207 q
->backlogs
[idx
] += qdisc_pkt_len(skb
);
208 qdisc_qstats_backlog_inc(sch
, skb
);
210 if (list_empty(&flow
->flowchain
)) {
211 list_add_tail(&flow
->flowchain
, &q
->new_flows
);
213 flow
->deficit
= q
->quantum
;
215 get_codel_cb(skb
)->mem_usage
= skb
->truesize
;
216 q
->memory_usage
+= get_codel_cb(skb
)->mem_usage
;
217 memory_limited
= q
->memory_usage
> q
->memory_limit
;
218 if (++sch
->q
.qlen
<= sch
->limit
&& !memory_limited
)
219 return NET_XMIT_SUCCESS
;
221 prev_backlog
= sch
->qstats
.backlog
;
222 prev_qlen
= sch
->q
.qlen
;
224 /* save this packet length as it might be dropped by fq_codel_drop() */
225 pkt_len
= qdisc_pkt_len(skb
);
226 /* fq_codel_drop() is quite expensive, as it performs a linear search
227 * in q->backlogs[] to find a fat flow.
228 * So instead of dropping a single packet, drop half of its backlog
229 * with a 64 packets limit to not add a too big cpu spike here.
231 ret
= fq_codel_drop(sch
, q
->drop_batch_size
, to_free
);
233 prev_qlen
-= sch
->q
.qlen
;
234 prev_backlog
-= sch
->qstats
.backlog
;
235 q
->drop_overlimit
+= prev_qlen
;
237 q
->drop_overmemory
+= prev_qlen
;
239 /* As we dropped packet(s), better let upper stack know this.
240 * If we dropped a packet for this flow, return NET_XMIT_CN,
241 * but in this case, our parents wont increase their backlogs.
244 qdisc_tree_reduce_backlog(sch
, prev_qlen
- 1,
245 prev_backlog
- pkt_len
);
248 qdisc_tree_reduce_backlog(sch
, prev_qlen
, prev_backlog
);
249 return NET_XMIT_SUCCESS
;
252 /* This is the specific function called from codel_dequeue()
253 * to dequeue a packet from queue. Note: backlog is handled in
254 * codel, we dont need to reduce it here.
256 static struct sk_buff
*dequeue_func(struct codel_vars
*vars
, void *ctx
)
258 struct Qdisc
*sch
= ctx
;
259 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
260 struct fq_codel_flow
*flow
;
261 struct sk_buff
*skb
= NULL
;
263 flow
= container_of(vars
, struct fq_codel_flow
, cvars
);
265 skb
= dequeue_head(flow
);
266 q
->backlogs
[flow
- q
->flows
] -= qdisc_pkt_len(skb
);
267 q
->memory_usage
-= get_codel_cb(skb
)->mem_usage
;
269 sch
->qstats
.backlog
-= qdisc_pkt_len(skb
);
274 static void drop_func(struct sk_buff
*skb
, void *ctx
)
276 struct Qdisc
*sch
= ctx
;
279 qdisc_qstats_drop(sch
);
282 static struct sk_buff
*fq_codel_dequeue(struct Qdisc
*sch
)
284 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
286 struct fq_codel_flow
*flow
;
287 struct list_head
*head
;
290 head
= &q
->new_flows
;
291 if (list_empty(head
)) {
292 head
= &q
->old_flows
;
293 if (list_empty(head
))
296 flow
= list_first_entry(head
, struct fq_codel_flow
, flowchain
);
298 if (flow
->deficit
<= 0) {
299 flow
->deficit
+= q
->quantum
;
300 list_move_tail(&flow
->flowchain
, &q
->old_flows
);
304 skb
= codel_dequeue(sch
, &sch
->qstats
.backlog
, &q
->cparams
,
305 &flow
->cvars
, &q
->cstats
, qdisc_pkt_len
,
306 codel_get_enqueue_time
, drop_func
, dequeue_func
);
309 /* force a pass through old_flows to prevent starvation */
310 if ((head
== &q
->new_flows
) && !list_empty(&q
->old_flows
))
311 list_move_tail(&flow
->flowchain
, &q
->old_flows
);
313 list_del_init(&flow
->flowchain
);
316 qdisc_bstats_update(sch
, skb
);
317 flow
->deficit
-= qdisc_pkt_len(skb
);
318 /* We cant call qdisc_tree_reduce_backlog() if our qlen is 0,
319 * or HTB crashes. Defer it for next round.
321 if (q
->cstats
.drop_count
&& sch
->q
.qlen
) {
322 qdisc_tree_reduce_backlog(sch
, q
->cstats
.drop_count
,
324 q
->cstats
.drop_count
= 0;
325 q
->cstats
.drop_len
= 0;
330 static void fq_codel_flow_purge(struct fq_codel_flow
*flow
)
332 rtnl_kfree_skbs(flow
->head
, flow
->tail
);
336 static void fq_codel_reset(struct Qdisc
*sch
)
338 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
341 INIT_LIST_HEAD(&q
->new_flows
);
342 INIT_LIST_HEAD(&q
->old_flows
);
343 for (i
= 0; i
< q
->flows_cnt
; i
++) {
344 struct fq_codel_flow
*flow
= q
->flows
+ i
;
346 fq_codel_flow_purge(flow
);
347 INIT_LIST_HEAD(&flow
->flowchain
);
348 codel_vars_init(&flow
->cvars
);
350 memset(q
->backlogs
, 0, q
->flows_cnt
* sizeof(u32
));
352 sch
->qstats
.backlog
= 0;
356 static const struct nla_policy fq_codel_policy
[TCA_FQ_CODEL_MAX
+ 1] = {
357 [TCA_FQ_CODEL_TARGET
] = { .type
= NLA_U32
},
358 [TCA_FQ_CODEL_LIMIT
] = { .type
= NLA_U32
},
359 [TCA_FQ_CODEL_INTERVAL
] = { .type
= NLA_U32
},
360 [TCA_FQ_CODEL_ECN
] = { .type
= NLA_U32
},
361 [TCA_FQ_CODEL_FLOWS
] = { .type
= NLA_U32
},
362 [TCA_FQ_CODEL_QUANTUM
] = { .type
= NLA_U32
},
363 [TCA_FQ_CODEL_CE_THRESHOLD
] = { .type
= NLA_U32
},
364 [TCA_FQ_CODEL_DROP_BATCH_SIZE
] = { .type
= NLA_U32
},
365 [TCA_FQ_CODEL_MEMORY_LIMIT
] = { .type
= NLA_U32
},
368 static int fq_codel_change(struct Qdisc
*sch
, struct nlattr
*opt
,
369 struct netlink_ext_ack
*extack
)
371 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
372 struct nlattr
*tb
[TCA_FQ_CODEL_MAX
+ 1];
378 err
= nla_parse_nested_deprecated(tb
, TCA_FQ_CODEL_MAX
, opt
,
379 fq_codel_policy
, NULL
);
382 if (tb
[TCA_FQ_CODEL_FLOWS
]) {
385 q
->flows_cnt
= nla_get_u32(tb
[TCA_FQ_CODEL_FLOWS
]);
387 q
->flows_cnt
> 65536)
392 if (tb
[TCA_FQ_CODEL_TARGET
]) {
393 u64 target
= nla_get_u32(tb
[TCA_FQ_CODEL_TARGET
]);
395 q
->cparams
.target
= (target
* NSEC_PER_USEC
) >> CODEL_SHIFT
;
398 if (tb
[TCA_FQ_CODEL_CE_THRESHOLD
]) {
399 u64 val
= nla_get_u32(tb
[TCA_FQ_CODEL_CE_THRESHOLD
]);
401 q
->cparams
.ce_threshold
= (val
* NSEC_PER_USEC
) >> CODEL_SHIFT
;
404 if (tb
[TCA_FQ_CODEL_INTERVAL
]) {
405 u64 interval
= nla_get_u32(tb
[TCA_FQ_CODEL_INTERVAL
]);
407 q
->cparams
.interval
= (interval
* NSEC_PER_USEC
) >> CODEL_SHIFT
;
410 if (tb
[TCA_FQ_CODEL_LIMIT
])
411 sch
->limit
= nla_get_u32(tb
[TCA_FQ_CODEL_LIMIT
]);
413 if (tb
[TCA_FQ_CODEL_ECN
])
414 q
->cparams
.ecn
= !!nla_get_u32(tb
[TCA_FQ_CODEL_ECN
]);
416 if (tb
[TCA_FQ_CODEL_QUANTUM
])
417 q
->quantum
= max(256U, nla_get_u32(tb
[TCA_FQ_CODEL_QUANTUM
]));
419 if (tb
[TCA_FQ_CODEL_DROP_BATCH_SIZE
])
420 q
->drop_batch_size
= min(1U, nla_get_u32(tb
[TCA_FQ_CODEL_DROP_BATCH_SIZE
]));
422 if (tb
[TCA_FQ_CODEL_MEMORY_LIMIT
])
423 q
->memory_limit
= min(1U << 31, nla_get_u32(tb
[TCA_FQ_CODEL_MEMORY_LIMIT
]));
425 while (sch
->q
.qlen
> sch
->limit
||
426 q
->memory_usage
> q
->memory_limit
) {
427 struct sk_buff
*skb
= fq_codel_dequeue(sch
);
429 q
->cstats
.drop_len
+= qdisc_pkt_len(skb
);
430 rtnl_kfree_skbs(skb
, skb
);
431 q
->cstats
.drop_count
++;
433 qdisc_tree_reduce_backlog(sch
, q
->cstats
.drop_count
, q
->cstats
.drop_len
);
434 q
->cstats
.drop_count
= 0;
435 q
->cstats
.drop_len
= 0;
437 sch_tree_unlock(sch
);
441 static void fq_codel_destroy(struct Qdisc
*sch
)
443 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
445 tcf_block_put(q
->block
);
450 static int fq_codel_init(struct Qdisc
*sch
, struct nlattr
*opt
,
451 struct netlink_ext_ack
*extack
)
453 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
457 sch
->limit
= 10*1024;
459 q
->memory_limit
= 32 << 20; /* 32 MBytes */
460 q
->drop_batch_size
= 64;
461 q
->quantum
= psched_mtu(qdisc_dev(sch
));
462 INIT_LIST_HEAD(&q
->new_flows
);
463 INIT_LIST_HEAD(&q
->old_flows
);
464 codel_params_init(&q
->cparams
);
465 codel_stats_init(&q
->cstats
);
466 q
->cparams
.ecn
= true;
467 q
->cparams
.mtu
= psched_mtu(qdisc_dev(sch
));
470 err
= fq_codel_change(sch
, opt
, extack
);
475 err
= tcf_block_get(&q
->block
, &q
->filter_list
, sch
, extack
);
480 q
->flows
= kvcalloc(q
->flows_cnt
,
481 sizeof(struct fq_codel_flow
),
487 q
->backlogs
= kvcalloc(q
->flows_cnt
, sizeof(u32
), GFP_KERNEL
);
492 for (i
= 0; i
< q
->flows_cnt
; i
++) {
493 struct fq_codel_flow
*flow
= q
->flows
+ i
;
495 INIT_LIST_HEAD(&flow
->flowchain
);
496 codel_vars_init(&flow
->cvars
);
500 sch
->flags
|= TCQ_F_CAN_BYPASS
;
502 sch
->flags
&= ~TCQ_F_CAN_BYPASS
;
513 static int fq_codel_dump(struct Qdisc
*sch
, struct sk_buff
*skb
)
515 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
518 opts
= nla_nest_start_noflag(skb
, TCA_OPTIONS
);
520 goto nla_put_failure
;
522 if (nla_put_u32(skb
, TCA_FQ_CODEL_TARGET
,
523 codel_time_to_us(q
->cparams
.target
)) ||
524 nla_put_u32(skb
, TCA_FQ_CODEL_LIMIT
,
526 nla_put_u32(skb
, TCA_FQ_CODEL_INTERVAL
,
527 codel_time_to_us(q
->cparams
.interval
)) ||
528 nla_put_u32(skb
, TCA_FQ_CODEL_ECN
,
530 nla_put_u32(skb
, TCA_FQ_CODEL_QUANTUM
,
532 nla_put_u32(skb
, TCA_FQ_CODEL_DROP_BATCH_SIZE
,
533 q
->drop_batch_size
) ||
534 nla_put_u32(skb
, TCA_FQ_CODEL_MEMORY_LIMIT
,
536 nla_put_u32(skb
, TCA_FQ_CODEL_FLOWS
,
538 goto nla_put_failure
;
540 if (q
->cparams
.ce_threshold
!= CODEL_DISABLED_THRESHOLD
&&
541 nla_put_u32(skb
, TCA_FQ_CODEL_CE_THRESHOLD
,
542 codel_time_to_us(q
->cparams
.ce_threshold
)))
543 goto nla_put_failure
;
545 return nla_nest_end(skb
, opts
);
551 static int fq_codel_dump_stats(struct Qdisc
*sch
, struct gnet_dump
*d
)
553 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
554 struct tc_fq_codel_xstats st
= {
555 .type
= TCA_FQ_CODEL_XSTATS_QDISC
,
557 struct list_head
*pos
;
559 st
.qdisc_stats
.maxpacket
= q
->cstats
.maxpacket
;
560 st
.qdisc_stats
.drop_overlimit
= q
->drop_overlimit
;
561 st
.qdisc_stats
.ecn_mark
= q
->cstats
.ecn_mark
;
562 st
.qdisc_stats
.new_flow_count
= q
->new_flow_count
;
563 st
.qdisc_stats
.ce_mark
= q
->cstats
.ce_mark
;
564 st
.qdisc_stats
.memory_usage
= q
->memory_usage
;
565 st
.qdisc_stats
.drop_overmemory
= q
->drop_overmemory
;
568 list_for_each(pos
, &q
->new_flows
)
569 st
.qdisc_stats
.new_flows_len
++;
571 list_for_each(pos
, &q
->old_flows
)
572 st
.qdisc_stats
.old_flows_len
++;
573 sch_tree_unlock(sch
);
575 return gnet_stats_copy_app(d
, &st
, sizeof(st
));
578 static struct Qdisc
*fq_codel_leaf(struct Qdisc
*sch
, unsigned long arg
)
583 static unsigned long fq_codel_find(struct Qdisc
*sch
, u32 classid
)
588 static unsigned long fq_codel_bind(struct Qdisc
*sch
, unsigned long parent
,
594 static void fq_codel_unbind(struct Qdisc
*q
, unsigned long cl
)
598 static struct tcf_block
*fq_codel_tcf_block(struct Qdisc
*sch
, unsigned long cl
,
599 struct netlink_ext_ack
*extack
)
601 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
608 static int fq_codel_dump_class(struct Qdisc
*sch
, unsigned long cl
,
609 struct sk_buff
*skb
, struct tcmsg
*tcm
)
611 tcm
->tcm_handle
|= TC_H_MIN(cl
);
615 static int fq_codel_dump_class_stats(struct Qdisc
*sch
, unsigned long cl
,
618 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
620 struct gnet_stats_queue qs
= { 0 };
621 struct tc_fq_codel_xstats xstats
;
623 if (idx
< q
->flows_cnt
) {
624 const struct fq_codel_flow
*flow
= &q
->flows
[idx
];
625 const struct sk_buff
*skb
;
627 memset(&xstats
, 0, sizeof(xstats
));
628 xstats
.type
= TCA_FQ_CODEL_XSTATS_CLASS
;
629 xstats
.class_stats
.deficit
= flow
->deficit
;
630 xstats
.class_stats
.ldelay
=
631 codel_time_to_us(flow
->cvars
.ldelay
);
632 xstats
.class_stats
.count
= flow
->cvars
.count
;
633 xstats
.class_stats
.lastcount
= flow
->cvars
.lastcount
;
634 xstats
.class_stats
.dropping
= flow
->cvars
.dropping
;
635 if (flow
->cvars
.dropping
) {
636 codel_tdiff_t delta
= flow
->cvars
.drop_next
-
639 xstats
.class_stats
.drop_next
= (delta
>= 0) ?
640 codel_time_to_us(delta
) :
641 -codel_time_to_us(-delta
);
650 sch_tree_unlock(sch
);
652 qs
.backlog
= q
->backlogs
[idx
];
655 if (gnet_stats_copy_queue(d
, NULL
, &qs
, qs
.qlen
) < 0)
657 if (idx
< q
->flows_cnt
)
658 return gnet_stats_copy_app(d
, &xstats
, sizeof(xstats
));
662 static void fq_codel_walk(struct Qdisc
*sch
, struct qdisc_walker
*arg
)
664 struct fq_codel_sched_data
*q
= qdisc_priv(sch
);
670 for (i
= 0; i
< q
->flows_cnt
; i
++) {
671 if (list_empty(&q
->flows
[i
].flowchain
) ||
672 arg
->count
< arg
->skip
) {
676 if (arg
->fn(sch
, i
+ 1, arg
) < 0) {
684 static const struct Qdisc_class_ops fq_codel_class_ops
= {
685 .leaf
= fq_codel_leaf
,
686 .find
= fq_codel_find
,
687 .tcf_block
= fq_codel_tcf_block
,
688 .bind_tcf
= fq_codel_bind
,
689 .unbind_tcf
= fq_codel_unbind
,
690 .dump
= fq_codel_dump_class
,
691 .dump_stats
= fq_codel_dump_class_stats
,
692 .walk
= fq_codel_walk
,
695 static struct Qdisc_ops fq_codel_qdisc_ops __read_mostly
= {
696 .cl_ops
= &fq_codel_class_ops
,
698 .priv_size
= sizeof(struct fq_codel_sched_data
),
699 .enqueue
= fq_codel_enqueue
,
700 .dequeue
= fq_codel_dequeue
,
701 .peek
= qdisc_peek_dequeued
,
702 .init
= fq_codel_init
,
703 .reset
= fq_codel_reset
,
704 .destroy
= fq_codel_destroy
,
705 .change
= fq_codel_change
,
706 .dump
= fq_codel_dump
,
707 .dump_stats
= fq_codel_dump_stats
,
708 .owner
= THIS_MODULE
,
711 static int __init
fq_codel_module_init(void)
713 return register_qdisc(&fq_codel_qdisc_ops
);
716 static void __exit
fq_codel_module_exit(void)
718 unregister_qdisc(&fq_codel_qdisc_ops
);
721 module_init(fq_codel_module_init
)
722 module_exit(fq_codel_module_exit
)
723 MODULE_AUTHOR("Eric Dumazet");
724 MODULE_LICENSE("GPL");