bio.h 16 KB

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