int
GNUNET_CRYPTO_hash_from_string2 (const char *enc,
size_t enclen,
- struct GNUNET_HashCode *result)
+ struct GNUNET_HashCode *result)
{
char upper_enc[enclen];
- char* up_ptr = upper_enc;
+ char *up_ptr = upper_enc;
- GNUNET_STRINGS_utf8_toupper(enc, &up_ptr);
+ GNUNET_STRINGS_utf8_toupper (enc, up_ptr);
return GNUNET_STRINGS_string_to_data (upper_enc, enclen,
(unsigned char*) result,
/**
* @ingroup hash
- *
+ *
* Compute the distance between 2 hashcodes. The computation must be
* fast, not involve bits[0] or bits[4] (they're used elsewhere), and be
* somewhat consistent. And of course, the result should be a positive
* @return 1 if h1 > h2, -1 if h1 < h2 and 0 if h1 == h2.
*/
int
-GNUNET_CRYPTO_hash_cmp (const struct GNUNET_HashCode *h1,
+GNUNET_CRYPTO_hash_cmp (const struct GNUNET_HashCode *h1,
const struct GNUNET_HashCode *h2)
{
unsigned int *i1;
const void *salt, size_t salt_len,
va_list argp)
{
- GNUNET_CRYPTO_kdf_v (key->key, sizeof (key->key),
- salt, salt_len,
+ GNUNET_CRYPTO_kdf_v (key->key, sizeof (key->key),
+ salt, salt_len,
rkey, sizeof (struct GNUNET_CRYPTO_SymmetricSessionKey),
argp);
}