dm thin: avoid metadata commit if a pool's thin devices haven't changed
[deliverable/linux.git] / drivers / md / dm-io.c
CommitLineData
1da177e4
LT
1/*
2 * Copyright (C) 2003 Sistina Software
891ce207 3 * Copyright (C) 2006 Red Hat GmbH
1da177e4
LT
4 *
5 * This file is released under the GPL.
6 */
7
952b3557
MP
8#include "dm.h"
9
586e80e6 10#include <linux/device-mapper.h>
1da177e4
LT
11
12#include <linux/bio.h>
13#include <linux/mempool.h>
14#include <linux/module.h>
15#include <linux/sched.h>
16#include <linux/slab.h>
a765e20e 17#include <linux/dm-io.h>
1da177e4 18
f1e53987
MP
19#define DM_MSG_PREFIX "io"
20
21#define DM_IO_MAX_REGIONS BITS_PER_LONG
22
891ce207
HM
23struct dm_io_client {
24 mempool_t *pool;
25 struct bio_set *bios;
26};
27
f1e53987
MP
28/*
29 * Aligning 'struct io' reduces the number of bits required to store
30 * its address. Refer to store_io_and_region_in_bio() below.
31 */
1da177e4 32struct io {
e01fd7ee 33 unsigned long error_bits;
1da177e4
LT
34 atomic_t count;
35 struct task_struct *sleeper;
891ce207 36 struct dm_io_client *client;
1da177e4
LT
37 io_notify_fn callback;
38 void *context;
bb91bc7b
MP
39 void *vma_invalidate_address;
40 unsigned long vma_invalidate_size;
f1e53987 41} __attribute__((aligned(DM_IO_MAX_REGIONS)));
1da177e4 42
952b3557
MP
43static struct kmem_cache *_dm_io_cache;
44
c8b03afe
HM
45/*
46 * Create a client with mempool and bioset.
47 */
bda8efec 48struct dm_io_client *dm_io_client_create(void)
c8b03afe 49{
c8b03afe 50 struct dm_io_client *client;
e8603136 51 unsigned min_ios = dm_get_reserved_bio_based_ios();
c8b03afe
HM
52
53 client = kmalloc(sizeof(*client), GFP_KERNEL);
54 if (!client)
55 return ERR_PTR(-ENOMEM);
56
e8603136 57 client->pool = mempool_create_slab_pool(min_ios, _dm_io_cache);
c8b03afe
HM
58 if (!client->pool)
59 goto bad;
60
e8603136 61 client->bios = bioset_create(min_ios, 0);
c8b03afe
HM
62 if (!client->bios)
63 goto bad;
64
65 return client;
66
67 bad:
68 if (client->pool)
69 mempool_destroy(client->pool);
70 kfree(client);
71 return ERR_PTR(-ENOMEM);
72}
73EXPORT_SYMBOL(dm_io_client_create);
74
c8b03afe
HM
75void dm_io_client_destroy(struct dm_io_client *client)
76{
77 mempool_destroy(client->pool);
78 bioset_free(client->bios);
79 kfree(client);
80}
81EXPORT_SYMBOL(dm_io_client_destroy);
82
1da177e4
LT
83/*-----------------------------------------------------------------
84 * We need to keep track of which region a bio is doing io for.
f1e53987
MP
85 * To avoid a memory allocation to store just 5 or 6 bits, we
86 * ensure the 'struct io' pointer is aligned so enough low bits are
87 * always zero and then combine it with the region number directly in
88 * bi_private.
1da177e4 89 *---------------------------------------------------------------*/
f1e53987
MP
90static void store_io_and_region_in_bio(struct bio *bio, struct io *io,
91 unsigned region)
1da177e4 92{
f1e53987
MP
93 if (unlikely(!IS_ALIGNED((unsigned long)io, DM_IO_MAX_REGIONS))) {
94 DMCRIT("Unaligned struct io pointer %p", io);
95 BUG();
96 }
97
98 bio->bi_private = (void *)((unsigned long)io | region);
1da177e4
LT
99}
100
f1e53987
MP
101static void retrieve_io_and_region_from_bio(struct bio *bio, struct io **io,
102 unsigned *region)
1da177e4 103{
f1e53987
MP
104 unsigned long val = (unsigned long)bio->bi_private;
105
106 *io = (void *)(val & -(unsigned long)DM_IO_MAX_REGIONS);
107 *region = val & (DM_IO_MAX_REGIONS - 1);
1da177e4
LT
108}
109
110/*-----------------------------------------------------------------
111 * We need an io object to keep track of the number of bios that
112 * have been dispatched for a particular io.
113 *---------------------------------------------------------------*/
114static void dec_count(struct io *io, unsigned int region, int error)
115{
d87f4c14 116 if (error)
e01fd7ee 117 set_bit(region, &io->error_bits);
1da177e4
LT
118
119 if (atomic_dec_and_test(&io->count)) {
bb91bc7b
MP
120 if (io->vma_invalidate_size)
121 invalidate_kernel_vmap_range(io->vma_invalidate_address,
122 io->vma_invalidate_size);
123
1da177e4
LT
124 if (io->sleeper)
125 wake_up_process(io->sleeper);
126
127 else {
e01fd7ee 128 unsigned long r = io->error_bits;
1da177e4
LT
129 io_notify_fn fn = io->callback;
130 void *context = io->context;
131
bf17ce3a 132 mempool_free(io, io->client->pool);
1da177e4
LT
133 fn(r, context);
134 }
135 }
136}
137
6712ecf8 138static void endio(struct bio *bio, int error)
1da177e4 139{
c897feb3
HM
140 struct io *io;
141 unsigned region;
1da177e4 142
1da177e4
LT
143 if (error && bio_data_dir(bio) == READ)
144 zero_fill_bio(bio);
145
c897feb3
HM
146 /*
147 * The bio destructor in bio_put() may use the io object.
148 */
f1e53987 149 retrieve_io_and_region_from_bio(bio, &io, &region);
c897feb3 150
1da177e4
LT
151 bio_put(bio);
152
c897feb3 153 dec_count(io, region, error);
1da177e4
LT
154}
155
156/*-----------------------------------------------------------------
157 * These little objects provide an abstraction for getting a new
158 * destination page for io.
159 *---------------------------------------------------------------*/
160struct dpages {
161 void (*get_page)(struct dpages *dp,
162 struct page **p, unsigned long *len, unsigned *offset);
163 void (*next_page)(struct dpages *dp);
164
165 unsigned context_u;
166 void *context_ptr;
bb91bc7b
MP
167
168 void *vma_invalidate_address;
169 unsigned long vma_invalidate_size;
1da177e4
LT
170};
171
172/*
173 * Functions for getting the pages from a list.
174 */
175static void list_get_page(struct dpages *dp,
176 struct page **p, unsigned long *len, unsigned *offset)
177{
178 unsigned o = dp->context_u;
179 struct page_list *pl = (struct page_list *) dp->context_ptr;
180
181 *p = pl->page;
182 *len = PAGE_SIZE - o;
183 *offset = o;
184}
185
186static void list_next_page(struct dpages *dp)
187{
188 struct page_list *pl = (struct page_list *) dp->context_ptr;
189 dp->context_ptr = pl->next;
190 dp->context_u = 0;
191}
192
193static void list_dp_init(struct dpages *dp, struct page_list *pl, unsigned offset)
194{
195 dp->get_page = list_get_page;
196 dp->next_page = list_next_page;
197 dp->context_u = offset;
198 dp->context_ptr = pl;
199}
200
201/*
202 * Functions for getting the pages from a bvec.
203 */
003b5c57 204static void bio_get_page(struct dpages *dp,
1da177e4
LT
205 struct page **p, unsigned long *len, unsigned *offset)
206{
003b5c57
KO
207 struct bio *bio = dp->context_ptr;
208 struct bio_vec bvec = bio_iovec(bio);
209 *p = bvec.bv_page;
210 *len = bvec.bv_len;
211 *offset = bvec.bv_offset;
1da177e4
LT
212}
213
003b5c57 214static void bio_next_page(struct dpages *dp)
1da177e4 215{
003b5c57
KO
216 struct bio *bio = dp->context_ptr;
217 struct bio_vec bvec = bio_iovec(bio);
218
219 bio_advance(bio, bvec.bv_len);
1da177e4
LT
220}
221
003b5c57 222static void bio_dp_init(struct dpages *dp, struct bio *bio)
1da177e4 223{
003b5c57
KO
224 dp->get_page = bio_get_page;
225 dp->next_page = bio_next_page;
226 dp->context_ptr = bio;
1da177e4
LT
227}
228
c8b03afe
HM
229/*
230 * Functions for getting the pages from a VMA.
231 */
1da177e4
LT
232static void vm_get_page(struct dpages *dp,
233 struct page **p, unsigned long *len, unsigned *offset)
234{
235 *p = vmalloc_to_page(dp->context_ptr);
236 *offset = dp->context_u;
237 *len = PAGE_SIZE - dp->context_u;
238}
239
240static void vm_next_page(struct dpages *dp)
241{
242 dp->context_ptr += PAGE_SIZE - dp->context_u;
243 dp->context_u = 0;
244}
245
246static void vm_dp_init(struct dpages *dp, void *data)
247{
248 dp->get_page = vm_get_page;
249 dp->next_page = vm_next_page;
250 dp->context_u = ((unsigned long) data) & (PAGE_SIZE - 1);
251 dp->context_ptr = data;
252}
253
c8b03afe
HM
254/*
255 * Functions for getting the pages from kernel memory.
256 */
257static void km_get_page(struct dpages *dp, struct page **p, unsigned long *len,
258 unsigned *offset)
259{
260 *p = virt_to_page(dp->context_ptr);
261 *offset = dp->context_u;
262 *len = PAGE_SIZE - dp->context_u;
263}
264
265static void km_next_page(struct dpages *dp)
266{
267 dp->context_ptr += PAGE_SIZE - dp->context_u;
268 dp->context_u = 0;
269}
270
271static void km_dp_init(struct dpages *dp, void *data)
272{
273 dp->get_page = km_get_page;
274 dp->next_page = km_next_page;
275 dp->context_u = ((unsigned long) data) & (PAGE_SIZE - 1);
276 dp->context_ptr = data;
277}
278
1da177e4
LT
279/*-----------------------------------------------------------------
280 * IO routines that accept a list of pages.
281 *---------------------------------------------------------------*/
22a1ceb1 282static void do_region(int rw, unsigned region, struct dm_io_region *where,
1da177e4
LT
283 struct dpages *dp, struct io *io)
284{
285 struct bio *bio;
286 struct page *page;
287 unsigned long len;
288 unsigned offset;
289 unsigned num_bvecs;
290 sector_t remaining = where->count;
0c535e0d 291 struct request_queue *q = bdev_get_queue(where->bdev);
70d6c400
MS
292 unsigned short logical_block_size = queue_logical_block_size(q);
293 sector_t num_sectors;
1da177e4 294
12fc0f49 295 /*
d87f4c14
TH
296 * where->count may be zero if rw holds a flush and we need to
297 * send a zero-sized flush.
12fc0f49
MP
298 */
299 do {
1da177e4 300 /*
f1e53987 301 * Allocate a suitably sized-bio.
1da177e4 302 */
70d6c400 303 if ((rw & REQ_DISCARD) || (rw & REQ_WRITE_SAME))
0c535e0d
MB
304 num_bvecs = 1;
305 else
306 num_bvecs = min_t(int, bio_get_nr_vecs(where->bdev),
307 dm_sector_div_up(remaining, (PAGE_SIZE >> SECTOR_SHIFT)));
308
bf17ce3a 309 bio = bio_alloc_bioset(GFP_NOIO, num_bvecs, io->client->bios);
4f024f37 310 bio->bi_iter.bi_sector = where->sector + (where->count - remaining);
1da177e4
LT
311 bio->bi_bdev = where->bdev;
312 bio->bi_end_io = endio;
f1e53987 313 store_io_and_region_in_bio(bio, io, region);
1da177e4 314
0c535e0d 315 if (rw & REQ_DISCARD) {
70d6c400 316 num_sectors = min_t(sector_t, q->limits.max_discard_sectors, remaining);
4f024f37 317 bio->bi_iter.bi_size = num_sectors << SECTOR_SHIFT;
70d6c400
MS
318 remaining -= num_sectors;
319 } else if (rw & REQ_WRITE_SAME) {
320 /*
321 * WRITE SAME only uses a single page.
322 */
323 dp->get_page(dp, &page, &len, &offset);
324 bio_add_page(bio, page, logical_block_size, offset);
325 num_sectors = min_t(sector_t, q->limits.max_write_same_sectors, remaining);
4f024f37 326 bio->bi_iter.bi_size = num_sectors << SECTOR_SHIFT;
70d6c400
MS
327
328 offset = 0;
329 remaining -= num_sectors;
330 dp->next_page(dp);
0c535e0d
MB
331 } else while (remaining) {
332 /*
333 * Try and add as many pages as possible.
334 */
1da177e4
LT
335 dp->get_page(dp, &page, &len, &offset);
336 len = min(len, to_bytes(remaining));
337 if (!bio_add_page(bio, page, len, offset))
338 break;
339
340 offset = 0;
341 remaining -= to_sector(len);
342 dp->next_page(dp);
343 }
344
345 atomic_inc(&io->count);
346 submit_bio(rw, bio);
12fc0f49 347 } while (remaining);
1da177e4
LT
348}
349
350static void dispatch_io(int rw, unsigned int num_regions,
22a1ceb1 351 struct dm_io_region *where, struct dpages *dp,
1da177e4
LT
352 struct io *io, int sync)
353{
354 int i;
355 struct dpages old_pages = *dp;
356
f1e53987
MP
357 BUG_ON(num_regions > DM_IO_MAX_REGIONS);
358
1da177e4 359 if (sync)
721a9602 360 rw |= REQ_SYNC;
1da177e4
LT
361
362 /*
363 * For multiple regions we need to be careful to rewind
364 * the dp object for each call to do_region.
365 */
366 for (i = 0; i < num_regions; i++) {
367 *dp = old_pages;
d87f4c14 368 if (where[i].count || (rw & REQ_FLUSH))
1da177e4
LT
369 do_region(rw, i, where + i, dp, io);
370 }
371
372 /*
f00b16ad 373 * Drop the extra reference that we were holding to avoid
1da177e4
LT
374 * the io being completed too early.
375 */
376 dec_count(io, 0, 0);
377}
378
891ce207 379static int sync_io(struct dm_io_client *client, unsigned int num_regions,
22a1ceb1 380 struct dm_io_region *where, int rw, struct dpages *dp,
891ce207 381 unsigned long *error_bits)
1da177e4 382{
f1e53987
MP
383 /*
384 * gcc <= 4.3 can't do the alignment for stack variables, so we must
385 * align it on our own.
386 * volatile prevents the optimizer from removing or reusing
387 * "io_" field from the stack frame (allowed in ANSI C).
388 */
389 volatile char io_[sizeof(struct io) + __alignof__(struct io) - 1];
390 struct io *io = (struct io *)PTR_ALIGN(&io_, __alignof__(struct io));
1da177e4 391
7ff14a36 392 if (num_regions > 1 && (rw & RW_MASK) != WRITE) {
1da177e4
LT
393 WARN_ON(1);
394 return -EIO;
395 }
396
f1e53987 397 io->error_bits = 0;
f1e53987
MP
398 atomic_set(&io->count, 1); /* see dispatch_io() */
399 io->sleeper = current;
400 io->client = client;
1da177e4 401
bb91bc7b
MP
402 io->vma_invalidate_address = dp->vma_invalidate_address;
403 io->vma_invalidate_size = dp->vma_invalidate_size;
404
f1e53987 405 dispatch_io(rw, num_regions, where, dp, io, 1);
1da177e4
LT
406
407 while (1) {
408 set_current_state(TASK_UNINTERRUPTIBLE);
409
f1e53987 410 if (!atomic_read(&io->count))
1da177e4
LT
411 break;
412
413 io_schedule();
414 }
415 set_current_state(TASK_RUNNING);
416
891ce207 417 if (error_bits)
f1e53987 418 *error_bits = io->error_bits;
891ce207 419
f1e53987 420 return io->error_bits ? -EIO : 0;
1da177e4
LT
421}
422
891ce207 423static int async_io(struct dm_io_client *client, unsigned int num_regions,
22a1ceb1 424 struct dm_io_region *where, int rw, struct dpages *dp,
891ce207 425 io_notify_fn fn, void *context)
1da177e4
LT
426{
427 struct io *io;
428
7ff14a36 429 if (num_regions > 1 && (rw & RW_MASK) != WRITE) {
1da177e4
LT
430 WARN_ON(1);
431 fn(1, context);
432 return -EIO;
433 }
434
bf17ce3a 435 io = mempool_alloc(client->pool, GFP_NOIO);
e01fd7ee 436 io->error_bits = 0;
1da177e4
LT
437 atomic_set(&io->count, 1); /* see dispatch_io() */
438 io->sleeper = NULL;
891ce207 439 io->client = client;
1da177e4
LT
440 io->callback = fn;
441 io->context = context;
442
bb91bc7b
MP
443 io->vma_invalidate_address = dp->vma_invalidate_address;
444 io->vma_invalidate_size = dp->vma_invalidate_size;
445
1da177e4
LT
446 dispatch_io(rw, num_regions, where, dp, io, 0);
447 return 0;
448}
449
bb91bc7b
MP
450static int dp_init(struct dm_io_request *io_req, struct dpages *dp,
451 unsigned long size)
c8b03afe
HM
452{
453 /* Set up dpages based on memory type */
bb91bc7b
MP
454
455 dp->vma_invalidate_address = NULL;
456 dp->vma_invalidate_size = 0;
457
c8b03afe
HM
458 switch (io_req->mem.type) {
459 case DM_IO_PAGE_LIST:
460 list_dp_init(dp, io_req->mem.ptr.pl, io_req->mem.offset);
461 break;
462
003b5c57
KO
463 case DM_IO_BIO:
464 bio_dp_init(dp, io_req->mem.ptr.bio);
c8b03afe
HM
465 break;
466
467 case DM_IO_VMA:
bb91bc7b
MP
468 flush_kernel_vmap_range(io_req->mem.ptr.vma, size);
469 if ((io_req->bi_rw & RW_MASK) == READ) {
470 dp->vma_invalidate_address = io_req->mem.ptr.vma;
471 dp->vma_invalidate_size = size;
472 }
c8b03afe
HM
473 vm_dp_init(dp, io_req->mem.ptr.vma);
474 break;
475
476 case DM_IO_KMEM:
477 km_dp_init(dp, io_req->mem.ptr.addr);
478 break;
479
480 default:
481 return -EINVAL;
482 }
483
484 return 0;
485}
486
487/*
7ff14a36
MP
488 * New collapsed (a)synchronous interface.
489 *
490 * If the IO is asynchronous (i.e. it has notify.fn), you must either unplug
7b6d91da
CH
491 * the queue with blk_unplug() some time later or set REQ_SYNC in
492io_req->bi_rw. If you fail to do one of these, the IO will be submitted to
7ff14a36 493 * the disk after q->unplug_delay, which defaults to 3ms in blk-settings.c.
c8b03afe
HM
494 */
495int dm_io(struct dm_io_request *io_req, unsigned num_regions,
22a1ceb1 496 struct dm_io_region *where, unsigned long *sync_error_bits)
c8b03afe
HM
497{
498 int r;
499 struct dpages dp;
500
bb91bc7b 501 r = dp_init(io_req, &dp, (unsigned long)where->count << SECTOR_SHIFT);
c8b03afe
HM
502 if (r)
503 return r;
504
505 if (!io_req->notify.fn)
506 return sync_io(io_req->client, num_regions, where,
507 io_req->bi_rw, &dp, sync_error_bits);
508
509 return async_io(io_req->client, num_regions, where, io_req->bi_rw,
510 &dp, io_req->notify.fn, io_req->notify.context);
511}
512EXPORT_SYMBOL(dm_io);
952b3557
MP
513
514int __init dm_io_init(void)
515{
516 _dm_io_cache = KMEM_CACHE(io, 0);
517 if (!_dm_io_cache)
518 return -ENOMEM;
519
520 return 0;
521}
522
523void dm_io_exit(void)
524{
525 kmem_cache_destroy(_dm_io_cache);
526 _dm_io_cache = NULL;
527}
This page took 1.83461 seconds and 5 git commands to generate.