2018-05-06 21:58:06 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0+
|
2012-12-05 14:46:36 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2012 The Chromium OS Authors.
|
|
|
|
*
|
|
|
|
* (C) Copyright 2011
|
|
|
|
* Joe Hershberger, National Instruments, joe.hershberger@ni.com
|
|
|
|
*
|
|
|
|
* (C) Copyright 2000
|
|
|
|
* Wolfgang Denk, DENX Software Engineering, wd@denx.de.
|
|
|
|
*/
|
|
|
|
|
2015-01-23 10:31:58 +00:00
|
|
|
#ifndef USE_HOSTCC
|
2012-12-05 14:46:36 +00:00
|
|
|
#include <common.h>
|
|
|
|
#include <command.h>
|
2019-08-01 15:46:51 +00:00
|
|
|
#include <env.h>
|
2020-05-10 17:40:05 +00:00
|
|
|
#include <log.h>
|
2014-03-03 11:19:28 +00:00
|
|
|
#include <malloc.h>
|
2015-03-22 22:08:59 +00:00
|
|
|
#include <mapmem.h>
|
2013-03-20 21:00:58 +00:00
|
|
|
#include <hw_sha.h>
|
2020-05-10 17:39:56 +00:00
|
|
|
#include <asm/cache.h>
|
2015-01-23 10:31:58 +00:00
|
|
|
#include <asm/io.h>
|
2016-09-21 02:28:55 +00:00
|
|
|
#include <linux/errno.h>
|
2019-11-14 19:57:16 +00:00
|
|
|
#include <u-boot/crc.h>
|
2015-01-23 10:31:58 +00:00
|
|
|
#else
|
|
|
|
#include "mkimage.h"
|
|
|
|
#include <time.h>
|
|
|
|
#endif /* !USE_HOSTCC*/
|
|
|
|
|
2012-12-05 14:46:36 +00:00
|
|
|
#include <hash.h>
|
2020-05-10 17:40:01 +00:00
|
|
|
#include <image.h>
|
2015-01-23 10:31:58 +00:00
|
|
|
#include <u-boot/crc.h>
|
2014-06-12 20:27:12 +00:00
|
|
|
#include <u-boot/sha1.h>
|
|
|
|
#include <u-boot/sha256.h>
|
2015-01-23 10:31:58 +00:00
|
|
|
#include <u-boot/md5.h>
|
2012-12-05 14:46:36 +00:00
|
|
|
|
2019-03-16 09:53:01 +00:00
|
|
|
#if !defined(USE_HOSTCC) && defined(CONFIG_NEEDS_MANUAL_RELOC)
|
|
|
|
DECLARE_GLOBAL_DATA_PTR;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static void reloc_update(void);
|
|
|
|
|
2017-08-14 20:38:07 +00:00
|
|
|
#if defined(CONFIG_SHA1) && !defined(CONFIG_SHA_PROG_HW_ACCEL)
|
2014-03-03 11:19:28 +00:00
|
|
|
static int hash_init_sha1(struct hash_algo *algo, void **ctxp)
|
|
|
|
{
|
|
|
|
sha1_context *ctx = malloc(sizeof(sha1_context));
|
|
|
|
sha1_starts(ctx);
|
|
|
|
*ctxp = ctx;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hash_update_sha1(struct hash_algo *algo, void *ctx, const void *buf,
|
|
|
|
unsigned int size, int is_last)
|
|
|
|
{
|
|
|
|
sha1_update((sha1_context *)ctx, buf, size);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hash_finish_sha1(struct hash_algo *algo, void *ctx, void *dest_buf,
|
|
|
|
int size)
|
|
|
|
{
|
|
|
|
if (size < algo->digest_size)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
sha1_finish((sha1_context *)ctx, dest_buf);
|
|
|
|
free(ctx);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2017-08-14 20:38:07 +00:00
|
|
|
#if defined(CONFIG_SHA256) && !defined(CONFIG_SHA_PROG_HW_ACCEL)
|
2014-03-03 11:19:28 +00:00
|
|
|
static int hash_init_sha256(struct hash_algo *algo, void **ctxp)
|
|
|
|
{
|
|
|
|
sha256_context *ctx = malloc(sizeof(sha256_context));
|
|
|
|
sha256_starts(ctx);
|
|
|
|
*ctxp = ctx;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hash_update_sha256(struct hash_algo *algo, void *ctx,
|
|
|
|
const void *buf, unsigned int size, int is_last)
|
|
|
|
{
|
|
|
|
sha256_update((sha256_context *)ctx, buf, size);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hash_finish_sha256(struct hash_algo *algo, void *ctx, void
|
|
|
|
*dest_buf, int size)
|
|
|
|
{
|
|
|
|
if (size < algo->digest_size)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
sha256_finish((sha256_context *)ctx, dest_buf);
|
|
|
|
free(ctx);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2018-11-25 18:22:19 +00:00
|
|
|
static int hash_init_crc16_ccitt(struct hash_algo *algo, void **ctxp)
|
|
|
|
{
|
|
|
|
uint16_t *ctx = malloc(sizeof(uint16_t));
|
|
|
|
*ctx = 0;
|
|
|
|
*ctxp = ctx;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hash_update_crc16_ccitt(struct hash_algo *algo, void *ctx,
|
|
|
|
const void *buf, unsigned int size,
|
|
|
|
int is_last)
|
|
|
|
{
|
|
|
|
*((uint16_t *)ctx) = crc16_ccitt(*((uint16_t *)ctx), buf, size);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hash_finish_crc16_ccitt(struct hash_algo *algo, void *ctx,
|
|
|
|
void *dest_buf, int size)
|
|
|
|
{
|
|
|
|
if (size < algo->digest_size)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
*((uint16_t *)dest_buf) = *((uint16_t *)ctx);
|
|
|
|
free(ctx);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-03-03 11:19:28 +00:00
|
|
|
static int hash_init_crc32(struct hash_algo *algo, void **ctxp)
|
|
|
|
{
|
|
|
|
uint32_t *ctx = malloc(sizeof(uint32_t));
|
|
|
|
*ctx = 0;
|
|
|
|
*ctxp = ctx;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hash_update_crc32(struct hash_algo *algo, void *ctx,
|
|
|
|
const void *buf, unsigned int size, int is_last)
|
|
|
|
{
|
|
|
|
*((uint32_t *)ctx) = crc32(*((uint32_t *)ctx), buf, size);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hash_finish_crc32(struct hash_algo *algo, void *ctx, void *dest_buf,
|
|
|
|
int size)
|
|
|
|
{
|
|
|
|
if (size < algo->digest_size)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
*((uint32_t *)dest_buf) = *((uint32_t *)ctx);
|
|
|
|
free(ctx);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-12-05 14:46:36 +00:00
|
|
|
/*
|
2017-08-14 20:38:07 +00:00
|
|
|
* These are the hash algorithms we support. If we have hardware acceleration
|
|
|
|
* is enable we will use that, otherwise a software version of the algorithm.
|
|
|
|
* Note that algorithm names must be in lower case.
|
2012-12-05 14:46:36 +00:00
|
|
|
*/
|
|
|
|
static struct hash_algo hash_algo[] = {
|
2017-08-14 20:38:07 +00:00
|
|
|
#ifdef CONFIG_SHA1
|
2013-03-20 21:00:58 +00:00
|
|
|
{
|
2017-08-14 20:38:07 +00:00
|
|
|
.name = "sha1",
|
|
|
|
.digest_size = SHA1_SUM_LEN,
|
|
|
|
.chunk_size = CHUNKSZ_SHA1,
|
|
|
|
#ifdef CONFIG_SHA_HW_ACCEL
|
|
|
|
.hash_func_ws = hw_sha1,
|
|
|
|
#else
|
|
|
|
.hash_func_ws = sha1_csum_wd,
|
2015-02-20 07:21:46 +00:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_SHA_PROG_HW_ACCEL
|
2017-08-14 20:38:07 +00:00
|
|
|
.hash_init = hw_sha_init,
|
|
|
|
.hash_update = hw_sha_update,
|
|
|
|
.hash_finish = hw_sha_finish,
|
|
|
|
#else
|
|
|
|
.hash_init = hash_init_sha1,
|
|
|
|
.hash_update = hash_update_sha1,
|
|
|
|
.hash_finish = hash_finish_sha1,
|
2013-03-20 21:00:58 +00:00
|
|
|
#endif
|
2012-12-05 14:46:36 +00:00
|
|
|
},
|
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_SHA256
|
|
|
|
{
|
2017-08-14 20:38:07 +00:00
|
|
|
.name = "sha256",
|
|
|
|
.digest_size = SHA256_SUM_LEN,
|
|
|
|
.chunk_size = CHUNKSZ_SHA256,
|
|
|
|
#ifdef CONFIG_SHA_HW_ACCEL
|
|
|
|
.hash_func_ws = hw_sha256,
|
|
|
|
#else
|
|
|
|
.hash_func_ws = sha256_csum_wd,
|
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_SHA_PROG_HW_ACCEL
|
|
|
|
.hash_init = hw_sha_init,
|
|
|
|
.hash_update = hw_sha_update,
|
|
|
|
.hash_finish = hw_sha_finish,
|
|
|
|
#else
|
|
|
|
.hash_init = hash_init_sha256,
|
|
|
|
.hash_update = hash_update_sha256,
|
|
|
|
.hash_finish = hash_finish_sha256,
|
|
|
|
#endif
|
2012-12-05 14:46:36 +00:00
|
|
|
},
|
|
|
|
#endif
|
2018-11-25 18:22:19 +00:00
|
|
|
{
|
|
|
|
.name = "crc16-ccitt",
|
|
|
|
.digest_size = 2,
|
|
|
|
.chunk_size = CHUNKSZ,
|
|
|
|
.hash_func_ws = crc16_ccitt_wd_buf,
|
|
|
|
.hash_init = hash_init_crc16_ccitt,
|
|
|
|
.hash_update = hash_update_crc16_ccitt,
|
|
|
|
.hash_finish = hash_finish_crc16_ccitt,
|
|
|
|
},
|
2013-02-24 20:30:22 +00:00
|
|
|
{
|
2017-08-14 20:38:07 +00:00
|
|
|
.name = "crc32",
|
|
|
|
.digest_size = 4,
|
|
|
|
.chunk_size = CHUNKSZ_CRC32,
|
|
|
|
.hash_func_ws = crc32_wd_buf,
|
|
|
|
.hash_init = hash_init_crc32,
|
|
|
|
.hash_update = hash_update_crc32,
|
|
|
|
.hash_finish = hash_finish_crc32,
|
2013-02-24 20:30:22 +00:00
|
|
|
},
|
2012-12-05 14:46:36 +00:00
|
|
|
};
|
|
|
|
|
2013-02-24 20:30:22 +00:00
|
|
|
/* Try to minimize code size for boards that don't want much hashing */
|
2017-05-19 16:26:58 +00:00
|
|
|
#if defined(CONFIG_SHA256) || defined(CONFIG_CMD_SHA1SUM) || \
|
|
|
|
defined(CONFIG_CRC32_VERIFY) || defined(CONFIG_CMD_HASH)
|
2013-02-24 20:30:22 +00:00
|
|
|
#define multi_hash() 1
|
|
|
|
#else
|
|
|
|
#define multi_hash() 0
|
|
|
|
#endif
|
|
|
|
|
2019-03-16 09:53:01 +00:00
|
|
|
static void reloc_update(void)
|
|
|
|
{
|
|
|
|
#if !defined(USE_HOSTCC) && defined(CONFIG_NEEDS_MANUAL_RELOC)
|
|
|
|
int i;
|
|
|
|
static bool done;
|
|
|
|
|
|
|
|
if (!done) {
|
|
|
|
done = true;
|
|
|
|
for (i = 0; i < ARRAY_SIZE(hash_algo); i++) {
|
|
|
|
hash_algo[i].name += gd->reloc_off;
|
|
|
|
hash_algo[i].hash_func_ws += gd->reloc_off;
|
|
|
|
hash_algo[i].hash_init += gd->reloc_off;
|
|
|
|
hash_algo[i].hash_update += gd->reloc_off;
|
|
|
|
hash_algo[i].hash_finish += gd->reloc_off;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2015-01-23 10:31:58 +00:00
|
|
|
int hash_lookup_algo(const char *algo_name, struct hash_algo **algop)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2019-03-16 09:53:01 +00:00
|
|
|
reloc_update();
|
|
|
|
|
2015-01-23 10:31:58 +00:00
|
|
|
for (i = 0; i < ARRAY_SIZE(hash_algo); i++) {
|
|
|
|
if (!strcmp(algo_name, hash_algo[i].name)) {
|
|
|
|
*algop = &hash_algo[i];
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
debug("Unknown hash algorithm '%s'\n", algo_name);
|
|
|
|
return -EPROTONOSUPPORT;
|
|
|
|
}
|
|
|
|
|
|
|
|
int hash_progressive_lookup_algo(const char *algo_name,
|
|
|
|
struct hash_algo **algop)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2019-03-16 09:53:01 +00:00
|
|
|
reloc_update();
|
|
|
|
|
2015-01-23 10:31:58 +00:00
|
|
|
for (i = 0; i < ARRAY_SIZE(hash_algo); i++) {
|
|
|
|
if (!strcmp(algo_name, hash_algo[i].name)) {
|
|
|
|
if (hash_algo[i].hash_init) {
|
|
|
|
*algop = &hash_algo[i];
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
debug("Unknown hash algorithm '%s'\n", algo_name);
|
|
|
|
return -EPROTONOSUPPORT;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef USE_HOSTCC
|
2015-05-18 12:08:24 +00:00
|
|
|
int hash_parse_string(const char *algo_name, const char *str, uint8_t *result)
|
|
|
|
{
|
|
|
|
struct hash_algo *algo;
|
|
|
|
int ret;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
ret = hash_lookup_algo(algo_name, &algo);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
for (i = 0; i < algo->digest_size; i++) {
|
|
|
|
char chr[3];
|
|
|
|
|
|
|
|
strncpy(chr, &str[i * 2], 2);
|
|
|
|
result[i] = simple_strtoul(chr, NULL, 16);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-01-05 13:47:48 +00:00
|
|
|
int hash_block(const char *algo_name, const void *data, unsigned int len,
|
|
|
|
uint8_t *output, int *output_size)
|
|
|
|
{
|
|
|
|
struct hash_algo *algo;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = hash_lookup_algo(algo_name, &algo);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
if (output_size && *output_size < algo->digest_size) {
|
|
|
|
debug("Output buffer size %d too small (need %d bytes)",
|
|
|
|
*output_size, algo->digest_size);
|
|
|
|
return -ENOSPC;
|
|
|
|
}
|
|
|
|
if (output_size)
|
|
|
|
*output_size = algo->digest_size;
|
|
|
|
algo->hash_func_ws(data, len, output, algo->chunk_size);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if defined(CONFIG_CMD_HASH) || defined(CONFIG_CMD_SHA1SUM) || defined(CONFIG_CMD_CRC32)
|
2012-12-05 14:46:36 +00:00
|
|
|
/**
|
|
|
|
* store_result: Store the resulting sum to an address or variable
|
|
|
|
*
|
|
|
|
* @algo: Hash algorithm being used
|
|
|
|
* @sum: Hash digest (algo->digest_size bytes)
|
|
|
|
* @dest: Destination, interpreted as a hex address if it starts
|
2013-02-24 17:33:26 +00:00
|
|
|
* with * (or allow_env_vars is 0) or otherwise as an
|
|
|
|
* environment variable.
|
|
|
|
* @allow_env_vars: non-zero to permit storing the result to an
|
|
|
|
* variable environment
|
2012-12-05 14:46:36 +00:00
|
|
|
*/
|
2014-06-12 13:24:41 +00:00
|
|
|
static void store_result(struct hash_algo *algo, const uint8_t *sum,
|
2013-02-24 17:33:26 +00:00
|
|
|
const char *dest, int allow_env_vars)
|
2012-12-05 14:46:36 +00:00
|
|
|
{
|
|
|
|
unsigned int i;
|
2013-02-24 17:33:26 +00:00
|
|
|
int env_var = 0;
|
2012-12-05 14:46:36 +00:00
|
|
|
|
2013-02-24 17:33:26 +00:00
|
|
|
/*
|
|
|
|
* If environment variables are allowed, then we assume that 'dest'
|
|
|
|
* is an environment variable, unless it starts with *, in which
|
|
|
|
* case we assume it is an address. If not allowed, it is always an
|
|
|
|
* address. This is to support the crc32 command.
|
|
|
|
*/
|
|
|
|
if (allow_env_vars) {
|
|
|
|
if (*dest == '*')
|
|
|
|
dest++;
|
|
|
|
else
|
|
|
|
env_var = 1;
|
|
|
|
}
|
2012-12-05 14:46:36 +00:00
|
|
|
|
2013-02-24 17:33:26 +00:00
|
|
|
if (env_var) {
|
2012-12-05 14:46:36 +00:00
|
|
|
char str_output[HASH_MAX_DIGEST_SIZE * 2 + 1];
|
|
|
|
char *str_ptr = str_output;
|
|
|
|
|
|
|
|
for (i = 0; i < algo->digest_size; i++) {
|
|
|
|
sprintf(str_ptr, "%02x", sum[i]);
|
|
|
|
str_ptr += 2;
|
|
|
|
}
|
2014-06-09 09:02:02 +00:00
|
|
|
*str_ptr = '\0';
|
2017-08-03 18:22:09 +00:00
|
|
|
env_set(dest, str_output);
|
2013-02-24 17:33:26 +00:00
|
|
|
} else {
|
2013-02-24 17:33:31 +00:00
|
|
|
ulong addr;
|
|
|
|
void *buf;
|
2013-02-24 17:33:26 +00:00
|
|
|
|
2013-02-24 17:33:31 +00:00
|
|
|
addr = simple_strtoul(dest, NULL, 16);
|
|
|
|
buf = map_sysmem(addr, algo->digest_size);
|
|
|
|
memcpy(buf, sum, algo->digest_size);
|
|
|
|
unmap_sysmem(buf);
|
2012-12-05 14:46:36 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* parse_verify_sum: Parse a hash verification parameter
|
|
|
|
*
|
|
|
|
* @algo: Hash algorithm being used
|
|
|
|
* @verify_str: Argument to parse. If it starts with * then it is
|
|
|
|
* interpreted as a hex address containing the hash.
|
|
|
|
* If the length is exactly the right number of hex digits
|
|
|
|
* for the digest size, then we assume it is a hex digest.
|
|
|
|
* Otherwise we assume it is an environment variable, and
|
|
|
|
* look up its value (it must contain a hex digest).
|
|
|
|
* @vsum: Returns binary digest value (algo->digest_size bytes)
|
2013-02-24 17:33:26 +00:00
|
|
|
* @allow_env_vars: non-zero to permit storing the result to an environment
|
|
|
|
* variable. If 0 then verify_str is assumed to be an
|
|
|
|
* address, and the * prefix is not expected.
|
2012-12-05 14:46:36 +00:00
|
|
|
* @return 0 if ok, non-zero on error
|
|
|
|
*/
|
2014-06-12 13:24:41 +00:00
|
|
|
static int parse_verify_sum(struct hash_algo *algo, char *verify_str,
|
|
|
|
uint8_t *vsum, int allow_env_vars)
|
2012-12-05 14:46:36 +00:00
|
|
|
{
|
2013-02-24 17:33:26 +00:00
|
|
|
int env_var = 0;
|
|
|
|
|
|
|
|
/* See comment above in store_result() */
|
|
|
|
if (allow_env_vars) {
|
|
|
|
if (*verify_str == '*')
|
|
|
|
verify_str++;
|
|
|
|
else
|
|
|
|
env_var = 1;
|
|
|
|
}
|
|
|
|
|
2014-12-12 18:01:23 +00:00
|
|
|
if (!env_var) {
|
2013-02-24 17:33:31 +00:00
|
|
|
ulong addr;
|
|
|
|
void *buf;
|
2012-12-05 14:46:36 +00:00
|
|
|
|
2013-02-24 17:33:31 +00:00
|
|
|
addr = simple_strtoul(verify_str, NULL, 16);
|
|
|
|
buf = map_sysmem(addr, algo->digest_size);
|
|
|
|
memcpy(vsum, buf, algo->digest_size);
|
2012-12-05 14:46:36 +00:00
|
|
|
} else {
|
|
|
|
char *vsum_str;
|
|
|
|
int digits = algo->digest_size * 2;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* As with the original code from sha1sum.c, we assume that a
|
|
|
|
* string which matches the digest size exactly is a hex
|
|
|
|
* string and not an environment variable.
|
|
|
|
*/
|
|
|
|
if (strlen(verify_str) == digits)
|
|
|
|
vsum_str = verify_str;
|
|
|
|
else {
|
2017-08-03 18:22:12 +00:00
|
|
|
vsum_str = env_get(verify_str);
|
2012-12-05 14:46:36 +00:00
|
|
|
if (vsum_str == NULL || strlen(vsum_str) != digits) {
|
|
|
|
printf("Expected %d hex digits in env var\n",
|
|
|
|
digits);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-05-18 12:08:24 +00:00
|
|
|
hash_parse_string(algo->name, vsum_str, vsum);
|
2012-12-05 14:46:36 +00:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-01-05 13:47:48 +00:00
|
|
|
static void hash_show(struct hash_algo *algo, ulong addr, ulong len, uint8_t *output)
|
2012-12-05 14:46:36 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
printf("%s for %08lx ... %08lx ==> ", algo->name, addr, addr + len - 1);
|
|
|
|
for (i = 0; i < algo->digest_size; i++)
|
|
|
|
printf("%02x", output[i]);
|
|
|
|
}
|
|
|
|
|
2020-05-10 17:40:03 +00:00
|
|
|
int hash_command(const char *algo_name, int flags, struct cmd_tbl *cmdtp,
|
|
|
|
int flag, int argc, char *const argv[])
|
2012-12-05 14:46:36 +00:00
|
|
|
{
|
|
|
|
ulong addr, len;
|
|
|
|
|
2014-12-12 18:01:23 +00:00
|
|
|
if ((argc < 2) || ((flags & HASH_FLAG_VERIFY) && (argc < 3)))
|
2012-12-05 14:46:36 +00:00
|
|
|
return CMD_RET_USAGE;
|
|
|
|
|
2013-02-24 17:33:26 +00:00
|
|
|
addr = simple_strtoul(*argv++, NULL, 16);
|
|
|
|
len = simple_strtoul(*argv++, NULL, 16);
|
|
|
|
|
2013-02-24 20:30:22 +00:00
|
|
|
if (multi_hash()) {
|
|
|
|
struct hash_algo *algo;
|
2018-01-17 12:03:45 +00:00
|
|
|
u8 *output;
|
2014-06-12 13:24:41 +00:00
|
|
|
uint8_t vsum[HASH_MAX_DIGEST_SIZE];
|
2013-02-24 17:33:31 +00:00
|
|
|
void *buf;
|
2012-12-05 14:46:36 +00:00
|
|
|
|
2014-03-03 11:19:28 +00:00
|
|
|
if (hash_lookup_algo(algo_name, &algo)) {
|
2013-02-24 20:30:22 +00:00
|
|
|
printf("Unknown hash algorithm '%s'\n", algo_name);
|
|
|
|
return CMD_RET_USAGE;
|
|
|
|
}
|
|
|
|
argc -= 2;
|
|
|
|
|
|
|
|
if (algo->digest_size > HASH_MAX_DIGEST_SIZE) {
|
|
|
|
puts("HASH_MAX_DIGEST_SIZE exceeded\n");
|
|
|
|
return 1;
|
|
|
|
}
|
2012-12-05 14:46:36 +00:00
|
|
|
|
2018-01-17 12:03:45 +00:00
|
|
|
output = memalign(ARCH_DMA_MINALIGN,
|
|
|
|
sizeof(uint32_t) * HASH_MAX_DIGEST_SIZE);
|
|
|
|
|
2013-02-24 17:33:31 +00:00
|
|
|
buf = map_sysmem(addr, len);
|
|
|
|
algo->hash_func_ws(buf, len, output, algo->chunk_size);
|
|
|
|
unmap_sysmem(buf);
|
2012-12-05 14:46:36 +00:00
|
|
|
|
2013-02-24 20:30:22 +00:00
|
|
|
/* Try to avoid code bloat when verify is not needed */
|
2017-05-19 16:26:58 +00:00
|
|
|
#if defined(CONFIG_CRC32_VERIFY) || defined(CONFIG_SHA1SUM_VERIFY) || \
|
|
|
|
defined(CONFIG_HASH_VERIFY)
|
2013-02-24 20:30:22 +00:00
|
|
|
if (flags & HASH_FLAG_VERIFY) {
|
2012-12-05 14:46:36 +00:00
|
|
|
#else
|
2013-02-24 20:30:22 +00:00
|
|
|
if (0) {
|
2012-12-05 14:46:36 +00:00
|
|
|
#endif
|
2013-02-24 20:30:22 +00:00
|
|
|
if (parse_verify_sum(algo, *argv, vsum,
|
2013-02-24 17:33:26 +00:00
|
|
|
flags & HASH_FLAG_ENV)) {
|
2013-02-24 20:30:22 +00:00
|
|
|
printf("ERROR: %s does not contain a valid "
|
|
|
|
"%s sum\n", *argv, algo->name);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
if (memcmp(output, vsum, algo->digest_size) != 0) {
|
|
|
|
int i;
|
2012-12-05 14:46:36 +00:00
|
|
|
|
2014-06-03 04:04:49 +00:00
|
|
|
hash_show(algo, addr, len, output);
|
2013-02-24 20:30:22 +00:00
|
|
|
printf(" != ");
|
|
|
|
for (i = 0; i < algo->digest_size; i++)
|
|
|
|
printf("%02x", vsum[i]);
|
|
|
|
puts(" ** ERROR **\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
} else {
|
2014-06-03 04:04:49 +00:00
|
|
|
hash_show(algo, addr, len, output);
|
2013-02-24 20:30:22 +00:00
|
|
|
printf("\n");
|
|
|
|
|
|
|
|
if (argc) {
|
|
|
|
store_result(algo, output, *argv,
|
|
|
|
flags & HASH_FLAG_ENV);
|
|
|
|
}
|
2018-01-17 12:03:45 +00:00
|
|
|
unmap_sysmem(output);
|
|
|
|
|
2012-12-05 14:46:36 +00:00
|
|
|
}
|
2013-02-24 20:30:22 +00:00
|
|
|
|
|
|
|
/* Horrible code size hack for boards that just want crc32 */
|
2012-12-05 14:46:36 +00:00
|
|
|
} else {
|
2013-02-24 20:30:22 +00:00
|
|
|
ulong crc;
|
|
|
|
ulong *ptr;
|
|
|
|
|
|
|
|
crc = crc32_wd(0, (const uchar *)addr, len, CHUNKSZ_CRC32);
|
|
|
|
|
|
|
|
printf("CRC32 for %08lx ... %08lx ==> %08lx\n",
|
|
|
|
addr, addr + len - 1, crc);
|
2012-12-05 14:46:36 +00:00
|
|
|
|
2013-11-07 12:39:48 +00:00
|
|
|
if (argc >= 3) {
|
|
|
|
ptr = (ulong *)simple_strtoul(argv[0], NULL, 16);
|
2013-02-24 20:30:22 +00:00
|
|
|
*ptr = crc;
|
2013-02-24 17:33:26 +00:00
|
|
|
}
|
2012-12-05 14:46:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2017-05-17 15:05:34 +00:00
|
|
|
#endif /* CONFIG_CMD_HASH || CONFIG_CMD_SHA1SUM || CONFIG_CMD_CRC32) */
|
|
|
|
#endif /* !USE_HOSTCC */
|