[mirror_ubuntu-artful-kernel.git] / block / blk-merge.c

/*
 * 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"

static unsigned int __blk_recalc_rq_segments(struct request_queue *q,
					     struct bio *bio)
{
	unsigned int phys_size;
	struct bio_vec *bv, *bvprv = NULL;
	int cluster, i, high, highprv = 1;
	unsigned int seg_size, nr_phys_segs;
	struct bio *fbio, *bbio;

	if (!bio)
		return 0;

	fbio = bio;
	cluster = test_bit(QUEUE_FLAG_CLUSTER, &q->queue_flags);
	seg_size = 0;
	phys_size = nr_phys_segs = 0;
	for_each_bio(bio) {
		bio_for_each_segment(bv, bio, i) {
			/*
			 * the trick here is making sure that a high page is
			 * never considered part of another segment, since that
			 * might change with the bounce page.
			 */
			high = page_to_pfn(bv->bv_page) > queue_bounce_pfn(q);
			if (high || highprv)
				goto new_segment;
			if (cluster) {
				if (seg_size + bv->bv_len
				    > queue_max_segment_size(q))
					goto new_segment;
				if (!BIOVEC_PHYS_MERGEABLE(bvprv, bv))
					goto new_segment;
				if (!BIOVEC_SEG_BOUNDARY(q, bvprv, bv))
					goto new_segment;

				seg_size += bv->bv_len;
				bvprv = bv;
				continue;
			}
new_segment:
			if (nr_phys_segs == 1 && seg_size >
			    fbio->bi_seg_front_size)
				fbio->bi_seg_front_size = seg_size;

			nr_phys_segs++;
			bvprv = bv;
			seg_size = bv->bv_len;
			highprv = high;
		}
		bbio = bio;
	}

	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;

	return nr_phys_segs;
}

void blk_recalc_rq_segments(struct request *rq)
{
	rq->nr_phys_segments = __blk_recalc_rq_segments(rq->q, rq->bio);
}

void blk_recount_segments(struct request_queue *q, struct bio *bio)
{
	struct bio *nxt = bio->bi_next;

	bio->bi_next = NULL;
	bio->bi_phys_segments = __blk_recalc_rq_segments(q, bio);
	bio->bi_next = nxt;
	bio->bi_flags |= (1 << BIO_SEG_VALID);
}
EXPORT_SYMBOL(blk_recount_segments);

static int blk_phys_contig_segment(struct request_queue *q, struct bio *bio,
				   struct bio *nxt)
{
	if (!test_bit(QUEUE_FLAG_CLUSTER, &q->queue_flags))
		return 0;

	if (bio->bi_seg_back_size + nxt->bi_seg_front_size >
	    queue_max_segment_size(q))
		return 0;

	if (!bio_has_data(bio))
		return 1;

	if (!BIOVEC_PHYS_MERGEABLE(__BVEC_END(bio), __BVEC_START(nxt)))
		return 0;

	/*
	 * bio and nxt are contiguous in memory; check if the queue allows
	 * these two to be merged into one
	 */
	if (BIO_SEG_BOUNDARY(q, bio, nxt))
		return 1;

	return 0;
}

