Lines Matching defs:leaf
88 /* interior & leaf nodes; props specific to leaves are marked L: */
119 } leaf;
151 int prio; /* For parent to leaf return possible here */
153 /* of un.leaf originals should be done. */
241 * should be passed directly thru. In all other cases leaf class is returned.
246 * have no valid leaf we try to use MAJOR:default leaf. It still unsuccessfull
294 return cl; /* we hit leaf; return it */
575 * htb_activate - inserts leaf cl into appropriate active feeds
577 * Routine learns (new) priority of leaf and activates feed chain
578 * for the prio. It can be called on already active leaf safely.
579 * It also adds leaf into droplist.
583 BUG_TRAP(!cl->level && cl->un.leaf.q && cl->un.leaf.q->q.qlen);
586 cl->prio_activity = 1 << (cl->un.leaf.aprio = cl->un.leaf.prio);
588 list_add_tail(&cl->un.leaf.drop_list,
589 q->drops + cl->un.leaf.aprio);
594 * htb_deactivate - remove leaf cl from active feeds
596 * Make sure that leaf is active. In the other words it can't be called
597 * with non-active leaf. It also removes class from the drop list.
605 list_del_init(&cl->un.leaf.drop_list);
631 } else if (cl->un.leaf.q->enqueue(skb, cl->un.leaf.q) !=
667 } else if (cl->un.leaf.q->ops->requeue(skb, cl->un.leaf.q) !=
709 * htb_charge_class - charges amount "bytes" to leaf and ancestors
711 * Routine assumes that packet "bytes" long was dequeued from leaf cl
713 * leaf and all ancestors and to rate bucket for ancestors at levels
825 * htb_lookup_leaf - returns next leaf class in DRR order
827 * Find leaf where current feed pointers points to.
896 /* class can be empty - it is unlikely but can be true if leaf
898 graft operation on the leaf since last dequeue;
900 if (unlikely(cl->un.leaf.q->q.qlen == 0)) {
918 skb = cl->un.leaf.q->dequeue(cl->un.leaf.q);
937 if ((cl->un.leaf.deficit[level] -= skb->len) < 0) {
938 cl->un.leaf.deficit[level] += cl->un.leaf.quantum;
944 if (!cl->un.leaf.q->q.qlen)
1016 un.leaf.drop_list);
1018 if (cl->un.leaf.q->ops->drop &&
1019 (len = cl->un.leaf.q->ops->drop(cl->un.leaf.q))) {
1021 if (!cl->un.leaf.q->q.qlen)
1045 if (cl->un.leaf.q)
1046 qdisc_reset(cl->un.leaf.q);
1047 INIT_LIST_HEAD(&cl->un.leaf.drop_list);
1148 if (!cl->level && cl->un.leaf.q)
1149 tcm->tcm_info = cl->un.leaf.q->handle;
1160 opt.quantum = cl->un.leaf.quantum;
1161 opt.prio = cl->un.leaf.prio;
1183 if (!cl->level && cl->un.leaf.q)
1184 cl->qstats.qlen = cl->un.leaf.q->q.qlen;
1208 if ((*old = xchg(&cl->un.leaf.q, new)) != NULL) {
1221 return (cl && !cl->level) ? cl->un.leaf.q : NULL;
1228 if (cl->un.leaf.q->q.qlen == 0)
1258 BUG_TRAP(!cl->level && cl->un.leaf.q && !cl->prio_activity);
1262 INIT_LIST_HEAD(&parent->un.leaf.drop_list);
1263 parent->un.leaf.q = new_q ? new_q : &noop_qdisc;
1264 parent->un.leaf.quantum = parent->quantum;
1265 parent->un.leaf.prio = parent->prio;
1277 BUG_TRAP(cl->un.leaf.q);
1278 qdisc_destroy(cl->un.leaf.q);
1347 qlen = cl->un.leaf.q->q.qlen;
1348 qdisc_reset(cl->un.leaf.q);
1349 qdisc_tree_decrease_qlen(cl->un.leaf.q, qlen);
1425 INIT_LIST_HEAD(&cl->un.leaf.drop_list);
1431 /* create leaf qdisc early because it uses kmalloc(GFP_KERNEL)
1437 unsigned int qlen = parent->un.leaf.q->q.qlen;
1440 qdisc_reset(parent->un.leaf.q);
1441 qdisc_tree_decrease_qlen(parent->un.leaf.q, qlen);
1442 qdisc_destroy(parent->un.leaf.q);
1455 /* leaf (we) needs elementary qdisc */
1456 cl->un.leaf.q = new_q ? new_q : &noop_qdisc;
1476 is really leaf before changing cl->un.leaf ! */
1478 cl->un.leaf.quantum = rtab->rate.rate / q->rate2quantum;
1479 if (!hopt->quantum && cl->un.leaf.quantum < 1000) {
1483 cl->un.leaf.quantum = 1000;
1485 if (!hopt->quantum && cl->un.leaf.quantum > 200000) {
1489 cl->un.leaf.quantum = 200000;
1492 cl->un.leaf.quantum = hopt->quantum;
1493 if ((cl->un.leaf.prio = hopt->prio) >= TC_HTB_NUMPRIO)
1494 cl->un.leaf.prio = TC_HTB_NUMPRIO - 1;
1497 cl->quantum = cl->un.leaf.quantum;
1498 cl->prio = cl->un.leaf.prio;
1592 .leaf = htb_leaf,