blob: 02a547f0667c13c74c159dd04cb45f83b84f05fc [file] [log] [blame]
Eric Biggers671e67b2019-07-22 09:26:21 -07001/* SPDX-License-Identifier: GPL-2.0 */
2/*
3 * fs-verity: read-only file-based authenticity protection
4 *
5 * Copyright 2019 Google LLC
6 */
7
8#ifndef _FSVERITY_PRIVATE_H
9#define _FSVERITY_PRIVATE_H
10
11#ifdef CONFIG_FS_VERITY_DEBUG
12#define DEBUG
13#endif
14
15#define pr_fmt(fmt) "fs-verity: " fmt
16
17#include <crypto/sha.h>
Eric Biggersfd2d1ac2019-07-22 09:26:22 -070018#include <linux/fsverity.h>
Eric Biggers671e67b2019-07-22 09:26:21 -070019
20struct ahash_request;
21
22/*
23 * Implementation limit: maximum depth of the Merkle tree. For now 8 is plenty;
24 * it's enough for over U64_MAX bytes of data using SHA-256 and 4K blocks.
25 */
26#define FS_VERITY_MAX_LEVELS 8
27
28/*
29 * Largest digest size among all hash algorithms supported by fs-verity.
30 * Currently assumed to be <= size of fsverity_descriptor::root_hash.
31 */
Eric Biggersadd890c2019-07-22 09:26:23 -070032#define FS_VERITY_MAX_DIGEST_SIZE SHA512_DIGEST_SIZE
Eric Biggers671e67b2019-07-22 09:26:21 -070033
34/* A hash algorithm supported by fs-verity */
35struct fsverity_hash_alg {
36 struct crypto_ahash *tfm; /* hash tfm, allocated on demand */
37 const char *name; /* crypto API name, e.g. sha256 */
38 unsigned int digest_size; /* digest size in bytes, e.g. 32 for SHA-256 */
39 unsigned int block_size; /* block size in bytes, e.g. 64 for SHA-256 */
40};
41
42/* Merkle tree parameters: hash algorithm, initial hash state, and topology */
43struct merkle_tree_params {
44 const struct fsverity_hash_alg *hash_alg; /* the hash algorithm */
45 const u8 *hashstate; /* initial hash state or NULL */
46 unsigned int digest_size; /* same as hash_alg->digest_size */
47 unsigned int block_size; /* size of data and tree blocks */
48 unsigned int hashes_per_block; /* number of hashes per tree block */
49 unsigned int log_blocksize; /* log2(block_size) */
50 unsigned int log_arity; /* log2(hashes_per_block) */
51 unsigned int num_levels; /* number of levels in Merkle tree */
52 u64 tree_size; /* Merkle tree size in bytes */
53
54 /*
55 * Starting block index for each tree level, ordered from leaf level (0)
56 * to root level ('num_levels - 1')
57 */
58 u64 level_start[FS_VERITY_MAX_LEVELS];
59};
60
Eric Biggersfd2d1ac2019-07-22 09:26:22 -070061/**
62 * fsverity_info - cached verity metadata for an inode
63 *
64 * When a verity file is first opened, an instance of this struct is allocated
65 * and stored in ->i_verity_info; it remains until the inode is evicted. It
66 * caches information about the Merkle tree that's needed to efficiently verify
67 * data read from the file. It also caches the file measurement. The Merkle
68 * tree pages themselves are not cached here, but the filesystem may cache them.
69 */
70struct fsverity_info {
71 struct merkle_tree_params tree_params;
72 u8 root_hash[FS_VERITY_MAX_DIGEST_SIZE];
73 u8 measurement[FS_VERITY_MAX_DIGEST_SIZE];
74 const struct inode *inode;
75};
76
77/*
78 * Merkle tree properties. The file measurement is the hash of this structure.
79 */
80struct fsverity_descriptor {
81 __u8 version; /* must be 1 */
82 __u8 hash_algorithm; /* Merkle tree hash algorithm */
83 __u8 log_blocksize; /* log2 of size of data and tree blocks */
84 __u8 salt_size; /* size of salt in bytes; 0 if none */
85 __le32 sig_size; /* reserved, must be 0 */
86 __le64 data_size; /* size of file the Merkle tree is built over */
87 __u8 root_hash[64]; /* Merkle tree root hash */
88 __u8 salt[32]; /* salt prepended to each hashed block */
89 __u8 __reserved[144]; /* must be 0's */
90};
91
92/* Arbitrary limit to bound the kmalloc() size. Can be changed. */
93#define FS_VERITY_MAX_DESCRIPTOR_SIZE 16384
94
Eric Biggers671e67b2019-07-22 09:26:21 -070095/* hash_algs.c */
96
97extern struct fsverity_hash_alg fsverity_hash_algs[];
98
99const struct fsverity_hash_alg *fsverity_get_hash_alg(const struct inode *inode,
100 unsigned int num);
101const u8 *fsverity_prepare_hash_state(const struct fsverity_hash_alg *alg,
102 const u8 *salt, size_t salt_size);
103int fsverity_hash_page(const struct merkle_tree_params *params,
104 const struct inode *inode,
105 struct ahash_request *req, struct page *page, u8 *out);
106int fsverity_hash_buffer(const struct fsverity_hash_alg *alg,
107 const void *data, size_t size, u8 *out);
108void __init fsverity_check_hash_algs(void);
109
110/* init.c */
111
112extern void __printf(3, 4) __cold
113fsverity_msg(const struct inode *inode, const char *level,
114 const char *fmt, ...);
115
116#define fsverity_warn(inode, fmt, ...) \
117 fsverity_msg((inode), KERN_WARNING, fmt, ##__VA_ARGS__)
118#define fsverity_err(inode, fmt, ...) \
119 fsverity_msg((inode), KERN_ERR, fmt, ##__VA_ARGS__)
120
Eric Biggersfd2d1ac2019-07-22 09:26:22 -0700121/* open.c */
122
123int fsverity_init_merkle_tree_params(struct merkle_tree_params *params,
124 const struct inode *inode,
125 unsigned int hash_algorithm,
126 unsigned int log_blocksize,
127 const u8 *salt, size_t salt_size);
128
129struct fsverity_info *fsverity_create_info(const struct inode *inode,
130 const void *desc, size_t desc_size);
131
132void fsverity_set_info(struct inode *inode, struct fsverity_info *vi);
133
134void fsverity_free_info(struct fsverity_info *vi);
135
136int __init fsverity_init_info_cache(void);
Eric Biggers8a1d0f92019-07-22 09:26:22 -0700137void __init fsverity_exit_info_cache(void);
138
139/* verify.c */
140
141int __init fsverity_init_workqueue(void);
Eric Biggersfd2d1ac2019-07-22 09:26:22 -0700142
Eric Biggers671e67b2019-07-22 09:26:21 -0700143#endif /* _FSVERITY_PRIVATE_H */