linux/net/sched/sch_htb.c
<<
>>
Prefs
   1/*
   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
  14 *              Ondrej Kraus, <krauso@barr.cz>
  15 *                      found missing INIT_QDISC(htb)
  16 *              Vladimir Smelhaus, Aamer Akhter, Bert Hubert
  17 *                      helped a lot to locate nasty class stall bug
  18 *              Andi Kleen, Jamal Hadi, Bert Hubert
  19 *                      code review and helpful comments on shaping
  20 *              Tomasz Wrona, <tw@eter.tym.pl>
  21 *                      created test case so that I was able to fix nasty bug
  22 *              Wilfried Weissmann
  23 *                      spotted bug in dequeue code and helped with fix
  24 *              Jiri Fojtasek
  25 *                      fixed requeue routine
  26 *              and many others. thanks.
  27 */
  28#include <linux/module.h>
  29#include <linux/moduleparam.h>
  30#include <linux/types.h>
  31#include <linux/kernel.h>
  32#include <linux/string.h>
  33#include <linux/errno.h>
  34#include <linux/skbuff.h>
  35#include <linux/list.h>
  36#include <linux/compiler.h>
  37#include <linux/rbtree.h>
  38#include <linux/workqueue.h>
  39#include <linux/slab.h>
  40#include <net/netlink.h>
  41#include <net/pkt_sched.h>
  42
  43/* HTB algorithm.
  44    Author: devik@cdi.cz
  45    ========================================================================
  46    HTB is like TBF with multiple classes. It is also similar to CBQ because
  47    it allows to assign priority to each class in hierarchy.
  48    In fact it is another implementation of Floyd's formal sharing.
  49
  50    Levels:
  51    Each class is assigned level. Leaf has ALWAYS level 0 and root
  52    classes have level TC_HTB_MAXDEPTH-1. Interior nodes has level
  53    one less than their parent.
  54*/
  55
  56static int htb_hysteresis __read_mostly = 0; /* whether to use mode hysteresis for speedup */
  57#define HTB_VER 0x30011         /* major must be matched with number suplied by TC as version */
  58
  59#if HTB_VER >> 16 != TC_HTB_PROTOVER
  60#error "Mismatched sch_htb.c and pkt_sch.h"
  61#endif
  62
  63/* Module parameter and sysfs export */
  64module_param    (htb_hysteresis, int, 0640);
  65MODULE_PARM_DESC(htb_hysteresis, "Hysteresis mode, less CPU load, less accurate");
  66
  67/* used internaly to keep status of single class */
  68enum htb_cmode {
  69        HTB_CANT_SEND,          /* class can't send and can't borrow */
  70        HTB_MAY_BORROW,         /* class can't send but may borrow */
  71        HTB_CAN_SEND            /* class can send */
  72};
  73
  74/* interior & leaf nodes; props specific to leaves are marked L: */
  75struct htb_class {
  76        struct Qdisc_class_common common;
  77        /* general class parameters */
  78        struct gnet_stats_basic_packed bstats;
  79        struct gnet_stats_queue qstats;
  80        struct gnet_stats_rate_est rate_est;
  81        struct tc_htb_xstats xstats;    /* our special stats */
  82        int refcnt;             /* usage count of this class */
  83
  84        /* topology */
  85        int level;              /* our level (see above) */
  86        unsigned int children;
  87        struct htb_class *parent;       /* parent class */
  88
  89        int prio;               /* these two are used only by leaves... */
  90        int quantum;            /* but stored for parent-to-leaf return */
  91
  92        union {
  93                struct htb_class_leaf {
  94                        struct Qdisc *q;
  95                        int deficit[TC_HTB_MAXDEPTH];
  96                        struct list_head drop_list;
  97                } leaf;
  98                struct htb_class_inner {
  99                        struct rb_root feed[TC_HTB_NUMPRIO];    /* feed trees */
 100                        struct rb_node *ptr[TC_HTB_NUMPRIO];    /* current class ptr */
 101                        /* When class changes from state 1->2 and disconnects from
 102                         * parent's feed then we lost ptr value and start from the
 103                         * first child again. Here we store classid of the
 104                         * last valid ptr (used when ptr is NULL).
 105                         */
 106                        u32 last_ptr_id[TC_HTB_NUMPRIO];
 107                } inner;
 108        } un;
 109        struct rb_node node[TC_HTB_NUMPRIO];    /* node for self or feed tree */
 110        struct rb_node pq_node; /* node for event queue */
 111        psched_time_t pq_key;
 112
 113        int prio_activity;      /* for which prios are we active */
 114        enum htb_cmode cmode;   /* current mode of the class */
 115
 116        /* class attached filters */
 117        struct tcf_proto *filter_list;
 118        int filter_cnt;
 119
 120        /* token bucket parameters */
 121        struct qdisc_rate_table *rate;  /* rate table of the class itself */
 122        struct qdisc_rate_table *ceil;  /* ceiling rate (limits borrows too) */
 123        long buffer, cbuffer;   /* token bucket depth/rate */
 124        psched_tdiff_t mbuffer; /* max wait time */
 125        long tokens, ctokens;   /* current number of tokens */
 126        psched_time_t t_c;      /* checkpoint time */
 127};
 128
 129struct htb_sched {
 130        struct Qdisc_class_hash clhash;
 131        struct list_head drops[TC_HTB_NUMPRIO];/* active leaves (for drops) */
 132
 133        /* self list - roots of self generating tree */
 134        struct rb_root row[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
 135        int row_mask[TC_HTB_MAXDEPTH];
 136        struct rb_node *ptr[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
 137        u32 last_ptr_id[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
 138
 139        /* self wait list - roots of wait PQs per row */
 140        struct rb_root wait_pq[TC_HTB_MAXDEPTH];
 141
 142        /* time of nearest event per level (row) */
 143        psched_time_t near_ev_cache[TC_HTB_MAXDEPTH];
 144
 145        int defcls;             /* class where unclassified flows go to */
 146
 147        /* filters for qdisc itself */
 148        struct tcf_proto *filter_list;
 149
 150        int rate2quantum;       /* quant = rate / rate2quantum */
 151        psched_time_t now;      /* cached dequeue time */
 152        struct qdisc_watchdog watchdog;
 153
 154        /* non shaped skbs; let them go directly thru */
 155        struct sk_buff_head direct_queue;
 156        int direct_qlen;        /* max qlen of above */
 157
 158        long direct_pkts;
 159
 160#define HTB_WARN_TOOMANYEVENTS  0x1
 161        unsigned int warned;    /* only one warning */
 162        struct work_struct work;
 163};
 164
 165/* find class in global hash table using given handle */
 166static inline struct htb_class *htb_find(u32 handle, struct Qdisc *sch)
 167{
 168        struct htb_sched *q = qdisc_priv(sch);
 169        struct Qdisc_class_common *clc;
 170
 171        clc = qdisc_class_find(&q->clhash, handle);
 172        if (clc == NULL)
 173                return NULL;
 174        return container_of(clc, struct htb_class, common);
 175}
 176
 177/**
 178 * htb_classify - classify a packet into class
 179 *
 180 * It returns NULL if the packet should be dropped or -1 if the packet
 181 * should be passed directly thru. In all other cases leaf class is returned.
 182 * We allow direct class selection by classid in priority. The we examine
 183 * filters in qdisc and in inner nodes (if higher filter points to the inner
 184 * node). If we end up with classid MAJOR:0 we enqueue the skb into special
 185 * internal fifo (direct). These packets then go directly thru. If we still
 186 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessful
 187 * then finish and return direct queue.
 188 */
 189#define HTB_DIRECT ((struct htb_class *)-1L)
 190
 191static struct htb_class *htb_classify(struct sk_buff *skb, struct Qdisc *sch,
 192                                      int *qerr)
 193{
 194        struct htb_sched *q = qdisc_priv(sch);
 195        struct htb_class *cl;
 196        struct tcf_result res;
 197        struct tcf_proto *tcf;
 198        int result;
 199
 200        /* allow to select class by setting skb->priority to valid classid;
 201         * note that nfmark can be used too by attaching filter fw with no
 202         * rules in it
 203         */
 204        if (skb->priority == sch->handle)
 205                return HTB_DIRECT;      /* X:0 (direct flow) selected */
 206        cl = htb_find(skb->priority, sch);
 207        if (cl && cl->level == 0)
 208                return cl;
 209
 210        *qerr = NET_XMIT_SUCCESS | __NET_XMIT_BYPASS;
 211        tcf = q->filter_list;
 212        while (tcf && (result = tc_classify(skb, tcf, &res)) >= 0) {
 213#ifdef CONFIG_NET_CLS_ACT
 214                switch (result) {
 215                case TC_ACT_QUEUED:
 216                case TC_ACT_STOLEN:
 217                        *qerr = NET_XMIT_SUCCESS | __NET_XMIT_STOLEN;
 218                case TC_ACT_SHOT:
 219                        return NULL;
 220                }
 221#endif
 222                cl = (void *)res.class;
 223                if (!cl) {
 224                        if (res.classid == sch->handle)
 225                                return HTB_DIRECT;      /* X:0 (direct flow) */
 226                        cl = htb_find(res.classid, sch);
 227                        if (!cl)
 228                                break;  /* filter selected invalid classid */
 229                }
 230                if (!cl->level)
 231                        return cl;      /* we hit leaf; return it */
 232
 233                /* we have got inner class; apply inner filter chain */
 234                tcf = cl->filter_list;
 235        }
 236        /* classification failed; try to use default class */
 237        cl = htb_find(TC_H_MAKE(TC_H_MAJ(sch->handle), q->defcls), sch);
 238        if (!cl || cl->level)
 239                return HTB_DIRECT;      /* bad default .. this is safe bet */
 240        return cl;
 241}
 242
 243/**
 244 * htb_add_to_id_tree - adds class to the round robin list
 245 *
 246 * Routine adds class to the list (actually tree) sorted by classid.
 247 * Make sure that class is not already on such list for given prio.
 248 */
 249static void htb_add_to_id_tree(struct rb_root *root,
 250                               struct htb_class *cl, int prio)
 251{
 252        struct rb_node **p = &root->rb_node, *parent = NULL;
 253
 254        while (*p) {
 255                struct htb_class *c;
 256                parent = *p;
 257                c = rb_entry(parent, struct htb_class, node[prio]);
 258
 259                if (cl->common.classid > c->common.classid)
 260                        p = &parent->rb_right;
 261                else
 262                        p = &parent->rb_left;
 263        }
 264        rb_link_node(&cl->node[prio], parent, p);
 265        rb_insert_color(&cl->node[prio], root);
 266}
 267
 268/**
 269 * htb_add_to_wait_tree - adds class to the event queue with delay
 270 *
 271 * The class is added to priority event queue to indicate that class will
 272 * change its mode in cl->pq_key microseconds. Make sure that class is not
 273 * already in the queue.
 274 */
 275static void htb_add_to_wait_tree(struct htb_sched *q,
 276                                 struct htb_class *cl, long delay)
 277{
 278        struct rb_node **p = &q->wait_pq[cl->level].rb_node, *parent = NULL;
 279
 280        cl->pq_key = q->now + delay;
 281        if (cl->pq_key == q->now)
 282                cl->pq_key++;
 283
 284        /* update the nearest event cache */
 285        if (q->near_ev_cache[cl->level] > cl->pq_key)
 286                q->near_ev_cache[cl->level] = cl->pq_key;
 287
 288        while (*p) {
 289                struct htb_class *c;
 290                parent = *p;
 291                c = rb_entry(parent, struct htb_class, pq_node);
 292                if (cl->pq_key >= c->pq_key)
 293                        p = &parent->rb_right;
 294                else
 295                        p = &parent->rb_left;
 296        }
 297        rb_link_node(&cl->pq_node, parent, p);
 298        rb_insert_color(&cl->pq_node, &q->wait_pq[cl->level]);
 299}
 300
 301/**
 302 * htb_next_rb_node - finds next node in binary tree
 303 *
 304 * When we are past last key we return NULL.
 305 * Average complexity is 2 steps per call.
 306 */
 307static inline void htb_next_rb_node(struct rb_node **n)
 308{
 309        *n = rb_next(*n);
 310}
 311
 312/**
 313 * htb_add_class_to_row - add class to its row
 314 *
 315 * The class is added to row at priorities marked in mask.
 316 * It does nothing if mask == 0.
 317 */
 318static inline void htb_add_class_to_row(struct htb_sched *q,
 319                                        struct htb_class *cl, int mask)
 320{
 321        q->row_mask[cl->level] |= mask;
 322        while (mask) {
 323                int prio = ffz(~mask);
 324                mask &= ~(1 << prio);
 325                htb_add_to_id_tree(q->row[cl->level] + prio, cl, prio);
 326        }
 327}
 328
 329/* If this triggers, it is a bug in this code, but it need not be fatal */
 330static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root)
 331{
 332        if (RB_EMPTY_NODE(rb)) {
 333                WARN_ON(1);
 334        } else {
 335                rb_erase(rb, root);
 336                RB_CLEAR_NODE(rb);
 337        }
 338}
 339
 340
 341/**
 342 * htb_remove_class_from_row - removes class from its row
 343 *
 344 * The class is removed from row at priorities marked in mask.
 345 * It does nothing if mask == 0.
 346 */
 347static inline void htb_remove_class_from_row(struct htb_sched *q,
 348                                                 struct htb_class *cl, int mask)
 349{
 350        int m = 0;
 351
 352        while (mask) {
 353                int prio = ffz(~mask);
 354
 355                mask &= ~(1 << prio);
 356                if (q->ptr[cl->level][prio] == cl->node + prio)
 357                        htb_next_rb_node(q->ptr[cl->level] + prio);
 358
 359                htb_safe_rb_erase(cl->node + prio, q->row[cl->level] + prio);
 360                if (!q->row[cl->level][prio].rb_node)
 361                        m |= 1 << prio;
 362        }
 363        q->row_mask[cl->level] &= ~m;
 364}
 365
 366/**
 367 * htb_activate_prios - creates active classe's feed chain
 368 *
 369 * The class is connected to ancestors and/or appropriate rows
 370 * for priorities it is participating on. cl->cmode must be new
 371 * (activated) mode. It does nothing if cl->prio_activity == 0.
 372 */
 373static void htb_activate_prios(struct htb_sched *q, struct htb_class *cl)
 374{
 375        struct htb_class *p = cl->parent;
 376        long m, mask = cl->prio_activity;
 377
 378        while (cl->cmode == HTB_MAY_BORROW && p && mask) {
 379                m = mask;
 380                while (m) {
 381                        int prio = ffz(~m);
 382                        m &= ~(1 << prio);
 383
 384                        if (p->un.inner.feed[prio].rb_node)
 385                                /* parent already has its feed in use so that
 386                                 * reset bit in mask as parent is already ok
 387                                 */
 388                                mask &= ~(1 << prio);
 389
 390                        htb_add_to_id_tree(p->un.inner.feed + prio, cl, prio);
 391                }
 392                p->prio_activity |= mask;
 393                cl = p;
 394                p = cl->parent;
 395
 396        }
 397        if (cl->cmode == HTB_CAN_SEND && mask)
 398                htb_add_class_to_row(q, cl, mask);
 399}
 400
 401/**
 402 * htb_deactivate_prios - remove class from feed chain
 403 *
 404 * cl->cmode must represent old mode (before deactivation). It does
 405 * nothing if cl->prio_activity == 0. Class is removed from all feed
 406 * chains and rows.
 407 */
 408static void htb_deactivate_prios(struct htb_sched *q, struct htb_class *cl)
 409{
 410        struct htb_class *p = cl->parent;
 411        long m, mask = cl->prio_activity;
 412
 413        while (cl->cmode == HTB_MAY_BORROW && p && mask) {
 414                m = mask;
 415                mask = 0;
 416                while (m) {
 417                        int prio = ffz(~m);
 418                        m &= ~(1 << prio);
 419
 420                        if (p->un.inner.ptr[prio] == cl->node + prio) {
 421                                /* we are removing child which is pointed to from
 422                                 * parent feed - forget the pointer but remember
 423                                 * classid
 424                                 */
 425                                p->un.inner.last_ptr_id[prio] = cl->common.classid;
 426                                p->un.inner.ptr[prio] = NULL;
 427                        }
 428
 429                        htb_safe_rb_erase(cl->node + prio, p->un.inner.feed + prio);
 430
 431                        if (!p->un.inner.feed[prio].rb_node)
 432                                mask |= 1 << prio;
 433                }
 434
 435                p->prio_activity &= ~mask;
 436                cl = p;
 437                p = cl->parent;
 438
 439        }
 440        if (cl->cmode == HTB_CAN_SEND && mask)
 441                htb_remove_class_from_row(q, cl, mask);
 442}
 443
 444static inline long htb_lowater(const struct htb_class *cl)
 445{
 446        if (htb_hysteresis)
 447                return cl->cmode != HTB_CANT_SEND ? -cl->cbuffer : 0;
 448        else
 449                return 0;
 450}
 451static inline long htb_hiwater(const struct htb_class *cl)
 452{
 453        if (htb_hysteresis)
 454                return cl->cmode == HTB_CAN_SEND ? -cl->buffer : 0;
 455        else
 456                return 0;
 457}
 458
 459
 460/**
 461 * htb_class_mode - computes and returns current class mode
 462 *
 463 * It computes cl's mode at time cl->t_c+diff and returns it. If mode
 464 * is not HTB_CAN_SEND then cl->pq_key is updated to time difference
 465 * from now to time when cl will change its state.
 466 * Also it is worth to note that class mode doesn't change simply
 467 * at cl->{c,}tokens == 0 but there can rather be hysteresis of
 468 * 0 .. -cl->{c,}buffer range. It is meant to limit number of
 469 * mode transitions per time unit. The speed gain is about 1/6.
 470 */
 471static inline enum htb_cmode
 472htb_class_mode(struct htb_class *cl, long *diff)
 473{
 474        long toks;
 475
 476        if ((toks = (cl->ctokens + *diff)) < htb_lowater(cl)) {
 477                *diff = -toks;
 478                return HTB_CANT_SEND;
 479        }
 480
 481        if ((toks = (cl->tokens + *diff)) >= htb_hiwater(cl))
 482                return HTB_CAN_SEND;
 483
 484        *diff = -toks;
 485        return HTB_MAY_BORROW;
 486}
 487
 488/**
 489 * htb_change_class_mode - changes classe's mode
 490 *
 491 * This should be the only way how to change classe's mode under normal
 492 * cirsumstances. Routine will update feed lists linkage, change mode
 493 * and add class to the wait event queue if appropriate. New mode should
 494 * be different from old one and cl->pq_key has to be valid if changing
 495 * to mode other than HTB_CAN_SEND (see htb_add_to_wait_tree).
 496 */
 497static void
 498htb_change_class_mode(struct htb_sched *q, struct htb_class *cl, long *diff)
 499{
 500        enum htb_cmode new_mode = htb_class_mode(cl, diff);
 501
 502        if (new_mode == cl->cmode)
 503                return;
 504
 505        if (cl->prio_activity) {        /* not necessary: speed optimization */
 506                if (cl->cmode != HTB_CANT_SEND)
 507                        htb_deactivate_prios(q, cl);
 508                cl->cmode = new_mode;
 509                if (new_mode != HTB_CANT_SEND)
 510                        htb_activate_prios(q, cl);
 511        } else
 512                cl->cmode = new_mode;
 513}
 514
 515/**
 516 * htb_activate - inserts leaf cl into appropriate active feeds
 517 *
 518 * Routine learns (new) priority of leaf and activates feed chain
 519 * for the prio. It can be called on already active leaf safely.
 520 * It also adds leaf into droplist.
 521 */
 522static inline void htb_activate(struct htb_sched *q, struct htb_class *cl)
 523{
 524        WARN_ON(cl->level || !cl->un.leaf.q || !cl->un.leaf.q->q.qlen);
 525
 526        if (!cl->prio_activity) {
 527                cl->prio_activity = 1 << cl->prio;
 528                htb_activate_prios(q, cl);
 529                list_add_tail(&cl->un.leaf.drop_list,
 530                              q->drops + cl->prio);
 531        }
 532}
 533
 534/**
 535 * htb_deactivate - remove leaf cl from active feeds
 536 *
 537 * Make sure that leaf is active. In the other words it can't be called
 538 * with non-active leaf. It also removes class from the drop list.
 539 */
 540static inline void htb_deactivate(struct htb_sched *q, struct htb_class *cl)
 541{
 542        WARN_ON(!cl->prio_activity);
 543
 544        htb_deactivate_prios(q, cl);
 545        cl->prio_activity = 0;
 546        list_del_init(&cl->un.leaf.drop_list);
 547}
 548
 549static int htb_enqueue(struct sk_buff *skb, struct Qdisc *sch)
 550{
 551        int uninitialized_var(ret);
 552        struct htb_sched *q = qdisc_priv(sch);
 553        struct htb_class *cl = htb_classify(skb, sch, &ret);
 554
 555        if (cl == HTB_DIRECT) {
 556                /* enqueue to helper queue */
 557                if (q->direct_queue.qlen < q->direct_qlen) {
 558                        __skb_queue_tail(&q->direct_queue, skb);
 559                        q->direct_pkts++;
 560                } else {
 561                        return qdisc_drop(skb, sch);
 562                }
 563#ifdef CONFIG_NET_CLS_ACT
 564        } else if (!cl) {
 565                if (ret & __NET_XMIT_BYPASS)
 566                        sch->qstats.drops++;
 567                kfree_skb(skb);
 568                return ret;
 569#endif
 570        } else if ((ret = qdisc_enqueue(skb, cl->un.leaf.q)) != NET_XMIT_SUCCESS) {
 571                if (net_xmit_drop_count(ret)) {
 572                        sch->qstats.drops++;
 573                        cl->qstats.drops++;
 574                }
 575                return ret;
 576        } else {
 577                htb_activate(q, cl);
 578        }
 579
 580        sch->q.qlen++;
 581        return NET_XMIT_SUCCESS;
 582}
 583
 584static inline void htb_accnt_tokens(struct htb_class *cl, int bytes, long diff)
 585{
 586        long toks = diff + cl->tokens;
 587
 588        if (toks > cl->buffer)
 589                toks = cl->buffer;
 590        toks -= (long) qdisc_l2t(cl->rate, bytes);
 591        if (toks <= -cl->mbuffer)
 592                toks = 1 - cl->mbuffer;
 593
 594        cl->tokens = toks;
 595}
 596
 597static inline void htb_accnt_ctokens(struct htb_class *cl, int bytes, long diff)
 598{
 599        long toks = diff + cl->ctokens;
 600
 601        if (toks > cl->cbuffer)
 602                toks = cl->cbuffer;
 603        toks -= (long) qdisc_l2t(cl->ceil, bytes);
 604        if (toks <= -cl->mbuffer)
 605                toks = 1 - cl->mbuffer;
 606
 607        cl->ctokens = toks;
 608}
 609
 610/**
 611 * htb_charge_class - charges amount "bytes" to leaf and ancestors
 612 *
 613 * Routine assumes that packet "bytes" long was dequeued from leaf cl
 614 * borrowing from "level". It accounts bytes to ceil leaky bucket for
 615 * leaf and all ancestors and to rate bucket for ancestors at levels
 616 * "level" and higher. It also handles possible change of mode resulting
 617 * from the update. Note that mode can also increase here (MAY_BORROW to
 618 * CAN_SEND) because we can use more precise clock that event queue here.
 619 * In such case we remove class from event queue first.
 620 */
 621static void htb_charge_class(struct htb_sched *q, struct htb_class *cl,
 622                             int level, struct sk_buff *skb)
 623{
 624        int bytes = qdisc_pkt_len(skb);
 625        enum htb_cmode old_mode;
 626        long diff;
 627
 628        while (cl) {
 629                diff = psched_tdiff_bounded(q->now, cl->t_c, cl->mbuffer);
 630                if (cl->level >= level) {
 631                        if (cl->level == level)
 632                                cl->xstats.lends++;
 633                        htb_accnt_tokens(cl, bytes, diff);
 634                } else {
 635                        cl->xstats.borrows++;
 636                        cl->tokens += diff;     /* we moved t_c; update tokens */
 637                }
 638                htb_accnt_ctokens(cl, bytes, diff);
 639                cl->t_c = q->now;
 640
 641                old_mode = cl->cmode;
 642                diff = 0;
 643                htb_change_class_mode(q, cl, &diff);
 644                if (old_mode != cl->cmode) {
 645                        if (old_mode != HTB_CAN_SEND)
 646                                htb_safe_rb_erase(&cl->pq_node, q->wait_pq + cl->level);
 647                        if (cl->cmode != HTB_CAN_SEND)
 648                                htb_add_to_wait_tree(q, cl, diff);
 649                }
 650
 651                /* update basic stats except for leaves which are already updated */
 652                if (cl->level)
 653                        bstats_update(&cl->bstats, skb);
 654
 655                cl = cl->parent;
 656        }
 657}
 658
 659/**
 660 * htb_do_events - make mode changes to classes at the level
 661 *
 662 * Scans event queue for pending events and applies them. Returns time of
 663 * next pending event (0 for no event in pq, q->now for too many events).
 664 * Note: Applied are events whose have cl->pq_key <= q->now.
 665 */
 666static psched_time_t htb_do_events(struct htb_sched *q, int level,
 667                                   unsigned long start)
 668{
 669        /* don't run for longer than 2 jiffies; 2 is used instead of
 670         * 1 to simplify things when jiffy is going to be incremented
 671         * too soon
 672         */
 673        unsigned long stop_at = start + 2;
 674        while (time_before(jiffies, stop_at)) {
 675                struct htb_class *cl;
 676                long diff;
 677                struct rb_node *p = rb_first(&q->wait_pq[level]);
 678
 679                if (!p)
 680                        return 0;
 681
 682                cl = rb_entry(p, struct htb_class, pq_node);
 683                if (cl->pq_key > q->now)
 684                        return cl->pq_key;
 685
 686                htb_safe_rb_erase(p, q->wait_pq + level);
 687                diff = psched_tdiff_bounded(q->now, cl->t_c, cl->mbuffer);
 688                htb_change_class_mode(q, cl, &diff);
tok6> 58969"> 589                if (cl->cmode != HTB_CAN_SEND)
 680                        htb_add_to_wait_tree(q, cl, diff);
 591   7}
 59}
 603        
 604       !d(q->TOOMANYEVENTUCCESS" class="sref"ref">TOOMANYEVENTUop_at)) {
 655                 686                q->TOOMANYEVENTUCCESS" class="sref"ref">TOOMANYEVENTUop_a);
 678
 599        return q->no);
 607}
 681
 672 &id. NULL   */
 663 664 606st     struct rb_node * *_uppmbuffer" class="sref"id_find_"> *_uppmb_tree/a>, int p, struct rb_node * 646                           /a>                 632      60a>)) {
 688   /a>, struct rb_node * 599        while ( 680                struct htb_class *cl<>)) {
 631               a> = rb_entry(htb_class, rb_nodq[l]);
 59}
 683                if (cl->cs.)) {
 684                   ( 655                } else if (cl->cs.)) {
 636                         667                   ( 688                } else {
 559                        return  560            /a>);
 591   7}
 622        return  627}
 654
 665/**
 616 * -      rst"> * from lean evenDRR ordeet for
 617 618p feed po/a>ers po/a>hangt;now.
 619 636st     struct htb_class * *class" class="sref"lookup_"> *entry/a>, struct pspan>
 631                                    /a>, struct rb_node< * 632*, int  63else {
 633   /a>, int  634   /a>, stelse {
 635           /a>, struct rb_node * 636           /a>, struct rb_node< * 637           /a>,  632* int  638   }, l,f *p =  609
 590        rb_nod]);
 641   /a> *l->rb_nod/a>]);
 642   /a> *l-> 643   /a> *l-> 654
 645    rune if ( 646               ! *l->l-> 647                   2 618 619 680                    *l-> 651                       2a> * *_uppmbuffer" class="sref"id_find_"> *_uppmb_tree int p *l->l-> 652           7}
 653            *l->,ongit   */
 664 665 646               ! *l->/hich k eigh_ end; e wind  &go upe*    */
 647                    *l->l-> 648                        wh( *l-> 559                            *l->l-> 680                   else if (p >  631                           /a> *l-);
 632                               ! *l-> 653                                   /a> *ONunded" class="sref">ON_tree1D);
 684                                        return  645                           7}
 646                                 *_cb_e=rb_node" class="scode"> *_cb_e=rb_tree int l-> 667                   7}
 688                } else {
 559                        struct htb_class *cl;
 680                        cl = rb_entry *l->htb_class, rb_nodq[l]);
 631                        if (!cl->level)
 632                                return c/a>]);
 653                   (++/a> *Dl->cl->cs.cs.ls.rb_nod/a>]);
 684                   (l->cl->cs.cs./a>]);
 675                   (l->cl->cs.cs. + /a>]);
 676           7}
 688   /a> *ONunded" class="sref">ON_tree1D);
 599        return  607}
 681
 672; c andonly      */
 663 664 606st     struct sk_buff *(struct htb_sched *q, int pspan>
 686                                   /a>, int level)
 60a>)) {
 688   /a>, struct sk_buff *skf = tok7> 58979"> 589   /a>, struct htb_class *clf *star);
 680   2 641   /a> *start = ct =  *class" class="sref"lookup_"> *entry/a> *l->noq[levelf + s, pspan>
 632                           a>   /a> *l->levelf + sspan>
 653                                /a> *l->[levelf + D);
 654
 655   do else {
 68/a>,  667           else if (c)l)
 648                        return  609
 680           2 *en */
 671            * qdisc drops pate b evenenvent qroutss=  (0elssomeone 2 isen */
 672            * graft oper/a>ondones at talssincat r"ttdevent ;en */
 663            * 1 to ytdeacti * upentsskip * In >htb_cl */
 664            *    */
 675           else if (cl->cs. *class" class="s"> *entrs.l->s.ct<= 0t)) {
 646                   /a>, struct htb_class * 667                   ( *q, cD);
 678
 559                   2 680                   elsey/a> *l->levelf &(1s < D)t<= 0tspan>
 631                                return  59}
 683                   ( *class" class="sref"lookup_"> *entry/a> *l->noq[levelf + s}
 684                                      (s, l->levelf + sspan>
 655                                      (l->[levelf + D);
 63/a>);
 667                        if (ct<= /a> *star)        <    we ju"ttdele updite*    */
 688                           (start =  559                   a> = ct =  560                   goto/a> =  631           7}
 59}
 683           /a> *skf = cl->cs. *class" class="s"> *entrs.l->cl->cs. *class" class="s"> *entrs.D);
 684                if (skf !=  655                   break);
 63/a>);
 637           /a>, cl->cs. *class" class="s"> *entrs.D);
 688                 *_cb_e=rb_node" class="scode"> *_cb_e=rb_tree  if (leve ?eturn cl->punded" class="sraf">pf">cl->cs.cs.l/a>);
 559                             (D);
 680           2> = ct =  *class" class="sref"lookup_"> *entry/a> *l->noq[levelf + s, sspan>
 631                                /a>, l->levelf + sspan>
 632                           a>   /a> *l->[levelf + D);
 63/a>);
 634   }      while (ct != star));
 685
 636        if (skf !=  637           /a>, cl->s, sk));
 688                cl->cs. *class" class="s"> *entrs.levelf-/a> != sk));
 589                if (cl->cs. *class" class="s"> *entrs.levelf 0l/a>)) {
 680                        cl->cs. *class" class="s"> *entrs.levelf+ = cl-> 631                         *_cb_e=rb_node" class="scode"> *_cb_e=rb_tree  if (leve ?eturn cl->punded" class="sraf">pf">cl->cs.cs.l/a>);
 632                           a>             D);
 683           7}
 684                 665 616 647                if (!cl->cs. *class" class="s"> *entrs.l->s.cl)
 688                         *q, cD);
 589                 *q, cq, leves, sk));
 680   7}
 651        return sk);
 657}
 63/a>);
 666st     struct sk_buff *cl)
 66a>)) {
 646   /a>, struct sk_buff *sk);
 647   (struct htb_sched *t = cl);
 648   /a>, int leve);
 559   a> +  559a> +  *_ef">punded" class="s"> *_ef">pleve);
 680   unsignisslonga> != _a=leve);
 681
 632         643   /a> *skf = , &l->cl);
 684   else if (skf !=  64> !=  646           a> = cs, sk));
 667           a> = cl);
 688           a> = cl->s.cl-);
 559                return sk);
 680   7}
 681
 632        if (!cl->s.cl)
 653           goto/a> = sk);
 684   &l->nof = );
 675   > != _a=levef = sk);
 63/a>);
 *_ef">punded" class="s"> *_ef">plevet = l->nof+ 52*, int sk);
 678
 599    rune if (leve , int leve  < >, int leve++)) {
 680           2p handlerpquicklye*    */
 631           /a>, int  632           a> +  559a> + punded" class="sef">pleve);
 63/a>);
 684                if (l->nof = l->ar_ef_canetclasq[level)) {
 675                   (punded" class="sef">plevet = p__tree" class="sref"do_ef">p_entry/a> *q, leves, _a=level);
 686                        if (!punded" class="sef">plevel)
 667                           (punded" class="sef">plevet = l->nof+  int sk);
 688                        l->ar_ef_canetclasq[levelt = punded" class="sef">pleve);
tok8> 58988"> 559                }/a>);
 680                        punded" class="sef">plevet = l->ar_ef_canetclasq[level);
 681
 632                if ( *_ef">punded" class="s"> *_ef">plevet > punded" class="sef">plevel)
 653                   a> +  *_ef">punded" class="s"> *_ef">plevet = punded" class="sef">pleve);
 654
 675            int l->level);
 686                while ( 667                    a>, int t =  678
 559                   a> = );
 680                   a> = skf =  *q, s, level);
 631                       /a>, skf !=  632                           goto/a> =  683           7}
 634   }}
 675   > != cl->s. 636        if ( *_ef">punded" class="s"> *_ef">plevet > l->no)l)
 667           a> = htb_ulu_tree" class="scdisc_watchdog">htb_uluentry/a>, &l->s,  *_ef">punded" class="s"> *_ef">plevel);
 688      }/a>);
 559           > != l-> 68a> = sk:lse {
 651        return sk);
 657}
 63/a>);
 664 606stunsigniss a>, int cl)
 63a>)) {
 647   (struct htb_sched *t = cl);
 648   /a>, int );
 609
 560    rune if (t = t- 1> < f, int --l/a>)) {
 631           (struct );
 632           a> + s, l->nof+  int D/a>)) {
 683           7   (struct  *ct = s, struct htb_class>)) {
 684                                                     ruct cs. *class" class="s"> *entrs.cl);
 655                   unsigniss a>, int c);
 686                       /a> *cl->cs. *class" class="s"> *entrs.l->nol->f, , /a>);
 637                       e if (cf = cl->cs. *class" class="s"> *entrs.l->nol-> /a> *cl->cs. *class" class="s"> *entrs.))l/a>)) {
 688                           ruct cl->s.cl-);
 559                                if (!cl->cs. *class" class="s"> *entrs.l->s.cl)
 680                                   ruct  *q, cD);
 631                                return c);
 632                   7}
 683           7}
 634   }}
 655        re0);
 63}}
 63}
 682 582 686stvoid ruct cl)
 63a>)) {
 632   (struct htb_sched *t = cl);
 683   (struct  *c);
 684   (struct c);
 655   unsigniss a>, int c);
 63/a>);
 647    rune if (c , int c  < l->s.c<, int c++)) {
 688           ruct  /a> *cs, c, /a>, &l->s.q[c]q, s. 589                       /a> *cl->level>)) {
 680                           -> /a>, &cl->cs.c, 0, sizbof /a> *cl->cs.c)l);
 631                      }/a>)) {
 632                               /a> *cl->cs. *class" class="s"> *entrs.l>)) {
 683           7                   -> /a> *cl->cs. *class" class="s"> *entrs.));
 684                           . /a>, &cl->cs. *class" class="s"> *entrs.cl);
 655                   }}
 686                   &cl->c }
 667                   (cl->t = c);
 678
 559            8
 680   7}
 631   -> /a>, &l->l);
 632    > /a>, &l->cl);
 643   /a> *cl->s.c }
 684   -> &l->no, 0, sizbof /a> *l->no)l);
 675   > !=  &l->l-> 646   > !=  &l->l-> &l->l-> 688    rune if (c , int c  < <, int c++);
 559           . &l->nof+  int cl);
 687}
 681
 636stconst (struct nofruct q[nof+ 1lt)) {
 653   q[c]t.kt_len" class="slekf">cf(struct  684   q[c]tt.kt_len" class="slekf">cf(struct  675   q[c]tt.t = kt_len" class="slekf">cfcf}s>)) {
c]tt.t = kt_len" class="slekf">cfcf}s>)) {
 678
 596stvoid ruct  (struct cf * 68a>)) {
 631   (struct htb_sched *t =  &htb_scheq,  632   (struct ct = l->s. 63/a>);
 684   ->htb_ulu_tree" class="s__refif">htb_uluef"> & &cll);
 677}
 63/a>);
 666st a>, int  (struct cs, struct  68a>)) {
tok9> 58998"> 559   (struct htb_sched *t = cl);
 680   /a>, struct q[cf+ 1l);
 631   (struct  632    a>, int  653    a>, int c);
 654
 675        if (! 686                re-if (!c);
 63}
 688    int q, cq, l);
 559       /a> *10.c> 686                re int a>);
 681
 632       /a> *q[c] =/a> !=  683           ->"ref: hey rrobably you have bad tc tool ?\n"   */);
 684                re-if (!c);
 675   7}
 646   > != q[c]l);
