4 * Copyright (C) 2001-2002 Sistina Software (UK) Limited.
5 * Copyright (C) 2006 Red Hat GmbH
7 * This file is released under the GPL.
16 #include <linux/pagemap.h>
17 #include <linux/vmalloc.h>
18 #include <linux/slab.h>
20 #define DM_MSG_PREFIX "snapshots"
21 #define DM_CHUNK_SIZE_DEFAULT_SECTORS 32 /* 16KB */
23 /*-----------------------------------------------------------------
24 * Persistent snapshots, by persistent we mean that the snapshot
25 * will survive a reboot.
26 *---------------------------------------------------------------*/
29 * We need to store a record of which parts of the origin have
30 * been copied to the snapshot device. The snapshot code
31 * requires that we copy exception chunks to chunk aligned areas
32 * of the COW store. It makes sense therefore, to store the
33 * metadata in chunk size blocks.
35 * There is no backward or forward compatibility implemented,
36 * snapshots with different disk versions than the kernel will
37 * not be usable. It is expected that "lvcreate" will blank out
38 * the start of a fresh COW device before calling the snapshot
41 * The first chunk of the COW device just contains the header.
42 * After this there is a chunk filled with exception metadata,
43 * followed by as many exception chunks as can fit in the
46 * All on disk structures are in little-endian format. The end
47 * of the exceptions info is indicated by an exception with a
48 * new_chunk of 0, which is invalid since it would point to the
53 * Magic for persistent snapshots: "SnAp" - Feeble isn't it.
55 #define SNAP_MAGIC 0x70416e53
58 * The on-disk version of the metadata.
60 #define SNAPSHOT_DISK_VERSION 1
66 * Is this snapshot valid. There is no way of recovering
67 * an invalid snapshot.
72 * Simple, incrementing version. no backward
81 struct disk_exception
{
86 struct commit_callback
{
87 void (*callback
)(void *, int success
);
92 * The top level structure for a persistent exception store.
95 struct dm_snapshot
*snap
; /* up pointer to my snapshot */
98 uint32_t exceptions_per_area
;
101 * Now that we have an asynchronous kcopyd there is no
102 * need for large chunk sizes, so it wont hurt to have a
103 * whole chunks worth of metadata in memory at once.
108 * Used to keep track of which metadata area the data in
111 uint32_t current_area
;
114 * The next free chunk for an exception.
119 * The index of next free exception in the current
122 uint32_t current_committed
;
124 atomic_t pending_count
;
125 uint32_t callback_count
;
126 struct commit_callback
*callbacks
;
127 struct dm_io_client
*io_client
;
130 static inline unsigned int sectors_to_pages(unsigned int sectors
)
132 return sectors
/ (PAGE_SIZE
>> 9);
135 static int alloc_area(struct pstore
*ps
)
140 len
= ps
->snap
->chunk_size
<< SECTOR_SHIFT
;
143 * Allocate the chunk_size block of memory that will hold
144 * a single metadata area.
146 ps
->area
= vmalloc(len
);
153 static void free_area(struct pstore
*ps
)
160 * Read or write a chunk aligned and sized block of data from a device.
162 static int chunk_io(struct pstore
*ps
, uint32_t chunk
, int rw
)
164 struct io_region where
= {
165 .bdev
= ps
->snap
->cow
->bdev
,
166 .sector
= ps
->snap
->chunk_size
* chunk
,
167 .count
= ps
->snap
->chunk_size
,
169 struct dm_io_request io_req
= {
171 .mem
.type
= DM_IO_VMA
,
172 .mem
.ptr
.vma
= ps
->area
,
173 .client
= ps
->io_client
,
177 return dm_io(&io_req
, 1, &where
, NULL
);
181 * Read or write a metadata area. Remembering to skip the first
182 * chunk which holds the header.
184 static int area_io(struct pstore
*ps
, uint32_t area
, int rw
)
189 /* convert a metadata area index to a chunk index */
190 chunk
= 1 + ((ps
->exceptions_per_area
+ 1) * area
);
192 r
= chunk_io(ps
, chunk
, rw
);
196 ps
->current_area
= area
;
200 static int zero_area(struct pstore
*ps
, uint32_t area
)
202 memset(ps
->area
, 0, ps
->snap
->chunk_size
<< SECTOR_SHIFT
);
203 return area_io(ps
, area
, WRITE
);
206 static int read_header(struct pstore
*ps
, int *new_snapshot
)
209 struct disk_header
*dh
;
211 int chunk_size_supplied
= 1;
214 * Use default chunk size (or hardsect_size, if larger) if none supplied
216 if (!ps
->snap
->chunk_size
) {
217 ps
->snap
->chunk_size
= max(DM_CHUNK_SIZE_DEFAULT_SECTORS
,
218 bdev_hardsect_size(ps
->snap
->cow
->bdev
) >> 9);
219 ps
->snap
->chunk_mask
= ps
->snap
->chunk_size
- 1;
220 ps
->snap
->chunk_shift
= ffs(ps
->snap
->chunk_size
) - 1;
221 chunk_size_supplied
= 0;
224 ps
->io_client
= dm_io_client_create(sectors_to_pages(ps
->snap
->
226 if (IS_ERR(ps
->io_client
))
227 return PTR_ERR(ps
->io_client
);
233 r
= chunk_io(ps
, 0, READ
);
237 dh
= (struct disk_header
*) ps
->area
;
239 if (le32_to_cpu(dh
->magic
) == 0) {
244 if (le32_to_cpu(dh
->magic
) != SNAP_MAGIC
) {
245 DMWARN("Invalid or corrupt snapshot");
251 ps
->valid
= le32_to_cpu(dh
->valid
);
252 ps
->version
= le32_to_cpu(dh
->version
);
253 chunk_size
= le32_to_cpu(dh
->chunk_size
);
255 if (!chunk_size_supplied
|| ps
->snap
->chunk_size
== chunk_size
)
258 DMWARN("chunk size %llu in device metadata overrides "
259 "table chunk size of %llu.",
260 (unsigned long long)chunk_size
,
261 (unsigned long long)ps
->snap
->chunk_size
);
263 /* We had a bogus chunk_size. Fix stuff up. */
266 ps
->snap
->chunk_size
= chunk_size
;
267 ps
->snap
->chunk_mask
= chunk_size
- 1;
268 ps
->snap
->chunk_shift
= ffs(chunk_size
) - 1;
270 r
= dm_io_client_resize(sectors_to_pages(ps
->snap
->chunk_size
),
283 static int write_header(struct pstore
*ps
)
285 struct disk_header
*dh
;
287 memset(ps
->area
, 0, ps
->snap
->chunk_size
<< SECTOR_SHIFT
);
289 dh
= (struct disk_header
*) ps
->area
;
290 dh
->magic
= cpu_to_le32(SNAP_MAGIC
);
291 dh
->valid
= cpu_to_le32(ps
->valid
);
292 dh
->version
= cpu_to_le32(ps
->version
);
293 dh
->chunk_size
= cpu_to_le32(ps
->snap
->chunk_size
);
295 return chunk_io(ps
, 0, WRITE
);
299 * Access functions for the disk exceptions, these do the endian conversions.
301 static struct disk_exception
*get_exception(struct pstore
*ps
, uint32_t index
)
303 BUG_ON(index
>= ps
->exceptions_per_area
);
305 return ((struct disk_exception
*) ps
->area
) + index
;
308 static void read_exception(struct pstore
*ps
,
309 uint32_t index
, struct disk_exception
*result
)
311 struct disk_exception
*e
= get_exception(ps
, index
);
314 result
->old_chunk
= le64_to_cpu(e
->old_chunk
);
315 result
->new_chunk
= le64_to_cpu(e
->new_chunk
);
318 static void write_exception(struct pstore
*ps
,
319 uint32_t index
, struct disk_exception
*de
)
321 struct disk_exception
*e
= get_exception(ps
, index
);
324 e
->old_chunk
= cpu_to_le64(de
->old_chunk
);
325 e
->new_chunk
= cpu_to_le64(de
->new_chunk
);
329 * Registers the exceptions that are present in the current area.
330 * 'full' is filled in to indicate if the area has been
333 static int insert_exceptions(struct pstore
*ps
, int *full
)
337 struct disk_exception de
;
339 /* presume the area is full */
342 for (i
= 0; i
< ps
->exceptions_per_area
; i
++) {
343 read_exception(ps
, i
, &de
);
346 * If the new_chunk is pointing at the start of
347 * the COW device, where the first metadata area
348 * is we know that we've hit the end of the
349 * exceptions. Therefore the area is not full.
351 if (de
.new_chunk
== 0LL) {
352 ps
->current_committed
= i
;
358 * Keep track of the start of the free chunks.
360 if (ps
->next_free
<= de
.new_chunk
)
361 ps
->next_free
= de
.new_chunk
+ 1;
364 * Otherwise we add the exception to the snapshot.
366 r
= dm_add_exception(ps
->snap
, de
.old_chunk
, de
.new_chunk
);
374 static int read_exceptions(struct pstore
*ps
)
380 * Keeping reading chunks and inserting exceptions until
381 * we find a partially full area.
383 for (area
= 0; full
; area
++) {
384 r
= area_io(ps
, area
, READ
);
388 r
= insert_exceptions(ps
, &full
);
396 static inline struct pstore
*get_info(struct exception_store
*store
)
398 return (struct pstore
*) store
->context
;
401 static void persistent_fraction_full(struct exception_store
*store
,
402 sector_t
*numerator
, sector_t
*denominator
)
404 *numerator
= get_info(store
)->next_free
* store
->snap
->chunk_size
;
405 *denominator
= get_dev_size(store
->snap
->cow
->bdev
);
408 static void persistent_destroy(struct exception_store
*store
)
410 struct pstore
*ps
= get_info(store
);
412 dm_io_client_destroy(ps
->io_client
);
413 vfree(ps
->callbacks
);
418 static int persistent_read_metadata(struct exception_store
*store
)
421 struct pstore
*ps
= get_info(store
);
424 * Read the snapshot header.
426 r
= read_header(ps
, &new_snapshot
);
431 * Now we know correct chunk_size, complete the initialisation.
433 ps
->exceptions_per_area
= (ps
->snap
->chunk_size
<< SECTOR_SHIFT
) /
434 sizeof(struct disk_exception
);
435 ps
->callbacks
= dm_vcalloc(ps
->exceptions_per_area
,
436 sizeof(*ps
->callbacks
));
441 * Do we need to setup a new snapshot ?
444 r
= write_header(ps
);
446 DMWARN("write_header failed");
450 r
= zero_area(ps
, 0);
452 DMWARN("zero_area(0) failed");
461 DMWARN("snapshot is marked invalid");
465 if (ps
->version
!= SNAPSHOT_DISK_VERSION
) {
466 DMWARN("unable to handle snapshot disk version %d",
474 r
= read_exceptions(ps
);
482 static int persistent_prepare(struct exception_store
*store
,
485 struct pstore
*ps
= get_info(store
);
487 sector_t size
= get_dev_size(store
->snap
->cow
->bdev
);
489 /* Is there enough room ? */
490 if (size
< ((ps
->next_free
+ 1) * store
->snap
->chunk_size
))
493 e
->new_chunk
= ps
->next_free
;
496 * Move onto the next free pending, making sure to take
497 * into account the location of the metadata chunks.
499 stride
= (ps
->exceptions_per_area
+ 1);
500 if ((++ps
->next_free
% stride
) == 1)
503 atomic_inc(&ps
->pending_count
);
507 static void persistent_commit(struct exception_store
*store
,
509 void (*callback
) (void *, int success
),
510 void *callback_context
)
514 struct pstore
*ps
= get_info(store
);
515 struct disk_exception de
;
516 struct commit_callback
*cb
;
518 de
.old_chunk
= e
->old_chunk
;
519 de
.new_chunk
= e
->new_chunk
;
520 write_exception(ps
, ps
->current_committed
++, &de
);
523 * Add the callback to the back of the array. This code
524 * is the only place where the callback array is
525 * manipulated, and we know that it will never be called
526 * multiple times concurrently.
528 cb
= ps
->callbacks
+ ps
->callback_count
++;
529 cb
->callback
= callback
;
530 cb
->context
= callback_context
;
533 * If there are no more exceptions in flight, or we have
534 * filled this metadata area we commit the exceptions to
537 if (atomic_dec_and_test(&ps
->pending_count
) ||
538 (ps
->current_committed
== ps
->exceptions_per_area
)) {
539 r
= area_io(ps
, ps
->current_area
, WRITE
);
544 * Have we completely filled the current area ?
546 if (ps
->current_committed
== ps
->exceptions_per_area
) {
547 ps
->current_committed
= 0;
548 r
= zero_area(ps
, ps
->current_area
+ 1);
553 for (i
= 0; i
< ps
->callback_count
; i
++) {
554 cb
= ps
->callbacks
+ i
;
555 cb
->callback(cb
->context
, r
== 0 ? 1 : 0);
558 ps
->callback_count
= 0;
562 static void persistent_drop(struct exception_store
*store
)
564 struct pstore
*ps
= get_info(store
);
567 if (write_header(ps
))
568 DMWARN("write header failed");
571 int dm_create_persistent(struct exception_store
*store
)
575 /* allocate the pstore */
576 ps
= kmalloc(sizeof(*ps
), GFP_KERNEL
);
580 ps
->snap
= store
->snap
;
582 ps
->version
= SNAPSHOT_DISK_VERSION
;
584 ps
->next_free
= 2; /* skipping the header and first area */
585 ps
->current_committed
= 0;
587 ps
->callback_count
= 0;
588 atomic_set(&ps
->pending_count
, 0);
589 ps
->callbacks
= NULL
;
591 store
->destroy
= persistent_destroy
;
592 store
->read_metadata
= persistent_read_metadata
;
593 store
->prepare_exception
= persistent_prepare
;
594 store
->commit_exception
= persistent_commit
;
595 store
->drop_snapshot
= persistent_drop
;
596 store
->fraction_full
= persistent_fraction_full
;
602 /*-----------------------------------------------------------------
603 * Implementation of the store for non-persistent snapshots.
604 *---------------------------------------------------------------*/
609 static void transient_destroy(struct exception_store
*store
)
611 kfree(store
->context
);
614 static int transient_read_metadata(struct exception_store
*store
)
619 static int transient_prepare(struct exception_store
*store
, struct exception
*e
)
621 struct transient_c
*tc
= (struct transient_c
*) store
->context
;
622 sector_t size
= get_dev_size(store
->snap
->cow
->bdev
);
624 if (size
< (tc
->next_free
+ store
->snap
->chunk_size
))
627 e
->new_chunk
= sector_to_chunk(store
->snap
, tc
->next_free
);
628 tc
->next_free
+= store
->snap
->chunk_size
;
633 static void transient_commit(struct exception_store
*store
,
635 void (*callback
) (void *, int success
),
636 void *callback_context
)
639 callback(callback_context
, 1);
642 static void transient_fraction_full(struct exception_store
*store
,
643 sector_t
*numerator
, sector_t
*denominator
)
645 *numerator
= ((struct transient_c
*) store
->context
)->next_free
;
646 *denominator
= get_dev_size(store
->snap
->cow
->bdev
);
649 int dm_create_transient(struct exception_store
*store
)
651 struct transient_c
*tc
;
653 store
->destroy
= transient_destroy
;
654 store
->read_metadata
= transient_read_metadata
;
655 store
->prepare_exception
= transient_prepare
;
656 store
->commit_exception
= transient_commit
;
657 store
->drop_snapshot
= NULL
;
658 store
->fraction_full
= transient_fraction_full
;
660 tc
= kmalloc(sizeof(struct transient_c
), GFP_KERNEL
);