]>
git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - block/bio.c
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>
32 #include <trace/events/block.h>
35 * Test patch to inline a certain number of bi_io_vec's inside the bio
36 * itself, to shrink a bio data allocation from two mempool calls to one
38 #define BIO_INLINE_VECS 4
41 * if you change this list, also change bvec_alloc or things will
42 * break badly! cannot be bigger than what you can fit into an
45 #define BV(x) { .nr_vecs = x, .name = "biovec-"__stringify(x) }
46 static struct biovec_slab bvec_slabs
[BVEC_POOL_NR
] __read_mostly
= {
47 BV(1), BV(4), BV(16), BV(64), BV(128), BV(BIO_MAX_PAGES
),
52 * fs_bio_set is the bio_set containing bio and iovec memory pools used by
53 * IO code that does not need private memory pools.
55 struct bio_set
*fs_bio_set
;
56 EXPORT_SYMBOL(fs_bio_set
);
59 * Our slab pool management
62 struct kmem_cache
*slab
;
63 unsigned int slab_ref
;
64 unsigned int slab_size
;
67 static DEFINE_MUTEX(bio_slab_lock
);
68 static struct bio_slab
*bio_slabs
;
69 static unsigned int bio_slab_nr
, bio_slab_max
;
71 static struct kmem_cache
*bio_find_or_create_slab(unsigned int extra_size
)
73 unsigned int sz
= sizeof(struct bio
) + extra_size
;
74 struct kmem_cache
*slab
= NULL
;
75 struct bio_slab
*bslab
, *new_bio_slabs
;
76 unsigned int new_bio_slab_max
;
77 unsigned int i
, entry
= -1;
79 mutex_lock(&bio_slab_lock
);
82 while (i
< bio_slab_nr
) {
83 bslab
= &bio_slabs
[i
];
85 if (!bslab
->slab
&& entry
== -1)
87 else if (bslab
->slab_size
== sz
) {
98 if (bio_slab_nr
== bio_slab_max
&& entry
== -1) {
99 new_bio_slab_max
= bio_slab_max
<< 1;
100 new_bio_slabs
= krealloc(bio_slabs
,
101 new_bio_slab_max
* sizeof(struct bio_slab
),
105 bio_slab_max
= new_bio_slab_max
;
106 bio_slabs
= new_bio_slabs
;
109 entry
= bio_slab_nr
++;
111 bslab
= &bio_slabs
[entry
];
113 snprintf(bslab
->name
, sizeof(bslab
->name
), "bio-%d", entry
);
114 slab
= kmem_cache_create(bslab
->name
, sz
, ARCH_KMALLOC_MINALIGN
,
115 SLAB_HWCACHE_ALIGN
, NULL
);
121 bslab
->slab_size
= sz
;
123 mutex_unlock(&bio_slab_lock
);
127 static void bio_put_slab(struct bio_set
*bs
)
129 struct bio_slab
*bslab
= NULL
;
132 mutex_lock(&bio_slab_lock
);
134 for (i
= 0; i
< bio_slab_nr
; i
++) {
135 if (bs
->bio_slab
== bio_slabs
[i
].slab
) {
136 bslab
= &bio_slabs
[i
];
141 if (WARN(!bslab
, KERN_ERR
"bio: unable to find slab!\n"))
144 WARN_ON(!bslab
->slab_ref
);
146 if (--bslab
->slab_ref
)
149 kmem_cache_destroy(bslab
->slab
);
153 mutex_unlock(&bio_slab_lock
);
156 unsigned int bvec_nr_vecs(unsigned short idx
)
158 return bvec_slabs
[idx
].nr_vecs
;
161 void bvec_free(mempool_t
*pool
, struct bio_vec
*bv
, unsigned int idx
)
167 BIO_BUG_ON(idx
>= BVEC_POOL_NR
);
169 if (idx
== BVEC_POOL_MAX
) {
170 mempool_free(bv
, pool
);
172 struct biovec_slab
*bvs
= bvec_slabs
+ idx
;
174 kmem_cache_free(bvs
->slab
, bv
);
178 struct bio_vec
*bvec_alloc(gfp_t gfp_mask
, int nr
, unsigned long *idx
,
184 * see comment near bvec_array define!
202 case 129 ... BIO_MAX_PAGES
:
210 * idx now points to the pool we want to allocate from. only the
211 * 1-vec entry pool is mempool backed.
213 if (*idx
== BVEC_POOL_MAX
) {
215 bvl
= mempool_alloc(pool
, gfp_mask
);
217 struct biovec_slab
*bvs
= bvec_slabs
+ *idx
;
218 gfp_t __gfp_mask
= gfp_mask
& ~(__GFP_DIRECT_RECLAIM
| __GFP_IO
);
221 * Make this allocation restricted and don't dump info on
222 * allocation failures, since we'll fallback to the mempool
223 * in case of failure.
225 __gfp_mask
|= __GFP_NOMEMALLOC
| __GFP_NORETRY
| __GFP_NOWARN
;
228 * Try a slab allocation. If this fails and __GFP_DIRECT_RECLAIM
229 * is set, retry with the 1-entry mempool
231 bvl
= kmem_cache_alloc(bvs
->slab
, __gfp_mask
);
232 if (unlikely(!bvl
&& (gfp_mask
& __GFP_DIRECT_RECLAIM
))) {
233 *idx
= BVEC_POOL_MAX
;
242 static void __bio_free(struct bio
*bio
)
244 bio_disassociate_task(bio
);
246 if (bio_integrity(bio
))
247 bio_integrity_free(bio
);
250 static void bio_free(struct bio
*bio
)
252 struct bio_set
*bs
= bio
->bi_pool
;
258 bvec_free(bs
->bvec_pool
, bio
->bi_io_vec
, BVEC_POOL_IDX(bio
));
261 * If we have front padding, adjust the bio pointer before freeing
266 mempool_free(p
, bs
->bio_pool
);
268 /* Bio was allocated by bio_kmalloc() */
273 void bio_init(struct bio
*bio
, struct bio_vec
*table
,
274 unsigned short max_vecs
)
276 memset(bio
, 0, sizeof(*bio
));
277 atomic_set(&bio
->__bi_remaining
, 1);
278 atomic_set(&bio
->__bi_cnt
, 1);
280 bio
->bi_io_vec
= table
;
281 bio
->bi_max_vecs
= max_vecs
;
283 EXPORT_SYMBOL(bio_init
);
286 * bio_reset - reinitialize a bio
290 * After calling bio_reset(), @bio will be in the same state as a freshly
291 * allocated bio returned bio bio_alloc_bioset() - the only fields that are
292 * preserved are the ones that are initialized by bio_alloc_bioset(). See
293 * comment in struct bio.
295 void bio_reset(struct bio
*bio
)
297 unsigned long flags
= bio
->bi_flags
& (~0UL << BIO_RESET_BITS
);
301 memset(bio
, 0, BIO_RESET_BYTES
);
302 bio
->bi_flags
= flags
;
303 atomic_set(&bio
->__bi_remaining
, 1);
305 EXPORT_SYMBOL(bio_reset
);
307 static struct bio
*__bio_chain_endio(struct bio
*bio
)
309 struct bio
*parent
= bio
->bi_private
;
311 if (!parent
->bi_error
)
312 parent
->bi_error
= bio
->bi_error
;
317 static void bio_chain_endio(struct bio
*bio
)
319 bio_endio(__bio_chain_endio(bio
));
323 * bio_chain - chain bio completions
324 * @bio: the target bio
325 * @parent: the @bio's parent bio
327 * The caller won't have a bi_end_io called when @bio completes - instead,
328 * @parent's bi_end_io won't be called until both @parent and @bio have
329 * completed; the chained bio will also be freed when it completes.
331 * The caller must not set bi_private or bi_end_io in @bio.
333 void bio_chain(struct bio
*bio
, struct bio
*parent
)
335 BUG_ON(bio
->bi_private
|| bio
->bi_end_io
);
337 bio
->bi_private
= parent
;
338 bio
->bi_end_io
= bio_chain_endio
;
339 bio_inc_remaining(parent
);
341 EXPORT_SYMBOL(bio_chain
);
343 static void bio_alloc_rescue(struct work_struct
*work
)
345 struct bio_set
*bs
= container_of(work
, struct bio_set
, rescue_work
);
349 spin_lock(&bs
->rescue_lock
);
350 bio
= bio_list_pop(&bs
->rescue_list
);
351 spin_unlock(&bs
->rescue_lock
);
356 generic_make_request(bio
);
360 static void punt_bios_to_rescuer(struct bio_set
*bs
)
362 struct bio_list punt
, nopunt
;
366 * In order to guarantee forward progress we must punt only bios that
367 * were allocated from this bio_set; otherwise, if there was a bio on
368 * there for a stacking driver higher up in the stack, processing it
369 * could require allocating bios from this bio_set, and doing that from
370 * our own rescuer would be bad.
372 * Since bio lists are singly linked, pop them all instead of trying to
373 * remove from the middle of the list:
376 bio_list_init(&punt
);
377 bio_list_init(&nopunt
);
379 while ((bio
= bio_list_pop(current
->bio_list
)))
380 bio_list_add(bio
->bi_pool
== bs
? &punt
: &nopunt
, bio
);
382 *current
->bio_list
= nopunt
;
384 spin_lock(&bs
->rescue_lock
);
385 bio_list_merge(&bs
->rescue_list
, &punt
);
386 spin_unlock(&bs
->rescue_lock
);
388 queue_work(bs
->rescue_workqueue
, &bs
->rescue_work
);
392 * bio_alloc_bioset - allocate a bio for I/O
393 * @gfp_mask: the GFP_ mask given to the slab allocator
394 * @nr_iovecs: number of iovecs to pre-allocate
395 * @bs: the bio_set to allocate from.
398 * If @bs is NULL, uses kmalloc() to allocate the bio; else the allocation is
399 * backed by the @bs's mempool.
401 * When @bs is not NULL, if %__GFP_DIRECT_RECLAIM is set then bio_alloc will
402 * always be able to allocate a bio. This is due to the mempool guarantees.
403 * To make this work, callers must never allocate more than 1 bio at a time
404 * from this pool. Callers that need to allocate more than 1 bio must always
405 * submit the previously allocated bio for IO before attempting to allocate
406 * a new one. Failure to do so can cause deadlocks under memory pressure.
408 * Note that when running under generic_make_request() (i.e. any block
409 * driver), bios are not submitted until after you return - see the code in
410 * generic_make_request() that converts recursion into iteration, to prevent
413 * This would normally mean allocating multiple bios under
414 * generic_make_request() would be susceptible to deadlocks, but we have
415 * deadlock avoidance code that resubmits any blocked bios from a rescuer
418 * However, we do not guarantee forward progress for allocations from other
419 * mempools. Doing multiple allocations from the same mempool under
420 * generic_make_request() should be avoided - instead, use bio_set's front_pad
421 * for per bio allocations.
424 * Pointer to new bio on success, NULL on failure.
426 struct bio
*bio_alloc_bioset(gfp_t gfp_mask
, int nr_iovecs
, struct bio_set
*bs
)
428 gfp_t saved_gfp
= gfp_mask
;
430 unsigned inline_vecs
;
431 struct bio_vec
*bvl
= NULL
;
436 if (nr_iovecs
> UIO_MAXIOV
)
439 p
= kmalloc(sizeof(struct bio
) +
440 nr_iovecs
* sizeof(struct bio_vec
),
443 inline_vecs
= nr_iovecs
;
445 /* should not use nobvec bioset for nr_iovecs > 0 */
446 if (WARN_ON_ONCE(!bs
->bvec_pool
&& nr_iovecs
> 0))
449 * generic_make_request() converts recursion to iteration; this
450 * means if we're running beneath it, any bios we allocate and
451 * submit will not be submitted (and thus freed) until after we
454 * This exposes us to a potential deadlock if we allocate
455 * multiple bios from the same bio_set() while running
456 * underneath generic_make_request(). If we were to allocate
457 * multiple bios (say a stacking block driver that was splitting
458 * bios), we would deadlock if we exhausted the mempool's
461 * We solve this, and guarantee forward progress, with a rescuer
462 * workqueue per bio_set. If we go to allocate and there are
463 * bios on current->bio_list, we first try the allocation
464 * without __GFP_DIRECT_RECLAIM; if that fails, we punt those
465 * bios we would be blocking to the rescuer workqueue before
466 * we retry with the original gfp_flags.
469 if (current
->bio_list
&& !bio_list_empty(current
->bio_list
))
470 gfp_mask
&= ~__GFP_DIRECT_RECLAIM
;
472 p
= mempool_alloc(bs
->bio_pool
, gfp_mask
);
473 if (!p
&& gfp_mask
!= saved_gfp
) {
474 punt_bios_to_rescuer(bs
);
475 gfp_mask
= saved_gfp
;
476 p
= mempool_alloc(bs
->bio_pool
, gfp_mask
);
479 front_pad
= bs
->front_pad
;
480 inline_vecs
= BIO_INLINE_VECS
;
487 bio_init(bio
, NULL
, 0);
489 if (nr_iovecs
> inline_vecs
) {
490 unsigned long idx
= 0;
492 bvl
= bvec_alloc(gfp_mask
, nr_iovecs
, &idx
, bs
->bvec_pool
);
493 if (!bvl
&& gfp_mask
!= saved_gfp
) {
494 punt_bios_to_rescuer(bs
);
495 gfp_mask
= saved_gfp
;
496 bvl
= bvec_alloc(gfp_mask
, nr_iovecs
, &idx
, bs
->bvec_pool
);
502 bio
->bi_flags
|= idx
<< BVEC_POOL_OFFSET
;
503 } else if (nr_iovecs
) {
504 bvl
= bio
->bi_inline_vecs
;
508 bio
->bi_max_vecs
= nr_iovecs
;
509 bio
->bi_io_vec
= bvl
;
513 mempool_free(p
, bs
->bio_pool
);
516 EXPORT_SYMBOL(bio_alloc_bioset
);
518 void zero_fill_bio(struct bio
*bio
)
522 struct bvec_iter iter
;
524 bio_for_each_segment(bv
, bio
, iter
) {
525 char *data
= bvec_kmap_irq(&bv
, &flags
);
526 memset(data
, 0, bv
.bv_len
);
527 flush_dcache_page(bv
.bv_page
);
528 bvec_kunmap_irq(data
, &flags
);
531 EXPORT_SYMBOL(zero_fill_bio
);
534 * bio_put - release a reference to a bio
535 * @bio: bio to release reference to
538 * Put a reference to a &struct bio, either one you have gotten with
539 * bio_alloc, bio_get or bio_clone. The last put of a bio will free it.
541 void bio_put(struct bio
*bio
)
543 if (!bio_flagged(bio
, BIO_REFFED
))
546 BIO_BUG_ON(!atomic_read(&bio
->__bi_cnt
));
551 if (atomic_dec_and_test(&bio
->__bi_cnt
))
555 EXPORT_SYMBOL(bio_put
);
557 inline int bio_phys_segments(struct request_queue
*q
, struct bio
*bio
)
559 if (unlikely(!bio_flagged(bio
, BIO_SEG_VALID
)))
560 blk_recount_segments(q
, bio
);
562 return bio
->bi_phys_segments
;
564 EXPORT_SYMBOL(bio_phys_segments
);
567 * __bio_clone_fast - clone a bio that shares the original bio's biovec
568 * @bio: destination bio
569 * @bio_src: bio to clone
571 * Clone a &bio. Caller will own the returned bio, but not
572 * the actual data it points to. Reference count of returned
575 * Caller must ensure that @bio_src is not freed before @bio.
577 void __bio_clone_fast(struct bio
*bio
, struct bio
*bio_src
)
579 BUG_ON(bio
->bi_pool
&& BVEC_POOL_IDX(bio
));
582 * most users will be overriding ->bi_bdev with a new target,
583 * so we don't set nor calculate new physical/hw segment counts here
585 bio
->bi_bdev
= bio_src
->bi_bdev
;
586 bio_set_flag(bio
, BIO_CLONED
);
587 bio
->bi_opf
= bio_src
->bi_opf
;
588 bio
->bi_iter
= bio_src
->bi_iter
;
589 bio
->bi_io_vec
= bio_src
->bi_io_vec
;
591 bio_clone_blkcg_association(bio
, bio_src
);
593 EXPORT_SYMBOL(__bio_clone_fast
);
596 * bio_clone_fast - clone a bio that shares the original bio's biovec
598 * @gfp_mask: allocation priority
599 * @bs: bio_set to allocate from
601 * Like __bio_clone_fast, only also allocates the returned bio
603 struct bio
*bio_clone_fast(struct bio
*bio
, gfp_t gfp_mask
, struct bio_set
*bs
)
607 b
= bio_alloc_bioset(gfp_mask
, 0, bs
);
611 __bio_clone_fast(b
, bio
);
613 if (bio_integrity(bio
)) {
616 ret
= bio_integrity_clone(b
, bio
, gfp_mask
);
626 EXPORT_SYMBOL(bio_clone_fast
);
628 static struct bio
*__bio_clone_bioset(struct bio
*bio_src
, gfp_t gfp_mask
,
629 struct bio_set
*bs
, int offset
,
632 struct bvec_iter iter
;
635 struct bvec_iter iter_src
= bio_src
->bi_iter
;
637 /* for supporting partial clone */
638 if (offset
|| size
!= bio_src
->bi_iter
.bi_size
) {
639 bio_advance_iter(bio_src
, &iter_src
, offset
);
640 iter_src
.bi_size
= size
;
644 * Pre immutable biovecs, __bio_clone() used to just do a memcpy from
645 * bio_src->bi_io_vec to bio->bi_io_vec.
647 * We can't do that anymore, because:
649 * - The point of cloning the biovec is to produce a bio with a biovec
650 * the caller can modify: bi_idx and bi_bvec_done should be 0.
652 * - The original bio could've had more than BIO_MAX_PAGES biovecs; if
653 * we tried to clone the whole thing bio_alloc_bioset() would fail.
654 * But the clone should succeed as long as the number of biovecs we
655 * actually need to allocate is fewer than BIO_MAX_PAGES.
657 * - Lastly, bi_vcnt should not be looked at or relied upon by code
658 * that does not own the bio - reason being drivers don't use it for
659 * iterating over the biovec anymore, so expecting it to be kept up
660 * to date (i.e. for clones that share the parent biovec) is just
661 * asking for trouble and would force extra work on
662 * __bio_clone_fast() anyways.
665 bio
= bio_alloc_bioset(gfp_mask
, __bio_segments(bio_src
,
669 bio
->bi_bdev
= bio_src
->bi_bdev
;
670 bio
->bi_opf
= bio_src
->bi_opf
;
671 bio
->bi_iter
.bi_sector
= bio_src
->bi_iter
.bi_sector
;
672 bio
->bi_iter
.bi_size
= bio_src
->bi_iter
.bi_size
;
674 switch (bio_op(bio
)) {
676 case REQ_OP_SECURE_ERASE
:
677 case REQ_OP_WRITE_ZEROES
:
679 case REQ_OP_WRITE_SAME
:
680 bio
->bi_io_vec
[bio
->bi_vcnt
++] = bio_src
->bi_io_vec
[0];
683 __bio_for_each_segment(bv
, bio_src
, iter
, iter_src
)
684 bio
->bi_io_vec
[bio
->bi_vcnt
++] = bv
;
688 if (bio_integrity(bio_src
)) {
691 ret
= bio_integrity_clone(bio
, bio_src
, gfp_mask
);
698 bio_clone_blkcg_association(bio
, bio_src
);
704 * bio_clone_bioset - clone a bio
705 * @bio_src: bio to clone
706 * @gfp_mask: allocation priority
707 * @bs: bio_set to allocate from
709 * Clone bio. Caller will own the returned bio, but not the actual data it
710 * points to. Reference count of returned bio will be one.
712 struct bio
*bio_clone_bioset(struct bio
*bio_src
, gfp_t gfp_mask
,
715 return __bio_clone_bioset(bio_src
, gfp_mask
, bs
, 0,
716 bio_src
->bi_iter
.bi_size
);
718 EXPORT_SYMBOL(bio_clone_bioset
);
721 * bio_clone_bioset_partial - clone a partial bio
722 * @bio_src: bio to clone
723 * @gfp_mask: allocation priority
724 * @bs: bio_set to allocate from
725 * @offset: cloned starting from the offset
726 * @size: size for the cloned bio
728 * Clone bio. Caller will own the returned bio, but not the actual data it
729 * points to. Reference count of returned bio will be one.
731 struct bio
*bio_clone_bioset_partial(struct bio
*bio_src
, gfp_t gfp_mask
,
732 struct bio_set
*bs
, int offset
,
735 return __bio_clone_bioset(bio_src
, gfp_mask
, bs
, offset
, size
);
737 EXPORT_SYMBOL(bio_clone_bioset_partial
);
740 * bio_add_pc_page - attempt to add page to bio
741 * @q: the target queue
742 * @bio: destination bio
744 * @len: vec entry length
745 * @offset: vec entry offset
747 * Attempt to add a page to the bio_vec maplist. This can fail for a
748 * number of reasons, such as the bio being full or target block device
749 * limitations. The target block device must allow bio's up to PAGE_SIZE,
750 * so it is always possible to add a single page to an empty bio.
752 * This should only be used by REQ_PC bios.
754 int bio_add_pc_page(struct request_queue
*q
, struct bio
*bio
, struct page
755 *page
, unsigned int len
, unsigned int offset
)
757 int retried_segments
= 0;
758 struct bio_vec
*bvec
;
761 * cloned bio must not modify vec list
763 if (unlikely(bio_flagged(bio
, BIO_CLONED
)))
766 if (((bio
->bi_iter
.bi_size
+ len
) >> 9) > queue_max_hw_sectors(q
))
770 * For filesystems with a blocksize smaller than the pagesize
771 * we will often be called with the same page as last time and
772 * a consecutive offset. Optimize this special case.
774 if (bio
->bi_vcnt
> 0) {
775 struct bio_vec
*prev
= &bio
->bi_io_vec
[bio
->bi_vcnt
- 1];
777 if (page
== prev
->bv_page
&&
778 offset
== prev
->bv_offset
+ prev
->bv_len
) {
780 bio
->bi_iter
.bi_size
+= len
;
785 * If the queue doesn't support SG gaps and adding this
786 * offset would create a gap, disallow it.
788 if (bvec_gap_to_prev(q
, prev
, offset
))
792 if (bio
->bi_vcnt
>= bio
->bi_max_vecs
)
796 * setup the new entry, we might clear it again later if we
797 * cannot add the page
799 bvec
= &bio
->bi_io_vec
[bio
->bi_vcnt
];
800 bvec
->bv_page
= page
;
802 bvec
->bv_offset
= offset
;
804 bio
->bi_phys_segments
++;
805 bio
->bi_iter
.bi_size
+= len
;
808 * Perform a recount if the number of segments is greater
809 * than queue_max_segments(q).
812 while (bio
->bi_phys_segments
> queue_max_segments(q
)) {
814 if (retried_segments
)
817 retried_segments
= 1;
818 blk_recount_segments(q
, bio
);
821 /* If we may be able to merge these biovecs, force a recount */
822 if (bio
->bi_vcnt
> 1 && (BIOVEC_PHYS_MERGEABLE(bvec
-1, bvec
)))
823 bio_clear_flag(bio
, BIO_SEG_VALID
);
829 bvec
->bv_page
= NULL
;
833 bio
->bi_iter
.bi_size
-= len
;
834 blk_recount_segments(q
, bio
);
837 EXPORT_SYMBOL(bio_add_pc_page
);
840 * bio_add_page - attempt to add page to bio
841 * @bio: destination bio
843 * @len: vec entry length
844 * @offset: vec entry offset
846 * Attempt to add a page to the bio_vec maplist. This will only fail
847 * if either bio->bi_vcnt == bio->bi_max_vecs or it's a cloned bio.
849 int bio_add_page(struct bio
*bio
, struct page
*page
,
850 unsigned int len
, unsigned int offset
)
855 * cloned bio must not modify vec list
857 if (WARN_ON_ONCE(bio_flagged(bio
, BIO_CLONED
)))
861 * For filesystems with a blocksize smaller than the pagesize
862 * we will often be called with the same page as last time and
863 * a consecutive offset. Optimize this special case.
865 if (bio
->bi_vcnt
> 0) {
866 bv
= &bio
->bi_io_vec
[bio
->bi_vcnt
- 1];
868 if (page
== bv
->bv_page
&&
869 offset
== bv
->bv_offset
+ bv
->bv_len
) {
875 if (bio
->bi_vcnt
>= bio
->bi_max_vecs
)
878 bv
= &bio
->bi_io_vec
[bio
->bi_vcnt
];
881 bv
->bv_offset
= offset
;
885 bio
->bi_iter
.bi_size
+= len
;
888 EXPORT_SYMBOL(bio_add_page
);
891 * bio_iov_iter_get_pages - pin user or kernel pages and add them to a bio
892 * @bio: bio to add pages to
893 * @iter: iov iterator describing the region to be mapped
895 * Pins as many pages from *iter and appends them to @bio's bvec array. The
896 * pages will have to be released using put_page() when done.
898 int bio_iov_iter_get_pages(struct bio
*bio
, struct iov_iter
*iter
)
900 unsigned short nr_pages
= bio
->bi_max_vecs
- bio
->bi_vcnt
;
901 struct bio_vec
*bv
= bio
->bi_io_vec
+ bio
->bi_vcnt
;
902 struct page
**pages
= (struct page
**)bv
;
906 size
= iov_iter_get_pages(iter
, pages
, LONG_MAX
, nr_pages
, &offset
);
907 if (unlikely(size
<= 0))
908 return size
? size
: -EFAULT
;
909 nr_pages
= (size
+ offset
+ PAGE_SIZE
- 1) / PAGE_SIZE
;
912 * Deep magic below: We need to walk the pinned pages backwards
913 * because we are abusing the space allocated for the bio_vecs
914 * for the page array. Because the bio_vecs are larger than the
915 * page pointers by definition this will always work. But it also
916 * means we can't use bio_add_page, so any changes to it's semantics
917 * need to be reflected here as well.
919 bio
->bi_iter
.bi_size
+= size
;
920 bio
->bi_vcnt
+= nr_pages
;
922 diff
= (nr_pages
* PAGE_SIZE
- offset
) - size
;
924 bv
[nr_pages
].bv_page
= pages
[nr_pages
];
925 bv
[nr_pages
].bv_len
= PAGE_SIZE
;
926 bv
[nr_pages
].bv_offset
= 0;
929 bv
[0].bv_offset
+= offset
;
930 bv
[0].bv_len
-= offset
;
932 bv
[bio
->bi_vcnt
- 1].bv_len
-= diff
;
934 iov_iter_advance(iter
, size
);
937 EXPORT_SYMBOL_GPL(bio_iov_iter_get_pages
);
939 struct submit_bio_ret
{
940 struct completion event
;
944 static void submit_bio_wait_endio(struct bio
*bio
)
946 struct submit_bio_ret
*ret
= bio
->bi_private
;
948 ret
->error
= bio
->bi_error
;
949 complete(&ret
->event
);
953 * submit_bio_wait - submit a bio, and wait until it completes
954 * @bio: The &struct bio which describes the I/O
956 * Simple wrapper around submit_bio(). Returns 0 on success, or the error from
957 * bio_endio() on failure.
959 int submit_bio_wait(struct bio
*bio
)
961 struct submit_bio_ret ret
;
963 init_completion(&ret
.event
);
964 bio
->bi_private
= &ret
;
965 bio
->bi_end_io
= submit_bio_wait_endio
;
966 bio
->bi_opf
|= REQ_SYNC
;
968 wait_for_completion_io(&ret
.event
);
972 EXPORT_SYMBOL(submit_bio_wait
);
975 * bio_advance - increment/complete a bio by some number of bytes
976 * @bio: bio to advance
977 * @bytes: number of bytes to complete
979 * This updates bi_sector, bi_size and bi_idx; if the number of bytes to
980 * complete doesn't align with a bvec boundary, then bv_len and bv_offset will
981 * be updated on the last bvec as well.
983 * @bio will then represent the remaining, uncompleted portion of the io.
985 void bio_advance(struct bio
*bio
, unsigned bytes
)
987 if (bio_integrity(bio
))
988 bio_integrity_advance(bio
, bytes
);
990 bio_advance_iter(bio
, &bio
->bi_iter
, bytes
);
992 EXPORT_SYMBOL(bio_advance
);
995 * bio_alloc_pages - allocates a single page for each bvec in a bio
996 * @bio: bio to allocate pages for
997 * @gfp_mask: flags for allocation
999 * Allocates pages up to @bio->bi_vcnt.
1001 * Returns 0 on success, -ENOMEM on failure. On failure, any allocated pages are
1004 int bio_alloc_pages(struct bio
*bio
, gfp_t gfp_mask
)
1009 bio_for_each_segment_all(bv
, bio
, i
) {
1010 bv
->bv_page
= alloc_page(gfp_mask
);
1012 while (--bv
>= bio
->bi_io_vec
)
1013 __free_page(bv
->bv_page
);
1020 EXPORT_SYMBOL(bio_alloc_pages
);
1023 * bio_copy_data - copy contents of data buffers from one chain of bios to
1025 * @src: source bio list
1026 * @dst: destination bio list
1028 * If @src and @dst are single bios, bi_next must be NULL - otherwise, treats
1029 * @src and @dst as linked lists of bios.
1031 * Stops when it reaches the end of either @src or @dst - that is, copies
1032 * min(src->bi_size, dst->bi_size) bytes (or the equivalent for lists of bios).
1034 void bio_copy_data(struct bio
*dst
, struct bio
*src
)
1036 struct bvec_iter src_iter
, dst_iter
;
1037 struct bio_vec src_bv
, dst_bv
;
1038 void *src_p
, *dst_p
;
1041 src_iter
= src
->bi_iter
;
1042 dst_iter
= dst
->bi_iter
;
1045 if (!src_iter
.bi_size
) {
1050 src_iter
= src
->bi_iter
;
1053 if (!dst_iter
.bi_size
) {
1058 dst_iter
= dst
->bi_iter
;
1061 src_bv
= bio_iter_iovec(src
, src_iter
);
1062 dst_bv
= bio_iter_iovec(dst
, dst_iter
);
1064 bytes
= min(src_bv
.bv_len
, dst_bv
.bv_len
);
1066 src_p
= kmap_atomic(src_bv
.bv_page
);
1067 dst_p
= kmap_atomic(dst_bv
.bv_page
);
1069 memcpy(dst_p
+ dst_bv
.bv_offset
,
1070 src_p
+ src_bv
.bv_offset
,
1073 kunmap_atomic(dst_p
);
1074 kunmap_atomic(src_p
);
1076 bio_advance_iter(src
, &src_iter
, bytes
);
1077 bio_advance_iter(dst
, &dst_iter
, bytes
);
1080 EXPORT_SYMBOL(bio_copy_data
);
1082 struct bio_map_data
{
1084 struct iov_iter iter
;
1088 static struct bio_map_data
*bio_alloc_map_data(unsigned int iov_count
,
1091 if (iov_count
> UIO_MAXIOV
)
1094 return kmalloc(sizeof(struct bio_map_data
) +
1095 sizeof(struct iovec
) * iov_count
, gfp_mask
);
1099 * bio_copy_from_iter - copy all pages from iov_iter to bio
1100 * @bio: The &struct bio which describes the I/O as destination
1101 * @iter: iov_iter as source
1103 * Copy all pages from iov_iter to bio.
1104 * Returns 0 on success, or error on failure.
1106 static int bio_copy_from_iter(struct bio
*bio
, struct iov_iter iter
)
1109 struct bio_vec
*bvec
;
1111 bio_for_each_segment_all(bvec
, bio
, i
) {
1114 ret
= copy_page_from_iter(bvec
->bv_page
,
1119 if (!iov_iter_count(&iter
))
1122 if (ret
< bvec
->bv_len
)
1130 * bio_copy_to_iter - copy all pages from bio to iov_iter
1131 * @bio: The &struct bio which describes the I/O as source
1132 * @iter: iov_iter as destination
1134 * Copy all pages from bio to iov_iter.
1135 * Returns 0 on success, or error on failure.
1137 static int bio_copy_to_iter(struct bio
*bio
, struct iov_iter iter
)
1140 struct bio_vec
*bvec
;
1142 bio_for_each_segment_all(bvec
, bio
, i
) {
1145 ret
= copy_page_to_iter(bvec
->bv_page
,
1150 if (!iov_iter_count(&iter
))
1153 if (ret
< bvec
->bv_len
)
1160 void bio_free_pages(struct bio
*bio
)
1162 struct bio_vec
*bvec
;
1165 bio_for_each_segment_all(bvec
, bio
, i
)
1166 __free_page(bvec
->bv_page
);
1168 EXPORT_SYMBOL(bio_free_pages
);
1171 * bio_uncopy_user - finish previously mapped bio
1172 * @bio: bio being terminated
1174 * Free pages allocated from bio_copy_user_iov() and write back data
1175 * to user space in case of a read.
1177 int bio_uncopy_user(struct bio
*bio
)
1179 struct bio_map_data
*bmd
= bio
->bi_private
;
1182 if (!bio_flagged(bio
, BIO_NULL_MAPPED
)) {
1184 * if we're in a workqueue, the request is orphaned, so
1185 * don't copy into a random user address space, just free
1186 * and return -EINTR so user space doesn't expect any data.
1190 else if (bio_data_dir(bio
) == READ
)
1191 ret
= bio_copy_to_iter(bio
, bmd
->iter
);
1192 if (bmd
->is_our_pages
)
1193 bio_free_pages(bio
);
1201 * bio_copy_user_iov - copy user data to bio
1202 * @q: destination block queue
1203 * @map_data: pointer to the rq_map_data holding pages (if necessary)
1204 * @iter: iovec iterator
1205 * @gfp_mask: memory allocation flags
1207 * Prepares and returns a bio for indirect user io, bouncing data
1208 * to/from kernel pages as necessary. Must be paired with
1209 * call bio_uncopy_user() on io completion.
1211 struct bio
*bio_copy_user_iov(struct request_queue
*q
,
1212 struct rq_map_data
*map_data
,
1213 const struct iov_iter
*iter
,
1216 struct bio_map_data
*bmd
;
1221 unsigned int len
= iter
->count
;
1222 unsigned int offset
= map_data
? offset_in_page(map_data
->offset
) : 0;
1224 for (i
= 0; i
< iter
->nr_segs
; i
++) {
1225 unsigned long uaddr
;
1227 unsigned long start
;
1229 uaddr
= (unsigned long) iter
->iov
[i
].iov_base
;
1230 end
= (uaddr
+ iter
->iov
[i
].iov_len
+ PAGE_SIZE
- 1)
1232 start
= uaddr
>> PAGE_SHIFT
;
1238 return ERR_PTR(-EINVAL
);
1240 nr_pages
+= end
- start
;
1246 bmd
= bio_alloc_map_data(iter
->nr_segs
, gfp_mask
);
1248 return ERR_PTR(-ENOMEM
);
1251 * We need to do a deep copy of the iov_iter including the iovecs.
1252 * The caller provided iov might point to an on-stack or otherwise
1255 bmd
->is_our_pages
= map_data
? 0 : 1;
1256 memcpy(bmd
->iov
, iter
->iov
, sizeof(struct iovec
) * iter
->nr_segs
);
1257 iov_iter_init(&bmd
->iter
, iter
->type
, bmd
->iov
,
1258 iter
->nr_segs
, iter
->count
);
1261 bio
= bio_kmalloc(gfp_mask
, nr_pages
);
1268 nr_pages
= 1 << map_data
->page_order
;
1269 i
= map_data
->offset
/ PAGE_SIZE
;
1272 unsigned int bytes
= PAGE_SIZE
;
1280 if (i
== map_data
->nr_entries
* nr_pages
) {
1285 page
= map_data
->pages
[i
/ nr_pages
];
1286 page
+= (i
% nr_pages
);
1290 page
= alloc_page(q
->bounce_gfp
| gfp_mask
);
1297 if (bio_add_pc_page(q
, bio
, page
, bytes
, offset
) < bytes
)
1310 if (((iter
->type
& WRITE
) && (!map_data
|| !map_data
->null_mapped
)) ||
1311 (map_data
&& map_data
->from_user
)) {
1312 ret
= bio_copy_from_iter(bio
, *iter
);
1317 bio
->bi_private
= bmd
;
1321 bio_free_pages(bio
);
1325 return ERR_PTR(ret
);
1329 * bio_map_user_iov - map user iovec into bio
1330 * @q: the struct request_queue for the bio
1331 * @iter: iovec iterator
1332 * @gfp_mask: memory allocation flags
1334 * Map the user space address into a bio suitable for io to a block
1335 * device. Returns an error pointer in case of error.
1337 struct bio
*bio_map_user_iov(struct request_queue
*q
,
1338 const struct iov_iter
*iter
,
1343 struct page
**pages
;
1350 iov_for_each(iov
, i
, *iter
) {
1351 unsigned long uaddr
= (unsigned long) iov
.iov_base
;
1352 unsigned long len
= iov
.iov_len
;
1353 unsigned long end
= (uaddr
+ len
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
1354 unsigned long start
= uaddr
>> PAGE_SHIFT
;
1360 return ERR_PTR(-EINVAL
);
1362 nr_pages
+= end
- start
;
1364 * buffer must be aligned to at least logical block size for now
1366 if (uaddr
& queue_dma_alignment(q
))
1367 return ERR_PTR(-EINVAL
);
1371 return ERR_PTR(-EINVAL
);
1373 bio
= bio_kmalloc(gfp_mask
, nr_pages
);
1375 return ERR_PTR(-ENOMEM
);
1378 pages
= kcalloc(nr_pages
, sizeof(struct page
*), gfp_mask
);
1382 iov_for_each(iov
, i
, *iter
) {
1383 unsigned long uaddr
= (unsigned long) iov
.iov_base
;
1384 unsigned long len
= iov
.iov_len
;
1385 unsigned long end
= (uaddr
+ len
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
1386 unsigned long start
= uaddr
>> PAGE_SHIFT
;
1387 const int local_nr_pages
= end
- start
;
1388 const int page_limit
= cur_page
+ local_nr_pages
;
1390 ret
= get_user_pages_fast(uaddr
, local_nr_pages
,
1391 (iter
->type
& WRITE
) != WRITE
,
1393 if (ret
< local_nr_pages
) {
1398 offset
= offset_in_page(uaddr
);
1399 for (j
= cur_page
; j
< page_limit
; j
++) {
1400 unsigned int bytes
= PAGE_SIZE
- offset
;
1411 if (bio_add_pc_page(q
, bio
, pages
[j
], bytes
, offset
) <
1421 * release the pages we didn't map into the bio, if any
1423 while (j
< page_limit
)
1424 put_page(pages
[j
++]);
1429 bio_set_flag(bio
, BIO_USER_MAPPED
);
1432 * subtle -- if bio_map_user_iov() ended up bouncing a bio,
1433 * it would normally disappear when its bi_end_io is run.
1434 * however, we need it for the unmap, so grab an extra
1441 for (j
= 0; j
< nr_pages
; j
++) {
1449 return ERR_PTR(ret
);
1452 static void __bio_unmap_user(struct bio
*bio
)
1454 struct bio_vec
*bvec
;
1458 * make sure we dirty pages we wrote to
1460 bio_for_each_segment_all(bvec
, bio
, i
) {
1461 if (bio_data_dir(bio
) == READ
)
1462 set_page_dirty_lock(bvec
->bv_page
);
1464 put_page(bvec
->bv_page
);
1471 * bio_unmap_user - unmap a bio
1472 * @bio: the bio being unmapped
1474 * Unmap a bio previously mapped by bio_map_user_iov(). Must be called from
1477 * bio_unmap_user() may sleep.
1479 void bio_unmap_user(struct bio
*bio
)
1481 __bio_unmap_user(bio
);
1485 static void bio_map_kern_endio(struct bio
*bio
)
1491 * bio_map_kern - map kernel address into bio
1492 * @q: the struct request_queue for the bio
1493 * @data: pointer to buffer to map
1494 * @len: length in bytes
1495 * @gfp_mask: allocation flags for bio allocation
1497 * Map the kernel address into a bio suitable for io to a block
1498 * device. Returns an error pointer in case of error.
1500 struct bio
*bio_map_kern(struct request_queue
*q
, void *data
, unsigned int len
,
1503 unsigned long kaddr
= (unsigned long)data
;
1504 unsigned long end
= (kaddr
+ len
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
1505 unsigned long start
= kaddr
>> PAGE_SHIFT
;
1506 const int nr_pages
= end
- start
;
1510 bio
= bio_kmalloc(gfp_mask
, nr_pages
);
1512 return ERR_PTR(-ENOMEM
);
1514 offset
= offset_in_page(kaddr
);
1515 for (i
= 0; i
< nr_pages
; i
++) {
1516 unsigned int bytes
= PAGE_SIZE
- offset
;
1524 if (bio_add_pc_page(q
, bio
, virt_to_page(data
), bytes
,
1526 /* we don't support partial mappings */
1528 return ERR_PTR(-EINVAL
);
1536 bio
->bi_end_io
= bio_map_kern_endio
;
1539 EXPORT_SYMBOL(bio_map_kern
);
1541 static void bio_copy_kern_endio(struct bio
*bio
)
1543 bio_free_pages(bio
);
1547 static void bio_copy_kern_endio_read(struct bio
*bio
)
1549 char *p
= bio
->bi_private
;
1550 struct bio_vec
*bvec
;
1553 bio_for_each_segment_all(bvec
, bio
, i
) {
1554 memcpy(p
, page_address(bvec
->bv_page
), bvec
->bv_len
);
1558 bio_copy_kern_endio(bio
);
1562 * bio_copy_kern - copy kernel address into bio
1563 * @q: the struct request_queue for the bio
1564 * @data: pointer to buffer to copy
1565 * @len: length in bytes
1566 * @gfp_mask: allocation flags for bio and page allocation
1567 * @reading: data direction is READ
1569 * copy the kernel address into a bio suitable for io to a block
1570 * device. Returns an error pointer in case of error.
1572 struct bio
*bio_copy_kern(struct request_queue
*q
, void *data
, unsigned int len
,
1573 gfp_t gfp_mask
, int reading
)
1575 unsigned long kaddr
= (unsigned long)data
;
1576 unsigned long end
= (kaddr
+ len
+ PAGE_SIZE
- 1) >> PAGE_SHIFT
;
1577 unsigned long start
= kaddr
>> PAGE_SHIFT
;
1586 return ERR_PTR(-EINVAL
);
1588 nr_pages
= end
- start
;
1589 bio
= bio_kmalloc(gfp_mask
, nr_pages
);
1591 return ERR_PTR(-ENOMEM
);
1595 unsigned int bytes
= PAGE_SIZE
;
1600 page
= alloc_page(q
->bounce_gfp
| gfp_mask
);
1605 memcpy(page_address(page
), p
, bytes
);
1607 if (bio_add_pc_page(q
, bio
, page
, bytes
, 0) < bytes
)
1615 bio
->bi_end_io
= bio_copy_kern_endio_read
;
1616 bio
->bi_private
= data
;
1618 bio
->bi_end_io
= bio_copy_kern_endio
;
1624 bio_free_pages(bio
);
1626 return ERR_PTR(-ENOMEM
);
1630 * bio_set_pages_dirty() and bio_check_pages_dirty() are support functions
1631 * for performing direct-IO in BIOs.
1633 * The problem is that we cannot run set_page_dirty() from interrupt context
1634 * because the required locks are not interrupt-safe. So what we can do is to
1635 * mark the pages dirty _before_ performing IO. And in interrupt context,
1636 * check that the pages are still dirty. If so, fine. If not, redirty them
1637 * in process context.
1639 * We special-case compound pages here: normally this means reads into hugetlb
1640 * pages. The logic in here doesn't really work right for compound pages
1641 * because the VM does not uniformly chase down the head page in all cases.
1642 * But dirtiness of compound pages is pretty meaningless anyway: the VM doesn't
1643 * handle them at all. So we skip compound pages here at an early stage.
1645 * Note that this code is very hard to test under normal circumstances because
1646 * direct-io pins the pages with get_user_pages(). This makes
1647 * is_page_cache_freeable return false, and the VM will not clean the pages.
1648 * But other code (eg, flusher threads) could clean the pages if they are mapped
1651 * Simply disabling the call to bio_set_pages_dirty() is a good way to test the
1652 * deferred bio dirtying paths.
1656 * bio_set_pages_dirty() will mark all the bio's pages as dirty.
1658 void bio_set_pages_dirty(struct bio
*bio
)
1660 struct bio_vec
*bvec
;
1663 bio_for_each_segment_all(bvec
, bio
, i
) {
1664 struct page
*page
= bvec
->bv_page
;
1666 if (page
&& !PageCompound(page
))
1667 set_page_dirty_lock(page
);
1671 static void bio_release_pages(struct bio
*bio
)
1673 struct bio_vec
*bvec
;
1676 bio_for_each_segment_all(bvec
, bio
, i
) {
1677 struct page
*page
= bvec
->bv_page
;
1685 * bio_check_pages_dirty() will check that all the BIO's pages are still dirty.
1686 * If they are, then fine. If, however, some pages are clean then they must
1687 * have been written out during the direct-IO read. So we take another ref on
1688 * the BIO and the offending pages and re-dirty the pages in process context.
1690 * It is expected that bio_check_pages_dirty() will wholly own the BIO from
1691 * here on. It will run one put_page() against each page and will run one
1692 * bio_put() against the BIO.
1695 static void bio_dirty_fn(struct work_struct
*work
);
1697 static DECLARE_WORK(bio_dirty_work
, bio_dirty_fn
);
1698 static DEFINE_SPINLOCK(bio_dirty_lock
);
1699 static struct bio
*bio_dirty_list
;
1702 * This runs in process context
1704 static void bio_dirty_fn(struct work_struct
*work
)
1706 unsigned long flags
;
1709 spin_lock_irqsave(&bio_dirty_lock
, flags
);
1710 bio
= bio_dirty_list
;
1711 bio_dirty_list
= NULL
;
1712 spin_unlock_irqrestore(&bio_dirty_lock
, flags
);
1715 struct bio
*next
= bio
->bi_private
;
1717 bio_set_pages_dirty(bio
);
1718 bio_release_pages(bio
);
1724 void bio_check_pages_dirty(struct bio
*bio
)
1726 struct bio_vec
*bvec
;
1727 int nr_clean_pages
= 0;
1730 bio_for_each_segment_all(bvec
, bio
, i
) {
1731 struct page
*page
= bvec
->bv_page
;
1733 if (PageDirty(page
) || PageCompound(page
)) {
1735 bvec
->bv_page
= NULL
;
1741 if (nr_clean_pages
) {
1742 unsigned long flags
;
1744 spin_lock_irqsave(&bio_dirty_lock
, flags
);
1745 bio
->bi_private
= bio_dirty_list
;
1746 bio_dirty_list
= bio
;
1747 spin_unlock_irqrestore(&bio_dirty_lock
, flags
);
1748 schedule_work(&bio_dirty_work
);
1754 void generic_start_io_acct(int rw
, unsigned long sectors
,
1755 struct hd_struct
*part
)
1757 int cpu
= part_stat_lock();
1759 part_round_stats(cpu
, part
);
1760 part_stat_inc(cpu
, part
, ios
[rw
]);
1761 part_stat_add(cpu
, part
, sectors
[rw
], sectors
);
1762 part_inc_in_flight(part
, rw
);
1766 EXPORT_SYMBOL(generic_start_io_acct
);
1768 void generic_end_io_acct(int rw
, struct hd_struct
*part
,
1769 unsigned long start_time
)
1771 unsigned long duration
= jiffies
- start_time
;
1772 int cpu
= part_stat_lock();
1774 part_stat_add(cpu
, part
, ticks
[rw
], duration
);
1775 part_round_stats(cpu
, part
);
1776 part_dec_in_flight(part
, rw
);
1780 EXPORT_SYMBOL(generic_end_io_acct
);
1782 #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
1783 void bio_flush_dcache_pages(struct bio
*bi
)
1785 struct bio_vec bvec
;
1786 struct bvec_iter iter
;
1788 bio_for_each_segment(bvec
, bi
, iter
)
1789 flush_dcache_page(bvec
.bv_page
);
1791 EXPORT_SYMBOL(bio_flush_dcache_pages
);
1794 static inline bool bio_remaining_done(struct bio
*bio
)
1797 * If we're not chaining, then ->__bi_remaining is always 1 and
1798 * we always end io on the first invocation.
1800 if (!bio_flagged(bio
, BIO_CHAIN
))
1803 BUG_ON(atomic_read(&bio
->__bi_remaining
) <= 0);
1805 if (atomic_dec_and_test(&bio
->__bi_remaining
)) {
1806 bio_clear_flag(bio
, BIO_CHAIN
);
1814 * bio_endio - end I/O on a bio
1818 * bio_endio() will end I/O on the whole bio. bio_endio() is the preferred
1819 * way to end I/O on a bio. No one should call bi_end_io() directly on a
1820 * bio unless they own it and thus know that it has an end_io function.
1822 void bio_endio(struct bio
*bio
)
1825 if (!bio_remaining_done(bio
))
1829 * Need to have a real endio function for chained bios, otherwise
1830 * various corner cases will break (like stacking block devices that
1831 * save/restore bi_end_io) - however, we want to avoid unbounded
1832 * recursion and blowing the stack. Tail call optimization would
1833 * handle this, but compiling with frame pointers also disables
1834 * gcc's sibling call optimization.
1836 if (bio
->bi_end_io
== bio_chain_endio
) {
1837 bio
= __bio_chain_endio(bio
);
1842 bio
->bi_end_io(bio
);
1844 EXPORT_SYMBOL(bio_endio
);
1847 * bio_split - split a bio
1848 * @bio: bio to split
1849 * @sectors: number of sectors to split from the front of @bio
1851 * @bs: bio set to allocate from
1853 * Allocates and returns a new bio which represents @sectors from the start of
1854 * @bio, and updates @bio to represent the remaining sectors.
1856 * Unless this is a discard request the newly allocated bio will point
1857 * to @bio's bi_io_vec; it is the caller's responsibility to ensure that
1858 * @bio is not freed before the split.
1860 struct bio
*bio_split(struct bio
*bio
, int sectors
,
1861 gfp_t gfp
, struct bio_set
*bs
)
1863 struct bio
*split
= NULL
;
1865 BUG_ON(sectors
<= 0);
1866 BUG_ON(sectors
>= bio_sectors(bio
));
1868 split
= bio_clone_fast(bio
, gfp
, bs
);
1872 split
->bi_iter
.bi_size
= sectors
<< 9;
1874 if (bio_integrity(split
))
1875 bio_integrity_trim(split
, 0, sectors
);
1877 bio_advance(bio
, split
->bi_iter
.bi_size
);
1881 EXPORT_SYMBOL(bio_split
);
1884 * bio_trim - trim a bio
1886 * @offset: number of sectors to trim from the front of @bio
1887 * @size: size we want to trim @bio to, in sectors
1889 void bio_trim(struct bio
*bio
, int offset
, int size
)
1891 /* 'bio' is a cloned bio which we need to trim to match
1892 * the given offset and size.
1896 if (offset
== 0 && size
== bio
->bi_iter
.bi_size
)
1899 bio_clear_flag(bio
, BIO_SEG_VALID
);
1901 bio_advance(bio
, offset
<< 9);
1903 bio
->bi_iter
.bi_size
= size
;
1905 EXPORT_SYMBOL_GPL(bio_trim
);
1908 * create memory pools for biovec's in a bio_set.
1909 * use the global biovec slabs created for general use.
1911 mempool_t
*biovec_create_pool(int pool_entries
)
1913 struct biovec_slab
*bp
= bvec_slabs
+ BVEC_POOL_MAX
;
1915 return mempool_create_slab_pool(pool_entries
, bp
->slab
);
1918 void bioset_free(struct bio_set
*bs
)
1920 if (bs
->rescue_workqueue
)
1921 destroy_workqueue(bs
->rescue_workqueue
);
1924 mempool_destroy(bs
->bio_pool
);
1927 mempool_destroy(bs
->bvec_pool
);
1929 bioset_integrity_free(bs
);
1934 EXPORT_SYMBOL(bioset_free
);
1936 static struct bio_set
*__bioset_create(unsigned int pool_size
,
1937 unsigned int front_pad
,
1938 bool create_bvec_pool
)
1940 unsigned int back_pad
= BIO_INLINE_VECS
* sizeof(struct bio_vec
);
1943 bs
= kzalloc(sizeof(*bs
), GFP_KERNEL
);
1947 bs
->front_pad
= front_pad
;
1949 spin_lock_init(&bs
->rescue_lock
);
1950 bio_list_init(&bs
->rescue_list
);
1951 INIT_WORK(&bs
->rescue_work
, bio_alloc_rescue
);
1953 bs
->bio_slab
= bio_find_or_create_slab(front_pad
+ back_pad
);
1954 if (!bs
->bio_slab
) {
1959 bs
->bio_pool
= mempool_create_slab_pool(pool_size
, bs
->bio_slab
);
1963 if (create_bvec_pool
) {
1964 bs
->bvec_pool
= biovec_create_pool(pool_size
);
1969 bs
->rescue_workqueue
= alloc_workqueue("bioset", WQ_MEM_RECLAIM
, 0);
1970 if (!bs
->rescue_workqueue
)
1980 * bioset_create - Create a bio_set
1981 * @pool_size: Number of bio and bio_vecs to cache in the mempool
1982 * @front_pad: Number of bytes to allocate in front of the returned bio
1985 * Set up a bio_set to be used with @bio_alloc_bioset. Allows the caller
1986 * to ask for a number of bytes to be allocated in front of the bio.
1987 * Front pad allocation is useful for embedding the bio inside
1988 * another structure, to avoid allocating extra data to go with the bio.
1989 * Note that the bio must be embedded at the END of that structure always,
1990 * or things will break badly.
1992 struct bio_set
*bioset_create(unsigned int pool_size
, unsigned int front_pad
)
1994 return __bioset_create(pool_size
, front_pad
, true);
1996 EXPORT_SYMBOL(bioset_create
);
1999 * bioset_create_nobvec - Create a bio_set without bio_vec mempool
2000 * @pool_size: Number of bio to cache in the mempool
2001 * @front_pad: Number of bytes to allocate in front of the returned bio
2004 * Same functionality as bioset_create() except that mempool is not
2005 * created for bio_vecs. Saving some memory for bio_clone_fast() users.
2007 struct bio_set
*bioset_create_nobvec(unsigned int pool_size
, unsigned int front_pad
)
2009 return __bioset_create(pool_size
, front_pad
, false);
2011 EXPORT_SYMBOL(bioset_create_nobvec
);
2013 #ifdef CONFIG_BLK_CGROUP
2016 * bio_associate_blkcg - associate a bio with the specified blkcg
2018 * @blkcg_css: css of the blkcg to associate
2020 * Associate @bio with the blkcg specified by @blkcg_css. Block layer will
2021 * treat @bio as if it were issued by a task which belongs to the blkcg.
2023 * This function takes an extra reference of @blkcg_css which will be put
2024 * when @bio is released. The caller must own @bio and is responsible for
2025 * synchronizing calls to this function.
2027 int bio_associate_blkcg(struct bio
*bio
, struct cgroup_subsys_state
*blkcg_css
)
2029 if (unlikely(bio
->bi_css
))
2032 bio
->bi_css
= blkcg_css
;
2035 EXPORT_SYMBOL_GPL(bio_associate_blkcg
);
2038 * bio_associate_current - associate a bio with %current
2041 * Associate @bio with %current if it hasn't been associated yet. Block
2042 * layer will treat @bio as if it were issued by %current no matter which
2043 * task actually issues it.
2045 * This function takes an extra reference of @task's io_context and blkcg
2046 * which will be put when @bio is released. The caller must own @bio,
2047 * ensure %current->io_context exists, and is responsible for synchronizing
2048 * calls to this function.
2050 int bio_associate_current(struct bio
*bio
)
2052 struct io_context
*ioc
;
2057 ioc
= current
->io_context
;
2061 get_io_context_active(ioc
);
2063 bio
->bi_css
= task_get_css(current
, io_cgrp_id
);
2066 EXPORT_SYMBOL_GPL(bio_associate_current
);
2069 * bio_disassociate_task - undo bio_associate_current()
2072 void bio_disassociate_task(struct bio
*bio
)
2075 put_io_context(bio
->bi_ioc
);
2079 css_put(bio
->bi_css
);
2085 * bio_clone_blkcg_association - clone blkcg association from src to dst bio
2086 * @dst: destination bio
2089 void bio_clone_blkcg_association(struct bio
*dst
, struct bio
*src
)
2092 WARN_ON(bio_associate_blkcg(dst
, src
->bi_css
));
2095 #endif /* CONFIG_BLK_CGROUP */
2097 static void __init
biovec_init_slabs(void)
2101 for (i
= 0; i
< BVEC_POOL_NR
; i
++) {
2103 struct biovec_slab
*bvs
= bvec_slabs
+ i
;
2105 if (bvs
->nr_vecs
<= BIO_INLINE_VECS
) {
2110 size
= bvs
->nr_vecs
* sizeof(struct bio_vec
);
2111 bvs
->slab
= kmem_cache_create(bvs
->name
, size
, 0,
2112 SLAB_HWCACHE_ALIGN
|SLAB_PANIC
, NULL
);
2116 static int __init
init_bio(void)
2120 bio_slabs
= kzalloc(bio_slab_max
* sizeof(struct bio_slab
), GFP_KERNEL
);
2122 panic("bio: can't allocate bios\n");
2124 bio_integrity_init();
2125 biovec_init_slabs();
2127 fs_bio_set
= bioset_create(BIO_POOL_SIZE
, 0);
2129 panic("bio: can't allocate bios\n");
2131 if (bioset_integrity_create(fs_bio_set
, BIO_POOL_SIZE
))
2132 panic("bio: can't create integrity pool\n");
2136 subsys_initcall(init_bio
);