Merge tag 'pwm/for-6.2-rc1' of git://git.kernel.org/pub/scm/linux/kernel/git/thierry...
[linux-block.git] / net / sched / sch_generic.c
CommitLineData
2874c5fd 1// SPDX-License-Identifier: GPL-2.0-or-later
1da177e4
LT
2/*
3 * net/sched/sch_generic.c Generic packet scheduler routines.
4 *
1da177e4
LT
5 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
6 * Jamal Hadi Salim, <hadi@cyberus.ca> 990601
7 * - Ingress support
8 */
9
1da177e4 10#include <linux/bitops.h>
1da177e4
LT
11#include <linux/module.h>
12#include <linux/types.h>
13#include <linux/kernel.h>
14#include <linux/sched.h>
15#include <linux/string.h>
1da177e4 16#include <linux/errno.h>
1da177e4
LT
17#include <linux/netdevice.h>
18#include <linux/skbuff.h>
19#include <linux/rtnetlink.h>
20#include <linux/init.h>
21#include <linux/rcupdate.h>
22#include <linux/list.h>
5a0e3ad6 23#include <linux/slab.h>
07ce76aa 24#include <linux/if_vlan.h>
c5ad119f 25#include <linux/skb_array.h>
32d3e51a 26#include <linux/if_macvlan.h>
292f1c7f 27#include <net/sch_generic.h>
1da177e4 28#include <net/pkt_sched.h>
7fee226a 29#include <net/dst.h>
e543002f 30#include <trace/events/qdisc.h>
141b6b2a 31#include <trace/events/net.h>
f53c7239 32#include <net/xfrm.h>
1da177e4 33
34aedd3f 34/* Qdisc to use by default */
35const struct Qdisc_ops *default_qdisc_ops = &pfifo_fast_ops;
36EXPORT_SYMBOL(default_qdisc_ops);
37
dcad9ee9
YL
38static void qdisc_maybe_clear_missed(struct Qdisc *q,
39 const struct netdev_queue *txq)
40{
41 clear_bit(__QDISC_STATE_MISSED, &q->state);
42
43 /* Make sure the below netif_xmit_frozen_or_stopped()
44 * checking happens after clearing STATE_MISSED.
45 */
46 smp_mb__after_atomic();
47
48 /* Checking netif_xmit_frozen_or_stopped() again to
49 * make sure STATE_MISSED is set if the STATE_MISSED
50 * set by netif_tx_wake_queue()'s rescheduling of
51 * net_tx_action() is cleared by the above clear_bit().
52 */
53 if (!netif_xmit_frozen_or_stopped(txq))
54 set_bit(__QDISC_STATE_MISSED, &q->state);
c4fef01b
YL
55 else
56 set_bit(__QDISC_STATE_DRAINING, &q->state);
dcad9ee9
YL
57}
58
1da177e4
LT
59/* Main transmission queue. */
60
0463d4ae 61/* Modifications to data participating in scheduling must be protected with
5fb66229 62 * qdisc_lock(qdisc) spinlock.
0463d4ae
PM
63 *
64 * The idea is the following:
c7e4f3bb
DM
65 * - enqueue, dequeue are serialized via qdisc root lock
66 * - ingress filtering is also serialized via qdisc root lock
0463d4ae 67 * - updates to tree and tree walking are only done under the rtnl mutex.
1da177e4 68 */
70e57d5e 69
b88dd52c
ED
70#define SKB_XOFF_MAGIC ((struct sk_buff *)1UL)
71
70e57d5e
JF
72static inline struct sk_buff *__skb_dequeue_bad_txq(struct Qdisc *q)
73{
74 const struct netdev_queue *txq = q->dev_queue;
75 spinlock_t *lock = NULL;
76 struct sk_buff *skb;
77
78 if (q->flags & TCQ_F_NOLOCK) {
79 lock = qdisc_lock(q);
80 spin_lock(lock);
81 }
82
83 skb = skb_peek(&q->skb_bad_txq);
84 if (skb) {
85 /* check the reason of requeuing without tx lock first */
86 txq = skb_get_tx_queue(txq->dev, skb);
87 if (!netif_xmit_frozen_or_stopped(txq)) {
88 skb = __skb_dequeue(&q->skb_bad_txq);
89 if (qdisc_is_percpu_stats(q)) {
90 qdisc_qstats_cpu_backlog_dec(q, skb);
73eb628d 91 qdisc_qstats_cpu_qlen_dec(q);
70e57d5e
JF
92 } else {
93 qdisc_qstats_backlog_dec(q, skb);
94 q->q.qlen--;
95 }
96 } else {
b88dd52c 97 skb = SKB_XOFF_MAGIC;
dcad9ee9 98 qdisc_maybe_clear_missed(q, txq);
70e57d5e
JF
99 }
100 }
101
102 if (lock)
103 spin_unlock(lock);
104
105 return skb;
106}
107
108static inline struct sk_buff *qdisc_dequeue_skb_bad_txq(struct Qdisc *q)
109{
110 struct sk_buff *skb = skb_peek(&q->skb_bad_txq);
111
112 if (unlikely(skb))
113 skb = __skb_dequeue_bad_txq(q);
114
115 return skb;
116}
117
118static inline void qdisc_enqueue_skb_bad_txq(struct Qdisc *q,
119 struct sk_buff *skb)
120{
121 spinlock_t *lock = NULL;
122
123 if (q->flags & TCQ_F_NOLOCK) {
124 lock = qdisc_lock(q);
125 spin_lock(lock);
126 }
127
128 __skb_queue_tail(&q->skb_bad_txq, skb);
129
cce6294c
ED
130 if (qdisc_is_percpu_stats(q)) {
131 qdisc_qstats_cpu_backlog_inc(q, skb);
73eb628d 132 qdisc_qstats_cpu_qlen_inc(q);
cce6294c
ED
133 } else {
134 qdisc_qstats_backlog_inc(q, skb);
135 q->q.qlen++;
136 }
137
70e57d5e
JF
138 if (lock)
139 spin_unlock(lock);
140}
141
9c01c9f1 142static inline void dev_requeue_skb(struct sk_buff *skb, struct Qdisc *q)
c716a81a 143{
9c01c9f1 144 spinlock_t *lock = NULL;
9540d977 145
9c01c9f1
PA
146 if (q->flags & TCQ_F_NOLOCK) {
147 lock = qdisc_lock(q);
148 spin_lock(lock);
9540d977 149 }
c716a81a 150
9540d977
WY
151 while (skb) {
152 struct sk_buff *next = skb->next;
153
154 __skb_queue_tail(&q->gso_skb, skb);
155
9c01c9f1
PA
156 /* it's still part of the queue */
157 if (qdisc_is_percpu_stats(q)) {
158 qdisc_qstats_cpu_requeues_inc(q);
159 qdisc_qstats_cpu_backlog_inc(q, skb);
73eb628d 160 qdisc_qstats_cpu_qlen_inc(q);
9c01c9f1
PA
161 } else {
162 q->qstats.requeues++;
163 qdisc_qstats_backlog_inc(q, skb);
164 q->q.qlen++;
165 }
9540d977
WY
166
167 skb = next;
168 }
c4fef01b
YL
169
170 if (lock) {
9c01c9f1 171 spin_unlock(lock);
c4fef01b
YL
172 set_bit(__QDISC_STATE_MISSED, &q->state);
173 } else {
174 __netif_schedule(q);
175 }
a53851e2
JF
176}
177
55a93b3e
ED
178static void try_bulk_dequeue_skb(struct Qdisc *q,
179 struct sk_buff *skb,
b8358d70
JDB
180 const struct netdev_queue *txq,
181 int *packets)
5772e9a3 182{
55a93b3e 183 int bytelimit = qdisc_avail_bulklimit(txq) - skb->len;
5772e9a3
JDB
184
185 while (bytelimit > 0) {
55a93b3e 186 struct sk_buff *nskb = q->dequeue(q);
5772e9a3 187
55a93b3e 188 if (!nskb)
5772e9a3
JDB
189 break;
190
55a93b3e
ED
191 bytelimit -= nskb->len; /* covers GSO len */
192 skb->next = nskb;
193 skb = nskb;
b8358d70 194 (*packets)++; /* GSO counts as one pkt */
5772e9a3 195 }
a8305bff 196 skb_mark_not_on_list(skb);
5772e9a3
JDB
197}
198
4d202a0d
ED
199/* This variant of try_bulk_dequeue_skb() makes sure
200 * all skbs in the chain are for the same txq
201 */
202static void try_bulk_dequeue_skb_slow(struct Qdisc *q,
203 struct sk_buff *skb,
204 int *packets)
205{
206 int mapping = skb_get_queue_mapping(skb);
207 struct sk_buff *nskb;
208 int cnt = 0;
209
210 do {
211 nskb = q->dequeue(q);
212 if (!nskb)
213 break;
214 if (unlikely(skb_get_queue_mapping(nskb) != mapping)) {
70e57d5e 215 qdisc_enqueue_skb_bad_txq(q, nskb);
4d202a0d
ED
216 break;
217 }
218 skb->next = nskb;
219 skb = nskb;
220 } while (++cnt < 8);
221 (*packets) += cnt;
a8305bff 222 skb_mark_not_on_list(skb);
4d202a0d
ED
223}
224
5772e9a3
JDB
225/* Note that dequeue_skb can possibly return a SKB list (via skb->next).
226 * A requeued skb (via q->gso_skb) can also be a SKB list.
227 */
b8358d70
JDB
228static struct sk_buff *dequeue_skb(struct Qdisc *q, bool *validate,
229 int *packets)
c716a81a 230{
1abbe139 231 const struct netdev_queue *txq = q->dev_queue;
fd8e8d1a 232 struct sk_buff *skb = NULL;
554794de 233
b8358d70 234 *packets = 1;
a53851e2
JF
235 if (unlikely(!skb_queue_empty(&q->gso_skb))) {
236 spinlock_t *lock = NULL;
237
238 if (q->flags & TCQ_F_NOLOCK) {
239 lock = qdisc_lock(q);
240 spin_lock(lock);
241 }
242
243 skb = skb_peek(&q->gso_skb);
244
245 /* skb may be null if another cpu pulls gso_skb off in between
246 * empty check and lock.
247 */
248 if (!skb) {
249 if (lock)
250 spin_unlock(lock);
251 goto validate;
252 }
253
4d202a0d
ED
254 /* skb in gso_skb were already validated */
255 *validate = false;
f53c7239
SK
256 if (xfrm_offload(skb))
257 *validate = true;
ebf05982 258 /* check the reason of requeuing without tx lock first */
10c51b56 259 txq = skb_get_tx_queue(txq->dev, skb);
73466498 260 if (!netif_xmit_frozen_or_stopped(txq)) {
a53851e2
JF
261 skb = __skb_dequeue(&q->gso_skb);
262 if (qdisc_is_percpu_stats(q)) {
263 qdisc_qstats_cpu_backlog_dec(q, skb);
73eb628d 264 qdisc_qstats_cpu_qlen_dec(q);
a53851e2
JF
265 } else {
266 qdisc_qstats_backlog_dec(q, skb);
267 q->q.qlen--;
268 }
269 } else {
ebf05982 270 skb = NULL;
dcad9ee9 271 qdisc_maybe_clear_missed(q, txq);
a53851e2
JF
272 }
273 if (lock)
274 spin_unlock(lock);
e543002f 275 goto trace;
4d202a0d 276 }
a53851e2 277validate:
4d202a0d 278 *validate = true;
fd8e8d1a
JF
279
280 if ((q->flags & TCQ_F_ONETXQUEUE) &&
dcad9ee9
YL
281 netif_xmit_frozen_or_stopped(txq)) {
282 qdisc_maybe_clear_missed(q, txq);
fd8e8d1a 283 return skb;
dcad9ee9 284 }
fd8e8d1a 285
70e57d5e 286 skb = qdisc_dequeue_skb_bad_txq(q);
b88dd52c
ED
287 if (unlikely(skb)) {
288 if (skb == SKB_XOFF_MAGIC)
289 return NULL;
70e57d5e 290 goto bulk;
b88dd52c 291 }
fd8e8d1a 292 skb = q->dequeue(q);
4d202a0d
ED
293 if (skb) {
294bulk:
295 if (qdisc_may_bulk(q))
296 try_bulk_dequeue_skb(q, skb, txq, packets);
297 else
298 try_bulk_dequeue_skb_slow(q, skb, packets);
ebf05982 299 }
e543002f
JDB
300trace:
301 trace_qdisc_dequeue(q, txq, *packets, skb);
c716a81a
JHS
302 return skb;
303}
304
10297b99 305/*
10770bc2 306 * Transmit possibly several skbs, and handle the return status as
29cbcd85
AD
307 * required. Owning qdisc running bit guarantees that only one CPU
308 * can execute this function.
6c1361a6
KK
309 *
310 * Returns to the caller:
29b86cda
JF
311 * false - hardware queue frozen backoff
312 * true - feel free to send more pkts
6c1361a6 313 */
29b86cda
JF
314bool sch_direct_xmit(struct sk_buff *skb, struct Qdisc *q,
315 struct net_device *dev, struct netdev_queue *txq,
316 spinlock_t *root_lock, bool validate)
1da177e4 317{
5f1a485d 318 int ret = NETDEV_TX_BUSY;
f53c7239 319 bool again = false;
7698b4fc
DM
320
321 /* And release qdisc */
6b3ba914
JF
322 if (root_lock)
323 spin_unlock(root_lock);
c716a81a 324
55a93b3e
ED
325 /* Note that we validate skb (GSO, checksum, ...) outside of locks */
326 if (validate)
f53c7239
SK
327 skb = validate_xmit_skb_list(skb, dev, &again);
328
329#ifdef CONFIG_XFRM_OFFLOAD
330 if (unlikely(again)) {
331 if (root_lock)
332 spin_lock(root_lock);
333
334 dev_requeue_skb(skb, q);
335 return false;
336 }
337#endif
572a9d7b 338
3dcd493f 339 if (likely(skb)) {
55a93b3e
ED
340 HARD_TX_LOCK(dev, txq, smp_processor_id());
341 if (!netif_xmit_frozen_or_stopped(txq))
342 skb = dev_hard_start_xmit(skb, dev, txq, &ret);
dcad9ee9
YL
343 else
344 qdisc_maybe_clear_missed(q, txq);
c716a81a 345
55a93b3e 346 HARD_TX_UNLOCK(dev, txq);
3dcd493f 347 } else {
6b3ba914
JF
348 if (root_lock)
349 spin_lock(root_lock);
29b86cda 350 return true;
55a93b3e 351 }
6b3ba914
JF
352
353 if (root_lock)
354 spin_lock(root_lock);
c716a81a 355
29b86cda 356 if (!dev_xmit_complete(ret)) {
6c1361a6 357 /* Driver returned NETDEV_TX_BUSY - requeue skb */
e87cc472
JP
358 if (unlikely(ret != NETDEV_TX_BUSY))
359 net_warn_ratelimited("BUG %s code %d qlen %d\n",
360 dev->name, ret, q->q.qlen);
6c1361a6 361
29b86cda
JF
362 dev_requeue_skb(skb, q);
363 return false;
6c1361a6 364 }
c716a81a 365
29b86cda 366 return true;
1da177e4
LT
367}
368
bbd8a0d3
KK
369/*
370 * NOTE: Called under qdisc_lock(q) with locally disabled BH.
371 *
f9eb8aea 372 * running seqcount guarantees only one CPU can process
bbd8a0d3
KK
373 * this qdisc at a time. qdisc_lock(q) serializes queue accesses for
374 * this queue.
375 *
376 * netif_tx_lock serializes accesses to device driver.
377 *
378 * qdisc_lock(q) and netif_tx_lock are mutually exclusive,
379 * if one is grabbed, another must be free.
380 *
381 * Note, that this procedure can be called by a watchdog timer
382 *
383 * Returns to the caller:
384 * 0 - queue is empty or throttled.
385 * >0 - queue is not empty.
386 *
387 */
29b86cda 388static inline bool qdisc_restart(struct Qdisc *q, int *packets)
bbd8a0d3 389{
6b3ba914 390 spinlock_t *root_lock = NULL;
bbd8a0d3
KK
391 struct netdev_queue *txq;
392 struct net_device *dev;
bbd8a0d3 393 struct sk_buff *skb;
32f7b44d 394 bool validate;
bbd8a0d3
KK
395
396 /* Dequeue packet */
b8358d70 397 skb = dequeue_skb(q, &validate, packets);
32f7b44d 398 if (unlikely(!skb))
29b86cda 399 return false;
10c51b56 400
32f7b44d 401 if (!(q->flags & TCQ_F_NOLOCK))
6b3ba914
JF
402 root_lock = qdisc_lock(q);
403
bbd8a0d3 404 dev = qdisc_dev(q);
10c51b56 405 txq = skb_get_tx_queue(dev, skb);
bbd8a0d3 406
32f7b44d 407 return sch_direct_xmit(skb, q, dev, txq, root_lock, validate);
bbd8a0d3
KK
408}
409
37437bb2 410void __qdisc_run(struct Qdisc *q)
48d83325 411{
bf955b5a 412 int quota = READ_ONCE(dev_tx_weight);
b8358d70 413 int packets;
2ba2506c 414
b8358d70 415 while (qdisc_restart(q, &packets)) {
b8358d70 416 quota -= packets;
b60fa1c5 417 if (quota <= 0) {
c4fef01b
YL
418 if (q->flags & TCQ_F_NOLOCK)
419 set_bit(__QDISC_STATE_MISSED, &q->state);
420 else
421 __netif_schedule(q);
422
d90df3ad 423 break;
2ba2506c
HX
424 }
425 }
48d83325
HX
426}
427
9d21493b
ED
428unsigned long dev_trans_start(struct net_device *dev)
429{
4873a1b2
VO
430 unsigned long res = READ_ONCE(netdev_get_tx_queue(dev, 0)->trans_start);
431 unsigned long val;
9d21493b
ED
432 unsigned int i;
433
9b36627a 434 for (i = 1; i < dev->num_tx_queues; i++) {
5337824f 435 val = READ_ONCE(netdev_get_tx_queue(dev, i)->trans_start);
9d21493b
ED
436 if (val && time_after(val, res))
437 res = val;
438 }
07ce76aa 439
9d21493b
ED
440 return res;
441}
442EXPORT_SYMBOL(dev_trans_start);
443
dab8fe32
ED
444static void netif_freeze_queues(struct net_device *dev)
445{
446 unsigned int i;
447 int cpu;
448
449 cpu = smp_processor_id();
450 for (i = 0; i < dev->num_tx_queues; i++) {
451 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
452
453 /* We are the only thread of execution doing a
454 * freeze, but we have to grab the _xmit_lock in
455 * order to synchronize with threads which are in
456 * the ->hard_start_xmit() handler and already
457 * checked the frozen bit.
458 */
459 __netif_tx_lock(txq, cpu);
460 set_bit(__QUEUE_STATE_FROZEN, &txq->state);
461 __netif_tx_unlock(txq);
462 }
463}
464
465void netif_tx_lock(struct net_device *dev)
466{
467 spin_lock(&dev->tx_global_lock);
468 netif_freeze_queues(dev);
469}
470EXPORT_SYMBOL(netif_tx_lock);
471
472static void netif_unfreeze_queues(struct net_device *dev)
473{
474 unsigned int i;
475
476 for (i = 0; i < dev->num_tx_queues; i++) {
477 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
478
479 /* No need to grab the _xmit_lock here. If the
480 * queue is not stopped for another reason, we
481 * force a schedule.
482 */
483 clear_bit(__QUEUE_STATE_FROZEN, &txq->state);
484 netif_schedule_queue(txq);
485 }
486}
487
488void netif_tx_unlock(struct net_device *dev)
489{
490 netif_unfreeze_queues(dev);
491 spin_unlock(&dev->tx_global_lock);
492}
493EXPORT_SYMBOL(netif_tx_unlock);
494
cdeabbb8 495static void dev_watchdog(struct timer_list *t)
1da177e4 496{
cdeabbb8 497 struct net_device *dev = from_timer(dev, t, watchdog_timer);
f12bf6f3 498 bool release = true;
1da177e4 499
bec251bc 500 spin_lock(&dev->tx_global_lock);
e8a0464c 501 if (!qdisc_tx_is_noop(dev)) {
1da177e4
LT
502 if (netif_device_present(dev) &&
503 netif_running(dev) &&
504 netif_carrier_ok(dev)) {
9d21493b 505 int some_queue_timedout = 0;
e8a0464c 506 unsigned int i;
9d21493b 507 unsigned long trans_start;
e8a0464c
DM
508
509 for (i = 0; i < dev->num_tx_queues; i++) {
510 struct netdev_queue *txq;
511
512 txq = netdev_get_tx_queue(dev, i);
5337824f 513 trans_start = READ_ONCE(txq->trans_start);
73466498 514 if (netif_xmit_stopped(txq) &&
9d21493b
ED
515 time_after(jiffies, (trans_start +
516 dev->watchdog_timeo))) {
517 some_queue_timedout = 1;
8160fb43 518 atomic_long_inc(&txq->trans_timeout);
e8a0464c
DM
519 break;
520 }
521 }
338f7566 522
bec251bc 523 if (unlikely(some_queue_timedout)) {
141b6b2a 524 trace_net_dev_xmit_timeout(dev, i);
9d21493b 525 WARN_ONCE(1, KERN_INFO "NETDEV WATCHDOG: %s (%s): transmit queue %u timed out\n",
3019de12 526 dev->name, netdev_drivername(dev), i);
bec251bc 527 netif_freeze_queues(dev);
0290bd29 528 dev->netdev_ops->ndo_tx_timeout(dev, i);
bec251bc 529 netif_unfreeze_queues(dev);
1da177e4 530 }
e8a0464c
DM
531 if (!mod_timer(&dev->watchdog_timer,
532 round_jiffies(jiffies +
533 dev->watchdog_timeo)))
f12bf6f3 534 release = false;
1da177e4
LT
535 }
536 }
bec251bc 537 spin_unlock(&dev->tx_global_lock);
1da177e4 538
f12bf6f3 539 if (release)
d62607c3 540 netdev_put(dev, &dev->watchdog_dev_tracker);
1da177e4
LT
541}
542
1da177e4
LT
543void __netdev_watchdog_up(struct net_device *dev)
544{
d314774c 545 if (dev->netdev_ops->ndo_tx_timeout) {
1da177e4
LT
546 if (dev->watchdog_timeo <= 0)
547 dev->watchdog_timeo = 5*HZ;
60468d5b
VP
548 if (!mod_timer(&dev->watchdog_timer,
549 round_jiffies(jiffies + dev->watchdog_timeo)))
d62607c3
JK
550 netdev_hold(dev, &dev->watchdog_dev_tracker,
551 GFP_ATOMIC);
1da177e4
LT
552 }
553}
1a3db27a 554EXPORT_SYMBOL_GPL(__netdev_watchdog_up);
1da177e4
LT
555
556static void dev_watchdog_up(struct net_device *dev)
557{
1da177e4 558 __netdev_watchdog_up(dev);
1da177e4
LT
559}
560
561static void dev_watchdog_down(struct net_device *dev)
562{
932ff279 563 netif_tx_lock_bh(dev);
1da177e4 564 if (del_timer(&dev->watchdog_timer))
d62607c3 565 netdev_put(dev, &dev->watchdog_dev_tracker);
932ff279 566 netif_tx_unlock_bh(dev);
1da177e4
LT
567}
568
bea3348e
SH
569/**
570 * netif_carrier_on - set carrier
571 * @dev: network device
572 *
989723b0 573 * Device has detected acquisition of carrier.
bea3348e 574 */
0a242efc
DV
575void netif_carrier_on(struct net_device *dev)
576{
bfaae0f0 577 if (test_and_clear_bit(__LINK_STATE_NOCARRIER, &dev->state)) {
b4730016
DM
578 if (dev->reg_state == NETREG_UNINITIALIZED)
579 return;
b2d3bcfa 580 atomic_inc(&dev->carrier_up_count);
0a242efc 581 linkwatch_fire_event(dev);
bfaae0f0
JG
582 if (netif_running(dev))
583 __netdev_watchdog_up(dev);
584 }
0a242efc 585}
62e3ba1b 586EXPORT_SYMBOL(netif_carrier_on);
0a242efc 587
bea3348e
SH
588/**
589 * netif_carrier_off - clear carrier
590 * @dev: network device
591 *
592 * Device has detected loss of carrier.
593 */
0a242efc
DV
594void netif_carrier_off(struct net_device *dev)
595{
b4730016
DM
596 if (!test_and_set_bit(__LINK_STATE_NOCARRIER, &dev->state)) {
597 if (dev->reg_state == NETREG_UNINITIALIZED)
598 return;
b2d3bcfa 599 atomic_inc(&dev->carrier_down_count);
0a242efc 600 linkwatch_fire_event(dev);
b4730016 601 }
0a242efc 602}
62e3ba1b 603EXPORT_SYMBOL(netif_carrier_off);
0a242efc 604
490dceca
JK
605/**
606 * netif_carrier_event - report carrier state event
607 * @dev: network device
608 *
609 * Device has detected a carrier event but the carrier state wasn't changed.
610 * Use in drivers when querying carrier state asynchronously, to avoid missing
611 * events (link flaps) if link recovers before it's queried.
612 */
613void netif_carrier_event(struct net_device *dev)
614{
615 if (dev->reg_state == NETREG_UNINITIALIZED)
616 return;
617 atomic_inc(&dev->carrier_up_count);
618 atomic_inc(&dev->carrier_down_count);
619 linkwatch_fire_event(dev);
620}
621EXPORT_SYMBOL_GPL(netif_carrier_event);
622
1da177e4
LT
623/* "NOOP" scheduler: the best scheduler, recommended for all interfaces
624 under all circumstances. It is difficult to invent anything faster or
625 cheaper.
626 */
627
520ac30f
ED
628static int noop_enqueue(struct sk_buff *skb, struct Qdisc *qdisc,
629 struct sk_buff **to_free)
1da177e4 630{
520ac30f 631 __qdisc_drop(skb, to_free);
1da177e4
LT
632 return NET_XMIT_CN;
633}
634
82d567c2 635static struct sk_buff *noop_dequeue(struct Qdisc *qdisc)
1da177e4
LT
636{
637 return NULL;
638}
639
20fea08b 640struct Qdisc_ops noop_qdisc_ops __read_mostly = {
1da177e4
LT
641 .id = "noop",
642 .priv_size = 0,
643 .enqueue = noop_enqueue,
644 .dequeue = noop_dequeue,
99c0db26 645 .peek = noop_dequeue,
1da177e4
LT
646 .owner = THIS_MODULE,
647};
648
7698b4fc 649static struct netdev_queue noop_netdev_queue = {
3b40bf4e 650 RCU_POINTER_INITIALIZER(qdisc, &noop_qdisc),
9f3ffae0 651 .qdisc_sleeping = &noop_qdisc,
7698b4fc
DM
652};
653
1da177e4
LT
654struct Qdisc noop_qdisc = {
655 .enqueue = noop_enqueue,
656 .dequeue = noop_dequeue,
657 .flags = TCQ_F_BUILTIN,
10297b99 658 .ops = &noop_qdisc_ops,
83874000 659 .q.lock = __SPIN_LOCK_UNLOCKED(noop_qdisc.q.lock),
7698b4fc 660 .dev_queue = &noop_netdev_queue,
7b5edbc4 661 .busylock = __SPIN_LOCK_UNLOCKED(noop_qdisc.busylock),
f98ebd47
ED
662 .gso_skb = {
663 .next = (struct sk_buff *)&noop_qdisc.gso_skb,
664 .prev = (struct sk_buff *)&noop_qdisc.gso_skb,
665 .qlen = 0,
666 .lock = __SPIN_LOCK_UNLOCKED(noop_qdisc.gso_skb.lock),
667 },
668 .skb_bad_txq = {
669 .next = (struct sk_buff *)&noop_qdisc.skb_bad_txq,
670 .prev = (struct sk_buff *)&noop_qdisc.skb_bad_txq,
671 .qlen = 0,
672 .lock = __SPIN_LOCK_UNLOCKED(noop_qdisc.skb_bad_txq.lock),
673 },
1da177e4 674};
62e3ba1b 675EXPORT_SYMBOL(noop_qdisc);
1da177e4 676
e63d7dfd
AA
677static int noqueue_init(struct Qdisc *qdisc, struct nlattr *opt,
678 struct netlink_ext_ack *extack)
d66d6c31
PS
679{
680 /* register_qdisc() assigns a default of noop_enqueue if unset,
681 * but __dev_queue_xmit() treats noqueue only as such
682 * if this is NULL - so clear it here. */
683 qdisc->enqueue = NULL;
684 return 0;
685}
686
687struct Qdisc_ops noqueue_qdisc_ops __read_mostly = {
1da177e4
LT
688 .id = "noqueue",
689 .priv_size = 0,
d66d6c31 690 .init = noqueue_init,
1da177e4
LT
691 .enqueue = noop_enqueue,
692 .dequeue = noop_dequeue,
99c0db26 693 .peek = noop_dequeue,
1da177e4
LT
694 .owner = THIS_MODULE,
695};
696
cc7ec456
ED
697static const u8 prio2band[TC_PRIO_MAX + 1] = {
698 1, 2, 2, 2, 1, 2, 0, 0 , 1, 1, 1, 1, 1, 1, 1, 1
699};
d3678b46
DM
700
701/* 3-band FIFO queue: old style, but should be a bit faster than
702 generic prio+fifo combination.
703 */
704
705#define PFIFO_FAST_BANDS 3
706
fd3ae5e8
KK
707/*
708 * Private data for a pfifo_fast scheduler containing:
c5ad119f 709 * - rings for priority bands
fd3ae5e8
KK
710 */
711struct pfifo_fast_priv {
c5ad119f 712 struct skb_array q[PFIFO_FAST_BANDS];
fd3ae5e8
KK
713};
714
c5ad119f
JF
715static inline struct skb_array *band2list(struct pfifo_fast_priv *priv,
716 int band)
d3678b46 717{
c5ad119f 718 return &priv->q[band];
d3678b46
DM
719}
720
520ac30f
ED
721static int pfifo_fast_enqueue(struct sk_buff *skb, struct Qdisc *qdisc,
722 struct sk_buff **to_free)
321090e7 723{
c5ad119f
JF
724 int band = prio2band[skb->priority & TC_PRIO_MAX];
725 struct pfifo_fast_priv *priv = qdisc_priv(qdisc);
726 struct skb_array *q = band2list(priv, band);
cce6294c 727 unsigned int pkt_len = qdisc_pkt_len(skb);
c5ad119f 728 int err;
821d24ae 729
c5ad119f
JF
730 err = skb_array_produce(q, skb);
731
092e22e5
DC
732 if (unlikely(err)) {
733 if (qdisc_is_percpu_stats(qdisc))
734 return qdisc_drop_cpu(skb, qdisc, to_free);
735 else
736 return qdisc_drop(skb, qdisc, to_free);
737 }
c5ad119f 738
8a53e616 739 qdisc_update_stats_at_enqueue(qdisc, pkt_len);
c5ad119f 740 return NET_XMIT_SUCCESS;
1da177e4
LT
741}
742
cc7ec456 743static struct sk_buff *pfifo_fast_dequeue(struct Qdisc *qdisc)
1da177e4 744{
fd3ae5e8 745 struct pfifo_fast_priv *priv = qdisc_priv(qdisc);
c5ad119f 746 struct sk_buff *skb = NULL;
a90c57f2 747 bool need_retry = true;
c5ad119f 748 int band;
ec323368 749
a90c57f2 750retry:
c5ad119f
JF
751 for (band = 0; band < PFIFO_FAST_BANDS && !skb; band++) {
752 struct skb_array *q = band2list(priv, band);
fd3ae5e8 753
c5ad119f
JF
754 if (__skb_array_empty(q))
755 continue;
fd3ae5e8 756
021a17ed 757 skb = __skb_array_consume(q);
c5ad119f
JF
758 }
759 if (likely(skb)) {
8a53e616 760 qdisc_update_stats_at_dequeue(qdisc, skb);
a90c57f2 761 } else if (need_retry &&
c4fef01b 762 READ_ONCE(qdisc->state) & QDISC_STATE_NON_EMPTY) {
a90c57f2
YL
763 /* Delay clearing the STATE_MISSED here to reduce
764 * the overhead of the second spin_trylock() in
765 * qdisc_run_begin() and __netif_schedule() calling
766 * in qdisc_run_end().
767 */
768 clear_bit(__QDISC_STATE_MISSED, &qdisc->state);
c4fef01b 769 clear_bit(__QDISC_STATE_DRAINING, &qdisc->state);
a90c57f2
YL
770
771 /* Make sure dequeuing happens after clearing
772 * STATE_MISSED.
773 */
774 smp_mb__after_atomic();
775
776 need_retry = false;
777
778 goto retry;
d3678b46 779 }
f87a9c3d 780
c5ad119f 781 return skb;
1da177e4
LT
782}
783
cc7ec456 784static struct sk_buff *pfifo_fast_peek(struct Qdisc *qdisc)
99c0db26 785{
fd3ae5e8 786 struct pfifo_fast_priv *priv = qdisc_priv(qdisc);
c5ad119f
JF
787 struct sk_buff *skb = NULL;
788 int band;
fd3ae5e8 789
c5ad119f
JF
790 for (band = 0; band < PFIFO_FAST_BANDS && !skb; band++) {
791 struct skb_array *q = band2list(priv, band);
99c0db26 792
c5ad119f 793 skb = __skb_array_peek(q);
99c0db26
JP
794 }
795
c5ad119f 796 return skb;
99c0db26
JP
797}
798
cc7ec456 799static void pfifo_fast_reset(struct Qdisc *qdisc)
1da177e4 800{
c5ad119f 801 int i, band;
fd3ae5e8 802 struct pfifo_fast_priv *priv = qdisc_priv(qdisc);
d3678b46 803
c5ad119f
JF
804 for (band = 0; band < PFIFO_FAST_BANDS; band++) {
805 struct skb_array *q = band2list(priv, band);
806 struct sk_buff *skb;
d3678b46 807
1df94c3c
CW
808 /* NULL ring is possible if destroy path is due to a failed
809 * skb_array_init() in pfifo_fast_init() case.
810 */
811 if (!q->ring.queue)
812 continue;
813
021a17ed 814 while ((skb = __skb_array_consume(q)) != NULL)
c5ad119f
JF
815 kfree_skb(skb);
816 }
817
04d37cf4
DC
818 if (qdisc_is_percpu_stats(qdisc)) {
819 for_each_possible_cpu(i) {
820 struct gnet_stats_queue *q;
c5ad119f 821
04d37cf4
DC
822 q = per_cpu_ptr(qdisc->cpu_qstats, i);
823 q->backlog = 0;
824 q->qlen = 0;
825 }
c5ad119f 826 }
1da177e4
LT
827}
828
d3678b46
DM
829static int pfifo_fast_dump(struct Qdisc *qdisc, struct sk_buff *skb)
830{
831 struct tc_prio_qopt opt = { .bands = PFIFO_FAST_BANDS };
832
cc7ec456 833 memcpy(&opt.priomap, prio2band, TC_PRIO_MAX + 1);
1b34ec43
DM
834 if (nla_put(skb, TCA_OPTIONS, sizeof(opt), &opt))
835 goto nla_put_failure;
d3678b46
DM
836 return skb->len;
837
838nla_put_failure:
839 return -1;
840}
841
e63d7dfd
AA
842static int pfifo_fast_init(struct Qdisc *qdisc, struct nlattr *opt,
843 struct netlink_ext_ack *extack)
d3678b46 844{
c5ad119f 845 unsigned int qlen = qdisc_dev(qdisc)->tx_queue_len;
fd3ae5e8 846 struct pfifo_fast_priv *priv = qdisc_priv(qdisc);
c5ad119f
JF
847 int prio;
848
849 /* guard against zero length rings */
850 if (!qlen)
851 return -EINVAL;
d3678b46 852
c5ad119f
JF
853 for (prio = 0; prio < PFIFO_FAST_BANDS; prio++) {
854 struct skb_array *q = band2list(priv, prio);
855 int err;
856
857 err = skb_array_init(q, qlen, GFP_KERNEL);
858 if (err)
859 return -ENOMEM;
860 }
d3678b46 861
23624935
ED
862 /* Can by-pass the queue discipline */
863 qdisc->flags |= TCQ_F_CAN_BYPASS;
d3678b46
DM
864 return 0;
865}
866
c5ad119f
JF
867static void pfifo_fast_destroy(struct Qdisc *sch)
868{
869 struct pfifo_fast_priv *priv = qdisc_priv(sch);
870 int prio;
871
872 for (prio = 0; prio < PFIFO_FAST_BANDS; prio++) {
873 struct skb_array *q = band2list(priv, prio);
874
875 /* NULL ring is possible if destroy path is due to a failed
876 * skb_array_init() in pfifo_fast_init() case.
877 */
1df94c3c 878 if (!q->ring.queue)
c5ad119f
JF
879 continue;
880 /* Destroy ring but no need to kfree_skb because a call to
881 * pfifo_fast_reset() has already done that work.
882 */
883 ptr_ring_cleanup(&q->ring, NULL);
884 }
885}
886
7007ba63
CW
887static int pfifo_fast_change_tx_queue_len(struct Qdisc *sch,
888 unsigned int new_len)
889{
890 struct pfifo_fast_priv *priv = qdisc_priv(sch);
891 struct skb_array *bands[PFIFO_FAST_BANDS];
892 int prio;
893
894 for (prio = 0; prio < PFIFO_FAST_BANDS; prio++) {
895 struct skb_array *q = band2list(priv, prio);
896
897 bands[prio] = q;
898 }
899
900 return skb_array_resize_multiple(bands, PFIFO_FAST_BANDS, new_len,
901 GFP_KERNEL);
902}
903
6ec1c69a 904struct Qdisc_ops pfifo_fast_ops __read_mostly = {
d3678b46 905 .id = "pfifo_fast",
fd3ae5e8 906 .priv_size = sizeof(struct pfifo_fast_priv),
d3678b46
DM
907 .enqueue = pfifo_fast_enqueue,
908 .dequeue = pfifo_fast_dequeue,
99c0db26 909 .peek = pfifo_fast_peek,
d3678b46 910 .init = pfifo_fast_init,
c5ad119f 911 .destroy = pfifo_fast_destroy,
d3678b46
DM
912 .reset = pfifo_fast_reset,
913 .dump = pfifo_fast_dump,
7007ba63 914 .change_tx_queue_len = pfifo_fast_change_tx_queue_len,
1da177e4 915 .owner = THIS_MODULE,
c5ad119f 916 .static_flags = TCQ_F_NOLOCK | TCQ_F_CPUSTATS,
1da177e4 917};
1f27cde3 918EXPORT_SYMBOL(pfifo_fast_ops);
1da177e4 919
1a33e10e 920static struct lock_class_key qdisc_tx_busylock;
1a33e10e 921
5ce2d488 922struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
d0bd684d
AA
923 const struct Qdisc_ops *ops,
924 struct netlink_ext_ack *extack)
1da177e4 925{
1da177e4 926 struct Qdisc *sch;
846e463a 927 unsigned int size = sizeof(*sch) + ops->priv_size;
3d54b82f 928 int err = -ENOBUFS;
26aa0459
JSP
929 struct net_device *dev;
930
931 if (!dev_queue) {
d0bd684d 932 NL_SET_ERR_MSG(extack, "No device queue given");
26aa0459
JSP
933 err = -EINVAL;
934 goto errout;
935 }
1da177e4 936
26aa0459 937 dev = dev_queue->dev;
846e463a 938 sch = kzalloc_node(size, GFP_KERNEL, netdev_queue_numa_node_read(dev_queue));
f2cd2d3e 939
846e463a 940 if (!sch)
3d54b82f 941 goto errout;
a53851e2 942 __skb_queue_head_init(&sch->gso_skb);
70e57d5e 943 __skb_queue_head_init(&sch->skb_bad_txq);
50dc9a85 944 gnet_stats_basic_sync_init(&sch->bstats);
48da34b7 945 spin_lock_init(&sch->q.lock);
23d3b8bf 946
d59f5ffa
JF
947 if (ops->static_flags & TCQ_F_CPUSTATS) {
948 sch->cpu_bstats =
50dc9a85 949 netdev_alloc_pcpu_stats(struct gnet_stats_basic_sync);
d59f5ffa
JF
950 if (!sch->cpu_bstats)
951 goto errout1;
952
953 sch->cpu_qstats = alloc_percpu(struct gnet_stats_queue);
954 if (!sch->cpu_qstats) {
955 free_percpu(sch->cpu_bstats);
956 goto errout1;
957 }
958 }
959
79640a4c 960 spin_lock_init(&sch->busylock);
1a33e10e
CW
961 lockdep_set_class(&sch->busylock,
962 dev->qdisc_tx_busylock ?: &qdisc_tx_busylock);
963
96009c7d
PA
964 /* seqlock has the same scope of busylock, for NOLOCK qdisc */
965 spin_lock_init(&sch->seqlock);
06f5553e 966 lockdep_set_class(&sch->seqlock,
1a33e10e 967 dev->qdisc_tx_busylock ?: &qdisc_tx_busylock);
f9eb8aea 968
1da177e4 969 sch->ops = ops;
d59f5ffa 970 sch->flags = ops->static_flags;
1da177e4
LT
971 sch->enqueue = ops->enqueue;
972 sch->dequeue = ops->dequeue;
bb949fbd 973 sch->dev_queue = dev_queue;
d62607c3 974 netdev_hold(dev, &sch->dev_tracker, GFP_KERNEL);
7b936405 975 refcount_set(&sch->refcnt, 1);
3d54b82f
TG
976
977 return sch;
d59f5ffa 978errout1:
846e463a 979 kfree(sch);
3d54b82f 980errout:
01e123d7 981 return ERR_PTR(err);
3d54b82f
TG
982}
983
3511c913 984struct Qdisc *qdisc_create_dflt(struct netdev_queue *dev_queue,
d2a7f269 985 const struct Qdisc_ops *ops,
a38a9882
AA
986 unsigned int parentid,
987 struct netlink_ext_ack *extack)
3d54b82f
TG
988{
989 struct Qdisc *sch;
10297b99 990
a38a9882
AA
991 if (!try_module_get(ops->owner)) {
992 NL_SET_ERR_MSG(extack, "Failed to increase module reference counter");
166ee5b8 993 return NULL;
a38a9882 994 }
6da7c8fc 995
a38a9882 996 sch = qdisc_alloc(dev_queue, ops, extack);
166ee5b8
ED
997 if (IS_ERR(sch)) {
998 module_put(ops->owner);
999 return NULL;
1000 }
9f9afec4 1001 sch->parent = parentid;
3d54b82f 1002
f5a7833e
CW
1003 if (!ops->init || ops->init(sch, NULL, extack) == 0) {
1004 trace_qdisc_create(ops, dev_queue->dev, parentid);
1da177e4 1005 return sch;
f5a7833e 1006 }
1da177e4 1007
86bd446b 1008 qdisc_put(sch);
1da177e4
LT
1009 return NULL;
1010}
62e3ba1b 1011EXPORT_SYMBOL(qdisc_create_dflt);
1da177e4 1012
5fb66229 1013/* Under qdisc_lock(qdisc) and BH! */
1da177e4
LT
1014
1015void qdisc_reset(struct Qdisc *qdisc)
1016{
20fea08b 1017 const struct Qdisc_ops *ops = qdisc->ops;
1da177e4 1018
a34dac0b
CW
1019 trace_qdisc_reset(qdisc);
1020
1da177e4
LT
1021 if (ops->reset)
1022 ops->reset(qdisc);
67305ebc 1023
c9a40d1c
ED
1024 __skb_queue_purge(&qdisc->gso_skb);
1025 __skb_queue_purge(&qdisc->skb_bad_txq);
70e57d5e 1026
4d202a0d 1027 qdisc->q.qlen = 0;
c8e18129 1028 qdisc->qstats.backlog = 0;
1da177e4 1029}
62e3ba1b 1030EXPORT_SYMBOL(qdisc_reset);
1da177e4 1031
81d947e2 1032void qdisc_free(struct Qdisc *qdisc)
5d944c64 1033{
73c20a8b 1034 if (qdisc_is_percpu_stats(qdisc)) {
22e0f8b9 1035 free_percpu(qdisc->cpu_bstats);
73c20a8b
JF
1036 free_percpu(qdisc->cpu_qstats);
1037 }
22e0f8b9 1038
846e463a 1039 kfree(qdisc);
5d944c64
ED
1040}
1041
5362700c 1042static void qdisc_free_cb(struct rcu_head *head)
3a7d0d07
VB
1043{
1044 struct Qdisc *q = container_of(head, struct Qdisc, rcu);
1045
1046 qdisc_free(q);
1047}
1048
86bd446b 1049static void qdisc_destroy(struct Qdisc *qdisc)
1da177e4 1050{
8a34c5dc
DM
1051 const struct Qdisc_ops *ops = qdisc->ops;
1052
3a682fbd 1053#ifdef CONFIG_NET_SCHED
59cc1f61 1054 qdisc_hash_del(qdisc);
f6e0b239 1055
a2da570d 1056 qdisc_put_stab(rtnl_dereference(qdisc->stab));
3a682fbd 1057#endif
1c0d32fd 1058 gen_kill_estimator(&qdisc->rate_est);
4909daba
CW
1059
1060 qdisc_reset(qdisc);
1061
8a34c5dc
DM
1062 if (ops->destroy)
1063 ops->destroy(qdisc);
1064
1065 module_put(ops->owner);
d62607c3 1066 netdev_put(qdisc_dev(qdisc), &qdisc->dev_tracker);
8a34c5dc 1067
a34dac0b
CW
1068 trace_qdisc_destroy(qdisc);
1069
3a7d0d07 1070 call_rcu(&qdisc->rcu, qdisc_free_cb);
1da177e4 1071}
86bd446b
VB
1072
1073void qdisc_put(struct Qdisc *qdisc)
1074{
6efb971b
CW
1075 if (!qdisc)
1076 return;
1077
86bd446b
VB
1078 if (qdisc->flags & TCQ_F_BUILTIN ||
1079 !refcount_dec_and_test(&qdisc->refcnt))
1080 return;
1081
1082 qdisc_destroy(qdisc);
1083}
1084EXPORT_SYMBOL(qdisc_put);
1da177e4 1085
3a7d0d07
VB
1086/* Version of qdisc_put() that is called with rtnl mutex unlocked.
1087 * Intended to be used as optimization, this function only takes rtnl lock if
1088 * qdisc reference counter reached zero.
1089 */
1090
1091void qdisc_put_unlocked(struct Qdisc *qdisc)
1092{
1093 if (qdisc->flags & TCQ_F_BUILTIN ||
1094 !refcount_dec_and_rtnl_lock(&qdisc->refcnt))
1095 return;
1096
1097 qdisc_destroy(qdisc);
1098 rtnl_unlock();
1099}
1100EXPORT_SYMBOL(qdisc_put_unlocked);
1101
589983cd
PM
1102/* Attach toplevel qdisc to device queue. */
1103struct Qdisc *dev_graft_qdisc(struct netdev_queue *dev_queue,
1104 struct Qdisc *qdisc)
1105{
1106 struct Qdisc *oqdisc = dev_queue->qdisc_sleeping;
1107 spinlock_t *root_lock;
1108
1109 root_lock = qdisc_lock(oqdisc);
1110 spin_lock_bh(root_lock);
1111
589983cd
PM
1112 /* ... and graft new one */
1113 if (qdisc == NULL)
1114 qdisc = &noop_qdisc;
1115 dev_queue->qdisc_sleeping = qdisc;
1116 rcu_assign_pointer(dev_queue->qdisc, &noop_qdisc);
1117
1118 spin_unlock_bh(root_lock);
1119
1120 return oqdisc;
1121}
b8970f0b 1122EXPORT_SYMBOL(dev_graft_qdisc);
589983cd 1123
f612466e
WH
1124static void shutdown_scheduler_queue(struct net_device *dev,
1125 struct netdev_queue *dev_queue,
1126 void *_qdisc_default)
1127{
1128 struct Qdisc *qdisc = dev_queue->qdisc_sleeping;
1129 struct Qdisc *qdisc_default = _qdisc_default;
1130
1131 if (qdisc) {
1132 rcu_assign_pointer(dev_queue->qdisc, qdisc_default);
1133 dev_queue->qdisc_sleeping = qdisc_default;
1134
1135 qdisc_put(qdisc);
1136 }
1137}
1138
e8a0464c
DM
1139static void attach_one_default_qdisc(struct net_device *dev,
1140 struct netdev_queue *dev_queue,
1141 void *_unused)
1142{
3e692f21
PS
1143 struct Qdisc *qdisc;
1144 const struct Qdisc_ops *ops = default_qdisc_ops;
e8a0464c 1145
3e692f21
PS
1146 if (dev->priv_flags & IFF_NO_QUEUE)
1147 ops = &noqueue_qdisc_ops;
546b85bb
VP
1148 else if(dev->type == ARPHRD_CAN)
1149 ops = &pfifo_fast_ops;
3e692f21 1150
a38a9882 1151 qdisc = qdisc_create_dflt(dev_queue, ops, TC_H_ROOT, NULL);
bf6dba76 1152 if (!qdisc)
3e692f21 1153 return;
bf6dba76 1154
3e692f21 1155 if (!netif_is_multiqueue(dev))
4eaf3b84 1156 qdisc->flags |= TCQ_F_ONETXQUEUE | TCQ_F_NOPARENT;
e8a0464c
DM
1157 dev_queue->qdisc_sleeping = qdisc;
1158}
1159
6ec1c69a
DM
1160static void attach_default_qdiscs(struct net_device *dev)
1161{
1162 struct netdev_queue *txq;
1163 struct Qdisc *qdisc;
1164
1165 txq = netdev_get_tx_queue(dev, 0);
1166
4b469955 1167 if (!netif_is_multiqueue(dev) ||
4b469955 1168 dev->priv_flags & IFF_NO_QUEUE) {
6ec1c69a 1169 netdev_for_each_tx_queue(dev, attach_one_default_qdisc, NULL);
5891cd5e
ED
1170 qdisc = txq->qdisc_sleeping;
1171 rcu_assign_pointer(dev->qdisc, qdisc);
1172 qdisc_refcount_inc(qdisc);
6ec1c69a 1173 } else {
a38a9882 1174 qdisc = qdisc_create_dflt(txq, &mq_qdisc_ops, TC_H_ROOT, NULL);
6ec1c69a 1175 if (qdisc) {
5891cd5e 1176 rcu_assign_pointer(dev->qdisc, qdisc);
e57a784d 1177 qdisc->ops->attach(qdisc);
6ec1c69a
DM
1178 }
1179 }
5891cd5e 1180 qdisc = rtnl_dereference(dev->qdisc);
bf6dba76
JDB
1181
1182 /* Detect default qdisc setup/init failed and fallback to "noqueue" */
5891cd5e 1183 if (qdisc == &noop_qdisc) {
bf6dba76
JDB
1184 netdev_warn(dev, "default qdisc (%s) fail, fallback to %s\n",
1185 default_qdisc_ops->id, noqueue_qdisc_ops.id);
f612466e 1186 netdev_for_each_tx_queue(dev, shutdown_scheduler_queue, &noop_qdisc);
bf6dba76
JDB
1187 dev->priv_flags |= IFF_NO_QUEUE;
1188 netdev_for_each_tx_queue(dev, attach_one_default_qdisc, NULL);
5891cd5e
ED
1189 qdisc = txq->qdisc_sleeping;
1190 rcu_assign_pointer(dev->qdisc, qdisc);
1191 qdisc_refcount_inc(qdisc);
bf6dba76
JDB
1192 dev->priv_flags ^= IFF_NO_QUEUE;
1193 }
1194
59cc1f61 1195#ifdef CONFIG_NET_SCHED
5891cd5e
ED
1196 if (qdisc != &noop_qdisc)
1197 qdisc_hash_add(qdisc, false);
59cc1f61 1198#endif
6ec1c69a
DM
1199}
1200
e8a0464c
DM
1201static void transition_one_qdisc(struct net_device *dev,
1202 struct netdev_queue *dev_queue,
1203 void *_need_watchdog)
1204{
83874000 1205 struct Qdisc *new_qdisc = dev_queue->qdisc_sleeping;
e8a0464c
DM
1206 int *need_watchdog_p = _need_watchdog;
1207
a9312ae8
DM
1208 if (!(new_qdisc->flags & TCQ_F_BUILTIN))
1209 clear_bit(__QDISC_STATE_DEACTIVATED, &new_qdisc->state);
1210
83874000 1211 rcu_assign_pointer(dev_queue->qdisc, new_qdisc);
3e692f21 1212 if (need_watchdog_p) {
5337824f 1213 WRITE_ONCE(dev_queue->trans_start, 0);
e8a0464c 1214 *need_watchdog_p = 1;
9d21493b 1215 }
e8a0464c
DM
1216}
1217
1da177e4
LT
1218void dev_activate(struct net_device *dev)
1219{
e8a0464c 1220 int need_watchdog;
b0e1e646 1221
1da177e4 1222 /* No queueing discipline is attached to device;
6da7c8fc 1223 * create default one for devices, which need queueing
1224 * and noqueue_qdisc for virtual interfaces
1da177e4
LT
1225 */
1226
5891cd5e 1227 if (rtnl_dereference(dev->qdisc) == &noop_qdisc)
6ec1c69a 1228 attach_default_qdiscs(dev);
af356afa 1229
cacaddf5
TC
1230 if (!netif_carrier_ok(dev))
1231 /* Delay activation until next carrier-on event */
1232 return;
1233
e8a0464c
DM
1234 need_watchdog = 0;
1235 netdev_for_each_tx_queue(dev, transition_one_qdisc, &need_watchdog);
24824a09
ED
1236 if (dev_ingress_queue(dev))
1237 transition_one_qdisc(dev, dev_ingress_queue(dev), NULL);
e8a0464c
DM
1238
1239 if (need_watchdog) {
860e9538 1240 netif_trans_update(dev);
1da177e4
LT
1241 dev_watchdog_up(dev);
1242 }
b0e1e646 1243}
b8970f0b 1244EXPORT_SYMBOL(dev_activate);
b0e1e646 1245
70f50965
CW
1246static void qdisc_deactivate(struct Qdisc *qdisc)
1247{
70f50965
CW
1248 if (qdisc->flags & TCQ_F_BUILTIN)
1249 return;
70f50965
CW
1250
1251 set_bit(__QDISC_STATE_DEACTIVATED, &qdisc->state);
70f50965
CW
1252}
1253
e8a0464c
DM
1254static void dev_deactivate_queue(struct net_device *dev,
1255 struct netdev_queue *dev_queue,
1256 void *_qdisc_default)
b0e1e646 1257{
e8a0464c 1258 struct Qdisc *qdisc_default = _qdisc_default;
970565bb 1259 struct Qdisc *qdisc;
970565bb 1260
46e5da40 1261 qdisc = rtnl_dereference(dev_queue->qdisc);
b0e1e646 1262 if (qdisc) {
70f50965 1263 qdisc_deactivate(qdisc);
f7a54c13 1264 rcu_assign_pointer(dev_queue->qdisc, qdisc_default);
b0e1e646 1265 }
1da177e4
LT
1266}
1267
2fb541c8
YL
1268static void dev_reset_queue(struct net_device *dev,
1269 struct netdev_queue *dev_queue,
1270 void *_unused)
1271{
1272 struct Qdisc *qdisc;
1273 bool nolock;
1274
1275 qdisc = dev_queue->qdisc_sleeping;
1276 if (!qdisc)
1277 return;
1278
1279 nolock = qdisc->flags & TCQ_F_NOLOCK;
1280
1281 if (nolock)
1282 spin_lock_bh(&qdisc->seqlock);
1283 spin_lock_bh(qdisc_lock(qdisc));
1284
1285 qdisc_reset(qdisc);
1286
1287 spin_unlock_bh(qdisc_lock(qdisc));
102b55ee
YL
1288 if (nolock) {
1289 clear_bit(__QDISC_STATE_MISSED, &qdisc->state);
c4fef01b 1290 clear_bit(__QDISC_STATE_DRAINING, &qdisc->state);
2fb541c8 1291 spin_unlock_bh(&qdisc->seqlock);
102b55ee 1292 }
2fb541c8
YL
1293}
1294
4335cd2d 1295static bool some_qdisc_is_busy(struct net_device *dev)
e8a0464c
DM
1296{
1297 unsigned int i;
1298
1299 for (i = 0; i < dev->num_tx_queues; i++) {
1300 struct netdev_queue *dev_queue;
7698b4fc 1301 spinlock_t *root_lock;
e2627c8c 1302 struct Qdisc *q;
e8a0464c
DM
1303 int val;
1304
1305 dev_queue = netdev_get_tx_queue(dev, i);
b9a3b110 1306 q = dev_queue->qdisc_sleeping;
e8a0464c 1307
32f7b44d
PA
1308 root_lock = qdisc_lock(q);
1309 spin_lock_bh(root_lock);
e8a0464c 1310
32f7b44d
PA
1311 val = (qdisc_is_running(q) ||
1312 test_bit(__QDISC_STATE_SCHED, &q->state));
e8a0464c 1313
32f7b44d 1314 spin_unlock_bh(root_lock);
e8a0464c
DM
1315
1316 if (val)
1317 return true;
1318 }
1319 return false;
1320}
1321
3137663d
ED
1322/**
1323 * dev_deactivate_many - deactivate transmissions on several devices
1324 * @head: list of devices to deactivate
1325 *
1326 * This function returns only when all outstanding transmissions
1327 * have completed, unless all devices are in dismantle phase.
1328 */
44345724 1329void dev_deactivate_many(struct list_head *head)
1da177e4 1330{
44345724 1331 struct net_device *dev;
41a23b07 1332
5cde2829 1333 list_for_each_entry(dev, head, close_list) {
44345724
OP
1334 netdev_for_each_tx_queue(dev, dev_deactivate_queue,
1335 &noop_qdisc);
1336 if (dev_ingress_queue(dev))
1337 dev_deactivate_queue(dev, dev_ingress_queue(dev),
1338 &noop_qdisc);
1339
1340 dev_watchdog_down(dev);
1341 }
1da177e4 1342
2fb541c8
YL
1343 /* Wait for outstanding qdisc-less dev_queue_xmit calls or
1344 * outstanding qdisc enqueuing calls.
3137663d
ED
1345 * This is avoided if all devices are in dismantle phase :
1346 * Caller will call synchronize_net() for us
1347 */
7bbde83b 1348 synchronize_net();
1da177e4 1349
2fb541c8
YL
1350 list_for_each_entry(dev, head, close_list) {
1351 netdev_for_each_tx_queue(dev, dev_reset_queue, NULL);
1352
1353 if (dev_ingress_queue(dev))
1354 dev_reset_queue(dev, dev_ingress_queue(dev), NULL);
1355 }
1356
d4828d85 1357 /* Wait for outstanding qdisc_run calls. */
7bbde83b 1358 list_for_each_entry(dev, head, close_list) {
4eab421b
MKB
1359 while (some_qdisc_is_busy(dev)) {
1360 /* wait_event() would avoid this sleep-loop but would
1361 * require expensive checks in the fast paths of packet
1362 * processing which isn't worth it.
1363 */
1364 schedule_timeout_uninterruptible(1);
1365 }
7bbde83b 1366 }
44345724
OP
1367}
1368
1369void dev_deactivate(struct net_device *dev)
1370{
1371 LIST_HEAD(single);
1372
5cde2829 1373 list_add(&dev->close_list, &single);
44345724 1374 dev_deactivate_many(&single);
5f04d506 1375 list_del(&single);
1da177e4 1376}
b8970f0b 1377EXPORT_SYMBOL(dev_deactivate);
1da177e4 1378
48bfd55e
CW
1379static int qdisc_change_tx_queue_len(struct net_device *dev,
1380 struct netdev_queue *dev_queue)
1381{
1382 struct Qdisc *qdisc = dev_queue->qdisc_sleeping;
1383 const struct Qdisc_ops *ops = qdisc->ops;
1384
1385 if (ops->change_tx_queue_len)
1386 return ops->change_tx_queue_len(qdisc, dev->tx_queue_len);
1387 return 0;
1388}
1389
1e080f17
JK
1390void dev_qdisc_change_real_num_tx(struct net_device *dev,
1391 unsigned int new_real_tx)
1392{
5891cd5e 1393 struct Qdisc *qdisc = rtnl_dereference(dev->qdisc);
1e080f17
JK
1394
1395 if (qdisc->ops->change_real_num_tx)
1396 qdisc->ops->change_real_num_tx(qdisc, new_real_tx);
1397}
1398
f7116fb4
JK
1399void mq_change_real_num_tx(struct Qdisc *sch, unsigned int new_real_tx)
1400{
1401#ifdef CONFIG_NET_SCHED
1402 struct net_device *dev = qdisc_dev(sch);
1403 struct Qdisc *qdisc;
1404 unsigned int i;
1405
1406 for (i = new_real_tx; i < dev->real_num_tx_queues; i++) {
1407 qdisc = netdev_get_tx_queue(dev, i)->qdisc_sleeping;
1408 /* Only update the default qdiscs we created,
1409 * qdiscs with handles are always hashed.
1410 */
1411 if (qdisc != &noop_qdisc && !qdisc->handle)
1412 qdisc_hash_del(qdisc);
1413 }
1414 for (i = dev->real_num_tx_queues; i < new_real_tx; i++) {
1415 qdisc = netdev_get_tx_queue(dev, i)->qdisc_sleeping;
1416 if (qdisc != &noop_qdisc && !qdisc->handle)
1417 qdisc_hash_add(qdisc, false);
1418 }
1419#endif
1420}
1421EXPORT_SYMBOL(mq_change_real_num_tx);
1422
48bfd55e
CW
1423int dev_qdisc_change_tx_queue_len(struct net_device *dev)
1424{
1425 bool up = dev->flags & IFF_UP;
1426 unsigned int i;
1427 int ret = 0;
1428
1429 if (up)
1430 dev_deactivate(dev);
1431
1432 for (i = 0; i < dev->num_tx_queues; i++) {
1433 ret = qdisc_change_tx_queue_len(dev, &dev->_tx[i]);
1434
1435 /* TODO: revert changes on a partial failure */
1436 if (ret)
1437 break;
1438 }
1439
1440 if (up)
1441 dev_activate(dev);
1442 return ret;
1443}
1444
b0e1e646
DM
1445static void dev_init_scheduler_queue(struct net_device *dev,
1446 struct netdev_queue *dev_queue,
e8a0464c 1447 void *_qdisc)
b0e1e646 1448{
e8a0464c
DM
1449 struct Qdisc *qdisc = _qdisc;
1450
46e5da40 1451 rcu_assign_pointer(dev_queue->qdisc, qdisc);
b0e1e646 1452 dev_queue->qdisc_sleeping = qdisc;
b0e1e646
DM
1453}
1454
1da177e4
LT
1455void dev_init_scheduler(struct net_device *dev)
1456{
5891cd5e 1457 rcu_assign_pointer(dev->qdisc, &noop_qdisc);
e8a0464c 1458 netdev_for_each_tx_queue(dev, dev_init_scheduler_queue, &noop_qdisc);
24824a09
ED
1459 if (dev_ingress_queue(dev))
1460 dev_init_scheduler_queue(dev, dev_ingress_queue(dev), &noop_qdisc);
1da177e4 1461
cdeabbb8 1462 timer_setup(&dev->watchdog_timer, dev_watchdog, 0);
1da177e4
LT
1463}
1464
b0e1e646
DM
1465void dev_shutdown(struct net_device *dev)
1466{
e8a0464c 1467 netdev_for_each_tx_queue(dev, shutdown_scheduler_queue, &noop_qdisc);
24824a09
ED
1468 if (dev_ingress_queue(dev))
1469 shutdown_scheduler_queue(dev, dev_ingress_queue(dev), &noop_qdisc);
5891cd5e
ED
1470 qdisc_put(rtnl_dereference(dev->qdisc));
1471 rcu_assign_pointer(dev->qdisc, &noop_qdisc);
af356afa 1472
547b792c 1473 WARN_ON(timer_pending(&dev->watchdog_timer));
1da177e4 1474}
292f1c7f 1475
2ffe0395
BZ
1476/**
1477 * psched_ratecfg_precompute__() - Pre-compute values for reciprocal division
1478 * @rate: Rate to compute reciprocal division values of
1479 * @mult: Multiplier for reciprocal division
1480 * @shift: Shift for reciprocal division
1481 *
1482 * The multiplier and shift for reciprocal division by rate are stored
1483 * in mult and shift.
1484 *
1485 * The deal here is to replace a divide by a reciprocal one
1486 * in fast path (a reciprocal divide is a multiply and a shift)
1487 *
1488 * Normal formula would be :
1489 * time_in_ns = (NSEC_PER_SEC * len) / rate_bps
1490 *
1491 * We compute mult/shift to use instead :
1492 * time_in_ns = (len * mult) >> shift;
1493 *
1494 * We try to get the highest possible mult value for accuracy,
1495 * but have to make sure no overflows will ever happen.
1496 *
1497 * reciprocal_value() is not used here it doesn't handle 64-bit values.
1498 */
1499static void psched_ratecfg_precompute__(u64 rate, u32 *mult, u8 *shift)
1500{
1501 u64 factor = NSEC_PER_SEC;
1502
1503 *mult = 1;
1504 *shift = 0;
1505
1506 if (rate <= 0)
1507 return;
1508
1509 for (;;) {
1510 *mult = div64_u64(factor, rate);
1511 if (*mult & (1U << 31) || factor & (1ULL << 63))
1512 break;
1513 factor <<= 1;
1514 (*shift)++;
1515 }
1516}
1517
01cb71d2 1518void psched_ratecfg_precompute(struct psched_ratecfg *r,
3e1e3aae
ED
1519 const struct tc_ratespec *conf,
1520 u64 rate64)
292f1c7f 1521{
01cb71d2
ED
1522 memset(r, 0, sizeof(*r));
1523 r->overhead = conf->overhead;
fb80445c 1524 r->mpu = conf->mpu;
3e1e3aae 1525 r->rate_bytes_ps = max_t(u64, conf->rate, rate64);
8a8e3d84 1526 r->linklayer = (conf->linklayer & TC_LINKLAYER_MASK);
2ffe0395 1527 psched_ratecfg_precompute__(r->rate_bytes_ps, &r->mult, &r->shift);
292f1c7f
JP
1528}
1529EXPORT_SYMBOL(psched_ratecfg_precompute);
46209401 1530
2ffe0395
BZ
1531void psched_ppscfg_precompute(struct psched_pktrate *r, u64 pktrate64)
1532{
1533 r->rate_pkts_ps = pktrate64;
1534 psched_ratecfg_precompute__(r->rate_pkts_ps, &r->mult, &r->shift);
1535}
1536EXPORT_SYMBOL(psched_ppscfg_precompute);
1537
46209401
JP
1538void mini_qdisc_pair_swap(struct mini_Qdisc_pair *miniqp,
1539 struct tcf_proto *tp_head)
1540{
ed76f5ed
VB
1541 /* Protected with chain0->filter_chain_lock.
1542 * Can't access chain directly because tp_head can be NULL.
1543 */
1544 struct mini_Qdisc *miniq_old =
1545 rcu_dereference_protected(*miniqp->p_miniq, 1);
46209401
JP
1546 struct mini_Qdisc *miniq;
1547
1548 if (!tp_head) {
1549 RCU_INIT_POINTER(*miniqp->p_miniq, NULL);
26746382 1550 } else {
85c0c3eb 1551 miniq = miniq_old != &miniqp->miniq1 ?
26746382 1552 &miniqp->miniq1 : &miniqp->miniq2;
46209401 1553
26746382
SF
1554 /* We need to make sure that readers won't see the miniq
1555 * we are about to modify. So ensure that at least one RCU
1556 * grace period has elapsed since the miniq was made
1557 * inactive.
1558 */
1559 if (IS_ENABLED(CONFIG_PREEMPT_RT))
1560 cond_synchronize_rcu(miniq->rcu_state);
1561 else if (!poll_state_synchronize_rcu(miniq->rcu_state))
1562 synchronize_rcu_expedited();
46209401 1563
26746382
SF
1564 miniq->filter_list = tp_head;
1565 rcu_assign_pointer(*miniqp->p_miniq, miniq);
1566 }
46209401
JP
1567
1568 if (miniq_old)
26746382 1569 /* This is counterpart of the rcu sync above. We need to
46209401
JP
1570 * block potential new user of miniq_old until all readers
1571 * are not seeing it.
1572 */
26746382 1573 miniq_old->rcu_state = start_poll_synchronize_rcu();
46209401
JP
1574}
1575EXPORT_SYMBOL(mini_qdisc_pair_swap);
1576
7d17c544
PB
1577void mini_qdisc_pair_block_init(struct mini_Qdisc_pair *miniqp,
1578 struct tcf_block *block)
1579{
1580 miniqp->miniq1.block = block;
1581 miniqp->miniq2.block = block;
1582}
1583EXPORT_SYMBOL(mini_qdisc_pair_block_init);
1584
46209401
JP
1585void mini_qdisc_pair_init(struct mini_Qdisc_pair *miniqp, struct Qdisc *qdisc,
1586 struct mini_Qdisc __rcu **p_miniq)
1587{
1588 miniqp->miniq1.cpu_bstats = qdisc->cpu_bstats;
1589 miniqp->miniq1.cpu_qstats = qdisc->cpu_qstats;
1590 miniqp->miniq2.cpu_bstats = qdisc->cpu_bstats;
1591 miniqp->miniq2.cpu_qstats = qdisc->cpu_qstats;
26746382
SF
1592 miniqp->miniq1.rcu_state = get_state_synchronize_rcu();
1593 miniqp->miniq2.rcu_state = miniqp->miniq1.rcu_state;
46209401
JP
1594 miniqp->p_miniq = p_miniq;
1595}
1596EXPORT_SYMBOL(mini_qdisc_pair_init);