net_sched: update hierarchical backlog too
[deliverable/linux.git] / include / net / sch_generic.h
1 #ifndef __NET_SCHED_GENERIC_H
2 #define __NET_SCHED_GENERIC_H
3
4 #include <linux/netdevice.h>
5 #include <linux/types.h>
6 #include <linux/rcupdate.h>
7 #include <linux/pkt_sched.h>
8 #include <linux/pkt_cls.h>
9 #include <linux/percpu.h>
10 #include <linux/dynamic_queue_limits.h>
11 #include <net/gen_stats.h>
12 #include <net/rtnetlink.h>
13
14 struct Qdisc_ops;
15 struct qdisc_walker;
16 struct tcf_walker;
17 struct module;
18
19 struct qdisc_rate_table {
20 struct tc_ratespec rate;
21 u32 data[256];
22 struct qdisc_rate_table *next;
23 int refcnt;
24 };
25
26 enum qdisc_state_t {
27 __QDISC_STATE_SCHED,
28 __QDISC_STATE_DEACTIVATED,
29 __QDISC_STATE_THROTTLED,
30 };
31
32 /*
33 * following bits are only changed while qdisc lock is held
34 */
35 enum qdisc___state_t {
36 __QDISC___STATE_RUNNING = 1,
37 };
38
39 struct qdisc_size_table {
40 struct rcu_head rcu;
41 struct list_head list;
42 struct tc_sizespec szopts;
43 int refcnt;
44 u16 data[];
45 };
46
47 struct Qdisc {
48 int (*enqueue)(struct sk_buff *skb, struct Qdisc *dev);
49 struct sk_buff * (*dequeue)(struct Qdisc *dev);
50 unsigned int flags;
51 #define TCQ_F_BUILTIN 1
52 #define TCQ_F_INGRESS 2
53 #define TCQ_F_CAN_BYPASS 4
54 #define TCQ_F_MQROOT 8
55 #define TCQ_F_ONETXQUEUE 0x10 /* dequeue_skb() can assume all skbs are for
56 * q->dev_queue : It can test
57 * netif_xmit_frozen_or_stopped() before
58 * dequeueing next packet.
59 * Its true for MQ/MQPRIO slaves, or non
60 * multiqueue device.
61 */
62 #define TCQ_F_WARN_NONWC (1 << 16)
63 #define TCQ_F_CPUSTATS 0x20 /* run using percpu statistics */
64 #define TCQ_F_NOPARENT 0x40 /* root of its hierarchy :
65 * qdisc_tree_decrease_qlen() should stop.
66 */
67 u32 limit;
68 const struct Qdisc_ops *ops;
69 struct qdisc_size_table __rcu *stab;
70 struct list_head list;
71 u32 handle;
72 u32 parent;
73 int (*reshape_fail)(struct sk_buff *skb,
74 struct Qdisc *q);
75
76 void *u32_node;
77
78 /* This field is deprecated, but it is still used by CBQ
79 * and it will live until better solution will be invented.
80 */
81 struct Qdisc *__parent;
82 struct netdev_queue *dev_queue;
83
84 struct gnet_stats_rate_est64 rate_est;
85 struct gnet_stats_basic_cpu __percpu *cpu_bstats;
86 struct gnet_stats_queue __percpu *cpu_qstats;
87
88 struct Qdisc *next_sched;
89 struct sk_buff *gso_skb;
90 /*
91 * For performance sake on SMP, we put highly modified fields at the end
92 */
93 unsigned long state;
94 struct sk_buff_head q;
95 struct gnet_stats_basic_packed bstats;
96 unsigned int __state;
97 struct gnet_stats_queue qstats;
98 struct rcu_head rcu_head;
99 int padded;
100 atomic_t refcnt;
101
102 spinlock_t busylock ____cacheline_aligned_in_smp;
103 };
104
105 static inline bool qdisc_is_running(const struct Qdisc *qdisc)
106 {
107 return (qdisc->__state & __QDISC___STATE_RUNNING) ? true : false;
108 }
109
110 static inline bool qdisc_run_begin(struct Qdisc *qdisc)
111 {
112 if (qdisc_is_running(qdisc))
113 return false;
114 qdisc->__state |= __QDISC___STATE_RUNNING;
115 return true;
116 }
117
118 static inline void qdisc_run_end(struct Qdisc *qdisc)
119 {
120 qdisc->__state &= ~__QDISC___STATE_RUNNING;
121 }
122
123 static inline bool qdisc_may_bulk(const struct Qdisc *qdisc)
124 {
125 return qdisc->flags & TCQ_F_ONETXQUEUE;
126 }
127
128 static inline int qdisc_avail_bulklimit(const struct netdev_queue *txq)
129 {
130 #ifdef CONFIG_BQL
131 /* Non-BQL migrated drivers will return 0, too. */
132 return dql_avail(&txq->dql);
133 #else
134 return 0;
135 #endif
136 }
137
138 static inline bool qdisc_is_throttled(const struct Qdisc *qdisc)
139 {
140 return test_bit(__QDISC_STATE_THROTTLED, &qdisc->state) ? true : false;
141 }
142
143 static inline void qdisc_throttled(struct Qdisc *qdisc)
144 {
145 set_bit(__QDISC_STATE_THROTTLED, &qdisc->state);
146 }
147
148 static inline void qdisc_unthrottled(struct Qdisc *qdisc)
149 {
150 clear_bit(__QDISC_STATE_THROTTLED, &qdisc->state);
151 }
152
153 struct Qdisc_class_ops {
154 /* Child qdisc manipulation */
155 struct netdev_queue * (*select_queue)(struct Qdisc *, struct tcmsg *);
156 int (*graft)(struct Qdisc *, unsigned long cl,
157 struct Qdisc *, struct Qdisc **);
158 struct Qdisc * (*leaf)(struct Qdisc *, unsigned long cl);
159 void (*qlen_notify)(struct Qdisc *, unsigned long);
160
161 /* Class manipulation routines */
162 unsigned long (*get)(struct Qdisc *, u32 classid);
163 void (*put)(struct Qdisc *, unsigned long);
164 int (*change)(struct Qdisc *, u32, u32,
165 struct nlattr **, unsigned long *);
166 int (*delete)(struct Qdisc *, unsigned long);
167 void (*walk)(struct Qdisc *, struct qdisc_walker * arg);
168
169 /* Filter manipulation */
170 struct tcf_proto __rcu ** (*tcf_chain)(struct Qdisc *, unsigned long);
171 unsigned long (*bind_tcf)(struct Qdisc *, unsigned long,
172 u32 classid);
173 void (*unbind_tcf)(struct Qdisc *, unsigned long);
174
175 /* rtnetlink specific */
176 int (*dump)(struct Qdisc *, unsigned long,
177 struct sk_buff *skb, struct tcmsg*);
178 int (*dump_stats)(struct Qdisc *, unsigned long,
179 struct gnet_dump *);
180 };
181
182 struct Qdisc_ops {
183 struct Qdisc_ops *next;
184 const struct Qdisc_class_ops *cl_ops;
185 char id[IFNAMSIZ];
186 int priv_size;
187
188 int (*enqueue)(struct sk_buff *, struct Qdisc *);
189 struct sk_buff * (*dequeue)(struct Qdisc *);
190 struct sk_buff * (*peek)(struct Qdisc *);
191 unsigned int (*drop)(struct Qdisc *);
192
193 int (*init)(struct Qdisc *, struct nlattr *arg);
194 void (*reset)(struct Qdisc *);
195 void (*destroy)(struct Qdisc *);
196 int (*change)(struct Qdisc *, struct nlattr *arg);
197 void (*attach)(struct Qdisc *);
198
199 int (*dump)(struct Qdisc *, struct sk_buff *);
200 int (*dump_stats)(struct Qdisc *, struct gnet_dump *);
201
202 struct module *owner;
203 };
204
205
206 struct tcf_result {
207 unsigned long class;
208 u32 classid;
209 };
210
211 struct tcf_proto_ops {
212 struct list_head head;
213 char kind[IFNAMSIZ];
214
215 int (*classify)(struct sk_buff *,
216 const struct tcf_proto *,
217 struct tcf_result *);
218 int (*init)(struct tcf_proto*);
219 bool (*destroy)(struct tcf_proto*, bool);
220
221 unsigned long (*get)(struct tcf_proto*, u32 handle);
222 int (*change)(struct net *net, struct sk_buff *,
223 struct tcf_proto*, unsigned long,
224 u32 handle, struct nlattr **,
225 unsigned long *, bool);
226 int (*delete)(struct tcf_proto*, unsigned long);
227 void (*walk)(struct tcf_proto*, struct tcf_walker *arg);
228
229 /* rtnetlink specific */
230 int (*dump)(struct net*, struct tcf_proto*, unsigned long,
231 struct sk_buff *skb, struct tcmsg*);
232
233 struct module *owner;
234 };
235
236 struct tcf_proto {
237 /* Fast access part */
238 struct tcf_proto __rcu *next;
239 void __rcu *root;
240 int (*classify)(struct sk_buff *,
241 const struct tcf_proto *,
242 struct tcf_result *);
243 __be16 protocol;
244
245 /* All the rest */
246 u32 prio;
247 u32 classid;
248 struct Qdisc *q;
249 void *data;
250 const struct tcf_proto_ops *ops;
251 struct rcu_head rcu;
252 };
253
254 struct qdisc_skb_cb {
255 unsigned int pkt_len;
256 u16 slave_dev_queue_mapping;
257 u16 tc_classid;
258 #define QDISC_CB_PRIV_LEN 20
259 unsigned char data[QDISC_CB_PRIV_LEN];
260 };
261
262 static inline void qdisc_cb_private_validate(const struct sk_buff *skb, int sz)
263 {
264 struct qdisc_skb_cb *qcb;
265
266 BUILD_BUG_ON(sizeof(skb->cb) < offsetof(struct qdisc_skb_cb, data) + sz);
267 BUILD_BUG_ON(sizeof(qcb->data) < sz);
268 }
269
270 static inline int qdisc_qlen(const struct Qdisc *q)
271 {
272 return q->q.qlen;
273 }
274
275 static inline struct qdisc_skb_cb *qdisc_skb_cb(const struct sk_buff *skb)
276 {
277 return (struct qdisc_skb_cb *)skb->cb;
278 }
279
280 static inline spinlock_t *qdisc_lock(struct Qdisc *qdisc)
281 {
282 return &qdisc->q.lock;
283 }
284
285 static inline struct Qdisc *qdisc_root(const struct Qdisc *qdisc)
286 {
287 struct Qdisc *q = rcu_dereference_rtnl(qdisc->dev_queue->qdisc);
288
289 return q;
290 }
291
292 static inline struct Qdisc *qdisc_root_sleeping(const struct Qdisc *qdisc)
293 {
294 return qdisc->dev_queue->qdisc_sleeping;
295 }
296
297 /* The qdisc root lock is a mechanism by which to top level
298 * of a qdisc tree can be locked from any qdisc node in the
299 * forest. This allows changing the configuration of some
300 * aspect of the qdisc tree while blocking out asynchronous
301 * qdisc access in the packet processing paths.
302 *
303 * It is only legal to do this when the root will not change
304 * on us. Otherwise we'll potentially lock the wrong qdisc
305 * root. This is enforced by holding the RTNL semaphore, which
306 * all users of this lock accessor must do.
307 */
308 static inline spinlock_t *qdisc_root_lock(const struct Qdisc *qdisc)
309 {
310 struct Qdisc *root = qdisc_root(qdisc);
311
312 ASSERT_RTNL();
313 return qdisc_lock(root);
314 }
315
316 static inline spinlock_t *qdisc_root_sleeping_lock(const struct Qdisc *qdisc)
317 {
318 struct Qdisc *root = qdisc_root_sleeping(qdisc);
319
320 ASSERT_RTNL();
321 return qdisc_lock(root);
322 }
323
324 static inline struct net_device *qdisc_dev(const struct Qdisc *qdisc)
325 {
326 return qdisc->dev_queue->dev;
327 }
328
329 static inline void sch_tree_lock(const struct Qdisc *q)
330 {
331 spin_lock_bh(qdisc_root_sleeping_lock(q));
332 }
333
334 static inline void sch_tree_unlock(const struct Qdisc *q)
335 {
336 spin_unlock_bh(qdisc_root_sleeping_lock(q));
337 }
338
339 #define tcf_tree_lock(tp) sch_tree_lock((tp)->q)
340 #define tcf_tree_unlock(tp) sch_tree_unlock((tp)->q)
341
342 extern struct Qdisc noop_qdisc;
343 extern struct Qdisc_ops noop_qdisc_ops;
344 extern struct Qdisc_ops pfifo_fast_ops;
345 extern struct Qdisc_ops mq_qdisc_ops;
346 extern struct Qdisc_ops noqueue_qdisc_ops;
347 extern const struct Qdisc_ops *default_qdisc_ops;
348
349 struct Qdisc_class_common {
350 u32 classid;
351 struct hlist_node hnode;
352 };
353
354 struct Qdisc_class_hash {
355 struct hlist_head *hash;
356 unsigned int hashsize;
357 unsigned int hashmask;
358 unsigned int hashelems;
359 };
360
361 static inline unsigned int qdisc_class_hash(u32 id, u32 mask)
362 {
363 id ^= id >> 8;
364 id ^= id >> 4;
365 return id & mask;
366 }
367
368 static inline struct Qdisc_class_common *
369 qdisc_class_find(const struct Qdisc_class_hash *hash, u32 id)
370 {
371 struct Qdisc_class_common *cl;
372 unsigned int h;
373
374 h = qdisc_class_hash(id, hash->hashmask);
375 hlist_for_each_entry(cl, &hash->hash[h], hnode) {
376 if (cl->classid == id)
377 return cl;
378 }
379 return NULL;
380 }
381
382 int qdisc_class_hash_init(struct Qdisc_class_hash *);
383 void qdisc_class_hash_insert(struct Qdisc_class_hash *,
384 struct Qdisc_class_common *);
385 void qdisc_class_hash_remove(struct Qdisc_class_hash *,
386 struct Qdisc_class_common *);
387 void qdisc_class_hash_grow(struct Qdisc *, struct Qdisc_class_hash *);
388 void qdisc_class_hash_destroy(struct Qdisc_class_hash *);
389
390 void dev_init_scheduler(struct net_device *dev);
391 void dev_shutdown(struct net_device *dev);
392 void dev_activate(struct net_device *dev);
393 void dev_deactivate(struct net_device *dev);
394 void dev_deactivate_many(struct list_head *head);
395 struct Qdisc *dev_graft_qdisc(struct netdev_queue *dev_queue,
396 struct Qdisc *qdisc);
397 void qdisc_reset(struct Qdisc *qdisc);
398 void qdisc_destroy(struct Qdisc *qdisc);
399 void qdisc_tree_reduce_backlog(struct Qdisc *qdisc, unsigned int n,
400 unsigned int len);
401 struct Qdisc *qdisc_alloc(struct netdev_queue *dev_queue,
402 const struct Qdisc_ops *ops);
403 struct Qdisc *qdisc_create_dflt(struct netdev_queue *dev_queue,
404 const struct Qdisc_ops *ops, u32 parentid);
405 void __qdisc_calculate_pkt_len(struct sk_buff *skb,
406 const struct qdisc_size_table *stab);
407 bool tcf_destroy(struct tcf_proto *tp, bool force);
408 void tcf_destroy_chain(struct tcf_proto __rcu **fl);
409 int skb_do_redirect(struct sk_buff *);
410
411 static inline bool skb_at_tc_ingress(const struct sk_buff *skb)
412 {
413 #ifdef CONFIG_NET_CLS_ACT
414 return G_TC_AT(skb->tc_verd) & AT_INGRESS;
415 #else
416 return false;
417 #endif
418 }
419
420 /* Reset all TX qdiscs greater then index of a device. */
421 static inline void qdisc_reset_all_tx_gt(struct net_device *dev, unsigned int i)
422 {
423 struct Qdisc *qdisc;
424
425 for (; i < dev->num_tx_queues; i++) {
426 qdisc = rtnl_dereference(netdev_get_tx_queue(dev, i)->qdisc);
427 if (qdisc) {
428 spin_lock_bh(qdisc_lock(qdisc));
429 qdisc_reset(qdisc);
430 spin_unlock_bh(qdisc_lock(qdisc));
431 }
432 }
433 }
434
435 static inline void qdisc_reset_all_tx(struct net_device *dev)
436 {
437 qdisc_reset_all_tx_gt(dev, 0);
438 }
439
440 /* Are all TX queues of the device empty? */
441 static inline bool qdisc_all_tx_empty(const struct net_device *dev)
442 {
443 unsigned int i;
444
445 rcu_read_lock();
446 for (i = 0; i < dev->num_tx_queues; i++) {
447 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
448 const struct Qdisc *q = rcu_dereference(txq->qdisc);
449
450 if (q->q.qlen) {
451 rcu_read_unlock();
452 return false;
453 }
454 }
455 rcu_read_unlock();
456 return true;
457 }
458
459 /* Are any of the TX qdiscs changing? */
460 static inline bool qdisc_tx_changing(const struct net_device *dev)
461 {
462 unsigned int i;
463
464 for (i = 0; i < dev->num_tx_queues; i++) {
465 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
466 if (rcu_access_pointer(txq->qdisc) != txq->qdisc_sleeping)
467 return true;
468 }
469 return false;
470 }
471
472 /* Is the device using the noop qdisc on all queues? */
473 static inline bool qdisc_tx_is_noop(const struct net_device *dev)
474 {
475 unsigned int i;
476
477 for (i = 0; i < dev->num_tx_queues; i++) {
478 struct netdev_queue *txq = netdev_get_tx_queue(dev, i);
479 if (rcu_access_pointer(txq->qdisc) != &noop_qdisc)
480 return false;
481 }
482 return true;
483 }
484
485 static inline unsigned int qdisc_pkt_len(const struct sk_buff *skb)
486 {
487 return qdisc_skb_cb(skb)->pkt_len;
488 }
489
490 /* additional qdisc xmit flags (NET_XMIT_MASK in linux/netdevice.h) */
491 enum net_xmit_qdisc_t {
492 __NET_XMIT_STOLEN = 0x00010000,
493 __NET_XMIT_BYPASS = 0x00020000,
494 };
495
496 #ifdef CONFIG_NET_CLS_ACT
497 #define net_xmit_drop_count(e) ((e) & __NET_XMIT_STOLEN ? 0 : 1)
498 #else
499 #define net_xmit_drop_count(e) (1)
500 #endif
501
502 static inline void qdisc_calculate_pkt_len(struct sk_buff *skb,
503 const struct Qdisc *sch)
504 {
505 #ifdef CONFIG_NET_SCHED
506 struct qdisc_size_table *stab = rcu_dereference_bh(sch->stab);
507
508 if (stab)
509 __qdisc_calculate_pkt_len(skb, stab);
510 #endif
511 }
512
513 static inline int qdisc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
514 {
515 qdisc_calculate_pkt_len(skb, sch);
516 return sch->enqueue(skb, sch);
517 }
518
519 static inline bool qdisc_is_percpu_stats(const struct Qdisc *q)
520 {
521 return q->flags & TCQ_F_CPUSTATS;
522 }
523
524 static inline void bstats_update(struct gnet_stats_basic_packed *bstats,
525 const struct sk_buff *skb)
526 {
527 bstats->bytes += qdisc_pkt_len(skb);
528 bstats->packets += skb_is_gso(skb) ? skb_shinfo(skb)->gso_segs : 1;
529 }
530
531 static inline void bstats_cpu_update(struct gnet_stats_basic_cpu *bstats,
532 const struct sk_buff *skb)
533 {
534 u64_stats_update_begin(&bstats->syncp);
535 bstats_update(&bstats->bstats, skb);
536 u64_stats_update_end(&bstats->syncp);
537 }
538
539 static inline void qdisc_bstats_cpu_update(struct Qdisc *sch,
540 const struct sk_buff *skb)
541 {
542 bstats_cpu_update(this_cpu_ptr(sch->cpu_bstats), skb);
543 }
544
545 static inline void qdisc_bstats_update(struct Qdisc *sch,
546 const struct sk_buff *skb)
547 {
548 bstats_update(&sch->bstats, skb);
549 }
550
551 static inline void qdisc_qstats_backlog_dec(struct Qdisc *sch,
552 const struct sk_buff *skb)
553 {
554 sch->qstats.backlog -= qdisc_pkt_len(skb);
555 }
556
557 static inline void qdisc_qstats_backlog_inc(struct Qdisc *sch,
558 const struct sk_buff *skb)
559 {
560 sch->qstats.backlog += qdisc_pkt_len(skb);
561 }
562
563 static inline void __qdisc_qstats_drop(struct Qdisc *sch, int count)
564 {
565 sch->qstats.drops += count;
566 }
567
568 static inline void qstats_drop_inc(struct gnet_stats_queue *qstats)
569 {
570 qstats->drops++;
571 }
572
573 static inline void qstats_overlimit_inc(struct gnet_stats_queue *qstats)
574 {
575 qstats->overlimits++;
576 }
577
578 static inline void qdisc_qstats_drop(struct Qdisc *sch)
579 {
580 qstats_drop_inc(&sch->qstats);
581 }
582
583 static inline void qdisc_qstats_cpu_drop(struct Qdisc *sch)
584 {
585 qstats_drop_inc(this_cpu_ptr(sch->cpu_qstats));
586 }
587
588 static inline void qdisc_qstats_overlimit(struct Qdisc *sch)
589 {
590 sch->qstats.overlimits++;
591 }
592
593 static inline int __qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch,
594 struct sk_buff_head *list)
595 {
596 __skb_queue_tail(list, skb);
597 qdisc_qstats_backlog_inc(sch, skb);
598
599 return NET_XMIT_SUCCESS;
600 }
601
602 static inline int qdisc_enqueue_tail(struct sk_buff *skb, struct Qdisc *sch)
603 {
604 return __qdisc_enqueue_tail(skb, sch, &sch->q);
605 }
606
607 static inline struct sk_buff *__qdisc_dequeue_head(struct Qdisc *sch,
608 struct sk_buff_head *list)
609 {
610 struct sk_buff *skb = __skb_dequeue(list);
611
612 if (likely(skb != NULL)) {
613 qdisc_qstats_backlog_dec(sch, skb);
614 qdisc_bstats_update(sch, skb);
615 }
616
617 return skb;
618 }
619
620 static inline struct sk_buff *qdisc_dequeue_head(struct Qdisc *sch)
621 {
622 return __qdisc_dequeue_head(sch, &sch->q);
623 }
624
625 static inline unsigned int __qdisc_queue_drop_head(struct Qdisc *sch,
626 struct sk_buff_head *list)
627 {
628 struct sk_buff *skb = __skb_dequeue(list);
629
630 if (likely(skb != NULL)) {
631 unsigned int len = qdisc_pkt_len(skb);
632 qdisc_qstats_backlog_dec(sch, skb);
633 kfree_skb(skb);
634 return len;
635 }
636
637 return 0;
638 }
639
640 static inline unsigned int qdisc_queue_drop_head(struct Qdisc *sch)
641 {
642 return __qdisc_queue_drop_head(sch, &sch->q);
643 }
644
645 static inline struct sk_buff *__qdisc_dequeue_tail(struct Qdisc *sch,
646 struct sk_buff_head *list)
647 {
648 struct sk_buff *skb = __skb_dequeue_tail(list);
649
650 if (likely(skb != NULL))
651 qdisc_qstats_backlog_dec(sch, skb);
652
653 return skb;
654 }
655
656 static inline struct sk_buff *qdisc_dequeue_tail(struct Qdisc *sch)
657 {
658 return __qdisc_dequeue_tail(sch, &sch->q);
659 }
660
661 static inline struct sk_buff *qdisc_peek_head(struct Qdisc *sch)
662 {
663 return skb_peek(&sch->q);
664 }
665
666 /* generic pseudo peek method for non-work-conserving qdisc */
667 static inline struct sk_buff *qdisc_peek_dequeued(struct Qdisc *sch)
668 {
669 /* we can reuse ->gso_skb because peek isn't called for root qdiscs */
670 if (!sch->gso_skb) {
671 sch->gso_skb = sch->dequeue(sch);
672 if (sch->gso_skb)
673 /* it's still part of the queue */
674 sch->q.qlen++;
675 }
676
677 return sch->gso_skb;
678 }
679
680 /* use instead of qdisc->dequeue() for all qdiscs queried with ->peek() */
681 static inline struct sk_buff *qdisc_dequeue_peeked(struct Qdisc *sch)
682 {
683 struct sk_buff *skb = sch->gso_skb;
684
685 if (skb) {
686 sch->gso_skb = NULL;
687 sch->q.qlen--;
688 } else {
689 skb = sch->dequeue(sch);
690 }
691
692 return skb;
693 }
694
695 static inline void __qdisc_reset_queue(struct Qdisc *sch,
696 struct sk_buff_head *list)
697 {
698 /*
699 * We do not know the backlog in bytes of this list, it
700 * is up to the caller to correct it
701 */
702 __skb_queue_purge(list);
703 }
704
705 static inline void qdisc_reset_queue(struct Qdisc *sch)
706 {
707 __qdisc_reset_queue(sch, &sch->q);
708 sch->qstats.backlog = 0;
709 }
710
711 static inline struct Qdisc *qdisc_replace(struct Qdisc *sch, struct Qdisc *new,
712 struct Qdisc **pold)
713 {
714 struct Qdisc *old;
715
716 sch_tree_lock(sch);
717 old = *pold;
718 *pold = new;
719 if (old != NULL) {
720 qdisc_tree_reduce_backlog(old, old->q.qlen, old->qstats.backlog);
721 qdisc_reset(old);
722 }
723 sch_tree_unlock(sch);
724
725 return old;
726 }
727
728 static inline unsigned int __qdisc_queue_drop(struct Qdisc *sch,
729 struct sk_buff_head *list)
730 {
731 struct sk_buff *skb = __qdisc_dequeue_tail(sch, list);
732
733 if (likely(skb != NULL)) {
734 unsigned int len = qdisc_pkt_len(skb);
735 kfree_skb(skb);
736 return len;
737 }
738
739 return 0;
740 }
741
742 static inline unsigned int qdisc_queue_drop(struct Qdisc *sch)
743 {
744 return __qdisc_queue_drop(sch, &sch->q);
745 }
746
747 static inline int qdisc_drop(struct sk_buff *skb, struct Qdisc *sch)
748 {
749 kfree_skb(skb);
750 qdisc_qstats_drop(sch);
751
752 return NET_XMIT_DROP;
753 }
754
755 static inline int qdisc_reshape_fail(struct sk_buff *skb, struct Qdisc *sch)
756 {
757 qdisc_qstats_drop(sch);
758
759 #ifdef CONFIG_NET_CLS_ACT
760 if (sch->reshape_fail == NULL || sch->reshape_fail(skb, sch))
761 goto drop;
762
763 return NET_XMIT_SUCCESS;
764
765 drop:
766 #endif
767 kfree_skb(skb);
768 return NET_XMIT_DROP;
769 }
770
771 /* Length to Time (L2T) lookup in a qdisc_rate_table, to determine how
772 long it will take to send a packet given its size.
773 */
774 static inline u32 qdisc_l2t(struct qdisc_rate_table* rtab, unsigned int pktlen)
775 {
776 int slot = pktlen + rtab->rate.cell_align + rtab->rate.overhead;
777 if (slot < 0)
778 slot = 0;
779 slot >>= rtab->rate.cell_log;
780 if (slot > 255)
781 return rtab->data[255]*(slot >> 8) + rtab->data[slot & 0xFF];
782 return rtab->data[slot];
783 }
784
785 struct psched_ratecfg {
786 u64 rate_bytes_ps; /* bytes per second */
787 u32 mult;
788 u16 overhead;
789 u8 linklayer;
790 u8 shift;
791 };
792
793 static inline u64 psched_l2t_ns(const struct psched_ratecfg *r,
794 unsigned int len)
795 {
796 len += r->overhead;
797
798 if (unlikely(r->linklayer == TC_LINKLAYER_ATM))
799 return ((u64)(DIV_ROUND_UP(len,48)*53) * r->mult) >> r->shift;
800
801 return ((u64)len * r->mult) >> r->shift;
802 }
803
804 void psched_ratecfg_precompute(struct psched_ratecfg *r,
805 const struct tc_ratespec *conf,
806 u64 rate64);
807
808 static inline void psched_ratecfg_getrate(struct tc_ratespec *res,
809 const struct psched_ratecfg *r)
810 {
811 memset(res, 0, sizeof(*res));
812
813 /* legacy struct tc_ratespec has a 32bit @rate field
814 * Qdisc using 64bit rate should add new attributes
815 * in order to maintain compatibility.
816 */
817 res->rate = min_t(u64, r->rate_bytes_ps, ~0U);
818
819 res->overhead = r->overhead;
820 res->linklayer = (r->linklayer & TC_LINKLAYER_MASK);
821 }
822
823 #endif
This page took 0.06282 seconds and 5 git commands to generate.