dm-thin.c 68.1 KB
Newer Older
1
/*
2
 * Copyright (C) 2011-2012 Red Hat UK.
3
4
5
6
7
 *
 * This file is released under the GPL.
 */

#include "dm-thin-metadata.h"
8
#include "dm-bio-prison.h"
9
#include "dm.h"
10
11
12
13
14
15
16
17
18
19
20
21
22
23

#include <linux/device-mapper.h>
#include <linux/dm-io.h>
#include <linux/dm-kcopyd.h>
#include <linux/list.h>
#include <linux/init.h>
#include <linux/module.h>
#include <linux/slab.h>

#define	DM_MSG_PREFIX	"thin"

/*
 * Tunable constants
 */
24
#define ENDIO_HOOK_POOL_SIZE 1024
25
26
#define MAPPING_POOL_SIZE 1024
#define PRISON_CELLS 1024
27
#define COMMIT_PERIOD HZ
28

29
30
31
DECLARE_DM_KCOPYD_THROTTLE_WITH_MODULE_PARM(snapshot_copy_throttle,
		"A percentage of time allocated for copy on write");

32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/*
 * The block size of the device holding pool data must be
 * between 64KB and 1GB.
 */
#define DATA_DEV_BLOCK_SIZE_MIN_SECTORS (64 * 1024 >> SECTOR_SHIFT)
#define DATA_DEV_BLOCK_SIZE_MAX_SECTORS (1024 * 1024 * 1024 >> SECTOR_SHIFT)

/*
 * Device id is restricted to 24 bits.
 */
#define MAX_DEV_ID ((1 << 24) - 1)

/*
 * How do we handle breaking sharing of data blocks?
 * =================================================
 *
 * We use a standard copy-on-write btree to store the mappings for the
 * devices (note I'm talking about copy-on-write of the metadata here, not
 * the data).  When you take an internal snapshot you clone the root node
 * of the origin btree.  After this there is no concept of an origin or a
 * snapshot.  They are just two device trees that happen to point to the
 * same data blocks.
 *
 * When we get a write in we decide if it's to a shared data block using
 * some timestamp magic.  If it is, we have to break sharing.
 *
 * Let's say we write to a shared block in what was the origin.  The
 * steps are:
 *
 * i) plug io further to this physical block. (see bio_prison code).
 *
 * ii) quiesce any read io to that shared data block.  Obviously
64
 * including all devices that share this block.  (see dm_deferred_set code)
65
66
67
68
69
 *
 * iii) copy the data block to a newly allocate block.  This step can be
 * missed out if the io covers the block. (schedule_copy).
 *
 * iv) insert the new mapping into the origin's btree
Joe Thornber's avatar
Joe Thornber committed
70
 * (process_prepared_mapping).  This act of inserting breaks some
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
 * sharing of btree nodes between the two devices.  Breaking sharing only
 * effects the btree of that specific device.  Btrees for the other
 * devices that share the block never change.  The btree for the origin
 * device as it was after the last commit is untouched, ie. we're using
 * persistent data structures in the functional programming sense.
 *
 * v) unplug io to this physical block, including the io that triggered
 * the breaking of sharing.
 *
 * Steps (ii) and (iii) occur in parallel.
 *
 * The metadata _doesn't_ need to be committed before the io continues.  We
 * get away with this because the io is always written to a _new_ block.
 * If there's a crash, then:
 *
 * - The origin mapping will point to the old origin block (the shared
 * one).  This will contain the data as it was before the io that triggered
 * the breaking of sharing came in.
 *
 * - The snap mapping still points to the old block.  As it would after
 * the commit.
 *
 * The downside of this scheme is the timestamp magic isn't perfect, and
 * will continue to think that data block in the snapshot device is shared
 * even after the write to the origin has broken sharing.  I suspect data
 * blocks will typically be shared by many different devices, so we're
 * breaking sharing n + 1 times, rather than n, where n is the number of
 * devices that reference this data block.  At the moment I think the
 * benefits far, far outweigh the disadvantages.
 */

/*----------------------------------------------------------------*/

/*
 * Key building.
 */
static void build_data_key(struct dm_thin_device *td,
108
			   dm_block_t b, struct dm_cell_key *key)
109
110
111
112
113
114
115
{
	key->virtual = 0;
	key->dev = dm_thin_dev_id(td);
	key->block = b;
}

static void build_virtual_key(struct dm_thin_device *td, dm_block_t b,
116
			      struct dm_cell_key *key)
117
118
119
120
121
122
123
124
125
126
127
128
129
{
	key->virtual = 1;
	key->dev = dm_thin_dev_id(td);
	key->block = b;
}

/*----------------------------------------------------------------*/

/*
 * A pool device ties together a metadata device and a data device.  It
 * also provides the interface for creating and destroying internal
 * devices.
 */
Mike Snitzer's avatar
Mike Snitzer committed
130
struct dm_thin_new_mapping;
131

132
133
134
135
136
137
138
139
140
/*
 * The pool runs in 3 modes.  Ordered in degraded order for comparisons.
 */
enum pool_mode {
	PM_WRITE,		/* metadata may be changed */
	PM_READ_ONLY,		/* metadata may not be changed */
	PM_FAIL,		/* all I/O fails */
};

141
struct pool_features {
142
143
	enum pool_mode mode;

Mike Snitzer's avatar
Mike Snitzer committed
144
145
146
	bool zero_new_blocks:1;
	bool discard_enabled:1;
	bool discard_passdown:1;
147
148
};

149
150
151
152
struct thin_c;
typedef void (*process_bio_fn)(struct thin_c *tc, struct bio *bio);
typedef void (*process_mapping_fn)(struct dm_thin_new_mapping *m);

153
154
155
156
157
158
159
160
161
struct pool {
	struct list_head list;
	struct dm_target *ti;	/* Only set if a pool target is bound */

	struct mapped_device *pool_md;
	struct block_device *md_dev;
	struct dm_pool_metadata *pmd;

	dm_block_t low_water_blocks;
162
	uint32_t sectors_per_block;
163
	int sectors_per_block_shift;
164

165
	struct pool_features pf;
166
167
168
	unsigned low_water_triggered:1;	/* A dm event has been sent */
	unsigned no_free_space:1;	/* A -ENOSPC warning has been issued */

169
	struct dm_bio_prison *prison;
170
171
172
173
	struct dm_kcopyd_client *copier;

