Merge branch 'i2c-fixes-rc6' of git://aeryn.fluff.org.uk/bjdooks/linux
[linux-2.6/mini2440.git] / drivers / md / dm-snap.c
blobd573165cd2b788968f7d274e03966b96c93da889
1 /*
2 * dm-snapshot.c
4 * Copyright (C) 2001-2002 Sistina Software (UK) Limited.
6 * This file is released under the GPL.
7 */
9 #include <linux/blkdev.h>
10 #include <linux/device-mapper.h>
11 #include <linux/delay.h>
12 #include <linux/fs.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.
46 #define MIN_IOS 256
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 {
53 uint32_t hash_mask;
54 unsigned hash_shift;
55 struct list_head *table;
58 struct dm_snapshot {
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) */
67 int valid;
69 /* Origin writes don't trigger exceptions until this is set */
70 int active;
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.
83 spinlock_t pe_lock;
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,
104 chunk_t chunk)
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.
115 return lhs == rhs;
118 struct dm_snap_pending_exception {
119 struct dm_snap_exception e;
122 * Origin buffers waiting for this to complete are held
123 * in a bio list
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
146 * they are the same.
148 atomic_t ref_count;
150 /* Pointer back to snapshot context */
151 struct dm_snapshot *snap;
154 * 1 indicates the exception has already been sent to
155 * kcopyd.
157 int started;
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;
169 chunk_t chunk;
172 static struct kmem_cache *tracked_chunk_cache;
174 static struct dm_snap_tracked_chunk *track_chunk(struct dm_snapshot *s,
175 chunk_t chunk)
177 struct dm_snap_tracked_chunk *c = mempool_alloc(s->tracked_chunk_pool,
178 GFP_NOIO);
179 unsigned long flags;
181 c->chunk = chunk;
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);
188 return c;
191 static void stop_tracking_chunk(struct dm_snapshot *s,
192 struct dm_snap_tracked_chunk *c)
194 unsigned long flags;
196 spin_lock_irqsave(&s->tracked_chunk_lock, flags);
197 hlist_del(&c->node);
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;
207 int found = 0;
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) {
214 found = 1;
215 break;
219 spin_unlock_irq(&s->tracked_chunk_lock);
221 return found;
225 * One of these per registered origin, held in the snapshot_origins hash
227 struct origin {
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)
248 int i;
250 _origins = kmalloc(ORIGIN_HASH_SIZE * sizeof(struct list_head),
251 GFP_KERNEL);
252 if (!_origins) {
253 DMERR("unable to allocate memory");
254 return -ENOMEM;
257 for (i = 0; i < ORIGIN_HASH_SIZE; i++)
258 INIT_LIST_HEAD(_origins + i);
259 init_rwsem(&_origins_lock);
261 return 0;
264 static void exit_origin_hash(void)
266 kfree(_origins);
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;
277 struct origin *o;
279 ol = &_origins[origin_hash(origin)];
280 list_for_each_entry (o, ol, hash_list)
281 if (bdev_equal(o->bdev, origin))
282 return o;
284 return NULL;
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);
303 if (!new_o)
304 return -ENOMEM;
306 down_write(&_origins_lock);
307 o = __lookup_origin(bdev);
309 if (o)
310 kfree(new_o);
311 else {
312 /* New origin */
313 o = new_o;
315 /* Initialise the struct */
316 INIT_LIST_HEAD(&o->snapshots);
317 o->bdev = bdev;
319 __insert_origin(o);
322 list_add_tail(&snap->list, &o->snapshots);
324 up_write(&_origins_lock);
325 return 0;
328 static void unregister_snapshot(struct dm_snapshot *s)
330 struct origin *o;
332 down_write(&_origins_lock);
333 o = __lookup_origin(s->origin->bdev);
335 list_del(&s->list);
336 if (list_empty(&o->snapshots)) {
337 list_del(&o->hash_list);
338 kfree(o);
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,
350 unsigned hash_shift)
352 unsigned int i;
354 et->hash_shift = hash_shift;
355 et->hash_mask = size - 1;
356 et->table = dm_vcalloc(size, sizeof(struct list_head));
357 if (!et->table)
358 return -ENOMEM;
360 for (i = 0; i < size; i++)
361 INIT_LIST_HEAD(et->table + i);
363 return 0;
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;
370 int i, size;
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);
380 vfree(et->table);
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
402 * remapped.
404 static struct dm_snap_exception *lookup_exception(struct exception_table *et,
405 chunk_t chunk)
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))
414 return e;
416 return NULL;
419 static struct dm_snap_exception *alloc_exception(void)
421 struct dm_snap_exception *e;
423 e = kmem_cache_alloc(exception_cache, GFP_NOIO);
424 if (!e)
425 e = kmem_cache_alloc(exception_cache, GFP_ATOMIC);
427 return e;
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,
438 GFP_NOIO);
440 atomic_inc(&s->pending_exceptions_count);
441 pe->snap = s;
443 return pe;
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;
459 struct list_head *l;
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 */
465 if (!eh->hash_shift)
466 goto out;
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);
477 return;
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);
484 e->old_chunk--;
485 e->new_chunk--;
486 free_exception(new_e);
487 return;
490 if (new_e->old_chunk > e->old_chunk)
491 break;
494 out:
495 list_add(&new_e->hash_list, e ? &e->hash_list : l);
499 * Callback used by the exception stores to load exceptions when
500 * initialising.
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();
508 if (!e)
509 return -ENOMEM;
511 e->old_chunk = old;
513 /* Consecutive_count is implicitly initialised to zero */
514 e->new_chunk = new;
516 insert_completed_exception(s, e);
518 return 0;
522 * Hard coded magic.
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);
530 return mem;
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
542 * the COW volume...
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))
554 return -ENOMEM;
557 * Allocate hash table for in-flight exceptions
558 * Make this smaller than the real hash table
560 hash_size >>= 3;
561 if (hash_size < 64)
562 hash_size = 64;
564 if (init_exception_table(&s->pending, hash_size, 0)) {
565 exit_exception_table(&s->complete, exception_cache);
566 return -ENOMEM;
569 return 0;
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;
578 int i;
579 int r = -EINVAL;
580 char *origin_path;
581 struct dm_exception_store *store;
582 unsigned args_used;
584 if (argc != 4) {
585 ti->error = "requires exactly 4 arguments";
586 r = -EINVAL;
587 goto bad_args;
590 origin_path = argv[0];
591 argv++;
592 argc--;
594 r = dm_exception_store_create(ti, argc, argv, &args_used, &store);
595 if (r) {
596 ti->error = "Couldn't create exception store";
597 r = -EINVAL;
598 goto bad_args;
601 argv += args_used;
602 argc -= args_used;
604 s = kmalloc(sizeof(*s), GFP_KERNEL);
605 if (!s) {
606 ti->error = "Cannot allocate snapshot context private "
607 "structure";
608 r = -ENOMEM;
609 goto bad_snap;
612 r = dm_get_device(ti, origin_path, 0, ti->len, FMODE_READ, &s->origin);
613 if (r) {
614 ti->error = "Cannot get origin device";
615 goto bad_origin;
618 s->store = store;
619 s->valid = 1;
620 s->active = 0;
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";
628 r = -ENOMEM;
629 goto bad_hash_tables;
632 r = dm_kcopyd_client_create(SNAPSHOT_PAGES, &s->kcopyd_client);
633 if (r) {
634 ti->error = "Could not create kcopyd client";
635 goto bad_kcopyd;
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 "
648 "tracking reads";
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,
659 (void *)s);
660 if (r < 0) {
661 ti->error = "Failed to read snapshot metadata";
662 goto bad_load_and_register;
663 } else if (r > 0) {
664 s->valid = 0;
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)) {
674 r = -EINVAL;
675 ti->error = "Cannot register snapshot origin";
676 goto bad_load_and_register;
679 ti->private = s;
680 ti->split_io = s->store->chunk_size;
681 ti->num_flush_requests = 1;
683 return 0;
685 bad_load_and_register:
686 mempool_destroy(s->tracked_chunk_pool);
688 bad_tracked_chunk_pool:
689 mempool_destroy(s->pending_pool);
691 bad_pending_pool:
692 dm_kcopyd_client_destroy(s->kcopyd_client);
694 bad_kcopyd:
695 exit_exception_table(&s->pending, pending_cache);
696 exit_exception_table(&s->complete, exception_cache);
698 bad_hash_tables:
699 dm_put_device(ti, s->origin);
701 bad_origin:
702 kfree(s);
704 bad_snap:
705 dm_exception_store_destroy(store);
707 bad_args:
708 return r;
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
723 int i;
724 #endif
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))
734 msleep(1);
736 * Ensure instructions in mempool_destroy aren't reordered
737 * before atomic_read.
739 smp_mb();
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]));
744 #endif
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);
756 kfree(s);
760 * Flush a list of buffers.
762 static void flush_bios(struct bio *bio)
764 struct bio *n;
766 while (bio) {
767 n = bio->bi_next;
768 bio->bi_next = NULL;
769 generic_make_request(bio);
770 bio = n;
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;
779 unsigned long flags;
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)
793 struct bio *n;
795 while (bio) {
796 n = bio->bi_next;
797 bio->bi_next = NULL;
798 bio_io_error(bio);
799 bio = n;
803 static void __invalidate_snapshot(struct dm_snapshot *s, int err)
805 if (!s->valid)
806 return;
808 if (err == -EIO)
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);
816 s->valid = 0;
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.
838 if (primary_pe &&
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);
851 return origin_bios;
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;
860 int error = 0;
862 if (!success) {
863 /* Read/write error - snapshot is unusable */
864 down_write(&s->lock);
865 __invalidate_snapshot(s, -EIO);
866 error = 1;
867 goto out;
870 e = alloc_exception();
871 if (!e) {
872 down_write(&s->lock);
873 __invalidate_snapshot(s, -ENOMEM);
874 error = 1;
875 goto out;
877 *e = pe->e;
879 down_write(&s->lock);
880 if (!s->valid) {
881 free_exception(e);
882 error = 1;
883 goto out;
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))
891 msleep(1);
894 * Add a proper exception, and remove the
895 * in-flight exception from the list.
897 insert_completed_exception(s, e);
899 out:
900 remove_exception(&pe->e);
901 snapshot_bios = bio_list_get(&pe->snapshot_bios);
902 origin_bios = put_pending_exception(pe);
904 up_write(&s->lock);
906 /* Submit any pending write bios */
907 if (error)
908 error_bios(snapshot_bios);
909 else
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);
934 else
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;
948 sector_t dev_size;
950 dev_size = get_dev_size(bdev);
952 src.bdev = 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);
970 if (!e)
971 return NULL;
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
982 * this.
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);
991 if (pe2) {
992 free_pending_exception(pe);
993 return pe2;
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);
1001 pe->started = 0;
1003 if (s->store->type->prepare_exception(s->store, &pe->e)) {
1004 free_pending_exception(pe);
1005 return NULL;
1008 get_pending_exception(pe);
1009 insert_exception(&s->pending, &pe->e);
1011 return pe;
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)) +
1021 (bio->bi_sector &
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;
1031 chunk_t chunk;
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. */
1043 if (!s->valid)
1044 return -EIO;
1046 /* FIXME: should only take write lock if we need
1047 * to copy an exception */
1048 down_write(&s->lock);
1050 if (!s->valid) {
1051 r = -EIO;
1052 goto out_unlock;
1055 /* If the block is already remapped - use that, else remap it */
1056 e = lookup_exception(&s->complete, chunk);
1057 if (e) {
1058 remap_exception(s, e, bio, chunk);
1059 goto out_unlock;
1063 * Write to snapshot - higher level takes care of RW/RO
1064 * flags so we should only get this if we are
1065 * writeable.
1067 if (bio_rw(bio) == WRITE) {
1068 pe = __lookup_pending_exception(s, chunk);
1069 if (!pe) {
1070 up_write(&s->lock);
1071 pe = alloc_pending_exception(s);
1072 down_write(&s->lock);
1074 if (!s->valid) {
1075 free_pending_exception(pe);
1076 r = -EIO;
1077 goto out_unlock;
1080 e = lookup_exception(&s->complete, chunk);
1081 if (e) {
1082 free_pending_exception(pe);
1083 remap_exception(s, e, bio, chunk);
1084 goto out_unlock;
1087 pe = __find_pending_exception(s, pe, chunk);
1088 if (!pe) {
1089 __invalidate_snapshot(s, -ENOMEM);
1090 r = -EIO;
1091 goto out_unlock;
1095 remap_exception(s, &pe->e, bio, chunk);
1096 bio_list_add(&pe->snapshot_bios, bio);
1098 r = DM_MAPIO_SUBMITTED;
1100 if (!pe->started) {
1101 /* this is protected by snap->lock */
1102 pe->started = 1;
1103 up_write(&s->lock);
1104 start_copy(pe);
1105 goto out;
1107 } else {
1108 bio->bi_bdev = s->origin->bdev;
1109 map_context->ptr = track_chunk(s, chunk);
1112 out_unlock:
1113 up_write(&s->lock);
1114 out:
1115 return r;
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;
1124 if (c)
1125 stop_tracking_chunk(s, c);
1127 return 0;
1130 static void snapshot_resume(struct dm_target *ti)
1132 struct dm_snapshot *s = ti->private;
1134 down_write(&s->lock);
1135 s->active = 1;
1136 up_write(&s->lock);
1139 static int snapshot_status(struct dm_target *ti, status_type_t type,
1140 char *result, unsigned int maxlen)
1142 unsigned sz = 0;
1143 struct dm_snapshot *snap = ti->private;
1145 switch (type) {
1146 case STATUSTYPE_INFO:
1147 if (!snap->valid)
1148 DMEMIT("Invalid");
1149 else {
1150 if (snap->store->type->fraction_full) {
1151 sector_t numerator, denominator;
1152 snap->store->type->fraction_full(snap->store,
1153 &numerator,
1154 &denominator);
1155 DMEMIT("%llu/%llu",
1156 (unsigned long long)numerator,
1157 (unsigned long long)denominator);
1159 else
1160 DMEMIT("Unknown");
1162 break;
1164 case STATUSTYPE_TABLE:
1166 * kdevname returns a static pointer so we need
1167 * to make private copies if the output is to
1168 * make sense.
1170 DMEMIT("%s", snap->origin->name);
1171 snap->store->type->status(snap->store, type, result + sz,
1172 maxlen - sz);
1173 break;
1176 return 0;
1179 /*-----------------------------------------------------------------
1180 * Origin methods
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;
1188 chunk_t chunk;
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)
1198 goto next_snapshot;
1200 /* Nothing to do if writing beyond end of snapshot */
1201 if (bio->bi_sector >= dm_table_get_size(snap->store->ti->table))
1202 goto next_snapshot;
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);
1219 if (e)
1220 goto next_snapshot;
1222 pe = __lookup_pending_exception(snap, chunk);
1223 if (!pe) {
1224 up_write(&snap->lock);
1225 pe = alloc_pending_exception(snap);
1226 down_write(&snap->lock);
1228 if (!snap->valid) {
1229 free_pending_exception(pe);
1230 goto next_snapshot;
1233 e = lookup_exception(&snap->complete, chunk);
1234 if (e) {
1235 free_pending_exception(pe);
1236 goto next_snapshot;
1239 pe = __find_pending_exception(snap, pe, chunk);
1240 if (!pe) {
1241 __invalidate_snapshot(snap, -ENOMEM);
1242 goto next_snapshot;
1246 if (!primary_pe) {
1248 * Either every pe here has same
1249 * primary_pe or none has one yet.
1251 if (pe->primary_pe)
1252 primary_pe = pe->primary_pe;
1253 else {
1254 primary_pe = pe;
1255 first = 1;
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);
1268 if (!pe->started) {
1269 pe->started = 1;
1270 list_add_tail(&pe->list, &pe_queue);
1273 next_snapshot:
1274 up_write(&snap->lock);
1277 if (!primary_pe)
1278 return r;
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. */
1291 return r;
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)
1298 start_copy(pe);
1300 return r;
1304 * Called on a write from the origin driver.
1306 static int do_origin(struct dm_dev *origin, struct bio *bio)
1308 struct origin *o;
1309 int r = DM_MAPIO_REMAPPED;
1311 down_read(&_origins_lock);
1312 o = __lookup_origin(origin->bdev);
1313 if (o)
1314 r = __origin_write(&o->snapshots, bio);
1315 up_read(&_origins_lock);
1317 return r;
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)
1331 int r;
1332 struct dm_dev *dev;
1334 if (argc != 1) {
1335 ti->error = "origin: incorrect number of arguments";
1336 return -EINVAL;
1339 r = dm_get_device(ti, argv[0], 0, ti->len,
1340 dm_table_get_mode(ti->table), &dev);
1341 if (r) {
1342 ti->error = "Cannot get target device";
1343 return r;
1346 ti->private = dev;
1347 ti->num_flush_requests = 1;
1349 return 0;
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'
1375 * chunk sizes.
1377 static void origin_resume(struct dm_target *ti)
1379 struct dm_dev *dev = ti->private;
1380 struct dm_snapshot *snap;
1381 struct origin *o;
1382 chunk_t chunk_size = 0;
1384 down_read(&_origins_lock);
1385 o = __lookup_origin(dev->bdev);
1386 if (o)
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;
1400 switch (type) {
1401 case STATUSTYPE_INFO:
1402 result[0] = '\0';
1403 break;
1405 case STATUSTYPE_TABLE:
1406 snprintf(result, maxlen, "%s", dev->name);
1407 break;
1410 return 0;
1413 static struct target_type origin_target = {
1414 .name = "snapshot-origin",
1415 .version = {1, 6, 0},
1416 .module = THIS_MODULE,
1417 .ctr = origin_ctr,
1418 .dtr = origin_dtr,
1419 .map = origin_map,
1420 .resume = origin_resume,
1421 .status = origin_status,
1424 static struct target_type snapshot_target = {
1425 .name = "snapshot",
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)
1438 int r;
1440 r = dm_exception_store_init();
1441 if (r) {
1442 DMERR("Failed to initialize exception stores");
1443 return r;
1446 r = dm_register_target(&snapshot_target);
1447 if (r) {
1448 DMERR("snapshot target register failed %d", r);
1449 return r;
1452 r = dm_register_target(&origin_target);
1453 if (r < 0) {
1454 DMERR("Origin target register failed %d", r);
1455 goto bad1;
1458 r = init_origin_hash();
1459 if (r) {
1460 DMERR("init_origin_hash failed.");
1461 goto bad2;
1464 exception_cache = KMEM_CACHE(dm_snap_exception, 0);
1465 if (!exception_cache) {
1466 DMERR("Couldn't create exception cache.");
1467 r = -ENOMEM;
1468 goto bad3;
1471 pending_cache = KMEM_CACHE(dm_snap_pending_exception, 0);
1472 if (!pending_cache) {
1473 DMERR("Couldn't create pending cache.");
1474 r = -ENOMEM;
1475 goto bad4;
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.");
1481 r = -ENOMEM;
1482 goto bad5;
1485 ksnapd = create_singlethread_workqueue("ksnapd");
1486 if (!ksnapd) {
1487 DMERR("Failed to create ksnapd workqueue.");
1488 r = -ENOMEM;
1489 goto bad_pending_pool;
1492 return 0;
1494 bad_pending_pool:
1495 kmem_cache_destroy(tracked_chunk_cache);
1496 bad5:
1497 kmem_cache_destroy(pending_cache);
1498 bad4:
1499 kmem_cache_destroy(exception_cache);
1500 bad3:
1501 exit_origin_hash();
1502 bad2:
1503 dm_unregister_target(&origin_target);
1504 bad1:
1505 dm_unregister_target(&snapshot_target);
1506 return r;
1509 static void __exit dm_snapshot_exit(void)
1511 destroy_workqueue(ksnapd);
1513 dm_unregister_target(&snapshot_target);
1514 dm_unregister_target(&origin_target);
1516 exit_origin_hash();
1517 kmem_cache_destroy(pending_cache);
1518 kmem_cache_destroy(exception_cache);
1519 kmem_cache_destroy(tracked_chunk_cache);
1521 dm_exception_store_exit();
1524 /* Module hooks */
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");