blob: 8a44386b35cfce1836d6937c53ab467b99697604 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef __NET_SCHED_GENERIC_H
2#define __NET_SCHED_GENERIC_H
3
Linus Torvalds1da177e2005-04-16 15:20:36 -07004#include <linux/netdevice.h>
5#include <linux/types.h>
6#include <linux/rcupdate.h>
7#include <linux/module.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07008#include <linux/pkt_sched.h>
9#include <linux/pkt_cls.h>
10#include <net/gen_stats.h>
Thomas Grafbe577dd2007-03-22 11:55:50 -070011#include <net/rtnetlink.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070012
13struct Qdisc_ops;
14struct qdisc_walker;
15struct tcf_walker;
16struct module;
17
18struct qdisc_rate_table
19{
20 struct tc_ratespec rate;
21 u32 data[256];
22 struct qdisc_rate_table *next;
23 int refcnt;
24};
25
David S. Millere2627c82008-07-16 00:56:32 -070026enum qdisc_state_t
27{
28 __QDISC_STATE_RUNNING,
David S. Miller37437bb2008-07-16 02:15:04 -070029 __QDISC_STATE_SCHED,
David S. Millere2627c82008-07-16 00:56:32 -070030};
31
Linus Torvalds1da177e2005-04-16 15:20:36 -070032struct Qdisc
33{
34 int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
35 struct sk_buff * (*dequeue)(struct Qdisc *dev);
36 unsigned flags;
37#define TCQ_F_BUILTIN 1
38#define TCQ_F_THROTTLED 2
39#define TCQ_F_INGRESS 4
40 int padded;
41 struct Qdisc_ops *ops;
42 u32 handle;
43 u32 parent;
44 atomic_t refcnt;
David S. Millere2627c82008-07-16 00:56:32 -070045 unsigned long state;
David S. Millerd3b753d2008-07-15 20:14:35 -070046 struct sk_buff *gso_skb;
Linus Torvalds1da177e2005-04-16 15:20:36 -070047 struct sk_buff_head q;
David S. Millerbb949fb2008-07-08 16:55:56 -070048 struct netdev_queue *dev_queue;
David S. Miller37437bb2008-07-16 02:15:04 -070049 struct Qdisc *next_sched;
Linus Torvalds1da177e2005-04-16 15:20:36 -070050 struct list_head list;
51
52 struct gnet_stats_basic bstats;
53 struct gnet_stats_queue qstats;
54 struct gnet_stats_rate_est rate_est;
Linus Torvalds1da177e2005-04-16 15:20:36 -070055 struct rcu_head q_rcu;
56 int (*reshape_fail)(struct sk_buff *skb,
57 struct Qdisc *q);
58
David S. Miller72b25a92008-07-18 20:54:17 -070059 void *u32_node;
60
Linus Torvalds1da177e2005-04-16 15:20:36 -070061 /* This field is deprecated, but it is still used by CBQ
62 * and it will live until better solution will be invented.
63 */
64 struct Qdisc *__parent;
65};
66
67struct Qdisc_class_ops
68{
69 /* Child qdisc manipulation */
70 int (*graft)(struct Qdisc *, unsigned long cl,
71 struct Qdisc *, struct Qdisc **);
72 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
Patrick McHardy43effa12006-11-29 17:35:48 -080073 void (*qlen_notify)(struct Qdisc *, unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -070074
75 /* Class manipulation routines */
76 unsigned long (*get)(struct Qdisc *, u32 classid);
77 void (*put)(struct Qdisc *, unsigned long);
78 int (*change)(struct Qdisc *, u32, u32,
Patrick McHardy1e904742008-01-22 22:11:17 -080079 struct nlattr **, unsigned long *);
Linus Torvalds1da177e2005-04-16 15:20:36 -070080 int (*delete)(struct Qdisc *, unsigned long);
81 void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
82
83 /* Filter manipulation */
84 struct tcf_proto ** (*tcf_chain)(struct Qdisc *, unsigned long);
85 unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
86 u32 classid);
87 void (*unbind_tcf)(struct Qdisc *, unsigned long);
88
89 /* rtnetlink specific */
90 int (*dump)(struct Qdisc *, unsigned long,
91 struct sk_buff *skb, struct tcmsg*);
92 int (*dump_stats)(struct Qdisc *, unsigned long,
93 struct gnet_dump *);
94};
95
96struct Qdisc_ops
97{
98 struct Qdisc_ops *next;
Eric Dumazet20fea082007-11-14 01:44:41 -080099 const struct Qdisc_class_ops *cl_ops;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100 char id[IFNAMSIZ];
101 int priv_size;
102
103 int (*enqueue)(struct sk_buff *, struct Qdisc *);
104 struct sk_buff * (*dequeue)(struct Qdisc *);
105 int (*requeue)(struct sk_buff *, struct Qdisc *);
106 unsigned int (*drop)(struct Qdisc *);
107
Patrick McHardy1e904742008-01-22 22:11:17 -0800108 int (*init)(struct Qdisc *, struct nlattr *arg);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109 void (*reset)(struct Qdisc *);
110 void (*destroy)(struct Qdisc *);
Patrick McHardy1e904742008-01-22 22:11:17 -0800111 int (*change)(struct Qdisc *, struct nlattr *arg);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112
113 int (*dump)(struct Qdisc *, struct sk_buff *);
114 int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
115
116 struct module *owner;
117};
118
119
120struct tcf_result
121{
122 unsigned long class;
123 u32 classid;
124};
125
126struct tcf_proto_ops
127{
128 struct tcf_proto_ops *next;
129 char kind[IFNAMSIZ];
130
131 int (*classify)(struct sk_buff*, struct tcf_proto*,
132 struct tcf_result *);
133 int (*init)(struct tcf_proto*);
134 void (*destroy)(struct tcf_proto*);
135
136 unsigned long (*get)(struct tcf_proto*, u32 handle);
137 void (*put)(struct tcf_proto*, unsigned long);
138 int (*change)(struct tcf_proto*, unsigned long,
Patrick McHardyadd93b62008-01-22 22:11:33 -0800139 u32 handle, struct nlattr **,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140 unsigned long *);
141 int (*delete)(struct tcf_proto*, unsigned long);
142 void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
143
144 /* rtnetlink specific */
145 int (*dump)(struct tcf_proto*, unsigned long,
146 struct sk_buff *skb, struct tcmsg*);
147
148 struct module *owner;
149};
150
151struct tcf_proto
152{
153 /* Fast access part */
154 struct tcf_proto *next;
155 void *root;
156 int (*classify)(struct sk_buff*, struct tcf_proto*,
157 struct tcf_result *);
Al Viro66c6f522006-11-20 18:07:51 -0800158 __be16 protocol;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159
160 /* All the rest */
161 u32 prio;
162 u32 classid;
163 struct Qdisc *q;
164 void *data;
165 struct tcf_proto_ops *ops;
166};
167
David S. Miller83874002008-07-17 00:53:03 -0700168static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
169{
170 return &qdisc->q.lock;
171}
172
David S. Miller7698b4f2008-07-16 01:42:40 -0700173static inline struct Qdisc *qdisc_root(struct Qdisc *qdisc)
174{
175 return qdisc->dev_queue->qdisc;
176}
177
178static inline spinlock_t *qdisc_root_lock(struct Qdisc *qdisc)
179{
180 struct Qdisc *root = qdisc_root(qdisc);
181
David S. Miller83874002008-07-17 00:53:03 -0700182 return qdisc_lock(root);
David S. Miller7698b4f2008-07-16 01:42:40 -0700183}
184
David S. Miller5ce2d482008-07-08 17:06:30 -0700185static inline struct net_device *qdisc_dev(struct Qdisc *qdisc)
186{
187 return qdisc->dev_queue->dev;
188}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700189
David S. Miller78a5b302008-07-16 03:12:24 -0700190static inline void sch_tree_lock(struct Qdisc *q)
191{
192 spin_lock_bh(qdisc_root_lock(q));
193}
194
195static inline void sch_tree_unlock(struct Qdisc *q)
196{
197 spin_unlock_bh(qdisc_root_lock(q));
198}
199
200#define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
201#define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202
Thomas Grafe41a33e2005-07-05 14:14:30 -0700203extern struct Qdisc noop_qdisc;
204extern struct Qdisc_ops noop_qdisc_ops;
205
Patrick McHardy6fe1c7a2008-07-05 23:21:31 -0700206struct Qdisc_class_common
207{
208 u32 classid;
209 struct hlist_node hnode;
210};
211
212struct Qdisc_class_hash
213{
214 struct hlist_head *hash;
215 unsigned int hashsize;
216 unsigned int hashmask;
217 unsigned int hashelems;
218};
219
220static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
221{
222 id ^= id >> 8;
223 id ^= id >> 4;
224 return id & mask;
225}
226
227static inline struct Qdisc_class_common *
228qdisc_class_find(struct Qdisc_class_hash *hash, u32 id)
229{
230 struct Qdisc_class_common *cl;
231 struct hlist_node *n;
232 unsigned int h;
233
234 h = qdisc_class_hash(id, hash->hashmask);
235 hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
236 if (cl->classid == id)
237 return cl;
238 }
239 return NULL;
240}
241
242extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
243extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
244extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
245extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
246extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
247
Thomas Grafe41a33e2005-07-05 14:14:30 -0700248extern void dev_init_scheduler(struct net_device *dev);
249extern void dev_shutdown(struct net_device *dev);
250extern void dev_activate(struct net_device *dev);
251extern void dev_deactivate(struct net_device *dev);
252extern void qdisc_reset(struct Qdisc *qdisc);
253extern void qdisc_destroy(struct Qdisc *qdisc);
Patrick McHardy43effa12006-11-29 17:35:48 -0800254extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
David S. Miller5ce2d482008-07-08 17:06:30 -0700255extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
David S. Millerbb949fb2008-07-08 16:55:56 -0700256 struct Qdisc_ops *ops);
Thomas Grafe41a33e2005-07-05 14:14:30 -0700257extern struct Qdisc *qdisc_create_dflt(struct net_device *dev,
David S. Millerbb949fb2008-07-08 16:55:56 -0700258 struct netdev_queue *dev_queue,
Patrick McHardy9f9afec2006-11-29 17:35:18 -0800259 struct Qdisc_ops *ops, u32 parentid);
Patrick McHardya48b5a62007-03-23 11:29:43 -0700260extern void tcf_destroy(struct tcf_proto *tp);
Patrick McHardyff31ab52008-07-01 19:52:38 -0700261extern void tcf_destroy_chain(struct tcf_proto **fl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262
David S. Miller5aa70992008-07-08 22:59:10 -0700263/* Reset all TX qdiscs of a device. */
264static inline void qdisc_reset_all_tx(struct net_device *dev)
265{
David S. Millere8a04642008-07-17 00:34:19 -0700266 unsigned int i;
267 for (i = 0; i < dev->num_tx_queues; i++)
268 qdisc_reset(netdev_get_tx_queue(dev, i)->qdisc);
David S. Miller5aa70992008-07-08 22:59:10 -0700269}
270
David S. Miller3e745dd2008-07-08 23:00:25 -0700271/* Are all TX queues of the device empty? */
272static inline bool qdisc_all_tx_empty(const struct net_device *dev)
273{
David S. Millere8a04642008-07-17 00:34:19 -0700274 unsigned int i;
275 for (i = 0; i < dev->num_tx_queues; i++) {
276 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
277 const struct Qdisc *q = txq->qdisc;
David S. Miller3e745dd2008-07-08 23:00:25 -0700278
David S. Millere8a04642008-07-17 00:34:19 -0700279 if (q->q.qlen)
280 return false;
281 }
282 return true;
David S. Miller3e745dd2008-07-08 23:00:25 -0700283}
284
David S. Miller6fa98642008-07-08 23:01:06 -0700285/* Are any of the TX qdiscs changing? */
286static inline bool qdisc_tx_changing(struct net_device *dev)
287{
David S. Millere8a04642008-07-17 00:34:19 -0700288 unsigned int i;
289 for (i = 0; i < dev->num_tx_queues; i++) {
290 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
291 if (txq->qdisc != txq->qdisc_sleeping)
292 return true;
293 }
294 return false;
David S. Miller6fa98642008-07-08 23:01:06 -0700295}
296
David S. Millere8a04642008-07-17 00:34:19 -0700297/* Is the device using the noop qdisc on all queues? */
David S. Miller05297942008-07-08 23:01:27 -0700298static inline bool qdisc_tx_is_noop(const struct net_device *dev)
299{
David S. Millere8a04642008-07-17 00:34:19 -0700300 unsigned int i;
301 for (i = 0; i < dev->num_tx_queues; i++) {
302 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
303 if (txq->qdisc != &noop_qdisc)
304 return false;
305 }
306 return true;
David S. Miller05297942008-07-08 23:01:27 -0700307}
308
Thomas Graf9972b252005-06-18 22:57:26 -0700309static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
310 struct sk_buff_head *list)
311{
312 __skb_queue_tail(list, skb);
313 sch->qstats.backlog += skb->len;
314 sch->bstats.bytes += skb->len;
315 sch->bstats.packets++;
316
317 return NET_XMIT_SUCCESS;
318}
319
320static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
321{
322 return __qdisc_enqueue_tail(skb, sch, &sch->q);
323}
324
325static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
326 struct sk_buff_head *list)
327{
328 struct sk_buff *skb = __skb_dequeue(list);
329
330 if (likely(skb != NULL))
331 sch->qstats.backlog -= skb->len;
332
333 return skb;
334}
335
336static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
337{
338 return __qdisc_dequeue_head(sch, &sch->q);
339}
340
341static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
342 struct sk_buff_head *list)
343{
344 struct sk_buff *skb = __skb_dequeue_tail(list);
345
346 if (likely(skb != NULL))
347 sch->qstats.backlog -= skb->len;
348
349 return skb;
350}
351
352static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
353{
354 return __qdisc_dequeue_tail(sch, &sch->q);
355}
356
357static inline int __qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch,
358 struct sk_buff_head *list)
359{
360 __skb_queue_head(list, skb);
361 sch->qstats.backlog += skb->len;
362 sch->qstats.requeues++;
363
364 return NET_XMIT_SUCCESS;
365}
366
367static inline int qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch)
368{
369 return __qdisc_requeue(skb, sch, &sch->q);
370}
371
372static inline void __qdisc_reset_queue(struct Qdisc *sch,
373 struct sk_buff_head *list)
374{
375 /*
376 * We do not know the backlog in bytes of this list, it
377 * is up to the caller to correct it
378 */
David S. Miller93245dd2008-07-17 04:03:43 -0700379 __skb_queue_purge(list);
Thomas Graf9972b252005-06-18 22:57:26 -0700380}
381
382static inline void qdisc_reset_queue(struct Qdisc *sch)
383{
384 __qdisc_reset_queue(sch, &sch->q);
385 sch->qstats.backlog = 0;
386}
387
388static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
389 struct sk_buff_head *list)
390{
391 struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
392
393 if (likely(skb != NULL)) {
394 unsigned int len = skb->len;
395 kfree_skb(skb);
396 return len;
397 }
398
399 return 0;
400}
401
402static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
403{
404 return __qdisc_queue_drop(sch, &sch->q);
405}
406
407static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
408{
409 kfree_skb(skb);
410 sch->qstats.drops++;
411
412 return NET_XMIT_DROP;
413}
414
415static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
416{
417 sch->qstats.drops++;
418
Patrick McHardyc3bc7cf2007-07-15 00:03:05 -0700419#ifdef CONFIG_NET_CLS_ACT
Thomas Graf9972b252005-06-18 22:57:26 -0700420 if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
421 goto drop;
422
423 return NET_XMIT_SUCCESS;
424
425drop:
426#endif
427 kfree_skb(skb);
428 return NET_XMIT_DROP;
429}
430
Jesper Dangaard Brouere9bef552007-09-12 16:35:24 +0200431/* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
432 long it will take to send a packet given its size.
433 */
434static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
435{
Jesper Dangaard Brouere08b0992007-09-12 16:36:28 +0200436 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
437 if (slot < 0)
438 slot = 0;
Jesper Dangaard Brouere9bef552007-09-12 16:35:24 +0200439 slot >>= rtab->rate.cell_log;
440 if (slot > 255)
441 return (rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF]);
442 return rtab->data[slot];
443}
444
Jamal Hadi Salim12da81d2007-10-26 02:47:23 -0700445#ifdef CONFIG_NET_CLS_ACT
446static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask)
447{
448 struct sk_buff *n = skb_clone(skb, gfp_mask);
449
450 if (n) {
451 n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
452 n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
453 n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
Jamal Hadi Salim12da81d2007-10-26 02:47:23 -0700454 }
455 return n;
456}
457#endif
458
Linus Torvalds1da177e2005-04-16 15:20:36 -0700459#endif