]>
Commit | Line | Data |
---|---|---|
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> | |
0f30af98 | 14 | #include <linux/jiffies.h> |
604ea906 | 15 | #include <linux/log2.h> |
991d9fa0 | 16 | #include <linux/list.h> |
c140e1c4 | 17 | #include <linux/rculist.h> |
991d9fa0 JT |
18 | #include <linux/init.h> |
19 | #include <linux/module.h> | |
20 | #include <linux/slab.h> | |
a822c83e | 21 | #include <linux/vmalloc.h> |
ac4c3f34 | 22 | #include <linux/sort.h> |
67324ea1 | 23 | #include <linux/rbtree.h> |
991d9fa0 JT |
24 | |
25 | #define DM_MSG_PREFIX "thin" | |
26 | ||
27 | /* | |
28 | * Tunable constants | |
29 | */ | |
7768ed33 | 30 | #define ENDIO_HOOK_POOL_SIZE 1024 |
991d9fa0 | 31 | #define MAPPING_POOL_SIZE 1024 |
905e51b3 | 32 | #define COMMIT_PERIOD HZ |
80c57893 MS |
33 | #define NO_SPACE_TIMEOUT_SECS 60 |
34 | ||
35 | static unsigned no_space_timeout_secs = NO_SPACE_TIMEOUT_SECS; | |
991d9fa0 | 36 | |
df5d2e90 MP |
37 | DECLARE_DM_KCOPYD_THROTTLE_WITH_MODULE_PARM(snapshot_copy_throttle, |
38 | "A percentage of time allocated for copy on write"); | |
39 | ||
991d9fa0 JT |
40 | /* |
41 | * The block size of the device holding pool data must be | |
42 | * between 64KB and 1GB. | |
43 | */ | |
44 | #define DATA_DEV_BLOCK_SIZE_MIN_SECTORS (64 * 1024 >> SECTOR_SHIFT) | |
45 | #define DATA_DEV_BLOCK_SIZE_MAX_SECTORS (1024 * 1024 * 1024 >> SECTOR_SHIFT) | |
46 | ||
991d9fa0 JT |
47 | /* |
48 | * Device id is restricted to 24 bits. | |
49 | */ | |
50 | #define MAX_DEV_ID ((1 << 24) - 1) | |
51 | ||
52 | /* | |
53 | * How do we handle breaking sharing of data blocks? | |
54 | * ================================================= | |
55 | * | |
56 | * We use a standard copy-on-write btree to store the mappings for the | |
57 | * devices (note I'm talking about copy-on-write of the metadata here, not | |
58 | * the data). When you take an internal snapshot you clone the root node | |
59 | * of the origin btree. After this there is no concept of an origin or a | |
60 | * snapshot. They are just two device trees that happen to point to the | |
61 | * same data blocks. | |
62 | * | |
63 | * When we get a write in we decide if it's to a shared data block using | |
64 | * some timestamp magic. If it is, we have to break sharing. | |
65 | * | |
66 | * Let's say we write to a shared block in what was the origin. The | |
67 | * steps are: | |
68 | * | |
69 | * i) plug io further to this physical block. (see bio_prison code). | |
70 | * | |
71 | * ii) quiesce any read io to that shared data block. Obviously | |
44feb387 | 72 | * including all devices that share this block. (see dm_deferred_set code) |
991d9fa0 JT |
73 | * |
74 | * iii) copy the data block to a newly allocate block. This step can be | |
75 | * missed out if the io covers the block. (schedule_copy). | |
76 | * | |
77 | * iv) insert the new mapping into the origin's btree | |
fe878f34 | 78 | * (process_prepared_mapping). This act of inserting breaks some |
991d9fa0 JT |
79 | * sharing of btree nodes between the two devices. Breaking sharing only |
80 | * effects the btree of that specific device. Btrees for the other | |
81 | * devices that share the block never change. The btree for the origin | |
82 | * device as it was after the last commit is untouched, ie. we're using | |
83 | * persistent data structures in the functional programming sense. | |
84 | * | |
85 | * v) unplug io to this physical block, including the io that triggered | |
86 | * the breaking of sharing. | |
87 | * | |
88 | * Steps (ii) and (iii) occur in parallel. | |
89 | * | |
90 | * The metadata _doesn't_ need to be committed before the io continues. We | |
91 | * get away with this because the io is always written to a _new_ block. | |
92 | * If there's a crash, then: | |
93 | * | |
94 | * - The origin mapping will point to the old origin block (the shared | |
95 | * one). This will contain the data as it was before the io that triggered | |
96 | * the breaking of sharing came in. | |
97 | * | |
98 | * - The snap mapping still points to the old block. As it would after | |
99 | * the commit. | |
100 | * | |
101 | * The downside of this scheme is the timestamp magic isn't perfect, and | |
102 | * will continue to think that data block in the snapshot device is shared | |
103 | * even after the write to the origin has broken sharing. I suspect data | |
104 | * blocks will typically be shared by many different devices, so we're | |
105 | * breaking sharing n + 1 times, rather than n, where n is the number of | |
106 | * devices that reference this data block. At the moment I think the | |
107 | * benefits far, far outweigh the disadvantages. | |
108 | */ | |
109 | ||
110 | /*----------------------------------------------------------------*/ | |
111 | ||
991d9fa0 JT |
112 | /* |
113 | * Key building. | |
114 | */ | |
34fbcf62 JT |
115 | enum lock_space { |
116 | VIRTUAL, | |
117 | PHYSICAL | |
118 | }; | |
119 | ||
120 | static void build_key(struct dm_thin_device *td, enum lock_space ls, | |
121 | dm_block_t b, dm_block_t e, struct dm_cell_key *key) | |
991d9fa0 | 122 | { |
34fbcf62 | 123 | key->virtual = (ls == VIRTUAL); |
991d9fa0 | 124 | key->dev = dm_thin_dev_id(td); |
5f274d88 | 125 | key->block_begin = b; |
34fbcf62 JT |
126 | key->block_end = e; |
127 | } | |
128 | ||
129 | static void build_data_key(struct dm_thin_device *td, dm_block_t b, | |
130 | struct dm_cell_key *key) | |
131 | { | |
132 | build_key(td, PHYSICAL, b, b + 1llu, key); | |
991d9fa0 JT |
133 | } |
134 | ||
135 | static void build_virtual_key(struct dm_thin_device *td, dm_block_t b, | |
44feb387 | 136 | struct dm_cell_key *key) |
991d9fa0 | 137 | { |
34fbcf62 | 138 | build_key(td, VIRTUAL, b, b + 1llu, key); |
991d9fa0 JT |
139 | } |
140 | ||
141 | /*----------------------------------------------------------------*/ | |
142 | ||
7d327fe0 JT |
143 | #define THROTTLE_THRESHOLD (1 * HZ) |
144 | ||
145 | struct throttle { | |
146 | struct rw_semaphore lock; | |
147 | unsigned long threshold; | |
148 | bool throttle_applied; | |
149 | }; | |
150 | ||
151 | static void throttle_init(struct throttle *t) | |
152 | { | |
153 | init_rwsem(&t->lock); | |
154 | t->throttle_applied = false; | |
155 | } | |
156 | ||
157 | static void throttle_work_start(struct throttle *t) | |
158 | { | |
159 | t->threshold = jiffies + THROTTLE_THRESHOLD; | |
160 | } | |
161 | ||
162 | static void throttle_work_update(struct throttle *t) | |
163 | { | |
164 | if (!t->throttle_applied && jiffies > t->threshold) { | |
165 | down_write(&t->lock); | |
166 | t->throttle_applied = true; | |
167 | } | |
168 | } | |
169 | ||
170 | static void throttle_work_complete(struct throttle *t) | |
171 | { | |
172 | if (t->throttle_applied) { | |
173 | t->throttle_applied = false; | |
174 | up_write(&t->lock); | |
175 | } | |
176 | } | |
177 | ||
178 | static void throttle_lock(struct throttle *t) | |
179 | { | |
180 | down_read(&t->lock); | |
181 | } | |
182 | ||
183 | static void throttle_unlock(struct throttle *t) | |
184 | { | |
185 | up_read(&t->lock); | |
186 | } | |
187 | ||
188 | /*----------------------------------------------------------------*/ | |
189 | ||
991d9fa0 JT |
190 | /* |
191 | * A pool device ties together a metadata device and a data device. It | |
192 | * also provides the interface for creating and destroying internal | |
193 | * devices. | |
194 | */ | |
a24c2569 | 195 | struct dm_thin_new_mapping; |
67e2e2b2 | 196 | |
e49e5829 | 197 | /* |
3e1a0699 | 198 | * The pool runs in 4 modes. Ordered in degraded order for comparisons. |
e49e5829 JT |
199 | */ |
200 | enum pool_mode { | |
201 | PM_WRITE, /* metadata may be changed */ | |
3e1a0699 | 202 | PM_OUT_OF_DATA_SPACE, /* metadata may be changed, though data may not be allocated */ |
e49e5829 JT |
203 | PM_READ_ONLY, /* metadata may not be changed */ |
204 | PM_FAIL, /* all I/O fails */ | |
205 | }; | |
206 | ||
67e2e2b2 | 207 | struct pool_features { |
e49e5829 JT |
208 | enum pool_mode mode; |
209 | ||
9bc142dd MS |
210 | bool zero_new_blocks:1; |
211 | bool discard_enabled:1; | |
212 | bool discard_passdown:1; | |
787a996c | 213 | bool error_if_no_space:1; |
67e2e2b2 JT |
214 | }; |
215 | ||
e49e5829 JT |
216 | struct thin_c; |
217 | typedef void (*process_bio_fn)(struct thin_c *tc, struct bio *bio); | |
a374bb21 | 218 | typedef void (*process_cell_fn)(struct thin_c *tc, struct dm_bio_prison_cell *cell); |
e49e5829 JT |
219 | typedef void (*process_mapping_fn)(struct dm_thin_new_mapping *m); |
220 | ||
ac4c3f34 JT |
221 | #define CELL_SORT_ARRAY_SIZE 8192 |
222 | ||
991d9fa0 JT |
223 | struct pool { |
224 | struct list_head list; | |
225 | struct dm_target *ti; /* Only set if a pool target is bound */ | |
226 | ||
227 | struct mapped_device *pool_md; | |
228 | struct block_device *md_dev; | |
229 | struct dm_pool_metadata *pmd; | |
230 | ||
991d9fa0 | 231 | dm_block_t low_water_blocks; |
55f2b8bd | 232 | uint32_t sectors_per_block; |
f9a8e0cd | 233 | int sectors_per_block_shift; |
991d9fa0 | 234 | |
67e2e2b2 | 235 | struct pool_features pf; |
88a6621b | 236 | bool low_water_triggered:1; /* A dm event has been sent */ |
80e96c54 | 237 | bool suspended:1; |
c3667cc6 | 238 | bool out_of_data_space:1; |
991d9fa0 | 239 | |
44feb387 | 240 | struct dm_bio_prison *prison; |
991d9fa0 JT |
241 | struct dm_kcopyd_client *copier; |
242 | ||
243 | struct workqueue_struct *wq; | |
7d327fe0 | 244 | struct throttle throttle; |
991d9fa0 | 245 | struct work_struct worker; |
905e51b3 | 246 | struct delayed_work waker; |
85ad643b | 247 | struct delayed_work no_space_timeout; |
991d9fa0 | 248 | |
905e51b3 | 249 | unsigned long last_commit_jiffies; |
55f2b8bd | 250 | unsigned ref_count; |
991d9fa0 JT |
251 | |
252 | spinlock_t lock; | |
991d9fa0 JT |
253 | struct bio_list deferred_flush_bios; |
254 | struct list_head prepared_mappings; | |
104655fd | 255 | struct list_head prepared_discards; |
c140e1c4 | 256 | struct list_head active_thins; |
991d9fa0 | 257 | |
44feb387 MS |
258 | struct dm_deferred_set *shared_read_ds; |
259 | struct dm_deferred_set *all_io_ds; | |
991d9fa0 | 260 | |
a24c2569 | 261 | struct dm_thin_new_mapping *next_mapping; |
991d9fa0 | 262 | mempool_t *mapping_pool; |
e49e5829 JT |
263 | |
264 | process_bio_fn process_bio; | |
265 | process_bio_fn process_discard; | |
266 | ||
a374bb21 JT |
267 | process_cell_fn process_cell; |
268 | process_cell_fn process_discard_cell; | |
269 | ||
e49e5829 JT |
270 | process_mapping_fn process_prepared_mapping; |
271 | process_mapping_fn process_prepared_discard; | |
ac4c3f34 | 272 | |
a822c83e | 273 | struct dm_bio_prison_cell **cell_sort_array; |
991d9fa0 JT |
274 | }; |
275 | ||
e49e5829 | 276 | static enum pool_mode get_pool_mode(struct pool *pool); |
b5330655 | 277 | static void metadata_operation_failed(struct pool *pool, const char *op, int r); |
e49e5829 | 278 | |
991d9fa0 JT |
279 | /* |
280 | * Target context for a pool. | |
281 | */ | |
282 | struct pool_c { | |
283 | struct dm_target *ti; | |
284 | struct pool *pool; | |
285 | struct dm_dev *data_dev; | |
286 | struct dm_dev *metadata_dev; | |
287 | struct dm_target_callbacks callbacks; | |
288 | ||
289 | dm_block_t low_water_blocks; | |
0424caa1 MS |
290 | struct pool_features requested_pf; /* Features requested during table load */ |
291 | struct pool_features adjusted_pf; /* Features used after adjusting for constituent devices */ | |
991d9fa0 JT |
292 | }; |
293 | ||
294 | /* | |
295 | * Target context for a thin. | |
296 | */ | |
297 | struct thin_c { | |
c140e1c4 | 298 | struct list_head list; |
991d9fa0 | 299 | struct dm_dev *pool_dev; |
2dd9c257 | 300 | struct dm_dev *origin_dev; |
e5aea7b4 | 301 | sector_t origin_size; |
991d9fa0 JT |
302 | dm_thin_id dev_id; |
303 | ||
304 | struct pool *pool; | |
305 | struct dm_thin_device *td; | |
583024d2 MS |
306 | struct mapped_device *thin_md; |
307 | ||
738211f7 | 308 | bool requeue_mode:1; |
c140e1c4 | 309 | spinlock_t lock; |
a374bb21 | 310 | struct list_head deferred_cells; |
c140e1c4 MS |
311 | struct bio_list deferred_bio_list; |
312 | struct bio_list retry_on_resume_list; | |
67324ea1 | 313 | struct rb_root sort_bio_list; /* sorted list of deferred bios */ |
b10ebd34 JT |
314 | |
315 | /* | |
316 | * Ensures the thin is not destroyed until the worker has finished | |
317 | * iterating the active_thins list. | |
318 | */ | |
319 | atomic_t refcount; | |
320 | struct completion can_destroy; | |
991d9fa0 JT |
321 | }; |
322 | ||
323 | /*----------------------------------------------------------------*/ | |
324 | ||
34fbcf62 JT |
325 | /** |
326 | * __blkdev_issue_discard_async - queue a discard with async completion | |
327 | * @bdev: blockdev to issue discard for | |
328 | * @sector: start sector | |
329 | * @nr_sects: number of sectors to discard | |
330 | * @gfp_mask: memory allocation flags (for bio_alloc) | |
331 | * @flags: BLKDEV_IFL_* flags to control behaviour | |
332 | * @parent_bio: parent discard bio that all sub discards get chained to | |
333 | * | |
334 | * Description: | |
335 | * Asynchronously issue a discard request for the sectors in question. | |
34fbcf62 JT |
336 | */ |
337 | static int __blkdev_issue_discard_async(struct block_device *bdev, sector_t sector, | |
338 | sector_t nr_sects, gfp_t gfp_mask, unsigned long flags, | |
339 | struct bio *parent_bio) | |
340 | { | |
341 | struct request_queue *q = bdev_get_queue(bdev); | |
342 | int type = REQ_WRITE | REQ_DISCARD; | |
34fbcf62 | 343 | struct bio *bio; |
34fbcf62 | 344 | |
84f8bd86 | 345 | if (!q || !nr_sects) |
34fbcf62 JT |
346 | return -ENXIO; |
347 | ||
348 | if (!blk_queue_discard(q)) | |
349 | return -EOPNOTSUPP; | |
350 | ||
34fbcf62 JT |
351 | if (flags & BLKDEV_DISCARD_SECURE) { |
352 | if (!blk_queue_secdiscard(q)) | |
353 | return -EOPNOTSUPP; | |
354 | type |= REQ_SECURE; | |
355 | } | |
356 | ||
84f8bd86 MS |
357 | /* |
358 | * Required bio_put occurs in bio_endio thanks to bio_chain below | |
359 | */ | |
360 | bio = bio_alloc(gfp_mask, 1); | |
361 | if (!bio) | |
362 | return -ENOMEM; | |
34fbcf62 | 363 | |
84f8bd86 | 364 | bio_chain(bio, parent_bio); |
34fbcf62 | 365 | |
84f8bd86 MS |
366 | bio->bi_iter.bi_sector = sector; |
367 | bio->bi_bdev = bdev; | |
368 | bio->bi_iter.bi_size = nr_sects << 9; | |
34fbcf62 | 369 | |
84f8bd86 | 370 | submit_bio(type, bio); |
34fbcf62 | 371 | |
84f8bd86 | 372 | return 0; |
34fbcf62 JT |
373 | } |
374 | ||
375 | static bool block_size_is_power_of_two(struct pool *pool) | |
376 | { | |
377 | return pool->sectors_per_block_shift >= 0; | |
378 | } | |
379 | ||
380 | static sector_t block_to_sectors(struct pool *pool, dm_block_t b) | |
381 | { | |
382 | return block_size_is_power_of_two(pool) ? | |
383 | (b << pool->sectors_per_block_shift) : | |
384 | (b * pool->sectors_per_block); | |
385 | } | |
386 | ||
387 | static int issue_discard(struct thin_c *tc, dm_block_t data_b, dm_block_t data_e, | |
388 | struct bio *parent_bio) | |
389 | { | |
390 | sector_t s = block_to_sectors(tc->pool, data_b); | |
391 | sector_t len = block_to_sectors(tc->pool, data_e - data_b); | |
392 | ||
393 | return __blkdev_issue_discard_async(tc->pool_dev->bdev, s, len, | |
394 | GFP_NOWAIT, 0, parent_bio); | |
395 | } | |
396 | ||
397 | /*----------------------------------------------------------------*/ | |
398 | ||
025b9685 JT |
399 | /* |
400 | * wake_worker() is used when new work is queued and when pool_resume is | |
401 | * ready to continue deferred IO processing. | |
402 | */ | |
403 | static void wake_worker(struct pool *pool) | |
404 | { | |
405 | queue_work(pool->wq, &pool->worker); | |
406 | } | |
407 | ||
408 | /*----------------------------------------------------------------*/ | |
409 | ||
6beca5eb JT |
410 | static int bio_detain(struct pool *pool, struct dm_cell_key *key, struct bio *bio, |
411 | struct dm_bio_prison_cell **cell_result) | |
412 | { | |
413 | int r; | |
414 | struct dm_bio_prison_cell *cell_prealloc; | |
415 | ||
416 | /* | |
417 | * Allocate a cell from the prison's mempool. | |
418 | * This might block but it can't fail. | |
419 | */ | |
420 | cell_prealloc = dm_bio_prison_alloc_cell(pool->prison, GFP_NOIO); | |
421 | ||
422 | r = dm_bio_detain(pool->prison, key, bio, cell_prealloc, cell_result); | |
423 | if (r) | |
424 | /* | |
425 | * We reused an old cell; we can get rid of | |
426 | * the new one. | |
427 | */ | |
428 | dm_bio_prison_free_cell(pool->prison, cell_prealloc); | |
429 | ||
430 | return r; | |
431 | } | |
432 | ||
433 | static void cell_release(struct pool *pool, | |
434 | struct dm_bio_prison_cell *cell, | |
435 | struct bio_list *bios) | |
436 | { | |
437 | dm_cell_release(pool->prison, cell, bios); | |
438 | dm_bio_prison_free_cell(pool->prison, cell); | |
439 | } | |
440 | ||
2d759a46 JT |
441 | static void cell_visit_release(struct pool *pool, |
442 | void (*fn)(void *, struct dm_bio_prison_cell *), | |
443 | void *context, | |
444 | struct dm_bio_prison_cell *cell) | |
445 | { | |
446 | dm_cell_visit_release(pool->prison, fn, context, cell); | |
447 | dm_bio_prison_free_cell(pool->prison, cell); | |
448 | } | |
449 | ||
6beca5eb JT |
450 | static void cell_release_no_holder(struct pool *pool, |
451 | struct dm_bio_prison_cell *cell, | |
452 | struct bio_list *bios) | |
453 | { | |
454 | dm_cell_release_no_holder(pool->prison, cell, bios); | |
455 | dm_bio_prison_free_cell(pool->prison, cell); | |
456 | } | |
457 | ||
af91805a MS |
458 | static void cell_error_with_code(struct pool *pool, |
459 | struct dm_bio_prison_cell *cell, int error_code) | |
6beca5eb | 460 | { |
af91805a | 461 | dm_cell_error(pool->prison, cell, error_code); |
6beca5eb JT |
462 | dm_bio_prison_free_cell(pool->prison, cell); |
463 | } | |
464 | ||
c3667cc6 MS |
465 | static int get_pool_io_error_code(struct pool *pool) |
466 | { | |
467 | return pool->out_of_data_space ? -ENOSPC : -EIO; | |
468 | } | |
469 | ||
af91805a MS |
470 | static void cell_error(struct pool *pool, struct dm_bio_prison_cell *cell) |
471 | { | |
c3667cc6 MS |
472 | int error = get_pool_io_error_code(pool); |
473 | ||
474 | cell_error_with_code(pool, cell, error); | |
af91805a MS |
475 | } |
476 | ||
a374bb21 JT |
477 | static void cell_success(struct pool *pool, struct dm_bio_prison_cell *cell) |
478 | { | |
479 | cell_error_with_code(pool, cell, 0); | |
480 | } | |
481 | ||
482 | static void cell_requeue(struct pool *pool, struct dm_bio_prison_cell *cell) | |
483 | { | |
484 | cell_error_with_code(pool, cell, DM_ENDIO_REQUEUE); | |
485 | } | |
486 | ||
6beca5eb JT |
487 | /*----------------------------------------------------------------*/ |
488 | ||
991d9fa0 JT |
489 | /* |
490 | * A global list of pools that uses a struct mapped_device as a key. | |
491 | */ | |
492 | static struct dm_thin_pool_table { | |
493 | struct mutex mutex; | |
494 | struct list_head pools; | |
495 | } dm_thin_pool_table; | |
496 | ||
497 | static void pool_table_init(void) | |
498 | { | |
499 | mutex_init(&dm_thin_pool_table.mutex); | |
500 | INIT_LIST_HEAD(&dm_thin_pool_table.pools); | |
501 | } | |
502 | ||
503 | static void __pool_table_insert(struct pool *pool) | |
504 | { | |
505 | BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex)); | |
506 | list_add(&pool->list, &dm_thin_pool_table.pools); | |
507 | } | |
508 | ||
509 | static void __pool_table_remove(struct pool *pool) | |
510 | { | |
511 | BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex)); | |
512 | list_del(&pool->list); | |
513 | } | |
514 | ||
515 | static struct pool *__pool_table_lookup(struct mapped_device *md) | |
516 | { | |
517 | struct pool *pool = NULL, *tmp; | |
518 | ||
519 | BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex)); | |
520 | ||
521 | list_for_each_entry(tmp, &dm_thin_pool_table.pools, list) { | |
522 | if (tmp->pool_md == md) { | |
523 | pool = tmp; | |
524 | break; | |
525 | } | |
526 | } | |
527 | ||
528 | return pool; | |
529 | } | |
530 | ||
531 | static struct pool *__pool_table_lookup_metadata_dev(struct block_device *md_dev) | |
532 | { | |
533 | struct pool *pool = NULL, *tmp; | |
534 | ||
535 | BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex)); | |
536 | ||
537 | list_for_each_entry(tmp, &dm_thin_pool_table.pools, list) { | |
538 | if (tmp->md_dev == md_dev) { | |
539 | pool = tmp; | |
540 | break; | |
541 | } | |
542 | } | |
543 | ||
544 | return pool; | |
545 | } | |
546 | ||
547 | /*----------------------------------------------------------------*/ | |
548 | ||
a24c2569 | 549 | struct dm_thin_endio_hook { |
eb2aa48d | 550 | struct thin_c *tc; |
44feb387 MS |
551 | struct dm_deferred_entry *shared_read_entry; |
552 | struct dm_deferred_entry *all_io_entry; | |
a24c2569 | 553 | struct dm_thin_new_mapping *overwrite_mapping; |
67324ea1 | 554 | struct rb_node rb_node; |
34fbcf62 | 555 | struct dm_bio_prison_cell *cell; |
eb2aa48d JT |
556 | }; |
557 | ||
42d6a8ce MS |
558 | static void __merge_bio_list(struct bio_list *bios, struct bio_list *master) |
559 | { | |
560 | bio_list_merge(bios, master); | |
561 | bio_list_init(master); | |
562 | } | |
563 | ||
564 | static void error_bio_list(struct bio_list *bios, int error) | |
991d9fa0 JT |
565 | { |
566 | struct bio *bio; | |
42d6a8ce | 567 | |
4246a0b6 CH |
568 | while ((bio = bio_list_pop(bios))) { |
569 | bio->bi_error = error; | |
570 | bio_endio(bio); | |
571 | } | |
42d6a8ce MS |
572 | } |
573 | ||
574 | static void error_thin_bio_list(struct thin_c *tc, struct bio_list *master, int error) | |
575 | { | |
991d9fa0 | 576 | struct bio_list bios; |
18adc577 | 577 | unsigned long flags; |
991d9fa0 JT |
578 | |
579 | bio_list_init(&bios); | |
18adc577 | 580 | |
c140e1c4 | 581 | spin_lock_irqsave(&tc->lock, flags); |
42d6a8ce | 582 | __merge_bio_list(&bios, master); |
c140e1c4 | 583 | spin_unlock_irqrestore(&tc->lock, flags); |
991d9fa0 | 584 | |
42d6a8ce | 585 | error_bio_list(&bios, error); |
991d9fa0 JT |
586 | } |
587 | ||
a374bb21 JT |
588 | static void requeue_deferred_cells(struct thin_c *tc) |
589 | { | |
590 | struct pool *pool = tc->pool; | |
591 | unsigned long flags; | |
592 | struct list_head cells; | |
593 | struct dm_bio_prison_cell *cell, *tmp; | |
594 | ||
595 | INIT_LIST_HEAD(&cells); | |
596 | ||
597 | spin_lock_irqsave(&tc->lock, flags); | |
598 | list_splice_init(&tc->deferred_cells, &cells); | |
599 | spin_unlock_irqrestore(&tc->lock, flags); | |
600 | ||
601 | list_for_each_entry_safe(cell, tmp, &cells, user_list) | |
602 | cell_requeue(pool, cell); | |
603 | } | |
604 | ||
991d9fa0 JT |
605 | static void requeue_io(struct thin_c *tc) |
606 | { | |
3e1a0699 | 607 | struct bio_list bios; |
42d6a8ce | 608 | unsigned long flags; |
3e1a0699 JT |
609 | |
610 | bio_list_init(&bios); | |
611 | ||
c140e1c4 | 612 | spin_lock_irqsave(&tc->lock, flags); |
42d6a8ce MS |
613 | __merge_bio_list(&bios, &tc->deferred_bio_list); |
614 | __merge_bio_list(&bios, &tc->retry_on_resume_list); | |
c140e1c4 | 615 | spin_unlock_irqrestore(&tc->lock, flags); |
3e1a0699 | 616 | |
42d6a8ce MS |
617 | error_bio_list(&bios, DM_ENDIO_REQUEUE); |
618 | requeue_deferred_cells(tc); | |
3e1a0699 JT |
619 | } |
620 | ||
0a927c2f | 621 | static void error_retry_list_with_code(struct pool *pool, int error) |
c140e1c4 MS |
622 | { |
623 | struct thin_c *tc; | |
624 | ||
625 | rcu_read_lock(); | |
626 | list_for_each_entry_rcu(tc, &pool->active_thins, list) | |
0a927c2f | 627 | error_thin_bio_list(tc, &tc->retry_on_resume_list, error); |
c140e1c4 MS |
628 | rcu_read_unlock(); |
629 | } | |
630 | ||
0a927c2f MS |
631 | static void error_retry_list(struct pool *pool) |
632 | { | |
c3667cc6 MS |
633 | int error = get_pool_io_error_code(pool); |
634 | ||
813923b1 | 635 | error_retry_list_with_code(pool, error); |
0a927c2f MS |
636 | } |
637 | ||
991d9fa0 JT |
638 | /* |
639 | * This section of code contains the logic for processing a thin device's IO. | |
640 | * Much of the code depends on pool object resources (lists, workqueues, etc) | |
641 | * but most is exclusively called from the thin target rather than the thin-pool | |
642 | * target. | |
643 | */ | |
644 | ||
645 | static dm_block_t get_bio_block(struct thin_c *tc, struct bio *bio) | |
646 | { | |
58f77a21 | 647 | struct pool *pool = tc->pool; |
4f024f37 | 648 | sector_t block_nr = bio->bi_iter.bi_sector; |
55f2b8bd | 649 | |
58f77a21 MS |
650 | if (block_size_is_power_of_two(pool)) |
651 | block_nr >>= pool->sectors_per_block_shift; | |
f9a8e0cd | 652 | else |
58f77a21 | 653 | (void) sector_div(block_nr, pool->sectors_per_block); |
55f2b8bd MS |
654 | |
655 | return block_nr; | |
991d9fa0 JT |
656 | } |
657 | ||
34fbcf62 JT |
658 | /* |
659 | * Returns the _complete_ blocks that this bio covers. | |
660 | */ | |
661 | static void get_bio_block_range(struct thin_c *tc, struct bio *bio, | |
662 | dm_block_t *begin, dm_block_t *end) | |
663 | { | |
664 | struct pool *pool = tc->pool; | |
665 | sector_t b = bio->bi_iter.bi_sector; | |
666 | sector_t e = b + (bio->bi_iter.bi_size >> SECTOR_SHIFT); | |
667 | ||
668 | b += pool->sectors_per_block - 1ull; /* so we round up */ | |
669 | ||
670 | if (block_size_is_power_of_two(pool)) { | |
671 | b >>= pool->sectors_per_block_shift; | |
672 | e >>= pool->sectors_per_block_shift; | |
673 | } else { | |
674 | (void) sector_div(b, pool->sectors_per_block); | |
675 | (void) sector_div(e, pool->sectors_per_block); | |
676 | } | |
677 | ||
678 | if (e < b) | |
679 | /* Can happen if the bio is within a single block. */ | |
680 | e = b; | |
681 | ||
682 | *begin = b; | |
683 | *end = e; | |
684 | } | |
685 | ||
991d9fa0 JT |
686 | static void remap(struct thin_c *tc, struct bio *bio, dm_block_t block) |
687 | { | |
688 | struct pool *pool = tc->pool; | |
4f024f37 | 689 | sector_t bi_sector = bio->bi_iter.bi_sector; |
991d9fa0 JT |
690 | |
691 | bio->bi_bdev = tc->pool_dev->bdev; | |
58f77a21 | 692 | if (block_size_is_power_of_two(pool)) |
4f024f37 KO |
693 | bio->bi_iter.bi_sector = |
694 | (block << pool->sectors_per_block_shift) | | |
695 | (bi_sector & (pool->sectors_per_block - 1)); | |
58f77a21 | 696 | else |
4f024f37 | 697 | bio->bi_iter.bi_sector = (block * pool->sectors_per_block) + |
58f77a21 | 698 | sector_div(bi_sector, pool->sectors_per_block); |
991d9fa0 JT |
699 | } |
700 | ||
2dd9c257 JT |
701 | static void remap_to_origin(struct thin_c *tc, struct bio *bio) |
702 | { | |
703 | bio->bi_bdev = tc->origin_dev->bdev; | |
704 | } | |
705 | ||
4afdd680 JT |
706 | static int bio_triggers_commit(struct thin_c *tc, struct bio *bio) |
707 | { | |
708 | return (bio->bi_rw & (REQ_FLUSH | REQ_FUA)) && | |
709 | dm_thin_changed_this_transaction(tc->td); | |
710 | } | |
711 | ||
e8088073 JT |
712 | static void inc_all_io_entry(struct pool *pool, struct bio *bio) |
713 | { | |
714 | struct dm_thin_endio_hook *h; | |
715 | ||
716 | if (bio->bi_rw & REQ_DISCARD) | |
717 | return; | |
718 | ||
59c3d2c6 | 719 | h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook)); |
e8088073 JT |
720 | h->all_io_entry = dm_deferred_entry_inc(pool->all_io_ds); |
721 | } | |
722 | ||
2dd9c257 | 723 | static void issue(struct thin_c *tc, struct bio *bio) |
991d9fa0 JT |
724 | { |
725 | struct pool *pool = tc->pool; | |
726 | unsigned long flags; | |
727 | ||
e49e5829 JT |
728 | if (!bio_triggers_commit(tc, bio)) { |
729 | generic_make_request(bio); | |
730 | return; | |
731 | } | |
732 | ||
991d9fa0 | 733 | /* |
e49e5829 JT |
734 | * Complete bio with an error if earlier I/O caused changes to |
735 | * the metadata that can't be committed e.g, due to I/O errors | |
736 | * on the metadata device. | |
991d9fa0 | 737 | */ |
e49e5829 JT |
738 | if (dm_thin_aborted_changes(tc->td)) { |
739 | bio_io_error(bio); | |
740 | return; | |
741 | } | |
742 | ||
743 | /* | |
744 | * Batch together any bios that trigger commits and then issue a | |
745 | * single commit for them in process_deferred_bios(). | |
746 | */ | |
747 | spin_lock_irqsave(&pool->lock, flags); | |
748 | bio_list_add(&pool->deferred_flush_bios, bio); | |
749 | spin_unlock_irqrestore(&pool->lock, flags); | |
991d9fa0 JT |
750 | } |
751 | ||
2dd9c257 JT |
752 | static void remap_to_origin_and_issue(struct thin_c *tc, struct bio *bio) |
753 | { | |
754 | remap_to_origin(tc, bio); | |
755 | issue(tc, bio); | |
756 | } | |
757 | ||
758 | static void remap_and_issue(struct thin_c *tc, struct bio *bio, | |
759 | dm_block_t block) | |
760 | { | |
761 | remap(tc, bio, block); | |
762 | issue(tc, bio); | |
763 | } | |
764 | ||
991d9fa0 JT |
765 | /*----------------------------------------------------------------*/ |
766 | ||
767 | /* | |
768 | * Bio endio functions. | |
769 | */ | |
a24c2569 | 770 | struct dm_thin_new_mapping { |
991d9fa0 JT |
771 | struct list_head list; |
772 | ||
7f214665 | 773 | bool pass_discard:1; |
34fbcf62 | 774 | bool maybe_shared:1; |
991d9fa0 | 775 | |
50f3c3ef JT |
776 | /* |
777 | * Track quiescing, copying and zeroing preparation actions. When this | |
778 | * counter hits zero the block is prepared and can be inserted into the | |
779 | * btree. | |
780 | */ | |
781 | atomic_t prepare_actions; | |
782 | ||
7f214665 | 783 | int err; |
991d9fa0 | 784 | struct thin_c *tc; |
34fbcf62 | 785 | dm_block_t virt_begin, virt_end; |
991d9fa0 | 786 | dm_block_t data_block; |
34fbcf62 | 787 | struct dm_bio_prison_cell *cell; |
991d9fa0 JT |
788 | |
789 | /* | |
790 | * If the bio covers the whole area of a block then we can avoid | |
791 | * zeroing or copying. Instead this bio is hooked. The bio will | |
792 | * still be in the cell, so care has to be taken to avoid issuing | |
793 | * the bio twice. | |
794 | */ | |
795 | struct bio *bio; | |
796 | bio_end_io_t *saved_bi_end_io; | |
797 | }; | |
798 | ||
50f3c3ef | 799 | static void __complete_mapping_preparation(struct dm_thin_new_mapping *m) |
991d9fa0 JT |
800 | { |
801 | struct pool *pool = m->tc->pool; | |
802 | ||
50f3c3ef | 803 | if (atomic_dec_and_test(&m->prepare_actions)) { |
daec338b | 804 | list_add_tail(&m->list, &pool->prepared_mappings); |
991d9fa0 JT |
805 | wake_worker(pool); |
806 | } | |
807 | } | |
808 | ||
e5aea7b4 | 809 | static void complete_mapping_preparation(struct dm_thin_new_mapping *m) |
991d9fa0 JT |
810 | { |
811 | unsigned long flags; | |
991d9fa0 JT |
812 | struct pool *pool = m->tc->pool; |
813 | ||
991d9fa0 | 814 | spin_lock_irqsave(&pool->lock, flags); |
50f3c3ef | 815 | __complete_mapping_preparation(m); |
991d9fa0 JT |
816 | spin_unlock_irqrestore(&pool->lock, flags); |
817 | } | |
818 | ||
e5aea7b4 JT |
819 | static void copy_complete(int read_err, unsigned long write_err, void *context) |
820 | { | |
821 | struct dm_thin_new_mapping *m = context; | |
822 | ||
823 | m->err = read_err || write_err ? -EIO : 0; | |
824 | complete_mapping_preparation(m); | |
825 | } | |
826 | ||
4246a0b6 | 827 | static void overwrite_endio(struct bio *bio) |
991d9fa0 | 828 | { |
59c3d2c6 | 829 | struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook)); |
a24c2569 | 830 | struct dm_thin_new_mapping *m = h->overwrite_mapping; |
991d9fa0 | 831 | |
8b908f8e MS |
832 | bio->bi_end_io = m->saved_bi_end_io; |
833 | ||
4246a0b6 | 834 | m->err = bio->bi_error; |
e5aea7b4 | 835 | complete_mapping_preparation(m); |
991d9fa0 JT |
836 | } |
837 | ||
991d9fa0 JT |
838 | /*----------------------------------------------------------------*/ |
839 | ||
840 | /* | |
841 | * Workqueue. | |
842 | */ | |
843 | ||
844 | /* | |
845 | * Prepared mapping jobs. | |
846 | */ | |
847 | ||
848 | /* | |
2d759a46 JT |
849 | * This sends the bios in the cell, except the original holder, back |
850 | * to the deferred_bios list. | |
991d9fa0 | 851 | */ |
f286ba0e | 852 | static void cell_defer_no_holder(struct thin_c *tc, struct dm_bio_prison_cell *cell) |
991d9fa0 | 853 | { |
991d9fa0 JT |
854 | struct pool *pool = tc->pool; |
855 | unsigned long flags; | |
856 | ||
c140e1c4 MS |
857 | spin_lock_irqsave(&tc->lock, flags); |
858 | cell_release_no_holder(pool, cell, &tc->deferred_bio_list); | |
859 | spin_unlock_irqrestore(&tc->lock, flags); | |
991d9fa0 JT |
860 | |
861 | wake_worker(pool); | |
862 | } | |
863 | ||
a374bb21 JT |
864 | static void thin_defer_bio(struct thin_c *tc, struct bio *bio); |
865 | ||
2d759a46 JT |
866 | struct remap_info { |
867 | struct thin_c *tc; | |
868 | struct bio_list defer_bios; | |
869 | struct bio_list issue_bios; | |
870 | }; | |
871 | ||
872 | static void __inc_remap_and_issue_cell(void *context, | |
873 | struct dm_bio_prison_cell *cell) | |
a374bb21 | 874 | { |
2d759a46 | 875 | struct remap_info *info = context; |
a374bb21 | 876 | struct bio *bio; |
a374bb21 | 877 | |
2d759a46 | 878 | while ((bio = bio_list_pop(&cell->bios))) { |
a374bb21 | 879 | if (bio->bi_rw & (REQ_DISCARD | REQ_FLUSH | REQ_FUA)) |
2d759a46 | 880 | bio_list_add(&info->defer_bios, bio); |
a374bb21 | 881 | else { |
2d759a46 JT |
882 | inc_all_io_entry(info->tc->pool, bio); |
883 | ||
884 | /* | |
885 | * We can't issue the bios with the bio prison lock | |
886 | * held, so we add them to a list to issue on | |
887 | * return from this function. | |
888 | */ | |
889 | bio_list_add(&info->issue_bios, bio); | |
a374bb21 JT |
890 | } |
891 | } | |
892 | } | |
893 | ||
2d759a46 JT |
894 | static void inc_remap_and_issue_cell(struct thin_c *tc, |
895 | struct dm_bio_prison_cell *cell, | |
896 | dm_block_t block) | |
897 | { | |
898 | struct bio *bio; | |
899 | struct remap_info info; | |
900 | ||
901 | info.tc = tc; | |
902 | bio_list_init(&info.defer_bios); | |
903 | bio_list_init(&info.issue_bios); | |
904 | ||
905 | /* | |
906 | * We have to be careful to inc any bios we're about to issue | |
907 | * before the cell is released, and avoid a race with new bios | |
908 | * being added to the cell. | |
909 | */ | |
910 | cell_visit_release(tc->pool, __inc_remap_and_issue_cell, | |
911 | &info, cell); | |
912 | ||
913 | while ((bio = bio_list_pop(&info.defer_bios))) | |
914 | thin_defer_bio(tc, bio); | |
915 | ||
916 | while ((bio = bio_list_pop(&info.issue_bios))) | |
917 | remap_and_issue(info.tc, bio, block); | |
918 | } | |
919 | ||
e49e5829 JT |
920 | static void process_prepared_mapping_fail(struct dm_thin_new_mapping *m) |
921 | { | |
6beca5eb | 922 | cell_error(m->tc->pool, m->cell); |
e49e5829 JT |
923 | list_del(&m->list); |
924 | mempool_free(m, m->tc->pool->mapping_pool); | |
925 | } | |
025b9685 | 926 | |
a24c2569 | 927 | static void process_prepared_mapping(struct dm_thin_new_mapping *m) |
991d9fa0 JT |
928 | { |
929 | struct thin_c *tc = m->tc; | |
6beca5eb | 930 | struct pool *pool = tc->pool; |
8b908f8e | 931 | struct bio *bio = m->bio; |
991d9fa0 JT |
932 | int r; |
933 | ||
991d9fa0 | 934 | if (m->err) { |
6beca5eb | 935 | cell_error(pool, m->cell); |
905386f8 | 936 | goto out; |
991d9fa0 JT |
937 | } |
938 | ||
939 | /* | |
940 | * Commit the prepared block into the mapping btree. | |
941 | * Any I/O for this block arriving after this point will get | |
942 | * remapped to it directly. | |
943 | */ | |
34fbcf62 | 944 | r = dm_thin_insert_block(tc->td, m->virt_begin, m->data_block); |
991d9fa0 | 945 | if (r) { |
b5330655 | 946 | metadata_operation_failed(pool, "dm_thin_insert_block", r); |
6beca5eb | 947 | cell_error(pool, m->cell); |
905386f8 | 948 | goto out; |
991d9fa0 JT |
949 | } |
950 | ||
951 | /* | |
952 | * Release any bios held while the block was being provisioned. | |
953 | * If we are processing a write bio that completely covers the block, | |
954 | * we already processed it so can ignore it now when processing | |
955 | * the bios in the cell. | |
956 | */ | |
957 | if (bio) { | |
2d759a46 | 958 | inc_remap_and_issue_cell(tc, m->cell, m->data_block); |
4246a0b6 | 959 | bio_endio(bio); |
2d759a46 JT |
960 | } else { |
961 | inc_all_io_entry(tc->pool, m->cell->holder); | |
962 | remap_and_issue(tc, m->cell->holder, m->data_block); | |
963 | inc_remap_and_issue_cell(tc, m->cell, m->data_block); | |
964 | } | |
991d9fa0 | 965 | |
905386f8 | 966 | out: |
991d9fa0 | 967 | list_del(&m->list); |
6beca5eb | 968 | mempool_free(m, pool->mapping_pool); |
991d9fa0 JT |
969 | } |
970 | ||
34fbcf62 JT |
971 | /*----------------------------------------------------------------*/ |
972 | ||
973 | static void free_discard_mapping(struct dm_thin_new_mapping *m) | |
104655fd | 974 | { |
104655fd | 975 | struct thin_c *tc = m->tc; |
34fbcf62 JT |
976 | if (m->cell) |
977 | cell_defer_no_holder(tc, m->cell); | |
978 | mempool_free(m, tc->pool->mapping_pool); | |
979 | } | |
104655fd | 980 | |
34fbcf62 JT |
981 | static void process_prepared_discard_fail(struct dm_thin_new_mapping *m) |
982 | { | |
e49e5829 | 983 | bio_io_error(m->bio); |
34fbcf62 JT |
984 | free_discard_mapping(m); |
985 | } | |
986 | ||
987 | static void process_prepared_discard_success(struct dm_thin_new_mapping *m) | |
988 | { | |
4246a0b6 | 989 | bio_endio(m->bio); |
34fbcf62 JT |
990 | free_discard_mapping(m); |
991 | } | |
992 | ||
993 | static void process_prepared_discard_no_passdown(struct dm_thin_new_mapping *m) | |
994 | { | |
995 | int r; | |
996 | struct thin_c *tc = m->tc; | |
997 | ||
998 | r = dm_thin_remove_range(tc->td, m->cell->key.block_begin, m->cell->key.block_end); | |
999 | if (r) { | |
1000 | metadata_operation_failed(tc->pool, "dm_thin_remove_range", r); | |
1001 | bio_io_error(m->bio); | |
1002 | } else | |
4246a0b6 | 1003 | bio_endio(m->bio); |
34fbcf62 | 1004 | |
f286ba0e | 1005 | cell_defer_no_holder(tc, m->cell); |
e49e5829 JT |
1006 | mempool_free(m, tc->pool->mapping_pool); |
1007 | } | |
1008 | ||
34fbcf62 | 1009 | static int passdown_double_checking_shared_status(struct dm_thin_new_mapping *m) |
e49e5829 | 1010 | { |
34fbcf62 JT |
1011 | /* |
1012 | * We've already unmapped this range of blocks, but before we | |
1013 | * passdown we have to check that these blocks are now unused. | |
1014 | */ | |
1015 | int r; | |
1016 | bool used = true; | |
e49e5829 | 1017 | struct thin_c *tc = m->tc; |
34fbcf62 JT |
1018 | struct pool *pool = tc->pool; |
1019 | dm_block_t b = m->data_block, e, end = m->data_block + m->virt_end - m->virt_begin; | |
104655fd | 1020 | |
34fbcf62 JT |
1021 | while (b != end) { |
1022 | /* find start of unmapped run */ | |
1023 | for (; b < end; b++) { | |
1024 | r = dm_pool_block_is_used(pool->pmd, b, &used); | |
1025 | if (r) | |
1026 | return r; | |
e8088073 | 1027 | |
34fbcf62 JT |
1028 | if (!used) |
1029 | break; | |
19fa1a67 | 1030 | } |
104655fd | 1031 | |
34fbcf62 JT |
1032 | if (b == end) |
1033 | break; | |
1034 | ||
1035 | /* find end of run */ | |
1036 | for (e = b + 1; e != end; e++) { | |
1037 | r = dm_pool_block_is_used(pool->pmd, e, &used); | |
1038 | if (r) | |
1039 | return r; | |
1040 | ||
1041 | if (used) | |
1042 | break; | |
1043 | } | |
1044 | ||
1045 | r = issue_discard(tc, b, e, m->bio); | |
1046 | if (r) | |
1047 | return r; | |
1048 | ||
1049 | b = e; | |
1050 | } | |
1051 | ||
1052 | return 0; | |
104655fd JT |
1053 | } |
1054 | ||
34fbcf62 | 1055 | static void process_prepared_discard_passdown(struct dm_thin_new_mapping *m) |
e49e5829 JT |
1056 | { |
1057 | int r; | |
1058 | struct thin_c *tc = m->tc; | |
34fbcf62 | 1059 | struct pool *pool = tc->pool; |
e49e5829 | 1060 | |
34fbcf62 | 1061 | r = dm_thin_remove_range(tc->td, m->virt_begin, m->virt_end); |
e49e5829 | 1062 | if (r) |
34fbcf62 JT |
1063 | metadata_operation_failed(pool, "dm_thin_remove_range", r); |
1064 | ||
1065 | else if (m->maybe_shared) | |
1066 | r = passdown_double_checking_shared_status(m); | |
1067 | else | |
1068 | r = issue_discard(tc, m->data_block, m->data_block + (m->virt_end - m->virt_begin), m->bio); | |
e49e5829 | 1069 | |
34fbcf62 JT |
1070 | /* |
1071 | * Even if r is set, there could be sub discards in flight that we | |
1072 | * need to wait for. | |
1073 | */ | |
4246a0b6 CH |
1074 | m->bio->bi_error = r; |
1075 | bio_endio(m->bio); | |
34fbcf62 JT |
1076 | cell_defer_no_holder(tc, m->cell); |
1077 | mempool_free(m, pool->mapping_pool); | |
e49e5829 JT |
1078 | } |
1079 | ||
104655fd | 1080 | static void process_prepared(struct pool *pool, struct list_head *head, |
e49e5829 | 1081 | process_mapping_fn *fn) |
991d9fa0 JT |
1082 | { |
1083 | unsigned long flags; | |
1084 | struct list_head maps; | |
a24c2569 | 1085 | struct dm_thin_new_mapping *m, *tmp; |
991d9fa0 JT |
1086 | |
1087 | INIT_LIST_HEAD(&maps); | |
1088 | spin_lock_irqsave(&pool->lock, flags); | |
104655fd | 1089 | list_splice_init(head, &maps); |
991d9fa0 JT |
1090 | spin_unlock_irqrestore(&pool->lock, flags); |
1091 | ||
1092 | list_for_each_entry_safe(m, tmp, &maps, list) | |
e49e5829 | 1093 | (*fn)(m); |
991d9fa0 JT |
1094 | } |
1095 | ||
1096 | /* | |
1097 | * Deferred bio jobs. | |
1098 | */ | |
104655fd | 1099 | static int io_overlaps_block(struct pool *pool, struct bio *bio) |
991d9fa0 | 1100 | { |
4f024f37 KO |
1101 | return bio->bi_iter.bi_size == |
1102 | (pool->sectors_per_block << SECTOR_SHIFT); | |
104655fd JT |
1103 | } |
1104 | ||
1105 | static int io_overwrites_block(struct pool *pool, struct bio *bio) | |
1106 | { | |
1107 | return (bio_data_dir(bio) == WRITE) && | |
1108 | io_overlaps_block(pool, bio); | |
991d9fa0 JT |
1109 | } |
1110 | ||
1111 | static void save_and_set_endio(struct bio *bio, bio_end_io_t **save, | |
1112 | bio_end_io_t *fn) | |
1113 | { | |
1114 | *save = bio->bi_end_io; | |
1115 | bio->bi_end_io = fn; | |
1116 | } | |
1117 | ||
1118 | static int ensure_next_mapping(struct pool *pool) | |
1119 | { | |
1120 | if (pool->next_mapping) | |
1121 | return 0; | |
1122 | ||
1123 | pool->next_mapping = mempool_alloc(pool->mapping_pool, GFP_ATOMIC); | |
1124 | ||
1125 | return pool->next_mapping ? 0 : -ENOMEM; | |
1126 | } | |
1127 | ||
a24c2569 | 1128 | static struct dm_thin_new_mapping *get_next_mapping(struct pool *pool) |
991d9fa0 | 1129 | { |
16961b04 | 1130 | struct dm_thin_new_mapping *m = pool->next_mapping; |
991d9fa0 JT |
1131 | |
1132 | BUG_ON(!pool->next_mapping); | |
1133 | ||
16961b04 MS |
1134 | memset(m, 0, sizeof(struct dm_thin_new_mapping)); |
1135 | INIT_LIST_HEAD(&m->list); | |
1136 | m->bio = NULL; | |
1137 | ||
991d9fa0 JT |
1138 | pool->next_mapping = NULL; |
1139 | ||
16961b04 | 1140 | return m; |
991d9fa0 JT |
1141 | } |
1142 | ||
e5aea7b4 JT |
1143 | static void ll_zero(struct thin_c *tc, struct dm_thin_new_mapping *m, |
1144 | sector_t begin, sector_t end) | |
1145 | { | |
1146 | int r; | |
1147 | struct dm_io_region to; | |
1148 | ||
1149 | to.bdev = tc->pool_dev->bdev; | |
1150 | to.sector = begin; | |
1151 | to.count = end - begin; | |
1152 | ||
1153 | r = dm_kcopyd_zero(tc->pool->copier, 1, &to, 0, copy_complete, m); | |
1154 | if (r < 0) { | |
1155 | DMERR_LIMIT("dm_kcopyd_zero() failed"); | |
1156 | copy_complete(1, 1, m); | |
1157 | } | |
1158 | } | |
1159 | ||
452d7a62 | 1160 | static void remap_and_issue_overwrite(struct thin_c *tc, struct bio *bio, |
34fbcf62 | 1161 | dm_block_t data_begin, |
452d7a62 MS |
1162 | struct dm_thin_new_mapping *m) |
1163 | { | |
1164 | struct pool *pool = tc->pool; | |
1165 | struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook)); | |
1166 | ||
1167 | h->overwrite_mapping = m; | |
1168 | m->bio = bio; | |
1169 | save_and_set_endio(bio, &m->saved_bi_end_io, overwrite_endio); | |
1170 | inc_all_io_entry(pool, bio); | |
34fbcf62 | 1171 | remap_and_issue(tc, bio, data_begin); |
452d7a62 MS |
1172 | } |
1173 | ||
e5aea7b4 JT |
1174 | /* |
1175 | * A partial copy also needs to zero the uncopied region. | |
1176 | */ | |
991d9fa0 | 1177 | static void schedule_copy(struct thin_c *tc, dm_block_t virt_block, |
2dd9c257 JT |
1178 | struct dm_dev *origin, dm_block_t data_origin, |
1179 | dm_block_t data_dest, | |
e5aea7b4 JT |
1180 | struct dm_bio_prison_cell *cell, struct bio *bio, |
1181 | sector_t len) | |
991d9fa0 JT |
1182 | { |
1183 | int r; | |
1184 | struct pool *pool = tc->pool; | |
a24c2569 | 1185 | struct dm_thin_new_mapping *m = get_next_mapping(pool); |
991d9fa0 | 1186 | |
991d9fa0 | 1187 | m->tc = tc; |
34fbcf62 JT |
1188 | m->virt_begin = virt_block; |
1189 | m->virt_end = virt_block + 1u; | |
991d9fa0 JT |
1190 | m->data_block = data_dest; |
1191 | m->cell = cell; | |
991d9fa0 | 1192 | |
e5aea7b4 JT |
1193 | /* |
1194 | * quiesce action + copy action + an extra reference held for the | |
1195 | * duration of this function (we may need to inc later for a | |
1196 | * partial zero). | |
1197 | */ | |
1198 | atomic_set(&m->prepare_actions, 3); | |
1199 | ||
44feb387 | 1200 | if (!dm_deferred_set_add_work(pool->shared_read_ds, &m->list)) |
e5aea7b4 | 1201 | complete_mapping_preparation(m); /* already quiesced */ |
991d9fa0 JT |
1202 | |
1203 | /* | |
1204 | * IO to pool_dev remaps to the pool target's data_dev. | |
1205 | * | |
1206 | * If the whole block of data is being overwritten, we can issue the | |
1207 | * bio immediately. Otherwise we use kcopyd to clone the data first. | |
1208 | */ | |
452d7a62 MS |
1209 | if (io_overwrites_block(pool, bio)) |
1210 | remap_and_issue_overwrite(tc, bio, data_dest, m); | |
1211 | else { | |
991d9fa0 JT |
1212 | struct dm_io_region from, to; |
1213 | ||
2dd9c257 | 1214 | from.bdev = origin->bdev; |
991d9fa0 | 1215 | from.sector = data_origin * pool->sectors_per_block; |
e5aea7b4 | 1216 | from.count = len; |
991d9fa0 JT |
1217 | |
1218 | to.bdev = tc->pool_dev->bdev; | |
1219 | to.sector = data_dest * pool->sectors_per_block; | |
e5aea7b4 | 1220 | to.count = len; |
991d9fa0 JT |
1221 | |
1222 | r = dm_kcopyd_copy(pool->copier, &from, 1, &to, | |
1223 | 0, copy_complete, m); | |
1224 | if (r < 0) { | |
c397741c | 1225 | DMERR_LIMIT("dm_kcopyd_copy() failed"); |
e5aea7b4 JT |
1226 | copy_complete(1, 1, m); |
1227 | ||
1228 | /* | |
1229 | * We allow the zero to be issued, to simplify the | |
1230 | * error path. Otherwise we'd need to start | |
1231 | * worrying about decrementing the prepare_actions | |
1232 | * counter. | |
1233 | */ | |
1234 | } | |
1235 | ||
1236 | /* | |
1237 | * Do we need to zero a tail region? | |
1238 | */ | |
1239 | if (len < pool->sectors_per_block && pool->pf.zero_new_blocks) { | |
1240 | atomic_inc(&m->prepare_actions); | |
1241 | ll_zero(tc, m, | |
1242 | data_dest * pool->sectors_per_block + len, | |
1243 | (data_dest + 1) * pool->sectors_per_block); | |
991d9fa0 JT |
1244 | } |
1245 | } | |
e5aea7b4 JT |
1246 | |
1247 | complete_mapping_preparation(m); /* drop our ref */ | |
991d9fa0 JT |
1248 | } |
1249 | ||
2dd9c257 JT |
1250 | static void schedule_internal_copy(struct thin_c *tc, dm_block_t virt_block, |
1251 | dm_block_t data_origin, dm_block_t data_dest, | |
a24c2569 | 1252 | struct dm_bio_prison_cell *cell, struct bio *bio) |
2dd9c257 JT |
1253 | { |
1254 | schedule_copy(tc, virt_block, tc->pool_dev, | |
e5aea7b4 JT |
1255 | data_origin, data_dest, cell, bio, |
1256 | tc->pool->sectors_per_block); | |
2dd9c257 JT |
1257 | } |
1258 | ||
991d9fa0 | 1259 | static void schedule_zero(struct thin_c *tc, dm_block_t virt_block, |
a24c2569 | 1260 | dm_block_t data_block, struct dm_bio_prison_cell *cell, |
991d9fa0 JT |
1261 | struct bio *bio) |
1262 | { | |
1263 | struct pool *pool = tc->pool; | |
a24c2569 | 1264 | struct dm_thin_new_mapping *m = get_next_mapping(pool); |
991d9fa0 | 1265 | |
50f3c3ef | 1266 | atomic_set(&m->prepare_actions, 1); /* no need to quiesce */ |
991d9fa0 | 1267 | m->tc = tc; |
34fbcf62 JT |
1268 | m->virt_begin = virt_block; |
1269 | m->virt_end = virt_block + 1u; | |
991d9fa0 JT |
1270 | m->data_block = data_block; |
1271 | m->cell = cell; | |
991d9fa0 JT |
1272 | |
1273 | /* | |
1274 | * If the whole block of data is being overwritten or we are not | |
1275 | * zeroing pre-existing data, we can issue the bio immediately. | |
1276 | * Otherwise we use kcopyd to zero the data first. | |
1277 | */ | |
f8ae7525 MS |
1278 | if (pool->pf.zero_new_blocks) { |
1279 | if (io_overwrites_block(pool, bio)) | |
1280 | remap_and_issue_overwrite(tc, bio, data_block, m); | |
1281 | else | |
1282 | ll_zero(tc, m, data_block * pool->sectors_per_block, | |
1283 | (data_block + 1) * pool->sectors_per_block); | |
1284 | } else | |
991d9fa0 | 1285 | process_prepared_mapping(m); |
e5aea7b4 | 1286 | } |
991d9fa0 | 1287 | |
e5aea7b4 JT |
1288 | static void schedule_external_copy(struct thin_c *tc, dm_block_t virt_block, |
1289 | dm_block_t data_dest, | |
1290 | struct dm_bio_prison_cell *cell, struct bio *bio) | |
1291 | { | |
1292 | struct pool *pool = tc->pool; | |
1293 | sector_t virt_block_begin = virt_block * pool->sectors_per_block; | |
1294 | sector_t virt_block_end = (virt_block + 1) * pool->sectors_per_block; | |
1295 | ||
1296 | if (virt_block_end <= tc->origin_size) | |
1297 | schedule_copy(tc, virt_block, tc->origin_dev, | |
1298 | virt_block, data_dest, cell, bio, | |
1299 | pool->sectors_per_block); | |
1300 | ||
1301 | else if (virt_block_begin < tc->origin_size) | |
1302 | schedule_copy(tc, virt_block, tc->origin_dev, | |
1303 | virt_block, data_dest, cell, bio, | |
1304 | tc->origin_size - virt_block_begin); | |
1305 | ||
1306 | else | |
1307 | schedule_zero(tc, virt_block, data_dest, cell, bio); | |
991d9fa0 JT |
1308 | } |
1309 | ||
2c43fd26 JT |
1310 | static void set_pool_mode(struct pool *pool, enum pool_mode new_mode); |
1311 | ||
1312 | static void check_for_space(struct pool *pool) | |
1313 | { | |
1314 | int r; | |
1315 | dm_block_t nr_free; | |
1316 | ||
1317 | if (get_pool_mode(pool) != PM_OUT_OF_DATA_SPACE) | |
1318 | return; | |
1319 | ||
1320 | r = dm_pool_get_free_block_count(pool->pmd, &nr_free); | |
1321 | if (r) | |
1322 | return; | |
1323 | ||
1324 | if (nr_free) | |
1325 | set_pool_mode(pool, PM_WRITE); | |
1326 | } | |
1327 | ||
e49e5829 JT |
1328 | /* |
1329 | * A non-zero return indicates read_only or fail_io mode. | |
1330 | * Many callers don't care about the return value. | |
1331 | */ | |
020cc3b5 | 1332 | static int commit(struct pool *pool) |
e49e5829 JT |
1333 | { |
1334 | int r; | |
1335 | ||
8d07e8a5 | 1336 | if (get_pool_mode(pool) >= PM_READ_ONLY) |
e49e5829 JT |
1337 | return -EINVAL; |
1338 | ||
020cc3b5 | 1339 | r = dm_pool_commit_metadata(pool->pmd); |
b5330655 JT |
1340 | if (r) |
1341 | metadata_operation_failed(pool, "dm_pool_commit_metadata", r); | |
2c43fd26 JT |
1342 | else |
1343 | check_for_space(pool); | |
e49e5829 JT |
1344 | |
1345 | return r; | |
1346 | } | |
1347 | ||
88a6621b JT |
1348 | static void check_low_water_mark(struct pool *pool, dm_block_t free_blocks) |
1349 | { | |
1350 | unsigned long flags; | |
1351 | ||
1352 | if (free_blocks <= pool->low_water_blocks && !pool->low_water_triggered) { | |
1353 | DMWARN("%s: reached low water mark for data device: sending event.", | |
1354 | dm_device_name(pool->pool_md)); | |
1355 | spin_lock_irqsave(&pool->lock, flags); | |
1356 | pool->low_water_triggered = true; | |
1357 | spin_unlock_irqrestore(&pool->lock, flags); | |
1358 | dm_table_event(pool->ti->table); | |
1359 | } | |
1360 | } | |
1361 | ||
991d9fa0 JT |
1362 | static int alloc_data_block(struct thin_c *tc, dm_block_t *result) |
1363 | { | |
1364 | int r; | |
1365 | dm_block_t free_blocks; | |
991d9fa0 JT |
1366 | struct pool *pool = tc->pool; |
1367 | ||
3e1a0699 | 1368 | if (WARN_ON(get_pool_mode(pool) != PM_WRITE)) |
8d30abff JT |
1369 | return -EINVAL; |
1370 | ||
991d9fa0 | 1371 | r = dm_pool_get_free_block_count(pool->pmd, &free_blocks); |
b5330655 JT |
1372 | if (r) { |
1373 | metadata_operation_failed(pool, "dm_pool_get_free_block_count", r); | |
991d9fa0 | 1374 | return r; |
b5330655 | 1375 | } |
991d9fa0 | 1376 | |
88a6621b | 1377 | check_low_water_mark(pool, free_blocks); |
991d9fa0 JT |
1378 | |
1379 | if (!free_blocks) { | |
94563bad MS |
1380 | /* |
1381 | * Try to commit to see if that will free up some | |
1382 | * more space. | |
1383 | */ | |
020cc3b5 JT |
1384 | r = commit(pool); |
1385 | if (r) | |
1386 | return r; | |
991d9fa0 | 1387 | |
94563bad | 1388 | r = dm_pool_get_free_block_count(pool->pmd, &free_blocks); |
b5330655 JT |
1389 | if (r) { |
1390 | metadata_operation_failed(pool, "dm_pool_get_free_block_count", r); | |
94563bad | 1391 | return r; |
b5330655 | 1392 | } |
991d9fa0 | 1393 | |
94563bad | 1394 | if (!free_blocks) { |
3e1a0699 | 1395 | set_pool_mode(pool, PM_OUT_OF_DATA_SPACE); |
94563bad | 1396 | return -ENOSPC; |
991d9fa0 JT |
1397 | } |
1398 | } | |
1399 | ||
1400 | r = dm_pool_alloc_data_block(pool->pmd, result); | |
4a02b34e | 1401 | if (r) { |
b5330655 | 1402 | metadata_operation_failed(pool, "dm_pool_alloc_data_block", r); |
991d9fa0 | 1403 | return r; |
4a02b34e | 1404 | } |
991d9fa0 JT |
1405 | |
1406 | return 0; | |
1407 | } | |
1408 | ||
1409 | /* | |
1410 | * If we have run out of space, queue bios until the device is | |
1411 | * resumed, presumably after having been reloaded with more space. | |
1412 | */ | |
1413 | static void retry_on_resume(struct bio *bio) | |
1414 | { | |
59c3d2c6 | 1415 | struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook)); |
eb2aa48d | 1416 | struct thin_c *tc = h->tc; |
991d9fa0 JT |
1417 | unsigned long flags; |
1418 | ||
c140e1c4 MS |
1419 | spin_lock_irqsave(&tc->lock, flags); |
1420 | bio_list_add(&tc->retry_on_resume_list, bio); | |
1421 | spin_unlock_irqrestore(&tc->lock, flags); | |
991d9fa0 JT |
1422 | } |
1423 | ||
af91805a | 1424 | static int should_error_unserviceable_bio(struct pool *pool) |
8c0f0e8c | 1425 | { |
3e1a0699 JT |
1426 | enum pool_mode m = get_pool_mode(pool); |
1427 | ||
1428 | switch (m) { | |
1429 | case PM_WRITE: | |
1430 | /* Shouldn't get here */ | |
1431 | DMERR_LIMIT("bio unserviceable, yet pool is in PM_WRITE mode"); | |
af91805a | 1432 | return -EIO; |
3e1a0699 JT |
1433 | |
1434 | case PM_OUT_OF_DATA_SPACE: | |
af91805a | 1435 | return pool->pf.error_if_no_space ? -ENOSPC : 0; |
3e1a0699 JT |
1436 | |
1437 | case PM_READ_ONLY: | |
1438 | case PM_FAIL: | |
af91805a | 1439 | return -EIO; |
3e1a0699 JT |
1440 | default: |
1441 | /* Shouldn't get here */ | |
1442 | DMERR_LIMIT("bio unserviceable, yet pool has an unknown mode"); | |
af91805a | 1443 | return -EIO; |
3e1a0699 JT |
1444 | } |
1445 | } | |
8c0f0e8c | 1446 | |
3e1a0699 JT |
1447 | static void handle_unserviceable_bio(struct pool *pool, struct bio *bio) |
1448 | { | |
af91805a MS |
1449 | int error = should_error_unserviceable_bio(pool); |
1450 | ||
4246a0b6 CH |
1451 | if (error) { |
1452 | bio->bi_error = error; | |
1453 | bio_endio(bio); | |
1454 | } else | |
6d16202b | 1455 | retry_on_resume(bio); |
8c0f0e8c MS |
1456 | } |
1457 | ||
399caddf | 1458 | static void retry_bios_on_resume(struct pool *pool, struct dm_bio_prison_cell *cell) |
991d9fa0 JT |
1459 | { |
1460 | struct bio *bio; | |
1461 | struct bio_list bios; | |
af91805a | 1462 | int error; |
991d9fa0 | 1463 | |
af91805a MS |
1464 | error = should_error_unserviceable_bio(pool); |
1465 | if (error) { | |
1466 | cell_error_with_code(pool, cell, error); | |
3e1a0699 JT |
1467 | return; |
1468 | } | |
1469 | ||
991d9fa0 | 1470 | bio_list_init(&bios); |
6beca5eb | 1471 | cell_release(pool, cell, &bios); |
991d9fa0 | 1472 | |
9d094eeb MS |
1473 | while ((bio = bio_list_pop(&bios))) |
1474 | retry_on_resume(bio); | |
991d9fa0 JT |
1475 | } |
1476 | ||
34fbcf62 JT |
1477 | static void process_discard_cell_no_passdown(struct thin_c *tc, |
1478 | struct dm_bio_prison_cell *virt_cell) | |
104655fd | 1479 | { |
104655fd | 1480 | struct pool *pool = tc->pool; |
34fbcf62 | 1481 | struct dm_thin_new_mapping *m = get_next_mapping(pool); |
104655fd | 1482 | |
34fbcf62 JT |
1483 | /* |
1484 | * We don't need to lock the data blocks, since there's no | |
1485 | * passdown. We only lock data blocks for allocation and breaking sharing. | |
1486 | */ | |
1487 | m->tc = tc; | |
1488 | m->virt_begin = virt_cell->key.block_begin; | |
1489 | m->virt_end = virt_cell->key.block_end; | |
1490 | m->cell = virt_cell; | |
1491 | m->bio = virt_cell->holder; | |
104655fd | 1492 | |
34fbcf62 JT |
1493 | if (!dm_deferred_set_add_work(pool->all_io_ds, &m->list)) |
1494 | pool->process_prepared_discard(m); | |
1495 | } | |
104655fd | 1496 | |
34fbcf62 JT |
1497 | static void break_up_discard_bio(struct thin_c *tc, dm_block_t begin, dm_block_t end, |
1498 | struct bio *bio) | |
1499 | { | |
1500 | struct pool *pool = tc->pool; | |
1501 | ||
1502 | int r; | |
1503 | bool maybe_shared; | |
1504 | struct dm_cell_key data_key; | |
1505 | struct dm_bio_prison_cell *data_cell; | |
1506 | struct dm_thin_new_mapping *m; | |
1507 | dm_block_t virt_begin, virt_end, data_begin; | |
1508 | ||
1509 | while (begin != end) { | |
1510 | r = ensure_next_mapping(pool); | |
1511 | if (r) | |
1512 | /* we did our best */ | |
1513 | return; | |
e8088073 | 1514 | |
34fbcf62 JT |
1515 | r = dm_thin_find_mapped_range(tc->td, begin, end, &virt_begin, &virt_end, |
1516 | &data_begin, &maybe_shared); | |
1517 | if (r) | |
104655fd | 1518 | /* |
34fbcf62 JT |
1519 | * Silently fail, letting any mappings we've |
1520 | * created complete. | |
104655fd | 1521 | */ |
34fbcf62 JT |
1522 | break; |
1523 | ||
1524 | build_key(tc->td, PHYSICAL, data_begin, data_begin + (virt_end - virt_begin), &data_key); | |
1525 | if (bio_detain(tc->pool, &data_key, NULL, &data_cell)) { | |
1526 | /* contention, we'll give up with this range */ | |
1527 | begin = virt_end; | |
1528 | continue; | |
104655fd | 1529 | } |
104655fd | 1530 | |
104655fd | 1531 | /* |
34fbcf62 JT |
1532 | * IO may still be going to the destination block. We must |
1533 | * quiesce before we can do the removal. | |
104655fd | 1534 | */ |
34fbcf62 JT |
1535 | m = get_next_mapping(pool); |
1536 | m->tc = tc; | |
1537 | m->maybe_shared = maybe_shared; | |
1538 | m->virt_begin = virt_begin; | |
1539 | m->virt_end = virt_end; | |
1540 | m->data_block = data_begin; | |
1541 | m->cell = data_cell; | |
1542 | m->bio = bio; | |
104655fd | 1543 | |
34fbcf62 JT |
1544 | /* |
1545 | * The parent bio must not complete before sub discard bios are | |
1546 | * chained to it (see __blkdev_issue_discard_async's bio_chain)! | |
1547 | * | |
1548 | * This per-mapping bi_remaining increment is paired with | |
1549 | * the implicit decrement that occurs via bio_endio() in | |
1550 | * process_prepared_discard_{passdown,no_passdown}. | |
1551 | */ | |
13e4f8a6 | 1552 | bio_inc_remaining(bio); |
34fbcf62 JT |
1553 | if (!dm_deferred_set_add_work(pool->all_io_ds, &m->list)) |
1554 | pool->process_prepared_discard(m); | |
1555 | ||
1556 | begin = virt_end; | |
104655fd JT |
1557 | } |
1558 | } | |
1559 | ||
34fbcf62 JT |
1560 | static void process_discard_cell_passdown(struct thin_c *tc, struct dm_bio_prison_cell *virt_cell) |
1561 | { | |
1562 | struct bio *bio = virt_cell->holder; | |
1563 | struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook)); | |
1564 | ||
1565 | /* | |
1566 | * The virt_cell will only get freed once the origin bio completes. | |
1567 | * This means it will remain locked while all the individual | |
1568 | * passdown bios are in flight. | |
1569 | */ | |
1570 | h->cell = virt_cell; | |
1571 | break_up_discard_bio(tc, virt_cell->key.block_begin, virt_cell->key.block_end, bio); | |
1572 | ||
1573 | /* | |
1574 | * We complete the bio now, knowing that the bi_remaining field | |
1575 | * will prevent completion until the sub range discards have | |
1576 | * completed. | |
1577 | */ | |
4246a0b6 | 1578 | bio_endio(bio); |
34fbcf62 JT |
1579 | } |
1580 | ||
a374bb21 JT |
1581 | static void process_discard_bio(struct thin_c *tc, struct bio *bio) |
1582 | { | |
34fbcf62 JT |
1583 | dm_block_t begin, end; |
1584 | struct dm_cell_key virt_key; | |
1585 | struct dm_bio_prison_cell *virt_cell; | |
a374bb21 | 1586 | |
34fbcf62 JT |
1587 | get_bio_block_range(tc, bio, &begin, &end); |
1588 | if (begin == end) { | |
1589 | /* | |
1590 | * The discard covers less than a block. | |
1591 | */ | |
4246a0b6 | 1592 | bio_endio(bio); |
a374bb21 | 1593 | return; |
34fbcf62 | 1594 | } |
a374bb21 | 1595 | |
34fbcf62 JT |
1596 | build_key(tc->td, VIRTUAL, begin, end, &virt_key); |
1597 | if (bio_detain(tc->pool, &virt_key, bio, &virt_cell)) | |
1598 | /* | |
1599 | * Potential starvation issue: We're relying on the | |
1600 | * fs/application being well behaved, and not trying to | |
1601 | * send IO to a region at the same time as discarding it. | |
1602 | * If they do this persistently then it's possible this | |
1603 | * cell will never be granted. | |
1604 | */ | |
1605 | return; | |
1606 | ||
1607 | tc->pool->process_discard_cell(tc, virt_cell); | |
a374bb21 JT |
1608 | } |
1609 | ||
991d9fa0 | 1610 | static void break_sharing(struct thin_c *tc, struct bio *bio, dm_block_t block, |
44feb387 | 1611 | struct dm_cell_key *key, |
991d9fa0 | 1612 | struct dm_thin_lookup_result *lookup_result, |
a24c2569 | 1613 | struct dm_bio_prison_cell *cell) |
991d9fa0 JT |
1614 | { |
1615 | int r; | |
1616 | dm_block_t data_block; | |
d6fc2042 | 1617 | struct pool *pool = tc->pool; |
991d9fa0 JT |
1618 | |
1619 | r = alloc_data_block(tc, &data_block); | |
1620 | switch (r) { | |
1621 | case 0: | |
2dd9c257 JT |
1622 | schedule_internal_copy(tc, block, lookup_result->block, |
1623 | data_block, cell, bio); | |
991d9fa0 JT |
1624 | break; |
1625 | ||
1626 | case -ENOSPC: | |
399caddf | 1627 | retry_bios_on_resume(pool, cell); |
991d9fa0 JT |
1628 | break; |
1629 | ||
1630 | default: | |
c397741c MS |
1631 | DMERR_LIMIT("%s: alloc_data_block() failed: error = %d", |
1632 | __func__, r); | |
d6fc2042 | 1633 | cell_error(pool, cell); |
991d9fa0 JT |
1634 | break; |
1635 | } | |
1636 | } | |
1637 | ||
23ca2bb6 JT |
1638 | static void __remap_and_issue_shared_cell(void *context, |
1639 | struct dm_bio_prison_cell *cell) | |
1640 | { | |
1641 | struct remap_info *info = context; | |
1642 | struct bio *bio; | |
1643 | ||
1644 | while ((bio = bio_list_pop(&cell->bios))) { | |
1645 | if ((bio_data_dir(bio) == WRITE) || | |
1646 | (bio->bi_rw & (REQ_DISCARD | REQ_FLUSH | REQ_FUA))) | |
1647 | bio_list_add(&info->defer_bios, bio); | |
1648 | else { | |
1649 | struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook));; | |
1650 | ||
1651 | h->shared_read_entry = dm_deferred_entry_inc(info->tc->pool->shared_read_ds); | |
1652 | inc_all_io_entry(info->tc->pool, bio); | |
1653 | bio_list_add(&info->issue_bios, bio); | |
1654 | } | |
1655 | } | |
1656 | } | |
1657 | ||
1658 | static void remap_and_issue_shared_cell(struct thin_c *tc, | |
1659 | struct dm_bio_prison_cell *cell, | |
1660 | dm_block_t block) | |
1661 | { | |
1662 | struct bio *bio; | |
1663 | struct remap_info info; | |
1664 | ||
1665 | info.tc = tc; | |
1666 | bio_list_init(&info.defer_bios); | |
1667 | bio_list_init(&info.issue_bios); | |
1668 | ||
1669 | cell_visit_release(tc->pool, __remap_and_issue_shared_cell, | |
1670 | &info, cell); | |
1671 | ||
1672 | while ((bio = bio_list_pop(&info.defer_bios))) | |
1673 | thin_defer_bio(tc, bio); | |
1674 | ||
1675 | while ((bio = bio_list_pop(&info.issue_bios))) | |
1676 | remap_and_issue(tc, bio, block); | |
1677 | } | |
1678 | ||
991d9fa0 JT |
1679 | static void process_shared_bio(struct thin_c *tc, struct bio *bio, |
1680 | dm_block_t block, | |
23ca2bb6 JT |
1681 | struct dm_thin_lookup_result *lookup_result, |
1682 | struct dm_bio_prison_cell *virt_cell) | |
991d9fa0 | 1683 | { |
23ca2bb6 | 1684 | struct dm_bio_prison_cell *data_cell; |
991d9fa0 | 1685 | struct pool *pool = tc->pool; |
44feb387 | 1686 | struct dm_cell_key key; |
991d9fa0 JT |
1687 | |
1688 | /* | |
1689 | * If cell is already occupied, then sharing is already in the process | |
1690 | * of being broken so we have nothing further to do here. | |
1691 | */ | |
1692 | build_data_key(tc->td, lookup_result->block, &key); | |
23ca2bb6 JT |
1693 | if (bio_detain(pool, &key, bio, &data_cell)) { |
1694 | cell_defer_no_holder(tc, virt_cell); | |
991d9fa0 | 1695 | return; |
23ca2bb6 | 1696 | } |
991d9fa0 | 1697 | |
23ca2bb6 JT |
1698 | if (bio_data_dir(bio) == WRITE && bio->bi_iter.bi_size) { |
1699 | break_sharing(tc, bio, block, &key, lookup_result, data_cell); | |
1700 | cell_defer_no_holder(tc, virt_cell); | |
1701 | } else { | |
59c3d2c6 | 1702 | struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook)); |
991d9fa0 | 1703 | |
44feb387 | 1704 | h->shared_read_entry = dm_deferred_entry_inc(pool->shared_read_ds); |
e8088073 | 1705 | inc_all_io_entry(pool, bio); |
991d9fa0 | 1706 | remap_and_issue(tc, bio, lookup_result->block); |
23ca2bb6 JT |
1707 | |
1708 | remap_and_issue_shared_cell(tc, data_cell, lookup_result->block); | |
1709 | remap_and_issue_shared_cell(tc, virt_cell, lookup_result->block); | |
991d9fa0 JT |
1710 | } |
1711 | } | |
1712 | ||
1713 | static void provision_block(struct thin_c *tc, struct bio *bio, dm_block_t block, | |
a24c2569 | 1714 | struct dm_bio_prison_cell *cell) |
991d9fa0 JT |
1715 | { |
1716 | int r; | |
1717 | dm_block_t data_block; | |
6beca5eb | 1718 | struct pool *pool = tc->pool; |
991d9fa0 JT |
1719 | |
1720 | /* | |
1721 | * Remap empty bios (flushes) immediately, without provisioning. | |
1722 | */ | |
4f024f37 | 1723 | if (!bio->bi_iter.bi_size) { |
6beca5eb | 1724 | inc_all_io_entry(pool, bio); |
f286ba0e | 1725 | cell_defer_no_holder(tc, cell); |
e8088073 | 1726 | |
991d9fa0 JT |
1727 | remap_and_issue(tc, bio, 0); |
1728 | return; | |
1729 | } | |
1730 | ||
1731 | /* | |
1732 | * Fill read bios with zeroes and complete them immediately. | |
1733 | */ | |
1734 | if (bio_data_dir(bio) == READ) { | |
1735 | zero_fill_bio(bio); | |
f286ba0e | 1736 | cell_defer_no_holder(tc, cell); |
4246a0b6 | 1737 | bio_endio(bio); |
991d9fa0 JT |
1738 | return; |
1739 | } | |
1740 | ||
1741 | r = alloc_data_block(tc, &data_block); | |
1742 | switch (r) { | |
1743 | case 0: | |
2dd9c257 JT |
1744 | if (tc->origin_dev) |
1745 | schedule_external_copy(tc, block, data_block, cell, bio); | |
1746 | else | |
1747 | schedule_zero(tc, block, data_block, cell, bio); | |
991d9fa0 JT |
1748 | break; |
1749 | ||
1750 | case -ENOSPC: | |
399caddf | 1751 | retry_bios_on_resume(pool, cell); |
991d9fa0 JT |
1752 | break; |
1753 | ||
1754 | default: | |
c397741c MS |
1755 | DMERR_LIMIT("%s: alloc_data_block() failed: error = %d", |
1756 | __func__, r); | |
6beca5eb | 1757 | cell_error(pool, cell); |
991d9fa0 JT |
1758 | break; |
1759 | } | |
1760 | } | |
1761 | ||
a374bb21 | 1762 | static void process_cell(struct thin_c *tc, struct dm_bio_prison_cell *cell) |
991d9fa0 JT |
1763 | { |
1764 | int r; | |
6beca5eb | 1765 | struct pool *pool = tc->pool; |
a374bb21 | 1766 | struct bio *bio = cell->holder; |
991d9fa0 | 1767 | dm_block_t block = get_bio_block(tc, bio); |
991d9fa0 JT |
1768 | struct dm_thin_lookup_result lookup_result; |
1769 | ||
a374bb21 JT |
1770 | if (tc->requeue_mode) { |
1771 | cell_requeue(pool, cell); | |
991d9fa0 | 1772 | return; |
a374bb21 | 1773 | } |
991d9fa0 JT |
1774 | |
1775 | r = dm_thin_find_block(tc->td, block, 1, &lookup_result); | |
1776 | switch (r) { | |
1777 | case 0: | |
23ca2bb6 JT |
1778 | if (lookup_result.shared) |
1779 | process_shared_bio(tc, bio, block, &lookup_result, cell); | |
1780 | else { | |
6beca5eb | 1781 | inc_all_io_entry(pool, bio); |
991d9fa0 | 1782 | remap_and_issue(tc, bio, lookup_result.block); |
a374bb21 | 1783 | inc_remap_and_issue_cell(tc, cell, lookup_result.block); |
e8088073 | 1784 | } |
991d9fa0 JT |
1785 | break; |
1786 | ||
1787 | case -ENODATA: | |
2dd9c257 | 1788 | if (bio_data_dir(bio) == READ && tc->origin_dev) { |
6beca5eb | 1789 | inc_all_io_entry(pool, bio); |
f286ba0e | 1790 | cell_defer_no_holder(tc, cell); |
e8088073 | 1791 | |
e5aea7b4 JT |
1792 | if (bio_end_sector(bio) <= tc->origin_size) |
1793 | remap_to_origin_and_issue(tc, bio); | |
1794 | ||
1795 | else if (bio->bi_iter.bi_sector < tc->origin_size) { | |
1796 | zero_fill_bio(bio); | |
1797 | bio->bi_iter.bi_size = (tc->origin_size - bio->bi_iter.bi_sector) << SECTOR_SHIFT; | |
1798 | remap_to_origin_and_issue(tc, bio); | |
1799 | ||
1800 | } else { | |
1801 | zero_fill_bio(bio); | |
4246a0b6 | 1802 | bio_endio(bio); |
e5aea7b4 | 1803 | } |
2dd9c257 JT |
1804 | } else |
1805 | provision_block(tc, bio, block, cell); | |
991d9fa0 JT |
1806 | break; |
1807 | ||
1808 | default: | |
c397741c MS |
1809 | DMERR_LIMIT("%s: dm_thin_find_block() failed: error = %d", |
1810 | __func__, r); | |
f286ba0e | 1811 | cell_defer_no_holder(tc, cell); |
991d9fa0 JT |
1812 | bio_io_error(bio); |
1813 | break; | |
1814 | } | |
1815 | } | |
1816 | ||
a374bb21 JT |
1817 | static void process_bio(struct thin_c *tc, struct bio *bio) |
1818 | { | |
1819 | struct pool *pool = tc->pool; | |
1820 | dm_block_t block = get_bio_block(tc, bio); | |
1821 | struct dm_bio_prison_cell *cell; | |
1822 | struct dm_cell_key key; | |
1823 | ||
1824 | /* | |
1825 | * If cell is already occupied, then the block is already | |
1826 | * being provisioned so we have nothing further to do here. | |
1827 | */ | |
1828 | build_virtual_key(tc->td, block, &key); | |
1829 | if (bio_detain(pool, &key, bio, &cell)) | |
1830 | return; | |
1831 | ||
1832 | process_cell(tc, cell); | |
1833 | } | |
1834 | ||
1835 | static void __process_bio_read_only(struct thin_c *tc, struct bio *bio, | |
1836 | struct dm_bio_prison_cell *cell) | |
e49e5829 JT |
1837 | { |
1838 | int r; | |
1839 | int rw = bio_data_dir(bio); | |
1840 | dm_block_t block = get_bio_block(tc, bio); | |
1841 | struct dm_thin_lookup_result lookup_result; | |
1842 | ||
1843 | r = dm_thin_find_block(tc->td, block, 1, &lookup_result); | |
1844 | switch (r) { | |
1845 | case 0: | |
a374bb21 | 1846 | if (lookup_result.shared && (rw == WRITE) && bio->bi_iter.bi_size) { |
8c0f0e8c | 1847 | handle_unserviceable_bio(tc->pool, bio); |
a374bb21 JT |
1848 | if (cell) |
1849 | cell_defer_no_holder(tc, cell); | |
1850 | } else { | |
e8088073 | 1851 | inc_all_io_entry(tc->pool, bio); |
e49e5829 | 1852 | remap_and_issue(tc, bio, lookup_result.block); |
a374bb21 JT |
1853 | if (cell) |
1854 | inc_remap_and_issue_cell(tc, cell, lookup_result.block); | |
e8088073 | 1855 | } |
e49e5829 JT |
1856 | break; |
1857 | ||
1858 | case -ENODATA: | |
a374bb21 JT |
1859 | if (cell) |
1860 | cell_defer_no_holder(tc, cell); | |
e49e5829 | 1861 | if (rw != READ) { |
8c0f0e8c | 1862 | handle_unserviceable_bio(tc->pool, bio); |
e49e5829 JT |
1863 | break; |
1864 | } | |
1865 | ||
1866 | if (tc->origin_dev) { | |
e8088073 | 1867 | inc_all_io_entry(tc->pool, bio); |
e49e5829 JT |
1868 | remap_to_origin_and_issue(tc, bio); |
1869 | break; | |
1870 | } | |
1871 | ||
1872 | zero_fill_bio(bio); | |
4246a0b6 | 1873 | bio_endio(bio); |
e49e5829 JT |
1874 | break; |
1875 | ||
1876 | default: | |
c397741c MS |
1877 | DMERR_LIMIT("%s: dm_thin_find_block() failed: error = %d", |
1878 | __func__, r); | |
a374bb21 JT |
1879 | if (cell) |
1880 | cell_defer_no_holder(tc, cell); | |
e49e5829 JT |
1881 | bio_io_error(bio); |
1882 | break; | |
1883 | } | |
1884 | } | |
1885 | ||
a374bb21 JT |
1886 | static void process_bio_read_only(struct thin_c *tc, struct bio *bio) |
1887 | { | |
1888 | __process_bio_read_only(tc, bio, NULL); | |
1889 | } | |
1890 | ||
1891 | static void process_cell_read_only(struct thin_c *tc, struct dm_bio_prison_cell *cell) | |
1892 | { | |
1893 | __process_bio_read_only(tc, cell->holder, cell); | |
1894 | } | |
1895 | ||
3e1a0699 JT |
1896 | static void process_bio_success(struct thin_c *tc, struct bio *bio) |
1897 | { | |
4246a0b6 | 1898 | bio_endio(bio); |
3e1a0699 JT |
1899 | } |
1900 | ||
e49e5829 JT |
1901 | static void process_bio_fail(struct thin_c *tc, struct bio *bio) |
1902 | { | |
1903 | bio_io_error(bio); | |
1904 | } | |
1905 | ||
a374bb21 JT |
1906 | static void process_cell_success(struct thin_c *tc, struct dm_bio_prison_cell *cell) |
1907 | { | |
1908 | cell_success(tc->pool, cell); | |
1909 | } | |
1910 | ||
1911 | static void process_cell_fail(struct thin_c *tc, struct dm_bio_prison_cell *cell) | |
1912 | { | |
1913 | cell_error(tc->pool, cell); | |
1914 | } | |
1915 | ||
ac8c3f3d JT |
1916 | /* |
1917 | * FIXME: should we also commit due to size of transaction, measured in | |
1918 | * metadata blocks? | |
1919 | */ | |
905e51b3 JT |
1920 | static int need_commit_due_to_time(struct pool *pool) |
1921 | { | |
0f30af98 MS |
1922 | return !time_in_range(jiffies, pool->last_commit_jiffies, |
1923 | pool->last_commit_jiffies + COMMIT_PERIOD); | |
905e51b3 JT |
1924 | } |
1925 | ||
67324ea1 MS |
1926 | #define thin_pbd(node) rb_entry((node), struct dm_thin_endio_hook, rb_node) |
1927 | #define thin_bio(pbd) dm_bio_from_per_bio_data((pbd), sizeof(struct dm_thin_endio_hook)) | |
1928 | ||
1929 | static void __thin_bio_rb_add(struct thin_c *tc, struct bio *bio) | |
1930 | { | |
1931 | struct rb_node **rbp, *parent; | |
1932 | struct dm_thin_endio_hook *pbd; | |
1933 | sector_t bi_sector = bio->bi_iter.bi_sector; | |
1934 | ||
1935 | rbp = &tc->sort_bio_list.rb_node; | |
1936 | parent = NULL; | |
1937 | while (*rbp) { | |
1938 | parent = *rbp; | |
1939 | pbd = thin_pbd(parent); | |
1940 | ||
1941 | if (bi_sector < thin_bio(pbd)->bi_iter.bi_sector) | |
1942 | rbp = &(*rbp)->rb_left; | |
1943 | else | |
1944 | rbp = &(*rbp)->rb_right; | |
1945 | } | |
1946 | ||
1947 | pbd = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook)); | |
1948 | rb_link_node(&pbd->rb_node, parent, rbp); | |
1949 | rb_insert_color(&pbd->rb_node, &tc->sort_bio_list); | |
1950 | } | |
1951 | ||
1952 | static void __extract_sorted_bios(struct thin_c *tc) | |
1953 | { | |
1954 | struct rb_node *node; | |
1955 | struct dm_thin_endio_hook *pbd; | |
1956 | struct bio *bio; | |
1957 | ||
1958 | for (node = rb_first(&tc->sort_bio_list); node; node = rb_next(node)) { | |
1959 | pbd = thin_pbd(node); | |
1960 | bio = thin_bio(pbd); | |
1961 | ||
1962 | bio_list_add(&tc->deferred_bio_list, bio); | |
1963 | rb_erase(&pbd->rb_node, &tc->sort_bio_list); | |
1964 | } | |
1965 | ||
1966 | WARN_ON(!RB_EMPTY_ROOT(&tc->sort_bio_list)); | |
1967 | } | |
1968 | ||
1969 | static void __sort_thin_deferred_bios(struct thin_c *tc) | |
1970 | { | |
1971 | struct bio *bio; | |
1972 | struct bio_list bios; | |
1973 | ||
1974 | bio_list_init(&bios); | |
1975 | bio_list_merge(&bios, &tc->deferred_bio_list); | |
1976 | bio_list_init(&tc->deferred_bio_list); | |
1977 | ||
1978 | /* Sort deferred_bio_list using rb-tree */ | |
1979 | while ((bio = bio_list_pop(&bios))) | |
1980 | __thin_bio_rb_add(tc, bio); | |
1981 | ||
1982 | /* | |
1983 | * Transfer the sorted bios in sort_bio_list back to | |
1984 | * deferred_bio_list to allow lockless submission of | |
1985 | * all bios. | |
1986 | */ | |
1987 | __extract_sorted_bios(tc); | |
1988 | } | |
1989 | ||
c140e1c4 | 1990 | static void process_thin_deferred_bios(struct thin_c *tc) |
991d9fa0 | 1991 | { |
c140e1c4 | 1992 | struct pool *pool = tc->pool; |
991d9fa0 JT |
1993 | unsigned long flags; |
1994 | struct bio *bio; | |
1995 | struct bio_list bios; | |
67324ea1 | 1996 | struct blk_plug plug; |
8a01a6af | 1997 | unsigned count = 0; |
991d9fa0 | 1998 | |
c140e1c4 | 1999 | if (tc->requeue_mode) { |
42d6a8ce | 2000 | error_thin_bio_list(tc, &tc->deferred_bio_list, DM_ENDIO_REQUEUE); |
c140e1c4 MS |
2001 | return; |
2002 | } | |
2003 | ||
991d9fa0 JT |
2004 | bio_list_init(&bios); |
2005 | ||
c140e1c4 | 2006 | spin_lock_irqsave(&tc->lock, flags); |
67324ea1 MS |
2007 | |
2008 | if (bio_list_empty(&tc->deferred_bio_list)) { | |
2009 | spin_unlock_irqrestore(&tc->lock, flags); | |
2010 | return; | |
2011 | } | |
2012 | ||
2013 | __sort_thin_deferred_bios(tc); | |
2014 | ||
c140e1c4 MS |
2015 | bio_list_merge(&bios, &tc->deferred_bio_list); |
2016 | bio_list_init(&tc->deferred_bio_list); | |
67324ea1 | 2017 | |
c140e1c4 | 2018 | spin_unlock_irqrestore(&tc->lock, flags); |
991d9fa0 | 2019 | |
67324ea1 | 2020 | blk_start_plug(&plug); |
991d9fa0 | 2021 | while ((bio = bio_list_pop(&bios))) { |
991d9fa0 JT |
2022 | /* |
2023 | * If we've got no free new_mapping structs, and processing | |
2024 | * this bio might require one, we pause until there are some | |
2025 | * prepared mappings to process. | |
2026 | */ | |
2027 | if (ensure_next_mapping(pool)) { | |
c140e1c4 MS |
2028 | spin_lock_irqsave(&tc->lock, flags); |
2029 | bio_list_add(&tc->deferred_bio_list, bio); | |
2030 | bio_list_merge(&tc->deferred_bio_list, &bios); | |
2031 | spin_unlock_irqrestore(&tc->lock, flags); | |
991d9fa0 JT |
2032 | break; |
2033 | } | |
104655fd JT |
2034 | |
2035 | if (bio->bi_rw & REQ_DISCARD) | |
e49e5829 | 2036 | pool->process_discard(tc, bio); |
104655fd | 2037 | else |
e49e5829 | 2038 | pool->process_bio(tc, bio); |
8a01a6af JT |
2039 | |
2040 | if ((count++ & 127) == 0) { | |
7d327fe0 | 2041 | throttle_work_update(&pool->throttle); |
8a01a6af JT |
2042 | dm_pool_issue_prefetches(pool->pmd); |
2043 | } | |
991d9fa0 | 2044 | } |
67324ea1 | 2045 | blk_finish_plug(&plug); |
c140e1c4 MS |
2046 | } |
2047 | ||
ac4c3f34 JT |
2048 | static int cmp_cells(const void *lhs, const void *rhs) |
2049 | { | |
2050 | struct dm_bio_prison_cell *lhs_cell = *((struct dm_bio_prison_cell **) lhs); | |
2051 | struct dm_bio_prison_cell *rhs_cell = *((struct dm_bio_prison_cell **) rhs); | |
2052 | ||
2053 | BUG_ON(!lhs_cell->holder); | |
2054 | BUG_ON(!rhs_cell->holder); | |
2055 | ||
2056 | if (lhs_cell->holder->bi_iter.bi_sector < rhs_cell->holder->bi_iter.bi_sector) | |
2057 | return -1; | |
2058 | ||
2059 | if (lhs_cell->holder->bi_iter.bi_sector > rhs_cell->holder->bi_iter.bi_sector) | |
2060 | return 1; | |
2061 | ||
2062 | return 0; | |
2063 | } | |
2064 | ||
2065 | static unsigned sort_cells(struct pool *pool, struct list_head *cells) | |
2066 | { | |
2067 | unsigned count = 0; | |
2068 | struct dm_bio_prison_cell *cell, *tmp; | |
2069 | ||
2070 | list_for_each_entry_safe(cell, tmp, cells, user_list) { | |
2071 | if (count >= CELL_SORT_ARRAY_SIZE) | |
2072 | break; | |
2073 | ||
2074 | pool->cell_sort_array[count++] = cell; | |
2075 | list_del(&cell->user_list); | |
2076 | } | |
2077 | ||
2078 | sort(pool->cell_sort_array, count, sizeof(cell), cmp_cells, NULL); | |
2079 | ||
2080 | return count; | |
2081 | } | |
2082 | ||
a374bb21 JT |
2083 | static void process_thin_deferred_cells(struct thin_c *tc) |
2084 | { | |
2085 | struct pool *pool = tc->pool; | |
2086 | unsigned long flags; | |
2087 | struct list_head cells; | |
ac4c3f34 JT |
2088 | struct dm_bio_prison_cell *cell; |
2089 | unsigned i, j, count; | |
a374bb21 JT |
2090 | |
2091 | INIT_LIST_HEAD(&cells); | |
2092 | ||
2093 | spin_lock_irqsave(&tc->lock, flags); | |
2094 | list_splice_init(&tc->deferred_cells, &cells); | |
2095 | spin_unlock_irqrestore(&tc->lock, flags); | |
2096 | ||
2097 | if (list_empty(&cells)) | |
2098 | return; | |
2099 | ||
ac4c3f34 JT |
2100 | do { |
2101 | count = sort_cells(tc->pool, &cells); | |
a374bb21 | 2102 | |
ac4c3f34 JT |
2103 | for (i = 0; i < count; i++) { |
2104 | cell = pool->cell_sort_array[i]; | |
2105 | BUG_ON(!cell->holder); | |
a374bb21 | 2106 | |
ac4c3f34 JT |
2107 | /* |
2108 | * If we've got no free new_mapping structs, and processing | |
2109 | * this bio might require one, we pause until there are some | |
2110 | * prepared mappings to process. | |
2111 | */ | |
2112 | if (ensure_next_mapping(pool)) { | |
2113 | for (j = i; j < count; j++) | |
2114 | list_add(&pool->cell_sort_array[j]->user_list, &cells); | |
2115 | ||
2116 | spin_lock_irqsave(&tc->lock, flags); | |
2117 | list_splice(&cells, &tc->deferred_cells); | |
2118 | spin_unlock_irqrestore(&tc->lock, flags); | |
2119 | return; | |
2120 | } | |
2121 | ||
2122 | if (cell->holder->bi_rw & REQ_DISCARD) | |
2123 | pool->process_discard_cell(tc, cell); | |
2124 | else | |
2125 | pool->process_cell(tc, cell); | |
2126 | } | |
2127 | } while (!list_empty(&cells)); | |
a374bb21 JT |
2128 | } |
2129 | ||
b10ebd34 JT |
2130 | static void thin_get(struct thin_c *tc); |
2131 | static void thin_put(struct thin_c *tc); | |
2132 | ||
2133 | /* | |
2134 | * We can't hold rcu_read_lock() around code that can block. So we | |
2135 | * find a thin with the rcu lock held; bump a refcount; then drop | |
2136 | * the lock. | |
2137 | */ | |
2138 | static struct thin_c *get_first_thin(struct pool *pool) | |
2139 | { | |
2140 | struct thin_c *tc = NULL; | |
2141 | ||
2142 | rcu_read_lock(); | |
2143 | if (!list_empty(&pool->active_thins)) { | |
2144 | tc = list_entry_rcu(pool->active_thins.next, struct thin_c, list); | |
2145 | thin_get(tc); | |
2146 | } | |
2147 | rcu_read_unlock(); | |
2148 | ||
2149 | return tc; | |
2150 | } | |
2151 | ||
2152 | static struct thin_c *get_next_thin(struct pool *pool, struct thin_c *tc) | |
2153 | { | |
2154 | struct thin_c *old_tc = tc; | |
2155 | ||
2156 | rcu_read_lock(); | |
2157 | list_for_each_entry_continue_rcu(tc, &pool->active_thins, list) { | |
2158 | thin_get(tc); | |
2159 | thin_put(old_tc); | |
2160 | rcu_read_unlock(); | |
2161 | return tc; | |
2162 | } | |
2163 | thin_put(old_tc); | |
2164 | rcu_read_unlock(); | |
2165 | ||
2166 | return NULL; | |
2167 | } | |
2168 | ||
c140e1c4 MS |
2169 | static void process_deferred_bios(struct pool *pool) |
2170 | { | |
2171 | unsigned long flags; | |
2172 | struct bio *bio; | |
2173 | struct bio_list bios; | |
2174 | struct thin_c *tc; | |
2175 | ||
b10ebd34 JT |
2176 | tc = get_first_thin(pool); |
2177 | while (tc) { | |
a374bb21 | 2178 | process_thin_deferred_cells(tc); |
c140e1c4 | 2179 | process_thin_deferred_bios(tc); |
b10ebd34 JT |
2180 | tc = get_next_thin(pool, tc); |
2181 | } | |
991d9fa0 JT |
2182 | |
2183 | /* | |
2184 | * If there are any deferred flush bios, we must commit | |
2185 | * the metadata before issuing them. | |
2186 | */ | |
2187 | bio_list_init(&bios); | |
2188 | spin_lock_irqsave(&pool->lock, flags); | |
2189 | bio_list_merge(&bios, &pool->deferred_flush_bios); | |
2190 | bio_list_init(&pool->deferred_flush_bios); | |
2191 | spin_unlock_irqrestore(&pool->lock, flags); | |
2192 | ||
4d1662a3 MS |
2193 | if (bio_list_empty(&bios) && |
2194 | !(dm_pool_changed_this_transaction(pool->pmd) && need_commit_due_to_time(pool))) | |
991d9fa0 JT |
2195 | return; |
2196 | ||
020cc3b5 | 2197 | if (commit(pool)) { |
991d9fa0 JT |
2198 | while ((bio = bio_list_pop(&bios))) |
2199 | bio_io_error(bio); | |
2200 | return; | |
2201 | } | |
905e51b3 | 2202 | pool->last_commit_jiffies = jiffies; |
991d9fa0 JT |
2203 | |
2204 | while ((bio = bio_list_pop(&bios))) | |
2205 | generic_make_request(bio); | |
2206 | } | |
2207 | ||
2208 | static void do_worker(struct work_struct *ws) | |
2209 | { | |
2210 | struct pool *pool = container_of(ws, struct pool, worker); | |
2211 | ||
7d327fe0 | 2212 | throttle_work_start(&pool->throttle); |
8a01a6af | 2213 | dm_pool_issue_prefetches(pool->pmd); |
7d327fe0 | 2214 | throttle_work_update(&pool->throttle); |
e49e5829 | 2215 | process_prepared(pool, &pool->prepared_mappings, &pool->process_prepared_mapping); |
7d327fe0 | 2216 | throttle_work_update(&pool->throttle); |
e49e5829 | 2217 | process_prepared(pool, &pool->prepared_discards, &pool->process_prepared_discard); |
7d327fe0 | 2218 | throttle_work_update(&pool->throttle); |
991d9fa0 | 2219 | process_deferred_bios(pool); |
7d327fe0 | 2220 | throttle_work_complete(&pool->throttle); |
991d9fa0 JT |
2221 | } |
2222 | ||
905e51b3 JT |
2223 | /* |
2224 | * We want to commit periodically so that not too much | |
2225 | * unwritten data builds up. | |
2226 | */ | |
2227 | static void do_waker(struct work_struct *ws) | |
2228 | { | |
2229 | struct pool *pool = container_of(to_delayed_work(ws), struct pool, waker); | |
2230 | wake_worker(pool); | |
2231 | queue_delayed_work(pool->wq, &pool->waker, COMMIT_PERIOD); | |
2232 | } | |
2233 | ||
bcc696fa MS |
2234 | static void notify_of_pool_mode_change_to_oods(struct pool *pool); |
2235 | ||
85ad643b JT |
2236 | /* |
2237 | * We're holding onto IO to allow userland time to react. After the | |
2238 | * timeout either the pool will have been resized (and thus back in | |
bcc696fa | 2239 | * PM_WRITE mode), or we degrade to PM_OUT_OF_DATA_SPACE w/ error_if_no_space. |
85ad643b JT |
2240 | */ |
2241 | static void do_no_space_timeout(struct work_struct *ws) | |
2242 | { | |
2243 | struct pool *pool = container_of(to_delayed_work(ws), struct pool, | |
2244 | no_space_timeout); | |
2245 | ||
bcc696fa MS |
2246 | if (get_pool_mode(pool) == PM_OUT_OF_DATA_SPACE && !pool->pf.error_if_no_space) { |
2247 | pool->pf.error_if_no_space = true; | |
2248 | notify_of_pool_mode_change_to_oods(pool); | |
0a927c2f | 2249 | error_retry_list_with_code(pool, -ENOSPC); |
bcc696fa | 2250 | } |
85ad643b JT |
2251 | } |
2252 | ||
991d9fa0 JT |
2253 | /*----------------------------------------------------------------*/ |
2254 | ||
e7a3e871 | 2255 | struct pool_work { |
738211f7 | 2256 | struct work_struct worker; |
e7a3e871 JT |
2257 | struct completion complete; |
2258 | }; | |
2259 | ||
2260 | static struct pool_work *to_pool_work(struct work_struct *ws) | |
2261 | { | |
2262 | return container_of(ws, struct pool_work, worker); | |
2263 | } | |
2264 | ||
2265 | static void pool_work_complete(struct pool_work *pw) | |
2266 | { | |
2267 | complete(&pw->complete); | |
2268 | } | |
738211f7 | 2269 | |
e7a3e871 JT |
2270 | static void pool_work_wait(struct pool_work *pw, struct pool *pool, |
2271 | void (*fn)(struct work_struct *)) | |
2272 | { | |
2273 | INIT_WORK_ONSTACK(&pw->worker, fn); | |
2274 | init_completion(&pw->complete); | |
2275 | queue_work(pool->wq, &pw->worker); | |
2276 | wait_for_completion(&pw->complete); | |
2277 | } | |
2278 | ||
2279 | /*----------------------------------------------------------------*/ | |
2280 | ||
2281 | struct noflush_work { | |
2282 | struct pool_work pw; | |
2283 | struct thin_c *tc; | |
738211f7 JT |
2284 | }; |
2285 | ||
e7a3e871 | 2286 | static struct noflush_work *to_noflush(struct work_struct *ws) |
738211f7 | 2287 | { |
e7a3e871 | 2288 | return container_of(to_pool_work(ws), struct noflush_work, pw); |
738211f7 JT |
2289 | } |
2290 | ||
2291 | static void do_noflush_start(struct work_struct *ws) | |
2292 | { | |
e7a3e871 | 2293 | struct noflush_work *w = to_noflush(ws); |
738211f7 JT |
2294 | w->tc->requeue_mode = true; |
2295 | requeue_io(w->tc); | |
e7a3e871 | 2296 | pool_work_complete(&w->pw); |
738211f7 JT |
2297 | } |
2298 | ||
2299 | static void do_noflush_stop(struct work_struct *ws) | |
2300 | { | |
e7a3e871 | 2301 | struct noflush_work *w = to_noflush(ws); |
738211f7 | 2302 | w->tc->requeue_mode = false; |
e7a3e871 | 2303 | pool_work_complete(&w->pw); |
738211f7 JT |
2304 | } |
2305 | ||
2306 | static void noflush_work(struct thin_c *tc, void (*fn)(struct work_struct *)) | |
2307 | { | |
2308 | struct noflush_work w; | |
2309 | ||
738211f7 | 2310 | w.tc = tc; |
e7a3e871 | 2311 | pool_work_wait(&w.pw, tc->pool, fn); |
738211f7 JT |
2312 | } |
2313 | ||
2314 | /*----------------------------------------------------------------*/ | |
2315 | ||
e49e5829 JT |
2316 | static enum pool_mode get_pool_mode(struct pool *pool) |
2317 | { | |
2318 | return pool->pf.mode; | |
2319 | } | |
2320 | ||
3e1a0699 JT |
2321 | static void notify_of_pool_mode_change(struct pool *pool, const char *new_mode) |
2322 | { | |
2323 | dm_table_event(pool->ti->table); | |
2324 | DMINFO("%s: switching pool to %s mode", | |
2325 | dm_device_name(pool->pool_md), new_mode); | |
2326 | } | |
2327 | ||
bcc696fa MS |
2328 | static void notify_of_pool_mode_change_to_oods(struct pool *pool) |
2329 | { | |
2330 | if (!pool->pf.error_if_no_space) | |
2331 | notify_of_pool_mode_change(pool, "out-of-data-space (queue IO)"); | |
2332 | else | |
2333 | notify_of_pool_mode_change(pool, "out-of-data-space (error IO)"); | |
2334 | } | |
2335 | ||
34fbcf62 JT |
2336 | static bool passdown_enabled(struct pool_c *pt) |
2337 | { | |
2338 | return pt->adjusted_pf.discard_passdown; | |
2339 | } | |
2340 | ||
2341 | static void set_discard_callbacks(struct pool *pool) | |
2342 | { | |
2343 | struct pool_c *pt = pool->ti->private; | |
2344 | ||
2345 | if (passdown_enabled(pt)) { | |
2346 | pool->process_discard_cell = process_discard_cell_passdown; | |
2347 | pool->process_prepared_discard = process_prepared_discard_passdown; | |
2348 | } else { | |
2349 | pool->process_discard_cell = process_discard_cell_no_passdown; | |
2350 | pool->process_prepared_discard = process_prepared_discard_no_passdown; | |
2351 | } | |
2352 | } | |
2353 | ||
8b64e881 | 2354 | static void set_pool_mode(struct pool *pool, enum pool_mode new_mode) |
e49e5829 | 2355 | { |
cdc2b415 | 2356 | struct pool_c *pt = pool->ti->private; |
07f2b6e0 MS |
2357 | bool needs_check = dm_pool_metadata_needs_check(pool->pmd); |
2358 | enum pool_mode old_mode = get_pool_mode(pool); | |
80c57893 | 2359 | unsigned long no_space_timeout = ACCESS_ONCE(no_space_timeout_secs) * HZ; |
07f2b6e0 MS |
2360 | |
2361 | /* | |
2362 | * Never allow the pool to transition to PM_WRITE mode if user | |
2363 | * intervention is required to verify metadata and data consistency. | |
2364 | */ | |
2365 | if (new_mode == PM_WRITE && needs_check) { | |
2366 | DMERR("%s: unable to switch pool to write mode until repaired.", | |
2367 | dm_device_name(pool->pool_md)); | |
2368 | if (old_mode != new_mode) | |
2369 | new_mode = old_mode; | |
2370 | else | |
2371 | new_mode = PM_READ_ONLY; | |
2372 | } | |
2373 | /* | |
2374 | * If we were in PM_FAIL mode, rollback of metadata failed. We're | |
2375 | * not going to recover without a thin_repair. So we never let the | |
2376 | * pool move out of the old mode. | |
2377 | */ | |
2378 | if (old_mode == PM_FAIL) | |
2379 | new_mode = old_mode; | |
e49e5829 | 2380 | |
8b64e881 | 2381 | switch (new_mode) { |
e49e5829 | 2382 | case PM_FAIL: |
8b64e881 | 2383 | if (old_mode != new_mode) |
3e1a0699 | 2384 | notify_of_pool_mode_change(pool, "failure"); |
5383ef3a | 2385 | dm_pool_metadata_read_only(pool->pmd); |
e49e5829 JT |
2386 | pool->process_bio = process_bio_fail; |
2387 | pool->process_discard = process_bio_fail; | |
a374bb21 JT |
2388 | pool->process_cell = process_cell_fail; |
2389 | pool->process_discard_cell = process_cell_fail; | |
e49e5829 JT |
2390 | pool->process_prepared_mapping = process_prepared_mapping_fail; |
2391 | pool->process_prepared_discard = process_prepared_discard_fail; | |
3e1a0699 JT |
2392 | |
2393 | error_retry_list(pool); | |
e49e5829 JT |
2394 | break; |
2395 | ||
2396 | case PM_READ_ONLY: | |
8b64e881 | 2397 | if (old_mode != new_mode) |
3e1a0699 JT |
2398 | notify_of_pool_mode_change(pool, "read-only"); |
2399 | dm_pool_metadata_read_only(pool->pmd); | |
2400 | pool->process_bio = process_bio_read_only; | |
2401 | pool->process_discard = process_bio_success; | |
a374bb21 JT |
2402 | pool->process_cell = process_cell_read_only; |
2403 | pool->process_discard_cell = process_cell_success; | |
3e1a0699 | 2404 | pool->process_prepared_mapping = process_prepared_mapping_fail; |
34fbcf62 | 2405 | pool->process_prepared_discard = process_prepared_discard_success; |
3e1a0699 JT |
2406 | |
2407 | error_retry_list(pool); | |
2408 | break; | |
2409 | ||
2410 | case PM_OUT_OF_DATA_SPACE: | |
2411 | /* | |
2412 | * Ideally we'd never hit this state; the low water mark | |
2413 | * would trigger userland to extend the pool before we | |
2414 | * completely run out of data space. However, many small | |
2415 | * IOs to unprovisioned space can consume data space at an | |
2416 | * alarming rate. Adjust your low water mark if you're | |
2417 | * frequently seeing this mode. | |
2418 | */ | |
2419 | if (old_mode != new_mode) | |
bcc696fa | 2420 | notify_of_pool_mode_change_to_oods(pool); |
c3667cc6 | 2421 | pool->out_of_data_space = true; |
3e1a0699 | 2422 | pool->process_bio = process_bio_read_only; |
a374bb21 JT |
2423 | pool->process_discard = process_discard_bio; |
2424 | pool->process_cell = process_cell_read_only; | |
3e1a0699 | 2425 | pool->process_prepared_mapping = process_prepared_mapping; |
34fbcf62 | 2426 | set_discard_callbacks(pool); |
85ad643b | 2427 | |
80c57893 MS |
2428 | if (!pool->pf.error_if_no_space && no_space_timeout) |
2429 | queue_delayed_work(pool->wq, &pool->no_space_timeout, no_space_timeout); | |
e49e5829 JT |
2430 | break; |
2431 | ||
2432 | case PM_WRITE: | |
8b64e881 | 2433 | if (old_mode != new_mode) |
3e1a0699 | 2434 | notify_of_pool_mode_change(pool, "write"); |
c3667cc6 | 2435 | pool->out_of_data_space = false; |
172c2386 | 2436 | pool->pf.error_if_no_space = pt->requested_pf.error_if_no_space; |
9b7aaa64 | 2437 | dm_pool_metadata_read_write(pool->pmd); |
e49e5829 | 2438 | pool->process_bio = process_bio; |
a374bb21 JT |
2439 | pool->process_discard = process_discard_bio; |
2440 | pool->process_cell = process_cell; | |
e49e5829 | 2441 | pool->process_prepared_mapping = process_prepared_mapping; |
34fbcf62 | 2442 | set_discard_callbacks(pool); |
e49e5829 JT |
2443 | break; |
2444 | } | |
8b64e881 MS |
2445 | |
2446 | pool->pf.mode = new_mode; | |
cdc2b415 MS |
2447 | /* |
2448 | * The pool mode may have changed, sync it so bind_control_target() | |
2449 | * doesn't cause an unexpected mode transition on resume. | |
2450 | */ | |
2451 | pt->adjusted_pf.mode = new_mode; | |
e49e5829 JT |
2452 | } |
2453 | ||
07f2b6e0 | 2454 | static void abort_transaction(struct pool *pool) |
b5330655 | 2455 | { |
07f2b6e0 MS |
2456 | const char *dev_name = dm_device_name(pool->pool_md); |
2457 | ||
2458 | DMERR_LIMIT("%s: aborting current metadata transaction", dev_name); | |
2459 | if (dm_pool_abort_metadata(pool->pmd)) { | |
2460 | DMERR("%s: failed to abort metadata transaction", dev_name); | |
2461 | set_pool_mode(pool, PM_FAIL); | |
2462 | } | |
2463 | ||
2464 | if (dm_pool_metadata_set_needs_check(pool->pmd)) { | |
2465 | DMERR("%s: failed to set 'needs_check' flag in metadata", dev_name); | |
2466 | set_pool_mode(pool, PM_FAIL); | |
2467 | } | |
2468 | } | |
399caddf | 2469 | |
07f2b6e0 MS |
2470 | static void metadata_operation_failed(struct pool *pool, const char *op, int r) |
2471 | { | |
b5330655 JT |
2472 | DMERR_LIMIT("%s: metadata operation '%s' failed: error = %d", |
2473 | dm_device_name(pool->pool_md), op, r); | |
2474 | ||
07f2b6e0 | 2475 | abort_transaction(pool); |
b5330655 JT |
2476 | set_pool_mode(pool, PM_READ_ONLY); |
2477 | } | |
2478 | ||
e49e5829 JT |
2479 | /*----------------------------------------------------------------*/ |
2480 | ||
991d9fa0 JT |
2481 | /* |
2482 | * Mapping functions. | |
2483 | */ | |
2484 | ||
2485 | /* | |
2486 | * Called only while mapping a thin bio to hand it over to the workqueue. | |
2487 | */ | |
2488 | static void thin_defer_bio(struct thin_c *tc, struct bio *bio) | |
2489 | { | |
2490 | unsigned long flags; | |
2491 | struct pool *pool = tc->pool; | |
2492 | ||
c140e1c4 MS |
2493 | spin_lock_irqsave(&tc->lock, flags); |
2494 | bio_list_add(&tc->deferred_bio_list, bio); | |
2495 | spin_unlock_irqrestore(&tc->lock, flags); | |
991d9fa0 JT |
2496 | |
2497 | wake_worker(pool); | |
2498 | } | |
2499 | ||
7d327fe0 JT |
2500 | static void thin_defer_bio_with_throttle(struct thin_c *tc, struct bio *bio) |
2501 | { | |
2502 | struct pool *pool = tc->pool; | |
2503 | ||
2504 | throttle_lock(&pool->throttle); | |
2505 | thin_defer_bio(tc, bio); | |
2506 | throttle_unlock(&pool->throttle); | |
2507 | } | |
2508 | ||
a374bb21 JT |
2509 | static void thin_defer_cell(struct thin_c *tc, struct dm_bio_prison_cell *cell) |
2510 | { | |
2511 | unsigned long flags; | |
2512 | struct pool *pool = tc->pool; | |
2513 | ||
2514 | throttle_lock(&pool->throttle); | |
2515 | spin_lock_irqsave(&tc->lock, flags); | |
2516 | list_add_tail(&cell->user_list, &tc->deferred_cells); | |
2517 | spin_unlock_irqrestore(&tc->lock, flags); | |
2518 | throttle_unlock(&pool->throttle); | |
2519 | ||
2520 | wake_worker(pool); | |
2521 | } | |
2522 | ||
59c3d2c6 | 2523 | static void thin_hook_bio(struct thin_c *tc, struct bio *bio) |
eb2aa48d | 2524 | { |
59c3d2c6 | 2525 | struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook)); |
eb2aa48d JT |
2526 | |
2527 | h->tc = tc; | |
2528 | h->shared_read_entry = NULL; | |
e8088073 | 2529 | h->all_io_entry = NULL; |
eb2aa48d | 2530 | h->overwrite_mapping = NULL; |
34fbcf62 | 2531 | h->cell = NULL; |
eb2aa48d JT |
2532 | } |
2533 | ||
991d9fa0 JT |
2534 | /* |
2535 | * Non-blocking function called from the thin target's map function. | |
2536 | */ | |
7de3ee57 | 2537 | static int thin_bio_map(struct dm_target *ti, struct bio *bio) |
991d9fa0 JT |
2538 | { |
2539 | int r; | |
2540 | struct thin_c *tc = ti->private; | |
2541 | dm_block_t block = get_bio_block(tc, bio); | |
2542 | struct dm_thin_device *td = tc->td; | |
2543 | struct dm_thin_lookup_result result; | |
a374bb21 | 2544 | struct dm_bio_prison_cell *virt_cell, *data_cell; |
e8088073 | 2545 | struct dm_cell_key key; |
991d9fa0 | 2546 | |
59c3d2c6 | 2547 | thin_hook_bio(tc, bio); |
e49e5829 | 2548 | |
738211f7 | 2549 | if (tc->requeue_mode) { |
4246a0b6 CH |
2550 | bio->bi_error = DM_ENDIO_REQUEUE; |
2551 | bio_endio(bio); | |
738211f7 JT |
2552 | return DM_MAPIO_SUBMITTED; |
2553 | } | |
2554 | ||
e49e5829 JT |
2555 | if (get_pool_mode(tc->pool) == PM_FAIL) { |
2556 | bio_io_error(bio); | |
2557 | return DM_MAPIO_SUBMITTED; | |
2558 | } | |
2559 | ||
104655fd | 2560 | if (bio->bi_rw & (REQ_DISCARD | REQ_FLUSH | REQ_FUA)) { |
7d327fe0 | 2561 | thin_defer_bio_with_throttle(tc, bio); |
991d9fa0 JT |
2562 | return DM_MAPIO_SUBMITTED; |
2563 | } | |
2564 | ||
c822ed96 JT |
2565 | /* |
2566 | * We must hold the virtual cell before doing the lookup, otherwise | |
2567 | * there's a race with discard. | |
2568 | */ | |
2569 | build_virtual_key(tc->td, block, &key); | |
a374bb21 | 2570 | if (bio_detain(tc->pool, &key, bio, &virt_cell)) |
c822ed96 JT |
2571 | return DM_MAPIO_SUBMITTED; |
2572 | ||
991d9fa0 JT |
2573 | r = dm_thin_find_block(td, block, 0, &result); |
2574 | ||
2575 | /* | |
2576 | * Note that we defer readahead too. | |
2577 | */ | |
2578 | switch (r) { | |
2579 | case 0: | |
2580 | if (unlikely(result.shared)) { | |
2581 | /* | |
2582 | * We have a race condition here between the | |
2583 | * result.shared value returned by the lookup and | |
2584 | * snapshot creation, which may cause new | |
2585 | * sharing. | |
2586 | * | |
2587 | * To avoid this always quiesce the origin before | |
2588 | * taking the snap. You want to do this anyway to | |
2589 | * ensure a consistent application view | |
2590 | * (i.e. lockfs). | |
2591 | * | |
2592 | * More distant ancestors are irrelevant. The | |
2593 | * shared flag will be set in their case. | |
2594 | */ | |
a374bb21 | 2595 | thin_defer_cell(tc, virt_cell); |
e8088073 | 2596 | return DM_MAPIO_SUBMITTED; |
991d9fa0 | 2597 | } |
e8088073 | 2598 | |
e8088073 | 2599 | build_data_key(tc->td, result.block, &key); |
a374bb21 JT |
2600 | if (bio_detain(tc->pool, &key, bio, &data_cell)) { |
2601 | cell_defer_no_holder(tc, virt_cell); | |
e8088073 JT |
2602 | return DM_MAPIO_SUBMITTED; |
2603 | } | |
2604 | ||
2605 | inc_all_io_entry(tc->pool, bio); | |
a374bb21 JT |
2606 | cell_defer_no_holder(tc, data_cell); |
2607 | cell_defer_no_holder(tc, virt_cell); | |
e8088073 JT |
2608 | |
2609 | remap(tc, bio, result.block); | |
2610 | return DM_MAPIO_REMAPPED; | |
991d9fa0 JT |
2611 | |
2612 | case -ENODATA: | |
e49e5829 | 2613 | case -EWOULDBLOCK: |
a374bb21 | 2614 | thin_defer_cell(tc, virt_cell); |
2aab3850 | 2615 | return DM_MAPIO_SUBMITTED; |
e49e5829 JT |
2616 | |
2617 | default: | |
2618 | /* | |
2619 | * Must always call bio_io_error on failure. | |
2620 | * dm_thin_find_block can fail with -EINVAL if the | |
2621 | * pool is switched to fail-io mode. | |
2622 | */ | |
2623 | bio_io_error(bio); | |
a374bb21 | 2624 | cell_defer_no_holder(tc, virt_cell); |
2aab3850 | 2625 | return DM_MAPIO_SUBMITTED; |
991d9fa0 | 2626 | } |
991d9fa0 JT |
2627 | } |
2628 | ||
2629 | static int pool_is_congested(struct dm_target_callbacks *cb, int bdi_bits) | |
2630 | { | |
991d9fa0 | 2631 | struct pool_c *pt = container_of(cb, struct pool_c, callbacks); |
760fe67e | 2632 | struct request_queue *q; |
991d9fa0 | 2633 | |
760fe67e MS |
2634 | if (get_pool_mode(pt->pool) == PM_OUT_OF_DATA_SPACE) |
2635 | return 1; | |
991d9fa0 | 2636 | |
760fe67e MS |
2637 | q = bdev_get_queue(pt->data_dev->bdev); |
2638 | return bdi_congested(&q->backing_dev_info, bdi_bits); | |
991d9fa0 JT |
2639 | } |
2640 | ||
c140e1c4 | 2641 | static void requeue_bios(struct pool *pool) |
991d9fa0 | 2642 | { |
c140e1c4 MS |
2643 | unsigned long flags; |
2644 | struct thin_c *tc; | |
2645 | ||
2646 | rcu_read_lock(); | |
2647 | list_for_each_entry_rcu(tc, &pool->active_thins, list) { | |
2648 | spin_lock_irqsave(&tc->lock, flags); | |
2649 | bio_list_merge(&tc->deferred_bio_list, &tc->retry_on_resume_list); | |
2650 | bio_list_init(&tc->retry_on_resume_list); | |
2651 | spin_unlock_irqrestore(&tc->lock, flags); | |
2652 | } | |
2653 | rcu_read_unlock(); | |
991d9fa0 JT |
2654 | } |
2655 | ||
2656 | /*---------------------------------------------------------------- | |
2657 | * Binding of control targets to a pool object | |
2658 | *--------------------------------------------------------------*/ | |
9bc142dd MS |
2659 | static bool data_dev_supports_discard(struct pool_c *pt) |
2660 | { | |
2661 | struct request_queue *q = bdev_get_queue(pt->data_dev->bdev); | |
2662 | ||
2663 | return q && blk_queue_discard(q); | |
2664 | } | |
2665 | ||
58051b94 JT |
2666 | static bool is_factor(sector_t block_size, uint32_t n) |
2667 | { | |
2668 | return !sector_div(block_size, n); | |
2669 | } | |
2670 | ||
9bc142dd MS |
2671 | /* |
2672 | * If discard_passdown was enabled verify that the data device | |
0424caa1 | 2673 | * supports discards. Disable discard_passdown if not. |
9bc142dd | 2674 | */ |
0424caa1 | 2675 | static void disable_passdown_if_not_supported(struct pool_c *pt) |
9bc142dd | 2676 | { |
0424caa1 MS |
2677 | struct pool *pool = pt->pool; |
2678 | struct block_device *data_bdev = pt->data_dev->bdev; | |
2679 | struct queue_limits *data_limits = &bdev_get_queue(data_bdev)->limits; | |
0424caa1 | 2680 | const char *reason = NULL; |
9bc142dd MS |
2681 | char buf[BDEVNAME_SIZE]; |
2682 | ||
0424caa1 | 2683 | if (!pt->adjusted_pf.discard_passdown) |
9bc142dd MS |
2684 | return; |
2685 | ||
0424caa1 MS |
2686 | if (!data_dev_supports_discard(pt)) |
2687 | reason = "discard unsupported"; | |
2688 | ||
2689 | else if (data_limits->max_discard_sectors < pool->sectors_per_block) | |
2690 | reason = "max discard sectors smaller than a block"; | |
9bc142dd | 2691 | |
0424caa1 MS |
2692 | if (reason) { |
2693 | DMWARN("Data device (%s) %s: Disabling discard passdown.", bdevname(data_bdev, buf), reason); | |
2694 | pt->adjusted_pf.discard_passdown = false; | |
2695 | } | |
9bc142dd MS |
2696 | } |
2697 | ||
991d9fa0 JT |
2698 | static int bind_control_target(struct pool *pool, struct dm_target *ti) |
2699 | { | |
2700 | struct pool_c *pt = ti->private; | |
2701 | ||
e49e5829 | 2702 | /* |
9b7aaa64 | 2703 | * We want to make sure that a pool in PM_FAIL mode is never upgraded. |
e49e5829 | 2704 | */ |
07f2b6e0 | 2705 | enum pool_mode old_mode = get_pool_mode(pool); |
0424caa1 | 2706 | enum pool_mode new_mode = pt->adjusted_pf.mode; |
e49e5829 | 2707 | |
8b64e881 MS |
2708 | /* |
2709 | * Don't change the pool's mode until set_pool_mode() below. | |
2710 | * Otherwise the pool's process_* function pointers may | |
2711 | * not match the desired pool mode. | |
2712 | */ | |
2713 | pt->adjusted_pf.mode = old_mode; | |
2714 | ||
2715 | pool->ti = ti; | |
2716 | pool->pf = pt->adjusted_pf; | |
2717 | pool->low_water_blocks = pt->low_water_blocks; | |
2718 | ||
9bc142dd | 2719 | set_pool_mode(pool, new_mode); |
f402693d | 2720 | |
991d9fa0 JT |
2721 | return 0; |
2722 | } | |
2723 | ||
2724 | static void unbind_control_target(struct pool *pool, struct dm_target *ti) | |
2725 | { | |
2726 | if (pool->ti == ti) | |
2727 | pool->ti = NULL; | |
2728 | } | |
2729 | ||
2730 | /*---------------------------------------------------------------- | |
2731 | * Pool creation | |
2732 | *--------------------------------------------------------------*/ | |
67e2e2b2 JT |
2733 | /* Initialize pool features. */ |
2734 | static void pool_features_init(struct pool_features *pf) | |
2735 | { | |
e49e5829 | 2736 | pf->mode = PM_WRITE; |
9bc142dd MS |
2737 | pf->zero_new_blocks = true; |
2738 | pf->discard_enabled = true; | |
2739 | pf->discard_passdown = true; | |
787a996c | 2740 | pf->error_if_no_space = false; |
67e2e2b2 JT |
2741 | } |
2742 | ||
991d9fa0 JT |
2743 | static void __pool_destroy(struct pool *pool) |
2744 | { | |
2745 | __pool_table_remove(pool); | |
2746 | ||
a822c83e | 2747 | vfree(pool->cell_sort_array); |
991d9fa0 JT |
2748 | if (dm_pool_metadata_close(pool->pmd) < 0) |
2749 | DMWARN("%s: dm_pool_metadata_close() failed.", __func__); | |
2750 | ||
44feb387 | 2751 | dm_bio_prison_destroy(pool->prison); |
991d9fa0 JT |
2752 | dm_kcopyd_client_destroy(pool->copier); |
2753 | ||
2754 | if (pool->wq) | |
2755 | destroy_workqueue(pool->wq); | |
2756 | ||
2757 | if (pool->next_mapping) | |
2758 | mempool_free(pool->next_mapping, pool->mapping_pool); | |
2759 | mempool_destroy(pool->mapping_pool); | |
44feb387 MS |
2760 | dm_deferred_set_destroy(pool->shared_read_ds); |
2761 | dm_deferred_set_destroy(pool->all_io_ds); | |
991d9fa0 JT |
2762 | kfree(pool); |
2763 | } | |
2764 | ||
a24c2569 | 2765 | static struct kmem_cache *_new_mapping_cache; |
a24c2569 | 2766 | |
991d9fa0 JT |
2767 | static struct pool *pool_create(struct mapped_device *pool_md, |
2768 | struct block_device *metadata_dev, | |
e49e5829 JT |
2769 | unsigned long block_size, |
2770 | int read_only, char **error) | |
991d9fa0 JT |
2771 | { |
2772 | int r; | |
2773 | void *err_p; | |
2774 | struct pool *pool; | |
2775 | struct dm_pool_metadata *pmd; | |
e49e5829 | 2776 | bool format_device = read_only ? false : true; |
991d9fa0 | 2777 | |
e49e5829 | 2778 | pmd = dm_pool_metadata_open(metadata_dev, block_size, format_device); |
991d9fa0 JT |
2779 | if (IS_ERR(pmd)) { |
2780 | *error = "Error creating metadata object"; | |
2781 | return (struct pool *)pmd; | |
2782 | } | |
2783 | ||
2784 | pool = kmalloc(sizeof(*pool), GFP_KERNEL); | |
2785 | if (!pool) { | |
2786 | *error = "Error allocating memory for pool"; | |
2787 | err_p = ERR_PTR(-ENOMEM); | |
2788 | goto bad_pool; | |
2789 | } | |
2790 | ||
2791 | pool->pmd = pmd; | |
2792 | pool->sectors_per_block = block_size; | |
f9a8e0cd MP |
2793 | if (block_size & (block_size - 1)) |
2794 | pool->sectors_per_block_shift = -1; | |
2795 | else | |
2796 | pool->sectors_per_block_shift = __ffs(block_size); | |
991d9fa0 | 2797 | pool->low_water_blocks = 0; |
67e2e2b2 | 2798 | pool_features_init(&pool->pf); |
a195db2d | 2799 | pool->prison = dm_bio_prison_create(); |
991d9fa0 JT |
2800 | if (!pool->prison) { |
2801 | *error = "Error creating pool's bio prison"; | |
2802 | err_p = ERR_PTR(-ENOMEM); | |
2803 | goto bad_prison; | |
2804 | } | |
2805 | ||
df5d2e90 | 2806 | pool->copier = dm_kcopyd_client_create(&dm_kcopyd_throttle); |
991d9fa0 JT |
2807 | if (IS_ERR(pool->copier)) { |
2808 | r = PTR_ERR(pool->copier); | |
2809 | *error = "Error creating pool's kcopyd client"; | |
2810 | err_p = ERR_PTR(r); | |
2811 | goto bad_kcopyd_client; | |
2812 | } | |
2813 | ||
2814 | /* | |
2815 | * Create singlethreaded workqueue that will service all devices | |
2816 | * that use this metadata. | |
2817 | */ | |
2818 | pool->wq = alloc_ordered_workqueue("dm-" DM_MSG_PREFIX, WQ_MEM_RECLAIM); | |
2819 | if (!pool->wq) { | |
2820 | *error = "Error creating pool's workqueue"; | |
2821 | err_p = ERR_PTR(-ENOMEM); | |
2822 | goto bad_wq; | |
2823 | } | |
2824 | ||
7d327fe0 | 2825 | throttle_init(&pool->throttle); |
991d9fa0 | 2826 | INIT_WORK(&pool->worker, do_worker); |
905e51b3 | 2827 | INIT_DELAYED_WORK(&pool->waker, do_waker); |
85ad643b | 2828 | INIT_DELAYED_WORK(&pool->no_space_timeout, do_no_space_timeout); |
991d9fa0 | 2829 | spin_lock_init(&pool->lock); |
991d9fa0 JT |
2830 | bio_list_init(&pool->deferred_flush_bios); |
2831 | INIT_LIST_HEAD(&pool->prepared_mappings); | |
104655fd | 2832 | INIT_LIST_HEAD(&pool->prepared_discards); |
c140e1c4 | 2833 | INIT_LIST_HEAD(&pool->active_thins); |
88a6621b | 2834 | pool->low_water_triggered = false; |
80e96c54 | 2835 | pool->suspended = true; |
c3667cc6 | 2836 | pool->out_of_data_space = false; |
44feb387 MS |
2837 | |
2838 | pool->shared_read_ds = dm_deferred_set_create(); | |
2839 | if (!pool->shared_read_ds) { | |
2840 | *error = "Error creating pool's shared read deferred set"; | |
2841 | err_p = ERR_PTR(-ENOMEM); | |
2842 | goto bad_shared_read_ds; | |
2843 | } | |
2844 | ||
2845 | pool->all_io_ds = dm_deferred_set_create(); | |
2846 | if (!pool->all_io_ds) { | |
2847 | *error = "Error creating pool's all io deferred set"; | |
2848 | err_p = ERR_PTR(-ENOMEM); | |
2849 | goto bad_all_io_ds; | |
2850 | } | |
991d9fa0 JT |
2851 | |
2852 | pool->next_mapping = NULL; | |
a24c2569 MS |
2853 | pool->mapping_pool = mempool_create_slab_pool(MAPPING_POOL_SIZE, |
2854 | _new_mapping_cache); | |
991d9fa0 JT |
2855 | if (!pool->mapping_pool) { |
2856 | *error = "Error creating pool's mapping mempool"; | |
2857 | err_p = ERR_PTR(-ENOMEM); | |
2858 | goto bad_mapping_pool; | |
2859 | } | |
2860 | ||
a822c83e JT |
2861 | pool->cell_sort_array = vmalloc(sizeof(*pool->cell_sort_array) * CELL_SORT_ARRAY_SIZE); |
2862 | if (!pool->cell_sort_array) { | |
2863 | *error = "Error allocating cell sort array"; | |
2864 | err_p = ERR_PTR(-ENOMEM); | |
2865 | goto bad_sort_array; | |
2866 | } | |
2867 | ||
991d9fa0 | 2868 | pool->ref_count = 1; |
905e51b3 | 2869 | pool->last_commit_jiffies = jiffies; |
991d9fa0 JT |
2870 | pool->pool_md = pool_md; |
2871 | pool->md_dev = metadata_dev; | |
2872 | __pool_table_insert(pool); | |
2873 | ||
2874 | return pool; | |
2875 | ||
a822c83e JT |
2876 | bad_sort_array: |
2877 | mempool_destroy(pool->mapping_pool); | |
991d9fa0 | 2878 | bad_mapping_pool: |
44feb387 MS |
2879 | dm_deferred_set_destroy(pool->all_io_ds); |
2880 | bad_all_io_ds: | |
2881 | dm_deferred_set_destroy(pool->shared_read_ds); | |
2882 | bad_shared_read_ds: | |
991d9fa0 JT |
2883 | destroy_workqueue(pool->wq); |
2884 | bad_wq: | |
2885 | dm_kcopyd_client_destroy(pool->copier); | |
2886 | bad_kcopyd_client: | |
44feb387 | 2887 | dm_bio_prison_destroy(pool->prison); |
991d9fa0 JT |
2888 | bad_prison: |
2889 | kfree(pool); | |
2890 | bad_pool: | |
2891 | if (dm_pool_metadata_close(pmd)) | |
2892 | DMWARN("%s: dm_pool_metadata_close() failed.", __func__); | |
2893 | ||
2894 | return err_p; | |
2895 | } | |
2896 | ||
2897 | static void __pool_inc(struct pool *pool) | |
2898 | { | |
2899 | BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex)); | |
2900 | pool->ref_count++; | |
2901 | } | |
2902 | ||
2903 | static void __pool_dec(struct pool *pool) | |
2904 | { | |
2905 | BUG_ON(!mutex_is_locked(&dm_thin_pool_table.mutex)); | |
2906 | BUG_ON(!pool->ref_count); | |
2907 | if (!--pool->ref_count) | |
2908 | __pool_destroy(pool); | |
2909 | } | |
2910 | ||
2911 | static struct pool *__pool_find(struct mapped_device *pool_md, | |
2912 | struct block_device *metadata_dev, | |
e49e5829 JT |
2913 | unsigned long block_size, int read_only, |
2914 | char **error, int *created) | |
991d9fa0 JT |
2915 | { |
2916 | struct pool *pool = __pool_table_lookup_metadata_dev(metadata_dev); | |
2917 | ||
2918 | if (pool) { | |
f09996c9 MS |
2919 | if (pool->pool_md != pool_md) { |
2920 | *error = "metadata device already in use by a pool"; | |
991d9fa0 | 2921 | return ERR_PTR(-EBUSY); |
f09996c9 | 2922 | } |
991d9fa0 JT |
2923 | __pool_inc(pool); |
2924 | ||
2925 | } else { | |
2926 | pool = __pool_table_lookup(pool_md); | |
2927 | if (pool) { | |
f09996c9 MS |
2928 | if (pool->md_dev != metadata_dev) { |
2929 | *error = "different pool cannot replace a pool"; | |
991d9fa0 | 2930 | return ERR_PTR(-EINVAL); |
f09996c9 | 2931 | } |
991d9fa0 JT |
2932 | __pool_inc(pool); |
2933 | ||
67e2e2b2 | 2934 | } else { |
e49e5829 | 2935 | pool = pool_create(pool_md, metadata_dev, block_size, read_only, error); |
67e2e2b2 JT |
2936 | *created = 1; |
2937 | } | |
991d9fa0 JT |
2938 | } |
2939 | ||
2940 | return pool; | |
2941 | } | |
2942 | ||
2943 | /*---------------------------------------------------------------- | |
2944 | * Pool target methods | |
2945 | *--------------------------------------------------------------*/ | |
2946 | static void pool_dtr(struct dm_target *ti) | |
2947 | { | |
2948 | struct pool_c *pt = ti->private; | |
2949 | ||
2950 | mutex_lock(&dm_thin_pool_table.mutex); | |
2951 | ||
2952 | unbind_control_target(pt->pool, ti); | |
2953 | __pool_dec(pt->pool); | |
2954 | dm_put_device(ti, pt->metadata_dev); | |
2955 | dm_put_device(ti, pt->data_dev); | |
2956 | kfree(pt); | |
2957 | ||
2958 | mutex_unlock(&dm_thin_pool_table.mutex); | |
2959 | } | |
2960 | ||
991d9fa0 JT |
2961 | static int parse_pool_features(struct dm_arg_set *as, struct pool_features *pf, |
2962 | struct dm_target *ti) | |
2963 | { | |
2964 | int r; | |
2965 | unsigned argc; | |
2966 | const char *arg_name; | |
2967 | ||
2968 | static struct dm_arg _args[] = { | |
74aa45c3 | 2969 | {0, 4, "Invalid number of pool feature arguments"}, |
991d9fa0 JT |
2970 | }; |
2971 | ||
2972 | /* | |
2973 | * No feature arguments supplied. | |
2974 | */ | |
2975 | if (!as->argc) | |
2976 | return 0; | |
2977 | ||
2978 | r = dm_read_arg_group(_args, as, &argc, &ti->error); | |
2979 | if (r) | |
2980 | return -EINVAL; | |
2981 | ||
2982 | while (argc && !r) { | |
2983 | arg_name = dm_shift_arg(as); | |
2984 | argc--; | |
2985 | ||
e49e5829 | 2986 | if (!strcasecmp(arg_name, "skip_block_zeroing")) |
9bc142dd | 2987 | pf->zero_new_blocks = false; |
e49e5829 JT |
2988 | |
2989 | else if (!strcasecmp(arg_name, "ignore_discard")) | |
9bc142dd | 2990 | pf->discard_enabled = false; |
e49e5829 JT |
2991 | |
2992 | else if (!strcasecmp(arg_name, "no_discard_passdown")) | |
9bc142dd | 2993 | pf->discard_passdown = false; |
991d9fa0 | 2994 | |
e49e5829 JT |
2995 | else if (!strcasecmp(arg_name, "read_only")) |
2996 | pf->mode = PM_READ_ONLY; | |
2997 | ||
787a996c MS |
2998 | else if (!strcasecmp(arg_name, "error_if_no_space")) |
2999 | pf->error_if_no_space = true; | |
3000 | ||
e49e5829 JT |
3001 | else { |
3002 | ti->error = "Unrecognised pool feature requested"; | |
3003 | r = -EINVAL; | |
3004 | break; | |
3005 | } | |
991d9fa0 JT |
3006 | } |
3007 | ||
3008 | return r; | |
3009 | } | |
3010 | ||
ac8c3f3d JT |
3011 | static void metadata_low_callback(void *context) |
3012 | { | |
3013 | struct pool *pool = context; | |
3014 | ||
3015 | DMWARN("%s: reached low water mark for metadata device: sending event.", | |
3016 | dm_device_name(pool->pool_md)); | |
3017 | ||
3018 | dm_table_event(pool->ti->table); | |
3019 | } | |
3020 | ||
7d48935e MS |
3021 | static sector_t get_dev_size(struct block_device *bdev) |
3022 | { | |
3023 | return i_size_read(bdev->bd_inode) >> SECTOR_SHIFT; | |
3024 | } | |
3025 | ||
3026 | static void warn_if_metadata_device_too_big(struct block_device *bdev) | |
b17446df | 3027 | { |
7d48935e | 3028 | sector_t metadata_dev_size = get_dev_size(bdev); |
b17446df JT |
3029 | char buffer[BDEVNAME_SIZE]; |
3030 | ||
7d48935e | 3031 | if (metadata_dev_size > THIN_METADATA_MAX_SECTORS_WARNING) |
b17446df JT |
3032 | DMWARN("Metadata device %s is larger than %u sectors: excess space will not be used.", |
3033 | bdevname(bdev, buffer), THIN_METADATA_MAX_SECTORS); | |
7d48935e MS |
3034 | } |
3035 | ||
3036 | static sector_t get_metadata_dev_size(struct block_device *bdev) | |
3037 | { | |
3038 | sector_t metadata_dev_size = get_dev_size(bdev); | |
3039 | ||
3040 | if (metadata_dev_size > THIN_METADATA_MAX_SECTORS) | |
3041 | metadata_dev_size = THIN_METADATA_MAX_SECTORS; | |
b17446df JT |
3042 | |
3043 | return metadata_dev_size; | |
3044 | } | |
3045 | ||
24347e95 JT |
3046 | static dm_block_t get_metadata_dev_size_in_blocks(struct block_device *bdev) |
3047 | { | |
3048 | sector_t metadata_dev_size = get_metadata_dev_size(bdev); | |
3049 | ||
7d48935e | 3050 | sector_div(metadata_dev_size, THIN_METADATA_BLOCK_SIZE); |
24347e95 JT |
3051 | |
3052 | return metadata_dev_size; | |
3053 | } | |
3054 | ||
ac8c3f3d JT |
3055 | /* |
3056 | * When a metadata threshold is crossed a dm event is triggered, and | |
3057 | * userland should respond by growing the metadata device. We could let | |
3058 | * userland set the threshold, like we do with the data threshold, but I'm | |
3059 | * not sure they know enough to do this well. | |
3060 | */ | |
3061 | static dm_block_t calc_metadata_threshold(struct pool_c *pt) | |
3062 | { | |
3063 | /* | |
3064 | * 4M is ample for all ops with the possible exception of thin | |
3065 | * device deletion which is harmless if it fails (just retry the | |
3066 | * delete after you've grown the device). | |
3067 | */ | |
3068 | dm_block_t quarter = get_metadata_dev_size_in_blocks(pt->metadata_dev->bdev) / 4; | |
3069 | return min((dm_block_t)1024ULL /* 4M */, quarter); | |
3070 | } | |
3071 | ||
991d9fa0 JT |
3072 | /* |
3073 | * thin-pool <metadata dev> <data dev> | |
3074 | * <data block size (sectors)> | |
3075 | * <low water mark (blocks)> | |
3076 | * [<#feature args> [<arg>]*] | |
3077 | * | |
3078 | * Optional feature arguments are: | |
3079 | * skip_block_zeroing: skips the zeroing of newly-provisioned blocks. | |
67e2e2b2 JT |
3080 | * ignore_discard: disable discard |
3081 | * no_discard_passdown: don't pass discards down to the data device | |
787a996c MS |
3082 | * read_only: Don't allow any changes to be made to the pool metadata. |
3083 | * error_if_no_space: error IOs, instead of queueing, if no space. | |
991d9fa0 JT |
3084 | */ |
3085 | static int pool_ctr(struct dm_target *ti, unsigned argc, char **argv) | |
3086 | { | |
67e2e2b2 | 3087 | int r, pool_created = 0; |
991d9fa0 JT |
3088 | struct pool_c *pt; |
3089 | struct pool *pool; | |
3090 | struct pool_features pf; | |
3091 | struct dm_arg_set as; | |
3092 | struct dm_dev *data_dev; | |
3093 | unsigned long block_size; | |
3094 | dm_block_t low_water_blocks; | |
3095 | struct dm_dev *metadata_dev; | |
5d0db96d | 3096 | fmode_t metadata_mode; |
991d9fa0 JT |
3097 | |
3098 | /* | |
3099 | * FIXME Remove validation from scope of lock. | |
3100 | */ | |
3101 | mutex_lock(&dm_thin_pool_table.mutex); | |
3102 | ||
3103 | if (argc < 4) { | |
3104 | ti->error = "Invalid argument count"; | |
3105 | r = -EINVAL; | |
3106 | goto out_unlock; | |
3107 | } | |
5d0db96d | 3108 | |
991d9fa0 JT |
3109 | as.argc = argc; |
3110 | as.argv = argv; | |
3111 | ||
5d0db96d JT |
3112 | /* |
3113 | * Set default pool features. | |
3114 | */ | |
3115 | pool_features_init(&pf); | |
3116 | ||
3117 | dm_consume_args(&as, 4); | |
3118 | r = parse_pool_features(&as, &pf, ti); | |
3119 | if (r) | |
3120 | goto out_unlock; | |
3121 | ||
3122 | metadata_mode = FMODE_READ | ((pf.mode == PM_READ_ONLY) ? 0 : FMODE_WRITE); | |
3123 | r = dm_get_device(ti, argv[0], metadata_mode, &metadata_dev); | |
991d9fa0 JT |
3124 | if (r) { |
3125 | ti->error = "Error opening metadata block device"; | |
3126 | goto out_unlock; | |
3127 | } | |
7d48935e | 3128 | warn_if_metadata_device_too_big(metadata_dev->bdev); |
991d9fa0 JT |
3129 | |
3130 | r = dm_get_device(ti, argv[1], FMODE_READ | FMODE_WRITE, &data_dev); | |
3131 | if (r) { | |
3132 | ti->error = "Error getting data device"; | |
3133 | goto out_metadata; | |
3134 | } | |
3135 | ||
3136 | if (kstrtoul(argv[2], 10, &block_size) || !block_size || | |
3137 | block_size < DATA_DEV_BLOCK_SIZE_MIN_SECTORS || | |
3138 | block_size > DATA_DEV_BLOCK_SIZE_MAX_SECTORS || | |
55f2b8bd | 3139 | block_size & (DATA_DEV_BLOCK_SIZE_MIN_SECTORS - 1)) { |
991d9fa0 JT |
3140 | ti->error = "Invalid block size"; |
3141 | r = -EINVAL; | |
3142 | goto out; | |
3143 | } | |
3144 | ||
3145 | if (kstrtoull(argv[3], 10, (unsigned long long *)&low_water_blocks)) { | |
3146 | ti->error = "Invalid low water mark"; | |
3147 | r = -EINVAL; | |
3148 | goto out; | |
3149 | } | |
3150 | ||
991d9fa0 JT |
3151 | pt = kzalloc(sizeof(*pt), GFP_KERNEL); |
3152 | if (!pt) { | |
3153 | r = -ENOMEM; | |
3154 | goto out; | |
3155 | } | |
3156 | ||
3157 | pool = __pool_find(dm_table_get_md(ti->table), metadata_dev->bdev, | |
e49e5829 | 3158 | block_size, pf.mode == PM_READ_ONLY, &ti->error, &pool_created); |
991d9fa0 JT |
3159 | if (IS_ERR(pool)) { |
3160 | r = PTR_ERR(pool); | |
3161 | goto out_free_pt; | |
3162 | } | |
3163 | ||
67e2e2b2 JT |
3164 | /* |
3165 | * 'pool_created' reflects whether this is the first table load. | |
3166 | * Top level discard support is not allowed to be changed after | |
3167 | * initial load. This would require a pool reload to trigger thin | |
3168 | * device changes. | |
3169 | */ | |
3170 | if (!pool_created && pf.discard_enabled != pool->pf.discard_enabled) { | |
3171 | ti->error = "Discard support cannot be disabled once enabled"; | |
3172 | r = -EINVAL; | |
3173 | goto out_flags_changed; | |
3174 | } | |
3175 | ||
991d9fa0 JT |
3176 | pt->pool = pool; |
3177 | pt->ti = ti; | |
3178 | pt->metadata_dev = metadata_dev; | |
3179 | pt->data_dev = data_dev; | |
3180 | pt->low_water_blocks = low_water_blocks; | |
0424caa1 | 3181 | pt->adjusted_pf = pt->requested_pf = pf; |
55a62eef | 3182 | ti->num_flush_bios = 1; |
9bc142dd | 3183 | |
67e2e2b2 JT |
3184 | /* |
3185 | * Only need to enable discards if the pool should pass | |
3186 | * them down to the data device. The thin device's discard | |
3187 | * processing will cause mappings to be removed from the btree. | |
3188 | */ | |
b60ab990 | 3189 | ti->discard_zeroes_data_unsupported = true; |
67e2e2b2 | 3190 | if (pf.discard_enabled && pf.discard_passdown) { |
55a62eef | 3191 | ti->num_discard_bios = 1; |
9bc142dd | 3192 | |
67e2e2b2 JT |
3193 | /* |
3194 | * Setting 'discards_supported' circumvents the normal | |
3195 | * stacking of discard limits (this keeps the pool and | |
3196 | * thin devices' discard limits consistent). | |
3197 | */ | |
0ac55489 | 3198 | ti->discards_supported = true; |
67e2e2b2 | 3199 | } |
991d9fa0 JT |
3200 | ti->private = pt; |
3201 | ||
ac8c3f3d JT |
3202 | r = dm_pool_register_metadata_threshold(pt->pool->pmd, |
3203 | calc_metadata_threshold(pt), | |
3204 | metadata_low_callback, | |
3205 | pool); | |
3206 | if (r) | |
ba30670f | 3207 | goto out_flags_changed; |
ac8c3f3d | 3208 | |
991d9fa0 JT |
3209 | pt->callbacks.congested_fn = pool_is_congested; |
3210 | dm_table_add_target_callbacks(ti->table, &pt->callbacks); | |
3211 | ||
3212 | mutex_unlock(&dm_thin_pool_table.mutex); | |
3213 | ||
3214 | return 0; | |
3215 | ||
67e2e2b2 JT |
3216 | out_flags_changed: |
3217 | __pool_dec(pool); | |
991d9fa0 JT |
3218 | out_free_pt: |
3219 | kfree(pt); | |
3220 | out: | |
3221 | dm_put_device(ti, data_dev); | |
3222 | out_metadata: | |
3223 | dm_put_device(ti, metadata_dev); | |
3224 | out_unlock: | |
3225 | mutex_unlock(&dm_thin_pool_table.mutex); | |
3226 | ||
3227 | return r; | |
3228 | } | |
3229 | ||
7de3ee57 | 3230 | static int pool_map(struct dm_target *ti, struct bio *bio) |
991d9fa0 JT |
3231 | { |
3232 | int r; | |
3233 | struct pool_c *pt = ti->private; | |
3234 | struct pool *pool = pt->pool; | |
3235 | unsigned long flags; | |
3236 | ||
3237 | /* | |
3238 | * As this is a singleton target, ti->begin is always zero. | |
3239 | */ | |
3240 | spin_lock_irqsave(&pool->lock, flags); | |
3241 | bio->bi_bdev = pt->data_dev->bdev; | |
3242 | r = DM_MAPIO_REMAPPED; | |
3243 | spin_unlock_irqrestore(&pool->lock, flags); | |
3244 | ||
3245 | return r; | |
3246 | } | |
3247 | ||
b17446df | 3248 | static int maybe_resize_data_dev(struct dm_target *ti, bool *need_commit) |
991d9fa0 JT |
3249 | { |
3250 | int r; | |
3251 | struct pool_c *pt = ti->private; | |
3252 | struct pool *pool = pt->pool; | |
55f2b8bd MS |
3253 | sector_t data_size = ti->len; |
3254 | dm_block_t sb_data_size; | |
991d9fa0 | 3255 | |
b17446df | 3256 | *need_commit = false; |
991d9fa0 | 3257 | |
55f2b8bd MS |
3258 | (void) sector_div(data_size, pool->sectors_per_block); |
3259 | ||
991d9fa0 JT |
3260 | r = dm_pool_get_data_dev_size(pool->pmd, &sb_data_size); |
3261 | if (r) { | |
4fa5971a MS |
3262 | DMERR("%s: failed to retrieve data device size", |
3263 | dm_device_name(pool->pool_md)); | |
991d9fa0 JT |
3264 | return r; |
3265 | } | |
3266 | ||
3267 | if (data_size < sb_data_size) { | |
4fa5971a MS |
3268 | DMERR("%s: pool target (%llu blocks) too small: expected %llu", |
3269 | dm_device_name(pool->pool_md), | |
55f2b8bd | 3270 | (unsigned long long)data_size, sb_data_size); |
991d9fa0 JT |
3271 | return -EINVAL; |
3272 | ||
3273 | } else if (data_size > sb_data_size) { | |
07f2b6e0 MS |
3274 | if (dm_pool_metadata_needs_check(pool->pmd)) { |
3275 | DMERR("%s: unable to grow the data device until repaired.", | |
3276 | dm_device_name(pool->pool_md)); | |
3277 | return 0; | |
3278 | } | |
3279 | ||
6f7f51d4 MS |
3280 | if (sb_data_size) |
3281 | DMINFO("%s: growing the data device from %llu to %llu blocks", | |
3282 | dm_device_name(pool->pool_md), | |
3283 | sb_data_size, (unsigned long long)data_size); | |
991d9fa0 JT |
3284 | r = dm_pool_resize_data_dev(pool->pmd, data_size); |
3285 | if (r) { | |
b5330655 | 3286 | metadata_operation_failed(pool, "dm_pool_resize_data_dev", r); |
991d9fa0 JT |
3287 | return r; |
3288 | } | |
3289 | ||
b17446df | 3290 | *need_commit = true; |
991d9fa0 JT |
3291 | } |
3292 | ||
3293 | return 0; | |
3294 | } | |
3295 | ||
24347e95 JT |
3296 | static int maybe_resize_metadata_dev(struct dm_target *ti, bool *need_commit) |
3297 | { | |
3298 | int r; | |
3299 | struct pool_c *pt = ti->private; | |
3300 | struct pool *pool = pt->pool; | |
3301 | dm_block_t metadata_dev_size, sb_metadata_dev_size; | |
3302 | ||
3303 | *need_commit = false; | |
3304 | ||
610bba8b | 3305 | metadata_dev_size = get_metadata_dev_size_in_blocks(pool->md_dev); |
24347e95 JT |
3306 | |
3307 | r = dm_pool_get_metadata_dev_size(pool->pmd, &sb_metadata_dev_size); | |
3308 | if (r) { | |
4fa5971a MS |
3309 | DMERR("%s: failed to retrieve metadata device size", |
3310 | dm_device_name(pool->pool_md)); | |
24347e95 JT |
3311 | return r; |
3312 | } | |
3313 | ||
3314 | if (metadata_dev_size < sb_metadata_dev_size) { | |
4fa5971a MS |
3315 | DMERR("%s: metadata device (%llu blocks) too small: expected %llu", |
3316 | dm_device_name(pool->pool_md), | |
24347e95 JT |
3317 | metadata_dev_size, sb_metadata_dev_size); |
3318 | return -EINVAL; | |
3319 | ||
3320 | } else if (metadata_dev_size > sb_metadata_dev_size) { | |
07f2b6e0 MS |
3321 | if (dm_pool_metadata_needs_check(pool->pmd)) { |
3322 | DMERR("%s: unable to grow the metadata device until repaired.", | |
3323 | dm_device_name(pool->pool_md)); | |
3324 | return 0; | |
3325 | } | |
3326 | ||
7d48935e | 3327 | warn_if_metadata_device_too_big(pool->md_dev); |
6f7f51d4 MS |
3328 | DMINFO("%s: growing the metadata device from %llu to %llu blocks", |
3329 | dm_device_name(pool->pool_md), | |
3330 | sb_metadata_dev_size, metadata_dev_size); | |
24347e95 JT |
3331 | r = dm_pool_resize_metadata_dev(pool->pmd, metadata_dev_size); |
3332 | if (r) { | |
b5330655 | 3333 | metadata_operation_failed(pool, "dm_pool_resize_metadata_dev", r); |
24347e95 JT |
3334 | return r; |
3335 | } | |
3336 | ||
3337 | *need_commit = true; | |
3338 | } | |
3339 | ||
3340 | return 0; | |
3341 | } | |
3342 | ||
b17446df JT |
3343 | /* |
3344 | * Retrieves the number of blocks of the data device from | |
3345 | * the superblock and compares it to the actual device size, | |
3346 | * thus resizing the data device in case it has grown. | |
3347 | * | |
3348 | * This both copes with opening preallocated data devices in the ctr | |
3349 | * being followed by a resume | |
3350 | * -and- | |
3351 | * calling the resume method individually after userspace has | |
3352 | * grown the data device in reaction to a table event. | |
3353 | */ | |
3354 | static int pool_preresume(struct dm_target *ti) | |
3355 | { | |
3356 | int r; | |
24347e95 | 3357 | bool need_commit1, need_commit2; |
b17446df JT |
3358 | struct pool_c *pt = ti->private; |
3359 | struct pool *pool = pt->pool; | |
3360 | ||
3361 | /* | |
3362 | * Take control of the pool object. | |
3363 | */ | |
3364 | r = bind_control_target(pool, ti); | |
3365 | if (r) | |
3366 | return r; | |
3367 | ||
3368 | r = maybe_resize_data_dev(ti, &need_commit1); | |
3369 | if (r) | |
3370 | return r; | |
3371 | ||
24347e95 JT |
3372 | r = maybe_resize_metadata_dev(ti, &need_commit2); |
3373 | if (r) | |
3374 | return r; | |
3375 | ||
3376 | if (need_commit1 || need_commit2) | |
020cc3b5 | 3377 | (void) commit(pool); |
b17446df JT |
3378 | |
3379 | return 0; | |
3380 | } | |
3381 | ||
583024d2 MS |
3382 | static void pool_suspend_active_thins(struct pool *pool) |
3383 | { | |
3384 | struct thin_c *tc; | |
3385 | ||
3386 | /* Suspend all active thin devices */ | |
3387 | tc = get_first_thin(pool); | |
3388 | while (tc) { | |
3389 | dm_internal_suspend_noflush(tc->thin_md); | |
3390 | tc = get_next_thin(pool, tc); | |
3391 | } | |
3392 | } | |
3393 | ||
3394 | static void pool_resume_active_thins(struct pool *pool) | |
3395 | { | |
3396 | struct thin_c *tc; | |
3397 | ||
3398 | /* Resume all active thin devices */ | |
3399 | tc = get_first_thin(pool); | |
3400 | while (tc) { | |
3401 | dm_internal_resume(tc->thin_md); | |
3402 | tc = get_next_thin(pool, tc); | |
3403 | } | |
3404 | } | |
3405 | ||
991d9fa0 JT |
3406 | static void pool_resume(struct dm_target *ti) |
3407 | { | |
3408 | struct pool_c *pt = ti->private; | |
3409 | struct pool *pool = pt->pool; | |
3410 | unsigned long flags; | |
3411 | ||
583024d2 MS |
3412 | /* |
3413 | * Must requeue active_thins' bios and then resume | |
3414 | * active_thins _before_ clearing 'suspend' flag. | |
3415 | */ | |
3416 | requeue_bios(pool); | |
3417 | pool_resume_active_thins(pool); | |
3418 | ||
991d9fa0 | 3419 | spin_lock_irqsave(&pool->lock, flags); |
88a6621b | 3420 | pool->low_water_triggered = false; |
80e96c54 | 3421 | pool->suspended = false; |
991d9fa0 | 3422 | spin_unlock_irqrestore(&pool->lock, flags); |
80e96c54 | 3423 | |
905e51b3 | 3424 | do_waker(&pool->waker.work); |
991d9fa0 JT |
3425 | } |
3426 | ||
80e96c54 MS |
3427 | static void pool_presuspend(struct dm_target *ti) |
3428 | { | |
3429 | struct pool_c *pt = ti->private; | |
3430 | struct pool *pool = pt->pool; | |
3431 | unsigned long flags; | |
3432 | ||
3433 | spin_lock_irqsave(&pool->lock, flags); | |
3434 | pool->suspended = true; | |
3435 | spin_unlock_irqrestore(&pool->lock, flags); | |
583024d2 MS |
3436 | |
3437 | pool_suspend_active_thins(pool); | |
80e96c54 MS |
3438 | } |
3439 | ||
3440 | static void pool_presuspend_undo(struct dm_target *ti) | |
3441 | { | |
3442 | struct pool_c *pt = ti->private; | |
3443 | struct pool *pool = pt->pool; | |
3444 | unsigned long flags; | |
3445 | ||
583024d2 MS |
3446 | pool_resume_active_thins(pool); |
3447 | ||
80e96c54 MS |
3448 | spin_lock_irqsave(&pool->lock, flags); |
3449 | pool->suspended = false; | |
3450 | spin_unlock_irqrestore(&pool->lock, flags); | |
3451 | } | |
3452 | ||
991d9fa0 JT |
3453 | static void pool_postsuspend(struct dm_target *ti) |
3454 | { | |
991d9fa0 JT |
3455 | struct pool_c *pt = ti->private; |
3456 | struct pool *pool = pt->pool; | |
3457 | ||
18d03e8c NB |
3458 | cancel_delayed_work_sync(&pool->waker); |
3459 | cancel_delayed_work_sync(&pool->no_space_timeout); | |
991d9fa0 | 3460 | flush_workqueue(pool->wq); |
020cc3b5 | 3461 | (void) commit(pool); |
991d9fa0 JT |
3462 | } |
3463 | ||
3464 | static int check_arg_count(unsigned argc, unsigned args_required) | |
3465 | { | |
3466 | if (argc != args_required) { | |
3467 | DMWARN("Message received with %u arguments instead of %u.", | |
3468 | argc, args_required); | |
3469 | return -EINVAL; | |
3470 | } | |
3471 | ||
3472 | return 0; | |
3473 | } | |
3474 | ||
3475 | static int read_dev_id(char *arg, dm_thin_id *dev_id, int warning) | |
3476 | { | |
3477 | if (!kstrtoull(arg, 10, (unsigned long long *)dev_id) && | |
3478 | *dev_id <= MAX_DEV_ID) | |
3479 | return 0; | |
3480 | ||
3481 | if (warning) | |
3482 | DMWARN("Message received with invalid device id: %s", arg); | |
3483 | ||
3484 | return -EINVAL; | |
3485 | } | |
3486 | ||
3487 | static int process_create_thin_mesg(unsigned argc, char **argv, struct pool *pool) | |
3488 | { | |
3489 | dm_thin_id dev_id; | |
3490 | int r; | |
3491 | ||
3492 | r = check_arg_count(argc, 2); | |
3493 | if (r) | |
3494 | return r; | |
3495 | ||
3496 | r = read_dev_id(argv[1], &dev_id, 1); | |
3497 | if (r) | |
3498 | return r; | |
3499 | ||
3500 | r = dm_pool_create_thin(pool->pmd, dev_id); | |
3501 | if (r) { | |
3502 | DMWARN("Creation of new thinly-provisioned device with id %s failed.", | |
3503 | argv[1]); | |
3504 | return r; | |
3505 | } | |
3506 | ||
3507 | return 0; | |
3508 | } | |
3509 | ||
3510 | static int process_create_snap_mesg(unsigned argc, char **argv, struct pool *pool) | |
3511 | { | |
3512 | dm_thin_id dev_id; | |
3513 | dm_thin_id origin_dev_id; | |
3514 | int r; | |
3515 | ||
3516 | r = check_arg_count(argc, 3); | |
3517 | if (r) | |
3518 | return r; | |
3519 | ||
3520 | r = read_dev_id(argv[1], &dev_id, 1); | |
3521 | if (r) | |
3522 | return r; | |
3523 | ||
3524 | r = read_dev_id(argv[2], &origin_dev_id, 1); | |
3525 | if (r) | |
3526 | return r; | |
3527 | ||
3528 | r = dm_pool_create_snap(pool->pmd, dev_id, origin_dev_id); | |
3529 | if (r) { | |
3530 | DMWARN("Creation of new snapshot %s of device %s failed.", | |
3531 | argv[1], argv[2]); | |
3532 | return r; | |
3533 | } | |
3534 | ||
3535 | return 0; | |
3536 | } | |
3537 | ||
3538 | static int process_delete_mesg(unsigned argc, char **argv, struct pool *pool) | |
3539 | { | |
3540 | dm_thin_id dev_id; | |
3541 | int r; | |
3542 | ||
3543 | r = check_arg_count(argc, 2); | |
3544 | if (r) | |
3545 | return r; | |
3546 | ||
3547 | r = read_dev_id(argv[1], &dev_id, 1); | |
3548 | if (r) | |
3549 | return r; | |
3550 | ||
3551 | r = dm_pool_delete_thin_device(pool->pmd, dev_id); | |
3552 | if (r) | |
3553 | DMWARN("Deletion of thin device %s failed.", argv[1]); | |
3554 | ||
3555 | return r; | |
3556 | } | |
3557 | ||
3558 | static int process_set_transaction_id_mesg(unsigned argc, char **argv, struct pool *pool) | |
3559 | { | |
3560 | dm_thin_id old_id, new_id; | |
3561 | int r; | |
3562 | ||
3563 | r = check_arg_count(argc, 3); | |
3564 | if (r) | |
3565 | return r; | |
3566 | ||
3567 | if (kstrtoull(argv[1], 10, (unsigned long long *)&old_id)) { | |
3568 | DMWARN("set_transaction_id message: Unrecognised id %s.", argv[1]); | |
3569 | return -EINVAL; | |
3570 | } | |
3571 | ||
3572 | if (kstrtoull(argv[2], 10, (unsigned long long *)&new_id)) { | |
3573 | DMWARN("set_transaction_id message: Unrecognised new id %s.", argv[2]); | |
3574 | return -EINVAL; | |
3575 | } | |
3576 | ||
3577 | r = dm_pool_set_metadata_transaction_id(pool->pmd, old_id, new_id); | |
3578 | if (r) { | |
3579 | DMWARN("Failed to change transaction id from %s to %s.", | |
3580 | argv[1], argv[2]); | |
3581 | return r; | |
3582 | } | |
3583 | ||
3584 | return 0; | |
3585 | } | |
3586 | ||
cc8394d8 JT |
3587 | static int process_reserve_metadata_snap_mesg(unsigned argc, char **argv, struct pool *pool) |
3588 | { | |
3589 | int r; | |
3590 | ||
3591 | r = check_arg_count(argc, 1); | |
3592 | if (r) | |
3593 | return r; | |
3594 | ||
020cc3b5 | 3595 | (void) commit(pool); |
0d200aef | 3596 | |
cc8394d8 JT |
3597 | r = dm_pool_reserve_metadata_snap(pool->pmd); |
3598 | if (r) | |
3599 | DMWARN("reserve_metadata_snap message failed."); | |
3600 | ||
3601 | return r; | |
3602 | } | |
3603 | ||
3604 | static int process_release_metadata_snap_mesg(unsigned argc, char **argv, struct pool *pool) | |
3605 | { | |
3606 | int r; | |
3607 | ||
3608 | r = check_arg_count(argc, 1); | |
3609 | if (r) | |
3610 | return r; | |
3611 | ||
3612 | r = dm_pool_release_metadata_snap(pool->pmd); | |
3613 | if (r) | |
3614 | DMWARN("release_metadata_snap message failed."); | |
3615 | ||
3616 | return r; | |
3617 | } | |
3618 | ||
991d9fa0 JT |
3619 | /* |
3620 | * Messages supported: | |
3621 | * create_thin <dev_id> | |
3622 | * create_snap <dev_id> <origin_id> | |
3623 | * delete <dev_id> | |
991d9fa0 | 3624 | * set_transaction_id <current_trans_id> <new_trans_id> |
cc8394d8 JT |
3625 | * reserve_metadata_snap |
3626 | * release_metadata_snap | |
991d9fa0 JT |
3627 | */ |
3628 | static int pool_message(struct dm_target *ti, unsigned argc, char **argv) | |
3629 | { | |
3630 | int r = -EINVAL; | |
3631 | struct pool_c *pt = ti->private; | |
3632 | struct pool *pool = pt->pool; | |
3633 | ||
2a7eaea0 JT |
3634 | if (get_pool_mode(pool) >= PM_READ_ONLY) { |
3635 | DMERR("%s: unable to service pool target messages in READ_ONLY or FAIL mode", | |
3636 | dm_device_name(pool->pool_md)); | |
fd467696 | 3637 | return -EOPNOTSUPP; |
2a7eaea0 JT |
3638 | } |
3639 | ||
991d9fa0 JT |
3640 | if (!strcasecmp(argv[0], "create_thin")) |
3641 | r = process_create_thin_mesg(argc, argv, pool); | |
3642 | ||
3643 | else if (!strcasecmp(argv[0], "create_snap")) | |
3644 | r = process_create_snap_mesg(argc, argv, pool); | |
3645 | ||
3646 | else if (!strcasecmp(argv[0], "delete")) | |
3647 | r = process_delete_mesg(argc, argv, pool); | |
3648 | ||
3649 | else if (!strcasecmp(argv[0], "set_transaction_id")) | |
3650 | r = process_set_transaction_id_mesg(argc, argv, pool); | |
3651 | ||
cc8394d8 JT |
3652 | else if (!strcasecmp(argv[0], "reserve_metadata_snap")) |
3653 | r = process_reserve_metadata_snap_mesg(argc, argv, pool); | |
3654 | ||
3655 | else if (!strcasecmp(argv[0], "release_metadata_snap")) | |
3656 | r = process_release_metadata_snap_mesg(argc, argv, pool); | |
3657 | ||
991d9fa0 JT |
3658 | else |
3659 | DMWARN("Unrecognised thin pool target message received: %s", argv[0]); | |
3660 | ||
e49e5829 | 3661 | if (!r) |
020cc3b5 | 3662 | (void) commit(pool); |
991d9fa0 JT |
3663 | |
3664 | return r; | |
3665 | } | |
3666 | ||
e49e5829 JT |
3667 | static void emit_flags(struct pool_features *pf, char *result, |
3668 | unsigned sz, unsigned maxlen) | |
3669 | { | |
3670 | unsigned count = !pf->zero_new_blocks + !pf->discard_enabled + | |
787a996c MS |
3671 | !pf->discard_passdown + (pf->mode == PM_READ_ONLY) + |
3672 | pf->error_if_no_space; | |
e49e5829 JT |
3673 | DMEMIT("%u ", count); |
3674 | ||
3675 | if (!pf->zero_new_blocks) | |
3676 | DMEMIT("skip_block_zeroing "); | |
3677 | ||
3678 | if (!pf->discard_enabled) | |
3679 | DMEMIT("ignore_discard "); | |
3680 | ||
3681 | if (!pf->discard_passdown) | |
3682 | DMEMIT("no_discard_passdown "); | |
3683 | ||
3684 | if (pf->mode == PM_READ_ONLY) | |
3685 | DMEMIT("read_only "); | |
787a996c MS |
3686 | |
3687 | if (pf->error_if_no_space) | |
3688 | DMEMIT("error_if_no_space "); | |
e49e5829 JT |
3689 | } |
3690 | ||
991d9fa0 JT |
3691 | /* |
3692 | * Status line is: | |
3693 | * <transaction id> <used metadata sectors>/<total metadata sectors> | |
3694 | * <used data sectors>/<total data sectors> <held metadata root> | |
e4c78e21 | 3695 | * <pool mode> <discard config> <no space config> <needs_check> |
991d9fa0 | 3696 | */ |
fd7c092e MP |
3697 | static void pool_status(struct dm_target *ti, status_type_t type, |
3698 | unsigned status_flags, char *result, unsigned maxlen) | |
991d9fa0 | 3699 | { |
e49e5829 | 3700 | int r; |
991d9fa0 JT |
3701 | unsigned sz = 0; |
3702 | uint64_t transaction_id; | |
3703 | dm_block_t nr_free_blocks_data; | |
3704 | dm_block_t nr_free_blocks_metadata; | |
3705 | dm_block_t nr_blocks_data; | |
3706 | dm_block_t nr_blocks_metadata; | |
3707 | dm_block_t held_root; | |
3708 | char buf[BDEVNAME_SIZE]; | |
3709 | char buf2[BDEVNAME_SIZE]; | |
3710 | struct pool_c *pt = ti->private; | |
3711 | struct pool *pool = pt->pool; | |
3712 | ||
3713 | switch (type) { | |
3714 | case STATUSTYPE_INFO: | |
e49e5829 JT |
3715 | if (get_pool_mode(pool) == PM_FAIL) { |
3716 | DMEMIT("Fail"); | |
3717 | break; | |
3718 | } | |
3719 | ||
1f4e0ff0 AK |
3720 | /* Commit to ensure statistics aren't out-of-date */ |
3721 | if (!(status_flags & DM_STATUS_NOFLUSH_FLAG) && !dm_suspended(ti)) | |
020cc3b5 | 3722 | (void) commit(pool); |
1f4e0ff0 | 3723 | |
fd7c092e MP |
3724 | r = dm_pool_get_metadata_transaction_id(pool->pmd, &transaction_id); |
3725 | if (r) { | |
4fa5971a MS |
3726 | DMERR("%s: dm_pool_get_metadata_transaction_id returned %d", |
3727 | dm_device_name(pool->pool_md), r); | |
fd7c092e MP |
3728 | goto err; |
3729 | } | |
991d9fa0 | 3730 | |
fd7c092e MP |
3731 | r = dm_pool_get_free_metadata_block_count(pool->pmd, &nr_free_blocks_metadata); |
3732 | if (r) { | |
4fa5971a MS |
3733 | DMERR("%s: dm_pool_get_free_metadata_block_count returned %d", |
3734 | dm_device_name(pool->pool_md), r); | |
fd7c092e MP |
3735 | goto err; |
3736 | } | |
991d9fa0 JT |
3737 | |
3738 | r = dm_pool_get_metadata_dev_size(pool->pmd, &nr_blocks_metadata); | |
fd7c092e | 3739 | if (r) { |
4fa5971a MS |
3740 | DMERR("%s: dm_pool_get_metadata_dev_size returned %d", |
3741 | dm_device_name(pool->pool_md), r); | |
fd7c092e MP |
3742 | goto err; |
3743 | } | |
991d9fa0 | 3744 | |
fd7c092e MP |
3745 | r = dm_pool_get_free_block_count(pool->pmd, &nr_free_blocks_data); |
3746 | if (r) { | |
4fa5971a MS |
3747 | DMERR("%s: dm_pool_get_free_block_count returned %d", |
3748 | dm_device_name(pool->pool_md), r); | |
fd7c092e MP |
3749 | goto err; |
3750 | } | |
991d9fa0 JT |
3751 | |
3752 | r = dm_pool_get_data_dev_size(pool->pmd, &nr_blocks_data); | |
fd7c092e | 3753 | if (r) { |
4fa5971a MS |
3754 | DMERR("%s: dm_pool_get_data_dev_size returned %d", |
3755 | dm_device_name(pool->pool_md), r); | |
fd7c092e MP |
3756 | goto err; |
3757 | } | |
991d9fa0 | 3758 | |
cc8394d8 | 3759 | r = dm_pool_get_metadata_snap(pool->pmd, &held_root); |
fd7c092e | 3760 | if (r) { |
4fa5971a MS |
3761 | DMERR("%s: dm_pool_get_metadata_snap returned %d", |
3762 | dm_device_name(pool->pool_md), r); | |
fd7c092e MP |
3763 | goto err; |
3764 | } | |
991d9fa0 JT |
3765 | |
3766 | DMEMIT("%llu %llu/%llu %llu/%llu ", | |
3767 | (unsigned long long)transaction_id, | |
3768 | (unsigned long long)(nr_blocks_metadata - nr_free_blocks_metadata), | |
3769 | (unsigned long long)nr_blocks_metadata, | |
3770 | (unsigned long long)(nr_blocks_data - nr_free_blocks_data), | |
3771 | (unsigned long long)nr_blocks_data); | |
3772 | ||
3773 | if (held_root) | |
e49e5829 JT |
3774 | DMEMIT("%llu ", held_root); |
3775 | else | |
3776 | DMEMIT("- "); | |
3777 | ||
3e1a0699 JT |
3778 | if (pool->pf.mode == PM_OUT_OF_DATA_SPACE) |
3779 | DMEMIT("out_of_data_space "); | |
3780 | else if (pool->pf.mode == PM_READ_ONLY) | |
e49e5829 | 3781 | DMEMIT("ro "); |
991d9fa0 | 3782 | else |
e49e5829 JT |
3783 | DMEMIT("rw "); |
3784 | ||
018debea | 3785 | if (!pool->pf.discard_enabled) |
787a996c | 3786 | DMEMIT("ignore_discard "); |
018debea | 3787 | else if (pool->pf.discard_passdown) |
787a996c MS |
3788 | DMEMIT("discard_passdown "); |
3789 | else | |
3790 | DMEMIT("no_discard_passdown "); | |
3791 | ||
3792 | if (pool->pf.error_if_no_space) | |
3793 | DMEMIT("error_if_no_space "); | |
e49e5829 | 3794 | else |
787a996c | 3795 | DMEMIT("queue_if_no_space "); |
991d9fa0 | 3796 | |
e4c78e21 MS |
3797 | if (dm_pool_metadata_needs_check(pool->pmd)) |
3798 | DMEMIT("needs_check "); | |
3799 | else | |
3800 | DMEMIT("- "); | |
3801 | ||
991d9fa0 JT |
3802 | break; |
3803 | ||
3804 | case STATUSTYPE_TABLE: | |
3805 | DMEMIT("%s %s %lu %llu ", | |
3806 | format_dev_t(buf, pt->metadata_dev->bdev->bd_dev), | |
3807 | format_dev_t(buf2, pt->data_dev->bdev->bd_dev), | |
3808 | (unsigned long)pool->sectors_per_block, | |
3809 | (unsigned long long)pt->low_water_blocks); | |
0424caa1 | 3810 | emit_flags(&pt->requested_pf, result, sz, maxlen); |
991d9fa0 JT |
3811 | break; |
3812 | } | |
fd7c092e | 3813 | return; |
991d9fa0 | 3814 | |
fd7c092e MP |
3815 | err: |
3816 | DMEMIT("Error"); | |
991d9fa0 JT |
3817 | } |
3818 | ||
3819 | static int pool_iterate_devices(struct dm_target *ti, | |
3820 | iterate_devices_callout_fn fn, void *data) | |
3821 | { | |
3822 | struct pool_c *pt = ti->private; | |
3823 | ||
3824 | return fn(ti, pt->data_dev, 0, ti->len, data); | |
3825 | } | |
3826 | ||
991d9fa0 JT |
3827 | static void pool_io_hints(struct dm_target *ti, struct queue_limits *limits) |
3828 | { | |
3829 | struct pool_c *pt = ti->private; | |
3830 | struct pool *pool = pt->pool; | |
604ea906 MS |
3831 | sector_t io_opt_sectors = limits->io_opt >> SECTOR_SHIFT; |
3832 | ||
3833 | /* | |
d200c30e MS |
3834 | * If max_sectors is smaller than pool->sectors_per_block adjust it |
3835 | * to the highest possible power-of-2 factor of pool->sectors_per_block. | |
3836 | * This is especially beneficial when the pool's data device is a RAID | |
3837 | * device that has a full stripe width that matches pool->sectors_per_block | |
3838 | * -- because even though partial RAID stripe-sized IOs will be issued to a | |
3839 | * single RAID stripe; when aggregated they will end on a full RAID stripe | |
3840 | * boundary.. which avoids additional partial RAID stripe writes cascading | |
604ea906 | 3841 | */ |
604ea906 MS |
3842 | if (limits->max_sectors < pool->sectors_per_block) { |
3843 | while (!is_factor(pool->sectors_per_block, limits->max_sectors)) { | |
3844 | if ((limits->max_sectors & (limits->max_sectors - 1)) == 0) | |
3845 | limits->max_sectors--; | |
3846 | limits->max_sectors = rounddown_pow_of_two(limits->max_sectors); | |
3847 | } | |
604ea906 | 3848 | } |
991d9fa0 | 3849 | |
0cc67cd9 MS |
3850 | /* |
3851 | * If the system-determined stacked limits are compatible with the | |
3852 | * pool's blocksize (io_opt is a factor) do not override them. | |
3853 | */ | |
3854 | if (io_opt_sectors < pool->sectors_per_block || | |
604ea906 MS |
3855 | !is_factor(io_opt_sectors, pool->sectors_per_block)) { |
3856 | if (is_factor(pool->sectors_per_block, limits->max_sectors)) | |
3857 | blk_limits_io_min(limits, limits->max_sectors << SECTOR_SHIFT); | |
3858 | else | |
3859 | blk_limits_io_min(limits, pool->sectors_per_block << SECTOR_SHIFT); | |
0cc67cd9 MS |
3860 | blk_limits_io_opt(limits, pool->sectors_per_block << SECTOR_SHIFT); |
3861 | } | |
0424caa1 MS |
3862 | |
3863 | /* | |
3864 | * pt->adjusted_pf is a staging area for the actual features to use. | |
3865 | * They get transferred to the live pool in bind_control_target() | |
3866 | * called from pool_preresume(). | |
3867 | */ | |
b60ab990 MS |
3868 | if (!pt->adjusted_pf.discard_enabled) { |
3869 | /* | |
3870 | * Must explicitly disallow stacking discard limits otherwise the | |
3871 | * block layer will stack them if pool's data device has support. | |
3872 | * QUEUE_FLAG_DISCARD wouldn't be set but there is no way for the | |
3873 | * user to see that, so make sure to set all discard limits to 0. | |
3874 | */ | |
3875 | limits->discard_granularity = 0; | |
0424caa1 | 3876 | return; |
b60ab990 | 3877 | } |
0424caa1 MS |
3878 | |
3879 | disable_passdown_if_not_supported(pt); | |
3880 | ||
34fbcf62 JT |
3881 | /* |
3882 | * The pool uses the same discard limits as the underlying data | |
3883 | * device. DM core has already set this up. | |
3884 | */ | |
991d9fa0 JT |
3885 | } |
3886 | ||
3887 | static struct target_type pool_target = { | |
3888 | .name = "thin-pool", | |
3889 | .features = DM_TARGET_SINGLETON | DM_TARGET_ALWAYS_WRITEABLE | | |
3890 | DM_TARGET_IMMUTABLE, | |
c3667cc6 | 3891 | .version = {1, 18, 0}, |
991d9fa0 JT |
3892 | .module = THIS_MODULE, |
3893 | .ctr = pool_ctr, | |
3894 | .dtr = pool_dtr, | |
3895 | .map = pool_map, | |
80e96c54 MS |
3896 | .presuspend = pool_presuspend, |
3897 | .presuspend_undo = pool_presuspend_undo, | |
991d9fa0 JT |
3898 | .postsuspend = pool_postsuspend, |
3899 | .preresume = pool_preresume, | |
3900 | .resume = pool_resume, | |
3901 | .message = pool_message, | |
3902 | .status = pool_status, | |
991d9fa0 JT |
3903 | .iterate_devices = pool_iterate_devices, |
3904 | .io_hints = pool_io_hints, | |
3905 | }; | |
3906 | ||
3907 | /*---------------------------------------------------------------- | |
3908 | * Thin target methods | |
3909 | *--------------------------------------------------------------*/ | |
b10ebd34 JT |
3910 | static void thin_get(struct thin_c *tc) |
3911 | { | |
3912 | atomic_inc(&tc->refcount); | |
3913 | } | |
3914 | ||
3915 | static void thin_put(struct thin_c *tc) | |
3916 | { | |
3917 | if (atomic_dec_and_test(&tc->refcount)) | |
3918 | complete(&tc->can_destroy); | |
3919 | } | |
3920 | ||
991d9fa0 JT |
3921 | static void thin_dtr(struct dm_target *ti) |
3922 | { | |
3923 | struct thin_c *tc = ti->private; | |
c140e1c4 MS |
3924 | unsigned long flags; |
3925 | ||
3926 | spin_lock_irqsave(&tc->pool->lock, flags); | |
3927 | list_del_rcu(&tc->list); | |
3928 | spin_unlock_irqrestore(&tc->pool->lock, flags); | |
3929 | synchronize_rcu(); | |
991d9fa0 | 3930 | |
17181fb7 MP |
3931 | thin_put(tc); |
3932 | wait_for_completion(&tc->can_destroy); | |
3933 | ||
991d9fa0 JT |
3934 | mutex_lock(&dm_thin_pool_table.mutex); |
3935 | ||
3936 | __pool_dec(tc->pool); | |
3937 | dm_pool_close_thin_device(tc->td); | |
3938 | dm_put_device(ti, tc->pool_dev); | |
2dd9c257 JT |
3939 | if (tc->origin_dev) |
3940 | dm_put_device(ti, tc->origin_dev); | |
991d9fa0 JT |
3941 | kfree(tc); |
3942 | ||
3943 | mutex_unlock(&dm_thin_pool_table.mutex); | |
3944 | } | |
3945 | ||
3946 | /* | |
3947 | * Thin target parameters: | |
3948 | * | |
2dd9c257 | 3949 | * <pool_dev> <dev_id> [origin_dev] |
991d9fa0 JT |
3950 | * |
3951 | * pool_dev: the path to the pool (eg, /dev/mapper/my_pool) | |
3952 | * dev_id: the internal device identifier | |
2dd9c257 | 3953 | * origin_dev: a device external to the pool that should act as the origin |
67e2e2b2 JT |
3954 | * |
3955 | * If the pool device has discards disabled, they get disabled for the thin | |
3956 | * device as well. | |
991d9fa0 JT |
3957 | */ |
3958 | static int thin_ctr(struct dm_target *ti, unsigned argc, char **argv) | |
3959 | { | |
3960 | int r; | |
3961 | struct thin_c *tc; | |
2dd9c257 | 3962 | struct dm_dev *pool_dev, *origin_dev; |
991d9fa0 | 3963 | struct mapped_device *pool_md; |
5e3283e2 | 3964 | unsigned long flags; |
991d9fa0 JT |
3965 | |
3966 | mutex_lock(&dm_thin_pool_table.mutex); | |
3967 | ||
2dd9c257 | 3968 | if (argc != 2 && argc != 3) { |
991d9fa0 JT |
3969 | ti->error = "Invalid argument count"; |
3970 | r = -EINVAL; | |
3971 | goto out_unlock; | |
3972 | } | |
3973 | ||
3974 | tc = ti->private = kzalloc(sizeof(*tc), GFP_KERNEL); | |
3975 | if (!tc) { | |
3976 | ti->error = "Out of memory"; | |
3977 | r = -ENOMEM; | |
3978 | goto out_unlock; | |
3979 | } | |
583024d2 | 3980 | tc->thin_md = dm_table_get_md(ti->table); |
c140e1c4 | 3981 | spin_lock_init(&tc->lock); |
a374bb21 | 3982 | INIT_LIST_HEAD(&tc->deferred_cells); |
c140e1c4 MS |
3983 | bio_list_init(&tc->deferred_bio_list); |
3984 | bio_list_init(&tc->retry_on_resume_list); | |
67324ea1 | 3985 | tc->sort_bio_list = RB_ROOT; |
991d9fa0 | 3986 | |
2dd9c257 JT |
3987 | if (argc == 3) { |
3988 | r = dm_get_device(ti, argv[2], FMODE_READ, &origin_dev); | |
3989 | if (r) { | |
3990 | ti->error = "Error opening origin device"; | |
3991 | goto bad_origin_dev; | |
3992 | } | |
3993 | tc->origin_dev = origin_dev; | |
3994 | } | |
3995 | ||
991d9fa0 JT |
3996 | r = dm_get_device(ti, argv[0], dm_table_get_mode(ti->table), &pool_dev); |
3997 | if (r) { | |
3998 | ti->error = "Error opening pool device"; | |
3999 | goto bad_pool_dev; | |
4000 | } | |
4001 | tc->pool_dev = pool_dev; | |
4002 | ||
4003 | if (read_dev_id(argv[1], (unsigned long long *)&tc->dev_id, 0)) { | |
4004 | ti->error = "Invalid device id"; | |
4005 | r = -EINVAL; | |
4006 | goto bad_common; | |
4007 | } | |
4008 | ||
4009 | pool_md = dm_get_md(tc->pool_dev->bdev->bd_dev); | |
4010 | if (!pool_md) { | |
4011 | ti->error = "Couldn't get pool mapped device"; | |
4012 | r = -EINVAL; | |
4013 | goto bad_common; | |
4014 | } | |
4015 | ||
4016 | tc->pool = __pool_table_lookup(pool_md); | |
4017 | if (!tc->pool) { | |
4018 | ti->error = "Couldn't find pool object"; | |
4019 | r = -EINVAL; | |
4020 | goto bad_pool_lookup; | |
4021 | } | |
4022 | __pool_inc(tc->pool); | |
4023 | ||
e49e5829 JT |
4024 | if (get_pool_mode(tc->pool) == PM_FAIL) { |
4025 | ti->error = "Couldn't open thin device, Pool is in fail mode"; | |
1acacc07 | 4026 | r = -EINVAL; |
80e96c54 | 4027 | goto bad_pool; |
e49e5829 JT |
4028 | } |
4029 | ||
991d9fa0 JT |
4030 | r = dm_pool_open_thin_device(tc->pool->pmd, tc->dev_id, &tc->td); |
4031 | if (r) { | |
4032 | ti->error = "Couldn't open thin internal device"; | |
80e96c54 | 4033 | goto bad_pool; |
991d9fa0 JT |
4034 | } |
4035 | ||
542f9038 MS |
4036 | r = dm_set_target_max_io_len(ti, tc->pool->sectors_per_block); |
4037 | if (r) | |
80e96c54 | 4038 | goto bad; |
542f9038 | 4039 | |
55a62eef | 4040 | ti->num_flush_bios = 1; |
16ad3d10 | 4041 | ti->flush_supported = true; |
30187e1d | 4042 | ti->per_io_data_size = sizeof(struct dm_thin_endio_hook); |
67e2e2b2 JT |
4043 | |
4044 | /* In case the pool supports discards, pass them on. */ | |
b60ab990 | 4045 | ti->discard_zeroes_data_unsupported = true; |
67e2e2b2 | 4046 | if (tc->pool->pf.discard_enabled) { |
0ac55489 | 4047 | ti->discards_supported = true; |
55a62eef | 4048 | ti->num_discard_bios = 1; |
34fbcf62 | 4049 | ti->split_discard_bios = false; |
67e2e2b2 | 4050 | } |
991d9fa0 | 4051 | |
991d9fa0 JT |
4052 | mutex_unlock(&dm_thin_pool_table.mutex); |
4053 | ||
5e3283e2 | 4054 | spin_lock_irqsave(&tc->pool->lock, flags); |
80e96c54 MS |
4055 | if (tc->pool->suspended) { |
4056 | spin_unlock_irqrestore(&tc->pool->lock, flags); | |
4057 | mutex_lock(&dm_thin_pool_table.mutex); /* reacquire for __pool_dec */ | |
4058 | ti->error = "Unable to activate thin device while pool is suspended"; | |
4059 | r = -EINVAL; | |
4060 | goto bad; | |
4061 | } | |
2b94e896 MD |
4062 | atomic_set(&tc->refcount, 1); |
4063 | init_completion(&tc->can_destroy); | |
c140e1c4 | 4064 | list_add_tail_rcu(&tc->list, &tc->pool->active_thins); |
5e3283e2 | 4065 | spin_unlock_irqrestore(&tc->pool->lock, flags); |
c140e1c4 MS |
4066 | /* |
4067 | * This synchronize_rcu() call is needed here otherwise we risk a | |
4068 | * wake_worker() call finding no bios to process (because the newly | |
4069 | * added tc isn't yet visible). So this reduces latency since we | |
4070 | * aren't then dependent on the periodic commit to wake_worker(). | |
4071 | */ | |
4072 | synchronize_rcu(); | |
4073 | ||
80e96c54 MS |
4074 | dm_put(pool_md); |
4075 | ||
991d9fa0 JT |
4076 | return 0; |
4077 | ||
80e96c54 | 4078 | bad: |
1acacc07 | 4079 | dm_pool_close_thin_device(tc->td); |
80e96c54 | 4080 | bad_pool: |
991d9fa0 JT |
4081 | __pool_dec(tc->pool); |
4082 | bad_pool_lookup: | |
4083 | dm_put(pool_md); | |
4084 | bad_common: | |
4085 | dm_put_device(ti, tc->pool_dev); | |
4086 | bad_pool_dev: | |
2dd9c257 JT |
4087 | if (tc->origin_dev) |
4088 | dm_put_device(ti, tc->origin_dev); | |
4089 | bad_origin_dev: | |
991d9fa0 JT |
4090 | kfree(tc); |
4091 | out_unlock: | |
4092 | mutex_unlock(&dm_thin_pool_table.mutex); | |
4093 | ||
4094 | return r; | |
4095 | } | |
4096 | ||
7de3ee57 | 4097 | static int thin_map(struct dm_target *ti, struct bio *bio) |
991d9fa0 | 4098 | { |
4f024f37 | 4099 | bio->bi_iter.bi_sector = dm_target_offset(ti, bio->bi_iter.bi_sector); |
991d9fa0 | 4100 | |
7de3ee57 | 4101 | return thin_bio_map(ti, bio); |
991d9fa0 JT |
4102 | } |
4103 | ||
7de3ee57 | 4104 | static int thin_endio(struct dm_target *ti, struct bio *bio, int err) |
eb2aa48d JT |
4105 | { |
4106 | unsigned long flags; | |
59c3d2c6 | 4107 | struct dm_thin_endio_hook *h = dm_per_bio_data(bio, sizeof(struct dm_thin_endio_hook)); |
eb2aa48d | 4108 | struct list_head work; |
a24c2569 | 4109 | struct dm_thin_new_mapping *m, *tmp; |
eb2aa48d JT |
4110 | struct pool *pool = h->tc->pool; |
4111 | ||
4112 | if (h->shared_read_entry) { | |
4113 | INIT_LIST_HEAD(&work); | |
44feb387 | 4114 | dm_deferred_entry_dec(h->shared_read_entry, &work); |
eb2aa48d JT |
4115 | |
4116 | spin_lock_irqsave(&pool->lock, flags); | |
4117 | list_for_each_entry_safe(m, tmp, &work, list) { | |
4118 | list_del(&m->list); | |
50f3c3ef | 4119 | __complete_mapping_preparation(m); |
eb2aa48d JT |
4120 | } |
4121 | spin_unlock_irqrestore(&pool->lock, flags); | |
4122 | } | |
4123 | ||
104655fd JT |
4124 | if (h->all_io_entry) { |
4125 | INIT_LIST_HEAD(&work); | |
44feb387 | 4126 | dm_deferred_entry_dec(h->all_io_entry, &work); |
563af186 JT |
4127 | if (!list_empty(&work)) { |
4128 | spin_lock_irqsave(&pool->lock, flags); | |
4129 | list_for_each_entry_safe(m, tmp, &work, list) | |
daec338b | 4130 | list_add_tail(&m->list, &pool->prepared_discards); |
563af186 JT |
4131 | spin_unlock_irqrestore(&pool->lock, flags); |
4132 | wake_worker(pool); | |
4133 | } | |
104655fd JT |
4134 | } |
4135 | ||
34fbcf62 JT |
4136 | if (h->cell) |
4137 | cell_defer_no_holder(h->tc, h->cell); | |
4138 | ||
eb2aa48d JT |
4139 | return 0; |
4140 | } | |
4141 | ||
738211f7 | 4142 | static void thin_presuspend(struct dm_target *ti) |
991d9fa0 | 4143 | { |
738211f7 JT |
4144 | struct thin_c *tc = ti->private; |
4145 | ||
991d9fa0 | 4146 | if (dm_noflush_suspending(ti)) |
738211f7 JT |
4147 | noflush_work(tc, do_noflush_start); |
4148 | } | |
4149 | ||
4150 | static void thin_postsuspend(struct dm_target *ti) | |
4151 | { | |
4152 | struct thin_c *tc = ti->private; | |
4153 | ||
4154 | /* | |
4155 | * The dm_noflush_suspending flag has been cleared by now, so | |
4156 | * unfortunately we must always run this. | |
4157 | */ | |
4158 | noflush_work(tc, do_noflush_stop); | |
991d9fa0 JT |
4159 | } |
4160 | ||
e5aea7b4 JT |
4161 | static int thin_preresume(struct dm_target *ti) |
4162 | { | |
4163 | struct thin_c *tc = ti->private; | |
4164 | ||
4165 | if (tc->origin_dev) | |
4166 | tc->origin_size = get_dev_size(tc->origin_dev->bdev); | |
4167 | ||
4168 | return 0; | |
4169 | } | |
4170 | ||
991d9fa0 JT |
4171 | /* |
4172 | * <nr mapped sectors> <highest mapped sector> | |
4173 | */ | |
fd7c092e MP |
4174 | static void thin_status(struct dm_target *ti, status_type_t type, |
4175 | unsigned status_flags, char *result, unsigned maxlen) | |
991d9fa0 JT |
4176 | { |
4177 | int r; | |
4178 | ssize_t sz = 0; | |
4179 | dm_block_t mapped, highest; | |
4180 | char buf[BDEVNAME_SIZE]; | |
4181 | struct thin_c *tc = ti->private; | |
4182 | ||
e49e5829 JT |
4183 | if (get_pool_mode(tc->pool) == PM_FAIL) { |
4184 | DMEMIT("Fail"); | |
fd7c092e | 4185 | return; |
e49e5829 JT |
4186 | } |
4187 | ||
991d9fa0 JT |
4188 | if (!tc->td) |
4189 | DMEMIT("-"); | |
4190 | else { | |
4191 | switch (type) { | |
4192 | case STATUSTYPE_INFO: | |
4193 | r = dm_thin_get_mapped_count(tc->td, &mapped); | |
fd7c092e MP |
4194 | if (r) { |
4195 | DMERR("dm_thin_get_mapped_count returned %d", r); | |
4196 | goto err; | |
4197 | } | |
991d9fa0 JT |
4198 | |
4199 | r = dm_thin_get_highest_mapped_block(tc->td, &highest); | |
fd7c092e MP |
4200 | if (r < 0) { |
4201 | DMERR("dm_thin_get_highest_mapped_block returned %d", r); | |
4202 | goto err; | |
4203 | } | |
991d9fa0 JT |
4204 | |
4205 | DMEMIT("%llu ", mapped * tc->pool->sectors_per_block); | |
4206 | if (r) | |
4207 | DMEMIT("%llu", ((highest + 1) * | |
4208 | tc->pool->sectors_per_block) - 1); | |
4209 | else | |
4210 | DMEMIT("-"); | |
4211 | break; | |
4212 | ||
4213 | case STATUSTYPE_TABLE: | |
4214 | DMEMIT("%s %lu", | |
4215 | format_dev_t(buf, tc->pool_dev->bdev->bd_dev), | |
4216 | (unsigned long) tc->dev_id); | |
2dd9c257 JT |
4217 | if (tc->origin_dev) |
4218 | DMEMIT(" %s", format_dev_t(buf, tc->origin_dev->bdev->bd_dev)); | |
991d9fa0 JT |
4219 | break; |
4220 | } | |
4221 | } | |
4222 | ||
fd7c092e MP |
4223 | return; |
4224 | ||
4225 | err: | |
4226 | DMEMIT("Error"); | |
991d9fa0 JT |
4227 | } |
4228 | ||
4229 | static int thin_iterate_devices(struct dm_target *ti, | |
4230 | iterate_devices_callout_fn fn, void *data) | |
4231 | { | |
55f2b8bd | 4232 | sector_t blocks; |
991d9fa0 | 4233 | struct thin_c *tc = ti->private; |
55f2b8bd | 4234 | struct pool *pool = tc->pool; |
991d9fa0 JT |
4235 | |
4236 | /* | |
4237 | * We can't call dm_pool_get_data_dev_size() since that blocks. So | |
4238 | * we follow a more convoluted path through to the pool's target. | |
4239 | */ | |
55f2b8bd | 4240 | if (!pool->ti) |
991d9fa0 JT |
4241 | return 0; /* nothing is bound */ |
4242 | ||
55f2b8bd MS |
4243 | blocks = pool->ti->len; |
4244 | (void) sector_div(blocks, pool->sectors_per_block); | |
991d9fa0 | 4245 | if (blocks) |
55f2b8bd | 4246 | return fn(ti, tc->pool_dev, 0, pool->sectors_per_block * blocks, data); |
991d9fa0 JT |
4247 | |
4248 | return 0; | |
4249 | } | |
4250 | ||
34fbcf62 JT |
4251 | static void thin_io_hints(struct dm_target *ti, struct queue_limits *limits) |
4252 | { | |
4253 | struct thin_c *tc = ti->private; | |
4254 | struct pool *pool = tc->pool; | |
21607670 | 4255 | |
0fcb04d5 MS |
4256 | if (!pool->pf.discard_enabled) |
4257 | return; | |
34fbcf62 JT |
4258 | |
4259 | limits->discard_granularity = pool->sectors_per_block << SECTOR_SHIFT; | |
4260 | limits->max_discard_sectors = 2048 * 1024 * 16; /* 16G */ | |
4261 | } | |
4262 | ||
991d9fa0 JT |
4263 | static struct target_type thin_target = { |
4264 | .name = "thin", | |
c3667cc6 | 4265 | .version = {1, 18, 0}, |
991d9fa0 JT |
4266 | .module = THIS_MODULE, |
4267 | .ctr = thin_ctr, | |
4268 | .dtr = thin_dtr, | |
4269 | .map = thin_map, | |
eb2aa48d | 4270 | .end_io = thin_endio, |
e5aea7b4 | 4271 | .preresume = thin_preresume, |
738211f7 | 4272 | .presuspend = thin_presuspend, |
991d9fa0 JT |
4273 | .postsuspend = thin_postsuspend, |
4274 | .status = thin_status, | |
4275 | .iterate_devices = thin_iterate_devices, | |
34fbcf62 | 4276 | .io_hints = thin_io_hints, |
991d9fa0 JT |
4277 | }; |
4278 | ||
4279 | /*----------------------------------------------------------------*/ | |
4280 | ||
4281 | static int __init dm_thin_init(void) | |
4282 | { | |
4283 | int r; | |
4284 | ||
4285 | pool_table_init(); | |
4286 | ||
4287 | r = dm_register_target(&thin_target); | |
4288 | if (r) | |
4289 | return r; | |
4290 | ||
4291 | r = dm_register_target(&pool_target); | |
4292 | if (r) | |
a24c2569 MS |
4293 | goto bad_pool_target; |
4294 | ||
4295 | r = -ENOMEM; | |
4296 | ||
a24c2569 MS |
4297 | _new_mapping_cache = KMEM_CACHE(dm_thin_new_mapping, 0); |
4298 | if (!_new_mapping_cache) | |
4299 | goto bad_new_mapping_cache; | |
4300 | ||
a24c2569 MS |
4301 | return 0; |
4302 | ||
a24c2569 | 4303 | bad_new_mapping_cache: |
a24c2569 MS |
4304 | dm_unregister_target(&pool_target); |
4305 | bad_pool_target: | |
4306 | dm_unregister_target(&thin_target); | |
991d9fa0 JT |
4307 | |
4308 | return r; | |
4309 | } | |
4310 | ||
4311 | static void dm_thin_exit(void) | |
4312 | { | |
4313 | dm_unregister_target(&thin_target); | |
4314 | dm_unregister_target(&pool_target); | |
a24c2569 | 4315 | |
a24c2569 | 4316 | kmem_cache_destroy(_new_mapping_cache); |
991d9fa0 JT |
4317 | } |
4318 | ||
4319 | module_init(dm_thin_init); | |
4320 | module_exit(dm_thin_exit); | |
4321 | ||
80c57893 MS |
4322 | module_param_named(no_space_timeout, no_space_timeout_secs, uint, S_IRUGO | S_IWUSR); |
4323 | MODULE_PARM_DESC(no_space_timeout, "Out of data space queue IO timeout in seconds"); | |
4324 | ||
7cab8bf1 | 4325 | MODULE_DESCRIPTION(DM_NAME " thin provisioning target"); |
991d9fa0 JT |
4326 | MODULE_AUTHOR("Joe Thornber <dm-devel@redhat.com>"); |
4327 | MODULE_LICENSE("GPL"); |