_buff" class="sversio>> 632 !=  16)/a>)) {
 688           ruct "ref: needetc//sc versio> %d (minor is %d), you have %d\n"   */)) {
 589                  > !=  16q,  &0xffffq, _buff" class="sversio>> 63l);
c);
 643   /a> *, &l->l);
 684   else if ( 655                re int  646    rune if (c , int c  < <, int c++);
 667           a> =  &l->nof+  int cl);
 678
 559   a> + , &l->s, cl);
l->l);
 631   ->, &l->cl);
 643   /a> *l->kt_len" class="sdire(s_v">kschet = cll->kt_len" class="stx"vent _">ksche);
 684   else if (l->kt_len" class="sdire(s_v">kschet 2) 2ke*    */
 675            int l->kt_len" class="sdire(s_v">kschet);
 63/a>);
l-> 688           ruct l-> 559   a> + l-> 651        rea>}
 657}
 63/a>);
 686st a>, int (struct cs, struct sk);
 67a>)) {
 646   > != cl>}
 647   (struct htb_sched *t = cl);
 559   (struct  631   -> 643   /a> *t = l->);
 684   ->_buff" class="sversio>> 632/a> != );
 675   > != l-> 646   > != l->c /a>);
 678
 559   a> + skq,  631           goto/a> =  632       /a> *skq, cq * 683           goto/a> =  684   ->skq,  646   > != skl->c);
 678
 582> =  631   ->skq,  654
 606st a>, int (struct cscs4
 686                     (struct sks, struct  *ct(struct c);
 559   a> + cl>}
 631   (struct  643   /a> * 684   -> = cl-> = cl->->s. 675   > != cl->s.);
 686        if (!cl->levef, , /a> = cl->cs. *class" class="s"> *entrs.l>)) {
 667           a> = cl->cs. *class" class="s"> *entrs.l-> 678
 559   a> + skq,  631           goto/a> =  643   /a> * /a>, & 654
 675   > != cl-> 646   > != cl->cl-> 688    int cl->tok10e=t>10d"> 559   a> + cl->cl-> 631   ->levef = cl->leve);
 632       /a> *skq, c, sizbof /a> * 683           goto/a> =  654
 675   > != skq,  646   > != skl->c);
 678
 582> = 110=> 646   > !=  631   ->skq,  654
 606st a>4
 64->(struct cscs (struct  * *ct(struct c);
 58/a>);
cl->levef, , /a> = cl->cs. *class" class="s"> *entrs. 631           a> = cl->c  = cl->cs. *class" class="s"> *entrs.s.c);
 632    >cl->c  = cl->c);
 643   /a> *cl->c  = cl->c);
 654
 655       /a> * = cl-> 686       /a> * = cl-> 667       /a> * = cl-> 688                re-1);
 58/a>);
 = cl->cl-> 637}
 646st a>, int (struct cscs (struct cs1
 684                (struct  67a>)) {
 686   (struct  *ct(struct c);
 63}
 688       /a> *cl->leve)/a>);
 589                re-if (!c);
