X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=include%2Fhash.h;h=8b3f79ec473780104c7a188b85132c30f82b9b1e;hb=46b5c8ed017958fc387ab86c71ae6c90abb6793c;hp=4f9a8cf1db7dcd21afece64a0c5642d59c33e453;hpb=221a949eb6cf9077abc1e7ee28331987042b9b08;p=platform%2Fkernel%2Fu-boot.git diff --git a/include/hash.h b/include/hash.h index 4f9a8cf..8b3f79e 100644 --- a/include/hash.h +++ b/include/hash.h @@ -1,16 +1,26 @@ +/* SPDX-License-Identifier: GPL-2.0+ */ /* * Copyright (c) 2012 The Chromium OS Authors. - * SPDX-License-Identifier: GPL-2.0+ */ #ifndef _HASH_H #define _HASH_H +#ifdef USE_HOSTCC +#include +#endif + +struct cmd_tbl; + /* * Maximum digest size for all algorithms we support. Having this value * avoids a malloc() or C99 local declaration in common/cmd_hash.c. */ +#if CONFIG_IS_ENABLED(SHA384) || CONFIG_IS_ENABLED(SHA512) +#define HASH_MAX_DIGEST_SIZE 64 +#else #define HASH_MAX_DIGEST_SIZE 32 +#endif enum { HASH_FLAG_VERIFY = 1 << 0, /* Enable verify mode */ @@ -85,8 +95,8 @@ struct hash_algo { * @argc: Number of arguments (arg 0 must be the command text) * @argv: Arguments */ -int hash_command(const char *algo_name, int flags, cmd_tbl_t *cmdtp, int flag, - int argc, char * const argv[]); +int hash_command(const char *algo_name, int flags, struct cmd_tbl *cmdtp, + int flag, int argc, char *const argv[]); /** * hash_block() - Hash a block according to the requested algorithm @@ -104,7 +114,7 @@ int hash_command(const char *algo_name, int flags, cmd_tbl_t *cmdtp, int flag, * If NULL, then it is assumed that the caller has * allocated enough space for the hash. This is possible * since the caller is selecting the algorithm. - * @return 0 if ok, -ve on error: -EPROTONOSUPPORT for an unknown algorithm, + * Return: 0 if ok, -ve on error: -EPROTONOSUPPORT for an unknown algorithm, * -ENOSPC if the output buffer is not large enough. */ int hash_block(const char *algo_name, const void *data, unsigned int len, @@ -121,7 +131,7 @@ int hash_block(const char *algo_name, const void *data, unsigned int len, * @algo_name: Hash algorithm to look up * @algop: Pointer to the hash_algo struct if found * - * @return 0 if ok, -EPROTONOSUPPORT for an unknown algorithm. + * Return: 0 if ok, -EPROTONOSUPPORT for an unknown algorithm. */ int hash_lookup_algo(const char *algo_name, struct hash_algo **algop); @@ -134,7 +144,7 @@ int hash_lookup_algo(const char *algo_name, struct hash_algo **algop); * @algo_name: Hash algorithm to look up * @algop: Pointer to the hash_algo struct if found * - * @return 0 if ok, -EPROTONOSUPPORT for an unknown algorithm. + * Return: 0 if ok, -EPROTONOSUPPORT for an unknown algorithm. */ int hash_progressive_lookup_algo(const char *algo_name, struct hash_algo **algop); @@ -149,7 +159,7 @@ int hash_progressive_lookup_algo(const char *algo_name, * @str: Hash string to get parsed * @result: Binary array of the parsed hash string * - * @return 0 if ok, -EPROTONOSUPPORT for an unknown algorithm. + * Return: 0 if ok, -EPROTONOSUPPORT for an unknown algorithm. */ int hash_parse_string(const char *algo_name, const char *str, uint8_t *result);