Mercurial > dropbear

comparison libtomcrypt/src/misc/crypt/crypt_find_hash_any.c @ 293:9d110777f345 contrib-blacklist

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
propagate from branch 'au.asn.ucc.matt.dropbear' (head 7ad1775ed65e75dbece27fe6b65bf1a234db386a) to branch 'au.asn.ucc.matt.dropbear.contrib.blacklist' (head 1d86a4f0a401cc68c2670d821a2f6366c37af143)
author Matt Johnston <matt@ucc.asn.au>
date Fri, 10 Mar 2006 06:31:29 +0000
parents 1b9e69c058d2
children 0cbe8f6dbf9e
comparison
equal deleted inserted replaced
247:c07de41b53d7 293:9d110777f345
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 LTC_MUTEX_LOCK(&ltc_hash_mutex);
32 y = MAXBLOCKSIZE+1;
33 z = -1;
34 for (x = 0; x < TAB_SIZE; x++) {
35 if (hash_descriptor[x].name == NULL) {
36 continue;
37 }
38 if ((int)hash_descriptor[x].hashsize >= digestlen && (int)hash_descriptor[x].hashsize < y) {
39 z = x;
40 y = hash_descriptor[x].hashsize;
41 }
42 }
43 LTC_MUTEX_UNLOCK(&ltc_hash_mutex);
44 return z;
45 }
46
47 /* $Source: /cvs/libtom/libtomcrypt/src/misc/crypt/crypt_find_hash_any.c,v $ */
48 /* $Revision: 1.4 $ */
49 /* $Date: 2005/06/19 18:00:28 $ */