85 	struct rb_root rb;  member
91 #define CFQ_RB_ROOT	(struct cfq_rb_root) { .rb = RB_ROOT, \
1171 		root->left = rb_first(&root->rb);  in cfq_rb_first()
1182 		root->left = rb_first(&root->rb);  in cfq_rb_first_group()
1200 	rb_erase_init(n, &root->rb);  in cfq_rb_erase()
1250 	struct rb_node **node = &st->rb.rb_node;  in __cfq_group_service_tree_add()
1272 	rb_insert_color(&cfqg->rb_node, &st->rb);  in __cfq_group_service_tree_add()
1352 	n = rb_last(&st->rb);  in cfq_group_notify_queue_add()
2015 		parent = rb_last(&st->rb);  in cfq_service_tree_add()
2052 	p = &st->rb.rb_node;  in cfq_service_tree_add()
2073 	rb_insert_color(&cfqq->rb_node, &st->rb);  in cfq_service_tree_add()
2513 	if (RB_EMPTY_ROOT(&st->rb))  in cfq_get_next_queue()
2990 	if (RB_EMPTY_ROOT(&st->rb))  in cfq_get_next_cfqg()