PageRenderTime 62ms CodeModel.GetById 31ms RepoModel.GetById 1ms app.codeStats 0ms

/drivers/md/dm-io.c

https://gitlab.com/webhaikal/SenseiRN3
C | 519 lines | 352 code | 85 blank | 82 comment | 39 complexity | 0da94b8e712ec6dfa23dc972e271ec18 MD5 | raw file
  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.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. #define MIN_IOS 16
  19. #define MIN_BIOS 16
  20. struct dm_io_client {
  21. mempool_t *pool;
  22. struct bio_set *bios;
  23. };
  24. /*
  25. * Aligning 'struct io' reduces the number of bits required to store
  26. * its address. Refer to store_io_and_region_in_bio() below.
  27. */
  28. struct io {
  29. unsigned long error_bits;
  30. atomic_t count;
  31. struct completion *wait;
  32. struct dm_io_client *client;
  33. io_notify_fn callback;
  34. void *context;
  35. void *vma_invalidate_address;
  36. unsigned long vma_invalidate_size;
  37. } __attribute__((aligned(DM_IO_MAX_REGIONS)));
  38. static struct kmem_cache *_dm_io_cache;
  39. /*
  40. * Create a client with mempool and bioset.
  41. */
  42. struct dm_io_client *dm_io_client_create(void)
  43. {
  44. struct dm_io_client *client;
  45. client = kmalloc(sizeof(*client), GFP_KERNEL);
  46. if (!client)
  47. return ERR_PTR(-ENOMEM);
  48. client->pool = mempool_create_slab_pool(MIN_IOS, _dm_io_cache);
  49. if (!client->pool)
  50. goto bad;
  51. client->bios = bioset_create(MIN_BIOS, 0);
  52. if (!client->bios)
  53. goto bad;
  54. return client;
  55. bad:
  56. if (client->pool)
  57. mempool_destroy(client->pool);
  58. kfree(client);
  59. return ERR_PTR(-ENOMEM);
  60. }
  61. EXPORT_SYMBOL(dm_io_client_create);
  62. void dm_io_client_destroy(struct dm_io_client *client)
  63. {
  64. mempool_destroy(client->pool);
  65. bioset_free(client->bios);
  66. kfree(client);
  67. }
  68. EXPORT_SYMBOL(dm_io_client_destroy);
  69. /*-----------------------------------------------------------------
  70. * We need to keep track of which region a bio is doing io for.
  71. * To avoid a memory allocation to store just 5 or 6 bits, we
  72. * ensure the 'struct io' pointer is aligned so enough low bits are
  73. * always zero and then combine it with the region number directly in
  74. * bi_private.
  75. *---------------------------------------------------------------*/
  76. static void store_io_and_region_in_bio(struct bio *bio, struct io *io,
  77. unsigned region)
  78. {
  79. if (unlikely(!IS_ALIGNED((unsigned long)io, DM_IO_MAX_REGIONS))) {
  80. DMCRIT("Unaligned struct io pointer %p", io);
  81. BUG();
  82. }
  83. bio->bi_private = (void *)((unsigned long)io | region);
  84. }
  85. static void retrieve_io_and_region_from_bio(struct bio *bio, struct io **io,
  86. unsigned *region)
  87. {
  88. unsigned long val = (unsigned long)bio->bi_private;
  89. *io = (void *)(val & -(unsigned long)DM_IO_MAX_REGIONS);
  90. *region = val & (DM_IO_MAX_REGIONS - 1);
  91. }
  92. /*-----------------------------------------------------------------
  93. * We need an io object to keep track of the number of bios that
  94. * have been dispatched for a particular io.
  95. *---------------------------------------------------------------*/
  96. static void dec_count(struct io *io, unsigned int region, int error)
  97. {
  98. if (error)
  99. set_bit(region, &io->error_bits);
  100. if (atomic_dec_and_test(&io->count)) {
  101. if (io->vma_invalidate_size)
  102. invalidate_kernel_vmap_range(io->vma_invalidate_address,
  103. io->vma_invalidate_size);
  104. if (io->wait)
  105. complete(io->wait);
  106. else {
  107. unsigned long r = io->error_bits;
  108. io_notify_fn fn = io->callback;
  109. void *context = io->context;
  110. mempool_free(io, io->client->pool);
  111. fn(r, context);
  112. }
  113. }
  114. }
  115. static void endio(struct bio *bio, int error)
  116. {
  117. struct io *io;
  118. unsigned region;
  119. if (error && bio_data_dir(bio) == READ)
  120. zero_fill_bio(bio);
  121. /*
  122. * The bio destructor in bio_put() may use the io object.
  123. */
  124. retrieve_io_and_region_from_bio(bio, &io, &region);
  125. bio_put(bio);
  126. dec_count(io, region, error);
  127. }
  128. /*-----------------------------------------------------------------
  129. * These little objects provide an abstraction for getting a new
  130. * destination page for io.
  131. *---------------------------------------------------------------*/
  132. struct dpages {
  133. void (*get_page)(struct dpages *dp,
  134. struct page **p, unsigned long *len, unsigned *offset);
  135. void (*next_page)(struct dpages *dp);
  136. unsigned context_u;
  137. void *context_ptr;
  138. void *vma_invalidate_address;
  139. unsigned long vma_invalidate_size;
  140. };
  141. /*
  142. * Functions for getting the pages from a list.
  143. */
  144. static void list_get_page(struct dpages *dp,
  145. struct page **p, unsigned long *len, unsigned *offset)
  146. {
  147. unsigned o = dp->context_u;
  148. struct page_list *pl = (struct page_list *) dp->context_ptr;
  149. *p = pl->page;
  150. *len = PAGE_SIZE - o;
  151. *offset = o;
  152. }
  153. static void list_next_page(struct dpages *dp)
  154. {
  155. struct page_list *pl = (struct page_list *) dp->context_ptr;
  156. dp->context_ptr = pl->next;
  157. dp->context_u = 0;
  158. }
  159. static void list_dp_init(struct dpages *dp, struct page_list *pl, unsigned offset)
  160. {
  161. dp->get_page = list_get_page;
  162. dp->next_page = list_next_page;
  163. dp->context_u = offset;
  164. dp->context_ptr = pl;
  165. }
  166. /*
  167. * Functions for getting the pages from a bvec.
  168. */
  169. static void bvec_get_page(struct dpages *dp,
  170. struct page **p, unsigned long *len, unsigned *offset)
  171. {
  172. struct bio_vec *bvec = (struct bio_vec *) dp->context_ptr;
  173. *p = bvec->bv_page;
  174. *len = bvec->bv_len;
  175. *offset = bvec->bv_offset;
  176. }
  177. static void bvec_next_page(struct dpages *dp)
  178. {
  179. struct bio_vec *bvec = (struct bio_vec *) dp->context_ptr;
  180. dp->context_ptr = bvec + 1;
  181. }
  182. static void bvec_dp_init(struct dpages *dp, struct bio_vec *bvec)
  183. {
  184. dp->get_page = bvec_get_page;
  185. dp->next_page = bvec_next_page;
  186. dp->context_ptr = bvec;
  187. }
  188. /*
  189. * Functions for getting the pages from a VMA.
  190. */
  191. static void vm_get_page(struct dpages *dp,
  192. struct page **p, unsigned long *len, unsigned *offset)
  193. {
  194. *p = vmalloc_to_page(dp->context_ptr);
  195. *offset = dp->context_u;
  196. *len = PAGE_SIZE - dp->context_u;
  197. }
  198. static void vm_next_page(struct dpages *dp)
  199. {
  200. dp->context_ptr += PAGE_SIZE - dp->context_u;
  201. dp->context_u = 0;
  202. }
  203. static void vm_dp_init(struct dpages *dp, void *data)
  204. {
  205. dp->get_page = vm_get_page;
  206. dp->next_page = vm_next_page;
  207. dp->context_u = ((unsigned long) data) & (PAGE_SIZE - 1);
  208. dp->context_ptr = data;
  209. }
  210. /*
  211. * Functions for getting the pages from kernel memory.
  212. */
  213. static void km_get_page(struct dpages *dp, struct page **p, unsigned long *len,
  214. unsigned *offset)
  215. {
  216. *p = virt_to_page(dp->context_ptr);
  217. *offset = dp->context_u;
  218. *len = PAGE_SIZE - dp->context_u;
  219. }
  220. static void km_next_page(struct dpages *dp)
  221. {
  222. dp->context_ptr += PAGE_SIZE - dp->context_u;
  223. dp->context_u = 0;
  224. }
  225. static void km_dp_init(struct dpages *dp, void *data)
  226. {
  227. dp->get_page = km_get_page;
  228. dp->next_page = km_next_page;
  229. dp->context_u = ((unsigned long) data) & (PAGE_SIZE - 1);
  230. dp->context_ptr = data;
  231. }
  232. /*-----------------------------------------------------------------
  233. * IO routines that accept a list of pages.
  234. *---------------------------------------------------------------*/
  235. static void do_region(int rw, unsigned region, struct dm_io_region *where,
  236. struct dpages *dp, struct io *io)
  237. {
  238. struct bio *bio;
  239. struct page *page;
  240. unsigned long len;
  241. unsigned offset;
  242. unsigned num_bvecs;
  243. sector_t remaining = where->count;
  244. struct request_queue *q = bdev_get_queue(where->bdev);
  245. unsigned short logical_block_size = queue_logical_block_size(q);
  246. sector_t num_sectors;
  247. /*
  248. * where->count may be zero if rw holds a flush and we need to
  249. * send a zero-sized flush.
  250. */
  251. do {
  252. /*
  253. * Allocate a suitably sized-bio.
  254. */
  255. if ((rw & REQ_DISCARD) || (rw & REQ_WRITE_SAME))
  256. num_bvecs = 1;
  257. else
  258. num_bvecs = min_t(int, bio_get_nr_vecs(where->bdev),
  259. dm_sector_div_up(remaining, (PAGE_SIZE >> SECTOR_SHIFT)));
  260. bio = bio_alloc_bioset(GFP_NOIO, num_bvecs, io->client->bios);
  261. bio->bi_sector = where->sector + (where->count - remaining);
  262. bio->bi_bdev = where->bdev;
  263. bio->bi_end_io = endio;
  264. store_io_and_region_in_bio(bio, io, region);
  265. if (rw & REQ_DISCARD) {
  266. num_sectors = min_t(sector_t, q->limits.max_discard_sectors, remaining);
  267. bio->bi_size = num_sectors << SECTOR_SHIFT;
  268. remaining -= num_sectors;
  269. } else if (rw & REQ_WRITE_SAME) {
  270. /*
  271. * WRITE SAME only uses a single page.
  272. */
  273. dp->get_page(dp, &page, &len, &offset);
  274. bio_add_page(bio, page, logical_block_size, offset);
  275. num_sectors = min_t(sector_t, q->limits.max_write_same_sectors, remaining);
  276. bio->bi_size = num_sectors << SECTOR_SHIFT;
  277. offset = 0;
  278. remaining -= num_sectors;
  279. dp->next_page(dp);
  280. } else while (remaining) {
  281. /*
  282. * Try and add as many pages as possible.
  283. */
  284. dp->get_page(dp, &page, &len, &offset);
  285. len = min(len, to_bytes(remaining));
  286. if (!bio_add_page(bio, page, len, offset))
  287. break;
  288. offset = 0;
  289. remaining -= to_sector(len);
  290. dp->next_page(dp);
  291. }
  292. atomic_inc(&io->count);
  293. submit_bio(rw, bio);
  294. } while (remaining);
  295. }
  296. static void dispatch_io(int rw, unsigned int num_regions,
  297. struct dm_io_region *where, struct dpages *dp,
  298. struct io *io, int sync)
  299. {
  300. int i;
  301. struct dpages old_pages = *dp;
  302. BUG_ON(num_regions > DM_IO_MAX_REGIONS);
  303. if (sync)
  304. rw |= REQ_SYNC;
  305. /*
  306. * For multiple regions we need to be careful to rewind
  307. * the dp object for each call to do_region.
  308. */
  309. for (i = 0; i < num_regions; i++) {
  310. *dp = old_pages;
  311. if (where[i].count || (rw & REQ_FLUSH))
  312. do_region(rw, i, where + i, dp, io);
  313. }
  314. /*
  315. * Drop the extra reference that we were holding to avoid
  316. * the io being completed too early.
  317. */
  318. dec_count(io, 0, 0);
  319. }
  320. static int sync_io(struct dm_io_client *client, unsigned int num_regions,
  321. struct dm_io_region *where, int rw, struct dpages *dp,
  322. unsigned long *error_bits)
  323. {
  324. /*
  325. * gcc <= 4.3 can't do the alignment for stack variables, so we must
  326. * align it on our own.
  327. * volatile prevents the optimizer from removing or reusing
  328. * "io_" field from the stack frame (allowed in ANSI C).
  329. */
  330. volatile char io_[sizeof(struct io) + __alignof__(struct io) - 1];
  331. struct io *io = (struct io *)PTR_ALIGN(&io_, __alignof__(struct io));
  332. DECLARE_COMPLETION_ONSTACK(wait);
  333. if (num_regions > 1 && (rw & RW_MASK) != WRITE) {
  334. WARN_ON(1);
  335. return -EIO;
  336. }
  337. io->error_bits = 0;
  338. atomic_set(&io->count, 1); /* see dispatch_io() */
  339. io->wait = &wait;
  340. io->client = client;
  341. io->vma_invalidate_address = dp->vma_invalidate_address;
  342. io->vma_invalidate_size = dp->vma_invalidate_size;
  343. dispatch_io(rw, num_regions, where, dp, io, 1);
  344. wait_for_completion_io(&wait);
  345. if (error_bits)
  346. *error_bits = io->error_bits;
  347. return io->error_bits ? -EIO : 0;
  348. }
  349. static int async_io(struct dm_io_client *client, unsigned int num_regions,
  350. struct dm_io_region *where, int rw, struct dpages *dp,
  351. io_notify_fn fn, void *context)
  352. {
  353. struct io *io;
  354. if (num_regions > 1 && (rw & RW_MASK) != WRITE) {
  355. WARN_ON(1);
  356. fn(1, context);
  357. return -EIO;
  358. }
  359. io = mempool_alloc(client->pool, GFP_NOIO);
  360. io->error_bits = 0;
  361. atomic_set(&io->count, 1); /* see dispatch_io() */
  362. io->wait = NULL;
  363. io->client = client;
  364. io->callback = fn;
  365. io->context = context;
  366. io->vma_invalidate_address = dp->vma_invalidate_address;
  367. io->vma_invalidate_size = dp->vma_invalidate_size;
  368. dispatch_io(rw, num_regions, where, dp, io, 0);
  369. return 0;
  370. }
  371. static int dp_init(struct dm_io_request *io_req, struct dpages *dp,
  372. unsigned long size)
  373. {
  374. /* Set up dpages based on memory type */
  375. dp->vma_invalidate_address = NULL;
  376. dp->vma_invalidate_size = 0;
  377. switch (io_req->mem.type) {
  378. case DM_IO_PAGE_LIST:
  379. list_dp_init(dp, io_req->mem.ptr.pl, io_req->mem.offset);
  380. break;
  381. case DM_IO_BVEC:
  382. bvec_dp_init(dp, io_req->mem.ptr.bvec);
  383. break;
  384. case DM_IO_VMA:
  385. flush_kernel_vmap_range(io_req->mem.ptr.vma, size);
  386. if ((io_req->bi_rw & RW_MASK) == READ) {
  387. dp->vma_invalidate_address = io_req->mem.ptr.vma;
  388. dp->vma_invalidate_size = size;
  389. }
  390. vm_dp_init(dp, io_req->mem.ptr.vma);
  391. break;
  392. case DM_IO_KMEM:
  393. km_dp_init(dp, io_req->mem.ptr.addr);
  394. break;
  395. default:
  396. return -EINVAL;
  397. }
  398. return 0;
  399. }
  400. /*
  401. * New collapsed (a)synchronous interface.
  402. *
  403. * If the IO is asynchronous (i.e. it has notify.fn), you must either unplug
  404. * the queue with blk_unplug() some time later or set REQ_SYNC in
  405. io_req->bi_rw. If you fail to do one of these, the IO will be submitted to
  406. * the disk after q->unplug_delay, which defaults to 3ms in blk-settings.c.
  407. */
  408. int dm_io(struct dm_io_request *io_req, unsigned num_regions,
  409. struct dm_io_region *where, unsigned long *sync_error_bits)
  410. {
  411. int r;
  412. struct dpages dp;
  413. r = dp_init(io_req, &dp, (unsigned long)where->count << SECTOR_SHIFT);
  414. if (r)
  415. return r;
  416. if (!io_req->notify.fn)
  417. return sync_io(io_req->client, num_regions, where,
  418. io_req->bi_rw, &dp, sync_error_bits);
  419. return async_io(io_req->client, num_regions, where, io_req->bi_rw,
  420. &dp, io_req->notify.fn, io_req->notify.context);
  421. }
  422. EXPORT_SYMBOL(dm_io);
  423. int __init dm_io_init(void)
  424. {
  425. _dm_io_cache = KMEM_CACHE(io, 0);
  426. if (!_dm_io_cache)
  427. return -ENOMEM;
  428. return 0;
  429. }
  430. void dm_io_exit(void)
  431. {
  432. kmem_cache_destroy(_dm_io_cache);
  433. _dm_io_cache = NULL;
  434. }