}
inline uns
-str_len_aligned(const byte *str)
+str_len_aligned(const char *str)
{
const uns *u = (const uns *) str;
uns len = 0;
}
inline uns
-hash_string_aligned(const byte *str)
+hash_string_aligned(const char *str)
{
const uns *u = (const uns *) str;
uns hash = 0;
#ifndef CPU_ALLOW_UNALIGNED
uns
-str_len(const byte *str)
+str_len(const char *str)
{
uns shift = UNALIGNED_PART(str, uns);
if (!shift)
}
uns
-hash_string(const byte *str)
+hash_string(const char *str)
{
- uns shift = UNALIGNED_PART(str, uns);
+ const byte *s = str;
+ uns shift = UNALIGNED_PART(s, uns);
if (!shift)
- return hash_string_aligned(str);
+ return hash_string_aligned(s);
else
{
uns hash = 0;
#endif
if (!modulo)
hash = ROL(hash, SHIFT_BITS);
- if (!str[i])
+ if (!s[i])
break;
- hash ^= str[i] << (shift * 8);
+ hash ^= s[i] << (shift * 8);
}
return hash;
}
#endif
uns
-hash_string_nocase(const byte *str)
+hash_string_nocase(const char *str)
{
+ const byte *s = str;
uns hash = 0;
uns i;
for (i=0; ; i++)
#endif
if (!modulo)
hash = ROL(hash, SHIFT_BITS);
- if (!str[i])
+ if (!s[i])
break;
- hash ^= Cupcase(str[i]) << (shift * 8);
+ hash ^= Cupcase(s[i]) << (shift * 8);
}
return hash;
}
#include "lib/lib.h"
/* The following functions need str to be aligned to uns. */
-uns str_len_aligned(const byte *str) PURE;
-uns hash_string_aligned(const byte *str) PURE;
+uns str_len_aligned(const char *str) PURE;
+uns hash_string_aligned(const char *str) PURE;
uns hash_block_aligned(const byte *str, uns len) PURE;
#ifdef CPU_ALLOW_UNALIGNED
#define hash_string(str) hash_string_aligned(str)
#define hash_block(str, len) hash_block_aligned(str, len)
#else
-uns str_len(const byte *str) PURE;
-uns hash_string(const byte *str) PURE;
+uns str_len(const char *str) PURE;
+uns hash_string(const char *str) PURE;
uns hash_block(const byte *str, uns len) PURE;
#endif
-uns hash_string_nocase(const byte *str) PURE;
+uns hash_string_nocase(const char *str) PURE;
/*
* We hash integers by multiplying by a reasonably large prime with