/*
 * 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 bio_vec *bvec, *bvprv;
	struct req_iterator iter;
	struct scatterlist *sg;
	int nsegs, cluster;

	nsegs = 0;
	cluster = test_bit(QUEUE_FLAG_CLUSTER, &q->queue_flags);

	/*
	 * for each bio in rq
	 */
	bvprv = NULL;
	sg = NULL;
	rq_for_each_segment(bvec, rq, iter) {
		int nbytes = bvec->bv_len;

		if (bvprv && cluster) {
			if (sg->length + nbytes > queue_max_segment_size(q))
				goto new_segment;

			if (!BIOVEC_PHYS_MERGEABLE(bvprv, bvec))
				goto new_segment;
			if (!BIOVEC_SEG_BOUNDARY(q, bvprv, bvec))
				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.
				 */
				sg->page_link &= ~0x02;
				sg = sg_next(sg);
			}

			sg_set_page(sg, bvec->bv_page, nbytes, bvec->bv_offset);
			nsegs++;
		}
		bvprv = bvec;
	} /* segments in rq */


	if (unlikely(rq->cmd_flags & REQ_COPY_USER) &&
	    (blk_rq_bytes(rq) & q->dma_pad_mask)) {
		unsigned int pad_len =
			(q->dma_pad_mask & ~blk_rq_bytes(rq)) + 1;

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

	if (q->dma_drain_size && q->dma_drain_needed(rq)) {
		if (rq->cmd_flags & REQ_RW)
			memset(q->dma_drain_buffer, 0, q->dma_drain_size);

		sg->page_link &= ~0x02;
		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++;
		rq->extra_len += q->dma_drain_size;
	}

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

	if (req->nr_phys_segments + nr_phys_segs > queue_max_hw_segments(q) ||
	    req->nr_phys_segments + nr_phys_segs > queue_max_phys_segments(q)) {
		req->cmd_flags |= REQ_NOMERGE;
		if (req == q->last_merge)
			q->last_merge = NULL;
		return 0;
	}

	/*
	 * This will form the start of a new hw segment.  Bump both
	 * counters.
	 */
	req->nr_phys_segments += nr_phys_segs;
	return 1;
}

int ll_back_merge_fn(struct request_queue *q, struct request *req,
		     struct bio *bio)
{
	unsigned short max_sectors;

	if (unlikely(blk_pc_request(req)))
		max_sectors = queue_max_hw_sectors(q);
	else
		max_sectors = queue_max_sectors(q);

	if (blk_rq_sectors(req) + bio_sectors(bio) > max_sectors) {
		req->cmd_flags |= REQ_NOMERGE;
		if (req == q->last_merge)
			q->last_merge = NULL;
		return 0;
	}
	if (!bio_flagged(req->biotail, BIO_SEG_VALID))
		blk_recount_segments(q, req->biotail);
	if (!bio_flagged(bio, BIO_SEG_VALID))
		blk_recount_segments(q, bio);

	return ll_new_hw_segment(q, req, bio);
}

int ll_front_merge_fn(struct request_queue *q, struct request *req,
		      struct bio *bio)
{
	unsigned short max_sectors;

	if (unlikely(blk_pc_request(req)))
		max_sectors = queue_max_hw_sectors(q);
	else
		max_sectors = queue_max_sectors(q);


	if (blk_rq_sectors(req) + bio_sectors(bio) > max_sectors) {
		req->cmd_flags |= REQ_NOMERGE;
		if (req == q->last_merge)
			q->last_merge = NULL;
		return 0;
	}
	if (!bio_flagged(bio, BIO_SEG_VALID))
		blk_recount_segments(q, bio);
	if (!bio_flagged(req->bio, BIO_SEG_VALID))
		blk_recount_segments(q, req->bio);

	return ll_new_hw_segment(q, req, bio);
}

static int ll_merge_requests_fn(struct request_queue *q, struct request *req,
				struct request *next)
{
	int total_phys_segments;
	unsigned int seg_size =
		req->biotail->bi_seg_back_size + next->bio->bi_seg_front_size;

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

	/*
	 * Will it become too large?
	 */
	if ((blk_rq_sectors(req) + blk_rq_sectors(next)) > queue_max_sectors(q))
		return 0;

	total_phys_segments = req->nr_phys_segments + next->nr_phys_segments;
	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;
		total_phys_segments--;
	}

	if (total_phys_segments > queue_max_phys_segments(q))
		return 0;

	if (total_phys_segments > queue_max_hw_segments(q))
		return 0;

	/* Merge is OK... */
	req->nr_phys_segments = total_phys_segments;
	return 1;
}