	struct workqueue_struct *wq;
	struct work_struct worker;
174
	struct delayed_work waker;
175

176
	unsigned long last_commit_jiffies;
177
	unsigned ref_count;
178
179
180
181
182

	spinlock_t lock;
	struct bio_list deferred_bios;
	struct bio_list deferred_flush_bios;
	struct list_head prepared_mappings;
Joe Thornber's avatar
Joe Thornber committed
183
	struct list_head prepared_discards;
184
185
186

	struct bio_list retry_on_resume_list;

187
188
	struct dm_deferred_set *shared_read_ds;
	struct dm_deferred_set *all_io_ds;
189

Mike Snitzer's avatar
Mike Snitzer committed
190
	struct dm_thin_new_mapping *next_mapping;
191
	mempool_t *mapping_pool;
192
193
194
195
196
197

	process_bio_fn process_bio;
	process_bio_fn process_discard;

	process_mapping_fn process_prepared_mapping;
	process_mapping_fn process_prepared_discard;
198
199
};

200
201
202
static enum pool_mode get_pool_mode(struct pool *pool);
static void set_pool_mode(struct pool *pool, enum pool_mode mode);

203
204
205
206
207
208
209
210
211
212
213
/*
 * Target context for a pool.
 */
struct pool_c {
	struct dm_target *ti;
	struct pool *pool;
	struct dm_dev *data_dev;
	struct dm_dev *metadata_dev;
	struct dm_target_callbacks callbacks;

	dm_block_t low_water_blocks;
214
215
	struct pool_features requested_pf; /* Features requested during table load */
	struct pool_features adjusted_pf;  /* Features used after adjusting for constituent devices */
216
217
218
219
220
221
222
};

/*
 * Target context for a thin.
 */
struct thin_c {
	struct dm_dev *pool_dev;
223
	struct dm_dev *origin_dev;
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
	dm_thin_id dev_id;

	struct pool *pool;
	struct dm_thin_device *td;
};

/*----------------------------------------------------------------*/

/*
 * A global list of pools that uses a struct mapped_device as a key.
 */
static struct dm_thin_pool_table {
	struct mutex mutex;
	struct list_head pools;
} dm_thin_pool_table;

static void pool_table_init(void)
{
	mutex_init(&dm_thin_pool_table.mutex);
	INIT_LIST_HEAD(&dm_thin_pool_table.pools);
}

static void __pool_table_insert(struct pool *pool)
{
	BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex));
	list_add(&pool->list, &dm_thin_pool_table.pools);
}

static void __pool_table_remove(struct pool *pool)
{
	BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex));
	list_del(&pool->list);
}

static struct pool *__pool_table_lookup(struct mapped_device *md)
{
	struct pool *pool = NULL, *tmp;

	BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex));

	list_for_each_entry(tmp, &dm_thin_pool_table.pools, list) {
		if (tmp->pool_md == md) {
			pool = tmp;
			break;
		}
	}

	return pool;
}

static struct pool *__pool_table_lookup_metadata_dev(struct block_device *md_dev)
{
	struct pool *pool = NULL, *tmp;

	BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex));

	list_for_each_entry(tmp, &dm_thin_pool_table.pools, list) {
		if (tmp->md_dev == md_dev) {
			pool = tmp;
			break;
		}
	}

	return pool;
}

/*----------------------------------------------------------------*/

Mike Snitzer's avatar
Mike Snitzer committed
292
struct dm_thin_endio_hook {
293
	struct thin_c *tc;
294
295
	struct dm_deferred_entry *shared_read_entry;
	struct dm_deferred_entry *all_io_entry;
Mike Snitzer's avatar
Mike Snitzer committed
296
	struct dm_thin_new_mapping *overwrite_mapping;
297
298
};

299
300
301
302
303
304
305
306
307
308
static void __requeue_bio_list(struct thin_c *tc, struct bio_list *master)
{
	struct bio *bio;
	struct bio_list bios;

	bio_list_init(&bios);
	bio_list_merge(&bios, master);
	bio_list_init(master);

	while ((bio = bio_list_pop(&bios))) {
309
		struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
Mike Snitzer's avatar
Mike Snitzer committed
310

311
		if (h->tc == tc)
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
			bio_endio(bio, DM_ENDIO_REQUEUE);
		else
			bio_list_add(master, bio);
	}
}

static void requeue_io(struct thin_c *tc)
{
	struct pool *pool = tc->pool;
	unsigned long flags;

	spin_lock_irqsave(&pool->lock, flags);
	__requeue_bio_list(tc, &pool->deferred_bios);
	__requeue_bio_list(tc, &pool->retry_on_resume_list);
	spin_unlock_irqrestore(&pool->lock, flags);
}

/*
 * This section of code contains the logic for processing a thin device's IO.
 * Much of the code depends on pool object resources (lists, workqueues, etc)
 * but most is exclusively called from the thin target rather than the thin-pool
 * target.
 */

336
337
338
339
340
static bool block_size_is_power_of_two(struct pool *pool)
{
	return pool->sectors_per_block_shift >= 0;
}

341
342
static dm_block_t get_bio_block(struct thin_c *tc, struct bio *bio)
{
343
	struct pool *pool = tc->pool;
344
345
	sector_t block_nr = bio->bi_sector;

346
347
	if (block_size_is_power_of_two(pool))
		block_nr >>= pool->sectors_per_block_shift;
348
	else
349
		(void) sector_div(block_nr, pool->sectors_per_block);
350
351

	return block_nr;
352
353
354
355
356
}

static void remap(struct thin_c *tc, struct bio *bio, dm_block_t block)
{
	struct pool *pool = tc->pool;
357
	sector_t bi_sector = bio->bi_sector;
358
359

	bio->bi_bdev = tc->pool_dev->bdev;
360
	if (block_size_is_power_of_two(pool))
361
362
		bio->bi_sector = (block << pool->sectors_per_block_shift) |
				(bi_sector & (pool->sectors_per_block - 1));
363
364
365
	else
		bio->bi_sector = (block * pool->sectors_per_block) +
				 sector_div(bi_sector, pool->sectors_per_block);
366
367
}

368
369
370
371
372
static void remap_to_origin(struct thin_c *tc, struct bio *bio)
{
	bio->bi_bdev = tc->origin_dev->bdev;
}

373
374
375
376
377
378
static int bio_triggers_commit(struct thin_c *tc, struct bio *bio)
{
	return (bio->bi_rw & (REQ_FLUSH | REQ_FUA)) &&
		dm_thin_changed_this_transaction(tc->td);
}

