Loading...
1/*
2 * Copyright (C) 2001-2002 Sistina Software (UK) Limited.
3 * Copyright (C) 2006-2008 Red Hat GmbH
4 *
5 * This file is released under the GPL.
6 */
7
8#include "dm-exception-store.h"
9
10#include <linux/mm.h>
11#include <linux/pagemap.h>
12#include <linux/vmalloc.h>
13#include <linux/slab.h>
14#include <linux/dm-io.h>
15
16#define DM_MSG_PREFIX "persistent snapshot"
17#define DM_CHUNK_SIZE_DEFAULT_SECTORS 32 /* 16KB */
18
19/*-----------------------------------------------------------------
20 * Persistent snapshots, by persistent we mean that the snapshot
21 * will survive a reboot.
22 *---------------------------------------------------------------*/
23
24/*
25 * We need to store a record of which parts of the origin have
26 * been copied to the snapshot device. The snapshot code
27 * requires that we copy exception chunks to chunk aligned areas
28 * of the COW store. It makes sense therefore, to store the
29 * metadata in chunk size blocks.
30 *
31 * There is no backward or forward compatibility implemented,
32 * snapshots with different disk versions than the kernel will
33 * not be usable. It is expected that "lvcreate" will blank out
34 * the start of a fresh COW device before calling the snapshot
35 * constructor.
36 *
37 * The first chunk of the COW device just contains the header.
38 * After this there is a chunk filled with exception metadata,
39 * followed by as many exception chunks as can fit in the
40 * metadata areas.
41 *
42 * All on disk structures are in little-endian format. The end
43 * of the exceptions info is indicated by an exception with a
44 * new_chunk of 0, which is invalid since it would point to the
45 * header chunk.
46 */
47
48/*
49 * Magic for persistent snapshots: "SnAp" - Feeble isn't it.
50 */
51#define SNAP_MAGIC 0x70416e53
52
53/*
54 * The on-disk version of the metadata.
55 */
56#define SNAPSHOT_DISK_VERSION 1
57
58#define NUM_SNAPSHOT_HDR_CHUNKS 1
59
60struct disk_header {
61 __le32 magic;
62
63 /*
64 * Is this snapshot valid. There is no way of recovering
65 * an invalid snapshot.
66 */
67 __le32 valid;
68
69 /*
70 * Simple, incrementing version. no backward
71 * compatibility.
72 */
73 __le32 version;
74
75 /* In sectors */
76 __le32 chunk_size;
77} __packed;
78
79struct disk_exception {
80 __le64 old_chunk;
81 __le64 new_chunk;
82} __packed;
83
84struct core_exception {
85 uint64_t old_chunk;
86 uint64_t new_chunk;
87};
88
89struct commit_callback {
90 void (*callback)(void *, int success);
91 void *context;
92};
93
94/*
95 * The top level structure for a persistent exception store.
96 */
97struct pstore {
98 struct dm_exception_store *store;
99 int version;
100 int valid;
101 uint32_t exceptions_per_area;
102
103 /*
104 * Now that we have an asynchronous kcopyd there is no
105 * need for large chunk sizes, so it wont hurt to have a
106 * whole chunks worth of metadata in memory at once.
107 */
108 void *area;
109
110 /*
111 * An area of zeros used to clear the next area.
112 */
113 void *zero_area;
114
115 /*
116 * An area used for header. The header can be written
117 * concurrently with metadata (when invalidating the snapshot),
118 * so it needs a separate buffer.
119 */
120 void *header_area;
121
122 /*
123 * Used to keep track of which metadata area the data in
124 * 'chunk' refers to.
125 */
126 chunk_t current_area;
127
128 /*
129 * The next free chunk for an exception.
130 *
131 * When creating exceptions, all the chunks here and above are
132 * free. It holds the next chunk to be allocated. On rare
133 * occasions (e.g. after a system crash) holes can be left in
134 * the exception store because chunks can be committed out of
135 * order.
136 *
137 * When merging exceptions, it does not necessarily mean all the
138 * chunks here and above are free. It holds the value it would
139 * have held if all chunks had been committed in order of
140 * allocation. Consequently the value may occasionally be
141 * slightly too low, but since it's only used for 'status' and
142 * it can never reach its minimum value too early this doesn't
143 * matter.
144 */
145
146 chunk_t next_free;
147
148 /*
149 * The index of next free exception in the current
150 * metadata area.
151 */
152 uint32_t current_committed;
153
154 atomic_t pending_count;
155 uint32_t callback_count;
156 struct commit_callback *callbacks;
157 struct dm_io_client *io_client;
158
159 struct workqueue_struct *metadata_wq;
160};
161
162static int alloc_area(struct pstore *ps)
163{
164 int r = -ENOMEM;
165 size_t len;
166
167 len = ps->store->chunk_size << SECTOR_SHIFT;
168
169 /*
170 * Allocate the chunk_size block of memory that will hold
171 * a single metadata area.
172 */
173 ps->area = vmalloc(len);
174 if (!ps->area)
175 goto err_area;
176
177 ps->zero_area = vzalloc(len);
178 if (!ps->zero_area)
179 goto err_zero_area;
180
181 ps->header_area = vmalloc(len);
182 if (!ps->header_area)
183 goto err_header_area;
184
185 return 0;
186
187err_header_area:
188 vfree(ps->zero_area);
189
190err_zero_area:
191 vfree(ps->area);
192
193err_area:
194 return r;
195}
196
197static void free_area(struct pstore *ps)
198{
199 if (ps->area)
200 vfree(ps->area);
201 ps->area = NULL;
202
203 if (ps->zero_area)
204 vfree(ps->zero_area);
205 ps->zero_area = NULL;
206
207 if (ps->header_area)
208 vfree(ps->header_area);
209 ps->header_area = NULL;
210}
211
212struct mdata_req {
213 struct dm_io_region *where;
214 struct dm_io_request *io_req;
215 struct work_struct work;
216 int result;
217};
218
219static void do_metadata(struct work_struct *work)
220{
221 struct mdata_req *req = container_of(work, struct mdata_req, work);
222
223 req->result = dm_io(req->io_req, 1, req->where, NULL);
224}
225
226/*
227 * Read or write a chunk aligned and sized block of data from a device.
228 */
229static int chunk_io(struct pstore *ps, void *area, chunk_t chunk, int rw,
230 int metadata)
231{
232 struct dm_io_region where = {
233 .bdev = dm_snap_cow(ps->store->snap)->bdev,
234 .sector = ps->store->chunk_size * chunk,
235 .count = ps->store->chunk_size,
236 };
237 struct dm_io_request io_req = {
238 .bi_rw = rw,
239 .mem.type = DM_IO_VMA,
240 .mem.ptr.vma = area,
241 .client = ps->io_client,
242 .notify.fn = NULL,
243 };
244 struct mdata_req req;
245
246 if (!metadata)
247 return dm_io(&io_req, 1, &where, NULL);
248
249 req.where = &where;
250 req.io_req = &io_req;
251
252 /*
253 * Issue the synchronous I/O from a different thread
254 * to avoid generic_make_request recursion.
255 */
256 INIT_WORK_ONSTACK(&req.work, do_metadata);
257 queue_work(ps->metadata_wq, &req.work);
258 flush_work(&req.work);
259
260 return req.result;
261}
262
263/*
264 * Convert a metadata area index to a chunk index.
265 */
266static chunk_t area_location(struct pstore *ps, chunk_t area)
267{
268 return NUM_SNAPSHOT_HDR_CHUNKS + ((ps->exceptions_per_area + 1) * area);
269}
270
271/*
272 * Read or write a metadata area. Remembering to skip the first
273 * chunk which holds the header.
274 */
275static int area_io(struct pstore *ps, int rw)
276{
277 int r;
278 chunk_t chunk;
279
280 chunk = area_location(ps, ps->current_area);
281
282 r = chunk_io(ps, ps->area, chunk, rw, 0);
283 if (r)
284 return r;
285
286 return 0;
287}
288
289static void zero_memory_area(struct pstore *ps)
290{
291 memset(ps->area, 0, ps->store->chunk_size << SECTOR_SHIFT);
292}
293
294static int zero_disk_area(struct pstore *ps, chunk_t area)
295{
296 return chunk_io(ps, ps->zero_area, area_location(ps, area), WRITE, 0);
297}
298
299static int read_header(struct pstore *ps, int *new_snapshot)
300{
301 int r;
302 struct disk_header *dh;
303 unsigned chunk_size;
304 int chunk_size_supplied = 1;
305 char *chunk_err;
306
307 /*
308 * Use default chunk size (or logical_block_size, if larger)
309 * if none supplied
310 */
311 if (!ps->store->chunk_size) {
312 ps->store->chunk_size = max(DM_CHUNK_SIZE_DEFAULT_SECTORS,
313 bdev_logical_block_size(dm_snap_cow(ps->store->snap)->
314 bdev) >> 9);
315 ps->store->chunk_mask = ps->store->chunk_size - 1;
316 ps->store->chunk_shift = ffs(ps->store->chunk_size) - 1;
317 chunk_size_supplied = 0;
318 }
319
320 ps->io_client = dm_io_client_create();
321 if (IS_ERR(ps->io_client))
322 return PTR_ERR(ps->io_client);
323
324 r = alloc_area(ps);
325 if (r)
326 return r;
327
328 r = chunk_io(ps, ps->header_area, 0, READ, 1);
329 if (r)
330 goto bad;
331
332 dh = ps->header_area;
333
334 if (le32_to_cpu(dh->magic) == 0) {
335 *new_snapshot = 1;
336 return 0;
337 }
338
339 if (le32_to_cpu(dh->magic) != SNAP_MAGIC) {
340 DMWARN("Invalid or corrupt snapshot");
341 r = -ENXIO;
342 goto bad;
343 }
344
345 *new_snapshot = 0;
346 ps->valid = le32_to_cpu(dh->valid);
347 ps->version = le32_to_cpu(dh->version);
348 chunk_size = le32_to_cpu(dh->chunk_size);
349
350 if (ps->store->chunk_size == chunk_size)
351 return 0;
352
353 if (chunk_size_supplied)
354 DMWARN("chunk size %u in device metadata overrides "
355 "table chunk size of %u.",
356 chunk_size, ps->store->chunk_size);
357
358 /* We had a bogus chunk_size. Fix stuff up. */
359 free_area(ps);
360
361 r = dm_exception_store_set_chunk_size(ps->store, chunk_size,
362 &chunk_err);
363 if (r) {
364 DMERR("invalid on-disk chunk size %u: %s.",
365 chunk_size, chunk_err);
366 return r;
367 }
368
369 r = alloc_area(ps);
370 return r;
371
372bad:
373 free_area(ps);
374 return r;
375}
376
377static int write_header(struct pstore *ps)
378{
379 struct disk_header *dh;
380
381 memset(ps->header_area, 0, ps->store->chunk_size << SECTOR_SHIFT);
382
383 dh = ps->header_area;
384 dh->magic = cpu_to_le32(SNAP_MAGIC);
385 dh->valid = cpu_to_le32(ps->valid);
386 dh->version = cpu_to_le32(ps->version);
387 dh->chunk_size = cpu_to_le32(ps->store->chunk_size);
388
389 return chunk_io(ps, ps->header_area, 0, WRITE, 1);
390}
391
392/*
393 * Access functions for the disk exceptions, these do the endian conversions.
394 */
395static struct disk_exception *get_exception(struct pstore *ps, uint32_t index)
396{
397 BUG_ON(index >= ps->exceptions_per_area);
398
399 return ((struct disk_exception *) ps->area) + index;
400}
401
402static void read_exception(struct pstore *ps,
403 uint32_t index, struct core_exception *result)
404{
405 struct disk_exception *de = get_exception(ps, index);
406
407 /* copy it */
408 result->old_chunk = le64_to_cpu(de->old_chunk);
409 result->new_chunk = le64_to_cpu(de->new_chunk);
410}
411
412static void write_exception(struct pstore *ps,
413 uint32_t index, struct core_exception *e)
414{
415 struct disk_exception *de = get_exception(ps, index);
416
417 /* copy it */
418 de->old_chunk = cpu_to_le64(e->old_chunk);
419 de->new_chunk = cpu_to_le64(e->new_chunk);
420}
421
422static void clear_exception(struct pstore *ps, uint32_t index)
423{
424 struct disk_exception *de = get_exception(ps, index);
425
426 /* clear it */
427 de->old_chunk = 0;
428 de->new_chunk = 0;
429}
430
431/*
432 * Registers the exceptions that are present in the current area.
433 * 'full' is filled in to indicate if the area has been
434 * filled.
435 */
436static int insert_exceptions(struct pstore *ps,
437 int (*callback)(void *callback_context,
438 chunk_t old, chunk_t new),
439 void *callback_context,
440 int *full)
441{
442 int r;
443 unsigned int i;
444 struct core_exception e;
445
446 /* presume the area is full */
447 *full = 1;
448
449 for (i = 0; i < ps->exceptions_per_area; i++) {
450 read_exception(ps, i, &e);
451
452 /*
453 * If the new_chunk is pointing at the start of
454 * the COW device, where the first metadata area
455 * is we know that we've hit the end of the
456 * exceptions. Therefore the area is not full.
457 */
458 if (e.new_chunk == 0LL) {
459 ps->current_committed = i;
460 *full = 0;
461 break;
462 }
463
464 /*
465 * Keep track of the start of the free chunks.
466 */
467 if (ps->next_free <= e.new_chunk)
468 ps->next_free = e.new_chunk + 1;
469
470 /*
471 * Otherwise we add the exception to the snapshot.
472 */
473 r = callback(callback_context, e.old_chunk, e.new_chunk);
474 if (r)
475 return r;
476 }
477
478 return 0;
479}
480
481static int read_exceptions(struct pstore *ps,
482 int (*callback)(void *callback_context, chunk_t old,
483 chunk_t new),
484 void *callback_context)
485{
486 int r, full = 1;
487
488 /*
489 * Keeping reading chunks and inserting exceptions until
490 * we find a partially full area.
491 */
492 for (ps->current_area = 0; full; ps->current_area++) {
493 r = area_io(ps, READ);
494 if (r)
495 return r;
496
497 r = insert_exceptions(ps, callback, callback_context, &full);
498 if (r)
499 return r;
500 }
501
502 ps->current_area--;
503
504 return 0;
505}
506
507static struct pstore *get_info(struct dm_exception_store *store)
508{
509 return (struct pstore *) store->context;
510}
511
512static void persistent_usage(struct dm_exception_store *store,
513 sector_t *total_sectors,
514 sector_t *sectors_allocated,
515 sector_t *metadata_sectors)
516{
517 struct pstore *ps = get_info(store);
518
519 *sectors_allocated = ps->next_free * store->chunk_size;
520 *total_sectors = get_dev_size(dm_snap_cow(store->snap)->bdev);
521
522 /*
523 * First chunk is the fixed header.
524 * Then there are (ps->current_area + 1) metadata chunks, each one
525 * separated from the next by ps->exceptions_per_area data chunks.
526 */
527 *metadata_sectors = (ps->current_area + 1 + NUM_SNAPSHOT_HDR_CHUNKS) *
528 store->chunk_size;
529}
530
531static void persistent_dtr(struct dm_exception_store *store)
532{
533 struct pstore *ps = get_info(store);
534
535 destroy_workqueue(ps->metadata_wq);
536
537 /* Created in read_header */
538 if (ps->io_client)
539 dm_io_client_destroy(ps->io_client);
540 free_area(ps);
541
542 /* Allocated in persistent_read_metadata */
543 if (ps->callbacks)
544 vfree(ps->callbacks);
545
546 kfree(ps);
547}
548
549static int persistent_read_metadata(struct dm_exception_store *store,
550 int (*callback)(void *callback_context,
551 chunk_t old, chunk_t new),
552 void *callback_context)
553{
554 int r, uninitialized_var(new_snapshot);
555 struct pstore *ps = get_info(store);
556
557 /*
558 * Read the snapshot header.
559 */
560 r = read_header(ps, &new_snapshot);
561 if (r)
562 return r;
563
564 /*
565 * Now we know correct chunk_size, complete the initialisation.
566 */
567 ps->exceptions_per_area = (ps->store->chunk_size << SECTOR_SHIFT) /
568 sizeof(struct disk_exception);
569 ps->callbacks = dm_vcalloc(ps->exceptions_per_area,
570 sizeof(*ps->callbacks));
571 if (!ps->callbacks)
572 return -ENOMEM;
573
574 /*
575 * Do we need to setup a new snapshot ?
576 */
577 if (new_snapshot) {
578 r = write_header(ps);
579 if (r) {
580 DMWARN("write_header failed");
581 return r;
582 }
583
584 ps->current_area = 0;
585 zero_memory_area(ps);
586 r = zero_disk_area(ps, 0);
587 if (r)
588 DMWARN("zero_disk_area(0) failed");
589 return r;
590 }
591 /*
592 * Sanity checks.
593 */
594 if (ps->version != SNAPSHOT_DISK_VERSION) {
595 DMWARN("unable to handle snapshot disk version %d",
596 ps->version);
597 return -EINVAL;
598 }
599
600 /*
601 * Metadata are valid, but snapshot is invalidated
602 */
603 if (!ps->valid)
604 return 1;
605
606 /*
607 * Read the metadata.
608 */
609 r = read_exceptions(ps, callback, callback_context);
610
611 return r;
612}
613
614static int persistent_prepare_exception(struct dm_exception_store *store,
615 struct dm_exception *e)
616{
617 struct pstore *ps = get_info(store);
618 uint32_t stride;
619 chunk_t next_free;
620 sector_t size = get_dev_size(dm_snap_cow(store->snap)->bdev);
621
622 /* Is there enough room ? */
623 if (size < ((ps->next_free + 1) * store->chunk_size))
624 return -ENOSPC;
625
626 e->new_chunk = ps->next_free;
627
628 /*
629 * Move onto the next free pending, making sure to take
630 * into account the location of the metadata chunks.
631 */
632 stride = (ps->exceptions_per_area + 1);
633 next_free = ++ps->next_free;
634 if (sector_div(next_free, stride) == 1)
635 ps->next_free++;
636
637 atomic_inc(&ps->pending_count);
638 return 0;
639}
640
641static void persistent_commit_exception(struct dm_exception_store *store,
642 struct dm_exception *e,
643 void (*callback) (void *, int success),
644 void *callback_context)
645{
646 unsigned int i;
647 struct pstore *ps = get_info(store);
648 struct core_exception ce;
649 struct commit_callback *cb;
650
651 ce.old_chunk = e->old_chunk;
652 ce.new_chunk = e->new_chunk;
653 write_exception(ps, ps->current_committed++, &ce);
654
655 /*
656 * Add the callback to the back of the array. This code
657 * is the only place where the callback array is
658 * manipulated, and we know that it will never be called
659 * multiple times concurrently.
660 */
661 cb = ps->callbacks + ps->callback_count++;
662 cb->callback = callback;
663 cb->context = callback_context;
664
665 /*
666 * If there are exceptions in flight and we have not yet
667 * filled this metadata area there's nothing more to do.
668 */
669 if (!atomic_dec_and_test(&ps->pending_count) &&
670 (ps->current_committed != ps->exceptions_per_area))
671 return;
672
673 /*
674 * If we completely filled the current area, then wipe the next one.
675 */
676 if ((ps->current_committed == ps->exceptions_per_area) &&
677 zero_disk_area(ps, ps->current_area + 1))
678 ps->valid = 0;
679
680 /*
681 * Commit exceptions to disk.
682 */
683 if (ps->valid && area_io(ps, WRITE_FLUSH_FUA))
684 ps->valid = 0;
685
686 /*
687 * Advance to the next area if this one is full.
688 */
689 if (ps->current_committed == ps->exceptions_per_area) {
690 ps->current_committed = 0;
691 ps->current_area++;
692 zero_memory_area(ps);
693 }
694
695 for (i = 0; i < ps->callback_count; i++) {
696 cb = ps->callbacks + i;
697 cb->callback(cb->context, ps->valid);
698 }
699
700 ps->callback_count = 0;
701}
702
703static int persistent_prepare_merge(struct dm_exception_store *store,
704 chunk_t *last_old_chunk,
705 chunk_t *last_new_chunk)
706{
707 struct pstore *ps = get_info(store);
708 struct core_exception ce;
709 int nr_consecutive;
710 int r;
711
712 /*
713 * When current area is empty, move back to preceding area.
714 */
715 if (!ps->current_committed) {
716 /*
717 * Have we finished?
718 */
719 if (!ps->current_area)
720 return 0;
721
722 ps->current_area--;
723 r = area_io(ps, READ);
724 if (r < 0)
725 return r;
726 ps->current_committed = ps->exceptions_per_area;
727 }
728
729 read_exception(ps, ps->current_committed - 1, &ce);
730 *last_old_chunk = ce.old_chunk;
731 *last_new_chunk = ce.new_chunk;
732
733 /*
734 * Find number of consecutive chunks within the current area,
735 * working backwards.
736 */
737 for (nr_consecutive = 1; nr_consecutive < ps->current_committed;
738 nr_consecutive++) {
739 read_exception(ps, ps->current_committed - 1 - nr_consecutive,
740 &ce);
741 if (ce.old_chunk != *last_old_chunk - nr_consecutive ||
742 ce.new_chunk != *last_new_chunk - nr_consecutive)
743 break;
744 }
745
746 return nr_consecutive;
747}
748
749static int persistent_commit_merge(struct dm_exception_store *store,
750 int nr_merged)
751{
752 int r, i;
753 struct pstore *ps = get_info(store);
754
755 BUG_ON(nr_merged > ps->current_committed);
756
757 for (i = 0; i < nr_merged; i++)
758 clear_exception(ps, ps->current_committed - 1 - i);
759
760 r = area_io(ps, WRITE_FLUSH_FUA);
761 if (r < 0)
762 return r;
763
764 ps->current_committed -= nr_merged;
765
766 /*
767 * At this stage, only persistent_usage() uses ps->next_free, so
768 * we make no attempt to keep ps->next_free strictly accurate
769 * as exceptions may have been committed out-of-order originally.
770 * Once a snapshot has become merging, we set it to the value it
771 * would have held had all the exceptions been committed in order.
772 *
773 * ps->current_area does not get reduced by prepare_merge() until
774 * after commit_merge() has removed the nr_merged previous exceptions.
775 */
776 ps->next_free = area_location(ps, ps->current_area) +
777 ps->current_committed + 1;
778
779 return 0;
780}
781
782static void persistent_drop_snapshot(struct dm_exception_store *store)
783{
784 struct pstore *ps = get_info(store);
785
786 ps->valid = 0;
787 if (write_header(ps))
788 DMWARN("write header failed");
789}
790
791static int persistent_ctr(struct dm_exception_store *store,
792 unsigned argc, char **argv)
793{
794 struct pstore *ps;
795
796 /* allocate the pstore */
797 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
798 if (!ps)
799 return -ENOMEM;
800
801 ps->store = store;
802 ps->valid = 1;
803 ps->version = SNAPSHOT_DISK_VERSION;
804 ps->area = NULL;
805 ps->zero_area = NULL;
806 ps->header_area = NULL;
807 ps->next_free = NUM_SNAPSHOT_HDR_CHUNKS + 1; /* header and 1st area */
808 ps->current_committed = 0;
809
810 ps->callback_count = 0;
811 atomic_set(&ps->pending_count, 0);
812 ps->callbacks = NULL;
813
814 ps->metadata_wq = alloc_workqueue("ksnaphd", WQ_MEM_RECLAIM, 0);
815 if (!ps->metadata_wq) {
816 kfree(ps);
817 DMERR("couldn't start header metadata update thread");
818 return -ENOMEM;
819 }
820
821 store->context = ps;
822
823 return 0;
824}
825
826static unsigned persistent_status(struct dm_exception_store *store,
827 status_type_t status, char *result,
828 unsigned maxlen)
829{
830 unsigned sz = 0;
831
832 switch (status) {
833 case STATUSTYPE_INFO:
834 break;
835 case STATUSTYPE_TABLE:
836 DMEMIT(" P %llu", (unsigned long long)store->chunk_size);
837 }
838
839 return sz;
840}
841
842static struct dm_exception_store_type _persistent_type = {
843 .name = "persistent",
844 .module = THIS_MODULE,
845 .ctr = persistent_ctr,
846 .dtr = persistent_dtr,
847 .read_metadata = persistent_read_metadata,
848 .prepare_exception = persistent_prepare_exception,
849 .commit_exception = persistent_commit_exception,
850 .prepare_merge = persistent_prepare_merge,
851 .commit_merge = persistent_commit_merge,
852 .drop_snapshot = persistent_drop_snapshot,
853 .usage = persistent_usage,
854 .status = persistent_status,
855};
856
857static struct dm_exception_store_type _persistent_compat_type = {
858 .name = "P",
859 .module = THIS_MODULE,
860 .ctr = persistent_ctr,
861 .dtr = persistent_dtr,
862 .read_metadata = persistent_read_metadata,
863 .prepare_exception = persistent_prepare_exception,
864 .commit_exception = persistent_commit_exception,
865 .prepare_merge = persistent_prepare_merge,
866 .commit_merge = persistent_commit_merge,
867 .drop_snapshot = persistent_drop_snapshot,
868 .usage = persistent_usage,
869 .status = persistent_status,
870};
871
872int dm_persistent_snapshot_init(void)
873{
874 int r;
875
876 r = dm_exception_store_type_register(&_persistent_type);
877 if (r) {
878 DMERR("Unable to register persistent exception store type");
879 return r;
880 }
881
882 r = dm_exception_store_type_register(&_persistent_compat_type);
883 if (r) {
884 DMERR("Unable to register old-style persistent exception "
885 "store type");
886 dm_exception_store_type_unregister(&_persistent_type);
887 return r;
888 }
889
890 return r;
891}
892
893void dm_persistent_snapshot_exit(void)
894{
895 dm_exception_store_type_unregister(&_persistent_type);
896 dm_exception_store_type_unregister(&_persistent_compat_type);
897}
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * Copyright (C) 2001-2002 Sistina Software (UK) Limited.
4 * Copyright (C) 2006-2008 Red Hat GmbH
5 *
6 * This file is released under the GPL.
7 */
8
9#include "dm-exception-store.h"
10
11#include <linux/ctype.h>
12#include <linux/mm.h>
13#include <linux/pagemap.h>
14#include <linux/vmalloc.h>
15#include <linux/export.h>
16#include <linux/slab.h>
17#include <linux/dm-io.h>
18#include <linux/dm-bufio.h>
19
20#define DM_MSG_PREFIX "persistent snapshot"
21#define DM_CHUNK_SIZE_DEFAULT_SECTORS 32U /* 16KB */
22
23#define DM_PREFETCH_CHUNKS 12
24
25/*
26 *---------------------------------------------------------------
27 * Persistent snapshots, by persistent we mean that the snapshot
28 * will survive a reboot.
29 *---------------------------------------------------------------
30 */
31
32/*
33 * We need to store a record of which parts of the origin have
34 * been copied to the snapshot device. The snapshot code
35 * requires that we copy exception chunks to chunk aligned areas
36 * of the COW store. It makes sense therefore, to store the
37 * metadata in chunk size blocks.
38 *
39 * There is no backward or forward compatibility implemented,
40 * snapshots with different disk versions than the kernel will
41 * not be usable. It is expected that "lvcreate" will blank out
42 * the start of a fresh COW device before calling the snapshot
43 * constructor.
44 *
45 * The first chunk of the COW device just contains the header.
46 * After this there is a chunk filled with exception metadata,
47 * followed by as many exception chunks as can fit in the
48 * metadata areas.
49 *
50 * All on disk structures are in little-endian format. The end
51 * of the exceptions info is indicated by an exception with a
52 * new_chunk of 0, which is invalid since it would point to the
53 * header chunk.
54 */
55
56/*
57 * Magic for persistent snapshots: "SnAp" - Feeble isn't it.
58 */
59#define SNAP_MAGIC 0x70416e53
60
61/*
62 * The on-disk version of the metadata.
63 */
64#define SNAPSHOT_DISK_VERSION 1
65
66#define NUM_SNAPSHOT_HDR_CHUNKS 1
67
68struct disk_header {
69 __le32 magic;
70
71 /*
72 * Is this snapshot valid. There is no way of recovering
73 * an invalid snapshot.
74 */
75 __le32 valid;
76
77 /*
78 * Simple, incrementing version. no backward
79 * compatibility.
80 */
81 __le32 version;
82
83 /* In sectors */
84 __le32 chunk_size;
85} __packed;
86
87struct disk_exception {
88 __le64 old_chunk;
89 __le64 new_chunk;
90} __packed;
91
92struct core_exception {
93 uint64_t old_chunk;
94 uint64_t new_chunk;
95};
96
97struct commit_callback {
98 void (*callback)(void *ref, int success);
99 void *context;
100};
101
102/*
103 * The top level structure for a persistent exception store.
104 */
105struct pstore {
106 struct dm_exception_store *store;
107 int version;
108 int valid;
109 uint32_t exceptions_per_area;
110
111 /*
112 * Now that we have an asynchronous kcopyd there is no
113 * need for large chunk sizes, so it wont hurt to have a
114 * whole chunks worth of metadata in memory at once.
115 */
116 void *area;
117
118 /*
119 * An area of zeros used to clear the next area.
120 */
121 void *zero_area;
122
123 /*
124 * An area used for header. The header can be written
125 * concurrently with metadata (when invalidating the snapshot),
126 * so it needs a separate buffer.
127 */
128 void *header_area;
129
130 /*
131 * Used to keep track of which metadata area the data in
132 * 'chunk' refers to.
133 */
134 chunk_t current_area;
135
136 /*
137 * The next free chunk for an exception.
138 *
139 * When creating exceptions, all the chunks here and above are
140 * free. It holds the next chunk to be allocated. On rare
141 * occasions (e.g. after a system crash) holes can be left in
142 * the exception store because chunks can be committed out of
143 * order.
144 *
145 * When merging exceptions, it does not necessarily mean all the
146 * chunks here and above are free. It holds the value it would
147 * have held if all chunks had been committed in order of
148 * allocation. Consequently the value may occasionally be
149 * slightly too low, but since it's only used for 'status' and
150 * it can never reach its minimum value too early this doesn't
151 * matter.
152 */
153
154 chunk_t next_free;
155
156 /*
157 * The index of next free exception in the current
158 * metadata area.
159 */
160 uint32_t current_committed;
161
162 atomic_t pending_count;
163 uint32_t callback_count;
164 struct commit_callback *callbacks;
165 struct dm_io_client *io_client;
166
167 struct workqueue_struct *metadata_wq;
168};
169
170static int alloc_area(struct pstore *ps)
171{
172 int r = -ENOMEM;
173 size_t len;
174
175 len = ps->store->chunk_size << SECTOR_SHIFT;
176
177 /*
178 * Allocate the chunk_size block of memory that will hold
179 * a single metadata area.
180 */
181 ps->area = vmalloc(len);
182 if (!ps->area)
183 goto err_area;
184
185 ps->zero_area = vzalloc(len);
186 if (!ps->zero_area)
187 goto err_zero_area;
188
189 ps->header_area = vmalloc(len);
190 if (!ps->header_area)
191 goto err_header_area;
192
193 return 0;
194
195err_header_area:
196 vfree(ps->zero_area);
197
198err_zero_area:
199 vfree(ps->area);
200
201err_area:
202 return r;
203}
204
205static void free_area(struct pstore *ps)
206{
207 vfree(ps->area);
208 ps->area = NULL;
209 vfree(ps->zero_area);
210 ps->zero_area = NULL;
211 vfree(ps->header_area);
212 ps->header_area = NULL;
213}
214
215struct mdata_req {
216 struct dm_io_region *where;
217 struct dm_io_request *io_req;
218 struct work_struct work;
219 int result;
220};
221
222static void do_metadata(struct work_struct *work)
223{
224 struct mdata_req *req = container_of(work, struct mdata_req, work);
225
226 req->result = dm_io(req->io_req, 1, req->where, NULL, IOPRIO_DEFAULT);
227}
228
229/*
230 * Read or write a chunk aligned and sized block of data from a device.
231 */
232static int chunk_io(struct pstore *ps, void *area, chunk_t chunk, blk_opf_t opf,
233 int metadata)
234{
235 struct dm_io_region where = {
236 .bdev = dm_snap_cow(ps->store->snap)->bdev,
237 .sector = ps->store->chunk_size * chunk,
238 .count = ps->store->chunk_size,
239 };
240 struct dm_io_request io_req = {
241 .bi_opf = opf,
242 .mem.type = DM_IO_VMA,
243 .mem.ptr.vma = area,
244 .client = ps->io_client,
245 .notify.fn = NULL,
246 };
247 struct mdata_req req;
248
249 if (!metadata)
250 return dm_io(&io_req, 1, &where, NULL, IOPRIO_DEFAULT);
251
252 req.where = &where;
253 req.io_req = &io_req;
254
255 /*
256 * Issue the synchronous I/O from a different thread
257 * to avoid submit_bio_noacct recursion.
258 */
259 INIT_WORK_ONSTACK(&req.work, do_metadata);
260 queue_work(ps->metadata_wq, &req.work);
261 flush_workqueue(ps->metadata_wq);
262 destroy_work_on_stack(&req.work);
263
264 return req.result;
265}
266
267/*
268 * Convert a metadata area index to a chunk index.
269 */
270static chunk_t area_location(struct pstore *ps, chunk_t area)
271{
272 return NUM_SNAPSHOT_HDR_CHUNKS + ((ps->exceptions_per_area + 1) * area);
273}
274
275static void skip_metadata(struct pstore *ps)
276{
277 uint32_t stride = ps->exceptions_per_area + 1;
278 chunk_t next_free = ps->next_free;
279
280 if (sector_div(next_free, stride) == NUM_SNAPSHOT_HDR_CHUNKS)
281 ps->next_free++;
282}
283
284/*
285 * Read or write a metadata area. Remembering to skip the first
286 * chunk which holds the header.
287 */
288static int area_io(struct pstore *ps, blk_opf_t opf)
289{
290 chunk_t chunk = area_location(ps, ps->current_area);
291
292 return chunk_io(ps, ps->area, chunk, opf, 0);
293}
294
295static void zero_memory_area(struct pstore *ps)
296{
297 memset(ps->area, 0, ps->store->chunk_size << SECTOR_SHIFT);
298}
299
300static int zero_disk_area(struct pstore *ps, chunk_t area)
301{
302 return chunk_io(ps, ps->zero_area, area_location(ps, area),
303 REQ_OP_WRITE, 0);
304}
305
306static int read_header(struct pstore *ps, int *new_snapshot)
307{
308 int r;
309 struct disk_header *dh;
310 unsigned int chunk_size;
311 int chunk_size_supplied = 1;
312 char *chunk_err;
313
314 /*
315 * Use default chunk size (or logical_block_size, if larger)
316 * if none supplied
317 */
318 if (!ps->store->chunk_size) {
319 ps->store->chunk_size = max(DM_CHUNK_SIZE_DEFAULT_SECTORS,
320 bdev_logical_block_size(dm_snap_cow(ps->store->snap)->
321 bdev) >> 9);
322 ps->store->chunk_mask = ps->store->chunk_size - 1;
323 ps->store->chunk_shift = __ffs(ps->store->chunk_size);
324 chunk_size_supplied = 0;
325 }
326
327 ps->io_client = dm_io_client_create();
328 if (IS_ERR(ps->io_client))
329 return PTR_ERR(ps->io_client);
330
331 r = alloc_area(ps);
332 if (r)
333 return r;
334
335 r = chunk_io(ps, ps->header_area, 0, REQ_OP_READ, 1);
336 if (r)
337 goto bad;
338
339 dh = ps->header_area;
340
341 if (le32_to_cpu(dh->magic) == 0) {
342 *new_snapshot = 1;
343 return 0;
344 }
345
346 if (le32_to_cpu(dh->magic) != SNAP_MAGIC) {
347 DMWARN("Invalid or corrupt snapshot");
348 r = -ENXIO;
349 goto bad;
350 }
351
352 *new_snapshot = 0;
353 ps->valid = le32_to_cpu(dh->valid);
354 ps->version = le32_to_cpu(dh->version);
355 chunk_size = le32_to_cpu(dh->chunk_size);
356
357 if (ps->store->chunk_size == chunk_size)
358 return 0;
359
360 if (chunk_size_supplied)
361 DMWARN("chunk size %u in device metadata overrides table chunk size of %u.",
362 chunk_size, ps->store->chunk_size);
363
364 /* We had a bogus chunk_size. Fix stuff up. */
365 free_area(ps);
366
367 r = dm_exception_store_set_chunk_size(ps->store, chunk_size,
368 &chunk_err);
369 if (r) {
370 DMERR("invalid on-disk chunk size %u: %s.",
371 chunk_size, chunk_err);
372 return r;
373 }
374
375 r = alloc_area(ps);
376 return r;
377
378bad:
379 free_area(ps);
380 return r;
381}
382
383static int write_header(struct pstore *ps)
384{
385 struct disk_header *dh;
386
387 memset(ps->header_area, 0, ps->store->chunk_size << SECTOR_SHIFT);
388
389 dh = ps->header_area;
390 dh->magic = cpu_to_le32(SNAP_MAGIC);
391 dh->valid = cpu_to_le32(ps->valid);
392 dh->version = cpu_to_le32(ps->version);
393 dh->chunk_size = cpu_to_le32(ps->store->chunk_size);
394
395 return chunk_io(ps, ps->header_area, 0, REQ_OP_WRITE, 1);
396}
397
398/*
399 * Access functions for the disk exceptions, these do the endian conversions.
400 */
401static struct disk_exception *get_exception(struct pstore *ps, void *ps_area,
402 uint32_t index)
403{
404 BUG_ON(index >= ps->exceptions_per_area);
405
406 return ((struct disk_exception *) ps_area) + index;
407}
408
409static void read_exception(struct pstore *ps, void *ps_area,
410 uint32_t index, struct core_exception *result)
411{
412 struct disk_exception *de = get_exception(ps, ps_area, index);
413
414 /* copy it */
415 result->old_chunk = le64_to_cpu(de->old_chunk);
416 result->new_chunk = le64_to_cpu(de->new_chunk);
417}
418
419static void write_exception(struct pstore *ps,
420 uint32_t index, struct core_exception *e)
421{
422 struct disk_exception *de = get_exception(ps, ps->area, index);
423
424 /* copy it */
425 de->old_chunk = cpu_to_le64(e->old_chunk);
426 de->new_chunk = cpu_to_le64(e->new_chunk);
427}
428
429static void clear_exception(struct pstore *ps, uint32_t index)
430{
431 struct disk_exception *de = get_exception(ps, ps->area, index);
432
433 /* clear it */
434 de->old_chunk = 0;
435 de->new_chunk = 0;
436}
437
438/*
439 * Registers the exceptions that are present in the current area.
440 * 'full' is filled in to indicate if the area has been
441 * filled.
442 */
443static int insert_exceptions(struct pstore *ps, void *ps_area,
444 int (*callback)(void *callback_context,
445 chunk_t old, chunk_t new),
446 void *callback_context,
447 int *full)
448{
449 int r;
450 unsigned int i;
451 struct core_exception e;
452
453 /* presume the area is full */
454 *full = 1;
455
456 for (i = 0; i < ps->exceptions_per_area; i++) {
457 read_exception(ps, ps_area, i, &e);
458
459 /*
460 * If the new_chunk is pointing at the start of
461 * the COW device, where the first metadata area
462 * is we know that we've hit the end of the
463 * exceptions. Therefore the area is not full.
464 */
465 if (e.new_chunk == 0LL) {
466 ps->current_committed = i;
467 *full = 0;
468 break;
469 }
470
471 /*
472 * Keep track of the start of the free chunks.
473 */
474 if (ps->next_free <= e.new_chunk)
475 ps->next_free = e.new_chunk + 1;
476
477 /*
478 * Otherwise we add the exception to the snapshot.
479 */
480 r = callback(callback_context, e.old_chunk, e.new_chunk);
481 if (r)
482 return r;
483 }
484
485 return 0;
486}
487
488static int read_exceptions(struct pstore *ps,
489 int (*callback)(void *callback_context, chunk_t old,
490 chunk_t new),
491 void *callback_context)
492{
493 int r, full = 1;
494 struct dm_bufio_client *client;
495 chunk_t prefetch_area = 0;
496
497 client = dm_bufio_client_create(dm_snap_cow(ps->store->snap)->bdev,
498 ps->store->chunk_size << SECTOR_SHIFT,
499 1, 0, NULL, NULL, 0);
500
501 if (IS_ERR(client))
502 return PTR_ERR(client);
503
504 /*
505 * Setup for one current buffer + desired readahead buffers.
506 */
507 dm_bufio_set_minimum_buffers(client, 1 + DM_PREFETCH_CHUNKS);
508
509 /*
510 * Keeping reading chunks and inserting exceptions until
511 * we find a partially full area.
512 */
513 for (ps->current_area = 0; full; ps->current_area++) {
514 struct dm_buffer *bp;
515 void *area;
516 chunk_t chunk;
517
518 if (unlikely(prefetch_area < ps->current_area))
519 prefetch_area = ps->current_area;
520
521 if (DM_PREFETCH_CHUNKS) {
522 do {
523 chunk_t pf_chunk = area_location(ps, prefetch_area);
524
525 if (unlikely(pf_chunk >= dm_bufio_get_device_size(client)))
526 break;
527 dm_bufio_prefetch(client, pf_chunk, 1);
528 prefetch_area++;
529 if (unlikely(!prefetch_area))
530 break;
531 } while (prefetch_area <= ps->current_area + DM_PREFETCH_CHUNKS);
532 }
533
534 chunk = area_location(ps, ps->current_area);
535
536 area = dm_bufio_read(client, chunk, &bp);
537 if (IS_ERR(area)) {
538 r = PTR_ERR(area);
539 goto ret_destroy_bufio;
540 }
541
542 r = insert_exceptions(ps, area, callback, callback_context,
543 &full);
544
545 if (!full)
546 memcpy(ps->area, area, ps->store->chunk_size << SECTOR_SHIFT);
547
548 dm_bufio_release(bp);
549
550 dm_bufio_forget(client, chunk);
551
552 if (unlikely(r))
553 goto ret_destroy_bufio;
554 }
555
556 ps->current_area--;
557
558 skip_metadata(ps);
559
560 r = 0;
561
562ret_destroy_bufio:
563 dm_bufio_client_destroy(client);
564
565 return r;
566}
567
568static struct pstore *get_info(struct dm_exception_store *store)
569{
570 return store->context;
571}
572
573static void persistent_usage(struct dm_exception_store *store,
574 sector_t *total_sectors,
575 sector_t *sectors_allocated,
576 sector_t *metadata_sectors)
577{
578 struct pstore *ps = get_info(store);
579
580 *sectors_allocated = ps->next_free * store->chunk_size;
581 *total_sectors = get_dev_size(dm_snap_cow(store->snap)->bdev);
582
583 /*
584 * First chunk is the fixed header.
585 * Then there are (ps->current_area + 1) metadata chunks, each one
586 * separated from the next by ps->exceptions_per_area data chunks.
587 */
588 *metadata_sectors = (ps->current_area + 1 + NUM_SNAPSHOT_HDR_CHUNKS) *
589 store->chunk_size;
590}
591
592static void persistent_dtr(struct dm_exception_store *store)
593{
594 struct pstore *ps = get_info(store);
595
596 destroy_workqueue(ps->metadata_wq);
597
598 /* Created in read_header */
599 if (ps->io_client)
600 dm_io_client_destroy(ps->io_client);
601 free_area(ps);
602
603 /* Allocated in persistent_read_metadata */
604 kvfree(ps->callbacks);
605
606 kfree(ps);
607}
608
609static int persistent_read_metadata(struct dm_exception_store *store,
610 int (*callback)(void *callback_context,
611 chunk_t old, chunk_t new),
612 void *callback_context)
613{
614 int r, new_snapshot;
615 struct pstore *ps = get_info(store);
616
617 /*
618 * Read the snapshot header.
619 */
620 r = read_header(ps, &new_snapshot);
621 if (r)
622 return r;
623
624 /*
625 * Now we know correct chunk_size, complete the initialisation.
626 */
627 ps->exceptions_per_area = (ps->store->chunk_size << SECTOR_SHIFT) /
628 sizeof(struct disk_exception);
629 ps->callbacks = kvcalloc(ps->exceptions_per_area,
630 sizeof(*ps->callbacks), GFP_KERNEL);
631 if (!ps->callbacks)
632 return -ENOMEM;
633
634 /*
635 * Do we need to setup a new snapshot ?
636 */
637 if (new_snapshot) {
638 r = write_header(ps);
639 if (r) {
640 DMWARN("write_header failed");
641 return r;
642 }
643
644 ps->current_area = 0;
645 zero_memory_area(ps);
646 r = zero_disk_area(ps, 0);
647 if (r)
648 DMWARN("zero_disk_area(0) failed");
649 return r;
650 }
651 /*
652 * Sanity checks.
653 */
654 if (ps->version != SNAPSHOT_DISK_VERSION) {
655 DMWARN("unable to handle snapshot disk version %d",
656 ps->version);
657 return -EINVAL;
658 }
659
660 /*
661 * Metadata are valid, but snapshot is invalidated
662 */
663 if (!ps->valid)
664 return 1;
665
666 /*
667 * Read the metadata.
668 */
669 r = read_exceptions(ps, callback, callback_context);
670
671 return r;
672}
673
674static int persistent_prepare_exception(struct dm_exception_store *store,
675 struct dm_exception *e)
676{
677 struct pstore *ps = get_info(store);
678 sector_t size = get_dev_size(dm_snap_cow(store->snap)->bdev);
679
680 /* Is there enough room ? */
681 if (size < ((ps->next_free + 1) * store->chunk_size))
682 return -ENOSPC;
683
684 e->new_chunk = ps->next_free;
685
686 /*
687 * Move onto the next free pending, making sure to take
688 * into account the location of the metadata chunks.
689 */
690 ps->next_free++;
691 skip_metadata(ps);
692
693 atomic_inc(&ps->pending_count);
694 return 0;
695}
696
697static void persistent_commit_exception(struct dm_exception_store *store,
698 struct dm_exception *e, int valid,
699 void (*callback)(void *, int success),
700 void *callback_context)
701{
702 unsigned int i;
703 struct pstore *ps = get_info(store);
704 struct core_exception ce;
705 struct commit_callback *cb;
706
707 if (!valid)
708 ps->valid = 0;
709
710 ce.old_chunk = e->old_chunk;
711 ce.new_chunk = e->new_chunk;
712 write_exception(ps, ps->current_committed++, &ce);
713
714 /*
715 * Add the callback to the back of the array. This code
716 * is the only place where the callback array is
717 * manipulated, and we know that it will never be called
718 * multiple times concurrently.
719 */
720 cb = ps->callbacks + ps->callback_count++;
721 cb->callback = callback;
722 cb->context = callback_context;
723
724 /*
725 * If there are exceptions in flight and we have not yet
726 * filled this metadata area there's nothing more to do.
727 */
728 if (!atomic_dec_and_test(&ps->pending_count) &&
729 (ps->current_committed != ps->exceptions_per_area))
730 return;
731
732 /*
733 * If we completely filled the current area, then wipe the next one.
734 */
735 if ((ps->current_committed == ps->exceptions_per_area) &&
736 zero_disk_area(ps, ps->current_area + 1))
737 ps->valid = 0;
738
739 /*
740 * Commit exceptions to disk.
741 */
742 if (ps->valid && area_io(ps, REQ_OP_WRITE | REQ_PREFLUSH | REQ_FUA |
743 REQ_SYNC))
744 ps->valid = 0;
745
746 /*
747 * Advance to the next area if this one is full.
748 */
749 if (ps->current_committed == ps->exceptions_per_area) {
750 ps->current_committed = 0;
751 ps->current_area++;
752 zero_memory_area(ps);
753 }
754
755 for (i = 0; i < ps->callback_count; i++) {
756 cb = ps->callbacks + i;
757 cb->callback(cb->context, ps->valid);
758 }
759
760 ps->callback_count = 0;
761}
762
763static int persistent_prepare_merge(struct dm_exception_store *store,
764 chunk_t *last_old_chunk,
765 chunk_t *last_new_chunk)
766{
767 struct pstore *ps = get_info(store);
768 struct core_exception ce;
769 int nr_consecutive;
770 int r;
771
772 /*
773 * When current area is empty, move back to preceding area.
774 */
775 if (!ps->current_committed) {
776 /*
777 * Have we finished?
778 */
779 if (!ps->current_area)
780 return 0;
781
782 ps->current_area--;
783 r = area_io(ps, REQ_OP_READ);
784 if (r < 0)
785 return r;
786 ps->current_committed = ps->exceptions_per_area;
787 }
788
789 read_exception(ps, ps->area, ps->current_committed - 1, &ce);
790 *last_old_chunk = ce.old_chunk;
791 *last_new_chunk = ce.new_chunk;
792
793 /*
794 * Find number of consecutive chunks within the current area,
795 * working backwards.
796 */
797 for (nr_consecutive = 1; nr_consecutive < ps->current_committed;
798 nr_consecutive++) {
799 read_exception(ps, ps->area,
800 ps->current_committed - 1 - nr_consecutive, &ce);
801 if (ce.old_chunk != *last_old_chunk - nr_consecutive ||
802 ce.new_chunk != *last_new_chunk - nr_consecutive)
803 break;
804 }
805
806 return nr_consecutive;
807}
808
809static int persistent_commit_merge(struct dm_exception_store *store,
810 int nr_merged)
811{
812 int r, i;
813 struct pstore *ps = get_info(store);
814
815 BUG_ON(nr_merged > ps->current_committed);
816
817 for (i = 0; i < nr_merged; i++)
818 clear_exception(ps, ps->current_committed - 1 - i);
819
820 r = area_io(ps, REQ_OP_WRITE | REQ_PREFLUSH | REQ_FUA);
821 if (r < 0)
822 return r;
823
824 ps->current_committed -= nr_merged;
825
826 /*
827 * At this stage, only persistent_usage() uses ps->next_free, so
828 * we make no attempt to keep ps->next_free strictly accurate
829 * as exceptions may have been committed out-of-order originally.
830 * Once a snapshot has become merging, we set it to the value it
831 * would have held had all the exceptions been committed in order.
832 *
833 * ps->current_area does not get reduced by prepare_merge() until
834 * after commit_merge() has removed the nr_merged previous exceptions.
835 */
836 ps->next_free = area_location(ps, ps->current_area) +
837 ps->current_committed + 1;
838
839 return 0;
840}
841
842static void persistent_drop_snapshot(struct dm_exception_store *store)
843{
844 struct pstore *ps = get_info(store);
845
846 ps->valid = 0;
847 if (write_header(ps))
848 DMWARN("write header failed");
849}
850
851static int persistent_ctr(struct dm_exception_store *store, char *options)
852{
853 struct pstore *ps;
854 int r;
855
856 /* allocate the pstore */
857 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
858 if (!ps)
859 return -ENOMEM;
860
861 ps->store = store;
862 ps->valid = 1;
863 ps->version = SNAPSHOT_DISK_VERSION;
864 ps->area = NULL;
865 ps->zero_area = NULL;
866 ps->header_area = NULL;
867 ps->next_free = NUM_SNAPSHOT_HDR_CHUNKS + 1; /* header and 1st area */
868 ps->current_committed = 0;
869
870 ps->callback_count = 0;
871 atomic_set(&ps->pending_count, 0);
872 ps->callbacks = NULL;
873
874 ps->metadata_wq = alloc_workqueue("ksnaphd", WQ_MEM_RECLAIM, 0);
875 if (!ps->metadata_wq) {
876 DMERR("couldn't start header metadata update thread");
877 r = -ENOMEM;
878 goto err_workqueue;
879 }
880
881 if (options) {
882 char overflow = toupper(options[0]);
883
884 if (overflow == 'O')
885 store->userspace_supports_overflow = true;
886 else {
887 DMERR("Unsupported persistent store option: %s", options);
888 r = -EINVAL;
889 goto err_options;
890 }
891 }
892
893 store->context = ps;
894
895 return 0;
896
897err_options:
898 destroy_workqueue(ps->metadata_wq);
899err_workqueue:
900 kfree(ps);
901
902 return r;
903}
904
905static unsigned int persistent_status(struct dm_exception_store *store,
906 status_type_t status, char *result,
907 unsigned int maxlen)
908{
909 unsigned int sz = 0;
910
911 switch (status) {
912 case STATUSTYPE_INFO:
913 break;
914 case STATUSTYPE_TABLE:
915 DMEMIT(" %s %llu", store->userspace_supports_overflow ? "PO" : "P",
916 (unsigned long long)store->chunk_size);
917 break;
918 case STATUSTYPE_IMA:
919 *result = '\0';
920 break;
921 }
922
923 return sz;
924}
925
926static struct dm_exception_store_type _persistent_type = {
927 .name = "persistent",
928 .module = THIS_MODULE,
929 .ctr = persistent_ctr,
930 .dtr = persistent_dtr,
931 .read_metadata = persistent_read_metadata,
932 .prepare_exception = persistent_prepare_exception,
933 .commit_exception = persistent_commit_exception,
934 .prepare_merge = persistent_prepare_merge,
935 .commit_merge = persistent_commit_merge,
936 .drop_snapshot = persistent_drop_snapshot,
937 .usage = persistent_usage,
938 .status = persistent_status,
939};
940
941static struct dm_exception_store_type _persistent_compat_type = {
942 .name = "P",
943 .module = THIS_MODULE,
944 .ctr = persistent_ctr,
945 .dtr = persistent_dtr,
946 .read_metadata = persistent_read_metadata,
947 .prepare_exception = persistent_prepare_exception,
948 .commit_exception = persistent_commit_exception,
949 .prepare_merge = persistent_prepare_merge,
950 .commit_merge = persistent_commit_merge,
951 .drop_snapshot = persistent_drop_snapshot,
952 .usage = persistent_usage,
953 .status = persistent_status,
954};
955
956int dm_persistent_snapshot_init(void)
957{
958 int r;
959
960 r = dm_exception_store_type_register(&_persistent_type);
961 if (r) {
962 DMERR("Unable to register persistent exception store type");
963 return r;
964 }
965
966 r = dm_exception_store_type_register(&_persistent_compat_type);
967 if (r) {
968 DMERR("Unable to register old-style persistent exception store type");
969 dm_exception_store_type_unregister(&_persistent_type);
970 return r;
971 }
972
973 return r;
974}
975
976void dm_persistent_snapshot_exit(void)
977{
978 dm_exception_store_type_unregister(&_persistent_type);
979 dm_exception_store_type_unregister(&_persistent_compat_type);
980}