Mercurial > dropbear
comparison src/misc/crypt/crypt_find_hash_any.c @ 191:1c15b283127b libtomcrypt-orig
Import of libtomcrypt 1.02 with manual path rename rearrangement etc
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Fri, 06 May 2005 13:23:02 +0000 |
parents | |
children | 39d5d58461d6 |
comparison
equal
deleted
inserted
replaced
143:5d99163f7e32 | 191:1c15b283127b |
---|---|
1 /* LibTomCrypt, modular cryptographic library -- Tom St Denis | |
2 * | |
3 * LibTomCrypt is a library that provides various cryptographic | |
4 * algorithms in a highly modular and flexible manner. | |
5 * | |
6 * The library is free for all purposes without any express | |
7 * guarantee it works. | |
8 * | |
9 * Tom St Denis, [email protected], http://libtomcrypt.org | |
10 */ | |
11 #include "tomcrypt.h" | |
12 | |
13 /** | |
14 @file crypt_find_hash_any.c | |
15 Find a hash, Tom St Denis | |
16 */ | |
17 | |
18 /** | |
19 Find a hash flexibly. First by name then if not present by digest size | |
20 @param name The name of the hash desired | |
21 @param digestlen The minimum length of the digest size (octets) | |
22 @return >= 0 if found, -1 if not present | |
23 */int find_hash_any(const char *name, int digestlen) | |
24 { | |
25 int x, y, z; | |
26 LTC_ARGCHK(name != NULL); | |
27 | |
28 x = find_hash(name); | |
29 if (x != -1) return x; | |
30 | |
31 y = MAXBLOCKSIZE+1; | |
32 z = -1; | |
33 for (x = 0; x < TAB_SIZE; x++) { | |
34 if (hash_descriptor[x].name == NULL) { | |
35 continue; | |
36 } | |
37 if ((int)hash_descriptor[x].hashsize >= digestlen && (int)hash_descriptor[x].hashsize < y) { | |
38 z = x; | |
39 y = hash_descriptor[x].hashsize; | |
40 } | |
41 } | |
42 return z; | |
43 } |