379
380
381
382
383
384
385
static void inc_all_io_entry(struct pool *pool, struct bio *bio)
{
	struct dm_thin_endio_hook *h;

	if (bio->bi_rw & REQ_DISCARD)
		return;

386
	h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
387
388
389
	h->all_io_entry = dm_deferred_entry_inc(pool->all_io_ds);
}

390
static void issue(struct thin_c *tc, struct bio *bio)
391
392
393
394
{
	struct pool *pool = tc->pool;
	unsigned long flags;

395
396
397
398
399
	if (!bio_triggers_commit(tc, bio)) {
		generic_make_request(bio);
		return;
	}

400
	/*
401
402
403
	 * Complete bio with an error if earlier I/O caused changes to
	 * the metadata that can't be committed e.g, due to I/O errors
	 * on the metadata device.
404
	 */
405
406
407
408
409
410
411
412
413
414
415
416
	if (dm_thin_aborted_changes(tc->td)) {
		bio_io_error(bio);
		return;
	}

	/*
	 * Batch together any bios that trigger commits and then issue a
	 * single commit for them in process_deferred_bios().
	 */
	spin_lock_irqsave(&pool->lock, flags);
	bio_list_add(&pool->deferred_flush_bios, bio);
	spin_unlock_irqrestore(&pool->lock, flags);
417
418
}

419
420
421
422
423
424
425
426
427
428
429
430
431
static void remap_to_origin_and_issue(struct thin_c *tc, struct bio *bio)
{
	remap_to_origin(tc, bio);
	issue(tc, bio);
}

static void remap_and_issue(struct thin_c *tc, struct bio *bio,
			    dm_block_t block)
{
	remap(tc, bio, block);
	issue(tc, bio);
}

432
433
434
435
436
437
438
439
440
441
442
443
444
445
/*
 * wake_worker() is used when new work is queued and when pool_resume is
 * ready to continue deferred IO processing.
 */
static void wake_worker(struct pool *pool)
{
	queue_work(pool->wq, &pool->worker);
}

/*----------------------------------------------------------------*/

/*
 * Bio endio functions.
 */
Mike Snitzer's avatar
Mike Snitzer committed
446
struct dm_thin_new_mapping {
447
448
	struct list_head list;

449
450
	unsigned quiesced:1;
	unsigned prepared:1;
Joe Thornber's avatar
Joe Thornber committed
451
	unsigned pass_discard:1;
452
453
454
455

	struct thin_c *tc;
	dm_block_t virt_block;
	dm_block_t data_block;
Mike Snitzer's avatar
Mike Snitzer committed
456
	struct dm_bio_prison_cell *cell, *cell2;
457
458
459
460
461
462
463
464
465
466
467
468
	int err;

	/*
	 * If the bio covers the whole area of a block then we can avoid
	 * zeroing or copying.  Instead this bio is hooked.  The bio will
	 * still be in the cell, so care has to be taken to avoid issuing
	 * the bio twice.
	 */
	struct bio *bio;
	bio_end_io_t *saved_bi_end_io;
};

Mike Snitzer's avatar
Mike Snitzer committed
469
static void __maybe_add_mapping(struct dm_thin_new_mapping *m)
470
471
472
{
	struct pool *pool = m->tc->pool;

473
	if (m->quiesced && m->prepared) {
474
475
476
477
478
479
480
481
		list_add(&m->list, &pool->prepared_mappings);
		wake_worker(pool);
	}
}

static void copy_complete(int read_err, unsigned long write_err, void *context)
{
	unsigned long flags;
Mike Snitzer's avatar
Mike Snitzer committed
482
	struct dm_thin_new_mapping *m = context;
483
484
485
486
487
488
489
490
491
492
493
494
495
	struct pool *pool = m->tc->pool;

	m->err = read_err || write_err ? -EIO : 0;

	spin_lock_irqsave(&pool->lock, flags);
	m->prepared = 1;
	__maybe_add_mapping(m);
	spin_unlock_irqrestore(&pool->lock, flags);
}

static void overwrite_endio(struct bio *bio, int err)
{
	unsigned long flags;
496
	struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
Mike Snitzer's avatar
Mike Snitzer committed
497
	struct dm_thin_new_mapping *m = h->overwrite_mapping;
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
	struct pool *pool = m->tc->pool;

	m->err = err;

	spin_lock_irqsave(&pool->lock, flags);
	m->prepared = 1;
	__maybe_add_mapping(m);
	spin_unlock_irqrestore(&pool->lock, flags);
}

/*----------------------------------------------------------------*/

/*
 * Workqueue.
 */

/*
 * Prepared mapping jobs.
 */

/*
 * This sends the bios in the cell back to the deferred_bios list.
 */
Joe Thornber's avatar
Joe Thornber committed
521
static void cell_defer(struct thin_c *tc, struct dm_bio_prison_cell *cell)
522
523
524
525
526
{
	struct pool *pool = tc->pool;
	unsigned long flags;

	spin_lock_irqsave(&pool->lock, flags);
527
	dm_cell_release(cell, &pool->deferred_bios);
528
529
530
531
532
533
	spin_unlock_irqrestore(&tc->pool->lock, flags);

	wake_worker(pool);
}

/*
534
 * Same as cell_defer except it omits the original holder of the cell.
535
 */
536
static void cell_defer_no_holder(struct thin_c *tc, struct dm_bio_prison_cell *cell)
537
538
539
540
541
{
	struct pool *pool = tc->pool;
	unsigned long flags;

	spin_lock_irqsave(&pool->lock, flags);
542
	dm_cell_release_no_holder(cell, &pool->deferred_bios);
543
544
545
546
547
	spin_unlock_irqrestore(&pool->lock, flags);

	wake_worker(pool);
}