ct !=  631       e if (ct = cl->cs1
cl->s. !=  683                re-if (!c);
 654
 675   > != cl);
 646    *cl->cs. *class" class="s"> *entrs.cl->cs. *class" class="s"> *entrs.c);
 688        * 589           a> = kt_len" class="scdisc_tree_defre*se_v">kentry *s.cl);
 631   7}
 632    >cl);
 643        rea>}
 687}
 646st(struct  *class" class="sref""> *entry(struct csc)/a>);
 *ct(struct c);
 559        re if (!cl->levef?/a> = cl->cs. *class" class="s"> *entrs. 681
 636stvoidtruct csc)/a>);
 68a>)) {
 684   (struct  *ct(struct c);
 686       a> = cl->cs. *class" class="s"> *entrs.s.ct);
 667           a> =  = cl, a> = cl);
 677}
 58/a>);
(struct cs<->);
 63a>)) {
 *ct, cl);
c)/a>);
 684           a> = cl->c++);
 675        re(unsignisslong)ruct c);
 687}
 63}
(struct  *c)/a>);
 55a>)) {
cl->);
 631           acl->-> 684           a
 675                rea>}
 686        re1);
 667}
 678
 556stvoidtruct  *class" class="sref"par"co_to""> *entry(struct  *s (struct  *cs1
 63a>)) {
 * = cl->);
 63/a>);
 684   ->cl->levef||e if (!cl->cs. *class" class="s"> *entrs.cl->cl);
 686       a> = -> 686 != );
 667           a> = , &->, ->leve));
 678
