2 * Copyright (c) 2012 The Chromium OS Authors.
5 * Joe Hershberger, National Instruments, joe.hershberger@ni.com
8 * Wolfgang Denk, DENX Software Engineering, wd@denx.de.
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public License as
12 * published by the Free Software Foundation; either version 2 of
13 * the License, or (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
33 * These are the hash algorithms we support. Chips which support accelerated
34 * crypto could perhaps add named version of these algorithms here.
36 static struct hash_algo hash_algo[] = {
56 * store_result: Store the resulting sum to an address or variable
58 * @algo: Hash algorithm being used
59 * @sum: Hash digest (algo->digest_size bytes)
60 * @dest: Destination, interpreted as a hex address if it starts
61 * with * (or allow_env_vars is 0) or otherwise as an
62 * environment variable.
63 * @allow_env_vars: non-zero to permit storing the result to an
64 * variable environment
66 static void store_result(struct hash_algo *algo, const u8 *sum,
67 const char *dest, int allow_env_vars)
73 * If environment variables are allowed, then we assume that 'dest'
74 * is an environment variable, unless it starts with *, in which
75 * case we assume it is an address. If not allowed, it is always an
76 * address. This is to support the crc32 command.
86 char str_output[HASH_MAX_DIGEST_SIZE * 2 + 1];
87 char *str_ptr = str_output;
89 for (i = 0; i < algo->digest_size; i++) {
90 sprintf(str_ptr, "%02x", sum[i]);
94 setenv(dest, str_output);
98 ptr = (u8 *)simple_strtoul(dest, NULL, 16);
99 memcpy(ptr, sum, algo->digest_size);
104 * parse_verify_sum: Parse a hash verification parameter
106 * @algo: Hash algorithm being used
107 * @verify_str: Argument to parse. If it starts with * then it is
108 * interpreted as a hex address containing the hash.
109 * If the length is exactly the right number of hex digits
110 * for the digest size, then we assume it is a hex digest.
111 * Otherwise we assume it is an environment variable, and
112 * look up its value (it must contain a hex digest).
113 * @vsum: Returns binary digest value (algo->digest_size bytes)
114 * @allow_env_vars: non-zero to permit storing the result to an environment
115 * variable. If 0 then verify_str is assumed to be an
116 * address, and the * prefix is not expected.
117 * @return 0 if ok, non-zero on error
119 static int parse_verify_sum(struct hash_algo *algo, char *verify_str, u8 *vsum,
124 /* See comment above in store_result() */
125 if (allow_env_vars) {
126 if (*verify_str == '*')
135 ptr = (u8 *)simple_strtoul(verify_str, NULL, 16);
136 memcpy(vsum, ptr, algo->digest_size);
140 int digits = algo->digest_size * 2;
143 * As with the original code from sha1sum.c, we assume that a
144 * string which matches the digest size exactly is a hex
145 * string and not an environment variable.
147 if (strlen(verify_str) == digits)
148 vsum_str = verify_str;
150 vsum_str = getenv(verify_str);
151 if (vsum_str == NULL || strlen(vsum_str) != digits) {
152 printf("Expected %d hex digits in env var\n",
158 for (i = 0; i < algo->digest_size; i++) {
159 char *nullp = vsum_str + (i + 1) * 2;
163 vsum[i] = simple_strtoul(vsum_str + (i * 2), NULL, 16);
170 static struct hash_algo *find_hash_algo(const char *name)
174 for (i = 0; i < ARRAY_SIZE(hash_algo); i++) {
175 if (!strcasecmp(name, hash_algo[i].name))
176 return &hash_algo[i];
182 static void show_hash(struct hash_algo *algo, ulong addr, ulong len,
187 printf("%s for %08lx ... %08lx ==> ", algo->name, addr, addr + len - 1);
188 for (i = 0; i < algo->digest_size; i++)
189 printf("%02x", output[i]);
192 int hash_command(const char *algo_name, int flags, cmd_tbl_t *cmdtp, int flag,
193 int argc, char * const argv[])
195 struct hash_algo *algo;
197 u8 output[HASH_MAX_DIGEST_SIZE];
198 u8 vsum[HASH_MAX_DIGEST_SIZE];
201 return CMD_RET_USAGE;
203 addr = simple_strtoul(*argv++, NULL, 16);
204 len = simple_strtoul(*argv++, NULL, 16);
206 algo = find_hash_algo(algo_name);
208 printf("Unknown hash algorithm '%s'\n", algo_name);
209 return CMD_RET_USAGE;
213 if (algo->digest_size > HASH_MAX_DIGEST_SIZE) {
214 puts("HASH_MAX_DIGEST_SIZE exceeded\n");
218 algo->hash_func_ws((const unsigned char *)addr, len, output,
221 /* Try to avoid code bloat when verify is not needed */
222 #ifdef CONFIG_HASH_VERIFY
223 if (flags & HASH_FLAG_VERIFY) {
228 return CMD_RET_USAGE;
229 if (parse_verify_sum(algo, *argv, vsum,
230 flags & HASH_FLAG_ENV)) {
231 printf("ERROR: %s does not contain a valid %s sum\n",
235 if (memcmp(output, vsum, algo->digest_size) != 0) {
238 show_hash(algo, addr, len, output);
240 for (i = 0; i < algo->digest_size; i++)
241 printf("%02x", vsum[i]);
242 puts(" ** ERROR **\n");
246 show_hash(algo, addr, len, output);
250 store_result(algo, output, *argv,
251 flags & HASH_FLAG_ENV);