68 #define rb_entry_cfqg(node)	rb_entry((node), struct cfq_group, rb_node)
91 	struct rb_node *left;
110 	struct rb_node rb_node;  member
114 	struct rb_node p_node;
229 	struct rb_node rb_node;  member
1175 		return rb_entry(root->left, struct cfq_queue, rb_node);  in cfq_rb_first()
1191 static void rb_erase_init(struct rb_node *n, struct rb_root *root)  in rb_erase_init()
1197 static void cfq_rb_erase(struct rb_node *n, struct cfq_rb_root *root)  in cfq_rb_erase()
1212 	struct rb_node *rbnext = rb_next(&last->rb_node);  in cfq_find_next_rq()
1213 	struct rb_node *rbprev = rb_prev(&last->rb_node);  in cfq_find_next_rq()
1216 	BUG_ON(RB_EMPTY_NODE(&last->rb_node));  in cfq_find_next_rq()
1225 		if (rbnext && rbnext != &last->rb_node)  in cfq_find_next_rq()
1251 	struct rb_node **node = &st->rb.rb_node;  in __cfq_group_service_tree_add()
1252 	struct rb_node *parent = NULL;  in __cfq_group_service_tree_add()
1270 		st->left = &cfqg->rb_node;  in __cfq_group_service_tree_add()
1272 	rb_link_node(&cfqg->rb_node, parent, node);  in __cfq_group_service_tree_add()
1273 	rb_insert_color(&cfqg->rb_node, &st->rb);  in __cfq_group_service_tree_add()
1291 	BUG_ON(!RB_EMPTY_NODE(&cfqg->rb_node));  in cfq_update_group_leaf_weight()
1308 	BUG_ON(!RB_EMPTY_NODE(&cfqg->rb_node));  in cfq_group_service_tree_add()
1355 	struct rb_node *n;  in cfq_group_notify_queue_add()
1358 	if (!RB_EMPTY_NODE(&cfqg->rb_node))  in cfq_group_notify_queue_add()
1404 	if (!RB_EMPTY_NODE(&cfqg->rb_node))  in cfq_group_service_tree_del()
1405 		cfq_rb_erase(&cfqg->rb_node, st);  in cfq_group_service_tree_del()
1519 	RB_CLEAR_NODE(&cfqg->rb_node);  in cfq_init_cfqg_base()
2202 	struct rb_node **p, *parent;  in cfq_service_tree_add()
2213 		if (parent && parent != &cfqq->rb_node) {  in cfq_service_tree_add()
2214 			__cfqq = rb_entry(parent, struct cfq_queue, rb_node);  in cfq_service_tree_add()
2234 	if (!RB_EMPTY_NODE(&cfqq->rb_node)) {  in cfq_service_tree_add()
2242 		cfq_rb_erase(&cfqq->rb_node, cfqq->service_tree);  in cfq_service_tree_add()
2249 	p = &st->rb.rb_node;  in cfq_service_tree_add()
2252 		__cfqq = rb_entry(parent, struct cfq_queue, rb_node);  in cfq_service_tree_add()
2266 		st->left = &cfqq->rb_node;  in cfq_service_tree_add()
2269 	rb_link_node(&cfqq->rb_node, parent, p);  in cfq_service_tree_add()
2270 	rb_insert_color(&cfqq->rb_node, &st->rb);  in cfq_service_tree_add()
2279 		     sector_t sector, struct rb_node **ret_parent,  in cfq_prio_tree_lookup()
2280 		     struct rb_node ***rb_link)  in cfq_prio_tree_lookup()
2282 	struct rb_node **p, *parent;  in cfq_prio_tree_lookup()
2286 	p = &root->rb_node;  in cfq_prio_tree_lookup()
2288 		struct rb_node **n;  in cfq_prio_tree_lookup()
2315 	struct rb_node **p, *parent;  in cfq_prio_tree_add()
2378 	if (!RB_EMPTY_NODE(&cfqq->rb_node)) {  in cfq_del_cfqq_rr()
2379 		cfq_rb_erase(&cfqq->rb_node, cfqq->service_tree);  in cfq_del_cfqq_rr()
2767 	struct rb_node *parent, *node;  in cfqq_close()
3700 	RB_CLEAR_NODE(&cfqq->rb_node);  in cfq_init_cfqq()