548
549
550
551
static void process_prepared_mapping_fail(struct dm_thin_new_mapping *m)
{
	if (m->bio)
		m->bio->bi_end_io = m->saved_bi_end_io;
552
	dm_cell_error(m->cell);
553
554
555
	list_del(&m->list);
	mempool_free(m, m->tc->pool->mapping_pool);
}
Mike Snitzer's avatar
Mike Snitzer committed
556
static void process_prepared_mapping(struct dm_thin_new_mapping *m)
557
558
559
560
561
562
563
564
565
566
{
	struct thin_c *tc = m->tc;
	struct bio *bio;
	int r;

	bio = m->bio;
	if (bio)
		bio->bi_end_io = m->saved_bi_end_io;

	if (m->err) {
567
		dm_cell_error(m->cell);
568
		goto out;
569
570
571
572
573
574
575
576
577
	}

	/*
	 * Commit the prepared block into the mapping btree.
	 * Any I/O for this block arriving after this point will get
	 * remapped to it directly.
	 */
	r = dm_thin_insert_block(tc->td, m->virt_block, m->data_block);
	if (r) {
578
		DMERR_LIMIT("dm_thin_insert_block() failed");
579
		dm_cell_error(m->cell);
580
		goto out;
581
582
583
584
585
586
587
588
589
	}

	/*
	 * Release any bios held while the block was being provisioned.
	 * If we are processing a write bio that completely covers the block,
	 * we already processed it so can ignore it now when processing
	 * the bios in the cell.
	 */
	if (bio) {
590
		cell_defer_no_holder(tc, m->cell);
591
592
		bio_endio(bio, 0);
	} else
Joe Thornber's avatar
Joe Thornber committed
593
		cell_defer(tc, m->cell);
594

595
out:
596
597
598
599
	list_del(&m->list);
	mempool_free(m, tc->pool->mapping_pool);
}

600
static void process_prepared_discard_fail(struct dm_thin_new_mapping *m)
Joe Thornber's avatar
Joe Thornber committed
601
602
603
{
	struct thin_c *tc = m->tc;

604
	bio_io_error(m->bio);
605
606
	cell_defer_no_holder(tc, m->cell);
	cell_defer_no_holder(tc, m->cell2);
607
608
609
610
611
612
	mempool_free(m, tc->pool->mapping_pool);
}

static void process_prepared_discard_passdown(struct dm_thin_new_mapping *m)
{
	struct thin_c *tc = m->tc;
Joe Thornber's avatar
Joe Thornber committed
613

614
	inc_all_io_entry(tc->pool, m->bio);
615
616
	cell_defer_no_holder(tc, m->cell);
	cell_defer_no_holder(tc, m->cell2);
617

Joe Thornber's avatar
Joe Thornber committed
618
619
620
621
622
623
624
625
	if (m->pass_discard)
		remap_and_issue(tc, m->bio, m->data_block);
	else
		bio_endio(m->bio, 0);

	mempool_free(m, tc->pool->mapping_pool);
}

626
627
628
629
630
631
632
static void process_prepared_discard(struct dm_thin_new_mapping *m)
{
	int r;
	struct thin_c *tc = m->tc;

	r = dm_thin_remove_block(tc->td, m->virt_block);
	if (r)
633
		DMERR_LIMIT("dm_thin_remove_block() failed");
634
635
636
637

	process_prepared_discard_passdown(m);
}

Joe Thornber's avatar
Joe Thornber committed
638
static void process_prepared(struct pool *pool, struct list_head *head,
639
			     process_mapping_fn *fn)
640
641
642
{
	unsigned long flags;
	struct list_head maps;
Mike Snitzer's avatar
Mike Snitzer committed
643
	struct dm_thin_new_mapping *m, *tmp;
644
645
646

	INIT_LIST_HEAD(&maps);
	spin_lock_irqsave(&pool->lock, flags);
Joe Thornber's avatar
Joe Thornber committed
647
	list_splice_init(head, &maps);
648
649
650
	spin_unlock_irqrestore(&pool->lock, flags);

	list_for_each_entry_safe(m, tmp, &maps, list)
651
		(*fn)(m);
652
653
654
655
656
}

/*
 * Deferred bio jobs.
 */
Joe Thornber's avatar
Joe Thornber committed
657
static int io_overlaps_block(struct pool *pool, struct bio *bio)
658
{
659
	return bio->bi_size == (pool->sectors_per_block << SECTOR_SHIFT);
Joe Thornber's avatar
Joe Thornber committed
660
661
662
663
664
665
}

static int io_overwrites_block(struct pool *pool, struct bio *bio)
{
	return (bio_data_dir(bio) == WRITE) &&
		io_overlaps_block(pool, bio);
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
}

static void save_and_set_endio(struct bio *bio, bio_end_io_t **save,
			       bio_end_io_t *fn)
{
	*save = bio->bi_end_io;
	bio->bi_end_io = fn;
}

static int ensure_next_mapping(struct pool *pool)
{
	if (pool->next_mapping)
		return 0;

	pool->next_mapping = mempool_alloc(pool->mapping_pool, GFP_ATOMIC);

	return pool->next_mapping ? 0 : -ENOMEM;
}

Mike Snitzer's avatar
Mike Snitzer committed
685
static struct dm_thin_new_mapping *get_next_mapping(struct pool *pool)
686
{
Mike Snitzer's avatar
Mike Snitzer committed
687
	struct dm_thin_new_mapping *r = pool->next_mapping;
688
689
690
691
692
693
694
695
696

	BUG_ON(!pool->next_mapping);

	pool->next_mapping = NULL;

	return r;
}

static void schedule_copy(struct thin_c *tc, dm_block_t virt_block,
697
698
			  struct dm_dev *origin, dm_block_t data_origin,
			  dm_block_t data_dest,
Mike Snitzer's avatar
Mike Snitzer committed
699
			  struct dm_bio_prison_cell *cell, struct bio *bio)
700
701
702
{
	int r;
	struct pool *pool = tc->pool;
Mike Snitzer's avatar
Mike Snitzer committed
703
	struct dm_thin_new_mapping *m = get_next_mapping(pool);
704
705

	INIT_LIST_HEAD(&m->list);
706
	m->quiesced = 0;
707
708
709
710
711
712
713
714
	m->prepared = 0;
	m->tc = tc;
	m->virt_block = virt_block;
	m->data_block = data_dest;
	m->cell = cell;
	m->err = 0;
	m->bio = NULL;

715
	if (!dm_deferred_set_add_work(pool->shared_read_ds, &m->list))
716
		m->quiesced = 1;
717
718
719
720
721
722
723
724

	/*
	 * IO to pool_dev remaps to the pool target's data_dev.
	 *
	 * If the whole block of data is being overwritten, we can issue the
	 * bio immediately. Otherwise we use kcopyd to clone the data first.
	 */
	if (io_overwrites_block(pool, bio)) {
725
		struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
Mike Snitzer's avatar
Mike Snitzer committed
726

727
		h->overwrite_mapping = m;
728
729
		m->bio = bio;
		save_and_set_endio(bio, &m->saved_bi_end_io, overwrite_endio);
730
		inc_all_io_entry(pool, bio);
731
732
733
734
		remap_and_issue(tc, bio, data_dest);
	} else {
		struct dm_io_region from, to;

735
		from.bdev = origin->bdev;
736
737
738
739
740
741
742
743
744
745
746
		from.sector = data_origin * pool->sectors_per_block;
		from.count = pool->sectors_per_block;

		to.bdev = tc->pool_dev->bdev;
		to.sector = data_dest * pool->sectors_per_block;
		to.count = pool->sectors_per_block;

		r = dm_kcopyd_copy(pool->copier, &from, 1, &to,
				   0, copy_complete, m);
		if (r < 0) {
			mempool_free(m, pool->mapping_pool);
747
			DMERR_LIMIT("dm_kcopyd_copy() failed");
748
			dm_cell_error(cell);
749
750
751
752
		}
	}
}

