[GitHub/mt8127/android_kernel_alcatel_ttab.git] / block / blk-map.c

/*
 * Functions related to mapping data to requests
 */
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/bio.h>
#include <linux/blkdev.h>
#include <scsi/sg.h>		/* for struct sg_iovec */

#include "blk.h"

int blk_rq_append_bio(struct request_queue *q, struct request *rq,
		      struct bio *bio)
{
	if (!rq->bio)
		blk_rq_bio_prep(q, rq, bio);
	else if (!ll_back_merge_fn(q, rq, bio))
		return -EINVAL;
	else {
		rq->biotail->bi_next = bio;
		rq->biotail = bio;

		rq->data_len += bio->bi_size;
	}
	return 0;
}
EXPORT_SYMBOL(blk_rq_append_bio);

static int __blk_rq_unmap_user(struct bio *bio)
{
	int ret = 0;

	if (bio) {
		if (bio_flagged(bio, BIO_USER_MAPPED))
			bio_unmap_user(bio);
		else
			ret = bio_uncopy_user(bio);
	}

	return ret;
}

static int __blk_rq_map_user(struct request_queue *q, struct request *rq,
			     void __user *ubuf, unsigned int len)
{
	unsigned long uaddr;
	unsigned int alignment;
	struct bio *bio, *orig_bio;
	int reading, ret;

	reading = rq_data_dir(rq) == READ;

	/*
	 * if alignment requirement is satisfied, map in user pages for
	 * direct dma. else, set up kernel bounce buffers
	 */
	uaddr = (unsigned long) ubuf;
	alignment = queue_dma_alignment(q) | q->dma_pad_mask;
	if (!(uaddr & alignment) && !(len & alignment))
		bio = bio_map_user(q, NULL, uaddr, len, reading);
	else
		bio = bio_copy_user(q, uaddr, len, reading);

	if (IS_ERR(bio))
		return PTR_ERR(bio);

	orig_bio = bio;
	blk_queue_bounce(q, &bio);

	/*
	 * We link the bounce buffer in and could have to traverse it
	 * later so we have to get a ref to prevent it from being freed
	 */
	bio_get(bio);

	ret = blk_rq_append_bio(q, rq, bio);
	if (!ret)
		return bio->bi_size;

	/* if it was boucned we must call the end io function */
	bio_endio(bio, 0);
	__blk_rq_unmap_user(orig_bio);
	bio_put(bio);
	return ret;
}

/**
 * blk_rq_map_user - map user data to a request, for REQ_BLOCK_PC usage
 * @q:		request queue where request should be inserted
 * @rq:		request structure to fill
 * @ubuf:	the user buffer
 * @len:	length of user data
 *
 * Description:
 *    Data will be mapped directly for zero copy io, if possible. Otherwise
 *    a kernel bounce buffer is used.
 *
 *    A matching blk_rq_unmap_user() must be issued at the end of io, while
 *    still in process context.
 *
 *    Note: The mapped bio may need to be bounced through blk_queue_bounce()
 *    before being submitted to the device, as pages mapped may be out of
 *    reach. It's the callers responsibility to make sure this happens. The
 *    original bio must be passed back in to blk_rq_unmap_user() for proper
 *    unmapping.
 */
