blk-merge.c 18.6 KB
Newer Older
1 2 3 4 5 6 7 8 9
/*
 * 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>

10 11
#include <trace/events/block.h>

12 13
#include "blk.h"

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

24 25
	*nsegs = 1;

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 57 58
	/* 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,
59 60
					    struct bio_set *bs,
					    unsigned *nsegs)
61
{
62 63
	*nsegs = 1;

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);
}

73 74 75 76 77 78 79 80 81 82 83 84
static inline unsigned get_max_io_size(struct request_queue *q,
				       struct bio *bio)
{
	unsigned sectors = blk_max_size_offset(q, bio->bi_iter.bi_sector);
	unsigned mask = queue_logical_block_size(q) - 1;

	/* aligned to logical block size */
	sectors &= ~(mask >> 9);

	return sectors;
}

85 86
static struct bio *blk_bio_segment_split(struct request_queue *q,
					 struct bio *bio,
87 88
					 struct bio_set *bs,
					 unsigned *segs)
89
{
90
	struct bio_vec bv, bvprv, *bvprvp = NULL;
91
	struct bvec_iter iter;
92
	unsigned seg_size = 0, nsegs = 0, sectors = 0;
93 94 95
	unsigned front_seg_size = bio->bi_seg_front_size;
	bool do_split = true;
	struct bio *new = NULL;
96
	const unsigned max_sectors = get_max_io_size(q, bio);
97 98 99 100 101 102

	bio_for_each_segment(bv, bio, iter) {
		/*
		 * If the queue doesn't support SG gaps and adding this
		 * offset would create a gap, disallow it.
		 */
103
		if (bvprvp && bvec_gap_to_prev(q, bvprvp, bv.bv_offset))
104 105
			goto split;

106
		if (sectors + (bv.bv_len >> 9) > max_sectors) {
107 108 109 110 111
			/*
			 * Consider this a new segment if we're splitting in
			 * the middle of this vector.
			 */
			if (nsegs < queue_max_segments(q) &&
112
			    sectors < max_sectors) {
113
				nsegs++;
114
				sectors = max_sectors;
115
			}
116 117 118
			if (sectors)
				goto split;
			/* Make this single bvec as the 1st segment */
119 120
		}

121
		if (bvprvp && blk_queue_cluster(q)) {
122 123
			if (seg_size + bv.bv_len > queue_max_segment_size(q))
				goto new_segment;
124
			if (!BIOVEC_PHYS_MERGEABLE(bvprvp, &bv))
125
				goto new_segment;
126
			if (!BIOVEC_SEG_BOUNDARY(q, bvprvp, &bv))
127 128 129 130
				goto new_segment;

			seg_size += bv.bv_len;
			bvprv = bv;
Ming Lei's avatar
Ming Lei committed
131
			bvprvp = &bvprv;
132
			sectors += bv.bv_len >> 9;
133 134 135

			if (nsegs == 1 && seg_size > front_seg_size)
				front_seg_size = seg_size;
136 137 138 139 140 141 142 143
			continue;
		}
new_segment:
		if (nsegs == queue_max_segments(q))
			goto split;

		nsegs++;
		bvprv = bv;
Ming Lei's avatar
Ming Lei committed
144
		bvprvp = &bvprv;
145
		seg_size = bv.bv_len;
146
		sectors += bv.bv_len >> 9;
147 148 149

		if (nsegs == 1 && seg_size > front_seg_size)
			front_seg_size = seg_size;
150 151
	}

152
	do_split = false;
153
split:
154
	*segs = nsegs;
155 156 157 158 159 160 161 162 163 164 165 166

	if (do_split) {
		new = bio_split(bio, sectors, GFP_NOIO, bs);
		if (new)
			bio = new;
	}

	bio->bi_seg_front_size = front_seg_size;
	if (seg_size > bio->bi_seg_back_size)
		bio->bi_seg_back_size = seg_size;

	return do_split ? new : NULL;
167 168 169 170 171
}

void blk_queue_split(struct request_queue *q, struct bio **bio,
		     struct bio_set *bs)
{
172 173
	struct bio *split, *res;
	unsigned nsegs;
174 175

	if ((*bio)->bi_rw & REQ_DISCARD)
176
		split = blk_bio_discard_split(q, *bio, bs, &nsegs);
177
	else if ((*bio)->bi_rw & REQ_WRITE_SAME)
178
		split = blk_bio_write_same_split(q, *bio, bs, &nsegs);
179
	else
180 181 182 183 184 185
		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);
