2 * net/sched/sch_htb.c Hierarchical token bucket, feed tree version
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
9 * Authors: Martin Devera, <devik@cdi.cz>
11 * Credits (in time order) for older HTB versions:
12 * Stef Coene <stef.coene@docum.org>
13 * HTB support at LARTC mailing list
14 * Ondrej Kraus, <krauso@barr.cz>
15 * found missing INIT_QDISC(htb)
16 * Vladimir Smelhaus, Aamer Akhter, Bert Hubert
17 * helped a lot to locate nasty class stall bug
18 * Andi Kleen, Jamal Hadi, Bert Hubert
19 * code review and helpful comments on shaping
20 * Tomasz Wrona, <tw@eter.tym.pl>
21 * created test case so that I was able to fix nasty bug
23 * spotted bug in dequeue code and helped with fix
25 * fixed requeue routine
26 * and many others. thanks.
28 #include <linux/module.h>
29 #include <linux/moduleparam.h>
30 #include <linux/types.h>
31 #include <linux/kernel.h>
32 #include <linux/string.h>
33 #include <linux/errno.h>
34 #include <linux/skbuff.h>
35 #include <linux/list.h>
36 #include <linux/compiler.h>
37 #include <linux/rbtree.h>
38 #include <net/netlink.h>
39 #include <net/pkt_sched.h>
43 ========================================================================
44 HTB is like TBF with multiple classes. It is also similar to CBQ because
45 it allows to assign priority to each class in hierarchy.
46 In fact it is another implementation of Floyd's formal sharing.
49 Each class is assigned level. Leaf has ALWAYS level 0 and root
50 classes have level TC_HTB_MAXDEPTH-1. Interior nodes has level
51 one less than their parent.
54 static int htb_hysteresis __read_mostly
= 0; /* whether to use mode hysteresis for speedup */
55 #define HTB_VER 0x30011 /* major must be matched with number suplied by TC as version */
57 #if HTB_VER >> 16 != TC_HTB_PROTOVER
58 #error "Mismatched sch_htb.c and pkt_sch.h"
61 /* Module parameter and sysfs export */
62 module_param (htb_hysteresis
, int, 0640);
63 MODULE_PARM_DESC(htb_hysteresis
, "Hysteresis mode, less CPU load, less accurate");
65 /* used internaly to keep status of single class */
67 HTB_CANT_SEND
, /* class can't send and can't borrow */
68 HTB_MAY_BORROW
, /* class can't send but may borrow */
69 HTB_CAN_SEND
/* class can send */
72 /* interior & leaf nodes; props specific to leaves are marked L: */
74 struct Qdisc_class_common common
;
75 /* general class parameters */
76 struct gnet_stats_basic bstats
;
77 struct gnet_stats_queue qstats
;
78 struct gnet_stats_rate_est rate_est
;
79 struct tc_htb_xstats xstats
; /* our special stats */
80 int refcnt
; /* usage count of this class */
83 int level
; /* our level (see above) */
84 unsigned int children
;
85 struct htb_class
*parent
; /* parent class */
87 int prio
; /* these two are used only by leaves... */
88 int quantum
; /* but stored for parent-to-leaf return */
91 struct htb_class_leaf
{
93 int deficit
[TC_HTB_MAXDEPTH
];
94 struct list_head drop_list
;
96 struct htb_class_inner
{
97 struct rb_root feed
[TC_HTB_NUMPRIO
]; /* feed trees */
98 struct rb_node
*ptr
[TC_HTB_NUMPRIO
]; /* current class ptr */
99 /* When class changes from state 1->2 and disconnects from
100 parent's feed then we lost ptr value and start from the
101 first child again. Here we store classid of the
102 last valid ptr (used when ptr is NULL). */
103 u32 last_ptr_id
[TC_HTB_NUMPRIO
];
106 struct rb_node node
[TC_HTB_NUMPRIO
]; /* node for self or feed tree */
107 struct rb_node pq_node
; /* node for event queue */
108 psched_time_t pq_key
;
110 int prio_activity
; /* for which prios are we active */
111 enum htb_cmode cmode
; /* current mode of the class */
113 /* class attached filters */
114 struct tcf_proto
*filter_list
;
117 int warned
; /* only one warning about non work conserving .. */
119 /* token bucket parameters */
120 struct qdisc_rate_table
*rate
; /* rate table of the class itself */
121 struct qdisc_rate_table
*ceil
; /* ceiling rate (limits borrows too) */
122 long buffer
, cbuffer
; /* token bucket depth/rate */
123 psched_tdiff_t mbuffer
; /* max wait time */
124 long tokens
, ctokens
; /* current number of tokens */
125 psched_time_t t_c
; /* checkpoint time */
129 struct Qdisc_class_hash clhash
;
130 struct list_head drops
[TC_HTB_NUMPRIO
];/* active leaves (for drops) */
132 /* self list - roots of self generating tree */
133 struct rb_root row
[TC_HTB_MAXDEPTH
][TC_HTB_NUMPRIO
];
134 int row_mask
[TC_HTB_MAXDEPTH
];
135 struct rb_node
*ptr
[TC_HTB_MAXDEPTH
][TC_HTB_NUMPRIO
];
136 u32 last_ptr_id
[TC_HTB_MAXDEPTH
][TC_HTB_NUMPRIO
];
138 /* self wait list - roots of wait PQs per row */
139 struct rb_root wait_pq
[TC_HTB_MAXDEPTH
];
141 /* time of nearest event per level (row) */
142 psched_time_t near_ev_cache
[TC_HTB_MAXDEPTH
];
144 int defcls
; /* class where unclassified flows go to */
146 /* filters for qdisc itself */
147 struct tcf_proto
*filter_list
;
149 int rate2quantum
; /* quant = rate / rate2quantum */
150 psched_time_t now
; /* cached dequeue time */
151 struct qdisc_watchdog watchdog
;
153 /* non shaped skbs; let them go directly thru */
154 struct sk_buff_head direct_queue
;
155 int direct_qlen
; /* max qlen of above */
160 /* find class in global hash table using given handle */
161 static inline struct htb_class
*htb_find(u32 handle
, struct Qdisc
*sch
)
163 struct htb_sched
*q
= qdisc_priv(sch
);
164 struct Qdisc_class_common
*clc
;
166 clc
= qdisc_class_find(&q
->clhash
, handle
);
169 return container_of(clc
, struct htb_class
, common
);
173 * htb_classify - classify a packet into class
175 * It returns NULL if the packet should be dropped or -1 if the packet
176 * should be passed directly thru. In all other cases leaf class is returned.
177 * We allow direct class selection by classid in priority. The we examine
178 * filters in qdisc and in inner nodes (if higher filter points to the inner
179 * node). If we end up with classid MAJOR:0 we enqueue the skb into special
180 * internal fifo (direct). These packets then go directly thru. If we still
181 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessfull
182 * then finish and return direct queue.
184 #define HTB_DIRECT (struct htb_class*)-1
186 static struct htb_class
*htb_classify(struct sk_buff
*skb
, struct Qdisc
*sch
,
189 struct htb_sched
*q
= qdisc_priv(sch
);
190 struct htb_class
*cl
;
191 struct tcf_result res
;
192 struct tcf_proto
*tcf
;
195 /* allow to select class by setting skb->priority to valid classid;
196 note that nfmark can be used too by attaching filter fw with no
198 if (skb
->priority
== sch
->handle
)
199 return HTB_DIRECT
; /* X:0 (direct flow) selected */
200 if ((cl
= htb_find(skb
->priority
, sch
)) != NULL
&& cl
->level
== 0)
203 *qerr
= NET_XMIT_SUCCESS
| __NET_XMIT_BYPASS
;
204 tcf
= q
->filter_list
;
205 while (tcf
&& (result
= tc_classify(skb
, tcf
, &res
)) >= 0) {
206 #ifdef CONFIG_NET_CLS_ACT
210 *qerr
= NET_XMIT_SUCCESS
| __NET_XMIT_STOLEN
;
215 if ((cl
= (void *)res
.class) == NULL
) {
216 if (res
.classid
== sch
->handle
)
217 return HTB_DIRECT
; /* X:0 (direct flow) */
218 if ((cl
= htb_find(res
.classid
, sch
)) == NULL
)
219 break; /* filter selected invalid classid */
222 return cl
; /* we hit leaf; return it */
224 /* we have got inner class; apply inner filter chain */
225 tcf
= cl
->filter_list
;
227 /* classification failed; try to use default class */
228 cl
= htb_find(TC_H_MAKE(TC_H_MAJ(sch
->handle
), q
->defcls
), sch
);
229 if (!cl
|| cl
->level
)
230 return HTB_DIRECT
; /* bad default .. this is safe bet */
235 * htb_add_to_id_tree - adds class to the round robin list
237 * Routine adds class to the list (actually tree) sorted by classid.
238 * Make sure that class is not already on such list for given prio.
240 static void htb_add_to_id_tree(struct rb_root
*root
,
241 struct htb_class
*cl
, int prio
)
243 struct rb_node
**p
= &root
->rb_node
, *parent
= NULL
;
248 c
= rb_entry(parent
, struct htb_class
, node
[prio
]);
250 if (cl
->common
.classid
> c
->common
.classid
)
251 p
= &parent
->rb_right
;
253 p
= &parent
->rb_left
;
255 rb_link_node(&cl
->node
[prio
], parent
, p
);
256 rb_insert_color(&cl
->node
[prio
], root
);
260 * htb_add_to_wait_tree - adds class to the event queue with delay
262 * The class is added to priority event queue to indicate that class will
263 * change its mode in cl->pq_key microseconds. Make sure that class is not
264 * already in the queue.
266 static void htb_add_to_wait_tree(struct htb_sched
*q
,
267 struct htb_class
*cl
, long delay
)
269 struct rb_node
**p
= &q
->wait_pq
[cl
->level
].rb_node
, *parent
= NULL
;
271 cl
->pq_key
= q
->now
+ delay
;
272 if (cl
->pq_key
== q
->now
)
275 /* update the nearest event cache */
276 if (q
->near_ev_cache
[cl
->level
] > cl
->pq_key
)
277 q
->near_ev_cache
[cl
->level
] = cl
->pq_key
;
282 c
= rb_entry(parent
, struct htb_class
, pq_node
);
283 if (cl
->pq_key
>= c
->pq_key
)
284 p
= &parent
->rb_right
;
286 p
= &parent
->rb_left
;
288 rb_link_node(&cl
->pq_node
, parent
, p
);
289 rb_insert_color(&cl
->pq_node
, &q
->wait_pq
[cl
->level
]);
293 * htb_next_rb_node - finds next node in binary tree
295 * When we are past last key we return NULL.
296 * Average complexity is 2 steps per call.
298 static inline void htb_next_rb_node(struct rb_node
**n
)
304 * htb_add_class_to_row - add class to its row
306 * The class is added to row at priorities marked in mask.
307 * It does nothing if mask == 0.
309 static inline void htb_add_class_to_row(struct htb_sched
*q
,
310 struct htb_class
*cl
, int mask
)
312 q
->row_mask
[cl
->level
] |= mask
;
314 int prio
= ffz(~mask
);
315 mask
&= ~(1 << prio
);
316 htb_add_to_id_tree(q
->row
[cl
->level
] + prio
, cl
, prio
);
320 /* If this triggers, it is a bug in this code, but it need not be fatal */
321 static void htb_safe_rb_erase(struct rb_node
*rb
, struct rb_root
*root
)
323 if (RB_EMPTY_NODE(rb
)) {
333 * htb_remove_class_from_row - removes class from its row
335 * The class is removed from row at priorities marked in mask.
336 * It does nothing if mask == 0.
338 static inline void htb_remove_class_from_row(struct htb_sched
*q
,
339 struct htb_class
*cl
, int mask
)
344 int prio
= ffz(~mask
);
346 mask
&= ~(1 << prio
);
347 if (q
->ptr
[cl
->level
][prio
] == cl
->node
+ prio
)
348 htb_next_rb_node(q
->ptr
[cl
->level
] + prio
);
350 htb_safe_rb_erase(cl
->node
+ prio
, q
->row
[cl
->level
] + prio
);
351 if (!q
->row
[cl
->level
][prio
].rb_node
)
354 q
->row_mask
[cl
->level
] &= ~m
;
358 * htb_activate_prios - creates active classe's feed chain
360 * The class is connected to ancestors and/or appropriate rows
361 * for priorities it is participating on. cl->cmode must be new
362 * (activated) mode. It does nothing if cl->prio_activity == 0.
364 static void htb_activate_prios(struct htb_sched
*q
, struct htb_class
*cl
)
366 struct htb_class
*p
= cl
->parent
;
367 long m
, mask
= cl
->prio_activity
;
369 while (cl
->cmode
== HTB_MAY_BORROW
&& p
&& mask
) {
375 if (p
->un
.inner
.feed
[prio
].rb_node
)
376 /* parent already has its feed in use so that
377 reset bit in mask as parent is already ok */
378 mask
&= ~(1 << prio
);
380 htb_add_to_id_tree(p
->un
.inner
.feed
+ prio
, cl
, prio
);
382 p
->prio_activity
|= mask
;
387 if (cl
->cmode
== HTB_CAN_SEND
&& mask
)
388 htb_add_class_to_row(q
, cl
, mask
);
392 * htb_deactivate_prios - remove class from feed chain
394 * cl->cmode must represent old mode (before deactivation). It does
395 * nothing if cl->prio_activity == 0. Class is removed from all feed
398 static void htb_deactivate_prios(struct htb_sched
*q
, struct htb_class
*cl
)
400 struct htb_class
*p
= cl
->parent
;
401 long m
, mask
= cl
->prio_activity
;
403 while (cl
->cmode
== HTB_MAY_BORROW
&& p
&& mask
) {
410 if (p
->un
.inner
.ptr
[prio
] == cl
->node
+ prio
) {
411 /* we are removing child which is pointed to from
412 parent feed - forget the pointer but remember
414 p
->un
.inner
.last_ptr_id
[prio
] = cl
->common
.classid
;
415 p
->un
.inner
.ptr
[prio
] = NULL
;
418 htb_safe_rb_erase(cl
->node
+ prio
, p
->un
.inner
.feed
+ prio
);
420 if (!p
->un
.inner
.feed
[prio
].rb_node
)
424 p
->prio_activity
&= ~mask
;
429 if (cl
->cmode
== HTB_CAN_SEND
&& mask
)
430 htb_remove_class_from_row(q
, cl
, mask
);
433 static inline long htb_lowater(const struct htb_class
*cl
)
436 return cl
->cmode
!= HTB_CANT_SEND
? -cl
->cbuffer
: 0;
440 static inline long htb_hiwater(const struct htb_class
*cl
)
443 return cl
->cmode
== HTB_CAN_SEND
? -cl
->buffer
: 0;
450 * htb_class_mode - computes and returns current class mode
452 * It computes cl's mode at time cl->t_c+diff and returns it. If mode
453 * is not HTB_CAN_SEND then cl->pq_key is updated to time difference
454 * from now to time when cl will change its state.
455 * Also it is worth to note that class mode doesn't change simply
456 * at cl->{c,}tokens == 0 but there can rather be hysteresis of
457 * 0 .. -cl->{c,}buffer range. It is meant to limit number of
458 * mode transitions per time unit. The speed gain is about 1/6.
460 static inline enum htb_cmode
461 htb_class_mode(struct htb_class
*cl
, long *diff
)
465 if ((toks
= (cl
->ctokens
+ *diff
)) < htb_lowater(cl
)) {
467 return HTB_CANT_SEND
;
470 if ((toks
= (cl
->tokens
+ *diff
)) >= htb_hiwater(cl
))
474 return HTB_MAY_BORROW
;
478 * htb_change_class_mode - changes classe's mode
480 * This should be the only way how to change classe's mode under normal
481 * cirsumstances. Routine will update feed lists linkage, change mode
482 * and add class to the wait event queue if appropriate. New mode should
483 * be different from old one and cl->pq_key has to be valid if changing
484 * to mode other than HTB_CAN_SEND (see htb_add_to_wait_tree).
487 htb_change_class_mode(struct htb_sched
*q
, struct htb_class
*cl
, long *diff
)
489 enum htb_cmode new_mode
= htb_class_mode(cl
, diff
);
491 if (new_mode
== cl
->cmode
)
494 if (cl
->prio_activity
) { /* not necessary: speed optimization */
495 if (cl
->cmode
!= HTB_CANT_SEND
)
496 htb_deactivate_prios(q
, cl
);
497 cl
->cmode
= new_mode
;
498 if (new_mode
!= HTB_CANT_SEND
)
499 htb_activate_prios(q
, cl
);
501 cl
->cmode
= new_mode
;
505 * htb_activate - inserts leaf cl into appropriate active feeds
507 * Routine learns (new) priority of leaf and activates feed chain
508 * for the prio. It can be called on already active leaf safely.
509 * It also adds leaf into droplist.
511 static inline void htb_activate(struct htb_sched
*q
, struct htb_class
*cl
)
513 WARN_ON(cl
->level
|| !cl
->un
.leaf
.q
|| !cl
->un
.leaf
.q
->q
.qlen
);
515 if (!cl
->prio_activity
) {
516 cl
->prio_activity
= 1 << cl
->prio
;
517 htb_activate_prios(q
, cl
);
518 list_add_tail(&cl
->un
.leaf
.drop_list
,
519 q
->drops
+ cl
->prio
);
524 * htb_deactivate - remove leaf cl from active feeds
526 * Make sure that leaf is active. In the other words it can't be called
527 * with non-active leaf. It also removes class from the drop list.
529 static inline void htb_deactivate(struct htb_sched
*q
, struct htb_class
*cl
)
531 WARN_ON(!cl
->prio_activity
);
533 htb_deactivate_prios(q
, cl
);
534 cl
->prio_activity
= 0;
535 list_del_init(&cl
->un
.leaf
.drop_list
);
538 static int htb_enqueue(struct sk_buff
*skb
, struct Qdisc
*sch
)
540 int uninitialized_var(ret
);
541 struct htb_sched
*q
= qdisc_priv(sch
);
542 struct htb_class
*cl
= htb_classify(skb
, sch
, &ret
);
544 if (cl
== HTB_DIRECT
) {
545 /* enqueue to helper queue */
546 if (q
->direct_queue
.qlen
< q
->direct_qlen
) {
547 __skb_queue_tail(&q
->direct_queue
, skb
);
552 return NET_XMIT_DROP
;
554 #ifdef CONFIG_NET_CLS_ACT
556 if (ret
& __NET_XMIT_BYPASS
)
561 } else if ((ret
= qdisc_enqueue(skb
, cl
->un
.leaf
.q
)) != NET_XMIT_SUCCESS
) {
562 if (net_xmit_drop_count(ret
)) {
568 cl
->bstats
.packets
+=
569 skb_is_gso(skb
)?skb_shinfo(skb
)->gso_segs
:1;
570 cl
->bstats
.bytes
+= qdisc_pkt_len(skb
);
575 sch
->bstats
.packets
+= skb_is_gso(skb
)?skb_shinfo(skb
)->gso_segs
:1;
576 sch
->bstats
.bytes
+= qdisc_pkt_len(skb
);
577 return NET_XMIT_SUCCESS
;
581 * htb_charge_class - charges amount "bytes" to leaf and ancestors
583 * Routine assumes that packet "bytes" long was dequeued from leaf cl
584 * borrowing from "level". It accounts bytes to ceil leaky bucket for
585 * leaf and all ancestors and to rate bucket for ancestors at levels
586 * "level" and higher. It also handles possible change of mode resulting
587 * from the update. Note that mode can also increase here (MAY_BORROW to
588 * CAN_SEND) because we can use more precise clock that event queue here.
589 * In such case we remove class from event queue first.
591 static void htb_charge_class(struct htb_sched
*q
, struct htb_class
*cl
,
592 int level
, struct sk_buff
*skb
)
594 int bytes
= qdisc_pkt_len(skb
);
596 enum htb_cmode old_mode
;
598 #define HTB_ACCNT(T,B,R) toks = diff + cl->T; \
599 if (toks > cl->B) toks = cl->B; \
600 toks -= (long) qdisc_l2t(cl->R, bytes); \
601 if (toks <= -cl->mbuffer) toks = 1-cl->mbuffer; \
605 diff
= psched_tdiff_bounded(q
->now
, cl
->t_c
, cl
->mbuffer
);
606 if (cl
->level
>= level
) {
607 if (cl
->level
== level
)
609 HTB_ACCNT(tokens
, buffer
, rate
);
611 cl
->xstats
.borrows
++;
612 cl
->tokens
+= diff
; /* we moved t_c; update tokens */
614 HTB_ACCNT(ctokens
, cbuffer
, ceil
);
617 old_mode
= cl
->cmode
;
619 htb_change_class_mode(q
, cl
, &diff
);
620 if (old_mode
!= cl
->cmode
) {
621 if (old_mode
!= HTB_CAN_SEND
)
622 htb_safe_rb_erase(&cl
->pq_node
, q
->wait_pq
+ cl
->level
);
623 if (cl
->cmode
!= HTB_CAN_SEND
)
624 htb_add_to_wait_tree(q
, cl
, diff
);
627 /* update byte stats except for leaves which are already updated */
629 cl
->bstats
.bytes
+= bytes
;
630 cl
->bstats
.packets
+= skb_is_gso(skb
)?
631 skb_shinfo(skb
)->gso_segs
:1;
638 * htb_do_events - make mode changes to classes at the level
640 * Scans event queue for pending events and applies them. Returns time of
641 * next pending event (0 for no event in pq).
642 * Note: Applied are events whose have cl->pq_key <= q->now.
644 static psched_time_t
htb_do_events(struct htb_sched
*q
, int level
)
646 /* don't run for longer than 2 jiffies; 2 is used instead of
647 1 to simplify things when jiffy is going to be incremented
649 unsigned long stop_at
= jiffies
+ 2;
650 while (time_before(jiffies
, stop_at
)) {
651 struct htb_class
*cl
;
653 struct rb_node
*p
= rb_first(&q
->wait_pq
[level
]);
658 cl
= rb_entry(p
, struct htb_class
, pq_node
);
659 if (cl
->pq_key
> q
->now
)
662 htb_safe_rb_erase(p
, q
->wait_pq
+ level
);
663 diff
= psched_tdiff_bounded(q
->now
, cl
->t_c
, cl
->mbuffer
);
664 htb_change_class_mode(q
, cl
, &diff
);
665 if (cl
->cmode
!= HTB_CAN_SEND
)
666 htb_add_to_wait_tree(q
, cl
, diff
);
668 /* too much load - let's continue on next jiffie */
669 return q
->now
+ PSCHED_TICKS_PER_SEC
/ HZ
;
672 /* Returns class->node+prio from id-tree where classe's id is >= id. NULL
673 is no such one exists. */
674 static struct rb_node
*htb_id_find_next_upper(int prio
, struct rb_node
*n
,
677 struct rb_node
*r
= NULL
;
679 struct htb_class
*cl
=
680 rb_entry(n
, struct htb_class
, node
[prio
]);
681 if (id
== cl
->common
.classid
)
684 if (id
> cl
->common
.classid
) {
695 * htb_lookup_leaf - returns next leaf class in DRR order
697 * Find leaf where current feed pointers points to.
699 static struct htb_class
*htb_lookup_leaf(struct rb_root
*tree
, int prio
,
700 struct rb_node
**pptr
, u32
* pid
)
704 struct rb_node
*root
;
705 struct rb_node
**pptr
;
707 } stk
[TC_HTB_MAXDEPTH
], *sp
= stk
;
709 WARN_ON(!tree
->rb_node
);
710 sp
->root
= tree
->rb_node
;
714 for (i
= 0; i
< 65535; i
++) {
715 if (!*sp
->pptr
&& *sp
->pid
) {
716 /* ptr was invalidated but id is valid - try to recover
717 the original or next ptr */
719 htb_id_find_next_upper(prio
, sp
->root
, *sp
->pid
);
721 *sp
->pid
= 0; /* ptr is valid now so that remove this hint as it
722 can become out of date quickly */
723 if (!*sp
->pptr
) { /* we are at right end; rewind & go up */
724 *sp
->pptr
= sp
->root
;
725 while ((*sp
->pptr
)->rb_left
)
726 *sp
->pptr
= (*sp
->pptr
)->rb_left
;
732 htb_next_rb_node(sp
->pptr
);
735 struct htb_class
*cl
;
736 cl
= rb_entry(*sp
->pptr
, struct htb_class
, node
[prio
]);
739 (++sp
)->root
= cl
->un
.inner
.feed
[prio
].rb_node
;
740 sp
->pptr
= cl
->un
.inner
.ptr
+ prio
;
741 sp
->pid
= cl
->un
.inner
.last_ptr_id
+ prio
;
748 /* dequeues packet at given priority and level; call only if
749 you are sure that there is active class at prio/level */
750 static struct sk_buff
*htb_dequeue_tree(struct htb_sched
*q
, int prio
,
753 struct sk_buff
*skb
= NULL
;
754 struct htb_class
*cl
, *start
;
755 /* look initial class up in the row */
756 start
= cl
= htb_lookup_leaf(q
->row
[level
] + prio
, prio
,
757 q
->ptr
[level
] + prio
,
758 q
->last_ptr_id
[level
] + prio
);
766 /* class can be empty - it is unlikely but can be true if leaf
767 qdisc drops packets in enqueue routine or if someone used
768 graft operation on the leaf since last dequeue;
769 simply deactivate and skip such class */
770 if (unlikely(cl
->un
.leaf
.q
->q
.qlen
== 0)) {
771 struct htb_class
*next
;
772 htb_deactivate(q
, cl
);
774 /* row/level might become empty */
775 if ((q
->row_mask
[level
] & (1 << prio
)) == 0)
778 next
= htb_lookup_leaf(q
->row
[level
] + prio
,
779 prio
, q
->ptr
[level
] + prio
,
780 q
->last_ptr_id
[level
] + prio
);
782 if (cl
== start
) /* fix start if we just deleted it */
788 skb
= cl
->un
.leaf
.q
->dequeue(cl
->un
.leaf
.q
);
789 if (likely(skb
!= NULL
))
793 "htb: class %X isn't work conserving ?!\n",
798 htb_next_rb_node((level
? cl
->parent
->un
.inner
.ptr
: q
->
800 cl
= htb_lookup_leaf(q
->row
[level
] + prio
, prio
,
801 q
->ptr
[level
] + prio
,
802 q
->last_ptr_id
[level
] + prio
);
804 } while (cl
!= start
);
806 if (likely(skb
!= NULL
)) {
807 cl
->un
.leaf
.deficit
[level
] -= qdisc_pkt_len(skb
);
808 if (cl
->un
.leaf
.deficit
[level
] < 0) {
809 cl
->un
.leaf
.deficit
[level
] += cl
->quantum
;
810 htb_next_rb_node((level
? cl
->parent
->un
.inner
.ptr
: q
->
813 /* this used to be after charge_class but this constelation
814 gives us slightly better performance */
815 if (!cl
->un
.leaf
.q
->q
.qlen
)
816 htb_deactivate(q
, cl
);
817 htb_charge_class(q
, cl
, level
, skb
);
822 static struct sk_buff
*htb_dequeue(struct Qdisc
*sch
)
824 struct sk_buff
*skb
= NULL
;
825 struct htb_sched
*q
= qdisc_priv(sch
);
827 psched_time_t next_event
;
829 /* try to dequeue direct packets as high prio (!) to minimize cpu work */
830 skb
= __skb_dequeue(&q
->direct_queue
);
832 sch
->flags
&= ~TCQ_F_THROTTLED
;
839 q
->now
= psched_get_time();
841 next_event
= q
->now
+ 5 * PSCHED_TICKS_PER_SEC
;
843 for (level
= 0; level
< TC_HTB_MAXDEPTH
; level
++) {
844 /* common case optimization - skip event handler quickly */
848 if (q
->now
>= q
->near_ev_cache
[level
]) {
849 event
= htb_do_events(q
, level
);
851 event
= q
->now
+ PSCHED_TICKS_PER_SEC
;
852 q
->near_ev_cache
[level
] = event
;
854 event
= q
->near_ev_cache
[level
];
856 if (event
&& next_event
> event
)
859 m
= ~q
->row_mask
[level
];
860 while (m
!= (int)(-1)) {
863 skb
= htb_dequeue_tree(q
, prio
, level
);
864 if (likely(skb
!= NULL
)) {
866 sch
->flags
&= ~TCQ_F_THROTTLED
;
871 sch
->qstats
.overlimits
++;
872 qdisc_watchdog_schedule(&q
->watchdog
, next_event
);
877 /* try to drop from each class (by prio) until one succeed */
878 static unsigned int htb_drop(struct Qdisc
*sch
)
880 struct htb_sched
*q
= qdisc_priv(sch
);
883 for (prio
= TC_HTB_NUMPRIO
- 1; prio
>= 0; prio
--) {
885 list_for_each(p
, q
->drops
+ prio
) {
886 struct htb_class
*cl
= list_entry(p
, struct htb_class
,
889 if (cl
->un
.leaf
.q
->ops
->drop
&&
890 (len
= cl
->un
.leaf
.q
->ops
->drop(cl
->un
.leaf
.q
))) {
892 if (!cl
->un
.leaf
.q
->q
.qlen
)
893 htb_deactivate(q
, cl
);
901 /* reset all classes */
902 /* always caled under BH & queue lock */
903 static void htb_reset(struct Qdisc
*sch
)
905 struct htb_sched
*q
= qdisc_priv(sch
);
906 struct htb_class
*cl
;
907 struct hlist_node
*n
;
910 for (i
= 0; i
< q
->clhash
.hashsize
; i
++) {
911 hlist_for_each_entry(cl
, n
, &q
->clhash
.hash
[i
], common
.hnode
) {
913 memset(&cl
->un
.inner
, 0, sizeof(cl
->un
.inner
));
916 qdisc_reset(cl
->un
.leaf
.q
);
917 INIT_LIST_HEAD(&cl
->un
.leaf
.drop_list
);
919 cl
->prio_activity
= 0;
920 cl
->cmode
= HTB_CAN_SEND
;
924 qdisc_watchdog_cancel(&q
->watchdog
);
925 __skb_queue_purge(&q
->direct_queue
);
927 memset(q
->row
, 0, sizeof(q
->row
));
928 memset(q
->row_mask
, 0, sizeof(q
->row_mask
));
929 memset(q
->wait_pq
, 0, sizeof(q
->wait_pq
));
930 memset(q
->ptr
, 0, sizeof(q
->ptr
));
931 for (i
= 0; i
< TC_HTB_NUMPRIO
; i
++)
932 INIT_LIST_HEAD(q
->drops
+ i
);
935 static const struct nla_policy htb_policy
[TCA_HTB_MAX
+ 1] = {
936 [TCA_HTB_PARMS
] = { .len
= sizeof(struct tc_htb_opt
) },
937 [TCA_HTB_INIT
] = { .len
= sizeof(struct tc_htb_glob
) },
938 [TCA_HTB_CTAB
] = { .type
= NLA_BINARY
, .len
= TC_RTAB_SIZE
},
939 [TCA_HTB_RTAB
] = { .type
= NLA_BINARY
, .len
= TC_RTAB_SIZE
},
942 static int htb_init(struct Qdisc
*sch
, struct nlattr
*opt
)
944 struct htb_sched
*q
= qdisc_priv(sch
);
945 struct nlattr
*tb
[TCA_HTB_INIT
+ 1];
946 struct tc_htb_glob
*gopt
;
953 err
= nla_parse_nested(tb
, TCA_HTB_INIT
, opt
, htb_policy
);
957 if (tb
[TCA_HTB_INIT
] == NULL
) {
958 printk(KERN_ERR
"HTB: hey probably you have bad tc tool ?\n");
961 gopt
= nla_data(tb
[TCA_HTB_INIT
]);
962 if (gopt
->version
!= HTB_VER
>> 16) {
964 "HTB: need tc/htb version %d (minor is %d), you have %d\n",
965 HTB_VER
>> 16, HTB_VER
& 0xffff, gopt
->version
);
969 err
= qdisc_class_hash_init(&q
->clhash
);
972 for (i
= 0; i
< TC_HTB_NUMPRIO
; i
++)
973 INIT_LIST_HEAD(q
->drops
+ i
);
975 qdisc_watchdog_init(&q
->watchdog
, sch
);
976 skb_queue_head_init(&q
->direct_queue
);
978 q
->direct_qlen
= qdisc_dev(sch
)->tx_queue_len
;
979 if (q
->direct_qlen
< 2) /* some devices have zero tx_queue_len */
982 if ((q
->rate2quantum
= gopt
->rate2quantum
) < 1)
984 q
->defcls
= gopt
->defcls
;
989 static int htb_dump(struct Qdisc
*sch
, struct sk_buff
*skb
)
991 spinlock_t
*root_lock
= qdisc_root_sleeping_lock(sch
);
992 struct htb_sched
*q
= qdisc_priv(sch
);
994 struct tc_htb_glob gopt
;
996 spin_lock_bh(root_lock
);
998 gopt
.direct_pkts
= q
->direct_pkts
;
999 gopt
.version
= HTB_VER
;
1000 gopt
.rate2quantum
= q
->rate2quantum
;
1001 gopt
.defcls
= q
->defcls
;
1004 nest
= nla_nest_start(skb
, TCA_OPTIONS
);
1006 goto nla_put_failure
;
1007 NLA_PUT(skb
, TCA_HTB_INIT
, sizeof(gopt
), &gopt
);
1008 nla_nest_end(skb
, nest
);
1010 spin_unlock_bh(root_lock
);
1014 spin_unlock_bh(root_lock
);
1015 nla_nest_cancel(skb
, nest
);
1019 static int htb_dump_class(struct Qdisc
*sch
, unsigned long arg
,
1020 struct sk_buff
*skb
, struct tcmsg
*tcm
)
1022 struct htb_class
*cl
= (struct htb_class
*)arg
;
1023 spinlock_t
*root_lock
= qdisc_root_sleeping_lock(sch
);
1024 struct nlattr
*nest
;
1025 struct tc_htb_opt opt
;
1027 spin_lock_bh(root_lock
);
1028 tcm
->tcm_parent
= cl
->parent
? cl
->parent
->common
.classid
: TC_H_ROOT
;
1029 tcm
->tcm_handle
= cl
->common
.classid
;
1030 if (!cl
->level
&& cl
->un
.leaf
.q
)
1031 tcm
->tcm_info
= cl
->un
.leaf
.q
->handle
;
1033 nest
= nla_nest_start(skb
, TCA_OPTIONS
);
1035 goto nla_put_failure
;
1037 memset(&opt
, 0, sizeof(opt
));
1039 opt
.rate
= cl
->rate
->rate
;
1040 opt
.buffer
= cl
->buffer
;
1041 opt
.ceil
= cl
->ceil
->rate
;
1042 opt
.cbuffer
= cl
->cbuffer
;
1043 opt
.quantum
= cl
->quantum
;
1044 opt
.prio
= cl
->prio
;
1045 opt
.level
= cl
->level
;
1046 NLA_PUT(skb
, TCA_HTB_PARMS
, sizeof(opt
), &opt
);
1048 nla_nest_end(skb
, nest
);
1049 spin_unlock_bh(root_lock
);
1053 spin_unlock_bh(root_lock
);
1054 nla_nest_cancel(skb
, nest
);
1059 htb_dump_class_stats(struct Qdisc
*sch
, unsigned long arg
, struct gnet_dump
*d
)
1061 struct htb_class
*cl
= (struct htb_class
*)arg
;
1063 if (!cl
->level
&& cl
->un
.leaf
.q
)
1064 cl
->qstats
.qlen
= cl
->un
.leaf
.q
->q
.qlen
;
1065 cl
->xstats
.tokens
= cl
->tokens
;
1066 cl
->xstats
.ctokens
= cl
->ctokens
;
1068 if (gnet_stats_copy_basic(d
, &cl
->bstats
) < 0 ||
1069 gnet_stats_copy_rate_est(d
, &cl
->rate_est
) < 0 ||
1070 gnet_stats_copy_queue(d
, &cl
->qstats
) < 0)
1073 return gnet_stats_copy_app(d
, &cl
->xstats
, sizeof(cl
->xstats
));
1076 static int htb_graft(struct Qdisc
*sch
, unsigned long arg
, struct Qdisc
*new,
1079 struct htb_class
*cl
= (struct htb_class
*)arg
;
1081 if (cl
&& !cl
->level
) {
1083 (new = qdisc_create_dflt(qdisc_dev(sch
), sch
->dev_queue
,
1085 cl
->common
.classid
))
1089 *old
= cl
->un
.leaf
.q
;
1090 cl
->un
.leaf
.q
= new;
1092 qdisc_tree_decrease_qlen(*old
, (*old
)->q
.qlen
);
1095 sch_tree_unlock(sch
);
1101 static struct Qdisc
*htb_leaf(struct Qdisc
*sch
, unsigned long arg
)
1103 struct htb_class
*cl
= (struct htb_class
*)arg
;
1104 return (cl
&& !cl
->level
) ? cl
->un
.leaf
.q
: NULL
;
1107 static void htb_qlen_notify(struct Qdisc
*sch
, unsigned long arg
)
1109 struct htb_class
*cl
= (struct htb_class
*)arg
;
1111 if (cl
->un
.leaf
.q
->q
.qlen
== 0)
1112 htb_deactivate(qdisc_priv(sch
), cl
);
1115 static unsigned long htb_get(struct Qdisc
*sch
, u32 classid
)
1117 struct htb_class
*cl
= htb_find(classid
, sch
);
1120 return (unsigned long)cl
;
1123 static inline int htb_parent_last_child(struct htb_class
*cl
)
1126 /* the root class */
1128 if (cl
->parent
->children
> 1)
1129 /* not the last child */
1134 static void htb_parent_to_leaf(struct htb_sched
*q
, struct htb_class
*cl
,
1135 struct Qdisc
*new_q
)
1137 struct htb_class
*parent
= cl
->parent
;
1139 WARN_ON(cl
->level
|| !cl
->un
.leaf
.q
|| cl
->prio_activity
);
1141 if (parent
->cmode
!= HTB_CAN_SEND
)
1142 htb_safe_rb_erase(&parent
->pq_node
, q
->wait_pq
+ parent
->level
);
1145 memset(&parent
->un
.inner
, 0, sizeof(parent
->un
.inner
));
1146 INIT_LIST_HEAD(&parent
->un
.leaf
.drop_list
);
1147 parent
->un
.leaf
.q
= new_q
? new_q
: &noop_qdisc
;
1148 parent
->tokens
= parent
->buffer
;
1149 parent
->ctokens
= parent
->cbuffer
;
1150 parent
->t_c
= psched_get_time();
1151 parent
->cmode
= HTB_CAN_SEND
;
1154 static void htb_destroy_class(struct Qdisc
*sch
, struct htb_class
*cl
)
1157 WARN_ON(!cl
->un
.leaf
.q
);
1158 qdisc_destroy(cl
->un
.leaf
.q
);
1160 gen_kill_estimator(&cl
->bstats
, &cl
->rate_est
);
1161 qdisc_put_rtab(cl
->rate
);
1162 qdisc_put_rtab(cl
->ceil
);
1164 tcf_destroy_chain(&cl
->filter_list
);
1168 /* always caled under BH & queue lock */
1169 static void htb_destroy(struct Qdisc
*sch
)
1171 struct htb_sched
*q
= qdisc_priv(sch
);
1172 struct hlist_node
*n
, *next
;
1173 struct htb_class
*cl
;
1176 qdisc_watchdog_cancel(&q
->watchdog
);
1177 /* This line used to be after htb_destroy_class call below
1178 and surprisingly it worked in 2.4. But it must precede it
1179 because filter need its target class alive to be able to call
1180 unbind_filter on it (without Oops). */
1181 tcf_destroy_chain(&q
->filter_list
);
1183 for (i
= 0; i
< q
->clhash
.hashsize
; i
++) {
1184 hlist_for_each_entry(cl
, n
, &q
->clhash
.hash
[i
], common
.hnode
)
1185 tcf_destroy_chain(&cl
->filter_list
);
1187 for (i
= 0; i
< q
->clhash
.hashsize
; i
++) {
1188 hlist_for_each_entry_safe(cl
, n
, next
, &q
->clhash
.hash
[i
],
1190 htb_destroy_class(sch
, cl
);
1192 qdisc_class_hash_destroy(&q
->clhash
);
1193 __skb_queue_purge(&q
->direct_queue
);
1196 static int htb_delete(struct Qdisc
*sch
, unsigned long arg
)
1198 struct htb_sched
*q
= qdisc_priv(sch
);
1199 struct htb_class
*cl
= (struct htb_class
*)arg
;
1201 struct Qdisc
*new_q
= NULL
;
1204 // TODO: why don't allow to delete subtree ? references ? does
1205 // tc subsys quarantee us that in htb_destroy it holds no class
1206 // refs so that we can remove children safely there ?
1207 if (cl
->children
|| cl
->filter_cnt
)
1210 if (!cl
->level
&& htb_parent_last_child(cl
)) {
1211 new_q
= qdisc_create_dflt(qdisc_dev(sch
), sch
->dev_queue
,
1213 cl
->parent
->common
.classid
);
1220 qlen
= cl
->un
.leaf
.q
->q
.qlen
;
1221 qdisc_reset(cl
->un
.leaf
.q
);
1222 qdisc_tree_decrease_qlen(cl
->un
.leaf
.q
, qlen
);
1225 /* delete from hash and active; remainder in destroy_class */
1226 qdisc_class_hash_remove(&q
->clhash
, &cl
->common
);
1228 cl
->parent
->children
--;
1230 if (cl
->prio_activity
)
1231 htb_deactivate(q
, cl
);
1233 if (cl
->cmode
!= HTB_CAN_SEND
)
1234 htb_safe_rb_erase(&cl
->pq_node
, q
->wait_pq
+ cl
->level
);
1237 htb_parent_to_leaf(q
, cl
, new_q
);
1239 if (--cl
->refcnt
== 0)
1240 htb_destroy_class(sch
, cl
);
1242 sch_tree_unlock(sch
);
1246 static void htb_put(struct Qdisc
*sch
, unsigned long arg
)
1248 struct htb_class
*cl
= (struct htb_class
*)arg
;
1250 if (--cl
->refcnt
== 0)
1251 htb_destroy_class(sch
, cl
);
1254 static int htb_change_class(struct Qdisc
*sch
, u32 classid
,
1255 u32 parentid
, struct nlattr
**tca
,
1259 struct htb_sched
*q
= qdisc_priv(sch
);
1260 struct htb_class
*cl
= (struct htb_class
*)*arg
, *parent
;
1261 struct nlattr
*opt
= tca
[TCA_OPTIONS
];
1262 struct qdisc_rate_table
*rtab
= NULL
, *ctab
= NULL
;
1263 struct nlattr
*tb
[TCA_HTB_RTAB
+ 1];
1264 struct tc_htb_opt
*hopt
;
1266 /* extract all subattrs from opt attr */
1270 err
= nla_parse_nested(tb
, TCA_HTB_RTAB
, opt
, htb_policy
);
1275 if (tb
[TCA_HTB_PARMS
] == NULL
)
1278 parent
= parentid
== TC_H_ROOT
? NULL
: htb_find(parentid
, sch
);
1280 hopt
= nla_data(tb
[TCA_HTB_PARMS
]);
1282 rtab
= qdisc_get_rtab(&hopt
->rate
, tb
[TCA_HTB_RTAB
]);
1283 ctab
= qdisc_get_rtab(&hopt
->ceil
, tb
[TCA_HTB_CTAB
]);
1287 if (!cl
) { /* new class */
1288 struct Qdisc
*new_q
;
1292 struct gnet_estimator opt
;
1295 .nla_len
= nla_attr_size(sizeof(est
.opt
)),
1296 .nla_type
= TCA_RATE
,
1299 /* 4s interval, 16s averaging constant */
1305 /* check for valid classid */
1306 if (!classid
|| TC_H_MAJ(classid
^ sch
->handle
)
1307 || htb_find(classid
, sch
))
1310 /* check maximal depth */
1311 if (parent
&& parent
->parent
&& parent
->parent
->level
< 2) {
1312 printk(KERN_ERR
"htb: tree is too deep\n");
1316 if ((cl
= kzalloc(sizeof(*cl
), GFP_KERNEL
)) == NULL
)
1319 err
= gen_new_estimator(&cl
->bstats
, &cl
->rate_est
,
1320 qdisc_root_sleeping_lock(sch
),
1321 tca
[TCA_RATE
] ? : &est
.nla
);
1329 INIT_LIST_HEAD(&cl
->un
.leaf
.drop_list
);
1330 RB_CLEAR_NODE(&cl
->pq_node
);
1332 for (prio
= 0; prio
< TC_HTB_NUMPRIO
; prio
++)
1333 RB_CLEAR_NODE(&cl
->node
[prio
]);
1335 /* create leaf qdisc early because it uses kmalloc(GFP_KERNEL)
1336 so that can't be used inside of sch_tree_lock
1337 -- thanks to Karlis Peisenieks */
1338 new_q
= qdisc_create_dflt(qdisc_dev(sch
), sch
->dev_queue
,
1339 &pfifo_qdisc_ops
, classid
);
1341 if (parent
&& !parent
->level
) {
1342 unsigned int qlen
= parent
->un
.leaf
.q
->q
.qlen
;
1344 /* turn parent into inner node */
1345 qdisc_reset(parent
->un
.leaf
.q
);
1346 qdisc_tree_decrease_qlen(parent
->un
.leaf
.q
, qlen
);
1347 qdisc_destroy(parent
->un
.leaf
.q
);
1348 if (parent
->prio_activity
)
1349 htb_deactivate(q
, parent
);
1351 /* remove from evt list because of level change */
1352 if (parent
->cmode
!= HTB_CAN_SEND
) {
1353 htb_safe_rb_erase(&parent
->pq_node
, q
->wait_pq
);
1354 parent
->cmode
= HTB_CAN_SEND
;
1356 parent
->level
= (parent
->parent
? parent
->parent
->level
1357 : TC_HTB_MAXDEPTH
) - 1;
1358 memset(&parent
->un
.inner
, 0, sizeof(parent
->un
.inner
));
1360 /* leaf (we) needs elementary qdisc */
1361 cl
->un
.leaf
.q
= new_q
? new_q
: &noop_qdisc
;
1363 cl
->common
.classid
= classid
;
1364 cl
->parent
= parent
;
1366 /* set class to be in HTB_CAN_SEND state */
1367 cl
->tokens
= hopt
->buffer
;
1368 cl
->ctokens
= hopt
->cbuffer
;
1369 cl
->mbuffer
= 60 * PSCHED_TICKS_PER_SEC
; /* 1min */
1370 cl
->t_c
= psched_get_time();
1371 cl
->cmode
= HTB_CAN_SEND
;
1373 /* attach to the hash list and parent's family */
1374 qdisc_class_hash_insert(&q
->clhash
, &cl
->common
);
1378 if (tca
[TCA_RATE
]) {
1379 err
= gen_replace_estimator(&cl
->bstats
, &cl
->rate_est
,
1380 qdisc_root_sleeping_lock(sch
),
1388 /* it used to be a nasty bug here, we have to check that node
1389 is really leaf before changing cl->un.leaf ! */
1391 cl
->quantum
= rtab
->rate
.rate
/ q
->rate2quantum
;
1392 if (!hopt
->quantum
&& cl
->quantum
< 1000) {
1394 "HTB: quantum of class %X is small. Consider r2q change.\n",
1395 cl
->common
.classid
);
1398 if (!hopt
->quantum
&& cl
->quantum
> 200000) {
1400 "HTB: quantum of class %X is big. Consider r2q change.\n",
1401 cl
->common
.classid
);
1402 cl
->quantum
= 200000;
1405 cl
->quantum
= hopt
->quantum
;
1406 if ((cl
->prio
= hopt
->prio
) >= TC_HTB_NUMPRIO
)
1407 cl
->prio
= TC_HTB_NUMPRIO
- 1;
1410 cl
->buffer
= hopt
->buffer
;
1411 cl
->cbuffer
= hopt
->cbuffer
;
1413 qdisc_put_rtab(cl
->rate
);
1416 qdisc_put_rtab(cl
->ceil
);
1418 sch_tree_unlock(sch
);
1420 qdisc_class_hash_grow(sch
, &q
->clhash
);
1422 *arg
= (unsigned long)cl
;
1427 qdisc_put_rtab(rtab
);
1429 qdisc_put_rtab(ctab
);
1433 static struct tcf_proto
**htb_find_tcf(struct Qdisc
*sch
, unsigned long arg
)
1435 struct htb_sched
*q
= qdisc_priv(sch
);
1436 struct htb_class
*cl
= (struct htb_class
*)arg
;
1437 struct tcf_proto
**fl
= cl
? &cl
->filter_list
: &q
->filter_list
;
1442 static unsigned long htb_bind_filter(struct Qdisc
*sch
, unsigned long parent
,
1445 struct htb_class
*cl
= htb_find(classid
, sch
);
1447 /*if (cl && !cl->level) return 0;
1448 The line above used to be there to prevent attaching filters to
1449 leaves. But at least tc_index filter uses this just to get class
1450 for other reasons so that we have to allow for it.
1452 19.6.2002 As Werner explained it is ok - bind filter is just
1453 another way to "lock" the class - unlike "get" this lock can
1454 be broken by class during destroy IIUC.
1458 return (unsigned long)cl
;
1461 static void htb_unbind_filter(struct Qdisc
*sch
, unsigned long arg
)
1463 struct htb_class
*cl
= (struct htb_class
*)arg
;
1469 static void htb_walk(struct Qdisc
*sch
, struct qdisc_walker
*arg
)
1471 struct htb_sched
*q
= qdisc_priv(sch
);
1472 struct htb_class
*cl
;
1473 struct hlist_node
*n
;
1479 for (i
= 0; i
< q
->clhash
.hashsize
; i
++) {
1480 hlist_for_each_entry(cl
, n
, &q
->clhash
.hash
[i
], common
.hnode
) {
1481 if (arg
->count
< arg
->skip
) {
1485 if (arg
->fn(sch
, (unsigned long)cl
, arg
) < 0) {
1494 static const struct Qdisc_class_ops htb_class_ops
= {
1497 .qlen_notify
= htb_qlen_notify
,
1500 .change
= htb_change_class
,
1501 .delete = htb_delete
,
1503 .tcf_chain
= htb_find_tcf
,
1504 .bind_tcf
= htb_bind_filter
,
1505 .unbind_tcf
= htb_unbind_filter
,
1506 .dump
= htb_dump_class
,
1507 .dump_stats
= htb_dump_class_stats
,
1510 static struct Qdisc_ops htb_qdisc_ops __read_mostly
= {
1512 .cl_ops
= &htb_class_ops
,
1514 .priv_size
= sizeof(struct htb_sched
),
1515 .enqueue
= htb_enqueue
,
1516 .dequeue
= htb_dequeue
,
1517 .peek
= qdisc_peek_dequeued
,
1521 .destroy
= htb_destroy
,
1522 .change
= NULL
/* htb_change */,
1524 .owner
= THIS_MODULE
,
1527 static int __init
htb_module_init(void)
1529 return register_qdisc(&htb_qdisc_ops
);
1531 static void __exit
htb_module_exit(void)
1533 unregister_qdisc(&htb_qdisc_ops
);
1536 module_init(htb_module_init
)
1537 module_exit(htb_module_exit
)
1538 MODULE_LICENSE("GPL");