Loading...
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * net/sched/sch_fq.c Fair Queue Packet Scheduler (per flow pacing)
4 *
5 * Copyright (C) 2013-2023 Eric Dumazet <edumazet@google.com>
6 *
7 * Meant to be mostly used for locally generated traffic :
8 * Fast classification depends on skb->sk being set before reaching us.
9 * If not, (router workload), we use rxhash as fallback, with 32 bits wide hash.
10 * All packets belonging to a socket are considered as a 'flow'.
11 *
12 * Flows are dynamically allocated and stored in a hash table of RB trees
13 * They are also part of one Round Robin 'queues' (new or old flows)
14 *
15 * Burst avoidance (aka pacing) capability :
16 *
17 * Transport (eg TCP) can set in sk->sk_pacing_rate a rate, enqueue a
18 * bunch of packets, and this packet scheduler adds delay between
19 * packets to respect rate limitation.
20 *
21 * enqueue() :
22 * - lookup one RB tree (out of 1024 or more) to find the flow.
23 * If non existent flow, create it, add it to the tree.
24 * Add skb to the per flow list of skb (fifo).
25 * - Use a special fifo for high prio packets
26 *
27 * dequeue() : serves flows in Round Robin
28 * Note : When a flow becomes empty, we do not immediately remove it from
29 * rb trees, for performance reasons (its expected to send additional packets,
30 * or SLAB cache will reuse socket for another flow)
31 */
32
33#include <linux/module.h>
34#include <linux/types.h>
35#include <linux/kernel.h>
36#include <linux/jiffies.h>
37#include <linux/string.h>
38#include <linux/in.h>
39#include <linux/errno.h>
40#include <linux/init.h>
41#include <linux/skbuff.h>
42#include <linux/slab.h>
43#include <linux/rbtree.h>
44#include <linux/hash.h>
45#include <linux/prefetch.h>
46#include <linux/vmalloc.h>
47#include <net/netlink.h>
48#include <net/pkt_sched.h>
49#include <net/sock.h>
50#include <net/tcp_states.h>
51#include <net/tcp.h>
52
53struct fq_skb_cb {
54 u64 time_to_send;
55 u8 band;
56};
57
58static inline struct fq_skb_cb *fq_skb_cb(struct sk_buff *skb)
59{
60 qdisc_cb_private_validate(skb, sizeof(struct fq_skb_cb));
61 return (struct fq_skb_cb *)qdisc_skb_cb(skb)->data;
62}
63
64/*
65 * Per flow structure, dynamically allocated.
66 * If packets have monotically increasing time_to_send, they are placed in O(1)
67 * in linear list (head,tail), otherwise are placed in a rbtree (t_root).
68 */
69struct fq_flow {
70/* First cache line : used in fq_gc(), fq_enqueue(), fq_dequeue() */
71 struct rb_root t_root;
72 struct sk_buff *head; /* list of skbs for this flow : first skb */
73 union {
74 struct sk_buff *tail; /* last skb in the list */
75 unsigned long age; /* (jiffies | 1UL) when flow was emptied, for gc */
76 };
77 union {
78 struct rb_node fq_node; /* anchor in fq_root[] trees */
79 /* Following field is only used for q->internal,
80 * because q->internal is not hashed in fq_root[]
81 */
82 u64 stat_fastpath_packets;
83 };
84 struct sock *sk;
85 u32 socket_hash; /* sk_hash */
86 int qlen; /* number of packets in flow queue */
87
88/* Second cache line */
89 int credit;
90 int band;
91 struct fq_flow *next; /* next pointer in RR lists */
92
93 struct rb_node rate_node; /* anchor in q->delayed tree */
94 u64 time_next_packet;
95};
96
97struct fq_flow_head {
98 struct fq_flow *first;
99 struct fq_flow *last;
100};
101
102struct fq_perband_flows {
103 struct fq_flow_head new_flows;
104 struct fq_flow_head old_flows;
105 int credit;
106 int quantum; /* based on band nr : 576KB, 192KB, 64KB */
107};
108
109#define FQ_PRIO2BAND_CRUMB_SIZE ((TC_PRIO_MAX + 1) >> 2)
110
111struct fq_sched_data {
112/* Read mostly cache line */
113
114 u64 offload_horizon;
115 u32 quantum;
116 u32 initial_quantum;
117 u32 flow_refill_delay;
118 u32 flow_plimit; /* max packets per flow */
119 unsigned long flow_max_rate; /* optional max rate per flow */
120 u64 ce_threshold;
121 u64 horizon; /* horizon in ns */
122 u32 orphan_mask; /* mask for orphaned skb */
123 u32 low_rate_threshold;
124 struct rb_root *fq_root;
125 u8 rate_enable;
126 u8 fq_trees_log;
127 u8 horizon_drop;
128 u8 prio2band[FQ_PRIO2BAND_CRUMB_SIZE];
129 u32 timer_slack; /* hrtimer slack in ns */
130
131/* Read/Write fields. */
132
133 unsigned int band_nr; /* band being serviced in fq_dequeue() */
134
135 struct fq_perband_flows band_flows[FQ_BANDS];
136
137 struct fq_flow internal; /* fastpath queue. */
138 struct rb_root delayed; /* for rate limited flows */
139 u64 time_next_delayed_flow;
140 unsigned long unthrottle_latency_ns;
141
142 u32 band_pkt_count[FQ_BANDS];
143 u32 flows;
144 u32 inactive_flows; /* Flows with no packet to send. */
145 u32 throttled_flows;
146
147 u64 stat_throttled;
148 struct qdisc_watchdog watchdog;
149 u64 stat_gc_flows;
150
151/* Seldom used fields. */
152
153 u64 stat_band_drops[FQ_BANDS];
154 u64 stat_ce_mark;
155 u64 stat_horizon_drops;
156 u64 stat_horizon_caps;
157 u64 stat_flows_plimit;
158 u64 stat_pkts_too_long;
159 u64 stat_allocation_errors;
160};
161
162/* return the i-th 2-bit value ("crumb") */
163static u8 fq_prio2band(const u8 *prio2band, unsigned int prio)
164{
165 return (READ_ONCE(prio2band[prio / 4]) >> (2 * (prio & 0x3))) & 0x3;
166}
167
168/*
169 * f->tail and f->age share the same location.
170 * We can use the low order bit to differentiate if this location points
171 * to a sk_buff or contains a jiffies value, if we force this value to be odd.
172 * This assumes f->tail low order bit must be 0 since alignof(struct sk_buff) >= 2
173 */
174static void fq_flow_set_detached(struct fq_flow *f)
175{
176 f->age = jiffies | 1UL;
177}
178
179static bool fq_flow_is_detached(const struct fq_flow *f)
180{
181 return !!(f->age & 1UL);
182}
183
184/* special value to mark a throttled flow (not on old/new list) */
185static struct fq_flow throttled;
186
187static bool fq_flow_is_throttled(const struct fq_flow *f)
188{
189 return f->next == &throttled;
190}
191
192enum new_flow {
193 NEW_FLOW,
194 OLD_FLOW
195};
196
197static void fq_flow_add_tail(struct fq_sched_data *q, struct fq_flow *flow,
198 enum new_flow list_sel)
199{
200 struct fq_perband_flows *pband = &q->band_flows[flow->band];
201 struct fq_flow_head *head = (list_sel == NEW_FLOW) ?
202 &pband->new_flows :
203 &pband->old_flows;
204
205 if (head->first)
206 head->last->next = flow;
207 else
208 head->first = flow;
209 head->last = flow;
210 flow->next = NULL;
211}
212
213static void fq_flow_unset_throttled(struct fq_sched_data *q, struct fq_flow *f)
214{
215 rb_erase(&f->rate_node, &q->delayed);
216 q->throttled_flows--;
217 fq_flow_add_tail(q, f, OLD_FLOW);
218}
219
220static void fq_flow_set_throttled(struct fq_sched_data *q, struct fq_flow *f)
221{
222 struct rb_node **p = &q->delayed.rb_node, *parent = NULL;
223
224 while (*p) {
225 struct fq_flow *aux;
226
227 parent = *p;
228 aux = rb_entry(parent, struct fq_flow, rate_node);
229 if (f->time_next_packet >= aux->time_next_packet)
230 p = &parent->rb_right;
231 else
232 p = &parent->rb_left;
233 }
234 rb_link_node(&f->rate_node, parent, p);
235 rb_insert_color(&f->rate_node, &q->delayed);
236 q->throttled_flows++;
237 q->stat_throttled++;
238
239 f->next = &throttled;
240 if (q->time_next_delayed_flow > f->time_next_packet)
241 q->time_next_delayed_flow = f->time_next_packet;
242}
243
244
245static struct kmem_cache *fq_flow_cachep __read_mostly;
246
247
248/* limit number of collected flows per round */
249#define FQ_GC_MAX 8
250#define FQ_GC_AGE (3*HZ)
251
252static bool fq_gc_candidate(const struct fq_flow *f)
253{
254 return fq_flow_is_detached(f) &&
255 time_after(jiffies, f->age + FQ_GC_AGE);
256}
257
258static void fq_gc(struct fq_sched_data *q,
259 struct rb_root *root,
260 struct sock *sk)
261{
262 struct rb_node **p, *parent;
263 void *tofree[FQ_GC_MAX];
264 struct fq_flow *f;
265 int i, fcnt = 0;
266
267 p = &root->rb_node;
268 parent = NULL;
269 while (*p) {
270 parent = *p;
271
272 f = rb_entry(parent, struct fq_flow, fq_node);
273 if (f->sk == sk)
274 break;
275
276 if (fq_gc_candidate(f)) {
277 tofree[fcnt++] = f;
278 if (fcnt == FQ_GC_MAX)
279 break;
280 }
281
282 if (f->sk > sk)
283 p = &parent->rb_right;
284 else
285 p = &parent->rb_left;
286 }
287
288 if (!fcnt)
289 return;
290
291 for (i = fcnt; i > 0; ) {
292 f = tofree[--i];
293 rb_erase(&f->fq_node, root);
294 }
295 q->flows -= fcnt;
296 q->inactive_flows -= fcnt;
297 q->stat_gc_flows += fcnt;
298
299 kmem_cache_free_bulk(fq_flow_cachep, fcnt, tofree);
300}
301
302/* Fast path can be used if :
303 * 1) Packet tstamp is in the past, or within the pacing offload horizon.
304 * 2) FQ qlen == 0 OR
305 * (no flow is currently eligible for transmit,
306 * AND fast path queue has less than 8 packets)
307 * 3) No SO_MAX_PACING_RATE on the socket (if any).
308 * 4) No @maxrate attribute on this qdisc,
309 *
310 * FQ can not use generic TCQ_F_CAN_BYPASS infrastructure.
311 */
312static bool fq_fastpath_check(const struct Qdisc *sch, struct sk_buff *skb,
313 u64 now)
314{
315 const struct fq_sched_data *q = qdisc_priv(sch);
316 const struct sock *sk;
317
318 if (fq_skb_cb(skb)->time_to_send > now + q->offload_horizon)
319 return false;
320
321 if (sch->q.qlen != 0) {
322 /* Even if some packets are stored in this qdisc,
323 * we can still enable fast path if all of them are
324 * scheduled in the future (ie no flows are eligible)
325 * or in the fast path queue.
326 */
327 if (q->flows != q->inactive_flows + q->throttled_flows)
328 return false;
329
330 /* Do not allow fast path queue to explode, we want Fair Queue mode
331 * under pressure.
332 */
333 if (q->internal.qlen >= 8)
334 return false;
335
336 /* Ordering invariants fall apart if some delayed flows
337 * are ready but we haven't serviced them, yet.
338 */
339 if (q->time_next_delayed_flow <= now + q->offload_horizon)
340 return false;
341 }
342
343 sk = skb->sk;
344 if (sk && sk_fullsock(sk) && !sk_is_tcp(sk) &&
345 sk->sk_max_pacing_rate != ~0UL)
346 return false;
347
348 if (q->flow_max_rate != ~0UL)
349 return false;
350
351 return true;
352}
353
354static struct fq_flow *fq_classify(struct Qdisc *sch, struct sk_buff *skb,
355 u64 now)
356{
357 struct fq_sched_data *q = qdisc_priv(sch);
358 struct rb_node **p, *parent;
359 struct sock *sk = skb->sk;
360 struct rb_root *root;
361 struct fq_flow *f;
362
363 /* SYNACK messages are attached to a TCP_NEW_SYN_RECV request socket
364 * or a listener (SYNCOOKIE mode)
365 * 1) request sockets are not full blown,
366 * they do not contain sk_pacing_rate
367 * 2) They are not part of a 'flow' yet
368 * 3) We do not want to rate limit them (eg SYNFLOOD attack),
369 * especially if the listener set SO_MAX_PACING_RATE
370 * 4) We pretend they are orphaned
371 * TCP can also associate TIME_WAIT sockets with RST or ACK packets.
372 */
373 if (!sk || sk_listener_or_tw(sk)) {
374 unsigned long hash = skb_get_hash(skb) & q->orphan_mask;
375
376 /* By forcing low order bit to 1, we make sure to not
377 * collide with a local flow (socket pointers are word aligned)
378 */
379 sk = (struct sock *)((hash << 1) | 1UL);
380 skb_orphan(skb);
381 } else if (sk->sk_state == TCP_CLOSE) {
382 unsigned long hash = skb_get_hash(skb) & q->orphan_mask;
383 /*
384 * Sockets in TCP_CLOSE are non connected.
385 * Typical use case is UDP sockets, they can send packets
386 * with sendto() to many different destinations.
387 * We probably could use a generic bit advertising
388 * non connected sockets, instead of sk_state == TCP_CLOSE,
389 * if we care enough.
390 */
391 sk = (struct sock *)((hash << 1) | 1UL);
392 }
393
394 if (fq_fastpath_check(sch, skb, now)) {
395 q->internal.stat_fastpath_packets++;
396 if (skb->sk == sk && q->rate_enable &&
397 READ_ONCE(sk->sk_pacing_status) != SK_PACING_FQ)
398 smp_store_release(&sk->sk_pacing_status,
399 SK_PACING_FQ);
400 return &q->internal;
401 }
402
403 root = &q->fq_root[hash_ptr(sk, q->fq_trees_log)];
404
405 fq_gc(q, root, sk);
406
407 p = &root->rb_node;
408 parent = NULL;
409 while (*p) {
410 parent = *p;
411
412 f = rb_entry(parent, struct fq_flow, fq_node);
413 if (f->sk == sk) {
414 /* socket might have been reallocated, so check
415 * if its sk_hash is the same.
416 * It not, we need to refill credit with
417 * initial quantum
418 */
419 if (unlikely(skb->sk == sk &&
420 f->socket_hash != sk->sk_hash)) {
421 f->credit = q->initial_quantum;
422 f->socket_hash = sk->sk_hash;
423 if (q->rate_enable)
424 smp_store_release(&sk->sk_pacing_status,
425 SK_PACING_FQ);
426 if (fq_flow_is_throttled(f))
427 fq_flow_unset_throttled(q, f);
428 f->time_next_packet = 0ULL;
429 }
430 return f;
431 }
432 if (f->sk > sk)
433 p = &parent->rb_right;
434 else
435 p = &parent->rb_left;
436 }
437
438 f = kmem_cache_zalloc(fq_flow_cachep, GFP_ATOMIC | __GFP_NOWARN);
439 if (unlikely(!f)) {
440 q->stat_allocation_errors++;
441 return &q->internal;
442 }
443 /* f->t_root is already zeroed after kmem_cache_zalloc() */
444
445 fq_flow_set_detached(f);
446 f->sk = sk;
447 if (skb->sk == sk) {
448 f->socket_hash = sk->sk_hash;
449 if (q->rate_enable)
450 smp_store_release(&sk->sk_pacing_status,
451 SK_PACING_FQ);
452 }
453 f->credit = q->initial_quantum;
454
455 rb_link_node(&f->fq_node, parent, p);
456 rb_insert_color(&f->fq_node, root);
457
458 q->flows++;
459 q->inactive_flows++;
460 return f;
461}
462
463static struct sk_buff *fq_peek(struct fq_flow *flow)
464{
465 struct sk_buff *skb = skb_rb_first(&flow->t_root);
466 struct sk_buff *head = flow->head;
467
468 if (!skb)
469 return head;
470
471 if (!head)
472 return skb;
473
474 if (fq_skb_cb(skb)->time_to_send < fq_skb_cb(head)->time_to_send)
475 return skb;
476 return head;
477}
478
479static void fq_erase_head(struct Qdisc *sch, struct fq_flow *flow,
480 struct sk_buff *skb)
481{
482 if (skb == flow->head) {
483 flow->head = skb->next;
484 } else {
485 rb_erase(&skb->rbnode, &flow->t_root);
486 skb->dev = qdisc_dev(sch);
487 }
488}
489
490/* Remove one skb from flow queue.
491 * This skb must be the return value of prior fq_peek().
492 */
493static void fq_dequeue_skb(struct Qdisc *sch, struct fq_flow *flow,
494 struct sk_buff *skb)
495{
496 fq_erase_head(sch, flow, skb);
497 skb_mark_not_on_list(skb);
498 qdisc_qstats_backlog_dec(sch, skb);
499 sch->q.qlen--;
500}
501
502static void flow_queue_add(struct fq_flow *flow, struct sk_buff *skb)
503{
504 struct rb_node **p, *parent;
505 struct sk_buff *head, *aux;
506
507 head = flow->head;
508 if (!head ||
509 fq_skb_cb(skb)->time_to_send >= fq_skb_cb(flow->tail)->time_to_send) {
510 if (!head)
511 flow->head = skb;
512 else
513 flow->tail->next = skb;
514 flow->tail = skb;
515 skb->next = NULL;
516 return;
517 }
518
519 p = &flow->t_root.rb_node;
520 parent = NULL;
521
522 while (*p) {
523 parent = *p;
524 aux = rb_to_skb(parent);
525 if (fq_skb_cb(skb)->time_to_send >= fq_skb_cb(aux)->time_to_send)
526 p = &parent->rb_right;
527 else
528 p = &parent->rb_left;
529 }
530 rb_link_node(&skb->rbnode, parent, p);
531 rb_insert_color(&skb->rbnode, &flow->t_root);
532}
533
534static bool fq_packet_beyond_horizon(const struct sk_buff *skb,
535 const struct fq_sched_data *q, u64 now)
536{
537 return unlikely((s64)skb->tstamp > (s64)(now + q->horizon));
538}
539
540static int fq_enqueue(struct sk_buff *skb, struct Qdisc *sch,
541 struct sk_buff **to_free)
542{
543 struct fq_sched_data *q = qdisc_priv(sch);
544 struct fq_flow *f;
545 u64 now;
546 u8 band;
547
548 band = fq_prio2band(q->prio2band, skb->priority & TC_PRIO_MAX);
549 if (unlikely(q->band_pkt_count[band] >= sch->limit)) {
550 q->stat_band_drops[band]++;
551 return qdisc_drop(skb, sch, to_free);
552 }
553
554 now = ktime_get_ns();
555 if (!skb->tstamp) {
556 fq_skb_cb(skb)->time_to_send = now;
557 } else {
558 /* Check if packet timestamp is too far in the future. */
559 if (fq_packet_beyond_horizon(skb, q, now)) {
560 if (q->horizon_drop) {
561 q->stat_horizon_drops++;
562 return qdisc_drop(skb, sch, to_free);
563 }
564 q->stat_horizon_caps++;
565 skb->tstamp = now + q->horizon;
566 }
567 fq_skb_cb(skb)->time_to_send = skb->tstamp;
568 }
569
570 f = fq_classify(sch, skb, now);
571
572 if (f != &q->internal) {
573 if (unlikely(f->qlen >= q->flow_plimit)) {
574 q->stat_flows_plimit++;
575 return qdisc_drop(skb, sch, to_free);
576 }
577
578 if (fq_flow_is_detached(f)) {
579 fq_flow_add_tail(q, f, NEW_FLOW);
580 if (time_after(jiffies, f->age + q->flow_refill_delay))
581 f->credit = max_t(u32, f->credit, q->quantum);
582 }
583
584 f->band = band;
585 q->band_pkt_count[band]++;
586 fq_skb_cb(skb)->band = band;
587 if (f->qlen == 0)
588 q->inactive_flows--;
589 }
590
591 f->qlen++;
592 /* Note: this overwrites f->age */
593 flow_queue_add(f, skb);
594
595 qdisc_qstats_backlog_inc(sch, skb);
596 sch->q.qlen++;
597
598 return NET_XMIT_SUCCESS;
599}
600
601static void fq_check_throttled(struct fq_sched_data *q, u64 now)
602{
603 unsigned long sample;
604 struct rb_node *p;
605
606 if (q->time_next_delayed_flow > now + q->offload_horizon)
607 return;
608
609 /* Update unthrottle latency EWMA.
610 * This is cheap and can help diagnosing timer/latency problems.
611 */
612 sample = (unsigned long)(now - q->time_next_delayed_flow);
613 if ((long)sample > 0) {
614 q->unthrottle_latency_ns -= q->unthrottle_latency_ns >> 3;
615 q->unthrottle_latency_ns += sample >> 3;
616 }
617 now += q->offload_horizon;
618
619 q->time_next_delayed_flow = ~0ULL;
620 while ((p = rb_first(&q->delayed)) != NULL) {
621 struct fq_flow *f = rb_entry(p, struct fq_flow, rate_node);
622
623 if (f->time_next_packet > now) {
624 q->time_next_delayed_flow = f->time_next_packet;
625 break;
626 }
627 fq_flow_unset_throttled(q, f);
628 }
629}
630
631static struct fq_flow_head *fq_pband_head_select(struct fq_perband_flows *pband)
632{
633 if (pband->credit <= 0)
634 return NULL;
635
636 if (pband->new_flows.first)
637 return &pband->new_flows;
638
639 return pband->old_flows.first ? &pband->old_flows : NULL;
640}
641
642static struct sk_buff *fq_dequeue(struct Qdisc *sch)
643{
644 struct fq_sched_data *q = qdisc_priv(sch);
645 struct fq_perband_flows *pband;
646 struct fq_flow_head *head;
647 struct sk_buff *skb;
648 struct fq_flow *f;
649 unsigned long rate;
650 int retry;
651 u32 plen;
652 u64 now;
653
654 if (!sch->q.qlen)
655 return NULL;
656
657 skb = fq_peek(&q->internal);
658 if (unlikely(skb)) {
659 q->internal.qlen--;
660 fq_dequeue_skb(sch, &q->internal, skb);
661 goto out;
662 }
663
664 now = ktime_get_ns();
665 fq_check_throttled(q, now);
666 retry = 0;
667 pband = &q->band_flows[q->band_nr];
668begin:
669 head = fq_pband_head_select(pband);
670 if (!head) {
671 while (++retry <= FQ_BANDS) {
672 if (++q->band_nr == FQ_BANDS)
673 q->band_nr = 0;
674 pband = &q->band_flows[q->band_nr];
675 pband->credit = min(pband->credit + pband->quantum,
676 pband->quantum);
677 if (pband->credit > 0)
678 goto begin;
679 retry = 0;
680 }
681 if (q->time_next_delayed_flow != ~0ULL)
682 qdisc_watchdog_schedule_range_ns(&q->watchdog,
683 q->time_next_delayed_flow,
684 q->timer_slack);
685 return NULL;
686 }
687 f = head->first;
688 retry = 0;
689 if (f->credit <= 0) {
690 f->credit += q->quantum;
691 head->first = f->next;
692 fq_flow_add_tail(q, f, OLD_FLOW);
693 goto begin;
694 }
695
696 skb = fq_peek(f);
697 if (skb) {
698 u64 time_next_packet = max_t(u64, fq_skb_cb(skb)->time_to_send,
699 f->time_next_packet);
700
701 if (now + q->offload_horizon < time_next_packet) {
702 head->first = f->next;
703 f->time_next_packet = time_next_packet;
704 fq_flow_set_throttled(q, f);
705 goto begin;
706 }
707 prefetch(&skb->end);
708 if ((s64)(now - time_next_packet - q->ce_threshold) > 0) {
709 INET_ECN_set_ce(skb);
710 q->stat_ce_mark++;
711 }
712 if (--f->qlen == 0)
713 q->inactive_flows++;
714 q->band_pkt_count[fq_skb_cb(skb)->band]--;
715 fq_dequeue_skb(sch, f, skb);
716 } else {
717 head->first = f->next;
718 /* force a pass through old_flows to prevent starvation */
719 if (head == &pband->new_flows) {
720 fq_flow_add_tail(q, f, OLD_FLOW);
721 } else {
722 fq_flow_set_detached(f);
723 }
724 goto begin;
725 }
726 plen = qdisc_pkt_len(skb);
727 f->credit -= plen;
728 pband->credit -= plen;
729
730 if (!q->rate_enable)
731 goto out;
732
733 rate = q->flow_max_rate;
734
735 /* If EDT time was provided for this skb, we need to
736 * update f->time_next_packet only if this qdisc enforces
737 * a flow max rate.
738 */
739 if (!skb->tstamp) {
740 if (skb->sk)
741 rate = min(READ_ONCE(skb->sk->sk_pacing_rate), rate);
742
743 if (rate <= q->low_rate_threshold) {
744 f->credit = 0;
745 } else {
746 plen = max(plen, q->quantum);
747 if (f->credit > 0)
748 goto out;
749 }
750 }
751 if (rate != ~0UL) {
752 u64 len = (u64)plen * NSEC_PER_SEC;
753
754 if (likely(rate))
755 len = div64_ul(len, rate);
756 /* Since socket rate can change later,
757 * clamp the delay to 1 second.
758 * Really, providers of too big packets should be fixed !
759 */
760 if (unlikely(len > NSEC_PER_SEC)) {
761 len = NSEC_PER_SEC;
762 q->stat_pkts_too_long++;
763 }
764 /* Account for schedule/timers drifts.
765 * f->time_next_packet was set when prior packet was sent,
766 * and current time (@now) can be too late by tens of us.
767 */
768 if (f->time_next_packet)
769 len -= min(len/2, now - f->time_next_packet);
770 f->time_next_packet = now + len;
771 }
772out:
773 qdisc_bstats_update(sch, skb);
774 return skb;
775}
776
777static void fq_flow_purge(struct fq_flow *flow)
778{
779 struct rb_node *p = rb_first(&flow->t_root);
780
781 while (p) {
782 struct sk_buff *skb = rb_to_skb(p);
783
784 p = rb_next(p);
785 rb_erase(&skb->rbnode, &flow->t_root);
786 rtnl_kfree_skbs(skb, skb);
787 }
788 rtnl_kfree_skbs(flow->head, flow->tail);
789 flow->head = NULL;
790 flow->qlen = 0;
791}
792
793static void fq_reset(struct Qdisc *sch)
794{
795 struct fq_sched_data *q = qdisc_priv(sch);
796 struct rb_root *root;
797 struct rb_node *p;
798 struct fq_flow *f;
799 unsigned int idx;
800
801 sch->q.qlen = 0;
802 sch->qstats.backlog = 0;
803
804 fq_flow_purge(&q->internal);
805
806 if (!q->fq_root)
807 return;
808
809 for (idx = 0; idx < (1U << q->fq_trees_log); idx++) {
810 root = &q->fq_root[idx];
811 while ((p = rb_first(root)) != NULL) {
812 f = rb_entry(p, struct fq_flow, fq_node);
813 rb_erase(p, root);
814
815 fq_flow_purge(f);
816
817 kmem_cache_free(fq_flow_cachep, f);
818 }
819 }
820 for (idx = 0; idx < FQ_BANDS; idx++) {
821 q->band_flows[idx].new_flows.first = NULL;
822 q->band_flows[idx].old_flows.first = NULL;
823 }
824 q->delayed = RB_ROOT;
825 q->flows = 0;
826 q->inactive_flows = 0;
827 q->throttled_flows = 0;
828}
829
830static void fq_rehash(struct fq_sched_data *q,
831 struct rb_root *old_array, u32 old_log,
832 struct rb_root *new_array, u32 new_log)
833{
834 struct rb_node *op, **np, *parent;
835 struct rb_root *oroot, *nroot;
836 struct fq_flow *of, *nf;
837 int fcnt = 0;
838 u32 idx;
839
840 for (idx = 0; idx < (1U << old_log); idx++) {
841 oroot = &old_array[idx];
842 while ((op = rb_first(oroot)) != NULL) {
843 rb_erase(op, oroot);
844 of = rb_entry(op, struct fq_flow, fq_node);
845 if (fq_gc_candidate(of)) {
846 fcnt++;
847 kmem_cache_free(fq_flow_cachep, of);
848 continue;
849 }
850 nroot = &new_array[hash_ptr(of->sk, new_log)];
851
852 np = &nroot->rb_node;
853 parent = NULL;
854 while (*np) {
855 parent = *np;
856
857 nf = rb_entry(parent, struct fq_flow, fq_node);
858 BUG_ON(nf->sk == of->sk);
859
860 if (nf->sk > of->sk)
861 np = &parent->rb_right;
862 else
863 np = &parent->rb_left;
864 }
865
866 rb_link_node(&of->fq_node, parent, np);
867 rb_insert_color(&of->fq_node, nroot);
868 }
869 }
870 q->flows -= fcnt;
871 q->inactive_flows -= fcnt;
872 q->stat_gc_flows += fcnt;
873}
874
875static void fq_free(void *addr)
876{
877 kvfree(addr);
878}
879
880static int fq_resize(struct Qdisc *sch, u32 log)
881{
882 struct fq_sched_data *q = qdisc_priv(sch);
883 struct rb_root *array;
884 void *old_fq_root;
885 u32 idx;
886
887 if (q->fq_root && log == q->fq_trees_log)
888 return 0;
889
890 /* If XPS was setup, we can allocate memory on right NUMA node */
891 array = kvmalloc_node(sizeof(struct rb_root) << log, GFP_KERNEL | __GFP_RETRY_MAYFAIL,
892 netdev_queue_numa_node_read(sch->dev_queue));
893 if (!array)
894 return -ENOMEM;
895
896 for (idx = 0; idx < (1U << log); idx++)
897 array[idx] = RB_ROOT;
898
899 sch_tree_lock(sch);
900
901 old_fq_root = q->fq_root;
902 if (old_fq_root)
903 fq_rehash(q, old_fq_root, q->fq_trees_log, array, log);
904
905 q->fq_root = array;
906 WRITE_ONCE(q->fq_trees_log, log);
907
908 sch_tree_unlock(sch);
909
910 fq_free(old_fq_root);
911
912 return 0;
913}
914
915static const struct netlink_range_validation iq_range = {
916 .max = INT_MAX,
917};
918
919static const struct nla_policy fq_policy[TCA_FQ_MAX + 1] = {
920 [TCA_FQ_UNSPEC] = { .strict_start_type = TCA_FQ_TIMER_SLACK },
921
922 [TCA_FQ_PLIMIT] = { .type = NLA_U32 },
923 [TCA_FQ_FLOW_PLIMIT] = { .type = NLA_U32 },
924 [TCA_FQ_QUANTUM] = { .type = NLA_U32 },
925 [TCA_FQ_INITIAL_QUANTUM] = NLA_POLICY_FULL_RANGE(NLA_U32, &iq_range),
926 [TCA_FQ_RATE_ENABLE] = { .type = NLA_U32 },
927 [TCA_FQ_FLOW_DEFAULT_RATE] = { .type = NLA_U32 },
928 [TCA_FQ_FLOW_MAX_RATE] = { .type = NLA_U32 },
929 [TCA_FQ_BUCKETS_LOG] = { .type = NLA_U32 },
930 [TCA_FQ_FLOW_REFILL_DELAY] = { .type = NLA_U32 },
931 [TCA_FQ_ORPHAN_MASK] = { .type = NLA_U32 },
932 [TCA_FQ_LOW_RATE_THRESHOLD] = { .type = NLA_U32 },
933 [TCA_FQ_CE_THRESHOLD] = { .type = NLA_U32 },
934 [TCA_FQ_TIMER_SLACK] = { .type = NLA_U32 },
935 [TCA_FQ_HORIZON] = { .type = NLA_U32 },
936 [TCA_FQ_HORIZON_DROP] = { .type = NLA_U8 },
937 [TCA_FQ_PRIOMAP] = NLA_POLICY_EXACT_LEN(sizeof(struct tc_prio_qopt)),
938 [TCA_FQ_WEIGHTS] = NLA_POLICY_EXACT_LEN(FQ_BANDS * sizeof(s32)),
939 [TCA_FQ_OFFLOAD_HORIZON] = { .type = NLA_U32 },
940};
941
942/* compress a u8 array with all elems <= 3 to an array of 2-bit fields */
943static void fq_prio2band_compress_crumb(const u8 *in, u8 *out)
944{
945 const int num_elems = TC_PRIO_MAX + 1;
946 u8 tmp[FQ_PRIO2BAND_CRUMB_SIZE];
947 int i;
948
949 memset(tmp, 0, sizeof(tmp));
950 for (i = 0; i < num_elems; i++)
951 tmp[i / 4] |= in[i] << (2 * (i & 0x3));
952
953 for (i = 0; i < FQ_PRIO2BAND_CRUMB_SIZE; i++)
954 WRITE_ONCE(out[i], tmp[i]);
955}
956
957static void fq_prio2band_decompress_crumb(const u8 *in, u8 *out)
958{
959 const int num_elems = TC_PRIO_MAX + 1;
960 int i;
961
962 for (i = 0; i < num_elems; i++)
963 out[i] = fq_prio2band(in, i);
964}
965
966static int fq_load_weights(struct fq_sched_data *q,
967 const struct nlattr *attr,
968 struct netlink_ext_ack *extack)
969{
970 s32 *weights = nla_data(attr);
971 int i;
972
973 for (i = 0; i < FQ_BANDS; i++) {
974 if (weights[i] < FQ_MIN_WEIGHT) {
975 NL_SET_ERR_MSG_FMT_MOD(extack, "Weight %d less that minimum allowed %d",
976 weights[i], FQ_MIN_WEIGHT);
977 return -EINVAL;
978 }
979 }
980 for (i = 0; i < FQ_BANDS; i++)
981 WRITE_ONCE(q->band_flows[i].quantum, weights[i]);
982 return 0;
983}
984
985static int fq_load_priomap(struct fq_sched_data *q,
986 const struct nlattr *attr,
987 struct netlink_ext_ack *extack)
988{
989 const struct tc_prio_qopt *map = nla_data(attr);
990 int i;
991
992 if (map->bands != FQ_BANDS) {
993 NL_SET_ERR_MSG_MOD(extack, "FQ only supports 3 bands");
994 return -EINVAL;
995 }
996 for (i = 0; i < TC_PRIO_MAX + 1; i++) {
997 if (map->priomap[i] >= FQ_BANDS) {
998 NL_SET_ERR_MSG_FMT_MOD(extack, "FQ priomap field %d maps to a too high band %d",
999 i, map->priomap[i]);
1000 return -EINVAL;
1001 }
1002 }
1003 fq_prio2band_compress_crumb(map->priomap, q->prio2band);
1004 return 0;
1005}
1006
1007static int fq_change(struct Qdisc *sch, struct nlattr *opt,
1008 struct netlink_ext_ack *extack)
1009{
1010 struct fq_sched_data *q = qdisc_priv(sch);
1011 struct nlattr *tb[TCA_FQ_MAX + 1];
1012 int err, drop_count = 0;
1013 unsigned drop_len = 0;
1014 u32 fq_log;
1015
1016 err = nla_parse_nested_deprecated(tb, TCA_FQ_MAX, opt, fq_policy,
1017 NULL);
1018 if (err < 0)
1019 return err;
1020
1021 sch_tree_lock(sch);
1022
1023 fq_log = q->fq_trees_log;
1024
1025 if (tb[TCA_FQ_BUCKETS_LOG]) {
1026 u32 nval = nla_get_u32(tb[TCA_FQ_BUCKETS_LOG]);
1027
1028 if (nval >= 1 && nval <= ilog2(256*1024))
1029 fq_log = nval;
1030 else
1031 err = -EINVAL;
1032 }
1033 if (tb[TCA_FQ_PLIMIT])
1034 WRITE_ONCE(sch->limit,
1035 nla_get_u32(tb[TCA_FQ_PLIMIT]));
1036
1037 if (tb[TCA_FQ_FLOW_PLIMIT])
1038 WRITE_ONCE(q->flow_plimit,
1039 nla_get_u32(tb[TCA_FQ_FLOW_PLIMIT]));
1040
1041 if (tb[TCA_FQ_QUANTUM]) {
1042 u32 quantum = nla_get_u32(tb[TCA_FQ_QUANTUM]);
1043
1044 if (quantum > 0 && quantum <= (1 << 20)) {
1045 WRITE_ONCE(q->quantum, quantum);
1046 } else {
1047 NL_SET_ERR_MSG_MOD(extack, "invalid quantum");
1048 err = -EINVAL;
1049 }
1050 }
1051
1052 if (tb[TCA_FQ_INITIAL_QUANTUM])
1053 WRITE_ONCE(q->initial_quantum,
1054 nla_get_u32(tb[TCA_FQ_INITIAL_QUANTUM]));
1055
1056 if (tb[TCA_FQ_FLOW_DEFAULT_RATE])
1057 pr_warn_ratelimited("sch_fq: defrate %u ignored.\n",
1058 nla_get_u32(tb[TCA_FQ_FLOW_DEFAULT_RATE]));
1059
1060 if (tb[TCA_FQ_FLOW_MAX_RATE]) {
1061 u32 rate = nla_get_u32(tb[TCA_FQ_FLOW_MAX_RATE]);
1062
1063 WRITE_ONCE(q->flow_max_rate,
1064 (rate == ~0U) ? ~0UL : rate);
1065 }
1066 if (tb[TCA_FQ_LOW_RATE_THRESHOLD])
1067 WRITE_ONCE(q->low_rate_threshold,
1068 nla_get_u32(tb[TCA_FQ_LOW_RATE_THRESHOLD]));
1069
1070 if (tb[TCA_FQ_RATE_ENABLE]) {
1071 u32 enable = nla_get_u32(tb[TCA_FQ_RATE_ENABLE]);
1072
1073 if (enable <= 1)
1074 WRITE_ONCE(q->rate_enable,
1075 enable);
1076 else
1077 err = -EINVAL;
1078 }
1079
1080 if (tb[TCA_FQ_FLOW_REFILL_DELAY]) {
1081 u32 usecs_delay = nla_get_u32(tb[TCA_FQ_FLOW_REFILL_DELAY]) ;
1082
1083 WRITE_ONCE(q->flow_refill_delay,
1084 usecs_to_jiffies(usecs_delay));
1085 }
1086
1087 if (!err && tb[TCA_FQ_PRIOMAP])
1088 err = fq_load_priomap(q, tb[TCA_FQ_PRIOMAP], extack);
1089
1090 if (!err && tb[TCA_FQ_WEIGHTS])
1091 err = fq_load_weights(q, tb[TCA_FQ_WEIGHTS], extack);
1092
1093 if (tb[TCA_FQ_ORPHAN_MASK])
1094 WRITE_ONCE(q->orphan_mask,
1095 nla_get_u32(tb[TCA_FQ_ORPHAN_MASK]));
1096
1097 if (tb[TCA_FQ_CE_THRESHOLD])
1098 WRITE_ONCE(q->ce_threshold,
1099 (u64)NSEC_PER_USEC *
1100 nla_get_u32(tb[TCA_FQ_CE_THRESHOLD]));
1101
1102 if (tb[TCA_FQ_TIMER_SLACK])
1103 WRITE_ONCE(q->timer_slack,
1104 nla_get_u32(tb[TCA_FQ_TIMER_SLACK]));
1105
1106 if (tb[TCA_FQ_HORIZON])
1107 WRITE_ONCE(q->horizon,
1108 (u64)NSEC_PER_USEC *
1109 nla_get_u32(tb[TCA_FQ_HORIZON]));
1110
1111 if (tb[TCA_FQ_HORIZON_DROP])
1112 WRITE_ONCE(q->horizon_drop,
1113 nla_get_u8(tb[TCA_FQ_HORIZON_DROP]));
1114
1115 if (tb[TCA_FQ_OFFLOAD_HORIZON]) {
1116 u64 offload_horizon = (u64)NSEC_PER_USEC *
1117 nla_get_u32(tb[TCA_FQ_OFFLOAD_HORIZON]);
1118
1119 if (offload_horizon <= qdisc_dev(sch)->max_pacing_offload_horizon) {
1120 WRITE_ONCE(q->offload_horizon, offload_horizon);
1121 } else {
1122 NL_SET_ERR_MSG_MOD(extack, "invalid offload_horizon");
1123 err = -EINVAL;
1124 }
1125 }
1126 if (!err) {
1127
1128 sch_tree_unlock(sch);
1129 err = fq_resize(sch, fq_log);
1130 sch_tree_lock(sch);
1131 }
1132 while (sch->q.qlen > sch->limit) {
1133 struct sk_buff *skb = fq_dequeue(sch);
1134
1135 if (!skb)
1136 break;
1137 drop_len += qdisc_pkt_len(skb);
1138 rtnl_kfree_skbs(skb, skb);
1139 drop_count++;
1140 }
1141 qdisc_tree_reduce_backlog(sch, drop_count, drop_len);
1142
1143 sch_tree_unlock(sch);
1144 return err;
1145}
1146
1147static void fq_destroy(struct Qdisc *sch)
1148{
1149 struct fq_sched_data *q = qdisc_priv(sch);
1150
1151 fq_reset(sch);
1152 fq_free(q->fq_root);
1153 qdisc_watchdog_cancel(&q->watchdog);
1154}
1155
1156static int fq_init(struct Qdisc *sch, struct nlattr *opt,
1157 struct netlink_ext_ack *extack)
1158{
1159 struct fq_sched_data *q = qdisc_priv(sch);
1160 int i, err;
1161
1162 sch->limit = 10000;
1163 q->flow_plimit = 100;
1164 q->quantum = 2 * psched_mtu(qdisc_dev(sch));
1165 q->initial_quantum = 10 * psched_mtu(qdisc_dev(sch));
1166 q->flow_refill_delay = msecs_to_jiffies(40);
1167 q->flow_max_rate = ~0UL;
1168 q->time_next_delayed_flow = ~0ULL;
1169 q->rate_enable = 1;
1170 for (i = 0; i < FQ_BANDS; i++) {
1171 q->band_flows[i].new_flows.first = NULL;
1172 q->band_flows[i].old_flows.first = NULL;
1173 }
1174 q->band_flows[0].quantum = 9 << 16;
1175 q->band_flows[1].quantum = 3 << 16;
1176 q->band_flows[2].quantum = 1 << 16;
1177 q->delayed = RB_ROOT;
1178 q->fq_root = NULL;
1179 q->fq_trees_log = ilog2(1024);
1180 q->orphan_mask = 1024 - 1;
1181 q->low_rate_threshold = 550000 / 8;
1182
1183 q->timer_slack = 10 * NSEC_PER_USEC; /* 10 usec of hrtimer slack */
1184
1185 q->horizon = 10ULL * NSEC_PER_SEC; /* 10 seconds */
1186 q->horizon_drop = 1; /* by default, drop packets beyond horizon */
1187
1188 /* Default ce_threshold of 4294 seconds */
1189 q->ce_threshold = (u64)NSEC_PER_USEC * ~0U;
1190
1191 fq_prio2band_compress_crumb(sch_default_prio2band, q->prio2band);
1192 qdisc_watchdog_init_clockid(&q->watchdog, sch, CLOCK_MONOTONIC);
1193
1194 if (opt)
1195 err = fq_change(sch, opt, extack);
1196 else
1197 err = fq_resize(sch, q->fq_trees_log);
1198
1199 return err;
1200}
1201
1202static int fq_dump(struct Qdisc *sch, struct sk_buff *skb)
1203{
1204 struct fq_sched_data *q = qdisc_priv(sch);
1205 struct tc_prio_qopt prio = {
1206 .bands = FQ_BANDS,
1207 };
1208 struct nlattr *opts;
1209 u64 offload_horizon;
1210 u64 ce_threshold;
1211 s32 weights[3];
1212 u64 horizon;
1213
1214 opts = nla_nest_start_noflag(skb, TCA_OPTIONS);
1215 if (opts == NULL)
1216 goto nla_put_failure;
1217
1218 /* TCA_FQ_FLOW_DEFAULT_RATE is not used anymore */
1219
1220 ce_threshold = READ_ONCE(q->ce_threshold);
1221 do_div(ce_threshold, NSEC_PER_USEC);
1222
1223 horizon = READ_ONCE(q->horizon);
1224 do_div(horizon, NSEC_PER_USEC);
1225
1226 offload_horizon = READ_ONCE(q->offload_horizon);
1227 do_div(offload_horizon, NSEC_PER_USEC);
1228
1229 if (nla_put_u32(skb, TCA_FQ_PLIMIT,
1230 READ_ONCE(sch->limit)) ||
1231 nla_put_u32(skb, TCA_FQ_FLOW_PLIMIT,
1232 READ_ONCE(q->flow_plimit)) ||
1233 nla_put_u32(skb, TCA_FQ_QUANTUM,
1234 READ_ONCE(q->quantum)) ||
1235 nla_put_u32(skb, TCA_FQ_INITIAL_QUANTUM,
1236 READ_ONCE(q->initial_quantum)) ||
1237 nla_put_u32(skb, TCA_FQ_RATE_ENABLE,
1238 READ_ONCE(q->rate_enable)) ||
1239 nla_put_u32(skb, TCA_FQ_FLOW_MAX_RATE,
1240 min_t(unsigned long,
1241 READ_ONCE(q->flow_max_rate), ~0U)) ||
1242 nla_put_u32(skb, TCA_FQ_FLOW_REFILL_DELAY,
1243 jiffies_to_usecs(READ_ONCE(q->flow_refill_delay))) ||
1244 nla_put_u32(skb, TCA_FQ_ORPHAN_MASK,
1245 READ_ONCE(q->orphan_mask)) ||
1246 nla_put_u32(skb, TCA_FQ_LOW_RATE_THRESHOLD,
1247 READ_ONCE(q->low_rate_threshold)) ||
1248 nla_put_u32(skb, TCA_FQ_CE_THRESHOLD, (u32)ce_threshold) ||
1249 nla_put_u32(skb, TCA_FQ_BUCKETS_LOG,
1250 READ_ONCE(q->fq_trees_log)) ||
1251 nla_put_u32(skb, TCA_FQ_TIMER_SLACK,
1252 READ_ONCE(q->timer_slack)) ||
1253 nla_put_u32(skb, TCA_FQ_HORIZON, (u32)horizon) ||
1254 nla_put_u32(skb, TCA_FQ_OFFLOAD_HORIZON, (u32)offload_horizon) ||
1255 nla_put_u8(skb, TCA_FQ_HORIZON_DROP,
1256 READ_ONCE(q->horizon_drop)))
1257 goto nla_put_failure;
1258
1259 fq_prio2band_decompress_crumb(q->prio2band, prio.priomap);
1260 if (nla_put(skb, TCA_FQ_PRIOMAP, sizeof(prio), &prio))
1261 goto nla_put_failure;
1262
1263 weights[0] = READ_ONCE(q->band_flows[0].quantum);
1264 weights[1] = READ_ONCE(q->band_flows[1].quantum);
1265 weights[2] = READ_ONCE(q->band_flows[2].quantum);
1266 if (nla_put(skb, TCA_FQ_WEIGHTS, sizeof(weights), &weights))
1267 goto nla_put_failure;
1268
1269 return nla_nest_end(skb, opts);
1270
1271nla_put_failure:
1272 return -1;
1273}
1274
1275static int fq_dump_stats(struct Qdisc *sch, struct gnet_dump *d)
1276{
1277 struct fq_sched_data *q = qdisc_priv(sch);
1278 struct tc_fq_qd_stats st;
1279 int i;
1280
1281 st.pad = 0;
1282
1283 sch_tree_lock(sch);
1284
1285 st.gc_flows = q->stat_gc_flows;
1286 st.highprio_packets = 0;
1287 st.fastpath_packets = q->internal.stat_fastpath_packets;
1288 st.tcp_retrans = 0;
1289 st.throttled = q->stat_throttled;
1290 st.flows_plimit = q->stat_flows_plimit;
1291 st.pkts_too_long = q->stat_pkts_too_long;
1292 st.allocation_errors = q->stat_allocation_errors;
1293 st.time_next_delayed_flow = q->time_next_delayed_flow + q->timer_slack -
1294 ktime_get_ns();
1295 st.flows = q->flows;
1296 st.inactive_flows = q->inactive_flows;
1297 st.throttled_flows = q->throttled_flows;
1298 st.unthrottle_latency_ns = min_t(unsigned long,
1299 q->unthrottle_latency_ns, ~0U);
1300 st.ce_mark = q->stat_ce_mark;
1301 st.horizon_drops = q->stat_horizon_drops;
1302 st.horizon_caps = q->stat_horizon_caps;
1303 for (i = 0; i < FQ_BANDS; i++) {
1304 st.band_drops[i] = q->stat_band_drops[i];
1305 st.band_pkt_count[i] = q->band_pkt_count[i];
1306 }
1307 sch_tree_unlock(sch);
1308
1309 return gnet_stats_copy_app(d, &st, sizeof(st));
1310}
1311
1312static struct Qdisc_ops fq_qdisc_ops __read_mostly = {
1313 .id = "fq",
1314 .priv_size = sizeof(struct fq_sched_data),
1315
1316 .enqueue = fq_enqueue,
1317 .dequeue = fq_dequeue,
1318 .peek = qdisc_peek_dequeued,
1319 .init = fq_init,
1320 .reset = fq_reset,
1321 .destroy = fq_destroy,
1322 .change = fq_change,
1323 .dump = fq_dump,
1324 .dump_stats = fq_dump_stats,
1325 .owner = THIS_MODULE,
1326};
1327MODULE_ALIAS_NET_SCH("fq");
1328
1329static int __init fq_module_init(void)
1330{
1331 int ret;
1332
1333 fq_flow_cachep = kmem_cache_create("fq_flow_cache",
1334 sizeof(struct fq_flow),
1335 0, SLAB_HWCACHE_ALIGN, NULL);
1336 if (!fq_flow_cachep)
1337 return -ENOMEM;
1338
1339 ret = register_qdisc(&fq_qdisc_ops);
1340 if (ret)
1341 kmem_cache_destroy(fq_flow_cachep);
1342 return ret;
1343}
1344
1345static void __exit fq_module_exit(void)
1346{
1347 unregister_qdisc(&fq_qdisc_ops);
1348 kmem_cache_destroy(fq_flow_cachep);
1349}
1350
1351module_init(fq_module_init)
1352module_exit(fq_module_exit)
1353MODULE_AUTHOR("Eric Dumazet");
1354MODULE_LICENSE("GPL");
1355MODULE_DESCRIPTION("Fair Queue Packet Scheduler");
1/*
2 * net/sched/sch_fq.c Fair Queue Packet Scheduler (per flow pacing)
3 *
4 * Copyright (C) 2013-2015 Eric Dumazet <edumazet@google.com>
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 * Meant to be mostly used for locally generated traffic :
12 * Fast classification depends on skb->sk being set before reaching us.
13 * If not, (router workload), we use rxhash as fallback, with 32 bits wide hash.
14 * All packets belonging to a socket are considered as a 'flow'.
15 *
16 * Flows are dynamically allocated and stored in a hash table of RB trees
17 * They are also part of one Round Robin 'queues' (new or old flows)
18 *
19 * Burst avoidance (aka pacing) capability :
20 *
21 * Transport (eg TCP) can set in sk->sk_pacing_rate a rate, enqueue a
22 * bunch of packets, and this packet scheduler adds delay between
23 * packets to respect rate limitation.
24 *
25 * enqueue() :
26 * - lookup one RB tree (out of 1024 or more) to find the flow.
27 * If non existent flow, create it, add it to the tree.
28 * Add skb to the per flow list of skb (fifo).
29 * - Use a special fifo for high prio packets
30 *
31 * dequeue() : serves flows in Round Robin
32 * Note : When a flow becomes empty, we do not immediately remove it from
33 * rb trees, for performance reasons (its expected to send additional packets,
34 * or SLAB cache will reuse socket for another flow)
35 */
36
37#include <linux/module.h>
38#include <linux/types.h>
39#include <linux/kernel.h>
40#include <linux/jiffies.h>
41#include <linux/string.h>
42#include <linux/in.h>
43#include <linux/errno.h>
44#include <linux/init.h>
45#include <linux/skbuff.h>
46#include <linux/slab.h>
47#include <linux/rbtree.h>
48#include <linux/hash.h>
49#include <linux/prefetch.h>
50#include <linux/vmalloc.h>
51#include <net/netlink.h>
52#include <net/pkt_sched.h>
53#include <net/sock.h>
54#include <net/tcp_states.h>
55#include <net/tcp.h>
56
57/*
58 * Per flow structure, dynamically allocated
59 */
60struct fq_flow {
61 struct sk_buff *head; /* list of skbs for this flow : first skb */
62 union {
63 struct sk_buff *tail; /* last skb in the list */
64 unsigned long age; /* jiffies when flow was emptied, for gc */
65 };
66 struct rb_node fq_node; /* anchor in fq_root[] trees */
67 struct sock *sk;
68 int qlen; /* number of packets in flow queue */
69 int credit;
70 u32 socket_hash; /* sk_hash */
71 struct fq_flow *next; /* next pointer in RR lists, or &detached */
72
73 struct rb_node rate_node; /* anchor in q->delayed tree */
74 u64 time_next_packet;
75};
76
77struct fq_flow_head {
78 struct fq_flow *first;
79 struct fq_flow *last;
80};
81
82struct fq_sched_data {
83 struct fq_flow_head new_flows;
84
85 struct fq_flow_head old_flows;
86
87 struct rb_root delayed; /* for rate limited flows */
88 u64 time_next_delayed_flow;
89
90 struct fq_flow internal; /* for non classified or high prio packets */
91 u32 quantum;
92 u32 initial_quantum;
93 u32 flow_refill_delay;
94 u32 flow_max_rate; /* optional max rate per flow */
95 u32 flow_plimit; /* max packets per flow */
96 u32 orphan_mask; /* mask for orphaned skb */
97 struct rb_root *fq_root;
98 u8 rate_enable;
99 u8 fq_trees_log;
100
101 u32 flows;
102 u32 inactive_flows;
103 u32 throttled_flows;
104
105 u64 stat_gc_flows;
106 u64 stat_internal_packets;
107 u64 stat_tcp_retrans;
108 u64 stat_throttled;
109 u64 stat_flows_plimit;
110 u64 stat_pkts_too_long;
111 u64 stat_allocation_errors;
112 struct qdisc_watchdog watchdog;
113};
114
115/* special value to mark a detached flow (not on old/new list) */
116static struct fq_flow detached, throttled;
117
118static void fq_flow_set_detached(struct fq_flow *f)
119{
120 f->next = &detached;
121 f->age = jiffies;
122}
123
124static bool fq_flow_is_detached(const struct fq_flow *f)
125{
126 return f->next == &detached;
127}
128
129static void fq_flow_set_throttled(struct fq_sched_data *q, struct fq_flow *f)
130{
131 struct rb_node **p = &q->delayed.rb_node, *parent = NULL;
132
133 while (*p) {
134 struct fq_flow *aux;
135
136 parent = *p;
137 aux = container_of(parent, struct fq_flow, rate_node);
138 if (f->time_next_packet >= aux->time_next_packet)
139 p = &parent->rb_right;
140 else
141 p = &parent->rb_left;
142 }
143 rb_link_node(&f->rate_node, parent, p);
144 rb_insert_color(&f->rate_node, &q->delayed);
145 q->throttled_flows++;
146 q->stat_throttled++;
147
148 f->next = &throttled;
149 if (q->time_next_delayed_flow > f->time_next_packet)
150 q->time_next_delayed_flow = f->time_next_packet;
151}
152
153
154static struct kmem_cache *fq_flow_cachep __read_mostly;
155
156static void fq_flow_add_tail(struct fq_flow_head *head, struct fq_flow *flow)
157{
158 if (head->first)
159 head->last->next = flow;
160 else
161 head->first = flow;
162 head->last = flow;
163 flow->next = NULL;
164}
165
166/* limit number of collected flows per round */
167#define FQ_GC_MAX 8
168#define FQ_GC_AGE (3*HZ)
169
170static bool fq_gc_candidate(const struct fq_flow *f)
171{
172 return fq_flow_is_detached(f) &&
173 time_after(jiffies, f->age + FQ_GC_AGE);
174}
175
176static void fq_gc(struct fq_sched_data *q,
177 struct rb_root *root,
178 struct sock *sk)
179{
180 struct fq_flow *f, *tofree[FQ_GC_MAX];
181 struct rb_node **p, *parent;
182 int fcnt = 0;
183
184 p = &root->rb_node;
185 parent = NULL;
186 while (*p) {
187 parent = *p;
188
189 f = container_of(parent, struct fq_flow, fq_node);
190 if (f->sk == sk)
191 break;
192
193 if (fq_gc_candidate(f)) {
194 tofree[fcnt++] = f;
195 if (fcnt == FQ_GC_MAX)
196 break;
197 }
198
199 if (f->sk > sk)
200 p = &parent->rb_right;
201 else
202 p = &parent->rb_left;
203 }
204
205 q->flows -= fcnt;
206 q->inactive_flows -= fcnt;
207 q->stat_gc_flows += fcnt;
208 while (fcnt) {
209 struct fq_flow *f = tofree[--fcnt];
210
211 rb_erase(&f->fq_node, root);
212 kmem_cache_free(fq_flow_cachep, f);
213 }
214}
215
216static struct fq_flow *fq_classify(struct sk_buff *skb, struct fq_sched_data *q)
217{
218 struct rb_node **p, *parent;
219 struct sock *sk = skb->sk;
220 struct rb_root *root;
221 struct fq_flow *f;
222
223 /* warning: no starvation prevention... */
224 if (unlikely((skb->priority & TC_PRIO_MAX) == TC_PRIO_CONTROL))
225 return &q->internal;
226
227 /* SYNACK messages are attached to a TCP_NEW_SYN_RECV request socket
228 * or a listener (SYNCOOKIE mode)
229 * 1) request sockets are not full blown,
230 * they do not contain sk_pacing_rate
231 * 2) They are not part of a 'flow' yet
232 * 3) We do not want to rate limit them (eg SYNFLOOD attack),
233 * especially if the listener set SO_MAX_PACING_RATE
234 * 4) We pretend they are orphaned
235 */
236 if (!sk || sk_listener(sk)) {
237 unsigned long hash = skb_get_hash(skb) & q->orphan_mask;
238
239 /* By forcing low order bit to 1, we make sure to not
240 * collide with a local flow (socket pointers are word aligned)
241 */
242 sk = (struct sock *)((hash << 1) | 1UL);
243 skb_orphan(skb);
244 }
245
246 root = &q->fq_root[hash_32((u32)(long)sk, q->fq_trees_log)];
247
248 if (q->flows >= (2U << q->fq_trees_log) &&
249 q->inactive_flows > q->flows/2)
250 fq_gc(q, root, sk);
251
252 p = &root->rb_node;
253 parent = NULL;
254 while (*p) {
255 parent = *p;
256
257 f = container_of(parent, struct fq_flow, fq_node);
258 if (f->sk == sk) {
259 /* socket might have been reallocated, so check
260 * if its sk_hash is the same.
261 * It not, we need to refill credit with
262 * initial quantum
263 */
264 if (unlikely(skb->sk &&
265 f->socket_hash != sk->sk_hash)) {
266 f->credit = q->initial_quantum;
267 f->socket_hash = sk->sk_hash;
268 f->time_next_packet = 0ULL;
269 }
270 return f;
271 }
272 if (f->sk > sk)
273 p = &parent->rb_right;
274 else
275 p = &parent->rb_left;
276 }
277
278 f = kmem_cache_zalloc(fq_flow_cachep, GFP_ATOMIC | __GFP_NOWARN);
279 if (unlikely(!f)) {
280 q->stat_allocation_errors++;
281 return &q->internal;
282 }
283 fq_flow_set_detached(f);
284 f->sk = sk;
285 if (skb->sk)
286 f->socket_hash = sk->sk_hash;
287 f->credit = q->initial_quantum;
288
289 rb_link_node(&f->fq_node, parent, p);
290 rb_insert_color(&f->fq_node, root);
291
292 q->flows++;
293 q->inactive_flows++;
294 return f;
295}
296
297
298/* remove one skb from head of flow queue */
299static struct sk_buff *fq_dequeue_head(struct Qdisc *sch, struct fq_flow *flow)
300{
301 struct sk_buff *skb = flow->head;
302
303 if (skb) {
304 flow->head = skb->next;
305 skb->next = NULL;
306 flow->qlen--;
307 qdisc_qstats_backlog_dec(sch, skb);
308 sch->q.qlen--;
309 }
310 return skb;
311}
312
313/* We might add in the future detection of retransmits
314 * For the time being, just return false
315 */
316static bool skb_is_retransmit(struct sk_buff *skb)
317{
318 return false;
319}
320
321/* add skb to flow queue
322 * flow queue is a linked list, kind of FIFO, except for TCP retransmits
323 * We special case tcp retransmits to be transmitted before other packets.
324 * We rely on fact that TCP retransmits are unlikely, so we do not waste
325 * a separate queue or a pointer.
326 * head-> [retrans pkt 1]
327 * [retrans pkt 2]
328 * [ normal pkt 1]
329 * [ normal pkt 2]
330 * [ normal pkt 3]
331 * tail-> [ normal pkt 4]
332 */
333static void flow_queue_add(struct fq_flow *flow, struct sk_buff *skb)
334{
335 struct sk_buff *prev, *head = flow->head;
336
337 skb->next = NULL;
338 if (!head) {
339 flow->head = skb;
340 flow->tail = skb;
341 return;
342 }
343 if (likely(!skb_is_retransmit(skb))) {
344 flow->tail->next = skb;
345 flow->tail = skb;
346 return;
347 }
348
349 /* This skb is a tcp retransmit,
350 * find the last retrans packet in the queue
351 */
352 prev = NULL;
353 while (skb_is_retransmit(head)) {
354 prev = head;
355 head = head->next;
356 if (!head)
357 break;
358 }
359 if (!prev) { /* no rtx packet in queue, become the new head */
360 skb->next = flow->head;
361 flow->head = skb;
362 } else {
363 if (prev == flow->tail)
364 flow->tail = skb;
365 else
366 skb->next = prev->next;
367 prev->next = skb;
368 }
369}
370
371static int fq_enqueue(struct sk_buff *skb, struct Qdisc *sch)
372{
373 struct fq_sched_data *q = qdisc_priv(sch);
374 struct fq_flow *f;
375
376 if (unlikely(sch->q.qlen >= sch->limit))
377 return qdisc_drop(skb, sch);
378
379 f = fq_classify(skb, q);
380 if (unlikely(f->qlen >= q->flow_plimit && f != &q->internal)) {
381 q->stat_flows_plimit++;
382 return qdisc_drop(skb, sch);
383 }
384
385 f->qlen++;
386 if (skb_is_retransmit(skb))
387 q->stat_tcp_retrans++;
388 qdisc_qstats_backlog_inc(sch, skb);
389 if (fq_flow_is_detached(f)) {
390 fq_flow_add_tail(&q->new_flows, f);
391 if (time_after(jiffies, f->age + q->flow_refill_delay))
392 f->credit = max_t(u32, f->credit, q->quantum);
393 q->inactive_flows--;
394 }
395
396 /* Note: this overwrites f->age */
397 flow_queue_add(f, skb);
398
399 if (unlikely(f == &q->internal)) {
400 q->stat_internal_packets++;
401 }
402 sch->q.qlen++;
403
404 return NET_XMIT_SUCCESS;
405}
406
407static void fq_check_throttled(struct fq_sched_data *q, u64 now)
408{
409 struct rb_node *p;
410
411 if (q->time_next_delayed_flow > now)
412 return;
413
414 q->time_next_delayed_flow = ~0ULL;
415 while ((p = rb_first(&q->delayed)) != NULL) {
416 struct fq_flow *f = container_of(p, struct fq_flow, rate_node);
417
418 if (f->time_next_packet > now) {
419 q->time_next_delayed_flow = f->time_next_packet;
420 break;
421 }
422 rb_erase(p, &q->delayed);
423 q->throttled_flows--;
424 fq_flow_add_tail(&q->old_flows, f);
425 }
426}
427
428static struct sk_buff *fq_dequeue(struct Qdisc *sch)
429{
430 struct fq_sched_data *q = qdisc_priv(sch);
431 u64 now = ktime_get_ns();
432 struct fq_flow_head *head;
433 struct sk_buff *skb;
434 struct fq_flow *f;
435 u32 rate;
436
437 skb = fq_dequeue_head(sch, &q->internal);
438 if (skb)
439 goto out;
440 fq_check_throttled(q, now);
441begin:
442 head = &q->new_flows;
443 if (!head->first) {
444 head = &q->old_flows;
445 if (!head->first) {
446 if (q->time_next_delayed_flow != ~0ULL)
447 qdisc_watchdog_schedule_ns(&q->watchdog,
448 q->time_next_delayed_flow,
449 false);
450 return NULL;
451 }
452 }
453 f = head->first;
454
455 if (f->credit <= 0) {
456 f->credit += q->quantum;
457 head->first = f->next;
458 fq_flow_add_tail(&q->old_flows, f);
459 goto begin;
460 }
461
462 skb = f->head;
463 if (unlikely(skb && now < f->time_next_packet &&
464 !skb_is_tcp_pure_ack(skb))) {
465 head->first = f->next;
466 fq_flow_set_throttled(q, f);
467 goto begin;
468 }
469
470 skb = fq_dequeue_head(sch, f);
471 if (!skb) {
472 head->first = f->next;
473 /* force a pass through old_flows to prevent starvation */
474 if ((head == &q->new_flows) && q->old_flows.first) {
475 fq_flow_add_tail(&q->old_flows, f);
476 } else {
477 fq_flow_set_detached(f);
478 q->inactive_flows++;
479 }
480 goto begin;
481 }
482 prefetch(&skb->end);
483 f->credit -= qdisc_pkt_len(skb);
484
485 if (f->credit > 0 || !q->rate_enable)
486 goto out;
487
488 /* Do not pace locally generated ack packets */
489 if (skb_is_tcp_pure_ack(skb))
490 goto out;
491
492 rate = q->flow_max_rate;
493 if (skb->sk)
494 rate = min(skb->sk->sk_pacing_rate, rate);
495
496 if (rate != ~0U) {
497 u32 plen = max(qdisc_pkt_len(skb), q->quantum);
498 u64 len = (u64)plen * NSEC_PER_SEC;
499
500 if (likely(rate))
501 do_div(len, rate);
502 /* Since socket rate can change later,
503 * clamp the delay to 1 second.
504 * Really, providers of too big packets should be fixed !
505 */
506 if (unlikely(len > NSEC_PER_SEC)) {
507 len = NSEC_PER_SEC;
508 q->stat_pkts_too_long++;
509 }
510
511 f->time_next_packet = now + len;
512 }
513out:
514 qdisc_bstats_update(sch, skb);
515 return skb;
516}
517
518static void fq_reset(struct Qdisc *sch)
519{
520 struct fq_sched_data *q = qdisc_priv(sch);
521 struct rb_root *root;
522 struct sk_buff *skb;
523 struct rb_node *p;
524 struct fq_flow *f;
525 unsigned int idx;
526
527 while ((skb = fq_dequeue_head(sch, &q->internal)) != NULL)
528 kfree_skb(skb);
529
530 if (!q->fq_root)
531 return;
532
533 for (idx = 0; idx < (1U << q->fq_trees_log); idx++) {
534 root = &q->fq_root[idx];
535 while ((p = rb_first(root)) != NULL) {
536 f = container_of(p, struct fq_flow, fq_node);
537 rb_erase(p, root);
538
539 while ((skb = fq_dequeue_head(sch, f)) != NULL)
540 kfree_skb(skb);
541
542 kmem_cache_free(fq_flow_cachep, f);
543 }
544 }
545 q->new_flows.first = NULL;
546 q->old_flows.first = NULL;
547 q->delayed = RB_ROOT;
548 q->flows = 0;
549 q->inactive_flows = 0;
550 q->throttled_flows = 0;
551}
552
553static void fq_rehash(struct fq_sched_data *q,
554 struct rb_root *old_array, u32 old_log,
555 struct rb_root *new_array, u32 new_log)
556{
557 struct rb_node *op, **np, *parent;
558 struct rb_root *oroot, *nroot;
559 struct fq_flow *of, *nf;
560 int fcnt = 0;
561 u32 idx;
562
563 for (idx = 0; idx < (1U << old_log); idx++) {
564 oroot = &old_array[idx];
565 while ((op = rb_first(oroot)) != NULL) {
566 rb_erase(op, oroot);
567 of = container_of(op, struct fq_flow, fq_node);
568 if (fq_gc_candidate(of)) {
569 fcnt++;
570 kmem_cache_free(fq_flow_cachep, of);
571 continue;
572 }
573 nroot = &new_array[hash_32((u32)(long)of->sk, new_log)];
574
575 np = &nroot->rb_node;
576 parent = NULL;
577 while (*np) {
578 parent = *np;
579
580 nf = container_of(parent, struct fq_flow, fq_node);
581 BUG_ON(nf->sk == of->sk);
582
583 if (nf->sk > of->sk)
584 np = &parent->rb_right;
585 else
586 np = &parent->rb_left;
587 }
588
589 rb_link_node(&of->fq_node, parent, np);
590 rb_insert_color(&of->fq_node, nroot);
591 }
592 }
593 q->flows -= fcnt;
594 q->inactive_flows -= fcnt;
595 q->stat_gc_flows += fcnt;
596}
597
598static void *fq_alloc_node(size_t sz, int node)
599{
600 void *ptr;
601
602 ptr = kmalloc_node(sz, GFP_KERNEL | __GFP_REPEAT | __GFP_NOWARN, node);
603 if (!ptr)
604 ptr = vmalloc_node(sz, node);
605 return ptr;
606}
607
608static void fq_free(void *addr)
609{
610 kvfree(addr);
611}
612
613static int fq_resize(struct Qdisc *sch, u32 log)
614{
615 struct fq_sched_data *q = qdisc_priv(sch);
616 struct rb_root *array;
617 void *old_fq_root;
618 u32 idx;
619
620 if (q->fq_root && log == q->fq_trees_log)
621 return 0;
622
623 /* If XPS was setup, we can allocate memory on right NUMA node */
624 array = fq_alloc_node(sizeof(struct rb_root) << log,
625 netdev_queue_numa_node_read(sch->dev_queue));
626 if (!array)
627 return -ENOMEM;
628
629 for (idx = 0; idx < (1U << log); idx++)
630 array[idx] = RB_ROOT;
631
632 sch_tree_lock(sch);
633
634 old_fq_root = q->fq_root;
635 if (old_fq_root)
636 fq_rehash(q, old_fq_root, q->fq_trees_log, array, log);
637
638 q->fq_root = array;
639 q->fq_trees_log = log;
640
641 sch_tree_unlock(sch);
642
643 fq_free(old_fq_root);
644
645 return 0;
646}
647
648static const struct nla_policy fq_policy[TCA_FQ_MAX + 1] = {
649 [TCA_FQ_PLIMIT] = { .type = NLA_U32 },
650 [TCA_FQ_FLOW_PLIMIT] = { .type = NLA_U32 },
651 [TCA_FQ_QUANTUM] = { .type = NLA_U32 },
652 [TCA_FQ_INITIAL_QUANTUM] = { .type = NLA_U32 },
653 [TCA_FQ_RATE_ENABLE] = { .type = NLA_U32 },
654 [TCA_FQ_FLOW_DEFAULT_RATE] = { .type = NLA_U32 },
655 [TCA_FQ_FLOW_MAX_RATE] = { .type = NLA_U32 },
656 [TCA_FQ_BUCKETS_LOG] = { .type = NLA_U32 },
657 [TCA_FQ_FLOW_REFILL_DELAY] = { .type = NLA_U32 },
658};
659
660static int fq_change(struct Qdisc *sch, struct nlattr *opt)
661{
662 struct fq_sched_data *q = qdisc_priv(sch);
663 struct nlattr *tb[TCA_FQ_MAX + 1];
664 int err, drop_count = 0;
665 unsigned drop_len = 0;
666 u32 fq_log;
667
668 if (!opt)
669 return -EINVAL;
670
671 err = nla_parse_nested(tb, TCA_FQ_MAX, opt, fq_policy);
672 if (err < 0)
673 return err;
674
675 sch_tree_lock(sch);
676
677 fq_log = q->fq_trees_log;
678
679 if (tb[TCA_FQ_BUCKETS_LOG]) {
680 u32 nval = nla_get_u32(tb[TCA_FQ_BUCKETS_LOG]);
681
682 if (nval >= 1 && nval <= ilog2(256*1024))
683 fq_log = nval;
684 else
685 err = -EINVAL;
686 }
687 if (tb[TCA_FQ_PLIMIT])
688 sch->limit = nla_get_u32(tb[TCA_FQ_PLIMIT]);
689
690 if (tb[TCA_FQ_FLOW_PLIMIT])
691 q->flow_plimit = nla_get_u32(tb[TCA_FQ_FLOW_PLIMIT]);
692
693 if (tb[TCA_FQ_QUANTUM]) {
694 u32 quantum = nla_get_u32(tb[TCA_FQ_QUANTUM]);
695
696 if (quantum > 0)
697 q->quantum = quantum;
698 else
699 err = -EINVAL;
700 }
701
702 if (tb[TCA_FQ_INITIAL_QUANTUM])
703 q->initial_quantum = nla_get_u32(tb[TCA_FQ_INITIAL_QUANTUM]);
704
705 if (tb[TCA_FQ_FLOW_DEFAULT_RATE])
706 pr_warn_ratelimited("sch_fq: defrate %u ignored.\n",
707 nla_get_u32(tb[TCA_FQ_FLOW_DEFAULT_RATE]));
708
709 if (tb[TCA_FQ_FLOW_MAX_RATE])
710 q->flow_max_rate = nla_get_u32(tb[TCA_FQ_FLOW_MAX_RATE]);
711
712 if (tb[TCA_FQ_RATE_ENABLE]) {
713 u32 enable = nla_get_u32(tb[TCA_FQ_RATE_ENABLE]);
714
715 if (enable <= 1)
716 q->rate_enable = enable;
717 else
718 err = -EINVAL;
719 }
720
721 if (tb[TCA_FQ_FLOW_REFILL_DELAY]) {
722 u32 usecs_delay = nla_get_u32(tb[TCA_FQ_FLOW_REFILL_DELAY]) ;
723
724 q->flow_refill_delay = usecs_to_jiffies(usecs_delay);
725 }
726
727 if (tb[TCA_FQ_ORPHAN_MASK])
728 q->orphan_mask = nla_get_u32(tb[TCA_FQ_ORPHAN_MASK]);
729
730 if (!err) {
731 sch_tree_unlock(sch);
732 err = fq_resize(sch, fq_log);
733 sch_tree_lock(sch);
734 }
735 while (sch->q.qlen > sch->limit) {
736 struct sk_buff *skb = fq_dequeue(sch);
737
738 if (!skb)
739 break;
740 drop_len += qdisc_pkt_len(skb);
741 kfree_skb(skb);
742 drop_count++;
743 }
744 qdisc_tree_reduce_backlog(sch, drop_count, drop_len);
745
746 sch_tree_unlock(sch);
747 return err;
748}
749
750static void fq_destroy(struct Qdisc *sch)
751{
752 struct fq_sched_data *q = qdisc_priv(sch);
753
754 fq_reset(sch);
755 fq_free(q->fq_root);
756 qdisc_watchdog_cancel(&q->watchdog);
757}
758
759static int fq_init(struct Qdisc *sch, struct nlattr *opt)
760{
761 struct fq_sched_data *q = qdisc_priv(sch);
762 int err;
763
764 sch->limit = 10000;
765 q->flow_plimit = 100;
766 q->quantum = 2 * psched_mtu(qdisc_dev(sch));
767 q->initial_quantum = 10 * psched_mtu(qdisc_dev(sch));
768 q->flow_refill_delay = msecs_to_jiffies(40);
769 q->flow_max_rate = ~0U;
770 q->rate_enable = 1;
771 q->new_flows.first = NULL;
772 q->old_flows.first = NULL;
773 q->delayed = RB_ROOT;
774 q->fq_root = NULL;
775 q->fq_trees_log = ilog2(1024);
776 q->orphan_mask = 1024 - 1;
777 qdisc_watchdog_init(&q->watchdog, sch);
778
779 if (opt)
780 err = fq_change(sch, opt);
781 else
782 err = fq_resize(sch, q->fq_trees_log);
783
784 return err;
785}
786
787static int fq_dump(struct Qdisc *sch, struct sk_buff *skb)
788{
789 struct fq_sched_data *q = qdisc_priv(sch);
790 struct nlattr *opts;
791
792 opts = nla_nest_start(skb, TCA_OPTIONS);
793 if (opts == NULL)
794 goto nla_put_failure;
795
796 /* TCA_FQ_FLOW_DEFAULT_RATE is not used anymore */
797
798 if (nla_put_u32(skb, TCA_FQ_PLIMIT, sch->limit) ||
799 nla_put_u32(skb, TCA_FQ_FLOW_PLIMIT, q->flow_plimit) ||
800 nla_put_u32(skb, TCA_FQ_QUANTUM, q->quantum) ||
801 nla_put_u32(skb, TCA_FQ_INITIAL_QUANTUM, q->initial_quantum) ||
802 nla_put_u32(skb, TCA_FQ_RATE_ENABLE, q->rate_enable) ||
803 nla_put_u32(skb, TCA_FQ_FLOW_MAX_RATE, q->flow_max_rate) ||
804 nla_put_u32(skb, TCA_FQ_FLOW_REFILL_DELAY,
805 jiffies_to_usecs(q->flow_refill_delay)) ||
806 nla_put_u32(skb, TCA_FQ_ORPHAN_MASK, q->orphan_mask) ||
807 nla_put_u32(skb, TCA_FQ_BUCKETS_LOG, q->fq_trees_log))
808 goto nla_put_failure;
809
810 return nla_nest_end(skb, opts);
811
812nla_put_failure:
813 return -1;
814}
815
816static int fq_dump_stats(struct Qdisc *sch, struct gnet_dump *d)
817{
818 struct fq_sched_data *q = qdisc_priv(sch);
819 u64 now = ktime_get_ns();
820 struct tc_fq_qd_stats st = {
821 .gc_flows = q->stat_gc_flows,
822 .highprio_packets = q->stat_internal_packets,
823 .tcp_retrans = q->stat_tcp_retrans,
824 .throttled = q->stat_throttled,
825 .flows_plimit = q->stat_flows_plimit,
826 .pkts_too_long = q->stat_pkts_too_long,
827 .allocation_errors = q->stat_allocation_errors,
828 .flows = q->flows,
829 .inactive_flows = q->inactive_flows,
830 .throttled_flows = q->throttled_flows,
831 .time_next_delayed_flow = q->time_next_delayed_flow - now,
832 };
833
834 return gnet_stats_copy_app(d, &st, sizeof(st));
835}
836
837static struct Qdisc_ops fq_qdisc_ops __read_mostly = {
838 .id = "fq",
839 .priv_size = sizeof(struct fq_sched_data),
840
841 .enqueue = fq_enqueue,
842 .dequeue = fq_dequeue,
843 .peek = qdisc_peek_dequeued,
844 .init = fq_init,
845 .reset = fq_reset,
846 .destroy = fq_destroy,
847 .change = fq_change,
848 .dump = fq_dump,
849 .dump_stats = fq_dump_stats,
850 .owner = THIS_MODULE,
851};
852
853static int __init fq_module_init(void)
854{
855 int ret;
856
857 fq_flow_cachep = kmem_cache_create("fq_flow_cache",
858 sizeof(struct fq_flow),
859 0, 0, NULL);
860 if (!fq_flow_cachep)
861 return -ENOMEM;
862
863 ret = register_qdisc(&fq_qdisc_ops);
864 if (ret)
865 kmem_cache_destroy(fq_flow_cachep);
866 return ret;
867}
868
869static void __exit fq_module_exit(void)
870{
871 unregister_qdisc(&fq_qdisc_ops);
872 kmem_cache_destroy(fq_flow_cachep);
873}
874
875module_init(fq_module_init)
876module_exit(fq_module_exit)
877MODULE_AUTHOR("Eric Dumazet");
878MODULE_LICENSE("GPL");