/**
 * 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;
}

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();
		part = disk_map_sector_rcu(req->rq_disk, blk_rq_pos(req));

		part_round_stats(cpu, part);
		part_dec_in_flight(part);

		part_stat_unlock();
	}
}

/*
 * 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;

	/*
	 * not contiguous
	 */
	if (blk_rq_pos(req) + blk_rq_sectors(req) != blk_rq_pos(next))
		return 0;

	if (rq_data_dir(req) != rq_data_dir(next)
	    || req->rq_disk != next->rq_disk
	    || next->special)
		return 0;

	if (blk_integrity_rq(req) != blk_integrity_rq(next))
		return 0;

	/*
	 * 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;

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

	/*
	 * 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;

	req->__data_len += blk_rq_bytes(next);

	elv_merge_requests(q, req, next);

	/*
	 * 'next' is going away, so update stats accordingly
	 */
	blk_account_io_merge(next);

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

	/* owner-ship of bio passed from next to req */
	next->bio = NULL;
	__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;
}
Commit	Line	Data
d6d48196 JA	1	/*
	2	* Functions related to segment and merge handling
	3	*/
	4	#include <linux/kernel.h>
	5	#include <linux/module.h>
	6	#include <linux/bio.h>
	7	#include <linux/blkdev.h>
	8	#include <linux/scatterlist.h>
	9
	10	#include "blk.h"
	11
1e428079	12	static unsigned int __blk_recalc_rq_segments(struct request_queue *q,
59247eae	13	struct bio *bio)
d6d48196	14	{
d6d48196	15	unsigned int phys_size;
d6d48196	16	struct bio_vec bv, bvprv = NULL;
1e428079 JA	17	int cluster, i, high, highprv = 1;
1e428079 JA	18	unsigned int seg_size, nr_phys_segs;
59247eae	19	struct bio fbio, bbio;
d6d48196	20
1e428079 JA	21	if (!bio)
1e428079 JA	22	return 0;
d6d48196	23
1e428079	24	fbio = bio;
75ad23bc	25	cluster = test_bit(QUEUE_FLAG_CLUSTER, &q->queue_flags);
5df97b91 MP	26	seg_size = 0;
5df97b91 MP	27	phys_size = nr_phys_segs = 0;
1e428079 JA	28	for_each_bio(bio) {
	29	bio_for_each_segment(bv, bio, i) {
	30	/*
	31	* the trick here is making sure that a high page is
	32	* never considered part of another segment, since that
	33	* might change with the bounce page.
	34	*/
ae03bf63	35	high = page_to_pfn(bv->bv_page) > queue_bounce_pfn(q);
1e428079	36	if (high \|\| highprv)
d6d48196	37	goto new_segment;
1e428079	38	if (cluster) {
ae03bf63 MP	39	if (seg_size + bv->bv_len
ae03bf63 MP	40	> queue_max_segment_size(q))
1e428079 JA	41	goto new_segment;
	42	if (!BIOVEC_PHYS_MERGEABLE(bvprv, bv))
	43	goto new_segment;
	44	if (!BIOVEC_SEG_BOUNDARY(q, bvprv, bv))
	45	goto new_segment;
d6d48196	46
1e428079 JA	47	seg_size += bv->bv_len;
	48	bvprv = bv;
	49	continue;
	50	}
d6d48196	51	new_segment:
1e428079 JA	52	if (nr_phys_segs == 1 && seg_size >
	53	fbio->bi_seg_front_size)
	54	fbio->bi_seg_front_size = seg_size;
86771427	55
1e428079 JA	56	nr_phys_segs++;
	57	bvprv = bv;
	58	seg_size = bv->bv_len;
	59	highprv = high;
	60	}
59247eae	61	bbio = bio;
d6d48196 JA	62	}
d6d48196 JA	63
59247eae JA	64	if (nr_phys_segs == 1 && seg_size > fbio->bi_seg_front_size)
	65	fbio->bi_seg_front_size = seg_size;
	66	if (seg_size > bbio->bi_seg_back_size)
	67	bbio->bi_seg_back_size = seg_size;
1e428079 JA	68
	69	return nr_phys_segs;
	70	}
	71
	72	void blk_recalc_rq_segments(struct request *rq)
	73	{
59247eae	74	rq->nr_phys_segments = __blk_recalc_rq_segments(rq->q, rq->bio);
d6d48196 JA	75	}
	76
	77	void blk_recount_segments(struct request_queue q, struct bio bio)
	78	{
d6d48196	79	struct bio *nxt = bio->bi_next;
1e428079	80
d6d48196	81	bio->bi_next = NULL;
59247eae	82	bio->bi_phys_segments = __blk_recalc_rq_segments(q, bio);
d6d48196	83	bio->bi_next = nxt;
d6d48196 JA	84	bio->bi_flags \|= (1 << BIO_SEG_VALID);
	85	}
	86	EXPORT_SYMBOL(blk_recount_segments);
	87
	88	static int blk_phys_contig_segment(struct request_queue q, struct bio bio,
	89	struct bio *nxt)
	90	{
75ad23bc	91	if (!test_bit(QUEUE_FLAG_CLUSTER, &q->queue_flags))
d6d48196 JA	92	return 0;
d6d48196 JA	93
86771427	94	if (bio->bi_seg_back_size + nxt->bi_seg_front_size >
ae03bf63	95	queue_max_segment_size(q))
d6d48196 JA	96	return 0;
d6d48196 JA	97
e17fc0a1 DW	98	if (!bio_has_data(bio))
	99	return 1;
	100
	101	if (!BIOVEC_PHYS_MERGEABLE(__BVEC_END(bio), __BVEC_START(nxt)))
	102	return 0;
	103
d6d48196	104	/*
e17fc0a1	105	* bio and nxt are contiguous in memory; check if the queue allows
d6d48196 JA	106	* these two to be merged into one
	107	*/
	108	if (BIO_SEG_BOUNDARY(q, bio, nxt))
	109	return 1;
	110
	111	return 0;
	112	}
	113