753
754
static void schedule_internal_copy(struct thin_c *tc, dm_block_t virt_block,
				   dm_block_t data_origin, dm_block_t data_dest,
Mike Snitzer's avatar
Mike Snitzer committed
755
				   struct dm_bio_prison_cell *cell, struct bio *bio)
756
757
758
759
760
761
762
{
	schedule_copy(tc, virt_block, tc->pool_dev,
		      data_origin, data_dest, cell, bio);
}

static void schedule_external_copy(struct thin_c *tc, dm_block_t virt_block,
				   dm_block_t data_dest,
Mike Snitzer's avatar
Mike Snitzer committed
763
				   struct dm_bio_prison_cell *cell, struct bio *bio)
764
765
766
767
768
{
	schedule_copy(tc, virt_block, tc->origin_dev,
		      virt_block, data_dest, cell, bio);
}

769
static void schedule_zero(struct thin_c *tc, dm_block_t virt_block,
Mike Snitzer's avatar
Mike Snitzer committed
770
			  dm_block_t data_block, struct dm_bio_prison_cell *cell,
771
772
773
			  struct bio *bio)
{
	struct pool *pool = tc->pool;
Mike Snitzer's avatar
Mike Snitzer committed
774
	struct dm_thin_new_mapping *m = get_next_mapping(pool);
775
776

	INIT_LIST_HEAD(&m->list);
777
	m->quiesced = 1;
778
779
780
781
782
783
784
785
786
787
788
789
790
	m->prepared = 0;
	m->tc = tc;
	m->virt_block = virt_block;
	m->data_block = data_block;
	m->cell = cell;
	m->err = 0;
	m->bio = NULL;

	/*
	 * If the whole block of data is being overwritten or we are not
	 * zeroing pre-existing data, we can issue the bio immediately.
	 * Otherwise we use kcopyd to zero the data first.
	 */
791
	if (!pool->pf.zero_new_blocks)
792
793
794
		process_prepared_mapping(m);

	else if (io_overwrites_block(pool, bio)) {
795
		struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
Mike Snitzer's avatar
Mike Snitzer committed
796

797
		h->overwrite_mapping = m;
798
799
		m->bio = bio;
		save_and_set_endio(bio, &m->saved_bi_end_io, overwrite_endio);
800
		inc_all_io_entry(pool, bio);
801
802
803
804
805
806
807
808
809
810
811
812
		remap_and_issue(tc, bio, data_block);
	} else {
		int r;
		struct dm_io_region to;

		to.bdev = tc->pool_dev->bdev;
		to.sector = data_block * pool->sectors_per_block;
		to.count = pool->sectors_per_block;

		r = dm_kcopyd_zero(pool->copier, 1, &to, 0, copy_complete, m);
		if (r < 0) {
			mempool_free(m, pool->mapping_pool);
813
			DMERR_LIMIT("dm_kcopyd_zero() failed");
814
			dm_cell_error(cell);
815
816
817
818
		}
	}
}

819
820
821
822
823
824
static int commit(struct pool *pool)
{
	int r;

	r = dm_pool_commit_metadata(pool->pmd);
	if (r)
825
		DMERR_LIMIT("commit failed: error = %d", r);
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847

	return r;
}

/*
 * A non-zero return indicates read_only or fail_io mode.
 * Many callers don't care about the return value.
 */
static int commit_or_fallback(struct pool *pool)
{
	int r;

	if (get_pool_mode(pool) != PM_WRITE)
		return -EINVAL;

	r = commit(pool);
	if (r)
		set_pool_mode(pool, PM_READ_ONLY);

	return r;
}

848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
static int alloc_data_block(struct thin_c *tc, dm_block_t *result)
{
	int r;
	dm_block_t free_blocks;
	unsigned long flags;
	struct pool *pool = tc->pool;

	r = dm_pool_get_free_block_count(pool->pmd, &free_blocks);
	if (r)
		return r;

	if (free_blocks <= pool->low_water_blocks && !pool->low_water_triggered) {
		DMWARN("%s: reached low water mark, sending event.",
		       dm_device_name(pool->pool_md));
		spin_lock_irqsave(&pool->lock, flags);
		pool->low_water_triggered = 1;
		spin_unlock_irqrestore(&pool->lock, flags);
		dm_table_event(pool->ti->table);
	}

	if (!free_blocks) {
		if (pool->no_free_space)
			return -ENOSPC;
		else {
			/*
			 * Try to commit to see if that will free up some
			 * more space.
			 */
876
			(void) commit_or_fallback(pool);
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909

			r = dm_pool_get_free_block_count(pool->pmd, &free_blocks);
			if (r)
				return r;

			/*
			 * If we still have no space we set a flag to avoid
			 * doing all this checking and return -ENOSPC.
			 */
			if (!free_blocks) {
				DMWARN("%s: no free space available.",
				       dm_device_name(pool->pool_md));
				spin_lock_irqsave(&pool->lock, flags);
				pool->no_free_space = 1;
				spin_unlock_irqrestore(&pool->lock, flags);
				return -ENOSPC;
			}
		}
	}

	r = dm_pool_alloc_data_block(pool->pmd, result);
	if (r)
		return r;

	return 0;
}

/*
 * If we have run out of space, queue bios until the device is
 * resumed, presumably after having been reloaded with more space.
 */
