blob: 6febd245e62b349b061674986a13b826cff8e02a [file] [log] [blame]
Stephen Hemminger87990462006-08-10 23:35:16 -07001/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * net/sched/sch_htb.c Hierarchical token bucket, feed tree version
3 *
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.
8 *
9 * Authors: Martin Devera, <devik@cdi.cz>
10 *
11 * Credits (in time order) for older HTB versions:
12 * Stef Coene <stef.coene@docum.org>
13 * HTB support at LARTC mailing list
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +090014 * Ondrej Kraus, <krauso@barr.cz>
Linus Torvalds1da177e2005-04-16 15:20:36 -070015 * 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
22 * Wilfried Weissmann
23 * spotted bug in dequeue code and helped with fix
24 * Jiri Fojtasek
25 * fixed requeue routine
26 * and many others. thanks.
Linus Torvalds1da177e2005-04-16 15:20:36 -070027 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070028#include <linux/module.h>
Jesper Dangaard Brouer47083fc2008-06-16 16:39:32 -070029#include <linux/moduleparam.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070030#include <linux/types.h>
31#include <linux/kernel.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070032#include <linux/string.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070033#include <linux/errno.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070034#include <linux/skbuff.h>
35#include <linux/list.h>
36#include <linux/compiler.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070037#include <linux/rbtree.h>
Patrick McHardy0ba48052007-07-02 22:49:07 -070038#include <net/netlink.h>
39#include <net/pkt_sched.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070040
41/* HTB algorithm.
42 Author: devik@cdi.cz
43 ========================================================================
44 HTB is like TBF with multiple classes. It is also similar to CBQ because
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +090045 it allows to assign priority to each class in hierarchy.
Linus Torvalds1da177e2005-04-16 15:20:36 -070046 In fact it is another implementation of Floyd's formal sharing.
47
48 Levels:
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +090049 Each class is assigned level. Leaf has ALWAYS level 0 and root
Linus Torvalds1da177e2005-04-16 15:20:36 -070050 classes have level TC_HTB_MAXDEPTH-1. Interior nodes has level
51 one less than their parent.
52*/
53
Jesper Dangaard Brouer47083fc2008-06-16 16:39:32 -070054static int htb_hysteresis __read_mostly = 0; /* whether to use mode hysteresis for speedup */
Stephen Hemminger87990462006-08-10 23:35:16 -070055#define HTB_VER 0x30011 /* major must be matched with number suplied by TC as version */
Linus Torvalds1da177e2005-04-16 15:20:36 -070056
57#if HTB_VER >> 16 != TC_HTB_PROTOVER
58#error "Mismatched sch_htb.c and pkt_sch.h"
59#endif
60
Jesper Dangaard Brouer47083fc2008-06-16 16:39:32 -070061/* Module parameter and sysfs export */
62module_param (htb_hysteresis, int, 0640);
63MODULE_PARM_DESC(htb_hysteresis, "Hysteresis mode, less CPU load, less accurate");
64
Linus Torvalds1da177e2005-04-16 15:20:36 -070065/* used internaly to keep status of single class */
66enum htb_cmode {
Stephen Hemminger87990462006-08-10 23:35:16 -070067 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 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070070};
71
72/* interior & leaf nodes; props specific to leaves are marked L: */
Stephen Hemminger87990462006-08-10 23:35:16 -070073struct htb_class {
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -070074 struct Qdisc_class_common common;
Stephen Hemminger87990462006-08-10 23:35:16 -070075 /* general class parameters */
Stephen Hemminger87990462006-08-10 23:35:16 -070076 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 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070081
Stephen Hemminger87990462006-08-10 23:35:16 -070082 /* topology */
83 int level; /* our level (see above) */
Patrick McHardy42077592008-07-05 23:22:53 -070084 unsigned int children;
Stephen Hemminger87990462006-08-10 23:35:16 -070085 struct htb_class *parent; /* parent class */
Linus Torvalds1da177e2005-04-16 15:20:36 -070086
Stephen Hemminger87990462006-08-10 23:35:16 -070087 union {
88 struct htb_class_leaf {
89 struct Qdisc *q;
90 int prio;
91 int aprio;
92 int quantum;
93 int deficit[TC_HTB_MAXDEPTH];
94 struct list_head drop_list;
95 } leaf;
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];
104 } inner;
105 } un;
106 struct rb_node node[TC_HTB_NUMPRIO]; /* node for self or feed tree */
107 struct rb_node pq_node; /* node for event queue */
Patrick McHardyfb983d42007-03-16 01:22:39 -0700108 psched_time_t pq_key;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109
Stephen Hemminger87990462006-08-10 23:35:16 -0700110 int prio_activity; /* for which prios are we active */
111 enum htb_cmode cmode; /* current mode of the class */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112
Stephen Hemminger87990462006-08-10 23:35:16 -0700113 /* class attached filters */
114 struct tcf_proto *filter_list;
115 int filter_cnt;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116
Stephen Hemminger87990462006-08-10 23:35:16 -0700117 int warned; /* only one warning about non work conserving .. */
118
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 */
Jarek Poplawski160d5e12006-12-08 00:26:56 -0800126
127 int prio; /* For parent to leaf return possible here */
128 int quantum; /* we do backup. Finally full replacement */
129 /* of un.leaf originals should be done. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130};
131
Stephen Hemminger87990462006-08-10 23:35:16 -0700132static inline long L2T(struct htb_class *cl, struct qdisc_rate_table *rate,
133 int size)
134{
Jesper Dangaard Brouere9bef552007-09-12 16:35:24 +0200135 long result = qdisc_l2t(rate, size);
136 return result;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137}
138
Stephen Hemminger87990462006-08-10 23:35:16 -0700139struct htb_sched {
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700140 struct Qdisc_class_hash clhash;
Stephen Hemminger0cef2962006-08-10 23:35:38 -0700141 struct list_head drops[TC_HTB_NUMPRIO];/* active leaves (for drops) */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142
Stephen Hemminger87990462006-08-10 23:35:16 -0700143 /* self list - roots of self generating tree */
144 struct rb_root row[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
145 int row_mask[TC_HTB_MAXDEPTH];
146 struct rb_node *ptr[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
147 u32 last_ptr_id[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148
Stephen Hemminger87990462006-08-10 23:35:16 -0700149 /* self wait list - roots of wait PQs per row */
150 struct rb_root wait_pq[TC_HTB_MAXDEPTH];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151
Stephen Hemminger87990462006-08-10 23:35:16 -0700152 /* time of nearest event per level (row) */
Patrick McHardyfb983d42007-03-16 01:22:39 -0700153 psched_time_t near_ev_cache[TC_HTB_MAXDEPTH];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700154
Stephen Hemminger87990462006-08-10 23:35:16 -0700155 /* whether we hit non-work conserving class during this dequeue; we use */
156 int nwc_hit; /* this to disable mindelay complaint in dequeue */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157
Stephen Hemminger87990462006-08-10 23:35:16 -0700158 int defcls; /* class where unclassified flows go to */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159
Stephen Hemminger87990462006-08-10 23:35:16 -0700160 /* filters for qdisc itself */
161 struct tcf_proto *filter_list;
Stephen Hemminger87990462006-08-10 23:35:16 -0700162
163 int rate2quantum; /* quant = rate / rate2quantum */
164 psched_time_t now; /* cached dequeue time */
Patrick McHardyfb983d42007-03-16 01:22:39 -0700165 struct qdisc_watchdog watchdog;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166
Stephen Hemminger87990462006-08-10 23:35:16 -0700167 /* non shaped skbs; let them go directly thru */
168 struct sk_buff_head direct_queue;
169 int direct_qlen; /* max qlen of above */
170
171 long direct_pkts;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172};
173
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174/* find class in global hash table using given handle */
Stephen Hemminger87990462006-08-10 23:35:16 -0700175static inline struct htb_class *htb_find(u32 handle, struct Qdisc *sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176{
177 struct htb_sched *q = qdisc_priv(sch);
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700178 struct Qdisc_class_common *clc;
Stephen Hemminger0cef2962006-08-10 23:35:38 -0700179
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700180 clc = qdisc_class_find(&q->clhash, handle);
181 if (clc == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182 return NULL;
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700183 return container_of(clc, struct htb_class, common);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184}
185
186/**
187 * htb_classify - classify a packet into class
188 *
189 * It returns NULL if the packet should be dropped or -1 if the packet
190 * should be passed directly thru. In all other cases leaf class is returned.
191 * We allow direct class selection by classid in priority. The we examine
192 * filters in qdisc and in inner nodes (if higher filter points to the inner
193 * node). If we end up with classid MAJOR:0 we enqueue the skb into special
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900194 * internal fifo (direct). These packets then go directly thru. If we still
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessfull
196 * then finish and return direct queue.
197 */
198#define HTB_DIRECT (struct htb_class*)-1
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199
Stephen Hemminger87990462006-08-10 23:35:16 -0700200static struct htb_class *htb_classify(struct sk_buff *skb, struct Qdisc *sch,
201 int *qerr)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202{
203 struct htb_sched *q = qdisc_priv(sch);
204 struct htb_class *cl;
205 struct tcf_result res;
206 struct tcf_proto *tcf;
207 int result;
208
209 /* allow to select class by setting skb->priority to valid classid;
210 note that nfmark can be used too by attaching filter fw with no
211 rules in it */
212 if (skb->priority == sch->handle)
Stephen Hemminger87990462006-08-10 23:35:16 -0700213 return HTB_DIRECT; /* X:0 (direct flow) selected */
214 if ((cl = htb_find(skb->priority, sch)) != NULL && cl->level == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 return cl;
216
Jarek Poplawskic27f3392008-08-04 22:39:11 -0700217 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700218 tcf = q->filter_list;
219 while (tcf && (result = tc_classify(skb, tcf, &res)) >= 0) {
220#ifdef CONFIG_NET_CLS_ACT
221 switch (result) {
222 case TC_ACT_QUEUED:
Stephen Hemminger87990462006-08-10 23:35:16 -0700223 case TC_ACT_STOLEN:
Jarek Poplawski378a2f02008-08-04 22:31:03 -0700224 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225 case TC_ACT_SHOT:
226 return NULL;
227 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228#endif
Stephen Hemminger87990462006-08-10 23:35:16 -0700229 if ((cl = (void *)res.class) == NULL) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700230 if (res.classid == sch->handle)
Stephen Hemminger87990462006-08-10 23:35:16 -0700231 return HTB_DIRECT; /* X:0 (direct flow) */
232 if ((cl = htb_find(res.classid, sch)) == NULL)
233 break; /* filter selected invalid classid */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234 }
235 if (!cl->level)
Stephen Hemminger87990462006-08-10 23:35:16 -0700236 return cl; /* we hit leaf; return it */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700237
238 /* we have got inner class; apply inner filter chain */
239 tcf = cl->filter_list;
240 }
241 /* classification failed; try to use default class */
Stephen Hemminger87990462006-08-10 23:35:16 -0700242 cl = htb_find(TC_H_MAKE(TC_H_MAJ(sch->handle), q->defcls), sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243 if (!cl || cl->level)
Stephen Hemminger87990462006-08-10 23:35:16 -0700244 return HTB_DIRECT; /* bad default .. this is safe bet */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245 return cl;
246}
247
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248/**
249 * htb_add_to_id_tree - adds class to the round robin list
250 *
251 * Routine adds class to the list (actually tree) sorted by classid.
252 * Make sure that class is not already on such list for given prio.
253 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700254static void htb_add_to_id_tree(struct rb_root *root,
255 struct htb_class *cl, int prio)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700256{
257 struct rb_node **p = &root->rb_node, *parent = NULL;
Stephen Hemminger3bf72952006-08-10 23:31:08 -0700258
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259 while (*p) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700260 struct htb_class *c;
261 parent = *p;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262 c = rb_entry(parent, struct htb_class, node[prio]);
Stephen Hemminger3bf72952006-08-10 23:31:08 -0700263
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700264 if (cl->common.classid > c->common.classid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265 p = &parent->rb_right;
Stephen Hemminger87990462006-08-10 23:35:16 -0700266 else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267 p = &parent->rb_left;
268 }
269 rb_link_node(&cl->node[prio], parent, p);
270 rb_insert_color(&cl->node[prio], root);
271}
272
273/**
274 * htb_add_to_wait_tree - adds class to the event queue with delay
275 *
276 * The class is added to priority event queue to indicate that class will
277 * change its mode in cl->pq_key microseconds. Make sure that class is not
278 * already in the queue.
279 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700280static void htb_add_to_wait_tree(struct htb_sched *q,
281 struct htb_class *cl, long delay)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282{
283 struct rb_node **p = &q->wait_pq[cl->level].rb_node, *parent = NULL;
Stephen Hemminger3bf72952006-08-10 23:31:08 -0700284
Patrick McHardyfb983d42007-03-16 01:22:39 -0700285 cl->pq_key = q->now + delay;
286 if (cl->pq_key == q->now)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287 cl->pq_key++;
288
289 /* update the nearest event cache */
Patrick McHardyfb983d42007-03-16 01:22:39 -0700290 if (q->near_ev_cache[cl->level] > cl->pq_key)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291 q->near_ev_cache[cl->level] = cl->pq_key;
Stephen Hemminger87990462006-08-10 23:35:16 -0700292
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293 while (*p) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700294 struct htb_class *c;
295 parent = *p;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296 c = rb_entry(parent, struct htb_class, pq_node);
Patrick McHardyfb983d42007-03-16 01:22:39 -0700297 if (cl->pq_key >= c->pq_key)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298 p = &parent->rb_right;
Stephen Hemminger87990462006-08-10 23:35:16 -0700299 else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700300 p = &parent->rb_left;
301 }
302 rb_link_node(&cl->pq_node, parent, p);
303 rb_insert_color(&cl->pq_node, &q->wait_pq[cl->level]);
304}
305
306/**
307 * htb_next_rb_node - finds next node in binary tree
308 *
309 * When we are past last key we return NULL.
310 * Average complexity is 2 steps per call.
311 */
Stephen Hemminger3696f622006-08-10 23:36:01 -0700312static inline void htb_next_rb_node(struct rb_node **n)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313{
314 *n = rb_next(*n);
315}
316
317/**
318 * htb_add_class_to_row - add class to its row
319 *
320 * The class is added to row at priorities marked in mask.
321 * It does nothing if mask == 0.
322 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700323static inline void htb_add_class_to_row(struct htb_sched *q,
324 struct htb_class *cl, int mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326 q->row_mask[cl->level] |= mask;
327 while (mask) {
328 int prio = ffz(~mask);
329 mask &= ~(1 << prio);
Stephen Hemminger87990462006-08-10 23:35:16 -0700330 htb_add_to_id_tree(q->row[cl->level] + prio, cl, prio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700331 }
332}
333
Stephen Hemminger3696f622006-08-10 23:36:01 -0700334/* If this triggers, it is a bug in this code, but it need not be fatal */
335static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root)
336{
Ismail Donmez81771b32006-10-03 13:49:10 -0700337 if (RB_EMPTY_NODE(rb)) {
Stephen Hemminger3696f622006-08-10 23:36:01 -0700338 WARN_ON(1);
339 } else {
340 rb_erase(rb, root);
341 RB_CLEAR_NODE(rb);
342 }
343}
344
345
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346/**
347 * htb_remove_class_from_row - removes class from its row
348 *
349 * The class is removed from row at priorities marked in mask.
350 * It does nothing if mask == 0.
351 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700352static inline void htb_remove_class_from_row(struct htb_sched *q,
353 struct htb_class *cl, int mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700354{
355 int m = 0;
Stephen Hemminger3bf72952006-08-10 23:31:08 -0700356
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357 while (mask) {
358 int prio = ffz(~mask);
Stephen Hemminger3696f622006-08-10 23:36:01 -0700359
Linus Torvalds1da177e2005-04-16 15:20:36 -0700360 mask &= ~(1 << prio);
Stephen Hemminger87990462006-08-10 23:35:16 -0700361 if (q->ptr[cl->level][prio] == cl->node + prio)
362 htb_next_rb_node(q->ptr[cl->level] + prio);
Stephen Hemminger3696f622006-08-10 23:36:01 -0700363
364 htb_safe_rb_erase(cl->node + prio, q->row[cl->level] + prio);
Stephen Hemminger87990462006-08-10 23:35:16 -0700365 if (!q->row[cl->level][prio].rb_node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700366 m |= 1 << prio;
367 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700368 q->row_mask[cl->level] &= ~m;
369}
370
371/**
372 * htb_activate_prios - creates active classe's feed chain
373 *
374 * The class is connected to ancestors and/or appropriate rows
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900375 * for priorities it is participating on. cl->cmode must be new
Linus Torvalds1da177e2005-04-16 15:20:36 -0700376 * (activated) mode. It does nothing if cl->prio_activity == 0.
377 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700378static void htb_activate_prios(struct htb_sched *q, struct htb_class *cl)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700379{
380 struct htb_class *p = cl->parent;
Stephen Hemminger87990462006-08-10 23:35:16 -0700381 long m, mask = cl->prio_activity;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700382
383 while (cl->cmode == HTB_MAY_BORROW && p && mask) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700384 m = mask;
385 while (m) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386 int prio = ffz(~m);
387 m &= ~(1 << prio);
Stephen Hemminger87990462006-08-10 23:35:16 -0700388
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389 if (p->un.inner.feed[prio].rb_node)
390 /* parent already has its feed in use so that
391 reset bit in mask as parent is already ok */
392 mask &= ~(1 << prio);
Stephen Hemminger87990462006-08-10 23:35:16 -0700393
394 htb_add_to_id_tree(p->un.inner.feed + prio, cl, prio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700395 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700396 p->prio_activity |= mask;
Stephen Hemminger87990462006-08-10 23:35:16 -0700397 cl = p;
398 p = cl->parent;
Stephen Hemminger3bf72952006-08-10 23:31:08 -0700399
Linus Torvalds1da177e2005-04-16 15:20:36 -0700400 }
401 if (cl->cmode == HTB_CAN_SEND && mask)
Stephen Hemminger87990462006-08-10 23:35:16 -0700402 htb_add_class_to_row(q, cl, mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403}
404
405/**
406 * htb_deactivate_prios - remove class from feed chain
407 *
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900408 * cl->cmode must represent old mode (before deactivation). It does
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409 * nothing if cl->prio_activity == 0. Class is removed from all feed
410 * chains and rows.
411 */
412static void htb_deactivate_prios(struct htb_sched *q, struct htb_class *cl)
413{
414 struct htb_class *p = cl->parent;
Stephen Hemminger87990462006-08-10 23:35:16 -0700415 long m, mask = cl->prio_activity;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700416
417 while (cl->cmode == HTB_MAY_BORROW && p && mask) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700418 m = mask;
419 mask = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700420 while (m) {
421 int prio = ffz(~m);
422 m &= ~(1 << prio);
Stephen Hemminger87990462006-08-10 23:35:16 -0700423
424 if (p->un.inner.ptr[prio] == cl->node + prio) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425 /* we are removing child which is pointed to from
426 parent feed - forget the pointer but remember
427 classid */
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700428 p->un.inner.last_ptr_id[prio] = cl->common.classid;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429 p->un.inner.ptr[prio] = NULL;
430 }
Stephen Hemminger87990462006-08-10 23:35:16 -0700431
Stephen Hemminger3696f622006-08-10 23:36:01 -0700432 htb_safe_rb_erase(cl->node + prio, p->un.inner.feed + prio);
Stephen Hemminger87990462006-08-10 23:35:16 -0700433
434 if (!p->un.inner.feed[prio].rb_node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435 mask |= 1 << prio;
436 }
Stephen Hemminger3bf72952006-08-10 23:31:08 -0700437
Linus Torvalds1da177e2005-04-16 15:20:36 -0700438 p->prio_activity &= ~mask;
Stephen Hemminger87990462006-08-10 23:35:16 -0700439 cl = p;
440 p = cl->parent;
Stephen Hemminger3bf72952006-08-10 23:31:08 -0700441
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442 }
Stephen Hemminger87990462006-08-10 23:35:16 -0700443 if (cl->cmode == HTB_CAN_SEND && mask)
444 htb_remove_class_from_row(q, cl, mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700445}
446
Stephen Hemminger18a63e82006-08-10 23:34:02 -0700447static inline long htb_lowater(const struct htb_class *cl)
448{
Jesper Dangaard Brouer47083fc2008-06-16 16:39:32 -0700449 if (htb_hysteresis)
450 return cl->cmode != HTB_CANT_SEND ? -cl->cbuffer : 0;
451 else
452 return 0;
Stephen Hemminger18a63e82006-08-10 23:34:02 -0700453}
454static inline long htb_hiwater(const struct htb_class *cl)
455{
Jesper Dangaard Brouer47083fc2008-06-16 16:39:32 -0700456 if (htb_hysteresis)
457 return cl->cmode == HTB_CAN_SEND ? -cl->buffer : 0;
458 else
459 return 0;
Stephen Hemminger18a63e82006-08-10 23:34:02 -0700460}
Jesper Dangaard Brouer47083fc2008-06-16 16:39:32 -0700461
Stephen Hemminger18a63e82006-08-10 23:34:02 -0700462
Linus Torvalds1da177e2005-04-16 15:20:36 -0700463/**
464 * htb_class_mode - computes and returns current class mode
465 *
466 * It computes cl's mode at time cl->t_c+diff and returns it. If mode
467 * is not HTB_CAN_SEND then cl->pq_key is updated to time difference
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900468 * from now to time when cl will change its state.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700469 * Also it is worth to note that class mode doesn't change simply
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900470 * at cl->{c,}tokens == 0 but there can rather be hysteresis of
Linus Torvalds1da177e2005-04-16 15:20:36 -0700471 * 0 .. -cl->{c,}buffer range. It is meant to limit number of
472 * mode transitions per time unit. The speed gain is about 1/6.
473 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700474static inline enum htb_cmode
475htb_class_mode(struct htb_class *cl, long *diff)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476{
Stephen Hemminger87990462006-08-10 23:35:16 -0700477 long toks;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478
Stephen Hemminger87990462006-08-10 23:35:16 -0700479 if ((toks = (cl->ctokens + *diff)) < htb_lowater(cl)) {
480 *diff = -toks;
481 return HTB_CANT_SEND;
482 }
Stephen Hemminger18a63e82006-08-10 23:34:02 -0700483
Stephen Hemminger87990462006-08-10 23:35:16 -0700484 if ((toks = (cl->tokens + *diff)) >= htb_hiwater(cl))
485 return HTB_CAN_SEND;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700486
Stephen Hemminger87990462006-08-10 23:35:16 -0700487 *diff = -toks;
488 return HTB_MAY_BORROW;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489}
490
491/**
492 * htb_change_class_mode - changes classe's mode
493 *
494 * This should be the only way how to change classe's mode under normal
495 * cirsumstances. Routine will update feed lists linkage, change mode
496 * and add class to the wait event queue if appropriate. New mode should
497 * be different from old one and cl->pq_key has to be valid if changing
498 * to mode other than HTB_CAN_SEND (see htb_add_to_wait_tree).
499 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700500static void
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501htb_change_class_mode(struct htb_sched *q, struct htb_class *cl, long *diff)
Stephen Hemminger87990462006-08-10 23:35:16 -0700502{
503 enum htb_cmode new_mode = htb_class_mode(cl, diff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700504
505 if (new_mode == cl->cmode)
Stephen Hemminger87990462006-08-10 23:35:16 -0700506 return;
507
508 if (cl->prio_activity) { /* not necessary: speed optimization */
509 if (cl->cmode != HTB_CANT_SEND)
510 htb_deactivate_prios(q, cl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511 cl->cmode = new_mode;
Stephen Hemminger87990462006-08-10 23:35:16 -0700512 if (new_mode != HTB_CANT_SEND)
513 htb_activate_prios(q, cl);
514 } else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515 cl->cmode = new_mode;
516}
517
518/**
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900519 * htb_activate - inserts leaf cl into appropriate active feeds
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 *
521 * Routine learns (new) priority of leaf and activates feed chain
522 * for the prio. It can be called on already active leaf safely.
523 * It also adds leaf into droplist.
524 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700525static inline void htb_activate(struct htb_sched *q, struct htb_class *cl)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700526{
Ilpo Järvinen547b7922008-07-25 21:43:18 -0700527 WARN_ON(cl->level || !cl->un.leaf.q || !cl->un.leaf.q->q.qlen);
Stephen Hemminger3bf72952006-08-10 23:31:08 -0700528
Linus Torvalds1da177e2005-04-16 15:20:36 -0700529 if (!cl->prio_activity) {
530 cl->prio_activity = 1 << (cl->un.leaf.aprio = cl->un.leaf.prio);
Stephen Hemminger87990462006-08-10 23:35:16 -0700531 htb_activate_prios(q, cl);
532 list_add_tail(&cl->un.leaf.drop_list,
533 q->drops + cl->un.leaf.aprio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700534 }
535}
536
537/**
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900538 * htb_deactivate - remove leaf cl from active feeds
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539 *
540 * Make sure that leaf is active. In the other words it can't be called
541 * with non-active leaf. It also removes class from the drop list.
542 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700543static inline void htb_deactivate(struct htb_sched *q, struct htb_class *cl)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700544{
Ilpo Järvinen547b7922008-07-25 21:43:18 -0700545 WARN_ON(!cl->prio_activity);
Stephen Hemminger3bf72952006-08-10 23:31:08 -0700546
Stephen Hemminger87990462006-08-10 23:35:16 -0700547 htb_deactivate_prios(q, cl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700548 cl->prio_activity = 0;
549 list_del_init(&cl->un.leaf.drop_list);
550}
551
552static int htb_enqueue(struct sk_buff *skb, struct Qdisc *sch)
553{
Stephen Hemminger87990462006-08-10 23:35:16 -0700554 int ret;
555 struct htb_sched *q = qdisc_priv(sch);
556 struct htb_class *cl = htb_classify(skb, sch, &ret);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700557
Stephen Hemminger87990462006-08-10 23:35:16 -0700558 if (cl == HTB_DIRECT) {
559 /* enqueue to helper queue */
560 if (q->direct_queue.qlen < q->direct_qlen) {
561 __skb_queue_tail(&q->direct_queue, skb);
562 q->direct_pkts++;
563 } else {
564 kfree_skb(skb);
565 sch->qstats.drops++;
566 return NET_XMIT_DROP;
567 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700568#ifdef CONFIG_NET_CLS_ACT
Stephen Hemminger87990462006-08-10 23:35:16 -0700569 } else if (!cl) {
Jarek Poplawskic27f3392008-08-04 22:39:11 -0700570 if (ret & __NET_XMIT_BYPASS)
Stephen Hemminger87990462006-08-10 23:35:16 -0700571 sch->qstats.drops++;
572 kfree_skb(skb);
573 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700574#endif
Jarek Poplawski378a2f02008-08-04 22:31:03 -0700575 } else if ((ret = qdisc_enqueue(skb, cl->un.leaf.q)) != NET_XMIT_SUCCESS) {
576 if (net_xmit_drop_count(ret)) {
577 sch->qstats.drops++;
578 cl->qstats.drops++;
579 }
Stephen Hemminger87990462006-08-10 23:35:16 -0700580 return NET_XMIT_DROP;
581 } else {
Ranjit Manomohanc9726d62007-07-10 22:43:16 -0700582 cl->bstats.packets +=
583 skb_is_gso(skb)?skb_shinfo(skb)->gso_segs:1;
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700584 cl->bstats.bytes += qdisc_pkt_len(skb);
Stephen Hemminger87990462006-08-10 23:35:16 -0700585 htb_activate(q, cl);
586 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587
Stephen Hemminger87990462006-08-10 23:35:16 -0700588 sch->q.qlen++;
Ranjit Manomohanc9726d62007-07-10 22:43:16 -0700589 sch->bstats.packets += skb_is_gso(skb)?skb_shinfo(skb)->gso_segs:1;
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700590 sch->bstats.bytes += qdisc_pkt_len(skb);
Stephen Hemminger87990462006-08-10 23:35:16 -0700591 return NET_XMIT_SUCCESS;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700592}
593
594/* TODO: requeuing packet charges it to policers again !! */
595static int htb_requeue(struct sk_buff *skb, struct Qdisc *sch)
596{
Jarek Poplawski21347452008-02-09 23:44:00 -0800597 int ret;
Stephen Hemminger87990462006-08-10 23:35:16 -0700598 struct htb_sched *q = qdisc_priv(sch);
Stephen Hemminger87990462006-08-10 23:35:16 -0700599 struct htb_class *cl = htb_classify(skb, sch, &ret);
600 struct sk_buff *tskb;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700601
Jarek Poplawski21347452008-02-09 23:44:00 -0800602 if (cl == HTB_DIRECT) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700603 /* enqueue to helper queue */
Jarek Poplawski21347452008-02-09 23:44:00 -0800604 if (q->direct_queue.qlen < q->direct_qlen) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700605 __skb_queue_head(&q->direct_queue, skb);
606 } else {
607 __skb_queue_head(&q->direct_queue, skb);
608 tskb = __skb_dequeue_tail(&q->direct_queue);
609 kfree_skb(tskb);
610 sch->qstats.drops++;
611 return NET_XMIT_CN;
612 }
Jarek Poplawski21347452008-02-09 23:44:00 -0800613#ifdef CONFIG_NET_CLS_ACT
614 } else if (!cl) {
Jarek Poplawskic27f3392008-08-04 22:39:11 -0700615 if (ret & __NET_XMIT_BYPASS)
Jarek Poplawski21347452008-02-09 23:44:00 -0800616 sch->qstats.drops++;
617 kfree_skb(skb);
618 return ret;
619#endif
Jarek Poplawski378a2f02008-08-04 22:31:03 -0700620 } else if ((ret = cl->un.leaf.q->ops->requeue(skb, cl->un.leaf.q)) !=
Stephen Hemminger87990462006-08-10 23:35:16 -0700621 NET_XMIT_SUCCESS) {
Jarek Poplawski378a2f02008-08-04 22:31:03 -0700622 if (net_xmit_drop_count(ret)) {
623 sch->qstats.drops++;
624 cl->qstats.drops++;
625 }
Stephen Hemminger87990462006-08-10 23:35:16 -0700626 return NET_XMIT_DROP;
627 } else
628 htb_activate(q, cl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700629
Stephen Hemminger87990462006-08-10 23:35:16 -0700630 sch->q.qlen++;
631 sch->qstats.requeues++;
632 return NET_XMIT_SUCCESS;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700633}
634
Linus Torvalds1da177e2005-04-16 15:20:36 -0700635/**
636 * htb_charge_class - charges amount "bytes" to leaf and ancestors
637 *
638 * Routine assumes that packet "bytes" long was dequeued from leaf cl
639 * borrowing from "level". It accounts bytes to ceil leaky bucket for
640 * leaf and all ancestors and to rate bucket for ancestors at levels
641 * "level" and higher. It also handles possible change of mode resulting
642 * from the update. Note that mode can also increase here (MAY_BORROW to
643 * CAN_SEND) because we can use more precise clock that event queue here.
644 * In such case we remove class from event queue first.
645 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700646static void htb_charge_class(struct htb_sched *q, struct htb_class *cl,
Ranjit Manomohanc9726d62007-07-10 22:43:16 -0700647 int level, struct sk_buff *skb)
Stephen Hemminger87990462006-08-10 23:35:16 -0700648{
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700649 int bytes = qdisc_pkt_len(skb);
Stephen Hemminger87990462006-08-10 23:35:16 -0700650 long toks, diff;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700651 enum htb_cmode old_mode;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700652
653#define HTB_ACCNT(T,B,R) toks = diff + cl->T; \
654 if (toks > cl->B) toks = cl->B; \
655 toks -= L2T(cl, cl->R, bytes); \
656 if (toks <= -cl->mbuffer) toks = 1-cl->mbuffer; \
657 cl->T = toks
658
659 while (cl) {
Patrick McHardy03cc45c2007-03-23 11:29:11 -0700660 diff = psched_tdiff_bounded(q->now, cl->t_c, cl->mbuffer);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700661 if (cl->level >= level) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700662 if (cl->level == level)
663 cl->xstats.lends++;
664 HTB_ACCNT(tokens, buffer, rate);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700665 } else {
666 cl->xstats.borrows++;
Stephen Hemminger87990462006-08-10 23:35:16 -0700667 cl->tokens += diff; /* we moved t_c; update tokens */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700668 }
Stephen Hemminger87990462006-08-10 23:35:16 -0700669 HTB_ACCNT(ctokens, cbuffer, ceil);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700670 cl->t_c = q->now;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700671
Stephen Hemminger87990462006-08-10 23:35:16 -0700672 old_mode = cl->cmode;
673 diff = 0;
674 htb_change_class_mode(q, cl, &diff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675 if (old_mode != cl->cmode) {
676 if (old_mode != HTB_CAN_SEND)
Stephen Hemminger3696f622006-08-10 23:36:01 -0700677 htb_safe_rb_erase(&cl->pq_node, q->wait_pq + cl->level);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700678 if (cl->cmode != HTB_CAN_SEND)
Stephen Hemminger87990462006-08-10 23:35:16 -0700679 htb_add_to_wait_tree(q, cl, diff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700680 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700681
682 /* update byte stats except for leaves which are already updated */
683 if (cl->level) {
684 cl->bstats.bytes += bytes;
Ranjit Manomohanc9726d62007-07-10 22:43:16 -0700685 cl->bstats.packets += skb_is_gso(skb)?
686 skb_shinfo(skb)->gso_segs:1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700687 }
688 cl = cl->parent;
689 }
690}
691
692/**
693 * htb_do_events - make mode changes to classes at the level
694 *
Patrick McHardyfb983d42007-03-16 01:22:39 -0700695 * Scans event queue for pending events and applies them. Returns time of
Linus Torvalds1da177e2005-04-16 15:20:36 -0700696 * next pending event (0 for no event in pq).
Patrick McHardyfb983d42007-03-16 01:22:39 -0700697 * Note: Applied are events whose have cl->pq_key <= q->now.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700698 */
Patrick McHardyfb983d42007-03-16 01:22:39 -0700699static psched_time_t htb_do_events(struct htb_sched *q, int level)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700700{
Martin Devera8f3ea332008-03-23 22:00:38 -0700701 /* don't run for longer than 2 jiffies; 2 is used instead of
702 1 to simplify things when jiffy is going to be incremented
703 too soon */
704 unsigned long stop_at = jiffies + 2;
705 while (time_before(jiffies, stop_at)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700706 struct htb_class *cl;
707 long diff;
Akinbou Mita30bdbe32006-10-12 01:52:05 -0700708 struct rb_node *p = rb_first(&q->wait_pq[level]);
709
Stephen Hemminger87990462006-08-10 23:35:16 -0700710 if (!p)
711 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712
713 cl = rb_entry(p, struct htb_class, pq_node);
Patrick McHardyfb983d42007-03-16 01:22:39 -0700714 if (cl->pq_key > q->now)
715 return cl->pq_key;
716
Stephen Hemminger3696f622006-08-10 23:36:01 -0700717 htb_safe_rb_erase(p, q->wait_pq + level);
Patrick McHardy03cc45c2007-03-23 11:29:11 -0700718 diff = psched_tdiff_bounded(q->now, cl->t_c, cl->mbuffer);
Stephen Hemminger87990462006-08-10 23:35:16 -0700719 htb_change_class_mode(q, cl, &diff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700720 if (cl->cmode != HTB_CAN_SEND)
Stephen Hemminger87990462006-08-10 23:35:16 -0700721 htb_add_to_wait_tree(q, cl, diff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722 }
Martin Devera8f3ea332008-03-23 22:00:38 -0700723 /* too much load - let's continue on next jiffie */
724 return q->now + PSCHED_TICKS_PER_SEC / HZ;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700725}
726
727/* Returns class->node+prio from id-tree where classe's id is >= id. NULL
728 is no such one exists. */
Stephen Hemminger87990462006-08-10 23:35:16 -0700729static struct rb_node *htb_id_find_next_upper(int prio, struct rb_node *n,
730 u32 id)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700731{
732 struct rb_node *r = NULL;
733 while (n) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700734 struct htb_class *cl =
735 rb_entry(n, struct htb_class, node[prio]);
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700736 if (id == cl->common.classid)
Stephen Hemminger87990462006-08-10 23:35:16 -0700737 return n;
738
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700739 if (id > cl->common.classid) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700740 n = n->rb_right;
741 } else {
742 r = n;
743 n = n->rb_left;
744 }
745 }
746 return r;
747}
748
749/**
750 * htb_lookup_leaf - returns next leaf class in DRR order
751 *
752 * Find leaf where current feed pointers points to.
753 */
Stephen Hemminger87990462006-08-10 23:35:16 -0700754static struct htb_class *htb_lookup_leaf(struct rb_root *tree, int prio,
755 struct rb_node **pptr, u32 * pid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700756{
757 int i;
758 struct {
759 struct rb_node *root;
760 struct rb_node **pptr;
761 u32 *pid;
Stephen Hemminger87990462006-08-10 23:35:16 -0700762 } stk[TC_HTB_MAXDEPTH], *sp = stk;
763
Ilpo Järvinen547b7922008-07-25 21:43:18 -0700764 WARN_ON(!tree->rb_node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700765 sp->root = tree->rb_node;
766 sp->pptr = pptr;
767 sp->pid = pid;
768
769 for (i = 0; i < 65535; i++) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700770 if (!*sp->pptr && *sp->pid) {
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900771 /* ptr was invalidated but id is valid - try to recover
Linus Torvalds1da177e2005-04-16 15:20:36 -0700772 the original or next ptr */
Stephen Hemminger87990462006-08-10 23:35:16 -0700773 *sp->pptr =
774 htb_id_find_next_upper(prio, sp->root, *sp->pid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700775 }
Stephen Hemminger87990462006-08-10 23:35:16 -0700776 *sp->pid = 0; /* ptr is valid now so that remove this hint as it
777 can become out of date quickly */
778 if (!*sp->pptr) { /* we are at right end; rewind & go up */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700779 *sp->pptr = sp->root;
Stephen Hemminger87990462006-08-10 23:35:16 -0700780 while ((*sp->pptr)->rb_left)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700781 *sp->pptr = (*sp->pptr)->rb_left;
782 if (sp > stk) {
783 sp--;
Ilpo Järvinen547b7922008-07-25 21:43:18 -0700784 WARN_ON(!*sp->pptr);
Stephen Hemminger87990462006-08-10 23:35:16 -0700785 if (!*sp->pptr)
786 return NULL;
787 htb_next_rb_node(sp->pptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700788 }
789 } else {
790 struct htb_class *cl;
Stephen Hemminger87990462006-08-10 23:35:16 -0700791 cl = rb_entry(*sp->pptr, struct htb_class, node[prio]);
792 if (!cl->level)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700793 return cl;
794 (++sp)->root = cl->un.inner.feed[prio].rb_node;
Stephen Hemminger87990462006-08-10 23:35:16 -0700795 sp->pptr = cl->un.inner.ptr + prio;
796 sp->pid = cl->un.inner.last_ptr_id + prio;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700797 }
798 }
Ilpo Järvinen547b7922008-07-25 21:43:18 -0700799 WARN_ON(1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700800 return NULL;
801}
802
803/* dequeues packet at given priority and level; call only if
804 you are sure that there is active class at prio/level */
Stephen Hemminger87990462006-08-10 23:35:16 -0700805static struct sk_buff *htb_dequeue_tree(struct htb_sched *q, int prio,
806 int level)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700807{
808 struct sk_buff *skb = NULL;
Stephen Hemminger87990462006-08-10 23:35:16 -0700809 struct htb_class *cl, *start;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700810 /* look initial class up in the row */
Stephen Hemminger87990462006-08-10 23:35:16 -0700811 start = cl = htb_lookup_leaf(q->row[level] + prio, prio,
812 q->ptr[level] + prio,
813 q->last_ptr_id[level] + prio);
814
Linus Torvalds1da177e2005-04-16 15:20:36 -0700815 do {
816next:
Ilpo Järvinen547b7922008-07-25 21:43:18 -0700817 WARN_ON(!cl);
Stephen Hemminger87990462006-08-10 23:35:16 -0700818 if (!cl)
819 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700820
821 /* class can be empty - it is unlikely but can be true if leaf
822 qdisc drops packets in enqueue routine or if someone used
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +0900823 graft operation on the leaf since last dequeue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700824 simply deactivate and skip such class */
825 if (unlikely(cl->un.leaf.q->q.qlen == 0)) {
826 struct htb_class *next;
Stephen Hemminger87990462006-08-10 23:35:16 -0700827 htb_deactivate(q, cl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700828
829 /* row/level might become empty */
830 if ((q->row_mask[level] & (1 << prio)) == 0)
Stephen Hemminger87990462006-08-10 23:35:16 -0700831 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700832
Stephen Hemminger87990462006-08-10 23:35:16 -0700833 next = htb_lookup_leaf(q->row[level] + prio,
834 prio, q->ptr[level] + prio,
835 q->last_ptr_id[level] + prio);
836
837 if (cl == start) /* fix start if we just deleted it */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700838 start = next;
839 cl = next;
840 goto next;
841 }
Stephen Hemminger87990462006-08-10 23:35:16 -0700842
843 skb = cl->un.leaf.q->dequeue(cl->un.leaf.q);
844 if (likely(skb != NULL))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700845 break;
846 if (!cl->warned) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700847 printk(KERN_WARNING
848 "htb: class %X isn't work conserving ?!\n",
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700849 cl->common.classid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700850 cl->warned = 1;
851 }
852 q->nwc_hit++;
Stephen Hemminger87990462006-08-10 23:35:16 -0700853 htb_next_rb_node((level ? cl->parent->un.inner.ptr : q->
854 ptr[0]) + prio);
855 cl = htb_lookup_leaf(q->row[level] + prio, prio,
856 q->ptr[level] + prio,
857 q->last_ptr_id[level] + prio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700858
859 } while (cl != start);
860
861 if (likely(skb != NULL)) {
Jussi Kivilinna0abf77e2008-07-20 00:08:27 -0700862 cl->un.leaf.deficit[level] -= qdisc_pkt_len(skb);
863 if (cl->un.leaf.deficit[level] < 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700864 cl->un.leaf.deficit[level] += cl->un.leaf.quantum;
Stephen Hemminger87990462006-08-10 23:35:16 -0700865 htb_next_rb_node((level ? cl->parent->un.inner.ptr : q->
866 ptr[0]) + prio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700867 }
868 /* this used to be after charge_class but this constelation
869 gives us slightly better performance */
870 if (!cl->un.leaf.q->q.qlen)
Stephen Hemminger87990462006-08-10 23:35:16 -0700871 htb_deactivate(q, cl);
Ranjit Manomohanc9726d62007-07-10 22:43:16 -0700872 htb_charge_class(q, cl, level, skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700873 }
874 return skb;
875}
876
Linus Torvalds1da177e2005-04-16 15:20:36 -0700877static struct sk_buff *htb_dequeue(struct Qdisc *sch)
878{
879 struct sk_buff *skb = NULL;
880 struct htb_sched *q = qdisc_priv(sch);
881 int level;
Patrick McHardyfb983d42007-03-16 01:22:39 -0700882 psched_time_t next_event;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700883
884 /* try to dequeue direct packets as high prio (!) to minimize cpu work */
Stephen Hemminger87990462006-08-10 23:35:16 -0700885 skb = __skb_dequeue(&q->direct_queue);
886 if (skb != NULL) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700887 sch->flags &= ~TCQ_F_THROTTLED;
888 sch->q.qlen--;
889 return skb;
890 }
891
Stephen Hemminger87990462006-08-10 23:35:16 -0700892 if (!sch->q.qlen)
893 goto fin;
Patrick McHardy3bebcda2007-03-23 11:29:25 -0700894 q->now = psched_get_time();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700895
Patrick McHardyfb983d42007-03-16 01:22:39 -0700896 next_event = q->now + 5 * PSCHED_TICKS_PER_SEC;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700897 q->nwc_hit = 0;
898 for (level = 0; level < TC_HTB_MAXDEPTH; level++) {
899 /* common case optimization - skip event handler quickly */
900 int m;
Patrick McHardyfb983d42007-03-16 01:22:39 -0700901 psched_time_t event;
Stephen Hemminger87990462006-08-10 23:35:16 -0700902
Patrick McHardyfb983d42007-03-16 01:22:39 -0700903 if (q->now >= q->near_ev_cache[level]) {
904 event = htb_do_events(q, level);
Patrick McHardy2e4b3b02007-05-23 23:39:54 -0700905 if (!event)
906 event = q->now + PSCHED_TICKS_PER_SEC;
907 q->near_ev_cache[level] = event;
Patrick McHardyfb983d42007-03-16 01:22:39 -0700908 } else
909 event = q->near_ev_cache[level];
910
911 if (event && next_event > event)
912 next_event = event;
913
Linus Torvalds1da177e2005-04-16 15:20:36 -0700914 m = ~q->row_mask[level];
915 while (m != (int)(-1)) {
Stephen Hemminger87990462006-08-10 23:35:16 -0700916 int prio = ffz(m);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700917 m |= 1 << prio;
Stephen Hemminger87990462006-08-10 23:35:16 -0700918 skb = htb_dequeue_tree(q, prio, level);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700919 if (likely(skb != NULL)) {
920 sch->q.qlen--;
921 sch->flags &= ~TCQ_F_THROTTLED;
922 goto fin;
923 }
924 }
925 }
Patrick McHardyfb983d42007-03-16 01:22:39 -0700926 sch->qstats.overlimits++;
927 qdisc_watchdog_schedule(&q->watchdog, next_event);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700928fin:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700929 return skb;
930}
931
932/* try to drop from each class (by prio) until one succeed */
Stephen Hemminger87990462006-08-10 23:35:16 -0700933static unsigned int htb_drop(struct Qdisc *sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700934{
935 struct htb_sched *q = qdisc_priv(sch);
936 int prio;
937
938 for (prio = TC_HTB_NUMPRIO - 1; prio >= 0; prio--) {
939 struct list_head *p;
Stephen Hemminger87990462006-08-10 23:35:16 -0700940 list_for_each(p, q->drops + prio) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700941 struct htb_class *cl = list_entry(p, struct htb_class,
942 un.leaf.drop_list);
943 unsigned int len;
Stephen Hemminger87990462006-08-10 23:35:16 -0700944 if (cl->un.leaf.q->ops->drop &&
945 (len = cl->un.leaf.q->ops->drop(cl->un.leaf.q))) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700946 sch->q.qlen--;
947 if (!cl->un.leaf.q->q.qlen)
Stephen Hemminger87990462006-08-10 23:35:16 -0700948 htb_deactivate(q, cl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700949 return len;
950 }
951 }
952 }
953 return 0;
954}
955
956/* reset all classes */
957/* always caled under BH & queue lock */
Stephen Hemminger87990462006-08-10 23:35:16 -0700958static void htb_reset(struct Qdisc *sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700959{
960 struct htb_sched *q = qdisc_priv(sch);
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700961 struct htb_class *cl;
962 struct hlist_node *n;
963 unsigned int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700964
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -0700965 for (i = 0; i < q->clhash.hashsize; i++) {
966 hlist_for_each_entry(cl, n, &q->clhash.hash[i], common.hnode) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700967 if (cl->level)
Stephen Hemminger87990462006-08-10 23:35:16 -0700968 memset(&cl->un.inner, 0, sizeof(cl->un.inner));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700969 else {
Stephen Hemminger87990462006-08-10 23:35:16 -0700970 if (cl->un.leaf.q)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700971 qdisc_reset(cl->un.leaf.q);
972 INIT_LIST_HEAD(&cl->un.leaf.drop_list);
973 }
974 cl->prio_activity = 0;
975 cl->cmode = HTB_CAN_SEND;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700976
977 }
978 }
Patrick McHardyfb983d42007-03-16 01:22:39 -0700979 qdisc_watchdog_cancel(&q->watchdog);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700980 __skb_queue_purge(&q->direct_queue);
981 sch->q.qlen = 0;
Stephen Hemminger87990462006-08-10 23:35:16 -0700982 memset(q->row, 0, sizeof(q->row));
983 memset(q->row_mask, 0, sizeof(q->row_mask));
984 memset(q->wait_pq, 0, sizeof(q->wait_pq));
985 memset(q->ptr, 0, sizeof(q->ptr));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700986 for (i = 0; i < TC_HTB_NUMPRIO; i++)
Stephen Hemminger87990462006-08-10 23:35:16 -0700987 INIT_LIST_HEAD(q->drops + i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700988}
989
Patrick McHardy27a34212008-01-23 20:35:39 -0800990static const struct nla_policy htb_policy[TCA_HTB_MAX + 1] = {
991 [TCA_HTB_PARMS] = { .len = sizeof(struct tc_htb_opt) },
992 [TCA_HTB_INIT] = { .len = sizeof(struct tc_htb_glob) },
993 [TCA_HTB_CTAB] = { .type = NLA_BINARY, .len = TC_RTAB_SIZE },
994 [TCA_HTB_RTAB] = { .type = NLA_BINARY, .len = TC_RTAB_SIZE },
995};
996
Patrick McHardy1e904742008-01-22 22:11:17 -0800997static int htb_init(struct Qdisc *sch, struct nlattr *opt)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700998{
999 struct htb_sched *q = qdisc_priv(sch);
Patrick McHardy1e904742008-01-22 22:11:17 -08001000 struct nlattr *tb[TCA_HTB_INIT + 1];
Linus Torvalds1da177e2005-04-16 15:20:36 -07001001 struct tc_htb_glob *gopt;
Patrick McHardycee63722008-01-23 20:33:32 -08001002 int err;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001003 int i;
Patrick McHardycee63722008-01-23 20:33:32 -08001004
1005 if (!opt)
1006 return -EINVAL;
1007
Patrick McHardy27a34212008-01-23 20:35:39 -08001008 err = nla_parse_nested(tb, TCA_HTB_INIT, opt, htb_policy);
Patrick McHardycee63722008-01-23 20:33:32 -08001009 if (err < 0)
1010 return err;
1011
Patrick McHardy27a34212008-01-23 20:35:39 -08001012 if (tb[TCA_HTB_INIT] == NULL) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001013 printk(KERN_ERR "HTB: hey probably you have bad tc tool ?\n");
1014 return -EINVAL;
1015 }
Patrick McHardy1e904742008-01-22 22:11:17 -08001016 gopt = nla_data(tb[TCA_HTB_INIT]);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001017 if (gopt->version != HTB_VER >> 16) {
Stephen Hemminger87990462006-08-10 23:35:16 -07001018 printk(KERN_ERR
1019 "HTB: need tc/htb version %d (minor is %d), you have %d\n",
1020 HTB_VER >> 16, HTB_VER & 0xffff, gopt->version);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001021 return -EINVAL;
1022 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001023
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001024 err = qdisc_class_hash_init(&q->clhash);
1025 if (err < 0)
1026 return err;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001027 for (i = 0; i < TC_HTB_NUMPRIO; i++)
Stephen Hemminger87990462006-08-10 23:35:16 -07001028 INIT_LIST_HEAD(q->drops + i);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001029
Patrick McHardyfb983d42007-03-16 01:22:39 -07001030 qdisc_watchdog_init(&q->watchdog, sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001031 skb_queue_head_init(&q->direct_queue);
1032
David S. Miller5ce2d482008-07-08 17:06:30 -07001033 q->direct_qlen = qdisc_dev(sch)->tx_queue_len;
Stephen Hemminger87990462006-08-10 23:35:16 -07001034 if (q->direct_qlen < 2) /* some devices have zero tx_queue_len */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001035 q->direct_qlen = 2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001036
Linus Torvalds1da177e2005-04-16 15:20:36 -07001037 if ((q->rate2quantum = gopt->rate2quantum) < 1)
1038 q->rate2quantum = 1;
1039 q->defcls = gopt->defcls;
1040
1041 return 0;
1042}
1043
1044static int htb_dump(struct Qdisc *sch, struct sk_buff *skb)
1045{
David S. Miller7698b4f2008-07-16 01:42:40 -07001046 spinlock_t *root_lock = qdisc_root_lock(sch);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001047 struct htb_sched *q = qdisc_priv(sch);
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001048 struct nlattr *nest;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001049 struct tc_htb_glob gopt;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001050
David S. Miller7698b4f2008-07-16 01:42:40 -07001051 spin_lock_bh(root_lock);
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001052
1053 gopt.direct_pkts = q->direct_pkts;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001054 gopt.version = HTB_VER;
1055 gopt.rate2quantum = q->rate2quantum;
1056 gopt.defcls = q->defcls;
Stephen Hemminger3bf72952006-08-10 23:31:08 -07001057 gopt.debug = 0;
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001058
1059 nest = nla_nest_start(skb, TCA_OPTIONS);
1060 if (nest == NULL)
1061 goto nla_put_failure;
Patrick McHardy1e904742008-01-22 22:11:17 -08001062 NLA_PUT(skb, TCA_HTB_INIT, sizeof(gopt), &gopt);
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001063 nla_nest_end(skb, nest);
1064
David S. Miller7698b4f2008-07-16 01:42:40 -07001065 spin_unlock_bh(root_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001066 return skb->len;
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001067
Patrick McHardy1e904742008-01-22 22:11:17 -08001068nla_put_failure:
David S. Miller7698b4f2008-07-16 01:42:40 -07001069 spin_unlock_bh(root_lock);
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001070 nla_nest_cancel(skb, nest);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001071 return -1;
1072}
1073
1074static int htb_dump_class(struct Qdisc *sch, unsigned long arg,
Stephen Hemminger87990462006-08-10 23:35:16 -07001075 struct sk_buff *skb, struct tcmsg *tcm)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001076{
Stephen Hemminger87990462006-08-10 23:35:16 -07001077 struct htb_class *cl = (struct htb_class *)arg;
David S. Miller7698b4f2008-07-16 01:42:40 -07001078 spinlock_t *root_lock = qdisc_root_lock(sch);
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001079 struct nlattr *nest;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001080 struct tc_htb_opt opt;
1081
David S. Miller7698b4f2008-07-16 01:42:40 -07001082 spin_lock_bh(root_lock);
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001083 tcm->tcm_parent = cl->parent ? cl->parent->common.classid : TC_H_ROOT;
1084 tcm->tcm_handle = cl->common.classid;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001085 if (!cl->level && cl->un.leaf.q)
1086 tcm->tcm_info = cl->un.leaf.q->handle;
1087
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001088 nest = nla_nest_start(skb, TCA_OPTIONS);
1089 if (nest == NULL)
1090 goto nla_put_failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001091
Stephen Hemminger87990462006-08-10 23:35:16 -07001092 memset(&opt, 0, sizeof(opt));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001093
Stephen Hemminger87990462006-08-10 23:35:16 -07001094 opt.rate = cl->rate->rate;
1095 opt.buffer = cl->buffer;
1096 opt.ceil = cl->ceil->rate;
1097 opt.cbuffer = cl->cbuffer;
1098 opt.quantum = cl->un.leaf.quantum;
1099 opt.prio = cl->un.leaf.prio;
1100 opt.level = cl->level;
Patrick McHardy1e904742008-01-22 22:11:17 -08001101 NLA_PUT(skb, TCA_HTB_PARMS, sizeof(opt), &opt);
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001102
1103 nla_nest_end(skb, nest);
David S. Miller7698b4f2008-07-16 01:42:40 -07001104 spin_unlock_bh(root_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001105 return skb->len;
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001106
Patrick McHardy1e904742008-01-22 22:11:17 -08001107nla_put_failure:
David S. Miller7698b4f2008-07-16 01:42:40 -07001108 spin_unlock_bh(root_lock);
Patrick McHardy4b3550ef2008-01-23 20:34:11 -08001109 nla_nest_cancel(skb, nest);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001110 return -1;
1111}
1112
1113static int
Stephen Hemminger87990462006-08-10 23:35:16 -07001114htb_dump_class_stats(struct Qdisc *sch, unsigned long arg, struct gnet_dump *d)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001115{
Stephen Hemminger87990462006-08-10 23:35:16 -07001116 struct htb_class *cl = (struct htb_class *)arg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001117
Linus Torvalds1da177e2005-04-16 15:20:36 -07001118 if (!cl->level && cl->un.leaf.q)
1119 cl->qstats.qlen = cl->un.leaf.q->q.qlen;
1120 cl->xstats.tokens = cl->tokens;
1121 cl->xstats.ctokens = cl->ctokens;
1122
1123 if (gnet_stats_copy_basic(d, &cl->bstats) < 0 ||
1124 gnet_stats_copy_rate_est(d, &cl->rate_est) < 0 ||
1125 gnet_stats_copy_queue(d, &cl->qstats) < 0)
1126 return -1;
1127
1128 return gnet_stats_copy_app(d, &cl->xstats, sizeof(cl->xstats));
1129}
1130
1131static int htb_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
Stephen Hemminger87990462006-08-10 23:35:16 -07001132 struct Qdisc **old)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001133{
Stephen Hemminger87990462006-08-10 23:35:16 -07001134 struct htb_class *cl = (struct htb_class *)arg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001135
1136 if (cl && !cl->level) {
Patrick McHardy9f9afec2006-11-29 17:35:18 -08001137 if (new == NULL &&
David S. Miller5ce2d482008-07-08 17:06:30 -07001138 (new = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
David S. Millerbb949fb2008-07-08 16:55:56 -07001139 &pfifo_qdisc_ops,
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001140 cl->common.classid))
Stephen Hemminger87990462006-08-10 23:35:16 -07001141 == NULL)
1142 return -ENOBUFS;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001143 sch_tree_lock(sch);
1144 if ((*old = xchg(&cl->un.leaf.q, new)) != NULL) {
Patrick McHardy256d61b2006-11-29 17:37:05 -08001145 qdisc_tree_decrease_qlen(*old, (*old)->q.qlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001146 qdisc_reset(*old);
1147 }
1148 sch_tree_unlock(sch);
1149 return 0;
1150 }
1151 return -ENOENT;
1152}
1153
Stephen Hemminger87990462006-08-10 23:35:16 -07001154static struct Qdisc *htb_leaf(struct Qdisc *sch, unsigned long arg)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001155{
Stephen Hemminger87990462006-08-10 23:35:16 -07001156 struct htb_class *cl = (struct htb_class *)arg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001157 return (cl && !cl->level) ? cl->un.leaf.q : NULL;
1158}
1159
Patrick McHardy256d61b2006-11-29 17:37:05 -08001160static void htb_qlen_notify(struct Qdisc *sch, unsigned long arg)
1161{
1162 struct htb_class *cl = (struct htb_class *)arg;
1163
1164 if (cl->un.leaf.q->q.qlen == 0)
1165 htb_deactivate(qdisc_priv(sch), cl);
1166}
1167
Linus Torvalds1da177e2005-04-16 15:20:36 -07001168static unsigned long htb_get(struct Qdisc *sch, u32 classid)
1169{
Stephen Hemminger87990462006-08-10 23:35:16 -07001170 struct htb_class *cl = htb_find(classid, sch);
1171 if (cl)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001172 cl->refcnt++;
1173 return (unsigned long)cl;
1174}
1175
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001176static inline int htb_parent_last_child(struct htb_class *cl)
1177{
1178 if (!cl->parent)
1179 /* the root class */
1180 return 0;
Patrick McHardy42077592008-07-05 23:22:53 -07001181 if (cl->parent->children > 1)
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001182 /* not the last child */
1183 return 0;
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001184 return 1;
1185}
1186
Jarek Poplawski3ba08b02008-05-03 20:46:29 -07001187static void htb_parent_to_leaf(struct htb_sched *q, struct htb_class *cl,
1188 struct Qdisc *new_q)
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001189{
1190 struct htb_class *parent = cl->parent;
1191
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001192 WARN_ON(cl->level || !cl->un.leaf.q || cl->prio_activity);
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001193
Jarek Poplawski3ba08b02008-05-03 20:46:29 -07001194 if (parent->cmode != HTB_CAN_SEND)
1195 htb_safe_rb_erase(&parent->pq_node, q->wait_pq + parent->level);
1196
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001197 parent->level = 0;
1198 memset(&parent->un.inner, 0, sizeof(parent->un.inner));
1199 INIT_LIST_HEAD(&parent->un.leaf.drop_list);
1200 parent->un.leaf.q = new_q ? new_q : &noop_qdisc;
1201 parent->un.leaf.quantum = parent->quantum;
1202 parent->un.leaf.prio = parent->prio;
1203 parent->tokens = parent->buffer;
1204 parent->ctokens = parent->cbuffer;
Patrick McHardy3bebcda2007-03-23 11:29:25 -07001205 parent->t_c = psched_get_time();
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001206 parent->cmode = HTB_CAN_SEND;
1207}
1208
Stephen Hemminger87990462006-08-10 23:35:16 -07001209static void htb_destroy_class(struct Qdisc *sch, struct htb_class *cl)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001210{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001211 if (!cl->level) {
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001212 WARN_ON(!cl->un.leaf.q);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001213 qdisc_destroy(cl->un.leaf.q);
1214 }
Patrick McHardyee39e102007-07-02 22:48:13 -07001215 gen_kill_estimator(&cl->bstats, &cl->rate_est);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001216 qdisc_put_rtab(cl->rate);
1217 qdisc_put_rtab(cl->ceil);
Stephen Hemminger87990462006-08-10 23:35:16 -07001218
Patrick McHardyff31ab52008-07-01 19:52:38 -07001219 tcf_destroy_chain(&cl->filter_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001220 kfree(cl);
1221}
1222
1223/* always caled under BH & queue lock */
Stephen Hemminger87990462006-08-10 23:35:16 -07001224static void htb_destroy(struct Qdisc *sch)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001225{
1226 struct htb_sched *q = qdisc_priv(sch);
Patrick McHardyfbd8f132008-07-05 23:22:19 -07001227 struct hlist_node *n, *next;
1228 struct htb_class *cl;
1229 unsigned int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001230
Patrick McHardyfb983d42007-03-16 01:22:39 -07001231 qdisc_watchdog_cancel(&q->watchdog);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001232 /* This line used to be after htb_destroy_class call below
YOSHIFUJI Hideaki10297b92007-02-09 23:25:16 +09001233 and surprisingly it worked in 2.4. But it must precede it
Linus Torvalds1da177e2005-04-16 15:20:36 -07001234 because filter need its target class alive to be able to call
1235 unbind_filter on it (without Oops). */
Patrick McHardyff31ab52008-07-01 19:52:38 -07001236 tcf_destroy_chain(&q->filter_list);
Stephen Hemminger87990462006-08-10 23:35:16 -07001237
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001238 for (i = 0; i < q->clhash.hashsize; i++) {
1239 hlist_for_each_entry(cl, n, &q->clhash.hash[i], common.hnode)
Patrick McHardyfbd8f132008-07-05 23:22:19 -07001240 tcf_destroy_chain(&cl->filter_list);
1241 }
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001242 for (i = 0; i < q->clhash.hashsize; i++) {
1243 hlist_for_each_entry_safe(cl, n, next, &q->clhash.hash[i],
1244 common.hnode)
Patrick McHardyfbd8f132008-07-05 23:22:19 -07001245 htb_destroy_class(sch, cl);
1246 }
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001247 qdisc_class_hash_destroy(&q->clhash);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001248 __skb_queue_purge(&q->direct_queue);
1249}
1250
1251static int htb_delete(struct Qdisc *sch, unsigned long arg)
1252{
1253 struct htb_sched *q = qdisc_priv(sch);
Stephen Hemminger87990462006-08-10 23:35:16 -07001254 struct htb_class *cl = (struct htb_class *)arg;
Patrick McHardy256d61b2006-11-29 17:37:05 -08001255 unsigned int qlen;
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001256 struct Qdisc *new_q = NULL;
1257 int last_child = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001258
1259 // TODO: why don't allow to delete subtree ? references ? does
1260 // tc subsys quarantee us that in htb_destroy it holds no class
1261 // refs so that we can remove children safely there ?
Patrick McHardy42077592008-07-05 23:22:53 -07001262 if (cl->children || cl->filter_cnt)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001263 return -EBUSY;
Stephen Hemminger87990462006-08-10 23:35:16 -07001264
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001265 if (!cl->level && htb_parent_last_child(cl)) {
David S. Miller5ce2d482008-07-08 17:06:30 -07001266 new_q = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
David S. Millerbb949fb2008-07-08 16:55:56 -07001267 &pfifo_qdisc_ops,
1268 cl->parent->common.classid);
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001269 last_child = 1;
1270 }
1271
Linus Torvalds1da177e2005-04-16 15:20:36 -07001272 sch_tree_lock(sch);
Stephen Hemminger87990462006-08-10 23:35:16 -07001273
Patrick McHardy814a175e2006-11-29 17:34:50 -08001274 if (!cl->level) {
Patrick McHardy256d61b2006-11-29 17:37:05 -08001275 qlen = cl->un.leaf.q->q.qlen;
Patrick McHardy814a175e2006-11-29 17:34:50 -08001276 qdisc_reset(cl->un.leaf.q);
Patrick McHardy256d61b2006-11-29 17:37:05 -08001277 qdisc_tree_decrease_qlen(cl->un.leaf.q, qlen);
Patrick McHardy814a175e2006-11-29 17:34:50 -08001278 }
1279
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001280 /* delete from hash and active; remainder in destroy_class */
1281 qdisc_class_hash_remove(&q->clhash, &cl->common);
Jarek Poplawski26b284d2008-08-13 15:16:43 -07001282 if (cl->parent)
1283 cl->parent->children--;
Patrick McHardyc38c83c2007-03-27 14:04:24 -07001284
Linus Torvalds1da177e2005-04-16 15:20:36 -07001285 if (cl->prio_activity)
Stephen Hemminger87990462006-08-10 23:35:16 -07001286 htb_deactivate(q, cl);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001287
Patrick McHardyfbd8f132008-07-05 23:22:19 -07001288 if (cl->cmode != HTB_CAN_SEND)
1289 htb_safe_rb_erase(&cl->pq_node, q->wait_pq + cl->level);
1290
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001291 if (last_child)
Jarek Poplawski3ba08b02008-05-03 20:46:29 -07001292 htb_parent_to_leaf(q, cl, new_q);
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001293
Linus Torvalds1da177e2005-04-16 15:20:36 -07001294 if (--cl->refcnt == 0)
Stephen Hemminger87990462006-08-10 23:35:16 -07001295 htb_destroy_class(sch, cl);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001296
1297 sch_tree_unlock(sch);
1298 return 0;
1299}
1300
1301static void htb_put(struct Qdisc *sch, unsigned long arg)
1302{
Stephen Hemminger87990462006-08-10 23:35:16 -07001303 struct htb_class *cl = (struct htb_class *)arg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001304
1305 if (--cl->refcnt == 0)
Stephen Hemminger87990462006-08-10 23:35:16 -07001306 htb_destroy_class(sch, cl);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001307}
1308
Stephen Hemminger87990462006-08-10 23:35:16 -07001309static int htb_change_class(struct Qdisc *sch, u32 classid,
Patrick McHardy1e904742008-01-22 22:11:17 -08001310 u32 parentid, struct nlattr **tca,
Stephen Hemminger87990462006-08-10 23:35:16 -07001311 unsigned long *arg)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001312{
1313 int err = -EINVAL;
1314 struct htb_sched *q = qdisc_priv(sch);
Stephen Hemminger87990462006-08-10 23:35:16 -07001315 struct htb_class *cl = (struct htb_class *)*arg, *parent;
Patrick McHardy1e904742008-01-22 22:11:17 -08001316 struct nlattr *opt = tca[TCA_OPTIONS];
Linus Torvalds1da177e2005-04-16 15:20:36 -07001317 struct qdisc_rate_table *rtab = NULL, *ctab = NULL;
Patrick McHardy1e904742008-01-22 22:11:17 -08001318 struct nlattr *tb[TCA_HTB_RTAB + 1];
Linus Torvalds1da177e2005-04-16 15:20:36 -07001319 struct tc_htb_opt *hopt;
1320
1321 /* extract all subattrs from opt attr */
Patrick McHardycee63722008-01-23 20:33:32 -08001322 if (!opt)
1323 goto failure;
1324
Patrick McHardy27a34212008-01-23 20:35:39 -08001325 err = nla_parse_nested(tb, TCA_HTB_RTAB, opt, htb_policy);
Patrick McHardycee63722008-01-23 20:33:32 -08001326 if (err < 0)
1327 goto failure;
1328
1329 err = -EINVAL;
Patrick McHardy27a34212008-01-23 20:35:39 -08001330 if (tb[TCA_HTB_PARMS] == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001331 goto failure;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001332
Stephen Hemminger87990462006-08-10 23:35:16 -07001333 parent = parentid == TC_H_ROOT ? NULL : htb_find(parentid, sch);
Stephen Hemminger3bf72952006-08-10 23:31:08 -07001334
Patrick McHardy1e904742008-01-22 22:11:17 -08001335 hopt = nla_data(tb[TCA_HTB_PARMS]);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001336
Patrick McHardy1e904742008-01-22 22:11:17 -08001337 rtab = qdisc_get_rtab(&hopt->rate, tb[TCA_HTB_RTAB]);
1338 ctab = qdisc_get_rtab(&hopt->ceil, tb[TCA_HTB_CTAB]);
Stephen Hemminger87990462006-08-10 23:35:16 -07001339 if (!rtab || !ctab)
1340 goto failure;
1341
1342 if (!cl) { /* new class */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001343 struct Qdisc *new_q;
Stephen Hemminger3696f622006-08-10 23:36:01 -07001344 int prio;
Patrick McHardyee39e102007-07-02 22:48:13 -07001345 struct {
Patrick McHardy1e904742008-01-22 22:11:17 -08001346 struct nlattr nla;
Patrick McHardyee39e102007-07-02 22:48:13 -07001347 struct gnet_estimator opt;
1348 } est = {
Patrick McHardy1e904742008-01-22 22:11:17 -08001349 .nla = {
1350 .nla_len = nla_attr_size(sizeof(est.opt)),
1351 .nla_type = TCA_RATE,
Patrick McHardyee39e102007-07-02 22:48:13 -07001352 },
1353 .opt = {
1354 /* 4s interval, 16s averaging constant */
1355 .interval = 2,
1356 .ewma_log = 2,
1357 },
1358 };
Stephen Hemminger3696f622006-08-10 23:36:01 -07001359
Linus Torvalds1da177e2005-04-16 15:20:36 -07001360 /* check for valid classid */
Stephen Hemminger87990462006-08-10 23:35:16 -07001361 if (!classid || TC_H_MAJ(classid ^ sch->handle)
1362 || htb_find(classid, sch))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001363 goto failure;
1364
1365 /* check maximal depth */
1366 if (parent && parent->parent && parent->parent->level < 2) {
1367 printk(KERN_ERR "htb: tree is too deep\n");
1368 goto failure;
1369 }
1370 err = -ENOBUFS;
Panagiotis Issaris0da974f2006-07-21 14:51:30 -07001371 if ((cl = kzalloc(sizeof(*cl), GFP_KERNEL)) == NULL)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001372 goto failure;
Stephen Hemminger87990462006-08-10 23:35:16 -07001373
Patrick McHardyee39e102007-07-02 22:48:13 -07001374 gen_new_estimator(&cl->bstats, &cl->rate_est,
David S. Miller7698b4f2008-07-16 01:42:40 -07001375 qdisc_root_lock(sch),
Patrick McHardy1e904742008-01-22 22:11:17 -08001376 tca[TCA_RATE] ? : &est.nla);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001377 cl->refcnt = 1;
Patrick McHardy42077592008-07-05 23:22:53 -07001378 cl->children = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001379 INIT_LIST_HEAD(&cl->un.leaf.drop_list);
Stephen Hemminger3696f622006-08-10 23:36:01 -07001380 RB_CLEAR_NODE(&cl->pq_node);
1381
1382 for (prio = 0; prio < TC_HTB_NUMPRIO; prio++)
1383 RB_CLEAR_NODE(&cl->node[prio]);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001384
1385 /* create leaf qdisc early because it uses kmalloc(GFP_KERNEL)
1386 so that can't be used inside of sch_tree_lock
1387 -- thanks to Karlis Peisenieks */
David S. Miller5ce2d482008-07-08 17:06:30 -07001388 new_q = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
David S. Millerbb949fb2008-07-08 16:55:56 -07001389 &pfifo_qdisc_ops, classid);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001390 sch_tree_lock(sch);
1391 if (parent && !parent->level) {
Patrick McHardy256d61b2006-11-29 17:37:05 -08001392 unsigned int qlen = parent->un.leaf.q->q.qlen;
1393
Linus Torvalds1da177e2005-04-16 15:20:36 -07001394 /* turn parent into inner node */
Patrick McHardy256d61b2006-11-29 17:37:05 -08001395 qdisc_reset(parent->un.leaf.q);
1396 qdisc_tree_decrease_qlen(parent->un.leaf.q, qlen);
Stephen Hemminger87990462006-08-10 23:35:16 -07001397 qdisc_destroy(parent->un.leaf.q);
1398 if (parent->prio_activity)
1399 htb_deactivate(q, parent);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001400
1401 /* remove from evt list because of level change */
1402 if (parent->cmode != HTB_CAN_SEND) {
Stephen Hemminger3696f622006-08-10 23:36:01 -07001403 htb_safe_rb_erase(&parent->pq_node, q->wait_pq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001404 parent->cmode = HTB_CAN_SEND;
1405 }
1406 parent->level = (parent->parent ? parent->parent->level
Stephen Hemminger87990462006-08-10 23:35:16 -07001407 : TC_HTB_MAXDEPTH) - 1;
1408 memset(&parent->un.inner, 0, sizeof(parent->un.inner));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001409 }
1410 /* leaf (we) needs elementary qdisc */
1411 cl->un.leaf.q = new_q ? new_q : &noop_qdisc;
1412
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001413 cl->common.classid = classid;
Stephen Hemminger87990462006-08-10 23:35:16 -07001414 cl->parent = parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001415
1416 /* set class to be in HTB_CAN_SEND state */
1417 cl->tokens = hopt->buffer;
1418 cl->ctokens = hopt->cbuffer;
Patrick McHardy00c04af2007-03-16 01:23:02 -07001419 cl->mbuffer = 60 * PSCHED_TICKS_PER_SEC; /* 1min */
Patrick McHardy3bebcda2007-03-23 11:29:25 -07001420 cl->t_c = psched_get_time();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001421 cl->cmode = HTB_CAN_SEND;
1422
1423 /* attach to the hash list and parent's family */
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001424 qdisc_class_hash_insert(&q->clhash, &cl->common);
Patrick McHardy42077592008-07-05 23:22:53 -07001425 if (parent)
1426 parent->children++;
Patrick McHardyee39e102007-07-02 22:48:13 -07001427 } else {
Patrick McHardy1e904742008-01-22 22:11:17 -08001428 if (tca[TCA_RATE])
Patrick McHardyee39e102007-07-02 22:48:13 -07001429 gen_replace_estimator(&cl->bstats, &cl->rate_est,
David S. Miller7698b4f2008-07-16 01:42:40 -07001430 qdisc_root_lock(sch),
Patrick McHardy1e904742008-01-22 22:11:17 -08001431 tca[TCA_RATE]);
Stephen Hemminger87990462006-08-10 23:35:16 -07001432 sch_tree_lock(sch);
Patrick McHardyee39e102007-07-02 22:48:13 -07001433 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001434
1435 /* it used to be a nasty bug here, we have to check that node
Stephen Hemminger87990462006-08-10 23:35:16 -07001436 is really leaf before changing cl->un.leaf ! */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001437 if (!cl->level) {
1438 cl->un.leaf.quantum = rtab->rate.rate / q->rate2quantum;
1439 if (!hopt->quantum && cl->un.leaf.quantum < 1000) {
Stephen Hemminger87990462006-08-10 23:35:16 -07001440 printk(KERN_WARNING
1441 "HTB: quantum of class %X is small. Consider r2q change.\n",
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001442 cl->common.classid);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001443 cl->un.leaf.quantum = 1000;
1444 }
1445 if (!hopt->quantum && cl->un.leaf.quantum > 200000) {
Stephen Hemminger87990462006-08-10 23:35:16 -07001446 printk(KERN_WARNING
1447 "HTB: quantum of class %X is big. Consider r2q change.\n",
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001448 cl->common.classid);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001449 cl->un.leaf.quantum = 200000;
1450 }
1451 if (hopt->quantum)
1452 cl->un.leaf.quantum = hopt->quantum;
1453 if ((cl->un.leaf.prio = hopt->prio) >= TC_HTB_NUMPRIO)
1454 cl->un.leaf.prio = TC_HTB_NUMPRIO - 1;
Jarek Poplawski160d5e12006-12-08 00:26:56 -08001455
1456 /* backup for htb_parent_to_leaf */
1457 cl->quantum = cl->un.leaf.quantum;
1458 cl->prio = cl->un.leaf.prio;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001459 }
1460
1461 cl->buffer = hopt->buffer;
1462 cl->cbuffer = hopt->cbuffer;
Stephen Hemminger87990462006-08-10 23:35:16 -07001463 if (cl->rate)
1464 qdisc_put_rtab(cl->rate);
1465 cl->rate = rtab;
1466 if (cl->ceil)
1467 qdisc_put_rtab(cl->ceil);
1468 cl->ceil = ctab;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001469 sch_tree_unlock(sch);
1470
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001471 qdisc_class_hash_grow(sch, &q->clhash);
1472
Linus Torvalds1da177e2005-04-16 15:20:36 -07001473 *arg = (unsigned long)cl;
1474 return 0;
1475
1476failure:
Stephen Hemminger87990462006-08-10 23:35:16 -07001477 if (rtab)
1478 qdisc_put_rtab(rtab);
1479 if (ctab)
1480 qdisc_put_rtab(ctab);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001481 return err;
1482}
1483
1484static struct tcf_proto **htb_find_tcf(struct Qdisc *sch, unsigned long arg)
1485{
1486 struct htb_sched *q = qdisc_priv(sch);
1487 struct htb_class *cl = (struct htb_class *)arg;
1488 struct tcf_proto **fl = cl ? &cl->filter_list : &q->filter_list;
Stephen Hemminger3bf72952006-08-10 23:31:08 -07001489
Linus Torvalds1da177e2005-04-16 15:20:36 -07001490 return fl;
1491}
1492
1493static unsigned long htb_bind_filter(struct Qdisc *sch, unsigned long parent,
Stephen Hemminger87990462006-08-10 23:35:16 -07001494 u32 classid)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001495{
Stephen Hemminger87990462006-08-10 23:35:16 -07001496 struct htb_class *cl = htb_find(classid, sch);
Stephen Hemminger3bf72952006-08-10 23:31:08 -07001497
Linus Torvalds1da177e2005-04-16 15:20:36 -07001498 /*if (cl && !cl->level) return 0;
Stephen Hemminger87990462006-08-10 23:35:16 -07001499 The line above used to be there to prevent attaching filters to
1500 leaves. But at least tc_index filter uses this just to get class
1501 for other reasons so that we have to allow for it.
1502 ----
1503 19.6.2002 As Werner explained it is ok - bind filter is just
1504 another way to "lock" the class - unlike "get" this lock can
1505 be broken by class during destroy IIUC.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001506 */
Stephen Hemminger87990462006-08-10 23:35:16 -07001507 if (cl)
1508 cl->filter_cnt++;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001509 return (unsigned long)cl;
1510}
1511
1512static void htb_unbind_filter(struct Qdisc *sch, unsigned long arg)
1513{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001514 struct htb_class *cl = (struct htb_class *)arg;
Stephen Hemminger3bf72952006-08-10 23:31:08 -07001515
Stephen Hemminger87990462006-08-10 23:35:16 -07001516 if (cl)
1517 cl->filter_cnt--;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001518}
1519
1520static void htb_walk(struct Qdisc *sch, struct qdisc_walker *arg)
1521{
1522 struct htb_sched *q = qdisc_priv(sch);
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001523 struct htb_class *cl;
1524 struct hlist_node *n;
1525 unsigned int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001526
1527 if (arg->stop)
1528 return;
1529
Patrick McHardyf4c1f3e2008-07-05 23:22:35 -07001530 for (i = 0; i < q->clhash.hashsize; i++) {
1531 hlist_for_each_entry(cl, n, &q->clhash.hash[i], common.hnode) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001532 if (arg->count < arg->skip) {
1533 arg->count++;
1534 continue;
1535 }
1536 if (arg->fn(sch, (unsigned long)cl, arg) < 0) {
1537 arg->stop = 1;
1538 return;
1539 }
1540 arg->count++;
1541 }
1542 }
1543}
1544
Eric Dumazet20fea082007-11-14 01:44:41 -08001545static const struct Qdisc_class_ops htb_class_ops = {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001546 .graft = htb_graft,
1547 .leaf = htb_leaf,
Patrick McHardy256d61b2006-11-29 17:37:05 -08001548 .qlen_notify = htb_qlen_notify,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001549 .get = htb_get,
1550 .put = htb_put,
1551 .change = htb_change_class,
1552 .delete = htb_delete,
1553 .walk = htb_walk,
1554 .tcf_chain = htb_find_tcf,
1555 .bind_tcf = htb_bind_filter,
1556 .unbind_tcf = htb_unbind_filter,
1557 .dump = htb_dump_class,
1558 .dump_stats = htb_dump_class_stats,
1559};
1560
Eric Dumazet20fea082007-11-14 01:44:41 -08001561static struct Qdisc_ops htb_qdisc_ops __read_mostly = {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001562 .next = NULL,
1563 .cl_ops = &htb_class_ops,
1564 .id = "htb",
1565 .priv_size = sizeof(struct htb_sched),
1566 .enqueue = htb_enqueue,
1567 .dequeue = htb_dequeue,
1568 .requeue = htb_requeue,
1569 .drop = htb_drop,
1570 .init = htb_init,
1571 .reset = htb_reset,
1572 .destroy = htb_destroy,
1573 .change = NULL /* htb_change */,
1574 .dump = htb_dump,
1575 .owner = THIS_MODULE,
1576};
1577
1578static int __init htb_module_init(void)
1579{
Stephen Hemminger87990462006-08-10 23:35:16 -07001580 return register_qdisc(&htb_qdisc_ops);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001581}
Stephen Hemminger87990462006-08-10 23:35:16 -07001582static void __exit htb_module_exit(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001583{
Stephen Hemminger87990462006-08-10 23:35:16 -07001584 unregister_qdisc(&htb_qdisc_ops);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001585}
Stephen Hemminger87990462006-08-10 23:35:16 -07001586
Linus Torvalds1da177e2005-04-16 15:20:36 -07001587module_init(htb_module_init)
1588module_exit(htb_module_exit)
1589MODULE_LICENSE("GPL");