blob: bba5508269219a0726ede9f97cc3d22afa97f213 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * 2.5 block I/O model
3 *
4 * Copyright (C) 2001 Jens Axboe <axboe@suse.de>
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 as
8 * published by the Free Software Foundation.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Tejun Heo7cc01582010-08-03 13:14:58 +020012 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070013 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public Licens
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-
19 */
20#ifndef __LINUX_BIO_H
21#define __LINUX_BIO_H
22
23#include <linux/highmem.h>
24#include <linux/mempool.h>
Jens Axboe22e2c502005-06-27 10:55:12 +020025#include <linux/ioprio.h>
Paul Gortmaker187f1882011-11-23 20:12:59 -050026#include <linux/bug.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070027
David Howells02a5e0a2007-08-11 22:34:32 +020028#ifdef CONFIG_BLOCK
29
Linus Torvalds1da177e2005-04-16 15:20:36 -070030#include <asm/io.h>
31
Tejun Heo7cc01582010-08-03 13:14:58 +020032/* struct bio, bio_vec and BIO_* flags are defined in blk_types.h */
33#include <linux/blk_types.h>
34
Linus Torvalds1da177e2005-04-16 15:20:36 -070035#define BIO_DEBUG
36
37#ifdef BIO_DEBUG
38#define BIO_BUG_ON BUG_ON
39#else
40#define BIO_BUG_ON
41#endif
42
Alexey Dobriyand84a8472006-06-25 05:49:32 -070043#define BIO_MAX_PAGES 256
Linus Torvalds1da177e2005-04-16 15:20:36 -070044#define BIO_MAX_SIZE (BIO_MAX_PAGES << PAGE_CACHE_SHIFT)
45#define BIO_MAX_SECTORS (BIO_MAX_SIZE >> 9)
46
47/*
Jens Axboe22e2c502005-06-27 10:55:12 +020048 * upper 16 bits of bi_rw define the io priority of this bio
49 */
50#define BIO_PRIO_SHIFT (8 * sizeof(unsigned long) - IOPRIO_BITS)
51#define bio_prio(bio) ((bio)->bi_rw >> BIO_PRIO_SHIFT)
52#define bio_prio_valid(bio) ioprio_valid(bio_prio(bio))
53
54#define bio_set_prio(bio, prio) do { \
55 WARN_ON(prio >= (1 << IOPRIO_BITS)); \
56 (bio)->bi_rw &= ((1UL << BIO_PRIO_SHIFT) - 1); \
57 (bio)->bi_rw |= ((unsigned long) (prio) << BIO_PRIO_SHIFT); \
58} while (0)
59
60/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070061 * various member access, note that bio_data should of course not be used
62 * on highmem page vectors
63 */
Kent Overstreet4550dd62013-08-07 14:26:21 -070064#define __bvec_iter_bvec(bvec, iter) (&(bvec)[(iter).bi_idx])
Kent Overstreeta4ad39b12013-08-07 14:24:32 -070065
Kent Overstreet4550dd62013-08-07 14:26:21 -070066#define bvec_iter_page(bvec, iter) \
67 (__bvec_iter_bvec((bvec), (iter))->bv_page)
68
69#define bvec_iter_len(bvec, iter) \
70 min((iter).bi_size, \
71 __bvec_iter_bvec((bvec), (iter))->bv_len - (iter).bi_bvec_done)
72
73#define bvec_iter_offset(bvec, iter) \
74 (__bvec_iter_bvec((bvec), (iter))->bv_offset + (iter).bi_bvec_done)
75
76#define bvec_iter_bvec(bvec, iter) \
77((struct bio_vec) { \
78 .bv_page = bvec_iter_page((bvec), (iter)), \
79 .bv_len = bvec_iter_len((bvec), (iter)), \
80 .bv_offset = bvec_iter_offset((bvec), (iter)), \
81})
82
83#define bio_iter_iovec(bio, iter) \
84 bvec_iter_bvec((bio)->bi_io_vec, (iter))
85
86#define bio_iter_page(bio, iter) \
87 bvec_iter_page((bio)->bi_io_vec, (iter))
88#define bio_iter_len(bio, iter) \
89 bvec_iter_len((bio)->bi_io_vec, (iter))
90#define bio_iter_offset(bio, iter) \
91 bvec_iter_offset((bio)->bi_io_vec, (iter))
92
93#define bio_page(bio) bio_iter_page((bio), (bio)->bi_iter)
94#define bio_offset(bio) bio_iter_offset((bio), (bio)->bi_iter)
95#define bio_iovec(bio) bio_iter_iovec((bio), (bio)->bi_iter)
Kent Overstreet79886132013-11-23 17:19:00 -080096
Kent Overstreet458b76e2013-09-24 16:26:05 -070097#define bio_multiple_segments(bio) \
98 ((bio)->bi_iter.bi_size != bio_iovec(bio).bv_len)
Kent Overstreet4f024f32013-10-11 15:44:27 -070099#define bio_sectors(bio) ((bio)->bi_iter.bi_size >> 9)
100#define bio_end_sector(bio) ((bio)->bi_iter.bi_sector + bio_sectors((bio)))
Jens Axboebf2de6f2007-09-27 13:01:25 +0200101
Kent Overstreet458b76e2013-09-24 16:26:05 -0700102/*
103 * Check whether this bio carries any data or not. A NULL bio is allowed.
104 */
105static inline bool bio_has_data(struct bio *bio)
106{
107 if (bio &&
108 bio->bi_iter.bi_size &&
109 !(bio->bi_rw & REQ_DISCARD))
110 return true;
111
112 return false;
113}
114
115static inline bool bio_is_rw(struct bio *bio)
116{
117 if (!bio_has_data(bio))
118 return false;
119
120 if (bio->bi_rw & BIO_NO_ADVANCE_ITER_MASK)
121 return false;
122
123 return true;
124}
125
126static inline bool bio_mergeable(struct bio *bio)
127{
128 if (bio->bi_rw & REQ_NOMERGE_FLAGS)
129 return false;
130
131 return true;
132}
133
Tejun Heo2e46e8b2009-05-07 22:24:41 +0900134static inline unsigned int bio_cur_bytes(struct bio *bio)
Jens Axboebf2de6f2007-09-27 13:01:25 +0200135{
Kent Overstreet458b76e2013-09-24 16:26:05 -0700136 if (bio_has_data(bio))
Kent Overstreeta4ad39b12013-08-07 14:24:32 -0700137 return bio_iovec(bio).bv_len;
David Woodhousefb2dce82008-08-05 18:01:53 +0100138 else /* dataless requests such as discard */
Kent Overstreet4f024f32013-10-11 15:44:27 -0700139 return bio->bi_iter.bi_size;
Jens Axboebf2de6f2007-09-27 13:01:25 +0200140}
141
142static inline void *bio_data(struct bio *bio)
143{
Kent Overstreet458b76e2013-09-24 16:26:05 -0700144 if (bio_has_data(bio))
Jens Axboebf2de6f2007-09-27 13:01:25 +0200145 return page_address(bio_page(bio)) + bio_offset(bio);
146
147 return NULL;
148}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149
150/*
151 * will die
152 */
153#define bio_to_phys(bio) (page_to_phys(bio_page((bio))) + (unsigned long) bio_offset((bio)))
154#define bvec_to_phys(bv) (page_to_phys((bv)->bv_page) + (unsigned long) (bv)->bv_offset)
155
156/*
157 * queues that have highmem support enabled may still need to revert to
158 * PIO transfers occasionally and thus map high pages temporarily. For
159 * permanent PIO fall back, user is probably better off disabling highmem
160 * I/O completely on that queue (see ide-dma for example)
161 */
Kent Overstreetf619d252013-08-07 14:30:33 -0700162#define __bio_kmap_atomic(bio, iter) \
163 (kmap_atomic(bio_iter_iovec((bio), (iter)).bv_page) + \
164 bio_iter_iovec((bio), (iter)).bv_offset)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165
Kent Overstreetf619d252013-08-07 14:30:33 -0700166#define __bio_kunmap_atomic(addr) kunmap_atomic(addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167
168/*
169 * merge helpers etc
170 */
171
Jeremy Fitzhardingef92131c2008-10-29 14:10:51 +0100172/* Default implementation of BIOVEC_PHYS_MERGEABLE */
173#define __BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
174 ((bvec_to_phys((vec1)) + (vec1)->bv_len) == bvec_to_phys((vec2)))
175
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176/*
177 * allow arch override, for eg virtualized architectures (put in asm/io.h)
178 */
179#ifndef BIOVEC_PHYS_MERGEABLE
180#define BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
Jeremy Fitzhardingef92131c2008-10-29 14:10:51 +0100181 __BIOVEC_PHYS_MERGEABLE(vec1, vec2)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182#endif
183
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184#define __BIO_SEG_BOUNDARY(addr1, addr2, mask) \
185 (((addr1) | (mask)) == (((addr2) - 1) | (mask)))
186#define BIOVEC_SEG_BOUNDARY(q, b1, b2) \
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400187 __BIO_SEG_BOUNDARY(bvec_to_phys((b1)), bvec_to_phys((b2)) + (b2)->bv_len, queue_segment_boundary((q)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188
NeilBrown6712ecf2007-09-27 12:47:43 +0200189#define bio_io_error(bio) bio_endio((bio), -EIO)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190
191/*
Kent Overstreetd74c6d52013-02-06 12:23:11 -0800192 * drivers should _never_ use the all version - the bio may have been split
193 * before it got to the driver and the driver won't own all of it
194 */
195#define bio_for_each_segment_all(bvl, bio, i) \
Kent Overstreetf619d252013-08-07 14:30:33 -0700196 for (i = 0, bvl = (bio)->bi_io_vec; i < (bio)->bi_vcnt; i++, bvl++)
Kent Overstreetd74c6d52013-02-06 12:23:11 -0800197
Kent Overstreet4550dd62013-08-07 14:26:21 -0700198static inline void bvec_iter_advance(struct bio_vec *bv, struct bvec_iter *iter,
199 unsigned bytes)
200{
201 WARN_ONCE(bytes > iter->bi_size,
202 "Attempted to advance past end of bvec iter\n");
203
204 while (bytes) {
205 unsigned len = min(bytes, bvec_iter_len(bv, *iter));
206
207 bytes -= len;
208 iter->bi_size -= len;
209 iter->bi_bvec_done += len;
210
211 if (iter->bi_bvec_done == __bvec_iter_bvec(bv, *iter)->bv_len) {
212 iter->bi_bvec_done = 0;
213 iter->bi_idx++;
214 }
215 }
216}
217
218#define for_each_bvec(bvl, bio_vec, iter, start) \
Martin K. Petersenb7aa84d2014-04-08 22:43:43 -0400219 for (iter = (start); \
220 (iter).bi_size && \
221 ((bvl = bvec_iter_bvec((bio_vec), (iter))), 1); \
Kent Overstreet4550dd62013-08-07 14:26:21 -0700222 bvec_iter_advance((bio_vec), &(iter), (bvl).bv_len))
223
224
225static inline void bio_advance_iter(struct bio *bio, struct bvec_iter *iter,
226 unsigned bytes)
227{
228 iter->bi_sector += bytes >> 9;
229
230 if (bio->bi_rw & BIO_NO_ADVANCE_ITER_MASK)
231 iter->bi_size -= bytes;
232 else
233 bvec_iter_advance(bio->bi_io_vec, iter, bytes);
234}
235
Kent Overstreet79886132013-11-23 17:19:00 -0800236#define __bio_for_each_segment(bvl, bio, iter, start) \
237 for (iter = (start); \
Kent Overstreet4550dd62013-08-07 14:26:21 -0700238 (iter).bi_size && \
239 ((bvl = bio_iter_iovec((bio), (iter))), 1); \
240 bio_advance_iter((bio), &(iter), (bvl).bv_len))
Kent Overstreet79886132013-11-23 17:19:00 -0800241
242#define bio_for_each_segment(bvl, bio, iter) \
243 __bio_for_each_segment(bvl, bio, iter, (bio)->bi_iter)
244
Kent Overstreet4550dd62013-08-07 14:26:21 -0700245#define bio_iter_last(bvec, iter) ((iter).bi_size == (bvec).bv_len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246
Kent Overstreet458b76e2013-09-24 16:26:05 -0700247static inline unsigned bio_segments(struct bio *bio)
248{
249 unsigned segs = 0;
250 struct bio_vec bv;
251 struct bvec_iter iter;
252
Kent Overstreet8423ae32014-02-10 17:45:50 -0800253 /*
254 * We special case discard/write same, because they interpret bi_size
255 * differently:
256 */
257
258 if (bio->bi_rw & REQ_DISCARD)
259 return 1;
260
261 if (bio->bi_rw & REQ_WRITE_SAME)
262 return 1;
263
Kent Overstreet458b76e2013-09-24 16:26:05 -0700264 bio_for_each_segment(bv, bio, iter)
265 segs++;
266
267 return segs;
268}
269
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270/*
271 * get a reference to a bio, so it won't disappear. the intended use is
272 * something like:
273 *
274 * bio_get(bio);
275 * submit_bio(rw, bio);
276 * if (bio->bi_flags ...)
277 * do_something
278 * bio_put(bio);
279 *
280 * without the bio_get(), it could potentially complete I/O before submit_bio
281 * returns. and then bio would be freed memory when if (bio->bi_flags ...)
282 * runs
283 */
284#define bio_get(bio) atomic_inc(&(bio)->bi_cnt)
285
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200286#if defined(CONFIG_BLK_DEV_INTEGRITY)
287/*
288 * bio integrity payload
289 */
290struct bio_integrity_payload {
291 struct bio *bip_bio; /* parent bio */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200292
Kent Overstreetd57a5f72013-11-23 17:20:16 -0800293 struct bvec_iter bip_iter;
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200294
Kent Overstreetd57a5f72013-11-23 17:20:16 -0800295 /* kill - should just use bip_vec */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200296 void *bip_buf; /* generated integrity data */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200297
Kent Overstreetd57a5f72013-11-23 17:20:16 -0800298 bio_end_io_t *bip_end_io; /* saved I/O completion fn */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200299
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200300 unsigned short bip_slab; /* slab the bip came from */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200301 unsigned short bip_vcnt; /* # of integrity bio_vecs */
Kent Overstreet29ed7812012-09-04 09:54:22 -0700302 unsigned bip_owns_buf:1; /* should free bip_buf */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200303
304 struct work_struct bip_work; /* I/O completion */
Kent Overstreet6fda9812012-10-12 13:18:27 -0700305
306 struct bio_vec *bip_vec;
307 struct bio_vec bip_inline_vecs[0];/* embedded bvec array */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200308};
309#endif /* CONFIG_BLK_DEV_INTEGRITY */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310
Kent Overstreet6678d832013-08-07 11:14:32 -0700311extern void bio_trim(struct bio *bio, int offset, int size);
Kent Overstreet20d01892013-11-23 18:21:01 -0800312extern struct bio *bio_split(struct bio *bio, int sectors,
313 gfp_t gfp, struct bio_set *bs);
314
315/**
316 * bio_next_split - get next @sectors from a bio, splitting if necessary
317 * @bio: bio to split
318 * @sectors: number of sectors to split from the front of @bio
319 * @gfp: gfp mask
320 * @bs: bio set to allocate from
321 *
322 * Returns a bio representing the next @sectors of @bio - if the bio is smaller
323 * than @sectors, returns the original bio unchanged.
324 */
325static inline struct bio *bio_next_split(struct bio *bio, int sectors,
326 gfp_t gfp, struct bio_set *bs)
327{
328 if (sectors >= bio_sectors(bio))
329 return bio;
330
331 return bio_split(bio, sectors, gfp, bs);
332}
333
Jens Axboebb799ca2008-12-10 15:35:05 +0100334extern struct bio_set *bioset_create(unsigned int, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335extern void bioset_free(struct bio_set *);
Kent Overstreet9f060e22012-10-12 15:29:33 -0700336extern mempool_t *biovec_create_pool(struct bio_set *bs, int pool_entries);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700337
Al Virodd0fc662005-10-07 07:46:04 +0100338extern struct bio *bio_alloc_bioset(gfp_t, int, struct bio_set *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339extern void bio_put(struct bio *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340
Kent Overstreet59d276f2013-11-23 18:19:27 -0800341extern void __bio_clone_fast(struct bio *, struct bio *);
342extern struct bio *bio_clone_fast(struct bio *, gfp_t, struct bio_set *);
Kent Overstreetbf800ef2012-09-06 15:35:02 -0700343extern struct bio *bio_clone_bioset(struct bio *, gfp_t, struct bio_set *bs);
344
Kent Overstreet3f86a822012-09-06 15:35:01 -0700345extern struct bio_set *fs_bio_set;
Rashika Kheriac4540a72014-02-09 18:30:39 +0530346unsigned int bio_integrity_tag_size(struct bio *bio);
Kent Overstreet3f86a822012-09-06 15:35:01 -0700347
348static inline struct bio *bio_alloc(gfp_t gfp_mask, unsigned int nr_iovecs)
349{
350 return bio_alloc_bioset(gfp_mask, nr_iovecs, fs_bio_set);
351}
352
Kent Overstreetbf800ef2012-09-06 15:35:02 -0700353static inline struct bio *bio_clone(struct bio *bio, gfp_t gfp_mask)
354{
355 return bio_clone_bioset(bio, gfp_mask, fs_bio_set);
356}
357
Kent Overstreet3f86a822012-09-06 15:35:01 -0700358static inline struct bio *bio_kmalloc(gfp_t gfp_mask, unsigned int nr_iovecs)
359{
360 return bio_alloc_bioset(gfp_mask, nr_iovecs, NULL);
361}
362
Kent Overstreetbf800ef2012-09-06 15:35:02 -0700363static inline struct bio *bio_clone_kmalloc(struct bio *bio, gfp_t gfp_mask)
364{
365 return bio_clone_bioset(bio, gfp_mask, NULL);
366
367}
368
NeilBrown6712ecf2007-09-27 12:47:43 +0200369extern void bio_endio(struct bio *, int);
Kent Overstreet196d38b2013-11-23 18:34:15 -0800370extern void bio_endio_nodec(struct bio *, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371struct request_queue;
372extern int bio_phys_segments(struct request_queue *, struct bio *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700373
Kent Overstreet9e882242012-09-10 14:41:12 -0700374extern int submit_bio_wait(int rw, struct bio *bio);
Kent Overstreet054bdf62012-09-28 13:17:55 -0700375extern void bio_advance(struct bio *, unsigned);
376
Linus Torvalds1da177e2005-04-16 15:20:36 -0700377extern void bio_init(struct bio *);
Kent Overstreetf44b48c2012-09-06 15:34:58 -0700378extern void bio_reset(struct bio *);
Kent Overstreet196d38b2013-11-23 18:34:15 -0800379void bio_chain(struct bio *, struct bio *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700380
381extern int bio_add_page(struct bio *, struct page *, unsigned int,unsigned int);
Mike Christie6e68af62005-11-11 05:30:27 -0600382extern int bio_add_pc_page(struct request_queue *, struct bio *, struct page *,
383 unsigned int, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384extern int bio_get_nr_vecs(struct block_device *);
385extern struct bio *bio_map_user(struct request_queue *, struct block_device *,
FUJITA Tomonoria3bce902008-08-28 16:17:05 +0900386 unsigned long, unsigned int, int, gfp_t);
James Bottomley f1970ba2005-06-20 14:06:52 +0200387struct sg_iovec;
FUJITA Tomonori152e2832008-08-28 16:17:06 +0900388struct rq_map_data;
James Bottomley f1970ba2005-06-20 14:06:52 +0200389extern struct bio *bio_map_user_iov(struct request_queue *,
390 struct block_device *,
Al Viro86d564c2014-02-08 20:42:52 -0500391 const struct sg_iovec *, int, int, gfp_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392extern void bio_unmap_user(struct bio *);
Mike Christie df46b9a2005-06-20 14:04:44 +0200393extern struct bio *bio_map_kern(struct request_queue *, void *, unsigned int,
Al Viro27496a82005-10-21 03:20:48 -0400394 gfp_t);
FUJITA Tomonori68154e92008-04-25 12:47:50 +0200395extern struct bio *bio_copy_kern(struct request_queue *, void *, unsigned int,
396 gfp_t, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700397extern void bio_set_pages_dirty(struct bio *bio);
398extern void bio_check_pages_dirty(struct bio *bio);
Ilya Loginov2d4dc892009-11-26 09:16:19 +0100399
400#ifndef ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
401# error "You should define ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE for your platform"
402#endif
403#if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
404extern void bio_flush_dcache_pages(struct bio *bi);
405#else
406static inline void bio_flush_dcache_pages(struct bio *bi)
407{
408}
409#endif
410
Kent Overstreet16ac3d62012-09-10 13:57:51 -0700411extern void bio_copy_data(struct bio *dst, struct bio *src);
Kent Overstreeta0787602012-09-10 14:03:28 -0700412extern int bio_alloc_pages(struct bio *bio, gfp_t gfp);
Kent Overstreet16ac3d62012-09-10 13:57:51 -0700413
FUJITA Tomonori152e2832008-08-28 16:17:06 +0900414extern struct bio *bio_copy_user(struct request_queue *, struct rq_map_data *,
415 unsigned long, unsigned int, int, gfp_t);
416extern struct bio *bio_copy_user_iov(struct request_queue *,
Al Viro86d564c2014-02-08 20:42:52 -0500417 struct rq_map_data *,
418 const struct sg_iovec *,
FUJITA Tomonoria3bce902008-08-28 16:17:05 +0900419 int, int, gfp_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700420extern int bio_uncopy_user(struct bio *);
421void zero_fill_bio(struct bio *bio);
Kent Overstreet9f060e22012-10-12 15:29:33 -0700422extern struct bio_vec *bvec_alloc(gfp_t, int, unsigned long *, mempool_t *);
423extern void bvec_free(mempool_t *, struct bio_vec *, unsigned int);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200424extern unsigned int bvec_nr_vecs(unsigned short idx);
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200425
Tejun Heo852c7882012-03-05 13:15:27 -0800426#ifdef CONFIG_BLK_CGROUP
427int bio_associate_current(struct bio *bio);
428void bio_disassociate_task(struct bio *bio);
429#else /* CONFIG_BLK_CGROUP */
430static inline int bio_associate_current(struct bio *bio) { return -ENOENT; }
431static inline void bio_disassociate_task(struct bio *bio) { }
432#endif /* CONFIG_BLK_CGROUP */
433
Linus Torvalds1da177e2005-04-16 15:20:36 -0700434#ifdef CONFIG_HIGHMEM
435/*
Alberto Bertogli20b636b2009-02-02 12:41:07 +0100436 * remember never ever reenable interrupts between a bvec_kmap_irq and
437 * bvec_kunmap_irq!
Linus Torvalds1da177e2005-04-16 15:20:36 -0700438 */
Alberto Bertogli4f570f92009-11-02 11:40:16 +0100439static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700440{
441 unsigned long addr;
442
443 /*
444 * might not be a highmem page, but the preempt/irq count
445 * balancing is a lot nicer this way
446 */
447 local_irq_save(*flags);
Cong Wange8e3c3d2011-11-25 23:14:27 +0800448 addr = (unsigned long) kmap_atomic(bvec->bv_page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449
450 BUG_ON(addr & ~PAGE_MASK);
451
452 return (char *) addr + bvec->bv_offset;
453}
454
Alberto Bertogli4f570f92009-11-02 11:40:16 +0100455static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700456{
457 unsigned long ptr = (unsigned long) buffer & PAGE_MASK;
458
Cong Wange8e3c3d2011-11-25 23:14:27 +0800459 kunmap_atomic((void *) ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460 local_irq_restore(*flags);
461}
462
463#else
Geert Uytterhoeven11a691b2010-10-21 10:32:29 +0200464static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
465{
466 return page_address(bvec->bv_page) + bvec->bv_offset;
467}
468
469static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
470{
471 *flags = 0;
472}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700473#endif
474
Kent Overstreetf619d252013-08-07 14:30:33 -0700475static inline char *__bio_kmap_irq(struct bio *bio, struct bvec_iter iter,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476 unsigned long *flags)
477{
Kent Overstreetf619d252013-08-07 14:30:33 -0700478 return bvec_kmap_irq(&bio_iter_iovec(bio, iter), flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700479}
480#define __bio_kunmap_irq(buf, flags) bvec_kunmap_irq(buf, flags)
481
482#define bio_kmap_irq(bio, flags) \
Kent Overstreetf619d252013-08-07 14:30:33 -0700483 __bio_kmap_irq((bio), (bio)->bi_iter, (flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484#define bio_kunmap_irq(buf,flags) __bio_kunmap_irq(buf, flags)
485
Jens Axboe7a67f632008-08-08 11:17:12 +0200486/*
Akinobu Mitae6863072009-04-17 08:41:21 +0200487 * BIO list management for use by remapping drivers (e.g. DM or MD) and loop.
Christoph Hellwig8f3d8ba2009-04-07 19:55:13 +0200488 *
489 * A bio_list anchors a singly-linked list of bios chained through the bi_next
490 * member of the bio. The bio_list also caches the last list member to allow
491 * fast access to the tail.
492 */
493struct bio_list {
494 struct bio *head;
495 struct bio *tail;
496};
497
498static inline int bio_list_empty(const struct bio_list *bl)
499{
500 return bl->head == NULL;
501}
502
503static inline void bio_list_init(struct bio_list *bl)
504{
505 bl->head = bl->tail = NULL;
506}
507
Jens Axboe320ae512013-10-24 09:20:05 +0100508#define BIO_EMPTY_LIST { NULL, NULL }
509
Christoph Hellwig8f3d8ba2009-04-07 19:55:13 +0200510#define bio_list_for_each(bio, bl) \
511 for (bio = (bl)->head; bio; bio = bio->bi_next)
512
513static inline unsigned bio_list_size(const struct bio_list *bl)
514{
515 unsigned sz = 0;
516 struct bio *bio;
517
518 bio_list_for_each(bio, bl)
519 sz++;
520
521 return sz;
522}
523
524static inline void bio_list_add(struct bio_list *bl, struct bio *bio)
525{
526 bio->bi_next = NULL;
527
528 if (bl->tail)
529 bl->tail->bi_next = bio;
530 else
531 bl->head = bio;
532
533 bl->tail = bio;
534}
535
536static inline void bio_list_add_head(struct bio_list *bl, struct bio *bio)
537{
538 bio->bi_next = bl->head;
539
540 bl->head = bio;
541
542 if (!bl->tail)
543 bl->tail = bio;
544}
545
546static inline void bio_list_merge(struct bio_list *bl, struct bio_list *bl2)
547{
548 if (!bl2->head)
549 return;
550
551 if (bl->tail)
552 bl->tail->bi_next = bl2->head;
553 else
554 bl->head = bl2->head;
555
556 bl->tail = bl2->tail;
557}
558
559static inline void bio_list_merge_head(struct bio_list *bl,
560 struct bio_list *bl2)
561{
562 if (!bl2->head)
563 return;
564
565 if (bl->head)
566 bl2->tail->bi_next = bl->head;
567 else
568 bl->tail = bl2->tail;
569
570 bl->head = bl2->head;
571}
572
Geert Uytterhoeven13685a12009-06-10 04:38:40 +0000573static inline struct bio *bio_list_peek(struct bio_list *bl)
574{
575 return bl->head;
576}
577
Christoph Hellwig8f3d8ba2009-04-07 19:55:13 +0200578static inline struct bio *bio_list_pop(struct bio_list *bl)
579{
580 struct bio *bio = bl->head;
581
582 if (bio) {
583 bl->head = bl->head->bi_next;
584 if (!bl->head)
585 bl->tail = NULL;
586
587 bio->bi_next = NULL;
588 }
589
590 return bio;
591}
592
593static inline struct bio *bio_list_get(struct bio_list *bl)
594{
595 struct bio *bio = bl->head;
596
597 bl->head = bl->tail = NULL;
598
599 return bio;
600}
601
Kent Overstreet57fb2332012-08-24 04:56:11 -0700602/*
603 * bio_set is used to allow other portions of the IO system to
604 * allocate their own private memory pools for bio and iovec structures.
605 * These memory pools in turn all allocate from the bio_slab
606 * and the bvec_slabs[].
607 */
608#define BIO_POOL_SIZE 2
609#define BIOVEC_NR_POOLS 6
610#define BIOVEC_MAX_IDX (BIOVEC_NR_POOLS - 1)
611
612struct bio_set {
613 struct kmem_cache *bio_slab;
614 unsigned int front_pad;
615
616 mempool_t *bio_pool;
Kent Overstreet9f060e22012-10-12 15:29:33 -0700617 mempool_t *bvec_pool;
Kent Overstreet57fb2332012-08-24 04:56:11 -0700618#if defined(CONFIG_BLK_DEV_INTEGRITY)
619 mempool_t *bio_integrity_pool;
Kent Overstreet9f060e22012-10-12 15:29:33 -0700620 mempool_t *bvec_integrity_pool;
Kent Overstreet57fb2332012-08-24 04:56:11 -0700621#endif
Kent Overstreetdf2cb6d2012-09-10 14:33:46 -0700622
623 /*
624 * Deadlock avoidance for stacking block drivers: see comments in
625 * bio_alloc_bioset() for details
626 */
627 spinlock_t rescue_lock;
628 struct bio_list rescue_list;
629 struct work_struct rescue_work;
630 struct workqueue_struct *rescue_workqueue;
Kent Overstreet57fb2332012-08-24 04:56:11 -0700631};
632
633struct biovec_slab {
634 int nr_vecs;
635 char *name;
636 struct kmem_cache *slab;
637};
638
639/*
640 * a small number of entries is fine, not going to be performance critical.
641 * basically we just need to survive
642 */
643#define BIO_SPLIT_ENTRIES 2
644
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200645#if defined(CONFIG_BLK_DEV_INTEGRITY)
646
Kent Overstreetd57a5f72013-11-23 17:20:16 -0800647
648
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200649#define bip_vec_idx(bip, idx) (&(bip->bip_vec[(idx)]))
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200650
Kent Overstreetd57a5f72013-11-23 17:20:16 -0800651#define bip_for_each_vec(bvl, bip, iter) \
652 for_each_bvec(bvl, (bip)->bip_vec, iter, (bip)->bip_iter)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200653
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200654#define bio_for_each_integrity_vec(_bvl, _bio, _iter) \
655 for_each_bio(_bio) \
656 bip_for_each_vec(_bvl, _bio->bi_integrity, _iter)
657
Alberto Bertogli8deaf722008-10-02 12:46:53 +0200658#define bio_integrity(bio) (bio->bi_integrity != NULL)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200659
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200660extern struct bio_integrity_payload *bio_integrity_alloc(struct bio *, gfp_t, unsigned int);
Kent Overstreet1e2a410f2012-09-06 15:34:56 -0700661extern void bio_integrity_free(struct bio *);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200662extern int bio_integrity_add_page(struct bio *, struct page *, unsigned int, unsigned int);
663extern int bio_integrity_enabled(struct bio *bio);
664extern int bio_integrity_set_tag(struct bio *, void *, unsigned int);
665extern int bio_integrity_get_tag(struct bio *, void *, unsigned int);
666extern int bio_integrity_prep(struct bio *);
667extern void bio_integrity_endio(struct bio *, int);
668extern void bio_integrity_advance(struct bio *, unsigned int);
669extern void bio_integrity_trim(struct bio *, unsigned int, unsigned int);
Kent Overstreet1e2a410f2012-09-06 15:34:56 -0700670extern int bio_integrity_clone(struct bio *, struct bio *, gfp_t);
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200671extern int bioset_integrity_create(struct bio_set *, int);
672extern void bioset_integrity_free(struct bio_set *);
673extern void bio_integrity_init(void);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200674
675#else /* CONFIG_BLK_DEV_INTEGRITY */
676
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100677static inline int bio_integrity(struct bio *bio)
678{
679 return 0;
680}
681
682static inline int bio_integrity_enabled(struct bio *bio)
683{
684 return 0;
685}
686
687static inline int bioset_integrity_create(struct bio_set *bs, int pool_size)
688{
689 return 0;
690}
691
692static inline void bioset_integrity_free (struct bio_set *bs)
693{
694 return;
695}
696
697static inline int bio_integrity_prep(struct bio *bio)
698{
699 return 0;
700}
701
Kent Overstreet1e2a410f2012-09-06 15:34:56 -0700702static inline void bio_integrity_free(struct bio *bio)
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100703{
704 return;
705}
706
Stephen Rothwell0c614e22011-11-16 09:21:48 +0100707static inline int bio_integrity_clone(struct bio *bio, struct bio *bio_src,
Kent Overstreet1e2a410f2012-09-06 15:34:56 -0700708 gfp_t gfp_mask)
Stephen Rothwell0c614e22011-11-16 09:21:48 +0100709{
710 return 0;
711}
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100712
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100713static inline void bio_integrity_advance(struct bio *bio,
714 unsigned int bytes_done)
715{
716 return;
717}
718
719static inline void bio_integrity_trim(struct bio *bio, unsigned int offset,
720 unsigned int sectors)
721{
722 return;
723}
724
725static inline void bio_integrity_init(void)
726{
727 return;
728}
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200729
730#endif /* CONFIG_BLK_DEV_INTEGRITY */
731
David Howells02a5e0a2007-08-11 22:34:32 +0200732#endif /* CONFIG_BLOCK */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700733#endif /* __LINUX_BIO_H */