109 	struct rb_node p_node;  member
2114 		cfqq = rb_entry(parent, struct cfq_queue, p_node);  in cfq_prio_tree_lookup()
2142 		rb_erase(&cfqq->p_node, cfqq->p_root);  in cfq_prio_tree_add()
2155 		rb_link_node(&cfqq->p_node, parent, p);  in cfq_prio_tree_add()
2156 		rb_insert_color(&cfqq->p_node, cfqq->p_root);  in cfq_prio_tree_add()
2206 		rb_erase(&cfqq->p_node, cfqq->p_root);  in cfq_del_cfqq_rr()
2237 			rb_erase(&cfqq->p_node, cfqq->p_root);  in cfq_del_rq_rb()
2609 	__cfqq = rb_entry(parent, struct cfq_queue, p_node);  in cfqq_close()
2614 		node = rb_next(&__cfqq->p_node);  in cfqq_close()
2616 		node = rb_prev(&__cfqq->p_node);  in cfqq_close()
2620 	__cfqq = rb_entry(node, struct cfq_queue, p_node);  in cfqq_close()
3529 	RB_CLEAR_NODE(&cfqq->p_node);  in cfq_init_cfqq()