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-
19 #include <linux/swap.h>
20 #include <linux/bio.h>
21 #include <linux/blkdev.h>
22 #include <linux/uio.h>
23 #include <linux/iocontext.h>
24 #include <linux/slab.h>
25 #include <linux/init.h>
26 #include <linux/kernel.h>
27 #include <linux/export.h>
28 #include <linux/mempool.h>
29 #include <linux/workqueue.h>
30 #include <linux/cgroup.h>
31 #include <linux/blk-cgroup.h>
33 #include <trace/events/block.h>
35 #include "blk-rq-qos.h"
38 * Test patch to inline a certain number of bi_io_vec's inside the bio
39 * itself, to shrink a bio data allocation from two mempool calls to one
41 #define BIO_INLINE_VECS 4
44 * if you change this list, also change bvec_alloc or things will
45 * break badly! cannot be bigger than what you can fit into an
48 #define BV(x, n) { .nr_vecs = x, .name = "biovec-"#n }
49 static struct biovec_slab bvec_slabs[BVEC_POOL_NR] __read_mostly = {
50 BV(1, 1), BV(4, 4), BV(16, 16), BV(64, 64), BV(128, 128), BV(BIO_MAX_PAGES, max),
55 * fs_bio_set is the bio_set containing bio and iovec memory pools used by
56 * IO code that does not need private memory pools.
58 struct bio_set fs_bio_set;
59 EXPORT_SYMBOL(fs_bio_set);
62 * Our slab pool management
65 struct kmem_cache *slab;
66 unsigned int slab_ref;
67 unsigned int slab_size;
70 static DEFINE_MUTEX(bio_slab_lock);
71 static struct bio_slab *bio_slabs;
72 static unsigned int bio_slab_nr, bio_slab_max;
74 static struct kmem_cache *bio_find_or_create_slab(unsigned int extra_size)
76 unsigned int sz = sizeof(struct bio) + extra_size;
77 struct kmem_cache *slab = NULL;
78 struct bio_slab *bslab, *new_bio_slabs;
79 unsigned int new_bio_slab_max;
80 unsigned int i, entry = -1;
82 mutex_lock(&bio_slab_lock);
85 while (i < bio_slab_nr) {
86 bslab = &bio_slabs[i];
88 if (!bslab->slab && entry == -1)
90 else if (bslab->slab_size == sz) {
101 if (bio_slab_nr == bio_slab_max && entry == -1) {
102 new_bio_slab_max = bio_slab_max << 1;
103 new_bio_slabs = krealloc(bio_slabs,
104 new_bio_slab_max * sizeof(struct bio_slab),
108 bio_slab_max = new_bio_slab_max;
109 bio_slabs = new_bio_slabs;
112 entry = bio_slab_nr++;
114 bslab = &bio_slabs[entry];
116 snprintf(bslab->name, sizeof(bslab->name), "bio-%d", entry);
117 slab = kmem_cache_create(bslab->name, sz, ARCH_KMALLOC_MINALIGN,
118 SLAB_HWCACHE_ALIGN, NULL);
124 bslab->slab_size = sz;
126 mutex_unlock(&bio_slab_lock);
130 static void bio_put_slab(struct bio_set *bs)
132 struct bio_slab *bslab = NULL;
135 mutex_lock(&bio_slab_lock);
137 for (i = 0; i < bio_slab_nr; i++) {
138 if (bs->bio_slab == bio_slabs[i].slab) {
139 bslab = &bio_slabs[i];
144 if (WARN(!bslab, KERN_ERR "bio: unable to find slab!\n"))
147 WARN_ON(!bslab->slab_ref);
149 if (--bslab->slab_ref)
152 kmem_cache_destroy(bslab->slab);
156 mutex_unlock(&bio_slab_lock);
159 unsigned int bvec_nr_vecs(unsigned short idx)
161 return bvec_slabs[--idx].nr_vecs;
164 void bvec_free(mempool_t *pool, struct bio_vec *bv, unsigned int idx)
170 BIO_BUG_ON(idx >= BVEC_POOL_NR);
172 if (idx == BVEC_POOL_MAX) {
173 mempool_free(bv, pool);
175 struct biovec_slab *bvs = bvec_slabs + idx;
177 kmem_cache_free(bvs->slab, bv);
181 struct bio_vec *bvec_alloc(gfp_t gfp_mask, int nr, unsigned long *idx,
187 * see comment near bvec_array define!
205 case 129 ... BIO_MAX_PAGES:
213 * idx now points to the pool we want to allocate from. only the
214 * 1-vec entry pool is mempool backed.
216 if (*idx == BVEC_POOL_MAX) {
218 bvl = mempool_alloc(pool, gfp_mask);
220 struct biovec_slab *bvs = bvec_slabs + *idx;
221 gfp_t __gfp_mask = gfp_mask & ~(__GFP_DIRECT_RECLAIM | __GFP_IO);
224 * Make this allocation restricted and don't dump info on
225 * allocation failures, since we'll fallback to the mempool
226 * in case of failure.
228 __gfp_mask |= __GFP_NOMEMALLOC | __GFP_NORETRY | __GFP_NOWARN;
231 * Try a slab allocation. If this fails and __GFP_DIRECT_RECLAIM
232 * is set, retry with the 1-entry mempool
234 bvl = kmem_cache_alloc(bvs->slab, __gfp_mask);
235 if (unlikely(!bvl && (gfp_mask & __GFP_DIRECT_RECLAIM))) {
236 *idx = BVEC_POOL_MAX;
245 void bio_uninit(struct bio *bio)
247 bio_disassociate_blkg(bio);
249 EXPORT_SYMBOL(bio_uninit);
251 static void bio_free(struct bio *bio)
253 struct bio_set *bs = bio->bi_pool;
259 bvec_free(&bs->bvec_pool, bio->bi_io_vec, BVEC_POOL_IDX(bio));
262 * If we have front padding, adjust the bio pointer before freeing
267 mempool_free(p, &bs->bio_pool);
269 /* Bio was allocated by bio_kmalloc() */
275 * Users of this function have their own bio allocation. Subsequently,
276 * they must remember to pair any call to bio_init() with bio_uninit()
277 * when IO has completed, or when the bio is released.
279 void bio_init(struct bio *bio, struct bio_vec *table,
280 unsigned short max_vecs)
282 memset(bio, 0, sizeof(*bio));
283 atomic_set(&bio->__bi_remaining, 1);
284 atomic_set(&bio->__bi_cnt, 1);
286 bio->bi_io_vec = table;
287 bio->bi_max_vecs = max_vecs;
289 EXPORT_SYMBOL(bio_init);
292 * bio_reset - reinitialize a bio
296 * After calling bio_reset(), @bio will be in the same state as a freshly
297 * allocated bio returned bio bio_alloc_bioset() - the only fields that are
298 * preserved are the ones that are initialized by bio_alloc_bioset(). See
299 * comment in struct bio.
301 void bio_reset(struct bio *bio)
303 unsigned long flags = bio->bi_flags & (~0UL << BIO_RESET_BITS);
307 memset(bio, 0, BIO_RESET_BYTES);
308 bio->bi_flags = flags;
309 atomic_set(&bio->__bi_remaining, 1);
311 EXPORT_SYMBOL(bio_reset);
313 static struct bio *__bio_chain_endio(struct bio *bio)
315 struct bio *parent = bio->bi_private;
317 if (!parent->bi_status)
318 parent->bi_status = bio->bi_status;
323 static void bio_chain_endio(struct bio *bio)
325 bio_endio(__bio_chain_endio(bio));
329 * bio_chain - chain bio completions
330 * @bio: the target bio
331 * @parent: the @bio's parent bio
333 * The caller won't have a bi_end_io called when @bio completes - instead,
334 * @parent's bi_end_io won't be called until both @parent and @bio have
335 * completed; the chained bio will also be freed when it completes.
337 * The caller must not set bi_private or bi_end_io in @bio.
339 void bio_chain(struct bio *bio, struct bio *parent)
341 BUG_ON(bio->bi_private || bio->bi_end_io);
343 bio->bi_private = parent;
344 bio->bi_end_io = bio_chain_endio;
345 bio_inc_remaining(parent);
347 EXPORT_SYMBOL(bio_chain);
349 static void bio_alloc_rescue(struct work_struct *work)
351 struct bio_set *bs = container_of(work, struct bio_set, rescue_work);
355 spin_lock(&bs->rescue_lock);
356 bio = bio_list_pop(&bs->rescue_list);
357 spin_unlock(&bs->rescue_lock);
362 generic_make_request(bio);
366 static void punt_bios_to_rescuer(struct bio_set *bs)
368 struct bio_list punt, nopunt;
371 if (WARN_ON_ONCE(!bs->rescue_workqueue))
374 * In order to guarantee forward progress we must punt only bios that
375 * were allocated from this bio_set; otherwise, if there was a bio on
376 * there for a stacking driver higher up in the stack, processing it
377 * could require allocating bios from this bio_set, and doing that from
378 * our own rescuer would be bad.
380 * Since bio lists are singly linked, pop them all instead of trying to
381 * remove from the middle of the list:
384 bio_list_init(&punt);
385 bio_list_init(&nopunt);
387 while ((bio = bio_list_pop(¤t->bio_list[0])))
388 bio_list_add(bio->bi_pool == bs ? &punt : &nopunt, bio);
389 current->bio_list[0] = nopunt;
391 bio_list_init(&nopunt);
392 while ((bio = bio_list_pop(¤t->bio_list[1])))
393 bio_list_add(bio->bi_pool == bs ? &punt : &nopunt, bio);
394 current->bio_list[1] = nopunt;
396 spin_lock(&bs->rescue_lock);
397 bio_list_merge(&bs->rescue_list, &punt);
398 spin_unlock(&bs->rescue_lock);
400 queue_work(bs->rescue_workqueue, &bs->rescue_work);
404 * bio_alloc_bioset - allocate a bio for I/O
405 * @gfp_mask: the GFP_* mask given to the slab allocator
406 * @nr_iovecs: number of iovecs to pre-allocate
407 * @bs: the bio_set to allocate from.
410 * If @bs is NULL, uses kmalloc() to allocate the bio; else the allocation is
411 * backed by the @bs's mempool.
413 * When @bs is not NULL, if %__GFP_DIRECT_RECLAIM is set then bio_alloc will
414 * always be able to allocate a bio. This is due to the mempool guarantees.
415 * To make this work, callers must never allocate more than 1 bio at a time
416 * from this pool. Callers that need to allocate more than 1 bio must always
417 * submit the previously allocated bio for IO before attempting to allocate
418 * a new one. Failure to do so can cause deadlocks under memory pressure.
420 * Note that when running under generic_make_request() (i.e. any block
421 * driver), bios are not submitted until after you return - see the code in
422 * generic_make_request() that converts recursion into iteration, to prevent
425 * This would normally mean allocating multiple bios under
426 * generic_make_request() would be susceptible to deadlocks, but we have
427 * deadlock avoidance code that resubmits any blocked bios from a rescuer
430 * However, we do not guarantee forward progress for allocations from other
431 * mempools. Doing multiple allocations from the same mempool under
432 * generic_make_request() should be avoided - instead, use bio_set's front_pad
433 * for per bio allocations.
436 * Pointer to new bio on success, NULL on failure.
438 struct bio *bio_alloc_bioset(gfp_t gfp_mask, unsigned int nr_iovecs,
441 gfp_t saved_gfp = gfp_mask;
443 unsigned inline_vecs;
444 struct bio_vec *bvl = NULL;
449 if (nr_iovecs > UIO_MAXIOV)
452 p = kmalloc(sizeof(struct bio) +
453 nr_iovecs * sizeof(struct bio_vec),
456 inline_vecs = nr_iovecs;
458 /* should not use nobvec bioset for nr_iovecs > 0 */
459 if (WARN_ON_ONCE(!mempool_initialized(&bs->bvec_pool) &&
463 * generic_make_request() converts recursion to iteration; this
464 * means if we're running beneath it, any bios we allocate and
465 * submit will not be submitted (and thus freed) until after we
468 * This exposes us to a potential deadlock if we allocate
469 * multiple bios from the same bio_set() while running
470 * underneath generic_make_request(). If we were to allocate
471 * multiple bios (say a stacking block driver that was splitting
472 * bios), we would deadlock if we exhausted the mempool's
475 * We solve this, and guarantee forward progress, with a rescuer
476 * workqueue per bio_set. If we go to allocate and there are
477 * bios on current->bio_list, we first try the allocation
478 * without __GFP_DIRECT_RECLAIM; if that fails, we punt those
479 * bios we would be blocking to the rescuer workqueue before
480 * we retry with the original gfp_flags.
483 if (current->bio_list &&
484 (!bio_list_empty(¤t->bio_list[0]) ||
485 !bio_list_empty(¤t->bio_list[1])) &&
486 bs->rescue_workqueue)
487 gfp_mask &= ~__GFP_DIRECT_RECLAIM;
489 p = mempool_alloc(&bs->bio_pool, gfp_mask);
490 if (!p && gfp_mask != saved_gfp) {
491 punt_bios_to_rescuer(bs);
492 gfp_mask = saved_gfp;
493 p = mempool_alloc(&bs->bio_pool, gfp_mask);
496 front_pad = bs->front_pad;
497 inline_vecs = BIO_INLINE_VECS;
504 bio_init(bio, NULL, 0);
506 if (nr_iovecs > inline_vecs) {
507 unsigned long idx = 0;
509 bvl = bvec_alloc(gfp_mask, nr_iovecs, &idx, &bs->bvec_pool);
510 if (!bvl && gfp_mask != saved_gfp) {
511 punt_bios_to_rescuer(bs);
512 gfp_mask = saved_gfp;
513 bvl = bvec_alloc(gfp_mask, nr_iovecs, &idx, &bs->bvec_pool);
519 bio->bi_flags |= idx << BVEC_POOL_OFFSET;
520 } else if (nr_iovecs) {
521 bvl = bio->bi_inline_vecs;
525 bio->bi_max_vecs = nr_iovecs;
526 bio->bi_io_vec = bvl;
530 mempool_free(p, &bs->bio_pool);
533 EXPORT_SYMBOL(bio_alloc_bioset);
535 void zero_fill_bio_iter(struct bio *bio, struct bvec_iter start)
539 struct bvec_iter iter;
541 __bio_for_each_segment(bv, bio, iter, start) {
542 char *data = bvec_kmap_irq(&bv, &flags);
543 memset(data, 0, bv.bv_len);
544 flush_dcache_page(bv.bv_page);
545 bvec_kunmap_irq(data, &flags);
548 EXPORT_SYMBOL(zero_fill_bio_iter);
551 * bio_put - release a reference to a bio
552 * @bio: bio to release reference to
555 * Put a reference to a &struct bio, either one you have gotten with
556 * bio_alloc, bio_get or bio_clone_*. The last put of a bio will free it.
558 void bio_put(struct bio *bio)
560 if (!bio_flagged(bio, BIO_REFFED))
563 BIO_BUG_ON(!atomic_read(&bio->__bi_cnt));
568 if (atomic_dec_and_test(&bio->__bi_cnt))
572 EXPORT_SYMBOL(bio_put);
574 int bio_phys_segments(struct request_queue *q, struct bio *bio)
576 if (unlikely(!bio_flagged(bio, BIO_SEG_VALID)))
577 blk_recount_segments(q, bio);
579 return bio->bi_phys_segments;
583 * __bio_clone_fast - clone a bio that shares the original bio's biovec
584 * @bio: destination bio
585 * @bio_src: bio to clone
587 * Clone a &bio. Caller will own the returned bio, but not
588 * the actual data it points to. Reference count of returned
591 * Caller must ensure that @bio_src is not freed before @bio.
593 void __bio_clone_fast(struct bio *bio, struct bio *bio_src)
595 BUG_ON(bio->bi_pool && BVEC_POOL_IDX(bio));
598 * most users will be overriding ->bi_disk with a new target,
599 * so we don't set nor calculate new physical/hw segment counts here
601 bio->bi_disk = bio_src->bi_disk;
602 bio->bi_partno = bio_src->bi_partno;
603 bio_set_flag(bio, BIO_CLONED);
604 if (bio_flagged(bio_src, BIO_THROTTLED))
605 bio_set_flag(bio, BIO_THROTTLED);
606 bio->bi_opf = bio_src->bi_opf;
607 bio->bi_ioprio = bio_src->bi_ioprio;
608 bio->bi_write_hint = bio_src->bi_write_hint;
609 bio->bi_iter = bio_src->bi_iter;
610 bio->bi_io_vec = bio_src->bi_io_vec;
612 bio_clone_blkg_association(bio, bio_src);
613 blkcg_bio_issue_init(bio);
615 EXPORT_SYMBOL(__bio_clone_fast);
618 * bio_clone_fast - clone a bio that shares the original bio's biovec
620 * @gfp_mask: allocation priority
621 * @bs: bio_set to allocate from
623 * Like __bio_clone_fast, only also allocates the returned bio
625 struct bio *bio_clone_fast(struct bio *bio, gfp_t gfp_mask, struct bio_set *bs)
629 b = bio_alloc_bioset(gfp_mask, 0, bs);
633 __bio_clone_fast(b, bio);
635 if (bio_integrity(bio)) {
638 ret = bio_integrity_clone(b, bio, gfp_mask);
648 EXPORT_SYMBOL(bio_clone_fast);
650 static inline bool page_is_mergeable(const struct bio_vec *bv,
651 struct page *page, unsigned int len, unsigned int off,
654 phys_addr_t vec_end_addr = page_to_phys(bv->bv_page) +
655 bv->bv_offset + bv->bv_len - 1;
656 phys_addr_t page_addr = page_to_phys(page);
658 if (vec_end_addr + 1 != page_addr + off)
660 if (xen_domain() && !xen_biovec_phys_mergeable(bv, page))
662 if (same_page && (vec_end_addr & PAGE_MASK) != page_addr)
669 * __bio_add_pc_page - attempt to add page to passthrough bio
670 * @q: the target queue
671 * @bio: destination bio
673 * @len: vec entry length
674 * @offset: vec entry offset
675 * @put_same_page: put the page if it is same with last added page
677 * Attempt to add a page to the bio_vec maplist. This can fail for a
678 * number of reasons, such as the bio being full or target block device
679 * limitations. The target block device must allow bio's up to PAGE_SIZE,
680 * so it is always possible to add a single page to an empty bio.
682 * This should only be used by passthrough bios.
684 int __bio_add_pc_page(struct request_queue *q, struct bio *bio,
685 struct page *page, unsigned int len, unsigned int offset,
688 int retried_segments = 0;
689 struct bio_vec *bvec;
692 * cloned bio must not modify vec list
694 if (unlikely(bio_flagged(bio, BIO_CLONED)))
697 if (((bio->bi_iter.bi_size + len) >> 9) > queue_max_hw_sectors(q))
701 * For filesystems with a blocksize smaller than the pagesize
702 * we will often be called with the same page as last time and
703 * a consecutive offset. Optimize this special case.
705 if (bio->bi_vcnt > 0) {
706 bvec = &bio->bi_io_vec[bio->bi_vcnt - 1];
708 if (page == bvec->bv_page &&
709 offset == bvec->bv_offset + bvec->bv_len) {
713 bio->bi_iter.bi_size += len;
718 * If the queue doesn't support SG gaps and adding this
719 * offset would create a gap, disallow it.
721 if (bvec_gap_to_prev(q, bvec, offset))
729 * setup the new entry, we might clear it again later if we
730 * cannot add the page
732 bvec = &bio->bi_io_vec[bio->bi_vcnt];
733 bvec->bv_page = page;
735 bvec->bv_offset = offset;
737 bio->bi_phys_segments++;
738 bio->bi_iter.bi_size += len;
741 * Perform a recount if the number of segments is greater
742 * than queue_max_segments(q).
745 while (bio->bi_phys_segments > queue_max_segments(q)) {
747 if (retried_segments)
750 retried_segments = 1;
751 blk_recount_segments(q, bio);
754 /* If we may be able to merge these biovecs, force a recount */
755 if (bio->bi_vcnt > 1 && biovec_phys_mergeable(q, bvec - 1, bvec))
756 bio_clear_flag(bio, BIO_SEG_VALID);
762 bvec->bv_page = NULL;
766 bio->bi_iter.bi_size -= len;
767 blk_recount_segments(q, bio);
770 EXPORT_SYMBOL(__bio_add_pc_page);
772 int bio_add_pc_page(struct request_queue *q, struct bio *bio,
773 struct page *page, unsigned int len, unsigned int offset)
775 return __bio_add_pc_page(q, bio, page, len, offset, false);
777 EXPORT_SYMBOL(bio_add_pc_page);
780 * __bio_try_merge_page - try appending data to an existing bvec.
781 * @bio: destination bio
783 * @len: length of the data to add
784 * @off: offset of the data in @page
785 * @same_page: if %true only merge if the new data is in the same physical
786 * page as the last segment of the bio.
788 * Try to add the data at @page + @off to the last bvec of @bio. This is a
789 * a useful optimisation for file systems with a block size smaller than the
792 * Return %true on success or %false on failure.
794 bool __bio_try_merge_page(struct bio *bio, struct page *page,
795 unsigned int len, unsigned int off, bool same_page)
797 if (WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED)))
800 if (bio->bi_vcnt > 0) {
801 struct bio_vec *bv = &bio->bi_io_vec[bio->bi_vcnt - 1];
803 if (page_is_mergeable(bv, page, len, off, same_page)) {
805 bio->bi_iter.bi_size += len;
811 EXPORT_SYMBOL_GPL(__bio_try_merge_page);
814 * __bio_add_page - add page to a bio in a new segment
815 * @bio: destination bio
817 * @len: length of the data to add
818 * @off: offset of the data in @page
820 * Add the data at @page + @off to @bio as a new bvec. The caller must ensure
821 * that @bio has space for another bvec.
823 void __bio_add_page(struct bio *bio, struct page *page,
824 unsigned int len, unsigned int off)
826 struct bio_vec *bv = &bio->bi_io_vec[bio->bi_vcnt];
828 WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED));
829 WARN_ON_ONCE(bio_full(bio));
835 bio->bi_iter.bi_size += len;
838 EXPORT_SYMBOL_GPL(__bio_add_page);
841 * bio_add_page - attempt to add page to bio
842 * @bio: destination bio
844 * @len: vec entry length
845 * @offset: vec entry offset
847 * Attempt to add a page to the bio_vec maplist. This will only fail
848 * if either bio->bi_vcnt == bio->bi_max_vecs or it's a cloned bio.
850 int bio_add_page(struct bio *bio, struct page *page,
851 unsigned int len, unsigned int offset)
853 if (!__bio_try_merge_page(bio, page, len, offset, false)) {
856 __bio_add_page(bio, page, len, offset);
860 EXPORT_SYMBOL(bio_add_page);
862 static int __bio_iov_bvec_add_pages(struct bio *bio, struct iov_iter *iter)
864 const struct bio_vec *bv = iter->bvec;
868 if (WARN_ON_ONCE(iter->iov_offset > bv->bv_len))
871 len = min_t(size_t, bv->bv_len - iter->iov_offset, iter->count);
872 size = bio_add_page(bio, bv->bv_page, len,
873 bv->bv_offset + iter->iov_offset);
875 if (!bio_flagged(bio, BIO_NO_PAGE_REF)) {
879 mp_bvec_for_each_page(page, bv, i)
883 iov_iter_advance(iter, size);
890 #define PAGE_PTRS_PER_BVEC (sizeof(struct bio_vec) / sizeof(struct page *))
893 * __bio_iov_iter_get_pages - pin user or kernel pages and add them to a bio
894 * @bio: bio to add pages to
895 * @iter: iov iterator describing the region to be mapped
897 * Pins pages from *iter and appends them to @bio's bvec array. The
898 * pages will have to be released using put_page() when done.
899 * For multi-segment *iter, this function only adds pages from the
900 * the next non-empty segment of the iov iterator.
902 static int __bio_iov_iter_get_pages(struct bio *bio, struct iov_iter *iter)
904 unsigned short nr_pages = bio->bi_max_vecs - bio->bi_vcnt;
905 unsigned short entries_left = bio->bi_max_vecs - bio->bi_vcnt;
906 struct bio_vec *bv = bio->bi_io_vec + bio->bi_vcnt;
907 struct page **pages = (struct page **)bv;
913 * Move page array up in the allocated memory for the bio vecs as far as
914 * possible so that we can start filling biovecs from the beginning
915 * without overwriting the temporary page array.
917 BUILD_BUG_ON(PAGE_PTRS_PER_BVEC < 2);
918 pages += entries_left * (PAGE_PTRS_PER_BVEC - 1);
920 size = iov_iter_get_pages(iter, pages, LONG_MAX, nr_pages, &offset);
921 if (unlikely(size <= 0))
922 return size ? size : -EFAULT;
924 for (left = size, i = 0; left > 0; left -= len, i++) {
925 struct page *page = pages[i];
927 len = min_t(size_t, PAGE_SIZE - offset, left);
928 if (WARN_ON_ONCE(bio_add_page(bio, page, len, offset) != len))
933 iov_iter_advance(iter, size);
938 * bio_iov_iter_get_pages - add user or kernel pages to a bio
939 * @bio: bio to add pages to
940 * @iter: iov iterator describing the region to be added
942 * This takes either an iterator pointing to user memory, or one pointing to
943 * kernel pages (BVEC iterator). If we're adding user pages, we pin them and
944 * map them into the kernel. On IO completion, the caller should put those
945 * pages. If we're adding kernel pages, and the caller told us it's safe to
946 * do so, we just have to add the pages to the bio directly. We don't grab an
947 * extra reference to those pages (the user should already have that), and we
948 * don't put the page on IO completion. The caller needs to check if the bio is
949 * flagged BIO_NO_PAGE_REF on IO completion. If it isn't, then pages should be
952 * The function tries, but does not guarantee, to pin as many pages as
953 * fit into the bio, or are requested in *iter, whatever is smaller. If
954 * MM encounters an error pinning the requested pages, it stops. Error
955 * is returned only if 0 pages could be pinned.
957 int bio_iov_iter_get_pages(struct bio *bio, struct iov_iter *iter)
959 const bool is_bvec = iov_iter_is_bvec(iter);
960 unsigned short orig_vcnt = bio->bi_vcnt;
963 * If this is a BVEC iter, then the pages are kernel pages. Don't
964 * release them on IO completion, if the caller asked us to.
966 if (is_bvec && iov_iter_bvec_no_ref(iter))
967 bio_set_flag(bio, BIO_NO_PAGE_REF);
973 ret = __bio_iov_bvec_add_pages(bio, iter);
975 ret = __bio_iov_iter_get_pages(bio, iter);
978 return bio->bi_vcnt > orig_vcnt ? 0 : ret;
980 } while (iov_iter_count(iter) && !bio_full(bio));
985 static void submit_bio_wait_endio(struct bio *bio)
987 complete(bio->bi_private);
991 * submit_bio_wait - submit a bio, and wait until it completes
992 * @bio: The &struct bio which describes the I/O
994 * Simple wrapper around submit_bio(). Returns 0 on success, or the error from
995 * bio_endio() on failure.
997 * WARNING: Unlike to how submit_bio() is usually used, this function does not
998 * result in bio reference to be consumed. The caller must drop the reference
1001 int submit_bio_wait(struct bio *bio)
1003 DECLARE_COMPLETION_ONSTACK_MAP(done, bio->bi_disk->lockdep_map);
1005 bio->bi_private = &done;
1006 bio->bi_end_io = submit_bio_wait_endio;
1007 bio->bi_opf |= REQ_SYNC;
1009 wait_for_completion_io(&done);
1011 return blk_status_to_errno(bio->bi_status);
1013 EXPORT_SYMBOL(submit_bio_wait);
1016 * bio_advance - increment/complete a bio by some number of bytes
1017 * @bio: bio to advance
1018 * @bytes: number of bytes to complete
1020 * This updates bi_sector, bi_size and bi_idx; if the number of bytes to
1021 * complete doesn't align with a bvec boundary, then bv_len and bv_offset will
1022 * be updated on the last bvec as well.
1024 * @bio will then represent the remaining, uncompleted portion of the io.
1026 void bio_advance(struct bio *bio, unsigned bytes)
1028 if (bio_integrity(bio))
1029 bio_integrity_advance(bio, bytes);
1031 bio_advance_iter(bio, &bio->bi_iter, bytes);
1033 EXPORT_SYMBOL(bio_advance);
1035 void bio_copy_data_iter(struct bio *dst, struct bvec_iter *dst_iter,
1036 struct bio *src, struct bvec_iter *src_iter)
1038 struct bio_vec src_bv, dst_bv;
1039 void *src_p, *dst_p;
1042 while (src_iter->bi_size && dst_iter->bi_size) {
1043 src_bv = bio_iter_iovec(src, *src_iter);
1044 dst_bv = bio_iter_iovec(dst, *dst_iter);
1046 bytes = min(src_bv.bv_len, dst_bv.bv_len);
1048 src_p = kmap_atomic(src_bv.bv_page);
1049 dst_p = kmap_atomic(dst_bv.bv_page);
1051 memcpy(dst_p + dst_bv.bv_offset,
1052 src_p + src_bv.bv_offset,
1055 kunmap_atomic(dst_p);
1056 kunmap_atomic(src_p);
1058 flush_dcache_page(dst_bv.bv_page);
1060 bio_advance_iter(src, src_iter, bytes);
1061 bio_advance_iter(dst, dst_iter, bytes);
1064 EXPORT_SYMBOL(bio_copy_data_iter);
1067 * bio_copy_data - copy contents of data buffers from one bio to another
1069 * @dst: destination bio
1071 * Stops when it reaches the end of either @src or @dst - that is, copies
1072 * min(src->bi_size, dst->bi_size) bytes (or the equivalent for lists of bios).
1074 void bio_copy_data(struct bio *dst, struct bio *src)
1076 struct bvec_iter src_iter = src->bi_iter;
1077 struct bvec_iter dst_iter = dst->bi_iter;
1079 bio_copy_data_iter(dst, &dst_iter, src, &src_iter);
1081 EXPORT_SYMBOL(bio_copy_data);
1084 * bio_list_copy_data - copy contents of data buffers from one chain of bios to
1086 * @src: source bio list
1087 * @dst: destination bio list
1089 * Stops when it reaches the end of either the @src list or @dst list - that is,
1090 * copies min(src->bi_size, dst->bi_size) bytes (or the equivalent for lists of
1093 void bio_list_copy_data(struct bio *dst, struct bio *src)
1095 struct bvec_iter src_iter = src->bi_iter;
1096 struct bvec_iter dst_iter = dst->bi_iter;
1099 if (!src_iter.bi_size) {
1104 src_iter = src->bi_iter;
1107 if (!dst_iter.bi_size) {
1112 dst_iter = dst->bi_iter;
1115 bio_copy_data_iter(dst, &dst_iter, src, &src_iter);
1118 EXPORT_SYMBOL(bio_list_copy_data);
1120 struct bio_map_data {
1122 struct iov_iter iter;
1126 static struct bio_map_data *bio_alloc_map_data(struct iov_iter *data,
1129 struct bio_map_data *bmd;
1130 if (data->nr_segs > UIO_MAXIOV)
1133 bmd = kmalloc(sizeof(struct bio_map_data) +
1134 sizeof(struct iovec) * data->nr_segs, gfp_mask);
1137 memcpy(bmd->iov, data->iov, sizeof(struct iovec) * data->nr_segs);
1139 bmd->iter.iov = bmd->iov;
1144 * bio_copy_from_iter - copy all pages from iov_iter to bio
1145 * @bio: The &struct bio which describes the I/O as destination
1146 * @iter: iov_iter as source
1148 * Copy all pages from iov_iter to bio.
1149 * Returns 0 on success, or error on failure.
1151 static int bio_copy_from_iter(struct bio *bio, struct iov_iter *iter)
1154 struct bio_vec *bvec;
1155 struct bvec_iter_all iter_all;
1157 bio_for_each_segment_all(bvec, bio, i, iter_all) {
1160 ret = copy_page_from_iter(bvec->bv_page,
1165 if (!iov_iter_count(iter))
1168 if (ret < bvec->bv_len)
1176 * bio_copy_to_iter - copy all pages from bio to iov_iter
1177 * @bio: The &struct bio which describes the I/O as source
1178 * @iter: iov_iter as destination
1180 * Copy all pages from bio to iov_iter.
1181 * Returns 0 on success, or error on failure.
1183 static int bio_copy_to_iter(struct bio *bio, struct iov_iter iter)
1186 struct bio_vec *bvec;
1187 struct bvec_iter_all iter_all;
1189 bio_for_each_segment_all(bvec, bio, i, iter_all) {
1192 ret = copy_page_to_iter(bvec->bv_page,
1197 if (!iov_iter_count(&iter))
1200 if (ret < bvec->bv_len)
1207 void bio_free_pages(struct bio *bio)
1209 struct bio_vec *bvec;
1211 struct bvec_iter_all iter_all;
1213 bio_for_each_segment_all(bvec, bio, i, iter_all)
1214 __free_page(bvec->bv_page);
1216 EXPORT_SYMBOL(bio_free_pages);
1219 * bio_uncopy_user - finish previously mapped bio
1220 * @bio: bio being terminated
1222 * Free pages allocated from bio_copy_user_iov() and write back data
1223 * to user space in case of a read.
1225 int bio_uncopy_user(struct bio *bio)
1227 struct bio_map_data *bmd = bio->bi_private;
1230 if (!bio_flagged(bio, BIO_NULL_MAPPED)) {
1232 * if we're in a workqueue, the request is orphaned, so
1233 * don't copy into a random user address space, just free
1234 * and return -EINTR so user space doesn't expect any data.
1238 else if (bio_data_dir(bio) == READ)
1239 ret = bio_copy_to_iter(bio, bmd->iter);
1240 if (bmd->is_our_pages)
1241 bio_free_pages(bio);
1249 * bio_copy_user_iov - copy user data to bio
1250 * @q: destination block queue
1251 * @map_data: pointer to the rq_map_data holding pages (if necessary)
1252 * @iter: iovec iterator
1253 * @gfp_mask: memory allocation flags
1255 * Prepares and returns a bio for indirect user io, bouncing data
1256 * to/from kernel pages as necessary. Must be paired with
1257 * call bio_uncopy_user() on io completion.
1259 struct bio *bio_copy_user_iov(struct request_queue *q,
1260 struct rq_map_data *map_data,
1261 struct iov_iter *iter,
1264 struct bio_map_data *bmd;
1269 unsigned int len = iter->count;
1270 unsigned int offset = map_data ? offset_in_page(map_data->offset) : 0;
1272 bmd = bio_alloc_map_data(iter, gfp_mask);
1274 return ERR_PTR(-ENOMEM);
1277 * We need to do a deep copy of the iov_iter including the iovecs.
1278 * The caller provided iov might point to an on-stack or otherwise
1281 bmd->is_our_pages = map_data ? 0 : 1;
1283 nr_pages = DIV_ROUND_UP(offset + len, PAGE_SIZE);
1284 if (nr_pages > BIO_MAX_PAGES)
1285 nr_pages = BIO_MAX_PAGES;
1288 bio = bio_kmalloc(gfp_mask, nr_pages);
1295 nr_pages = 1 << map_data->page_order;
1296 i = map_data->offset / PAGE_SIZE;
1299 unsigned int bytes = PAGE_SIZE;
1307 if (i == map_data->nr_entries * nr_pages) {
1312 page = map_data->pages[i / nr_pages];
1313 page += (i % nr_pages);
1317 page = alloc_page(q->bounce_gfp | gfp_mask);
1324 if (bio_add_pc_page(q, bio, page, bytes, offset) < bytes)
1335 map_data->offset += bio->bi_iter.bi_size;
1340 if ((iov_iter_rw(iter) == WRITE && (!map_data || !map_data->null_mapped)) ||
1341 (map_data && map_data->from_user)) {
1342 ret = bio_copy_from_iter(bio, iter);
1346 if (bmd->is_our_pages)
1348 iov_iter_advance(iter, bio->bi_iter.bi_size);
1351 bio->bi_private = bmd;
1352 if (map_data && map_data->null_mapped)
1353 bio_set_flag(bio, BIO_NULL_MAPPED);
1357 bio_free_pages(bio);
1361 return ERR_PTR(ret);
1365 * bio_map_user_iov - map user iovec into bio
1366 * @q: the struct request_queue for the bio
1367 * @iter: iovec iterator
1368 * @gfp_mask: memory allocation flags
1370 * Map the user space address into a bio suitable for io to a block
1371 * device. Returns an error pointer in case of error.
1373 struct bio *bio_map_user_iov(struct request_queue *q,
1374 struct iov_iter *iter,
1380 struct bio_vec *bvec;
1381 struct bvec_iter_all iter_all;
1383 if (!iov_iter_count(iter))
1384 return ERR_PTR(-EINVAL);
1386 bio = bio_kmalloc(gfp_mask, iov_iter_npages(iter, BIO_MAX_PAGES));
1388 return ERR_PTR(-ENOMEM);
1390 while (iov_iter_count(iter)) {
1391 struct page **pages;
1393 size_t offs, added = 0;
1396 bytes = iov_iter_get_pages_alloc(iter, &pages, LONG_MAX, &offs);
1397 if (unlikely(bytes <= 0)) {
1398 ret = bytes ? bytes : -EFAULT;
1402 npages = DIV_ROUND_UP(offs + bytes, PAGE_SIZE);
1404 if (unlikely(offs & queue_dma_alignment(q))) {
1408 for (j = 0; j < npages; j++) {
1409 struct page *page = pages[j];
1410 unsigned int n = PAGE_SIZE - offs;
1415 if (!__bio_add_pc_page(q, bio, page, n, offs,
1423 iov_iter_advance(iter, added);
1426 * release the pages we didn't map into the bio, if any
1429 put_page(pages[j++]);
1431 /* couldn't stuff something into bio? */
1436 bio_set_flag(bio, BIO_USER_MAPPED);
1439 * subtle -- if bio_map_user_iov() ended up bouncing a bio,
1440 * it would normally disappear when its bi_end_io is run.
1441 * however, we need it for the unmap, so grab an extra
1448 bio_for_each_segment_all(bvec, bio, j, iter_all) {
1449 put_page(bvec->bv_page);
1452 return ERR_PTR(ret);
1455 static void __bio_unmap_user(struct bio *bio)
1457 struct bio_vec *bvec;
1459 struct bvec_iter_all iter_all;
1462 * make sure we dirty pages we wrote to
1464 bio_for_each_segment_all(bvec, bio, i, iter_all) {
1465 if (bio_data_dir(bio) == READ)
1466 set_page_dirty_lock(bvec->bv_page);
1468 put_page(bvec->bv_page);
1475 * bio_unmap_user - unmap a bio
1476 * @bio: the bio being unmapped
1478 * Unmap a bio previously mapped by bio_map_user_iov(). Must be called from
1481 * bio_unmap_user() may sleep.
1483 void bio_unmap_user(struct bio *bio)
1485 __bio_unmap_user(bio);
1489 static void bio_map_kern_endio(struct bio *bio)
1495 * bio_map_kern - map kernel address into bio
1496 * @q: the struct request_queue for the bio
1497 * @data: pointer to buffer to map
1498 * @len: length in bytes
1499 * @gfp_mask: allocation flags for bio allocation
1501 * Map the kernel address into a bio suitable for io to a block
1502 * device. Returns an error pointer in case of error.
1504 struct bio *bio_map_kern(struct request_queue *q, void *data, unsigned int len,
1507 unsigned long kaddr = (unsigned long)data;
1508 unsigned long end = (kaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
1509 unsigned long start = kaddr >> PAGE_SHIFT;
1510 const int nr_pages = end - start;
1514 bio = bio_kmalloc(gfp_mask, nr_pages);
1516 return ERR_PTR(-ENOMEM);
1518 offset = offset_in_page(kaddr);
1519 for (i = 0; i < nr_pages; i++) {
1520 unsigned int bytes = PAGE_SIZE - offset;
1528 if (bio_add_pc_page(q, bio, virt_to_page(data), bytes,
1530 /* we don't support partial mappings */
1532 return ERR_PTR(-EINVAL);
1540 bio->bi_end_io = bio_map_kern_endio;
1543 EXPORT_SYMBOL(bio_map_kern);
1545 static void bio_copy_kern_endio(struct bio *bio)
1547 bio_free_pages(bio);
1551 static void bio_copy_kern_endio_read(struct bio *bio)
1553 char *p = bio->bi_private;
1554 struct bio_vec *bvec;
1556 struct bvec_iter_all iter_all;
1558 bio_for_each_segment_all(bvec, bio, i, iter_all) {
1559 memcpy(p, page_address(bvec->bv_page), bvec->bv_len);
1563 bio_copy_kern_endio(bio);
1567 * bio_copy_kern - copy kernel address into bio
1568 * @q: the struct request_queue for the bio
1569 * @data: pointer to buffer to copy
1570 * @len: length in bytes
1571 * @gfp_mask: allocation flags for bio and page allocation
1572 * @reading: data direction is READ
1574 * copy the kernel address into a bio suitable for io to a block
1575 * device. Returns an error pointer in case of error.
1577 struct bio *bio_copy_kern(struct request_queue *q, void *data, unsigned int len,
1578 gfp_t gfp_mask, int reading)
1580 unsigned long kaddr = (unsigned long)data;
1581 unsigned long end = (kaddr + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
1582 unsigned long start = kaddr >> PAGE_SHIFT;
1591 return ERR_PTR(-EINVAL);
1593 nr_pages = end - start;
1594 bio = bio_kmalloc(gfp_mask, nr_pages);
1596 return ERR_PTR(-ENOMEM);
1600 unsigned int bytes = PAGE_SIZE;
1605 page = alloc_page(q->bounce_gfp | gfp_mask);
1610 memcpy(page_address(page), p, bytes);
1612 if (bio_add_pc_page(q, bio, page, bytes, 0) < bytes)
1620 bio->bi_end_io = bio_copy_kern_endio_read;
1621 bio->bi_private = data;
1623 bio->bi_end_io = bio_copy_kern_endio;
1629 bio_free_pages(bio);
1631 return ERR_PTR(-ENOMEM);
1635 * bio_set_pages_dirty() and bio_check_pages_dirty() are support functions
1636 * for performing direct-IO in BIOs.
1638 * The problem is that we cannot run set_page_dirty() from interrupt context
1639 * because the required locks are not interrupt-safe. So what we can do is to
1640 * mark the pages dirty _before_ performing IO. And in interrupt context,
1641 * check that the pages are still dirty. If so, fine. If not, redirty them
1642 * in process context.
1644 * We special-case compound pages here: normally this means reads into hugetlb
1645 * pages. The logic in here doesn't really work right for compound pages
1646 * because the VM does not uniformly chase down the head page in all cases.
1647 * But dirtiness of compound pages is pretty meaningless anyway: the VM doesn't
1648 * handle them at all. So we skip compound pages here at an early stage.
1650 * Note that this code is very hard to test under normal circumstances because
1651 * direct-io pins the pages with get_user_pages(). This makes
1652 * is_page_cache_freeable return false, and the VM will not clean the pages.
1653 * But other code (eg, flusher threads) could clean the pages if they are mapped
1656 * Simply disabling the call to bio_set_pages_dirty() is a good way to test the
1657 * deferred bio dirtying paths.
1661 * bio_set_pages_dirty() will mark all the bio's pages as dirty.
1663 void bio_set_pages_dirty(struct bio *bio)
1665 struct bio_vec *bvec;
1667 struct bvec_iter_all iter_all;
1669 bio_for_each_segment_all(bvec, bio, i, iter_all) {
1670 if (!PageCompound(bvec->bv_page))
1671 set_page_dirty_lock(bvec->bv_page);
1675 static void bio_release_pages(struct bio *bio)
1677 struct bio_vec *bvec;
1679 struct bvec_iter_all iter_all;
1681 bio_for_each_segment_all(bvec, bio, i, iter_all)
1682 put_page(bvec->bv_page);
1686 * bio_check_pages_dirty() will check that all the BIO's pages are still dirty.
1687 * If they are, then fine. If, however, some pages are clean then they must
1688 * have been written out during the direct-IO read. So we take another ref on
1689 * the BIO and re-dirty the pages in process context.
1691 * It is expected that bio_check_pages_dirty() will wholly own the BIO from
1692 * here on. It will run one put_page() against each page and will run one
1693 * bio_put() against the BIO.
1696 static void bio_dirty_fn(struct work_struct *work);
1698 static DECLARE_WORK(bio_dirty_work, bio_dirty_fn);
1699 static DEFINE_SPINLOCK(bio_dirty_lock);
1700 static struct bio *bio_dirty_list;
1703 * This runs in process context
1705 static void bio_dirty_fn(struct work_struct *work)
1707 struct bio *bio, *next;
1709 spin_lock_irq(&bio_dirty_lock);
1710 next = bio_dirty_list;
1711 bio_dirty_list = NULL;
1712 spin_unlock_irq(&bio_dirty_lock);
1714 while ((bio = next) != NULL) {
1715 next = bio->bi_private;
1717 bio_set_pages_dirty(bio);
1718 if (!bio_flagged(bio, BIO_NO_PAGE_REF))
1719 bio_release_pages(bio);
1724 void bio_check_pages_dirty(struct bio *bio)
1726 struct bio_vec *bvec;
1727 unsigned long flags;
1729 struct bvec_iter_all iter_all;
1731 bio_for_each_segment_all(bvec, bio, i, iter_all) {
1732 if (!PageDirty(bvec->bv_page) && !PageCompound(bvec->bv_page))
1736 if (!bio_flagged(bio, BIO_NO_PAGE_REF))
1737 bio_release_pages(bio);
1741 spin_lock_irqsave(&bio_dirty_lock, flags);
1742 bio->bi_private = bio_dirty_list;
1743 bio_dirty_list = bio;
1744 spin_unlock_irqrestore(&bio_dirty_lock, flags);
1745 schedule_work(&bio_dirty_work);
1748 void update_io_ticks(struct hd_struct *part, unsigned long now)
1750 unsigned long stamp;
1752 stamp = READ_ONCE(part->stamp);
1753 if (unlikely(stamp != now)) {
1754 if (likely(cmpxchg(&part->stamp, stamp, now) == stamp)) {
1755 __part_stat_add(part, io_ticks, 1);
1759 part = &part_to_disk(part)->part0;
1764 void generic_start_io_acct(struct request_queue *q, int op,
1765 unsigned long sectors, struct hd_struct *part)
1767 const int sgrp = op_stat_group(op);
1771 update_io_ticks(part, jiffies);
1772 part_stat_inc(part, ios[sgrp]);
1773 part_stat_add(part, sectors[sgrp], sectors);
1774 part_inc_in_flight(q, part, op_is_write(op));
1778 EXPORT_SYMBOL(generic_start_io_acct);
1780 void generic_end_io_acct(struct request_queue *q, int req_op,
1781 struct hd_struct *part, unsigned long start_time)
1783 unsigned long now = jiffies;
1784 unsigned long duration = now - start_time;
1785 const int sgrp = op_stat_group(req_op);
1789 update_io_ticks(part, now);
1790 part_stat_add(part, nsecs[sgrp], jiffies_to_nsecs(duration));
1791 part_stat_add(part, time_in_queue, duration);
1792 part_dec_in_flight(q, part, op_is_write(req_op));
1796 EXPORT_SYMBOL(generic_end_io_acct);
1798 #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
1799 void bio_flush_dcache_pages(struct bio *bi)
1801 struct bio_vec bvec;
1802 struct bvec_iter iter;
1804 bio_for_each_segment(bvec, bi, iter)
1805 flush_dcache_page(bvec.bv_page);
1807 EXPORT_SYMBOL(bio_flush_dcache_pages);
1810 static inline bool bio_remaining_done(struct bio *bio)
1813 * If we're not chaining, then ->__bi_remaining is always 1 and
1814 * we always end io on the first invocation.
1816 if (!bio_flagged(bio, BIO_CHAIN))
1819 BUG_ON(atomic_read(&bio->__bi_remaining) <= 0);
1821 if (atomic_dec_and_test(&bio->__bi_remaining)) {
1822 bio_clear_flag(bio, BIO_CHAIN);
1830 * bio_endio - end I/O on a bio
1834 * bio_endio() will end I/O on the whole bio. bio_endio() is the preferred
1835 * way to end I/O on a bio. No one should call bi_end_io() directly on a
1836 * bio unless they own it and thus know that it has an end_io function.
1838 * bio_endio() can be called several times on a bio that has been chained
1839 * using bio_chain(). The ->bi_end_io() function will only be called the
1840 * last time. At this point the BLK_TA_COMPLETE tracing event will be
1841 * generated if BIO_TRACE_COMPLETION is set.
1843 void bio_endio(struct bio *bio)
1846 if (!bio_remaining_done(bio))
1848 if (!bio_integrity_endio(bio))
1852 rq_qos_done_bio(bio->bi_disk->queue, bio);
1855 * Need to have a real endio function for chained bios, otherwise
1856 * various corner cases will break (like stacking block devices that
1857 * save/restore bi_end_io) - however, we want to avoid unbounded
1858 * recursion and blowing the stack. Tail call optimization would
1859 * handle this, but compiling with frame pointers also disables
1860 * gcc's sibling call optimization.
1862 if (bio->bi_end_io == bio_chain_endio) {
1863 bio = __bio_chain_endio(bio);
1867 if (bio->bi_disk && bio_flagged(bio, BIO_TRACE_COMPLETION)) {
1868 trace_block_bio_complete(bio->bi_disk->queue, bio,
1869 blk_status_to_errno(bio->bi_status));
1870 bio_clear_flag(bio, BIO_TRACE_COMPLETION);
1873 blk_throtl_bio_endio(bio);
1874 /* release cgroup info */
1877 bio->bi_end_io(bio);
1879 EXPORT_SYMBOL(bio_endio);
1882 * bio_split - split a bio
1883 * @bio: bio to split
1884 * @sectors: number of sectors to split from the front of @bio
1886 * @bs: bio set to allocate from
1888 * Allocates and returns a new bio which represents @sectors from the start of
1889 * @bio, and updates @bio to represent the remaining sectors.
1891 * Unless this is a discard request the newly allocated bio will point
1892 * to @bio's bi_io_vec; it is the caller's responsibility to ensure that
1893 * @bio is not freed before the split.
1895 struct bio *bio_split(struct bio *bio, int sectors,
1896 gfp_t gfp, struct bio_set *bs)
1900 BUG_ON(sectors <= 0);
1901 BUG_ON(sectors >= bio_sectors(bio));
1903 split = bio_clone_fast(bio, gfp, bs);
1907 split->bi_iter.bi_size = sectors << 9;
1909 if (bio_integrity(split))
1910 bio_integrity_trim(split);
1912 bio_advance(bio, split->bi_iter.bi_size);
1914 if (bio_flagged(bio, BIO_TRACE_COMPLETION))
1915 bio_set_flag(split, BIO_TRACE_COMPLETION);
1919 EXPORT_SYMBOL(bio_split);
1922 * bio_trim - trim a bio
1924 * @offset: number of sectors to trim from the front of @bio
1925 * @size: size we want to trim @bio to, in sectors
1927 void bio_trim(struct bio *bio, int offset, int size)
1929 /* 'bio' is a cloned bio which we need to trim to match
1930 * the given offset and size.
1934 if (offset == 0 && size == bio->bi_iter.bi_size)
1937 bio_clear_flag(bio, BIO_SEG_VALID);
1939 bio_advance(bio, offset << 9);
1941 bio->bi_iter.bi_size = size;
1943 if (bio_integrity(bio))
1944 bio_integrity_trim(bio);
1947 EXPORT_SYMBOL_GPL(bio_trim);
1950 * create memory pools for biovec's in a bio_set.
1951 * use the global biovec slabs created for general use.
1953 int biovec_init_pool(mempool_t *pool, int pool_entries)
1955 struct biovec_slab *bp = bvec_slabs + BVEC_POOL_MAX;
1957 return mempool_init_slab_pool(pool, pool_entries, bp->slab);
1961 * bioset_exit - exit a bioset initialized with bioset_init()
1963 * May be called on a zeroed but uninitialized bioset (i.e. allocated with
1966 void bioset_exit(struct bio_set *bs)
1968 if (bs->rescue_workqueue)
1969 destroy_workqueue(bs->rescue_workqueue);
1970 bs->rescue_workqueue = NULL;
1972 mempool_exit(&bs->bio_pool);
1973 mempool_exit(&bs->bvec_pool);
1975 bioset_integrity_free(bs);
1978 bs->bio_slab = NULL;
1980 EXPORT_SYMBOL(bioset_exit);
1983 * bioset_init - Initialize a bio_set
1984 * @bs: pool to initialize
1985 * @pool_size: Number of bio and bio_vecs to cache in the mempool
1986 * @front_pad: Number of bytes to allocate in front of the returned bio
1987 * @flags: Flags to modify behavior, currently %BIOSET_NEED_BVECS
1988 * and %BIOSET_NEED_RESCUER
1991 * Set up a bio_set to be used with @bio_alloc_bioset. Allows the caller
1992 * to ask for a number of bytes to be allocated in front of the bio.
1993 * Front pad allocation is useful for embedding the bio inside
1994 * another structure, to avoid allocating extra data to go with the bio.
1995 * Note that the bio must be embedded at the END of that structure always,
1996 * or things will break badly.
1997 * If %BIOSET_NEED_BVECS is set in @flags, a separate pool will be allocated
1998 * for allocating iovecs. This pool is not needed e.g. for bio_clone_fast().
1999 * If %BIOSET_NEED_RESCUER is set, a workqueue is created which can be used to
2000 * dispatch queued requests when the mempool runs out of space.
2003 int bioset_init(struct bio_set *bs,
2004 unsigned int pool_size,
2005 unsigned int front_pad,
2008 unsigned int back_pad = BIO_INLINE_VECS * sizeof(struct bio_vec);
2010 bs->front_pad = front_pad;
2012 spin_lock_init(&bs->rescue_lock);
2013 bio_list_init(&bs->rescue_list);
2014 INIT_WORK(&bs->rescue_work, bio_alloc_rescue);
2016 bs->bio_slab = bio_find_or_create_slab(front_pad + back_pad);
2020 if (mempool_init_slab_pool(&bs->bio_pool, pool_size, bs->bio_slab))
2023 if ((flags & BIOSET_NEED_BVECS) &&
2024 biovec_init_pool(&bs->bvec_pool, pool_size))
2027 if (!(flags & BIOSET_NEED_RESCUER))
2030 bs->rescue_workqueue = alloc_workqueue("bioset", WQ_MEM_RECLAIM, 0);
2031 if (!bs->rescue_workqueue)
2039 EXPORT_SYMBOL(bioset_init);
2042 * Initialize and setup a new bio_set, based on the settings from
2045 int bioset_init_from_src(struct bio_set *bs, struct bio_set *src)
2050 if (src->bvec_pool.min_nr)
2051 flags |= BIOSET_NEED_BVECS;
2052 if (src->rescue_workqueue)
2053 flags |= BIOSET_NEED_RESCUER;
2055 return bioset_init(bs, src->bio_pool.min_nr, src->front_pad, flags);
2057 EXPORT_SYMBOL(bioset_init_from_src);
2059 #ifdef CONFIG_BLK_CGROUP
2062 * bio_disassociate_blkg - puts back the blkg reference if associated
2065 * Helper to disassociate the blkg from @bio if a blkg is associated.
2067 void bio_disassociate_blkg(struct bio *bio)
2070 blkg_put(bio->bi_blkg);
2071 bio->bi_blkg = NULL;
2074 EXPORT_SYMBOL_GPL(bio_disassociate_blkg);
2077 * __bio_associate_blkg - associate a bio with the a blkg
2079 * @blkg: the blkg to associate
2081 * This tries to associate @bio with the specified @blkg. Association failure
2082 * is handled by walking up the blkg tree. Therefore, the blkg associated can
2083 * be anything between @blkg and the root_blkg. This situation only happens
2084 * when a cgroup is dying and then the remaining bios will spill to the closest
2087 * A reference will be taken on the @blkg and will be released when @bio is
2090 static void __bio_associate_blkg(struct bio *bio, struct blkcg_gq *blkg)
2092 bio_disassociate_blkg(bio);
2094 bio->bi_blkg = blkg_tryget_closest(blkg);
2098 * bio_associate_blkg_from_css - associate a bio with a specified css
2102 * Associate @bio with the blkg found by combining the css's blkg and the
2103 * request_queue of the @bio. This falls back to the queue's root_blkg if
2104 * the association fails with the css.
2106 void bio_associate_blkg_from_css(struct bio *bio,
2107 struct cgroup_subsys_state *css)
2109 struct request_queue *q = bio->bi_disk->queue;
2110 struct blkcg_gq *blkg;
2114 if (!css || !css->parent)
2115 blkg = q->root_blkg;
2117 blkg = blkg_lookup_create(css_to_blkcg(css), q);
2119 __bio_associate_blkg(bio, blkg);
2123 EXPORT_SYMBOL_GPL(bio_associate_blkg_from_css);
2127 * bio_associate_blkg_from_page - associate a bio with the page's blkg
2129 * @page: the page to lookup the blkcg from
2131 * Associate @bio with the blkg from @page's owning memcg and the respective
2132 * request_queue. If cgroup_e_css returns %NULL, fall back to the queue's
2135 void bio_associate_blkg_from_page(struct bio *bio, struct page *page)
2137 struct cgroup_subsys_state *css;
2139 if (!page->mem_cgroup)
2144 css = cgroup_e_css(page->mem_cgroup->css.cgroup, &io_cgrp_subsys);
2145 bio_associate_blkg_from_css(bio, css);
2149 #endif /* CONFIG_MEMCG */
2152 * bio_associate_blkg - associate a bio with a blkg
2155 * Associate @bio with the blkg found from the bio's css and request_queue.
2156 * If one is not found, bio_lookup_blkg() creates the blkg. If a blkg is
2157 * already associated, the css is reused and association redone as the
2158 * request_queue may have changed.
2160 void bio_associate_blkg(struct bio *bio)
2162 struct cgroup_subsys_state *css;
2167 css = &bio_blkcg(bio)->css;
2171 bio_associate_blkg_from_css(bio, css);
2175 EXPORT_SYMBOL_GPL(bio_associate_blkg);
2178 * bio_clone_blkg_association - clone blkg association from src to dst bio
2179 * @dst: destination bio
2182 void bio_clone_blkg_association(struct bio *dst, struct bio *src)
2187 __bio_associate_blkg(dst, src->bi_blkg);
2191 EXPORT_SYMBOL_GPL(bio_clone_blkg_association);
2192 #endif /* CONFIG_BLK_CGROUP */
2194 static void __init biovec_init_slabs(void)
2198 for (i = 0; i < BVEC_POOL_NR; i++) {
2200 struct biovec_slab *bvs = bvec_slabs + i;
2202 if (bvs->nr_vecs <= BIO_INLINE_VECS) {
2207 size = bvs->nr_vecs * sizeof(struct bio_vec);
2208 bvs->slab = kmem_cache_create(bvs->name, size, 0,
2209 SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
2213 static int __init init_bio(void)
2217 bio_slabs = kcalloc(bio_slab_max, sizeof(struct bio_slab),
2220 panic("bio: can't allocate bios\n");
2222 bio_integrity_init();
2223 biovec_init_slabs();
2225 if (bioset_init(&fs_bio_set, BIO_POOL_SIZE, 0, BIOSET_NEED_BVECS))
2226 panic("bio: can't allocate bios\n");
2228 if (bioset_integrity_create(&fs_bio_set, BIO_POOL_SIZE))
2229 panic("bio: can't create integrity pool\n");
2233 subsys_initcall(init_bio);