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 dm_snapshot *l;
300 struct origin *o, *new_o;
301 struct block_device *bdev = snap->origin->bdev;
303 new_o = kmalloc(sizeof(*new_o), GFP_KERNEL);
307 down_write(&_origins_lock);
308 o = __lookup_origin(bdev);
316 /* Initialise the struct */
317 INIT_LIST_HEAD(&o->snapshots);
323 /* Sort the list according to chunk size, largest-first smallest-last */
324 list_for_each_entry(l, &o->snapshots, list)
325 if (l->store->chunk_size < snap->store->chunk_size)
327 list_add_tail(&snap->list, &l->list);
329 up_write(&_origins_lock);
333 static void unregister_snapshot(struct dm_snapshot *s)
337 down_write(&_origins_lock);
338 o = __lookup_origin(s->origin->bdev);
341 if (list_empty(&o->snapshots)) {
342 list_del(&o->hash_list);
346 up_write(&_origins_lock);
350 * Implementation of the exception hash tables.
351 * The lowest hash_shift bits of the chunk number are ignored, allowing
352 * some consecutive chunks to be grouped together.
354 static int init_exception_table(struct exception_table *et, uint32_t size,
359 et->hash_shift = hash_shift;
360 et->hash_mask = size - 1;
361 et->table = dm_vcalloc(size, sizeof(struct list_head));
365 for (i = 0; i < size; i++)
366 INIT_LIST_HEAD(et->table + i);
371 static void exit_exception_table(struct exception_table *et, struct kmem_cache *mem)
373 struct list_head *slot;
374 struct dm_snap_exception *ex, *next;
377 size = et->hash_mask + 1;
378 for (i = 0; i < size; i++) {
379 slot = et->table + i;
381 list_for_each_entry_safe (ex, next, slot, hash_list)
382 kmem_cache_free(mem, ex);
388 static uint32_t exception_hash(struct exception_table *et, chunk_t chunk)
390 return (chunk >> et->hash_shift) & et->hash_mask;
393 static void insert_exception(struct exception_table *eh,
394 struct dm_snap_exception *e)
396 struct list_head *l = &eh->table[exception_hash(eh, e->old_chunk)];
397 list_add(&e->hash_list, l);
400 static void remove_exception(struct dm_snap_exception *e)
402 list_del(&e->hash_list);
406 * Return the exception data for a sector, or NULL if not
409 static struct dm_snap_exception *lookup_exception(struct exception_table *et,
412 struct list_head *slot;
413 struct dm_snap_exception *e;
415 slot = &et->table[exception_hash(et, chunk)];
416 list_for_each_entry (e, slot, hash_list)
417 if (chunk >= e->old_chunk &&
418 chunk <= e->old_chunk + dm_consecutive_chunk_count(e))
424 static struct dm_snap_exception *alloc_exception(void)
426 struct dm_snap_exception *e;
428 e = kmem_cache_alloc(exception_cache, GFP_NOIO);
430 e = kmem_cache_alloc(exception_cache, GFP_ATOMIC);
435 static void free_exception(struct dm_snap_exception *e)
437 kmem_cache_free(exception_cache, e);
440 static struct dm_snap_pending_exception *alloc_pending_exception(struct dm_snapshot *s)
442 struct dm_snap_pending_exception *pe = mempool_alloc(s->pending_pool,
445 atomic_inc(&s->pending_exceptions_count);
451 static void free_pending_exception(struct dm_snap_pending_exception *pe)
453 struct dm_snapshot *s = pe->snap;
455 mempool_free(pe, s->pending_pool);
456 smp_mb__before_atomic_dec();
457 atomic_dec(&s->pending_exceptions_count);
460 static void insert_completed_exception(struct dm_snapshot *s,
461 struct dm_snap_exception *new_e)
463 struct exception_table *eh = &s->complete;
465 struct dm_snap_exception *e = NULL;
467 l = &eh->table[exception_hash(eh, new_e->old_chunk)];
469 /* Add immediately if this table doesn't support consecutive chunks */
473 /* List is ordered by old_chunk */
474 list_for_each_entry_reverse(e, l, hash_list) {
475 /* Insert after an existing chunk? */
476 if (new_e->old_chunk == (e->old_chunk +
477 dm_consecutive_chunk_count(e) + 1) &&
478 new_e->new_chunk == (dm_chunk_number(e->new_chunk) +
479 dm_consecutive_chunk_count(e) + 1)) {
480 dm_consecutive_chunk_count_inc(e);
481 free_exception(new_e);
485 /* Insert before an existing chunk? */
486 if (new_e->old_chunk == (e->old_chunk - 1) &&
487 new_e->new_chunk == (dm_chunk_number(e->new_chunk) - 1)) {
488 dm_consecutive_chunk_count_inc(e);
491 free_exception(new_e);
495 if (new_e->old_chunk > e->old_chunk)
500 list_add(&new_e->hash_list, e ? &e->hash_list : l);
504 * Callback used by the exception stores to load exceptions when
507 static int dm_add_exception(void *context, chunk_t old, chunk_t new)
509 struct dm_snapshot *s = context;
510 struct dm_snap_exception *e;
512 e = alloc_exception();
518 /* Consecutive_count is implicitly initialised to zero */
521 insert_completed_exception(s, e);
529 static int calc_max_buckets(void)
531 /* use a fixed size of 2MB */
532 unsigned long mem = 2 * 1024 * 1024;
533 mem /= sizeof(struct list_head);
539 * Allocate room for a suitable hash table.
541 static int init_hash_tables(struct dm_snapshot *s)
543 sector_t hash_size, cow_dev_size, origin_dev_size, max_buckets;
546 * Calculate based on the size of the original volume or
549 cow_dev_size = get_dev_size(s->store->cow->bdev);
550 origin_dev_size = get_dev_size(s->origin->bdev);
551 max_buckets = calc_max_buckets();
553 hash_size = min(origin_dev_size, cow_dev_size) >> s->store->chunk_shift;
554 hash_size = min(hash_size, max_buckets);
558 hash_size = rounddown_pow_of_two(hash_size);
559 if (init_exception_table(&s->complete, hash_size,
560 DM_CHUNK_CONSECUTIVE_BITS))
564 * Allocate hash table for in-flight exceptions
565 * Make this smaller than the real hash table
571 if (init_exception_table(&s->pending, hash_size, 0)) {
572 exit_exception_table(&s->complete, exception_cache);
580 * Construct a snapshot mapping: <origin_dev> <COW-dev> <p/n> <chunk-size>
582 static int snapshot_ctr(struct dm_target *ti, unsigned int argc, char **argv)
584 struct dm_snapshot *s;
588 struct dm_exception_store *store;
592 ti->error = "requires exactly 4 arguments";
597 origin_path = argv[0];
601 r = dm_exception_store_create(ti, argc, argv, &args_used, &store);
603 ti->error = "Couldn't create exception store";
611 s = kmalloc(sizeof(*s), GFP_KERNEL);
613 ti->error = "Cannot allocate snapshot context private "
619 r = dm_get_device(ti, origin_path, 0, ti->len, FMODE_READ, &s->origin);
621 ti->error = "Cannot get origin device";
628 atomic_set(&s->pending_exceptions_count, 0);
629 init_rwsem(&s->lock);
630 spin_lock_init(&s->pe_lock);
632 /* Allocate hash table for COW data */
633 if (init_hash_tables(s)) {
634 ti->error = "Unable to allocate hash table space";
636 goto bad_hash_tables;
639 r = dm_kcopyd_client_create(SNAPSHOT_PAGES, &s->kcopyd_client);
641 ti->error = "Could not create kcopyd client";
645 s->pending_pool = mempool_create_slab_pool(MIN_IOS, pending_cache);
646 if (!s->pending_pool) {
647 ti->error = "Could not allocate mempool for pending exceptions";
648 goto bad_pending_pool;
651 s->tracked_chunk_pool = mempool_create_slab_pool(MIN_IOS,
652 tracked_chunk_cache);
653 if (!s->tracked_chunk_pool) {
654 ti->error = "Could not allocate tracked_chunk mempool for "
656 goto bad_tracked_chunk_pool;
659 for (i = 0; i < DM_TRACKED_CHUNK_HASH_SIZE; i++)
660 INIT_HLIST_HEAD(&s->tracked_chunk_hash[i]);
662 spin_lock_init(&s->tracked_chunk_lock);
664 /* Metadata must only be loaded into one table at once */
665 r = s->store->type->read_metadata(s->store, dm_add_exception,
668 ti->error = "Failed to read snapshot metadata";
669 goto bad_load_and_register;
672 DMWARN("Snapshot is marked invalid.");
675 bio_list_init(&s->queued_bios);
676 INIT_WORK(&s->queued_bios_work, flush_queued_bios);
678 if (!s->store->chunk_size) {
679 ti->error = "Chunk size not set";
680 goto bad_load_and_register;
683 /* Add snapshot to the list of snapshots for this origin */
684 /* Exceptions aren't triggered till snapshot_resume() is called */
685 if (register_snapshot(s)) {
687 ti->error = "Cannot register snapshot origin";
688 goto bad_load_and_register;
692 ti->split_io = s->store->chunk_size;
693 ti->num_flush_requests = 1;
697 bad_load_and_register:
698 mempool_destroy(s->tracked_chunk_pool);
700 bad_tracked_chunk_pool:
701 mempool_destroy(s->pending_pool);
704 dm_kcopyd_client_destroy(s->kcopyd_client);
707 exit_exception_table(&s->pending, pending_cache);
708 exit_exception_table(&s->complete, exception_cache);
711 dm_put_device(ti, s->origin);
717 dm_exception_store_destroy(store);
723 static void __free_exceptions(struct dm_snapshot *s)
725 dm_kcopyd_client_destroy(s->kcopyd_client);
726 s->kcopyd_client = NULL;
728 exit_exception_table(&s->pending, pending_cache);
729 exit_exception_table(&s->complete, exception_cache);
732 static void snapshot_dtr(struct dm_target *ti)
734 #ifdef CONFIG_DM_DEBUG
737 struct dm_snapshot *s = ti->private;
739 flush_workqueue(ksnapd);
741 /* Prevent further origin writes from using this snapshot. */
742 /* After this returns there can be no new kcopyd jobs. */
743 unregister_snapshot(s);
745 while (atomic_read(&s->pending_exceptions_count))
748 * Ensure instructions in mempool_destroy aren't reordered
749 * before atomic_read.
753 #ifdef CONFIG_DM_DEBUG
754 for (i = 0; i < DM_TRACKED_CHUNK_HASH_SIZE; i++)
755 BUG_ON(!hlist_empty(&s->tracked_chunk_hash[i]));
758 mempool_destroy(s->tracked_chunk_pool);
760 __free_exceptions(s);
762 mempool_destroy(s->pending_pool);
764 dm_put_device(ti, s->origin);
766 dm_exception_store_destroy(s->store);
772 * Flush a list of buffers.
774 static void flush_bios(struct bio *bio)
781 generic_make_request(bio);
786 static void flush_queued_bios(struct work_struct *work)
788 struct dm_snapshot *s =
789 container_of(work, struct dm_snapshot, queued_bios_work);
790 struct bio *queued_bios;
793 spin_lock_irqsave(&s->pe_lock, flags);
794 queued_bios = bio_list_get(&s->queued_bios);
795 spin_unlock_irqrestore(&s->pe_lock, flags);
797 flush_bios(queued_bios);
801 * Error a list of buffers.
803 static void error_bios(struct bio *bio)
815 static void __invalidate_snapshot(struct dm_snapshot *s, int err)
821 DMERR("Invalidating snapshot: Error reading/writing.");
822 else if (err == -ENOMEM)
823 DMERR("Invalidating snapshot: Unable to allocate exception.");
825 if (s->store->type->drop_snapshot)
826 s->store->type->drop_snapshot(s->store);
830 dm_table_event(s->store->ti->table);
833 static void get_pending_exception(struct dm_snap_pending_exception *pe)
835 atomic_inc(&pe->ref_count);
838 static struct bio *put_pending_exception(struct dm_snap_pending_exception *pe)
840 struct dm_snap_pending_exception *primary_pe;
841 struct bio *origin_bios = NULL;
843 primary_pe = pe->primary_pe;
846 * If this pe is involved in a write to the origin and
847 * it is the last sibling to complete then release
848 * the bios for the original write to the origin.
851 atomic_dec_and_test(&primary_pe->ref_count)) {
852 origin_bios = bio_list_get(&primary_pe->origin_bios);
853 free_pending_exception(primary_pe);
857 * Free the pe if it's not linked to an origin write or if
858 * it's not itself a primary pe.
860 if (!primary_pe || primary_pe != pe)
861 free_pending_exception(pe);
866 static void pending_complete(struct dm_snap_pending_exception *pe, int success)
868 struct dm_snap_exception *e;
869 struct dm_snapshot *s = pe->snap;
870 struct bio *origin_bios = NULL;
871 struct bio *snapshot_bios = NULL;
875 /* Read/write error - snapshot is unusable */
876 down_write(&s->lock);
877 __invalidate_snapshot(s, -EIO);
882 e = alloc_exception();
884 down_write(&s->lock);
885 __invalidate_snapshot(s, -ENOMEM);
891 down_write(&s->lock);
899 * Check for conflicting reads. This is extremely improbable,
900 * so msleep(1) is sufficient and there is no need for a wait queue.
902 while (__chunk_is_tracked(s, pe->e.old_chunk))
906 * Add a proper exception, and remove the
907 * in-flight exception from the list.
909 insert_completed_exception(s, e);
912 remove_exception(&pe->e);
913 snapshot_bios = bio_list_get(&pe->snapshot_bios);
914 origin_bios = put_pending_exception(pe);
918 /* Submit any pending write bios */
920 error_bios(snapshot_bios);
922 flush_bios(snapshot_bios);
924 flush_bios(origin_bios);
927 static void commit_callback(void *context, int success)
929 struct dm_snap_pending_exception *pe = context;
931 pending_complete(pe, success);
935 * Called when the copy I/O has finished. kcopyd actually runs
936 * this code so don't block.
938 static void copy_callback(int read_err, unsigned long write_err, void *context)
940 struct dm_snap_pending_exception *pe = context;
941 struct dm_snapshot *s = pe->snap;
943 if (read_err || write_err)
944 pending_complete(pe, 0);
947 /* Update the metadata if we are persistent */
948 s->store->type->commit_exception(s->store, &pe->e,
949 commit_callback, pe);
953 * Dispatches the copy operation to kcopyd.
955 static void start_copy(struct dm_snap_pending_exception *pe)
957 struct dm_snapshot *s = pe->snap;
958 struct dm_io_region src, dest;
959 struct block_device *bdev = s->origin->bdev;
962 dev_size = get_dev_size(bdev);
965 src.sector = chunk_to_sector(s->store, pe->e.old_chunk);
966 src.count = min((sector_t)s->store->chunk_size, dev_size - src.sector);
968 dest.bdev = s->store->cow->bdev;
969 dest.sector = chunk_to_sector(s->store, pe->e.new_chunk);
970 dest.count = src.count;
972 /* Hand over to kcopyd */
973 dm_kcopyd_copy(s->kcopyd_client,
974 &src, 1, &dest, 0, copy_callback, pe);
977 static struct dm_snap_pending_exception *
978 __lookup_pending_exception(struct dm_snapshot *s, chunk_t chunk)
980 struct dm_snap_exception *e = lookup_exception(&s->pending, chunk);
985 return container_of(e, struct dm_snap_pending_exception, e);
989 * Looks to see if this snapshot already has a pending exception
990 * for this chunk, otherwise it allocates a new one and inserts
991 * it into the pending table.
993 * NOTE: a write lock must be held on snap->lock before calling
996 static struct dm_snap_pending_exception *
997 __find_pending_exception(struct dm_snapshot *s,
998 struct dm_snap_pending_exception *pe, chunk_t chunk)
1000 struct dm_snap_pending_exception *pe2;
1002 pe2 = __lookup_pending_exception(s, chunk);
1004 free_pending_exception(pe);
1008 pe->e.old_chunk = chunk;
1009 bio_list_init(&pe->origin_bios);
1010 bio_list_init(&pe->snapshot_bios);
1011 pe->primary_pe = NULL;
1012 atomic_set(&pe->ref_count, 0);
1015 if (s->store->type->prepare_exception(s->store, &pe->e)) {
1016 free_pending_exception(pe);
1020 get_pending_exception(pe);
1021 insert_exception(&s->pending, &pe->e);
1026 static void remap_exception(struct dm_snapshot *s, struct dm_snap_exception *e,
1027 struct bio *bio, chunk_t chunk)
1029 bio->bi_bdev = s->store->cow->bdev;
1030 bio->bi_sector = chunk_to_sector(s->store,
1031 dm_chunk_number(e->new_chunk) +
1032 (chunk - e->old_chunk)) +
1034 s->store->chunk_mask);
1037 static int snapshot_map(struct dm_target *ti, struct bio *bio,
1038 union map_info *map_context)
1040 struct dm_snap_exception *e;
1041 struct dm_snapshot *s = ti->private;
1042 int r = DM_MAPIO_REMAPPED;
1044 struct dm_snap_pending_exception *pe = NULL;
1046 if (unlikely(bio_empty_barrier(bio))) {
1047 bio->bi_bdev = s->store->cow->bdev;
1048 return DM_MAPIO_REMAPPED;
1051 chunk = sector_to_chunk(s->store, bio->bi_sector);
1053 /* Full snapshots are not usable */
1054 /* To get here the table must be live so s->active is always set. */
1058 /* FIXME: should only take write lock if we need
1059 * to copy an exception */
1060 down_write(&s->lock);
1067 /* If the block is already remapped - use that, else remap it */
1068 e = lookup_exception(&s->complete, chunk);
1070 remap_exception(s, e, bio, chunk);
1075 * Write to snapshot - higher level takes care of RW/RO
1076 * flags so we should only get this if we are
1079 if (bio_rw(bio) == WRITE) {
1080 pe = __lookup_pending_exception(s, chunk);
1083 pe = alloc_pending_exception(s);
1084 down_write(&s->lock);
1087 free_pending_exception(pe);
1092 e = lookup_exception(&s->complete, chunk);
1094 free_pending_exception(pe);
1095 remap_exception(s, e, bio, chunk);
1099 pe = __find_pending_exception(s, pe, chunk);
1101 __invalidate_snapshot(s, -ENOMEM);
1107 remap_exception(s, &pe->e, bio, chunk);
1108 bio_list_add(&pe->snapshot_bios, bio);
1110 r = DM_MAPIO_SUBMITTED;
1113 /* this is protected by snap->lock */
1120 bio->bi_bdev = s->origin->bdev;
1121 map_context->ptr = track_chunk(s, chunk);
1130 static int snapshot_end_io(struct dm_target *ti, struct bio *bio,
1131 int error, union map_info *map_context)
1133 struct dm_snapshot *s = ti->private;
1134 struct dm_snap_tracked_chunk *c = map_context->ptr;
1137 stop_tracking_chunk(s, c);
1142 static void snapshot_resume(struct dm_target *ti)
1144 struct dm_snapshot *s = ti->private;
1146 down_write(&s->lock);
1151 static int snapshot_status(struct dm_target *ti, status_type_t type,
1152 char *result, unsigned int maxlen)
1155 struct dm_snapshot *snap = ti->private;
1158 case STATUSTYPE_INFO:
1160 down_write(&snap->lock);
1165 if (snap->store->type->fraction_full) {
1166 sector_t numerator, denominator;
1167 snap->store->type->fraction_full(snap->store,
1171 (unsigned long long)numerator,
1172 (unsigned long long)denominator);
1178 up_write(&snap->lock);
1182 case STATUSTYPE_TABLE:
1184 * kdevname returns a static pointer so we need
1185 * to make private copies if the output is to
1188 DMEMIT("%s", snap->origin->name);
1189 snap->store->type->status(snap->store, type, result + sz,
1197 static int snapshot_iterate_devices(struct dm_target *ti,
1198 iterate_devices_callout_fn fn, void *data)
1200 struct dm_snapshot *snap = ti->private;
1202 return fn(ti, snap->origin, 0, ti->len, data);
1206 /*-----------------------------------------------------------------
1208 *---------------------------------------------------------------*/
1209 static int __origin_write(struct list_head *snapshots, struct bio *bio)
1211 int r = DM_MAPIO_REMAPPED, first = 0;
1212 struct dm_snapshot *snap;
1213 struct dm_snap_exception *e;
1214 struct dm_snap_pending_exception *pe, *next_pe, *primary_pe = NULL;
1216 LIST_HEAD(pe_queue);
1218 /* Do all the snapshots on this origin */
1219 list_for_each_entry (snap, snapshots, list) {
1221 down_write(&snap->lock);
1223 /* Only deal with valid and active snapshots */
1224 if (!snap->valid || !snap->active)
1227 /* Nothing to do if writing beyond end of snapshot */
1228 if (bio->bi_sector >= dm_table_get_size(snap->store->ti->table))
1232 * Remember, different snapshots can have
1233 * different chunk sizes.
1235 chunk = sector_to_chunk(snap->store, bio->bi_sector);
1238 * Check exception table to see if block
1239 * is already remapped in this snapshot
1240 * and trigger an exception if not.
1242 * ref_count is initialised to 1 so pending_complete()
1243 * won't destroy the primary_pe while we're inside this loop.
1245 e = lookup_exception(&snap->complete, chunk);
1249 pe = __lookup_pending_exception(snap, chunk);
1251 up_write(&snap->lock);
1252 pe = alloc_pending_exception(snap);
1253 down_write(&snap->lock);
1256 free_pending_exception(pe);
1260 e = lookup_exception(&snap->complete, chunk);
1262 free_pending_exception(pe);
1266 pe = __find_pending_exception(snap, pe, chunk);
1268 __invalidate_snapshot(snap, -ENOMEM);
1275 * Either every pe here has same
1276 * primary_pe or none has one yet.
1279 primary_pe = pe->primary_pe;
1285 bio_list_add(&primary_pe->origin_bios, bio);
1287 r = DM_MAPIO_SUBMITTED;
1290 if (!pe->primary_pe) {
1291 pe->primary_pe = primary_pe;
1292 get_pending_exception(primary_pe);
1297 list_add_tail(&pe->list, &pe_queue);
1301 up_write(&snap->lock);
1308 * If this is the first time we're processing this chunk and
1309 * ref_count is now 1 it means all the pending exceptions
1310 * got completed while we were in the loop above, so it falls to
1311 * us here to remove the primary_pe and submit any origin_bios.
1314 if (first && atomic_dec_and_test(&primary_pe->ref_count)) {
1315 flush_bios(bio_list_get(&primary_pe->origin_bios));
1316 free_pending_exception(primary_pe);
1317 /* If we got here, pe_queue is necessarily empty. */
1322 * Now that we have a complete pe list we can start the copying.
1324 list_for_each_entry_safe(pe, next_pe, &pe_queue, list)
1331 * Called on a write from the origin driver.
1333 static int do_origin(struct dm_dev *origin, struct bio *bio)
1336 int r = DM_MAPIO_REMAPPED;
1338 down_read(&_origins_lock);
1339 o = __lookup_origin(origin->bdev);
1341 r = __origin_write(&o->snapshots, bio);
1342 up_read(&_origins_lock);
1348 * Origin: maps a linear range of a device, with hooks for snapshotting.
1352 * Construct an origin mapping: <dev_path>
1353 * The context for an origin is merely a 'struct dm_dev *'
1354 * pointing to the real device.
1356 static int origin_ctr(struct dm_target *ti, unsigned int argc, char **argv)
1362 ti->error = "origin: incorrect number of arguments";
1366 r = dm_get_device(ti, argv[0], 0, ti->len,
1367 dm_table_get_mode(ti->table), &dev);
1369 ti->error = "Cannot get target device";
1374 ti->num_flush_requests = 1;
1379 static void origin_dtr(struct dm_target *ti)
1381 struct dm_dev *dev = ti->private;
1382 dm_put_device(ti, dev);
1385 static int origin_map(struct dm_target *ti, struct bio *bio,
1386 union map_info *map_context)
1388 struct dm_dev *dev = ti->private;
1389 bio->bi_bdev = dev->bdev;
1391 if (unlikely(bio_empty_barrier(bio)))
1392 return DM_MAPIO_REMAPPED;
1394 /* Only tell snapshots if this is a write */
1395 return (bio_rw(bio) == WRITE) ? do_origin(dev, bio) : DM_MAPIO_REMAPPED;
1398 #define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
1401 * Set the target "split_io" field to the minimum of all the snapshots'
1404 static void origin_resume(struct dm_target *ti)
1406 struct dm_dev *dev = ti->private;
1407 struct dm_snapshot *snap;
1409 unsigned chunk_size = 0;
1411 down_read(&_origins_lock);
1412 o = __lookup_origin(dev->bdev);
1414 list_for_each_entry (snap, &o->snapshots, list)
1415 chunk_size = min_not_zero(chunk_size,
1416 snap->store->chunk_size);
1417 up_read(&_origins_lock);
1419 ti->split_io = chunk_size;
1422 static int origin_status(struct dm_target *ti, status_type_t type, char *result,
1423 unsigned int maxlen)
1425 struct dm_dev *dev = ti->private;
1428 case STATUSTYPE_INFO:
1432 case STATUSTYPE_TABLE:
1433 snprintf(result, maxlen, "%s", dev->name);
1440 static int origin_iterate_devices(struct dm_target *ti,
1441 iterate_devices_callout_fn fn, void *data)
1443 struct dm_dev *dev = ti->private;
1445 return fn(ti, dev, 0, ti->len, data);
1448 static struct target_type origin_target = {
1449 .name = "snapshot-origin",
1450 .version = {1, 7, 0},
1451 .module = THIS_MODULE,
1455 .resume = origin_resume,
1456 .status = origin_status,
1457 .iterate_devices = origin_iterate_devices,
1460 static struct target_type snapshot_target = {
1462 .version = {1, 7, 0},
1463 .module = THIS_MODULE,
1464 .ctr = snapshot_ctr,
1465 .dtr = snapshot_dtr,
1466 .map = snapshot_map,
1467 .end_io = snapshot_end_io,
1468 .resume = snapshot_resume,
1469 .status = snapshot_status,
1470 .iterate_devices = snapshot_iterate_devices,
1473 static int __init dm_snapshot_init(void)
1477 r = dm_exception_store_init();
1479 DMERR("Failed to initialize exception stores");
1483 r = dm_register_target(&snapshot_target);
1485 DMERR("snapshot target register failed %d", r);
1486 goto bad_register_snapshot_target;
1489 r = dm_register_target(&origin_target);
1491 DMERR("Origin target register failed %d", r);
1495 r = init_origin_hash();
1497 DMERR("init_origin_hash failed.");
1501 exception_cache = KMEM_CACHE(dm_snap_exception, 0);
1502 if (!exception_cache) {
1503 DMERR("Couldn't create exception cache.");
1508 pending_cache = KMEM_CACHE(dm_snap_pending_exception, 0);
1509 if (!pending_cache) {
1510 DMERR("Couldn't create pending cache.");
1515 tracked_chunk_cache = KMEM_CACHE(dm_snap_tracked_chunk, 0);
1516 if (!tracked_chunk_cache) {
1517 DMERR("Couldn't create cache to track chunks in use.");
1522 ksnapd = create_singlethread_workqueue("ksnapd");
1524 DMERR("Failed to create ksnapd workqueue.");
1526 goto bad_pending_pool;
1532 kmem_cache_destroy(tracked_chunk_cache);
1534 kmem_cache_destroy(pending_cache);
1536 kmem_cache_destroy(exception_cache);
1540 dm_unregister_target(&origin_target);
1542 dm_unregister_target(&snapshot_target);
1544 bad_register_snapshot_target:
1545 dm_exception_store_exit();
1549 static void __exit dm_snapshot_exit(void)
1551 destroy_workqueue(ksnapd);
1553 dm_unregister_target(&snapshot_target);
1554 dm_unregister_target(&origin_target);
1557 kmem_cache_destroy(pending_cache);
1558 kmem_cache_destroy(exception_cache);
1559 kmem_cache_destroy(tracked_chunk_cache);
1561 dm_exception_store_exit();
1565 module_init(dm_snapshot_init);
1566 module_exit(dm_snapshot_exit);
1568 MODULE_DESCRIPTION(DM_NAME " snapshot target");
1569 MODULE_AUTHOR("Joe Thornber");
1570 MODULE_LICENSE("GPL");