bio.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358
  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. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public Licens
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-
  18. */
  19. #ifndef __LINUX_BIO_H
  20. #define __LINUX_BIO_H
  21. #include <linux/highmem.h>
  22. #include <linux/mempool.h>
  23. #include <linux/ioprio.h>
  24. /* Platforms may set this to teach the BIO layer about IOMMU hardware. */
  25. #include <asm/io.h>
  26. #if defined(BIO_VMERGE_MAX_SIZE) && defined(BIO_VMERGE_BOUNDARY)
  27. #define BIOVEC_VIRT_START_SIZE(x) (bvec_to_phys(x) & (BIO_VMERGE_BOUNDARY - 1))
  28. #define BIOVEC_VIRT_OVERSIZE(x) ((x) > BIO_VMERGE_MAX_SIZE)
  29. #else
  30. #define BIOVEC_VIRT_START_SIZE(x) 0
  31. #define BIOVEC_VIRT_OVERSIZE(x) 0
  32. #endif
  33. #ifndef BIO_VMERGE_BOUNDARY
  34. #define BIO_VMERGE_BOUNDARY 0
  35. #endif
  36. #define BIO_DEBUG
  37. #ifdef BIO_DEBUG
  38. #define BIO_BUG_ON BUG_ON
  39. #else
  40. #define BIO_BUG_ON
  41. #endif
  42. #define BIO_MAX_PAGES (256)
  43. #define BIO_MAX_SIZE (BIO_MAX_PAGES << PAGE_CACHE_SHIFT)
  44. #define BIO_MAX_SECTORS (BIO_MAX_SIZE >> 9)
  45. /*
  46. * was unsigned short, but we might as well be ready for > 64kB I/O pages
  47. */
  48. struct bio_vec {
  49. struct page *bv_page;
  50. unsigned int bv_len;
  51. unsigned int bv_offset;
  52. };
  53. struct bio_set;
  54. struct bio;
  55. typedef int (bio_end_io_t) (struct bio *, unsigned int, int);
  56. typedef void (bio_destructor_t) (struct bio *);
  57. /*
  58. * main unit of I/O for the block layer and lower layers (ie drivers and
  59. * stacking drivers)
  60. */
  61. struct bio {
  62. sector_t bi_sector;
  63. struct bio *bi_next; /* request queue link */
  64. struct block_device *bi_bdev;
  65. unsigned long bi_flags; /* status, command, etc */
  66. unsigned long bi_rw; /* bottom bits READ/WRITE,
  67. * top bits priority
  68. */
  69. unsigned short bi_vcnt; /* how many bio_vec's */
  70. unsigned short bi_idx; /* current index into bvl_vec */
  71. /* Number of segments in this BIO after
  72. * physical address coalescing is performed.
  73. */
  74. unsigned short bi_phys_segments;
  75. /* Number of segments after physical and DMA remapping
  76. * hardware coalescing is performed.
  77. */
  78. unsigned short bi_hw_segments;
  79. unsigned int bi_size; /* residual I/O count */
  80. /*
  81. * To keep track of the max hw size, we account for the
  82. * sizes of the first and last virtually mergeable segments
  83. * in this bio
  84. */
  85. unsigned int bi_hw_front_size;
  86. unsigned int bi_hw_back_size;
  87. unsigned int bi_max_vecs; /* max bvl_vecs we can hold */
  88. struct bio_vec *bi_io_vec; /* the actual vec list */
  89. bio_end_io_t *bi_end_io;
  90. atomic_t bi_cnt; /* pin count */
  91. void *bi_private;
  92. bio_destructor_t *bi_destructor; /* destructor */
  93. };
  94. /*
  95. * bio flags
  96. */
  97. #define BIO_UPTODATE 0 /* ok after I/O completion */
  98. #define BIO_RW_BLOCK 1 /* RW_AHEAD set, and read/write would block */
  99. #define BIO_EOF 2 /* out-out-bounds error */
  100. #define BIO_SEG_VALID 3 /* nr_hw_seg valid */
  101. #define BIO_CLONED 4 /* doesn't own data */
  102. #define BIO_BOUNCED 5 /* bio is a bounce bio */
  103. #define BIO_USER_MAPPED 6 /* contains user pages */
  104. #define BIO_EOPNOTSUPP 7 /* not supported */
  105. #define bio_flagged(bio, flag) ((bio)->bi_flags & (1 << (flag)))
  106. /*
  107. * top 4 bits of bio flags indicate the pool this bio came from
  108. */
  109. #define BIO_POOL_BITS (4)
  110. #define BIO_POOL_OFFSET (BITS_PER_LONG - BIO_POOL_BITS)
  111. #define BIO_POOL_MASK (1UL << BIO_POOL_OFFSET)
  112. #define BIO_POOL_IDX(bio) ((bio)->bi_flags >> BIO_POOL_OFFSET)
  113. /*
  114. * bio bi_rw flags
  115. *
  116. * bit 0 -- read (not set) or write (set)
  117. * bit 1 -- rw-ahead when set
  118. * bit 2 -- barrier
  119. * bit 3 -- fail fast, don't want low level driver retries
  120. * bit 4 -- synchronous I/O hint: the block layer will unplug immediately
  121. */
  122. #define BIO_RW 0
  123. #define BIO_RW_AHEAD 1
  124. #define BIO_RW_BARRIER 2
  125. #define BIO_RW_FAILFAST 3
  126. #define BIO_RW_SYNC 4
  127. /*
  128. * upper 16 bits of bi_rw define the io priority of this bio
  129. */
  130. #define BIO_PRIO_SHIFT (8 * sizeof(unsigned long) - IOPRIO_BITS)
  131. #define bio_prio(bio) ((bio)->bi_rw >> BIO_PRIO_SHIFT)
  132. #define bio_prio_valid(bio) ioprio_valid(bio_prio(bio))
  133. #define bio_set_prio(bio, prio) do { \
  134. WARN_ON(prio >= (1 << IOPRIO_BITS)); \
  135. (bio)->bi_rw &= ((1UL << BIO_PRIO_SHIFT) - 1); \
  136. (bio)->bi_rw |= ((unsigned long) (prio) << BIO_PRIO_SHIFT); \
  137. } while (0)
  138. /*
  139. * various member access, note that bio_data should of course not be used
  140. * on highmem page vectors
  141. */
  142. #define bio_iovec_idx(bio, idx) (&((bio)->bi_io_vec[(idx)]))
  143. #define bio_iovec(bio) bio_iovec_idx((bio), (bio)->bi_idx)
  144. #define bio_page(bio) bio_iovec((bio))->bv_page
  145. #define bio_offset(bio) bio_iovec((bio))->bv_offset
  146. #define bio_segments(bio) ((bio)->bi_vcnt - (bio)->bi_idx)
  147. #define bio_sectors(bio) ((bio)->bi_size >> 9)
  148. #define bio_cur_sectors(bio) (bio_iovec(bio)->bv_len >> 9)
  149. #define bio_data(bio) (page_address(bio_page((bio))) + bio_offset((bio)))
  150. #define bio_barrier(bio) ((bio)->bi_rw & (1 << BIO_RW_BARRIER))
  151. #define bio_sync(bio) ((bio)->bi_rw & (1 << BIO_RW_SYNC))
  152. #define bio_failfast(bio) ((bio)->bi_rw & (1 << BIO_RW_FAILFAST))
  153. #define bio_rw_ahead(bio) ((bio)->bi_rw & (1 << BIO_RW_AHEAD))
  154. /*
  155. * will die
  156. */
  157. #define bio_to_phys(bio) (page_to_phys(bio_page((bio))) + (unsigned long) bio_offset((bio)))
  158. #define bvec_to_phys(bv) (page_to_phys((bv)->bv_page) + (unsigned long) (bv)->bv_offset)
  159. /*
  160. * queues that have highmem support enabled may still need to revert to
  161. * PIO transfers occasionally and thus map high pages temporarily. For
  162. * permanent PIO fall back, user is probably better off disabling highmem
  163. * I/O completely on that queue (see ide-dma for example)
  164. */
  165. #define __bio_kmap_atomic(bio, idx, kmtype) \
  166. (kmap_atomic(bio_iovec_idx((bio), (idx))->bv_page, kmtype) + \
  167. bio_iovec_idx((bio), (idx))->bv_offset)
  168. #define __bio_kunmap_atomic(addr, kmtype) kunmap_atomic(addr, kmtype)
  169. /*
  170. * merge helpers etc
  171. */
  172. #define __BVEC_END(bio) bio_iovec_idx((bio), (bio)->bi_vcnt - 1)
  173. #define __BVEC_START(bio) bio_iovec_idx((bio), (bio)->bi_idx)
  174. /*
  175. * allow arch override, for eg virtualized architectures (put in asm/io.h)
  176. */
  177. #ifndef BIOVEC_PHYS_MERGEABLE
  178. #define BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
  179. ((bvec_to_phys((vec1)) + (vec1)->bv_len) == bvec_to_phys((vec2)))
  180. #endif
  181. #define BIOVEC_VIRT_MERGEABLE(vec1, vec2) \
  182. ((((bvec_to_phys((vec1)) + (vec1)->bv_len) | bvec_to_phys((vec2))) & (BIO_VMERGE_BOUNDARY - 1)) == 0)
  183. #define __BIO_SEG_BOUNDARY(addr1, addr2, mask) \
  184. (((addr1) | (mask)) == (((addr2) - 1) | (mask)))
  185. #define BIOVEC_SEG_BOUNDARY(q, b1, b2) \
  186. __BIO_SEG_BOUNDARY(bvec_to_phys((b1)), bvec_to_phys((b2)) + (b2)->bv_len, (q)->seg_boundary_mask)
  187. #define BIO_SEG_BOUNDARY(q, b1, b2) \
  188. BIOVEC_SEG_BOUNDARY((q), __BVEC_END((b1)), __BVEC_START((b2)))
  189. #define bio_io_error(bio, bytes) bio_endio((bio), (bytes), -EIO)
  190. /*
  191. * drivers should not use the __ version unless they _really_ want to
  192. * run through the entire bio and not just pending pieces
  193. */
  194. #define __bio_for_each_segment(bvl, bio, i, start_idx) \
  195. for (bvl = bio_iovec_idx((bio), (start_idx)), i = (start_idx); \
  196. i < (bio)->bi_vcnt; \
  197. bvl++, i++)
  198. #define bio_for_each_segment(bvl, bio, i) \
  199. __bio_for_each_segment(bvl, bio, i, (bio)->bi_idx)
  200. /*
  201. * get a reference to a bio, so it won't disappear. the intended use is
  202. * something like:
  203. *
  204. * bio_get(bio);
  205. * submit_bio(rw, bio);
  206. * if (bio->bi_flags ...)
  207. * do_something
  208. * bio_put(bio);
  209. *
  210. * without the bio_get(), it could potentially complete I/O before submit_bio
  211. * returns. and then bio would be freed memory when if (bio->bi_flags ...)
  212. * runs
  213. */
  214. #define bio_get(bio) atomic_inc(&(bio)->bi_cnt)
  215. /*
  216. * A bio_pair is used when we need to split a bio.
  217. * This can only happen for a bio that refers to just one
  218. * page of data, and in the unusual situation when the
  219. * page crosses a chunk/device boundary
  220. *
  221. * The address of the master bio is stored in bio1.bi_private
  222. * The address of the pool the pair was allocated from is stored
  223. * in bio2.bi_private
  224. */
  225. struct bio_pair {
  226. struct bio bio1, bio2;
  227. struct bio_vec bv1, bv2;
  228. atomic_t cnt;
  229. int error;
  230. };
  231. extern struct bio_pair *bio_split(struct bio *bi, mempool_t *pool,
  232. int first_sectors);
  233. extern mempool_t *bio_split_pool;
  234. extern void bio_pair_release(struct bio_pair *dbio);
  235. extern struct bio_set *bioset_create(int, int, int);
  236. extern void bioset_free(struct bio_set *);
  237. extern struct bio *bio_alloc(unsigned int __nocast, int);
  238. extern struct bio *bio_alloc_bioset(unsigned int __nocast, int, struct bio_set *);
  239. extern void bio_put(struct bio *);
  240. extern void bio_free(struct bio *, struct bio_set *);
  241. extern void bio_endio(struct bio *, unsigned int, int);
  242. struct request_queue;
  243. extern int bio_phys_segments(struct request_queue *, struct bio *);
  244. extern int bio_hw_segments(struct request_queue *, struct bio *);
  245. extern void __bio_clone(struct bio *, struct bio *);
  246. extern struct bio *bio_clone(struct bio *, unsigned int __nocast);
  247. extern void bio_init(struct bio *);
  248. extern int bio_add_page(struct bio *, struct page *, unsigned int,unsigned int);
  249. extern int bio_get_nr_vecs(struct block_device *);
  250. extern struct bio *bio_map_user(struct request_queue *, struct block_device *,
  251. unsigned long, unsigned int, int);
  252. struct sg_iovec;
  253. extern struct bio *bio_map_user_iov(struct request_queue *,
  254. struct block_device *,
  255. struct sg_iovec *, int, int);
  256. extern void bio_unmap_user(struct bio *);
  257. extern struct bio *bio_map_kern(struct request_queue *, void *, unsigned int,
  258. unsigned int);
  259. extern void bio_set_pages_dirty(struct bio *bio);
  260. extern void bio_check_pages_dirty(struct bio *bio);
  261. extern struct bio *bio_copy_user(struct request_queue *, unsigned long, unsigned int, int);
  262. extern int bio_uncopy_user(struct bio *);
  263. void zero_fill_bio(struct bio *bio);
  264. #ifdef CONFIG_HIGHMEM
  265. /*
  266. * remember to add offset! and never ever reenable interrupts between a
  267. * bvec_kmap_irq and bvec_kunmap_irq!!
  268. *
  269. * This function MUST be inlined - it plays with the CPU interrupt flags.
  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, KM_BIO_SRC_IRQ);
  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, KM_BIO_SRC_IRQ);
  287. local_irq_restore(*flags);
  288. }
  289. #else
  290. #define bvec_kmap_irq(bvec, flags) (page_address((bvec)->bv_page) + (bvec)->bv_offset)
  291. #define bvec_kunmap_irq(buf, flags) do { *(flags) = 0; } while (0)
  292. #endif
  293. static inline char *__bio_kmap_irq(struct bio *bio, unsigned short idx,
  294. unsigned long *flags)
  295. {
  296. return bvec_kmap_irq(bio_iovec_idx(bio, idx), flags);
  297. }
  298. #define __bio_kunmap_irq(buf, flags) bvec_kunmap_irq(buf, flags)
  299. #define bio_kmap_irq(bio, flags) \
  300. __bio_kmap_irq((bio), (bio)->bi_idx, (flags))
  301. #define bio_kunmap_irq(buf,flags) __bio_kunmap_irq(buf, flags)
  302. #endif /* __LINUX_BIO_H */