blk-merge.c 17.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11
/*
 * Functions related to segment and merge handling
 */
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/bio.h>
#include <linux/blkdev.h>
#include <linux/scatterlist.h>

#include "blk.h"

12 13
static struct bio *blk_bio_discard_split(struct request_queue *q,
					 struct bio *bio,
14 15
					 struct bio_set *bs,
					 unsigned *nsegs)
16 17 18 19 20 21
{
	unsigned int max_discard_sectors, granularity;
	int alignment;
	sector_t tmp;
	unsigned split_sectors;

22 23
	*nsegs = 1;

24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56
	/* Zero-sector (unknown) and one-sector granularities are the same.  */
	granularity = max(q->limits.discard_granularity >> 9, 1U);

	max_discard_sectors = min(q->limits.max_discard_sectors, UINT_MAX >> 9);
	max_discard_sectors -= max_discard_sectors % granularity;

	if (unlikely(!max_discard_sectors)) {
		/* XXX: warn */
		return NULL;
	}

	if (bio_sectors(bio) <= max_discard_sectors)
		return NULL;

	split_sectors = max_discard_sectors;

	/*
	 * If the next starting sector would be misaligned, stop the discard at
	 * the previous aligned sector.
	 */
	alignment = (q->limits.discard_alignment >> 9) % granularity;

	tmp = bio->bi_iter.bi_sector + split_sectors - alignment;
	tmp = sector_div(tmp, granularity);

	if (split_sectors > tmp)
		split_sectors -= tmp;

	return bio_split(bio, split_sectors, GFP_NOIO, bs);
}

static struct bio *blk_bio_write_same_split(struct request_queue *q,
					    struct bio *bio,
57 58
					    struct bio_set *bs,
					    unsigned *nsegs)
59
{
60 61
	*nsegs = 1;

62 63 64 65 66 67 68 69 70 71 72
	if (!q->limits.max_write_same_sectors)
		return NULL;

	if (bio_sectors(bio) <= q->limits.max_write_same_sectors)
		return NULL;

	return bio_split(bio, q->limits.max_write_same_sectors, GFP_NOIO, bs);
}

static struct bio *blk_bio_segment_split(struct request_queue *q,
					 struct bio *bio,
73 74
					 struct bio_set *bs,
					 unsigned *segs)
75
{
76
	struct bio_vec bv, bvprv, *bvprvp = NULL;
77
	struct bvec_iter iter;
78
	unsigned seg_size = 0, nsegs = 0, sectors = 0;
79 80

	bio_for_each_segment(bv, bio, iter) {
81
		if (sectors + (bv.bv_len >> 9) > queue_max_sectors(q))
82 83 84 85 86 87
			goto split;

		/*
		 * If the queue doesn't support SG gaps and adding this
		 * offset would create a gap, disallow it.
		 */
88
		if (bvprvp && bvec_gap_to_prev(q, bvprvp, bv.bv_offset))
89 90
			goto split;

91
		if (bvprvp && blk_queue_cluster(q)) {
92 93
			if (seg_size + bv.bv_len > queue_max_segment_size(q))
				goto new_segment;
94
			if (!BIOVEC_PHYS_MERGEABLE(bvprvp, &bv))
95
				goto new_segment;
96
			if (!BIOVEC_SEG_BOUNDARY(q, bvprvp, &bv))
97 98 99 100
				goto new_segment;

			seg_size += bv.bv_len;
			bvprv = bv;
101
			bvprvp = &bv;
102
			sectors += bv.bv_len >> 9;
103 104 105 106 107 108 109 110
			continue;
		}
new_segment:
		if (nsegs == queue_max_segments(q))
			goto split;

		nsegs++;
		bvprv = bv;
111
		bvprvp = &bv;
112
		seg_size = bv.bv_len;
113
		sectors += bv.bv_len >> 9;
114 115
	}

116
	*segs = nsegs;
117 118
	return NULL;
split:
119
	*segs = nsegs;
120
	return bio_split(bio, sectors, GFP_NOIO, bs);
121 122 123 124 125
}

void blk_queue_split(struct request_queue *q, struct bio **bio,
		     struct bio_set *bs)
{
126 127
	struct bio *split, *res;
	unsigned nsegs;
128 129

