25 	struct rb_node *node = tree->rb_node;  in bfq_root_active_entity()  local
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()  argument
327 	if (node)  in bfq_entity_of()
328 		entity = rb_entry(node, struct bfq_entity, rb_node);  in bfq_entity_of()
382 	struct rb_node **node = &root->rb_node;  in bfq_insert()  local
385 	while (*node) {  in bfq_insert()
386 		parent = *node;  in bfq_insert()
390 			node = &parent->rb_left;  in bfq_insert()
392 			node = &parent->rb_right;  in bfq_insert()
395 	rb_link_node(&entity->rb_node, parent, node);  in bfq_insert()
411 static void bfq_update_min(struct bfq_entity *entity, struct rb_node *node)  in bfq_update_min()  argument
415 	if (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()  argument
432 	struct bfq_entity *entity = rb_entry(node, struct bfq_entity, rb_node);  in bfq_update_active_node()
435 	bfq_update_min(entity, node->rb_right);  in bfq_update_active_node()
436 	bfq_update_min(entity, node->rb_left);  in bfq_update_active_node()
449 static void bfq_update_active_tree(struct rb_node *node)  in bfq_update_active_tree()  argument
454 	bfq_update_active_node(node);  in bfq_update_active_tree()
456 	parent = rb_parent(node);  in bfq_update_active_tree()
460 	if (node == parent->rb_left && parent->rb_right)  in bfq_update_active_tree()
465 	node = parent;  in bfq_update_active_tree()
484 	struct rb_node *node = &entity->rb_node;  in bfq_active_insert()  local
488 	if (node->rb_left)  in bfq_active_insert()
489 		node = node->rb_left;  in bfq_active_insert()
490 	else if (node->rb_right)  in bfq_active_insert()
491 		node = node->rb_right;  in bfq_active_insert()
493 	bfq_update_active_tree(node);  in bfq_active_insert()
544 static struct rb_node *bfq_find_deepest(struct rb_node *node)  in bfq_find_deepest()  argument
548 	if (!node->rb_right && !node->rb_left)  in bfq_find_deepest()
549 		deepest = rb_parent(node);  in bfq_find_deepest()
550 	else if (!node->rb_right)  in bfq_find_deepest()
551 		deepest = node->rb_left;  in bfq_find_deepest()
552 	else if (!node->rb_left)  in bfq_find_deepest()
553 		deepest = node->rb_right;  in bfq_find_deepest()
555 		deepest = rb_next(node);  in bfq_find_deepest()
558 		else if (rb_parent(deepest) != node)  in bfq_find_deepest()
574 	struct rb_node *node;  in bfq_active_extract()  local
576 	node = bfq_find_deepest(&entity->rb_node);  in bfq_active_extract()
579 	if (node)  in bfq_active_extract()
580 		bfq_update_active_tree(node);  in bfq_active_extract()
1300 	struct rb_node *node = st->active.rb_node;  in bfq_first_active_entity()  local
1302 	while (node) {  in bfq_first_active_entity()
1303 		entry = rb_entry(node, struct bfq_entity, rb_node);  in bfq_first_active_entity()
1308 		if (node->rb_left) {  in bfq_first_active_entity()
1309 			entry = rb_entry(node->rb_left,  in bfq_first_active_entity()
1312 				node = node->rb_left;  in bfq_first_active_entity()
1318 		node = node->rb_right;  in bfq_first_active_entity()