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