tok11e=t>11d"> 559   a> + ->leve /a>);
 /a>, &->cs.->cs. 631   -> /a>, &->cs. *class" class="s"> *entrs. 632    >->cs. *class" class="s"> *entrs. 683    >->c  = -> 684   ->->c  = -> 675   > != ->c  =  ));
 646   > != -> 686/a> != );
 667}
 678
 556stvoidtruct (struct cs<(struct  *c)/a>);
120=> 64a>)) {
 631   else if (!cl->leve)/a>)) {
cl->cs. *class" class="s"> *entrs. 683           .cl->cs. *class" class="s"> *entrs. 684   7}
 675   > !=  /a>, &cl->cl-> 646   > != cl->cl-> 678
 559   a> +  /a>, &cl->c));
 637}
 646stvoidtruct (struct c)/a>);
 65a>)) {
 655   (struct  *t = cl);
 686   (struct  * 667   (struct  *c);
 688   unsigniss a>, int c);
 58/a>);
 /a>, &cl);
 631   -> /a>, &cl);
 632    
 64  68  67  68  /a>, & 678
 589   for  a> = c , int ct &c<, int c++)/a>)) {
 = cq, c], a> = s.);
 631       >           a> =  /a>, &cl-> 683   for  a> = c , int ct &c<, int c++)/a>)) {
 684           a> =  = cq, c],>)) {
 675                                     a> = s.);
 686       >           a> =  *cs = c));
 688   -> /a>, & 559   a> +  /a>, & 681
 636st a>, int (struct csc)/a>);
 68a>)) {
 684   (struct  *t = cl);
 655   (struct  *ct(struct c);
 686   unsigniss a>, int c);
 667   (struct /a>);
 58/a>);


 632    cl->cl->c)/a>);
 684                re-if (! 686        if (!cl->levef, , /a> =  = c))/a>)) {
 667           a> = cl->cs1
 688                                     if (!cl->->s.);
 589           a> = );
 681
 632    >cl);
 63/a>);
 684   else if (!cl->leve)/a>)) {
 675            int c  = cl->cs. *class" class="s"> *entrs.s.c);
 686       >   a> = cl->cs. *class" class="s"> *entrs. 667           a> = kt_len" class="scdisc_tree_defre*se_v">kentrya> = cl->cs. *class" class="s"> *entrs.cl);
 58/a>);

 631   -> /a>, &cl->l);