int blk_rq_map_user(struct request_queue *q, struct request *rq,
		    void __user *ubuf, unsigned long len)
{
	unsigned long bytes_read = 0;
	struct bio *bio = NULL;
	int ret;

	if (len > (q->max_hw_sectors << 9))
		return -EINVAL;
	if (!len || !ubuf)
		return -EINVAL;

	while (bytes_read != len) {
		unsigned long map_len, end, start;

		map_len = min_t(unsigned long, len - bytes_read, BIO_MAX_SIZE);
		end = ((unsigned long)ubuf + map_len + PAGE_SIZE - 1)
								>> PAGE_SHIFT;
		start = (unsigned long)ubuf >> PAGE_SHIFT;

		/*
		 * A bad offset could cause us to require BIO_MAX_PAGES + 1
		 * pages. If this happens we just lower the requested
		 * mapping len by a page so that we can fit
		 */
		if (end - start > BIO_MAX_PAGES)
			map_len -= PAGE_SIZE;

		ret = __blk_rq_map_user(q, rq, ubuf, map_len);
		if (ret < 0)
			goto unmap_rq;
		if (!bio)
			bio = rq->bio;
		bytes_read += ret;
		ubuf += ret;
	}

	/*
	 * __blk_rq_map_user() copies the buffers if starting address
	 * or length isn't aligned to dma_pad_mask.  As the copied
	 * buffer is always page aligned, we know that there's enough
	 * room for padding.  Extend the last bio and update
	 * rq->data_len accordingly.
	 *
	 * On unmap, bio_uncopy_user() will use unmodified
	 * bio_map_data pointed to by bio->bi_private.
	 */
	if (len & q->dma_pad_mask) {
		unsigned int pad_len = (q->dma_pad_mask & ~len) + 1;
		struct bio *tail = rq->biotail;

		tail->bi_io_vec[tail->bi_vcnt - 1].bv_len += pad_len;
		tail->bi_size += pad_len;

		rq->extra_len += pad_len;
	}

	rq->buffer = rq->data = NULL;
	return 0;
unmap_rq:
	blk_rq_unmap_user(bio);
	rq->bio = NULL;
	return ret;
}
EXPORT_SYMBOL(blk_rq_map_user);

/**
 * blk_rq_map_user_iov - map user data to a request, for REQ_BLOCK_PC usage
 * @q:		request queue where request should be inserted
 * @rq:		request to map data to
 * @iov:	pointer to the iovec
 * @iov_count:	number of elements in the iovec
 * @len:	I/O byte count
 *
 * Description:
 *    Data will be mapped directly for zero copy io, if possible. Otherwise
 *    a kernel bounce buffer is used.
 *
 *    A matching blk_rq_unmap_user() must be issued at the end of io, while
 *    still in process context.
 *
 *    Note: The mapped bio may need to be bounced through blk_queue_bounce()
 *    before being submitted to the device, as pages mapped may be out of
 *    reach. It's the callers responsibility to make sure this happens. The
 *    original bio must be passed back in to blk_rq_unmap_user() for proper
 *    unmapping.
 */
int blk_rq_map_user_iov(struct request_queue *q, struct request *rq,
			struct sg_iovec *iov, int iov_count, unsigned int len)
{
	struct bio *bio;
	int i, read = rq_data_dir(rq) == READ;
	int unaligned = 0;

	if (!iov || iov_count <= 0)
		return -EINVAL;

	for (i = 0; i < iov_count; i++) {
		unsigned long uaddr = (unsigned long)iov[i].iov_base;

		if (uaddr & queue_dma_alignment(q)) {
			unaligned = 1;
			break;
		}
	}

	if (unaligned || (q->dma_pad_mask & len))
		bio = bio_copy_user_iov(q, iov, iov_count, read);
	else
		bio = bio_map_user_iov(q, NULL, iov, iov_count, read);

	if (IS_ERR(bio))
		return PTR_ERR(bio);

	if (bio->bi_size != len) {
		bio_endio(bio, 0);
		bio_unmap_user(bio);
		return -EINVAL;
	}

	bio_get(bio);
	blk_rq_bio_prep(q, rq, bio);
	rq->buffer = rq->data = NULL;
	return 0;
}

/**
 * blk_rq_unmap_user - unmap a request with user data
 * @bio:	       start of bio list
 *
 * Description:
 *    Unmap a rq previously mapped by blk_rq_map_user(). The caller must
 *    supply the original rq->bio from the blk_rq_map_user() return, since
 *    the io completion may have changed rq->bio.
 */
int blk_rq_unmap_user(struct bio *bio)
{
	struct bio *mapped_bio;
	int ret = 0, ret2;

	while (bio) {
		mapped_bio = bio;
		if (unlikely(bio_flagged(bio, BIO_BOUNCED)))
			mapped_bio = bio->bi_private;

		ret2 = __blk_rq_unmap_user(mapped_bio);
		if (ret2 && !ret)
			ret = ret2;

		mapped_bio = bio;
		bio = bio->bi_next;
		bio_put(mapped_bio);
	}

	return ret;
}
EXPORT_SYMBOL(blk_rq_unmap_user);

