2 * Copyright (C) 2001 Sistina Software (UK) Limited.
3 * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved.
5 * This file is released under the GPL.
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>
15 #include <linux/string.h>
16 #include <linux/slab.h>
17 #include <linux/interrupt.h>
18 #include <linux/mutex.h>
19 #include <linux/delay.h>
20 #include <linux/atomic.h>
21 #include <linux/blk-mq.h>
22 #include <linux/mount.h>
23 #include <linux/dax.h>
25 #define DM_MSG_PREFIX "table"
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)
33 struct mapped_device *md;
34 enum dm_queue_mode type;
38 unsigned int counts[MAX_DEPTH]; /* in nodes */
39 sector_t *index[MAX_DEPTH];
41 unsigned int num_targets;
42 unsigned int num_allocated;
44 struct dm_target *targets;
46 struct target_type *immutable_target_type;
48 bool integrity_supported:1;
50 unsigned integrity_added:1;
53 * Indicates the rw permissions for the new logical
54 * device. This should be a combination of FMODE_READ
59 /* a list of devices used by this table */
60 struct list_head devices;
62 /* events get handed up using this callback */
63 void (*event_fn)(void *);
66 struct dm_md_mempools *mempools;
70 * Similar to ceiling(log_size(n))
72 static unsigned int int_log(unsigned int n, unsigned int base)
77 n = dm_div_up(n, base);
85 * Calculate the index of the child node of the n'th node k'th key.
87 static inline unsigned int get_child(unsigned int n, unsigned int k)
89 return (n * CHILDREN_PER_NODE) + k;
93 * Return the n'th node of level l from table t.
95 static inline sector_t *get_node(struct dm_table *t,
96 unsigned int l, unsigned int n)
98 return t->index[l] + (n * KEYS_PER_NODE);
102 * Return the highest key that you could lookup from the n'th
103 * node on level l of the btree.
105 static sector_t high(struct dm_table *t, unsigned int l, unsigned int n)
107 for (; l < t->depth - 1; l++)
108 n = get_child(n, CHILDREN_PER_NODE - 1);
110 if (n >= t->counts[l])
111 return (sector_t) - 1;
113 return get_node(t, l, n)[KEYS_PER_NODE - 1];
117 * Fills in a level of the btree based on the highs of the level
120 static int setup_btree_index(unsigned int l, struct dm_table *t)
125 for (n = 0U; n < t->counts[l]; n++) {
126 node = get_node(t, l, n);
128 for (k = 0U; k < KEYS_PER_NODE; k++)
129 node[k] = high(t, l + 1, get_child(n, k));
135 void *dm_vcalloc(unsigned long nmemb, unsigned long elem_size)
141 * Check that we're not going to overflow.
143 if (nmemb > (ULONG_MAX / elem_size))
146 size = nmemb * elem_size;
147 addr = vzalloc(size);
151 EXPORT_SYMBOL(dm_vcalloc);
154 * highs, and targets are managed as dynamic arrays during a
157 static int alloc_targets(struct dm_table *t, unsigned int num)
160 struct dm_target *n_targets;
163 * Allocate both the target array and offset array at once.
165 n_highs = (sector_t *) dm_vcalloc(num, sizeof(struct dm_target) +
170 n_targets = (struct dm_target *) (n_highs + num);
172 memset(n_highs, -1, sizeof(*n_highs) * num);
175 t->num_allocated = num;
177 t->targets = n_targets;
182 int dm_table_create(struct dm_table **result, fmode_t mode,
183 unsigned num_targets, struct mapped_device *md)
185 struct dm_table *t = kzalloc(sizeof(*t), GFP_KERNEL);
190 INIT_LIST_HEAD(&t->devices);
193 num_targets = KEYS_PER_NODE;
195 num_targets = dm_round_up(num_targets, KEYS_PER_NODE);
202 if (alloc_targets(t, num_targets)) {
207 t->type = DM_TYPE_NONE;
214 static void free_devices(struct list_head *devices, struct mapped_device *md)
216 struct list_head *tmp, *next;
218 list_for_each_safe(tmp, next, devices) {
219 struct dm_dev_internal *dd =
220 list_entry(tmp, struct dm_dev_internal, list);
221 DMWARN("%s: dm_table_destroy: dm_put_device call missing for %s",
222 dm_device_name(md), dd->dm_dev->name);
223 dm_put_table_device(md, dd->dm_dev);
228 void dm_table_destroy(struct dm_table *t)
235 /* free the indexes */
237 vfree(t->index[t->depth - 2]);
239 /* free the targets */
240 for (i = 0; i < t->num_targets; i++) {
241 struct dm_target *tgt = t->targets + i;
246 dm_put_target_type(tgt->type);
251 /* free the device list */
252 free_devices(&t->devices, t->md);
254 dm_free_md_mempools(t->mempools);
260 * See if we've already got a device in the list.
262 static struct dm_dev_internal *find_device(struct list_head *l, dev_t dev)
264 struct dm_dev_internal *dd;
266 list_for_each_entry (dd, l, list)
267 if (dd->dm_dev->bdev->bd_dev == dev)
274 * If possible, this checks an area of a destination device is invalid.
276 static int device_area_is_invalid(struct dm_target *ti, struct dm_dev *dev,
277 sector_t start, sector_t len, void *data)
279 struct queue_limits *limits = data;
280 struct block_device *bdev = dev->bdev;
282 i_size_read(bdev->bd_inode) >> SECTOR_SHIFT;
283 unsigned short logical_block_size_sectors =
284 limits->logical_block_size >> SECTOR_SHIFT;
285 char b[BDEVNAME_SIZE];
290 if ((start >= dev_size) || (start + len > dev_size)) {
291 DMWARN("%s: %s too small for target: "
292 "start=%llu, len=%llu, dev_size=%llu",
293 dm_device_name(ti->table->md), bdevname(bdev, b),
294 (unsigned long long)start,
295 (unsigned long long)len,
296 (unsigned long long)dev_size);
301 * If the target is mapped to zoned block device(s), check
302 * that the zones are not partially mapped.
304 if (bdev_zoned_model(bdev) != BLK_ZONED_NONE) {
305 unsigned int zone_sectors = bdev_zone_sectors(bdev);
307 if (start & (zone_sectors - 1)) {
308 DMWARN("%s: start=%llu not aligned to h/w zone size %u of %s",
309 dm_device_name(ti->table->md),
310 (unsigned long long)start,
311 zone_sectors, bdevname(bdev, b));
316 * Note: The last zone of a zoned block device may be smaller
317 * than other zones. So for a target mapping the end of a
318 * zoned block device with such a zone, len would not be zone
319 * aligned. We do not allow such last smaller zone to be part
320 * of the mapping here to ensure that mappings with multiple
321 * devices do not end up with a smaller zone in the middle of
324 if (len & (zone_sectors - 1)) {
325 DMWARN("%s: len=%llu not aligned to h/w zone size %u of %s",
326 dm_device_name(ti->table->md),
327 (unsigned long long)len,
328 zone_sectors, bdevname(bdev, b));
333 if (logical_block_size_sectors <= 1)
336 if (start & (logical_block_size_sectors - 1)) {
337 DMWARN("%s: start=%llu not aligned to h/w "
338 "logical block size %u of %s",
339 dm_device_name(ti->table->md),
340 (unsigned long long)start,
341 limits->logical_block_size, bdevname(bdev, b));
345 if (len & (logical_block_size_sectors - 1)) {
346 DMWARN("%s: len=%llu not aligned to h/w "
347 "logical block size %u of %s",
348 dm_device_name(ti->table->md),
349 (unsigned long long)len,
350 limits->logical_block_size, bdevname(bdev, b));
358 * This upgrades the mode on an already open dm_dev, being
359 * careful to leave things as they were if we fail to reopen the
360 * device and not to touch the existing bdev field in case
361 * it is accessed concurrently.
363 static int upgrade_mode(struct dm_dev_internal *dd, fmode_t new_mode,
364 struct mapped_device *md)
367 struct dm_dev *old_dev, *new_dev;
369 old_dev = dd->dm_dev;
371 r = dm_get_table_device(md, dd->dm_dev->bdev->bd_dev,
372 dd->dm_dev->mode | new_mode, &new_dev);
376 dd->dm_dev = new_dev;
377 dm_put_table_device(md, old_dev);
383 * Convert the path to a device
385 dev_t dm_get_dev_t(const char *path)
388 struct block_device *bdev;
390 bdev = lookup_bdev(path);
392 dev = name_to_dev_t(path);
400 EXPORT_SYMBOL_GPL(dm_get_dev_t);
403 * Add a device to the list, or just increment the usage count if
404 * it's already present.
406 int dm_get_device(struct dm_target *ti, const char *path, fmode_t mode,
407 struct dm_dev **result)
411 struct dm_dev_internal *dd;
412 struct dm_table *t = ti->table;
416 dev = dm_get_dev_t(path);
420 dd = find_device(&t->devices, dev);
422 dd = kmalloc(sizeof(*dd), GFP_KERNEL);
426 if ((r = dm_get_table_device(t->md, dev, mode, &dd->dm_dev))) {
431 refcount_set(&dd->count, 1);
432 list_add(&dd->list, &t->devices);
435 } else if (dd->dm_dev->mode != (mode | dd->dm_dev->mode)) {
436 r = upgrade_mode(dd, mode, t->md);
440 refcount_inc(&dd->count);
442 *result = dd->dm_dev;
445 EXPORT_SYMBOL(dm_get_device);
447 static int dm_set_device_limits(struct dm_target *ti, struct dm_dev *dev,
448 sector_t start, sector_t len, void *data)
450 struct queue_limits *limits = data;
451 struct block_device *bdev = dev->bdev;
452 struct request_queue *q = bdev_get_queue(bdev);
453 char b[BDEVNAME_SIZE];
456 DMWARN("%s: Cannot set limits for nonexistent device %s",
457 dm_device_name(ti->table->md), bdevname(bdev, b));
461 if (blk_stack_limits(limits, &q->limits,
462 get_start_sect(bdev) + start) < 0)
463 DMWARN("%s: adding target device %s caused an alignment inconsistency: "
464 "physical_block_size=%u, logical_block_size=%u, "
465 "alignment_offset=%u, start=%llu",
466 dm_device_name(ti->table->md), bdevname(bdev, b),
467 q->limits.physical_block_size,
468 q->limits.logical_block_size,
469 q->limits.alignment_offset,
470 (unsigned long long) start << SECTOR_SHIFT);
475 * Decrement a device's use count and remove it if necessary.
477 void dm_put_device(struct dm_target *ti, struct dm_dev *d)
480 struct list_head *devices = &ti->table->devices;
481 struct dm_dev_internal *dd;
483 list_for_each_entry(dd, devices, list) {
484 if (dd->dm_dev == d) {
490 DMWARN("%s: device %s not in table devices list",
491 dm_device_name(ti->table->md), d->name);
494 if (refcount_dec_and_test(&dd->count)) {
495 dm_put_table_device(ti->table->md, d);
500 EXPORT_SYMBOL(dm_put_device);
503 * Checks to see if the target joins onto the end of the table.
505 static int adjoin(struct dm_table *table, struct dm_target *ti)
507 struct dm_target *prev;
509 if (!table->num_targets)
512 prev = &table->targets[table->num_targets - 1];
513 return (ti->begin == (prev->begin + prev->len));
517 * Used to dynamically allocate the arg array.
519 * We do first allocation with GFP_NOIO because dm-mpath and dm-thin must
520 * process messages even if some device is suspended. These messages have a
521 * small fixed number of arguments.
523 * On the other hand, dm-switch needs to process bulk data using messages and
524 * excessive use of GFP_NOIO could cause trouble.
526 static char **realloc_argv(unsigned *size, char **old_argv)
533 new_size = *size * 2;
539 argv = kmalloc_array(new_size, sizeof(*argv), gfp);
540 if (argv && old_argv) {
541 memcpy(argv, old_argv, *size * sizeof(*argv));
550 * Destructively splits up the argument list to pass to ctr.
552 int dm_split_args(int *argc, char ***argvp, char *input)
554 char *start, *end = input, *out, **argv = NULL;
555 unsigned array_size = 0;
564 argv = realloc_argv(&array_size, argv);
569 /* Skip whitespace */
570 start = skip_spaces(end);
573 break; /* success, we hit the end */
575 /* 'out' is used to remove any back-quotes */
578 /* Everything apart from '\0' can be quoted */
579 if (*end == '\\' && *(end + 1)) {
586 break; /* end of token */
591 /* have we already filled the array ? */
592 if ((*argc + 1) > array_size) {
593 argv = realloc_argv(&array_size, argv);
598 /* we know this is whitespace */
602 /* terminate the string and put it in the array */
613 * Impose necessary and sufficient conditions on a devices's table such
614 * that any incoming bio which respects its logical_block_size can be
615 * processed successfully. If it falls across the boundary between
616 * two or more targets, the size of each piece it gets split into must
617 * be compatible with the logical_block_size of the target processing it.
619 static int validate_hardware_logical_block_alignment(struct dm_table *table,
620 struct queue_limits *limits)
623 * This function uses arithmetic modulo the logical_block_size
624 * (in units of 512-byte sectors).
626 unsigned short device_logical_block_size_sects =
627 limits->logical_block_size >> SECTOR_SHIFT;
630 * Offset of the start of the next table entry, mod logical_block_size.
632 unsigned short next_target_start = 0;
635 * Given an aligned bio that extends beyond the end of a
636 * target, how many sectors must the next target handle?
638 unsigned short remaining = 0;
640 struct dm_target *ti;
641 struct queue_limits ti_limits;
645 * Check each entry in the table in turn.
647 for (i = 0; i < dm_table_get_num_targets(table); i++) {
648 ti = dm_table_get_target(table, i);
650 blk_set_stacking_limits(&ti_limits);
652 /* combine all target devices' limits */
653 if (ti->type->iterate_devices)
654 ti->type->iterate_devices(ti, dm_set_device_limits,
658 * If the remaining sectors fall entirely within this
659 * table entry are they compatible with its logical_block_size?
661 if (remaining < ti->len &&
662 remaining & ((ti_limits.logical_block_size >>
667 (unsigned short) ((next_target_start + ti->len) &
668 (device_logical_block_size_sects - 1));
669 remaining = next_target_start ?
670 device_logical_block_size_sects - next_target_start : 0;
674 DMWARN("%s: table line %u (start sect %llu len %llu) "
675 "not aligned to h/w logical block size %u",
676 dm_device_name(table->md), i,
677 (unsigned long long) ti->begin,
678 (unsigned long long) ti->len,
679 limits->logical_block_size);
686 int dm_table_add_target(struct dm_table *t, const char *type,
687 sector_t start, sector_t len, char *params)
689 int r = -EINVAL, argc;
691 struct dm_target *tgt;
694 DMERR("%s: target type %s must appear alone in table",
695 dm_device_name(t->md), t->targets->type->name);
699 BUG_ON(t->num_targets >= t->num_allocated);
701 tgt = t->targets + t->num_targets;
702 memset(tgt, 0, sizeof(*tgt));
705 DMERR("%s: zero-length target", dm_device_name(t->md));
709 tgt->type = dm_get_target_type(type);
711 DMERR("%s: %s: unknown target type", dm_device_name(t->md), type);
715 if (dm_target_needs_singleton(tgt->type)) {
716 if (t->num_targets) {
717 tgt->error = "singleton target type must appear alone in table";
723 if (dm_target_always_writeable(tgt->type) && !(t->mode & FMODE_WRITE)) {
724 tgt->error = "target type may not be included in a read-only table";
728 if (t->immutable_target_type) {
729 if (t->immutable_target_type != tgt->type) {
730 tgt->error = "immutable target type cannot be mixed with other target types";
733 } else if (dm_target_is_immutable(tgt->type)) {
734 if (t->num_targets) {
735 tgt->error = "immutable target type cannot be mixed with other target types";
738 t->immutable_target_type = tgt->type;
741 if (dm_target_has_integrity(tgt->type))
742 t->integrity_added = 1;
747 tgt->error = "Unknown error";
750 * Does this target adjoin the previous one ?
752 if (!adjoin(t, tgt)) {
753 tgt->error = "Gap in table";
757 r = dm_split_args(&argc, &argv, params);
759 tgt->error = "couldn't split parameters (insufficient memory)";
763 r = tgt->type->ctr(tgt, argc, argv);
768 t->highs[t->num_targets++] = tgt->begin + tgt->len - 1;
770 if (!tgt->num_discard_bios && tgt->discards_supported)
771 DMWARN("%s: %s: ignoring discards_supported because num_discard_bios is zero.",
772 dm_device_name(t->md), type);
777 DMERR("%s: %s: %s", dm_device_name(t->md), type, tgt->error);
778 dm_put_target_type(tgt->type);
783 * Target argument parsing helpers.
785 static int validate_next_arg(const struct dm_arg *arg,
786 struct dm_arg_set *arg_set,
787 unsigned *value, char **error, unsigned grouped)
789 const char *arg_str = dm_shift_arg(arg_set);
793 (sscanf(arg_str, "%u%c", value, &dummy) != 1) ||
794 (*value < arg->min) ||
795 (*value > arg->max) ||
796 (grouped && arg_set->argc < *value)) {
804 int dm_read_arg(const struct dm_arg *arg, struct dm_arg_set *arg_set,
805 unsigned *value, char **error)
807 return validate_next_arg(arg, arg_set, value, error, 0);
809 EXPORT_SYMBOL(dm_read_arg);
811 int dm_read_arg_group(const struct dm_arg *arg, struct dm_arg_set *arg_set,
812 unsigned *value, char **error)
814 return validate_next_arg(arg, arg_set, value, error, 1);
816 EXPORT_SYMBOL(dm_read_arg_group);
818 const char *dm_shift_arg(struct dm_arg_set *as)
831 EXPORT_SYMBOL(dm_shift_arg);
833 void dm_consume_args(struct dm_arg_set *as, unsigned num_args)
835 BUG_ON(as->argc < num_args);
836 as->argc -= num_args;
837 as->argv += num_args;
839 EXPORT_SYMBOL(dm_consume_args);
841 static bool __table_type_bio_based(enum dm_queue_mode table_type)
843 return (table_type == DM_TYPE_BIO_BASED ||
844 table_type == DM_TYPE_DAX_BIO_BASED ||
845 table_type == DM_TYPE_NVME_BIO_BASED);
848 static bool __table_type_request_based(enum dm_queue_mode table_type)
850 return table_type == DM_TYPE_REQUEST_BASED;
853 void dm_table_set_type(struct dm_table *t, enum dm_queue_mode type)
857 EXPORT_SYMBOL_GPL(dm_table_set_type);
859 /* validate the dax capability of the target device span */
860 int device_supports_dax(struct dm_target *ti, struct dm_dev *dev,
861 sector_t start, sector_t len, void *data)
863 int blocksize = *(int *) data, id;
866 id = dax_read_lock();
867 rc = dax_supported(dev->dax_dev, dev->bdev, blocksize, start, len);
873 /* Check devices support synchronous DAX */
874 static int device_dax_synchronous(struct dm_target *ti, struct dm_dev *dev,
875 sector_t start, sector_t len, void *data)
877 return dev->dax_dev && dax_synchronous(dev->dax_dev);
880 bool dm_table_supports_dax(struct dm_table *t,
881 iterate_devices_callout_fn iterate_fn, int *blocksize)
883 struct dm_target *ti;
886 /* Ensure that all targets support DAX. */
887 for (i = 0; i < dm_table_get_num_targets(t); i++) {
888 ti = dm_table_get_target(t, i);
890 if (!ti->type->direct_access)
893 if (!ti->type->iterate_devices ||
894 !ti->type->iterate_devices(ti, iterate_fn, blocksize))
901 static bool dm_table_does_not_support_partial_completion(struct dm_table *t);
903 static int device_is_rq_stackable(struct dm_target *ti, struct dm_dev *dev,
904 sector_t start, sector_t len, void *data)
906 struct block_device *bdev = dev->bdev;
907 struct request_queue *q = bdev_get_queue(bdev);
909 /* request-based cannot stack on partitions! */
910 if (bdev != bdev->bd_contains)
913 return queue_is_mq(q);
916 static int dm_table_determine_type(struct dm_table *t)
919 unsigned bio_based = 0, request_based = 0, hybrid = 0;
920 struct dm_target *tgt;
921 struct list_head *devices = dm_table_get_devices(t);
922 enum dm_queue_mode live_md_type = dm_get_md_type(t->md);
923 int page_size = PAGE_SIZE;
925 if (t->type != DM_TYPE_NONE) {
926 /* target already set the table's type */
927 if (t->type == DM_TYPE_BIO_BASED) {
928 /* possibly upgrade to a variant of bio-based */
929 goto verify_bio_based;
931 BUG_ON(t->type == DM_TYPE_DAX_BIO_BASED);
932 BUG_ON(t->type == DM_TYPE_NVME_BIO_BASED);
933 goto verify_rq_based;
936 for (i = 0; i < t->num_targets; i++) {
937 tgt = t->targets + i;
938 if (dm_target_hybrid(tgt))
940 else if (dm_target_request_based(tgt))
945 if (bio_based && request_based) {
946 DMERR("Inconsistent table: different target types"
947 " can't be mixed up");
952 if (hybrid && !bio_based && !request_based) {
954 * The targets can work either way.
955 * Determine the type from the live device.
956 * Default to bio-based if device is new.
958 if (__table_type_request_based(live_md_type))
966 /* We must use this table as bio-based */
967 t->type = DM_TYPE_BIO_BASED;
968 if (dm_table_supports_dax(t, device_supports_dax, &page_size) ||
969 (list_empty(devices) && live_md_type == DM_TYPE_DAX_BIO_BASED)) {
970 t->type = DM_TYPE_DAX_BIO_BASED;
972 /* Check if upgrading to NVMe bio-based is valid or required */
973 tgt = dm_table_get_immutable_target(t);
974 if (tgt && !tgt->max_io_len && dm_table_does_not_support_partial_completion(t)) {
975 t->type = DM_TYPE_NVME_BIO_BASED;
976 goto verify_rq_based; /* must be stacked directly on NVMe (blk-mq) */
977 } else if (list_empty(devices) && live_md_type == DM_TYPE_NVME_BIO_BASED) {
978 t->type = DM_TYPE_NVME_BIO_BASED;
984 BUG_ON(!request_based); /* No targets in this table */
986 t->type = DM_TYPE_REQUEST_BASED;
990 * Request-based dm supports only tables that have a single target now.
991 * To support multiple targets, request splitting support is needed,
992 * and that needs lots of changes in the block-layer.
993 * (e.g. request completion process for partial completion.)
995 if (t->num_targets > 1) {
996 DMERR("%s DM doesn't support multiple targets",
997 t->type == DM_TYPE_NVME_BIO_BASED ? "nvme bio-based" : "request-based");
1001 if (list_empty(devices)) {
1003 struct dm_table *live_table = dm_get_live_table(t->md, &srcu_idx);
1005 /* inherit live table's type */
1007 t->type = live_table->type;
1008 dm_put_live_table(t->md, srcu_idx);
1012 tgt = dm_table_get_immutable_target(t);
1014 DMERR("table load rejected: immutable target is required");
1016 } else if (tgt->max_io_len) {
1017 DMERR("table load rejected: immutable target that splits IO is not supported");
1021 /* Non-request-stackable devices can't be used for request-based dm */
1022 if (!tgt->type->iterate_devices ||
1023 !tgt->type->iterate_devices(tgt, device_is_rq_stackable, NULL)) {
1024 DMERR("table load rejected: including non-request-stackable devices");
1031 enum dm_queue_mode dm_table_get_type(struct dm_table *t)
1036 struct target_type *dm_table_get_immutable_target_type(struct dm_table *t)
1038 return t->immutable_target_type;
1041 struct dm_target *dm_table_get_immutable_target(struct dm_table *t)
1043 /* Immutable target is implicitly a singleton */
1044 if (t->num_targets > 1 ||
1045 !dm_target_is_immutable(t->targets[0].type))
1051 struct dm_target *dm_table_get_wildcard_target(struct dm_table *t)
1053 struct dm_target *ti;
1056 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1057 ti = dm_table_get_target(t, i);
1058 if (dm_target_is_wildcard(ti->type))
1065 bool dm_table_bio_based(struct dm_table *t)
1067 return __table_type_bio_based(dm_table_get_type(t));
1070 bool dm_table_request_based(struct dm_table *t)
1072 return __table_type_request_based(dm_table_get_type(t));
1075 static int dm_table_alloc_md_mempools(struct dm_table *t, struct mapped_device *md)
1077 enum dm_queue_mode type = dm_table_get_type(t);
1078 unsigned per_io_data_size = 0;
1079 unsigned min_pool_size = 0;
1080 struct dm_target *ti;
1083 if (unlikely(type == DM_TYPE_NONE)) {
1084 DMWARN("no table type is set, can't allocate mempools");
1088 if (__table_type_bio_based(type))
1089 for (i = 0; i < t->num_targets; i++) {
1090 ti = t->targets + i;
1091 per_io_data_size = max(per_io_data_size, ti->per_io_data_size);
1092 min_pool_size = max(min_pool_size, ti->num_flush_bios);
1095 t->mempools = dm_alloc_md_mempools(md, type, t->integrity_supported,
1096 per_io_data_size, min_pool_size);
1103 void dm_table_free_md_mempools(struct dm_table *t)
1105 dm_free_md_mempools(t->mempools);
1109 struct dm_md_mempools *dm_table_get_md_mempools(struct dm_table *t)
1114 static int setup_indexes(struct dm_table *t)
1117 unsigned int total = 0;
1120 /* allocate the space for *all* the indexes */
1121 for (i = t->depth - 2; i >= 0; i--) {
1122 t->counts[i] = dm_div_up(t->counts[i + 1], CHILDREN_PER_NODE);
1123 total += t->counts[i];
1126 indexes = (sector_t *) dm_vcalloc(total, (unsigned long) NODE_SIZE);
1130 /* set up internal nodes, bottom-up */
1131 for (i = t->depth - 2; i >= 0; i--) {
1132 t->index[i] = indexes;
1133 indexes += (KEYS_PER_NODE * t->counts[i]);
1134 setup_btree_index(i, t);
1141 * Builds the btree to index the map.
1143 static int dm_table_build_index(struct dm_table *t)
1146 unsigned int leaf_nodes;
1148 /* how many indexes will the btree have ? */
1149 leaf_nodes = dm_div_up(t->num_targets, KEYS_PER_NODE);
1150 t->depth = 1 + int_log(leaf_nodes, CHILDREN_PER_NODE);
1152 /* leaf layer has already been set up */
1153 t->counts[t->depth - 1] = leaf_nodes;
1154 t->index[t->depth - 1] = t->highs;
1157 r = setup_indexes(t);
1162 static bool integrity_profile_exists(struct gendisk *disk)
1164 return !!blk_get_integrity(disk);
1168 * Get a disk whose integrity profile reflects the table's profile.
1169 * Returns NULL if integrity support was inconsistent or unavailable.
1171 static struct gendisk * dm_table_get_integrity_disk(struct dm_table *t)
1173 struct list_head *devices = dm_table_get_devices(t);
1174 struct dm_dev_internal *dd = NULL;
1175 struct gendisk *prev_disk = NULL, *template_disk = NULL;
1178 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1179 struct dm_target *ti = dm_table_get_target(t, i);
1180 if (!dm_target_passes_integrity(ti->type))
1184 list_for_each_entry(dd, devices, list) {
1185 template_disk = dd->dm_dev->bdev->bd_disk;
1186 if (!integrity_profile_exists(template_disk))
1188 else if (prev_disk &&
1189 blk_integrity_compare(prev_disk, template_disk) < 0)
1191 prev_disk = template_disk;
1194 return template_disk;
1198 DMWARN("%s: integrity not set: %s and %s profile mismatch",
1199 dm_device_name(t->md),
1200 prev_disk->disk_name,
1201 template_disk->disk_name);
1206 * Register the mapped device for blk_integrity support if the
1207 * underlying devices have an integrity profile. But all devices may
1208 * not have matching profiles (checking all devices isn't reliable
1209 * during table load because this table may use other DM device(s) which
1210 * must be resumed before they will have an initialized integity
1211 * profile). Consequently, stacked DM devices force a 2 stage integrity
1212 * profile validation: First pass during table load, final pass during
1215 static int dm_table_register_integrity(struct dm_table *t)
1217 struct mapped_device *md = t->md;
1218 struct gendisk *template_disk = NULL;
1220 /* If target handles integrity itself do not register it here. */
1221 if (t->integrity_added)
1224 template_disk = dm_table_get_integrity_disk(t);
1228 if (!integrity_profile_exists(dm_disk(md))) {
1229 t->integrity_supported = true;
1231 * Register integrity profile during table load; we can do
1232 * this because the final profile must match during resume.
1234 blk_integrity_register(dm_disk(md),
1235 blk_get_integrity(template_disk));
1240 * If DM device already has an initialized integrity
1241 * profile the new profile should not conflict.
1243 if (blk_integrity_compare(dm_disk(md), template_disk) < 0) {
1244 DMWARN("%s: conflict with existing integrity profile: "
1245 "%s profile mismatch",
1246 dm_device_name(t->md),
1247 template_disk->disk_name);
1251 /* Preserve existing integrity profile */
1252 t->integrity_supported = true;
1257 * Prepares the table for use by building the indices,
1258 * setting the type, and allocating mempools.
1260 int dm_table_complete(struct dm_table *t)
1264 r = dm_table_determine_type(t);
1266 DMERR("unable to determine table type");
1270 r = dm_table_build_index(t);
1272 DMERR("unable to build btrees");
1276 r = dm_table_register_integrity(t);
1278 DMERR("could not register integrity profile.");
1282 r = dm_table_alloc_md_mempools(t, t->md);
1284 DMERR("unable to allocate mempools");
1289 static DEFINE_MUTEX(_event_lock);
1290 void dm_table_event_callback(struct dm_table *t,
1291 void (*fn)(void *), void *context)
1293 mutex_lock(&_event_lock);
1295 t->event_context = context;
1296 mutex_unlock(&_event_lock);
1299 void dm_table_event(struct dm_table *t)
1302 * You can no longer call dm_table_event() from interrupt
1303 * context, use a bottom half instead.
1305 BUG_ON(in_interrupt());
1307 mutex_lock(&_event_lock);
1309 t->event_fn(t->event_context);
1310 mutex_unlock(&_event_lock);
1312 EXPORT_SYMBOL(dm_table_event);
1314 inline sector_t dm_table_get_size(struct dm_table *t)
1316 return t->num_targets ? (t->highs[t->num_targets - 1] + 1) : 0;
1318 EXPORT_SYMBOL(dm_table_get_size);
1320 struct dm_target *dm_table_get_target(struct dm_table *t, unsigned int index)
1322 if (index >= t->num_targets)
1325 return t->targets + index;
1329 * Search the btree for the correct target.
1331 * Caller should check returned pointer for NULL
1332 * to trap I/O beyond end of device.
1334 struct dm_target *dm_table_find_target(struct dm_table *t, sector_t sector)
1336 unsigned int l, n = 0, k = 0;
1339 if (unlikely(sector >= dm_table_get_size(t)))
1342 for (l = 0; l < t->depth; l++) {
1343 n = get_child(n, k);
1344 node = get_node(t, l, n);
1346 for (k = 0; k < KEYS_PER_NODE; k++)
1347 if (node[k] >= sector)
1351 return &t->targets[(KEYS_PER_NODE * n) + k];
1354 static int count_device(struct dm_target *ti, struct dm_dev *dev,
1355 sector_t start, sector_t len, void *data)
1357 unsigned *num_devices = data;
1365 * Check whether a table has no data devices attached using each
1366 * target's iterate_devices method.
1367 * Returns false if the result is unknown because a target doesn't
1368 * support iterate_devices.
1370 bool dm_table_has_no_data_devices(struct dm_table *table)
1372 struct dm_target *ti;
1373 unsigned i, num_devices;
1375 for (i = 0; i < dm_table_get_num_targets(table); i++) {
1376 ti = dm_table_get_target(table, i);
1378 if (!ti->type->iterate_devices)
1382 ti->type->iterate_devices(ti, count_device, &num_devices);
1390 static int device_is_zoned_model(struct dm_target *ti, struct dm_dev *dev,
1391 sector_t start, sector_t len, void *data)
1393 struct request_queue *q = bdev_get_queue(dev->bdev);
1394 enum blk_zoned_model *zoned_model = data;
1396 return q && blk_queue_zoned_model(q) == *zoned_model;
1399 static bool dm_table_supports_zoned_model(struct dm_table *t,
1400 enum blk_zoned_model zoned_model)
1402 struct dm_target *ti;
1405 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1406 ti = dm_table_get_target(t, i);
1408 if (zoned_model == BLK_ZONED_HM &&
1409 !dm_target_supports_zoned_hm(ti->type))
1412 if (!ti->type->iterate_devices ||
1413 !ti->type->iterate_devices(ti, device_is_zoned_model, &zoned_model))
1420 static int device_matches_zone_sectors(struct dm_target *ti, struct dm_dev *dev,
1421 sector_t start, sector_t len, void *data)
1423 struct request_queue *q = bdev_get_queue(dev->bdev);
1424 unsigned int *zone_sectors = data;
1426 return q && blk_queue_zone_sectors(q) == *zone_sectors;
1429 static bool dm_table_matches_zone_sectors(struct dm_table *t,
1430 unsigned int zone_sectors)
1432 struct dm_target *ti;
1435 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1436 ti = dm_table_get_target(t, i);
1438 if (!ti->type->iterate_devices ||
1439 !ti->type->iterate_devices(ti, device_matches_zone_sectors, &zone_sectors))
1446 static int validate_hardware_zoned_model(struct dm_table *table,
1447 enum blk_zoned_model zoned_model,
1448 unsigned int zone_sectors)
1450 if (zoned_model == BLK_ZONED_NONE)
1453 if (!dm_table_supports_zoned_model(table, zoned_model)) {
1454 DMERR("%s: zoned model is not consistent across all devices",
1455 dm_device_name(table->md));
1459 /* Check zone size validity and compatibility */
1460 if (!zone_sectors || !is_power_of_2(zone_sectors))
1463 if (!dm_table_matches_zone_sectors(table, zone_sectors)) {
1464 DMERR("%s: zone sectors is not consistent across all devices",
1465 dm_device_name(table->md));
1473 * Establish the new table's queue_limits and validate them.
1475 int dm_calculate_queue_limits(struct dm_table *table,
1476 struct queue_limits *limits)
1478 struct dm_target *ti;
1479 struct queue_limits ti_limits;
1481 enum blk_zoned_model zoned_model = BLK_ZONED_NONE;
1482 unsigned int zone_sectors = 0;
1484 blk_set_stacking_limits(limits);
1486 for (i = 0; i < dm_table_get_num_targets(table); i++) {
1487 blk_set_stacking_limits(&ti_limits);
1489 ti = dm_table_get_target(table, i);
1491 if (!ti->type->iterate_devices)
1492 goto combine_limits;
1495 * Combine queue limits of all the devices this target uses.
1497 ti->type->iterate_devices(ti, dm_set_device_limits,
1500 if (zoned_model == BLK_ZONED_NONE && ti_limits.zoned != BLK_ZONED_NONE) {
1502 * After stacking all limits, validate all devices
1503 * in table support this zoned model and zone sectors.
1505 zoned_model = ti_limits.zoned;
1506 zone_sectors = ti_limits.chunk_sectors;
1509 /* Set I/O hints portion of queue limits */
1510 if (ti->type->io_hints)
1511 ti->type->io_hints(ti, &ti_limits);
1514 * Check each device area is consistent with the target's
1515 * overall queue limits.
1517 if (ti->type->iterate_devices(ti, device_area_is_invalid,
1523 * Merge this target's queue limits into the overall limits
1526 if (blk_stack_limits(limits, &ti_limits, 0) < 0)
1527 DMWARN("%s: adding target device "
1528 "(start sect %llu len %llu) "
1529 "caused an alignment inconsistency",
1530 dm_device_name(table->md),
1531 (unsigned long long) ti->begin,
1532 (unsigned long long) ti->len);
1536 * Verify that the zoned model and zone sectors, as determined before
1537 * any .io_hints override, are the same across all devices in the table.
1538 * - this is especially relevant if .io_hints is emulating a disk-managed
1539 * zoned model (aka BLK_ZONED_NONE) on host-managed zoned block devices.
1542 if (limits->zoned != BLK_ZONED_NONE) {
1544 * ...IF the above limits stacking determined a zoned model
1545 * validate that all of the table's devices conform to it.
1547 zoned_model = limits->zoned;
1548 zone_sectors = limits->chunk_sectors;
1550 if (validate_hardware_zoned_model(table, zoned_model, zone_sectors))
1553 return validate_hardware_logical_block_alignment(table, limits);
1557 * Verify that all devices have an integrity profile that matches the
1558 * DM device's registered integrity profile. If the profiles don't
1559 * match then unregister the DM device's integrity profile.
1561 static void dm_table_verify_integrity(struct dm_table *t)
1563 struct gendisk *template_disk = NULL;
1565 if (t->integrity_added)
1568 if (t->integrity_supported) {
1570 * Verify that the original integrity profile
1571 * matches all the devices in this table.
1573 template_disk = dm_table_get_integrity_disk(t);
1574 if (template_disk &&
1575 blk_integrity_compare(dm_disk(t->md), template_disk) >= 0)
1579 if (integrity_profile_exists(dm_disk(t->md))) {
1580 DMWARN("%s: unable to establish an integrity profile",
1581 dm_device_name(t->md));
1582 blk_integrity_unregister(dm_disk(t->md));
1586 static int device_flush_capable(struct dm_target *ti, struct dm_dev *dev,
1587 sector_t start, sector_t len, void *data)
1589 unsigned long flush = (unsigned long) data;
1590 struct request_queue *q = bdev_get_queue(dev->bdev);
1592 return q && (q->queue_flags & flush);
1595 static bool dm_table_supports_flush(struct dm_table *t, unsigned long flush)
1597 struct dm_target *ti;
1601 * Require at least one underlying device to support flushes.
1602 * t->devices includes internal dm devices such as mirror logs
1603 * so we need to use iterate_devices here, which targets
1604 * supporting flushes must provide.
1606 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1607 ti = dm_table_get_target(t, i);
1609 if (!ti->num_flush_bios)
1612 if (ti->flush_supported)
1615 if (ti->type->iterate_devices &&
1616 ti->type->iterate_devices(ti, device_flush_capable, (void *) flush))
1623 static int device_dax_write_cache_enabled(struct dm_target *ti,
1624 struct dm_dev *dev, sector_t start,
1625 sector_t len, void *data)
1627 struct dax_device *dax_dev = dev->dax_dev;
1632 if (dax_write_cache_enabled(dax_dev))
1637 static int dm_table_supports_dax_write_cache(struct dm_table *t)
1639 struct dm_target *ti;
1642 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1643 ti = dm_table_get_target(t, i);
1645 if (ti->type->iterate_devices &&
1646 ti->type->iterate_devices(ti,
1647 device_dax_write_cache_enabled, NULL))
1654 static int device_is_nonrot(struct dm_target *ti, struct dm_dev *dev,
1655 sector_t start, sector_t len, void *data)
1657 struct request_queue *q = bdev_get_queue(dev->bdev);
1659 return q && blk_queue_nonrot(q);
1662 static int device_is_not_random(struct dm_target *ti, struct dm_dev *dev,
1663 sector_t start, sector_t len, void *data)
1665 struct request_queue *q = bdev_get_queue(dev->bdev);
1667 return q && !blk_queue_add_random(q);
1670 static bool dm_table_all_devices_attribute(struct dm_table *t,
1671 iterate_devices_callout_fn func)
1673 struct dm_target *ti;
1676 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1677 ti = dm_table_get_target(t, i);
1679 if (!ti->type->iterate_devices ||
1680 !ti->type->iterate_devices(ti, func, NULL))
1687 static int device_no_partial_completion(struct dm_target *ti, struct dm_dev *dev,
1688 sector_t start, sector_t len, void *data)
1690 char b[BDEVNAME_SIZE];
1692 /* For now, NVMe devices are the only devices of this class */
1693 return (strncmp(bdevname(dev->bdev, b), "nvme", 4) == 0);
1696 static bool dm_table_does_not_support_partial_completion(struct dm_table *t)
1698 return dm_table_all_devices_attribute(t, device_no_partial_completion);
1701 static int device_not_write_same_capable(struct dm_target *ti, struct dm_dev *dev,
1702 sector_t start, sector_t len, void *data)
1704 struct request_queue *q = bdev_get_queue(dev->bdev);
1706 return q && !q->limits.max_write_same_sectors;
1709 static bool dm_table_supports_write_same(struct dm_table *t)
1711 struct dm_target *ti;
1714 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1715 ti = dm_table_get_target(t, i);
1717 if (!ti->num_write_same_bios)
1720 if (!ti->type->iterate_devices ||
1721 ti->type->iterate_devices(ti, device_not_write_same_capable, NULL))
1728 static int device_not_write_zeroes_capable(struct dm_target *ti, struct dm_dev *dev,
1729 sector_t start, sector_t len, void *data)
1731 struct request_queue *q = bdev_get_queue(dev->bdev);
1733 return q && !q->limits.max_write_zeroes_sectors;
1736 static bool dm_table_supports_write_zeroes(struct dm_table *t)
1738 struct dm_target *ti;
1741 while (i < dm_table_get_num_targets(t)) {
1742 ti = dm_table_get_target(t, i++);
1744 if (!ti->num_write_zeroes_bios)
1747 if (!ti->type->iterate_devices ||
1748 ti->type->iterate_devices(ti, device_not_write_zeroes_capable, NULL))
1755 static int device_not_discard_capable(struct dm_target *ti, struct dm_dev *dev,
1756 sector_t start, sector_t len, void *data)
1758 struct request_queue *q = bdev_get_queue(dev->bdev);
1760 return q && !blk_queue_discard(q);
1763 static bool dm_table_supports_discards(struct dm_table *t)
1765 struct dm_target *ti;
1768 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1769 ti = dm_table_get_target(t, i);
1771 if (!ti->num_discard_bios)
1775 * Either the target provides discard support (as implied by setting
1776 * 'discards_supported') or it relies on _all_ data devices having
1779 if (!ti->discards_supported &&
1780 (!ti->type->iterate_devices ||
1781 ti->type->iterate_devices(ti, device_not_discard_capable, NULL)))
1788 static int device_not_secure_erase_capable(struct dm_target *ti,
1789 struct dm_dev *dev, sector_t start,
1790 sector_t len, void *data)
1792 struct request_queue *q = bdev_get_queue(dev->bdev);
1794 return q && !blk_queue_secure_erase(q);
1797 static bool dm_table_supports_secure_erase(struct dm_table *t)
1799 struct dm_target *ti;
1802 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1803 ti = dm_table_get_target(t, i);
1805 if (!ti->num_secure_erase_bios)
1808 if (!ti->type->iterate_devices ||
1809 ti->type->iterate_devices(ti, device_not_secure_erase_capable, NULL))
1816 static int device_requires_stable_pages(struct dm_target *ti,
1817 struct dm_dev *dev, sector_t start,
1818 sector_t len, void *data)
1820 struct request_queue *q = bdev_get_queue(dev->bdev);
1822 return q && bdi_cap_stable_pages_required(q->backing_dev_info);
1826 * If any underlying device requires stable pages, a table must require
1827 * them as well. Only targets that support iterate_devices are considered:
1828 * don't want error, zero, etc to require stable pages.
1830 static bool dm_table_requires_stable_pages(struct dm_table *t)
1832 struct dm_target *ti;
1835 for (i = 0; i < dm_table_get_num_targets(t); i++) {
1836 ti = dm_table_get_target(t, i);
1838 if (ti->type->iterate_devices &&
1839 ti->type->iterate_devices(ti, device_requires_stable_pages, NULL))
1846 void dm_table_set_restrictions(struct dm_table *t, struct request_queue *q,
1847 struct queue_limits *limits)
1849 bool wc = false, fua = false;
1850 int page_size = PAGE_SIZE;
1853 * Copy table's limits to the DM device's request_queue
1855 q->limits = *limits;
1857 if (!dm_table_supports_discards(t)) {
1858 blk_queue_flag_clear(QUEUE_FLAG_DISCARD, q);
1859 /* Must also clear discard limits... */
1860 q->limits.max_discard_sectors = 0;
1861 q->limits.max_hw_discard_sectors = 0;
1862 q->limits.discard_granularity = 0;
1863 q->limits.discard_alignment = 0;
1864 q->limits.discard_misaligned = 0;
1866 blk_queue_flag_set(QUEUE_FLAG_DISCARD, q);
1868 if (dm_table_supports_secure_erase(t))
1869 blk_queue_flag_set(QUEUE_FLAG_SECERASE, q);
1871 if (dm_table_supports_flush(t, (1UL << QUEUE_FLAG_WC))) {
1873 if (dm_table_supports_flush(t, (1UL << QUEUE_FLAG_FUA)))
1876 blk_queue_write_cache(q, wc, fua);
1878 if (dm_table_supports_dax(t, device_supports_dax, &page_size)) {
1879 blk_queue_flag_set(QUEUE_FLAG_DAX, q);
1880 if (dm_table_supports_dax(t, device_dax_synchronous, NULL))
1881 set_dax_synchronous(t->md->dax_dev);
1884 blk_queue_flag_clear(QUEUE_FLAG_DAX, q);
1886 if (dm_table_supports_dax_write_cache(t))
1887 dax_write_cache(t->md->dax_dev, true);
1889 /* Ensure that all underlying devices are non-rotational. */
1890 if (dm_table_all_devices_attribute(t, device_is_nonrot))
1891 blk_queue_flag_set(QUEUE_FLAG_NONROT, q);
1893 blk_queue_flag_clear(QUEUE_FLAG_NONROT, q);
1895 if (!dm_table_supports_write_same(t))
1896 q->limits.max_write_same_sectors = 0;
1897 if (!dm_table_supports_write_zeroes(t))
1898 q->limits.max_write_zeroes_sectors = 0;
1900 dm_table_verify_integrity(t);
1903 * Some devices don't use blk_integrity but still want stable pages
1904 * because they do their own checksumming.
1906 if (dm_table_requires_stable_pages(t))
1907 q->backing_dev_info->capabilities |= BDI_CAP_STABLE_WRITES;
1909 q->backing_dev_info->capabilities &= ~BDI_CAP_STABLE_WRITES;
1912 * Determine whether or not this queue's I/O timings contribute
1913 * to the entropy pool, Only request-based targets use this.
1914 * Clear QUEUE_FLAG_ADD_RANDOM if any underlying device does not
1917 if (blk_queue_add_random(q) && dm_table_all_devices_attribute(t, device_is_not_random))
1918 blk_queue_flag_clear(QUEUE_FLAG_ADD_RANDOM, q);
1921 * For a zoned target, the number of zones should be updated for the
1922 * correct value to be exposed in sysfs queue/nr_zones. For a BIO based
1923 * target, this is all that is needed.
1925 #ifdef CONFIG_BLK_DEV_ZONED
1926 if (blk_queue_is_zoned(q)) {
1927 WARN_ON_ONCE(queue_is_mq(q));
1928 q->nr_zones = blkdev_nr_zones(t->md->disk);
1932 /* Allow reads to exceed readahead limits */
1933 q->backing_dev_info->io_pages = limits->max_sectors >> (PAGE_SHIFT - 9);
1936 unsigned int dm_table_get_num_targets(struct dm_table *t)
1938 return t->num_targets;
1941 struct list_head *dm_table_get_devices(struct dm_table *t)
1946 fmode_t dm_table_get_mode(struct dm_table *t)
1950 EXPORT_SYMBOL(dm_table_get_mode);
1958 static void suspend_targets(struct dm_table *t, enum suspend_mode mode)
1960 int i = t->num_targets;
1961 struct dm_target *ti = t->targets;
1963 lockdep_assert_held(&t->md->suspend_lock);
1968 if (ti->type->presuspend)
1969 ti->type->presuspend(ti);
1971 case PRESUSPEND_UNDO:
1972 if (ti->type->presuspend_undo)
1973 ti->type->presuspend_undo(ti);
1976 if (ti->type->postsuspend)
1977 ti->type->postsuspend(ti);
1984 void dm_table_presuspend_targets(struct dm_table *t)
1989 suspend_targets(t, PRESUSPEND);
1992 void dm_table_presuspend_undo_targets(struct dm_table *t)
1997 suspend_targets(t, PRESUSPEND_UNDO);
2000 void dm_table_postsuspend_targets(struct dm_table *t)
2005 suspend_targets(t, POSTSUSPEND);
2008 int dm_table_resume_targets(struct dm_table *t)
2012 lockdep_assert_held(&t->md->suspend_lock);
2014 for (i = 0; i < t->num_targets; i++) {
2015 struct dm_target *ti = t->targets + i;
2017 if (!ti->type->preresume)
2020 r = ti->type->preresume(ti);
2022 DMERR("%s: %s: preresume failed, error = %d",
2023 dm_device_name(t->md), ti->type->name, r);
2028 for (i = 0; i < t->num_targets; i++) {
2029 struct dm_target *ti = t->targets + i;
2031 if (ti->type->resume)
2032 ti->type->resume(ti);
2038 struct mapped_device *dm_table_get_md(struct dm_table *t)
2042 EXPORT_SYMBOL(dm_table_get_md);
2044 const char *dm_table_device_name(struct dm_table *t)
2046 return dm_device_name(t->md);
2048 EXPORT_SYMBOL_GPL(dm_table_device_name);
2050 void dm_table_run_md_queue_async(struct dm_table *t)
2052 struct mapped_device *md;
2053 struct request_queue *queue;
2055 if (!dm_table_request_based(t))
2058 md = dm_table_get_md(t);
2059 queue = dm_get_md_queue(md);
2061 blk_mq_run_hw_queues(queue, true);
2063 EXPORT_SYMBOL(dm_table_run_md_queue_async);