d6d48196 JA	114	/*
	115	* map a request to scatterlist, return number of sg entries setup. Caller
	116	* must make sure sg can hold rq->nr_phys_segments entries
	117	*/
	118	int blk_rq_map_sg(struct request_queue q, struct request rq,
	119	struct scatterlist *sglist)
	120	{
	121	struct bio_vec bvec, bvprv;
	122	struct req_iterator iter;
	123	struct scatterlist *sg;
	124	int nsegs, cluster;
	125
	126	nsegs = 0;
75ad23bc	127	cluster = test_bit(QUEUE_FLAG_CLUSTER, &q->queue_flags);
d6d48196 JA	128
	129	/*
	130	* for each bio in rq
	131	*/
	132	bvprv = NULL;
	133	sg = NULL;
	134	rq_for_each_segment(bvec, rq, iter) {
	135	int nbytes = bvec->bv_len;
	136
	137	if (bvprv && cluster) {
ae03bf63	138	if (sg->length + nbytes > queue_max_segment_size(q))
d6d48196 JA	139	goto new_segment;
	140
	141	if (!BIOVEC_PHYS_MERGEABLE(bvprv, bvec))
	142	goto new_segment;
	143	if (!BIOVEC_SEG_BOUNDARY(q, bvprv, bvec))
	144	goto new_segment;
	145
	146	sg->length += nbytes;
	147	} else {
	148	new_segment:
	149	if (!sg)
	150	sg = sglist;
	151	else {
	152	/*
	153	* If the driver previously mapped a shorter
	154	* list, we could see a termination bit
	155	* prematurely unless it fully inits the sg
	156	* table on each mapping. We KNOW that there
	157	* must be more entries here or the driver
	158	* would be buggy, so force clear the
	159	* termination bit to avoid doing a full
	160	* sg_init_table() in drivers for each command.
	161	*/
	162	sg->page_link &= ~0x02;
	163	sg = sg_next(sg);
	164	}
	165
	166	sg_set_page(sg, bvec->bv_page, nbytes, bvec->bv_offset);
	167	nsegs++;
	168	}
	169	bvprv = bvec;
	170	} /* segments in rq */
	171
f18573ab FT	172
f18573ab FT	173	if (unlikely(rq->cmd_flags & REQ_COPY_USER) &&
2e46e8b2 TH	174	(blk_rq_bytes(rq) & q->dma_pad_mask)) {
	175	unsigned int pad_len =
	176	(q->dma_pad_mask & ~blk_rq_bytes(rq)) + 1;
f18573ab FT	177
	178	sg->length += pad_len;
	179	rq->extra_len += pad_len;
	180	}
	181
2fb98e84	182	if (q->dma_drain_size && q->dma_drain_needed(rq)) {
db0a2e00 TH	183	if (rq->cmd_flags & REQ_RW)
	184	memset(q->dma_drain_buffer, 0, q->dma_drain_size);
	185
d6d48196 JA	186	sg->page_link &= ~0x02;
	187	sg = sg_next(sg);
	188	sg_set_page(sg, virt_to_page(q->dma_drain_buffer),
	189	q->dma_drain_size,
	190	((unsigned long)q->dma_drain_buffer) &
	191	(PAGE_SIZE - 1));
	192	nsegs++;
7a85f889	193	rq->extra_len += q->dma_drain_size;
d6d48196 JA	194	}
	195
	196	if (sg)
	197	sg_mark_end(sg);
	198
	199	return nsegs;
	200	}
