blob: 84b3fc2aef0fe244496b22da6dd048a53c98057d [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. Millera9312ae2008-08-17 21:51:03 -070030 __QDISC_STATE_DEACTIVATED,
David S. Millere2627c82008-07-16 00:56:32 -070031};
32
Jussi Kivilinna175f9c12008-07-20 00:08:47 -070033struct qdisc_size_table {
34 struct list_head list;
35 struct tc_sizespec szopts;
36 int refcnt;
37 u16 data[];
38};
39
Linus Torvalds1da177e2005-04-16 15:20:36 -070040struct Qdisc
41{
42 int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
43 struct sk_buff * (*dequeue)(struct Qdisc *dev);
44 unsigned flags;
Jarek Poplawskib00355d2009-02-01 01:12:42 -080045#define TCQ_F_BUILTIN 1
46#define TCQ_F_THROTTLED 2
47#define TCQ_F_INGRESS 4
Krishna Kumarbbd8a0d2009-08-06 01:44:21 +000048#define TCQ_F_CAN_BYPASS 8
Jarek Poplawskib00355d2009-02-01 01:12:42 -080049#define TCQ_F_WARN_NONWC (1 << 16)
Linus Torvalds1da177e2005-04-16 15:20:36 -070050 int padded;
51 struct Qdisc_ops *ops;
Jussi Kivilinna175f9c12008-07-20 00:08:47 -070052 struct qdisc_size_table *stab;
Eric Dumazet5e140df2009-03-20 01:33:32 -070053 struct list_head list;
Linus Torvalds1da177e2005-04-16 15:20:36 -070054 u32 handle;
55 u32 parent;
56 atomic_t refcnt;
Linus Torvalds1da177e2005-04-16 15:20:36 -070057 struct gnet_stats_rate_est rate_est;
Linus Torvalds1da177e2005-04-16 15:20:36 -070058 int (*reshape_fail)(struct sk_buff *skb,
59 struct Qdisc *q);
60
David S. Miller72b25a92008-07-18 20:54:17 -070061 void *u32_node;
62
Linus Torvalds1da177e2005-04-16 15:20:36 -070063 /* This field is deprecated, but it is still used by CBQ
64 * and it will live until better solution will be invented.
65 */
66 struct Qdisc *__parent;
Eric Dumazet5e140df2009-03-20 01:33:32 -070067 struct netdev_queue *dev_queue;
68 struct Qdisc *next_sched;
69
70 struct sk_buff *gso_skb;
71 /*
72 * For performance sake on SMP, we put highly modified fields at the end
73 */
74 unsigned long state;
75 struct sk_buff_head q;
76 struct gnet_stats_basic bstats;
77 struct gnet_stats_queue qstats;
Linus Torvalds1da177e2005-04-16 15:20:36 -070078};
79
80struct Qdisc_class_ops
81{
82 /* Child qdisc manipulation */
83 int (*graft)(struct Qdisc *, unsigned long cl,
84 struct Qdisc *, struct Qdisc **);
85 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
Patrick McHardy43effa12006-11-29 17:35:48 -080086 void (*qlen_notify)(struct Qdisc *, unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -070087
88 /* Class manipulation routines */
89 unsigned long (*get)(struct Qdisc *, u32 classid);
90 void (*put)(struct Qdisc *, unsigned long);
91 int (*change)(struct Qdisc *, u32, u32,
Patrick McHardy1e904742008-01-22 22:11:17 -080092 struct nlattr **, unsigned long *);
Linus Torvalds1da177e2005-04-16 15:20:36 -070093 int (*delete)(struct Qdisc *, unsigned long);
94 void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
95
96 /* Filter manipulation */
97 struct tcf_proto ** (*tcf_chain)(struct Qdisc *, unsigned long);
98 unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
99 u32 classid);
100 void (*unbind_tcf)(struct Qdisc *, unsigned long);
101
102 /* rtnetlink specific */
103 int (*dump)(struct Qdisc *, unsigned long,
104 struct sk_buff *skb, struct tcmsg*);
105 int (*dump_stats)(struct Qdisc *, unsigned long,
106 struct gnet_dump *);
107};
108
109struct Qdisc_ops
110{
111 struct Qdisc_ops *next;
Eric Dumazet20fea082007-11-14 01:44:41 -0800112 const struct Qdisc_class_ops *cl_ops;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113 char id[IFNAMSIZ];
114 int priv_size;
115
116 int (*enqueue)(struct sk_buff *, struct Qdisc *);
117 struct sk_buff * (*dequeue)(struct Qdisc *);
Jarek Poplawski90d841fd2008-10-31 00:43:45 -0700118 struct sk_buff * (*peek)(struct Qdisc *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119 unsigned int (*drop)(struct Qdisc *);
120
Patrick McHardy1e904742008-01-22 22:11:17 -0800121 int (*init)(struct Qdisc *, struct nlattr *arg);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 void (*reset)(struct Qdisc *);
123 void (*destroy)(struct Qdisc *);
Patrick McHardy1e904742008-01-22 22:11:17 -0800124 int (*change)(struct Qdisc *, struct nlattr *arg);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125
126 int (*dump)(struct Qdisc *, struct sk_buff *);
127 int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
128
129 struct module *owner;
130};
131
132
133struct tcf_result
134{
135 unsigned long class;
136 u32 classid;
137};
138
139struct tcf_proto_ops
140{
141 struct tcf_proto_ops *next;
142 char kind[IFNAMSIZ];
143
144 int (*classify)(struct sk_buff*, struct tcf_proto*,
145 struct tcf_result *);
146 int (*init)(struct tcf_proto*);
147 void (*destroy)(struct tcf_proto*);
148
149 unsigned long (*get)(struct tcf_proto*, u32 handle);
150 void (*put)(struct tcf_proto*, unsigned long);
151 int (*change)(struct tcf_proto*, unsigned long,
Patrick McHardyadd93b62008-01-22 22:11:33 -0800152 u32 handle, struct nlattr **,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153 unsigned long *);
154 int (*delete)(struct tcf_proto*, unsigned long);
155 void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
156
157 /* rtnetlink specific */
158 int (*dump)(struct tcf_proto*, unsigned long,
159 struct sk_buff *skb, struct tcmsg*);
160
161 struct module *owner;
162};
163
164struct tcf_proto
165{
166 /* Fast access part */
167 struct tcf_proto *next;
168 void *root;
169 int (*classify)(struct sk_buff*, struct tcf_proto*,
170 struct tcf_result *);
Al Viro66c6f522006-11-20 18:07:51 -0800171 __be16 protocol;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172
173 /* All the rest */
174 u32 prio;
175 u32 classid;
176 struct Qdisc *q;
177 void *data;
178 struct tcf_proto_ops *ops;
179};
180
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700181struct qdisc_skb_cb {
182 unsigned int pkt_len;
183 char data[];
184};
185
Krishna Kumarbbd8a0d2009-08-06 01:44:21 +0000186static inline int qdisc_qlen(struct Qdisc *q)
187{
188 return q->q.qlen;
189}
190
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700191static inline struct qdisc_skb_cb *qdisc_skb_cb(struct sk_buff *skb)
192{
193 return (struct qdisc_skb_cb *)skb->cb;
194}
195
David S. Miller83874002008-07-17 00:53:03 -0700196static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
197{
198 return &qdisc->q.lock;
199}
200
David S. Miller7698b4f2008-07-16 01:42:40 -0700201static inline struct Qdisc *qdisc_root(struct Qdisc *qdisc)
202{
203 return qdisc->dev_queue->qdisc;
204}
205
Jarek Poplawski2540e052008-08-21 05:11:14 -0700206static inline struct Qdisc *qdisc_root_sleeping(struct Qdisc *qdisc)
207{
208 return qdisc->dev_queue->qdisc_sleeping;
209}
210
David S. Miller7e43f112008-08-02 23:27:37 -0700211/* The qdisc root lock is a mechanism by which to top level
212 * of a qdisc tree can be locked from any qdisc node in the
213 * forest. This allows changing the configuration of some
214 * aspect of the qdisc tree while blocking out asynchronous
215 * qdisc access in the packet processing paths.
216 *
217 * It is only legal to do this when the root will not change
218 * on us. Otherwise we'll potentially lock the wrong qdisc
219 * root. This is enforced by holding the RTNL semaphore, which
220 * all users of this lock accessor must do.
221 */
David S. Miller7698b4f2008-07-16 01:42:40 -0700222static inline spinlock_t *qdisc_root_lock(struct Qdisc *qdisc)
223{
224 struct Qdisc *root = qdisc_root(qdisc);
225
David S. Miller7e43f112008-08-02 23:27:37 -0700226 ASSERT_RTNL();
David S. Miller83874002008-07-17 00:53:03 -0700227 return qdisc_lock(root);
David S. Miller7698b4f2008-07-16 01:42:40 -0700228}
229
Jarek Poplawskif6f9b932008-08-27 02:25:17 -0700230static inline spinlock_t *qdisc_root_sleeping_lock(struct Qdisc *qdisc)
231{
232 struct Qdisc *root = qdisc_root_sleeping(qdisc);
233
234 ASSERT_RTNL();
235 return qdisc_lock(root);
236}
237
David S. Miller5ce2d482008-07-08 17:06:30 -0700238static inline struct net_device *qdisc_dev(struct Qdisc *qdisc)
239{
240 return qdisc->dev_queue->dev;
241}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242
David S. Miller78a5b302008-07-16 03:12:24 -0700243static inline void sch_tree_lock(struct Qdisc *q)
244{
Jarek Poplawskife439dd2008-08-27 02:27:10 -0700245 spin_lock_bh(qdisc_root_sleeping_lock(q));
David S. Miller78a5b302008-07-16 03:12:24 -0700246}
247
248static inline void sch_tree_unlock(struct Qdisc *q)
249{
Jarek Poplawskife439dd2008-08-27 02:27:10 -0700250 spin_unlock_bh(qdisc_root_sleeping_lock(q));
David S. Miller78a5b302008-07-16 03:12:24 -0700251}
252
253#define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
254#define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700255
Thomas Grafe41a33e2005-07-05 14:14:30 -0700256extern struct Qdisc noop_qdisc;
257extern struct Qdisc_ops noop_qdisc_ops;
258
Patrick McHardy6fe1c7a2008-07-05 23:21:31 -0700259struct Qdisc_class_common
260{
261 u32 classid;
262 struct hlist_node hnode;
263};
264
265struct Qdisc_class_hash
266{
267 struct hlist_head *hash;
268 unsigned int hashsize;
269 unsigned int hashmask;
270 unsigned int hashelems;
271};
272
273static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
274{
275 id ^= id >> 8;
276 id ^= id >> 4;
277 return id & mask;
278}
279
280static inline struct Qdisc_class_common *
281qdisc_class_find(struct Qdisc_class_hash *hash, u32 id)
282{
283 struct Qdisc_class_common *cl;
284 struct hlist_node *n;
285 unsigned int h;
286
287 h = qdisc_class_hash(id, hash->hashmask);
288 hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
289 if (cl->classid == id)
290 return cl;
291 }
292 return NULL;
293}
294
295extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
296extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
297extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
298extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
299extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
300
Thomas Grafe41a33e2005-07-05 14:14:30 -0700301extern void dev_init_scheduler(struct net_device *dev);
302extern void dev_shutdown(struct net_device *dev);
303extern void dev_activate(struct net_device *dev);
304extern void dev_deactivate(struct net_device *dev);
305extern void qdisc_reset(struct Qdisc *qdisc);
306extern void qdisc_destroy(struct Qdisc *qdisc);
Patrick McHardy43effa12006-11-29 17:35:48 -0800307extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
David S. Miller5ce2d482008-07-08 17:06:30 -0700308extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
David S. Millerbb949fb2008-07-08 16:55:56 -0700309 struct Qdisc_ops *ops);
Thomas Grafe41a33e2005-07-05 14:14:30 -0700310extern struct Qdisc *qdisc_create_dflt(struct net_device *dev,
David S. Millerbb949fb2008-07-08 16:55:56 -0700311 struct netdev_queue *dev_queue,
Patrick McHardy9f9afec2006-11-29 17:35:18 -0800312 struct Qdisc_ops *ops, u32 parentid);
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700313extern void qdisc_calculate_pkt_len(struct sk_buff *skb,
314 struct qdisc_size_table *stab);
Patrick McHardya48b5a62007-03-23 11:29:43 -0700315extern void tcf_destroy(struct tcf_proto *tp);
Patrick McHardyff31ab52008-07-01 19:52:38 -0700316extern void tcf_destroy_chain(struct tcf_proto **fl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317
David S. Miller5aa70992008-07-08 22:59:10 -0700318/* Reset all TX qdiscs of a device. */
319static inline void qdisc_reset_all_tx(struct net_device *dev)
320{
David S. Millere8a04642008-07-17 00:34:19 -0700321 unsigned int i;
322 for (i = 0; i < dev->num_tx_queues; i++)
323 qdisc_reset(netdev_get_tx_queue(dev, i)->qdisc);
David S. Miller5aa70992008-07-08 22:59:10 -0700324}
325
David S. Miller3e745dd2008-07-08 23:00:25 -0700326/* Are all TX queues of the device empty? */
327static inline bool qdisc_all_tx_empty(const struct net_device *dev)
328{
David S. Millere8a04642008-07-17 00:34:19 -0700329 unsigned int i;
330 for (i = 0; i < dev->num_tx_queues; i++) {
331 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
332 const struct Qdisc *q = txq->qdisc;
David S. Miller3e745dd2008-07-08 23:00:25 -0700333
David S. Millere8a04642008-07-17 00:34:19 -0700334 if (q->q.qlen)
335 return false;
336 }
337 return true;
David S. Miller3e745dd2008-07-08 23:00:25 -0700338}
339
David S. Miller6fa98642008-07-08 23:01:06 -0700340/* Are any of the TX qdiscs changing? */
341static inline bool qdisc_tx_changing(struct net_device *dev)
342{
David S. Millere8a04642008-07-17 00:34:19 -0700343 unsigned int i;
344 for (i = 0; i < dev->num_tx_queues; i++) {
345 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
346 if (txq->qdisc != txq->qdisc_sleeping)
347 return true;
348 }
349 return false;
David S. Miller6fa98642008-07-08 23:01:06 -0700350}
351
David S. Millere8a04642008-07-17 00:34:19 -0700352/* Is the device using the noop qdisc on all queues? */
David S. Miller05297942008-07-08 23:01:27 -0700353static inline bool qdisc_tx_is_noop(const struct net_device *dev)
354{
David S. Millere8a04642008-07-17 00:34:19 -0700355 unsigned int i;
356 for (i = 0; i < dev->num_tx_queues; i++) {
357 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
358 if (txq->qdisc != &noop_qdisc)
359 return false;
360 }
361 return true;
David S. Miller05297942008-07-08 23:01:27 -0700362}
363
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700364static inline unsigned int qdisc_pkt_len(struct sk_buff *skb)
365{
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700366 return qdisc_skb_cb(skb)->pkt_len;
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700367}
368
Jarek Poplawskic27f3392008-08-04 22:39:11 -0700369/* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
Jarek Poplawski378a2f02008-08-04 22:31:03 -0700370enum net_xmit_qdisc_t {
371 __NET_XMIT_STOLEN = 0x00010000,
Jarek Poplawskic27f3392008-08-04 22:39:11 -0700372 __NET_XMIT_BYPASS = 0x00020000,
Jarek Poplawski378a2f02008-08-04 22:31:03 -0700373};
374
Jarek Poplawskic27f3392008-08-04 22:39:11 -0700375#ifdef CONFIG_NET_CLS_ACT
Jarek Poplawski378a2f02008-08-04 22:31:03 -0700376#define net_xmit_drop_count(e) ((e) & __NET_XMIT_STOLEN ? 0 : 1)
Jarek Poplawski378a2f02008-08-04 22:31:03 -0700377#else
378#define net_xmit_drop_count(e) (1)
379#endif
380
Jussi Kivilinna5f861732008-07-20 00:08:04 -0700381static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
382{
David S. Miller3a682fb2008-07-20 18:13:01 -0700383#ifdef CONFIG_NET_SCHED
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700384 if (sch->stab)
385 qdisc_calculate_pkt_len(skb, sch->stab);
David S. Miller3a682fb2008-07-20 18:13:01 -0700386#endif
Jussi Kivilinna5f861732008-07-20 00:08:04 -0700387 return sch->enqueue(skb, sch);
388}
389
390static inline int qdisc_enqueue_root(struct sk_buff *skb, struct Qdisc *sch)
391{
Jussi Kivilinna175f9c12008-07-20 00:08:47 -0700392 qdisc_skb_cb(skb)->pkt_len = skb->len;
Jarek Poplawski378a2f02008-08-04 22:31:03 -0700393 return qdisc_enqueue(skb, sch) & NET_XMIT_MASK;
Jussi Kivilinna5f861732008-07-20 00:08:04 -0700394}
395
Krishna Kumarbbd8a0d2009-08-06 01:44:21 +0000396static inline void __qdisc_update_bstats(struct Qdisc *sch, unsigned int len)
397{
398 sch->bstats.bytes += len;
399 sch->bstats.packets++;
400}
401
Thomas Graf9972b252005-06-18 22:57:26 -0700402static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
403 struct sk_buff_head *list)
404{
405 __skb_queue_tail(list, skb);
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700406 sch->qstats.backlog += qdisc_pkt_len(skb);
Krishna Kumarbbd8a0d2009-08-06 01:44:21 +0000407 __qdisc_update_bstats(sch, qdisc_pkt_len(skb));
Thomas Graf9972b252005-06-18 22:57:26 -0700408
409 return NET_XMIT_SUCCESS;
410}
411
412static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
413{
414 return __qdisc_enqueue_tail(skb, sch, &sch->q);
415}
416
417static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
418 struct sk_buff_head *list)
419{
420 struct sk_buff *skb = __skb_dequeue(list);
421
422 if (likely(skb != NULL))
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700423 sch->qstats.backlog -= qdisc_pkt_len(skb);
Thomas Graf9972b252005-06-18 22:57:26 -0700424
425 return skb;
426}
427
428static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
429{
430 return __qdisc_dequeue_head(sch, &sch->q);
431}
432
433static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
434 struct sk_buff_head *list)
435{
436 struct sk_buff *skb = __skb_dequeue_tail(list);
437
438 if (likely(skb != NULL))
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700439 sch->qstats.backlog -= qdisc_pkt_len(skb);
Thomas Graf9972b252005-06-18 22:57:26 -0700440
441 return skb;
442}
443
444static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
445{
446 return __qdisc_dequeue_tail(sch, &sch->q);
447}
448
Patrick McHardy48a8f512008-10-31 00:44:18 -0700449static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
450{
451 return skb_peek(&sch->q);
452}
453
Jarek Poplawski77be1552008-10-31 00:47:01 -0700454/* generic pseudo peek method for non-work-conserving qdisc */
455static inline struct sk_buff *qdisc_peek_dequeued(struct Qdisc *sch)
456{
457 /* we can reuse ->gso_skb because peek isn't called for root qdiscs */
Jarek Poplawski61c9eaf2008-11-05 16:02:34 -0800458 if (!sch->gso_skb) {
Jarek Poplawski77be1552008-10-31 00:47:01 -0700459 sch->gso_skb = sch->dequeue(sch);
Jarek Poplawski61c9eaf2008-11-05 16:02:34 -0800460 if (sch->gso_skb)
461 /* it's still part of the queue */
462 sch->q.qlen++;
463 }
Jarek Poplawski77be1552008-10-31 00:47:01 -0700464
465 return sch->gso_skb;
466}
467
468/* use instead of qdisc->dequeue() for all qdiscs queried with ->peek() */
469static inline struct sk_buff *qdisc_dequeue_peeked(struct Qdisc *sch)
470{
471 struct sk_buff *skb = sch->gso_skb;
472
Jarek Poplawski61c9eaf2008-11-05 16:02:34 -0800473 if (skb) {
Jarek Poplawski77be1552008-10-31 00:47:01 -0700474 sch->gso_skb = NULL;
Jarek Poplawski61c9eaf2008-11-05 16:02:34 -0800475 sch->q.qlen--;
476 } else {
Jarek Poplawski77be1552008-10-31 00:47:01 -0700477 skb = sch->dequeue(sch);
Jarek Poplawski61c9eaf2008-11-05 16:02:34 -0800478 }
Jarek Poplawski77be1552008-10-31 00:47:01 -0700479
480 return skb;
481}
482
Thomas Graf9972b252005-06-18 22:57:26 -0700483static inline void __qdisc_reset_queue(struct Qdisc *sch,
484 struct sk_buff_head *list)
485{
486 /*
487 * We do not know the backlog in bytes of this list, it
488 * is up to the caller to correct it
489 */
David S. Miller93245dd2008-07-17 04:03:43 -0700490 __skb_queue_purge(list);
Thomas Graf9972b252005-06-18 22:57:26 -0700491}
492
493static inline void qdisc_reset_queue(struct Qdisc *sch)
494{
495 __qdisc_reset_queue(sch, &sch->q);
496 sch->qstats.backlog = 0;
497}
498
499static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
500 struct sk_buff_head *list)
501{
502 struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
503
504 if (likely(skb != NULL)) {
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700505 unsigned int len = qdisc_pkt_len(skb);
Thomas Graf9972b252005-06-18 22:57:26 -0700506 kfree_skb(skb);
507 return len;
508 }
509
510 return 0;
511}
512
513static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
514{
515 return __qdisc_queue_drop(sch, &sch->q);
516}
517
518static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
519{
520 kfree_skb(skb);
521 sch->qstats.drops++;
522
523 return NET_XMIT_DROP;
524}
525
526static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
527{
528 sch->qstats.drops++;
529
Patrick McHardyc3bc7cf2007-07-15 00:03:05 -0700530#ifdef CONFIG_NET_CLS_ACT
Thomas Graf9972b252005-06-18 22:57:26 -0700531 if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
532 goto drop;
533
534 return NET_XMIT_SUCCESS;
535
536drop:
537#endif
538 kfree_skb(skb);
539 return NET_XMIT_DROP;
540}
541
Jesper Dangaard Brouere9bef552007-09-12 16:35:24 +0200542/* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
543 long it will take to send a packet given its size.
544 */
545static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
546{
Jesper Dangaard Brouere08b0992007-09-12 16:36:28 +0200547 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
548 if (slot < 0)
549 slot = 0;
Jesper Dangaard Brouere9bef552007-09-12 16:35:24 +0200550 slot >>= rtab->rate.cell_log;
551 if (slot > 255)
552 return (rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF]);
553 return rtab->data[slot];
554}
555
Jamal Hadi Salim12da81d2007-10-26 02:47:23 -0700556#ifdef CONFIG_NET_CLS_ACT
557static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask)
558{
559 struct sk_buff *n = skb_clone(skb, gfp_mask);
560
561 if (n) {
562 n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
563 n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
564 n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
Jamal Hadi Salim12da81d2007-10-26 02:47:23 -0700565 }
566 return n;
567}
568#endif
569
Linus Torvalds1da177e2005-04-16 15:20:36 -0700570#endif