150 	struct bfq_entity *group_entity = bfqq->entity.parent;  in bfq_bfqq_to_bfqg()
375 	struct rb_node *parent = NULL;  in bfq_insert()  local
378 		parent = *node;  in bfq_insert()
379 		entry = rb_entry(parent, struct bfq_entity, rb_node);  in bfq_insert()
382 			node = &parent->rb_left;  in bfq_insert()
384 			node = &parent->rb_right;  in bfq_insert()
387 	rb_link_node(&entity->rb_node, parent, node);  in bfq_insert()
443 	struct rb_node *parent;  in bfq_update_active_tree()  local
448 	parent = rb_parent(node);  in bfq_update_active_tree()
449 	if (!parent)  in bfq_update_active_tree()
452 	if (node == parent->rb_left && parent->rb_right)  in bfq_update_active_tree()
453 		bfq_update_active_node(parent->rb_right);  in bfq_update_active_tree()
454 	else if (parent->rb_left)  in bfq_update_active_tree()
455 		bfq_update_active_node(parent->rb_left);  in bfq_update_active_tree()
457 	node = parent;  in bfq_update_active_tree()
1220 	struct bfq_entity *parent = NULL;  in bfq_deactivate_entity()  local
1222 	for_each_entity_safe(entity, parent) {  in bfq_deactivate_entity()
1290 	entity = parent;  in bfq_deactivate_entity()