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> | |
22 | #include <linux/slab.h> | |
23 | #include <linux/init.h> | |
24 | #include <linux/kernel.h> | |
25 | #include <linux/module.h> | |
26 | #include <linux/mempool.h> | |
27 | #include <linux/workqueue.h> | |
2056a782 | 28 | #include <linux/blktrace_api.h> |
5f3ea37c | 29 | #include <trace/block.h> |
f1970baf | 30 | #include <scsi/sg.h> /* for struct sg_iovec */ |
1da177e4 | 31 | |
0bfc2455 IM |
32 | DEFINE_TRACE(block_split); |
33 | ||
392ddc32 JA |
34 | /* |
35 | * Test patch to inline a certain number of bi_io_vec's inside the bio | |
36 | * itself, to shrink a bio data allocation from two mempool calls to one | |
37 | */ | |
38 | #define BIO_INLINE_VECS 4 | |
39 | ||
6feef531 | 40 | static mempool_t *bio_split_pool __read_mostly; |
1da177e4 | 41 | |
1da177e4 LT |
42 | /* |
43 | * if you change this list, also change bvec_alloc or things will | |
44 | * break badly! cannot be bigger than what you can fit into an | |
45 | * unsigned short | |
46 | */ | |
1da177e4 | 47 | #define BV(x) { .nr_vecs = x, .name = "biovec-"__stringify(x) } |
bb799ca0 | 48 | struct biovec_slab bvec_slabs[BIOVEC_NR_POOLS] __read_mostly = { |
1da177e4 LT |
49 | BV(1), BV(4), BV(16), BV(64), BV(128), BV(BIO_MAX_PAGES), |
50 | }; | |
51 | #undef BV | |
52 | ||
1da177e4 LT |
53 | /* |
54 | * fs_bio_set is the bio_set containing bio and iovec memory pools used by | |
55 | * IO code that does not need private memory pools. | |
56 | */ | |
51d654e1 | 57 | struct bio_set *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; | |
76 | struct bio_slab *bslab; | |
77 | unsigned int i, entry = -1; | |
78 | ||
79 | mutex_lock(&bio_slab_lock); | |
80 | ||
81 | i = 0; | |
82 | while (i < bio_slab_nr) { | |
83 | struct bio_slab *bslab = &bio_slabs[i]; | |
84 | ||
85 | if (!bslab->slab && entry == -1) | |
86 | entry = i; | |
87 | else if (bslab->slab_size == sz) { | |
88 | slab = bslab->slab; | |
89 | bslab->slab_ref++; | |
90 | break; | |
91 | } | |
92 | i++; | |
93 | } | |
94 | ||
95 | if (slab) | |
96 | goto out_unlock; | |
97 | ||
98 | if (bio_slab_nr == bio_slab_max && entry == -1) { | |
99 | bio_slab_max <<= 1; | |
100 | bio_slabs = krealloc(bio_slabs, | |
101 | bio_slab_max * sizeof(struct bio_slab), | |
102 | GFP_KERNEL); | |
103 | if (!bio_slabs) | |
104 | goto out_unlock; | |
105 | } | |
106 | if (entry == -1) | |
107 | entry = bio_slab_nr++; | |
108 | ||
109 | bslab = &bio_slabs[entry]; | |
110 | ||
111 | snprintf(bslab->name, sizeof(bslab->name), "bio-%d", entry); | |
112 | slab = kmem_cache_create(bslab->name, sz, 0, SLAB_HWCACHE_ALIGN, NULL); | |
113 | if (!slab) | |
114 | goto out_unlock; | |
115 | ||
116 | printk("bio: create slab <%s> at %d\n", bslab->name, entry); | |
117 | bslab->slab = slab; | |
118 | bslab->slab_ref = 1; | |
119 | bslab->slab_size = sz; | |
120 | out_unlock: | |
121 | mutex_unlock(&bio_slab_lock); | |
122 | return slab; | |
123 | } | |
124 | ||
125 | static void bio_put_slab(struct bio_set *bs) | |
126 | { | |
127 | struct bio_slab *bslab = NULL; | |
128 | unsigned int i; | |
129 | ||
130 | mutex_lock(&bio_slab_lock); | |
131 | ||
132 | for (i = 0; i < bio_slab_nr; i++) { | |
133 | if (bs->bio_slab == bio_slabs[i].slab) { | |
134 | bslab = &bio_slabs[i]; | |
135 | break; | |
136 | } | |
137 | } | |
138 | ||
139 | if (WARN(!bslab, KERN_ERR "bio: unable to find slab!\n")) | |
140 | goto out; | |
141 | ||
142 | WARN_ON(!bslab->slab_ref); | |
143 | ||
144 | if (--bslab->slab_ref) | |
145 | goto out; | |
146 | ||
147 | kmem_cache_destroy(bslab->slab); | |
148 | bslab->slab = NULL; | |
149 | ||
150 | out: | |
151 | mutex_unlock(&bio_slab_lock); | |
152 | } | |
153 | ||
7ba1ba12 MP |
154 | unsigned int bvec_nr_vecs(unsigned short idx) |
155 | { | |
156 | return bvec_slabs[idx].nr_vecs; | |
157 | } | |
158 | ||
bb799ca0 JA |
159 | void bvec_free_bs(struct bio_set *bs, struct bio_vec *bv, unsigned int idx) |
160 | { | |
161 | BIO_BUG_ON(idx >= BIOVEC_NR_POOLS); | |
162 | ||
163 | if (idx == BIOVEC_MAX_IDX) | |
164 | mempool_free(bv, bs->bvec_pool); | |
165 | else { | |
166 | struct biovec_slab *bvs = bvec_slabs + idx; | |
167 | ||
168 | kmem_cache_free(bvs->slab, bv); | |
169 | } | |
170 | } | |
171 | ||
7ff9345f JA |
172 | struct bio_vec *bvec_alloc_bs(gfp_t gfp_mask, int nr, unsigned long *idx, |
173 | struct bio_set *bs) | |
1da177e4 LT |
174 | { |
175 | struct bio_vec *bvl; | |
1da177e4 LT |
176 | |
177 | /* | |
0a0d96b0 JA |
178 | * If 'bs' is given, lookup the pool and do the mempool alloc. |
179 | * If not, this is a bio_kmalloc() allocation and just do a | |
180 | * kzalloc() for the exact number of vecs right away. | |
1da177e4 | 181 | */ |
7ff9345f | 182 | if (!bs) |
d3f76110 | 183 | bvl = kmalloc(nr * sizeof(struct bio_vec), gfp_mask); |
7ff9345f JA |
184 | |
185 | /* | |
186 | * see comment near bvec_array define! | |
187 | */ | |
188 | switch (nr) { | |
189 | case 1: | |
190 | *idx = 0; | |
191 | break; | |
192 | case 2 ... 4: | |
193 | *idx = 1; | |
194 | break; | |
195 | case 5 ... 16: | |
196 | *idx = 2; | |
197 | break; | |
198 | case 17 ... 64: | |
199 | *idx = 3; | |
200 | break; | |
201 | case 65 ... 128: | |
202 | *idx = 4; | |
203 | break; | |
204 | case 129 ... BIO_MAX_PAGES: | |
205 | *idx = 5; | |
206 | break; | |
207 | default: | |
208 | return NULL; | |
209 | } | |
210 | ||
211 | /* | |
212 | * idx now points to the pool we want to allocate from. only the | |
213 | * 1-vec entry pool is mempool backed. | |
214 | */ | |
215 | if (*idx == BIOVEC_MAX_IDX) { | |
216 | fallback: | |
217 | bvl = mempool_alloc(bs->bvec_pool, gfp_mask); | |
218 | } else { | |
219 | struct biovec_slab *bvs = bvec_slabs + *idx; | |
220 | gfp_t __gfp_mask = gfp_mask & ~(__GFP_WAIT | __GFP_IO); | |
221 | ||
0a0d96b0 | 222 | /* |
7ff9345f JA |
223 | * Make this allocation restricted and don't dump info on |
224 | * allocation failures, since we'll fallback to the mempool | |
225 | * in case of failure. | |
0a0d96b0 | 226 | */ |
7ff9345f | 227 | __gfp_mask |= __GFP_NOMEMALLOC | __GFP_NORETRY | __GFP_NOWARN; |
1da177e4 | 228 | |
0a0d96b0 | 229 | /* |
7ff9345f JA |
230 | * Try a slab allocation. If this fails and __GFP_WAIT |
231 | * is set, retry with the 1-entry mempool | |
0a0d96b0 | 232 | */ |
7ff9345f JA |
233 | bvl = kmem_cache_alloc(bvs->slab, __gfp_mask); |
234 | if (unlikely(!bvl && (gfp_mask & __GFP_WAIT))) { | |
235 | *idx = BIOVEC_MAX_IDX; | |
236 | goto fallback; | |
237 | } | |
238 | } | |
239 | ||
1da177e4 LT |
240 | return bvl; |
241 | } | |
242 | ||
7ff9345f | 243 | void bio_free(struct bio *bio, struct bio_set *bs) |
1da177e4 | 244 | { |
bb799ca0 | 245 | void *p; |
1da177e4 | 246 | |
392ddc32 | 247 | if (bio_has_allocated_vec(bio)) |
bb799ca0 | 248 | bvec_free_bs(bs, bio->bi_io_vec, BIO_POOL_IDX(bio)); |
1da177e4 | 249 | |
7ba1ba12 | 250 | if (bio_integrity(bio)) |
7ff9345f | 251 | bio_integrity_free(bio, bs); |
7ba1ba12 | 252 | |
bb799ca0 JA |
253 | /* |
254 | * If we have front padding, adjust the bio pointer before freeing | |
255 | */ | |
256 | p = bio; | |
257 | if (bs->front_pad) | |
258 | p -= bs->front_pad; | |
259 | ||
260 | mempool_free(p, bs->bio_pool); | |
3676347a PO |
261 | } |
262 | ||
263 | /* | |
264 | * default destructor for a bio allocated with bio_alloc_bioset() | |
265 | */ | |
266 | static void bio_fs_destructor(struct bio *bio) | |
267 | { | |
268 | bio_free(bio, fs_bio_set); | |
1da177e4 LT |
269 | } |
270 | ||
0a0d96b0 JA |
271 | static void bio_kmalloc_destructor(struct bio *bio) |
272 | { | |
392ddc32 JA |
273 | if (bio_has_allocated_vec(bio)) |
274 | kfree(bio->bi_io_vec); | |
0a0d96b0 JA |
275 | kfree(bio); |
276 | } | |
277 | ||
858119e1 | 278 | void bio_init(struct bio *bio) |
1da177e4 | 279 | { |
2b94de55 | 280 | memset(bio, 0, sizeof(*bio)); |
1da177e4 | 281 | bio->bi_flags = 1 << BIO_UPTODATE; |
c7c22e4d | 282 | bio->bi_comp_cpu = -1; |
1da177e4 | 283 | atomic_set(&bio->bi_cnt, 1); |
1da177e4 LT |
284 | } |
285 | ||
286 | /** | |
287 | * bio_alloc_bioset - allocate a bio for I/O | |
288 | * @gfp_mask: the GFP_ mask given to the slab allocator | |
289 | * @nr_iovecs: number of iovecs to pre-allocate | |
0a0d96b0 | 290 | * @bs: the bio_set to allocate from. If %NULL, just use kmalloc |
1da177e4 LT |
291 | * |
292 | * Description: | |
0a0d96b0 | 293 | * bio_alloc_bioset will first try its own mempool to satisfy the allocation. |
1da177e4 | 294 | * If %__GFP_WAIT is set then we will block on the internal pool waiting |
0a0d96b0 JA |
295 | * for a &struct bio to become free. If a %NULL @bs is passed in, we will |
296 | * fall back to just using @kmalloc to allocate the required memory. | |
1da177e4 | 297 | * |
bb799ca0 JA |
298 | * Note that the caller must set ->bi_destructor on succesful return |
299 | * of a bio, to do the appropriate freeing of the bio once the reference | |
300 | * count drops to zero. | |
1da177e4 | 301 | **/ |
dd0fc66f | 302 | struct bio *bio_alloc_bioset(gfp_t gfp_mask, int nr_iovecs, struct bio_set *bs) |
1da177e4 | 303 | { |
bb799ca0 JA |
304 | struct bio *bio = NULL; |
305 | ||
306 | if (bs) { | |
307 | void *p = mempool_alloc(bs->bio_pool, gfp_mask); | |
0a0d96b0 | 308 | |
bb799ca0 JA |
309 | if (p) |
310 | bio = p + bs->front_pad; | |
311 | } else | |
0a0d96b0 | 312 | bio = kmalloc(sizeof(*bio), gfp_mask); |
1da177e4 LT |
313 | |
314 | if (likely(bio)) { | |
315 | struct bio_vec *bvl = NULL; | |
316 | ||
317 | bio_init(bio); | |
318 | if (likely(nr_iovecs)) { | |
eeae1d48 | 319 | unsigned long uninitialized_var(idx); |
1da177e4 | 320 | |
392ddc32 JA |
321 | if (nr_iovecs <= BIO_INLINE_VECS) { |
322 | idx = 0; | |
323 | bvl = bio->bi_inline_vecs; | |
324 | nr_iovecs = BIO_INLINE_VECS; | |
392ddc32 JA |
325 | } else { |
326 | bvl = bvec_alloc_bs(gfp_mask, nr_iovecs, &idx, | |
327 | bs); | |
328 | nr_iovecs = bvec_nr_vecs(idx); | |
329 | } | |
1da177e4 | 330 | if (unlikely(!bvl)) { |
0a0d96b0 JA |
331 | if (bs) |
332 | mempool_free(bio, bs->bio_pool); | |
333 | else | |
334 | kfree(bio); | |
1da177e4 LT |
335 | bio = NULL; |
336 | goto out; | |
337 | } | |
338 | bio->bi_flags |= idx << BIO_POOL_OFFSET; | |
392ddc32 | 339 | bio->bi_max_vecs = nr_iovecs; |
1da177e4 LT |
340 | } |
341 | bio->bi_io_vec = bvl; | |
1da177e4 LT |
342 | } |
343 | out: | |
344 | return bio; | |
345 | } | |
346 | ||
dd0fc66f | 347 | struct bio *bio_alloc(gfp_t gfp_mask, int nr_iovecs) |
1da177e4 | 348 | { |
3676347a PO |
349 | struct bio *bio = bio_alloc_bioset(gfp_mask, nr_iovecs, fs_bio_set); |
350 | ||
351 | if (bio) | |
352 | bio->bi_destructor = bio_fs_destructor; | |
353 | ||
354 | return bio; | |
1da177e4 LT |
355 | } |
356 | ||
0a0d96b0 JA |
357 | /* |
358 | * Like bio_alloc(), but doesn't use a mempool backing. This means that | |
359 | * it CAN fail, but while bio_alloc() can only be used for allocations | |
360 | * that have a short (finite) life span, bio_kmalloc() should be used | |
361 | * for more permanent bio allocations (like allocating some bio's for | |
362 | * initalization or setup purposes). | |
363 | */ | |
364 | struct bio *bio_kmalloc(gfp_t gfp_mask, int nr_iovecs) | |
365 | { | |
366 | struct bio *bio = bio_alloc_bioset(gfp_mask, nr_iovecs, NULL); | |
367 | ||
368 | if (bio) | |
369 | bio->bi_destructor = bio_kmalloc_destructor; | |
370 | ||
371 | return bio; | |
372 | } | |
373 | ||
1da177e4 LT |
374 | void zero_fill_bio(struct bio *bio) |
375 | { | |
376 | unsigned long flags; | |
377 | struct bio_vec *bv; | |
378 | int i; | |
379 | ||
380 | bio_for_each_segment(bv, bio, i) { | |
381 | char *data = bvec_kmap_irq(bv, &flags); | |
382 | memset(data, 0, bv->bv_len); | |
383 | flush_dcache_page(bv->bv_page); | |
384 | bvec_kunmap_irq(data, &flags); | |
385 | } | |
386 | } | |
387 | EXPORT_SYMBOL(zero_fill_bio); | |
388 | ||
389 | /** | |
390 | * bio_put - release a reference to a bio | |
391 | * @bio: bio to release reference to | |
392 | * | |
393 | * Description: | |
394 | * Put a reference to a &struct bio, either one you have gotten with | |
395 | * bio_alloc or bio_get. The last put of a bio will free it. | |
396 | **/ | |
397 | void bio_put(struct bio *bio) | |
398 | { | |
399 | BIO_BUG_ON(!atomic_read(&bio->bi_cnt)); | |
400 | ||
401 | /* | |
402 | * last put frees it | |
403 | */ | |
404 | if (atomic_dec_and_test(&bio->bi_cnt)) { | |
405 | bio->bi_next = NULL; | |
406 | bio->bi_destructor(bio); | |
407 | } | |
408 | } | |
409 | ||
165125e1 | 410 | inline int bio_phys_segments(struct request_queue *q, struct bio *bio) |
1da177e4 LT |
411 | { |
412 | if (unlikely(!bio_flagged(bio, BIO_SEG_VALID))) | |
413 | blk_recount_segments(q, bio); | |
414 | ||
415 | return bio->bi_phys_segments; | |
416 | } | |
417 | ||
1da177e4 LT |
418 | /** |
419 | * __bio_clone - clone a bio | |
420 | * @bio: destination bio | |
421 | * @bio_src: bio to clone | |
422 | * | |
423 | * Clone a &bio. Caller will own the returned bio, but not | |
424 | * the actual data it points to. Reference count of returned | |
425 | * bio will be one. | |
426 | */ | |
858119e1 | 427 | void __bio_clone(struct bio *bio, struct bio *bio_src) |
1da177e4 | 428 | { |
e525e153 AM |
429 | memcpy(bio->bi_io_vec, bio_src->bi_io_vec, |
430 | bio_src->bi_max_vecs * sizeof(struct bio_vec)); | |
1da177e4 | 431 | |
5d84070e JA |
432 | /* |
433 | * most users will be overriding ->bi_bdev with a new target, | |
434 | * so we don't set nor calculate new physical/hw segment counts here | |
435 | */ | |
1da177e4 LT |
436 | bio->bi_sector = bio_src->bi_sector; |
437 | bio->bi_bdev = bio_src->bi_bdev; | |
438 | bio->bi_flags |= 1 << BIO_CLONED; | |
439 | bio->bi_rw = bio_src->bi_rw; | |
1da177e4 LT |
440 | bio->bi_vcnt = bio_src->bi_vcnt; |
441 | bio->bi_size = bio_src->bi_size; | |
a5453be4 | 442 | bio->bi_idx = bio_src->bi_idx; |
1da177e4 LT |
443 | } |
444 | ||
445 | /** | |
446 | * bio_clone - clone a bio | |
447 | * @bio: bio to clone | |
448 | * @gfp_mask: allocation priority | |
449 | * | |
450 | * Like __bio_clone, only also allocates the returned bio | |
451 | */ | |
dd0fc66f | 452 | struct bio *bio_clone(struct bio *bio, gfp_t gfp_mask) |
1da177e4 LT |
453 | { |
454 | struct bio *b = bio_alloc_bioset(gfp_mask, bio->bi_max_vecs, fs_bio_set); | |
455 | ||
7ba1ba12 MP |
456 | if (!b) |
457 | return NULL; | |
458 | ||
459 | b->bi_destructor = bio_fs_destructor; | |
460 | __bio_clone(b, bio); | |
461 | ||
462 | if (bio_integrity(bio)) { | |
463 | int ret; | |
464 | ||
465 | ret = bio_integrity_clone(b, bio, fs_bio_set); | |
466 | ||
467 | if (ret < 0) | |
468 | return NULL; | |
3676347a | 469 | } |
1da177e4 LT |
470 | |
471 | return b; | |
472 | } | |
473 | ||
474 | /** | |
475 | * bio_get_nr_vecs - return approx number of vecs | |
476 | * @bdev: I/O target | |
477 | * | |
478 | * Return the approximate number of pages we can send to this target. | |
479 | * There's no guarantee that you will be able to fit this number of pages | |
480 | * into a bio, it does not account for dynamic restrictions that vary | |
481 | * on offset. | |
482 | */ | |
483 | int bio_get_nr_vecs(struct block_device *bdev) | |
484 | { | |
165125e1 | 485 | struct request_queue *q = bdev_get_queue(bdev); |
1da177e4 LT |
486 | int nr_pages; |
487 | ||
488 | nr_pages = ((q->max_sectors << 9) + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
489 | if (nr_pages > q->max_phys_segments) | |
490 | nr_pages = q->max_phys_segments; | |
491 | if (nr_pages > q->max_hw_segments) | |
492 | nr_pages = q->max_hw_segments; | |
493 | ||
494 | return nr_pages; | |
495 | } | |
496 | ||
165125e1 | 497 | static int __bio_add_page(struct request_queue *q, struct bio *bio, struct page |
defd94b7 MC |
498 | *page, unsigned int len, unsigned int offset, |
499 | unsigned short max_sectors) | |
1da177e4 LT |
500 | { |
501 | int retried_segments = 0; | |
502 | struct bio_vec *bvec; | |
503 | ||
504 | /* | |
505 | * cloned bio must not modify vec list | |
506 | */ | |
507 | if (unlikely(bio_flagged(bio, BIO_CLONED))) | |
508 | return 0; | |
509 | ||
80cfd548 | 510 | if (((bio->bi_size + len) >> 9) > max_sectors) |
1da177e4 LT |
511 | return 0; |
512 | ||
80cfd548 JA |
513 | /* |
514 | * For filesystems with a blocksize smaller than the pagesize | |
515 | * we will often be called with the same page as last time and | |
516 | * a consecutive offset. Optimize this special case. | |
517 | */ | |
518 | if (bio->bi_vcnt > 0) { | |
519 | struct bio_vec *prev = &bio->bi_io_vec[bio->bi_vcnt - 1]; | |
520 | ||
521 | if (page == prev->bv_page && | |
522 | offset == prev->bv_offset + prev->bv_len) { | |
523 | prev->bv_len += len; | |
cc371e66 AK |
524 | |
525 | if (q->merge_bvec_fn) { | |
526 | struct bvec_merge_data bvm = { | |
527 | .bi_bdev = bio->bi_bdev, | |
528 | .bi_sector = bio->bi_sector, | |
529 | .bi_size = bio->bi_size, | |
530 | .bi_rw = bio->bi_rw, | |
531 | }; | |
532 | ||
533 | if (q->merge_bvec_fn(q, &bvm, prev) < len) { | |
534 | prev->bv_len -= len; | |
535 | return 0; | |
536 | } | |
80cfd548 JA |
537 | } |
538 | ||
539 | goto done; | |
540 | } | |
541 | } | |
542 | ||
543 | if (bio->bi_vcnt >= bio->bi_max_vecs) | |
1da177e4 LT |
544 | return 0; |
545 | ||
546 | /* | |
547 | * we might lose a segment or two here, but rather that than | |
548 | * make this too complex. | |
549 | */ | |
550 | ||
551 | while (bio->bi_phys_segments >= q->max_phys_segments | |
5df97b91 | 552 | || bio->bi_phys_segments >= q->max_hw_segments) { |
1da177e4 LT |
553 | |
554 | if (retried_segments) | |
555 | return 0; | |
556 | ||
557 | retried_segments = 1; | |
558 | blk_recount_segments(q, bio); | |
559 | } | |
560 | ||
561 | /* | |
562 | * setup the new entry, we might clear it again later if we | |
563 | * cannot add the page | |
564 | */ | |
565 | bvec = &bio->bi_io_vec[bio->bi_vcnt]; | |
566 | bvec->bv_page = page; | |
567 | bvec->bv_len = len; | |
568 | bvec->bv_offset = offset; | |
569 | ||
570 | /* | |
571 | * if queue has other restrictions (eg varying max sector size | |
572 | * depending on offset), it can specify a merge_bvec_fn in the | |
573 | * queue to get further control | |
574 | */ | |
575 | if (q->merge_bvec_fn) { | |
cc371e66 AK |
576 | struct bvec_merge_data bvm = { |
577 | .bi_bdev = bio->bi_bdev, | |
578 | .bi_sector = bio->bi_sector, | |
579 | .bi_size = bio->bi_size, | |
580 | .bi_rw = bio->bi_rw, | |
581 | }; | |
582 | ||
1da177e4 LT |
583 | /* |
584 | * merge_bvec_fn() returns number of bytes it can accept | |
585 | * at this offset | |
586 | */ | |
cc371e66 | 587 | if (q->merge_bvec_fn(q, &bvm, bvec) < len) { |
1da177e4 LT |
588 | bvec->bv_page = NULL; |
589 | bvec->bv_len = 0; | |
590 | bvec->bv_offset = 0; | |
591 | return 0; | |
592 | } | |
593 | } | |
594 | ||
595 | /* If we may be able to merge these biovecs, force a recount */ | |
b8b3e16c | 596 | if (bio->bi_vcnt && (BIOVEC_PHYS_MERGEABLE(bvec-1, bvec))) |
1da177e4 LT |
597 | bio->bi_flags &= ~(1 << BIO_SEG_VALID); |
598 | ||
599 | bio->bi_vcnt++; | |
600 | bio->bi_phys_segments++; | |
80cfd548 | 601 | done: |
1da177e4 LT |
602 | bio->bi_size += len; |
603 | return len; | |
604 | } | |
605 | ||
6e68af66 MC |
606 | /** |
607 | * bio_add_pc_page - attempt to add page to bio | |
fddfdeaf | 608 | * @q: the target queue |
6e68af66 MC |
609 | * @bio: destination bio |
610 | * @page: page to add | |
611 | * @len: vec entry length | |
612 | * @offset: vec entry offset | |
613 | * | |
614 | * Attempt to add a page to the bio_vec maplist. This can fail for a | |
615 | * number of reasons, such as the bio being full or target block | |
616 | * device limitations. The target block device must allow bio's | |
617 | * smaller than PAGE_SIZE, so it is always possible to add a single | |
618 | * page to an empty bio. This should only be used by REQ_PC bios. | |
619 | */ | |
165125e1 | 620 | int bio_add_pc_page(struct request_queue *q, struct bio *bio, struct page *page, |
6e68af66 MC |
621 | unsigned int len, unsigned int offset) |
622 | { | |
defd94b7 | 623 | return __bio_add_page(q, bio, page, len, offset, q->max_hw_sectors); |
6e68af66 MC |
624 | } |
625 | ||
1da177e4 LT |
626 | /** |
627 | * bio_add_page - attempt to add page to bio | |
628 | * @bio: destination bio | |
629 | * @page: page to add | |
630 | * @len: vec entry length | |
631 | * @offset: vec entry offset | |
632 | * | |
633 | * Attempt to add a page to the bio_vec maplist. This can fail for a | |
634 | * number of reasons, such as the bio being full or target block | |
635 | * device limitations. The target block device must allow bio's | |
636 | * smaller than PAGE_SIZE, so it is always possible to add a single | |
637 | * page to an empty bio. | |
638 | */ | |
639 | int bio_add_page(struct bio *bio, struct page *page, unsigned int len, | |
640 | unsigned int offset) | |
641 | { | |
defd94b7 MC |
642 | struct request_queue *q = bdev_get_queue(bio->bi_bdev); |
643 | return __bio_add_page(q, bio, page, len, offset, q->max_sectors); | |
1da177e4 LT |
644 | } |
645 | ||
646 | struct bio_map_data { | |
647 | struct bio_vec *iovecs; | |
c5dec1c3 | 648 | struct sg_iovec *sgvecs; |
152e283f FT |
649 | int nr_sgvecs; |
650 | int is_our_pages; | |
1da177e4 LT |
651 | }; |
652 | ||
c5dec1c3 | 653 | static void bio_set_map_data(struct bio_map_data *bmd, struct bio *bio, |
152e283f FT |
654 | struct sg_iovec *iov, int iov_count, |
655 | int is_our_pages) | |
1da177e4 LT |
656 | { |
657 | memcpy(bmd->iovecs, bio->bi_io_vec, sizeof(struct bio_vec) * bio->bi_vcnt); | |
c5dec1c3 FT |
658 | memcpy(bmd->sgvecs, iov, sizeof(struct sg_iovec) * iov_count); |
659 | bmd->nr_sgvecs = iov_count; | |
152e283f | 660 | bmd->is_our_pages = is_our_pages; |
1da177e4 LT |
661 | bio->bi_private = bmd; |
662 | } | |
663 | ||
664 | static void bio_free_map_data(struct bio_map_data *bmd) | |
665 | { | |
666 | kfree(bmd->iovecs); | |
c5dec1c3 | 667 | kfree(bmd->sgvecs); |
1da177e4 LT |
668 | kfree(bmd); |
669 | } | |
670 | ||
76029ff3 FT |
671 | static struct bio_map_data *bio_alloc_map_data(int nr_segs, int iov_count, |
672 | gfp_t gfp_mask) | |
1da177e4 | 673 | { |
76029ff3 | 674 | struct bio_map_data *bmd = kmalloc(sizeof(*bmd), gfp_mask); |
1da177e4 LT |
675 | |
676 | if (!bmd) | |
677 | return NULL; | |
678 | ||
76029ff3 | 679 | bmd->iovecs = kmalloc(sizeof(struct bio_vec) * nr_segs, gfp_mask); |
c5dec1c3 FT |
680 | if (!bmd->iovecs) { |
681 | kfree(bmd); | |
682 | return NULL; | |
683 | } | |
684 | ||
76029ff3 | 685 | bmd->sgvecs = kmalloc(sizeof(struct sg_iovec) * iov_count, gfp_mask); |
c5dec1c3 | 686 | if (bmd->sgvecs) |
1da177e4 LT |
687 | return bmd; |
688 | ||
c5dec1c3 | 689 | kfree(bmd->iovecs); |
1da177e4 LT |
690 | kfree(bmd); |
691 | return NULL; | |
692 | } | |
693 | ||
aefcc28a | 694 | static int __bio_copy_iov(struct bio *bio, struct bio_vec *iovecs, |
152e283f FT |
695 | struct sg_iovec *iov, int iov_count, int uncopy, |
696 | int do_free_page) | |
c5dec1c3 FT |
697 | { |
698 | int ret = 0, i; | |
699 | struct bio_vec *bvec; | |
700 | int iov_idx = 0; | |
701 | unsigned int iov_off = 0; | |
702 | int read = bio_data_dir(bio) == READ; | |
703 | ||
704 | __bio_for_each_segment(bvec, bio, i, 0) { | |
705 | char *bv_addr = page_address(bvec->bv_page); | |
aefcc28a | 706 | unsigned int bv_len = iovecs[i].bv_len; |
c5dec1c3 FT |
707 | |
708 | while (bv_len && iov_idx < iov_count) { | |
709 | unsigned int bytes; | |
710 | char *iov_addr; | |
711 | ||
712 | bytes = min_t(unsigned int, | |
713 | iov[iov_idx].iov_len - iov_off, bv_len); | |
714 | iov_addr = iov[iov_idx].iov_base + iov_off; | |
715 | ||
716 | if (!ret) { | |
717 | if (!read && !uncopy) | |
718 | ret = copy_from_user(bv_addr, iov_addr, | |
719 | bytes); | |
720 | if (read && uncopy) | |
721 | ret = copy_to_user(iov_addr, bv_addr, | |
722 | bytes); | |
723 | ||
724 | if (ret) | |
725 | ret = -EFAULT; | |
726 | } | |
727 | ||
728 | bv_len -= bytes; | |
729 | bv_addr += bytes; | |
730 | iov_addr += bytes; | |
731 | iov_off += bytes; | |
732 | ||
733 | if (iov[iov_idx].iov_len == iov_off) { | |
734 | iov_idx++; | |
735 | iov_off = 0; | |
736 | } | |
737 | } | |
738 | ||
152e283f | 739 | if (do_free_page) |
c5dec1c3 FT |
740 | __free_page(bvec->bv_page); |
741 | } | |
742 | ||
743 | return ret; | |
744 | } | |
745 | ||
1da177e4 LT |
746 | /** |
747 | * bio_uncopy_user - finish previously mapped bio | |
748 | * @bio: bio being terminated | |
749 | * | |
750 | * Free pages allocated from bio_copy_user() and write back data | |
751 | * to user space in case of a read. | |
752 | */ | |
753 | int bio_uncopy_user(struct bio *bio) | |
754 | { | |
755 | struct bio_map_data *bmd = bio->bi_private; | |
81882766 | 756 | int ret = 0; |
1da177e4 | 757 | |
81882766 FT |
758 | if (!bio_flagged(bio, BIO_NULL_MAPPED)) |
759 | ret = __bio_copy_iov(bio, bmd->iovecs, bmd->sgvecs, | |
760 | bmd->nr_sgvecs, 1, bmd->is_our_pages); | |
1da177e4 LT |
761 | bio_free_map_data(bmd); |
762 | bio_put(bio); | |
763 | return ret; | |
764 | } | |
765 | ||
766 | /** | |
c5dec1c3 | 767 | * bio_copy_user_iov - copy user data to bio |
1da177e4 | 768 | * @q: destination block queue |
152e283f | 769 | * @map_data: pointer to the rq_map_data holding pages (if necessary) |
c5dec1c3 FT |
770 | * @iov: the iovec. |
771 | * @iov_count: number of elements in the iovec | |
1da177e4 | 772 | * @write_to_vm: bool indicating writing to pages or not |
a3bce90e | 773 | * @gfp_mask: memory allocation flags |
1da177e4 LT |
774 | * |
775 | * Prepares and returns a bio for indirect user io, bouncing data | |
776 | * to/from kernel pages as necessary. Must be paired with | |
777 | * call bio_uncopy_user() on io completion. | |
778 | */ | |
152e283f FT |
779 | struct bio *bio_copy_user_iov(struct request_queue *q, |
780 | struct rq_map_data *map_data, | |
781 | struct sg_iovec *iov, int iov_count, | |
782 | int write_to_vm, gfp_t gfp_mask) | |
1da177e4 | 783 | { |
1da177e4 LT |
784 | struct bio_map_data *bmd; |
785 | struct bio_vec *bvec; | |
786 | struct page *page; | |
787 | struct bio *bio; | |
788 | int i, ret; | |
c5dec1c3 FT |
789 | int nr_pages = 0; |
790 | unsigned int len = 0; | |
1da177e4 | 791 | |
c5dec1c3 FT |
792 | for (i = 0; i < iov_count; i++) { |
793 | unsigned long uaddr; | |
794 | unsigned long end; | |
795 | unsigned long start; | |
796 | ||
797 | uaddr = (unsigned long)iov[i].iov_base; | |
798 | end = (uaddr + iov[i].iov_len + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
799 | start = uaddr >> PAGE_SHIFT; | |
800 | ||
801 | nr_pages += end - start; | |
802 | len += iov[i].iov_len; | |
803 | } | |
804 | ||
a3bce90e | 805 | bmd = bio_alloc_map_data(nr_pages, iov_count, gfp_mask); |
1da177e4 LT |
806 | if (!bmd) |
807 | return ERR_PTR(-ENOMEM); | |
808 | ||
1da177e4 | 809 | ret = -ENOMEM; |
a3bce90e | 810 | bio = bio_alloc(gfp_mask, nr_pages); |
1da177e4 LT |
811 | if (!bio) |
812 | goto out_bmd; | |
813 | ||
814 | bio->bi_rw |= (!write_to_vm << BIO_RW); | |
815 | ||
816 | ret = 0; | |
152e283f | 817 | i = 0; |
e623ddb4 FT |
818 | if (map_data) |
819 | nr_pages = 1 << map_data->page_order; | |
1da177e4 | 820 | while (len) { |
e623ddb4 | 821 | unsigned int bytes = PAGE_SIZE; |
1da177e4 LT |
822 | |
823 | if (bytes > len) | |
824 | bytes = len; | |
825 | ||
152e283f | 826 | if (map_data) { |
e623ddb4 | 827 | if (i == map_data->nr_entries * nr_pages) { |
152e283f FT |
828 | ret = -ENOMEM; |
829 | break; | |
830 | } | |
e623ddb4 FT |
831 | |
832 | page = map_data->pages[i / nr_pages]; | |
833 | page += (i % nr_pages); | |
834 | ||
835 | i++; | |
836 | } else { | |
152e283f | 837 | page = alloc_page(q->bounce_gfp | gfp_mask); |
e623ddb4 FT |
838 | if (!page) { |
839 | ret = -ENOMEM; | |
840 | break; | |
841 | } | |
1da177e4 LT |
842 | } |
843 | ||
0e75f906 | 844 | if (bio_add_pc_page(q, bio, page, bytes, 0) < bytes) |
1da177e4 | 845 | break; |
1da177e4 LT |
846 | |
847 | len -= bytes; | |
848 | } | |
849 | ||
850 | if (ret) | |
851 | goto cleanup; | |
852 | ||
853 | /* | |
854 | * success | |
855 | */ | |
856 | if (!write_to_vm) { | |
152e283f | 857 | ret = __bio_copy_iov(bio, bio->bi_io_vec, iov, iov_count, 0, 0); |
c5dec1c3 FT |
858 | if (ret) |
859 | goto cleanup; | |
1da177e4 LT |
860 | } |
861 | ||
152e283f | 862 | bio_set_map_data(bmd, bio, iov, iov_count, map_data ? 0 : 1); |
1da177e4 LT |
863 | return bio; |
864 | cleanup: | |
152e283f FT |
865 | if (!map_data) |
866 | bio_for_each_segment(bvec, bio, i) | |
867 | __free_page(bvec->bv_page); | |
1da177e4 LT |
868 | |
869 | bio_put(bio); | |
870 | out_bmd: | |
871 | bio_free_map_data(bmd); | |
872 | return ERR_PTR(ret); | |
873 | } | |
874 | ||
c5dec1c3 FT |
875 | /** |
876 | * bio_copy_user - copy user data to bio | |
877 | * @q: destination block queue | |
152e283f | 878 | * @map_data: pointer to the rq_map_data holding pages (if necessary) |
c5dec1c3 FT |
879 | * @uaddr: start of user address |
880 | * @len: length in bytes | |
881 | * @write_to_vm: bool indicating writing to pages or not | |
a3bce90e | 882 | * @gfp_mask: memory allocation flags |
c5dec1c3 FT |
883 | * |
884 | * Prepares and returns a bio for indirect user io, bouncing data | |
885 | * to/from kernel pages as necessary. Must be paired with | |
886 | * call bio_uncopy_user() on io completion. | |
887 | */ | |
152e283f FT |
888 | struct bio *bio_copy_user(struct request_queue *q, struct rq_map_data *map_data, |
889 | unsigned long uaddr, unsigned int len, | |
890 | int write_to_vm, gfp_t gfp_mask) | |
c5dec1c3 FT |
891 | { |
892 | struct sg_iovec iov; | |
893 | ||
894 | iov.iov_base = (void __user *)uaddr; | |
895 | iov.iov_len = len; | |
896 | ||
152e283f | 897 | return bio_copy_user_iov(q, map_data, &iov, 1, write_to_vm, gfp_mask); |
c5dec1c3 FT |
898 | } |
899 | ||
165125e1 | 900 | static struct bio *__bio_map_user_iov(struct request_queue *q, |
f1970baf JB |
901 | struct block_device *bdev, |
902 | struct sg_iovec *iov, int iov_count, | |
a3bce90e | 903 | int write_to_vm, gfp_t gfp_mask) |
1da177e4 | 904 | { |
f1970baf JB |
905 | int i, j; |
906 | int nr_pages = 0; | |
1da177e4 LT |
907 | struct page **pages; |
908 | struct bio *bio; | |
f1970baf JB |
909 | int cur_page = 0; |
910 | int ret, offset; | |
1da177e4 | 911 | |
f1970baf JB |
912 | for (i = 0; i < iov_count; i++) { |
913 | unsigned long uaddr = (unsigned long)iov[i].iov_base; | |
914 | unsigned long len = iov[i].iov_len; | |
915 | unsigned long end = (uaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
916 | unsigned long start = uaddr >> PAGE_SHIFT; | |
917 | ||
918 | nr_pages += end - start; | |
919 | /* | |
ad2d7225 | 920 | * buffer must be aligned to at least hardsector size for now |
f1970baf | 921 | */ |
ad2d7225 | 922 | if (uaddr & queue_dma_alignment(q)) |
f1970baf JB |
923 | return ERR_PTR(-EINVAL); |
924 | } | |
925 | ||
926 | if (!nr_pages) | |
1da177e4 LT |
927 | return ERR_PTR(-EINVAL); |
928 | ||
a3bce90e | 929 | bio = bio_alloc(gfp_mask, nr_pages); |
1da177e4 LT |
930 | if (!bio) |
931 | return ERR_PTR(-ENOMEM); | |
932 | ||
933 | ret = -ENOMEM; | |
a3bce90e | 934 | pages = kcalloc(nr_pages, sizeof(struct page *), gfp_mask); |
1da177e4 LT |
935 | if (!pages) |
936 | goto out; | |
937 | ||
f1970baf JB |
938 | for (i = 0; i < iov_count; i++) { |
939 | unsigned long uaddr = (unsigned long)iov[i].iov_base; | |
940 | unsigned long len = iov[i].iov_len; | |
941 | unsigned long end = (uaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
942 | unsigned long start = uaddr >> PAGE_SHIFT; | |
943 | const int local_nr_pages = end - start; | |
944 | const int page_limit = cur_page + local_nr_pages; | |
945 | ||
f5dd33c4 NP |
946 | ret = get_user_pages_fast(uaddr, local_nr_pages, |
947 | write_to_vm, &pages[cur_page]); | |
99172157 JA |
948 | if (ret < local_nr_pages) { |
949 | ret = -EFAULT; | |
f1970baf | 950 | goto out_unmap; |
99172157 | 951 | } |
f1970baf JB |
952 | |
953 | offset = uaddr & ~PAGE_MASK; | |
954 | for (j = cur_page; j < page_limit; j++) { | |
955 | unsigned int bytes = PAGE_SIZE - offset; | |
956 | ||
957 | if (len <= 0) | |
958 | break; | |
959 | ||
960 | if (bytes > len) | |
961 | bytes = len; | |
962 | ||
963 | /* | |
964 | * sorry... | |
965 | */ | |
defd94b7 MC |
966 | if (bio_add_pc_page(q, bio, pages[j], bytes, offset) < |
967 | bytes) | |
f1970baf JB |
968 | break; |
969 | ||
970 | len -= bytes; | |
971 | offset = 0; | |
972 | } | |
1da177e4 | 973 | |
f1970baf | 974 | cur_page = j; |
1da177e4 | 975 | /* |
f1970baf | 976 | * release the pages we didn't map into the bio, if any |
1da177e4 | 977 | */ |
f1970baf JB |
978 | while (j < page_limit) |
979 | page_cache_release(pages[j++]); | |
1da177e4 LT |
980 | } |
981 | ||
1da177e4 LT |
982 | kfree(pages); |
983 | ||
984 | /* | |
985 | * set data direction, and check if mapped pages need bouncing | |
986 | */ | |
987 | if (!write_to_vm) | |
988 | bio->bi_rw |= (1 << BIO_RW); | |
989 | ||
f1970baf | 990 | bio->bi_bdev = bdev; |
1da177e4 LT |
991 | bio->bi_flags |= (1 << BIO_USER_MAPPED); |
992 | return bio; | |
f1970baf JB |
993 | |
994 | out_unmap: | |
995 | for (i = 0; i < nr_pages; i++) { | |
996 | if(!pages[i]) | |
997 | break; | |
998 | page_cache_release(pages[i]); | |
999 | } | |
1000 | out: | |
1da177e4 LT |
1001 | kfree(pages); |
1002 | bio_put(bio); | |
1003 | return ERR_PTR(ret); | |
1004 | } | |
1005 | ||
1006 | /** | |
1007 | * bio_map_user - map user address into bio | |
165125e1 | 1008 | * @q: the struct request_queue for the bio |
1da177e4 LT |
1009 | * @bdev: destination block device |
1010 | * @uaddr: start of user address | |
1011 | * @len: length in bytes | |
1012 | * @write_to_vm: bool indicating writing to pages or not | |
a3bce90e | 1013 | * @gfp_mask: memory allocation flags |
1da177e4 LT |
1014 | * |
1015 | * Map the user space address into a bio suitable for io to a block | |
1016 | * device. Returns an error pointer in case of error. | |
1017 | */ | |
165125e1 | 1018 | struct bio *bio_map_user(struct request_queue *q, struct block_device *bdev, |
a3bce90e FT |
1019 | unsigned long uaddr, unsigned int len, int write_to_vm, |
1020 | gfp_t gfp_mask) | |
f1970baf JB |
1021 | { |
1022 | struct sg_iovec iov; | |
1023 | ||
3f70353e | 1024 | iov.iov_base = (void __user *)uaddr; |
f1970baf JB |
1025 | iov.iov_len = len; |
1026 | ||
a3bce90e | 1027 | return bio_map_user_iov(q, bdev, &iov, 1, write_to_vm, gfp_mask); |
f1970baf JB |
1028 | } |
1029 | ||
1030 | /** | |
1031 | * bio_map_user_iov - map user sg_iovec table into bio | |
165125e1 | 1032 | * @q: the struct request_queue for the bio |
f1970baf JB |
1033 | * @bdev: destination block device |
1034 | * @iov: the iovec. | |
1035 | * @iov_count: number of elements in the iovec | |
1036 | * @write_to_vm: bool indicating writing to pages or not | |
a3bce90e | 1037 | * @gfp_mask: memory allocation flags |
f1970baf JB |
1038 | * |
1039 | * Map the user space address into a bio suitable for io to a block | |
1040 | * device. Returns an error pointer in case of error. | |
1041 | */ | |
165125e1 | 1042 | struct bio *bio_map_user_iov(struct request_queue *q, struct block_device *bdev, |
f1970baf | 1043 | struct sg_iovec *iov, int iov_count, |
a3bce90e | 1044 | int write_to_vm, gfp_t gfp_mask) |
1da177e4 LT |
1045 | { |
1046 | struct bio *bio; | |
1047 | ||
a3bce90e FT |
1048 | bio = __bio_map_user_iov(q, bdev, iov, iov_count, write_to_vm, |
1049 | gfp_mask); | |
1da177e4 LT |
1050 | if (IS_ERR(bio)) |
1051 | return bio; | |
1052 | ||
1053 | /* | |
1054 | * subtle -- if __bio_map_user() ended up bouncing a bio, | |
1055 | * it would normally disappear when its bi_end_io is run. | |
1056 | * however, we need it for the unmap, so grab an extra | |
1057 | * reference to it | |
1058 | */ | |
1059 | bio_get(bio); | |
1060 | ||
0e75f906 | 1061 | return bio; |
1da177e4 LT |
1062 | } |
1063 | ||
1064 | static void __bio_unmap_user(struct bio *bio) | |
1065 | { | |
1066 | struct bio_vec *bvec; | |
1067 | int i; | |
1068 | ||
1069 | /* | |
1070 | * make sure we dirty pages we wrote to | |
1071 | */ | |
1072 | __bio_for_each_segment(bvec, bio, i, 0) { | |
1073 | if (bio_data_dir(bio) == READ) | |
1074 | set_page_dirty_lock(bvec->bv_page); | |
1075 | ||
1076 | page_cache_release(bvec->bv_page); | |
1077 | } | |
1078 | ||
1079 | bio_put(bio); | |
1080 | } | |
1081 | ||
1082 | /** | |
1083 | * bio_unmap_user - unmap a bio | |
1084 | * @bio: the bio being unmapped | |
1085 | * | |
1086 | * Unmap a bio previously mapped by bio_map_user(). Must be called with | |
1087 | * a process context. | |
1088 | * | |
1089 | * bio_unmap_user() may sleep. | |
1090 | */ | |
1091 | void bio_unmap_user(struct bio *bio) | |
1092 | { | |
1093 | __bio_unmap_user(bio); | |
1094 | bio_put(bio); | |
1095 | } | |
1096 | ||
6712ecf8 | 1097 | static void bio_map_kern_endio(struct bio *bio, int err) |
b823825e | 1098 | { |
b823825e | 1099 | bio_put(bio); |
b823825e JA |
1100 | } |
1101 | ||
1102 | ||
165125e1 | 1103 | static struct bio *__bio_map_kern(struct request_queue *q, void *data, |
27496a8c | 1104 | unsigned int len, gfp_t gfp_mask) |
df46b9a4 MC |
1105 | { |
1106 | unsigned long kaddr = (unsigned long)data; | |
1107 | unsigned long end = (kaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
1108 | unsigned long start = kaddr >> PAGE_SHIFT; | |
1109 | const int nr_pages = end - start; | |
1110 | int offset, i; | |
1111 | struct bio *bio; | |
1112 | ||
1113 | bio = bio_alloc(gfp_mask, nr_pages); | |
1114 | if (!bio) | |
1115 | return ERR_PTR(-ENOMEM); | |
1116 | ||
1117 | offset = offset_in_page(kaddr); | |
1118 | for (i = 0; i < nr_pages; i++) { | |
1119 | unsigned int bytes = PAGE_SIZE - offset; | |
1120 | ||
1121 | if (len <= 0) | |
1122 | break; | |
1123 | ||
1124 | if (bytes > len) | |
1125 | bytes = len; | |
1126 | ||
defd94b7 MC |
1127 | if (bio_add_pc_page(q, bio, virt_to_page(data), bytes, |
1128 | offset) < bytes) | |
df46b9a4 MC |
1129 | break; |
1130 | ||
1131 | data += bytes; | |
1132 | len -= bytes; | |
1133 | offset = 0; | |
1134 | } | |
1135 | ||
b823825e | 1136 | bio->bi_end_io = bio_map_kern_endio; |
df46b9a4 MC |
1137 | return bio; |
1138 | } | |
1139 | ||
1140 | /** | |
1141 | * bio_map_kern - map kernel address into bio | |
165125e1 | 1142 | * @q: the struct request_queue for the bio |
df46b9a4 MC |
1143 | * @data: pointer to buffer to map |
1144 | * @len: length in bytes | |
1145 | * @gfp_mask: allocation flags for bio allocation | |
1146 | * | |
1147 | * Map the kernel address into a bio suitable for io to a block | |
1148 | * device. Returns an error pointer in case of error. | |
1149 | */ | |
165125e1 | 1150 | struct bio *bio_map_kern(struct request_queue *q, void *data, unsigned int len, |
27496a8c | 1151 | gfp_t gfp_mask) |
df46b9a4 MC |
1152 | { |
1153 | struct bio *bio; | |
1154 | ||
1155 | bio = __bio_map_kern(q, data, len, gfp_mask); | |
1156 | if (IS_ERR(bio)) | |
1157 | return bio; | |
1158 | ||
1159 | if (bio->bi_size == len) | |
1160 | return bio; | |
1161 | ||
1162 | /* | |
1163 | * Don't support partial mappings. | |
1164 | */ | |
1165 | bio_put(bio); | |
1166 | return ERR_PTR(-EINVAL); | |
1167 | } | |
1168 | ||
68154e90 FT |
1169 | static void bio_copy_kern_endio(struct bio *bio, int err) |
1170 | { | |
1171 | struct bio_vec *bvec; | |
1172 | const int read = bio_data_dir(bio) == READ; | |
76029ff3 | 1173 | struct bio_map_data *bmd = bio->bi_private; |
68154e90 | 1174 | int i; |
76029ff3 | 1175 | char *p = bmd->sgvecs[0].iov_base; |
68154e90 FT |
1176 | |
1177 | __bio_for_each_segment(bvec, bio, i, 0) { | |
1178 | char *addr = page_address(bvec->bv_page); | |
76029ff3 | 1179 | int len = bmd->iovecs[i].bv_len; |
68154e90 FT |
1180 | |
1181 | if (read && !err) | |
76029ff3 | 1182 | memcpy(p, addr, len); |
68154e90 FT |
1183 | |
1184 | __free_page(bvec->bv_page); | |
76029ff3 | 1185 | p += len; |
68154e90 FT |
1186 | } |
1187 | ||
76029ff3 | 1188 | bio_free_map_data(bmd); |
68154e90 FT |
1189 | bio_put(bio); |
1190 | } | |
1191 | ||
1192 | /** | |
1193 | * bio_copy_kern - copy kernel address into bio | |
1194 | * @q: the struct request_queue for the bio | |
1195 | * @data: pointer to buffer to copy | |
1196 | * @len: length in bytes | |
1197 | * @gfp_mask: allocation flags for bio and page allocation | |
ffee0259 | 1198 | * @reading: data direction is READ |
68154e90 FT |
1199 | * |
1200 | * copy the kernel address into a bio suitable for io to a block | |
1201 | * device. Returns an error pointer in case of error. | |
1202 | */ | |
1203 | struct bio *bio_copy_kern(struct request_queue *q, void *data, unsigned int len, | |
1204 | gfp_t gfp_mask, int reading) | |
1205 | { | |
68154e90 FT |
1206 | struct bio *bio; |
1207 | struct bio_vec *bvec; | |
4d8ab62e | 1208 | int i; |
68154e90 | 1209 | |
4d8ab62e FT |
1210 | bio = bio_copy_user(q, NULL, (unsigned long)data, len, 1, gfp_mask); |
1211 | if (IS_ERR(bio)) | |
1212 | return bio; | |
68154e90 FT |
1213 | |
1214 | if (!reading) { | |
1215 | void *p = data; | |
1216 | ||
1217 | bio_for_each_segment(bvec, bio, i) { | |
1218 | char *addr = page_address(bvec->bv_page); | |
1219 | ||
1220 | memcpy(addr, p, bvec->bv_len); | |
1221 | p += bvec->bv_len; | |
1222 | } | |
1223 | } | |
1224 | ||
68154e90 | 1225 | bio->bi_end_io = bio_copy_kern_endio; |
76029ff3 | 1226 | |
68154e90 | 1227 | return bio; |
68154e90 FT |
1228 | } |
1229 | ||
1da177e4 LT |
1230 | /* |
1231 | * bio_set_pages_dirty() and bio_check_pages_dirty() are support functions | |
1232 | * for performing direct-IO in BIOs. | |
1233 | * | |
1234 | * The problem is that we cannot run set_page_dirty() from interrupt context | |
1235 | * because the required locks are not interrupt-safe. So what we can do is to | |
1236 | * mark the pages dirty _before_ performing IO. And in interrupt context, | |
1237 | * check that the pages are still dirty. If so, fine. If not, redirty them | |
1238 | * in process context. | |
1239 | * | |
1240 | * We special-case compound pages here: normally this means reads into hugetlb | |
1241 | * pages. The logic in here doesn't really work right for compound pages | |
1242 | * because the VM does not uniformly chase down the head page in all cases. | |
1243 | * But dirtiness of compound pages is pretty meaningless anyway: the VM doesn't | |
1244 | * handle them at all. So we skip compound pages here at an early stage. | |
1245 | * | |
1246 | * Note that this code is very hard to test under normal circumstances because | |
1247 | * direct-io pins the pages with get_user_pages(). This makes | |
1248 | * is_page_cache_freeable return false, and the VM will not clean the pages. | |
1249 | * But other code (eg, pdflush) could clean the pages if they are mapped | |
1250 | * pagecache. | |
1251 | * | |
1252 | * Simply disabling the call to bio_set_pages_dirty() is a good way to test the | |
1253 | * deferred bio dirtying paths. | |
1254 | */ | |
1255 | ||
1256 | /* | |
1257 | * bio_set_pages_dirty() will mark all the bio's pages as dirty. | |
1258 | */ | |
1259 | void bio_set_pages_dirty(struct bio *bio) | |
1260 | { | |
1261 | struct bio_vec *bvec = bio->bi_io_vec; | |
1262 | int i; | |
1263 | ||
1264 | for (i = 0; i < bio->bi_vcnt; i++) { | |
1265 | struct page *page = bvec[i].bv_page; | |
1266 | ||
1267 | if (page && !PageCompound(page)) | |
1268 | set_page_dirty_lock(page); | |
1269 | } | |
1270 | } | |
1271 | ||
86b6c7a7 | 1272 | static void bio_release_pages(struct bio *bio) |
1da177e4 LT |
1273 | { |
1274 | struct bio_vec *bvec = bio->bi_io_vec; | |
1275 | int i; | |
1276 | ||
1277 | for (i = 0; i < bio->bi_vcnt; i++) { | |
1278 | struct page *page = bvec[i].bv_page; | |
1279 | ||
1280 | if (page) | |
1281 | put_page(page); | |
1282 | } | |
1283 | } | |
1284 | ||
1285 | /* | |
1286 | * bio_check_pages_dirty() will check that all the BIO's pages are still dirty. | |
1287 | * If they are, then fine. If, however, some pages are clean then they must | |
1288 | * have been written out during the direct-IO read. So we take another ref on | |
1289 | * the BIO and the offending pages and re-dirty the pages in process context. | |
1290 | * | |
1291 | * It is expected that bio_check_pages_dirty() will wholly own the BIO from | |
1292 | * here on. It will run one page_cache_release() against each page and will | |
1293 | * run one bio_put() against the BIO. | |
1294 | */ | |
1295 | ||
65f27f38 | 1296 | static void bio_dirty_fn(struct work_struct *work); |
1da177e4 | 1297 | |
65f27f38 | 1298 | static DECLARE_WORK(bio_dirty_work, bio_dirty_fn); |
1da177e4 LT |
1299 | static DEFINE_SPINLOCK(bio_dirty_lock); |
1300 | static struct bio *bio_dirty_list; | |
1301 | ||
1302 | /* | |
1303 | * This runs in process context | |
1304 | */ | |
65f27f38 | 1305 | static void bio_dirty_fn(struct work_struct *work) |
1da177e4 LT |
1306 | { |
1307 | unsigned long flags; | |
1308 | struct bio *bio; | |
1309 | ||
1310 | spin_lock_irqsave(&bio_dirty_lock, flags); | |
1311 | bio = bio_dirty_list; | |
1312 | bio_dirty_list = NULL; | |
1313 | spin_unlock_irqrestore(&bio_dirty_lock, flags); | |
1314 | ||
1315 | while (bio) { | |
1316 | struct bio *next = bio->bi_private; | |
1317 | ||
1318 | bio_set_pages_dirty(bio); | |
1319 | bio_release_pages(bio); | |
1320 | bio_put(bio); | |
1321 | bio = next; | |
1322 | } | |
1323 | } | |
1324 | ||
1325 | void bio_check_pages_dirty(struct bio *bio) | |
1326 | { | |
1327 | struct bio_vec *bvec = bio->bi_io_vec; | |
1328 | int nr_clean_pages = 0; | |
1329 | int i; | |
1330 | ||
1331 | for (i = 0; i < bio->bi_vcnt; i++) { | |
1332 | struct page *page = bvec[i].bv_page; | |
1333 | ||
1334 | if (PageDirty(page) || PageCompound(page)) { | |
1335 | page_cache_release(page); | |
1336 | bvec[i].bv_page = NULL; | |
1337 | } else { | |
1338 | nr_clean_pages++; | |
1339 | } | |
1340 | } | |
1341 | ||
1342 | if (nr_clean_pages) { | |
1343 | unsigned long flags; | |
1344 | ||
1345 | spin_lock_irqsave(&bio_dirty_lock, flags); | |
1346 | bio->bi_private = bio_dirty_list; | |
1347 | bio_dirty_list = bio; | |
1348 | spin_unlock_irqrestore(&bio_dirty_lock, flags); | |
1349 | schedule_work(&bio_dirty_work); | |
1350 | } else { | |
1351 | bio_put(bio); | |
1352 | } | |
1353 | } | |
1354 | ||
1355 | /** | |
1356 | * bio_endio - end I/O on a bio | |
1357 | * @bio: bio | |
1da177e4 LT |
1358 | * @error: error, if any |
1359 | * | |
1360 | * Description: | |
6712ecf8 | 1361 | * bio_endio() will end I/O on the whole bio. bio_endio() is the |
5bb23a68 N |
1362 | * preferred way to end I/O on a bio, it takes care of clearing |
1363 | * BIO_UPTODATE on error. @error is 0 on success, and and one of the | |
1364 | * established -Exxxx (-EIO, for instance) error values in case | |
1365 | * something went wrong. Noone should call bi_end_io() directly on a | |
1366 | * bio unless they own it and thus know that it has an end_io | |
1367 | * function. | |
1da177e4 | 1368 | **/ |
6712ecf8 | 1369 | void bio_endio(struct bio *bio, int error) |
1da177e4 LT |
1370 | { |
1371 | if (error) | |
1372 | clear_bit(BIO_UPTODATE, &bio->bi_flags); | |
9cc54d40 N |
1373 | else if (!test_bit(BIO_UPTODATE, &bio->bi_flags)) |
1374 | error = -EIO; | |
1da177e4 | 1375 | |
5bb23a68 | 1376 | if (bio->bi_end_io) |
6712ecf8 | 1377 | bio->bi_end_io(bio, error); |
1da177e4 LT |
1378 | } |
1379 | ||
1380 | void bio_pair_release(struct bio_pair *bp) | |
1381 | { | |
1382 | if (atomic_dec_and_test(&bp->cnt)) { | |
1383 | struct bio *master = bp->bio1.bi_private; | |
1384 | ||
6712ecf8 | 1385 | bio_endio(master, bp->error); |
1da177e4 LT |
1386 | mempool_free(bp, bp->bio2.bi_private); |
1387 | } | |
1388 | } | |
1389 | ||
6712ecf8 | 1390 | static void bio_pair_end_1(struct bio *bi, int err) |
1da177e4 LT |
1391 | { |
1392 | struct bio_pair *bp = container_of(bi, struct bio_pair, bio1); | |
1393 | ||
1394 | if (err) | |
1395 | bp->error = err; | |
1396 | ||
1da177e4 | 1397 | bio_pair_release(bp); |
1da177e4 LT |
1398 | } |
1399 | ||
6712ecf8 | 1400 | static void bio_pair_end_2(struct bio *bi, int err) |
1da177e4 LT |
1401 | { |
1402 | struct bio_pair *bp = container_of(bi, struct bio_pair, bio2); | |
1403 | ||
1404 | if (err) | |
1405 | bp->error = err; | |
1406 | ||
1da177e4 | 1407 | bio_pair_release(bp); |
1da177e4 LT |
1408 | } |
1409 | ||
1410 | /* | |
1411 | * split a bio - only worry about a bio with a single page | |
1412 | * in it's iovec | |
1413 | */ | |
6feef531 | 1414 | struct bio_pair *bio_split(struct bio *bi, int first_sectors) |
1da177e4 | 1415 | { |
6feef531 | 1416 | struct bio_pair *bp = mempool_alloc(bio_split_pool, GFP_NOIO); |
1da177e4 LT |
1417 | |
1418 | if (!bp) | |
1419 | return bp; | |
1420 | ||
5f3ea37c | 1421 | trace_block_split(bdev_get_queue(bi->bi_bdev), bi, |
2056a782 JA |
1422 | bi->bi_sector + first_sectors); |
1423 | ||
1da177e4 LT |
1424 | BUG_ON(bi->bi_vcnt != 1); |
1425 | BUG_ON(bi->bi_idx != 0); | |
1426 | atomic_set(&bp->cnt, 3); | |
1427 | bp->error = 0; | |
1428 | bp->bio1 = *bi; | |
1429 | bp->bio2 = *bi; | |
1430 | bp->bio2.bi_sector += first_sectors; | |
1431 | bp->bio2.bi_size -= first_sectors << 9; | |
1432 | bp->bio1.bi_size = first_sectors << 9; | |
1433 | ||
1434 | bp->bv1 = bi->bi_io_vec[0]; | |
1435 | bp->bv2 = bi->bi_io_vec[0]; | |
1436 | bp->bv2.bv_offset += first_sectors << 9; | |
1437 | bp->bv2.bv_len -= first_sectors << 9; | |
1438 | bp->bv1.bv_len = first_sectors << 9; | |
1439 | ||
1440 | bp->bio1.bi_io_vec = &bp->bv1; | |
1441 | bp->bio2.bi_io_vec = &bp->bv2; | |
1442 | ||
a2eb0c10 N |
1443 | bp->bio1.bi_max_vecs = 1; |
1444 | bp->bio2.bi_max_vecs = 1; | |
1445 | ||
1da177e4 LT |
1446 | bp->bio1.bi_end_io = bio_pair_end_1; |
1447 | bp->bio2.bi_end_io = bio_pair_end_2; | |
1448 | ||
1449 | bp->bio1.bi_private = bi; | |
6feef531 | 1450 | bp->bio2.bi_private = bio_split_pool; |
1da177e4 | 1451 | |
7ba1ba12 MP |
1452 | if (bio_integrity(bi)) |
1453 | bio_integrity_split(bi, bp, first_sectors); | |
1454 | ||
1da177e4 LT |
1455 | return bp; |
1456 | } | |
1457 | ||
ad3316bf MP |
1458 | /** |
1459 | * bio_sector_offset - Find hardware sector offset in bio | |
1460 | * @bio: bio to inspect | |
1461 | * @index: bio_vec index | |
1462 | * @offset: offset in bv_page | |
1463 | * | |
1464 | * Return the number of hardware sectors between beginning of bio | |
1465 | * and an end point indicated by a bio_vec index and an offset | |
1466 | * within that vector's page. | |
1467 | */ | |
1468 | sector_t bio_sector_offset(struct bio *bio, unsigned short index, | |
1469 | unsigned int offset) | |
1470 | { | |
1471 | unsigned int sector_sz = queue_hardsect_size(bio->bi_bdev->bd_disk->queue); | |
1472 | struct bio_vec *bv; | |
1473 | sector_t sectors; | |
1474 | int i; | |
1475 | ||
1476 | sectors = 0; | |
1477 | ||
1478 | if (index >= bio->bi_idx) | |
1479 | index = bio->bi_vcnt - 1; | |
1480 | ||
1481 | __bio_for_each_segment(bv, bio, i, 0) { | |
1482 | if (i == index) { | |
1483 | if (offset > bv->bv_offset) | |
1484 | sectors += (offset - bv->bv_offset) / sector_sz; | |
1485 | break; | |
1486 | } | |
1487 | ||
1488 | sectors += bv->bv_len / sector_sz; | |
1489 | } | |
1490 | ||
1491 | return sectors; | |
1492 | } | |
1493 | EXPORT_SYMBOL(bio_sector_offset); | |
1da177e4 LT |
1494 | |
1495 | /* | |
1496 | * create memory pools for biovec's in a bio_set. | |
1497 | * use the global biovec slabs created for general use. | |
1498 | */ | |
5972511b | 1499 | static int biovec_create_pools(struct bio_set *bs, int pool_entries) |
1da177e4 | 1500 | { |
7ff9345f | 1501 | struct biovec_slab *bp = bvec_slabs + BIOVEC_MAX_IDX; |
1da177e4 | 1502 | |
7ff9345f JA |
1503 | bs->bvec_pool = mempool_create_slab_pool(pool_entries, bp->slab); |
1504 | if (!bs->bvec_pool) | |
1505 | return -ENOMEM; | |
1da177e4 | 1506 | |
1da177e4 LT |
1507 | return 0; |
1508 | } | |
1509 | ||
1510 | static void biovec_free_pools(struct bio_set *bs) | |
1511 | { | |
7ff9345f | 1512 | mempool_destroy(bs->bvec_pool); |
1da177e4 LT |
1513 | } |
1514 | ||
1515 | void bioset_free(struct bio_set *bs) | |
1516 | { | |
1517 | if (bs->bio_pool) | |
1518 | mempool_destroy(bs->bio_pool); | |
1519 | ||
7ba1ba12 | 1520 | bioset_integrity_free(bs); |
1da177e4 | 1521 | biovec_free_pools(bs); |
bb799ca0 | 1522 | bio_put_slab(bs); |
1da177e4 LT |
1523 | |
1524 | kfree(bs); | |
1525 | } | |
1526 | ||
bb799ca0 JA |
1527 | /** |
1528 | * bioset_create - Create a bio_set | |
1529 | * @pool_size: Number of bio and bio_vecs to cache in the mempool | |
1530 | * @front_pad: Number of bytes to allocate in front of the returned bio | |
1531 | * | |
1532 | * Description: | |
1533 | * Set up a bio_set to be used with @bio_alloc_bioset. Allows the caller | |
1534 | * to ask for a number of bytes to be allocated in front of the bio. | |
1535 | * Front pad allocation is useful for embedding the bio inside | |
1536 | * another structure, to avoid allocating extra data to go with the bio. | |
1537 | * Note that the bio must be embedded at the END of that structure always, | |
1538 | * or things will break badly. | |
1539 | */ | |
1540 | struct bio_set *bioset_create(unsigned int pool_size, unsigned int front_pad) | |
1da177e4 | 1541 | { |
392ddc32 | 1542 | unsigned int back_pad = BIO_INLINE_VECS * sizeof(struct bio_vec); |
1b434498 | 1543 | struct bio_set *bs; |
1da177e4 | 1544 | |
1b434498 | 1545 | bs = kzalloc(sizeof(*bs), GFP_KERNEL); |
1da177e4 LT |
1546 | if (!bs) |
1547 | return NULL; | |
1548 | ||
bb799ca0 | 1549 | bs->front_pad = front_pad; |
1b434498 | 1550 | |
392ddc32 | 1551 | bs->bio_slab = bio_find_or_create_slab(front_pad + back_pad); |
bb799ca0 JA |
1552 | if (!bs->bio_slab) { |
1553 | kfree(bs); | |
1554 | return NULL; | |
1555 | } | |
1556 | ||
1557 | bs->bio_pool = mempool_create_slab_pool(pool_size, bs->bio_slab); | |
1da177e4 LT |
1558 | if (!bs->bio_pool) |
1559 | goto bad; | |
1560 | ||
bb799ca0 | 1561 | if (bioset_integrity_create(bs, pool_size)) |
7ba1ba12 MP |
1562 | goto bad; |
1563 | ||
bb799ca0 | 1564 | if (!biovec_create_pools(bs, pool_size)) |
1da177e4 LT |
1565 | return bs; |
1566 | ||
1567 | bad: | |
1568 | bioset_free(bs); | |
1569 | return NULL; | |
1570 | } | |
1571 | ||
1572 | static void __init biovec_init_slabs(void) | |
1573 | { | |
1574 | int i; | |
1575 | ||
1576 | for (i = 0; i < BIOVEC_NR_POOLS; i++) { | |
1577 | int size; | |
1578 | struct biovec_slab *bvs = bvec_slabs + i; | |
1579 | ||
1580 | size = bvs->nr_vecs * sizeof(struct bio_vec); | |
1581 | bvs->slab = kmem_cache_create(bvs->name, size, 0, | |
20c2df83 | 1582 | SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL); |
1da177e4 LT |
1583 | } |
1584 | } | |
1585 | ||
1586 | static int __init init_bio(void) | |
1587 | { | |
bb799ca0 JA |
1588 | bio_slab_max = 2; |
1589 | bio_slab_nr = 0; | |
1590 | bio_slabs = kzalloc(bio_slab_max * sizeof(struct bio_slab), GFP_KERNEL); | |
1591 | if (!bio_slabs) | |
1592 | panic("bio: can't allocate bios\n"); | |
1da177e4 | 1593 | |
7ba1ba12 | 1594 | bio_integrity_init_slab(); |
1da177e4 LT |
1595 | biovec_init_slabs(); |
1596 | ||
bb799ca0 | 1597 | fs_bio_set = bioset_create(BIO_POOL_SIZE, 0); |
1da177e4 LT |
1598 | if (!fs_bio_set) |
1599 | panic("bio: can't allocate bios\n"); | |
1600 | ||
0eaae62a MD |
1601 | bio_split_pool = mempool_create_kmalloc_pool(BIO_SPLIT_ENTRIES, |
1602 | sizeof(struct bio_pair)); | |
1da177e4 LT |
1603 | if (!bio_split_pool) |
1604 | panic("bio: can't create split pool\n"); | |
1605 | ||
1606 | return 0; | |
1607 | } | |
1608 | ||
1609 | subsys_initcall(init_bio); | |
1610 | ||
1611 | EXPORT_SYMBOL(bio_alloc); | |
0a0d96b0 | 1612 | EXPORT_SYMBOL(bio_kmalloc); |
1da177e4 | 1613 | EXPORT_SYMBOL(bio_put); |
3676347a | 1614 | EXPORT_SYMBOL(bio_free); |
1da177e4 LT |
1615 | EXPORT_SYMBOL(bio_endio); |
1616 | EXPORT_SYMBOL(bio_init); | |
1617 | EXPORT_SYMBOL(__bio_clone); | |
1618 | EXPORT_SYMBOL(bio_clone); | |
1619 | EXPORT_SYMBOL(bio_phys_segments); | |
1da177e4 | 1620 | EXPORT_SYMBOL(bio_add_page); |
6e68af66 | 1621 | EXPORT_SYMBOL(bio_add_pc_page); |
1da177e4 | 1622 | EXPORT_SYMBOL(bio_get_nr_vecs); |
40044ce0 JA |
1623 | EXPORT_SYMBOL(bio_map_user); |
1624 | EXPORT_SYMBOL(bio_unmap_user); | |
df46b9a4 | 1625 | EXPORT_SYMBOL(bio_map_kern); |
68154e90 | 1626 | EXPORT_SYMBOL(bio_copy_kern); |
1da177e4 LT |
1627 | EXPORT_SYMBOL(bio_pair_release); |
1628 | EXPORT_SYMBOL(bio_split); | |
1da177e4 LT |
1629 | EXPORT_SYMBOL(bio_copy_user); |
1630 | EXPORT_SYMBOL(bio_uncopy_user); | |
1631 | EXPORT_SYMBOL(bioset_create); | |
1632 | EXPORT_SYMBOL(bioset_free); | |
1633 | EXPORT_SYMBOL(bio_alloc_bioset); |