Merge tag 'trace-v5.11-rc2' of git://git.kernel.org/pub/scm/linux/kernel/git/rostedt...
[linux/fpc-iii.git] / drivers / md / dm-verity-target.c
blob6b8e5bdd8526d99467182cdf8f1c8faba3183935
1 // SPDX-License-Identifier: GPL-2.0-only
2 /*
3 * Copyright (C) 2012 Red Hat, Inc.
5 * Author: Mikulas Patocka <mpatocka@redhat.com>
7 * Based on Chromium dm-verity driver (C) 2011 The Chromium OS Authors
9 * In the file "/sys/module/dm_verity/parameters/prefetch_cluster" you can set
10 * default prefetch value. Data are read in "prefetch_cluster" chunks from the
11 * hash device. Setting this greatly improves performance when data and hash
12 * are on the same disk on different partitions on devices with poor random
13 * access behavior.
16 #include "dm-verity.h"
17 #include "dm-verity-fec.h"
18 #include "dm-verity-verify-sig.h"
19 #include <linux/module.h>
20 #include <linux/reboot.h>
22 #define DM_MSG_PREFIX "verity"
24 #define DM_VERITY_ENV_LENGTH 42
25 #define DM_VERITY_ENV_VAR_NAME "DM_VERITY_ERR_BLOCK_NR"
27 #define DM_VERITY_DEFAULT_PREFETCH_SIZE 262144
29 #define DM_VERITY_MAX_CORRUPTED_ERRS 100
31 #define DM_VERITY_OPT_LOGGING "ignore_corruption"
32 #define DM_VERITY_OPT_RESTART "restart_on_corruption"
33 #define DM_VERITY_OPT_PANIC "panic_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 + \
38 DM_VERITY_ROOT_HASH_VERIFICATION_OPTS)
40 static unsigned dm_verity_prefetch_cluster = DM_VERITY_DEFAULT_PREFETCH_SIZE;
42 module_param_named(prefetch_cluster, dm_verity_prefetch_cluster, uint, S_IRUGO | S_IWUSR);
44 struct dm_verity_prefetch_work {
45 struct work_struct work;
46 struct dm_verity *v;
47 sector_t block;
48 unsigned n_blocks;
52 * Auxiliary structure appended to each dm-bufio buffer. If the value
53 * hash_verified is nonzero, hash of the block has been verified.
55 * The variable hash_verified is set to 0 when allocating the buffer, then
56 * it can be changed to 1 and it is never reset to 0 again.
58 * There is no lock around this value, a race condition can at worst cause
59 * that multiple processes verify the hash of the same buffer simultaneously
60 * and write 1 to hash_verified simultaneously.
61 * This condition is harmless, so we don't need locking.
63 struct buffer_aux {
64 int hash_verified;
68 * Initialize struct buffer_aux for a freshly created buffer.
70 static void dm_bufio_alloc_callback(struct dm_buffer *buf)
72 struct buffer_aux *aux = dm_bufio_get_aux_data(buf);
74 aux->hash_verified = 0;
78 * Translate input sector number to the sector number on the target device.
80 static sector_t verity_map_sector(struct dm_verity *v, sector_t bi_sector)
82 return v->data_start + dm_target_offset(v->ti, bi_sector);
86 * Return hash position of a specified block at a specified tree level
87 * (0 is the lowest level).
88 * The lowest "hash_per_block_bits"-bits of the result denote hash position
89 * inside a hash block. The remaining bits denote location of the hash block.
91 static sector_t verity_position_at_level(struct dm_verity *v, sector_t block,
92 int level)
94 return block >> (level * v->hash_per_block_bits);
97 static int verity_hash_update(struct dm_verity *v, struct ahash_request *req,
98 const u8 *data, size_t len,
99 struct crypto_wait *wait)
101 struct scatterlist sg;
103 if (likely(!is_vmalloc_addr(data))) {
104 sg_init_one(&sg, data, len);
105 ahash_request_set_crypt(req, &sg, NULL, len);
106 return crypto_wait_req(crypto_ahash_update(req), wait);
107 } else {
108 do {
109 int r;
110 size_t this_step = min_t(size_t, len, PAGE_SIZE - offset_in_page(data));
111 flush_kernel_vmap_range((void *)data, this_step);
112 sg_init_table(&sg, 1);
113 sg_set_page(&sg, vmalloc_to_page(data), this_step, offset_in_page(data));
114 ahash_request_set_crypt(req, &sg, NULL, this_step);
115 r = crypto_wait_req(crypto_ahash_update(req), wait);
116 if (unlikely(r))
117 return r;
118 data += this_step;
119 len -= this_step;
120 } while (len);
121 return 0;
126 * Wrapper for crypto_ahash_init, which handles verity salting.
128 static int verity_hash_init(struct dm_verity *v, struct ahash_request *req,
129 struct crypto_wait *wait)
131 int r;
133 ahash_request_set_tfm(req, v->tfm);
134 ahash_request_set_callback(req, CRYPTO_TFM_REQ_MAY_SLEEP |
135 CRYPTO_TFM_REQ_MAY_BACKLOG,
136 crypto_req_done, (void *)wait);
137 crypto_init_wait(wait);
139 r = crypto_wait_req(crypto_ahash_init(req), wait);
141 if (unlikely(r < 0)) {
142 DMERR("crypto_ahash_init failed: %d", r);
143 return r;
146 if (likely(v->salt_size && (v->version >= 1)))
147 r = verity_hash_update(v, req, v->salt, v->salt_size, wait);
149 return r;
152 static int verity_hash_final(struct dm_verity *v, struct ahash_request *req,
153 u8 *digest, struct crypto_wait *wait)
155 int r;
157 if (unlikely(v->salt_size && (!v->version))) {
158 r = verity_hash_update(v, req, v->salt, v->salt_size, wait);
160 if (r < 0) {
161 DMERR("verity_hash_final failed updating salt: %d", r);
162 goto out;
166 ahash_request_set_crypt(req, NULL, digest, 0);
167 r = crypto_wait_req(crypto_ahash_final(req), wait);
168 out:
169 return r;
172 int verity_hash(struct dm_verity *v, struct ahash_request *req,
173 const u8 *data, size_t len, u8 *digest)
175 int r;
176 struct crypto_wait wait;
178 r = verity_hash_init(v, req, &wait);
179 if (unlikely(r < 0))
180 goto out;
182 r = verity_hash_update(v, req, data, len, &wait);
183 if (unlikely(r < 0))
184 goto out;
186 r = verity_hash_final(v, req, digest, &wait);
188 out:
189 return r;
192 static void verity_hash_at_level(struct dm_verity *v, sector_t block, int level,
193 sector_t *hash_block, unsigned *offset)
195 sector_t position = verity_position_at_level(v, block, level);
196 unsigned idx;
198 *hash_block = v->hash_level_block[level] + (position >> v->hash_per_block_bits);
200 if (!offset)
201 return;
203 idx = position & ((1 << v->hash_per_block_bits) - 1);
204 if (!v->version)
205 *offset = idx * v->digest_size;
206 else
207 *offset = idx << (v->hash_dev_block_bits - v->hash_per_block_bits);
211 * Handle verification errors.
213 static int verity_handle_err(struct dm_verity *v, enum verity_block_type type,
214 unsigned long long block)
216 char verity_env[DM_VERITY_ENV_LENGTH];
217 char *envp[] = { verity_env, NULL };
218 const char *type_str = "";
219 struct mapped_device *md = dm_table_get_md(v->ti->table);
221 /* Corruption should be visible in device status in all modes */
222 v->hash_failed = 1;
224 if (v->corrupted_errs >= DM_VERITY_MAX_CORRUPTED_ERRS)
225 goto out;
227 v->corrupted_errs++;
229 switch (type) {
230 case DM_VERITY_BLOCK_TYPE_DATA:
231 type_str = "data";
232 break;
233 case DM_VERITY_BLOCK_TYPE_METADATA:
234 type_str = "metadata";
235 break;
236 default:
237 BUG();
240 DMERR_LIMIT("%s: %s block %llu is corrupted", v->data_dev->name,
241 type_str, block);
243 if (v->corrupted_errs == DM_VERITY_MAX_CORRUPTED_ERRS)
244 DMERR("%s: reached maximum errors", v->data_dev->name);
246 snprintf(verity_env, DM_VERITY_ENV_LENGTH, "%s=%d,%llu",
247 DM_VERITY_ENV_VAR_NAME, type, block);
249 kobject_uevent_env(&disk_to_dev(dm_disk(md))->kobj, KOBJ_CHANGE, envp);
251 out:
252 if (v->mode == DM_VERITY_MODE_LOGGING)
253 return 0;
255 if (v->mode == DM_VERITY_MODE_RESTART)
256 kernel_restart("dm-verity device corrupted");
258 if (v->mode == DM_VERITY_MODE_PANIC)
259 panic("dm-verity device corrupted");
261 return 1;
265 * Verify hash of a metadata block pertaining to the specified data block
266 * ("block" argument) at a specified level ("level" argument).
268 * On successful return, verity_io_want_digest(v, io) contains the hash value
269 * for a lower tree level or for the data block (if we're at the lowest level).
271 * If "skip_unverified" is true, unverified buffer is skipped and 1 is returned.
272 * If "skip_unverified" is false, unverified buffer is hashed and verified
273 * against current value of verity_io_want_digest(v, io).
275 static int verity_verify_level(struct dm_verity *v, struct dm_verity_io *io,
276 sector_t block, int level, bool skip_unverified,
277 u8 *want_digest)
279 struct dm_buffer *buf;
280 struct buffer_aux *aux;
281 u8 *data;
282 int r;
283 sector_t hash_block;
284 unsigned offset;
286 verity_hash_at_level(v, block, level, &hash_block, &offset);
288 data = dm_bufio_read(v->bufio, hash_block, &buf);
289 if (IS_ERR(data))
290 return PTR_ERR(data);
292 aux = dm_bufio_get_aux_data(buf);
294 if (!aux->hash_verified) {
295 if (skip_unverified) {
296 r = 1;
297 goto release_ret_r;
300 r = verity_hash(v, verity_io_hash_req(v, io),
301 data, 1 << v->hash_dev_block_bits,
302 verity_io_real_digest(v, io));
303 if (unlikely(r < 0))
304 goto release_ret_r;
306 if (likely(memcmp(verity_io_real_digest(v, io), want_digest,
307 v->digest_size) == 0))
308 aux->hash_verified = 1;
309 else if (verity_fec_decode(v, io,
310 DM_VERITY_BLOCK_TYPE_METADATA,
311 hash_block, data, NULL) == 0)
312 aux->hash_verified = 1;
313 else if (verity_handle_err(v,
314 DM_VERITY_BLOCK_TYPE_METADATA,
315 hash_block)) {
316 r = -EIO;
317 goto release_ret_r;
321 data += offset;
322 memcpy(want_digest, data, v->digest_size);
323 r = 0;
325 release_ret_r:
326 dm_bufio_release(buf);
327 return r;
331 * Find a hash for a given block, write it to digest and verify the integrity
332 * of the hash tree if necessary.
334 int verity_hash_for_block(struct dm_verity *v, struct dm_verity_io *io,
335 sector_t block, u8 *digest, bool *is_zero)
337 int r = 0, i;
339 if (likely(v->levels)) {
341 * First, we try to get the requested hash for
342 * the current block. If the hash block itself is
343 * verified, zero is returned. If it isn't, this
344 * function returns 1 and we fall back to whole
345 * chain verification.
347 r = verity_verify_level(v, io, block, 0, true, digest);
348 if (likely(r <= 0))
349 goto out;
352 memcpy(digest, v->root_digest, v->digest_size);
354 for (i = v->levels - 1; i >= 0; i--) {
355 r = verity_verify_level(v, io, block, i, false, digest);
356 if (unlikely(r))
357 goto out;
359 out:
360 if (!r && v->zero_digest)
361 *is_zero = !memcmp(v->zero_digest, digest, v->digest_size);
362 else
363 *is_zero = false;
365 return r;
369 * Calculates the digest for the given bio
371 static int verity_for_io_block(struct dm_verity *v, struct dm_verity_io *io,
372 struct bvec_iter *iter, struct crypto_wait *wait)
374 unsigned int todo = 1 << v->data_dev_block_bits;
375 struct bio *bio = dm_bio_from_per_bio_data(io, v->ti->per_io_data_size);
376 struct scatterlist sg;
377 struct ahash_request *req = verity_io_hash_req(v, io);
379 do {
380 int r;
381 unsigned int len;
382 struct bio_vec bv = bio_iter_iovec(bio, *iter);
384 sg_init_table(&sg, 1);
386 len = bv.bv_len;
388 if (likely(len >= todo))
389 len = todo;
391 * Operating on a single page at a time looks suboptimal
392 * until you consider the typical block size is 4,096B.
393 * Going through this loops twice should be very rare.
395 sg_set_page(&sg, bv.bv_page, len, bv.bv_offset);
396 ahash_request_set_crypt(req, &sg, NULL, len);
397 r = crypto_wait_req(crypto_ahash_update(req), wait);
399 if (unlikely(r < 0)) {
400 DMERR("verity_for_io_block crypto op failed: %d", r);
401 return r;
404 bio_advance_iter(bio, iter, len);
405 todo -= len;
406 } while (todo);
408 return 0;
412 * Calls function process for 1 << v->data_dev_block_bits bytes in the bio_vec
413 * starting from iter.
415 int verity_for_bv_block(struct dm_verity *v, struct dm_verity_io *io,
416 struct bvec_iter *iter,
417 int (*process)(struct dm_verity *v,
418 struct dm_verity_io *io, u8 *data,
419 size_t len))
421 unsigned todo = 1 << v->data_dev_block_bits;
422 struct bio *bio = dm_bio_from_per_bio_data(io, v->ti->per_io_data_size);
424 do {
425 int r;
426 u8 *page;
427 unsigned len;
428 struct bio_vec bv = bio_iter_iovec(bio, *iter);
430 page = kmap_atomic(bv.bv_page);
431 len = bv.bv_len;
433 if (likely(len >= todo))
434 len = todo;
436 r = process(v, io, page + bv.bv_offset, len);
437 kunmap_atomic(page);
439 if (r < 0)
440 return r;
442 bio_advance_iter(bio, iter, len);
443 todo -= len;
444 } while (todo);
446 return 0;
449 static int verity_bv_zero(struct dm_verity *v, struct dm_verity_io *io,
450 u8 *data, size_t len)
452 memset(data, 0, len);
453 return 0;
457 * Moves the bio iter one data block forward.
459 static inline void verity_bv_skip_block(struct dm_verity *v,
460 struct dm_verity_io *io,
461 struct bvec_iter *iter)
463 struct bio *bio = dm_bio_from_per_bio_data(io, v->ti->per_io_data_size);
465 bio_advance_iter(bio, iter, 1 << v->data_dev_block_bits);
469 * Verify one "dm_verity_io" structure.
471 static int verity_verify_io(struct dm_verity_io *io)
473 bool is_zero;
474 struct dm_verity *v = io->v;
475 struct bvec_iter start;
476 unsigned b;
477 struct crypto_wait wait;
479 for (b = 0; b < io->n_blocks; b++) {
480 int r;
481 sector_t cur_block = io->block + b;
482 struct ahash_request *req = verity_io_hash_req(v, io);
484 if (v->validated_blocks &&
485 likely(test_bit(cur_block, v->validated_blocks))) {
486 verity_bv_skip_block(v, io, &io->iter);
487 continue;
490 r = verity_hash_for_block(v, io, cur_block,
491 verity_io_want_digest(v, io),
492 &is_zero);
493 if (unlikely(r < 0))
494 return r;
496 if (is_zero) {
498 * If we expect a zero block, don't validate, just
499 * return zeros.
501 r = verity_for_bv_block(v, io, &io->iter,
502 verity_bv_zero);
503 if (unlikely(r < 0))
504 return r;
506 continue;
509 r = verity_hash_init(v, req, &wait);
510 if (unlikely(r < 0))
511 return r;
513 start = io->iter;
514 r = verity_for_io_block(v, io, &io->iter, &wait);
515 if (unlikely(r < 0))
516 return r;
518 r = verity_hash_final(v, req, verity_io_real_digest(v, io),
519 &wait);
520 if (unlikely(r < 0))
521 return r;
523 if (likely(memcmp(verity_io_real_digest(v, io),
524 verity_io_want_digest(v, io), v->digest_size) == 0)) {
525 if (v->validated_blocks)
526 set_bit(cur_block, v->validated_blocks);
527 continue;
529 else if (verity_fec_decode(v, io, DM_VERITY_BLOCK_TYPE_DATA,
530 cur_block, NULL, &start) == 0)
531 continue;
532 else if (verity_handle_err(v, DM_VERITY_BLOCK_TYPE_DATA,
533 cur_block))
534 return -EIO;
537 return 0;
541 * Skip verity work in response to I/O error when system is shutting down.
543 static inline bool verity_is_system_shutting_down(void)
545 return system_state == SYSTEM_HALT || system_state == SYSTEM_POWER_OFF
546 || system_state == SYSTEM_RESTART;
550 * End one "io" structure with a given error.
552 static void verity_finish_io(struct dm_verity_io *io, blk_status_t status)
554 struct dm_verity *v = io->v;
555 struct bio *bio = dm_bio_from_per_bio_data(io, v->ti->per_io_data_size);
557 bio->bi_end_io = io->orig_bi_end_io;
558 bio->bi_status = status;
560 verity_fec_finish_io(io);
562 bio_endio(bio);
565 static void verity_work(struct work_struct *w)
567 struct dm_verity_io *io = container_of(w, struct dm_verity_io, work);
569 verity_finish_io(io, errno_to_blk_status(verity_verify_io(io)));
572 static void verity_end_io(struct bio *bio)
574 struct dm_verity_io *io = bio->bi_private;
576 if (bio->bi_status &&
577 (!verity_fec_is_enabled(io->v) || verity_is_system_shutting_down())) {
578 verity_finish_io(io, bio->bi_status);
579 return;
582 INIT_WORK(&io->work, verity_work);
583 queue_work(io->v->verify_wq, &io->work);
587 * Prefetch buffers for the specified io.
588 * The root buffer is not prefetched, it is assumed that it will be cached
589 * all the time.
591 static void verity_prefetch_io(struct work_struct *work)
593 struct dm_verity_prefetch_work *pw =
594 container_of(work, struct dm_verity_prefetch_work, work);
595 struct dm_verity *v = pw->v;
596 int i;
598 for (i = v->levels - 2; i >= 0; i--) {
599 sector_t hash_block_start;
600 sector_t hash_block_end;
601 verity_hash_at_level(v, pw->block, i, &hash_block_start, NULL);
602 verity_hash_at_level(v, pw->block + pw->n_blocks - 1, i, &hash_block_end, NULL);
603 if (!i) {
604 unsigned cluster = READ_ONCE(dm_verity_prefetch_cluster);
606 cluster >>= v->data_dev_block_bits;
607 if (unlikely(!cluster))
608 goto no_prefetch_cluster;
610 if (unlikely(cluster & (cluster - 1)))
611 cluster = 1 << __fls(cluster);
613 hash_block_start &= ~(sector_t)(cluster - 1);
614 hash_block_end |= cluster - 1;
615 if (unlikely(hash_block_end >= v->hash_blocks))
616 hash_block_end = v->hash_blocks - 1;
618 no_prefetch_cluster:
619 dm_bufio_prefetch(v->bufio, hash_block_start,
620 hash_block_end - hash_block_start + 1);
623 kfree(pw);
626 static void verity_submit_prefetch(struct dm_verity *v, struct dm_verity_io *io)
628 sector_t block = io->block;
629 unsigned int n_blocks = io->n_blocks;
630 struct dm_verity_prefetch_work *pw;
632 if (v->validated_blocks) {
633 while (n_blocks && test_bit(block, v->validated_blocks)) {
634 block++;
635 n_blocks--;
637 while (n_blocks && test_bit(block + n_blocks - 1,
638 v->validated_blocks))
639 n_blocks--;
640 if (!n_blocks)
641 return;
644 pw = kmalloc(sizeof(struct dm_verity_prefetch_work),
645 GFP_NOIO | __GFP_NORETRY | __GFP_NOMEMALLOC | __GFP_NOWARN);
647 if (!pw)
648 return;
650 INIT_WORK(&pw->work, verity_prefetch_io);
651 pw->v = v;
652 pw->block = block;
653 pw->n_blocks = n_blocks;
654 queue_work(v->verify_wq, &pw->work);
658 * Bio map function. It allocates dm_verity_io structure and bio vector and
659 * fills them. Then it issues prefetches and the I/O.
661 static int verity_map(struct dm_target *ti, struct bio *bio)
663 struct dm_verity *v = ti->private;
664 struct dm_verity_io *io;
666 bio_set_dev(bio, v->data_dev->bdev);
667 bio->bi_iter.bi_sector = verity_map_sector(v, bio->bi_iter.bi_sector);
669 if (((unsigned)bio->bi_iter.bi_sector | bio_sectors(bio)) &
670 ((1 << (v->data_dev_block_bits - SECTOR_SHIFT)) - 1)) {
671 DMERR_LIMIT("unaligned io");
672 return DM_MAPIO_KILL;
675 if (bio_end_sector(bio) >>
676 (v->data_dev_block_bits - SECTOR_SHIFT) > v->data_blocks) {
677 DMERR_LIMIT("io out of range");
678 return DM_MAPIO_KILL;
681 if (bio_data_dir(bio) == WRITE)
682 return DM_MAPIO_KILL;
684 io = dm_per_bio_data(bio, ti->per_io_data_size);
685 io->v = v;
686 io->orig_bi_end_io = bio->bi_end_io;
687 io->block = bio->bi_iter.bi_sector >> (v->data_dev_block_bits - SECTOR_SHIFT);
688 io->n_blocks = bio->bi_iter.bi_size >> v->data_dev_block_bits;
690 bio->bi_end_io = verity_end_io;
691 bio->bi_private = io;
692 io->iter = bio->bi_iter;
694 verity_fec_init_io(io);
696 verity_submit_prefetch(v, io);
698 submit_bio_noacct(bio);
700 return DM_MAPIO_SUBMITTED;
704 * Status: V (valid) or C (corruption found)
706 static void verity_status(struct dm_target *ti, status_type_t type,
707 unsigned status_flags, char *result, unsigned maxlen)
709 struct dm_verity *v = ti->private;
710 unsigned args = 0;
711 unsigned sz = 0;
712 unsigned x;
714 switch (type) {
715 case STATUSTYPE_INFO:
716 DMEMIT("%c", v->hash_failed ? 'C' : 'V');
717 break;
718 case STATUSTYPE_TABLE:
719 DMEMIT("%u %s %s %u %u %llu %llu %s ",
720 v->version,
721 v->data_dev->name,
722 v->hash_dev->name,
723 1 << v->data_dev_block_bits,
724 1 << v->hash_dev_block_bits,
725 (unsigned long long)v->data_blocks,
726 (unsigned long long)v->hash_start,
727 v->alg_name
729 for (x = 0; x < v->digest_size; x++)
730 DMEMIT("%02x", v->root_digest[x]);
731 DMEMIT(" ");
732 if (!v->salt_size)
733 DMEMIT("-");
734 else
735 for (x = 0; x < v->salt_size; x++)
736 DMEMIT("%02x", v->salt[x]);
737 if (v->mode != DM_VERITY_MODE_EIO)
738 args++;
739 if (verity_fec_is_enabled(v))
740 args += DM_VERITY_OPTS_FEC;
741 if (v->zero_digest)
742 args++;
743 if (v->validated_blocks)
744 args++;
745 if (v->signature_key_desc)
746 args += DM_VERITY_ROOT_HASH_VERIFICATION_OPTS;
747 if (!args)
748 return;
749 DMEMIT(" %u", args);
750 if (v->mode != DM_VERITY_MODE_EIO) {
751 DMEMIT(" ");
752 switch (v->mode) {
753 case DM_VERITY_MODE_LOGGING:
754 DMEMIT(DM_VERITY_OPT_LOGGING);
755 break;
756 case DM_VERITY_MODE_RESTART:
757 DMEMIT(DM_VERITY_OPT_RESTART);
758 break;
759 case DM_VERITY_MODE_PANIC:
760 DMEMIT(DM_VERITY_OPT_PANIC);
761 break;
762 default:
763 BUG();
766 if (v->zero_digest)
767 DMEMIT(" " DM_VERITY_OPT_IGN_ZEROES);
768 if (v->validated_blocks)
769 DMEMIT(" " DM_VERITY_OPT_AT_MOST_ONCE);
770 sz = verity_fec_status_table(v, sz, result, maxlen);
771 if (v->signature_key_desc)
772 DMEMIT(" " DM_VERITY_ROOT_HASH_VERIFICATION_OPT_SIG_KEY
773 " %s", v->signature_key_desc);
774 break;
778 static int verity_prepare_ioctl(struct dm_target *ti, struct block_device **bdev)
780 struct dm_verity *v = ti->private;
782 *bdev = v->data_dev->bdev;
784 if (v->data_start ||
785 ti->len != i_size_read(v->data_dev->bdev->bd_inode) >> SECTOR_SHIFT)
786 return 1;
787 return 0;
790 static int verity_iterate_devices(struct dm_target *ti,
791 iterate_devices_callout_fn fn, void *data)
793 struct dm_verity *v = ti->private;
795 return fn(ti, v->data_dev, v->data_start, ti->len, data);
798 static void verity_io_hints(struct dm_target *ti, struct queue_limits *limits)
800 struct dm_verity *v = ti->private;
802 if (limits->logical_block_size < 1 << v->data_dev_block_bits)
803 limits->logical_block_size = 1 << v->data_dev_block_bits;
805 if (limits->physical_block_size < 1 << v->data_dev_block_bits)
806 limits->physical_block_size = 1 << v->data_dev_block_bits;
808 blk_limits_io_min(limits, limits->logical_block_size);
811 static void verity_dtr(struct dm_target *ti)
813 struct dm_verity *v = ti->private;
815 if (v->verify_wq)
816 destroy_workqueue(v->verify_wq);
818 if (v->bufio)
819 dm_bufio_client_destroy(v->bufio);
821 kvfree(v->validated_blocks);
822 kfree(v->salt);
823 kfree(v->root_digest);
824 kfree(v->zero_digest);
826 if (v->tfm)
827 crypto_free_ahash(v->tfm);
829 kfree(v->alg_name);
831 if (v->hash_dev)
832 dm_put_device(ti, v->hash_dev);
834 if (v->data_dev)
835 dm_put_device(ti, v->data_dev);
837 verity_fec_dtr(v);
839 kfree(v->signature_key_desc);
841 kfree(v);
844 static int verity_alloc_most_once(struct dm_verity *v)
846 struct dm_target *ti = v->ti;
848 /* the bitset can only handle INT_MAX blocks */
849 if (v->data_blocks > INT_MAX) {
850 ti->error = "device too large to use check_at_most_once";
851 return -E2BIG;
854 v->validated_blocks = kvcalloc(BITS_TO_LONGS(v->data_blocks),
855 sizeof(unsigned long),
856 GFP_KERNEL);
857 if (!v->validated_blocks) {
858 ti->error = "failed to allocate bitset for check_at_most_once";
859 return -ENOMEM;
862 return 0;
865 static int verity_alloc_zero_digest(struct dm_verity *v)
867 int r = -ENOMEM;
868 struct ahash_request *req;
869 u8 *zero_data;
871 v->zero_digest = kmalloc(v->digest_size, GFP_KERNEL);
873 if (!v->zero_digest)
874 return r;
876 req = kmalloc(v->ahash_reqsize, GFP_KERNEL);
878 if (!req)
879 return r; /* verity_dtr will free zero_digest */
881 zero_data = kzalloc(1 << v->data_dev_block_bits, GFP_KERNEL);
883 if (!zero_data)
884 goto out;
886 r = verity_hash(v, req, zero_data, 1 << v->data_dev_block_bits,
887 v->zero_digest);
889 out:
890 kfree(req);
891 kfree(zero_data);
893 return r;
896 static int verity_parse_opt_args(struct dm_arg_set *as, struct dm_verity *v,
897 struct dm_verity_sig_opts *verify_args)
899 int r;
900 unsigned argc;
901 struct dm_target *ti = v->ti;
902 const char *arg_name;
904 static const struct dm_arg _args[] = {
905 {0, DM_VERITY_OPTS_MAX, "Invalid number of feature args"},
908 r = dm_read_arg_group(_args, as, &argc, &ti->error);
909 if (r)
910 return -EINVAL;
912 if (!argc)
913 return 0;
915 do {
916 arg_name = dm_shift_arg(as);
917 argc--;
919 if (!strcasecmp(arg_name, DM_VERITY_OPT_LOGGING)) {
920 v->mode = DM_VERITY_MODE_LOGGING;
921 continue;
923 } else if (!strcasecmp(arg_name, DM_VERITY_OPT_RESTART)) {
924 v->mode = DM_VERITY_MODE_RESTART;
925 continue;
927 } else if (!strcasecmp(arg_name, DM_VERITY_OPT_PANIC)) {
928 v->mode = DM_VERITY_MODE_PANIC;
929 continue;
931 } else if (!strcasecmp(arg_name, DM_VERITY_OPT_IGN_ZEROES)) {
932 r = verity_alloc_zero_digest(v);
933 if (r) {
934 ti->error = "Cannot allocate zero digest";
935 return r;
937 continue;
939 } else if (!strcasecmp(arg_name, DM_VERITY_OPT_AT_MOST_ONCE)) {
940 r = verity_alloc_most_once(v);
941 if (r)
942 return r;
943 continue;
945 } else if (verity_is_fec_opt_arg(arg_name)) {
946 r = verity_fec_parse_opt_args(as, v, &argc, arg_name);
947 if (r)
948 return r;
949 continue;
950 } else if (verity_verify_is_sig_opt_arg(arg_name)) {
951 r = verity_verify_sig_parse_opt_args(as, v,
952 verify_args,
953 &argc, arg_name);
954 if (r)
955 return r;
956 continue;
960 ti->error = "Unrecognized verity feature request";
961 return -EINVAL;
962 } while (argc && !r);
964 return r;
968 * Target parameters:
969 * <version> The current format is version 1.
970 * Vsn 0 is compatible with original Chromium OS releases.
971 * <data device>
972 * <hash device>
973 * <data block size>
974 * <hash block size>
975 * <the number of data blocks>
976 * <hash start block>
977 * <algorithm>
978 * <digest>
979 * <salt> Hex string or "-" if no salt.
981 static int verity_ctr(struct dm_target *ti, unsigned argc, char **argv)
983 struct dm_verity *v;
984 struct dm_verity_sig_opts verify_args = {0};
985 struct dm_arg_set as;
986 unsigned int num;
987 unsigned long long num_ll;
988 int r;
989 int i;
990 sector_t hash_position;
991 char dummy;
992 char *root_hash_digest_to_validate;
994 v = kzalloc(sizeof(struct dm_verity), GFP_KERNEL);
995 if (!v) {
996 ti->error = "Cannot allocate verity structure";
997 return -ENOMEM;
999 ti->private = v;
1000 v->ti = ti;
1002 r = verity_fec_ctr_alloc(v);
1003 if (r)
1004 goto bad;
1006 if ((dm_table_get_mode(ti->table) & ~FMODE_READ)) {
1007 ti->error = "Device must be readonly";
1008 r = -EINVAL;
1009 goto bad;
1012 if (argc < 10) {
1013 ti->error = "Not enough arguments";
1014 r = -EINVAL;
1015 goto bad;
1018 if (sscanf(argv[0], "%u%c", &num, &dummy) != 1 ||
1019 num > 1) {
1020 ti->error = "Invalid version";
1021 r = -EINVAL;
1022 goto bad;
1024 v->version = num;
1026 r = dm_get_device(ti, argv[1], FMODE_READ, &v->data_dev);
1027 if (r) {
1028 ti->error = "Data device lookup failed";
1029 goto bad;
1032 r = dm_get_device(ti, argv[2], FMODE_READ, &v->hash_dev);
1033 if (r) {
1034 ti->error = "Hash device lookup failed";
1035 goto bad;
1038 if (sscanf(argv[3], "%u%c", &num, &dummy) != 1 ||
1039 !num || (num & (num - 1)) ||
1040 num < bdev_logical_block_size(v->data_dev->bdev) ||
1041 num > PAGE_SIZE) {
1042 ti->error = "Invalid data device block size";
1043 r = -EINVAL;
1044 goto bad;
1046 v->data_dev_block_bits = __ffs(num);
1048 if (sscanf(argv[4], "%u%c", &num, &dummy) != 1 ||
1049 !num || (num & (num - 1)) ||
1050 num < bdev_logical_block_size(v->hash_dev->bdev) ||
1051 num > INT_MAX) {
1052 ti->error = "Invalid hash device block size";
1053 r = -EINVAL;
1054 goto bad;
1056 v->hash_dev_block_bits = __ffs(num);
1058 if (sscanf(argv[5], "%llu%c", &num_ll, &dummy) != 1 ||
1059 (sector_t)(num_ll << (v->data_dev_block_bits - SECTOR_SHIFT))
1060 >> (v->data_dev_block_bits - SECTOR_SHIFT) != num_ll) {
1061 ti->error = "Invalid data blocks";
1062 r = -EINVAL;
1063 goto bad;
1065 v->data_blocks = num_ll;
1067 if (ti->len > (v->data_blocks << (v->data_dev_block_bits - SECTOR_SHIFT))) {
1068 ti->error = "Data device is too small";
1069 r = -EINVAL;
1070 goto bad;
1073 if (sscanf(argv[6], "%llu%c", &num_ll, &dummy) != 1 ||
1074 (sector_t)(num_ll << (v->hash_dev_block_bits - SECTOR_SHIFT))
1075 >> (v->hash_dev_block_bits - SECTOR_SHIFT) != num_ll) {
1076 ti->error = "Invalid hash start";
1077 r = -EINVAL;
1078 goto bad;
1080 v->hash_start = num_ll;
1082 v->alg_name = kstrdup(argv[7], GFP_KERNEL);
1083 if (!v->alg_name) {
1084 ti->error = "Cannot allocate algorithm name";
1085 r = -ENOMEM;
1086 goto bad;
1089 v->tfm = crypto_alloc_ahash(v->alg_name, 0, 0);
1090 if (IS_ERR(v->tfm)) {
1091 ti->error = "Cannot initialize hash function";
1092 r = PTR_ERR(v->tfm);
1093 v->tfm = NULL;
1094 goto bad;
1098 * dm-verity performance can vary greatly depending on which hash
1099 * algorithm implementation is used. Help people debug performance
1100 * problems by logging the ->cra_driver_name.
1102 DMINFO("%s using implementation \"%s\"", v->alg_name,
1103 crypto_hash_alg_common(v->tfm)->base.cra_driver_name);
1105 v->digest_size = crypto_ahash_digestsize(v->tfm);
1106 if ((1 << v->hash_dev_block_bits) < v->digest_size * 2) {
1107 ti->error = "Digest size too big";
1108 r = -EINVAL;
1109 goto bad;
1111 v->ahash_reqsize = sizeof(struct ahash_request) +
1112 crypto_ahash_reqsize(v->tfm);
1114 v->root_digest = kmalloc(v->digest_size, GFP_KERNEL);
1115 if (!v->root_digest) {
1116 ti->error = "Cannot allocate root digest";
1117 r = -ENOMEM;
1118 goto bad;
1120 if (strlen(argv[8]) != v->digest_size * 2 ||
1121 hex2bin(v->root_digest, argv[8], v->digest_size)) {
1122 ti->error = "Invalid root digest";
1123 r = -EINVAL;
1124 goto bad;
1126 root_hash_digest_to_validate = argv[8];
1128 if (strcmp(argv[9], "-")) {
1129 v->salt_size = strlen(argv[9]) / 2;
1130 v->salt = kmalloc(v->salt_size, GFP_KERNEL);
1131 if (!v->salt) {
1132 ti->error = "Cannot allocate salt";
1133 r = -ENOMEM;
1134 goto bad;
1136 if (strlen(argv[9]) != v->salt_size * 2 ||
1137 hex2bin(v->salt, argv[9], v->salt_size)) {
1138 ti->error = "Invalid salt";
1139 r = -EINVAL;
1140 goto bad;
1144 argv += 10;
1145 argc -= 10;
1147 /* Optional parameters */
1148 if (argc) {
1149 as.argc = argc;
1150 as.argv = argv;
1152 r = verity_parse_opt_args(&as, v, &verify_args);
1153 if (r < 0)
1154 goto bad;
1157 /* Root hash signature is a optional parameter*/
1158 r = verity_verify_root_hash(root_hash_digest_to_validate,
1159 strlen(root_hash_digest_to_validate),
1160 verify_args.sig,
1161 verify_args.sig_size);
1162 if (r < 0) {
1163 ti->error = "Root hash verification failed";
1164 goto bad;
1166 v->hash_per_block_bits =
1167 __fls((1 << v->hash_dev_block_bits) / v->digest_size);
1169 v->levels = 0;
1170 if (v->data_blocks)
1171 while (v->hash_per_block_bits * v->levels < 64 &&
1172 (unsigned long long)(v->data_blocks - 1) >>
1173 (v->hash_per_block_bits * v->levels))
1174 v->levels++;
1176 if (v->levels > DM_VERITY_MAX_LEVELS) {
1177 ti->error = "Too many tree levels";
1178 r = -E2BIG;
1179 goto bad;
1182 hash_position = v->hash_start;
1183 for (i = v->levels - 1; i >= 0; i--) {
1184 sector_t s;
1185 v->hash_level_block[i] = hash_position;
1186 s = (v->data_blocks + ((sector_t)1 << ((i + 1) * v->hash_per_block_bits)) - 1)
1187 >> ((i + 1) * v->hash_per_block_bits);
1188 if (hash_position + s < hash_position) {
1189 ti->error = "Hash device offset overflow";
1190 r = -E2BIG;
1191 goto bad;
1193 hash_position += s;
1195 v->hash_blocks = hash_position;
1197 v->bufio = dm_bufio_client_create(v->hash_dev->bdev,
1198 1 << v->hash_dev_block_bits, 1, sizeof(struct buffer_aux),
1199 dm_bufio_alloc_callback, NULL);
1200 if (IS_ERR(v->bufio)) {
1201 ti->error = "Cannot initialize dm-bufio";
1202 r = PTR_ERR(v->bufio);
1203 v->bufio = NULL;
1204 goto bad;
1207 if (dm_bufio_get_device_size(v->bufio) < v->hash_blocks) {
1208 ti->error = "Hash device is too small";
1209 r = -E2BIG;
1210 goto bad;
1213 /* WQ_UNBOUND greatly improves performance when running on ramdisk */
1214 v->verify_wq = alloc_workqueue("kverityd", WQ_CPU_INTENSIVE | WQ_MEM_RECLAIM | WQ_UNBOUND, num_online_cpus());
1215 if (!v->verify_wq) {
1216 ti->error = "Cannot allocate workqueue";
1217 r = -ENOMEM;
1218 goto bad;
1221 ti->per_io_data_size = sizeof(struct dm_verity_io) +
1222 v->ahash_reqsize + v->digest_size * 2;
1224 r = verity_fec_ctr(v);
1225 if (r)
1226 goto bad;
1228 ti->per_io_data_size = roundup(ti->per_io_data_size,
1229 __alignof__(struct dm_verity_io));
1231 verity_verify_sig_opts_cleanup(&verify_args);
1233 return 0;
1235 bad:
1237 verity_verify_sig_opts_cleanup(&verify_args);
1238 verity_dtr(ti);
1240 return r;
1243 static struct target_type verity_target = {
1244 .name = "verity",
1245 .version = {1, 7, 0},
1246 .module = THIS_MODULE,
1247 .ctr = verity_ctr,
1248 .dtr = verity_dtr,
1249 .map = verity_map,
1250 .status = verity_status,
1251 .prepare_ioctl = verity_prepare_ioctl,
1252 .iterate_devices = verity_iterate_devices,
1253 .io_hints = verity_io_hints,
1256 static int __init dm_verity_init(void)
1258 int r;
1260 r = dm_register_target(&verity_target);
1261 if (r < 0)
1262 DMERR("register failed %d", r);
1264 return r;
1267 static void __exit dm_verity_exit(void)
1269 dm_unregister_target(&verity_target);
1272 module_init(dm_verity_init);
1273 module_exit(dm_verity_exit);
1275 MODULE_AUTHOR("Mikulas Patocka <mpatocka@redhat.com>");
1276 MODULE_AUTHOR("Mandeep Baines <msb@chromium.org>");
1277 MODULE_AUTHOR("Will Drewry <wad@chromium.org>");
1278 MODULE_DESCRIPTION(DM_NAME " target for transparent disk integrity checking");
1279 MODULE_LICENSE("GPL");