bio.h 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656
  1. /*
  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. #include <linux/highmem.h>
  23. #include <linux/mempool.h>
  24. #include <linux/ioprio.h>
  25. #include <linux/bug.h>
  26. #ifdef CONFIG_BLOCK
  27. #include <asm/io.h>
  28. /* struct bio, bio_vec and BIO_* flags are defined in blk_types.h */
  29. #include <linux/blk_types.h>
  30. #define BIO_DEBUG
  31. #ifdef BIO_DEBUG
  32. #define BIO_BUG_ON BUG_ON
  33. #else
  34. #define BIO_BUG_ON
  35. #endif
  36. #define BIO_MAX_PAGES 256
  37. #define BIO_MAX_SIZE (BIO_MAX_PAGES << PAGE_CACHE_SHIFT)
  38. #define BIO_MAX_SECTORS (BIO_MAX_SIZE >> 9)
  39. /*
  40. * upper 16 bits of bi_rw define the io priority of this bio
  41. */
  42. #define BIO_PRIO_SHIFT (8 * sizeof(unsigned long) - IOPRIO_BITS)
  43. #define bio_prio(bio) ((bio)->bi_rw >> BIO_PRIO_SHIFT)
  44. #define bio_prio_valid(bio) ioprio_valid(bio_prio(bio))
  45. #define bio_set_prio(bio, prio) do { \
  46. WARN_ON(prio >= (1 << IOPRIO_BITS)); \
  47. (bio)->bi_rw &= ((1UL << BIO_PRIO_SHIFT) - 1); \
  48. (bio)->bi_rw |= ((unsigned long) (prio) << BIO_PRIO_SHIFT); \
  49. } while (0)
  50. /*
  51. * various member access, note that bio_data should of course not be used
  52. * on highmem page vectors
  53. */
  54. #define bio_iovec_idx(bio, idx) (&((bio)->bi_io_vec[(idx)]))
  55. #define bio_iovec(bio) bio_iovec_idx((bio), (bio)->bi_idx)
  56. #define bio_page(bio) bio_iovec((bio))->bv_page
  57. #define bio_offset(bio) bio_iovec((bio))->bv_offset
  58. #define bio_segments(bio) ((bio)->bi_vcnt - (bio)->bi_idx)
  59. #define bio_sectors(bio) ((bio)->bi_size >> 9)
  60. #define bio_end_sector(bio) ((bio)->bi_sector + bio_sectors((bio)))
  61. static inline unsigned int bio_cur_bytes(struct bio *bio)
  62. {
  63. if (bio->bi_vcnt)
  64. return bio_iovec(bio)->bv_len;
  65. else /* dataless requests such as discard */
  66. return bio->bi_size;
  67. }
  68. static inline void *bio_data(struct bio *bio)
  69. {
  70. if (bio->bi_vcnt)
  71. return page_address(bio_page(bio)) + bio_offset(bio);
  72. return NULL;
  73. }
  74. /*
  75. * will die
  76. */
  77. #define bio_to_phys(bio) (page_to_phys(bio_page((bio))) + (unsigned long) bio_offset((bio)))
  78. #define bvec_to_phys(bv) (page_to_phys((bv)->bv_page) + (unsigned long) (bv)->bv_offset)
  79. /*
  80. * queues that have highmem support enabled may still need to revert to
  81. * PIO transfers occasionally and thus map high pages temporarily. For
  82. * permanent PIO fall back, user is probably better off disabling highmem
  83. * I/O completely on that queue (see ide-dma for example)
  84. */
  85. #define __bio_kmap_atomic(bio, idx, kmtype) \
  86. (kmap_atomic(bio_iovec_idx((bio), (idx))->bv_page) + \
  87. bio_iovec_idx((bio), (idx))->bv_offset)
  88. #define __bio_kunmap_atomic(addr, kmtype) kunmap_atomic(addr)
  89. /*
  90. * merge helpers etc
  91. */
  92. #define __BVEC_END(bio) bio_iovec_idx((bio), (bio)->bi_vcnt - 1)
  93. #define __BVEC_START(bio) bio_iovec_idx((bio), (bio)->bi_idx)
  94. /* Default implementation of BIOVEC_PHYS_MERGEABLE */
  95. #define __BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
  96. ((bvec_to_phys((vec1)) + (vec1)->bv_len) == bvec_to_phys((vec2)))
  97. /*
  98. * allow arch override, for eg virtualized architectures (put in asm/io.h)
  99. */
  100. #ifndef BIOVEC_PHYS_MERGEABLE
  101. #define BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
  102. __BIOVEC_PHYS_MERGEABLE(vec1, vec2)
  103. #endif
  104. #define __BIO_SEG_BOUNDARY(addr1, addr2, mask) \
  105. (((addr1) | (mask)) == (((addr2) - 1) | (mask)))
  106. #define BIOVEC_SEG_BOUNDARY(q, b1, b2) \
  107. __BIO_SEG_BOUNDARY(bvec_to_phys((b1)), bvec_to_phys((b2)) + (b2)->bv_len, queue_segment_boundary((q)))
  108. #define BIO_SEG_BOUNDARY(q, b1, b2) \
  109. BIOVEC_SEG_BOUNDARY((q), __BVEC_END((b1)), __BVEC_START((b2)))
  110. #define bio_io_error(bio) bio_endio((bio), -EIO)
  111. /*
  112. * drivers should not use the __ version unless they _really_ know what
  113. * they're doing
  114. */
  115. #define __bio_for_each_segment(bvl, bio, i, start_idx) \
  116. for (bvl = bio_iovec_idx((bio), (start_idx)), i = (start_idx); \
  117. i < (bio)->bi_vcnt; \
  118. bvl++, i++)
  119. /*
  120. * drivers should _never_ use the all version - the bio may have been split
  121. * before it got to the driver and the driver won't own all of it
  122. */
  123. #define bio_for_each_segment_all(bvl, bio, i) \
  124. for (i = 0; \
  125. bvl = bio_iovec_idx((bio), (i)), i < (bio)->bi_vcnt; \
  126. i++)
  127. #define bio_for_each_segment(bvl, bio, i) \
  128. for (i = (bio)->bi_idx; \
  129. bvl = bio_iovec_idx((bio), (i)), i < (bio)->bi_vcnt; \
  130. i++)
  131. /*
  132. * get a reference to a bio, so it won't disappear. the intended use is
  133. * something like:
  134. *
  135. * bio_get(bio);
  136. * submit_bio(rw, bio);
  137. * if (bio->bi_flags ...)
  138. * do_something
  139. * bio_put(bio);
  140. *
  141. * without the bio_get(), it could potentially complete I/O before submit_bio
  142. * returns. and then bio would be freed memory when if (bio->bi_flags ...)
  143. * runs
  144. */
  145. #define bio_get(bio) atomic_inc(&(bio)->bi_cnt)
  146. #if defined(CONFIG_BLK_DEV_INTEGRITY)
  147. /*
  148. * bio integrity payload
  149. */
  150. struct bio_integrity_payload {
  151. struct bio *bip_bio; /* parent bio */
  152. sector_t bip_sector; /* virtual start sector */
  153. void *bip_buf; /* generated integrity data */
  154. bio_end_io_t *bip_end_io; /* saved I/O completion fn */
  155. unsigned int bip_size;
  156. unsigned short bip_slab; /* slab the bip came from */
  157. unsigned short bip_vcnt; /* # of integrity bio_vecs */
  158. unsigned short bip_idx; /* current bip_vec index */
  159. unsigned bip_owns_buf:1; /* should free bip_buf */
  160. struct work_struct bip_work; /* I/O completion */
  161. struct bio_vec *bip_vec;
  162. struct bio_vec bip_inline_vecs[0];/* embedded bvec array */
  163. };
  164. #endif /* CONFIG_BLK_DEV_INTEGRITY */
  165. /*
  166. * A bio_pair is used when we need to split a bio.
  167. * This can only happen for a bio that refers to just one
  168. * page of data, and in the unusual situation when the
  169. * page crosses a chunk/device boundary
  170. *
  171. * The address of the master bio is stored in bio1.bi_private
  172. * The address of the pool the pair was allocated from is stored
  173. * in bio2.bi_private
  174. */
  175. struct bio_pair {
  176. struct bio bio1, bio2;
  177. struct bio_vec bv1, bv2;
  178. #if defined(CONFIG_BLK_DEV_INTEGRITY)
  179. struct bio_integrity_payload bip1, bip2;
  180. struct bio_vec iv1, iv2;
  181. #endif
  182. atomic_t cnt;
  183. int error;
  184. };
  185. extern struct bio_pair *bio_split(struct bio *bi, int first_sectors);
  186. extern void bio_pair_release(struct bio_pair *dbio);
  187. extern struct bio_set *bioset_create(unsigned int, unsigned int);
  188. extern void bioset_free(struct bio_set *);
  189. extern mempool_t *biovec_create_pool(struct bio_set *bs, int pool_entries);
  190. extern struct bio *bio_alloc_bioset(gfp_t, int, struct bio_set *);
  191. extern void bio_put(struct bio *);
  192. extern void __bio_clone(struct bio *, struct bio *);
  193. extern struct bio *bio_clone_bioset(struct bio *, gfp_t, struct bio_set *bs);
  194. extern struct bio_set *fs_bio_set;
  195. static inline struct bio *bio_alloc(gfp_t gfp_mask, unsigned int nr_iovecs)
  196. {
  197. return bio_alloc_bioset(gfp_mask, nr_iovecs, fs_bio_set);
  198. }
  199. static inline struct bio *bio_clone(struct bio *bio, gfp_t gfp_mask)
  200. {
  201. return bio_clone_bioset(bio, gfp_mask, fs_bio_set);
  202. }
  203. static inline struct bio *bio_kmalloc(gfp_t gfp_mask, unsigned int nr_iovecs)
  204. {
  205. return bio_alloc_bioset(gfp_mask, nr_iovecs, NULL);
  206. }
  207. static inline struct bio *bio_clone_kmalloc(struct bio *bio, gfp_t gfp_mask)
  208. {
  209. return bio_clone_bioset(bio, gfp_mask, NULL);
  210. }
  211. extern void bio_endio(struct bio *, int);
  212. struct request_queue;
  213. extern int bio_phys_segments(struct request_queue *, struct bio *);
  214. extern int submit_bio_wait(int rw, struct bio *bio);
  215. extern void bio_advance(struct bio *, unsigned);
  216. extern void bio_init(struct bio *);
  217. extern void bio_reset(struct bio *);
  218. extern int bio_add_page(struct bio *, struct page *, unsigned int,unsigned int);
  219. extern int bio_add_pc_page(struct request_queue *, struct bio *, struct page *,
  220. unsigned int, unsigned int);
  221. extern int bio_get_nr_vecs(struct block_device *);
  222. extern sector_t bio_sector_offset(struct bio *, unsigned short, unsigned int);
  223. extern struct bio *bio_map_user(struct request_queue *, struct block_device *,
  224. unsigned long, unsigned int, int, gfp_t);
  225. struct sg_iovec;
  226. struct rq_map_data;
  227. extern struct bio *bio_map_user_iov(struct request_queue *,
  228. struct block_device *,
  229. struct sg_iovec *, int, int, gfp_t);
  230. extern void bio_unmap_user(struct bio *);
  231. extern struct bio *bio_map_kern(struct request_queue *, void *, unsigned int,
  232. gfp_t);
  233. extern struct bio *bio_copy_kern(struct request_queue *, void *, unsigned int,
  234. gfp_t, int);
  235. extern void bio_set_pages_dirty(struct bio *bio);
  236. extern void bio_check_pages_dirty(struct bio *bio);
  237. #ifndef ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
  238. # error "You should define ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE for your platform"
  239. #endif
  240. #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
  241. extern void bio_flush_dcache_pages(struct bio *bi);
  242. #else
  243. static inline void bio_flush_dcache_pages(struct bio *bi)
  244. {
  245. }
  246. #endif
  247. extern void bio_copy_data(struct bio *dst, struct bio *src);
  248. extern int bio_alloc_pages(struct bio *bio, gfp_t gfp);
  249. extern struct bio *bio_copy_user(struct request_queue *, struct rq_map_data *,
  250. unsigned long, unsigned int, int, gfp_t);
  251. extern struct bio *bio_copy_user_iov(struct request_queue *,
  252. struct rq_map_data *, struct sg_iovec *,
  253. int, int, gfp_t);
  254. extern int bio_uncopy_user(struct bio *);
  255. void zero_fill_bio(struct bio *bio);
  256. extern struct bio_vec *bvec_alloc(gfp_t, int, unsigned long *, mempool_t *);
  257. extern void bvec_free(mempool_t *, struct bio_vec *, unsigned int);
  258. extern unsigned int bvec_nr_vecs(unsigned short idx);
  259. #ifdef CONFIG_BLK_CGROUP
  260. int bio_associate_current(struct bio *bio);
  261. void bio_disassociate_task(struct bio *bio);
  262. #else /* CONFIG_BLK_CGROUP */
  263. static inline int bio_associate_current(struct bio *bio) { return -ENOENT; }
  264. static inline void bio_disassociate_task(struct bio *bio) { }
  265. #endif /* CONFIG_BLK_CGROUP */
  266. #ifdef CONFIG_HIGHMEM
  267. /*
  268. * remember never ever reenable interrupts between a bvec_kmap_irq and
  269. * bvec_kunmap_irq!
  270. */
  271. static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
  272. {
  273. unsigned long addr;
  274. /*
  275. * might not be a highmem page, but the preempt/irq count
  276. * balancing is a lot nicer this way
  277. */
  278. local_irq_save(*flags);
  279. addr = (unsigned long) kmap_atomic(bvec->bv_page);
  280. BUG_ON(addr & ~PAGE_MASK);
  281. return (char *) addr + bvec->bv_offset;
  282. }
  283. static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
  284. {
  285. unsigned long ptr = (unsigned long) buffer & PAGE_MASK;
  286. kunmap_atomic((void *) ptr);
  287. local_irq_restore(*flags);
  288. }
  289. #else
  290. static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
  291. {
  292. return page_address(bvec->bv_page) + bvec->bv_offset;
  293. }
  294. static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
  295. {
  296. *flags = 0;
  297. }
  298. #endif
  299. static inline char *__bio_kmap_irq(struct bio *bio, unsigned short idx,
  300. unsigned long *flags)
  301. {
  302. return bvec_kmap_irq(bio_iovec_idx(bio, idx), flags);
  303. }
  304. #define __bio_kunmap_irq(buf, flags) bvec_kunmap_irq(buf, flags)
  305. #define bio_kmap_irq(bio, flags) \
  306. __bio_kmap_irq((bio), (bio)->bi_idx, (flags))
  307. #define bio_kunmap_irq(buf,flags) __bio_kunmap_irq(buf, flags)
  308. /*
  309. * Check whether this bio carries any data or not. A NULL bio is allowed.
  310. */
  311. static inline bool bio_has_data(struct bio *bio)
  312. {
  313. if (bio && bio->bi_vcnt)
  314. return true;
  315. return false;
  316. }
  317. static inline bool bio_is_rw(struct bio *bio)
  318. {
  319. if (!bio_has_data(bio))
  320. return false;
  321. if (bio->bi_rw & REQ_WRITE_SAME)
  322. return false;
  323. return true;
  324. }
  325. static inline bool bio_mergeable(struct bio *bio)
  326. {
  327. if (bio->bi_rw & REQ_NOMERGE_FLAGS)
  328. return false;
  329. return true;
  330. }
  331. /*
  332. * BIO list management for use by remapping drivers (e.g. DM or MD) and loop.
  333. *
  334. * A bio_list anchors a singly-linked list of bios chained through the bi_next
  335. * member of the bio. The bio_list also caches the last list member to allow
  336. * fast access to the tail.
  337. */
  338. struct bio_list {
  339. struct bio *head;
  340. struct bio *tail;
  341. };
  342. static inline int bio_list_empty(const struct bio_list *bl)
  343. {
  344. return bl->head == NULL;
  345. }
  346. static inline void bio_list_init(struct bio_list *bl)
  347. {
  348. bl->head = bl->tail = NULL;
  349. }
  350. #define bio_list_for_each(bio, bl) \
  351. for (bio = (bl)->head; bio; bio = bio->bi_next)
  352. static inline unsigned bio_list_size(const struct bio_list *bl)
  353. {
  354. unsigned sz = 0;
  355. struct bio *bio;
  356. bio_list_for_each(bio, bl)
  357. sz++;
  358. return sz;
  359. }
  360. static inline void bio_list_add(struct bio_list *bl, struct bio *bio)
  361. {
  362. bio->bi_next = NULL;
  363. if (bl->tail)
  364. bl->tail->bi_next = bio;
  365. else
  366. bl->head = bio;
  367. bl->tail = bio;
  368. }
  369. static inline void bio_list_add_head(struct bio_list *bl, struct bio *bio)
  370. {
  371. bio->bi_next = bl->head;
  372. bl->head = bio;
  373. if (!bl->tail)
  374. bl->tail = bio;
  375. }
  376. static inline void bio_list_merge(struct bio_list *bl, struct bio_list *bl2)
  377. {
  378. if (!bl2->head)
  379. return;
  380. if (bl->tail)
  381. bl->tail->bi_next = bl2->head;
  382. else
  383. bl->head = bl2->head;
  384. bl->tail = bl2->tail;
  385. }
  386. static inline void bio_list_merge_head(struct bio_list *bl,
  387. struct bio_list *bl2)
  388. {
  389. if (!bl2->head)
  390. return;
  391. if (bl->head)
  392. bl2->tail->bi_next = bl->head;
  393. else
  394. bl->tail = bl2->tail;
  395. bl->head = bl2->head;
  396. }
  397. static inline struct bio *bio_list_peek(struct bio_list *bl)
  398. {
  399. return bl->head;
  400. }
  401. static inline struct bio *bio_list_pop(struct bio_list *bl)
  402. {
  403. struct bio *bio = bl->head;
  404. if (bio) {
  405. bl->head = bl->head->bi_next;
  406. if (!bl->head)
  407. bl->tail = NULL;
  408. bio->bi_next = NULL;
  409. }
  410. return bio;
  411. }
  412. static inline struct bio *bio_list_get(struct bio_list *bl)
  413. {
  414. struct bio *bio = bl->head;
  415. bl->head = bl->tail = NULL;
  416. return bio;
  417. }
  418. /*
  419. * bio_set is used to allow other portions of the IO system to
  420. * allocate their own private memory pools for bio and iovec structures.
  421. * These memory pools in turn all allocate from the bio_slab
  422. * and the bvec_slabs[].
  423. */
  424. #define BIO_POOL_SIZE 2
  425. #define BIOVEC_NR_POOLS 6
  426. #define BIOVEC_MAX_IDX (BIOVEC_NR_POOLS - 1)
  427. struct bio_set {
  428. struct kmem_cache *bio_slab;
  429. unsigned int front_pad;
  430. mempool_t *bio_pool;
  431. mempool_t *bvec_pool;
  432. #if defined(CONFIG_BLK_DEV_INTEGRITY)
  433. mempool_t *bio_integrity_pool;
  434. mempool_t *bvec_integrity_pool;
  435. #endif
  436. /*
  437. * Deadlock avoidance for stacking block drivers: see comments in
  438. * bio_alloc_bioset() for details
  439. */
  440. spinlock_t rescue_lock;
  441. struct bio_list rescue_list;
  442. struct work_struct rescue_work;
  443. struct workqueue_struct *rescue_workqueue;
  444. };
  445. struct biovec_slab {
  446. int nr_vecs;
  447. char *name;
  448. struct kmem_cache *slab;
  449. };
  450. /*
  451. * a small number of entries is fine, not going to be performance critical.
  452. * basically we just need to survive
  453. */
  454. #define BIO_SPLIT_ENTRIES 2
  455. #if defined(CONFIG_BLK_DEV_INTEGRITY)
  456. #define bip_vec_idx(bip, idx) (&(bip->bip_vec[(idx)]))
  457. #define bip_vec(bip) bip_vec_idx(bip, 0)
  458. #define __bip_for_each_vec(bvl, bip, i, start_idx) \
  459. for (bvl = bip_vec_idx((bip), (start_idx)), i = (start_idx); \
  460. i < (bip)->bip_vcnt; \
  461. bvl++, i++)
  462. #define bip_for_each_vec(bvl, bip, i) \
  463. __bip_for_each_vec(bvl, bip, i, (bip)->bip_idx)
  464. #define bio_for_each_integrity_vec(_bvl, _bio, _iter) \
  465. for_each_bio(_bio) \
  466. bip_for_each_vec(_bvl, _bio->bi_integrity, _iter)
  467. #define bio_integrity(bio) (bio->bi_integrity != NULL)
  468. extern struct bio_integrity_payload *bio_integrity_alloc(struct bio *, gfp_t, unsigned int);
  469. extern void bio_integrity_free(struct bio *);
  470. extern int bio_integrity_add_page(struct bio *, struct page *, unsigned int, unsigned int);
  471. extern int bio_integrity_enabled(struct bio *bio);
  472. extern int bio_integrity_set_tag(struct bio *, void *, unsigned int);
  473. extern int bio_integrity_get_tag(struct bio *, void *, unsigned int);
  474. extern int bio_integrity_prep(struct bio *);
  475. extern void bio_integrity_endio(struct bio *, int);
  476. extern void bio_integrity_advance(struct bio *, unsigned int);
  477. extern void bio_integrity_trim(struct bio *, unsigned int, unsigned int);
  478. extern void bio_integrity_split(struct bio *, struct bio_pair *, int);
  479. extern int bio_integrity_clone(struct bio *, struct bio *, gfp_t);
  480. extern int bioset_integrity_create(struct bio_set *, int);
  481. extern void bioset_integrity_free(struct bio_set *);
  482. extern void bio_integrity_init(void);
  483. #else /* CONFIG_BLK_DEV_INTEGRITY */
  484. static inline int bio_integrity(struct bio *bio)
  485. {
  486. return 0;
  487. }
  488. static inline int bio_integrity_enabled(struct bio *bio)
  489. {
  490. return 0;
  491. }
  492. static inline int bioset_integrity_create(struct bio_set *bs, int pool_size)
  493. {
  494. return 0;
  495. }
  496. static inline void bioset_integrity_free (struct bio_set *bs)
  497. {
  498. return;
  499. }
  500. static inline int bio_integrity_prep(struct bio *bio)
  501. {
  502. return 0;
  503. }
  504. static inline void bio_integrity_free(struct bio *bio)
  505. {
  506. return;
  507. }
  508. static inline int bio_integrity_clone(struct bio *bio, struct bio *bio_src,
  509. gfp_t gfp_mask)
  510. {
  511. return 0;
  512. }
  513. static inline void bio_integrity_split(struct bio *bio, struct bio_pair *bp,
  514. int sectors)
  515. {
  516. return;
  517. }
  518. static inline void bio_integrity_advance(struct bio *bio,
  519. unsigned int bytes_done)
  520. {
  521. return;
  522. }
  523. static inline void bio_integrity_trim(struct bio *bio, unsigned int offset,
  524. unsigned int sectors)
  525. {
  526. return;
  527. }
  528. static inline void bio_integrity_init(void)
  529. {
  530. return;
  531. }
  532. #endif /* CONFIG_BLK_DEV_INTEGRITY */
  533. #endif /* CONFIG_BLOCK */
  534. #endif /* __LINUX_BIO_H */