186 187

	if (split) {
Ming Lei's avatar
Ming Lei committed
188 189 190
		/* there isn't chance to merge the splitted bio */
		split->bi_rw |= REQ_NOMERGE;

191
		bio_chain(split, *bio);
192
		trace_block_split(q, split, (*bio)->bi_iter.bi_sector);
193 194 195 196 197 198
		generic_make_request(*bio);
		*bio = split;
	}
}
EXPORT_SYMBOL(blk_queue_split);

199
static unsigned int __blk_recalc_rq_segments(struct request_queue *q,
Ming Lei's avatar
Ming Lei committed
200 201
					     struct bio *bio,
					     bool no_sg_merge)
202
{
203
	struct bio_vec bv, bvprv = { NULL };
204
	int cluster, prev = 0;
205
	unsigned int seg_size, nr_phys_segs;
206
	struct bio *fbio, *bbio;
207
	struct bvec_iter iter;
208

209 210
	if (!bio)
		return 0;
211

212 213 214 215 216 217 218 219 220 221
	/*
	 * 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;

222
	fbio = bio;
223
	cluster = blk_queue_cluster(q);
Mikulas Patocka's avatar
Mikulas Patocka committed
224
	seg_size = 0;
225
	nr_phys_segs = 0;
226
	for_each_bio(bio) {
227
		bio_for_each_segment(bv, bio, iter) {
228 229 230 231 232 233 234
			/*
			 * If SG merging is disabled, each bio vector is
			 * a segment
			 */
			if (no_sg_merge)
				goto new_segment;

235
			if (prev && cluster) {
236
				if (seg_size + bv.bv_len
237
				    > queue_max_segment_size(q))
238
					goto new_segment;
239
				if (!BIOVEC_PHYS_MERGEABLE(&bvprv, &bv))
240
					goto new_segment;
241
				if (!BIOVEC_SEG_BOUNDARY(q, &bvprv, &bv))
242
					goto new_segment;
243

244
				seg_size += bv.bv_len;
245 246 247
				bvprv = bv;
				continue;
			}
248
new_segment:
249 250 251
			if (nr_phys_segs == 1 && seg_size >
			    fbio->bi_seg_front_size)
				fbio->bi_seg_front_size = seg_size;
252

253 254
			nr_phys_segs++;
			bvprv = bv;
255
			prev = 1;
256
			seg_size = bv.bv_len;
257
		}
258
		bbio = bio;
259 260
	}

261 262 263 264
	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;
265 266 267 268 269 270

	return nr_phys_segs;
}

void blk_recalc_rq_segments(struct request *rq)
{
Ming Lei's avatar
Ming Lei committed
271 272 273 274 275
	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);
276 277 278 279
}

void blk_recount_segments(struct request_queue *q, struct bio *bio)
{
280 281 282 283 284 285 286
	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;
287

288 289 290
	if (test_bit(QUEUE_FLAG_NO_SG_MERGE, &q->queue_flags) &&
			(seg_cnt < queue_max_segments(q)))
		bio->bi_phys_segments = seg_cnt;
291 292 293 294
	else {
		struct bio *nxt = bio->bi_next;

		bio->bi_next = NULL;
295
		bio->bi_phys_segments = __blk_recalc_rq_segments(q, bio, false);
296 297
		bio->bi_next = nxt;
	}
298

299
	bio_set_flag(bio, BIO_SEG_VALID);
300 301 302 303 304 305
}
EXPORT_SYMBOL(blk_recount_segments);

static int blk_phys_contig_segment(struct request_queue *q, struct bio *bio,
				   struct bio *nxt)
{
306
	struct bio_vec end_bv = { NULL }, nxt_bv;
307 308
	struct bvec_iter iter;

309
	if (!blk_queue_cluster(q))
310 311
		return 0;

312
	if (bio->bi_seg_back_size + nxt->bi_seg_front_size >
313
	    queue_max_segment_size(q))
314 315
		return 0;

316 317 318
	if (!bio_has_data(bio))
		return 1;

319 320 321 322 323 324 325
	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))
326 327
		return 0;

328
	/*
329
	 * bio and nxt are contiguous in memory; check if the queue allows
330 331
	 * these two to be merged into one
	 */
332
	if (BIOVEC_SEG_BOUNDARY(q, &end_bv, &nxt_bv))
333 334 335 336 337
		return 1;

	return 0;
}

338
static inline void
339
__blk_segment_map_sg(struct request_queue *q, struct bio_vec *bvec,
340
		     struct scatterlist *sglist, struct bio_vec *bvprv,
341 342 343 344 345
		     struct scatterlist **sg, int *nsegs, int *cluster)
{

