License cleanup: add SPDX GPL-2.0 license identifier to files with no license
[linux-2.6-block.git] / include / net / sch_generic.h
CommitLineData
b2441318 1/* SPDX-License-Identifier: GPL-2.0 */
1da177e4
LT
2#ifndef __NET_SCHED_GENERIC_H
3#define __NET_SCHED_GENERIC_H
4
1da177e4
LT
5#include <linux/netdevice.h>
6#include <linux/types.h>
7#include <linux/rcupdate.h>
1da177e4
LT
8#include <linux/pkt_sched.h>
9#include <linux/pkt_cls.h>
22e0f8b9 10#include <linux/percpu.h>
5772e9a3 11#include <linux/dynamic_queue_limits.h>
5bc17018 12#include <linux/list.h>
7b936405 13#include <linux/refcount.h>
1da177e4 14#include <net/gen_stats.h>
be577ddc 15#include <net/rtnetlink.h>
1da177e4
LT
16
17struct Qdisc_ops;
18struct qdisc_walker;
19struct tcf_walker;
20struct module;
21
fd2c3ef7 22struct qdisc_rate_table {
1da177e4
LT
23 struct tc_ratespec rate;
24 u32 data[256];
25 struct qdisc_rate_table *next;
26 int refcnt;
27};
28
fd2c3ef7 29enum qdisc_state_t {
37437bb2 30 __QDISC_STATE_SCHED,
a9312ae8 31 __QDISC_STATE_DEACTIVATED,
e2627c8c
DM
32};
33
175f9c1b 34struct qdisc_size_table {
a2da570d 35 struct rcu_head rcu;
175f9c1b
JK
36 struct list_head list;
37 struct tc_sizespec szopts;
38 int refcnt;
39 u16 data[];
40};
41
48da34b7
FW
42/* similar to sk_buff_head, but skb->prev pointer is undefined. */
43struct qdisc_skb_head {
44 struct sk_buff *head;
45 struct sk_buff *tail;
46 __u32 qlen;
47 spinlock_t lock;
48};
49
fd2c3ef7 50struct Qdisc {
520ac30f
ED
51 int (*enqueue)(struct sk_buff *skb,
52 struct Qdisc *sch,
53 struct sk_buff **to_free);
54 struct sk_buff * (*dequeue)(struct Qdisc *sch);
05bdd2f1 55 unsigned int flags;
b00355db 56#define TCQ_F_BUILTIN 1
fd245a4a
ED
57#define TCQ_F_INGRESS 2
58#define TCQ_F_CAN_BYPASS 4
59#define TCQ_F_MQROOT 8
1abbe139
ED
60#define TCQ_F_ONETXQUEUE 0x10 /* dequeue_skb() can assume all skbs are for
61 * q->dev_queue : It can test
62 * netif_xmit_frozen_or_stopped() before
63 * dequeueing next packet.
64 * Its true for MQ/MQPRIO slaves, or non
65 * multiqueue device.
66 */
b00355db 67#define TCQ_F_WARN_NONWC (1 << 16)
22e0f8b9 68#define TCQ_F_CPUSTATS 0x20 /* run using percpu statistics */
4eaf3b84
ED
69#define TCQ_F_NOPARENT 0x40 /* root of its hierarchy :
70 * qdisc_tree_decrease_qlen() should stop.
71 */
49b49971 72#define TCQ_F_INVISIBLE 0x80 /* invisible by default in dump */
45203a3b 73 u32 limit;
05bdd2f1 74 const struct Qdisc_ops *ops;
a2da570d 75 struct qdisc_size_table __rcu *stab;
59cc1f61 76 struct hlist_node hash;
1da177e4
LT
77 u32 handle;
78 u32 parent;
72b25a91 79
5e140dfc 80 struct netdev_queue *dev_queue;
5e140dfc 81
1c0d32fd 82 struct net_rate_estimator __rcu *rate_est;
0d32ef8c
ED
83 struct gnet_stats_basic_cpu __percpu *cpu_bstats;
84 struct gnet_stats_queue __percpu *cpu_qstats;
85
5e140dfc
ED
86 /*
87 * For performance sake on SMP, we put highly modified fields at the end
88 */
4d202a0d 89 struct sk_buff *gso_skb ____cacheline_aligned_in_smp;
48da34b7 90 struct qdisc_skb_head q;
0d32ef8c 91 struct gnet_stats_basic_packed bstats;
f9eb8aea 92 seqcount_t running;
0d32ef8c 93 struct gnet_stats_queue qstats;
4d202a0d
ED
94 unsigned long state;
95 struct Qdisc *next_sched;
96 struct sk_buff *skb_bad_txq;
79640a4c 97 struct rcu_head rcu_head;
45203a3b 98 int padded;
7b936405 99 refcount_t refcnt;
45203a3b
ED
100
101 spinlock_t busylock ____cacheline_aligned_in_smp;
1da177e4
LT
102};
103
551143d8
ED
104static inline void qdisc_refcount_inc(struct Qdisc *qdisc)
105{
106 if (qdisc->flags & TCQ_F_BUILTIN)
107 return;
108 refcount_inc(&qdisc->refcnt);
109}
110
fd245a4a 111static inline bool qdisc_is_running(const struct Qdisc *qdisc)
bc135b23 112{
f9eb8aea 113 return (raw_read_seqcount(&qdisc->running) & 1) ? true : false;
bc135b23
ED
114}
115
116static inline bool qdisc_run_begin(struct Qdisc *qdisc)
117{
fd245a4a
ED
118 if (qdisc_is_running(qdisc))
119 return false;
52fbb290
ED
120 /* Variant of write_seqcount_begin() telling lockdep a trylock
121 * was attempted.
122 */
123 raw_write_seqcount_begin(&qdisc->running);
124 seqcount_acquire(&qdisc->running.dep_map, 0, 1, _RET_IP_);
fd245a4a 125 return true;
bc135b23
ED
126}
127
128static inline void qdisc_run_end(struct Qdisc *qdisc)
129{
f9eb8aea 130 write_seqcount_end(&qdisc->running);
fd245a4a
ED
131}
132
5772e9a3
JDB
133static inline bool qdisc_may_bulk(const struct Qdisc *qdisc)
134{
135 return qdisc->flags & TCQ_F_ONETXQUEUE;
136}
137
138static inline int qdisc_avail_bulklimit(const struct netdev_queue *txq)
139{
140#ifdef CONFIG_BQL
141 /* Non-BQL migrated drivers will return 0, too. */
142 return dql_avail(&txq->dql);
143#else
144 return 0;
145#endif
146}
147
fd2c3ef7 148struct Qdisc_class_ops {
1da177e4 149 /* Child qdisc manipulation */
926e61b7 150 struct netdev_queue * (*select_queue)(struct Qdisc *, struct tcmsg *);
1da177e4
LT
151 int (*graft)(struct Qdisc *, unsigned long cl,
152 struct Qdisc *, struct Qdisc **);
153 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
43effa1e 154 void (*qlen_notify)(struct Qdisc *, unsigned long);
1da177e4
LT
155
156 /* Class manipulation routines */
143976ce 157 unsigned long (*find)(struct Qdisc *, u32 classid);
1da177e4 158 int (*change)(struct Qdisc *, u32, u32,
1e90474c 159 struct nlattr **, unsigned long *);
1da177e4
LT
160 int (*delete)(struct Qdisc *, unsigned long);
161 void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
162
163 /* Filter manipulation */
6529eaba 164 struct tcf_block * (*tcf_block)(struct Qdisc *, unsigned long);
1da177e4
LT
165 unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
166 u32 classid);
167 void (*unbind_tcf)(struct Qdisc *, unsigned long);
168
169 /* rtnetlink specific */
170 int (*dump)(struct Qdisc *, unsigned long,
171 struct sk_buff *skb, struct tcmsg*);
172 int (*dump_stats)(struct Qdisc *, unsigned long,
173 struct gnet_dump *);
174};
175
fd2c3ef7 176struct Qdisc_ops {
1da177e4 177 struct Qdisc_ops *next;
20fea08b 178 const struct Qdisc_class_ops *cl_ops;
1da177e4
LT
179 char id[IFNAMSIZ];
180 int priv_size;
181
520ac30f
ED
182 int (*enqueue)(struct sk_buff *skb,
183 struct Qdisc *sch,
184 struct sk_buff **to_free);
1da177e4 185 struct sk_buff * (*dequeue)(struct Qdisc *);
90d841fd 186 struct sk_buff * (*peek)(struct Qdisc *);
1da177e4 187
1e90474c 188 int (*init)(struct Qdisc *, struct nlattr *arg);
1da177e4
LT
189 void (*reset)(struct Qdisc *);
190 void (*destroy)(struct Qdisc *);
1e90474c 191 int (*change)(struct Qdisc *, struct nlattr *arg);
6ec1c69a 192 void (*attach)(struct Qdisc *);
1da177e4
LT
193
194 int (*dump)(struct Qdisc *, struct sk_buff *);
195 int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
196
197 struct module *owner;
198};
199
200
fd2c3ef7 201struct tcf_result {
db50514f
JP
202 union {
203 struct {
204 unsigned long class;
205 u32 classid;
206 };
207 const struct tcf_proto *goto_tp;
208 };
1da177e4
LT
209};
210
fd2c3ef7 211struct tcf_proto_ops {
36272874 212 struct list_head head;
1da177e4
LT
213 char kind[IFNAMSIZ];
214
dc7f9f6e
ED
215 int (*classify)(struct sk_buff *,
216 const struct tcf_proto *,
217 struct tcf_result *);
1da177e4 218 int (*init)(struct tcf_proto*);
763dbf63 219 void (*destroy)(struct tcf_proto*);
1da177e4 220
8113c095 221 void* (*get)(struct tcf_proto*, u32 handle);
c1b52739 222 int (*change)(struct net *net, struct sk_buff *,
af4c6641 223 struct tcf_proto*, unsigned long,
add93b61 224 u32 handle, struct nlattr **,
8113c095
WC
225 void **, bool);
226 int (*delete)(struct tcf_proto*, void *, bool*);
1da177e4 227 void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
07d79fc7 228 void (*bind_class)(void *, u32, unsigned long);
1da177e4
LT
229
230 /* rtnetlink specific */
8113c095 231 int (*dump)(struct net*, struct tcf_proto*, void *,
1da177e4
LT
232 struct sk_buff *skb, struct tcmsg*);
233
234 struct module *owner;
235};
236
fd2c3ef7 237struct tcf_proto {
1da177e4 238 /* Fast access part */
25d8c0d5
JF
239 struct tcf_proto __rcu *next;
240 void __rcu *root;
dc7f9f6e
ED
241 int (*classify)(struct sk_buff *,
242 const struct tcf_proto *,
243 struct tcf_result *);
66c6f529 244 __be16 protocol;
1da177e4
LT
245
246 /* All the rest */
247 u32 prio;
248 u32 classid;
249 struct Qdisc *q;
250 void *data;
dc7f9f6e 251 const struct tcf_proto_ops *ops;
5bc17018 252 struct tcf_chain *chain;
25d8c0d5 253 struct rcu_head rcu;
1da177e4
LT
254};
255
175f9c1b
JK
256struct qdisc_skb_cb {
257 unsigned int pkt_len;
df4ab5b3 258 u16 slave_dev_queue_mapping;
045efa82 259 u16 tc_classid;
25711786
ED
260#define QDISC_CB_PRIV_LEN 20
261 unsigned char data[QDISC_CB_PRIV_LEN];
175f9c1b
JK
262};
263
2190d1d0
JP
264struct tcf_chain {
265 struct tcf_proto __rcu *filter_chain;
6529eaba 266 struct tcf_proto __rcu **p_filter_chain;
5bc17018
JP
267 struct list_head list;
268 struct tcf_block *block;
269 u32 index; /* chain index */
270 unsigned int refcnt;
6529eaba
JP
271};
272
2190d1d0 273struct tcf_block {
5bc17018 274 struct list_head chain_list;
2190d1d0
JP
275};
276
16bda13d
DM
277static inline void qdisc_cb_private_validate(const struct sk_buff *skb, int sz)
278{
279 struct qdisc_skb_cb *qcb;
5ee31c68
ED
280
281 BUILD_BUG_ON(sizeof(skb->cb) < offsetof(struct qdisc_skb_cb, data) + sz);
16bda13d
DM
282 BUILD_BUG_ON(sizeof(qcb->data) < sz);
283}
284
05bdd2f1 285static inline int qdisc_qlen(const struct Qdisc *q)
bbd8a0d3
KK
286{
287 return q->q.qlen;
288}
289
bfe0d029 290static inline struct qdisc_skb_cb *qdisc_skb_cb(const struct sk_buff *skb)
175f9c1b
JK
291{
292 return (struct qdisc_skb_cb *)skb->cb;
293}
294
83874000
DM
295static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
296{
297 return &qdisc->q.lock;
298}
299
05bdd2f1 300static inline struct Qdisc *qdisc_root(const struct Qdisc *qdisc)
7698b4fc 301{
46e5da40
JF
302 struct Qdisc *q = rcu_dereference_rtnl(qdisc->dev_queue->qdisc);
303
304 return q;
7698b4fc
DM
305}
306
05bdd2f1 307static inline struct Qdisc *qdisc_root_sleeping(const struct Qdisc *qdisc)
2540e051
JP
308{
309 return qdisc->dev_queue->qdisc_sleeping;
310}
311
7e43f112
DM
312/* The qdisc root lock is a mechanism by which to top level
313 * of a qdisc tree can be locked from any qdisc node in the
314 * forest. This allows changing the configuration of some
315 * aspect of the qdisc tree while blocking out asynchronous
316 * qdisc access in the packet processing paths.
317 *
318 * It is only legal to do this when the root will not change
319 * on us. Otherwise we'll potentially lock the wrong qdisc
320 * root. This is enforced by holding the RTNL semaphore, which
321 * all users of this lock accessor must do.
322 */
05bdd2f1 323static inline spinlock_t *qdisc_root_lock(const struct Qdisc *qdisc)
7698b4fc
DM
324{
325 struct Qdisc *root = qdisc_root(qdisc);
326
7e43f112 327 ASSERT_RTNL();
83874000 328 return qdisc_lock(root);
7698b4fc
DM
329}
330
05bdd2f1 331static inline spinlock_t *qdisc_root_sleeping_lock(const struct Qdisc *qdisc)
f6f9b93f
JP
332{
333 struct Qdisc *root = qdisc_root_sleeping(qdisc);
334
335 ASSERT_RTNL();
336 return qdisc_lock(root);
337}
338
edb09eb1
ED
339static inline seqcount_t *qdisc_root_sleeping_running(const struct Qdisc *qdisc)
340{
341 struct Qdisc *root = qdisc_root_sleeping(qdisc);
342
343 ASSERT_RTNL();
344 return &root->running;
345}
346
05bdd2f1 347static inline struct net_device *qdisc_dev(const struct Qdisc *qdisc)
5ce2d488
DM
348{
349 return qdisc->dev_queue->dev;
350}
1da177e4 351
05bdd2f1 352static inline void sch_tree_lock(const struct Qdisc *q)
78a5b30b 353{
fe439dd0 354 spin_lock_bh(qdisc_root_sleeping_lock(q));
78a5b30b
DM
355}
356
05bdd2f1 357static inline void sch_tree_unlock(const struct Qdisc *q)
78a5b30b 358{
fe439dd0 359 spin_unlock_bh(qdisc_root_sleeping_lock(q));
78a5b30b
DM
360}
361
362#define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
363#define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
1da177e4 364
e41a33e6
TG
365extern struct Qdisc noop_qdisc;
366extern struct Qdisc_ops noop_qdisc_ops;
6ec1c69a
DM
367extern struct Qdisc_ops pfifo_fast_ops;
368extern struct Qdisc_ops mq_qdisc_ops;
d66d6c31 369extern struct Qdisc_ops noqueue_qdisc_ops;
6da7c8fc 370extern const struct Qdisc_ops *default_qdisc_ops;
1f27cde3
ED
371static inline const struct Qdisc_ops *
372get_default_qdisc_ops(const struct net_device *dev, int ntx)
373{
374 return ntx < dev->real_num_tx_queues ?
375 default_qdisc_ops : &pfifo_fast_ops;
376}
e41a33e6 377
fd2c3ef7 378struct Qdisc_class_common {
6fe1c7a5
PM
379 u32 classid;
380 struct hlist_node hnode;
381};
382
fd2c3ef7 383struct Qdisc_class_hash {
6fe1c7a5
PM
384 struct hlist_head *hash;
385 unsigned int hashsize;
386 unsigned int hashmask;
387 unsigned int hashelems;
388};
389
390static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
391{
392 id ^= id >> 8;
393 id ^= id >> 4;
394 return id & mask;
395}
396
397static inline struct Qdisc_class_common *
05bdd2f1 398qdisc_class_find(const struct Qdisc_class_hash *hash, u32 id)
6fe1c7a5
PM
399{
400 struct Qdisc_class_common *cl;
6fe1c7a5
PM
401 unsigned int h;
402
7d3f0cd4
GF
403 if (!id)
404 return NULL;
405
6fe1c7a5 406 h = qdisc_class_hash(id, hash->hashmask);
b67bfe0d 407 hlist_for_each_entry(cl, &hash->hash[h], hnode) {
6fe1c7a5
PM
408 if (cl->classid == id)
409 return cl;
410 }
411 return NULL;
412}
413
5c15257f
JP
414int qdisc_class_hash_init(struct Qdisc_class_hash *);
415void qdisc_class_hash_insert(struct Qdisc_class_hash *,
416 struct Qdisc_class_common *);
417void qdisc_class_hash_remove(struct Qdisc_class_hash *,
418 struct Qdisc_class_common *);
419void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
420void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
421
422void dev_init_scheduler(struct net_device *dev);
423void dev_shutdown(struct net_device *dev);
424void dev_activate(struct net_device *dev);
425void dev_deactivate(struct net_device *dev);
426void dev_deactivate_many(struct list_head *head);
427struct Qdisc *dev_graft_qdisc(struct netdev_queue *dev_queue,
428 struct Qdisc *qdisc);
429void qdisc_reset(struct Qdisc *qdisc);
430void qdisc_destroy(struct Qdisc *qdisc);
2ccccf5f
WC
431void qdisc_tree_reduce_backlog(struct Qdisc *qdisc, unsigned int n,
432 unsigned int len);
5c15257f 433struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
d2a7f269 434 const struct Qdisc_ops *ops);
5c15257f 435struct Qdisc *qdisc_create_dflt(struct netdev_queue *dev_queue,
d2a7f269 436 const struct Qdisc_ops *ops, u32 parentid);
5c15257f
JP
437void __qdisc_calculate_pkt_len(struct sk_buff *skb,
438 const struct qdisc_size_table *stab);
27b29f63 439int skb_do_redirect(struct sk_buff *);
1da177e4 440
a5135bcf
WB
441static inline void skb_reset_tc(struct sk_buff *skb)
442{
443#ifdef CONFIG_NET_CLS_ACT
bc31c905 444 skb->tc_redirected = 0;
a5135bcf
WB
445#endif
446}
447
fdc5432a
DB
448static inline bool skb_at_tc_ingress(const struct sk_buff *skb)
449{
450#ifdef CONFIG_NET_CLS_ACT
8dc07fdb 451 return skb->tc_at_ingress;
fdc5432a
DB
452#else
453 return false;
454#endif
455}
456
e7246e12
WB
457static inline bool skb_skip_tc_classify(struct sk_buff *skb)
458{
459#ifdef CONFIG_NET_CLS_ACT
460 if (skb->tc_skip_classify) {
461 skb->tc_skip_classify = 0;
462 return true;
463 }
464#endif
465 return false;
466}
467
f0796d5c
JF
468/* Reset all TX qdiscs greater then index of a device. */
469static inline void qdisc_reset_all_tx_gt(struct net_device *dev, unsigned int i)
5aa70995 470{
4ef6acff
JF
471 struct Qdisc *qdisc;
472
f0796d5c 473 for (; i < dev->num_tx_queues; i++) {
46e5da40 474 qdisc = rtnl_dereference(netdev_get_tx_queue(dev, i)->qdisc);
4ef6acff
JF
475 if (qdisc) {
476 spin_lock_bh(qdisc_lock(qdisc));
477 qdisc_reset(qdisc);
478 spin_unlock_bh(qdisc_lock(qdisc));
479 }
480 }
5aa70995
DM
481}
482
5aa70995
DM
483static inline void qdisc_reset_all_tx(struct net_device *dev)
484{
f0796d5c 485 qdisc_reset_all_tx_gt(dev, 0);
5aa70995
DM
486}
487
3e745dd6
DM
488/* Are all TX queues of the device empty? */
489static inline bool qdisc_all_tx_empty(const struct net_device *dev)
490{
e8a0464c 491 unsigned int i;
46e5da40
JF
492
493 rcu_read_lock();
e8a0464c
DM
494 for (i = 0; i < dev->num_tx_queues; i++) {
495 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
46e5da40 496 const struct Qdisc *q = rcu_dereference(txq->qdisc);
3e745dd6 497
46e5da40
JF
498 if (q->q.qlen) {
499 rcu_read_unlock();
e8a0464c 500 return false;
46e5da40 501 }
e8a0464c 502 }
46e5da40 503 rcu_read_unlock();
e8a0464c 504 return true;
3e745dd6
DM
505}
506
6fa9864b 507/* Are any of the TX qdiscs changing? */
05bdd2f1 508static inline bool qdisc_tx_changing(const struct net_device *dev)
6fa9864b 509{
e8a0464c 510 unsigned int i;
46e5da40 511
e8a0464c
DM
512 for (i = 0; i < dev->num_tx_queues; i++) {
513 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
46e5da40 514 if (rcu_access_pointer(txq->qdisc) != txq->qdisc_sleeping)
e8a0464c
DM
515 return true;
516 }
517 return false;
6fa9864b
DM
518}
519
e8a0464c 520/* Is the device using the noop qdisc on all queues? */
05297949
DM
521static inline bool qdisc_tx_is_noop(const struct net_device *dev)
522{
e8a0464c 523 unsigned int i;
46e5da40 524
e8a0464c
DM
525 for (i = 0; i < dev->num_tx_queues; i++) {
526 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
46e5da40 527 if (rcu_access_pointer(txq->qdisc) != &noop_qdisc)
e8a0464c
DM
528 return false;
529 }
530 return true;
05297949
DM
531}
532
bfe0d029 533static inline unsigned int qdisc_pkt_len(const struct sk_buff *skb)
0abf77e5 534{
175f9c1b 535 return qdisc_skb_cb(skb)->pkt_len;
0abf77e5
JK
536}
537
c27f339a 538/* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
378a2f09
JP
539enum net_xmit_qdisc_t {
540 __NET_XMIT_STOLEN = 0x00010000,
c27f339a 541 __NET_XMIT_BYPASS = 0x00020000,
378a2f09
JP
542};
543
c27f339a 544#ifdef CONFIG_NET_CLS_ACT
378a2f09 545#define net_xmit_drop_count(e) ((e) & __NET_XMIT_STOLEN ? 0 : 1)
378a2f09
JP
546#else
547#define net_xmit_drop_count(e) (1)
548#endif
549
a2da570d
ED
550static inline void qdisc_calculate_pkt_len(struct sk_buff *skb,
551 const struct Qdisc *sch)
5f86173b 552{
3a682fbd 553#ifdef CONFIG_NET_SCHED
a2da570d
ED
554 struct qdisc_size_table *stab = rcu_dereference_bh(sch->stab);
555
556 if (stab)
557 __qdisc_calculate_pkt_len(skb, stab);
3a682fbd 558#endif
a2da570d
ED
559}
560
520ac30f
ED
561static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch,
562 struct sk_buff **to_free)
a2da570d
ED
563{
564 qdisc_calculate_pkt_len(skb, sch);
520ac30f 565 return sch->enqueue(skb, sch, to_free);
5f86173b
JK
566}
567
22e0f8b9
JF
568static inline bool qdisc_is_percpu_stats(const struct Qdisc *q)
569{
570 return q->flags & TCQ_F_CPUSTATS;
571}
bfe0d029 572
38040702
AV
573static inline void _bstats_update(struct gnet_stats_basic_packed *bstats,
574 __u64 bytes, __u32 packets)
575{
576 bstats->bytes += bytes;
577 bstats->packets += packets;
578}
579
bfe0d029
ED
580static inline void bstats_update(struct gnet_stats_basic_packed *bstats,
581 const struct sk_buff *skb)
582{
38040702
AV
583 _bstats_update(bstats,
584 qdisc_pkt_len(skb),
585 skb_is_gso(skb) ? skb_shinfo(skb)->gso_segs : 1);
586}
587
588static inline void _bstats_cpu_update(struct gnet_stats_basic_cpu *bstats,
589 __u64 bytes, __u32 packets)
590{
591 u64_stats_update_begin(&bstats->syncp);
592 _bstats_update(&bstats->bstats, bytes, packets);
593 u64_stats_update_end(&bstats->syncp);
bfe0d029
ED
594}
595
24ea591d
ED
596static inline void bstats_cpu_update(struct gnet_stats_basic_cpu *bstats,
597 const struct sk_buff *skb)
22e0f8b9 598{
22e0f8b9
JF
599 u64_stats_update_begin(&bstats->syncp);
600 bstats_update(&bstats->bstats, skb);
601 u64_stats_update_end(&bstats->syncp);
602}
603
24ea591d
ED
604static inline void qdisc_bstats_cpu_update(struct Qdisc *sch,
605 const struct sk_buff *skb)
606{
607 bstats_cpu_update(this_cpu_ptr(sch->cpu_bstats), skb);
608}
609
bfe0d029
ED
610static inline void qdisc_bstats_update(struct Qdisc *sch,
611 const struct sk_buff *skb)
bbd8a0d3 612{
bfe0d029 613 bstats_update(&sch->bstats, skb);
bbd8a0d3
KK
614}
615
25331d6c
JF
616static inline void qdisc_qstats_backlog_dec(struct Qdisc *sch,
617 const struct sk_buff *skb)
618{
619 sch->qstats.backlog -= qdisc_pkt_len(skb);
620}
621
622static inline void qdisc_qstats_backlog_inc(struct Qdisc *sch,
623 const struct sk_buff *skb)
624{
625 sch->qstats.backlog += qdisc_pkt_len(skb);
626}
627
628static inline void __qdisc_qstats_drop(struct Qdisc *sch, int count)
629{
630 sch->qstats.drops += count;
631}
632
24ea591d 633static inline void qstats_drop_inc(struct gnet_stats_queue *qstats)
25331d6c 634{
24ea591d 635 qstats->drops++;
25331d6c
JF
636}
637
24ea591d 638static inline void qstats_overlimit_inc(struct gnet_stats_queue *qstats)
b0ab6f92 639{
24ea591d
ED
640 qstats->overlimits++;
641}
b0ab6f92 642
24ea591d
ED
643static inline void qdisc_qstats_drop(struct Qdisc *sch)
644{
645 qstats_drop_inc(&sch->qstats);
646}
647
648static inline void qdisc_qstats_cpu_drop(struct Qdisc *sch)
649{
eb60a8dd 650 this_cpu_inc(sch->cpu_qstats->drops);
b0ab6f92
JF
651}
652
25331d6c
JF
653static inline void qdisc_qstats_overlimit(struct Qdisc *sch)
654{
655 sch->qstats.overlimits++;
656}
657
48da34b7
FW
658static inline void qdisc_skb_head_init(struct qdisc_skb_head *qh)
659{
660 qh->head = NULL;
661 qh->tail = NULL;
662 qh->qlen = 0;
663}
664
9972b25d 665static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
48da34b7 666 struct qdisc_skb_head *qh)
9972b25d 667{
48da34b7
FW
668 struct sk_buff *last = qh->tail;
669
670 if (last) {
671 skb->next = NULL;
672 last->next = skb;
673 qh->tail = skb;
674 } else {
675 qh->tail = skb;
676 qh->head = skb;
677 }
678 qh->qlen++;
25331d6c 679 qdisc_qstats_backlog_inc(sch, skb);
9972b25d
TG
680
681 return NET_XMIT_SUCCESS;
682}
683
684static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
685{
686 return __qdisc_enqueue_tail(skb, sch, &sch->q);
687}
688
48da34b7 689static inline struct sk_buff *__qdisc_dequeue_head(struct qdisc_skb_head *qh)
9972b25d 690{
48da34b7
FW
691 struct sk_buff *skb = qh->head;
692
693 if (likely(skb != NULL)) {
694 qh->head = skb->next;
695 qh->qlen--;
696 if (qh->head == NULL)
697 qh->tail = NULL;
698 skb->next = NULL;
699 }
9972b25d 700
ec323368
FW
701 return skb;
702}
703
704static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
705{
706 struct sk_buff *skb = __qdisc_dequeue_head(&sch->q);
707
9190b3b3 708 if (likely(skb != NULL)) {
25331d6c 709 qdisc_qstats_backlog_dec(sch, skb);
9190b3b3
ED
710 qdisc_bstats_update(sch, skb);
711 }
9972b25d
TG
712
713 return skb;
714}
715
520ac30f
ED
716/* Instead of calling kfree_skb() while root qdisc lock is held,
717 * queue the skb for future freeing at end of __dev_xmit_skb()
718 */
719static inline void __qdisc_drop(struct sk_buff *skb, struct sk_buff **to_free)
720{
721 skb->next = *to_free;
722 *to_free = skb;
723}
724
57dbb2d8 725static inline unsigned int __qdisc_queue_drop_head(struct Qdisc *sch,
48da34b7 726 struct qdisc_skb_head *qh,
520ac30f 727 struct sk_buff **to_free)
57dbb2d8 728{
48da34b7 729 struct sk_buff *skb = __qdisc_dequeue_head(qh);
57dbb2d8
HPP
730
731 if (likely(skb != NULL)) {
732 unsigned int len = qdisc_pkt_len(skb);
520ac30f 733
25331d6c 734 qdisc_qstats_backlog_dec(sch, skb);
520ac30f 735 __qdisc_drop(skb, to_free);
57dbb2d8
HPP
736 return len;
737 }
738
739 return 0;
740}
741
520ac30f
ED
742static inline unsigned int qdisc_queue_drop_head(struct Qdisc *sch,
743 struct sk_buff **to_free)
57dbb2d8 744{
520ac30f 745 return __qdisc_queue_drop_head(sch, &sch->q, to_free);
9972b25d
TG
746}
747
48a8f519
PM
748static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
749{
48da34b7
FW
750 const struct qdisc_skb_head *qh = &sch->q;
751
752 return qh->head;
48a8f519
PM
753}
754
77be155c
JP
755/* generic pseudo peek method for non-work-conserving qdisc */
756static inline struct sk_buff *qdisc_peek_dequeued(struct Qdisc *sch)
757{
758 /* we can reuse ->gso_skb because peek isn't called for root qdiscs */
61c9eaf9 759 if (!sch->gso_skb) {
77be155c 760 sch->gso_skb = sch->dequeue(sch);
a27758ff 761 if (sch->gso_skb) {
61c9eaf9 762 /* it's still part of the queue */
a27758ff 763 qdisc_qstats_backlog_inc(sch, sch->gso_skb);
61c9eaf9 764 sch->q.qlen++;
a27758ff 765 }
61c9eaf9 766 }
77be155c
JP
767
768 return sch->gso_skb;
769}
770
771/* use instead of qdisc->dequeue() for all qdiscs queried with ->peek() */
772static inline struct sk_buff *qdisc_dequeue_peeked(struct Qdisc *sch)
773{
774 struct sk_buff *skb = sch->gso_skb;
775
61c9eaf9 776 if (skb) {
77be155c 777 sch->gso_skb = NULL;
a27758ff 778 qdisc_qstats_backlog_dec(sch, skb);
61c9eaf9
JP
779 sch->q.qlen--;
780 } else {
77be155c 781 skb = sch->dequeue(sch);
61c9eaf9 782 }
77be155c
JP
783
784 return skb;
785}
786
48da34b7 787static inline void __qdisc_reset_queue(struct qdisc_skb_head *qh)
9972b25d
TG
788{
789 /*
790 * We do not know the backlog in bytes of this list, it
791 * is up to the caller to correct it
792 */
48da34b7
FW
793 ASSERT_RTNL();
794 if (qh->qlen) {
795 rtnl_kfree_skbs(qh->head, qh->tail);
796
797 qh->head = NULL;
798 qh->tail = NULL;
799 qh->qlen = 0;
1b5c5493 800 }
9972b25d
TG
801}
802
803static inline void qdisc_reset_queue(struct Qdisc *sch)
804{
1b5c5493 805 __qdisc_reset_queue(&sch->q);
9972b25d
TG
806 sch->qstats.backlog = 0;
807}
808
86a7996c
WC
809static inline struct Qdisc *qdisc_replace(struct Qdisc *sch, struct Qdisc *new,
810 struct Qdisc **pold)
811{
812 struct Qdisc *old;
813
814 sch_tree_lock(sch);
815 old = *pold;
816 *pold = new;
817 if (old != NULL) {
68a66d14
KK
818 unsigned int qlen = old->q.qlen;
819 unsigned int backlog = old->qstats.backlog;
820
86a7996c 821 qdisc_reset(old);
68a66d14 822 qdisc_tree_reduce_backlog(old, qlen, backlog);
86a7996c
WC
823 }
824 sch_tree_unlock(sch);
825
826 return old;
827}
828
1b5c5493
ED
829static inline void rtnl_qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
830{
831 rtnl_kfree_skbs(skb, skb);
832 qdisc_qstats_drop(sch);
833}
834
520ac30f
ED
835
836static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch,
837 struct sk_buff **to_free)
9972b25d 838{
520ac30f 839 __qdisc_drop(skb, to_free);
25331d6c 840 qdisc_qstats_drop(sch);
9972b25d
TG
841
842 return NET_XMIT_DROP;
843}
844
e9bef55d
JDB
845/* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
846 long it will take to send a packet given its size.
847 */
848static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
849{
e08b0998
JDB
850 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
851 if (slot < 0)
852 slot = 0;
e9bef55d
JDB
853 slot >>= rtab->rate.cell_log;
854 if (slot > 255)
a02cec21 855 return rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF];
e9bef55d
JDB
856 return rtab->data[slot];
857}
858
292f1c7f 859struct psched_ratecfg {
130d3d68 860 u64 rate_bytes_ps; /* bytes per second */
01cb71d2
ED
861 u32 mult;
862 u16 overhead;
8a8e3d84 863 u8 linklayer;
01cb71d2 864 u8 shift;
292f1c7f
JP
865};
866
867static inline u64 psched_l2t_ns(const struct psched_ratecfg *r,
868 unsigned int len)
869{
8a8e3d84
JDB
870 len += r->overhead;
871
872 if (unlikely(r->linklayer == TC_LINKLAYER_ATM))
873 return ((u64)(DIV_ROUND_UP(len,48)*53) * r->mult) >> r->shift;
874
875 return ((u64)len * r->mult) >> r->shift;
292f1c7f
JP
876}
877
5c15257f 878void psched_ratecfg_precompute(struct psched_ratecfg *r,
3e1e3aae
ED
879 const struct tc_ratespec *conf,
880 u64 rate64);
292f1c7f 881
01cb71d2
ED
882static inline void psched_ratecfg_getrate(struct tc_ratespec *res,
883 const struct psched_ratecfg *r)
292f1c7f 884{
01cb71d2 885 memset(res, 0, sizeof(*res));
3e1e3aae
ED
886
887 /* legacy struct tc_ratespec has a 32bit @rate field
888 * Qdisc using 64bit rate should add new attributes
889 * in order to maintain compatibility.
890 */
891 res->rate = min_t(u64, r->rate_bytes_ps, ~0U);
892
01cb71d2 893 res->overhead = r->overhead;
8a8e3d84 894 res->linklayer = (r->linklayer & TC_LINKLAYER_MASK);
292f1c7f
JP
895}
896
1da177e4 897#endif