bio.h 17 KB

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