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,
33 int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
34 struct sk_buff * (*dequeue)(struct Qdisc *dev);
36 #define TCQ_F_BUILTIN 1
37 #define TCQ_F_THROTTLED 2
38 #define TCQ_F_INGRESS 4
40 struct Qdisc_ops *ops;
45 struct sk_buff *gso_skb;
46 struct sk_buff_head q;
47 struct netdev_queue *dev_queue;
48 struct list_head list;
50 struct gnet_stats_basic bstats;
51 struct gnet_stats_queue qstats;
52 struct gnet_stats_rate_est rate_est;
53 struct rcu_head q_rcu;
54 int (*reshape_fail)(struct sk_buff *skb,
57 /* This field is deprecated, but it is still used by CBQ
58 * and it will live until better solution will be invented.
60 struct Qdisc *__parent;
63 struct Qdisc_class_ops
65 /* Child qdisc manipulation */
66 int (*graft)(struct Qdisc *, unsigned long cl,
67 struct Qdisc *, struct Qdisc **);
68 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
69 void (*qlen_notify)(struct Qdisc *, unsigned long);
71 /* Class manipulation routines */
72 unsigned long (*get)(struct Qdisc *, u32 classid);
73 void (*put)(struct Qdisc *, unsigned long);
74 int (*change)(struct Qdisc *, u32, u32,
75 struct nlattr **, unsigned long *);
76 int (*delete)(struct Qdisc *, unsigned long);
77 void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
79 /* Filter manipulation */
80 struct tcf_proto ** (*tcf_chain)(struct Qdisc *, unsigned long);
81 unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
83 void (*unbind_tcf)(struct Qdisc *, unsigned long);
85 /* rtnetlink specific */
86 int (*dump)(struct Qdisc *, unsigned long,
87 struct sk_buff *skb, struct tcmsg*);
88 int (*dump_stats)(struct Qdisc *, unsigned long,
94 struct Qdisc_ops *next;
95 const struct Qdisc_class_ops *cl_ops;
99 int (*enqueue)(struct sk_buff *, struct Qdisc *);
100 struct sk_buff * (*dequeue)(struct Qdisc *);
101 int (*requeue)(struct sk_buff *, struct Qdisc *);
102 unsigned int (*drop)(struct Qdisc *);
104 int (*init)(struct Qdisc *, struct nlattr *arg);
105 void (*reset)(struct Qdisc *);
106 void (*destroy)(struct Qdisc *);
107 int (*change)(struct Qdisc *, struct nlattr *arg);
109 int (*dump)(struct Qdisc *, struct sk_buff *);
110 int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
112 struct module *owner;
124 struct tcf_proto_ops *next;
127 int (*classify)(struct sk_buff*, struct tcf_proto*,
128 struct tcf_result *);
129 int (*init)(struct tcf_proto*);
130 void (*destroy)(struct tcf_proto*);
132 unsigned long (*get)(struct tcf_proto*, u32 handle);
133 void (*put)(struct tcf_proto*, unsigned long);
134 int (*change)(struct tcf_proto*, unsigned long,
135 u32 handle, struct nlattr **,
137 int (*delete)(struct tcf_proto*, unsigned long);
138 void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
140 /* rtnetlink specific */
141 int (*dump)(struct tcf_proto*, unsigned long,
142 struct sk_buff *skb, struct tcmsg*);
144 struct module *owner;
149 /* Fast access part */
150 struct tcf_proto *next;
152 int (*classify)(struct sk_buff*, struct tcf_proto*,
153 struct tcf_result *);
161 struct tcf_proto_ops *ops;
164 static inline struct net_device *qdisc_dev(struct Qdisc *qdisc)
166 return qdisc->dev_queue->dev;
169 extern void qdisc_lock_tree(struct net_device *dev);
170 extern void qdisc_unlock_tree(struct net_device *dev);
172 #define sch_tree_lock(q) qdisc_lock_tree(qdisc_dev(q))
173 #define sch_tree_unlock(q) qdisc_unlock_tree(qdisc_dev(q))
174 #define tcf_tree_lock(tp) qdisc_lock_tree(qdisc_dev((tp)->q))
175 #define tcf_tree_unlock(tp) qdisc_unlock_tree(qdisc_dev((tp)->q))
177 extern struct Qdisc noop_qdisc;
178 extern struct Qdisc_ops noop_qdisc_ops;
180 struct Qdisc_class_common
183 struct hlist_node hnode;
186 struct Qdisc_class_hash
188 struct hlist_head *hash;
189 unsigned int hashsize;
190 unsigned int hashmask;
191 unsigned int hashelems;
194 static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
201 static inline struct Qdisc_class_common *
202 qdisc_class_find(struct Qdisc_class_hash *hash, u32 id)
204 struct Qdisc_class_common *cl;
205 struct hlist_node *n;
208 h = qdisc_class_hash(id, hash->hashmask);
209 hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
210 if (cl->classid == id)
216 extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
217 extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
218 extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
219 extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
220 extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
222 extern void dev_init_scheduler(struct net_device *dev);
223 extern void dev_shutdown(struct net_device *dev);
224 extern void dev_activate(struct net_device *dev);
225 extern void dev_deactivate(struct net_device *dev);
226 extern void qdisc_reset(struct Qdisc *qdisc);
227 extern void qdisc_destroy(struct Qdisc *qdisc);
228 extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
229 extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
230 struct Qdisc_ops *ops);
231 extern struct Qdisc *qdisc_create_dflt(struct net_device *dev,
232 struct netdev_queue *dev_queue,
233 struct Qdisc_ops *ops, u32 parentid);
234 extern void tcf_destroy(struct tcf_proto *tp);
235 extern void tcf_destroy_chain(struct tcf_proto **fl);
237 /* Reset all TX qdiscs of a device. */
238 static inline void qdisc_reset_all_tx(struct net_device *dev)
241 for (i = 0; i < dev->num_tx_queues; i++)
242 qdisc_reset(netdev_get_tx_queue(dev, i)->qdisc);
245 /* Are all TX queues of the device empty? */
246 static inline bool qdisc_all_tx_empty(const struct net_device *dev)
249 for (i = 0; i < dev->num_tx_queues; i++) {
250 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
251 const struct Qdisc *q = txq->qdisc;
259 /* Are any of the TX qdiscs changing? */
260 static inline bool qdisc_tx_changing(struct net_device *dev)
263 for (i = 0; i < dev->num_tx_queues; i++) {
264 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
265 if (txq->qdisc != txq->qdisc_sleeping)
271 /* Is the device using the noop qdisc on all queues? */
272 static inline bool qdisc_tx_is_noop(const struct net_device *dev)
275 for (i = 0; i < dev->num_tx_queues; i++) {
276 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
277 if (txq->qdisc != &noop_qdisc)
283 static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
284 struct sk_buff_head *list)
286 __skb_queue_tail(list, skb);
287 sch->qstats.backlog += skb->len;
288 sch->bstats.bytes += skb->len;
289 sch->bstats.packets++;
291 return NET_XMIT_SUCCESS;
294 static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
296 return __qdisc_enqueue_tail(skb, sch, &sch->q);
299 static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
300 struct sk_buff_head *list)
302 struct sk_buff *skb = __skb_dequeue(list);
304 if (likely(skb != NULL))
305 sch->qstats.backlog -= skb->len;
310 static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
312 return __qdisc_dequeue_head(sch, &sch->q);
315 static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
316 struct sk_buff_head *list)
318 struct sk_buff *skb = __skb_dequeue_tail(list);
320 if (likely(skb != NULL))
321 sch->qstats.backlog -= skb->len;
326 static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
328 return __qdisc_dequeue_tail(sch, &sch->q);
331 static inline int __qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch,
332 struct sk_buff_head *list)
334 __skb_queue_head(list, skb);
335 sch->qstats.backlog += skb->len;
336 sch->qstats.requeues++;
338 return NET_XMIT_SUCCESS;
341 static inline int qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch)
343 return __qdisc_requeue(skb, sch, &sch->q);
346 static inline void __qdisc_reset_queue(struct Qdisc *sch,
347 struct sk_buff_head *list)
350 * We do not know the backlog in bytes of this list, it
351 * is up to the caller to correct it
353 skb_queue_purge(list);
356 static inline void qdisc_reset_queue(struct Qdisc *sch)
358 __qdisc_reset_queue(sch, &sch->q);
359 sch->qstats.backlog = 0;
362 static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
363 struct sk_buff_head *list)
365 struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
367 if (likely(skb != NULL)) {
368 unsigned int len = skb->len;
376 static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
378 return __qdisc_queue_drop(sch, &sch->q);
381 static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
386 return NET_XMIT_DROP;
389 static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
393 #ifdef CONFIG_NET_CLS_ACT
394 if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
397 return NET_XMIT_SUCCESS;
402 return NET_XMIT_DROP;
405 /* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
406 long it will take to send a packet given its size.
408 static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
410 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
413 slot >>= rtab->rate.cell_log;
415 return (rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF]);
416 return rtab->data[slot];
419 #ifdef CONFIG_NET_CLS_ACT
420 static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask)
422 struct sk_buff *n = skb_clone(skb, gfp_mask);
425 n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
426 n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
427 n->tc_verd = CLR_TC_MUNGED(n->tc_verd);