Loading...
1/* SPDX-License-Identifier: GPL-2.0 */
2#ifndef __NET_SCHED_GENERIC_H
3#define __NET_SCHED_GENERIC_H
4
5#include <linux/netdevice.h>
6#include <linux/types.h>
7#include <linux/rcupdate.h>
8#include <linux/pkt_sched.h>
9#include <linux/pkt_cls.h>
10#include <linux/percpu.h>
11#include <linux/dynamic_queue_limits.h>
12#include <linux/list.h>
13#include <linux/refcount.h>
14#include <linux/workqueue.h>
15#include <net/gen_stats.h>
16#include <net/rtnetlink.h>
17
18struct Qdisc_ops;
19struct qdisc_walker;
20struct tcf_walker;
21struct module;
22
23struct qdisc_rate_table {
24 struct tc_ratespec rate;
25 u32 data[256];
26 struct qdisc_rate_table *next;
27 int refcnt;
28};
29
30enum qdisc_state_t {
31 __QDISC_STATE_SCHED,
32 __QDISC_STATE_DEACTIVATED,
33 __QDISC_STATE_RUNNING,
34};
35
36struct qdisc_size_table {
37 struct rcu_head rcu;
38 struct list_head list;
39 struct tc_sizespec szopts;
40 int refcnt;
41 u16 data[];
42};
43
44/* similar to sk_buff_head, but skb->prev pointer is undefined. */
45struct qdisc_skb_head {
46 struct sk_buff *head;
47 struct sk_buff *tail;
48 __u32 qlen;
49 spinlock_t lock;
50};
51
52struct Qdisc {
53 int (*enqueue)(struct sk_buff *skb,
54 struct Qdisc *sch,
55 struct sk_buff **to_free);
56 struct sk_buff * (*dequeue)(struct Qdisc *sch);
57 unsigned int flags;
58#define TCQ_F_BUILTIN 1
59#define TCQ_F_INGRESS 2
60#define TCQ_F_CAN_BYPASS 4
61#define TCQ_F_MQROOT 8
62#define TCQ_F_ONETXQUEUE 0x10 /* dequeue_skb() can assume all skbs are for
63 * q->dev_queue : It can test
64 * netif_xmit_frozen_or_stopped() before
65 * dequeueing next packet.
66 * Its true for MQ/MQPRIO slaves, or non
67 * multiqueue device.
68 */
69#define TCQ_F_WARN_NONWC (1 << 16)
70#define TCQ_F_CPUSTATS 0x20 /* run using percpu statistics */
71#define TCQ_F_NOPARENT 0x40 /* root of its hierarchy :
72 * qdisc_tree_decrease_qlen() should stop.
73 */
74#define TCQ_F_INVISIBLE 0x80 /* invisible by default in dump */
75#define TCQ_F_NOLOCK 0x100 /* qdisc does not require locking */
76#define TCQ_F_OFFLOADED 0x200 /* qdisc is offloaded to HW */
77 u32 limit;
78 const struct Qdisc_ops *ops;
79 struct qdisc_size_table __rcu *stab;
80 struct hlist_node hash;
81 u32 handle;
82 u32 parent;
83
84 struct netdev_queue *dev_queue;
85
86 struct net_rate_estimator __rcu *rate_est;
87 struct gnet_stats_basic_cpu __percpu *cpu_bstats;
88 struct gnet_stats_queue __percpu *cpu_qstats;
89
90 /*
91 * For performance sake on SMP, we put highly modified fields at the end
92 */
93 struct sk_buff_head gso_skb ____cacheline_aligned_in_smp;
94 struct qdisc_skb_head q;
95 struct gnet_stats_basic_packed bstats;
96 seqcount_t running;
97 struct gnet_stats_queue qstats;
98 unsigned long state;
99 struct Qdisc *next_sched;
100 struct sk_buff_head skb_bad_txq;
101 int padded;
102 refcount_t refcnt;
103
104 spinlock_t busylock ____cacheline_aligned_in_smp;
105};
106
107static inline void qdisc_refcount_inc(struct Qdisc *qdisc)
108{
109 if (qdisc->flags & TCQ_F_BUILTIN)
110 return;
111 refcount_inc(&qdisc->refcnt);
112}
113
114static inline bool qdisc_is_running(const struct Qdisc *qdisc)
115{
116 return (raw_read_seqcount(&qdisc->running) & 1) ? true : false;
117}
118
119static inline bool qdisc_run_begin(struct Qdisc *qdisc)
120{
121 if (qdisc_is_running(qdisc))
122 return false;
123 /* Variant of write_seqcount_begin() telling lockdep a trylock
124 * was attempted.
125 */
126 raw_write_seqcount_begin(&qdisc->running);
127 seqcount_acquire(&qdisc->running.dep_map, 0, 1, _RET_IP_);
128 return true;
129}
130
131static inline void qdisc_run_end(struct Qdisc *qdisc)
132{
133 write_seqcount_end(&qdisc->running);
134}
135
136static inline bool qdisc_may_bulk(const struct Qdisc *qdisc)
137{
138 return qdisc->flags & TCQ_F_ONETXQUEUE;
139}
140
141static inline int qdisc_avail_bulklimit(const struct netdev_queue *txq)
142{
143#ifdef CONFIG_BQL
144 /* Non-BQL migrated drivers will return 0, too. */
145 return dql_avail(&txq->dql);
146#else
147 return 0;
148#endif
149}
150
151struct Qdisc_class_ops {
152 /* Child qdisc manipulation */
153 struct netdev_queue * (*select_queue)(struct Qdisc *, struct tcmsg *);
154 int (*graft)(struct Qdisc *, unsigned long cl,
155 struct Qdisc *, struct Qdisc **,
156 struct netlink_ext_ack *extack);
157 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
158 void (*qlen_notify)(struct Qdisc *, unsigned long);
159
160 /* Class manipulation routines */
161 unsigned long (*find)(struct Qdisc *, u32 classid);
162 int (*change)(struct Qdisc *, u32, u32,
163 struct nlattr **, unsigned long *,
164 struct netlink_ext_ack *);
165 int (*delete)(struct Qdisc *, unsigned long);
166 void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
167
168 /* Filter manipulation */
169 struct tcf_block * (*tcf_block)(struct Qdisc *sch,
170 unsigned long arg,
171 struct netlink_ext_ack *extack);
172 unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
173 u32 classid);
174 void (*unbind_tcf)(struct Qdisc *, unsigned long);
175
176 /* rtnetlink specific */
177 int (*dump)(struct Qdisc *, unsigned long,
178 struct sk_buff *skb, struct tcmsg*);
179 int (*dump_stats)(struct Qdisc *, unsigned long,
180 struct gnet_dump *);
181};
182
183struct Qdisc_ops {
184 struct Qdisc_ops *next;
185 const struct Qdisc_class_ops *cl_ops;
186 char id[IFNAMSIZ];
187 int priv_size;
188 unsigned int static_flags;
189
190 int (*enqueue)(struct sk_buff *skb,
191 struct Qdisc *sch,
192 struct sk_buff **to_free);
193 struct sk_buff * (*dequeue)(struct Qdisc *);
194 struct sk_buff * (*peek)(struct Qdisc *);
195
196 int (*init)(struct Qdisc *sch, struct nlattr *arg,
197 struct netlink_ext_ack *extack);
198 void (*reset)(struct Qdisc *);
199 void (*destroy)(struct Qdisc *);
200 int (*change)(struct Qdisc *sch,
201 struct nlattr *arg,
202 struct netlink_ext_ack *extack);
203 void (*attach)(struct Qdisc *sch);
204 int (*change_tx_queue_len)(struct Qdisc *, unsigned int);
205
206 int (*dump)(struct Qdisc *, struct sk_buff *);
207 int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
208
209 void (*ingress_block_set)(struct Qdisc *sch,
210 u32 block_index);
211 void (*egress_block_set)(struct Qdisc *sch,
212 u32 block_index);
213 u32 (*ingress_block_get)(struct Qdisc *sch);
214 u32 (*egress_block_get)(struct Qdisc *sch);
215
216 struct module *owner;
217};
218
219
220struct tcf_result {
221 union {
222 struct {
223 unsigned long class;
224 u32 classid;
225 };
226 const struct tcf_proto *goto_tp;
227 };
228};
229
230struct tcf_proto_ops {
231 struct list_head head;
232 char kind[IFNAMSIZ];
233
234 int (*classify)(struct sk_buff *,
235 const struct tcf_proto *,
236 struct tcf_result *);
237 int (*init)(struct tcf_proto*);
238 void (*destroy)(struct tcf_proto *tp,
239 struct netlink_ext_ack *extack);
240
241 void* (*get)(struct tcf_proto*, u32 handle);
242 int (*change)(struct net *net, struct sk_buff *,
243 struct tcf_proto*, unsigned long,
244 u32 handle, struct nlattr **,
245 void **, bool,
246 struct netlink_ext_ack *);
247 int (*delete)(struct tcf_proto *tp, void *arg,
248 bool *last,
249 struct netlink_ext_ack *);
250 void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
251 void (*bind_class)(void *, u32, unsigned long);
252
253 /* rtnetlink specific */
254 int (*dump)(struct net*, struct tcf_proto*, void *,
255 struct sk_buff *skb, struct tcmsg*);
256
257 struct module *owner;
258};
259
260struct tcf_proto {
261 /* Fast access part */
262 struct tcf_proto __rcu *next;
263 void __rcu *root;
264 int (*classify)(struct sk_buff *,
265 const struct tcf_proto *,
266 struct tcf_result *);
267 __be16 protocol;
268
269 /* All the rest */
270 u32 prio;
271 void *data;
272 const struct tcf_proto_ops *ops;
273 struct tcf_chain *chain;
274 struct rcu_head rcu;
275};
276
277struct qdisc_skb_cb {
278 unsigned int pkt_len;
279 u16 slave_dev_queue_mapping;
280 u16 tc_classid;
281#define QDISC_CB_PRIV_LEN 20
282 unsigned char data[QDISC_CB_PRIV_LEN];
283};
284
285typedef void tcf_chain_head_change_t(struct tcf_proto *tp_head, void *priv);
286
287struct tcf_chain {
288 struct tcf_proto __rcu *filter_chain;
289 struct list_head filter_chain_list;
290 struct list_head list;
291 struct tcf_block *block;
292 u32 index; /* chain index */
293 unsigned int refcnt;
294};
295
296struct tcf_block {
297 struct list_head chain_list;
298 u32 index; /* block index for shared blocks */
299 unsigned int refcnt;
300 struct net *net;
301 struct Qdisc *q;
302 struct list_head cb_list;
303 struct list_head owner_list;
304 bool keep_dst;
305 unsigned int offloadcnt; /* Number of oddloaded filters */
306 unsigned int nooffloaddevcnt; /* Number of devs unable to do offload */
307};
308
309static inline void tcf_block_offload_inc(struct tcf_block *block, u32 *flags)
310{
311 if (*flags & TCA_CLS_FLAGS_IN_HW)
312 return;
313 *flags |= TCA_CLS_FLAGS_IN_HW;
314 block->offloadcnt++;
315}
316
317static inline void tcf_block_offload_dec(struct tcf_block *block, u32 *flags)
318{
319 if (!(*flags & TCA_CLS_FLAGS_IN_HW))
320 return;
321 *flags &= ~TCA_CLS_FLAGS_IN_HW;
322 block->offloadcnt--;
323}
324
325static inline void qdisc_cb_private_validate(const struct sk_buff *skb, int sz)
326{
327 struct qdisc_skb_cb *qcb;
328
329 BUILD_BUG_ON(sizeof(skb->cb) < offsetof(struct qdisc_skb_cb, data) + sz);
330 BUILD_BUG_ON(sizeof(qcb->data) < sz);
331}
332
333static inline int qdisc_qlen_cpu(const struct Qdisc *q)
334{
335 return this_cpu_ptr(q->cpu_qstats)->qlen;
336}
337
338static inline int qdisc_qlen(const struct Qdisc *q)
339{
340 return q->q.qlen;
341}
342
343static inline int qdisc_qlen_sum(const struct Qdisc *q)
344{
345 __u32 qlen = 0;
346 int i;
347
348 if (q->flags & TCQ_F_NOLOCK) {
349 for_each_possible_cpu(i)
350 qlen += per_cpu_ptr(q->cpu_qstats, i)->qlen;
351 } else {
352 qlen = q->q.qlen;
353 }
354
355 return qlen;
356}
357
358static inline struct qdisc_skb_cb *qdisc_skb_cb(const struct sk_buff *skb)
359{
360 return (struct qdisc_skb_cb *)skb->cb;
361}
362
363static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
364{
365 return &qdisc->q.lock;
366}
367
368static inline struct Qdisc *qdisc_root(const struct Qdisc *qdisc)
369{
370 struct Qdisc *q = rcu_dereference_rtnl(qdisc->dev_queue->qdisc);
371
372 return q;
373}
374
375static inline struct Qdisc *qdisc_root_sleeping(const struct Qdisc *qdisc)
376{
377 return qdisc->dev_queue->qdisc_sleeping;
378}
379
380/* The qdisc root lock is a mechanism by which to top level
381 * of a qdisc tree can be locked from any qdisc node in the
382 * forest. This allows changing the configuration of some
383 * aspect of the qdisc tree while blocking out asynchronous
384 * qdisc access in the packet processing paths.
385 *
386 * It is only legal to do this when the root will not change
387 * on us. Otherwise we'll potentially lock the wrong qdisc
388 * root. This is enforced by holding the RTNL semaphore, which
389 * all users of this lock accessor must do.
390 */
391static inline spinlock_t *qdisc_root_lock(const struct Qdisc *qdisc)
392{
393 struct Qdisc *root = qdisc_root(qdisc);
394
395 ASSERT_RTNL();
396 return qdisc_lock(root);
397}
398
399static inline spinlock_t *qdisc_root_sleeping_lock(const struct Qdisc *qdisc)
400{
401 struct Qdisc *root = qdisc_root_sleeping(qdisc);
402
403 ASSERT_RTNL();
404 return qdisc_lock(root);
405}
406
407static inline seqcount_t *qdisc_root_sleeping_running(const struct Qdisc *qdisc)
408{
409 struct Qdisc *root = qdisc_root_sleeping(qdisc);
410
411 ASSERT_RTNL();
412 return &root->running;
413}
414
415static inline struct net_device *qdisc_dev(const struct Qdisc *qdisc)
416{
417 return qdisc->dev_queue->dev;
418}
419
420static inline void sch_tree_lock(const struct Qdisc *q)
421{
422 spin_lock_bh(qdisc_root_sleeping_lock(q));
423}
424
425static inline void sch_tree_unlock(const struct Qdisc *q)
426{
427 spin_unlock_bh(qdisc_root_sleeping_lock(q));
428}
429
430extern struct Qdisc noop_qdisc;
431extern struct Qdisc_ops noop_qdisc_ops;
432extern struct Qdisc_ops pfifo_fast_ops;
433extern struct Qdisc_ops mq_qdisc_ops;
434extern struct Qdisc_ops noqueue_qdisc_ops;
435extern const struct Qdisc_ops *default_qdisc_ops;
436static inline const struct Qdisc_ops *
437get_default_qdisc_ops(const struct net_device *dev, int ntx)
438{
439 return ntx < dev->real_num_tx_queues ?
440 default_qdisc_ops : &pfifo_fast_ops;
441}
442
443struct Qdisc_class_common {
444 u32 classid;
445 struct hlist_node hnode;
446};
447
448struct Qdisc_class_hash {
449 struct hlist_head *hash;
450 unsigned int hashsize;
451 unsigned int hashmask;
452 unsigned int hashelems;
453};
454
455static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
456{
457 id ^= id >> 8;
458 id ^= id >> 4;
459 return id & mask;
460}
461
462static inline struct Qdisc_class_common *
463qdisc_class_find(const struct Qdisc_class_hash *hash, u32 id)
464{
465 struct Qdisc_class_common *cl;
466 unsigned int h;
467
468 if (!id)
469 return NULL;
470
471 h = qdisc_class_hash(id, hash->hashmask);
472 hlist_for_each_entry(cl, &hash->hash[h], hnode) {
473 if (cl->classid == id)
474 return cl;
475 }
476 return NULL;
477}
478
479static inline int tc_classid_to_hwtc(struct net_device *dev, u32 classid)
480{
481 u32 hwtc = TC_H_MIN(classid) - TC_H_MIN_PRIORITY;
482
483 return (hwtc < netdev_get_num_tc(dev)) ? hwtc : -EINVAL;
484}
485
486int qdisc_class_hash_init(struct Qdisc_class_hash *);
487void qdisc_class_hash_insert(struct Qdisc_class_hash *,
488 struct Qdisc_class_common *);
489void qdisc_class_hash_remove(struct Qdisc_class_hash *,
490 struct Qdisc_class_common *);
491void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
492void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
493
494int dev_qdisc_change_tx_queue_len(struct net_device *dev);
495void dev_init_scheduler(struct net_device *dev);
496void dev_shutdown(struct net_device *dev);
497void dev_activate(struct net_device *dev);
498void dev_deactivate(struct net_device *dev);
499void dev_deactivate_many(struct list_head *head);
500struct Qdisc *dev_graft_qdisc(struct netdev_queue *dev_queue,
501 struct Qdisc *qdisc);
502void qdisc_reset(struct Qdisc *qdisc);
503void qdisc_destroy(struct Qdisc *qdisc);
504void qdisc_tree_reduce_backlog(struct Qdisc *qdisc, unsigned int n,
505 unsigned int len);
506struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
507 const struct Qdisc_ops *ops,
508 struct netlink_ext_ack *extack);
509void qdisc_free(struct Qdisc *qdisc);
510struct Qdisc *qdisc_create_dflt(struct netdev_queue *dev_queue,
511 const struct Qdisc_ops *ops, u32 parentid,
512 struct netlink_ext_ack *extack);
513void __qdisc_calculate_pkt_len(struct sk_buff *skb,
514 const struct qdisc_size_table *stab);
515int skb_do_redirect(struct sk_buff *);
516
517static inline void skb_reset_tc(struct sk_buff *skb)
518{
519#ifdef CONFIG_NET_CLS_ACT
520 skb->tc_redirected = 0;
521#endif
522}
523
524static inline bool skb_at_tc_ingress(const struct sk_buff *skb)
525{
526#ifdef CONFIG_NET_CLS_ACT
527 return skb->tc_at_ingress;
528#else
529 return false;
530#endif
531}
532
533static inline bool skb_skip_tc_classify(struct sk_buff *skb)
534{
535#ifdef CONFIG_NET_CLS_ACT
536 if (skb->tc_skip_classify) {
537 skb->tc_skip_classify = 0;
538 return true;
539 }
540#endif
541 return false;
542}
543
544/* Reset all TX qdiscs greater than index of a device. */
545static inline void qdisc_reset_all_tx_gt(struct net_device *dev, unsigned int i)
546{
547 struct Qdisc *qdisc;
548
549 for (; i < dev->num_tx_queues; i++) {
550 qdisc = rtnl_dereference(netdev_get_tx_queue(dev, i)->qdisc);
551 if (qdisc) {
552 spin_lock_bh(qdisc_lock(qdisc));
553 qdisc_reset(qdisc);
554 spin_unlock_bh(qdisc_lock(qdisc));
555 }
556 }
557}
558
559static inline void qdisc_reset_all_tx(struct net_device *dev)
560{
561 qdisc_reset_all_tx_gt(dev, 0);
562}
563
564/* Are all TX queues of the device empty? */
565static inline bool qdisc_all_tx_empty(const struct net_device *dev)
566{
567 unsigned int i;
568
569 rcu_read_lock();
570 for (i = 0; i < dev->num_tx_queues; i++) {
571 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
572 const struct Qdisc *q = rcu_dereference(txq->qdisc);
573
574 if (q->q.qlen) {
575 rcu_read_unlock();
576 return false;
577 }
578 }
579 rcu_read_unlock();
580 return true;
581}
582
583/* Are any of the TX qdiscs changing? */
584static inline bool qdisc_tx_changing(const struct net_device *dev)
585{
586 unsigned int i;
587
588 for (i = 0; i < dev->num_tx_queues; i++) {
589 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
590 if (rcu_access_pointer(txq->qdisc) != txq->qdisc_sleeping)
591 return true;
592 }
593 return false;
594}
595
596/* Is the device using the noop qdisc on all queues? */
597static inline bool qdisc_tx_is_noop(const struct net_device *dev)
598{
599 unsigned int i;
600
601 for (i = 0; i < dev->num_tx_queues; i++) {
602 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
603 if (rcu_access_pointer(txq->qdisc) != &noop_qdisc)
604 return false;
605 }
606 return true;
607}
608
609static inline unsigned int qdisc_pkt_len(const struct sk_buff *skb)
610{
611 return qdisc_skb_cb(skb)->pkt_len;
612}
613
614/* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
615enum net_xmit_qdisc_t {
616 __NET_XMIT_STOLEN = 0x00010000,
617 __NET_XMIT_BYPASS = 0x00020000,
618};
619
620#ifdef CONFIG_NET_CLS_ACT
621#define net_xmit_drop_count(e) ((e) & __NET_XMIT_STOLEN ? 0 : 1)
622#else
623#define net_xmit_drop_count(e) (1)
624#endif
625
626static inline void qdisc_calculate_pkt_len(struct sk_buff *skb,
627 const struct Qdisc *sch)
628{
629#ifdef CONFIG_NET_SCHED
630 struct qdisc_size_table *stab = rcu_dereference_bh(sch->stab);
631
632 if (stab)
633 __qdisc_calculate_pkt_len(skb, stab);
634#endif
635}
636
637static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch,
638 struct sk_buff **to_free)
639{
640 qdisc_calculate_pkt_len(skb, sch);
641 return sch->enqueue(skb, sch, to_free);
642}
643
644static inline bool qdisc_is_percpu_stats(const struct Qdisc *q)
645{
646 return q->flags & TCQ_F_CPUSTATS;
647}
648
649static inline void _bstats_update(struct gnet_stats_basic_packed *bstats,
650 __u64 bytes, __u32 packets)
651{
652 bstats->bytes += bytes;
653 bstats->packets += packets;
654}
655
656static inline void bstats_update(struct gnet_stats_basic_packed *bstats,
657 const struct sk_buff *skb)
658{
659 _bstats_update(bstats,
660 qdisc_pkt_len(skb),
661 skb_is_gso(skb) ? skb_shinfo(skb)->gso_segs : 1);
662}
663
664static inline void _bstats_cpu_update(struct gnet_stats_basic_cpu *bstats,
665 __u64 bytes, __u32 packets)
666{
667 u64_stats_update_begin(&bstats->syncp);
668 _bstats_update(&bstats->bstats, bytes, packets);
669 u64_stats_update_end(&bstats->syncp);
670}
671
672static inline void bstats_cpu_update(struct gnet_stats_basic_cpu *bstats,
673 const struct sk_buff *skb)
674{
675 u64_stats_update_begin(&bstats->syncp);
676 bstats_update(&bstats->bstats, skb);
677 u64_stats_update_end(&bstats->syncp);
678}
679
680static inline void qdisc_bstats_cpu_update(struct Qdisc *sch,
681 const struct sk_buff *skb)
682{
683 bstats_cpu_update(this_cpu_ptr(sch->cpu_bstats), skb);
684}
685
686static inline void qdisc_bstats_update(struct Qdisc *sch,
687 const struct sk_buff *skb)
688{
689 bstats_update(&sch->bstats, skb);
690}
691
692static inline void qdisc_qstats_backlog_dec(struct Qdisc *sch,
693 const struct sk_buff *skb)
694{
695 sch->qstats.backlog -= qdisc_pkt_len(skb);
696}
697
698static inline void qdisc_qstats_cpu_backlog_dec(struct Qdisc *sch,
699 const struct sk_buff *skb)
700{
701 this_cpu_sub(sch->cpu_qstats->backlog, qdisc_pkt_len(skb));
702}
703
704static inline void qdisc_qstats_backlog_inc(struct Qdisc *sch,
705 const struct sk_buff *skb)
706{
707 sch->qstats.backlog += qdisc_pkt_len(skb);
708}
709
710static inline void qdisc_qstats_cpu_backlog_inc(struct Qdisc *sch,
711 const struct sk_buff *skb)
712{
713 this_cpu_add(sch->cpu_qstats->backlog, qdisc_pkt_len(skb));
714}
715
716static inline void qdisc_qstats_cpu_qlen_inc(struct Qdisc *sch)
717{
718 this_cpu_inc(sch->cpu_qstats->qlen);
719}
720
721static inline void qdisc_qstats_cpu_qlen_dec(struct Qdisc *sch)
722{
723 this_cpu_dec(sch->cpu_qstats->qlen);
724}
725
726static inline void qdisc_qstats_cpu_requeues_inc(struct Qdisc *sch)
727{
728 this_cpu_inc(sch->cpu_qstats->requeues);
729}
730
731static inline void __qdisc_qstats_drop(struct Qdisc *sch, int count)
732{
733 sch->qstats.drops += count;
734}
735
736static inline void qstats_drop_inc(struct gnet_stats_queue *qstats)
737{
738 qstats->drops++;
739}
740
741static inline void qstats_overlimit_inc(struct gnet_stats_queue *qstats)
742{
743 qstats->overlimits++;
744}
745
746static inline void qdisc_qstats_drop(struct Qdisc *sch)
747{
748 qstats_drop_inc(&sch->qstats);
749}
750
751static inline void qdisc_qstats_cpu_drop(struct Qdisc *sch)
752{
753 this_cpu_inc(sch->cpu_qstats->drops);
754}
755
756static inline void qdisc_qstats_overlimit(struct Qdisc *sch)
757{
758 sch->qstats.overlimits++;
759}
760
761static inline void qdisc_skb_head_init(struct qdisc_skb_head *qh)
762{
763 qh->head = NULL;
764 qh->tail = NULL;
765 qh->qlen = 0;
766}
767
768static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
769 struct qdisc_skb_head *qh)
770{
771 struct sk_buff *last = qh->tail;
772
773 if (last) {
774 skb->next = NULL;
775 last->next = skb;
776 qh->tail = skb;
777 } else {
778 qh->tail = skb;
779 qh->head = skb;
780 }
781 qh->qlen++;
782 qdisc_qstats_backlog_inc(sch, skb);
783
784 return NET_XMIT_SUCCESS;
785}
786
787static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
788{
789 return __qdisc_enqueue_tail(skb, sch, &sch->q);
790}
791
792static inline struct sk_buff *__qdisc_dequeue_head(struct qdisc_skb_head *qh)
793{
794 struct sk_buff *skb = qh->head;
795
796 if (likely(skb != NULL)) {
797 qh->head = skb->next;
798 qh->qlen--;
799 if (qh->head == NULL)
800 qh->tail = NULL;
801 skb->next = NULL;
802 }
803
804 return skb;
805}
806
807static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
808{
809 struct sk_buff *skb = __qdisc_dequeue_head(&sch->q);
810
811 if (likely(skb != NULL)) {
812 qdisc_qstats_backlog_dec(sch, skb);
813 qdisc_bstats_update(sch, skb);
814 }
815
816 return skb;
817}
818
819/* Instead of calling kfree_skb() while root qdisc lock is held,
820 * queue the skb for future freeing at end of __dev_xmit_skb()
821 */
822static inline void __qdisc_drop(struct sk_buff *skb, struct sk_buff **to_free)
823{
824 skb->next = *to_free;
825 *to_free = skb;
826}
827
828static inline void __qdisc_drop_all(struct sk_buff *skb,
829 struct sk_buff **to_free)
830{
831 if (skb->prev)
832 skb->prev->next = *to_free;
833 else
834 skb->next = *to_free;
835 *to_free = skb;
836}
837
838static inline unsigned int __qdisc_queue_drop_head(struct Qdisc *sch,
839 struct qdisc_skb_head *qh,
840 struct sk_buff **to_free)
841{
842 struct sk_buff *skb = __qdisc_dequeue_head(qh);
843
844 if (likely(skb != NULL)) {
845 unsigned int len = qdisc_pkt_len(skb);
846
847 qdisc_qstats_backlog_dec(sch, skb);
848 __qdisc_drop(skb, to_free);
849 return len;
850 }
851
852 return 0;
853}
854
855static inline unsigned int qdisc_queue_drop_head(struct Qdisc *sch,
856 struct sk_buff **to_free)
857{
858 return __qdisc_queue_drop_head(sch, &sch->q, to_free);
859}
860
861static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
862{
863 const struct qdisc_skb_head *qh = &sch->q;
864
865 return qh->head;
866}
867
868/* generic pseudo peek method for non-work-conserving qdisc */
869static inline struct sk_buff *qdisc_peek_dequeued(struct Qdisc *sch)
870{
871 struct sk_buff *skb = skb_peek(&sch->gso_skb);
872
873 /* we can reuse ->gso_skb because peek isn't called for root qdiscs */
874 if (!skb) {
875 skb = sch->dequeue(sch);
876
877 if (skb) {
878 __skb_queue_head(&sch->gso_skb, skb);
879 /* it's still part of the queue */
880 qdisc_qstats_backlog_inc(sch, skb);
881 sch->q.qlen++;
882 }
883 }
884
885 return skb;
886}
887
888/* use instead of qdisc->dequeue() for all qdiscs queried with ->peek() */
889static inline struct sk_buff *qdisc_dequeue_peeked(struct Qdisc *sch)
890{
891 struct sk_buff *skb = skb_peek(&sch->gso_skb);
892
893 if (skb) {
894 skb = __skb_dequeue(&sch->gso_skb);
895 qdisc_qstats_backlog_dec(sch, skb);
896 sch->q.qlen--;
897 } else {
898 skb = sch->dequeue(sch);
899 }
900
901 return skb;
902}
903
904static inline void __qdisc_reset_queue(struct qdisc_skb_head *qh)
905{
906 /*
907 * We do not know the backlog in bytes of this list, it
908 * is up to the caller to correct it
909 */
910 ASSERT_RTNL();
911 if (qh->qlen) {
912 rtnl_kfree_skbs(qh->head, qh->tail);
913
914 qh->head = NULL;
915 qh->tail = NULL;
916 qh->qlen = 0;
917 }
918}
919
920static inline void qdisc_reset_queue(struct Qdisc *sch)
921{
922 __qdisc_reset_queue(&sch->q);
923 sch->qstats.backlog = 0;
924}
925
926static inline struct Qdisc *qdisc_replace(struct Qdisc *sch, struct Qdisc *new,
927 struct Qdisc **pold)
928{
929 struct Qdisc *old;
930
931 sch_tree_lock(sch);
932 old = *pold;
933 *pold = new;
934 if (old != NULL) {
935 unsigned int qlen = old->q.qlen;
936 unsigned int backlog = old->qstats.backlog;
937
938 qdisc_reset(old);
939 qdisc_tree_reduce_backlog(old, qlen, backlog);
940 }
941 sch_tree_unlock(sch);
942
943 return old;
944}
945
946static inline void rtnl_qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
947{
948 rtnl_kfree_skbs(skb, skb);
949 qdisc_qstats_drop(sch);
950}
951
952static inline int qdisc_drop_cpu(struct sk_buff *skb, struct Qdisc *sch,
953 struct sk_buff **to_free)
954{
955 __qdisc_drop(skb, to_free);
956 qdisc_qstats_cpu_drop(sch);
957
958 return NET_XMIT_DROP;
959}
960
961static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch,
962 struct sk_buff **to_free)
963{
964 __qdisc_drop(skb, to_free);
965 qdisc_qstats_drop(sch);
966
967 return NET_XMIT_DROP;
968}
969
970static inline int qdisc_drop_all(struct sk_buff *skb, struct Qdisc *sch,
971 struct sk_buff **to_free)
972{
973 __qdisc_drop_all(skb, to_free);
974 qdisc_qstats_drop(sch);
975
976 return NET_XMIT_DROP;
977}
978
979/* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
980 long it will take to send a packet given its size.
981 */
982static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
983{
984 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
985 if (slot < 0)
986 slot = 0;
987 slot >>= rtab->rate.cell_log;
988 if (slot > 255)
989 return rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF];
990 return rtab->data[slot];
991}
992
993struct psched_ratecfg {
994 u64 rate_bytes_ps; /* bytes per second */
995 u32 mult;
996 u16 overhead;
997 u8 linklayer;
998 u8 shift;
999};
1000
1001static inline u64 psched_l2t_ns(const struct psched_ratecfg *r,
1002 unsigned int len)
1003{
1004 len += r->overhead;
1005
1006 if (unlikely(r->linklayer == TC_LINKLAYER_ATM))
1007 return ((u64)(DIV_ROUND_UP(len,48)*53) * r->mult) >> r->shift;
1008
1009 return ((u64)len * r->mult) >> r->shift;
1010}
1011
1012void psched_ratecfg_precompute(struct psched_ratecfg *r,
1013 const struct tc_ratespec *conf,
1014 u64 rate64);
1015
1016static inline void psched_ratecfg_getrate(struct tc_ratespec *res,
1017 const struct psched_ratecfg *r)
1018{
1019 memset(res, 0, sizeof(*res));
1020
1021 /* legacy struct tc_ratespec has a 32bit @rate field
1022 * Qdisc using 64bit rate should add new attributes
1023 * in order to maintain compatibility.
1024 */
1025 res->rate = min_t(u64, r->rate_bytes_ps, ~0U);
1026
1027 res->overhead = r->overhead;
1028 res->linklayer = (r->linklayer & TC_LINKLAYER_MASK);
1029}
1030
1031/* Mini Qdisc serves for specific needs of ingress/clsact Qdisc.
1032 * The fast path only needs to access filter list and to update stats
1033 */
1034struct mini_Qdisc {
1035 struct tcf_proto *filter_list;
1036 struct gnet_stats_basic_cpu __percpu *cpu_bstats;
1037 struct gnet_stats_queue __percpu *cpu_qstats;
1038 struct rcu_head rcu;
1039};
1040
1041static inline void mini_qdisc_bstats_cpu_update(struct mini_Qdisc *miniq,
1042 const struct sk_buff *skb)
1043{
1044 bstats_cpu_update(this_cpu_ptr(miniq->cpu_bstats), skb);
1045}
1046
1047static inline void mini_qdisc_qstats_cpu_drop(struct mini_Qdisc *miniq)
1048{
1049 this_cpu_inc(miniq->cpu_qstats->drops);
1050}
1051
1052struct mini_Qdisc_pair {
1053 struct mini_Qdisc miniq1;
1054 struct mini_Qdisc miniq2;
1055 struct mini_Qdisc __rcu **p_miniq;
1056};
1057
1058void mini_qdisc_pair_swap(struct mini_Qdisc_pair *miniqp,
1059 struct tcf_proto *tp_head);
1060void mini_qdisc_pair_init(struct mini_Qdisc_pair *miniqp, struct Qdisc *qdisc,
1061 struct mini_Qdisc __rcu **p_miniq);
1062
1063#endif
1#ifndef __NET_SCHED_GENERIC_H
2#define __NET_SCHED_GENERIC_H
3
4#include <linux/netdevice.h>
5#include <linux/types.h>
6#include <linux/rcupdate.h>
7#include <linux/pkt_sched.h>
8#include <linux/pkt_cls.h>
9#include <net/gen_stats.h>
10#include <net/rtnetlink.h>
11
12struct Qdisc_ops;
13struct qdisc_walker;
14struct tcf_walker;
15struct module;
16
17struct qdisc_rate_table {
18 struct tc_ratespec rate;
19 u32 data[256];
20 struct qdisc_rate_table *next;
21 int refcnt;
22};
23
24enum qdisc_state_t {
25 __QDISC_STATE_SCHED,
26 __QDISC_STATE_DEACTIVATED,
27 __QDISC_STATE_THROTTLED,
28};
29
30/*
31 * following bits are only changed while qdisc lock is held
32 */
33enum qdisc___state_t {
34 __QDISC___STATE_RUNNING = 1,
35};
36
37struct qdisc_size_table {
38 struct rcu_head rcu;
39 struct list_head list;
40 struct tc_sizespec szopts;
41 int refcnt;
42 u16 data[];
43};
44
45struct Qdisc {
46 int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
47 struct sk_buff * (*dequeue)(struct Qdisc *dev);
48 unsigned int flags;
49#define TCQ_F_BUILTIN 1
50#define TCQ_F_INGRESS 2
51#define TCQ_F_CAN_BYPASS 4
52#define TCQ_F_MQROOT 8
53#define TCQ_F_WARN_NONWC (1 << 16)
54 int padded;
55 const struct Qdisc_ops *ops;
56 struct qdisc_size_table __rcu *stab;
57 struct list_head list;
58 u32 handle;
59 u32 parent;
60 atomic_t refcnt;
61 struct gnet_stats_rate_est rate_est;
62 int (*reshape_fail)(struct sk_buff *skb,
63 struct Qdisc *q);
64
65 void *u32_node;
66
67 /* This field is deprecated, but it is still used by CBQ
68 * and it will live until better solution will be invented.
69 */
70 struct Qdisc *__parent;
71 struct netdev_queue *dev_queue;
72 struct Qdisc *next_sched;
73
74 struct sk_buff *gso_skb;
75 /*
76 * For performance sake on SMP, we put highly modified fields at the end
77 */
78 unsigned long state;
79 struct sk_buff_head q;
80 struct gnet_stats_basic_packed bstats;
81 unsigned int __state;
82 struct gnet_stats_queue qstats;
83 struct rcu_head rcu_head;
84 spinlock_t busylock;
85 u32 limit;
86};
87
88static inline bool qdisc_is_running(const struct Qdisc *qdisc)
89{
90 return (qdisc->__state & __QDISC___STATE_RUNNING) ? true : false;
91}
92
93static inline bool qdisc_run_begin(struct Qdisc *qdisc)
94{
95 if (qdisc_is_running(qdisc))
96 return false;
97 qdisc->__state |= __QDISC___STATE_RUNNING;
98 return true;
99}
100
101static inline void qdisc_run_end(struct Qdisc *qdisc)
102{
103 qdisc->__state &= ~__QDISC___STATE_RUNNING;
104}
105
106static inline bool qdisc_is_throttled(const struct Qdisc *qdisc)
107{
108 return test_bit(__QDISC_STATE_THROTTLED, &qdisc->state) ? true : false;
109}
110
111static inline void qdisc_throttled(struct Qdisc *qdisc)
112{
113 set_bit(__QDISC_STATE_THROTTLED, &qdisc->state);
114}
115
116static inline void qdisc_unthrottled(struct Qdisc *qdisc)
117{
118 clear_bit(__QDISC_STATE_THROTTLED, &qdisc->state);
119}
120
121struct Qdisc_class_ops {
122 /* Child qdisc manipulation */
123 struct netdev_queue * (*select_queue)(struct Qdisc *, struct tcmsg *);
124 int (*graft)(struct Qdisc *, unsigned long cl,
125 struct Qdisc *, struct Qdisc **);
126 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
127 void (*qlen_notify)(struct Qdisc *, unsigned long);
128
129 /* Class manipulation routines */
130 unsigned long (*get)(struct Qdisc *, u32 classid);
131 void (*put)(struct Qdisc *, unsigned long);
132 int (*change)(struct Qdisc *, u32, u32,
133 struct nlattr **, unsigned long *);
134 int (*delete)(struct Qdisc *, unsigned long);
135 void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
136
137 /* Filter manipulation */
138 struct tcf_proto ** (*tcf_chain)(struct Qdisc *, unsigned long);
139 unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
140 u32 classid);
141 void (*unbind_tcf)(struct Qdisc *, unsigned long);
142
143 /* rtnetlink specific */
144 int (*dump)(struct Qdisc *, unsigned long,
145 struct sk_buff *skb, struct tcmsg*);
146 int (*dump_stats)(struct Qdisc *, unsigned long,
147 struct gnet_dump *);
148};
149
150struct Qdisc_ops {
151 struct Qdisc_ops *next;
152 const struct Qdisc_class_ops *cl_ops;
153 char id[IFNAMSIZ];
154 int priv_size;
155
156 int (*enqueue)(struct sk_buff *, struct Qdisc *);
157 struct sk_buff * (*dequeue)(struct Qdisc *);
158 struct sk_buff * (*peek)(struct Qdisc *);
159 unsigned int (*drop)(struct Qdisc *);
160
161 int (*init)(struct Qdisc *, struct nlattr *arg);
162 void (*reset)(struct Qdisc *);
163 void (*destroy)(struct Qdisc *);
164 int (*change)(struct Qdisc *, struct nlattr *arg);
165 void (*attach)(struct Qdisc *);
166
167 int (*dump)(struct Qdisc *, struct sk_buff *);
168 int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
169
170 struct module *owner;
171};
172
173
174struct tcf_result {
175 unsigned long class;
176 u32 classid;
177};
178
179struct tcf_proto_ops {
180 struct tcf_proto_ops *next;
181 char kind[IFNAMSIZ];
182
183 int (*classify)(struct sk_buff *,
184 const struct tcf_proto *,
185 struct tcf_result *);
186 int (*init)(struct tcf_proto*);
187 void (*destroy)(struct tcf_proto*);
188
189 unsigned long (*get)(struct tcf_proto*, u32 handle);
190 void (*put)(struct tcf_proto*, unsigned long);
191 int (*change)(struct tcf_proto*, unsigned long,
192 u32 handle, struct nlattr **,
193 unsigned long *);
194 int (*delete)(struct tcf_proto*, unsigned long);
195 void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
196
197 /* rtnetlink specific */
198 int (*dump)(struct tcf_proto*, unsigned long,
199 struct sk_buff *skb, struct tcmsg*);
200
201 struct module *owner;
202};
203
204struct tcf_proto {
205 /* Fast access part */
206 struct tcf_proto *next;
207 void *root;
208 int (*classify)(struct sk_buff *,
209 const struct tcf_proto *,
210 struct tcf_result *);
211 __be16 protocol;
212
213 /* All the rest */
214 u32 prio;
215 u32 classid;
216 struct Qdisc *q;
217 void *data;
218 const struct tcf_proto_ops *ops;
219};
220
221struct qdisc_skb_cb {
222 unsigned int pkt_len;
223 u16 bond_queue_mapping;
224 u16 _pad;
225 unsigned char data[20];
226};
227
228static inline void qdisc_cb_private_validate(const struct sk_buff *skb, int sz)
229{
230 struct qdisc_skb_cb *qcb;
231
232 BUILD_BUG_ON(sizeof(skb->cb) < offsetof(struct qdisc_skb_cb, data) + sz);
233 BUILD_BUG_ON(sizeof(qcb->data) < sz);
234}
235
236static inline int qdisc_qlen(const struct Qdisc *q)
237{
238 return q->q.qlen;
239}
240
241static inline struct qdisc_skb_cb *qdisc_skb_cb(const struct sk_buff *skb)
242{
243 return (struct qdisc_skb_cb *)skb->cb;
244}
245
246static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
247{
248 return &qdisc->q.lock;
249}
250
251static inline struct Qdisc *qdisc_root(const struct Qdisc *qdisc)
252{
253 return qdisc->dev_queue->qdisc;
254}
255
256static inline struct Qdisc *qdisc_root_sleeping(const struct Qdisc *qdisc)
257{
258 return qdisc->dev_queue->qdisc_sleeping;
259}
260
261/* The qdisc root lock is a mechanism by which to top level
262 * of a qdisc tree can be locked from any qdisc node in the
263 * forest. This allows changing the configuration of some
264 * aspect of the qdisc tree while blocking out asynchronous
265 * qdisc access in the packet processing paths.
266 *
267 * It is only legal to do this when the root will not change
268 * on us. Otherwise we'll potentially lock the wrong qdisc
269 * root. This is enforced by holding the RTNL semaphore, which
270 * all users of this lock accessor must do.
271 */
272static inline spinlock_t *qdisc_root_lock(const struct Qdisc *qdisc)
273{
274 struct Qdisc *root = qdisc_root(qdisc);
275
276 ASSERT_RTNL();
277 return qdisc_lock(root);
278}
279
280static inline spinlock_t *qdisc_root_sleeping_lock(const struct Qdisc *qdisc)
281{
282 struct Qdisc *root = qdisc_root_sleeping(qdisc);
283
284 ASSERT_RTNL();
285 return qdisc_lock(root);
286}
287
288static inline struct net_device *qdisc_dev(const struct Qdisc *qdisc)
289{
290 return qdisc->dev_queue->dev;
291}
292
293static inline void sch_tree_lock(const struct Qdisc *q)
294{
295 spin_lock_bh(qdisc_root_sleeping_lock(q));
296}
297
298static inline void sch_tree_unlock(const struct Qdisc *q)
299{
300 spin_unlock_bh(qdisc_root_sleeping_lock(q));
301}
302
303#define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
304#define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
305
306extern struct Qdisc noop_qdisc;
307extern struct Qdisc_ops noop_qdisc_ops;
308extern struct Qdisc_ops pfifo_fast_ops;
309extern struct Qdisc_ops mq_qdisc_ops;
310
311struct Qdisc_class_common {
312 u32 classid;
313 struct hlist_node hnode;
314};
315
316struct Qdisc_class_hash {
317 struct hlist_head *hash;
318 unsigned int hashsize;
319 unsigned int hashmask;
320 unsigned int hashelems;
321};
322
323static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
324{
325 id ^= id >> 8;
326 id ^= id >> 4;
327 return id & mask;
328}
329
330static inline struct Qdisc_class_common *
331qdisc_class_find(const struct Qdisc_class_hash *hash, u32 id)
332{
333 struct Qdisc_class_common *cl;
334 struct hlist_node *n;
335 unsigned int h;
336
337 h = qdisc_class_hash(id, hash->hashmask);
338 hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
339 if (cl->classid == id)
340 return cl;
341 }
342 return NULL;
343}
344
345extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
346extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
347extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
348extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
349extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
350
351extern void dev_init_scheduler(struct net_device *dev);
352extern void dev_shutdown(struct net_device *dev);
353extern void dev_activate(struct net_device *dev);
354extern void dev_deactivate(struct net_device *dev);
355extern void dev_deactivate_many(struct list_head *head);
356extern struct Qdisc *dev_graft_qdisc(struct netdev_queue *dev_queue,
357 struct Qdisc *qdisc);
358extern void qdisc_reset(struct Qdisc *qdisc);
359extern void qdisc_destroy(struct Qdisc *qdisc);
360extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
361extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
362 struct Qdisc_ops *ops);
363extern struct Qdisc *qdisc_create_dflt(struct netdev_queue *dev_queue,
364 struct Qdisc_ops *ops, u32 parentid);
365extern void __qdisc_calculate_pkt_len(struct sk_buff *skb,
366 const struct qdisc_size_table *stab);
367extern void tcf_destroy(struct tcf_proto *tp);
368extern void tcf_destroy_chain(struct tcf_proto **fl);
369
370/* Reset all TX qdiscs greater then index of a device. */
371static inline void qdisc_reset_all_tx_gt(struct net_device *dev, unsigned int i)
372{
373 struct Qdisc *qdisc;
374
375 for (; i < dev->num_tx_queues; i++) {
376 qdisc = netdev_get_tx_queue(dev, i)->qdisc;
377 if (qdisc) {
378 spin_lock_bh(qdisc_lock(qdisc));
379 qdisc_reset(qdisc);
380 spin_unlock_bh(qdisc_lock(qdisc));
381 }
382 }
383}
384
385static inline void qdisc_reset_all_tx(struct net_device *dev)
386{
387 qdisc_reset_all_tx_gt(dev, 0);
388}
389
390/* Are all TX queues of the device empty? */
391static inline bool qdisc_all_tx_empty(const struct net_device *dev)
392{
393 unsigned int i;
394 for (i = 0; i < dev->num_tx_queues; i++) {
395 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
396 const struct Qdisc *q = txq->qdisc;
397
398 if (q->q.qlen)
399 return false;
400 }
401 return true;
402}
403
404/* Are any of the TX qdiscs changing? */
405static inline bool qdisc_tx_changing(const struct net_device *dev)
406{
407 unsigned int i;
408 for (i = 0; i < dev->num_tx_queues; i++) {
409 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
410 if (txq->qdisc != txq->qdisc_sleeping)
411 return true;
412 }
413 return false;
414}
415
416/* Is the device using the noop qdisc on all queues? */
417static inline bool qdisc_tx_is_noop(const struct net_device *dev)
418{
419 unsigned int i;
420 for (i = 0; i < dev->num_tx_queues; i++) {
421 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
422 if (txq->qdisc != &noop_qdisc)
423 return false;
424 }
425 return true;
426}
427
428static inline unsigned int qdisc_pkt_len(const struct sk_buff *skb)
429{
430 return qdisc_skb_cb(skb)->pkt_len;
431}
432
433/* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
434enum net_xmit_qdisc_t {
435 __NET_XMIT_STOLEN = 0x00010000,
436 __NET_XMIT_BYPASS = 0x00020000,
437};
438
439#ifdef CONFIG_NET_CLS_ACT
440#define net_xmit_drop_count(e) ((e) & __NET_XMIT_STOLEN ? 0 : 1)
441#else
442#define net_xmit_drop_count(e) (1)
443#endif
444
445static inline void qdisc_calculate_pkt_len(struct sk_buff *skb,
446 const struct Qdisc *sch)
447{
448#ifdef CONFIG_NET_SCHED
449 struct qdisc_size_table *stab = rcu_dereference_bh(sch->stab);
450
451 if (stab)
452 __qdisc_calculate_pkt_len(skb, stab);
453#endif
454}
455
456static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
457{
458 qdisc_calculate_pkt_len(skb, sch);
459 return sch->enqueue(skb, sch);
460}
461
462static inline int qdisc_enqueue_root(struct sk_buff *skb, struct Qdisc *sch)
463{
464 qdisc_skb_cb(skb)->pkt_len = skb->len;
465 return qdisc_enqueue(skb, sch) & NET_XMIT_MASK;
466}
467
468
469static inline void bstats_update(struct gnet_stats_basic_packed *bstats,
470 const struct sk_buff *skb)
471{
472 bstats->bytes += qdisc_pkt_len(skb);
473 bstats->packets += skb_is_gso(skb) ? skb_shinfo(skb)->gso_segs : 1;
474}
475
476static inline void qdisc_bstats_update(struct Qdisc *sch,
477 const struct sk_buff *skb)
478{
479 bstats_update(&sch->bstats, skb);
480}
481
482static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
483 struct sk_buff_head *list)
484{
485 __skb_queue_tail(list, skb);
486 sch->qstats.backlog += qdisc_pkt_len(skb);
487
488 return NET_XMIT_SUCCESS;
489}
490
491static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
492{
493 return __qdisc_enqueue_tail(skb, sch, &sch->q);
494}
495
496static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
497 struct sk_buff_head *list)
498{
499 struct sk_buff *skb = __skb_dequeue(list);
500
501 if (likely(skb != NULL)) {
502 sch->qstats.backlog -= qdisc_pkt_len(skb);
503 qdisc_bstats_update(sch, skb);
504 }
505
506 return skb;
507}
508
509static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
510{
511 return __qdisc_dequeue_head(sch, &sch->q);
512}
513
514static inline unsigned int __qdisc_queue_drop_head(struct Qdisc *sch,
515 struct sk_buff_head *list)
516{
517 struct sk_buff *skb = __skb_dequeue(list);
518
519 if (likely(skb != NULL)) {
520 unsigned int len = qdisc_pkt_len(skb);
521 sch->qstats.backlog -= len;
522 kfree_skb(skb);
523 return len;
524 }
525
526 return 0;
527}
528
529static inline unsigned int qdisc_queue_drop_head(struct Qdisc *sch)
530{
531 return __qdisc_queue_drop_head(sch, &sch->q);
532}
533
534static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
535 struct sk_buff_head *list)
536{
537 struct sk_buff *skb = __skb_dequeue_tail(list);
538
539 if (likely(skb != NULL))
540 sch->qstats.backlog -= qdisc_pkt_len(skb);
541
542 return skb;
543}
544
545static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
546{
547 return __qdisc_dequeue_tail(sch, &sch->q);
548}
549
550static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
551{
552 return skb_peek(&sch->q);
553}
554
555/* generic pseudo peek method for non-work-conserving qdisc */
556static inline struct sk_buff *qdisc_peek_dequeued(struct Qdisc *sch)
557{
558 /* we can reuse ->gso_skb because peek isn't called for root qdiscs */
559 if (!sch->gso_skb) {
560 sch->gso_skb = sch->dequeue(sch);
561 if (sch->gso_skb)
562 /* it's still part of the queue */
563 sch->q.qlen++;
564 }
565
566 return sch->gso_skb;
567}
568
569/* use instead of qdisc->dequeue() for all qdiscs queried with ->peek() */
570static inline struct sk_buff *qdisc_dequeue_peeked(struct Qdisc *sch)
571{
572 struct sk_buff *skb = sch->gso_skb;
573
574 if (skb) {
575 sch->gso_skb = NULL;
576 sch->q.qlen--;
577 } else {
578 skb = sch->dequeue(sch);
579 }
580
581 return skb;
582}
583
584static inline void __qdisc_reset_queue(struct Qdisc *sch,
585 struct sk_buff_head *list)
586{
587 /*
588 * We do not know the backlog in bytes of this list, it
589 * is up to the caller to correct it
590 */
591 __skb_queue_purge(list);
592}
593
594static inline void qdisc_reset_queue(struct Qdisc *sch)
595{
596 __qdisc_reset_queue(sch, &sch->q);
597 sch->qstats.backlog = 0;
598}
599
600static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
601 struct sk_buff_head *list)
602{
603 struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
604
605 if (likely(skb != NULL)) {
606 unsigned int len = qdisc_pkt_len(skb);
607 kfree_skb(skb);
608 return len;
609 }
610
611 return 0;
612}
613
614static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
615{
616 return __qdisc_queue_drop(sch, &sch->q);
617}
618
619static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
620{
621 kfree_skb(skb);
622 sch->qstats.drops++;
623
624 return NET_XMIT_DROP;
625}
626
627static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
628{
629 sch->qstats.drops++;
630
631#ifdef CONFIG_NET_CLS_ACT
632 if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
633 goto drop;
634
635 return NET_XMIT_SUCCESS;
636
637drop:
638#endif
639 kfree_skb(skb);
640 return NET_XMIT_DROP;
641}
642
643/* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
644 long it will take to send a packet given its size.
645 */
646static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
647{
648 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
649 if (slot < 0)
650 slot = 0;
651 slot >>= rtab->rate.cell_log;
652 if (slot > 255)
653 return rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF];
654 return rtab->data[slot];
655}
656
657#ifdef CONFIG_NET_CLS_ACT
658static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask,
659 int action)
660{
661 struct sk_buff *n;
662
663 n = skb_clone(skb, gfp_mask);
664
665 if (n) {
666 n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
667 n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
668 n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
669 }
670 return n;
671}
672#endif
673
674#endif