146 	struct htb_prio hprio[TC_HTB_NUMPRIO];  member
370 		htb_add_to_id_tree(&q->hlevel[cl->level].hprio[prio].row, cl, prio);  in htb_add_class_to_row()
403 		struct htb_prio *hprio = &hlevel->hprio[prio];  in htb_remove_class_from_row()  local
406 		if (hprio->ptr == cl->node + prio)  in htb_remove_class_from_row()
407 			htb_next_rb_node(&hprio->ptr);  in htb_remove_class_from_row()
409 		htb_safe_rb_erase(cl->node + prio, &hprio->row);  in htb_remove_class_from_row()
410 		if (!hprio->row.rb_node)  in htb_remove_class_from_row()
814 static struct htb_class *htb_lookup_leaf(struct htb_prio *hprio, const int prio)  in htb_lookup_leaf()  argument
823 	BUG_ON(!hprio->row.rb_node);  in htb_lookup_leaf()
824 	sp->root = hprio->row.rb_node;  in htb_lookup_leaf()
825 	sp->pptr = &hprio->ptr;  in htb_lookup_leaf()
826 	sp->pid = &hprio->last_ptr_id;  in htb_lookup_leaf()
877 	struct htb_prio *hprio = &hlevel->hprio[prio];  in htb_dequeue_tree()  local
880 	start = cl = htb_lookup_leaf(hprio, prio);  in htb_dequeue_tree()
900 			next = htb_lookup_leaf(hprio, prio);  in htb_dequeue_tree()
914 					 &q->hlevel[0].hprio[prio].ptr);  in htb_dequeue_tree()
915 		cl = htb_lookup_leaf(hprio, prio);  in htb_dequeue_tree()
925 						 &q->hlevel[0].hprio[prio].ptr);  in htb_dequeue_tree()