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 remove_exception(struct dm_snap_exception *e)
395 list_del(&e->hash_list);
399 * Return the exception data for a sector, or NULL if not
402 static struct dm_snap_exception *lookup_exception(struct exception_table *et,
405 struct list_head *slot;
406 struct dm_snap_exception *e;
408 slot = &et->table[exception_hash(et, chunk)];
409 list_for_each_entry (e, slot, hash_list)
410 if (chunk >= e->old_chunk &&
411 chunk <= e->old_chunk + dm_consecutive_chunk_count(e))
417 static struct dm_snap_exception *alloc_exception(void)
419 struct dm_snap_exception *e;
421 e = kmem_cache_alloc(exception_cache, GFP_NOIO);
423 e = kmem_cache_alloc(exception_cache, GFP_ATOMIC);
428 static void free_exception(struct dm_snap_exception *e)
430 kmem_cache_free(exception_cache, e);
433 static struct dm_snap_pending_exception *alloc_pending_exception(struct dm_snapshot *s)
435 struct dm_snap_pending_exception *pe = mempool_alloc(s->pending_pool,
438 atomic_inc(&s->pending_exceptions_count);
444 static void free_pending_exception(struct dm_snap_pending_exception *pe)
446 struct dm_snapshot *s = pe->snap;
448 mempool_free(pe, s->pending_pool);
449 smp_mb__before_atomic_dec();
450 atomic_dec(&s->pending_exceptions_count);
453 static void insert_exception(struct exception_table *eh,
454 struct dm_snap_exception *new_e)
457 struct dm_snap_exception *e = NULL;
459 l = &eh->table[exception_hash(eh, new_e->old_chunk)];
461 /* Add immediately if this table doesn't support consecutive chunks */
465 /* List is ordered by old_chunk */
466 list_for_each_entry_reverse(e, l, hash_list) {
467 /* Insert after an existing chunk? */
468 if (new_e->old_chunk == (e->old_chunk +
469 dm_consecutive_chunk_count(e) + 1) &&
470 new_e->new_chunk == (dm_chunk_number(e->new_chunk) +
471 dm_consecutive_chunk_count(e) + 1)) {
472 dm_consecutive_chunk_count_inc(e);
473 free_exception(new_e);
477 /* Insert before an existing chunk? */
478 if (new_e->old_chunk == (e->old_chunk - 1) &&
479 new_e->new_chunk == (dm_chunk_number(e->new_chunk) - 1)) {
480 dm_consecutive_chunk_count_inc(e);
483 free_exception(new_e);
487 if (new_e->old_chunk > e->old_chunk)
492 list_add(&new_e->hash_list, e ? &e->hash_list : l);
496 * Callback used by the exception stores to load exceptions when
499 static int dm_add_exception(void *context, chunk_t old, chunk_t new)
501 struct dm_snapshot *s = context;
502 struct dm_snap_exception *e;
504 e = alloc_exception();
510 /* Consecutive_count is implicitly initialised to zero */
513 insert_exception(&s->complete, e);
518 #define min_not_zero(l, r) (((l) == 0) ? (r) : (((r) == 0) ? (l) : min(l, r)))
521 * Return a minimum chunk size of all snapshots that have the specified origin.
522 * Return zero if the origin has no snapshots.
524 static sector_t __minimum_chunk_size(struct origin *o)
526 struct dm_snapshot *snap;
527 unsigned chunk_size = 0;
530 list_for_each_entry(snap, &o->snapshots, list)
531 chunk_size = min_not_zero(chunk_size,
532 snap->store->chunk_size);
540 static int calc_max_buckets(void)
542 /* use a fixed size of 2MB */
543 unsigned long mem = 2 * 1024 * 1024;
544 mem /= sizeof(struct list_head);
550 * Allocate room for a suitable hash table.
552 static int init_hash_tables(struct dm_snapshot *s)
554 sector_t hash_size, cow_dev_size, origin_dev_size, max_buckets;
557 * Calculate based on the size of the original volume or
560 cow_dev_size = get_dev_size(s->store->cow->bdev);
561 origin_dev_size = get_dev_size(s->origin->bdev);
562 max_buckets = calc_max_buckets();
564 hash_size = min(origin_dev_size, cow_dev_size) >> s->store->chunk_shift;
565 hash_size = min(hash_size, max_buckets);
569 hash_size = rounddown_pow_of_two(hash_size);
570 if (init_exception_table(&s->complete, hash_size,
571 DM_CHUNK_CONSECUTIVE_BITS))
575 * Allocate hash table for in-flight exceptions
576 * Make this smaller than the real hash table
582 if (init_exception_table(&s->pending, hash_size, 0)) {
583 exit_exception_table(&s->complete, exception_cache);
591 * Construct a snapshot mapping: <origin_dev> <COW-dev> <p/n> <chunk-size>
593 static int snapshot_ctr(struct dm_target *ti, unsigned int argc, char **argv)
595 struct dm_snapshot *s;
599 struct dm_exception_store *store;
603 ti->error = "requires exactly 4 arguments";
608 origin_path = argv[0];
612 r = dm_exception_store_create(ti, argc, argv, &args_used, &store);
614 ti->error = "Couldn't create exception store";
622 s = kmalloc(sizeof(*s), GFP_KERNEL);
624 ti->error = "Cannot allocate snapshot context private "
630 r = dm_get_device(ti, origin_path, 0, ti->len, FMODE_READ, &s->origin);
632 ti->error = "Cannot get origin device";
639 atomic_set(&s->pending_exceptions_count, 0);
640 init_rwsem(&s->lock);
641 spin_lock_init(&s->pe_lock);
643 /* Allocate hash table for COW data */
644 if (init_hash_tables(s)) {
645 ti->error = "Unable to allocate hash table space";
647 goto bad_hash_tables;
650 r = dm_kcopyd_client_create(SNAPSHOT_PAGES, &s->kcopyd_client);
652 ti->error = "Could not create kcopyd client";
656 s->pending_pool = mempool_create_slab_pool(MIN_IOS, pending_cache);
657 if (!s->pending_pool) {
658 ti->error = "Could not allocate mempool for pending exceptions";
659 goto bad_pending_pool;
662 s->tracked_chunk_pool = mempool_create_slab_pool(MIN_IOS,
663 tracked_chunk_cache);
664 if (!s->tracked_chunk_pool) {
665 ti->error = "Could not allocate tracked_chunk mempool for "
667 goto bad_tracked_chunk_pool;
670 for (i = 0; i < DM_TRACKED_CHUNK_HASH_SIZE; i++)
671 INIT_HLIST_HEAD(&s->tracked_chunk_hash[i]);
673 spin_lock_init(&s->tracked_chunk_lock);
675 /* Metadata must only be loaded into one table at once */
676 r = s->store->type->read_metadata(s->store, dm_add_exception,
679 ti->error = "Failed to read snapshot metadata";
680 goto bad_load_and_register;
683 DMWARN("Snapshot is marked invalid.");
686 bio_list_init(&s->queued_bios);
687 INIT_WORK(&s->queued_bios_work, flush_queued_bios);
689 if (!s->store->chunk_size) {
690 ti->error = "Chunk size not set";
691 goto bad_load_and_register;
694 /* Add snapshot to the list of snapshots for this origin */
695 /* Exceptions aren't triggered till snapshot_resume() is called */
696 if (register_snapshot(s)) {
698 ti->error = "Cannot register snapshot origin";
699 goto bad_load_and_register;
703 ti->split_io = s->store->chunk_size;
704 ti->num_flush_requests = 1;
708 bad_load_and_register:
709 mempool_destroy(s->tracked_chunk_pool);
711 bad_tracked_chunk_pool:
712 mempool_destroy(s->pending_pool);
715 dm_kcopyd_client_destroy(s->kcopyd_client);
718 exit_exception_table(&s->pending, pending_cache);
719 exit_exception_table(&s->complete, exception_cache);
722 dm_put_device(ti, s->origin);
728 dm_exception_store_destroy(store);
734 static void __free_exceptions(struct dm_snapshot *s)
736 dm_kcopyd_client_destroy(s->kcopyd_client);
737 s->kcopyd_client = NULL;
739 exit_exception_table(&s->pending, pending_cache);
740 exit_exception_table(&s->complete, exception_cache);
743 static void snapshot_dtr(struct dm_target *ti)
745 #ifdef CONFIG_DM_DEBUG
748 struct dm_snapshot *s = ti->private;
750 flush_workqueue(ksnapd);
752 /* Prevent further origin writes from using this snapshot. */
753 /* After this returns there can be no new kcopyd jobs. */
754 unregister_snapshot(s);
756 while (atomic_read(&s->pending_exceptions_count))
759 * Ensure instructions in mempool_destroy aren't reordered
760 * before atomic_read.
764 #ifdef CONFIG_DM_DEBUG
765 for (i = 0; i < DM_TRACKED_CHUNK_HASH_SIZE; i++)
766 BUG_ON(!hlist_empty(&s->tracked_chunk_hash[i]));
769 mempool_destroy(s->tracked_chunk_pool);
771 __free_exceptions(s);
773 mempool_destroy(s->pending_pool);
775 dm_put_device(ti, s->origin);
777 dm_exception_store_destroy(s->store);
783 * Flush a list of buffers.
785 static void flush_bios(struct bio *bio)
792 generic_make_request(bio);
797 static void flush_queued_bios(struct work_struct *work)
799 struct dm_snapshot *s =
800 container_of(work, struct dm_snapshot, queued_bios_work);
801 struct bio *queued_bios;
804 spin_lock_irqsave(&s->pe_lock, flags);
805 queued_bios = bio_list_get(&s->queued_bios);
806 spin_unlock_irqrestore(&s->pe_lock, flags);
808 flush_bios(queued_bios);
812 * Error a list of buffers.
814 static void error_bios(struct bio *bio)
826 static void __invalidate_snapshot(struct dm_snapshot *s, int err)
832 DMERR("Invalidating snapshot: Error reading/writing.");
833 else if (err == -ENOMEM)
834 DMERR("Invalidating snapshot: Unable to allocate exception.");
836 if (s->store->type->drop_snapshot)
837 s->store->type->drop_snapshot(s->store);
841 dm_table_event(s->store->ti->table);
844 static void get_pending_exception(struct dm_snap_pending_exception *pe)
846 atomic_inc(&pe->ref_count);
849 static struct bio *put_pending_exception(struct dm_snap_pending_exception *pe)
851 struct dm_snap_pending_exception *primary_pe;
852 struct bio *origin_bios = NULL;
854 primary_pe = pe->primary_pe;
857 * If this pe is involved in a write to the origin and
858 * it is the last sibling to complete then release
859 * the bios for the original write to the origin.
862 atomic_dec_and_test(&primary_pe->ref_count)) {
863 origin_bios = bio_list_get(&primary_pe->origin_bios);
864 free_pending_exception(primary_pe);
868 * Free the pe if it's not linked to an origin write or if
869 * it's not itself a primary pe.
871 if (!primary_pe || primary_pe != pe)
872 free_pending_exception(pe);
877 static void pending_complete(struct dm_snap_pending_exception *pe, int success)
879 struct dm_snap_exception *e;
880 struct dm_snapshot *s = pe->snap;
881 struct bio *origin_bios = NULL;
882 struct bio *snapshot_bios = NULL;
886 /* Read/write error - snapshot is unusable */
887 down_write(&s->lock);
888 __invalidate_snapshot(s, -EIO);
893 e = alloc_exception();
895 down_write(&s->lock);
896 __invalidate_snapshot(s, -ENOMEM);
902 down_write(&s->lock);
910 * Check for conflicting reads. This is extremely improbable,
911 * so msleep(1) is sufficient and there is no need for a wait queue.
913 while (__chunk_is_tracked(s, pe->e.old_chunk))
917 * Add a proper exception, and remove the
918 * in-flight exception from the list.
920 insert_exception(&s->complete, e);
923 remove_exception(&pe->e);
924 snapshot_bios = bio_list_get(&pe->snapshot_bios);
925 origin_bios = put_pending_exception(pe);
929 /* Submit any pending write bios */
931 error_bios(snapshot_bios);
933 flush_bios(snapshot_bios);
935 flush_bios(origin_bios);
938 static void commit_callback(void *context, int success)
940 struct dm_snap_pending_exception *pe = context;
942 pending_complete(pe, success);
946 * Called when the copy I/O has finished. kcopyd actually runs
947 * this code so don't block.
949 static void copy_callback(int read_err, unsigned long write_err, void *context)
951 struct dm_snap_pending_exception *pe = context;
952 struct dm_snapshot *s = pe->snap;
954 if (read_err || write_err)
955 pending_complete(pe, 0);
958 /* Update the metadata if we are persistent */
959 s->store->type->commit_exception(s->store, &pe->e,
960 commit_callback, pe);
964 * Dispatches the copy operation to kcopyd.
966 static void start_copy(struct dm_snap_pending_exception *pe)
968 struct dm_snapshot *s = pe->snap;
969 struct dm_io_region src, dest;
970 struct block_device *bdev = s->origin->bdev;
973 dev_size = get_dev_size(bdev);
976 src.sector = chunk_to_sector(s->store, pe->e.old_chunk);
977 src.count = min((sector_t)s->store->chunk_size, dev_size - src.sector);
979 dest.bdev = s->store->cow->bdev;
980 dest.sector = chunk_to_sector(s->store, pe->e.new_chunk);
981 dest.count = src.count;
983 /* Hand over to kcopyd */
984 dm_kcopyd_copy(s->kcopyd_client,
985 &src, 1, &dest, 0, copy_callback, pe);
988 static struct dm_snap_pending_exception *
989 __lookup_pending_exception(struct dm_snapshot *s, chunk_t chunk)
991 struct dm_snap_exception *e = lookup_exception(&s->pending, chunk);
996 return container_of(e, struct dm_snap_pending_exception, e);
1000 * Looks to see if this snapshot already has a pending exception
1001 * for this chunk, otherwise it allocates a new one and inserts
1002 * it into the pending table.
1004 * NOTE: a write lock must be held on snap->lock before calling
1007 static struct dm_snap_pending_exception *
1008 __find_pending_exception(struct dm_snapshot *s,
1009 struct dm_snap_pending_exception *pe, chunk_t chunk)
1011 struct dm_snap_pending_exception *pe2;
1013 pe2 = __lookup_pending_exception(s, chunk);
1015 free_pending_exception(pe);
1019 pe->e.old_chunk = chunk;
1020 bio_list_init(&pe->origin_bios);
1021 bio_list_init(&pe->snapshot_bios);
1022 pe->primary_pe = NULL;
1023 atomic_set(&pe->ref_count, 0);
1026 if (s->store->type->prepare_exception(s->store, &pe->e)) {
1027 free_pending_exception(pe);
1031 get_pending_exception(pe);
1032 insert_exception(&s->pending, &pe->e);
1037 static void remap_exception(struct dm_snapshot *s, struct dm_snap_exception *e,
1038 struct bio *bio, chunk_t chunk)
1040 bio->bi_bdev = s->store->cow->bdev;
1041 bio->bi_sector = chunk_to_sector(s->store,
1042 dm_chunk_number(e->new_chunk) +
1043 (chunk - e->old_chunk)) +
1045 s->store->chunk_mask);
1048 static int snapshot_map(struct dm_target *ti, struct bio *bio,
1049 union map_info *map_context)
1051 struct dm_snap_exception *e;
1052 struct dm_snapshot *s = ti->private;
1053 int r = DM_MAPIO_REMAPPED;
1055 struct dm_snap_pending_exception *pe = NULL;
1057 if (unlikely(bio_empty_barrier(bio))) {
1058 bio->bi_bdev = s->store->cow->bdev;
1059 return DM_MAPIO_REMAPPED;
1062 chunk = sector_to_chunk(s->store, bio->bi_sector);
1064 /* Full snapshots are not usable */
1065 /* To get here the table must be live so s->active is always set. */
1069 /* FIXME: should only take write lock if we need
1070 * to copy an exception */
1071 down_write(&s->lock);
1078 /* If the block is already remapped - use that, else remap it */
1079 e = lookup_exception(&s->complete, chunk);
1081 remap_exception(s, e, bio, chunk);
1086 * Write to snapshot - higher level takes care of RW/RO
1087 * flags so we should only get this if we are
1090 if (bio_rw(bio) == WRITE) {
1091 pe = __lookup_pending_exception(s, chunk);
1094 pe = alloc_pending_exception(s);
1095 down_write(&s->lock);
1098 free_pending_exception(pe);
1103 e = lookup_exception(&s->complete, chunk);
1105 free_pending_exception(pe);
1106 remap_exception(s, e, bio, chunk);
1110 pe = __find_pending_exception(s, pe, chunk);
1112 __invalidate_snapshot(s, -ENOMEM);
1118 remap_exception(s, &pe->e, bio, chunk);
1119 bio_list_add(&pe->snapshot_bios, bio);
1121 r = DM_MAPIO_SUBMITTED;
1124 /* this is protected by snap->lock */
1131 bio->bi_bdev = s->origin->bdev;
1132 map_context->ptr = track_chunk(s, chunk);
1141 static int snapshot_end_io(struct dm_target *ti, struct bio *bio,
1142 int error, union map_info *map_context)
1144 struct dm_snapshot *s = ti->private;
1145 struct dm_snap_tracked_chunk *c = map_context->ptr;
1148 stop_tracking_chunk(s, c);
1153 static void snapshot_resume(struct dm_target *ti)
1155 struct dm_snapshot *s = ti->private;
1157 down_write(&s->lock);
1162 static int snapshot_status(struct dm_target *ti, status_type_t type,
1163 char *result, unsigned int maxlen)
1166 struct dm_snapshot *snap = ti->private;
1169 case STATUSTYPE_INFO:
1171 down_write(&snap->lock);
1176 if (snap->store->type->fraction_full) {
1177 sector_t numerator, denominator;
1178 snap->store->type->fraction_full(snap->store,
1182 (unsigned long long)numerator,
1183 (unsigned long long)denominator);
1189 up_write(&snap->lock);
1193 case STATUSTYPE_TABLE:
1195 * kdevname returns a static pointer so we need
1196 * to make private copies if the output is to
1199 DMEMIT("%s", snap->origin->name);
1200 snap->store->type->status(snap->store, type, result + sz,
1208 static int snapshot_iterate_devices(struct dm_target *ti,
1209 iterate_devices_callout_fn fn, void *data)
1211 struct dm_snapshot *snap = ti->private;
1213 return fn(ti, snap->origin, 0, ti->len, data);
1217 /*-----------------------------------------------------------------
1219 *---------------------------------------------------------------*/
1220 static int __origin_write(struct list_head *snapshots, struct bio *bio)
1222 int r = DM_MAPIO_REMAPPED, first = 0;
1223 struct dm_snapshot *snap;
1224 struct dm_snap_exception *e;
1225 struct dm_snap_pending_exception *pe, *next_pe, *primary_pe = NULL;
1227 LIST_HEAD(pe_queue);
1229 /* Do all the snapshots on this origin */
1230 list_for_each_entry (snap, snapshots, list) {
1232 down_write(&snap->lock);
1234 /* Only deal with valid and active snapshots */
1235 if (!snap->valid || !snap->active)
1238 /* Nothing to do if writing beyond end of snapshot */
1239 if (bio->bi_sector >= dm_table_get_size(snap->store->ti->table))
1243 * Remember, different snapshots can have
1244 * different chunk sizes.
1246 chunk = sector_to_chunk(snap->store, bio->bi_sector);
1249 * Check exception table to see if block
1250 * is already remapped in this snapshot
1251 * and trigger an exception if not.
1253 * ref_count is initialised to 1 so pending_complete()
1254 * won't destroy the primary_pe while we're inside this loop.
1256 e = lookup_exception(&snap->complete, chunk);
1260 pe = __lookup_pending_exception(snap, chunk);
1262 up_write(&snap->lock);
1263 pe = alloc_pending_exception(snap);
1264 down_write(&snap->lock);
1267 free_pending_exception(pe);
1271 e = lookup_exception(&snap->complete, chunk);
1273 free_pending_exception(pe);
1277 pe = __find_pending_exception(snap, pe, chunk);
1279 __invalidate_snapshot(snap, -ENOMEM);
1286 * Either every pe here has same
1287 * primary_pe or none has one yet.
1290 primary_pe = pe->primary_pe;
1296 bio_list_add(&primary_pe->origin_bios, bio);
1298 r = DM_MAPIO_SUBMITTED;
1301 if (!pe->primary_pe) {
1302 pe->primary_pe = primary_pe;
1303 get_pending_exception(primary_pe);
1308 list_add_tail(&pe->list, &pe_queue);
1312 up_write(&snap->lock);
1319 * If this is the first time we're processing this chunk and
1320 * ref_count is now 1 it means all the pending exceptions
1321 * got completed while we were in the loop above, so it falls to
1322 * us here to remove the primary_pe and submit any origin_bios.
1325 if (first && atomic_dec_and_test(&primary_pe->ref_count)) {
1326 flush_bios(bio_list_get(&primary_pe->origin_bios));
1327 free_pending_exception(primary_pe);
1328 /* If we got here, pe_queue is necessarily empty. */
1333 * Now that we have a complete pe list we can start the copying.
1335 list_for_each_entry_safe(pe, next_pe, &pe_queue, list)
1342 * Called on a write from the origin driver.
1344 static int do_origin(struct dm_dev *origin, struct bio *bio)
1347 int r = DM_MAPIO_REMAPPED;
1349 down_read(&_origins_lock);
1350 o = __lookup_origin(origin->bdev);
1352 r = __origin_write(&o->snapshots, bio);
1353 up_read(&_origins_lock);
1359 * Origin: maps a linear range of a device, with hooks for snapshotting.
1363 * Construct an origin mapping: <dev_path>
1364 * The context for an origin is merely a 'struct dm_dev *'
1365 * pointing to the real device.
1367 static int origin_ctr(struct dm_target *ti, unsigned int argc, char **argv)
1373 ti->error = "origin: incorrect number of arguments";
1377 r = dm_get_device(ti, argv[0], 0, ti->len,
1378 dm_table_get_mode(ti->table), &dev);
1380 ti->error = "Cannot get target device";
1385 ti->num_flush_requests = 1;
1390 static void origin_dtr(struct dm_target *ti)
1392 struct dm_dev *dev = ti->private;
1393 dm_put_device(ti, dev);
1396 static int origin_map(struct dm_target *ti, struct bio *bio,
1397 union map_info *map_context)
1399 struct dm_dev *dev = ti->private;
1400 bio->bi_bdev = dev->bdev;
1402 if (unlikely(bio_empty_barrier(bio)))
1403 return DM_MAPIO_REMAPPED;
1405 /* Only tell snapshots if this is a write */
1406 return (bio_rw(bio) == WRITE) ? do_origin(dev, bio) : DM_MAPIO_REMAPPED;
1410 * Set the target "split_io" field to the minimum of all the snapshots'
1413 static void origin_resume(struct dm_target *ti)
1415 struct dm_dev *dev = ti->private;
1417 down_read(&_origins_lock);
1419 ti->split_io = __minimum_chunk_size(__lookup_origin(dev->bdev));
1421 up_read(&_origins_lock);
1424 static int origin_status(struct dm_target *ti, status_type_t type, char *result,
1425 unsigned int maxlen)
1427 struct dm_dev *dev = ti->private;
1430 case STATUSTYPE_INFO:
1434 case STATUSTYPE_TABLE:
1435 snprintf(result, maxlen, "%s", dev->name);
1442 static int origin_iterate_devices(struct dm_target *ti,
1443 iterate_devices_callout_fn fn, void *data)
1445 struct dm_dev *dev = ti->private;
1447 return fn(ti, dev, 0, ti->len, data);
1450 static struct target_type origin_target = {
1451 .name = "snapshot-origin",
1452 .version = {1, 7, 0},
1453 .module = THIS_MODULE,
1457 .resume = origin_resume,
1458 .status = origin_status,
1459 .iterate_devices = origin_iterate_devices,
1462 static struct target_type snapshot_target = {
1464 .version = {1, 7, 0},
1465 .module = THIS_MODULE,
1466 .ctr = snapshot_ctr,
1467 .dtr = snapshot_dtr,
1468 .map = snapshot_map,
1469 .end_io = snapshot_end_io,
1470 .resume = snapshot_resume,
1471 .status = snapshot_status,
1472 .iterate_devices = snapshot_iterate_devices,
1475 static int __init dm_snapshot_init(void)
1479 r = dm_exception_store_init();
1481 DMERR("Failed to initialize exception stores");
1485 r = dm_register_target(&snapshot_target);
1487 DMERR("snapshot target register failed %d", r);
1488 goto bad_register_snapshot_target;
1491 r = dm_register_target(&origin_target);
1493 DMERR("Origin target register failed %d", r);
1497 r = init_origin_hash();
1499 DMERR("init_origin_hash failed.");
1503 exception_cache = KMEM_CACHE(dm_snap_exception, 0);
1504 if (!exception_cache) {
1505 DMERR("Couldn't create exception cache.");
1510 pending_cache = KMEM_CACHE(dm_snap_pending_exception, 0);
1511 if (!pending_cache) {
1512 DMERR("Couldn't create pending cache.");
1517 tracked_chunk_cache = KMEM_CACHE(dm_snap_tracked_chunk, 0);
1518 if (!tracked_chunk_cache) {
1519 DMERR("Couldn't create cache to track chunks in use.");
1524 ksnapd = create_singlethread_workqueue("ksnapd");
1526 DMERR("Failed to create ksnapd workqueue.");
1528 goto bad_pending_pool;
1534 kmem_cache_destroy(tracked_chunk_cache);
1536 kmem_cache_destroy(pending_cache);
1538 kmem_cache_destroy(exception_cache);
1542 dm_unregister_target(&origin_target);
1544 dm_unregister_target(&snapshot_target);
1546 bad_register_snapshot_target:
1547 dm_exception_store_exit();
1551 static void __exit dm_snapshot_exit(void)
1553 destroy_workqueue(ksnapd);
1555 dm_unregister_target(&snapshot_target);
1556 dm_unregister_target(&origin_target);
1559 kmem_cache_destroy(pending_cache);
1560 kmem_cache_destroy(exception_cache);
1561 kmem_cache_destroy(tracked_chunk_cache);
1563 dm_exception_store_exit();
1567 module_init(dm_snapshot_init);
1568 module_exit(dm_snapshot_exit);
1570 MODULE_DESCRIPTION(DM_NAME " snapshot target");
1571 MODULE_AUTHOR("Joe Thornber");
1572 MODULE_LICENSE("GPL");