Mercurial > dropbear
comparison libtomcrypt/src/misc/crypt/crypt_find_hash.c @ 398:59c7938af2bd
merge of '1250b8af44b62d8f4fe0f8d9fc7e7a1cc34e7e1c'
and '7f8670ac3bb975f40967f3979d09d2199b7e90c8'
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Sat, 03 Feb 2007 08:20:30 +0000 |
parents | 0cbe8f6dbf9e |
children | f849a5ca2efc |
comparison
equal
deleted
inserted
replaced
396:e7c1a77d2921 | 398:59c7938af2bd |
---|---|
4 * algorithms in a highly modular and flexible manner. | 4 * algorithms in a highly modular and flexible manner. |
5 * | 5 * |
6 * The library is free for all purposes without any express | 6 * The library is free for all purposes without any express |
7 * guarantee it works. | 7 * guarantee it works. |
8 * | 8 * |
9 * Tom St Denis, [email protected], http://libtomcrypt.org | 9 * Tom St Denis, [email protected], http://libtomcrypt.com |
10 */ | 10 */ |
11 #include "tomcrypt.h" | 11 #include "tomcrypt.h" |
12 | 12 |
13 /** | 13 /** |
14 @file crypt_find_hash.c | 14 @file crypt_find_hash.c |
24 { | 24 { |
25 int x; | 25 int x; |
26 LTC_ARGCHK(name != NULL); | 26 LTC_ARGCHK(name != NULL); |
27 LTC_MUTEX_LOCK(<c_hash_mutex); | 27 LTC_MUTEX_LOCK(<c_hash_mutex); |
28 for (x = 0; x < TAB_SIZE; x++) { | 28 for (x = 0; x < TAB_SIZE; x++) { |
29 if (hash_descriptor[x].name != NULL && strcmp(hash_descriptor[x].name, name) == 0) { | 29 if (hash_descriptor[x].name != NULL && XSTRCMP(hash_descriptor[x].name, name) == 0) { |
30 LTC_MUTEX_UNLOCK(<c_hash_mutex); | 30 LTC_MUTEX_UNLOCK(<c_hash_mutex); |
31 return x; | 31 return x; |
32 } | 32 } |
33 } | 33 } |
34 LTC_MUTEX_UNLOCK(<c_hash_mutex); | 34 LTC_MUTEX_UNLOCK(<c_hash_mutex); |
35 return -1; | 35 return -1; |
36 } | 36 } |
37 | 37 |
38 /* $Source: /cvs/libtom/libtomcrypt/src/misc/crypt/crypt_find_hash.c,v $ */ | 38 /* $Source: /cvs/libtom/libtomcrypt/src/misc/crypt/crypt_find_hash.c,v $ */ |
39 /* $Revision: 1.4 $ */ | 39 /* $Revision: 1.6 $ */ |
40 /* $Date: 2005/06/19 18:00:28 $ */ | 40 /* $Date: 2006/11/29 23:43:57 $ */ |