	if ((*bio)->bi_rw & REQ_DISCARD)
130
		split = blk_bio_discard_split(q, *bio, bs, &nsegs);
131
	else if ((*bio)->bi_rw & REQ_WRITE_SAME)
132
		split = blk_bio_write_same_split(q, *bio, bs, &nsegs);
133
	else
134 135 136 137 138 139
		split = blk_bio_segment_split(q, *bio, q->bio_split, &nsegs);

	/* physical segments can be figured out during splitting */
	res = split ? split : *bio;
	res->bi_phys_segments = nsegs;
	bio_set_flag(res, BIO_SEG_VALID);
140 141 142 143 144 145 146 147 148

	if (split) {
		bio_chain(split, *bio);
		generic_make_request(*bio);
		*bio = split;
	}
}
EXPORT_SYMBOL(blk_queue_split);

149
static unsigned int __blk_recalc_rq_segments(struct request_queue *q,
150 151
					     struct bio *bio,
					     bool no_sg_merge)
152
{
153
	struct bio_vec bv, bvprv = { NULL };
154
	int cluster, prev = 0;
155
	unsigned int seg_size, nr_phys_segs;
156
	struct bio *fbio, *bbio;
157
	struct bvec_iter iter;
158

159 160
	if (!bio)
		return 0;
161

162 163 164 165 166 167 168 169 170 171
	/*
	 * This should probably be returning 0, but blk_add_request_payload()
	 * (Christoph!!!!)
	 */
	if (bio->bi_rw & REQ_DISCARD)
		return 1;

	if (bio->bi_rw & REQ_WRITE_SAME)
		return 1;

172
	fbio = bio;
173
	cluster = blk_queue_cluster(q);
Mikulas Patocka's avatar
Mikulas Patocka committed
174
	seg_size = 0;
175
	nr_phys_segs = 0;
176
	for_each_bio(bio) {
177
		bio_for_each_segment(bv, bio, iter) {
178 179 180 181 182 183 184
			/*
			 * If SG merging is disabled, each bio vector is
			 * a segment
			 */
			if (no_sg_merge)
				goto new_segment;

185
			if (prev && cluster) {
186
				if (seg_size + bv.bv_len
187
				    > queue_max_segment_size(q))
188
					goto new_segment;
189
				if (!BIOVEC_PHYS_MERGEABLE(&bvprv, &bv))
190
					goto new_segment;
191
				if (!BIOVEC_SEG_BOUNDARY(q, &bvprv, &bv))
192
					goto new_segment;
193

194
				seg_size += bv.bv_len;
195 196 197
				bvprv = bv;
				continue;
			}
198
new_segment:
199 200 201
			if (nr_phys_segs == 1 && seg_size >
			    fbio->bi_seg_front_size)
				fbio->bi_seg_front_size = seg_size;
202

203 204
			nr_phys_segs++;
			bvprv = bv;
205
			prev = 1;
206
			seg_size = bv.bv_len;
207
		}
208
		bbio = bio;
209 210
	}

211 212 213 214
	if (nr_phys_segs == 1 && seg_size > fbio->bi_seg_front_size)
		fbio->bi_seg_front_size = seg_size;
	if (seg_size > bbio->bi_seg_back_size)
		bbio->bi_seg_back_size = seg_size;
215 216 217 218 219 220

	return nr_phys_segs;
}

void blk_recalc_rq_segments(struct request *rq)
{
221 222 223 224 225
	bool no_sg_merge = !!test_bit(QUEUE_FLAG_NO_SG_MERGE,
			&rq->q->queue_flags);

	rq->nr_phys_segments = __blk_recalc_rq_segments(rq->q, rq->bio,
			no_sg_merge);
226 227 228 229
}

void blk_recount_segments(struct request_queue *q, struct bio *bio)
{
230 231 232 233 234 235 236
	unsigned short seg_cnt;

	/* estimate segment number by bi_vcnt for non-cloned bio */
	if (bio_flagged(bio, BIO_CLONED))
		seg_cnt = bio_segments(bio);
	else
		seg_cnt = bio->bi_vcnt;
237

238 239 240
	if (test_bit(QUEUE_FLAG_NO_SG_MERGE, &q->queue_flags) &&
			(seg_cnt < queue_max_segments(q)))
		bio->bi_phys_segments = seg_cnt;
241 242 243 244
	else {
		struct bio *nxt = bio->bi_next;

		bio->bi_next = NULL;
245
		bio->bi_phys_segments = __blk_recalc_rq_segments(q, bio, false);
246 247
		bio->bi_next = nxt;
	}
248

249
	bio_set_flag(bio, BIO_SEG_VALID);
250 251 252 253 254 255
}
EXPORT_SYMBOL(blk_recount_segments);

