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()
312 struct bfq_entity *bfq_entity_of(struct rb_node *node)  in bfq_entity_of()  argument
316 	if (node)  in bfq_entity_of()
317 		entity = rb_entry(node, struct bfq_entity, rb_node);  in bfq_entity_of()
371 	struct rb_node **node = &root->rb_node;  in bfq_insert()  local
374 	while (*node) {  in bfq_insert()
375 		parent = *node;  in bfq_insert()
379 			node = &parent->rb_left;  in bfq_insert()
381 			node = &parent->rb_right;  in bfq_insert()
384 	rb_link_node(&entity->rb_node, parent, node);  in bfq_insert()
400 static void bfq_update_min(struct bfq_entity *entity, struct rb_node *node)  in bfq_update_min()  argument
404 	if (node) {  in bfq_update_min()
405 		child = rb_entry(node, struct bfq_entity, rb_node);  in bfq_update_min()
419 static void bfq_update_active_node(struct rb_node *node)  in bfq_update_active_node()  argument
421 	struct bfq_entity *entity = rb_entry(node, struct bfq_entity, rb_node);  in bfq_update_active_node()
424 	bfq_update_min(entity, node->rb_right);  in bfq_update_active_node()
425 	bfq_update_min(entity, node->rb_left);  in bfq_update_active_node()
438 static void bfq_update_active_tree(struct rb_node *node)  in bfq_update_active_tree()  argument
443 	bfq_update_active_node(node);  in bfq_update_active_tree()
445 	parent = rb_parent(node);  in bfq_update_active_tree()
449 	if (node == parent->rb_left && parent->rb_right)  in bfq_update_active_tree()
454 	node = parent;  in bfq_update_active_tree()
473 	struct rb_node *node = &entity->rb_node;  in bfq_active_insert()  local
482 	if (node->rb_left)  in bfq_active_insert()
483 		node = node->rb_left;  in bfq_active_insert()
484 	else if (node->rb_right)  in bfq_active_insert()
485 		node = node->rb_right;  in bfq_active_insert()
487 	bfq_update_active_tree(node);  in bfq_active_insert()
545 static struct rb_node *bfq_find_deepest(struct rb_node *node)  in bfq_find_deepest()  argument
549 	if (!node->rb_right && !node->rb_left)  in bfq_find_deepest()
550 		deepest = rb_parent(node);  in bfq_find_deepest()
551 	else if (!node->rb_right)  in bfq_find_deepest()
552 		deepest = node->rb_left;  in bfq_find_deepest()
553 	else if (!node->rb_left)  in bfq_find_deepest()
554 		deepest = node->rb_right;  in bfq_find_deepest()
556 		deepest = rb_next(node);  in bfq_find_deepest()
559 		else if (rb_parent(deepest) != node)  in bfq_find_deepest()
575 	struct rb_node *node;  in bfq_active_extract()  local
582 	node = bfq_find_deepest(&entity->rb_node);  in bfq_active_extract()
585 	if (node)  in bfq_active_extract()
586 		bfq_update_active_tree(node);  in bfq_active_extract()
1351 	struct rb_node *node = st->active.rb_node;  in bfq_first_active_entity()  local
1353 	while (node) {  in bfq_first_active_entity()
1354 		entry = rb_entry(node, struct bfq_entity, rb_node);  in bfq_first_active_entity()
1359 		if (node->rb_left) {  in bfq_first_active_entity()
1360 			entry = rb_entry(node->rb_left,  in bfq_first_active_entity()
1363 				node = node->rb_left;  in bfq_first_active_entity()
1369 		node = node->rb_right;  in bfq_first_active_entity()