]>
Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
0fe23479 | 2 | * Copyright (C) 2001 Jens Axboe <axboe@kernel.dk> |
1da177e4 LT |
3 | * |
4 | * This program is free software; you can redistribute it and/or modify | |
5 | * it under the terms of the GNU General Public License version 2 as | |
6 | * published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
11 | * GNU General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public Licens | |
14 | * along with this program; if not, write to the Free Software | |
15 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111- | |
16 | * | |
17 | */ | |
18 | #include <linux/mm.h> | |
19 | #include <linux/swap.h> | |
20 | #include <linux/bio.h> | |
21 | #include <linux/blkdev.h> | |
a27bb332 | 22 | #include <linux/uio.h> |
852c788f | 23 | #include <linux/iocontext.h> |
1da177e4 LT |
24 | #include <linux/slab.h> |
25 | #include <linux/init.h> | |
26 | #include <linux/kernel.h> | |
630d9c47 | 27 | #include <linux/export.h> |
1da177e4 LT |
28 | #include <linux/mempool.h> |
29 | #include <linux/workqueue.h> | |
852c788f | 30 | #include <linux/cgroup.h> |
1da177e4 | 31 | |
55782138 | 32 | #include <trace/events/block.h> |
9e234eea | 33 | #include "blk.h" |
0bfc2455 | 34 | |
392ddc32 JA |
35 | /* |
36 | * Test patch to inline a certain number of bi_io_vec's inside the bio | |
37 | * itself, to shrink a bio data allocation from two mempool calls to one | |
38 | */ | |
39 | #define BIO_INLINE_VECS 4 | |
40 | ||
1da177e4 LT |
41 | /* |
42 | * if you change this list, also change bvec_alloc or things will | |
43 | * break badly! cannot be bigger than what you can fit into an | |
44 | * unsigned short | |
45 | */ | |
bd5c4fac | 46 | #define BV(x, n) { .nr_vecs = x, .name = "biovec-"#n } |
ed996a52 | 47 | static struct biovec_slab bvec_slabs[BVEC_POOL_NR] __read_mostly = { |
bd5c4fac | 48 | BV(1, 1), BV(4, 4), BV(16, 16), BV(64, 64), BV(128, 128), BV(BIO_MAX_PAGES, max), |
1da177e4 LT |
49 | }; |
50 | #undef BV | |
51 | ||
1da177e4 LT |
52 | /* |
53 | * fs_bio_set is the bio_set containing bio and iovec memory pools used by | |
54 | * IO code that does not need private memory pools. | |
55 | */ | |
f4f8154a | 56 | struct bio_set fs_bio_set; |
3f86a82a | 57 | EXPORT_SYMBOL(fs_bio_set); |
1da177e4 | 58 | |
bb799ca0 JA |
59 | /* |
60 | * Our slab pool management | |
61 | */ | |
62 | struct bio_slab { | |
63 | struct kmem_cache *slab; | |
64 | unsigned int slab_ref; | |
65 | unsigned int slab_size; | |
66 | char name[8]; | |
67 | }; | |
68 | static DEFINE_MUTEX(bio_slab_lock); | |
69 | static struct bio_slab *bio_slabs; | |
70 | static unsigned int bio_slab_nr, bio_slab_max; | |
71 | ||
72 | static struct kmem_cache *bio_find_or_create_slab(unsigned int extra_size) | |
73 | { | |
74 | unsigned int sz = sizeof(struct bio) + extra_size; | |
75 | struct kmem_cache *slab = NULL; | |
389d7b26 | 76 | struct bio_slab *bslab, *new_bio_slabs; |
386bc35a | 77 | unsigned int new_bio_slab_max; |
bb799ca0 JA |
78 | unsigned int i, entry = -1; |
79 | ||
80 | mutex_lock(&bio_slab_lock); | |
81 | ||
82 | i = 0; | |
83 | while (i < bio_slab_nr) { | |
f06f135d | 84 | bslab = &bio_slabs[i]; |
bb799ca0 JA |
85 | |
86 | if (!bslab->slab && entry == -1) | |
87 | entry = i; | |
88 | else if (bslab->slab_size == sz) { | |
89 | slab = bslab->slab; | |
90 | bslab->slab_ref++; | |
91 | break; | |
92 | } | |
93 | i++; | |
94 | } | |
95 | ||
96 | if (slab) | |
97 | goto out_unlock; | |
98 | ||
99 | if (bio_slab_nr == bio_slab_max && entry == -1) { | |
386bc35a | 100 | new_bio_slab_max = bio_slab_max << 1; |
389d7b26 | 101 | new_bio_slabs = krealloc(bio_slabs, |
386bc35a | 102 | new_bio_slab_max * sizeof(struct bio_slab), |
389d7b26 AK |
103 | GFP_KERNEL); |
104 | if (!new_bio_slabs) | |
bb799ca0 | 105 | goto out_unlock; |
386bc35a | 106 | bio_slab_max = new_bio_slab_max; |
389d7b26 | 107 | bio_slabs = new_bio_slabs; |
bb799ca0 JA |
108 | } |
109 | if (entry == -1) | |
110 | entry = bio_slab_nr++; | |
111 | ||
112 | bslab = &bio_slabs[entry]; | |
113 | ||
114 | snprintf(bslab->name, sizeof(bslab->name), "bio-%d", entry); | |
6a241483 MP |
115 | slab = kmem_cache_create(bslab->name, sz, ARCH_KMALLOC_MINALIGN, |
116 | SLAB_HWCACHE_ALIGN, NULL); | |
bb799ca0 JA |
117 | if (!slab) |
118 | goto out_unlock; | |
119 | ||
bb799ca0 JA |
120 | bslab->slab = slab; |
121 | bslab->slab_ref = 1; | |
122 | bslab->slab_size = sz; | |
123 | out_unlock: | |
124 | mutex_unlock(&bio_slab_lock); | |
125 | return slab; | |
126 | } | |
127 | ||
128 | static void bio_put_slab(struct bio_set *bs) | |
129 | { | |
130 | struct bio_slab *bslab = NULL; | |
131 | unsigned int i; | |
132 | ||
133 | mutex_lock(&bio_slab_lock); | |
134 | ||
135 | for (i = 0; i < bio_slab_nr; i++) { | |
136 | if (bs->bio_slab == bio_slabs[i].slab) { | |
137 | bslab = &bio_slabs[i]; | |
138 | break; | |
139 | } | |
140 | } | |
141 | ||
142 | if (WARN(!bslab, KERN_ERR "bio: unable to find slab!\n")) | |
143 | goto out; | |
144 | ||
145 | WARN_ON(!bslab->slab_ref); | |
146 | ||
147 | if (--bslab->slab_ref) | |
148 | goto out; | |
149 | ||
150 | kmem_cache_destroy(bslab->slab); | |
151 | bslab->slab = NULL; | |
152 | ||
153 | out: | |
154 | mutex_unlock(&bio_slab_lock); | |
155 | } | |
156 | ||
7ba1ba12 MP |
157 | unsigned int bvec_nr_vecs(unsigned short idx) |
158 | { | |
159 | return bvec_slabs[idx].nr_vecs; | |
160 | } | |
161 | ||
9f060e22 | 162 | void bvec_free(mempool_t *pool, struct bio_vec *bv, unsigned int idx) |
bb799ca0 | 163 | { |
ed996a52 CH |
164 | if (!idx) |
165 | return; | |
166 | idx--; | |
167 | ||
168 | BIO_BUG_ON(idx >= BVEC_POOL_NR); | |
bb799ca0 | 169 | |
ed996a52 | 170 | if (idx == BVEC_POOL_MAX) { |
9f060e22 | 171 | mempool_free(bv, pool); |
ed996a52 | 172 | } else { |
bb799ca0 JA |
173 | struct biovec_slab *bvs = bvec_slabs + idx; |
174 | ||
175 | kmem_cache_free(bvs->slab, bv); | |
176 | } | |
177 | } | |
178 | ||
9f060e22 KO |
179 | struct bio_vec *bvec_alloc(gfp_t gfp_mask, int nr, unsigned long *idx, |
180 | mempool_t *pool) | |
1da177e4 LT |
181 | { |
182 | struct bio_vec *bvl; | |
1da177e4 | 183 | |
7ff9345f JA |
184 | /* |
185 | * see comment near bvec_array define! | |
186 | */ | |
187 | switch (nr) { | |
188 | case 1: | |
189 | *idx = 0; | |
190 | break; | |
191 | case 2 ... 4: | |
192 | *idx = 1; | |
193 | break; | |
194 | case 5 ... 16: | |
195 | *idx = 2; | |
196 | break; | |
197 | case 17 ... 64: | |
198 | *idx = 3; | |
199 | break; | |
200 | case 65 ... 128: | |
201 | *idx = 4; | |
202 | break; | |
203 | case 129 ... BIO_MAX_PAGES: | |
204 | *idx = 5; | |
205 | break; | |
206 | default: | |
207 | return NULL; | |
208 | } | |
209 | ||
210 | /* | |
211 | * idx now points to the pool we want to allocate from. only the | |
212 | * 1-vec entry pool is mempool backed. | |
213 | */ | |
ed996a52 | 214 | if (*idx == BVEC_POOL_MAX) { |
7ff9345f | 215 | fallback: |
9f060e22 | 216 | bvl = mempool_alloc(pool, gfp_mask); |
7ff9345f JA |
217 | } else { |
218 | struct biovec_slab *bvs = bvec_slabs + *idx; | |
d0164adc | 219 | gfp_t __gfp_mask = gfp_mask & ~(__GFP_DIRECT_RECLAIM | __GFP_IO); |
7ff9345f | 220 | |
0a0d96b0 | 221 | /* |
7ff9345f JA |
222 | * Make this allocation restricted and don't dump info on |
223 | * allocation failures, since we'll fallback to the mempool | |
224 | * in case of failure. | |
0a0d96b0 | 225 | */ |
7ff9345f | 226 | __gfp_mask |= __GFP_NOMEMALLOC | __GFP_NORETRY | __GFP_NOWARN; |
1da177e4 | 227 | |
0a0d96b0 | 228 | /* |
d0164adc | 229 | * Try a slab allocation. If this fails and __GFP_DIRECT_RECLAIM |
7ff9345f | 230 | * is set, retry with the 1-entry mempool |
0a0d96b0 | 231 | */ |
7ff9345f | 232 | bvl = kmem_cache_alloc(bvs->slab, __gfp_mask); |
d0164adc | 233 | if (unlikely(!bvl && (gfp_mask & __GFP_DIRECT_RECLAIM))) { |
ed996a52 | 234 | *idx = BVEC_POOL_MAX; |
7ff9345f JA |
235 | goto fallback; |
236 | } | |
237 | } | |
238 | ||
ed996a52 | 239 | (*idx)++; |
1da177e4 LT |
240 | return bvl; |
241 | } | |
242 | ||
9ae3b3f5 | 243 | void bio_uninit(struct bio *bio) |
1da177e4 | 244 | { |
4254bba1 | 245 | bio_disassociate_task(bio); |
4254bba1 | 246 | } |
9ae3b3f5 | 247 | EXPORT_SYMBOL(bio_uninit); |
7ba1ba12 | 248 | |
4254bba1 KO |
249 | static void bio_free(struct bio *bio) |
250 | { | |
251 | struct bio_set *bs = bio->bi_pool; | |
252 | void *p; | |
253 | ||
9ae3b3f5 | 254 | bio_uninit(bio); |
4254bba1 KO |
255 | |
256 | if (bs) { | |
8aa6ba2f | 257 | bvec_free(&bs->bvec_pool, bio->bi_io_vec, BVEC_POOL_IDX(bio)); |
4254bba1 KO |
258 | |
259 | /* | |
260 | * If we have front padding, adjust the bio pointer before freeing | |
261 | */ | |
262 | p = bio; | |
bb799ca0 JA |
263 | p -= bs->front_pad; |
264 | ||
8aa6ba2f | 265 | mempool_free(p, &bs->bio_pool); |
4254bba1 KO |
266 | } else { |
267 | /* Bio was allocated by bio_kmalloc() */ | |
268 | kfree(bio); | |
269 | } | |
3676347a PO |
270 | } |
271 | ||
9ae3b3f5 JA |
272 | /* |
273 | * Users of this function have their own bio allocation. Subsequently, | |
274 | * they must remember to pair any call to bio_init() with bio_uninit() | |
275 | * when IO has completed, or when the bio is released. | |
276 | */ | |
3a83f467 ML |
277 | void bio_init(struct bio *bio, struct bio_vec *table, |
278 | unsigned short max_vecs) | |
1da177e4 | 279 | { |
2b94de55 | 280 | memset(bio, 0, sizeof(*bio)); |
c4cf5261 | 281 | atomic_set(&bio->__bi_remaining, 1); |
dac56212 | 282 | atomic_set(&bio->__bi_cnt, 1); |
3a83f467 ML |
283 | |
284 | bio->bi_io_vec = table; | |
285 | bio->bi_max_vecs = max_vecs; | |
1da177e4 | 286 | } |
a112a71d | 287 | EXPORT_SYMBOL(bio_init); |
1da177e4 | 288 | |
f44b48c7 KO |
289 | /** |
290 | * bio_reset - reinitialize a bio | |
291 | * @bio: bio to reset | |
292 | * | |
293 | * Description: | |
294 | * After calling bio_reset(), @bio will be in the same state as a freshly | |
295 | * allocated bio returned bio bio_alloc_bioset() - the only fields that are | |
296 | * preserved are the ones that are initialized by bio_alloc_bioset(). See | |
297 | * comment in struct bio. | |
298 | */ | |
299 | void bio_reset(struct bio *bio) | |
300 | { | |
301 | unsigned long flags = bio->bi_flags & (~0UL << BIO_RESET_BITS); | |
302 | ||
9ae3b3f5 | 303 | bio_uninit(bio); |
f44b48c7 KO |
304 | |
305 | memset(bio, 0, BIO_RESET_BYTES); | |
4246a0b6 | 306 | bio->bi_flags = flags; |
c4cf5261 | 307 | atomic_set(&bio->__bi_remaining, 1); |
f44b48c7 KO |
308 | } |
309 | EXPORT_SYMBOL(bio_reset); | |
310 | ||
38f8baae | 311 | static struct bio *__bio_chain_endio(struct bio *bio) |
196d38bc | 312 | { |
4246a0b6 CH |
313 | struct bio *parent = bio->bi_private; |
314 | ||
4e4cbee9 CH |
315 | if (!parent->bi_status) |
316 | parent->bi_status = bio->bi_status; | |
196d38bc | 317 | bio_put(bio); |
38f8baae CH |
318 | return parent; |
319 | } | |
320 | ||
321 | static void bio_chain_endio(struct bio *bio) | |
322 | { | |
323 | bio_endio(__bio_chain_endio(bio)); | |
196d38bc KO |
324 | } |
325 | ||
326 | /** | |
327 | * bio_chain - chain bio completions | |
1051a902 RD |
328 | * @bio: the target bio |
329 | * @parent: the @bio's parent bio | |
196d38bc KO |
330 | * |
331 | * The caller won't have a bi_end_io called when @bio completes - instead, | |
332 | * @parent's bi_end_io won't be called until both @parent and @bio have | |
333 | * completed; the chained bio will also be freed when it completes. | |
334 | * | |
335 | * The caller must not set bi_private or bi_end_io in @bio. | |
336 | */ | |
337 | void bio_chain(struct bio *bio, struct bio *parent) | |
338 | { | |
339 | BUG_ON(bio->bi_private || bio->bi_end_io); | |
340 | ||
341 | bio->bi_private = parent; | |
342 | bio->bi_end_io = bio_chain_endio; | |
c4cf5261 | 343 | bio_inc_remaining(parent); |
196d38bc KO |
344 | } |
345 | EXPORT_SYMBOL(bio_chain); | |
346 | ||
df2cb6da KO |
347 | static void bio_alloc_rescue(struct work_struct *work) |
348 | { | |
349 | struct bio_set *bs = container_of(work, struct bio_set, rescue_work); | |
350 | struct bio *bio; | |
351 | ||
352 | while (1) { | |
353 | spin_lock(&bs->rescue_lock); | |
354 | bio = bio_list_pop(&bs->rescue_list); | |
355 | spin_unlock(&bs->rescue_lock); | |
356 | ||
357 | if (!bio) | |
358 | break; | |
359 | ||
360 | generic_make_request(bio); | |
361 | } | |
362 | } | |
363 | ||
364 | static void punt_bios_to_rescuer(struct bio_set *bs) | |
365 | { | |
366 | struct bio_list punt, nopunt; | |
367 | struct bio *bio; | |
368 | ||
47e0fb46 N |
369 | if (WARN_ON_ONCE(!bs->rescue_workqueue)) |
370 | return; | |
df2cb6da KO |
371 | /* |
372 | * In order to guarantee forward progress we must punt only bios that | |
373 | * were allocated from this bio_set; otherwise, if there was a bio on | |
374 | * there for a stacking driver higher up in the stack, processing it | |
375 | * could require allocating bios from this bio_set, and doing that from | |
376 | * our own rescuer would be bad. | |
377 | * | |
378 | * Since bio lists are singly linked, pop them all instead of trying to | |
379 | * remove from the middle of the list: | |
380 | */ | |
381 | ||
382 | bio_list_init(&punt); | |
383 | bio_list_init(&nopunt); | |
384 | ||
f5fe1b51 | 385 | while ((bio = bio_list_pop(¤t->bio_list[0]))) |
df2cb6da | 386 | bio_list_add(bio->bi_pool == bs ? &punt : &nopunt, bio); |
f5fe1b51 | 387 | current->bio_list[0] = nopunt; |
df2cb6da | 388 | |
f5fe1b51 N |
389 | bio_list_init(&nopunt); |
390 | while ((bio = bio_list_pop(¤t->bio_list[1]))) | |
391 | bio_list_add(bio->bi_pool == bs ? &punt : &nopunt, bio); | |
392 | current->bio_list[1] = nopunt; | |
df2cb6da KO |
393 | |
394 | spin_lock(&bs->rescue_lock); | |
395 | bio_list_merge(&bs->rescue_list, &punt); | |
396 | spin_unlock(&bs->rescue_lock); | |
397 | ||
398 | queue_work(bs->rescue_workqueue, &bs->rescue_work); | |
399 | } | |
400 | ||
1da177e4 LT |
401 | /** |
402 | * bio_alloc_bioset - allocate a bio for I/O | |
519c8e9f | 403 | * @gfp_mask: the GFP_* mask given to the slab allocator |
1da177e4 | 404 | * @nr_iovecs: number of iovecs to pre-allocate |
db18efac | 405 | * @bs: the bio_set to allocate from. |
1da177e4 LT |
406 | * |
407 | * Description: | |
3f86a82a KO |
408 | * If @bs is NULL, uses kmalloc() to allocate the bio; else the allocation is |
409 | * backed by the @bs's mempool. | |
410 | * | |
d0164adc MG |
411 | * When @bs is not NULL, if %__GFP_DIRECT_RECLAIM is set then bio_alloc will |
412 | * always be able to allocate a bio. This is due to the mempool guarantees. | |
413 | * To make this work, callers must never allocate more than 1 bio at a time | |
414 | * from this pool. Callers that need to allocate more than 1 bio must always | |
415 | * submit the previously allocated bio for IO before attempting to allocate | |
416 | * a new one. Failure to do so can cause deadlocks under memory pressure. | |
3f86a82a | 417 | * |
df2cb6da KO |
418 | * Note that when running under generic_make_request() (i.e. any block |
419 | * driver), bios are not submitted until after you return - see the code in | |
420 | * generic_make_request() that converts recursion into iteration, to prevent | |
421 | * stack overflows. | |
422 | * | |
423 | * This would normally mean allocating multiple bios under | |
424 | * generic_make_request() would be susceptible to deadlocks, but we have | |
425 | * deadlock avoidance code that resubmits any blocked bios from a rescuer | |
426 | * thread. | |
427 | * | |
428 | * However, we do not guarantee forward progress for allocations from other | |
429 | * mempools. Doing multiple allocations from the same mempool under | |
430 | * generic_make_request() should be avoided - instead, use bio_set's front_pad | |
431 | * for per bio allocations. | |
432 | * | |
3f86a82a KO |
433 | * RETURNS: |
434 | * Pointer to new bio on success, NULL on failure. | |
435 | */ | |
7a88fa19 DC |
436 | struct bio *bio_alloc_bioset(gfp_t gfp_mask, unsigned int nr_iovecs, |
437 | struct bio_set *bs) | |
1da177e4 | 438 | { |
df2cb6da | 439 | gfp_t saved_gfp = gfp_mask; |
3f86a82a KO |
440 | unsigned front_pad; |
441 | unsigned inline_vecs; | |
34053979 | 442 | struct bio_vec *bvl = NULL; |
451a9ebf TH |
443 | struct bio *bio; |
444 | void *p; | |
445 | ||
3f86a82a KO |
446 | if (!bs) { |
447 | if (nr_iovecs > UIO_MAXIOV) | |
448 | return NULL; | |
449 | ||
450 | p = kmalloc(sizeof(struct bio) + | |
451 | nr_iovecs * sizeof(struct bio_vec), | |
452 | gfp_mask); | |
453 | front_pad = 0; | |
454 | inline_vecs = nr_iovecs; | |
455 | } else { | |
d8f429e1 | 456 | /* should not use nobvec bioset for nr_iovecs > 0 */ |
8aa6ba2f KO |
457 | if (WARN_ON_ONCE(!mempool_initialized(&bs->bvec_pool) && |
458 | nr_iovecs > 0)) | |
d8f429e1 | 459 | return NULL; |
df2cb6da KO |
460 | /* |
461 | * generic_make_request() converts recursion to iteration; this | |
462 | * means if we're running beneath it, any bios we allocate and | |
463 | * submit will not be submitted (and thus freed) until after we | |
464 | * return. | |
465 | * | |
466 | * This exposes us to a potential deadlock if we allocate | |
467 | * multiple bios from the same bio_set() while running | |
468 | * underneath generic_make_request(). If we were to allocate | |
469 | * multiple bios (say a stacking block driver that was splitting | |
470 | * bios), we would deadlock if we exhausted the mempool's | |
471 | * reserve. | |
472 | * | |
473 | * We solve this, and guarantee forward progress, with a rescuer | |
474 | * workqueue per bio_set. If we go to allocate and there are | |
475 | * bios on current->bio_list, we first try the allocation | |
d0164adc MG |
476 | * without __GFP_DIRECT_RECLAIM; if that fails, we punt those |
477 | * bios we would be blocking to the rescuer workqueue before | |
478 | * we retry with the original gfp_flags. | |
df2cb6da KO |
479 | */ |
480 | ||
f5fe1b51 N |
481 | if (current->bio_list && |
482 | (!bio_list_empty(¤t->bio_list[0]) || | |
47e0fb46 N |
483 | !bio_list_empty(¤t->bio_list[1])) && |
484 | bs->rescue_workqueue) | |
d0164adc | 485 | gfp_mask &= ~__GFP_DIRECT_RECLAIM; |
df2cb6da | 486 | |
8aa6ba2f | 487 | p = mempool_alloc(&bs->bio_pool, gfp_mask); |
df2cb6da KO |
488 | if (!p && gfp_mask != saved_gfp) { |
489 | punt_bios_to_rescuer(bs); | |
490 | gfp_mask = saved_gfp; | |
8aa6ba2f | 491 | p = mempool_alloc(&bs->bio_pool, gfp_mask); |
df2cb6da KO |
492 | } |
493 | ||
3f86a82a KO |
494 | front_pad = bs->front_pad; |
495 | inline_vecs = BIO_INLINE_VECS; | |
496 | } | |
497 | ||
451a9ebf TH |
498 | if (unlikely(!p)) |
499 | return NULL; | |
1da177e4 | 500 | |
3f86a82a | 501 | bio = p + front_pad; |
3a83f467 | 502 | bio_init(bio, NULL, 0); |
34053979 | 503 | |
3f86a82a | 504 | if (nr_iovecs > inline_vecs) { |
ed996a52 CH |
505 | unsigned long idx = 0; |
506 | ||
8aa6ba2f | 507 | bvl = bvec_alloc(gfp_mask, nr_iovecs, &idx, &bs->bvec_pool); |
df2cb6da KO |
508 | if (!bvl && gfp_mask != saved_gfp) { |
509 | punt_bios_to_rescuer(bs); | |
510 | gfp_mask = saved_gfp; | |
8aa6ba2f | 511 | bvl = bvec_alloc(gfp_mask, nr_iovecs, &idx, &bs->bvec_pool); |
df2cb6da KO |
512 | } |
513 | ||
34053979 IM |
514 | if (unlikely(!bvl)) |
515 | goto err_free; | |
a38352e0 | 516 | |
ed996a52 | 517 | bio->bi_flags |= idx << BVEC_POOL_OFFSET; |
3f86a82a KO |
518 | } else if (nr_iovecs) { |
519 | bvl = bio->bi_inline_vecs; | |
1da177e4 | 520 | } |
3f86a82a KO |
521 | |
522 | bio->bi_pool = bs; | |
34053979 | 523 | bio->bi_max_vecs = nr_iovecs; |
34053979 | 524 | bio->bi_io_vec = bvl; |
1da177e4 | 525 | return bio; |
34053979 IM |
526 | |
527 | err_free: | |
8aa6ba2f | 528 | mempool_free(p, &bs->bio_pool); |
34053979 | 529 | return NULL; |
1da177e4 | 530 | } |
a112a71d | 531 | EXPORT_SYMBOL(bio_alloc_bioset); |
1da177e4 | 532 | |
38a72dac | 533 | void zero_fill_bio_iter(struct bio *bio, struct bvec_iter start) |
1da177e4 LT |
534 | { |
535 | unsigned long flags; | |
7988613b KO |
536 | struct bio_vec bv; |
537 | struct bvec_iter iter; | |
1da177e4 | 538 | |
38a72dac | 539 | __bio_for_each_segment(bv, bio, iter, start) { |
7988613b KO |
540 | char *data = bvec_kmap_irq(&bv, &flags); |
541 | memset(data, 0, bv.bv_len); | |
542 | flush_dcache_page(bv.bv_page); | |
1da177e4 LT |
543 | bvec_kunmap_irq(data, &flags); |
544 | } | |
545 | } | |
38a72dac | 546 | EXPORT_SYMBOL(zero_fill_bio_iter); |
1da177e4 LT |
547 | |
548 | /** | |
549 | * bio_put - release a reference to a bio | |
550 | * @bio: bio to release reference to | |
551 | * | |
552 | * Description: | |
553 | * Put a reference to a &struct bio, either one you have gotten with | |
9b10f6a9 | 554 | * bio_alloc, bio_get or bio_clone_*. The last put of a bio will free it. |
1da177e4 LT |
555 | **/ |
556 | void bio_put(struct bio *bio) | |
557 | { | |
dac56212 | 558 | if (!bio_flagged(bio, BIO_REFFED)) |
4254bba1 | 559 | bio_free(bio); |
dac56212 JA |
560 | else { |
561 | BIO_BUG_ON(!atomic_read(&bio->__bi_cnt)); | |
562 | ||
563 | /* | |
564 | * last put frees it | |
565 | */ | |
566 | if (atomic_dec_and_test(&bio->__bi_cnt)) | |
567 | bio_free(bio); | |
568 | } | |
1da177e4 | 569 | } |
a112a71d | 570 | EXPORT_SYMBOL(bio_put); |
1da177e4 | 571 | |
165125e1 | 572 | inline int bio_phys_segments(struct request_queue *q, struct bio *bio) |
1da177e4 LT |
573 | { |
574 | if (unlikely(!bio_flagged(bio, BIO_SEG_VALID))) | |
575 | blk_recount_segments(q, bio); | |
576 | ||
577 | return bio->bi_phys_segments; | |
578 | } | |
a112a71d | 579 | EXPORT_SYMBOL(bio_phys_segments); |
1da177e4 | 580 | |
59d276fe KO |
581 | /** |
582 | * __bio_clone_fast - clone a bio that shares the original bio's biovec | |
583 | * @bio: destination bio | |
584 | * @bio_src: bio to clone | |
585 | * | |
586 | * Clone a &bio. Caller will own the returned bio, but not | |
587 | * the actual data it points to. Reference count of returned | |
588 | * bio will be one. | |
589 | * | |
590 | * Caller must ensure that @bio_src is not freed before @bio. | |
591 | */ | |
592 | void __bio_clone_fast(struct bio *bio, struct bio *bio_src) | |
593 | { | |
ed996a52 | 594 | BUG_ON(bio->bi_pool && BVEC_POOL_IDX(bio)); |
59d276fe KO |
595 | |
596 | /* | |
74d46992 | 597 | * most users will be overriding ->bi_disk with a new target, |
59d276fe KO |
598 | * so we don't set nor calculate new physical/hw segment counts here |
599 | */ | |
74d46992 | 600 | bio->bi_disk = bio_src->bi_disk; |
62530ed8 | 601 | bio->bi_partno = bio_src->bi_partno; |
b7c44ed9 | 602 | bio_set_flag(bio, BIO_CLONED); |
111be883 SL |
603 | if (bio_flagged(bio_src, BIO_THROTTLED)) |
604 | bio_set_flag(bio, BIO_THROTTLED); | |
1eff9d32 | 605 | bio->bi_opf = bio_src->bi_opf; |
cb6934f8 | 606 | bio->bi_write_hint = bio_src->bi_write_hint; |
59d276fe KO |
607 | bio->bi_iter = bio_src->bi_iter; |
608 | bio->bi_io_vec = bio_src->bi_io_vec; | |
20bd723e PV |
609 | |
610 | bio_clone_blkcg_association(bio, bio_src); | |
59d276fe KO |
611 | } |
612 | EXPORT_SYMBOL(__bio_clone_fast); | |
613 | ||
614 | /** | |
615 | * bio_clone_fast - clone a bio that shares the original bio's biovec | |
616 | * @bio: bio to clone | |
617 | * @gfp_mask: allocation priority | |
618 | * @bs: bio_set to allocate from | |
619 | * | |
620 | * Like __bio_clone_fast, only also allocates the returned bio | |
621 | */ | |
622 | struct bio *bio_clone_fast(struct bio *bio, gfp_t gfp_mask, struct bio_set *bs) | |
623 | { | |
624 | struct bio *b; | |
625 | ||
626 | b = bio_alloc_bioset(gfp_mask, 0, bs); | |
627 | if (!b) | |
628 | return NULL; | |
629 | ||
630 | __bio_clone_fast(b, bio); | |
631 | ||
632 | if (bio_integrity(bio)) { | |
633 | int ret; | |
634 | ||
635 | ret = bio_integrity_clone(b, bio, gfp_mask); | |
636 | ||
637 | if (ret < 0) { | |
638 | bio_put(b); | |
639 | return NULL; | |
640 | } | |
641 | } | |
642 | ||
643 | return b; | |
644 | } | |
645 | EXPORT_SYMBOL(bio_clone_fast); | |
646 | ||
f4595875 SL |
647 | /** |
648 | * bio_clone_bioset - clone a bio | |
649 | * @bio_src: bio to clone | |
650 | * @gfp_mask: allocation priority | |
651 | * @bs: bio_set to allocate from | |
652 | * | |
653 | * Clone bio. Caller will own the returned bio, but not the actual data it | |
654 | * points to. Reference count of returned bio will be one. | |
655 | */ | |
656 | struct bio *bio_clone_bioset(struct bio *bio_src, gfp_t gfp_mask, | |
657 | struct bio_set *bs) | |
1da177e4 | 658 | { |
bdb53207 KO |
659 | struct bvec_iter iter; |
660 | struct bio_vec bv; | |
661 | struct bio *bio; | |
1da177e4 | 662 | |
bdb53207 KO |
663 | /* |
664 | * Pre immutable biovecs, __bio_clone() used to just do a memcpy from | |
665 | * bio_src->bi_io_vec to bio->bi_io_vec. | |
666 | * | |
667 | * We can't do that anymore, because: | |
668 | * | |
669 | * - The point of cloning the biovec is to produce a bio with a biovec | |
670 | * the caller can modify: bi_idx and bi_bvec_done should be 0. | |
671 | * | |
672 | * - The original bio could've had more than BIO_MAX_PAGES biovecs; if | |
673 | * we tried to clone the whole thing bio_alloc_bioset() would fail. | |
674 | * But the clone should succeed as long as the number of biovecs we | |
675 | * actually need to allocate is fewer than BIO_MAX_PAGES. | |
676 | * | |
677 | * - Lastly, bi_vcnt should not be looked at or relied upon by code | |
678 | * that does not own the bio - reason being drivers don't use it for | |
679 | * iterating over the biovec anymore, so expecting it to be kept up | |
680 | * to date (i.e. for clones that share the parent biovec) is just | |
681 | * asking for trouble and would force extra work on | |
682 | * __bio_clone_fast() anyways. | |
683 | */ | |
684 | ||
f4595875 | 685 | bio = bio_alloc_bioset(gfp_mask, bio_segments(bio_src), bs); |
bdb53207 | 686 | if (!bio) |
7ba1ba12 | 687 | return NULL; |
74d46992 | 688 | bio->bi_disk = bio_src->bi_disk; |
1eff9d32 | 689 | bio->bi_opf = bio_src->bi_opf; |
cb6934f8 | 690 | bio->bi_write_hint = bio_src->bi_write_hint; |
bdb53207 KO |
691 | bio->bi_iter.bi_sector = bio_src->bi_iter.bi_sector; |
692 | bio->bi_iter.bi_size = bio_src->bi_iter.bi_size; | |
7ba1ba12 | 693 | |
7afafc8a AH |
694 | switch (bio_op(bio)) { |
695 | case REQ_OP_DISCARD: | |
696 | case REQ_OP_SECURE_ERASE: | |
a6f0788e | 697 | case REQ_OP_WRITE_ZEROES: |
7afafc8a AH |
698 | break; |
699 | case REQ_OP_WRITE_SAME: | |
8423ae3d | 700 | bio->bi_io_vec[bio->bi_vcnt++] = bio_src->bi_io_vec[0]; |
7afafc8a AH |
701 | break; |
702 | default: | |
f4595875 | 703 | bio_for_each_segment(bv, bio_src, iter) |
7afafc8a AH |
704 | bio->bi_io_vec[bio->bi_vcnt++] = bv; |
705 | break; | |
8423ae3d KO |
706 | } |
707 | ||
bdb53207 KO |
708 | if (bio_integrity(bio_src)) { |
709 | int ret; | |
7ba1ba12 | 710 | |
bdb53207 | 711 | ret = bio_integrity_clone(bio, bio_src, gfp_mask); |
059ea331 | 712 | if (ret < 0) { |
bdb53207 | 713 | bio_put(bio); |
7ba1ba12 | 714 | return NULL; |
059ea331 | 715 | } |
3676347a | 716 | } |
1da177e4 | 717 | |
20bd723e PV |
718 | bio_clone_blkcg_association(bio, bio_src); |
719 | ||
bdb53207 | 720 | return bio; |
1da177e4 | 721 | } |
bf800ef1 | 722 | EXPORT_SYMBOL(bio_clone_bioset); |
1da177e4 LT |
723 | |
724 | /** | |
c66a14d0 KO |
725 | * bio_add_pc_page - attempt to add page to bio |
726 | * @q: the target queue | |
727 | * @bio: destination bio | |
728 | * @page: page to add | |
729 | * @len: vec entry length | |
730 | * @offset: vec entry offset | |
1da177e4 | 731 | * |
c66a14d0 KO |
732 | * Attempt to add a page to the bio_vec maplist. This can fail for a |
733 | * number of reasons, such as the bio being full or target block device | |
734 | * limitations. The target block device must allow bio's up to PAGE_SIZE, | |
735 | * so it is always possible to add a single page to an empty bio. | |
736 | * | |
737 | * This should only be used by REQ_PC bios. | |
1da177e4 | 738 | */ |
c66a14d0 KO |
739 | int bio_add_pc_page(struct request_queue *q, struct bio *bio, struct page |
740 | *page, unsigned int len, unsigned int offset) | |
1da177e4 LT |
741 | { |
742 | int retried_segments = 0; | |
743 | struct bio_vec *bvec; | |
744 | ||
745 | /* | |
746 | * cloned bio must not modify vec list | |
747 | */ | |
748 | if (unlikely(bio_flagged(bio, BIO_CLONED))) | |
749 | return 0; | |
750 | ||
c66a14d0 | 751 | if (((bio->bi_iter.bi_size + len) >> 9) > queue_max_hw_sectors(q)) |
1da177e4 LT |
752 | return 0; |
753 | ||
80cfd548 JA |
754 | /* |
755 | * For filesystems with a blocksize smaller than the pagesize | |
756 | * we will often be called with the same page as last time and | |
757 | * a consecutive offset. Optimize this special case. | |
758 | */ | |
759 | if (bio->bi_vcnt > 0) { | |
760 | struct bio_vec *prev = &bio->bi_io_vec[bio->bi_vcnt - 1]; | |
761 | ||
762 | if (page == prev->bv_page && | |
763 | offset == prev->bv_offset + prev->bv_len) { | |
764 | prev->bv_len += len; | |
fcbf6a08 | 765 | bio->bi_iter.bi_size += len; |
80cfd548 JA |
766 | goto done; |
767 | } | |
66cb45aa JA |
768 | |
769 | /* | |
770 | * If the queue doesn't support SG gaps and adding this | |
771 | * offset would create a gap, disallow it. | |
772 | */ | |
03100aad | 773 | if (bvec_gap_to_prev(q, prev, offset)) |
66cb45aa | 774 | return 0; |
80cfd548 JA |
775 | } |
776 | ||
0aa69fd3 | 777 | if (bio_full(bio)) |
1da177e4 LT |
778 | return 0; |
779 | ||
780 | /* | |
fcbf6a08 ML |
781 | * setup the new entry, we might clear it again later if we |
782 | * cannot add the page | |
783 | */ | |
784 | bvec = &bio->bi_io_vec[bio->bi_vcnt]; | |
785 | bvec->bv_page = page; | |
786 | bvec->bv_len = len; | |
787 | bvec->bv_offset = offset; | |
788 | bio->bi_vcnt++; | |
789 | bio->bi_phys_segments++; | |
790 | bio->bi_iter.bi_size += len; | |
791 | ||
792 | /* | |
793 | * Perform a recount if the number of segments is greater | |
794 | * than queue_max_segments(q). | |
1da177e4 LT |
795 | */ |
796 | ||
fcbf6a08 | 797 | while (bio->bi_phys_segments > queue_max_segments(q)) { |
1da177e4 LT |
798 | |
799 | if (retried_segments) | |
fcbf6a08 | 800 | goto failed; |
1da177e4 LT |
801 | |
802 | retried_segments = 1; | |
803 | blk_recount_segments(q, bio); | |
804 | } | |
805 | ||
1da177e4 | 806 | /* If we may be able to merge these biovecs, force a recount */ |
fcbf6a08 | 807 | if (bio->bi_vcnt > 1 && (BIOVEC_PHYS_MERGEABLE(bvec-1, bvec))) |
b7c44ed9 | 808 | bio_clear_flag(bio, BIO_SEG_VALID); |
1da177e4 | 809 | |
80cfd548 | 810 | done: |
1da177e4 | 811 | return len; |
fcbf6a08 ML |
812 | |
813 | failed: | |
814 | bvec->bv_page = NULL; | |
815 | bvec->bv_len = 0; | |
816 | bvec->bv_offset = 0; | |
817 | bio->bi_vcnt--; | |
818 | bio->bi_iter.bi_size -= len; | |
819 | blk_recount_segments(q, bio); | |
820 | return 0; | |
1da177e4 | 821 | } |
a112a71d | 822 | EXPORT_SYMBOL(bio_add_pc_page); |
6e68af66 | 823 | |
1da177e4 | 824 | /** |
0aa69fd3 CH |
825 | * __bio_try_merge_page - try appending data to an existing bvec. |
826 | * @bio: destination bio | |
827 | * @page: page to add | |
828 | * @len: length of the data to add | |
829 | * @off: offset of the data in @page | |
1da177e4 | 830 | * |
0aa69fd3 CH |
831 | * Try to add the data at @page + @off to the last bvec of @bio. This is a |
832 | * a useful optimisation for file systems with a block size smaller than the | |
833 | * page size. | |
834 | * | |
835 | * Return %true on success or %false on failure. | |
1da177e4 | 836 | */ |
0aa69fd3 CH |
837 | bool __bio_try_merge_page(struct bio *bio, struct page *page, |
838 | unsigned int len, unsigned int off) | |
1da177e4 | 839 | { |
c66a14d0 | 840 | if (WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED))) |
0aa69fd3 | 841 | return false; |
762380ad | 842 | |
c66a14d0 | 843 | if (bio->bi_vcnt > 0) { |
0aa69fd3 | 844 | struct bio_vec *bv = &bio->bi_io_vec[bio->bi_vcnt - 1]; |
58a4915a | 845 | |
0aa69fd3 | 846 | if (page == bv->bv_page && off == bv->bv_offset + bv->bv_len) { |
c66a14d0 | 847 | bv->bv_len += len; |
0aa69fd3 CH |
848 | bio->bi_iter.bi_size += len; |
849 | return true; | |
c66a14d0 KO |
850 | } |
851 | } | |
0aa69fd3 CH |
852 | return false; |
853 | } | |
854 | EXPORT_SYMBOL_GPL(__bio_try_merge_page); | |
c66a14d0 | 855 | |
0aa69fd3 CH |
856 | /** |
857 | * __bio_add_page - add page to a bio in a new segment | |
858 | * @bio: destination bio | |
859 | * @page: page to add | |
860 | * @len: length of the data to add | |
861 | * @off: offset of the data in @page | |
862 | * | |
863 | * Add the data at @page + @off to @bio as a new bvec. The caller must ensure | |
864 | * that @bio has space for another bvec. | |
865 | */ | |
866 | void __bio_add_page(struct bio *bio, struct page *page, | |
867 | unsigned int len, unsigned int off) | |
868 | { | |
869 | struct bio_vec *bv = &bio->bi_io_vec[bio->bi_vcnt]; | |
c66a14d0 | 870 | |
0aa69fd3 CH |
871 | WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED)); |
872 | WARN_ON_ONCE(bio_full(bio)); | |
873 | ||
874 | bv->bv_page = page; | |
875 | bv->bv_offset = off; | |
876 | bv->bv_len = len; | |
c66a14d0 | 877 | |
c66a14d0 | 878 | bio->bi_iter.bi_size += len; |
0aa69fd3 CH |
879 | bio->bi_vcnt++; |
880 | } | |
881 | EXPORT_SYMBOL_GPL(__bio_add_page); | |
882 | ||
883 | /** | |
884 | * bio_add_page - attempt to add page to bio | |
885 | * @bio: destination bio | |
886 | * @page: page to add | |
887 | * @len: vec entry length | |
888 | * @offset: vec entry offset | |
889 | * | |
890 | * Attempt to add a page to the bio_vec maplist. This will only fail | |
891 | * if either bio->bi_vcnt == bio->bi_max_vecs or it's a cloned bio. | |
892 | */ | |
893 | int bio_add_page(struct bio *bio, struct page *page, | |
894 | unsigned int len, unsigned int offset) | |
895 | { | |
896 | if (!__bio_try_merge_page(bio, page, len, offset)) { | |
897 | if (bio_full(bio)) | |
898 | return 0; | |
899 | __bio_add_page(bio, page, len, offset); | |
900 | } | |
c66a14d0 | 901 | return len; |
1da177e4 | 902 | } |
a112a71d | 903 | EXPORT_SYMBOL(bio_add_page); |
1da177e4 | 904 | |
2cefe4db KO |
905 | /** |
906 | * bio_iov_iter_get_pages - pin user or kernel pages and add them to a bio | |
907 | * @bio: bio to add pages to | |
908 | * @iter: iov iterator describing the region to be mapped | |
909 | * | |
910 | * Pins as many pages from *iter and appends them to @bio's bvec array. The | |
911 | * pages will have to be released using put_page() when done. | |
912 | */ | |
913 | int bio_iov_iter_get_pages(struct bio *bio, struct iov_iter *iter) | |
914 | { | |
b403ea24 | 915 | unsigned short nr_pages = bio->bi_max_vecs - bio->bi_vcnt, idx; |
2cefe4db KO |
916 | struct bio_vec *bv = bio->bi_io_vec + bio->bi_vcnt; |
917 | struct page **pages = (struct page **)bv; | |
b403ea24 | 918 | size_t offset; |
2cefe4db KO |
919 | ssize_t size; |
920 | ||
921 | size = iov_iter_get_pages(iter, pages, LONG_MAX, nr_pages, &offset); | |
922 | if (unlikely(size <= 0)) | |
923 | return size ? size : -EFAULT; | |
b403ea24 | 924 | idx = nr_pages = (size + offset + PAGE_SIZE - 1) / PAGE_SIZE; |
2cefe4db KO |
925 | |
926 | /* | |
927 | * Deep magic below: We need to walk the pinned pages backwards | |
928 | * because we are abusing the space allocated for the bio_vecs | |
929 | * for the page array. Because the bio_vecs are larger than the | |
930 | * page pointers by definition this will always work. But it also | |
931 | * means we can't use bio_add_page, so any changes to it's semantics | |
932 | * need to be reflected here as well. | |
933 | */ | |
934 | bio->bi_iter.bi_size += size; | |
935 | bio->bi_vcnt += nr_pages; | |
936 | ||
b403ea24 MW |
937 | while (idx--) { |
938 | bv[idx].bv_page = pages[idx]; | |
939 | bv[idx].bv_len = PAGE_SIZE; | |
940 | bv[idx].bv_offset = 0; | |
2cefe4db KO |
941 | } |
942 | ||
943 | bv[0].bv_offset += offset; | |
944 | bv[0].bv_len -= offset; | |
b403ea24 | 945 | bv[nr_pages - 1].bv_len -= nr_pages * PAGE_SIZE - offset - size; |
2cefe4db KO |
946 | |
947 | iov_iter_advance(iter, size); | |
948 | return 0; | |
949 | } | |
950 | EXPORT_SYMBOL_GPL(bio_iov_iter_get_pages); | |
951 | ||
4246a0b6 | 952 | static void submit_bio_wait_endio(struct bio *bio) |
9e882242 | 953 | { |
65e53aab | 954 | complete(bio->bi_private); |
9e882242 KO |
955 | } |
956 | ||
957 | /** | |
958 | * submit_bio_wait - submit a bio, and wait until it completes | |
9e882242 KO |
959 | * @bio: The &struct bio which describes the I/O |
960 | * | |
961 | * Simple wrapper around submit_bio(). Returns 0 on success, or the error from | |
962 | * bio_endio() on failure. | |
3d289d68 JK |
963 | * |
964 | * WARNING: Unlike to how submit_bio() is usually used, this function does not | |
965 | * result in bio reference to be consumed. The caller must drop the reference | |
966 | * on his own. | |
9e882242 | 967 | */ |
4e49ea4a | 968 | int submit_bio_wait(struct bio *bio) |
9e882242 | 969 | { |
e319e1fb | 970 | DECLARE_COMPLETION_ONSTACK_MAP(done, bio->bi_disk->lockdep_map); |
9e882242 | 971 | |
65e53aab | 972 | bio->bi_private = &done; |
9e882242 | 973 | bio->bi_end_io = submit_bio_wait_endio; |
1eff9d32 | 974 | bio->bi_opf |= REQ_SYNC; |
4e49ea4a | 975 | submit_bio(bio); |
65e53aab | 976 | wait_for_completion_io(&done); |
9e882242 | 977 | |
65e53aab | 978 | return blk_status_to_errno(bio->bi_status); |
9e882242 KO |
979 | } |
980 | EXPORT_SYMBOL(submit_bio_wait); | |
981 | ||
054bdf64 KO |
982 | /** |
983 | * bio_advance - increment/complete a bio by some number of bytes | |
984 | * @bio: bio to advance | |
985 | * @bytes: number of bytes to complete | |
986 | * | |
987 | * This updates bi_sector, bi_size and bi_idx; if the number of bytes to | |
988 | * complete doesn't align with a bvec boundary, then bv_len and bv_offset will | |
989 | * be updated on the last bvec as well. | |
990 | * | |
991 | * @bio will then represent the remaining, uncompleted portion of the io. | |
992 | */ | |
993 | void bio_advance(struct bio *bio, unsigned bytes) | |
994 | { | |
995 | if (bio_integrity(bio)) | |
996 | bio_integrity_advance(bio, bytes); | |
997 | ||
4550dd6c | 998 | bio_advance_iter(bio, &bio->bi_iter, bytes); |
054bdf64 KO |
999 | } |
1000 | EXPORT_SYMBOL(bio_advance); | |
1001 | ||
45db54d5 KO |
1002 | void bio_copy_data_iter(struct bio *dst, struct bvec_iter *dst_iter, |
1003 | struct bio *src, struct bvec_iter *src_iter) | |
16ac3d63 | 1004 | { |
1cb9dda4 | 1005 | struct bio_vec src_bv, dst_bv; |
16ac3d63 | 1006 | void *src_p, *dst_p; |
1cb9dda4 | 1007 | unsigned bytes; |
16ac3d63 | 1008 | |
45db54d5 KO |
1009 | while (src_iter->bi_size && dst_iter->bi_size) { |
1010 | src_bv = bio_iter_iovec(src, *src_iter); | |
1011 | dst_bv = bio_iter_iovec(dst, *dst_iter); | |
1cb9dda4 KO |
1012 | |
1013 | bytes = min(src_bv.bv_len, dst_bv.bv_len); | |
16ac3d63 | 1014 | |
1cb9dda4 KO |
1015 | src_p = kmap_atomic(src_bv.bv_page); |
1016 | dst_p = kmap_atomic(dst_bv.bv_page); | |
16ac3d63 | 1017 | |
1cb9dda4 KO |
1018 | memcpy(dst_p + dst_bv.bv_offset, |
1019 | src_p + src_bv.bv_offset, | |
16ac3d63 KO |
1020 | bytes); |
1021 | ||
1022 | kunmap_atomic(dst_p); | |
1023 | kunmap_atomic(src_p); | |
1024 | ||
6e6e811d KO |
1025 | flush_dcache_page(dst_bv.bv_page); |
1026 | ||
45db54d5 KO |
1027 | bio_advance_iter(src, src_iter, bytes); |
1028 | bio_advance_iter(dst, dst_iter, bytes); | |
16ac3d63 KO |
1029 | } |
1030 | } | |
38a72dac KO |
1031 | EXPORT_SYMBOL(bio_copy_data_iter); |
1032 | ||
1033 | /** | |
45db54d5 KO |
1034 | * bio_copy_data - copy contents of data buffers from one bio to another |
1035 | * @src: source bio | |
1036 | * @dst: destination bio | |
38a72dac KO |
1037 | * |
1038 | * Stops when it reaches the end of either @src or @dst - that is, copies | |
1039 | * min(src->bi_size, dst->bi_size) bytes (or the equivalent for lists of bios). | |
1040 | */ | |
1041 | void bio_copy_data(struct bio *dst, struct bio *src) | |
1042 | { | |
45db54d5 KO |
1043 | struct bvec_iter src_iter = src->bi_iter; |
1044 | struct bvec_iter dst_iter = dst->bi_iter; | |
1045 | ||
1046 | bio_copy_data_iter(dst, &dst_iter, src, &src_iter); | |
38a72dac | 1047 | } |
16ac3d63 KO |
1048 | EXPORT_SYMBOL(bio_copy_data); |
1049 | ||
45db54d5 KO |
1050 | /** |
1051 | * bio_list_copy_data - copy contents of data buffers from one chain of bios to | |
1052 | * another | |
1053 | * @src: source bio list | |
1054 | * @dst: destination bio list | |
1055 | * | |
1056 | * Stops when it reaches the end of either the @src list or @dst list - that is, | |
1057 | * copies min(src->bi_size, dst->bi_size) bytes (or the equivalent for lists of | |
1058 | * bios). | |
1059 | */ | |
1060 | void bio_list_copy_data(struct bio *dst, struct bio *src) | |
1061 | { | |
1062 | struct bvec_iter src_iter = src->bi_iter; | |
1063 | struct bvec_iter dst_iter = dst->bi_iter; | |
1064 | ||
1065 | while (1) { | |
1066 | if (!src_iter.bi_size) { | |
1067 | src = src->bi_next; | |
1068 | if (!src) | |
1069 | break; | |
1070 | ||
1071 | src_iter = src->bi_iter; | |
1072 | } | |
1073 | ||
1074 | if (!dst_iter.bi_size) { | |
1075 | dst = dst->bi_next; | |
1076 | if (!dst) | |
1077 | break; | |
1078 | ||
1079 | dst_iter = dst->bi_iter; | |
1080 | } | |
1081 | ||
1082 | bio_copy_data_iter(dst, &dst_iter, src, &src_iter); | |
1083 | } | |
1084 | } | |
1085 | EXPORT_SYMBOL(bio_list_copy_data); | |
1086 | ||
1da177e4 | 1087 | struct bio_map_data { |
152e283f | 1088 | int is_our_pages; |
26e49cfc KO |
1089 | struct iov_iter iter; |
1090 | struct iovec iov[]; | |
1da177e4 LT |
1091 | }; |
1092 | ||
0e5b935d | 1093 | static struct bio_map_data *bio_alloc_map_data(struct iov_iter *data, |
76029ff3 | 1094 | gfp_t gfp_mask) |
1da177e4 | 1095 | { |
0e5b935d AV |
1096 | struct bio_map_data *bmd; |
1097 | if (data->nr_segs > UIO_MAXIOV) | |
f3f63c1c | 1098 | return NULL; |
1da177e4 | 1099 | |
0e5b935d AV |
1100 | bmd = kmalloc(sizeof(struct bio_map_data) + |
1101 | sizeof(struct iovec) * data->nr_segs, gfp_mask); | |
1102 | if (!bmd) | |
1103 | return NULL; | |
1104 | memcpy(bmd->iov, data->iov, sizeof(struct iovec) * data->nr_segs); | |
1105 | bmd->iter = *data; | |
1106 | bmd->iter.iov = bmd->iov; | |
1107 | return bmd; | |
1da177e4 LT |
1108 | } |
1109 | ||
9124d3fe DP |
1110 | /** |
1111 | * bio_copy_from_iter - copy all pages from iov_iter to bio | |
1112 | * @bio: The &struct bio which describes the I/O as destination | |
1113 | * @iter: iov_iter as source | |
1114 | * | |
1115 | * Copy all pages from iov_iter to bio. | |
1116 | * Returns 0 on success, or error on failure. | |
1117 | */ | |
98a09d61 | 1118 | static int bio_copy_from_iter(struct bio *bio, struct iov_iter *iter) |
c5dec1c3 | 1119 | { |
9124d3fe | 1120 | int i; |
c5dec1c3 | 1121 | struct bio_vec *bvec; |
c5dec1c3 | 1122 | |
d74c6d51 | 1123 | bio_for_each_segment_all(bvec, bio, i) { |
9124d3fe | 1124 | ssize_t ret; |
c5dec1c3 | 1125 | |
9124d3fe DP |
1126 | ret = copy_page_from_iter(bvec->bv_page, |
1127 | bvec->bv_offset, | |
1128 | bvec->bv_len, | |
98a09d61 | 1129 | iter); |
9124d3fe | 1130 | |
98a09d61 | 1131 | if (!iov_iter_count(iter)) |
9124d3fe DP |
1132 | break; |
1133 | ||
1134 | if (ret < bvec->bv_len) | |
1135 | return -EFAULT; | |
c5dec1c3 FT |
1136 | } |
1137 | ||
9124d3fe DP |
1138 | return 0; |
1139 | } | |
1140 | ||
1141 | /** | |
1142 | * bio_copy_to_iter - copy all pages from bio to iov_iter | |
1143 | * @bio: The &struct bio which describes the I/O as source | |
1144 | * @iter: iov_iter as destination | |
1145 | * | |
1146 | * Copy all pages from bio to iov_iter. | |
1147 | * Returns 0 on success, or error on failure. | |
1148 | */ | |
1149 | static int bio_copy_to_iter(struct bio *bio, struct iov_iter iter) | |
1150 | { | |
1151 | int i; | |
1152 | struct bio_vec *bvec; | |
1153 | ||
1154 | bio_for_each_segment_all(bvec, bio, i) { | |
1155 | ssize_t ret; | |
1156 | ||
1157 | ret = copy_page_to_iter(bvec->bv_page, | |
1158 | bvec->bv_offset, | |
1159 | bvec->bv_len, | |
1160 | &iter); | |
1161 | ||
1162 | if (!iov_iter_count(&iter)) | |
1163 | break; | |
1164 | ||
1165 | if (ret < bvec->bv_len) | |
1166 | return -EFAULT; | |
1167 | } | |
1168 | ||
1169 | return 0; | |
c5dec1c3 FT |
1170 | } |
1171 | ||
491221f8 | 1172 | void bio_free_pages(struct bio *bio) |
1dfa0f68 CH |
1173 | { |
1174 | struct bio_vec *bvec; | |
1175 | int i; | |
1176 | ||
1177 | bio_for_each_segment_all(bvec, bio, i) | |
1178 | __free_page(bvec->bv_page); | |
1179 | } | |
491221f8 | 1180 | EXPORT_SYMBOL(bio_free_pages); |
1dfa0f68 | 1181 | |
1da177e4 LT |
1182 | /** |
1183 | * bio_uncopy_user - finish previously mapped bio | |
1184 | * @bio: bio being terminated | |
1185 | * | |
ddad8dd0 | 1186 | * Free pages allocated from bio_copy_user_iov() and write back data |
1da177e4 LT |
1187 | * to user space in case of a read. |
1188 | */ | |
1189 | int bio_uncopy_user(struct bio *bio) | |
1190 | { | |
1191 | struct bio_map_data *bmd = bio->bi_private; | |
1dfa0f68 | 1192 | int ret = 0; |
1da177e4 | 1193 | |
35dc2483 RD |
1194 | if (!bio_flagged(bio, BIO_NULL_MAPPED)) { |
1195 | /* | |
1196 | * if we're in a workqueue, the request is orphaned, so | |
2d99b55d HR |
1197 | * don't copy into a random user address space, just free |
1198 | * and return -EINTR so user space doesn't expect any data. | |
35dc2483 | 1199 | */ |
2d99b55d HR |
1200 | if (!current->mm) |
1201 | ret = -EINTR; | |
1202 | else if (bio_data_dir(bio) == READ) | |
9124d3fe | 1203 | ret = bio_copy_to_iter(bio, bmd->iter); |
1dfa0f68 CH |
1204 | if (bmd->is_our_pages) |
1205 | bio_free_pages(bio); | |
35dc2483 | 1206 | } |
c8db4448 | 1207 | kfree(bmd); |
1da177e4 LT |
1208 | bio_put(bio); |
1209 | return ret; | |
1210 | } | |
1211 | ||
1212 | /** | |
c5dec1c3 | 1213 | * bio_copy_user_iov - copy user data to bio |
26e49cfc KO |
1214 | * @q: destination block queue |
1215 | * @map_data: pointer to the rq_map_data holding pages (if necessary) | |
1216 | * @iter: iovec iterator | |
1217 | * @gfp_mask: memory allocation flags | |
1da177e4 LT |
1218 | * |
1219 | * Prepares and returns a bio for indirect user io, bouncing data | |
1220 | * to/from kernel pages as necessary. Must be paired with | |
1221 | * call bio_uncopy_user() on io completion. | |
1222 | */ | |
152e283f FT |
1223 | struct bio *bio_copy_user_iov(struct request_queue *q, |
1224 | struct rq_map_data *map_data, | |
e81cef5d | 1225 | struct iov_iter *iter, |
26e49cfc | 1226 | gfp_t gfp_mask) |
1da177e4 | 1227 | { |
1da177e4 | 1228 | struct bio_map_data *bmd; |
1da177e4 LT |
1229 | struct page *page; |
1230 | struct bio *bio; | |
d16d44eb AV |
1231 | int i = 0, ret; |
1232 | int nr_pages; | |
26e49cfc | 1233 | unsigned int len = iter->count; |
bd5cecea | 1234 | unsigned int offset = map_data ? offset_in_page(map_data->offset) : 0; |
1da177e4 | 1235 | |
0e5b935d | 1236 | bmd = bio_alloc_map_data(iter, gfp_mask); |
1da177e4 LT |
1237 | if (!bmd) |
1238 | return ERR_PTR(-ENOMEM); | |
1239 | ||
26e49cfc KO |
1240 | /* |
1241 | * We need to do a deep copy of the iov_iter including the iovecs. | |
1242 | * The caller provided iov might point to an on-stack or otherwise | |
1243 | * shortlived one. | |
1244 | */ | |
1245 | bmd->is_our_pages = map_data ? 0 : 1; | |
26e49cfc | 1246 | |
d16d44eb AV |
1247 | nr_pages = DIV_ROUND_UP(offset + len, PAGE_SIZE); |
1248 | if (nr_pages > BIO_MAX_PAGES) | |
1249 | nr_pages = BIO_MAX_PAGES; | |
26e49cfc | 1250 | |
1da177e4 | 1251 | ret = -ENOMEM; |
a9e9dc24 | 1252 | bio = bio_kmalloc(gfp_mask, nr_pages); |
1da177e4 LT |
1253 | if (!bio) |
1254 | goto out_bmd; | |
1255 | ||
1da177e4 | 1256 | ret = 0; |
56c451f4 FT |
1257 | |
1258 | if (map_data) { | |
e623ddb4 | 1259 | nr_pages = 1 << map_data->page_order; |
56c451f4 FT |
1260 | i = map_data->offset / PAGE_SIZE; |
1261 | } | |
1da177e4 | 1262 | while (len) { |
e623ddb4 | 1263 | unsigned int bytes = PAGE_SIZE; |
1da177e4 | 1264 | |
56c451f4 FT |
1265 | bytes -= offset; |
1266 | ||
1da177e4 LT |
1267 | if (bytes > len) |
1268 | bytes = len; | |
1269 | ||
152e283f | 1270 | if (map_data) { |
e623ddb4 | 1271 | if (i == map_data->nr_entries * nr_pages) { |
152e283f FT |
1272 | ret = -ENOMEM; |
1273 | break; | |
1274 | } | |
e623ddb4 FT |
1275 | |
1276 | page = map_data->pages[i / nr_pages]; | |
1277 | page += (i % nr_pages); | |
1278 | ||
1279 | i++; | |
1280 | } else { | |
152e283f | 1281 | page = alloc_page(q->bounce_gfp | gfp_mask); |
e623ddb4 FT |
1282 | if (!page) { |
1283 | ret = -ENOMEM; | |
1284 | break; | |
1285 | } | |
1da177e4 LT |
1286 | } |
1287 | ||
56c451f4 | 1288 | if (bio_add_pc_page(q, bio, page, bytes, offset) < bytes) |
1da177e4 | 1289 | break; |
1da177e4 LT |
1290 | |
1291 | len -= bytes; | |
56c451f4 | 1292 | offset = 0; |
1da177e4 LT |
1293 | } |
1294 | ||
1295 | if (ret) | |
1296 | goto cleanup; | |
1297 | ||
2884d0be AV |
1298 | if (map_data) |
1299 | map_data->offset += bio->bi_iter.bi_size; | |
1300 | ||
1da177e4 LT |
1301 | /* |
1302 | * success | |
1303 | */ | |
26e49cfc | 1304 | if (((iter->type & WRITE) && (!map_data || !map_data->null_mapped)) || |
ecb554a8 | 1305 | (map_data && map_data->from_user)) { |
98a09d61 | 1306 | ret = bio_copy_from_iter(bio, iter); |
c5dec1c3 FT |
1307 | if (ret) |
1308 | goto cleanup; | |
98a09d61 AV |
1309 | } else { |
1310 | iov_iter_advance(iter, bio->bi_iter.bi_size); | |
1da177e4 LT |
1311 | } |
1312 | ||
26e49cfc | 1313 | bio->bi_private = bmd; |
2884d0be AV |
1314 | if (map_data && map_data->null_mapped) |
1315 | bio_set_flag(bio, BIO_NULL_MAPPED); | |
1da177e4 LT |
1316 | return bio; |
1317 | cleanup: | |
152e283f | 1318 | if (!map_data) |
1dfa0f68 | 1319 | bio_free_pages(bio); |
1da177e4 LT |
1320 | bio_put(bio); |
1321 | out_bmd: | |
c8db4448 | 1322 | kfree(bmd); |
1da177e4 LT |
1323 | return ERR_PTR(ret); |
1324 | } | |
1325 | ||
37f19e57 CH |
1326 | /** |
1327 | * bio_map_user_iov - map user iovec into bio | |
1328 | * @q: the struct request_queue for the bio | |
1329 | * @iter: iovec iterator | |
1330 | * @gfp_mask: memory allocation flags | |
1331 | * | |
1332 | * Map the user space address into a bio suitable for io to a block | |
1333 | * device. Returns an error pointer in case of error. | |
1334 | */ | |
1335 | struct bio *bio_map_user_iov(struct request_queue *q, | |
e81cef5d | 1336 | struct iov_iter *iter, |
37f19e57 | 1337 | gfp_t gfp_mask) |
1da177e4 | 1338 | { |
26e49cfc | 1339 | int j; |
1da177e4 | 1340 | struct bio *bio; |
076098e5 | 1341 | int ret; |
2b04e8f6 | 1342 | struct bio_vec *bvec; |
1da177e4 | 1343 | |
b282cc76 | 1344 | if (!iov_iter_count(iter)) |
1da177e4 LT |
1345 | return ERR_PTR(-EINVAL); |
1346 | ||
b282cc76 | 1347 | bio = bio_kmalloc(gfp_mask, iov_iter_npages(iter, BIO_MAX_PAGES)); |
1da177e4 LT |
1348 | if (!bio) |
1349 | return ERR_PTR(-ENOMEM); | |
1350 | ||
0a0f1513 | 1351 | while (iov_iter_count(iter)) { |
629e42bc | 1352 | struct page **pages; |
076098e5 AV |
1353 | ssize_t bytes; |
1354 | size_t offs, added = 0; | |
1355 | int npages; | |
1da177e4 | 1356 | |
0a0f1513 | 1357 | bytes = iov_iter_get_pages_alloc(iter, &pages, LONG_MAX, &offs); |
076098e5 AV |
1358 | if (unlikely(bytes <= 0)) { |
1359 | ret = bytes ? bytes : -EFAULT; | |
f1970baf | 1360 | goto out_unmap; |
99172157 | 1361 | } |
f1970baf | 1362 | |
076098e5 | 1363 | npages = DIV_ROUND_UP(offs + bytes, PAGE_SIZE); |
f1970baf | 1364 | |
98f0bc99 AV |
1365 | if (unlikely(offs & queue_dma_alignment(q))) { |
1366 | ret = -EINVAL; | |
1367 | j = 0; | |
1368 | } else { | |
1369 | for (j = 0; j < npages; j++) { | |
1370 | struct page *page = pages[j]; | |
1371 | unsigned int n = PAGE_SIZE - offs; | |
1372 | unsigned short prev_bi_vcnt = bio->bi_vcnt; | |
f1970baf | 1373 | |
98f0bc99 AV |
1374 | if (n > bytes) |
1375 | n = bytes; | |
95d78c28 | 1376 | |
98f0bc99 AV |
1377 | if (!bio_add_pc_page(q, bio, page, n, offs)) |
1378 | break; | |
1da177e4 | 1379 | |
98f0bc99 AV |
1380 | /* |
1381 | * check if vector was merged with previous | |
1382 | * drop page reference if needed | |
1383 | */ | |
1384 | if (bio->bi_vcnt == prev_bi_vcnt) | |
1385 | put_page(page); | |
1386 | ||
1387 | added += n; | |
1388 | bytes -= n; | |
1389 | offs = 0; | |
1390 | } | |
0a0f1513 | 1391 | iov_iter_advance(iter, added); |
f1970baf | 1392 | } |
1da177e4 | 1393 | /* |
f1970baf | 1394 | * release the pages we didn't map into the bio, if any |
1da177e4 | 1395 | */ |
629e42bc | 1396 | while (j < npages) |
09cbfeaf | 1397 | put_page(pages[j++]); |
629e42bc | 1398 | kvfree(pages); |
e2e115d1 AV |
1399 | /* couldn't stuff something into bio? */ |
1400 | if (bytes) | |
1401 | break; | |
1da177e4 LT |
1402 | } |
1403 | ||
b7c44ed9 | 1404 | bio_set_flag(bio, BIO_USER_MAPPED); |
37f19e57 CH |
1405 | |
1406 | /* | |
5fad1b64 | 1407 | * subtle -- if bio_map_user_iov() ended up bouncing a bio, |
37f19e57 CH |
1408 | * it would normally disappear when its bi_end_io is run. |
1409 | * however, we need it for the unmap, so grab an extra | |
1410 | * reference to it | |
1411 | */ | |
1412 | bio_get(bio); | |
1da177e4 | 1413 | return bio; |
f1970baf JB |
1414 | |
1415 | out_unmap: | |
2b04e8f6 AV |
1416 | bio_for_each_segment_all(bvec, bio, j) { |
1417 | put_page(bvec->bv_page); | |
f1970baf | 1418 | } |
1da177e4 LT |
1419 | bio_put(bio); |
1420 | return ERR_PTR(ret); | |
1421 | } | |
1422 | ||
1da177e4 LT |
1423 | static void __bio_unmap_user(struct bio *bio) |
1424 | { | |
1425 | struct bio_vec *bvec; | |
1426 | int i; | |
1427 | ||
1428 | /* | |
1429 | * make sure we dirty pages we wrote to | |
1430 | */ | |
d74c6d51 | 1431 | bio_for_each_segment_all(bvec, bio, i) { |
1da177e4 LT |
1432 | if (bio_data_dir(bio) == READ) |
1433 | set_page_dirty_lock(bvec->bv_page); | |
1434 | ||
09cbfeaf | 1435 | put_page(bvec->bv_page); |
1da177e4 LT |
1436 | } |
1437 | ||
1438 | bio_put(bio); | |
1439 | } | |
1440 | ||
1441 | /** | |
1442 | * bio_unmap_user - unmap a bio | |
1443 | * @bio: the bio being unmapped | |
1444 | * | |
5fad1b64 BVA |
1445 | * Unmap a bio previously mapped by bio_map_user_iov(). Must be called from |
1446 | * process context. | |
1da177e4 LT |
1447 | * |
1448 | * bio_unmap_user() may sleep. | |
1449 | */ | |
1450 | void bio_unmap_user(struct bio *bio) | |
1451 | { | |
1452 | __bio_unmap_user(bio); | |
1453 | bio_put(bio); | |
1454 | } | |
1455 | ||
4246a0b6 | 1456 | static void bio_map_kern_endio(struct bio *bio) |
b823825e | 1457 | { |
b823825e | 1458 | bio_put(bio); |
b823825e JA |
1459 | } |
1460 | ||
75c72b83 CH |
1461 | /** |
1462 | * bio_map_kern - map kernel address into bio | |
1463 | * @q: the struct request_queue for the bio | |
1464 | * @data: pointer to buffer to map | |
1465 | * @len: length in bytes | |
1466 | * @gfp_mask: allocation flags for bio allocation | |
1467 | * | |
1468 | * Map the kernel address into a bio suitable for io to a block | |
1469 | * device. Returns an error pointer in case of error. | |
1470 | */ | |
1471 | struct bio *bio_map_kern(struct request_queue *q, void *data, unsigned int len, | |
1472 | gfp_t gfp_mask) | |
df46b9a4 MC |
1473 | { |
1474 | unsigned long kaddr = (unsigned long)data; | |
1475 | unsigned long end = (kaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
1476 | unsigned long start = kaddr >> PAGE_SHIFT; | |
1477 | const int nr_pages = end - start; | |
1478 | int offset, i; | |
1479 | struct bio *bio; | |
1480 | ||
a9e9dc24 | 1481 | bio = bio_kmalloc(gfp_mask, nr_pages); |
df46b9a4 MC |
1482 | if (!bio) |
1483 | return ERR_PTR(-ENOMEM); | |
1484 | ||
1485 | offset = offset_in_page(kaddr); | |
1486 | for (i = 0; i < nr_pages; i++) { | |
1487 | unsigned int bytes = PAGE_SIZE - offset; | |
1488 | ||
1489 | if (len <= 0) | |
1490 | break; | |
1491 | ||
1492 | if (bytes > len) | |
1493 | bytes = len; | |
1494 | ||
defd94b7 | 1495 | if (bio_add_pc_page(q, bio, virt_to_page(data), bytes, |
75c72b83 CH |
1496 | offset) < bytes) { |
1497 | /* we don't support partial mappings */ | |
1498 | bio_put(bio); | |
1499 | return ERR_PTR(-EINVAL); | |
1500 | } | |
df46b9a4 MC |
1501 | |
1502 | data += bytes; | |
1503 | len -= bytes; | |
1504 | offset = 0; | |
1505 | } | |
1506 | ||
b823825e | 1507 | bio->bi_end_io = bio_map_kern_endio; |
df46b9a4 MC |
1508 | return bio; |
1509 | } | |
a112a71d | 1510 | EXPORT_SYMBOL(bio_map_kern); |
df46b9a4 | 1511 | |
4246a0b6 | 1512 | static void bio_copy_kern_endio(struct bio *bio) |
68154e90 | 1513 | { |
1dfa0f68 CH |
1514 | bio_free_pages(bio); |
1515 | bio_put(bio); | |
1516 | } | |
1517 | ||
4246a0b6 | 1518 | static void bio_copy_kern_endio_read(struct bio *bio) |
1dfa0f68 | 1519 | { |
42d2683a | 1520 | char *p = bio->bi_private; |
1dfa0f68 | 1521 | struct bio_vec *bvec; |
68154e90 FT |
1522 | int i; |
1523 | ||
d74c6d51 | 1524 | bio_for_each_segment_all(bvec, bio, i) { |
1dfa0f68 | 1525 | memcpy(p, page_address(bvec->bv_page), bvec->bv_len); |
c8db4448 | 1526 | p += bvec->bv_len; |
68154e90 FT |
1527 | } |
1528 | ||
4246a0b6 | 1529 | bio_copy_kern_endio(bio); |
68154e90 FT |
1530 | } |
1531 | ||
1532 | /** | |
1533 | * bio_copy_kern - copy kernel address into bio | |
1534 | * @q: the struct request_queue for the bio | |
1535 | * @data: pointer to buffer to copy | |
1536 | * @len: length in bytes | |
1537 | * @gfp_mask: allocation flags for bio and page allocation | |
ffee0259 | 1538 | * @reading: data direction is READ |
68154e90 FT |
1539 | * |
1540 | * copy the kernel address into a bio suitable for io to a block | |
1541 | * device. Returns an error pointer in case of error. | |
1542 | */ | |
1543 | struct bio *bio_copy_kern(struct request_queue *q, void *data, unsigned int len, | |
1544 | gfp_t gfp_mask, int reading) | |
1545 | { | |
42d2683a CH |
1546 | unsigned long kaddr = (unsigned long)data; |
1547 | unsigned long end = (kaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
1548 | unsigned long start = kaddr >> PAGE_SHIFT; | |
42d2683a CH |
1549 | struct bio *bio; |
1550 | void *p = data; | |
1dfa0f68 | 1551 | int nr_pages = 0; |
68154e90 | 1552 | |
42d2683a CH |
1553 | /* |
1554 | * Overflow, abort | |
1555 | */ | |
1556 | if (end < start) | |
1557 | return ERR_PTR(-EINVAL); | |
68154e90 | 1558 | |
42d2683a CH |
1559 | nr_pages = end - start; |
1560 | bio = bio_kmalloc(gfp_mask, nr_pages); | |
1561 | if (!bio) | |
1562 | return ERR_PTR(-ENOMEM); | |
68154e90 | 1563 | |
42d2683a CH |
1564 | while (len) { |
1565 | struct page *page; | |
1566 | unsigned int bytes = PAGE_SIZE; | |
68154e90 | 1567 | |
42d2683a CH |
1568 | if (bytes > len) |
1569 | bytes = len; | |
1570 | ||
1571 | page = alloc_page(q->bounce_gfp | gfp_mask); | |
1572 | if (!page) | |
1573 | goto cleanup; | |
1574 | ||
1575 | if (!reading) | |
1576 | memcpy(page_address(page), p, bytes); | |
1577 | ||
1578 | if (bio_add_pc_page(q, bio, page, bytes, 0) < bytes) | |
1579 | break; | |
1580 | ||
1581 | len -= bytes; | |
1582 | p += bytes; | |
68154e90 FT |
1583 | } |
1584 | ||
1dfa0f68 CH |
1585 | if (reading) { |
1586 | bio->bi_end_io = bio_copy_kern_endio_read; | |
1587 | bio->bi_private = data; | |
1588 | } else { | |
1589 | bio->bi_end_io = bio_copy_kern_endio; | |
1dfa0f68 | 1590 | } |
76029ff3 | 1591 | |
68154e90 | 1592 | return bio; |
42d2683a CH |
1593 | |
1594 | cleanup: | |
1dfa0f68 | 1595 | bio_free_pages(bio); |
42d2683a CH |
1596 | bio_put(bio); |
1597 | return ERR_PTR(-ENOMEM); | |
68154e90 FT |
1598 | } |
1599 | ||
1da177e4 LT |
1600 | /* |
1601 | * bio_set_pages_dirty() and bio_check_pages_dirty() are support functions | |
1602 | * for performing direct-IO in BIOs. | |
1603 | * | |
1604 | * The problem is that we cannot run set_page_dirty() from interrupt context | |
1605 | * because the required locks are not interrupt-safe. So what we can do is to | |
1606 | * mark the pages dirty _before_ performing IO. And in interrupt context, | |
1607 | * check that the pages are still dirty. If so, fine. If not, redirty them | |
1608 | * in process context. | |
1609 | * | |
1610 | * We special-case compound pages here: normally this means reads into hugetlb | |
1611 | * pages. The logic in here doesn't really work right for compound pages | |
1612 | * because the VM does not uniformly chase down the head page in all cases. | |
1613 | * But dirtiness of compound pages is pretty meaningless anyway: the VM doesn't | |
1614 | * handle them at all. So we skip compound pages here at an early stage. | |
1615 | * | |
1616 | * Note that this code is very hard to test under normal circumstances because | |
1617 | * direct-io pins the pages with get_user_pages(). This makes | |
1618 | * is_page_cache_freeable return false, and the VM will not clean the pages. | |
0d5c3eba | 1619 | * But other code (eg, flusher threads) could clean the pages if they are mapped |
1da177e4 LT |
1620 | * pagecache. |
1621 | * | |
1622 | * Simply disabling the call to bio_set_pages_dirty() is a good way to test the | |
1623 | * deferred bio dirtying paths. | |
1624 | */ | |
1625 | ||
1626 | /* | |
1627 | * bio_set_pages_dirty() will mark all the bio's pages as dirty. | |
1628 | */ | |
1629 | void bio_set_pages_dirty(struct bio *bio) | |
1630 | { | |
cb34e057 | 1631 | struct bio_vec *bvec; |
1da177e4 LT |
1632 | int i; |
1633 | ||
cb34e057 KO |
1634 | bio_for_each_segment_all(bvec, bio, i) { |
1635 | struct page *page = bvec->bv_page; | |
1da177e4 LT |
1636 | |
1637 | if (page && !PageCompound(page)) | |
1638 | set_page_dirty_lock(page); | |
1639 | } | |
1640 | } | |
1900fcc4 | 1641 | EXPORT_SYMBOL_GPL(bio_set_pages_dirty); |
1da177e4 | 1642 | |
86b6c7a7 | 1643 | static void bio_release_pages(struct bio *bio) |
1da177e4 | 1644 | { |
cb34e057 | 1645 | struct bio_vec *bvec; |
1da177e4 LT |
1646 | int i; |
1647 | ||
cb34e057 KO |
1648 | bio_for_each_segment_all(bvec, bio, i) { |
1649 | struct page *page = bvec->bv_page; | |
1da177e4 LT |
1650 | |
1651 | if (page) | |
1652 | put_page(page); | |
1653 | } | |
1654 | } | |
1655 | ||
1656 | /* | |
1657 | * bio_check_pages_dirty() will check that all the BIO's pages are still dirty. | |
1658 | * If they are, then fine. If, however, some pages are clean then they must | |
1659 | * have been written out during the direct-IO read. So we take another ref on | |
1660 | * the BIO and the offending pages and re-dirty the pages in process context. | |
1661 | * | |
1662 | * It is expected that bio_check_pages_dirty() will wholly own the BIO from | |
ea1754a0 KS |
1663 | * here on. It will run one put_page() against each page and will run one |
1664 | * bio_put() against the BIO. | |
1da177e4 LT |
1665 | */ |
1666 | ||
65f27f38 | 1667 | static void bio_dirty_fn(struct work_struct *work); |
1da177e4 | 1668 | |
65f27f38 | 1669 | static DECLARE_WORK(bio_dirty_work, bio_dirty_fn); |
1da177e4 LT |
1670 | static DEFINE_SPINLOCK(bio_dirty_lock); |
1671 | static struct bio *bio_dirty_list; | |
1672 | ||
1673 | /* | |
1674 | * This runs in process context | |
1675 | */ | |
65f27f38 | 1676 | static void bio_dirty_fn(struct work_struct *work) |
1da177e4 LT |
1677 | { |
1678 | unsigned long flags; | |
1679 | struct bio *bio; | |
1680 | ||
1681 | spin_lock_irqsave(&bio_dirty_lock, flags); | |
1682 | bio = bio_dirty_list; | |
1683 | bio_dirty_list = NULL; | |
1684 | spin_unlock_irqrestore(&bio_dirty_lock, flags); | |
1685 | ||
1686 | while (bio) { | |
1687 | struct bio *next = bio->bi_private; | |
1688 | ||
1689 | bio_set_pages_dirty(bio); | |
1690 | bio_release_pages(bio); | |
1691 | bio_put(bio); | |
1692 | bio = next; | |
1693 | } | |
1694 | } | |
1695 | ||
1696 | void bio_check_pages_dirty(struct bio *bio) | |
1697 | { | |
cb34e057 | 1698 | struct bio_vec *bvec; |
1da177e4 LT |
1699 | int nr_clean_pages = 0; |
1700 | int i; | |
1701 | ||
cb34e057 KO |
1702 | bio_for_each_segment_all(bvec, bio, i) { |
1703 | struct page *page = bvec->bv_page; | |
1da177e4 LT |
1704 | |
1705 | if (PageDirty(page) || PageCompound(page)) { | |
09cbfeaf | 1706 | put_page(page); |
cb34e057 | 1707 | bvec->bv_page = NULL; |
1da177e4 LT |
1708 | } else { |
1709 | nr_clean_pages++; | |
1710 | } | |
1711 | } | |
1712 | ||
1713 | if (nr_clean_pages) { | |
1714 | unsigned long flags; | |
1715 | ||
1716 | spin_lock_irqsave(&bio_dirty_lock, flags); | |
1717 | bio->bi_private = bio_dirty_list; | |
1718 | bio_dirty_list = bio; | |
1719 | spin_unlock_irqrestore(&bio_dirty_lock, flags); | |
1720 | schedule_work(&bio_dirty_work); | |
1721 | } else { | |
1722 | bio_put(bio); | |
1723 | } | |
1724 | } | |
1900fcc4 | 1725 | EXPORT_SYMBOL_GPL(bio_check_pages_dirty); |
1da177e4 | 1726 | |
d62e26b3 JA |
1727 | void generic_start_io_acct(struct request_queue *q, int rw, |
1728 | unsigned long sectors, struct hd_struct *part) | |
394ffa50 GZ |
1729 | { |
1730 | int cpu = part_stat_lock(); | |
1731 | ||
d62e26b3 | 1732 | part_round_stats(q, cpu, part); |
394ffa50 GZ |
1733 | part_stat_inc(cpu, part, ios[rw]); |
1734 | part_stat_add(cpu, part, sectors[rw], sectors); | |
d62e26b3 | 1735 | part_inc_in_flight(q, part, rw); |
394ffa50 GZ |
1736 | |
1737 | part_stat_unlock(); | |
1738 | } | |
1739 | EXPORT_SYMBOL(generic_start_io_acct); | |
1740 | ||
d62e26b3 JA |
1741 | void generic_end_io_acct(struct request_queue *q, int rw, |
1742 | struct hd_struct *part, unsigned long start_time) | |
394ffa50 GZ |
1743 | { |
1744 | unsigned long duration = jiffies - start_time; | |
1745 | int cpu = part_stat_lock(); | |
1746 | ||
1747 | part_stat_add(cpu, part, ticks[rw], duration); | |
d62e26b3 JA |
1748 | part_round_stats(q, cpu, part); |
1749 | part_dec_in_flight(q, part, rw); | |
394ffa50 GZ |
1750 | |
1751 | part_stat_unlock(); | |
1752 | } | |
1753 | EXPORT_SYMBOL(generic_end_io_acct); | |
1754 | ||
2d4dc890 IL |
1755 | #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE |
1756 | void bio_flush_dcache_pages(struct bio *bi) | |
1757 | { | |
7988613b KO |
1758 | struct bio_vec bvec; |
1759 | struct bvec_iter iter; | |
2d4dc890 | 1760 | |
7988613b KO |
1761 | bio_for_each_segment(bvec, bi, iter) |
1762 | flush_dcache_page(bvec.bv_page); | |
2d4dc890 IL |
1763 | } |
1764 | EXPORT_SYMBOL(bio_flush_dcache_pages); | |
1765 | #endif | |
1766 | ||
c4cf5261 JA |
1767 | static inline bool bio_remaining_done(struct bio *bio) |
1768 | { | |
1769 | /* | |
1770 | * If we're not chaining, then ->__bi_remaining is always 1 and | |
1771 | * we always end io on the first invocation. | |
1772 | */ | |
1773 | if (!bio_flagged(bio, BIO_CHAIN)) | |
1774 | return true; | |
1775 | ||
1776 | BUG_ON(atomic_read(&bio->__bi_remaining) <= 0); | |
1777 | ||
326e1dbb | 1778 | if (atomic_dec_and_test(&bio->__bi_remaining)) { |
b7c44ed9 | 1779 | bio_clear_flag(bio, BIO_CHAIN); |
c4cf5261 | 1780 | return true; |
326e1dbb | 1781 | } |
c4cf5261 JA |
1782 | |
1783 | return false; | |
1784 | } | |
1785 | ||
1da177e4 LT |
1786 | /** |
1787 | * bio_endio - end I/O on a bio | |
1788 | * @bio: bio | |
1da177e4 LT |
1789 | * |
1790 | * Description: | |
4246a0b6 CH |
1791 | * bio_endio() will end I/O on the whole bio. bio_endio() is the preferred |
1792 | * way to end I/O on a bio. No one should call bi_end_io() directly on a | |
1793 | * bio unless they own it and thus know that it has an end_io function. | |
fbbaf700 N |
1794 | * |
1795 | * bio_endio() can be called several times on a bio that has been chained | |
1796 | * using bio_chain(). The ->bi_end_io() function will only be called the | |
1797 | * last time. At this point the BLK_TA_COMPLETE tracing event will be | |
1798 | * generated if BIO_TRACE_COMPLETION is set. | |
1da177e4 | 1799 | **/ |
4246a0b6 | 1800 | void bio_endio(struct bio *bio) |
1da177e4 | 1801 | { |
ba8c6967 | 1802 | again: |
2b885517 | 1803 | if (!bio_remaining_done(bio)) |
ba8c6967 | 1804 | return; |
7c20f116 CH |
1805 | if (!bio_integrity_endio(bio)) |
1806 | return; | |
1da177e4 | 1807 | |
ba8c6967 CH |
1808 | /* |
1809 | * Need to have a real endio function for chained bios, otherwise | |
1810 | * various corner cases will break (like stacking block devices that | |
1811 | * save/restore bi_end_io) - however, we want to avoid unbounded | |
1812 | * recursion and blowing the stack. Tail call optimization would | |
1813 | * handle this, but compiling with frame pointers also disables | |
1814 | * gcc's sibling call optimization. | |
1815 | */ | |
1816 | if (bio->bi_end_io == bio_chain_endio) { | |
1817 | bio = __bio_chain_endio(bio); | |
1818 | goto again; | |
196d38bc | 1819 | } |
ba8c6967 | 1820 | |
74d46992 CH |
1821 | if (bio->bi_disk && bio_flagged(bio, BIO_TRACE_COMPLETION)) { |
1822 | trace_block_bio_complete(bio->bi_disk->queue, bio, | |
a462b950 | 1823 | blk_status_to_errno(bio->bi_status)); |
fbbaf700 N |
1824 | bio_clear_flag(bio, BIO_TRACE_COMPLETION); |
1825 | } | |
1826 | ||
9e234eea | 1827 | blk_throtl_bio_endio(bio); |
b222dd2f SL |
1828 | /* release cgroup info */ |
1829 | bio_uninit(bio); | |
ba8c6967 CH |
1830 | if (bio->bi_end_io) |
1831 | bio->bi_end_io(bio); | |
1da177e4 | 1832 | } |
a112a71d | 1833 | EXPORT_SYMBOL(bio_endio); |
1da177e4 | 1834 | |
20d0189b KO |
1835 | /** |
1836 | * bio_split - split a bio | |
1837 | * @bio: bio to split | |
1838 | * @sectors: number of sectors to split from the front of @bio | |
1839 | * @gfp: gfp mask | |
1840 | * @bs: bio set to allocate from | |
1841 | * | |
1842 | * Allocates and returns a new bio which represents @sectors from the start of | |
1843 | * @bio, and updates @bio to represent the remaining sectors. | |
1844 | * | |
f3f5da62 MP |
1845 | * Unless this is a discard request the newly allocated bio will point |
1846 | * to @bio's bi_io_vec; it is the caller's responsibility to ensure that | |
1847 | * @bio is not freed before the split. | |
20d0189b KO |
1848 | */ |
1849 | struct bio *bio_split(struct bio *bio, int sectors, | |
1850 | gfp_t gfp, struct bio_set *bs) | |
1851 | { | |
f341a4d3 | 1852 | struct bio *split; |
20d0189b KO |
1853 | |
1854 | BUG_ON(sectors <= 0); | |
1855 | BUG_ON(sectors >= bio_sectors(bio)); | |
1856 | ||
f9d03f96 | 1857 | split = bio_clone_fast(bio, gfp, bs); |
20d0189b KO |
1858 | if (!split) |
1859 | return NULL; | |
1860 | ||
1861 | split->bi_iter.bi_size = sectors << 9; | |
1862 | ||
1863 | if (bio_integrity(split)) | |
fbd08e76 | 1864 | bio_integrity_trim(split); |
20d0189b KO |
1865 | |
1866 | bio_advance(bio, split->bi_iter.bi_size); | |
1867 | ||
fbbaf700 | 1868 | if (bio_flagged(bio, BIO_TRACE_COMPLETION)) |
20d59023 | 1869 | bio_set_flag(split, BIO_TRACE_COMPLETION); |
fbbaf700 | 1870 | |
20d0189b KO |
1871 | return split; |
1872 | } | |
1873 | EXPORT_SYMBOL(bio_split); | |
1874 | ||
6678d83f KO |
1875 | /** |
1876 | * bio_trim - trim a bio | |
1877 | * @bio: bio to trim | |
1878 | * @offset: number of sectors to trim from the front of @bio | |
1879 | * @size: size we want to trim @bio to, in sectors | |
1880 | */ | |
1881 | void bio_trim(struct bio *bio, int offset, int size) | |
1882 | { | |
1883 | /* 'bio' is a cloned bio which we need to trim to match | |
1884 | * the given offset and size. | |
6678d83f | 1885 | */ |
6678d83f KO |
1886 | |
1887 | size <<= 9; | |
4f024f37 | 1888 | if (offset == 0 && size == bio->bi_iter.bi_size) |
6678d83f KO |
1889 | return; |
1890 | ||
b7c44ed9 | 1891 | bio_clear_flag(bio, BIO_SEG_VALID); |
6678d83f KO |
1892 | |
1893 | bio_advance(bio, offset << 9); | |
1894 | ||
4f024f37 | 1895 | bio->bi_iter.bi_size = size; |
376a78ab DM |
1896 | |
1897 | if (bio_integrity(bio)) | |
fbd08e76 | 1898 | bio_integrity_trim(bio); |
376a78ab | 1899 | |
6678d83f KO |
1900 | } |
1901 | EXPORT_SYMBOL_GPL(bio_trim); | |
1902 | ||
1da177e4 LT |
1903 | /* |
1904 | * create memory pools for biovec's in a bio_set. | |
1905 | * use the global biovec slabs created for general use. | |
1906 | */ | |
8aa6ba2f | 1907 | int biovec_init_pool(mempool_t *pool, int pool_entries) |
1da177e4 | 1908 | { |
ed996a52 | 1909 | struct biovec_slab *bp = bvec_slabs + BVEC_POOL_MAX; |
1da177e4 | 1910 | |
8aa6ba2f | 1911 | return mempool_init_slab_pool(pool, pool_entries, bp->slab); |
1da177e4 LT |
1912 | } |
1913 | ||
917a38c7 KO |
1914 | /* |
1915 | * bioset_exit - exit a bioset initialized with bioset_init() | |
1916 | * | |
1917 | * May be called on a zeroed but uninitialized bioset (i.e. allocated with | |
1918 | * kzalloc()). | |
1919 | */ | |
1920 | void bioset_exit(struct bio_set *bs) | |
1da177e4 | 1921 | { |
df2cb6da KO |
1922 | if (bs->rescue_workqueue) |
1923 | destroy_workqueue(bs->rescue_workqueue); | |
917a38c7 | 1924 | bs->rescue_workqueue = NULL; |
df2cb6da | 1925 | |
8aa6ba2f KO |
1926 | mempool_exit(&bs->bio_pool); |
1927 | mempool_exit(&bs->bvec_pool); | |
9f060e22 | 1928 | |
7878cba9 | 1929 | bioset_integrity_free(bs); |
917a38c7 KO |
1930 | if (bs->bio_slab) |
1931 | bio_put_slab(bs); | |
1932 | bs->bio_slab = NULL; | |
1933 | } | |
1934 | EXPORT_SYMBOL(bioset_exit); | |
1da177e4 | 1935 | |
917a38c7 KO |
1936 | /** |
1937 | * bioset_init - Initialize a bio_set | |
dad08527 | 1938 | * @bs: pool to initialize |
917a38c7 KO |
1939 | * @pool_size: Number of bio and bio_vecs to cache in the mempool |
1940 | * @front_pad: Number of bytes to allocate in front of the returned bio | |
1941 | * @flags: Flags to modify behavior, currently %BIOSET_NEED_BVECS | |
1942 | * and %BIOSET_NEED_RESCUER | |
1943 | * | |
dad08527 KO |
1944 | * Description: |
1945 | * Set up a bio_set to be used with @bio_alloc_bioset. Allows the caller | |
1946 | * to ask for a number of bytes to be allocated in front of the bio. | |
1947 | * Front pad allocation is useful for embedding the bio inside | |
1948 | * another structure, to avoid allocating extra data to go with the bio. | |
1949 | * Note that the bio must be embedded at the END of that structure always, | |
1950 | * or things will break badly. | |
1951 | * If %BIOSET_NEED_BVECS is set in @flags, a separate pool will be allocated | |
1952 | * for allocating iovecs. This pool is not needed e.g. for bio_clone_fast(). | |
1953 | * If %BIOSET_NEED_RESCUER is set, a workqueue is created which can be used to | |
1954 | * dispatch queued requests when the mempool runs out of space. | |
1955 | * | |
917a38c7 KO |
1956 | */ |
1957 | int bioset_init(struct bio_set *bs, | |
1958 | unsigned int pool_size, | |
1959 | unsigned int front_pad, | |
1960 | int flags) | |
1961 | { | |
1962 | unsigned int back_pad = BIO_INLINE_VECS * sizeof(struct bio_vec); | |
1963 | ||
1964 | bs->front_pad = front_pad; | |
1965 | ||
1966 | spin_lock_init(&bs->rescue_lock); | |
1967 | bio_list_init(&bs->rescue_list); | |
1968 | INIT_WORK(&bs->rescue_work, bio_alloc_rescue); | |
1969 | ||
1970 | bs->bio_slab = bio_find_or_create_slab(front_pad + back_pad); | |
1971 | if (!bs->bio_slab) | |
1972 | return -ENOMEM; | |
1973 | ||
1974 | if (mempool_init_slab_pool(&bs->bio_pool, pool_size, bs->bio_slab)) | |
1975 | goto bad; | |
1976 | ||
1977 | if ((flags & BIOSET_NEED_BVECS) && | |
1978 | biovec_init_pool(&bs->bvec_pool, pool_size)) | |
1979 | goto bad; | |
1980 | ||
1981 | if (!(flags & BIOSET_NEED_RESCUER)) | |
1982 | return 0; | |
1983 | ||
1984 | bs->rescue_workqueue = alloc_workqueue("bioset", WQ_MEM_RECLAIM, 0); | |
1985 | if (!bs->rescue_workqueue) | |
1986 | goto bad; | |
1987 | ||
1988 | return 0; | |
1989 | bad: | |
1990 | bioset_exit(bs); | |
1991 | return -ENOMEM; | |
1992 | } | |
1993 | EXPORT_SYMBOL(bioset_init); | |
1994 | ||
28e89fd9 JA |
1995 | /* |
1996 | * Initialize and setup a new bio_set, based on the settings from | |
1997 | * another bio_set. | |
1998 | */ | |
1999 | int bioset_init_from_src(struct bio_set *bs, struct bio_set *src) | |
2000 | { | |
2001 | int flags; | |
2002 | ||
2003 | flags = 0; | |
2004 | if (src->bvec_pool.min_nr) | |
2005 | flags |= BIOSET_NEED_BVECS; | |
2006 | if (src->rescue_workqueue) | |
2007 | flags |= BIOSET_NEED_RESCUER; | |
2008 | ||
2009 | return bioset_init(bs, src->bio_pool.min_nr, src->front_pad, flags); | |
2010 | } | |
2011 | EXPORT_SYMBOL(bioset_init_from_src); | |
2012 | ||
852c788f | 2013 | #ifdef CONFIG_BLK_CGROUP |
1d933cf0 TH |
2014 | |
2015 | /** | |
2016 | * bio_associate_blkcg - associate a bio with the specified blkcg | |
2017 | * @bio: target bio | |
2018 | * @blkcg_css: css of the blkcg to associate | |
2019 | * | |
2020 | * Associate @bio with the blkcg specified by @blkcg_css. Block layer will | |
2021 | * treat @bio as if it were issued by a task which belongs to the blkcg. | |
2022 | * | |
2023 | * This function takes an extra reference of @blkcg_css which will be put | |
2024 | * when @bio is released. The caller must own @bio and is responsible for | |
2025 | * synchronizing calls to this function. | |
2026 | */ | |
2027 | int bio_associate_blkcg(struct bio *bio, struct cgroup_subsys_state *blkcg_css) | |
2028 | { | |
2029 | if (unlikely(bio->bi_css)) | |
2030 | return -EBUSY; | |
2031 | css_get(blkcg_css); | |
2032 | bio->bi_css = blkcg_css; | |
2033 | return 0; | |
2034 | } | |
5aa2a96b | 2035 | EXPORT_SYMBOL_GPL(bio_associate_blkcg); |
1d933cf0 | 2036 | |
852c788f TH |
2037 | /** |
2038 | * bio_disassociate_task - undo bio_associate_current() | |
2039 | * @bio: target bio | |
2040 | */ | |
2041 | void bio_disassociate_task(struct bio *bio) | |
2042 | { | |
2043 | if (bio->bi_ioc) { | |
2044 | put_io_context(bio->bi_ioc); | |
2045 | bio->bi_ioc = NULL; | |
2046 | } | |
2047 | if (bio->bi_css) { | |
2048 | css_put(bio->bi_css); | |
2049 | bio->bi_css = NULL; | |
2050 | } | |
2051 | } | |
2052 | ||
20bd723e PV |
2053 | /** |
2054 | * bio_clone_blkcg_association - clone blkcg association from src to dst bio | |
2055 | * @dst: destination bio | |
2056 | * @src: source bio | |
2057 | */ | |
2058 | void bio_clone_blkcg_association(struct bio *dst, struct bio *src) | |
2059 | { | |
2060 | if (src->bi_css) | |
2061 | WARN_ON(bio_associate_blkcg(dst, src->bi_css)); | |
2062 | } | |
8a8e6f84 | 2063 | EXPORT_SYMBOL_GPL(bio_clone_blkcg_association); |
852c788f TH |
2064 | #endif /* CONFIG_BLK_CGROUP */ |
2065 | ||
1da177e4 LT |
2066 | static void __init biovec_init_slabs(void) |
2067 | { | |
2068 | int i; | |
2069 | ||
ed996a52 | 2070 | for (i = 0; i < BVEC_POOL_NR; i++) { |
1da177e4 LT |
2071 | int size; |
2072 | struct biovec_slab *bvs = bvec_slabs + i; | |
2073 | ||
a7fcd37c JA |
2074 | if (bvs->nr_vecs <= BIO_INLINE_VECS) { |
2075 | bvs->slab = NULL; | |
2076 | continue; | |
2077 | } | |
a7fcd37c | 2078 | |
1da177e4 LT |
2079 | size = bvs->nr_vecs * sizeof(struct bio_vec); |
2080 | bvs->slab = kmem_cache_create(bvs->name, size, 0, | |
20c2df83 | 2081 | SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL); |
1da177e4 LT |
2082 | } |
2083 | } | |
2084 | ||
2085 | static int __init init_bio(void) | |
2086 | { | |
bb799ca0 JA |
2087 | bio_slab_max = 2; |
2088 | bio_slab_nr = 0; | |
2089 | bio_slabs = kzalloc(bio_slab_max * sizeof(struct bio_slab), GFP_KERNEL); | |
2090 | if (!bio_slabs) | |
2091 | panic("bio: can't allocate bios\n"); | |
1da177e4 | 2092 | |
7878cba9 | 2093 | bio_integrity_init(); |
1da177e4 LT |
2094 | biovec_init_slabs(); |
2095 | ||
f4f8154a | 2096 | if (bioset_init(&fs_bio_set, BIO_POOL_SIZE, 0, BIOSET_NEED_BVECS)) |
1da177e4 LT |
2097 | panic("bio: can't allocate bios\n"); |
2098 | ||
f4f8154a | 2099 | if (bioset_integrity_create(&fs_bio_set, BIO_POOL_SIZE)) |
a91a2785 MP |
2100 | panic("bio: can't create integrity pool\n"); |
2101 | ||
1da177e4 LT |
2102 | return 0; |
2103 | } | |
1da177e4 | 2104 | subsys_initcall(init_bio); |