84 	struct rb_node	*ptr;
141 	struct rb_node		pq_node;	/* node for event queue */
142 	struct rb_node		node[TC_HTB_NUMPRIO];	/* node for self or feed tree */
272 	struct rb_node **p = &root->rb_node, *parent = NULL;  in htb_add_to_id_tree()
298 	struct rb_node **p = &q->hlevel[cl->level].wait_pq.rb_node, *parent = NULL;  in htb_add_to_wait_tree()
327 static inline void htb_next_rb_node(struct rb_node **n)  in htb_next_rb_node()
350 static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root)  in htb_safe_rb_erase()
382 		if (!hprio->row.rb_node)  in htb_remove_class_from_row()
406 			if (p->un.inner.clprio[prio].feed.rb_node)  in htb_activate_prios()
454 			if (!p->un.inner.clprio[prio].feed.rb_node)  in htb_deactivate_prios()
703 		struct rb_node *p = rb_first(wait_pq);  in htb_do_events()
731 static struct rb_node *htb_id_find_next_upper(int prio, struct rb_node *n,  in htb_id_find_next_upper()
734 	struct rb_node *r = NULL;  in htb_id_find_next_upper()
760 		struct rb_node *root;  in htb_lookup_leaf()
761 		struct rb_node **pptr;  in htb_lookup_leaf()
765 	BUG_ON(!hprio->row.rb_node);  in htb_lookup_leaf()
766 	sp->root = hprio->row.rb_node;  in htb_lookup_leaf()
801 			(++sp)->root = clp->feed.rb_node;  in htb_lookup_leaf()