cl->);
 683           .cl->-> 654
 675       a> = cl->cl4
 686       >   a> =  = c));
 63}
 688       /a> *cl-> 686 != );
 589           a> = , &cl->, cl->leve));
 631   elsea> = );
 *class" class="sref"par"co_to""> *entrya> = c, /a> * 63/a>);
 684   ->cl->ct);
 675   > 68  66  67 tok12e=t>128"> 58/a>);
cl);
 631        rea>}
 637}
 63/a>);
 686stvoidtruct (struct csc)/a>);
 67a>)) {
 686   (struct  *ct(struct c);
 63}
 688       --if (!cl->ct}
 589           a> =  *cs = c));
130=> 687}
 681
 636st a>, int (struct cs<->
 683           >           a> = cs<(struct  684                       unsignisslongt *c)/a>);
 67a>)) {
 646    a>, int ctc);
 667   (struct  *t = cl);
 *ct(struct  *c,  *);
 559   (struct t = );
 63/a>);
 684   - 675        if (!)/a>);
 686       >   gototruct  63}
 688   ->ct = s<->cl);
ct 0<}
 681
 632    >ctc);
 =  684           gototruct  646   > !=  = ct = ct?/a> =  = cs = cl);
 63}
 688   -> = );
 58/a>);
);
 631   ->);
 683           gototruct  654
 675        if (!c) {/a>           - 686       >   (struct  667            a>, int  688           (sta>)) {
 589               >   (struct );
 631       >   }  > 683           >               s. *))s1
 684                           s. 684  /aa> =  675               >   }s1
 686       >           s.t)) {
 667                           - 688                           s. 589               >           s. 631       >   });
 683           < 684                if (! =  = cl->c) ||span>
 675               -> =  = cl<}
 686       >           gototruct  63}
 688           < 589               a> = , , /a> = ->, , /a> = ->->levef 2)/a>)) {
"htb: tree is too deep\n"   */);
 631       >           gototruct  683           .ct);
 684           if (!c /aa> = c)s = cl);
 675                if (!c)/a>);
 686       >           gototruct  63}
 688           .ctcl->cl-> 589               >                   .cls1
 631       >       ->c)/a>)) {
c));
 683                   gototruct  684           7}
 686       >   a> = cl->ct);
 667           a> = cl-> 688           .cl->cs. *class" class="s"> *entrs.c));
 589           a> = cl->);
 631       >   for  a> = cl-> 63/a>);
 684           i * cdisc early becausi it usis kmalloc(GFP_KERNEL)   */
 67  68  66  688           .cl->tok13e=t>138"> 589               >                     /a>, &cs4.);
