Commit | Line | Data |
---|---|---|
87990467 | 1 | /* |
1da177e4 LT |
2 | * 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 | |
10297b99 | 14 | * Ondrej Kraus, <krauso@barr.cz> |
1da177e4 LT |
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 | |
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. | |
27 | * | |
28 | * $Id: sch_htb.c,v 1.25 2003/12/07 11:08:25 devik Exp devik $ | |
29 | */ | |
1da177e4 | 30 | #include <linux/module.h> |
1da177e4 LT |
31 | #include <linux/types.h> |
32 | #include <linux/kernel.h> | |
1da177e4 | 33 | #include <linux/string.h> |
1da177e4 | 34 | #include <linux/errno.h> |
1da177e4 LT |
35 | #include <linux/skbuff.h> |
36 | #include <linux/list.h> | |
37 | #include <linux/compiler.h> | |
0ba48053 | 38 | #include <linux/rbtree.h> |
dc5fc579 | 39 | #include <net/netlink.h> |
1da177e4 | 40 | #include <net/pkt_sched.h> |
1da177e4 LT |
41 | |
42 | /* HTB algorithm. | |
43 | Author: devik@cdi.cz | |
44 | ======================================================================== | |
45 | HTB is like TBF with multiple classes. It is also similar to CBQ because | |
10297b99 | 46 | it allows to assign priority to each class in hierarchy. |
1da177e4 LT |
47 | In fact it is another implementation of Floyd's formal sharing. |
48 | ||
49 | Levels: | |
10297b99 | 50 | Each class is assigned level. Leaf has ALWAYS level 0 and root |
1da177e4 LT |
51 | classes have level TC_HTB_MAXDEPTH-1. Interior nodes has level |
52 | one less than their parent. | |
53 | */ | |
54 | ||
87990467 | 55 | #define HTB_HSIZE 16 /* classid hash size */ |
87990467 SH |
56 | #define HTB_HYSTERESIS 1 /* whether to use mode hysteresis for speedup */ |
57 | #define HTB_VER 0x30011 /* major must be matched with number suplied by TC as version */ | |
1da177e4 LT |
58 | |
59 | #if HTB_VER >> 16 != TC_HTB_PROTOVER | |
60 | #error "Mismatched sch_htb.c and pkt_sch.h" | |
61 | #endif | |
62 | ||
1da177e4 LT |
63 | /* used internaly to keep status of single class */ |
64 | enum htb_cmode { | |
87990467 SH |
65 | HTB_CANT_SEND, /* class can't send and can't borrow */ |
66 | HTB_MAY_BORROW, /* class can't send but may borrow */ | |
67 | HTB_CAN_SEND /* class can send */ | |
1da177e4 LT |
68 | }; |
69 | ||
70 | /* interior & leaf nodes; props specific to leaves are marked L: */ | |
87990467 SH |
71 | struct htb_class { |
72 | /* general class parameters */ | |
73 | u32 classid; | |
74 | struct gnet_stats_basic bstats; | |
75 | struct gnet_stats_queue qstats; | |
76 | struct gnet_stats_rate_est rate_est; | |
77 | struct tc_htb_xstats xstats; /* our special stats */ | |
78 | int refcnt; /* usage count of this class */ | |
1da177e4 | 79 | |
87990467 SH |
80 | /* topology */ |
81 | int level; /* our level (see above) */ | |
82 | struct htb_class *parent; /* parent class */ | |
0cef296d | 83 | struct hlist_node hlist; /* classid hash list item */ |
87990467 SH |
84 | struct list_head sibling; /* sibling list item */ |
85 | struct list_head children; /* children list */ | |
86 | ||
87 | 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 */ | |
fb983d45 | 108 | psched_time_t pq_key; |
87990467 SH |
109 | |
110 | int prio_activity; /* for which prios are we active */ | |
111 | enum htb_cmode cmode; /* current mode of the class */ | |
112 | ||
113 | /* class attached filters */ | |
114 | struct tcf_proto *filter_list; | |
115 | int filter_cnt; | |
116 | ||
117 | 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 */ | |
160d5e10 JP |
126 | |
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. */ | |
1da177e4 LT |
130 | }; |
131 | ||
87990467 SH |
132 | static inline long L2T(struct htb_class *cl, struct qdisc_rate_table *rate, |
133 | int size) | |
134 | { | |
e9bef55d JDB |
135 | long result = qdisc_l2t(rate, size); |
136 | return result; | |
1da177e4 LT |
137 | } |
138 | ||
87990467 SH |
139 | struct htb_sched { |
140 | struct list_head root; /* root classes list */ | |
0cef296d SH |
141 | struct hlist_head hash[HTB_HSIZE]; /* hashed by classid */ |
142 | struct list_head drops[TC_HTB_NUMPRIO];/* active leaves (for drops) */ | |
87990467 SH |
143 | |
144 | /* self list - roots of self generating tree */ | |
145 | struct rb_root row[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO]; | |
146 | int row_mask[TC_HTB_MAXDEPTH]; | |
147 | struct rb_node *ptr[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO]; | |
148 | u32 last_ptr_id[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO]; | |
1da177e4 | 149 | |
87990467 SH |
150 | /* self wait list - roots of wait PQs per row */ |
151 | struct rb_root wait_pq[TC_HTB_MAXDEPTH]; | |
1da177e4 | 152 | |
87990467 | 153 | /* time of nearest event per level (row) */ |
fb983d45 | 154 | psched_time_t near_ev_cache[TC_HTB_MAXDEPTH]; |
1da177e4 | 155 | |
87990467 SH |
156 | /* whether we hit non-work conserving class during this dequeue; we use */ |
157 | int nwc_hit; /* this to disable mindelay complaint in dequeue */ | |
1da177e4 | 158 | |
87990467 | 159 | int defcls; /* class where unclassified flows go to */ |
1da177e4 | 160 | |
87990467 SH |
161 | /* filters for qdisc itself */ |
162 | struct tcf_proto *filter_list; | |
163 | int filter_cnt; | |
1da177e4 | 164 | |
87990467 SH |
165 | int rate2quantum; /* quant = rate / rate2quantum */ |
166 | psched_time_t now; /* cached dequeue time */ | |
fb983d45 | 167 | struct qdisc_watchdog watchdog; |
1da177e4 | 168 | |
87990467 SH |
169 | /* non shaped skbs; let them go directly thru */ |
170 | struct sk_buff_head direct_queue; | |
171 | int direct_qlen; /* max qlen of above */ | |
172 | ||
173 | long direct_pkts; | |
1da177e4 LT |
174 | }; |
175 | ||
176 | /* compute hash of size HTB_HSIZE for given handle */ | |
87990467 | 177 | static inline int htb_hash(u32 h) |
1da177e4 LT |
178 | { |
179 | #if HTB_HSIZE != 16 | |
87990467 | 180 | #error "Declare new hash for your HTB_HSIZE" |
1da177e4 | 181 | #endif |
87990467 SH |
182 | h ^= h >> 8; /* stolen from cbq_hash */ |
183 | h ^= h >> 4; | |
184 | return h & 0xf; | |
1da177e4 LT |
185 | } |
186 | ||
187 | /* find class in global hash table using given handle */ | |
87990467 | 188 | static inline struct htb_class *htb_find(u32 handle, struct Qdisc *sch) |
1da177e4 LT |
189 | { |
190 | struct htb_sched *q = qdisc_priv(sch); | |
0cef296d SH |
191 | struct hlist_node *p; |
192 | struct htb_class *cl; | |
193 | ||
87990467 | 194 | if (TC_H_MAJ(handle) != sch->handle) |
1da177e4 | 195 | return NULL; |
87990467 | 196 | |
0cef296d | 197 | hlist_for_each_entry(cl, p, q->hash + htb_hash(handle), hlist) { |
1da177e4 LT |
198 | if (cl->classid == handle) |
199 | return cl; | |
200 | } | |
201 | return NULL; | |
202 | } | |
203 | ||
204 | /** | |
205 | * htb_classify - classify a packet into class | |
206 | * | |
207 | * It returns NULL if the packet should be dropped or -1 if the packet | |
208 | * should be passed directly thru. In all other cases leaf class is returned. | |
209 | * We allow direct class selection by classid in priority. The we examine | |
210 | * filters in qdisc and in inner nodes (if higher filter points to the inner | |
211 | * node). If we end up with classid MAJOR:0 we enqueue the skb into special | |
10297b99 | 212 | * internal fifo (direct). These packets then go directly thru. If we still |
1da177e4 LT |
213 | * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessfull |
214 | * then finish and return direct queue. | |
215 | */ | |
216 | #define HTB_DIRECT (struct htb_class*)-1 | |
1da177e4 | 217 | |
87990467 SH |
218 | static struct htb_class *htb_classify(struct sk_buff *skb, struct Qdisc *sch, |
219 | int *qerr) | |
1da177e4 LT |
220 | { |
221 | struct htb_sched *q = qdisc_priv(sch); | |
222 | struct htb_class *cl; | |
223 | struct tcf_result res; | |
224 | struct tcf_proto *tcf; | |
225 | int result; | |
226 | ||
227 | /* allow to select class by setting skb->priority to valid classid; | |
228 | note that nfmark can be used too by attaching filter fw with no | |
229 | rules in it */ | |
230 | if (skb->priority == sch->handle) | |
87990467 SH |
231 | return HTB_DIRECT; /* X:0 (direct flow) selected */ |
232 | if ((cl = htb_find(skb->priority, sch)) != NULL && cl->level == 0) | |
1da177e4 LT |
233 | return cl; |
234 | ||
29f1df6c | 235 | *qerr = NET_XMIT_BYPASS; |
1da177e4 LT |
236 | tcf = q->filter_list; |
237 | while (tcf && (result = tc_classify(skb, tcf, &res)) >= 0) { | |
238 | #ifdef CONFIG_NET_CLS_ACT | |
239 | switch (result) { | |
240 | case TC_ACT_QUEUED: | |
87990467 | 241 | case TC_ACT_STOLEN: |
1da177e4 LT |
242 | *qerr = NET_XMIT_SUCCESS; |
243 | case TC_ACT_SHOT: | |
244 | return NULL; | |
245 | } | |
1da177e4 | 246 | #endif |
87990467 | 247 | if ((cl = (void *)res.class) == NULL) { |
1da177e4 | 248 | if (res.classid == sch->handle) |
87990467 SH |
249 | return HTB_DIRECT; /* X:0 (direct flow) */ |
250 | if ((cl = htb_find(res.classid, sch)) == NULL) | |
251 | break; /* filter selected invalid classid */ | |
1da177e4 LT |
252 | } |
253 | if (!cl->level) | |
87990467 | 254 | return cl; /* we hit leaf; return it */ |
1da177e4 LT |
255 | |
256 | /* we have got inner class; apply inner filter chain */ | |
257 | tcf = cl->filter_list; | |
258 | } | |
259 | /* classification failed; try to use default class */ | |
87990467 | 260 | cl = htb_find(TC_H_MAKE(TC_H_MAJ(sch->handle), q->defcls), sch); |
1da177e4 | 261 | if (!cl || cl->level) |
87990467 | 262 | return HTB_DIRECT; /* bad default .. this is safe bet */ |
1da177e4 LT |
263 | return cl; |
264 | } | |
265 | ||
1da177e4 LT |
266 | /** |
267 | * htb_add_to_id_tree - adds class to the round robin list | |
268 | * | |
269 | * Routine adds class to the list (actually tree) sorted by classid. | |
270 | * Make sure that class is not already on such list for given prio. | |
271 | */ | |
87990467 SH |
272 | static void htb_add_to_id_tree(struct rb_root *root, |
273 | struct htb_class *cl, int prio) | |
1da177e4 LT |
274 | { |
275 | struct rb_node **p = &root->rb_node, *parent = NULL; | |
3bf72957 | 276 | |
1da177e4 | 277 | while (*p) { |
87990467 SH |
278 | struct htb_class *c; |
279 | parent = *p; | |
1da177e4 | 280 | c = rb_entry(parent, struct htb_class, node[prio]); |
3bf72957 | 281 | |
1da177e4 LT |
282 | if (cl->classid > c->classid) |
283 | p = &parent->rb_right; | |
87990467 | 284 | else |
1da177e4 LT |
285 | p = &parent->rb_left; |
286 | } | |
287 | rb_link_node(&cl->node[prio], parent, p); | |
288 | rb_insert_color(&cl->node[prio], root); | |
289 | } | |
290 | ||
291 | /** | |
292 | * htb_add_to_wait_tree - adds class to the event queue with delay | |
293 | * | |
294 | * The class is added to priority event queue to indicate that class will | |
295 | * change its mode in cl->pq_key microseconds. Make sure that class is not | |
296 | * already in the queue. | |
297 | */ | |
87990467 SH |
298 | static void htb_add_to_wait_tree(struct htb_sched *q, |
299 | struct htb_class *cl, long delay) | |
1da177e4 LT |
300 | { |
301 | struct rb_node **p = &q->wait_pq[cl->level].rb_node, *parent = NULL; | |
3bf72957 | 302 | |
fb983d45 PM |
303 | cl->pq_key = q->now + delay; |
304 | if (cl->pq_key == q->now) | |
1da177e4 LT |
305 | cl->pq_key++; |
306 | ||
307 | /* update the nearest event cache */ | |
fb983d45 | 308 | if (q->near_ev_cache[cl->level] > cl->pq_key) |
1da177e4 | 309 | q->near_ev_cache[cl->level] = cl->pq_key; |
87990467 | 310 | |
1da177e4 | 311 | while (*p) { |
87990467 SH |
312 | struct htb_class *c; |
313 | parent = *p; | |
1da177e4 | 314 | c = rb_entry(parent, struct htb_class, pq_node); |
fb983d45 | 315 | if (cl->pq_key >= c->pq_key) |
1da177e4 | 316 | p = &parent->rb_right; |
87990467 | 317 | else |
1da177e4 LT |
318 | p = &parent->rb_left; |
319 | } | |
320 | rb_link_node(&cl->pq_node, parent, p); | |
321 | rb_insert_color(&cl->pq_node, &q->wait_pq[cl->level]); | |
322 | } | |
323 | ||
324 | /** | |
325 | * htb_next_rb_node - finds next node in binary tree | |
326 | * | |
327 | * When we are past last key we return NULL. | |
328 | * Average complexity is 2 steps per call. | |
329 | */ | |
3696f625 | 330 | static inline void htb_next_rb_node(struct rb_node **n) |
1da177e4 LT |
331 | { |
332 | *n = rb_next(*n); | |
333 | } | |
334 | ||
335 | /** | |
336 | * htb_add_class_to_row - add class to its row | |
337 | * | |
338 | * The class is added to row at priorities marked in mask. | |
339 | * It does nothing if mask == 0. | |
340 | */ | |
87990467 SH |
341 | static inline void htb_add_class_to_row(struct htb_sched *q, |
342 | struct htb_class *cl, int mask) | |
1da177e4 | 343 | { |
1da177e4 LT |
344 | q->row_mask[cl->level] |= mask; |
345 | while (mask) { | |
346 | int prio = ffz(~mask); | |
347 | mask &= ~(1 << prio); | |
87990467 | 348 | htb_add_to_id_tree(q->row[cl->level] + prio, cl, prio); |
1da177e4 LT |
349 | } |
350 | } | |
351 | ||
3696f625 SH |
352 | /* If this triggers, it is a bug in this code, but it need not be fatal */ |
353 | static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root) | |
354 | { | |
81771b3b | 355 | if (RB_EMPTY_NODE(rb)) { |
3696f625 SH |
356 | WARN_ON(1); |
357 | } else { | |
358 | rb_erase(rb, root); | |
359 | RB_CLEAR_NODE(rb); | |
360 | } | |
361 | } | |
362 | ||
363 | ||
1da177e4 LT |
364 | /** |
365 | * htb_remove_class_from_row - removes class from its row | |
366 | * | |
367 | * The class is removed from row at priorities marked in mask. | |
368 | * It does nothing if mask == 0. | |
369 | */ | |
87990467 SH |
370 | static inline void htb_remove_class_from_row(struct htb_sched *q, |
371 | struct htb_class *cl, int mask) | |
1da177e4 LT |
372 | { |
373 | int m = 0; | |
3bf72957 | 374 | |
1da177e4 LT |
375 | while (mask) { |
376 | int prio = ffz(~mask); | |
3696f625 | 377 | |
1da177e4 | 378 | mask &= ~(1 << prio); |
87990467 SH |
379 | if (q->ptr[cl->level][prio] == cl->node + prio) |
380 | htb_next_rb_node(q->ptr[cl->level] + prio); | |
3696f625 SH |
381 | |
382 | htb_safe_rb_erase(cl->node + prio, q->row[cl->level] + prio); | |
87990467 | 383 | if (!q->row[cl->level][prio].rb_node) |
1da177e4 LT |
384 | m |= 1 << prio; |
385 | } | |
1da177e4 LT |
386 | q->row_mask[cl->level] &= ~m; |
387 | } | |
388 | ||
389 | /** | |
390 | * htb_activate_prios - creates active classe's feed chain | |
391 | * | |
392 | * The class is connected to ancestors and/or appropriate rows | |
10297b99 | 393 | * for priorities it is participating on. cl->cmode must be new |
1da177e4 LT |
394 | * (activated) mode. It does nothing if cl->prio_activity == 0. |
395 | */ | |
87990467 | 396 | static void htb_activate_prios(struct htb_sched *q, struct htb_class *cl) |
1da177e4 LT |
397 | { |
398 | struct htb_class *p = cl->parent; | |
87990467 | 399 | long m, mask = cl->prio_activity; |
1da177e4 LT |
400 | |
401 | while (cl->cmode == HTB_MAY_BORROW && p && mask) { | |
87990467 SH |
402 | m = mask; |
403 | while (m) { | |
1da177e4 LT |
404 | int prio = ffz(~m); |
405 | m &= ~(1 << prio); | |
87990467 | 406 | |
1da177e4 LT |
407 | if (p->un.inner.feed[prio].rb_node) |
408 | /* parent already has its feed in use so that | |
409 | reset bit in mask as parent is already ok */ | |
410 | mask &= ~(1 << prio); | |
87990467 SH |
411 | |
412 | htb_add_to_id_tree(p->un.inner.feed + prio, cl, prio); | |
1da177e4 | 413 | } |
1da177e4 | 414 | p->prio_activity |= mask; |
87990467 SH |
415 | cl = p; |
416 | p = cl->parent; | |
3bf72957 | 417 | |
1da177e4 LT |
418 | } |
419 | if (cl->cmode == HTB_CAN_SEND && mask) | |
87990467 | 420 | htb_add_class_to_row(q, cl, mask); |
1da177e4 LT |
421 | } |
422 | ||
423 | /** | |
424 | * htb_deactivate_prios - remove class from feed chain | |
425 | * | |
10297b99 | 426 | * cl->cmode must represent old mode (before deactivation). It does |
1da177e4 LT |
427 | * nothing if cl->prio_activity == 0. Class is removed from all feed |
428 | * chains and rows. | |
429 | */ | |
430 | static void htb_deactivate_prios(struct htb_sched *q, struct htb_class *cl) | |
431 | { | |
432 | struct htb_class *p = cl->parent; | |
87990467 | 433 | long m, mask = cl->prio_activity; |
1da177e4 LT |
434 | |
435 | while (cl->cmode == HTB_MAY_BORROW && p && mask) { | |
87990467 SH |
436 | m = mask; |
437 | mask = 0; | |
1da177e4 LT |
438 | while (m) { |
439 | int prio = ffz(~m); | |
440 | m &= ~(1 << prio); | |
87990467 SH |
441 | |
442 | if (p->un.inner.ptr[prio] == cl->node + prio) { | |
1da177e4 LT |
443 | /* we are removing child which is pointed to from |
444 | parent feed - forget the pointer but remember | |
445 | classid */ | |
446 | p->un.inner.last_ptr_id[prio] = cl->classid; | |
447 | p->un.inner.ptr[prio] = NULL; | |
448 | } | |
87990467 | 449 | |
3696f625 | 450 | htb_safe_rb_erase(cl->node + prio, p->un.inner.feed + prio); |
87990467 SH |
451 | |
452 | if (!p->un.inner.feed[prio].rb_node) | |
1da177e4 LT |
453 | mask |= 1 << prio; |
454 | } | |
3bf72957 | 455 | |
1da177e4 | 456 | p->prio_activity &= ~mask; |
87990467 SH |
457 | cl = p; |
458 | p = cl->parent; | |
3bf72957 | 459 | |
1da177e4 | 460 | } |
87990467 SH |
461 | if (cl->cmode == HTB_CAN_SEND && mask) |
462 | htb_remove_class_from_row(q, cl, mask); | |
1da177e4 LT |
463 | } |
464 | ||
18a63e86 SH |
465 | #if HTB_HYSTERESIS |
466 | static inline long htb_lowater(const struct htb_class *cl) | |
467 | { | |
468 | return cl->cmode != HTB_CANT_SEND ? -cl->cbuffer : 0; | |
469 | } | |
470 | static inline long htb_hiwater(const struct htb_class *cl) | |
471 | { | |
472 | return cl->cmode == HTB_CAN_SEND ? -cl->buffer : 0; | |
473 | } | |
474 | #else | |
475 | #define htb_lowater(cl) (0) | |
476 | #define htb_hiwater(cl) (0) | |
477 | #endif | |
478 | ||
1da177e4 LT |
479 | /** |
480 | * htb_class_mode - computes and returns current class mode | |
481 | * | |
482 | * It computes cl's mode at time cl->t_c+diff and returns it. If mode | |
483 | * is not HTB_CAN_SEND then cl->pq_key is updated to time difference | |
10297b99 | 484 | * from now to time when cl will change its state. |
1da177e4 | 485 | * Also it is worth to note that class mode doesn't change simply |
10297b99 | 486 | * at cl->{c,}tokens == 0 but there can rather be hysteresis of |
1da177e4 LT |
487 | * 0 .. -cl->{c,}buffer range. It is meant to limit number of |
488 | * mode transitions per time unit. The speed gain is about 1/6. | |
489 | */ | |
87990467 SH |
490 | static inline enum htb_cmode |
491 | htb_class_mode(struct htb_class *cl, long *diff) | |
1da177e4 | 492 | { |
87990467 | 493 | long toks; |
1da177e4 | 494 | |
87990467 SH |
495 | if ((toks = (cl->ctokens + *diff)) < htb_lowater(cl)) { |
496 | *diff = -toks; | |
497 | return HTB_CANT_SEND; | |
498 | } | |
18a63e86 | 499 | |
87990467 SH |
500 | if ((toks = (cl->tokens + *diff)) >= htb_hiwater(cl)) |
501 | return HTB_CAN_SEND; | |
1da177e4 | 502 | |
87990467 SH |
503 | *diff = -toks; |
504 | return HTB_MAY_BORROW; | |
1da177e4 LT |
505 | } |
506 | ||
507 | /** | |
508 | * htb_change_class_mode - changes classe's mode | |
509 | * | |
510 | * This should be the only way how to change classe's mode under normal | |
511 | * cirsumstances. Routine will update feed lists linkage, change mode | |
512 | * and add class to the wait event queue if appropriate. New mode should | |
513 | * be different from old one and cl->pq_key has to be valid if changing | |
514 | * to mode other than HTB_CAN_SEND (see htb_add_to_wait_tree). | |
515 | */ | |
87990467 | 516 | static void |
1da177e4 | 517 | htb_change_class_mode(struct htb_sched *q, struct htb_class *cl, long *diff) |
87990467 SH |
518 | { |
519 | enum htb_cmode new_mode = htb_class_mode(cl, diff); | |
1da177e4 LT |
520 | |
521 | if (new_mode == cl->cmode) | |
87990467 SH |
522 | return; |
523 | ||
524 | if (cl->prio_activity) { /* not necessary: speed optimization */ | |
525 | if (cl->cmode != HTB_CANT_SEND) | |
526 | htb_deactivate_prios(q, cl); | |
1da177e4 | 527 | cl->cmode = new_mode; |
87990467 SH |
528 | if (new_mode != HTB_CANT_SEND) |
529 | htb_activate_prios(q, cl); | |
530 | } else | |
1da177e4 LT |
531 | cl->cmode = new_mode; |
532 | } | |
533 | ||
534 | /** | |
10297b99 | 535 | * htb_activate - inserts leaf cl into appropriate active feeds |
1da177e4 LT |
536 | * |
537 | * Routine learns (new) priority of leaf and activates feed chain | |
538 | * for the prio. It can be called on already active leaf safely. | |
539 | * It also adds leaf into droplist. | |
540 | */ | |
87990467 | 541 | static inline void htb_activate(struct htb_sched *q, struct htb_class *cl) |
1da177e4 LT |
542 | { |
543 | BUG_TRAP(!cl->level && cl->un.leaf.q && cl->un.leaf.q->q.qlen); | |
3bf72957 | 544 | |
1da177e4 LT |
545 | if (!cl->prio_activity) { |
546 | cl->prio_activity = 1 << (cl->un.leaf.aprio = cl->un.leaf.prio); | |
87990467 SH |
547 | htb_activate_prios(q, cl); |
548 | list_add_tail(&cl->un.leaf.drop_list, | |
549 | q->drops + cl->un.leaf.aprio); | |
1da177e4 LT |
550 | } |
551 | } | |
552 | ||
553 | /** | |
10297b99 | 554 | * htb_deactivate - remove leaf cl from active feeds |
1da177e4 LT |
555 | * |
556 | * Make sure that leaf is active. In the other words it can't be called | |
557 | * with non-active leaf. It also removes class from the drop list. | |
558 | */ | |
87990467 | 559 | static inline void htb_deactivate(struct htb_sched *q, struct htb_class *cl) |
1da177e4 LT |
560 | { |
561 | BUG_TRAP(cl->prio_activity); | |
3bf72957 | 562 | |
87990467 | 563 | htb_deactivate_prios(q, cl); |
1da177e4 LT |
564 | cl->prio_activity = 0; |
565 | list_del_init(&cl->un.leaf.drop_list); | |
566 | } | |
567 | ||
568 | static int htb_enqueue(struct sk_buff *skb, struct Qdisc *sch) | |
569 | { | |
87990467 SH |
570 | int ret; |
571 | struct htb_sched *q = qdisc_priv(sch); | |
572 | struct htb_class *cl = htb_classify(skb, sch, &ret); | |
573 | ||
574 | if (cl == HTB_DIRECT) { | |
575 | /* enqueue to helper queue */ | |
576 | if (q->direct_queue.qlen < q->direct_qlen) { | |
577 | __skb_queue_tail(&q->direct_queue, skb); | |
578 | q->direct_pkts++; | |
579 | } else { | |
580 | kfree_skb(skb); | |
581 | sch->qstats.drops++; | |
582 | return NET_XMIT_DROP; | |
583 | } | |
1da177e4 | 584 | #ifdef CONFIG_NET_CLS_ACT |
87990467 SH |
585 | } else if (!cl) { |
586 | if (ret == NET_XMIT_BYPASS) | |
587 | sch->qstats.drops++; | |
588 | kfree_skb(skb); | |
589 | return ret; | |
1da177e4 | 590 | #endif |
87990467 SH |
591 | } else if (cl->un.leaf.q->enqueue(skb, cl->un.leaf.q) != |
592 | NET_XMIT_SUCCESS) { | |
593 | sch->qstats.drops++; | |
594 | cl->qstats.drops++; | |
595 | return NET_XMIT_DROP; | |
596 | } else { | |
c9726d68 RM |
597 | cl->bstats.packets += |
598 | skb_is_gso(skb)?skb_shinfo(skb)->gso_segs:1; | |
87990467 SH |
599 | cl->bstats.bytes += skb->len; |
600 | htb_activate(q, cl); | |
601 | } | |
602 | ||
603 | sch->q.qlen++; | |
c9726d68 | 604 | sch->bstats.packets += skb_is_gso(skb)?skb_shinfo(skb)->gso_segs:1; |
87990467 SH |
605 | sch->bstats.bytes += skb->len; |
606 | return NET_XMIT_SUCCESS; | |
1da177e4 LT |
607 | } |
608 | ||
609 | /* TODO: requeuing packet charges it to policers again !! */ | |
610 | static int htb_requeue(struct sk_buff *skb, struct Qdisc *sch) | |
611 | { | |
87990467 SH |
612 | struct htb_sched *q = qdisc_priv(sch); |
613 | int ret = NET_XMIT_SUCCESS; | |
614 | struct htb_class *cl = htb_classify(skb, sch, &ret); | |
615 | struct sk_buff *tskb; | |
616 | ||
617 | if (cl == HTB_DIRECT || !cl) { | |
618 | /* enqueue to helper queue */ | |
619 | if (q->direct_queue.qlen < q->direct_qlen && cl) { | |
620 | __skb_queue_head(&q->direct_queue, skb); | |
621 | } else { | |
622 | __skb_queue_head(&q->direct_queue, skb); | |
623 | tskb = __skb_dequeue_tail(&q->direct_queue); | |
624 | kfree_skb(tskb); | |
625 | sch->qstats.drops++; | |
626 | return NET_XMIT_CN; | |
627 | } | |
628 | } else if (cl->un.leaf.q->ops->requeue(skb, cl->un.leaf.q) != | |
629 | NET_XMIT_SUCCESS) { | |
630 | sch->qstats.drops++; | |
631 | cl->qstats.drops++; | |
632 | return NET_XMIT_DROP; | |
633 | } else | |
634 | htb_activate(q, cl); | |
635 | ||
636 | sch->q.qlen++; | |
637 | sch->qstats.requeues++; | |
638 | return NET_XMIT_SUCCESS; | |
1da177e4 LT |
639 | } |
640 | ||
1da177e4 LT |
641 | /** |
642 | * htb_charge_class - charges amount "bytes" to leaf and ancestors | |
643 | * | |
644 | * Routine assumes that packet "bytes" long was dequeued from leaf cl | |
645 | * borrowing from "level". It accounts bytes to ceil leaky bucket for | |
646 | * leaf and all ancestors and to rate bucket for ancestors at levels | |
647 | * "level" and higher. It also handles possible change of mode resulting | |
648 | * from the update. Note that mode can also increase here (MAY_BORROW to | |
649 | * CAN_SEND) because we can use more precise clock that event queue here. | |
650 | * In such case we remove class from event queue first. | |
651 | */ | |
87990467 | 652 | static void htb_charge_class(struct htb_sched *q, struct htb_class *cl, |
c9726d68 | 653 | int level, struct sk_buff *skb) |
87990467 | 654 | { |
c9726d68 | 655 | int bytes = skb->len; |
87990467 | 656 | long toks, diff; |
1da177e4 | 657 | enum htb_cmode old_mode; |
1da177e4 LT |
658 | |
659 | #define HTB_ACCNT(T,B,R) toks = diff + cl->T; \ | |
660 | if (toks > cl->B) toks = cl->B; \ | |
661 | toks -= L2T(cl, cl->R, bytes); \ | |
662 | if (toks <= -cl->mbuffer) toks = 1-cl->mbuffer; \ | |
663 | cl->T = toks | |
664 | ||
665 | while (cl) { | |
03cc45c0 | 666 | diff = psched_tdiff_bounded(q->now, cl->t_c, cl->mbuffer); |
1da177e4 | 667 | if (cl->level >= level) { |
87990467 SH |
668 | if (cl->level == level) |
669 | cl->xstats.lends++; | |
670 | HTB_ACCNT(tokens, buffer, rate); | |
1da177e4 LT |
671 | } else { |
672 | cl->xstats.borrows++; | |
87990467 | 673 | cl->tokens += diff; /* we moved t_c; update tokens */ |
1da177e4 | 674 | } |
87990467 | 675 | HTB_ACCNT(ctokens, cbuffer, ceil); |
1da177e4 | 676 | cl->t_c = q->now; |
1da177e4 | 677 | |
87990467 SH |
678 | old_mode = cl->cmode; |
679 | diff = 0; | |
680 | htb_change_class_mode(q, cl, &diff); | |
1da177e4 LT |
681 | if (old_mode != cl->cmode) { |
682 | if (old_mode != HTB_CAN_SEND) | |
3696f625 | 683 | htb_safe_rb_erase(&cl->pq_node, q->wait_pq + cl->level); |
1da177e4 | 684 | if (cl->cmode != HTB_CAN_SEND) |
87990467 | 685 | htb_add_to_wait_tree(q, cl, diff); |
1da177e4 | 686 | } |
1da177e4 LT |
687 | |
688 | /* update byte stats except for leaves which are already updated */ | |
689 | if (cl->level) { | |
690 | cl->bstats.bytes += bytes; | |
c9726d68 RM |
691 | cl->bstats.packets += skb_is_gso(skb)? |
692 | skb_shinfo(skb)->gso_segs:1; | |
1da177e4 LT |
693 | } |
694 | cl = cl->parent; | |
695 | } | |
696 | } | |
697 | ||
698 | /** | |
699 | * htb_do_events - make mode changes to classes at the level | |
700 | * | |
fb983d45 | 701 | * Scans event queue for pending events and applies them. Returns time of |
1da177e4 | 702 | * next pending event (0 for no event in pq). |
fb983d45 | 703 | * Note: Applied are events whose have cl->pq_key <= q->now. |
1da177e4 | 704 | */ |
fb983d45 | 705 | static psched_time_t htb_do_events(struct htb_sched *q, int level) |
1da177e4 LT |
706 | { |
707 | int i; | |
3bf72957 | 708 | |
1da177e4 LT |
709 | for (i = 0; i < 500; i++) { |
710 | struct htb_class *cl; | |
711 | long diff; | |
30bdbe39 AM |
712 | struct rb_node *p = rb_first(&q->wait_pq[level]); |
713 | ||
87990467 SH |
714 | if (!p) |
715 | return 0; | |
1da177e4 LT |
716 | |
717 | cl = rb_entry(p, struct htb_class, pq_node); | |
fb983d45 PM |
718 | if (cl->pq_key > q->now) |
719 | return cl->pq_key; | |
720 | ||
3696f625 | 721 | htb_safe_rb_erase(p, q->wait_pq + level); |
03cc45c0 | 722 | diff = psched_tdiff_bounded(q->now, cl->t_c, cl->mbuffer); |
87990467 | 723 | htb_change_class_mode(q, cl, &diff); |
1da177e4 | 724 | if (cl->cmode != HTB_CAN_SEND) |
87990467 | 725 | htb_add_to_wait_tree(q, cl, diff); |
1da177e4 LT |
726 | } |
727 | if (net_ratelimit()) | |
728 | printk(KERN_WARNING "htb: too many events !\n"); | |
fb983d45 | 729 | return q->now + PSCHED_TICKS_PER_SEC / 10; |
1da177e4 LT |
730 | } |
731 | ||
732 | /* Returns class->node+prio from id-tree where classe's id is >= id. NULL | |
733 | is no such one exists. */ | |
87990467 SH |
734 | static struct rb_node *htb_id_find_next_upper(int prio, struct rb_node *n, |
735 | u32 id) | |
1da177e4 LT |
736 | { |
737 | struct rb_node *r = NULL; | |
738 | while (n) { | |
87990467 SH |
739 | struct htb_class *cl = |
740 | rb_entry(n, struct htb_class, node[prio]); | |
741 | if (id == cl->classid) | |
742 | return n; | |
743 | ||
1da177e4 LT |
744 | if (id > cl->classid) { |
745 | n = n->rb_right; | |
746 | } else { | |
747 | r = n; | |
748 | n = n->rb_left; | |
749 | } | |
750 | } | |
751 | return r; | |
752 | } | |
753 | ||
754 | /** | |
755 | * htb_lookup_leaf - returns next leaf class in DRR order | |
756 | * | |
757 | * Find leaf where current feed pointers points to. | |
758 | */ | |
87990467 SH |
759 | static struct htb_class *htb_lookup_leaf(struct rb_root *tree, int prio, |
760 | struct rb_node **pptr, u32 * pid) | |
1da177e4 LT |
761 | { |
762 | int i; | |
763 | struct { | |
764 | struct rb_node *root; | |
765 | struct rb_node **pptr; | |
766 | u32 *pid; | |
87990467 SH |
767 | } stk[TC_HTB_MAXDEPTH], *sp = stk; |
768 | ||
1da177e4 LT |
769 | BUG_TRAP(tree->rb_node); |
770 | sp->root = tree->rb_node; | |
771 | sp->pptr = pptr; | |
772 | sp->pid = pid; | |
773 | ||
774 | for (i = 0; i < 65535; i++) { | |
87990467 | 775 | if (!*sp->pptr && *sp->pid) { |
10297b99 | 776 | /* ptr was invalidated but id is valid - try to recover |
1da177e4 | 777 | the original or next ptr */ |
87990467 SH |
778 | *sp->pptr = |
779 | htb_id_find_next_upper(prio, sp->root, *sp->pid); | |
1da177e4 | 780 | } |
87990467 SH |
781 | *sp->pid = 0; /* ptr is valid now so that remove this hint as it |
782 | can become out of date quickly */ | |
783 | if (!*sp->pptr) { /* we are at right end; rewind & go up */ | |
1da177e4 | 784 | *sp->pptr = sp->root; |
87990467 | 785 | while ((*sp->pptr)->rb_left) |
1da177e4 LT |
786 | *sp->pptr = (*sp->pptr)->rb_left; |
787 | if (sp > stk) { | |
788 | sp--; | |
87990467 SH |
789 | BUG_TRAP(*sp->pptr); |
790 | if (!*sp->pptr) | |
791 | return NULL; | |
792 | htb_next_rb_node(sp->pptr); | |
1da177e4 LT |
793 | } |
794 | } else { | |
795 | struct htb_class *cl; | |
87990467 SH |
796 | cl = rb_entry(*sp->pptr, struct htb_class, node[prio]); |
797 | if (!cl->level) | |
1da177e4 LT |
798 | return cl; |
799 | (++sp)->root = cl->un.inner.feed[prio].rb_node; | |
87990467 SH |
800 | sp->pptr = cl->un.inner.ptr + prio; |
801 | sp->pid = cl->un.inner.last_ptr_id + prio; | |
1da177e4 LT |
802 | } |
803 | } | |
804 | BUG_TRAP(0); | |
805 | return NULL; | |
806 | } | |
807 | ||
808 | /* dequeues packet at given priority and level; call only if | |
809 | you are sure that there is active class at prio/level */ | |
87990467 SH |
810 | static struct sk_buff *htb_dequeue_tree(struct htb_sched *q, int prio, |
811 | int level) | |
1da177e4 LT |
812 | { |
813 | struct sk_buff *skb = NULL; | |
87990467 | 814 | struct htb_class *cl, *start; |
1da177e4 | 815 | /* look initial class up in the row */ |
87990467 SH |
816 | start = cl = htb_lookup_leaf(q->row[level] + prio, prio, |
817 | q->ptr[level] + prio, | |
818 | q->last_ptr_id[level] + prio); | |
819 | ||
1da177e4 LT |
820 | do { |
821 | next: | |
87990467 SH |
822 | BUG_TRAP(cl); |
823 | if (!cl) | |
824 | return NULL; | |
1da177e4 LT |
825 | |
826 | /* class can be empty - it is unlikely but can be true if leaf | |
827 | qdisc drops packets in enqueue routine or if someone used | |
10297b99 | 828 | graft operation on the leaf since last dequeue; |
1da177e4 LT |
829 | simply deactivate and skip such class */ |
830 | if (unlikely(cl->un.leaf.q->q.qlen == 0)) { | |
831 | struct htb_class *next; | |
87990467 | 832 | htb_deactivate(q, cl); |
1da177e4 LT |
833 | |
834 | /* row/level might become empty */ | |
835 | if ((q->row_mask[level] & (1 << prio)) == 0) | |
87990467 | 836 | return NULL; |
1da177e4 | 837 | |
87990467 SH |
838 | next = htb_lookup_leaf(q->row[level] + prio, |
839 | prio, q->ptr[level] + prio, | |
840 | q->last_ptr_id[level] + prio); | |
841 | ||
842 | if (cl == start) /* fix start if we just deleted it */ | |
1da177e4 LT |
843 | start = next; |
844 | cl = next; | |
845 | goto next; | |
846 | } | |
87990467 SH |
847 | |
848 | skb = cl->un.leaf.q->dequeue(cl->un.leaf.q); | |
849 | if (likely(skb != NULL)) | |
1da177e4 LT |
850 | break; |
851 | if (!cl->warned) { | |
87990467 SH |
852 | printk(KERN_WARNING |
853 | "htb: class %X isn't work conserving ?!\n", | |
854 | cl->classid); | |
1da177e4 LT |
855 | cl->warned = 1; |
856 | } | |
857 | q->nwc_hit++; | |
87990467 SH |
858 | htb_next_rb_node((level ? cl->parent->un.inner.ptr : q-> |
859 | ptr[0]) + prio); | |
860 | cl = htb_lookup_leaf(q->row[level] + prio, prio, | |
861 | q->ptr[level] + prio, | |
862 | q->last_ptr_id[level] + prio); | |
1da177e4 LT |
863 | |
864 | } while (cl != start); | |
865 | ||
866 | if (likely(skb != NULL)) { | |
867 | if ((cl->un.leaf.deficit[level] -= skb->len) < 0) { | |
1da177e4 | 868 | cl->un.leaf.deficit[level] += cl->un.leaf.quantum; |
87990467 SH |
869 | htb_next_rb_node((level ? cl->parent->un.inner.ptr : q-> |
870 | ptr[0]) + prio); | |
1da177e4 LT |
871 | } |
872 | /* this used to be after charge_class but this constelation | |
873 | gives us slightly better performance */ | |
874 | if (!cl->un.leaf.q->q.qlen) | |
87990467 | 875 | htb_deactivate(q, cl); |
c9726d68 | 876 | htb_charge_class(q, cl, level, skb); |
1da177e4 LT |
877 | } |
878 | return skb; | |
879 | } | |
880 | ||
1da177e4 LT |
881 | static struct sk_buff *htb_dequeue(struct Qdisc *sch) |
882 | { | |
883 | struct sk_buff *skb = NULL; | |
884 | struct htb_sched *q = qdisc_priv(sch); | |
885 | int level; | |
fb983d45 | 886 | psched_time_t next_event; |
1da177e4 LT |
887 | |
888 | /* try to dequeue direct packets as high prio (!) to minimize cpu work */ | |
87990467 SH |
889 | skb = __skb_dequeue(&q->direct_queue); |
890 | if (skb != NULL) { | |
1da177e4 LT |
891 | sch->flags &= ~TCQ_F_THROTTLED; |
892 | sch->q.qlen--; | |
893 | return skb; | |
894 | } | |
895 | ||
87990467 SH |
896 | if (!sch->q.qlen) |
897 | goto fin; | |
3bebcda2 | 898 | q->now = psched_get_time(); |
1da177e4 | 899 | |
fb983d45 | 900 | next_event = q->now + 5 * PSCHED_TICKS_PER_SEC; |
1da177e4 LT |
901 | q->nwc_hit = 0; |
902 | for (level = 0; level < TC_HTB_MAXDEPTH; level++) { | |
903 | /* common case optimization - skip event handler quickly */ | |
904 | int m; | |
fb983d45 PM |
905 | psched_time_t event; |
906 | ||
907 | if (q->now >= q->near_ev_cache[level]) { | |
908 | event = htb_do_events(q, level); | |
2e4b3b0e PM |
909 | if (!event) |
910 | event = q->now + PSCHED_TICKS_PER_SEC; | |
911 | q->near_ev_cache[level] = event; | |
1da177e4 | 912 | } else |
fb983d45 PM |
913 | event = q->near_ev_cache[level]; |
914 | ||
915 | if (event && next_event > event) | |
916 | next_event = event; | |
87990467 | 917 | |
1da177e4 LT |
918 | m = ~q->row_mask[level]; |
919 | while (m != (int)(-1)) { | |
87990467 | 920 | int prio = ffz(m); |
1da177e4 | 921 | m |= 1 << prio; |
87990467 | 922 | skb = htb_dequeue_tree(q, prio, level); |
1da177e4 LT |
923 | if (likely(skb != NULL)) { |
924 | sch->q.qlen--; | |
925 | sch->flags &= ~TCQ_F_THROTTLED; | |
926 | goto fin; | |
927 | } | |
928 | } | |
929 | } | |
fb983d45 PM |
930 | sch->qstats.overlimits++; |
931 | qdisc_watchdog_schedule(&q->watchdog, next_event); | |
1da177e4 | 932 | fin: |
1da177e4 LT |
933 | return skb; |
934 | } | |
935 | ||
936 | /* try to drop from each class (by prio) until one succeed */ | |
87990467 | 937 | static unsigned int htb_drop(struct Qdisc *sch) |
1da177e4 LT |
938 | { |
939 | struct htb_sched *q = qdisc_priv(sch); | |
940 | int prio; | |
941 | ||
942 | for (prio = TC_HTB_NUMPRIO - 1; prio >= 0; prio--) { | |
943 | struct list_head *p; | |
87990467 | 944 | list_for_each(p, q->drops + prio) { |
1da177e4 LT |
945 | struct htb_class *cl = list_entry(p, struct htb_class, |
946 | un.leaf.drop_list); | |
947 | unsigned int len; | |
87990467 SH |
948 | if (cl->un.leaf.q->ops->drop && |
949 | (len = cl->un.leaf.q->ops->drop(cl->un.leaf.q))) { | |
1da177e4 LT |
950 | sch->q.qlen--; |
951 | if (!cl->un.leaf.q->q.qlen) | |
87990467 | 952 | htb_deactivate(q, cl); |
1da177e4 LT |
953 | return len; |
954 | } | |
955 | } | |
956 | } | |
957 | return 0; | |
958 | } | |
959 | ||
960 | /* reset all classes */ | |
961 | /* always caled under BH & queue lock */ | |
87990467 | 962 | static void htb_reset(struct Qdisc *sch) |
1da177e4 LT |
963 | { |
964 | struct htb_sched *q = qdisc_priv(sch); | |
965 | int i; | |
1da177e4 LT |
966 | |
967 | for (i = 0; i < HTB_HSIZE; i++) { | |
0cef296d SH |
968 | struct hlist_node *p; |
969 | struct htb_class *cl; | |
970 | ||
971 | hlist_for_each_entry(cl, p, q->hash + i, hlist) { | |
1da177e4 | 972 | if (cl->level) |
87990467 | 973 | memset(&cl->un.inner, 0, sizeof(cl->un.inner)); |
1da177e4 | 974 | else { |
87990467 | 975 | if (cl->un.leaf.q) |
1da177e4 LT |
976 | qdisc_reset(cl->un.leaf.q); |
977 | INIT_LIST_HEAD(&cl->un.leaf.drop_list); | |
978 | } | |
979 | cl->prio_activity = 0; | |
980 | cl->cmode = HTB_CAN_SEND; | |
1da177e4 LT |
981 | |
982 | } | |
983 | } | |
fb983d45 | 984 | qdisc_watchdog_cancel(&q->watchdog); |
1da177e4 LT |
985 | __skb_queue_purge(&q->direct_queue); |
986 | sch->q.qlen = 0; | |
87990467 SH |
987 | memset(q->row, 0, sizeof(q->row)); |
988 | memset(q->row_mask, 0, sizeof(q->row_mask)); | |
989 | memset(q->wait_pq, 0, sizeof(q->wait_pq)); | |
990 | memset(q->ptr, 0, sizeof(q->ptr)); | |
1da177e4 | 991 | for (i = 0; i < TC_HTB_NUMPRIO; i++) |
87990467 | 992 | INIT_LIST_HEAD(q->drops + i); |
1da177e4 LT |
993 | } |
994 | ||
1e90474c | 995 | static int htb_init(struct Qdisc *sch, struct nlattr *opt) |
1da177e4 LT |
996 | { |
997 | struct htb_sched *q = qdisc_priv(sch); | |
1e90474c | 998 | struct nlattr *tb[TCA_HTB_INIT + 1]; |
1da177e4 | 999 | struct tc_htb_glob *gopt; |
cee63723 | 1000 | int err; |
1da177e4 | 1001 | int i; |
cee63723 PM |
1002 | |
1003 | if (!opt) | |
1004 | return -EINVAL; | |
1005 | ||
1006 | err = nla_parse_nested(tb, TCA_HTB_INIT, opt, NULL); | |
1007 | if (err < 0) | |
1008 | return err; | |
1009 | ||
1010 | if (tb[TCA_HTB_INIT] == NULL || | |
1e90474c | 1011 | nla_len(tb[TCA_HTB_INIT]) < sizeof(*gopt)) { |
1da177e4 LT |
1012 | printk(KERN_ERR "HTB: hey probably you have bad tc tool ?\n"); |
1013 | return -EINVAL; | |
1014 | } | |
1e90474c | 1015 | gopt = nla_data(tb[TCA_HTB_INIT]); |
1da177e4 | 1016 | if (gopt->version != HTB_VER >> 16) { |
87990467 SH |
1017 | printk(KERN_ERR |
1018 | "HTB: need tc/htb version %d (minor is %d), you have %d\n", | |
1019 | HTB_VER >> 16, HTB_VER & 0xffff, gopt->version); | |
1da177e4 LT |
1020 | return -EINVAL; |
1021 | } | |
1da177e4 LT |
1022 | |
1023 | INIT_LIST_HEAD(&q->root); | |
1024 | for (i = 0; i < HTB_HSIZE; i++) | |
0cef296d | 1025 | INIT_HLIST_HEAD(q->hash + i); |
1da177e4 | 1026 | for (i = 0; i < TC_HTB_NUMPRIO; i++) |
87990467 | 1027 | INIT_LIST_HEAD(q->drops + i); |
1da177e4 | 1028 | |
fb983d45 | 1029 | qdisc_watchdog_init(&q->watchdog, sch); |
1da177e4 LT |
1030 | skb_queue_head_init(&q->direct_queue); |
1031 | ||
1032 | q->direct_qlen = sch->dev->tx_queue_len; | |
87990467 | 1033 | if (q->direct_qlen < 2) /* some devices have zero tx_queue_len */ |
1da177e4 | 1034 | q->direct_qlen = 2; |
1da177e4 | 1035 | |
1da177e4 LT |
1036 | if ((q->rate2quantum = gopt->rate2quantum) < 1) |
1037 | q->rate2quantum = 1; | |
1038 | q->defcls = gopt->defcls; | |
1039 | ||
1040 | return 0; | |
1041 | } | |
1042 | ||
1043 | static int htb_dump(struct Qdisc *sch, struct sk_buff *skb) | |
1044 | { | |
1045 | struct htb_sched *q = qdisc_priv(sch); | |
4b3550ef | 1046 | struct nlattr *nest; |
1da177e4 | 1047 | struct tc_htb_glob gopt; |
4b3550ef | 1048 | |
9ac961ee | 1049 | spin_lock_bh(&sch->dev->queue_lock); |
1da177e4 | 1050 | |
4b3550ef | 1051 | gopt.direct_pkts = q->direct_pkts; |
1da177e4 LT |
1052 | gopt.version = HTB_VER; |
1053 | gopt.rate2quantum = q->rate2quantum; | |
1054 | gopt.defcls = q->defcls; | |
3bf72957 | 1055 | gopt.debug = 0; |
4b3550ef PM |
1056 | |
1057 | nest = nla_nest_start(skb, TCA_OPTIONS); | |
1058 | if (nest == NULL) | |
1059 | goto nla_put_failure; | |
1e90474c | 1060 | NLA_PUT(skb, TCA_HTB_INIT, sizeof(gopt), &gopt); |
4b3550ef PM |
1061 | nla_nest_end(skb, nest); |
1062 | ||
9ac961ee | 1063 | spin_unlock_bh(&sch->dev->queue_lock); |
1da177e4 | 1064 | return skb->len; |
4b3550ef | 1065 | |
1e90474c | 1066 | nla_put_failure: |
9ac961ee | 1067 | spin_unlock_bh(&sch->dev->queue_lock); |
4b3550ef | 1068 | nla_nest_cancel(skb, nest); |
1da177e4 LT |
1069 | return -1; |
1070 | } | |
1071 | ||
1072 | static int htb_dump_class(struct Qdisc *sch, unsigned long arg, | |
87990467 | 1073 | struct sk_buff *skb, struct tcmsg *tcm) |
1da177e4 | 1074 | { |
87990467 | 1075 | struct htb_class *cl = (struct htb_class *)arg; |
4b3550ef | 1076 | struct nlattr *nest; |
1da177e4 LT |
1077 | struct tc_htb_opt opt; |
1078 | ||
9ac961ee | 1079 | spin_lock_bh(&sch->dev->queue_lock); |
1da177e4 LT |
1080 | tcm->tcm_parent = cl->parent ? cl->parent->classid : TC_H_ROOT; |
1081 | tcm->tcm_handle = cl->classid; | |
1082 | if (!cl->level && cl->un.leaf.q) | |
1083 | tcm->tcm_info = cl->un.leaf.q->handle; | |
1084 | ||
4b3550ef PM |
1085 | nest = nla_nest_start(skb, TCA_OPTIONS); |
1086 | if (nest == NULL) | |
1087 | goto nla_put_failure; | |
1da177e4 | 1088 | |
87990467 | 1089 | memset(&opt, 0, sizeof(opt)); |
1da177e4 | 1090 | |
87990467 SH |
1091 | opt.rate = cl->rate->rate; |
1092 | opt.buffer = cl->buffer; | |
1093 | opt.ceil = cl->ceil->rate; | |
1094 | opt.cbuffer = cl->cbuffer; | |
1095 | opt.quantum = cl->un.leaf.quantum; | |
1096 | opt.prio = cl->un.leaf.prio; | |
1097 | opt.level = cl->level; | |
1e90474c | 1098 | NLA_PUT(skb, TCA_HTB_PARMS, sizeof(opt), &opt); |
4b3550ef PM |
1099 | |
1100 | nla_nest_end(skb, nest); | |
9ac961ee | 1101 | spin_unlock_bh(&sch->dev->queue_lock); |
1da177e4 | 1102 | return skb->len; |
4b3550ef | 1103 | |
1e90474c | 1104 | nla_put_failure: |
9ac961ee | 1105 | spin_unlock_bh(&sch->dev->queue_lock); |
4b3550ef | 1106 | nla_nest_cancel(skb, nest); |
1da177e4 LT |
1107 | return -1; |
1108 | } | |
1109 | ||
1110 | static int | |
87990467 | 1111 | htb_dump_class_stats(struct Qdisc *sch, unsigned long arg, struct gnet_dump *d) |
1da177e4 | 1112 | { |
87990467 | 1113 | struct htb_class *cl = (struct htb_class *)arg; |
1da177e4 | 1114 | |
1da177e4 LT |
1115 | if (!cl->level && cl->un.leaf.q) |
1116 | cl->qstats.qlen = cl->un.leaf.q->q.qlen; | |
1117 | cl->xstats.tokens = cl->tokens; | |
1118 | cl->xstats.ctokens = cl->ctokens; | |
1119 | ||
1120 | if (gnet_stats_copy_basic(d, &cl->bstats) < 0 || | |
1121 | gnet_stats_copy_rate_est(d, &cl->rate_est) < 0 || | |
1122 | gnet_stats_copy_queue(d, &cl->qstats) < 0) | |
1123 | return -1; | |
1124 | ||
1125 | return gnet_stats_copy_app(d, &cl->xstats, sizeof(cl->xstats)); | |
1126 | } | |
1127 | ||
1128 | static int htb_graft(struct Qdisc *sch, unsigned long arg, struct Qdisc *new, | |
87990467 | 1129 | struct Qdisc **old) |
1da177e4 | 1130 | { |
87990467 | 1131 | struct htb_class *cl = (struct htb_class *)arg; |
1da177e4 LT |
1132 | |
1133 | if (cl && !cl->level) { | |
9f9afec4 PM |
1134 | if (new == NULL && |
1135 | (new = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops, | |
10297b99 | 1136 | cl->classid)) |
87990467 SH |
1137 | == NULL) |
1138 | return -ENOBUFS; | |
1da177e4 LT |
1139 | sch_tree_lock(sch); |
1140 | if ((*old = xchg(&cl->un.leaf.q, new)) != NULL) { | |
256d61b8 | 1141 | qdisc_tree_decrease_qlen(*old, (*old)->q.qlen); |
1da177e4 LT |
1142 | qdisc_reset(*old); |
1143 | } | |
1144 | sch_tree_unlock(sch); | |
1145 | return 0; | |
1146 | } | |
1147 | return -ENOENT; | |
1148 | } | |
1149 | ||
87990467 | 1150 | static struct Qdisc *htb_leaf(struct Qdisc *sch, unsigned long arg) |
1da177e4 | 1151 | { |
87990467 | 1152 | struct htb_class *cl = (struct htb_class *)arg; |
1da177e4 LT |
1153 | return (cl && !cl->level) ? cl->un.leaf.q : NULL; |
1154 | } | |
1155 | ||
256d61b8 PM |
1156 | static void htb_qlen_notify(struct Qdisc *sch, unsigned long arg) |
1157 | { | |
1158 | struct htb_class *cl = (struct htb_class *)arg; | |
1159 | ||
1160 | if (cl->un.leaf.q->q.qlen == 0) | |
1161 | htb_deactivate(qdisc_priv(sch), cl); | |
1162 | } | |
1163 | ||
1da177e4 LT |
1164 | static unsigned long htb_get(struct Qdisc *sch, u32 classid) |
1165 | { | |
87990467 SH |
1166 | struct htb_class *cl = htb_find(classid, sch); |
1167 | if (cl) | |
1da177e4 LT |
1168 | cl->refcnt++; |
1169 | return (unsigned long)cl; | |
1170 | } | |
1171 | ||
160d5e10 JP |
1172 | static inline int htb_parent_last_child(struct htb_class *cl) |
1173 | { | |
1174 | if (!cl->parent) | |
1175 | /* the root class */ | |
1176 | return 0; | |
1177 | ||
1178 | if (!(cl->parent->children.next == &cl->sibling && | |
1179 | cl->parent->children.prev == &cl->sibling)) | |
1180 | /* not the last child */ | |
1181 | return 0; | |
1182 | ||
1183 | return 1; | |
1184 | } | |
1185 | ||
1186 | static void htb_parent_to_leaf(struct htb_class *cl, struct Qdisc *new_q) | |
1187 | { | |
1188 | struct htb_class *parent = cl->parent; | |
1189 | ||
1190 | BUG_TRAP(!cl->level && cl->un.leaf.q && !cl->prio_activity); | |
1191 | ||
1192 | parent->level = 0; | |
1193 | memset(&parent->un.inner, 0, sizeof(parent->un.inner)); | |
1194 | INIT_LIST_HEAD(&parent->un.leaf.drop_list); | |
1195 | parent->un.leaf.q = new_q ? new_q : &noop_qdisc; | |
1196 | parent->un.leaf.quantum = parent->quantum; | |
1197 | parent->un.leaf.prio = parent->prio; | |
1198 | parent->tokens = parent->buffer; | |
1199 | parent->ctokens = parent->cbuffer; | |
3bebcda2 | 1200 | parent->t_c = psched_get_time(); |
160d5e10 JP |
1201 | parent->cmode = HTB_CAN_SEND; |
1202 | } | |
1203 | ||
87990467 | 1204 | static void htb_destroy_class(struct Qdisc *sch, struct htb_class *cl) |
1da177e4 LT |
1205 | { |
1206 | struct htb_sched *q = qdisc_priv(sch); | |
814a175e | 1207 | |
1da177e4 LT |
1208 | if (!cl->level) { |
1209 | BUG_TRAP(cl->un.leaf.q); | |
1da177e4 LT |
1210 | qdisc_destroy(cl->un.leaf.q); |
1211 | } | |
ee39e10c | 1212 | gen_kill_estimator(&cl->bstats, &cl->rate_est); |
1da177e4 LT |
1213 | qdisc_put_rtab(cl->rate); |
1214 | qdisc_put_rtab(cl->ceil); | |
87990467 | 1215 | |
a48b5a61 | 1216 | tcf_destroy_chain(cl->filter_list); |
87990467 SH |
1217 | |
1218 | while (!list_empty(&cl->children)) | |
1219 | htb_destroy_class(sch, list_entry(cl->children.next, | |
1220 | struct htb_class, sibling)); | |
1da177e4 LT |
1221 | |
1222 | /* note: this delete may happen twice (see htb_delete) */ | |
da33e3eb | 1223 | hlist_del_init(&cl->hlist); |
1da177e4 | 1224 | list_del(&cl->sibling); |
87990467 | 1225 | |
1da177e4 | 1226 | if (cl->prio_activity) |
87990467 SH |
1227 | htb_deactivate(q, cl); |
1228 | ||
1da177e4 | 1229 | if (cl->cmode != HTB_CAN_SEND) |
3696f625 | 1230 | htb_safe_rb_erase(&cl->pq_node, q->wait_pq + cl->level); |
87990467 | 1231 | |
1da177e4 LT |
1232 | kfree(cl); |
1233 | } | |
1234 | ||
1235 | /* always caled under BH & queue lock */ | |
87990467 | 1236 | static void htb_destroy(struct Qdisc *sch) |
1da177e4 LT |
1237 | { |
1238 | struct htb_sched *q = qdisc_priv(sch); | |
1da177e4 | 1239 | |
fb983d45 | 1240 | qdisc_watchdog_cancel(&q->watchdog); |
1da177e4 | 1241 | /* This line used to be after htb_destroy_class call below |
10297b99 | 1242 | and surprisingly it worked in 2.4. But it must precede it |
1da177e4 LT |
1243 | because filter need its target class alive to be able to call |
1244 | unbind_filter on it (without Oops). */ | |
a48b5a61 | 1245 | tcf_destroy_chain(q->filter_list); |
87990467 SH |
1246 | |
1247 | while (!list_empty(&q->root)) | |
1248 | htb_destroy_class(sch, list_entry(q->root.next, | |
1249 | struct htb_class, sibling)); | |
1da177e4 LT |
1250 | |
1251 | __skb_queue_purge(&q->direct_queue); | |
1252 | } | |
1253 | ||
1254 | static int htb_delete(struct Qdisc *sch, unsigned long arg) | |
1255 | { | |
1256 | struct htb_sched *q = qdisc_priv(sch); | |
87990467 | 1257 | struct htb_class *cl = (struct htb_class *)arg; |
256d61b8 | 1258 | unsigned int qlen; |
160d5e10 JP |
1259 | struct Qdisc *new_q = NULL; |
1260 | int last_child = 0; | |
1da177e4 LT |
1261 | |
1262 | // TODO: why don't allow to delete subtree ? references ? does | |
1263 | // tc subsys quarantee us that in htb_destroy it holds no class | |
1264 | // refs so that we can remove children safely there ? | |
1265 | if (!list_empty(&cl->children) || cl->filter_cnt) | |
1266 | return -EBUSY; | |
87990467 | 1267 | |
160d5e10 JP |
1268 | if (!cl->level && htb_parent_last_child(cl)) { |
1269 | new_q = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops, | |
1270 | cl->parent->classid); | |
1271 | last_child = 1; | |
1272 | } | |
1273 | ||
1da177e4 | 1274 | sch_tree_lock(sch); |
87990467 | 1275 | |
814a175e | 1276 | if (!cl->level) { |
256d61b8 | 1277 | qlen = cl->un.leaf.q->q.qlen; |
814a175e | 1278 | qdisc_reset(cl->un.leaf.q); |
256d61b8 | 1279 | qdisc_tree_decrease_qlen(cl->un.leaf.q, qlen); |
814a175e PM |
1280 | } |
1281 | ||
c38c83cb PM |
1282 | /* delete from hash and active; remainder in destroy_class */ |
1283 | hlist_del_init(&cl->hlist); | |
1284 | ||
1da177e4 | 1285 | if (cl->prio_activity) |
87990467 | 1286 | htb_deactivate(q, cl); |
1da177e4 | 1287 | |
160d5e10 JP |
1288 | if (last_child) |
1289 | htb_parent_to_leaf(cl, new_q); | |
1290 | ||
1da177e4 | 1291 | if (--cl->refcnt == 0) |
87990467 | 1292 | htb_destroy_class(sch, cl); |
1da177e4 LT |
1293 | |
1294 | sch_tree_unlock(sch); | |
1295 | return 0; | |
1296 | } | |
1297 | ||
1298 | static void htb_put(struct Qdisc *sch, unsigned long arg) | |
1299 | { | |
87990467 | 1300 | struct htb_class *cl = (struct htb_class *)arg; |
1da177e4 LT |
1301 | |
1302 | if (--cl->refcnt == 0) | |
87990467 | 1303 | htb_destroy_class(sch, cl); |
1da177e4 LT |
1304 | } |
1305 | ||
87990467 | 1306 | static int htb_change_class(struct Qdisc *sch, u32 classid, |
1e90474c | 1307 | u32 parentid, struct nlattr **tca, |
87990467 | 1308 | unsigned long *arg) |
1da177e4 LT |
1309 | { |
1310 | int err = -EINVAL; | |
1311 | struct htb_sched *q = qdisc_priv(sch); | |
87990467 | 1312 | struct htb_class *cl = (struct htb_class *)*arg, *parent; |
1e90474c | 1313 | struct nlattr *opt = tca[TCA_OPTIONS]; |
1da177e4 | 1314 | struct qdisc_rate_table *rtab = NULL, *ctab = NULL; |
1e90474c | 1315 | struct nlattr *tb[TCA_HTB_RTAB + 1]; |
1da177e4 LT |
1316 | struct tc_htb_opt *hopt; |
1317 | ||
1318 | /* extract all subattrs from opt attr */ | |
cee63723 PM |
1319 | if (!opt) |
1320 | goto failure; | |
1321 | ||
1322 | err = nla_parse_nested(tb, TCA_HTB_RTAB, opt, NULL); | |
1323 | if (err < 0) | |
1324 | goto failure; | |
1325 | ||
1326 | err = -EINVAL; | |
1327 | if (tb[TCA_HTB_PARMS] == NULL || | |
1e90474c | 1328 | nla_len(tb[TCA_HTB_PARMS]) < sizeof(*hopt)) |
1da177e4 | 1329 | goto failure; |
1da177e4 | 1330 | |
87990467 SH |
1331 | parent = parentid == TC_H_ROOT ? NULL : htb_find(parentid, sch); |
1332 | ||
1e90474c | 1333 | hopt = nla_data(tb[TCA_HTB_PARMS]); |
3bf72957 | 1334 | |
1e90474c PM |
1335 | rtab = qdisc_get_rtab(&hopt->rate, tb[TCA_HTB_RTAB]); |
1336 | ctab = qdisc_get_rtab(&hopt->ceil, tb[TCA_HTB_CTAB]); | |
87990467 SH |
1337 | if (!rtab || !ctab) |
1338 | goto failure; | |
1da177e4 | 1339 | |
87990467 | 1340 | if (!cl) { /* new class */ |
1da177e4 | 1341 | struct Qdisc *new_q; |
3696f625 | 1342 | int prio; |
ee39e10c | 1343 | struct { |
1e90474c | 1344 | struct nlattr nla; |
ee39e10c PM |
1345 | struct gnet_estimator opt; |
1346 | } est = { | |
1e90474c PM |
1347 | .nla = { |
1348 | .nla_len = nla_attr_size(sizeof(est.opt)), | |
1349 | .nla_type = TCA_RATE, | |
ee39e10c PM |
1350 | }, |
1351 | .opt = { | |
1352 | /* 4s interval, 16s averaging constant */ | |
1353 | .interval = 2, | |
1354 | .ewma_log = 2, | |
1355 | }, | |
1356 | }; | |
3696f625 | 1357 | |
1da177e4 | 1358 | /* check for valid classid */ |
87990467 SH |
1359 | if (!classid || TC_H_MAJ(classid ^ sch->handle) |
1360 | || htb_find(classid, sch)) | |
1da177e4 LT |
1361 | goto failure; |
1362 | ||
1363 | /* check maximal depth */ | |
1364 | if (parent && parent->parent && parent->parent->level < 2) { | |
1365 | printk(KERN_ERR "htb: tree is too deep\n"); | |
1366 | goto failure; | |
1367 | } | |
1368 | err = -ENOBUFS; | |
0da974f4 | 1369 | if ((cl = kzalloc(sizeof(*cl), GFP_KERNEL)) == NULL) |
1da177e4 | 1370 | goto failure; |
87990467 | 1371 | |
ee39e10c PM |
1372 | gen_new_estimator(&cl->bstats, &cl->rate_est, |
1373 | &sch->dev->queue_lock, | |
1e90474c | 1374 | tca[TCA_RATE] ? : &est.nla); |
1da177e4 LT |
1375 | cl->refcnt = 1; |
1376 | INIT_LIST_HEAD(&cl->sibling); | |
0cef296d | 1377 | INIT_HLIST_NODE(&cl->hlist); |
1da177e4 LT |
1378 | INIT_LIST_HEAD(&cl->children); |
1379 | INIT_LIST_HEAD(&cl->un.leaf.drop_list); | |
3696f625 SH |
1380 | RB_CLEAR_NODE(&cl->pq_node); |
1381 | ||
1382 | for (prio = 0; prio < TC_HTB_NUMPRIO; prio++) | |
1383 | RB_CLEAR_NODE(&cl->node[prio]); | |
1da177e4 LT |
1384 | |
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 */ | |
9f9afec4 | 1388 | new_q = qdisc_create_dflt(sch->dev, &pfifo_qdisc_ops, classid); |
1da177e4 LT |
1389 | sch_tree_lock(sch); |
1390 | if (parent && !parent->level) { | |
256d61b8 PM |
1391 | unsigned int qlen = parent->un.leaf.q->q.qlen; |
1392 | ||
1da177e4 | 1393 | /* turn parent into inner node */ |
256d61b8 PM |
1394 | qdisc_reset(parent->un.leaf.q); |
1395 | qdisc_tree_decrease_qlen(parent->un.leaf.q, qlen); | |
87990467 SH |
1396 | qdisc_destroy(parent->un.leaf.q); |
1397 | if (parent->prio_activity) | |
1398 | htb_deactivate(q, parent); | |
1da177e4 LT |
1399 | |
1400 | /* remove from evt list because of level change */ | |
1401 | if (parent->cmode != HTB_CAN_SEND) { | |
3696f625 | 1402 | htb_safe_rb_erase(&parent->pq_node, q->wait_pq); |
1da177e4 LT |
1403 | parent->cmode = HTB_CAN_SEND; |
1404 | } | |
1405 | parent->level = (parent->parent ? parent->parent->level | |
87990467 SH |
1406 | : TC_HTB_MAXDEPTH) - 1; |
1407 | memset(&parent->un.inner, 0, sizeof(parent->un.inner)); | |
1da177e4 LT |
1408 | } |
1409 | /* leaf (we) needs elementary qdisc */ | |
1410 | cl->un.leaf.q = new_q ? new_q : &noop_qdisc; | |
1411 | ||
87990467 SH |
1412 | cl->classid = classid; |
1413 | cl->parent = parent; | |
1da177e4 LT |
1414 | |
1415 | /* set class to be in HTB_CAN_SEND state */ | |
1416 | cl->tokens = hopt->buffer; | |
1417 | cl->ctokens = hopt->cbuffer; | |
00c04af9 | 1418 | cl->mbuffer = 60 * PSCHED_TICKS_PER_SEC; /* 1min */ |
3bebcda2 | 1419 | cl->t_c = psched_get_time(); |
1da177e4 LT |
1420 | cl->cmode = HTB_CAN_SEND; |
1421 | ||
1422 | /* attach to the hash list and parent's family */ | |
0cef296d | 1423 | hlist_add_head(&cl->hlist, q->hash + htb_hash(classid)); |
87990467 SH |
1424 | list_add_tail(&cl->sibling, |
1425 | parent ? &parent->children : &q->root); | |
ee39e10c | 1426 | } else { |
1e90474c | 1427 | if (tca[TCA_RATE]) |
ee39e10c PM |
1428 | gen_replace_estimator(&cl->bstats, &cl->rate_est, |
1429 | &sch->dev->queue_lock, | |
1e90474c | 1430 | tca[TCA_RATE]); |
87990467 | 1431 | sch_tree_lock(sch); |
ee39e10c | 1432 | } |
1da177e4 LT |
1433 | |
1434 | /* it used to be a nasty bug here, we have to check that node | |
87990467 | 1435 | is really leaf before changing cl->un.leaf ! */ |
1da177e4 LT |
1436 | if (!cl->level) { |
1437 | cl->un.leaf.quantum = rtab->rate.rate / q->rate2quantum; | |
1438 | if (!hopt->quantum && cl->un.leaf.quantum < 1000) { | |
87990467 SH |
1439 | printk(KERN_WARNING |
1440 | "HTB: quantum of class %X is small. Consider r2q change.\n", | |
1441 | cl->classid); | |
1da177e4 LT |
1442 | cl->un.leaf.quantum = 1000; |
1443 | } | |
1444 | if (!hopt->quantum && cl->un.leaf.quantum > 200000) { | |
87990467 SH |
1445 | printk(KERN_WARNING |
1446 | "HTB: quantum of class %X is big. Consider r2q change.\n", | |
1447 | cl->classid); | |
1da177e4 LT |
1448 | cl->un.leaf.quantum = 200000; |
1449 | } | |
1450 | if (hopt->quantum) | |
1451 | cl->un.leaf.quantum = hopt->quantum; | |
1452 | if ((cl->un.leaf.prio = hopt->prio) >= TC_HTB_NUMPRIO) | |
1453 | cl->un.leaf.prio = TC_HTB_NUMPRIO - 1; | |
160d5e10 JP |
1454 | |
1455 | /* backup for htb_parent_to_leaf */ | |
1456 | cl->quantum = cl->un.leaf.quantum; | |
1457 | cl->prio = cl->un.leaf.prio; | |
1da177e4 LT |
1458 | } |
1459 | ||
1460 | cl->buffer = hopt->buffer; | |
1461 | cl->cbuffer = hopt->cbuffer; | |
87990467 SH |
1462 | if (cl->rate) |
1463 | qdisc_put_rtab(cl->rate); | |
1464 | cl->rate = rtab; | |
1465 | if (cl->ceil) | |
1466 | qdisc_put_rtab(cl->ceil); | |
1467 | cl->ceil = ctab; | |
1da177e4 LT |
1468 | sch_tree_unlock(sch); |
1469 | ||
1470 | *arg = (unsigned long)cl; | |
1471 | return 0; | |
1472 | ||
1473 | failure: | |
87990467 SH |
1474 | if (rtab) |
1475 | qdisc_put_rtab(rtab); | |
1476 | if (ctab) | |
1477 | qdisc_put_rtab(ctab); | |
1da177e4 LT |
1478 | return err; |
1479 | } | |
1480 | ||
1481 | static struct tcf_proto **htb_find_tcf(struct Qdisc *sch, unsigned long arg) | |
1482 | { | |
1483 | struct htb_sched *q = qdisc_priv(sch); | |
1484 | struct htb_class *cl = (struct htb_class *)arg; | |
1485 | struct tcf_proto **fl = cl ? &cl->filter_list : &q->filter_list; | |
3bf72957 | 1486 | |
1da177e4 LT |
1487 | return fl; |
1488 | } | |
1489 | ||
1490 | static unsigned long htb_bind_filter(struct Qdisc *sch, unsigned long parent, | |
87990467 | 1491 | u32 classid) |
1da177e4 LT |
1492 | { |
1493 | struct htb_sched *q = qdisc_priv(sch); | |
87990467 | 1494 | struct htb_class *cl = htb_find(classid, sch); |
3bf72957 | 1495 | |
1da177e4 | 1496 | /*if (cl && !cl->level) return 0; |
87990467 SH |
1497 | The line above used to be there to prevent attaching filters to |
1498 | leaves. But at least tc_index filter uses this just to get class | |
1499 | for other reasons so that we have to allow for it. | |
1500 | ---- | |
1501 | 19.6.2002 As Werner explained it is ok - bind filter is just | |
1502 | another way to "lock" the class - unlike "get" this lock can | |
1503 | be broken by class during destroy IIUC. | |
1da177e4 | 1504 | */ |
87990467 SH |
1505 | if (cl) |
1506 | cl->filter_cnt++; | |
1507 | else | |
1da177e4 LT |
1508 | q->filter_cnt++; |
1509 | return (unsigned long)cl; | |
1510 | } | |
1511 | ||
1512 | static void htb_unbind_filter(struct Qdisc *sch, unsigned long arg) | |
1513 | { | |
1514 | struct htb_sched *q = qdisc_priv(sch); | |
1515 | struct htb_class *cl = (struct htb_class *)arg; | |
3bf72957 | 1516 | |
87990467 SH |
1517 | if (cl) |
1518 | cl->filter_cnt--; | |
1519 | else | |
1da177e4 LT |
1520 | q->filter_cnt--; |
1521 | } | |
1522 | ||
1523 | static void htb_walk(struct Qdisc *sch, struct qdisc_walker *arg) | |
1524 | { | |
1525 | struct htb_sched *q = qdisc_priv(sch); | |
1526 | int i; | |
1527 | ||
1528 | if (arg->stop) | |
1529 | return; | |
1530 | ||
1531 | for (i = 0; i < HTB_HSIZE; i++) { | |
0cef296d SH |
1532 | struct hlist_node *p; |
1533 | struct htb_class *cl; | |
1534 | ||
1535 | hlist_for_each_entry(cl, p, q->hash + i, hlist) { | |
1da177e4 LT |
1536 | if (arg->count < arg->skip) { |
1537 | arg->count++; | |
1538 | continue; | |
1539 | } | |
1540 | if (arg->fn(sch, (unsigned long)cl, arg) < 0) { | |
1541 | arg->stop = 1; | |
1542 | return; | |
1543 | } | |
1544 | arg->count++; | |
1545 | } | |
1546 | } | |
1547 | } | |
1548 | ||
20fea08b | 1549 | static const struct Qdisc_class_ops htb_class_ops = { |
1da177e4 LT |
1550 | .graft = htb_graft, |
1551 | .leaf = htb_leaf, | |
256d61b8 | 1552 | .qlen_notify = htb_qlen_notify, |
1da177e4 LT |
1553 | .get = htb_get, |
1554 | .put = htb_put, | |
1555 | .change = htb_change_class, | |
1556 | .delete = htb_delete, | |
1557 | .walk = htb_walk, | |
1558 | .tcf_chain = htb_find_tcf, | |
1559 | .bind_tcf = htb_bind_filter, | |
1560 | .unbind_tcf = htb_unbind_filter, | |
1561 | .dump = htb_dump_class, | |
1562 | .dump_stats = htb_dump_class_stats, | |
1563 | }; | |
1564 | ||
20fea08b | 1565 | static struct Qdisc_ops htb_qdisc_ops __read_mostly = { |
1da177e4 LT |
1566 | .next = NULL, |
1567 | .cl_ops = &htb_class_ops, | |
1568 | .id = "htb", | |
1569 | .priv_size = sizeof(struct htb_sched), | |
1570 | .enqueue = htb_enqueue, | |
1571 | .dequeue = htb_dequeue, | |
1572 | .requeue = htb_requeue, | |
1573 | .drop = htb_drop, | |
1574 | .init = htb_init, | |
1575 | .reset = htb_reset, | |
1576 | .destroy = htb_destroy, | |
1577 | .change = NULL /* htb_change */, | |
1578 | .dump = htb_dump, | |
1579 | .owner = THIS_MODULE, | |
1580 | }; | |
1581 | ||
1582 | static int __init htb_module_init(void) | |
1583 | { | |
87990467 | 1584 | return register_qdisc(&htb_qdisc_ops); |
1da177e4 | 1585 | } |
87990467 | 1586 | static void __exit htb_module_exit(void) |
1da177e4 | 1587 | { |
87990467 | 1588 | unregister_qdisc(&htb_qdisc_ops); |
1da177e4 | 1589 | } |
87990467 | 1590 | |
1da177e4 LT |
1591 | module_init(htb_module_init) |
1592 | module_exit(htb_module_exit) | |
1593 | MODULE_LICENSE("GPL"); |