Lines Matching refs:rb_node
81 struct rb_node *ptr;
137 struct rb_node pq_node; /* node for event queue */
138 struct rb_node node[TC_HTB_NUMPRIO]; /* node for self or feed tree */
290 struct rb_node **p = &root->rb_node, *parent = NULL; in htb_add_to_id_tree()
319 struct rb_node **p = &q->hlevel[cl->level].wait_pq.rb_node, *parent = NULL; in htb_add_to_wait_tree()
349 static inline void htb_next_rb_node(struct rb_node **n) in htb_next_rb_node()
376 static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root) in htb_safe_rb_erase()
411 if (!hprio->row.rb_node) in htb_remove_class_from_row()
440 if (p->inner.clprio[prio].feed.rb_node) in htb_activate_prios()
490 if (!p->inner.clprio[prio].feed.rb_node) in htb_deactivate_prios()
760 struct rb_node *p = rb_first(wait_pq); in htb_do_events()
788 static struct rb_node *htb_id_find_next_upper(int prio, struct rb_node *n, in htb_id_find_next_upper()
791 struct rb_node *r = NULL; in htb_id_find_next_upper()
819 struct rb_node *root; in htb_lookup_leaf()
820 struct rb_node **pptr; in htb_lookup_leaf()
824 if (unlikely(!hprio->row.rb_node)) in htb_lookup_leaf()
827 sp->root = hprio->row.rb_node; in htb_lookup_leaf()
862 (++sp)->root = clp->feed.rb_node; in htb_lookup_leaf()