cl);
 631       >       ->, , / if (!->leve)/a>)) {
c  = ->cs. *class" class="s"> *entrs.s.c);
 63/a>);
 684                   ios aner nf=" *    */
 675               >   .->cs. *class" class="s"> *entrs. 686       >           a> = kt_len" class="scdisc_tree_defre*se_v">kentrya> = ->cs. *class" class="s"> *entrs.cl);
 667                   a> =  a> = ->cs. *class" class="s"> *entrs. 688                       ->->cl4
 589                           a> =  = );
140=> 68/a>);
 631       >           i hhange *    */
-> 686 != )) {
 683           >               a> = , &->,  684                           a> = -> 686/a> != );
 675               >   }/a>);
 686       >           a> = ->levef=  ->-> = ->->leve/a>);
 667                                    :<-> 688                   ->->cs.->cs. 589           }/a>);
 * (we) needs ele="coary cdisc *    */
 631       >   &cl->cs. *class" class="s"> *entrs.t =  683           .cl->s. = );
 684           iamp;cl-> = );
 686       >   a
 667           a> = cl-> 688           .cl-> 589           a> = cl->
cl->);
 631       >   &cl-> 686/a> != );
 683           <
 684           a> = , &cl->l);
 675               /a>, );
 686       >           a> = -> 667   } else/a>)) {
 688               a> =  589                    int ctcl->cl->cls1
 631       >                           >           a> = c)/a>);
 683                                re->c);
 684           7}
 675           a> = cl);
 686   7}
 63}
 688   <
 58  * before hhanging cllun."> * !sc */

 631        if (!cl->leve)/a>)) {
cl->ctc);
 683                if (!ct, , /a> = cl->ct 1000)/a>)) {
 684                   a> =  675               >      <"HTB: cuantum of span  %Xtis small. Consider r2q hhange.\n"   */
 686       >                  if (!cl->s.);
 667                   if (!cl->ct);
 688           7}
 589                if (!ct, , /a> = cl->ct 200000)/a>)) {
 631       >              >   a"HTB: cuantum of span  %Xtis big. Consider r2q hhange.\n"   */
cl->s.);
 683                   if (!cl->ct);
 684           7}
 675               ->c)/a>);
 686       >           if (!cl->ctc);
 667               ya> = cl-> 688                   if (!cl-> 589   7}
 631   &cl->cl->cl-> 684           if (!cl-> 675   a> = cl-> 686       a> = cl-> 667           a> = cl-> 688   ->cl-> 589   a> = cl);
 631   & = c, /a>, & 683    *c);
 684        re0);
 68-> 667       a> =  688           . 589       a> =  631        re->c);
 63/a>);
 686(struct (struct c, unsignisslongtruct  67a>)) {
 686   (struct  *t = cl);
 *c /ay(struct  688   (struct c ? /a>, &cl->c : /a>, &c);
tok14e=t>148"> 58/a>);
 637}
 636(struct c, unsignisslongtruct 
 684                   a>           a> = 
 67a>)) {
 686   (struct  *c /a/a> * =  = cl);
 63}
 688   <)      re0<   */
 58 
