Lines Matching refs:__cfqq
1177 struct cfq_queue *__cfqq;
1216 __cfqq = rb_entry(parent, struct cfq_queue, rb_node);
1217 rb_key += __cfqq->rb_key;
1232 __cfqq = cfq_rb_first(service_tree);
1233 rb_key += __cfqq ? __cfqq->rb_key : jiffies;
1257 __cfqq = rb_entry(parent, struct cfq_queue, rb_node);
1262 if (time_before(rb_key, __cfqq->rb_key))
1323 struct cfq_queue *__cfqq;
1336 __cfqq = cfq_prio_tree_lookup(cfqd, cfqq->p_root,
1338 if (!__cfqq) {
1772 struct cfq_queue *__cfqq;
1782 __cfqq = cfq_prio_tree_lookup(cfqd, root, sector, &parent, NULL);
1783 if (__cfqq)
1784 return __cfqq;
1790 __cfqq = rb_entry(parent, struct cfq_queue, p_node);
1791 if (cfq_rq_close(cfqd, cur_cfqq, __cfqq->next_rq))
1792 return __cfqq;
1794 if (blk_rq_pos(__cfqq->next_rq) < sector)
1795 node = rb_next(&__cfqq->p_node);
1797 node = rb_prev(&__cfqq->p_node);
1801 __cfqq = rb_entry(node, struct cfq_queue, p_node);
1802 if (cfq_rq_close(cfqd, cur_cfqq, __cfqq->next_rq))
1803 return __cfqq;
2042 struct cfq_queue *__cfqq;
2054 while ((__cfqq = new_cfqq->new_cfqq)) {
2055 if (__cfqq == cfqq)
2057 new_cfqq = __cfqq;
2644 struct cfq_queue *__cfqq, *next;
2651 __cfqq = cfqq->new_cfqq;
2652 while (__cfqq) {
2653 if (__cfqq == cfqq) {
2657 next = __cfqq->new_cfqq;
2658 cfq_put_queue(__cfqq);
2659 __cfqq = next;