dm-io.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474
  1. /*
  2. * Copyright (C) 2003 Sistina Software
  3. * Copyright (C) 2006 Red Hat GmbH
  4. *
  5. * This file is released under the GPL.
  6. */
  7. #include <linux/device-mapper.h>
  8. #include <linux/bio.h>
  9. #include <linux/mempool.h>
  10. #include <linux/module.h>
  11. #include <linux/sched.h>
  12. #include <linux/slab.h>
  13. #include <linux/dm-io.h>
  14. struct dm_io_client {
  15. mempool_t *pool;
  16. struct bio_set *bios;
  17. };
  18. /* FIXME: can we shrink this ? */
  19. struct io {
  20. unsigned long error_bits;
  21. unsigned long eopnotsupp_bits;
  22. atomic_t count;
  23. struct task_struct *sleeper;
  24. struct dm_io_client *client;
  25. io_notify_fn callback;
  26. void *context;
  27. };
  28. /*
  29. * io contexts are only dynamically allocated for asynchronous
  30. * io. Since async io is likely to be the majority of io we'll
  31. * have the same number of io contexts as bios! (FIXME: must reduce this).
  32. */
  33. static unsigned int pages_to_ios(unsigned int pages)
  34. {
  35. return 4 * pages; /* too many ? */
  36. }
  37. /*
  38. * Create a client with mempool and bioset.
  39. */
  40. struct dm_io_client *dm_io_client_create(unsigned num_pages)
  41. {
  42. unsigned ios = pages_to_ios(num_pages);
  43. struct dm_io_client *client;
  44. client = kmalloc(sizeof(*client), GFP_KERNEL);
  45. if (!client)
  46. return ERR_PTR(-ENOMEM);
  47. client->pool = mempool_create_kmalloc_pool(ios, sizeof(struct io));
  48. if (!client->pool)
  49. goto bad;
  50. client->bios = bioset_create(16, 0);
  51. if (!client->bios)
  52. goto bad;
  53. return client;
  54. bad:
  55. if (client->pool)
  56. mempool_destroy(client->pool);
  57. kfree(client);
  58. return ERR_PTR(-ENOMEM);
  59. }
  60. EXPORT_SYMBOL(dm_io_client_create);
  61. int dm_io_client_resize(unsigned num_pages, struct dm_io_client *client)
  62. {
  63. return mempool_resize(client->pool, pages_to_ios(num_pages),
  64. GFP_KERNEL);
  65. }
  66. EXPORT_SYMBOL(dm_io_client_resize);
  67. void dm_io_client_destroy(struct dm_io_client *client)
  68. {
  69. mempool_destroy(client->pool);
  70. bioset_free(client->bios);
  71. kfree(client);
  72. }
  73. EXPORT_SYMBOL(dm_io_client_destroy);
  74. /*-----------------------------------------------------------------
  75. * We need to keep track of which region a bio is doing io for.
  76. * In order to save a memory allocation we store this the last
  77. * bvec which we know is unused (blech).
  78. * XXX This is ugly and can OOPS with some configs... find another way.
  79. *---------------------------------------------------------------*/
  80. static inline void bio_set_region(struct bio *bio, unsigned region)
  81. {
  82. bio->bi_io_vec[bio->bi_max_vecs].bv_len = region;
  83. }
  84. static inline unsigned bio_get_region(struct bio *bio)
  85. {
  86. return bio->bi_io_vec[bio->bi_max_vecs].bv_len;
  87. }
  88. /*-----------------------------------------------------------------
  89. * We need an io object to keep track of the number of bios that
  90. * have been dispatched for a particular io.
  91. *---------------------------------------------------------------*/
  92. static void dec_count(struct io *io, unsigned int region, int error)
  93. {
  94. if (error) {
  95. set_bit(region, &io->error_bits);
  96. if (error == -EOPNOTSUPP)
  97. set_bit(region, &io->eopnotsupp_bits);
  98. }
  99. if (atomic_dec_and_test(&io->count)) {
  100. if (io->sleeper)
  101. wake_up_process(io->sleeper);
  102. else {
  103. unsigned long r = io->error_bits;
  104. io_notify_fn fn = io->callback;
  105. void *context = io->context;
  106. mempool_free(io, io->client->pool);
  107. fn(r, context);
  108. }
  109. }
  110. }
  111. static void endio(struct bio *bio, int error)
  112. {
  113. struct io *io;
  114. unsigned region;
  115. if (error && bio_data_dir(bio) == READ)
  116. zero_fill_bio(bio);
  117. /*
  118. * The bio destructor in bio_put() may use the io object.
  119. */
  120. io = bio->bi_private;
  121. region = bio_get_region(bio);
  122. bio->bi_max_vecs++;
  123. bio_put(bio);
  124. dec_count(io, region, error);
  125. }
  126. /*-----------------------------------------------------------------
  127. * These little objects provide an abstraction for getting a new
  128. * destination page for io.
  129. *---------------------------------------------------------------*/
  130. struct dpages {
  131. void (*get_page)(struct dpages *dp,
  132. struct page **p, unsigned long *len, unsigned *offset);
  133. void (*next_page)(struct dpages *dp);
  134. unsigned context_u;
  135. void *context_ptr;
  136. };
  137. /*
  138. * Functions for getting the pages from a list.
  139. */
  140. static void list_get_page(struct dpages *dp,
  141. struct page **p, unsigned long *len, unsigned *offset)
  142. {
  143. unsigned o = dp->context_u;
  144. struct page_list *pl = (struct page_list *) dp->context_ptr;
  145. *p = pl->page;
  146. *len = PAGE_SIZE - o;
  147. *offset = o;
  148. }
  149. static void list_next_page(struct dpages *dp)
  150. {
  151. struct page_list *pl = (struct page_list *) dp->context_ptr;
  152. dp->context_ptr = pl->next;
  153. dp->context_u = 0;
  154. }
  155. static void list_dp_init(struct dpages *dp, struct page_list *pl, unsigned offset)
  156. {
  157. dp->get_page = list_get_page;
  158. dp->next_page = list_next_page;
  159. dp->context_u = offset;
  160. dp->context_ptr = pl;
  161. }
  162. /*
  163. * Functions for getting the pages from a bvec.
  164. */
  165. static void bvec_get_page(struct dpages *dp,
  166. struct page **p, unsigned long *len, unsigned *offset)
  167. {
  168. struct bio_vec *bvec = (struct bio_vec *) dp->context_ptr;
  169. *p = bvec->bv_page;
  170. *len = bvec->bv_len;
  171. *offset = bvec->bv_offset;
  172. }
  173. static void bvec_next_page(struct dpages *dp)
  174. {
  175. struct bio_vec *bvec = (struct bio_vec *) dp->context_ptr;
  176. dp->context_ptr = bvec + 1;
  177. }
  178. static void bvec_dp_init(struct dpages *dp, struct bio_vec *bvec)
  179. {
  180. dp->get_page = bvec_get_page;
  181. dp->next_page = bvec_next_page;
  182. dp->context_ptr = bvec;
  183. }
  184. /*
  185. * Functions for getting the pages from a VMA.
  186. */
  187. static void vm_get_page(struct dpages *dp,
  188. struct page **p, unsigned long *len, unsigned *offset)
  189. {
  190. *p = vmalloc_to_page(dp->context_ptr);
  191. *offset = dp->context_u;
  192. *len = PAGE_SIZE - dp->context_u;
  193. }
  194. static void vm_next_page(struct dpages *dp)
  195. {
  196. dp->context_ptr += PAGE_SIZE - dp->context_u;
  197. dp->context_u = 0;
  198. }
  199. static void vm_dp_init(struct dpages *dp, void *data)
  200. {
  201. dp->get_page = vm_get_page;
  202. dp->next_page = vm_next_page;
  203. dp->context_u = ((unsigned long) data) & (PAGE_SIZE - 1);
  204. dp->context_ptr = data;
  205. }
  206. static void dm_bio_destructor(struct bio *bio)
  207. {
  208. struct io *io = bio->bi_private;
  209. bio_free(bio, io->client->bios);
  210. }
  211. /*
  212. * Functions for getting the pages from kernel memory.
  213. */
  214. static void km_get_page(struct dpages *dp, struct page **p, unsigned long *len,
  215. unsigned *offset)
  216. {
  217. *p = virt_to_page(dp->context_ptr);
  218. *offset = dp->context_u;
  219. *len = PAGE_SIZE - dp->context_u;
  220. }
  221. static void km_next_page(struct dpages *dp)
  222. {
  223. dp->context_ptr += PAGE_SIZE - dp->context_u;
  224. dp->context_u = 0;
  225. }
  226. static void km_dp_init(struct dpages *dp, void *data)
  227. {
  228. dp->get_page = km_get_page;
  229. dp->next_page = km_next_page;
  230. dp->context_u = ((unsigned long) data) & (PAGE_SIZE - 1);
  231. dp->context_ptr = data;
  232. }
  233. /*-----------------------------------------------------------------
  234. * IO routines that accept a list of pages.
  235. *---------------------------------------------------------------*/
  236. static void do_region(int rw, unsigned region, struct dm_io_region *where,
  237. struct dpages *dp, struct io *io)
  238. {
  239. struct bio *bio;
  240. struct page *page;
  241. unsigned long len;
  242. unsigned offset;
  243. unsigned num_bvecs;
  244. sector_t remaining = where->count;
  245. while (remaining) {
  246. /*
  247. * Allocate a suitably sized-bio: we add an extra
  248. * bvec for bio_get/set_region() and decrement bi_max_vecs
  249. * to hide it from bio_add_page().
  250. */
  251. num_bvecs = dm_sector_div_up(remaining,
  252. (PAGE_SIZE >> SECTOR_SHIFT));
  253. num_bvecs = 1 + min_t(int, bio_get_nr_vecs(where->bdev),
  254. num_bvecs);
  255. if (unlikely(num_bvecs > BIO_MAX_PAGES))
  256. num_bvecs = BIO_MAX_PAGES;
  257. bio = bio_alloc_bioset(GFP_NOIO, num_bvecs, io->client->bios);
  258. bio->bi_sector = where->sector + (where->count - remaining);
  259. bio->bi_bdev = where->bdev;
  260. bio->bi_end_io = endio;
  261. bio->bi_private = io;
  262. bio->bi_destructor = dm_bio_destructor;
  263. bio->bi_max_vecs--;
  264. bio_set_region(bio, region);
  265. /*
  266. * Try and add as many pages as possible.
  267. */
  268. while (remaining) {
  269. dp->get_page(dp, &page, &len, &offset);
  270. len = min(len, to_bytes(remaining));
  271. if (!bio_add_page(bio, page, len, offset))
  272. break;
  273. offset = 0;
  274. remaining -= to_sector(len);
  275. dp->next_page(dp);
  276. }
  277. atomic_inc(&io->count);
  278. submit_bio(rw, bio);
  279. }
  280. }
  281. static void dispatch_io(int rw, unsigned int num_regions,
  282. struct dm_io_region *where, struct dpages *dp,
  283. struct io *io, int sync)
  284. {
  285. int i;
  286. struct dpages old_pages = *dp;
  287. if (sync)
  288. rw |= (1 << BIO_RW_SYNCIO) | (1 << BIO_RW_UNPLUG);
  289. /*
  290. * For multiple regions we need to be careful to rewind
  291. * the dp object for each call to do_region.
  292. */
  293. for (i = 0; i < num_regions; i++) {
  294. *dp = old_pages;
  295. if (where[i].count)
  296. do_region(rw, i, where + i, dp, io);
  297. }
  298. /*
  299. * Drop the extra reference that we were holding to avoid
  300. * the io being completed too early.
  301. */
  302. dec_count(io, 0, 0);
  303. }
  304. static int sync_io(struct dm_io_client *client, unsigned int num_regions,
  305. struct dm_io_region *where, int rw, struct dpages *dp,
  306. unsigned long *error_bits)
  307. {
  308. struct io io;
  309. if (num_regions > 1 && (rw & RW_MASK) != WRITE) {
  310. WARN_ON(1);
  311. return -EIO;
  312. }
  313. retry:
  314. io.error_bits = 0;
  315. io.eopnotsupp_bits = 0;
  316. atomic_set(&io.count, 1); /* see dispatch_io() */
  317. io.sleeper = current;
  318. io.client = client;
  319. dispatch_io(rw, num_regions, where, dp, &io, 1);
  320. while (1) {
  321. set_current_state(TASK_UNINTERRUPTIBLE);
  322. if (!atomic_read(&io.count))
  323. break;
  324. io_schedule();
  325. }
  326. set_current_state(TASK_RUNNING);
  327. if (io.eopnotsupp_bits && (rw & (1 << BIO_RW_BARRIER))) {
  328. rw &= ~(1 << BIO_RW_BARRIER);
  329. goto retry;
  330. }
  331. if (error_bits)
  332. *error_bits = io.error_bits;
  333. return io.error_bits ? -EIO : 0;
  334. }
  335. static int async_io(struct dm_io_client *client, unsigned int num_regions,
  336. struct dm_io_region *where, int rw, struct dpages *dp,
  337. io_notify_fn fn, void *context)
  338. {
  339. struct io *io;
  340. if (num_regions > 1 && (rw & RW_MASK) != WRITE) {
  341. WARN_ON(1);
  342. fn(1, context);
  343. return -EIO;
  344. }
  345. io = mempool_alloc(client->pool, GFP_NOIO);
  346. io->error_bits = 0;
  347. io->eopnotsupp_bits = 0;
  348. atomic_set(&io->count, 1); /* see dispatch_io() */
  349. io->sleeper = NULL;
  350. io->client = client;
  351. io->callback = fn;
  352. io->context = context;
  353. dispatch_io(rw, num_regions, where, dp, io, 0);
  354. return 0;
  355. }
  356. static int dp_init(struct dm_io_request *io_req, struct dpages *dp)
  357. {
  358. /* Set up dpages based on memory type */
  359. switch (io_req->mem.type) {
  360. case DM_IO_PAGE_LIST:
  361. list_dp_init(dp, io_req->mem.ptr.pl, io_req->mem.offset);
  362. break;
  363. case DM_IO_BVEC:
  364. bvec_dp_init(dp, io_req->mem.ptr.bvec);
  365. break;
  366. case DM_IO_VMA:
  367. vm_dp_init(dp, io_req->mem.ptr.vma);
  368. break;
  369. case DM_IO_KMEM:
  370. km_dp_init(dp, io_req->mem.ptr.addr);
  371. break;
  372. default:
  373. return -EINVAL;
  374. }
  375. return 0;
  376. }
  377. /*
  378. * New collapsed (a)synchronous interface.
  379. *
  380. * If the IO is asynchronous (i.e. it has notify.fn), you must either unplug
  381. * the queue with blk_unplug() some time later or set the BIO_RW_SYNC bit in
  382. * io_req->bi_rw. If you fail to do one of these, the IO will be submitted to
  383. * the disk after q->unplug_delay, which defaults to 3ms in blk-settings.c.
  384. */
  385. int dm_io(struct dm_io_request *io_req, unsigned num_regions,
  386. struct dm_io_region *where, unsigned long *sync_error_bits)
  387. {
  388. int r;
  389. struct dpages dp;
  390. r = dp_init(io_req, &dp);
  391. if (r)
  392. return r;
  393. if (!io_req->notify.fn)
  394. return sync_io(io_req->client, num_regions, where,
  395. io_req->bi_rw, &dp, sync_error_bits);
  396. return async_io(io_req->client, num_regions, where, io_req->bi_rw,
  397. &dp, io_req->notify.fn, io_req->notify.context);
  398. }
  399. EXPORT_SYMBOL(dm_io);