25 	struct rb_node *node = tree->rb_node;  in bfq_root_active_entity()
27 	return rb_entry(node, struct bfq_entity, rb_node);  in bfq_root_active_entity()
323 struct bfq_entity *bfq_entity_of(struct rb_node *node)  in bfq_entity_of()
328 		entity = rb_entry(node, struct bfq_entity, rb_node);  in bfq_entity_of()
341 	rb_erase(&entity->rb_node, root);  in bfq_extract()
353 	struct rb_node *next;  in bfq_idle_extract()
356 		next = rb_next(&entity->rb_node);  in bfq_idle_extract()
361 		next = rb_prev(&entity->rb_node);  in bfq_idle_extract()
382 	struct rb_node **node = &root->rb_node;  in bfq_insert()
383 	struct rb_node *parent = NULL;  in bfq_insert()
387 		entry = rb_entry(parent, struct bfq_entity, rb_node);  in bfq_insert()
395 	rb_link_node(&entity->rb_node, parent, node);  in bfq_insert()
396 	rb_insert_color(&entity->rb_node, root);  in bfq_insert()
411 static void bfq_update_min(struct bfq_entity *entity, struct rb_node *node)  in bfq_update_min()
416 		child = rb_entry(node, struct bfq_entity, rb_node);  in bfq_update_min()
430 static void bfq_update_active_node(struct rb_node *node)  in bfq_update_active_node()
432 	struct bfq_entity *entity = rb_entry(node, struct bfq_entity, rb_node);  in bfq_update_active_node()
449 static void bfq_update_active_tree(struct rb_node *node)  in bfq_update_active_tree()
451 	struct rb_node *parent;  in bfq_update_active_tree()
484 	struct rb_node *node = &entity->rb_node;  in bfq_active_insert()
544 static struct rb_node *bfq_find_deepest(struct rb_node *node)  in bfq_find_deepest()
546 	struct rb_node *deepest;  in bfq_find_deepest()
574 	struct rb_node *node;  in bfq_active_extract()
576 	node = bfq_find_deepest(&entity->rb_node);  in bfq_active_extract()
1300 	struct rb_node *node = st->active.rb_node;  in bfq_first_active_entity()
1303 		entry = rb_entry(node, struct bfq_entity, rb_node);  in bfq_first_active_entity()
1310 					 struct bfq_entity, rb_node);  in bfq_first_active_entity()