596 	struct bfq_queue *__bfqq;  in bfq_pos_tree_add_move()  local
617 	__bfqq = bfq_rq_pos_tree_lookup(bfqd, bfqq->pos_root,  in bfq_pos_tree_add_move()
619 	if (!__bfqq) {  in bfq_pos_tree_add_move()
2020 	struct bfq_queue *__bfqq;  in bfqq_find_close()  local
2029 	__bfqq = bfq_rq_pos_tree_lookup(bfqd, root, sector, &parent, NULL);  in bfqq_find_close()
2030 	if (__bfqq)  in bfqq_find_close()
2031 		return __bfqq;  in bfqq_find_close()
2038 	__bfqq = rb_entry(parent, struct bfq_queue, pos_node);  in bfqq_find_close()
2039 	if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector))  in bfqq_find_close()
2040 		return __bfqq;  in bfqq_find_close()
2042 	if (blk_rq_pos(__bfqq->next_rq) < sector)  in bfqq_find_close()
2043 		node = rb_next(&__bfqq->pos_node);  in bfqq_find_close()
2045 		node = rb_prev(&__bfqq->pos_node);  in bfqq_find_close()
2049 	__bfqq = rb_entry(node, struct bfq_queue, pos_node);  in bfqq_find_close()
2050 	if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector))  in bfqq_find_close()
2051 		return __bfqq;  in bfqq_find_close()
2080 	struct bfq_queue *__bfqq;  in bfq_setup_merge()  local
2092 	while ((__bfqq = new_bfqq->new_bfqq)) {  in bfq_setup_merge()
2093 		if (__bfqq == bfqq)  in bfq_setup_merge()
2095 		new_bfqq = __bfqq;  in bfq_setup_merge()
4071 	struct bfq_queue *__bfqq, *next;  in bfq_put_cooperator()  local
4078 	__bfqq = bfqq->new_bfqq;  in bfq_put_cooperator()
4079 	while (__bfqq) {  in bfq_put_cooperator()
4080 		if (__bfqq == bfqq)  in bfq_put_cooperator()
4082 		next = __bfqq->new_bfqq;  in bfq_put_cooperator()
4083 		bfq_put_queue(__bfqq);  in bfq_put_cooperator()
4084 		__bfqq = next;  in bfq_put_cooperator()