]>
Commit | Line | Data |
---|---|---|
b886d83c | 1 | // SPDX-License-Identifier: GPL-2.0-only |
3323eec9 MZ |
2 | /* |
3 | * Copyright (C) 2005,2006,2007,2008 IBM Corporation | |
4 | * | |
5 | * Authors: | |
6 | * Mimi Zohar <zohar@us.ibm.com> | |
7 | * Kylene Hall <kjhall@us.ibm.com> | |
8 | * | |
3323eec9 | 9 | * File: ima_crypto.c |
2bb930ab | 10 | * Calculates md5/sha1 file hash, template hash, boot-aggreate hash |
3323eec9 MZ |
11 | */ |
12 | ||
13 | #include <linux/kernel.h> | |
3bcced39 DK |
14 | #include <linux/moduleparam.h> |
15 | #include <linux/ratelimit.h> | |
3323eec9 MZ |
16 | #include <linux/file.h> |
17 | #include <linux/crypto.h> | |
18 | #include <linux/scatterlist.h> | |
19 | #include <linux/err.h> | |
5a0e3ad6 | 20 | #include <linux/slab.h> |
76bb28f6 | 21 | #include <crypto/hash.h> |
1525b06d | 22 | |
3323eec9 MZ |
23 | #include "ima.h" |
24 | ||
3bcced39 DK |
25 | /* minimum file size for ahash use */ |
26 | static unsigned long ima_ahash_minsize; | |
27 | module_param_named(ahash_minsize, ima_ahash_minsize, ulong, 0644); | |
28 | MODULE_PARM_DESC(ahash_minsize, "Minimum file size for ahash use"); | |
29 | ||
6edf7a89 DK |
30 | /* default is 0 - 1 page. */ |
31 | static int ima_maxorder; | |
32 | static unsigned int ima_bufsize = PAGE_SIZE; | |
33 | ||
34 | static int param_set_bufsize(const char *val, const struct kernel_param *kp) | |
35 | { | |
36 | unsigned long long size; | |
37 | int order; | |
38 | ||
39 | size = memparse(val, NULL); | |
40 | order = get_order(size); | |
41 | if (order >= MAX_ORDER) | |
42 | return -EINVAL; | |
43 | ima_maxorder = order; | |
44 | ima_bufsize = PAGE_SIZE << order; | |
45 | return 0; | |
46 | } | |
47 | ||
9c27847d | 48 | static const struct kernel_param_ops param_ops_bufsize = { |
6edf7a89 DK |
49 | .set = param_set_bufsize, |
50 | .get = param_get_uint, | |
51 | }; | |
52 | #define param_check_bufsize(name, p) __param_check(name, p, unsigned int) | |
53 | ||
54 | module_param_named(ahash_bufsize, ima_bufsize, bufsize, 0644); | |
55 | MODULE_PARM_DESC(ahash_bufsize, "Maximum ahash buffer size"); | |
56 | ||
76bb28f6 | 57 | static struct crypto_shash *ima_shash_tfm; |
3bcced39 | 58 | static struct crypto_ahash *ima_ahash_tfm; |
76bb28f6 | 59 | |
e4a9c519 | 60 | int __init ima_init_crypto(void) |
3323eec9 | 61 | { |
76bb28f6 | 62 | long rc; |
3323eec9 | 63 | |
c7c8bb23 | 64 | ima_shash_tfm = crypto_alloc_shash(hash_algo_name[ima_hash_algo], 0, 0); |
76bb28f6 DK |
65 | if (IS_ERR(ima_shash_tfm)) { |
66 | rc = PTR_ERR(ima_shash_tfm); | |
c7c8bb23 DK |
67 | pr_err("Can not allocate %s (reason: %ld)\n", |
68 | hash_algo_name[ima_hash_algo], rc); | |
3323eec9 MZ |
69 | return rc; |
70 | } | |
ab60368a PV |
71 | pr_info("Allocated hash algorithm: %s\n", |
72 | hash_algo_name[ima_hash_algo]); | |
76bb28f6 | 73 | return 0; |
3323eec9 MZ |
74 | } |
75 | ||
723326b9 DK |
76 | static struct crypto_shash *ima_alloc_tfm(enum hash_algo algo) |
77 | { | |
78 | struct crypto_shash *tfm = ima_shash_tfm; | |
79 | int rc; | |
80 | ||
23c19e2c DK |
81 | if (algo < 0 || algo >= HASH_ALGO__LAST) |
82 | algo = ima_hash_algo; | |
83 | ||
84 | if (algo != ima_hash_algo) { | |
723326b9 DK |
85 | tfm = crypto_alloc_shash(hash_algo_name[algo], 0, 0); |
86 | if (IS_ERR(tfm)) { | |
87 | rc = PTR_ERR(tfm); | |
88 | pr_err("Can not allocate %s (reason: %d)\n", | |
89 | hash_algo_name[algo], rc); | |
90 | } | |
91 | } | |
92 | return tfm; | |
93 | } | |
94 | ||
95 | static void ima_free_tfm(struct crypto_shash *tfm) | |
96 | { | |
97 | if (tfm != ima_shash_tfm) | |
98 | crypto_free_shash(tfm); | |
99 | } | |
100 | ||
6edf7a89 DK |
101 | /** |
102 | * ima_alloc_pages() - Allocate contiguous pages. | |
103 | * @max_size: Maximum amount of memory to allocate. | |
104 | * @allocated_size: Returned size of actual allocation. | |
105 | * @last_warn: Should the min_size allocation warn or not. | |
106 | * | |
107 | * Tries to do opportunistic allocation for memory first trying to allocate | |
108 | * max_size amount of memory and then splitting that until zero order is | |
109 | * reached. Allocation is tried without generating allocation warnings unless | |
110 | * last_warn is set. Last_warn set affects only last allocation of zero order. | |
111 | * | |
112 | * By default, ima_maxorder is 0 and it is equivalent to kmalloc(GFP_KERNEL) | |
113 | * | |
114 | * Return pointer to allocated memory, or NULL on failure. | |
115 | */ | |
116 | static void *ima_alloc_pages(loff_t max_size, size_t *allocated_size, | |
117 | int last_warn) | |
118 | { | |
119 | void *ptr; | |
120 | int order = ima_maxorder; | |
71baba4b | 121 | gfp_t gfp_mask = __GFP_RECLAIM | __GFP_NOWARN | __GFP_NORETRY; |
6edf7a89 DK |
122 | |
123 | if (order) | |
124 | order = min(get_order(max_size), order); | |
125 | ||
126 | for (; order; order--) { | |
127 | ptr = (void *)__get_free_pages(gfp_mask, order); | |
128 | if (ptr) { | |
129 | *allocated_size = PAGE_SIZE << order; | |
130 | return ptr; | |
131 | } | |
132 | } | |
133 | ||
134 | /* order is zero - one page */ | |
135 | ||
136 | gfp_mask = GFP_KERNEL; | |
137 | ||
138 | if (!last_warn) | |
139 | gfp_mask |= __GFP_NOWARN; | |
140 | ||
141 | ptr = (void *)__get_free_pages(gfp_mask, 0); | |
142 | if (ptr) { | |
143 | *allocated_size = PAGE_SIZE; | |
144 | return ptr; | |
145 | } | |
146 | ||
147 | *allocated_size = 0; | |
148 | return NULL; | |
149 | } | |
150 | ||
151 | /** | |
152 | * ima_free_pages() - Free pages allocated by ima_alloc_pages(). | |
153 | * @ptr: Pointer to allocated pages. | |
154 | * @size: Size of allocated buffer. | |
155 | */ | |
156 | static void ima_free_pages(void *ptr, size_t size) | |
157 | { | |
158 | if (!ptr) | |
159 | return; | |
160 | free_pages((unsigned long)ptr, get_order(size)); | |
161 | } | |
162 | ||
3bcced39 DK |
163 | static struct crypto_ahash *ima_alloc_atfm(enum hash_algo algo) |
164 | { | |
165 | struct crypto_ahash *tfm = ima_ahash_tfm; | |
166 | int rc; | |
167 | ||
9a8d289f MZ |
168 | if (algo < 0 || algo >= HASH_ALGO__LAST) |
169 | algo = ima_hash_algo; | |
170 | ||
171 | if (algo != ima_hash_algo || !tfm) { | |
3bcced39 DK |
172 | tfm = crypto_alloc_ahash(hash_algo_name[algo], 0, 0); |
173 | if (!IS_ERR(tfm)) { | |
174 | if (algo == ima_hash_algo) | |
175 | ima_ahash_tfm = tfm; | |
176 | } else { | |
177 | rc = PTR_ERR(tfm); | |
178 | pr_err("Can not allocate %s (reason: %d)\n", | |
179 | hash_algo_name[algo], rc); | |
180 | } | |
181 | } | |
182 | return tfm; | |
183 | } | |
184 | ||
185 | static void ima_free_atfm(struct crypto_ahash *tfm) | |
186 | { | |
187 | if (tfm != ima_ahash_tfm) | |
188 | crypto_free_ahash(tfm); | |
189 | } | |
190 | ||
46f1414c | 191 | static inline int ahash_wait(int err, struct crypto_wait *wait) |
3bcced39 | 192 | { |
3bcced39 | 193 | |
46f1414c | 194 | err = crypto_wait_req(err, wait); |
3bcced39 | 195 | |
46f1414c | 196 | if (err) |
3bcced39 | 197 | pr_crit_ratelimited("ahash calculation failed: err: %d\n", err); |
3bcced39 DK |
198 | |
199 | return err; | |
200 | } | |
201 | ||
202 | static int ima_calc_file_hash_atfm(struct file *file, | |
203 | struct ima_digest_data *hash, | |
204 | struct crypto_ahash *tfm) | |
205 | { | |
206 | loff_t i_size, offset; | |
32c2e675 | 207 | char *rbuf[2] = { NULL, }; |
a408e4a8 | 208 | int rc, rbuf_len, active = 0, ahash_rc = 0; |
3bcced39 DK |
209 | struct ahash_request *req; |
210 | struct scatterlist sg[1]; | |
46f1414c | 211 | struct crypto_wait wait; |
32c2e675 | 212 | size_t rbuf_size[2]; |
3bcced39 DK |
213 | |
214 | hash->length = crypto_ahash_digestsize(tfm); | |
215 | ||
216 | req = ahash_request_alloc(tfm, GFP_KERNEL); | |
217 | if (!req) | |
218 | return -ENOMEM; | |
219 | ||
46f1414c | 220 | crypto_init_wait(&wait); |
3bcced39 DK |
221 | ahash_request_set_callback(req, CRYPTO_TFM_REQ_MAY_BACKLOG | |
222 | CRYPTO_TFM_REQ_MAY_SLEEP, | |
46f1414c | 223 | crypto_req_done, &wait); |
3bcced39 | 224 | |
46f1414c | 225 | rc = ahash_wait(crypto_ahash_init(req), &wait); |
3bcced39 DK |
226 | if (rc) |
227 | goto out1; | |
228 | ||
229 | i_size = i_size_read(file_inode(file)); | |
230 | ||
231 | if (i_size == 0) | |
232 | goto out2; | |
233 | ||
6edf7a89 DK |
234 | /* |
235 | * Try to allocate maximum size of memory. | |
236 | * Fail if even a single page cannot be allocated. | |
237 | */ | |
32c2e675 DK |
238 | rbuf[0] = ima_alloc_pages(i_size, &rbuf_size[0], 1); |
239 | if (!rbuf[0]) { | |
3bcced39 DK |
240 | rc = -ENOMEM; |
241 | goto out1; | |
242 | } | |
243 | ||
32c2e675 DK |
244 | /* Only allocate one buffer if that is enough. */ |
245 | if (i_size > rbuf_size[0]) { | |
246 | /* | |
247 | * Try to allocate secondary buffer. If that fails fallback to | |
248 | * using single buffering. Use previous memory allocation size | |
249 | * as baseline for possible allocation size. | |
250 | */ | |
251 | rbuf[1] = ima_alloc_pages(i_size - rbuf_size[0], | |
252 | &rbuf_size[1], 0); | |
253 | } | |
254 | ||
3bcced39 | 255 | for (offset = 0; offset < i_size; offset += rbuf_len) { |
32c2e675 DK |
256 | if (!rbuf[1] && offset) { |
257 | /* Not using two buffers, and it is not the first | |
258 | * read/request, wait for the completion of the | |
259 | * previous ahash_update() request. | |
260 | */ | |
46f1414c | 261 | rc = ahash_wait(ahash_rc, &wait); |
32c2e675 DK |
262 | if (rc) |
263 | goto out3; | |
264 | } | |
265 | /* read buffer */ | |
266 | rbuf_len = min_t(loff_t, i_size - offset, rbuf_size[active]); | |
e3c4abbf DK |
267 | rc = integrity_kernel_read(file, offset, rbuf[active], |
268 | rbuf_len); | |
f5e10401 SH |
269 | if (rc != rbuf_len) { |
270 | if (rc >= 0) | |
271 | rc = -EINVAL; | |
4ece3125 SH |
272 | /* |
273 | * Forward current rc, do not overwrite with return value | |
274 | * from ahash_wait() | |
275 | */ | |
276 | ahash_wait(ahash_rc, &wait); | |
32c2e675 | 277 | goto out3; |
f5e10401 | 278 | } |
32c2e675 DK |
279 | |
280 | if (rbuf[1] && offset) { | |
281 | /* Using two buffers, and it is not the first | |
282 | * read/request, wait for the completion of the | |
283 | * previous ahash_update() request. | |
284 | */ | |
46f1414c | 285 | rc = ahash_wait(ahash_rc, &wait); |
32c2e675 DK |
286 | if (rc) |
287 | goto out3; | |
3bcced39 | 288 | } |
3bcced39 | 289 | |
32c2e675 | 290 | sg_init_one(&sg[0], rbuf[active], rbuf_len); |
3bcced39 DK |
291 | ahash_request_set_crypt(req, sg, NULL, rbuf_len); |
292 | ||
32c2e675 DK |
293 | ahash_rc = crypto_ahash_update(req); |
294 | ||
295 | if (rbuf[1]) | |
296 | active = !active; /* swap buffers, if we use two */ | |
3bcced39 | 297 | } |
32c2e675 | 298 | /* wait for the last update request to complete */ |
46f1414c | 299 | rc = ahash_wait(ahash_rc, &wait); |
32c2e675 | 300 | out3: |
32c2e675 DK |
301 | ima_free_pages(rbuf[0], rbuf_size[0]); |
302 | ima_free_pages(rbuf[1], rbuf_size[1]); | |
3bcced39 DK |
303 | out2: |
304 | if (!rc) { | |
305 | ahash_request_set_crypt(req, NULL, hash->digest, 0); | |
46f1414c | 306 | rc = ahash_wait(crypto_ahash_final(req), &wait); |
3bcced39 DK |
307 | } |
308 | out1: | |
309 | ahash_request_free(req); | |
310 | return rc; | |
311 | } | |
312 | ||
313 | static int ima_calc_file_ahash(struct file *file, struct ima_digest_data *hash) | |
314 | { | |
315 | struct crypto_ahash *tfm; | |
316 | int rc; | |
317 | ||
318 | tfm = ima_alloc_atfm(hash->algo); | |
319 | if (IS_ERR(tfm)) | |
320 | return PTR_ERR(tfm); | |
321 | ||
322 | rc = ima_calc_file_hash_atfm(file, hash, tfm); | |
323 | ||
324 | ima_free_atfm(tfm); | |
325 | ||
326 | return rc; | |
327 | } | |
328 | ||
c7c8bb23 DK |
329 | static int ima_calc_file_hash_tfm(struct file *file, |
330 | struct ima_digest_data *hash, | |
331 | struct crypto_shash *tfm) | |
3323eec9 | 332 | { |
16bfa38b | 333 | loff_t i_size, offset = 0; |
3323eec9 | 334 | char *rbuf; |
a408e4a8 | 335 | int rc; |
357aabed | 336 | SHASH_DESC_ON_STACK(shash, tfm); |
3323eec9 | 337 | |
357aabed | 338 | shash->tfm = tfm; |
76bb28f6 | 339 | |
723326b9 DK |
340 | hash->length = crypto_shash_digestsize(tfm); |
341 | ||
357aabed | 342 | rc = crypto_shash_init(shash); |
3323eec9 MZ |
343 | if (rc != 0) |
344 | return rc; | |
345 | ||
1d91ac62 DK |
346 | i_size = i_size_read(file_inode(file)); |
347 | ||
348 | if (i_size == 0) | |
3323eec9 | 349 | goto out; |
1d91ac62 DK |
350 | |
351 | rbuf = kzalloc(PAGE_SIZE, GFP_KERNEL); | |
352 | if (!rbuf) | |
353 | return -ENOMEM; | |
354 | ||
3323eec9 MZ |
355 | while (offset < i_size) { |
356 | int rbuf_len; | |
357 | ||
e3c4abbf | 358 | rbuf_len = integrity_kernel_read(file, offset, rbuf, PAGE_SIZE); |
3323eec9 MZ |
359 | if (rbuf_len < 0) { |
360 | rc = rbuf_len; | |
361 | break; | |
362 | } | |
96c9e1de PC |
363 | if (rbuf_len == 0) { /* unexpected EOF */ |
364 | rc = -EINVAL; | |
16bfa38b | 365 | break; |
96c9e1de | 366 | } |
3323eec9 | 367 | offset += rbuf_len; |
3323eec9 | 368 | |
357aabed | 369 | rc = crypto_shash_update(shash, rbuf, rbuf_len); |
3323eec9 MZ |
370 | if (rc) |
371 | break; | |
372 | } | |
1d91ac62 | 373 | kfree(rbuf); |
3323eec9 | 374 | out: |
1d91ac62 | 375 | if (!rc) |
357aabed | 376 | rc = crypto_shash_final(shash, hash->digest); |
3323eec9 MZ |
377 | return rc; |
378 | } | |
379 | ||
3bcced39 | 380 | static int ima_calc_file_shash(struct file *file, struct ima_digest_data *hash) |
c7c8bb23 | 381 | { |
723326b9 | 382 | struct crypto_shash *tfm; |
c7c8bb23 DK |
383 | int rc; |
384 | ||
723326b9 DK |
385 | tfm = ima_alloc_tfm(hash->algo); |
386 | if (IS_ERR(tfm)) | |
387 | return PTR_ERR(tfm); | |
c7c8bb23 DK |
388 | |
389 | rc = ima_calc_file_hash_tfm(file, hash, tfm); | |
390 | ||
723326b9 | 391 | ima_free_tfm(tfm); |
c7c8bb23 DK |
392 | |
393 | return rc; | |
394 | } | |
395 | ||
3bcced39 DK |
396 | /* |
397 | * ima_calc_file_hash - calculate file hash | |
398 | * | |
399 | * Asynchronous hash (ahash) allows using HW acceleration for calculating | |
400 | * a hash. ahash performance varies for different data sizes on different | |
401 | * crypto accelerators. shash performance might be better for smaller files. | |
402 | * The 'ima.ahash_minsize' module parameter allows specifying the best | |
403 | * minimum file size for using ahash on the system. | |
404 | * | |
405 | * If the ima.ahash_minsize parameter is not specified, this function uses | |
406 | * shash for the hash calculation. If ahash fails, it falls back to using | |
407 | * shash. | |
408 | */ | |
409 | int ima_calc_file_hash(struct file *file, struct ima_digest_data *hash) | |
410 | { | |
411 | loff_t i_size; | |
412 | int rc; | |
a408e4a8 | 413 | struct file *f = file; |
0014cc04 | 414 | bool new_file_instance = false, modified_mode = false; |
3bcced39 | 415 | |
f3cc6b25 MZ |
416 | /* |
417 | * For consistency, fail file's opened with the O_DIRECT flag on | |
418 | * filesystems mounted with/without DAX option. | |
419 | */ | |
420 | if (file->f_flags & O_DIRECT) { | |
421 | hash->length = hash_digest_size[ima_hash_algo]; | |
422 | hash->algo = ima_hash_algo; | |
423 | return -EINVAL; | |
424 | } | |
425 | ||
a408e4a8 GR |
426 | /* Open a new file instance in O_RDONLY if we cannot read */ |
427 | if (!(file->f_mode & FMODE_READ)) { | |
428 | int flags = file->f_flags & ~(O_WRONLY | O_APPEND | | |
429 | O_TRUNC | O_CREAT | O_NOCTTY | O_EXCL); | |
430 | flags |= O_RDONLY; | |
431 | f = dentry_open(&file->f_path, flags, file->f_cred); | |
432 | if (IS_ERR(f)) { | |
433 | /* | |
0014cc04 | 434 | * Cannot open the file again, lets modify f_mode |
a408e4a8 GR |
435 | * of original and continue |
436 | */ | |
437 | pr_info_ratelimited("Unable to reopen file for reading.\n"); | |
438 | f = file; | |
0014cc04 RS |
439 | f->f_mode |= FMODE_READ; |
440 | modified_mode = true; | |
a408e4a8 GR |
441 | } else { |
442 | new_file_instance = true; | |
443 | } | |
444 | } | |
445 | ||
446 | i_size = i_size_read(file_inode(f)); | |
3bcced39 DK |
447 | |
448 | if (ima_ahash_minsize && i_size >= ima_ahash_minsize) { | |
a408e4a8 | 449 | rc = ima_calc_file_ahash(f, hash); |
3bcced39 | 450 | if (!rc) |
a408e4a8 | 451 | goto out; |
3bcced39 DK |
452 | } |
453 | ||
a408e4a8 GR |
454 | rc = ima_calc_file_shash(f, hash); |
455 | out: | |
456 | if (new_file_instance) | |
457 | fput(f); | |
0014cc04 RS |
458 | else if (modified_mode) |
459 | f->f_mode &= ~FMODE_READ; | |
a408e4a8 | 460 | return rc; |
3bcced39 DK |
461 | } |
462 | ||
3323eec9 | 463 | /* |
a71dc65d | 464 | * Calculate the hash of template data |
3323eec9 | 465 | */ |
a71dc65d | 466 | static int ima_calc_field_array_hash_tfm(struct ima_field_data *field_data, |
b6f8f16f | 467 | struct ima_template_desc *td, |
a71dc65d RS |
468 | int num_fields, |
469 | struct ima_digest_data *hash, | |
470 | struct crypto_shash *tfm) | |
3323eec9 | 471 | { |
357aabed | 472 | SHASH_DESC_ON_STACK(shash, tfm); |
a71dc65d | 473 | int rc, i; |
3323eec9 | 474 | |
357aabed | 475 | shash->tfm = tfm; |
3323eec9 | 476 | |
ea593993 | 477 | hash->length = crypto_shash_digestsize(tfm); |
c7c8bb23 | 478 | |
357aabed | 479 | rc = crypto_shash_init(shash); |
a71dc65d RS |
480 | if (rc != 0) |
481 | return rc; | |
482 | ||
483 | for (i = 0; i < num_fields; i++) { | |
e3b64c26 RS |
484 | u8 buffer[IMA_EVENT_NAME_LEN_MAX + 1] = { 0 }; |
485 | u8 *data_to_hash = field_data[i].data; | |
486 | u32 datalen = field_data[i].len; | |
98e1d55d AS |
487 | u32 datalen_to_hash = |
488 | !ima_canonical_fmt ? datalen : cpu_to_le32(datalen); | |
e3b64c26 | 489 | |
b6f8f16f | 490 | if (strcmp(td->name, IMA_TEMPLATE_IMA_NAME) != 0) { |
357aabed | 491 | rc = crypto_shash_update(shash, |
98e1d55d AS |
492 | (const u8 *) &datalen_to_hash, |
493 | sizeof(datalen_to_hash)); | |
b6f8f16f RS |
494 | if (rc) |
495 | break; | |
e3b64c26 RS |
496 | } else if (strcmp(td->fields[i]->field_id, "n") == 0) { |
497 | memcpy(buffer, data_to_hash, datalen); | |
498 | data_to_hash = buffer; | |
499 | datalen = IMA_EVENT_NAME_LEN_MAX + 1; | |
b6f8f16f | 500 | } |
357aabed | 501 | rc = crypto_shash_update(shash, data_to_hash, datalen); |
a71dc65d RS |
502 | if (rc) |
503 | break; | |
504 | } | |
505 | ||
506 | if (!rc) | |
357aabed | 507 | rc = crypto_shash_final(shash, hash->digest); |
a71dc65d RS |
508 | |
509 | return rc; | |
3323eec9 MZ |
510 | } |
511 | ||
b6f8f16f RS |
512 | int ima_calc_field_array_hash(struct ima_field_data *field_data, |
513 | struct ima_template_desc *desc, int num_fields, | |
a71dc65d | 514 | struct ima_digest_data *hash) |
ea593993 DK |
515 | { |
516 | struct crypto_shash *tfm; | |
517 | int rc; | |
518 | ||
519 | tfm = ima_alloc_tfm(hash->algo); | |
520 | if (IS_ERR(tfm)) | |
521 | return PTR_ERR(tfm); | |
522 | ||
b6f8f16f RS |
523 | rc = ima_calc_field_array_hash_tfm(field_data, desc, num_fields, |
524 | hash, tfm); | |
ea593993 DK |
525 | |
526 | ima_free_tfm(tfm); | |
527 | ||
528 | return rc; | |
529 | } | |
530 | ||
98304bcf MZ |
531 | static int calc_buffer_ahash_atfm(const void *buf, loff_t len, |
532 | struct ima_digest_data *hash, | |
533 | struct crypto_ahash *tfm) | |
534 | { | |
535 | struct ahash_request *req; | |
536 | struct scatterlist sg; | |
46f1414c | 537 | struct crypto_wait wait; |
98304bcf MZ |
538 | int rc, ahash_rc = 0; |
539 | ||
540 | hash->length = crypto_ahash_digestsize(tfm); | |
541 | ||
542 | req = ahash_request_alloc(tfm, GFP_KERNEL); | |
543 | if (!req) | |
544 | return -ENOMEM; | |
545 | ||
46f1414c | 546 | crypto_init_wait(&wait); |
98304bcf MZ |
547 | ahash_request_set_callback(req, CRYPTO_TFM_REQ_MAY_BACKLOG | |
548 | CRYPTO_TFM_REQ_MAY_SLEEP, | |
46f1414c | 549 | crypto_req_done, &wait); |
98304bcf | 550 | |
46f1414c | 551 | rc = ahash_wait(crypto_ahash_init(req), &wait); |
98304bcf MZ |
552 | if (rc) |
553 | goto out; | |
554 | ||
555 | sg_init_one(&sg, buf, len); | |
556 | ahash_request_set_crypt(req, &sg, NULL, len); | |
557 | ||
558 | ahash_rc = crypto_ahash_update(req); | |
559 | ||
560 | /* wait for the update request to complete */ | |
46f1414c | 561 | rc = ahash_wait(ahash_rc, &wait); |
98304bcf MZ |
562 | if (!rc) { |
563 | ahash_request_set_crypt(req, NULL, hash->digest, 0); | |
46f1414c | 564 | rc = ahash_wait(crypto_ahash_final(req), &wait); |
98304bcf MZ |
565 | } |
566 | out: | |
567 | ahash_request_free(req); | |
568 | return rc; | |
569 | } | |
570 | ||
571 | static int calc_buffer_ahash(const void *buf, loff_t len, | |
572 | struct ima_digest_data *hash) | |
573 | { | |
574 | struct crypto_ahash *tfm; | |
575 | int rc; | |
576 | ||
577 | tfm = ima_alloc_atfm(hash->algo); | |
578 | if (IS_ERR(tfm)) | |
579 | return PTR_ERR(tfm); | |
580 | ||
581 | rc = calc_buffer_ahash_atfm(buf, len, hash, tfm); | |
582 | ||
583 | ima_free_atfm(tfm); | |
584 | ||
585 | return rc; | |
586 | } | |
587 | ||
11d7646d DK |
588 | static int calc_buffer_shash_tfm(const void *buf, loff_t size, |
589 | struct ima_digest_data *hash, | |
590 | struct crypto_shash *tfm) | |
591 | { | |
592 | SHASH_DESC_ON_STACK(shash, tfm); | |
593 | unsigned int len; | |
594 | int rc; | |
595 | ||
596 | shash->tfm = tfm; | |
11d7646d DK |
597 | |
598 | hash->length = crypto_shash_digestsize(tfm); | |
599 | ||
600 | rc = crypto_shash_init(shash); | |
601 | if (rc != 0) | |
602 | return rc; | |
603 | ||
604 | while (size) { | |
605 | len = size < PAGE_SIZE ? size : PAGE_SIZE; | |
606 | rc = crypto_shash_update(shash, buf, len); | |
607 | if (rc) | |
608 | break; | |
609 | buf += len; | |
610 | size -= len; | |
611 | } | |
612 | ||
613 | if (!rc) | |
614 | rc = crypto_shash_final(shash, hash->digest); | |
615 | return rc; | |
616 | } | |
617 | ||
98304bcf MZ |
618 | static int calc_buffer_shash(const void *buf, loff_t len, |
619 | struct ima_digest_data *hash) | |
11d7646d DK |
620 | { |
621 | struct crypto_shash *tfm; | |
622 | int rc; | |
623 | ||
624 | tfm = ima_alloc_tfm(hash->algo); | |
625 | if (IS_ERR(tfm)) | |
626 | return PTR_ERR(tfm); | |
627 | ||
628 | rc = calc_buffer_shash_tfm(buf, len, hash, tfm); | |
629 | ||
630 | ima_free_tfm(tfm); | |
631 | return rc; | |
632 | } | |
633 | ||
98304bcf MZ |
634 | int ima_calc_buffer_hash(const void *buf, loff_t len, |
635 | struct ima_digest_data *hash) | |
636 | { | |
637 | int rc; | |
638 | ||
639 | if (ima_ahash_minsize && len >= ima_ahash_minsize) { | |
640 | rc = calc_buffer_ahash(buf, len, hash); | |
641 | if (!rc) | |
642 | return 0; | |
643 | } | |
644 | ||
645 | return calc_buffer_shash(buf, len, hash); | |
646 | } | |
647 | ||
879b5892 | 648 | static void __init ima_pcrread(u32 idx, struct tpm_digest *d) |
3323eec9 | 649 | { |
ec403d8e | 650 | if (!ima_tpm_chip) |
3323eec9 MZ |
651 | return; |
652 | ||
879b5892 | 653 | if (tpm_pcr_read(ima_tpm_chip, idx, d) != 0) |
20ee451f | 654 | pr_err("Error Communicating to TPM chip\n"); |
3323eec9 MZ |
655 | } |
656 | ||
657 | /* | |
658 | * Calculate the boot aggregate hash | |
659 | */ | |
09ef5435 DK |
660 | static int __init ima_calc_boot_aggregate_tfm(char *digest, |
661 | struct crypto_shash *tfm) | |
3323eec9 | 662 | { |
879b5892 | 663 | struct tpm_digest d = { .alg_id = TPM_ALG_SHA1, .digest = {0} }; |
95adc6b4 TW |
664 | int rc; |
665 | u32 i; | |
357aabed | 666 | SHASH_DESC_ON_STACK(shash, tfm); |
76bb28f6 | 667 | |
357aabed | 668 | shash->tfm = tfm; |
3323eec9 | 669 | |
357aabed | 670 | rc = crypto_shash_init(shash); |
3323eec9 MZ |
671 | if (rc != 0) |
672 | return rc; | |
673 | ||
674 | /* cumulative sha1 over tpm registers 0-7 */ | |
675 | for (i = TPM_PCR0; i < TPM_PCR8; i++) { | |
879b5892 | 676 | ima_pcrread(i, &d); |
3323eec9 | 677 | /* now accumulate with current aggregate */ |
879b5892 | 678 | rc = crypto_shash_update(shash, d.digest, TPM_DIGEST_SIZE); |
3323eec9 MZ |
679 | } |
680 | if (!rc) | |
357aabed | 681 | crypto_shash_final(shash, digest); |
3323eec9 MZ |
682 | return rc; |
683 | } | |
09ef5435 DK |
684 | |
685 | int __init ima_calc_boot_aggregate(struct ima_digest_data *hash) | |
686 | { | |
687 | struct crypto_shash *tfm; | |
688 | int rc; | |
689 | ||
690 | tfm = ima_alloc_tfm(hash->algo); | |
691 | if (IS_ERR(tfm)) | |
692 | return PTR_ERR(tfm); | |
693 | ||
694 | hash->length = crypto_shash_digestsize(tfm); | |
695 | rc = ima_calc_boot_aggregate_tfm(hash->digest, tfm); | |
696 | ||
697 | ima_free_tfm(tfm); | |
698 | ||
699 | return rc; | |
700 | } |