static void retry_on_resume(struct bio *bio)
{
910
	struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
911
	struct thin_c *tc = h->tc;
912
913
914
915
916
917
918
919
	struct pool *pool = tc->pool;
	unsigned long flags;

	spin_lock_irqsave(&pool->lock, flags);
	bio_list_add(&pool->retry_on_resume_list, bio);
	spin_unlock_irqrestore(&pool->lock, flags);
}

Mike Snitzer's avatar
Mike Snitzer committed
920
static void no_space(struct dm_bio_prison_cell *cell)
921
922
923
924
925
{
	struct bio *bio;
	struct bio_list bios;

	bio_list_init(&bios);
926
	dm_cell_release(cell, &bios);
927
928
929
930
931

	while ((bio = bio_list_pop(&bios)))
		retry_on_resume(bio);
}

Joe Thornber's avatar
Joe Thornber committed
932
933
934
static void process_discard(struct thin_c *tc, struct bio *bio)
{
	int r;
935
	unsigned long flags;
Joe Thornber's avatar
Joe Thornber committed
936
	struct pool *pool = tc->pool;
Mike Snitzer's avatar
Mike Snitzer committed
937
	struct dm_bio_prison_cell *cell, *cell2;
938
	struct dm_cell_key key, key2;
Joe Thornber's avatar
Joe Thornber committed
939
940
	dm_block_t block = get_bio_block(tc, bio);
	struct dm_thin_lookup_result lookup_result;
Mike Snitzer's avatar
Mike Snitzer committed
941
	struct dm_thin_new_mapping *m;
Joe Thornber's avatar
Joe Thornber committed
942
943

	build_virtual_key(tc->td, block, &key);
944
	if (dm_bio_detain(tc->pool->prison, &key, bio, &cell))
Joe Thornber's avatar
Joe Thornber committed
945
946
947
948
949
950
951
952
953
954
955
		return;

	r = dm_thin_find_block(tc->td, block, 1, &lookup_result);
	switch (r) {
	case 0:
		/*
		 * Check nobody is fiddling with this pool block.  This can
		 * happen if someone's in the process of breaking sharing
		 * on this block.
		 */
		build_data_key(tc->td, lookup_result.block, &key2);
956
		if (dm_bio_detain(tc->pool->prison, &key2, bio, &cell2)) {
957
			cell_defer_no_holder(tc, cell);
Joe Thornber's avatar
Joe Thornber committed
958
959
960
961
962
963
964
965
966
967
			break;
		}

		if (io_overlaps_block(pool, bio)) {
			/*
			 * IO may still be going to the destination block.  We must
			 * quiesce before we can do the removal.
			 */
			m = get_next_mapping(pool);
			m->tc = tc;
968
			m->pass_discard = (!lookup_result.shared) && pool->pf.discard_passdown;
Joe Thornber's avatar
Joe Thornber committed
969
970
971
972
973
974
975
			m->virt_block = block;
			m->data_block = lookup_result.block;
			m->cell = cell;
			m->cell2 = cell2;
			m->err = 0;
			m->bio = bio;

976
			if (!dm_deferred_set_add_work(pool->all_io_ds, &m->list)) {
977
				spin_lock_irqsave(&pool->lock, flags);
Joe Thornber's avatar
Joe Thornber committed
978
				list_add(&m->list, &pool->prepared_discards);
979
				spin_unlock_irqrestore(&pool->lock, flags);
Joe Thornber's avatar
Joe Thornber committed
980
981
982
				wake_worker(pool);
			}
		} else {
983
			inc_all_io_entry(pool, bio);
984
985
			cell_defer_no_holder(tc, cell);
			cell_defer_no_holder(tc, cell2);
986

Joe Thornber's avatar
Joe Thornber committed
987
			/*
988
989
990
			 * The DM core makes sure that the discard doesn't span
			 * a block boundary.  So we submit the discard of a
			 * partial block appropriately.
Joe Thornber's avatar
Joe Thornber committed
991
			 */
992
993
994
995
			if ((!lookup_result.shared) && pool->pf.discard_passdown)
				remap_and_issue(tc, bio, lookup_result.block);
			else
				bio_endio(bio, 0);
Joe Thornber's avatar
Joe Thornber committed
996
997
998
999
1000
1001
1002
		}
		break;

	case -ENODATA:
		/*
		 * It isn't provisioned, just forget it.
		 */
1003
		cell_defer_no_holder(tc, cell);
Joe Thornber's avatar
Joe Thornber committed
1004
1005
1006
1007
		bio_endio(bio, 0);
		break;

	default:
1008
1009
		DMERR_LIMIT("%s: dm_thin_find_block() failed: error = %d",
			    __func__, r);
1010
		cell_defer_no_holder(tc, cell);
Joe Thornber's avatar
Joe Thornber committed
1011
1012
1013
1014
1015
		bio_io_error(bio);
		break;
	}
}

1016
static void break_sharing(struct thin_c *tc, struct bio *bio, dm_block_t block,
1017
			  struct dm_cell_key *key,
1018
			  struct dm_thin_lookup_result *lookup_result,
Mike Snitzer's avatar
Mike Snitzer committed
1019
			  struct dm_bio_prison_cell *cell)
1020
1021
1022
1023
1024
1025
1026
{
	int r;
	dm_block_t data_block;

	r = alloc_data_block(tc, &data_block);
	switch (r) {
	case 0:
1027
1028
		schedule_internal_copy(tc, block, lookup_result->block,
				       data_block, cell, bio);
1029
1030
1031
1032
1033
1034
1035
		break;

	case -ENOSPC:
		no_space(cell);
		break;

	default:
1036
1037
		DMERR_LIMIT("%s: alloc_data_block() failed: error = %d",
			    __func__, r);
1038
		dm_cell_error(cell);
1039
1040
1041
1042
1043
1044
1045
1046
		break;
	}
}

static void process_shared_bio(struct thin_c *tc, struct bio *bio,
			       dm_block_t block,
			       struct dm_thin_lookup_result *lookup_result)
{
Mike Snitzer's avatar
Mike Snitzer committed
1047
	struct dm_bio_prison_cell *cell;
1048
	struct pool *pool = tc->pool;
1049
	struct dm_cell_key key;
1050
1051
1052
1053
1054
1055

