ACPI: thinkpad-acpi: preserve radio state across shutdown
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / fs / bio.c
blob4ad38a6113e83df73128c80843fe4cbb90ec5730
1 /*
2 * Copyright (C) 2001 Jens Axboe <axboe@kernel.dk>
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.
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.
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-
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>
28 #include <linux/blktrace_api.h>
29 #include <scsi/sg.h> /* for struct sg_iovec */
31 static struct kmem_cache *bio_slab __read_mostly;
33 mempool_t *bio_split_pool __read_mostly;
36 * if you change this list, also change bvec_alloc or things will
37 * break badly! cannot be bigger than what you can fit into an
38 * unsigned short
41 #define BV(x) { .nr_vecs = x, .name = "biovec-"__stringify(x) }
42 static struct biovec_slab bvec_slabs[BIOVEC_NR_POOLS] __read_mostly = {
43 BV(1), BV(4), BV(16), BV(64), BV(128), BV(BIO_MAX_PAGES),
45 #undef BV
48 * fs_bio_set is the bio_set containing bio and iovec memory pools used by
49 * IO code that does not need private memory pools.
51 struct bio_set *fs_bio_set;
53 unsigned int bvec_nr_vecs(unsigned short idx)
55 return bvec_slabs[idx].nr_vecs;
58 struct bio_vec *bvec_alloc_bs(gfp_t gfp_mask, int nr, unsigned long *idx, struct bio_set *bs)
60 struct bio_vec *bvl;
63 * see comment near bvec_array define!
65 switch (nr) {
66 case 1 : *idx = 0; break;
67 case 2 ... 4: *idx = 1; break;
68 case 5 ... 16: *idx = 2; break;
69 case 17 ... 64: *idx = 3; break;
70 case 65 ... 128: *idx = 4; break;
71 case 129 ... BIO_MAX_PAGES: *idx = 5; break;
72 default:
73 return NULL;
76 * idx now points to the pool we want to allocate from
79 bvl = mempool_alloc(bs->bvec_pools[*idx], gfp_mask);
80 if (bvl)
81 memset(bvl, 0, bvec_nr_vecs(*idx) * sizeof(struct bio_vec));
83 return bvl;
86 void bio_free(struct bio *bio, struct bio_set *bio_set)
88 if (bio->bi_io_vec) {
89 const int pool_idx = BIO_POOL_IDX(bio);
91 BIO_BUG_ON(pool_idx >= BIOVEC_NR_POOLS);
93 mempool_free(bio->bi_io_vec, bio_set->bvec_pools[pool_idx]);
96 if (bio_integrity(bio))
97 bio_integrity_free(bio, bio_set);
99 mempool_free(bio, bio_set->bio_pool);
103 * default destructor for a bio allocated with bio_alloc_bioset()
105 static void bio_fs_destructor(struct bio *bio)
107 bio_free(bio, fs_bio_set);
110 void bio_init(struct bio *bio)
112 memset(bio, 0, sizeof(*bio));
113 bio->bi_flags = 1 << BIO_UPTODATE;
114 atomic_set(&bio->bi_cnt, 1);
118 * bio_alloc_bioset - allocate a bio for I/O
119 * @gfp_mask: the GFP_ mask given to the slab allocator
120 * @nr_iovecs: number of iovecs to pre-allocate
121 * @bs: the bio_set to allocate from
123 * Description:
124 * bio_alloc_bioset will first try it's on mempool to satisfy the allocation.
125 * If %__GFP_WAIT is set then we will block on the internal pool waiting
126 * for a &struct bio to become free.
128 * allocate bio and iovecs from the memory pools specified by the
129 * bio_set structure.
131 struct bio *bio_alloc_bioset(gfp_t gfp_mask, int nr_iovecs, struct bio_set *bs)
133 struct bio *bio = mempool_alloc(bs->bio_pool, gfp_mask);
135 if (likely(bio)) {
136 struct bio_vec *bvl = NULL;
138 bio_init(bio);
139 if (likely(nr_iovecs)) {
140 unsigned long uninitialized_var(idx);
142 bvl = bvec_alloc_bs(gfp_mask, nr_iovecs, &idx, bs);
143 if (unlikely(!bvl)) {
144 mempool_free(bio, bs->bio_pool);
145 bio = NULL;
146 goto out;
148 bio->bi_flags |= idx << BIO_POOL_OFFSET;
149 bio->bi_max_vecs = bvec_nr_vecs(idx);
151 bio->bi_io_vec = bvl;
153 out:
154 return bio;
157 struct bio *bio_alloc(gfp_t gfp_mask, int nr_iovecs)
159 struct bio *bio = bio_alloc_bioset(gfp_mask, nr_iovecs, fs_bio_set);
161 if (bio)
162 bio->bi_destructor = bio_fs_destructor;
164 return bio;
167 void zero_fill_bio(struct bio *bio)
169 unsigned long flags;
170 struct bio_vec *bv;
171 int i;
173 bio_for_each_segment(bv, bio, i) {
174 char *data = bvec_kmap_irq(bv, &flags);
175 memset(data, 0, bv->bv_len);
176 flush_dcache_page(bv->bv_page);
177 bvec_kunmap_irq(data, &flags);
180 EXPORT_SYMBOL(zero_fill_bio);
183 * bio_put - release a reference to a bio
184 * @bio: bio to release reference to
186 * Description:
187 * Put a reference to a &struct bio, either one you have gotten with
188 * bio_alloc or bio_get. The last put of a bio will free it.
190 void bio_put(struct bio *bio)
192 BIO_BUG_ON(!atomic_read(&bio->bi_cnt));
195 * last put frees it
197 if (atomic_dec_and_test(&bio->bi_cnt)) {
198 bio->bi_next = NULL;
199 bio->bi_destructor(bio);
203 inline int bio_phys_segments(struct request_queue *q, struct bio *bio)
205 if (unlikely(!bio_flagged(bio, BIO_SEG_VALID)))
206 blk_recount_segments(q, bio);
208 return bio->bi_phys_segments;
211 inline int bio_hw_segments(struct request_queue *q, struct bio *bio)
213 if (unlikely(!bio_flagged(bio, BIO_SEG_VALID)))
214 blk_recount_segments(q, bio);
216 return bio->bi_hw_segments;
220 * __bio_clone - clone a bio
221 * @bio: destination bio
222 * @bio_src: bio to clone
224 * Clone a &bio. Caller will own the returned bio, but not
225 * the actual data it points to. Reference count of returned
226 * bio will be one.
228 void __bio_clone(struct bio *bio, struct bio *bio_src)
230 memcpy(bio->bi_io_vec, bio_src->bi_io_vec,
231 bio_src->bi_max_vecs * sizeof(struct bio_vec));
234 * most users will be overriding ->bi_bdev with a new target,
235 * so we don't set nor calculate new physical/hw segment counts here
237 bio->bi_sector = bio_src->bi_sector;
238 bio->bi_bdev = bio_src->bi_bdev;
239 bio->bi_flags |= 1 << BIO_CLONED;
240 bio->bi_rw = bio_src->bi_rw;
241 bio->bi_vcnt = bio_src->bi_vcnt;
242 bio->bi_size = bio_src->bi_size;
243 bio->bi_idx = bio_src->bi_idx;
247 * bio_clone - clone a bio
248 * @bio: bio to clone
249 * @gfp_mask: allocation priority
251 * Like __bio_clone, only also allocates the returned bio
253 struct bio *bio_clone(struct bio *bio, gfp_t gfp_mask)
255 struct bio *b = bio_alloc_bioset(gfp_mask, bio->bi_max_vecs, fs_bio_set);
257 if (!b)
258 return NULL;
260 b->bi_destructor = bio_fs_destructor;
261 __bio_clone(b, bio);
263 if (bio_integrity(bio)) {
264 int ret;
266 ret = bio_integrity_clone(b, bio, fs_bio_set);
268 if (ret < 0)
269 return NULL;
272 return b;
276 * bio_get_nr_vecs - return approx number of vecs
277 * @bdev: I/O target
279 * Return the approximate number of pages we can send to this target.
280 * There's no guarantee that you will be able to fit this number of pages
281 * into a bio, it does not account for dynamic restrictions that vary
282 * on offset.
284 int bio_get_nr_vecs(struct block_device *bdev)
286 struct request_queue *q = bdev_get_queue(bdev);
287 int nr_pages;
289 nr_pages = ((q->max_sectors << 9) + PAGE_SIZE - 1) >> PAGE_SHIFT;
290 if (nr_pages > q->max_phys_segments)
291 nr_pages = q->max_phys_segments;
292 if (nr_pages > q->max_hw_segments)
293 nr_pages = q->max_hw_segments;
295 return nr_pages;
298 static int __bio_add_page(struct request_queue *q, struct bio *bio, struct page
299 *page, unsigned int len, unsigned int offset,
300 unsigned short max_sectors)
302 int retried_segments = 0;
303 struct bio_vec *bvec;
306 * cloned bio must not modify vec list
308 if (unlikely(bio_flagged(bio, BIO_CLONED)))
309 return 0;
311 if (((bio->bi_size + len) >> 9) > max_sectors)
312 return 0;
315 * For filesystems with a blocksize smaller than the pagesize
316 * we will often be called with the same page as last time and
317 * a consecutive offset. Optimize this special case.
319 if (bio->bi_vcnt > 0) {
320 struct bio_vec *prev = &bio->bi_io_vec[bio->bi_vcnt - 1];
322 if (page == prev->bv_page &&
323 offset == prev->bv_offset + prev->bv_len) {
324 prev->bv_len += len;
326 if (q->merge_bvec_fn) {
327 struct bvec_merge_data bvm = {
328 .bi_bdev = bio->bi_bdev,
329 .bi_sector = bio->bi_sector,
330 .bi_size = bio->bi_size,
331 .bi_rw = bio->bi_rw,
334 if (q->merge_bvec_fn(q, &bvm, prev) < len) {
335 prev->bv_len -= len;
336 return 0;
340 goto done;
344 if (bio->bi_vcnt >= bio->bi_max_vecs)
345 return 0;
348 * we might lose a segment or two here, but rather that than
349 * make this too complex.
352 while (bio->bi_phys_segments >= q->max_phys_segments
353 || bio->bi_hw_segments >= q->max_hw_segments
354 || BIOVEC_VIRT_OVERSIZE(bio->bi_size)) {
356 if (retried_segments)
357 return 0;
359 retried_segments = 1;
360 blk_recount_segments(q, bio);
364 * setup the new entry, we might clear it again later if we
365 * cannot add the page
367 bvec = &bio->bi_io_vec[bio->bi_vcnt];
368 bvec->bv_page = page;
369 bvec->bv_len = len;
370 bvec->bv_offset = offset;
373 * if queue has other restrictions (eg varying max sector size
374 * depending on offset), it can specify a merge_bvec_fn in the
375 * queue to get further control
377 if (q->merge_bvec_fn) {
378 struct bvec_merge_data bvm = {
379 .bi_bdev = bio->bi_bdev,
380 .bi_sector = bio->bi_sector,
381 .bi_size = bio->bi_size,
382 .bi_rw = bio->bi_rw,
386 * merge_bvec_fn() returns number of bytes it can accept
387 * at this offset
389 if (q->merge_bvec_fn(q, &bvm, bvec) < len) {
390 bvec->bv_page = NULL;
391 bvec->bv_len = 0;
392 bvec->bv_offset = 0;
393 return 0;
397 /* If we may be able to merge these biovecs, force a recount */
398 if (bio->bi_vcnt && (BIOVEC_PHYS_MERGEABLE(bvec-1, bvec) ||
399 BIOVEC_VIRT_MERGEABLE(bvec-1, bvec)))
400 bio->bi_flags &= ~(1 << BIO_SEG_VALID);
402 bio->bi_vcnt++;
403 bio->bi_phys_segments++;
404 bio->bi_hw_segments++;
405 done:
406 bio->bi_size += len;
407 return len;
411 * bio_add_pc_page - attempt to add page to bio
412 * @q: the target queue
413 * @bio: destination bio
414 * @page: page to add
415 * @len: vec entry length
416 * @offset: vec entry offset
418 * Attempt to add a page to the bio_vec maplist. This can fail for a
419 * number of reasons, such as the bio being full or target block
420 * device limitations. The target block device must allow bio's
421 * smaller than PAGE_SIZE, so it is always possible to add a single
422 * page to an empty bio. This should only be used by REQ_PC bios.
424 int bio_add_pc_page(struct request_queue *q, struct bio *bio, struct page *page,
425 unsigned int len, unsigned int offset)
427 return __bio_add_page(q, bio, page, len, offset, q->max_hw_sectors);
431 * bio_add_page - attempt to add page to bio
432 * @bio: destination bio
433 * @page: page to add
434 * @len: vec entry length
435 * @offset: vec entry offset
437 * Attempt to add a page to the bio_vec maplist. This can fail for a
438 * number of reasons, such as the bio being full or target block
439 * device limitations. The target block device must allow bio's
440 * smaller than PAGE_SIZE, so it is always possible to add a single
441 * page to an empty bio.
443 int bio_add_page(struct bio *bio, struct page *page, unsigned int len,
444 unsigned int offset)
446 struct request_queue *q = bdev_get_queue(bio->bi_bdev);
447 return __bio_add_page(q, bio, page, len, offset, q->max_sectors);
450 struct bio_map_data {
451 struct bio_vec *iovecs;
452 int nr_sgvecs;
453 struct sg_iovec *sgvecs;
456 static void bio_set_map_data(struct bio_map_data *bmd, struct bio *bio,
457 struct sg_iovec *iov, int iov_count)
459 memcpy(bmd->iovecs, bio->bi_io_vec, sizeof(struct bio_vec) * bio->bi_vcnt);
460 memcpy(bmd->sgvecs, iov, sizeof(struct sg_iovec) * iov_count);
461 bmd->nr_sgvecs = iov_count;
462 bio->bi_private = bmd;
465 static void bio_free_map_data(struct bio_map_data *bmd)
467 kfree(bmd->iovecs);
468 kfree(bmd->sgvecs);
469 kfree(bmd);
472 static struct bio_map_data *bio_alloc_map_data(int nr_segs, int iov_count,
473 gfp_t gfp_mask)
475 struct bio_map_data *bmd = kmalloc(sizeof(*bmd), gfp_mask);
477 if (!bmd)
478 return NULL;
480 bmd->iovecs = kmalloc(sizeof(struct bio_vec) * nr_segs, gfp_mask);
481 if (!bmd->iovecs) {
482 kfree(bmd);
483 return NULL;
486 bmd->sgvecs = kmalloc(sizeof(struct sg_iovec) * iov_count, gfp_mask);
487 if (bmd->sgvecs)
488 return bmd;
490 kfree(bmd->iovecs);
491 kfree(bmd);
492 return NULL;
495 static int __bio_copy_iov(struct bio *bio, struct bio_vec *iovecs,
496 struct sg_iovec *iov, int iov_count, int uncopy)
498 int ret = 0, i;
499 struct bio_vec *bvec;
500 int iov_idx = 0;
501 unsigned int iov_off = 0;
502 int read = bio_data_dir(bio) == READ;
504 __bio_for_each_segment(bvec, bio, i, 0) {
505 char *bv_addr = page_address(bvec->bv_page);
506 unsigned int bv_len = iovecs[i].bv_len;
508 while (bv_len && iov_idx < iov_count) {
509 unsigned int bytes;
510 char *iov_addr;
512 bytes = min_t(unsigned int,
513 iov[iov_idx].iov_len - iov_off, bv_len);
514 iov_addr = iov[iov_idx].iov_base + iov_off;
516 if (!ret) {
517 if (!read && !uncopy)
518 ret = copy_from_user(bv_addr, iov_addr,
519 bytes);
520 if (read && uncopy)
521 ret = copy_to_user(iov_addr, bv_addr,
522 bytes);
524 if (ret)
525 ret = -EFAULT;
528 bv_len -= bytes;
529 bv_addr += bytes;
530 iov_addr += bytes;
531 iov_off += bytes;
533 if (iov[iov_idx].iov_len == iov_off) {
534 iov_idx++;
535 iov_off = 0;
539 if (uncopy)
540 __free_page(bvec->bv_page);
543 return ret;
547 * bio_uncopy_user - finish previously mapped bio
548 * @bio: bio being terminated
550 * Free pages allocated from bio_copy_user() and write back data
551 * to user space in case of a read.
553 int bio_uncopy_user(struct bio *bio)
555 struct bio_map_data *bmd = bio->bi_private;
556 int ret;
558 ret = __bio_copy_iov(bio, bmd->iovecs, bmd->sgvecs, bmd->nr_sgvecs, 1);
560 bio_free_map_data(bmd);
561 bio_put(bio);
562 return ret;
566 * bio_copy_user_iov - copy user data to bio
567 * @q: destination block queue
568 * @iov: the iovec.
569 * @iov_count: number of elements in the iovec
570 * @write_to_vm: bool indicating writing to pages or not
572 * Prepares and returns a bio for indirect user io, bouncing data
573 * to/from kernel pages as necessary. Must be paired with
574 * call bio_uncopy_user() on io completion.
576 struct bio *bio_copy_user_iov(struct request_queue *q, struct sg_iovec *iov,
577 int iov_count, int write_to_vm)
579 struct bio_map_data *bmd;
580 struct bio_vec *bvec;
581 struct page *page;
582 struct bio *bio;
583 int i, ret;
584 int nr_pages = 0;
585 unsigned int len = 0;
587 for (i = 0; i < iov_count; i++) {
588 unsigned long uaddr;
589 unsigned long end;
590 unsigned long start;
592 uaddr = (unsigned long)iov[i].iov_base;
593 end = (uaddr + iov[i].iov_len + PAGE_SIZE - 1) >> PAGE_SHIFT;
594 start = uaddr >> PAGE_SHIFT;
597 * Overflow, abort
599 if (end < start)
600 return ERR_PTR(-EINVAL);
602 nr_pages += end - start;
603 len += iov[i].iov_len;
606 bmd = bio_alloc_map_data(nr_pages, iov_count, GFP_KERNEL);
607 if (!bmd)
608 return ERR_PTR(-ENOMEM);
610 ret = -ENOMEM;
611 bio = bio_alloc(GFP_KERNEL, nr_pages);
612 if (!bio)
613 goto out_bmd;
615 bio->bi_rw |= (!write_to_vm << BIO_RW);
617 ret = 0;
618 while (len) {
619 unsigned int bytes = PAGE_SIZE;
621 if (bytes > len)
622 bytes = len;
624 page = alloc_page(q->bounce_gfp | GFP_KERNEL);
625 if (!page) {
626 ret = -ENOMEM;
627 break;
630 if (bio_add_pc_page(q, bio, page, bytes, 0) < bytes)
631 break;
633 len -= bytes;
636 if (ret)
637 goto cleanup;
640 * success
642 if (!write_to_vm) {
643 ret = __bio_copy_iov(bio, bio->bi_io_vec, iov, iov_count, 0);
644 if (ret)
645 goto cleanup;
648 bio_set_map_data(bmd, bio, iov, iov_count);
649 return bio;
650 cleanup:
651 bio_for_each_segment(bvec, bio, i)
652 __free_page(bvec->bv_page);
654 bio_put(bio);
655 out_bmd:
656 bio_free_map_data(bmd);
657 return ERR_PTR(ret);
661 * bio_copy_user - copy user data to bio
662 * @q: destination block queue
663 * @uaddr: start of user address
664 * @len: length in bytes
665 * @write_to_vm: bool indicating writing to pages or not
667 * Prepares and returns a bio for indirect user io, bouncing data
668 * to/from kernel pages as necessary. Must be paired with
669 * call bio_uncopy_user() on io completion.
671 struct bio *bio_copy_user(struct request_queue *q, unsigned long uaddr,
672 unsigned int len, int write_to_vm)
674 struct sg_iovec iov;
676 iov.iov_base = (void __user *)uaddr;
677 iov.iov_len = len;
679 return bio_copy_user_iov(q, &iov, 1, write_to_vm);
682 static struct bio *__bio_map_user_iov(struct request_queue *q,
683 struct block_device *bdev,
684 struct sg_iovec *iov, int iov_count,
685 int write_to_vm)
687 int i, j;
688 int nr_pages = 0;
689 struct page **pages;
690 struct bio *bio;
691 int cur_page = 0;
692 int ret, offset;
694 for (i = 0; i < iov_count; i++) {
695 unsigned long uaddr = (unsigned long)iov[i].iov_base;
696 unsigned long len = iov[i].iov_len;
697 unsigned long end = (uaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
698 unsigned long start = uaddr >> PAGE_SHIFT;
701 * Overflow, abort
703 if (end < start)
704 return ERR_PTR(-EINVAL);
706 nr_pages += end - start;
708 * buffer must be aligned to at least hardsector size for now
710 if (uaddr & queue_dma_alignment(q))
711 return ERR_PTR(-EINVAL);
714 if (!nr_pages)
715 return ERR_PTR(-EINVAL);
717 bio = bio_alloc(GFP_KERNEL, nr_pages);
718 if (!bio)
719 return ERR_PTR(-ENOMEM);
721 ret = -ENOMEM;
722 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_KERNEL);
723 if (!pages)
724 goto out;
726 for (i = 0; i < iov_count; i++) {
727 unsigned long uaddr = (unsigned long)iov[i].iov_base;
728 unsigned long len = iov[i].iov_len;
729 unsigned long end = (uaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
730 unsigned long start = uaddr >> PAGE_SHIFT;
731 const int local_nr_pages = end - start;
732 const int page_limit = cur_page + local_nr_pages;
734 ret = get_user_pages_fast(uaddr, local_nr_pages,
735 write_to_vm, &pages[cur_page]);
736 if (ret < local_nr_pages) {
737 ret = -EFAULT;
738 goto out_unmap;
741 offset = uaddr & ~PAGE_MASK;
742 for (j = cur_page; j < page_limit; j++) {
743 unsigned int bytes = PAGE_SIZE - offset;
745 if (len <= 0)
746 break;
748 if (bytes > len)
749 bytes = len;
752 * sorry...
754 if (bio_add_pc_page(q, bio, pages[j], bytes, offset) <
755 bytes)
756 break;
758 len -= bytes;
759 offset = 0;
762 cur_page = j;
764 * release the pages we didn't map into the bio, if any
766 while (j < page_limit)
767 page_cache_release(pages[j++]);
770 kfree(pages);
773 * set data direction, and check if mapped pages need bouncing
775 if (!write_to_vm)
776 bio->bi_rw |= (1 << BIO_RW);
778 bio->bi_bdev = bdev;
779 bio->bi_flags |= (1 << BIO_USER_MAPPED);
780 return bio;
782 out_unmap:
783 for (i = 0; i < nr_pages; i++) {
784 if(!pages[i])
785 break;
786 page_cache_release(pages[i]);
788 out:
789 kfree(pages);
790 bio_put(bio);
791 return ERR_PTR(ret);
795 * bio_map_user - map user address into bio
796 * @q: the struct request_queue for the bio
797 * @bdev: destination block device
798 * @uaddr: start of user address
799 * @len: length in bytes
800 * @write_to_vm: bool indicating writing to pages or not
802 * Map the user space address into a bio suitable for io to a block
803 * device. Returns an error pointer in case of error.
805 struct bio *bio_map_user(struct request_queue *q, struct block_device *bdev,
806 unsigned long uaddr, unsigned int len, int write_to_vm)
808 struct sg_iovec iov;
810 iov.iov_base = (void __user *)uaddr;
811 iov.iov_len = len;
813 return bio_map_user_iov(q, bdev, &iov, 1, write_to_vm);
817 * bio_map_user_iov - map user sg_iovec table into bio
818 * @q: the struct request_queue for the bio
819 * @bdev: destination block device
820 * @iov: the iovec.
821 * @iov_count: number of elements in the iovec
822 * @write_to_vm: bool indicating writing to pages or not
824 * Map the user space address into a bio suitable for io to a block
825 * device. Returns an error pointer in case of error.
827 struct bio *bio_map_user_iov(struct request_queue *q, struct block_device *bdev,
828 struct sg_iovec *iov, int iov_count,
829 int write_to_vm)
831 struct bio *bio;
833 bio = __bio_map_user_iov(q, bdev, iov, iov_count, write_to_vm);
835 if (IS_ERR(bio))
836 return bio;
839 * subtle -- if __bio_map_user() ended up bouncing a bio,
840 * it would normally disappear when its bi_end_io is run.
841 * however, we need it for the unmap, so grab an extra
842 * reference to it
844 bio_get(bio);
846 return bio;
849 static void __bio_unmap_user(struct bio *bio)
851 struct bio_vec *bvec;
852 int i;
855 * make sure we dirty pages we wrote to
857 __bio_for_each_segment(bvec, bio, i, 0) {
858 if (bio_data_dir(bio) == READ)
859 set_page_dirty_lock(bvec->bv_page);
861 page_cache_release(bvec->bv_page);
864 bio_put(bio);
868 * bio_unmap_user - unmap a bio
869 * @bio: the bio being unmapped
871 * Unmap a bio previously mapped by bio_map_user(). Must be called with
872 * a process context.
874 * bio_unmap_user() may sleep.
876 void bio_unmap_user(struct bio *bio)
878 __bio_unmap_user(bio);
879 bio_put(bio);
882 static void bio_map_kern_endio(struct bio *bio, int err)
884 bio_put(bio);
888 static struct bio *__bio_map_kern(struct request_queue *q, void *data,
889 unsigned int len, gfp_t gfp_mask)
891 unsigned long kaddr = (unsigned long)data;
892 unsigned long end = (kaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
893 unsigned long start = kaddr >> PAGE_SHIFT;
894 const int nr_pages = end - start;
895 int offset, i;
896 struct bio *bio;
898 bio = bio_alloc(gfp_mask, nr_pages);
899 if (!bio)
900 return ERR_PTR(-ENOMEM);
902 offset = offset_in_page(kaddr);
903 for (i = 0; i < nr_pages; i++) {
904 unsigned int bytes = PAGE_SIZE - offset;
906 if (len <= 0)
907 break;
909 if (bytes > len)
910 bytes = len;
912 if (bio_add_pc_page(q, bio, virt_to_page(data), bytes,
913 offset) < bytes)
914 break;
916 data += bytes;
917 len -= bytes;
918 offset = 0;
921 bio->bi_end_io = bio_map_kern_endio;
922 return bio;
926 * bio_map_kern - map kernel address into bio
927 * @q: the struct request_queue for the bio
928 * @data: pointer to buffer to map
929 * @len: length in bytes
930 * @gfp_mask: allocation flags for bio allocation
932 * Map the kernel address into a bio suitable for io to a block
933 * device. Returns an error pointer in case of error.
935 struct bio *bio_map_kern(struct request_queue *q, void *data, unsigned int len,
936 gfp_t gfp_mask)
938 struct bio *bio;
940 bio = __bio_map_kern(q, data, len, gfp_mask);
941 if (IS_ERR(bio))
942 return bio;
944 if (bio->bi_size == len)
945 return bio;
948 * Don't support partial mappings.
950 bio_put(bio);
951 return ERR_PTR(-EINVAL);
954 static void bio_copy_kern_endio(struct bio *bio, int err)
956 struct bio_vec *bvec;
957 const int read = bio_data_dir(bio) == READ;
958 struct bio_map_data *bmd = bio->bi_private;
959 int i;
960 char *p = bmd->sgvecs[0].iov_base;
962 __bio_for_each_segment(bvec, bio, i, 0) {
963 char *addr = page_address(bvec->bv_page);
964 int len = bmd->iovecs[i].bv_len;
966 if (read && !err)
967 memcpy(p, addr, len);
969 __free_page(bvec->bv_page);
970 p += len;
973 bio_free_map_data(bmd);
974 bio_put(bio);
978 * bio_copy_kern - copy kernel address into bio
979 * @q: the struct request_queue for the bio
980 * @data: pointer to buffer to copy
981 * @len: length in bytes
982 * @gfp_mask: allocation flags for bio and page allocation
983 * @reading: data direction is READ
985 * copy the kernel address into a bio suitable for io to a block
986 * device. Returns an error pointer in case of error.
988 struct bio *bio_copy_kern(struct request_queue *q, void *data, unsigned int len,
989 gfp_t gfp_mask, int reading)
991 unsigned long kaddr = (unsigned long)data;
992 unsigned long end = (kaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
993 unsigned long start = kaddr >> PAGE_SHIFT;
994 const int nr_pages = end - start;
995 struct bio *bio;
996 struct bio_vec *bvec;
997 struct bio_map_data *bmd;
998 int i, ret;
999 struct sg_iovec iov;
1001 iov.iov_base = data;
1002 iov.iov_len = len;
1004 bmd = bio_alloc_map_data(nr_pages, 1, gfp_mask);
1005 if (!bmd)
1006 return ERR_PTR(-ENOMEM);
1008 ret = -ENOMEM;
1009 bio = bio_alloc(gfp_mask, nr_pages);
1010 if (!bio)
1011 goto out_bmd;
1013 while (len) {
1014 struct page *page;
1015 unsigned int bytes = PAGE_SIZE;
1017 if (bytes > len)
1018 bytes = len;
1020 page = alloc_page(q->bounce_gfp | gfp_mask);
1021 if (!page) {
1022 ret = -ENOMEM;
1023 goto cleanup;
1026 if (bio_add_pc_page(q, bio, page, bytes, 0) < bytes) {
1027 ret = -EINVAL;
1028 goto cleanup;
1031 len -= bytes;
1034 if (!reading) {
1035 void *p = data;
1037 bio_for_each_segment(bvec, bio, i) {
1038 char *addr = page_address(bvec->bv_page);
1040 memcpy(addr, p, bvec->bv_len);
1041 p += bvec->bv_len;
1045 bio->bi_private = bmd;
1046 bio->bi_end_io = bio_copy_kern_endio;
1048 bio_set_map_data(bmd, bio, &iov, 1);
1049 return bio;
1050 cleanup:
1051 bio_for_each_segment(bvec, bio, i)
1052 __free_page(bvec->bv_page);
1054 bio_put(bio);
1055 out_bmd:
1056 bio_free_map_data(bmd);
1058 return ERR_PTR(ret);
1062 * bio_set_pages_dirty() and bio_check_pages_dirty() are support functions
1063 * for performing direct-IO in BIOs.
1065 * The problem is that we cannot run set_page_dirty() from interrupt context
1066 * because the required locks are not interrupt-safe. So what we can do is to
1067 * mark the pages dirty _before_ performing IO. And in interrupt context,
1068 * check that the pages are still dirty. If so, fine. If not, redirty them
1069 * in process context.
1071 * We special-case compound pages here: normally this means reads into hugetlb
1072 * pages. The logic in here doesn't really work right for compound pages
1073 * because the VM does not uniformly chase down the head page in all cases.
1074 * But dirtiness of compound pages is pretty meaningless anyway: the VM doesn't
1075 * handle them at all. So we skip compound pages here at an early stage.
1077 * Note that this code is very hard to test under normal circumstances because
1078 * direct-io pins the pages with get_user_pages(). This makes
1079 * is_page_cache_freeable return false, and the VM will not clean the pages.
1080 * But other code (eg, pdflush) could clean the pages if they are mapped
1081 * pagecache.
1083 * Simply disabling the call to bio_set_pages_dirty() is a good way to test the
1084 * deferred bio dirtying paths.
1088 * bio_set_pages_dirty() will mark all the bio's pages as dirty.
1090 void bio_set_pages_dirty(struct bio *bio)
1092 struct bio_vec *bvec = bio->bi_io_vec;
1093 int i;
1095 for (i = 0; i < bio->bi_vcnt; i++) {
1096 struct page *page = bvec[i].bv_page;
1098 if (page && !PageCompound(page))
1099 set_page_dirty_lock(page);
1103 static void bio_release_pages(struct bio *bio)
1105 struct bio_vec *bvec = bio->bi_io_vec;
1106 int i;
1108 for (i = 0; i < bio->bi_vcnt; i++) {
1109 struct page *page = bvec[i].bv_page;
1111 if (page)
1112 put_page(page);
1117 * bio_check_pages_dirty() will check that all the BIO's pages are still dirty.
1118 * If they are, then fine. If, however, some pages are clean then they must
1119 * have been written out during the direct-IO read. So we take another ref on
1120 * the BIO and the offending pages and re-dirty the pages in process context.
1122 * It is expected that bio_check_pages_dirty() will wholly own the BIO from
1123 * here on. It will run one page_cache_release() against each page and will
1124 * run one bio_put() against the BIO.
1127 static void bio_dirty_fn(struct work_struct *work);
1129 static DECLARE_WORK(bio_dirty_work, bio_dirty_fn);
1130 static DEFINE_SPINLOCK(bio_dirty_lock);
1131 static struct bio *bio_dirty_list;
1134 * This runs in process context
1136 static void bio_dirty_fn(struct work_struct *work)
1138 unsigned long flags;
1139 struct bio *bio;
1141 spin_lock_irqsave(&bio_dirty_lock, flags);
1142 bio = bio_dirty_list;
1143 bio_dirty_list = NULL;
1144 spin_unlock_irqrestore(&bio_dirty_lock, flags);
1146 while (bio) {
1147 struct bio *next = bio->bi_private;
1149 bio_set_pages_dirty(bio);
1150 bio_release_pages(bio);
1151 bio_put(bio);
1152 bio = next;
1156 void bio_check_pages_dirty(struct bio *bio)
1158 struct bio_vec *bvec = bio->bi_io_vec;
1159 int nr_clean_pages = 0;
1160 int i;
1162 for (i = 0; i < bio->bi_vcnt; i++) {
1163 struct page *page = bvec[i].bv_page;
1165 if (PageDirty(page) || PageCompound(page)) {
1166 page_cache_release(page);
1167 bvec[i].bv_page = NULL;
1168 } else {
1169 nr_clean_pages++;
1173 if (nr_clean_pages) {
1174 unsigned long flags;
1176 spin_lock_irqsave(&bio_dirty_lock, flags);
1177 bio->bi_private = bio_dirty_list;
1178 bio_dirty_list = bio;
1179 spin_unlock_irqrestore(&bio_dirty_lock, flags);
1180 schedule_work(&bio_dirty_work);
1181 } else {
1182 bio_put(bio);
1187 * bio_endio - end I/O on a bio
1188 * @bio: bio
1189 * @error: error, if any
1191 * Description:
1192 * bio_endio() will end I/O on the whole bio. bio_endio() is the
1193 * preferred way to end I/O on a bio, it takes care of clearing
1194 * BIO_UPTODATE on error. @error is 0 on success, and and one of the
1195 * established -Exxxx (-EIO, for instance) error values in case
1196 * something went wrong. Noone should call bi_end_io() directly on a
1197 * bio unless they own it and thus know that it has an end_io
1198 * function.
1200 void bio_endio(struct bio *bio, int error)
1202 if (error)
1203 clear_bit(BIO_UPTODATE, &bio->bi_flags);
1204 else if (!test_bit(BIO_UPTODATE, &bio->bi_flags))
1205 error = -EIO;
1207 if (bio->bi_end_io)
1208 bio->bi_end_io(bio, error);
1211 void bio_pair_release(struct bio_pair *bp)
1213 if (atomic_dec_and_test(&bp->cnt)) {
1214 struct bio *master = bp->bio1.bi_private;
1216 bio_endio(master, bp->error);
1217 mempool_free(bp, bp->bio2.bi_private);
1221 static void bio_pair_end_1(struct bio *bi, int err)
1223 struct bio_pair *bp = container_of(bi, struct bio_pair, bio1);
1225 if (err)
1226 bp->error = err;
1228 bio_pair_release(bp);
1231 static void bio_pair_end_2(struct bio *bi, int err)
1233 struct bio_pair *bp = container_of(bi, struct bio_pair, bio2);
1235 if (err)
1236 bp->error = err;
1238 bio_pair_release(bp);
1242 * split a bio - only worry about a bio with a single page
1243 * in it's iovec
1245 struct bio_pair *bio_split(struct bio *bi, mempool_t *pool, int first_sectors)
1247 struct bio_pair *bp = mempool_alloc(pool, GFP_NOIO);
1249 if (!bp)
1250 return bp;
1252 blk_add_trace_pdu_int(bdev_get_queue(bi->bi_bdev), BLK_TA_SPLIT, bi,
1253 bi->bi_sector + first_sectors);
1255 BUG_ON(bi->bi_vcnt != 1);
1256 BUG_ON(bi->bi_idx != 0);
1257 atomic_set(&bp->cnt, 3);
1258 bp->error = 0;
1259 bp->bio1 = *bi;
1260 bp->bio2 = *bi;
1261 bp->bio2.bi_sector += first_sectors;
1262 bp->bio2.bi_size -= first_sectors << 9;
1263 bp->bio1.bi_size = first_sectors << 9;
1265 bp->bv1 = bi->bi_io_vec[0];
1266 bp->bv2 = bi->bi_io_vec[0];
1267 bp->bv2.bv_offset += first_sectors << 9;
1268 bp->bv2.bv_len -= first_sectors << 9;
1269 bp->bv1.bv_len = first_sectors << 9;
1271 bp->bio1.bi_io_vec = &bp->bv1;
1272 bp->bio2.bi_io_vec = &bp->bv2;
1274 bp->bio1.bi_max_vecs = 1;
1275 bp->bio2.bi_max_vecs = 1;
1277 bp->bio1.bi_end_io = bio_pair_end_1;
1278 bp->bio2.bi_end_io = bio_pair_end_2;
1280 bp->bio1.bi_private = bi;
1281 bp->bio2.bi_private = pool;
1283 if (bio_integrity(bi))
1284 bio_integrity_split(bi, bp, first_sectors);
1286 return bp;
1291 * create memory pools for biovec's in a bio_set.
1292 * use the global biovec slabs created for general use.
1294 static int biovec_create_pools(struct bio_set *bs, int pool_entries)
1296 int i;
1298 for (i = 0; i < BIOVEC_NR_POOLS; i++) {
1299 struct biovec_slab *bp = bvec_slabs + i;
1300 mempool_t **bvp = bs->bvec_pools + i;
1302 *bvp = mempool_create_slab_pool(pool_entries, bp->slab);
1303 if (!*bvp)
1304 return -ENOMEM;
1306 return 0;
1309 static void biovec_free_pools(struct bio_set *bs)
1311 int i;
1313 for (i = 0; i < BIOVEC_NR_POOLS; i++) {
1314 mempool_t *bvp = bs->bvec_pools[i];
1316 if (bvp)
1317 mempool_destroy(bvp);
1322 void bioset_free(struct bio_set *bs)
1324 if (bs->bio_pool)
1325 mempool_destroy(bs->bio_pool);
1327 bioset_integrity_free(bs);
1328 biovec_free_pools(bs);
1330 kfree(bs);
1333 struct bio_set *bioset_create(int bio_pool_size, int bvec_pool_size)
1335 struct bio_set *bs = kzalloc(sizeof(*bs), GFP_KERNEL);
1337 if (!bs)
1338 return NULL;
1340 bs->bio_pool = mempool_create_slab_pool(bio_pool_size, bio_slab);
1341 if (!bs->bio_pool)
1342 goto bad;
1344 if (bioset_integrity_create(bs, bio_pool_size))
1345 goto bad;
1347 if (!biovec_create_pools(bs, bvec_pool_size))
1348 return bs;
1350 bad:
1351 bioset_free(bs);
1352 return NULL;
1355 static void __init biovec_init_slabs(void)
1357 int i;
1359 for (i = 0; i < BIOVEC_NR_POOLS; i++) {
1360 int size;
1361 struct biovec_slab *bvs = bvec_slabs + i;
1363 size = bvs->nr_vecs * sizeof(struct bio_vec);
1364 bvs->slab = kmem_cache_create(bvs->name, size, 0,
1365 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
1369 static int __init init_bio(void)
1371 bio_slab = KMEM_CACHE(bio, SLAB_HWCACHE_ALIGN|SLAB_PANIC);
1373 bio_integrity_init_slab();
1374 biovec_init_slabs();
1376 fs_bio_set = bioset_create(BIO_POOL_SIZE, 2);
1377 if (!fs_bio_set)
1378 panic("bio: can't allocate bios\n");
1380 bio_split_pool = mempool_create_kmalloc_pool(BIO_SPLIT_ENTRIES,
1381 sizeof(struct bio_pair));
1382 if (!bio_split_pool)
1383 panic("bio: can't create split pool\n");
1385 return 0;
1388 subsys_initcall(init_bio);
1390 EXPORT_SYMBOL(bio_alloc);
1391 EXPORT_SYMBOL(bio_put);
1392 EXPORT_SYMBOL(bio_free);
1393 EXPORT_SYMBOL(bio_endio);
1394 EXPORT_SYMBOL(bio_init);
1395 EXPORT_SYMBOL(__bio_clone);
1396 EXPORT_SYMBOL(bio_clone);
1397 EXPORT_SYMBOL(bio_phys_segments);
1398 EXPORT_SYMBOL(bio_hw_segments);
1399 EXPORT_SYMBOL(bio_add_page);
1400 EXPORT_SYMBOL(bio_add_pc_page);
1401 EXPORT_SYMBOL(bio_get_nr_vecs);
1402 EXPORT_SYMBOL(bio_map_user);
1403 EXPORT_SYMBOL(bio_unmap_user);
1404 EXPORT_SYMBOL(bio_map_kern);
1405 EXPORT_SYMBOL(bio_copy_kern);
1406 EXPORT_SYMBOL(bio_pair_release);
1407 EXPORT_SYMBOL(bio_split);
1408 EXPORT_SYMBOL(bio_split_pool);
1409 EXPORT_SYMBOL(bio_copy_user);
1410 EXPORT_SYMBOL(bio_uncopy_user);
1411 EXPORT_SYMBOL(bioset_create);
1412 EXPORT_SYMBOL(bioset_free);
1413 EXPORT_SYMBOL(bio_alloc_bioset);