diff options
| -rw-r--r-- | Documentation/device-mapper/verity.txt | 131 | ||||
| -rw-r--r-- | drivers/md/dm-thin.c | 7 | ||||
| -rw-r--r-- | drivers/md/persistent-data/dm-space-map-checker.c | 54 | ||||
| -rw-r--r-- | drivers/md/persistent-data/dm-space-map-disk.c | 11 | ||||
| -rw-r--r-- | drivers/md/persistent-data/dm-transaction-manager.c | 11 |
5 files changed, 103 insertions, 111 deletions
diff --git a/Documentation/device-mapper/verity.txt b/Documentation/device-mapper/verity.txt index 32e48797a14f..9884681535ee 100644 --- a/Documentation/device-mapper/verity.txt +++ b/Documentation/device-mapper/verity.txt | |||
| @@ -7,39 +7,39 @@ This target is read-only. | |||
| 7 | 7 | ||
| 8 | Construction Parameters | 8 | Construction Parameters |
| 9 | ======================= | 9 | ======================= |
| 10 | <version> <dev> <hash_dev> <hash_start> | 10 | <version> <dev> <hash_dev> |
| 11 | <data_block_size> <hash_block_size> | 11 | <data_block_size> <hash_block_size> |
| 12 | <num_data_blocks> <hash_start_block> | 12 | <num_data_blocks> <hash_start_block> |
| 13 | <algorithm> <digest> <salt> | 13 | <algorithm> <digest> <salt> |
| 14 | 14 | ||
| 15 | <version> | 15 | <version> |
| 16 | This is the version number of the on-disk format. | 16 | This is the type of the on-disk hash format. |
| 17 | 17 | ||
| 18 | 0 is the original format used in the Chromium OS. | 18 | 0 is the original format used in the Chromium OS. |
| 19 | The salt is appended when hashing, digests are stored continuously and | 19 | The salt is appended when hashing, digests are stored continuously and |
| 20 | the rest of the block is padded with zeros. | 20 | the rest of the block is padded with zeros. |
| 21 | 21 | ||
| 22 | 1 is the current format that should be used for new devices. | 22 | 1 is the current format that should be used for new devices. |
| 23 | The salt is prepended when hashing and each digest is | 23 | The salt is prepended when hashing and each digest is |
| 24 | padded with zeros to the power of two. | 24 | padded with zeros to the power of two. |
| 25 | 25 | ||
| 26 | <dev> | 26 | <dev> |
| 27 | This is the device containing the data the integrity of which needs to be | 27 | This is the device containing data, the integrity of which needs to be |
| 28 | checked. It may be specified as a path, like /dev/sdaX, or a device number, | 28 | checked. It may be specified as a path, like /dev/sdaX, or a device number, |
| 29 | <major>:<minor>. | 29 | <major>:<minor>. |
| 30 | 30 | ||
| 31 | <hash_dev> | 31 | <hash_dev> |
| 32 | This is the device that that supplies the hash tree data. It may be | 32 | This is the device that supplies the hash tree data. It may be |
| 33 | specified similarly to the device path and may be the same device. If the | 33 | specified similarly to the device path and may be the same device. If the |
| 34 | same device is used, the hash_start should be outside of the dm-verity | 34 | same device is used, the hash_start should be outside the configured |
| 35 | configured device size. | 35 | dm-verity device. |
| 36 | 36 | ||
| 37 | <data_block_size> | 37 | <data_block_size> |
| 38 | The block size on a data device. Each block corresponds to one digest on | 38 | The block size on a data device in bytes. |
| 39 | the hash device. | 39 | Each block corresponds to one digest on the hash device. |
| 40 | 40 | ||
| 41 | <hash_block_size> | 41 | <hash_block_size> |
| 42 | The size of a hash block. | 42 | The size of a hash block in bytes. |
| 43 | 43 | ||
| 44 | <num_data_blocks> | 44 | <num_data_blocks> |
| 45 | The number of data blocks on the data device. Additional blocks are | 45 | The number of data blocks on the data device. Additional blocks are |
| @@ -65,7 +65,7 @@ Construction Parameters | |||
| 65 | Theory of operation | 65 | Theory of operation |
| 66 | =================== | 66 | =================== |
| 67 | 67 | ||
| 68 | dm-verity is meant to be setup as part of a verified boot path. This | 68 | dm-verity is meant to be set up as part of a verified boot path. This |
| 69 | may be anything ranging from a boot using tboot or trustedgrub to just | 69 | may be anything ranging from a boot using tboot or trustedgrub to just |
| 70 | booting from a known-good device (like a USB drive or CD). | 70 | booting from a known-good device (like a USB drive or CD). |
| 71 | 71 | ||
| @@ -73,20 +73,20 @@ When a dm-verity device is configured, it is expected that the caller | |||
| 73 | has been authenticated in some way (cryptographic signatures, etc). | 73 | has been authenticated in some way (cryptographic signatures, etc). |
| 74 | After instantiation, all hashes will be verified on-demand during | 74 | After instantiation, all hashes will be verified on-demand during |
| 75 | disk access. If they cannot be verified up to the root node of the | 75 | disk access. If they cannot be verified up to the root node of the |
| 76 | tree, the root hash, then the I/O will fail. This should identify | 76 | tree, the root hash, then the I/O will fail. This should detect |
| 77 | tampering with any data on the device and the hash data. | 77 | tampering with any data on the device and the hash data. |
| 78 | 78 | ||
| 79 | Cryptographic hashes are used to assert the integrity of the device on a | 79 | Cryptographic hashes are used to assert the integrity of the device on a |
| 80 | per-block basis. This allows for a lightweight hash computation on first read | 80 | per-block basis. This allows for a lightweight hash computation on first read |
| 81 | into the page cache. Block hashes are stored linearly-aligned to the nearest | 81 | into the page cache. Block hashes are stored linearly, aligned to the nearest |
| 82 | block the size of a page. | 82 | block size. |
| 83 | 83 | ||
| 84 | Hash Tree | 84 | Hash Tree |
| 85 | --------- | 85 | --------- |
| 86 | 86 | ||
| 87 | Each node in the tree is a cryptographic hash. If it is a leaf node, the hash | 87 | Each node in the tree is a cryptographic hash. If it is a leaf node, the hash |
| 88 | is of some block data on disk. If it is an intermediary node, then the hash is | 88 | of some data block on disk is calculated. If it is an intermediary node, |
| 89 | of a number of child nodes. | 89 | the hash of a number of child nodes is calculated. |
| 90 | 90 | ||
| 91 | Each entry in the tree is a collection of neighboring nodes that fit in one | 91 | Each entry in the tree is a collection of neighboring nodes that fit in one |
| 92 | block. The number is determined based on block_size and the size of the | 92 | block. The number is determined based on block_size and the size of the |
| @@ -110,63 +110,23 @@ alg = sha256, num_blocks = 32768, block_size = 4096 | |||
| 110 | On-disk format | 110 | On-disk format |
| 111 | ============== | 111 | ============== |
| 112 | 112 | ||
| 113 | Below is the recommended on-disk format. The verity kernel code does not | 113 | The verity kernel code does not read the verity metadata on-disk header. |
| 114 | read the on-disk header. It only reads the hash blocks which directly | 114 | It only reads the hash blocks which directly follow the header. |
| 115 | follow the header. It is expected that a user-space tool will verify the | 115 | It is expected that a user-space tool will verify the integrity of the |
| 116 | integrity of the verity_header and then call dmsetup with the correct | 116 | verity header. |
| 117 | parameters. Alternatively, the header can be omitted and the dmsetup | ||
| 118 | parameters can be passed via the kernel command-line in a rooted chain | ||
| 119 | of trust where the command-line is verified. | ||
| 120 | 117 | ||
| 121 | The on-disk format is especially useful in cases where the hash blocks | 118 | Alternatively, the header can be omitted and the dmsetup parameters can |
| 122 | are on a separate partition. The magic number allows easy identification | 119 | be passed via the kernel command-line in a rooted chain of trust where |
| 123 | of the partition contents. Alternatively, the hash blocks can be stored | 120 | the command-line is verified. |
| 124 | in the same partition as the data to be verified. In such a configuration | ||
| 125 | the filesystem on the partition would be sized a little smaller than | ||
| 126 | the full-partition, leaving room for the hash blocks. | ||
| 127 | |||
| 128 | struct superblock { | ||
| 129 | uint8_t signature[8] | ||
| 130 | "verity\0\0"; | ||
| 131 | |||
| 132 | uint8_t version; | ||
| 133 | 1 - current format | ||
| 134 | |||
| 135 | uint8_t data_block_bits; | ||
| 136 | log2(data block size) | ||
| 137 | |||
| 138 | uint8_t hash_block_bits; | ||
| 139 | log2(hash block size) | ||
| 140 | |||
| 141 | uint8_t pad1[1]; | ||
| 142 | zero padding | ||
| 143 | |||
| 144 | uint16_t salt_size; | ||
| 145 | big-endian salt size | ||
| 146 | |||
| 147 | uint8_t pad2[2]; | ||
| 148 | zero padding | ||
| 149 | |||
| 150 | uint32_t data_blocks_hi; | ||
| 151 | big-endian high 32 bits of the 64-bit number of data blocks | ||
| 152 | |||
| 153 | uint32_t data_blocks_lo; | ||
| 154 | big-endian low 32 bits of the 64-bit number of data blocks | ||
| 155 | |||
| 156 | uint8_t algorithm[16]; | ||
| 157 | cryptographic algorithm | ||
| 158 | |||
| 159 | uint8_t salt[384]; | ||
| 160 | salt (the salt size is specified above) | ||
| 161 | |||
| 162 | uint8_t pad3[88]; | ||
| 163 | zero padding to 512-byte boundary | ||
| 164 | } | ||
| 165 | 121 | ||
| 166 | Directly following the header (and with sector number padded to the next hash | 122 | Directly following the header (and with sector number padded to the next hash |
| 167 | block boundary) are the hash blocks which are stored a depth at a time | 123 | block boundary) are the hash blocks which are stored a depth at a time |
| 168 | (starting from the root), sorted in order of increasing index. | 124 | (starting from the root), sorted in order of increasing index. |
| 169 | 125 | ||
| 126 | The full specification of kernel parameters and on-disk metadata format | ||
| 127 | is available at the cryptsetup project's wiki page | ||
| 128 | http://code.google.com/p/cryptsetup/wiki/DMVerity | ||
| 129 | |||
| 170 | Status | 130 | Status |
| 171 | ====== | 131 | ====== |
| 172 | V (for Valid) is returned if every check performed so far was valid. | 132 | V (for Valid) is returned if every check performed so far was valid. |
| @@ -174,21 +134,22 @@ If any check failed, C (for Corruption) is returned. | |||
| 174 | 134 | ||
| 175 | Example | 135 | Example |
| 176 | ======= | 136 | ======= |
| 177 | 137 | Set up a device: | |
| 178 | Setup a device: | 138 | # dmsetup create vroot --readonly --table \ |
| 179 | dmsetup create vroot --table \ | 139 | "0 2097152 verity 1 /dev/sda1 /dev/sda2 4096 4096 262144 1 sha256 "\ |
| 180 | "0 2097152 "\ | ||
| 181 | "verity 1 /dev/sda1 /dev/sda2 4096 4096 2097152 1 "\ | ||
| 182 | "4392712ba01368efdf14b05c76f9e4df0d53664630b5d48632ed17a137f39076 "\ | 140 | "4392712ba01368efdf14b05c76f9e4df0d53664630b5d48632ed17a137f39076 "\ |
| 183 | "1234000000000000000000000000000000000000000000000000000000000000" | 141 | "1234000000000000000000000000000000000000000000000000000000000000" |
| 184 | 142 | ||
| 185 | A command line tool veritysetup is available to compute or verify | 143 | A command line tool veritysetup is available to compute or verify |
| 186 | the hash tree or activate the kernel driver. This is available from | 144 | the hash tree or activate the kernel device. This is available from |
| 187 | the LVM2 upstream repository and may be supplied as a package called | 145 | the cryptsetup upstream repository http://code.google.com/p/cryptsetup/ |
| 188 | device-mapper-verity-tools: | 146 | (as a libcryptsetup extension). |
| 189 | git://sources.redhat.com/git/lvm2 | 147 | |
| 190 | http://sourceware.org/git/?p=lvm2.git | 148 | Create hash on the device: |
| 191 | http://sourceware.org/cgi-bin/cvsweb.cgi/LVM2/verity?cvsroot=lvm2 | 149 | # veritysetup format /dev/sda1 /dev/sda2 |
| 192 | 150 | ... | |
| 193 | veritysetup -a vroot /dev/sda1 /dev/sda2 \ | 151 | Root hash: 4392712ba01368efdf14b05c76f9e4df0d53664630b5d48632ed17a137f39076 |
| 194 | 4392712ba01368efdf14b05c76f9e4df0d53664630b5d48632ed17a137f39076 | 152 | |
| 153 | Activate the device: | ||
| 154 | # veritysetup create vroot /dev/sda1 /dev/sda2 \ | ||
| 155 | 4392712ba01368efdf14b05c76f9e4df0d53664630b5d48632ed17a137f39076 | ||
diff --git a/drivers/md/dm-thin.c b/drivers/md/dm-thin.c index 37fdaf81bd1f..ce59824fb414 100644 --- a/drivers/md/dm-thin.c +++ b/drivers/md/dm-thin.c | |||
| @@ -2292,6 +2292,13 @@ static int process_reserve_metadata_snap_mesg(unsigned argc, char **argv, struct | |||
| 2292 | if (r) | 2292 | if (r) |
| 2293 | return r; | 2293 | return r; |
| 2294 | 2294 | ||
| 2295 | r = dm_pool_commit_metadata(pool->pmd); | ||
| 2296 | if (r) { | ||
| 2297 | DMERR("%s: dm_pool_commit_metadata() failed, error = %d", | ||
| 2298 | __func__, r); | ||
| 2299 | return r; | ||
| 2300 | } | ||
| 2301 | |||
| 2295 | r = dm_pool_reserve_metadata_snap(pool->pmd); | 2302 | r = dm_pool_reserve_metadata_snap(pool->pmd); |
| 2296 | if (r) | 2303 | if (r) |
| 2297 | DMWARN("reserve_metadata_snap message failed."); | 2304 | DMWARN("reserve_metadata_snap message failed."); |
diff --git a/drivers/md/persistent-data/dm-space-map-checker.c b/drivers/md/persistent-data/dm-space-map-checker.c index 50ed53bf4aa2..fc90c11620ad 100644 --- a/drivers/md/persistent-data/dm-space-map-checker.c +++ b/drivers/md/persistent-data/dm-space-map-checker.c | |||
| @@ -8,6 +8,7 @@ | |||
| 8 | 8 | ||
| 9 | #include <linux/device-mapper.h> | 9 | #include <linux/device-mapper.h> |
| 10 | #include <linux/export.h> | 10 | #include <linux/export.h> |
| 11 | #include <linux/vmalloc.h> | ||
| 11 | 12 | ||
| 12 | #ifdef CONFIG_DM_DEBUG_SPACE_MAPS | 13 | #ifdef CONFIG_DM_DEBUG_SPACE_MAPS |
| 13 | 14 | ||
| @@ -89,13 +90,23 @@ static int ca_create(struct count_array *ca, struct dm_space_map *sm) | |||
| 89 | 90 | ||
| 90 | ca->nr = nr_blocks; | 91 | ca->nr = nr_blocks; |
| 91 | ca->nr_free = nr_blocks; | 92 | ca->nr_free = nr_blocks; |
| 92 | ca->counts = kzalloc(sizeof(*ca->counts) * nr_blocks, GFP_KERNEL); | 93 | |
| 93 | if (!ca->counts) | 94 | if (!nr_blocks) |
| 94 | return -ENOMEM; | 95 | ca->counts = NULL; |
| 96 | else { | ||
| 97 | ca->counts = vzalloc(sizeof(*ca->counts) * nr_blocks); | ||
| 98 | if (!ca->counts) | ||
| 99 | return -ENOMEM; | ||
| 100 | } | ||
| 95 | 101 | ||
| 96 | return 0; | 102 | return 0; |
| 97 | } | 103 | } |
| 98 | 104 | ||
| 105 | static void ca_destroy(struct count_array *ca) | ||
| 106 | { | ||
| 107 | vfree(ca->counts); | ||
| 108 | } | ||
| 109 | |||
| 99 | static int ca_load(struct count_array *ca, struct dm_space_map *sm) | 110 | static int ca_load(struct count_array *ca, struct dm_space_map *sm) |
| 100 | { | 111 | { |
| 101 | int r; | 112 | int r; |
| @@ -126,12 +137,14 @@ static int ca_load(struct count_array *ca, struct dm_space_map *sm) | |||
| 126 | static int ca_extend(struct count_array *ca, dm_block_t extra_blocks) | 137 | static int ca_extend(struct count_array *ca, dm_block_t extra_blocks) |
| 127 | { | 138 | { |
| 128 | dm_block_t nr_blocks = ca->nr + extra_blocks; | 139 | dm_block_t nr_blocks = ca->nr + extra_blocks; |
| 129 | uint32_t *counts = kzalloc(sizeof(*counts) * nr_blocks, GFP_KERNEL); | 140 | uint32_t *counts = vzalloc(sizeof(*counts) * nr_blocks); |
| 130 | if (!counts) | 141 | if (!counts) |
| 131 | return -ENOMEM; | 142 | return -ENOMEM; |
| 132 | 143 | ||
| 133 | memcpy(counts, ca->counts, sizeof(*counts) * ca->nr); | 144 | if (ca->counts) { |
| 134 | kfree(ca->counts); | 145 | memcpy(counts, ca->counts, sizeof(*counts) * ca->nr); |
| 146 | ca_destroy(ca); | ||
| 147 | } | ||
| 135 | ca->nr = nr_blocks; | 148 | ca->nr = nr_blocks; |
| 136 | ca->nr_free += extra_blocks; | 149 | ca->nr_free += extra_blocks; |
| 137 | ca->counts = counts; | 150 | ca->counts = counts; |
| @@ -151,11 +164,6 @@ static int ca_commit(struct count_array *old, struct count_array *new) | |||
| 151 | return 0; | 164 | return 0; |
| 152 | } | 165 | } |
| 153 | 166 | ||
| 154 | static void ca_destroy(struct count_array *ca) | ||
| 155 | { | ||
| 156 | kfree(ca->counts); | ||
| 157 | } | ||
| 158 | |||
| 159 | /*----------------------------------------------------------------*/ | 167 | /*----------------------------------------------------------------*/ |
| 160 | 168 | ||
| 161 | struct sm_checker { | 169 | struct sm_checker { |
| @@ -343,25 +351,25 @@ struct dm_space_map *dm_sm_checker_create(struct dm_space_map *sm) | |||
| 343 | int r; | 351 | int r; |
| 344 | struct sm_checker *smc; | 352 | struct sm_checker *smc; |
| 345 | 353 | ||
| 346 | if (!sm) | 354 | if (IS_ERR_OR_NULL(sm)) |
| 347 | return NULL; | 355 | return ERR_PTR(-EINVAL); |
| 348 | 356 | ||
| 349 | smc = kmalloc(sizeof(*smc), GFP_KERNEL); | 357 | smc = kmalloc(sizeof(*smc), GFP_KERNEL); |
| 350 | if (!smc) | 358 | if (!smc) |
| 351 | return NULL; | 359 | return ERR_PTR(-ENOMEM); |
| 352 | 360 | ||
| 353 | memcpy(&smc->sm, &ops_, sizeof(smc->sm)); | 361 | memcpy(&smc->sm, &ops_, sizeof(smc->sm)); |
| 354 | r = ca_create(&smc->old_counts, sm); | 362 | r = ca_create(&smc->old_counts, sm); |
| 355 | if (r) { | 363 | if (r) { |
| 356 | kfree(smc); | 364 | kfree(smc); |
| 357 | return NULL; | 365 | return ERR_PTR(r); |
| 358 | } | 366 | } |
| 359 | 367 | ||
| 360 | r = ca_create(&smc->counts, sm); | 368 | r = ca_create(&smc->counts, sm); |
| 361 | if (r) { | 369 | if (r) { |
| 362 | ca_destroy(&smc->old_counts); | 370 | ca_destroy(&smc->old_counts); |
| 363 | kfree(smc); | 371 | kfree(smc); |
| 364 | return NULL; | 372 | return ERR_PTR(r); |
| 365 | } | 373 | } |
| 366 | 374 | ||
| 367 | smc->real_sm = sm; | 375 | smc->real_sm = sm; |
| @@ -371,7 +379,7 @@ struct dm_space_map *dm_sm_checker_create(struct dm_space_map *sm) | |||
| 371 | ca_destroy(&smc->counts); | 379 | ca_destroy(&smc->counts); |
| 372 | ca_destroy(&smc->old_counts); | 380 | ca_destroy(&smc->old_counts); |
| 373 | kfree(smc); | 381 | kfree(smc); |
| 374 | return NULL; | 382 | return ERR_PTR(r); |
| 375 | } | 383 | } |
| 376 | 384 | ||
| 377 | r = ca_commit(&smc->old_counts, &smc->counts); | 385 | r = ca_commit(&smc->old_counts, &smc->counts); |
| @@ -379,7 +387,7 @@ struct dm_space_map *dm_sm_checker_create(struct dm_space_map *sm) | |||
| 379 | ca_destroy(&smc->counts); | 387 | ca_destroy(&smc->counts); |
| 380 | ca_destroy(&smc->old_counts); | 388 | ca_destroy(&smc->old_counts); |
| 381 | kfree(smc); | 389 | kfree(smc); |
| 382 | return NULL; | 390 | return ERR_PTR(r); |
| 383 | } | 391 | } |
| 384 | 392 | ||
| 385 | return &smc->sm; | 393 | return &smc->sm; |
| @@ -391,25 +399,25 @@ struct dm_space_map *dm_sm_checker_create_fresh(struct dm_space_map *sm) | |||
| 391 | int r; | 399 | int r; |
| 392 | struct sm_checker *smc; | 400 | struct sm_checker *smc; |
| 393 | 401 | ||
| 394 | if (!sm) | 402 | if (IS_ERR_OR_NULL(sm)) |
| 395 | return NULL; | 403 | return ERR_PTR(-EINVAL); |
| 396 | 404 | ||
| 397 | smc = kmalloc(sizeof(*smc), GFP_KERNEL); | 405 | smc = kmalloc(sizeof(*smc), GFP_KERNEL); |
| 398 | if (!smc) | 406 | if (!smc) |
| 399 | return NULL; | 407 | return ERR_PTR(-ENOMEM); |
| 400 | 408 | ||
| 401 | memcpy(&smc->sm, &ops_, sizeof(smc->sm)); | 409 | memcpy(&smc->sm, &ops_, sizeof(smc->sm)); |
| 402 | r = ca_create(&smc->old_counts, sm); | 410 | r = ca_create(&smc->old_counts, sm); |
| 403 | if (r) { | 411 | if (r) { |
| 404 | kfree(smc); | 412 | kfree(smc); |
| 405 | return NULL; | 413 | return ERR_PTR(r); |
| 406 | } | 414 | } |
| 407 | 415 | ||
| 408 | r = ca_create(&smc->counts, sm); | 416 | r = ca_create(&smc->counts, sm); |
| 409 | if (r) { | 417 | if (r) { |
| 410 | ca_destroy(&smc->old_counts); | 418 | ca_destroy(&smc->old_counts); |
| 411 | kfree(smc); | 419 | kfree(smc); |
| 412 | return NULL; | 420 | return ERR_PTR(r); |
| 413 | } | 421 | } |
| 414 | 422 | ||
| 415 | smc->real_sm = sm; | 423 | smc->real_sm = sm; |
diff --git a/drivers/md/persistent-data/dm-space-map-disk.c b/drivers/md/persistent-data/dm-space-map-disk.c index fc469ba9f627..3d0ed5332883 100644 --- a/drivers/md/persistent-data/dm-space-map-disk.c +++ b/drivers/md/persistent-data/dm-space-map-disk.c | |||
| @@ -290,7 +290,16 @@ struct dm_space_map *dm_sm_disk_create(struct dm_transaction_manager *tm, | |||
| 290 | dm_block_t nr_blocks) | 290 | dm_block_t nr_blocks) |
| 291 | { | 291 | { |
| 292 | struct dm_space_map *sm = dm_sm_disk_create_real(tm, nr_blocks); | 292 | struct dm_space_map *sm = dm_sm_disk_create_real(tm, nr_blocks); |
| 293 | return dm_sm_checker_create_fresh(sm); | 293 | struct dm_space_map *smc; |
| 294 | |||
| 295 | if (IS_ERR_OR_NULL(sm)) | ||
| 296 | return sm; | ||
| 297 | |||
| 298 | smc = dm_sm_checker_create_fresh(sm); | ||
| 299 | if (IS_ERR(smc)) | ||
| 300 | dm_sm_destroy(sm); | ||
| 301 | |||
| 302 | return smc; | ||
| 294 | } | 303 | } |
| 295 | EXPORT_SYMBOL_GPL(dm_sm_disk_create); | 304 | EXPORT_SYMBOL_GPL(dm_sm_disk_create); |
| 296 | 305 | ||
diff --git a/drivers/md/persistent-data/dm-transaction-manager.c b/drivers/md/persistent-data/dm-transaction-manager.c index 400fe144c0cd..e5604b32d91f 100644 --- a/drivers/md/persistent-data/dm-transaction-manager.c +++ b/drivers/md/persistent-data/dm-transaction-manager.c | |||
| @@ -138,6 +138,9 @@ EXPORT_SYMBOL_GPL(dm_tm_create_non_blocking_clone); | |||
| 138 | 138 | ||
| 139 | void dm_tm_destroy(struct dm_transaction_manager *tm) | 139 | void dm_tm_destroy(struct dm_transaction_manager *tm) |
| 140 | { | 140 | { |
| 141 | if (!tm->is_clone) | ||
| 142 | wipe_shadow_table(tm); | ||
| 143 | |||
| 141 | kfree(tm); | 144 | kfree(tm); |
| 142 | } | 145 | } |
| 143 | EXPORT_SYMBOL_GPL(dm_tm_destroy); | 146 | EXPORT_SYMBOL_GPL(dm_tm_destroy); |
| @@ -344,8 +347,10 @@ static int dm_tm_create_internal(struct dm_block_manager *bm, | |||
| 344 | } | 347 | } |
| 345 | 348 | ||
| 346 | *sm = dm_sm_checker_create(inner); | 349 | *sm = dm_sm_checker_create(inner); |
| 347 | if (!*sm) | 350 | if (IS_ERR(*sm)) { |
| 351 | r = PTR_ERR(*sm); | ||
| 348 | goto bad2; | 352 | goto bad2; |
| 353 | } | ||
| 349 | 354 | ||
| 350 | } else { | 355 | } else { |
| 351 | r = dm_bm_write_lock(dm_tm_get_bm(*tm), sb_location, | 356 | r = dm_bm_write_lock(dm_tm_get_bm(*tm), sb_location, |
| @@ -364,8 +369,10 @@ static int dm_tm_create_internal(struct dm_block_manager *bm, | |||
| 364 | } | 369 | } |
| 365 | 370 | ||
| 366 | *sm = dm_sm_checker_create(inner); | 371 | *sm = dm_sm_checker_create(inner); |
| 367 | if (!*sm) | 372 | if (IS_ERR(*sm)) { |
| 373 | r = PTR_ERR(*sm); | ||
| 368 | goto bad2; | 374 | goto bad2; |
| 375 | } | ||
| 369 | } | 376 | } |
| 370 | 377 | ||
| 371 | return 0; | 378 | return 0; |
