Lines Matching defs:next_rq
116 struct request *next_rq;
1304 if (sector > blk_rq_pos(cfqq->next_rq))
1306 else if (sector < blk_rq_pos(cfqq->next_rq))
1332 if (!cfqq->next_rq)
1337 blk_rq_pos(cfqq->next_rq), &parent, &p);
1444 prev = cfqq->next_rq;
1445 cfqq->next_rq = cfq_choose_req(cfqd, cfqq->next_rq, rq, cfqd->last_position);
1448 * adjust priority tree position, if ->next_rq changes
1450 if (prev != cfqq->next_rq)
1453 BUG_ON(!cfqq->next_rq);
1514 if (cfqq->next_rq == rq)
1515 cfqq->next_rq = cfq_find_next_rq(cfqq->cfqd, cfqq, rq);
1575 if (cfqq->next_rq == next)
1576 cfqq->next_rq = rq;
1791 if (cfq_rq_close(cfqd, cur_cfqq, __cfqq->next_rq))
1794 if (blk_rq_pos(__cfqq->next_rq) < sector)
1802 if (cfq_rq_close(cfqd, cur_cfqq, __cfqq->next_rq))
1981 cfqq->next_rq = cfq_find_next_rq(cfqd, cfqq, rq);
2323 while (cfqq->next_rq) {
2324 cfq_dispatch_insert(cfqq->cfqd->queue, cfqq->next_rq);
2461 rq = cfqq->next_rq;