d6d48196 JA	201	EXPORT_SYMBOL(blk_rq_map_sg);
d6d48196 JA	202
d6d48196 JA	203	static inline int ll_new_hw_segment(struct request_queue *q,
	204	struct request *req,
	205	struct bio *bio)
	206	{
d6d48196 JA	207	int nr_phys_segs = bio_phys_segments(q, bio);
d6d48196 JA	208
ae03bf63 MP	209	if (req->nr_phys_segments + nr_phys_segs > queue_max_hw_segments(q) \|\|
ae03bf63 MP	210	req->nr_phys_segments + nr_phys_segs > queue_max_phys_segments(q)) {
d6d48196 JA	211	req->cmd_flags \|= REQ_NOMERGE;
	212	if (req == q->last_merge)
	213	q->last_merge = NULL;
	214	return 0;
	215	}
	216
	217	/*
	218	* This will form the start of a new hw segment. Bump both
	219	* counters.
	220	*/
d6d48196 JA	221	req->nr_phys_segments += nr_phys_segs;
	222	return 1;
	223	}
	224
	225	int ll_back_merge_fn(struct request_queue q, struct request req,
	226	struct bio *bio)
	227	{
	228	unsigned short max_sectors;
d6d48196 JA	229
d6d48196 JA	230	if (unlikely(blk_pc_request(req)))
ae03bf63	231	max_sectors = queue_max_hw_sectors(q);
d6d48196	232	else
ae03bf63	233	max_sectors = queue_max_sectors(q);
d6d48196	234
83096ebf	235	if (blk_rq_sectors(req) + bio_sectors(bio) > max_sectors) {
d6d48196 JA	236	req->cmd_flags \|= REQ_NOMERGE;
	237	if (req == q->last_merge)
	238	q->last_merge = NULL;
	239	return 0;
	240	}
2cdf79ca	241	if (!bio_flagged(req->biotail, BIO_SEG_VALID))
d6d48196	242	blk_recount_segments(q, req->biotail);
2cdf79ca	243	if (!bio_flagged(bio, BIO_SEG_VALID))
d6d48196	244	blk_recount_segments(q, bio);
d6d48196 JA	245
	246	return ll_new_hw_segment(q, req, bio);
	247	}
	248
