563 	struct rb_node **p, *parent;  in bfq_rq_pos_tree_lookup()  local
566 	parent = NULL;  in bfq_rq_pos_tree_lookup()
571 		parent = *p;  in bfq_rq_pos_tree_lookup()
572 		bfqq = rb_entry(parent, struct bfq_queue, pos_node);  in bfq_rq_pos_tree_lookup()
588 	*ret_parent = parent;  in bfq_rq_pos_tree_lookup()
617 	struct rb_node **p, *parent;  in bfq_pos_tree_add_move()  local
644 			blk_rq_pos(bfqq->next_rq), &parent, &p);  in bfq_pos_tree_add_move()
646 		rb_link_node(&bfqq->pos_node, parent, p);  in bfq_pos_tree_add_move()
734 	struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL;  in bfq_weights_tree_add()  local
756 		parent = *new;  in bfq_weights_tree_add()
789 	rb_link_node(&bfqq->weight_counter->weights_node, parent, new);  in bfq_weights_tree_add()
830 	struct bfq_entity *entity = bfqq->entity.parent;  in bfq_weights_tree_remove()
1095 	bfqd->burst_parent_entity = bfqq->entity.parent;  in bfq_reset_burst_list()
1283 	    bfqq->entity.parent != bfqd->burst_parent_entity) {  in bfq_handle_burst()
1641 	if (in_serv_bfqq->entity.parent == bfqq->entity.parent) {  in bfq_bfqq_higher_class_or_weight()
1645 		if (bfqq->entity.parent)  in bfq_bfqq_higher_class_or_weight()
1646 			bfqq_weight = bfqq->entity.parent->weight;  in bfq_bfqq_higher_class_or_weight()
1649 		if (in_serv_bfqq->entity.parent)  in bfq_bfqq_higher_class_or_weight()
1650 			in_serv_weight = in_serv_bfqq->entity.parent->weight;  in bfq_bfqq_higher_class_or_weight()
2430 	struct rb_node *parent, *node;  in bfqq_find_close()  local
2440 	__bfqq = bfq_rq_pos_tree_lookup(bfqd, root, sector, &parent, NULL);  in bfqq_find_close()
2449 	__bfqq = rb_entry(parent, struct bfq_queue, pos_node);  in bfqq_find_close()
2523 	if (new_bfqq->entity.parent != bfqq->entity.parent)  in bfq_setup_merge()
2689 	    bfqq->entity.parent == in_service_bfqq->entity.parent &&  in bfq_setup_cooperator()
4075 	entity = entity->parent;  in bfq_bfqq_expire()
6437 	root_group->entity.parent = NULL;  in bfq_init_root_group()