68 #define rb_entry_cfqg(node)	rb_entry((node), struct cfq_group, rb_node)
86 	struct rb_node *left;
105 	struct rb_node rb_node;  member
109 	struct rb_node p_node;
221 	struct rb_node rb_node;  member
1174 		return rb_entry(root->left, struct cfq_queue, rb_node);  in cfq_rb_first()
1190 static void rb_erase_init(struct rb_node *n, struct rb_root *root)  in rb_erase_init()
1196 static void cfq_rb_erase(struct rb_node *n, struct cfq_rb_root *root)  in cfq_rb_erase()
1211 	struct rb_node *rbnext = rb_next(&last->rb_node);  in cfq_find_next_rq()
1212 	struct rb_node *rbprev = rb_prev(&last->rb_node);  in cfq_find_next_rq()
1215 	BUG_ON(RB_EMPTY_NODE(&last->rb_node));  in cfq_find_next_rq()
1224 		if (rbnext && rbnext != &last->rb_node)  in cfq_find_next_rq()
1250 	struct rb_node **node = &st->rb.rb_node;  in __cfq_group_service_tree_add()
1251 	struct rb_node *parent = NULL;  in __cfq_group_service_tree_add()
1269 		st->left = &cfqg->rb_node;  in __cfq_group_service_tree_add()
1271 	rb_link_node(&cfqg->rb_node, parent, node);  in __cfq_group_service_tree_add()
1272 	rb_insert_color(&cfqg->rb_node, &st->rb);  in __cfq_group_service_tree_add()
1290 	BUG_ON(!RB_EMPTY_NODE(&cfqg->rb_node));  in cfq_update_group_leaf_weight()
1307 	BUG_ON(!RB_EMPTY_NODE(&cfqg->rb_node));  in cfq_group_service_tree_add()
1354 	struct rb_node *n;  in cfq_group_notify_queue_add()
1357 	if (!RB_EMPTY_NODE(&cfqg->rb_node))  in cfq_group_notify_queue_add()
1403 	if (!RB_EMPTY_NODE(&cfqg->rb_node))  in cfq_group_service_tree_del()
1404 		cfq_rb_erase(&cfqg->rb_node, st);  in cfq_group_service_tree_del()
1518 	RB_CLEAR_NODE(&cfqg->rb_node);  in cfq_init_cfqg_base()
2025 	struct rb_node **p, *parent;  in cfq_service_tree_add()
2036 		if (parent && parent != &cfqq->rb_node) {  in cfq_service_tree_add()
2037 			__cfqq = rb_entry(parent, struct cfq_queue, rb_node);  in cfq_service_tree_add()
2057 	if (!RB_EMPTY_NODE(&cfqq->rb_node)) {  in cfq_service_tree_add()
2065 		cfq_rb_erase(&cfqq->rb_node, cfqq->service_tree);  in cfq_service_tree_add()
2072 	p = &st->rb.rb_node;  in cfq_service_tree_add()
2075 		__cfqq = rb_entry(parent, struct cfq_queue, rb_node);  in cfq_service_tree_add()
2089 		st->left = &cfqq->rb_node;  in cfq_service_tree_add()
2092 	rb_link_node(&cfqq->rb_node, parent, p);  in cfq_service_tree_add()
2093 	rb_insert_color(&cfqq->rb_node, &st->rb);  in cfq_service_tree_add()
2102 		     sector_t sector, struct rb_node **ret_parent,  in cfq_prio_tree_lookup()
2103 		     struct rb_node ***rb_link)  in cfq_prio_tree_lookup()
2105 	struct rb_node **p, *parent;  in cfq_prio_tree_lookup()
2109 	p = &root->rb_node;  in cfq_prio_tree_lookup()
2111 		struct rb_node **n;  in cfq_prio_tree_lookup()
2138 	struct rb_node **p, *parent;  in cfq_prio_tree_add()
2201 	if (!RB_EMPTY_NODE(&cfqq->rb_node)) {  in cfq_del_cfqq_rr()
2202 		cfq_rb_erase(&cfqq->rb_node, cfqq->service_tree);  in cfq_del_cfqq_rr()
2590 	struct rb_node *parent, *node;  in cfqq_close()
3528 	RB_CLEAR_NODE(&cfqq->rb_node);  in cfq_init_cfqq()