	int nbytes = bvec->bv_len;

346
	if (*sg && *cluster) {
347 348 349
		if ((*sg)->length + nbytes > queue_max_segment_size(q))
			goto new_segment;

350
		if (!BIOVEC_PHYS_MERGEABLE(bvprv, bvec))
351
			goto new_segment;
352
		if (!BIOVEC_SEG_BOUNDARY(q, bvprv, bvec))
353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370
			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.
			 */
371
			sg_unmark_end(*sg);
372 373 374 375 376 377
			*sg = sg_next(*sg);
		}

		sg_set_page(*sg, bvec->bv_page, nbytes, bvec->bv_offset);
		(*nsegs)++;
	}
378
	*bvprv = *bvec;
379 380
}

381 382 383
static int __blk_bios_map_sg(struct request_queue *q, struct bio *bio,
			     struct scatterlist *sglist,
			     struct scatterlist **sg)
384
{
385
	struct bio_vec bvec, bvprv = { NULL };
386
	struct bvec_iter iter;
387 388 389
	int nsegs, cluster;

	nsegs = 0;
390
	cluster = blk_queue_cluster(q);
391

392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418
	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);
419

420 421 422 423 424 425 426 427 428 429 430 431 432 433 434
	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);
435 436

	if (unlikely(rq->cmd_flags & REQ_COPY_USER) &&
437 438 439
	    (blk_rq_bytes(rq) & q->dma_pad_mask)) {
		unsigned int pad_len =
			(q->dma_pad_mask & ~blk_rq_bytes(rq)) + 1;
440 441 442 443 444

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

445
	if (q->dma_drain_size && q->dma_drain_needed(rq)) {
446
		if (rq->cmd_flags & REQ_WRITE)
447 448
			memset(q->dma_drain_buffer, 0, q->dma_drain_size);

449
		sg_unmark_end(sg);
450 451 452 453 454 455
		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++;
456
		rq->extra_len += q->dma_drain_size;
457 458 459 460 461
	}

	if (sg)
		sg_mark_end(sg);

462 463 464 465 466 467
	/*
	 * Something must have been wrong if the figured number of
	 * segment is bigger than number of req's physical segments
	 */
	WARN_ON(nsegs > rq->nr_phys_segments);

468 469 470 471 472 473 474 475 476 477
	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);

478 479 480
	if (req->nr_phys_segments + nr_phys_segs > queue_max_segments(q))
		goto no_merge;

481
	if (blk_integrity_merge_bio(q, req, bio) == false)
482
		goto no_merge;
483 484 485 486 487 488 489

	/*
	 * This will form the start of a new hw segment.  Bump both
	 * counters.
	 */
	req->nr_phys_segments += nr_phys_segs;
	return 1;
490 491 492 493 494 495

no_merge:
	req->cmd_flags |= REQ_NOMERGE;
	if (req == q->last_merge)
		q->last_merge = NULL;
	return 0;
496 497 498 499 500
}

int ll_back_merge_fn(struct request_queue *q, struct request *req,
		     struct bio *bio)
{
501 502
	if (req_gap_back_merge(req, bio))
		return 0;
503 504 505
	if (blk_integrity_rq(req) &&
	    integrity_req_gap_back_merge(req, bio))
		return 0;
506 507
	if (blk_rq_sectors(req) + bio_sectors(bio) >
	    blk_rq_get_max_sectors(req)) {
508 509 510 511 512
		req->cmd_flags |= REQ_NOMERGE;
		if (req == q->last_merge)
			q->last_merge = NULL;
		return 0;
	}
513
	if (!bio_flagged(req->biotail, BIO_SEG_VALID))
514
		blk_recount_segments(q, req->biotail);
515
	if (!bio_flagged(bio, BIO_SEG_VALID))
516 517 518 519 520
		blk_recount_segments(q, bio);

	return ll_new_hw_segment(q, req, bio);
}

521
int ll_front_merge_fn(struct request_queue *q, struct request *req,
522 523
		      struct bio *bio)
{
524 525 526

	if (req_gap_front_merge(req, bio))
		return 0;
527 528 529
	if (blk_integrity_rq(req) &&
	    integrity_req_gap_front_merge(req, bio))
		return 0;
530 531
	if (blk_rq_sectors(req) + bio_sectors(bio) >
	    blk_rq_get_max_sectors(req)) {
532 533 534 535 536
		req->cmd_flags |= REQ_NOMERGE;
		if (req == q->last_merge)
			q->last_merge = NULL;
		return 0;
	}
537
	if (!bio_flagged(bio, BIO_SEG_VALID))
538
		blk_recount_segments(q, bio);
539
	if (!bio_flagged(req->bio, BIO_SEG_VALID))
540 541 542 543 544
		blk_recount_segments(q, req->bio);