6728cb0e	249	int ll_front_merge_fn(struct request_queue q, struct request req,
d6d48196 JA	250	struct bio *bio)
	251	{
	252	unsigned short max_sectors;
d6d48196 JA	253
d6d48196 JA	254	if (unlikely(blk_pc_request(req)))
ae03bf63	255	max_sectors = queue_max_hw_sectors(q);
d6d48196	256	else
ae03bf63	257	max_sectors = queue_max_sectors(q);
d6d48196 JA	258
d6d48196 JA	259
83096ebf	260	if (blk_rq_sectors(req) + bio_sectors(bio) > max_sectors) {
d6d48196 JA	261	req->cmd_flags \|= REQ_NOMERGE;
	262	if (req == q->last_merge)
	263	q->last_merge = NULL;
	264	return 0;
	265	}
2cdf79ca	266	if (!bio_flagged(bio, BIO_SEG_VALID))
d6d48196	267	blk_recount_segments(q, bio);
2cdf79ca	268	if (!bio_flagged(req->bio, BIO_SEG_VALID))
d6d48196	269	blk_recount_segments(q, req->bio);
d6d48196 JA	270
	271	return ll_new_hw_segment(q, req, bio);
	272	}
	273
	274	static int ll_merge_requests_fn(struct request_queue q, struct request req,
	275	struct request *next)
	276	{
	277	int total_phys_segments;
86771427 FT	278	unsigned int seg_size =
86771427 FT	279	req->biotail->bi_seg_back_size + next->bio->bi_seg_front_size;
d6d48196 JA	280
	281	/*
	282	* First check if the either of the requests are re-queued
	283	* requests. Can't merge them if they are.
	284	*/
	285	if (req->special \|\| next->special)
	286	return 0;
	287
	288	/*
	289	* Will it become too large?
	290	*/
ae03bf63	291	if ((blk_rq_sectors(req) + blk_rq_sectors(next)) > queue_max_sectors(q))
d6d48196 JA	292	return 0;
	293
	294	total_phys_segments = req->nr_phys_segments + next->nr_phys_segments;
86771427 FT	295	if (blk_phys_contig_segment(q, req->biotail, next->bio)) {
	296	if (req->nr_phys_segments == 1)
	297	req->bio->bi_seg_front_size = seg_size;
	298	if (next->nr_phys_segments == 1)
	299	next->biotail->bi_seg_back_size = seg_size;
d6d48196	300	total_phys_segments--;
86771427	301	}
d6d48196	302
ae03bf63	303	if (total_phys_segments > queue_max_phys_segments(q))
d6d48196 JA	304	return 0;
d6d48196 JA	305
ae03bf63	306	if (total_phys_segments > queue_max_hw_segments(q))
d6d48196 JA	307	return 0;
	308
	309	/* Merge is OK... */
	310	req->nr_phys_segments = total_phys_segments;
d6d48196 JA	311	return 1;
	312	}
	313
80a761fd TH	314	/**
	315	* blk_rq_set_mixed_merge - mark a request as mixed merge
	316	* @rq: request to mark as mixed merge
	317	*
	318	* Description:
	319	* @rq is about to be mixed merged. Make sure the attributes
	320	* which can be mixed are set in each bio and mark @rq as mixed
	321	* merged.
	322	*/
	323	void blk_rq_set_mixed_merge(struct request *rq)
	324	{
	325	unsigned int ff = rq->cmd_flags & REQ_FAILFAST_MASK;
	326	struct bio *bio;
	327
	328	if (rq->cmd_flags & REQ_MIXED_MERGE)
	329	return;
	330
	331	/*
	332	* @rq will no longer represent mixable attributes for all the
	333	* contained bios. It will just track those of the first one.
	334	* Distributes the attributs to each bio.
	335	*/
	336	for (bio = rq->bio; bio; bio = bio->bi_next) {
	337	WARN_ON_ONCE((bio->bi_rw & REQ_FAILFAST_MASK) &&
	338	(bio->bi_rw & REQ_FAILFAST_MASK) != ff);
	339	bio->bi_rw \|= ff;
	340	}
	341	rq->cmd_flags \|= REQ_MIXED_MERGE;
	342	}
	343
