dm-io.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544
  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-core.h"
  8. #include <linux/device-mapper.h>
  9. #include <linux/bio.h>
  10. #include <linux/completion.h>
  11. #include <linux/mempool.h>
  12. #include <linux/module.h>
  13. #include <linux/sched.h>
  14. #include <linux/slab.h>
  15. #include <linux/dm-io.h>
  16. #define DM_MSG_PREFIX "io"
  17. #define DM_IO_MAX_REGIONS BITS_PER_LONG
  18. struct dm_io_client {
  19. mempool_t pool;
  20. struct bio_set bios;
  21. };
  22. /*
  23. * Aligning 'struct io' reduces the number of bits required to store
  24. * its address. Refer to store_io_and_region_in_bio() below.
  25. */
  26. struct io {
  27. unsigned long error_bits;
  28. atomic_t count;
  29. struct dm_io_client *client;
  30. io_notify_fn callback;
  31. void *context;
  32. void *vma_invalidate_address;
  33. unsigned long vma_invalidate_size;
  34. } __attribute__((aligned(DM_IO_MAX_REGIONS)));
  35. static struct kmem_cache *_dm_io_cache;
  36. /*
  37. * Create a client with mempool and bioset.
  38. */
  39. struct dm_io_client *dm_io_client_create(void)
  40. {
  41. struct dm_io_client *client;
  42. unsigned int min_ios = dm_get_reserved_bio_based_ios();
  43. int ret;
  44. client = kzalloc(sizeof(*client), GFP_KERNEL);
  45. if (!client)
  46. return ERR_PTR(-ENOMEM);
  47. ret = mempool_init_slab_pool(&client->pool, min_ios, _dm_io_cache);
  48. if (ret)
  49. goto bad;
  50. ret = bioset_init(&client->bios, min_ios, 0, BIOSET_NEED_BVECS);
  51. if (ret)
  52. goto bad;
  53. return client;
  54. bad:
  55. mempool_exit(&client->pool);
  56. kfree(client);
  57. return ERR_PTR(ret);
  58. }
  59. EXPORT_SYMBOL(dm_io_client_create);
  60. void dm_io_client_destroy(struct dm_io_client *client)
  61. {
  62. mempool_exit(&client->pool);
  63. bioset_exit(&client->bios);
  64. kfree(client);
  65. }
  66. EXPORT_SYMBOL(dm_io_client_destroy);
  67. /*-----------------------------------------------------------------
  68. * We need to keep track of which region a bio is doing io for.
  69. * To avoid a memory allocation to store just 5 or 6 bits, we
  70. * ensure the 'struct io' pointer is aligned so enough low bits are
  71. * always zero and then combine it with the region number directly in
  72. * bi_private.
  73. *---------------------------------------------------------------*/
  74. static void store_io_and_region_in_bio(struct bio *bio, struct io *io,
  75. unsigned int region)
  76. {
  77. if (unlikely(!IS_ALIGNED((unsigned long)io, DM_IO_MAX_REGIONS))) {
  78. DMCRIT("Unaligned struct io pointer %p", io);
  79. BUG();
  80. }
  81. bio->bi_private = (void *)((unsigned long)io | region);
  82. }
  83. static void retrieve_io_and_region_from_bio(struct bio *bio, struct io **io,
  84. unsigned int *region)
  85. {
  86. unsigned long val = (unsigned long)bio->bi_private;
  87. *io = (void *)(val & -(unsigned long)DM_IO_MAX_REGIONS);
  88. *region = val & (DM_IO_MAX_REGIONS - 1);
  89. }
  90. /*-----------------------------------------------------------------
  91. * We need an io object to keep track of the number of bios that
  92. * have been dispatched for a particular io.
  93. *---------------------------------------------------------------*/
  94. static void complete_io(struct io *io)
  95. {
  96. unsigned long error_bits = io->error_bits;
  97. io_notify_fn fn = io->callback;
  98. void *context = io->context;
  99. if (io->vma_invalidate_size)
  100. invalidate_kernel_vmap_range(io->vma_invalidate_address,
  101. io->vma_invalidate_size);
  102. mempool_free(io, &io->client->pool);
  103. fn(error_bits, context);
  104. }
  105. static void dec_count(struct io *io, unsigned int region, blk_status_t error)
  106. {
  107. if (error)
  108. set_bit(region, &io->error_bits);
  109. if (atomic_dec_and_test(&io->count))
  110. complete_io(io);
  111. }
  112. static void endio(struct bio *bio)
  113. {
  114. struct io *io;
  115. unsigned int region;
  116. blk_status_t error;
  117. if (bio->bi_status && bio_data_dir(bio) == READ)
  118. zero_fill_bio(bio);
  119. /*
  120. * The bio destructor in bio_put() may use the io object.
  121. */
  122. retrieve_io_and_region_from_bio(bio, &io, &region);
  123. error = bio->bi_status;
  124. bio_put(bio);
  125. dec_count(io, region, error);
  126. }
  127. /*-----------------------------------------------------------------
  128. * These little objects provide an abstraction for getting a new
  129. * destination page for io.
  130. *---------------------------------------------------------------*/
  131. struct dpages {
  132. void (*get_page)(struct dpages *dp,
  133. struct page **p, unsigned long *len, unsigned int *offset);
  134. void (*next_page)(struct dpages *dp);
  135. union {
  136. unsigned int context_u;
  137. struct bvec_iter context_bi;
  138. };
  139. void *context_ptr;
  140. void *vma_invalidate_address;
  141. unsigned long vma_invalidate_size;
  142. };
  143. /*
  144. * Functions for getting the pages from a list.
  145. */
  146. static void list_get_page(struct dpages *dp,
  147. struct page **p, unsigned long *len, unsigned int *offset)
  148. {
  149. unsigned int o = dp->context_u;
  150. struct page_list *pl = (struct page_list *) dp->context_ptr;
  151. *p = pl->page;
  152. *len = PAGE_SIZE - o;
  153. *offset = o;
  154. }
  155. static void list_next_page(struct dpages *dp)
  156. {
  157. struct page_list *pl = (struct page_list *) dp->context_ptr;
  158. dp->context_ptr = pl->next;
  159. dp->context_u = 0;
  160. }
  161. static void list_dp_init(struct dpages *dp, struct page_list *pl, unsigned int offset)
  162. {
  163. dp->get_page = list_get_page;
  164. dp->next_page = list_next_page;
  165. dp->context_u = offset;
  166. dp->context_ptr = pl;
  167. }
  168. /*
  169. * Functions for getting the pages from a bvec.
  170. */
  171. static void bio_get_page(struct dpages *dp, struct page **p,
  172. unsigned long *len, unsigned int *offset)
  173. {
  174. struct bio_vec bvec = bvec_iter_bvec((struct bio_vec *)dp->context_ptr,
  175. dp->context_bi);
  176. *p = bvec.bv_page;
  177. *len = bvec.bv_len;
  178. *offset = bvec.bv_offset;
  179. /* avoid figuring it out again in bio_next_page() */
  180. dp->context_bi.bi_sector = (sector_t)bvec.bv_len;
  181. }
  182. static void bio_next_page(struct dpages *dp)
  183. {
  184. unsigned int len = (unsigned int)dp->context_bi.bi_sector;
  185. bvec_iter_advance((struct bio_vec *)dp->context_ptr,
  186. &dp->context_bi, len);
  187. }
  188. static void bio_dp_init(struct dpages *dp, struct bio *bio)
  189. {
  190. dp->get_page = bio_get_page;
  191. dp->next_page = bio_next_page;
  192. /*
  193. * We just use bvec iterator to retrieve pages, so it is ok to
  194. * access the bvec table directly here
  195. */
  196. dp->context_ptr = bio->bi_io_vec;
  197. dp->context_bi = bio->bi_iter;
  198. }
  199. /*
  200. * Functions for getting the pages from a VMA.
  201. */
  202. static void vm_get_page(struct dpages *dp,
  203. struct page **p, unsigned long *len, unsigned int *offset)
  204. {
  205. *p = vmalloc_to_page(dp->context_ptr);
  206. *offset = dp->context_u;
  207. *len = PAGE_SIZE - dp->context_u;
  208. }
  209. static void vm_next_page(struct dpages *dp)
  210. {
  211. dp->context_ptr += PAGE_SIZE - dp->context_u;
  212. dp->context_u = 0;
  213. }
  214. static void vm_dp_init(struct dpages *dp, void *data)
  215. {
  216. dp->get_page = vm_get_page;
  217. dp->next_page = vm_next_page;
  218. dp->context_u = offset_in_page(data);
  219. dp->context_ptr = data;
  220. }
  221. /*
  222. * Functions for getting the pages from kernel memory.
  223. */
  224. static void km_get_page(struct dpages *dp, struct page **p, unsigned long *len,
  225. unsigned int *offset)
  226. {
  227. *p = virt_to_page(dp->context_ptr);
  228. *offset = dp->context_u;
  229. *len = PAGE_SIZE - dp->context_u;
  230. }
  231. static void km_next_page(struct dpages *dp)
  232. {
  233. dp->context_ptr += PAGE_SIZE - dp->context_u;
  234. dp->context_u = 0;
  235. }
  236. static void km_dp_init(struct dpages *dp, void *data)
  237. {
  238. dp->get_page = km_get_page;
  239. dp->next_page = km_next_page;
  240. dp->context_u = offset_in_page(data);
  241. dp->context_ptr = data;
  242. }
  243. /*-----------------------------------------------------------------
  244. * IO routines that accept a list of pages.
  245. *---------------------------------------------------------------*/
  246. static void do_region(const blk_opf_t opf, unsigned int region,
  247. struct dm_io_region *where, struct dpages *dp,
  248. struct io *io)
  249. {
  250. struct bio *bio;
  251. struct page *page;
  252. unsigned long len;
  253. unsigned int offset;
  254. unsigned int num_bvecs;
  255. sector_t remaining = where->count;
  256. struct request_queue *q = bdev_get_queue(where->bdev);
  257. sector_t num_sectors;
  258. unsigned int special_cmd_max_sectors;
  259. const enum req_op op = opf & REQ_OP_MASK;
  260. /*
  261. * Reject unsupported discard and write same requests.
  262. */
  263. if (op == REQ_OP_DISCARD)
  264. special_cmd_max_sectors = bdev_max_discard_sectors(where->bdev);
  265. else if (op == REQ_OP_WRITE_ZEROES)
  266. special_cmd_max_sectors = q->limits.max_write_zeroes_sectors;
  267. if ((op == REQ_OP_DISCARD || op == REQ_OP_WRITE_ZEROES) &&
  268. special_cmd_max_sectors == 0) {
  269. atomic_inc(&io->count);
  270. dec_count(io, region, BLK_STS_NOTSUPP);
  271. return;
  272. }
  273. /*
  274. * where->count may be zero if op holds a flush and we need to
  275. * send a zero-sized flush.
  276. */
  277. do {
  278. /*
  279. * Allocate a suitably sized-bio.
  280. */
  281. switch (op) {
  282. case REQ_OP_DISCARD:
  283. case REQ_OP_WRITE_ZEROES:
  284. num_bvecs = 0;
  285. break;
  286. default:
  287. num_bvecs = bio_max_segs(dm_sector_div_up(remaining,
  288. (PAGE_SIZE >> SECTOR_SHIFT)));
  289. }
  290. bio = bio_alloc_bioset(where->bdev, num_bvecs, opf, GFP_NOIO,
  291. &io->client->bios);
  292. bio->bi_iter.bi_sector = where->sector + (where->count - remaining);
  293. bio->bi_end_io = endio;
  294. store_io_and_region_in_bio(bio, io, region);
  295. if (op == REQ_OP_DISCARD || op == REQ_OP_WRITE_ZEROES) {
  296. num_sectors = min_t(sector_t, special_cmd_max_sectors, remaining);
  297. bio->bi_iter.bi_size = num_sectors << SECTOR_SHIFT;
  298. remaining -= num_sectors;
  299. } else while (remaining) {
  300. /*
  301. * Try and add as many pages as possible.
  302. */
  303. dp->get_page(dp, &page, &len, &offset);
  304. len = min(len, to_bytes(remaining));
  305. if (!bio_add_page(bio, page, len, offset))
  306. break;
  307. offset = 0;
  308. remaining -= to_sector(len);
  309. dp->next_page(dp);
  310. }
  311. atomic_inc(&io->count);
  312. submit_bio(bio);
  313. } while (remaining);
  314. }
  315. static void dispatch_io(blk_opf_t opf, unsigned int num_regions,
  316. struct dm_io_region *where, struct dpages *dp,
  317. struct io *io, int sync)
  318. {
  319. int i;
  320. struct dpages old_pages = *dp;
  321. BUG_ON(num_regions > DM_IO_MAX_REGIONS);
  322. if (sync)
  323. opf |= REQ_SYNC;
  324. /*
  325. * For multiple regions we need to be careful to rewind
  326. * the dp object for each call to do_region.
  327. */
  328. for (i = 0; i < num_regions; i++) {
  329. *dp = old_pages;
  330. if (where[i].count || (opf & REQ_PREFLUSH))
  331. do_region(opf, i, where + i, dp, io);
  332. }
  333. /*
  334. * Drop the extra reference that we were holding to avoid
  335. * the io being completed too early.
  336. */
  337. dec_count(io, 0, 0);
  338. }
  339. struct sync_io {
  340. unsigned long error_bits;
  341. struct completion wait;
  342. };
  343. static void sync_io_complete(unsigned long error, void *context)
  344. {
  345. struct sync_io *sio = context;
  346. sio->error_bits = error;
  347. complete(&sio->wait);
  348. }
  349. static int sync_io(struct dm_io_client *client, unsigned int num_regions,
  350. struct dm_io_region *where, blk_opf_t opf, struct dpages *dp,
  351. unsigned long *error_bits)
  352. {
  353. struct io *io;
  354. struct sync_io sio;
  355. if (num_regions > 1 && !op_is_write(opf)) {
  356. WARN_ON(1);
  357. return -EIO;
  358. }
  359. init_completion(&sio.wait);
  360. io = mempool_alloc(&client->pool, GFP_NOIO);
  361. io->error_bits = 0;
  362. atomic_set(&io->count, 1); /* see dispatch_io() */
  363. io->client = client;
  364. io->callback = sync_io_complete;
  365. io->context = &sio;
  366. io->vma_invalidate_address = dp->vma_invalidate_address;
  367. io->vma_invalidate_size = dp->vma_invalidate_size;
  368. dispatch_io(opf, num_regions, where, dp, io, 1);
  369. wait_for_completion_io(&sio.wait);
  370. if (error_bits)
  371. *error_bits = sio.error_bits;
  372. return sio.error_bits ? -EIO : 0;
  373. }
  374. static int async_io(struct dm_io_client *client, unsigned int num_regions,
  375. struct dm_io_region *where, blk_opf_t opf,
  376. struct dpages *dp, io_notify_fn fn, void *context)
  377. {
  378. struct io *io;
  379. if (num_regions > 1 && !op_is_write(opf)) {
  380. WARN_ON(1);
  381. fn(1, context);
  382. return -EIO;
  383. }
  384. io = mempool_alloc(&client->pool, GFP_NOIO);
  385. io->error_bits = 0;
  386. atomic_set(&io->count, 1); /* see dispatch_io() */
  387. io->client = client;
  388. io->callback = fn;
  389. io->context = context;
  390. io->vma_invalidate_address = dp->vma_invalidate_address;
  391. io->vma_invalidate_size = dp->vma_invalidate_size;
  392. dispatch_io(opf, num_regions, where, dp, io, 0);
  393. return 0;
  394. }
  395. static int dp_init(struct dm_io_request *io_req, struct dpages *dp,
  396. unsigned long size)
  397. {
  398. /* Set up dpages based on memory type */
  399. dp->vma_invalidate_address = NULL;
  400. dp->vma_invalidate_size = 0;
  401. switch (io_req->mem.type) {
  402. case DM_IO_PAGE_LIST:
  403. list_dp_init(dp, io_req->mem.ptr.pl, io_req->mem.offset);
  404. break;
  405. case DM_IO_BIO:
  406. bio_dp_init(dp, io_req->mem.ptr.bio);
  407. break;
  408. case DM_IO_VMA:
  409. flush_kernel_vmap_range(io_req->mem.ptr.vma, size);
  410. if ((io_req->bi_opf & REQ_OP_MASK) == REQ_OP_READ) {
  411. dp->vma_invalidate_address = io_req->mem.ptr.vma;
  412. dp->vma_invalidate_size = size;
  413. }
  414. vm_dp_init(dp, io_req->mem.ptr.vma);
  415. break;
  416. case DM_IO_KMEM:
  417. km_dp_init(dp, io_req->mem.ptr.addr);
  418. break;
  419. default:
  420. return -EINVAL;
  421. }
  422. return 0;
  423. }
  424. int dm_io(struct dm_io_request *io_req, unsigned int num_regions,
  425. struct dm_io_region *where, unsigned long *sync_error_bits)
  426. {
  427. int r;
  428. struct dpages dp;
  429. r = dp_init(io_req, &dp, (unsigned long)where->count << SECTOR_SHIFT);
  430. if (r)
  431. return r;
  432. if (!io_req->notify.fn)
  433. return sync_io(io_req->client, num_regions, where,
  434. io_req->bi_opf, &dp, sync_error_bits);
  435. return async_io(io_req->client, num_regions, where,
  436. io_req->bi_opf, &dp, io_req->notify.fn,
  437. io_req->notify.context);
  438. }
  439. EXPORT_SYMBOL(dm_io);
  440. int __init dm_io_init(void)
  441. {
  442. _dm_io_cache = KMEM_CACHE(io, 0);
  443. if (!_dm_io_cache)
  444. return -ENOMEM;
  445. return 0;
  446. }
  447. void dm_io_exit(void)
  448. {
  449. kmem_cache_destroy(_dm_io_cache);
  450. _dm_io_cache = NULL;
  451. }