Lines Matching refs:hprio
149 struct htb_prio hprio[TC_HTB_NUMPRIO]; member
353 htb_add_to_id_tree(&q->hlevel[cl->level].hprio[prio].row, cl, prio); in htb_add_class_to_row()
383 struct htb_prio *hprio = &hlevel->hprio[prio]; in htb_remove_class_from_row() local
386 if (hprio->ptr == cl->node + prio) in htb_remove_class_from_row()
387 htb_next_rb_node(&hprio->ptr); in htb_remove_class_from_row()
389 htb_safe_rb_erase(cl->node + prio, &hprio->row); in htb_remove_class_from_row()
390 if (!hprio->row.rb_node) in htb_remove_class_from_row()
782 static struct htb_class *htb_lookup_leaf(struct htb_prio *hprio, const int prio) in htb_lookup_leaf() argument
791 BUG_ON(!hprio->row.rb_node); in htb_lookup_leaf()
792 sp->root = hprio->row.rb_node; in htb_lookup_leaf()
793 sp->pptr = &hprio->ptr; in htb_lookup_leaf()
794 sp->pid = &hprio->last_ptr_id; in htb_lookup_leaf()
845 struct htb_prio *hprio = &hlevel->hprio[prio]; in htb_dequeue_tree() local
848 start = cl = htb_lookup_leaf(hprio, prio); in htb_dequeue_tree()
868 next = htb_lookup_leaf(hprio, prio); in htb_dequeue_tree()
882 &q->hlevel[0].hprio[prio].ptr); in htb_dequeue_tree()
883 cl = htb_lookup_leaf(hprio, prio); in htb_dequeue_tree()
893 &q->hlevel[0].hprio[prio].ptr); in htb_dequeue_tree()