/**
 * blk_rq_map_kern - map kernel data to a request, for REQ_BLOCK_PC usage
 * @q:		request queue where request should be inserted
 * @rq:		request to fill
 * @kbuf:	the kernel buffer
 * @len:	length of user data
 * @gfp_mask:	memory allocation flags
 */
int blk_rq_map_kern(struct request_queue *q, struct request *rq, void *kbuf,
		    unsigned int len, gfp_t gfp_mask)
{
	struct bio *bio;

	if (len > (q->max_hw_sectors << 9))
		return -EINVAL;
	if (!len || !kbuf)
		return -EINVAL;

	bio = bio_map_kern(q, kbuf, len, gfp_mask);
	if (IS_ERR(bio))
		return PTR_ERR(bio);

	if (rq_data_dir(rq) == WRITE)
		bio->bi_rw |= (1 << BIO_RW);

	blk_rq_bio_prep(q, rq, bio);
	blk_queue_bounce(q, &rq->bio);
	rq->buffer = rq->data = NULL;
	return 0;
}
EXPORT_SYMBOL(blk_rq_map_kern);
Commit	Line	Data
86db1e29 JA	1	/*
	2	* Functions related to mapping data to requests
	3	*/
	4	#include <linux/kernel.h>
	5	#include <linux/module.h>
	6	#include <linux/bio.h>
	7	#include <linux/blkdev.h>
