blob: 73e664c01d30075064cc14b533d9d0d72b1d871f [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Copyright (C) 2001 Jens Axboe <axboe@suse.de>
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>
Jens Axboe2056a782006-03-23 20:00:26 +010028#include <linux/blktrace_api.h>
James Bottomley f1970ba2005-06-20 14:06:52 +020029#include <scsi/sg.h> /* for struct sg_iovec */
Linus Torvalds1da177e2005-04-16 15:20:36 -070030
31#define BIO_POOL_SIZE 256
32
33static kmem_cache_t *bio_slab;
34
35#define BIOVEC_NR_POOLS 6
36
37/*
38 * a small number of entries is fine, not going to be performance critical.
39 * basically we just need to survive
40 */
41#define BIO_SPLIT_ENTRIES 8
42mempool_t *bio_split_pool;
43
44struct biovec_slab {
45 int nr_vecs;
46 char *name;
47 kmem_cache_t *slab;
48};
49
50/*
51 * if you change this list, also change bvec_alloc or things will
52 * break badly! cannot be bigger than what you can fit into an
53 * unsigned short
54 */
55
56#define BV(x) { .nr_vecs = x, .name = "biovec-"__stringify(x) }
Christoph Lameter6c036522005-07-07 17:56:59 -070057static struct biovec_slab bvec_slabs[BIOVEC_NR_POOLS] __read_mostly = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070058 BV(1), BV(4), BV(16), BV(64), BV(128), BV(BIO_MAX_PAGES),
59};
60#undef BV
61
62/*
63 * bio_set is used to allow other portions of the IO system to
64 * allocate their own private memory pools for bio and iovec structures.
65 * These memory pools in turn all allocate from the bio_slab
66 * and the bvec_slabs[].
67 */
68struct bio_set {
69 mempool_t *bio_pool;
70 mempool_t *bvec_pools[BIOVEC_NR_POOLS];
71};
72
73/*
74 * fs_bio_set is the bio_set containing bio and iovec memory pools used by
75 * IO code that does not need private memory pools.
76 */
77static struct bio_set *fs_bio_set;
78
Al Virodd0fc662005-10-07 07:46:04 +010079static inline struct bio_vec *bvec_alloc_bs(gfp_t gfp_mask, int nr, unsigned long *idx, struct bio_set *bs)
Linus Torvalds1da177e2005-04-16 15:20:36 -070080{
81 struct bio_vec *bvl;
82 struct biovec_slab *bp;
83
84 /*
85 * see comment near bvec_array define!
86 */
87 switch (nr) {
88 case 1 : *idx = 0; break;
89 case 2 ... 4: *idx = 1; break;
90 case 5 ... 16: *idx = 2; break;
91 case 17 ... 64: *idx = 3; break;
92 case 65 ... 128: *idx = 4; break;
93 case 129 ... BIO_MAX_PAGES: *idx = 5; break;
94 default:
95 return NULL;
96 }
97 /*
98 * idx now points to the pool we want to allocate from
99 */
100
101 bp = bvec_slabs + *idx;
102 bvl = mempool_alloc(bs->bvec_pools[*idx], gfp_mask);
103 if (bvl)
104 memset(bvl, 0, bp->nr_vecs * sizeof(struct bio_vec));
105
106 return bvl;
107}
108
Peter Osterlund36763472005-09-06 15:16:42 -0700109void bio_free(struct bio *bio, struct bio_set *bio_set)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110{
111 const int pool_idx = BIO_POOL_IDX(bio);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112
113 BIO_BUG_ON(pool_idx >= BIOVEC_NR_POOLS);
114
Peter Osterlund36763472005-09-06 15:16:42 -0700115 mempool_free(bio->bi_io_vec, bio_set->bvec_pools[pool_idx]);
116 mempool_free(bio, bio_set->bio_pool);
117}
118
119/*
120 * default destructor for a bio allocated with bio_alloc_bioset()
121 */
122static void bio_fs_destructor(struct bio *bio)
123{
124 bio_free(bio, fs_bio_set);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125}
126
Arjan van de Ven858119e2006-01-14 13:20:43 -0800127void bio_init(struct bio *bio)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128{
129 bio->bi_next = NULL;
Jens Axboe0ea60b52006-01-09 14:45:10 +0100130 bio->bi_bdev = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 bio->bi_flags = 1 << BIO_UPTODATE;
132 bio->bi_rw = 0;
133 bio->bi_vcnt = 0;
134 bio->bi_idx = 0;
135 bio->bi_phys_segments = 0;
136 bio->bi_hw_segments = 0;
137 bio->bi_hw_front_size = 0;
138 bio->bi_hw_back_size = 0;
139 bio->bi_size = 0;
140 bio->bi_max_vecs = 0;
141 bio->bi_end_io = NULL;
142 atomic_set(&bio->bi_cnt, 1);
143 bio->bi_private = NULL;
144}
145
146/**
147 * bio_alloc_bioset - allocate a bio for I/O
148 * @gfp_mask: the GFP_ mask given to the slab allocator
149 * @nr_iovecs: number of iovecs to pre-allocate
Martin Waitz67be2dd2005-05-01 08:59:26 -0700150 * @bs: the bio_set to allocate from
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151 *
152 * Description:
153 * bio_alloc_bioset will first try it's on mempool to satisfy the allocation.
154 * If %__GFP_WAIT is set then we will block on the internal pool waiting
155 * for a &struct bio to become free.
156 *
157 * allocate bio and iovecs from the memory pools specified by the
158 * bio_set structure.
159 **/
Al Virodd0fc662005-10-07 07:46:04 +0100160struct bio *bio_alloc_bioset(gfp_t gfp_mask, int nr_iovecs, struct bio_set *bs)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700161{
162 struct bio *bio = mempool_alloc(bs->bio_pool, gfp_mask);
163
164 if (likely(bio)) {
165 struct bio_vec *bvl = NULL;
166
167 bio_init(bio);
168 if (likely(nr_iovecs)) {
169 unsigned long idx;
170
171 bvl = bvec_alloc_bs(gfp_mask, nr_iovecs, &idx, bs);
172 if (unlikely(!bvl)) {
173 mempool_free(bio, bs->bio_pool);
174 bio = NULL;
175 goto out;
176 }
177 bio->bi_flags |= idx << BIO_POOL_OFFSET;
178 bio->bi_max_vecs = bvec_slabs[idx].nr_vecs;
179 }
180 bio->bi_io_vec = bvl;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700181 }
182out:
183 return bio;
184}
185
Al Virodd0fc662005-10-07 07:46:04 +0100186struct bio *bio_alloc(gfp_t gfp_mask, int nr_iovecs)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187{
Peter Osterlund36763472005-09-06 15:16:42 -0700188 struct bio *bio = bio_alloc_bioset(gfp_mask, nr_iovecs, fs_bio_set);
189
190 if (bio)
191 bio->bi_destructor = bio_fs_destructor;
192
193 return bio;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194}
195
196void zero_fill_bio(struct bio *bio)
197{
198 unsigned long flags;
199 struct bio_vec *bv;
200 int i;
201
202 bio_for_each_segment(bv, bio, i) {
203 char *data = bvec_kmap_irq(bv, &flags);
204 memset(data, 0, bv->bv_len);
205 flush_dcache_page(bv->bv_page);
206 bvec_kunmap_irq(data, &flags);
207 }
208}
209EXPORT_SYMBOL(zero_fill_bio);
210
211/**
212 * bio_put - release a reference to a bio
213 * @bio: bio to release reference to
214 *
215 * Description:
216 * Put a reference to a &struct bio, either one you have gotten with
217 * bio_alloc or bio_get. The last put of a bio will free it.
218 **/
219void bio_put(struct bio *bio)
220{
221 BIO_BUG_ON(!atomic_read(&bio->bi_cnt));
222
223 /*
224 * last put frees it
225 */
226 if (atomic_dec_and_test(&bio->bi_cnt)) {
227 bio->bi_next = NULL;
228 bio->bi_destructor(bio);
229 }
230}
231
232inline int bio_phys_segments(request_queue_t *q, struct bio *bio)
233{
234 if (unlikely(!bio_flagged(bio, BIO_SEG_VALID)))
235 blk_recount_segments(q, bio);
236
237 return bio->bi_phys_segments;
238}
239
240inline int bio_hw_segments(request_queue_t *q, struct bio *bio)
241{
242 if (unlikely(!bio_flagged(bio, BIO_SEG_VALID)))
243 blk_recount_segments(q, bio);
244
245 return bio->bi_hw_segments;
246}
247
248/**
249 * __bio_clone - clone a bio
250 * @bio: destination bio
251 * @bio_src: bio to clone
252 *
253 * Clone a &bio. Caller will own the returned bio, but not
254 * the actual data it points to. Reference count of returned
255 * bio will be one.
256 */
Arjan van de Ven858119e2006-01-14 13:20:43 -0800257void __bio_clone(struct bio *bio, struct bio *bio_src)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700258{
259 request_queue_t *q = bdev_get_queue(bio_src->bi_bdev);
260
Andrew Mortone525e152005-08-07 09:42:12 -0700261 memcpy(bio->bi_io_vec, bio_src->bi_io_vec,
262 bio_src->bi_max_vecs * sizeof(struct bio_vec));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700263
264 bio->bi_sector = bio_src->bi_sector;
265 bio->bi_bdev = bio_src->bi_bdev;
266 bio->bi_flags |= 1 << BIO_CLONED;
267 bio->bi_rw = bio_src->bi_rw;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700268 bio->bi_vcnt = bio_src->bi_vcnt;
269 bio->bi_size = bio_src->bi_size;
Andrew Mortona5453be2005-07-28 01:07:18 -0700270 bio->bi_idx = bio_src->bi_idx;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271 bio_phys_segments(q, bio);
272 bio_hw_segments(q, bio);
273}
274
275/**
276 * bio_clone - clone a bio
277 * @bio: bio to clone
278 * @gfp_mask: allocation priority
279 *
280 * Like __bio_clone, only also allocates the returned bio
281 */
Al Virodd0fc662005-10-07 07:46:04 +0100282struct bio *bio_clone(struct bio *bio, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283{
284 struct bio *b = bio_alloc_bioset(gfp_mask, bio->bi_max_vecs, fs_bio_set);
285
Peter Osterlund36763472005-09-06 15:16:42 -0700286 if (b) {
287 b->bi_destructor = bio_fs_destructor;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700288 __bio_clone(b, bio);
Peter Osterlund36763472005-09-06 15:16:42 -0700289 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290
291 return b;
292}
293
294/**
295 * bio_get_nr_vecs - return approx number of vecs
296 * @bdev: I/O target
297 *
298 * Return the approximate number of pages we can send to this target.
299 * There's no guarantee that you will be able to fit this number of pages
300 * into a bio, it does not account for dynamic restrictions that vary
301 * on offset.
302 */
303int bio_get_nr_vecs(struct block_device *bdev)
304{
305 request_queue_t *q = bdev_get_queue(bdev);
306 int nr_pages;
307
308 nr_pages = ((q->max_sectors << 9) + PAGE_SIZE - 1) >> PAGE_SHIFT;
309 if (nr_pages > q->max_phys_segments)
310 nr_pages = q->max_phys_segments;
311 if (nr_pages > q->max_hw_segments)
312 nr_pages = q->max_hw_segments;
313
314 return nr_pages;
315}
316
317static int __bio_add_page(request_queue_t *q, struct bio *bio, struct page
Mike Christiedefd94b2005-12-05 02:37:06 -0600318 *page, unsigned int len, unsigned int offset,
319 unsigned short max_sectors)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320{
321 int retried_segments = 0;
322 struct bio_vec *bvec;
323
324 /*
325 * cloned bio must not modify vec list
326 */
327 if (unlikely(bio_flagged(bio, BIO_CLONED)))
328 return 0;
329
Jens Axboe80cfd542006-01-06 09:43:28 +0100330 if (((bio->bi_size + len) >> 9) > max_sectors)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700331 return 0;
332
Jens Axboe80cfd542006-01-06 09:43:28 +0100333 /*
334 * For filesystems with a blocksize smaller than the pagesize
335 * we will often be called with the same page as last time and
336 * a consecutive offset. Optimize this special case.
337 */
338 if (bio->bi_vcnt > 0) {
339 struct bio_vec *prev = &bio->bi_io_vec[bio->bi_vcnt - 1];
340
341 if (page == prev->bv_page &&
342 offset == prev->bv_offset + prev->bv_len) {
343 prev->bv_len += len;
344 if (q->merge_bvec_fn &&
345 q->merge_bvec_fn(q, bio, prev) < len) {
346 prev->bv_len -= len;
347 return 0;
348 }
349
350 goto done;
351 }
352 }
353
354 if (bio->bi_vcnt >= bio->bi_max_vecs)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700355 return 0;
356
357 /*
358 * we might lose a segment or two here, but rather that than
359 * make this too complex.
360 */
361
362 while (bio->bi_phys_segments >= q->max_phys_segments
363 || bio->bi_hw_segments >= q->max_hw_segments
364 || BIOVEC_VIRT_OVERSIZE(bio->bi_size)) {
365
366 if (retried_segments)
367 return 0;
368
369 retried_segments = 1;
370 blk_recount_segments(q, bio);
371 }
372
373 /*
374 * setup the new entry, we might clear it again later if we
375 * cannot add the page
376 */
377 bvec = &bio->bi_io_vec[bio->bi_vcnt];
378 bvec->bv_page = page;
379 bvec->bv_len = len;
380 bvec->bv_offset = offset;
381
382 /*
383 * if queue has other restrictions (eg varying max sector size
384 * depending on offset), it can specify a merge_bvec_fn in the
385 * queue to get further control
386 */
387 if (q->merge_bvec_fn) {
388 /*
389 * merge_bvec_fn() returns number of bytes it can accept
390 * at this offset
391 */
392 if (q->merge_bvec_fn(q, bio, bvec) < len) {
393 bvec->bv_page = NULL;
394 bvec->bv_len = 0;
395 bvec->bv_offset = 0;
396 return 0;
397 }
398 }
399
400 /* If we may be able to merge these biovecs, force a recount */
401 if (bio->bi_vcnt && (BIOVEC_PHYS_MERGEABLE(bvec-1, bvec) ||
402 BIOVEC_VIRT_MERGEABLE(bvec-1, bvec)))
403 bio->bi_flags &= ~(1 << BIO_SEG_VALID);
404
405 bio->bi_vcnt++;
406 bio->bi_phys_segments++;
407 bio->bi_hw_segments++;
Jens Axboe80cfd542006-01-06 09:43:28 +0100408 done:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409 bio->bi_size += len;
410 return len;
411}
412
413/**
Mike Christie6e68af62005-11-11 05:30:27 -0600414 * bio_add_pc_page - attempt to add page to bio
Jens Axboefddfdea2006-01-31 15:24:34 +0100415 * @q: the target queue
Mike Christie6e68af62005-11-11 05:30:27 -0600416 * @bio: destination bio
417 * @page: page to add
418 * @len: vec entry length
419 * @offset: vec entry offset
420 *
421 * Attempt to add a page to the bio_vec maplist. This can fail for a
422 * number of reasons, such as the bio being full or target block
423 * device limitations. The target block device must allow bio's
424 * smaller than PAGE_SIZE, so it is always possible to add a single
425 * page to an empty bio. This should only be used by REQ_PC bios.
426 */
427int bio_add_pc_page(request_queue_t *q, struct bio *bio, struct page *page,
428 unsigned int len, unsigned int offset)
429{
Mike Christiedefd94b2005-12-05 02:37:06 -0600430 return __bio_add_page(q, bio, page, len, offset, q->max_hw_sectors);
Mike Christie6e68af62005-11-11 05:30:27 -0600431}
432
433/**
Linus Torvalds1da177e2005-04-16 15:20:36 -0700434 * bio_add_page - attempt to add page to bio
435 * @bio: destination bio
436 * @page: page to add
437 * @len: vec entry length
438 * @offset: vec entry offset
439 *
440 * Attempt to add a page to the bio_vec maplist. This can fail for a
441 * number of reasons, such as the bio being full or target block
442 * device limitations. The target block device must allow bio's
443 * smaller than PAGE_SIZE, so it is always possible to add a single
444 * page to an empty bio.
445 */
446int bio_add_page(struct bio *bio, struct page *page, unsigned int len,
447 unsigned int offset)
448{
Mike Christiedefd94b2005-12-05 02:37:06 -0600449 struct request_queue *q = bdev_get_queue(bio->bi_bdev);
450 return __bio_add_page(q, bio, page, len, offset, q->max_sectors);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700451}
452
453struct bio_map_data {
454 struct bio_vec *iovecs;
455 void __user *userptr;
456};
457
458static void bio_set_map_data(struct bio_map_data *bmd, struct bio *bio)
459{
460 memcpy(bmd->iovecs, bio->bi_io_vec, sizeof(struct bio_vec) * bio->bi_vcnt);
461 bio->bi_private = bmd;
462}
463
464static void bio_free_map_data(struct bio_map_data *bmd)
465{
466 kfree(bmd->iovecs);
467 kfree(bmd);
468}
469
470static struct bio_map_data *bio_alloc_map_data(int nr_segs)
471{
472 struct bio_map_data *bmd = kmalloc(sizeof(*bmd), GFP_KERNEL);
473
474 if (!bmd)
475 return NULL;
476
477 bmd->iovecs = kmalloc(sizeof(struct bio_vec) * nr_segs, GFP_KERNEL);
478 if (bmd->iovecs)
479 return bmd;
480
481 kfree(bmd);
482 return NULL;
483}
484
485/**
486 * bio_uncopy_user - finish previously mapped bio
487 * @bio: bio being terminated
488 *
489 * Free pages allocated from bio_copy_user() and write back data
490 * to user space in case of a read.
491 */
492int bio_uncopy_user(struct bio *bio)
493{
494 struct bio_map_data *bmd = bio->bi_private;
495 const int read = bio_data_dir(bio) == READ;
496 struct bio_vec *bvec;
497 int i, ret = 0;
498
499 __bio_for_each_segment(bvec, bio, i, 0) {
500 char *addr = page_address(bvec->bv_page);
501 unsigned int len = bmd->iovecs[i].bv_len;
502
503 if (read && !ret && copy_to_user(bmd->userptr, addr, len))
504 ret = -EFAULT;
505
506 __free_page(bvec->bv_page);
507 bmd->userptr += len;
508 }
509 bio_free_map_data(bmd);
510 bio_put(bio);
511 return ret;
512}
513
514/**
515 * bio_copy_user - copy user data to bio
516 * @q: destination block queue
517 * @uaddr: start of user address
518 * @len: length in bytes
519 * @write_to_vm: bool indicating writing to pages or not
520 *
521 * Prepares and returns a bio for indirect user io, bouncing data
522 * to/from kernel pages as necessary. Must be paired with
523 * call bio_uncopy_user() on io completion.
524 */
525struct bio *bio_copy_user(request_queue_t *q, unsigned long uaddr,
526 unsigned int len, int write_to_vm)
527{
528 unsigned long end = (uaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
529 unsigned long start = uaddr >> PAGE_SHIFT;
530 struct bio_map_data *bmd;
531 struct bio_vec *bvec;
532 struct page *page;
533 struct bio *bio;
534 int i, ret;
535
536 bmd = bio_alloc_map_data(end - start);
537 if (!bmd)
538 return ERR_PTR(-ENOMEM);
539
540 bmd->userptr = (void __user *) uaddr;
541
542 ret = -ENOMEM;
543 bio = bio_alloc(GFP_KERNEL, end - start);
544 if (!bio)
545 goto out_bmd;
546
547 bio->bi_rw |= (!write_to_vm << BIO_RW);
548
549 ret = 0;
550 while (len) {
551 unsigned int bytes = PAGE_SIZE;
552
553 if (bytes > len)
554 bytes = len;
555
556 page = alloc_page(q->bounce_gfp | GFP_KERNEL);
557 if (!page) {
558 ret = -ENOMEM;
559 break;
560 }
561
Mike Christiedefd94b2005-12-05 02:37:06 -0600562 if (bio_add_pc_page(q, bio, page, bytes, 0) < bytes) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700563 ret = -EINVAL;
564 break;
565 }
566
567 len -= bytes;
568 }
569
570 if (ret)
571 goto cleanup;
572
573 /*
574 * success
575 */
576 if (!write_to_vm) {
577 char __user *p = (char __user *) uaddr;
578
579 /*
580 * for a write, copy in data to kernel pages
581 */
582 ret = -EFAULT;
583 bio_for_each_segment(bvec, bio, i) {
584 char *addr = page_address(bvec->bv_page);
585
586 if (copy_from_user(addr, p, bvec->bv_len))
587 goto cleanup;
588 p += bvec->bv_len;
589 }
590 }
591
592 bio_set_map_data(bmd, bio);
593 return bio;
594cleanup:
595 bio_for_each_segment(bvec, bio, i)
596 __free_page(bvec->bv_page);
597
598 bio_put(bio);
599out_bmd:
600 bio_free_map_data(bmd);
601 return ERR_PTR(ret);
602}
603
James Bottomley f1970ba2005-06-20 14:06:52 +0200604static struct bio *__bio_map_user_iov(request_queue_t *q,
605 struct block_device *bdev,
606 struct sg_iovec *iov, int iov_count,
607 int write_to_vm)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608{
James Bottomley f1970ba2005-06-20 14:06:52 +0200609 int i, j;
610 int nr_pages = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700611 struct page **pages;
612 struct bio *bio;
James Bottomley f1970ba2005-06-20 14:06:52 +0200613 int cur_page = 0;
614 int ret, offset;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700615
James Bottomley f1970ba2005-06-20 14:06:52 +0200616 for (i = 0; i < iov_count; i++) {
617 unsigned long uaddr = (unsigned long)iov[i].iov_base;
618 unsigned long len = iov[i].iov_len;
619 unsigned long end = (uaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
620 unsigned long start = uaddr >> PAGE_SHIFT;
621
622 nr_pages += end - start;
623 /*
624 * transfer and buffer must be aligned to at least hardsector
625 * size for now, in the future we can relax this restriction
626 */
627 if ((uaddr & queue_dma_alignment(q)) || (len & queue_dma_alignment(q)))
628 return ERR_PTR(-EINVAL);
629 }
630
631 if (!nr_pages)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700632 return ERR_PTR(-EINVAL);
633
634 bio = bio_alloc(GFP_KERNEL, nr_pages);
635 if (!bio)
636 return ERR_PTR(-ENOMEM);
637
638 ret = -ENOMEM;
Oliver Neukum11b0b5a2006-03-25 03:08:13 -0800639 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700640 if (!pages)
641 goto out;
642
James Bottomley f1970ba2005-06-20 14:06:52 +0200643 for (i = 0; i < iov_count; i++) {
644 unsigned long uaddr = (unsigned long)iov[i].iov_base;
645 unsigned long len = iov[i].iov_len;
646 unsigned long end = (uaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
647 unsigned long start = uaddr >> PAGE_SHIFT;
648 const int local_nr_pages = end - start;
649 const int page_limit = cur_page + local_nr_pages;
650
651 down_read(&current->mm->mmap_sem);
652 ret = get_user_pages(current, current->mm, uaddr,
653 local_nr_pages,
654 write_to_vm, 0, &pages[cur_page], NULL);
655 up_read(&current->mm->mmap_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700656
James Bottomley f1970ba2005-06-20 14:06:52 +0200657 if (ret < local_nr_pages)
658 goto out_unmap;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700659
Linus Torvalds1da177e2005-04-16 15:20:36 -0700660
James Bottomley f1970ba2005-06-20 14:06:52 +0200661 offset = uaddr & ~PAGE_MASK;
662 for (j = cur_page; j < page_limit; j++) {
663 unsigned int bytes = PAGE_SIZE - offset;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700664
James Bottomley f1970ba2005-06-20 14:06:52 +0200665 if (len <= 0)
666 break;
667
668 if (bytes > len)
669 bytes = len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700670
James Bottomley f1970ba2005-06-20 14:06:52 +0200671 /*
672 * sorry...
673 */
Mike Christiedefd94b2005-12-05 02:37:06 -0600674 if (bio_add_pc_page(q, bio, pages[j], bytes, offset) <
675 bytes)
James Bottomley f1970ba2005-06-20 14:06:52 +0200676 break;
677
678 len -= bytes;
679 offset = 0;
680 }
681
682 cur_page = j;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700683 /*
James Bottomley f1970ba2005-06-20 14:06:52 +0200684 * release the pages we didn't map into the bio, if any
Linus Torvalds1da177e2005-04-16 15:20:36 -0700685 */
James Bottomley f1970ba2005-06-20 14:06:52 +0200686 while (j < page_limit)
687 page_cache_release(pages[j++]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700688 }
689
Linus Torvalds1da177e2005-04-16 15:20:36 -0700690 kfree(pages);
691
692 /*
693 * set data direction, and check if mapped pages need bouncing
694 */
695 if (!write_to_vm)
696 bio->bi_rw |= (1 << BIO_RW);
697
James Bottomley f1970ba2005-06-20 14:06:52 +0200698 bio->bi_bdev = bdev;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700699 bio->bi_flags |= (1 << BIO_USER_MAPPED);
700 return bio;
James Bottomley f1970ba2005-06-20 14:06:52 +0200701
702 out_unmap:
703 for (i = 0; i < nr_pages; i++) {
704 if(!pages[i])
705 break;
706 page_cache_release(pages[i]);
707 }
708 out:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700709 kfree(pages);
710 bio_put(bio);
711 return ERR_PTR(ret);
712}
713
714/**
715 * bio_map_user - map user address into bio
Martin Waitz67be2dd2005-05-01 08:59:26 -0700716 * @q: the request_queue_t for the bio
Linus Torvalds1da177e2005-04-16 15:20:36 -0700717 * @bdev: destination block device
718 * @uaddr: start of user address
719 * @len: length in bytes
720 * @write_to_vm: bool indicating writing to pages or not
721 *
722 * Map the user space address into a bio suitable for io to a block
723 * device. Returns an error pointer in case of error.
724 */
725struct bio *bio_map_user(request_queue_t *q, struct block_device *bdev,
726 unsigned long uaddr, unsigned int len, int write_to_vm)
727{
James Bottomley f1970ba2005-06-20 14:06:52 +0200728 struct sg_iovec iov;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700729
viro@ZenIV.linux.org.uk3f703532005-09-09 16:53:56 +0100730 iov.iov_base = (void __user *)uaddr;
James Bottomley f1970ba2005-06-20 14:06:52 +0200731 iov.iov_len = len;
732
733 return bio_map_user_iov(q, bdev, &iov, 1, write_to_vm);
734}
735
736/**
737 * bio_map_user_iov - map user sg_iovec table into bio
738 * @q: the request_queue_t for the bio
739 * @bdev: destination block device
740 * @iov: the iovec.
741 * @iov_count: number of elements in the iovec
742 * @write_to_vm: bool indicating writing to pages or not
743 *
744 * Map the user space address into a bio suitable for io to a block
745 * device. Returns an error pointer in case of error.
746 */
747struct bio *bio_map_user_iov(request_queue_t *q, struct block_device *bdev,
748 struct sg_iovec *iov, int iov_count,
749 int write_to_vm)
750{
751 struct bio *bio;
752 int len = 0, i;
753
754 bio = __bio_map_user_iov(q, bdev, iov, iov_count, write_to_vm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700755
756 if (IS_ERR(bio))
757 return bio;
758
759 /*
760 * subtle -- if __bio_map_user() ended up bouncing a bio,
761 * it would normally disappear when its bi_end_io is run.
762 * however, we need it for the unmap, so grab an extra
763 * reference to it
764 */
765 bio_get(bio);
766
James Bottomley f1970ba2005-06-20 14:06:52 +0200767 for (i = 0; i < iov_count; i++)
768 len += iov[i].iov_len;
769
Linus Torvalds1da177e2005-04-16 15:20:36 -0700770 if (bio->bi_size == len)
771 return bio;
772
773 /*
774 * don't support partial mappings
775 */
776 bio_endio(bio, bio->bi_size, 0);
777 bio_unmap_user(bio);
778 return ERR_PTR(-EINVAL);
779}
780
781static void __bio_unmap_user(struct bio *bio)
782{
783 struct bio_vec *bvec;
784 int i;
785
786 /*
787 * make sure we dirty pages we wrote to
788 */
789 __bio_for_each_segment(bvec, bio, i, 0) {
790 if (bio_data_dir(bio) == READ)
791 set_page_dirty_lock(bvec->bv_page);
792
793 page_cache_release(bvec->bv_page);
794 }
795
796 bio_put(bio);
797}
798
799/**
800 * bio_unmap_user - unmap a bio
801 * @bio: the bio being unmapped
802 *
803 * Unmap a bio previously mapped by bio_map_user(). Must be called with
804 * a process context.
805 *
806 * bio_unmap_user() may sleep.
807 */
808void bio_unmap_user(struct bio *bio)
809{
810 __bio_unmap_user(bio);
811 bio_put(bio);
812}
813
Jens Axboeb8238252005-06-20 14:05:27 +0200814static int bio_map_kern_endio(struct bio *bio, unsigned int bytes_done, int err)
815{
816 if (bio->bi_size)
817 return 1;
818
819 bio_put(bio);
820 return 0;
821}
822
823
Mike Christie df46b9a2005-06-20 14:04:44 +0200824static struct bio *__bio_map_kern(request_queue_t *q, void *data,
Al Viro27496a82005-10-21 03:20:48 -0400825 unsigned int len, gfp_t gfp_mask)
Mike Christie df46b9a2005-06-20 14:04:44 +0200826{
827 unsigned long kaddr = (unsigned long)data;
828 unsigned long end = (kaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
829 unsigned long start = kaddr >> PAGE_SHIFT;
830 const int nr_pages = end - start;
831 int offset, i;
832 struct bio *bio;
833
834 bio = bio_alloc(gfp_mask, nr_pages);
835 if (!bio)
836 return ERR_PTR(-ENOMEM);
837
838 offset = offset_in_page(kaddr);
839 for (i = 0; i < nr_pages; i++) {
840 unsigned int bytes = PAGE_SIZE - offset;
841
842 if (len <= 0)
843 break;
844
845 if (bytes > len)
846 bytes = len;
847
Mike Christiedefd94b2005-12-05 02:37:06 -0600848 if (bio_add_pc_page(q, bio, virt_to_page(data), bytes,
849 offset) < bytes)
Mike Christie df46b9a2005-06-20 14:04:44 +0200850 break;
851
852 data += bytes;
853 len -= bytes;
854 offset = 0;
855 }
856
Jens Axboeb8238252005-06-20 14:05:27 +0200857 bio->bi_end_io = bio_map_kern_endio;
Mike Christie df46b9a2005-06-20 14:04:44 +0200858 return bio;
859}
860
861/**
862 * bio_map_kern - map kernel address into bio
863 * @q: the request_queue_t for the bio
864 * @data: pointer to buffer to map
865 * @len: length in bytes
866 * @gfp_mask: allocation flags for bio allocation
867 *
868 * Map the kernel address into a bio suitable for io to a block
869 * device. Returns an error pointer in case of error.
870 */
871struct bio *bio_map_kern(request_queue_t *q, void *data, unsigned int len,
Al Viro27496a82005-10-21 03:20:48 -0400872 gfp_t gfp_mask)
Mike Christie df46b9a2005-06-20 14:04:44 +0200873{
874 struct bio *bio;
875
876 bio = __bio_map_kern(q, data, len, gfp_mask);
877 if (IS_ERR(bio))
878 return bio;
879
880 if (bio->bi_size == len)
881 return bio;
882
883 /*
884 * Don't support partial mappings.
885 */
886 bio_put(bio);
887 return ERR_PTR(-EINVAL);
888}
889
Linus Torvalds1da177e2005-04-16 15:20:36 -0700890/*
891 * bio_set_pages_dirty() and bio_check_pages_dirty() are support functions
892 * for performing direct-IO in BIOs.
893 *
894 * The problem is that we cannot run set_page_dirty() from interrupt context
895 * because the required locks are not interrupt-safe. So what we can do is to
896 * mark the pages dirty _before_ performing IO. And in interrupt context,
897 * check that the pages are still dirty. If so, fine. If not, redirty them
898 * in process context.
899 *
900 * We special-case compound pages here: normally this means reads into hugetlb
901 * pages. The logic in here doesn't really work right for compound pages
902 * because the VM does not uniformly chase down the head page in all cases.
903 * But dirtiness of compound pages is pretty meaningless anyway: the VM doesn't
904 * handle them at all. So we skip compound pages here at an early stage.
905 *
906 * Note that this code is very hard to test under normal circumstances because
907 * direct-io pins the pages with get_user_pages(). This makes
908 * is_page_cache_freeable return false, and the VM will not clean the pages.
909 * But other code (eg, pdflush) could clean the pages if they are mapped
910 * pagecache.
911 *
912 * Simply disabling the call to bio_set_pages_dirty() is a good way to test the
913 * deferred bio dirtying paths.
914 */
915
916/*
917 * bio_set_pages_dirty() will mark all the bio's pages as dirty.
918 */
919void bio_set_pages_dirty(struct bio *bio)
920{
921 struct bio_vec *bvec = bio->bi_io_vec;
922 int i;
923
924 for (i = 0; i < bio->bi_vcnt; i++) {
925 struct page *page = bvec[i].bv_page;
926
927 if (page && !PageCompound(page))
928 set_page_dirty_lock(page);
929 }
930}
931
932static void bio_release_pages(struct bio *bio)
933{
934 struct bio_vec *bvec = bio->bi_io_vec;
935 int i;
936
937 for (i = 0; i < bio->bi_vcnt; i++) {
938 struct page *page = bvec[i].bv_page;
939
940 if (page)
941 put_page(page);
942 }
943}
944
945/*
946 * bio_check_pages_dirty() will check that all the BIO's pages are still dirty.
947 * If they are, then fine. If, however, some pages are clean then they must
948 * have been written out during the direct-IO read. So we take another ref on
949 * the BIO and the offending pages and re-dirty the pages in process context.
950 *
951 * It is expected that bio_check_pages_dirty() will wholly own the BIO from
952 * here on. It will run one page_cache_release() against each page and will
953 * run one bio_put() against the BIO.
954 */
955
956static void bio_dirty_fn(void *data);
957
958static DECLARE_WORK(bio_dirty_work, bio_dirty_fn, NULL);
959static DEFINE_SPINLOCK(bio_dirty_lock);
960static struct bio *bio_dirty_list;
961
962/*
963 * This runs in process context
964 */
965static void bio_dirty_fn(void *data)
966{
967 unsigned long flags;
968 struct bio *bio;
969
970 spin_lock_irqsave(&bio_dirty_lock, flags);
971 bio = bio_dirty_list;
972 bio_dirty_list = NULL;
973 spin_unlock_irqrestore(&bio_dirty_lock, flags);
974
975 while (bio) {
976 struct bio *next = bio->bi_private;
977
978 bio_set_pages_dirty(bio);
979 bio_release_pages(bio);
980 bio_put(bio);
981 bio = next;
982 }
983}
984
985void bio_check_pages_dirty(struct bio *bio)
986{
987 struct bio_vec *bvec = bio->bi_io_vec;
988 int nr_clean_pages = 0;
989 int i;
990
991 for (i = 0; i < bio->bi_vcnt; i++) {
992 struct page *page = bvec[i].bv_page;
993
994 if (PageDirty(page) || PageCompound(page)) {
995 page_cache_release(page);
996 bvec[i].bv_page = NULL;
997 } else {
998 nr_clean_pages++;
999 }
1000 }
1001
1002 if (nr_clean_pages) {
1003 unsigned long flags;
1004
1005 spin_lock_irqsave(&bio_dirty_lock, flags);
1006 bio->bi_private = bio_dirty_list;
1007 bio_dirty_list = bio;
1008 spin_unlock_irqrestore(&bio_dirty_lock, flags);
1009 schedule_work(&bio_dirty_work);
1010 } else {
1011 bio_put(bio);
1012 }
1013}
1014
1015/**
1016 * bio_endio - end I/O on a bio
1017 * @bio: bio
1018 * @bytes_done: number of bytes completed
1019 * @error: error, if any
1020 *
1021 * Description:
1022 * bio_endio() will end I/O on @bytes_done number of bytes. This may be
1023 * just a partial part of the bio, or it may be the whole bio. bio_endio()
1024 * is the preferred way to end I/O on a bio, it takes care of decrementing
1025 * bi_size and clearing BIO_UPTODATE on error. @error is 0 on success, and
1026 * and one of the established -Exxxx (-EIO, for instance) error values in
1027 * case something went wrong. Noone should call bi_end_io() directly on
1028 * a bio unless they own it and thus know that it has an end_io function.
1029 **/
1030void bio_endio(struct bio *bio, unsigned int bytes_done, int error)
1031{
1032 if (error)
1033 clear_bit(BIO_UPTODATE, &bio->bi_flags);
1034
1035 if (unlikely(bytes_done > bio->bi_size)) {
1036 printk("%s: want %u bytes done, only %u left\n", __FUNCTION__,
1037 bytes_done, bio->bi_size);
1038 bytes_done = bio->bi_size;
1039 }
1040
1041 bio->bi_size -= bytes_done;
1042 bio->bi_sector += (bytes_done >> 9);
1043
1044 if (bio->bi_end_io)
1045 bio->bi_end_io(bio, bytes_done, error);
1046}
1047
1048void bio_pair_release(struct bio_pair *bp)
1049{
1050 if (atomic_dec_and_test(&bp->cnt)) {
1051 struct bio *master = bp->bio1.bi_private;
1052
1053 bio_endio(master, master->bi_size, bp->error);
1054 mempool_free(bp, bp->bio2.bi_private);
1055 }
1056}
1057
1058static int bio_pair_end_1(struct bio * bi, unsigned int done, int err)
1059{
1060 struct bio_pair *bp = container_of(bi, struct bio_pair, bio1);
1061
1062 if (err)
1063 bp->error = err;
1064
1065 if (bi->bi_size)
1066 return 1;
1067
1068 bio_pair_release(bp);
1069 return 0;
1070}
1071
1072static int bio_pair_end_2(struct bio * bi, unsigned int done, int err)
1073{
1074 struct bio_pair *bp = container_of(bi, struct bio_pair, bio2);
1075
1076 if (err)
1077 bp->error = err;
1078
1079 if (bi->bi_size)
1080 return 1;
1081
1082 bio_pair_release(bp);
1083 return 0;
1084}
1085
1086/*
1087 * split a bio - only worry about a bio with a single page
1088 * in it's iovec
1089 */
1090struct bio_pair *bio_split(struct bio *bi, mempool_t *pool, int first_sectors)
1091{
1092 struct bio_pair *bp = mempool_alloc(pool, GFP_NOIO);
1093
1094 if (!bp)
1095 return bp;
1096
Jens Axboe2056a782006-03-23 20:00:26 +01001097 blk_add_trace_pdu_int(bdev_get_queue(bi->bi_bdev), BLK_TA_SPLIT, bi,
1098 bi->bi_sector + first_sectors);
1099
Linus Torvalds1da177e2005-04-16 15:20:36 -07001100 BUG_ON(bi->bi_vcnt != 1);
1101 BUG_ON(bi->bi_idx != 0);
1102 atomic_set(&bp->cnt, 3);
1103 bp->error = 0;
1104 bp->bio1 = *bi;
1105 bp->bio2 = *bi;
1106 bp->bio2.bi_sector += first_sectors;
1107 bp->bio2.bi_size -= first_sectors << 9;
1108 bp->bio1.bi_size = first_sectors << 9;
1109
1110 bp->bv1 = bi->bi_io_vec[0];
1111 bp->bv2 = bi->bi_io_vec[0];
1112 bp->bv2.bv_offset += first_sectors << 9;
1113 bp->bv2.bv_len -= first_sectors << 9;
1114 bp->bv1.bv_len = first_sectors << 9;
1115
1116 bp->bio1.bi_io_vec = &bp->bv1;
1117 bp->bio2.bi_io_vec = &bp->bv2;
1118
1119 bp->bio1.bi_end_io = bio_pair_end_1;
1120 bp->bio2.bi_end_io = bio_pair_end_2;
1121
1122 bp->bio1.bi_private = bi;
1123 bp->bio2.bi_private = pool;
1124
1125 return bp;
1126}
1127
Al Virodd0fc662005-10-07 07:46:04 +01001128static void *bio_pair_alloc(gfp_t gfp_flags, void *data)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001129{
1130 return kmalloc(sizeof(struct bio_pair), gfp_flags);
1131}
1132
1133static void bio_pair_free(void *bp, void *data)
1134{
1135 kfree(bp);
1136}
1137
1138
1139/*
1140 * create memory pools for biovec's in a bio_set.
1141 * use the global biovec slabs created for general use.
1142 */
1143static int biovec_create_pools(struct bio_set *bs, int pool_entries, int scale)
1144{
1145 int i;
1146
1147 for (i = 0; i < BIOVEC_NR_POOLS; i++) {
1148 struct biovec_slab *bp = bvec_slabs + i;
1149 mempool_t **bvp = bs->bvec_pools + i;
1150
1151 if (i >= scale)
1152 pool_entries >>= 1;
1153
1154 *bvp = mempool_create(pool_entries, mempool_alloc_slab,
1155 mempool_free_slab, bp->slab);
1156 if (!*bvp)
1157 return -ENOMEM;
1158 }
1159 return 0;
1160}
1161
1162static void biovec_free_pools(struct bio_set *bs)
1163{
1164 int i;
1165
1166 for (i = 0; i < BIOVEC_NR_POOLS; i++) {
1167 mempool_t *bvp = bs->bvec_pools[i];
1168
1169 if (bvp)
1170 mempool_destroy(bvp);
1171 }
1172
1173}
1174
1175void bioset_free(struct bio_set *bs)
1176{
1177 if (bs->bio_pool)
1178 mempool_destroy(bs->bio_pool);
1179
1180 biovec_free_pools(bs);
1181
1182 kfree(bs);
1183}
1184
1185struct bio_set *bioset_create(int bio_pool_size, int bvec_pool_size, int scale)
1186{
Oliver Neukum11b0b5a2006-03-25 03:08:13 -08001187 struct bio_set *bs = kzalloc(sizeof(*bs), GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001188
1189 if (!bs)
1190 return NULL;
1191
Linus Torvalds1da177e2005-04-16 15:20:36 -07001192 bs->bio_pool = mempool_create(bio_pool_size, mempool_alloc_slab,
1193 mempool_free_slab, bio_slab);
1194
1195 if (!bs->bio_pool)
1196 goto bad;
1197
1198 if (!biovec_create_pools(bs, bvec_pool_size, scale))
1199 return bs;
1200
1201bad:
1202 bioset_free(bs);
1203 return NULL;
1204}
1205
1206static void __init biovec_init_slabs(void)
1207{
1208 int i;
1209
1210 for (i = 0; i < BIOVEC_NR_POOLS; i++) {
1211 int size;
1212 struct biovec_slab *bvs = bvec_slabs + i;
1213
1214 size = bvs->nr_vecs * sizeof(struct bio_vec);
1215 bvs->slab = kmem_cache_create(bvs->name, size, 0,
1216 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
1217 }
1218}
1219
1220static int __init init_bio(void)
1221{
1222 int megabytes, bvec_pool_entries;
1223 int scale = BIOVEC_NR_POOLS;
1224
1225 bio_slab = kmem_cache_create("bio", sizeof(struct bio), 0,
1226 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL, NULL);
1227
1228 biovec_init_slabs();
1229
1230 megabytes = nr_free_pages() >> (20 - PAGE_SHIFT);
1231
1232 /*
1233 * find out where to start scaling
1234 */
1235 if (megabytes <= 16)
1236 scale = 0;
1237 else if (megabytes <= 32)
1238 scale = 1;
1239 else if (megabytes <= 64)
1240 scale = 2;
1241 else if (megabytes <= 96)
1242 scale = 3;
1243 else if (megabytes <= 128)
1244 scale = 4;
1245
1246 /*
Benjamin LaHaiseb0e6e962006-03-23 03:01:08 -08001247 * Limit number of entries reserved -- mempools are only used when
1248 * the system is completely unable to allocate memory, so we only
1249 * need enough to make progress.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001250 */
Benjamin LaHaiseb0e6e962006-03-23 03:01:08 -08001251 bvec_pool_entries = 1 + scale;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001252
1253 fs_bio_set = bioset_create(BIO_POOL_SIZE, bvec_pool_entries, scale);
1254 if (!fs_bio_set)
1255 panic("bio: can't allocate bios\n");
1256
1257 bio_split_pool = mempool_create(BIO_SPLIT_ENTRIES,
1258 bio_pair_alloc, bio_pair_free, NULL);
1259 if (!bio_split_pool)
1260 panic("bio: can't create split pool\n");
1261
1262 return 0;
1263}
1264
1265subsys_initcall(init_bio);
1266
1267EXPORT_SYMBOL(bio_alloc);
1268EXPORT_SYMBOL(bio_put);
Peter Osterlund36763472005-09-06 15:16:42 -07001269EXPORT_SYMBOL(bio_free);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001270EXPORT_SYMBOL(bio_endio);
1271EXPORT_SYMBOL(bio_init);
1272EXPORT_SYMBOL(__bio_clone);
1273EXPORT_SYMBOL(bio_clone);
1274EXPORT_SYMBOL(bio_phys_segments);
1275EXPORT_SYMBOL(bio_hw_segments);
1276EXPORT_SYMBOL(bio_add_page);
Mike Christie6e68af62005-11-11 05:30:27 -06001277EXPORT_SYMBOL(bio_add_pc_page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001278EXPORT_SYMBOL(bio_get_nr_vecs);
1279EXPORT_SYMBOL(bio_map_user);
1280EXPORT_SYMBOL(bio_unmap_user);
Mike Christie df46b9a2005-06-20 14:04:44 +02001281EXPORT_SYMBOL(bio_map_kern);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001282EXPORT_SYMBOL(bio_pair_release);
1283EXPORT_SYMBOL(bio_split);
1284EXPORT_SYMBOL(bio_split_pool);
1285EXPORT_SYMBOL(bio_copy_user);
1286EXPORT_SYMBOL(bio_uncopy_user);
1287EXPORT_SYMBOL(bioset_create);
1288EXPORT_SYMBOL(bioset_free);
1289EXPORT_SYMBOL(bio_alloc_bioset);