dm-io.c 10 KB

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