]>
Commit | Line | Data |
---|---|---|
83d290c5 | 1 | // SPDX-License-Identifier: GPL-2.0+ |
460408ef SG |
2 | /* |
3 | * Copyright (c) 2012 The Chromium OS Authors. | |
4 | * | |
5 | * (C) Copyright 2011 | |
6 | * Joe Hershberger, National Instruments, [email protected] | |
7 | * | |
8 | * (C) Copyright 2000 | |
9 | * Wolfgang Denk, DENX Software Engineering, [email protected]. | |
460408ef SG |
10 | */ |
11 | ||
2dd90027 | 12 | #ifndef USE_HOSTCC |
460408ef SG |
13 | #include <common.h> |
14 | #include <command.h> | |
9fb625ce | 15 | #include <env.h> |
f7ae49fc | 16 | #include <log.h> |
bf007ebb | 17 | #include <malloc.h> |
0eb25b61 | 18 | #include <mapmem.h> |
1f9c9280 | 19 | #include <hw_sha.h> |
90526e9f | 20 | #include <asm/cache.h> |
401d1c4f | 21 | #include <asm/global_data.h> |
2dd90027 | 22 | #include <asm/io.h> |
1221ce45 | 23 | #include <linux/errno.h> |
3db71108 | 24 | #include <u-boot/crc.h> |
2dd90027 RG |
25 | #else |
26 | #include "mkimage.h" | |
d54f7e3f | 27 | #include <linux/compiler_attributes.h> |
2dd90027 | 28 | #include <time.h> |
2c21256b | 29 | #include <linux/kconfig.h> |
2dd90027 RG |
30 | #endif /* !USE_HOSTCC*/ |
31 | ||
460408ef | 32 | #include <hash.h> |
4d72caa5 | 33 | #include <image.h> |
2dd90027 | 34 | #include <u-boot/crc.h> |
2b9912e6 JH |
35 | #include <u-boot/sha1.h> |
36 | #include <u-boot/sha256.h> | |
d16b38f4 | 37 | #include <u-boot/sha512.h> |
2dd90027 | 38 | #include <u-boot/md5.h> |
460408ef | 39 | |
10088fb0 KR |
40 | #if !defined(USE_HOSTCC) && defined(CONFIG_NEEDS_MANUAL_RELOC) |
41 | DECLARE_GLOBAL_DATA_PTR; | |
42 | #endif | |
43 | ||
44 | static void reloc_update(void); | |
45 | ||
d54f7e3f | 46 | static int __maybe_unused hash_init_sha1(struct hash_algo *algo, void **ctxp) |
bf007ebb HT |
47 | { |
48 | sha1_context *ctx = malloc(sizeof(sha1_context)); | |
49 | sha1_starts(ctx); | |
50 | *ctxp = ctx; | |
51 | return 0; | |
52 | } | |
53 | ||
d54f7e3f SG |
54 | static int __maybe_unused hash_update_sha1(struct hash_algo *algo, void *ctx, |
55 | const void *buf, unsigned int size, | |
56 | int is_last) | |
bf007ebb HT |
57 | { |
58 | sha1_update((sha1_context *)ctx, buf, size); | |
59 | return 0; | |
60 | } | |
61 | ||
d54f7e3f SG |
62 | static int __maybe_unused hash_finish_sha1(struct hash_algo *algo, void *ctx, |
63 | void *dest_buf, int size) | |
bf007ebb HT |
64 | { |
65 | if (size < algo->digest_size) | |
66 | return -1; | |
67 | ||
68 | sha1_finish((sha1_context *)ctx, dest_buf); | |
69 | free(ctx); | |
70 | return 0; | |
71 | } | |
bf007ebb | 72 | |
d54f7e3f | 73 | static int __maybe_unused hash_init_sha256(struct hash_algo *algo, void **ctxp) |
bf007ebb HT |
74 | { |
75 | sha256_context *ctx = malloc(sizeof(sha256_context)); | |
76 | sha256_starts(ctx); | |
77 | *ctxp = ctx; | |
78 | return 0; | |
79 | } | |
80 | ||
d54f7e3f SG |
81 | static int __maybe_unused hash_update_sha256(struct hash_algo *algo, void *ctx, |
82 | const void *buf, uint size, | |
83 | int is_last) | |
bf007ebb HT |
84 | { |
85 | sha256_update((sha256_context *)ctx, buf, size); | |
86 | return 0; | |
87 | } | |
88 | ||
d54f7e3f SG |
89 | static int __maybe_unused hash_finish_sha256(struct hash_algo *algo, void *ctx, |
90 | void *dest_buf, int size) | |
bf007ebb HT |
91 | { |
92 | if (size < algo->digest_size) | |
93 | return -1; | |
94 | ||
95 | sha256_finish((sha256_context *)ctx, dest_buf); | |
96 | free(ctx); | |
97 | return 0; | |
98 | } | |
bf007ebb | 99 | |
d54f7e3f | 100 | static int __maybe_unused hash_init_sha384(struct hash_algo *algo, void **ctxp) |
d16b38f4 RD |
101 | { |
102 | sha512_context *ctx = malloc(sizeof(sha512_context)); | |
103 | sha384_starts(ctx); | |
104 | *ctxp = ctx; | |
105 | return 0; | |
106 | } | |
107 | ||
d54f7e3f SG |
108 | static int __maybe_unused hash_update_sha384(struct hash_algo *algo, void *ctx, |
109 | const void *buf, uint size, | |
110 | int is_last) | |
d16b38f4 RD |
111 | { |
112 | sha384_update((sha512_context *)ctx, buf, size); | |
113 | return 0; | |
114 | } | |
115 | ||
d54f7e3f SG |
116 | static int __maybe_unused hash_finish_sha384(struct hash_algo *algo, void *ctx, |
117 | void *dest_buf, int size) | |
d16b38f4 RD |
118 | { |
119 | if (size < algo->digest_size) | |
120 | return -1; | |
121 | ||
122 | sha384_finish((sha512_context *)ctx, dest_buf); | |
123 | free(ctx); | |
124 | return 0; | |
125 | } | |
d16b38f4 | 126 | |
d54f7e3f | 127 | static int __maybe_unused hash_init_sha512(struct hash_algo *algo, void **ctxp) |
d16b38f4 RD |
128 | { |
129 | sha512_context *ctx = malloc(sizeof(sha512_context)); | |
130 | sha512_starts(ctx); | |
131 | *ctxp = ctx; | |
132 | return 0; | |
133 | } | |
134 | ||
d54f7e3f SG |
135 | static int __maybe_unused hash_update_sha512(struct hash_algo *algo, void *ctx, |
136 | const void *buf, uint size, | |
137 | int is_last) | |
d16b38f4 RD |
138 | { |
139 | sha512_update((sha512_context *)ctx, buf, size); | |
140 | return 0; | |
141 | } | |
142 | ||
d54f7e3f SG |
143 | static int __maybe_unused hash_finish_sha512(struct hash_algo *algo, void *ctx, |
144 | void *dest_buf, int size) | |
d16b38f4 RD |
145 | { |
146 | if (size < algo->digest_size) | |
147 | return -1; | |
148 | ||
d16b38f4 RD |
149 | sha512_finish((sha512_context *)ctx, dest_buf); |
150 | free(ctx); | |
151 | return 0; | |
152 | } | |
d16b38f4 | 153 | |
51c2345b PT |
154 | static int hash_init_crc16_ccitt(struct hash_algo *algo, void **ctxp) |
155 | { | |
156 | uint16_t *ctx = malloc(sizeof(uint16_t)); | |
157 | *ctx = 0; | |
158 | *ctxp = ctx; | |
159 | return 0; | |
160 | } | |
161 | ||
162 | static int hash_update_crc16_ccitt(struct hash_algo *algo, void *ctx, | |
163 | const void *buf, unsigned int size, | |
164 | int is_last) | |
165 | { | |
166 | *((uint16_t *)ctx) = crc16_ccitt(*((uint16_t *)ctx), buf, size); | |
167 | return 0; | |
168 | } | |
169 | ||
170 | static int hash_finish_crc16_ccitt(struct hash_algo *algo, void *ctx, | |
171 | void *dest_buf, int size) | |
172 | { | |
173 | if (size < algo->digest_size) | |
174 | return -1; | |
175 | ||
176 | *((uint16_t *)dest_buf) = *((uint16_t *)ctx); | |
177 | free(ctx); | |
178 | return 0; | |
179 | } | |
180 | ||
e7d285b2 | 181 | static int __maybe_unused hash_init_crc32(struct hash_algo *algo, void **ctxp) |
bf007ebb HT |
182 | { |
183 | uint32_t *ctx = malloc(sizeof(uint32_t)); | |
184 | *ctx = 0; | |
185 | *ctxp = ctx; | |
186 | return 0; | |
187 | } | |
188 | ||
e7d285b2 SG |
189 | static int __maybe_unused hash_update_crc32(struct hash_algo *algo, void *ctx, |
190 | const void *buf, unsigned int size, | |
191 | int is_last) | |
bf007ebb HT |
192 | { |
193 | *((uint32_t *)ctx) = crc32(*((uint32_t *)ctx), buf, size); | |
194 | return 0; | |
195 | } | |
196 | ||
e7d285b2 SG |
197 | static int __maybe_unused hash_finish_crc32(struct hash_algo *algo, void *ctx, |
198 | void *dest_buf, int size) | |
bf007ebb HT |
199 | { |
200 | if (size < algo->digest_size) | |
201 | return -1; | |
202 | ||
203 | *((uint32_t *)dest_buf) = *((uint32_t *)ctx); | |
204 | free(ctx); | |
205 | return 0; | |
206 | } | |
207 | ||
460408ef | 208 | /* |
78eda89e TR |
209 | * These are the hash algorithms we support. If we have hardware acceleration |
210 | * is enable we will use that, otherwise a software version of the algorithm. | |
211 | * Note that algorithm names must be in lower case. | |
460408ef SG |
212 | */ |
213 | static struct hash_algo hash_algo[] = { | |
2c21256b | 214 | #if CONFIG_IS_ENABLED(MD5) |
fe54aeaa AG |
215 | { |
216 | .name = "md5", | |
217 | .digest_size = MD5_SUM_LEN, | |
218 | .chunk_size = CHUNKSZ_MD5, | |
219 | .hash_func_ws = md5_wd, | |
220 | }, | |
221 | #endif | |
2c21256b | 222 | #if CONFIG_IS_ENABLED(SHA1) |
1f9c9280 | 223 | { |
0cf207ec | 224 | .name = "sha1", |
78eda89e TR |
225 | .digest_size = SHA1_SUM_LEN, |
226 | .chunk_size = CHUNKSZ_SHA1, | |
2c21256b | 227 | #if CONFIG_IS_ENABLED(SHA_HW_ACCEL) |
78eda89e TR |
228 | .hash_func_ws = hw_sha1, |
229 | #else | |
230 | .hash_func_ws = sha1_csum_wd, | |
94e3c8c4 | 231 | #endif |
2c21256b | 232 | #if CONFIG_IS_ENABLED(SHA_PROG_HW_ACCEL) |
78eda89e TR |
233 | .hash_init = hw_sha_init, |
234 | .hash_update = hw_sha_update, | |
235 | .hash_finish = hw_sha_finish, | |
236 | #else | |
237 | .hash_init = hash_init_sha1, | |
238 | .hash_update = hash_update_sha1, | |
239 | .hash_finish = hash_finish_sha1, | |
1f9c9280 | 240 | #endif |
460408ef SG |
241 | }, |
242 | #endif | |
2c21256b | 243 | #if CONFIG_IS_ENABLED(SHA256) |
460408ef | 244 | { |
78eda89e TR |
245 | .name = "sha256", |
246 | .digest_size = SHA256_SUM_LEN, | |
247 | .chunk_size = CHUNKSZ_SHA256, | |
2c21256b | 248 | #if CONFIG_IS_ENABLED(SHA_HW_ACCEL) |
78eda89e TR |
249 | .hash_func_ws = hw_sha256, |
250 | #else | |
251 | .hash_func_ws = sha256_csum_wd, | |
252 | #endif | |
2c21256b | 253 | #if CONFIG_IS_ENABLED(SHA_PROG_HW_ACCEL) |
78eda89e TR |
254 | .hash_init = hw_sha_init, |
255 | .hash_update = hw_sha_update, | |
256 | .hash_finish = hw_sha_finish, | |
257 | #else | |
258 | .hash_init = hash_init_sha256, | |
259 | .hash_update = hash_update_sha256, | |
260 | .hash_finish = hash_finish_sha256, | |
261 | #endif | |
460408ef | 262 | }, |
d16b38f4 | 263 | #endif |
2c21256b | 264 | #if CONFIG_IS_ENABLED(SHA384) |
d16b38f4 RD |
265 | { |
266 | .name = "sha384", | |
267 | .digest_size = SHA384_SUM_LEN, | |
268 | .chunk_size = CHUNKSZ_SHA384, | |
2c21256b | 269 | #if CONFIG_IS_ENABLED(SHA512_HW_ACCEL) |
a479f103 JS |
270 | .hash_func_ws = hw_sha384, |
271 | #else | |
d16b38f4 | 272 | .hash_func_ws = sha384_csum_wd, |
a479f103 | 273 | #endif |
2c21256b | 274 | #if CONFIG_IS_ENABLED(SHA512_HW_ACCEL) && CONFIG_IS_ENABLED(SHA_PROG_HW_ACCEL) |
a479f103 JS |
275 | .hash_init = hw_sha_init, |
276 | .hash_update = hw_sha_update, | |
277 | .hash_finish = hw_sha_finish, | |
278 | #else | |
d16b38f4 RD |
279 | .hash_init = hash_init_sha384, |
280 | .hash_update = hash_update_sha384, | |
281 | .hash_finish = hash_finish_sha384, | |
a479f103 | 282 | #endif |
d16b38f4 RD |
283 | }, |
284 | #endif | |
2c21256b | 285 | #if CONFIG_IS_ENABLED(SHA512) |
d16b38f4 RD |
286 | { |
287 | .name = "sha512", | |
288 | .digest_size = SHA512_SUM_LEN, | |
289 | .chunk_size = CHUNKSZ_SHA512, | |
2c21256b | 290 | #if CONFIG_IS_ENABLED(SHA512_HW_ACCEL) |
a479f103 JS |
291 | .hash_func_ws = hw_sha512, |
292 | #else | |
d16b38f4 | 293 | .hash_func_ws = sha512_csum_wd, |
a479f103 | 294 | #endif |
2c21256b | 295 | #if CONFIG_IS_ENABLED(SHA512_HW_ACCEL) && CONFIG_IS_ENABLED(SHA_PROG_HW_ACCEL) |
a479f103 JS |
296 | .hash_init = hw_sha_init, |
297 | .hash_update = hw_sha_update, | |
298 | .hash_finish = hw_sha_finish, | |
299 | #else | |
d16b38f4 RD |
300 | .hash_init = hash_init_sha512, |
301 | .hash_update = hash_update_sha512, | |
302 | .hash_finish = hash_finish_sha512, | |
a479f103 | 303 | #endif |
d16b38f4 | 304 | }, |
460408ef | 305 | #endif |
51c2345b PT |
306 | { |
307 | .name = "crc16-ccitt", | |
308 | .digest_size = 2, | |
309 | .chunk_size = CHUNKSZ, | |
310 | .hash_func_ws = crc16_ccitt_wd_buf, | |
311 | .hash_init = hash_init_crc16_ccitt, | |
312 | .hash_update = hash_update_crc16_ccitt, | |
313 | .hash_finish = hash_finish_crc16_ccitt, | |
314 | }, | |
e7d285b2 | 315 | #if CONFIG_IS_ENABLED(CRC32) |
d20a40de | 316 | { |
78eda89e TR |
317 | .name = "crc32", |
318 | .digest_size = 4, | |
319 | .chunk_size = CHUNKSZ_CRC32, | |
320 | .hash_func_ws = crc32_wd_buf, | |
321 | .hash_init = hash_init_crc32, | |
322 | .hash_update = hash_update_crc32, | |
323 | .hash_finish = hash_finish_crc32, | |
d20a40de | 324 | }, |
e7d285b2 | 325 | #endif |
460408ef SG |
326 | }; |
327 | ||
d20a40de | 328 | /* Try to minimize code size for boards that don't want much hashing */ |
2c21256b SG |
329 | #if CONFIG_IS_ENABLED(SHA256) || CONFIG_IS_ENABLED(CMD_SHA1SUM) || \ |
330 | CONFIG_IS_ENABLED(CRC32_VERIFY) || CONFIG_IS_ENABLED(CMD_HASH) || \ | |
331 | CONFIG_IS_ENABLED(SHA384) || CONFIG_IS_ENABLED(SHA512) | |
d20a40de SG |
332 | #define multi_hash() 1 |
333 | #else | |
334 | #define multi_hash() 0 | |
335 | #endif | |
336 | ||
10088fb0 KR |
337 | static void reloc_update(void) |
338 | { | |
339 | #if !defined(USE_HOSTCC) && defined(CONFIG_NEEDS_MANUAL_RELOC) | |
340 | int i; | |
341 | static bool done; | |
342 | ||
343 | if (!done) { | |
344 | done = true; | |
345 | for (i = 0; i < ARRAY_SIZE(hash_algo); i++) { | |
346 | hash_algo[i].name += gd->reloc_off; | |
347 | hash_algo[i].hash_func_ws += gd->reloc_off; | |
348 | hash_algo[i].hash_init += gd->reloc_off; | |
349 | hash_algo[i].hash_update += gd->reloc_off; | |
350 | hash_algo[i].hash_finish += gd->reloc_off; | |
351 | } | |
352 | } | |
353 | #endif | |
354 | } | |
355 | ||
2dd90027 RG |
356 | int hash_lookup_algo(const char *algo_name, struct hash_algo **algop) |
357 | { | |
358 | int i; | |
359 | ||
10088fb0 KR |
360 | reloc_update(); |
361 | ||
2dd90027 RG |
362 | for (i = 0; i < ARRAY_SIZE(hash_algo); i++) { |
363 | if (!strcmp(algo_name, hash_algo[i].name)) { | |
364 | *algop = &hash_algo[i]; | |
365 | return 0; | |
366 | } | |
367 | } | |
368 | ||
369 | debug("Unknown hash algorithm '%s'\n", algo_name); | |
370 | return -EPROTONOSUPPORT; | |
371 | } | |
372 | ||
373 | int hash_progressive_lookup_algo(const char *algo_name, | |
374 | struct hash_algo **algop) | |
375 | { | |
376 | int i; | |
377 | ||
10088fb0 KR |
378 | reloc_update(); |
379 | ||
2dd90027 RG |
380 | for (i = 0; i < ARRAY_SIZE(hash_algo); i++) { |
381 | if (!strcmp(algo_name, hash_algo[i].name)) { | |
382 | if (hash_algo[i].hash_init) { | |
383 | *algop = &hash_algo[i]; | |
384 | return 0; | |
385 | } | |
386 | } | |
387 | } | |
388 | ||
389 | debug("Unknown hash algorithm '%s'\n", algo_name); | |
390 | return -EPROTONOSUPPORT; | |
391 | } | |
392 | ||
393 | #ifndef USE_HOSTCC | |
8f0b1e24 SR |
394 | int hash_parse_string(const char *algo_name, const char *str, uint8_t *result) |
395 | { | |
396 | struct hash_algo *algo; | |
397 | int ret; | |
398 | int i; | |
399 | ||
400 | ret = hash_lookup_algo(algo_name, &algo); | |
401 | if (ret) | |
402 | return ret; | |
403 | ||
404 | for (i = 0; i < algo->digest_size; i++) { | |
405 | char chr[3]; | |
406 | ||
031725f8 | 407 | strlcpy(chr, &str[i * 2], 3); |
7e5f460e | 408 | result[i] = hextoul(chr, NULL); |
8f0b1e24 SR |
409 | } |
410 | ||
411 | return 0; | |
412 | } | |
413 | ||
48ad68de TR |
414 | int hash_block(const char *algo_name, const void *data, unsigned int len, |
415 | uint8_t *output, int *output_size) | |
416 | { | |
417 | struct hash_algo *algo; | |
418 | int ret; | |
419 | ||
420 | ret = hash_lookup_algo(algo_name, &algo); | |
421 | if (ret) | |
422 | return ret; | |
423 | ||
424 | if (output_size && *output_size < algo->digest_size) { | |
425 | debug("Output buffer size %d too small (need %d bytes)", | |
426 | *output_size, algo->digest_size); | |
427 | return -ENOSPC; | |
428 | } | |
429 | if (output_size) | |
430 | *output_size = algo->digest_size; | |
431 | algo->hash_func_ws(data, len, output, algo->chunk_size); | |
432 | ||
433 | return 0; | |
434 | } | |
435 | ||
2c21256b SG |
436 | #if !defined(CONFIG_SPL_BUILD) && (defined(CONFIG_CMD_HASH) || \ |
437 | defined(CONFIG_CMD_SHA1SUM) || defined(CONFIG_CMD_CRC32)) | |
460408ef SG |
438 | /** |
439 | * store_result: Store the resulting sum to an address or variable | |
440 | * | |
441 | * @algo: Hash algorithm being used | |
442 | * @sum: Hash digest (algo->digest_size bytes) | |
443 | * @dest: Destination, interpreted as a hex address if it starts | |
d5b76673 SG |
444 | * with * (or allow_env_vars is 0) or otherwise as an |
445 | * environment variable. | |
446 | * @allow_env_vars: non-zero to permit storing the result to an | |
447 | * variable environment | |
460408ef | 448 | */ |
04819a4f | 449 | static void store_result(struct hash_algo *algo, const uint8_t *sum, |
d5b76673 | 450 | const char *dest, int allow_env_vars) |
460408ef SG |
451 | { |
452 | unsigned int i; | |
d5b76673 | 453 | int env_var = 0; |
460408ef | 454 | |
d5b76673 SG |
455 | /* |
456 | * If environment variables are allowed, then we assume that 'dest' | |
457 | * is an environment variable, unless it starts with *, in which | |
458 | * case we assume it is an address. If not allowed, it is always an | |
459 | * address. This is to support the crc32 command. | |
460 | */ | |
461 | if (allow_env_vars) { | |
462 | if (*dest == '*') | |
463 | dest++; | |
464 | else | |
465 | env_var = 1; | |
466 | } | |
460408ef | 467 | |
d5b76673 | 468 | if (env_var) { |
460408ef SG |
469 | char str_output[HASH_MAX_DIGEST_SIZE * 2 + 1]; |
470 | char *str_ptr = str_output; | |
471 | ||
472 | for (i = 0; i < algo->digest_size; i++) { | |
473 | sprintf(str_ptr, "%02x", sum[i]); | |
474 | str_ptr += 2; | |
475 | } | |
8b9cc866 | 476 | *str_ptr = '\0'; |
382bee57 | 477 | env_set(dest, str_output); |
d5b76673 | 478 | } else { |
bd091b67 SG |
479 | ulong addr; |
480 | void *buf; | |
d5b76673 | 481 | |
7e5f460e | 482 | addr = hextoul(dest, NULL); |
bd091b67 SG |
483 | buf = map_sysmem(addr, algo->digest_size); |
484 | memcpy(buf, sum, algo->digest_size); | |
485 | unmap_sysmem(buf); | |
460408ef SG |
486 | } |
487 | } | |
488 | ||
489 | /** | |
490 | * parse_verify_sum: Parse a hash verification parameter | |
491 | * | |
492 | * @algo: Hash algorithm being used | |
493 | * @verify_str: Argument to parse. If it starts with * then it is | |
494 | * interpreted as a hex address containing the hash. | |
495 | * If the length is exactly the right number of hex digits | |
496 | * for the digest size, then we assume it is a hex digest. | |
497 | * Otherwise we assume it is an environment variable, and | |
498 | * look up its value (it must contain a hex digest). | |
499 | * @vsum: Returns binary digest value (algo->digest_size bytes) | |
d5b76673 SG |
500 | * @allow_env_vars: non-zero to permit storing the result to an environment |
501 | * variable. If 0 then verify_str is assumed to be an | |
502 | * address, and the * prefix is not expected. | |
460408ef SG |
503 | * @return 0 if ok, non-zero on error |
504 | */ | |
04819a4f SG |
505 | static int parse_verify_sum(struct hash_algo *algo, char *verify_str, |
506 | uint8_t *vsum, int allow_env_vars) | |
460408ef | 507 | { |
d5b76673 SG |
508 | int env_var = 0; |
509 | ||
510 | /* See comment above in store_result() */ | |
511 | if (allow_env_vars) { | |
512 | if (*verify_str == '*') | |
513 | verify_str++; | |
514 | else | |
515 | env_var = 1; | |
516 | } | |
517 | ||
3ef46a99 | 518 | if (!env_var) { |
bd091b67 SG |
519 | ulong addr; |
520 | void *buf; | |
460408ef | 521 | |
7e5f460e | 522 | addr = hextoul(verify_str, NULL); |
bd091b67 SG |
523 | buf = map_sysmem(addr, algo->digest_size); |
524 | memcpy(vsum, buf, algo->digest_size); | |
460408ef | 525 | } else { |
460408ef SG |
526 | char *vsum_str; |
527 | int digits = algo->digest_size * 2; | |
528 | ||
529 | /* | |
530 | * As with the original code from sha1sum.c, we assume that a | |
531 | * string which matches the digest size exactly is a hex | |
532 | * string and not an environment variable. | |
533 | */ | |
534 | if (strlen(verify_str) == digits) | |
535 | vsum_str = verify_str; | |
536 | else { | |
00caae6d | 537 | vsum_str = env_get(verify_str); |
460408ef SG |
538 | if (vsum_str == NULL || strlen(vsum_str) != digits) { |
539 | printf("Expected %d hex digits in env var\n", | |
540 | digits); | |
541 | return 1; | |
542 | } | |
543 | } | |
544 | ||
8f0b1e24 | 545 | hash_parse_string(algo->name, vsum_str, vsum); |
460408ef SG |
546 | } |
547 | return 0; | |
548 | } | |
549 | ||
48ad68de | 550 | static void hash_show(struct hash_algo *algo, ulong addr, ulong len, uint8_t *output) |
460408ef SG |
551 | { |
552 | int i; | |
553 | ||
554 | printf("%s for %08lx ... %08lx ==> ", algo->name, addr, addr + len - 1); | |
555 | for (i = 0; i < algo->digest_size; i++) | |
556 | printf("%02x", output[i]); | |
557 | } | |
558 | ||
09140113 SG |
559 | int hash_command(const char *algo_name, int flags, struct cmd_tbl *cmdtp, |
560 | int flag, int argc, char *const argv[]) | |
460408ef | 561 | { |
460408ef | 562 | ulong addr, len; |
460408ef | 563 | |
3ef46a99 | 564 | if ((argc < 2) || ((flags & HASH_FLAG_VERIFY) && (argc < 3))) |
460408ef SG |
565 | return CMD_RET_USAGE; |
566 | ||
7e5f460e SG |
567 | addr = hextoul(*argv++, NULL); |
568 | len = hextoul(*argv++, NULL); | |
d5b76673 | 569 | |
d20a40de SG |
570 | if (multi_hash()) { |
571 | struct hash_algo *algo; | |
d7af2baa | 572 | u8 *output; |
04819a4f | 573 | uint8_t vsum[HASH_MAX_DIGEST_SIZE]; |
bd091b67 | 574 | void *buf; |
460408ef | 575 | |
bf007ebb | 576 | if (hash_lookup_algo(algo_name, &algo)) { |
d20a40de SG |
577 | printf("Unknown hash algorithm '%s'\n", algo_name); |
578 | return CMD_RET_USAGE; | |
579 | } | |
580 | argc -= 2; | |
581 | ||
582 | if (algo->digest_size > HASH_MAX_DIGEST_SIZE) { | |
583 | puts("HASH_MAX_DIGEST_SIZE exceeded\n"); | |
584 | return 1; | |
585 | } | |
460408ef | 586 | |
d7af2baa BL |
587 | output = memalign(ARCH_DMA_MINALIGN, |
588 | sizeof(uint32_t) * HASH_MAX_DIGEST_SIZE); | |
589 | ||
bd091b67 SG |
590 | buf = map_sysmem(addr, len); |
591 | algo->hash_func_ws(buf, len, output, algo->chunk_size); | |
592 | unmap_sysmem(buf); | |
460408ef | 593 | |
d20a40de | 594 | /* Try to avoid code bloat when verify is not needed */ |
221a949e DT |
595 | #if defined(CONFIG_CRC32_VERIFY) || defined(CONFIG_SHA1SUM_VERIFY) || \ |
596 | defined(CONFIG_HASH_VERIFY) | |
d20a40de | 597 | if (flags & HASH_FLAG_VERIFY) { |
460408ef | 598 | #else |
d20a40de | 599 | if (0) { |
460408ef | 600 | #endif |
d20a40de | 601 | if (parse_verify_sum(algo, *argv, vsum, |
d5b76673 | 602 | flags & HASH_FLAG_ENV)) { |
d20a40de SG |
603 | printf("ERROR: %s does not contain a valid " |
604 | "%s sum\n", *argv, algo->name); | |
605 | return 1; | |
606 | } | |
607 | if (memcmp(output, vsum, algo->digest_size) != 0) { | |
608 | int i; | |
460408ef | 609 | |
31890ae2 | 610 | hash_show(algo, addr, len, output); |
d20a40de SG |
611 | printf(" != "); |
612 | for (i = 0; i < algo->digest_size; i++) | |
613 | printf("%02x", vsum[i]); | |
614 | puts(" ** ERROR **\n"); | |
615 | return 1; | |
616 | } | |
617 | } else { | |
31890ae2 | 618 | hash_show(algo, addr, len, output); |
d20a40de SG |
619 | printf("\n"); |
620 | ||
621 | if (argc) { | |
622 | store_result(algo, output, *argv, | |
623 | flags & HASH_FLAG_ENV); | |
624 | } | |
d7af2baa BL |
625 | unmap_sysmem(output); |
626 | ||
460408ef | 627 | } |
d20a40de SG |
628 | |
629 | /* Horrible code size hack for boards that just want crc32 */ | |
460408ef | 630 | } else { |
d20a40de SG |
631 | ulong crc; |
632 | ulong *ptr; | |
633 | ||
634 | crc = crc32_wd(0, (const uchar *)addr, len, CHUNKSZ_CRC32); | |
635 | ||
636 | printf("CRC32 for %08lx ... %08lx ==> %08lx\n", | |
637 | addr, addr + len - 1, crc); | |
460408ef | 638 | |
4b756b01 | 639 | if (argc >= 3) { |
7e5f460e | 640 | ptr = (ulong *)hextoul(argv[0], NULL); |
d20a40de | 641 | *ptr = crc; |
d5b76673 | 642 | } |
460408ef SG |
643 | } |
644 | ||
645 | return 0; | |
646 | } | |
d70f919e SG |
647 | #endif /* CONFIG_CMD_HASH || CONFIG_CMD_SHA1SUM || CONFIG_CMD_CRC32) */ |
648 | #endif /* !USE_HOSTCC */ |