dm thin: log info when growing the data or metadata device
[linux-2.6-block.git] / drivers / md / dm-thin.c
CommitLineData
991d9fa0 1/*
e49e5829 2 * Copyright (C) 2011-2012 Red Hat UK.
991d9fa0
JT
3 *
4 * This file is released under the GPL.
5 */
6
7#include "dm-thin-metadata.h"
4f81a417 8#include "dm-bio-prison.h"
1f4e0ff0 9#include "dm.h"
991d9fa0
JT
10
11#include <linux/device-mapper.h>
12#include <linux/dm-io.h>
13#include <linux/dm-kcopyd.h>
14#include <linux/list.h>
15#include <linux/init.h>
16#include <linux/module.h>
17#include <linux/slab.h>
18
19#define DM_MSG_PREFIX "thin"
20
21/*
22 * Tunable constants
23 */
7768ed33 24#define ENDIO_HOOK_POOL_SIZE 1024
991d9fa0
JT
25#define MAPPING_POOL_SIZE 1024
26#define PRISON_CELLS 1024
905e51b3 27#define COMMIT_PERIOD HZ
991d9fa0 28
df5d2e90
MP
29DECLARE_DM_KCOPYD_THROTTLE_WITH_MODULE_PARM(snapshot_copy_throttle,
30 "A percentage of time allocated for copy on write");
31
991d9fa0
JT
32/*
33 * The block size of the device holding pool data must be
34 * between 64KB and 1GB.
35 */
36#define DATA_DEV_BLOCK_SIZE_MIN_SECTORS (64 * 1024 >> SECTOR_SHIFT)
37#define DATA_DEV_BLOCK_SIZE_MAX_SECTORS (1024 * 1024 * 1024 >> SECTOR_SHIFT)
38
991d9fa0
JT
39/*
40 * Device id is restricted to 24 bits.
41 */
42#define MAX_DEV_ID ((1 << 24) - 1)
43
44/*
45 * How do we handle breaking sharing of data blocks?
46 * =================================================
47 *
48 * We use a standard copy-on-write btree to store the mappings for the
49 * devices (note I'm talking about copy-on-write of the metadata here, not
50 * the data). When you take an internal snapshot you clone the root node
51 * of the origin btree. After this there is no concept of an origin or a
52 * snapshot. They are just two device trees that happen to point to the
53 * same data blocks.
54 *
55 * When we get a write in we decide if it's to a shared data block using
56 * some timestamp magic. If it is, we have to break sharing.
57 *
58 * Let's say we write to a shared block in what was the origin. The
59 * steps are:
60 *
61 * i) plug io further to this physical block. (see bio_prison code).
62 *
63 * ii) quiesce any read io to that shared data block. Obviously
44feb387 64 * including all devices that share this block. (see dm_deferred_set code)
991d9fa0
JT
65 *
66 * iii) copy the data block to a newly allocate block. This step can be
67 * missed out if the io covers the block. (schedule_copy).
68 *
69 * iv) insert the new mapping into the origin's btree
fe878f34 70 * (process_prepared_mapping). This act of inserting breaks some
991d9fa0
JT
71 * sharing of btree nodes between the two devices. Breaking sharing only
72 * effects the btree of that specific device. Btrees for the other
73 * devices that share the block never change. The btree for the origin
74 * device as it was after the last commit is untouched, ie. we're using
75 * persistent data structures in the functional programming sense.
76 *
77 * v) unplug io to this physical block, including the io that triggered
78 * the breaking of sharing.
79 *
80 * Steps (ii) and (iii) occur in parallel.
81 *
82 * The metadata _doesn't_ need to be committed before the io continues. We
83 * get away with this because the io is always written to a _new_ block.
84 * If there's a crash, then:
85 *
86 * - The origin mapping will point to the old origin block (the shared
87 * one). This will contain the data as it was before the io that triggered
88 * the breaking of sharing came in.
89 *
90 * - The snap mapping still points to the old block. As it would after
91 * the commit.
92 *
93 * The downside of this scheme is the timestamp magic isn't perfect, and
94 * will continue to think that data block in the snapshot device is shared
95 * even after the write to the origin has broken sharing. I suspect data
96 * blocks will typically be shared by many different devices, so we're
97 * breaking sharing n + 1 times, rather than n, where n is the number of
98 * devices that reference this data block. At the moment I think the
99 * benefits far, far outweigh the disadvantages.
100 */
101
102/*----------------------------------------------------------------*/
103
991d9fa0
JT
104/*
105 * Key building.
106 */
107static void build_data_key(struct dm_thin_device *td,
44feb387 108 dm_block_t b, struct dm_cell_key *key)
991d9fa0
JT
109{
110 key->virtual = 0;
111 key->dev = dm_thin_dev_id(td);
112 key->block = b;
113}
114
115static void build_virtual_key(struct dm_thin_device *td, dm_block_t b,
44feb387 116 struct dm_cell_key *key)
991d9fa0
JT
117{
118 key->virtual = 1;
119 key->dev = dm_thin_dev_id(td);
120 key->block = b;
121}
122
123/*----------------------------------------------------------------*/
124
125/*
126 * A pool device ties together a metadata device and a data device. It
127 * also provides the interface for creating and destroying internal
128 * devices.
129 */
a24c2569 130struct dm_thin_new_mapping;
67e2e2b2 131
e49e5829
JT
132/*
133 * The pool runs in 3 modes. Ordered in degraded order for comparisons.
134 */
135enum pool_mode {
136 PM_WRITE, /* metadata may be changed */
137 PM_READ_ONLY, /* metadata may not be changed */
138 PM_FAIL, /* all I/O fails */
139};
140
67e2e2b2 141struct pool_features {
e49e5829
JT
142 enum pool_mode mode;
143
9bc142dd
MS
144 bool zero_new_blocks:1;
145 bool discard_enabled:1;
146 bool discard_passdown:1;
67e2e2b2
JT
147};
148
e49e5829
JT
149struct thin_c;
150typedef void (*process_bio_fn)(struct thin_c *tc, struct bio *bio);
151typedef void (*process_mapping_fn)(struct dm_thin_new_mapping *m);
152
991d9fa0
JT
153struct pool {
154 struct list_head list;
155 struct dm_target *ti; /* Only set if a pool target is bound */
156
157 struct mapped_device *pool_md;
158 struct block_device *md_dev;
159 struct dm_pool_metadata *pmd;
160
991d9fa0 161 dm_block_t low_water_blocks;
55f2b8bd 162 uint32_t sectors_per_block;
f9a8e0cd 163 int sectors_per_block_shift;
991d9fa0 164
67e2e2b2 165 struct pool_features pf;
88a6621b
JT
166 bool low_water_triggered:1; /* A dm event has been sent */
167 bool no_free_space:1; /* A -ENOSPC warning has been issued */
991d9fa0 168
44feb387 169 struct dm_bio_prison *prison;
991d9fa0
JT
170 struct dm_kcopyd_client *copier;
171
172 struct workqueue_struct *wq;
173 struct work_struct worker;
905e51b3 174 struct delayed_work waker;
991d9fa0 175
905e51b3 176 unsigned long last_commit_jiffies;
55f2b8bd 177 unsigned ref_count;
991d9fa0
JT
178
179 spinlock_t lock;
180 struct bio_list deferred_bios;
181 struct bio_list deferred_flush_bios;
182 struct list_head prepared_mappings;
104655fd 183 struct list_head prepared_discards;
991d9fa0
JT
184
185 struct bio_list retry_on_resume_list;
186
44feb387
MS
187 struct dm_deferred_set *shared_read_ds;
188 struct dm_deferred_set *all_io_ds;
991d9fa0 189
a24c2569 190 struct dm_thin_new_mapping *next_mapping;
991d9fa0 191 mempool_t *mapping_pool;
e49e5829
JT
192
193 process_bio_fn process_bio;
194 process_bio_fn process_discard;
195
196 process_mapping_fn process_prepared_mapping;
197 process_mapping_fn process_prepared_discard;
991d9fa0
JT
198};
199
e49e5829 200static enum pool_mode get_pool_mode(struct pool *pool);
b5330655 201static void metadata_operation_failed(struct pool *pool, const char *op, int r);
e49e5829 202
991d9fa0
JT
203/*
204 * Target context for a pool.
205 */
206struct pool_c {
207 struct dm_target *ti;
208 struct pool *pool;
209 struct dm_dev *data_dev;
210 struct dm_dev *metadata_dev;
211 struct dm_target_callbacks callbacks;
212
213 dm_block_t low_water_blocks;
0424caa1
MS
214 struct pool_features requested_pf; /* Features requested during table load */
215 struct pool_features adjusted_pf; /* Features used after adjusting for constituent devices */
991d9fa0
JT
216};
217
218/*
219 * Target context for a thin.
220 */
221struct thin_c {
222 struct dm_dev *pool_dev;
2dd9c257 223 struct dm_dev *origin_dev;
991d9fa0
JT
224 dm_thin_id dev_id;
225
226 struct pool *pool;
227 struct dm_thin_device *td;
228};
229
230/*----------------------------------------------------------------*/
231
025b9685
JT
232/*
233 * wake_worker() is used when new work is queued and when pool_resume is
234 * ready to continue deferred IO processing.
235 */
236static void wake_worker(struct pool *pool)
237{
238 queue_work(pool->wq, &pool->worker);
239}
240
241/*----------------------------------------------------------------*/
242
6beca5eb
JT
243static int bio_detain(struct pool *pool, struct dm_cell_key *key, struct bio *bio,
244 struct dm_bio_prison_cell **cell_result)
245{
246 int r;
247 struct dm_bio_prison_cell *cell_prealloc;
248
249 /*
250 * Allocate a cell from the prison's mempool.
251 * This might block but it can't fail.
252 */
253 cell_prealloc = dm_bio_prison_alloc_cell(pool->prison, GFP_NOIO);
254
255 r = dm_bio_detain(pool->prison, key, bio, cell_prealloc, cell_result);
256 if (r)
257 /*
258 * We reused an old cell; we can get rid of
259 * the new one.
260 */
261 dm_bio_prison_free_cell(pool->prison, cell_prealloc);
262
263 return r;
264}
265
266static void cell_release(struct pool *pool,
267 struct dm_bio_prison_cell *cell,
268 struct bio_list *bios)
269{
270 dm_cell_release(pool->prison, cell, bios);
271 dm_bio_prison_free_cell(pool->prison, cell);
272}
273
274static void cell_release_no_holder(struct pool *pool,
275 struct dm_bio_prison_cell *cell,
276 struct bio_list *bios)
277{
278 dm_cell_release_no_holder(pool->prison, cell, bios);
279 dm_bio_prison_free_cell(pool->prison, cell);
280}
281
025b9685
JT
282static void cell_defer_no_holder_no_free(struct thin_c *tc,
283 struct dm_bio_prison_cell *cell)
284{
285 struct pool *pool = tc->pool;
286 unsigned long flags;
287
288 spin_lock_irqsave(&pool->lock, flags);
289 dm_cell_release_no_holder(pool->prison, cell, &pool->deferred_bios);
290 spin_unlock_irqrestore(&pool->lock, flags);
291
292 wake_worker(pool);
293}
294
6beca5eb
JT
295static void cell_error(struct pool *pool,
296 struct dm_bio_prison_cell *cell)
297{
298 dm_cell_error(pool->prison, cell);
299 dm_bio_prison_free_cell(pool->prison, cell);
300}
301
302/*----------------------------------------------------------------*/
303
991d9fa0
JT
304/*
305 * A global list of pools that uses a struct mapped_device as a key.
306 */
307static struct dm_thin_pool_table {
308 struct mutex mutex;
309 struct list_head pools;
310} dm_thin_pool_table;
311
312static void pool_table_init(void)
313{
314 mutex_init(&dm_thin_pool_table.mutex);
315 INIT_LIST_HEAD(&dm_thin_pool_table.pools);
316}
317
318static void __pool_table_insert(struct pool *pool)
319{
320 BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex));
321 list_add(&pool->list, &dm_thin_pool_table.pools);
322}
323
324static void __pool_table_remove(struct pool *pool)
325{
326 BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex));
327 list_del(&pool->list);
328}
329
330static struct pool *__pool_table_lookup(struct mapped_device *md)
331{
332 struct pool *pool = NULL, *tmp;
333
334 BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex));
335
336 list_for_each_entry(tmp, &dm_thin_pool_table.pools, list) {
337 if (tmp->pool_md == md) {
338 pool = tmp;
339 break;
340 }
341 }
342
343 return pool;
344}
345
346static struct pool *__pool_table_lookup_metadata_dev(struct block_device *md_dev)
347{
348 struct pool *pool = NULL, *tmp;
349
350 BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex));
351
352 list_for_each_entry(tmp, &dm_thin_pool_table.pools, list) {
353 if (tmp->md_dev == md_dev) {
354 pool = tmp;
355 break;
356 }
357 }
358
359 return pool;
360}
361
362/*----------------------------------------------------------------*/
363
a24c2569 364struct dm_thin_endio_hook {
eb2aa48d 365 struct thin_c *tc;
44feb387
MS
366 struct dm_deferred_entry *shared_read_entry;
367 struct dm_deferred_entry *all_io_entry;
a24c2569 368 struct dm_thin_new_mapping *overwrite_mapping;
eb2aa48d
JT
369};
370
991d9fa0
JT
371static void __requeue_bio_list(struct thin_c *tc, struct bio_list *master)
372{
373 struct bio *bio;
374 struct bio_list bios;
375
376 bio_list_init(&bios);
377 bio_list_merge(&bios, master);
378 bio_list_init(master);
379
380 while ((bio = bio_list_pop(&bios))) {
59c3d2c6 381 struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
a24c2569 382
eb2aa48d 383 if (h->tc == tc)
991d9fa0
JT
384 bio_endio(bio, DM_ENDIO_REQUEUE);
385 else
386 bio_list_add(master, bio);
387 }
388}
389
390static void requeue_io(struct thin_c *tc)
391{
392 struct pool *pool = tc->pool;
393 unsigned long flags;
394
395 spin_lock_irqsave(&pool->lock, flags);
396 __requeue_bio_list(tc, &pool->deferred_bios);
397 __requeue_bio_list(tc, &pool->retry_on_resume_list);
398 spin_unlock_irqrestore(&pool->lock, flags);
399}
400
401/*
402 * This section of code contains the logic for processing a thin device's IO.
403 * Much of the code depends on pool object resources (lists, workqueues, etc)
404 * but most is exclusively called from the thin target rather than the thin-pool
405 * target.
406 */
407
58f77a21
MS
408static bool block_size_is_power_of_two(struct pool *pool)
409{
410 return pool->sectors_per_block_shift >= 0;
411}
412
991d9fa0
JT
413static dm_block_t get_bio_block(struct thin_c *tc, struct bio *bio)
414{
58f77a21 415 struct pool *pool = tc->pool;
55f2b8bd
MS
416 sector_t block_nr = bio->bi_sector;
417
58f77a21
MS
418 if (block_size_is_power_of_two(pool))
419 block_nr >>= pool->sectors_per_block_shift;
f9a8e0cd 420 else
58f77a21 421 (void) sector_div(block_nr, pool->sectors_per_block);
55f2b8bd
MS
422
423 return block_nr;
991d9fa0
JT
424}
425
426static void remap(struct thin_c *tc, struct bio *bio, dm_block_t block)
427{
428 struct pool *pool = tc->pool;
55f2b8bd 429 sector_t bi_sector = bio->bi_sector;
991d9fa0
JT
430
431 bio->bi_bdev = tc->pool_dev->bdev;
58f77a21 432 if (block_size_is_power_of_two(pool))
f9a8e0cd
MP
433 bio->bi_sector = (block << pool->sectors_per_block_shift) |
434 (bi_sector & (pool->sectors_per_block - 1));
58f77a21
MS
435 else
436 bio->bi_sector = (block * pool->sectors_per_block) +
437 sector_div(bi_sector, pool->sectors_per_block);
991d9fa0
JT
438}
439
2dd9c257
JT
440static void remap_to_origin(struct thin_c *tc, struct bio *bio)
441{
442 bio->bi_bdev = tc->origin_dev->bdev;
443}
444
4afdd680
JT
445static int bio_triggers_commit(struct thin_c *tc, struct bio *bio)
446{
447 return (bio->bi_rw & (REQ_FLUSH | REQ_FUA)) &&
448 dm_thin_changed_this_transaction(tc->td);
449}
450
e8088073
JT
451static void inc_all_io_entry(struct pool *pool, struct bio *bio)
452{
453 struct dm_thin_endio_hook *h;
454
455 if (bio->bi_rw & REQ_DISCARD)
456 return;
457
59c3d2c6 458 h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
e8088073
JT
459 h->all_io_entry = dm_deferred_entry_inc(pool->all_io_ds);
460}
461
2dd9c257 462static void issue(struct thin_c *tc, struct bio *bio)
991d9fa0
JT
463{
464 struct pool *pool = tc->pool;
465 unsigned long flags;
466
e49e5829
JT
467 if (!bio_triggers_commit(tc, bio)) {
468 generic_make_request(bio);
469 return;
470 }
471
991d9fa0 472 /*
e49e5829
JT
473 * Complete bio with an error if earlier I/O caused changes to
474 * the metadata that can't be committed e.g, due to I/O errors
475 * on the metadata device.
991d9fa0 476 */
e49e5829
JT
477 if (dm_thin_aborted_changes(tc->td)) {
478 bio_io_error(bio);
479 return;
480 }
481
482 /*
483 * Batch together any bios that trigger commits and then issue a
484 * single commit for them in process_deferred_bios().
485 */
486 spin_lock_irqsave(&pool->lock, flags);
487 bio_list_add(&pool->deferred_flush_bios, bio);
488 spin_unlock_irqrestore(&pool->lock, flags);
991d9fa0
JT
489}
490
2dd9c257
JT
491static void remap_to_origin_and_issue(struct thin_c *tc, struct bio *bio)
492{
493 remap_to_origin(tc, bio);
494 issue(tc, bio);
495}
496
497static void remap_and_issue(struct thin_c *tc, struct bio *bio,
498 dm_block_t block)
499{
500 remap(tc, bio, block);
501 issue(tc, bio);
502}
503
991d9fa0
JT
504/*----------------------------------------------------------------*/
505
506/*
507 * Bio endio functions.
508 */
a24c2569 509struct dm_thin_new_mapping {
991d9fa0
JT
510 struct list_head list;
511
7f214665
MS
512 bool quiesced:1;
513 bool prepared:1;
514 bool pass_discard:1;
515 bool definitely_not_shared:1;
991d9fa0 516
7f214665 517 int err;
991d9fa0
JT
518 struct thin_c *tc;
519 dm_block_t virt_block;
520 dm_block_t data_block;
a24c2569 521 struct dm_bio_prison_cell *cell, *cell2;
991d9fa0
JT
522
523 /*
524 * If the bio covers the whole area of a block then we can avoid
525 * zeroing or copying. Instead this bio is hooked. The bio will
526 * still be in the cell, so care has to be taken to avoid issuing
527 * the bio twice.
528 */
529 struct bio *bio;
530 bio_end_io_t *saved_bi_end_io;
531};
532
a24c2569 533static void __maybe_add_mapping(struct dm_thin_new_mapping *m)
991d9fa0
JT
534{
535 struct pool *pool = m->tc->pool;
536
eb2aa48d 537 if (m->quiesced && m->prepared) {
daec338b 538 list_add_tail(&m->list, &pool->prepared_mappings);
991d9fa0
JT
539 wake_worker(pool);
540 }
541}
542
543static void copy_complete(int read_err, unsigned long write_err, void *context)
544{
545 unsigned long flags;
a24c2569 546 struct dm_thin_new_mapping *m = context;
991d9fa0
JT
547 struct pool *pool = m->tc->pool;
548
549 m->err = read_err || write_err ? -EIO : 0;
550
551 spin_lock_irqsave(&pool->lock, flags);
7f214665 552 m->prepared = true;
991d9fa0
JT
553 __maybe_add_mapping(m);
554 spin_unlock_irqrestore(&pool->lock, flags);
555}
556
557static void overwrite_endio(struct bio *bio, int err)
558{
559 unsigned long flags;
59c3d2c6 560 struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
a24c2569 561 struct dm_thin_new_mapping *m = h->overwrite_mapping;
991d9fa0
JT
562 struct pool *pool = m->tc->pool;
563
564 m->err = err;
565
566 spin_lock_irqsave(&pool->lock, flags);
7f214665 567 m->prepared = true;
991d9fa0
JT
568 __maybe_add_mapping(m);
569 spin_unlock_irqrestore(&pool->lock, flags);
570}
571
991d9fa0
JT
572/*----------------------------------------------------------------*/
573
574/*
575 * Workqueue.
576 */
577
578/*
579 * Prepared mapping jobs.
580 */
581
582/*
583 * This sends the bios in the cell back to the deferred_bios list.
584 */
2aab3850 585static void cell_defer(struct thin_c *tc, struct dm_bio_prison_cell *cell)
991d9fa0
JT
586{
587 struct pool *pool = tc->pool;
588 unsigned long flags;
589
590 spin_lock_irqsave(&pool->lock, flags);
6beca5eb 591 cell_release(pool, cell, &pool->deferred_bios);
991d9fa0
JT
592 spin_unlock_irqrestore(&tc->pool->lock, flags);
593
594 wake_worker(pool);
595}
596
597/*
6beca5eb 598 * Same as cell_defer above, except it omits the original holder of the cell.
991d9fa0 599 */
f286ba0e 600static void cell_defer_no_holder(struct thin_c *tc, struct dm_bio_prison_cell *cell)
991d9fa0 601{
991d9fa0
JT
602 struct pool *pool = tc->pool;
603 unsigned long flags;
604
991d9fa0 605 spin_lock_irqsave(&pool->lock, flags);
6beca5eb 606 cell_release_no_holder(pool, cell, &pool->deferred_bios);
991d9fa0
JT
607 spin_unlock_irqrestore(&pool->lock, flags);
608
609 wake_worker(pool);
610}
611
e49e5829
JT
612static void process_prepared_mapping_fail(struct dm_thin_new_mapping *m)
613{
614 if (m->bio)
615 m->bio->bi_end_io = m->saved_bi_end_io;
6beca5eb 616 cell_error(m->tc->pool, m->cell);
e49e5829
JT
617 list_del(&m->list);
618 mempool_free(m, m->tc->pool->mapping_pool);
619}
025b9685 620
a24c2569 621static void process_prepared_mapping(struct dm_thin_new_mapping *m)
991d9fa0
JT
622{
623 struct thin_c *tc = m->tc;
6beca5eb 624 struct pool *pool = tc->pool;
991d9fa0
JT
625 struct bio *bio;
626 int r;
627
628 bio = m->bio;
629 if (bio)
630 bio->bi_end_io = m->saved_bi_end_io;
631
632 if (m->err) {
6beca5eb 633 cell_error(pool, m->cell);
905386f8 634 goto out;
991d9fa0
JT
635 }
636
637 /*
638 * Commit the prepared block into the mapping btree.
639 * Any I/O for this block arriving after this point will get
640 * remapped to it directly.
641 */
642 r = dm_thin_insert_block(tc->td, m->virt_block, m->data_block);
643 if (r) {
b5330655 644 metadata_operation_failed(pool, "dm_thin_insert_block", r);
6beca5eb 645 cell_error(pool, m->cell);
905386f8 646 goto out;
991d9fa0
JT
647 }
648
649 /*
650 * Release any bios held while the block was being provisioned.
651 * If we are processing a write bio that completely covers the block,
652 * we already processed it so can ignore it now when processing
653 * the bios in the cell.
654 */
655 if (bio) {
f286ba0e 656 cell_defer_no_holder(tc, m->cell);
991d9fa0
JT
657 bio_endio(bio, 0);
658 } else
2aab3850 659 cell_defer(tc, m->cell);
991d9fa0 660
905386f8 661out:
991d9fa0 662 list_del(&m->list);
6beca5eb 663 mempool_free(m, pool->mapping_pool);
991d9fa0
JT
664}
665
e49e5829 666static void process_prepared_discard_fail(struct dm_thin_new_mapping *m)
104655fd 667{
104655fd
JT
668 struct thin_c *tc = m->tc;
669
e49e5829 670 bio_io_error(m->bio);
f286ba0e
JT
671 cell_defer_no_holder(tc, m->cell);
672 cell_defer_no_holder(tc, m->cell2);
e49e5829
JT
673 mempool_free(m, tc->pool->mapping_pool);
674}
675
676static void process_prepared_discard_passdown(struct dm_thin_new_mapping *m)
677{
678 struct thin_c *tc = m->tc;
104655fd 679
e8088073 680 inc_all_io_entry(tc->pool, m->bio);
f286ba0e
JT
681 cell_defer_no_holder(tc, m->cell);
682 cell_defer_no_holder(tc, m->cell2);
e8088073 683
104655fd 684 if (m->pass_discard)
19fa1a67
JT
685 if (m->definitely_not_shared)
686 remap_and_issue(tc, m->bio, m->data_block);
687 else {
688 bool used = false;
689 if (dm_pool_block_is_used(tc->pool->pmd, m->data_block, &used) || used)
690 bio_endio(m->bio, 0);
691 else
692 remap_and_issue(tc, m->bio, m->data_block);
693 }
104655fd
JT
694 else
695 bio_endio(m->bio, 0);
696
104655fd
JT
697 mempool_free(m, tc->pool->mapping_pool);
698}
699
e49e5829
JT
700static void process_prepared_discard(struct dm_thin_new_mapping *m)
701{
702 int r;
703 struct thin_c *tc = m->tc;
704
705 r = dm_thin_remove_block(tc->td, m->virt_block);
706 if (r)
c397741c 707 DMERR_LIMIT("dm_thin_remove_block() failed");
e49e5829
JT
708
709 process_prepared_discard_passdown(m);
710}
711
104655fd 712static void process_prepared(struct pool *pool, struct list_head *head,
e49e5829 713 process_mapping_fn *fn)
991d9fa0
JT
714{
715 unsigned long flags;
716 struct list_head maps;
a24c2569 717 struct dm_thin_new_mapping *m, *tmp;
991d9fa0
JT
718
719 INIT_LIST_HEAD(&maps);
720 spin_lock_irqsave(&pool->lock, flags);
104655fd 721 list_splice_init(head, &maps);
991d9fa0
JT
722 spin_unlock_irqrestore(&pool->lock, flags);
723
724 list_for_each_entry_safe(m, tmp, &maps, list)
e49e5829 725 (*fn)(m);
991d9fa0
JT
726}
727
728/*
729 * Deferred bio jobs.
730 */
104655fd 731static int io_overlaps_block(struct pool *pool, struct bio *bio)
991d9fa0 732{
f9a8e0cd 733 return bio->bi_size == (pool->sectors_per_block << SECTOR_SHIFT);
104655fd
JT
734}
735
736static int io_overwrites_block(struct pool *pool, struct bio *bio)
737{
738 return (bio_data_dir(bio) == WRITE) &&
739 io_overlaps_block(pool, bio);
991d9fa0
JT
740}
741
742static void save_and_set_endio(struct bio *bio, bio_end_io_t **save,
743 bio_end_io_t *fn)
744{
745 *save = bio->bi_end_io;
746 bio->bi_end_io = fn;
747}
748
749static int ensure_next_mapping(struct pool *pool)
750{
751 if (pool->next_mapping)
752 return 0;
753
754 pool->next_mapping = mempool_alloc(pool->mapping_pool, GFP_ATOMIC);
755
756 return pool->next_mapping ? 0 : -ENOMEM;
757}
758
a24c2569 759static struct dm_thin_new_mapping *get_next_mapping(struct pool *pool)
991d9fa0 760{
16961b04 761 struct dm_thin_new_mapping *m = pool->next_mapping;
991d9fa0
JT
762
763 BUG_ON(!pool->next_mapping);
764
16961b04
MS
765 memset(m, 0, sizeof(struct dm_thin_new_mapping));
766 INIT_LIST_HEAD(&m->list);
767 m->bio = NULL;
768
991d9fa0
JT
769 pool->next_mapping = NULL;
770
16961b04 771 return m;
991d9fa0
JT
772}
773
774static void schedule_copy(struct thin_c *tc, dm_block_t virt_block,
2dd9c257
JT
775 struct dm_dev *origin, dm_block_t data_origin,
776 dm_block_t data_dest,
a24c2569 777 struct dm_bio_prison_cell *cell, struct bio *bio)
991d9fa0
JT
778{
779 int r;
780 struct pool *pool = tc->pool;
a24c2569 781 struct dm_thin_new_mapping *m = get_next_mapping(pool);
991d9fa0 782
991d9fa0
JT
783 m->tc = tc;
784 m->virt_block = virt_block;
785 m->data_block = data_dest;
786 m->cell = cell;
991d9fa0 787
44feb387 788 if (!dm_deferred_set_add_work(pool->shared_read_ds, &m->list))
7f214665 789 m->quiesced = true;
991d9fa0
JT
790
791 /*
792 * IO to pool_dev remaps to the pool target's data_dev.
793 *
794 * If the whole block of data is being overwritten, we can issue the
795 * bio immediately. Otherwise we use kcopyd to clone the data first.
796 */
797 if (io_overwrites_block(pool, bio)) {
59c3d2c6 798 struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
a24c2569 799
eb2aa48d 800 h->overwrite_mapping = m;
991d9fa0
JT
801 m->bio = bio;
802 save_and_set_endio(bio, &m->saved_bi_end_io, overwrite_endio);
e8088073 803 inc_all_io_entry(pool, bio);
991d9fa0
JT
804 remap_and_issue(tc, bio, data_dest);
805 } else {
806 struct dm_io_region from, to;
807
2dd9c257 808 from.bdev = origin->bdev;
991d9fa0
JT
809 from.sector = data_origin * pool->sectors_per_block;
810 from.count = pool->sectors_per_block;
811
812 to.bdev = tc->pool_dev->bdev;
813 to.sector = data_dest * pool->sectors_per_block;
814 to.count = pool->sectors_per_block;
815
816 r = dm_kcopyd_copy(pool->copier, &from, 1, &to,
817 0, copy_complete, m);
818 if (r < 0) {
819 mempool_free(m, pool->mapping_pool);
c397741c 820 DMERR_LIMIT("dm_kcopyd_copy() failed");
6beca5eb 821 cell_error(pool, cell);
991d9fa0
JT
822 }
823 }
824}
825
2dd9c257
JT
826static void schedule_internal_copy(struct thin_c *tc, dm_block_t virt_block,
827 dm_block_t data_origin, dm_block_t data_dest,
a24c2569 828 struct dm_bio_prison_cell *cell, struct bio *bio)
2dd9c257
JT
829{
830 schedule_copy(tc, virt_block, tc->pool_dev,
831 data_origin, data_dest, cell, bio);
832}
833
834static void schedule_external_copy(struct thin_c *tc, dm_block_t virt_block,
835 dm_block_t data_dest,
a24c2569 836 struct dm_bio_prison_cell *cell, struct bio *bio)
2dd9c257
JT
837{
838 schedule_copy(tc, virt_block, tc->origin_dev,
839 virt_block, data_dest, cell, bio);
840}
841
991d9fa0 842static void schedule_zero(struct thin_c *tc, dm_block_t virt_block,
a24c2569 843 dm_block_t data_block, struct dm_bio_prison_cell *cell,
991d9fa0
JT
844 struct bio *bio)
845{
846 struct pool *pool = tc->pool;
a24c2569 847 struct dm_thin_new_mapping *m = get_next_mapping(pool);
991d9fa0 848
7f214665
MS
849 m->quiesced = true;
850 m->prepared = false;
991d9fa0
JT
851 m->tc = tc;
852 m->virt_block = virt_block;
853 m->data_block = data_block;
854 m->cell = cell;
991d9fa0
JT
855
856 /*
857 * If the whole block of data is being overwritten or we are not
858 * zeroing pre-existing data, we can issue the bio immediately.
859 * Otherwise we use kcopyd to zero the data first.
860 */
67e2e2b2 861 if (!pool->pf.zero_new_blocks)
991d9fa0
JT
862 process_prepared_mapping(m);
863
864 else if (io_overwrites_block(pool, bio)) {
59c3d2c6 865 struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
a24c2569 866
eb2aa48d 867 h->overwrite_mapping = m;
991d9fa0
JT
868 m->bio = bio;
869 save_and_set_endio(bio, &m->saved_bi_end_io, overwrite_endio);
e8088073 870 inc_all_io_entry(pool, bio);
991d9fa0 871 remap_and_issue(tc, bio, data_block);
991d9fa0
JT
872 } else {
873 int r;
874 struct dm_io_region to;
875
876 to.bdev = tc->pool_dev->bdev;
877 to.sector = data_block * pool->sectors_per_block;
878 to.count = pool->sectors_per_block;
879
880 r = dm_kcopyd_zero(pool->copier, 1, &to, 0, copy_complete, m);
881 if (r < 0) {
882 mempool_free(m, pool->mapping_pool);
c397741c 883 DMERR_LIMIT("dm_kcopyd_zero() failed");
6beca5eb 884 cell_error(pool, cell);
991d9fa0
JT
885 }
886 }
887}
888
e49e5829
JT
889/*
890 * A non-zero return indicates read_only or fail_io mode.
891 * Many callers don't care about the return value.
892 */
020cc3b5 893static int commit(struct pool *pool)
e49e5829
JT
894{
895 int r;
896
897 if (get_pool_mode(pool) != PM_WRITE)
898 return -EINVAL;
899
020cc3b5 900 r = dm_pool_commit_metadata(pool->pmd);
b5330655
JT
901 if (r)
902 metadata_operation_failed(pool, "dm_pool_commit_metadata", r);
e49e5829
JT
903
904 return r;
905}
906
88a6621b
JT
907static void check_low_water_mark(struct pool *pool, dm_block_t free_blocks)
908{
909 unsigned long flags;
910
911 if (free_blocks <= pool->low_water_blocks && !pool->low_water_triggered) {
912 DMWARN("%s: reached low water mark for data device: sending event.",
913 dm_device_name(pool->pool_md));
914 spin_lock_irqsave(&pool->lock, flags);
915 pool->low_water_triggered = true;
916 spin_unlock_irqrestore(&pool->lock, flags);
917 dm_table_event(pool->ti->table);
918 }
919}
920
991d9fa0
JT
921static int alloc_data_block(struct thin_c *tc, dm_block_t *result)
922{
923 int r;
924 dm_block_t free_blocks;
925 unsigned long flags;
926 struct pool *pool = tc->pool;
927
94563bad
MS
928 /*
929 * Once no_free_space is set we must not allow allocation to succeed.
930 * Otherwise it is difficult to explain, debug, test and support.
931 */
932 if (pool->no_free_space)
933 return -ENOSPC;
934
8d30abff
JT
935 if (get_pool_mode(pool) != PM_WRITE)
936 return -EINVAL;
937
991d9fa0 938 r = dm_pool_get_free_block_count(pool->pmd, &free_blocks);
b5330655
JT
939 if (r) {
940 metadata_operation_failed(pool, "dm_pool_get_free_block_count", r);
991d9fa0 941 return r;
b5330655 942 }
991d9fa0 943
88a6621b 944 check_low_water_mark(pool, free_blocks);
991d9fa0
JT
945
946 if (!free_blocks) {
94563bad
MS
947 /*
948 * Try to commit to see if that will free up some
949 * more space.
950 */
020cc3b5
JT
951 r = commit(pool);
952 if (r)
953 return r;
991d9fa0 954
94563bad 955 r = dm_pool_get_free_block_count(pool->pmd, &free_blocks);
b5330655
JT
956 if (r) {
957 metadata_operation_failed(pool, "dm_pool_get_free_block_count", r);
94563bad 958 return r;
b5330655 959 }
991d9fa0 960
94563bad
MS
961 /*
962 * If we still have no space we set a flag to avoid
963 * doing all this checking and return -ENOSPC. This
964 * flag serves as a latch that disallows allocations from
965 * this pool until the admin takes action (e.g. resize or
966 * table reload).
967 */
968 if (!free_blocks) {
4a02b34e 969 DMWARN("%s: no free data space available.",
94563bad
MS
970 dm_device_name(pool->pool_md));
971 spin_lock_irqsave(&pool->lock, flags);
88a6621b 972 pool->no_free_space = true;
94563bad
MS
973 spin_unlock_irqrestore(&pool->lock, flags);
974 return -ENOSPC;
991d9fa0
JT
975 }
976 }
977
978 r = dm_pool_alloc_data_block(pool->pmd, result);
4a02b34e
MS
979 if (r) {
980 if (r == -ENOSPC &&
981 !dm_pool_get_free_metadata_block_count(pool->pmd, &free_blocks) &&
b5330655 982 !free_blocks)
4a02b34e
MS
983 DMWARN("%s: no free metadata space available.",
984 dm_device_name(pool->pool_md));
b5330655
JT
985
986 metadata_operation_failed(pool, "dm_pool_alloc_data_block", r);
991d9fa0 987 return r;
4a02b34e 988 }
991d9fa0
JT
989
990 return 0;
991}
992
993/*
994 * If we have run out of space, queue bios until the device is
995 * resumed, presumably after having been reloaded with more space.
996 */
997static void retry_on_resume(struct bio *bio)
998{
59c3d2c6 999 struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
eb2aa48d 1000 struct thin_c *tc = h->tc;
991d9fa0
JT
1001 struct pool *pool = tc->pool;
1002 unsigned long flags;
1003
1004 spin_lock_irqsave(&pool->lock, flags);
1005 bio_list_add(&pool->retry_on_resume_list, bio);
1006 spin_unlock_irqrestore(&pool->lock, flags);
1007}
1008
6beca5eb 1009static void no_space(struct pool *pool, struct dm_bio_prison_cell *cell)
991d9fa0
JT
1010{
1011 struct bio *bio;
1012 struct bio_list bios;
1013
1014 bio_list_init(&bios);
6beca5eb 1015 cell_release(pool, cell, &bios);
991d9fa0
JT
1016
1017 while ((bio = bio_list_pop(&bios)))
1018 retry_on_resume(bio);
1019}
1020
104655fd
JT
1021static void process_discard(struct thin_c *tc, struct bio *bio)
1022{
1023 int r;
c3a0ce2e 1024 unsigned long flags;
104655fd 1025 struct pool *pool = tc->pool;
a24c2569 1026 struct dm_bio_prison_cell *cell, *cell2;
44feb387 1027 struct dm_cell_key key, key2;
104655fd
JT
1028 dm_block_t block = get_bio_block(tc, bio);
1029 struct dm_thin_lookup_result lookup_result;
a24c2569 1030 struct dm_thin_new_mapping *m;
104655fd
JT
1031
1032 build_virtual_key(tc->td, block, &key);
6beca5eb 1033 if (bio_detain(tc->pool, &key, bio, &cell))
104655fd
JT
1034 return;
1035
1036 r = dm_thin_find_block(tc->td, block, 1, &lookup_result);
1037 switch (r) {
1038 case 0:
1039 /*
1040 * Check nobody is fiddling with this pool block. This can
1041 * happen if someone's in the process of breaking sharing
1042 * on this block.
1043 */
1044 build_data_key(tc->td, lookup_result.block, &key2);
6beca5eb 1045 if (bio_detain(tc->pool, &key2, bio, &cell2)) {
f286ba0e 1046 cell_defer_no_holder(tc, cell);
104655fd
JT
1047 break;
1048 }
1049
1050 if (io_overlaps_block(pool, bio)) {
1051 /*
1052 * IO may still be going to the destination block. We must
1053 * quiesce before we can do the removal.
1054 */
1055 m = get_next_mapping(pool);
1056 m->tc = tc;
19fa1a67
JT
1057 m->pass_discard = pool->pf.discard_passdown;
1058 m->definitely_not_shared = !lookup_result.shared;
104655fd
JT
1059 m->virt_block = block;
1060 m->data_block = lookup_result.block;
1061 m->cell = cell;
1062 m->cell2 = cell2;
104655fd
JT
1063 m->bio = bio;
1064
44feb387 1065 if (!dm_deferred_set_add_work(pool->all_io_ds, &m->list)) {
c3a0ce2e 1066 spin_lock_irqsave(&pool->lock, flags);
daec338b 1067 list_add_tail(&m->list, &pool->prepared_discards);
c3a0ce2e 1068 spin_unlock_irqrestore(&pool->lock, flags);
104655fd
JT
1069 wake_worker(pool);
1070 }
1071 } else {
e8088073 1072 inc_all_io_entry(pool, bio);
f286ba0e
JT
1073 cell_defer_no_holder(tc, cell);
1074 cell_defer_no_holder(tc, cell2);
e8088073 1075
104655fd 1076 /*
49296309
MP
1077 * The DM core makes sure that the discard doesn't span
1078 * a block boundary. So we submit the discard of a
1079 * partial block appropriately.
104655fd 1080 */
650d2a06
MP
1081 if ((!lookup_result.shared) && pool->pf.discard_passdown)
1082 remap_and_issue(tc, bio, lookup_result.block);
1083 else
1084 bio_endio(bio, 0);
104655fd
JT
1085 }
1086 break;
1087
1088 case -ENODATA:
1089 /*
1090 * It isn't provisioned, just forget it.
1091 */
f286ba0e 1092 cell_defer_no_holder(tc, cell);
104655fd
JT
1093 bio_endio(bio, 0);
1094 break;
1095
1096 default:
c397741c
MS
1097 DMERR_LIMIT("%s: dm_thin_find_block() failed: error = %d",
1098 __func__, r);
f286ba0e 1099 cell_defer_no_holder(tc, cell);
104655fd
JT
1100 bio_io_error(bio);
1101 break;
1102 }
1103}
1104
991d9fa0 1105static void break_sharing(struct thin_c *tc, struct bio *bio, dm_block_t block,
44feb387 1106 struct dm_cell_key *key,
991d9fa0 1107 struct dm_thin_lookup_result *lookup_result,
a24c2569 1108 struct dm_bio_prison_cell *cell)
991d9fa0
JT
1109{
1110 int r;
1111 dm_block_t data_block;
d6fc2042 1112 struct pool *pool = tc->pool;
991d9fa0
JT
1113
1114 r = alloc_data_block(tc, &data_block);
1115 switch (r) {
1116 case 0:
2dd9c257
JT
1117 schedule_internal_copy(tc, block, lookup_result->block,
1118 data_block, cell, bio);
991d9fa0
JT
1119 break;
1120
1121 case -ENOSPC:
d6fc2042 1122 no_space(pool, cell);
991d9fa0
JT
1123 break;
1124
1125 default:
c397741c
MS
1126 DMERR_LIMIT("%s: alloc_data_block() failed: error = %d",
1127 __func__, r);
d6fc2042 1128 cell_error(pool, cell);
991d9fa0
JT
1129 break;
1130 }
1131}
1132
1133static void process_shared_bio(struct thin_c *tc, struct bio *bio,
1134 dm_block_t block,
1135 struct dm_thin_lookup_result *lookup_result)
1136{
a24c2569 1137 struct dm_bio_prison_cell *cell;
991d9fa0 1138 struct pool *pool = tc->pool;
44feb387 1139 struct dm_cell_key key;
991d9fa0
JT
1140
1141 /*
1142 * If cell is already occupied, then sharing is already in the process
1143 * of being broken so we have nothing further to do here.
1144 */
1145 build_data_key(tc->td, lookup_result->block, &key);
6beca5eb 1146 if (bio_detain(pool, &key, bio, &cell))
991d9fa0
JT
1147 return;
1148
60049701 1149 if (bio_data_dir(bio) == WRITE && bio->bi_size)
991d9fa0
JT
1150 break_sharing(tc, bio, block, &key, lookup_result, cell);
1151 else {
59c3d2c6 1152 struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
991d9fa0 1153
44feb387 1154 h->shared_read_entry = dm_deferred_entry_inc(pool->shared_read_ds);
e8088073 1155 inc_all_io_entry(pool, bio);
f286ba0e 1156 cell_defer_no_holder(tc, cell);
e8088073 1157
991d9fa0
JT
1158 remap_and_issue(tc, bio, lookup_result->block);
1159 }
1160}
1161
1162static void provision_block(struct thin_c *tc, struct bio *bio, dm_block_t block,
a24c2569 1163 struct dm_bio_prison_cell *cell)
991d9fa0
JT
1164{
1165 int r;
1166 dm_block_t data_block;
6beca5eb 1167 struct pool *pool = tc->pool;
991d9fa0
JT
1168
1169 /*
1170 * Remap empty bios (flushes) immediately, without provisioning.
1171 */
1172 if (!bio->bi_size) {
6beca5eb 1173 inc_all_io_entry(pool, bio);
f286ba0e 1174 cell_defer_no_holder(tc, cell);
e8088073 1175
991d9fa0
JT
1176 remap_and_issue(tc, bio, 0);
1177 return;
1178 }
1179
1180 /*
1181 * Fill read bios with zeroes and complete them immediately.
1182 */
1183 if (bio_data_dir(bio) == READ) {
1184 zero_fill_bio(bio);
f286ba0e 1185 cell_defer_no_holder(tc, cell);
991d9fa0
JT
1186 bio_endio(bio, 0);
1187 return;
1188 }
1189
1190 r = alloc_data_block(tc, &data_block);
1191 switch (r) {
1192 case 0:
2dd9c257
JT
1193 if (tc->origin_dev)
1194 schedule_external_copy(tc, block, data_block, cell, bio);
1195 else
1196 schedule_zero(tc, block, data_block, cell, bio);
991d9fa0
JT
1197 break;
1198
1199 case -ENOSPC:
6beca5eb 1200 no_space(pool, cell);
991d9fa0
JT
1201 break;
1202
1203 default:
c397741c
MS
1204 DMERR_LIMIT("%s: alloc_data_block() failed: error = %d",
1205 __func__, r);
6beca5eb 1206 cell_error(pool, cell);
991d9fa0
JT
1207 break;
1208 }
1209}
1210
1211static void process_bio(struct thin_c *tc, struct bio *bio)
1212{
1213 int r;
6beca5eb 1214 struct pool *pool = tc->pool;
991d9fa0 1215 dm_block_t block = get_bio_block(tc, bio);
a24c2569 1216 struct dm_bio_prison_cell *cell;
44feb387 1217 struct dm_cell_key key;
991d9fa0
JT
1218 struct dm_thin_lookup_result lookup_result;
1219
1220 /*
1221 * If cell is already occupied, then the block is already
1222 * being provisioned so we have nothing further to do here.
1223 */
1224 build_virtual_key(tc->td, block, &key);
6beca5eb 1225 if (bio_detain(pool, &key, bio, &cell))
991d9fa0
JT
1226 return;
1227
1228 r = dm_thin_find_block(tc->td, block, 1, &lookup_result);
1229 switch (r) {
1230 case 0:
e8088073 1231 if (lookup_result.shared) {
991d9fa0 1232 process_shared_bio(tc, bio, block, &lookup_result);
6beca5eb 1233 cell_defer_no_holder(tc, cell); /* FIXME: pass this cell into process_shared? */
e8088073 1234 } else {
6beca5eb 1235 inc_all_io_entry(pool, bio);
f286ba0e 1236 cell_defer_no_holder(tc, cell);
e8088073 1237
991d9fa0 1238 remap_and_issue(tc, bio, lookup_result.block);
e8088073 1239 }
991d9fa0
JT
1240 break;
1241
1242 case -ENODATA:
2dd9c257 1243 if (bio_data_dir(bio) == READ && tc->origin_dev) {
6beca5eb 1244 inc_all_io_entry(pool, bio);
f286ba0e 1245 cell_defer_no_holder(tc, cell);
e8088073 1246
2dd9c257
JT
1247 remap_to_origin_and_issue(tc, bio);
1248 } else
1249 provision_block(tc, bio, block, cell);
991d9fa0
JT
1250 break;
1251
1252 default:
c397741c
MS
1253 DMERR_LIMIT("%s: dm_thin_find_block() failed: error = %d",
1254 __func__, r);
f286ba0e 1255 cell_defer_no_holder(tc, cell);
991d9fa0
JT
1256 bio_io_error(bio);
1257 break;
1258 }
1259}
1260
e49e5829
JT
1261static void process_bio_read_only(struct thin_c *tc, struct bio *bio)
1262{
1263 int r;
1264 int rw = bio_data_dir(bio);
1265 dm_block_t block = get_bio_block(tc, bio);
1266 struct dm_thin_lookup_result lookup_result;
1267
1268 r = dm_thin_find_block(tc->td, block, 1, &lookup_result);
1269 switch (r) {
1270 case 0:
1271 if (lookup_result.shared && (rw == WRITE) && bio->bi_size)
1272 bio_io_error(bio);
e8088073
JT
1273 else {
1274 inc_all_io_entry(tc->pool, bio);
e49e5829 1275 remap_and_issue(tc, bio, lookup_result.block);
e8088073 1276 }
e49e5829
JT
1277 break;
1278
1279 case -ENODATA:
1280 if (rw != READ) {
1281 bio_io_error(bio);
1282 break;
1283 }
1284
1285 if (tc->origin_dev) {
e8088073 1286 inc_all_io_entry(tc->pool, bio);
e49e5829
JT
1287 remap_to_origin_and_issue(tc, bio);
1288 break;
1289 }
1290
1291 zero_fill_bio(bio);
1292 bio_endio(bio, 0);
1293 break;
1294
1295 default:
c397741c
MS
1296 DMERR_LIMIT("%s: dm_thin_find_block() failed: error = %d",
1297 __func__, r);
e49e5829
JT
1298 bio_io_error(bio);
1299 break;
1300 }
1301}
1302
1303static void process_bio_fail(struct thin_c *tc, struct bio *bio)
1304{
1305 bio_io_error(bio);
1306}
1307
ac8c3f3d
JT
1308/*
1309 * FIXME: should we also commit due to size of transaction, measured in
1310 * metadata blocks?
1311 */
905e51b3
JT
1312static int need_commit_due_to_time(struct pool *pool)
1313{
1314 return jiffies < pool->last_commit_jiffies ||
1315 jiffies > pool->last_commit_jiffies + COMMIT_PERIOD;
1316}
1317
991d9fa0
JT
1318static void process_deferred_bios(struct pool *pool)
1319{
1320 unsigned long flags;
1321 struct bio *bio;
1322 struct bio_list bios;
991d9fa0
JT
1323
1324 bio_list_init(&bios);
1325
1326 spin_lock_irqsave(&pool->lock, flags);
1327 bio_list_merge(&bios, &pool->deferred_bios);
1328 bio_list_init(&pool->deferred_bios);
1329 spin_unlock_irqrestore(&pool->lock, flags);
1330
1331 while ((bio = bio_list_pop(&bios))) {
59c3d2c6 1332 struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
eb2aa48d
JT
1333 struct thin_c *tc = h->tc;
1334
991d9fa0
JT
1335 /*
1336 * If we've got no free new_mapping structs, and processing
1337 * this bio might require one, we pause until there are some
1338 * prepared mappings to process.
1339 */
1340 if (ensure_next_mapping(pool)) {
1341 spin_lock_irqsave(&pool->lock, flags);
1342 bio_list_merge(&pool->deferred_bios, &bios);
1343 spin_unlock_irqrestore(&pool->lock, flags);
1344
1345 break;
1346 }
104655fd
JT
1347
1348 if (bio->bi_rw & REQ_DISCARD)
e49e5829 1349 pool->process_discard(tc, bio);
104655fd 1350 else
e49e5829 1351 pool->process_bio(tc, bio);
991d9fa0
JT
1352 }
1353
1354 /*
1355 * If there are any deferred flush bios, we must commit
1356 * the metadata before issuing them.
1357 */
1358 bio_list_init(&bios);
1359 spin_lock_irqsave(&pool->lock, flags);
1360 bio_list_merge(&bios, &pool->deferred_flush_bios);
1361 bio_list_init(&pool->deferred_flush_bios);
1362 spin_unlock_irqrestore(&pool->lock, flags);
1363
905e51b3 1364 if (bio_list_empty(&bios) && !need_commit_due_to_time(pool))
991d9fa0
JT
1365 return;
1366
020cc3b5 1367 if (commit(pool)) {
991d9fa0
JT
1368 while ((bio = bio_list_pop(&bios)))
1369 bio_io_error(bio);
1370 return;
1371 }
905e51b3 1372 pool->last_commit_jiffies = jiffies;
991d9fa0
JT
1373
1374 while ((bio = bio_list_pop(&bios)))
1375 generic_make_request(bio);
1376}
1377
1378static void do_worker(struct work_struct *ws)
1379{
1380 struct pool *pool = container_of(ws, struct pool, worker);
1381
e49e5829
JT
1382 process_prepared(pool, &pool->prepared_mappings, &pool->process_prepared_mapping);
1383 process_prepared(pool, &pool->prepared_discards, &pool->process_prepared_discard);
991d9fa0
JT
1384 process_deferred_bios(pool);
1385}
1386
905e51b3
JT
1387/*
1388 * We want to commit periodically so that not too much
1389 * unwritten data builds up.
1390 */
1391static void do_waker(struct work_struct *ws)
1392{
1393 struct pool *pool = container_of(to_delayed_work(ws), struct pool, waker);
1394 wake_worker(pool);
1395 queue_delayed_work(pool->wq, &pool->waker, COMMIT_PERIOD);
1396}
1397
991d9fa0
JT
1398/*----------------------------------------------------------------*/
1399
e49e5829
JT
1400static enum pool_mode get_pool_mode(struct pool *pool)
1401{
1402 return pool->pf.mode;
1403}
1404
1405static void set_pool_mode(struct pool *pool, enum pool_mode mode)
1406{
1407 int r;
1408
1409 pool->pf.mode = mode;
1410
1411 switch (mode) {
1412 case PM_FAIL:
4fa5971a
MS
1413 DMERR("%s: switching pool to failure mode",
1414 dm_device_name(pool->pool_md));
5383ef3a 1415 dm_pool_metadata_read_only(pool->pmd);
e49e5829
JT
1416 pool->process_bio = process_bio_fail;
1417 pool->process_discard = process_bio_fail;
1418 pool->process_prepared_mapping = process_prepared_mapping_fail;
1419 pool->process_prepared_discard = process_prepared_discard_fail;
1420 break;
1421
1422 case PM_READ_ONLY:
4fa5971a
MS
1423 DMERR("%s: switching pool to read-only mode",
1424 dm_device_name(pool->pool_md));
e49e5829
JT
1425 r = dm_pool_abort_metadata(pool->pmd);
1426 if (r) {
4fa5971a
MS
1427 DMERR("%s: aborting transaction failed",
1428 dm_device_name(pool->pool_md));
e49e5829
JT
1429 set_pool_mode(pool, PM_FAIL);
1430 } else {
1431 dm_pool_metadata_read_only(pool->pmd);
1432 pool->process_bio = process_bio_read_only;
1433 pool->process_discard = process_discard;
1434 pool->process_prepared_mapping = process_prepared_mapping_fail;
1435 pool->process_prepared_discard = process_prepared_discard_passdown;
1436 }
1437 break;
1438
1439 case PM_WRITE:
9b7aaa64 1440 dm_pool_metadata_read_write(pool->pmd);
e49e5829
JT
1441 pool->process_bio = process_bio;
1442 pool->process_discard = process_discard;
1443 pool->process_prepared_mapping = process_prepared_mapping;
1444 pool->process_prepared_discard = process_prepared_discard;
1445 break;
1446 }
1447}
1448
b5330655
JT
1449/*
1450 * Rather than calling set_pool_mode directly, use these which describe the
1451 * reason for mode degradation.
1452 */
1453static void metadata_operation_failed(struct pool *pool, const char *op, int r)
1454{
1455 DMERR_LIMIT("%s: metadata operation '%s' failed: error = %d",
1456 dm_device_name(pool->pool_md), op, r);
1457
1458 set_pool_mode(pool, PM_READ_ONLY);
1459}
1460
e49e5829
JT
1461/*----------------------------------------------------------------*/
1462
991d9fa0
JT
1463/*
1464 * Mapping functions.
1465 */
1466
1467/*
1468 * Called only while mapping a thin bio to hand it over to the workqueue.
1469 */
1470static void thin_defer_bio(struct thin_c *tc, struct bio *bio)
1471{
1472 unsigned long flags;
1473 struct pool *pool = tc->pool;
1474
1475 spin_lock_irqsave(&pool->lock, flags);
1476 bio_list_add(&pool->deferred_bios, bio);
1477 spin_unlock_irqrestore(&pool->lock, flags);
1478
1479 wake_worker(pool);
1480}
1481
59c3d2c6 1482static void thin_hook_bio(struct thin_c *tc, struct bio *bio)
eb2aa48d 1483{
59c3d2c6 1484 struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
eb2aa48d
JT
1485
1486 h->tc = tc;
1487 h->shared_read_entry = NULL;
e8088073 1488 h->all_io_entry = NULL;
eb2aa48d 1489 h->overwrite_mapping = NULL;
eb2aa48d
JT
1490}
1491
991d9fa0
JT
1492/*
1493 * Non-blocking function called from the thin target's map function.
1494 */
7de3ee57 1495static int thin_bio_map(struct dm_target *ti, struct bio *bio)
991d9fa0
JT
1496{
1497 int r;
1498 struct thin_c *tc = ti->private;
1499 dm_block_t block = get_bio_block(tc, bio);
1500 struct dm_thin_device *td = tc->td;
1501 struct dm_thin_lookup_result result;
025b9685
JT
1502 struct dm_bio_prison_cell cell1, cell2;
1503 struct dm_bio_prison_cell *cell_result;
e8088073 1504 struct dm_cell_key key;
991d9fa0 1505
59c3d2c6 1506 thin_hook_bio(tc, bio);
e49e5829
JT
1507
1508 if (get_pool_mode(tc->pool) == PM_FAIL) {
1509 bio_io_error(bio);
1510 return DM_MAPIO_SUBMITTED;
1511 }
1512
104655fd 1513 if (bio->bi_rw & (REQ_DISCARD | REQ_FLUSH | REQ_FUA)) {
991d9fa0
JT
1514 thin_defer_bio(tc, bio);
1515 return DM_MAPIO_SUBMITTED;
1516 }
1517
1518 r = dm_thin_find_block(td, block, 0, &result);
1519
1520 /*
1521 * Note that we defer readahead too.
1522 */
1523 switch (r) {
1524 case 0:
1525 if (unlikely(result.shared)) {
1526 /*
1527 * We have a race condition here between the
1528 * result.shared value returned by the lookup and
1529 * snapshot creation, which may cause new
1530 * sharing.
1531 *
1532 * To avoid this always quiesce the origin before
1533 * taking the snap. You want to do this anyway to
1534 * ensure a consistent application view
1535 * (i.e. lockfs).
1536 *
1537 * More distant ancestors are irrelevant. The
1538 * shared flag will be set in their case.
1539 */
1540 thin_defer_bio(tc, bio);
e8088073 1541 return DM_MAPIO_SUBMITTED;
991d9fa0 1542 }
e8088073
JT
1543
1544 build_virtual_key(tc->td, block, &key);
025b9685 1545 if (dm_bio_detain(tc->pool->prison, &key, bio, &cell1, &cell_result))
e8088073
JT
1546 return DM_MAPIO_SUBMITTED;
1547
1548 build_data_key(tc->td, result.block, &key);
025b9685
JT
1549 if (dm_bio_detain(tc->pool->prison, &key, bio, &cell2, &cell_result)) {
1550 cell_defer_no_holder_no_free(tc, &cell1);
e8088073
JT
1551 return DM_MAPIO_SUBMITTED;
1552 }
1553
1554 inc_all_io_entry(tc->pool, bio);
025b9685
JT
1555 cell_defer_no_holder_no_free(tc, &cell2);
1556 cell_defer_no_holder_no_free(tc, &cell1);
e8088073
JT
1557
1558 remap(tc, bio, result.block);
1559 return DM_MAPIO_REMAPPED;
991d9fa0
JT
1560
1561 case -ENODATA:
e49e5829
JT
1562 if (get_pool_mode(tc->pool) == PM_READ_ONLY) {
1563 /*
1564 * This block isn't provisioned, and we have no way
1565 * of doing so. Just error it.
1566 */
1567 bio_io_error(bio);
2aab3850 1568 return DM_MAPIO_SUBMITTED;
e49e5829
JT
1569 }
1570 /* fall through */
1571
1572 case -EWOULDBLOCK:
991d9fa0
JT
1573 /*
1574 * In future, the failed dm_thin_find_block above could
1575 * provide the hint to load the metadata into cache.
1576 */
991d9fa0 1577 thin_defer_bio(tc, bio);
2aab3850 1578 return DM_MAPIO_SUBMITTED;
e49e5829
JT
1579
1580 default:
1581 /*
1582 * Must always call bio_io_error on failure.
1583 * dm_thin_find_block can fail with -EINVAL if the
1584 * pool is switched to fail-io mode.
1585 */
1586 bio_io_error(bio);
2aab3850 1587 return DM_MAPIO_SUBMITTED;
991d9fa0 1588 }
991d9fa0
JT
1589}
1590
1591static int pool_is_congested(struct dm_target_callbacks *cb, int bdi_bits)
1592{
1593 int r;
1594 unsigned long flags;
1595 struct pool_c *pt = container_of(cb, struct pool_c, callbacks);
1596
1597 spin_lock_irqsave(&pt->pool->lock, flags);
1598 r = !bio_list_empty(&pt->pool->retry_on_resume_list);
1599 spin_unlock_irqrestore(&pt->pool->lock, flags);
1600
1601 if (!r) {
1602 struct request_queue *q = bdev_get_queue(pt->data_dev->bdev);
1603 r = bdi_congested(&q->backing_dev_info, bdi_bits);
1604 }
1605
1606 return r;
1607}
1608
1609static void __requeue_bios(struct pool *pool)
1610{
1611 bio_list_merge(&pool->deferred_bios, &pool->retry_on_resume_list);
1612 bio_list_init(&pool->retry_on_resume_list);
1613}
1614
1615/*----------------------------------------------------------------
1616 * Binding of control targets to a pool object
1617 *--------------------------------------------------------------*/
9bc142dd
MS
1618static bool data_dev_supports_discard(struct pool_c *pt)
1619{
1620 struct request_queue *q = bdev_get_queue(pt->data_dev->bdev);
1621
1622 return q && blk_queue_discard(q);
1623}
1624
58051b94
JT
1625static bool is_factor(sector_t block_size, uint32_t n)
1626{
1627 return !sector_div(block_size, n);
1628}
1629
9bc142dd
MS
1630/*
1631 * If discard_passdown was enabled verify that the data device
0424caa1 1632 * supports discards. Disable discard_passdown if not.
9bc142dd 1633 */
0424caa1 1634static void disable_passdown_if_not_supported(struct pool_c *pt)
9bc142dd 1635{
0424caa1
MS
1636 struct pool *pool = pt->pool;
1637 struct block_device *data_bdev = pt->data_dev->bdev;
1638 struct queue_limits *data_limits = &bdev_get_queue(data_bdev)->limits;
1639 sector_t block_size = pool->sectors_per_block << SECTOR_SHIFT;
1640 const char *reason = NULL;
9bc142dd
MS
1641 char buf[BDEVNAME_SIZE];
1642
0424caa1 1643 if (!pt->adjusted_pf.discard_passdown)
9bc142dd
MS
1644 return;
1645
0424caa1
MS
1646 if (!data_dev_supports_discard(pt))
1647 reason = "discard unsupported";
1648
1649 else if (data_limits->max_discard_sectors < pool->sectors_per_block)
1650 reason = "max discard sectors smaller than a block";
9bc142dd 1651
0424caa1
MS
1652 else if (data_limits->discard_granularity > block_size)
1653 reason = "discard granularity larger than a block";
1654
58051b94 1655 else if (!is_factor(block_size, data_limits->discard_granularity))
0424caa1
MS
1656 reason = "discard granularity not a factor of block size";
1657
1658 if (reason) {
1659 DMWARN("Data device (%s) %s: Disabling discard passdown.", bdevname(data_bdev, buf), reason);
1660 pt->adjusted_pf.discard_passdown = false;
1661 }
9bc142dd
MS
1662}
1663
991d9fa0
JT
1664static int bind_control_target(struct pool *pool, struct dm_target *ti)
1665{
1666 struct pool_c *pt = ti->private;
1667
e49e5829 1668 /*
9b7aaa64 1669 * We want to make sure that a pool in PM_FAIL mode is never upgraded.
e49e5829
JT
1670 */
1671 enum pool_mode old_mode = pool->pf.mode;
0424caa1 1672 enum pool_mode new_mode = pt->adjusted_pf.mode;
e49e5829 1673
9b7aaa64
JT
1674 /*
1675 * If we were in PM_FAIL mode, rollback of metadata failed. We're
1676 * not going to recover without a thin_repair. So we never let the
1677 * pool move out of the old mode. On the other hand a PM_READ_ONLY
1678 * may have been due to a lack of metadata or data space, and may
1679 * now work (ie. if the underlying devices have been resized).
1680 */
1681 if (old_mode == PM_FAIL)
e49e5829
JT
1682 new_mode = old_mode;
1683
991d9fa0
JT
1684 pool->ti = ti;
1685 pool->low_water_blocks = pt->low_water_blocks;
0424caa1 1686 pool->pf = pt->adjusted_pf;
991d9fa0 1687
9bc142dd 1688 set_pool_mode(pool, new_mode);
f402693d 1689
991d9fa0
JT
1690 return 0;
1691}
1692
1693static void unbind_control_target(struct pool *pool, struct dm_target *ti)
1694{
1695 if (pool->ti == ti)
1696 pool->ti = NULL;
1697}
1698
1699/*----------------------------------------------------------------
1700 * Pool creation
1701 *--------------------------------------------------------------*/
67e2e2b2
JT
1702/* Initialize pool features. */
1703static void pool_features_init(struct pool_features *pf)
1704{
e49e5829 1705 pf->mode = PM_WRITE;
9bc142dd
MS
1706 pf->zero_new_blocks = true;
1707 pf->discard_enabled = true;
1708 pf->discard_passdown = true;
67e2e2b2
JT
1709}
1710
991d9fa0
JT
1711static void __pool_destroy(struct pool *pool)
1712{
1713 __pool_table_remove(pool);
1714
1715 if (dm_pool_metadata_close(pool->pmd) < 0)
1716 DMWARN("%s: dm_pool_metadata_close() failed.", __func__);
1717
44feb387 1718 dm_bio_prison_destroy(pool->prison);
991d9fa0
JT
1719 dm_kcopyd_client_destroy(pool->copier);
1720
1721 if (pool->wq)
1722 destroy_workqueue(pool->wq);
1723
1724 if (pool->next_mapping)
1725 mempool_free(pool->next_mapping, pool->mapping_pool);
1726 mempool_destroy(pool->mapping_pool);
44feb387
MS
1727 dm_deferred_set_destroy(pool->shared_read_ds);
1728 dm_deferred_set_destroy(pool->all_io_ds);
991d9fa0
JT
1729 kfree(pool);
1730}
1731
a24c2569 1732static struct kmem_cache *_new_mapping_cache;
a24c2569 1733
991d9fa0
JT
1734static struct pool *pool_create(struct mapped_device *pool_md,
1735 struct block_device *metadata_dev,
e49e5829
JT
1736 unsigned long block_size,
1737 int read_only, char **error)
991d9fa0
JT
1738{
1739 int r;
1740 void *err_p;
1741 struct pool *pool;
1742 struct dm_pool_metadata *pmd;
e49e5829 1743 bool format_device = read_only ? false : true;
991d9fa0 1744
e49e5829 1745 pmd = dm_pool_metadata_open(metadata_dev, block_size, format_device);
991d9fa0
JT
1746 if (IS_ERR(pmd)) {
1747 *error = "Error creating metadata object";
1748 return (struct pool *)pmd;
1749 }
1750
1751 pool = kmalloc(sizeof(*pool), GFP_KERNEL);
1752 if (!pool) {
1753 *error = "Error allocating memory for pool";
1754 err_p = ERR_PTR(-ENOMEM);
1755 goto bad_pool;
1756 }
1757
1758 pool->pmd = pmd;
1759 pool->sectors_per_block = block_size;
f9a8e0cd
MP
1760 if (block_size & (block_size - 1))
1761 pool->sectors_per_block_shift = -1;
1762 else
1763 pool->sectors_per_block_shift = __ffs(block_size);
991d9fa0 1764 pool->low_water_blocks = 0;
67e2e2b2 1765 pool_features_init(&pool->pf);
44feb387 1766 pool->prison = dm_bio_prison_create(PRISON_CELLS);
991d9fa0
JT
1767 if (!pool->prison) {
1768 *error = "Error creating pool's bio prison";
1769 err_p = ERR_PTR(-ENOMEM);
1770 goto bad_prison;
1771 }
1772
df5d2e90 1773 pool->copier = dm_kcopyd_client_create(&dm_kcopyd_throttle);
991d9fa0
JT
1774 if (IS_ERR(pool->copier)) {
1775 r = PTR_ERR(pool->copier);
1776 *error = "Error creating pool's kcopyd client";
1777 err_p = ERR_PTR(r);
1778 goto bad_kcopyd_client;
1779 }
1780
1781 /*
1782 * Create singlethreaded workqueue that will service all devices
1783 * that use this metadata.
1784 */
1785 pool->wq = alloc_ordered_workqueue("dm-" DM_MSG_PREFIX, WQ_MEM_RECLAIM);
1786 if (!pool->wq) {
1787 *error = "Error creating pool's workqueue";
1788 err_p = ERR_PTR(-ENOMEM);
1789 goto bad_wq;
1790 }
1791
1792 INIT_WORK(&pool->worker, do_worker);
905e51b3 1793 INIT_DELAYED_WORK(&pool->waker, do_waker);
991d9fa0
JT
1794 spin_lock_init(&pool->lock);
1795 bio_list_init(&pool->deferred_bios);
1796 bio_list_init(&pool->deferred_flush_bios);
1797 INIT_LIST_HEAD(&pool->prepared_mappings);
104655fd 1798 INIT_LIST_HEAD(&pool->prepared_discards);
88a6621b
JT
1799 pool->low_water_triggered = false;
1800 pool->no_free_space = false;
991d9fa0 1801 bio_list_init(&pool->retry_on_resume_list);
44feb387
MS
1802
1803 pool->shared_read_ds = dm_deferred_set_create();
1804 if (!pool->shared_read_ds) {
1805 *error = "Error creating pool's shared read deferred set";
1806 err_p = ERR_PTR(-ENOMEM);
1807 goto bad_shared_read_ds;
1808 }
1809
1810 pool->all_io_ds = dm_deferred_set_create();
1811 if (!pool->all_io_ds) {
1812 *error = "Error creating pool's all io deferred set";
1813 err_p = ERR_PTR(-ENOMEM);
1814 goto bad_all_io_ds;
1815 }
991d9fa0
JT
1816
1817 pool->next_mapping = NULL;
a24c2569
MS
1818 pool->mapping_pool = mempool_create_slab_pool(MAPPING_POOL_SIZE,
1819 _new_mapping_cache);
991d9fa0
JT
1820 if (!pool->mapping_pool) {
1821 *error = "Error creating pool's mapping mempool";
1822 err_p = ERR_PTR(-ENOMEM);
1823 goto bad_mapping_pool;
1824 }
1825
991d9fa0 1826 pool->ref_count = 1;
905e51b3 1827 pool->last_commit_jiffies = jiffies;
991d9fa0
JT
1828 pool->pool_md = pool_md;
1829 pool->md_dev = metadata_dev;
1830 __pool_table_insert(pool);
1831
1832 return pool;
1833
991d9fa0 1834bad_mapping_pool:
44feb387
MS
1835 dm_deferred_set_destroy(pool->all_io_ds);
1836bad_all_io_ds:
1837 dm_deferred_set_destroy(pool->shared_read_ds);
1838bad_shared_read_ds:
991d9fa0
JT
1839 destroy_workqueue(pool->wq);
1840bad_wq:
1841 dm_kcopyd_client_destroy(pool->copier);
1842bad_kcopyd_client:
44feb387 1843 dm_bio_prison_destroy(pool->prison);
991d9fa0
JT
1844bad_prison:
1845 kfree(pool);
1846bad_pool:
1847 if (dm_pool_metadata_close(pmd))
1848 DMWARN("%s: dm_pool_metadata_close() failed.", __func__);
1849
1850 return err_p;
1851}
1852
1853static void __pool_inc(struct pool *pool)
1854{
1855 BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex));
1856 pool->ref_count++;
1857}
1858
1859static void __pool_dec(struct pool *pool)
1860{
1861 BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex));
1862 BUG_ON(!pool->ref_count);
1863 if (!--pool->ref_count)
1864 __pool_destroy(pool);
1865}
1866
1867static struct pool *__pool_find(struct mapped_device *pool_md,
1868 struct block_device *metadata_dev,
e49e5829
JT
1869 unsigned long block_size, int read_only,
1870 char **error, int *created)
991d9fa0
JT
1871{
1872 struct pool *pool = __pool_table_lookup_metadata_dev(metadata_dev);
1873
1874 if (pool) {
f09996c9
MS
1875 if (pool->pool_md != pool_md) {
1876 *error = "metadata device already in use by a pool";
991d9fa0 1877 return ERR_PTR(-EBUSY);
f09996c9 1878 }
991d9fa0
JT
1879 __pool_inc(pool);
1880
1881 } else {
1882 pool = __pool_table_lookup(pool_md);
1883 if (pool) {
f09996c9
MS
1884 if (pool->md_dev != metadata_dev) {
1885 *error = "different pool cannot replace a pool";
991d9fa0 1886 return ERR_PTR(-EINVAL);
f09996c9 1887 }
991d9fa0
JT
1888 __pool_inc(pool);
1889
67e2e2b2 1890 } else {
e49e5829 1891 pool = pool_create(pool_md, metadata_dev, block_size, read_only, error);
67e2e2b2
JT
1892 *created = 1;
1893 }
991d9fa0
JT
1894 }
1895
1896 return pool;
1897}
1898
1899/*----------------------------------------------------------------
1900 * Pool target methods
1901 *--------------------------------------------------------------*/
1902static void pool_dtr(struct dm_target *ti)
1903{
1904 struct pool_c *pt = ti->private;
1905
1906 mutex_lock(&dm_thin_pool_table.mutex);
1907
1908 unbind_control_target(pt->pool, ti);
1909 __pool_dec(pt->pool);
1910 dm_put_device(ti, pt->metadata_dev);
1911 dm_put_device(ti, pt->data_dev);
1912 kfree(pt);
1913
1914 mutex_unlock(&dm_thin_pool_table.mutex);
1915}
1916
991d9fa0
JT
1917static int parse_pool_features(struct dm_arg_set *as, struct pool_features *pf,
1918 struct dm_target *ti)
1919{
1920 int r;
1921 unsigned argc;
1922 const char *arg_name;
1923
1924 static struct dm_arg _args[] = {
67e2e2b2 1925 {0, 3, "Invalid number of pool feature arguments"},
991d9fa0
JT
1926 };
1927
1928 /*
1929 * No feature arguments supplied.
1930 */
1931 if (!as->argc)
1932 return 0;
1933
1934 r = dm_read_arg_group(_args, as, &argc, &ti->error);
1935 if (r)
1936 return -EINVAL;
1937
1938 while (argc && !r) {
1939 arg_name = dm_shift_arg(as);
1940 argc--;
1941
e49e5829 1942 if (!strcasecmp(arg_name, "skip_block_zeroing"))
9bc142dd 1943 pf->zero_new_blocks = false;
e49e5829
JT
1944
1945 else if (!strcasecmp(arg_name, "ignore_discard"))
9bc142dd 1946 pf->discard_enabled = false;
e49e5829
JT
1947
1948 else if (!strcasecmp(arg_name, "no_discard_passdown"))
9bc142dd 1949 pf->discard_passdown = false;
991d9fa0 1950
e49e5829
JT
1951 else if (!strcasecmp(arg_name, "read_only"))
1952 pf->mode = PM_READ_ONLY;
1953
1954 else {
1955 ti->error = "Unrecognised pool feature requested";
1956 r = -EINVAL;
1957 break;
1958 }
991d9fa0
JT
1959 }
1960
1961 return r;
1962}
1963
ac8c3f3d
JT
1964static void metadata_low_callback(void *context)
1965{
1966 struct pool *pool = context;
1967
1968 DMWARN("%s: reached low water mark for metadata device: sending event.",
1969 dm_device_name(pool->pool_md));
1970
1971 dm_table_event(pool->ti->table);
1972}
1973
b17446df
JT
1974static sector_t get_metadata_dev_size(struct block_device *bdev)
1975{
1976 sector_t metadata_dev_size = i_size_read(bdev->bd_inode) >> SECTOR_SHIFT;
1977 char buffer[BDEVNAME_SIZE];
1978
1979 if (metadata_dev_size > THIN_METADATA_MAX_SECTORS_WARNING) {
1980 DMWARN("Metadata device %s is larger than %u sectors: excess space will not be used.",
1981 bdevname(bdev, buffer), THIN_METADATA_MAX_SECTORS);
1982 metadata_dev_size = THIN_METADATA_MAX_SECTORS_WARNING;
1983 }
1984
1985 return metadata_dev_size;
1986}
1987
24347e95
JT
1988static dm_block_t get_metadata_dev_size_in_blocks(struct block_device *bdev)
1989{
1990 sector_t metadata_dev_size = get_metadata_dev_size(bdev);
1991
1992 sector_div(metadata_dev_size, THIN_METADATA_BLOCK_SIZE >> SECTOR_SHIFT);
1993
1994 return metadata_dev_size;
1995}
1996
ac8c3f3d
JT
1997/*
1998 * When a metadata threshold is crossed a dm event is triggered, and
1999 * userland should respond by growing the metadata device. We could let
2000 * userland set the threshold, like we do with the data threshold, but I'm
2001 * not sure they know enough to do this well.
2002 */
2003static dm_block_t calc_metadata_threshold(struct pool_c *pt)
2004{
2005 /*
2006 * 4M is ample for all ops with the possible exception of thin
2007 * device deletion which is harmless if it fails (just retry the
2008 * delete after you've grown the device).
2009 */
2010 dm_block_t quarter = get_metadata_dev_size_in_blocks(pt->metadata_dev->bdev) / 4;
2011 return min((dm_block_t)1024ULL /* 4M */, quarter);
2012}
2013
991d9fa0
JT
2014/*
2015 * thin-pool <metadata dev> <data dev>
2016 * <data block size (sectors)>
2017 * <low water mark (blocks)>
2018 * [<#feature args> [<arg>]*]
2019 *
2020 * Optional feature arguments are:
2021 * skip_block_zeroing: skips the zeroing of newly-provisioned blocks.
67e2e2b2
JT
2022 * ignore_discard: disable discard
2023 * no_discard_passdown: don't pass discards down to the data device
991d9fa0
JT
2024 */
2025static int pool_ctr(struct dm_target *ti, unsigned argc, char **argv)
2026{
67e2e2b2 2027 int r, pool_created = 0;
991d9fa0
JT
2028 struct pool_c *pt;
2029 struct pool *pool;
2030 struct pool_features pf;
2031 struct dm_arg_set as;
2032 struct dm_dev *data_dev;
2033 unsigned long block_size;
2034 dm_block_t low_water_blocks;
2035 struct dm_dev *metadata_dev;
5d0db96d 2036 fmode_t metadata_mode;
991d9fa0
JT
2037
2038 /*
2039 * FIXME Remove validation from scope of lock.
2040 */
2041 mutex_lock(&dm_thin_pool_table.mutex);
2042
2043 if (argc < 4) {
2044 ti->error = "Invalid argument count";
2045 r = -EINVAL;
2046 goto out_unlock;
2047 }
5d0db96d 2048
991d9fa0
JT
2049 as.argc = argc;
2050 as.argv = argv;
2051
5d0db96d
JT
2052 /*
2053 * Set default pool features.
2054 */
2055 pool_features_init(&pf);
2056
2057 dm_consume_args(&as, 4);
2058 r = parse_pool_features(&as, &pf, ti);
2059 if (r)
2060 goto out_unlock;
2061
2062 metadata_mode = FMODE_READ | ((pf.mode == PM_READ_ONLY) ? 0 : FMODE_WRITE);
2063 r = dm_get_device(ti, argv[0], metadata_mode, &metadata_dev);
991d9fa0
JT
2064 if (r) {
2065 ti->error = "Error opening metadata block device";
2066 goto out_unlock;
2067 }
2068
b17446df
JT
2069 /*
2070 * Run for the side-effect of possibly issuing a warning if the
2071 * device is too big.
2072 */
2073 (void) get_metadata_dev_size(metadata_dev->bdev);
991d9fa0
JT
2074
2075 r = dm_get_device(ti, argv[1], FMODE_READ | FMODE_WRITE, &data_dev);
2076 if (r) {
2077 ti->error = "Error getting data device";
2078 goto out_metadata;
2079 }
2080
2081 if (kstrtoul(argv[2], 10, &block_size) || !block_size ||
2082 block_size < DATA_DEV_BLOCK_SIZE_MIN_SECTORS ||
2083 block_size > DATA_DEV_BLOCK_SIZE_MAX_SECTORS ||
55f2b8bd 2084 block_size & (DATA_DEV_BLOCK_SIZE_MIN_SECTORS - 1)) {
991d9fa0
JT
2085 ti->error = "Invalid block size";
2086 r = -EINVAL;
2087 goto out;
2088 }
2089
2090 if (kstrtoull(argv[3], 10, (unsigned long long *)&low_water_blocks)) {
2091 ti->error = "Invalid low water mark";
2092 r = -EINVAL;
2093 goto out;
2094 }
2095
991d9fa0
JT
2096 pt = kzalloc(sizeof(*pt), GFP_KERNEL);
2097 if (!pt) {
2098 r = -ENOMEM;
2099 goto out;
2100 }
2101
2102 pool = __pool_find(dm_table_get_md(ti->table), metadata_dev->bdev,
e49e5829 2103 block_size, pf.mode == PM_READ_ONLY, &ti->error, &pool_created);
991d9fa0
JT
2104 if (IS_ERR(pool)) {
2105 r = PTR_ERR(pool);
2106 goto out_free_pt;
2107 }
2108
67e2e2b2
JT
2109 /*
2110 * 'pool_created' reflects whether this is the first table load.
2111 * Top level discard support is not allowed to be changed after
2112 * initial load. This would require a pool reload to trigger thin
2113 * device changes.
2114 */
2115 if (!pool_created && pf.discard_enabled != pool->pf.discard_enabled) {
2116 ti->error = "Discard support cannot be disabled once enabled";
2117 r = -EINVAL;
2118 goto out_flags_changed;
2119 }
2120
991d9fa0
JT
2121 pt->pool = pool;
2122 pt->ti = ti;
2123 pt->metadata_dev = metadata_dev;
2124 pt->data_dev = data_dev;
2125 pt->low_water_blocks = low_water_blocks;
0424caa1 2126 pt->adjusted_pf = pt->requested_pf = pf;
55a62eef 2127 ti->num_flush_bios = 1;
9bc142dd 2128
67e2e2b2
JT
2129 /*
2130 * Only need to enable discards if the pool should pass
2131 * them down to the data device. The thin device's discard
2132 * processing will cause mappings to be removed from the btree.
2133 */
b60ab990 2134 ti->discard_zeroes_data_unsupported = true;
67e2e2b2 2135 if (pf.discard_enabled && pf.discard_passdown) {
55a62eef 2136 ti->num_discard_bios = 1;
9bc142dd 2137
67e2e2b2
JT
2138 /*
2139 * Setting 'discards_supported' circumvents the normal
2140 * stacking of discard limits (this keeps the pool and
2141 * thin devices' discard limits consistent).
2142 */
0ac55489 2143 ti->discards_supported = true;
67e2e2b2 2144 }
991d9fa0
JT
2145 ti->private = pt;
2146
ac8c3f3d
JT
2147 r = dm_pool_register_metadata_threshold(pt->pool->pmd,
2148 calc_metadata_threshold(pt),
2149 metadata_low_callback,
2150 pool);
2151 if (r)
2152 goto out_free_pt;
2153
991d9fa0
JT
2154 pt->callbacks.congested_fn = pool_is_congested;
2155 dm_table_add_target_callbacks(ti->table, &pt->callbacks);
2156
2157 mutex_unlock(&dm_thin_pool_table.mutex);
2158
2159 return 0;
2160
67e2e2b2
JT
2161out_flags_changed:
2162 __pool_dec(pool);
991d9fa0
JT
2163out_free_pt:
2164 kfree(pt);
2165out:
2166 dm_put_device(ti, data_dev);
2167out_metadata:
2168 dm_put_device(ti, metadata_dev);
2169out_unlock:
2170 mutex_unlock(&dm_thin_pool_table.mutex);
2171
2172 return r;
2173}
2174
7de3ee57 2175static int pool_map(struct dm_target *ti, struct bio *bio)
991d9fa0
JT
2176{
2177 int r;
2178 struct pool_c *pt = ti->private;
2179 struct pool *pool = pt->pool;
2180 unsigned long flags;
2181
2182 /*
2183 * As this is a singleton target, ti->begin is always zero.
2184 */
2185 spin_lock_irqsave(&pool->lock, flags);
2186 bio->bi_bdev = pt->data_dev->bdev;
2187 r = DM_MAPIO_REMAPPED;
2188 spin_unlock_irqrestore(&pool->lock, flags);
2189
2190 return r;
2191}
2192
b17446df 2193static int maybe_resize_data_dev(struct dm_target *ti, bool *need_commit)
991d9fa0
JT
2194{
2195 int r;
2196 struct pool_c *pt = ti->private;
2197 struct pool *pool = pt->pool;
55f2b8bd
MS
2198 sector_t data_size = ti->len;
2199 dm_block_t sb_data_size;
991d9fa0 2200
b17446df 2201 *need_commit = false;
991d9fa0 2202
55f2b8bd
MS
2203 (void) sector_div(data_size, pool->sectors_per_block);
2204
991d9fa0
JT
2205 r = dm_pool_get_data_dev_size(pool->pmd, &sb_data_size);
2206 if (r) {
4fa5971a
MS
2207 DMERR("%s: failed to retrieve data device size",
2208 dm_device_name(pool->pool_md));
991d9fa0
JT
2209 return r;
2210 }
2211
2212 if (data_size < sb_data_size) {
4fa5971a
MS
2213 DMERR("%s: pool target (%llu blocks) too small: expected %llu",
2214 dm_device_name(pool->pool_md),
55f2b8bd 2215 (unsigned long long)data_size, sb_data_size);
991d9fa0
JT
2216 return -EINVAL;
2217
2218 } else if (data_size > sb_data_size) {
6f7f51d4
MS
2219 if (sb_data_size)
2220 DMINFO("%s: growing the data device from %llu to %llu blocks",
2221 dm_device_name(pool->pool_md),
2222 sb_data_size, (unsigned long long)data_size);
991d9fa0
JT
2223 r = dm_pool_resize_data_dev(pool->pmd, data_size);
2224 if (r) {
b5330655 2225 metadata_operation_failed(pool, "dm_pool_resize_data_dev", r);
991d9fa0
JT
2226 return r;
2227 }
2228
b17446df 2229 *need_commit = true;
991d9fa0
JT
2230 }
2231
2232 return 0;
2233}
2234
24347e95
JT
2235static int maybe_resize_metadata_dev(struct dm_target *ti, bool *need_commit)
2236{
2237 int r;
2238 struct pool_c *pt = ti->private;
2239 struct pool *pool = pt->pool;
2240 dm_block_t metadata_dev_size, sb_metadata_dev_size;
2241
2242 *need_commit = false;
2243
610bba8b 2244 metadata_dev_size = get_metadata_dev_size_in_blocks(pool->md_dev);
24347e95
JT
2245
2246 r = dm_pool_get_metadata_dev_size(pool->pmd, &sb_metadata_dev_size);
2247 if (r) {
4fa5971a
MS
2248 DMERR("%s: failed to retrieve metadata device size",
2249 dm_device_name(pool->pool_md));
24347e95
JT
2250 return r;
2251 }
2252
2253 if (metadata_dev_size < sb_metadata_dev_size) {
4fa5971a
MS
2254 DMERR("%s: metadata device (%llu blocks) too small: expected %llu",
2255 dm_device_name(pool->pool_md),
24347e95
JT
2256 metadata_dev_size, sb_metadata_dev_size);
2257 return -EINVAL;
2258
2259 } else if (metadata_dev_size > sb_metadata_dev_size) {
6f7f51d4
MS
2260 DMINFO("%s: growing the metadata device from %llu to %llu blocks",
2261 dm_device_name(pool->pool_md),
2262 sb_metadata_dev_size, metadata_dev_size);
24347e95
JT
2263 r = dm_pool_resize_metadata_dev(pool->pmd, metadata_dev_size);
2264 if (r) {
b5330655 2265 metadata_operation_failed(pool, "dm_pool_resize_metadata_dev", r);
24347e95
JT
2266 return r;
2267 }
2268
2269 *need_commit = true;
2270 }
2271
2272 return 0;
2273}
2274
b17446df
JT
2275/*
2276 * Retrieves the number of blocks of the data device from
2277 * the superblock and compares it to the actual device size,
2278 * thus resizing the data device in case it has grown.
2279 *
2280 * This both copes with opening preallocated data devices in the ctr
2281 * being followed by a resume
2282 * -and-
2283 * calling the resume method individually after userspace has
2284 * grown the data device in reaction to a table event.
2285 */
2286static int pool_preresume(struct dm_target *ti)
2287{
2288 int r;
24347e95 2289 bool need_commit1, need_commit2;
b17446df
JT
2290 struct pool_c *pt = ti->private;
2291 struct pool *pool = pt->pool;
2292
2293 /*
2294 * Take control of the pool object.
2295 */
2296 r = bind_control_target(pool, ti);
2297 if (r)
2298 return r;
2299
2300 r = maybe_resize_data_dev(ti, &need_commit1);
2301 if (r)
2302 return r;
2303
24347e95
JT
2304 r = maybe_resize_metadata_dev(ti, &need_commit2);
2305 if (r)
2306 return r;
2307
2308 if (need_commit1 || need_commit2)
020cc3b5 2309 (void) commit(pool);
b17446df
JT
2310
2311 return 0;
2312}
2313
991d9fa0
JT
2314static void pool_resume(struct dm_target *ti)
2315{
2316 struct pool_c *pt = ti->private;
2317 struct pool *pool = pt->pool;
2318 unsigned long flags;
2319
2320 spin_lock_irqsave(&pool->lock, flags);
88a6621b
JT
2321 pool->low_water_triggered = false;
2322 pool->no_free_space = false;
991d9fa0
JT
2323 __requeue_bios(pool);
2324 spin_unlock_irqrestore(&pool->lock, flags);
2325
905e51b3 2326 do_waker(&pool->waker.work);
991d9fa0
JT
2327}
2328
2329static void pool_postsuspend(struct dm_target *ti)
2330{
991d9fa0
JT
2331 struct pool_c *pt = ti->private;
2332 struct pool *pool = pt->pool;
2333
905e51b3 2334 cancel_delayed_work(&pool->waker);
991d9fa0 2335 flush_workqueue(pool->wq);
020cc3b5 2336 (void) commit(pool);
991d9fa0
JT
2337}
2338
2339static int check_arg_count(unsigned argc, unsigned args_required)
2340{
2341 if (argc != args_required) {
2342 DMWARN("Message received with %u arguments instead of %u.",
2343 argc, args_required);
2344 return -EINVAL;
2345 }
2346
2347 return 0;
2348}
2349
2350static int read_dev_id(char *arg, dm_thin_id *dev_id, int warning)
2351{
2352 if (!kstrtoull(arg, 10, (unsigned long long *)dev_id) &&
2353 *dev_id <= MAX_DEV_ID)
2354 return 0;
2355
2356 if (warning)
2357 DMWARN("Message received with invalid device id: %s", arg);
2358
2359 return -EINVAL;
2360}
2361
2362static int process_create_thin_mesg(unsigned argc, char **argv, struct pool *pool)
2363{
2364 dm_thin_id dev_id;
2365 int r;
2366
2367 r = check_arg_count(argc, 2);
2368 if (r)
2369 return r;
2370
2371 r = read_dev_id(argv[1], &dev_id, 1);
2372 if (r)
2373 return r;
2374
2375 r = dm_pool_create_thin(pool->pmd, dev_id);
2376 if (r) {
2377 DMWARN("Creation of new thinly-provisioned device with id %s failed.",
2378 argv[1]);
2379 return r;
2380 }
2381
2382 return 0;
2383}
2384
2385static int process_create_snap_mesg(unsigned argc, char **argv, struct pool *pool)
2386{
2387 dm_thin_id dev_id;
2388 dm_thin_id origin_dev_id;
2389 int r;
2390
2391 r = check_arg_count(argc, 3);
2392 if (r)
2393 return r;
2394
2395 r = read_dev_id(argv[1], &dev_id, 1);
2396 if (r)
2397 return r;
2398
2399 r = read_dev_id(argv[2], &origin_dev_id, 1);
2400 if (r)
2401 return r;
2402
2403 r = dm_pool_create_snap(pool->pmd, dev_id, origin_dev_id);
2404 if (r) {
2405 DMWARN("Creation of new snapshot %s of device %s failed.",
2406 argv[1], argv[2]);
2407 return r;
2408 }
2409
2410 return 0;
2411}
2412
2413static int process_delete_mesg(unsigned argc, char **argv, struct pool *pool)
2414{
2415 dm_thin_id dev_id;
2416 int r;
2417
2418 r = check_arg_count(argc, 2);
2419 if (r)
2420 return r;
2421
2422 r = read_dev_id(argv[1], &dev_id, 1);
2423 if (r)
2424 return r;
2425
2426 r = dm_pool_delete_thin_device(pool->pmd, dev_id);
2427 if (r)
2428 DMWARN("Deletion of thin device %s failed.", argv[1]);
2429
2430 return r;
2431}
2432
2433static int process_set_transaction_id_mesg(unsigned argc, char **argv, struct pool *pool)
2434{
2435 dm_thin_id old_id, new_id;
2436 int r;
2437
2438 r = check_arg_count(argc, 3);
2439 if (r)
2440 return r;
2441
2442 if (kstrtoull(argv[1], 10, (unsigned long long *)&old_id)) {
2443 DMWARN("set_transaction_id message: Unrecognised id %s.", argv[1]);
2444 return -EINVAL;
2445 }
2446
2447 if (kstrtoull(argv[2], 10, (unsigned long long *)&new_id)) {
2448 DMWARN("set_transaction_id message: Unrecognised new id %s.", argv[2]);
2449 return -EINVAL;
2450 }
2451
2452 r = dm_pool_set_metadata_transaction_id(pool->pmd, old_id, new_id);
2453 if (r) {
2454 DMWARN("Failed to change transaction id from %s to %s.",
2455 argv[1], argv[2]);
2456 return r;
2457 }
2458
2459 return 0;
2460}
2461
cc8394d8
JT
2462static int process_reserve_metadata_snap_mesg(unsigned argc, char **argv, struct pool *pool)
2463{
2464 int r;
2465
2466 r = check_arg_count(argc, 1);
2467 if (r)
2468 return r;
2469
020cc3b5 2470 (void) commit(pool);
0d200aef 2471
cc8394d8
JT
2472 r = dm_pool_reserve_metadata_snap(pool->pmd);
2473 if (r)
2474 DMWARN("reserve_metadata_snap message failed.");
2475
2476 return r;
2477}
2478
2479static int process_release_metadata_snap_mesg(unsigned argc, char **argv, struct pool *pool)
2480{
2481 int r;
2482
2483 r = check_arg_count(argc, 1);
2484 if (r)
2485 return r;
2486
2487 r = dm_pool_release_metadata_snap(pool->pmd);
2488 if (r)
2489 DMWARN("release_metadata_snap message failed.");
2490
2491 return r;
2492}
2493
991d9fa0
JT
2494/*
2495 * Messages supported:
2496 * create_thin <dev_id>
2497 * create_snap <dev_id> <origin_id>
2498 * delete <dev_id>
2499 * trim <dev_id> <new_size_in_sectors>
2500 * set_transaction_id <current_trans_id> <new_trans_id>
cc8394d8
JT
2501 * reserve_metadata_snap
2502 * release_metadata_snap
991d9fa0
JT
2503 */
2504static int pool_message(struct dm_target *ti, unsigned argc, char **argv)
2505{
2506 int r = -EINVAL;
2507 struct pool_c *pt = ti->private;
2508 struct pool *pool = pt->pool;
2509
2510 if (!strcasecmp(argv[0], "create_thin"))
2511 r = process_create_thin_mesg(argc, argv, pool);
2512
2513 else if (!strcasecmp(argv[0], "create_snap"))
2514 r = process_create_snap_mesg(argc, argv, pool);
2515
2516 else if (!strcasecmp(argv[0], "delete"))
2517 r = process_delete_mesg(argc, argv, pool);
2518
2519 else if (!strcasecmp(argv[0], "set_transaction_id"))
2520 r = process_set_transaction_id_mesg(argc, argv, pool);
2521
cc8394d8
JT
2522 else if (!strcasecmp(argv[0], "reserve_metadata_snap"))
2523 r = process_reserve_metadata_snap_mesg(argc, argv, pool);
2524
2525 else if (!strcasecmp(argv[0], "release_metadata_snap"))
2526 r = process_release_metadata_snap_mesg(argc, argv, pool);
2527
991d9fa0
JT
2528 else
2529 DMWARN("Unrecognised thin pool target message received: %s", argv[0]);
2530
e49e5829 2531 if (!r)
020cc3b5 2532 (void) commit(pool);
991d9fa0
JT
2533
2534 return r;
2535}
2536
e49e5829
JT
2537static void emit_flags(struct pool_features *pf, char *result,
2538 unsigned sz, unsigned maxlen)
2539{
2540 unsigned count = !pf->zero_new_blocks + !pf->discard_enabled +
2541 !pf->discard_passdown + (pf->mode == PM_READ_ONLY);
2542 DMEMIT("%u ", count);
2543
2544 if (!pf->zero_new_blocks)
2545 DMEMIT("skip_block_zeroing ");
2546
2547 if (!pf->discard_enabled)
2548 DMEMIT("ignore_discard ");
2549
2550 if (!pf->discard_passdown)
2551 DMEMIT("no_discard_passdown ");
2552
2553 if (pf->mode == PM_READ_ONLY)
2554 DMEMIT("read_only ");
2555}
2556
991d9fa0
JT
2557/*
2558 * Status line is:
2559 * <transaction id> <used metadata sectors>/<total metadata sectors>
2560 * <used data sectors>/<total data sectors> <held metadata root>
2561 */
fd7c092e
MP
2562static void pool_status(struct dm_target *ti, status_type_t type,
2563 unsigned status_flags, char *result, unsigned maxlen)
991d9fa0 2564{
e49e5829 2565 int r;
991d9fa0
JT
2566 unsigned sz = 0;
2567 uint64_t transaction_id;
2568 dm_block_t nr_free_blocks_data;
2569 dm_block_t nr_free_blocks_metadata;
2570 dm_block_t nr_blocks_data;
2571 dm_block_t nr_blocks_metadata;
2572 dm_block_t held_root;
2573 char buf[BDEVNAME_SIZE];
2574 char buf2[BDEVNAME_SIZE];
2575 struct pool_c *pt = ti->private;
2576 struct pool *pool = pt->pool;
2577
2578 switch (type) {
2579 case STATUSTYPE_INFO:
e49e5829
JT
2580 if (get_pool_mode(pool) == PM_FAIL) {
2581 DMEMIT("Fail");
2582 break;
2583 }
2584
1f4e0ff0
AK
2585 /* Commit to ensure statistics aren't out-of-date */
2586 if (!(status_flags & DM_STATUS_NOFLUSH_FLAG) && !dm_suspended(ti))
020cc3b5 2587 (void) commit(pool);
1f4e0ff0 2588
fd7c092e
MP
2589 r = dm_pool_get_metadata_transaction_id(pool->pmd, &transaction_id);
2590 if (r) {
4fa5971a
MS
2591 DMERR("%s: dm_pool_get_metadata_transaction_id returned %d",
2592 dm_device_name(pool->pool_md), r);
fd7c092e
MP
2593 goto err;
2594 }
991d9fa0 2595
fd7c092e
MP
2596 r = dm_pool_get_free_metadata_block_count(pool->pmd, &nr_free_blocks_metadata);
2597 if (r) {
4fa5971a
MS
2598 DMERR("%s: dm_pool_get_free_metadata_block_count returned %d",
2599 dm_device_name(pool->pool_md), r);
fd7c092e
MP
2600 goto err;
2601 }
991d9fa0
JT
2602
2603 r = dm_pool_get_metadata_dev_size(pool->pmd, &nr_blocks_metadata);
fd7c092e 2604 if (r) {
4fa5971a
MS
2605 DMERR("%s: dm_pool_get_metadata_dev_size returned %d",
2606 dm_device_name(pool->pool_md), r);
fd7c092e
MP
2607 goto err;
2608 }
991d9fa0 2609
fd7c092e
MP
2610 r = dm_pool_get_free_block_count(pool->pmd, &nr_free_blocks_data);
2611 if (r) {
4fa5971a
MS
2612 DMERR("%s: dm_pool_get_free_block_count returned %d",
2613 dm_device_name(pool->pool_md), r);
fd7c092e
MP
2614 goto err;
2615 }
991d9fa0
JT
2616
2617 r = dm_pool_get_data_dev_size(pool->pmd, &nr_blocks_data);
fd7c092e 2618 if (r) {
4fa5971a
MS
2619 DMERR("%s: dm_pool_get_data_dev_size returned %d",
2620 dm_device_name(pool->pool_md), r);
fd7c092e
MP
2621 goto err;
2622 }
991d9fa0 2623
cc8394d8 2624 r = dm_pool_get_metadata_snap(pool->pmd, &held_root);
fd7c092e 2625 if (r) {
4fa5971a
MS
2626 DMERR("%s: dm_pool_get_metadata_snap returned %d",
2627 dm_device_name(pool->pool_md), r);
fd7c092e
MP
2628 goto err;
2629 }
991d9fa0
JT
2630
2631 DMEMIT("%llu %llu/%llu %llu/%llu ",
2632 (unsigned long long)transaction_id,
2633 (unsigned long long)(nr_blocks_metadata - nr_free_blocks_metadata),
2634 (unsigned long long)nr_blocks_metadata,
2635 (unsigned long long)(nr_blocks_data - nr_free_blocks_data),
2636 (unsigned long long)nr_blocks_data);
2637
2638 if (held_root)
e49e5829
JT
2639 DMEMIT("%llu ", held_root);
2640 else
2641 DMEMIT("- ");
2642
2643 if (pool->pf.mode == PM_READ_ONLY)
2644 DMEMIT("ro ");
991d9fa0 2645 else
e49e5829
JT
2646 DMEMIT("rw ");
2647
018debea
MS
2648 if (!pool->pf.discard_enabled)
2649 DMEMIT("ignore_discard");
2650 else if (pool->pf.discard_passdown)
e49e5829
JT
2651 DMEMIT("discard_passdown");
2652 else
2653 DMEMIT("no_discard_passdown");
991d9fa0
JT
2654
2655 break;
2656
2657 case STATUSTYPE_TABLE:
2658 DMEMIT("%s %s %lu %llu ",
2659 format_dev_t(buf, pt->metadata_dev->bdev->bd_dev),
2660 format_dev_t(buf2, pt->data_dev->bdev->bd_dev),
2661 (unsigned long)pool->sectors_per_block,
2662 (unsigned long long)pt->low_water_blocks);
0424caa1 2663 emit_flags(&pt->requested_pf, result, sz, maxlen);
991d9fa0
JT
2664 break;
2665 }
fd7c092e 2666 return;
991d9fa0 2667
fd7c092e
MP
2668err:
2669 DMEMIT("Error");
991d9fa0
JT
2670}
2671
2672static int pool_iterate_devices(struct dm_target *ti,
2673 iterate_devices_callout_fn fn, void *data)
2674{
2675 struct pool_c *pt = ti->private;
2676
2677 return fn(ti, pt->data_dev, 0, ti->len, data);
2678}
2679
2680static int pool_merge(struct dm_target *ti, struct bvec_merge_data *bvm,
2681 struct bio_vec *biovec, int max_size)
2682{
2683 struct pool_c *pt = ti->private;
2684 struct request_queue *q = bdev_get_queue(pt->data_dev->bdev);
2685
2686 if (!q->merge_bvec_fn)
2687 return max_size;
2688
2689 bvm->bi_bdev = pt->data_dev->bdev;
2690
2691 return min(max_size, q->merge_bvec_fn(q, bvm, biovec));
2692}
2693
0424caa1 2694static void set_discard_limits(struct pool_c *pt, struct queue_limits *limits)
104655fd 2695{
0424caa1
MS
2696 struct pool *pool = pt->pool;
2697 struct queue_limits *data_limits;
2698
104655fd
JT
2699 limits->max_discard_sectors = pool->sectors_per_block;
2700
2701 /*
0424caa1 2702 * discard_granularity is just a hint, and not enforced.
104655fd 2703 */
0424caa1
MS
2704 if (pt->adjusted_pf.discard_passdown) {
2705 data_limits = &bdev_get_queue(pt->data_dev->bdev)->limits;
2706 limits->discard_granularity = data_limits->discard_granularity;
f13945d7 2707 } else
0424caa1 2708 limits->discard_granularity = pool->sectors_per_block << SECTOR_SHIFT;
104655fd
JT
2709}
2710
991d9fa0
JT
2711static void pool_io_hints(struct dm_target *ti, struct queue_limits *limits)
2712{
2713 struct pool_c *pt = ti->private;
2714 struct pool *pool = pt->pool;
0cc67cd9 2715 uint64_t io_opt_sectors = limits->io_opt >> SECTOR_SHIFT;
991d9fa0 2716
0cc67cd9
MS
2717 /*
2718 * If the system-determined stacked limits are compatible with the
2719 * pool's blocksize (io_opt is a factor) do not override them.
2720 */
2721 if (io_opt_sectors < pool->sectors_per_block ||
2722 do_div(io_opt_sectors, pool->sectors_per_block)) {
2723 blk_limits_io_min(limits, 0);
2724 blk_limits_io_opt(limits, pool->sectors_per_block << SECTOR_SHIFT);
2725 }
0424caa1
MS
2726
2727 /*
2728 * pt->adjusted_pf is a staging area for the actual features to use.
2729 * They get transferred to the live pool in bind_control_target()
2730 * called from pool_preresume().
2731 */
b60ab990
MS
2732 if (!pt->adjusted_pf.discard_enabled) {
2733 /*
2734 * Must explicitly disallow stacking discard limits otherwise the
2735 * block layer will stack them if pool's data device has support.
2736 * QUEUE_FLAG_DISCARD wouldn't be set but there is no way for the
2737 * user to see that, so make sure to set all discard limits to 0.
2738 */
2739 limits->discard_granularity = 0;
0424caa1 2740 return;
b60ab990 2741 }
0424caa1
MS
2742
2743 disable_passdown_if_not_supported(pt);
2744
2745 set_discard_limits(pt, limits);
991d9fa0
JT
2746}
2747
2748static struct target_type pool_target = {
2749 .name = "thin-pool",
2750 .features = DM_TARGET_SINGLETON | DM_TARGET_ALWAYS_WRITEABLE |
2751 DM_TARGET_IMMUTABLE,
94563bad 2752 .version = {1, 9, 0},
991d9fa0
JT
2753 .module = THIS_MODULE,
2754 .ctr = pool_ctr,
2755 .dtr = pool_dtr,
2756 .map = pool_map,
2757 .postsuspend = pool_postsuspend,
2758 .preresume = pool_preresume,
2759 .resume = pool_resume,
2760 .message = pool_message,
2761 .status = pool_status,
2762 .merge = pool_merge,
2763 .iterate_devices = pool_iterate_devices,
2764 .io_hints = pool_io_hints,
2765};
2766
2767/*----------------------------------------------------------------
2768 * Thin target methods
2769 *--------------------------------------------------------------*/
2770static void thin_dtr(struct dm_target *ti)
2771{
2772 struct thin_c *tc = ti->private;
2773
2774 mutex_lock(&dm_thin_pool_table.mutex);
2775
2776 __pool_dec(tc->pool);
2777 dm_pool_close_thin_device(tc->td);
2778 dm_put_device(ti, tc->pool_dev);
2dd9c257
JT
2779 if (tc->origin_dev)
2780 dm_put_device(ti, tc->origin_dev);
991d9fa0
JT
2781 kfree(tc);
2782
2783 mutex_unlock(&dm_thin_pool_table.mutex);
2784}
2785
2786/*
2787 * Thin target parameters:
2788 *
2dd9c257 2789 * <pool_dev> <dev_id> [origin_dev]
991d9fa0
JT
2790 *
2791 * pool_dev: the path to the pool (eg, /dev/mapper/my_pool)
2792 * dev_id: the internal device identifier
2dd9c257 2793 * origin_dev: a device external to the pool that should act as the origin
67e2e2b2
JT
2794 *
2795 * If the pool device has discards disabled, they get disabled for the thin
2796 * device as well.
991d9fa0
JT
2797 */
2798static int thin_ctr(struct dm_target *ti, unsigned argc, char **argv)
2799{
2800 int r;
2801 struct thin_c *tc;
2dd9c257 2802 struct dm_dev *pool_dev, *origin_dev;
991d9fa0
JT
2803 struct mapped_device *pool_md;
2804
2805 mutex_lock(&dm_thin_pool_table.mutex);
2806
2dd9c257 2807 if (argc != 2 && argc != 3) {
991d9fa0
JT
2808 ti->error = "Invalid argument count";
2809 r = -EINVAL;
2810 goto out_unlock;
2811 }
2812
2813 tc = ti->private = kzalloc(sizeof(*tc), GFP_KERNEL);
2814 if (!tc) {
2815 ti->error = "Out of memory";
2816 r = -ENOMEM;
2817 goto out_unlock;
2818 }
2819
2dd9c257
JT
2820 if (argc == 3) {
2821 r = dm_get_device(ti, argv[2], FMODE_READ, &origin_dev);
2822 if (r) {
2823 ti->error = "Error opening origin device";
2824 goto bad_origin_dev;
2825 }
2826 tc->origin_dev = origin_dev;
2827 }
2828
991d9fa0
JT
2829 r = dm_get_device(ti, argv[0], dm_table_get_mode(ti->table), &pool_dev);
2830 if (r) {
2831 ti->error = "Error opening pool device";
2832 goto bad_pool_dev;
2833 }
2834 tc->pool_dev = pool_dev;
2835
2836 if (read_dev_id(argv[1], (unsigned long long *)&tc->dev_id, 0)) {
2837 ti->error = "Invalid device id";
2838 r = -EINVAL;
2839 goto bad_common;
2840 }
2841
2842 pool_md = dm_get_md(tc->pool_dev->bdev->bd_dev);
2843 if (!pool_md) {
2844 ti->error = "Couldn't get pool mapped device";
2845 r = -EINVAL;
2846 goto bad_common;
2847 }
2848
2849 tc->pool = __pool_table_lookup(pool_md);
2850 if (!tc->pool) {
2851 ti->error = "Couldn't find pool object";
2852 r = -EINVAL;
2853 goto bad_pool_lookup;
2854 }
2855 __pool_inc(tc->pool);
2856
e49e5829
JT
2857 if (get_pool_mode(tc->pool) == PM_FAIL) {
2858 ti->error = "Couldn't open thin device, Pool is in fail mode";
2859 goto bad_thin_open;
2860 }
2861
991d9fa0
JT
2862 r = dm_pool_open_thin_device(tc->pool->pmd, tc->dev_id, &tc->td);
2863 if (r) {
2864 ti->error = "Couldn't open thin internal device";
2865 goto bad_thin_open;
2866 }
2867
542f9038
MS
2868 r = dm_set_target_max_io_len(ti, tc->pool->sectors_per_block);
2869 if (r)
2870 goto bad_thin_open;
2871
55a62eef 2872 ti->num_flush_bios = 1;
16ad3d10 2873 ti->flush_supported = true;
59c3d2c6 2874 ti->per_bio_data_size = sizeof(struct dm_thin_endio_hook);
67e2e2b2
JT
2875
2876 /* In case the pool supports discards, pass them on. */
b60ab990 2877 ti->discard_zeroes_data_unsupported = true;
67e2e2b2 2878 if (tc->pool->pf.discard_enabled) {
0ac55489 2879 ti->discards_supported = true;
55a62eef 2880 ti->num_discard_bios = 1;
55a62eef
AK
2881 /* Discard bios must be split on a block boundary */
2882 ti->split_discard_bios = true;
67e2e2b2 2883 }
991d9fa0
JT
2884
2885 dm_put(pool_md);
2886
2887 mutex_unlock(&dm_thin_pool_table.mutex);
2888
2889 return 0;
2890
2891bad_thin_open:
2892 __pool_dec(tc->pool);
2893bad_pool_lookup:
2894 dm_put(pool_md);
2895bad_common:
2896 dm_put_device(ti, tc->pool_dev);
2897bad_pool_dev:
2dd9c257
JT
2898 if (tc->origin_dev)
2899 dm_put_device(ti, tc->origin_dev);
2900bad_origin_dev:
991d9fa0
JT
2901 kfree(tc);
2902out_unlock:
2903 mutex_unlock(&dm_thin_pool_table.mutex);
2904
2905 return r;
2906}
2907
7de3ee57 2908static int thin_map(struct dm_target *ti, struct bio *bio)
991d9fa0 2909{
6efd6e83 2910 bio->bi_sector = dm_target_offset(ti, bio->bi_sector);
991d9fa0 2911
7de3ee57 2912 return thin_bio_map(ti, bio);
991d9fa0
JT
2913}
2914
7de3ee57 2915static int thin_endio(struct dm_target *ti, struct bio *bio, int err)
eb2aa48d
JT
2916{
2917 unsigned long flags;
59c3d2c6 2918 struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));
eb2aa48d 2919 struct list_head work;
a24c2569 2920 struct dm_thin_new_mapping *m, *tmp;
eb2aa48d
JT
2921 struct pool *pool = h->tc->pool;
2922
2923 if (h->shared_read_entry) {
2924 INIT_LIST_HEAD(&work);
44feb387 2925 dm_deferred_entry_dec(h->shared_read_entry, &work);
eb2aa48d
JT
2926
2927 spin_lock_irqsave(&pool->lock, flags);
2928 list_for_each_entry_safe(m, tmp, &work, list) {
2929 list_del(&m->list);
7f214665 2930 m->quiesced = true;
eb2aa48d
JT
2931 __maybe_add_mapping(m);
2932 }
2933 spin_unlock_irqrestore(&pool->lock, flags);
2934 }
2935
104655fd
JT
2936 if (h->all_io_entry) {
2937 INIT_LIST_HEAD(&work);
44feb387 2938 dm_deferred_entry_dec(h->all_io_entry, &work);
563af186
JT
2939 if (!list_empty(&work)) {
2940 spin_lock_irqsave(&pool->lock, flags);
2941 list_for_each_entry_safe(m, tmp, &work, list)
daec338b 2942 list_add_tail(&m->list, &pool->prepared_discards);
563af186
JT
2943 spin_unlock_irqrestore(&pool->lock, flags);
2944 wake_worker(pool);
2945 }
104655fd
JT
2946 }
2947
eb2aa48d
JT
2948 return 0;
2949}
2950
991d9fa0
JT
2951static void thin_postsuspend(struct dm_target *ti)
2952{
2953 if (dm_noflush_suspending(ti))
2954 requeue_io((struct thin_c *)ti->private);
2955}
2956
2957/*
2958 * <nr mapped sectors> <highest mapped sector>
2959 */
fd7c092e
MP
2960static void thin_status(struct dm_target *ti, status_type_t type,
2961 unsigned status_flags, char *result, unsigned maxlen)
991d9fa0
JT
2962{
2963 int r;
2964 ssize_t sz = 0;
2965 dm_block_t mapped, highest;
2966 char buf[BDEVNAME_SIZE];
2967 struct thin_c *tc = ti->private;
2968
e49e5829
JT
2969 if (get_pool_mode(tc->pool) == PM_FAIL) {
2970 DMEMIT("Fail");
fd7c092e 2971 return;
e49e5829
JT
2972 }
2973
991d9fa0
JT
2974 if (!tc->td)
2975 DMEMIT("-");
2976 else {
2977 switch (type) {
2978 case STATUSTYPE_INFO:
2979 r = dm_thin_get_mapped_count(tc->td, &mapped);
fd7c092e
MP
2980 if (r) {
2981 DMERR("dm_thin_get_mapped_count returned %d", r);
2982 goto err;
2983 }
991d9fa0
JT
2984
2985 r = dm_thin_get_highest_mapped_block(tc->td, &highest);
fd7c092e
MP
2986 if (r < 0) {
2987 DMERR("dm_thin_get_highest_mapped_block returned %d", r);
2988 goto err;
2989 }
991d9fa0
JT
2990
2991 DMEMIT("%llu ", mapped * tc->pool->sectors_per_block);
2992 if (r)
2993 DMEMIT("%llu", ((highest + 1) *
2994 tc->pool->sectors_per_block) - 1);
2995 else
2996 DMEMIT("-");
2997 break;
2998
2999 case STATUSTYPE_TABLE:
3000 DMEMIT("%s %lu",
3001 format_dev_t(buf, tc->pool_dev->bdev->bd_dev),
3002 (unsigned long) tc->dev_id);
2dd9c257
JT
3003 if (tc->origin_dev)
3004 DMEMIT(" %s", format_dev_t(buf, tc->origin_dev->bdev->bd_dev));
991d9fa0
JT
3005 break;
3006 }
3007 }
3008
fd7c092e
MP
3009 return;
3010
3011err:
3012 DMEMIT("Error");
991d9fa0
JT
3013}
3014
3015static int thin_iterate_devices(struct dm_target *ti,
3016 iterate_devices_callout_fn fn, void *data)
3017{
55f2b8bd 3018 sector_t blocks;
991d9fa0 3019 struct thin_c *tc = ti->private;
55f2b8bd 3020 struct pool *pool = tc->pool;
991d9fa0
JT
3021
3022 /*
3023 * We can't call dm_pool_get_data_dev_size() since that blocks. So
3024 * we follow a more convoluted path through to the pool's target.
3025 */
55f2b8bd 3026 if (!pool->ti)
991d9fa0
JT
3027 return 0; /* nothing is bound */
3028
55f2b8bd
MS
3029 blocks = pool->ti->len;
3030 (void) sector_div(blocks, pool->sectors_per_block);
991d9fa0 3031 if (blocks)
55f2b8bd 3032 return fn(ti, tc->pool_dev, 0, pool->sectors_per_block * blocks, data);
991d9fa0
JT
3033
3034 return 0;
3035}
3036
991d9fa0
JT
3037static struct target_type thin_target = {
3038 .name = "thin",
94563bad 3039 .version = {1, 9, 0},
991d9fa0
JT
3040 .module = THIS_MODULE,
3041 .ctr = thin_ctr,
3042 .dtr = thin_dtr,
3043 .map = thin_map,
eb2aa48d 3044 .end_io = thin_endio,
991d9fa0
JT
3045 .postsuspend = thin_postsuspend,
3046 .status = thin_status,
3047 .iterate_devices = thin_iterate_devices,
991d9fa0
JT
3048};
3049
3050/*----------------------------------------------------------------*/
3051
3052static int __init dm_thin_init(void)
3053{
3054 int r;
3055
3056 pool_table_init();
3057
3058 r = dm_register_target(&thin_target);
3059 if (r)
3060 return r;
3061
3062 r = dm_register_target(&pool_target);
3063 if (r)
a24c2569
MS
3064 goto bad_pool_target;
3065
3066 r = -ENOMEM;
3067
a24c2569
MS
3068 _new_mapping_cache = KMEM_CACHE(dm_thin_new_mapping, 0);
3069 if (!_new_mapping_cache)
3070 goto bad_new_mapping_cache;
3071
a24c2569
MS
3072 return 0;
3073
a24c2569 3074bad_new_mapping_cache:
a24c2569
MS
3075 dm_unregister_target(&pool_target);
3076bad_pool_target:
3077 dm_unregister_target(&thin_target);
991d9fa0
JT
3078
3079 return r;
3080}
3081
3082static void dm_thin_exit(void)
3083{
3084 dm_unregister_target(&thin_target);
3085 dm_unregister_target(&pool_target);
a24c2569 3086
a24c2569 3087 kmem_cache_destroy(_new_mapping_cache);
991d9fa0
JT
3088}
3089
3090module_init(dm_thin_init);
3091module_exit(dm_thin_exit);
3092
7cab8bf1 3093MODULE_DESCRIPTION(DM_NAME " thin provisioning target");
991d9fa0
JT
3094MODULE_AUTHOR("Joe Thornber <dm-devel@redhat.com>");
3095MODULE_LICENSE("GPL");