blob: 3884298edf23f08fffd488d1dd388fa7bcf6a388 [file] [log] [blame]
Tom Rini83d290c2018-05-06 17:58:06 -04001// SPDX-License-Identifier: GPL-2.0+
Simon Glass460408e2012-12-05 14:46:36 +00002/*
3 * Copyright (c) 2012 The Chromium OS Authors.
4 *
5 * (C) Copyright 2011
6 * Joe Hershberger, National Instruments, joe.hershberger@ni.com
7 *
8 * (C) Copyright 2000
9 * Wolfgang Denk, DENX Software Engineering, wd@denx.de.
Simon Glass460408e2012-12-05 14:46:36 +000010 */
11
Ruchika Gupta2dd90022015-01-23 16:01:58 +053012#ifndef USE_HOSTCC
Simon Glass460408e2012-12-05 14:46:36 +000013#include <common.h>
14#include <command.h>
Simon Glass9fb625c2019-08-01 09:46:51 -060015#include <env.h>
Simon Glassf7ae49f2020-05-10 11:40:05 -060016#include <log.h>
Hung-ying Tyanbf007eb2014-03-03 12:19:28 +010017#include <malloc.h>
Joe Hershberger0eb25b62015-03-22 17:08:59 -050018#include <mapmem.h>
Akshay Saraswat1f9c9282013-03-20 21:00:58 +000019#include <hw_sha.h>
Simon Glass90526e92020-05-10 11:39:56 -060020#include <asm/cache.h>
Simon Glass401d1c42020-10-30 21:38:53 -060021#include <asm/global_data.h>
Simon Glassbd091b62013-02-24 17:33:31 +000022#include <asm/io.h>
Masahiro Yamada1221ce42016-09-21 11:28:55 +090023#include <linux/errno.h>
Simon Glass3db71102019-11-14 12:57:16 -070024#include <u-boot/crc.h>
Ruchika Gupta2dd90022015-01-23 16:01:58 +053025#else
26#include "mkimage.h"
27#include <time.h>
Ruchika Gupta2dd90022015-01-23 16:01:58 +053028#endif /* !USE_HOSTCC*/
29
30#include <hash.h>
Simon Glass4d72caa2020-05-10 11:40:01 -060031#include <image.h>
Ruchika Gupta2dd90022015-01-23 16:01:58 +053032#include <u-boot/crc.h>
33#include <u-boot/sha1.h>
34#include <u-boot/sha256.h>
Reuben Dowled16b38f2020-04-16 17:36:52 +120035#include <u-boot/sha512.h>
Ruchika Gupta2dd90022015-01-23 16:01:58 +053036#include <u-boot/md5.h>
Simon Glass460408e2012-12-05 14:46:36 +000037
T Karthik Reddy10088fb2019-03-16 15:23:01 +053038#if !defined(USE_HOSTCC) && defined(CONFIG_NEEDS_MANUAL_RELOC)
39DECLARE_GLOBAL_DATA_PTR;
40#endif
41
42static void reloc_update(void);
43
Tom Rini78eda892017-08-14 16:38:07 -040044#if defined(CONFIG_SHA1) && !defined(CONFIG_SHA_PROG_HW_ACCEL)
Hung-ying Tyanbf007eb2014-03-03 12:19:28 +010045static int hash_init_sha1(struct hash_algo *algo, void **ctxp)
46{
47 sha1_context *ctx = malloc(sizeof(sha1_context));
48 sha1_starts(ctx);
49 *ctxp = ctx;
50 return 0;
51}
52
53static int hash_update_sha1(struct hash_algo *algo, void *ctx, const void *buf,
54 unsigned int size, int is_last)
55{
56 sha1_update((sha1_context *)ctx, buf, size);
57 return 0;
58}
59
60static int hash_finish_sha1(struct hash_algo *algo, void *ctx, void *dest_buf,
61 int size)
62{
63 if (size < algo->digest_size)
64 return -1;
65
66 sha1_finish((sha1_context *)ctx, dest_buf);
67 free(ctx);
68 return 0;
69}
70#endif
71
Tom Rini78eda892017-08-14 16:38:07 -040072#if defined(CONFIG_SHA256) && !defined(CONFIG_SHA_PROG_HW_ACCEL)
Hung-ying Tyanbf007eb2014-03-03 12:19:28 +010073static int hash_init_sha256(struct hash_algo *algo, void **ctxp)
74{
75 sha256_context *ctx = malloc(sizeof(sha256_context));
76 sha256_starts(ctx);
77 *ctxp = ctx;
78 return 0;
79}
80
81static int hash_update_sha256(struct hash_algo *algo, void *ctx,
82 const void *buf, unsigned int size, int is_last)
83{
84 sha256_update((sha256_context *)ctx, buf, size);
85 return 0;
86}
87
88static int hash_finish_sha256(struct hash_algo *algo, void *ctx, void
89 *dest_buf, int size)
90{
91 if (size < algo->digest_size)
92 return -1;
93
94 sha256_finish((sha256_context *)ctx, dest_buf);
95 free(ctx);
96 return 0;
97}
98#endif
99
Joel Stanleya479f102021-02-17 13:50:42 +1030100#if defined(CONFIG_SHA384) && !defined(CONFIG_SHA_PROG_HW_ACCEL)
Reuben Dowled16b38f2020-04-16 17:36:52 +1200101static int hash_init_sha384(struct hash_algo *algo, void **ctxp)
102{
103 sha512_context *ctx = malloc(sizeof(sha512_context));
104 sha384_starts(ctx);
105 *ctxp = ctx;
106 return 0;
107}
108
109static int hash_update_sha384(struct hash_algo *algo, void *ctx,
110 const void *buf, unsigned int size, int is_last)
111{
112 sha384_update((sha512_context *)ctx, buf, size);
113 return 0;
114}
115
116static int hash_finish_sha384(struct hash_algo *algo, void *ctx, void
117 *dest_buf, int size)
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}
126#endif
127
Joel Stanleya479f102021-02-17 13:50:42 +1030128#if defined(CONFIG_SHA512) && !defined(CONFIG_SHA_PROG_HW_ACCEL)
Reuben Dowled16b38f2020-04-16 17:36:52 +1200129static int hash_init_sha512(struct hash_algo *algo, void **ctxp)
130{
131 sha512_context *ctx = malloc(sizeof(sha512_context));
132 sha512_starts(ctx);
133 *ctxp = ctx;
134 return 0;
135}
136
137static int hash_update_sha512(struct hash_algo *algo, void *ctx,
138 const void *buf, unsigned int size, int is_last)
139{
140 sha512_update((sha512_context *)ctx, buf, size);
141 return 0;
142}
143
144static int hash_finish_sha512(struct hash_algo *algo, void *ctx, void
145 *dest_buf, int size)
146{
147 if (size < algo->digest_size)
148 return -1;
149
Reuben Dowled16b38f2020-04-16 17:36:52 +1200150 sha512_finish((sha512_context *)ctx, dest_buf);
151 free(ctx);
152 return 0;
153}
154#endif
155
156
Philipp Tomsich51c23452018-11-25 19:22:19 +0100157static int hash_init_crc16_ccitt(struct hash_algo *algo, void **ctxp)
158{
159 uint16_t *ctx = malloc(sizeof(uint16_t));
160 *ctx = 0;
161 *ctxp = ctx;
162 return 0;
163}
164
165static int hash_update_crc16_ccitt(struct hash_algo *algo, void *ctx,
166 const void *buf, unsigned int size,
167 int is_last)
168{
169 *((uint16_t *)ctx) = crc16_ccitt(*((uint16_t *)ctx), buf, size);
170 return 0;
171}
172
173static int hash_finish_crc16_ccitt(struct hash_algo *algo, void *ctx,
174 void *dest_buf, int size)
175{
176 if (size < algo->digest_size)
177 return -1;
178
179 *((uint16_t *)dest_buf) = *((uint16_t *)ctx);
180 free(ctx);
181 return 0;
182}
183
Hung-ying Tyanbf007eb2014-03-03 12:19:28 +0100184static int hash_init_crc32(struct hash_algo *algo, void **ctxp)
185{
186 uint32_t *ctx = malloc(sizeof(uint32_t));
187 *ctx = 0;
188 *ctxp = ctx;
189 return 0;
190}
191
192static int hash_update_crc32(struct hash_algo *algo, void *ctx,
193 const void *buf, unsigned int size, int is_last)
194{
195 *((uint32_t *)ctx) = crc32(*((uint32_t *)ctx), buf, size);
196 return 0;
197}
198
199static int hash_finish_crc32(struct hash_algo *algo, void *ctx, void *dest_buf,
200 int size)
201{
202 if (size < algo->digest_size)
203 return -1;
204
205 *((uint32_t *)dest_buf) = *((uint32_t *)ctx);
206 free(ctx);
207 return 0;
208}
209
Alexandru Gagniucfe54aea2021-09-02 19:54:20 -0500210#ifdef USE_HOSTCC
211# define I_WANT_MD5 1
212#else
213# define I_WANT_MD5 CONFIG_IS_ENABLED(MD5)
214#endif
Simon Glass460408e2012-12-05 14:46:36 +0000215/*
Tom Rini78eda892017-08-14 16:38:07 -0400216 * These are the hash algorithms we support. If we have hardware acceleration
217 * is enable we will use that, otherwise a software version of the algorithm.
218 * Note that algorithm names must be in lower case.
Simon Glass460408e2012-12-05 14:46:36 +0000219 */
220static struct hash_algo hash_algo[] = {
Alexandru Gagniucfe54aea2021-09-02 19:54:20 -0500221#if I_WANT_MD5
222 {
223 .name = "md5",
224 .digest_size = MD5_SUM_LEN,
225 .chunk_size = CHUNKSZ_MD5,
226 .hash_func_ws = md5_wd,
227 },
228#endif
Ruchika Gupta46fe2c02015-01-23 16:01:57 +0530229#ifdef CONFIG_SHA1
Simon Glass460408e2012-12-05 14:46:36 +0000230 {
Wolfgang Denk0cf207e2021-09-27 17:42:39 +0200231 .name = "sha1",
Tom Rini78eda892017-08-14 16:38:07 -0400232 .digest_size = SHA1_SUM_LEN,
233 .chunk_size = CHUNKSZ_SHA1,
234#ifdef CONFIG_SHA_HW_ACCEL
235 .hash_func_ws = hw_sha1,
236#else
237 .hash_func_ws = sha1_csum_wd,
238#endif
239#ifdef CONFIG_SHA_PROG_HW_ACCEL
240 .hash_init = hw_sha_init,
241 .hash_update = hw_sha_update,
242 .hash_finish = hw_sha_finish,
243#else
244 .hash_init = hash_init_sha1,
245 .hash_update = hash_update_sha1,
246 .hash_finish = hash_finish_sha1,
247#endif
Simon Glass460408e2012-12-05 14:46:36 +0000248 },
249#endif
250#ifdef CONFIG_SHA256
251 {
Tom Rini78eda892017-08-14 16:38:07 -0400252 .name = "sha256",
253 .digest_size = SHA256_SUM_LEN,
254 .chunk_size = CHUNKSZ_SHA256,
255#ifdef CONFIG_SHA_HW_ACCEL
256 .hash_func_ws = hw_sha256,
257#else
258 .hash_func_ws = sha256_csum_wd,
259#endif
260#ifdef CONFIG_SHA_PROG_HW_ACCEL
261 .hash_init = hw_sha_init,
262 .hash_update = hw_sha_update,
263 .hash_finish = hw_sha_finish,
264#else
265 .hash_init = hash_init_sha256,
266 .hash_update = hash_update_sha256,
267 .hash_finish = hash_finish_sha256,
268#endif
Simon Glass460408e2012-12-05 14:46:36 +0000269 },
270#endif
Reuben Dowled16b38f2020-04-16 17:36:52 +1200271#ifdef CONFIG_SHA384
272 {
273 .name = "sha384",
274 .digest_size = SHA384_SUM_LEN,
275 .chunk_size = CHUNKSZ_SHA384,
Heinrich Schuchardte2ae4832021-05-14 07:08:27 +0200276#ifdef CONFIG_SHA512_HW_ACCEL
Joel Stanleya479f102021-02-17 13:50:42 +1030277 .hash_func_ws = hw_sha384,
278#else
Reuben Dowled16b38f2020-04-16 17:36:52 +1200279 .hash_func_ws = sha384_csum_wd,
Joel Stanleya479f102021-02-17 13:50:42 +1030280#endif
Heinrich Schuchardte2ae4832021-05-14 07:08:27 +0200281#if defined(CONFIG_SHA512_HW_ACCEL) && defined(CONFIG_SHA_PROG_HW_ACCEL)
Joel Stanleya479f102021-02-17 13:50:42 +1030282 .hash_init = hw_sha_init,
283 .hash_update = hw_sha_update,
284 .hash_finish = hw_sha_finish,
285#else
Reuben Dowled16b38f2020-04-16 17:36:52 +1200286 .hash_init = hash_init_sha384,
287 .hash_update = hash_update_sha384,
288 .hash_finish = hash_finish_sha384,
Joel Stanleya479f102021-02-17 13:50:42 +1030289#endif
Reuben Dowled16b38f2020-04-16 17:36:52 +1200290 },
291#endif
292#ifdef CONFIG_SHA512
293 {
294 .name = "sha512",
295 .digest_size = SHA512_SUM_LEN,
296 .chunk_size = CHUNKSZ_SHA512,
Heinrich Schuchardte2ae4832021-05-14 07:08:27 +0200297#ifdef CONFIG_SHA512_HW_ACCEL
Joel Stanleya479f102021-02-17 13:50:42 +1030298 .hash_func_ws = hw_sha512,
299#else
Reuben Dowled16b38f2020-04-16 17:36:52 +1200300 .hash_func_ws = sha512_csum_wd,
Joel Stanleya479f102021-02-17 13:50:42 +1030301#endif
Heinrich Schuchardte2ae4832021-05-14 07:08:27 +0200302#if defined(CONFIG_SHA512_HW_ACCEL) && defined(CONFIG_SHA_PROG_HW_ACCEL)
Joel Stanleya479f102021-02-17 13:50:42 +1030303 .hash_init = hw_sha_init,
304 .hash_update = hw_sha_update,
305 .hash_finish = hw_sha_finish,
306#else
Reuben Dowled16b38f2020-04-16 17:36:52 +1200307 .hash_init = hash_init_sha512,
308 .hash_update = hash_update_sha512,
309 .hash_finish = hash_finish_sha512,
Joel Stanleya479f102021-02-17 13:50:42 +1030310#endif
Reuben Dowled16b38f2020-04-16 17:36:52 +1200311 },
312#endif
Simon Glassd20a40d2013-02-24 20:30:22 +0000313 {
Philipp Tomsich51c23452018-11-25 19:22:19 +0100314 .name = "crc16-ccitt",
315 .digest_size = 2,
316 .chunk_size = CHUNKSZ,
317 .hash_func_ws = crc16_ccitt_wd_buf,
318 .hash_init = hash_init_crc16_ccitt,
319 .hash_update = hash_update_crc16_ccitt,
320 .hash_finish = hash_finish_crc16_ccitt,
321 },
322 {
Tom Rini78eda892017-08-14 16:38:07 -0400323 .name = "crc32",
324 .digest_size = 4,
325 .chunk_size = CHUNKSZ_CRC32,
326 .hash_func_ws = crc32_wd_buf,
327 .hash_init = hash_init_crc32,
328 .hash_update = hash_update_crc32,
329 .hash_finish = hash_finish_crc32,
Simon Glassd20a40d2013-02-24 20:30:22 +0000330 },
Simon Glass460408e2012-12-05 14:46:36 +0000331};
332
Simon Glassd20a40d2013-02-24 20:30:22 +0000333/* Try to minimize code size for boards that don't want much hashing */
Daniel Thompson221a9492017-05-19 17:26:58 +0100334#if defined(CONFIG_SHA256) || defined(CONFIG_CMD_SHA1SUM) || \
Reuben Dowled16b38f2020-04-16 17:36:52 +1200335 defined(CONFIG_CRC32_VERIFY) || defined(CONFIG_CMD_HASH) || \
336 defined(CONFIG_SHA384) || defined(CONFIG_SHA512)
Simon Glassd20a40d2013-02-24 20:30:22 +0000337#define multi_hash() 1
338#else
339#define multi_hash() 0
340#endif
341
T Karthik Reddy10088fb2019-03-16 15:23:01 +0530342static void reloc_update(void)
343{
344#if !defined(USE_HOSTCC) && defined(CONFIG_NEEDS_MANUAL_RELOC)
345 int i;
346 static bool done;
347
348 if (!done) {
349 done = true;
350 for (i = 0; i < ARRAY_SIZE(hash_algo); i++) {
351 hash_algo[i].name += gd->reloc_off;
352 hash_algo[i].hash_func_ws += gd->reloc_off;
353 hash_algo[i].hash_init += gd->reloc_off;
354 hash_algo[i].hash_update += gd->reloc_off;
355 hash_algo[i].hash_finish += gd->reloc_off;
356 }
357 }
358#endif
359}
360
Ruchika Gupta2dd90022015-01-23 16:01:58 +0530361int hash_lookup_algo(const char *algo_name, struct hash_algo **algop)
362{
363 int i;
364
T Karthik Reddy10088fb2019-03-16 15:23:01 +0530365 reloc_update();
366
Ruchika Gupta2dd90022015-01-23 16:01:58 +0530367 for (i = 0; i < ARRAY_SIZE(hash_algo); i++) {
368 if (!strcmp(algo_name, hash_algo[i].name)) {
369 *algop = &hash_algo[i];
370 return 0;
371 }
372 }
373
374 debug("Unknown hash algorithm '%s'\n", algo_name);
375 return -EPROTONOSUPPORT;
376}
377
378int hash_progressive_lookup_algo(const char *algo_name,
379 struct hash_algo **algop)
380{
381 int i;
382
T Karthik Reddy10088fb2019-03-16 15:23:01 +0530383 reloc_update();
384
Ruchika Gupta2dd90022015-01-23 16:01:58 +0530385 for (i = 0; i < ARRAY_SIZE(hash_algo); i++) {
386 if (!strcmp(algo_name, hash_algo[i].name)) {
387 if (hash_algo[i].hash_init) {
388 *algop = &hash_algo[i];
389 return 0;
390 }
391 }
392 }
393
394 debug("Unknown hash algorithm '%s'\n", algo_name);
395 return -EPROTONOSUPPORT;
396}
397
398#ifndef USE_HOSTCC
Stefan Roese8f0b1e22015-05-18 14:08:24 +0200399int hash_parse_string(const char *algo_name, const char *str, uint8_t *result)
400{
401 struct hash_algo *algo;
402 int ret;
403 int i;
404
405 ret = hash_lookup_algo(algo_name, &algo);
406 if (ret)
407 return ret;
408
409 for (i = 0; i < algo->digest_size; i++) {
410 char chr[3];
411
Simon Glass031725f2021-07-24 09:03:28 -0600412 strlcpy(chr, &str[i * 2], 3);
Simon Glass7e5f4602021-07-24 09:03:29 -0600413 result[i] = hextoul(chr, NULL);
Stefan Roese8f0b1e22015-05-18 14:08:24 +0200414 }
415
416 return 0;
417}
418
Tom Rini48ad68d2016-01-05 08:47:48 -0500419int hash_block(const char *algo_name, const void *data, unsigned int len,
420 uint8_t *output, int *output_size)
421{
422 struct hash_algo *algo;
423 int ret;
424
425 ret = hash_lookup_algo(algo_name, &algo);
426 if (ret)
427 return ret;
428
429 if (output_size && *output_size < algo->digest_size) {
430 debug("Output buffer size %d too small (need %d bytes)",
431 *output_size, algo->digest_size);
432 return -ENOSPC;
433 }
434 if (output_size)
435 *output_size = algo->digest_size;
436 algo->hash_func_ws(data, len, output, algo->chunk_size);
437
438 return 0;
439}
440
441#if defined(CONFIG_CMD_HASH) || defined(CONFIG_CMD_SHA1SUM) || defined(CONFIG_CMD_CRC32)
Simon Glass460408e2012-12-05 14:46:36 +0000442/**
443 * store_result: Store the resulting sum to an address or variable
444 *
445 * @algo: Hash algorithm being used
446 * @sum: Hash digest (algo->digest_size bytes)
447 * @dest: Destination, interpreted as a hex address if it starts
Simon Glassd5b76672013-02-24 17:33:26 +0000448 * with * (or allow_env_vars is 0) or otherwise as an
449 * environment variable.
450 * @allow_env_vars: non-zero to permit storing the result to an
451 * variable environment
Simon Glass460408e2012-12-05 14:46:36 +0000452 */
Simon Glass04819a42014-06-12 07:24:41 -0600453static void store_result(struct hash_algo *algo, const uint8_t *sum,
Simon Glassd5b76672013-02-24 17:33:26 +0000454 const char *dest, int allow_env_vars)
Simon Glass460408e2012-12-05 14:46:36 +0000455{
456 unsigned int i;
Simon Glassd5b76672013-02-24 17:33:26 +0000457 int env_var = 0;
Simon Glass460408e2012-12-05 14:46:36 +0000458
Simon Glassd5b76672013-02-24 17:33:26 +0000459 /*
460 * If environment variables are allowed, then we assume that 'dest'
461 * is an environment variable, unless it starts with *, in which
462 * case we assume it is an address. If not allowed, it is always an
463 * address. This is to support the crc32 command.
464 */
465 if (allow_env_vars) {
466 if (*dest == '*')
467 dest++;
468 else
469 env_var = 1;
470 }
Simon Glass460408e2012-12-05 14:46:36 +0000471
Simon Glassd5b76672013-02-24 17:33:26 +0000472 if (env_var) {
Simon Glass460408e2012-12-05 14:46:36 +0000473 char str_output[HASH_MAX_DIGEST_SIZE * 2 + 1];
474 char *str_ptr = str_output;
475
476 for (i = 0; i < algo->digest_size; i++) {
477 sprintf(str_ptr, "%02x", sum[i]);
478 str_ptr += 2;
479 }
Jeroen Hofstee8b9cc862014-06-09 11:02:02 +0200480 *str_ptr = '\0';
Simon Glass382bee52017-08-03 12:22:09 -0600481 env_set(dest, str_output);
Simon Glassd5b76672013-02-24 17:33:26 +0000482 } else {
Simon Glassbd091b62013-02-24 17:33:31 +0000483 ulong addr;
484 void *buf;
Simon Glassd5b76672013-02-24 17:33:26 +0000485
Simon Glass7e5f4602021-07-24 09:03:29 -0600486 addr = hextoul(dest, NULL);
Simon Glassbd091b62013-02-24 17:33:31 +0000487 buf = map_sysmem(addr, algo->digest_size);
488 memcpy(buf, sum, algo->digest_size);
489 unmap_sysmem(buf);
Simon Glass460408e2012-12-05 14:46:36 +0000490 }
491}
492
493/**
494 * parse_verify_sum: Parse a hash verification parameter
495 *
496 * @algo: Hash algorithm being used
497 * @verify_str: Argument to parse. If it starts with * then it is
498 * interpreted as a hex address containing the hash.
499 * If the length is exactly the right number of hex digits
500 * for the digest size, then we assume it is a hex digest.
501 * Otherwise we assume it is an environment variable, and
502 * look up its value (it must contain a hex digest).
503 * @vsum: Returns binary digest value (algo->digest_size bytes)
Simon Glassd5b76672013-02-24 17:33:26 +0000504 * @allow_env_vars: non-zero to permit storing the result to an environment
505 * variable. If 0 then verify_str is assumed to be an
506 * address, and the * prefix is not expected.
Simon Glass460408e2012-12-05 14:46:36 +0000507 * @return 0 if ok, non-zero on error
508 */
Simon Glass04819a42014-06-12 07:24:41 -0600509static int parse_verify_sum(struct hash_algo *algo, char *verify_str,
510 uint8_t *vsum, int allow_env_vars)
Simon Glass460408e2012-12-05 14:46:36 +0000511{
Simon Glassd5b76672013-02-24 17:33:26 +0000512 int env_var = 0;
513
514 /* See comment above in store_result() */
515 if (allow_env_vars) {
516 if (*verify_str == '*')
517 verify_str++;
518 else
519 env_var = 1;
520 }
521
Nikolay Dimitrov3ef46a92014-12-12 20:01:23 +0200522 if (!env_var) {
Simon Glassbd091b62013-02-24 17:33:31 +0000523 ulong addr;
524 void *buf;
Simon Glass460408e2012-12-05 14:46:36 +0000525
Simon Glass7e5f4602021-07-24 09:03:29 -0600526 addr = hextoul(verify_str, NULL);
Simon Glassbd091b62013-02-24 17:33:31 +0000527 buf = map_sysmem(addr, algo->digest_size);
528 memcpy(vsum, buf, algo->digest_size);
Simon Glass460408e2012-12-05 14:46:36 +0000529 } else {
Simon Glass460408e2012-12-05 14:46:36 +0000530 char *vsum_str;
531 int digits = algo->digest_size * 2;
532
533 /*
534 * As with the original code from sha1sum.c, we assume that a
535 * string which matches the digest size exactly is a hex
536 * string and not an environment variable.
537 */
538 if (strlen(verify_str) == digits)
539 vsum_str = verify_str;
540 else {
Simon Glass00caae62017-08-03 12:22:12 -0600541 vsum_str = env_get(verify_str);
Simon Glass460408e2012-12-05 14:46:36 +0000542 if (vsum_str == NULL || strlen(vsum_str) != digits) {
543 printf("Expected %d hex digits in env var\n",
544 digits);
545 return 1;
546 }
547 }
548
Stefan Roese8f0b1e22015-05-18 14:08:24 +0200549 hash_parse_string(algo->name, vsum_str, vsum);
Simon Glass460408e2012-12-05 14:46:36 +0000550 }
551 return 0;
552}
553
Tom Rini48ad68d2016-01-05 08:47:48 -0500554static void hash_show(struct hash_algo *algo, ulong addr, ulong len, uint8_t *output)
Simon Glass460408e2012-12-05 14:46:36 +0000555{
556 int i;
557
558 printf("%s for %08lx ... %08lx ==> ", algo->name, addr, addr + len - 1);
559 for (i = 0; i < algo->digest_size; i++)
560 printf("%02x", output[i]);
561}
562
Simon Glass09140112020-05-10 11:40:03 -0600563int hash_command(const char *algo_name, int flags, struct cmd_tbl *cmdtp,
564 int flag, int argc, char *const argv[])
Simon Glass460408e2012-12-05 14:46:36 +0000565{
Simon Glass460408e2012-12-05 14:46:36 +0000566 ulong addr, len;
Simon Glass460408e2012-12-05 14:46:36 +0000567
Nikolay Dimitrov3ef46a92014-12-12 20:01:23 +0200568 if ((argc < 2) || ((flags & HASH_FLAG_VERIFY) && (argc < 3)))
Simon Glass460408e2012-12-05 14:46:36 +0000569 return CMD_RET_USAGE;
570
Simon Glass7e5f4602021-07-24 09:03:29 -0600571 addr = hextoul(*argv++, NULL);
572 len = hextoul(*argv++, NULL);
Simon Glassd5b76672013-02-24 17:33:26 +0000573
Simon Glassd20a40d2013-02-24 20:30:22 +0000574 if (multi_hash()) {
575 struct hash_algo *algo;
Breno Limad7af2ba2018-01-17 10:03:45 -0200576 u8 *output;
Simon Glass04819a42014-06-12 07:24:41 -0600577 uint8_t vsum[HASH_MAX_DIGEST_SIZE];
Simon Glassbd091b62013-02-24 17:33:31 +0000578 void *buf;
Simon Glass460408e2012-12-05 14:46:36 +0000579
Hung-ying Tyanbf007eb2014-03-03 12:19:28 +0100580 if (hash_lookup_algo(algo_name, &algo)) {
Simon Glassd20a40d2013-02-24 20:30:22 +0000581 printf("Unknown hash algorithm '%s'\n", algo_name);
Simon Glass460408e2012-12-05 14:46:36 +0000582 return CMD_RET_USAGE;
Simon Glassd20a40d2013-02-24 20:30:22 +0000583 }
584 argc -= 2;
585
586 if (algo->digest_size > HASH_MAX_DIGEST_SIZE) {
587 puts("HASH_MAX_DIGEST_SIZE exceeded\n");
588 return 1;
589 }
590
Breno Limad7af2ba2018-01-17 10:03:45 -0200591 output = memalign(ARCH_DMA_MINALIGN,
592 sizeof(uint32_t) * HASH_MAX_DIGEST_SIZE);
593
Simon Glassbd091b62013-02-24 17:33:31 +0000594 buf = map_sysmem(addr, len);
595 algo->hash_func_ws(buf, len, output, algo->chunk_size);
596 unmap_sysmem(buf);
Simon Glassd20a40d2013-02-24 20:30:22 +0000597
598 /* Try to avoid code bloat when verify is not needed */
Daniel Thompson221a9492017-05-19 17:26:58 +0100599#if defined(CONFIG_CRC32_VERIFY) || defined(CONFIG_SHA1SUM_VERIFY) || \
600 defined(CONFIG_HASH_VERIFY)
Simon Glassd20a40d2013-02-24 20:30:22 +0000601 if (flags & HASH_FLAG_VERIFY) {
602#else
603 if (0) {
604#endif
Simon Glassd20a40d2013-02-24 20:30:22 +0000605 if (parse_verify_sum(algo, *argv, vsum,
Simon Glassd5b76672013-02-24 17:33:26 +0000606 flags & HASH_FLAG_ENV)) {
Simon Glassd20a40d2013-02-24 20:30:22 +0000607 printf("ERROR: %s does not contain a valid "
608 "%s sum\n", *argv, algo->name);
609 return 1;
610 }
611 if (memcmp(output, vsum, algo->digest_size) != 0) {
612 int i;
Simon Glass460408e2012-12-05 14:46:36 +0000613
Simon Glass31890ae2014-06-02 22:04:49 -0600614 hash_show(algo, addr, len, output);
Simon Glassd20a40d2013-02-24 20:30:22 +0000615 printf(" != ");
616 for (i = 0; i < algo->digest_size; i++)
617 printf("%02x", vsum[i]);
618 puts(" ** ERROR **\n");
619 return 1;
620 }
621 } else {
Simon Glass31890ae2014-06-02 22:04:49 -0600622 hash_show(algo, addr, len, output);
Simon Glassd20a40d2013-02-24 20:30:22 +0000623 printf("\n");
Simon Glass460408e2012-12-05 14:46:36 +0000624
Simon Glassd20a40d2013-02-24 20:30:22 +0000625 if (argc) {
626 store_result(algo, output, *argv,
627 flags & HASH_FLAG_ENV);
628 }
Breno Limad7af2ba2018-01-17 10:03:45 -0200629 unmap_sysmem(output);
630
Simon Glassd20a40d2013-02-24 20:30:22 +0000631 }
632
633 /* Horrible code size hack for boards that just want crc32 */
634 } else {
635 ulong crc;
636 ulong *ptr;
637
638 crc = crc32_wd(0, (const uchar *)addr, len, CHUNKSZ_CRC32);
639
640 printf("CRC32 for %08lx ... %08lx ==> %08lx\n",
641 addr, addr + len - 1, crc);
642
Tom Rini4b756b02013-11-07 07:39:48 -0500643 if (argc >= 3) {
Simon Glass7e5f4602021-07-24 09:03:29 -0600644 ptr = (ulong *)hextoul(argv[0], NULL);
Simon Glassd20a40d2013-02-24 20:30:22 +0000645 *ptr = crc;
Simon Glassd5b76672013-02-24 17:33:26 +0000646 }
Simon Glass460408e2012-12-05 14:46:36 +0000647 }
648
649 return 0;
650}
Simon Glassd70f9192017-05-17 09:05:34 -0600651#endif /* CONFIG_CMD_HASH || CONFIG_CMD_SHA1SUM || CONFIG_CMD_CRC32) */
652#endif /* !USE_HOSTCC */