hyung-hwan/qse
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

refined definition of stock hash functions

Browse Source
This commit is contained in:
hyung-hwan 2019-03-05 08:30:49 +00:00
parent bda9213f86
commit 0a405625ce
1 changed files with 27 additions and 48 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

75
qse/include/qse/hash.h
View File

@ -43,56 +43,35 @@
#if defined(QSE_HASH_FNV_MAGIC_INIT) #if defined(QSE_HASH_FNV_MAGIC_INIT)
/* FNV-1 hash */ /* FNV-1 hash */
# define QSE_HASH_INIT QSE_HASH_FNV_MAGIC_INIT
# define QSE_HASH_VALUE(hv,v) (((hv) ^ (v)) * QSE_HASH_FNV_MAGIC_PRIME) # define QSE_HASH_VALUE(hv,v) (((hv) ^ (v)) * QSE_HASH_FNV_MAGIC_PRIME)
# define QSE_HASH_VALUES(hv, ptr, len, type) do { \
hv = QSE_HASH_FNV_MAGIC_INIT; \
QSE_HASH_MORE_VALUES (hv, ptr, len, type); \
} while(0)
# define QSE_HASH_MORE_VALUES(hv, ptr, len, type) do { \
type* p = (type*)(ptr); \
type* q = (type*)p + (len); \
while (p < q) { hv = QSE_HASH_VALUE(hv, *p); p++; } \
} while(0)
# define QSE_HASH_VS(hv, ptr, type) do { \
hv = QSE_HASH_FNV_MAGIC_INIT; \
QSE_HASH_MORE_VALUES (hv, ptr, type); \
} while(0)
# define QSE_HASH_MORE_VS(hv, ptr, type) do { \
type* p = (type*)(ptr); \
while (*p) { hv = QSE_HASH_VALUE(hv, *p); p++; } \
} while(0)
#else #else
/* SDBM hash */ /* SDBM hash */
# define QSE_HASH_INIT 0
# define QSE_HASH_VALUE(hv,v) (((hv) << 6) + ((hv) << 16) - (hv) + (v)) # define QSE_HASH_VALUE(hv,v) (((hv) << 6) + ((hv) << 16) - (hv) + (v))
# define QSE_HASH_VALUES(hv, ptr, len, type) do { \
hv = 0; \
QSE_HASH_MORE_VALUES (hv, ptr, len, type); \
} while(0)
# define QSE_HASH_MORE_VALUES(hv, ptr, len, type) do { \
type* p = (type*)(ptr); \
type* q = (type*)p + (len); \
while (p < q) { hv = QSE_HASH_VALUE(hv, *p); p++; } \
} while(0)
# define QSE_HASH_VS(hv, ptr, type) do { \
hv = 0; \
QSE_HASH_MORE_VS (hv, ptr, type); \
} while(0)
# define QSE_HASH_MORE_VS(hv, ptr, type) do { \
type* p = (type*)(ptr); \
while (*p) { hv = QSE_HASH_VALUE(hv, *p); p++; } \
} while(0)
#endif #endif
#define QSE_HASH_VALUES(hv, ptr, len, type) do { \
hv = QSE_HASH_INIT; \
QSE_HASH_MORE_VALUES (hv, ptr, len, type); \
} while(0)
#define QSE_HASH_MORE_VALUES(hv, ptr, len, type) do { \
type* p = (type*)(ptr); \
type* q = (type*)p + (len); \
while (p < q) { hv = QSE_HASH_VALUE(hv, *p); p++; } \
} while(0)
#define QSE_HASH_VSTR(hv, ptr, type) do { \
hv = QSE_HASH_INIT; \
QSE_HASH_MORE_VALUES (hv, ptr, type); \
} while(0)
#define QSE_HASH_MORE_VSTR(hv, ptr, type) do { \
type* p = (type*)(ptr); \
while (*p) { hv = QSE_HASH_VALUE(hv, *p); p++; } \
} while(0)
#define QSE_HASH_BYTES(hv, ptr, len) QSE_HASH_VALUES(hv, ptr, len, const qse_uint8_t) #define QSE_HASH_BYTES(hv, ptr, len) QSE_HASH_VALUES(hv, ptr, len, const qse_uint8_t)
#define QSE_HASH_MORE_BYTES(hv, ptr, len) QSE_HASH_MORE_VALUES(hv, ptr, len, const qse_uint8_t) #define QSE_HASH_MORE_BYTES(hv, ptr, len) QSE_HASH_MORE_VALUES(hv, ptr, len, const qse_uint8_t)
@ -102,11 +81,11 @@
#define QSE_HASH_WCHARS(hv, ptr, len) QSE_HASH_VALUES(hv, ptr, len, const qse_wchar_t) #define QSE_HASH_WCHARS(hv, ptr, len) QSE_HASH_VALUES(hv, ptr, len, const qse_wchar_t)
#define QSE_HASH_MORE_WCHARS(hv, ptr, len) QSE_HASH_MORE_VALUES(hv, ptr, len, const qse_wchar_t) #define QSE_HASH_MORE_WCHARS(hv, ptr, len) QSE_HASH_MORE_VALUES(hv, ptr, len, const qse_wchar_t)
#define QSE_HASH_MBS(hv, ptr) QSE_HASH_VS(hv, ptr, const qse_mchar_t) #define QSE_HASH_MBS(hv, ptr) QSE_HASH_VSTR(hv, ptr, const qse_mchar_t)
#define QSE_HASH_MORE_MBS(hv, ptr) QSE_HASH_MORE_VS(hv, ptr, const qse_mchar_t) #define QSE_HASH_MORE_MBS(hv, ptr) QSE_HASH_MORE_VSTR(hv, ptr, const qse_mchar_t)
#define QSE_HASH_WCS(hv, ptr) QSE_HASH_VS(hv, ptr, const qse_wchar_t) #define QSE_HASH_WCS(hv, ptr) QSE_HASH_VSTR(hv, ptr, const qse_wchar_t)
#define QSE_HASH_MORE_WCS(hv, ptr) QSE_HASH_MORE_VS(hv, ptr, const qse_wchar_t) #define QSE_HASH_MORE_WCS(hv, ptr) QSE_HASH_MORE_VSTR(hv, ptr, const qse_wchar_t)
#endif #endif