GNU Linux-libre 4.4.284-gnu1
[releases.git] / drivers / md / dm-snap.c
1 /*
2  * dm-snapshot.c
3  *
4  * Copyright (C) 2001-2002 Sistina Software (UK) Limited.
5  *
6  * This file is released under the GPL.
7  */
8
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
23 #include "dm.h"
24
25 #include "dm-exception-store.h"
26
27 #define DM_MSG_PREFIX "snapshots"
28
29 static const char dm_snapshot_merge_target_name[] = "snapshot-merge";
30
31 #define dm_target_is_snapshot_merge(ti) \
32         ((ti)->type->name == dm_snapshot_merge_target_name)
33
34 /*
35  * The size of the mempool used to track chunks in use.
36  */
37 #define MIN_IOS 256
38
39 #define DM_TRACKED_CHUNK_HASH_SIZE      16
40 #define DM_TRACKED_CHUNK_HASH(x)        ((unsigned long)(x) & \
41                                          (DM_TRACKED_CHUNK_HASH_SIZE - 1))
42
43 struct dm_exception_table {
44         uint32_t hash_mask;
45         unsigned hash_shift;
46         struct list_head *table;
47 };
48
49 struct dm_snapshot {
50         struct mutex lock;
51
52         struct dm_dev *origin;
53         struct dm_dev *cow;
54
55         struct dm_target *ti;
56
57         /* List of snapshots per Origin */
58         struct list_head list;
59
60         /*
61          * You can't use a snapshot if this is 0 (e.g. if full).
62          * A snapshot-merge target never clears this.
63          */
64         int valid;
65
66         /*
67          * The snapshot overflowed because of a write to the snapshot device.
68          * We don't have to invalidate the snapshot in this case, but we need
69          * to prevent further writes.
70          */
71         int snapshot_overflowed;
72
73         /* Origin writes don't trigger exceptions until this is set */
74         int active;
75
76         atomic_t pending_exceptions_count;
77
78         /* Protected by "lock" */
79         sector_t exception_start_sequence;
80
81         /* Protected by kcopyd single-threaded callback */
82         sector_t exception_complete_sequence;
83
84         /*
85          * A list of pending exceptions that completed out of order.
86          * Protected by kcopyd single-threaded callback.
87          */
88         struct list_head out_of_order_list;
89
90         mempool_t *pending_pool;
91
92         struct dm_exception_table pending;
93         struct dm_exception_table complete;
94
95         /*
96          * pe_lock protects all pending_exception operations and access
97          * as well as the snapshot_bios list.
98          */
99         spinlock_t pe_lock;
100
101         /* Chunks with outstanding reads */
102         spinlock_t tracked_chunk_lock;
103         struct hlist_head tracked_chunk_hash[DM_TRACKED_CHUNK_HASH_SIZE];
104
105         /* The on disk metadata handler */
106         struct dm_exception_store *store;
107
108         unsigned in_progress;
109         wait_queue_head_t in_progress_wait;
110
111         struct dm_kcopyd_client *kcopyd_client;
112
113         /* Wait for events based on state_bits */
114         unsigned long state_bits;
115
116         /* Range of chunks currently being merged. */
117         chunk_t first_merging_chunk;
118         int num_merging_chunks;
119
120         /*
121          * The merge operation failed if this flag is set.
122          * Failure modes are handled as follows:
123          * - I/O error reading the header
124          *      => don't load the target; abort.
125          * - Header does not have "valid" flag set
126          *      => use the origin; forget about the snapshot.
127          * - I/O error when reading exceptions
128          *      => don't load the target; abort.
129          *         (We can't use the intermediate origin state.)
130          * - I/O error while merging
131          *      => stop merging; set merge_failed; process I/O normally.
132          */
133         int merge_failed;
134
135         /*
136          * Incoming bios that overlap with chunks being merged must wait
137          * for them to be committed.
138          */
139         struct bio_list bios_queued_during_merge;
140 };
141
142 /*
143  * state_bits:
144  *   RUNNING_MERGE  - Merge operation is in progress.
145  *   SHUTDOWN_MERGE - Set to signal that merge needs to be stopped;
146  *                    cleared afterwards.
147  */
148 #define RUNNING_MERGE          0
149 #define SHUTDOWN_MERGE         1
150
151 /*
152  * Maximum number of chunks being copied on write.
153  *
154  * The value was decided experimentally as a trade-off between memory
155  * consumption, stalling the kernel's workqueues and maintaining a high enough
156  * throughput.
157  */
158 #define DEFAULT_COW_THRESHOLD 2048
159
160 static unsigned cow_threshold = DEFAULT_COW_THRESHOLD;
161 module_param_named(snapshot_cow_threshold, cow_threshold, uint, 0644);
162 MODULE_PARM_DESC(snapshot_cow_threshold, "Maximum number of chunks being copied on write");
163
164 DECLARE_DM_KCOPYD_THROTTLE_WITH_MODULE_PARM(snapshot_copy_throttle,
165                 "A percentage of time allocated for copy on write");
166
167 struct dm_dev *dm_snap_origin(struct dm_snapshot *s)
168 {
169         return s->origin;
170 }
171 EXPORT_SYMBOL(dm_snap_origin);
172
173 struct dm_dev *dm_snap_cow(struct dm_snapshot *s)
174 {
175         return s->cow;
176 }
177 EXPORT_SYMBOL(dm_snap_cow);
178
179 static sector_t chunk_to_sector(struct dm_exception_store *store,
180                                 chunk_t chunk)
181 {
182         return chunk << store->chunk_shift;
183 }
184
185 static int bdev_equal(struct block_device *lhs, struct block_device *rhs)
186 {
187         /*
188          * There is only ever one instance of a particular block
189          * device so we can compare pointers safely.
190          */
191         return lhs == rhs;
192 }
193
194 struct dm_snap_pending_exception {
195         struct dm_exception e;
196
197         /*
198          * Origin buffers waiting for this to complete are held
199          * in a bio list
200          */
201         struct bio_list origin_bios;
202         struct bio_list snapshot_bios;
203
204         /* Pointer back to snapshot context */
205         struct dm_snapshot *snap;
206
207         /*
208          * 1 indicates the exception has already been sent to
209          * kcopyd.
210          */
211         int started;
212
213         /* There was copying error. */
214         int copy_error;
215
216         /* A sequence number, it is used for in-order completion. */
217         sector_t exception_sequence;
218
219         struct list_head out_of_order_entry;
220
221         /*
222          * For writing a complete chunk, bypassing the copy.
223          */
224         struct bio *full_bio;
225         bio_end_io_t *full_bio_end_io;
226         void *full_bio_private;
227 };
228
229 /*
230  * Hash table mapping origin volumes to lists of snapshots and
231  * a lock to protect it
232  */
233 static struct kmem_cache *exception_cache;
234 static struct kmem_cache *pending_cache;
235
236 struct dm_snap_tracked_chunk {
237         struct hlist_node node;
238         chunk_t chunk;
239 };
240
241 static void init_tracked_chunk(struct bio *bio)
242 {
243         struct dm_snap_tracked_chunk *c = dm_per_bio_data(bio, sizeof(struct dm_snap_tracked_chunk));
244         INIT_HLIST_NODE(&c->node);
245 }
246
247 static bool is_bio_tracked(struct bio *bio)
248 {
249         struct dm_snap_tracked_chunk *c = dm_per_bio_data(bio, sizeof(struct dm_snap_tracked_chunk));
250         return !hlist_unhashed(&c->node);
251 }
252
253 static void track_chunk(struct dm_snapshot *s, struct bio *bio, chunk_t chunk)
254 {
255         struct dm_snap_tracked_chunk *c = dm_per_bio_data(bio, sizeof(struct dm_snap_tracked_chunk));
256
257         c->chunk = chunk;
258
259         spin_lock_irq(&s->tracked_chunk_lock);
260         hlist_add_head(&c->node,
261                        &s->tracked_chunk_hash[DM_TRACKED_CHUNK_HASH(chunk)]);
262         spin_unlock_irq(&s->tracked_chunk_lock);
263 }
264
265 static void stop_tracking_chunk(struct dm_snapshot *s, struct bio *bio)
266 {
267         struct dm_snap_tracked_chunk *c = dm_per_bio_data(bio, sizeof(struct dm_snap_tracked_chunk));
268         unsigned long flags;
269
270         spin_lock_irqsave(&s->tracked_chunk_lock, flags);
271         hlist_del(&c->node);
272         spin_unlock_irqrestore(&s->tracked_chunk_lock, flags);
273 }
274
275 static int __chunk_is_tracked(struct dm_snapshot *s, chunk_t chunk)
276 {
277         struct dm_snap_tracked_chunk *c;
278         int found = 0;
279
280         spin_lock_irq(&s->tracked_chunk_lock);
281
282         hlist_for_each_entry(c,
283             &s->tracked_chunk_hash[DM_TRACKED_CHUNK_HASH(chunk)], node) {
284                 if (c->chunk == chunk) {
285                         found = 1;
286                         break;
287                 }
288         }
289
290         spin_unlock_irq(&s->tracked_chunk_lock);
291
292         return found;
293 }
294
295 /*
296  * This conflicting I/O is extremely improbable in the caller,
297  * so msleep(1) is sufficient and there is no need for a wait queue.
298  */
299 static void __check_for_conflicting_io(struct dm_snapshot *s, chunk_t chunk)
300 {
301         while (__chunk_is_tracked(s, chunk))
302                 msleep(1);
303 }
304
305 /*
306  * One of these per registered origin, held in the snapshot_origins hash
307  */
308 struct origin {
309         /* The origin device */
310         struct block_device *bdev;
311
312         struct list_head hash_list;
313
314         /* List of snapshots for this origin */
315         struct list_head snapshots;
316 };
317
318 /*
319  * This structure is allocated for each origin target
320  */
321 struct dm_origin {
322         struct dm_dev *dev;
323         struct dm_target *ti;
324         unsigned split_boundary;
325         struct list_head hash_list;
326 };
327
328 /*
329  * Size of the hash table for origin volumes. If we make this
330  * the size of the minors list then it should be nearly perfect
331  */
332 #define ORIGIN_HASH_SIZE 256
333 #define ORIGIN_MASK      0xFF
334 static struct list_head *_origins;
335 static struct list_head *_dm_origins;
336 static struct rw_semaphore _origins_lock;
337
338 static DECLARE_WAIT_QUEUE_HEAD(_pending_exceptions_done);
339 static DEFINE_SPINLOCK(_pending_exceptions_done_spinlock);
340 static uint64_t _pending_exceptions_done_count;
341
342 static int init_origin_hash(void)
343 {
344         int i;
345
346         _origins = kmalloc(ORIGIN_HASH_SIZE * sizeof(struct list_head),
347                            GFP_KERNEL);
348         if (!_origins) {
349                 DMERR("unable to allocate memory for _origins");
350                 return -ENOMEM;
351         }
352         for (i = 0; i < ORIGIN_HASH_SIZE; i++)
353                 INIT_LIST_HEAD(_origins + i);
354
355         _dm_origins = kmalloc(ORIGIN_HASH_SIZE * sizeof(struct list_head),
356                               GFP_KERNEL);
357         if (!_dm_origins) {
358                 DMERR("unable to allocate memory for _dm_origins");
359                 kfree(_origins);
360                 return -ENOMEM;
361         }
362         for (i = 0; i < ORIGIN_HASH_SIZE; i++)
363                 INIT_LIST_HEAD(_dm_origins + i);
364
365         init_rwsem(&_origins_lock);
366
367         return 0;
368 }
369
370 static void exit_origin_hash(void)
371 {
372         kfree(_origins);
373         kfree(_dm_origins);
374 }
375
376 static unsigned origin_hash(struct block_device *bdev)
377 {
378         return bdev->bd_dev & ORIGIN_MASK;
379 }
380
381 static struct origin *__lookup_origin(struct block_device *origin)
382 {
383         struct list_head *ol;
384         struct origin *o;
385
386         ol = &_origins[origin_hash(origin)];
387         list_for_each_entry (o, ol, hash_list)
388                 if (bdev_equal(o->bdev, origin))
389                         return o;
390
391         return NULL;
392 }
393
394 static void __insert_origin(struct origin *o)
395 {
396         struct list_head *sl = &_origins[origin_hash(o->bdev)];
397         list_add_tail(&o->hash_list, sl);
398 }
399
400 static struct dm_origin *__lookup_dm_origin(struct block_device *origin)
401 {
402         struct list_head *ol;
403         struct dm_origin *o;
404
405         ol = &_dm_origins[origin_hash(origin)];
406         list_for_each_entry (o, ol, hash_list)
407                 if (bdev_equal(o->dev->bdev, origin))
408                         return o;
409
410         return NULL;
411 }
412
413 static void __insert_dm_origin(struct dm_origin *o)
414 {
415         struct list_head *sl = &_dm_origins[origin_hash(o->dev->bdev)];
416         list_add_tail(&o->hash_list, sl);
417 }
418
419 static void __remove_dm_origin(struct dm_origin *o)
420 {
421         list_del(&o->hash_list);
422 }
423
424 /*
425  * _origins_lock must be held when calling this function.
426  * Returns number of snapshots registered using the supplied cow device, plus:
427  * snap_src - a snapshot suitable for use as a source of exception handover
428  * snap_dest - a snapshot capable of receiving exception handover.
429  * snap_merge - an existing snapshot-merge target linked to the same origin.
430  *   There can be at most one snapshot-merge target. The parameter is optional.
431  *
432  * Possible return values and states of snap_src and snap_dest.
433  *   0: NULL, NULL  - first new snapshot
434  *   1: snap_src, NULL - normal snapshot
435  *   2: snap_src, snap_dest  - waiting for handover
436  *   2: snap_src, NULL - handed over, waiting for old to be deleted
437  *   1: NULL, snap_dest - source got destroyed without handover
438  */
439 static int __find_snapshots_sharing_cow(struct dm_snapshot *snap,
440                                         struct dm_snapshot **snap_src,
441                                         struct dm_snapshot **snap_dest,
442                                         struct dm_snapshot **snap_merge)
443 {
444         struct dm_snapshot *s;
445         struct origin *o;
446         int count = 0;
447         int active;
448
449         o = __lookup_origin(snap->origin->bdev);
450         if (!o)
451                 goto out;
452
453         list_for_each_entry(s, &o->snapshots, list) {
454                 if (dm_target_is_snapshot_merge(s->ti) && snap_merge)
455                         *snap_merge = s;
456                 if (!bdev_equal(s->cow->bdev, snap->cow->bdev))
457                         continue;
458
459                 mutex_lock(&s->lock);
460                 active = s->active;
461                 mutex_unlock(&s->lock);
462
463                 if (active) {
464                         if (snap_src)
465                                 *snap_src = s;
466                 } else if (snap_dest)
467                         *snap_dest = s;
468
469                 count++;
470         }
471
472 out:
473         return count;
474 }
475
476 /*
477  * On success, returns 1 if this snapshot is a handover destination,
478  * otherwise returns 0.
479  */
480 static int __validate_exception_handover(struct dm_snapshot *snap)
481 {
482         struct dm_snapshot *snap_src = NULL, *snap_dest = NULL;
483         struct dm_snapshot *snap_merge = NULL;
484
485         /* Does snapshot need exceptions handed over to it? */
486         if ((__find_snapshots_sharing_cow(snap, &snap_src, &snap_dest,
487                                           &snap_merge) == 2) ||
488             snap_dest) {
489                 snap->ti->error = "Snapshot cow pairing for exception "
490                                   "table handover failed";
491                 return -EINVAL;
492         }
493
494         /*
495          * If no snap_src was found, snap cannot become a handover
496          * destination.
497          */
498         if (!snap_src)
499                 return 0;
500
501         /*
502          * Non-snapshot-merge handover?
503          */
504         if (!dm_target_is_snapshot_merge(snap->ti))
505                 return 1;
506
507         /*
508          * Do not allow more than one merging snapshot.
509          */
510         if (snap_merge) {
511                 snap->ti->error = "A snapshot is already merging.";
512                 return -EINVAL;
513         }
514
515         if (!snap_src->store->type->prepare_merge ||
516             !snap_src->store->type->commit_merge) {
517                 snap->ti->error = "Snapshot exception store does not "
518                                   "support snapshot-merge.";
519                 return -EINVAL;
520         }
521
522         return 1;
523 }
524
525 static void __insert_snapshot(struct origin *o, struct dm_snapshot *s)
526 {
527         struct dm_snapshot *l;
528
529         /* Sort the list according to chunk size, largest-first smallest-last */
530         list_for_each_entry(l, &o->snapshots, list)
531                 if (l->store->chunk_size < s->store->chunk_size)
532                         break;
533         list_add_tail(&s->list, &l->list);
534 }
535
536 /*
537  * Make a note of the snapshot and its origin so we can look it
538  * up when the origin has a write on it.
539  *
540  * Also validate snapshot exception store handovers.
541  * On success, returns 1 if this registration is a handover destination,
542  * otherwise returns 0.
543  */
544 static int register_snapshot(struct dm_snapshot *snap)
545 {
546         struct origin *o, *new_o = NULL;
547         struct block_device *bdev = snap->origin->bdev;
548         int r = 0;
549
550         new_o = kmalloc(sizeof(*new_o), GFP_KERNEL);
551         if (!new_o)
552                 return -ENOMEM;
553
554         down_write(&_origins_lock);
555
556         r = __validate_exception_handover(snap);
557         if (r < 0) {
558                 kfree(new_o);
559                 goto out;
560         }
561
562         o = __lookup_origin(bdev);
563         if (o)
564                 kfree(new_o);
565         else {
566                 /* New origin */
567                 o = new_o;
568
569                 /* Initialise the struct */
570                 INIT_LIST_HEAD(&o->snapshots);
571                 o->bdev = bdev;
572
573                 __insert_origin(o);
574         }
575
576         __insert_snapshot(o, snap);
577
578 out:
579         up_write(&_origins_lock);
580
581         return r;
582 }
583
584 /*
585  * Move snapshot to correct place in list according to chunk size.
586  */
587 static void reregister_snapshot(struct dm_snapshot *s)
588 {
589         struct block_device *bdev = s->origin->bdev;
590
591         down_write(&_origins_lock);
592
593         list_del(&s->list);
594         __insert_snapshot(__lookup_origin(bdev), s);
595
596         up_write(&_origins_lock);
597 }
598
599 static void unregister_snapshot(struct dm_snapshot *s)
600 {
601         struct origin *o;
602
603         down_write(&_origins_lock);
604         o = __lookup_origin(s->origin->bdev);
605
606         list_del(&s->list);
607         if (o && list_empty(&o->snapshots)) {
608                 list_del(&o->hash_list);
609                 kfree(o);
610         }
611
612         up_write(&_origins_lock);
613 }
614
615 /*
616  * Implementation of the exception hash tables.
617  * The lowest hash_shift bits of the chunk number are ignored, allowing
618  * some consecutive chunks to be grouped together.
619  */
620 static int dm_exception_table_init(struct dm_exception_table *et,
621                                    uint32_t size, unsigned hash_shift)
622 {
623         unsigned int i;
624
625         et->hash_shift = hash_shift;
626         et->hash_mask = size - 1;
627         et->table = dm_vcalloc(size, sizeof(struct list_head));
628         if (!et->table)
629                 return -ENOMEM;
630
631         for (i = 0; i < size; i++)
632                 INIT_LIST_HEAD(et->table + i);
633
634         return 0;
635 }
636
637 static void dm_exception_table_exit(struct dm_exception_table *et,
638                                     struct kmem_cache *mem)
639 {
640         struct list_head *slot;
641         struct dm_exception *ex, *next;
642         int i, size;
643
644         size = et->hash_mask + 1;
645         for (i = 0; i < size; i++) {
646                 slot = et->table + i;
647
648                 list_for_each_entry_safe (ex, next, slot, hash_list)
649                         kmem_cache_free(mem, ex);
650         }
651
652         vfree(et->table);
653 }
654
655 static uint32_t exception_hash(struct dm_exception_table *et, chunk_t chunk)
656 {
657         return (chunk >> et->hash_shift) & et->hash_mask;
658 }
659
660 static void dm_remove_exception(struct dm_exception *e)
661 {
662         list_del(&e->hash_list);
663 }
664
665 /*
666  * Return the exception data for a sector, or NULL if not
667  * remapped.
668  */
669 static struct dm_exception *dm_lookup_exception(struct dm_exception_table *et,
670                                                 chunk_t chunk)
671 {
672         struct list_head *slot;
673         struct dm_exception *e;
674
675         slot = &et->table[exception_hash(et, chunk)];
676         list_for_each_entry (e, slot, hash_list)
677                 if (chunk >= e->old_chunk &&
678                     chunk <= e->old_chunk + dm_consecutive_chunk_count(e))
679                         return e;
680
681         return NULL;
682 }
683
684 static struct dm_exception *alloc_completed_exception(gfp_t gfp)
685 {
686         struct dm_exception *e;
687
688         e = kmem_cache_alloc(exception_cache, gfp);
689         if (!e && gfp == GFP_NOIO)
690                 e = kmem_cache_alloc(exception_cache, GFP_ATOMIC);
691
692         return e;
693 }
694
695 static void free_completed_exception(struct dm_exception *e)
696 {
697         kmem_cache_free(exception_cache, e);
698 }
699
700 static struct dm_snap_pending_exception *alloc_pending_exception(struct dm_snapshot *s)
701 {
702         struct dm_snap_pending_exception *pe = mempool_alloc(s->pending_pool,
703                                                              GFP_NOIO);
704
705         atomic_inc(&s->pending_exceptions_count);
706         pe->snap = s;
707
708         return pe;
709 }
710
711 static void free_pending_exception(struct dm_snap_pending_exception *pe)
712 {
713         struct dm_snapshot *s = pe->snap;
714
715         mempool_free(pe, s->pending_pool);
716         smp_mb__before_atomic();
717         atomic_dec(&s->pending_exceptions_count);
718 }
719
720 static void dm_insert_exception(struct dm_exception_table *eh,
721                                 struct dm_exception *new_e)
722 {
723         struct list_head *l;
724         struct dm_exception *e = NULL;
725
726         l = &eh->table[exception_hash(eh, new_e->old_chunk)];
727
728         /* Add immediately if this table doesn't support consecutive chunks */
729         if (!eh->hash_shift)
730                 goto out;
731
732         /* List is ordered by old_chunk */
733         list_for_each_entry_reverse(e, l, hash_list) {
734                 /* Insert after an existing chunk? */
735                 if (new_e->old_chunk == (e->old_chunk +
736                                          dm_consecutive_chunk_count(e) + 1) &&
737                     new_e->new_chunk == (dm_chunk_number(e->new_chunk) +
738                                          dm_consecutive_chunk_count(e) + 1)) {
739                         dm_consecutive_chunk_count_inc(e);
740                         free_completed_exception(new_e);
741                         return;
742                 }
743
744                 /* Insert before an existing chunk? */
745                 if (new_e->old_chunk == (e->old_chunk - 1) &&
746                     new_e->new_chunk == (dm_chunk_number(e->new_chunk) - 1)) {
747                         dm_consecutive_chunk_count_inc(e);
748                         e->old_chunk--;
749                         e->new_chunk--;
750                         free_completed_exception(new_e);
751                         return;
752                 }
753
754                 if (new_e->old_chunk > e->old_chunk)
755                         break;
756         }
757
758 out:
759         list_add(&new_e->hash_list, e ? &e->hash_list : l);
760 }
761
762 /*
763  * Callback used by the exception stores to load exceptions when
764  * initialising.
765  */
766 static int dm_add_exception(void *context, chunk_t old, chunk_t new)
767 {
768         struct dm_snapshot *s = context;
769         struct dm_exception *e;
770
771         e = alloc_completed_exception(GFP_KERNEL);
772         if (!e)
773                 return -ENOMEM;
774
775         e->old_chunk = old;
776
777         /* Consecutive_count is implicitly initialised to zero */
778         e->new_chunk = new;
779
780         dm_insert_exception(&s->complete, e);
781
782         return 0;
783 }
784
785 /*
786  * Return a minimum chunk size of all snapshots that have the specified origin.
787  * Return zero if the origin has no snapshots.
788  */
789 static uint32_t __minimum_chunk_size(struct origin *o)
790 {
791         struct dm_snapshot *snap;
792         unsigned chunk_size = rounddown_pow_of_two(UINT_MAX);
793
794         if (o)
795                 list_for_each_entry(snap, &o->snapshots, list)
796                         chunk_size = min_not_zero(chunk_size,
797                                                   snap->store->chunk_size);
798
799         return (uint32_t) chunk_size;
800 }
801
802 /*
803  * Hard coded magic.
804  */
805 static int calc_max_buckets(void)
806 {
807         /* use a fixed size of 2MB */
808         unsigned long mem = 2 * 1024 * 1024;
809         mem /= sizeof(struct list_head);
810
811         return mem;
812 }
813
814 /*
815  * Allocate room for a suitable hash table.
816  */
817 static int init_hash_tables(struct dm_snapshot *s)
818 {
819         sector_t hash_size, cow_dev_size, max_buckets;
820
821         /*
822          * Calculate based on the size of the original volume or
823          * the COW volume...
824          */
825         cow_dev_size = get_dev_size(s->cow->bdev);
826         max_buckets = calc_max_buckets();
827
828         hash_size = cow_dev_size >> s->store->chunk_shift;
829         hash_size = min(hash_size, max_buckets);
830
831         if (hash_size < 64)
832                 hash_size = 64;
833         hash_size = rounddown_pow_of_two(hash_size);
834         if (dm_exception_table_init(&s->complete, hash_size,
835                                     DM_CHUNK_CONSECUTIVE_BITS))
836                 return -ENOMEM;
837
838         /*
839          * Allocate hash table for in-flight exceptions
840          * Make this smaller than the real hash table
841          */
842         hash_size >>= 3;
843         if (hash_size < 64)
844                 hash_size = 64;
845
846         if (dm_exception_table_init(&s->pending, hash_size, 0)) {
847                 dm_exception_table_exit(&s->complete, exception_cache);
848                 return -ENOMEM;
849         }
850
851         return 0;
852 }
853
854 static void merge_shutdown(struct dm_snapshot *s)
855 {
856         clear_bit_unlock(RUNNING_MERGE, &s->state_bits);
857         smp_mb__after_atomic();
858         wake_up_bit(&s->state_bits, RUNNING_MERGE);
859 }
860
861 static struct bio *__release_queued_bios_after_merge(struct dm_snapshot *s)
862 {
863         s->first_merging_chunk = 0;
864         s->num_merging_chunks = 0;
865
866         return bio_list_get(&s->bios_queued_during_merge);
867 }
868
869 /*
870  * Remove one chunk from the index of completed exceptions.
871  */
872 static int __remove_single_exception_chunk(struct dm_snapshot *s,
873                                            chunk_t old_chunk)
874 {
875         struct dm_exception *e;
876
877         e = dm_lookup_exception(&s->complete, old_chunk);
878         if (!e) {
879                 DMERR("Corruption detected: exception for block %llu is "
880                       "on disk but not in memory",
881                       (unsigned long long)old_chunk);
882                 return -EINVAL;
883         }
884
885         /*
886          * If this is the only chunk using this exception, remove exception.
887          */
888         if (!dm_consecutive_chunk_count(e)) {
889                 dm_remove_exception(e);
890                 free_completed_exception(e);
891                 return 0;
892         }
893
894         /*
895          * The chunk may be either at the beginning or the end of a
896          * group of consecutive chunks - never in the middle.  We are
897          * removing chunks in the opposite order to that in which they
898          * were added, so this should always be true.
899          * Decrement the consecutive chunk counter and adjust the
900          * starting point if necessary.
901          */
902         if (old_chunk == e->old_chunk) {
903                 e->old_chunk++;
904                 e->new_chunk++;
905         } else if (old_chunk != e->old_chunk +
906                    dm_consecutive_chunk_count(e)) {
907                 DMERR("Attempt to merge block %llu from the "
908                       "middle of a chunk range [%llu - %llu]",
909                       (unsigned long long)old_chunk,
910                       (unsigned long long)e->old_chunk,
911                       (unsigned long long)
912                       e->old_chunk + dm_consecutive_chunk_count(e));
913                 return -EINVAL;
914         }
915
916         dm_consecutive_chunk_count_dec(e);
917
918         return 0;
919 }
920
921 static void flush_bios(struct bio *bio);
922
923 static int remove_single_exception_chunk(struct dm_snapshot *s)
924 {
925         struct bio *b = NULL;
926         int r;
927         chunk_t old_chunk = s->first_merging_chunk + s->num_merging_chunks - 1;
928
929         mutex_lock(&s->lock);
930
931         /*
932          * Process chunks (and associated exceptions) in reverse order
933          * so that dm_consecutive_chunk_count_dec() accounting works.
934          */
935         do {
936                 r = __remove_single_exception_chunk(s, old_chunk);
937                 if (r)
938                         goto out;
939         } while (old_chunk-- > s->first_merging_chunk);
940
941         b = __release_queued_bios_after_merge(s);
942
943 out:
944         mutex_unlock(&s->lock);
945         if (b)
946                 flush_bios(b);
947
948         return r;
949 }
950
951 static int origin_write_extent(struct dm_snapshot *merging_snap,
952                                sector_t sector, unsigned chunk_size);
953
954 static void merge_callback(int read_err, unsigned long write_err,
955                            void *context);
956
957 static uint64_t read_pending_exceptions_done_count(void)
958 {
959         uint64_t pending_exceptions_done;
960
961         spin_lock(&_pending_exceptions_done_spinlock);
962         pending_exceptions_done = _pending_exceptions_done_count;
963         spin_unlock(&_pending_exceptions_done_spinlock);
964
965         return pending_exceptions_done;
966 }
967
968 static void increment_pending_exceptions_done_count(void)
969 {
970         spin_lock(&_pending_exceptions_done_spinlock);
971         _pending_exceptions_done_count++;
972         spin_unlock(&_pending_exceptions_done_spinlock);
973
974         wake_up_all(&_pending_exceptions_done);
975 }
976
977 static void snapshot_merge_next_chunks(struct dm_snapshot *s)
978 {
979         int i, linear_chunks;
980         chunk_t old_chunk, new_chunk;
981         struct dm_io_region src, dest;
982         sector_t io_size;
983         uint64_t previous_count;
984
985         BUG_ON(!test_bit(RUNNING_MERGE, &s->state_bits));
986         if (unlikely(test_bit(SHUTDOWN_MERGE, &s->state_bits)))
987                 goto shut;
988
989         /*
990          * valid flag never changes during merge, so no lock required.
991          */
992         if (!s->valid) {
993                 DMERR("Snapshot is invalid: can't merge");
994                 goto shut;
995         }
996
997         linear_chunks = s->store->type->prepare_merge(s->store, &old_chunk,
998                                                       &new_chunk);
999         if (linear_chunks <= 0) {
1000                 if (linear_chunks < 0) {
1001                         DMERR("Read error in exception store: "
1002                               "shutting down merge");
1003                         mutex_lock(&s->lock);
1004                         s->merge_failed = 1;
1005                         mutex_unlock(&s->lock);
1006                 }
1007                 goto shut;
1008         }
1009
1010         /* Adjust old_chunk and new_chunk to reflect start of linear region */
1011         old_chunk = old_chunk + 1 - linear_chunks;
1012         new_chunk = new_chunk + 1 - linear_chunks;
1013
1014         /*
1015          * Use one (potentially large) I/O to copy all 'linear_chunks'
1016          * from the exception store to the origin
1017          */
1018         io_size = linear_chunks * s->store->chunk_size;
1019
1020         dest.bdev = s->origin->bdev;
1021         dest.sector = chunk_to_sector(s->store, old_chunk);
1022         dest.count = min(io_size, get_dev_size(dest.bdev) - dest.sector);
1023
1024         src.bdev = s->cow->bdev;
1025         src.sector = chunk_to_sector(s->store, new_chunk);
1026         src.count = dest.count;
1027
1028         /*
1029          * Reallocate any exceptions needed in other snapshots then
1030          * wait for the pending exceptions to complete.
1031          * Each time any pending exception (globally on the system)
1032          * completes we are woken and repeat the process to find out
1033          * if we can proceed.  While this may not seem a particularly
1034          * efficient algorithm, it is not expected to have any
1035          * significant impact on performance.
1036          */
1037         previous_count = read_pending_exceptions_done_count();
1038         while (origin_write_extent(s, dest.sector, io_size)) {
1039                 wait_event(_pending_exceptions_done,
1040                            (read_pending_exceptions_done_count() !=
1041                             previous_count));
1042                 /* Retry after the wait, until all exceptions are done. */
1043                 previous_count = read_pending_exceptions_done_count();
1044         }
1045
1046         mutex_lock(&s->lock);
1047         s->first_merging_chunk = old_chunk;
1048         s->num_merging_chunks = linear_chunks;
1049         mutex_unlock(&s->lock);
1050
1051         /* Wait until writes to all 'linear_chunks' drain */
1052         for (i = 0; i < linear_chunks; i++)
1053                 __check_for_conflicting_io(s, old_chunk + i);
1054
1055         dm_kcopyd_copy(s->kcopyd_client, &src, 1, &dest, 0, merge_callback, s);
1056         return;
1057
1058 shut:
1059         merge_shutdown(s);
1060 }
1061
1062 static void error_bios(struct bio *bio);
1063
1064 static void merge_callback(int read_err, unsigned long write_err, void *context)
1065 {
1066         struct dm_snapshot *s = context;
1067         struct bio *b = NULL;
1068
1069         if (read_err || write_err) {
1070                 if (read_err)
1071                         DMERR("Read error: shutting down merge.");
1072                 else
1073                         DMERR("Write error: shutting down merge.");
1074                 goto shut;
1075         }
1076
1077         if (s->store->type->commit_merge(s->store,
1078                                          s->num_merging_chunks) < 0) {
1079                 DMERR("Write error in exception store: shutting down merge");
1080                 goto shut;
1081         }
1082
1083         if (remove_single_exception_chunk(s) < 0)
1084                 goto shut;
1085
1086         snapshot_merge_next_chunks(s);
1087
1088         return;
1089
1090 shut:
1091         mutex_lock(&s->lock);
1092         s->merge_failed = 1;
1093         b = __release_queued_bios_after_merge(s);
1094         mutex_unlock(&s->lock);
1095         error_bios(b);
1096
1097         merge_shutdown(s);
1098 }
1099
1100 static void start_merge(struct dm_snapshot *s)
1101 {
1102         if (!test_and_set_bit(RUNNING_MERGE, &s->state_bits))
1103                 snapshot_merge_next_chunks(s);
1104 }
1105
1106 /*
1107  * Stop the merging process and wait until it finishes.
1108  */
1109 static void stop_merge(struct dm_snapshot *s)
1110 {
1111         set_bit(SHUTDOWN_MERGE, &s->state_bits);
1112         wait_on_bit(&s->state_bits, RUNNING_MERGE, TASK_UNINTERRUPTIBLE);
1113         clear_bit(SHUTDOWN_MERGE, &s->state_bits);
1114 }
1115
1116 /*
1117  * Construct a snapshot mapping: <origin_dev> <COW-dev> <p|po|n> <chunk-size>
1118  */
1119 static int snapshot_ctr(struct dm_target *ti, unsigned int argc, char **argv)
1120 {
1121         struct dm_snapshot *s;
1122         int i;
1123         int r = -EINVAL;
1124         char *origin_path, *cow_path;
1125         dev_t origin_dev, cow_dev;
1126         unsigned args_used, num_flush_bios = 1;
1127         fmode_t origin_mode = FMODE_READ;
1128
1129         if (argc != 4) {
1130                 ti->error = "requires exactly 4 arguments";
1131                 r = -EINVAL;
1132                 goto bad;
1133         }
1134
1135         if (dm_target_is_snapshot_merge(ti)) {
1136                 num_flush_bios = 2;
1137                 origin_mode = FMODE_WRITE;
1138         }
1139
1140         s = kzalloc(sizeof(*s), GFP_KERNEL);
1141         if (!s) {
1142                 ti->error = "Cannot allocate private snapshot structure";
1143                 r = -ENOMEM;
1144                 goto bad;
1145         }
1146
1147         origin_path = argv[0];
1148         argv++;
1149         argc--;
1150
1151         r = dm_get_device(ti, origin_path, origin_mode, &s->origin);
1152         if (r) {
1153                 ti->error = "Cannot get origin device";
1154                 goto bad_origin;
1155         }
1156         origin_dev = s->origin->bdev->bd_dev;
1157
1158         cow_path = argv[0];
1159         argv++;
1160         argc--;
1161
1162         cow_dev = dm_get_dev_t(cow_path);
1163         if (cow_dev && cow_dev == origin_dev) {
1164                 ti->error = "COW device cannot be the same as origin device";
1165                 r = -EINVAL;
1166                 goto bad_cow;
1167         }
1168
1169         r = dm_get_device(ti, cow_path, dm_table_get_mode(ti->table), &s->cow);
1170         if (r) {
1171                 ti->error = "Cannot get COW device";
1172                 goto bad_cow;
1173         }
1174
1175         r = dm_exception_store_create(ti, argc, argv, s, &args_used, &s->store);
1176         if (r) {
1177                 ti->error = "Couldn't create exception store";
1178                 r = -EINVAL;
1179                 goto bad_store;
1180         }
1181
1182         argv += args_used;
1183         argc -= args_used;
1184
1185         s->ti = ti;
1186         s->valid = 1;
1187         s->snapshot_overflowed = 0;
1188         s->active = 0;
1189         atomic_set(&s->pending_exceptions_count, 0);
1190         s->exception_start_sequence = 0;
1191         s->exception_complete_sequence = 0;
1192         INIT_LIST_HEAD(&s->out_of_order_list);
1193         mutex_init(&s->lock);
1194         INIT_LIST_HEAD(&s->list);
1195         spin_lock_init(&s->pe_lock);
1196         s->state_bits = 0;
1197         s->merge_failed = 0;
1198         s->first_merging_chunk = 0;
1199         s->num_merging_chunks = 0;
1200         bio_list_init(&s->bios_queued_during_merge);
1201
1202         /* Allocate hash table for COW data */
1203         if (init_hash_tables(s)) {
1204                 ti->error = "Unable to allocate hash table space";
1205                 r = -ENOMEM;
1206                 goto bad_hash_tables;
1207         }
1208
1209         init_waitqueue_head(&s->in_progress_wait);
1210
1211         s->kcopyd_client = dm_kcopyd_client_create(&dm_kcopyd_throttle);
1212         if (IS_ERR(s->kcopyd_client)) {
1213                 r = PTR_ERR(s->kcopyd_client);
1214                 ti->error = "Could not create kcopyd client";
1215                 goto bad_kcopyd;
1216         }
1217
1218         s->pending_pool = mempool_create_slab_pool(MIN_IOS, pending_cache);
1219         if (!s->pending_pool) {
1220                 ti->error = "Could not allocate mempool for pending exceptions";
1221                 r = -ENOMEM;
1222                 goto bad_pending_pool;
1223         }
1224
1225         for (i = 0; i < DM_TRACKED_CHUNK_HASH_SIZE; i++)
1226                 INIT_HLIST_HEAD(&s->tracked_chunk_hash[i]);
1227
1228         spin_lock_init(&s->tracked_chunk_lock);
1229
1230         ti->private = s;
1231         ti->num_flush_bios = num_flush_bios;
1232         ti->per_bio_data_size = sizeof(struct dm_snap_tracked_chunk);
1233
1234         /* Add snapshot to the list of snapshots for this origin */
1235         /* Exceptions aren't triggered till snapshot_resume() is called */
1236         r = register_snapshot(s);
1237         if (r == -ENOMEM) {
1238                 ti->error = "Snapshot origin struct allocation failed";
1239                 goto bad_load_and_register;
1240         } else if (r < 0) {
1241                 /* invalid handover, register_snapshot has set ti->error */
1242                 goto bad_load_and_register;
1243         }
1244
1245         /*
1246          * Metadata must only be loaded into one table at once, so skip this
1247          * if metadata will be handed over during resume.
1248          * Chunk size will be set during the handover - set it to zero to
1249          * ensure it's ignored.
1250          */
1251         if (r > 0) {
1252                 s->store->chunk_size = 0;
1253                 return 0;
1254         }
1255
1256         r = s->store->type->read_metadata(s->store, dm_add_exception,
1257                                           (void *)s);
1258         if (r < 0) {
1259                 ti->error = "Failed to read snapshot metadata";
1260                 goto bad_read_metadata;
1261         } else if (r > 0) {
1262                 s->valid = 0;
1263                 DMWARN("Snapshot is marked invalid.");
1264         }
1265
1266         if (!s->store->chunk_size) {
1267                 ti->error = "Chunk size not set";
1268                 r = -EINVAL;
1269                 goto bad_read_metadata;
1270         }
1271
1272         r = dm_set_target_max_io_len(ti, s->store->chunk_size);
1273         if (r)
1274                 goto bad_read_metadata;
1275
1276         return 0;
1277
1278 bad_read_metadata:
1279         unregister_snapshot(s);
1280
1281 bad_load_and_register:
1282         mempool_destroy(s->pending_pool);
1283
1284 bad_pending_pool:
1285         dm_kcopyd_client_destroy(s->kcopyd_client);
1286
1287 bad_kcopyd:
1288         dm_exception_table_exit(&s->pending, pending_cache);
1289         dm_exception_table_exit(&s->complete, exception_cache);
1290
1291 bad_hash_tables:
1292         dm_exception_store_destroy(s->store);
1293
1294 bad_store:
1295         dm_put_device(ti, s->cow);
1296
1297 bad_cow:
1298         dm_put_device(ti, s->origin);
1299
1300 bad_origin:
1301         kfree(s);
1302
1303 bad:
1304         return r;
1305 }
1306
1307 static void __free_exceptions(struct dm_snapshot *s)
1308 {
1309         dm_kcopyd_client_destroy(s->kcopyd_client);
1310         s->kcopyd_client = NULL;
1311
1312         dm_exception_table_exit(&s->pending, pending_cache);
1313         dm_exception_table_exit(&s->complete, exception_cache);
1314 }
1315
1316 static void __handover_exceptions(struct dm_snapshot *snap_src,
1317                                   struct dm_snapshot *snap_dest)
1318 {
1319         union {
1320                 struct dm_exception_table table_swap;
1321                 struct dm_exception_store *store_swap;
1322         } u;
1323
1324         /*
1325          * Swap all snapshot context information between the two instances.
1326          */
1327         u.table_swap = snap_dest->complete;
1328         snap_dest->complete = snap_src->complete;
1329         snap_src->complete = u.table_swap;
1330
1331         u.store_swap = snap_dest->store;
1332         snap_dest->store = snap_src->store;
1333         snap_dest->store->userspace_supports_overflow = u.store_swap->userspace_supports_overflow;
1334         snap_src->store = u.store_swap;
1335
1336         snap_dest->store->snap = snap_dest;
1337         snap_src->store->snap = snap_src;
1338
1339         snap_dest->ti->max_io_len = snap_dest->store->chunk_size;
1340         snap_dest->valid = snap_src->valid;
1341         snap_dest->snapshot_overflowed = snap_src->snapshot_overflowed;
1342
1343         /*
1344          * Set source invalid to ensure it receives no further I/O.
1345          */
1346         snap_src->valid = 0;
1347 }
1348
1349 static void snapshot_dtr(struct dm_target *ti)
1350 {
1351 #ifdef CONFIG_DM_DEBUG
1352         int i;
1353 #endif
1354         struct dm_snapshot *s = ti->private;
1355         struct dm_snapshot *snap_src = NULL, *snap_dest = NULL;
1356
1357         down_read(&_origins_lock);
1358         /* Check whether exception handover must be cancelled */
1359         (void) __find_snapshots_sharing_cow(s, &snap_src, &snap_dest, NULL);
1360         if (snap_src && snap_dest && (s == snap_src)) {
1361                 mutex_lock(&snap_dest->lock);
1362                 snap_dest->valid = 0;
1363                 mutex_unlock(&snap_dest->lock);
1364                 DMERR("Cancelling snapshot handover.");
1365         }
1366         up_read(&_origins_lock);
1367
1368         if (dm_target_is_snapshot_merge(ti))
1369                 stop_merge(s);
1370
1371         /* Prevent further origin writes from using this snapshot. */
1372         /* After this returns there can be no new kcopyd jobs. */
1373         unregister_snapshot(s);
1374
1375         while (atomic_read(&s->pending_exceptions_count))
1376                 msleep(1);
1377         /*
1378          * Ensure instructions in mempool_destroy aren't reordered
1379          * before atomic_read.
1380          */
1381         smp_mb();
1382
1383 #ifdef CONFIG_DM_DEBUG
1384         for (i = 0; i < DM_TRACKED_CHUNK_HASH_SIZE; i++)
1385                 BUG_ON(!hlist_empty(&s->tracked_chunk_hash[i]));
1386 #endif
1387
1388         __free_exceptions(s);
1389
1390         mempool_destroy(s->pending_pool);
1391
1392         dm_exception_store_destroy(s->store);
1393
1394         mutex_destroy(&s->lock);
1395
1396         dm_put_device(ti, s->cow);
1397
1398         dm_put_device(ti, s->origin);
1399
1400         WARN_ON(s->in_progress);
1401
1402         kfree(s);
1403 }
1404
1405 static void account_start_copy(struct dm_snapshot *s)
1406 {
1407         spin_lock(&s->in_progress_wait.lock);
1408         s->in_progress++;
1409         spin_unlock(&s->in_progress_wait.lock);
1410 }
1411
1412 static void account_end_copy(struct dm_snapshot *s)
1413 {
1414         spin_lock(&s->in_progress_wait.lock);
1415         BUG_ON(!s->in_progress);
1416         s->in_progress--;
1417         if (likely(s->in_progress <= cow_threshold) &&
1418             unlikely(waitqueue_active(&s->in_progress_wait)))
1419                 wake_up_locked(&s->in_progress_wait);
1420         spin_unlock(&s->in_progress_wait.lock);
1421 }
1422
1423 static bool wait_for_in_progress(struct dm_snapshot *s, bool unlock_origins)
1424 {
1425         if (unlikely(s->in_progress > cow_threshold)) {
1426                 spin_lock(&s->in_progress_wait.lock);
1427                 if (likely(s->in_progress > cow_threshold)) {
1428                         /*
1429                          * NOTE: this throttle doesn't account for whether
1430                          * the caller is servicing an IO that will trigger a COW
1431                          * so excess throttling may result for chunks not required
1432                          * to be COW'd.  But if cow_threshold was reached, extra
1433                          * throttling is unlikely to negatively impact performance.
1434                          */
1435                         DECLARE_WAITQUEUE(wait, current);
1436                         __add_wait_queue(&s->in_progress_wait, &wait);
1437                         __set_current_state(TASK_UNINTERRUPTIBLE);
1438                         spin_unlock(&s->in_progress_wait.lock);
1439                         if (unlock_origins)
1440                                 up_read(&_origins_lock);
1441                         io_schedule();
1442                         remove_wait_queue(&s->in_progress_wait, &wait);
1443                         return false;
1444                 }
1445                 spin_unlock(&s->in_progress_wait.lock);
1446         }
1447         return true;
1448 }
1449
1450 /*
1451  * Flush a list of buffers.
1452  */
1453 static void flush_bios(struct bio *bio)
1454 {
1455         struct bio *n;
1456
1457         while (bio) {
1458                 n = bio->bi_next;
1459                 bio->bi_next = NULL;
1460                 generic_make_request(bio);
1461                 bio = n;
1462         }
1463 }
1464
1465 static int do_origin(struct dm_dev *origin, struct bio *bio, bool limit);
1466
1467 /*
1468  * Flush a list of buffers.
1469  */
1470 static void retry_origin_bios(struct dm_snapshot *s, struct bio *bio)
1471 {
1472         struct bio *n;
1473         int r;
1474
1475         while (bio) {
1476                 n = bio->bi_next;
1477                 bio->bi_next = NULL;
1478                 r = do_origin(s->origin, bio, false);
1479                 if (r == DM_MAPIO_REMAPPED)
1480                         generic_make_request(bio);
1481                 bio = n;
1482         }
1483 }
1484
1485 /*
1486  * Error a list of buffers.
1487  */
1488 static void error_bios(struct bio *bio)
1489 {
1490         struct bio *n;
1491
1492         while (bio) {
1493                 n = bio->bi_next;
1494                 bio->bi_next = NULL;
1495                 bio_io_error(bio);
1496                 bio = n;
1497         }
1498 }
1499
1500 static void __invalidate_snapshot(struct dm_snapshot *s, int err)
1501 {
1502         if (!s->valid)
1503                 return;
1504
1505         if (err == -EIO)
1506                 DMERR("Invalidating snapshot: Error reading/writing.");
1507         else if (err == -ENOMEM)
1508                 DMERR("Invalidating snapshot: Unable to allocate exception.");
1509
1510         if (s->store->type->drop_snapshot)
1511                 s->store->type->drop_snapshot(s->store);
1512
1513         s->valid = 0;
1514
1515         dm_table_event(s->ti->table);
1516 }
1517
1518 static void pending_complete(void *context, int success)
1519 {
1520         struct dm_snap_pending_exception *pe = context;
1521         struct dm_exception *e;
1522         struct dm_snapshot *s = pe->snap;
1523         struct bio *origin_bios = NULL;
1524         struct bio *snapshot_bios = NULL;
1525         struct bio *full_bio = NULL;
1526         int error = 0;
1527
1528         if (!success) {
1529                 /* Read/write error - snapshot is unusable */
1530                 mutex_lock(&s->lock);
1531                 __invalidate_snapshot(s, -EIO);
1532                 error = 1;
1533                 goto out;
1534         }
1535
1536         e = alloc_completed_exception(GFP_NOIO);
1537         if (!e) {
1538                 mutex_lock(&s->lock);
1539                 __invalidate_snapshot(s, -ENOMEM);
1540                 error = 1;
1541                 goto out;
1542         }
1543         *e = pe->e;
1544
1545         mutex_lock(&s->lock);
1546         if (!s->valid) {
1547                 free_completed_exception(e);
1548                 error = 1;
1549                 goto out;
1550         }
1551
1552         /* Check for conflicting reads */
1553         __check_for_conflicting_io(s, pe->e.old_chunk);
1554
1555         /*
1556          * Add a proper exception, and remove the
1557          * in-flight exception from the list.
1558          */
1559         dm_insert_exception(&s->complete, e);
1560
1561 out:
1562         dm_remove_exception(&pe->e);
1563         snapshot_bios = bio_list_get(&pe->snapshot_bios);
1564         origin_bios = bio_list_get(&pe->origin_bios);
1565         full_bio = pe->full_bio;
1566         if (full_bio) {
1567                 full_bio->bi_end_io = pe->full_bio_end_io;
1568                 full_bio->bi_private = pe->full_bio_private;
1569         }
1570         increment_pending_exceptions_done_count();
1571
1572         mutex_unlock(&s->lock);
1573
1574         /* Submit any pending write bios */
1575         if (error) {
1576                 if (full_bio)
1577                         bio_io_error(full_bio);
1578                 error_bios(snapshot_bios);
1579         } else {
1580                 if (full_bio)
1581                         bio_endio(full_bio);
1582                 flush_bios(snapshot_bios);
1583         }
1584
1585         retry_origin_bios(s, origin_bios);
1586
1587         free_pending_exception(pe);
1588 }
1589
1590 static void complete_exception(struct dm_snap_pending_exception *pe)
1591 {
1592         struct dm_snapshot *s = pe->snap;
1593
1594         /* Update the metadata if we are persistent */
1595         s->store->type->commit_exception(s->store, &pe->e, !pe->copy_error,
1596                                          pending_complete, pe);
1597 }
1598
1599 /*
1600  * Called when the copy I/O has finished.  kcopyd actually runs
1601  * this code so don't block.
1602  */
1603 static void copy_callback(int read_err, unsigned long write_err, void *context)
1604 {
1605         struct dm_snap_pending_exception *pe = context;
1606         struct dm_snapshot *s = pe->snap;
1607
1608         pe->copy_error = read_err || write_err;
1609
1610         if (pe->exception_sequence == s->exception_complete_sequence) {
1611                 s->exception_complete_sequence++;
1612                 complete_exception(pe);
1613
1614                 while (!list_empty(&s->out_of_order_list)) {
1615                         pe = list_entry(s->out_of_order_list.next,
1616                                         struct dm_snap_pending_exception, out_of_order_entry);
1617                         if (pe->exception_sequence != s->exception_complete_sequence)
1618                                 break;
1619                         s->exception_complete_sequence++;
1620                         list_del(&pe->out_of_order_entry);
1621                         complete_exception(pe);
1622                 }
1623         } else {
1624                 struct list_head *lh;
1625                 struct dm_snap_pending_exception *pe2;
1626
1627                 list_for_each_prev(lh, &s->out_of_order_list) {
1628                         pe2 = list_entry(lh, struct dm_snap_pending_exception, out_of_order_entry);
1629                         if (pe2->exception_sequence < pe->exception_sequence)
1630                                 break;
1631                 }
1632                 list_add(&pe->out_of_order_entry, lh);
1633         }
1634         account_end_copy(s);
1635 }
1636
1637 /*
1638  * Dispatches the copy operation to kcopyd.
1639  */
1640 static void start_copy(struct dm_snap_pending_exception *pe)
1641 {
1642         struct dm_snapshot *s = pe->snap;
1643         struct dm_io_region src, dest;
1644         struct block_device *bdev = s->origin->bdev;
1645         sector_t dev_size;
1646
1647         dev_size = get_dev_size(bdev);
1648
1649         src.bdev = bdev;
1650         src.sector = chunk_to_sector(s->store, pe->e.old_chunk);
1651         src.count = min((sector_t)s->store->chunk_size, dev_size - src.sector);
1652
1653         dest.bdev = s->cow->bdev;
1654         dest.sector = chunk_to_sector(s->store, pe->e.new_chunk);
1655         dest.count = src.count;
1656
1657         /* Hand over to kcopyd */
1658         account_start_copy(s);
1659         dm_kcopyd_copy(s->kcopyd_client, &src, 1, &dest, 0, copy_callback, pe);
1660 }
1661
1662 static void full_bio_end_io(struct bio *bio)
1663 {
1664         void *callback_data = bio->bi_private;
1665
1666         dm_kcopyd_do_callback(callback_data, 0, bio->bi_error ? 1 : 0);
1667 }
1668
1669 static void start_full_bio(struct dm_snap_pending_exception *pe,
1670                            struct bio *bio)
1671 {
1672         struct dm_snapshot *s = pe->snap;
1673         void *callback_data;
1674
1675         pe->full_bio = bio;
1676         pe->full_bio_end_io = bio->bi_end_io;
1677         pe->full_bio_private = bio->bi_private;
1678
1679         account_start_copy(s);
1680         callback_data = dm_kcopyd_prepare_callback(s->kcopyd_client,
1681                                                    copy_callback, pe);
1682
1683         bio->bi_end_io = full_bio_end_io;
1684         bio->bi_private = callback_data;
1685
1686         generic_make_request(bio);
1687 }
1688
1689 static struct dm_snap_pending_exception *
1690 __lookup_pending_exception(struct dm_snapshot *s, chunk_t chunk)
1691 {
1692         struct dm_exception *e = dm_lookup_exception(&s->pending, chunk);
1693
1694         if (!e)
1695                 return NULL;
1696
1697         return container_of(e, struct dm_snap_pending_exception, e);
1698 }
1699
1700 /*
1701  * Looks to see if this snapshot already has a pending exception
1702  * for this chunk, otherwise it allocates a new one and inserts
1703  * it into the pending table.
1704  *
1705  * NOTE: a write lock must be held on snap->lock before calling
1706  * this.
1707  */
1708 static struct dm_snap_pending_exception *
1709 __find_pending_exception(struct dm_snapshot *s,
1710                          struct dm_snap_pending_exception *pe, chunk_t chunk)
1711 {
1712         struct dm_snap_pending_exception *pe2;
1713
1714         pe2 = __lookup_pending_exception(s, chunk);
1715         if (pe2) {
1716                 free_pending_exception(pe);
1717                 return pe2;
1718         }
1719
1720         pe->e.old_chunk = chunk;
1721         bio_list_init(&pe->origin_bios);
1722         bio_list_init(&pe->snapshot_bios);
1723         pe->started = 0;
1724         pe->full_bio = NULL;
1725
1726         if (s->store->type->prepare_exception(s->store, &pe->e)) {
1727                 free_pending_exception(pe);
1728                 return NULL;
1729         }
1730
1731         pe->exception_sequence = s->exception_start_sequence++;
1732
1733         dm_insert_exception(&s->pending, &pe->e);
1734
1735         return pe;
1736 }
1737
1738 static void remap_exception(struct dm_snapshot *s, struct dm_exception *e,
1739                             struct bio *bio, chunk_t chunk)
1740 {
1741         bio->bi_bdev = s->cow->bdev;
1742         bio->bi_iter.bi_sector =
1743                 chunk_to_sector(s->store, dm_chunk_number(e->new_chunk) +
1744                                 (chunk - e->old_chunk)) +
1745                 (bio->bi_iter.bi_sector & s->store->chunk_mask);
1746 }
1747
1748 static int snapshot_map(struct dm_target *ti, struct bio *bio)
1749 {
1750         struct dm_exception *e;
1751         struct dm_snapshot *s = ti->private;
1752         int r = DM_MAPIO_REMAPPED;
1753         chunk_t chunk;
1754         struct dm_snap_pending_exception *pe = NULL;
1755
1756         init_tracked_chunk(bio);
1757
1758         if (bio->bi_rw & REQ_FLUSH) {
1759                 bio->bi_bdev = s->cow->bdev;
1760                 return DM_MAPIO_REMAPPED;
1761         }
1762
1763         chunk = sector_to_chunk(s->store, bio->bi_iter.bi_sector);
1764
1765         /* Full snapshots are not usable */
1766         /* To get here the table must be live so s->active is always set. */
1767         if (!s->valid)
1768                 return -EIO;
1769
1770         if (bio_data_dir(bio) == WRITE) {
1771                 while (unlikely(!wait_for_in_progress(s, false)))
1772                         ; /* wait_for_in_progress() has slept */
1773         }
1774
1775         mutex_lock(&s->lock);
1776
1777         if (!s->valid || (unlikely(s->snapshot_overflowed) && bio_rw(bio) == WRITE)) {
1778                 r = -EIO;
1779                 goto out_unlock;
1780         }
1781
1782         /* If the block is already remapped - use that, else remap it */
1783         e = dm_lookup_exception(&s->complete, chunk);
1784         if (e) {
1785                 remap_exception(s, e, bio, chunk);
1786                 goto out_unlock;
1787         }
1788
1789         /*
1790          * Write to snapshot - higher level takes care of RW/RO
1791          * flags so we should only get this if we are
1792          * writeable.
1793          */
1794         if (bio_rw(bio) == WRITE) {
1795                 pe = __lookup_pending_exception(s, chunk);
1796                 if (!pe) {
1797                         mutex_unlock(&s->lock);
1798                         pe = alloc_pending_exception(s);
1799                         mutex_lock(&s->lock);
1800
1801                         if (!s->valid || s->snapshot_overflowed) {
1802                                 free_pending_exception(pe);
1803                                 r = -EIO;
1804                                 goto out_unlock;
1805                         }
1806
1807                         e = dm_lookup_exception(&s->complete, chunk);
1808                         if (e) {
1809                                 free_pending_exception(pe);
1810                                 remap_exception(s, e, bio, chunk);
1811                                 goto out_unlock;
1812                         }
1813
1814                         pe = __find_pending_exception(s, pe, chunk);
1815                         if (!pe) {
1816                                 if (s->store->userspace_supports_overflow) {
1817                                         s->snapshot_overflowed = 1;
1818                                         DMERR("Snapshot overflowed: Unable to allocate exception.");
1819                                 } else
1820                                         __invalidate_snapshot(s, -ENOMEM);
1821                                 r = -EIO;
1822                                 goto out_unlock;
1823                         }
1824                 }
1825
1826                 remap_exception(s, &pe->e, bio, chunk);
1827
1828                 r = DM_MAPIO_SUBMITTED;
1829
1830                 if (!pe->started &&
1831                     bio->bi_iter.bi_size ==
1832                     (s->store->chunk_size << SECTOR_SHIFT)) {
1833                         pe->started = 1;
1834                         mutex_unlock(&s->lock);
1835                         start_full_bio(pe, bio);
1836                         goto out;
1837                 }
1838
1839                 bio_list_add(&pe->snapshot_bios, bio);
1840
1841                 if (!pe->started) {
1842                         /* this is protected by snap->lock */
1843                         pe->started = 1;
1844                         mutex_unlock(&s->lock);
1845                         start_copy(pe);
1846                         goto out;
1847                 }
1848         } else {
1849                 bio->bi_bdev = s->origin->bdev;
1850                 track_chunk(s, bio, chunk);
1851         }
1852
1853 out_unlock:
1854         mutex_unlock(&s->lock);
1855 out:
1856         return r;
1857 }
1858
1859 /*
1860  * A snapshot-merge target behaves like a combination of a snapshot
1861  * target and a snapshot-origin target.  It only generates new
1862  * exceptions in other snapshots and not in the one that is being
1863  * merged.
1864  *
1865  * For each chunk, if there is an existing exception, it is used to
1866  * redirect I/O to the cow device.  Otherwise I/O is sent to the origin,
1867  * which in turn might generate exceptions in other snapshots.
1868  * If merging is currently taking place on the chunk in question, the
1869  * I/O is deferred by adding it to s->bios_queued_during_merge.
1870  */
1871 static int snapshot_merge_map(struct dm_target *ti, struct bio *bio)
1872 {
1873         struct dm_exception *e;
1874         struct dm_snapshot *s = ti->private;
1875         int r = DM_MAPIO_REMAPPED;
1876         chunk_t chunk;
1877
1878         init_tracked_chunk(bio);
1879
1880         if (bio->bi_rw & REQ_FLUSH) {
1881                 if (!dm_bio_get_target_bio_nr(bio))
1882                         bio->bi_bdev = s->origin->bdev;
1883                 else
1884                         bio->bi_bdev = s->cow->bdev;
1885                 return DM_MAPIO_REMAPPED;
1886         }
1887
1888         chunk = sector_to_chunk(s->store, bio->bi_iter.bi_sector);
1889
1890         mutex_lock(&s->lock);
1891
1892         /* Full merging snapshots are redirected to the origin */
1893         if (!s->valid)
1894                 goto redirect_to_origin;
1895
1896         /* If the block is already remapped - use that */
1897         e = dm_lookup_exception(&s->complete, chunk);
1898         if (e) {
1899                 /* Queue writes overlapping with chunks being merged */
1900                 if (bio_rw(bio) == WRITE &&
1901                     chunk >= s->first_merging_chunk &&
1902                     chunk < (s->first_merging_chunk +
1903                              s->num_merging_chunks)) {
1904                         bio->bi_bdev = s->origin->bdev;
1905                         bio_list_add(&s->bios_queued_during_merge, bio);
1906                         r = DM_MAPIO_SUBMITTED;
1907                         goto out_unlock;
1908                 }
1909
1910                 remap_exception(s, e, bio, chunk);
1911
1912                 if (bio_rw(bio) == WRITE)
1913                         track_chunk(s, bio, chunk);
1914                 goto out_unlock;
1915         }
1916
1917 redirect_to_origin:
1918         bio->bi_bdev = s->origin->bdev;
1919
1920         if (bio_rw(bio) == WRITE) {
1921                 mutex_unlock(&s->lock);
1922                 return do_origin(s->origin, bio, false);
1923         }
1924
1925 out_unlock:
1926         mutex_unlock(&s->lock);
1927
1928         return r;
1929 }
1930
1931 static int snapshot_end_io(struct dm_target *ti, struct bio *bio, int error)
1932 {
1933         struct dm_snapshot *s = ti->private;
1934
1935         if (is_bio_tracked(bio))
1936                 stop_tracking_chunk(s, bio);
1937
1938         return 0;
1939 }
1940
1941 static void snapshot_merge_presuspend(struct dm_target *ti)
1942 {
1943         struct dm_snapshot *s = ti->private;
1944
1945         stop_merge(s);
1946 }
1947
1948 static int snapshot_preresume(struct dm_target *ti)
1949 {
1950         int r = 0;
1951         struct dm_snapshot *s = ti->private;
1952         struct dm_snapshot *snap_src = NULL, *snap_dest = NULL;
1953
1954         down_read(&_origins_lock);
1955         (void) __find_snapshots_sharing_cow(s, &snap_src, &snap_dest, NULL);
1956         if (snap_src && snap_dest) {
1957                 mutex_lock(&snap_src->lock);
1958                 if (s == snap_src) {
1959                         DMERR("Unable to resume snapshot source until "
1960                               "handover completes.");
1961                         r = -EINVAL;
1962                 } else if (!dm_suspended(snap_src->ti)) {
1963                         DMERR("Unable to perform snapshot handover until "
1964                               "source is suspended.");
1965                         r = -EINVAL;
1966                 }
1967                 mutex_unlock(&snap_src->lock);
1968         }
1969         up_read(&_origins_lock);
1970
1971         return r;
1972 }
1973
1974 static void snapshot_resume(struct dm_target *ti)
1975 {
1976         struct dm_snapshot *s = ti->private;
1977         struct dm_snapshot *snap_src = NULL, *snap_dest = NULL, *snap_merging = NULL;
1978         struct dm_origin *o;
1979         struct mapped_device *origin_md = NULL;
1980         bool must_restart_merging = false;
1981
1982         down_read(&_origins_lock);
1983
1984         o = __lookup_dm_origin(s->origin->bdev);
1985         if (o)
1986                 origin_md = dm_table_get_md(o->ti->table);
1987         if (!origin_md) {
1988                 (void) __find_snapshots_sharing_cow(s, NULL, NULL, &snap_merging);
1989                 if (snap_merging)
1990                         origin_md = dm_table_get_md(snap_merging->ti->table);
1991         }
1992         if (origin_md == dm_table_get_md(ti->table))
1993                 origin_md = NULL;
1994         if (origin_md) {
1995                 if (dm_hold(origin_md))
1996                         origin_md = NULL;
1997         }
1998
1999         up_read(&_origins_lock);
2000
2001         if (origin_md) {
2002                 dm_internal_suspend_fast(origin_md);
2003                 if (snap_merging && test_bit(RUNNING_MERGE, &snap_merging->state_bits)) {
2004                         must_restart_merging = true;
2005                         stop_merge(snap_merging);
2006                 }
2007         }
2008
2009         down_read(&_origins_lock);
2010
2011         (void) __find_snapshots_sharing_cow(s, &snap_src, &snap_dest, NULL);
2012         if (snap_src && snap_dest) {
2013                 mutex_lock(&snap_src->lock);
2014                 mutex_lock_nested(&snap_dest->lock, SINGLE_DEPTH_NESTING);
2015                 __handover_exceptions(snap_src, snap_dest);
2016                 mutex_unlock(&snap_dest->lock);
2017                 mutex_unlock(&snap_src->lock);
2018         }
2019
2020         up_read(&_origins_lock);
2021
2022         if (origin_md) {
2023                 if (must_restart_merging)
2024                         start_merge(snap_merging);
2025                 dm_internal_resume_fast(origin_md);
2026                 dm_put(origin_md);
2027         }
2028
2029         /* Now we have correct chunk size, reregister */
2030         reregister_snapshot(s);
2031
2032         mutex_lock(&s->lock);
2033         s->active = 1;
2034         mutex_unlock(&s->lock);
2035 }
2036
2037 static uint32_t get_origin_minimum_chunksize(struct block_device *bdev)
2038 {
2039         uint32_t min_chunksize;
2040
2041         down_read(&_origins_lock);
2042         min_chunksize = __minimum_chunk_size(__lookup_origin(bdev));
2043         up_read(&_origins_lock);
2044
2045         return min_chunksize;
2046 }
2047
2048 static void snapshot_merge_resume(struct dm_target *ti)
2049 {
2050         struct dm_snapshot *s = ti->private;
2051
2052         /*
2053          * Handover exceptions from existing snapshot.
2054          */
2055         snapshot_resume(ti);
2056
2057         /*
2058          * snapshot-merge acts as an origin, so set ti->max_io_len
2059          */
2060         ti->max_io_len = get_origin_minimum_chunksize(s->origin->bdev);
2061
2062         start_merge(s);
2063 }
2064
2065 static void snapshot_status(struct dm_target *ti, status_type_t type,
2066                             unsigned status_flags, char *result, unsigned maxlen)
2067 {
2068         unsigned sz = 0;
2069         struct dm_snapshot *snap = ti->private;
2070
2071         switch (type) {
2072         case STATUSTYPE_INFO:
2073
2074                 mutex_lock(&snap->lock);
2075
2076                 if (!snap->valid)
2077                         DMEMIT("Invalid");
2078                 else if (snap->merge_failed)
2079                         DMEMIT("Merge failed");
2080                 else if (snap->snapshot_overflowed)
2081                         DMEMIT("Overflow");
2082                 else {
2083                         if (snap->store->type->usage) {
2084                                 sector_t total_sectors, sectors_allocated,
2085                                          metadata_sectors;
2086                                 snap->store->type->usage(snap->store,
2087                                                          &total_sectors,
2088                                                          &sectors_allocated,
2089                                                          &metadata_sectors);
2090                                 DMEMIT("%llu/%llu %llu",
2091                                        (unsigned long long)sectors_allocated,
2092                                        (unsigned long long)total_sectors,
2093                                        (unsigned long long)metadata_sectors);
2094                         }
2095                         else
2096                                 DMEMIT("Unknown");
2097                 }
2098
2099                 mutex_unlock(&snap->lock);
2100
2101                 break;
2102
2103         case STATUSTYPE_TABLE:
2104                 /*
2105                  * kdevname returns a static pointer so we need
2106                  * to make private copies if the output is to
2107                  * make sense.
2108                  */
2109                 DMEMIT("%s %s", snap->origin->name, snap->cow->name);
2110                 snap->store->type->status(snap->store, type, result + sz,
2111                                           maxlen - sz);
2112                 break;
2113         }
2114 }
2115
2116 static int snapshot_iterate_devices(struct dm_target *ti,
2117                                     iterate_devices_callout_fn fn, void *data)
2118 {
2119         struct dm_snapshot *snap = ti->private;
2120         int r;
2121
2122         r = fn(ti, snap->origin, 0, ti->len, data);
2123
2124         if (!r)
2125                 r = fn(ti, snap->cow, 0, get_dev_size(snap->cow->bdev), data);
2126
2127         return r;
2128 }
2129
2130
2131 /*-----------------------------------------------------------------
2132  * Origin methods
2133  *---------------------------------------------------------------*/
2134
2135 /*
2136  * If no exceptions need creating, DM_MAPIO_REMAPPED is returned and any
2137  * supplied bio was ignored.  The caller may submit it immediately.
2138  * (No remapping actually occurs as the origin is always a direct linear
2139  * map.)
2140  *
2141  * If further exceptions are required, DM_MAPIO_SUBMITTED is returned
2142  * and any supplied bio is added to a list to be submitted once all
2143  * the necessary exceptions exist.
2144  */
2145 static int __origin_write(struct list_head *snapshots, sector_t sector,
2146                           struct bio *bio)
2147 {
2148         int r = DM_MAPIO_REMAPPED;
2149         struct dm_snapshot *snap;
2150         struct dm_exception *e;
2151         struct dm_snap_pending_exception *pe;
2152         struct dm_snap_pending_exception *pe_to_start_now = NULL;
2153         struct dm_snap_pending_exception *pe_to_start_last = NULL;
2154         chunk_t chunk;
2155
2156         /* Do all the snapshots on this origin */
2157         list_for_each_entry (snap, snapshots, list) {
2158                 /*
2159                  * Don't make new exceptions in a merging snapshot
2160                  * because it has effectively been deleted
2161                  */
2162                 if (dm_target_is_snapshot_merge(snap->ti))
2163                         continue;
2164
2165                 mutex_lock(&snap->lock);
2166
2167                 /* Only deal with valid and active snapshots */
2168                 if (!snap->valid || !snap->active)
2169                         goto next_snapshot;
2170
2171                 /* Nothing to do if writing beyond end of snapshot */
2172                 if (sector >= dm_table_get_size(snap->ti->table))
2173                         goto next_snapshot;
2174
2175                 /*
2176                  * Remember, different snapshots can have
2177                  * different chunk sizes.
2178                  */
2179                 chunk = sector_to_chunk(snap->store, sector);
2180
2181                 /*
2182                  * Check exception table to see if block
2183                  * is already remapped in this snapshot
2184                  * and trigger an exception if not.
2185                  */
2186                 e = dm_lookup_exception(&snap->complete, chunk);
2187                 if (e)
2188                         goto next_snapshot;
2189
2190                 pe = __lookup_pending_exception(snap, chunk);
2191                 if (!pe) {
2192                         mutex_unlock(&snap->lock);
2193                         pe = alloc_pending_exception(snap);
2194                         mutex_lock(&snap->lock);
2195
2196                         if (!snap->valid) {
2197                                 free_pending_exception(pe);
2198                                 goto next_snapshot;
2199                         }
2200
2201                         e = dm_lookup_exception(&snap->complete, chunk);
2202                         if (e) {
2203                                 free_pending_exception(pe);
2204                                 goto next_snapshot;
2205                         }
2206
2207                         pe = __find_pending_exception(snap, pe, chunk);
2208                         if (!pe) {
2209                                 __invalidate_snapshot(snap, -ENOMEM);
2210                                 goto next_snapshot;
2211                         }
2212                 }
2213
2214                 r = DM_MAPIO_SUBMITTED;
2215
2216                 /*
2217                  * If an origin bio was supplied, queue it to wait for the
2218                  * completion of this exception, and start this one last,
2219                  * at the end of the function.
2220                  */
2221                 if (bio) {
2222                         bio_list_add(&pe->origin_bios, bio);
2223                         bio = NULL;
2224
2225                         if (!pe->started) {
2226                                 pe->started = 1;
2227                                 pe_to_start_last = pe;
2228                         }
2229                 }
2230
2231                 if (!pe->started) {
2232                         pe->started = 1;
2233                         pe_to_start_now = pe;
2234                 }
2235
2236 next_snapshot:
2237                 mutex_unlock(&snap->lock);
2238
2239                 if (pe_to_start_now) {
2240                         start_copy(pe_to_start_now);
2241                         pe_to_start_now = NULL;
2242                 }
2243         }
2244
2245         /*
2246          * Submit the exception against which the bio is queued last,
2247          * to give the other exceptions a head start.
2248          */
2249         if (pe_to_start_last)
2250                 start_copy(pe_to_start_last);
2251
2252         return r;
2253 }
2254
2255 /*
2256  * Called on a write from the origin driver.
2257  */
2258 static int do_origin(struct dm_dev *origin, struct bio *bio, bool limit)
2259 {
2260         struct origin *o;
2261         int r = DM_MAPIO_REMAPPED;
2262
2263 again:
2264         down_read(&_origins_lock);
2265         o = __lookup_origin(origin->bdev);
2266         if (o) {
2267                 if (limit) {
2268                         struct dm_snapshot *s;
2269                         list_for_each_entry(s, &o->snapshots, list)
2270                                 if (unlikely(!wait_for_in_progress(s, true)))
2271                                         goto again;
2272                 }
2273
2274                 r = __origin_write(&o->snapshots, bio->bi_iter.bi_sector, bio);
2275         }
2276         up_read(&_origins_lock);
2277
2278         return r;
2279 }
2280
2281 /*
2282  * Trigger exceptions in all non-merging snapshots.
2283  *
2284  * The chunk size of the merging snapshot may be larger than the chunk
2285  * size of some other snapshot so we may need to reallocate multiple
2286  * chunks in other snapshots.
2287  *
2288  * We scan all the overlapping exceptions in the other snapshots.
2289  * Returns 1 if anything was reallocated and must be waited for,
2290  * otherwise returns 0.
2291  *
2292  * size must be a multiple of merging_snap's chunk_size.
2293  */
2294 static int origin_write_extent(struct dm_snapshot *merging_snap,
2295                                sector_t sector, unsigned size)
2296 {
2297         int must_wait = 0;
2298         sector_t n;
2299         struct origin *o;
2300
2301         /*
2302          * The origin's __minimum_chunk_size() got stored in max_io_len
2303          * by snapshot_merge_resume().
2304          */
2305         down_read(&_origins_lock);
2306         o = __lookup_origin(merging_snap->origin->bdev);
2307         for (n = 0; n < size; n += merging_snap->ti->max_io_len)
2308                 if (__origin_write(&o->snapshots, sector + n, NULL) ==
2309                     DM_MAPIO_SUBMITTED)
2310                         must_wait = 1;
2311         up_read(&_origins_lock);
2312
2313         return must_wait;
2314 }
2315
2316 /*
2317  * Origin: maps a linear range of a device, with hooks for snapshotting.
2318  */
2319
2320 /*
2321  * Construct an origin mapping: <dev_path>
2322  * The context for an origin is merely a 'struct dm_dev *'
2323  * pointing to the real device.
2324  */
2325 static int origin_ctr(struct dm_target *ti, unsigned int argc, char **argv)
2326 {
2327         int r;
2328         struct dm_origin *o;
2329
2330         if (argc != 1) {
2331                 ti->error = "origin: incorrect number of arguments";
2332                 return -EINVAL;
2333         }
2334
2335         o = kmalloc(sizeof(struct dm_origin), GFP_KERNEL);
2336         if (!o) {
2337                 ti->error = "Cannot allocate private origin structure";
2338                 r = -ENOMEM;
2339                 goto bad_alloc;
2340         }
2341
2342         r = dm_get_device(ti, argv[0], dm_table_get_mode(ti->table), &o->dev);
2343         if (r) {
2344                 ti->error = "Cannot get target device";
2345                 goto bad_open;
2346         }
2347
2348         o->ti = ti;
2349         ti->private = o;
2350         ti->num_flush_bios = 1;
2351
2352         return 0;
2353
2354 bad_open:
2355         kfree(o);
2356 bad_alloc:
2357         return r;
2358 }
2359
2360 static void origin_dtr(struct dm_target *ti)
2361 {
2362         struct dm_origin *o = ti->private;
2363
2364         dm_put_device(ti, o->dev);
2365         kfree(o);
2366 }
2367
2368 static int origin_map(struct dm_target *ti, struct bio *bio)
2369 {
2370         struct dm_origin *o = ti->private;
2371         unsigned available_sectors;
2372
2373         bio->bi_bdev = o->dev->bdev;
2374
2375         if (unlikely(bio->bi_rw & REQ_FLUSH))
2376                 return DM_MAPIO_REMAPPED;
2377
2378         if (bio_rw(bio) != WRITE)
2379                 return DM_MAPIO_REMAPPED;
2380
2381         available_sectors = o->split_boundary -
2382                 ((unsigned)bio->bi_iter.bi_sector & (o->split_boundary - 1));
2383
2384         if (bio_sectors(bio) > available_sectors)
2385                 dm_accept_partial_bio(bio, available_sectors);
2386
2387         /* Only tell snapshots if this is a write */
2388         return do_origin(o->dev, bio, true);
2389 }
2390
2391 /*
2392  * Set the target "max_io_len" field to the minimum of all the snapshots'
2393  * chunk sizes.
2394  */
2395 static void origin_resume(struct dm_target *ti)
2396 {
2397         struct dm_origin *o = ti->private;
2398
2399         o->split_boundary = get_origin_minimum_chunksize(o->dev->bdev);
2400
2401         down_write(&_origins_lock);
2402         __insert_dm_origin(o);
2403         up_write(&_origins_lock);
2404 }
2405
2406 static void origin_postsuspend(struct dm_target *ti)
2407 {
2408         struct dm_origin *o = ti->private;
2409
2410         down_write(&_origins_lock);
2411         __remove_dm_origin(o);
2412         up_write(&_origins_lock);
2413 }
2414
2415 static void origin_status(struct dm_target *ti, status_type_t type,
2416                           unsigned status_flags, char *result, unsigned maxlen)
2417 {
2418         struct dm_origin *o = ti->private;
2419
2420         switch (type) {
2421         case STATUSTYPE_INFO:
2422                 result[0] = '\0';
2423                 break;
2424
2425         case STATUSTYPE_TABLE:
2426                 snprintf(result, maxlen, "%s", o->dev->name);
2427                 break;
2428         }
2429 }
2430
2431 static int origin_iterate_devices(struct dm_target *ti,
2432                                   iterate_devices_callout_fn fn, void *data)
2433 {
2434         struct dm_origin *o = ti->private;
2435
2436         return fn(ti, o->dev, 0, ti->len, data);
2437 }
2438
2439 static struct target_type origin_target = {
2440         .name    = "snapshot-origin",
2441         .version = {1, 9, 0},
2442         .module  = THIS_MODULE,
2443         .ctr     = origin_ctr,
2444         .dtr     = origin_dtr,
2445         .map     = origin_map,
2446         .resume  = origin_resume,
2447         .postsuspend = origin_postsuspend,
2448         .status  = origin_status,
2449         .iterate_devices = origin_iterate_devices,
2450 };
2451
2452 static struct target_type snapshot_target = {
2453         .name    = "snapshot",
2454         .version = {1, 15, 0},
2455         .module  = THIS_MODULE,
2456         .ctr     = snapshot_ctr,
2457         .dtr     = snapshot_dtr,
2458         .map     = snapshot_map,
2459         .end_io  = snapshot_end_io,
2460         .preresume  = snapshot_preresume,
2461         .resume  = snapshot_resume,
2462         .status  = snapshot_status,
2463         .iterate_devices = snapshot_iterate_devices,
2464 };
2465
2466 static struct target_type merge_target = {
2467         .name    = dm_snapshot_merge_target_name,
2468         .version = {1, 4, 0},
2469         .module  = THIS_MODULE,
2470         .ctr     = snapshot_ctr,
2471         .dtr     = snapshot_dtr,
2472         .map     = snapshot_merge_map,
2473         .end_io  = snapshot_end_io,
2474         .presuspend = snapshot_merge_presuspend,
2475         .preresume  = snapshot_preresume,
2476         .resume  = snapshot_merge_resume,
2477         .status  = snapshot_status,
2478         .iterate_devices = snapshot_iterate_devices,
2479 };
2480
2481 static int __init dm_snapshot_init(void)
2482 {
2483         int r;
2484
2485         r = dm_exception_store_init();
2486         if (r) {
2487                 DMERR("Failed to initialize exception stores");
2488                 return r;
2489         }
2490
2491         r = dm_register_target(&snapshot_target);
2492         if (r < 0) {
2493                 DMERR("snapshot target register failed %d", r);
2494                 goto bad_register_snapshot_target;
2495         }
2496
2497         r = dm_register_target(&origin_target);
2498         if (r < 0) {
2499                 DMERR("Origin target register failed %d", r);
2500                 goto bad_register_origin_target;
2501         }
2502
2503         r = dm_register_target(&merge_target);
2504         if (r < 0) {
2505                 DMERR("Merge target register failed %d", r);
2506                 goto bad_register_merge_target;
2507         }
2508
2509         r = init_origin_hash();
2510         if (r) {
2511                 DMERR("init_origin_hash failed.");
2512                 goto bad_origin_hash;
2513         }
2514
2515         exception_cache = KMEM_CACHE(dm_exception, 0);
2516         if (!exception_cache) {
2517                 DMERR("Couldn't create exception cache.");
2518                 r = -ENOMEM;
2519                 goto bad_exception_cache;
2520         }
2521
2522         pending_cache = KMEM_CACHE(dm_snap_pending_exception, 0);
2523         if (!pending_cache) {
2524                 DMERR("Couldn't create pending cache.");
2525                 r = -ENOMEM;
2526                 goto bad_pending_cache;
2527         }
2528
2529         return 0;
2530
2531 bad_pending_cache:
2532         kmem_cache_destroy(exception_cache);
2533 bad_exception_cache:
2534         exit_origin_hash();
2535 bad_origin_hash:
2536         dm_unregister_target(&merge_target);
2537 bad_register_merge_target:
2538         dm_unregister_target(&origin_target);
2539 bad_register_origin_target:
2540         dm_unregister_target(&snapshot_target);
2541 bad_register_snapshot_target:
2542         dm_exception_store_exit();
2543
2544         return r;
2545 }
2546
2547 static void __exit dm_snapshot_exit(void)
2548 {
2549         dm_unregister_target(&snapshot_target);
2550         dm_unregister_target(&origin_target);
2551         dm_unregister_target(&merge_target);
2552
2553         exit_origin_hash();
2554         kmem_cache_destroy(pending_cache);
2555         kmem_cache_destroy(exception_cache);
2556
2557         dm_exception_store_exit();
2558 }
2559
2560 /* Module hooks */
2561 module_init(dm_snapshot_init);
2562 module_exit(dm_snapshot_exit);
2563
2564 MODULE_DESCRIPTION(DM_NAME " snapshot target");
2565 MODULE_AUTHOR("Joe Thornber");
2566 MODULE_LICENSE("GPL");
2567 MODULE_ALIAS("dm-snapshot-origin");
2568 MODULE_ALIAS("dm-snapshot-merge");