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