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