150=> 68  ves. But at "> st tc_in/ex filter usis this just to g b
 63 
 68  68  67  68  667       a> = c)/a>);
 688           &cl->c++);
 589        re(unsignisslong)->c);
 63}
(struct c, unsignisslongtruct  68a>)) {
 684   (struct  *c /ay(struct  686       a> = c<}
 667           a> = cl->c--);
 687}
 58/a>);
(struct c, (struct  63a>)) {
 *t = cl);
 683   (struct  *c);
 684   (struct  *c);
 675   unsigniss a>, int c);
 68/a>);
 667       a> =  688                r);
 58/a>);
c , int c  &c<, int c++)/a>)) {
 631       >   ruct cs = c, /a>, &c]s4.s.)) {
c  & 683                           ->c++);
 684                           continue);
 675                   7}
 686       >               ->_buff" class="sfkentrya> = c, (unsignisslong)->cs4. 667                           a> =  688                                r);
 589                   7}
c++);
 631       >   7}
 687}
 68}
 676(struct  684.)) {
 686   s.
 667   s. *class" class="s"> *entr 1     =   >   a> =  *class" class="shef""> *sches1
 688   s.
 589   s.

 631   s.

 683   s.
 684   s.
 675   s.
 686   s.
 667   s.
 688   s. 686=   >   a> = 
 58});
 636(struct  684.
 683   s."/sc"   */
 684   s.
 675   s.
 686   s.
 667   s.
 688   s.
 589   s.

 631   s.

 683   s. 68});
 686, int  = }
 66a>)) {
 688        re-> 68l);
 587}
 = }
 63a>)) {
 68l);
 687}
 68}
 67& = }
 68-> = }
"GPL"   */);
 68


The original LXR software by the a>); LXR css=unioysches this experi="coal version by a>); lxr@assux.nosche.
lxr.assux.no kindly hosted by a>); Redpill Lsspro ASsches provider of Lssux consulting and oper/aions services since 1995.