4 * Copyright (C) 2001-2002 Sistina Software (UK) Limited.
6 * This file is released under the GPL.
9 #include <linux/blkdev.h>
10 #include <linux/device-mapper.h>
11 #include <linux/delay.h>
13 #include <linux/init.h>
14 #include <linux/kdev_t.h>
15 #include <linux/list.h>
16 #include <linux/mempool.h>
17 #include <linux/module.h>
18 #include <linux/slab.h>
19 #include <linux/vmalloc.h>
20 #include <linux/log2.h>
21 #include <linux/dm-kcopyd.h>
22 #include <linux/workqueue.h>
24 #include "dm-exception-store.h"
26 #define DM_MSG_PREFIX "snapshots"
29 * The percentage increment we will wake up users at
31 #define WAKE_UP_PERCENT 5
34 * kcopyd priority of snapshot operations
36 #define SNAPSHOT_COPY_PRIORITY 2
39 * Reserve 1MB for each snapshot initially (with minimum of 1 page).
41 #define SNAPSHOT_PAGES (((1UL << 20) >> PAGE_SHIFT) ? : 1)
44 * The size of the mempool used to track chunks in use.
48 #define DM_TRACKED_CHUNK_HASH_SIZE 16
49 #define DM_TRACKED_CHUNK_HASH(x) ((unsigned long)(x) & \
50 (DM_TRACKED_CHUNK_HASH_SIZE - 1))
52 struct exception_table
{
55 struct list_head
*table
;
59 struct rw_semaphore lock
;
61 struct dm_dev
*origin
;
63 /* List of snapshots per Origin */
64 struct list_head list
;
66 /* You can't use a snapshot if this is 0 (e.g. if full) */
69 /* Origin writes don't trigger exceptions until this is set */
72 mempool_t
*pending_pool
;
74 atomic_t pending_exceptions_count
;
76 struct exception_table pending
;
77 struct exception_table complete
;
80 * pe_lock protects all pending_exception operations and access
81 * as well as the snapshot_bios list.
85 /* The on disk metadata handler */
86 struct dm_exception_store
*store
;
88 struct dm_kcopyd_client
*kcopyd_client
;
90 /* Queue of snapshot writes for ksnapd to flush */
91 struct bio_list queued_bios
;
92 struct work_struct queued_bios_work
;
94 /* Chunks with outstanding reads */
95 mempool_t
*tracked_chunk_pool
;
96 spinlock_t tracked_chunk_lock
;
97 struct hlist_head tracked_chunk_hash
[DM_TRACKED_CHUNK_HASH_SIZE
];
100 static struct workqueue_struct
*ksnapd
;
101 static void flush_queued_bios(struct work_struct
*work
);
103 static sector_t
chunk_to_sector(struct dm_exception_store
*store
,
106 return chunk
<< store
->chunk_shift
;
109 static int bdev_equal(struct block_device
*lhs
, struct block_device
*rhs
)
112 * There is only ever one instance of a particular block
113 * device so we can compare pointers safely.
118 struct dm_snap_pending_exception
{
119 struct dm_snap_exception e
;
122 * Origin buffers waiting for this to complete are held
125 struct bio_list origin_bios
;
126 struct bio_list snapshot_bios
;
129 * Short-term queue of pending exceptions prior to submission.
131 struct list_head list
;
134 * The primary pending_exception is the one that holds
135 * the ref_count and the list of origin_bios for a
136 * group of pending_exceptions. It is always last to get freed.
137 * These fields get set up when writing to the origin.
139 struct dm_snap_pending_exception
*primary_pe
;
142 * Number of pending_exceptions processing this chunk.
143 * When this drops to zero we must complete the origin bios.
144 * If incrementing or decrementing this, hold pe->snap->lock for
145 * the sibling concerned and not pe->primary_pe->snap->lock unless
150 /* Pointer back to snapshot context */
151 struct dm_snapshot
*snap
;
154 * 1 indicates the exception has already been sent to
161 * Hash table mapping origin volumes to lists of snapshots and
162 * a lock to protect it
164 static struct kmem_cache
*exception_cache
;
165 static struct kmem_cache
*pending_cache
;
167 struct dm_snap_tracked_chunk
{
168 struct hlist_node node
;
172 static struct kmem_cache
*tracked_chunk_cache
;
174 static struct dm_snap_tracked_chunk
*track_chunk(struct dm_snapshot
*s
,
177 struct dm_snap_tracked_chunk
*c
= mempool_alloc(s
->tracked_chunk_pool
,
183 spin_lock_irqsave(&s
->tracked_chunk_lock
, flags
);
184 hlist_add_head(&c
->node
,
185 &s
->tracked_chunk_hash
[DM_TRACKED_CHUNK_HASH(chunk
)]);
186 spin_unlock_irqrestore(&s
->tracked_chunk_lock
, flags
);
191 static void stop_tracking_chunk(struct dm_snapshot
*s
,
192 struct dm_snap_tracked_chunk
*c
)
196 spin_lock_irqsave(&s
->tracked_chunk_lock
, flags
);
198 spin_unlock_irqrestore(&s
->tracked_chunk_lock
, flags
);
200 mempool_free(c
, s
->tracked_chunk_pool
);
203 static int __chunk_is_tracked(struct dm_snapshot
*s
, chunk_t chunk
)
205 struct dm_snap_tracked_chunk
*c
;
206 struct hlist_node
*hn
;
209 spin_lock_irq(&s
->tracked_chunk_lock
);
211 hlist_for_each_entry(c
, hn
,
212 &s
->tracked_chunk_hash
[DM_TRACKED_CHUNK_HASH(chunk
)], node
) {
213 if (c
->chunk
== chunk
) {
219 spin_unlock_irq(&s
->tracked_chunk_lock
);
225 * One of these per registered origin, held in the snapshot_origins hash
228 /* The origin device */
229 struct block_device
*bdev
;
231 struct list_head hash_list
;
233 /* List of snapshots for this origin */
234 struct list_head snapshots
;
238 * Size of the hash table for origin volumes. If we make this
239 * the size of the minors list then it should be nearly perfect
241 #define ORIGIN_HASH_SIZE 256
242 #define ORIGIN_MASK 0xFF
243 static struct list_head
*_origins
;
244 static struct rw_semaphore _origins_lock
;
246 static int init_origin_hash(void)
250 _origins
= kmalloc(ORIGIN_HASH_SIZE
* sizeof(struct list_head
),
253 DMERR("unable to allocate memory");
257 for (i
= 0; i
< ORIGIN_HASH_SIZE
; i
++)
258 INIT_LIST_HEAD(_origins
+ i
);
259 init_rwsem(&_origins_lock
);
264 static void exit_origin_hash(void)
269 static unsigned origin_hash(struct block_device
*bdev
)
271 return bdev
->bd_dev
& ORIGIN_MASK
;
274 static struct origin
*__lookup_origin(struct block_device
*origin
)
276 struct list_head
*ol
;
279 ol
= &_origins
[origin_hash(origin
)];
280 list_for_each_entry (o
, ol
, hash_list
)
281 if (bdev_equal(o
->bdev
, origin
))
287 static void __insert_origin(struct origin
*o
)
289 struct list_head
*sl
= &_origins
[origin_hash(o
->bdev
)];
290 list_add_tail(&o
->hash_list
, sl
);
294 * Make a note of the snapshot and its origin so we can look it
295 * up when the origin has a write on it.
297 static int register_snapshot(struct dm_snapshot
*snap
)
299 struct origin
*o
, *new_o
;
300 struct block_device
*bdev
= snap
->origin
->bdev
;
302 new_o
= kmalloc(sizeof(*new_o
), GFP_KERNEL
);
306 down_write(&_origins_lock
);
307 o
= __lookup_origin(bdev
);
315 /* Initialise the struct */
316 INIT_LIST_HEAD(&o
->snapshots
);
322 list_add_tail(&snap
->list
, &o
->snapshots
);
324 up_write(&_origins_lock
);
328 static void unregister_snapshot(struct dm_snapshot
*s
)
332 down_write(&_origins_lock
);
333 o
= __lookup_origin(s
->origin
->bdev
);
336 if (list_empty(&o
->snapshots
)) {
337 list_del(&o
->hash_list
);
341 up_write(&_origins_lock
);
345 * Implementation of the exception hash tables.
346 * The lowest hash_shift bits of the chunk number are ignored, allowing
347 * some consecutive chunks to be grouped together.
349 static int init_exception_table(struct exception_table
*et
, uint32_t size
,
354 et
->hash_shift
= hash_shift
;
355 et
->hash_mask
= size
- 1;
356 et
->table
= dm_vcalloc(size
, sizeof(struct list_head
));
360 for (i
= 0; i
< size
; i
++)
361 INIT_LIST_HEAD(et
->table
+ i
);
366 static void exit_exception_table(struct exception_table
*et
, struct kmem_cache
*mem
)
368 struct list_head
*slot
;
369 struct dm_snap_exception
*ex
, *next
;
372 size
= et
->hash_mask
+ 1;
373 for (i
= 0; i
< size
; i
++) {
374 slot
= et
->table
+ i
;
376 list_for_each_entry_safe (ex
, next
, slot
, hash_list
)
377 kmem_cache_free(mem
, ex
);
383 static uint32_t exception_hash(struct exception_table
*et
, chunk_t chunk
)
385 return (chunk
>> et
->hash_shift
) & et
->hash_mask
;
388 static void insert_exception(struct exception_table
*eh
,
389 struct dm_snap_exception
*e
)
391 struct list_head
*l
= &eh
->table
[exception_hash(eh
, e
->old_chunk
)];
392 list_add(&e
->hash_list
, l
);
395 static void remove_exception(struct dm_snap_exception
*e
)
397 list_del(&e
->hash_list
);
401 * Return the exception data for a sector, or NULL if not
404 static struct dm_snap_exception
*lookup_exception(struct exception_table
*et
,
407 struct list_head
*slot
;
408 struct dm_snap_exception
*e
;
410 slot
= &et
->table
[exception_hash(et
, chunk
)];
411 list_for_each_entry (e
, slot
, hash_list
)
412 if (chunk
>= e
->old_chunk
&&
413 chunk
<= e
->old_chunk
+ dm_consecutive_chunk_count(e
))
419 static struct dm_snap_exception
*alloc_exception(void)
421 struct dm_snap_exception
*e
;
423 e
= kmem_cache_alloc(exception_cache
, GFP_NOIO
);
425 e
= kmem_cache_alloc(exception_cache
, GFP_ATOMIC
);
430 static void free_exception(struct dm_snap_exception
*e
)
432 kmem_cache_free(exception_cache
, e
);
435 static struct dm_snap_pending_exception
*alloc_pending_exception(struct dm_snapshot
*s
)
437 struct dm_snap_pending_exception
*pe
= mempool_alloc(s
->pending_pool
,
440 atomic_inc(&s
->pending_exceptions_count
);
446 static void free_pending_exception(struct dm_snap_pending_exception
*pe
)
448 struct dm_snapshot
*s
= pe
->snap
;
450 mempool_free(pe
, s
->pending_pool
);
451 smp_mb__before_atomic_dec();
452 atomic_dec(&s
->pending_exceptions_count
);
455 static void insert_completed_exception(struct dm_snapshot
*s
,
456 struct dm_snap_exception
*new_e
)
458 struct exception_table
*eh
= &s
->complete
;
460 struct dm_snap_exception
*e
= NULL
;
462 l
= &eh
->table
[exception_hash(eh
, new_e
->old_chunk
)];
464 /* Add immediately if this table doesn't support consecutive chunks */
468 /* List is ordered by old_chunk */
469 list_for_each_entry_reverse(e
, l
, hash_list
) {
470 /* Insert after an existing chunk? */
471 if (new_e
->old_chunk
== (e
->old_chunk
+
472 dm_consecutive_chunk_count(e
) + 1) &&
473 new_e
->new_chunk
== (dm_chunk_number(e
->new_chunk
) +
474 dm_consecutive_chunk_count(e
) + 1)) {
475 dm_consecutive_chunk_count_inc(e
);
476 free_exception(new_e
);
480 /* Insert before an existing chunk? */
481 if (new_e
->old_chunk
== (e
->old_chunk
- 1) &&
482 new_e
->new_chunk
== (dm_chunk_number(e
->new_chunk
) - 1)) {
483 dm_consecutive_chunk_count_inc(e
);
486 free_exception(new_e
);
490 if (new_e
->old_chunk
> e
->old_chunk
)
495 list_add(&new_e
->hash_list
, e
? &e
->hash_list
: l
);
499 * Callback used by the exception stores to load exceptions when
502 static int dm_add_exception(void *context
, chunk_t old
, chunk_t
new)
504 struct dm_snapshot
*s
= context
;
505 struct dm_snap_exception
*e
;
507 e
= alloc_exception();
513 /* Consecutive_count is implicitly initialised to zero */
516 insert_completed_exception(s
, e
);
524 static int calc_max_buckets(void)
526 /* use a fixed size of 2MB */
527 unsigned long mem
= 2 * 1024 * 1024;
528 mem
/= sizeof(struct list_head
);
534 * Allocate room for a suitable hash table.
536 static int init_hash_tables(struct dm_snapshot
*s
)
538 sector_t hash_size
, cow_dev_size
, origin_dev_size
, max_buckets
;
541 * Calculate based on the size of the original volume or
544 cow_dev_size
= get_dev_size(s
->store
->cow
->bdev
);
545 origin_dev_size
= get_dev_size(s
->origin
->bdev
);
546 max_buckets
= calc_max_buckets();
548 hash_size
= min(origin_dev_size
, cow_dev_size
) >> s
->store
->chunk_shift
;
549 hash_size
= min(hash_size
, max_buckets
);
551 hash_size
= rounddown_pow_of_two(hash_size
);
552 if (init_exception_table(&s
->complete
, hash_size
,
553 DM_CHUNK_CONSECUTIVE_BITS
))
557 * Allocate hash table for in-flight exceptions
558 * Make this smaller than the real hash table
564 if (init_exception_table(&s
->pending
, hash_size
, 0)) {
565 exit_exception_table(&s
->complete
, exception_cache
);
573 * Construct a snapshot mapping: <origin_dev> <COW-dev> <p/n> <chunk-size>
575 static int snapshot_ctr(struct dm_target
*ti
, unsigned int argc
, char **argv
)
577 struct dm_snapshot
*s
;
581 struct dm_exception_store
*store
;
585 ti
->error
= "requires exactly 4 arguments";
590 origin_path
= argv
[0];
594 r
= dm_exception_store_create(ti
, argc
, argv
, &args_used
, &store
);
596 ti
->error
= "Couldn't create exception store";
604 s
= kmalloc(sizeof(*s
), GFP_KERNEL
);
606 ti
->error
= "Cannot allocate snapshot context private "
612 r
= dm_get_device(ti
, origin_path
, 0, ti
->len
, FMODE_READ
, &s
->origin
);
614 ti
->error
= "Cannot get origin device";
621 atomic_set(&s
->pending_exceptions_count
, 0);
622 init_rwsem(&s
->lock
);
623 spin_lock_init(&s
->pe_lock
);
625 /* Allocate hash table for COW data */
626 if (init_hash_tables(s
)) {
627 ti
->error
= "Unable to allocate hash table space";
629 goto bad_hash_tables
;
632 r
= dm_kcopyd_client_create(SNAPSHOT_PAGES
, &s
->kcopyd_client
);
634 ti
->error
= "Could not create kcopyd client";
638 s
->pending_pool
= mempool_create_slab_pool(MIN_IOS
, pending_cache
);
639 if (!s
->pending_pool
) {
640 ti
->error
= "Could not allocate mempool for pending exceptions";
641 goto bad_pending_pool
;
644 s
->tracked_chunk_pool
= mempool_create_slab_pool(MIN_IOS
,
645 tracked_chunk_cache
);
646 if (!s
->tracked_chunk_pool
) {
647 ti
->error
= "Could not allocate tracked_chunk mempool for "
649 goto bad_tracked_chunk_pool
;
652 for (i
= 0; i
< DM_TRACKED_CHUNK_HASH_SIZE
; i
++)
653 INIT_HLIST_HEAD(&s
->tracked_chunk_hash
[i
]);
655 spin_lock_init(&s
->tracked_chunk_lock
);
657 /* Metadata must only be loaded into one table at once */
658 r
= s
->store
->type
->read_metadata(s
->store
, dm_add_exception
,
661 ti
->error
= "Failed to read snapshot metadata";
662 goto bad_load_and_register
;
665 DMWARN("Snapshot is marked invalid.");
668 bio_list_init(&s
->queued_bios
);
669 INIT_WORK(&s
->queued_bios_work
, flush_queued_bios
);
671 /* Add snapshot to the list of snapshots for this origin */
672 /* Exceptions aren't triggered till snapshot_resume() is called */
673 if (register_snapshot(s
)) {
675 ti
->error
= "Cannot register snapshot origin";
676 goto bad_load_and_register
;
680 ti
->split_io
= s
->store
->chunk_size
;
681 ti
->num_flush_requests
= 1;
685 bad_load_and_register
:
686 mempool_destroy(s
->tracked_chunk_pool
);
688 bad_tracked_chunk_pool
:
689 mempool_destroy(s
->pending_pool
);
692 dm_kcopyd_client_destroy(s
->kcopyd_client
);
695 exit_exception_table(&s
->pending
, pending_cache
);
696 exit_exception_table(&s
->complete
, exception_cache
);
699 dm_put_device(ti
, s
->origin
);
705 dm_exception_store_destroy(store
);
711 static void __free_exceptions(struct dm_snapshot
*s
)
713 dm_kcopyd_client_destroy(s
->kcopyd_client
);
714 s
->kcopyd_client
= NULL
;
716 exit_exception_table(&s
->pending
, pending_cache
);
717 exit_exception_table(&s
->complete
, exception_cache
);
720 static void snapshot_dtr(struct dm_target
*ti
)
722 #ifdef CONFIG_DM_DEBUG
725 struct dm_snapshot
*s
= ti
->private;
727 flush_workqueue(ksnapd
);
729 /* Prevent further origin writes from using this snapshot. */
730 /* After this returns there can be no new kcopyd jobs. */
731 unregister_snapshot(s
);
733 while (atomic_read(&s
->pending_exceptions_count
))
736 * Ensure instructions in mempool_destroy aren't reordered
737 * before atomic_read.
741 #ifdef CONFIG_DM_DEBUG
742 for (i
= 0; i
< DM_TRACKED_CHUNK_HASH_SIZE
; i
++)
743 BUG_ON(!hlist_empty(&s
->tracked_chunk_hash
[i
]));
746 mempool_destroy(s
->tracked_chunk_pool
);
748 __free_exceptions(s
);
750 mempool_destroy(s
->pending_pool
);
752 dm_put_device(ti
, s
->origin
);
754 dm_exception_store_destroy(s
->store
);
760 * Flush a list of buffers.
762 static void flush_bios(struct bio
*bio
)
769 generic_make_request(bio
);
774 static void flush_queued_bios(struct work_struct
*work
)
776 struct dm_snapshot
*s
=
777 container_of(work
, struct dm_snapshot
, queued_bios_work
);
778 struct bio
*queued_bios
;
781 spin_lock_irqsave(&s
->pe_lock
, flags
);
782 queued_bios
= bio_list_get(&s
->queued_bios
);
783 spin_unlock_irqrestore(&s
->pe_lock
, flags
);
785 flush_bios(queued_bios
);
789 * Error a list of buffers.
791 static void error_bios(struct bio
*bio
)
803 static void __invalidate_snapshot(struct dm_snapshot
*s
, int err
)
809 DMERR("Invalidating snapshot: Error reading/writing.");
810 else if (err
== -ENOMEM
)
811 DMERR("Invalidating snapshot: Unable to allocate exception.");
813 if (s
->store
->type
->drop_snapshot
)
814 s
->store
->type
->drop_snapshot(s
->store
);
818 dm_table_event(s
->store
->ti
->table
);
821 static void get_pending_exception(struct dm_snap_pending_exception
*pe
)
823 atomic_inc(&pe
->ref_count
);
826 static struct bio
*put_pending_exception(struct dm_snap_pending_exception
*pe
)
828 struct dm_snap_pending_exception
*primary_pe
;
829 struct bio
*origin_bios
= NULL
;
831 primary_pe
= pe
->primary_pe
;
834 * If this pe is involved in a write to the origin and
835 * it is the last sibling to complete then release
836 * the bios for the original write to the origin.
839 atomic_dec_and_test(&primary_pe
->ref_count
)) {
840 origin_bios
= bio_list_get(&primary_pe
->origin_bios
);
841 free_pending_exception(primary_pe
);
845 * Free the pe if it's not linked to an origin write or if
846 * it's not itself a primary pe.
848 if (!primary_pe
|| primary_pe
!= pe
)
849 free_pending_exception(pe
);
854 static void pending_complete(struct dm_snap_pending_exception
*pe
, int success
)
856 struct dm_snap_exception
*e
;
857 struct dm_snapshot
*s
= pe
->snap
;
858 struct bio
*origin_bios
= NULL
;
859 struct bio
*snapshot_bios
= NULL
;
863 /* Read/write error - snapshot is unusable */
864 down_write(&s
->lock
);
865 __invalidate_snapshot(s
, -EIO
);
870 e
= alloc_exception();
872 down_write(&s
->lock
);
873 __invalidate_snapshot(s
, -ENOMEM
);
879 down_write(&s
->lock
);
887 * Check for conflicting reads. This is extremely improbable,
888 * so msleep(1) is sufficient and there is no need for a wait queue.
890 while (__chunk_is_tracked(s
, pe
->e
.old_chunk
))
894 * Add a proper exception, and remove the
895 * in-flight exception from the list.
897 insert_completed_exception(s
, e
);
900 remove_exception(&pe
->e
);
901 snapshot_bios
= bio_list_get(&pe
->snapshot_bios
);
902 origin_bios
= put_pending_exception(pe
);
906 /* Submit any pending write bios */
908 error_bios(snapshot_bios
);
910 flush_bios(snapshot_bios
);
912 flush_bios(origin_bios
);
915 static void commit_callback(void *context
, int success
)
917 struct dm_snap_pending_exception
*pe
= context
;
919 pending_complete(pe
, success
);
923 * Called when the copy I/O has finished. kcopyd actually runs
924 * this code so don't block.
926 static void copy_callback(int read_err
, unsigned long write_err
, void *context
)
928 struct dm_snap_pending_exception
*pe
= context
;
929 struct dm_snapshot
*s
= pe
->snap
;
931 if (read_err
|| write_err
)
932 pending_complete(pe
, 0);
935 /* Update the metadata if we are persistent */
936 s
->store
->type
->commit_exception(s
->store
, &pe
->e
,
937 commit_callback
, pe
);
941 * Dispatches the copy operation to kcopyd.
943 static void start_copy(struct dm_snap_pending_exception
*pe
)
945 struct dm_snapshot
*s
= pe
->snap
;
946 struct dm_io_region src
, dest
;
947 struct block_device
*bdev
= s
->origin
->bdev
;
950 dev_size
= get_dev_size(bdev
);
953 src
.sector
= chunk_to_sector(s
->store
, pe
->e
.old_chunk
);
954 src
.count
= min(s
->store
->chunk_size
, dev_size
- src
.sector
);
956 dest
.bdev
= s
->store
->cow
->bdev
;
957 dest
.sector
= chunk_to_sector(s
->store
, pe
->e
.new_chunk
);
958 dest
.count
= src
.count
;
960 /* Hand over to kcopyd */
961 dm_kcopyd_copy(s
->kcopyd_client
,
962 &src
, 1, &dest
, 0, copy_callback
, pe
);
965 static struct dm_snap_pending_exception
*
966 __lookup_pending_exception(struct dm_snapshot
*s
, chunk_t chunk
)
968 struct dm_snap_exception
*e
= lookup_exception(&s
->pending
, chunk
);
973 return container_of(e
, struct dm_snap_pending_exception
, e
);
977 * Looks to see if this snapshot already has a pending exception
978 * for this chunk, otherwise it allocates a new one and inserts
979 * it into the pending table.
981 * NOTE: a write lock must be held on snap->lock before calling
984 static struct dm_snap_pending_exception
*
985 __find_pending_exception(struct dm_snapshot
*s
,
986 struct dm_snap_pending_exception
*pe
, chunk_t chunk
)
988 struct dm_snap_pending_exception
*pe2
;
990 pe2
= __lookup_pending_exception(s
, chunk
);
992 free_pending_exception(pe
);
996 pe
->e
.old_chunk
= chunk
;
997 bio_list_init(&pe
->origin_bios
);
998 bio_list_init(&pe
->snapshot_bios
);
999 pe
->primary_pe
= NULL
;
1000 atomic_set(&pe
->ref_count
, 0);
1003 if (s
->store
->type
->prepare_exception(s
->store
, &pe
->e
)) {
1004 free_pending_exception(pe
);
1008 get_pending_exception(pe
);
1009 insert_exception(&s
->pending
, &pe
->e
);
1014 static void remap_exception(struct dm_snapshot
*s
, struct dm_snap_exception
*e
,
1015 struct bio
*bio
, chunk_t chunk
)
1017 bio
->bi_bdev
= s
->store
->cow
->bdev
;
1018 bio
->bi_sector
= chunk_to_sector(s
->store
,
1019 dm_chunk_number(e
->new_chunk
) +
1020 (chunk
- e
->old_chunk
)) +
1022 s
->store
->chunk_mask
);
1025 static int snapshot_map(struct dm_target
*ti
, struct bio
*bio
,
1026 union map_info
*map_context
)
1028 struct dm_snap_exception
*e
;
1029 struct dm_snapshot
*s
= ti
->private;
1030 int r
= DM_MAPIO_REMAPPED
;
1032 struct dm_snap_pending_exception
*pe
= NULL
;
1034 if (unlikely(bio_empty_barrier(bio
))) {
1035 bio
->bi_bdev
= s
->store
->cow
->bdev
;
1036 return DM_MAPIO_REMAPPED
;
1039 chunk
= sector_to_chunk(s
->store
, bio
->bi_sector
);
1041 /* Full snapshots are not usable */
1042 /* To get here the table must be live so s->active is always set. */
1046 /* FIXME: should only take write lock if we need
1047 * to copy an exception */
1048 down_write(&s
->lock
);
1055 /* If the block is already remapped - use that, else remap it */
1056 e
= lookup_exception(&s
->complete
, chunk
);
1058 remap_exception(s
, e
, bio
, chunk
);
1063 * Write to snapshot - higher level takes care of RW/RO
1064 * flags so we should only get this if we are
1067 if (bio_rw(bio
) == WRITE
) {
1068 pe
= __lookup_pending_exception(s
, chunk
);
1071 pe
= alloc_pending_exception(s
);
1072 down_write(&s
->lock
);
1075 free_pending_exception(pe
);
1080 e
= lookup_exception(&s
->complete
, chunk
);
1082 free_pending_exception(pe
);
1083 remap_exception(s
, e
, bio
, chunk
);
1087 pe
= __find_pending_exception(s
, pe
, chunk
);
1089 __invalidate_snapshot(s
, -ENOMEM
);
1095 remap_exception(s
, &pe
->e
, bio
, chunk
);
1096 bio_list_add(&pe
->snapshot_bios
, bio
);
1098 r
= DM_MAPIO_SUBMITTED
;
1101 /* this is protected by snap->lock */
1108 bio
->bi_bdev
= s
->origin
->bdev
;
1109 map_context
->ptr
= track_chunk(s
, chunk
);
1118 static int snapshot_end_io(struct dm_target
*ti
, struct bio
*bio
,
1119 int error
, union map_info
*map_context
)
1121 struct dm_snapshot
*s
= ti
->private;
1122 struct dm_snap_tracked_chunk
*c
= map_context
->ptr
;
1125 stop_tracking_chunk(s
, c
);
1130 static void snapshot_resume(struct dm_target
*ti
)
1132 struct dm_snapshot
*s
= ti
->private;
1134 down_write(&s
->lock
);
1139 static int snapshot_status(struct dm_target
*ti
, status_type_t type
,
1140 char *result
, unsigned int maxlen
)
1143 struct dm_snapshot
*snap
= ti
->private;
1146 case STATUSTYPE_INFO
:
1150 if (snap
->store
->type
->fraction_full
) {
1151 sector_t numerator
, denominator
;
1152 snap
->store
->type
->fraction_full(snap
->store
,
1156 (unsigned long long)numerator
,
1157 (unsigned long long)denominator
);
1164 case STATUSTYPE_TABLE
:
1166 * kdevname returns a static pointer so we need
1167 * to make private copies if the output is to
1170 DMEMIT("%s", snap
->origin
->name
);
1171 snap
->store
->type
->status(snap
->store
, type
, result
+ sz
,
1179 /*-----------------------------------------------------------------
1181 *---------------------------------------------------------------*/
1182 static int __origin_write(struct list_head
*snapshots
, struct bio
*bio
)
1184 int r
= DM_MAPIO_REMAPPED
, first
= 0;
1185 struct dm_snapshot
*snap
;
1186 struct dm_snap_exception
*e
;
1187 struct dm_snap_pending_exception
*pe
, *next_pe
, *primary_pe
= NULL
;
1189 LIST_HEAD(pe_queue
);
1191 /* Do all the snapshots on this origin */
1192 list_for_each_entry (snap
, snapshots
, list
) {
1194 down_write(&snap
->lock
);
1196 /* Only deal with valid and active snapshots */
1197 if (!snap
->valid
|| !snap
->active
)
1200 /* Nothing to do if writing beyond end of snapshot */
1201 if (bio
->bi_sector
>= dm_table_get_size(snap
->store
->ti
->table
))
1205 * Remember, different snapshots can have
1206 * different chunk sizes.
1208 chunk
= sector_to_chunk(snap
->store
, bio
->bi_sector
);
1211 * Check exception table to see if block
1212 * is already remapped in this snapshot
1213 * and trigger an exception if not.
1215 * ref_count is initialised to 1 so pending_complete()
1216 * won't destroy the primary_pe while we're inside this loop.
1218 e
= lookup_exception(&snap
->complete
, chunk
);
1222 pe
= __lookup_pending_exception(snap
, chunk
);
1224 up_write(&snap
->lock
);
1225 pe
= alloc_pending_exception(snap
);
1226 down_write(&snap
->lock
);
1229 free_pending_exception(pe
);
1233 e
= lookup_exception(&snap
->complete
, chunk
);
1235 free_pending_exception(pe
);
1239 pe
= __find_pending_exception(snap
, pe
, chunk
);
1241 __invalidate_snapshot(snap
, -ENOMEM
);
1248 * Either every pe here has same
1249 * primary_pe or none has one yet.
1252 primary_pe
= pe
->primary_pe
;
1258 bio_list_add(&primary_pe
->origin_bios
, bio
);
1260 r
= DM_MAPIO_SUBMITTED
;
1263 if (!pe
->primary_pe
) {
1264 pe
->primary_pe
= primary_pe
;
1265 get_pending_exception(primary_pe
);
1270 list_add_tail(&pe
->list
, &pe_queue
);
1274 up_write(&snap
->lock
);
1281 * If this is the first time we're processing this chunk and
1282 * ref_count is now 1 it means all the pending exceptions
1283 * got completed while we were in the loop above, so it falls to
1284 * us here to remove the primary_pe and submit any origin_bios.
1287 if (first
&& atomic_dec_and_test(&primary_pe
->ref_count
)) {
1288 flush_bios(bio_list_get(&primary_pe
->origin_bios
));
1289 free_pending_exception(primary_pe
);
1290 /* If we got here, pe_queue is necessarily empty. */
1295 * Now that we have a complete pe list we can start the copying.
1297 list_for_each_entry_safe(pe
, next_pe
, &pe_queue
, list
)
1304 * Called on a write from the origin driver.
1306 static int do_origin(struct dm_dev
*origin
, struct bio
*bio
)
1309 int r
= DM_MAPIO_REMAPPED
;
1311 down_read(&_origins_lock
);
1312 o
= __lookup_origin(origin
->bdev
);
1314 r
= __origin_write(&o
->snapshots
, bio
);
1315 up_read(&_origins_lock
);
1321 * Origin: maps a linear range of a device, with hooks for snapshotting.
1325 * Construct an origin mapping: <dev_path>
1326 * The context for an origin is merely a 'struct dm_dev *'
1327 * pointing to the real device.
1329 static int origin_ctr(struct dm_target
*ti
, unsigned int argc
, char **argv
)
1335 ti
->error
= "origin: incorrect number of arguments";
1339 r
= dm_get_device(ti
, argv
[0], 0, ti
->len
,
1340 dm_table_get_mode(ti
->table
), &dev
);
1342 ti
->error
= "Cannot get target device";
1347 ti
->num_flush_requests
= 1;
1352 static void origin_dtr(struct dm_target
*ti
)
1354 struct dm_dev
*dev
= ti
->private;
1355 dm_put_device(ti
, dev
);
1358 static int origin_map(struct dm_target
*ti
, struct bio
*bio
,
1359 union map_info
*map_context
)
1361 struct dm_dev
*dev
= ti
->private;
1362 bio
->bi_bdev
= dev
->bdev
;
1364 if (unlikely(bio_empty_barrier(bio
)))
1365 return DM_MAPIO_REMAPPED
;
1367 /* Only tell snapshots if this is a write */
1368 return (bio_rw(bio
) == WRITE
) ? do_origin(dev
, bio
) : DM_MAPIO_REMAPPED
;
1371 #define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
1374 * Set the target "split_io" field to the minimum of all the snapshots'
1377 static void origin_resume(struct dm_target
*ti
)
1379 struct dm_dev
*dev
= ti
->private;
1380 struct dm_snapshot
*snap
;
1382 chunk_t chunk_size
= 0;
1384 down_read(&_origins_lock
);
1385 o
= __lookup_origin(dev
->bdev
);
1387 list_for_each_entry (snap
, &o
->snapshots
, list
)
1388 chunk_size
= min_not_zero(chunk_size
,
1389 snap
->store
->chunk_size
);
1390 up_read(&_origins_lock
);
1392 ti
->split_io
= chunk_size
;
1395 static int origin_status(struct dm_target
*ti
, status_type_t type
, char *result
,
1396 unsigned int maxlen
)
1398 struct dm_dev
*dev
= ti
->private;
1401 case STATUSTYPE_INFO
:
1405 case STATUSTYPE_TABLE
:
1406 snprintf(result
, maxlen
, "%s", dev
->name
);
1413 static struct target_type origin_target
= {
1414 .name
= "snapshot-origin",
1415 .version
= {1, 6, 0},
1416 .module
= THIS_MODULE
,
1420 .resume
= origin_resume
,
1421 .status
= origin_status
,
1424 static struct target_type snapshot_target
= {
1426 .version
= {1, 6, 0},
1427 .module
= THIS_MODULE
,
1428 .ctr
= snapshot_ctr
,
1429 .dtr
= snapshot_dtr
,
1430 .map
= snapshot_map
,
1431 .end_io
= snapshot_end_io
,
1432 .resume
= snapshot_resume
,
1433 .status
= snapshot_status
,
1436 static int __init
dm_snapshot_init(void)
1440 r
= dm_exception_store_init();
1442 DMERR("Failed to initialize exception stores");
1446 r
= dm_register_target(&snapshot_target
);
1448 DMERR("snapshot target register failed %d", r
);
1452 r
= dm_register_target(&origin_target
);
1454 DMERR("Origin target register failed %d", r
);
1458 r
= init_origin_hash();
1460 DMERR("init_origin_hash failed.");
1464 exception_cache
= KMEM_CACHE(dm_snap_exception
, 0);
1465 if (!exception_cache
) {
1466 DMERR("Couldn't create exception cache.");
1471 pending_cache
= KMEM_CACHE(dm_snap_pending_exception
, 0);
1472 if (!pending_cache
) {
1473 DMERR("Couldn't create pending cache.");
1478 tracked_chunk_cache
= KMEM_CACHE(dm_snap_tracked_chunk
, 0);
1479 if (!tracked_chunk_cache
) {
1480 DMERR("Couldn't create cache to track chunks in use.");
1485 ksnapd
= create_singlethread_workqueue("ksnapd");
1487 DMERR("Failed to create ksnapd workqueue.");
1489 goto bad_pending_pool
;
1495 kmem_cache_destroy(tracked_chunk_cache
);
1497 kmem_cache_destroy(pending_cache
);
1499 kmem_cache_destroy(exception_cache
);
1503 dm_unregister_target(&origin_target
);
1505 dm_unregister_target(&snapshot_target
);
1509 static void __exit
dm_snapshot_exit(void)
1511 destroy_workqueue(ksnapd
);
1513 dm_unregister_target(&snapshot_target
);
1514 dm_unregister_target(&origin_target
);
1517 kmem_cache_destroy(pending_cache
);
1518 kmem_cache_destroy(exception_cache
);
1519 kmem_cache_destroy(tracked_chunk_cache
);
1521 dm_exception_store_exit();
1525 module_init(dm_snapshot_init
);
1526 module_exit(dm_snapshot_exit
);
1528 MODULE_DESCRIPTION(DM_NAME
" snapshot target");
1529 MODULE_AUTHOR("Joe Thornber");
1530 MODULE_LICENSE("GPL");