	return ll_new_hw_segment(q, req, bio);
}

545 546 547 548 549 550 551 552 553 554 555
/*
 * 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;
}

556 557 558 559
static int ll_merge_requests_fn(struct request_queue *q, struct request *req,
				struct request *next)
{
	int total_phys_segments;
560 561
	unsigned int seg_size =
		req->biotail->bi_seg_back_size + next->bio->bi_seg_front_size;
562 563 564 565 566

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

570
	if (req_gap_back_merge(req, next->bio))
571 572
		return 0;

573 574 575
	/*
	 * Will it become too large?
	 */
576 577
	if ((blk_rq_sectors(req) + blk_rq_sectors(next)) >
	    blk_rq_get_max_sectors(req))
578 579 580
		return 0;

	total_phys_segments = req->nr_phys_segments + next->nr_phys_segments;
581 582 583 584 585
	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;
586
		total_phys_segments--;
587
	}
588

589
	if (total_phys_segments > queue_max_segments(q))
590 591
		return 0;

592
	if (blk_integrity_merge_rq(q, req, next) == false)
593 594
		return 0;

595 596 597 598 599
	/* Merge is OK... */
	req->nr_phys_segments = total_phys_segments;
	return 1;
}

600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629
/**
 * 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;
}

630 631 632 633 634 635 636
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();
637
		part = req->part;
638 639

		part_round_stats(cpu, part);
640
		part_dec_in_flight(part, rq_data_dir(req));
641

642
		hd_struct_put(part);
643 644 645 646
		part_stat_unlock();
	}
}

647 648 649 650 651 652 653 654 655
/*
 * 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;

656 657 658
	if (!blk_check_merge_flags(req->cmd_flags, next->cmd_flags))
		return 0;

659 660 661
	/*
	 * not contiguous
	 */
662
	if (blk_rq_pos(req) + blk_rq_sectors(req) != blk_rq_pos(next))
663 664 665 666
		return 0;

	if (rq_data_dir(req) != rq_data_dir(next)
	    || req->rq_disk != next->rq_disk
667
	    || req_no_special_merge(next))
668 669
		return 0;

670 671 672 673
	if (req->cmd_flags & REQ_WRITE_SAME &&
	    !blk_write_same_mergeable(req->bio, next->bio))
		return 0;

674 675 676 677 678 679 680 681 682
	/*
	 * 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;

683 684 685 686 687 688 689 690 691 692 693 694 695
	/*
	 * 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);
	}

696 697 698 699 700 701 702 703 704 705 706 707
	/*
	 * 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;

708
	req->__data_len += blk_rq_bytes(next);
709 710 711

	elv_merge_requests(q, req, next);

712 713 714 715
	/*
	 * 'next' is going away, so update stats accordingly
	 */
	blk_account_io_merge(next);
716 717

	req->ioprio = ioprio_best(req->ioprio, next->ioprio);
718 719
	if (blk_rq_cpu_valid(next))
		req->cpu = next->cpu;
720

721 722
	/* owner-ship of bio passed from next to req */
	next->bio = NULL;
723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745
	__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;
}
746 747 748 749 750 751

int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
			  struct request *next)
{
	return attempt_merge(q, rq, next);
}
752 753 754

bool blk_rq_merge_ok(struct request *rq, struct bio *bio)
{
755
	if (!rq_mergeable(rq) || !bio_mergeable(bio))
756 757
		return false;

758 759 760
	if (!blk_check_merge_flags(rq->cmd_flags, bio->bi_rw))
		return false;

761 762 763 764 765
	/* 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 */
766
	if (rq->rq_disk != bio->bi_bdev->bd_disk || req_no_special_merge(rq))
767 768 769
		return false;

	/* only merge integrity protected bio into ditto rq */
770
	if (blk_integrity_merge_bio(rq->q, rq, bio) == false)
771 772
		return false;

773 774 775 776 777
	/* must be using the same buffer */
	if (rq->cmd_flags & REQ_WRITE_SAME &&
	    !blk_write_same_mergeable(rq->bio, bio))
		return false;

778 779 780 781 782
	return true;
}

int blk_try_merge(struct request *rq, struct bio *bio)
{
783
	if (blk_rq_pos(rq) + blk_rq_sectors(rq) == bio->bi_iter.bi_sector)
784
		return ELEVATOR_BACK_MERGE;
785
	else if (blk_rq_pos(rq) - bio_sectors(bio) == bio->bi_iter.bi_sector)
786 787 788
		return ELEVATOR_FRONT_MERGE;
	return ELEVATOR_NO_MERGE;
}