blob: b900d2c67d29ad2dc490977a4d836a684d26fd04 [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
12
13 * 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>
Linus Torvalds1da177e2005-04-16 15:20:36 -070026
David Howells02a5e0a2007-08-11 22:34:32 +020027#ifdef CONFIG_BLOCK
28
Linus Torvalds1da177e2005-04-16 15:20:36 -070029#include <asm/io.h>
30
Linus Torvalds1da177e2005-04-16 15:20:36 -070031#define BIO_DEBUG
32
33#ifdef BIO_DEBUG
34#define BIO_BUG_ON BUG_ON
35#else
36#define BIO_BUG_ON
37#endif
38
Alexey Dobriyand84a8472006-06-25 05:49:32 -070039#define BIO_MAX_PAGES 256
Linus Torvalds1da177e2005-04-16 15:20:36 -070040#define BIO_MAX_SIZE (BIO_MAX_PAGES << PAGE_CACHE_SHIFT)
41#define BIO_MAX_SECTORS (BIO_MAX_SIZE >> 9)
42
43/*
44 * was unsigned short, but we might as well be ready for > 64kB I/O pages
45 */
46struct bio_vec {
47 struct page *bv_page;
48 unsigned int bv_len;
49 unsigned int bv_offset;
50};
51
52struct bio_set;
53struct bio;
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +020054struct bio_integrity_payload;
NeilBrown6712ecf2007-09-27 12:47:43 +020055typedef void (bio_end_io_t) (struct bio *, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -070056typedef void (bio_destructor_t) (struct bio *);
57
58/*
59 * main unit of I/O for the block layer and lower layers (ie drivers and
60 * stacking drivers)
61 */
62struct bio {
Roger Gammans2c2345c2006-10-04 13:37:45 +020063 sector_t bi_sector; /* device address in 512 byte
64 sectors */
Linus Torvalds1da177e2005-04-16 15:20:36 -070065 struct bio *bi_next; /* request queue link */
66 struct block_device *bi_bdev;
67 unsigned long bi_flags; /* status, command, etc */
68 unsigned long bi_rw; /* bottom bits READ/WRITE,
69 * top bits priority
70 */
71
72 unsigned short bi_vcnt; /* how many bio_vec's */
73 unsigned short bi_idx; /* current index into bvl_vec */
74
75 /* Number of segments in this BIO after
76 * physical address coalescing is performed.
77 */
Jens Axboe5b99c2f2008-08-15 10:56:11 +020078 unsigned int bi_phys_segments;
Linus Torvalds1da177e2005-04-16 15:20:36 -070079
Linus Torvalds1da177e2005-04-16 15:20:36 -070080 unsigned int bi_size; /* residual I/O count */
81
FUJITA Tomonori86771422008-10-13 14:19:05 +020082 /*
83 * To keep track of the max segment size, we account for the
84 * sizes of the first and last mergeable segments in this bio.
85 */
86 unsigned int bi_seg_front_size;
87 unsigned int bi_seg_back_size;
88
Linus Torvalds1da177e2005-04-16 15:20:36 -070089 unsigned int bi_max_vecs; /* max bvl_vecs we can hold */
90
Jens Axboec7c22e42008-09-13 20:26:01 +020091 unsigned int bi_comp_cpu; /* completion CPU */
92
Richard Kennedyba744d52008-12-03 12:41:40 +010093 atomic_t bi_cnt; /* pin count */
94
Linus Torvalds1da177e2005-04-16 15:20:36 -070095 struct bio_vec *bi_io_vec; /* the actual vec list */
96
97 bio_end_io_t *bi_end_io;
Linus Torvalds1da177e2005-04-16 15:20:36 -070098
99 void *bi_private;
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200100#if defined(CONFIG_BLK_DEV_INTEGRITY)
101 struct bio_integrity_payload *bi_integrity; /* data integrity */
102#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103
104 bio_destructor_t *bi_destructor; /* destructor */
Jens Axboe392ddc32008-12-23 12:42:54 +0100105
106 /*
107 * We can inline a number of vecs at the end of the bio, to avoid
108 * double allocations for a small number of bio_vecs. This member
109 * MUST obviously be kept at the very end of the bio.
110 */
111 struct bio_vec bi_inline_vecs[0];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112};
113
114/*
115 * bio flags
116 */
117#define BIO_UPTODATE 0 /* ok after I/O completion */
118#define BIO_RW_BLOCK 1 /* RW_AHEAD set, and read/write would block */
119#define BIO_EOF 2 /* out-out-bounds error */
Mikulas Patocka5df97b92008-08-15 10:20:02 +0200120#define BIO_SEG_VALID 3 /* bi_phys_segments valid */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121#define BIO_CLONED 4 /* doesn't own data */
122#define BIO_BOUNCED 5 /* bio is a bounce bio */
123#define BIO_USER_MAPPED 6 /* contains user pages */
124#define BIO_EOPNOTSUPP 7 /* not supported */
Jens Axboec7c22e42008-09-13 20:26:01 +0200125#define BIO_CPU_AFFINE 8 /* complete bio on same CPU as submitted */
FUJITA Tomonori81882762008-09-02 16:20:19 +0900126#define BIO_NULL_MAPPED 9 /* contains invalid user pages */
Martin K. Petersen74aa8c22008-10-01 03:38:37 -0400127#define BIO_FS_INTEGRITY 10 /* fs owns integrity data, not block layer */
Keith Mannthey08bafc02008-11-25 10:24:35 +0100128#define BIO_QUIET 11 /* Make BIO Quiet */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700129#define bio_flagged(bio, flag) ((bio)->bi_flags & (1 << (flag)))
130
131/*
132 * top 4 bits of bio flags indicate the pool this bio came from
133 */
134#define BIO_POOL_BITS (4)
135#define BIO_POOL_OFFSET (BITS_PER_LONG - BIO_POOL_BITS)
136#define BIO_POOL_MASK (1UL << BIO_POOL_OFFSET)
137#define BIO_POOL_IDX(bio) ((bio)->bi_flags >> BIO_POOL_OFFSET)
138
139/*
140 * bio bi_rw flags
141 *
Jens Axboeaf563942008-10-09 09:01:10 +0200142 * bit 0 -- data direction
143 * If not set, bio is a read from device. If set, it's a write to device.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144 * bit 1 -- rw-ahead when set
145 * bit 2 -- barrier
Jens Axboeaf563942008-10-09 09:01:10 +0200146 * Insert a serialization point in the IO queue, forcing previously
Alberto Bertogli16642eb2009-01-05 10:18:53 +0100147 * submitted IO to be completed before this one is issued.
Jens Axboeaeb6faf2009-04-06 14:48:07 +0200148 * bit 3 -- synchronous I/O hint.
149 * bit 4 -- Unplug the device immediately after submitting this bio.
150 * bit 5 -- metadata request
Jens Axboeaf563942008-10-09 09:01:10 +0200151 * Used for tracing to differentiate metadata and data IO. May also
152 * get some preferential treatment in the IO scheduler
Jens Axboeaeb6faf2009-04-06 14:48:07 +0200153 * bit 6 -- discard sectors
Jens Axboeaf563942008-10-09 09:01:10 +0200154 * Informs the lower level device that this range of sectors is no longer
155 * used by the file system and may thus be freed by the device. Used
156 * for flash based storage.
Jens Axboeaeb6faf2009-04-06 14:48:07 +0200157 * bit 7 -- fail fast device errors
158 * bit 8 -- fail fast transport errors
159 * bit 9 -- fail fast driver errors
Mike Christie6000a362008-08-19 18:45:30 -0500160 * Don't want driver retries for any fast fail whatever the reason.
Jens Axboeaeb6faf2009-04-06 14:48:07 +0200161 * bit 10 -- Tell the IO scheduler not to wait for more requests after this
162 one has been submitted, even if it is a SYNC request.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700163 */
David Woodhoused628eae2008-08-09 16:22:17 +0100164#define BIO_RW 0 /* Must match RW in req flags (blkdev.h) */
165#define BIO_RW_AHEAD 1 /* Must match FAILFAST in req flags */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166#define BIO_RW_BARRIER 2
Jens Axboe213d9412009-01-06 09:16:05 +0100167#define BIO_RW_SYNCIO 3
168#define BIO_RW_UNPLUG 4
169#define BIO_RW_META 5
170#define BIO_RW_DISCARD 6
171#define BIO_RW_FAILFAST_DEV 7
172#define BIO_RW_FAILFAST_TRANSPORT 8
173#define BIO_RW_FAILFAST_DRIVER 9
Jens Axboeaeb6faf2009-04-06 14:48:07 +0200174#define BIO_RW_NOIDLE 10
Jens Axboe213d9412009-01-06 09:16:05 +0100175
Jens Axboe1dfa17f2009-01-06 09:21:49 +0100176#define bio_rw_flagged(bio, flag) ((bio)->bi_rw & (1 << (flag)))
177
178/*
179 * Old defines, these should eventually be replaced by direct usage of
180 * bio_rw_flagged()
181 */
182#define bio_barrier(bio) bio_rw_flagged(bio, BIO_RW_BARRIER)
183#define bio_sync(bio) bio_rw_flagged(bio, BIO_RW_SYNCIO)
184#define bio_unplug(bio) bio_rw_flagged(bio, BIO_RW_UNPLUG)
185#define bio_failfast_dev(bio) bio_rw_flagged(bio, BIO_RW_FAILFAST_DEV)
186#define bio_failfast_transport(bio) \
187 bio_rw_flagged(bio, BIO_RW_FAILFAST_TRANSPORT)
188#define bio_failfast_driver(bio) \
189 bio_rw_flagged(bio, BIO_RW_FAILFAST_DRIVER)
190#define bio_rw_ahead(bio) bio_rw_flagged(bio, BIO_RW_AHEAD)
191#define bio_rw_meta(bio) bio_rw_flagged(bio, BIO_RW_META)
192#define bio_discard(bio) bio_rw_flagged(bio, BIO_RW_DISCARD)
Jens Axboeaeb6faf2009-04-06 14:48:07 +0200193#define bio_noidle(bio) bio_rw_flagged(bio, BIO_RW_NOIDLE)
Jens Axboe1dfa17f2009-01-06 09:21:49 +0100194
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195/*
Jens Axboe22e2c502005-06-27 10:55:12 +0200196 * upper 16 bits of bi_rw define the io priority of this bio
197 */
198#define BIO_PRIO_SHIFT (8 * sizeof(unsigned long) - IOPRIO_BITS)
199#define bio_prio(bio) ((bio)->bi_rw >> BIO_PRIO_SHIFT)
200#define bio_prio_valid(bio) ioprio_valid(bio_prio(bio))
201
202#define bio_set_prio(bio, prio) do { \
203 WARN_ON(prio >= (1 << IOPRIO_BITS)); \
204 (bio)->bi_rw &= ((1UL << BIO_PRIO_SHIFT) - 1); \
205 (bio)->bi_rw |= ((unsigned long) (prio) << BIO_PRIO_SHIFT); \
206} while (0)
207
208/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700209 * various member access, note that bio_data should of course not be used
210 * on highmem page vectors
211 */
212#define bio_iovec_idx(bio, idx) (&((bio)->bi_io_vec[(idx)]))
213#define bio_iovec(bio) bio_iovec_idx((bio), (bio)->bi_idx)
214#define bio_page(bio) bio_iovec((bio))->bv_page
215#define bio_offset(bio) bio_iovec((bio))->bv_offset
216#define bio_segments(bio) ((bio)->bi_vcnt - (bio)->bi_idx)
217#define bio_sectors(bio) ((bio)->bi_size >> 9)
David Woodhousee17fc0a2008-08-09 16:42:20 +0100218#define bio_empty_barrier(bio) (bio_barrier(bio) && !bio_has_data(bio) && !bio_discard(bio))
Jens Axboebf2de6f2007-09-27 13:01:25 +0200219
220static inline unsigned int bio_cur_sectors(struct bio *bio)
221{
222 if (bio->bi_vcnt)
223 return bio_iovec(bio)->bv_len >> 9;
David Woodhousefb2dce82008-08-05 18:01:53 +0100224 else /* dataless requests such as discard */
225 return bio->bi_size >> 9;
Jens Axboebf2de6f2007-09-27 13:01:25 +0200226}
227
228static inline void *bio_data(struct bio *bio)
229{
230 if (bio->bi_vcnt)
231 return page_address(bio_page(bio)) + bio_offset(bio);
232
233 return NULL;
234}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700235
Jens Axboe392ddc32008-12-23 12:42:54 +0100236static inline int bio_has_allocated_vec(struct bio *bio)
237{
238 return bio->bi_io_vec && bio->bi_io_vec != bio->bi_inline_vecs;
239}
240
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241/*
242 * will die
243 */
244#define bio_to_phys(bio) (page_to_phys(bio_page((bio))) + (unsigned long) bio_offset((bio)))
245#define bvec_to_phys(bv) (page_to_phys((bv)->bv_page) + (unsigned long) (bv)->bv_offset)
246
247/*
248 * queues that have highmem support enabled may still need to revert to
249 * PIO transfers occasionally and thus map high pages temporarily. For
250 * permanent PIO fall back, user is probably better off disabling highmem
251 * I/O completely on that queue (see ide-dma for example)
252 */
253#define __bio_kmap_atomic(bio, idx, kmtype) \
254 (kmap_atomic(bio_iovec_idx((bio), (idx))->bv_page, kmtype) + \
255 bio_iovec_idx((bio), (idx))->bv_offset)
256
257#define __bio_kunmap_atomic(addr, kmtype) kunmap_atomic(addr, kmtype)
258
259/*
260 * merge helpers etc
261 */
262
263#define __BVEC_END(bio) bio_iovec_idx((bio), (bio)->bi_vcnt - 1)
264#define __BVEC_START(bio) bio_iovec_idx((bio), (bio)->bi_idx)
265
Jeremy Fitzhardingef92131c2008-10-29 14:10:51 +0100266/* Default implementation of BIOVEC_PHYS_MERGEABLE */
267#define __BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
268 ((bvec_to_phys((vec1)) + (vec1)->bv_len) == bvec_to_phys((vec2)))
269
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270/*
271 * allow arch override, for eg virtualized architectures (put in asm/io.h)
272 */
273#ifndef BIOVEC_PHYS_MERGEABLE
274#define BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
Jeremy Fitzhardingef92131c2008-10-29 14:10:51 +0100275 __BIOVEC_PHYS_MERGEABLE(vec1, vec2)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276#endif
277
Linus Torvalds1da177e2005-04-16 15:20:36 -0700278#define __BIO_SEG_BOUNDARY(addr1, addr2, mask) \
279 (((addr1) | (mask)) == (((addr2) - 1) | (mask)))
280#define BIOVEC_SEG_BOUNDARY(q, b1, b2) \
281 __BIO_SEG_BOUNDARY(bvec_to_phys((b1)), bvec_to_phys((b2)) + (b2)->bv_len, (q)->seg_boundary_mask)
282#define BIO_SEG_BOUNDARY(q, b1, b2) \
283 BIOVEC_SEG_BOUNDARY((q), __BVEC_END((b1)), __BVEC_START((b2)))
284
NeilBrown6712ecf2007-09-27 12:47:43 +0200285#define bio_io_error(bio) bio_endio((bio), -EIO)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286
287/*
288 * drivers should not use the __ version unless they _really_ want to
289 * run through the entire bio and not just pending pieces
290 */
291#define __bio_for_each_segment(bvl, bio, i, start_idx) \
292 for (bvl = bio_iovec_idx((bio), (start_idx)), i = (start_idx); \
293 i < (bio)->bi_vcnt; \
294 bvl++, i++)
295
296#define bio_for_each_segment(bvl, bio, i) \
297 __bio_for_each_segment(bvl, bio, i, (bio)->bi_idx)
298
299/*
300 * get a reference to a bio, so it won't disappear. the intended use is
301 * something like:
302 *
303 * bio_get(bio);
304 * submit_bio(rw, bio);
305 * if (bio->bi_flags ...)
306 * do_something
307 * bio_put(bio);
308 *
309 * without the bio_get(), it could potentially complete I/O before submit_bio
310 * returns. and then bio would be freed memory when if (bio->bi_flags ...)
311 * runs
312 */
313#define bio_get(bio) atomic_inc(&(bio)->bi_cnt)
314
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200315#if defined(CONFIG_BLK_DEV_INTEGRITY)
316/*
317 * bio integrity payload
318 */
319struct bio_integrity_payload {
320 struct bio *bip_bio; /* parent bio */
321 struct bio_vec *bip_vec; /* integrity data vector */
322
323 sector_t bip_sector; /* virtual start sector */
324
325 void *bip_buf; /* generated integrity data */
326 bio_end_io_t *bip_end_io; /* saved I/O completion fn */
327
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200328 unsigned int bip_size;
329
330 unsigned short bip_pool; /* pool the ivec came from */
331 unsigned short bip_vcnt; /* # of integrity bio_vecs */
332 unsigned short bip_idx; /* current bip_vec index */
333
334 struct work_struct bip_work; /* I/O completion */
335};
336#endif /* CONFIG_BLK_DEV_INTEGRITY */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700337
338/*
339 * A bio_pair is used when we need to split a bio.
340 * This can only happen for a bio that refers to just one
341 * page of data, and in the unusual situation when the
342 * page crosses a chunk/device boundary
343 *
344 * The address of the master bio is stored in bio1.bi_private
345 * The address of the pool the pair was allocated from is stored
346 * in bio2.bi_private
347 */
348struct bio_pair {
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200349 struct bio bio1, bio2;
350 struct bio_vec bv1, bv2;
351#if defined(CONFIG_BLK_DEV_INTEGRITY)
352 struct bio_integrity_payload bip1, bip2;
353 struct bio_vec iv1, iv2;
354#endif
355 atomic_t cnt;
356 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357};
Denis ChengRq6feef532008-10-09 08:57:05 +0200358extern struct bio_pair *bio_split(struct bio *bi, int first_sectors);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359extern void bio_pair_release(struct bio_pair *dbio);
360
Jens Axboebb799ca2008-12-10 15:35:05 +0100361extern struct bio_set *bioset_create(unsigned int, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700362extern void bioset_free(struct bio_set *);
363
Al Virodd0fc662005-10-07 07:46:04 +0100364extern struct bio *bio_alloc(gfp_t, int);
Jens Axboe0a0d96b2008-09-11 13:17:37 +0200365extern struct bio *bio_kmalloc(gfp_t, int);
Al Virodd0fc662005-10-07 07:46:04 +0100366extern struct bio *bio_alloc_bioset(gfp_t, int, struct bio_set *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700367extern void bio_put(struct bio *);
Peter Osterlund36763472005-09-06 15:16:42 -0700368extern void bio_free(struct bio *, struct bio_set *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700369
NeilBrown6712ecf2007-09-27 12:47:43 +0200370extern void bio_endio(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
374extern void __bio_clone(struct bio *, struct bio *);
Al Virodd0fc662005-10-07 07:46:04 +0100375extern struct bio *bio_clone(struct bio *, gfp_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700376
377extern void bio_init(struct bio *);
378
379extern int bio_add_page(struct bio *, struct page *, unsigned int,unsigned int);
Mike Christie6e68af62005-11-11 05:30:27 -0600380extern int bio_add_pc_page(struct request_queue *, struct bio *, struct page *,
381 unsigned int, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700382extern int bio_get_nr_vecs(struct block_device *);
Martin K. Petersenad3316b2008-10-01 22:42:53 -0400383extern sector_t bio_sector_offset(struct bio *, unsigned short, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384extern struct bio *bio_map_user(struct request_queue *, struct block_device *,
FUJITA Tomonoria3bce902008-08-28 16:17:05 +0900385 unsigned long, unsigned int, int, gfp_t);
James Bottomley f1970ba2005-06-20 14:06:52 +0200386struct sg_iovec;
FUJITA Tomonori152e2832008-08-28 16:17:06 +0900387struct rq_map_data;
James Bottomley f1970ba2005-06-20 14:06:52 +0200388extern struct bio *bio_map_user_iov(struct request_queue *,
389 struct block_device *,
FUJITA Tomonoria3bce902008-08-28 16:17:05 +0900390 struct sg_iovec *, int, int, gfp_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391extern void bio_unmap_user(struct bio *);
Mike Christie df46b9a2005-06-20 14:04:44 +0200392extern struct bio *bio_map_kern(struct request_queue *, void *, unsigned int,
Al Viro27496a82005-10-21 03:20:48 -0400393 gfp_t);
FUJITA Tomonori68154e92008-04-25 12:47:50 +0200394extern struct bio *bio_copy_kern(struct request_queue *, void *, unsigned int,
395 gfp_t, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700396extern void bio_set_pages_dirty(struct bio *bio);
397extern void bio_check_pages_dirty(struct bio *bio);
FUJITA Tomonori152e2832008-08-28 16:17:06 +0900398extern struct bio *bio_copy_user(struct request_queue *, struct rq_map_data *,
399 unsigned long, unsigned int, int, gfp_t);
400extern struct bio *bio_copy_user_iov(struct request_queue *,
401 struct rq_map_data *, struct sg_iovec *,
FUJITA Tomonoria3bce902008-08-28 16:17:05 +0900402 int, int, gfp_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403extern int bio_uncopy_user(struct bio *);
404void zero_fill_bio(struct bio *bio);
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200405extern struct bio_vec *bvec_alloc_bs(gfp_t, int, unsigned long *, struct bio_set *);
Jens Axboebb799ca2008-12-10 15:35:05 +0100406extern void bvec_free_bs(struct bio_set *, struct bio_vec *, unsigned int);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200407extern unsigned int bvec_nr_vecs(unsigned short idx);
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200408
409/*
Jens Axboec7c22e42008-09-13 20:26:01 +0200410 * Allow queuer to specify a completion CPU for this bio
411 */
412static inline void bio_set_completion_cpu(struct bio *bio, unsigned int cpu)
413{
414 bio->bi_comp_cpu = cpu;
415}
416
417/*
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200418 * bio_set is used to allow other portions of the IO system to
419 * allocate their own private memory pools for bio and iovec structures.
420 * These memory pools in turn all allocate from the bio_slab
421 * and the bvec_slabs[].
422 */
423#define BIO_POOL_SIZE 2
424#define BIOVEC_NR_POOLS 6
Jens Axboe7ff93452008-12-11 11:53:43 +0100425#define BIOVEC_MAX_IDX (BIOVEC_NR_POOLS - 1)
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200426
427struct bio_set {
Jens Axboe1b434492008-10-22 20:32:58 +0200428 struct kmem_cache *bio_slab;
Jens Axboebb799ca2008-12-10 15:35:05 +0100429 unsigned int front_pad;
430
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200431 mempool_t *bio_pool;
Jens Axboe7ff93452008-12-11 11:53:43 +0100432 mempool_t *bvec_pool;
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200433};
434
435struct biovec_slab {
436 int nr_vecs;
437 char *name;
438 struct kmem_cache *slab;
439};
440
441extern struct bio_set *fs_bio_set;
Jens Axboebb799ca2008-12-10 15:35:05 +0100442extern struct biovec_slab bvec_slabs[BIOVEC_NR_POOLS] __read_mostly;
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200443
444/*
445 * a small number of entries is fine, not going to be performance critical.
446 * basically we just need to survive
447 */
448#define BIO_SPLIT_ENTRIES 2
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449
450#ifdef CONFIG_HIGHMEM
451/*
Alberto Bertogli20b636b2009-02-02 12:41:07 +0100452 * remember never ever reenable interrupts between a bvec_kmap_irq and
453 * bvec_kunmap_irq!
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454 *
455 * This function MUST be inlined - it plays with the CPU interrupt flags.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700456 */
Alberto Bertoglic52440a2009-02-02 12:41:07 +0100457static __always_inline char *bvec_kmap_irq(struct bio_vec *bvec,
458 unsigned long *flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700459{
460 unsigned long addr;
461
462 /*
463 * might not be a highmem page, but the preempt/irq count
464 * balancing is a lot nicer this way
465 */
466 local_irq_save(*flags);
467 addr = (unsigned long) kmap_atomic(bvec->bv_page, KM_BIO_SRC_IRQ);
468
469 BUG_ON(addr & ~PAGE_MASK);
470
471 return (char *) addr + bvec->bv_offset;
472}
473
Alberto Bertoglic52440a2009-02-02 12:41:07 +0100474static __always_inline void bvec_kunmap_irq(char *buffer,
475 unsigned long *flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476{
477 unsigned long ptr = (unsigned long) buffer & PAGE_MASK;
478
479 kunmap_atomic((void *) ptr, KM_BIO_SRC_IRQ);
480 local_irq_restore(*flags);
481}
482
483#else
484#define bvec_kmap_irq(bvec, flags) (page_address((bvec)->bv_page) + (bvec)->bv_offset)
485#define bvec_kunmap_irq(buf, flags) do { *(flags) = 0; } while (0)
486#endif
487
Adrian Bunkc2d08da2005-09-10 00:27:18 -0700488static inline char *__bio_kmap_irq(struct bio *bio, unsigned short idx,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489 unsigned long *flags)
490{
491 return bvec_kmap_irq(bio_iovec_idx(bio, idx), flags);
492}
493#define __bio_kunmap_irq(buf, flags) bvec_kunmap_irq(buf, flags)
494
495#define bio_kmap_irq(bio, flags) \
496 __bio_kmap_irq((bio), (bio)->bi_idx, (flags))
497#define bio_kunmap_irq(buf,flags) __bio_kunmap_irq(buf, flags)
498
Jens Axboe7a67f632008-08-08 11:17:12 +0200499/*
500 * Check whether this bio carries any data or not. A NULL bio is allowed.
501 */
502static inline int bio_has_data(struct bio *bio)
503{
504 return bio && bio->bi_io_vec != NULL;
505}
506
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200507#if defined(CONFIG_BLK_DEV_INTEGRITY)
508
509#define bip_vec_idx(bip, idx) (&(bip->bip_vec[(idx)]))
510#define bip_vec(bip) bip_vec_idx(bip, 0)
511
512#define __bip_for_each_vec(bvl, bip, i, start_idx) \
513 for (bvl = bip_vec_idx((bip), (start_idx)), i = (start_idx); \
514 i < (bip)->bip_vcnt; \
515 bvl++, i++)
516
517#define bip_for_each_vec(bvl, bip, i) \
518 __bip_for_each_vec(bvl, bip, i, (bip)->bip_idx)
519
Alberto Bertogli8deaf722008-10-02 12:46:53 +0200520#define bio_integrity(bio) (bio->bi_integrity != NULL)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200521
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200522extern struct bio_integrity_payload *bio_integrity_alloc(struct bio *, gfp_t, unsigned int);
Martin K. Petersen6d2a78e2009-03-10 08:27:39 +0100523extern void bio_integrity_free(struct bio *);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200524extern int bio_integrity_add_page(struct bio *, struct page *, unsigned int, unsigned int);
525extern int bio_integrity_enabled(struct bio *bio);
526extern int bio_integrity_set_tag(struct bio *, void *, unsigned int);
527extern int bio_integrity_get_tag(struct bio *, void *, unsigned int);
528extern int bio_integrity_prep(struct bio *);
529extern void bio_integrity_endio(struct bio *, int);
530extern void bio_integrity_advance(struct bio *, unsigned int);
531extern void bio_integrity_trim(struct bio *, unsigned int, unsigned int);
532extern void bio_integrity_split(struct bio *, struct bio_pair *, int);
Martin K. Petersen6d2a78e2009-03-10 08:27:39 +0100533extern int bio_integrity_clone(struct bio *, struct bio *, gfp_t);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200534
535#else /* CONFIG_BLK_DEV_INTEGRITY */
536
537#define bio_integrity(a) (0)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200538#define bio_integrity_prep(a) (0)
539#define bio_integrity_enabled(a) (0)
Martin K. Petersen6d2a78e2009-03-10 08:27:39 +0100540#define bio_integrity_clone(a, b, c) (0)
541#define bio_integrity_free(a) do { } while (0)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200542#define bio_integrity_endio(a, b) do { } while (0)
543#define bio_integrity_advance(a, b) do { } while (0)
544#define bio_integrity_trim(a, b, c) do { } while (0)
545#define bio_integrity_split(a, b, c) do { } while (0)
546#define bio_integrity_set_tag(a, b, c) do { } while (0)
547#define bio_integrity_get_tag(a, b, c) do { } while (0)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200548
549#endif /* CONFIG_BLK_DEV_INTEGRITY */
550
David Howells02a5e0a2007-08-11 22:34:32 +0200551#endif /* CONFIG_BLOCK */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552#endif /* __LINUX_BIO_H */