26308eab JM	344	static void blk_account_io_merge(struct request *req)
	345	{
	346	if (blk_do_io_stat(req)) {
	347	struct hd_struct *part;
	348	int cpu;
	349
	350	cpu = part_stat_lock();
83096ebf	351	part = disk_map_sector_rcu(req->rq_disk, blk_rq_pos(req));
26308eab JM	352
26308eab JM	353	part_round_stats(cpu, part);
0f78ab98	354	part_dec_in_flight(part);
26308eab JM	355
	356	part_stat_unlock();
	357	}
	358	}
	359
d6d48196 JA	360	/*
	361	* Has to be called with the request spinlock acquired
	362	*/
	363	static int attempt_merge(struct request_queue q, struct request req,
	364	struct request *next)
	365	{
	366	if (!rq_mergeable(req) \|\| !rq_mergeable(next))
	367	return 0;
	368
	369	/*
	370	* not contiguous
	371	*/
83096ebf	372	if (blk_rq_pos(req) + blk_rq_sectors(req) != blk_rq_pos(next))
d6d48196 JA	373	return 0;
	374
	375	if (rq_data_dir(req) != rq_data_dir(next)
	376	\|\| req->rq_disk != next->rq_disk
	377	\|\| next->special)
	378	return 0;
	379
7ba1ba12 MP	380	if (blk_integrity_rq(req) != blk_integrity_rq(next))
	381	return 0;
	382
d6d48196 JA	383	/*
	384	* If we are allowed to merge, then append bio list
	385	* from next to rq and release next. merge_requests_fn
	386	* will have updated segment counts, update sector
	387	* counts here.
	388	*/
	389	if (!ll_merge_requests_fn(q, req, next))
	390	return 0;
	391
80a761fd TH	392	/*
	393	* If failfast settings disagree or any of the two is already
	394	* a mixed merge, mark both as mixed before proceeding. This
	395	* makes sure that all involved bios have mixable attributes
	396	* set properly.
	397	*/
	398	if ((req->cmd_flags \| next->cmd_flags) & REQ_MIXED_MERGE \|\|
	399	(req->cmd_flags & REQ_FAILFAST_MASK) !=
	400	(next->cmd_flags & REQ_FAILFAST_MASK)) {
	401	blk_rq_set_mixed_merge(req);
	402	blk_rq_set_mixed_merge(next);
	403	}
	404
d6d48196 JA	405	/*
	406	* At this point we have either done a back merge
	407	* or front merge. We need the smaller start_time of
	408	* the merged requests to be the current request
	409	* for accounting purposes.
	410	*/
	411	if (time_after(req->start_time, next->start_time))
	412	req->start_time = next->start_time;
	413
	414	req->biotail->bi_next = next->bio;
	415	req->biotail = next->biotail;
	416
a2dec7b3	417	req->__data_len += blk_rq_bytes(next);
d6d48196 JA	418
	419	elv_merge_requests(q, req, next);
	420
42dad764 JM	421	/*
	422	* 'next' is going away, so update stats accordingly
	423	*/
	424	blk_account_io_merge(next);
d6d48196 JA	425
d6d48196 JA	426	req->ioprio = ioprio_best(req->ioprio, next->ioprio);
ab780f1e JA	427	if (blk_rq_cpu_valid(next))
ab780f1e JA	428	req->cpu = next->cpu;
d6d48196	429
1cd96c24 BH	430	/* owner-ship of bio passed from next to req */
1cd96c24 BH	431	next->bio = NULL;
d6d48196 JA	432	__blk_put_request(q, next);
	433	return 1;
	434	}
	435
	436	int attempt_back_merge(struct request_queue q, struct request rq)
	437	{
	438	struct request *next = elv_latter_request(q, rq);
	439
	440	if (next)
	441	return attempt_merge(q, rq, next);
	442
	443	return 0;
	444	}
	445
	446	int attempt_front_merge(struct request_queue q, struct request rq)
	447	{
	448	struct request *prev = elv_former_request(q, rq);
	449
	450	if (prev)
	451	return attempt_merge(q, prev, rq);
	452
	453	return 0;
	454	}