static int blk_phys_contig_segment(struct request_queue *q, struct bio *bio,
				   struct bio *nxt)
{
256
	struct bio_vec end_bv = { NULL }, nxt_bv;
257 258
	struct bvec_iter iter;

259
	if (!blk_queue_cluster(q))
260 261
		return 0;

262
	if (bio->bi_seg_back_size + nxt->bi_seg_front_size >
263
	    queue_max_segment_size(q))
264 265
		return 0;

266 267 268
	if (!bio_has_data(bio))
		return 1;

269 270 271 272 273 274 275
	bio_for_each_segment(end_bv, bio, iter)
		if (end_bv.bv_len == iter.bi_size)
			break;

	nxt_bv = bio_iovec(nxt);

	if (!BIOVEC_PHYS_MERGEABLE(&end_bv, &nxt_bv))
276 277
		return 0;

278
	/*
279
	 * bio and nxt are contiguous in memory; check if the queue allows
280 281
	 * these two to be merged into one
	 */
282
	if (BIOVEC_SEG_BOUNDARY(q, &end_bv, &nxt_bv))
283 284 285 286 287
		return 1;

	return 0;
}

288
static inline void
289
__blk_segment_map_sg(struct request_queue *q, struct bio_vec *bvec,
290
		     struct scatterlist *sglist, struct bio_vec *bvprv,
291 292 293 294 295
		     struct scatterlist **sg, int *nsegs, int *cluster)
{

	int nbytes = bvec->bv_len;

296
	if (*sg && *cluster) {
297 298 299
		if ((*sg)->length + nbytes > queue_max_segment_size(q))
			goto new_segment;

300
		if (!BIOVEC_PHYS_MERGEABLE(bvprv, bvec))
301
			goto new_segment;
302
		if (!BIOVEC_SEG_BOUNDARY(q, bvprv, bvec))
303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320
			goto new_segment;

		(*sg)->length += nbytes;
	} else {
new_segment:
		if (!*sg)
			*sg = sglist;
		else {
			/*
			 * If the driver previously mapped a shorter
			 * list, we could see a termination bit
			 * prematurely unless it fully inits the sg
			 * table on each mapping. We KNOW that there
			 * must be more entries here or the driver
			 * would be buggy, so force clear the
			 * termination bit to avoid doing a full
			 * sg_init_table() in drivers for each command.
			 */
321
			sg_unmark_end(*sg);
322 323 324 325 326 327
			*sg = sg_next(*sg);
		}

		sg_set_page(*sg, bvec->bv_page, nbytes, bvec->bv_offset);
		(*nsegs)++;
	}
328
	*bvprv = *bvec;
329 330
}

331 332 333
static int __blk_bios_map_sg(struct request_queue *q, struct bio *bio,
			     struct scatterlist *sglist,
			     struct scatterlist **sg)
334
{
335
	struct bio_vec bvec, bvprv = { NULL };
336
	struct bvec_iter iter;
337 338 339
	int nsegs, cluster;

	nsegs = 0;
340
	cluster = blk_queue_cluster(q);
341

342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368
	if (bio->bi_rw & REQ_DISCARD) {
		/*
		 * This is a hack - drivers should be neither modifying the
		 * biovec, nor relying on bi_vcnt - but because of
		 * blk_add_request_payload(), a discard bio may or may not have
		 * a payload we need to set up here (thank you Christoph) and
		 * bi_vcnt is really the only way of telling if we need to.
		 */

		if (bio->bi_vcnt)
			goto single_segment;

		return 0;
	}

	if (bio->bi_rw & REQ_WRITE_SAME) {
single_segment:
		*sg = sglist;
		bvec = bio_iovec(bio);
		sg_set_page(*sg, bvec.bv_page, bvec.bv_len, bvec.bv_offset);
		return 1;
	}

	for_each_bio(bio)
		bio_for_each_segment(bvec, bio, iter)
			__blk_segment_map_sg(q, &bvec, sglist, &bvprv, sg,
					     &nsegs, &cluster);
369

370 371 372 373 374 375 376 377 378 379 380 381 382 383 384
	return nsegs;
}

