1b2441318SGreg Kroah-Hartman // SPDX-License-Identifier: GPL-2.0 2d6d48196SJens Axboe /* 3d6d48196SJens Axboe * Functions related to segment and merge handling 4d6d48196SJens Axboe */ 5d6d48196SJens Axboe #include <linux/kernel.h> 6d6d48196SJens Axboe #include <linux/module.h> 7d6d48196SJens Axboe #include <linux/bio.h> 8d6d48196SJens Axboe #include <linux/blkdev.h> 9fe45e630SChristoph Hellwig #include <linux/blk-integrity.h> 10d6d48196SJens Axboe #include <linux/scatterlist.h> 1182d981d4SChristoph Hellwig #include <linux/part_stat.h> 126b2b0459STejun Heo #include <linux/blk-cgroup.h> 13d6d48196SJens Axboe 14cda22646SMike Krinkin #include <trace/events/block.h> 15cda22646SMike Krinkin 16d6d48196SJens Axboe #include "blk.h" 172aa7745bSChristoph Hellwig #include "blk-mq-sched.h" 188e756373SBaolin Wang #include "blk-rq-qos.h" 19a7b36ee6SJens Axboe #include "blk-throttle.h" 20d6d48196SJens Axboe 21ff18d77bSChristoph Hellwig static inline void bio_get_first_bvec(struct bio *bio, struct bio_vec *bv) 22ff18d77bSChristoph Hellwig { 23ff18d77bSChristoph Hellwig *bv = mp_bvec_iter_bvec(bio->bi_io_vec, bio->bi_iter); 24ff18d77bSChristoph Hellwig } 25ff18d77bSChristoph Hellwig 26ff18d77bSChristoph Hellwig static inline void bio_get_last_bvec(struct bio *bio, struct bio_vec *bv) 27ff18d77bSChristoph Hellwig { 28ff18d77bSChristoph Hellwig struct bvec_iter iter = bio->bi_iter; 29ff18d77bSChristoph Hellwig int idx; 30ff18d77bSChristoph Hellwig 31ff18d77bSChristoph Hellwig bio_get_first_bvec(bio, bv); 32ff18d77bSChristoph Hellwig if (bv->bv_len == bio->bi_iter.bi_size) 33ff18d77bSChristoph Hellwig return; /* this bio only has a single bvec */ 34ff18d77bSChristoph Hellwig 35ff18d77bSChristoph Hellwig bio_advance_iter(bio, &iter, iter.bi_size); 36ff18d77bSChristoph Hellwig 37ff18d77bSChristoph Hellwig if (!iter.bi_bvec_done) 38ff18d77bSChristoph Hellwig idx = iter.bi_idx - 1; 39ff18d77bSChristoph Hellwig else /* in the middle of bvec */ 40ff18d77bSChristoph Hellwig idx = iter.bi_idx; 41ff18d77bSChristoph Hellwig 42ff18d77bSChristoph Hellwig *bv = bio->bi_io_vec[idx]; 43ff18d77bSChristoph Hellwig 44ff18d77bSChristoph Hellwig /* 45ff18d77bSChristoph Hellwig * iter.bi_bvec_done records actual length of the last bvec 46ff18d77bSChristoph Hellwig * if this bio ends in the middle of one io vector 47ff18d77bSChristoph Hellwig */ 48ff18d77bSChristoph Hellwig if (iter.bi_bvec_done) 49ff18d77bSChristoph Hellwig bv->bv_len = iter.bi_bvec_done; 50ff18d77bSChristoph Hellwig } 51ff18d77bSChristoph Hellwig 52e9907009SChristoph Hellwig static inline bool bio_will_gap(struct request_queue *q, 53e9907009SChristoph Hellwig struct request *prev_rq, struct bio *prev, struct bio *next) 54e9907009SChristoph Hellwig { 55e9907009SChristoph Hellwig struct bio_vec pb, nb; 56e9907009SChristoph Hellwig 57e9907009SChristoph Hellwig if (!bio_has_data(prev) || !queue_virt_boundary(q)) 58e9907009SChristoph Hellwig return false; 59e9907009SChristoph Hellwig 60e9907009SChristoph Hellwig /* 61e9907009SChristoph Hellwig * Don't merge if the 1st bio starts with non-zero offset, otherwise it 62e9907009SChristoph Hellwig * is quite difficult to respect the sg gap limit. We work hard to 63e9907009SChristoph Hellwig * merge a huge number of small single bios in case of mkfs. 64e9907009SChristoph Hellwig */ 65e9907009SChristoph Hellwig if (prev_rq) 66e9907009SChristoph Hellwig bio_get_first_bvec(prev_rq->bio, &pb); 67e9907009SChristoph Hellwig else 68e9907009SChristoph Hellwig bio_get_first_bvec(prev, &pb); 69df376b2eSJohannes Thumshirn if (pb.bv_offset & queue_virt_boundary(q)) 70e9907009SChristoph Hellwig return true; 71e9907009SChristoph Hellwig 72e9907009SChristoph Hellwig /* 73e9907009SChristoph Hellwig * We don't need to worry about the situation that the merged segment 74e9907009SChristoph Hellwig * ends in unaligned virt boundary: 75e9907009SChristoph Hellwig * 76e9907009SChristoph Hellwig * - if 'pb' ends aligned, the merged segment ends aligned 77e9907009SChristoph Hellwig * - if 'pb' ends unaligned, the next bio must include 78e9907009SChristoph Hellwig * one single bvec of 'nb', otherwise the 'nb' can't 79e9907009SChristoph Hellwig * merge with 'pb' 80e9907009SChristoph Hellwig */ 81e9907009SChristoph Hellwig bio_get_last_bvec(prev, &pb); 82e9907009SChristoph Hellwig bio_get_first_bvec(next, &nb); 83200a9affSChristoph Hellwig if (biovec_phys_mergeable(q, &pb, &nb)) 84e9907009SChristoph Hellwig return false; 85e9907009SChristoph Hellwig return __bvec_gap_to_prev(q, &pb, nb.bv_offset); 86e9907009SChristoph Hellwig } 87e9907009SChristoph Hellwig 88e9907009SChristoph Hellwig static inline bool req_gap_back_merge(struct request *req, struct bio *bio) 89e9907009SChristoph Hellwig { 90e9907009SChristoph Hellwig return bio_will_gap(req->q, req, req->biotail, bio); 91e9907009SChristoph Hellwig } 92e9907009SChristoph Hellwig 93e9907009SChristoph Hellwig static inline bool req_gap_front_merge(struct request *req, struct bio *bio) 94e9907009SChristoph Hellwig { 95e9907009SChristoph Hellwig return bio_will_gap(req->q, NULL, bio, req->bio); 96e9907009SChristoph Hellwig } 97e9907009SChristoph Hellwig 9854efd50bSKent Overstreet static struct bio *blk_bio_discard_split(struct request_queue *q, 9954efd50bSKent Overstreet struct bio *bio, 100bdced438SMing Lei struct bio_set *bs, 101bdced438SMing Lei unsigned *nsegs) 10254efd50bSKent Overstreet { 10354efd50bSKent Overstreet unsigned int max_discard_sectors, granularity; 10454efd50bSKent Overstreet int alignment; 10554efd50bSKent Overstreet sector_t tmp; 10654efd50bSKent Overstreet unsigned split_sectors; 10754efd50bSKent Overstreet 108bdced438SMing Lei *nsegs = 1; 109bdced438SMing Lei 11054efd50bSKent Overstreet /* Zero-sector (unknown) and one-sector granularities are the same. */ 11154efd50bSKent Overstreet granularity = max(q->limits.discard_granularity >> 9, 1U); 11254efd50bSKent Overstreet 1131adfc5e4SMing Lei max_discard_sectors = min(q->limits.max_discard_sectors, 1141adfc5e4SMing Lei bio_allowed_max_sectors(q)); 11554efd50bSKent Overstreet max_discard_sectors -= max_discard_sectors % granularity; 11654efd50bSKent Overstreet 11754efd50bSKent Overstreet if (unlikely(!max_discard_sectors)) { 11854efd50bSKent Overstreet /* XXX: warn */ 11954efd50bSKent Overstreet return NULL; 12054efd50bSKent Overstreet } 12154efd50bSKent Overstreet 12254efd50bSKent Overstreet if (bio_sectors(bio) <= max_discard_sectors) 12354efd50bSKent Overstreet return NULL; 12454efd50bSKent Overstreet 12554efd50bSKent Overstreet split_sectors = max_discard_sectors; 12654efd50bSKent Overstreet 12754efd50bSKent Overstreet /* 12854efd50bSKent Overstreet * If the next starting sector would be misaligned, stop the discard at 12954efd50bSKent Overstreet * the previous aligned sector. 13054efd50bSKent Overstreet */ 13154efd50bSKent Overstreet alignment = (q->limits.discard_alignment >> 9) % granularity; 13254efd50bSKent Overstreet 13354efd50bSKent Overstreet tmp = bio->bi_iter.bi_sector + split_sectors - alignment; 13454efd50bSKent Overstreet tmp = sector_div(tmp, granularity); 13554efd50bSKent Overstreet 13654efd50bSKent Overstreet if (split_sectors > tmp) 13754efd50bSKent Overstreet split_sectors -= tmp; 13854efd50bSKent Overstreet 13954efd50bSKent Overstreet return bio_split(bio, split_sectors, GFP_NOIO, bs); 14054efd50bSKent Overstreet } 14154efd50bSKent Overstreet 142885fa13fSChristoph Hellwig static struct bio *blk_bio_write_zeroes_split(struct request_queue *q, 143885fa13fSChristoph Hellwig struct bio *bio, struct bio_set *bs, unsigned *nsegs) 144885fa13fSChristoph Hellwig { 145d665e12aSChristoph Hellwig *nsegs = 0; 146885fa13fSChristoph Hellwig 147885fa13fSChristoph Hellwig if (!q->limits.max_write_zeroes_sectors) 148885fa13fSChristoph Hellwig return NULL; 149885fa13fSChristoph Hellwig 150885fa13fSChristoph Hellwig if (bio_sectors(bio) <= q->limits.max_write_zeroes_sectors) 151885fa13fSChristoph Hellwig return NULL; 152885fa13fSChristoph Hellwig 153885fa13fSChristoph Hellwig return bio_split(bio, q->limits.max_write_zeroes_sectors, GFP_NOIO, bs); 154885fa13fSChristoph Hellwig } 155885fa13fSChristoph Hellwig 1569cc5169cSBart Van Assche /* 1579cc5169cSBart Van Assche * Return the maximum number of sectors from the start of a bio that may be 1589cc5169cSBart Van Assche * submitted as a single request to a block device. If enough sectors remain, 1599cc5169cSBart Van Assche * align the end to the physical block size. Otherwise align the end to the 1609cc5169cSBart Van Assche * logical block size. This approach minimizes the number of non-aligned 1619cc5169cSBart Van Assche * requests that are submitted to a block device if the start of a bio is not 1629cc5169cSBart Van Assche * aligned to a physical block boundary. 1639cc5169cSBart Van Assche */ 164d0e5fbb0SMing Lei static inline unsigned get_max_io_size(struct request_queue *q, 165d0e5fbb0SMing Lei struct bio *bio) 166d0e5fbb0SMing Lei { 1679cc5169cSBart Van Assche unsigned pbs = queue_physical_block_size(q) >> SECTOR_SHIFT; 1689cc5169cSBart Van Assche unsigned lbs = queue_logical_block_size(q) >> SECTOR_SHIFT; 169*84613bedSChristoph Hellwig unsigned max_sectors, start, end; 170d0e5fbb0SMing Lei 171*84613bedSChristoph Hellwig max_sectors = blk_max_size_offset(q, bio->bi_iter.bi_sector, 0); 172*84613bedSChristoph Hellwig start = bio->bi_iter.bi_sector & (pbs - 1); 173*84613bedSChristoph Hellwig end = (start + max_sectors) & ~(pbs - 1); 174*84613bedSChristoph Hellwig if (end > start) 175*84613bedSChristoph Hellwig return end - start; 176*84613bedSChristoph Hellwig return max_sectors & ~(lbs - 1); 177d0e5fbb0SMing Lei } 178d0e5fbb0SMing Lei 179429120f3SMing Lei static inline unsigned get_max_segment_size(const struct request_queue *q, 180429120f3SMing Lei struct page *start_page, 181429120f3SMing Lei unsigned long offset) 182dcebd755SMing Lei { 183dcebd755SMing Lei unsigned long mask = queue_segment_boundary(q); 184dcebd755SMing Lei 185429120f3SMing Lei offset = mask & (page_to_phys(start_page) + offset); 1864a2f704eSMing Lei 1874a2f704eSMing Lei /* 1884a2f704eSMing Lei * overflow may be triggered in case of zero page physical address 1894a2f704eSMing Lei * on 32bit arch, use queue's max segment size when that happens. 1904a2f704eSMing Lei */ 1914a2f704eSMing Lei return min_not_zero(mask - offset + 1, 1924a2f704eSMing Lei (unsigned long)queue_max_segment_size(q)); 193dcebd755SMing Lei } 194dcebd755SMing Lei 195708b25b3SBart Van Assche /** 196708b25b3SBart Van Assche * bvec_split_segs - verify whether or not a bvec should be split in the middle 197708b25b3SBart Van Assche * @q: [in] request queue associated with the bio associated with @bv 198708b25b3SBart Van Assche * @bv: [in] bvec to examine 199708b25b3SBart Van Assche * @nsegs: [in,out] Number of segments in the bio being built. Incremented 200708b25b3SBart Van Assche * by the number of segments from @bv that may be appended to that 201708b25b3SBart Van Assche * bio without exceeding @max_segs 20267927d22SKeith Busch * @bytes: [in,out] Number of bytes in the bio being built. Incremented 20367927d22SKeith Busch * by the number of bytes from @bv that may be appended to that 20467927d22SKeith Busch * bio without exceeding @max_bytes 205708b25b3SBart Van Assche * @max_segs: [in] upper bound for *@nsegs 20667927d22SKeith Busch * @max_bytes: [in] upper bound for *@bytes 207708b25b3SBart Van Assche * 208708b25b3SBart Van Assche * When splitting a bio, it can happen that a bvec is encountered that is too 209708b25b3SBart Van Assche * big to fit in a single segment and hence that it has to be split in the 210708b25b3SBart Van Assche * middle. This function verifies whether or not that should happen. The value 211708b25b3SBart Van Assche * %true is returned if and only if appending the entire @bv to a bio with 212708b25b3SBart Van Assche * *@nsegs segments and *@sectors sectors would make that bio unacceptable for 213708b25b3SBart Van Assche * the block driver. 214dcebd755SMing Lei */ 215af2c68feSBart Van Assche static bool bvec_split_segs(const struct request_queue *q, 216af2c68feSBart Van Assche const struct bio_vec *bv, unsigned *nsegs, 21767927d22SKeith Busch unsigned *bytes, unsigned max_segs, 21867927d22SKeith Busch unsigned max_bytes) 219dcebd755SMing Lei { 22067927d22SKeith Busch unsigned max_len = min(max_bytes, UINT_MAX) - *bytes; 221708b25b3SBart Van Assche unsigned len = min(bv->bv_len, max_len); 222dcebd755SMing Lei unsigned total_len = 0; 223ff9811b3SBart Van Assche unsigned seg_size = 0; 224dcebd755SMing Lei 225ff9811b3SBart Van Assche while (len && *nsegs < max_segs) { 226429120f3SMing Lei seg_size = get_max_segment_size(q, bv->bv_page, 227429120f3SMing Lei bv->bv_offset + total_len); 228dcebd755SMing Lei seg_size = min(seg_size, len); 229dcebd755SMing Lei 230ff9811b3SBart Van Assche (*nsegs)++; 231dcebd755SMing Lei total_len += seg_size; 232dcebd755SMing Lei len -= seg_size; 233dcebd755SMing Lei 234dcebd755SMing Lei if ((bv->bv_offset + total_len) & queue_virt_boundary(q)) 235dcebd755SMing Lei break; 236dcebd755SMing Lei } 237dcebd755SMing Lei 23867927d22SKeith Busch *bytes += total_len; 239dcebd755SMing Lei 240708b25b3SBart Van Assche /* tell the caller to split the bvec if it is too big to fit */ 241708b25b3SBart Van Assche return len > 0 || bv->bv_len > max_len; 242dcebd755SMing Lei } 243dcebd755SMing Lei 244dad77584SBart Van Assche /** 245dad77584SBart Van Assche * blk_bio_segment_split - split a bio in two bios 246dad77584SBart Van Assche * @q: [in] request queue pointer 247dad77584SBart Van Assche * @bio: [in] bio to be split 248dad77584SBart Van Assche * @bs: [in] bio set to allocate the clone from 249dad77584SBart Van Assche * @segs: [out] number of segments in the bio with the first half of the sectors 250dad77584SBart Van Assche * 251dad77584SBart Van Assche * Clone @bio, update the bi_iter of the clone to represent the first sectors 252dad77584SBart Van Assche * of @bio and update @bio->bi_iter to represent the remaining sectors. The 253dad77584SBart Van Assche * following is guaranteed for the cloned bio: 254dad77584SBart Van Assche * - That it has at most get_max_io_size(@q, @bio) sectors. 255dad77584SBart Van Assche * - That it has at most queue_max_segments(@q) segments. 256dad77584SBart Van Assche * 257dad77584SBart Van Assche * Except for discard requests the cloned bio will point at the bi_io_vec of 258dad77584SBart Van Assche * the original bio. It is the responsibility of the caller to ensure that the 259dad77584SBart Van Assche * original bio is not freed before the cloned bio. The caller is also 260dad77584SBart Van Assche * responsible for ensuring that @bs is only destroyed after processing of the 261dad77584SBart Van Assche * split bio has finished. 262dad77584SBart Van Assche */ 26354efd50bSKent Overstreet static struct bio *blk_bio_segment_split(struct request_queue *q, 26454efd50bSKent Overstreet struct bio *bio, 265bdced438SMing Lei struct bio_set *bs, 266bdced438SMing Lei unsigned *segs) 26754efd50bSKent Overstreet { 2685014c311SJens Axboe struct bio_vec bv, bvprv, *bvprvp = NULL; 26954efd50bSKent Overstreet struct bvec_iter iter; 27067927d22SKeith Busch unsigned nsegs = 0, bytes = 0; 27167927d22SKeith Busch const unsigned max_bytes = get_max_io_size(q, bio) << 9; 27205b700baSMing Lei const unsigned max_segs = queue_max_segments(q); 27354efd50bSKent Overstreet 274dcebd755SMing Lei bio_for_each_bvec(bv, bio, iter) { 27554efd50bSKent Overstreet /* 27654efd50bSKent Overstreet * If the queue doesn't support SG gaps and adding this 27754efd50bSKent Overstreet * offset would create a gap, disallow it. 27854efd50bSKent Overstreet */ 2795014c311SJens Axboe if (bvprvp && bvec_gap_to_prev(q, bvprvp, bv.bv_offset)) 28054efd50bSKent Overstreet goto split; 28154efd50bSKent Overstreet 28205b700baSMing Lei if (nsegs < max_segs && 28367927d22SKeith Busch bytes + bv.bv_len <= max_bytes && 284708b25b3SBart Van Assche bv.bv_offset + bv.bv_len <= PAGE_SIZE) { 285708b25b3SBart Van Assche nsegs++; 28667927d22SKeith Busch bytes += bv.bv_len; 28767927d22SKeith Busch } else if (bvec_split_segs(q, &bv, &nsegs, &bytes, max_segs, 28867927d22SKeith Busch max_bytes)) { 289e36f6204SKeith Busch goto split; 290e36f6204SKeith Busch } 291e36f6204SKeith Busch 29254efd50bSKent Overstreet bvprv = bv; 293578270bfSMing Lei bvprvp = &bvprv; 29454efd50bSKent Overstreet } 29554efd50bSKent Overstreet 296d627065dSChristoph Hellwig *segs = nsegs; 297d627065dSChristoph Hellwig return NULL; 29854efd50bSKent Overstreet split: 299bdced438SMing Lei *segs = nsegs; 300cc29e1bfSJeffle Xu 301cc29e1bfSJeffle Xu /* 30267927d22SKeith Busch * Individual bvecs might not be logical block aligned. Round down the 30367927d22SKeith Busch * split size so that each bio is properly block size aligned, even if 30467927d22SKeith Busch * we do not use the full hardware limits. 30567927d22SKeith Busch */ 30667927d22SKeith Busch bytes = ALIGN_DOWN(bytes, queue_logical_block_size(q)); 30767927d22SKeith Busch 30867927d22SKeith Busch /* 309cc29e1bfSJeffle Xu * Bio splitting may cause subtle trouble such as hang when doing sync 310cc29e1bfSJeffle Xu * iopoll in direct IO routine. Given performance gain of iopoll for 311cc29e1bfSJeffle Xu * big IO can be trival, disable iopoll when split needed. 312cc29e1bfSJeffle Xu */ 3136ce913feSChristoph Hellwig bio_clear_polled(bio); 31467927d22SKeith Busch return bio_split(bio, bytes >> SECTOR_SHIFT, GFP_NOIO, bs); 31554efd50bSKent Overstreet } 31654efd50bSKent Overstreet 317dad77584SBart Van Assche /** 318dad77584SBart Van Assche * __blk_queue_split - split a bio and submit the second half 319abd45c15SJens Axboe * @q: [in] request_queue new bio is being queued at 320dad77584SBart Van Assche * @bio: [in, out] bio to be split 321dad77584SBart Van Assche * @nr_segs: [out] number of segments in the first bio 322dad77584SBart Van Assche * 323dad77584SBart Van Assche * Split a bio into two bios, chain the two bios, submit the second half and 324dad77584SBart Van Assche * store a pointer to the first half in *@bio. If the second bio is still too 325dad77584SBart Van Assche * big it will be split by a recursive call to this function. Since this 326309dca30SChristoph Hellwig * function may allocate a new bio from q->bio_split, it is the responsibility 327309dca30SChristoph Hellwig * of the caller to ensure that q->bio_split is only released after processing 328309dca30SChristoph Hellwig * of the split bio has finished. 329dad77584SBart Van Assche */ 330abd45c15SJens Axboe void __blk_queue_split(struct request_queue *q, struct bio **bio, 331abd45c15SJens Axboe unsigned int *nr_segs) 33254efd50bSKent Overstreet { 333fa532287SChristoph Hellwig struct bio *split = NULL; 33454efd50bSKent Overstreet 3357afafc8aSAdrian Hunter switch (bio_op(*bio)) { 3367afafc8aSAdrian Hunter case REQ_OP_DISCARD: 3377afafc8aSAdrian Hunter case REQ_OP_SECURE_ERASE: 33814ccb66bSChristoph Hellwig split = blk_bio_discard_split(q, *bio, &q->bio_split, nr_segs); 3397afafc8aSAdrian Hunter break; 340a6f0788eSChaitanya Kulkarni case REQ_OP_WRITE_ZEROES: 34114ccb66bSChristoph Hellwig split = blk_bio_write_zeroes_split(q, *bio, &q->bio_split, 34214ccb66bSChristoph Hellwig nr_segs); 343a6f0788eSChaitanya Kulkarni break; 3447afafc8aSAdrian Hunter default: 34514ccb66bSChristoph Hellwig split = blk_bio_segment_split(q, *bio, &q->bio_split, nr_segs); 3467afafc8aSAdrian Hunter break; 3477afafc8aSAdrian Hunter } 348bdced438SMing Lei 34954efd50bSKent Overstreet if (split) { 3506ac45aebSMing Lei /* there isn't chance to merge the splitted bio */ 3511eff9d32SJens Axboe split->bi_opf |= REQ_NOMERGE; 3526ac45aebSMing Lei 35354efd50bSKent Overstreet bio_chain(split, *bio); 354eb6f7f7cSChristoph Hellwig trace_block_split(split, (*bio)->bi_iter.bi_sector); 355ed00aabdSChristoph Hellwig submit_bio_noacct(*bio); 35654efd50bSKent Overstreet *bio = split; 35754efd50bSKent Overstreet } 35854efd50bSKent Overstreet } 35914ccb66bSChristoph Hellwig 360dad77584SBart Van Assche /** 361dad77584SBart Van Assche * blk_queue_split - split a bio and submit the second half 362dad77584SBart Van Assche * @bio: [in, out] bio to be split 363dad77584SBart Van Assche * 364dad77584SBart Van Assche * Split a bio into two bios, chains the two bios, submit the second half and 365dad77584SBart Van Assche * store a pointer to the first half in *@bio. Since this function may allocate 366309dca30SChristoph Hellwig * a new bio from q->bio_split, it is the responsibility of the caller to ensure 367309dca30SChristoph Hellwig * that q->bio_split is only released after processing of the split bio has 368309dca30SChristoph Hellwig * finished. 369dad77584SBart Van Assche */ 370f695ca38SChristoph Hellwig void blk_queue_split(struct bio **bio) 37114ccb66bSChristoph Hellwig { 372859897c3SPavel Begunkov struct request_queue *q = bdev_get_queue((*bio)->bi_bdev); 37314ccb66bSChristoph Hellwig unsigned int nr_segs; 37414ccb66bSChristoph Hellwig 375abd45c15SJens Axboe if (blk_may_split(q, *bio)) 376abd45c15SJens Axboe __blk_queue_split(q, bio, &nr_segs); 37714ccb66bSChristoph Hellwig } 37854efd50bSKent Overstreet EXPORT_SYMBOL(blk_queue_split); 37954efd50bSKent Overstreet 380e9cd19c0SChristoph Hellwig unsigned int blk_recalc_rq_segments(struct request *rq) 381d6d48196SJens Axboe { 3826869875fSChristoph Hellwig unsigned int nr_phys_segs = 0; 38367927d22SKeith Busch unsigned int bytes = 0; 384e9cd19c0SChristoph Hellwig struct req_iterator iter; 3856869875fSChristoph Hellwig struct bio_vec bv; 386d6d48196SJens Axboe 387e9cd19c0SChristoph Hellwig if (!rq->bio) 3881e428079SJens Axboe return 0; 389d6d48196SJens Axboe 390e9cd19c0SChristoph Hellwig switch (bio_op(rq->bio)) { 391a6f0788eSChaitanya Kulkarni case REQ_OP_DISCARD: 392a6f0788eSChaitanya Kulkarni case REQ_OP_SECURE_ERASE: 393a958937fSDavid Jeffery if (queue_max_discard_segments(rq->q) > 1) { 394a958937fSDavid Jeffery struct bio *bio = rq->bio; 395a958937fSDavid Jeffery 396a958937fSDavid Jeffery for_each_bio(bio) 397a958937fSDavid Jeffery nr_phys_segs++; 398a958937fSDavid Jeffery return nr_phys_segs; 399a958937fSDavid Jeffery } 400a958937fSDavid Jeffery return 1; 401a6f0788eSChaitanya Kulkarni case REQ_OP_WRITE_ZEROES: 402f9d03f96SChristoph Hellwig return 0; 403a6f0788eSChaitanya Kulkarni } 4045cb8850cSKent Overstreet 405e9cd19c0SChristoph Hellwig rq_for_each_bvec(bv, rq, iter) 40667927d22SKeith Busch bvec_split_segs(rq->q, &bv, &nr_phys_segs, &bytes, 407708b25b3SBart Van Assche UINT_MAX, UINT_MAX); 4081e428079SJens Axboe return nr_phys_segs; 4091e428079SJens Axboe } 4101e428079SJens Axboe 41148d7727cSMing Lei static inline struct scatterlist *blk_next_sg(struct scatterlist **sg, 412862e5a5eSMing Lei struct scatterlist *sglist) 413862e5a5eSMing Lei { 414862e5a5eSMing Lei if (!*sg) 415862e5a5eSMing Lei return sglist; 416862e5a5eSMing Lei 417862e5a5eSMing Lei /* 418862e5a5eSMing Lei * If the driver previously mapped a shorter list, we could see a 419862e5a5eSMing Lei * termination bit prematurely unless it fully inits the sg table 420862e5a5eSMing Lei * on each mapping. We KNOW that there must be more entries here 421862e5a5eSMing Lei * or the driver would be buggy, so force clear the termination bit 422862e5a5eSMing Lei * to avoid doing a full sg_init_table() in drivers for each command. 423862e5a5eSMing Lei */ 424862e5a5eSMing Lei sg_unmark_end(*sg); 425862e5a5eSMing Lei return sg_next(*sg); 426862e5a5eSMing Lei } 427862e5a5eSMing Lei 428862e5a5eSMing Lei static unsigned blk_bvec_map_sg(struct request_queue *q, 429862e5a5eSMing Lei struct bio_vec *bvec, struct scatterlist *sglist, 430862e5a5eSMing Lei struct scatterlist **sg) 431862e5a5eSMing Lei { 432862e5a5eSMing Lei unsigned nbytes = bvec->bv_len; 4338a96a0e4SChristoph Hellwig unsigned nsegs = 0, total = 0; 434862e5a5eSMing Lei 435862e5a5eSMing Lei while (nbytes > 0) { 4368a96a0e4SChristoph Hellwig unsigned offset = bvec->bv_offset + total; 437429120f3SMing Lei unsigned len = min(get_max_segment_size(q, bvec->bv_page, 438429120f3SMing Lei offset), nbytes); 439f9f76879SChristoph Hellwig struct page *page = bvec->bv_page; 440f9f76879SChristoph Hellwig 441f9f76879SChristoph Hellwig /* 442f9f76879SChristoph Hellwig * Unfortunately a fair number of drivers barf on scatterlists 443f9f76879SChristoph Hellwig * that have an offset larger than PAGE_SIZE, despite other 444f9f76879SChristoph Hellwig * subsystems dealing with that invariant just fine. For now 445f9f76879SChristoph Hellwig * stick to the legacy format where we never present those from 446f9f76879SChristoph Hellwig * the block layer, but the code below should be removed once 447f9f76879SChristoph Hellwig * these offenders (mostly MMC/SD drivers) are fixed. 448f9f76879SChristoph Hellwig */ 449f9f76879SChristoph Hellwig page += (offset >> PAGE_SHIFT); 450f9f76879SChristoph Hellwig offset &= ~PAGE_MASK; 451862e5a5eSMing Lei 452862e5a5eSMing Lei *sg = blk_next_sg(sg, sglist); 453f9f76879SChristoph Hellwig sg_set_page(*sg, page, len, offset); 454862e5a5eSMing Lei 4558a96a0e4SChristoph Hellwig total += len; 4568a96a0e4SChristoph Hellwig nbytes -= len; 457862e5a5eSMing Lei nsegs++; 458862e5a5eSMing Lei } 459862e5a5eSMing Lei 460862e5a5eSMing Lei return nsegs; 461862e5a5eSMing Lei } 462862e5a5eSMing Lei 46316e3e418SMing Lei static inline int __blk_bvec_map_sg(struct bio_vec bv, 46416e3e418SMing Lei struct scatterlist *sglist, struct scatterlist **sg) 46516e3e418SMing Lei { 46616e3e418SMing Lei *sg = blk_next_sg(sg, sglist); 46716e3e418SMing Lei sg_set_page(*sg, bv.bv_page, bv.bv_len, bv.bv_offset); 46816e3e418SMing Lei return 1; 46916e3e418SMing Lei } 47016e3e418SMing Lei 471f6970f83SMing Lei /* only try to merge bvecs into one sg if they are from two bios */ 472f6970f83SMing Lei static inline bool 473f6970f83SMing Lei __blk_segment_map_sg_merge(struct request_queue *q, struct bio_vec *bvec, 474f6970f83SMing Lei struct bio_vec *bvprv, struct scatterlist **sg) 475963ab9e5SAsias He { 476963ab9e5SAsias He 477963ab9e5SAsias He int nbytes = bvec->bv_len; 478963ab9e5SAsias He 479f6970f83SMing Lei if (!*sg) 480f6970f83SMing Lei return false; 481f6970f83SMing Lei 482b4b6cb61SMing Lei if ((*sg)->length + nbytes > queue_max_segment_size(q)) 483f6970f83SMing Lei return false; 484f6970f83SMing Lei 4853dccdae5SChristoph Hellwig if (!biovec_phys_mergeable(q, bvprv, bvec)) 486f6970f83SMing Lei return false; 487963ab9e5SAsias He 488963ab9e5SAsias He (*sg)->length += nbytes; 489f6970f83SMing Lei 490f6970f83SMing Lei return true; 491963ab9e5SAsias He } 492963ab9e5SAsias He 4935cb8850cSKent Overstreet static int __blk_bios_map_sg(struct request_queue *q, struct bio *bio, 4945cb8850cSKent Overstreet struct scatterlist *sglist, 4955cb8850cSKent Overstreet struct scatterlist **sg) 4965cb8850cSKent Overstreet { 4973f649ab7SKees Cook struct bio_vec bvec, bvprv = { NULL }; 4985cb8850cSKent Overstreet struct bvec_iter iter; 49938417468SChristoph Hellwig int nsegs = 0; 500f6970f83SMing Lei bool new_bio = false; 5015cb8850cSKent Overstreet 502f6970f83SMing Lei for_each_bio(bio) { 503f6970f83SMing Lei bio_for_each_bvec(bvec, bio, iter) { 504f6970f83SMing Lei /* 505f6970f83SMing Lei * Only try to merge bvecs from two bios given we 506f6970f83SMing Lei * have done bio internal merge when adding pages 507f6970f83SMing Lei * to bio 508f6970f83SMing Lei */ 509f6970f83SMing Lei if (new_bio && 510f6970f83SMing Lei __blk_segment_map_sg_merge(q, &bvec, &bvprv, sg)) 511f6970f83SMing Lei goto next_bvec; 512f6970f83SMing Lei 513f6970f83SMing Lei if (bvec.bv_offset + bvec.bv_len <= PAGE_SIZE) 514f6970f83SMing Lei nsegs += __blk_bvec_map_sg(bvec, sglist, sg); 515f6970f83SMing Lei else 516f6970f83SMing Lei nsegs += blk_bvec_map_sg(q, &bvec, sglist, sg); 517f6970f83SMing Lei next_bvec: 518f6970f83SMing Lei new_bio = false; 519f6970f83SMing Lei } 520b21e11c5SMing Lei if (likely(bio->bi_iter.bi_size)) { 521f6970f83SMing Lei bvprv = bvec; 522f6970f83SMing Lei new_bio = true; 523f6970f83SMing Lei } 524b21e11c5SMing Lei } 5255cb8850cSKent Overstreet 5265cb8850cSKent Overstreet return nsegs; 5275cb8850cSKent Overstreet } 5285cb8850cSKent Overstreet 529d6d48196SJens Axboe /* 530d6d48196SJens Axboe * map a request to scatterlist, return number of sg entries setup. Caller 531d6d48196SJens Axboe * must make sure sg can hold rq->nr_phys_segments entries 532d6d48196SJens Axboe */ 53389de1504SChristoph Hellwig int __blk_rq_map_sg(struct request_queue *q, struct request *rq, 53489de1504SChristoph Hellwig struct scatterlist *sglist, struct scatterlist **last_sg) 535d6d48196SJens Axboe { 5365cb8850cSKent Overstreet int nsegs = 0; 537d6d48196SJens Axboe 538f9d03f96SChristoph Hellwig if (rq->rq_flags & RQF_SPECIAL_PAYLOAD) 53989de1504SChristoph Hellwig nsegs = __blk_bvec_map_sg(rq->special_vec, sglist, last_sg); 540f9d03f96SChristoph Hellwig else if (rq->bio) 54189de1504SChristoph Hellwig nsegs = __blk_bios_map_sg(q, rq->bio, sglist, last_sg); 542f18573abSFUJITA Tomonori 54389de1504SChristoph Hellwig if (*last_sg) 54489de1504SChristoph Hellwig sg_mark_end(*last_sg); 545d6d48196SJens Axboe 54612e57f59SMing Lei /* 54712e57f59SMing Lei * Something must have been wrong if the figured number of 54812e57f59SMing Lei * segment is bigger than number of req's physical segments 54912e57f59SMing Lei */ 550f9d03f96SChristoph Hellwig WARN_ON(nsegs > blk_rq_nr_phys_segments(rq)); 55112e57f59SMing Lei 552d6d48196SJens Axboe return nsegs; 553d6d48196SJens Axboe } 55489de1504SChristoph Hellwig EXPORT_SYMBOL(__blk_rq_map_sg); 555d6d48196SJens Axboe 556943b40c8SMing Lei static inline unsigned int blk_rq_get_max_segments(struct request *rq) 557943b40c8SMing Lei { 558943b40c8SMing Lei if (req_op(rq) == REQ_OP_DISCARD) 559943b40c8SMing Lei return queue_max_discard_segments(rq->q); 560943b40c8SMing Lei return queue_max_segments(rq->q); 561943b40c8SMing Lei } 562943b40c8SMing Lei 563badf7f64SChristoph Hellwig static inline unsigned int blk_rq_get_max_sectors(struct request *rq, 564badf7f64SChristoph Hellwig sector_t offset) 565badf7f64SChristoph Hellwig { 566badf7f64SChristoph Hellwig struct request_queue *q = rq->q; 567c8875190SChristoph Hellwig unsigned int max_sectors; 568badf7f64SChristoph Hellwig 569badf7f64SChristoph Hellwig if (blk_rq_is_passthrough(rq)) 570badf7f64SChristoph Hellwig return q->limits.max_hw_sectors; 571badf7f64SChristoph Hellwig 572c8875190SChristoph Hellwig max_sectors = blk_queue_get_max_sectors(q, req_op(rq)); 573badf7f64SChristoph Hellwig if (!q->limits.chunk_sectors || 574badf7f64SChristoph Hellwig req_op(rq) == REQ_OP_DISCARD || 575badf7f64SChristoph Hellwig req_op(rq) == REQ_OP_SECURE_ERASE) 576c8875190SChristoph Hellwig return max_sectors; 577c8875190SChristoph Hellwig return min(max_sectors, 578c8875190SChristoph Hellwig blk_chunk_sectors_left(offset, q->limits.chunk_sectors)); 579badf7f64SChristoph Hellwig } 580badf7f64SChristoph Hellwig 58114ccb66bSChristoph Hellwig static inline int ll_new_hw_segment(struct request *req, struct bio *bio, 58214ccb66bSChristoph Hellwig unsigned int nr_phys_segs) 583d6d48196SJens Axboe { 5846b2b0459STejun Heo if (!blk_cgroup_mergeable(req, bio)) 5856b2b0459STejun Heo goto no_merge; 5866b2b0459STejun Heo 5872705dfb2SMing Lei if (blk_integrity_merge_bio(req->q, req, bio) == false) 58813f05c8dSMartin K. Petersen goto no_merge; 58913f05c8dSMartin K. Petersen 5902705dfb2SMing Lei /* discard request merge won't add new segment */ 5912705dfb2SMing Lei if (req_op(req) == REQ_OP_DISCARD) 5922705dfb2SMing Lei return 1; 5932705dfb2SMing Lei 5942705dfb2SMing Lei if (req->nr_phys_segments + nr_phys_segs > blk_rq_get_max_segments(req)) 59513f05c8dSMartin K. Petersen goto no_merge; 596d6d48196SJens Axboe 597d6d48196SJens Axboe /* 598d6d48196SJens Axboe * This will form the start of a new hw segment. Bump both 599d6d48196SJens Axboe * counters. 600d6d48196SJens Axboe */ 601d6d48196SJens Axboe req->nr_phys_segments += nr_phys_segs; 602d6d48196SJens Axboe return 1; 60313f05c8dSMartin K. Petersen 60413f05c8dSMartin K. Petersen no_merge: 60514ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 60613f05c8dSMartin K. Petersen return 0; 607d6d48196SJens Axboe } 608d6d48196SJens Axboe 60914ccb66bSChristoph Hellwig int ll_back_merge_fn(struct request *req, struct bio *bio, unsigned int nr_segs) 610d6d48196SJens Axboe { 6115e7c4274SJens Axboe if (req_gap_back_merge(req, bio)) 6125e7c4274SJens Axboe return 0; 6137f39add3SSagi Grimberg if (blk_integrity_rq(req) && 6147f39add3SSagi Grimberg integrity_req_gap_back_merge(req, bio)) 6157f39add3SSagi Grimberg return 0; 616a892c8d5SSatya Tangirala if (!bio_crypt_ctx_back_mergeable(req, bio)) 617a892c8d5SSatya Tangirala return 0; 618f31dc1cdSMartin K. Petersen if (blk_rq_sectors(req) + bio_sectors(bio) > 61917007f39SDamien Le Moal blk_rq_get_max_sectors(req, blk_rq_pos(req))) { 62014ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 621d6d48196SJens Axboe return 0; 622d6d48196SJens Axboe } 623d6d48196SJens Axboe 62414ccb66bSChristoph Hellwig return ll_new_hw_segment(req, bio, nr_segs); 625d6d48196SJens Axboe } 626d6d48196SJens Axboe 627eda5cc99SChristoph Hellwig static int ll_front_merge_fn(struct request *req, struct bio *bio, 628eda5cc99SChristoph Hellwig unsigned int nr_segs) 629d6d48196SJens Axboe { 6305e7c4274SJens Axboe if (req_gap_front_merge(req, bio)) 6315e7c4274SJens Axboe return 0; 6327f39add3SSagi Grimberg if (blk_integrity_rq(req) && 6337f39add3SSagi Grimberg integrity_req_gap_front_merge(req, bio)) 6347f39add3SSagi Grimberg return 0; 635a892c8d5SSatya Tangirala if (!bio_crypt_ctx_front_mergeable(req, bio)) 636a892c8d5SSatya Tangirala return 0; 637f31dc1cdSMartin K. Petersen if (blk_rq_sectors(req) + bio_sectors(bio) > 63817007f39SDamien Le Moal blk_rq_get_max_sectors(req, bio->bi_iter.bi_sector)) { 63914ccb66bSChristoph Hellwig req_set_nomerge(req->q, req); 640d6d48196SJens Axboe return 0; 641d6d48196SJens Axboe } 642d6d48196SJens Axboe 64314ccb66bSChristoph Hellwig return ll_new_hw_segment(req, bio, nr_segs); 644d6d48196SJens Axboe } 645d6d48196SJens Axboe 646445251d0SJens Axboe static bool req_attempt_discard_merge(struct request_queue *q, struct request *req, 647445251d0SJens Axboe struct request *next) 648445251d0SJens Axboe { 649445251d0SJens Axboe unsigned short segments = blk_rq_nr_discard_segments(req); 650445251d0SJens Axboe 651445251d0SJens Axboe if (segments >= queue_max_discard_segments(q)) 652445251d0SJens Axboe goto no_merge; 653445251d0SJens Axboe if (blk_rq_sectors(req) + bio_sectors(next->bio) > 654445251d0SJens Axboe blk_rq_get_max_sectors(req, blk_rq_pos(req))) 655445251d0SJens Axboe goto no_merge; 656445251d0SJens Axboe 657445251d0SJens Axboe req->nr_phys_segments = segments + blk_rq_nr_discard_segments(next); 658445251d0SJens Axboe return true; 659445251d0SJens Axboe no_merge: 660445251d0SJens Axboe req_set_nomerge(q, req); 661445251d0SJens Axboe return false; 662445251d0SJens Axboe } 663445251d0SJens Axboe 664d6d48196SJens Axboe static int ll_merge_requests_fn(struct request_queue *q, struct request *req, 665d6d48196SJens Axboe struct request *next) 666d6d48196SJens Axboe { 667d6d48196SJens Axboe int total_phys_segments; 668d6d48196SJens Axboe 6695e7c4274SJens Axboe if (req_gap_back_merge(req, next->bio)) 670854fbb9cSKeith Busch return 0; 671854fbb9cSKeith Busch 672d6d48196SJens Axboe /* 673d6d48196SJens Axboe * Will it become too large? 674d6d48196SJens Axboe */ 675f31dc1cdSMartin K. Petersen if ((blk_rq_sectors(req) + blk_rq_sectors(next)) > 67617007f39SDamien Le Moal blk_rq_get_max_sectors(req, blk_rq_pos(req))) 677d6d48196SJens Axboe return 0; 678d6d48196SJens Axboe 679d6d48196SJens Axboe total_phys_segments = req->nr_phys_segments + next->nr_phys_segments; 680943b40c8SMing Lei if (total_phys_segments > blk_rq_get_max_segments(req)) 681d6d48196SJens Axboe return 0; 682d6d48196SJens Axboe 6836b2b0459STejun Heo if (!blk_cgroup_mergeable(req, next->bio)) 6846b2b0459STejun Heo return 0; 6856b2b0459STejun Heo 6864eaf99beSMartin K. Petersen if (blk_integrity_merge_rq(q, req, next) == false) 68713f05c8dSMartin K. Petersen return 0; 68813f05c8dSMartin K. Petersen 689a892c8d5SSatya Tangirala if (!bio_crypt_ctx_merge_rq(req, next)) 690a892c8d5SSatya Tangirala return 0; 691a892c8d5SSatya Tangirala 692d6d48196SJens Axboe /* Merge is OK... */ 693d6d48196SJens Axboe req->nr_phys_segments = total_phys_segments; 694d6d48196SJens Axboe return 1; 695d6d48196SJens Axboe } 696d6d48196SJens Axboe 69780a761fdSTejun Heo /** 69880a761fdSTejun Heo * blk_rq_set_mixed_merge - mark a request as mixed merge 69980a761fdSTejun Heo * @rq: request to mark as mixed merge 70080a761fdSTejun Heo * 70180a761fdSTejun Heo * Description: 70280a761fdSTejun Heo * @rq is about to be mixed merged. Make sure the attributes 70380a761fdSTejun Heo * which can be mixed are set in each bio and mark @rq as mixed 70480a761fdSTejun Heo * merged. 70580a761fdSTejun Heo */ 70680a761fdSTejun Heo void blk_rq_set_mixed_merge(struct request *rq) 70780a761fdSTejun Heo { 70880a761fdSTejun Heo unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK; 70980a761fdSTejun Heo struct bio *bio; 71080a761fdSTejun Heo 711e8064021SChristoph Hellwig if (rq->rq_flags & RQF_MIXED_MERGE) 71280a761fdSTejun Heo return; 71380a761fdSTejun Heo 71480a761fdSTejun Heo /* 71580a761fdSTejun Heo * @rq will no longer represent mixable attributes for all the 71680a761fdSTejun Heo * contained bios. It will just track those of the first one. 71780a761fdSTejun Heo * Distributes the attributs to each bio. 71880a761fdSTejun Heo */ 71980a761fdSTejun Heo for (bio = rq->bio; bio; bio = bio->bi_next) { 7201eff9d32SJens Axboe WARN_ON_ONCE((bio->bi_opf & REQ_FAILFAST_MASK) && 7211eff9d32SJens Axboe (bio->bi_opf & REQ_FAILFAST_MASK) != ff); 7221eff9d32SJens Axboe bio->bi_opf |= ff; 72380a761fdSTejun Heo } 724e8064021SChristoph Hellwig rq->rq_flags |= RQF_MIXED_MERGE; 72580a761fdSTejun Heo } 72680a761fdSTejun Heo 727b9c54f56SKonstantin Khlebnikov static void blk_account_io_merge_request(struct request *req) 72826308eabSJerome Marchand { 72926308eabSJerome Marchand if (blk_do_io_stat(req)) { 730112f158fSMike Snitzer part_stat_lock(); 731b9c54f56SKonstantin Khlebnikov part_stat_inc(req->part, merges[op_stat_group(req_op(req))]); 73226308eabSJerome Marchand part_stat_unlock(); 73326308eabSJerome Marchand } 73426308eabSJerome Marchand } 735b9c54f56SKonstantin Khlebnikov 736e96c0d83SEric Biggers static enum elv_merge blk_try_req_merge(struct request *req, 737e96c0d83SEric Biggers struct request *next) 73869840466SJianchao Wang { 73969840466SJianchao Wang if (blk_discard_mergable(req)) 74069840466SJianchao Wang return ELEVATOR_DISCARD_MERGE; 74169840466SJianchao Wang else if (blk_rq_pos(req) + blk_rq_sectors(req) == blk_rq_pos(next)) 74269840466SJianchao Wang return ELEVATOR_BACK_MERGE; 74369840466SJianchao Wang 74469840466SJianchao Wang return ELEVATOR_NO_MERGE; 74569840466SJianchao Wang } 74626308eabSJerome Marchand 747d6d48196SJens Axboe /* 748b973cb7eSJens Axboe * For non-mq, this has to be called with the request spinlock acquired. 749b973cb7eSJens Axboe * For mq with scheduling, the appropriate queue wide lock should be held. 750d6d48196SJens Axboe */ 751b973cb7eSJens Axboe static struct request *attempt_merge(struct request_queue *q, 752b973cb7eSJens Axboe struct request *req, struct request *next) 753d6d48196SJens Axboe { 754d6d48196SJens Axboe if (!rq_mergeable(req) || !rq_mergeable(next)) 755b973cb7eSJens Axboe return NULL; 756d6d48196SJens Axboe 757288dab8aSChristoph Hellwig if (req_op(req) != req_op(next)) 758b973cb7eSJens Axboe return NULL; 759f31dc1cdSMartin K. Petersen 76079bb1dbdSChristoph Hellwig if (rq_data_dir(req) != rq_data_dir(next)) 761b973cb7eSJens Axboe return NULL; 762d6d48196SJens Axboe 763668ffc03SDamien Le Moal if (req->ioprio != next->ioprio) 764668ffc03SDamien Le Moal return NULL; 765668ffc03SDamien Le Moal 766cb6934f8SJens Axboe /* 767d6d48196SJens Axboe * If we are allowed to merge, then append bio list 768d6d48196SJens Axboe * from next to rq and release next. merge_requests_fn 769d6d48196SJens Axboe * will have updated segment counts, update sector 770445251d0SJens Axboe * counts here. Handle DISCARDs separately, as they 771445251d0SJens Axboe * have separate settings. 772d6d48196SJens Axboe */ 77369840466SJianchao Wang 77469840466SJianchao Wang switch (blk_try_req_merge(req, next)) { 77569840466SJianchao Wang case ELEVATOR_DISCARD_MERGE: 776445251d0SJens Axboe if (!req_attempt_discard_merge(q, req, next)) 777445251d0SJens Axboe return NULL; 77869840466SJianchao Wang break; 77969840466SJianchao Wang case ELEVATOR_BACK_MERGE: 78069840466SJianchao Wang if (!ll_merge_requests_fn(q, req, next)) 781b973cb7eSJens Axboe return NULL; 78269840466SJianchao Wang break; 78369840466SJianchao Wang default: 78469840466SJianchao Wang return NULL; 78569840466SJianchao Wang } 786d6d48196SJens Axboe 787d6d48196SJens Axboe /* 78880a761fdSTejun Heo * If failfast settings disagree or any of the two is already 78980a761fdSTejun Heo * a mixed merge, mark both as mixed before proceeding. This 79080a761fdSTejun Heo * makes sure that all involved bios have mixable attributes 79180a761fdSTejun Heo * set properly. 79280a761fdSTejun Heo */ 793e8064021SChristoph Hellwig if (((req->rq_flags | next->rq_flags) & RQF_MIXED_MERGE) || 79480a761fdSTejun Heo (req->cmd_flags & REQ_FAILFAST_MASK) != 79580a761fdSTejun Heo (next->cmd_flags & REQ_FAILFAST_MASK)) { 79680a761fdSTejun Heo blk_rq_set_mixed_merge(req); 79780a761fdSTejun Heo blk_rq_set_mixed_merge(next); 79880a761fdSTejun Heo } 79980a761fdSTejun Heo 80080a761fdSTejun Heo /* 801522a7775SOmar Sandoval * At this point we have either done a back merge or front merge. We 802522a7775SOmar Sandoval * need the smaller start_time_ns of the merged requests to be the 803522a7775SOmar Sandoval * current request for accounting purposes. 804d6d48196SJens Axboe */ 805522a7775SOmar Sandoval if (next->start_time_ns < req->start_time_ns) 806522a7775SOmar Sandoval req->start_time_ns = next->start_time_ns; 807d6d48196SJens Axboe 808d6d48196SJens Axboe req->biotail->bi_next = next->bio; 809d6d48196SJens Axboe req->biotail = next->biotail; 810d6d48196SJens Axboe 811a2dec7b3STejun Heo req->__data_len += blk_rq_bytes(next); 812d6d48196SJens Axboe 8132a5cf35cSMing Lei if (!blk_discard_mergable(req)) 814d6d48196SJens Axboe elv_merge_requests(q, req, next); 815d6d48196SJens Axboe 81642dad764SJerome Marchand /* 81742dad764SJerome Marchand * 'next' is going away, so update stats accordingly 81842dad764SJerome Marchand */ 819b9c54f56SKonstantin Khlebnikov blk_account_io_merge_request(next); 820d6d48196SJens Axboe 821a54895faSChristoph Hellwig trace_block_rq_merge(next); 822f3bdc62fSJan Kara 823e4d750c9SJens Axboe /* 824e4d750c9SJens Axboe * ownership of bio passed from next to req, return 'next' for 825e4d750c9SJens Axboe * the caller to free 826e4d750c9SJens Axboe */ 8271cd96c24SBoaz Harrosh next->bio = NULL; 828b973cb7eSJens Axboe return next; 829d6d48196SJens Axboe } 830d6d48196SJens Axboe 831eda5cc99SChristoph Hellwig static struct request *attempt_back_merge(struct request_queue *q, 832eda5cc99SChristoph Hellwig struct request *rq) 833d6d48196SJens Axboe { 834d6d48196SJens Axboe struct request *next = elv_latter_request(q, rq); 835d6d48196SJens Axboe 836d6d48196SJens Axboe if (next) 837d6d48196SJens Axboe return attempt_merge(q, rq, next); 838d6d48196SJens Axboe 839b973cb7eSJens Axboe return NULL; 840d6d48196SJens Axboe } 841d6d48196SJens Axboe 842eda5cc99SChristoph Hellwig static struct request *attempt_front_merge(struct request_queue *q, 843eda5cc99SChristoph Hellwig struct request *rq) 844d6d48196SJens Axboe { 845d6d48196SJens Axboe struct request *prev = elv_former_request(q, rq); 846d6d48196SJens Axboe 847d6d48196SJens Axboe if (prev) 848d6d48196SJens Axboe return attempt_merge(q, prev, rq); 849d6d48196SJens Axboe 850b973cb7eSJens Axboe return NULL; 851d6d48196SJens Axboe } 8525e84ea3aSJens Axboe 853fd2ef39cSJan Kara /* 854fd2ef39cSJan Kara * Try to merge 'next' into 'rq'. Return true if the merge happened, false 855fd2ef39cSJan Kara * otherwise. The caller is responsible for freeing 'next' if the merge 856fd2ef39cSJan Kara * happened. 857fd2ef39cSJan Kara */ 858fd2ef39cSJan Kara bool blk_attempt_req_merge(struct request_queue *q, struct request *rq, 8595e84ea3aSJens Axboe struct request *next) 8605e84ea3aSJens Axboe { 861fd2ef39cSJan Kara return attempt_merge(q, rq, next); 8625e84ea3aSJens Axboe } 863050c8ea8STejun Heo 864050c8ea8STejun Heo bool blk_rq_merge_ok(struct request *rq, struct bio *bio) 865050c8ea8STejun Heo { 866e2a60da7SMartin K. Petersen if (!rq_mergeable(rq) || !bio_mergeable(bio)) 867050c8ea8STejun Heo return false; 868050c8ea8STejun Heo 869288dab8aSChristoph Hellwig if (req_op(rq) != bio_op(bio)) 870f31dc1cdSMartin K. Petersen return false; 871f31dc1cdSMartin K. Petersen 872050c8ea8STejun Heo /* different data direction or already started, don't merge */ 873050c8ea8STejun Heo if (bio_data_dir(bio) != rq_data_dir(rq)) 874050c8ea8STejun Heo return false; 875050c8ea8STejun Heo 8766b2b0459STejun Heo /* don't merge across cgroup boundaries */ 8776b2b0459STejun Heo if (!blk_cgroup_mergeable(rq, bio)) 8786b2b0459STejun Heo return false; 8796b2b0459STejun Heo 880050c8ea8STejun Heo /* only merge integrity protected bio into ditto rq */ 8814eaf99beSMartin K. Petersen if (blk_integrity_merge_bio(rq->q, rq, bio) == false) 882050c8ea8STejun Heo return false; 883050c8ea8STejun Heo 884a892c8d5SSatya Tangirala /* Only merge if the crypt contexts are compatible */ 885a892c8d5SSatya Tangirala if (!bio_crypt_rq_ctx_compatible(rq, bio)) 886a892c8d5SSatya Tangirala return false; 887a892c8d5SSatya Tangirala 888668ffc03SDamien Le Moal if (rq->ioprio != bio_prio(bio)) 889668ffc03SDamien Le Moal return false; 890668ffc03SDamien Le Moal 891050c8ea8STejun Heo return true; 892050c8ea8STejun Heo } 893050c8ea8STejun Heo 89434fe7c05SChristoph Hellwig enum elv_merge blk_try_merge(struct request *rq, struct bio *bio) 895050c8ea8STejun Heo { 89669840466SJianchao Wang if (blk_discard_mergable(rq)) 8971e739730SChristoph Hellwig return ELEVATOR_DISCARD_MERGE; 8981e739730SChristoph Hellwig else if (blk_rq_pos(rq) + blk_rq_sectors(rq) == bio->bi_iter.bi_sector) 899050c8ea8STejun Heo return ELEVATOR_BACK_MERGE; 9004f024f37SKent Overstreet else if (blk_rq_pos(rq) - bio_sectors(bio) == bio->bi_iter.bi_sector) 901050c8ea8STejun Heo return ELEVATOR_FRONT_MERGE; 902050c8ea8STejun Heo return ELEVATOR_NO_MERGE; 903050c8ea8STejun Heo } 9048e756373SBaolin Wang 9058e756373SBaolin Wang static void blk_account_io_merge_bio(struct request *req) 9068e756373SBaolin Wang { 9078e756373SBaolin Wang if (!blk_do_io_stat(req)) 9088e756373SBaolin Wang return; 9098e756373SBaolin Wang 9108e756373SBaolin Wang part_stat_lock(); 9118e756373SBaolin Wang part_stat_inc(req->part, merges[op_stat_group(req_op(req))]); 9128e756373SBaolin Wang part_stat_unlock(); 9138e756373SBaolin Wang } 9148e756373SBaolin Wang 915eda5cc99SChristoph Hellwig enum bio_merge_status { 916eda5cc99SChristoph Hellwig BIO_MERGE_OK, 917eda5cc99SChristoph Hellwig BIO_MERGE_NONE, 918eda5cc99SChristoph Hellwig BIO_MERGE_FAILED, 919eda5cc99SChristoph Hellwig }; 920eda5cc99SChristoph Hellwig 921eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_back_merge(struct request *req, 922eda5cc99SChristoph Hellwig struct bio *bio, unsigned int nr_segs) 9238e756373SBaolin Wang { 9248e756373SBaolin Wang const int ff = bio->bi_opf & REQ_FAILFAST_MASK; 9258e756373SBaolin Wang 9268e756373SBaolin Wang if (!ll_back_merge_fn(req, bio, nr_segs)) 9277d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 9288e756373SBaolin Wang 929e8a676d6SChristoph Hellwig trace_block_bio_backmerge(bio); 9308e756373SBaolin Wang rq_qos_merge(req->q, req, bio); 9318e756373SBaolin Wang 9328e756373SBaolin Wang if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) 9338e756373SBaolin Wang blk_rq_set_mixed_merge(req); 9348e756373SBaolin Wang 9358e756373SBaolin Wang req->biotail->bi_next = bio; 9368e756373SBaolin Wang req->biotail = bio; 9378e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 9388e756373SBaolin Wang 9398e756373SBaolin Wang bio_crypt_free_ctx(bio); 9408e756373SBaolin Wang 9418e756373SBaolin Wang blk_account_io_merge_bio(req); 9427d7ca7c5SBaolin Wang return BIO_MERGE_OK; 9438e756373SBaolin Wang } 9448e756373SBaolin Wang 945eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_front_merge(struct request *req, 946eda5cc99SChristoph Hellwig struct bio *bio, unsigned int nr_segs) 9478e756373SBaolin Wang { 9488e756373SBaolin Wang const int ff = bio->bi_opf & REQ_FAILFAST_MASK; 9498e756373SBaolin Wang 9508e756373SBaolin Wang if (!ll_front_merge_fn(req, bio, nr_segs)) 9517d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 9528e756373SBaolin Wang 953e8a676d6SChristoph Hellwig trace_block_bio_frontmerge(bio); 9548e756373SBaolin Wang rq_qos_merge(req->q, req, bio); 9558e756373SBaolin Wang 9568e756373SBaolin Wang if ((req->cmd_flags & REQ_FAILFAST_MASK) != ff) 9578e756373SBaolin Wang blk_rq_set_mixed_merge(req); 9588e756373SBaolin Wang 9598e756373SBaolin Wang bio->bi_next = req->bio; 9608e756373SBaolin Wang req->bio = bio; 9618e756373SBaolin Wang 9628e756373SBaolin Wang req->__sector = bio->bi_iter.bi_sector; 9638e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 9648e756373SBaolin Wang 9658e756373SBaolin Wang bio_crypt_do_front_merge(req, bio); 9668e756373SBaolin Wang 9678e756373SBaolin Wang blk_account_io_merge_bio(req); 9687d7ca7c5SBaolin Wang return BIO_MERGE_OK; 9698e756373SBaolin Wang } 9708e756373SBaolin Wang 971eda5cc99SChristoph Hellwig static enum bio_merge_status bio_attempt_discard_merge(struct request_queue *q, 972eda5cc99SChristoph Hellwig struct request *req, struct bio *bio) 9738e756373SBaolin Wang { 9748e756373SBaolin Wang unsigned short segments = blk_rq_nr_discard_segments(req); 9758e756373SBaolin Wang 9768e756373SBaolin Wang if (segments >= queue_max_discard_segments(q)) 9778e756373SBaolin Wang goto no_merge; 9788e756373SBaolin Wang if (blk_rq_sectors(req) + bio_sectors(bio) > 9798e756373SBaolin Wang blk_rq_get_max_sectors(req, blk_rq_pos(req))) 9808e756373SBaolin Wang goto no_merge; 9818e756373SBaolin Wang 9828e756373SBaolin Wang rq_qos_merge(q, req, bio); 9838e756373SBaolin Wang 9848e756373SBaolin Wang req->biotail->bi_next = bio; 9858e756373SBaolin Wang req->biotail = bio; 9868e756373SBaolin Wang req->__data_len += bio->bi_iter.bi_size; 9878e756373SBaolin Wang req->nr_phys_segments = segments + 1; 9888e756373SBaolin Wang 9898e756373SBaolin Wang blk_account_io_merge_bio(req); 9907d7ca7c5SBaolin Wang return BIO_MERGE_OK; 9918e756373SBaolin Wang no_merge: 9928e756373SBaolin Wang req_set_nomerge(q, req); 9937d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 9947d7ca7c5SBaolin Wang } 9957d7ca7c5SBaolin Wang 9967d7ca7c5SBaolin Wang static enum bio_merge_status blk_attempt_bio_merge(struct request_queue *q, 9977d7ca7c5SBaolin Wang struct request *rq, 9987d7ca7c5SBaolin Wang struct bio *bio, 9997d7ca7c5SBaolin Wang unsigned int nr_segs, 10007d7ca7c5SBaolin Wang bool sched_allow_merge) 10017d7ca7c5SBaolin Wang { 10027d7ca7c5SBaolin Wang if (!blk_rq_merge_ok(rq, bio)) 10037d7ca7c5SBaolin Wang return BIO_MERGE_NONE; 10047d7ca7c5SBaolin Wang 10057d7ca7c5SBaolin Wang switch (blk_try_merge(rq, bio)) { 10067d7ca7c5SBaolin Wang case ELEVATOR_BACK_MERGE: 1007265600b7SBaolin Wang if (!sched_allow_merge || blk_mq_sched_allow_merge(q, rq, bio)) 10087d7ca7c5SBaolin Wang return bio_attempt_back_merge(rq, bio, nr_segs); 10097d7ca7c5SBaolin Wang break; 10107d7ca7c5SBaolin Wang case ELEVATOR_FRONT_MERGE: 1011265600b7SBaolin Wang if (!sched_allow_merge || blk_mq_sched_allow_merge(q, rq, bio)) 10127d7ca7c5SBaolin Wang return bio_attempt_front_merge(rq, bio, nr_segs); 10137d7ca7c5SBaolin Wang break; 10147d7ca7c5SBaolin Wang case ELEVATOR_DISCARD_MERGE: 10157d7ca7c5SBaolin Wang return bio_attempt_discard_merge(q, rq, bio); 10167d7ca7c5SBaolin Wang default: 10177d7ca7c5SBaolin Wang return BIO_MERGE_NONE; 10187d7ca7c5SBaolin Wang } 10197d7ca7c5SBaolin Wang 10207d7ca7c5SBaolin Wang return BIO_MERGE_FAILED; 10218e756373SBaolin Wang } 10228e756373SBaolin Wang 10238e756373SBaolin Wang /** 10248e756373SBaolin Wang * blk_attempt_plug_merge - try to merge with %current's plugged list 10258e756373SBaolin Wang * @q: request_queue new bio is being queued at 10268e756373SBaolin Wang * @bio: new bio being queued 10278e756373SBaolin Wang * @nr_segs: number of segments in @bio 102887c037d1SJens Axboe * from the passed in @q already in the plug list 10298e756373SBaolin Wang * 1030d38a9c04SJens Axboe * Determine whether @bio being queued on @q can be merged with the previous 1031d38a9c04SJens Axboe * request on %current's plugged list. Returns %true if merge was successful, 10328e756373SBaolin Wang * otherwise %false. 10338e756373SBaolin Wang * 10348e756373SBaolin Wang * Plugging coalesces IOs from the same issuer for the same purpose without 10358e756373SBaolin Wang * going through @q->queue_lock. As such it's more of an issuing mechanism 10368e756373SBaolin Wang * than scheduling, and the request, while may have elvpriv data, is not 10378e756373SBaolin Wang * added on the elevator at this point. In addition, we don't have 10388e756373SBaolin Wang * reliable access to the elevator outside queue lock. Only check basic 10398e756373SBaolin Wang * merging parameters without querying the elevator. 10408e756373SBaolin Wang * 10418e756373SBaolin Wang * Caller must ensure !blk_queue_nomerges(q) beforehand. 10428e756373SBaolin Wang */ 10438e756373SBaolin Wang bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio, 10440c5bcc92SChristoph Hellwig unsigned int nr_segs) 10458e756373SBaolin Wang { 10468e756373SBaolin Wang struct blk_plug *plug; 10478e756373SBaolin Wang struct request *rq; 10488e756373SBaolin Wang 10498e756373SBaolin Wang plug = blk_mq_plug(q, bio); 1050bc490f81SJens Axboe if (!plug || rq_list_empty(plug->mq_list)) 10518e756373SBaolin Wang return false; 10528e756373SBaolin Wang 10535b205071SJens Axboe rq_list_for_each(&plug->mq_list, rq) { 105487c037d1SJens Axboe if (rq->q == q) { 1055a1cb6537SMing Lei if (blk_attempt_bio_merge(q, rq, bio, nr_segs, false) == 1056a1cb6537SMing Lei BIO_MERGE_OK) 10578e756373SBaolin Wang return true; 10585b205071SJens Axboe break; 10595b205071SJens Axboe } 10605b205071SJens Axboe 10615b205071SJens Axboe /* 10625b205071SJens Axboe * Only keep iterating plug list for merges if we have multiple 10635b205071SJens Axboe * queues 10645b205071SJens Axboe */ 10655b205071SJens Axboe if (!plug->multiple_queues) 10665b205071SJens Axboe break; 1067a1cb6537SMing Lei } 10688e756373SBaolin Wang return false; 10698e756373SBaolin Wang } 1070bdc6a287SBaolin Wang 1071bdc6a287SBaolin Wang /* 1072bdc6a287SBaolin Wang * Iterate list of requests and see if we can merge this bio with any 1073bdc6a287SBaolin Wang * of them. 1074bdc6a287SBaolin Wang */ 1075bdc6a287SBaolin Wang bool blk_bio_list_merge(struct request_queue *q, struct list_head *list, 1076bdc6a287SBaolin Wang struct bio *bio, unsigned int nr_segs) 1077bdc6a287SBaolin Wang { 1078bdc6a287SBaolin Wang struct request *rq; 1079bdc6a287SBaolin Wang int checked = 8; 1080bdc6a287SBaolin Wang 1081bdc6a287SBaolin Wang list_for_each_entry_reverse(rq, list, queuelist) { 1082bdc6a287SBaolin Wang if (!checked--) 1083bdc6a287SBaolin Wang break; 1084bdc6a287SBaolin Wang 10857d7ca7c5SBaolin Wang switch (blk_attempt_bio_merge(q, rq, bio, nr_segs, true)) { 10867d7ca7c5SBaolin Wang case BIO_MERGE_NONE: 1087bdc6a287SBaolin Wang continue; 10887d7ca7c5SBaolin Wang case BIO_MERGE_OK: 10897d7ca7c5SBaolin Wang return true; 10907d7ca7c5SBaolin Wang case BIO_MERGE_FAILED: 10917d7ca7c5SBaolin Wang return false; 1092bdc6a287SBaolin Wang } 1093bdc6a287SBaolin Wang 1094bdc6a287SBaolin Wang } 1095bdc6a287SBaolin Wang 1096bdc6a287SBaolin Wang return false; 1097bdc6a287SBaolin Wang } 1098bdc6a287SBaolin Wang EXPORT_SYMBOL_GPL(blk_bio_list_merge); 1099eda5cc99SChristoph Hellwig 1100eda5cc99SChristoph Hellwig bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio, 1101eda5cc99SChristoph Hellwig unsigned int nr_segs, struct request **merged_request) 1102eda5cc99SChristoph Hellwig { 1103eda5cc99SChristoph Hellwig struct request *rq; 1104eda5cc99SChristoph Hellwig 1105eda5cc99SChristoph Hellwig switch (elv_merge(q, &rq, bio)) { 1106eda5cc99SChristoph Hellwig case ELEVATOR_BACK_MERGE: 1107eda5cc99SChristoph Hellwig if (!blk_mq_sched_allow_merge(q, rq, bio)) 1108eda5cc99SChristoph Hellwig return false; 1109eda5cc99SChristoph Hellwig if (bio_attempt_back_merge(rq, bio, nr_segs) != BIO_MERGE_OK) 1110eda5cc99SChristoph Hellwig return false; 1111eda5cc99SChristoph Hellwig *merged_request = attempt_back_merge(q, rq); 1112eda5cc99SChristoph Hellwig if (!*merged_request) 1113eda5cc99SChristoph Hellwig elv_merged_request(q, rq, ELEVATOR_BACK_MERGE); 1114eda5cc99SChristoph Hellwig return true; 1115eda5cc99SChristoph Hellwig case ELEVATOR_FRONT_MERGE: 1116eda5cc99SChristoph Hellwig if (!blk_mq_sched_allow_merge(q, rq, bio)) 1117eda5cc99SChristoph Hellwig return false; 1118eda5cc99SChristoph Hellwig if (bio_attempt_front_merge(rq, bio, nr_segs) != BIO_MERGE_OK) 1119eda5cc99SChristoph Hellwig return false; 1120eda5cc99SChristoph Hellwig *merged_request = attempt_front_merge(q, rq); 1121eda5cc99SChristoph Hellwig if (!*merged_request) 1122eda5cc99SChristoph Hellwig elv_merged_request(q, rq, ELEVATOR_FRONT_MERGE); 1123eda5cc99SChristoph Hellwig return true; 1124eda5cc99SChristoph Hellwig case ELEVATOR_DISCARD_MERGE: 1125eda5cc99SChristoph Hellwig return bio_attempt_discard_merge(q, rq, bio) == BIO_MERGE_OK; 1126eda5cc99SChristoph Hellwig default: 1127eda5cc99SChristoph Hellwig return false; 1128eda5cc99SChristoph Hellwig } 1129eda5cc99SChristoph Hellwig } 1130eda5cc99SChristoph Hellwig EXPORT_SYMBOL_GPL(blk_mq_sched_try_merge); 1131