	/*
	 * If cell is already occupied, then sharing is already in the process
	 * of being broken so we have nothing further to do here.
	 */
	build_data_key(tc->td, lookup_result->block, &key);
1056
	if (dm_bio_detain(pool->prison, &key, bio, &cell))
1057
1058
		return;

1059
	if (bio_data_dir(bio) == WRITE && bio->bi_size)
1060
1061
		break_sharing(tc, bio, block, &key, lookup_result, cell);
	else {
1062
		struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
1063

1064
		h->shared_read_entry = dm_deferred_entry_inc(pool->shared_read_ds);
1065
		inc_all_io_entry(pool, bio);
1066
		cell_defer_no_holder(tc, cell);
1067

1068
1069
1070
1071
1072
		remap_and_issue(tc, bio, lookup_result->block);
	}
}

static void provision_block(struct thin_c *tc, struct bio *bio, dm_block_t block,
Mike Snitzer's avatar
Mike Snitzer committed
1073
			    struct dm_bio_prison_cell *cell)
1074
1075
1076
1077
1078
1079
1080
1081
{
	int r;
	dm_block_t data_block;

	/*
	 * Remap empty bios (flushes) immediately, without provisioning.
	 */
	if (!bio->bi_size) {
1082
		inc_all_io_entry(tc->pool, bio);
1083
		cell_defer_no_holder(tc, cell);
1084

1085
1086
1087
1088
1089
1090
1091
1092
1093
		remap_and_issue(tc, bio, 0);
		return;
	}

	/*
	 * Fill read bios with zeroes and complete them immediately.
	 */
	if (bio_data_dir(bio) == READ) {
		zero_fill_bio(bio);
1094
		cell_defer_no_holder(tc, cell);
1095
1096
1097
1098
1099
1100
1101
		bio_endio(bio, 0);
		return;
	}

	r = alloc_data_block(tc, &data_block);
	switch (r) {
	case 0:
1102
1103
1104
1105
		if (tc->origin_dev)
			schedule_external_copy(tc, block, data_block, cell, bio);
		else
			schedule_zero(tc, block, data_block, cell, bio);
1106
1107
1108
1109
1110
1111
1112
		break;

	case -ENOSPC:
		no_space(cell);
		break;

	default:
1113
1114
		DMERR_LIMIT("%s: alloc_data_block() failed: error = %d",
			    __func__, r);
1115
		set_pool_mode(tc->pool, PM_READ_ONLY);
1116
		dm_cell_error(cell);
1117
1118
1119
1120
1121
1122
1123
1124
		break;
	}
}

static void process_bio(struct thin_c *tc, struct bio *bio)
{
	int r;
	dm_block_t block = get_bio_block(tc, bio);
Mike Snitzer's avatar
Mike Snitzer committed
1125
	struct dm_bio_prison_cell *cell;
1126
	struct dm_cell_key key;
1127
1128
1129
1130
1131
1132
1133
	struct dm_thin_lookup_result lookup_result;

	/*
	 * If cell is already occupied, then the block is already
	 * being provisioned so we have nothing further to do here.
	 */
	build_virtual_key(tc->td, block, &key);
1134
	if (dm_bio_detain(tc->pool->prison, &key, bio, &cell))
1135
1136
1137
1138
1139
		return;

	r = dm_thin_find_block(tc->td, block, 1, &lookup_result);
	switch (r) {
	case 0:
1140
		if (lookup_result.shared) {
1141
			process_shared_bio(tc, bio, block, &lookup_result);
1142
			cell_defer_no_holder(tc, cell);
1143
1144
		} else {
			inc_all_io_entry(tc->pool, bio);
1145
			cell_defer_no_holder(tc, cell);
1146

1147
			remap_and_issue(tc, bio, lookup_result.block);
1148
		}
1149
1150
1151
		break;

	case -ENODATA:
1152
		if (bio_data_dir(bio) == READ && tc->origin_dev) {
1153
			inc_all_io_entry(tc->pool, bio);
1154
			cell_defer_no_holder(tc, cell);
1155

1156
1157
1158
			remap_to_origin_and_issue(tc, bio);
		} else
			provision_block(tc, bio, block, cell);
1159
1160
1161
		break;

	default:
1162
1163
		DMERR_LIMIT("%s: dm_thin_find_block() failed: error = %d",
			    __func__, r);
1164
		cell_defer_no_holder(tc, cell);
1165
1166
1167
1168
1169
		bio_io_error(bio);
		break;
	}
}

1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
static void process_bio_read_only(struct thin_c *tc, struct bio *bio)
{
	int r;
	int rw = bio_data_dir(bio);
	dm_block_t block = get_bio_block(tc, bio);
	struct dm_thin_lookup_result lookup_result;

	r = dm_thin_find_block(tc->td, block, 1, &lookup_result);
	switch (r) {
	case 0:
		if (lookup_result.shared && (rw == WRITE) && bio->bi_size)
			bio_io_error(bio);
1182
1183
		else {
			inc_all_io_entry(tc->pool, bio);
1184
			remap_and_issue(tc, bio, lookup_result.block);
1185
		}
1186
1187
1188
1189
1190
1191
1192
1193
1194
		break;

	case -ENODATA:
		if (rw != READ) {
			bio_io_error(bio);
			break;
		}

		if (tc->origin_dev) {
1195
			inc_all_io_entry(tc->pool, bio);
1196
1197
1198
1199
1200
1201
1202
1203
1204
			remap_to_origin_and_issue(tc, bio);
			break;
		}

		zero_fill_bio(bio);
		bio_endio(bio, 0);
		break;

	default:
1205
1206
		DMERR_LIMIT("%s: dm_thin_find_block() failed: error = %d",
			    __func__, r);
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
		bio_io_error(bio);
		break;
	}
}

static void process_bio_fail(struct thin_c *tc, struct bio *bio)
{
	bio_io_error(bio);
}

1217
1218
1219
1220
1221
1222
static int need_commit_due_to_time(struct pool *pool)
{
	return jiffies < pool->last_commit_jiffies ||
	       jiffies > pool->last_commit_jiffies + COMMIT_PERIOD;
}

