Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Copyright (C) 2001 Sistina Software (UK) Limited. | |
d5816876 | 3 | * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved. |
1da177e4 LT |
4 | * |
5 | * This file is released under the GPL. | |
6 | */ | |
7 | ||
4cc96131 | 8 | #include "dm-core.h" |
1da177e4 LT |
9 | |
10 | #include <linux/module.h> | |
11 | #include <linux/vmalloc.h> | |
12 | #include <linux/blkdev.h> | |
13 | #include <linux/namei.h> | |
14 | #include <linux/ctype.h> | |
e7d2860b | 15 | #include <linux/string.h> |
1da177e4 LT |
16 | #include <linux/slab.h> |
17 | #include <linux/interrupt.h> | |
48c9c27b | 18 | #include <linux/mutex.h> |
d5816876 | 19 | #include <linux/delay.h> |
60063497 | 20 | #include <linux/atomic.h> |
bfebd1cd | 21 | #include <linux/blk-mq.h> |
644bda6f | 22 | #include <linux/mount.h> |
1da177e4 | 23 | |
72d94861 AK |
24 | #define DM_MSG_PREFIX "table" |
25 | ||
1da177e4 LT |
26 | #define MAX_DEPTH 16 |
27 | #define NODE_SIZE L1_CACHE_BYTES | |
28 | #define KEYS_PER_NODE (NODE_SIZE / sizeof(sector_t)) | |
29 | #define CHILDREN_PER_NODE (KEYS_PER_NODE + 1) | |
30 | ||
31 | struct dm_table { | |
1134e5ae | 32 | struct mapped_device *md; |
e6ee8c0b | 33 | unsigned type; |
1da177e4 LT |
34 | |
35 | /* btree table */ | |
36 | unsigned int depth; | |
37 | unsigned int counts[MAX_DEPTH]; /* in nodes */ | |
38 | sector_t *index[MAX_DEPTH]; | |
39 | ||
40 | unsigned int num_targets; | |
41 | unsigned int num_allocated; | |
42 | sector_t *highs; | |
43 | struct dm_target *targets; | |
44 | ||
36a0456f | 45 | struct target_type *immutable_target_type; |
e83068a5 MS |
46 | |
47 | bool integrity_supported:1; | |
48 | bool singleton:1; | |
49 | bool all_blk_mq:1; | |
5ae89a87 | 50 | |
1da177e4 LT |
51 | /* |
52 | * Indicates the rw permissions for the new logical | |
53 | * device. This should be a combination of FMODE_READ | |
54 | * and FMODE_WRITE. | |
55 | */ | |
aeb5d727 | 56 | fmode_t mode; |
1da177e4 LT |
57 | |
58 | /* a list of devices used by this table */ | |
59 | struct list_head devices; | |
60 | ||
1da177e4 LT |
61 | /* events get handed up using this callback */ |
62 | void (*event_fn)(void *); | |
63 | void *event_context; | |
e6ee8c0b KU |
64 | |
65 | struct dm_md_mempools *mempools; | |
9d357b07 N |
66 | |
67 | struct list_head target_callbacks; | |
1da177e4 LT |
68 | }; |
69 | ||
70 | /* | |
71 | * Similar to ceiling(log_size(n)) | |
72 | */ | |
73 | static unsigned int int_log(unsigned int n, unsigned int base) | |
74 | { | |
75 | int result = 0; | |
76 | ||
77 | while (n > 1) { | |
78 | n = dm_div_up(n, base); | |
79 | result++; | |
80 | } | |
81 | ||
82 | return result; | |
83 | } | |
84 | ||
1da177e4 LT |
85 | /* |
86 | * Calculate the index of the child node of the n'th node k'th key. | |
87 | */ | |
88 | static inline unsigned int get_child(unsigned int n, unsigned int k) | |
89 | { | |
90 | return (n * CHILDREN_PER_NODE) + k; | |
91 | } | |
92 | ||
93 | /* | |
94 | * Return the n'th node of level l from table t. | |
95 | */ | |
96 | static inline sector_t *get_node(struct dm_table *t, | |
97 | unsigned int l, unsigned int n) | |
98 | { | |
99 | return t->index[l] + (n * KEYS_PER_NODE); | |
100 | } | |
101 | ||
102 | /* | |
103 | * Return the highest key that you could lookup from the n'th | |
104 | * node on level l of the btree. | |
105 | */ | |
106 | static sector_t high(struct dm_table *t, unsigned int l, unsigned int n) | |
107 | { | |
108 | for (; l < t->depth - 1; l++) | |
109 | n = get_child(n, CHILDREN_PER_NODE - 1); | |
110 | ||
111 | if (n >= t->counts[l]) | |
112 | return (sector_t) - 1; | |
113 | ||
114 | return get_node(t, l, n)[KEYS_PER_NODE - 1]; | |
115 | } | |
116 | ||
117 | /* | |
118 | * Fills in a level of the btree based on the highs of the level | |
119 | * below it. | |
120 | */ | |
121 | static int setup_btree_index(unsigned int l, struct dm_table *t) | |
122 | { | |
123 | unsigned int n, k; | |
124 | sector_t *node; | |
125 | ||
126 | for (n = 0U; n < t->counts[l]; n++) { | |
127 | node = get_node(t, l, n); | |
128 | ||
129 | for (k = 0U; k < KEYS_PER_NODE; k++) | |
130 | node[k] = high(t, l + 1, get_child(n, k)); | |
131 | } | |
132 | ||
133 | return 0; | |
134 | } | |
135 | ||
136 | void *dm_vcalloc(unsigned long nmemb, unsigned long elem_size) | |
137 | { | |
138 | unsigned long size; | |
139 | void *addr; | |
140 | ||
141 | /* | |
142 | * Check that we're not going to overflow. | |
143 | */ | |
144 | if (nmemb > (ULONG_MAX / elem_size)) | |
145 | return NULL; | |
146 | ||
147 | size = nmemb * elem_size; | |
e29e65aa | 148 | addr = vzalloc(size); |
1da177e4 LT |
149 | |
150 | return addr; | |
151 | } | |
08649012 | 152 | EXPORT_SYMBOL(dm_vcalloc); |
1da177e4 LT |
153 | |
154 | /* | |
155 | * highs, and targets are managed as dynamic arrays during a | |
156 | * table load. | |
157 | */ | |
158 | static int alloc_targets(struct dm_table *t, unsigned int num) | |
159 | { | |
160 | sector_t *n_highs; | |
161 | struct dm_target *n_targets; | |
1da177e4 LT |
162 | |
163 | /* | |
164 | * Allocate both the target array and offset array at once. | |
512875bd JN |
165 | * Append an empty entry to catch sectors beyond the end of |
166 | * the device. | |
1da177e4 | 167 | */ |
512875bd | 168 | n_highs = (sector_t *) dm_vcalloc(num + 1, sizeof(struct dm_target) + |
1da177e4 LT |
169 | sizeof(sector_t)); |
170 | if (!n_highs) | |
171 | return -ENOMEM; | |
172 | ||
173 | n_targets = (struct dm_target *) (n_highs + num); | |
174 | ||
57a2f238 | 175 | memset(n_highs, -1, sizeof(*n_highs) * num); |
1da177e4 LT |
176 | vfree(t->highs); |
177 | ||
178 | t->num_allocated = num; | |
179 | t->highs = n_highs; | |
180 | t->targets = n_targets; | |
181 | ||
182 | return 0; | |
183 | } | |
184 | ||
aeb5d727 | 185 | int dm_table_create(struct dm_table **result, fmode_t mode, |
1134e5ae | 186 | unsigned num_targets, struct mapped_device *md) |
1da177e4 | 187 | { |
094262db | 188 | struct dm_table *t = kzalloc(sizeof(*t), GFP_KERNEL); |
1da177e4 LT |
189 | |
190 | if (!t) | |
191 | return -ENOMEM; | |
192 | ||
1da177e4 | 193 | INIT_LIST_HEAD(&t->devices); |
9d357b07 | 194 | INIT_LIST_HEAD(&t->target_callbacks); |
1da177e4 LT |
195 | |
196 | if (!num_targets) | |
197 | num_targets = KEYS_PER_NODE; | |
198 | ||
199 | num_targets = dm_round_up(num_targets, KEYS_PER_NODE); | |
200 | ||
5b2d0657 MP |
201 | if (!num_targets) { |
202 | kfree(t); | |
203 | return -ENOMEM; | |
204 | } | |
205 | ||
1da177e4 LT |
206 | if (alloc_targets(t, num_targets)) { |
207 | kfree(t); | |
1da177e4 LT |
208 | return -ENOMEM; |
209 | } | |
210 | ||
e83068a5 | 211 | t->type = DM_TYPE_NONE; |
1da177e4 | 212 | t->mode = mode; |
1134e5ae | 213 | t->md = md; |
1da177e4 LT |
214 | *result = t; |
215 | return 0; | |
216 | } | |
217 | ||
86f1152b | 218 | static void free_devices(struct list_head *devices, struct mapped_device *md) |
1da177e4 LT |
219 | { |
220 | struct list_head *tmp, *next; | |
221 | ||
afb24528 | 222 | list_for_each_safe(tmp, next, devices) { |
82b1519b MP |
223 | struct dm_dev_internal *dd = |
224 | list_entry(tmp, struct dm_dev_internal, list); | |
86f1152b BM |
225 | DMWARN("%s: dm_table_destroy: dm_put_device call missing for %s", |
226 | dm_device_name(md), dd->dm_dev->name); | |
227 | dm_put_table_device(md, dd->dm_dev); | |
1da177e4 LT |
228 | kfree(dd); |
229 | } | |
230 | } | |
231 | ||
d5816876 | 232 | void dm_table_destroy(struct dm_table *t) |
1da177e4 LT |
233 | { |
234 | unsigned int i; | |
235 | ||
a7940155 AK |
236 | if (!t) |
237 | return; | |
238 | ||
26803b9f | 239 | /* free the indexes */ |
1da177e4 LT |
240 | if (t->depth >= 2) |
241 | vfree(t->index[t->depth - 2]); | |
242 | ||
243 | /* free the targets */ | |
244 | for (i = 0; i < t->num_targets; i++) { | |
245 | struct dm_target *tgt = t->targets + i; | |
246 | ||
247 | if (tgt->type->dtr) | |
248 | tgt->type->dtr(tgt); | |
249 | ||
250 | dm_put_target_type(tgt->type); | |
251 | } | |
252 | ||
253 | vfree(t->highs); | |
254 | ||
255 | /* free the device list */ | |
86f1152b | 256 | free_devices(&t->devices, t->md); |
1da177e4 | 257 | |
e6ee8c0b KU |
258 | dm_free_md_mempools(t->mempools); |
259 | ||
1da177e4 LT |
260 | kfree(t); |
261 | } | |
262 | ||
1da177e4 LT |
263 | /* |
264 | * See if we've already got a device in the list. | |
265 | */ | |
82b1519b | 266 | static struct dm_dev_internal *find_device(struct list_head *l, dev_t dev) |
1da177e4 | 267 | { |
82b1519b | 268 | struct dm_dev_internal *dd; |
1da177e4 LT |
269 | |
270 | list_for_each_entry (dd, l, list) | |
86f1152b | 271 | if (dd->dm_dev->bdev->bd_dev == dev) |
1da177e4 LT |
272 | return dd; |
273 | ||
274 | return NULL; | |
275 | } | |
276 | ||
1da177e4 | 277 | /* |
f6a1ed10 | 278 | * If possible, this checks an area of a destination device is invalid. |
1da177e4 | 279 | */ |
f6a1ed10 MP |
280 | static int device_area_is_invalid(struct dm_target *ti, struct dm_dev *dev, |
281 | sector_t start, sector_t len, void *data) | |
1da177e4 | 282 | { |
f4808ca9 | 283 | struct request_queue *q; |
754c5fc7 MS |
284 | struct queue_limits *limits = data; |
285 | struct block_device *bdev = dev->bdev; | |
286 | sector_t dev_size = | |
287 | i_size_read(bdev->bd_inode) >> SECTOR_SHIFT; | |
02acc3a4 | 288 | unsigned short logical_block_size_sectors = |
754c5fc7 | 289 | limits->logical_block_size >> SECTOR_SHIFT; |
02acc3a4 | 290 | char b[BDEVNAME_SIZE]; |
2cd54d9b | 291 | |
f4808ca9 MB |
292 | /* |
293 | * Some devices exist without request functions, | |
294 | * such as loop devices not yet bound to backing files. | |
295 | * Forbid the use of such devices. | |
296 | */ | |
297 | q = bdev_get_queue(bdev); | |
298 | if (!q || !q->make_request_fn) { | |
299 | DMWARN("%s: %s is not yet initialised: " | |
300 | "start=%llu, len=%llu, dev_size=%llu", | |
301 | dm_device_name(ti->table->md), bdevname(bdev, b), | |
302 | (unsigned long long)start, | |
303 | (unsigned long long)len, | |
304 | (unsigned long long)dev_size); | |
305 | return 1; | |
306 | } | |
307 | ||
2cd54d9b | 308 | if (!dev_size) |
f6a1ed10 | 309 | return 0; |
2cd54d9b | 310 | |
5dea271b | 311 | if ((start >= dev_size) || (start + len > dev_size)) { |
a963a956 MS |
312 | DMWARN("%s: %s too small for target: " |
313 | "start=%llu, len=%llu, dev_size=%llu", | |
314 | dm_device_name(ti->table->md), bdevname(bdev, b), | |
315 | (unsigned long long)start, | |
316 | (unsigned long long)len, | |
317 | (unsigned long long)dev_size); | |
f6a1ed10 | 318 | return 1; |
02acc3a4 MS |
319 | } |
320 | ||
321 | if (logical_block_size_sectors <= 1) | |
f6a1ed10 | 322 | return 0; |
02acc3a4 MS |
323 | |
324 | if (start & (logical_block_size_sectors - 1)) { | |
325 | DMWARN("%s: start=%llu not aligned to h/w " | |
a963a956 | 326 | "logical block size %u of %s", |
02acc3a4 MS |
327 | dm_device_name(ti->table->md), |
328 | (unsigned long long)start, | |
754c5fc7 | 329 | limits->logical_block_size, bdevname(bdev, b)); |
f6a1ed10 | 330 | return 1; |
02acc3a4 MS |
331 | } |
332 | ||
5dea271b | 333 | if (len & (logical_block_size_sectors - 1)) { |
02acc3a4 | 334 | DMWARN("%s: len=%llu not aligned to h/w " |
a963a956 | 335 | "logical block size %u of %s", |
02acc3a4 | 336 | dm_device_name(ti->table->md), |
5dea271b | 337 | (unsigned long long)len, |
754c5fc7 | 338 | limits->logical_block_size, bdevname(bdev, b)); |
f6a1ed10 | 339 | return 1; |
02acc3a4 MS |
340 | } |
341 | ||
f6a1ed10 | 342 | return 0; |
1da177e4 LT |
343 | } |
344 | ||
345 | /* | |
570b9d96 | 346 | * This upgrades the mode on an already open dm_dev, being |
1da177e4 | 347 | * careful to leave things as they were if we fail to reopen the |
570b9d96 AK |
348 | * device and not to touch the existing bdev field in case |
349 | * it is accessed concurrently inside dm_table_any_congested(). | |
1da177e4 | 350 | */ |
aeb5d727 | 351 | static int upgrade_mode(struct dm_dev_internal *dd, fmode_t new_mode, |
82b1519b | 352 | struct mapped_device *md) |
1da177e4 LT |
353 | { |
354 | int r; | |
86f1152b | 355 | struct dm_dev *old_dev, *new_dev; |
1da177e4 | 356 | |
86f1152b | 357 | old_dev = dd->dm_dev; |
570b9d96 | 358 | |
86f1152b BM |
359 | r = dm_get_table_device(md, dd->dm_dev->bdev->bd_dev, |
360 | dd->dm_dev->mode | new_mode, &new_dev); | |
570b9d96 AK |
361 | if (r) |
362 | return r; | |
1da177e4 | 363 | |
86f1152b BM |
364 | dd->dm_dev = new_dev; |
365 | dm_put_table_device(md, old_dev); | |
1da177e4 | 366 | |
570b9d96 | 367 | return 0; |
1da177e4 LT |
368 | } |
369 | ||
4df2bf46 D |
370 | /* |
371 | * Convert the path to a device | |
372 | */ | |
373 | dev_t dm_get_dev_t(const char *path) | |
374 | { | |
375 | dev_t uninitialized_var(dev); | |
376 | struct block_device *bdev; | |
377 | ||
378 | bdev = lookup_bdev(path); | |
379 | if (IS_ERR(bdev)) | |
380 | dev = name_to_dev_t(path); | |
381 | else { | |
382 | dev = bdev->bd_dev; | |
383 | bdput(bdev); | |
384 | } | |
385 | ||
386 | return dev; | |
387 | } | |
388 | EXPORT_SYMBOL_GPL(dm_get_dev_t); | |
389 | ||
1da177e4 LT |
390 | /* |
391 | * Add a device to the list, or just increment the usage count if | |
392 | * it's already present. | |
393 | */ | |
08649012 MS |
394 | int dm_get_device(struct dm_target *ti, const char *path, fmode_t mode, |
395 | struct dm_dev **result) | |
1da177e4 LT |
396 | { |
397 | int r; | |
4df2bf46 | 398 | dev_t dev; |
82b1519b | 399 | struct dm_dev_internal *dd; |
08649012 | 400 | struct dm_table *t = ti->table; |
1da177e4 | 401 | |
547bc926 | 402 | BUG_ON(!t); |
1da177e4 | 403 | |
4df2bf46 D |
404 | dev = dm_get_dev_t(path); |
405 | if (!dev) | |
406 | return -ENODEV; | |
1da177e4 LT |
407 | |
408 | dd = find_device(&t->devices, dev); | |
409 | if (!dd) { | |
410 | dd = kmalloc(sizeof(*dd), GFP_KERNEL); | |
411 | if (!dd) | |
412 | return -ENOMEM; | |
413 | ||
86f1152b | 414 | if ((r = dm_get_table_device(t->md, dev, mode, &dd->dm_dev))) { |
1da177e4 LT |
415 | kfree(dd); |
416 | return r; | |
417 | } | |
418 | ||
1da177e4 LT |
419 | atomic_set(&dd->count, 0); |
420 | list_add(&dd->list, &t->devices); | |
421 | ||
86f1152b | 422 | } else if (dd->dm_dev->mode != (mode | dd->dm_dev->mode)) { |
f165921d | 423 | r = upgrade_mode(dd, mode, t->md); |
1da177e4 LT |
424 | if (r) |
425 | return r; | |
426 | } | |
427 | atomic_inc(&dd->count); | |
428 | ||
86f1152b | 429 | *result = dd->dm_dev; |
1da177e4 LT |
430 | return 0; |
431 | } | |
08649012 | 432 | EXPORT_SYMBOL(dm_get_device); |
1da177e4 | 433 | |
11f0431b MS |
434 | static int dm_set_device_limits(struct dm_target *ti, struct dm_dev *dev, |
435 | sector_t start, sector_t len, void *data) | |
1da177e4 | 436 | { |
754c5fc7 MS |
437 | struct queue_limits *limits = data; |
438 | struct block_device *bdev = dev->bdev; | |
165125e1 | 439 | struct request_queue *q = bdev_get_queue(bdev); |
0c2322e4 AK |
440 | char b[BDEVNAME_SIZE]; |
441 | ||
442 | if (unlikely(!q)) { | |
443 | DMWARN("%s: Cannot set limits for nonexistent device %s", | |
444 | dm_device_name(ti->table->md), bdevname(bdev, b)); | |
754c5fc7 | 445 | return 0; |
0c2322e4 | 446 | } |
3cb40214 | 447 | |
b27d7f16 MP |
448 | if (bdev_stack_limits(limits, bdev, start) < 0) |
449 | DMWARN("%s: adding target device %s caused an alignment inconsistency: " | |
a963a956 MS |
450 | "physical_block_size=%u, logical_block_size=%u, " |
451 | "alignment_offset=%u, start=%llu", | |
452 | dm_device_name(ti->table->md), bdevname(bdev, b), | |
453 | q->limits.physical_block_size, | |
454 | q->limits.logical_block_size, | |
455 | q->limits.alignment_offset, | |
b27d7f16 | 456 | (unsigned long long) start << SECTOR_SHIFT); |
3cb40214 | 457 | |
754c5fc7 | 458 | return 0; |
3cb40214 | 459 | } |
969429b5 | 460 | |
1da177e4 | 461 | /* |
08649012 | 462 | * Decrement a device's use count and remove it if necessary. |
1da177e4 | 463 | */ |
82b1519b | 464 | void dm_put_device(struct dm_target *ti, struct dm_dev *d) |
1da177e4 | 465 | { |
86f1152b BM |
466 | int found = 0; |
467 | struct list_head *devices = &ti->table->devices; | |
468 | struct dm_dev_internal *dd; | |
82b1519b | 469 | |
86f1152b BM |
470 | list_for_each_entry(dd, devices, list) { |
471 | if (dd->dm_dev == d) { | |
472 | found = 1; | |
473 | break; | |
474 | } | |
475 | } | |
476 | if (!found) { | |
477 | DMWARN("%s: device %s not in table devices list", | |
478 | dm_device_name(ti->table->md), d->name); | |
479 | return; | |
480 | } | |
1da177e4 | 481 | if (atomic_dec_and_test(&dd->count)) { |
86f1152b | 482 | dm_put_table_device(ti->table->md, d); |
1da177e4 LT |
483 | list_del(&dd->list); |
484 | kfree(dd); | |
485 | } | |
486 | } | |
08649012 | 487 | EXPORT_SYMBOL(dm_put_device); |
1da177e4 LT |
488 | |
489 | /* | |
490 | * Checks to see if the target joins onto the end of the table. | |
491 | */ | |
492 | static int adjoin(struct dm_table *table, struct dm_target *ti) | |
493 | { | |
494 | struct dm_target *prev; | |
495 | ||
496 | if (!table->num_targets) | |
497 | return !ti->begin; | |
498 | ||
499 | prev = &table->targets[table->num_targets - 1]; | |
500 | return (ti->begin == (prev->begin + prev->len)); | |
501 | } | |
502 | ||
503 | /* | |
504 | * Used to dynamically allocate the arg array. | |
f36afb39 MP |
505 | * |
506 | * We do first allocation with GFP_NOIO because dm-mpath and dm-thin must | |
507 | * process messages even if some device is suspended. These messages have a | |
508 | * small fixed number of arguments. | |
509 | * | |
510 | * On the other hand, dm-switch needs to process bulk data using messages and | |
511 | * excessive use of GFP_NOIO could cause trouble. | |
1da177e4 LT |
512 | */ |
513 | static char **realloc_argv(unsigned *array_size, char **old_argv) | |
514 | { | |
515 | char **argv; | |
516 | unsigned new_size; | |
f36afb39 | 517 | gfp_t gfp; |
1da177e4 | 518 | |
f36afb39 MP |
519 | if (*array_size) { |
520 | new_size = *array_size * 2; | |
521 | gfp = GFP_KERNEL; | |
522 | } else { | |
523 | new_size = 8; | |
524 | gfp = GFP_NOIO; | |
525 | } | |
526 | argv = kmalloc(new_size * sizeof(*argv), gfp); | |
1da177e4 LT |
527 | if (argv) { |
528 | memcpy(argv, old_argv, *array_size * sizeof(*argv)); | |
529 | *array_size = new_size; | |
530 | } | |
531 | ||
532 | kfree(old_argv); | |
533 | return argv; | |
534 | } | |
535 | ||
536 | /* | |
537 | * Destructively splits up the argument list to pass to ctr. | |
538 | */ | |
539 | int dm_split_args(int *argc, char ***argvp, char *input) | |
540 | { | |
541 | char *start, *end = input, *out, **argv = NULL; | |
542 | unsigned array_size = 0; | |
543 | ||
544 | *argc = 0; | |
814d6862 DT |
545 | |
546 | if (!input) { | |
547 | *argvp = NULL; | |
548 | return 0; | |
549 | } | |
550 | ||
1da177e4 LT |
551 | argv = realloc_argv(&array_size, argv); |
552 | if (!argv) | |
553 | return -ENOMEM; | |
554 | ||
555 | while (1) { | |
1da177e4 | 556 | /* Skip whitespace */ |
e7d2860b | 557 | start = skip_spaces(end); |
1da177e4 LT |
558 | |
559 | if (!*start) | |
560 | break; /* success, we hit the end */ | |
561 | ||
562 | /* 'out' is used to remove any back-quotes */ | |
563 | end = out = start; | |
564 | while (*end) { | |
565 | /* Everything apart from '\0' can be quoted */ | |
566 | if (*end == '\\' && *(end + 1)) { | |
567 | *out++ = *(end + 1); | |
568 | end += 2; | |
569 | continue; | |
570 | } | |
571 | ||
572 | if (isspace(*end)) | |
573 | break; /* end of token */ | |
574 | ||
575 | *out++ = *end++; | |
576 | } | |
577 | ||
578 | /* have we already filled the array ? */ | |
579 | if ((*argc + 1) > array_size) { | |
580 | argv = realloc_argv(&array_size, argv); | |
581 | if (!argv) | |
582 | return -ENOMEM; | |
583 | } | |
584 | ||
585 | /* we know this is whitespace */ | |
586 | if (*end) | |
587 | end++; | |
588 | ||
589 | /* terminate the string and put it in the array */ | |
590 | *out = '\0'; | |
591 | argv[*argc] = start; | |
592 | (*argc)++; | |
593 | } | |
594 | ||
595 | *argvp = argv; | |
596 | return 0; | |
597 | } | |
598 | ||
be6d4305 MS |
599 | /* |
600 | * Impose necessary and sufficient conditions on a devices's table such | |
601 | * that any incoming bio which respects its logical_block_size can be | |
602 | * processed successfully. If it falls across the boundary between | |
603 | * two or more targets, the size of each piece it gets split into must | |
604 | * be compatible with the logical_block_size of the target processing it. | |
605 | */ | |
754c5fc7 MS |
606 | static int validate_hardware_logical_block_alignment(struct dm_table *table, |
607 | struct queue_limits *limits) | |
be6d4305 MS |
608 | { |
609 | /* | |
610 | * This function uses arithmetic modulo the logical_block_size | |
611 | * (in units of 512-byte sectors). | |
612 | */ | |
613 | unsigned short device_logical_block_size_sects = | |
754c5fc7 | 614 | limits->logical_block_size >> SECTOR_SHIFT; |
be6d4305 MS |
615 | |
616 | /* | |
617 | * Offset of the start of the next table entry, mod logical_block_size. | |
618 | */ | |
619 | unsigned short next_target_start = 0; | |
620 | ||
621 | /* | |
622 | * Given an aligned bio that extends beyond the end of a | |
623 | * target, how many sectors must the next target handle? | |
624 | */ | |
625 | unsigned short remaining = 0; | |
626 | ||
627 | struct dm_target *uninitialized_var(ti); | |
754c5fc7 | 628 | struct queue_limits ti_limits; |
be6d4305 MS |
629 | unsigned i = 0; |
630 | ||
631 | /* | |
632 | * Check each entry in the table in turn. | |
633 | */ | |
634 | while (i < dm_table_get_num_targets(table)) { | |
635 | ti = dm_table_get_target(table, i++); | |
636 | ||
b1bd055d | 637 | blk_set_stacking_limits(&ti_limits); |
754c5fc7 MS |
638 | |
639 | /* combine all target devices' limits */ | |
640 | if (ti->type->iterate_devices) | |
641 | ti->type->iterate_devices(ti, dm_set_device_limits, | |
642 | &ti_limits); | |
643 | ||
be6d4305 MS |
644 | /* |
645 | * If the remaining sectors fall entirely within this | |
646 | * table entry are they compatible with its logical_block_size? | |
647 | */ | |
648 | if (remaining < ti->len && | |
754c5fc7 | 649 | remaining & ((ti_limits.logical_block_size >> |
be6d4305 MS |
650 | SECTOR_SHIFT) - 1)) |
651 | break; /* Error */ | |
652 | ||
653 | next_target_start = | |
654 | (unsigned short) ((next_target_start + ti->len) & | |
655 | (device_logical_block_size_sects - 1)); | |
656 | remaining = next_target_start ? | |
657 | device_logical_block_size_sects - next_target_start : 0; | |
658 | } | |
659 | ||
660 | if (remaining) { | |
661 | DMWARN("%s: table line %u (start sect %llu len %llu) " | |
a963a956 | 662 | "not aligned to h/w logical block size %u", |
be6d4305 MS |
663 | dm_device_name(table->md), i, |
664 | (unsigned long long) ti->begin, | |
665 | (unsigned long long) ti->len, | |
754c5fc7 | 666 | limits->logical_block_size); |
be6d4305 MS |
667 | return -EINVAL; |
668 | } | |
669 | ||
670 | return 0; | |
671 | } | |
672 | ||
1da177e4 LT |
673 | int dm_table_add_target(struct dm_table *t, const char *type, |
674 | sector_t start, sector_t len, char *params) | |
675 | { | |
676 | int r = -EINVAL, argc; | |
677 | char **argv; | |
678 | struct dm_target *tgt; | |
679 | ||
3791e2fc AK |
680 | if (t->singleton) { |
681 | DMERR("%s: target type %s must appear alone in table", | |
682 | dm_device_name(t->md), t->targets->type->name); | |
683 | return -EINVAL; | |
684 | } | |
685 | ||
57a2f238 | 686 | BUG_ON(t->num_targets >= t->num_allocated); |
1da177e4 LT |
687 | |
688 | tgt = t->targets + t->num_targets; | |
689 | memset(tgt, 0, sizeof(*tgt)); | |
690 | ||
691 | if (!len) { | |
72d94861 | 692 | DMERR("%s: zero-length target", dm_device_name(t->md)); |
1da177e4 LT |
693 | return -EINVAL; |
694 | } | |
695 | ||
696 | tgt->type = dm_get_target_type(type); | |
697 | if (!tgt->type) { | |
72d94861 AK |
698 | DMERR("%s: %s: unknown target type", dm_device_name(t->md), |
699 | type); | |
1da177e4 LT |
700 | return -EINVAL; |
701 | } | |
702 | ||
3791e2fc AK |
703 | if (dm_target_needs_singleton(tgt->type)) { |
704 | if (t->num_targets) { | |
705 | DMERR("%s: target type %s must appear alone in table", | |
706 | dm_device_name(t->md), type); | |
707 | return -EINVAL; | |
708 | } | |
e83068a5 | 709 | t->singleton = true; |
3791e2fc AK |
710 | } |
711 | ||
cc6cbe14 AK |
712 | if (dm_target_always_writeable(tgt->type) && !(t->mode & FMODE_WRITE)) { |
713 | DMERR("%s: target type %s may not be included in read-only tables", | |
714 | dm_device_name(t->md), type); | |
715 | return -EINVAL; | |
716 | } | |
717 | ||
36a0456f AK |
718 | if (t->immutable_target_type) { |
719 | if (t->immutable_target_type != tgt->type) { | |
720 | DMERR("%s: immutable target type %s cannot be mixed with other target types", | |
721 | dm_device_name(t->md), t->immutable_target_type->name); | |
722 | return -EINVAL; | |
723 | } | |
724 | } else if (dm_target_is_immutable(tgt->type)) { | |
725 | if (t->num_targets) { | |
726 | DMERR("%s: immutable target type %s cannot be mixed with other target types", | |
727 | dm_device_name(t->md), tgt->type->name); | |
728 | return -EINVAL; | |
729 | } | |
730 | t->immutable_target_type = tgt->type; | |
731 | } | |
732 | ||
1da177e4 LT |
733 | tgt->table = t; |
734 | tgt->begin = start; | |
735 | tgt->len = len; | |
736 | tgt->error = "Unknown error"; | |
737 | ||
738 | /* | |
739 | * Does this target adjoin the previous one ? | |
740 | */ | |
741 | if (!adjoin(t, tgt)) { | |
742 | tgt->error = "Gap in table"; | |
743 | r = -EINVAL; | |
744 | goto bad; | |
745 | } | |
746 | ||
747 | r = dm_split_args(&argc, &argv, params); | |
748 | if (r) { | |
749 | tgt->error = "couldn't split parameters (insufficient memory)"; | |
750 | goto bad; | |
751 | } | |
752 | ||
753 | r = tgt->type->ctr(tgt, argc, argv); | |
754 | kfree(argv); | |
755 | if (r) | |
756 | goto bad; | |
757 | ||
758 | t->highs[t->num_targets++] = tgt->begin + tgt->len - 1; | |
759 | ||
55a62eef AK |
760 | if (!tgt->num_discard_bios && tgt->discards_supported) |
761 | DMWARN("%s: %s: ignoring discards_supported because num_discard_bios is zero.", | |
936688d7 | 762 | dm_device_name(t->md), type); |
5ae89a87 | 763 | |
1da177e4 LT |
764 | return 0; |
765 | ||
766 | bad: | |
72d94861 | 767 | DMERR("%s: %s: %s", dm_device_name(t->md), type, tgt->error); |
1da177e4 LT |
768 | dm_put_target_type(tgt->type); |
769 | return r; | |
770 | } | |
771 | ||
498f0103 MS |
772 | /* |
773 | * Target argument parsing helpers. | |
774 | */ | |
775 | static int validate_next_arg(struct dm_arg *arg, struct dm_arg_set *arg_set, | |
776 | unsigned *value, char **error, unsigned grouped) | |
777 | { | |
778 | const char *arg_str = dm_shift_arg(arg_set); | |
31998ef1 | 779 | char dummy; |
498f0103 MS |
780 | |
781 | if (!arg_str || | |
31998ef1 | 782 | (sscanf(arg_str, "%u%c", value, &dummy) != 1) || |
498f0103 MS |
783 | (*value < arg->min) || |
784 | (*value > arg->max) || | |
785 | (grouped && arg_set->argc < *value)) { | |
786 | *error = arg->error; | |
787 | return -EINVAL; | |
788 | } | |
789 | ||
790 | return 0; | |
791 | } | |
792 | ||
793 | int dm_read_arg(struct dm_arg *arg, struct dm_arg_set *arg_set, | |
794 | unsigned *value, char **error) | |
795 | { | |
796 | return validate_next_arg(arg, arg_set, value, error, 0); | |
797 | } | |
798 | EXPORT_SYMBOL(dm_read_arg); | |
799 | ||
800 | int dm_read_arg_group(struct dm_arg *arg, struct dm_arg_set *arg_set, | |
801 | unsigned *value, char **error) | |
802 | { | |
803 | return validate_next_arg(arg, arg_set, value, error, 1); | |
804 | } | |
805 | EXPORT_SYMBOL(dm_read_arg_group); | |
806 | ||
807 | const char *dm_shift_arg(struct dm_arg_set *as) | |
808 | { | |
809 | char *r; | |
810 | ||
811 | if (as->argc) { | |
812 | as->argc--; | |
813 | r = *as->argv; | |
814 | as->argv++; | |
815 | return r; | |
816 | } | |
817 | ||
818 | return NULL; | |
819 | } | |
820 | EXPORT_SYMBOL(dm_shift_arg); | |
821 | ||
822 | void dm_consume_args(struct dm_arg_set *as, unsigned num_args) | |
823 | { | |
824 | BUG_ON(as->argc < num_args); | |
825 | as->argc -= num_args; | |
826 | as->argv += num_args; | |
827 | } | |
828 | EXPORT_SYMBOL(dm_consume_args); | |
829 | ||
545ed20e TK |
830 | static bool __table_type_bio_based(unsigned table_type) |
831 | { | |
832 | return (table_type == DM_TYPE_BIO_BASED || | |
833 | table_type == DM_TYPE_DAX_BIO_BASED); | |
834 | } | |
835 | ||
15b94a69 JN |
836 | static bool __table_type_request_based(unsigned table_type) |
837 | { | |
838 | return (table_type == DM_TYPE_REQUEST_BASED || | |
839 | table_type == DM_TYPE_MQ_REQUEST_BASED); | |
840 | } | |
841 | ||
e83068a5 MS |
842 | void dm_table_set_type(struct dm_table *t, unsigned type) |
843 | { | |
844 | t->type = type; | |
845 | } | |
846 | EXPORT_SYMBOL_GPL(dm_table_set_type); | |
847 | ||
545ed20e TK |
848 | static int device_supports_dax(struct dm_target *ti, struct dm_dev *dev, |
849 | sector_t start, sector_t len, void *data) | |
850 | { | |
851 | struct request_queue *q = bdev_get_queue(dev->bdev); | |
852 | ||
853 | return q && blk_queue_dax(q); | |
854 | } | |
855 | ||
856 | static bool dm_table_supports_dax(struct dm_table *t) | |
857 | { | |
858 | struct dm_target *ti; | |
859 | unsigned i = 0; | |
860 | ||
861 | /* Ensure that all targets support DAX. */ | |
862 | while (i < dm_table_get_num_targets(t)) { | |
863 | ti = dm_table_get_target(t, i++); | |
864 | ||
865 | if (!ti->type->direct_access) | |
866 | return false; | |
867 | ||
868 | if (!ti->type->iterate_devices || | |
869 | !ti->type->iterate_devices(ti, device_supports_dax, NULL)) | |
870 | return false; | |
871 | } | |
872 | ||
873 | return true; | |
874 | } | |
875 | ||
e83068a5 | 876 | static int dm_table_determine_type(struct dm_table *t) |
e6ee8c0b KU |
877 | { |
878 | unsigned i; | |
169e2cc2 | 879 | unsigned bio_based = 0, request_based = 0, hybrid = 0; |
e83068a5 | 880 | bool verify_blk_mq = false; |
e6ee8c0b KU |
881 | struct dm_target *tgt; |
882 | struct dm_dev_internal *dd; | |
e83068a5 | 883 | struct list_head *devices = dm_table_get_devices(t); |
65803c20 | 884 | unsigned live_md_type = dm_get_md_type(t->md); |
e6ee8c0b | 885 | |
e83068a5 MS |
886 | if (t->type != DM_TYPE_NONE) { |
887 | /* target already set the table's type */ | |
888 | if (t->type == DM_TYPE_BIO_BASED) | |
889 | return 0; | |
545ed20e | 890 | BUG_ON(t->type == DM_TYPE_DAX_BIO_BASED); |
e83068a5 MS |
891 | goto verify_rq_based; |
892 | } | |
893 | ||
e6ee8c0b KU |
894 | for (i = 0; i < t->num_targets; i++) { |
895 | tgt = t->targets + i; | |
169e2cc2 MS |
896 | if (dm_target_hybrid(tgt)) |
897 | hybrid = 1; | |
898 | else if (dm_target_request_based(tgt)) | |
e6ee8c0b KU |
899 | request_based = 1; |
900 | else | |
901 | bio_based = 1; | |
902 | ||
903 | if (bio_based && request_based) { | |
904 | DMWARN("Inconsistent table: different target types" | |
905 | " can't be mixed up"); | |
906 | return -EINVAL; | |
907 | } | |
908 | } | |
909 | ||
169e2cc2 MS |
910 | if (hybrid && !bio_based && !request_based) { |
911 | /* | |
912 | * The targets can work either way. | |
913 | * Determine the type from the live device. | |
914 | * Default to bio-based if device is new. | |
915 | */ | |
15b94a69 | 916 | if (__table_type_request_based(live_md_type)) |
169e2cc2 MS |
917 | request_based = 1; |
918 | else | |
919 | bio_based = 1; | |
920 | } | |
921 | ||
e6ee8c0b KU |
922 | if (bio_based) { |
923 | /* We must use this table as bio-based */ | |
924 | t->type = DM_TYPE_BIO_BASED; | |
545ed20e TK |
925 | if (dm_table_supports_dax(t)) |
926 | t->type = DM_TYPE_DAX_BIO_BASED; | |
e6ee8c0b KU |
927 | return 0; |
928 | } | |
929 | ||
930 | BUG_ON(!request_based); /* No targets in this table */ | |
931 | ||
e83068a5 MS |
932 | if (list_empty(devices) && __table_type_request_based(live_md_type)) { |
933 | /* inherit live MD type */ | |
934 | t->type = live_md_type; | |
935 | return 0; | |
936 | } | |
937 | ||
938 | /* | |
939 | * The only way to establish DM_TYPE_MQ_REQUEST_BASED is by | |
940 | * having a compatible target use dm_table_set_type. | |
941 | */ | |
942 | t->type = DM_TYPE_REQUEST_BASED; | |
943 | ||
944 | verify_rq_based: | |
65803c20 MS |
945 | /* |
946 | * Request-based dm supports only tables that have a single target now. | |
947 | * To support multiple targets, request splitting support is needed, | |
948 | * and that needs lots of changes in the block-layer. | |
949 | * (e.g. request completion process for partial completion.) | |
950 | */ | |
951 | if (t->num_targets > 1) { | |
952 | DMWARN("Request-based dm doesn't support multiple targets yet"); | |
953 | return -EINVAL; | |
954 | } | |
955 | ||
e6ee8c0b | 956 | /* Non-request-stackable devices can't be used for request-based dm */ |
e6ee8c0b | 957 | list_for_each_entry(dd, devices, list) { |
e5863d9a MS |
958 | struct request_queue *q = bdev_get_queue(dd->dm_dev->bdev); |
959 | ||
960 | if (!blk_queue_stackable(q)) { | |
961 | DMERR("table load rejected: including" | |
962 | " non-request-stackable devices"); | |
e6ee8c0b KU |
963 | return -EINVAL; |
964 | } | |
e5863d9a MS |
965 | |
966 | if (q->mq_ops) | |
e83068a5 | 967 | verify_blk_mq = true; |
e5863d9a MS |
968 | } |
969 | ||
e83068a5 | 970 | if (verify_blk_mq) { |
e5863d9a MS |
971 | /* verify _all_ devices in the table are blk-mq devices */ |
972 | list_for_each_entry(dd, devices, list) | |
973 | if (!bdev_get_queue(dd->dm_dev->bdev)->mq_ops) { | |
974 | DMERR("table load rejected: not all devices" | |
975 | " are blk-mq request-stackable"); | |
976 | return -EINVAL; | |
977 | } | |
e6ee8c0b | 978 | |
e83068a5 MS |
979 | t->all_blk_mq = true; |
980 | } | |
e6ee8c0b KU |
981 | |
982 | return 0; | |
983 | } | |
984 | ||
985 | unsigned dm_table_get_type(struct dm_table *t) | |
986 | { | |
987 | return t->type; | |
988 | } | |
989 | ||
36a0456f AK |
990 | struct target_type *dm_table_get_immutable_target_type(struct dm_table *t) |
991 | { | |
992 | return t->immutable_target_type; | |
993 | } | |
994 | ||
16f12266 MS |
995 | struct dm_target *dm_table_get_immutable_target(struct dm_table *t) |
996 | { | |
997 | /* Immutable target is implicitly a singleton */ | |
998 | if (t->num_targets > 1 || | |
999 | !dm_target_is_immutable(t->targets[0].type)) | |
1000 | return NULL; | |
1001 | ||
1002 | return t->targets; | |
1003 | } | |
1004 | ||
f083b09b MS |
1005 | struct dm_target *dm_table_get_wildcard_target(struct dm_table *t) |
1006 | { | |
1007 | struct dm_target *uninitialized_var(ti); | |
1008 | unsigned i = 0; | |
1009 | ||
1010 | while (i < dm_table_get_num_targets(t)) { | |
1011 | ti = dm_table_get_target(t, i++); | |
1012 | if (dm_target_is_wildcard(ti->type)) | |
1013 | return ti; | |
1014 | } | |
1015 | ||
1016 | return NULL; | |
1017 | } | |
1018 | ||
545ed20e TK |
1019 | bool dm_table_bio_based(struct dm_table *t) |
1020 | { | |
1021 | return __table_type_bio_based(dm_table_get_type(t)); | |
1022 | } | |
1023 | ||
e6ee8c0b KU |
1024 | bool dm_table_request_based(struct dm_table *t) |
1025 | { | |
15b94a69 | 1026 | return __table_type_request_based(dm_table_get_type(t)); |
e5863d9a MS |
1027 | } |
1028 | ||
e83068a5 | 1029 | bool dm_table_all_blk_mq_devices(struct dm_table *t) |
e5863d9a | 1030 | { |
e83068a5 | 1031 | return t->all_blk_mq; |
e6ee8c0b KU |
1032 | } |
1033 | ||
17e149b8 | 1034 | static int dm_table_alloc_md_mempools(struct dm_table *t, struct mapped_device *md) |
e6ee8c0b KU |
1035 | { |
1036 | unsigned type = dm_table_get_type(t); | |
30187e1d | 1037 | unsigned per_io_data_size = 0; |
78d8e58a | 1038 | struct dm_target *tgt; |
c0820cf5 | 1039 | unsigned i; |
e6ee8c0b | 1040 | |
78d8e58a | 1041 | if (unlikely(type == DM_TYPE_NONE)) { |
e6ee8c0b KU |
1042 | DMWARN("no table type is set, can't allocate mempools"); |
1043 | return -EINVAL; | |
1044 | } | |
1045 | ||
545ed20e | 1046 | if (__table_type_bio_based(type)) |
78d8e58a MS |
1047 | for (i = 0; i < t->num_targets; i++) { |
1048 | tgt = t->targets + i; | |
30187e1d | 1049 | per_io_data_size = max(per_io_data_size, tgt->per_io_data_size); |
78d8e58a MS |
1050 | } |
1051 | ||
30187e1d | 1052 | t->mempools = dm_alloc_md_mempools(md, type, t->integrity_supported, per_io_data_size); |
4e6e36c3 MS |
1053 | if (!t->mempools) |
1054 | return -ENOMEM; | |
e6ee8c0b KU |
1055 | |
1056 | return 0; | |
1057 | } | |
1058 | ||
1059 | void dm_table_free_md_mempools(struct dm_table *t) | |
1060 | { | |
1061 | dm_free_md_mempools(t->mempools); | |
1062 | t->mempools = NULL; | |
1063 | } | |
1064 | ||
1065 | struct dm_md_mempools *dm_table_get_md_mempools(struct dm_table *t) | |
1066 | { | |
1067 | return t->mempools; | |
1068 | } | |
1069 | ||
1da177e4 LT |
1070 | static int setup_indexes(struct dm_table *t) |
1071 | { | |
1072 | int i; | |
1073 | unsigned int total = 0; | |
1074 | sector_t *indexes; | |
1075 | ||
1076 | /* allocate the space for *all* the indexes */ | |
1077 | for (i = t->depth - 2; i >= 0; i--) { | |
1078 | t->counts[i] = dm_div_up(t->counts[i + 1], CHILDREN_PER_NODE); | |
1079 | total += t->counts[i]; | |
1080 | } | |
1081 | ||
1082 | indexes = (sector_t *) dm_vcalloc(total, (unsigned long) NODE_SIZE); | |
1083 | if (!indexes) | |
1084 | return -ENOMEM; | |
1085 | ||
1086 | /* set up internal nodes, bottom-up */ | |
82d601dc | 1087 | for (i = t->depth - 2; i >= 0; i--) { |
1da177e4 LT |
1088 | t->index[i] = indexes; |
1089 | indexes += (KEYS_PER_NODE * t->counts[i]); | |
1090 | setup_btree_index(i, t); | |
1091 | } | |
1092 | ||
1093 | return 0; | |
1094 | } | |
1095 | ||
1096 | /* | |
1097 | * Builds the btree to index the map. | |
1098 | */ | |
26803b9f | 1099 | static int dm_table_build_index(struct dm_table *t) |
1da177e4 LT |
1100 | { |
1101 | int r = 0; | |
1102 | unsigned int leaf_nodes; | |
1103 | ||
1da177e4 LT |
1104 | /* how many indexes will the btree have ? */ |
1105 | leaf_nodes = dm_div_up(t->num_targets, KEYS_PER_NODE); | |
1106 | t->depth = 1 + int_log(leaf_nodes, CHILDREN_PER_NODE); | |
1107 | ||
1108 | /* leaf layer has already been set up */ | |
1109 | t->counts[t->depth - 1] = leaf_nodes; | |
1110 | t->index[t->depth - 1] = t->highs; | |
1111 | ||
1112 | if (t->depth >= 2) | |
1113 | r = setup_indexes(t); | |
1114 | ||
1115 | return r; | |
1116 | } | |
1117 | ||
25520d55 MP |
1118 | static bool integrity_profile_exists(struct gendisk *disk) |
1119 | { | |
1120 | return !!blk_get_integrity(disk); | |
1121 | } | |
1122 | ||
a63a5cf8 MS |
1123 | /* |
1124 | * Get a disk whose integrity profile reflects the table's profile. | |
a63a5cf8 MS |
1125 | * Returns NULL if integrity support was inconsistent or unavailable. |
1126 | */ | |
25520d55 | 1127 | static struct gendisk * dm_table_get_integrity_disk(struct dm_table *t) |
a63a5cf8 MS |
1128 | { |
1129 | struct list_head *devices = dm_table_get_devices(t); | |
1130 | struct dm_dev_internal *dd = NULL; | |
1131 | struct gendisk *prev_disk = NULL, *template_disk = NULL; | |
1132 | ||
1133 | list_for_each_entry(dd, devices, list) { | |
86f1152b | 1134 | template_disk = dd->dm_dev->bdev->bd_disk; |
25520d55 | 1135 | if (!integrity_profile_exists(template_disk)) |
a63a5cf8 | 1136 | goto no_integrity; |
a63a5cf8 MS |
1137 | else if (prev_disk && |
1138 | blk_integrity_compare(prev_disk, template_disk) < 0) | |
1139 | goto no_integrity; | |
1140 | prev_disk = template_disk; | |
1141 | } | |
1142 | ||
1143 | return template_disk; | |
1144 | ||
1145 | no_integrity: | |
1146 | if (prev_disk) | |
1147 | DMWARN("%s: integrity not set: %s and %s profile mismatch", | |
1148 | dm_device_name(t->md), | |
1149 | prev_disk->disk_name, | |
1150 | template_disk->disk_name); | |
1151 | return NULL; | |
1152 | } | |
1153 | ||
26803b9f | 1154 | /* |
25520d55 MP |
1155 | * Register the mapped device for blk_integrity support if the |
1156 | * underlying devices have an integrity profile. But all devices may | |
1157 | * not have matching profiles (checking all devices isn't reliable | |
a63a5cf8 | 1158 | * during table load because this table may use other DM device(s) which |
25520d55 MP |
1159 | * must be resumed before they will have an initialized integity |
1160 | * profile). Consequently, stacked DM devices force a 2 stage integrity | |
1161 | * profile validation: First pass during table load, final pass during | |
1162 | * resume. | |
26803b9f | 1163 | */ |
25520d55 | 1164 | static int dm_table_register_integrity(struct dm_table *t) |
26803b9f | 1165 | { |
25520d55 | 1166 | struct mapped_device *md = t->md; |
a63a5cf8 | 1167 | struct gendisk *template_disk = NULL; |
26803b9f | 1168 | |
25520d55 | 1169 | template_disk = dm_table_get_integrity_disk(t); |
a63a5cf8 MS |
1170 | if (!template_disk) |
1171 | return 0; | |
26803b9f | 1172 | |
25520d55 | 1173 | if (!integrity_profile_exists(dm_disk(md))) { |
e83068a5 | 1174 | t->integrity_supported = true; |
25520d55 MP |
1175 | /* |
1176 | * Register integrity profile during table load; we can do | |
1177 | * this because the final profile must match during resume. | |
1178 | */ | |
1179 | blk_integrity_register(dm_disk(md), | |
1180 | blk_get_integrity(template_disk)); | |
1181 | return 0; | |
a63a5cf8 MS |
1182 | } |
1183 | ||
1184 | /* | |
25520d55 | 1185 | * If DM device already has an initialized integrity |
a63a5cf8 MS |
1186 | * profile the new profile should not conflict. |
1187 | */ | |
25520d55 | 1188 | if (blk_integrity_compare(dm_disk(md), template_disk) < 0) { |
a63a5cf8 MS |
1189 | DMWARN("%s: conflict with existing integrity profile: " |
1190 | "%s profile mismatch", | |
1191 | dm_device_name(t->md), | |
1192 | template_disk->disk_name); | |
1193 | return 1; | |
1194 | } | |
1195 | ||
25520d55 | 1196 | /* Preserve existing integrity profile */ |
e83068a5 | 1197 | t->integrity_supported = true; |
26803b9f WD |
1198 | return 0; |
1199 | } | |
1200 | ||
1201 | /* | |
1202 | * Prepares the table for use by building the indices, | |
1203 | * setting the type, and allocating mempools. | |
1204 | */ | |
1205 | int dm_table_complete(struct dm_table *t) | |
1206 | { | |
1207 | int r; | |
1208 | ||
e83068a5 | 1209 | r = dm_table_determine_type(t); |
26803b9f | 1210 | if (r) { |
e83068a5 | 1211 | DMERR("unable to determine table type"); |
26803b9f WD |
1212 | return r; |
1213 | } | |
1214 | ||
1215 | r = dm_table_build_index(t); | |
1216 | if (r) { | |
1217 | DMERR("unable to build btrees"); | |
1218 | return r; | |
1219 | } | |
1220 | ||
25520d55 | 1221 | r = dm_table_register_integrity(t); |
26803b9f WD |
1222 | if (r) { |
1223 | DMERR("could not register integrity profile."); | |
1224 | return r; | |
1225 | } | |
1226 | ||
17e149b8 | 1227 | r = dm_table_alloc_md_mempools(t, t->md); |
26803b9f WD |
1228 | if (r) |
1229 | DMERR("unable to allocate mempools"); | |
1230 | ||
1231 | return r; | |
1232 | } | |
1233 | ||
48c9c27b | 1234 | static DEFINE_MUTEX(_event_lock); |
1da177e4 LT |
1235 | void dm_table_event_callback(struct dm_table *t, |
1236 | void (*fn)(void *), void *context) | |
1237 | { | |
48c9c27b | 1238 | mutex_lock(&_event_lock); |
1da177e4 LT |
1239 | t->event_fn = fn; |
1240 | t->event_context = context; | |
48c9c27b | 1241 | mutex_unlock(&_event_lock); |
1da177e4 LT |
1242 | } |
1243 | ||
1244 | void dm_table_event(struct dm_table *t) | |
1245 | { | |
1246 | /* | |
1247 | * You can no longer call dm_table_event() from interrupt | |
1248 | * context, use a bottom half instead. | |
1249 | */ | |
1250 | BUG_ON(in_interrupt()); | |
1251 | ||
48c9c27b | 1252 | mutex_lock(&_event_lock); |
1da177e4 LT |
1253 | if (t->event_fn) |
1254 | t->event_fn(t->event_context); | |
48c9c27b | 1255 | mutex_unlock(&_event_lock); |
1da177e4 | 1256 | } |
08649012 | 1257 | EXPORT_SYMBOL(dm_table_event); |
1da177e4 LT |
1258 | |
1259 | sector_t dm_table_get_size(struct dm_table *t) | |
1260 | { | |
1261 | return t->num_targets ? (t->highs[t->num_targets - 1] + 1) : 0; | |
1262 | } | |
08649012 | 1263 | EXPORT_SYMBOL(dm_table_get_size); |
1da177e4 LT |
1264 | |
1265 | struct dm_target *dm_table_get_target(struct dm_table *t, unsigned int index) | |
1266 | { | |
14353539 | 1267 | if (index >= t->num_targets) |
1da177e4 LT |
1268 | return NULL; |
1269 | ||
1270 | return t->targets + index; | |
1271 | } | |
1272 | ||
1273 | /* | |
1274 | * Search the btree for the correct target. | |
512875bd JN |
1275 | * |
1276 | * Caller should check returned pointer with dm_target_is_valid() | |
1277 | * to trap I/O beyond end of device. | |
1da177e4 LT |
1278 | */ |
1279 | struct dm_target *dm_table_find_target(struct dm_table *t, sector_t sector) | |
1280 | { | |
1281 | unsigned int l, n = 0, k = 0; | |
1282 | sector_t *node; | |
1283 | ||
1284 | for (l = 0; l < t->depth; l++) { | |
1285 | n = get_child(n, k); | |
1286 | node = get_node(t, l, n); | |
1287 | ||
1288 | for (k = 0; k < KEYS_PER_NODE; k++) | |
1289 | if (node[k] >= sector) | |
1290 | break; | |
1291 | } | |
1292 | ||
1293 | return &t->targets[(KEYS_PER_NODE * n) + k]; | |
1294 | } | |
1295 | ||
3ae70656 MS |
1296 | static int count_device(struct dm_target *ti, struct dm_dev *dev, |
1297 | sector_t start, sector_t len, void *data) | |
1298 | { | |
1299 | unsigned *num_devices = data; | |
1300 | ||
1301 | (*num_devices)++; | |
1302 | ||
1303 | return 0; | |
1304 | } | |
1305 | ||
1306 | /* | |
1307 | * Check whether a table has no data devices attached using each | |
1308 | * target's iterate_devices method. | |
1309 | * Returns false if the result is unknown because a target doesn't | |
1310 | * support iterate_devices. | |
1311 | */ | |
1312 | bool dm_table_has_no_data_devices(struct dm_table *table) | |
1313 | { | |
1314 | struct dm_target *uninitialized_var(ti); | |
1315 | unsigned i = 0, num_devices = 0; | |
1316 | ||
1317 | while (i < dm_table_get_num_targets(table)) { | |
1318 | ti = dm_table_get_target(table, i++); | |
1319 | ||
1320 | if (!ti->type->iterate_devices) | |
1321 | return false; | |
1322 | ||
1323 | ti->type->iterate_devices(ti, count_device, &num_devices); | |
1324 | if (num_devices) | |
1325 | return false; | |
1326 | } | |
1327 | ||
1328 | return true; | |
1329 | } | |
1330 | ||
754c5fc7 MS |
1331 | /* |
1332 | * Establish the new table's queue_limits and validate them. | |
1333 | */ | |
1334 | int dm_calculate_queue_limits(struct dm_table *table, | |
1335 | struct queue_limits *limits) | |
1336 | { | |
1337 | struct dm_target *uninitialized_var(ti); | |
1338 | struct queue_limits ti_limits; | |
1339 | unsigned i = 0; | |
1340 | ||
b1bd055d | 1341 | blk_set_stacking_limits(limits); |
754c5fc7 MS |
1342 | |
1343 | while (i < dm_table_get_num_targets(table)) { | |
b1bd055d | 1344 | blk_set_stacking_limits(&ti_limits); |
754c5fc7 MS |
1345 | |
1346 | ti = dm_table_get_target(table, i++); | |
1347 | ||
1348 | if (!ti->type->iterate_devices) | |
1349 | goto combine_limits; | |
1350 | ||
1351 | /* | |
1352 | * Combine queue limits of all the devices this target uses. | |
1353 | */ | |
1354 | ti->type->iterate_devices(ti, dm_set_device_limits, | |
1355 | &ti_limits); | |
1356 | ||
40bea431 MS |
1357 | /* Set I/O hints portion of queue limits */ |
1358 | if (ti->type->io_hints) | |
1359 | ti->type->io_hints(ti, &ti_limits); | |
1360 | ||
754c5fc7 MS |
1361 | /* |
1362 | * Check each device area is consistent with the target's | |
1363 | * overall queue limits. | |
1364 | */ | |
f6a1ed10 MP |
1365 | if (ti->type->iterate_devices(ti, device_area_is_invalid, |
1366 | &ti_limits)) | |
754c5fc7 MS |
1367 | return -EINVAL; |
1368 | ||
1369 | combine_limits: | |
1370 | /* | |
1371 | * Merge this target's queue limits into the overall limits | |
1372 | * for the table. | |
1373 | */ | |
1374 | if (blk_stack_limits(limits, &ti_limits, 0) < 0) | |
b27d7f16 | 1375 | DMWARN("%s: adding target device " |
754c5fc7 | 1376 | "(start sect %llu len %llu) " |
b27d7f16 | 1377 | "caused an alignment inconsistency", |
754c5fc7 MS |
1378 | dm_device_name(table->md), |
1379 | (unsigned long long) ti->begin, | |
1380 | (unsigned long long) ti->len); | |
1381 | } | |
1382 | ||
1383 | return validate_hardware_logical_block_alignment(table, limits); | |
1384 | } | |
1385 | ||
9c47008d | 1386 | /* |
25520d55 MP |
1387 | * Verify that all devices have an integrity profile that matches the |
1388 | * DM device's registered integrity profile. If the profiles don't | |
1389 | * match then unregister the DM device's integrity profile. | |
9c47008d | 1390 | */ |
25520d55 | 1391 | static void dm_table_verify_integrity(struct dm_table *t) |
9c47008d | 1392 | { |
a63a5cf8 | 1393 | struct gendisk *template_disk = NULL; |
9c47008d | 1394 | |
25520d55 MP |
1395 | if (t->integrity_supported) { |
1396 | /* | |
1397 | * Verify that the original integrity profile | |
1398 | * matches all the devices in this table. | |
1399 | */ | |
1400 | template_disk = dm_table_get_integrity_disk(t); | |
1401 | if (template_disk && | |
1402 | blk_integrity_compare(dm_disk(t->md), template_disk) >= 0) | |
1403 | return; | |
1404 | } | |
9c47008d | 1405 | |
25520d55 | 1406 | if (integrity_profile_exists(dm_disk(t->md))) { |
876fbba1 MS |
1407 | DMWARN("%s: unable to establish an integrity profile", |
1408 | dm_device_name(t->md)); | |
25520d55 MP |
1409 | blk_integrity_unregister(dm_disk(t->md)); |
1410 | } | |
9c47008d MP |
1411 | } |
1412 | ||
ed8b752b MS |
1413 | static int device_flush_capable(struct dm_target *ti, struct dm_dev *dev, |
1414 | sector_t start, sector_t len, void *data) | |
1415 | { | |
c888a8f9 | 1416 | unsigned long flush = (unsigned long) data; |
ed8b752b MS |
1417 | struct request_queue *q = bdev_get_queue(dev->bdev); |
1418 | ||
c888a8f9 | 1419 | return q && (q->queue_flags & flush); |
ed8b752b MS |
1420 | } |
1421 | ||
c888a8f9 | 1422 | static bool dm_table_supports_flush(struct dm_table *t, unsigned long flush) |
ed8b752b MS |
1423 | { |
1424 | struct dm_target *ti; | |
1425 | unsigned i = 0; | |
1426 | ||
1427 | /* | |
1428 | * Require at least one underlying device to support flushes. | |
1429 | * t->devices includes internal dm devices such as mirror logs | |
1430 | * so we need to use iterate_devices here, which targets | |
1431 | * supporting flushes must provide. | |
1432 | */ | |
1433 | while (i < dm_table_get_num_targets(t)) { | |
1434 | ti = dm_table_get_target(t, i++); | |
1435 | ||
55a62eef | 1436 | if (!ti->num_flush_bios) |
ed8b752b MS |
1437 | continue; |
1438 | ||
0e9c24ed | 1439 | if (ti->flush_supported) |
7f61f5a0 | 1440 | return true; |
0e9c24ed | 1441 | |
ed8b752b | 1442 | if (ti->type->iterate_devices && |
c888a8f9 | 1443 | ti->type->iterate_devices(ti, device_flush_capable, (void *) flush)) |
7f61f5a0 | 1444 | return true; |
ed8b752b MS |
1445 | } |
1446 | ||
7f61f5a0 | 1447 | return false; |
ed8b752b MS |
1448 | } |
1449 | ||
983c7db3 MB |
1450 | static bool dm_table_discard_zeroes_data(struct dm_table *t) |
1451 | { | |
1452 | struct dm_target *ti; | |
1453 | unsigned i = 0; | |
1454 | ||
1455 | /* Ensure that all targets supports discard_zeroes_data. */ | |
1456 | while (i < dm_table_get_num_targets(t)) { | |
1457 | ti = dm_table_get_target(t, i++); | |
1458 | ||
1459 | if (ti->discard_zeroes_data_unsupported) | |
7f61f5a0 | 1460 | return false; |
983c7db3 MB |
1461 | } |
1462 | ||
7f61f5a0 | 1463 | return true; |
983c7db3 MB |
1464 | } |
1465 | ||
4693c966 MSB |
1466 | static int device_is_nonrot(struct dm_target *ti, struct dm_dev *dev, |
1467 | sector_t start, sector_t len, void *data) | |
1468 | { | |
1469 | struct request_queue *q = bdev_get_queue(dev->bdev); | |
1470 | ||
1471 | return q && blk_queue_nonrot(q); | |
1472 | } | |
1473 | ||
c3c4555e MB |
1474 | static int device_is_not_random(struct dm_target *ti, struct dm_dev *dev, |
1475 | sector_t start, sector_t len, void *data) | |
1476 | { | |
1477 | struct request_queue *q = bdev_get_queue(dev->bdev); | |
1478 | ||
1479 | return q && !blk_queue_add_random(q); | |
1480 | } | |
1481 | ||
200612ec JM |
1482 | static int queue_supports_sg_merge(struct dm_target *ti, struct dm_dev *dev, |
1483 | sector_t start, sector_t len, void *data) | |
1484 | { | |
1485 | struct request_queue *q = bdev_get_queue(dev->bdev); | |
1486 | ||
1487 | return q && !test_bit(QUEUE_FLAG_NO_SG_MERGE, &q->queue_flags); | |
1488 | } | |
1489 | ||
c3c4555e MB |
1490 | static bool dm_table_all_devices_attribute(struct dm_table *t, |
1491 | iterate_devices_callout_fn func) | |
4693c966 MSB |
1492 | { |
1493 | struct dm_target *ti; | |
1494 | unsigned i = 0; | |
1495 | ||
4693c966 MSB |
1496 | while (i < dm_table_get_num_targets(t)) { |
1497 | ti = dm_table_get_target(t, i++); | |
1498 | ||
1499 | if (!ti->type->iterate_devices || | |
c3c4555e | 1500 | !ti->type->iterate_devices(ti, func, NULL)) |
7f61f5a0 | 1501 | return false; |
4693c966 MSB |
1502 | } |
1503 | ||
7f61f5a0 | 1504 | return true; |
4693c966 MSB |
1505 | } |
1506 | ||
d54eaa5a MS |
1507 | static int device_not_write_same_capable(struct dm_target *ti, struct dm_dev *dev, |
1508 | sector_t start, sector_t len, void *data) | |
1509 | { | |
1510 | struct request_queue *q = bdev_get_queue(dev->bdev); | |
1511 | ||
1512 | return q && !q->limits.max_write_same_sectors; | |
1513 | } | |
1514 | ||
1515 | static bool dm_table_supports_write_same(struct dm_table *t) | |
1516 | { | |
1517 | struct dm_target *ti; | |
1518 | unsigned i = 0; | |
1519 | ||
1520 | while (i < dm_table_get_num_targets(t)) { | |
1521 | ti = dm_table_get_target(t, i++); | |
1522 | ||
55a62eef | 1523 | if (!ti->num_write_same_bios) |
d54eaa5a MS |
1524 | return false; |
1525 | ||
1526 | if (!ti->type->iterate_devices || | |
dc019b21 | 1527 | ti->type->iterate_devices(ti, device_not_write_same_capable, NULL)) |
d54eaa5a MS |
1528 | return false; |
1529 | } | |
1530 | ||
1531 | return true; | |
1532 | } | |
1533 | ||
a7ffb6a5 MP |
1534 | static int device_discard_capable(struct dm_target *ti, struct dm_dev *dev, |
1535 | sector_t start, sector_t len, void *data) | |
1536 | { | |
1537 | struct request_queue *q = bdev_get_queue(dev->bdev); | |
1538 | ||
1539 | return q && blk_queue_discard(q); | |
1540 | } | |
1541 | ||
1542 | static bool dm_table_supports_discards(struct dm_table *t) | |
1543 | { | |
1544 | struct dm_target *ti; | |
1545 | unsigned i = 0; | |
1546 | ||
1547 | /* | |
1548 | * Unless any target used by the table set discards_supported, | |
1549 | * require at least one underlying device to support discards. | |
1550 | * t->devices includes internal dm devices such as mirror logs | |
1551 | * so we need to use iterate_devices here, which targets | |
1552 | * supporting discard selectively must provide. | |
1553 | */ | |
1554 | while (i < dm_table_get_num_targets(t)) { | |
1555 | ti = dm_table_get_target(t, i++); | |
1556 | ||
1557 | if (!ti->num_discard_bios) | |
1558 | continue; | |
1559 | ||
1560 | if (ti->discards_supported) | |
7f61f5a0 | 1561 | return true; |
a7ffb6a5 MP |
1562 | |
1563 | if (ti->type->iterate_devices && | |
1564 | ti->type->iterate_devices(ti, device_discard_capable, NULL)) | |
7f61f5a0 | 1565 | return true; |
a7ffb6a5 MP |
1566 | } |
1567 | ||
7f61f5a0 | 1568 | return false; |
a7ffb6a5 MP |
1569 | } |
1570 | ||
754c5fc7 MS |
1571 | void dm_table_set_restrictions(struct dm_table *t, struct request_queue *q, |
1572 | struct queue_limits *limits) | |
1da177e4 | 1573 | { |
519a7e16 | 1574 | bool wc = false, fua = false; |
ed8b752b | 1575 | |
1da177e4 | 1576 | /* |
1197764e | 1577 | * Copy table's limits to the DM device's request_queue |
1da177e4 | 1578 | */ |
754c5fc7 | 1579 | q->limits = *limits; |
c9a3f6d6 | 1580 | |
5ae89a87 MS |
1581 | if (!dm_table_supports_discards(t)) |
1582 | queue_flag_clear_unlocked(QUEUE_FLAG_DISCARD, q); | |
1583 | else | |
1584 | queue_flag_set_unlocked(QUEUE_FLAG_DISCARD, q); | |
1585 | ||
c888a8f9 | 1586 | if (dm_table_supports_flush(t, (1UL << QUEUE_FLAG_WC))) { |
519a7e16 | 1587 | wc = true; |
c888a8f9 | 1588 | if (dm_table_supports_flush(t, (1UL << QUEUE_FLAG_FUA))) |
519a7e16 | 1589 | fua = true; |
ed8b752b | 1590 | } |
519a7e16 | 1591 | blk_queue_write_cache(q, wc, fua); |
ed8b752b | 1592 | |
983c7db3 MB |
1593 | if (!dm_table_discard_zeroes_data(t)) |
1594 | q->limits.discard_zeroes_data = 0; | |
1595 | ||
c3c4555e MB |
1596 | /* Ensure that all underlying devices are non-rotational. */ |
1597 | if (dm_table_all_devices_attribute(t, device_is_nonrot)) | |
4693c966 MSB |
1598 | queue_flag_set_unlocked(QUEUE_FLAG_NONROT, q); |
1599 | else | |
1600 | queue_flag_clear_unlocked(QUEUE_FLAG_NONROT, q); | |
1601 | ||
d54eaa5a MS |
1602 | if (!dm_table_supports_write_same(t)) |
1603 | q->limits.max_write_same_sectors = 0; | |
c1a94672 | 1604 | |
200612ec JM |
1605 | if (dm_table_all_devices_attribute(t, queue_supports_sg_merge)) |
1606 | queue_flag_clear_unlocked(QUEUE_FLAG_NO_SG_MERGE, q); | |
1607 | else | |
1608 | queue_flag_set_unlocked(QUEUE_FLAG_NO_SG_MERGE, q); | |
1609 | ||
25520d55 | 1610 | dm_table_verify_integrity(t); |
e6ee8c0b | 1611 | |
c3c4555e MB |
1612 | /* |
1613 | * Determine whether or not this queue's I/O timings contribute | |
1614 | * to the entropy pool, Only request-based targets use this. | |
1615 | * Clear QUEUE_FLAG_ADD_RANDOM if any underlying device does not | |
1616 | * have it set. | |
1617 | */ | |
1618 | if (blk_queue_add_random(q) && dm_table_all_devices_attribute(t, device_is_not_random)) | |
1619 | queue_flag_clear_unlocked(QUEUE_FLAG_ADD_RANDOM, q); | |
1620 | ||
e6ee8c0b KU |
1621 | /* |
1622 | * QUEUE_FLAG_STACKABLE must be set after all queue settings are | |
1623 | * visible to other CPUs because, once the flag is set, incoming bios | |
1624 | * are processed by request-based dm, which refers to the queue | |
1625 | * settings. | |
1626 | * Until the flag set, bios are passed to bio-based dm and queued to | |
1627 | * md->deferred where queue settings are not needed yet. | |
1628 | * Those bios are passed to request-based dm at the resume time. | |
1629 | */ | |
1630 | smp_mb(); | |
1631 | if (dm_table_request_based(t)) | |
1632 | queue_flag_set_unlocked(QUEUE_FLAG_STACKABLE, q); | |
1da177e4 LT |
1633 | } |
1634 | ||
1635 | unsigned int dm_table_get_num_targets(struct dm_table *t) | |
1636 | { | |
1637 | return t->num_targets; | |
1638 | } | |
1639 | ||
1640 | struct list_head *dm_table_get_devices(struct dm_table *t) | |
1641 | { | |
1642 | return &t->devices; | |
1643 | } | |
1644 | ||
aeb5d727 | 1645 | fmode_t dm_table_get_mode(struct dm_table *t) |
1da177e4 LT |
1646 | { |
1647 | return t->mode; | |
1648 | } | |
08649012 | 1649 | EXPORT_SYMBOL(dm_table_get_mode); |
1da177e4 | 1650 | |
d67ee213 MS |
1651 | enum suspend_mode { |
1652 | PRESUSPEND, | |
1653 | PRESUSPEND_UNDO, | |
1654 | POSTSUSPEND, | |
1655 | }; | |
1656 | ||
1657 | static void suspend_targets(struct dm_table *t, enum suspend_mode mode) | |
1da177e4 LT |
1658 | { |
1659 | int i = t->num_targets; | |
1660 | struct dm_target *ti = t->targets; | |
1661 | ||
1662 | while (i--) { | |
d67ee213 MS |
1663 | switch (mode) { |
1664 | case PRESUSPEND: | |
1665 | if (ti->type->presuspend) | |
1666 | ti->type->presuspend(ti); | |
1667 | break; | |
1668 | case PRESUSPEND_UNDO: | |
1669 | if (ti->type->presuspend_undo) | |
1670 | ti->type->presuspend_undo(ti); | |
1671 | break; | |
1672 | case POSTSUSPEND: | |
1da177e4 LT |
1673 | if (ti->type->postsuspend) |
1674 | ti->type->postsuspend(ti); | |
d67ee213 MS |
1675 | break; |
1676 | } | |
1da177e4 LT |
1677 | ti++; |
1678 | } | |
1679 | } | |
1680 | ||
1681 | void dm_table_presuspend_targets(struct dm_table *t) | |
1682 | { | |
cf222b37 AK |
1683 | if (!t) |
1684 | return; | |
1685 | ||
d67ee213 MS |
1686 | suspend_targets(t, PRESUSPEND); |
1687 | } | |
1688 | ||
1689 | void dm_table_presuspend_undo_targets(struct dm_table *t) | |
1690 | { | |
1691 | if (!t) | |
1692 | return; | |
1693 | ||
1694 | suspend_targets(t, PRESUSPEND_UNDO); | |
1da177e4 LT |
1695 | } |
1696 | ||
1697 | void dm_table_postsuspend_targets(struct dm_table *t) | |
1698 | { | |
cf222b37 AK |
1699 | if (!t) |
1700 | return; | |
1701 | ||
d67ee213 | 1702 | suspend_targets(t, POSTSUSPEND); |
1da177e4 LT |
1703 | } |
1704 | ||
8757b776 | 1705 | int dm_table_resume_targets(struct dm_table *t) |
1da177e4 | 1706 | { |
8757b776 MB |
1707 | int i, r = 0; |
1708 | ||
1709 | for (i = 0; i < t->num_targets; i++) { | |
1710 | struct dm_target *ti = t->targets + i; | |
1711 | ||
1712 | if (!ti->type->preresume) | |
1713 | continue; | |
1714 | ||
1715 | r = ti->type->preresume(ti); | |
7833b08e MS |
1716 | if (r) { |
1717 | DMERR("%s: %s: preresume failed, error = %d", | |
1718 | dm_device_name(t->md), ti->type->name, r); | |
8757b776 | 1719 | return r; |
7833b08e | 1720 | } |
8757b776 | 1721 | } |
1da177e4 LT |
1722 | |
1723 | for (i = 0; i < t->num_targets; i++) { | |
1724 | struct dm_target *ti = t->targets + i; | |
1725 | ||
1726 | if (ti->type->resume) | |
1727 | ti->type->resume(ti); | |
1728 | } | |
8757b776 MB |
1729 | |
1730 | return 0; | |
1da177e4 LT |
1731 | } |
1732 | ||
9d357b07 N |
1733 | void dm_table_add_target_callbacks(struct dm_table *t, struct dm_target_callbacks *cb) |
1734 | { | |
1735 | list_add(&cb->list, &t->target_callbacks); | |
1736 | } | |
1737 | EXPORT_SYMBOL_GPL(dm_table_add_target_callbacks); | |
1738 | ||
1da177e4 LT |
1739 | int dm_table_any_congested(struct dm_table *t, int bdi_bits) |
1740 | { | |
82b1519b | 1741 | struct dm_dev_internal *dd; |
afb24528 | 1742 | struct list_head *devices = dm_table_get_devices(t); |
9d357b07 | 1743 | struct dm_target_callbacks *cb; |
1da177e4 LT |
1744 | int r = 0; |
1745 | ||
afb24528 | 1746 | list_for_each_entry(dd, devices, list) { |
86f1152b | 1747 | struct request_queue *q = bdev_get_queue(dd->dm_dev->bdev); |
0c2322e4 AK |
1748 | char b[BDEVNAME_SIZE]; |
1749 | ||
1750 | if (likely(q)) | |
1751 | r |= bdi_congested(&q->backing_dev_info, bdi_bits); | |
1752 | else | |
1753 | DMWARN_LIMIT("%s: any_congested: nonexistent device %s", | |
1754 | dm_device_name(t->md), | |
86f1152b | 1755 | bdevname(dd->dm_dev->bdev, b)); |
1da177e4 LT |
1756 | } |
1757 | ||
9d357b07 N |
1758 | list_for_each_entry(cb, &t->target_callbacks, list) |
1759 | if (cb->congested_fn) | |
1760 | r |= cb->congested_fn(cb, bdi_bits); | |
1761 | ||
1da177e4 LT |
1762 | return r; |
1763 | } | |
1764 | ||
1134e5ae MA |
1765 | struct mapped_device *dm_table_get_md(struct dm_table *t) |
1766 | { | |
1134e5ae MA |
1767 | return t->md; |
1768 | } | |
08649012 | 1769 | EXPORT_SYMBOL(dm_table_get_md); |
1134e5ae | 1770 | |
9974fa2c MS |
1771 | void dm_table_run_md_queue_async(struct dm_table *t) |
1772 | { | |
1773 | struct mapped_device *md; | |
1774 | struct request_queue *queue; | |
1775 | unsigned long flags; | |
1776 | ||
1777 | if (!dm_table_request_based(t)) | |
1778 | return; | |
1779 | ||
1780 | md = dm_table_get_md(t); | |
1781 | queue = dm_get_md_queue(md); | |
1782 | if (queue) { | |
bfebd1cd MS |
1783 | if (queue->mq_ops) |
1784 | blk_mq_run_hw_queues(queue, true); | |
1785 | else { | |
1786 | spin_lock_irqsave(queue->queue_lock, flags); | |
1787 | blk_run_queue_async(queue); | |
1788 | spin_unlock_irqrestore(queue->queue_lock, flags); | |
1789 | } | |
9974fa2c MS |
1790 | } |
1791 | } | |
1792 | EXPORT_SYMBOL(dm_table_run_md_queue_async); | |
1793 |