mirror of
https://github.com/bol-van/zapret.git
synced 2024-11-11 17:29:16 +05:00
update uthash
This commit is contained in:
bol-van
parent
43640e27ac
commit
bdf4c30973
167
nfq/uthash.h
167
nfq/uthash.h
@ -1,5 +1,5 @@
|
|||||||
/*
|
/*
|
||||||
Copyright (c) 2003-2018, Troy D. Hanson http://troydhanson.github.com/uthash/
|
Copyright (c) 2003-2021, Troy D. Hanson http://troydhanson.github.io/uthash/
|
||||||
All rights reserved.
|
All rights reserved.
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
Redistribution and use in source and binary forms, with or without
|
||||||
@ -24,12 +24,22 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|||||||
#ifndef UTHASH_H
|
#ifndef UTHASH_H
|
||||||
#define UTHASH_H
|
#define UTHASH_H
|
||||||
|
|
||||||
#define UTHASH_VERSION 2.0.2
|
#define UTHASH_VERSION 2.3.0
|
||||||
|
|
||||||
#include <string.h> /* memcmp, memset, strlen */
|
#include <string.h> /* memcmp, memset, strlen */
|
||||||
#include <stddef.h> /* ptrdiff_t */
|
#include <stddef.h> /* ptrdiff_t */
|
||||||
#include <stdlib.h> /* exit */
|
#include <stdlib.h> /* exit */
|
||||||
|
|
||||||
|
#if defined(HASH_DEFINE_OWN_STDINT) && HASH_DEFINE_OWN_STDINT
|
||||||
|
/* This codepath is provided for backward compatibility, but I plan to remove it. */
|
||||||
|
#warning "HASH_DEFINE_OWN_STDINT is deprecated; please use HASH_NO_STDINT instead"
|
||||||
|
typedef unsigned int uint32_t;
|
||||||
|
typedef unsigned char uint8_t;
|
||||||
|
#elif defined(HASH_NO_STDINT) && HASH_NO_STDINT
|
||||||
|
#else
|
||||||
|
#include <stdint.h> /* uint8_t, uint32_t */
|
||||||
|
#endif
|
||||||
|
|
||||||
/* These macros use decltype or the earlier __typeof GNU extension.
|
/* These macros use decltype or the earlier __typeof GNU extension.
|
||||||
As decltype is only available in newer compilers (VS2010 or gcc 4.3+
|
As decltype is only available in newer compilers (VS2010 or gcc 4.3+
|
||||||
when compiling c++ source) this code uses whatever method is needed
|
when compiling c++ source) this code uses whatever method is needed
|
||||||
@ -62,23 +72,6 @@ do {
|
|||||||
} while (0)
|
} while (0)
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
/* a number of the hash function use uint32_t which isn't defined on Pre VS2010 */
|
|
||||||
#if defined(_WIN32)
|
|
||||||
#if defined(_MSC_VER) && _MSC_VER >= 1600
|
|
||||||
#include <stdint.h>
|
|
||||||
#elif defined(__WATCOMC__) || defined(__MINGW32__) || defined(__CYGWIN__)
|
|
||||||
#include <stdint.h>
|
|
||||||
#else
|
|
||||||
typedef unsigned int uint32_t;
|
|
||||||
typedef unsigned char uint8_t;
|
|
||||||
#endif
|
|
||||||
#elif defined(__GNUC__) && !defined(__VXWORKS__)
|
|
||||||
#include <stdint.h>
|
|
||||||
#else
|
|
||||||
typedef unsigned int uint32_t;
|
|
||||||
typedef unsigned char uint8_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef uthash_malloc
|
#ifndef uthash_malloc
|
||||||
#define uthash_malloc(sz) malloc(sz) /* malloc fcn */
|
#define uthash_malloc(sz) malloc(sz) /* malloc fcn */
|
||||||
#endif
|
#endif
|
||||||
@ -88,13 +81,18 @@ typedef unsigned char uint8_t;
|
|||||||
#ifndef uthash_bzero
|
#ifndef uthash_bzero
|
||||||
#define uthash_bzero(a,n) memset(a,'\0',n)
|
#define uthash_bzero(a,n) memset(a,'\0',n)
|
||||||
#endif
|
#endif
|
||||||
#ifndef uthash_memcmp
|
|
||||||
#define uthash_memcmp(a,b,n) memcmp(a,b,n)
|
|
||||||
#endif
|
|
||||||
#ifndef uthash_strlen
|
#ifndef uthash_strlen
|
||||||
#define uthash_strlen(s) strlen(s)
|
#define uthash_strlen(s) strlen(s)
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
#ifndef HASH_FUNCTION
|
||||||
|
#define HASH_FUNCTION(keyptr,keylen,hashv) HASH_JEN(keyptr, keylen, hashv)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef HASH_KEYCMP
|
||||||
|
#define HASH_KEYCMP(a,b,n) memcmp(a,b,n)
|
||||||
|
#endif
|
||||||
|
|
||||||
#ifndef uthash_noexpand_fyi
|
#ifndef uthash_noexpand_fyi
|
||||||
#define uthash_noexpand_fyi(tbl) /* can be defined to log noexpand */
|
#define uthash_noexpand_fyi(tbl) /* can be defined to log noexpand */
|
||||||
#endif
|
#endif
|
||||||
@ -136,7 +134,7 @@ typedef unsigned char uint8_t;
|
|||||||
/* calculate the element whose hash handle address is hhp */
|
/* calculate the element whose hash handle address is hhp */
|
||||||
#define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)->hho)))
|
#define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)->hho)))
|
||||||
/* calculate the hash handle from element address elp */
|
/* calculate the hash handle from element address elp */
|
||||||
#define HH_FROM_ELMT(tbl,elp) ((UT_hash_handle *)(((char*)(elp)) + ((tbl)->hho)))
|
#define HH_FROM_ELMT(tbl,elp) ((UT_hash_handle*)(void*)(((char*)(elp)) + ((tbl)->hho)))
|
||||||
|
|
||||||
#define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \
|
#define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \
|
||||||
do { \
|
do { \
|
||||||
@ -150,7 +148,7 @@ do {
|
|||||||
|
|
||||||
#define HASH_VALUE(keyptr,keylen,hashv) \
|
#define HASH_VALUE(keyptr,keylen,hashv) \
|
||||||
do { \
|
do { \
|
||||||
HASH_FCN(keyptr, keylen, hashv); \
|
HASH_FUNCTION(keyptr, keylen, hashv); \
|
||||||
} while (0)
|
} while (0)
|
||||||
|
|
||||||
#define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \
|
#define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \
|
||||||
@ -167,9 +165,12 @@ do {
|
|||||||
|
|
||||||
#define HASH_FIND(hh,head,keyptr,keylen,out) \
|
#define HASH_FIND(hh,head,keyptr,keylen,out) \
|
||||||
do { \
|
do { \
|
||||||
unsigned _hf_hashv; \
|
(out) = NULL; \
|
||||||
HASH_VALUE(keyptr, keylen, _hf_hashv); \
|
if (head) { \
|
||||||
HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out); \
|
unsigned _hf_hashv; \
|
||||||
|
HASH_VALUE(keyptr, keylen, _hf_hashv); \
|
||||||
|
HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out); \
|
||||||
|
} \
|
||||||
} while (0)
|
} while (0)
|
||||||
|
|
||||||
#ifdef HASH_BLOOM
|
#ifdef HASH_BLOOM
|
||||||
@ -397,7 +398,7 @@ do {
|
|||||||
do { \
|
do { \
|
||||||
IF_HASH_NONFATAL_OOM( int _ha_oomed = 0; ) \
|
IF_HASH_NONFATAL_OOM( int _ha_oomed = 0; ) \
|
||||||
(add)->hh.hashv = (hashval); \
|
(add)->hh.hashv = (hashval); \
|
||||||
(add)->hh.key = (char*) (keyptr); \
|
(add)->hh.key = (const void*) (keyptr); \
|
||||||
(add)->hh.keylen = (unsigned) (keylen_in); \
|
(add)->hh.keylen = (unsigned) (keylen_in); \
|
||||||
if (!(head)) { \
|
if (!(head)) { \
|
||||||
(add)->hh.next = NULL; \
|
(add)->hh.next = NULL; \
|
||||||
@ -511,7 +512,8 @@ do {
|
|||||||
* This is for uthash developer only; it compiles away if HASH_DEBUG isn't defined.
|
* This is for uthash developer only; it compiles away if HASH_DEBUG isn't defined.
|
||||||
*/
|
*/
|
||||||
#ifdef HASH_DEBUG
|
#ifdef HASH_DEBUG
|
||||||
#define HASH_OOPS(...) do { fprintf(stderr,__VA_ARGS__); exit(-1); } while (0)
|
#include <stdio.h> /* fprintf, stderr */
|
||||||
|
#define HASH_OOPS(...) do { fprintf(stderr, __VA_ARGS__); exit(-1); } while (0)
|
||||||
#define HASH_FSCK(hh,head,where) \
|
#define HASH_FSCK(hh,head,where) \
|
||||||
do { \
|
do { \
|
||||||
struct UT_hash_handle *_thh; \
|
struct UT_hash_handle *_thh; \
|
||||||
@ -578,13 +580,6 @@ do {
|
|||||||
#define HASH_EMIT_KEY(hh,head,keyptr,fieldlen)
|
#define HASH_EMIT_KEY(hh,head,keyptr,fieldlen)
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
/* default to Jenkin's hash unless overridden e.g. DHASH_FUNCTION=HASH_SAX */
|
|
||||||
#ifdef HASH_FUNCTION
|
|
||||||
#define HASH_FCN HASH_FUNCTION
|
|
||||||
#else
|
|
||||||
#define HASH_FCN HASH_JEN
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* The Bernstein hash function, used in Perl prior to v5.6. Note (x<<5+x)=x*33. */
|
/* The Bernstein hash function, used in Perl prior to v5.6. Note (x<<5+x)=x*33. */
|
||||||
#define HASH_BER(key,keylen,hashv) \
|
#define HASH_BER(key,keylen,hashv) \
|
||||||
do { \
|
do { \
|
||||||
@ -683,7 +678,8 @@ do {
|
|||||||
case 4: _hj_i += ( (unsigned)_hj_key[3] << 24 ); /* FALLTHROUGH */ \
|
case 4: _hj_i += ( (unsigned)_hj_key[3] << 24 ); /* FALLTHROUGH */ \
|
||||||
case 3: _hj_i += ( (unsigned)_hj_key[2] << 16 ); /* FALLTHROUGH */ \
|
case 3: _hj_i += ( (unsigned)_hj_key[2] << 16 ); /* FALLTHROUGH */ \
|
||||||
case 2: _hj_i += ( (unsigned)_hj_key[1] << 8 ); /* FALLTHROUGH */ \
|
case 2: _hj_i += ( (unsigned)_hj_key[1] << 8 ); /* FALLTHROUGH */ \
|
||||||
case 1: _hj_i += _hj_key[0]; \
|
case 1: _hj_i += _hj_key[0]; /* FALLTHROUGH */ \
|
||||||
|
default: ; \
|
||||||
} \
|
} \
|
||||||
HASH_JEN_MIX(_hj_i, _hj_j, hashv); \
|
HASH_JEN_MIX(_hj_i, _hj_j, hashv); \
|
||||||
} while (0)
|
} while (0)
|
||||||
@ -731,6 +727,8 @@ do {
|
|||||||
case 1: hashv += *_sfh_key; \
|
case 1: hashv += *_sfh_key; \
|
||||||
hashv ^= hashv << 10; \
|
hashv ^= hashv << 10; \
|
||||||
hashv += hashv >> 1; \
|
hashv += hashv >> 1; \
|
||||||
|
break; \
|
||||||
|
default: ; \
|
||||||
} \
|
} \
|
||||||
\
|
\
|
||||||
/* Force "avalanching" of final 127 bits */ \
|
/* Force "avalanching" of final 127 bits */ \
|
||||||
@ -742,87 +740,6 @@ do {
|
|||||||
hashv += hashv >> 6; \
|
hashv += hashv >> 6; \
|
||||||
} while (0)
|
} while (0)
|
||||||
|
|
||||||
#ifdef HASH_USING_NO_STRICT_ALIASING
|
|
||||||
/* The MurmurHash exploits some CPU's (x86,x86_64) tolerance for unaligned reads.
|
|
||||||
* For other types of CPU's (e.g. Sparc) an unaligned read causes a bus error.
|
|
||||||
* MurmurHash uses the faster approach only on CPU's where we know it's safe.
|
|
||||||
*
|
|
||||||
* Note the preprocessor built-in defines can be emitted using:
|
|
||||||
*
|
|
||||||
* gcc -m64 -dM -E - < /dev/null (on gcc)
|
|
||||||
* cc -## a.c (where a.c is a simple test file) (Sun Studio)
|
|
||||||
*/
|
|
||||||
#if (defined(__i386__) || defined(__x86_64__) || defined(_M_IX86))
|
|
||||||
#define MUR_GETBLOCK(p,i) p[i]
|
|
||||||
#else /* non intel */
|
|
||||||
#define MUR_PLUS0_ALIGNED(p) (((unsigned long)p & 3UL) == 0UL)
|
|
||||||
#define MUR_PLUS1_ALIGNED(p) (((unsigned long)p & 3UL) == 1UL)
|
|
||||||
#define MUR_PLUS2_ALIGNED(p) (((unsigned long)p & 3UL) == 2UL)
|
|
||||||
#define MUR_PLUS3_ALIGNED(p) (((unsigned long)p & 3UL) == 3UL)
|
|
||||||
#define WP(p) ((uint32_t*)((unsigned long)(p) & ~3UL))
|
|
||||||
#if (defined(__BIG_ENDIAN__) || defined(SPARC) || defined(__ppc__) || defined(__ppc64__))
|
|
||||||
#define MUR_THREE_ONE(p) ((((*WP(p))&0x00ffffff) << 8) | (((*(WP(p)+1))&0xff000000) >> 24))
|
|
||||||
#define MUR_TWO_TWO(p) ((((*WP(p))&0x0000ffff) <<16) | (((*(WP(p)+1))&0xffff0000) >> 16))
|
|
||||||
#define MUR_ONE_THREE(p) ((((*WP(p))&0x000000ff) <<24) | (((*(WP(p)+1))&0xffffff00) >> 8))
|
|
||||||
#else /* assume little endian non-intel */
|
|
||||||
#define MUR_THREE_ONE(p) ((((*WP(p))&0xffffff00) >> 8) | (((*(WP(p)+1))&0x000000ff) << 24))
|
|
||||||
#define MUR_TWO_TWO(p) ((((*WP(p))&0xffff0000) >>16) | (((*(WP(p)+1))&0x0000ffff) << 16))
|
|
||||||
#define MUR_ONE_THREE(p) ((((*WP(p))&0xff000000) >>24) | (((*(WP(p)+1))&0x00ffffff) << 8))
|
|
||||||
#endif
|
|
||||||
#define MUR_GETBLOCK(p,i) (MUR_PLUS0_ALIGNED(p) ? ((p)[i]) : \
|
|
||||||
(MUR_PLUS1_ALIGNED(p) ? MUR_THREE_ONE(p) : \
|
|
||||||
(MUR_PLUS2_ALIGNED(p) ? MUR_TWO_TWO(p) : \
|
|
||||||
MUR_ONE_THREE(p))))
|
|
||||||
#endif
|
|
||||||
#define MUR_ROTL32(x,r) (((x) << (r)) | ((x) >> (32 - (r))))
|
|
||||||
#define MUR_FMIX(_h) \
|
|
||||||
do { \
|
|
||||||
_h ^= _h >> 16; \
|
|
||||||
_h *= 0x85ebca6bu; \
|
|
||||||
_h ^= _h >> 13; \
|
|
||||||
_h *= 0xc2b2ae35u; \
|
|
||||||
_h ^= _h >> 16; \
|
|
||||||
} while (0)
|
|
||||||
|
|
||||||
#define HASH_MUR(key,keylen,hashv) \
|
|
||||||
do { \
|
|
||||||
const uint8_t *_mur_data = (const uint8_t*)(key); \
|
|
||||||
const int _mur_nblocks = (int)(keylen) / 4; \
|
|
||||||
uint32_t _mur_h1 = 0xf88D5353u; \
|
|
||||||
uint32_t _mur_c1 = 0xcc9e2d51u; \
|
|
||||||
uint32_t _mur_c2 = 0x1b873593u; \
|
|
||||||
uint32_t _mur_k1 = 0; \
|
|
||||||
const uint8_t *_mur_tail; \
|
|
||||||
const uint32_t *_mur_blocks = (const uint32_t*)(_mur_data+(_mur_nblocks*4)); \
|
|
||||||
int _mur_i; \
|
|
||||||
for (_mur_i = -_mur_nblocks; _mur_i != 0; _mur_i++) { \
|
|
||||||
_mur_k1 = MUR_GETBLOCK(_mur_blocks,_mur_i); \
|
|
||||||
_mur_k1 *= _mur_c1; \
|
|
||||||
_mur_k1 = MUR_ROTL32(_mur_k1,15); \
|
|
||||||
_mur_k1 *= _mur_c2; \
|
|
||||||
\
|
|
||||||
_mur_h1 ^= _mur_k1; \
|
|
||||||
_mur_h1 = MUR_ROTL32(_mur_h1,13); \
|
|
||||||
_mur_h1 = (_mur_h1*5U) + 0xe6546b64u; \
|
|
||||||
} \
|
|
||||||
_mur_tail = (const uint8_t*)(_mur_data + (_mur_nblocks*4)); \
|
|
||||||
_mur_k1=0; \
|
|
||||||
switch ((keylen) & 3U) { \
|
|
||||||
case 0: break; \
|
|
||||||
case 3: _mur_k1 ^= (uint32_t)_mur_tail[2] << 16; /* FALLTHROUGH */ \
|
|
||||||
case 2: _mur_k1 ^= (uint32_t)_mur_tail[1] << 8; /* FALLTHROUGH */ \
|
|
||||||
case 1: _mur_k1 ^= (uint32_t)_mur_tail[0]; \
|
|
||||||
_mur_k1 *= _mur_c1; \
|
|
||||||
_mur_k1 = MUR_ROTL32(_mur_k1,15); \
|
|
||||||
_mur_k1 *= _mur_c2; \
|
|
||||||
_mur_h1 ^= _mur_k1; \
|
|
||||||
} \
|
|
||||||
_mur_h1 ^= (uint32_t)(keylen); \
|
|
||||||
MUR_FMIX(_mur_h1); \
|
|
||||||
hashv = _mur_h1; \
|
|
||||||
} while (0)
|
|
||||||
#endif /* HASH_USING_NO_STRICT_ALIASING */
|
|
||||||
|
|
||||||
/* iterate over items in a known bucket to find desired item */
|
/* iterate over items in a known bucket to find desired item */
|
||||||
#define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,hashval,out) \
|
#define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,hashval,out) \
|
||||||
do { \
|
do { \
|
||||||
@ -833,7 +750,7 @@ do {
|
|||||||
} \
|
} \
|
||||||
while ((out) != NULL) { \
|
while ((out) != NULL) { \
|
||||||
if ((out)->hh.hashv == (hashval) && (out)->hh.keylen == (keylen_in)) { \
|
if ((out)->hh.hashv == (hashval) && (out)->hh.keylen == (keylen_in)) { \
|
||||||
if (uthash_memcmp((out)->hh.key, keyptr, keylen_in) == 0) { \
|
if (HASH_KEYCMP((out)->hh.key, keyptr, keylen_in) == 0) { \
|
||||||
break; \
|
break; \
|
||||||
} \
|
} \
|
||||||
} \
|
} \
|
||||||
@ -919,12 +836,12 @@ do {
|
|||||||
struct UT_hash_handle *_he_thh, *_he_hh_nxt; \
|
struct UT_hash_handle *_he_thh, *_he_hh_nxt; \
|
||||||
UT_hash_bucket *_he_new_buckets, *_he_newbkt; \
|
UT_hash_bucket *_he_new_buckets, *_he_newbkt; \
|
||||||
_he_new_buckets = (UT_hash_bucket*)uthash_malloc( \
|
_he_new_buckets = (UT_hash_bucket*)uthash_malloc( \
|
||||||
2UL * (tbl)->num_buckets * sizeof(struct UT_hash_bucket)); \
|
sizeof(struct UT_hash_bucket) * (tbl)->num_buckets * 2U); \
|
||||||
if (!_he_new_buckets) { \
|
if (!_he_new_buckets) { \
|
||||||
HASH_RECORD_OOM(oomed); \
|
HASH_RECORD_OOM(oomed); \
|
||||||
} else { \
|
} else { \
|
||||||
uthash_bzero(_he_new_buckets, \
|
uthash_bzero(_he_new_buckets, \
|
||||||
2UL * (tbl)->num_buckets * sizeof(struct UT_hash_bucket)); \
|
sizeof(struct UT_hash_bucket) * (tbl)->num_buckets * 2U); \
|
||||||
(tbl)->ideal_chain_maxlen = \
|
(tbl)->ideal_chain_maxlen = \
|
||||||
((tbl)->num_items >> ((tbl)->log2_num_buckets+1U)) + \
|
((tbl)->num_items >> ((tbl)->log2_num_buckets+1U)) + \
|
||||||
((((tbl)->num_items & (((tbl)->num_buckets*2U)-1U)) != 0U) ? 1U : 0U); \
|
((((tbl)->num_items & (((tbl)->num_buckets*2U)-1U)) != 0U) ? 1U : 0U); \
|
||||||
@ -937,7 +854,9 @@ do {
|
|||||||
_he_newbkt = &(_he_new_buckets[_he_bkt]); \
|
_he_newbkt = &(_he_new_buckets[_he_bkt]); \
|
||||||
if (++(_he_newbkt->count) > (tbl)->ideal_chain_maxlen) { \
|
if (++(_he_newbkt->count) > (tbl)->ideal_chain_maxlen) { \
|
||||||
(tbl)->nonideal_items++; \
|
(tbl)->nonideal_items++; \
|
||||||
_he_newbkt->expand_mult = _he_newbkt->count / (tbl)->ideal_chain_maxlen; \
|
if (_he_newbkt->count > _he_newbkt->expand_mult * (tbl)->ideal_chain_maxlen) { \
|
||||||
|
_he_newbkt->expand_mult++; \
|
||||||
|
} \
|
||||||
} \
|
} \
|
||||||
_he_thh->hh_prev = NULL; \
|
_he_thh->hh_prev = NULL; \
|
||||||
_he_thh->hh_next = _he_newbkt->hh_head; \
|
_he_thh->hh_next = _he_newbkt->hh_head; \
|
||||||
@ -1070,7 +989,7 @@ do {
|
|||||||
_elt = ELMT_FROM_HH((src)->hh_src.tbl, _src_hh); \
|
_elt = ELMT_FROM_HH((src)->hh_src.tbl, _src_hh); \
|
||||||
if (cond(_elt)) { \
|
if (cond(_elt)) { \
|
||||||
IF_HASH_NONFATAL_OOM( int _hs_oomed = 0; ) \
|
IF_HASH_NONFATAL_OOM( int _hs_oomed = 0; ) \
|
||||||
_dst_hh = (UT_hash_handle*)(((char*)_elt) + _dst_hho); \
|
_dst_hh = (UT_hash_handle*)(void*)(((char*)_elt) + _dst_hho); \
|
||||||
_dst_hh->key = _src_hh->key; \
|
_dst_hh->key = _src_hh->key; \
|
||||||
_dst_hh->keylen = _src_hh->keylen; \
|
_dst_hh->keylen = _src_hh->keylen; \
|
||||||
_dst_hh->hashv = _src_hh->hashv; \
|
_dst_hh->hashv = _src_hh->hashv; \
|
||||||
@ -1209,7 +1128,7 @@ typedef struct UT_hash_handle {
|
|||||||
void *next; /* next element in app order */
|
void *next; /* next element in app order */
|
||||||
struct UT_hash_handle *hh_prev; /* previous hh in bucket order */
|
struct UT_hash_handle *hh_prev; /* previous hh in bucket order */
|
||||||
struct UT_hash_handle *hh_next; /* next hh in bucket order */
|
struct UT_hash_handle *hh_next; /* next hh in bucket order */
|
||||||
void *key; /* ptr to enclosing struct's key */
|
const void *key; /* ptr to enclosing struct's key */
|
||||||
unsigned keylen; /* enclosing struct's key len */
|
unsigned keylen; /* enclosing struct's key len */
|
||||||
unsigned hashv; /* result of hash-fcn(key) */
|
unsigned hashv; /* result of hash-fcn(key) */
|
||||||
} UT_hash_handle;
|
} UT_hash_handle;
|
||||||
|
|||||||
167
tpws/uthash.h
167
tpws/uthash.h
@ -1,5 +1,5 @@
|
|||||||
/*
|
/*
|
||||||
Copyright (c) 2003-2018, Troy D. Hanson http://troydhanson.github.com/uthash/
|
Copyright (c) 2003-2021, Troy D. Hanson http://troydhanson.github.io/uthash/
|
||||||
All rights reserved.
|
All rights reserved.
|
||||||
|
|
||||||
Redistribution and use in source and binary forms, with or without
|
Redistribution and use in source and binary forms, with or without
|
||||||
@ -24,12 +24,22 @@ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|||||||
#ifndef UTHASH_H
|
#ifndef UTHASH_H
|
||||||
#define UTHASH_H
|
#define UTHASH_H
|
||||||
|
|
||||||
#define UTHASH_VERSION 2.0.2
|
#define UTHASH_VERSION 2.3.0
|
||||||
|
|
||||||
#include <string.h> /* memcmp, memset, strlen */
|
#include <string.h> /* memcmp, memset, strlen */
|
||||||
#include <stddef.h> /* ptrdiff_t */
|
#include <stddef.h> /* ptrdiff_t */
|
||||||
#include <stdlib.h> /* exit */
|
#include <stdlib.h> /* exit */
|
||||||
|
|
||||||
|
#if defined(HASH_DEFINE_OWN_STDINT) && HASH_DEFINE_OWN_STDINT
|
||||||
|
/* This codepath is provided for backward compatibility, but I plan to remove it. */
|
||||||
|
#warning "HASH_DEFINE_OWN_STDINT is deprecated; please use HASH_NO_STDINT instead"
|
||||||
|
typedef unsigned int uint32_t;
|
||||||
|
typedef unsigned char uint8_t;
|
||||||
|
#elif defined(HASH_NO_STDINT) && HASH_NO_STDINT
|
||||||
|
#else
|
||||||
|
#include <stdint.h> /* uint8_t, uint32_t */
|
||||||
|
#endif
|
||||||
|
|
||||||
/* These macros use decltype or the earlier __typeof GNU extension.
|
/* These macros use decltype or the earlier __typeof GNU extension.
|
||||||
As decltype is only available in newer compilers (VS2010 or gcc 4.3+
|
As decltype is only available in newer compilers (VS2010 or gcc 4.3+
|
||||||
when compiling c++ source) this code uses whatever method is needed
|
when compiling c++ source) this code uses whatever method is needed
|
||||||
@ -62,23 +72,6 @@ do {
|
|||||||
} while (0)
|
} while (0)
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
/* a number of the hash function use uint32_t which isn't defined on Pre VS2010 */
|
|
||||||
#if defined(_WIN32)
|
|
||||||
#if defined(_MSC_VER) && _MSC_VER >= 1600
|
|
||||||
#include <stdint.h>
|
|
||||||
#elif defined(__WATCOMC__) || defined(__MINGW32__) || defined(__CYGWIN__)
|
|
||||||
#include <stdint.h>
|
|
||||||
#else
|
|
||||||
typedef unsigned int uint32_t;
|
|
||||||
typedef unsigned char uint8_t;
|
|
||||||
#endif
|
|
||||||
#elif defined(__GNUC__) && !defined(__VXWORKS__)
|
|
||||||
#include <stdint.h>
|
|
||||||
#else
|
|
||||||
typedef unsigned int uint32_t;
|
|
||||||
typedef unsigned char uint8_t;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#ifndef uthash_malloc
|
#ifndef uthash_malloc
|
||||||
#define uthash_malloc(sz) malloc(sz) /* malloc fcn */
|
#define uthash_malloc(sz) malloc(sz) /* malloc fcn */
|
||||||
#endif
|
#endif
|
||||||
@ -88,13 +81,18 @@ typedef unsigned char uint8_t;
|
|||||||
#ifndef uthash_bzero
|
#ifndef uthash_bzero
|
||||||
#define uthash_bzero(a,n) memset(a,'\0',n)
|
#define uthash_bzero(a,n) memset(a,'\0',n)
|
||||||
#endif
|
#endif
|
||||||
#ifndef uthash_memcmp
|
|
||||||
#define uthash_memcmp(a,b,n) memcmp(a,b,n)
|
|
||||||
#endif
|
|
||||||
#ifndef uthash_strlen
|
#ifndef uthash_strlen
|
||||||
#define uthash_strlen(s) strlen(s)
|
#define uthash_strlen(s) strlen(s)
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
#ifndef HASH_FUNCTION
|
||||||
|
#define HASH_FUNCTION(keyptr,keylen,hashv) HASH_JEN(keyptr, keylen, hashv)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef HASH_KEYCMP
|
||||||
|
#define HASH_KEYCMP(a,b,n) memcmp(a,b,n)
|
||||||
|
#endif
|
||||||
|
|
||||||
#ifndef uthash_noexpand_fyi
|
#ifndef uthash_noexpand_fyi
|
||||||
#define uthash_noexpand_fyi(tbl) /* can be defined to log noexpand */
|
#define uthash_noexpand_fyi(tbl) /* can be defined to log noexpand */
|
||||||
#endif
|
#endif
|
||||||
@ -136,7 +134,7 @@ typedef unsigned char uint8_t;
|
|||||||
/* calculate the element whose hash handle address is hhp */
|
/* calculate the element whose hash handle address is hhp */
|
||||||
#define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)->hho)))
|
#define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)->hho)))
|
||||||
/* calculate the hash handle from element address elp */
|
/* calculate the hash handle from element address elp */
|
||||||
#define HH_FROM_ELMT(tbl,elp) ((UT_hash_handle *)(((char*)(elp)) + ((tbl)->hho)))
|
#define HH_FROM_ELMT(tbl,elp) ((UT_hash_handle*)(void*)(((char*)(elp)) + ((tbl)->hho)))
|
||||||
|
|
||||||
#define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \
|
#define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \
|
||||||
do { \
|
do { \
|
||||||
@ -150,7 +148,7 @@ do {
|
|||||||
|
|
||||||
#define HASH_VALUE(keyptr,keylen,hashv) \
|
#define HASH_VALUE(keyptr,keylen,hashv) \
|
||||||
do { \
|
do { \
|
||||||
HASH_FCN(keyptr, keylen, hashv); \
|
HASH_FUNCTION(keyptr, keylen, hashv); \
|
||||||
} while (0)
|
} while (0)
|
||||||
|
|
||||||
#define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \
|
#define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \
|
||||||
@ -167,9 +165,12 @@ do {
|
|||||||
|
|
||||||
#define HASH_FIND(hh,head,keyptr,keylen,out) \
|
#define HASH_FIND(hh,head,keyptr,keylen,out) \
|
||||||
do { \
|
do { \
|
||||||
unsigned _hf_hashv; \
|
(out) = NULL; \
|
||||||
HASH_VALUE(keyptr, keylen, _hf_hashv); \
|
if (head) { \
|
||||||
HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out); \
|
unsigned _hf_hashv; \
|
||||||
|
HASH_VALUE(keyptr, keylen, _hf_hashv); \
|
||||||
|
HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out); \
|
||||||
|
} \
|
||||||
} while (0)
|
} while (0)
|
||||||
|
|
||||||
#ifdef HASH_BLOOM
|
#ifdef HASH_BLOOM
|
||||||
@ -397,7 +398,7 @@ do {
|
|||||||
do { \
|
do { \
|
||||||
IF_HASH_NONFATAL_OOM( int _ha_oomed = 0; ) \
|
IF_HASH_NONFATAL_OOM( int _ha_oomed = 0; ) \
|
||||||
(add)->hh.hashv = (hashval); \
|
(add)->hh.hashv = (hashval); \
|
||||||
(add)->hh.key = (char*) (keyptr); \
|
(add)->hh.key = (const void*) (keyptr); \
|
||||||
(add)->hh.keylen = (unsigned) (keylen_in); \
|
(add)->hh.keylen = (unsigned) (keylen_in); \
|
||||||
if (!(head)) { \
|
if (!(head)) { \
|
||||||
(add)->hh.next = NULL; \
|
(add)->hh.next = NULL; \
|
||||||
@ -511,7 +512,8 @@ do {
|
|||||||
* This is for uthash developer only; it compiles away if HASH_DEBUG isn't defined.
|
* This is for uthash developer only; it compiles away if HASH_DEBUG isn't defined.
|
||||||
*/
|
*/
|
||||||
#ifdef HASH_DEBUG
|
#ifdef HASH_DEBUG
|
||||||
#define HASH_OOPS(...) do { fprintf(stderr,__VA_ARGS__); exit(-1); } while (0)
|
#include <stdio.h> /* fprintf, stderr */
|
||||||
|
#define HASH_OOPS(...) do { fprintf(stderr, __VA_ARGS__); exit(-1); } while (0)
|
||||||
#define HASH_FSCK(hh,head,where) \
|
#define HASH_FSCK(hh,head,where) \
|
||||||
do { \
|
do { \
|
||||||
struct UT_hash_handle *_thh; \
|
struct UT_hash_handle *_thh; \
|
||||||
@ -578,13 +580,6 @@ do {
|
|||||||
#define HASH_EMIT_KEY(hh,head,keyptr,fieldlen)
|
#define HASH_EMIT_KEY(hh,head,keyptr,fieldlen)
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
/* default to Jenkin's hash unless overridden e.g. DHASH_FUNCTION=HASH_SAX */
|
|
||||||
#ifdef HASH_FUNCTION
|
|
||||||
#define HASH_FCN HASH_FUNCTION
|
|
||||||
#else
|
|
||||||
#define HASH_FCN HASH_JEN
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/* The Bernstein hash function, used in Perl prior to v5.6. Note (x<<5+x)=x*33. */
|
/* The Bernstein hash function, used in Perl prior to v5.6. Note (x<<5+x)=x*33. */
|
||||||
#define HASH_BER(key,keylen,hashv) \
|
#define HASH_BER(key,keylen,hashv) \
|
||||||
do { \
|
do { \
|
||||||
@ -683,7 +678,8 @@ do {
|
|||||||
case 4: _hj_i += ( (unsigned)_hj_key[3] << 24 ); /* FALLTHROUGH */ \
|
case 4: _hj_i += ( (unsigned)_hj_key[3] << 24 ); /* FALLTHROUGH */ \
|
||||||
case 3: _hj_i += ( (unsigned)_hj_key[2] << 16 ); /* FALLTHROUGH */ \
|
case 3: _hj_i += ( (unsigned)_hj_key[2] << 16 ); /* FALLTHROUGH */ \
|
||||||
case 2: _hj_i += ( (unsigned)_hj_key[1] << 8 ); /* FALLTHROUGH */ \
|
case 2: _hj_i += ( (unsigned)_hj_key[1] << 8 ); /* FALLTHROUGH */ \
|
||||||
case 1: _hj_i += _hj_key[0]; \
|
case 1: _hj_i += _hj_key[0]; /* FALLTHROUGH */ \
|
||||||
|
default: ; \
|
||||||
} \
|
} \
|
||||||
HASH_JEN_MIX(_hj_i, _hj_j, hashv); \
|
HASH_JEN_MIX(_hj_i, _hj_j, hashv); \
|
||||||
} while (0)
|
} while (0)
|
||||||
@ -731,6 +727,8 @@ do {
|
|||||||
case 1: hashv += *_sfh_key; \
|
case 1: hashv += *_sfh_key; \
|
||||||
hashv ^= hashv << 10; \
|
hashv ^= hashv << 10; \
|
||||||
hashv += hashv >> 1; \
|
hashv += hashv >> 1; \
|
||||||
|
break; \
|
||||||
|
default: ; \
|
||||||
} \
|
} \
|
||||||
\
|
\
|
||||||
/* Force "avalanching" of final 127 bits */ \
|
/* Force "avalanching" of final 127 bits */ \
|
||||||
@ -742,87 +740,6 @@ do {
|
|||||||
hashv += hashv >> 6; \
|
hashv += hashv >> 6; \
|
||||||
} while (0)
|
} while (0)
|
||||||
|
|
||||||
#ifdef HASH_USING_NO_STRICT_ALIASING
|
|
||||||
/* The MurmurHash exploits some CPU's (x86,x86_64) tolerance for unaligned reads.
|
|
||||||
* For other types of CPU's (e.g. Sparc) an unaligned read causes a bus error.
|
|
||||||
* MurmurHash uses the faster approach only on CPU's where we know it's safe.
|
|
||||||
*
|
|
||||||
* Note the preprocessor built-in defines can be emitted using:
|
|
||||||
*
|
|
||||||
* gcc -m64 -dM -E - < /dev/null (on gcc)
|
|
||||||
* cc -## a.c (where a.c is a simple test file) (Sun Studio)
|
|
||||||
*/
|
|
||||||
#if (defined(__i386__) || defined(__x86_64__) || defined(_M_IX86))
|
|
||||||
#define MUR_GETBLOCK(p,i) p[i]
|
|
||||||
#else /* non intel */
|
|
||||||
#define MUR_PLUS0_ALIGNED(p) (((unsigned long)p & 3UL) == 0UL)
|
|
||||||
#define MUR_PLUS1_ALIGNED(p) (((unsigned long)p & 3UL) == 1UL)
|
|
||||||
#define MUR_PLUS2_ALIGNED(p) (((unsigned long)p & 3UL) == 2UL)
|
|
||||||
#define MUR_PLUS3_ALIGNED(p) (((unsigned long)p & 3UL) == 3UL)
|
|
||||||
#define WP(p) ((uint32_t*)((unsigned long)(p) & ~3UL))
|
|
||||||
#if (defined(__BIG_ENDIAN__) || defined(SPARC) || defined(__ppc__) || defined(__ppc64__))
|
|
||||||
#define MUR_THREE_ONE(p) ((((*WP(p))&0x00ffffff) << 8) | (((*(WP(p)+1))&0xff000000) >> 24))
|
|
||||||
#define MUR_TWO_TWO(p) ((((*WP(p))&0x0000ffff) <<16) | (((*(WP(p)+1))&0xffff0000) >> 16))
|
|
||||||
#define MUR_ONE_THREE(p) ((((*WP(p))&0x000000ff) <<24) | (((*(WP(p)+1))&0xffffff00) >> 8))
|
|
||||||
#else /* assume little endian non-intel */
|
|
||||||
#define MUR_THREE_ONE(p) ((((*WP(p))&0xffffff00) >> 8) | (((*(WP(p)+1))&0x000000ff) << 24))
|
|
||||||
#define MUR_TWO_TWO(p) ((((*WP(p))&0xffff0000) >>16) | (((*(WP(p)+1))&0x0000ffff) << 16))
|
|
||||||
#define MUR_ONE_THREE(p) ((((*WP(p))&0xff000000) >>24) | (((*(WP(p)+1))&0x00ffffff) << 8))
|
|
||||||
#endif
|
|
||||||
#define MUR_GETBLOCK(p,i) (MUR_PLUS0_ALIGNED(p) ? ((p)[i]) : \
|
|
||||||
(MUR_PLUS1_ALIGNED(p) ? MUR_THREE_ONE(p) : \
|
|
||||||
(MUR_PLUS2_ALIGNED(p) ? MUR_TWO_TWO(p) : \
|
|
||||||
MUR_ONE_THREE(p))))
|
|
||||||
#endif
|
|
||||||
#define MUR_ROTL32(x,r) (((x) << (r)) | ((x) >> (32 - (r))))
|
|
||||||
#define MUR_FMIX(_h) \
|
|
||||||
do { \
|
|
||||||
_h ^= _h >> 16; \
|
|
||||||
_h *= 0x85ebca6bu; \
|
|
||||||
_h ^= _h >> 13; \
|
|
||||||
_h *= 0xc2b2ae35u; \
|
|
||||||
_h ^= _h >> 16; \
|
|
||||||
} while (0)
|
|
||||||
|
|
||||||
#define HASH_MUR(key,keylen,hashv) \
|
|
||||||
do { \
|
|
||||||
const uint8_t *_mur_data = (const uint8_t*)(key); \
|
|
||||||
const int _mur_nblocks = (int)(keylen) / 4; \
|
|
||||||
uint32_t _mur_h1 = 0xf88D5353u; \
|
|
||||||
uint32_t _mur_c1 = 0xcc9e2d51u; \
|
|
||||||
uint32_t _mur_c2 = 0x1b873593u; \
|
|
||||||
uint32_t _mur_k1 = 0; \
|
|
||||||
const uint8_t *_mur_tail; \
|
|
||||||
const uint32_t *_mur_blocks = (const uint32_t*)(_mur_data+(_mur_nblocks*4)); \
|
|
||||||
int _mur_i; \
|
|
||||||
for (_mur_i = -_mur_nblocks; _mur_i != 0; _mur_i++) { \
|
|
||||||
_mur_k1 = MUR_GETBLOCK(_mur_blocks,_mur_i); \
|
|
||||||
_mur_k1 *= _mur_c1; \
|
|
||||||
_mur_k1 = MUR_ROTL32(_mur_k1,15); \
|
|
||||||
_mur_k1 *= _mur_c2; \
|
|
||||||
\
|
|
||||||
_mur_h1 ^= _mur_k1; \
|
|
||||||
_mur_h1 = MUR_ROTL32(_mur_h1,13); \
|
|
||||||
_mur_h1 = (_mur_h1*5U) + 0xe6546b64u; \
|
|
||||||
} \
|
|
||||||
_mur_tail = (const uint8_t*)(_mur_data + (_mur_nblocks*4)); \
|
|
||||||
_mur_k1=0; \
|
|
||||||
switch ((keylen) & 3U) { \
|
|
||||||
case 0: break; \
|
|
||||||
case 3: _mur_k1 ^= (uint32_t)_mur_tail[2] << 16; /* FALLTHROUGH */ \
|
|
||||||
case 2: _mur_k1 ^= (uint32_t)_mur_tail[1] << 8; /* FALLTHROUGH */ \
|
|
||||||
case 1: _mur_k1 ^= (uint32_t)_mur_tail[0]; \
|
|
||||||
_mur_k1 *= _mur_c1; \
|
|
||||||
_mur_k1 = MUR_ROTL32(_mur_k1,15); \
|
|
||||||
_mur_k1 *= _mur_c2; \
|
|
||||||
_mur_h1 ^= _mur_k1; \
|
|
||||||
} \
|
|
||||||
_mur_h1 ^= (uint32_t)(keylen); \
|
|
||||||
MUR_FMIX(_mur_h1); \
|
|
||||||
hashv = _mur_h1; \
|
|
||||||
} while (0)
|
|
||||||
#endif /* HASH_USING_NO_STRICT_ALIASING */
|
|
||||||
|
|
||||||
/* iterate over items in a known bucket to find desired item */
|
/* iterate over items in a known bucket to find desired item */
|
||||||
#define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,hashval,out) \
|
#define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,hashval,out) \
|
||||||
do { \
|
do { \
|
||||||
@ -833,7 +750,7 @@ do {
|
|||||||
} \
|
} \
|
||||||
while ((out) != NULL) { \
|
while ((out) != NULL) { \
|
||||||
if ((out)->hh.hashv == (hashval) && (out)->hh.keylen == (keylen_in)) { \
|
if ((out)->hh.hashv == (hashval) && (out)->hh.keylen == (keylen_in)) { \
|
||||||
if (uthash_memcmp((out)->hh.key, keyptr, keylen_in) == 0) { \
|
if (HASH_KEYCMP((out)->hh.key, keyptr, keylen_in) == 0) { \
|
||||||
break; \
|
break; \
|
||||||
} \
|
} \
|
||||||
} \
|
} \
|
||||||
@ -919,12 +836,12 @@ do {
|
|||||||
struct UT_hash_handle *_he_thh, *_he_hh_nxt; \
|
struct UT_hash_handle *_he_thh, *_he_hh_nxt; \
|
||||||
UT_hash_bucket *_he_new_buckets, *_he_newbkt; \
|
UT_hash_bucket *_he_new_buckets, *_he_newbkt; \
|
||||||
_he_new_buckets = (UT_hash_bucket*)uthash_malloc( \
|
_he_new_buckets = (UT_hash_bucket*)uthash_malloc( \
|
||||||
2UL * (tbl)->num_buckets * sizeof(struct UT_hash_bucket)); \
|
sizeof(struct UT_hash_bucket) * (tbl)->num_buckets * 2U); \
|
||||||
if (!_he_new_buckets) { \
|
if (!_he_new_buckets) { \
|
||||||
HASH_RECORD_OOM(oomed); \
|
HASH_RECORD_OOM(oomed); \
|
||||||
} else { \
|
} else { \
|
||||||
uthash_bzero(_he_new_buckets, \
|
uthash_bzero(_he_new_buckets, \
|
||||||
2UL * (tbl)->num_buckets * sizeof(struct UT_hash_bucket)); \
|
sizeof(struct UT_hash_bucket) * (tbl)->num_buckets * 2U); \
|
||||||
(tbl)->ideal_chain_maxlen = \
|
(tbl)->ideal_chain_maxlen = \
|
||||||
((tbl)->num_items >> ((tbl)->log2_num_buckets+1U)) + \
|
((tbl)->num_items >> ((tbl)->log2_num_buckets+1U)) + \
|
||||||
((((tbl)->num_items & (((tbl)->num_buckets*2U)-1U)) != 0U) ? 1U : 0U); \
|
((((tbl)->num_items & (((tbl)->num_buckets*2U)-1U)) != 0U) ? 1U : 0U); \
|
||||||
@ -937,7 +854,9 @@ do {
|
|||||||
_he_newbkt = &(_he_new_buckets[_he_bkt]); \
|
_he_newbkt = &(_he_new_buckets[_he_bkt]); \
|
||||||
if (++(_he_newbkt->count) > (tbl)->ideal_chain_maxlen) { \
|
if (++(_he_newbkt->count) > (tbl)->ideal_chain_maxlen) { \
|
||||||
(tbl)->nonideal_items++; \
|
(tbl)->nonideal_items++; \
|
||||||
_he_newbkt->expand_mult = _he_newbkt->count / (tbl)->ideal_chain_maxlen; \
|
if (_he_newbkt->count > _he_newbkt->expand_mult * (tbl)->ideal_chain_maxlen) { \
|
||||||
|
_he_newbkt->expand_mult++; \
|
||||||
|
} \
|
||||||
} \
|
} \
|
||||||
_he_thh->hh_prev = NULL; \
|
_he_thh->hh_prev = NULL; \
|
||||||
_he_thh->hh_next = _he_newbkt->hh_head; \
|
_he_thh->hh_next = _he_newbkt->hh_head; \
|
||||||
@ -1070,7 +989,7 @@ do {
|
|||||||
_elt = ELMT_FROM_HH((src)->hh_src.tbl, _src_hh); \
|
_elt = ELMT_FROM_HH((src)->hh_src.tbl, _src_hh); \
|
||||||
if (cond(_elt)) { \
|
if (cond(_elt)) { \
|
||||||
IF_HASH_NONFATAL_OOM( int _hs_oomed = 0; ) \
|
IF_HASH_NONFATAL_OOM( int _hs_oomed = 0; ) \
|
||||||
_dst_hh = (UT_hash_handle*)(((char*)_elt) + _dst_hho); \
|
_dst_hh = (UT_hash_handle*)(void*)(((char*)_elt) + _dst_hho); \
|
||||||
_dst_hh->key = _src_hh->key; \
|
_dst_hh->key = _src_hh->key; \
|
||||||
_dst_hh->keylen = _src_hh->keylen; \
|
_dst_hh->keylen = _src_hh->keylen; \
|
||||||
_dst_hh->hashv = _src_hh->hashv; \
|
_dst_hh->hashv = _src_hh->hashv; \
|
||||||
@ -1209,7 +1128,7 @@ typedef struct UT_hash_handle {
|
|||||||
void *next; /* next element in app order */
|
void *next; /* next element in app order */
|
||||||
struct UT_hash_handle *hh_prev; /* previous hh in bucket order */
|
struct UT_hash_handle *hh_prev; /* previous hh in bucket order */
|
||||||
struct UT_hash_handle *hh_next; /* next hh in bucket order */
|
struct UT_hash_handle *hh_next; /* next hh in bucket order */
|
||||||
void *key; /* ptr to enclosing struct's key */
|
const void *key; /* ptr to enclosing struct's key */
|
||||||
unsigned keylen; /* enclosing struct's key len */
|
unsigned keylen; /* enclosing struct's key len */
|
||||||
unsigned hashv; /* result of hash-fcn(key) */
|
unsigned hashv; /* result of hash-fcn(key) */
|
||||||
} UT_hash_handle;
|
} UT_hash_handle;
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user