145 	struct htb_prio hprio[TC_HTB_NUMPRIO];  member
350 		htb_add_to_id_tree(&q->hlevel[cl->level].hprio[prio].row, cl, prio);  in htb_add_class_to_row()
380 		struct htb_prio *hprio = &hlevel->hprio[prio];  in htb_remove_class_from_row()  local
383 		if (hprio->ptr == cl->node + prio)  in htb_remove_class_from_row()
384 			htb_next_rb_node(&hprio->ptr);  in htb_remove_class_from_row()
386 		htb_safe_rb_erase(cl->node + prio, &hprio->row);  in htb_remove_class_from_row()
387 		if (!hprio->row.rb_node)  in htb_remove_class_from_row()
766 static struct htb_class *htb_lookup_leaf(struct htb_prio *hprio, const int prio)  in htb_lookup_leaf()  argument
775 	BUG_ON(!hprio->row.rb_node);  in htb_lookup_leaf()
776 	sp->root = hprio->row.rb_node;  in htb_lookup_leaf()
777 	sp->pptr = &hprio->ptr;  in htb_lookup_leaf()
778 	sp->pid = &hprio->last_ptr_id;  in htb_lookup_leaf()
829 	struct htb_prio *hprio = &hlevel->hprio[prio];  in htb_dequeue_tree()  local
832 	start = cl = htb_lookup_leaf(hprio, prio);  in htb_dequeue_tree()
852 			next = htb_lookup_leaf(hprio, prio);  in htb_dequeue_tree()
866 					 &q->hlevel[0].hprio[prio].ptr);  in htb_dequeue_tree()
867 		cl = htb_lookup_leaf(hprio, prio);  in htb_dequeue_tree()
877 						 &q->hlevel[0].hprio[prio].ptr);  in htb_dequeue_tree()