1b2441318SGreg Kroah-Hartman // SPDX-License-Identifier: GPL-2.0 2d6d48196SJens Axboe /* 3d6d48196SJens Axboe * Functions related to segment and merge handling 4d6d48196SJens Axboe */ 5d6d48196SJens Axboe #include <linux/kernel.h> 6d6d48196SJens Axboe #include <linux/module.h> 7d6d48196SJens Axboe #include <linux/bio.h> 8d6d48196SJens Axboe #include <linux/blkdev.h> 9fe45e630SChristoph Hellwig #include <linux/blk-integrity.h> 10d6d48196SJens Axboe #include <linux/scatterlist.h> 1182d981d4SChristoph Hellwig #include <linux/part_stat.h> 126b2b0459STejun Heo #include <linux/blk-cgroup.h> 13d6d48196SJens Axboe 14cda22646SMike Krinkin #include <trace/events/block.h> 15cda22646SMike Krinkin 16d6d48196SJens Axboe #include "blk.h" 172aa7745bSChristoph Hellwig #include "blk-mq-sched.h" 188e756373SBaolin Wang #include "blk-rq-qos.h" 19a7b36ee6SJens Axboe #include "blk-throttle.h" 20d6d48196SJens Axboe 21ff18d77bSChristoph Hellwig static inline void bio_get_first_bvec(struct bio *bio, struct bio_vec *bv) 22ff18d77bSChristoph Hellwig { 23ff18d77bSChristoph Hellwig *bv = mp_bvec_iter_bvec(bio->bi_io_vec, bio->bi_iter); 24ff18d77bSChristoph Hellwig } 25ff18d77bSChristoph Hellwig 26ff18d77bSChristoph Hellwig static inline void bio_get_last_bvec(struct bio *bio, struct bio_vec *bv) 27ff18d77bSChristoph Hellwig { 28ff18d77bSChristoph Hellwig struct bvec_iter iter = bio->bi_iter; 29ff18d77bSChristoph Hellwig int idx; 30ff18d77bSChristoph Hellwig 31ff18d77bSChristoph Hellwig bio_get_first_bvec(bio, bv); 32ff18d77bSChristoph Hellwig if (bv->bv_len == bio->bi_iter.bi_size) 33ff18d77bSChristoph Hellwig return; /* this bio only has a single bvec */ 34ff18d77bSChristoph Hellwig 35ff18d77bSChristoph Hellwig bio_advance_iter(bio, &iter, iter.bi_size); 36ff18d77bSChristoph Hellwig 37ff18d77bSChristoph Hellwig if (!iter.bi_bvec_done) 38ff18d77bSChristoph Hellwig idx = iter.bi_idx - 1; 39ff18d77bSChristoph Hellwig else /* in the middle of bvec */ 40ff18d77bSChristoph Hellwig idx = iter.bi_idx; 41ff18d77bSChristoph Hellwig 42ff18d77bSChristoph Hellwig *bv = bio->bi_io_vec[idx]; 43ff18d77bSChristoph Hellwig 44ff18d77bSChristoph Hellwig /* 45ff18d77bSChristoph Hellwig * iter.bi_bvec_done records actual length of the last bvec 46ff18d77bSChristoph Hellwig * if this bio ends in the middle of one io vector 47ff18d77bSChristoph Hellwig */ 48ff18d77bSChristoph Hellwig if (iter.bi_bvec_done) 49ff18d77bSChristoph Hellwig bv->bv_len = iter.bi_bvec_done; 50ff18d77bSChristoph Hellwig } 51ff18d77bSChristoph Hellwig 52e9907009SChristoph Hellwig static inline bool bio_will_gap(struct request_queue *q, 53e9907009SChristoph Hellwig struct request *prev_rq, struct bio *prev, struct bio *next) 54e9907009SChristoph Hellwig { 55e9907009SChristoph Hellwig struct bio_vec pb, nb; 56e9907009SChristoph Hellwig 57e9907009SChristoph Hellwig if (!bio_has_data(prev) || !queue_virt_boundary(q)) 58e9907009SChristoph Hellwig return false; 59e9907009SChristoph Hellwig 60e9907009SChristoph Hellwig /* 61e9907009SChristoph Hellwig * Don't merge if the 1st bio starts with non-zero offset, otherwise it 62e9907009SChristoph Hellwig * is quite difficult to respect the sg gap limit. We work hard to 63e9907009SChristoph Hellwig * merge a huge number of small single bios in case of mkfs. 64e9907009SChristoph Hellwig */ 65e9907009SChristoph Hellwig if (prev_rq) 66e9907009SChristoph Hellwig bio_get_first_bvec(prev_rq->bio, &pb); 67e9907009SChristoph Hellwig else 68e9907009SChristoph Hellwig bio_get_first_bvec(prev, &pb); 69df376b2eSJohannes Thumshirn if (pb.bv_offset & queue_virt_boundary(q)) 70e9907009SChristoph Hellwig return true; 71e9907009SChristoph Hellwig 72e9907009SChristoph Hellwig /* 73e9907009SChristoph Hellwig * We don't need to worry about the situation that the merged segment 74e9907009SChristoph Hellwig * ends in unaligned virt boundary: 75e9907009SChristoph Hellwig * 76e9907009SChristoph Hellwig * - if 'pb' ends aligned, the merged segment ends aligned 77e9907009SChristoph Hellwig * - if 'pb' ends unaligned, the next bio must include 78e9907009SChristoph Hellwig * one single bvec of 'nb', otherwise the 'nb' can't 79e9907009SChristoph Hellwig * merge with 'pb' 80e9907009SChristoph Hellwig */ 81e9907009SChristoph Hellwig bio_get_last_bvec(prev, &pb); 82e9907009SChristoph Hellwig bio_get_first_bvec(next, &nb); 83200a9affSChristoph Hellwig if (biovec_phys_mergeable(q, &pb, &nb)) 84e9907009SChristoph Hellwig return false; 85e9907009SChristoph Hellwig return __bvec_gap_to_prev(q, &pb, nb.bv_offset); 86e9907009SChristoph Hellwig } 87e9907009SChristoph Hellwig 88e9907009SChristoph Hellwig static inline bool req_gap_back_merge(struct request *req, struct bio *bio) 89e9907009SChristoph Hellwig { 90e9907009SChristoph Hellwig return bio_will_gap(req->q, req, req->biotail, bio); 91e9907009SChristoph Hellwig } 92e9907009SChristoph Hellwig 93e9907009SChristoph Hellwig static inline bool req_gap_front_merge(struct request *req, struct bio *bio) 94e9907009SChristoph Hellwig { 95e9907009SChristoph Hellwig return bio_will_gap(req->q, NULL, bio, req->bio); 96e9907009SChristoph Hellwig } 97e9907009SChristoph Hellwig 985a97806fSChristoph Hellwig static struct bio *bio_split_discard(struct bio *bio, struct request_queue *q, 995a97806fSChristoph Hellwig unsigned *nsegs, struct bio_set *bs) 10054efd50bSKent Overstreet { 10154efd50bSKent Overstreet unsigned int max_discard_sectors, granularity; 10254efd50bSKent Overstreet int alignment; 10354efd50bSKent Overstreet sector_t tmp; 10454efd50bSKent Overstreet unsigned split_sectors; 10554efd50bSKent Overstreet 106bdced438SMing Lei *nsegs = 1; 107bdced438SMing Lei 10854efd50bSKent Overstreet /* Zero-sector (unknown) and one-sector granularities are the same. */ 10954efd50bSKent Overstreet granularity = max(q->limits.discard_granularity >> 9, 1U); 11054efd50bSKent Overstreet 1111adfc5e4SMing Lei max_discard_sectors = min(q->limits.max_discard_sectors, 1121adfc5e4SMing Lei bio_allowed_max_sectors(q)); 11354efd50bSKent Overstreet max_discard_sectors -= max_discard_sectors % granularity; 11454efd50bSKent Overstreet 11554efd50bSKent Overstreet if (unlikely(!max_discard_sectors)) { 11654efd50bSKent Overstreet /* XXX: warn */ 11754efd50bSKent Overstreet return NULL; 11854efd50bSKent Overstreet } 11954efd50bSKent Overstreet 12054efd50bSKent Overstreet if (bio_sectors(bio) <= max_discard_sectors) 12154efd50bSKent Overstreet return NULL; 12254efd50bSKent Overstreet 12354efd50bSKent Overstreet split_sectors = max_discard_sectors; 12454efd50bSKent Overstreet 12554efd50bSKent Overstreet /* 12654efd50bSKent Overstreet * If the next starting sector would be misaligned, stop the discard at 12754efd50bSKent Overstreet * the previous aligned sector. 12854efd50bSKent Overstreet */ 12954efd50bSKent Overstreet alignment = (q->limits.discard_alignment >> 9) % granularity; 13054efd50bSKent Overstreet 13154efd50bSKent Overstreet tmp = bio->bi_iter.bi_sector + split_sectors - alignment; 13254efd50bSKent Overstreet tmp = sector_div(tmp, granularity); 13354efd50bSKent Overstreet 13454efd50bSKent Overstreet if (split_sectors > tmp) 13554efd50bSKent Overstreet split_sectors -= tmp; 13654efd50bSKent Overstreet 13754efd50bSKent Overstreet return bio_split(bio, split_sectors, GFP_NOIO, bs); 13854efd50bSKent Overstreet } 13954efd50bSKent Overstreet 1405a97806fSChristoph Hellwig static struct bio *bio_split_write_zeroes(struct bio *bio, 1415a97806fSChristoph Hellwig struct request_queue *q, unsigned *nsegs, struct bio_set *bs) 142885fa13fSChristoph Hellwig { 143d665e12aSChristoph Hellwig *nsegs = 0; 144885fa13fSChristoph Hellwig 145885fa13fSChristoph Hellwig if (!q->limits.max_write_zeroes_sectors) 146885fa13fSChristoph Hellwig return NULL; 147885fa13fSChristoph Hellwig 148885fa13fSChristoph Hellwig if (bio_sectors(bio) <= q->limits.max_write_zeroes_sectors) 149885fa13fSChristoph Hellwig return NULL; 150885fa13fSChristoph Hellwig 151885fa13fSChristoph Hellwig return bio_split(bio, q->limits.max_write_zeroes_sectors, GFP_NOIO, bs); 152885fa13fSChristoph Hellwig } 153885fa13fSChristoph Hellwig 1549cc5169cSBart Van Assche /* 1559cc5169cSBart Van Assche * Return the maximum number of sectors from the start of a bio that may be 1569cc5169cSBart Van Assche * submitted as a single request to a block device. If enough sectors remain, 1579cc5169cSBart Van Assche * align the end to the physical block size. Otherwise align the end to the 1589cc5169cSBart Van Assche * logical block size. This approach minimizes the number of non-aligned 1599cc5169cSBart Van Assche * requests that are submitted to a block device if the start of a bio is not 1609cc5169cSBart Van Assche * aligned to a physical block boundary. 1619cc5169cSBart Van Assche */ 1625a97806fSChristoph Hellwig static inline unsigned get_max_io_size(struct bio *bio, 1635a97806fSChristoph Hellwig struct request_queue *q) 164d0e5fbb0SMing Lei { 1659cc5169cSBart Van Assche unsigned pbs = queue_physical_block_size(q) >> SECTOR_SHIFT; 1669cc5169cSBart Van Assche unsigned lbs = queue_logical_block_size(q) >> SECTOR_SHIFT; 167efef739dSChristoph Hellwig unsigned max_sectors = queue_max_sectors(q), start, end; 168d0e5fbb0SMing Lei 169efef739dSChristoph Hellwig if (q->limits.chunk_sectors) { 170efef739dSChristoph Hellwig max_sectors = min(max_sectors, 171efef739dSChristoph Hellwig blk_chunk_sectors_left(bio->bi_iter.bi_sector, 172efef739dSChristoph Hellwig q->limits.chunk_sectors)); 173efef739dSChristoph Hellwig } 174d0e5fbb0SMing Lei 17584613bedSChristoph Hellwig start = bio->bi_iter.bi_sector & (pbs - 1); 17684613bedSChristoph Hellwig end = (start + max_sectors) & ~(pbs - 1); 17784613bedSChristoph Hellwig if (end > start) 17884613bedSChristoph Hellwig return end - start; 17984613bedSChristoph Hellwig return max_sectors & ~(lbs - 1); 180d0e5fbb0SMing Lei } 181d0e5fbb0SMing Lei 182429120f3SMing Lei static inline unsigned get_max_segment_size(const struct request_queue *q, 183429120f3SMing Lei struct page *start_page, 184429120f3SMing Lei unsigned long offset) 185dcebd755SMing Lei { 186dcebd755SMing Lei unsigned long mask = queue_segment_boundary(q); 187dcebd755SMing Lei 188429120f3SMing Lei offset = mask & (page_to_phys(start_page) + offset); 1894a2f704eSMing Lei 1904a2f704eSMing Lei /* 1914a2f704eSMing Lei * overflow may be triggered in case of zero page physical address 1924a2f704eSMing Lei * on 32bit arch, use queue's max segment size when that happens. 1934a2f704eSMing Lei */ 1944a2f704eSMing Lei return min_not_zero(mask - offset + 1, 1954a2f704eSMing Lei (unsigned long)queue_max_segment_size(q)); 196dcebd755SMing Lei } 197dcebd755SMing Lei 198708b25b3SBart Van Assche /** 199708b25b3SBart Van Assche * bvec_split_segs - verify whether or not a bvec should be split in the middle 200708b25b3SBart Van Assche * @q: [in] request queue associated with the bio associated with @bv 201708b25b3SBart Van Assche * @bv: [in] bvec to examine 202708b25b3SBart Van Assche * @nsegs: [in,out] Number of segments in the bio being built. Incremented 203708b25b3SBart Van Assche * by the number of segments from @bv that may be appended to that 204708b25b3SBart Van Assche * bio without exceeding @max_segs 20567927d22SKeith Busch * @bytes: [in,out] Number of bytes in the bio being built. Incremented 20667927d22SKeith Busch * by the number of bytes from @bv that may be appended to that 20767927d22SKeith Busch * bio without exceeding @max_bytes 208708b25b3SBart Van Assche * @max_segs: [in] upper bound for *@nsegs 20967927d22SKeith Busch * @max_bytes: [in] upper bound for *@bytes 210708b25b3SBart Van Assche * 211708b25b3SBart Van Assche * When splitting a bio, it can happen that a bvec is encountered that is too 212708b25b3SBart Van Assche * big to fit in a single segment and hence that it has to be split in the 213708b25b3SBart Van Assche * middle. This function verifies whether or not that should happen. The value 214708b25b3SBart Van Assche * %true is returned if and only if appending the entire @bv to a bio with 215708b25b3SBart Van Assche * *@nsegs segments and *@sectors sectors would make that bio unacceptable for 216708b25b3SBart Van Assche * the block driver. 217dcebd755SMing Lei */ 218af2c68feSBart Van Assche static bool bvec_split_segs(const struct request_queue *q, 219af2c68feSBart Van Assche const struct bio_vec *bv, unsigned *nsegs, 22067927d22SKeith Busch unsigned *bytes, unsigned max_segs, 22167927d22SKeith Busch unsigned max_bytes) 222dcebd755SMing Lei { 22367927d22SKeith Busch unsigned max_len = min(max_bytes, UINT_MAX) - *bytes; 224708b25b3SBart Van Assche unsigned len = min(bv->bv_len, max_len); 225dcebd755SMing Lei unsigned total_len = 0; 226ff9811b3SBart Van Assche unsigned seg_size = 0; 227dcebd755SMing Lei 228ff9811b3SBart Van Assche while (len && *nsegs < max_segs) { 229429120f3SMing Lei seg_size = get_max_segment_size(q, bv->bv_page, 230429120f3SMing Lei bv->bv_offset + total_len); 231dcebd755SMing Lei seg_size = min(seg_size, len); 232dcebd755SMing Lei 233ff9811b3SBart Van Assche (*nsegs)++; 234dcebd755SMing Lei total_len += seg_size; 235dcebd755SMing Lei len -= seg_size; 236dcebd755SMing Lei 237dcebd755SMing Lei if ((bv->bv_offset + total_len) & queue_virt_boundary(q)) 238dcebd755SMing Lei break; 239dcebd755SMing Lei } 240dcebd755SMing Lei 24167927d22SKeith Busch *bytes += total_len; 242dcebd755SMing Lei 243708b25b3SBart Van Assche /* tell the caller to split the bvec if it is too big to fit */ 244708b25b3SBart Van Assche return len > 0 || bv->bv_len > max_len; 245dcebd755SMing Lei } 246dcebd755SMing Lei 247dad77584SBart Van Assche /** 2485a97806fSChristoph Hellwig * bio_split_rw - split a bio in two bios 249dad77584SBart Van Assche * @bio: [in] bio to be split 2505a97806fSChristoph Hellwig * @q: [in] request queue pointer 251dad77584SBart Van Assche * @segs: [out] number of segments in the bio with the first half of the sectors 2525a97806fSChristoph Hellwig * @bs: [in] bio set to allocate the clone from 253*a85b3637SChristoph Hellwig * @max_bytes: [in] maximum number of bytes per bio 254dad77584SBart Van Assche * 255dad77584SBart Van Assche * Clone @bio, update the bi_iter of the clone to represent the first sectors 256dad77584SBart Van Assche * of @bio and update @bio->bi_iter to represent the remaining sectors. The 257dad77584SBart Van Assche * following is guaranteed for the cloned bio: 258*a85b3637SChristoph Hellwig * - That it has at most @max_bytes worth of data 259dad77584SBart Van Assche * - That it has at most queue_max_segments(@q) segments. 260dad77584SBart Van Assche * 261dad77584SBart Van Assche * Except for discard requests the cloned bio will point at the bi_io_vec of 262dad77584SBart Van Assche * the original bio. It is the responsibility of the caller to ensure that the 263dad77584SBart Van Assche * original bio is not freed before the cloned bio. The caller is also 264dad77584SBart Van Assche * responsible for ensuring that @bs is only destroyed after processing of the 265dad77584SBart Van Assche * split bio has finished. 266dad77584SBart Van Assche */ 2675a97806fSChristoph Hellwig static struct bio *bio_split_rw(struct bio *bio, struct request_queue *q, 268*a85b3637SChristoph Hellwig unsigned *segs, struct bio_set *bs, unsigned max_bytes) 26954efd50bSKent Overstreet { 2705014c311SJens Axboe struct bio_vec bv, bvprv, *bvprvp = NULL; 27154efd50bSKent Overstreet struct bvec_iter iter; 27267927d22SKeith Busch unsigned nsegs = 0, bytes = 0; 27305b700baSMing Lei const unsigned max_segs = queue_max_segments(q); 27454efd50bSKent Overstreet 275dcebd755SMing Lei bio_for_each_bvec(bv, bio, iter) { 27654efd50bSKent Overstreet /* 27754efd50bSKent Overstreet * If the queue doesn't support SG gaps and adding this 27854efd50bSKent Overstreet * offset would create a gap, disallow it. 27954efd50bSKent Overstreet */ 2805014c311SJens Axboe if (bvprvp && bvec_gap_to_prev(q, bvprvp, bv.bv_offset)) 28154efd50bSKent Overstreet goto split; 28254efd50bSKent Overstreet 28305b700baSMing Lei if (nsegs < max_segs && 28467927d22SKeith Busch bytes + bv.bv_len <= max_bytes && 285708b25b3SBart Van Assche bv.bv_offset + bv.bv_len <= PAGE_SIZE) { 286708b25b3SBart Van Assche nsegs++; 28767927d22SKeith Busch bytes += bv.bv_len; 28867927d22SKeith Busch } else if (bvec_split_segs(q, &bv, &nsegs, &bytes, max_segs, 28967927d22SKeith Busch max_bytes)) { 290e36f6204SKeith Busch goto split; 291e36f6204SKeith Busch } 292e36f6204SKeith Busch 29354efd50bSKent Overstreet bvprv = bv; 294578270bfSMing Lei bvprvp = &bvprv; 29554efd50bSKent Overstreet } 29654efd50bSKent Overstreet 297d627065dSChristoph Hellwig *segs = nsegs; 298d627065dSChristoph Hellwig return NULL; 29954efd50bSKent Overstreet split: 300bdced438SMing Lei *segs = nsegs; 301cc29e1bfSJeffle Xu 302cc29e1bfSJeffle Xu /* 30367927d22SKeith Busch * Individual bvecs might not be logical block aligned. Round down the 30467927d22SKeith Busch * split size so that each bio is properly block size aligned, even if 30567927d22SKeith Busch * we do not use the full hardware limits. 30667927d22SKeith Busch */ 30767927d22SKeith Busch bytes = ALIGN_DOWN(bytes, queue_logical_block_size(q)); 30867927d22SKeith Busch 30967927d22SKeith Busch /* 310cc29e1bfSJeffle Xu * Bio splitting may cause subtle trouble such as hang when doing sync 311cc29e1bfSJeffle Xu * iopoll in direct IO routine. Given performance gain of iopoll for 312cc29e1bfSJeffle Xu * big IO can be trival, disable iopoll when split needed. 313cc29e1bfSJeffle Xu */ 3146ce913feSChristoph Hellwig bio_clear_polled(bio); 31567927d22SKeith Busch return bio_split(bio, bytes >> SECTOR_SHIFT, GFP_NOIO, bs); 31654efd50bSKent Overstreet } 31754efd50bSKent Overstreet 318dad77584SBart Van Assche /** 3195a97806fSChristoph Hellwig * __bio_split_to_limits - split a bio to fit the queue limits 3205a97806fSChristoph Hellwig * @bio: bio to be split 3215a97806fSChristoph Hellwig * @q: request_queue new bio is being queued at 3225a97806fSChristoph Hellwig * @nr_segs: returns the number of segments in the returned bio 323dad77584SBart Van Assche * 3245a97806fSChristoph Hellwig * Check if @bio needs splitting based on the queue limits, and if so split off 3255a97806fSChristoph Hellwig * a bio fitting the limits from the beginning of @bio and return it. @bio is 3265a97806fSChristoph Hellwig * shortened to the remainder and re-submitted. 3275a97806fSChristoph Hellwig * 3285a97806fSChristoph Hellwig * The split bio is allocated from @q->bio_split, which is provided by the 3295a97806fSChristoph Hellwig * block layer. 330dad77584SBart Van Assche */ 3315a97806fSChristoph Hellwig struct bio *__bio_split_to_limits(struct bio *bio, struct request_queue *q, 332abd45c15SJens Axboe unsigned int *nr_segs) 33354efd50bSKent Overstreet { 33446754bd0SChristoph Hellwig struct bio_set *bs = &bio->bi_bdev->bd_disk->bio_split; 3355a97806fSChristoph Hellwig struct bio *split; 33654efd50bSKent Overstreet 3375a97806fSChristoph Hellwig switch (bio_op(bio)) { 3387afafc8aSAdrian Hunter case REQ_OP_DISCARD: 3397afafc8aSAdrian Hunter case REQ_OP_SECURE_ERASE: 34046754bd0SChristoph Hellwig split = bio_split_discard(bio, q, nr_segs, bs); 3417afafc8aSAdrian Hunter break; 342a6f0788eSChaitanya Kulkarni case REQ_OP_WRITE_ZEROES: 34346754bd0SChristoph Hellwig split = bio_split_write_zeroes(bio, q, nr_segs, bs); 344a6f0788eSChaitanya Kulkarni break; 3457afafc8aSAdrian Hunter default: 346*a85b3637SChristoph Hellwig split = bio_split_rw(bio, q, nr_segs, bs, 347*a85b3637SChristoph Hellwig get_max_io_size(bio, q) << SECTOR_SHIFT); 3487afafc8aSAdrian Hunter break; 3497afafc8aSAdrian Hunter } 350bdced438SMing Lei 35154efd50bSKent Overstreet if (split) { 3526ac45aebSMing Lei /* there isn't chance to merge the splitted bio */ 3531eff9d32SJens Axboe split->bi_opf |= REQ_NOMERGE; 3546ac45aebSMing Lei 355957a2b34SMuchun Song blkcg_bio_issue_init(split); 3565a97806fSChristoph Hellwig bio_chain(split, bio); 3575a97806fSChristoph Hellwig trace_block_split(split, bio->bi_iter.bi_sector); 3585a97806fSChristoph Hellwig submit_bio_noacct(bio); 3595a97806fSChristoph Hellwig return split; 36054efd50bSKent Overstreet } 3615a97806fSChristoph Hellwig return bio; 36254efd50bSKent Overstreet } 36314ccb66bSChristoph Hellwig 364dad77584SBart Van Assche /** 3655a97806fSChristoph Hellwig * bio_split_to_limits - split a bio to fit the queue limits 3665a97806fSChristoph Hellwig * @bio: bio to be split 367dad77584SBart Van Assche * 3685a97806fSChristoph Hellwig * Check if @bio needs splitting based on the queue limits of @bio->bi_bdev, and 3695a97806fSChristoph Hellwig * if so split off a bio fitting the limits from the beginning of @bio and 3705a97806fSChristoph Hellwig * return it. @bio is shortened to the remainder and re-submitted. 3715a97806fSChristoph Hellwig * 3725a97806fSChristoph Hellwig * The split bio is allocated from @q->bio_split, which is provided by the 3735a97806fSChristoph Hellwig * block layer. 374dad77584SBart Van Assche */ 3755a97806fSChristoph Hellwig struct bio *bio_split_to_limits(struct bio *bio) 37614ccb66bSChristoph Hellwig { 3775a97806fSChristoph Hellwig struct request_queue *q = bdev_get_queue(bio->bi_bdev); 37814ccb66bSChristoph Hellwig unsigned int nr_segs; 37914ccb66bSChristoph Hellwig 3805a97806fSChristoph Hellwig if (bio_may_exceed_limits(bio, q)) 3815a97806fSChristoph Hellwig return __bio_split_to_limits(bio, q, &nr_segs); 3825a97806fSChristoph Hellwig return bio; 38314ccb66bSChristoph Hellwig } 3845a97806fSChristoph Hellwig EXPORT_SYMBOL(bio_split_to_limits); 38554efd50bSKent Overstreet 386e9cd19c0SChristoph Hellwig unsigned int blk_recalc_rq_segments(struct request *rq) 387d6d48196SJens Axboe { 3886869875fSChristoph Hellwig unsigned int nr_phys_segs = 0; 38967927d22SKeith Busch unsigned int bytes = 0; 390e9cd19c0SChristoph Hellwig struct req_iterator iter; 3916869875fSChristoph Hellwig struct bio_vec bv; 392d6d48196SJens Axboe 393e9cd19c0SChristoph Hellwig if (!rq->bio) 3941e428079SJens Axboe return 0; 395d6d48196SJens Axboe 396e9cd19c0SChristoph Hellwig switch (bio_op(rq->bio)) { 397a6f0788eSChaitanya Kulkarni case REQ_OP_DISCARD: 398a6f0788eSChaitanya Kulkarni case REQ_OP_SECURE_ERASE: 399a958937fSDavid Jeffery if (queue_max_discard_segments(rq->q) > 1) { 400a958937fSDavid Jeffery struct bio *bio = rq->bio; 401a958937fSDavid Jeffery 402a958937fSDavid Jeffery for_each_bio(bio) 403a958937fSDavid Jeffery nr_phys_segs++; 404a958937fSDavid Jeffery return nr_phys_segs; 405a958937fSDavid Jeffery } 406a958937fSDavid Jeffery return 1; 407a6f0788eSChaitanya Kulkarni case REQ_OP_WRITE_ZEROES: 408f9d03f96SChristoph Hellwig return 0; 4092d9b02beSBart Van Assche default: 4102d9b02beSBart Van Assche break; 411a6f0788eSChaitanya Kulkarni } 4125cb8850cSKent Overstreet 413e9cd19c0SChristoph Hellwig rq_for_each_bvec(bv, rq, iter) 41467927d22SKeith Busch bvec_split_segs(rq->q, &bv, &nr_phys_segs, &bytes, 415708b25b3SBart Van Assche UINT_MAX, UINT_MAX); 4161e428079SJens Axboe return nr_phys_segs; 4171e428079SJens Axboe } 4181e428079SJens Axboe 41948d7727cSMing Lei static inline struct scatterlist *blk_next_sg(struct scatterlist **sg, 420862e5a5eSMing Lei struct scatterlist *sglist) 421862e5a5eSMing Lei { 422862e5a5eSMing Lei if (!*sg) 423862e5a5eSMing Lei return sglist; 424862e5a5eSMing Lei 425862e5a5eSMing Lei /* 426862e5a5eSMing Lei * If the driver previously mapped a shorter list, we could see a 427862e5a5eSMing Lei * termination bit prematurely unless it fully inits the sg table 428862e5a5eSMing Lei * on each mapping. We KNOW that there must be more entries here 429862e5a5eSMing Lei * or the driver would be buggy, so force clear the termination bit 430862e5a5eSMing Lei * to avoid doing a full sg_init_table() in drivers for each command. 431862e5a5eSMing Lei */ 432862e5a5eSMing Lei sg_unmark_end(*sg); 433862e5a5eSMing Lei return sg_next(*sg); 434862e5a5eSMing Lei } 435862e5a5eSMing Lei 436862e5a5eSMing Lei static unsigned blk_bvec_map_sg(struct request_queue *q, 437862e5a5eSMing Lei struct bio_vec *bvec, struct scatterlist *sglist, 438862e5a5eSMing Lei struct scatterlist **sg) 439862e5a5eSMing Lei { 440862e5a5eSMing Lei unsigned nbytes = bvec->bv_len; 4418a96a0e4SChristoph Hellwig unsigned nsegs = 0, total = 0; 442862e5a5eSMing Lei 443862e5a5eSMing Lei while (nbytes > 0) { 4448a96a0e4SChristoph Hellwig unsigned offset = bvec->bv_offset + total; 445429120f3SMing Lei unsigned len = min(get_max_segment_size(q, bvec->bv_page, 446429120f3SMing Lei offset), nbytes); 447f9f76879SChristoph Hellwig struct page *page = bvec->bv_page; 448f9f76879SChristoph Hellwig 449f9f76879SChristoph Hellwig /* 450f9f76879SChristoph Hellwig * Unfortunately a fair number of drivers barf on scatterlists 451f9f76879SChristoph Hellwig * that have an offset larger than PAGE_SIZE, despite other 452f9f76879SChristoph Hellwig * subsystems dealing with that invariant just fine. For now 453f9f76879SChristoph Hellwig * stick to the legacy format where we never present those from 454f9f76879SChristoph Hellwig * the block layer, but the code below should be removed once 455f9f76879SChristoph Hellwig * these offenders (mostly MMC/SD drivers) are fixed. 456f9f76879SChristoph Hellwig */ 457f9f76879SChristoph Hellwig page += (offset >> PAGE_SHIFT); 458f9f76879SChristoph Hellwig offset &= ~PAGE_MASK; 459862e5a5eSMing Lei 460862e5a5eSMing Lei *sg = blk_next_sg(sg, sglist); 461f9f76879SChristoph Hellwig sg_set_page(*sg, page, len, offset); 462862e5a5eSMing Lei 4638a96a0e4SChristoph Hellwig total += len; 4648a96a0e4SChristoph Hellwig nbytes -= len; 465862e5a5eSMing Lei nsegs++; 466862e5a5eSMing Lei } 467862e5a5eSMing Lei 468862e5a5eSMing Lei return nsegs; 469862e5a5eSMing Lei } 470862e5a5eSMing Lei 47116e3e418SMing Lei static inline int __blk_bvec_map_sg(struct bio_vec bv, 47216e3e418SMing Lei struct scatterlist *sglist, struct scatterlist **sg) 47316e3e418SMing Lei { 47416e3e418SMing Lei *sg = blk_next_sg(sg, sglist); 47516e3e418SMing Lei sg_set_page(*sg, bv.bv_page, bv.bv_len, bv.bv_offset); 47616e3e418SMing Lei return 1; 47716e3e418SMing Lei } 47816e3e418SMing Lei 479f6970f83SMing Lei /* only try to merge bvecs into one sg if they are from two bios */ 480f6970f83SMing Lei static inline bool 481f6970f83SMing Lei __blk_segment_map_sg_merge(struct request_queue *q, struct bio_vec *bvec, 482f6970f83SMing Lei struct bio_vec *bvprv, struct scatterlist **sg) 483963ab9e5SAsias He { 484963ab9e5SAsias He 485963ab9e5SAsias He int nbytes = bvec->bv_len; 486963ab9e5SAsias He 487f6970f83SMing Lei if (!*sg) 488f6970f83SMing Lei return false; 489f6970f83SMing Lei 490b4b6cb61SMing Lei if ((*sg)->length + nbytes > queue_max_segment_size(q)) 491f6970f83SMing Lei return false; 492f6970f83SMing Lei 4933dccdae5SChristoph Hellwig if (!biovec_phys_mergeable(q, bvprv, bvec)) 494f6970f83SMing Lei return false; 495963ab9e5SAsias He 496963ab9e5SAsias He (*sg)->length += nbytes; 497f6970f83SMing Lei 498f6970f83SMing Lei return true; 499963ab9e5SAsias He } 500963ab9e5SAsias He 5015cb8850cSKent Overstreet static int __blk_bios_map_sg(struct request_queue *q, struct bio *bio, 5025cb8850cSKent Overstreet struct scatterlist *sglist, 5035cb8850cSKent Overstreet struct scatterlist **sg) 5045cb8850cSKent Overstreet { 5053f649ab7SKees Cook struct bio_vec bvec, bvprv = { NULL }; 5065cb8850cSKent Overstreet struct bvec_iter iter; 50738417468SChristoph Hellwig int nsegs = 0; 508f6970f83SMing Lei bool new_bio = false; 5095cb8850cSKent Overstreet 510f6970f83SMing Lei for_each_bio(bio) { 511f6970f83SMing Lei bio_for_each_bvec(bvec, bio, iter) { 512f6970f83SMing Lei /* 513f6970f83SMing Lei * Only try to merge bvecs from two bios given we 514f6970f83SMing Lei * have done bio internal merge when adding pages 515f6970f83SMing Lei * to bio 516f6970f83SMing Lei */ 517f6970f83SMing Lei if (new_bio && 518f6970f83SMing Lei __blk_segment_map_sg_merge(q, &bvec, &bvprv, sg)) 519f6970f83SMing Lei goto next_bvec; 520f6970f83SMing Lei 521f6970f83SMing Lei if (bvec.bv_offset + bvec.bv_len <= PAGE_SIZE) 522f6970f83SMing Lei nsegs += __blk_bvec_map_sg(bvec, sglist, sg); 523f6970f83SMing Lei else 524f6970f83SMing Lei nsegs += blk_bvec_map_sg(q, &bvec, sglist, sg); 525f6970f83SMing Lei next_bvec: 526f6970f83SMing Lei new_bio = false; 527f6970f83SMing Lei } 528b21e11c5SMing Lei if (likely(bio->bi_iter.bi_size)) { 529f6970f83SMing Lei bvprv = bvec; 530f6970f83SMing Lei new_bio = true; 531f6970f83SMing Lei } 532b21e11c5SMing Lei } 5335cb8850cSKent Overstreet 5345cb8850cSKent Overstreet return nsegs; 5355cb8850cSKent Overstreet } 5365cb8850cSKent Overstreet 537d6d48196SJens Axboe /* 538d6d48196SJens Axboe * map a request to scatterlist, return number of sg entries setup. Caller 539d6d48196SJens Axboe * must make sure sg can hold rq->nr_phys_segments entries 540d6d48196SJens Axboe */ 54189de1504SChristoph Hellwig int __blk_rq_map_sg(struct request_queue *q, struct request *rq, 54289de1504SChristoph Hellwig struct scatterlist *sglist, struct scatterlist **last_sg) 543d6d48196SJens Axboe { 5445cb8850cSKent Overstreet int nsegs = 0; 545d6d48196SJens Axboe 546f9d03f96SChristoph Hellwig if (rq->rq_flags & RQF_SPECIAL_PAYLOAD) 54789de1504SChristoph Hellwig nsegs = __blk_bvec_map_sg(rq->special_vec, sglist, last_sg); 548f9d03f96SChristoph Hellwig else if (rq->bio) 54989de1504SChristoph Hellwig nsegs = __blk_bios_map_sg(q, rq->bio, sglist, last_sg); 550f18573abSFUJITA Tomonori 55189de1504SChristoph Hellwig if (*last_sg) 55289de1504SChristoph Hellwig sg_mark_end(*last_sg); 553d6d48196SJens Axboe 55412e57f59SMing Lei /* 55512e57f59SMing Lei * Something must have been wrong if the figured number of 55612e57f59SMing Lei * segment is bigger than number of req's physical segments 55712e57f59SMing Lei */ 558f9d03f96SChristoph Hellwig WARN_ON(nsegs > blk_rq_nr_phys_segments(rq)); 55912e57f59SMing Lei 560d6d48196SJens Axboe return nsegs; 561d6d48196SJens Axboe } 56289de1504SChristoph Hellwig EXPORT_SYMBOL(__blk_rq_map_sg); 563d6d48196SJens Axboe 564943b40c8SMing Lei static inline unsigned int blk_rq_get_max_segments(struct request *rq) 565943b40c8SMing Lei { 566943b40c8SMing Lei if (req_op(rq) == REQ_OP_DISCARD) 567943b40c8SMing Lei return queue_max_discard_segments(rq->q); 568943b40c8SMing Lei return queue_max_segments(rq->q); 569943b40c8SMing Lei } 570943b40c8SMing Lei 571badf7f64SChristoph Hellwig static inline unsigned int blk_rq_get_max_sectors(struct request *rq, 572badf7f64SChristoph Hellwig sector_t offset) 573badf7f64SChristoph Hellwig { 574badf7f64SChristoph Hellwig struct request_queue *q = rq->q; 575c8875190SChristoph Hellwig unsigned int max_sectors; 576badf7f64SChristoph Hellwig 577badf7f64SChristoph Hellwig if (blk_rq_is_passthrough(rq)) 578badf7f64SChristoph Hellwig return q->limits.max_hw_sectors; 579badf7f64SChristoph Hellwig 580c8875190SChristoph Hellwig max_sectors = blk_queue_get_max_sectors(q, req_op(rq)); 581badf7f64SChristoph Hellwig if (!q->limits.chunk_sectors || 582badf7f64SChristoph Hellwig req_op(rq) == REQ_OP_DISCARD || 583badf7f64SChristoph Hellwig req_op(rq) == REQ_OP_SECURE_ERASE) 584c8875190SChristoph Hellwig return max_sectors; 585c8875190SChristoph Hellwig return min(max_sectors, 586c8875190SChristoph Hellwig blk_chunk_sectors_left(offset, q->limits.chunk_sectors)); 587badf7f64SChristoph Hellwig } 588badf7f64SChristoph Hellwig 58914ccb66bSChristoph Hellwig static inline int ll_new_hw_segment(struct request *req, struct bio *bio, 59014ccb66bSChristoph Hellwig unsigned int nr_phys_segs) 591d6d48196SJens Axboe { 5926b2b0459STejun Heo if (!blk_cgroup_mergeable(req, bio)) 5936b2b0459STejun Heo goto no_merge; 5946b2b0459STejun Heo 5952705dfb2SMing Lei if (blk_integrity_merge_bio(req->q, req, bio) == false) 59613f05c8dSMartin K. Petersen goto no_merge; 59713f05c8dSMartin K. Petersen 5982705dfb2SMing Lei /* discard request merge won't add new segment */ 5992705dfb2SMing Lei if (req_op(req) == REQ_OP_DISCARD) 6002705dfb2SMing Lei return 1; 6012705dfb2SMing Lei 6022705dfb2SMing Lei if (req->nr_phys_segments + nr_phys_segs > blk_rq_get_max_segments(req)) 60313f05c8dSMartin K. Petersen goto no_merge; 604d6d48196SJens Axboe 605d6d48196SJens Axboe /* 606d6d48196SJens Axboe * This will form the start of a new hw segment. Bump both 607d6d48196SJens Axboe * counters. 608d6d48196SJens Axboe */ 609d6d48196SJens Axboe req->nr_phys_segments += nr_phys_segs; 610d6d48196SJens Axboe return 1; 61113f05c8dSMartin K. Petersen 61213f05c8dSMartin K. Petersen no_merge: 61314ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 61413f05c8dSMartin K. Petersen return 0; 615d6d48196SJens Axboe } 616d6d48196SJens Axboe 61714ccb66bSChristoph Hellwig int ll_back_merge_fn(struct request *req, struct bio *bio, unsigned int nr_segs) 618d6d48196SJens Axboe { 6195e7c4274SJens Axboe if (req_gap_back_merge(req, bio)) 6205e7c4274SJens Axboe return 0; 6217f39add3SSagi Grimberg if (blk_integrity_rq(req) && 6227f39add3SSagi Grimberg integrity_req_gap_back_merge(req, bio)) 6237f39add3SSagi Grimberg return 0; 624a892c8d5SSatya Tangirala if (!bio_crypt_ctx_back_mergeable(req, bio)) 625a892c8d5SSatya Tangirala return 0; 626f31dc1cdSMartin K. Petersen if (blk_rq_sectors(req) + bio_sectors(bio) > 62717007f39SDamien Le Moal blk_rq_get_max_sectors(req, blk_rq_pos(req))) { 62814ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 629d6d48196SJens Axboe return 0; 630d6d48196SJens Axboe } 631d6d48196SJens Axboe 63214ccb66bSChristoph Hellwig return ll_new_hw_segment(req, bio, nr_segs); 633d6d48196SJens Axboe } 634d6d48196SJens Axboe 635eda5cc99SChristoph Hellwig static int ll_front_merge_fn(struct request *req, struct bio *bio, 636eda5cc99SChristoph Hellwig unsigned int nr_segs) 637d6d48196SJens Axboe { 6385e7c4274SJens Axboe if (req_gap_front_merge(req, bio)) 6395e7c4274SJens Axboe return 0; 6407f39add3SSagi Grimberg if (blk_integrity_rq(req) && 6417f39add3SSagi Grimberg integrity_req_gap_front_merge(req, bio)) 6427f39add3SSagi Grimberg return 0; 643a892c8d5SSatya Tangirala if (!bio_crypt_ctx_front_mergeable(req, bio)) 644a892c8d5SSatya Tangirala return 0; 645f31dc1cdSMartin K. Petersen if (blk_rq_sectors(req) + bio_sectors(bio) > 64617007f39SDamien Le Moal blk_rq_get_max_sectors(req, bio->bi_iter.bi_sector)) { 64714ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 648d6d48196SJens Axboe return 0; 649d6d48196SJens Axboe } 650d6d48196SJens Axboe 65114ccb66bSChristoph Hellwig return ll_new_hw_segment(req, bio, nr_segs); 652d6d48196SJens Axboe } 653d6d48196SJens Axboe 654445251d0SJens Axboe static bool req_attempt_discard_merge(struct request_queue *q, struct request *req, 655445251d0SJens Axboe struct request *next) 656445251d0SJens Axboe { 657445251d0SJens Axboe unsigned short segments = blk_rq_nr_discard_segments(req); 658445251d0SJens Axboe 659445251d0SJens Axboe if (segments >= queue_max_discard_segments(q)) 660445251d0SJens Axboe goto no_merge; 661445251d0SJens Axboe if (blk_rq_sectors(req) + bio_sectors(next->bio) > 662445251d0SJens Axboe blk_rq_get_max_sectors(req, blk_rq_pos(req))) 663445251d0SJens Axboe goto no_merge; 664445251d0SJens Axboe 665445251d0SJens Axboe req->nr_phys_segments = segments + blk_rq_nr_discard_segments(next); 666445251d0SJens Axboe return true; 667445251d0SJens Axboe no_merge: 668445251d0SJens Axboe req_set_nomerge(q, req); 669445251d0SJens Axboe return false; 670445251d0SJens Axboe } 671445251d0SJens Axboe 672d6d48196SJens Axboe static int ll_merge_requests_fn(struct request_queue *q, struct request *req, 673d6d48196SJens Axboe struct request *next) 674d6d48196SJens Axboe { 675d6d48196SJens Axboe int total_phys_segments; 676d6d48196SJens Axboe 6775e7c4274SJens Axboe if (req_gap_back_merge(req, next->bio)) 678854fbb9cSKeith Busch return 0; 679854fbb9cSKeith Busch 680d6d48196SJens Axboe /* 681d6d48196SJens Axboe * Will it become too large? 682d6d48196SJens Axboe */ 683f31dc1cdSMartin K. Petersen if ((blk_rq_sectors(req) + blk_rq_sectors(next)) > 68417007f39SDamien Le Moal blk_rq_get_max_sectors(req, blk_rq_pos(req))) 685d6d48196SJens Axboe return 0; 686d6d48196SJens Axboe 687d6d48196SJens Axboe total_phys_segments = req->nr_phys_segments + next->nr_phys_segments; 688943b40c8SMing Lei if (total_phys_segments > blk_rq_get_max_segments(req)) 689d6d48196SJens Axboe return 0; 690d6d48196SJens Axboe 6916b2b0459STejun Heo if (!blk_cgroup_mergeable(req, next->bio)) 6926b2b0459STejun Heo return 0; 6936b2b0459STejun Heo 6944eaf99beSMartin K. Petersen if (blk_integrity_merge_rq(q, req, next) == false) 69513f05c8dSMartin K. Petersen return 0; 69613f05c8dSMartin K. Petersen 697a892c8d5SSatya Tangirala if (!bio_crypt_ctx_merge_rq(req, next)) 698a892c8d5SSatya Tangirala return 0; 699a892c8d5SSatya Tangirala 700d6d48196SJens Axboe /* Merge is OK... */ 701d6d48196SJens Axboe req->nr_phys_segments = total_phys_segments; 702d6d48196SJens Axboe return 1; 703d6d48196SJens Axboe } 704d6d48196SJens Axboe 70580a761fdSTejun Heo /** 70680a761fdSTejun Heo * blk_rq_set_mixed_merge - mark a request as mixed merge 70780a761fdSTejun Heo * @rq: request to mark as mixed merge 70880a761fdSTejun Heo * 70980a761fdSTejun Heo * Description: 71080a761fdSTejun Heo * @rq is about to be mixed merged. Make sure the attributes 71180a761fdSTejun Heo * which can be mixed are set in each bio and mark @rq as mixed 71280a761fdSTejun Heo * merged. 71380a761fdSTejun Heo */ 71480a761fdSTejun Heo void blk_rq_set_mixed_merge(struct request *rq) 71580a761fdSTejun Heo { 71616458cf3SBart Van Assche blk_opf_t ff = rq->cmd_flags & REQ_FAILFAST_MASK; 71780a761fdSTejun Heo struct bio *bio; 71880a761fdSTejun Heo 719e8064021SChristoph Hellwig if (rq->rq_flags & RQF_MIXED_MERGE) 72080a761fdSTejun Heo return; 72180a761fdSTejun Heo 72280a761fdSTejun Heo /* 72380a761fdSTejun Heo * @rq will no longer represent mixable attributes for all the 72480a761fdSTejun Heo * contained bios. It will just track those of the first one. 72580a761fdSTejun Heo * Distributes the attributs to each bio. 72680a761fdSTejun Heo */ 72780a761fdSTejun Heo for (bio = rq->bio; bio; bio = bio->bi_next) { 7281eff9d32SJens Axboe WARN_ON_ONCE((bio->bi_opf & REQ_FAILFAST_MASK) && 7291eff9d32SJens Axboe (bio->bi_opf & REQ_FAILFAST_MASK) != ff); 7301eff9d32SJens Axboe bio->bi_opf |= ff; 73180a761fdSTejun Heo } 732e8064021SChristoph Hellwig rq->rq_flags |= RQF_MIXED_MERGE; 73380a761fdSTejun Heo } 73480a761fdSTejun Heo 735b9c54f56SKonstantin Khlebnikov static void blk_account_io_merge_request(struct request *req) 73626308eabSJerome Marchand { 73726308eabSJerome Marchand if (blk_do_io_stat(req)) { 738112f158fSMike Snitzer part_stat_lock(); 739b9c54f56SKonstantin Khlebnikov part_stat_inc(req->part, merges[op_stat_group(req_op(req))]); 74026308eabSJerome Marchand part_stat_unlock(); 74126308eabSJerome Marchand } 74226308eabSJerome Marchand } 743b9c54f56SKonstantin Khlebnikov 744e96c0d83SEric Biggers static enum elv_merge blk_try_req_merge(struct request *req, 745e96c0d83SEric Biggers struct request *next) 74669840466SJianchao Wang { 74769840466SJianchao Wang if (blk_discard_mergable(req)) 74869840466SJianchao Wang return ELEVATOR_DISCARD_MERGE; 74969840466SJianchao Wang else if (blk_rq_pos(req) + blk_rq_sectors(req) == blk_rq_pos(next)) 75069840466SJianchao Wang return ELEVATOR_BACK_MERGE; 75169840466SJianchao Wang 75269840466SJianchao Wang return ELEVATOR_NO_MERGE; 75369840466SJianchao Wang } 75426308eabSJerome Marchand 755d6d48196SJens Axboe /* 756b973cb7eSJens Axboe * For non-mq, this has to be called with the request spinlock acquired. 757b973cb7eSJens Axboe * For mq with scheduling, the appropriate queue wide lock should be held. 758d6d48196SJens Axboe */ 759b973cb7eSJens Axboe static struct request *attempt_merge(struct request_queue *q, 760b973cb7eSJens Axboe struct request *req, struct request *next) 761d6d48196SJens Axboe { 762d6d48196SJens Axboe if (!rq_mergeable(req) || !rq_mergeable(next)) 763b973cb7eSJens Axboe return NULL; 764d6d48196SJens Axboe 765288dab8aSChristoph Hellwig if (req_op(req) != req_op(next)) 766b973cb7eSJens Axboe return NULL; 767f31dc1cdSMartin K. Petersen 76879bb1dbdSChristoph Hellwig if (rq_data_dir(req) != rq_data_dir(next)) 769b973cb7eSJens Axboe return NULL; 770d6d48196SJens Axboe 771668ffc03SDamien Le Moal if (req->ioprio != next->ioprio) 772668ffc03SDamien Le Moal return NULL; 773668ffc03SDamien Le Moal 774cb6934f8SJens Axboe /* 775d6d48196SJens Axboe * If we are allowed to merge, then append bio list 776d6d48196SJens Axboe * from next to rq and release next. merge_requests_fn 777d6d48196SJens Axboe * will have updated segment counts, update sector 778445251d0SJens Axboe * counts here. Handle DISCARDs separately, as they 779445251d0SJens Axboe * have separate settings. 780d6d48196SJens Axboe */ 78169840466SJianchao Wang 78269840466SJianchao Wang switch (blk_try_req_merge(req, next)) { 78369840466SJianchao Wang case ELEVATOR_DISCARD_MERGE: 784445251d0SJens Axboe if (!req_attempt_discard_merge(q, req, next)) 785445251d0SJens Axboe return NULL; 78669840466SJianchao Wang break; 78769840466SJianchao Wang case ELEVATOR_BACK_MERGE: 78869840466SJianchao Wang if (!ll_merge_requests_fn(q, req, next)) 789b973cb7eSJens Axboe return NULL; 79069840466SJianchao Wang break; 79169840466SJianchao Wang default: 79269840466SJianchao Wang return NULL; 79369840466SJianchao Wang } 794d6d48196SJens Axboe 795d6d48196SJens Axboe /* 79680a761fdSTejun Heo * If failfast settings disagree or any of the two is already 79780a761fdSTejun Heo * a mixed merge, mark both as mixed before proceeding. This 79880a761fdSTejun Heo * makes sure that all involved bios have mixable attributes 79980a761fdSTejun Heo * set properly. 80080a761fdSTejun Heo */ 801e8064021SChristoph Hellwig if (((req->rq_flags | next->rq_flags) & RQF_MIXED_MERGE) || 80280a761fdSTejun Heo (req->cmd_flags & REQ_FAILFAST_MASK) != 80380a761fdSTejun Heo (next->cmd_flags & REQ_FAILFAST_MASK)) { 80480a761fdSTejun Heo blk_rq_set_mixed_merge(req); 80580a761fdSTejun Heo blk_rq_set_mixed_merge(next); 80680a761fdSTejun Heo } 80780a761fdSTejun Heo 80880a761fdSTejun Heo /* 809522a7775SOmar Sandoval * At this point we have either done a back merge or front merge. We 810522a7775SOmar Sandoval * need the smaller start_time_ns of the merged requests to be the 811522a7775SOmar Sandoval * current request for accounting purposes. 812d6d48196SJens Axboe */ 813522a7775SOmar Sandoval if (next->start_time_ns < req->start_time_ns) 814522a7775SOmar Sandoval req->start_time_ns = next->start_time_ns; 815d6d48196SJens Axboe 816d6d48196SJens Axboe req->biotail->bi_next = next->bio; 817d6d48196SJens Axboe req->biotail = next->biotail; 818d6d48196SJens Axboe 819a2dec7b3STejun Heo req->__data_len += blk_rq_bytes(next); 820d6d48196SJens Axboe 8212a5cf35cSMing Lei if (!blk_discard_mergable(req)) 822d6d48196SJens Axboe elv_merge_requests(q, req, next); 823d6d48196SJens Axboe 82442dad764SJerome Marchand /* 82542dad764SJerome Marchand * 'next' is going away, so update stats accordingly 82642dad764SJerome Marchand */ 827b9c54f56SKonstantin Khlebnikov blk_account_io_merge_request(next); 828d6d48196SJens Axboe 829a54895faSChristoph Hellwig trace_block_rq_merge(next); 830f3bdc62fSJan Kara 831e4d750c9SJens Axboe /* 832e4d750c9SJens Axboe * ownership of bio passed from next to req, return 'next' for 833e4d750c9SJens Axboe * the caller to free 834e4d750c9SJens Axboe */ 8351cd96c24SBoaz Harrosh next->bio = NULL; 836b973cb7eSJens Axboe return next; 837d6d48196SJens Axboe } 838d6d48196SJens Axboe 839eda5cc99SChristoph Hellwig static struct request *attempt_back_merge(struct request_queue *q, 840eda5cc99SChristoph Hellwig struct request *rq) 841d6d48196SJens Axboe { 842d6d48196SJens Axboe struct request *next = elv_latter_request(q, rq); 843d6d48196SJens Axboe 844d6d48196SJens Axboe if (next) 845d6d48196SJens Axboe return attempt_merge(q, rq, next); 846d6d48196SJens Axboe 847b973cb7eSJens Axboe return NULL; 848d6d48196SJens Axboe } 849d6d48196SJens Axboe 850eda5cc99SChristoph Hellwig static struct request *attempt_front_merge(struct request_queue *q, 851eda5cc99SChristoph Hellwig struct request *rq) 852d6d48196SJens Axboe { 853d6d48196SJens Axboe struct request *prev = elv_former_request(q, rq); 854d6d48196SJens Axboe 855d6d48196SJens Axboe if (prev) 856d6d48196SJens Axboe return attempt_merge(q, prev, rq); 857d6d48196SJens Axboe 858b973cb7eSJens Axboe return NULL; 859d6d48196SJens Axboe } 8605e84ea3aSJens Axboe 861fd2ef39cSJan Kara /* 862fd2ef39cSJan Kara * Try to merge 'next' into 'rq'. Return true if the merge happened, false 863fd2ef39cSJan Kara * otherwise. The caller is responsible for freeing 'next' if the merge 864fd2ef39cSJan Kara * happened. 865fd2ef39cSJan Kara */ 866fd2ef39cSJan Kara bool blk_attempt_req_merge(struct request_queue *q, struct request *rq, 8675e84ea3aSJens Axboe struct request *next) 8685e84ea3aSJens Axboe { 869fd2ef39cSJan Kara return attempt_merge(q, rq, next); 8705e84ea3aSJens Axboe } 871050c8ea8STejun Heo 872050c8ea8STejun Heo bool blk_rq_merge_ok(struct request *rq, struct bio *bio) 873050c8ea8STejun Heo { 874e2a60da7SMartin K. Petersen if (!rq_mergeable(rq) || !bio_mergeable(bio)) 875050c8ea8STejun Heo return false; 876050c8ea8STejun Heo 877288dab8aSChristoph Hellwig if (req_op(rq) != bio_op(bio)) 878f31dc1cdSMartin K. Petersen return false; 879f31dc1cdSMartin K. Petersen 880050c8ea8STejun Heo /* different data direction or already started, don't merge */ 881050c8ea8STejun Heo if (bio_data_dir(bio) != rq_data_dir(rq)) 882050c8ea8STejun Heo return false; 883050c8ea8STejun Heo 8846b2b0459STejun Heo /* don't merge across cgroup boundaries */ 8856b2b0459STejun Heo if (!blk_cgroup_mergeable(rq, bio)) 8866b2b0459STejun Heo return false; 8876b2b0459STejun Heo 888050c8ea8STejun Heo /* only merge integrity protected bio into ditto rq */ 8894eaf99beSMartin K. Petersen if (blk_integrity_merge_bio(rq->q, rq, bio) == false) 890050c8ea8STejun Heo return false; 891050c8ea8STejun Heo 892a892c8d5SSatya Tangirala /* Only merge if the crypt contexts are compatible */ 893a892c8d5SSatya Tangirala if (!bio_crypt_rq_ctx_compatible(rq, bio)) 894a892c8d5SSatya Tangirala return false; 895a892c8d5SSatya Tangirala 896668ffc03SDamien Le Moal if (rq->ioprio != bio_prio(bio)) 897668ffc03SDamien Le Moal return false; 898668ffc03SDamien Le Moal 899050c8ea8STejun Heo return true; 900050c8ea8STejun Heo } 901050c8ea8STejun Heo 90234fe7c05SChristoph Hellwig enum elv_merge blk_try_merge(struct request *rq, struct bio *bio) 903050c8ea8STejun Heo { 90469840466SJianchao Wang if (blk_discard_mergable(rq)) 9051e739730SChristoph Hellwig return ELEVATOR_DISCARD_MERGE; 9061e739730SChristoph Hellwig else if (blk_rq_pos(rq) + blk_rq_sectors(rq) == bio->bi_iter.bi_sector) 907050c8ea8STejun Heo return ELEVATOR_BACK_MERGE; 9084f024f37SKent Overstreet else if (blk_rq_pos(rq) - bio_sectors(bio) == bio->bi_iter.bi_sector) 909050c8ea8STejun Heo return ELEVATOR_FRONT_MERGE; 910050c8ea8STejun Heo return ELEVATOR_NO_MERGE; 911050c8ea8STejun Heo } 9128e756373SBaolin Wang 9138e756373SBaolin Wang static void blk_account_io_merge_bio(struct request *req) 9148e756373SBaolin Wang { 9158e756373SBaolin Wang if (!blk_do_io_stat(req)) 9168e756373SBaolin Wang return; 9178e756373SBaolin Wang 9188e756373SBaolin Wang part_stat_lock(); 9198e756373SBaolin Wang part_stat_inc(req->part, merges[op_stat_group(req_op(req))]); 9208e756373SBaolin Wang part_stat_unlock(); 9218e756373SBaolin Wang } 9228e756373SBaolin Wang 923eda5cc99SChristoph Hellwig enum bio_merge_status { 924eda5cc99SChristoph Hellwig BIO_MERGE_OK, 925eda5cc99SChristoph Hellwig BIO_MERGE_NONE, 926eda5cc99SChristoph Hellwig BIO_MERGE_FAILED, 927eda5cc99SChristoph Hellwig }; 928eda5cc99SChristoph Hellwig 929eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_back_merge(struct request *req, 930eda5cc99SChristoph Hellwig struct bio *bio, unsigned int nr_segs) 9318e756373SBaolin Wang { 93216458cf3SBart Van Assche const blk_opf_t ff = bio->bi_opf & REQ_FAILFAST_MASK; 9338e756373SBaolin Wang 9348e756373SBaolin Wang if (!ll_back_merge_fn(req, bio, nr_segs)) 9357d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 9368e756373SBaolin Wang 937e8a676d6SChristoph Hellwig trace_block_bio_backmerge(bio); 9388e756373SBaolin Wang rq_qos_merge(req->q, req, bio); 9398e756373SBaolin Wang 9408e756373SBaolin Wang if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) 9418e756373SBaolin Wang blk_rq_set_mixed_merge(req); 9428e756373SBaolin Wang 9438e756373SBaolin Wang req->biotail->bi_next = bio; 9448e756373SBaolin Wang req->biotail = bio; 9458e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 9468e756373SBaolin Wang 9478e756373SBaolin Wang bio_crypt_free_ctx(bio); 9488e756373SBaolin Wang 9498e756373SBaolin Wang blk_account_io_merge_bio(req); 9507d7ca7c5SBaolin Wang return BIO_MERGE_OK; 9518e756373SBaolin Wang } 9528e756373SBaolin Wang 953eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_front_merge(struct request *req, 954eda5cc99SChristoph Hellwig struct bio *bio, unsigned int nr_segs) 9558e756373SBaolin Wang { 95616458cf3SBart Van Assche const blk_opf_t ff = bio->bi_opf & REQ_FAILFAST_MASK; 9578e756373SBaolin Wang 9588e756373SBaolin Wang if (!ll_front_merge_fn(req, bio, nr_segs)) 9597d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 9608e756373SBaolin Wang 961e8a676d6SChristoph Hellwig trace_block_bio_frontmerge(bio); 9628e756373SBaolin Wang rq_qos_merge(req->q, req, bio); 9638e756373SBaolin Wang 9648e756373SBaolin Wang if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) 9658e756373SBaolin Wang blk_rq_set_mixed_merge(req); 9668e756373SBaolin Wang 9678e756373SBaolin Wang bio->bi_next = req->bio; 9688e756373SBaolin Wang req->bio = bio; 9698e756373SBaolin Wang 9708e756373SBaolin Wang req->__sector = bio->bi_iter.bi_sector; 9718e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 9728e756373SBaolin Wang 9738e756373SBaolin Wang bio_crypt_do_front_merge(req, bio); 9748e756373SBaolin Wang 9758e756373SBaolin Wang blk_account_io_merge_bio(req); 9767d7ca7c5SBaolin Wang return BIO_MERGE_OK; 9778e756373SBaolin Wang } 9788e756373SBaolin Wang 979eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_discard_merge(struct request_queue *q, 980eda5cc99SChristoph Hellwig struct request *req, struct bio *bio) 9818e756373SBaolin Wang { 9828e756373SBaolin Wang unsigned short segments = blk_rq_nr_discard_segments(req); 9838e756373SBaolin Wang 9848e756373SBaolin Wang if (segments >= queue_max_discard_segments(q)) 9858e756373SBaolin Wang goto no_merge; 9868e756373SBaolin Wang if (blk_rq_sectors(req) + bio_sectors(bio) > 9878e756373SBaolin Wang blk_rq_get_max_sectors(req, blk_rq_pos(req))) 9888e756373SBaolin Wang goto no_merge; 9898e756373SBaolin Wang 9908e756373SBaolin Wang rq_qos_merge(q, req, bio); 9918e756373SBaolin Wang 9928e756373SBaolin Wang req->biotail->bi_next = bio; 9938e756373SBaolin Wang req->biotail = bio; 9948e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 9958e756373SBaolin Wang req->nr_phys_segments = segments + 1; 9968e756373SBaolin Wang 9978e756373SBaolin Wang blk_account_io_merge_bio(req); 9987d7ca7c5SBaolin Wang return BIO_MERGE_OK; 9998e756373SBaolin Wang no_merge: 10008e756373SBaolin Wang req_set_nomerge(q, req); 10017d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 10027d7ca7c5SBaolin Wang } 10037d7ca7c5SBaolin Wang 10047d7ca7c5SBaolin Wang static enum bio_merge_status blk_attempt_bio_merge(struct request_queue *q, 10057d7ca7c5SBaolin Wang struct request *rq, 10067d7ca7c5SBaolin Wang struct bio *bio, 10077d7ca7c5SBaolin Wang unsigned int nr_segs, 10087d7ca7c5SBaolin Wang bool sched_allow_merge) 10097d7ca7c5SBaolin Wang { 10107d7ca7c5SBaolin Wang if (!blk_rq_merge_ok(rq, bio)) 10117d7ca7c5SBaolin Wang return BIO_MERGE_NONE; 10127d7ca7c5SBaolin Wang 10137d7ca7c5SBaolin Wang switch (blk_try_merge(rq, bio)) { 10147d7ca7c5SBaolin Wang case ELEVATOR_BACK_MERGE: 1015265600b7SBaolin Wang if (!sched_allow_merge || blk_mq_sched_allow_merge(q, rq, bio)) 10167d7ca7c5SBaolin Wang return bio_attempt_back_merge(rq, bio, nr_segs); 10177d7ca7c5SBaolin Wang break; 10187d7ca7c5SBaolin Wang case ELEVATOR_FRONT_MERGE: 1019265600b7SBaolin Wang if (!sched_allow_merge || blk_mq_sched_allow_merge(q, rq, bio)) 10207d7ca7c5SBaolin Wang return bio_attempt_front_merge(rq, bio, nr_segs); 10217d7ca7c5SBaolin Wang break; 10227d7ca7c5SBaolin Wang case ELEVATOR_DISCARD_MERGE: 10237d7ca7c5SBaolin Wang return bio_attempt_discard_merge(q, rq, bio); 10247d7ca7c5SBaolin Wang default: 10257d7ca7c5SBaolin Wang return BIO_MERGE_NONE; 10267d7ca7c5SBaolin Wang } 10277d7ca7c5SBaolin Wang 10287d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 10298e756373SBaolin Wang } 10308e756373SBaolin Wang 10318e756373SBaolin Wang /** 10328e756373SBaolin Wang * blk_attempt_plug_merge - try to merge with %current's plugged list 10338e756373SBaolin Wang * @q: request_queue new bio is being queued at 10348e756373SBaolin Wang * @bio: new bio being queued 10358e756373SBaolin Wang * @nr_segs: number of segments in @bio 103687c037d1SJens Axboe * from the passed in @q already in the plug list 10378e756373SBaolin Wang * 1038d38a9c04SJens Axboe * Determine whether @bio being queued on @q can be merged with the previous 1039d38a9c04SJens Axboe * request on %current's plugged list. Returns %true if merge was successful, 10408e756373SBaolin Wang * otherwise %false. 10418e756373SBaolin Wang * 10428e756373SBaolin Wang * Plugging coalesces IOs from the same issuer for the same purpose without 10438e756373SBaolin Wang * going through @q->queue_lock. As such it's more of an issuing mechanism 10448e756373SBaolin Wang * than scheduling, and the request, while may have elvpriv data, is not 10458e756373SBaolin Wang * added on the elevator at this point. In addition, we don't have 10468e756373SBaolin Wang * reliable access to the elevator outside queue lock. Only check basic 10478e756373SBaolin Wang * merging parameters without querying the elevator. 10488e756373SBaolin Wang * 10498e756373SBaolin Wang * Caller must ensure !blk_queue_nomerges(q) beforehand. 10508e756373SBaolin Wang */ 10518e756373SBaolin Wang bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio, 10520c5bcc92SChristoph Hellwig unsigned int nr_segs) 10538e756373SBaolin Wang { 10548e756373SBaolin Wang struct blk_plug *plug; 10558e756373SBaolin Wang struct request *rq; 10568e756373SBaolin Wang 10576deacb3bSChristoph Hellwig plug = blk_mq_plug(bio); 1058bc490f81SJens Axboe if (!plug || rq_list_empty(plug->mq_list)) 10598e756373SBaolin Wang return false; 10608e756373SBaolin Wang 10615b205071SJens Axboe rq_list_for_each(&plug->mq_list, rq) { 106287c037d1SJens Axboe if (rq->q == q) { 1063a1cb6537SMing Lei if (blk_attempt_bio_merge(q, rq, bio, nr_segs, false) == 1064a1cb6537SMing Lei BIO_MERGE_OK) 10658e756373SBaolin Wang return true; 10665b205071SJens Axboe break; 10675b205071SJens Axboe } 10685b205071SJens Axboe 10695b205071SJens Axboe /* 10705b205071SJens Axboe * Only keep iterating plug list for merges if we have multiple 10715b205071SJens Axboe * queues 10725b205071SJens Axboe */ 10735b205071SJens Axboe if (!plug->multiple_queues) 10745b205071SJens Axboe break; 1075a1cb6537SMing Lei } 10768e756373SBaolin Wang return false; 10778e756373SBaolin Wang } 1078bdc6a287SBaolin Wang 1079bdc6a287SBaolin Wang /* 1080bdc6a287SBaolin Wang * Iterate list of requests and see if we can merge this bio with any 1081bdc6a287SBaolin Wang * of them. 1082bdc6a287SBaolin Wang */ 1083bdc6a287SBaolin Wang bool blk_bio_list_merge(struct request_queue *q, struct list_head *list, 1084bdc6a287SBaolin Wang struct bio *bio, unsigned int nr_segs) 1085bdc6a287SBaolin Wang { 1086bdc6a287SBaolin Wang struct request *rq; 1087bdc6a287SBaolin Wang int checked = 8; 1088bdc6a287SBaolin Wang 1089bdc6a287SBaolin Wang list_for_each_entry_reverse(rq, list, queuelist) { 1090bdc6a287SBaolin Wang if (!checked--) 1091bdc6a287SBaolin Wang break; 1092bdc6a287SBaolin Wang 10937d7ca7c5SBaolin Wang switch (blk_attempt_bio_merge(q, rq, bio, nr_segs, true)) { 10947d7ca7c5SBaolin Wang case BIO_MERGE_NONE: 1095bdc6a287SBaolin Wang continue; 10967d7ca7c5SBaolin Wang case BIO_MERGE_OK: 10977d7ca7c5SBaolin Wang return true; 10987d7ca7c5SBaolin Wang case BIO_MERGE_FAILED: 10997d7ca7c5SBaolin Wang return false; 1100bdc6a287SBaolin Wang } 1101bdc6a287SBaolin Wang 1102bdc6a287SBaolin Wang } 1103bdc6a287SBaolin Wang 1104bdc6a287SBaolin Wang return false; 1105bdc6a287SBaolin Wang } 1106bdc6a287SBaolin Wang EXPORT_SYMBOL_GPL(blk_bio_list_merge); 1107eda5cc99SChristoph Hellwig 1108eda5cc99SChristoph Hellwig bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio, 1109eda5cc99SChristoph Hellwig unsigned int nr_segs, struct request **merged_request) 1110eda5cc99SChristoph Hellwig { 1111eda5cc99SChristoph Hellwig struct request *rq; 1112eda5cc99SChristoph Hellwig 1113eda5cc99SChristoph Hellwig switch (elv_merge(q, &rq, bio)) { 1114eda5cc99SChristoph Hellwig case ELEVATOR_BACK_MERGE: 1115eda5cc99SChristoph Hellwig if (!blk_mq_sched_allow_merge(q, rq, bio)) 1116eda5cc99SChristoph Hellwig return false; 1117eda5cc99SChristoph Hellwig if (bio_attempt_back_merge(rq, bio, nr_segs) != BIO_MERGE_OK) 1118eda5cc99SChristoph Hellwig return false; 1119eda5cc99SChristoph Hellwig *merged_request = attempt_back_merge(q, rq); 1120eda5cc99SChristoph Hellwig if (!*merged_request) 1121eda5cc99SChristoph Hellwig elv_merged_request(q, rq, ELEVATOR_BACK_MERGE); 1122eda5cc99SChristoph Hellwig return true; 1123eda5cc99SChristoph Hellwig case ELEVATOR_FRONT_MERGE: 1124eda5cc99SChristoph Hellwig if (!blk_mq_sched_allow_merge(q, rq, bio)) 1125eda5cc99SChristoph Hellwig return false; 1126eda5cc99SChristoph Hellwig if (bio_attempt_front_merge(rq, bio, nr_segs) != BIO_MERGE_OK) 1127eda5cc99SChristoph Hellwig return false; 1128eda5cc99SChristoph Hellwig *merged_request = attempt_front_merge(q, rq); 1129eda5cc99SChristoph Hellwig if (!*merged_request) 1130eda5cc99SChristoph Hellwig elv_merged_request(q, rq, ELEVATOR_FRONT_MERGE); 1131eda5cc99SChristoph Hellwig return true; 1132eda5cc99SChristoph Hellwig case ELEVATOR_DISCARD_MERGE: 1133eda5cc99SChristoph Hellwig return bio_attempt_discard_merge(q, rq, bio) == BIO_MERGE_OK; 1134eda5cc99SChristoph Hellwig default: 1135eda5cc99SChristoph Hellwig return false; 1136eda5cc99SChristoph Hellwig } 1137eda5cc99SChristoph Hellwig } 1138eda5cc99SChristoph Hellwig EXPORT_SYMBOL_GPL(blk_mq_sched_try_merge); 1139