bio.h 15 KB

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