Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 4 of 4) sorted by relevance

/block/
Dblk-integrity.c33 int prev = 0; in blk_rq_count_integrity_sg() local
37 if (prev) { in blk_rq_count_integrity_sg()
50 prev = 1; in blk_rq_count_integrity_sg()
75 int prev = 0; in blk_rq_map_integrity_sg() local
79 if (prev) { in blk_rq_map_integrity_sg()
99 prev = 1; in blk_rq_map_integrity_sg()
Dblk-merge.c20 struct request *prev_rq, struct bio *prev, struct bio *next) in bio_will_gap() argument
24 if (!bio_has_data(prev) || !queue_virt_boundary(q)) in bio_will_gap()
35 bio_get_first_bvec(prev, &pb); in bio_will_gap()
48 bio_get_last_bvec(prev, &pb); in bio_will_gap()
837 struct request *prev = elv_former_request(q, rq); in attempt_front_merge() local
839 if (prev) in attempt_front_merge()
840 return attempt_merge(q, prev, rq); in attempt_front_merge()
Dbfq-iosched.c904 struct request *next, *prev = NULL; in bfq_find_next_rq() local
912 prev = rb_entry_rq(rbprev); in bfq_find_next_rq()
922 return bfq_choose_req(bfqd, next, prev, blk_rq_pos(last)); in bfq_find_next_rq()
1876 struct request *next_rq, *prev; in bfq_add_request() local
2063 prev = bfqq->next_rq; in bfq_add_request()
2071 if (unlikely(!bfqd->nonrot_with_queueing && prev != bfqq->next_rq)) in bfq_add_request()
2088 if (prev != bfqq->next_rq) in bfq_add_request()
2172 if (rq->queuelist.prev != &rq->queuelist) in bfq_remove_request()
2288 struct request *prev, *next_rq; in bfq_request_merged() local
2300 prev = bfqq->next_rq; in bfq_request_merged()
[all …]
Dblk-mq.c2326 last = list_entry_rq(plug->mq_list.prev); in blk_mq_submit_bio()