]> git.proxmox.com Git - mirror_ubuntu-zesty-kernel.git/blame - block/blk-map.c
block: better op and flags encoding
[mirror_ubuntu-zesty-kernel.git] / block / blk-map.c
CommitLineData
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>
26e49cfc 8#include <linux/uio.h>
86db1e29
JA
9
10#include "blk.h"
11
98d61d5b
CH
12/*
13 * Append a bio to a passthrough request. Only works can be merged into
14 * the request based on the driver constraints.
15 */
16int blk_rq_append_bio(struct request *rq, struct bio *bio)
86db1e29 17{
98d61d5b 18 if (!rq->bio) {
ef295ecf
CH
19 rq->cmd_flags &= REQ_OP_MASK;
20 rq->cmd_flags |= (bio->bi_opf & REQ_OP_MASK);
98d61d5b
CH
21 blk_rq_bio_prep(rq->q, rq, bio);
22 } else {
23 if (!ll_back_merge_fn(rq->q, rq, bio))
24 return -EINVAL;
25
86db1e29
JA
26 rq->biotail->bi_next = bio;
27 rq->biotail = bio;
4f024f37 28 rq->__data_len += bio->bi_iter.bi_size;
86db1e29 29 }
98d61d5b 30
86db1e29
JA
31 return 0;
32}
98d61d5b 33EXPORT_SYMBOL(blk_rq_append_bio);
86db1e29
JA
34
35static int __blk_rq_unmap_user(struct bio *bio)
36{
37 int ret = 0;
38
39 if (bio) {
40 if (bio_flagged(bio, BIO_USER_MAPPED))
41 bio_unmap_user(bio);
42 else
43 ret = bio_uncopy_user(bio);
44 }
45
46 return ret;
47}
48
4d6af73d
CH
49static int __blk_rq_map_user_iov(struct request *rq,
50 struct rq_map_data *map_data, struct iov_iter *iter,
51 gfp_t gfp_mask, bool copy)
52{
53 struct request_queue *q = rq->q;
54 struct bio *bio, *orig_bio;
55 int ret;
56
57 if (copy)
58 bio = bio_copy_user_iov(q, map_data, iter, gfp_mask);
59 else
60 bio = bio_map_user_iov(q, iter, gfp_mask);
61
62 if (IS_ERR(bio))
63 return PTR_ERR(bio);
64
65 if (map_data && map_data->null_mapped)
66 bio_set_flag(bio, BIO_NULL_MAPPED);
67
68 iov_iter_advance(iter, bio->bi_iter.bi_size);
69 if (map_data)
70 map_data->offset += bio->bi_iter.bi_size;
71
72 orig_bio = bio;
73 blk_queue_bounce(q, &bio);
74
75 /*
76 * We link the bounce buffer in and could have to traverse it
77 * later so we have to get a ref to prevent it from being freed
78 */
79 bio_get(bio);
80
98d61d5b 81 ret = blk_rq_append_bio(rq, bio);
4d6af73d
CH
82 if (ret) {
83 bio_endio(bio);
84 __blk_rq_unmap_user(orig_bio);
85 bio_put(bio);
86 return ret;
87 }
88
89 return 0;
90}
91
86db1e29 92/**
710027a4 93 * blk_rq_map_user_iov - map user data to a request, for REQ_TYPE_BLOCK_PC usage
86db1e29
JA
94 * @q: request queue where request should be inserted
95 * @rq: request to map data to
152e283f 96 * @map_data: pointer to the rq_map_data holding pages (if necessary)
26e49cfc 97 * @iter: iovec iterator
a3bce90e 98 * @gfp_mask: memory allocation flags
86db1e29
JA
99 *
100 * Description:
710027a4 101 * Data will be mapped directly for zero copy I/O, if possible. Otherwise
86db1e29
JA
102 * a kernel bounce buffer is used.
103 *
710027a4 104 * A matching blk_rq_unmap_user() must be issued at the end of I/O, while
86db1e29
JA
105 * still in process context.
106 *
107 * Note: The mapped bio may need to be bounced through blk_queue_bounce()
108 * before being submitted to the device, as pages mapped may be out of
109 * reach. It's the callers responsibility to make sure this happens. The
110 * original bio must be passed back in to blk_rq_unmap_user() for proper
111 * unmapping.
112 */
113int blk_rq_map_user_iov(struct request_queue *q, struct request *rq,
26e49cfc
KO
114 struct rq_map_data *map_data,
115 const struct iov_iter *iter, gfp_t gfp_mask)
86db1e29 116{
357f435d
AV
117 bool copy = false;
118 unsigned long align = q->dma_pad_mask | queue_dma_alignment(q);
4d6af73d
CH
119 struct bio *bio = NULL;
120 struct iov_iter i;
121 int ret;
86db1e29 122
357f435d
AV
123 if (map_data)
124 copy = true;
125 else if (iov_iter_alignment(iter) & align)
126 copy = true;
127 else if (queue_virt_boundary(q))
128 copy = queue_virt_boundary(q) & iov_iter_gap_alignment(iter);
afdc1a78 129
4d6af73d
CH
130 i = *iter;
131 do {
132 ret =__blk_rq_map_user_iov(rq, map_data, &i, gfp_mask, copy);
133 if (ret)
134 goto unmap_rq;
135 if (!bio)
136 bio = rq->bio;
137 } while (iov_iter_count(&i));
86db1e29 138
f18573ab 139 if (!bio_flagged(bio, BIO_USER_MAPPED))
e8064021 140 rq->rq_flags |= RQF_COPY_USER;
86db1e29 141 return 0;
4d6af73d
CH
142
143unmap_rq:
144 __blk_rq_unmap_user(bio);
145 rq->bio = NULL;
146 return -EINVAL;
86db1e29 147}
152e283f 148EXPORT_SYMBOL(blk_rq_map_user_iov);
86db1e29 149
ddad8dd0
CH
150int blk_rq_map_user(struct request_queue *q, struct request *rq,
151 struct rq_map_data *map_data, void __user *ubuf,
152 unsigned long len, gfp_t gfp_mask)
153{
26e49cfc
KO
154 struct iovec iov;
155 struct iov_iter i;
8f7e885a 156 int ret = import_single_range(rq_data_dir(rq), ubuf, len, &iov, &i);
ddad8dd0 157
8f7e885a
AV
158 if (unlikely(ret < 0))
159 return ret;
ddad8dd0 160
26e49cfc 161 return blk_rq_map_user_iov(q, rq, map_data, &i, gfp_mask);
ddad8dd0
CH
162}
163EXPORT_SYMBOL(blk_rq_map_user);
164
86db1e29
JA
165/**
166 * blk_rq_unmap_user - unmap a request with user data
167 * @bio: start of bio list
168 *
169 * Description:
170 * Unmap a rq previously mapped by blk_rq_map_user(). The caller must
171 * supply the original rq->bio from the blk_rq_map_user() return, since
710027a4 172 * the I/O completion may have changed rq->bio.
86db1e29
JA
173 */
174int blk_rq_unmap_user(struct bio *bio)
175{
176 struct bio *mapped_bio;
177 int ret = 0, ret2;
178
179 while (bio) {
180 mapped_bio = bio;
181 if (unlikely(bio_flagged(bio, BIO_BOUNCED)))
182 mapped_bio = bio->bi_private;
183
184 ret2 = __blk_rq_unmap_user(mapped_bio);
185 if (ret2 && !ret)
186 ret = ret2;
187
188 mapped_bio = bio;
189 bio = bio->bi_next;
190 bio_put(mapped_bio);
191 }
192
193 return ret;
194}
86db1e29
JA
195EXPORT_SYMBOL(blk_rq_unmap_user);
196
197/**
710027a4 198 * blk_rq_map_kern - map kernel data to a request, for REQ_TYPE_BLOCK_PC usage
86db1e29
JA
199 * @q: request queue where request should be inserted
200 * @rq: request to fill
201 * @kbuf: the kernel buffer
202 * @len: length of user data
203 * @gfp_mask: memory allocation flags
68154e90
FT
204 *
205 * Description:
206 * Data will be mapped directly if possible. Otherwise a bounce
e227867f 207 * buffer is used. Can be called multiple times to append multiple
3a5a3927 208 * buffers.
86db1e29
JA
209 */
210int blk_rq_map_kern(struct request_queue *q, struct request *rq, void *kbuf,
211 unsigned int len, gfp_t gfp_mask)
212{
68154e90 213 int reading = rq_data_dir(rq) == READ;
14417799 214 unsigned long addr = (unsigned long) kbuf;
68154e90 215 int do_copy = 0;
86db1e29 216 struct bio *bio;
3a5a3927 217 int ret;
86db1e29 218
ae03bf63 219 if (len > (queue_max_hw_sectors(q) << 9))
86db1e29
JA
220 return -EINVAL;
221 if (!len || !kbuf)
222 return -EINVAL;
223
14417799 224 do_copy = !blk_rq_aligned(q, addr, len) || object_is_on_stack(kbuf);
68154e90
FT
225 if (do_copy)
226 bio = bio_copy_kern(q, kbuf, len, gfp_mask, reading);
227 else
228 bio = bio_map_kern(q, kbuf, len, gfp_mask);
229
86db1e29
JA
230 if (IS_ERR(bio))
231 return PTR_ERR(bio);
232
609f6ea1 233 if (!reading)
95fe6c1a 234 bio_set_op_attrs(bio, REQ_OP_WRITE, 0);
86db1e29 235
68154e90 236 if (do_copy)
e8064021 237 rq->rq_flags |= RQF_COPY_USER;
68154e90 238
98d61d5b 239 ret = blk_rq_append_bio(rq, bio);
3a5a3927
JB
240 if (unlikely(ret)) {
241 /* request is too big */
242 bio_put(bio);
243 return ret;
244 }
245
86db1e29 246 blk_queue_bounce(q, &rq->bio);
86db1e29
JA
247 return 0;
248}
86db1e29 249EXPORT_SYMBOL(blk_rq_map_kern);