blob: ba679992d39b4e08ebf0314b784a72a80dd41506 [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>
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
Tejun Heo7cc01582010-08-03 13:14:58 +020031/* struct bio, bio_vec and BIO_* flags are defined in blk_types.h */
32#include <linux/blk_types.h>
33
Linus Torvalds1da177e2005-04-16 15:20:36 -070034#define BIO_DEBUG
35
36#ifdef BIO_DEBUG
37#define BIO_BUG_ON BUG_ON
38#else
39#define BIO_BUG_ON
40#endif
41
Alexey Dobriyand84a8472006-06-25 05:49:32 -070042#define BIO_MAX_PAGES 256
Linus Torvalds1da177e2005-04-16 15:20:36 -070043#define BIO_MAX_SIZE (BIO_MAX_PAGES << PAGE_CACHE_SHIFT)
44#define BIO_MAX_SECTORS (BIO_MAX_SIZE >> 9)
45
46/*
Jens Axboe22e2c502005-06-27 10:55:12 +020047 * upper 16 bits of bi_rw define the io priority of this bio
48 */
49#define BIO_PRIO_SHIFT (8 * sizeof(unsigned long) - IOPRIO_BITS)
50#define bio_prio(bio) ((bio)->bi_rw >> BIO_PRIO_SHIFT)
51#define bio_prio_valid(bio) ioprio_valid(bio_prio(bio))
52
53#define bio_set_prio(bio, prio) do { \
54 WARN_ON(prio >= (1 << IOPRIO_BITS)); \
55 (bio)->bi_rw &= ((1UL << BIO_PRIO_SHIFT) - 1); \
56 (bio)->bi_rw |= ((unsigned long) (prio) << BIO_PRIO_SHIFT); \
57} while (0)
58
59/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070060 * various member access, note that bio_data should of course not be used
61 * on highmem page vectors
62 */
63#define bio_iovec_idx(bio, idx) (&((bio)->bi_io_vec[(idx)]))
64#define bio_iovec(bio) bio_iovec_idx((bio), (bio)->bi_idx)
65#define bio_page(bio) bio_iovec((bio))->bv_page
66#define bio_offset(bio) bio_iovec((bio))->bv_offset
67#define bio_segments(bio) ((bio)->bi_vcnt - (bio)->bi_idx)
68#define bio_sectors(bio) ((bio)->bi_size >> 9)
Christoph Hellwig7b6d91d2010-08-07 18:20:39 +020069#define bio_empty_barrier(bio) \
70 ((bio->bi_rw & REQ_HARDBARRIER) && \
71 !bio_has_data(bio) && \
72 !(bio->bi_rw & REQ_DISCARD))
Jens Axboebf2de6f2007-09-27 13:01:25 +020073
Tejun Heo2e46e8b2009-05-07 22:24:41 +090074static inline unsigned int bio_cur_bytes(struct bio *bio)
Jens Axboebf2de6f2007-09-27 13:01:25 +020075{
76 if (bio->bi_vcnt)
Tejun Heo2e46e8b2009-05-07 22:24:41 +090077 return bio_iovec(bio)->bv_len;
David Woodhousefb2dce82008-08-05 18:01:53 +010078 else /* dataless requests such as discard */
Tejun Heo2e46e8b2009-05-07 22:24:41 +090079 return bio->bi_size;
Jens Axboebf2de6f2007-09-27 13:01:25 +020080}
81
82static inline void *bio_data(struct bio *bio)
83{
84 if (bio->bi_vcnt)
85 return page_address(bio_page(bio)) + bio_offset(bio);
86
87 return NULL;
88}
Linus Torvalds1da177e2005-04-16 15:20:36 -070089
Jens Axboe392ddc32008-12-23 12:42:54 +010090static inline int bio_has_allocated_vec(struct bio *bio)
91{
92 return bio->bi_io_vec && bio->bi_io_vec != bio->bi_inline_vecs;
93}
94
Linus Torvalds1da177e2005-04-16 15:20:36 -070095/*
96 * will die
97 */
98#define bio_to_phys(bio) (page_to_phys(bio_page((bio))) + (unsigned long) bio_offset((bio)))
99#define bvec_to_phys(bv) (page_to_phys((bv)->bv_page) + (unsigned long) (bv)->bv_offset)
100
101/*
102 * queues that have highmem support enabled may still need to revert to
103 * PIO transfers occasionally and thus map high pages temporarily. For
104 * permanent PIO fall back, user is probably better off disabling highmem
105 * I/O completely on that queue (see ide-dma for example)
106 */
107#define __bio_kmap_atomic(bio, idx, kmtype) \
108 (kmap_atomic(bio_iovec_idx((bio), (idx))->bv_page, kmtype) + \
109 bio_iovec_idx((bio), (idx))->bv_offset)
110
111#define __bio_kunmap_atomic(addr, kmtype) kunmap_atomic(addr, kmtype)
112
113/*
114 * merge helpers etc
115 */
116
117#define __BVEC_END(bio) bio_iovec_idx((bio), (bio)->bi_vcnt - 1)
118#define __BVEC_START(bio) bio_iovec_idx((bio), (bio)->bi_idx)
119
Jeremy Fitzhardingef92131c2008-10-29 14:10:51 +0100120/* Default implementation of BIOVEC_PHYS_MERGEABLE */
121#define __BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
122 ((bvec_to_phys((vec1)) + (vec1)->bv_len) == bvec_to_phys((vec2)))
123
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124/*
125 * allow arch override, for eg virtualized architectures (put in asm/io.h)
126 */
127#ifndef BIOVEC_PHYS_MERGEABLE
128#define BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
Jeremy Fitzhardingef92131c2008-10-29 14:10:51 +0100129 __BIOVEC_PHYS_MERGEABLE(vec1, vec2)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130#endif
131
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132#define __BIO_SEG_BOUNDARY(addr1, addr2, mask) \
133 (((addr1) | (mask)) == (((addr2) - 1) | (mask)))
134#define BIOVEC_SEG_BOUNDARY(q, b1, b2) \
Martin K. Petersenae03bf62009-05-22 17:17:50 -0400135 __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 -0700136#define BIO_SEG_BOUNDARY(q, b1, b2) \
137 BIOVEC_SEG_BOUNDARY((q), __BVEC_END((b1)), __BVEC_START((b2)))
138
NeilBrown6712ecf2007-09-27 12:47:43 +0200139#define bio_io_error(bio) bio_endio((bio), -EIO)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140
141/*
142 * drivers should not use the __ version unless they _really_ want to
143 * run through the entire bio and not just pending pieces
144 */
145#define __bio_for_each_segment(bvl, bio, i, start_idx) \
146 for (bvl = bio_iovec_idx((bio), (start_idx)), i = (start_idx); \
147 i < (bio)->bi_vcnt; \
148 bvl++, i++)
149
150#define bio_for_each_segment(bvl, bio, i) \
151 __bio_for_each_segment(bvl, bio, i, (bio)->bi_idx)
152
153/*
154 * get a reference to a bio, so it won't disappear. the intended use is
155 * something like:
156 *
157 * bio_get(bio);
158 * submit_bio(rw, bio);
159 * if (bio->bi_flags ...)
160 * do_something
161 * bio_put(bio);
162 *
163 * without the bio_get(), it could potentially complete I/O before submit_bio
164 * returns. and then bio would be freed memory when if (bio->bi_flags ...)
165 * runs
166 */
167#define bio_get(bio) atomic_inc(&(bio)->bi_cnt)
168
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200169#if defined(CONFIG_BLK_DEV_INTEGRITY)
170/*
171 * bio integrity payload
172 */
173struct bio_integrity_payload {
174 struct bio *bip_bio; /* parent bio */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200175
176 sector_t bip_sector; /* virtual start sector */
177
178 void *bip_buf; /* generated integrity data */
179 bio_end_io_t *bip_end_io; /* saved I/O completion fn */
180
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200181 unsigned int bip_size;
182
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200183 unsigned short bip_slab; /* slab the bip came from */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200184 unsigned short bip_vcnt; /* # of integrity bio_vecs */
185 unsigned short bip_idx; /* current bip_vec index */
186
187 struct work_struct bip_work; /* I/O completion */
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200188 struct bio_vec bip_vec[0]; /* embedded bvec array */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200189};
190#endif /* CONFIG_BLK_DEV_INTEGRITY */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700191
192/*
193 * A bio_pair is used when we need to split a bio.
194 * This can only happen for a bio that refers to just one
195 * page of data, and in the unusual situation when the
196 * page crosses a chunk/device boundary
197 *
198 * The address of the master bio is stored in bio1.bi_private
199 * The address of the pool the pair was allocated from is stored
200 * in bio2.bi_private
201 */
202struct bio_pair {
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200203 struct bio bio1, bio2;
204 struct bio_vec bv1, bv2;
205#if defined(CONFIG_BLK_DEV_INTEGRITY)
206 struct bio_integrity_payload bip1, bip2;
207 struct bio_vec iv1, iv2;
208#endif
209 atomic_t cnt;
210 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700211};
Denis ChengRq6feef532008-10-09 08:57:05 +0200212extern struct bio_pair *bio_split(struct bio *bi, int first_sectors);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213extern void bio_pair_release(struct bio_pair *dbio);
214
Jens Axboebb799ca2008-12-10 15:35:05 +0100215extern struct bio_set *bioset_create(unsigned int, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216extern void bioset_free(struct bio_set *);
217
Al Virodd0fc662005-10-07 07:46:04 +0100218extern struct bio *bio_alloc(gfp_t, int);
Jens Axboe0a0d96b2008-09-11 13:17:37 +0200219extern struct bio *bio_kmalloc(gfp_t, int);
Al Virodd0fc662005-10-07 07:46:04 +0100220extern struct bio *bio_alloc_bioset(gfp_t, int, struct bio_set *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700221extern void bio_put(struct bio *);
Peter Osterlund36763472005-09-06 15:16:42 -0700222extern void bio_free(struct bio *, struct bio_set *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700223
NeilBrown6712ecf2007-09-27 12:47:43 +0200224extern void bio_endio(struct bio *, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225struct request_queue;
226extern int bio_phys_segments(struct request_queue *, struct bio *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700227
228extern void __bio_clone(struct bio *, struct bio *);
Al Virodd0fc662005-10-07 07:46:04 +0100229extern struct bio *bio_clone(struct bio *, gfp_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700230
231extern void bio_init(struct bio *);
232
233extern int bio_add_page(struct bio *, struct page *, unsigned int,unsigned int);
Mike Christie6e68af62005-11-11 05:30:27 -0600234extern int bio_add_pc_page(struct request_queue *, struct bio *, struct page *,
235 unsigned int, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236extern int bio_get_nr_vecs(struct block_device *);
Martin K. Petersenad3316b2008-10-01 22:42:53 -0400237extern sector_t bio_sector_offset(struct bio *, unsigned short, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238extern struct bio *bio_map_user(struct request_queue *, struct block_device *,
FUJITA Tomonoria3bce902008-08-28 16:17:05 +0900239 unsigned long, unsigned int, int, gfp_t);
James Bottomley f1970ba2005-06-20 14:06:52 +0200240struct sg_iovec;
FUJITA Tomonori152e2832008-08-28 16:17:06 +0900241struct rq_map_data;
James Bottomley f1970ba2005-06-20 14:06:52 +0200242extern struct bio *bio_map_user_iov(struct request_queue *,
243 struct block_device *,
FUJITA Tomonoria3bce902008-08-28 16:17:05 +0900244 struct sg_iovec *, int, int, gfp_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245extern void bio_unmap_user(struct bio *);
Mike Christie df46b9a2005-06-20 14:04:44 +0200246extern struct bio *bio_map_kern(struct request_queue *, void *, unsigned int,
Al Viro27496a82005-10-21 03:20:48 -0400247 gfp_t);
FUJITA Tomonori68154e92008-04-25 12:47:50 +0200248extern struct bio *bio_copy_kern(struct request_queue *, void *, unsigned int,
249 gfp_t, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250extern void bio_set_pages_dirty(struct bio *bio);
251extern void bio_check_pages_dirty(struct bio *bio);
Ilya Loginov2d4dc892009-11-26 09:16:19 +0100252
253#ifndef ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
254# error "You should define ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE for your platform"
255#endif
256#if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
257extern void bio_flush_dcache_pages(struct bio *bi);
258#else
259static inline void bio_flush_dcache_pages(struct bio *bi)
260{
261}
262#endif
263
FUJITA Tomonori152e2832008-08-28 16:17:06 +0900264extern struct bio *bio_copy_user(struct request_queue *, struct rq_map_data *,
265 unsigned long, unsigned int, int, gfp_t);
266extern struct bio *bio_copy_user_iov(struct request_queue *,
267 struct rq_map_data *, struct sg_iovec *,
FUJITA Tomonoria3bce902008-08-28 16:17:05 +0900268 int, int, gfp_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269extern int bio_uncopy_user(struct bio *);
270void zero_fill_bio(struct bio *bio);
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200271extern struct bio_vec *bvec_alloc_bs(gfp_t, int, unsigned long *, struct bio_set *);
Jens Axboebb799ca2008-12-10 15:35:05 +0100272extern void bvec_free_bs(struct bio_set *, struct bio_vec *, unsigned int);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200273extern unsigned int bvec_nr_vecs(unsigned short idx);
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200274
275/*
Jens Axboec7c22e42008-09-13 20:26:01 +0200276 * Allow queuer to specify a completion CPU for this bio
277 */
278static inline void bio_set_completion_cpu(struct bio *bio, unsigned int cpu)
279{
280 bio->bi_comp_cpu = cpu;
281}
282
283/*
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200284 * bio_set is used to allow other portions of the IO system to
285 * allocate their own private memory pools for bio and iovec structures.
286 * These memory pools in turn all allocate from the bio_slab
287 * and the bvec_slabs[].
288 */
289#define BIO_POOL_SIZE 2
290#define BIOVEC_NR_POOLS 6
Jens Axboe7ff93452008-12-11 11:53:43 +0100291#define BIOVEC_MAX_IDX (BIOVEC_NR_POOLS - 1)
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200292
293struct bio_set {
Jens Axboe1b434492008-10-22 20:32:58 +0200294 struct kmem_cache *bio_slab;
Jens Axboebb799ca2008-12-10 15:35:05 +0100295 unsigned int front_pad;
296
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200297 mempool_t *bio_pool;
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200298#if defined(CONFIG_BLK_DEV_INTEGRITY)
299 mempool_t *bio_integrity_pool;
300#endif
Jens Axboe7ff93452008-12-11 11:53:43 +0100301 mempool_t *bvec_pool;
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200302};
303
304struct biovec_slab {
305 int nr_vecs;
306 char *name;
307 struct kmem_cache *slab;
308};
309
310extern struct bio_set *fs_bio_set;
Jens Axboebb799ca2008-12-10 15:35:05 +0100311extern struct biovec_slab bvec_slabs[BIOVEC_NR_POOLS] __read_mostly;
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200312
313/*
314 * a small number of entries is fine, not going to be performance critical.
315 * basically we just need to survive
316 */
317#define BIO_SPLIT_ENTRIES 2
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318
319#ifdef CONFIG_HIGHMEM
320/*
Alberto Bertogli20b636b2009-02-02 12:41:07 +0100321 * remember never ever reenable interrupts between a bvec_kmap_irq and
322 * bvec_kunmap_irq!
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323 */
Alberto Bertogli4f570f92009-11-02 11:40:16 +0100324static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700325{
326 unsigned long addr;
327
328 /*
329 * might not be a highmem page, but the preempt/irq count
330 * balancing is a lot nicer this way
331 */
332 local_irq_save(*flags);
333 addr = (unsigned long) kmap_atomic(bvec->bv_page, KM_BIO_SRC_IRQ);
334
335 BUG_ON(addr & ~PAGE_MASK);
336
337 return (char *) addr + bvec->bv_offset;
338}
339
Alberto Bertogli4f570f92009-11-02 11:40:16 +0100340static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341{
342 unsigned long ptr = (unsigned long) buffer & PAGE_MASK;
343
344 kunmap_atomic((void *) ptr, KM_BIO_SRC_IRQ);
345 local_irq_restore(*flags);
346}
347
348#else
Geert Uytterhoeven11a691b2010-10-21 10:32:29 +0200349static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
350{
351 return page_address(bvec->bv_page) + bvec->bv_offset;
352}
353
354static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
355{
356 *flags = 0;
357}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700358#endif
359
Adrian Bunkc2d08da2005-09-10 00:27:18 -0700360static inline char *__bio_kmap_irq(struct bio *bio, unsigned short idx,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361 unsigned long *flags)
362{
363 return bvec_kmap_irq(bio_iovec_idx(bio, idx), flags);
364}
365#define __bio_kunmap_irq(buf, flags) bvec_kunmap_irq(buf, flags)
366
367#define bio_kmap_irq(bio, flags) \
368 __bio_kmap_irq((bio), (bio)->bi_idx, (flags))
369#define bio_kunmap_irq(buf,flags) __bio_kunmap_irq(buf, flags)
370
Jens Axboe7a67f632008-08-08 11:17:12 +0200371/*
372 * Check whether this bio carries any data or not. A NULL bio is allowed.
373 */
374static inline int bio_has_data(struct bio *bio)
375{
376 return bio && bio->bi_io_vec != NULL;
377}
378
Christoph Hellwig8f3d8ba2009-04-07 19:55:13 +0200379/*
Akinobu Mitae6863072009-04-17 08:41:21 +0200380 * BIO list management for use by remapping drivers (e.g. DM or MD) and loop.
Christoph Hellwig8f3d8ba2009-04-07 19:55:13 +0200381 *
382 * A bio_list anchors a singly-linked list of bios chained through the bi_next
383 * member of the bio. The bio_list also caches the last list member to allow
384 * fast access to the tail.
385 */
386struct bio_list {
387 struct bio *head;
388 struct bio *tail;
389};
390
391static inline int bio_list_empty(const struct bio_list *bl)
392{
393 return bl->head == NULL;
394}
395
396static inline void bio_list_init(struct bio_list *bl)
397{
398 bl->head = bl->tail = NULL;
399}
400
401#define bio_list_for_each(bio, bl) \
402 for (bio = (bl)->head; bio; bio = bio->bi_next)
403
404static inline unsigned bio_list_size(const struct bio_list *bl)
405{
406 unsigned sz = 0;
407 struct bio *bio;
408
409 bio_list_for_each(bio, bl)
410 sz++;
411
412 return sz;
413}
414
415static inline void bio_list_add(struct bio_list *bl, struct bio *bio)
416{
417 bio->bi_next = NULL;
418
419 if (bl->tail)
420 bl->tail->bi_next = bio;
421 else
422 bl->head = bio;
423
424 bl->tail = bio;
425}
426
427static inline void bio_list_add_head(struct bio_list *bl, struct bio *bio)
428{
429 bio->bi_next = bl->head;
430
431 bl->head = bio;
432
433 if (!bl->tail)
434 bl->tail = bio;
435}
436
437static inline void bio_list_merge(struct bio_list *bl, struct bio_list *bl2)
438{
439 if (!bl2->head)
440 return;
441
442 if (bl->tail)
443 bl->tail->bi_next = bl2->head;
444 else
445 bl->head = bl2->head;
446
447 bl->tail = bl2->tail;
448}
449
450static inline void bio_list_merge_head(struct bio_list *bl,
451 struct bio_list *bl2)
452{
453 if (!bl2->head)
454 return;
455
456 if (bl->head)
457 bl2->tail->bi_next = bl->head;
458 else
459 bl->tail = bl2->tail;
460
461 bl->head = bl2->head;
462}
463
Geert Uytterhoeven13685a12009-06-10 04:38:40 +0000464static inline struct bio *bio_list_peek(struct bio_list *bl)
465{
466 return bl->head;
467}
468
Christoph Hellwig8f3d8ba2009-04-07 19:55:13 +0200469static inline struct bio *bio_list_pop(struct bio_list *bl)
470{
471 struct bio *bio = bl->head;
472
473 if (bio) {
474 bl->head = bl->head->bi_next;
475 if (!bl->head)
476 bl->tail = NULL;
477
478 bio->bi_next = NULL;
479 }
480
481 return bio;
482}
483
484static inline struct bio *bio_list_get(struct bio_list *bl)
485{
486 struct bio *bio = bl->head;
487
488 bl->head = bl->tail = NULL;
489
490 return bio;
491}
492
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200493#if defined(CONFIG_BLK_DEV_INTEGRITY)
494
495#define bip_vec_idx(bip, idx) (&(bip->bip_vec[(idx)]))
496#define bip_vec(bip) bip_vec_idx(bip, 0)
497
498#define __bip_for_each_vec(bvl, bip, i, start_idx) \
499 for (bvl = bip_vec_idx((bip), (start_idx)), i = (start_idx); \
500 i < (bip)->bip_vcnt; \
501 bvl++, i++)
502
503#define bip_for_each_vec(bvl, bip, i) \
504 __bip_for_each_vec(bvl, bip, i, (bip)->bip_idx)
505
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200506#define bio_for_each_integrity_vec(_bvl, _bio, _iter) \
507 for_each_bio(_bio) \
508 bip_for_each_vec(_bvl, _bio->bi_integrity, _iter)
509
Alberto Bertogli8deaf722008-10-02 12:46:53 +0200510#define bio_integrity(bio) (bio->bi_integrity != NULL)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200511
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200512extern struct bio_integrity_payload *bio_integrity_alloc_bioset(struct bio *, gfp_t, unsigned int, struct bio_set *);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200513extern struct bio_integrity_payload *bio_integrity_alloc(struct bio *, gfp_t, unsigned int);
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200514extern void bio_integrity_free(struct bio *, struct bio_set *);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200515extern int bio_integrity_add_page(struct bio *, struct page *, unsigned int, unsigned int);
516extern int bio_integrity_enabled(struct bio *bio);
517extern int bio_integrity_set_tag(struct bio *, void *, unsigned int);
518extern int bio_integrity_get_tag(struct bio *, void *, unsigned int);
519extern int bio_integrity_prep(struct bio *);
520extern void bio_integrity_endio(struct bio *, int);
521extern void bio_integrity_advance(struct bio *, unsigned int);
522extern void bio_integrity_trim(struct bio *, unsigned int, unsigned int);
523extern void bio_integrity_split(struct bio *, struct bio_pair *, int);
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200524extern int bio_integrity_clone(struct bio *, struct bio *, gfp_t, struct bio_set *);
525extern int bioset_integrity_create(struct bio_set *, int);
526extern void bioset_integrity_free(struct bio_set *);
527extern void bio_integrity_init(void);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200528
529#else /* CONFIG_BLK_DEV_INTEGRITY */
530
531#define bio_integrity(a) (0)
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200532#define bioset_integrity_create(a, b) (0)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200533#define bio_integrity_prep(a) (0)
534#define bio_integrity_enabled(a) (0)
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200535#define bio_integrity_clone(a, b, c, d) (0)
536#define bioset_integrity_free(a) do { } while (0)
537#define bio_integrity_free(a, b) do { } while (0)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200538#define bio_integrity_endio(a, b) do { } while (0)
539#define bio_integrity_advance(a, b) do { } while (0)
540#define bio_integrity_trim(a, b, c) do { } while (0)
541#define bio_integrity_split(a, b, c) do { } while (0)
542#define bio_integrity_set_tag(a, b, c) do { } while (0)
543#define bio_integrity_get_tag(a, b, c) do { } while (0)
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200544#define bio_integrity_init(a) do { } while (0)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200545
546#endif /* CONFIG_BLK_DEV_INTEGRITY */
547
David Howells02a5e0a2007-08-11 22:34:32 +0200548#endif /* CONFIG_BLOCK */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700549#endif /* __LINUX_BIO_H */