767 	struct bfq_queue *__bfqq;  in bfq_pos_tree_add_move()  local
792 	__bfqq = bfq_rq_pos_tree_lookup(bfqd, bfqq->pos_root,  in bfq_pos_tree_add_move()
794 	if (!__bfqq) {  in bfq_pos_tree_add_move()
2699 	struct bfq_queue *__bfqq;  in bfqq_find_close()  local
2708 	__bfqq = bfq_rq_pos_tree_lookup(bfqd, root, sector, &parent, NULL);  in bfqq_find_close()
2709 	if (__bfqq)  in bfqq_find_close()
2710 		return __bfqq;  in bfqq_find_close()
2717 	__bfqq = rb_entry(parent, struct bfq_queue, pos_node);  in bfqq_find_close()
2718 	if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector))  in bfqq_find_close()
2719 		return __bfqq;  in bfqq_find_close()
2721 	if (blk_rq_pos(__bfqq->next_rq) < sector)  in bfqq_find_close()
2722 		node = rb_next(&__bfqq->pos_node);  in bfqq_find_close()
2724 		node = rb_prev(&__bfqq->pos_node);  in bfqq_find_close()
2728 	__bfqq = rb_entry(node, struct bfq_queue, pos_node);  in bfqq_find_close()
2729 	if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector))  in bfqq_find_close()
2730 		return __bfqq;  in bfqq_find_close()
2759 	struct bfq_queue *__bfqq;  in bfq_setup_merge()  local
2771 	while ((__bfqq = new_bfqq->new_bfqq)) {  in bfq_setup_merge()
2772 		if (__bfqq == bfqq)  in bfq_setup_merge()
2774 		new_bfqq = __bfqq;  in bfq_setup_merge()
5343 	struct bfq_queue *__bfqq, *next;  in bfq_put_cooperator()  local
5350 	__bfqq = bfqq->new_bfqq;  in bfq_put_cooperator()
5351 	while (__bfqq) {  in bfq_put_cooperator()
5352 		if (__bfqq == bfqq)  in bfq_put_cooperator()
5354 		next = __bfqq->new_bfqq;  in bfq_put_cooperator()
5355 		bfq_put_queue(__bfqq);  in bfq_put_cooperator()
5356 		__bfqq = next;  in bfq_put_cooperator()