ziv@2234: /* ziv@2234: Copyright (c) 2003-2014, Troy D. Hanson http://troydhanson.github.com/uthash/ ziv@2234: All rights reserved. ziv@2234: ziv@2234: Redistribution and use in source and binary forms, with or without ziv@2234: modification, are permitted provided that the following conditions are met: ziv@2234: ziv@2234: * Redistributions of source code must retain the above copyright ziv@2234: notice, this list of conditions and the following disclaimer. ziv@2234: ziv@2234: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS ziv@2234: IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED ziv@2234: TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A ziv@2234: PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER ziv@2234: OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, ziv@2234: EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, ziv@2234: PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR ziv@2234: PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF ziv@2234: LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING ziv@2234: NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS ziv@2234: SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ziv@2234: */ ziv@2234: ziv@2234: #ifndef UTHASH_H ziv@2234: #define UTHASH_H ziv@2234: ziv@2234: #include /* memcmp,strlen */ ziv@2234: #include /* ptrdiff_t */ ziv@2234: #include /* exit() */ ziv@2234: ziv@2234: /* These macros use decltype or the earlier __typeof GNU extension. ziv@2234: As decltype is only available in newer compilers (VS2010 or gcc 4.3+ ziv@2234: when compiling c++ source) this code uses whatever method is needed ziv@2234: or, for VS2008 where neither is available, uses casting workarounds. */ ziv@2234: #if defined(_MSC_VER) /* MS compiler */ ziv@2234: #if _MSC_VER >= 1600 && defined(__cplusplus) /* VS2010 or newer in C++ mode */ ziv@2234: #define DECLTYPE(x) (decltype(x)) ziv@2234: #else /* VS2008 or older (or VS2010 in C mode) */ ziv@2234: #define NO_DECLTYPE ziv@2234: #define DECLTYPE(x) ziv@2234: #endif ziv@2234: #elif defined(__BORLANDC__) || defined(__LCC__) || defined(__WATCOMC__) ziv@2234: #define NO_DECLTYPE ziv@2234: #define DECLTYPE(x) ziv@2234: #else /* GNU, Sun and other compilers */ ziv@2234: #define DECLTYPE(x) (__typeof(x)) ziv@2234: #endif ziv@2234: ziv@2234: #ifdef NO_DECLTYPE ziv@2234: #define DECLTYPE_ASSIGN(dst,src) \ ziv@2234: do { \ ziv@2234: char **_da_dst = (char**)(&(dst)); \ ziv@2234: *_da_dst = (char*)(src); \ ziv@2234: } while(0) ziv@2234: #else ziv@2234: #define DECLTYPE_ASSIGN(dst,src) \ ziv@2234: do { \ ziv@2234: (dst) = DECLTYPE(dst)(src); \ ziv@2234: } while(0) ziv@2234: #endif ziv@2234: ziv@2234: /* a number of the hash function use uint32_t which isn't defined on Pre VS2010 */ ziv@2234: #if defined (_WIN32) ziv@2234: #if defined(_MSC_VER) && _MSC_VER >= 1600 ziv@2234: #include ziv@2234: #elif defined(__WATCOMC__) ziv@2234: #include ziv@2234: #else ziv@2234: typedef unsigned int uint32_t; ziv@2234: typedef unsigned char uint8_t; ziv@2234: #endif ziv@2234: #else ziv@2234: #include ziv@2234: #endif ziv@2234: ziv@2234: #define UTHASH_VERSION 1.9.9 ziv@2234: ziv@2234: #ifndef uthash_fatal ziv@2234: #define uthash_fatal(msg) exit(-1) /* fatal error (out of memory,etc) */ ziv@2234: #endif ziv@2234: #ifndef uthash_malloc ziv@2234: #define uthash_malloc(sz) malloc(sz) /* malloc fcn */ ziv@2234: #endif ziv@2234: #ifndef uthash_free ziv@2234: #define uthash_free(ptr,sz) free(ptr) /* free fcn */ ziv@2234: #endif ziv@2234: ziv@2234: #ifndef uthash_noexpand_fyi ziv@2234: #define uthash_noexpand_fyi(tbl) /* can be defined to log noexpand */ ziv@2234: #endif ziv@2234: #ifndef uthash_expand_fyi ziv@2234: #define uthash_expand_fyi(tbl) /* can be defined to log expands */ ziv@2234: #endif ziv@2234: ziv@2234: /* initial number of buckets */ ziv@2234: #define HASH_INITIAL_NUM_BUCKETS 32U /* initial number of buckets */ ziv@2234: #define HASH_INITIAL_NUM_BUCKETS_LOG2 5U /* lg2 of initial number of buckets */ ziv@2234: #define HASH_BKT_CAPACITY_THRESH 10U /* expand when bucket count reaches */ ziv@2234: ziv@2234: /* calculate the element whose hash handle address is hhe */ ziv@2234: #define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)->hho))) ziv@2234: ziv@2234: #define HASH_FIND(hh,head,keyptr,keylen,out) \ ziv@2234: do { \ ziv@2234: out=NULL; \ ziv@2234: if (head != NULL) { \ ziv@2234: unsigned _hf_bkt,_hf_hashv; \ ziv@2234: HASH_FCN(keyptr,keylen, (head)->hh.tbl->num_buckets, _hf_hashv, _hf_bkt); \ ziv@2234: if (HASH_BLOOM_TEST((head)->hh.tbl, _hf_hashv) != 0) { \ ziv@2234: HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], \ ziv@2234: keyptr,keylen,out); \ ziv@2234: } \ ziv@2234: } \ ziv@2234: } while (0) ziv@2234: ziv@2234: #ifdef HASH_BLOOM ziv@2234: #define HASH_BLOOM_BITLEN (1UL << HASH_BLOOM) ziv@2234: #define HASH_BLOOM_BYTELEN (HASH_BLOOM_BITLEN/8UL) + (((HASH_BLOOM_BITLEN%8UL)!=0UL) ? 1UL : 0UL) ziv@2234: #define HASH_BLOOM_MAKE(tbl) \ ziv@2234: do { \ ziv@2234: (tbl)->bloom_nbits = HASH_BLOOM; \ ziv@2234: (tbl)->bloom_bv = (uint8_t*)uthash_malloc(HASH_BLOOM_BYTELEN); \ ziv@2234: if (!((tbl)->bloom_bv)) { uthash_fatal( "out of memory"); } \ ziv@2234: memset((tbl)->bloom_bv, 0, HASH_BLOOM_BYTELEN); \ ziv@2234: (tbl)->bloom_sig = HASH_BLOOM_SIGNATURE; \ ziv@2234: } while (0) ziv@2234: ziv@2234: #define HASH_BLOOM_FREE(tbl) \ ziv@2234: do { \ ziv@2234: uthash_free((tbl)->bloom_bv, HASH_BLOOM_BYTELEN); \ ziv@2234: } while (0) ziv@2234: ziv@2234: #define HASH_BLOOM_BITSET(bv,idx) (bv[(idx)/8U] |= (1U << ((idx)%8U))) ziv@2234: #define HASH_BLOOM_BITTEST(bv,idx) (bv[(idx)/8U] & (1U << ((idx)%8U))) ziv@2234: ziv@2234: #define HASH_BLOOM_ADD(tbl,hashv) \ ziv@2234: HASH_BLOOM_BITSET((tbl)->bloom_bv, (hashv & (uint32_t)((1ULL << (tbl)->bloom_nbits) - 1U))) ziv@2234: ziv@2234: #define HASH_BLOOM_TEST(tbl,hashv) \ ziv@2234: HASH_BLOOM_BITTEST((tbl)->bloom_bv, (hashv & (uint32_t)((1ULL << (tbl)->bloom_nbits) - 1U))) ziv@2234: ziv@2234: #else ziv@2234: #define HASH_BLOOM_MAKE(tbl) ziv@2234: #define HASH_BLOOM_FREE(tbl) ziv@2234: #define HASH_BLOOM_ADD(tbl,hashv) ziv@2234: #define HASH_BLOOM_TEST(tbl,hashv) (1) ziv@2234: #define HASH_BLOOM_BYTELEN 0U ziv@2234: #endif ziv@2234: ziv@2234: #define HASH_MAKE_TABLE(hh,head) \ ziv@2234: do { \ ziv@2234: (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \ ziv@2234: sizeof(UT_hash_table)); \ ziv@2234: if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \ ziv@2234: memset((head)->hh.tbl, 0, sizeof(UT_hash_table)); \ ziv@2234: (head)->hh.tbl->tail = &((head)->hh); \ ziv@2234: (head)->hh.tbl->num_buckets = HASH_INITIAL_NUM_BUCKETS; \ ziv@2234: (head)->hh.tbl->log2_num_buckets = HASH_INITIAL_NUM_BUCKETS_LOG2; \ ziv@2234: (head)->hh.tbl->hho = (char*)(&(head)->hh) - (char*)(head); \ ziv@2234: (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \ ziv@2234: HASH_INITIAL_NUM_BUCKETS*sizeof(struct UT_hash_bucket)); \ ziv@2234: if (! (head)->hh.tbl->buckets) { uthash_fatal( "out of memory"); } \ ziv@2234: memset((head)->hh.tbl->buckets, 0, \ ziv@2234: HASH_INITIAL_NUM_BUCKETS*sizeof(struct UT_hash_bucket)); \ ziv@2234: HASH_BLOOM_MAKE((head)->hh.tbl); \ ziv@2234: (head)->hh.tbl->signature = HASH_SIGNATURE; \ ziv@2234: } while(0) ziv@2234: ziv@2234: #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ ziv@2234: HASH_ADD_KEYPTR(hh,head,&((add)->fieldname),keylen_in,add) ziv@2234: ziv@2234: #define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced) \ ziv@2234: do { \ ziv@2234: replaced=NULL; \ ziv@2234: HASH_FIND(hh,head,&((add)->fieldname),keylen_in,replaced); \ ziv@2234: if (replaced!=NULL) { \ ziv@2234: HASH_DELETE(hh,head,replaced); \ ziv@2234: } \ ziv@2234: HASH_ADD(hh,head,fieldname,keylen_in,add); \ ziv@2234: } while(0) ziv@2234: ziv@2234: #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ ziv@2234: do { \ ziv@2234: unsigned _ha_bkt; \ ziv@2234: (add)->hh.next = NULL; \ ziv@2234: (add)->hh.key = (char*)(keyptr); \ ziv@2234: (add)->hh.keylen = (unsigned)(keylen_in); \ ziv@2234: if (!(head)) { \ ziv@2234: head = (add); \ ziv@2234: (head)->hh.prev = NULL; \ ziv@2234: HASH_MAKE_TABLE(hh,head); \ ziv@2234: } else { \ ziv@2234: (head)->hh.tbl->tail->next = (add); \ ziv@2234: (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \ ziv@2234: (head)->hh.tbl->tail = &((add)->hh); \ ziv@2234: } \ ziv@2234: (head)->hh.tbl->num_items++; \ ziv@2234: (add)->hh.tbl = (head)->hh.tbl; \ ziv@2234: HASH_FCN(keyptr,keylen_in, (head)->hh.tbl->num_buckets, \ ziv@2234: (add)->hh.hashv, _ha_bkt); \ ziv@2234: HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt],&(add)->hh); \ ziv@2234: HASH_BLOOM_ADD((head)->hh.tbl,(add)->hh.hashv); \ ziv@2234: HASH_EMIT_KEY(hh,head,keyptr,keylen_in); \ ziv@2234: HASH_FSCK(hh,head); \ ziv@2234: } while(0) ziv@2234: ziv@2234: #define HASH_TO_BKT( hashv, num_bkts, bkt ) \ ziv@2234: do { \ ziv@2234: bkt = ((hashv) & ((num_bkts) - 1U)); \ ziv@2234: } while(0) ziv@2234: ziv@2234: /* delete "delptr" from the hash table. ziv@2234: * "the usual" patch-up process for the app-order doubly-linked-list. ziv@2234: * The use of _hd_hh_del below deserves special explanation. ziv@2234: * These used to be expressed using (delptr) but that led to a bug ziv@2234: * if someone used the same symbol for the head and deletee, like ziv@2234: * HASH_DELETE(hh,users,users); ziv@2234: * We want that to work, but by changing the head (users) below ziv@2234: * we were forfeiting our ability to further refer to the deletee (users) ziv@2234: * in the patch-up process. Solution: use scratch space to ziv@2234: * copy the deletee pointer, then the latter references are via that ziv@2234: * scratch pointer rather than through the repointed (users) symbol. ziv@2234: */ ziv@2234: #define HASH_DELETE(hh,head,delptr) \ ziv@2234: do { \ ziv@2234: struct UT_hash_handle *_hd_hh_del; \ ziv@2234: if ( ((delptr)->hh.prev == NULL) && ((delptr)->hh.next == NULL) ) { \ ziv@2234: uthash_free((head)->hh.tbl->buckets, \ ziv@2234: (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket) ); \ ziv@2234: HASH_BLOOM_FREE((head)->hh.tbl); \ ziv@2234: uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ ziv@2234: head = NULL; \ ziv@2234: } else { \ ziv@2234: unsigned _hd_bkt; \ ziv@2234: _hd_hh_del = &((delptr)->hh); \ ziv@2234: if ((delptr) == ELMT_FROM_HH((head)->hh.tbl,(head)->hh.tbl->tail)) { \ ziv@2234: (head)->hh.tbl->tail = \ ziv@2234: (UT_hash_handle*)((ptrdiff_t)((delptr)->hh.prev) + \ ziv@2234: (head)->hh.tbl->hho); \ ziv@2234: } \ ziv@2234: if ((delptr)->hh.prev != NULL) { \ ziv@2234: ((UT_hash_handle*)((ptrdiff_t)((delptr)->hh.prev) + \ ziv@2234: (head)->hh.tbl->hho))->next = (delptr)->hh.next; \ ziv@2234: } else { \ ziv@2234: DECLTYPE_ASSIGN(head,(delptr)->hh.next); \ ziv@2234: } \ ziv@2234: if (_hd_hh_del->next != NULL) { \ ziv@2234: ((UT_hash_handle*)((ptrdiff_t)_hd_hh_del->next + \ ziv@2234: (head)->hh.tbl->hho))->prev = \ ziv@2234: _hd_hh_del->prev; \ ziv@2234: } \ ziv@2234: HASH_TO_BKT( _hd_hh_del->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \ ziv@2234: HASH_DEL_IN_BKT(hh,(head)->hh.tbl->buckets[_hd_bkt], _hd_hh_del); \ ziv@2234: (head)->hh.tbl->num_items--; \ ziv@2234: } \ ziv@2234: HASH_FSCK(hh,head); \ ziv@2234: } while (0) ziv@2234: ziv@2234: ziv@2234: /* convenience forms of HASH_FIND/HASH_ADD/HASH_DEL */ ziv@2234: #define HASH_FIND_STR(head,findstr,out) \ ziv@2234: HASH_FIND(hh,head,findstr,(unsigned)strlen(findstr),out) ziv@2234: #define HASH_ADD_STR(head,strfield,add) \ ziv@2234: HASH_ADD(hh,head,strfield[0],(unsigned int)strlen(add->strfield),add) ziv@2234: #define HASH_REPLACE_STR(head,strfield,add,replaced) \ ziv@2234: HASH_REPLACE(hh,head,strfield[0],(unsigned)strlen(add->strfield),add,replaced) ziv@2234: #define HASH_FIND_INT(head,findint,out) \ ziv@2234: HASH_FIND(hh,head,findint,sizeof(int),out) ziv@2234: #define HASH_ADD_INT(head,intfield,add) \ ziv@2234: HASH_ADD(hh,head,intfield,sizeof(int),add) ziv@2234: #define HASH_REPLACE_INT(head,intfield,add,replaced) \ ziv@2234: HASH_REPLACE(hh,head,intfield,sizeof(int),add,replaced) ziv@2234: #define HASH_FIND_PTR(head,findptr,out) \ ziv@2234: HASH_FIND(hh,head,findptr,sizeof(void *),out) ziv@2234: #define HASH_ADD_PTR(head,ptrfield,add) \ ziv@2234: HASH_ADD(hh,head,ptrfield,sizeof(void *),add) ziv@2234: #define HASH_REPLACE_PTR(head,ptrfield,add,replaced) \ ziv@2234: HASH_REPLACE(hh,head,ptrfield,sizeof(void *),add,replaced) ziv@2234: #define HASH_DEL(head,delptr) \ ziv@2234: HASH_DELETE(hh,head,delptr) ziv@2234: ziv@2234: /* HASH_FSCK checks hash integrity on every add/delete when HASH_DEBUG is defined. ziv@2234: * This is for uthash developer only; it compiles away if HASH_DEBUG isn't defined. ziv@2234: */ ziv@2234: #ifdef HASH_DEBUG ziv@2234: #define HASH_OOPS(...) do { fprintf(stderr,__VA_ARGS__); exit(-1); } while (0) ziv@2234: #define HASH_FSCK(hh,head) \ ziv@2234: do { \ ziv@2234: struct UT_hash_handle *_thh; \ ziv@2234: if (head) { \ ziv@2234: unsigned _bkt_i; \ ziv@2234: unsigned _count; \ ziv@2234: char *_prev; \ ziv@2234: _count = 0; \ ziv@2234: for( _bkt_i = 0; _bkt_i < (head)->hh.tbl->num_buckets; _bkt_i++) { \ ziv@2234: unsigned _bkt_count = 0; \ ziv@2234: _thh = (head)->hh.tbl->buckets[_bkt_i].hh_head; \ ziv@2234: _prev = NULL; \ ziv@2234: while (_thh) { \ ziv@2234: if (_prev != (char*)(_thh->hh_prev)) { \ ziv@2234: HASH_OOPS("invalid hh_prev %p, actual %p\n", \ ziv@2234: _thh->hh_prev, _prev ); \ ziv@2234: } \ ziv@2234: _bkt_count++; \ ziv@2234: _prev = (char*)(_thh); \ ziv@2234: _thh = _thh->hh_next; \ ziv@2234: } \ ziv@2234: _count += _bkt_count; \ ziv@2234: if ((head)->hh.tbl->buckets[_bkt_i].count != _bkt_count) { \ ziv@2234: HASH_OOPS("invalid bucket count %u, actual %u\n", \ ziv@2234: (head)->hh.tbl->buckets[_bkt_i].count, _bkt_count); \ ziv@2234: } \ ziv@2234: } \ ziv@2234: if (_count != (head)->hh.tbl->num_items) { \ ziv@2234: HASH_OOPS("invalid hh item count %u, actual %u\n", \ ziv@2234: (head)->hh.tbl->num_items, _count ); \ ziv@2234: } \ ziv@2234: /* traverse hh in app order; check next/prev integrity, count */ \ ziv@2234: _count = 0; \ ziv@2234: _prev = NULL; \ ziv@2234: _thh = &(head)->hh; \ ziv@2234: while (_thh) { \ ziv@2234: _count++; \ ziv@2234: if (_prev !=(char*)(_thh->prev)) { \ ziv@2234: HASH_OOPS("invalid prev %p, actual %p\n", \ ziv@2234: _thh->prev, _prev ); \ ziv@2234: } \ ziv@2234: _prev = (char*)ELMT_FROM_HH((head)->hh.tbl, _thh); \ ziv@2234: _thh = ( _thh->next ? (UT_hash_handle*)((char*)(_thh->next) + \ ziv@2234: (head)->hh.tbl->hho) : NULL ); \ ziv@2234: } \ ziv@2234: if (_count != (head)->hh.tbl->num_items) { \ ziv@2234: HASH_OOPS("invalid app item count %u, actual %u\n", \ ziv@2234: (head)->hh.tbl->num_items, _count ); \ ziv@2234: } \ ziv@2234: } \ ziv@2234: } while (0) ziv@2234: #else ziv@2234: #define HASH_FSCK(hh,head) ziv@2234: #endif ziv@2234: ziv@2234: /* When compiled with -DHASH_EMIT_KEYS, length-prefixed keys are emitted to ziv@2234: * the descriptor to which this macro is defined for tuning the hash function. ziv@2234: * The app can #include to get the prototype for write(2). */ ziv@2234: #ifdef HASH_EMIT_KEYS ziv@2234: #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) \ ziv@2234: do { \ ziv@2234: unsigned _klen = fieldlen; \ ziv@2234: write(HASH_EMIT_KEYS, &_klen, sizeof(_klen)); \ ziv@2234: write(HASH_EMIT_KEYS, keyptr, (unsigned long)fieldlen); \ ziv@2234: } while (0) ziv@2234: #else ziv@2234: #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) ziv@2234: #endif ziv@2234: ziv@2234: /* default to Jenkin's hash unless overridden e.g. DHASH_FUNCTION=HASH_SAX */ ziv@2234: #ifdef HASH_FUNCTION ziv@2234: #define HASH_FCN HASH_FUNCTION ziv@2234: #else ziv@2234: #define HASH_FCN HASH_JEN ziv@2234: #endif ziv@2234: ziv@2234: /* The Bernstein hash function, used in Perl prior to v5.6. Note (x<<5+x)=x*33. */ ziv@2234: #define HASH_BER(key,keylen,num_bkts,hashv,bkt) \ ziv@2234: do { \ ziv@2234: unsigned _hb_keylen=(unsigned)keylen; \ ziv@2234: const unsigned char *_hb_key=(const unsigned char*)(key); \ ziv@2234: (hashv) = 0; \ ziv@2234: while (_hb_keylen-- != 0U) { \ ziv@2234: (hashv) = (((hashv) << 5) + (hashv)) + *_hb_key++; \ ziv@2234: } \ ziv@2234: bkt = (hashv) & (num_bkts-1U); \ ziv@2234: } while (0) ziv@2234: ziv@2234: ziv@2234: /* SAX/FNV/OAT/JEN hash functions are macro variants of those listed at ziv@2234: * http://eternallyconfuzzled.com/tuts/algorithms/jsw_tut_hashing.aspx */ ziv@2234: #define HASH_SAX(key,keylen,num_bkts,hashv,bkt) \ ziv@2234: do { \ ziv@2234: unsigned _sx_i; \ ziv@2234: const unsigned char *_hs_key=(const unsigned char*)(key); \ ziv@2234: hashv = 0; \ ziv@2234: for(_sx_i=0; _sx_i < keylen; _sx_i++) { \ ziv@2234: hashv ^= (hashv << 5) + (hashv >> 2) + _hs_key[_sx_i]; \ ziv@2234: } \ ziv@2234: bkt = hashv & (num_bkts-1U); \ ziv@2234: } while (0) ziv@2234: /* FNV-1a variation */ ziv@2234: #define HASH_FNV(key,keylen,num_bkts,hashv,bkt) \ ziv@2234: do { \ ziv@2234: unsigned _fn_i; \ ziv@2234: const unsigned char *_hf_key=(const unsigned char*)(key); \ ziv@2234: hashv = 2166136261U; \ ziv@2234: for(_fn_i=0; _fn_i < keylen; _fn_i++) { \ ziv@2234: hashv = hashv ^ _hf_key[_fn_i]; \ ziv@2234: hashv = hashv * 16777619U; \ ziv@2234: } \ ziv@2234: bkt = hashv & (num_bkts-1U); \ ziv@2234: } while(0) ziv@2234: ziv@2234: #define HASH_OAT(key,keylen,num_bkts,hashv,bkt) \ ziv@2234: do { \ ziv@2234: unsigned _ho_i; \ ziv@2234: const unsigned char *_ho_key=(const unsigned char*)(key); \ ziv@2234: hashv = 0; \ ziv@2234: for(_ho_i=0; _ho_i < keylen; _ho_i++) { \ ziv@2234: hashv += _ho_key[_ho_i]; \ ziv@2234: hashv += (hashv << 10); \ ziv@2234: hashv ^= (hashv >> 6); \ ziv@2234: } \ ziv@2234: hashv += (hashv << 3); \ ziv@2234: hashv ^= (hashv >> 11); \ ziv@2234: hashv += (hashv << 15); \ ziv@2234: bkt = hashv & (num_bkts-1U); \ ziv@2234: } while(0) ziv@2234: ziv@2234: #define HASH_JEN_MIX(a,b,c) \ ziv@2234: do { \ ziv@2234: a -= b; a -= c; a ^= ( c >> 13 ); \ ziv@2234: b -= c; b -= a; b ^= ( a << 8 ); \ ziv@2234: c -= a; c -= b; c ^= ( b >> 13 ); \ ziv@2234: a -= b; a -= c; a ^= ( c >> 12 ); \ ziv@2234: b -= c; b -= a; b ^= ( a << 16 ); \ ziv@2234: c -= a; c -= b; c ^= ( b >> 5 ); \ ziv@2234: a -= b; a -= c; a ^= ( c >> 3 ); \ ziv@2234: b -= c; b -= a; b ^= ( a << 10 ); \ ziv@2234: c -= a; c -= b; c ^= ( b >> 15 ); \ ziv@2234: } while (0) ziv@2234: ziv@2234: #define HASH_JEN(key,keylen,num_bkts,hashv,bkt) \ ziv@2234: do { \ ziv@2234: unsigned _hj_i,_hj_j,_hj_k; \ ziv@2234: unsigned const char *_hj_key=(unsigned const char*)(key); \ ziv@2234: hashv = 0xfeedbeefu; \ ziv@2234: _hj_i = _hj_j = 0x9e3779b9u; \ ziv@2234: _hj_k = (unsigned)(keylen); \ ziv@2234: while (_hj_k >= 12U) { \ ziv@2234: _hj_i += (_hj_key[0] + ( (unsigned)_hj_key[1] << 8 ) \ ziv@2234: + ( (unsigned)_hj_key[2] << 16 ) \ ziv@2234: + ( (unsigned)_hj_key[3] << 24 ) ); \ ziv@2234: _hj_j += (_hj_key[4] + ( (unsigned)_hj_key[5] << 8 ) \ ziv@2234: + ( (unsigned)_hj_key[6] << 16 ) \ ziv@2234: + ( (unsigned)_hj_key[7] << 24 ) ); \ ziv@2234: hashv += (_hj_key[8] + ( (unsigned)_hj_key[9] << 8 ) \ ziv@2234: + ( (unsigned)_hj_key[10] << 16 ) \ ziv@2234: + ( (unsigned)_hj_key[11] << 24 ) ); \ ziv@2234: \ ziv@2234: HASH_JEN_MIX(_hj_i, _hj_j, hashv); \ ziv@2234: \ ziv@2234: _hj_key += 12; \ ziv@2234: _hj_k -= 12U; \ ziv@2234: } \ ziv@2234: hashv += (unsigned)(keylen); \ ziv@2234: switch ( _hj_k ) { \ ziv@2234: case 11: hashv += ( (unsigned)_hj_key[10] << 24 ); /* FALLTHROUGH */ \ ziv@2234: case 10: hashv += ( (unsigned)_hj_key[9] << 16 ); /* FALLTHROUGH */ \ ziv@2234: case 9: hashv += ( (unsigned)_hj_key[8] << 8 ); /* FALLTHROUGH */ \ ziv@2234: case 8: _hj_j += ( (unsigned)_hj_key[7] << 24 ); /* FALLTHROUGH */ \ ziv@2234: case 7: _hj_j += ( (unsigned)_hj_key[6] << 16 ); /* FALLTHROUGH */ \ ziv@2234: case 6: _hj_j += ( (unsigned)_hj_key[5] << 8 ); /* FALLTHROUGH */ \ ziv@2234: case 5: _hj_j += _hj_key[4]; /* FALLTHROUGH */ \ ziv@2234: case 4: _hj_i += ( (unsigned)_hj_key[3] << 24 ); /* FALLTHROUGH */ \ ziv@2234: case 3: _hj_i += ( (unsigned)_hj_key[2] << 16 ); /* FALLTHROUGH */ \ ziv@2234: case 2: _hj_i += ( (unsigned)_hj_key[1] << 8 ); /* FALLTHROUGH */ \ ziv@2234: case 1: _hj_i += _hj_key[0]; \ ziv@2234: } \ ziv@2234: HASH_JEN_MIX(_hj_i, _hj_j, hashv); \ ziv@2234: bkt = hashv & (num_bkts-1U); \ ziv@2234: } while(0) ziv@2234: ziv@2234: /* The Paul Hsieh hash function */ ziv@2234: #undef get16bits ziv@2234: #if (defined(__GNUC__) && defined(__i386__)) || defined(__WATCOMC__) \ ziv@2234: || defined(_MSC_VER) || defined (__BORLANDC__) || defined (__TURBOC__) ziv@2234: #define get16bits(d) (*((const uint16_t *) (d))) ziv@2234: #endif ziv@2234: ziv@2234: #if !defined (get16bits) ziv@2234: #define get16bits(d) ((((uint32_t)(((const uint8_t *)(d))[1])) << 8) \ ziv@2234: +(uint32_t)(((const uint8_t *)(d))[0]) ) ziv@2234: #endif ziv@2234: #define HASH_SFH(key,keylen,num_bkts,hashv,bkt) \ ziv@2234: do { \ ziv@2234: unsigned const char *_sfh_key=(unsigned const char*)(key); \ ziv@2234: uint32_t _sfh_tmp, _sfh_len = (uint32_t)keylen; \ ziv@2234: \ ziv@2234: unsigned _sfh_rem = _sfh_len & 3U; \ ziv@2234: _sfh_len >>= 2; \ ziv@2234: hashv = 0xcafebabeu; \ ziv@2234: \ ziv@2234: /* Main loop */ \ ziv@2234: for (;_sfh_len > 0U; _sfh_len--) { \ ziv@2234: hashv += get16bits (_sfh_key); \ ziv@2234: _sfh_tmp = ((uint32_t)(get16bits (_sfh_key+2)) << 11) ^ hashv; \ ziv@2234: hashv = (hashv << 16) ^ _sfh_tmp; \ ziv@2234: _sfh_key += 2U*sizeof (uint16_t); \ ziv@2234: hashv += hashv >> 11; \ ziv@2234: } \ ziv@2234: \ ziv@2234: /* Handle end cases */ \ ziv@2234: switch (_sfh_rem) { \ ziv@2234: case 3: hashv += get16bits (_sfh_key); \ ziv@2234: hashv ^= hashv << 16; \ ziv@2234: hashv ^= (uint32_t)(_sfh_key[sizeof (uint16_t)]) << 18; \ ziv@2234: hashv += hashv >> 11; \ ziv@2234: break; \ ziv@2234: case 2: hashv += get16bits (_sfh_key); \ ziv@2234: hashv ^= hashv << 11; \ ziv@2234: hashv += hashv >> 17; \ ziv@2234: break; \ ziv@2234: case 1: hashv += *_sfh_key; \ ziv@2234: hashv ^= hashv << 10; \ ziv@2234: hashv += hashv >> 1; \ ziv@2234: } \ ziv@2234: \ ziv@2234: /* Force "avalanching" of final 127 bits */ \ ziv@2234: hashv ^= hashv << 3; \ ziv@2234: hashv += hashv >> 5; \ ziv@2234: hashv ^= hashv << 4; \ ziv@2234: hashv += hashv >> 17; \ ziv@2234: hashv ^= hashv << 25; \ ziv@2234: hashv += hashv >> 6; \ ziv@2234: bkt = hashv & (num_bkts-1U); \ ziv@2234: } while(0) ziv@2234: ziv@2234: #ifdef HASH_USING_NO_STRICT_ALIASING ziv@2234: /* The MurmurHash exploits some CPU's (x86,x86_64) tolerance for unaligned reads. ziv@2234: * For other types of CPU's (e.g. Sparc) an unaligned read causes a bus error. ziv@2234: * MurmurHash uses the faster approach only on CPU's where we know it's safe. ziv@2234: * ziv@2234: * Note the preprocessor built-in defines can be emitted using: ziv@2234: * ziv@2234: * gcc -m64 -dM -E - < /dev/null (on gcc) ziv@2234: * cc -## a.c (where a.c is a simple test file) (Sun Studio) ziv@2234: */ ziv@2234: #if (defined(__i386__) || defined(__x86_64__) || defined(_M_IX86)) ziv@2234: #define MUR_GETBLOCK(p,i) p[i] ziv@2234: #else /* non intel */ ziv@2234: #define MUR_PLUS0_ALIGNED(p) (((unsigned long)p & 3UL) == 0UL) ziv@2234: #define MUR_PLUS1_ALIGNED(p) (((unsigned long)p & 3UL) == 1UL) ziv@2234: #define MUR_PLUS2_ALIGNED(p) (((unsigned long)p & 3UL) == 2UL) ziv@2234: #define MUR_PLUS3_ALIGNED(p) (((unsigned long)p & 3UL) == 3UL) ziv@2234: #define WP(p) ((uint32_t*)((unsigned long)(p) & ~3UL)) ziv@2234: #if (defined(__BIG_ENDIAN__) || defined(SPARC) || defined(__ppc__) || defined(__ppc64__)) ziv@2234: #define MUR_THREE_ONE(p) ((((*WP(p))&0x00ffffff) << 8) | (((*(WP(p)+1))&0xff000000) >> 24)) ziv@2234: #define MUR_TWO_TWO(p) ((((*WP(p))&0x0000ffff) <<16) | (((*(WP(p)+1))&0xffff0000) >> 16)) ziv@2234: #define MUR_ONE_THREE(p) ((((*WP(p))&0x000000ff) <<24) | (((*(WP(p)+1))&0xffffff00) >> 8)) ziv@2234: #else /* assume little endian non-intel */ ziv@2234: #define MUR_THREE_ONE(p) ((((*WP(p))&0xffffff00) >> 8) | (((*(WP(p)+1))&0x000000ff) << 24)) ziv@2234: #define MUR_TWO_TWO(p) ((((*WP(p))&0xffff0000) >>16) | (((*(WP(p)+1))&0x0000ffff) << 16)) ziv@2234: #define MUR_ONE_THREE(p) ((((*WP(p))&0xff000000) >>24) | (((*(WP(p)+1))&0x00ffffff) << 8)) ziv@2234: #endif ziv@2234: #define MUR_GETBLOCK(p,i) (MUR_PLUS0_ALIGNED(p) ? ((p)[i]) : \ ziv@2234: (MUR_PLUS1_ALIGNED(p) ? MUR_THREE_ONE(p) : \ ziv@2234: (MUR_PLUS2_ALIGNED(p) ? MUR_TWO_TWO(p) : \ ziv@2234: MUR_ONE_THREE(p)))) ziv@2234: #endif ziv@2234: #define MUR_ROTL32(x,r) (((x) << (r)) | ((x) >> (32 - (r)))) ziv@2234: #define MUR_FMIX(_h) \ ziv@2234: do { \ ziv@2234: _h ^= _h >> 16; \ ziv@2234: _h *= 0x85ebca6bu; \ ziv@2234: _h ^= _h >> 13; \ ziv@2234: _h *= 0xc2b2ae35u; \ ziv@2234: _h ^= _h >> 16; \ ziv@2234: } while(0) ziv@2234: ziv@2234: #define HASH_MUR(key,keylen,num_bkts,hashv,bkt) \ ziv@2234: do { \ ziv@2234: const uint8_t *_mur_data = (const uint8_t*)(key); \ ziv@2234: const int _mur_nblocks = (int)(keylen) / 4; \ ziv@2234: uint32_t _mur_h1 = 0xf88D5353u; \ ziv@2234: uint32_t _mur_c1 = 0xcc9e2d51u; \ ziv@2234: uint32_t _mur_c2 = 0x1b873593u; \ ziv@2234: uint32_t _mur_k1 = 0; \ ziv@2234: const uint8_t *_mur_tail; \ ziv@2234: const uint32_t *_mur_blocks = (const uint32_t*)(_mur_data+(_mur_nblocks*4)); \ ziv@2234: int _mur_i; \ ziv@2234: for(_mur_i = -_mur_nblocks; _mur_i!=0; _mur_i++) { \ ziv@2234: _mur_k1 = MUR_GETBLOCK(_mur_blocks,_mur_i); \ ziv@2234: _mur_k1 *= _mur_c1; \ ziv@2234: _mur_k1 = MUR_ROTL32(_mur_k1,15); \ ziv@2234: _mur_k1 *= _mur_c2; \ ziv@2234: \ ziv@2234: _mur_h1 ^= _mur_k1; \ ziv@2234: _mur_h1 = MUR_ROTL32(_mur_h1,13); \ ziv@2234: _mur_h1 = (_mur_h1*5U) + 0xe6546b64u; \ ziv@2234: } \ ziv@2234: _mur_tail = (const uint8_t*)(_mur_data + (_mur_nblocks*4)); \ ziv@2234: _mur_k1=0; \ ziv@2234: switch((keylen) & 3U) { \ ziv@2234: case 3: _mur_k1 ^= (uint32_t)_mur_tail[2] << 16; /* FALLTHROUGH */ \ ziv@2234: case 2: _mur_k1 ^= (uint32_t)_mur_tail[1] << 8; /* FALLTHROUGH */ \ ziv@2234: case 1: _mur_k1 ^= (uint32_t)_mur_tail[0]; \ ziv@2234: _mur_k1 *= _mur_c1; \ ziv@2234: _mur_k1 = MUR_ROTL32(_mur_k1,15); \ ziv@2234: _mur_k1 *= _mur_c2; \ ziv@2234: _mur_h1 ^= _mur_k1; \ ziv@2234: } \ ziv@2234: _mur_h1 ^= (uint32_t)(keylen); \ ziv@2234: MUR_FMIX(_mur_h1); \ ziv@2234: hashv = _mur_h1; \ ziv@2234: bkt = hashv & (num_bkts-1U); \ ziv@2234: } while(0) ziv@2234: #endif /* HASH_USING_NO_STRICT_ALIASING */ ziv@2234: ziv@2234: /* key comparison function; return 0 if keys equal */ ziv@2234: #define HASH_KEYCMP(a,b,len) memcmp(a,b,(unsigned long)(len)) ziv@2234: ziv@2234: /* iterate over items in a known bucket to find desired item */ ziv@2234: #define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,out) \ ziv@2234: do { \ ziv@2234: if (head.hh_head != NULL) { DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,head.hh_head)); } \ ziv@2234: else { out=NULL; } \ ziv@2234: while (out != NULL) { \ ziv@2234: if ((out)->hh.keylen == (keylen_in)) { \ ziv@2234: if ((HASH_KEYCMP((out)->hh.key,keyptr,keylen_in)) == 0) { break; } \ ziv@2234: } \ ziv@2234: if ((out)->hh.hh_next != NULL) { DECLTYPE_ASSIGN(out,ELMT_FROM_HH(tbl,(out)->hh.hh_next)); } \ ziv@2234: else { out = NULL; } \ ziv@2234: } \ ziv@2234: } while(0) ziv@2234: ziv@2234: /* add an item to a bucket */ ziv@2234: #define HASH_ADD_TO_BKT(head,addhh) \ ziv@2234: do { \ ziv@2234: head.count++; \ ziv@2234: (addhh)->hh_next = head.hh_head; \ ziv@2234: (addhh)->hh_prev = NULL; \ ziv@2234: if (head.hh_head != NULL) { (head).hh_head->hh_prev = (addhh); } \ ziv@2234: (head).hh_head=addhh; \ ziv@2234: if ((head.count >= ((head.expand_mult+1U) * HASH_BKT_CAPACITY_THRESH)) \ ziv@2234: && ((addhh)->tbl->noexpand != 1U)) { \ ziv@2234: HASH_EXPAND_BUCKETS((addhh)->tbl); \ ziv@2234: } \ ziv@2234: } while(0) ziv@2234: ziv@2234: /* remove an item from a given bucket */ ziv@2234: #define HASH_DEL_IN_BKT(hh,head,hh_del) \ ziv@2234: (head).count--; \ ziv@2234: if ((head).hh_head == hh_del) { \ ziv@2234: (head).hh_head = hh_del->hh_next; \ ziv@2234: } \ ziv@2234: if (hh_del->hh_prev) { \ ziv@2234: hh_del->hh_prev->hh_next = hh_del->hh_next; \ ziv@2234: } \ ziv@2234: if (hh_del->hh_next) { \ ziv@2234: hh_del->hh_next->hh_prev = hh_del->hh_prev; \ ziv@2234: } ziv@2234: ziv@2234: /* Bucket expansion has the effect of doubling the number of buckets ziv@2234: * and redistributing the items into the new buckets. Ideally the ziv@2234: * items will distribute more or less evenly into the new buckets ziv@2234: * (the extent to which this is true is a measure of the quality of ziv@2234: * the hash function as it applies to the key domain). ziv@2234: * ziv@2234: * With the items distributed into more buckets, the chain length ziv@2234: * (item count) in each bucket is reduced. Thus by expanding buckets ziv@2234: * the hash keeps a bound on the chain length. This bounded chain ziv@2234: * length is the essence of how a hash provides constant time lookup. ziv@2234: * ziv@2234: * The calculation of tbl->ideal_chain_maxlen below deserves some ziv@2234: * explanation. First, keep in mind that we're calculating the ideal ziv@2234: * maximum chain length based on the *new* (doubled) bucket count. ziv@2234: * In fractions this is just n/b (n=number of items,b=new num buckets). ziv@2234: * Since the ideal chain length is an integer, we want to calculate ziv@2234: * ceil(n/b). We don't depend on floating point arithmetic in this ziv@2234: * hash, so to calculate ceil(n/b) with integers we could write ziv@2234: * ziv@2234: * ceil(n/b) = (n/b) + ((n%b)?1:0) ziv@2234: * ziv@2234: * and in fact a previous version of this hash did just that. ziv@2234: * But now we have improved things a bit by recognizing that b is ziv@2234: * always a power of two. We keep its base 2 log handy (call it lb), ziv@2234: * so now we can write this with a bit shift and logical AND: ziv@2234: * ziv@2234: * ceil(n/b) = (n>>lb) + ( (n & (b-1)) ? 1:0) ziv@2234: * ziv@2234: */ ziv@2234: #define HASH_EXPAND_BUCKETS(tbl) \ ziv@2234: do { \ ziv@2234: unsigned _he_bkt; \ ziv@2234: unsigned _he_bkt_i; \ ziv@2234: struct UT_hash_handle *_he_thh, *_he_hh_nxt; \ ziv@2234: UT_hash_bucket *_he_new_buckets, *_he_newbkt; \ ziv@2234: _he_new_buckets = (UT_hash_bucket*)uthash_malloc( \ ziv@2234: 2UL * tbl->num_buckets * sizeof(struct UT_hash_bucket)); \ ziv@2234: if (!_he_new_buckets) { uthash_fatal( "out of memory"); } \ ziv@2234: memset(_he_new_buckets, 0, \ ziv@2234: 2UL * tbl->num_buckets * sizeof(struct UT_hash_bucket)); \ ziv@2234: tbl->ideal_chain_maxlen = \ ziv@2234: (tbl->num_items >> (tbl->log2_num_buckets+1U)) + \ ziv@2234: (((tbl->num_items & ((tbl->num_buckets*2U)-1U)) != 0U) ? 1U : 0U); \ ziv@2234: tbl->nonideal_items = 0; \ ziv@2234: for(_he_bkt_i = 0; _he_bkt_i < tbl->num_buckets; _he_bkt_i++) \ ziv@2234: { \ ziv@2234: _he_thh = tbl->buckets[ _he_bkt_i ].hh_head; \ ziv@2234: while (_he_thh != NULL) { \ ziv@2234: _he_hh_nxt = _he_thh->hh_next; \ ziv@2234: HASH_TO_BKT( _he_thh->hashv, tbl->num_buckets*2U, _he_bkt); \ ziv@2234: _he_newbkt = &(_he_new_buckets[ _he_bkt ]); \ ziv@2234: if (++(_he_newbkt->count) > tbl->ideal_chain_maxlen) { \ ziv@2234: tbl->nonideal_items++; \ ziv@2234: _he_newbkt->expand_mult = _he_newbkt->count / \ ziv@2234: tbl->ideal_chain_maxlen; \ ziv@2234: } \ ziv@2234: _he_thh->hh_prev = NULL; \ ziv@2234: _he_thh->hh_next = _he_newbkt->hh_head; \ ziv@2234: if (_he_newbkt->hh_head != NULL) { _he_newbkt->hh_head->hh_prev = \ ziv@2234: _he_thh; } \ ziv@2234: _he_newbkt->hh_head = _he_thh; \ ziv@2234: _he_thh = _he_hh_nxt; \ ziv@2234: } \ ziv@2234: } \ ziv@2234: uthash_free( tbl->buckets, tbl->num_buckets*sizeof(struct UT_hash_bucket) ); \ ziv@2234: tbl->num_buckets *= 2U; \ ziv@2234: tbl->log2_num_buckets++; \ ziv@2234: tbl->buckets = _he_new_buckets; \ ziv@2234: tbl->ineff_expands = (tbl->nonideal_items > (tbl->num_items >> 1)) ? \ ziv@2234: (tbl->ineff_expands+1U) : 0U; \ ziv@2234: if (tbl->ineff_expands > 1U) { \ ziv@2234: tbl->noexpand=1; \ ziv@2234: uthash_noexpand_fyi(tbl); \ ziv@2234: } \ ziv@2234: uthash_expand_fyi(tbl); \ ziv@2234: } while(0) ziv@2234: ziv@2234: ziv@2234: /* This is an adaptation of Simon Tatham's O(n log(n)) mergesort */ ziv@2234: /* Note that HASH_SORT assumes the hash handle name to be hh. ziv@2234: * HASH_SRT was added to allow the hash handle name to be passed in. */ ziv@2234: #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) ziv@2234: #define HASH_SRT(hh,head,cmpfcn) \ ziv@2234: do { \ ziv@2234: unsigned _hs_i; \ ziv@2234: unsigned _hs_looping,_hs_nmerges,_hs_insize,_hs_psize,_hs_qsize; \ ziv@2234: struct UT_hash_handle *_hs_p, *_hs_q, *_hs_e, *_hs_list, *_hs_tail; \ ziv@2234: if (head != NULL) { \ ziv@2234: _hs_insize = 1; \ ziv@2234: _hs_looping = 1; \ ziv@2234: _hs_list = &((head)->hh); \ ziv@2234: while (_hs_looping != 0U) { \ ziv@2234: _hs_p = _hs_list; \ ziv@2234: _hs_list = NULL; \ ziv@2234: _hs_tail = NULL; \ ziv@2234: _hs_nmerges = 0; \ ziv@2234: while (_hs_p != NULL) { \ ziv@2234: _hs_nmerges++; \ ziv@2234: _hs_q = _hs_p; \ ziv@2234: _hs_psize = 0; \ ziv@2234: for ( _hs_i = 0; _hs_i < _hs_insize; _hs_i++ ) { \ ziv@2234: _hs_psize++; \ ziv@2234: _hs_q = (UT_hash_handle*)((_hs_q->next != NULL) ? \ ziv@2234: ((void*)((char*)(_hs_q->next) + \ ziv@2234: (head)->hh.tbl->hho)) : NULL); \ ziv@2234: if (! (_hs_q) ) { break; } \ ziv@2234: } \ ziv@2234: _hs_qsize = _hs_insize; \ ziv@2234: while ((_hs_psize > 0U) || ((_hs_qsize > 0U) && (_hs_q != NULL))) {\ ziv@2234: if (_hs_psize == 0U) { \ ziv@2234: _hs_e = _hs_q; \ ziv@2234: _hs_q = (UT_hash_handle*)((_hs_q->next != NULL) ? \ ziv@2234: ((void*)((char*)(_hs_q->next) + \ ziv@2234: (head)->hh.tbl->hho)) : NULL); \ ziv@2234: _hs_qsize--; \ ziv@2234: } else if ( (_hs_qsize == 0U) || (_hs_q == NULL) ) { \ ziv@2234: _hs_e = _hs_p; \ ziv@2234: if (_hs_p != NULL){ \ ziv@2234: _hs_p = (UT_hash_handle*)((_hs_p->next != NULL) ? \ ziv@2234: ((void*)((char*)(_hs_p->next) + \ ziv@2234: (head)->hh.tbl->hho)) : NULL); \ ziv@2234: } \ ziv@2234: _hs_psize--; \ ziv@2234: } else if (( \ ziv@2234: cmpfcn(DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_p)), \ ziv@2234: DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl,_hs_q))) \ ziv@2234: ) <= 0) { \ ziv@2234: _hs_e = _hs_p; \ ziv@2234: if (_hs_p != NULL){ \ ziv@2234: _hs_p = (UT_hash_handle*)((_hs_p->next != NULL) ? \ ziv@2234: ((void*)((char*)(_hs_p->next) + \ ziv@2234: (head)->hh.tbl->hho)) : NULL); \ ziv@2234: } \ ziv@2234: _hs_psize--; \ ziv@2234: } else { \ ziv@2234: _hs_e = _hs_q; \ ziv@2234: _hs_q = (UT_hash_handle*)((_hs_q->next != NULL) ? \ ziv@2234: ((void*)((char*)(_hs_q->next) + \ ziv@2234: (head)->hh.tbl->hho)) : NULL); \ ziv@2234: _hs_qsize--; \ ziv@2234: } \ ziv@2234: if ( _hs_tail != NULL ) { \ ziv@2234: _hs_tail->next = ((_hs_e != NULL) ? \ ziv@2234: ELMT_FROM_HH((head)->hh.tbl,_hs_e) : NULL); \ ziv@2234: } else { \ ziv@2234: _hs_list = _hs_e; \ ziv@2234: } \ ziv@2234: if (_hs_e != NULL) { \ ziv@2234: _hs_e->prev = ((_hs_tail != NULL) ? \ ziv@2234: ELMT_FROM_HH((head)->hh.tbl,_hs_tail) : NULL); \ ziv@2234: } \ ziv@2234: _hs_tail = _hs_e; \ ziv@2234: } \ ziv@2234: _hs_p = _hs_q; \ ziv@2234: } \ ziv@2234: if (_hs_tail != NULL){ \ ziv@2234: _hs_tail->next = NULL; \ ziv@2234: } \ ziv@2234: if ( _hs_nmerges <= 1U ) { \ ziv@2234: _hs_looping=0; \ ziv@2234: (head)->hh.tbl->tail = _hs_tail; \ ziv@2234: DECLTYPE_ASSIGN(head,ELMT_FROM_HH((head)->hh.tbl, _hs_list)); \ ziv@2234: } \ ziv@2234: _hs_insize *= 2U; \ ziv@2234: } \ ziv@2234: HASH_FSCK(hh,head); \ ziv@2234: } \ ziv@2234: } while (0) ziv@2234: ziv@2234: /* This function selects items from one hash into another hash. ziv@2234: * The end result is that the selected items have dual presence ziv@2234: * in both hashes. There is no copy of the items made; rather ziv@2234: * they are added into the new hash through a secondary hash ziv@2234: * hash handle that must be present in the structure. */ ziv@2234: #define HASH_SELECT(hh_dst, dst, hh_src, src, cond) \ ziv@2234: do { \ ziv@2234: unsigned _src_bkt, _dst_bkt; \ ziv@2234: void *_last_elt=NULL, *_elt; \ ziv@2234: UT_hash_handle *_src_hh, *_dst_hh, *_last_elt_hh=NULL; \ ziv@2234: ptrdiff_t _dst_hho = ((char*)(&(dst)->hh_dst) - (char*)(dst)); \ ziv@2234: if (src != NULL) { \ ziv@2234: for(_src_bkt=0; _src_bkt < (src)->hh_src.tbl->num_buckets; _src_bkt++) { \ ziv@2234: for(_src_hh = (src)->hh_src.tbl->buckets[_src_bkt].hh_head; \ ziv@2234: _src_hh != NULL; \ ziv@2234: _src_hh = _src_hh->hh_next) { \ ziv@2234: _elt = ELMT_FROM_HH((src)->hh_src.tbl, _src_hh); \ ziv@2234: if (cond(_elt)) { \ ziv@2234: _dst_hh = (UT_hash_handle*)(((char*)_elt) + _dst_hho); \ ziv@2234: _dst_hh->key = _src_hh->key; \ ziv@2234: _dst_hh->keylen = _src_hh->keylen; \ ziv@2234: _dst_hh->hashv = _src_hh->hashv; \ ziv@2234: _dst_hh->prev = _last_elt; \ ziv@2234: _dst_hh->next = NULL; \ ziv@2234: if (_last_elt_hh != NULL) { _last_elt_hh->next = _elt; } \ ziv@2234: if (dst == NULL) { \ ziv@2234: DECLTYPE_ASSIGN(dst,_elt); \ ziv@2234: HASH_MAKE_TABLE(hh_dst,dst); \ ziv@2234: } else { \ ziv@2234: _dst_hh->tbl = (dst)->hh_dst.tbl; \ ziv@2234: } \ ziv@2234: HASH_TO_BKT(_dst_hh->hashv, _dst_hh->tbl->num_buckets, _dst_bkt); \ ziv@2234: HASH_ADD_TO_BKT(_dst_hh->tbl->buckets[_dst_bkt],_dst_hh); \ ziv@2234: (dst)->hh_dst.tbl->num_items++; \ ziv@2234: _last_elt = _elt; \ ziv@2234: _last_elt_hh = _dst_hh; \ ziv@2234: } \ ziv@2234: } \ ziv@2234: } \ ziv@2234: } \ ziv@2234: HASH_FSCK(hh_dst,dst); \ ziv@2234: } while (0) ziv@2234: ziv@2234: #define HASH_CLEAR(hh,head) \ ziv@2234: do { \ ziv@2234: if (head != NULL) { \ ziv@2234: uthash_free((head)->hh.tbl->buckets, \ ziv@2234: (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket)); \ ziv@2234: HASH_BLOOM_FREE((head)->hh.tbl); \ ziv@2234: uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ ziv@2234: (head)=NULL; \ ziv@2234: } \ ziv@2234: } while(0) ziv@2234: ziv@2234: #define HASH_OVERHEAD(hh,head) \ ziv@2234: ((head != NULL) ? ( \ ziv@2234: (size_t)(((head)->hh.tbl->num_items * sizeof(UT_hash_handle)) + \ ziv@2234: ((head)->hh.tbl->num_buckets * sizeof(UT_hash_bucket)) + \ ziv@2234: sizeof(UT_hash_table) + \ ziv@2234: (HASH_BLOOM_BYTELEN))) : 0U) ziv@2234: ziv@2234: #ifdef NO_DECLTYPE ziv@2234: #define HASH_ITER(hh,head,el,tmp) \ ziv@2234: for(((el)=(head)), ((*(char**)(&(tmp)))=(char*)((head!=NULL)?(head)->hh.next:NULL)); \ ziv@2234: (el) != NULL; ((el)=(tmp)), ((*(char**)(&(tmp)))=(char*)((tmp!=NULL)?(tmp)->hh.next:NULL))) ziv@2234: #else ziv@2234: #define HASH_ITER(hh,head,el,tmp) \ ziv@2234: for(((el)=(head)), ((tmp)=DECLTYPE(el)((head!=NULL)?(head)->hh.next:NULL)); \ ziv@2234: (el) != NULL; ((el)=(tmp)), ((tmp)=DECLTYPE(el)((tmp!=NULL)?(tmp)->hh.next:NULL))) ziv@2234: #endif ziv@2234: ziv@2234: /* obtain a count of items in the hash */ ziv@2234: #define HASH_COUNT(head) HASH_CNT(hh,head) ziv@2234: #define HASH_CNT(hh,head) ((head != NULL)?((head)->hh.tbl->num_items):0U) ziv@2234: ziv@2234: typedef struct UT_hash_bucket { ziv@2234: struct UT_hash_handle *hh_head; ziv@2234: unsigned count; ziv@2234: ziv@2234: /* expand_mult is normally set to 0. In this situation, the max chain length ziv@2234: * threshold is enforced at its default value, HASH_BKT_CAPACITY_THRESH. (If ziv@2234: * the bucket's chain exceeds this length, bucket expansion is triggered). ziv@2234: * However, setting expand_mult to a non-zero value delays bucket expansion ziv@2234: * (that would be triggered by additions to this particular bucket) ziv@2234: * until its chain length reaches a *multiple* of HASH_BKT_CAPACITY_THRESH. ziv@2234: * (The multiplier is simply expand_mult+1). The whole idea of this ziv@2234: * multiplier is to reduce bucket expansions, since they are expensive, in ziv@2234: * situations where we know that a particular bucket tends to be overused. ziv@2234: * It is better to let its chain length grow to a longer yet-still-bounded ziv@2234: * value, than to do an O(n) bucket expansion too often. ziv@2234: */ ziv@2234: unsigned expand_mult; ziv@2234: ziv@2234: } UT_hash_bucket; ziv@2234: ziv@2234: /* random signature used only to find hash tables in external analysis */ ziv@2234: #define HASH_SIGNATURE 0xa0111fe1u ziv@2234: #define HASH_BLOOM_SIGNATURE 0xb12220f2u ziv@2234: ziv@2234: typedef struct UT_hash_table { ziv@2234: UT_hash_bucket *buckets; ziv@2234: unsigned num_buckets, log2_num_buckets; ziv@2234: unsigned num_items; ziv@2234: struct UT_hash_handle *tail; /* tail hh in app order, for fast append */ ziv@2234: ptrdiff_t hho; /* hash handle offset (byte pos of hash handle in element */ ziv@2234: ziv@2234: /* in an ideal situation (all buckets used equally), no bucket would have ziv@2234: * more than ceil(#items/#buckets) items. that's the ideal chain length. */ ziv@2234: unsigned ideal_chain_maxlen; ziv@2234: ziv@2234: /* nonideal_items is the number of items in the hash whose chain position ziv@2234: * exceeds the ideal chain maxlen. these items pay the penalty for an uneven ziv@2234: * hash distribution; reaching them in a chain traversal takes >ideal steps */ ziv@2234: unsigned nonideal_items; ziv@2234: ziv@2234: /* ineffective expands occur when a bucket doubling was performed, but ziv@2234: * afterward, more than half the items in the hash had nonideal chain ziv@2234: * positions. If this happens on two consecutive expansions we inhibit any ziv@2234: * further expansion, as it's not helping; this happens when the hash ziv@2234: * function isn't a good fit for the key domain. When expansion is inhibited ziv@2234: * the hash will still work, albeit no longer in constant time. */ ziv@2234: unsigned ineff_expands, noexpand; ziv@2234: ziv@2234: uint32_t signature; /* used only to find hash tables in external analysis */ ziv@2234: #ifdef HASH_BLOOM ziv@2234: uint32_t bloom_sig; /* used only to test bloom exists in external analysis */ ziv@2234: uint8_t *bloom_bv; ziv@2234: uint8_t bloom_nbits; ziv@2234: #endif ziv@2234: ziv@2234: } UT_hash_table; ziv@2234: ziv@2234: typedef struct UT_hash_handle { ziv@2234: struct UT_hash_table *tbl; ziv@2234: void *prev; /* prev element in app order */ ziv@2234: void *next; /* next element in app order */ ziv@2234: struct UT_hash_handle *hh_prev; /* previous hh in bucket order */ ziv@2234: struct UT_hash_handle *hh_next; /* next hh in bucket order */ ziv@2234: void *key; /* ptr to enclosing struct's key */ ziv@2234: unsigned keylen; /* enclosing struct's key len */ ziv@2234: unsigned hashv; /* result of hash-fcn(key) */ ziv@2234: } UT_hash_handle; ziv@2234: ziv@2234: #endif /* UTHASH_H */