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> 11d6d48196SJens Axboe 12cda22646SMike Krinkin #include <trace/events/block.h> 13cda22646SMike Krinkin 14d6d48196SJens Axboe #include "blk.h" 158e756373SBaolin Wang #include "blk-rq-qos.h" 16a7b36ee6SJens Axboe #include "blk-throttle.h" 17d6d48196SJens Axboe 18ff18d77bSChristoph Hellwig static inline void bio_get_first_bvec(struct bio *bio, struct bio_vec *bv) 19ff18d77bSChristoph Hellwig { 20ff18d77bSChristoph Hellwig *bv = mp_bvec_iter_bvec(bio->bi_io_vec, bio->bi_iter); 21ff18d77bSChristoph Hellwig } 22ff18d77bSChristoph Hellwig 23ff18d77bSChristoph Hellwig static inline void bio_get_last_bvec(struct bio *bio, struct bio_vec *bv) 24ff18d77bSChristoph Hellwig { 25ff18d77bSChristoph Hellwig struct bvec_iter iter = bio->bi_iter; 26ff18d77bSChristoph Hellwig int idx; 27ff18d77bSChristoph Hellwig 28ff18d77bSChristoph Hellwig bio_get_first_bvec(bio, bv); 29ff18d77bSChristoph Hellwig if (bv->bv_len == bio->bi_iter.bi_size) 30ff18d77bSChristoph Hellwig return; /* this bio only has a single bvec */ 31ff18d77bSChristoph Hellwig 32ff18d77bSChristoph Hellwig bio_advance_iter(bio, &iter, iter.bi_size); 33ff18d77bSChristoph Hellwig 34ff18d77bSChristoph Hellwig if (!iter.bi_bvec_done) 35ff18d77bSChristoph Hellwig idx = iter.bi_idx - 1; 36ff18d77bSChristoph Hellwig else /* in the middle of bvec */ 37ff18d77bSChristoph Hellwig idx = iter.bi_idx; 38ff18d77bSChristoph Hellwig 39ff18d77bSChristoph Hellwig *bv = bio->bi_io_vec[idx]; 40ff18d77bSChristoph Hellwig 41ff18d77bSChristoph Hellwig /* 42ff18d77bSChristoph Hellwig * iter.bi_bvec_done records actual length of the last bvec 43ff18d77bSChristoph Hellwig * if this bio ends in the middle of one io vector 44ff18d77bSChristoph Hellwig */ 45ff18d77bSChristoph Hellwig if (iter.bi_bvec_done) 46ff18d77bSChristoph Hellwig bv->bv_len = iter.bi_bvec_done; 47ff18d77bSChristoph Hellwig } 48ff18d77bSChristoph Hellwig 49e9907009SChristoph Hellwig static inline bool bio_will_gap(struct request_queue *q, 50e9907009SChristoph Hellwig struct request *prev_rq, struct bio *prev, struct bio *next) 51e9907009SChristoph Hellwig { 52e9907009SChristoph Hellwig struct bio_vec pb, nb; 53e9907009SChristoph Hellwig 54e9907009SChristoph Hellwig if (!bio_has_data(prev) || !queue_virt_boundary(q)) 55e9907009SChristoph Hellwig return false; 56e9907009SChristoph Hellwig 57e9907009SChristoph Hellwig /* 58e9907009SChristoph Hellwig * Don't merge if the 1st bio starts with non-zero offset, otherwise it 59e9907009SChristoph Hellwig * is quite difficult to respect the sg gap limit. We work hard to 60e9907009SChristoph Hellwig * merge a huge number of small single bios in case of mkfs. 61e9907009SChristoph Hellwig */ 62e9907009SChristoph Hellwig if (prev_rq) 63e9907009SChristoph Hellwig bio_get_first_bvec(prev_rq->bio, &pb); 64e9907009SChristoph Hellwig else 65e9907009SChristoph Hellwig bio_get_first_bvec(prev, &pb); 66df376b2eSJohannes Thumshirn if (pb.bv_offset & queue_virt_boundary(q)) 67e9907009SChristoph Hellwig return true; 68e9907009SChristoph Hellwig 69e9907009SChristoph Hellwig /* 70e9907009SChristoph Hellwig * We don't need to worry about the situation that the merged segment 71e9907009SChristoph Hellwig * ends in unaligned virt boundary: 72e9907009SChristoph Hellwig * 73e9907009SChristoph Hellwig * - if 'pb' ends aligned, the merged segment ends aligned 74e9907009SChristoph Hellwig * - if 'pb' ends unaligned, the next bio must include 75e9907009SChristoph Hellwig * one single bvec of 'nb', otherwise the 'nb' can't 76e9907009SChristoph Hellwig * merge with 'pb' 77e9907009SChristoph Hellwig */ 78e9907009SChristoph Hellwig bio_get_last_bvec(prev, &pb); 79e9907009SChristoph Hellwig bio_get_first_bvec(next, &nb); 80200a9affSChristoph Hellwig if (biovec_phys_mergeable(q, &pb, &nb)) 81e9907009SChristoph Hellwig return false; 82e9907009SChristoph Hellwig return __bvec_gap_to_prev(q, &pb, nb.bv_offset); 83e9907009SChristoph Hellwig } 84e9907009SChristoph Hellwig 85e9907009SChristoph Hellwig static inline bool req_gap_back_merge(struct request *req, struct bio *bio) 86e9907009SChristoph Hellwig { 87e9907009SChristoph Hellwig return bio_will_gap(req->q, req, req->biotail, bio); 88e9907009SChristoph Hellwig } 89e9907009SChristoph Hellwig 90e9907009SChristoph Hellwig static inline bool req_gap_front_merge(struct request *req, struct bio *bio) 91e9907009SChristoph Hellwig { 92e9907009SChristoph Hellwig return bio_will_gap(req->q, NULL, bio, req->bio); 93e9907009SChristoph Hellwig } 94e9907009SChristoph Hellwig 9554efd50bSKent Overstreet static struct bio *blk_bio_discard_split(struct request_queue *q, 9654efd50bSKent Overstreet struct bio *bio, 97bdced438SMing Lei struct bio_set *bs, 98bdced438SMing Lei unsigned *nsegs) 9954efd50bSKent Overstreet { 10054efd50bSKent Overstreet unsigned int max_discard_sectors, granularity; 10154efd50bSKent Overstreet int alignment; 10254efd50bSKent Overstreet sector_t tmp; 10354efd50bSKent Overstreet unsigned split_sectors; 10454efd50bSKent Overstreet 105bdced438SMing Lei *nsegs = 1; 106bdced438SMing Lei 10754efd50bSKent Overstreet /* Zero-sector (unknown) and one-sector granularities are the same. */ 10854efd50bSKent Overstreet granularity = max(q->limits.discard_granularity >> 9, 1U); 10954efd50bSKent Overstreet 1101adfc5e4SMing Lei max_discard_sectors = min(q->limits.max_discard_sectors, 1111adfc5e4SMing Lei bio_allowed_max_sectors(q)); 11254efd50bSKent Overstreet max_discard_sectors -= max_discard_sectors % granularity; 11354efd50bSKent Overstreet 11454efd50bSKent Overstreet if (unlikely(!max_discard_sectors)) { 11554efd50bSKent Overstreet /* XXX: warn */ 11654efd50bSKent Overstreet return NULL; 11754efd50bSKent Overstreet } 11854efd50bSKent Overstreet 11954efd50bSKent Overstreet if (bio_sectors(bio) <= max_discard_sectors) 12054efd50bSKent Overstreet return NULL; 12154efd50bSKent Overstreet 12254efd50bSKent Overstreet split_sectors = max_discard_sectors; 12354efd50bSKent Overstreet 12454efd50bSKent Overstreet /* 12554efd50bSKent Overstreet * If the next starting sector would be misaligned, stop the discard at 12654efd50bSKent Overstreet * the previous aligned sector. 12754efd50bSKent Overstreet */ 12854efd50bSKent Overstreet alignment = (q->limits.discard_alignment >> 9) % granularity; 12954efd50bSKent Overstreet 13054efd50bSKent Overstreet tmp = bio->bi_iter.bi_sector + split_sectors - alignment; 13154efd50bSKent Overstreet tmp = sector_div(tmp, granularity); 13254efd50bSKent Overstreet 13354efd50bSKent Overstreet if (split_sectors > tmp) 13454efd50bSKent Overstreet split_sectors -= tmp; 13554efd50bSKent Overstreet 13654efd50bSKent Overstreet return bio_split(bio, split_sectors, GFP_NOIO, bs); 13754efd50bSKent Overstreet } 13854efd50bSKent Overstreet 139885fa13fSChristoph Hellwig static struct bio *blk_bio_write_zeroes_split(struct request_queue *q, 140885fa13fSChristoph Hellwig struct bio *bio, struct bio_set *bs, unsigned *nsegs) 141885fa13fSChristoph Hellwig { 142d665e12aSChristoph Hellwig *nsegs = 0; 143885fa13fSChristoph Hellwig 144885fa13fSChristoph Hellwig if (!q->limits.max_write_zeroes_sectors) 145885fa13fSChristoph Hellwig return NULL; 146885fa13fSChristoph Hellwig 147885fa13fSChristoph Hellwig if (bio_sectors(bio) <= q->limits.max_write_zeroes_sectors) 148885fa13fSChristoph Hellwig return NULL; 149885fa13fSChristoph Hellwig 150885fa13fSChristoph Hellwig return bio_split(bio, q->limits.max_write_zeroes_sectors, GFP_NOIO, bs); 151885fa13fSChristoph Hellwig } 152885fa13fSChristoph Hellwig 15354efd50bSKent Overstreet static struct bio *blk_bio_write_same_split(struct request_queue *q, 15454efd50bSKent Overstreet struct bio *bio, 155bdced438SMing Lei struct bio_set *bs, 156bdced438SMing Lei unsigned *nsegs) 15754efd50bSKent Overstreet { 158bdced438SMing Lei *nsegs = 1; 159bdced438SMing Lei 16054efd50bSKent Overstreet if (!q->limits.max_write_same_sectors) 16154efd50bSKent Overstreet return NULL; 16254efd50bSKent Overstreet 16354efd50bSKent Overstreet if (bio_sectors(bio) <= q->limits.max_write_same_sectors) 16454efd50bSKent Overstreet return NULL; 16554efd50bSKent Overstreet 16654efd50bSKent Overstreet return bio_split(bio, q->limits.max_write_same_sectors, GFP_NOIO, bs); 16754efd50bSKent Overstreet } 16854efd50bSKent Overstreet 1699cc5169cSBart Van Assche /* 1709cc5169cSBart Van Assche * Return the maximum number of sectors from the start of a bio that may be 1719cc5169cSBart Van Assche * submitted as a single request to a block device. If enough sectors remain, 1729cc5169cSBart Van Assche * align the end to the physical block size. Otherwise align the end to the 1739cc5169cSBart Van Assche * logical block size. This approach minimizes the number of non-aligned 1749cc5169cSBart Van Assche * requests that are submitted to a block device if the start of a bio is not 1759cc5169cSBart Van Assche * aligned to a physical block boundary. 1769cc5169cSBart Van Assche */ 177d0e5fbb0SMing Lei static inline unsigned get_max_io_size(struct request_queue *q, 178d0e5fbb0SMing Lei struct bio *bio) 179d0e5fbb0SMing Lei { 1803ee16db3SMike Snitzer unsigned sectors = blk_max_size_offset(q, bio->bi_iter.bi_sector, 0); 1819cc5169cSBart Van Assche unsigned max_sectors = sectors; 1829cc5169cSBart Van Assche unsigned pbs = queue_physical_block_size(q) >> SECTOR_SHIFT; 1839cc5169cSBart Van Assche unsigned lbs = queue_logical_block_size(q) >> SECTOR_SHIFT; 1849cc5169cSBart Van Assche unsigned start_offset = bio->bi_iter.bi_sector & (pbs - 1); 185d0e5fbb0SMing Lei 1869cc5169cSBart Van Assche max_sectors += start_offset; 1879cc5169cSBart Van Assche max_sectors &= ~(pbs - 1); 1889cc5169cSBart Van Assche if (max_sectors > start_offset) 1899cc5169cSBart Van Assche return max_sectors - start_offset; 190d0e5fbb0SMing Lei 191e4b469c6SKeith Busch return sectors & ~(lbs - 1); 192d0e5fbb0SMing Lei } 193d0e5fbb0SMing Lei 194429120f3SMing Lei static inline unsigned get_max_segment_size(const struct request_queue *q, 195429120f3SMing Lei struct page *start_page, 196429120f3SMing Lei unsigned long offset) 197dcebd755SMing Lei { 198dcebd755SMing Lei unsigned long mask = queue_segment_boundary(q); 199dcebd755SMing Lei 200429120f3SMing Lei offset = mask & (page_to_phys(start_page) + offset); 2014a2f704eSMing Lei 2024a2f704eSMing Lei /* 2034a2f704eSMing Lei * overflow may be triggered in case of zero page physical address 2044a2f704eSMing Lei * on 32bit arch, use queue's max segment size when that happens. 2054a2f704eSMing Lei */ 2064a2f704eSMing Lei return min_not_zero(mask - offset + 1, 2074a2f704eSMing Lei (unsigned long)queue_max_segment_size(q)); 208dcebd755SMing Lei } 209dcebd755SMing Lei 210708b25b3SBart Van Assche /** 211708b25b3SBart Van Assche * bvec_split_segs - verify whether or not a bvec should be split in the middle 212708b25b3SBart Van Assche * @q: [in] request queue associated with the bio associated with @bv 213708b25b3SBart Van Assche * @bv: [in] bvec to examine 214708b25b3SBart Van Assche * @nsegs: [in,out] Number of segments in the bio being built. Incremented 215708b25b3SBart Van Assche * by the number of segments from @bv that may be appended to that 216708b25b3SBart Van Assche * bio without exceeding @max_segs 217708b25b3SBart Van Assche * @sectors: [in,out] Number of sectors in the bio being built. Incremented 218708b25b3SBart Van Assche * by the number of sectors from @bv that may be appended to that 219708b25b3SBart Van Assche * bio without exceeding @max_sectors 220708b25b3SBart Van Assche * @max_segs: [in] upper bound for *@nsegs 221708b25b3SBart Van Assche * @max_sectors: [in] upper bound for *@sectors 222708b25b3SBart Van Assche * 223708b25b3SBart Van Assche * When splitting a bio, it can happen that a bvec is encountered that is too 224708b25b3SBart Van Assche * big to fit in a single segment and hence that it has to be split in the 225708b25b3SBart Van Assche * middle. This function verifies whether or not that should happen. The value 226708b25b3SBart Van Assche * %true is returned if and only if appending the entire @bv to a bio with 227708b25b3SBart Van Assche * *@nsegs segments and *@sectors sectors would make that bio unacceptable for 228708b25b3SBart Van Assche * the block driver. 229dcebd755SMing Lei */ 230af2c68feSBart Van Assche static bool bvec_split_segs(const struct request_queue *q, 231af2c68feSBart Van Assche const struct bio_vec *bv, unsigned *nsegs, 232708b25b3SBart Van Assche unsigned *sectors, unsigned max_segs, 233708b25b3SBart Van Assche unsigned max_sectors) 234dcebd755SMing Lei { 235708b25b3SBart Van Assche unsigned max_len = (min(max_sectors, UINT_MAX >> 9) - *sectors) << 9; 236708b25b3SBart Van Assche unsigned len = min(bv->bv_len, max_len); 237dcebd755SMing Lei unsigned total_len = 0; 238ff9811b3SBart Van Assche unsigned seg_size = 0; 239dcebd755SMing Lei 240ff9811b3SBart Van Assche while (len && *nsegs < max_segs) { 241429120f3SMing Lei seg_size = get_max_segment_size(q, bv->bv_page, 242429120f3SMing Lei bv->bv_offset + total_len); 243dcebd755SMing Lei seg_size = min(seg_size, len); 244dcebd755SMing Lei 245ff9811b3SBart Van Assche (*nsegs)++; 246dcebd755SMing Lei total_len += seg_size; 247dcebd755SMing Lei len -= seg_size; 248dcebd755SMing Lei 249dcebd755SMing Lei if ((bv->bv_offset + total_len) & queue_virt_boundary(q)) 250dcebd755SMing Lei break; 251dcebd755SMing Lei } 252dcebd755SMing Lei 253dcebd755SMing Lei *sectors += total_len >> 9; 254dcebd755SMing Lei 255708b25b3SBart Van Assche /* tell the caller to split the bvec if it is too big to fit */ 256708b25b3SBart Van Assche return len > 0 || bv->bv_len > max_len; 257dcebd755SMing Lei } 258dcebd755SMing Lei 259dad77584SBart Van Assche /** 260dad77584SBart Van Assche * blk_bio_segment_split - split a bio in two bios 261dad77584SBart Van Assche * @q: [in] request queue pointer 262dad77584SBart Van Assche * @bio: [in] bio to be split 263dad77584SBart Van Assche * @bs: [in] bio set to allocate the clone from 264dad77584SBart Van Assche * @segs: [out] number of segments in the bio with the first half of the sectors 265dad77584SBart Van Assche * 266dad77584SBart Van Assche * Clone @bio, update the bi_iter of the clone to represent the first sectors 267dad77584SBart Van Assche * of @bio and update @bio->bi_iter to represent the remaining sectors. The 268dad77584SBart Van Assche * following is guaranteed for the cloned bio: 269dad77584SBart Van Assche * - That it has at most get_max_io_size(@q, @bio) sectors. 270dad77584SBart Van Assche * - That it has at most queue_max_segments(@q) segments. 271dad77584SBart Van Assche * 272dad77584SBart Van Assche * Except for discard requests the cloned bio will point at the bi_io_vec of 273dad77584SBart Van Assche * the original bio. It is the responsibility of the caller to ensure that the 274dad77584SBart Van Assche * original bio is not freed before the cloned bio. The caller is also 275dad77584SBart Van Assche * responsible for ensuring that @bs is only destroyed after processing of the 276dad77584SBart Van Assche * split bio has finished. 277dad77584SBart Van Assche */ 27854efd50bSKent Overstreet static struct bio *blk_bio_segment_split(struct request_queue *q, 27954efd50bSKent Overstreet struct bio *bio, 280bdced438SMing Lei struct bio_set *bs, 281bdced438SMing Lei unsigned *segs) 28254efd50bSKent Overstreet { 2835014c311SJens Axboe struct bio_vec bv, bvprv, *bvprvp = NULL; 28454efd50bSKent Overstreet struct bvec_iter iter; 2856869875fSChristoph Hellwig unsigned nsegs = 0, sectors = 0; 286d0e5fbb0SMing Lei const unsigned max_sectors = get_max_io_size(q, bio); 28705b700baSMing Lei const unsigned max_segs = queue_max_segments(q); 28854efd50bSKent Overstreet 289dcebd755SMing Lei bio_for_each_bvec(bv, bio, iter) { 29054efd50bSKent Overstreet /* 29154efd50bSKent Overstreet * If the queue doesn't support SG gaps and adding this 29254efd50bSKent Overstreet * offset would create a gap, disallow it. 29354efd50bSKent Overstreet */ 2945014c311SJens Axboe if (bvprvp && bvec_gap_to_prev(q, bvprvp, bv.bv_offset)) 29554efd50bSKent Overstreet goto split; 29654efd50bSKent Overstreet 29705b700baSMing Lei if (nsegs < max_segs && 298708b25b3SBart Van Assche sectors + (bv.bv_len >> 9) <= max_sectors && 299708b25b3SBart Van Assche bv.bv_offset + bv.bv_len <= PAGE_SIZE) { 300708b25b3SBart Van Assche nsegs++; 301708b25b3SBart Van Assche sectors += bv.bv_len >> 9; 302708b25b3SBart Van Assche } else if (bvec_split_segs(q, &bv, &nsegs, §ors, max_segs, 303708b25b3SBart Van Assche max_sectors)) { 304e36f6204SKeith Busch goto split; 305e36f6204SKeith Busch } 306e36f6204SKeith Busch 30754efd50bSKent Overstreet bvprv = bv; 308578270bfSMing Lei bvprvp = &bvprv; 30954efd50bSKent Overstreet } 31054efd50bSKent Overstreet 311d627065dSChristoph Hellwig *segs = nsegs; 312d627065dSChristoph Hellwig return NULL; 31354efd50bSKent Overstreet split: 314bdced438SMing Lei *segs = nsegs; 315cc29e1bfSJeffle Xu 316cc29e1bfSJeffle Xu /* 317cc29e1bfSJeffle Xu * Bio splitting may cause subtle trouble such as hang when doing sync 318cc29e1bfSJeffle Xu * iopoll in direct IO routine. Given performance gain of iopoll for 319cc29e1bfSJeffle Xu * big IO can be trival, disable iopoll when split needed. 320cc29e1bfSJeffle Xu */ 321*6ce913feSChristoph Hellwig bio_clear_polled(bio); 322d627065dSChristoph Hellwig return bio_split(bio, sectors, GFP_NOIO, bs); 32354efd50bSKent Overstreet } 32454efd50bSKent Overstreet 325dad77584SBart Van Assche /** 326dad77584SBart Van Assche * __blk_queue_split - split a bio and submit the second half 327dad77584SBart Van Assche * @bio: [in, out] bio to be split 328dad77584SBart Van Assche * @nr_segs: [out] number of segments in the first bio 329dad77584SBart Van Assche * 330dad77584SBart Van Assche * Split a bio into two bios, chain the two bios, submit the second half and 331dad77584SBart Van Assche * store a pointer to the first half in *@bio. If the second bio is still too 332dad77584SBart Van Assche * big it will be split by a recursive call to this function. Since this 333309dca30SChristoph Hellwig * function may allocate a new bio from q->bio_split, it is the responsibility 334309dca30SChristoph Hellwig * of the caller to ensure that q->bio_split is only released after processing 335309dca30SChristoph Hellwig * of the split bio has finished. 336dad77584SBart Van Assche */ 337f695ca38SChristoph Hellwig void __blk_queue_split(struct bio **bio, unsigned int *nr_segs) 33854efd50bSKent Overstreet { 339309dca30SChristoph Hellwig struct request_queue *q = (*bio)->bi_bdev->bd_disk->queue; 340fa532287SChristoph Hellwig struct bio *split = NULL; 34154efd50bSKent Overstreet 3427afafc8aSAdrian Hunter switch (bio_op(*bio)) { 3437afafc8aSAdrian Hunter case REQ_OP_DISCARD: 3447afafc8aSAdrian Hunter case REQ_OP_SECURE_ERASE: 34514ccb66bSChristoph Hellwig split = blk_bio_discard_split(q, *bio, &q->bio_split, nr_segs); 3467afafc8aSAdrian Hunter break; 347a6f0788eSChaitanya Kulkarni case REQ_OP_WRITE_ZEROES: 34814ccb66bSChristoph Hellwig split = blk_bio_write_zeroes_split(q, *bio, &q->bio_split, 34914ccb66bSChristoph Hellwig nr_segs); 350a6f0788eSChaitanya Kulkarni break; 3517afafc8aSAdrian Hunter case REQ_OP_WRITE_SAME: 35214ccb66bSChristoph Hellwig split = blk_bio_write_same_split(q, *bio, &q->bio_split, 35314ccb66bSChristoph Hellwig nr_segs); 3547afafc8aSAdrian Hunter break; 3557afafc8aSAdrian Hunter default: 356fa532287SChristoph Hellwig /* 357fa532287SChristoph Hellwig * All drivers must accept single-segments bios that are <= 358fa532287SChristoph Hellwig * PAGE_SIZE. This is a quick and dirty check that relies on 359fa532287SChristoph Hellwig * the fact that bi_io_vec[0] is always valid if a bio has data. 360fa532287SChristoph Hellwig * The check might lead to occasional false negatives when bios 361fa532287SChristoph Hellwig * are cloned, but compared to the performance impact of cloned 362fa532287SChristoph Hellwig * bios themselves the loop below doesn't matter anyway. 363fa532287SChristoph Hellwig */ 364fa532287SChristoph Hellwig if (!q->limits.chunk_sectors && 365fa532287SChristoph Hellwig (*bio)->bi_vcnt == 1 && 36659db8ba2SMing Lei ((*bio)->bi_io_vec[0].bv_len + 3671e279153SJens Axboe (*bio)->bi_io_vec[0].bv_offset) <= PAGE_SIZE) { 368fa532287SChristoph Hellwig *nr_segs = 1; 369fa532287SChristoph Hellwig break; 370fa532287SChristoph Hellwig } 37114ccb66bSChristoph Hellwig split = blk_bio_segment_split(q, *bio, &q->bio_split, nr_segs); 3727afafc8aSAdrian Hunter break; 3737afafc8aSAdrian Hunter } 374bdced438SMing Lei 37554efd50bSKent Overstreet if (split) { 3766ac45aebSMing Lei /* there isn't chance to merge the splitted bio */ 3771eff9d32SJens Axboe split->bi_opf |= REQ_NOMERGE; 3786ac45aebSMing Lei 37954efd50bSKent Overstreet bio_chain(split, *bio); 380eb6f7f7cSChristoph Hellwig trace_block_split(split, (*bio)->bi_iter.bi_sector); 381ed00aabdSChristoph Hellwig submit_bio_noacct(*bio); 38254efd50bSKent Overstreet *bio = split; 3834f1e9630SChunguang Xu 3844f1e9630SChunguang Xu blk_throtl_charge_bio_split(*bio); 38554efd50bSKent Overstreet } 38654efd50bSKent Overstreet } 38714ccb66bSChristoph Hellwig 388dad77584SBart Van Assche /** 389dad77584SBart Van Assche * blk_queue_split - split a bio and submit the second half 390dad77584SBart Van Assche * @bio: [in, out] bio to be split 391dad77584SBart Van Assche * 392dad77584SBart Van Assche * Split a bio into two bios, chains the two bios, submit the second half and 393dad77584SBart Van Assche * store a pointer to the first half in *@bio. Since this function may allocate 394309dca30SChristoph Hellwig * a new bio from q->bio_split, it is the responsibility of the caller to ensure 395309dca30SChristoph Hellwig * that q->bio_split is only released after processing of the split bio has 396309dca30SChristoph Hellwig * finished. 397dad77584SBart Van Assche */ 398f695ca38SChristoph Hellwig void blk_queue_split(struct bio **bio) 39914ccb66bSChristoph Hellwig { 40014ccb66bSChristoph Hellwig unsigned int nr_segs; 40114ccb66bSChristoph Hellwig 402f695ca38SChristoph Hellwig __blk_queue_split(bio, &nr_segs); 40314ccb66bSChristoph Hellwig } 40454efd50bSKent Overstreet EXPORT_SYMBOL(blk_queue_split); 40554efd50bSKent Overstreet 406e9cd19c0SChristoph Hellwig unsigned int blk_recalc_rq_segments(struct request *rq) 407d6d48196SJens Axboe { 4086869875fSChristoph Hellwig unsigned int nr_phys_segs = 0; 409ff9811b3SBart Van Assche unsigned int nr_sectors = 0; 410e9cd19c0SChristoph Hellwig struct req_iterator iter; 4116869875fSChristoph Hellwig struct bio_vec bv; 412d6d48196SJens Axboe 413e9cd19c0SChristoph Hellwig if (!rq->bio) 4141e428079SJens Axboe return 0; 415d6d48196SJens Axboe 416e9cd19c0SChristoph Hellwig switch (bio_op(rq->bio)) { 417a6f0788eSChaitanya Kulkarni case REQ_OP_DISCARD: 418a6f0788eSChaitanya Kulkarni case REQ_OP_SECURE_ERASE: 419a958937fSDavid Jeffery if (queue_max_discard_segments(rq->q) > 1) { 420a958937fSDavid Jeffery struct bio *bio = rq->bio; 421a958937fSDavid Jeffery 422a958937fSDavid Jeffery for_each_bio(bio) 423a958937fSDavid Jeffery nr_phys_segs++; 424a958937fSDavid Jeffery return nr_phys_segs; 425a958937fSDavid Jeffery } 426a958937fSDavid Jeffery return 1; 427a6f0788eSChaitanya Kulkarni case REQ_OP_WRITE_ZEROES: 428f9d03f96SChristoph Hellwig return 0; 429f9d03f96SChristoph Hellwig case REQ_OP_WRITE_SAME: 4305cb8850cSKent Overstreet return 1; 431a6f0788eSChaitanya Kulkarni } 4325cb8850cSKent Overstreet 433e9cd19c0SChristoph Hellwig rq_for_each_bvec(bv, rq, iter) 434ff9811b3SBart Van Assche bvec_split_segs(rq->q, &bv, &nr_phys_segs, &nr_sectors, 435708b25b3SBart Van Assche UINT_MAX, UINT_MAX); 4361e428079SJens Axboe return nr_phys_segs; 4371e428079SJens Axboe } 4381e428079SJens Axboe 43948d7727cSMing Lei static inline struct scatterlist *blk_next_sg(struct scatterlist **sg, 440862e5a5eSMing Lei struct scatterlist *sglist) 441862e5a5eSMing Lei { 442862e5a5eSMing Lei if (!*sg) 443862e5a5eSMing Lei return sglist; 444862e5a5eSMing Lei 445862e5a5eSMing Lei /* 446862e5a5eSMing Lei * If the driver previously mapped a shorter list, we could see a 447862e5a5eSMing Lei * termination bit prematurely unless it fully inits the sg table 448862e5a5eSMing Lei * on each mapping. We KNOW that there must be more entries here 449862e5a5eSMing Lei * or the driver would be buggy, so force clear the termination bit 450862e5a5eSMing Lei * to avoid doing a full sg_init_table() in drivers for each command. 451862e5a5eSMing Lei */ 452862e5a5eSMing Lei sg_unmark_end(*sg); 453862e5a5eSMing Lei return sg_next(*sg); 454862e5a5eSMing Lei } 455862e5a5eSMing Lei 456862e5a5eSMing Lei static unsigned blk_bvec_map_sg(struct request_queue *q, 457862e5a5eSMing Lei struct bio_vec *bvec, struct scatterlist *sglist, 458862e5a5eSMing Lei struct scatterlist **sg) 459862e5a5eSMing Lei { 460862e5a5eSMing Lei unsigned nbytes = bvec->bv_len; 4618a96a0e4SChristoph Hellwig unsigned nsegs = 0, total = 0; 462862e5a5eSMing Lei 463862e5a5eSMing Lei while (nbytes > 0) { 4648a96a0e4SChristoph Hellwig unsigned offset = bvec->bv_offset + total; 465429120f3SMing Lei unsigned len = min(get_max_segment_size(q, bvec->bv_page, 466429120f3SMing Lei offset), nbytes); 467f9f76879SChristoph Hellwig struct page *page = bvec->bv_page; 468f9f76879SChristoph Hellwig 469f9f76879SChristoph Hellwig /* 470f9f76879SChristoph Hellwig * Unfortunately a fair number of drivers barf on scatterlists 471f9f76879SChristoph Hellwig * that have an offset larger than PAGE_SIZE, despite other 472f9f76879SChristoph Hellwig * subsystems dealing with that invariant just fine. For now 473f9f76879SChristoph Hellwig * stick to the legacy format where we never present those from 474f9f76879SChristoph Hellwig * the block layer, but the code below should be removed once 475f9f76879SChristoph Hellwig * these offenders (mostly MMC/SD drivers) are fixed. 476f9f76879SChristoph Hellwig */ 477f9f76879SChristoph Hellwig page += (offset >> PAGE_SHIFT); 478f9f76879SChristoph Hellwig offset &= ~PAGE_MASK; 479862e5a5eSMing Lei 480862e5a5eSMing Lei *sg = blk_next_sg(sg, sglist); 481f9f76879SChristoph Hellwig sg_set_page(*sg, page, len, offset); 482862e5a5eSMing Lei 4838a96a0e4SChristoph Hellwig total += len; 4848a96a0e4SChristoph Hellwig nbytes -= len; 485862e5a5eSMing Lei nsegs++; 486862e5a5eSMing Lei } 487862e5a5eSMing Lei 488862e5a5eSMing Lei return nsegs; 489862e5a5eSMing Lei } 490862e5a5eSMing Lei 49116e3e418SMing Lei static inline int __blk_bvec_map_sg(struct bio_vec bv, 49216e3e418SMing Lei struct scatterlist *sglist, struct scatterlist **sg) 49316e3e418SMing Lei { 49416e3e418SMing Lei *sg = blk_next_sg(sg, sglist); 49516e3e418SMing Lei sg_set_page(*sg, bv.bv_page, bv.bv_len, bv.bv_offset); 49616e3e418SMing Lei return 1; 49716e3e418SMing Lei } 49816e3e418SMing Lei 499f6970f83SMing Lei /* only try to merge bvecs into one sg if they are from two bios */ 500f6970f83SMing Lei static inline bool 501f6970f83SMing Lei __blk_segment_map_sg_merge(struct request_queue *q, struct bio_vec *bvec, 502f6970f83SMing Lei struct bio_vec *bvprv, struct scatterlist **sg) 503963ab9e5SAsias He { 504963ab9e5SAsias He 505963ab9e5SAsias He int nbytes = bvec->bv_len; 506963ab9e5SAsias He 507f6970f83SMing Lei if (!*sg) 508f6970f83SMing Lei return false; 509f6970f83SMing Lei 510b4b6cb61SMing Lei if ((*sg)->length + nbytes > queue_max_segment_size(q)) 511f6970f83SMing Lei return false; 512f6970f83SMing Lei 5133dccdae5SChristoph Hellwig if (!biovec_phys_mergeable(q, bvprv, bvec)) 514f6970f83SMing Lei return false; 515963ab9e5SAsias He 516963ab9e5SAsias He (*sg)->length += nbytes; 517f6970f83SMing Lei 518f6970f83SMing Lei return true; 519963ab9e5SAsias He } 520963ab9e5SAsias He 5215cb8850cSKent Overstreet static int __blk_bios_map_sg(struct request_queue *q, struct bio *bio, 5225cb8850cSKent Overstreet struct scatterlist *sglist, 5235cb8850cSKent Overstreet struct scatterlist **sg) 5245cb8850cSKent Overstreet { 5253f649ab7SKees Cook struct bio_vec bvec, bvprv = { NULL }; 5265cb8850cSKent Overstreet struct bvec_iter iter; 52738417468SChristoph Hellwig int nsegs = 0; 528f6970f83SMing Lei bool new_bio = false; 5295cb8850cSKent Overstreet 530f6970f83SMing Lei for_each_bio(bio) { 531f6970f83SMing Lei bio_for_each_bvec(bvec, bio, iter) { 532f6970f83SMing Lei /* 533f6970f83SMing Lei * Only try to merge bvecs from two bios given we 534f6970f83SMing Lei * have done bio internal merge when adding pages 535f6970f83SMing Lei * to bio 536f6970f83SMing Lei */ 537f6970f83SMing Lei if (new_bio && 538f6970f83SMing Lei __blk_segment_map_sg_merge(q, &bvec, &bvprv, sg)) 539f6970f83SMing Lei goto next_bvec; 540f6970f83SMing Lei 541f6970f83SMing Lei if (bvec.bv_offset + bvec.bv_len <= PAGE_SIZE) 542f6970f83SMing Lei nsegs += __blk_bvec_map_sg(bvec, sglist, sg); 543f6970f83SMing Lei else 544f6970f83SMing Lei nsegs += blk_bvec_map_sg(q, &bvec, sglist, sg); 545f6970f83SMing Lei next_bvec: 546f6970f83SMing Lei new_bio = false; 547f6970f83SMing Lei } 548b21e11c5SMing Lei if (likely(bio->bi_iter.bi_size)) { 549f6970f83SMing Lei bvprv = bvec; 550f6970f83SMing Lei new_bio = true; 551f6970f83SMing Lei } 552b21e11c5SMing Lei } 5535cb8850cSKent Overstreet 5545cb8850cSKent Overstreet return nsegs; 5555cb8850cSKent Overstreet } 5565cb8850cSKent Overstreet 557d6d48196SJens Axboe /* 558d6d48196SJens Axboe * map a request to scatterlist, return number of sg entries setup. Caller 559d6d48196SJens Axboe * must make sure sg can hold rq->nr_phys_segments entries 560d6d48196SJens Axboe */ 56189de1504SChristoph Hellwig int __blk_rq_map_sg(struct request_queue *q, struct request *rq, 56289de1504SChristoph Hellwig struct scatterlist *sglist, struct scatterlist **last_sg) 563d6d48196SJens Axboe { 5645cb8850cSKent Overstreet int nsegs = 0; 565d6d48196SJens Axboe 566f9d03f96SChristoph Hellwig if (rq->rq_flags & RQF_SPECIAL_PAYLOAD) 56789de1504SChristoph Hellwig nsegs = __blk_bvec_map_sg(rq->special_vec, sglist, last_sg); 568f9d03f96SChristoph Hellwig else if (rq->bio && bio_op(rq->bio) == REQ_OP_WRITE_SAME) 56989de1504SChristoph Hellwig nsegs = __blk_bvec_map_sg(bio_iovec(rq->bio), sglist, last_sg); 570f9d03f96SChristoph Hellwig else if (rq->bio) 57189de1504SChristoph Hellwig nsegs = __blk_bios_map_sg(q, rq->bio, sglist, last_sg); 572f18573abSFUJITA Tomonori 57389de1504SChristoph Hellwig if (*last_sg) 57489de1504SChristoph Hellwig sg_mark_end(*last_sg); 575d6d48196SJens Axboe 57612e57f59SMing Lei /* 57712e57f59SMing Lei * Something must have been wrong if the figured number of 57812e57f59SMing Lei * segment is bigger than number of req's physical segments 57912e57f59SMing Lei */ 580f9d03f96SChristoph Hellwig WARN_ON(nsegs > blk_rq_nr_phys_segments(rq)); 58112e57f59SMing Lei 582d6d48196SJens Axboe return nsegs; 583d6d48196SJens Axboe } 58489de1504SChristoph Hellwig EXPORT_SYMBOL(__blk_rq_map_sg); 585d6d48196SJens Axboe 586943b40c8SMing Lei static inline unsigned int blk_rq_get_max_segments(struct request *rq) 587943b40c8SMing Lei { 588943b40c8SMing Lei if (req_op(rq) == REQ_OP_DISCARD) 589943b40c8SMing Lei return queue_max_discard_segments(rq->q); 590943b40c8SMing Lei return queue_max_segments(rq->q); 591943b40c8SMing Lei } 592943b40c8SMing Lei 593badf7f64SChristoph Hellwig static inline unsigned int blk_rq_get_max_sectors(struct request *rq, 594badf7f64SChristoph Hellwig sector_t offset) 595badf7f64SChristoph Hellwig { 596badf7f64SChristoph Hellwig struct request_queue *q = rq->q; 597badf7f64SChristoph Hellwig 598badf7f64SChristoph Hellwig if (blk_rq_is_passthrough(rq)) 599badf7f64SChristoph Hellwig return q->limits.max_hw_sectors; 600badf7f64SChristoph Hellwig 601badf7f64SChristoph Hellwig if (!q->limits.chunk_sectors || 602badf7f64SChristoph Hellwig req_op(rq) == REQ_OP_DISCARD || 603badf7f64SChristoph Hellwig req_op(rq) == REQ_OP_SECURE_ERASE) 604badf7f64SChristoph Hellwig return blk_queue_get_max_sectors(q, req_op(rq)); 605badf7f64SChristoph Hellwig 606badf7f64SChristoph Hellwig return min(blk_max_size_offset(q, offset, 0), 607badf7f64SChristoph Hellwig blk_queue_get_max_sectors(q, req_op(rq))); 608badf7f64SChristoph Hellwig } 609badf7f64SChristoph Hellwig 61014ccb66bSChristoph Hellwig static inline int ll_new_hw_segment(struct request *req, struct bio *bio, 61114ccb66bSChristoph Hellwig unsigned int nr_phys_segs) 612d6d48196SJens Axboe { 6132705dfb2SMing Lei if (blk_integrity_merge_bio(req->q, req, bio) == false) 61413f05c8dSMartin K. Petersen goto no_merge; 61513f05c8dSMartin K. Petersen 6162705dfb2SMing Lei /* discard request merge won't add new segment */ 6172705dfb2SMing Lei if (req_op(req) == REQ_OP_DISCARD) 6182705dfb2SMing Lei return 1; 6192705dfb2SMing Lei 6202705dfb2SMing Lei if (req->nr_phys_segments + nr_phys_segs > blk_rq_get_max_segments(req)) 62113f05c8dSMartin K. Petersen goto no_merge; 622d6d48196SJens Axboe 623d6d48196SJens Axboe /* 624d6d48196SJens Axboe * This will form the start of a new hw segment. Bump both 625d6d48196SJens Axboe * counters. 626d6d48196SJens Axboe */ 627d6d48196SJens Axboe req->nr_phys_segments += nr_phys_segs; 628d6d48196SJens Axboe return 1; 62913f05c8dSMartin K. Petersen 63013f05c8dSMartin K. Petersen no_merge: 63114ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 63213f05c8dSMartin K. Petersen return 0; 633d6d48196SJens Axboe } 634d6d48196SJens Axboe 63514ccb66bSChristoph Hellwig int ll_back_merge_fn(struct request *req, struct bio *bio, unsigned int nr_segs) 636d6d48196SJens Axboe { 6375e7c4274SJens Axboe if (req_gap_back_merge(req, bio)) 6385e7c4274SJens Axboe return 0; 6397f39add3SSagi Grimberg if (blk_integrity_rq(req) && 6407f39add3SSagi Grimberg integrity_req_gap_back_merge(req, bio)) 6417f39add3SSagi Grimberg return 0; 642a892c8d5SSatya Tangirala if (!bio_crypt_ctx_back_mergeable(req, bio)) 643a892c8d5SSatya Tangirala return 0; 644f31dc1cdSMartin K. Petersen if (blk_rq_sectors(req) + bio_sectors(bio) > 64517007f39SDamien Le Moal blk_rq_get_max_sectors(req, blk_rq_pos(req))) { 64614ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 647d6d48196SJens Axboe return 0; 648d6d48196SJens Axboe } 649d6d48196SJens Axboe 65014ccb66bSChristoph Hellwig return ll_new_hw_segment(req, bio, nr_segs); 651d6d48196SJens Axboe } 652d6d48196SJens Axboe 653eda5cc99SChristoph Hellwig static int ll_front_merge_fn(struct request *req, struct bio *bio, 654eda5cc99SChristoph Hellwig unsigned int nr_segs) 655d6d48196SJens Axboe { 6565e7c4274SJens Axboe if (req_gap_front_merge(req, bio)) 6575e7c4274SJens Axboe return 0; 6587f39add3SSagi Grimberg if (blk_integrity_rq(req) && 6597f39add3SSagi Grimberg integrity_req_gap_front_merge(req, bio)) 6607f39add3SSagi Grimberg return 0; 661a892c8d5SSatya Tangirala if (!bio_crypt_ctx_front_mergeable(req, bio)) 662a892c8d5SSatya Tangirala return 0; 663f31dc1cdSMartin K. Petersen if (blk_rq_sectors(req) + bio_sectors(bio) > 66417007f39SDamien Le Moal blk_rq_get_max_sectors(req, bio->bi_iter.bi_sector)) { 66514ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 666d6d48196SJens Axboe return 0; 667d6d48196SJens Axboe } 668d6d48196SJens Axboe 66914ccb66bSChristoph Hellwig return ll_new_hw_segment(req, bio, nr_segs); 670d6d48196SJens Axboe } 671d6d48196SJens Axboe 672445251d0SJens Axboe static bool req_attempt_discard_merge(struct request_queue *q, struct request *req, 673445251d0SJens Axboe struct request *next) 674445251d0SJens Axboe { 675445251d0SJens Axboe unsigned short segments = blk_rq_nr_discard_segments(req); 676445251d0SJens Axboe 677445251d0SJens Axboe if (segments >= queue_max_discard_segments(q)) 678445251d0SJens Axboe goto no_merge; 679445251d0SJens Axboe if (blk_rq_sectors(req) + bio_sectors(next->bio) > 680445251d0SJens Axboe blk_rq_get_max_sectors(req, blk_rq_pos(req))) 681445251d0SJens Axboe goto no_merge; 682445251d0SJens Axboe 683445251d0SJens Axboe req->nr_phys_segments = segments + blk_rq_nr_discard_segments(next); 684445251d0SJens Axboe return true; 685445251d0SJens Axboe no_merge: 686445251d0SJens Axboe req_set_nomerge(q, req); 687445251d0SJens Axboe return false; 688445251d0SJens Axboe } 689445251d0SJens Axboe 690d6d48196SJens Axboe static int ll_merge_requests_fn(struct request_queue *q, struct request *req, 691d6d48196SJens Axboe struct request *next) 692d6d48196SJens Axboe { 693d6d48196SJens Axboe int total_phys_segments; 694d6d48196SJens Axboe 6955e7c4274SJens Axboe if (req_gap_back_merge(req, next->bio)) 696854fbb9cSKeith Busch return 0; 697854fbb9cSKeith Busch 698d6d48196SJens Axboe /* 699d6d48196SJens Axboe * Will it become too large? 700d6d48196SJens Axboe */ 701f31dc1cdSMartin K. Petersen if ((blk_rq_sectors(req) + blk_rq_sectors(next)) > 70217007f39SDamien Le Moal blk_rq_get_max_sectors(req, blk_rq_pos(req))) 703d6d48196SJens Axboe return 0; 704d6d48196SJens Axboe 705d6d48196SJens Axboe total_phys_segments = req->nr_phys_segments + next->nr_phys_segments; 706943b40c8SMing Lei if (total_phys_segments > blk_rq_get_max_segments(req)) 707d6d48196SJens Axboe return 0; 708d6d48196SJens Axboe 7094eaf99beSMartin K. Petersen if (blk_integrity_merge_rq(q, req, next) == false) 71013f05c8dSMartin K. Petersen return 0; 71113f05c8dSMartin K. Petersen 712a892c8d5SSatya Tangirala if (!bio_crypt_ctx_merge_rq(req, next)) 713a892c8d5SSatya Tangirala return 0; 714a892c8d5SSatya Tangirala 715d6d48196SJens Axboe /* Merge is OK... */ 716d6d48196SJens Axboe req->nr_phys_segments = total_phys_segments; 717d6d48196SJens Axboe return 1; 718d6d48196SJens Axboe } 719d6d48196SJens Axboe 72080a761fdSTejun Heo /** 72180a761fdSTejun Heo * blk_rq_set_mixed_merge - mark a request as mixed merge 72280a761fdSTejun Heo * @rq: request to mark as mixed merge 72380a761fdSTejun Heo * 72480a761fdSTejun Heo * Description: 72580a761fdSTejun Heo * @rq is about to be mixed merged. Make sure the attributes 72680a761fdSTejun Heo * which can be mixed are set in each bio and mark @rq as mixed 72780a761fdSTejun Heo * merged. 72880a761fdSTejun Heo */ 72980a761fdSTejun Heo void blk_rq_set_mixed_merge(struct request *rq) 73080a761fdSTejun Heo { 73180a761fdSTejun Heo unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK; 73280a761fdSTejun Heo struct bio *bio; 73380a761fdSTejun Heo 734e8064021SChristoph Hellwig if (rq->rq_flags & RQF_MIXED_MERGE) 73580a761fdSTejun Heo return; 73680a761fdSTejun Heo 73780a761fdSTejun Heo /* 73880a761fdSTejun Heo * @rq will no longer represent mixable attributes for all the 73980a761fdSTejun Heo * contained bios. It will just track those of the first one. 74080a761fdSTejun Heo * Distributes the attributs to each bio. 74180a761fdSTejun Heo */ 74280a761fdSTejun Heo for (bio = rq->bio; bio; bio = bio->bi_next) { 7431eff9d32SJens Axboe WARN_ON_ONCE((bio->bi_opf & REQ_FAILFAST_MASK) && 7441eff9d32SJens Axboe (bio->bi_opf & REQ_FAILFAST_MASK) != ff); 7451eff9d32SJens Axboe bio->bi_opf |= ff; 74680a761fdSTejun Heo } 747e8064021SChristoph Hellwig rq->rq_flags |= RQF_MIXED_MERGE; 74880a761fdSTejun Heo } 74980a761fdSTejun Heo 750b9c54f56SKonstantin Khlebnikov static void blk_account_io_merge_request(struct request *req) 75126308eabSJerome Marchand { 75226308eabSJerome Marchand if (blk_do_io_stat(req)) { 753112f158fSMike Snitzer part_stat_lock(); 754b9c54f56SKonstantin Khlebnikov part_stat_inc(req->part, merges[op_stat_group(req_op(req))]); 75526308eabSJerome Marchand part_stat_unlock(); 75626308eabSJerome Marchand } 75726308eabSJerome Marchand } 758b9c54f56SKonstantin Khlebnikov 759e96c0d83SEric Biggers static enum elv_merge blk_try_req_merge(struct request *req, 760e96c0d83SEric Biggers struct request *next) 76169840466SJianchao Wang { 76269840466SJianchao Wang if (blk_discard_mergable(req)) 76369840466SJianchao Wang return ELEVATOR_DISCARD_MERGE; 76469840466SJianchao Wang else if (blk_rq_pos(req) + blk_rq_sectors(req) == blk_rq_pos(next)) 76569840466SJianchao Wang return ELEVATOR_BACK_MERGE; 76669840466SJianchao Wang 76769840466SJianchao Wang return ELEVATOR_NO_MERGE; 76869840466SJianchao Wang } 76926308eabSJerome Marchand 770badf7f64SChristoph Hellwig static inline bool blk_write_same_mergeable(struct bio *a, struct bio *b) 771badf7f64SChristoph Hellwig { 772badf7f64SChristoph Hellwig if (bio_page(a) == bio_page(b) && bio_offset(a) == bio_offset(b)) 773badf7f64SChristoph Hellwig return true; 774badf7f64SChristoph Hellwig return false; 775badf7f64SChristoph Hellwig } 776badf7f64SChristoph Hellwig 777d6d48196SJens Axboe /* 778b973cb7eSJens Axboe * For non-mq, this has to be called with the request spinlock acquired. 779b973cb7eSJens Axboe * For mq with scheduling, the appropriate queue wide lock should be held. 780d6d48196SJens Axboe */ 781b973cb7eSJens Axboe static struct request *attempt_merge(struct request_queue *q, 782b973cb7eSJens Axboe struct request *req, struct request *next) 783d6d48196SJens Axboe { 784d6d48196SJens Axboe if (!rq_mergeable(req) || !rq_mergeable(next)) 785b973cb7eSJens Axboe return NULL; 786d6d48196SJens Axboe 787288dab8aSChristoph Hellwig if (req_op(req) != req_op(next)) 788b973cb7eSJens Axboe return NULL; 789f31dc1cdSMartin K. Petersen 790d6d48196SJens Axboe if (rq_data_dir(req) != rq_data_dir(next) 7912081a56bSJens Axboe || req->rq_disk != next->rq_disk) 792b973cb7eSJens Axboe return NULL; 793d6d48196SJens Axboe 7948fe0d473SMike Christie if (req_op(req) == REQ_OP_WRITE_SAME && 7954363ac7cSMartin K. Petersen !blk_write_same_mergeable(req->bio, next->bio)) 796b973cb7eSJens Axboe return NULL; 7974363ac7cSMartin K. Petersen 798d6d48196SJens Axboe /* 799cb6934f8SJens Axboe * Don't allow merge of different write hints, or for a hint with 800cb6934f8SJens Axboe * non-hint IO. 801cb6934f8SJens Axboe */ 802cb6934f8SJens Axboe if (req->write_hint != next->write_hint) 803cb6934f8SJens Axboe return NULL; 804cb6934f8SJens Axboe 805668ffc03SDamien Le Moal if (req->ioprio != next->ioprio) 806668ffc03SDamien Le Moal return NULL; 807668ffc03SDamien Le Moal 808cb6934f8SJens Axboe /* 809d6d48196SJens Axboe * If we are allowed to merge, then append bio list 810d6d48196SJens Axboe * from next to rq and release next. merge_requests_fn 811d6d48196SJens Axboe * will have updated segment counts, update sector 812445251d0SJens Axboe * counts here. Handle DISCARDs separately, as they 813445251d0SJens Axboe * have separate settings. 814d6d48196SJens Axboe */ 81569840466SJianchao Wang 81669840466SJianchao Wang switch (blk_try_req_merge(req, next)) { 81769840466SJianchao Wang case ELEVATOR_DISCARD_MERGE: 818445251d0SJens Axboe if (!req_attempt_discard_merge(q, req, next)) 819445251d0SJens Axboe return NULL; 82069840466SJianchao Wang break; 82169840466SJianchao Wang case ELEVATOR_BACK_MERGE: 82269840466SJianchao Wang if (!ll_merge_requests_fn(q, req, next)) 823b973cb7eSJens Axboe return NULL; 82469840466SJianchao Wang break; 82569840466SJianchao Wang default: 82669840466SJianchao Wang return NULL; 82769840466SJianchao Wang } 828d6d48196SJens Axboe 829d6d48196SJens Axboe /* 83080a761fdSTejun Heo * If failfast settings disagree or any of the two is already 83180a761fdSTejun Heo * a mixed merge, mark both as mixed before proceeding. This 83280a761fdSTejun Heo * makes sure that all involved bios have mixable attributes 83380a761fdSTejun Heo * set properly. 83480a761fdSTejun Heo */ 835e8064021SChristoph Hellwig if (((req->rq_flags | next->rq_flags) & RQF_MIXED_MERGE) || 83680a761fdSTejun Heo (req->cmd_flags & REQ_FAILFAST_MASK) != 83780a761fdSTejun Heo (next->cmd_flags & REQ_FAILFAST_MASK)) { 83880a761fdSTejun Heo blk_rq_set_mixed_merge(req); 83980a761fdSTejun Heo blk_rq_set_mixed_merge(next); 84080a761fdSTejun Heo } 84180a761fdSTejun Heo 84280a761fdSTejun Heo /* 843522a7775SOmar Sandoval * At this point we have either done a back merge or front merge. We 844522a7775SOmar Sandoval * need the smaller start_time_ns of the merged requests to be the 845522a7775SOmar Sandoval * current request for accounting purposes. 846d6d48196SJens Axboe */ 847522a7775SOmar Sandoval if (next->start_time_ns < req->start_time_ns) 848522a7775SOmar Sandoval req->start_time_ns = next->start_time_ns; 849d6d48196SJens Axboe 850d6d48196SJens Axboe req->biotail->bi_next = next->bio; 851d6d48196SJens Axboe req->biotail = next->biotail; 852d6d48196SJens Axboe 853a2dec7b3STejun Heo req->__data_len += blk_rq_bytes(next); 854d6d48196SJens Axboe 8552a5cf35cSMing Lei if (!blk_discard_mergable(req)) 856d6d48196SJens Axboe elv_merge_requests(q, req, next); 857d6d48196SJens Axboe 85842dad764SJerome Marchand /* 85942dad764SJerome Marchand * 'next' is going away, so update stats accordingly 86042dad764SJerome Marchand */ 861b9c54f56SKonstantin Khlebnikov blk_account_io_merge_request(next); 862d6d48196SJens Axboe 863a54895faSChristoph Hellwig trace_block_rq_merge(next); 864f3bdc62fSJan Kara 865e4d750c9SJens Axboe /* 866e4d750c9SJens Axboe * ownership of bio passed from next to req, return 'next' for 867e4d750c9SJens Axboe * the caller to free 868e4d750c9SJens Axboe */ 8691cd96c24SBoaz Harrosh next->bio = NULL; 870b973cb7eSJens Axboe return next; 871d6d48196SJens Axboe } 872d6d48196SJens Axboe 873eda5cc99SChristoph Hellwig static struct request *attempt_back_merge(struct request_queue *q, 874eda5cc99SChristoph Hellwig struct request *rq) 875d6d48196SJens Axboe { 876d6d48196SJens Axboe struct request *next = elv_latter_request(q, rq); 877d6d48196SJens Axboe 878d6d48196SJens Axboe if (next) 879d6d48196SJens Axboe return attempt_merge(q, rq, next); 880d6d48196SJens Axboe 881b973cb7eSJens Axboe return NULL; 882d6d48196SJens Axboe } 883d6d48196SJens Axboe 884eda5cc99SChristoph Hellwig static struct request *attempt_front_merge(struct request_queue *q, 885eda5cc99SChristoph Hellwig struct request *rq) 886d6d48196SJens Axboe { 887d6d48196SJens Axboe struct request *prev = elv_former_request(q, rq); 888d6d48196SJens Axboe 889d6d48196SJens Axboe if (prev) 890d6d48196SJens Axboe return attempt_merge(q, prev, rq); 891d6d48196SJens Axboe 892b973cb7eSJens Axboe return NULL; 893d6d48196SJens Axboe } 8945e84ea3aSJens Axboe 895fd2ef39cSJan Kara /* 896fd2ef39cSJan Kara * Try to merge 'next' into 'rq'. Return true if the merge happened, false 897fd2ef39cSJan Kara * otherwise. The caller is responsible for freeing 'next' if the merge 898fd2ef39cSJan Kara * happened. 899fd2ef39cSJan Kara */ 900fd2ef39cSJan Kara bool blk_attempt_req_merge(struct request_queue *q, struct request *rq, 9015e84ea3aSJens Axboe struct request *next) 9025e84ea3aSJens Axboe { 903fd2ef39cSJan Kara return attempt_merge(q, rq, next); 9045e84ea3aSJens Axboe } 905050c8ea8STejun Heo 906050c8ea8STejun Heo bool blk_rq_merge_ok(struct request *rq, struct bio *bio) 907050c8ea8STejun Heo { 908e2a60da7SMartin K. Petersen if (!rq_mergeable(rq) || !bio_mergeable(bio)) 909050c8ea8STejun Heo return false; 910050c8ea8STejun Heo 911288dab8aSChristoph Hellwig if (req_op(rq) != bio_op(bio)) 912f31dc1cdSMartin K. Petersen return false; 913f31dc1cdSMartin K. Petersen 914050c8ea8STejun Heo /* different data direction or already started, don't merge */ 915050c8ea8STejun Heo if (bio_data_dir(bio) != rq_data_dir(rq)) 916050c8ea8STejun Heo return false; 917050c8ea8STejun Heo 9182081a56bSJens Axboe /* must be same device */ 919309dca30SChristoph Hellwig if (rq->rq_disk != bio->bi_bdev->bd_disk) 920050c8ea8STejun Heo return false; 921050c8ea8STejun Heo 922050c8ea8STejun Heo /* only merge integrity protected bio into ditto rq */ 9234eaf99beSMartin K. Petersen if (blk_integrity_merge_bio(rq->q, rq, bio) == false) 924050c8ea8STejun Heo return false; 925050c8ea8STejun Heo 926a892c8d5SSatya Tangirala /* Only merge if the crypt contexts are compatible */ 927a892c8d5SSatya Tangirala if (!bio_crypt_rq_ctx_compatible(rq, bio)) 928a892c8d5SSatya Tangirala return false; 929a892c8d5SSatya Tangirala 9304363ac7cSMartin K. Petersen /* must be using the same buffer */ 9318fe0d473SMike Christie if (req_op(rq) == REQ_OP_WRITE_SAME && 9324363ac7cSMartin K. Petersen !blk_write_same_mergeable(rq->bio, bio)) 9334363ac7cSMartin K. Petersen return false; 9344363ac7cSMartin K. Petersen 935cb6934f8SJens Axboe /* 936cb6934f8SJens Axboe * Don't allow merge of different write hints, or for a hint with 937cb6934f8SJens Axboe * non-hint IO. 938cb6934f8SJens Axboe */ 939cb6934f8SJens Axboe if (rq->write_hint != bio->bi_write_hint) 940cb6934f8SJens Axboe return false; 941cb6934f8SJens Axboe 942668ffc03SDamien Le Moal if (rq->ioprio != bio_prio(bio)) 943668ffc03SDamien Le Moal return false; 944668ffc03SDamien Le Moal 945050c8ea8STejun Heo return true; 946050c8ea8STejun Heo } 947050c8ea8STejun Heo 94834fe7c05SChristoph Hellwig enum elv_merge blk_try_merge(struct request *rq, struct bio *bio) 949050c8ea8STejun Heo { 95069840466SJianchao Wang if (blk_discard_mergable(rq)) 9511e739730SChristoph Hellwig return ELEVATOR_DISCARD_MERGE; 9521e739730SChristoph Hellwig else if (blk_rq_pos(rq) + blk_rq_sectors(rq) == bio->bi_iter.bi_sector) 953050c8ea8STejun Heo return ELEVATOR_BACK_MERGE; 9544f024f37SKent Overstreet else if (blk_rq_pos(rq) - bio_sectors(bio) == bio->bi_iter.bi_sector) 955050c8ea8STejun Heo return ELEVATOR_FRONT_MERGE; 956050c8ea8STejun Heo return ELEVATOR_NO_MERGE; 957050c8ea8STejun Heo } 9588e756373SBaolin Wang 9598e756373SBaolin Wang static void blk_account_io_merge_bio(struct request *req) 9608e756373SBaolin Wang { 9618e756373SBaolin Wang if (!blk_do_io_stat(req)) 9628e756373SBaolin Wang return; 9638e756373SBaolin Wang 9648e756373SBaolin Wang part_stat_lock(); 9658e756373SBaolin Wang part_stat_inc(req->part, merges[op_stat_group(req_op(req))]); 9668e756373SBaolin Wang part_stat_unlock(); 9678e756373SBaolin Wang } 9688e756373SBaolin Wang 969eda5cc99SChristoph Hellwig enum bio_merge_status { 970eda5cc99SChristoph Hellwig BIO_MERGE_OK, 971eda5cc99SChristoph Hellwig BIO_MERGE_NONE, 972eda5cc99SChristoph Hellwig BIO_MERGE_FAILED, 973eda5cc99SChristoph Hellwig }; 974eda5cc99SChristoph Hellwig 975eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_back_merge(struct request *req, 976eda5cc99SChristoph Hellwig struct bio *bio, unsigned int nr_segs) 9778e756373SBaolin Wang { 9788e756373SBaolin Wang const int ff = bio->bi_opf & REQ_FAILFAST_MASK; 9798e756373SBaolin Wang 9808e756373SBaolin Wang if (!ll_back_merge_fn(req, bio, nr_segs)) 9817d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 9828e756373SBaolin Wang 983e8a676d6SChristoph Hellwig trace_block_bio_backmerge(bio); 9848e756373SBaolin Wang rq_qos_merge(req->q, req, bio); 9858e756373SBaolin Wang 9868e756373SBaolin Wang if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) 9878e756373SBaolin Wang blk_rq_set_mixed_merge(req); 9888e756373SBaolin Wang 9898e756373SBaolin Wang req->biotail->bi_next = bio; 9908e756373SBaolin Wang req->biotail = bio; 9918e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 9928e756373SBaolin Wang 9938e756373SBaolin Wang bio_crypt_free_ctx(bio); 9948e756373SBaolin Wang 9958e756373SBaolin Wang blk_account_io_merge_bio(req); 9967d7ca7c5SBaolin Wang return BIO_MERGE_OK; 9978e756373SBaolin Wang } 9988e756373SBaolin Wang 999eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_front_merge(struct request *req, 1000eda5cc99SChristoph Hellwig struct bio *bio, unsigned int nr_segs) 10018e756373SBaolin Wang { 10028e756373SBaolin Wang const int ff = bio->bi_opf & REQ_FAILFAST_MASK; 10038e756373SBaolin Wang 10048e756373SBaolin Wang if (!ll_front_merge_fn(req, bio, nr_segs)) 10057d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 10068e756373SBaolin Wang 1007e8a676d6SChristoph Hellwig trace_block_bio_frontmerge(bio); 10088e756373SBaolin Wang rq_qos_merge(req->q, req, bio); 10098e756373SBaolin Wang 10108e756373SBaolin Wang if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) 10118e756373SBaolin Wang blk_rq_set_mixed_merge(req); 10128e756373SBaolin Wang 10138e756373SBaolin Wang bio->bi_next = req->bio; 10148e756373SBaolin Wang req->bio = bio; 10158e756373SBaolin Wang 10168e756373SBaolin Wang req->__sector = bio->bi_iter.bi_sector; 10178e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 10188e756373SBaolin Wang 10198e756373SBaolin Wang bio_crypt_do_front_merge(req, bio); 10208e756373SBaolin Wang 10218e756373SBaolin Wang blk_account_io_merge_bio(req); 10227d7ca7c5SBaolin Wang return BIO_MERGE_OK; 10238e756373SBaolin Wang } 10248e756373SBaolin Wang 1025eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_discard_merge(struct request_queue *q, 1026eda5cc99SChristoph Hellwig struct request *req, struct bio *bio) 10278e756373SBaolin Wang { 10288e756373SBaolin Wang unsigned short segments = blk_rq_nr_discard_segments(req); 10298e756373SBaolin Wang 10308e756373SBaolin Wang if (segments >= queue_max_discard_segments(q)) 10318e756373SBaolin Wang goto no_merge; 10328e756373SBaolin Wang if (blk_rq_sectors(req) + bio_sectors(bio) > 10338e756373SBaolin Wang blk_rq_get_max_sectors(req, blk_rq_pos(req))) 10348e756373SBaolin Wang goto no_merge; 10358e756373SBaolin Wang 10368e756373SBaolin Wang rq_qos_merge(q, req, bio); 10378e756373SBaolin Wang 10388e756373SBaolin Wang req->biotail->bi_next = bio; 10398e756373SBaolin Wang req->biotail = bio; 10408e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 10418e756373SBaolin Wang req->nr_phys_segments = segments + 1; 10428e756373SBaolin Wang 10438e756373SBaolin Wang blk_account_io_merge_bio(req); 10447d7ca7c5SBaolin Wang return BIO_MERGE_OK; 10458e756373SBaolin Wang no_merge: 10468e756373SBaolin Wang req_set_nomerge(q, req); 10477d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 10487d7ca7c5SBaolin Wang } 10497d7ca7c5SBaolin Wang 10507d7ca7c5SBaolin Wang static enum bio_merge_status blk_attempt_bio_merge(struct request_queue *q, 10517d7ca7c5SBaolin Wang struct request *rq, 10527d7ca7c5SBaolin Wang struct bio *bio, 10537d7ca7c5SBaolin Wang unsigned int nr_segs, 10547d7ca7c5SBaolin Wang bool sched_allow_merge) 10557d7ca7c5SBaolin Wang { 10567d7ca7c5SBaolin Wang if (!blk_rq_merge_ok(rq, bio)) 10577d7ca7c5SBaolin Wang return BIO_MERGE_NONE; 10587d7ca7c5SBaolin Wang 10597d7ca7c5SBaolin Wang switch (blk_try_merge(rq, bio)) { 10607d7ca7c5SBaolin Wang case ELEVATOR_BACK_MERGE: 1061265600b7SBaolin Wang if (!sched_allow_merge || blk_mq_sched_allow_merge(q, rq, bio)) 10627d7ca7c5SBaolin Wang return bio_attempt_back_merge(rq, bio, nr_segs); 10637d7ca7c5SBaolin Wang break; 10647d7ca7c5SBaolin Wang case ELEVATOR_FRONT_MERGE: 1065265600b7SBaolin Wang if (!sched_allow_merge || blk_mq_sched_allow_merge(q, rq, bio)) 10667d7ca7c5SBaolin Wang return bio_attempt_front_merge(rq, bio, nr_segs); 10677d7ca7c5SBaolin Wang break; 10687d7ca7c5SBaolin Wang case ELEVATOR_DISCARD_MERGE: 10697d7ca7c5SBaolin Wang return bio_attempt_discard_merge(q, rq, bio); 10707d7ca7c5SBaolin Wang default: 10717d7ca7c5SBaolin Wang return BIO_MERGE_NONE; 10727d7ca7c5SBaolin Wang } 10737d7ca7c5SBaolin Wang 10747d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 10758e756373SBaolin Wang } 10768e756373SBaolin Wang 10778e756373SBaolin Wang /** 10788e756373SBaolin Wang * blk_attempt_plug_merge - try to merge with %current's plugged list 10798e756373SBaolin Wang * @q: request_queue new bio is being queued at 10808e756373SBaolin Wang * @bio: new bio being queued 10818e756373SBaolin Wang * @nr_segs: number of segments in @bio 10828e756373SBaolin Wang * @same_queue_rq: pointer to &struct request that gets filled in when 10838e756373SBaolin Wang * another request associated with @q is found on the plug list 10848e756373SBaolin Wang * (optional, may be %NULL) 10858e756373SBaolin Wang * 1086d38a9c04SJens Axboe * Determine whether @bio being queued on @q can be merged with the previous 1087d38a9c04SJens Axboe * request on %current's plugged list. Returns %true if merge was successful, 10888e756373SBaolin Wang * otherwise %false. 10898e756373SBaolin Wang * 10908e756373SBaolin Wang * Plugging coalesces IOs from the same issuer for the same purpose without 10918e756373SBaolin Wang * going through @q->queue_lock. As such it's more of an issuing mechanism 10928e756373SBaolin Wang * than scheduling, and the request, while may have elvpriv data, is not 10938e756373SBaolin Wang * added on the elevator at this point. In addition, we don't have 10948e756373SBaolin Wang * reliable access to the elevator outside queue lock. Only check basic 10958e756373SBaolin Wang * merging parameters without querying the elevator. 10968e756373SBaolin Wang * 10978e756373SBaolin Wang * Caller must ensure !blk_queue_nomerges(q) beforehand. 10988e756373SBaolin Wang */ 10998e756373SBaolin Wang bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio, 11008e756373SBaolin Wang unsigned int nr_segs, struct request **same_queue_rq) 11018e756373SBaolin Wang { 11028e756373SBaolin Wang struct blk_plug *plug; 11038e756373SBaolin Wang struct request *rq; 11048e756373SBaolin Wang 11058e756373SBaolin Wang plug = blk_mq_plug(q, bio); 1106d38a9c04SJens Axboe if (!plug || list_empty(&plug->mq_list)) 11078e756373SBaolin Wang return false; 11088e756373SBaolin Wang 1109d38a9c04SJens Axboe /* check the previously added entry for a quick merge attempt */ 1110d38a9c04SJens Axboe rq = list_last_entry(&plug->mq_list, struct request, queuelist); 11118e756373SBaolin Wang if (rq->q == q && same_queue_rq) { 11128e756373SBaolin Wang /* 1113d38a9c04SJens Axboe * Only blk-mq multiple hardware queues case checks the rq in 1114d38a9c04SJens Axboe * the same queue, there should be only one such rq in a queue 1115d38a9c04SJens Axboe */ 11168e756373SBaolin Wang *same_queue_rq = rq; 11178e756373SBaolin Wang } 1118d38a9c04SJens Axboe if (blk_attempt_bio_merge(q, rq, bio, nr_segs, false) == BIO_MERGE_OK) 11198e756373SBaolin Wang return true; 11208e756373SBaolin Wang return false; 11218e756373SBaolin Wang } 1122bdc6a287SBaolin Wang 1123bdc6a287SBaolin Wang /* 1124bdc6a287SBaolin Wang * Iterate list of requests and see if we can merge this bio with any 1125bdc6a287SBaolin Wang * of them. 1126bdc6a287SBaolin Wang */ 1127bdc6a287SBaolin Wang bool blk_bio_list_merge(struct request_queue *q, struct list_head *list, 1128bdc6a287SBaolin Wang struct bio *bio, unsigned int nr_segs) 1129bdc6a287SBaolin Wang { 1130bdc6a287SBaolin Wang struct request *rq; 1131bdc6a287SBaolin Wang int checked = 8; 1132bdc6a287SBaolin Wang 1133bdc6a287SBaolin Wang list_for_each_entry_reverse(rq, list, queuelist) { 1134bdc6a287SBaolin Wang if (!checked--) 1135bdc6a287SBaolin Wang break; 1136bdc6a287SBaolin Wang 11377d7ca7c5SBaolin Wang switch (blk_attempt_bio_merge(q, rq, bio, nr_segs, true)) { 11387d7ca7c5SBaolin Wang case BIO_MERGE_NONE: 1139bdc6a287SBaolin Wang continue; 11407d7ca7c5SBaolin Wang case BIO_MERGE_OK: 11417d7ca7c5SBaolin Wang return true; 11427d7ca7c5SBaolin Wang case BIO_MERGE_FAILED: 11437d7ca7c5SBaolin Wang return false; 1144bdc6a287SBaolin Wang } 1145bdc6a287SBaolin Wang 1146bdc6a287SBaolin Wang } 1147bdc6a287SBaolin Wang 1148bdc6a287SBaolin Wang return false; 1149bdc6a287SBaolin Wang } 1150bdc6a287SBaolin Wang EXPORT_SYMBOL_GPL(blk_bio_list_merge); 1151eda5cc99SChristoph Hellwig 1152eda5cc99SChristoph Hellwig bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio, 1153eda5cc99SChristoph Hellwig unsigned int nr_segs, struct request **merged_request) 1154eda5cc99SChristoph Hellwig { 1155eda5cc99SChristoph Hellwig struct request *rq; 1156eda5cc99SChristoph Hellwig 1157eda5cc99SChristoph Hellwig switch (elv_merge(q, &rq, bio)) { 1158eda5cc99SChristoph Hellwig case ELEVATOR_BACK_MERGE: 1159eda5cc99SChristoph Hellwig if (!blk_mq_sched_allow_merge(q, rq, bio)) 1160eda5cc99SChristoph Hellwig return false; 1161eda5cc99SChristoph Hellwig if (bio_attempt_back_merge(rq, bio, nr_segs) != BIO_MERGE_OK) 1162eda5cc99SChristoph Hellwig return false; 1163eda5cc99SChristoph Hellwig *merged_request = attempt_back_merge(q, rq); 1164eda5cc99SChristoph Hellwig if (!*merged_request) 1165eda5cc99SChristoph Hellwig elv_merged_request(q, rq, ELEVATOR_BACK_MERGE); 1166eda5cc99SChristoph Hellwig return true; 1167eda5cc99SChristoph Hellwig case ELEVATOR_FRONT_MERGE: 1168eda5cc99SChristoph Hellwig if (!blk_mq_sched_allow_merge(q, rq, bio)) 1169eda5cc99SChristoph Hellwig return false; 1170eda5cc99SChristoph Hellwig if (bio_attempt_front_merge(rq, bio, nr_segs) != BIO_MERGE_OK) 1171eda5cc99SChristoph Hellwig return false; 1172eda5cc99SChristoph Hellwig *merged_request = attempt_front_merge(q, rq); 1173eda5cc99SChristoph Hellwig if (!*merged_request) 1174eda5cc99SChristoph Hellwig elv_merged_request(q, rq, ELEVATOR_FRONT_MERGE); 1175eda5cc99SChristoph Hellwig return true; 1176eda5cc99SChristoph Hellwig case ELEVATOR_DISCARD_MERGE: 1177eda5cc99SChristoph Hellwig return bio_attempt_discard_merge(q, rq, bio) == BIO_MERGE_OK; 1178eda5cc99SChristoph Hellwig default: 1179eda5cc99SChristoph Hellwig return false; 1180eda5cc99SChristoph Hellwig } 1181eda5cc99SChristoph Hellwig } 1182eda5cc99SChristoph Hellwig EXPORT_SYMBOL_GPL(blk_mq_sched_try_merge); 1183