1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
| // SPDX-License-Identifier: GPL-2.0+
| /*
| * Copyright (c) 2013, Andreas Oetken.
| */
|
| #ifndef USE_HOSTCC
| #include <common.h>
| #include <fdtdec.h>
| #include <asm/byteorder.h>
| #include <linux/errno.h>
| #include <asm/unaligned.h>
| #include <hash.h>
| #else
| #include "fdt_host.h"
| #endif
| #include <u-boot/rsa.h>
|
| int hash_calculate(const char *name,
| const struct image_region region[],
| int region_count, uint8_t *checksum)
| {
| struct hash_algo *algo;
| int ret = 0;
| void *ctx;
| uint32_t i;
| i = 0;
|
| ret = hash_progressive_lookup_algo(name, &algo);
| if (ret)
| return ret;
|
| ret = algo->hash_init(algo, &ctx);
| if (ret)
| return ret;
|
| for (i = 0; i < region_count - 1; i++) {
| ret = algo->hash_update(algo, ctx, region[i].data,
| region[i].size, 0);
| if (ret)
| return ret;
| }
|
| ret = algo->hash_update(algo, ctx, region[i].data, region[i].size, 1);
| if (ret)
| return ret;
| ret = algo->hash_finish(algo, ctx, checksum, algo->digest_size);
| if (ret)
| return ret;
|
| return 0;
| }
|
|
