610 	struct bfq_queue *__bfqq;  in bfq_pos_tree_add_move()  local
631 	__bfqq = bfq_rq_pos_tree_lookup(bfqd, bfqq->pos_root,  in bfq_pos_tree_add_move()
633 	if (!__bfqq) {  in bfq_pos_tree_add_move()
2412 	struct bfq_queue *__bfqq;  in bfqq_find_close()  local
2421 	__bfqq = bfq_rq_pos_tree_lookup(bfqd, root, sector, &parent, NULL);  in bfqq_find_close()
2422 	if (__bfqq)  in bfqq_find_close()
2423 		return __bfqq;  in bfqq_find_close()
2430 	__bfqq = rb_entry(parent, struct bfq_queue, pos_node);  in bfqq_find_close()
2431 	if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector))  in bfqq_find_close()
2432 		return __bfqq;  in bfqq_find_close()
2434 	if (blk_rq_pos(__bfqq->next_rq) < sector)  in bfqq_find_close()
2435 		node = rb_next(&__bfqq->pos_node);  in bfqq_find_close()
2437 		node = rb_prev(&__bfqq->pos_node);  in bfqq_find_close()
2441 	__bfqq = rb_entry(node, struct bfq_queue, pos_node);  in bfqq_find_close()
2442 	if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector))  in bfqq_find_close()
2443 		return __bfqq;  in bfqq_find_close()
2472 	struct bfq_queue *__bfqq;  in bfq_setup_merge()  local
2484 	while ((__bfqq = new_bfqq->new_bfqq)) {  in bfq_setup_merge()
2485 		if (__bfqq == bfqq)  in bfq_setup_merge()
2487 		new_bfqq = __bfqq;  in bfq_setup_merge()
4895 	struct bfq_queue *__bfqq, *next;  in bfq_put_cooperator()  local
4902 	__bfqq = bfqq->new_bfqq;  in bfq_put_cooperator()
4903 	while (__bfqq) {  in bfq_put_cooperator()
4904 		if (__bfqq == bfqq)  in bfq_put_cooperator()
4906 		next = __bfqq->new_bfqq;  in bfq_put_cooperator()
4907 		bfq_put_queue(__bfqq);  in bfq_put_cooperator()
4908 		__bfqq = next;  in bfq_put_cooperator()