/* topology */
        int level;              /* our level (see above) */
+       unsigned int children;
        struct htb_class *parent;       /* parent class */
-       struct list_head sibling;       /* sibling list item */
-       struct list_head children;      /* children list */
 
        union {
                struct htb_class_leaf {
 }
 
 struct htb_sched {
-       struct list_head root;  /* root classes list */
        struct Qdisc_class_hash clhash;
        struct list_head drops[TC_HTB_NUMPRIO];/* active leaves (for drops) */
 
                return -EINVAL;
        }
 
-       INIT_LIST_HEAD(&q->root);
        err = qdisc_class_hash_init(&q->clhash);
        if (err < 0)
                return err;
        if (!cl->parent)
                /* the root class */
                return 0;
-
-       if (!(cl->parent->children.next == &cl->sibling &&
-               cl->parent->children.prev == &cl->sibling))
+       if (cl->parent->children > 1)
                /* not the last child */
                return 0;
-
        return 1;
 }
 
        // TODO: why don't allow to delete subtree ? references ? does
        // tc subsys quarantee us that in htb_destroy it holds no class
        // refs so that we can remove children safely there ?
-       if (!list_empty(&cl->children) || cl->filter_cnt)
+       if (cl->children || cl->filter_cnt)
                return -EBUSY;
 
        if (!cl->level && htb_parent_last_child(cl)) {
 
        /* delete from hash and active; remainder in destroy_class */
        qdisc_class_hash_remove(&q->clhash, &cl->common);
-       list_del(&cl->sibling);
+       cl->parent->children--;
 
        if (cl->prio_activity)
                htb_deactivate(q, cl);
                                  &sch->dev->queue_lock,
                                  tca[TCA_RATE] ? : &est.nla);
                cl->refcnt = 1;
-               INIT_LIST_HEAD(&cl->sibling);
-               INIT_LIST_HEAD(&cl->children);
+               cl->children = 0;
                INIT_LIST_HEAD(&cl->un.leaf.drop_list);
                RB_CLEAR_NODE(&cl->pq_node);
 
 
                /* attach to the hash list and parent's family */
                qdisc_class_hash_insert(&q->clhash, &cl->common);
-               list_add_tail(&cl->sibling,
-                             parent ? &parent->children : &q->root);
+               if (parent)
+                       parent->children++;
        } else {
                if (tca[TCA_RATE])
                        gen_replace_estimator(&cl->bstats, &cl->rate_est,