1 // SPDX-License-Identifier: GPL-2.0
3 * fs-verity hash algorithms
5 * Copyright 2019 Google LLC
8 #include "fsverity_private.h"
10 #include <crypto/hash.h>
11 #include <linux/scatterlist.h>
13 /* The hash algorithms supported by fs-verity */
14 struct fsverity_hash_alg fsverity_hash_algs[] = {
15 [FS_VERITY_HASH_ALG_SHA256] = {
17 .digest_size = SHA256_DIGEST_SIZE,
18 .block_size = SHA256_BLOCK_SIZE,
19 .algo_id = HASH_ALGO_SHA256,
21 [FS_VERITY_HASH_ALG_SHA512] = {
23 .digest_size = SHA512_DIGEST_SIZE,
24 .block_size = SHA512_BLOCK_SIZE,
25 .algo_id = HASH_ALGO_SHA512,
29 static DEFINE_MUTEX(fsverity_hash_alg_init_mutex);
32 * fsverity_get_hash_alg() - validate and prepare a hash algorithm
33 * @inode: optional inode for logging purposes
34 * @num: the hash algorithm number
36 * Get the struct fsverity_hash_alg for the given hash algorithm number, and
37 * ensure it has a hash transform ready to go. The hash transforms are
38 * allocated on-demand so that we don't waste resources unnecessarily, and
39 * because the crypto modules may be initialized later than fs/verity/.
41 * Return: pointer to the hash alg on success, else an ERR_PTR()
43 struct fsverity_hash_alg *fsverity_get_hash_alg(const struct inode *inode,
46 struct fsverity_hash_alg *alg;
47 struct crypto_ahash *tfm;
50 if (num >= ARRAY_SIZE(fsverity_hash_algs) ||
51 !fsverity_hash_algs[num].name) {
52 fsverity_warn(inode, "Unknown hash algorithm number: %u", num);
53 return ERR_PTR(-EINVAL);
55 alg = &fsverity_hash_algs[num];
57 /* pairs with smp_store_release() below */
58 if (likely(smp_load_acquire(&alg->tfm) != NULL))
61 mutex_lock(&fsverity_hash_alg_init_mutex);
67 * Using the shash API would make things a bit simpler, but the ahash
68 * API is preferable as it allows the use of crypto accelerators.
70 tfm = crypto_alloc_ahash(alg->name, 0, 0);
72 if (PTR_ERR(tfm) == -ENOENT) {
74 "Missing crypto API support for hash algorithm \"%s\"",
76 alg = ERR_PTR(-ENOPKG);
80 "Error allocating hash algorithm \"%s\": %ld",
81 alg->name, PTR_ERR(tfm));
87 if (WARN_ON(alg->digest_size != crypto_ahash_digestsize(tfm)))
89 if (WARN_ON(alg->block_size != crypto_ahash_blocksize(tfm)))
92 err = mempool_init_kmalloc_pool(&alg->req_pool, 1,
93 sizeof(struct ahash_request) +
94 crypto_ahash_reqsize(tfm));
98 pr_info("%s using implementation \"%s\"\n",
99 alg->name, crypto_ahash_driver_name(tfm));
101 /* pairs with smp_load_acquire() above */
102 smp_store_release(&alg->tfm, tfm);
106 crypto_free_ahash(tfm);
109 mutex_unlock(&fsverity_hash_alg_init_mutex);
114 * fsverity_alloc_hash_request() - allocate a hash request object
115 * @alg: the hash algorithm for which to allocate the request
116 * @gfp_flags: memory allocation flags
118 * This is mempool-backed, so this never fails if __GFP_DIRECT_RECLAIM is set in
119 * @gfp_flags. However, in that case this might need to wait for all
120 * previously-allocated requests to be freed. So to avoid deadlocks, callers
121 * must never need multiple requests at a time to make forward progress.
123 * Return: the request object on success; NULL on failure (but see above)
125 struct ahash_request *fsverity_alloc_hash_request(struct fsverity_hash_alg *alg,
128 struct ahash_request *req = mempool_alloc(&alg->req_pool, gfp_flags);
131 ahash_request_set_tfm(req, alg->tfm);
136 * fsverity_free_hash_request() - free a hash request object
137 * @alg: the hash algorithm
138 * @req: the hash request object to free
140 void fsverity_free_hash_request(struct fsverity_hash_alg *alg,
141 struct ahash_request *req)
144 ahash_request_zero(req);
145 mempool_free(req, &alg->req_pool);
150 * fsverity_prepare_hash_state() - precompute the initial hash state
151 * @alg: hash algorithm
152 * @salt: a salt which is to be prepended to all data to be hashed
153 * @salt_size: salt size in bytes, possibly 0
155 * Return: NULL if the salt is empty, otherwise the kmalloc()'ed precomputed
156 * initial hash state on success or an ERR_PTR() on failure.
158 const u8 *fsverity_prepare_hash_state(struct fsverity_hash_alg *alg,
159 const u8 *salt, size_t salt_size)
161 u8 *hashstate = NULL;
162 struct ahash_request *req = NULL;
163 u8 *padded_salt = NULL;
164 size_t padded_salt_size;
165 struct scatterlist sg;
166 DECLARE_CRYPTO_WAIT(wait);
172 hashstate = kmalloc(crypto_ahash_statesize(alg->tfm), GFP_KERNEL);
174 return ERR_PTR(-ENOMEM);
176 /* This allocation never fails, since it's mempool-backed. */
177 req = fsverity_alloc_hash_request(alg, GFP_KERNEL);
180 * Zero-pad the salt to the next multiple of the input size of the hash
181 * algorithm's compression function, e.g. 64 bytes for SHA-256 or 128
182 * bytes for SHA-512. This ensures that the hash algorithm won't have
183 * any bytes buffered internally after processing the salt, thus making
184 * salted hashing just as fast as unsalted hashing.
186 padded_salt_size = round_up(salt_size, alg->block_size);
187 padded_salt = kzalloc(padded_salt_size, GFP_KERNEL);
192 memcpy(padded_salt, salt, salt_size);
194 sg_init_one(&sg, padded_salt, padded_salt_size);
195 ahash_request_set_callback(req, CRYPTO_TFM_REQ_MAY_SLEEP |
196 CRYPTO_TFM_REQ_MAY_BACKLOG,
197 crypto_req_done, &wait);
198 ahash_request_set_crypt(req, &sg, NULL, padded_salt_size);
200 err = crypto_wait_req(crypto_ahash_init(req), &wait);
204 err = crypto_wait_req(crypto_ahash_update(req), &wait);
208 err = crypto_ahash_export(req, hashstate);
212 fsverity_free_hash_request(alg, req);
218 hashstate = ERR_PTR(err);
223 * fsverity_hash_page() - hash a single data or hash page
224 * @params: the Merkle tree's parameters
225 * @inode: inode for which the hashing is being done
226 * @req: preallocated hash request
227 * @page: the page to hash
228 * @out: output digest, size 'params->digest_size' bytes
230 * Hash a single data or hash block, assuming block_size == PAGE_SIZE.
231 * The hash is salted if a salt is specified in the Merkle tree parameters.
233 * Return: 0 on success, -errno on failure
235 int fsverity_hash_page(const struct merkle_tree_params *params,
236 const struct inode *inode,
237 struct ahash_request *req, struct page *page, u8 *out)
239 struct scatterlist sg;
240 DECLARE_CRYPTO_WAIT(wait);
243 if (WARN_ON(params->block_size != PAGE_SIZE))
246 sg_init_table(&sg, 1);
247 sg_set_page(&sg, page, PAGE_SIZE, 0);
248 ahash_request_set_callback(req, CRYPTO_TFM_REQ_MAY_SLEEP |
249 CRYPTO_TFM_REQ_MAY_BACKLOG,
250 crypto_req_done, &wait);
251 ahash_request_set_crypt(req, &sg, out, PAGE_SIZE);
253 if (params->hashstate) {
254 err = crypto_ahash_import(req, params->hashstate);
257 "Error %d importing hash state", err);
260 err = crypto_ahash_finup(req);
262 err = crypto_ahash_digest(req);
265 err = crypto_wait_req(err, &wait);
267 fsverity_err(inode, "Error %d computing page hash", err);
272 * fsverity_hash_buffer() - hash some data
273 * @alg: the hash algorithm to use
274 * @data: the data to hash
275 * @size: size of data to hash, in bytes
276 * @out: output digest, size 'alg->digest_size' bytes
278 * Hash some data which is located in physically contiguous memory (i.e. memory
279 * allocated by kmalloc(), not by vmalloc()). No salt is used.
281 * Return: 0 on success, -errno on failure
283 int fsverity_hash_buffer(struct fsverity_hash_alg *alg,
284 const void *data, size_t size, u8 *out)
286 struct ahash_request *req;
287 struct scatterlist sg;
288 DECLARE_CRYPTO_WAIT(wait);
291 /* This allocation never fails, since it's mempool-backed. */
292 req = fsverity_alloc_hash_request(alg, GFP_KERNEL);
294 sg_init_one(&sg, data, size);
295 ahash_request_set_callback(req, CRYPTO_TFM_REQ_MAY_SLEEP |
296 CRYPTO_TFM_REQ_MAY_BACKLOG,
297 crypto_req_done, &wait);
298 ahash_request_set_crypt(req, &sg, out, size);
300 err = crypto_wait_req(crypto_ahash_digest(req), &wait);
302 fsverity_free_hash_request(alg, req);
306 void __init fsverity_check_hash_algs(void)
311 * Sanity check the hash algorithms (could be a build-time check, but
312 * they're in an array)
314 for (i = 0; i < ARRAY_SIZE(fsverity_hash_algs); i++) {
315 const struct fsverity_hash_alg *alg = &fsverity_hash_algs[i];
320 BUG_ON(alg->digest_size > FS_VERITY_MAX_DIGEST_SIZE);
323 * For efficiency, the implementation currently assumes the
324 * digest and block sizes are powers of 2. This limitation can
325 * be lifted if the code is updated to handle other values.
327 BUG_ON(!is_power_of_2(alg->digest_size));
328 BUG_ON(!is_power_of_2(alg->block_size));
330 /* Verify that there is a valid mapping to HASH_ALGO_*. */
331 BUG_ON(alg->algo_id == 0);
332 BUG_ON(alg->digest_size != hash_digest_size[alg->algo_id]);