f6ed7844e1
This should reduce the number of possible memory leaks reported by valgrind. The remaining reported leaks are sched tqe allocation, async DNS instance allocation, cmdmon response/timestamp cell allocation, and clientlog subnet allocation.
121 lines
2.8 KiB
C
121 lines
2.8 KiB
C
/*
|
|
chronyd/chronyc - Programs for keeping computer clocks accurate.
|
|
|
|
**********************************************************************
|
|
* Copyright (C) Miroslav Lichvar 2012
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of version 2 of the GNU General Public License as
|
|
* published by the Free Software Foundation.
|
|
*
|
|
* This program is distributed in the hope that it will be useful, but
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License along
|
|
* with this program; if not, write to the Free Software Foundation, Inc.,
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*
|
|
**********************************************************************
|
|
|
|
=======================================================================
|
|
|
|
Routines implementing crypto hashing using tomcrypt library.
|
|
|
|
*/
|
|
|
|
#include <tomcrypt.h>
|
|
|
|
#include "config.h"
|
|
#include "hash.h"
|
|
|
|
struct hash {
|
|
const char *name;
|
|
const char *int_name;
|
|
const struct ltc_hash_descriptor *desc;
|
|
};
|
|
|
|
static const struct hash hashes[] = {
|
|
{ "MD5", "md5", &md5_desc },
|
|
#ifdef LTC_RIPEMD128
|
|
{ "RMD128", "rmd128", &rmd128_desc },
|
|
#endif
|
|
#ifdef LTC_RIPEMD160
|
|
{ "RMD160", "rmd160", &rmd160_desc },
|
|
#endif
|
|
#ifdef LTC_RIPEMD256
|
|
{ "RMD256", "rmd256", &rmd256_desc },
|
|
#endif
|
|
#ifdef LTC_RIPEMD320
|
|
{ "RMD320", "rmd320", &rmd320_desc },
|
|
#endif
|
|
#ifdef LTC_SHA1
|
|
{ "SHA1", "sha1", &sha1_desc },
|
|
#endif
|
|
#ifdef LTC_SHA256
|
|
{ "SHA256", "sha256", &sha256_desc },
|
|
#endif
|
|
#ifdef LTC_SHA384
|
|
{ "SHA384", "sha384", &sha384_desc },
|
|
#endif
|
|
#ifdef LTC_SHA512
|
|
{ "SHA512", "sha512", &sha512_desc },
|
|
#endif
|
|
#ifdef LTC_TIGER
|
|
{ "TIGER", "tiger", &tiger_desc },
|
|
#endif
|
|
#ifdef LTC_WHIRLPOOL
|
|
{ "WHIRLPOOL", "whirlpool", &whirlpool_desc },
|
|
#endif
|
|
{ NULL, NULL, NULL }
|
|
};
|
|
|
|
int
|
|
HSH_GetHashId(const char *name)
|
|
{
|
|
int i, h;
|
|
|
|
for (i = 0; hashes[i].name; i++) {
|
|
if (!strcmp(name, hashes[i].name))
|
|
break;
|
|
}
|
|
|
|
if (!hashes[i].name)
|
|
return -1; /* not found */
|
|
|
|
h = find_hash(hashes[i].int_name);
|
|
if (h >= 0)
|
|
return h; /* already registered */
|
|
|
|
/* register and try again */
|
|
register_hash(hashes[i].desc);
|
|
|
|
return find_hash(hashes[i].int_name);
|
|
}
|
|
|
|
unsigned int
|
|
HSH_Hash(int id, const unsigned char *in1, unsigned int in1_len,
|
|
const unsigned char *in2, unsigned int in2_len,
|
|
unsigned char *out, unsigned int out_len)
|
|
{
|
|
unsigned long len;
|
|
int r;
|
|
|
|
len = out_len;
|
|
if (in2)
|
|
r = hash_memory_multi(id, out, &len,
|
|
in1, (unsigned long)in1_len, in2, (unsigned long)in2_len, NULL, 0);
|
|
else
|
|
r = hash_memory(id, in1, in1_len, out, &len);
|
|
|
|
if (r != CRYPT_OK)
|
|
return 0;
|
|
|
|
return len;
|
|
}
|
|
|
|
void
|
|
HSH_Finalise(void)
|
|
{
|
|
}
|