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 */ 321270a1c91SJens Axboe bio_clear_hipri(bio); 322cc29e1bfSJeffle Xu 323d627065dSChristoph Hellwig return bio_split(bio, sectors, GFP_NOIO, bs); 32454efd50bSKent Overstreet } 32554efd50bSKent Overstreet 326dad77584SBart Van Assche /** 327dad77584SBart Van Assche * __blk_queue_split - split a bio and submit the second half 328dad77584SBart Van Assche * @bio: [in, out] bio to be split 329dad77584SBart Van Assche * @nr_segs: [out] number of segments in the first bio 330dad77584SBart Van Assche * 331dad77584SBart Van Assche * Split a bio into two bios, chain the two bios, submit the second half and 332dad77584SBart Van Assche * store a pointer to the first half in *@bio. If the second bio is still too 333dad77584SBart Van Assche * big it will be split by a recursive call to this function. Since this 334309dca30SChristoph Hellwig * function may allocate a new bio from q->bio_split, it is the responsibility 335309dca30SChristoph Hellwig * of the caller to ensure that q->bio_split is only released after processing 336309dca30SChristoph Hellwig * of the split bio has finished. 337dad77584SBart Van Assche */ 338f695ca38SChristoph Hellwig void __blk_queue_split(struct bio **bio, unsigned int *nr_segs) 33954efd50bSKent Overstreet { 340309dca30SChristoph Hellwig struct request_queue *q = (*bio)->bi_bdev->bd_disk->queue; 341fa532287SChristoph Hellwig struct bio *split = NULL; 34254efd50bSKent Overstreet 3437afafc8aSAdrian Hunter switch (bio_op(*bio)) { 3447afafc8aSAdrian Hunter case REQ_OP_DISCARD: 3457afafc8aSAdrian Hunter case REQ_OP_SECURE_ERASE: 34614ccb66bSChristoph Hellwig split = blk_bio_discard_split(q, *bio, &q->bio_split, nr_segs); 3477afafc8aSAdrian Hunter break; 348a6f0788eSChaitanya Kulkarni case REQ_OP_WRITE_ZEROES: 34914ccb66bSChristoph Hellwig split = blk_bio_write_zeroes_split(q, *bio, &q->bio_split, 35014ccb66bSChristoph Hellwig nr_segs); 351a6f0788eSChaitanya Kulkarni break; 3527afafc8aSAdrian Hunter case REQ_OP_WRITE_SAME: 35314ccb66bSChristoph Hellwig split = blk_bio_write_same_split(q, *bio, &q->bio_split, 35414ccb66bSChristoph Hellwig nr_segs); 3557afafc8aSAdrian Hunter break; 3567afafc8aSAdrian Hunter default: 357fa532287SChristoph Hellwig /* 358fa532287SChristoph Hellwig * All drivers must accept single-segments bios that are <= 359fa532287SChristoph Hellwig * PAGE_SIZE. This is a quick and dirty check that relies on 360fa532287SChristoph Hellwig * the fact that bi_io_vec[0] is always valid if a bio has data. 361fa532287SChristoph Hellwig * The check might lead to occasional false negatives when bios 362fa532287SChristoph Hellwig * are cloned, but compared to the performance impact of cloned 363fa532287SChristoph Hellwig * bios themselves the loop below doesn't matter anyway. 364fa532287SChristoph Hellwig */ 365fa532287SChristoph Hellwig if (!q->limits.chunk_sectors && 366fa532287SChristoph Hellwig (*bio)->bi_vcnt == 1 && 36759db8ba2SMing Lei ((*bio)->bi_io_vec[0].bv_len + 3681e279153SJens Axboe (*bio)->bi_io_vec[0].bv_offset) <= PAGE_SIZE) { 369fa532287SChristoph Hellwig *nr_segs = 1; 370fa532287SChristoph Hellwig break; 371fa532287SChristoph Hellwig } 37214ccb66bSChristoph Hellwig split = blk_bio_segment_split(q, *bio, &q->bio_split, nr_segs); 3737afafc8aSAdrian Hunter break; 3747afafc8aSAdrian Hunter } 375bdced438SMing Lei 37654efd50bSKent Overstreet if (split) { 3776ac45aebSMing Lei /* there isn't chance to merge the splitted bio */ 3781eff9d32SJens Axboe split->bi_opf |= REQ_NOMERGE; 3796ac45aebSMing Lei 38054efd50bSKent Overstreet bio_chain(split, *bio); 381eb6f7f7cSChristoph Hellwig trace_block_split(split, (*bio)->bi_iter.bi_sector); 382ed00aabdSChristoph Hellwig submit_bio_noacct(*bio); 38354efd50bSKent Overstreet *bio = split; 3844f1e9630SChunguang Xu 3854f1e9630SChunguang Xu blk_throtl_charge_bio_split(*bio); 38654efd50bSKent Overstreet } 38754efd50bSKent Overstreet } 38814ccb66bSChristoph Hellwig 389dad77584SBart Van Assche /** 390dad77584SBart Van Assche * blk_queue_split - split a bio and submit the second half 391dad77584SBart Van Assche * @bio: [in, out] bio to be split 392dad77584SBart Van Assche * 393dad77584SBart Van Assche * Split a bio into two bios, chains the two bios, submit the second half and 394dad77584SBart Van Assche * store a pointer to the first half in *@bio. Since this function may allocate 395309dca30SChristoph Hellwig * a new bio from q->bio_split, it is the responsibility of the caller to ensure 396309dca30SChristoph Hellwig * that q->bio_split is only released after processing of the split bio has 397309dca30SChristoph Hellwig * finished. 398dad77584SBart Van Assche */ 399f695ca38SChristoph Hellwig void blk_queue_split(struct bio **bio) 40014ccb66bSChristoph Hellwig { 40114ccb66bSChristoph Hellwig unsigned int nr_segs; 40214ccb66bSChristoph Hellwig 403f695ca38SChristoph Hellwig __blk_queue_split(bio, &nr_segs); 40414ccb66bSChristoph Hellwig } 40554efd50bSKent Overstreet EXPORT_SYMBOL(blk_queue_split); 40654efd50bSKent Overstreet 407e9cd19c0SChristoph Hellwig unsigned int blk_recalc_rq_segments(struct request *rq) 408d6d48196SJens Axboe { 4096869875fSChristoph Hellwig unsigned int nr_phys_segs = 0; 410ff9811b3SBart Van Assche unsigned int nr_sectors = 0; 411e9cd19c0SChristoph Hellwig struct req_iterator iter; 4126869875fSChristoph Hellwig struct bio_vec bv; 413d6d48196SJens Axboe 414e9cd19c0SChristoph Hellwig if (!rq->bio) 4151e428079SJens Axboe return 0; 416d6d48196SJens Axboe 417e9cd19c0SChristoph Hellwig switch (bio_op(rq->bio)) { 418a6f0788eSChaitanya Kulkarni case REQ_OP_DISCARD: 419a6f0788eSChaitanya Kulkarni case REQ_OP_SECURE_ERASE: 420a958937fSDavid Jeffery if (queue_max_discard_segments(rq->q) > 1) { 421a958937fSDavid Jeffery struct bio *bio = rq->bio; 422a958937fSDavid Jeffery 423a958937fSDavid Jeffery for_each_bio(bio) 424a958937fSDavid Jeffery nr_phys_segs++; 425a958937fSDavid Jeffery return nr_phys_segs; 426a958937fSDavid Jeffery } 427a958937fSDavid Jeffery return 1; 428a6f0788eSChaitanya Kulkarni case REQ_OP_WRITE_ZEROES: 429f9d03f96SChristoph Hellwig return 0; 430f9d03f96SChristoph Hellwig case REQ_OP_WRITE_SAME: 4315cb8850cSKent Overstreet return 1; 432a6f0788eSChaitanya Kulkarni } 4335cb8850cSKent Overstreet 434e9cd19c0SChristoph Hellwig rq_for_each_bvec(bv, rq, iter) 435ff9811b3SBart Van Assche bvec_split_segs(rq->q, &bv, &nr_phys_segs, &nr_sectors, 436708b25b3SBart Van Assche UINT_MAX, UINT_MAX); 4371e428079SJens Axboe return nr_phys_segs; 4381e428079SJens Axboe } 4391e428079SJens Axboe 44048d7727cSMing Lei static inline struct scatterlist *blk_next_sg(struct scatterlist **sg, 441862e5a5eSMing Lei struct scatterlist *sglist) 442862e5a5eSMing Lei { 443862e5a5eSMing Lei if (!*sg) 444862e5a5eSMing Lei return sglist; 445862e5a5eSMing Lei 446862e5a5eSMing Lei /* 447862e5a5eSMing Lei * If the driver previously mapped a shorter list, we could see a 448862e5a5eSMing Lei * termination bit prematurely unless it fully inits the sg table 449862e5a5eSMing Lei * on each mapping. We KNOW that there must be more entries here 450862e5a5eSMing Lei * or the driver would be buggy, so force clear the termination bit 451862e5a5eSMing Lei * to avoid doing a full sg_init_table() in drivers for each command. 452862e5a5eSMing Lei */ 453862e5a5eSMing Lei sg_unmark_end(*sg); 454862e5a5eSMing Lei return sg_next(*sg); 455862e5a5eSMing Lei } 456862e5a5eSMing Lei 457862e5a5eSMing Lei static unsigned blk_bvec_map_sg(struct request_queue *q, 458862e5a5eSMing Lei struct bio_vec *bvec, struct scatterlist *sglist, 459862e5a5eSMing Lei struct scatterlist **sg) 460862e5a5eSMing Lei { 461862e5a5eSMing Lei unsigned nbytes = bvec->bv_len; 4628a96a0e4SChristoph Hellwig unsigned nsegs = 0, total = 0; 463862e5a5eSMing Lei 464862e5a5eSMing Lei while (nbytes > 0) { 4658a96a0e4SChristoph Hellwig unsigned offset = bvec->bv_offset + total; 466429120f3SMing Lei unsigned len = min(get_max_segment_size(q, bvec->bv_page, 467429120f3SMing Lei offset), nbytes); 468f9f76879SChristoph Hellwig struct page *page = bvec->bv_page; 469f9f76879SChristoph Hellwig 470f9f76879SChristoph Hellwig /* 471f9f76879SChristoph Hellwig * Unfortunately a fair number of drivers barf on scatterlists 472f9f76879SChristoph Hellwig * that have an offset larger than PAGE_SIZE, despite other 473f9f76879SChristoph Hellwig * subsystems dealing with that invariant just fine. For now 474f9f76879SChristoph Hellwig * stick to the legacy format where we never present those from 475f9f76879SChristoph Hellwig * the block layer, but the code below should be removed once 476f9f76879SChristoph Hellwig * these offenders (mostly MMC/SD drivers) are fixed. 477f9f76879SChristoph Hellwig */ 478f9f76879SChristoph Hellwig page += (offset >> PAGE_SHIFT); 479f9f76879SChristoph Hellwig offset &= ~PAGE_MASK; 480862e5a5eSMing Lei 481862e5a5eSMing Lei *sg = blk_next_sg(sg, sglist); 482f9f76879SChristoph Hellwig sg_set_page(*sg, page, len, offset); 483862e5a5eSMing Lei 4848a96a0e4SChristoph Hellwig total += len; 4858a96a0e4SChristoph Hellwig nbytes -= len; 486862e5a5eSMing Lei nsegs++; 487862e5a5eSMing Lei } 488862e5a5eSMing Lei 489862e5a5eSMing Lei return nsegs; 490862e5a5eSMing Lei } 491862e5a5eSMing Lei 49216e3e418SMing Lei static inline int __blk_bvec_map_sg(struct bio_vec bv, 49316e3e418SMing Lei struct scatterlist *sglist, struct scatterlist **sg) 49416e3e418SMing Lei { 49516e3e418SMing Lei *sg = blk_next_sg(sg, sglist); 49616e3e418SMing Lei sg_set_page(*sg, bv.bv_page, bv.bv_len, bv.bv_offset); 49716e3e418SMing Lei return 1; 49816e3e418SMing Lei } 49916e3e418SMing Lei 500f6970f83SMing Lei /* only try to merge bvecs into one sg if they are from two bios */ 501f6970f83SMing Lei static inline bool 502f6970f83SMing Lei __blk_segment_map_sg_merge(struct request_queue *q, struct bio_vec *bvec, 503f6970f83SMing Lei struct bio_vec *bvprv, struct scatterlist **sg) 504963ab9e5SAsias He { 505963ab9e5SAsias He 506963ab9e5SAsias He int nbytes = bvec->bv_len; 507963ab9e5SAsias He 508f6970f83SMing Lei if (!*sg) 509f6970f83SMing Lei return false; 510f6970f83SMing Lei 511b4b6cb61SMing Lei if ((*sg)->length + nbytes > queue_max_segment_size(q)) 512f6970f83SMing Lei return false; 513f6970f83SMing Lei 5143dccdae5SChristoph Hellwig if (!biovec_phys_mergeable(q, bvprv, bvec)) 515f6970f83SMing Lei return false; 516963ab9e5SAsias He 517963ab9e5SAsias He (*sg)->length += nbytes; 518f6970f83SMing Lei 519f6970f83SMing Lei return true; 520963ab9e5SAsias He } 521963ab9e5SAsias He 5225cb8850cSKent Overstreet static int __blk_bios_map_sg(struct request_queue *q, struct bio *bio, 5235cb8850cSKent Overstreet struct scatterlist *sglist, 5245cb8850cSKent Overstreet struct scatterlist **sg) 5255cb8850cSKent Overstreet { 5263f649ab7SKees Cook struct bio_vec bvec, bvprv = { NULL }; 5275cb8850cSKent Overstreet struct bvec_iter iter; 52838417468SChristoph Hellwig int nsegs = 0; 529f6970f83SMing Lei bool new_bio = false; 5305cb8850cSKent Overstreet 531f6970f83SMing Lei for_each_bio(bio) { 532f6970f83SMing Lei bio_for_each_bvec(bvec, bio, iter) { 533f6970f83SMing Lei /* 534f6970f83SMing Lei * Only try to merge bvecs from two bios given we 535f6970f83SMing Lei * have done bio internal merge when adding pages 536f6970f83SMing Lei * to bio 537f6970f83SMing Lei */ 538f6970f83SMing Lei if (new_bio && 539f6970f83SMing Lei __blk_segment_map_sg_merge(q, &bvec, &bvprv, sg)) 540f6970f83SMing Lei goto next_bvec; 541f6970f83SMing Lei 542f6970f83SMing Lei if (bvec.bv_offset + bvec.bv_len <= PAGE_SIZE) 543f6970f83SMing Lei nsegs += __blk_bvec_map_sg(bvec, sglist, sg); 544f6970f83SMing Lei else 545f6970f83SMing Lei nsegs += blk_bvec_map_sg(q, &bvec, sglist, sg); 546f6970f83SMing Lei next_bvec: 547f6970f83SMing Lei new_bio = false; 548f6970f83SMing Lei } 549b21e11c5SMing Lei if (likely(bio->bi_iter.bi_size)) { 550f6970f83SMing Lei bvprv = bvec; 551f6970f83SMing Lei new_bio = true; 552f6970f83SMing Lei } 553b21e11c5SMing Lei } 5545cb8850cSKent Overstreet 5555cb8850cSKent Overstreet return nsegs; 5565cb8850cSKent Overstreet } 5575cb8850cSKent Overstreet 558d6d48196SJens Axboe /* 559d6d48196SJens Axboe * map a request to scatterlist, return number of sg entries setup. Caller 560d6d48196SJens Axboe * must make sure sg can hold rq->nr_phys_segments entries 561d6d48196SJens Axboe */ 56289de1504SChristoph Hellwig int __blk_rq_map_sg(struct request_queue *q, struct request *rq, 56389de1504SChristoph Hellwig struct scatterlist *sglist, struct scatterlist **last_sg) 564d6d48196SJens Axboe { 5655cb8850cSKent Overstreet int nsegs = 0; 566d6d48196SJens Axboe 567f9d03f96SChristoph Hellwig if (rq->rq_flags & RQF_SPECIAL_PAYLOAD) 56889de1504SChristoph Hellwig nsegs = __blk_bvec_map_sg(rq->special_vec, sglist, last_sg); 569f9d03f96SChristoph Hellwig else if (rq->bio && bio_op(rq->bio) == REQ_OP_WRITE_SAME) 57089de1504SChristoph Hellwig nsegs = __blk_bvec_map_sg(bio_iovec(rq->bio), sglist, last_sg); 571f9d03f96SChristoph Hellwig else if (rq->bio) 57289de1504SChristoph Hellwig nsegs = __blk_bios_map_sg(q, rq->bio, sglist, last_sg); 573f18573abSFUJITA Tomonori 57489de1504SChristoph Hellwig if (*last_sg) 57589de1504SChristoph Hellwig sg_mark_end(*last_sg); 576d6d48196SJens Axboe 57712e57f59SMing Lei /* 57812e57f59SMing Lei * Something must have been wrong if the figured number of 57912e57f59SMing Lei * segment is bigger than number of req's physical segments 58012e57f59SMing Lei */ 581f9d03f96SChristoph Hellwig WARN_ON(nsegs > blk_rq_nr_phys_segments(rq)); 58212e57f59SMing Lei 583d6d48196SJens Axboe return nsegs; 584d6d48196SJens Axboe } 58589de1504SChristoph Hellwig EXPORT_SYMBOL(__blk_rq_map_sg); 586d6d48196SJens Axboe 587943b40c8SMing Lei static inline unsigned int blk_rq_get_max_segments(struct request *rq) 588943b40c8SMing Lei { 589943b40c8SMing Lei if (req_op(rq) == REQ_OP_DISCARD) 590943b40c8SMing Lei return queue_max_discard_segments(rq->q); 591943b40c8SMing Lei return queue_max_segments(rq->q); 592943b40c8SMing Lei } 593943b40c8SMing Lei 594badf7f64SChristoph Hellwig static inline unsigned int blk_rq_get_max_sectors(struct request *rq, 595badf7f64SChristoph Hellwig sector_t offset) 596badf7f64SChristoph Hellwig { 597badf7f64SChristoph Hellwig struct request_queue *q = rq->q; 598badf7f64SChristoph Hellwig 599badf7f64SChristoph Hellwig if (blk_rq_is_passthrough(rq)) 600badf7f64SChristoph Hellwig return q->limits.max_hw_sectors; 601badf7f64SChristoph Hellwig 602badf7f64SChristoph Hellwig if (!q->limits.chunk_sectors || 603badf7f64SChristoph Hellwig req_op(rq) == REQ_OP_DISCARD || 604badf7f64SChristoph Hellwig req_op(rq) == REQ_OP_SECURE_ERASE) 605badf7f64SChristoph Hellwig return blk_queue_get_max_sectors(q, req_op(rq)); 606badf7f64SChristoph Hellwig 607badf7f64SChristoph Hellwig return min(blk_max_size_offset(q, offset, 0), 608badf7f64SChristoph Hellwig blk_queue_get_max_sectors(q, req_op(rq))); 609badf7f64SChristoph Hellwig } 610badf7f64SChristoph Hellwig 61114ccb66bSChristoph Hellwig static inline int ll_new_hw_segment(struct request *req, struct bio *bio, 61214ccb66bSChristoph Hellwig unsigned int nr_phys_segs) 613d6d48196SJens Axboe { 6142705dfb2SMing Lei if (blk_integrity_merge_bio(req->q, req, bio) == false) 61513f05c8dSMartin K. Petersen goto no_merge; 61613f05c8dSMartin K. Petersen 6172705dfb2SMing Lei /* discard request merge won't add new segment */ 6182705dfb2SMing Lei if (req_op(req) == REQ_OP_DISCARD) 6192705dfb2SMing Lei return 1; 6202705dfb2SMing Lei 6212705dfb2SMing Lei if (req->nr_phys_segments + nr_phys_segs > blk_rq_get_max_segments(req)) 62213f05c8dSMartin K. Petersen goto no_merge; 623d6d48196SJens Axboe 624d6d48196SJens Axboe /* 625d6d48196SJens Axboe * This will form the start of a new hw segment. Bump both 626d6d48196SJens Axboe * counters. 627d6d48196SJens Axboe */ 628d6d48196SJens Axboe req->nr_phys_segments += nr_phys_segs; 629d6d48196SJens Axboe return 1; 63013f05c8dSMartin K. Petersen 63113f05c8dSMartin K. Petersen no_merge: 63214ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 63313f05c8dSMartin K. Petersen return 0; 634d6d48196SJens Axboe } 635d6d48196SJens Axboe 63614ccb66bSChristoph Hellwig int ll_back_merge_fn(struct request *req, struct bio *bio, unsigned int nr_segs) 637d6d48196SJens Axboe { 6385e7c4274SJens Axboe if (req_gap_back_merge(req, bio)) 6395e7c4274SJens Axboe return 0; 6407f39add3SSagi Grimberg if (blk_integrity_rq(req) && 6417f39add3SSagi Grimberg integrity_req_gap_back_merge(req, bio)) 6427f39add3SSagi Grimberg return 0; 643a892c8d5SSatya Tangirala if (!bio_crypt_ctx_back_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, blk_rq_pos(req))) { 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 654eda5cc99SChristoph Hellwig static int ll_front_merge_fn(struct request *req, struct bio *bio, 655eda5cc99SChristoph Hellwig unsigned int nr_segs) 656d6d48196SJens Axboe { 6575e7c4274SJens Axboe if (req_gap_front_merge(req, bio)) 6585e7c4274SJens Axboe return 0; 6597f39add3SSagi Grimberg if (blk_integrity_rq(req) && 6607f39add3SSagi Grimberg integrity_req_gap_front_merge(req, bio)) 6617f39add3SSagi Grimberg return 0; 662a892c8d5SSatya Tangirala if (!bio_crypt_ctx_front_mergeable(req, bio)) 663a892c8d5SSatya Tangirala return 0; 664f31dc1cdSMartin K. Petersen if (blk_rq_sectors(req) + bio_sectors(bio) > 66517007f39SDamien Le Moal blk_rq_get_max_sectors(req, bio->bi_iter.bi_sector)) { 66614ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 667d6d48196SJens Axboe return 0; 668d6d48196SJens Axboe } 669d6d48196SJens Axboe 67014ccb66bSChristoph Hellwig return ll_new_hw_segment(req, bio, nr_segs); 671d6d48196SJens Axboe } 672d6d48196SJens Axboe 673445251d0SJens Axboe static bool req_attempt_discard_merge(struct request_queue *q, struct request *req, 674445251d0SJens Axboe struct request *next) 675445251d0SJens Axboe { 676445251d0SJens Axboe unsigned short segments = blk_rq_nr_discard_segments(req); 677445251d0SJens Axboe 678445251d0SJens Axboe if (segments >= queue_max_discard_segments(q)) 679445251d0SJens Axboe goto no_merge; 680445251d0SJens Axboe if (blk_rq_sectors(req) + bio_sectors(next->bio) > 681445251d0SJens Axboe blk_rq_get_max_sectors(req, blk_rq_pos(req))) 682445251d0SJens Axboe goto no_merge; 683445251d0SJens Axboe 684445251d0SJens Axboe req->nr_phys_segments = segments + blk_rq_nr_discard_segments(next); 685445251d0SJens Axboe return true; 686445251d0SJens Axboe no_merge: 687445251d0SJens Axboe req_set_nomerge(q, req); 688445251d0SJens Axboe return false; 689445251d0SJens Axboe } 690445251d0SJens Axboe 691d6d48196SJens Axboe static int ll_merge_requests_fn(struct request_queue *q, struct request *req, 692d6d48196SJens Axboe struct request *next) 693d6d48196SJens Axboe { 694d6d48196SJens Axboe int total_phys_segments; 695d6d48196SJens Axboe 6965e7c4274SJens Axboe if (req_gap_back_merge(req, next->bio)) 697854fbb9cSKeith Busch return 0; 698854fbb9cSKeith Busch 699d6d48196SJens Axboe /* 700d6d48196SJens Axboe * Will it become too large? 701d6d48196SJens Axboe */ 702f31dc1cdSMartin K. Petersen if ((blk_rq_sectors(req) + blk_rq_sectors(next)) > 70317007f39SDamien Le Moal blk_rq_get_max_sectors(req, blk_rq_pos(req))) 704d6d48196SJens Axboe return 0; 705d6d48196SJens Axboe 706d6d48196SJens Axboe total_phys_segments = req->nr_phys_segments + next->nr_phys_segments; 707943b40c8SMing Lei if (total_phys_segments > blk_rq_get_max_segments(req)) 708d6d48196SJens Axboe return 0; 709d6d48196SJens Axboe 7104eaf99beSMartin K. Petersen if (blk_integrity_merge_rq(q, req, next) == false) 71113f05c8dSMartin K. Petersen return 0; 71213f05c8dSMartin K. Petersen 713a892c8d5SSatya Tangirala if (!bio_crypt_ctx_merge_rq(req, next)) 714a892c8d5SSatya Tangirala return 0; 715a892c8d5SSatya Tangirala 716d6d48196SJens Axboe /* Merge is OK... */ 717d6d48196SJens Axboe req->nr_phys_segments = total_phys_segments; 718d6d48196SJens Axboe return 1; 719d6d48196SJens Axboe } 720d6d48196SJens Axboe 72180a761fdSTejun Heo /** 72280a761fdSTejun Heo * blk_rq_set_mixed_merge - mark a request as mixed merge 72380a761fdSTejun Heo * @rq: request to mark as mixed merge 72480a761fdSTejun Heo * 72580a761fdSTejun Heo * Description: 72680a761fdSTejun Heo * @rq is about to be mixed merged. Make sure the attributes 72780a761fdSTejun Heo * which can be mixed are set in each bio and mark @rq as mixed 72880a761fdSTejun Heo * merged. 72980a761fdSTejun Heo */ 73080a761fdSTejun Heo void blk_rq_set_mixed_merge(struct request *rq) 73180a761fdSTejun Heo { 73280a761fdSTejun Heo unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK; 73380a761fdSTejun Heo struct bio *bio; 73480a761fdSTejun Heo 735e8064021SChristoph Hellwig if (rq->rq_flags & RQF_MIXED_MERGE) 73680a761fdSTejun Heo return; 73780a761fdSTejun Heo 73880a761fdSTejun Heo /* 73980a761fdSTejun Heo * @rq will no longer represent mixable attributes for all the 74080a761fdSTejun Heo * contained bios. It will just track those of the first one. 74180a761fdSTejun Heo * Distributes the attributs to each bio. 74280a761fdSTejun Heo */ 74380a761fdSTejun Heo for (bio = rq->bio; bio; bio = bio->bi_next) { 7441eff9d32SJens Axboe WARN_ON_ONCE((bio->bi_opf & REQ_FAILFAST_MASK) && 7451eff9d32SJens Axboe (bio->bi_opf & REQ_FAILFAST_MASK) != ff); 7461eff9d32SJens Axboe bio->bi_opf |= ff; 74780a761fdSTejun Heo } 748e8064021SChristoph Hellwig rq->rq_flags |= RQF_MIXED_MERGE; 74980a761fdSTejun Heo } 75080a761fdSTejun Heo 751b9c54f56SKonstantin Khlebnikov static void blk_account_io_merge_request(struct request *req) 75226308eabSJerome Marchand { 75326308eabSJerome Marchand if (blk_do_io_stat(req)) { 754112f158fSMike Snitzer part_stat_lock(); 755b9c54f56SKonstantin Khlebnikov part_stat_inc(req->part, merges[op_stat_group(req_op(req))]); 75626308eabSJerome Marchand part_stat_unlock(); 75726308eabSJerome Marchand } 75826308eabSJerome Marchand } 759b9c54f56SKonstantin Khlebnikov 760e96c0d83SEric Biggers static enum elv_merge blk_try_req_merge(struct request *req, 761e96c0d83SEric Biggers struct request *next) 76269840466SJianchao Wang { 76369840466SJianchao Wang if (blk_discard_mergable(req)) 76469840466SJianchao Wang return ELEVATOR_DISCARD_MERGE; 76569840466SJianchao Wang else if (blk_rq_pos(req) + blk_rq_sectors(req) == blk_rq_pos(next)) 76669840466SJianchao Wang return ELEVATOR_BACK_MERGE; 76769840466SJianchao Wang 76869840466SJianchao Wang return ELEVATOR_NO_MERGE; 76969840466SJianchao Wang } 77026308eabSJerome Marchand 771badf7f64SChristoph Hellwig static inline bool blk_write_same_mergeable(struct bio *a, struct bio *b) 772badf7f64SChristoph Hellwig { 773badf7f64SChristoph Hellwig if (bio_page(a) == bio_page(b) && bio_offset(a) == bio_offset(b)) 774badf7f64SChristoph Hellwig return true; 775badf7f64SChristoph Hellwig return false; 776badf7f64SChristoph Hellwig } 777badf7f64SChristoph Hellwig 778d6d48196SJens Axboe /* 779b973cb7eSJens Axboe * For non-mq, this has to be called with the request spinlock acquired. 780b973cb7eSJens Axboe * For mq with scheduling, the appropriate queue wide lock should be held. 781d6d48196SJens Axboe */ 782b973cb7eSJens Axboe static struct request *attempt_merge(struct request_queue *q, 783b973cb7eSJens Axboe struct request *req, struct request *next) 784d6d48196SJens Axboe { 785d6d48196SJens Axboe if (!rq_mergeable(req) || !rq_mergeable(next)) 786b973cb7eSJens Axboe return NULL; 787d6d48196SJens Axboe 788288dab8aSChristoph Hellwig if (req_op(req) != req_op(next)) 789b973cb7eSJens Axboe return NULL; 790f31dc1cdSMartin K. Petersen 791d6d48196SJens Axboe if (rq_data_dir(req) != rq_data_dir(next) 7922081a56bSJens Axboe || req->rq_disk != next->rq_disk) 793b973cb7eSJens Axboe return NULL; 794d6d48196SJens Axboe 7958fe0d473SMike Christie if (req_op(req) == REQ_OP_WRITE_SAME && 7964363ac7cSMartin K. Petersen !blk_write_same_mergeable(req->bio, next->bio)) 797b973cb7eSJens Axboe return NULL; 7984363ac7cSMartin K. Petersen 799d6d48196SJens Axboe /* 800cb6934f8SJens Axboe * Don't allow merge of different write hints, or for a hint with 801cb6934f8SJens Axboe * non-hint IO. 802cb6934f8SJens Axboe */ 803cb6934f8SJens Axboe if (req->write_hint != next->write_hint) 804cb6934f8SJens Axboe return NULL; 805cb6934f8SJens Axboe 806668ffc03SDamien Le Moal if (req->ioprio != next->ioprio) 807668ffc03SDamien Le Moal return NULL; 808668ffc03SDamien Le Moal 809cb6934f8SJens Axboe /* 810d6d48196SJens Axboe * If we are allowed to merge, then append bio list 811d6d48196SJens Axboe * from next to rq and release next. merge_requests_fn 812d6d48196SJens Axboe * will have updated segment counts, update sector 813445251d0SJens Axboe * counts here. Handle DISCARDs separately, as they 814445251d0SJens Axboe * have separate settings. 815d6d48196SJens Axboe */ 81669840466SJianchao Wang 81769840466SJianchao Wang switch (blk_try_req_merge(req, next)) { 81869840466SJianchao Wang case ELEVATOR_DISCARD_MERGE: 819445251d0SJens Axboe if (!req_attempt_discard_merge(q, req, next)) 820445251d0SJens Axboe return NULL; 82169840466SJianchao Wang break; 82269840466SJianchao Wang case ELEVATOR_BACK_MERGE: 82369840466SJianchao Wang if (!ll_merge_requests_fn(q, req, next)) 824b973cb7eSJens Axboe return NULL; 82569840466SJianchao Wang break; 82669840466SJianchao Wang default: 82769840466SJianchao Wang return NULL; 82869840466SJianchao Wang } 829d6d48196SJens Axboe 830d6d48196SJens Axboe /* 83180a761fdSTejun Heo * If failfast settings disagree or any of the two is already 83280a761fdSTejun Heo * a mixed merge, mark both as mixed before proceeding. This 83380a761fdSTejun Heo * makes sure that all involved bios have mixable attributes 83480a761fdSTejun Heo * set properly. 83580a761fdSTejun Heo */ 836e8064021SChristoph Hellwig if (((req->rq_flags | next->rq_flags) & RQF_MIXED_MERGE) || 83780a761fdSTejun Heo (req->cmd_flags & REQ_FAILFAST_MASK) != 83880a761fdSTejun Heo (next->cmd_flags & REQ_FAILFAST_MASK)) { 83980a761fdSTejun Heo blk_rq_set_mixed_merge(req); 84080a761fdSTejun Heo blk_rq_set_mixed_merge(next); 84180a761fdSTejun Heo } 84280a761fdSTejun Heo 84380a761fdSTejun Heo /* 844522a7775SOmar Sandoval * At this point we have either done a back merge or front merge. We 845522a7775SOmar Sandoval * need the smaller start_time_ns of the merged requests to be the 846522a7775SOmar Sandoval * current request for accounting purposes. 847d6d48196SJens Axboe */ 848522a7775SOmar Sandoval if (next->start_time_ns < req->start_time_ns) 849522a7775SOmar Sandoval req->start_time_ns = next->start_time_ns; 850d6d48196SJens Axboe 851d6d48196SJens Axboe req->biotail->bi_next = next->bio; 852d6d48196SJens Axboe req->biotail = next->biotail; 853d6d48196SJens Axboe 854a2dec7b3STejun Heo req->__data_len += blk_rq_bytes(next); 855d6d48196SJens Axboe 8562a5cf35cSMing Lei if (!blk_discard_mergable(req)) 857d6d48196SJens Axboe elv_merge_requests(q, req, next); 858d6d48196SJens Axboe 85942dad764SJerome Marchand /* 86042dad764SJerome Marchand * 'next' is going away, so update stats accordingly 86142dad764SJerome Marchand */ 862b9c54f56SKonstantin Khlebnikov blk_account_io_merge_request(next); 863d6d48196SJens Axboe 864a54895faSChristoph Hellwig trace_block_rq_merge(next); 865f3bdc62fSJan Kara 866e4d750c9SJens Axboe /* 867e4d750c9SJens Axboe * ownership of bio passed from next to req, return 'next' for 868e4d750c9SJens Axboe * the caller to free 869e4d750c9SJens Axboe */ 8701cd96c24SBoaz Harrosh next->bio = NULL; 871b973cb7eSJens Axboe return next; 872d6d48196SJens Axboe } 873d6d48196SJens Axboe 874eda5cc99SChristoph Hellwig static struct request *attempt_back_merge(struct request_queue *q, 875eda5cc99SChristoph Hellwig struct request *rq) 876d6d48196SJens Axboe { 877d6d48196SJens Axboe struct request *next = elv_latter_request(q, rq); 878d6d48196SJens Axboe 879d6d48196SJens Axboe if (next) 880d6d48196SJens Axboe return attempt_merge(q, rq, next); 881d6d48196SJens Axboe 882b973cb7eSJens Axboe return NULL; 883d6d48196SJens Axboe } 884d6d48196SJens Axboe 885eda5cc99SChristoph Hellwig static struct request *attempt_front_merge(struct request_queue *q, 886eda5cc99SChristoph Hellwig struct request *rq) 887d6d48196SJens Axboe { 888d6d48196SJens Axboe struct request *prev = elv_former_request(q, rq); 889d6d48196SJens Axboe 890d6d48196SJens Axboe if (prev) 891d6d48196SJens Axboe return attempt_merge(q, prev, rq); 892d6d48196SJens Axboe 893b973cb7eSJens Axboe return NULL; 894d6d48196SJens Axboe } 8955e84ea3aSJens Axboe 896fd2ef39cSJan Kara /* 897fd2ef39cSJan Kara * Try to merge 'next' into 'rq'. Return true if the merge happened, false 898fd2ef39cSJan Kara * otherwise. The caller is responsible for freeing 'next' if the merge 899fd2ef39cSJan Kara * happened. 900fd2ef39cSJan Kara */ 901fd2ef39cSJan Kara bool blk_attempt_req_merge(struct request_queue *q, struct request *rq, 9025e84ea3aSJens Axboe struct request *next) 9035e84ea3aSJens Axboe { 904fd2ef39cSJan Kara return attempt_merge(q, rq, next); 9055e84ea3aSJens Axboe } 906050c8ea8STejun Heo 907050c8ea8STejun Heo bool blk_rq_merge_ok(struct request *rq, struct bio *bio) 908050c8ea8STejun Heo { 909e2a60da7SMartin K. Petersen if (!rq_mergeable(rq) || !bio_mergeable(bio)) 910050c8ea8STejun Heo return false; 911050c8ea8STejun Heo 912288dab8aSChristoph Hellwig if (req_op(rq) != bio_op(bio)) 913f31dc1cdSMartin K. Petersen return false; 914f31dc1cdSMartin K. Petersen 915050c8ea8STejun Heo /* different data direction or already started, don't merge */ 916050c8ea8STejun Heo if (bio_data_dir(bio) != rq_data_dir(rq)) 917050c8ea8STejun Heo return false; 918050c8ea8STejun Heo 9192081a56bSJens Axboe /* must be same device */ 920309dca30SChristoph Hellwig if (rq->rq_disk != bio->bi_bdev->bd_disk) 921050c8ea8STejun Heo return false; 922050c8ea8STejun Heo 923050c8ea8STejun Heo /* only merge integrity protected bio into ditto rq */ 9244eaf99beSMartin K. Petersen if (blk_integrity_merge_bio(rq->q, rq, bio) == false) 925050c8ea8STejun Heo return false; 926050c8ea8STejun Heo 927a892c8d5SSatya Tangirala /* Only merge if the crypt contexts are compatible */ 928a892c8d5SSatya Tangirala if (!bio_crypt_rq_ctx_compatible(rq, bio)) 929a892c8d5SSatya Tangirala return false; 930a892c8d5SSatya Tangirala 9314363ac7cSMartin K. Petersen /* must be using the same buffer */ 9328fe0d473SMike Christie if (req_op(rq) == REQ_OP_WRITE_SAME && 9334363ac7cSMartin K. Petersen !blk_write_same_mergeable(rq->bio, bio)) 9344363ac7cSMartin K. Petersen return false; 9354363ac7cSMartin K. Petersen 936cb6934f8SJens Axboe /* 937cb6934f8SJens Axboe * Don't allow merge of different write hints, or for a hint with 938cb6934f8SJens Axboe * non-hint IO. 939cb6934f8SJens Axboe */ 940cb6934f8SJens Axboe if (rq->write_hint != bio->bi_write_hint) 941cb6934f8SJens Axboe return false; 942cb6934f8SJens Axboe 943668ffc03SDamien Le Moal if (rq->ioprio != bio_prio(bio)) 944668ffc03SDamien Le Moal return false; 945668ffc03SDamien Le Moal 946050c8ea8STejun Heo return true; 947050c8ea8STejun Heo } 948050c8ea8STejun Heo 94934fe7c05SChristoph Hellwig enum elv_merge blk_try_merge(struct request *rq, struct bio *bio) 950050c8ea8STejun Heo { 95169840466SJianchao Wang if (blk_discard_mergable(rq)) 9521e739730SChristoph Hellwig return ELEVATOR_DISCARD_MERGE; 9531e739730SChristoph Hellwig else if (blk_rq_pos(rq) + blk_rq_sectors(rq) == bio->bi_iter.bi_sector) 954050c8ea8STejun Heo return ELEVATOR_BACK_MERGE; 9554f024f37SKent Overstreet else if (blk_rq_pos(rq) - bio_sectors(bio) == bio->bi_iter.bi_sector) 956050c8ea8STejun Heo return ELEVATOR_FRONT_MERGE; 957050c8ea8STejun Heo return ELEVATOR_NO_MERGE; 958050c8ea8STejun Heo } 9598e756373SBaolin Wang 9608e756373SBaolin Wang static void blk_account_io_merge_bio(struct request *req) 9618e756373SBaolin Wang { 9628e756373SBaolin Wang if (!blk_do_io_stat(req)) 9638e756373SBaolin Wang return; 9648e756373SBaolin Wang 9658e756373SBaolin Wang part_stat_lock(); 9668e756373SBaolin Wang part_stat_inc(req->part, merges[op_stat_group(req_op(req))]); 9678e756373SBaolin Wang part_stat_unlock(); 9688e756373SBaolin Wang } 9698e756373SBaolin Wang 970eda5cc99SChristoph Hellwig enum bio_merge_status { 971eda5cc99SChristoph Hellwig BIO_MERGE_OK, 972eda5cc99SChristoph Hellwig BIO_MERGE_NONE, 973eda5cc99SChristoph Hellwig BIO_MERGE_FAILED, 974eda5cc99SChristoph Hellwig }; 975eda5cc99SChristoph Hellwig 976eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_back_merge(struct request *req, 977eda5cc99SChristoph Hellwig struct bio *bio, unsigned int nr_segs) 9788e756373SBaolin Wang { 9798e756373SBaolin Wang const int ff = bio->bi_opf & REQ_FAILFAST_MASK; 9808e756373SBaolin Wang 9818e756373SBaolin Wang if (!ll_back_merge_fn(req, bio, nr_segs)) 9827d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 9838e756373SBaolin Wang 984e8a676d6SChristoph Hellwig trace_block_bio_backmerge(bio); 9858e756373SBaolin Wang rq_qos_merge(req->q, req, bio); 9868e756373SBaolin Wang 9878e756373SBaolin Wang if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) 9888e756373SBaolin Wang blk_rq_set_mixed_merge(req); 9898e756373SBaolin Wang 9908e756373SBaolin Wang req->biotail->bi_next = bio; 9918e756373SBaolin Wang req->biotail = bio; 9928e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 9938e756373SBaolin Wang 9948e756373SBaolin Wang bio_crypt_free_ctx(bio); 9958e756373SBaolin Wang 9968e756373SBaolin Wang blk_account_io_merge_bio(req); 9977d7ca7c5SBaolin Wang return BIO_MERGE_OK; 9988e756373SBaolin Wang } 9998e756373SBaolin Wang 1000eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_front_merge(struct request *req, 1001eda5cc99SChristoph Hellwig struct bio *bio, unsigned int nr_segs) 10028e756373SBaolin Wang { 10038e756373SBaolin Wang const int ff = bio->bi_opf & REQ_FAILFAST_MASK; 10048e756373SBaolin Wang 10058e756373SBaolin Wang if (!ll_front_merge_fn(req, bio, nr_segs)) 10067d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 10078e756373SBaolin Wang 1008e8a676d6SChristoph Hellwig trace_block_bio_frontmerge(bio); 10098e756373SBaolin Wang rq_qos_merge(req->q, req, bio); 10108e756373SBaolin Wang 10118e756373SBaolin Wang if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) 10128e756373SBaolin Wang blk_rq_set_mixed_merge(req); 10138e756373SBaolin Wang 10148e756373SBaolin Wang bio->bi_next = req->bio; 10158e756373SBaolin Wang req->bio = bio; 10168e756373SBaolin Wang 10178e756373SBaolin Wang req->__sector = bio->bi_iter.bi_sector; 10188e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 10198e756373SBaolin Wang 10208e756373SBaolin Wang bio_crypt_do_front_merge(req, bio); 10218e756373SBaolin Wang 10228e756373SBaolin Wang blk_account_io_merge_bio(req); 10237d7ca7c5SBaolin Wang return BIO_MERGE_OK; 10248e756373SBaolin Wang } 10258e756373SBaolin Wang 1026eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_discard_merge(struct request_queue *q, 1027eda5cc99SChristoph Hellwig struct request *req, struct bio *bio) 10288e756373SBaolin Wang { 10298e756373SBaolin Wang unsigned short segments = blk_rq_nr_discard_segments(req); 10308e756373SBaolin Wang 10318e756373SBaolin Wang if (segments >= queue_max_discard_segments(q)) 10328e756373SBaolin Wang goto no_merge; 10338e756373SBaolin Wang if (blk_rq_sectors(req) + bio_sectors(bio) > 10348e756373SBaolin Wang blk_rq_get_max_sectors(req, blk_rq_pos(req))) 10358e756373SBaolin Wang goto no_merge; 10368e756373SBaolin Wang 10378e756373SBaolin Wang rq_qos_merge(q, req, bio); 10388e756373SBaolin Wang 10398e756373SBaolin Wang req->biotail->bi_next = bio; 10408e756373SBaolin Wang req->biotail = bio; 10418e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 10428e756373SBaolin Wang req->nr_phys_segments = segments + 1; 10438e756373SBaolin Wang 10448e756373SBaolin Wang blk_account_io_merge_bio(req); 10457d7ca7c5SBaolin Wang return BIO_MERGE_OK; 10468e756373SBaolin Wang no_merge: 10478e756373SBaolin Wang req_set_nomerge(q, req); 10487d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 10497d7ca7c5SBaolin Wang } 10507d7ca7c5SBaolin Wang 10517d7ca7c5SBaolin Wang static enum bio_merge_status blk_attempt_bio_merge(struct request_queue *q, 10527d7ca7c5SBaolin Wang struct request *rq, 10537d7ca7c5SBaolin Wang struct bio *bio, 10547d7ca7c5SBaolin Wang unsigned int nr_segs, 10557d7ca7c5SBaolin Wang bool sched_allow_merge) 10567d7ca7c5SBaolin Wang { 10577d7ca7c5SBaolin Wang if (!blk_rq_merge_ok(rq, bio)) 10587d7ca7c5SBaolin Wang return BIO_MERGE_NONE; 10597d7ca7c5SBaolin Wang 10607d7ca7c5SBaolin Wang switch (blk_try_merge(rq, bio)) { 10617d7ca7c5SBaolin Wang case ELEVATOR_BACK_MERGE: 1062265600b7SBaolin Wang if (!sched_allow_merge || blk_mq_sched_allow_merge(q, rq, bio)) 10637d7ca7c5SBaolin Wang return bio_attempt_back_merge(rq, bio, nr_segs); 10647d7ca7c5SBaolin Wang break; 10657d7ca7c5SBaolin Wang case ELEVATOR_FRONT_MERGE: 1066265600b7SBaolin Wang if (!sched_allow_merge || blk_mq_sched_allow_merge(q, rq, bio)) 10677d7ca7c5SBaolin Wang return bio_attempt_front_merge(rq, bio, nr_segs); 10687d7ca7c5SBaolin Wang break; 10697d7ca7c5SBaolin Wang case ELEVATOR_DISCARD_MERGE: 10707d7ca7c5SBaolin Wang return bio_attempt_discard_merge(q, rq, bio); 10717d7ca7c5SBaolin Wang default: 10727d7ca7c5SBaolin Wang return BIO_MERGE_NONE; 10737d7ca7c5SBaolin Wang } 10747d7ca7c5SBaolin Wang 10757d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 10768e756373SBaolin Wang } 10778e756373SBaolin Wang 10788e756373SBaolin Wang /** 10798e756373SBaolin Wang * blk_attempt_plug_merge - try to merge with %current's plugged list 10808e756373SBaolin Wang * @q: request_queue new bio is being queued at 10818e756373SBaolin Wang * @bio: new bio being queued 10828e756373SBaolin Wang * @nr_segs: number of segments in @bio 10838e756373SBaolin Wang * @same_queue_rq: pointer to &struct request that gets filled in when 10848e756373SBaolin Wang * another request associated with @q is found on the plug list 10858e756373SBaolin Wang * (optional, may be %NULL) 10868e756373SBaolin Wang * 1087*d38a9c04SJens Axboe * Determine whether @bio being queued on @q can be merged with the previous 1088*d38a9c04SJens Axboe * request on %current's plugged list. Returns %true if merge was successful, 10898e756373SBaolin Wang * otherwise %false. 10908e756373SBaolin Wang * 10918e756373SBaolin Wang * Plugging coalesces IOs from the same issuer for the same purpose without 10928e756373SBaolin Wang * going through @q->queue_lock. As such it's more of an issuing mechanism 10938e756373SBaolin Wang * than scheduling, and the request, while may have elvpriv data, is not 10948e756373SBaolin Wang * added on the elevator at this point. In addition, we don't have 10958e756373SBaolin Wang * reliable access to the elevator outside queue lock. Only check basic 10968e756373SBaolin Wang * merging parameters without querying the elevator. 10978e756373SBaolin Wang * 10988e756373SBaolin Wang * Caller must ensure !blk_queue_nomerges(q) beforehand. 10998e756373SBaolin Wang */ 11008e756373SBaolin Wang bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio, 11018e756373SBaolin Wang unsigned int nr_segs, struct request **same_queue_rq) 11028e756373SBaolin Wang { 11038e756373SBaolin Wang struct blk_plug *plug; 11048e756373SBaolin Wang struct request *rq; 11058e756373SBaolin Wang 11068e756373SBaolin Wang plug = blk_mq_plug(q, bio); 1107*d38a9c04SJens Axboe if (!plug || list_empty(&plug->mq_list)) 11088e756373SBaolin Wang return false; 11098e756373SBaolin Wang 1110*d38a9c04SJens Axboe /* check the previously added entry for a quick merge attempt */ 1111*d38a9c04SJens Axboe rq = list_last_entry(&plug->mq_list, struct request, queuelist); 11128e756373SBaolin Wang if (rq->q == q && same_queue_rq) { 11138e756373SBaolin Wang /* 1114*d38a9c04SJens Axboe * Only blk-mq multiple hardware queues case checks the rq in 1115*d38a9c04SJens Axboe * the same queue, there should be only one such rq in a queue 1116*d38a9c04SJens Axboe */ 11178e756373SBaolin Wang *same_queue_rq = rq; 11188e756373SBaolin Wang } 1119*d38a9c04SJens Axboe if (blk_attempt_bio_merge(q, rq, bio, nr_segs, false) == BIO_MERGE_OK) 11208e756373SBaolin Wang return true; 11218e756373SBaolin Wang return false; 11228e756373SBaolin Wang } 1123bdc6a287SBaolin Wang 1124bdc6a287SBaolin Wang /* 1125bdc6a287SBaolin Wang * Iterate list of requests and see if we can merge this bio with any 1126bdc6a287SBaolin Wang * of them. 1127bdc6a287SBaolin Wang */ 1128bdc6a287SBaolin Wang bool blk_bio_list_merge(struct request_queue *q, struct list_head *list, 1129bdc6a287SBaolin Wang struct bio *bio, unsigned int nr_segs) 1130bdc6a287SBaolin Wang { 1131bdc6a287SBaolin Wang struct request *rq; 1132bdc6a287SBaolin Wang int checked = 8; 1133bdc6a287SBaolin Wang 1134bdc6a287SBaolin Wang list_for_each_entry_reverse(rq, list, queuelist) { 1135bdc6a287SBaolin Wang if (!checked--) 1136bdc6a287SBaolin Wang break; 1137bdc6a287SBaolin Wang 11387d7ca7c5SBaolin Wang switch (blk_attempt_bio_merge(q, rq, bio, nr_segs, true)) { 11397d7ca7c5SBaolin Wang case BIO_MERGE_NONE: 1140bdc6a287SBaolin Wang continue; 11417d7ca7c5SBaolin Wang case BIO_MERGE_OK: 11427d7ca7c5SBaolin Wang return true; 11437d7ca7c5SBaolin Wang case BIO_MERGE_FAILED: 11447d7ca7c5SBaolin Wang return false; 1145bdc6a287SBaolin Wang } 1146bdc6a287SBaolin Wang 1147bdc6a287SBaolin Wang } 1148bdc6a287SBaolin Wang 1149bdc6a287SBaolin Wang return false; 1150bdc6a287SBaolin Wang } 1151bdc6a287SBaolin Wang EXPORT_SYMBOL_GPL(blk_bio_list_merge); 1152eda5cc99SChristoph Hellwig 1153eda5cc99SChristoph Hellwig bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio, 1154eda5cc99SChristoph Hellwig unsigned int nr_segs, struct request **merged_request) 1155eda5cc99SChristoph Hellwig { 1156eda5cc99SChristoph Hellwig struct request *rq; 1157eda5cc99SChristoph Hellwig 1158eda5cc99SChristoph Hellwig switch (elv_merge(q, &rq, bio)) { 1159eda5cc99SChristoph Hellwig case ELEVATOR_BACK_MERGE: 1160eda5cc99SChristoph Hellwig if (!blk_mq_sched_allow_merge(q, rq, bio)) 1161eda5cc99SChristoph Hellwig return false; 1162eda5cc99SChristoph Hellwig if (bio_attempt_back_merge(rq, bio, nr_segs) != BIO_MERGE_OK) 1163eda5cc99SChristoph Hellwig return false; 1164eda5cc99SChristoph Hellwig *merged_request = attempt_back_merge(q, rq); 1165eda5cc99SChristoph Hellwig if (!*merged_request) 1166eda5cc99SChristoph Hellwig elv_merged_request(q, rq, ELEVATOR_BACK_MERGE); 1167eda5cc99SChristoph Hellwig return true; 1168eda5cc99SChristoph Hellwig case ELEVATOR_FRONT_MERGE: 1169eda5cc99SChristoph Hellwig if (!blk_mq_sched_allow_merge(q, rq, bio)) 1170eda5cc99SChristoph Hellwig return false; 1171eda5cc99SChristoph Hellwig if (bio_attempt_front_merge(rq, bio, nr_segs) != BIO_MERGE_OK) 1172eda5cc99SChristoph Hellwig return false; 1173eda5cc99SChristoph Hellwig *merged_request = attempt_front_merge(q, rq); 1174eda5cc99SChristoph Hellwig if (!*merged_request) 1175eda5cc99SChristoph Hellwig elv_merged_request(q, rq, ELEVATOR_FRONT_MERGE); 1176eda5cc99SChristoph Hellwig return true; 1177eda5cc99SChristoph Hellwig case ELEVATOR_DISCARD_MERGE: 1178eda5cc99SChristoph Hellwig return bio_attempt_discard_merge(q, rq, bio) == BIO_MERGE_OK; 1179eda5cc99SChristoph Hellwig default: 1180eda5cc99SChristoph Hellwig return false; 1181eda5cc99SChristoph Hellwig } 1182eda5cc99SChristoph Hellwig } 1183eda5cc99SChristoph Hellwig EXPORT_SYMBOL_GPL(blk_mq_sched_try_merge); 1184