1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
static void process_deferred_bios(struct pool *pool)
{
	unsigned long flags;
	struct bio *bio;
	struct bio_list bios;

	bio_list_init(&bios);

	spin_lock_irqsave(&pool->lock, flags);
	bio_list_merge(&bios, &pool->deferred_bios);
	bio_list_init(&pool->deferred_bios);
	spin_unlock_irqrestore(&pool->lock, flags);

	while ((bio = bio_list_pop(&bios))) {
1237
		struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
1238
1239
		struct thin_c *tc = h->tc;

1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
		/*
		 * If we've got no free new_mapping structs, and processing
		 * this bio might require one, we pause until there are some
		 * prepared mappings to process.
		 */
		if (ensure_next_mapping(pool)) {
			spin_lock_irqsave(&pool->lock, flags);
			bio_list_merge(&pool->deferred_bios, &bios);
			spin_unlock_irqrestore(&pool->lock, flags);

			break;
		}
Joe Thornber's avatar
Joe Thornber committed
1252
1253

		if (bio->bi_rw & REQ_DISCARD)
1254
			pool->process_discard(tc, bio);
Joe Thornber's avatar
Joe Thornber committed
1255
		else
1256
			pool->process_bio(tc, bio);
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
	}

	/*
	 * If there are any deferred flush bios, we must commit
	 * the metadata before issuing them.
	 */
	bio_list_init(&bios);
	spin_lock_irqsave(&pool->lock, flags);
	bio_list_merge(&bios, &pool->deferred_flush_bios);
	bio_list_init(&pool->deferred_flush_bios);
	spin_unlock_irqrestore(&pool->lock, flags);

1269
	if (bio_list_empty(&bios) && !need_commit_due_to_time(pool))
1270
1271
		return;

1272
	if (commit_or_fallback(pool)) {
1273
1274
1275
1276
		while ((bio = bio_list_pop(&bios)))
			bio_io_error(bio);
		return;
	}
1277
	pool->last_commit_jiffies = jiffies;
1278
1279
1280
1281
1282
1283
1284
1285
1286

	while ((bio = bio_list_pop(&bios)))
		generic_make_request(bio);
}

static void do_worker(struct work_struct *ws)
{
	struct pool *pool = container_of(ws, struct pool, worker);

1287
1288
	process_prepared(pool, &pool->prepared_mappings, &pool->process_prepared_mapping);
	process_prepared(pool, &pool->prepared_discards, &pool->process_prepared_discard);
1289
1290
1291
	process_deferred_bios(pool);
}

1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
/*
 * We want to commit periodically so that not too much
 * unwritten data builds up.
 */
static void do_waker(struct work_struct *ws)
{
	struct pool *pool = container_of(to_delayed_work(ws), struct pool, waker);
	wake_worker(pool);
	queue_delayed_work(pool->wq, &pool->waker, COMMIT_PERIOD);
}

1303
1304
/*----------------------------------------------------------------*/

1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
static enum pool_mode get_pool_mode(struct pool *pool)
{
	return pool->pf.mode;
}

static void set_pool_mode(struct pool *pool, enum pool_mode mode)
{
	int r;

	pool->pf.mode = mode;

	switch (mode) {
	case PM_FAIL:
		DMERR("switching pool to failure mode");
		pool->process_bio = process_bio_fail;
		pool->process_discard = process_bio_fail;
		pool->process_prepared_mapping = process_prepared_mapping_fail;
		pool->process_prepared_discard = process_prepared_discard_fail;
		break;

	case PM_READ_ONLY:
		DMERR("switching pool to read-only mode");
		r = dm_pool_abort_metadata(pool->pmd);
		if (r) {
			DMERR("aborting transaction failed");
			set_pool_mode(pool, PM_FAIL);
		} else {
			dm_pool_metadata_read_only(pool->pmd);
			pool->process_bio = process_bio_read_only;
			pool->process_discard = process_discard;
			pool->process_prepared_mapping = process_prepared_mapping_fail;
			pool->process_prepared_discard = process_prepared_discard_passdown;
		}
		break;

	case PM_WRITE:
		pool->process_bio = process_bio;
		pool->process_discard = process_discard;
		pool->process_prepared_mapping = process_prepared_mapping;
		pool->process_prepared_discard = process_prepared_discard;
		break;
	}
}

/*----------------------------------------------------------------*/

1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
/*
 * Mapping functions.
 */

/*
 * Called only while mapping a thin bio to hand it over to the workqueue.
 */
static void thin_defer_bio(struct thin_c *tc, struct bio *bio)
{
	unsigned long flags;
	struct pool *pool = tc->pool;

	spin_lock_irqsave(&pool->lock, flags);
	bio_list_add(&pool->deferred_bios, bio);
	spin_unlock_irqrestore(&pool->lock, flags);

	wake_worker(pool);
}

1370
static void thin_hook_bio(struct thin_c *tc, struct bio *bio)
1371
{
1372
	struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
1373
1374
1375

	h->tc = tc;
	h->shared_read_entry = NULL;
1376
	h->all_io_entry = NULL;
1377
1378
1379
	h->overwrite_mapping = NULL;
}

1380
1381
1382
/*
 * Non-blocking function called from the thin target's map function.
 */
Mikulas Patocka's avatar
Mikulas Patocka committed
1383
static int thin_bio_map(struct dm_target *ti, struct bio *bio)
1384
1385
1386
1387
1388
1389
{
	int r;
	struct thin_c *tc = ti->private;
	dm_block_t block = get_bio_block(tc, bio);
	struct dm_thin_device *td = tc->td;
	struct dm_thin_lookup_result result;
1390
1391
	struct dm_bio_prison_cell *cell1, *cell2;
	struct dm_cell_key key;
1392

1393
	thin_hook_bio(tc, bio);
1394
1395
1396
1397
1398
1399

	if (get_pool_mode(tc->pool) == PM_FAIL) {
		bio_io_error(bio);
		return DM_MAPIO_SUBMITTED;
	}

Joe Thornber's avatar
Joe Thornber committed
1400
	if (bio->bi_rw & (REQ_DISCARD | REQ_FLUSH | REQ_FUA)) {
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
		thin_defer_bio(tc, bio);
		return DM_MAPIO_SUBMITTED;
	}

	r = dm_thin_find_block(td, block, 0, &result);

	/*
	 * Note that we defer readahead too.
	 */
	switch (r) {
	case 0:
		if (unlikely(result.shared)) {
			/*
			 * We have a race condition here between the
			 * result.shared value returned by the lookup and
			 * snapshot creation, which may cause new
			 * sharing.
			 *
			 * To avoid this always quiesce the origin before
			 * taking the snap.  You want to do this anyway to
			 * ensure a consistent application view
			 * (i.e. lockfs).
			 *
			 * More distant ancestors are irrelevant. The
			 * shared flag will be set in their case.
			 */
			thin_defer_bio(tc, bio);
1428
			return DM_MAPIO_SUBMITTED;
1429
		}
1430
1431
1432
1433
1434
1435