blob: c5bb130650518b49249463cf518b8a8a6c813a8c [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
Jussi Kivilinna175f9c12008-07-20 00:08:47 -070032struct qdisc_size_table {
33 struct list_head list;
34 struct tc_sizespec szopts;
35 int refcnt;
36 u16 data[];
37};
38
Linus Torvalds1da177e2005-04-16 15:20:36 -070039struct Qdisc
40{
41 int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
42 struct sk_buff * (*dequeue)(struct Qdisc *dev);
43 unsigned flags;
44#define TCQ_F_BUILTIN 1
45#define TCQ_F_THROTTLED 2
46#define TCQ_F_INGRESS 4
47 int padded;
48 struct Qdisc_ops *ops;
Jussi Kivilinna175f9c12008-07-20 00:08:47 -070049 struct qdisc_size_table *stab;
Linus Torvalds1da177e2005-04-16 15:20:36 -070050 u32 handle;
51 u32 parent;
52 atomic_t refcnt;
David S. Millere2627c82008-07-16 00:56:32 -070053 unsigned long state;
David S. Millerd3b753d2008-07-15 20:14:35 -070054 struct sk_buff *gso_skb;
Linus Torvalds1da177e2005-04-16 15:20:36 -070055 struct sk_buff_head q;
David S. Millerbb949fb2008-07-08 16:55:56 -070056 struct netdev_queue *dev_queue;
David S. Miller37437bb2008-07-16 02:15:04 -070057 struct Qdisc *next_sched;
Linus Torvalds1da177e2005-04-16 15:20:36 -070058 struct list_head list;
59
60 struct gnet_stats_basic bstats;
61 struct gnet_stats_queue qstats;
62 struct gnet_stats_rate_est rate_est;
Linus Torvalds1da177e2005-04-16 15:20:36 -070063 struct rcu_head q_rcu;
64 int (*reshape_fail)(struct sk_buff *skb,
65 struct Qdisc *q);
66
David S. Miller72b25a92008-07-18 20:54:17 -070067 void *u32_node;
68
Linus Torvalds1da177e2005-04-16 15:20:36 -070069 /* This field is deprecated, but it is still used by CBQ
70 * and it will live until better solution will be invented.
71 */
72 struct Qdisc *__parent;
73};
74
75struct Qdisc_class_ops
76{
77 /* Child qdisc manipulation */
78 int (*graft)(struct Qdisc *, unsigned long cl,
79 struct Qdisc *, struct Qdisc **);
80 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
Patrick McHardy43effa12006-11-29 17:35:48 -080081 void (*qlen_notify)(struct Qdisc *, unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -070082
83 /* Class manipulation routines */
84 unsigned long (*get)(struct Qdisc *, u32 classid);
85 void (*put)(struct Qdisc *, unsigned long);
86 int (*change)(struct Qdisc *, u32, u32,
Patrick McHardy1e904742008-01-22 22:11:17 -080087 struct nlattr **, unsigned long *);
Linus Torvalds1da177e2005-04-16 15:20:36 -070088 int (*delete)(struct Qdisc *, unsigned long);
89 void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
90
91 /* Filter manipulation */
92 struct tcf_proto ** (*tcf_chain)(struct Qdisc *, unsigned long);
93 unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
94 u32 classid);
95 void (*unbind_tcf)(struct Qdisc *, unsigned long);
96
97 /* rtnetlink specific */
98 int (*dump)(struct Qdisc *, unsigned long,
99 struct sk_buff *skb, struct tcmsg*);
100 int (*dump_stats)(struct Qdisc *, unsigned long,
101 struct gnet_dump *);
102};
103
104struct Qdisc_ops
105{
106 struct Qdisc_ops *next;
Eric Dumazet20fea082007-11-14 01:44:41 -0800107 const struct Qdisc_class_ops *cl_ops;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108 char id[IFNAMSIZ];
109 int priv_size;
110
111 int (*enqueue)(struct sk_buff *, struct Qdisc *);
112 struct sk_buff * (*dequeue)(struct Qdisc *);
113 int (*requeue)(struct sk_buff *, struct Qdisc *);
114 unsigned int (*drop)(struct Qdisc *);
115
Patrick McHardy1e904742008-01-22 22:11:17 -0800116 int (*init)(struct Qdisc *, struct nlattr *arg);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 void (*reset)(struct Qdisc *);
118 void (*destroy)(struct Qdisc *);
Patrick McHardy1e904742008-01-22 22:11:17 -0800119 int (*change)(struct Qdisc *, struct nlattr *arg);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120
121 int (*dump)(struct Qdisc *, struct sk_buff *);
122 int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
123
124 struct module *owner;
125};
126
127
128struct tcf_result
129{
130 unsigned long class;
131 u32 classid;
132};
133
134struct tcf_proto_ops
135{
136 struct tcf_proto_ops *next;
137 char kind[IFNAMSIZ];
138
139 int (*classify)(struct sk_buff*, struct tcf_proto*,
140 struct tcf_result *);
141 int (*init)(struct tcf_proto*);
142 void (*destroy)(struct tcf_proto*);
143
144 unsigned long (*get)(struct tcf_proto*, u32 handle);
145 void (*put)(struct tcf_proto*, unsigned long);
146 int (*change)(struct tcf_proto*, unsigned long,
Patrick McHardyadd93b62008-01-22 22:11:33 -0800147 u32 handle, struct nlattr **,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148 unsigned long *);
149 int (*delete)(struct tcf_proto*, unsigned long);
150 void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
151
152 /* rtnetlink specific */
153 int (*dump)(struct tcf_proto*, unsigned long,
154 struct sk_buff *skb, struct tcmsg*);
155
156 struct module *owner;
157};
158
159struct tcf_proto
160{
161 /* Fast access part */
162 struct tcf_proto *next;
163 void *root;
164 int (*classify)(struct sk_buff*, struct tcf_proto*,
165 struct tcf_result *);
Al Viro66c6f522006-11-20 18:07:51 -0800166 __be16 protocol;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167
168 /* All the rest */
169 u32 prio;
170 u32 classid;
171 struct Qdisc *q;
172 void *data;
173 struct tcf_proto_ops *ops;
174};
175
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700176struct qdisc_skb_cb {
177 unsigned int pkt_len;
178 char data[];
179};
180
181static inline struct qdisc_skb_cb *qdisc_skb_cb(struct sk_buff *skb)
182{
183 return (struct qdisc_skb_cb *)skb->cb;
184}
185
David S. Miller83874002008-07-17 00:53:03 -0700186static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
187{
188 return &qdisc->q.lock;
189}
190
David S. Miller7698b4f2008-07-16 01:42:40 -0700191static inline struct Qdisc *qdisc_root(struct Qdisc *qdisc)
192{
193 return qdisc->dev_queue->qdisc;
194}
195
David S. Miller7e43f112008-08-02 23:27:37 -0700196/* The qdisc root lock is a mechanism by which to top level
197 * of a qdisc tree can be locked from any qdisc node in the
198 * forest. This allows changing the configuration of some
199 * aspect of the qdisc tree while blocking out asynchronous
200 * qdisc access in the packet processing paths.
201 *
202 * It is only legal to do this when the root will not change
203 * on us. Otherwise we'll potentially lock the wrong qdisc
204 * root. This is enforced by holding the RTNL semaphore, which
205 * all users of this lock accessor must do.
206 */
David S. Miller7698b4f2008-07-16 01:42:40 -0700207static inline spinlock_t *qdisc_root_lock(struct Qdisc *qdisc)
208{
209 struct Qdisc *root = qdisc_root(qdisc);
210
David S. Miller7e43f112008-08-02 23:27:37 -0700211 ASSERT_RTNL();
David S. Miller83874002008-07-17 00:53:03 -0700212 return qdisc_lock(root);
David S. Miller7698b4f2008-07-16 01:42:40 -0700213}
214
David S. Miller5ce2d482008-07-08 17:06:30 -0700215static inline struct net_device *qdisc_dev(struct Qdisc *qdisc)
216{
217 return qdisc->dev_queue->dev;
218}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700219
David S. Miller78a5b302008-07-16 03:12:24 -0700220static inline void sch_tree_lock(struct Qdisc *q)
221{
222 spin_lock_bh(qdisc_root_lock(q));
223}
224
225static inline void sch_tree_unlock(struct Qdisc *q)
226{
227 spin_unlock_bh(qdisc_root_lock(q));
228}
229
230#define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
231#define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700232
Thomas Grafe41a33e2005-07-05 14:14:30 -0700233extern struct Qdisc noop_qdisc;
234extern struct Qdisc_ops noop_qdisc_ops;
235
Patrick McHardy6fe1c7a2008-07-05 23:21:31 -0700236struct Qdisc_class_common
237{
238 u32 classid;
239 struct hlist_node hnode;
240};
241
242struct Qdisc_class_hash
243{
244 struct hlist_head *hash;
245 unsigned int hashsize;
246 unsigned int hashmask;
247 unsigned int hashelems;
248};
249
250static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
251{
252 id ^= id >> 8;
253 id ^= id >> 4;
254 return id & mask;
255}
256
257static inline struct Qdisc_class_common *
258qdisc_class_find(struct Qdisc_class_hash *hash, u32 id)
259{
260 struct Qdisc_class_common *cl;
261 struct hlist_node *n;
262 unsigned int h;
263
264 h = qdisc_class_hash(id, hash->hashmask);
265 hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
266 if (cl->classid == id)
267 return cl;
268 }
269 return NULL;
270}
271
272extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
273extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
274extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
275extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
276extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
277
Thomas Grafe41a33e2005-07-05 14:14:30 -0700278extern void dev_init_scheduler(struct net_device *dev);
279extern void dev_shutdown(struct net_device *dev);
280extern void dev_activate(struct net_device *dev);
281extern void dev_deactivate(struct net_device *dev);
282extern void qdisc_reset(struct Qdisc *qdisc);
283extern void qdisc_destroy(struct Qdisc *qdisc);
Patrick McHardy43effa12006-11-29 17:35:48 -0800284extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
David S. Miller5ce2d482008-07-08 17:06:30 -0700285extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
David S. Millerbb949fb2008-07-08 16:55:56 -0700286 struct Qdisc_ops *ops);
Thomas Grafe41a33e2005-07-05 14:14:30 -0700287extern struct Qdisc *qdisc_create_dflt(struct net_device *dev,
David S. Millerbb949fb2008-07-08 16:55:56 -0700288 struct netdev_queue *dev_queue,
Patrick McHardy9f9afec2006-11-29 17:35:18 -0800289 struct Qdisc_ops *ops, u32 parentid);
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700290extern void qdisc_calculate_pkt_len(struct sk_buff *skb,
291 struct qdisc_size_table *stab);
Patrick McHardya48b5a62007-03-23 11:29:43 -0700292extern void tcf_destroy(struct tcf_proto *tp);
Patrick McHardyff31ab52008-07-01 19:52:38 -0700293extern void tcf_destroy_chain(struct tcf_proto **fl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700294
David S. Miller5aa70992008-07-08 22:59:10 -0700295/* Reset all TX qdiscs of a device. */
296static inline void qdisc_reset_all_tx(struct net_device *dev)
297{
David S. Millere8a04642008-07-17 00:34:19 -0700298 unsigned int i;
299 for (i = 0; i < dev->num_tx_queues; i++)
300 qdisc_reset(netdev_get_tx_queue(dev, i)->qdisc);
David S. Miller5aa70992008-07-08 22:59:10 -0700301}
302
David S. Miller3e745dd2008-07-08 23:00:25 -0700303/* Are all TX queues of the device empty? */
304static inline bool qdisc_all_tx_empty(const struct net_device *dev)
305{
David S. Millere8a04642008-07-17 00:34:19 -0700306 unsigned int i;
307 for (i = 0; i < dev->num_tx_queues; i++) {
308 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
309 const struct Qdisc *q = txq->qdisc;
David S. Miller3e745dd2008-07-08 23:00:25 -0700310
David S. Millere8a04642008-07-17 00:34:19 -0700311 if (q->q.qlen)
312 return false;
313 }
314 return true;
David S. Miller3e745dd2008-07-08 23:00:25 -0700315}
316
David S. Miller6fa98642008-07-08 23:01:06 -0700317/* Are any of the TX qdiscs changing? */
318static inline bool qdisc_tx_changing(struct net_device *dev)
319{
David S. Millere8a04642008-07-17 00:34:19 -0700320 unsigned int i;
321 for (i = 0; i < dev->num_tx_queues; i++) {
322 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
323 if (txq->qdisc != txq->qdisc_sleeping)
324 return true;
325 }
326 return false;
David S. Miller6fa98642008-07-08 23:01:06 -0700327}
328
David S. Millere8a04642008-07-17 00:34:19 -0700329/* Is the device using the noop qdisc on all queues? */
David S. Miller05297942008-07-08 23:01:27 -0700330static inline bool qdisc_tx_is_noop(const struct net_device *dev)
331{
David S. Millere8a04642008-07-17 00:34:19 -0700332 unsigned int i;
333 for (i = 0; i < dev->num_tx_queues; i++) {
334 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
335 if (txq->qdisc != &noop_qdisc)
336 return false;
337 }
338 return true;
David S. Miller05297942008-07-08 23:01:27 -0700339}
340
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700341static inline unsigned int qdisc_pkt_len(struct sk_buff *skb)
342{
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700343 return qdisc_skb_cb(skb)->pkt_len;
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700344}
345
Jussi Kivilinna5f861732008-07-20 00:08:04 -0700346static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
347{
David S. Miller3a682fb2008-07-20 18:13:01 -0700348#ifdef CONFIG_NET_SCHED
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700349 if (sch->stab)
350 qdisc_calculate_pkt_len(skb, sch->stab);
David S. Miller3a682fb2008-07-20 18:13:01 -0700351#endif
Jussi Kivilinna5f861732008-07-20 00:08:04 -0700352 return sch->enqueue(skb, sch);
353}
354
355static inline int qdisc_enqueue_root(struct sk_buff *skb, struct Qdisc *sch)
356{
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700357 qdisc_skb_cb(skb)->pkt_len = skb->len;
Jussi Kivilinna5f861732008-07-20 00:08:04 -0700358 return qdisc_enqueue(skb, sch);
359}
360
Thomas Graf9972b252005-06-18 22:57:26 -0700361static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
362 struct sk_buff_head *list)
363{
364 __skb_queue_tail(list, skb);
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700365 sch->qstats.backlog += qdisc_pkt_len(skb);
366 sch->bstats.bytes += qdisc_pkt_len(skb);
Thomas Graf9972b252005-06-18 22:57:26 -0700367 sch->bstats.packets++;
368
369 return NET_XMIT_SUCCESS;
370}
371
372static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
373{
374 return __qdisc_enqueue_tail(skb, sch, &sch->q);
375}
376
377static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
378 struct sk_buff_head *list)
379{
380 struct sk_buff *skb = __skb_dequeue(list);
381
382 if (likely(skb != NULL))
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700383 sch->qstats.backlog -= qdisc_pkt_len(skb);
Thomas Graf9972b252005-06-18 22:57:26 -0700384
385 return skb;
386}
387
388static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
389{
390 return __qdisc_dequeue_head(sch, &sch->q);
391}
392
393static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
394 struct sk_buff_head *list)
395{
396 struct sk_buff *skb = __skb_dequeue_tail(list);
397
398 if (likely(skb != NULL))
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700399 sch->qstats.backlog -= qdisc_pkt_len(skb);
Thomas Graf9972b252005-06-18 22:57:26 -0700400
401 return skb;
402}
403
404static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
405{
406 return __qdisc_dequeue_tail(sch, &sch->q);
407}
408
409static inline int __qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch,
410 struct sk_buff_head *list)
411{
412 __skb_queue_head(list, skb);
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700413 sch->qstats.backlog += qdisc_pkt_len(skb);
Thomas Graf9972b252005-06-18 22:57:26 -0700414 sch->qstats.requeues++;
415
416 return NET_XMIT_SUCCESS;
417}
418
419static inline int qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch)
420{
421 return __qdisc_requeue(skb, sch, &sch->q);
422}
423
424static inline void __qdisc_reset_queue(struct Qdisc *sch,
425 struct sk_buff_head *list)
426{
427 /*
428 * We do not know the backlog in bytes of this list, it
429 * is up to the caller to correct it
430 */
David S. Miller93245dd2008-07-17 04:03:43 -0700431 __skb_queue_purge(list);
Thomas Graf9972b252005-06-18 22:57:26 -0700432}
433
434static inline void qdisc_reset_queue(struct Qdisc *sch)
435{
436 __qdisc_reset_queue(sch, &sch->q);
437 sch->qstats.backlog = 0;
438}
439
440static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
441 struct sk_buff_head *list)
442{
443 struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
444
445 if (likely(skb != NULL)) {
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700446 unsigned int len = qdisc_pkt_len(skb);
Thomas Graf9972b252005-06-18 22:57:26 -0700447 kfree_skb(skb);
448 return len;
449 }
450
451 return 0;
452}
453
454static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
455{
456 return __qdisc_queue_drop(sch, &sch->q);
457}
458
459static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
460{
461 kfree_skb(skb);
462 sch->qstats.drops++;
463
464 return NET_XMIT_DROP;
465}
466
467static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
468{
469 sch->qstats.drops++;
470
Patrick McHardyc3bc7cf2007-07-15 00:03:05 -0700471#ifdef CONFIG_NET_CLS_ACT
Thomas Graf9972b252005-06-18 22:57:26 -0700472 if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
473 goto drop;
474
475 return NET_XMIT_SUCCESS;
476
477drop:
478#endif
479 kfree_skb(skb);
480 return NET_XMIT_DROP;
481}
482
Jesper Dangaard Brouere9bef552007-09-12 16:35:24 +0200483/* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
484 long it will take to send a packet given its size.
485 */
486static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
487{
Jesper Dangaard Brouere08b0992007-09-12 16:36:28 +0200488 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
489 if (slot < 0)
490 slot = 0;
Jesper Dangaard Brouere9bef552007-09-12 16:35:24 +0200491 slot >>= rtab->rate.cell_log;
492 if (slot > 255)
493 return (rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF]);
494 return rtab->data[slot];
495}
496
Jamal Hadi Salim12da81d2007-10-26 02:47:23 -0700497#ifdef CONFIG_NET_CLS_ACT
498static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask)
499{
500 struct sk_buff *n = skb_clone(skb, gfp_mask);
501
502 if (n) {
503 n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
504 n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
505 n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
Jamal Hadi Salim12da81d2007-10-26 02:47:23 -0700506 }
507 return n;
508}
509#endif
510
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511#endif