1 // SPDX-License-Identifier: GPL-2.0
3 * Functions related to segment and merge handling
5 #include <linux/kernel.h>
6 #include <linux/module.h>
8 #include <linux/blkdev.h>
9 #include <linux/scatterlist.h>
11 #include <trace/events/block.h>
15 static struct bio
*blk_bio_discard_split(struct request_queue
*q
,
20 unsigned int max_discard_sectors
, granularity
;
23 unsigned split_sectors
;
27 /* Zero-sector (unknown) and one-sector granularities are the same. */
28 granularity
= max(q
->limits
.discard_granularity
>> 9, 1U);
30 max_discard_sectors
= min(q
->limits
.max_discard_sectors
,
31 bio_allowed_max_sectors(q
));
32 max_discard_sectors
-= max_discard_sectors
% granularity
;
34 if (unlikely(!max_discard_sectors
)) {
39 if (bio_sectors(bio
) <= max_discard_sectors
)
42 split_sectors
= max_discard_sectors
;
45 * If the next starting sector would be misaligned, stop the discard at
46 * the previous aligned sector.
48 alignment
= (q
->limits
.discard_alignment
>> 9) % granularity
;
50 tmp
= bio
->bi_iter
.bi_sector
+ split_sectors
- alignment
;
51 tmp
= sector_div(tmp
, granularity
);
53 if (split_sectors
> tmp
)
56 return bio_split(bio
, split_sectors
, GFP_NOIO
, bs
);
59 static struct bio
*blk_bio_write_zeroes_split(struct request_queue
*q
,
60 struct bio
*bio
, struct bio_set
*bs
, unsigned *nsegs
)
64 if (!q
->limits
.max_write_zeroes_sectors
)
67 if (bio_sectors(bio
) <= q
->limits
.max_write_zeroes_sectors
)
70 return bio_split(bio
, q
->limits
.max_write_zeroes_sectors
, GFP_NOIO
, bs
);
73 static struct bio
*blk_bio_write_same_split(struct request_queue
*q
,
80 if (!q
->limits
.max_write_same_sectors
)
83 if (bio_sectors(bio
) <= q
->limits
.max_write_same_sectors
)
86 return bio_split(bio
, q
->limits
.max_write_same_sectors
, GFP_NOIO
, bs
);
89 static inline unsigned get_max_io_size(struct request_queue
*q
,
92 unsigned sectors
= blk_max_size_offset(q
, bio
->bi_iter
.bi_sector
);
93 unsigned mask
= queue_logical_block_size(q
) - 1;
95 /* aligned to logical block size */
96 sectors
&= ~(mask
>> 9);
101 static struct bio
*blk_bio_segment_split(struct request_queue
*q
,
106 struct bio_vec bv
, bvprv
, *bvprvp
= NULL
;
107 struct bvec_iter iter
;
108 unsigned seg_size
= 0, nsegs
= 0, sectors
= 0;
109 unsigned front_seg_size
= bio
->bi_seg_front_size
;
110 bool do_split
= true;
111 struct bio
*new = NULL
;
112 const unsigned max_sectors
= get_max_io_size(q
, bio
);
114 bio_for_each_segment(bv
, bio
, iter
) {
116 * If the queue doesn't support SG gaps and adding this
117 * offset would create a gap, disallow it.
119 if (bvprvp
&& bvec_gap_to_prev(q
, bvprvp
, bv
.bv_offset
))
122 if (sectors
+ (bv
.bv_len
>> 9) > max_sectors
) {
124 * Consider this a new segment if we're splitting in
125 * the middle of this vector.
127 if (nsegs
< queue_max_segments(q
) &&
128 sectors
< max_sectors
) {
130 sectors
= max_sectors
;
134 /* Make this single bvec as the 1st segment */
137 if (bvprvp
&& blk_queue_cluster(q
)) {
138 if (seg_size
+ bv
.bv_len
> queue_max_segment_size(q
))
140 if (!BIOVEC_PHYS_MERGEABLE(bvprvp
, &bv
))
142 if (!BIOVEC_SEG_BOUNDARY(q
, bvprvp
, &bv
))
145 seg_size
+= bv
.bv_len
;
148 sectors
+= bv
.bv_len
>> 9;
150 if (nsegs
== 1 && seg_size
> front_seg_size
)
151 front_seg_size
= seg_size
;
155 if (nsegs
== queue_max_segments(q
))
161 seg_size
= bv
.bv_len
;
162 sectors
+= bv
.bv_len
>> 9;
164 if (nsegs
== 1 && seg_size
> front_seg_size
)
165 front_seg_size
= seg_size
;
173 new = bio_split(bio
, sectors
, GFP_NOIO
, bs
);
178 bio
->bi_seg_front_size
= front_seg_size
;
179 if (seg_size
> bio
->bi_seg_back_size
)
180 bio
->bi_seg_back_size
= seg_size
;
182 return do_split
? new : NULL
;
185 void blk_queue_split(struct request_queue
*q
, struct bio
**bio
)
187 struct bio
*split
, *res
;
190 switch (bio_op(*bio
)) {
192 case REQ_OP_SECURE_ERASE
:
193 split
= blk_bio_discard_split(q
, *bio
, q
->bio_split
, &nsegs
);
195 case REQ_OP_WRITE_ZEROES
:
196 split
= blk_bio_write_zeroes_split(q
, *bio
, q
->bio_split
, &nsegs
);
198 case REQ_OP_WRITE_SAME
:
199 split
= blk_bio_write_same_split(q
, *bio
, q
->bio_split
, &nsegs
);
202 split
= blk_bio_segment_split(q
, *bio
, q
->bio_split
, &nsegs
);
206 /* physical segments can be figured out during splitting */
207 res
= split
? split
: *bio
;
208 res
->bi_phys_segments
= nsegs
;
209 bio_set_flag(res
, BIO_SEG_VALID
);
212 /* there isn't chance to merge the splitted bio */
213 split
->bi_opf
|= REQ_NOMERGE
;
215 bio_chain(split
, *bio
);
216 trace_block_split(q
, split
, (*bio
)->bi_iter
.bi_sector
);
217 generic_make_request(*bio
);
221 EXPORT_SYMBOL(blk_queue_split
);
223 static unsigned int __blk_recalc_rq_segments(struct request_queue
*q
,
227 struct bio_vec bv
, bvprv
= { NULL
};
228 int cluster
, prev
= 0;
229 unsigned int seg_size
, nr_phys_segs
;
230 struct bio
*fbio
, *bbio
;
231 struct bvec_iter iter
;
236 switch (bio_op(bio
)) {
238 case REQ_OP_SECURE_ERASE
:
239 case REQ_OP_WRITE_ZEROES
:
241 case REQ_OP_WRITE_SAME
:
246 cluster
= blk_queue_cluster(q
);
250 bio_for_each_segment(bv
, bio
, iter
) {
252 * If SG merging is disabled, each bio vector is
258 if (prev
&& cluster
) {
259 if (seg_size
+ bv
.bv_len
260 > queue_max_segment_size(q
))
262 if (!BIOVEC_PHYS_MERGEABLE(&bvprv
, &bv
))
264 if (!BIOVEC_SEG_BOUNDARY(q
, &bvprv
, &bv
))
267 seg_size
+= bv
.bv_len
;
272 if (nr_phys_segs
== 1 && seg_size
>
273 fbio
->bi_seg_front_size
)
274 fbio
->bi_seg_front_size
= seg_size
;
279 seg_size
= bv
.bv_len
;
284 if (nr_phys_segs
== 1 && seg_size
> fbio
->bi_seg_front_size
)
285 fbio
->bi_seg_front_size
= seg_size
;
286 if (seg_size
> bbio
->bi_seg_back_size
)
287 bbio
->bi_seg_back_size
= seg_size
;
292 void blk_recalc_rq_segments(struct request
*rq
)
294 bool no_sg_merge
= !!test_bit(QUEUE_FLAG_NO_SG_MERGE
,
295 &rq
->q
->queue_flags
);
297 rq
->nr_phys_segments
= __blk_recalc_rq_segments(rq
->q
, rq
->bio
,
301 void blk_recount_segments(struct request_queue
*q
, struct bio
*bio
)
303 unsigned short seg_cnt
;
305 /* estimate segment number by bi_vcnt for non-cloned bio */
306 if (bio_flagged(bio
, BIO_CLONED
))
307 seg_cnt
= bio_segments(bio
);
309 seg_cnt
= bio
->bi_vcnt
;
311 if (test_bit(QUEUE_FLAG_NO_SG_MERGE
, &q
->queue_flags
) &&
312 (seg_cnt
< queue_max_segments(q
)))
313 bio
->bi_phys_segments
= seg_cnt
;
315 struct bio
*nxt
= bio
->bi_next
;
318 bio
->bi_phys_segments
= __blk_recalc_rq_segments(q
, bio
, false);
322 bio_set_flag(bio
, BIO_SEG_VALID
);
324 EXPORT_SYMBOL(blk_recount_segments
);
326 static int blk_phys_contig_segment(struct request_queue
*q
, struct bio
*bio
,
329 struct bio_vec end_bv
= { NULL
}, nxt_bv
;
331 if (!blk_queue_cluster(q
))
334 if (bio
->bi_seg_back_size
+ nxt
->bi_seg_front_size
>
335 queue_max_segment_size(q
))
338 if (!bio_has_data(bio
))
341 bio_get_last_bvec(bio
, &end_bv
);
342 bio_get_first_bvec(nxt
, &nxt_bv
);
344 if (!BIOVEC_PHYS_MERGEABLE(&end_bv
, &nxt_bv
))
348 * bio and nxt are contiguous in memory; check if the queue allows
349 * these two to be merged into one
351 if (BIOVEC_SEG_BOUNDARY(q
, &end_bv
, &nxt_bv
))
358 __blk_segment_map_sg(struct request_queue
*q
, struct bio_vec
*bvec
,
359 struct scatterlist
*sglist
, struct bio_vec
*bvprv
,
360 struct scatterlist
**sg
, int *nsegs
, int *cluster
)
363 int nbytes
= bvec
->bv_len
;
365 if (*sg
&& *cluster
) {
366 if ((*sg
)->length
+ nbytes
> queue_max_segment_size(q
))
369 if (!BIOVEC_PHYS_MERGEABLE(bvprv
, bvec
))
371 if (!BIOVEC_SEG_BOUNDARY(q
, bvprv
, bvec
))
374 (*sg
)->length
+= nbytes
;
381 * If the driver previously mapped a shorter
382 * list, we could see a termination bit
383 * prematurely unless it fully inits the sg
384 * table on each mapping. We KNOW that there
385 * must be more entries here or the driver
386 * would be buggy, so force clear the
387 * termination bit to avoid doing a full
388 * sg_init_table() in drivers for each command.
394 sg_set_page(*sg
, bvec
->bv_page
, nbytes
, bvec
->bv_offset
);
400 static inline int __blk_bvec_map_sg(struct request_queue
*q
, struct bio_vec bv
,
401 struct scatterlist
*sglist
, struct scatterlist
**sg
)
404 sg_set_page(*sg
, bv
.bv_page
, bv
.bv_len
, bv
.bv_offset
);
408 static int __blk_bios_map_sg(struct request_queue
*q
, struct bio
*bio
,
409 struct scatterlist
*sglist
,
410 struct scatterlist
**sg
)
412 struct bio_vec bvec
, bvprv
= { NULL
};
413 struct bvec_iter iter
;
414 int cluster
= blk_queue_cluster(q
), nsegs
= 0;
417 bio_for_each_segment(bvec
, bio
, iter
)
418 __blk_segment_map_sg(q
, &bvec
, sglist
, &bvprv
, sg
,
425 * map a request to scatterlist, return number of sg entries setup. Caller
426 * must make sure sg can hold rq->nr_phys_segments entries
428 int blk_rq_map_sg(struct request_queue
*q
, struct request
*rq
,
429 struct scatterlist
*sglist
)
431 struct scatterlist
*sg
= NULL
;
434 if (rq
->rq_flags
& RQF_SPECIAL_PAYLOAD
)
435 nsegs
= __blk_bvec_map_sg(q
, rq
->special_vec
, sglist
, &sg
);
436 else if (rq
->bio
&& bio_op(rq
->bio
) == REQ_OP_WRITE_SAME
)
437 nsegs
= __blk_bvec_map_sg(q
, bio_iovec(rq
->bio
), sglist
, &sg
);
439 nsegs
= __blk_bios_map_sg(q
, rq
->bio
, sglist
, &sg
);
441 if (unlikely(rq
->rq_flags
& RQF_COPY_USER
) &&
442 (blk_rq_bytes(rq
) & q
->dma_pad_mask
)) {
443 unsigned int pad_len
=
444 (q
->dma_pad_mask
& ~blk_rq_bytes(rq
)) + 1;
446 sg
->length
+= pad_len
;
447 rq
->extra_len
+= pad_len
;
450 if (q
->dma_drain_size
&& q
->dma_drain_needed(rq
)) {
451 if (op_is_write(req_op(rq
)))
452 memset(q
->dma_drain_buffer
, 0, q
->dma_drain_size
);
456 sg_set_page(sg
, virt_to_page(q
->dma_drain_buffer
),
458 ((unsigned long)q
->dma_drain_buffer
) &
461 rq
->extra_len
+= q
->dma_drain_size
;
468 * Something must have been wrong if the figured number of
469 * segment is bigger than number of req's physical segments
471 WARN_ON(nsegs
> blk_rq_nr_phys_segments(rq
));
475 EXPORT_SYMBOL(blk_rq_map_sg
);
477 static inline int ll_new_hw_segment(struct request_queue
*q
,
481 int nr_phys_segs
= bio_phys_segments(q
, bio
);
483 if (req
->nr_phys_segments
+ nr_phys_segs
> queue_max_segments(q
))
486 if (blk_integrity_merge_bio(q
, req
, bio
) == false)
490 * This will form the start of a new hw segment. Bump both
493 req
->nr_phys_segments
+= nr_phys_segs
;
497 req_set_nomerge(q
, req
);
501 int ll_back_merge_fn(struct request_queue
*q
, struct request
*req
,
504 if (req_gap_back_merge(req
, bio
))
506 if (blk_integrity_rq(req
) &&
507 integrity_req_gap_back_merge(req
, bio
))
509 if (blk_rq_sectors(req
) + bio_sectors(bio
) >
510 blk_rq_get_max_sectors(req
, blk_rq_pos(req
))) {
511 req_set_nomerge(q
, req
);
514 if (!bio_flagged(req
->biotail
, BIO_SEG_VALID
))
515 blk_recount_segments(q
, req
->biotail
);
516 if (!bio_flagged(bio
, BIO_SEG_VALID
))
517 blk_recount_segments(q
, bio
);
519 return ll_new_hw_segment(q
, req
, bio
);
522 int ll_front_merge_fn(struct request_queue
*q
, struct request
*req
,
526 if (req_gap_front_merge(req
, bio
))
528 if (blk_integrity_rq(req
) &&
529 integrity_req_gap_front_merge(req
, bio
))
531 if (blk_rq_sectors(req
) + bio_sectors(bio
) >
532 blk_rq_get_max_sectors(req
, bio
->bi_iter
.bi_sector
)) {
533 req_set_nomerge(q
, req
);
536 if (!bio_flagged(bio
, BIO_SEG_VALID
))
537 blk_recount_segments(q
, bio
);
538 if (!bio_flagged(req
->bio
, BIO_SEG_VALID
))
539 blk_recount_segments(q
, req
->bio
);
541 return ll_new_hw_segment(q
, req
, bio
);
545 * blk-mq uses req->special to carry normal driver per-request payload, it
546 * does not indicate a prepared command that we cannot merge with.
548 static bool req_no_special_merge(struct request
*req
)
550 struct request_queue
*q
= req
->q
;
552 return !q
->mq_ops
&& req
->special
;
555 static bool req_attempt_discard_merge(struct request_queue
*q
, struct request
*req
,
556 struct request
*next
)
558 unsigned short segments
= blk_rq_nr_discard_segments(req
);
560 if (segments
>= queue_max_discard_segments(q
))
562 if (blk_rq_sectors(req
) + bio_sectors(next
->bio
) >
563 blk_rq_get_max_sectors(req
, blk_rq_pos(req
)))
566 req
->nr_phys_segments
= segments
+ blk_rq_nr_discard_segments(next
);
569 req_set_nomerge(q
, req
);
573 static int ll_merge_requests_fn(struct request_queue
*q
, struct request
*req
,
574 struct request
*next
)
576 int total_phys_segments
;
577 unsigned int seg_size
=
578 req
->biotail
->bi_seg_back_size
+ next
->bio
->bi_seg_front_size
;
581 * First check if the either of the requests are re-queued
582 * requests. Can't merge them if they are.
584 if (req_no_special_merge(req
) || req_no_special_merge(next
))
587 if (req_gap_back_merge(req
, next
->bio
))
591 * Will it become too large?
593 if ((blk_rq_sectors(req
) + blk_rq_sectors(next
)) >
594 blk_rq_get_max_sectors(req
, blk_rq_pos(req
)))
597 total_phys_segments
= req
->nr_phys_segments
+ next
->nr_phys_segments
;
598 if (blk_phys_contig_segment(q
, req
->biotail
, next
->bio
)) {
599 if (req
->nr_phys_segments
== 1)
600 req
->bio
->bi_seg_front_size
= seg_size
;
601 if (next
->nr_phys_segments
== 1)
602 next
->biotail
->bi_seg_back_size
= seg_size
;
603 total_phys_segments
--;
606 if (total_phys_segments
> queue_max_segments(q
))
609 if (blk_integrity_merge_rq(q
, req
, next
) == false)
613 req
->nr_phys_segments
= total_phys_segments
;
618 * blk_rq_set_mixed_merge - mark a request as mixed merge
619 * @rq: request to mark as mixed merge
622 * @rq is about to be mixed merged. Make sure the attributes
623 * which can be mixed are set in each bio and mark @rq as mixed
626 void blk_rq_set_mixed_merge(struct request
*rq
)
628 unsigned int ff
= rq
->cmd_flags
& REQ_FAILFAST_MASK
;
631 if (rq
->rq_flags
& RQF_MIXED_MERGE
)
635 * @rq will no longer represent mixable attributes for all the
636 * contained bios. It will just track those of the first one.
637 * Distributes the attributs to each bio.
639 for (bio
= rq
->bio
; bio
; bio
= bio
->bi_next
) {
640 WARN_ON_ONCE((bio
->bi_opf
& REQ_FAILFAST_MASK
) &&
641 (bio
->bi_opf
& REQ_FAILFAST_MASK
) != ff
);
644 rq
->rq_flags
|= RQF_MIXED_MERGE
;
647 static void blk_account_io_merge(struct request
*req
)
649 if (blk_do_io_stat(req
)) {
650 struct hd_struct
*part
;
653 cpu
= part_stat_lock();
656 part_round_stats(req
->q
, cpu
, part
);
657 part_dec_in_flight(req
->q
, part
, rq_data_dir(req
));
665 * For non-mq, this has to be called with the request spinlock acquired.
666 * For mq with scheduling, the appropriate queue wide lock should be held.
668 static struct request
*attempt_merge(struct request_queue
*q
,
669 struct request
*req
, struct request
*next
)
672 lockdep_assert_held(q
->queue_lock
);
674 if (!rq_mergeable(req
) || !rq_mergeable(next
))
677 if (req_op(req
) != req_op(next
))
683 if (blk_rq_pos(req
) + blk_rq_sectors(req
) != blk_rq_pos(next
))
686 if (rq_data_dir(req
) != rq_data_dir(next
)
687 || req
->rq_disk
!= next
->rq_disk
688 || req_no_special_merge(next
))
691 if (req_op(req
) == REQ_OP_WRITE_SAME
&&
692 !blk_write_same_mergeable(req
->bio
, next
->bio
))
696 * Don't allow merge of different write hints, or for a hint with
699 if (req
->write_hint
!= next
->write_hint
)
703 * If we are allowed to merge, then append bio list
704 * from next to rq and release next. merge_requests_fn
705 * will have updated segment counts, update sector
706 * counts here. Handle DISCARDs separately, as they
707 * have separate settings.
709 if (req_op(req
) == REQ_OP_DISCARD
) {
710 if (!req_attempt_discard_merge(q
, req
, next
))
712 } else if (!ll_merge_requests_fn(q
, req
, next
))
716 * If failfast settings disagree or any of the two is already
717 * a mixed merge, mark both as mixed before proceeding. This
718 * makes sure that all involved bios have mixable attributes
721 if (((req
->rq_flags
| next
->rq_flags
) & RQF_MIXED_MERGE
) ||
722 (req
->cmd_flags
& REQ_FAILFAST_MASK
) !=
723 (next
->cmd_flags
& REQ_FAILFAST_MASK
)) {
724 blk_rq_set_mixed_merge(req
);
725 blk_rq_set_mixed_merge(next
);
729 * At this point we have either done a back merge
730 * or front merge. We need the smaller start_time of
731 * the merged requests to be the current request
732 * for accounting purposes.
734 if (time_after(req
->start_time
, next
->start_time
))
735 req
->start_time
= next
->start_time
;
737 req
->biotail
->bi_next
= next
->bio
;
738 req
->biotail
= next
->biotail
;
740 req
->__data_len
+= blk_rq_bytes(next
);
742 if (req_op(req
) != REQ_OP_DISCARD
)
743 elv_merge_requests(q
, req
, next
);
746 * 'next' is going away, so update stats accordingly
748 blk_account_io_merge(next
);
750 req
->ioprio
= ioprio_best(req
->ioprio
, next
->ioprio
);
751 if (blk_rq_cpu_valid(next
))
752 req
->cpu
= next
->cpu
;
755 * ownership of bio passed from next to req, return 'next' for
762 struct request
*attempt_back_merge(struct request_queue
*q
, struct request
*rq
)
764 struct request
*next
= elv_latter_request(q
, rq
);
767 return attempt_merge(q
, rq
, next
);
772 struct request
*attempt_front_merge(struct request_queue
*q
, struct request
*rq
)
774 struct request
*prev
= elv_former_request(q
, rq
);
777 return attempt_merge(q
, prev
, rq
);
782 int blk_attempt_req_merge(struct request_queue
*q
, struct request
*rq
,
783 struct request
*next
)
785 struct elevator_queue
*e
= q
->elevator
;
786 struct request
*free
;
788 if (!e
->uses_mq
&& e
->type
->ops
.sq
.elevator_allow_rq_merge_fn
)
789 if (!e
->type
->ops
.sq
.elevator_allow_rq_merge_fn(q
, rq
, next
))
792 free
= attempt_merge(q
, rq
, next
);
794 __blk_put_request(q
, free
);
801 bool blk_rq_merge_ok(struct request
*rq
, struct bio
*bio
)
803 if (!rq_mergeable(rq
) || !bio_mergeable(bio
))
806 if (req_op(rq
) != bio_op(bio
))
809 /* different data direction or already started, don't merge */
810 if (bio_data_dir(bio
) != rq_data_dir(rq
))
813 /* must be same device and not a special request */
814 if (rq
->rq_disk
!= bio
->bi_disk
|| req_no_special_merge(rq
))
817 /* only merge integrity protected bio into ditto rq */
818 if (blk_integrity_merge_bio(rq
->q
, rq
, bio
) == false)
821 /* must be using the same buffer */
822 if (req_op(rq
) == REQ_OP_WRITE_SAME
&&
823 !blk_write_same_mergeable(rq
->bio
, bio
))
827 * Don't allow merge of different write hints, or for a hint with
830 if (rq
->write_hint
!= bio
->bi_write_hint
)
836 enum elv_merge
blk_try_merge(struct request
*rq
, struct bio
*bio
)
838 if (req_op(rq
) == REQ_OP_DISCARD
&&
839 queue_max_discard_segments(rq
->q
) > 1)
840 return ELEVATOR_DISCARD_MERGE
;
841 else if (blk_rq_pos(rq
) + blk_rq_sectors(rq
) == bio
->bi_iter
.bi_sector
)
842 return ELEVATOR_BACK_MERGE
;
843 else if (blk_rq_pos(rq
) - bio_sectors(bio
) == bio
->bi_iter
.bi_sector
)
844 return ELEVATOR_FRONT_MERGE
;
845 return ELEVATOR_NO_MERGE
;