/*
 * map a request to scatterlist, return number of sg entries setup. Caller
 * must make sure sg can hold rq->nr_phys_segments entries
 */
int blk_rq_map_sg(struct request_queue *q, struct request *rq,
		  struct scatterlist *sglist)
{
	struct scatterlist *sg = NULL;
	int nsegs = 0;

	if (rq->bio)
		nsegs = __blk_bios_map_sg(q, rq->bio, sglist, &sg);
385 386

	if (unlikely(rq->cmd_flags & REQ_COPY_USER) &&
387 388 389
	    (blk_rq_bytes(rq) & q->dma_pad_mask)) {
		unsigned int pad_len =
			(q->dma_pad_mask & ~blk_rq_bytes(rq)) + 1;
390 391 392 393 394

		sg->length += pad_len;
		rq->extra_len += pad_len;
	}

395
	if (q->dma_drain_size && q->dma_drain_needed(rq)) {
396
		if (rq->cmd_flags & REQ_WRITE)
397 398
			memset(q->dma_drain_buffer, 0, q->dma_drain_size);

399
		sg_unmark_end(sg);
400 401 402 403 404 405
		sg = sg_next(sg);
		sg_set_page(sg, virt_to_page(q->dma_drain_buffer),
			    q->dma_drain_size,
			    ((unsigned long)q->dma_drain_buffer) &
			    (PAGE_SIZE - 1));
		nsegs++;
406
		rq->extra_len += q->dma_drain_size;
407 408 409 410 411 412 413 414 415 416 417 418 419 420 421
	}

	if (sg)
		sg_mark_end(sg);

	return nsegs;
}
EXPORT_SYMBOL(blk_rq_map_sg);

static inline int ll_new_hw_segment(struct request_queue *q,
				    struct request *req,
				    struct bio *bio)
{
	int nr_phys_segs = bio_phys_segments(q, bio);

422 423 424
	if (req->nr_phys_segments + nr_phys_segs > queue_max_segments(q))
		goto no_merge;

425
	if (blk_integrity_merge_bio(q, req, bio) == false)
426
		goto no_merge;
427 428 429 430 431 432 433

	/*
	 * This will form the start of a new hw segment.  Bump both
	 * counters.
	 */
	req->nr_phys_segments += nr_phys_segs;
	return 1;
434 435 436 437 438 439

no_merge:
	req->cmd_flags |= REQ_NOMERGE;
	if (req == q->last_merge)
		q->last_merge = NULL;
	return 0;
440 441 442 443 444
}

int ll_back_merge_fn(struct request_queue *q, struct request *req,
		     struct bio *bio)
{
445 446
	if (req_gap_back_merge(req, bio))
		return 0;
447 448 449
	if (blk_integrity_rq(req) &&
	    integrity_req_gap_back_merge(req, bio))
		return 0;
450 451
	if (blk_rq_sectors(req) + bio_sectors(bio) >
	    blk_rq_get_max_sectors(req)) {
452 453 454 455 456
		req->cmd_flags |= REQ_NOMERGE;
		if (req == q->last_merge)
			q->last_merge = NULL;
		return 0;
	}
457
	if (!bio_flagged(req->biotail, BIO_SEG_VALID))
458
		blk_recount_segments(q, req->biotail);
459
	if (!bio_flagged(bio, BIO_SEG_VALID))
460 461 462 463 464
		blk_recount_segments(q, bio);

	return ll_new_hw_segment(q, req, bio);
}

465
int ll_front_merge_fn(struct request_queue *q, struct request *req,
466 467
		      struct bio *bio)
{
468 469 470

	if (req_gap_front_merge(req, bio))
		return 0;
471 472 473
	if (blk_integrity_rq(req) &&
	    integrity_req_gap_front_merge(req, bio))
		return 0;
474 475
	if (blk_rq_sectors(req) + bio_sectors(bio) >
	    blk_rq_get_max_sectors(req)) {
476 477 478 479 480
		req->cmd_flags |= REQ_NOMERGE;
		if (req == q->last_merge)
			q->last_merge = NULL;
		return 0;
	}
481
	if (!bio_flagged(bio, BIO_SEG_VALID))
482
		blk_recount_segments(q, bio);
483
	if (!bio_flagged(req->bio, BIO_SEG_VALID))
484 485 486 487 488
		blk_recount_segments(q, req->bio);

