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 * $Id: sch_htb.c,v 1.25 2003/12/07 11:08:25 devik Exp devik $
30 #include <linux/module.h>
31 #include <asm/uaccess.h>
32 #include <asm/system.h>
33 #include <linux/bitops.h>
34 #include <linux/types.h>
35 #include <linux/kernel.h>
36 #include <linux/string.h>
38 #include <linux/socket.h>
39 #include <linux/sockios.h>
41 #include <linux/errno.h>
42 #include <linux/interrupt.h>
43 #include <linux/if_ether.h>
44 #include <linux/inet.h>
45 #include <linux/netdevice.h>
46 #include <linux/etherdevice.h>
47 #include <linux/notifier.h>
49 #include <net/route.h>
50 #include <linux/skbuff.h>
51 #include <linux/list.h>
52 #include <linux/compiler.h>
53 #include <net/netlink.h>
55 #include <net/pkt_sched.h>
56 #include <linux/rbtree.h>
60 ========================================================================
61 HTB is like TBF with multiple classes. It is also similar to CBQ because
62 it allows to assign priority to each class in hierarchy.
63 In fact it is another implementation of Floyd's formal sharing.
66 Each class is assigned level. Leaf has ALWAYS level 0 and root
67 classes have level TC_HTB_MAXDEPTH-1. Interior nodes has level
68 one less than their parent.
71 #define HTB_HSIZE 16 /* classid hash size */
72 #define HTB_EWMAC 2 /* rate average over HTB_EWMAC*HTB_HSIZE sec */
73 #define HTB_RATECM 1 /* whether to use rate computer */
74 #define HTB_HYSTERESIS 1 /* whether to use mode hysteresis for speedup */
75 #define HTB_VER 0x30011 /* major must be matched with number suplied by TC as version */
77 #if HTB_VER >> 16 != TC_HTB_PROTOVER
78 #error "Mismatched sch_htb.c and pkt_sch.h"
81 /* used internaly to keep status of single class */
83 HTB_CANT_SEND, /* class can't send and can't borrow */
84 HTB_MAY_BORROW, /* class can't send but may borrow */
85 HTB_CAN_SEND /* class can send */
88 /* interior & leaf nodes; props specific to leaves are marked L: */
90 /* general class parameters */
92 struct gnet_stats_basic bstats;
93 struct gnet_stats_queue qstats;
94 struct gnet_stats_rate_est rate_est;
95 struct tc_htb_xstats xstats; /* our special stats */
96 int refcnt; /* usage count of this class */
99 /* rate measurement counters */
100 unsigned long rate_bytes, sum_bytes;
101 unsigned long rate_packets, sum_packets;
105 int level; /* our level (see above) */
106 struct htb_class *parent; /* parent class */
107 struct hlist_node hlist; /* classid hash list item */
108 struct list_head sibling; /* sibling list item */
109 struct list_head children; /* children list */
112 struct htb_class_leaf {
117 int deficit[TC_HTB_MAXDEPTH];
118 struct list_head drop_list;
120 struct htb_class_inner {
121 struct rb_root feed[TC_HTB_NUMPRIO]; /* feed trees */
122 struct rb_node *ptr[TC_HTB_NUMPRIO]; /* current class ptr */
123 /* When class changes from state 1->2 and disconnects from
124 parent's feed then we lost ptr value and start from the
125 first child again. Here we store classid of the
126 last valid ptr (used when ptr is NULL). */
127 u32 last_ptr_id[TC_HTB_NUMPRIO];
130 struct rb_node node[TC_HTB_NUMPRIO]; /* node for self or feed tree */
131 struct rb_node pq_node; /* node for event queue */
132 psched_time_t pq_key;
134 int prio_activity; /* for which prios are we active */
135 enum htb_cmode cmode; /* current mode of the class */
137 /* class attached filters */
138 struct tcf_proto *filter_list;
141 int warned; /* only one warning about non work conserving .. */
143 /* token bucket parameters */
144 struct qdisc_rate_table *rate; /* rate table of the class itself */
145 struct qdisc_rate_table *ceil; /* ceiling rate (limits borrows too) */
146 long buffer, cbuffer; /* token bucket depth/rate */
147 psched_tdiff_t mbuffer; /* max wait time */
148 long tokens, ctokens; /* current number of tokens */
149 psched_time_t t_c; /* checkpoint time */
151 int prio; /* For parent to leaf return possible here */
152 int quantum; /* we do backup. Finally full replacement */
153 /* of un.leaf originals should be done. */
156 /* TODO: maybe compute rate when size is too large .. or drop ? */
157 static inline long L2T(struct htb_class *cl, struct qdisc_rate_table *rate,
160 int slot = size >> rate->rate.cell_log;
165 return rate->data[slot];
169 struct list_head root; /* root classes list */
170 struct hlist_head hash[HTB_HSIZE]; /* hashed by classid */
171 struct list_head drops[TC_HTB_NUMPRIO];/* active leaves (for drops) */
173 /* self list - roots of self generating tree */
174 struct rb_root row[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
175 int row_mask[TC_HTB_MAXDEPTH];
176 struct rb_node *ptr[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
177 u32 last_ptr_id[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
179 /* self wait list - roots of wait PQs per row */
180 struct rb_root wait_pq[TC_HTB_MAXDEPTH];
182 /* time of nearest event per level (row) */
183 psched_time_t near_ev_cache[TC_HTB_MAXDEPTH];
185 /* whether we hit non-work conserving class during this dequeue; we use */
186 int nwc_hit; /* this to disable mindelay complaint in dequeue */
188 int defcls; /* class where unclassified flows go to */
190 /* filters for qdisc itself */
191 struct tcf_proto *filter_list;
194 int rate2quantum; /* quant = rate / rate2quantum */
195 psched_time_t now; /* cached dequeue time */
196 struct qdisc_watchdog watchdog;
198 struct timer_list rttim; /* rate computer timer */
199 int recmp_bucket; /* which hash bucket to recompute next */
202 /* non shaped skbs; let them go directly thru */
203 struct sk_buff_head direct_queue;
204 int direct_qlen; /* max qlen of above */
209 /* compute hash of size HTB_HSIZE for given handle */
210 static inline int htb_hash(u32 h)
213 #error "Declare new hash for your HTB_HSIZE"
215 h ^= h >> 8; /* stolen from cbq_hash */
220 /* find class in global hash table using given handle */
221 static inline struct htb_class *htb_find(u32 handle, struct Qdisc *sch)
223 struct htb_sched *q = qdisc_priv(sch);
224 struct hlist_node *p;
225 struct htb_class *cl;
227 if (TC_H_MAJ(handle) != sch->handle)
230 hlist_for_each_entry(cl, p, q->hash + htb_hash(handle), hlist) {
231 if (cl->classid == handle)
238 * htb_classify - classify a packet into class
240 * It returns NULL if the packet should be dropped or -1 if the packet
241 * should be passed directly thru. In all other cases leaf class is returned.
242 * We allow direct class selection by classid in priority. The we examine
243 * filters in qdisc and in inner nodes (if higher filter points to the inner
244 * node). If we end up with classid MAJOR:0 we enqueue the skb into special
245 * internal fifo (direct). These packets then go directly thru. If we still
246 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessfull
247 * then finish and return direct queue.
249 #define HTB_DIRECT (struct htb_class*)-1
250 static inline u32 htb_classid(struct htb_class *cl)
252 return (cl && cl != HTB_DIRECT) ? cl->classid : TC_H_UNSPEC;
255 static struct htb_class *htb_classify(struct sk_buff *skb, struct Qdisc *sch,
258 struct htb_sched *q = qdisc_priv(sch);
259 struct htb_class *cl;
260 struct tcf_result res;
261 struct tcf_proto *tcf;
264 /* allow to select class by setting skb->priority to valid classid;
265 note that nfmark can be used too by attaching filter fw with no
267 if (skb->priority == sch->handle)
268 return HTB_DIRECT; /* X:0 (direct flow) selected */
269 if ((cl = htb_find(skb->priority, sch)) != NULL && cl->level == 0)
272 *qerr = NET_XMIT_BYPASS;
273 tcf = q->filter_list;
274 while (tcf && (result = tc_classify(skb, tcf, &res)) >= 0) {
275 #ifdef CONFIG_NET_CLS_ACT
279 *qerr = NET_XMIT_SUCCESS;
283 #elif defined(CONFIG_NET_CLS_POLICE)
284 if (result == TC_POLICE_SHOT)
287 if ((cl = (void *)res.class) == NULL) {
288 if (res.classid == sch->handle)
289 return HTB_DIRECT; /* X:0 (direct flow) */
290 if ((cl = htb_find(res.classid, sch)) == NULL)
291 break; /* filter selected invalid classid */
294 return cl; /* we hit leaf; return it */
296 /* we have got inner class; apply inner filter chain */
297 tcf = cl->filter_list;
299 /* classification failed; try to use default class */
300 cl = htb_find(TC_H_MAKE(TC_H_MAJ(sch->handle), q->defcls), sch);
301 if (!cl || cl->level)
302 return HTB_DIRECT; /* bad default .. this is safe bet */
307 * htb_add_to_id_tree - adds class to the round robin list
309 * Routine adds class to the list (actually tree) sorted by classid.
310 * Make sure that class is not already on such list for given prio.
312 static void htb_add_to_id_tree(struct rb_root *root,
313 struct htb_class *cl, int prio)
315 struct rb_node **p = &root->rb_node, *parent = NULL;
320 c = rb_entry(parent, struct htb_class, node[prio]);
322 if (cl->classid > c->classid)
323 p = &parent->rb_right;
325 p = &parent->rb_left;
327 rb_link_node(&cl->node[prio], parent, p);
328 rb_insert_color(&cl->node[prio], root);
332 * htb_add_to_wait_tree - adds class to the event queue with delay
334 * The class is added to priority event queue to indicate that class will
335 * change its mode in cl->pq_key microseconds. Make sure that class is not
336 * already in the queue.
338 static void htb_add_to_wait_tree(struct htb_sched *q,
339 struct htb_class *cl, long delay)
341 struct rb_node **p = &q->wait_pq[cl->level].rb_node, *parent = NULL;
343 cl->pq_key = q->now + delay;
344 if (cl->pq_key == q->now)
347 /* update the nearest event cache */
348 if (q->near_ev_cache[cl->level] > cl->pq_key)
349 q->near_ev_cache[cl->level] = cl->pq_key;
354 c = rb_entry(parent, struct htb_class, pq_node);
355 if (cl->pq_key >= c->pq_key)
356 p = &parent->rb_right;
358 p = &parent->rb_left;
360 rb_link_node(&cl->pq_node, parent, p);
361 rb_insert_color(&cl->pq_node, &q->wait_pq[cl->level]);
365 * htb_next_rb_node - finds next node in binary tree
367 * When we are past last key we return NULL.
368 * Average complexity is 2 steps per call.
370 static inline void htb_next_rb_node(struct rb_node **n)
376 * htb_add_class_to_row - add class to its row
378 * The class is added to row at priorities marked in mask.
379 * It does nothing if mask == 0.
381 static inline void htb_add_class_to_row(struct htb_sched *q,
382 struct htb_class *cl, int mask)
384 q->row_mask[cl->level] |= mask;
386 int prio = ffz(~mask);
387 mask &= ~(1 << prio);
388 htb_add_to_id_tree(q->row[cl->level] + prio, cl, prio);
392 /* If this triggers, it is a bug in this code, but it need not be fatal */
393 static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root)
395 if (RB_EMPTY_NODE(rb)) {
405 * htb_remove_class_from_row - removes class from its row
407 * The class is removed from row at priorities marked in mask.
408 * It does nothing if mask == 0.
410 static inline void htb_remove_class_from_row(struct htb_sched *q,
411 struct htb_class *cl, int mask)
416 int prio = ffz(~mask);
418 mask &= ~(1 << prio);
419 if (q->ptr[cl->level][prio] == cl->node + prio)
420 htb_next_rb_node(q->ptr[cl->level] + prio);
422 htb_safe_rb_erase(cl->node + prio, q->row[cl->level] + prio);
423 if (!q->row[cl->level][prio].rb_node)
426 q->row_mask[cl->level] &= ~m;
430 * htb_activate_prios - creates active classe's feed chain
432 * The class is connected to ancestors and/or appropriate rows
433 * for priorities it is participating on. cl->cmode must be new
434 * (activated) mode. It does nothing if cl->prio_activity == 0.
436 static void htb_activate_prios(struct htb_sched *q, struct htb_class *cl)
438 struct htb_class *p = cl->parent;
439 long m, mask = cl->prio_activity;
441 while (cl->cmode == HTB_MAY_BORROW && p && mask) {
447 if (p->un.inner.feed[prio].rb_node)
448 /* parent already has its feed in use so that
449 reset bit in mask as parent is already ok */
450 mask &= ~(1 << prio);
452 htb_add_to_id_tree(p->un.inner.feed + prio, cl, prio);
454 p->prio_activity |= mask;
459 if (cl->cmode == HTB_CAN_SEND && mask)
460 htb_add_class_to_row(q, cl, mask);
464 * htb_deactivate_prios - remove class from feed chain
466 * cl->cmode must represent old mode (before deactivation). It does
467 * nothing if cl->prio_activity == 0. Class is removed from all feed
470 static void htb_deactivate_prios(struct htb_sched *q, struct htb_class *cl)
472 struct htb_class *p = cl->parent;
473 long m, mask = cl->prio_activity;
475 while (cl->cmode == HTB_MAY_BORROW && p && mask) {
482 if (p->un.inner.ptr[prio] == cl->node + prio) {
483 /* we are removing child which is pointed to from
484 parent feed - forget the pointer but remember
486 p->un.inner.last_ptr_id[prio] = cl->classid;
487 p->un.inner.ptr[prio] = NULL;
490 htb_safe_rb_erase(cl->node + prio, p->un.inner.feed + prio);
492 if (!p->un.inner.feed[prio].rb_node)
496 p->prio_activity &= ~mask;
501 if (cl->cmode == HTB_CAN_SEND && mask)
502 htb_remove_class_from_row(q, cl, mask);
506 static inline long htb_lowater(const struct htb_class *cl)
508 return cl->cmode != HTB_CANT_SEND ? -cl->cbuffer : 0;
510 static inline long htb_hiwater(const struct htb_class *cl)
512 return cl->cmode == HTB_CAN_SEND ? -cl->buffer : 0;
515 #define htb_lowater(cl) (0)
516 #define htb_hiwater(cl) (0)
520 * htb_class_mode - computes and returns current class mode
522 * It computes cl's mode at time cl->t_c+diff and returns it. If mode
523 * is not HTB_CAN_SEND then cl->pq_key is updated to time difference
524 * from now to time when cl will change its state.
525 * Also it is worth to note that class mode doesn't change simply
526 * at cl->{c,}tokens == 0 but there can rather be hysteresis of
527 * 0 .. -cl->{c,}buffer range. It is meant to limit number of
528 * mode transitions per time unit. The speed gain is about 1/6.
530 static inline enum htb_cmode
531 htb_class_mode(struct htb_class *cl, long *diff)
535 if ((toks = (cl->ctokens + *diff)) < htb_lowater(cl)) {
537 return HTB_CANT_SEND;
540 if ((toks = (cl->tokens + *diff)) >= htb_hiwater(cl))
544 return HTB_MAY_BORROW;
548 * htb_change_class_mode - changes classe's mode
550 * This should be the only way how to change classe's mode under normal
551 * cirsumstances. Routine will update feed lists linkage, change mode
552 * and add class to the wait event queue if appropriate. New mode should
553 * be different from old one and cl->pq_key has to be valid if changing
554 * to mode other than HTB_CAN_SEND (see htb_add_to_wait_tree).
557 htb_change_class_mode(struct htb_sched *q, struct htb_class *cl, long *diff)
559 enum htb_cmode new_mode = htb_class_mode(cl, diff);
561 if (new_mode == cl->cmode)
564 if (cl->prio_activity) { /* not necessary: speed optimization */
565 if (cl->cmode != HTB_CANT_SEND)
566 htb_deactivate_prios(q, cl);
567 cl->cmode = new_mode;
568 if (new_mode != HTB_CANT_SEND)
569 htb_activate_prios(q, cl);
571 cl->cmode = new_mode;
575 * htb_activate - inserts leaf cl into appropriate active feeds
577 * Routine learns (new) priority of leaf and activates feed chain
578 * for the prio. It can be called on already active leaf safely.
579 * It also adds leaf into droplist.
581 static inline void htb_activate(struct htb_sched *q, struct htb_class *cl)
583 BUG_TRAP(!cl->level && cl->un.leaf.q && cl->un.leaf.q->q.qlen);
585 if (!cl->prio_activity) {
586 cl->prio_activity = 1 << (cl->un.leaf.aprio = cl->un.leaf.prio);
587 htb_activate_prios(q, cl);
588 list_add_tail(&cl->un.leaf.drop_list,
589 q->drops + cl->un.leaf.aprio);
594 * htb_deactivate - remove leaf cl from active feeds
596 * Make sure that leaf is active. In the other words it can't be called
597 * with non-active leaf. It also removes class from the drop list.
599 static inline void htb_deactivate(struct htb_sched *q, struct htb_class *cl)
601 BUG_TRAP(cl->prio_activity);
603 htb_deactivate_prios(q, cl);
604 cl->prio_activity = 0;
605 list_del_init(&cl->un.leaf.drop_list);
608 static int htb_enqueue(struct sk_buff *skb, struct Qdisc *sch)
611 struct htb_sched *q = qdisc_priv(sch);
612 struct htb_class *cl = htb_classify(skb, sch, &ret);
614 if (cl == HTB_DIRECT) {
615 /* enqueue to helper queue */
616 if (q->direct_queue.qlen < q->direct_qlen) {
617 __skb_queue_tail(&q->direct_queue, skb);
622 return NET_XMIT_DROP;
624 #ifdef CONFIG_NET_CLS_ACT
626 if (ret == NET_XMIT_BYPASS)
631 } else if (cl->un.leaf.q->enqueue(skb, cl->un.leaf.q) !=
635 return NET_XMIT_DROP;
637 cl->bstats.packets++;
638 cl->bstats.bytes += skb->len;
643 sch->bstats.packets++;
644 sch->bstats.bytes += skb->len;
645 return NET_XMIT_SUCCESS;
648 /* TODO: requeuing packet charges it to policers again !! */
649 static int htb_requeue(struct sk_buff *skb, struct Qdisc *sch)
651 struct htb_sched *q = qdisc_priv(sch);
652 int ret = NET_XMIT_SUCCESS;
653 struct htb_class *cl = htb_classify(skb, sch, &ret);
654 struct sk_buff *tskb;
656 if (cl == HTB_DIRECT || !cl) {
657 /* enqueue to helper queue */
658 if (q->direct_queue.qlen < q->direct_qlen && cl) {
659 __skb_queue_head(&q->direct_queue, skb);
661 __skb_queue_head(&q->direct_queue, skb);
662 tskb = __skb_dequeue_tail(&q->direct_queue);
667 } else if (cl->un.leaf.q->ops->requeue(skb, cl->un.leaf.q) !=
671 return NET_XMIT_DROP;
676 sch->qstats.requeues++;
677 return NET_XMIT_SUCCESS;
681 #define RT_GEN(D,R) R+=D-(R/HTB_EWMAC);D=0
682 static void htb_rate_timer(unsigned long arg)
684 struct Qdisc *sch = (struct Qdisc *)arg;
685 struct htb_sched *q = qdisc_priv(sch);
686 struct hlist_node *p;
687 struct htb_class *cl;
690 /* lock queue so that we can muck with it */
691 spin_lock_bh(&sch->dev->queue_lock);
693 q->rttim.expires = jiffies + HZ;
694 add_timer(&q->rttim);
696 /* scan and recompute one bucket at time */
697 if (++q->recmp_bucket >= HTB_HSIZE)
700 hlist_for_each_entry(cl,p, q->hash + q->recmp_bucket, hlist) {
701 RT_GEN(cl->sum_bytes, cl->rate_bytes);
702 RT_GEN(cl->sum_packets, cl->rate_packets);
704 spin_unlock_bh(&sch->dev->queue_lock);
709 * htb_charge_class - charges amount "bytes" to leaf and ancestors
711 * Routine assumes that packet "bytes" long was dequeued from leaf cl
712 * borrowing from "level". It accounts bytes to ceil leaky bucket for
713 * leaf and all ancestors and to rate bucket for ancestors at levels
714 * "level" and higher. It also handles possible change of mode resulting
715 * from the update. Note that mode can also increase here (MAY_BORROW to
716 * CAN_SEND) because we can use more precise clock that event queue here.
717 * In such case we remove class from event queue first.
719 static void htb_charge_class(struct htb_sched *q, struct htb_class *cl,
720 int level, int bytes)
723 enum htb_cmode old_mode;
725 #define HTB_ACCNT(T,B,R) toks = diff + cl->T; \
726 if (toks > cl->B) toks = cl->B; \
727 toks -= L2T(cl, cl->R, bytes); \
728 if (toks <= -cl->mbuffer) toks = 1-cl->mbuffer; \
732 diff = PSCHED_TDIFF_SAFE(q->now, cl->t_c, (u32) cl->mbuffer);
733 if (cl->level >= level) {
734 if (cl->level == level)
736 HTB_ACCNT(tokens, buffer, rate);
738 cl->xstats.borrows++;
739 cl->tokens += diff; /* we moved t_c; update tokens */
741 HTB_ACCNT(ctokens, cbuffer, ceil);
744 old_mode = cl->cmode;
746 htb_change_class_mode(q, cl, &diff);
747 if (old_mode != cl->cmode) {
748 if (old_mode != HTB_CAN_SEND)
749 htb_safe_rb_erase(&cl->pq_node, q->wait_pq + cl->level);
750 if (cl->cmode != HTB_CAN_SEND)
751 htb_add_to_wait_tree(q, cl, diff);
754 /* update rate counters */
755 cl->sum_bytes += bytes;
759 /* update byte stats except for leaves which are already updated */
761 cl->bstats.bytes += bytes;
762 cl->bstats.packets++;
769 * htb_do_events - make mode changes to classes at the level
771 * Scans event queue for pending events and applies them. Returns time of
772 * next pending event (0 for no event in pq).
773 * Note: Applied are events whose have cl->pq_key <= q->now.
775 static psched_time_t htb_do_events(struct htb_sched *q, int level)
779 for (i = 0; i < 500; i++) {
780 struct htb_class *cl;
782 struct rb_node *p = rb_first(&q->wait_pq[level]);
787 cl = rb_entry(p, struct htb_class, pq_node);
788 if (cl->pq_key > q->now)
791 htb_safe_rb_erase(p, q->wait_pq + level);
792 diff = PSCHED_TDIFF_SAFE(q->now, cl->t_c, (u32) cl->mbuffer);
793 htb_change_class_mode(q, cl, &diff);
794 if (cl->cmode != HTB_CAN_SEND)
795 htb_add_to_wait_tree(q, cl, diff);
798 printk(KERN_WARNING "htb: too many events !\n");
799 return q->now + PSCHED_TICKS_PER_SEC / 10;
802 /* Returns class->node+prio from id-tree where classe's id is >= id. NULL
803 is no such one exists. */
804 static struct rb_node *htb_id_find_next_upper(int prio, struct rb_node *n,
807 struct rb_node *r = NULL;
809 struct htb_class *cl =
810 rb_entry(n, struct htb_class, node[prio]);
811 if (id == cl->classid)
814 if (id > cl->classid) {
825 * htb_lookup_leaf - returns next leaf class in DRR order
827 * Find leaf where current feed pointers points to.
829 static struct htb_class *htb_lookup_leaf(struct rb_root *tree, int prio,
830 struct rb_node **pptr, u32 * pid)
834 struct rb_node *root;
835 struct rb_node **pptr;
837 } stk[TC_HTB_MAXDEPTH], *sp = stk;
839 BUG_TRAP(tree->rb_node);
840 sp->root = tree->rb_node;
844 for (i = 0; i < 65535; i++) {
845 if (!*sp->pptr && *sp->pid) {
846 /* ptr was invalidated but id is valid - try to recover
847 the original or next ptr */
849 htb_id_find_next_upper(prio, sp->root, *sp->pid);
851 *sp->pid = 0; /* ptr is valid now so that remove this hint as it
852 can become out of date quickly */
853 if (!*sp->pptr) { /* we are at right end; rewind & go up */
854 *sp->pptr = sp->root;
855 while ((*sp->pptr)->rb_left)
856 *sp->pptr = (*sp->pptr)->rb_left;
862 htb_next_rb_node(sp->pptr);
865 struct htb_class *cl;
866 cl = rb_entry(*sp->pptr, struct htb_class, node[prio]);
869 (++sp)->root = cl->un.inner.feed[prio].rb_node;
870 sp->pptr = cl->un.inner.ptr + prio;
871 sp->pid = cl->un.inner.last_ptr_id + prio;
878 /* dequeues packet at given priority and level; call only if
879 you are sure that there is active class at prio/level */
880 static struct sk_buff *htb_dequeue_tree(struct htb_sched *q, int prio,
883 struct sk_buff *skb = NULL;
884 struct htb_class *cl, *start;
885 /* look initial class up in the row */
886 start = cl = htb_lookup_leaf(q->row[level] + prio, prio,
887 q->ptr[level] + prio,
888 q->last_ptr_id[level] + prio);
896 /* class can be empty - it is unlikely but can be true if leaf
897 qdisc drops packets in enqueue routine or if someone used
898 graft operation on the leaf since last dequeue;
899 simply deactivate and skip such class */
900 if (unlikely(cl->un.leaf.q->q.qlen == 0)) {
901 struct htb_class *next;
902 htb_deactivate(q, cl);
904 /* row/level might become empty */
905 if ((q->row_mask[level] & (1 << prio)) == 0)
908 next = htb_lookup_leaf(q->row[level] + prio,
909 prio, q->ptr[level] + prio,
910 q->last_ptr_id[level] + prio);
912 if (cl == start) /* fix start if we just deleted it */
918 skb = cl->un.leaf.q->dequeue(cl->un.leaf.q);
919 if (likely(skb != NULL))
923 "htb: class %X isn't work conserving ?!\n",
928 htb_next_rb_node((level ? cl->parent->un.inner.ptr : q->
930 cl = htb_lookup_leaf(q->row[level] + prio, prio,
931 q->ptr[level] + prio,
932 q->last_ptr_id[level] + prio);
934 } while (cl != start);
936 if (likely(skb != NULL)) {
937 if ((cl->un.leaf.deficit[level] -= skb->len) < 0) {
938 cl->un.leaf.deficit[level] += cl->un.leaf.quantum;
939 htb_next_rb_node((level ? cl->parent->un.inner.ptr : q->
942 /* this used to be after charge_class but this constelation
943 gives us slightly better performance */
944 if (!cl->un.leaf.q->q.qlen)
945 htb_deactivate(q, cl);
946 htb_charge_class(q, cl, level, skb->len);
951 static struct sk_buff *htb_dequeue(struct Qdisc *sch)
953 struct sk_buff *skb = NULL;
954 struct htb_sched *q = qdisc_priv(sch);
956 psched_time_t next_event;
958 /* try to dequeue direct packets as high prio (!) to minimize cpu work */
959 skb = __skb_dequeue(&q->direct_queue);
961 sch->flags &= ~TCQ_F_THROTTLED;
968 PSCHED_GET_TIME(q->now);
970 next_event = q->now + 5 * PSCHED_TICKS_PER_SEC;
972 for (level = 0; level < TC_HTB_MAXDEPTH; level++) {
973 /* common case optimization - skip event handler quickly */
977 if (q->now >= q->near_ev_cache[level]) {
978 event = htb_do_events(q, level);
979 q->near_ev_cache[level] = event ? event :
980 PSCHED_TICKS_PER_SEC;
982 event = q->near_ev_cache[level];
984 if (event && next_event > event)
987 m = ~q->row_mask[level];
988 while (m != (int)(-1)) {
991 skb = htb_dequeue_tree(q, prio, level);
992 if (likely(skb != NULL)) {
994 sch->flags &= ~TCQ_F_THROTTLED;
999 sch->qstats.overlimits++;
1000 qdisc_watchdog_schedule(&q->watchdog, next_event);
1005 /* try to drop from each class (by prio) until one succeed */
1006 static unsigned int htb_drop(struct Qdisc *sch)
1008 struct htb_sched *q = qdisc_priv(sch);
1011 for (prio = TC_HTB_NUMPRIO - 1; prio >= 0; prio--) {
1012 struct list_head *p;
1013 list_for_each(p, q->drops + prio) {
1014 struct htb_class *cl = list_entry(p, struct htb_class,
1017 if (cl->un.leaf.q->ops->drop &&
1018 (len = cl->un.leaf.q->ops->drop(cl->un.leaf.q))) {
1020 if (!cl->un.leaf.q->q.qlen)
1021 htb_deactivate(q, cl);
1029 /* reset all classes */
1030 /* always caled under BH & queue lock */
1031 static void htb_reset(struct Qdisc *sch)
1033 struct htb_sched *q = qdisc_priv(sch);
1036 for (i = 0; i < HTB_HSIZE; i++) {
1037 struct hlist_node *p;
1038 struct htb_class *cl;
1040 hlist_for_each_entry(cl, p, q->hash + i, hlist) {
1042 memset(&cl->un.inner, 0, sizeof(cl->un.inner));
1045 qdisc_reset(cl->un.leaf.q);
1046 INIT_LIST_HEAD(&cl->un.leaf.drop_list);
1048 cl->prio_activity = 0;
1049 cl->cmode = HTB_CAN_SEND;
1053 qdisc_watchdog_cancel(&q->watchdog);
1054 __skb_queue_purge(&q->direct_queue);
1056 memset(q->row, 0, sizeof(q->row));
1057 memset(q->row_mask, 0, sizeof(q->row_mask));
1058 memset(q->wait_pq, 0, sizeof(q->wait_pq));
1059 memset(q->ptr, 0, sizeof(q->ptr));
1060 for (i = 0; i < TC_HTB_NUMPRIO; i++)
1061 INIT_LIST_HEAD(q->drops + i);
1064 static int htb_init(struct Qdisc *sch, struct rtattr *opt)
1066 struct htb_sched *q = qdisc_priv(sch);
1067 struct rtattr *tb[TCA_HTB_INIT];
1068 struct tc_htb_glob *gopt;
1070 if (!opt || rtattr_parse_nested(tb, TCA_HTB_INIT, opt) ||
1071 tb[TCA_HTB_INIT - 1] == NULL ||
1072 RTA_PAYLOAD(tb[TCA_HTB_INIT - 1]) < sizeof(*gopt)) {
1073 printk(KERN_ERR "HTB: hey probably you have bad tc tool ?\n");
1076 gopt = RTA_DATA(tb[TCA_HTB_INIT - 1]);
1077 if (gopt->version != HTB_VER >> 16) {
1079 "HTB: need tc/htb version %d (minor is %d), you have %d\n",
1080 HTB_VER >> 16, HTB_VER & 0xffff, gopt->version);
1084 INIT_LIST_HEAD(&q->root);
1085 for (i = 0; i < HTB_HSIZE; i++)
1086 INIT_HLIST_HEAD(q->hash + i);
1087 for (i = 0; i < TC_HTB_NUMPRIO; i++)
1088 INIT_LIST_HEAD(q->drops + i);
1090 qdisc_watchdog_init(&q->watchdog, sch);
1091 skb_queue_head_init(&q->direct_queue);
1093 q->direct_qlen = sch->dev->tx_queue_len;
1094 if (q->direct_qlen < 2) /* some devices have zero tx_queue_len */
1098 init_timer(&q->rttim);
1099 q->rttim.function = htb_rate_timer;
1100 q->rttim.data = (unsigned long)sch;
1101 q->rttim.expires = jiffies + HZ;
1102 add_timer(&q->rttim);
1104 if ((q->rate2quantum = gopt->rate2quantum) < 1)
1105 q->rate2quantum = 1;
1106 q->defcls = gopt->defcls;
1111 static int htb_dump(struct Qdisc *sch, struct sk_buff *skb)
1113 struct htb_sched *q = qdisc_priv(sch);
1114 unsigned char *b = skb_tail_pointer(skb);
1116 struct tc_htb_glob gopt;
1117 spin_lock_bh(&sch->dev->queue_lock);
1118 gopt.direct_pkts = q->direct_pkts;
1120 gopt.version = HTB_VER;
1121 gopt.rate2quantum = q->rate2quantum;
1122 gopt.defcls = q->defcls;
1124 rta = (struct rtattr *)b;
1125 RTA_PUT(skb, TCA_OPTIONS, 0, NULL);
1126 RTA_PUT(skb, TCA_HTB_INIT, sizeof(gopt), &gopt);
1127 rta->rta_len = skb_tail_pointer(skb) - b;
1128 spin_unlock_bh(&sch->dev->queue_lock);
1131 spin_unlock_bh(&sch->dev->queue_lock);
1132 nlmsg_trim(skb, skb_tail_pointer(skb));
1136 static int htb_dump_class(struct Qdisc *sch, unsigned long arg,
1137 struct sk_buff *skb, struct tcmsg *tcm)
1139 struct htb_class *cl = (struct htb_class *)arg;
1140 unsigned char *b = skb_tail_pointer(skb);
1142 struct tc_htb_opt opt;
1144 spin_lock_bh(&sch->dev->queue_lock);
1145 tcm->tcm_parent = cl->parent ? cl->parent->classid : TC_H_ROOT;
1146 tcm->tcm_handle = cl->classid;
1147 if (!cl->level && cl->un.leaf.q)
1148 tcm->tcm_info = cl->un.leaf.q->handle;
1150 rta = (struct rtattr *)b;
1151 RTA_PUT(skb, TCA_OPTIONS, 0, NULL);
1153 memset(&opt, 0, sizeof(opt));
1155 opt.rate = cl->rate->rate;
1156 opt.buffer = cl->buffer;
1157 opt.ceil = cl->ceil->rate;
1158 opt.cbuffer = cl->cbuffer;
1159 opt.quantum = cl->un.leaf.quantum;
1160 opt.prio = cl->un.leaf.prio;
1161 opt.level = cl->level;
1162 RTA_PUT(skb, TCA_HTB_PARMS, sizeof(opt), &opt);
1163 rta->rta_len = skb_tail_pointer(skb) - b;
1164 spin_unlock_bh(&sch->dev->queue_lock);
1167 spin_unlock_bh(&sch->dev->queue_lock);
1173 htb_dump_class_stats(struct Qdisc *sch, unsigned long arg, struct gnet_dump *d)
1175 struct htb_class *cl = (struct htb_class *)arg;
1178 cl->rate_est.bps = cl->rate_bytes / (HTB_EWMAC * HTB_HSIZE);
1179 cl->rate_est.pps = cl->rate_packets / (HTB_EWMAC * HTB_HSIZE);
1182 if (!cl->level && cl->un.leaf.q)
1183 cl->qstats.qlen = cl->un.leaf.q->q.qlen;
1184 cl->xstats.tokens = cl->tokens;
1185 cl->xstats.ctokens = cl->ctokens;
1187 if (gnet_stats_copy_basic(d, &cl->bstats) < 0 ||
1188 gnet_stats_copy_rate_est(d, &cl->rate_est) < 0 ||
1189 gnet_stats_copy_queue(d, &cl->qstats) < 0)
1192 return gnet_stats_copy_app(d, &cl->xstats, sizeof(cl->xstats));
1195 static int htb_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
1198 struct htb_class *cl = (struct htb_class *)arg;
1200 if (cl && !cl->level) {
1202 (new = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops,
1207 if ((*old = xchg(&cl->un.leaf.q, new)) != NULL) {
1208 qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
1211 sch_tree_unlock(sch);
1217 static struct Qdisc *htb_leaf(struct Qdisc *sch, unsigned long arg)
1219 struct htb_class *cl = (struct htb_class *)arg;
1220 return (cl && !cl->level) ? cl->un.leaf.q : NULL;
1223 static void htb_qlen_notify(struct Qdisc *sch, unsigned long arg)
1225 struct htb_class *cl = (struct htb_class *)arg;
1227 if (cl->un.leaf.q->q.qlen == 0)
1228 htb_deactivate(qdisc_priv(sch), cl);
1231 static unsigned long htb_get(struct Qdisc *sch, u32 classid)
1233 struct htb_class *cl = htb_find(classid, sch);
1236 return (unsigned long)cl;
1239 static void htb_destroy_filters(struct tcf_proto **fl)
1241 struct tcf_proto *tp;
1243 while ((tp = *fl) != NULL) {
1249 static inline int htb_parent_last_child(struct htb_class *cl)
1252 /* the root class */
1255 if (!(cl->parent->children.next == &cl->sibling &&
1256 cl->parent->children.prev == &cl->sibling))
1257 /* not the last child */
1263 static void htb_parent_to_leaf(struct htb_class *cl, struct Qdisc *new_q)
1265 struct htb_class *parent = cl->parent;
1267 BUG_TRAP(!cl->level && cl->un.leaf.q && !cl->prio_activity);
1270 memset(&parent->un.inner, 0, sizeof(parent->un.inner));
1271 INIT_LIST_HEAD(&parent->un.leaf.drop_list);
1272 parent->un.leaf.q = new_q ? new_q : &noop_qdisc;
1273 parent->un.leaf.quantum = parent->quantum;
1274 parent->un.leaf.prio = parent->prio;
1275 parent->tokens = parent->buffer;
1276 parent->ctokens = parent->cbuffer;
1277 PSCHED_GET_TIME(parent->t_c);
1278 parent->cmode = HTB_CAN_SEND;
1281 static void htb_destroy_class(struct Qdisc *sch, struct htb_class *cl)
1283 struct htb_sched *q = qdisc_priv(sch);
1286 BUG_TRAP(cl->un.leaf.q);
1287 qdisc_destroy(cl->un.leaf.q);
1289 qdisc_put_rtab(cl->rate);
1290 qdisc_put_rtab(cl->ceil);
1292 htb_destroy_filters(&cl->filter_list);
1294 while (!list_empty(&cl->children))
1295 htb_destroy_class(sch, list_entry(cl->children.next,
1296 struct htb_class, sibling));
1298 /* note: this delete may happen twice (see htb_delete) */
1299 hlist_del_init(&cl->hlist);
1300 list_del(&cl->sibling);
1302 if (cl->prio_activity)
1303 htb_deactivate(q, cl);
1305 if (cl->cmode != HTB_CAN_SEND)
1306 htb_safe_rb_erase(&cl->pq_node, q->wait_pq + cl->level);
1311 /* always caled under BH & queue lock */
1312 static void htb_destroy(struct Qdisc *sch)
1314 struct htb_sched *q = qdisc_priv(sch);
1316 qdisc_watchdog_cancel(&q->watchdog);
1318 del_timer_sync(&q->rttim);
1320 /* This line used to be after htb_destroy_class call below
1321 and surprisingly it worked in 2.4. But it must precede it
1322 because filter need its target class alive to be able to call
1323 unbind_filter on it (without Oops). */
1324 htb_destroy_filters(&q->filter_list);
1326 while (!list_empty(&q->root))
1327 htb_destroy_class(sch, list_entry(q->root.next,
1328 struct htb_class, sibling));
1330 __skb_queue_purge(&q->direct_queue);
1333 static int htb_delete(struct Qdisc *sch, unsigned long arg)
1335 struct htb_sched *q = qdisc_priv(sch);
1336 struct htb_class *cl = (struct htb_class *)arg;
1338 struct Qdisc *new_q = NULL;
1341 // TODO: why don't allow to delete subtree ? references ? does
1342 // tc subsys quarantee us that in htb_destroy it holds no class
1343 // refs so that we can remove children safely there ?
1344 if (!list_empty(&cl->children) || cl->filter_cnt)
1347 if (!cl->level && htb_parent_last_child(cl)) {
1348 new_q = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops,
1349 cl->parent->classid);
1356 qlen = cl->un.leaf.q->q.qlen;
1357 qdisc_reset(cl->un.leaf.q);
1358 qdisc_tree_decrease_qlen(cl->un.leaf.q, qlen);
1361 /* delete from hash and active; remainder in destroy_class */
1362 hlist_del_init(&cl->hlist);
1364 if (cl->prio_activity)
1365 htb_deactivate(q, cl);
1368 htb_parent_to_leaf(cl, new_q);
1370 if (--cl->refcnt == 0)
1371 htb_destroy_class(sch, cl);
1373 sch_tree_unlock(sch);
1377 static void htb_put(struct Qdisc *sch, unsigned long arg)
1379 struct htb_class *cl = (struct htb_class *)arg;
1381 if (--cl->refcnt == 0)
1382 htb_destroy_class(sch, cl);
1385 static int htb_change_class(struct Qdisc *sch, u32 classid,
1386 u32 parentid, struct rtattr **tca,
1390 struct htb_sched *q = qdisc_priv(sch);
1391 struct htb_class *cl = (struct htb_class *)*arg, *parent;
1392 struct rtattr *opt = tca[TCA_OPTIONS - 1];
1393 struct qdisc_rate_table *rtab = NULL, *ctab = NULL;
1394 struct rtattr *tb[TCA_HTB_RTAB];
1395 struct tc_htb_opt *hopt;
1397 /* extract all subattrs from opt attr */
1398 if (!opt || rtattr_parse_nested(tb, TCA_HTB_RTAB, opt) ||
1399 tb[TCA_HTB_PARMS - 1] == NULL ||
1400 RTA_PAYLOAD(tb[TCA_HTB_PARMS - 1]) < sizeof(*hopt))
1403 parent = parentid == TC_H_ROOT ? NULL : htb_find(parentid, sch);
1405 hopt = RTA_DATA(tb[TCA_HTB_PARMS - 1]);
1407 rtab = qdisc_get_rtab(&hopt->rate, tb[TCA_HTB_RTAB - 1]);
1408 ctab = qdisc_get_rtab(&hopt->ceil, tb[TCA_HTB_CTAB - 1]);
1412 if (!cl) { /* new class */
1413 struct Qdisc *new_q;
1416 /* check for valid classid */
1417 if (!classid || TC_H_MAJ(classid ^ sch->handle)
1418 || htb_find(classid, sch))
1421 /* check maximal depth */
1422 if (parent && parent->parent && parent->parent->level < 2) {
1423 printk(KERN_ERR "htb: tree is too deep\n");
1427 if ((cl = kzalloc(sizeof(*cl), GFP_KERNEL)) == NULL)
1431 INIT_LIST_HEAD(&cl->sibling);
1432 INIT_HLIST_NODE(&cl->hlist);
1433 INIT_LIST_HEAD(&cl->children);
1434 INIT_LIST_HEAD(&cl->un.leaf.drop_list);
1435 RB_CLEAR_NODE(&cl->pq_node);
1437 for (prio = 0; prio < TC_HTB_NUMPRIO; prio++)
1438 RB_CLEAR_NODE(&cl->node[prio]);
1440 /* create leaf qdisc early because it uses kmalloc(GFP_KERNEL)
1441 so that can't be used inside of sch_tree_lock
1442 -- thanks to Karlis Peisenieks */
1443 new_q = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops, classid);
1445 if (parent && !parent->level) {
1446 unsigned int qlen = parent->un.leaf.q->q.qlen;
1448 /* turn parent into inner node */
1449 qdisc_reset(parent->un.leaf.q);
1450 qdisc_tree_decrease_qlen(parent->un.leaf.q, qlen);
1451 qdisc_destroy(parent->un.leaf.q);
1452 if (parent->prio_activity)
1453 htb_deactivate(q, parent);
1455 /* remove from evt list because of level change */
1456 if (parent->cmode != HTB_CAN_SEND) {
1457 htb_safe_rb_erase(&parent->pq_node, q->wait_pq);
1458 parent->cmode = HTB_CAN_SEND;
1460 parent->level = (parent->parent ? parent->parent->level
1461 : TC_HTB_MAXDEPTH) - 1;
1462 memset(&parent->un.inner, 0, sizeof(parent->un.inner));
1464 /* leaf (we) needs elementary qdisc */
1465 cl->un.leaf.q = new_q ? new_q : &noop_qdisc;
1467 cl->classid = classid;
1468 cl->parent = parent;
1470 /* set class to be in HTB_CAN_SEND state */
1471 cl->tokens = hopt->buffer;
1472 cl->ctokens = hopt->cbuffer;
1473 cl->mbuffer = 60 * PSCHED_TICKS_PER_SEC; /* 1min */
1474 PSCHED_GET_TIME(cl->t_c);
1475 cl->cmode = HTB_CAN_SEND;
1477 /* attach to the hash list and parent's family */
1478 hlist_add_head(&cl->hlist, q->hash + htb_hash(classid));
1479 list_add_tail(&cl->sibling,
1480 parent ? &parent->children : &q->root);
1484 /* it used to be a nasty bug here, we have to check that node
1485 is really leaf before changing cl->un.leaf ! */
1487 cl->un.leaf.quantum = rtab->rate.rate / q->rate2quantum;
1488 if (!hopt->quantum && cl->un.leaf.quantum < 1000) {
1490 "HTB: quantum of class %X is small. Consider r2q change.\n",
1492 cl->un.leaf.quantum = 1000;
1494 if (!hopt->quantum && cl->un.leaf.quantum > 200000) {
1496 "HTB: quantum of class %X is big. Consider r2q change.\n",
1498 cl->un.leaf.quantum = 200000;
1501 cl->un.leaf.quantum = hopt->quantum;
1502 if ((cl->un.leaf.prio = hopt->prio) >= TC_HTB_NUMPRIO)
1503 cl->un.leaf.prio = TC_HTB_NUMPRIO - 1;
1505 /* backup for htb_parent_to_leaf */
1506 cl->quantum = cl->un.leaf.quantum;
1507 cl->prio = cl->un.leaf.prio;
1510 cl->buffer = hopt->buffer;
1511 cl->cbuffer = hopt->cbuffer;
1513 qdisc_put_rtab(cl->rate);
1516 qdisc_put_rtab(cl->ceil);
1518 sch_tree_unlock(sch);
1520 *arg = (unsigned long)cl;
1525 qdisc_put_rtab(rtab);
1527 qdisc_put_rtab(ctab);
1531 static struct tcf_proto **htb_find_tcf(struct Qdisc *sch, unsigned long arg)
1533 struct htb_sched *q = qdisc_priv(sch);
1534 struct htb_class *cl = (struct htb_class *)arg;
1535 struct tcf_proto **fl = cl ? &cl->filter_list : &q->filter_list;
1540 static unsigned long htb_bind_filter(struct Qdisc *sch, unsigned long parent,
1543 struct htb_sched *q = qdisc_priv(sch);
1544 struct htb_class *cl = htb_find(classid, sch);
1546 /*if (cl && !cl->level) return 0;
1547 The line above used to be there to prevent attaching filters to
1548 leaves. But at least tc_index filter uses this just to get class
1549 for other reasons so that we have to allow for it.
1551 19.6.2002 As Werner explained it is ok - bind filter is just
1552 another way to "lock" the class - unlike "get" this lock can
1553 be broken by class during destroy IIUC.
1559 return (unsigned long)cl;
1562 static void htb_unbind_filter(struct Qdisc *sch, unsigned long arg)
1564 struct htb_sched *q = qdisc_priv(sch);
1565 struct htb_class *cl = (struct htb_class *)arg;
1573 static void htb_walk(struct Qdisc *sch, struct qdisc_walker *arg)
1575 struct htb_sched *q = qdisc_priv(sch);
1581 for (i = 0; i < HTB_HSIZE; i++) {
1582 struct hlist_node *p;
1583 struct htb_class *cl;
1585 hlist_for_each_entry(cl, p, q->hash + i, hlist) {
1586 if (arg->count < arg->skip) {
1590 if (arg->fn(sch, (unsigned long)cl, arg) < 0) {
1599 static struct Qdisc_class_ops htb_class_ops = {
1602 .qlen_notify = htb_qlen_notify,
1605 .change = htb_change_class,
1606 .delete = htb_delete,
1608 .tcf_chain = htb_find_tcf,
1609 .bind_tcf = htb_bind_filter,
1610 .unbind_tcf = htb_unbind_filter,
1611 .dump = htb_dump_class,
1612 .dump_stats = htb_dump_class_stats,
1615 static struct Qdisc_ops htb_qdisc_ops = {
1617 .cl_ops = &htb_class_ops,
1619 .priv_size = sizeof(struct htb_sched),
1620 .enqueue = htb_enqueue,
1621 .dequeue = htb_dequeue,
1622 .requeue = htb_requeue,
1626 .destroy = htb_destroy,
1627 .change = NULL /* htb_change */,
1629 .owner = THIS_MODULE,
1632 static int __init htb_module_init(void)
1634 return register_qdisc(&htb_qdisc_ops);
1636 static void __exit htb_module_exit(void)
1638 unregister_qdisc(&htb_qdisc_ops);
1641 module_init(htb_module_init)
1642 module_exit(htb_module_exit)
1643 MODULE_LICENSE("GPL");