14b549a2eSEric Dumazet /* 24b549a2eSEric Dumazet * Fair Queue CoDel discipline 34b549a2eSEric Dumazet * 44b549a2eSEric Dumazet * This program is free software; you can redistribute it and/or 54b549a2eSEric Dumazet * modify it under the terms of the GNU General Public License 64b549a2eSEric Dumazet * as published by the Free Software Foundation; either version 74b549a2eSEric Dumazet * 2 of the License, or (at your option) any later version. 84b549a2eSEric Dumazet * 980ba92faSEric Dumazet * Copyright (C) 2012,2015 Eric Dumazet <edumazet@google.com> 104b549a2eSEric Dumazet */ 114b549a2eSEric Dumazet 124b549a2eSEric Dumazet #include <linux/module.h> 134b549a2eSEric Dumazet #include <linux/types.h> 144b549a2eSEric Dumazet #include <linux/kernel.h> 154b549a2eSEric Dumazet #include <linux/jiffies.h> 164b549a2eSEric Dumazet #include <linux/string.h> 174b549a2eSEric Dumazet #include <linux/in.h> 184b549a2eSEric Dumazet #include <linux/errno.h> 194b549a2eSEric Dumazet #include <linux/init.h> 204b549a2eSEric Dumazet #include <linux/skbuff.h> 214b549a2eSEric Dumazet #include <linux/jhash.h> 224b549a2eSEric Dumazet #include <linux/slab.h> 234b549a2eSEric Dumazet #include <linux/vmalloc.h> 244b549a2eSEric Dumazet #include <net/netlink.h> 254b549a2eSEric Dumazet #include <net/pkt_sched.h> 26cf1facdaSJiri Pirko #include <net/pkt_cls.h> 274b549a2eSEric Dumazet #include <net/codel.h> 28d068ca2aSMichal Kazior #include <net/codel_impl.h> 29d068ca2aSMichal Kazior #include <net/codel_qdisc.h> 304b549a2eSEric Dumazet 314b549a2eSEric Dumazet /* Fair Queue CoDel. 324b549a2eSEric Dumazet * 334b549a2eSEric Dumazet * Principles : 344b549a2eSEric Dumazet * Packets are classified (internal classifier or external) on flows. 354b549a2eSEric Dumazet * This is a Stochastic model (as we use a hash, several flows 364b549a2eSEric Dumazet * might be hashed on same slot) 374b549a2eSEric Dumazet * Each flow has a CoDel managed queue. 384b549a2eSEric Dumazet * Flows are linked onto two (Round Robin) lists, 394b549a2eSEric Dumazet * so that new flows have priority on old ones. 404b549a2eSEric Dumazet * 414b549a2eSEric Dumazet * For a given flow, packets are not reordered (CoDel uses a FIFO) 424b549a2eSEric Dumazet * head drops only. 434b549a2eSEric Dumazet * ECN capability is on by default. 444b549a2eSEric Dumazet * Low memory footprint (64 bytes per flow) 454b549a2eSEric Dumazet */ 464b549a2eSEric Dumazet 474b549a2eSEric Dumazet struct fq_codel_flow { 484b549a2eSEric Dumazet struct sk_buff *head; 494b549a2eSEric Dumazet struct sk_buff *tail; 504b549a2eSEric Dumazet struct list_head flowchain; 514b549a2eSEric Dumazet int deficit; 524b549a2eSEric Dumazet u32 dropped; /* number of drops (or ECN marks) on this flow */ 534b549a2eSEric Dumazet struct codel_vars cvars; 544b549a2eSEric Dumazet }; /* please try to keep this structure <= 64 bytes */ 554b549a2eSEric Dumazet 564b549a2eSEric Dumazet struct fq_codel_sched_data { 5725d8c0d5SJohn Fastabend struct tcf_proto __rcu *filter_list; /* optional external classifier */ 586529eabaSJiri Pirko struct tcf_block *block; 594b549a2eSEric Dumazet struct fq_codel_flow *flows; /* Flows table [flows_cnt] */ 604b549a2eSEric Dumazet u32 *backlogs; /* backlog table [flows_cnt] */ 614b549a2eSEric Dumazet u32 flows_cnt; /* number of flows */ 624b549a2eSEric Dumazet u32 quantum; /* psched_mtu(qdisc_dev(sch)); */ 639d18562aSEric Dumazet u32 drop_batch_size; 6495b58430SEric Dumazet u32 memory_limit; 654b549a2eSEric Dumazet struct codel_params cparams; 664b549a2eSEric Dumazet struct codel_stats cstats; 6795b58430SEric Dumazet u32 memory_usage; 6895b58430SEric Dumazet u32 drop_overmemory; 694b549a2eSEric Dumazet u32 drop_overlimit; 704b549a2eSEric Dumazet u32 new_flow_count; 714b549a2eSEric Dumazet 724b549a2eSEric Dumazet struct list_head new_flows; /* list of new flows */ 734b549a2eSEric Dumazet struct list_head old_flows; /* list of old flows */ 744b549a2eSEric Dumazet }; 754b549a2eSEric Dumazet 764b549a2eSEric Dumazet static unsigned int fq_codel_hash(const struct fq_codel_sched_data *q, 77342db221STom Herbert struct sk_buff *skb) 784b549a2eSEric Dumazet { 79264b87faSAndrew Collins return reciprocal_scale(skb_get_hash(skb), q->flows_cnt); 804b549a2eSEric Dumazet } 814b549a2eSEric Dumazet 824b549a2eSEric Dumazet static unsigned int fq_codel_classify(struct sk_buff *skb, struct Qdisc *sch, 834b549a2eSEric Dumazet int *qerr) 844b549a2eSEric Dumazet { 854b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 8625d8c0d5SJohn Fastabend struct tcf_proto *filter; 874b549a2eSEric Dumazet struct tcf_result res; 884b549a2eSEric Dumazet int result; 894b549a2eSEric Dumazet 904b549a2eSEric Dumazet if (TC_H_MAJ(skb->priority) == sch->handle && 914b549a2eSEric Dumazet TC_H_MIN(skb->priority) > 0 && 924b549a2eSEric Dumazet TC_H_MIN(skb->priority) <= q->flows_cnt) 934b549a2eSEric Dumazet return TC_H_MIN(skb->priority); 944b549a2eSEric Dumazet 9569204cf7SValdis.Kletnieks@vt.edu filter = rcu_dereference_bh(q->filter_list); 9625d8c0d5SJohn Fastabend if (!filter) 974b549a2eSEric Dumazet return fq_codel_hash(q, skb) + 1; 984b549a2eSEric Dumazet 994b549a2eSEric Dumazet *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS; 10087d83093SJiri Pirko result = tcf_classify(skb, filter, &res, false); 1014b549a2eSEric Dumazet if (result >= 0) { 1024b549a2eSEric Dumazet #ifdef CONFIG_NET_CLS_ACT 1034b549a2eSEric Dumazet switch (result) { 1044b549a2eSEric Dumazet case TC_ACT_STOLEN: 1054b549a2eSEric Dumazet case TC_ACT_QUEUED: 106e25ea21fSJiri Pirko case TC_ACT_TRAP: 1074b549a2eSEric Dumazet *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN; 1084b549a2eSEric Dumazet case TC_ACT_SHOT: 1094b549a2eSEric Dumazet return 0; 1104b549a2eSEric Dumazet } 1114b549a2eSEric Dumazet #endif 1124b549a2eSEric Dumazet if (TC_H_MIN(res.classid) <= q->flows_cnt) 1134b549a2eSEric Dumazet return TC_H_MIN(res.classid); 1144b549a2eSEric Dumazet } 1154b549a2eSEric Dumazet return 0; 1164b549a2eSEric Dumazet } 1174b549a2eSEric Dumazet 1184b549a2eSEric Dumazet /* helper functions : might be changed when/if skb use a standard list_head */ 1194b549a2eSEric Dumazet 1204b549a2eSEric Dumazet /* remove one skb from head of slot queue */ 1214b549a2eSEric Dumazet static inline struct sk_buff *dequeue_head(struct fq_codel_flow *flow) 1224b549a2eSEric Dumazet { 1234b549a2eSEric Dumazet struct sk_buff *skb = flow->head; 1244b549a2eSEric Dumazet 1254b549a2eSEric Dumazet flow->head = skb->next; 1264b549a2eSEric Dumazet skb->next = NULL; 1274b549a2eSEric Dumazet return skb; 1284b549a2eSEric Dumazet } 1294b549a2eSEric Dumazet 1304b549a2eSEric Dumazet /* add skb to flow queue (tail add) */ 1314b549a2eSEric Dumazet static inline void flow_queue_add(struct fq_codel_flow *flow, 1324b549a2eSEric Dumazet struct sk_buff *skb) 1334b549a2eSEric Dumazet { 1344b549a2eSEric Dumazet if (flow->head == NULL) 1354b549a2eSEric Dumazet flow->head = skb; 1364b549a2eSEric Dumazet else 1374b549a2eSEric Dumazet flow->tail->next = skb; 1384b549a2eSEric Dumazet flow->tail = skb; 1394b549a2eSEric Dumazet skb->next = NULL; 1404b549a2eSEric Dumazet } 1414b549a2eSEric Dumazet 142520ac30fSEric Dumazet static unsigned int fq_codel_drop(struct Qdisc *sch, unsigned int max_packets, 143520ac30fSEric Dumazet struct sk_buff **to_free) 1444b549a2eSEric Dumazet { 1454b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 1464b549a2eSEric Dumazet struct sk_buff *skb; 1474b549a2eSEric Dumazet unsigned int maxbacklog = 0, idx = 0, i, len; 1484b549a2eSEric Dumazet struct fq_codel_flow *flow; 1499d18562aSEric Dumazet unsigned int threshold; 15095b58430SEric Dumazet unsigned int mem = 0; 1514b549a2eSEric Dumazet 1529d18562aSEric Dumazet /* Queue is full! Find the fat flow and drop packet(s) from it. 1534b549a2eSEric Dumazet * This might sound expensive, but with 1024 flows, we scan 1544b549a2eSEric Dumazet * 4KB of memory, and we dont need to handle a complex tree 1554b549a2eSEric Dumazet * in fast path (packet queue/enqueue) with many cache misses. 1569d18562aSEric Dumazet * In stress mode, we'll try to drop 64 packets from the flow, 1579d18562aSEric Dumazet * amortizing this linear lookup to one cache line per drop. 1584b549a2eSEric Dumazet */ 1594b549a2eSEric Dumazet for (i = 0; i < q->flows_cnt; i++) { 1604b549a2eSEric Dumazet if (q->backlogs[i] > maxbacklog) { 1614b549a2eSEric Dumazet maxbacklog = q->backlogs[i]; 1624b549a2eSEric Dumazet idx = i; 1634b549a2eSEric Dumazet } 1644b549a2eSEric Dumazet } 1659d18562aSEric Dumazet 1669d18562aSEric Dumazet /* Our goal is to drop half of this fat flow backlog */ 1679d18562aSEric Dumazet threshold = maxbacklog >> 1; 1689d18562aSEric Dumazet 1694b549a2eSEric Dumazet flow = &q->flows[idx]; 1709d18562aSEric Dumazet len = 0; 1719d18562aSEric Dumazet i = 0; 1729d18562aSEric Dumazet do { 1734b549a2eSEric Dumazet skb = dequeue_head(flow); 1749d18562aSEric Dumazet len += qdisc_pkt_len(skb); 175008830bcSEric Dumazet mem += get_codel_cb(skb)->mem_usage; 176520ac30fSEric Dumazet __qdisc_drop(skb, to_free); 1779d18562aSEric Dumazet } while (++i < max_packets && len < threshold); 1789d18562aSEric Dumazet 1799d18562aSEric Dumazet flow->dropped += i; 1809d18562aSEric Dumazet q->backlogs[idx] -= len; 18195b58430SEric Dumazet q->memory_usage -= mem; 1829d18562aSEric Dumazet sch->qstats.drops += i; 1839d18562aSEric Dumazet sch->qstats.backlog -= len; 1849d18562aSEric Dumazet sch->q.qlen -= i; 1854b549a2eSEric Dumazet return idx; 1864b549a2eSEric Dumazet } 1874b549a2eSEric Dumazet 188520ac30fSEric Dumazet static int fq_codel_enqueue(struct sk_buff *skb, struct Qdisc *sch, 189520ac30fSEric Dumazet struct sk_buff **to_free) 1904b549a2eSEric Dumazet { 1914b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 1929d18562aSEric Dumazet unsigned int idx, prev_backlog, prev_qlen; 1934b549a2eSEric Dumazet struct fq_codel_flow *flow; 1944b549a2eSEric Dumazet int uninitialized_var(ret); 19580e509dbSEric Dumazet unsigned int pkt_len; 19695b58430SEric Dumazet bool memory_limited; 1974b549a2eSEric Dumazet 1984b549a2eSEric Dumazet idx = fq_codel_classify(skb, sch, &ret); 1994b549a2eSEric Dumazet if (idx == 0) { 2004b549a2eSEric Dumazet if (ret & __NET_XMIT_BYPASS) 20125331d6cSJohn Fastabend qdisc_qstats_drop(sch); 202520ac30fSEric Dumazet __qdisc_drop(skb, to_free); 2034b549a2eSEric Dumazet return ret; 2044b549a2eSEric Dumazet } 2054b549a2eSEric Dumazet idx--; 2064b549a2eSEric Dumazet 2074b549a2eSEric Dumazet codel_set_enqueue_time(skb); 2084b549a2eSEric Dumazet flow = &q->flows[idx]; 2094b549a2eSEric Dumazet flow_queue_add(flow, skb); 2104b549a2eSEric Dumazet q->backlogs[idx] += qdisc_pkt_len(skb); 21125331d6cSJohn Fastabend qdisc_qstats_backlog_inc(sch, skb); 2124b549a2eSEric Dumazet 2134b549a2eSEric Dumazet if (list_empty(&flow->flowchain)) { 2144b549a2eSEric Dumazet list_add_tail(&flow->flowchain, &q->new_flows); 2154b549a2eSEric Dumazet q->new_flow_count++; 2164b549a2eSEric Dumazet flow->deficit = q->quantum; 2174b549a2eSEric Dumazet flow->dropped = 0; 2184b549a2eSEric Dumazet } 219008830bcSEric Dumazet get_codel_cb(skb)->mem_usage = skb->truesize; 220008830bcSEric Dumazet q->memory_usage += get_codel_cb(skb)->mem_usage; 22195b58430SEric Dumazet memory_limited = q->memory_usage > q->memory_limit; 22295b58430SEric Dumazet if (++sch->q.qlen <= sch->limit && !memory_limited) 2234b549a2eSEric Dumazet return NET_XMIT_SUCCESS; 2244b549a2eSEric Dumazet 2252ccccf5fSWANG Cong prev_backlog = sch->qstats.backlog; 2269d18562aSEric Dumazet prev_qlen = sch->q.qlen; 2274b549a2eSEric Dumazet 22880e509dbSEric Dumazet /* save this packet length as it might be dropped by fq_codel_drop() */ 22980e509dbSEric Dumazet pkt_len = qdisc_pkt_len(skb); 2309d18562aSEric Dumazet /* fq_codel_drop() is quite expensive, as it performs a linear search 2319d18562aSEric Dumazet * in q->backlogs[] to find a fat flow. 2329d18562aSEric Dumazet * So instead of dropping a single packet, drop half of its backlog 2339d18562aSEric Dumazet * with a 64 packets limit to not add a too big cpu spike here. 2349d18562aSEric Dumazet */ 235520ac30fSEric Dumazet ret = fq_codel_drop(sch, q->drop_batch_size, to_free); 2369d18562aSEric Dumazet 23780e509dbSEric Dumazet prev_qlen -= sch->q.qlen; 23880e509dbSEric Dumazet prev_backlog -= sch->qstats.backlog; 23980e509dbSEric Dumazet q->drop_overlimit += prev_qlen; 24095b58430SEric Dumazet if (memory_limited) 24180e509dbSEric Dumazet q->drop_overmemory += prev_qlen; 2429d18562aSEric Dumazet 24380e509dbSEric Dumazet /* As we dropped packet(s), better let upper stack know this. 24480e509dbSEric Dumazet * If we dropped a packet for this flow, return NET_XMIT_CN, 24580e509dbSEric Dumazet * but in this case, our parents wont increase their backlogs. 24680e509dbSEric Dumazet */ 24780e509dbSEric Dumazet if (ret == idx) { 24880e509dbSEric Dumazet qdisc_tree_reduce_backlog(sch, prev_qlen - 1, 24980e509dbSEric Dumazet prev_backlog - pkt_len); 25080e509dbSEric Dumazet return NET_XMIT_CN; 25180e509dbSEric Dumazet } 25280e509dbSEric Dumazet qdisc_tree_reduce_backlog(sch, prev_qlen, prev_backlog); 25380e509dbSEric Dumazet return NET_XMIT_SUCCESS; 2544b549a2eSEric Dumazet } 2554b549a2eSEric Dumazet 2564b549a2eSEric Dumazet /* This is the specific function called from codel_dequeue() 2574b549a2eSEric Dumazet * to dequeue a packet from queue. Note: backlog is handled in 2584b549a2eSEric Dumazet * codel, we dont need to reduce it here. 2594b549a2eSEric Dumazet */ 26079bdc4c8SMichal Kazior static struct sk_buff *dequeue_func(struct codel_vars *vars, void *ctx) 2614b549a2eSEric Dumazet { 26279bdc4c8SMichal Kazior struct Qdisc *sch = ctx; 263865ec552SEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 2644b549a2eSEric Dumazet struct fq_codel_flow *flow; 2654b549a2eSEric Dumazet struct sk_buff *skb = NULL; 2664b549a2eSEric Dumazet 2674b549a2eSEric Dumazet flow = container_of(vars, struct fq_codel_flow, cvars); 2684b549a2eSEric Dumazet if (flow->head) { 2694b549a2eSEric Dumazet skb = dequeue_head(flow); 270865ec552SEric Dumazet q->backlogs[flow - q->flows] -= qdisc_pkt_len(skb); 271008830bcSEric Dumazet q->memory_usage -= get_codel_cb(skb)->mem_usage; 2724b549a2eSEric Dumazet sch->q.qlen--; 27379bdc4c8SMichal Kazior sch->qstats.backlog -= qdisc_pkt_len(skb); 2744b549a2eSEric Dumazet } 2754b549a2eSEric Dumazet return skb; 2764b549a2eSEric Dumazet } 2774b549a2eSEric Dumazet 27879bdc4c8SMichal Kazior static void drop_func(struct sk_buff *skb, void *ctx) 27979bdc4c8SMichal Kazior { 28079bdc4c8SMichal Kazior struct Qdisc *sch = ctx; 28179bdc4c8SMichal Kazior 282520ac30fSEric Dumazet kfree_skb(skb); 283520ac30fSEric Dumazet qdisc_qstats_drop(sch); 28479bdc4c8SMichal Kazior } 28579bdc4c8SMichal Kazior 2864b549a2eSEric Dumazet static struct sk_buff *fq_codel_dequeue(struct Qdisc *sch) 2874b549a2eSEric Dumazet { 2884b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 2894b549a2eSEric Dumazet struct sk_buff *skb; 2904b549a2eSEric Dumazet struct fq_codel_flow *flow; 2914b549a2eSEric Dumazet struct list_head *head; 2924b549a2eSEric Dumazet u32 prev_drop_count, prev_ecn_mark; 2934b549a2eSEric Dumazet 2944b549a2eSEric Dumazet begin: 2954b549a2eSEric Dumazet head = &q->new_flows; 2964b549a2eSEric Dumazet if (list_empty(head)) { 2974b549a2eSEric Dumazet head = &q->old_flows; 2984b549a2eSEric Dumazet if (list_empty(head)) 2994b549a2eSEric Dumazet return NULL; 3004b549a2eSEric Dumazet } 3014b549a2eSEric Dumazet flow = list_first_entry(head, struct fq_codel_flow, flowchain); 3024b549a2eSEric Dumazet 3034b549a2eSEric Dumazet if (flow->deficit <= 0) { 3044b549a2eSEric Dumazet flow->deficit += q->quantum; 3054b549a2eSEric Dumazet list_move_tail(&flow->flowchain, &q->old_flows); 3064b549a2eSEric Dumazet goto begin; 3074b549a2eSEric Dumazet } 3084b549a2eSEric Dumazet 3094b549a2eSEric Dumazet prev_drop_count = q->cstats.drop_count; 3104b549a2eSEric Dumazet prev_ecn_mark = q->cstats.ecn_mark; 3114b549a2eSEric Dumazet 31279bdc4c8SMichal Kazior skb = codel_dequeue(sch, &sch->qstats.backlog, &q->cparams, 31379bdc4c8SMichal Kazior &flow->cvars, &q->cstats, qdisc_pkt_len, 31479bdc4c8SMichal Kazior codel_get_enqueue_time, drop_func, dequeue_func); 3154b549a2eSEric Dumazet 3164b549a2eSEric Dumazet flow->dropped += q->cstats.drop_count - prev_drop_count; 3174b549a2eSEric Dumazet flow->dropped += q->cstats.ecn_mark - prev_ecn_mark; 3184b549a2eSEric Dumazet 3194b549a2eSEric Dumazet if (!skb) { 3204b549a2eSEric Dumazet /* force a pass through old_flows to prevent starvation */ 3214b549a2eSEric Dumazet if ((head == &q->new_flows) && !list_empty(&q->old_flows)) 3224b549a2eSEric Dumazet list_move_tail(&flow->flowchain, &q->old_flows); 3234b549a2eSEric Dumazet else 3244b549a2eSEric Dumazet list_del_init(&flow->flowchain); 3254b549a2eSEric Dumazet goto begin; 3264b549a2eSEric Dumazet } 3274b549a2eSEric Dumazet qdisc_bstats_update(sch, skb); 3284b549a2eSEric Dumazet flow->deficit -= qdisc_pkt_len(skb); 3292ccccf5fSWANG Cong /* We cant call qdisc_tree_reduce_backlog() if our qlen is 0, 3304b549a2eSEric Dumazet * or HTB crashes. Defer it for next round. 3314b549a2eSEric Dumazet */ 3324b549a2eSEric Dumazet if (q->cstats.drop_count && sch->q.qlen) { 3332ccccf5fSWANG Cong qdisc_tree_reduce_backlog(sch, q->cstats.drop_count, 3342ccccf5fSWANG Cong q->cstats.drop_len); 3354b549a2eSEric Dumazet q->cstats.drop_count = 0; 3362ccccf5fSWANG Cong q->cstats.drop_len = 0; 3374b549a2eSEric Dumazet } 3384b549a2eSEric Dumazet return skb; 3394b549a2eSEric Dumazet } 3404b549a2eSEric Dumazet 341ece5d4c7SEric Dumazet static void fq_codel_flow_purge(struct fq_codel_flow *flow) 342ece5d4c7SEric Dumazet { 343ece5d4c7SEric Dumazet rtnl_kfree_skbs(flow->head, flow->tail); 344ece5d4c7SEric Dumazet flow->head = NULL; 345ece5d4c7SEric Dumazet } 346ece5d4c7SEric Dumazet 3474b549a2eSEric Dumazet static void fq_codel_reset(struct Qdisc *sch) 3484b549a2eSEric Dumazet { 3493d0e0af4SEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 3503d0e0af4SEric Dumazet int i; 3514b549a2eSEric Dumazet 3523d0e0af4SEric Dumazet INIT_LIST_HEAD(&q->new_flows); 3533d0e0af4SEric Dumazet INIT_LIST_HEAD(&q->old_flows); 3543d0e0af4SEric Dumazet for (i = 0; i < q->flows_cnt; i++) { 3553d0e0af4SEric Dumazet struct fq_codel_flow *flow = q->flows + i; 3563d0e0af4SEric Dumazet 357ece5d4c7SEric Dumazet fq_codel_flow_purge(flow); 3583d0e0af4SEric Dumazet INIT_LIST_HEAD(&flow->flowchain); 3593d0e0af4SEric Dumazet codel_vars_init(&flow->cvars); 3603d0e0af4SEric Dumazet } 3613d0e0af4SEric Dumazet memset(q->backlogs, 0, q->flows_cnt * sizeof(u32)); 3623d0e0af4SEric Dumazet sch->q.qlen = 0; 363ece5d4c7SEric Dumazet sch->qstats.backlog = 0; 36477f57761SEric Dumazet q->memory_usage = 0; 3653d0e0af4SEric Dumazet } 3663d0e0af4SEric Dumazet 3674b549a2eSEric Dumazet static const struct nla_policy fq_codel_policy[TCA_FQ_CODEL_MAX + 1] = { 3684b549a2eSEric Dumazet [TCA_FQ_CODEL_TARGET] = { .type = NLA_U32 }, 3694b549a2eSEric Dumazet [TCA_FQ_CODEL_LIMIT] = { .type = NLA_U32 }, 3704b549a2eSEric Dumazet [TCA_FQ_CODEL_INTERVAL] = { .type = NLA_U32 }, 3714b549a2eSEric Dumazet [TCA_FQ_CODEL_ECN] = { .type = NLA_U32 }, 3724b549a2eSEric Dumazet [TCA_FQ_CODEL_FLOWS] = { .type = NLA_U32 }, 3734b549a2eSEric Dumazet [TCA_FQ_CODEL_QUANTUM] = { .type = NLA_U32 }, 37480ba92faSEric Dumazet [TCA_FQ_CODEL_CE_THRESHOLD] = { .type = NLA_U32 }, 3759d18562aSEric Dumazet [TCA_FQ_CODEL_DROP_BATCH_SIZE] = { .type = NLA_U32 }, 37695b58430SEric Dumazet [TCA_FQ_CODEL_MEMORY_LIMIT] = { .type = NLA_U32 }, 3774b549a2eSEric Dumazet }; 3784b549a2eSEric Dumazet 3794b549a2eSEric Dumazet static int fq_codel_change(struct Qdisc *sch, struct nlattr *opt) 3804b549a2eSEric Dumazet { 3814b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 3824b549a2eSEric Dumazet struct nlattr *tb[TCA_FQ_CODEL_MAX + 1]; 3834b549a2eSEric Dumazet int err; 3844b549a2eSEric Dumazet 3854b549a2eSEric Dumazet if (!opt) 3864b549a2eSEric Dumazet return -EINVAL; 3874b549a2eSEric Dumazet 388fceb6435SJohannes Berg err = nla_parse_nested(tb, TCA_FQ_CODEL_MAX, opt, fq_codel_policy, 389fceb6435SJohannes Berg NULL); 3904b549a2eSEric Dumazet if (err < 0) 3914b549a2eSEric Dumazet return err; 3924b549a2eSEric Dumazet if (tb[TCA_FQ_CODEL_FLOWS]) { 3934b549a2eSEric Dumazet if (q->flows) 3944b549a2eSEric Dumazet return -EINVAL; 3954b549a2eSEric Dumazet q->flows_cnt = nla_get_u32(tb[TCA_FQ_CODEL_FLOWS]); 3964b549a2eSEric Dumazet if (!q->flows_cnt || 3974b549a2eSEric Dumazet q->flows_cnt > 65536) 3984b549a2eSEric Dumazet return -EINVAL; 3994b549a2eSEric Dumazet } 4004b549a2eSEric Dumazet sch_tree_lock(sch); 4014b549a2eSEric Dumazet 4024b549a2eSEric Dumazet if (tb[TCA_FQ_CODEL_TARGET]) { 4034b549a2eSEric Dumazet u64 target = nla_get_u32(tb[TCA_FQ_CODEL_TARGET]); 4044b549a2eSEric Dumazet 4054b549a2eSEric Dumazet q->cparams.target = (target * NSEC_PER_USEC) >> CODEL_SHIFT; 4064b549a2eSEric Dumazet } 4074b549a2eSEric Dumazet 40880ba92faSEric Dumazet if (tb[TCA_FQ_CODEL_CE_THRESHOLD]) { 40980ba92faSEric Dumazet u64 val = nla_get_u32(tb[TCA_FQ_CODEL_CE_THRESHOLD]); 41080ba92faSEric Dumazet 41180ba92faSEric Dumazet q->cparams.ce_threshold = (val * NSEC_PER_USEC) >> CODEL_SHIFT; 41280ba92faSEric Dumazet } 41380ba92faSEric Dumazet 4144b549a2eSEric Dumazet if (tb[TCA_FQ_CODEL_INTERVAL]) { 4154b549a2eSEric Dumazet u64 interval = nla_get_u32(tb[TCA_FQ_CODEL_INTERVAL]); 4164b549a2eSEric Dumazet 4174b549a2eSEric Dumazet q->cparams.interval = (interval * NSEC_PER_USEC) >> CODEL_SHIFT; 4184b549a2eSEric Dumazet } 4194b549a2eSEric Dumazet 4204b549a2eSEric Dumazet if (tb[TCA_FQ_CODEL_LIMIT]) 4214b549a2eSEric Dumazet sch->limit = nla_get_u32(tb[TCA_FQ_CODEL_LIMIT]); 4224b549a2eSEric Dumazet 4234b549a2eSEric Dumazet if (tb[TCA_FQ_CODEL_ECN]) 4244b549a2eSEric Dumazet q->cparams.ecn = !!nla_get_u32(tb[TCA_FQ_CODEL_ECN]); 4254b549a2eSEric Dumazet 4264b549a2eSEric Dumazet if (tb[TCA_FQ_CODEL_QUANTUM]) 4274b549a2eSEric Dumazet q->quantum = max(256U, nla_get_u32(tb[TCA_FQ_CODEL_QUANTUM])); 4284b549a2eSEric Dumazet 4299d18562aSEric Dumazet if (tb[TCA_FQ_CODEL_DROP_BATCH_SIZE]) 4309d18562aSEric Dumazet q->drop_batch_size = min(1U, nla_get_u32(tb[TCA_FQ_CODEL_DROP_BATCH_SIZE])); 4319d18562aSEric Dumazet 43295b58430SEric Dumazet if (tb[TCA_FQ_CODEL_MEMORY_LIMIT]) 43395b58430SEric Dumazet q->memory_limit = min(1U << 31, nla_get_u32(tb[TCA_FQ_CODEL_MEMORY_LIMIT])); 43495b58430SEric Dumazet 43595b58430SEric Dumazet while (sch->q.qlen > sch->limit || 43695b58430SEric Dumazet q->memory_usage > q->memory_limit) { 4374b549a2eSEric Dumazet struct sk_buff *skb = fq_codel_dequeue(sch); 4384b549a2eSEric Dumazet 4392ccccf5fSWANG Cong q->cstats.drop_len += qdisc_pkt_len(skb); 440ece5d4c7SEric Dumazet rtnl_kfree_skbs(skb, skb); 4414b549a2eSEric Dumazet q->cstats.drop_count++; 4424b549a2eSEric Dumazet } 4432ccccf5fSWANG Cong qdisc_tree_reduce_backlog(sch, q->cstats.drop_count, q->cstats.drop_len); 4444b549a2eSEric Dumazet q->cstats.drop_count = 0; 4452ccccf5fSWANG Cong q->cstats.drop_len = 0; 4464b549a2eSEric Dumazet 4474b549a2eSEric Dumazet sch_tree_unlock(sch); 4484b549a2eSEric Dumazet return 0; 4494b549a2eSEric Dumazet } 4504b549a2eSEric Dumazet 4514b549a2eSEric Dumazet static void fq_codel_destroy(struct Qdisc *sch) 4524b549a2eSEric Dumazet { 4534b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 4544b549a2eSEric Dumazet 4556529eabaSJiri Pirko tcf_block_put(q->block); 456752ade68SMichal Hocko kvfree(q->backlogs); 457752ade68SMichal Hocko kvfree(q->flows); 4584b549a2eSEric Dumazet } 4594b549a2eSEric Dumazet 4604b549a2eSEric Dumazet static int fq_codel_init(struct Qdisc *sch, struct nlattr *opt) 4614b549a2eSEric Dumazet { 4624b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 4634b549a2eSEric Dumazet int i; 4646529eabaSJiri Pirko int err; 4654b549a2eSEric Dumazet 4664b549a2eSEric Dumazet sch->limit = 10*1024; 4674b549a2eSEric Dumazet q->flows_cnt = 1024; 46895b58430SEric Dumazet q->memory_limit = 32 << 20; /* 32 MBytes */ 4699d18562aSEric Dumazet q->drop_batch_size = 64; 4704b549a2eSEric Dumazet q->quantum = psched_mtu(qdisc_dev(sch)); 4714b549a2eSEric Dumazet INIT_LIST_HEAD(&q->new_flows); 4724b549a2eSEric Dumazet INIT_LIST_HEAD(&q->old_flows); 47379bdc4c8SMichal Kazior codel_params_init(&q->cparams); 4744b549a2eSEric Dumazet codel_stats_init(&q->cstats); 4754b549a2eSEric Dumazet q->cparams.ecn = true; 47679bdc4c8SMichal Kazior q->cparams.mtu = psched_mtu(qdisc_dev(sch)); 4774b549a2eSEric Dumazet 4784b549a2eSEric Dumazet if (opt) { 4794b549a2eSEric Dumazet int err = fq_codel_change(sch, opt); 4804b549a2eSEric Dumazet if (err) 4814b549a2eSEric Dumazet return err; 4824b549a2eSEric Dumazet } 4834b549a2eSEric Dumazet 48469d78ef2SJiri Pirko err = tcf_block_get(&q->block, &q->filter_list, sch); 4856529eabaSJiri Pirko if (err) 4866529eabaSJiri Pirko return err; 4876529eabaSJiri Pirko 4884b549a2eSEric Dumazet if (!q->flows) { 489752ade68SMichal Hocko q->flows = kvzalloc(q->flows_cnt * 490752ade68SMichal Hocko sizeof(struct fq_codel_flow), GFP_KERNEL); 4914b549a2eSEric Dumazet if (!q->flows) 4924b549a2eSEric Dumazet return -ENOMEM; 493752ade68SMichal Hocko q->backlogs = kvzalloc(q->flows_cnt * sizeof(u32), GFP_KERNEL); 49430c31d74SNikolay Aleksandrov if (!q->backlogs) 4954b549a2eSEric Dumazet return -ENOMEM; 4964b549a2eSEric Dumazet for (i = 0; i < q->flows_cnt; i++) { 4974b549a2eSEric Dumazet struct fq_codel_flow *flow = q->flows + i; 4984b549a2eSEric Dumazet 4994b549a2eSEric Dumazet INIT_LIST_HEAD(&flow->flowchain); 500b379135cSEric Dumazet codel_vars_init(&flow->cvars); 5014b549a2eSEric Dumazet } 5024b549a2eSEric Dumazet } 5034b549a2eSEric Dumazet if (sch->limit >= 1) 5044b549a2eSEric Dumazet sch->flags |= TCQ_F_CAN_BYPASS; 5054b549a2eSEric Dumazet else 5064b549a2eSEric Dumazet sch->flags &= ~TCQ_F_CAN_BYPASS; 5074b549a2eSEric Dumazet return 0; 5084b549a2eSEric Dumazet } 5094b549a2eSEric Dumazet 5104b549a2eSEric Dumazet static int fq_codel_dump(struct Qdisc *sch, struct sk_buff *skb) 5114b549a2eSEric Dumazet { 5124b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 5134b549a2eSEric Dumazet struct nlattr *opts; 5144b549a2eSEric Dumazet 5154b549a2eSEric Dumazet opts = nla_nest_start(skb, TCA_OPTIONS); 5164b549a2eSEric Dumazet if (opts == NULL) 5174b549a2eSEric Dumazet goto nla_put_failure; 5184b549a2eSEric Dumazet 5194b549a2eSEric Dumazet if (nla_put_u32(skb, TCA_FQ_CODEL_TARGET, 5204b549a2eSEric Dumazet codel_time_to_us(q->cparams.target)) || 5214b549a2eSEric Dumazet nla_put_u32(skb, TCA_FQ_CODEL_LIMIT, 5224b549a2eSEric Dumazet sch->limit) || 5234b549a2eSEric Dumazet nla_put_u32(skb, TCA_FQ_CODEL_INTERVAL, 5244b549a2eSEric Dumazet codel_time_to_us(q->cparams.interval)) || 5254b549a2eSEric Dumazet nla_put_u32(skb, TCA_FQ_CODEL_ECN, 5264b549a2eSEric Dumazet q->cparams.ecn) || 5274b549a2eSEric Dumazet nla_put_u32(skb, TCA_FQ_CODEL_QUANTUM, 5284b549a2eSEric Dumazet q->quantum) || 5299d18562aSEric Dumazet nla_put_u32(skb, TCA_FQ_CODEL_DROP_BATCH_SIZE, 5309d18562aSEric Dumazet q->drop_batch_size) || 53195b58430SEric Dumazet nla_put_u32(skb, TCA_FQ_CODEL_MEMORY_LIMIT, 53295b58430SEric Dumazet q->memory_limit) || 5334b549a2eSEric Dumazet nla_put_u32(skb, TCA_FQ_CODEL_FLOWS, 5344b549a2eSEric Dumazet q->flows_cnt)) 5354b549a2eSEric Dumazet goto nla_put_failure; 5364b549a2eSEric Dumazet 53780ba92faSEric Dumazet if (q->cparams.ce_threshold != CODEL_DISABLED_THRESHOLD && 53880ba92faSEric Dumazet nla_put_u32(skb, TCA_FQ_CODEL_CE_THRESHOLD, 53980ba92faSEric Dumazet codel_time_to_us(q->cparams.ce_threshold))) 54080ba92faSEric Dumazet goto nla_put_failure; 54180ba92faSEric Dumazet 542d59b7d80SYang Yingliang return nla_nest_end(skb, opts); 5434b549a2eSEric Dumazet 5444b549a2eSEric Dumazet nla_put_failure: 5454b549a2eSEric Dumazet return -1; 5464b549a2eSEric Dumazet } 5474b549a2eSEric Dumazet 5484b549a2eSEric Dumazet static int fq_codel_dump_stats(struct Qdisc *sch, struct gnet_dump *d) 5494b549a2eSEric Dumazet { 5504b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 5514b549a2eSEric Dumazet struct tc_fq_codel_xstats st = { 5524b549a2eSEric Dumazet .type = TCA_FQ_CODEL_XSTATS_QDISC, 5534b549a2eSEric Dumazet }; 5544b549a2eSEric Dumazet struct list_head *pos; 5554b549a2eSEric Dumazet 556669d67bfSSasha Levin st.qdisc_stats.maxpacket = q->cstats.maxpacket; 557669d67bfSSasha Levin st.qdisc_stats.drop_overlimit = q->drop_overlimit; 558669d67bfSSasha Levin st.qdisc_stats.ecn_mark = q->cstats.ecn_mark; 559669d67bfSSasha Levin st.qdisc_stats.new_flow_count = q->new_flow_count; 56080ba92faSEric Dumazet st.qdisc_stats.ce_mark = q->cstats.ce_mark; 56195b58430SEric Dumazet st.qdisc_stats.memory_usage = q->memory_usage; 56295b58430SEric Dumazet st.qdisc_stats.drop_overmemory = q->drop_overmemory; 563669d67bfSSasha Levin 564edb09eb1SEric Dumazet sch_tree_lock(sch); 5654b549a2eSEric Dumazet list_for_each(pos, &q->new_flows) 5664b549a2eSEric Dumazet st.qdisc_stats.new_flows_len++; 5674b549a2eSEric Dumazet 5684b549a2eSEric Dumazet list_for_each(pos, &q->old_flows) 5694b549a2eSEric Dumazet st.qdisc_stats.old_flows_len++; 570edb09eb1SEric Dumazet sch_tree_unlock(sch); 5714b549a2eSEric Dumazet 5724b549a2eSEric Dumazet return gnet_stats_copy_app(d, &st, sizeof(st)); 5734b549a2eSEric Dumazet } 5744b549a2eSEric Dumazet 5754b549a2eSEric Dumazet static struct Qdisc *fq_codel_leaf(struct Qdisc *sch, unsigned long arg) 5764b549a2eSEric Dumazet { 5774b549a2eSEric Dumazet return NULL; 5784b549a2eSEric Dumazet } 5794b549a2eSEric Dumazet 580143976ceSWANG Cong static unsigned long fq_codel_find(struct Qdisc *sch, u32 classid) 5814b549a2eSEric Dumazet { 5824b549a2eSEric Dumazet return 0; 5834b549a2eSEric Dumazet } 5844b549a2eSEric Dumazet 5854b549a2eSEric Dumazet static unsigned long fq_codel_bind(struct Qdisc *sch, unsigned long parent, 5864b549a2eSEric Dumazet u32 classid) 5874b549a2eSEric Dumazet { 5884b549a2eSEric Dumazet /* we cannot bypass queue discipline anymore */ 5894b549a2eSEric Dumazet sch->flags &= ~TCQ_F_CAN_BYPASS; 5904b549a2eSEric Dumazet return 0; 5914b549a2eSEric Dumazet } 5924b549a2eSEric Dumazet 593143976ceSWANG Cong static void fq_codel_unbind(struct Qdisc *q, unsigned long cl) 5944b549a2eSEric Dumazet { 5954b549a2eSEric Dumazet } 5964b549a2eSEric Dumazet 5976529eabaSJiri Pirko static struct tcf_block *fq_codel_tcf_block(struct Qdisc *sch, unsigned long cl) 5984b549a2eSEric Dumazet { 5994b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 6004b549a2eSEric Dumazet 6014b549a2eSEric Dumazet if (cl) 6024b549a2eSEric Dumazet return NULL; 6036529eabaSJiri Pirko return q->block; 6044b549a2eSEric Dumazet } 6054b549a2eSEric Dumazet 6064b549a2eSEric Dumazet static int fq_codel_dump_class(struct Qdisc *sch, unsigned long cl, 6074b549a2eSEric Dumazet struct sk_buff *skb, struct tcmsg *tcm) 6084b549a2eSEric Dumazet { 6094b549a2eSEric Dumazet tcm->tcm_handle |= TC_H_MIN(cl); 6104b549a2eSEric Dumazet return 0; 6114b549a2eSEric Dumazet } 6124b549a2eSEric Dumazet 6134b549a2eSEric Dumazet static int fq_codel_dump_class_stats(struct Qdisc *sch, unsigned long cl, 6144b549a2eSEric Dumazet struct gnet_dump *d) 6154b549a2eSEric Dumazet { 6164b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 6174b549a2eSEric Dumazet u32 idx = cl - 1; 6184b549a2eSEric Dumazet struct gnet_stats_queue qs = { 0 }; 6194b549a2eSEric Dumazet struct tc_fq_codel_xstats xstats; 6204b549a2eSEric Dumazet 6214b549a2eSEric Dumazet if (idx < q->flows_cnt) { 6224b549a2eSEric Dumazet const struct fq_codel_flow *flow = &q->flows[idx]; 623edb09eb1SEric Dumazet const struct sk_buff *skb; 6244b549a2eSEric Dumazet 6254b549a2eSEric Dumazet memset(&xstats, 0, sizeof(xstats)); 6264b549a2eSEric Dumazet xstats.type = TCA_FQ_CODEL_XSTATS_CLASS; 6274b549a2eSEric Dumazet xstats.class_stats.deficit = flow->deficit; 6284b549a2eSEric Dumazet xstats.class_stats.ldelay = 6294b549a2eSEric Dumazet codel_time_to_us(flow->cvars.ldelay); 6304b549a2eSEric Dumazet xstats.class_stats.count = flow->cvars.count; 6314b549a2eSEric Dumazet xstats.class_stats.lastcount = flow->cvars.lastcount; 6324b549a2eSEric Dumazet xstats.class_stats.dropping = flow->cvars.dropping; 6334b549a2eSEric Dumazet if (flow->cvars.dropping) { 6344b549a2eSEric Dumazet codel_tdiff_t delta = flow->cvars.drop_next - 6354b549a2eSEric Dumazet codel_get_time(); 6364b549a2eSEric Dumazet 6374b549a2eSEric Dumazet xstats.class_stats.drop_next = (delta >= 0) ? 6384b549a2eSEric Dumazet codel_time_to_us(delta) : 6394b549a2eSEric Dumazet -codel_time_to_us(-delta); 6404b549a2eSEric Dumazet } 641edb09eb1SEric Dumazet if (flow->head) { 642edb09eb1SEric Dumazet sch_tree_lock(sch); 643edb09eb1SEric Dumazet skb = flow->head; 6444b549a2eSEric Dumazet while (skb) { 6454b549a2eSEric Dumazet qs.qlen++; 6464b549a2eSEric Dumazet skb = skb->next; 6474b549a2eSEric Dumazet } 648edb09eb1SEric Dumazet sch_tree_unlock(sch); 649edb09eb1SEric Dumazet } 6504b549a2eSEric Dumazet qs.backlog = q->backlogs[idx]; 6514b549a2eSEric Dumazet qs.drops = flow->dropped; 6524b549a2eSEric Dumazet } 653aafddbf0SEric Dumazet if (gnet_stats_copy_queue(d, NULL, &qs, qs.qlen) < 0) 6544b549a2eSEric Dumazet return -1; 6554b549a2eSEric Dumazet if (idx < q->flows_cnt) 6564b549a2eSEric Dumazet return gnet_stats_copy_app(d, &xstats, sizeof(xstats)); 6574b549a2eSEric Dumazet return 0; 6584b549a2eSEric Dumazet } 6594b549a2eSEric Dumazet 6604b549a2eSEric Dumazet static void fq_codel_walk(struct Qdisc *sch, struct qdisc_walker *arg) 6614b549a2eSEric Dumazet { 6624b549a2eSEric Dumazet struct fq_codel_sched_data *q = qdisc_priv(sch); 6634b549a2eSEric Dumazet unsigned int i; 6644b549a2eSEric Dumazet 6654b549a2eSEric Dumazet if (arg->stop) 6664b549a2eSEric Dumazet return; 6674b549a2eSEric Dumazet 6684b549a2eSEric Dumazet for (i = 0; i < q->flows_cnt; i++) { 6694b549a2eSEric Dumazet if (list_empty(&q->flows[i].flowchain) || 6704b549a2eSEric Dumazet arg->count < arg->skip) { 6714b549a2eSEric Dumazet arg->count++; 6724b549a2eSEric Dumazet continue; 6734b549a2eSEric Dumazet } 6744b549a2eSEric Dumazet if (arg->fn(sch, i + 1, arg) < 0) { 6754b549a2eSEric Dumazet arg->stop = 1; 6764b549a2eSEric Dumazet break; 6774b549a2eSEric Dumazet } 6784b549a2eSEric Dumazet arg->count++; 6794b549a2eSEric Dumazet } 6804b549a2eSEric Dumazet } 6814b549a2eSEric Dumazet 6824b549a2eSEric Dumazet static const struct Qdisc_class_ops fq_codel_class_ops = { 6834b549a2eSEric Dumazet .leaf = fq_codel_leaf, 684143976ceSWANG Cong .find = fq_codel_find, 6856529eabaSJiri Pirko .tcf_block = fq_codel_tcf_block, 6864b549a2eSEric Dumazet .bind_tcf = fq_codel_bind, 687143976ceSWANG Cong .unbind_tcf = fq_codel_unbind, 6884b549a2eSEric Dumazet .dump = fq_codel_dump_class, 6894b549a2eSEric Dumazet .dump_stats = fq_codel_dump_class_stats, 6904b549a2eSEric Dumazet .walk = fq_codel_walk, 6914b549a2eSEric Dumazet }; 6924b549a2eSEric Dumazet 6934b549a2eSEric Dumazet static struct Qdisc_ops fq_codel_qdisc_ops __read_mostly = { 6944b549a2eSEric Dumazet .cl_ops = &fq_codel_class_ops, 6954b549a2eSEric Dumazet .id = "fq_codel", 6964b549a2eSEric Dumazet .priv_size = sizeof(struct fq_codel_sched_data), 6974b549a2eSEric Dumazet .enqueue = fq_codel_enqueue, 6984b549a2eSEric Dumazet .dequeue = fq_codel_dequeue, 6994b549a2eSEric Dumazet .peek = qdisc_peek_dequeued, 7004b549a2eSEric Dumazet .init = fq_codel_init, 7014b549a2eSEric Dumazet .reset = fq_codel_reset, 7024b549a2eSEric Dumazet .destroy = fq_codel_destroy, 7034b549a2eSEric Dumazet .change = fq_codel_change, 7044b549a2eSEric Dumazet .dump = fq_codel_dump, 7054b549a2eSEric Dumazet .dump_stats = fq_codel_dump_stats, 7064b549a2eSEric Dumazet .owner = THIS_MODULE, 7074b549a2eSEric Dumazet }; 7084b549a2eSEric Dumazet 7094b549a2eSEric Dumazet static int __init fq_codel_module_init(void) 7104b549a2eSEric Dumazet { 7114b549a2eSEric Dumazet return register_qdisc(&fq_codel_qdisc_ops); 7124b549a2eSEric Dumazet } 7134b549a2eSEric Dumazet 7144b549a2eSEric Dumazet static void __exit fq_codel_module_exit(void) 7154b549a2eSEric Dumazet { 7164b549a2eSEric Dumazet unregister_qdisc(&fq_codel_qdisc_ops); 7174b549a2eSEric Dumazet } 7184b549a2eSEric Dumazet 7194b549a2eSEric Dumazet module_init(fq_codel_module_init) 7204b549a2eSEric Dumazet module_exit(fq_codel_module_exit) 7214b549a2eSEric Dumazet MODULE_AUTHOR("Eric Dumazet"); 7224b549a2eSEric Dumazet MODULE_LICENSE("GPL"); 723