projects / deliverable / linux.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
isdn: isdn_net.c annotate struct ip_ports and trivial sparse fixes
[deliverable/linux.git] / net / sched / sch_hfsc.c
CommitLineData
1da177e4
LT		 1/*
2 * Copyright (c) 2003 Patrick McHardy, <kaber@trash.net>
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 2
7 * of the License, or (at your option) any later version.
8 *
9 * 2003-10-17 - Ported from altq
10 */
11/*
12 * Copyright (c) 1997-1999 Carnegie Mellon University. All Rights Reserved.
13 *
14 * Permission to use, copy, modify, and distribute this software and
15 * its documentation is hereby granted (including for commercial or
16 * for-profit use), provided that both the copyright notice and this
17 * permission notice appear in all copies of the software, derivative
18 * works, or modified versions, and any portions thereof.
19 *
20 * THIS SOFTWARE IS EXPERIMENTAL AND IS KNOWN TO HAVE BUGS, SOME OF
21 * WHICH MAY HAVE SERIOUS CONSEQUENCES. CARNEGIE MELLON PROVIDES THIS
22 * SOFTWARE IN ITS ``AS IS'' CONDITION, AND ANY EXPRESS OR IMPLIED
23 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
24 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
25 * DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
27 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
28 * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
29 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
30 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
32 * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
33 * DAMAGE.
34 *
35 * Carnegie Mellon encourages (but does not require) users of this
36 * software to return any improvements or extensions that they make,
37 * and to grant Carnegie Mellon the rights to redistribute these
38 * changes without encumbrance.
39 */
40/*
41 * H-FSC is described in Proceedings of SIGCOMM'97,
42 * "A Hierarchical Fair Service Curve Algorithm for Link-Sharing,
43 * Real-Time and Priority Service"
44 * by Ion Stoica, Hui Zhang, and T. S. Eugene Ng.
45 *
46 * Oleg Cherevko <olwi@aq.ml.com.ua> added the upperlimit for link-sharing.
47 * when a class has an upperlimit, the fit-time is computed from the
48 * upperlimit service curve. the link-sharing scheduler does not schedule
49 * a class whose fit-time exceeds the current time.
50 */
51
52#include <linux/kernel.h>
1da177e4
LT		 53#include <linux/module.h>
54#include <linux/types.h>
55#include <linux/errno.h>
1da177e4
LT		 56#include <linux/compiler.h>
57#include <linux/spinlock.h>
58#include <linux/skbuff.h>
59#include <linux/string.h>
60#include <linux/slab.h>
1da177e4
LT		 61#include <linux/list.h>
62#include <linux/rbtree.h>
63#include <linux/init.h>
1da177e4
LT		 64#include <linux/rtnetlink.h>
65#include <linux/pkt_sched.h>
dc5fc579 66#include <net/netlink.h>
1da177e4
LT		 67#include <net/pkt_sched.h>
68#include <net/pkt_cls.h>
1da177e4
LT		 69#include <asm/div64.h>
70
1da177e4
LT		 71/*
72 * kernel internal service curve representation:
73 * coordinates are given by 64 bit unsigned integers.
74 * x-axis: unit is clock count.
75 * y-axis: unit is byte.
76 *
77 * The service curve parameters are converted to the internal
78 * representation. The slope values are scaled to avoid overflow.
79 * the inverse slope values as well as the y-projection of the 1st
80 * segment are kept in order to to avoid 64-bit divide operations
81 * that are expensive on 32-bit architectures.
82 */
83
84struct internal_sc
85{
86 u64 sm1; /* scaled slope of the 1st segment */
87 u64 ism1; /* scaled inverse-slope of the 1st segment */
88 u64 dx; /* the x-projection of the 1st segment */
89 u64 dy; /* the y-projection of the 1st segment */
90 u64 sm2; /* scaled slope of the 2nd segment */
91 u64 ism2; /* scaled inverse-slope of the 2nd segment */
92};
93
94/* runtime service curve */
95struct runtime_sc
96{
97 u64 x; /* current starting position on x-axis */
98 u64 y; /* current starting position on y-axis */
99 u64 sm1; /* scaled slope of the 1st segment */
100 u64 ism1; /* scaled inverse-slope of the 1st segment */
101 u64 dx; /* the x-projection of the 1st segment */
102 u64 dy; /* the y-projection of the 1st segment */
103 u64 sm2; /* scaled slope of the 2nd segment */
104 u64 ism2; /* scaled inverse-slope of the 2nd segment */
105};
106
107enum hfsc_class_flags
108{
109 HFSC_RSC = 0x1,
110 HFSC_FSC = 0x2,
111 HFSC_USC = 0x4
112};
113
114struct hfsc_class
115{
be0d39d5 116 struct Qdisc_class_common cl_common;
1da177e4
LT		 117 unsigned int refcnt; /* usage count */
118
119 struct gnet_stats_basic bstats;
120 struct gnet_stats_queue qstats;
121 struct gnet_stats_rate_est rate_est;
1da177e4
LT		 122 unsigned int level; /* class level in hierarchy */
123 struct tcf_proto *filter_list; /* filter list */
124 unsigned int filter_cnt; /* filter count */
125
126 struct hfsc_sched *sched; /* scheduler data */
127 struct hfsc_class *cl_parent; /* parent class */
128 struct list_head siblings; /* sibling classes */
129 struct list_head children; /* child classes */
130 struct Qdisc *qdisc; /* leaf qdisc */
131
132 struct rb_node el_node; /* qdisc's eligible tree member */
133 struct rb_root vt_tree; /* active children sorted by cl_vt */
134 struct rb_node vt_node; /* parent's vt_tree member */
135 struct rb_root cf_tree; /* active children sorted by cl_f */
136 struct rb_node cf_node; /* parent's cf_heap member */
1da177e4
LT		 137 struct list_head dlist; /* drop list member */
138
139 u64 cl_total; /* total work in bytes */
140 u64 cl_cumul; /* cumulative work in bytes done by
141 real-time criteria */
142
143 u64 cl_d; /* deadline*/
144 u64 cl_e; /* eligible time */
145 u64 cl_vt; /* virtual time */
146 u64 cl_f; /* time when this class will fit for
147 link-sharing, max(myf, cfmin) */
148 u64 cl_myf; /* my fit-time (calculated from this
149 class's own upperlimit curve) */
150 u64 cl_myfadj; /* my fit-time adjustment (to cancel
151 history dependence) */
152 u64 cl_cfmin; /* earliest children's fit-time (used
153 with cl_myf to obtain cl_f) */
154 u64 cl_cvtmin; /* minimal virtual time among the
155 children fit for link-sharing
156 (monotonic within a period) */
157 u64 cl_vtadj; /* intra-period cumulative vt
158 adjustment */
159 u64 cl_vtoff; /* inter-period cumulative vt offset */
160 u64 cl_cvtmax; /* max child's vt in the last period */
161 u64 cl_cvtoff; /* cumulative cvtmax of all periods */
9a94b351 162 u64 cl_pcvtoff; /* parent's cvtoff at initialization
1da177e4
LT		 163 time */
164
165 struct internal_sc cl_rsc; /* internal real-time service curve */
166 struct internal_sc cl_fsc; /* internal fair service curve */
167 struct internal_sc cl_usc; /* internal upperlimit service curve */
168 struct runtime_sc cl_deadline; /* deadline curve */
169 struct runtime_sc cl_eligible; /* eligible curve */
170 struct runtime_sc cl_virtual; /* virtual curve */
171 struct runtime_sc cl_ulimit; /* upperlimit curve */
172
173 unsigned long cl_flags; /* which curves are valid */
174 unsigned long cl_vtperiod; /* vt period sequence number */
175 unsigned long cl_parentperiod;/* parent's vt period sequence number*/
176 unsigned long cl_nactive; /* number of active children */
177};
178
1da177e4
LT		 179struct hfsc_sched
180{
181 u16 defcls; /* default class id */
182 struct hfsc_class root; /* root class */
be0d39d5 183 struct Qdisc_class_hash clhash; /* class hash */
1da177e4
LT		 184 struct rb_root eligible; /* eligible tree */
185 struct list_head droplist; /* active leaf class list (for
186 dropping) */
ed2b229a 187 struct qdisc_watchdog watchdog; /* watchdog timer */
1da177e4
LT		 188};
189
1da177e4
LT		 190#define HT_INFINITY 0xffffffffffffffffULL /* infinite time value */
191
192
193/*
194 * eligible tree holds backlogged classes being sorted by their eligible times.
195 * there is one eligible tree per hfsc instance.
196 */
197
198static void
199eltree_insert(struct hfsc_class *cl)
200{
201 struct rb_node **p = &cl->sched->eligible.rb_node;
202 struct rb_node *parent = NULL;
203 struct hfsc_class *cl1;
204
205 while (*p != NULL) {
206 parent = *p;
207 cl1 = rb_entry(parent, struct hfsc_class, el_node);
208 if (cl->cl_e >= cl1->cl_e)
209 p = &parent->rb_right;
210 else
211 p = &parent->rb_left;
212 }
213 rb_link_node(&cl->el_node, parent, p);
214 rb_insert_color(&cl->el_node, &cl->sched->eligible);
215}
216
217static inline void
218eltree_remove(struct hfsc_class *cl)
219{
220 rb_erase(&cl->el_node, &cl->sched->eligible);
221}
222
223static inline void
224eltree_update(struct hfsc_class *cl)
225{
226 eltree_remove(cl);
227 eltree_insert(cl);
228}
229
230/* find the class with the minimum deadline among the eligible classes */
231static inline struct hfsc_class *
232eltree_get_mindl(struct hfsc_sched *q, u64 cur_time)
233{
234 struct hfsc_class *p, *cl = NULL;
235 struct rb_node *n;
236
237 for (n = rb_first(&q->eligible); n != NULL; n = rb_next(n)) {
238 p = rb_entry(n, struct hfsc_class, el_node);
239 if (p->cl_e > cur_time)
240 break;
241 if (cl == NULL || p->cl_d < cl->cl_d)
242 cl = p;
243 }
244 return cl;
245}
246
247/* find the class with minimum eligible time among the eligible classes */
248static inline struct hfsc_class *
249eltree_get_minel(struct hfsc_sched *q)
250{
251 struct rb_node *n;
10297b99 252
1da177e4
LT		 253 n = rb_first(&q->eligible);
254 if (n == NULL)
255 return NULL;
256 return rb_entry(n, struct hfsc_class, el_node);
257}
258
259/*
260 * vttree holds holds backlogged child classes being sorted by their virtual
261 * time. each intermediate class has one vttree.
262 */
263static void
264vttree_insert(struct hfsc_class *cl)
265{
266 struct rb_node **p = &cl->cl_parent->vt_tree.rb_node;
267 struct rb_node *parent = NULL;
268 struct hfsc_class *cl1;
269
270 while (*p != NULL) {
271 parent = *p;
272 cl1 = rb_entry(parent, struct hfsc_class, vt_node);
273 if (cl->cl_vt >= cl1->cl_vt)
274 p = &parent->rb_right;
275 else
276 p = &parent->rb_left;
277 }
278 rb_link_node(&cl->vt_node, parent, p);
279 rb_insert_color(&cl->vt_node, &cl->cl_parent->vt_tree);
280}
281
282static inline void
283vttree_remove(struct hfsc_class *cl)
284{
285 rb_erase(&cl->vt_node, &cl->cl_parent->vt_tree);
286}
287
288static inline void
289vttree_update(struct hfsc_class *cl)
290{
291 vttree_remove(cl);
292 vttree_insert(cl);
293}
294
295static inline struct hfsc_class *
296vttree_firstfit(struct hfsc_class *cl, u64 cur_time)
297{
298 struct hfsc_class *p;
299 struct rb_node *n;
300
301 for (n = rb_first(&cl->vt_tree); n != NULL; n = rb_next(n)) {
302 p = rb_entry(n, struct hfsc_class, vt_node);
303 if (p->cl_f <= cur_time)
304 return p;
305 }
306 return NULL;
307}
308
309/*
310 * get the leaf class with the minimum vt in the hierarchy
311 */
312static struct hfsc_class *
313vttree_get_minvt(struct hfsc_class *cl, u64 cur_time)
314{
315 /* if root-class's cfmin is bigger than cur_time nothing to do */
316 if (cl->cl_cfmin > cur_time)
317 return NULL;
318
319 while (cl->level > 0) {
320 cl = vttree_firstfit(cl, cur_time);
321 if (cl == NULL)
322 return NULL;
323 /*
324 * update parent's cl_cvtmin.
325 */
326 if (cl->cl_parent->cl_cvtmin < cl->cl_vt)
327 cl->cl_parent->cl_cvtmin = cl->cl_vt;
328 }
329 return cl;
330}
331
332static void
333cftree_insert(struct hfsc_class *cl)
334{
335 struct rb_node **p = &cl->cl_parent->cf_tree.rb_node;
336 struct rb_node *parent = NULL;
337 struct hfsc_class *cl1;
338
339 while (*p != NULL) {
340 parent = *p;
341 cl1 = rb_entry(parent, struct hfsc_class, cf_node);
342 if (cl->cl_f >= cl1->cl_f)
343 p = &parent->rb_right;
344 else
345 p = &parent->rb_left;
346 }
347 rb_link_node(&cl->cf_node, parent, p);
348 rb_insert_color(&cl->cf_node, &cl->cl_parent->cf_tree);
349}
350
351static inline void
352cftree_remove(struct hfsc_class *cl)
353{
354 rb_erase(&cl->cf_node, &cl->cl_parent->cf_tree);
355}
356
357static inline void
358cftree_update(struct hfsc_class *cl)
359{
360 cftree_remove(cl);
361 cftree_insert(cl);
362}
363
364/*
365 * service curve support functions
366 *
367 * external service curve parameters
368 * m: bps
369 * d: us
370 * internal service curve parameters
371 * sm: (bytes/psched_us) << SM_SHIFT
372 * ism: (psched_us/byte) << ISM_SHIFT
373 * dx: psched_us
374 *
641b9e0e 375 * The clock source resolution with ktime is 1.024us.
1da177e4
LT		 376 *
377 * sm and ism are scaled in order to keep effective digits.
378 * SM_SHIFT and ISM_SHIFT are selected to keep at least 4 effective
379 * digits in decimal using the following table.
380 *
1da177e4
LT		 381 * bits/sec 100Kbps 1Mbps 10Mbps 100Mbps 1Gbps
382 * ------------+-------------------------------------------------------
641b9e0e 383 * bytes/1.024us 12.8e-3 128e-3 1280e-3 12800e-3 128000e-3
1da177e4 384 *
641b9e0e 385 * 1.024us/byte 78.125 7.8125 0.78125 0.078125 0.0078125
1da177e4
LT		 386 */
387#define SM_SHIFT 20
388#define ISM_SHIFT 18
389
390#define SM_MASK ((1ULL << SM_SHIFT) - 1)
391#define ISM_MASK ((1ULL << ISM_SHIFT) - 1)
392
393static inline u64
394seg_x2y(u64 x, u64 sm)
395{
396 u64 y;
397
398 /*
399 * compute
400 * y = x * sm >> SM_SHIFT
401 * but divide it for the upper and lower bits to avoid overflow
402 */
403 y = (x >> SM_SHIFT) * sm + (((x & SM_MASK) * sm) >> SM_SHIFT);
404 return y;
405}
406
407static inline u64
408seg_y2x(u64 y, u64 ism)
409{
410 u64 x;
411
412 if (y == 0)
413 x = 0;
414 else if (ism == HT_INFINITY)
415 x = HT_INFINITY;
416 else {
417 x = (y >> ISM_SHIFT) * ism
418 + (((y & ISM_MASK) * ism) >> ISM_SHIFT);
419 }
420 return x;
421}
422
423/* Convert m (bps) into sm (bytes/psched us) */
424static u64
425m2sm(u32 m)
426{
427 u64 sm;
428
429 sm = ((u64)m << SM_SHIFT);
00c04af9
PM		 430 sm += PSCHED_TICKS_PER_SEC - 1;
431 do_div(sm, PSCHED_TICKS_PER_SEC);
1da177e4
LT		 432 return sm;
433}
434
435/* convert m (bps) into ism (psched us/byte) */
436static u64
437m2ism(u32 m)
438{
439 u64 ism;
440
441 if (m == 0)
442 ism = HT_INFINITY;
443 else {
00c04af9 444 ism = ((u64)PSCHED_TICKS_PER_SEC << ISM_SHIFT);
1da177e4
LT		 445 ism += m - 1;
446 do_div(ism, m);
447 }
448 return ism;
449}
450
451/* convert d (us) into dx (psched us) */
452static u64
453d2dx(u32 d)
454{
455 u64 dx;
456
00c04af9 457 dx = ((u64)d * PSCHED_TICKS_PER_SEC);
538e43a4
PM		 458 dx += USEC_PER_SEC - 1;
459 do_div(dx, USEC_PER_SEC);
1da177e4
LT		 460 return dx;
461}
462
463/* convert sm (bytes/psched us) into m (bps) */
464static u32
465sm2m(u64 sm)
466{
467 u64 m;
468
00c04af9 469 m = (sm * PSCHED_TICKS_PER_SEC) >> SM_SHIFT;
1da177e4
LT		 470 return (u32)m;
471}
472
473/* convert dx (psched us) into d (us) */
474static u32
475dx2d(u64 dx)
476{
477 u64 d;
478
538e43a4 479 d = dx * USEC_PER_SEC;
00c04af9 480 do_div(d, PSCHED_TICKS_PER_SEC);
1da177e4
LT		 481 return (u32)d;
482}
483
484static void
485sc2isc(struct tc_service_curve *sc, struct internal_sc *isc)
486{
487 isc->sm1 = m2sm(sc->m1);
488 isc->ism1 = m2ism(sc->m1);
489 isc->dx = d2dx(sc->d);
490 isc->dy = seg_x2y(isc->dx, isc->sm1);
491 isc->sm2 = m2sm(sc->m2);
492 isc->ism2 = m2ism(sc->m2);
493}
494
495/*
496 * initialize the runtime service curve with the given internal
497 * service curve starting at (x, y).
498 */
499static void
500rtsc_init(struct runtime_sc *rtsc, struct internal_sc *isc, u64 x, u64 y)
501{
502 rtsc->x = x;
503 rtsc->y = y;
504 rtsc->sm1 = isc->sm1;
505 rtsc->ism1 = isc->ism1;
506 rtsc->dx = isc->dx;
507 rtsc->dy = isc->dy;
508 rtsc->sm2 = isc->sm2;
509 rtsc->ism2 = isc->ism2;
510}
511
512/*
513 * calculate the y-projection of the runtime service curve by the
514 * given x-projection value
515 */
516static u64
517rtsc_y2x(struct runtime_sc *rtsc, u64 y)
518{
519 u64 x;
520
521 if (y < rtsc->y)
522 x = rtsc->x;
523 else if (y <= rtsc->y + rtsc->dy) {
524 /* x belongs to the 1st segment */
525 if (rtsc->dy == 0)
526 x = rtsc->x + rtsc->dx;
527 else
528 x = rtsc->x + seg_y2x(y - rtsc->y, rtsc->ism1);
529 } else {
530 /* x belongs to the 2nd segment */
531 x = rtsc->x + rtsc->dx
532 + seg_y2x(y - rtsc->y - rtsc->dy, rtsc->ism2);
533 }
534 return x;
535}
536
537static u64
538rtsc_x2y(struct runtime_sc *rtsc, u64 x)
539{
540 u64 y;
541
542 if (x <= rtsc->x)
543 y = rtsc->y;
544 else if (x <= rtsc->x + rtsc->dx)
545 /* y belongs to the 1st segment */
546 y = rtsc->y + seg_x2y(x - rtsc->x, rtsc->sm1);
547 else
548 /* y belongs to the 2nd segment */
549 y = rtsc->y + rtsc->dy
550 + seg_x2y(x - rtsc->x - rtsc->dx, rtsc->sm2);
551 return y;
552}
553
554/*
555 * update the runtime service curve by taking the minimum of the current
556 * runtime service curve and the service curve starting at (x, y).
557 */
558static void
559rtsc_min(struct runtime_sc *rtsc, struct internal_sc *isc, u64 x, u64 y)
560{
561 u64 y1, y2, dx, dy;
562 u32 dsm;
563
564 if (isc->sm1 <= isc->sm2) {
565 /* service curve is convex */
566 y1 = rtsc_x2y(rtsc, x);
567 if (y1 < y)
568 /* the current rtsc is smaller */
569 return;
570 rtsc->x = x;
571 rtsc->y = y;
572 return;
573 }
574
575 /*
576 * service curve is concave
577 * compute the two y values of the current rtsc
578 * y1: at x
579 * y2: at (x + dx)
580 */
581 y1 = rtsc_x2y(rtsc, x);
582 if (y1 <= y) {
583 /* rtsc is below isc, no change to rtsc */
584 return;
585 }
586
587 y2 = rtsc_x2y(rtsc, x + isc->dx);
588 if (y2 >= y + isc->dy) {
589 /* rtsc is above isc, replace rtsc by isc */
590 rtsc->x = x;
591 rtsc->y = y;
592 rtsc->dx = isc->dx;
593 rtsc->dy = isc->dy;
594 return;
595 }
596
597 /*
598 * the two curves intersect
599 * compute the offsets (dx, dy) using the reverse
600 * function of seg_x2y()
601 * seg_x2y(dx, sm1) == seg_x2y(dx, sm2) + (y1 - y)
602 */
603 dx = (y1 - y) << SM_SHIFT;
604 dsm = isc->sm1 - isc->sm2;
605 do_div(dx, dsm);
606 /*
607 * check if (x, y1) belongs to the 1st segment of rtsc.
608 * if so, add the offset.
609 */
610 if (rtsc->x + rtsc->dx > x)
611 dx += rtsc->x + rtsc->dx - x;
612 dy = seg_x2y(dx, isc->sm1);
613
614 rtsc->x = x;
615 rtsc->y = y;
616 rtsc->dx = dx;
617 rtsc->dy = dy;
618 return;
619}
620
621static void
622init_ed(struct hfsc_class *cl, unsigned int next_len)
623{
3bebcda2 624 u64 cur_time = psched_get_time();
1da177e4
LT		 625
626 /* update the deadline curve */
627 rtsc_min(&cl->cl_deadline, &cl->cl_rsc, cur_time, cl->cl_cumul);
628
629 /*
630 * update the eligible curve.
631 * for concave, it is equal to the deadline curve.
632 * for convex, it is a linear curve with slope m2.
633 */
634 cl->cl_eligible = cl->cl_deadline;
635 if (cl->cl_rsc.sm1 <= cl->cl_rsc.sm2) {
636 cl->cl_eligible.dx = 0;
637 cl->cl_eligible.dy = 0;
638 }
639
640 /* compute e and d */
641 cl->cl_e = rtsc_y2x(&cl->cl_eligible, cl->cl_cumul);
642 cl->cl_d = rtsc_y2x(&cl->cl_deadline, cl->cl_cumul + next_len);
643
644 eltree_insert(cl);
645}
646
647static void
648update_ed(struct hfsc_class *cl, unsigned int next_len)
649{
650 cl->cl_e = rtsc_y2x(&cl->cl_eligible, cl->cl_cumul);
651 cl->cl_d = rtsc_y2x(&cl->cl_deadline, cl->cl_cumul + next_len);
652
653 eltree_update(cl);
654}
655
656static inline void
657update_d(struct hfsc_class *cl, unsigned int next_len)
658{
659 cl->cl_d = rtsc_y2x(&cl->cl_deadline, cl->cl_cumul + next_len);
660}
661
662static inline void
663update_cfmin(struct hfsc_class *cl)
664{
665 struct rb_node *n = rb_first(&cl->cf_tree);
666 struct hfsc_class *p;
667
668 if (n == NULL) {
669 cl->cl_cfmin = 0;
670 return;
671 }
672 p = rb_entry(n, struct hfsc_class, cf_node);
673 cl->cl_cfmin = p->cl_f;
674}
675
676static void
677init_vf(struct hfsc_class *cl, unsigned int len)
678{
679 struct hfsc_class *max_cl;
680 struct rb_node *n;
681 u64 vt, f, cur_time;
682 int go_active;
683
684 cur_time = 0;
685 go_active = 1;
686 for (; cl->cl_parent != NULL; cl = cl->cl_parent) {
687 if (go_active && cl->cl_nactive++ == 0)
688 go_active = 1;
689 else
690 go_active = 0;
691
692 if (go_active) {
693 n = rb_last(&cl->cl_parent->vt_tree);
694 if (n != NULL) {
695 max_cl = rb_entry(n, struct hfsc_class,vt_node);
696 /*
697 * set vt to the average of the min and max
698 * classes. if the parent's period didn't
699 * change, don't decrease vt of the class.
700 */
701 vt = max_cl->cl_vt;
702 if (cl->cl_parent->cl_cvtmin != 0)
703 vt = (cl->cl_parent->cl_cvtmin + vt)/2;
704
705 if (cl->cl_parent->cl_vtperiod !=
706 cl->cl_parentperiod || vt > cl->cl_vt)
707 cl->cl_vt = vt;
708 } else {
709 /*
710 * first child for a new parent backlog period.
711 * add parent's cvtmax to cvtoff to make a new
712 * vt (vtoff + vt) larger than the vt in the
713 * last period for all children.
714 */
715 vt = cl->cl_parent->cl_cvtmax;
716 cl->cl_parent->cl_cvtoff += vt;
717 cl->cl_parent->cl_cvtmax = 0;
718 cl->cl_parent->cl_cvtmin = 0;
719 cl->cl_vt = 0;
720 }
721
722 cl->cl_vtoff = cl->cl_parent->cl_cvtoff -
723 cl->cl_pcvtoff;
724
725 /* update the virtual curve */
726 vt = cl->cl_vt + cl->cl_vtoff;
727 rtsc_min(&cl->cl_virtual, &cl->cl_fsc, vt,
10297b99 728 cl->cl_total);
1da177e4
LT		 729 if (cl->cl_virtual.x == vt) {
730 cl->cl_virtual.x -= cl->cl_vtoff;
731 cl->cl_vtoff = 0;
732 }
733 cl->cl_vtadj = 0;
734
735 cl->cl_vtperiod++; /* increment vt period */
736 cl->cl_parentperiod = cl->cl_parent->cl_vtperiod;
737 if (cl->cl_parent->cl_nactive == 0)
738 cl->cl_parentperiod++;
739 cl->cl_f = 0;
740
741 vttree_insert(cl);
742 cftree_insert(cl);
743
744 if (cl->cl_flags & HFSC_USC) {
745 /* class has upper limit curve */
746 if (cur_time == 0)
3bebcda2 747 cur_time = psched_get_time();
1da177e4
LT		 748
749 /* update the ulimit curve */
750 rtsc_min(&cl->cl_ulimit, &cl->cl_usc, cur_time,
10297b99 751 cl->cl_total);
1da177e4
LT		 752 /* compute myf */
753 cl->cl_myf = rtsc_y2x(&cl->cl_ulimit,
10297b99 754 cl->cl_total);
1da177e4
LT		 755 cl->cl_myfadj = 0;
756 }
757 }
758
759 f = max(cl->cl_myf, cl->cl_cfmin);
760 if (f != cl->cl_f) {
761 cl->cl_f = f;
762 cftree_update(cl);
763 update_cfmin(cl->cl_parent);
764 }
765 }
766}
767
768static void
769update_vf(struct hfsc_class *cl, unsigned int len, u64 cur_time)
770{
771 u64 f; /* , myf_bound, delta; */
772 int go_passive = 0;
773
774 if (cl->qdisc->q.qlen == 0 && cl->cl_flags & HFSC_FSC)
775 go_passive = 1;
776
777 for (; cl->cl_parent != NULL; cl = cl->cl_parent) {
778 cl->cl_total += len;
779
780 if (!(cl->cl_flags & HFSC_FSC) || cl->cl_nactive == 0)
781 continue;
782
783 if (go_passive && --cl->cl_nactive == 0)
784 go_passive = 1;
785 else
786 go_passive = 0;
787
788 if (go_passive) {
789 /* no more active child, going passive */
790
791 /* update cvtmax of the parent class */
792 if (cl->cl_vt > cl->cl_parent->cl_cvtmax)
793 cl->cl_parent->cl_cvtmax = cl->cl_vt;
794
795 /* remove this class from the vt tree */
796 vttree_remove(cl);
797
798 cftree_remove(cl);
799 update_cfmin(cl->cl_parent);
800
801 continue;
802 }
803
804 /*
805 * update vt and f
806 */
807 cl->cl_vt = rtsc_y2x(&cl->cl_virtual, cl->cl_total)
10297b99 808 - cl->cl_vtoff + cl->cl_vtadj;
1da177e4
LT		 809
810 /*
811 * if vt of the class is smaller than cvtmin,
812 * the class was skipped in the past due to non-fit.
813 * if so, we need to adjust vtadj.
814 */
815 if (cl->cl_vt < cl->cl_parent->cl_cvtmin) {
816 cl->cl_vtadj += cl->cl_parent->cl_cvtmin - cl->cl_vt;
817 cl->cl_vt = cl->cl_parent->cl_cvtmin;
818 }
819
820 /* update the vt tree */
821 vttree_update(cl);
822
823 if (cl->cl_flags & HFSC_USC) {
824 cl->cl_myf = cl->cl_myfadj + rtsc_y2x(&cl->cl_ulimit,
10297b99 825 cl->cl_total);
1da177e4
LT		 826#if 0
827 /*
828 * This code causes classes to stay way under their
829 * limit when multiple classes are used at gigabit
830 * speed. needs investigation. -kaber
831 */
832 /*
833 * if myf lags behind by more than one clock tick
834 * from the current time, adjust myfadj to prevent
835 * a rate-limited class from going greedy.
836 * in a steady state under rate-limiting, myf
837 * fluctuates within one clock tick.
838 */
839 myf_bound = cur_time - PSCHED_JIFFIE2US(1);
840 if (cl->cl_myf < myf_bound) {
841 delta = cur_time - cl->cl_myf;
842 cl->cl_myfadj += delta;
843 cl->cl_myf += delta;
844 }
845#endif
846 }
847
848 f = max(cl->cl_myf, cl->cl_cfmin);
849 if (f != cl->cl_f) {
850 cl->cl_f = f;
851 cftree_update(cl);
852 update_cfmin(cl->cl_parent);
853 }
854 }
855}
856
857static void
858set_active(struct hfsc_class *cl, unsigned int len)
859{
860 if (cl->cl_flags & HFSC_RSC)
861 init_ed(cl, len);
862 if (cl->cl_flags & HFSC_FSC)
863 init_vf(cl, len);
864
865 list_add_tail(&cl->dlist, &cl->sched->droplist);
866}
867
868static void
869set_passive(struct hfsc_class *cl)
870{
871 if (cl->cl_flags & HFSC_RSC)
872 eltree_remove(cl);
873
874 list_del(&cl->dlist);
875
876 /*
877 * vttree is now handled in update_vf() so that update_vf(cl, 0, 0)
878 * needs to be called explicitly to remove a class from vttree.
879 */
880}
881
1da177e4
LT		 882static unsigned int
883qdisc_peek_len(struct Qdisc *sch)
884{
885 struct sk_buff *skb;
886 unsigned int len;
887
03c05f0d 888 skb = sch->ops->peek(sch);
1da177e4
LT		 889 if (skb == NULL) {
890 if (net_ratelimit())
891 printk("qdisc_peek_len: non work-conserving qdisc ?\n");
892 return 0;
893 }
0abf77e5 894 len = qdisc_pkt_len(skb);
03c05f0d 895
1da177e4
LT		 896 return len;
897}
898
899static void
900hfsc_purge_queue(struct Qdisc *sch, struct hfsc_class *cl)
901{
902 unsigned int len = cl->qdisc->q.qlen;
903
904 qdisc_reset(cl->qdisc);
f973b913 905 qdisc_tree_decrease_qlen(cl->qdisc, len);
1da177e4
LT		 906}
907
908static void
909hfsc_adjust_levels(struct hfsc_class *cl)
910{
911 struct hfsc_class *p;
912 unsigned int level;
913
914 do {
915 level = 0;
916 list_for_each_entry(p, &cl->children, siblings) {
210525d6
PM		 917 if (p->level >= level)
918 level = p->level + 1;
1da177e4 919 }
210525d6 920 cl->level = level;
1da177e4
LT		 921 } while ((cl = cl->cl_parent) != NULL);
922}
923
1da177e4
LT		 924static inline struct hfsc_class *
925hfsc_find_class(u32 classid, struct Qdisc *sch)
926{
927 struct hfsc_sched *q = qdisc_priv(sch);
be0d39d5 928 struct Qdisc_class_common *clc;
1da177e4 929
be0d39d5
PM		 930 clc = qdisc_class_find(&q->clhash, classid);
931 if (clc == NULL)
932 return NULL;
933 return container_of(clc, struct hfsc_class, cl_common);
1da177e4
LT		 934}
935
936static void
937hfsc_change_rsc(struct hfsc_class *cl, struct tc_service_curve *rsc,
10297b99 938 u64 cur_time)
1da177e4
LT		 939{
940 sc2isc(rsc, &cl->cl_rsc);
941 rtsc_init(&cl->cl_deadline, &cl->cl_rsc, cur_time, cl->cl_cumul);
942 cl->cl_eligible = cl->cl_deadline;
943 if (cl->cl_rsc.sm1 <= cl->cl_rsc.sm2) {
944 cl->cl_eligible.dx = 0;
945 cl->cl_eligible.dy = 0;
946 }
947 cl->cl_flags |= HFSC_RSC;
948}
949
950static void
951hfsc_change_fsc(struct hfsc_class *cl, struct tc_service_curve *fsc)
952{
953 sc2isc(fsc, &cl->cl_fsc);
954 rtsc_init(&cl->cl_virtual, &cl->cl_fsc, cl->cl_vt, cl->cl_total);
955 cl->cl_flags |= HFSC_FSC;
956}
957
958static void
959hfsc_change_usc(struct hfsc_class *cl, struct tc_service_curve *usc,
10297b99 960 u64 cur_time)
1da177e4
LT		 961{
962 sc2isc(usc, &cl->cl_usc);
963 rtsc_init(&cl->cl_ulimit, &cl->cl_usc, cur_time, cl->cl_total);
964 cl->cl_flags |= HFSC_USC;
965}
966
27a3421e
PM		 967static const struct nla_policy hfsc_policy[TCA_HFSC_MAX + 1] = {
968 [TCA_HFSC_RSC] = { .len = sizeof(struct tc_service_curve) },
969 [TCA_HFSC_FSC] = { .len = sizeof(struct tc_service_curve) },
970 [TCA_HFSC_USC] = { .len = sizeof(struct tc_service_curve) },
971};
972
1da177e4
LT		 973static int
974hfsc_change_class(struct Qdisc *sch, u32 classid, u32 parentid,
1e90474c 975 struct nlattr **tca, unsigned long *arg)
1da177e4
LT		 976{
977 struct hfsc_sched *q = qdisc_priv(sch);
978 struct hfsc_class *cl = (struct hfsc_class *)*arg;
979 struct hfsc_class *parent = NULL;
1e90474c
PM		 980 struct nlattr *opt = tca[TCA_OPTIONS];
981 struct nlattr *tb[TCA_HFSC_MAX + 1];
1da177e4
LT		 982 struct tc_service_curve *rsc = NULL, *fsc = NULL, *usc = NULL;
983 u64 cur_time;
cee63723 984 int err;
1da177e4 985
cee63723 986 if (opt == NULL)
1da177e4
LT		 987 return -EINVAL;
988
27a3421e 989 err = nla_parse_nested(tb, TCA_HFSC_MAX, opt, hfsc_policy);
cee63723
PM		 990 if (err < 0)
991 return err;
992
1e90474c 993 if (tb[TCA_HFSC_RSC]) {
1e90474c 994 rsc = nla_data(tb[TCA_HFSC_RSC]);
1da177e4
LT		 995 if (rsc->m1 == 0 && rsc->m2 == 0)
996 rsc = NULL;
997 }
998
1e90474c 999 if (tb[TCA_HFSC_FSC]) {
1e90474c 1000 fsc = nla_data(tb[TCA_HFSC_FSC]);
1da177e4
LT		 1001 if (fsc->m1 == 0 && fsc->m2 == 0)
1002 fsc = NULL;
1003 }
1004
1e90474c 1005 if (tb[TCA_HFSC_USC]) {
1e90474c 1006 usc = nla_data(tb[TCA_HFSC_USC]);
1da177e4
LT		 1007 if (usc->m1 == 0 && usc->m2 == 0)
1008 usc = NULL;
1009 }
1010
1011 if (cl != NULL) {
1012 if (parentid) {
be0d39d5
PM		 1013 if (cl->cl_parent &&
1014 cl->cl_parent->cl_common.classid != parentid)
1da177e4
LT		 1015 return -EINVAL;
1016 if (cl->cl_parent == NULL && parentid != TC_H_ROOT)
1017 return -EINVAL;
1018 }
3bebcda2 1019 cur_time = psched_get_time();
1da177e4
LT		 1020
1021 sch_tree_lock(sch);
1022 if (rsc != NULL)
1023 hfsc_change_rsc(cl, rsc, cur_time);
1024 if (fsc != NULL)
1025 hfsc_change_fsc(cl, fsc);
1026 if (usc != NULL)
1027 hfsc_change_usc(cl, usc, cur_time);
1028
1029 if (cl->qdisc->q.qlen != 0) {
1030 if (cl->cl_flags & HFSC_RSC)
1031 update_ed(cl, qdisc_peek_len(cl->qdisc));
1032 if (cl->cl_flags & HFSC_FSC)
1033 update_vf(cl, 0, cur_time);
1034 }
1035 sch_tree_unlock(sch);
1036
1e90474c 1037 if (tca[TCA_RATE])
1da177e4 1038 gen_replace_estimator(&cl->bstats, &cl->rate_est,
f6f9b93f 1039 qdisc_root_sleeping_lock(sch),
1e90474c 1040 tca[TCA_RATE]);
1da177e4
LT		 1041 return 0;
1042 }
1043
1044 if (parentid == TC_H_ROOT)
1045 return -EEXIST;
1046
1047 parent = &q->root;
1048 if (parentid) {
1049 parent = hfsc_find_class(parentid, sch);
1050 if (parent == NULL)
1051 return -ENOENT;
1052 }
1053
1054 if (classid == 0 || TC_H_MAJ(classid ^ sch->handle) != 0)
1055 return -EINVAL;
1056 if (hfsc_find_class(classid, sch))
1057 return -EEXIST;
1058
1059 if (rsc == NULL && fsc == NULL)
1060 return -EINVAL;
1061
0da974f4 1062 cl = kzalloc(sizeof(struct hfsc_class), GFP_KERNEL);
1da177e4
LT		 1063 if (cl == NULL)
1064 return -ENOBUFS;
1da177e4
LT		 1065
1066 if (rsc != NULL)
1067 hfsc_change_rsc(cl, rsc, 0);
1068 if (fsc != NULL)
1069 hfsc_change_fsc(cl, fsc);
1070 if (usc != NULL)
1071 hfsc_change_usc(cl, usc, 0);
1072
be0d39d5 1073 cl->cl_common.classid = classid;
1da177e4 1074 cl->refcnt = 1;
1da177e4
LT		 1075 cl->sched = q;
1076 cl->cl_parent = parent;
5ce2d488 1077 cl->qdisc = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
bb949fbd 1078 &pfifo_qdisc_ops, classid);
1da177e4
LT		 1079 if (cl->qdisc == NULL)
1080 cl->qdisc = &noop_qdisc;
1da177e4
LT		 1081 INIT_LIST_HEAD(&cl->children);
1082 cl->vt_tree = RB_ROOT;
1083 cl->cf_tree = RB_ROOT;
1084
1085 sch_tree_lock(sch);
be0d39d5 1086 qdisc_class_hash_insert(&q->clhash, &cl->cl_common);
1da177e4
LT		 1087 list_add_tail(&cl->siblings, &parent->children);
1088 if (parent->level == 0)
1089 hfsc_purge_queue(sch, parent);
1090 hfsc_adjust_levels(parent);
1091 cl->cl_pcvtoff = parent->cl_cvtoff;
1092 sch_tree_unlock(sch);
1093
be0d39d5
PM		 1094 qdisc_class_hash_grow(sch, &q->clhash);
1095
1e90474c 1096 if (tca[TCA_RATE])
1da177e4 1097 gen_new_estimator(&cl->bstats, &cl->rate_est,
f6f9b93f 1098 qdisc_root_sleeping_lock(sch), tca[TCA_RATE]);
1da177e4
LT		 1099 *arg = (unsigned long)cl;
1100 return 0;
1101}
1102
1da177e4
LT		 1103static void
1104hfsc_destroy_class(struct Qdisc *sch, struct hfsc_class *cl)
1105{
1106 struct hfsc_sched *q = qdisc_priv(sch);
1107
ff31ab56 1108 tcf_destroy_chain(&cl->filter_list);
1da177e4 1109 qdisc_destroy(cl->qdisc);
1da177e4 1110 gen_kill_estimator(&cl->bstats, &cl->rate_est);
1da177e4
LT		 1111 if (cl != &q->root)
1112 kfree(cl);
1113}
1114
1115static int
1116hfsc_delete_class(struct Qdisc *sch, unsigned long arg)
1117{
1118 struct hfsc_sched *q = qdisc_priv(sch);
1119 struct hfsc_class *cl = (struct hfsc_class *)arg;
1120
1121 if (cl->level > 0 || cl->filter_cnt > 0 || cl == &q->root)
1122 return -EBUSY;
1123
1124 sch_tree_lock(sch);
1125
1da177e4
LT		 1126 list_del(&cl->siblings);
1127 hfsc_adjust_levels(cl->cl_parent);
c38c83cb 1128
1da177e4 1129 hfsc_purge_queue(sch, cl);
be0d39d5 1130 qdisc_class_hash_remove(&q->clhash, &cl->cl_common);
c38c83cb 1131
1da177e4
LT		 1132 if (--cl->refcnt == 0)
1133 hfsc_destroy_class(sch, cl);
1134
1135 sch_tree_unlock(sch);
1136 return 0;
1137}
1138
1139static struct hfsc_class *
1140hfsc_classify(struct sk_buff *skb, struct Qdisc *sch, int *qerr)
1141{
1142 struct hfsc_sched *q = qdisc_priv(sch);
1143 struct hfsc_class *cl;
1144 struct tcf_result res;
1145 struct tcf_proto *tcf;
1146 int result;
1147
1148 if (TC_H_MAJ(skb->priority ^ sch->handle) == 0 &&
1149 (cl = hfsc_find_class(skb->priority, sch)) != NULL)
1150 if (cl->level == 0)
1151 return cl;
1152
c27f339a 1153 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
1da177e4
LT		 1154 tcf = q->root.filter_list;
1155 while (tcf && (result = tc_classify(skb, tcf, &res)) >= 0) {
1156#ifdef CONFIG_NET_CLS_ACT
1157 switch (result) {
1158 case TC_ACT_QUEUED:
10297b99 1159 case TC_ACT_STOLEN:
378a2f09 1160 *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
10297b99 1161 case TC_ACT_SHOT:
1da177e4
LT		 1162 return NULL;
1163 }
1da177e4
LT		 1164#endif
1165 if ((cl = (struct hfsc_class *)res.class) == NULL) {
1166 if ((cl = hfsc_find_class(res.classid, sch)) == NULL)
1167 break; /* filter selected invalid classid */
1168 }
1169
1170 if (cl->level == 0)
1171 return cl; /* hit leaf class */
1172
1173 /* apply inner filter chain */
1174 tcf = cl->filter_list;
1175 }
1176
1177 /* classification failed, try default class */
1178 cl = hfsc_find_class(TC_H_MAKE(TC_H_MAJ(sch->handle), q->defcls), sch);
1179 if (cl == NULL || cl->level > 0)
1180 return NULL;
1181
1182 return cl;
1183}
1184
1185static int
1186hfsc_graft_class(struct Qdisc *sch, unsigned long arg, struct Qdisc *new,
10297b99 1187 struct Qdisc **old)
1da177e4
LT		 1188{
1189 struct hfsc_class *cl = (struct hfsc_class *)arg;
1190
1191 if (cl == NULL)
1192 return -ENOENT;
1193 if (cl->level > 0)
1194 return -EINVAL;
1195 if (new == NULL) {
5ce2d488 1196 new = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
bb949fbd 1197 &pfifo_qdisc_ops,
be0d39d5 1198 cl->cl_common.classid);
1da177e4
LT		 1199 if (new == NULL)
1200 new = &noop_qdisc;
1201 }
1202
1203 sch_tree_lock(sch);
1204 hfsc_purge_queue(sch, cl);
1205 *old = xchg(&cl->qdisc, new);
1206 sch_tree_unlock(sch);
1207 return 0;
1208}
1209
1210static struct Qdisc *
1211hfsc_class_leaf(struct Qdisc *sch, unsigned long arg)
1212{
1213 struct hfsc_class *cl = (struct hfsc_class *)arg;
1214
1215 if (cl != NULL && cl->level == 0)
1216 return cl->qdisc;
1217
1218 return NULL;
1219}
1220
f973b913
PM		 1221static void
1222hfsc_qlen_notify(struct Qdisc *sch, unsigned long arg)
1223{
1224 struct hfsc_class *cl = (struct hfsc_class *)arg;
1225
1226 if (cl->qdisc->q.qlen == 0) {
1227 update_vf(cl, 0, 0);
1228 set_passive(cl);
1229 }
1230}
1231
1da177e4
LT		 1232static unsigned long
1233hfsc_get_class(struct Qdisc *sch, u32 classid)
1234{
1235 struct hfsc_class *cl = hfsc_find_class(classid, sch);
1236
1237 if (cl != NULL)
1238 cl->refcnt++;
1239
1240 return (unsigned long)cl;
1241}
1242
1243static void
1244hfsc_put_class(struct Qdisc *sch, unsigned long arg)
1245{
1246 struct hfsc_class *cl = (struct hfsc_class *)arg;
1247
1248 if (--cl->refcnt == 0)
1249 hfsc_destroy_class(sch, cl);
1250}
1251
1252static unsigned long
1253hfsc_bind_tcf(struct Qdisc *sch, unsigned long parent, u32 classid)
1254{
1255 struct hfsc_class *p = (struct hfsc_class *)parent;
1256 struct hfsc_class *cl = hfsc_find_class(classid, sch);
1257
1258 if (cl != NULL) {
1259 if (p != NULL && p->level <= cl->level)
1260 return 0;
1261 cl->filter_cnt++;
1262 }
1263
1264 return (unsigned long)cl;
1265}
1266
1267static void
1268hfsc_unbind_tcf(struct Qdisc *sch, unsigned long arg)
1269{
1270 struct hfsc_class *cl = (struct hfsc_class *)arg;
1271
1272 cl->filter_cnt--;
1273}
1274
1275static struct tcf_proto **
1276hfsc_tcf_chain(struct Qdisc *sch, unsigned long arg)
1277{
1278 struct hfsc_sched *q = qdisc_priv(sch);
1279 struct hfsc_class *cl = (struct hfsc_class *)arg;
1280
1281 if (cl == NULL)
1282 cl = &q->root;
1283
1284 return &cl->filter_list;
1285}
1286
1287static int
1288hfsc_dump_sc(struct sk_buff *skb, int attr, struct internal_sc *sc)
1289{
1290 struct tc_service_curve tsc;
1291
1292 tsc.m1 = sm2m(sc->sm1);
1293 tsc.d = dx2d(sc->dx);
1294 tsc.m2 = sm2m(sc->sm2);
1e90474c 1295 NLA_PUT(skb, attr, sizeof(tsc), &tsc);
1da177e4
LT		 1296
1297 return skb->len;
1298
1e90474c 1299 nla_put_failure:
1da177e4
LT		 1300 return -1;
1301}
1302
1303static inline int
1304hfsc_dump_curves(struct sk_buff *skb, struct hfsc_class *cl)
1305{
1306 if ((cl->cl_flags & HFSC_RSC) &&
1307 (hfsc_dump_sc(skb, TCA_HFSC_RSC, &cl->cl_rsc) < 0))
1e90474c 1308 goto nla_put_failure;
1da177e4
LT		 1309
1310 if ((cl->cl_flags & HFSC_FSC) &&
1311 (hfsc_dump_sc(skb, TCA_HFSC_FSC, &cl->cl_fsc) < 0))
1e90474c 1312 goto nla_put_failure;
1da177e4
LT		 1313
1314 if ((cl->cl_flags & HFSC_USC) &&
1315 (hfsc_dump_sc(skb, TCA_HFSC_USC, &cl->cl_usc) < 0))
1e90474c 1316 goto nla_put_failure;
1da177e4
LT		 1317
1318 return skb->len;
1319
1e90474c 1320 nla_put_failure:
1da177e4
LT		 1321 return -1;
1322}
1323
1324static int
1325hfsc_dump_class(struct Qdisc *sch, unsigned long arg, struct sk_buff *skb,
10297b99 1326 struct tcmsg *tcm)
1da177e4
LT		 1327{
1328 struct hfsc_class *cl = (struct hfsc_class *)arg;
4b3550ef 1329 struct nlattr *nest;
1da177e4 1330
be0d39d5
PM		 1331 tcm->tcm_parent = cl->cl_parent ? cl->cl_parent->cl_common.classid :
1332 TC_H_ROOT;
1333 tcm->tcm_handle = cl->cl_common.classid;
1da177e4
LT		 1334 if (cl->level == 0)
1335 tcm->tcm_info = cl->qdisc->handle;
1336
4b3550ef
PM		 1337 nest = nla_nest_start(skb, TCA_OPTIONS);
1338 if (nest == NULL)
1339 goto nla_put_failure;
1da177e4 1340 if (hfsc_dump_curves(skb, cl) < 0)
1e90474c 1341 goto nla_put_failure;
4b3550ef 1342 nla_nest_end(skb, nest);
1da177e4
LT		 1343 return skb->len;
1344
1e90474c 1345 nla_put_failure:
4b3550ef 1346 nla_nest_cancel(skb, nest);
bc3ed28c 1347 return -EMSGSIZE;
1da177e4
LT		 1348}
1349
1350static int
1351hfsc_dump_class_stats(struct Qdisc *sch, unsigned long arg,
1352 struct gnet_dump *d)
1353{
1354 struct hfsc_class *cl = (struct hfsc_class *)arg;
1355 struct tc_hfsc_stats xstats;
1356
1357 cl->qstats.qlen = cl->qdisc->q.qlen;
1358 xstats.level = cl->level;
1359 xstats.period = cl->cl_vtperiod;
1360 xstats.work = cl->cl_total;
1361 xstats.rtwork = cl->cl_cumul;
1362
1363 if (gnet_stats_copy_basic(d, &cl->bstats) < 0 ||
1da177e4 1364 gnet_stats_copy_rate_est(d, &cl->rate_est) < 0 ||
1da177e4
LT		 1365 gnet_stats_copy_queue(d, &cl->qstats) < 0)
1366 return -1;
1367
1368 return gnet_stats_copy_app(d, &xstats, sizeof(xstats));
1369}
1370
1371
1372
1373static void
1374hfsc_walk(struct Qdisc *sch, struct qdisc_walker *arg)
1375{
1376 struct hfsc_sched *q = qdisc_priv(sch);
be0d39d5 1377 struct hlist_node *n;
1da177e4
LT		 1378 struct hfsc_class *cl;
1379 unsigned int i;
1380
1381 if (arg->stop)
1382 return;
1383
be0d39d5
PM		 1384 for (i = 0; i < q->clhash.hashsize; i++) {
1385 hlist_for_each_entry(cl, n, &q->clhash.hash[i],
1386 cl_common.hnode) {
1da177e4
LT		 1387 if (arg->count < arg->skip) {
1388 arg->count++;
1389 continue;
1390 }
1391 if (arg->fn(sch, (unsigned long)cl, arg) < 0) {
1392 arg->stop = 1;
1393 return;
1394 }
1395 arg->count++;
1396 }
1397 }
1398}
1399
1400static void
ed2b229a 1401hfsc_schedule_watchdog(struct Qdisc *sch)
1da177e4
LT		 1402{
1403 struct hfsc_sched *q = qdisc_priv(sch);
1404 struct hfsc_class *cl;
1405 u64 next_time = 0;
1da177e4
LT		 1406
1407 if ((cl = eltree_get_minel(q)) != NULL)
1408 next_time = cl->cl_e;
1409 if (q->root.cl_cfmin != 0) {
1410 if (next_time == 0 || next_time > q->root.cl_cfmin)
1411 next_time = q->root.cl_cfmin;
1412 }
3d50f231 1413 WARN_ON(next_time == 0);
ed2b229a 1414 qdisc_watchdog_schedule(&q->watchdog, next_time);
1da177e4
LT		 1415}
1416
1417static int
1e90474c 1418hfsc_init_qdisc(struct Qdisc *sch, struct nlattr *opt)
1da177e4
LT		 1419{
1420 struct hfsc_sched *q = qdisc_priv(sch);
1421 struct tc_hfsc_qopt *qopt;
be0d39d5 1422 int err;
1da177e4 1423
1e90474c 1424 if (opt == NULL || nla_len(opt) < sizeof(*qopt))
1da177e4 1425 return -EINVAL;
1e90474c 1426 qopt = nla_data(opt);
1da177e4 1427
1da177e4 1428 q->defcls = qopt->defcls;
be0d39d5
PM		 1429 err = qdisc_class_hash_init(&q->clhash);
1430 if (err < 0)
1431 return err;
1da177e4
LT		 1432 q->eligible = RB_ROOT;
1433 INIT_LIST_HEAD(&q->droplist);
1da177e4 1434
be0d39d5 1435 q->root.cl_common.classid = sch->handle;
1da177e4 1436 q->root.refcnt = 1;
1da177e4 1437 q->root.sched = q;
5ce2d488 1438 q->root.qdisc = qdisc_create_dflt(qdisc_dev(sch), sch->dev_queue,
bb949fbd 1439 &pfifo_qdisc_ops,
9f9afec4 1440 sch->handle);
1da177e4
LT		 1441 if (q->root.qdisc == NULL)
1442 q->root.qdisc = &noop_qdisc;
1da177e4
LT		 1443 INIT_LIST_HEAD(&q->root.children);
1444 q->root.vt_tree = RB_ROOT;
1445 q->root.cf_tree = RB_ROOT;
1446
be0d39d5
PM		 1447 qdisc_class_hash_insert(&q->clhash, &q->root.cl_common);
1448 qdisc_class_hash_grow(sch, &q->clhash);
1da177e4 1449
ed2b229a 1450 qdisc_watchdog_init(&q->watchdog, sch);
1da177e4
LT		 1451
1452 return 0;
1453}
1454
1455static int
1e90474c 1456hfsc_change_qdisc(struct Qdisc *sch, struct nlattr *opt)
1da177e4
LT		 1457{
1458 struct hfsc_sched *q = qdisc_priv(sch);
1459 struct tc_hfsc_qopt *qopt;
1460
1e90474c 1461 if (opt == NULL || nla_len(opt) < sizeof(*qopt))
1da177e4 1462 return -EINVAL;
1e90474c 1463 qopt = nla_data(opt);
1da177e4
LT		 1464
1465 sch_tree_lock(sch);
1466 q->defcls = qopt->defcls;
1467 sch_tree_unlock(sch);
1468
1469 return 0;
1470}
1471
1472static void
1473hfsc_reset_class(struct hfsc_class *cl)
1474{
1475 cl->cl_total = 0;
1476 cl->cl_cumul = 0;
1477 cl->cl_d = 0;
1478 cl->cl_e = 0;
1479 cl->cl_vt = 0;
1480 cl->cl_vtadj = 0;
1481 cl->cl_vtoff = 0;
1482 cl->cl_cvtmin = 0;
1483 cl->cl_cvtmax = 0;
1484 cl->cl_cvtoff = 0;
1485 cl->cl_pcvtoff = 0;
1486 cl->cl_vtperiod = 0;
1487 cl->cl_parentperiod = 0;
1488 cl->cl_f = 0;
1489 cl->cl_myf = 0;
1490 cl->cl_myfadj = 0;
1491 cl->cl_cfmin = 0;
1492 cl->cl_nactive = 0;
1493
1494 cl->vt_tree = RB_ROOT;
1495 cl->cf_tree = RB_ROOT;
1496 qdisc_reset(cl->qdisc);
1497
1498 if (cl->cl_flags & HFSC_RSC)
1499 rtsc_init(&cl->cl_deadline, &cl->cl_rsc, 0, 0);
1500 if (cl->cl_flags & HFSC_FSC)
1501 rtsc_init(&cl->cl_virtual, &cl->cl_fsc, 0, 0);
1502 if (cl->cl_flags & HFSC_USC)
1503 rtsc_init(&cl->cl_ulimit, &cl->cl_usc, 0, 0);
1504}
1505
1506static void
1507hfsc_reset_qdisc(struct Qdisc *sch)
1508{
1509 struct hfsc_sched *q = qdisc_priv(sch);
1510 struct hfsc_class *cl;
be0d39d5 1511 struct hlist_node *n;
1da177e4
LT		 1512 unsigned int i;
1513
be0d39d5
PM		 1514 for (i = 0; i < q->clhash.hashsize; i++) {
1515 hlist_for_each_entry(cl, n, &q->clhash.hash[i], cl_common.hnode)
1da177e4
LT		 1516 hfsc_reset_class(cl);
1517 }
1da177e4
LT		 1518 q->eligible = RB_ROOT;
1519 INIT_LIST_HEAD(&q->droplist);
ed2b229a 1520 qdisc_watchdog_cancel(&q->watchdog);
1da177e4
LT		 1521 sch->q.qlen = 0;
1522}
1523
1524static void
1525hfsc_destroy_qdisc(struct Qdisc *sch)
1526{
1527 struct hfsc_sched *q = qdisc_priv(sch);
be0d39d5
PM		 1528 struct hlist_node *n, *next;
1529 struct hfsc_class *cl;
1da177e4
LT		 1530 unsigned int i;
1531
be0d39d5
PM		 1532 for (i = 0; i < q->clhash.hashsize; i++) {
1533 hlist_for_each_entry(cl, n, &q->clhash.hash[i], cl_common.hnode)
a4aebb83
PM		 1534 tcf_destroy_chain(&cl->filter_list);
1535 }
be0d39d5
PM		 1536 for (i = 0; i < q->clhash.hashsize; i++) {
1537 hlist_for_each_entry_safe(cl, n, next, &q->clhash.hash[i],
1538 cl_common.hnode)
1da177e4
LT		 1539 hfsc_destroy_class(sch, cl);
1540 }
be0d39d5 1541 qdisc_class_hash_destroy(&q->clhash);
ed2b229a 1542 qdisc_watchdog_cancel(&q->watchdog);
1da177e4
LT		 1543}
1544
1545static int
1546hfsc_dump_qdisc(struct Qdisc *sch, struct sk_buff *skb)
1547{
1548 struct hfsc_sched *q = qdisc_priv(sch);
27a884dc 1549 unsigned char *b = skb_tail_pointer(skb);
1da177e4
LT		 1550 struct tc_hfsc_qopt qopt;
1551
1552 qopt.defcls = q->defcls;
1e90474c 1553 NLA_PUT(skb, TCA_OPTIONS, sizeof(qopt), &qopt);
1da177e4
LT		 1554 return skb->len;
1555
1e90474c 1556 nla_put_failure:
dc5fc579 1557 nlmsg_trim(skb, b);
1da177e4
LT		 1558 return -1;
1559}
1560
1561static int
1562hfsc_enqueue(struct sk_buff *skb, struct Qdisc *sch)
1563{
1564 struct hfsc_class *cl;
1da177e4
LT		 1565 int err;
1566
1567 cl = hfsc_classify(skb, sch, &err);
1568 if (cl == NULL) {
c27f339a 1569 if (err & __NET_XMIT_BYPASS)
1da177e4
LT		 1570 sch->qstats.drops++;
1571 kfree_skb(skb);
1572 return err;
1573 }
1574
5f86173b 1575 err = qdisc_enqueue(skb, cl->qdisc);
1da177e4 1576 if (unlikely(err != NET_XMIT_SUCCESS)) {
378a2f09
JP		 1577 if (net_xmit_drop_count(err)) {
1578 cl->qstats.drops++;
1579 sch->qstats.drops++;
1580 }
1da177e4
LT		 1581 return err;
1582 }
1583
1584 if (cl->qdisc->q.qlen == 1)
0abf77e5 1585 set_active(cl, qdisc_pkt_len(skb));
1da177e4
LT		 1586
1587 cl->bstats.packets++;
0abf77e5 1588 cl->bstats.bytes += qdisc_pkt_len(skb);
1da177e4 1589 sch->bstats.packets++;
0abf77e5 1590 sch->bstats.bytes += qdisc_pkt_len(skb);
1da177e4
LT		 1591 sch->q.qlen++;
1592
1593 return NET_XMIT_SUCCESS;
1594}
1595
1596static struct sk_buff *
1597hfsc_dequeue(struct Qdisc *sch)
1598{
1599 struct hfsc_sched *q = qdisc_priv(sch);
1600 struct hfsc_class *cl;
1601 struct sk_buff *skb;
1602 u64 cur_time;
1603 unsigned int next_len;
1604 int realtime = 0;
1605
1606 if (sch->q.qlen == 0)
1607 return NULL;
1da177e4 1608
3bebcda2 1609 cur_time = psched_get_time();
1da177e4
LT		 1610
1611 /*
1612 * if there are eligible classes, use real-time criteria.
1613 * find the class with the minimum deadline among
1614 * the eligible classes.
1615 */
1616 if ((cl = eltree_get_mindl(q, cur_time)) != NULL) {
1617 realtime = 1;
1618 } else {
1619 /*
1620 * use link-sharing criteria
1621 * get the class with the minimum vt in the hierarchy
1622 */
1623 cl = vttree_get_minvt(&q->root, cur_time);
1624 if (cl == NULL) {
1625 sch->qstats.overlimits++;
ed2b229a 1626 hfsc_schedule_watchdog(sch);
1da177e4
LT		 1627 return NULL;
1628 }
1629 }
1630
77be155c 1631 skb = qdisc_dequeue_peeked(cl->qdisc);
1da177e4
LT		 1632 if (skb == NULL) {
1633 if (net_ratelimit())
1634 printk("HFSC: Non-work-conserving qdisc ?\n");
1635 return NULL;
1636 }
1637
0abf77e5 1638 update_vf(cl, qdisc_pkt_len(skb), cur_time);
1da177e4 1639 if (realtime)
0abf77e5 1640 cl->cl_cumul += qdisc_pkt_len(skb);
1da177e4
LT		 1641
1642 if (cl->qdisc->q.qlen != 0) {
1643 if (cl->cl_flags & HFSC_RSC) {
1644 /* update ed */
1645 next_len = qdisc_peek_len(cl->qdisc);
1646 if (realtime)
1647 update_ed(cl, next_len);
1648 else
1649 update_d(cl, next_len);
1650 }
1651 } else {
1652 /* the class becomes passive */
1653 set_passive(cl);
1654 }
1655
1da177e4
LT		 1656 sch->flags &= ~TCQ_F_THROTTLED;
1657 sch->q.qlen--;
1658
1659 return skb;
1660}
1661
1da177e4
LT		 1662static unsigned int
1663hfsc_drop(struct Qdisc *sch)
1664{
1665 struct hfsc_sched *q = qdisc_priv(sch);
1666 struct hfsc_class *cl;
1667 unsigned int len;
1668
1669 list_for_each_entry(cl, &q->droplist, dlist) {
1670 if (cl->qdisc->ops->drop != NULL &&
1671 (len = cl->qdisc->ops->drop(cl->qdisc)) > 0) {
1672 if (cl->qdisc->q.qlen == 0) {
1673 update_vf(cl, 0, 0);
1674 set_passive(cl);
1675 } else {
1676 list_move_tail(&cl->dlist, &q->droplist);
1677 }
1678 cl->qstats.drops++;
1679 sch->qstats.drops++;
1680 sch->q.qlen--;
1681 return len;
1682 }
1683 }
1684 return 0;
1685}
1686
20fea08b 1687static const struct Qdisc_class_ops hfsc_class_ops = {
1da177e4
LT		 1688 .change = hfsc_change_class,
1689 .delete = hfsc_delete_class,
1690 .graft = hfsc_graft_class,
1691 .leaf = hfsc_class_leaf,
f973b913 1692 .qlen_notify = hfsc_qlen_notify,
1da177e4
LT		 1693 .get = hfsc_get_class,
1694 .put = hfsc_put_class,
1695 .bind_tcf = hfsc_bind_tcf,
1696 .unbind_tcf = hfsc_unbind_tcf,
1697 .tcf_chain = hfsc_tcf_chain,
1698 .dump = hfsc_dump_class,
1699 .dump_stats = hfsc_dump_class_stats,
1700 .walk = hfsc_walk
1701};
1702
20fea08b 1703static struct Qdisc_ops hfsc_qdisc_ops __read_mostly = {
1da177e4
LT		 1704 .id = "hfsc",
1705 .init = hfsc_init_qdisc,
1706 .change = hfsc_change_qdisc,
1707 .reset = hfsc_reset_qdisc,
1708 .destroy = hfsc_destroy_qdisc,
1709 .dump = hfsc_dump_qdisc,
1710 .enqueue = hfsc_enqueue,
1711 .dequeue = hfsc_dequeue,
77be155c 1712 .peek = qdisc_peek_dequeued,
1da177e4
LT		 1713 .drop = hfsc_drop,
1714 .cl_ops = &hfsc_class_ops,
1715 .priv_size = sizeof(struct hfsc_sched),
1716 .owner = THIS_MODULE
1717};
1718
1719static int __init
1720hfsc_init(void)
1721{
1722 return register_qdisc(&hfsc_qdisc_ops);
1723}
1724
1725static void __exit
1726hfsc_cleanup(void)
1727{
1728 unregister_qdisc(&hfsc_qdisc_ops);
1729}
1730
1731MODULE_LICENSE("GPL");
1732module_init(hfsc_init);
1733module_exit(hfsc_cleanup);
Linux kernel - Deliverables
This page took 0.542138 seconds and 5 git commands to generate.