dm-io.c 11 KB

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