Merge remote-tracking branches 'regmap/topic/const' and 'regmap/topic/hwspinlock...
[linux-2.6-block.git] / include / net / sch_generic.h
CommitLineData
1da177e4
LT
1#ifndef __NET_SCHED_GENERIC_H
2#define __NET_SCHED_GENERIC_H
3
1da177e4
LT
4#include <linux/netdevice.h>
5#include <linux/types.h>
6#include <linux/rcupdate.h>
1da177e4
LT
7#include <linux/pkt_sched.h>
8#include <linux/pkt_cls.h>
22e0f8b9 9#include <linux/percpu.h>
5772e9a3 10#include <linux/dynamic_queue_limits.h>
5bc17018 11#include <linux/list.h>
7b936405 12#include <linux/refcount.h>
7aa0045d 13#include <linux/workqueue.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;
7aa0045d 275 struct work_struct work;
2190d1d0
JP
276};
277
16bda13d
DM
278static inline void qdisc_cb_private_validate(const struct sk_buff *skb, int sz)
279{
280 struct qdisc_skb_cb *qcb;
5ee31c68
ED
281
282 BUILD_BUG_ON(sizeof(skb->cb) < offsetof(struct qdisc_skb_cb, data) + sz);
16bda13d
DM
283 BUILD_BUG_ON(sizeof(qcb->data) < sz);
284}
285
05bdd2f1 286static inline int qdisc_qlen(const struct Qdisc *q)
bbd8a0d3
KK
287{
288 return q->q.qlen;
289}
290
bfe0d029 291static inline struct qdisc_skb_cb *qdisc_skb_cb(const struct sk_buff *skb)
175f9c1b
JK
292{
293 return (struct qdisc_skb_cb *)skb->cb;
294}
295
83874000
DM
296static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
297{
298 return &qdisc->q.lock;
299}
300
05bdd2f1 301static inline struct Qdisc *qdisc_root(const struct Qdisc *qdisc)
7698b4fc 302{
46e5da40
JF
303 struct Qdisc *q = rcu_dereference_rtnl(qdisc->dev_queue->qdisc);
304
305 return q;
7698b4fc
DM
306}
307
05bdd2f1 308static inline struct Qdisc *qdisc_root_sleeping(const struct Qdisc *qdisc)
2540e051
JP
309{
310 return qdisc->dev_queue->qdisc_sleeping;
311}
312
7e43f112
DM
313/* The qdisc root lock is a mechanism by which to top level
314 * of a qdisc tree can be locked from any qdisc node in the
315 * forest. This allows changing the configuration of some
316 * aspect of the qdisc tree while blocking out asynchronous
317 * qdisc access in the packet processing paths.
318 *
319 * It is only legal to do this when the root will not change
320 * on us. Otherwise we'll potentially lock the wrong qdisc
321 * root. This is enforced by holding the RTNL semaphore, which
322 * all users of this lock accessor must do.
323 */
05bdd2f1 324static inline spinlock_t *qdisc_root_lock(const struct Qdisc *qdisc)
7698b4fc
DM
325{
326 struct Qdisc *root = qdisc_root(qdisc);
327
7e43f112 328 ASSERT_RTNL();
83874000 329 return qdisc_lock(root);
7698b4fc
DM
330}
331
05bdd2f1 332static inline spinlock_t *qdisc_root_sleeping_lock(const struct Qdisc *qdisc)
f6f9b93f
JP
333{
334 struct Qdisc *root = qdisc_root_sleeping(qdisc);
335
336 ASSERT_RTNL();
337 return qdisc_lock(root);
338}
339
edb09eb1
ED
340static inline seqcount_t *qdisc_root_sleeping_running(const struct Qdisc *qdisc)
341{
342 struct Qdisc *root = qdisc_root_sleeping(qdisc);
343
344 ASSERT_RTNL();
345 return &root->running;
346}
347
05bdd2f1 348static inline struct net_device *qdisc_dev(const struct Qdisc *qdisc)
5ce2d488
DM
349{
350 return qdisc->dev_queue->dev;
351}
1da177e4 352
05bdd2f1 353static inline void sch_tree_lock(const struct Qdisc *q)
78a5b30b 354{
fe439dd0 355 spin_lock_bh(qdisc_root_sleeping_lock(q));
78a5b30b
DM
356}
357
05bdd2f1 358static inline void sch_tree_unlock(const struct Qdisc *q)
78a5b30b 359{
fe439dd0 360 spin_unlock_bh(qdisc_root_sleeping_lock(q));
78a5b30b
DM
361}
362
363#define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
364#define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
1da177e4 365
e41a33e6
TG
366extern struct Qdisc noop_qdisc;
367extern struct Qdisc_ops noop_qdisc_ops;
6ec1c69a
DM
368extern struct Qdisc_ops pfifo_fast_ops;
369extern struct Qdisc_ops mq_qdisc_ops;
d66d6c31 370extern struct Qdisc_ops noqueue_qdisc_ops;
6da7c8fc 371extern const struct Qdisc_ops *default_qdisc_ops;
1f27cde3
ED
372static inline const struct Qdisc_ops *
373get_default_qdisc_ops(const struct net_device *dev, int ntx)
374{
375 return ntx < dev->real_num_tx_queues ?
376 default_qdisc_ops : &pfifo_fast_ops;
377}
e41a33e6 378
fd2c3ef7 379struct Qdisc_class_common {
6fe1c7a5
PM
380 u32 classid;
381 struct hlist_node hnode;
382};
383
fd2c3ef7 384struct Qdisc_class_hash {
6fe1c7a5
PM
385 struct hlist_head *hash;
386 unsigned int hashsize;
387 unsigned int hashmask;
388 unsigned int hashelems;
389};
390
391static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
392{
393 id ^= id >> 8;
394 id ^= id >> 4;
395 return id & mask;
396}
397
398static inline struct Qdisc_class_common *
05bdd2f1 399qdisc_class_find(const struct Qdisc_class_hash *hash, u32 id)
6fe1c7a5
PM
400{
401 struct Qdisc_class_common *cl;
6fe1c7a5
PM
402 unsigned int h;
403
7d3f0cd4
GF
404 if (!id)
405 return NULL;
406
6fe1c7a5 407 h = qdisc_class_hash(id, hash->hashmask);
b67bfe0d 408 hlist_for_each_entry(cl, &hash->hash[h], hnode) {
6fe1c7a5
PM
409 if (cl->classid == id)
410 return cl;
411 }
412 return NULL;
413}
414
5c15257f
JP
415int qdisc_class_hash_init(struct Qdisc_class_hash *);
416void qdisc_class_hash_insert(struct Qdisc_class_hash *,
417 struct Qdisc_class_common *);
418void qdisc_class_hash_remove(struct Qdisc_class_hash *,
419 struct Qdisc_class_common *);
420void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
421void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
422
423void dev_init_scheduler(struct net_device *dev);
424void dev_shutdown(struct net_device *dev);
425void dev_activate(struct net_device *dev);
426void dev_deactivate(struct net_device *dev);
427void dev_deactivate_many(struct list_head *head);
428struct Qdisc *dev_graft_qdisc(struct netdev_queue *dev_queue,
429 struct Qdisc *qdisc);
430void qdisc_reset(struct Qdisc *qdisc);
431void qdisc_destroy(struct Qdisc *qdisc);
2ccccf5f
WC
432void qdisc_tree_reduce_backlog(struct Qdisc *qdisc, unsigned int n,
433 unsigned int len);
5c15257f 434struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
d2a7f269 435 const struct Qdisc_ops *ops);
5c15257f 436struct Qdisc *qdisc_create_dflt(struct netdev_queue *dev_queue,
d2a7f269 437 const struct Qdisc_ops *ops, u32 parentid);
5c15257f
JP
438void __qdisc_calculate_pkt_len(struct sk_buff *skb,
439 const struct qdisc_size_table *stab);
27b29f63 440int skb_do_redirect(struct sk_buff *);
1da177e4 441
a5135bcf
WB
442static inline void skb_reset_tc(struct sk_buff *skb)
443{
444#ifdef CONFIG_NET_CLS_ACT
bc31c905 445 skb->tc_redirected = 0;
a5135bcf
WB
446#endif
447}
448
fdc5432a
DB
449static inline bool skb_at_tc_ingress(const struct sk_buff *skb)
450{
451#ifdef CONFIG_NET_CLS_ACT
8dc07fdb 452 return skb->tc_at_ingress;
fdc5432a
DB
453#else
454 return false;
455#endif
456}
457
e7246e12
WB
458static inline bool skb_skip_tc_classify(struct sk_buff *skb)
459{
460#ifdef CONFIG_NET_CLS_ACT
461 if (skb->tc_skip_classify) {
462 skb->tc_skip_classify = 0;
463 return true;
464 }
465#endif
466 return false;
467}
468
f0796d5c
JF
469/* Reset all TX qdiscs greater then index of a device. */
470static inline void qdisc_reset_all_tx_gt(struct net_device *dev, unsigned int i)
5aa70995 471{
4ef6acff
JF
472 struct Qdisc *qdisc;
473
f0796d5c 474 for (; i < dev->num_tx_queues; i++) {
46e5da40 475 qdisc = rtnl_dereference(netdev_get_tx_queue(dev, i)->qdisc);
4ef6acff
JF
476 if (qdisc) {
477 spin_lock_bh(qdisc_lock(qdisc));
478 qdisc_reset(qdisc);
479 spin_unlock_bh(qdisc_lock(qdisc));
480 }
481 }
5aa70995
DM
482}
483
5aa70995
DM
484static inline void qdisc_reset_all_tx(struct net_device *dev)
485{
f0796d5c 486 qdisc_reset_all_tx_gt(dev, 0);
5aa70995
DM
487}
488
3e745dd6
DM
489/* Are all TX queues of the device empty? */
490static inline bool qdisc_all_tx_empty(const struct net_device *dev)
491{
e8a0464c 492 unsigned int i;
46e5da40
JF
493
494 rcu_read_lock();
e8a0464c
DM
495 for (i = 0; i < dev->num_tx_queues; i++) {
496 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
46e5da40 497 const struct Qdisc *q = rcu_dereference(txq->qdisc);
3e745dd6 498
46e5da40
JF
499 if (q->q.qlen) {
500 rcu_read_unlock();
e8a0464c 501 return false;
46e5da40 502 }
e8a0464c 503 }
46e5da40 504 rcu_read_unlock();
e8a0464c 505 return true;
3e745dd6
DM
506}
507
6fa9864b 508/* Are any of the TX qdiscs changing? */
05bdd2f1 509static inline bool qdisc_tx_changing(const struct net_device *dev)
6fa9864b 510{
e8a0464c 511 unsigned int i;
46e5da40 512
e8a0464c
DM
513 for (i = 0; i < dev->num_tx_queues; i++) {
514 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
46e5da40 515 if (rcu_access_pointer(txq->qdisc) != txq->qdisc_sleeping)
e8a0464c
DM
516 return true;
517 }
518 return false;
6fa9864b
DM
519}
520
e8a0464c 521/* Is the device using the noop qdisc on all queues? */
05297949
DM
522static inline bool qdisc_tx_is_noop(const struct net_device *dev)
523{
e8a0464c 524 unsigned int i;
46e5da40 525
e8a0464c
DM
526 for (i = 0; i < dev->num_tx_queues; i++) {
527 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
46e5da40 528 if (rcu_access_pointer(txq->qdisc) != &noop_qdisc)
e8a0464c
DM
529 return false;
530 }
531 return true;
05297949
DM
532}
533
bfe0d029 534static inline unsigned int qdisc_pkt_len(const struct sk_buff *skb)
0abf77e5 535{
175f9c1b 536 return qdisc_skb_cb(skb)->pkt_len;
0abf77e5
JK
537}
538
c27f339a 539/* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
378a2f09
JP
540enum net_xmit_qdisc_t {
541 __NET_XMIT_STOLEN = 0x00010000,
c27f339a 542 __NET_XMIT_BYPASS = 0x00020000,
378a2f09
JP
543};
544
c27f339a 545#ifdef CONFIG_NET_CLS_ACT
378a2f09 546#define net_xmit_drop_count(e) ((e) & __NET_XMIT_STOLEN ? 0 : 1)
378a2f09
JP
547#else
548#define net_xmit_drop_count(e) (1)
549#endif
550
a2da570d
ED
551static inline void qdisc_calculate_pkt_len(struct sk_buff *skb,
552 const struct Qdisc *sch)
5f86173b 553{
3a682fbd 554#ifdef CONFIG_NET_SCHED
a2da570d
ED
555 struct qdisc_size_table *stab = rcu_dereference_bh(sch->stab);
556
557 if (stab)
558 __qdisc_calculate_pkt_len(skb, stab);
3a682fbd 559#endif
a2da570d
ED
560}
561
520ac30f
ED
562static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch,
563 struct sk_buff **to_free)
a2da570d
ED
564{
565 qdisc_calculate_pkt_len(skb, sch);
520ac30f 566 return sch->enqueue(skb, sch, to_free);
5f86173b
JK
567}
568
22e0f8b9
JF
569static inline bool qdisc_is_percpu_stats(const struct Qdisc *q)
570{
571 return q->flags & TCQ_F_CPUSTATS;
572}
bfe0d029 573
38040702
AV
574static inline void _bstats_update(struct gnet_stats_basic_packed *bstats,
575 __u64 bytes, __u32 packets)
576{
577 bstats->bytes += bytes;
578 bstats->packets += packets;
579}
580
bfe0d029
ED
581static inline void bstats_update(struct gnet_stats_basic_packed *bstats,
582 const struct sk_buff *skb)
583{
38040702
AV
584 _bstats_update(bstats,
585 qdisc_pkt_len(skb),
586 skb_is_gso(skb) ? skb_shinfo(skb)->gso_segs : 1);
587}
588
589static inline void _bstats_cpu_update(struct gnet_stats_basic_cpu *bstats,
590 __u64 bytes, __u32 packets)
591{
592 u64_stats_update_begin(&bstats->syncp);
593 _bstats_update(&bstats->bstats, bytes, packets);
594 u64_stats_update_end(&bstats->syncp);
bfe0d029
ED
595}
596
24ea591d
ED
597static inline void bstats_cpu_update(struct gnet_stats_basic_cpu *bstats,
598 const struct sk_buff *skb)
22e0f8b9 599{
22e0f8b9
JF
600 u64_stats_update_begin(&bstats->syncp);
601 bstats_update(&bstats->bstats, skb);
602 u64_stats_update_end(&bstats->syncp);
603}
604
24ea591d
ED
605static inline void qdisc_bstats_cpu_update(struct Qdisc *sch,
606 const struct sk_buff *skb)
607{
608 bstats_cpu_update(this_cpu_ptr(sch->cpu_bstats), skb);
609}
610
bfe0d029
ED
611static inline void qdisc_bstats_update(struct Qdisc *sch,
612 const struct sk_buff *skb)
bbd8a0d3 613{
bfe0d029 614 bstats_update(&sch->bstats, skb);
bbd8a0d3
KK
615}
616
25331d6c
JF
617static inline void qdisc_qstats_backlog_dec(struct Qdisc *sch,
618 const struct sk_buff *skb)
619{
620 sch->qstats.backlog -= qdisc_pkt_len(skb);
621}
622
623static inline void qdisc_qstats_backlog_inc(struct Qdisc *sch,
624 const struct sk_buff *skb)
625{
626 sch->qstats.backlog += qdisc_pkt_len(skb);
627}
628
629static inline void __qdisc_qstats_drop(struct Qdisc *sch, int count)
630{
631 sch->qstats.drops += count;
632}
633
24ea591d 634static inline void qstats_drop_inc(struct gnet_stats_queue *qstats)
25331d6c 635{
24ea591d 636 qstats->drops++;
25331d6c
JF
637}
638
24ea591d 639static inline void qstats_overlimit_inc(struct gnet_stats_queue *qstats)
b0ab6f92 640{
24ea591d
ED
641 qstats->overlimits++;
642}
b0ab6f92 643
24ea591d
ED
644static inline void qdisc_qstats_drop(struct Qdisc *sch)
645{
646 qstats_drop_inc(&sch->qstats);
647}
648
649static inline void qdisc_qstats_cpu_drop(struct Qdisc *sch)
650{
eb60a8dd 651 this_cpu_inc(sch->cpu_qstats->drops);
b0ab6f92
JF
652}
653
25331d6c
JF
654static inline void qdisc_qstats_overlimit(struct Qdisc *sch)
655{
656 sch->qstats.overlimits++;
657}
658
48da34b7
FW
659static inline void qdisc_skb_head_init(struct qdisc_skb_head *qh)
660{
661 qh->head = NULL;
662 qh->tail = NULL;
663 qh->qlen = 0;
664}
665
9972b25d 666static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
48da34b7 667 struct qdisc_skb_head *qh)
9972b25d 668{
48da34b7
FW
669 struct sk_buff *last = qh->tail;
670
671 if (last) {
672 skb->next = NULL;
673 last->next = skb;
674 qh->tail = skb;
675 } else {
676 qh->tail = skb;
677 qh->head = skb;
678 }
679 qh->qlen++;
25331d6c 680 qdisc_qstats_backlog_inc(sch, skb);
9972b25d
TG
681
682 return NET_XMIT_SUCCESS;
683}
684
685static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
686{
687 return __qdisc_enqueue_tail(skb, sch, &sch->q);
688}
689
48da34b7 690static inline struct sk_buff *__qdisc_dequeue_head(struct qdisc_skb_head *qh)
9972b25d 691{
48da34b7
FW
692 struct sk_buff *skb = qh->head;
693
694 if (likely(skb != NULL)) {
695 qh->head = skb->next;
696 qh->qlen--;
697 if (qh->head == NULL)
698 qh->tail = NULL;
699 skb->next = NULL;
700 }
9972b25d 701
ec323368
FW
702 return skb;
703}
704
705static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
706{
707 struct sk_buff *skb = __qdisc_dequeue_head(&sch->q);
708
9190b3b3 709 if (likely(skb != NULL)) {
25331d6c 710 qdisc_qstats_backlog_dec(sch, skb);
9190b3b3
ED
711 qdisc_bstats_update(sch, skb);
712 }
9972b25d
TG
713
714 return skb;
715}
716
520ac30f
ED
717/* Instead of calling kfree_skb() while root qdisc lock is held,
718 * queue the skb for future freeing at end of __dev_xmit_skb()
719 */
720static inline void __qdisc_drop(struct sk_buff *skb, struct sk_buff **to_free)
721{
722 skb->next = *to_free;
723 *to_free = skb;
724}
725
57dbb2d8 726static inline unsigned int __qdisc_queue_drop_head(struct Qdisc *sch,
48da34b7 727 struct qdisc_skb_head *qh,
520ac30f 728 struct sk_buff **to_free)
57dbb2d8 729{
48da34b7 730 struct sk_buff *skb = __qdisc_dequeue_head(qh);
57dbb2d8
HPP
731
732 if (likely(skb != NULL)) {
733 unsigned int len = qdisc_pkt_len(skb);
520ac30f 734
25331d6c 735 qdisc_qstats_backlog_dec(sch, skb);
520ac30f 736 __qdisc_drop(skb, to_free);
57dbb2d8
HPP
737 return len;
738 }
739
740 return 0;
741}
742
520ac30f
ED
743static inline unsigned int qdisc_queue_drop_head(struct Qdisc *sch,
744 struct sk_buff **to_free)
57dbb2d8 745{
520ac30f 746 return __qdisc_queue_drop_head(sch, &sch->q, to_free);
9972b25d
TG
747}
748
48a8f519
PM
749static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
750{
48da34b7
FW
751 const struct qdisc_skb_head *qh = &sch->q;
752
753 return qh->head;
48a8f519
PM
754}
755
77be155c
JP
756/* generic pseudo peek method for non-work-conserving qdisc */
757static inline struct sk_buff *qdisc_peek_dequeued(struct Qdisc *sch)
758{
759 /* we can reuse ->gso_skb because peek isn't called for root qdiscs */
61c9eaf9 760 if (!sch->gso_skb) {
77be155c 761 sch->gso_skb = sch->dequeue(sch);
a27758ff 762 if (sch->gso_skb) {
61c9eaf9 763 /* it's still part of the queue */
a27758ff 764 qdisc_qstats_backlog_inc(sch, sch->gso_skb);
61c9eaf9 765 sch->q.qlen++;
a27758ff 766 }
61c9eaf9 767 }
77be155c
JP
768
769 return sch->gso_skb;
770}
771
772/* use instead of qdisc->dequeue() for all qdiscs queried with ->peek() */
773static inline struct sk_buff *qdisc_dequeue_peeked(struct Qdisc *sch)
774{
775 struct sk_buff *skb = sch->gso_skb;
776
61c9eaf9 777 if (skb) {
77be155c 778 sch->gso_skb = NULL;
a27758ff 779 qdisc_qstats_backlog_dec(sch, skb);
61c9eaf9
JP
780 sch->q.qlen--;
781 } else {
77be155c 782 skb = sch->dequeue(sch);
61c9eaf9 783 }
77be155c
JP
784
785 return skb;
786}
787
48da34b7 788static inline void __qdisc_reset_queue(struct qdisc_skb_head *qh)
9972b25d
TG
789{
790 /*
791 * We do not know the backlog in bytes of this list, it
792 * is up to the caller to correct it
793 */
48da34b7
FW
794 ASSERT_RTNL();
795 if (qh->qlen) {
796 rtnl_kfree_skbs(qh->head, qh->tail);
797
798 qh->head = NULL;
799 qh->tail = NULL;
800 qh->qlen = 0;
1b5c5493 801 }
9972b25d
TG
802}
803
804static inline void qdisc_reset_queue(struct Qdisc *sch)
805{
1b5c5493 806 __qdisc_reset_queue(&sch->q);
9972b25d
TG
807 sch->qstats.backlog = 0;
808}
809
86a7996c
WC
810static inline struct Qdisc *qdisc_replace(struct Qdisc *sch, struct Qdisc *new,
811 struct Qdisc **pold)
812{
813 struct Qdisc *old;
814
815 sch_tree_lock(sch);
816 old = *pold;
817 *pold = new;
818 if (old != NULL) {
68a66d14
KK
819 unsigned int qlen = old->q.qlen;
820 unsigned int backlog = old->qstats.backlog;
821
86a7996c 822 qdisc_reset(old);
68a66d14 823 qdisc_tree_reduce_backlog(old, qlen, backlog);
86a7996c
WC
824 }
825 sch_tree_unlock(sch);
826
827 return old;
828}
829
1b5c5493
ED
830static inline void rtnl_qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
831{
832 rtnl_kfree_skbs(skb, skb);
833 qdisc_qstats_drop(sch);
834}
835
520ac30f
ED
836
837static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch,
838 struct sk_buff **to_free)
9972b25d 839{
520ac30f 840 __qdisc_drop(skb, to_free);
25331d6c 841 qdisc_qstats_drop(sch);
9972b25d
TG
842
843 return NET_XMIT_DROP;
844}
845
e9bef55d
JDB
846/* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
847 long it will take to send a packet given its size.
848 */
849static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
850{
e08b0998
JDB
851 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
852 if (slot < 0)
853 slot = 0;
e9bef55d
JDB
854 slot >>= rtab->rate.cell_log;
855 if (slot > 255)
a02cec21 856 return rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF];
e9bef55d
JDB
857 return rtab->data[slot];
858}
859
292f1c7f 860struct psched_ratecfg {
130d3d68 861 u64 rate_bytes_ps; /* bytes per second */
01cb71d2
ED
862 u32 mult;
863 u16 overhead;
8a8e3d84 864 u8 linklayer;
01cb71d2 865 u8 shift;
292f1c7f
JP
866};
867
868static inline u64 psched_l2t_ns(const struct psched_ratecfg *r,
869 unsigned int len)
870{
8a8e3d84
JDB
871 len += r->overhead;
872
873 if (unlikely(r->linklayer == TC_LINKLAYER_ATM))
874 return ((u64)(DIV_ROUND_UP(len,48)*53) * r->mult) >> r->shift;
875
876 return ((u64)len * r->mult) >> r->shift;
292f1c7f
JP
877}
878
5c15257f 879void psched_ratecfg_precompute(struct psched_ratecfg *r,
3e1e3aae
ED
880 const struct tc_ratespec *conf,
881 u64 rate64);
292f1c7f 882
01cb71d2
ED
883static inline void psched_ratecfg_getrate(struct tc_ratespec *res,
884 const struct psched_ratecfg *r)
292f1c7f 885{
01cb71d2 886 memset(res, 0, sizeof(*res));
3e1e3aae
ED
887
888 /* legacy struct tc_ratespec has a 32bit @rate field
889 * Qdisc using 64bit rate should add new attributes
890 * in order to maintain compatibility.
891 */
892 res->rate = min_t(u64, r->rate_bytes_ps, ~0U);
893
01cb71d2 894 res->overhead = r->overhead;
8a8e3d84 895 res->linklayer = (r->linklayer & TC_LINKLAYER_MASK);
292f1c7f
JP
896}
897
1da177e4 898#endif