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