igb: Kill CONFIG_NETDEVICES_MULTIQUEUE references, no longer exists.
[linux-block.git] / include / net / sch_generic.h
CommitLineData
1da177e4
LT
1#ifndef __NET_SCHED_GENERIC_H
2#define __NET_SCHED_GENERIC_H
3
1da177e4
LT
4#include <linux/netdevice.h>
5#include <linux/types.h>
6#include <linux/rcupdate.h>
7#include <linux/module.h>
1da177e4
LT
8#include <linux/pkt_sched.h>
9#include <linux/pkt_cls.h>
10#include <net/gen_stats.h>
be577ddc 11#include <net/rtnetlink.h>
1da177e4
LT
12
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
26struct Qdisc
27{
28 int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
29 struct sk_buff * (*dequeue)(struct Qdisc *dev);
30 unsigned flags;
31#define TCQ_F_BUILTIN 1
32#define TCQ_F_THROTTLED 2
33#define TCQ_F_INGRESS 4
34 int padded;
35 struct Qdisc_ops *ops;
36 u32 handle;
37 u32 parent;
38 atomic_t refcnt;
39 struct sk_buff_head q;
bb949fbd 40 struct netdev_queue *dev_queue;
1da177e4
LT
41 struct list_head list;
42
43 struct gnet_stats_basic bstats;
44 struct gnet_stats_queue qstats;
45 struct gnet_stats_rate_est rate_est;
1da177e4
LT
46 struct rcu_head q_rcu;
47 int (*reshape_fail)(struct sk_buff *skb,
48 struct Qdisc *q);
49
50 /* This field is deprecated, but it is still used by CBQ
51 * and it will live until better solution will be invented.
52 */
53 struct Qdisc *__parent;
54};
55
56struct Qdisc_class_ops
57{
58 /* Child qdisc manipulation */
59 int (*graft)(struct Qdisc *, unsigned long cl,
60 struct Qdisc *, struct Qdisc **);
61 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
43effa1e 62 void (*qlen_notify)(struct Qdisc *, unsigned long);
1da177e4
LT
63
64 /* Class manipulation routines */
65 unsigned long (*get)(struct Qdisc *, u32 classid);
66 void (*put)(struct Qdisc *, unsigned long);
67 int (*change)(struct Qdisc *, u32, u32,
1e90474c 68 struct nlattr **, unsigned long *);
1da177e4
LT
69 int (*delete)(struct Qdisc *, unsigned long);
70 void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
71
72 /* Filter manipulation */
73 struct tcf_proto ** (*tcf_chain)(struct Qdisc *, unsigned long);
74 unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
75 u32 classid);
76 void (*unbind_tcf)(struct Qdisc *, unsigned long);
77
78 /* rtnetlink specific */
79 int (*dump)(struct Qdisc *, unsigned long,
80 struct sk_buff *skb, struct tcmsg*);
81 int (*dump_stats)(struct Qdisc *, unsigned long,
82 struct gnet_dump *);
83};
84
85struct Qdisc_ops
86{
87 struct Qdisc_ops *next;
20fea08b 88 const struct Qdisc_class_ops *cl_ops;
1da177e4
LT
89 char id[IFNAMSIZ];
90 int priv_size;
91
92 int (*enqueue)(struct sk_buff *, struct Qdisc *);
93 struct sk_buff * (*dequeue)(struct Qdisc *);
94 int (*requeue)(struct sk_buff *, struct Qdisc *);
95 unsigned int (*drop)(struct Qdisc *);
96
1e90474c 97 int (*init)(struct Qdisc *, struct nlattr *arg);
1da177e4
LT
98 void (*reset)(struct Qdisc *);
99 void (*destroy)(struct Qdisc *);
1e90474c 100 int (*change)(struct Qdisc *, struct nlattr *arg);
1da177e4
LT
101
102 int (*dump)(struct Qdisc *, struct sk_buff *);
103 int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
104
105 struct module *owner;
106};
107
108
109struct tcf_result
110{
111 unsigned long class;
112 u32 classid;
113};
114
115struct tcf_proto_ops
116{
117 struct tcf_proto_ops *next;
118 char kind[IFNAMSIZ];
119
120 int (*classify)(struct sk_buff*, struct tcf_proto*,
121 struct tcf_result *);
122 int (*init)(struct tcf_proto*);
123 void (*destroy)(struct tcf_proto*);
124
125 unsigned long (*get)(struct tcf_proto*, u32 handle);
126 void (*put)(struct tcf_proto*, unsigned long);
127 int (*change)(struct tcf_proto*, unsigned long,
add93b61 128 u32 handle, struct nlattr **,
1da177e4
LT
129 unsigned long *);
130 int (*delete)(struct tcf_proto*, unsigned long);
131 void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
132
133 /* rtnetlink specific */
134 int (*dump)(struct tcf_proto*, unsigned long,
135 struct sk_buff *skb, struct tcmsg*);
136
137 struct module *owner;
138};
139
140struct tcf_proto
141{
142 /* Fast access part */
143 struct tcf_proto *next;
144 void *root;
145 int (*classify)(struct sk_buff*, struct tcf_proto*,
146 struct tcf_result *);
66c6f529 147 __be16 protocol;
1da177e4
LT
148
149 /* All the rest */
150 u32 prio;
151 u32 classid;
152 struct Qdisc *q;
153 void *data;
154 struct tcf_proto_ops *ops;
155};
156
5ce2d488
DM
157static inline struct net_device *qdisc_dev(struct Qdisc *qdisc)
158{
159 return qdisc->dev_queue->dev;
160}
1da177e4
LT
161
162extern void qdisc_lock_tree(struct net_device *dev);
163extern void qdisc_unlock_tree(struct net_device *dev);
164
5ce2d488
DM
165#define sch_tree_lock(q) qdisc_lock_tree(qdisc_dev(q))
166#define sch_tree_unlock(q) qdisc_unlock_tree(qdisc_dev(q))
167#define tcf_tree_lock(tp) qdisc_lock_tree(qdisc_dev((tp)->q))
168#define tcf_tree_unlock(tp) qdisc_unlock_tree(qdisc_dev((tp)->q))
1da177e4 169
e41a33e6
TG
170extern struct Qdisc noop_qdisc;
171extern struct Qdisc_ops noop_qdisc_ops;
172
6fe1c7a5
PM
173struct Qdisc_class_common
174{
175 u32 classid;
176 struct hlist_node hnode;
177};
178
179struct Qdisc_class_hash
180{
181 struct hlist_head *hash;
182 unsigned int hashsize;
183 unsigned int hashmask;
184 unsigned int hashelems;
185};
186
187static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
188{
189 id ^= id >> 8;
190 id ^= id >> 4;
191 return id & mask;
192}
193
194static inline struct Qdisc_class_common *
195qdisc_class_find(struct Qdisc_class_hash *hash, u32 id)
196{
197 struct Qdisc_class_common *cl;
198 struct hlist_node *n;
199 unsigned int h;
200
201 h = qdisc_class_hash(id, hash->hashmask);
202 hlist_for_each_entry(cl, n, &hash->hash[h], hnode) {
203 if (cl->classid == id)
204 return cl;
205 }
206 return NULL;
207}
208
209extern int qdisc_class_hash_init(struct Qdisc_class_hash *);
210extern void qdisc_class_hash_insert(struct Qdisc_class_hash *, struct Qdisc_class_common *);
211extern void qdisc_class_hash_remove(struct Qdisc_class_hash *, struct Qdisc_class_common *);
212extern void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
213extern void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
214
e41a33e6
TG
215extern void dev_init_scheduler(struct net_device *dev);
216extern void dev_shutdown(struct net_device *dev);
217extern void dev_activate(struct net_device *dev);
218extern void dev_deactivate(struct net_device *dev);
219extern void qdisc_reset(struct Qdisc *qdisc);
220extern void qdisc_destroy(struct Qdisc *qdisc);
43effa1e 221extern void qdisc_tree_decrease_qlen(struct Qdisc *qdisc, unsigned int n);
5ce2d488 222extern struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
bb949fbd 223 struct Qdisc_ops *ops);
e41a33e6 224extern struct Qdisc *qdisc_create_dflt(struct net_device *dev,
bb949fbd 225 struct netdev_queue *dev_queue,
9f9afec4 226 struct Qdisc_ops *ops, u32 parentid);
a48b5a61 227extern void tcf_destroy(struct tcf_proto *tp);
ff31ab56 228extern void tcf_destroy_chain(struct tcf_proto **fl);
1da177e4 229
5aa70995
DM
230/* Reset all TX qdiscs of a device. */
231static inline void qdisc_reset_all_tx(struct net_device *dev)
232{
233 qdisc_reset(dev->tx_queue.qdisc);
234}
235
3e745dd6
DM
236/* Are all TX queues of the device empty? */
237static inline bool qdisc_all_tx_empty(const struct net_device *dev)
238{
239 const struct netdev_queue *txq = &dev->tx_queue;
240 const struct Qdisc *q = txq->qdisc;
241
242 return (q->q.qlen == 0);
243}
244
6fa9864b
DM
245/* Are any of the TX qdiscs changing? */
246static inline bool qdisc_tx_changing(struct net_device *dev)
247{
248 struct netdev_queue *txq = &dev->tx_queue;
249
250 return (txq->qdisc != txq->qdisc_sleeping);
251}
252
05297949
DM
253/* Is the device using the noop qdisc? */
254static inline bool qdisc_tx_is_noop(const struct net_device *dev)
255{
256 const struct netdev_queue *txq = &dev->tx_queue;
257
258 return (txq->qdisc == &noop_qdisc);
259}
260
9972b25d
TG
261static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
262 struct sk_buff_head *list)
263{
264 __skb_queue_tail(list, skb);
265 sch->qstats.backlog += skb->len;
266 sch->bstats.bytes += skb->len;
267 sch->bstats.packets++;
268
269 return NET_XMIT_SUCCESS;
270}
271
272static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
273{
274 return __qdisc_enqueue_tail(skb, sch, &sch->q);
275}
276
277static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
278 struct sk_buff_head *list)
279{
280 struct sk_buff *skb = __skb_dequeue(list);
281
282 if (likely(skb != NULL))
283 sch->qstats.backlog -= skb->len;
284
285 return skb;
286}
287
288static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
289{
290 return __qdisc_dequeue_head(sch, &sch->q);
291}
292
293static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
294 struct sk_buff_head *list)
295{
296 struct sk_buff *skb = __skb_dequeue_tail(list);
297
298 if (likely(skb != NULL))
299 sch->qstats.backlog -= skb->len;
300
301 return skb;
302}
303
304static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
305{
306 return __qdisc_dequeue_tail(sch, &sch->q);
307}
308
309static inline int __qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch,
310 struct sk_buff_head *list)
311{
312 __skb_queue_head(list, skb);
313 sch->qstats.backlog += skb->len;
314 sch->qstats.requeues++;
315
316 return NET_XMIT_SUCCESS;
317}
318
319static inline int qdisc_requeue(struct sk_buff *skb, struct Qdisc *sch)
320{
321 return __qdisc_requeue(skb, sch, &sch->q);
322}
323
324static inline void __qdisc_reset_queue(struct Qdisc *sch,
325 struct sk_buff_head *list)
326{
327 /*
328 * We do not know the backlog in bytes of this list, it
329 * is up to the caller to correct it
330 */
331 skb_queue_purge(list);
332}
333
334static inline void qdisc_reset_queue(struct Qdisc *sch)
335{
336 __qdisc_reset_queue(sch, &sch->q);
337 sch->qstats.backlog = 0;
338}
339
340static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
341 struct sk_buff_head *list)
342{
343 struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
344
345 if (likely(skb != NULL)) {
346 unsigned int len = skb->len;
347 kfree_skb(skb);
348 return len;
349 }
350
351 return 0;
352}
353
354static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
355{
356 return __qdisc_queue_drop(sch, &sch->q);
357}
358
359static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
360{
361 kfree_skb(skb);
362 sch->qstats.drops++;
363
364 return NET_XMIT_DROP;
365}
366
367static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
368{
369 sch->qstats.drops++;
370
c3bc7cff 371#ifdef CONFIG_NET_CLS_ACT
9972b25d
TG
372 if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
373 goto drop;
374
375 return NET_XMIT_SUCCESS;
376
377drop:
378#endif
379 kfree_skb(skb);
380 return NET_XMIT_DROP;
381}
382
e9bef55d
JDB
383/* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
384 long it will take to send a packet given its size.
385 */
386static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
387{
e08b0998
JDB
388 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
389 if (slot < 0)
390 slot = 0;
e9bef55d
JDB
391 slot >>= rtab->rate.cell_log;
392 if (slot > 255)
393 return (rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF]);
394 return rtab->data[slot];
395}
396
12da81d1
JHS
397#ifdef CONFIG_NET_CLS_ACT
398static inline struct sk_buff *skb_act_clone(struct sk_buff *skb, gfp_t gfp_mask)
399{
400 struct sk_buff *n = skb_clone(skb, gfp_mask);
401
402 if (n) {
403 n->tc_verd = SET_TC_VERD(n->tc_verd, 0);
404 n->tc_verd = CLR_TC_OK2MUNGE(n->tc_verd);
405 n->tc_verd = CLR_TC_MUNGED(n->tc_verd);
12da81d1
JHS
406 }
407 return n;
408}
409#endif
410
1da177e4 411#endif