	return ll_new_hw_segment(q, req, bio);
}

489 490 491 492 493 494 495 496 497 498 499
/*
 * blk-mq uses req->special to carry normal driver per-request payload, it
 * does not indicate a prepared command that we cannot merge with.
 */
static bool req_no_special_merge(struct request *req)
{
	struct request_queue *q = req->q;

	return !q->mq_ops && req->special;
}

500 501 502 503
static int ll_merge_requests_fn(struct request_queue *q, struct request *req,
				struct request *next)
{
	int total_phys_segments;
504 505
	unsigned int seg_size =
		req->biotail->bi_seg_back_size + next->bio->bi_seg_front_size;
506 507 508 509 510

	/*
	 * First check if the either of the requests are re-queued
	 * requests.  Can't merge them if they are.
	 */
511
	if (req_no_special_merge(req) || req_no_special_merge(next))
512 513
		return 0;

514
	if (req_gap_back_merge(req, next->bio))
515 516
		return 0;

517 518 519
	/*
	 * Will it become too large?
	 */
520 521
	if ((blk_rq_sectors(req) + blk_rq_sectors(next)) >
	    blk_rq_get_max_sectors(req))
522 523 524
		return 0;

	total_phys_segments = req->nr_phys_segments + next->nr_phys_segments;
525 526 527 528 529
	if (blk_phys_contig_segment(q, req->biotail, next->bio)) {
		if (req->nr_phys_segments == 1)
			req->bio->bi_seg_front_size = seg_size;
		if (next->nr_phys_segments == 1)
			next->biotail->bi_seg_back_size = seg_size;
530
		total_phys_segments--;
531
	}
532

533
	if (total_phys_segments > queue_max_segments(q))
534 535
		return 0;

536
	if (blk_integrity_merge_rq(q, req, next) == false)
537 538
		return 0;

539 540 541 542 543
	/* Merge is OK... */
	req->nr_phys_segments = total_phys_segments;
	return 1;
}

544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573
/**
 * blk_rq_set_mixed_merge - mark a request as mixed merge
 * @rq: request to mark as mixed merge
 *
 * Description:
 *     @rq is about to be mixed merged.  Make sure the attributes
 *     which can be mixed are set in each bio and mark @rq as mixed
 *     merged.
 */
void blk_rq_set_mixed_merge(struct request *rq)
{
	unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK;
	struct bio *bio;

	if (rq->cmd_flags & REQ_MIXED_MERGE)
		return;

	/*
	 * @rq will no longer represent mixable attributes for all the
	 * contained bios.  It will just track those of the first one.
	 * Distributes the attributs to each bio.
	 */
	for (bio = rq->bio; bio; bio = bio->bi_next) {
		WARN_ON_ONCE((bio->bi_rw & REQ_FAILFAST_MASK) &&
			     (bio->bi_rw & REQ_FAILFAST_MASK) != ff);
		bio->bi_rw |= ff;
	}
	rq->cmd_flags |= REQ_MIXED_MERGE;
}

574 575 576 577 578 579 580
static void blk_account_io_merge(struct request *req)
{
	if (blk_do_io_stat(req)) {
		struct hd_struct *part;
		int cpu;

		cpu = part_stat_lock();
581
		part = req->part;
582 583

		part_round_stats(cpu, part);
584
		part_dec_in_flight(part, rq_data_dir(req));
585

586
		hd_struct_put(part);
587 588 589 590
		part_stat_unlock();
	}
}

591 592 593 594 595 596 597 598 599
/*
 * Has to be called with the request spinlock acquired
 */
static int attempt_merge(struct request_queue *q, struct request *req,
			  struct request *next)
{
	if (!rq_mergeable(req) || !rq_mergeable(next))
		return 0;

600 601 602
	if (!blk_check_merge_flags(req->cmd_flags, next->cmd_flags))
		return 0;

603 604 605
	/*
	 * not contiguous
	 */
606
	if (blk_rq_pos(req) + blk_rq_sectors(req) != blk_rq_pos(next))
607 608 609 610
		return 0;

