__bfqq            610 block/bfq-iosched.c 	struct bfq_queue *__bfqq;
__bfqq            635 block/bfq-iosched.c 	__bfqq = bfq_rq_pos_tree_lookup(bfqd, bfqq->pos_root,
__bfqq            637 block/bfq-iosched.c 	if (!__bfqq) {
__bfqq           2416 block/bfq-iosched.c 	struct bfq_queue *__bfqq;
__bfqq           2425 block/bfq-iosched.c 	__bfqq = bfq_rq_pos_tree_lookup(bfqd, root, sector, &parent, NULL);
__bfqq           2426 block/bfq-iosched.c 	if (__bfqq)
__bfqq           2427 block/bfq-iosched.c 		return __bfqq;
__bfqq           2434 block/bfq-iosched.c 	__bfqq = rb_entry(parent, struct bfq_queue, pos_node);
__bfqq           2435 block/bfq-iosched.c 	if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector))
__bfqq           2436 block/bfq-iosched.c 		return __bfqq;
__bfqq           2438 block/bfq-iosched.c 	if (blk_rq_pos(__bfqq->next_rq) < sector)
__bfqq           2439 block/bfq-iosched.c 		node = rb_next(&__bfqq->pos_node);
__bfqq           2441 block/bfq-iosched.c 		node = rb_prev(&__bfqq->pos_node);
__bfqq           2445 block/bfq-iosched.c 	__bfqq = rb_entry(node, struct bfq_queue, pos_node);
__bfqq           2446 block/bfq-iosched.c 	if (bfq_rq_close_to_sector(__bfqq->next_rq, true, sector))
__bfqq           2447 block/bfq-iosched.c 		return __bfqq;
__bfqq           2476 block/bfq-iosched.c 	struct bfq_queue *__bfqq;
__bfqq           2488 block/bfq-iosched.c 	while ((__bfqq = new_bfqq->new_bfqq)) {
__bfqq           2489 block/bfq-iosched.c 		if (__bfqq == bfqq)
__bfqq           2491 block/bfq-iosched.c 		new_bfqq = __bfqq;
__bfqq           4905 block/bfq-iosched.c 	struct bfq_queue *__bfqq, *next;
__bfqq           4912 block/bfq-iosched.c 	__bfqq = bfqq->new_bfqq;
__bfqq           4913 block/bfq-iosched.c 	while (__bfqq) {
__bfqq           4914 block/bfq-iosched.c 		if (__bfqq == bfqq)
__bfqq           4916 block/bfq-iosched.c 		next = __bfqq->new_bfqq;
__bfqq           4917 block/bfq-iosched.c 		bfq_put_queue(__bfqq);
__bfqq           4918 block/bfq-iosched.c 		__bfqq = next;