afdc1a78	8	#include <scsi/sg.h> /* for struct sg_iovec */
86db1e29 JA	9
	10	#include "blk.h"
	11
	12	int blk_rq_append_bio(struct request_queue q, struct request rq,
	13	struct bio *bio)
	14	{
	15	if (!rq->bio)
	16	blk_rq_bio_prep(q, rq, bio);
	17	else if (!ll_back_merge_fn(q, rq, bio))
	18	return -EINVAL;
	19	else {
	20	rq->biotail->bi_next = bio;
	21	rq->biotail = bio;
	22
	23	rq->data_len += bio->bi_size;
	24	}
	25	return 0;
	26	}
	27	EXPORT_SYMBOL(blk_rq_append_bio);
	28
	29	static int __blk_rq_unmap_user(struct bio *bio)
	30	{
	31	int ret = 0;
	32
	33	if (bio) {
	34	if (bio_flagged(bio, BIO_USER_MAPPED))
	35	bio_unmap_user(bio);
	36	else
	37	ret = bio_uncopy_user(bio);
	38	}
	39
	40	return ret;
	41	}
	42
	43	static int __blk_rq_map_user(struct request_queue q, struct request rq,
	44	void __user *ubuf, unsigned int len)
	45	{
	46	unsigned long uaddr;
e3790c7d	47	unsigned int alignment;
86db1e29 JA	48	struct bio bio, orig_bio;
	49	int reading, ret;
	50
	51	reading = rq_data_dir(rq) == READ;
	52
	53	/*
	54	* if alignment requirement is satisfied, map in user pages for
	55	* direct dma. else, set up kernel bounce buffers
	56	*/
	57	uaddr = (unsigned long) ubuf;
e3790c7d TH	58	alignment = queue_dma_alignment(q) \| q->dma_pad_mask;
e3790c7d TH	59	if (!(uaddr & alignment) && !(len & alignment))
86db1e29 JA	60	bio = bio_map_user(q, NULL, uaddr, len, reading);
	61	else
	62	bio = bio_copy_user(q, uaddr, len, reading);
	63
	64	if (IS_ERR(bio))
	65	return PTR_ERR(bio);
	66
	67	orig_bio = bio;
	68	blk_queue_bounce(q, &bio);
	69
	70	/*
	71	* We link the bounce buffer in and could have to traverse it
	72	* later so we have to get a ref to prevent it from being freed
	73	*/
	74	bio_get(bio);
	75
	76	ret = blk_rq_append_bio(q, rq, bio);
	77	if (!ret)
	78	return bio->bi_size;
	79
	80	/* if it was boucned we must call the end io function */
	81	bio_endio(bio, 0);
	82	__blk_rq_unmap_user(orig_bio);
	83	bio_put(bio);
	84	return ret;
	85	}
	86
	87	/**
	88	* blk_rq_map_user - map user data to a request, for REQ_BLOCK_PC usage
	89	* @q: request queue where request should be inserted
	90	* @rq: request structure to fill
	91	* @ubuf: the user buffer
	92	* @len: length of user data
	93	*
	94	* Description:
	95	* Data will be mapped directly for zero copy io, if possible. Otherwise
	96	* a kernel bounce buffer is used.
	97	*
	98	* A matching blk_rq_unmap_user() must be issued at the end of io, while
	99	* still in process context.
	100	*
	101	* Note: The mapped bio may need to be bounced through blk_queue_bounce()
	102	* before being submitted to the device, as pages mapped may be out of
	103	* reach. It's the callers responsibility to make sure this happens. The
	104	* original bio must be passed back in to blk_rq_unmap_user() for proper
	105	* unmapping.
	106	*/
	107	int blk_rq_map_user(struct request_queue q, struct request rq,
	108	void __user *ubuf, unsigned long len)
	109	{
	110	unsigned long bytes_read = 0;
	111	struct bio *bio = NULL;
	112	int ret;
	113
	114	if (len > (q->max_hw_sectors << 9))
	115	return -EINVAL;
	116	if (!len \|\| !ubuf)
	117	return -EINVAL;
	118
	119	while (bytes_read != len) {
	120	unsigned long map_len, end, start;
	121
	122	map_len = min_t(unsigned long, len - bytes_read, BIO_MAX_SIZE);
	123	end = ((unsigned long)ubuf + map_len + PAGE_SIZE - 1)
124	>> PAGE_SHIFT;
125	start = (unsigned long)ubuf >> PAGE_SHIFT;
126
127	/*
128	* A bad offset could cause us to require BIO_MAX_PAGES + 1
129	* pages. If this happens we just lower the requested
130	* mapping len by a page so that we can fit
131	*/
132	if (end - start > BIO_MAX_PAGES)
133	map_len -= PAGE_SIZE;
134
135	ret = __blk_rq_map_user(q, rq, ubuf, map_len);
136	if (ret < 0)
137	goto unmap_rq;
138	if (!bio)
139	bio = rq->bio;
140	bytes_read += ret;
141	ubuf += ret;
142	}
143
40b01b9b TH	144	/*
40b01b9b TH	145	* __blk_rq_map_user() copies the buffers if starting address
e3790c7d TH	146	* or length isn't aligned to dma_pad_mask. As the copied
	147	* buffer is always page aligned, we know that there's enough
	148	* room for padding. Extend the last bio and update
	149	* rq->data_len accordingly.
40b01b9b TH	150	*
	151	* On unmap, bio_uncopy_user() will use unmodified
	152	* bio_map_data pointed to by bio->bi_private.
	153	*/
e3790c7d TH	154	if (len & q->dma_pad_mask) {
e3790c7d TH	155	unsigned int pad_len = (q->dma_pad_mask & ~len) + 1;
56d94a37	156	struct bio *tail = rq->biotail;
e3790c7d	157
56d94a37 HH	158	tail->bi_io_vec[tail->bi_vcnt - 1].bv_len += pad_len;
56d94a37 HH	159	tail->bi_size += pad_len;
40b01b9b	160
7a85f889	161	rq->extra_len += pad_len;
40b01b9b TH	162	}
40b01b9b TH	163
86db1e29 JA	164	rq->buffer = rq->data = NULL;
	165	return 0;
	166	unmap_rq:
	167	blk_rq_unmap_user(bio);
84e9e03c	168	rq->bio = NULL;
86db1e29 JA	169	return ret;
86db1e29 JA	170	}
86db1e29 JA	171	EXPORT_SYMBOL(blk_rq_map_user);
	172
	173	/**
	174	* blk_rq_map_user_iov - map user data to a request, for REQ_BLOCK_PC usage
	175	* @q: request queue where request should be inserted
	176	* @rq: request to map data to
	177	* @iov: pointer to the iovec
	178	* @iov_count: number of elements in the iovec
	179	* @len: I/O byte count
	180	*
	181	* Description:
	182	* Data will be mapped directly for zero copy io, if possible. Otherwise
	183	* a kernel bounce buffer is used.
	184	*
	185	* A matching blk_rq_unmap_user() must be issued at the end of io, while
	186	* still in process context.
	187	*
	188	* Note: The mapped bio may need to be bounced through blk_queue_bounce()
	189	* before being submitted to the device, as pages mapped may be out of
	190	* reach. It's the callers responsibility to make sure this happens. The
	191	* original bio must be passed back in to blk_rq_unmap_user() for proper
	192	* unmapping.
	193	*/
	194	int blk_rq_map_user_iov(struct request_queue q, struct request rq,
	195	struct sg_iovec *iov, int iov_count, unsigned int len)
	196	{
	197	struct bio *bio;
afdc1a78 FT	198	int i, read = rq_data_dir(rq) == READ;
afdc1a78 FT	199	int unaligned = 0;
86db1e29 JA	200
	201	if (!iov \|\| iov_count <= 0)
	202	return -EINVAL;
	203
afdc1a78 FT	204	for (i = 0; i < iov_count; i++) {
	205	unsigned long uaddr = (unsigned long)iov[i].iov_base;
	206
	207	if (uaddr & queue_dma_alignment(q)) {
	208	unaligned = 1;
	209	break;
	210	}
	211	}
	212
	213	if (unaligned \|\| (q->dma_pad_mask & len))
	214	bio = bio_copy_user_iov(q, iov, iov_count, read);
	215	else
	216	bio = bio_map_user_iov(q, NULL, iov, iov_count, read);
	217
86db1e29 JA	218	if (IS_ERR(bio))
	219	return PTR_ERR(bio);
	220
	221	if (bio->bi_size != len) {
	222	bio_endio(bio, 0);
	223	bio_unmap_user(bio);
	224	return -EINVAL;
	225	}
	226
	227	bio_get(bio);
	228	blk_rq_bio_prep(q, rq, bio);
	229	rq->buffer = rq->data = NULL;
	230	return 0;
	231	}