	if (rq_data_dir(req) != rq_data_dir(next)
	    || req->rq_disk != next->rq_disk
611
	    || req_no_special_merge(next))
612 613
		return 0;

614 615 616 617
	if (req->cmd_flags & REQ_WRITE_SAME &&
	    !blk_write_same_mergeable(req->bio, next->bio))
		return 0;

618 619 620 621 622 623 624 625 626
	/*
	 * If we are allowed to merge, then append bio list
	 * from next to rq and release next. merge_requests_fn
	 * will have updated segment counts, update sector
	 * counts here.
	 */
	if (!ll_merge_requests_fn(q, req, next))
		return 0;

627 628 629 630 631 632 633 634 635 636 637 638 639
	/*
	 * If failfast settings disagree or any of the two is already
	 * a mixed merge, mark both as mixed before proceeding.  This
	 * makes sure that all involved bios have mixable attributes
	 * set properly.
	 */
	if ((req->cmd_flags | next->cmd_flags) & REQ_MIXED_MERGE ||
	    (req->cmd_flags & REQ_FAILFAST_MASK) !=
	    (next->cmd_flags & REQ_FAILFAST_MASK)) {
		blk_rq_set_mixed_merge(req);
		blk_rq_set_mixed_merge(next);
	}

640 641 642 643 644 645 646 647 648 649 650 651
	/*
	 * At this point we have either done a back merge
	 * or front merge. We need the smaller start_time of
	 * the merged requests to be the current request
	 * for accounting purposes.
	 */
	if (time_after(req->start_time, next->start_time))
		req->start_time = next->start_time;

	req->biotail->bi_next = next->bio;
	req->biotail = next->biotail;

652
	req->__data_len += blk_rq_bytes(next);
653 654 655

	elv_merge_requests(q, req, next);

656 657 658 659
	/*
	 * 'next' is going away, so update stats accordingly
	 */
	blk_account_io_merge(next);
660 661

	req->ioprio = ioprio_best(req->ioprio, next->ioprio);
662 663
	if (blk_rq_cpu_valid(next))
		req->cpu = next->cpu;
664

665 666
	/* owner-ship of bio passed from next to req */
	next->bio = NULL;
667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689
	__blk_put_request(q, next);
	return 1;
}

int attempt_back_merge(struct request_queue *q, struct request *rq)
{
	struct request *next = elv_latter_request(q, rq);

	if (next)
		return attempt_merge(q, rq, next);

	return 0;
}

int attempt_front_merge(struct request_queue *q, struct request *rq)
{
	struct request *prev = elv_former_request(q, rq);

	if (prev)
		return attempt_merge(q, prev, rq);

	return 0;
}
690 691 692 693 694 695

int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
			  struct request *next)
{
	return attempt_merge(q, rq, next);
}
696 697 698

bool blk_rq_merge_ok(struct request *rq, struct bio *bio)
{
699
	if (!rq_mergeable(rq) || !bio_mergeable(bio))
700 701
		return false;

702 703 704
	if (!blk_check_merge_flags(rq->cmd_flags, bio->bi_rw))
		return false;

705 706 707 708 709
	/* different data direction or already started, don't merge */
	if (bio_data_dir(bio) != rq_data_dir(rq))
		return false;

	/* must be same device and not a special request */
710
	if (rq->rq_disk != bio->bi_bdev->bd_disk || req_no_special_merge(rq))
711 712 713
		return false;

	/* only merge integrity protected bio into ditto rq */
714
	if (blk_integrity_merge_bio(rq->q, rq, bio) == false)
715 716
		return false;

717 718 719 720 721
	/* must be using the same buffer */
	if (rq->cmd_flags & REQ_WRITE_SAME &&
	    !blk_write_same_mergeable(rq->bio, bio))
		return false;

722 723 724 725 726
	return true;
}

int blk_try_merge(struct request *rq, struct bio *bio)
{
727
	if (blk_rq_pos(rq) + blk_rq_sectors(rq) == bio->bi_iter.bi_sector)
728
		return ELEVATOR_BACK_MERGE;
729
	else if (blk_rq_pos(rq) - bio_sectors(bio) == bio->bi_iter.bi_sector)
730 731 732
		return ELEVATOR_FRONT_MERGE;
	return ELEVATOR_NO_MERGE;
}