1 #ifndef __NET_SCHED_GENERIC_H
2 #define __NET_SCHED_GENERIC_H
4 #include <linux/netdevice.h>
5 #include <linux/types.h>
6 #include <linux/rcupdate.h>
7 #include <linux/module.h>
8 #include <linux/pkt_sched.h>
9 #include <linux/pkt_cls.h>
10 #include <net/gen_stats.h>
11 #include <net/rtnetlink.h>
18 struct qdisc_rate_table
20 struct tc_ratespec rate;
22 struct qdisc_rate_table *next;
28 __QDISC_STATE_RUNNING,
30 __QDISC_STATE_DEACTIVATED,
33 struct qdisc_size_table {
34 struct list_head list;
35 struct tc_sizespec szopts;
42 int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
43 struct sk_buff * (*dequeue)(struct Qdisc *dev);
45 #define TCQ_F_BUILTIN 1
46 #define TCQ_F_THROTTLED 2
47 #define TCQ_F_INGRESS 4
49 struct Qdisc_ops *ops;
50 struct qdisc_size_table *stab;
55 struct sk_buff *gso_skb;
56 struct sk_buff_head q;
57 struct netdev_queue *dev_queue;
58 struct Qdisc *next_sched;
59 struct list_head list;
61 struct gnet_stats_basic bstats;
62 struct gnet_stats_queue qstats;
63 struct gnet_stats_rate_est rate_est;
64 struct rcu_head q_rcu;
65 int (*reshape_fail)(struct sk_buff *skb,
70 /* This field is deprecated, but it is still used by CBQ
71 * and it will live until better solution will be invented.
73 struct Qdisc *__parent;
76 struct Qdisc_class_ops
78 /* Child qdisc manipulation */
79 int (*graft)(struct Qdisc *, unsigned long cl,
80 struct Qdisc *, struct Qdisc **);
81 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
82 void (*qlen_notify)(struct Qdisc *, unsigned long);
84 /* Class manipulation routines */
85 unsigned long (*get)(struct Qdisc *, u32 classid);
86 void (*put)(struct Qdisc *, unsigned long);
87 int (*change)(struct Qdisc *, u32, u32,
88 struct nlattr **, unsigned long *);
89 int (*delete)(struct Qdisc *, unsigned long);
90 void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
92 /* Filter manipulation */
93 struct tcf_proto ** (*tcf_chain)(struct Qdisc *, unsigned long);
94 unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
96 void (*unbind_tcf)(struct Qdisc *, unsigned long);
98 /* rtnetlink specific */
99 int (*dump)(struct Qdisc *, unsigned long,
100 struct sk_buff *skb, struct tcmsg*);
101 int (*dump_stats)(struct Qdisc *, unsigned long,
107 struct Qdisc_ops *next;
108 const struct Qdisc_class_ops *cl_ops;
112 int (*enqueue)(struct sk_buff *, struct Qdisc *);
113 struct sk_buff * (*dequeue)(struct Qdisc *);
114 int (*requeue)(struct sk_buff *, struct Qdisc *);
115 unsigned int (*drop)(struct Qdisc *);
117 int (*init)(struct Qdisc *, struct nlattr *arg);
118 void (*reset)(struct Qdisc *);
119 void (*destroy)(struct Qdisc *);
120 int (*change)(struct Qdisc *, struct nlattr *arg);
122 int (*dump)(struct Qdisc *, struct sk_buff *);
123 int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
125 struct module *owner;
137 struct tcf_proto_ops *next;
140 int (*classify)(struct sk_buff*, struct tcf_proto*,
141 struct tcf_result *);
142 int (*init)(struct tcf_proto*);
143 void (*destroy)(struct tcf_proto*);
145 unsigned long (*get)(struct tcf_proto*, u32 handle);
146 void (*put)(struct tcf_proto*, unsigned long);
147 int (*change)(struct tcf_proto*, unsigned long,
148 u32 handle, struct nlattr **,
150 int (*delete)(struct tcf_proto*, unsigned long);
151 void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
153 /* rtnetlink specific */
154 int (*dump)(struct tcf_proto*, unsigned long,
155 struct sk_buff *skb, struct tcmsg*);
157 struct module *owner;
162 /* Fast access part */
163 struct tcf_proto *next;
165 int (*classify)(struct sk_buff*, struct tcf_proto*,
166 struct tcf_result *);
174 struct tcf_proto_ops *ops;
177 struct qdisc_skb_cb {
178 unsigned int pkt_len;
182 static inline struct qdisc_skb_cb *qdisc_skb_cb(struct sk_buff *skb)
184 return (struct qdisc_skb_cb *)skb->cb;
187 static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
189 return &qdisc->q.lock;
192 static inline struct Qdisc *qdisc_root(struct Qdisc *qdisc)
194 return qdisc->dev_queue->qdisc;
197 /* The qdisc root lock is a mechanism by which to top level
198 * of a qdisc tree can be locked from any qdisc node in the
199 * forest. This allows changing the configuration of some
200 * aspect of the qdisc tree while blocking out asynchronous
201 * qdisc access in the packet processing paths.
203 * It is only legal to do this when the root will not change
204 * on us. Otherwise we'll potentially lock the wrong qdisc
205 * root. This is enforced by holding the RTNL semaphore, which
206 * all users of this lock accessor must do.
208 static inline spinlock_t *qdisc_root_lock(struct Qdisc *qdisc)
210 struct Qdisc *root = qdisc_root(qdisc);
213 return qdisc_lock(root);
216 static inline struct net_device *qdisc_dev(struct Qdisc *qdisc)
218 return qdisc->dev_queue->dev;
221 static inline void sch_tree_lock(struct Qdisc *q)
223 spin_lock_bh(qdisc_root_lock(q));
226 static inline void sch_tree_unlock(struct Qdisc *q)
228 spin_unlock_bh(qdisc_root_lock(q));
231 #define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
232 #define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
234 extern struct Qdisc noop_qdisc;
235 extern struct Qdisc_ops noop_qdisc_ops;
237 struct Qdisc_class_common
240 struct hlist_node hnode;
243 struct Qdisc_class_hash
245 struct hlist_head *hash;
246 unsigned int hashsize;
247 unsigned int hashmask;
248 unsigned int hashelems;
251 static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
258 static inline struct Qdisc_class_common *
259 qdisc_class_find(struct Qdisc_class_hash *hash, u32 id)
261 struct Qdisc_class_common *cl;
262 struct hlist_node *n;
265 h = qdisc_class_hash(id, hash->hashmask);
266 hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
267 if (cl->classid == id)
273 extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
274 extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
275 extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
276 extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
277 extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
279 extern void dev_init_scheduler(struct net_device *dev);
280 extern void dev_shutdown(struct net_device *dev);
281 extern void dev_activate(struct net_device *dev);
282 extern void dev_deactivate(struct net_device *dev);
283 extern void qdisc_reset(struct Qdisc *qdisc);
284 extern void qdisc_destroy(struct Qdisc *qdisc);
285 extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
286 extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
287 struct Qdisc_ops *ops);
288 extern struct Qdisc *qdisc_create_dflt(struct net_device *dev,
289 struct netdev_queue *dev_queue,
290 struct Qdisc_ops *ops, u32 parentid);
291 extern void qdisc_calculate_pkt_len(struct sk_buff *skb,
292 struct qdisc_size_table *stab);
293 extern void tcf_destroy(struct tcf_proto *tp);
294 extern void tcf_destroy_chain(struct tcf_proto **fl);
296 /* Reset all TX qdiscs of a device. */
297 static inline void qdisc_reset_all_tx(struct net_device *dev)
300 for (i = 0; i < dev->num_tx_queues; i++)
301 qdisc_reset(netdev_get_tx_queue(dev, i)->qdisc);
304 /* Are all TX queues of the device empty? */
305 static inline bool qdisc_all_tx_empty(const struct net_device *dev)
308 for (i = 0; i < dev->num_tx_queues; i++) {
309 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
310 const struct Qdisc *q = txq->qdisc;
318 /* Are any of the TX qdiscs changing? */
319 static inline bool qdisc_tx_changing(struct net_device *dev)
322 for (i = 0; i < dev->num_tx_queues; i++) {
323 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
324 if (txq->qdisc != txq->qdisc_sleeping)
330 /* Is the device using the noop qdisc on all queues? */
331 static inline bool qdisc_tx_is_noop(const struct net_device *dev)
334 for (i = 0; i < dev->num_tx_queues; i++) {
335 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
336 if (txq->qdisc != &noop_qdisc)
342 static inline unsigned int qdisc_pkt_len(struct sk_buff *skb)
344 return qdisc_skb_cb(skb)->pkt_len;
347 /* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
348 enum net_xmit_qdisc_t {
349 __NET_XMIT_STOLEN = 0x00010000,
350 __NET_XMIT_BYPASS = 0x00020000,
353 #ifdef CONFIG_NET_CLS_ACT
354 #define net_xmit_drop_count(e) ((e) & __NET_XMIT_STOLEN ? 0 : 1)
356 #define net_xmit_drop_count(e) (1)
359 static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
361 #ifdef CONFIG_NET_SCHED
363 qdisc_calculate_pkt_len(skb, sch->stab);
365 return sch->enqueue(skb, sch);
368 static inline int qdisc_enqueue_root(struct sk_buff *skb, struct Qdisc *sch)
370 qdisc_skb_cb(skb)->pkt_len = skb->len;
371 return qdisc_enqueue(skb, sch) & NET_XMIT_MASK;
374 static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
375 struct sk_buff_head *list)
377 __skb_queue_tail(list, skb);
378 sch->qstats.backlog += qdisc_pkt_len(skb);
379 sch->bstats.bytes += qdisc_pkt_len(skb);
380 sch->bstats.packets++;
382 return NET_XMIT_SUCCESS;
385 static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
387 return __qdisc_enqueue_tail(skb, sch, &sch->q);
390 static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
391 struct sk_buff_head *list)
393 struct sk_buff *skb = __skb_dequeue(list);
395 if (likely(skb != NULL))
396 sch->qstats.backlog -= qdisc_pkt_len(skb);
401 static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
403 return __qdisc_dequeue_head(sch, &sch->q);
406 static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
407 struct sk_buff_head *list)
409 struct sk_buff *skb = __skb_dequeue_tail(list);
411 if (likely(skb != NULL))
412 sch->qstats.backlog -= qdisc_pkt_len(skb);
417 static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
419 return __qdisc_dequeue_tail(sch, &sch->q);
422 static inline int __qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch,
423 struct sk_buff_head *list)
425 __skb_queue_head(list, skb);
426 sch->qstats.backlog += qdisc_pkt_len(skb);
427 sch->qstats.requeues++;
429 return NET_XMIT_SUCCESS;
432 static inline int qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch)
434 return __qdisc_requeue(skb, sch, &sch->q);
437 static inline void __qdisc_reset_queue(struct Qdisc *sch,
438 struct sk_buff_head *list)
441 * We do not know the backlog in bytes of this list, it
442 * is up to the caller to correct it
444 __skb_queue_purge(list);
447 static inline void qdisc_reset_queue(struct Qdisc *sch)
449 __qdisc_reset_queue(sch, &sch->q);
450 sch->qstats.backlog = 0;
453 static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
454 struct sk_buff_head *list)
456 struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
458 if (likely(skb != NULL)) {
459 unsigned int len = qdisc_pkt_len(skb);
467 static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
469 return __qdisc_queue_drop(sch, &sch->q);
472 static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
477 return NET_XMIT_DROP;
480 static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
484 #ifdef CONFIG_NET_CLS_ACT
485 if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
488 return NET_XMIT_SUCCESS;
493 return NET_XMIT_DROP;
496 /* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
497 long it will take to send a packet given its size.
499 static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
501 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
504 slot >>= rtab->rate.cell_log;
506 return (rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF]);
507 return rtab->data[slot];
510 #ifdef CONFIG_NET_CLS_ACT
511 static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask)
513 struct sk_buff *n = skb_clone(skb, gfp_mask);
516 n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
517 n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
518 n->tc_verd = CLR_TC_MUNGED(n->tc_verd);