86db1e29 JA	232
	233	/**
	234	* blk_rq_unmap_user - unmap a request with user data
	235	* @bio: start of bio list
	236	*
	237	* Description:
	238	* Unmap a rq previously mapped by blk_rq_map_user(). The caller must
	239	* supply the original rq->bio from the blk_rq_map_user() return, since
	240	* the io completion may have changed rq->bio.
	241	*/
	242	int blk_rq_unmap_user(struct bio *bio)
	243	{
	244	struct bio *mapped_bio;
	245	int ret = 0, ret2;
	246
	247	while (bio) {
	248	mapped_bio = bio;
	249	if (unlikely(bio_flagged(bio, BIO_BOUNCED)))
	250	mapped_bio = bio->bi_private;
	251
	252	ret2 = __blk_rq_unmap_user(mapped_bio);
	253	if (ret2 && !ret)
	254	ret = ret2;
	255
	256	mapped_bio = bio;
	257	bio = bio->bi_next;
	258	bio_put(mapped_bio);
	259	}
	260
	261	return ret;
	262	}
86db1e29 JA	263	EXPORT_SYMBOL(blk_rq_unmap_user);
	264
	265	/**
	266	* blk_rq_map_kern - map kernel data to a request, for REQ_BLOCK_PC usage
	267	* @q: request queue where request should be inserted
	268	* @rq: request to fill
	269	* @kbuf: the kernel buffer
	270	* @len: length of user data
	271	* @gfp_mask: memory allocation flags
	272	*/
	273	int blk_rq_map_kern(struct request_queue q, struct request rq, void *kbuf,
	274	unsigned int len, gfp_t gfp_mask)
	275	{
	276	struct bio *bio;
	277
	278	if (len > (q->max_hw_sectors << 9))
	279	return -EINVAL;
	280	if (!len \|\| !kbuf)
	281	return -EINVAL;
	282
	283	bio = bio_map_kern(q, kbuf, len, gfp_mask);
	284	if (IS_ERR(bio))
	285	return PTR_ERR(bio);
	286
	287	if (rq_data_dir(rq) == WRITE)
	288	bio->bi_rw \|= (1 << BIO_RW);
	289
	290	blk_rq_bio_prep(q, rq, bio);
	291	blk_queue_bounce(q, &rq->bio);
	292	rq->buffer = rq->data = NULL;
	293	return 0;
	294	}
86db1e29	295	EXPORT_SYMBOL(blk_rq_map_kern);