2 * Copyright (C) 2012 Red Hat, Inc.
6 * Based on Chromium dm-verity driver (C) 2011 The Chromium OS Authors
8 * This file is released under the GPLv2.
10 * In the file "/sys/module/dm_verity/parameters/prefetch_cluster" you can set
11 * default prefetch value. Data are read in "prefetch_cluster" chunks from the
12 * hash device. Setting this greatly improves performance when data and hash
13 * are on the same disk on different partitions on devices with poor random
17 #include "dm-verity.h"
18 #include "dm-verity-fec.h"
20 #include <linux/module.h>
21 #include <linux/reboot.h>
23 #define DM_MSG_PREFIX "verity"
25 #define DM_VERITY_ENV_LENGTH 42
26 #define DM_VERITY_ENV_VAR_NAME "DM_VERITY_ERR_BLOCK_NR"
28 #define DM_VERITY_DEFAULT_PREFETCH_SIZE 262144
30 #define DM_VERITY_MAX_CORRUPTED_ERRS 100
32 #define DM_VERITY_OPT_LOGGING "ignore_corruption"
33 #define DM_VERITY_OPT_RESTART "restart_on_corruption"
34 #define DM_VERITY_OPT_IGN_ZEROES "ignore_zero_blocks"
35 #define DM_VERITY_OPT_AT_MOST_ONCE "check_at_most_once"
37 #define DM_VERITY_OPTS_MAX (2 + DM_VERITY_OPTS_FEC)
39 static unsigned dm_verity_prefetch_cluster = DM_VERITY_DEFAULT_PREFETCH_SIZE;
41 module_param_named(prefetch_cluster, dm_verity_prefetch_cluster, uint, S_IRUGO | S_IWUSR);
43 struct dm_verity_prefetch_work {
44 struct work_struct work;
51 * Auxiliary structure appended to each dm-bufio buffer. If the value
52 * hash_verified is nonzero, hash of the block has been verified.
54 * The variable hash_verified is set to 0 when allocating the buffer, then
55 * it can be changed to 1 and it is never reset to 0 again.
57 * There is no lock around this value, a race condition can at worst cause
58 * that multiple processes verify the hash of the same buffer simultaneously
59 * and write 1 to hash_verified simultaneously.
60 * This condition is harmless, so we don't need locking.
67 * Initialize struct buffer_aux for a freshly created buffer.
69 static void dm_bufio_alloc_callback(struct dm_buffer *buf)
71 struct buffer_aux *aux = dm_bufio_get_aux_data(buf);
73 aux->hash_verified = 0;
77 * Translate input sector number to the sector number on the target device.
79 static sector_t verity_map_sector(struct dm_verity *v, sector_t bi_sector)
81 return v->data_start + dm_target_offset(v->ti, bi_sector);
85 * Return hash position of a specified block at a specified tree level
86 * (0 is the lowest level).
87 * The lowest "hash_per_block_bits"-bits of the result denote hash position
88 * inside a hash block. The remaining bits denote location of the hash block.
90 static sector_t verity_position_at_level(struct dm_verity *v, sector_t block,
93 return block >> (level * v->hash_per_block_bits);
96 static int verity_hash_update(struct dm_verity *v, struct ahash_request *req,
97 const u8 *data, size_t len,
98 struct crypto_wait *wait)
100 struct scatterlist sg;
102 sg_init_one(&sg, data, len);
103 ahash_request_set_crypt(req, &sg, NULL, len);
105 return crypto_wait_req(crypto_ahash_update(req), wait);
109 * Wrapper for crypto_ahash_init, which handles verity salting.
111 static int verity_hash_init(struct dm_verity *v, struct ahash_request *req,
112 struct crypto_wait *wait)
116 ahash_request_set_tfm(req, v->tfm);
117 ahash_request_set_callback(req, CRYPTO_TFM_REQ_MAY_SLEEP |
118 CRYPTO_TFM_REQ_MAY_BACKLOG,
119 crypto_req_done, (void *)wait);
120 crypto_init_wait(wait);
122 r = crypto_wait_req(crypto_ahash_init(req), wait);
124 if (unlikely(r < 0)) {
125 DMERR("crypto_ahash_init failed: %d", r);
129 if (likely(v->salt_size && (v->version >= 1)))
130 r = verity_hash_update(v, req, v->salt, v->salt_size, wait);
135 static int verity_hash_final(struct dm_verity *v, struct ahash_request *req,
136 u8 *digest, struct crypto_wait *wait)
140 if (unlikely(v->salt_size && (!v->version))) {
141 r = verity_hash_update(v, req, v->salt, v->salt_size, wait);
144 DMERR("verity_hash_final failed updating salt: %d", r);
149 ahash_request_set_crypt(req, NULL, digest, 0);
150 r = crypto_wait_req(crypto_ahash_final(req), wait);
155 int verity_hash(struct dm_verity *v, struct ahash_request *req,
156 const u8 *data, size_t len, u8 *digest)
159 struct crypto_wait wait;
161 r = verity_hash_init(v, req, &wait);
165 r = verity_hash_update(v, req, data, len, &wait);
169 r = verity_hash_final(v, req, digest, &wait);
175 static void verity_hash_at_level(struct dm_verity *v, sector_t block, int level,
176 sector_t *hash_block, unsigned *offset)
178 sector_t position = verity_position_at_level(v, block, level);
181 *hash_block = v->hash_level_block[level] + (position >> v->hash_per_block_bits);
186 idx = position & ((1 << v->hash_per_block_bits) - 1);
188 *offset = idx * v->digest_size;
190 *offset = idx << (v->hash_dev_block_bits - v->hash_per_block_bits);
194 * Handle verification errors.
196 static int verity_handle_err(struct dm_verity *v, enum verity_block_type type,
197 unsigned long long block)
199 char verity_env[DM_VERITY_ENV_LENGTH];
200 char *envp[] = { verity_env, NULL };
201 const char *type_str = "";
202 struct mapped_device *md = dm_table_get_md(v->ti->table);
204 /* Corruption should be visible in device status in all modes */
207 if (v->corrupted_errs >= DM_VERITY_MAX_CORRUPTED_ERRS)
213 case DM_VERITY_BLOCK_TYPE_DATA:
216 case DM_VERITY_BLOCK_TYPE_METADATA:
217 type_str = "metadata";
223 DMERR("%s: %s block %llu is corrupted", v->data_dev->name, type_str,
226 if (v->corrupted_errs == DM_VERITY_MAX_CORRUPTED_ERRS)
227 DMERR("%s: reached maximum errors", v->data_dev->name);
229 snprintf(verity_env, DM_VERITY_ENV_LENGTH, "%s=%d,%llu",
230 DM_VERITY_ENV_VAR_NAME, type, block);
232 kobject_uevent_env(&disk_to_dev(dm_disk(md))->kobj, KOBJ_CHANGE, envp);
235 if (v->mode == DM_VERITY_MODE_LOGGING)
238 if (v->mode == DM_VERITY_MODE_RESTART)
239 kernel_restart("dm-verity device corrupted");
245 * Verify hash of a metadata block pertaining to the specified data block
246 * ("block" argument) at a specified level ("level" argument).
248 * On successful return, verity_io_want_digest(v, io) contains the hash value
249 * for a lower tree level or for the data block (if we're at the lowest level).
251 * If "skip_unverified" is true, unverified buffer is skipped and 1 is returned.
252 * If "skip_unverified" is false, unverified buffer is hashed and verified
253 * against current value of verity_io_want_digest(v, io).
255 static int verity_verify_level(struct dm_verity *v, struct dm_verity_io *io,
256 sector_t block, int level, bool skip_unverified,
259 struct dm_buffer *buf;
260 struct buffer_aux *aux;
266 verity_hash_at_level(v, block, level, &hash_block, &offset);
268 data = dm_bufio_read(v->bufio, hash_block, &buf);
270 return PTR_ERR(data);
272 aux = dm_bufio_get_aux_data(buf);
274 if (!aux->hash_verified) {
275 if (skip_unverified) {
280 r = verity_hash(v, verity_io_hash_req(v, io),
281 data, 1 << v->hash_dev_block_bits,
282 verity_io_real_digest(v, io));
286 if (likely(memcmp(verity_io_real_digest(v, io), want_digest,
287 v->digest_size) == 0))
288 aux->hash_verified = 1;
289 else if (verity_fec_decode(v, io,
290 DM_VERITY_BLOCK_TYPE_METADATA,
291 hash_block, data, NULL) == 0)
292 aux->hash_verified = 1;
293 else if (verity_handle_err(v,
294 DM_VERITY_BLOCK_TYPE_METADATA,
302 memcpy(want_digest, data, v->digest_size);
306 dm_bufio_release(buf);
311 * Find a hash for a given block, write it to digest and verify the integrity
312 * of the hash tree if necessary.
314 int verity_hash_for_block(struct dm_verity *v, struct dm_verity_io *io,
315 sector_t block, u8 *digest, bool *is_zero)
319 if (likely(v->levels)) {
321 * First, we try to get the requested hash for
322 * the current block. If the hash block itself is
323 * verified, zero is returned. If it isn't, this
324 * function returns 1 and we fall back to whole
325 * chain verification.
327 r = verity_verify_level(v, io, block, 0, true, digest);
332 memcpy(digest, v->root_digest, v->digest_size);
334 for (i = v->levels - 1; i >= 0; i--) {
335 r = verity_verify_level(v, io, block, i, false, digest);
340 if (!r && v->zero_digest)
341 *is_zero = !memcmp(v->zero_digest, digest, v->digest_size);
349 * Calculates the digest for the given bio
351 static int verity_for_io_block(struct dm_verity *v, struct dm_verity_io *io,
352 struct bvec_iter *iter, struct crypto_wait *wait)
354 unsigned int todo = 1 << v->data_dev_block_bits;
355 struct bio *bio = dm_bio_from_per_bio_data(io, v->ti->per_io_data_size);
356 struct scatterlist sg;
357 struct ahash_request *req = verity_io_hash_req(v, io);
362 struct bio_vec bv = bio_iter_iovec(bio, *iter);
364 sg_init_table(&sg, 1);
368 if (likely(len >= todo))
371 * Operating on a single page at a time looks suboptimal
372 * until you consider the typical block size is 4,096B.
373 * Going through this loops twice should be very rare.
375 sg_set_page(&sg, bv.bv_page, len, bv.bv_offset);
376 ahash_request_set_crypt(req, &sg, NULL, len);
377 r = crypto_wait_req(crypto_ahash_update(req), wait);
379 if (unlikely(r < 0)) {
380 DMERR("verity_for_io_block crypto op failed: %d", r);
384 bio_advance_iter(bio, iter, len);
392 * Calls function process for 1 << v->data_dev_block_bits bytes in the bio_vec
393 * starting from iter.
395 int verity_for_bv_block(struct dm_verity *v, struct dm_verity_io *io,
396 struct bvec_iter *iter,
397 int (*process)(struct dm_verity *v,
398 struct dm_verity_io *io, u8 *data,
401 unsigned todo = 1 << v->data_dev_block_bits;
402 struct bio *bio = dm_bio_from_per_bio_data(io, v->ti->per_io_data_size);
408 struct bio_vec bv = bio_iter_iovec(bio, *iter);
410 page = kmap_atomic(bv.bv_page);
413 if (likely(len >= todo))
416 r = process(v, io, page + bv.bv_offset, len);
422 bio_advance_iter(bio, iter, len);
429 static int verity_bv_zero(struct dm_verity *v, struct dm_verity_io *io,
430 u8 *data, size_t len)
432 memset(data, 0, len);
437 * Moves the bio iter one data block forward.
439 static inline void verity_bv_skip_block(struct dm_verity *v,
440 struct dm_verity_io *io,
441 struct bvec_iter *iter)
443 struct bio *bio = dm_bio_from_per_bio_data(io, v->ti->per_io_data_size);
445 bio_advance_iter(bio, iter, 1 << v->data_dev_block_bits);
449 * Verify one "dm_verity_io" structure.
451 static int verity_verify_io(struct dm_verity_io *io)
454 struct dm_verity *v = io->v;
455 struct bvec_iter start;
457 struct crypto_wait wait;
459 for (b = 0; b < io->n_blocks; b++) {
461 sector_t cur_block = io->block + b;
462 struct ahash_request *req = verity_io_hash_req(v, io);
464 if (v->validated_blocks &&
465 likely(test_bit(cur_block, v->validated_blocks))) {
466 verity_bv_skip_block(v, io, &io->iter);
470 r = verity_hash_for_block(v, io, cur_block,
471 verity_io_want_digest(v, io),
478 * If we expect a zero block, don't validate, just
481 r = verity_for_bv_block(v, io, &io->iter,
489 r = verity_hash_init(v, req, &wait);
494 r = verity_for_io_block(v, io, &io->iter, &wait);
498 r = verity_hash_final(v, req, verity_io_real_digest(v, io),
503 if (likely(memcmp(verity_io_real_digest(v, io),
504 verity_io_want_digest(v, io), v->digest_size) == 0)) {
505 if (v->validated_blocks)
506 set_bit(cur_block, v->validated_blocks);
509 else if (verity_fec_decode(v, io, DM_VERITY_BLOCK_TYPE_DATA,
510 cur_block, NULL, &start) == 0)
512 else if (verity_handle_err(v, DM_VERITY_BLOCK_TYPE_DATA,
521 * End one "io" structure with a given error.
523 static void verity_finish_io(struct dm_verity_io *io, blk_status_t status)
525 struct dm_verity *v = io->v;
526 struct bio *bio = dm_bio_from_per_bio_data(io, v->ti->per_io_data_size);
528 bio->bi_end_io = io->orig_bi_end_io;
529 bio->bi_status = status;
531 verity_fec_finish_io(io);
536 static void verity_work(struct work_struct *w)
538 struct dm_verity_io *io = container_of(w, struct dm_verity_io, work);
540 verity_finish_io(io, errno_to_blk_status(verity_verify_io(io)));
543 static void verity_end_io(struct bio *bio)
545 struct dm_verity_io *io = bio->bi_private;
547 if (bio->bi_status && !verity_fec_is_enabled(io->v)) {
548 verity_finish_io(io, bio->bi_status);
552 INIT_WORK(&io->work, verity_work);
553 queue_work(io->v->verify_wq, &io->work);
557 * Prefetch buffers for the specified io.
558 * The root buffer is not prefetched, it is assumed that it will be cached
561 static void verity_prefetch_io(struct work_struct *work)
563 struct dm_verity_prefetch_work *pw =
564 container_of(work, struct dm_verity_prefetch_work, work);
565 struct dm_verity *v = pw->v;
568 for (i = v->levels - 2; i >= 0; i--) {
569 sector_t hash_block_start;
570 sector_t hash_block_end;
571 verity_hash_at_level(v, pw->block, i, &hash_block_start, NULL);
572 verity_hash_at_level(v, pw->block + pw->n_blocks - 1, i, &hash_block_end, NULL);
574 unsigned cluster = READ_ONCE(dm_verity_prefetch_cluster);
576 cluster >>= v->data_dev_block_bits;
577 if (unlikely(!cluster))
578 goto no_prefetch_cluster;
580 if (unlikely(cluster & (cluster - 1)))
581 cluster = 1 << __fls(cluster);
583 hash_block_start &= ~(sector_t)(cluster - 1);
584 hash_block_end |= cluster - 1;
585 if (unlikely(hash_block_end >= v->hash_blocks))
586 hash_block_end = v->hash_blocks - 1;
589 dm_bufio_prefetch(v->bufio, hash_block_start,
590 hash_block_end - hash_block_start + 1);
596 static void verity_submit_prefetch(struct dm_verity *v, struct dm_verity_io *io)
598 struct dm_verity_prefetch_work *pw;
600 pw = kmalloc(sizeof(struct dm_verity_prefetch_work),
601 GFP_NOIO | __GFP_NORETRY | __GFP_NOMEMALLOC | __GFP_NOWARN);
606 INIT_WORK(&pw->work, verity_prefetch_io);
608 pw->block = io->block;
609 pw->n_blocks = io->n_blocks;
610 queue_work(v->verify_wq, &pw->work);
614 * Bio map function. It allocates dm_verity_io structure and bio vector and
615 * fills them. Then it issues prefetches and the I/O.
617 static int verity_map(struct dm_target *ti, struct bio *bio)
619 struct dm_verity *v = ti->private;
620 struct dm_verity_io *io;
622 bio_set_dev(bio, v->data_dev->bdev);
623 bio->bi_iter.bi_sector = verity_map_sector(v, bio->bi_iter.bi_sector);
625 if (((unsigned)bio->bi_iter.bi_sector | bio_sectors(bio)) &
626 ((1 << (v->data_dev_block_bits - SECTOR_SHIFT)) - 1)) {
627 DMERR_LIMIT("unaligned io");
628 return DM_MAPIO_KILL;
631 if (bio_end_sector(bio) >>
632 (v->data_dev_block_bits - SECTOR_SHIFT) > v->data_blocks) {
633 DMERR_LIMIT("io out of range");
634 return DM_MAPIO_KILL;
637 if (bio_data_dir(bio) == WRITE)
638 return DM_MAPIO_KILL;
640 io = dm_per_bio_data(bio, ti->per_io_data_size);
642 io->orig_bi_end_io = bio->bi_end_io;
643 io->block = bio->bi_iter.bi_sector >> (v->data_dev_block_bits - SECTOR_SHIFT);
644 io->n_blocks = bio->bi_iter.bi_size >> v->data_dev_block_bits;
646 bio->bi_end_io = verity_end_io;
647 bio->bi_private = io;
648 io->iter = bio->bi_iter;
650 verity_fec_init_io(io);
652 verity_submit_prefetch(v, io);
654 generic_make_request(bio);
656 return DM_MAPIO_SUBMITTED;
660 * Status: V (valid) or C (corruption found)
662 static void verity_status(struct dm_target *ti, status_type_t type,
663 unsigned status_flags, char *result, unsigned maxlen)
665 struct dm_verity *v = ti->private;
671 case STATUSTYPE_INFO:
672 DMEMIT("%c", v->hash_failed ? 'C' : 'V');
674 case STATUSTYPE_TABLE:
675 DMEMIT("%u %s %s %u %u %llu %llu %s ",
679 1 << v->data_dev_block_bits,
680 1 << v->hash_dev_block_bits,
681 (unsigned long long)v->data_blocks,
682 (unsigned long long)v->hash_start,
685 for (x = 0; x < v->digest_size; x++)
686 DMEMIT("%02x", v->root_digest[x]);
691 for (x = 0; x < v->salt_size; x++)
692 DMEMIT("%02x", v->salt[x]);
693 if (v->mode != DM_VERITY_MODE_EIO)
695 if (verity_fec_is_enabled(v))
696 args += DM_VERITY_OPTS_FEC;
699 if (v->validated_blocks)
704 if (v->mode != DM_VERITY_MODE_EIO) {
707 case DM_VERITY_MODE_LOGGING:
708 DMEMIT(DM_VERITY_OPT_LOGGING);
710 case DM_VERITY_MODE_RESTART:
711 DMEMIT(DM_VERITY_OPT_RESTART);
718 DMEMIT(" " DM_VERITY_OPT_IGN_ZEROES);
719 if (v->validated_blocks)
720 DMEMIT(" " DM_VERITY_OPT_AT_MOST_ONCE);
721 sz = verity_fec_status_table(v, sz, result, maxlen);
726 static int verity_prepare_ioctl(struct dm_target *ti, struct block_device **bdev)
728 struct dm_verity *v = ti->private;
730 *bdev = v->data_dev->bdev;
733 ti->len != i_size_read(v->data_dev->bdev->bd_inode) >> SECTOR_SHIFT)
738 static int verity_iterate_devices(struct dm_target *ti,
739 iterate_devices_callout_fn fn, void *data)
741 struct dm_verity *v = ti->private;
743 return fn(ti, v->data_dev, v->data_start, ti->len, data);
746 static void verity_io_hints(struct dm_target *ti, struct queue_limits *limits)
748 struct dm_verity *v = ti->private;
750 if (limits->logical_block_size < 1 << v->data_dev_block_bits)
751 limits->logical_block_size = 1 << v->data_dev_block_bits;
753 if (limits->physical_block_size < 1 << v->data_dev_block_bits)
754 limits->physical_block_size = 1 << v->data_dev_block_bits;
756 blk_limits_io_min(limits, limits->logical_block_size);
759 static void verity_dtr(struct dm_target *ti)
761 struct dm_verity *v = ti->private;
764 destroy_workqueue(v->verify_wq);
767 dm_bufio_client_destroy(v->bufio);
769 kvfree(v->validated_blocks);
771 kfree(v->root_digest);
772 kfree(v->zero_digest);
775 crypto_free_ahash(v->tfm);
780 dm_put_device(ti, v->hash_dev);
783 dm_put_device(ti, v->data_dev);
790 static int verity_alloc_most_once(struct dm_verity *v)
792 struct dm_target *ti = v->ti;
794 /* the bitset can only handle INT_MAX blocks */
795 if (v->data_blocks > INT_MAX) {
796 ti->error = "device too large to use check_at_most_once";
800 v->validated_blocks = kvcalloc(BITS_TO_LONGS(v->data_blocks),
801 sizeof(unsigned long),
803 if (!v->validated_blocks) {
804 ti->error = "failed to allocate bitset for check_at_most_once";
811 static int verity_alloc_zero_digest(struct dm_verity *v)
814 struct ahash_request *req;
817 v->zero_digest = kmalloc(v->digest_size, GFP_KERNEL);
822 req = kmalloc(v->ahash_reqsize, GFP_KERNEL);
825 return r; /* verity_dtr will free zero_digest */
827 zero_data = kzalloc(1 << v->data_dev_block_bits, GFP_KERNEL);
832 r = verity_hash(v, req, zero_data, 1 << v->data_dev_block_bits,
842 static int verity_parse_opt_args(struct dm_arg_set *as, struct dm_verity *v)
846 struct dm_target *ti = v->ti;
847 const char *arg_name;
849 static const struct dm_arg _args[] = {
850 {0, DM_VERITY_OPTS_MAX, "Invalid number of feature args"},
853 r = dm_read_arg_group(_args, as, &argc, &ti->error);
861 arg_name = dm_shift_arg(as);
864 if (!strcasecmp(arg_name, DM_VERITY_OPT_LOGGING)) {
865 v->mode = DM_VERITY_MODE_LOGGING;
868 } else if (!strcasecmp(arg_name, DM_VERITY_OPT_RESTART)) {
869 v->mode = DM_VERITY_MODE_RESTART;
872 } else if (!strcasecmp(arg_name, DM_VERITY_OPT_IGN_ZEROES)) {
873 r = verity_alloc_zero_digest(v);
875 ti->error = "Cannot allocate zero digest";
880 } else if (!strcasecmp(arg_name, DM_VERITY_OPT_AT_MOST_ONCE)) {
881 r = verity_alloc_most_once(v);
886 } else if (verity_is_fec_opt_arg(arg_name)) {
887 r = verity_fec_parse_opt_args(as, v, &argc, arg_name);
893 ti->error = "Unrecognized verity feature request";
895 } while (argc && !r);
902 * <version> The current format is version 1.
903 * Vsn 0 is compatible with original Chromium OS releases.
908 * <the number of data blocks>
912 * <salt> Hex string or "-" if no salt.
914 static int verity_ctr(struct dm_target *ti, unsigned argc, char **argv)
917 struct dm_arg_set as;
919 unsigned long long num_ll;
922 sector_t hash_position;
925 v = kzalloc(sizeof(struct dm_verity), GFP_KERNEL);
927 ti->error = "Cannot allocate verity structure";
933 r = verity_fec_ctr_alloc(v);
937 if ((dm_table_get_mode(ti->table) & ~FMODE_READ)) {
938 ti->error = "Device must be readonly";
944 ti->error = "Not enough arguments";
949 if (sscanf(argv[0], "%u%c", &num, &dummy) != 1 ||
951 ti->error = "Invalid version";
957 r = dm_get_device(ti, argv[1], FMODE_READ, &v->data_dev);
959 ti->error = "Data device lookup failed";
963 r = dm_get_device(ti, argv[2], FMODE_READ, &v->hash_dev);
965 ti->error = "Hash device lookup failed";
969 if (sscanf(argv[3], "%u%c", &num, &dummy) != 1 ||
970 !num || (num & (num - 1)) ||
971 num < bdev_logical_block_size(v->data_dev->bdev) ||
973 ti->error = "Invalid data device block size";
977 v->data_dev_block_bits = __ffs(num);
979 if (sscanf(argv[4], "%u%c", &num, &dummy) != 1 ||
980 !num || (num & (num - 1)) ||
981 num < bdev_logical_block_size(v->hash_dev->bdev) ||
983 ti->error = "Invalid hash device block size";
987 v->hash_dev_block_bits = __ffs(num);
989 if (sscanf(argv[5], "%llu%c", &num_ll, &dummy) != 1 ||
990 (sector_t)(num_ll << (v->data_dev_block_bits - SECTOR_SHIFT))
991 >> (v->data_dev_block_bits - SECTOR_SHIFT) != num_ll) {
992 ti->error = "Invalid data blocks";
996 v->data_blocks = num_ll;
998 if (ti->len > (v->data_blocks << (v->data_dev_block_bits - SECTOR_SHIFT))) {
999 ti->error = "Data device is too small";
1004 if (sscanf(argv[6], "%llu%c", &num_ll, &dummy) != 1 ||
1005 (sector_t)(num_ll << (v->hash_dev_block_bits - SECTOR_SHIFT))
1006 >> (v->hash_dev_block_bits - SECTOR_SHIFT) != num_ll) {
1007 ti->error = "Invalid hash start";
1011 v->hash_start = num_ll;
1013 v->alg_name = kstrdup(argv[7], GFP_KERNEL);
1015 ti->error = "Cannot allocate algorithm name";
1020 v->tfm = crypto_alloc_ahash(v->alg_name, 0, 0);
1021 if (IS_ERR(v->tfm)) {
1022 ti->error = "Cannot initialize hash function";
1023 r = PTR_ERR(v->tfm);
1027 v->digest_size = crypto_ahash_digestsize(v->tfm);
1028 if ((1 << v->hash_dev_block_bits) < v->digest_size * 2) {
1029 ti->error = "Digest size too big";
1033 v->ahash_reqsize = sizeof(struct ahash_request) +
1034 crypto_ahash_reqsize(v->tfm);
1036 v->root_digest = kmalloc(v->digest_size, GFP_KERNEL);
1037 if (!v->root_digest) {
1038 ti->error = "Cannot allocate root digest";
1042 if (strlen(argv[8]) != v->digest_size * 2 ||
1043 hex2bin(v->root_digest, argv[8], v->digest_size)) {
1044 ti->error = "Invalid root digest";
1049 if (strcmp(argv[9], "-")) {
1050 v->salt_size = strlen(argv[9]) / 2;
1051 v->salt = kmalloc(v->salt_size, GFP_KERNEL);
1053 ti->error = "Cannot allocate salt";
1057 if (strlen(argv[9]) != v->salt_size * 2 ||
1058 hex2bin(v->salt, argv[9], v->salt_size)) {
1059 ti->error = "Invalid salt";
1068 /* Optional parameters */
1073 r = verity_parse_opt_args(&as, v);
1078 v->hash_per_block_bits =
1079 __fls((1 << v->hash_dev_block_bits) / v->digest_size);
1083 while (v->hash_per_block_bits * v->levels < 64 &&
1084 (unsigned long long)(v->data_blocks - 1) >>
1085 (v->hash_per_block_bits * v->levels))
1088 if (v->levels > DM_VERITY_MAX_LEVELS) {
1089 ti->error = "Too many tree levels";
1094 hash_position = v->hash_start;
1095 for (i = v->levels - 1; i >= 0; i--) {
1097 v->hash_level_block[i] = hash_position;
1098 s = (v->data_blocks + ((sector_t)1 << ((i + 1) * v->hash_per_block_bits)) - 1)
1099 >> ((i + 1) * v->hash_per_block_bits);
1100 if (hash_position + s < hash_position) {
1101 ti->error = "Hash device offset overflow";
1107 v->hash_blocks = hash_position;
1109 v->bufio = dm_bufio_client_create(v->hash_dev->bdev,
1110 1 << v->hash_dev_block_bits, 1, sizeof(struct buffer_aux),
1111 dm_bufio_alloc_callback, NULL);
1112 if (IS_ERR(v->bufio)) {
1113 ti->error = "Cannot initialize dm-bufio";
1114 r = PTR_ERR(v->bufio);
1119 if (dm_bufio_get_device_size(v->bufio) < v->hash_blocks) {
1120 ti->error = "Hash device is too small";
1125 /* WQ_UNBOUND greatly improves performance when running on ramdisk */
1126 v->verify_wq = alloc_workqueue("kverityd", WQ_CPU_INTENSIVE | WQ_MEM_RECLAIM | WQ_UNBOUND, num_online_cpus());
1127 if (!v->verify_wq) {
1128 ti->error = "Cannot allocate workqueue";
1133 ti->per_io_data_size = sizeof(struct dm_verity_io) +
1134 v->ahash_reqsize + v->digest_size * 2;
1136 r = verity_fec_ctr(v);
1140 ti->per_io_data_size = roundup(ti->per_io_data_size,
1141 __alignof__(struct dm_verity_io));
1151 static struct target_type verity_target = {
1153 .version = {1, 4, 0},
1154 .module = THIS_MODULE,
1158 .status = verity_status,
1159 .prepare_ioctl = verity_prepare_ioctl,
1160 .iterate_devices = verity_iterate_devices,
1161 .io_hints = verity_io_hints,
1164 static int __init dm_verity_init(void)
1168 r = dm_register_target(&verity_target);
1170 DMERR("register failed %d", r);
1175 static void __exit dm_verity_exit(void)
1177 dm_unregister_target(&verity_target);
1180 module_init(dm_verity_init);
1181 module_exit(dm_verity_exit);
1186 MODULE_DESCRIPTION(DM_NAME " target for transparent disk integrity checking");
1187 MODULE_LICENSE("GPL");