27 #define UTHASH_VERSION 2.0.2 37 #if !defined(DECLTYPE) && !defined(NO_DECLTYPE) 39 #if _MSC_VER >= 1600 && defined(__cplusplus) 40 #define DECLTYPE(x) (decltype(x)) 44 #elif defined(__BORLANDC__) || defined(__ICCARM__) || defined(__LCC__) || defined(__WATCOMC__) 47 #define DECLTYPE(x) (__typeof(x)) 53 #define DECLTYPE_ASSIGN(dst,src) \ 55 char **_da_dst = (char**)(&(dst)); \ 56 *_da_dst = (char*)(src); \ 59 #define DECLTYPE_ASSIGN(dst,src) \ 61 (dst) = DECLTYPE(dst)(src); \ 67 #if defined(_MSC_VER) && _MSC_VER >= 1600 69 #elif defined(__WATCOMC__) || defined(__MINGW32__) || defined(__CYGWIN__) 75 #elif defined(__GNUC__) && !defined(__VXWORKS__) 83 #define uthash_malloc(sz) malloc(sz) 86 #define uthash_free(ptr,sz) free(ptr) 89 #define uthash_bzero(a,n) memset(a,'\0',n) 92 #define uthash_memcmp(a,b,n) memcmp(a,b,n) 95 #define uthash_strlen(s) strlen(s) 98 #ifndef uthash_noexpand_fyi 99 #define uthash_noexpand_fyi(tbl) 101 #ifndef uthash_expand_fyi 102 #define uthash_expand_fyi(tbl) 105 #ifndef HASH_NONFATAL_OOM 106 #define HASH_NONFATAL_OOM 0 109 #if HASH_NONFATAL_OOM 112 #ifndef uthash_nonfatal_oom 113 #define uthash_nonfatal_oom(obj) do {} while (0) 116 #define HASH_RECORD_OOM(oomed) do { (oomed) = 1; } while (0) 117 #define IF_HASH_NONFATAL_OOM(x) x 123 #define uthash_fatal(msg) exit(-1) 126 #define HASH_RECORD_OOM(oomed) uthash_fatal("out of memory") 127 #define IF_HASH_NONFATAL_OOM(x) 132 #define HASH_INITIAL_NUM_BUCKETS 32U 133 #define HASH_INITIAL_NUM_BUCKETS_LOG2 5U 134 #define HASH_BKT_CAPACITY_THRESH 10U 137 #define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)->hho))) 139 #define HH_FROM_ELMT(tbl,elp) ((UT_hash_handle *)(((char*)(elp)) + ((tbl)->hho))) 141 #define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \ 143 struct UT_hash_handle *_hd_hh_item = (itemptrhh); \ 145 HASH_TO_BKT(_hd_hh_item->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \ 146 (head)->hh.tbl->buckets[_hd_bkt].count++; \ 147 _hd_hh_item->hh_next = NULL; \ 148 _hd_hh_item->hh_prev = NULL; \ 151 #define HASH_VALUE(keyptr,keylen,hashv) \ 153 HASH_FCN(keyptr, keylen, hashv); \ 156 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \ 161 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \ 162 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \ 163 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, out); \ 168 #define HASH_FIND(hh,head,keyptr,keylen,out) \ 170 unsigned _hf_hashv; \ 171 HASH_VALUE(keyptr, keylen, _hf_hashv); \ 172 HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out); \ 176 #define HASH_BLOOM_BITLEN (1UL << HASH_BLOOM) 177 #define HASH_BLOOM_BYTELEN (HASH_BLOOM_BITLEN/8UL) + (((HASH_BLOOM_BITLEN%8UL)!=0UL) ? 1UL : 0UL) 178 #define HASH_BLOOM_MAKE(tbl,oomed) \ 180 (tbl)->bloom_nbits = HASH_BLOOM; \ 181 (tbl)->bloom_bv = (uint8_t*)uthash_malloc(HASH_BLOOM_BYTELEN); \ 182 if (!(tbl)->bloom_bv) { \ 183 HASH_RECORD_OOM(oomed); \ 185 uthash_bzero((tbl)->bloom_bv, HASH_BLOOM_BYTELEN); \ 186 (tbl)->bloom_sig = HASH_BLOOM_SIGNATURE; \ 190 #define HASH_BLOOM_FREE(tbl) \ 192 uthash_free((tbl)->bloom_bv, HASH_BLOOM_BYTELEN); \ 195 #define HASH_BLOOM_BITSET(bv,idx) (bv[(idx)/8U] |= (1U << ((idx)%8U))) 196 #define HASH_BLOOM_BITTEST(bv,idx) (bv[(idx)/8U] & (1U << ((idx)%8U))) 198 #define HASH_BLOOM_ADD(tbl,hashv) \ 199 HASH_BLOOM_BITSET((tbl)->bloom_bv, ((hashv) & (uint32_t)((1UL << (tbl)->bloom_nbits) - 1U))) 201 #define HASH_BLOOM_TEST(tbl,hashv) \ 202 HASH_BLOOM_BITTEST((tbl)->bloom_bv, ((hashv) & (uint32_t)((1UL << (tbl)->bloom_nbits) - 1U))) 205 #define HASH_BLOOM_MAKE(tbl,oomed) 206 #define HASH_BLOOM_FREE(tbl) 207 #define HASH_BLOOM_ADD(tbl,hashv) 208 #define HASH_BLOOM_TEST(tbl,hashv) (1) 209 #define HASH_BLOOM_BYTELEN 0U 212 #define HASH_MAKE_TABLE(hh,head,oomed) \ 214 (head)->hh.tbl = (UT_hash_table*)uthash_malloc(sizeof(UT_hash_table)); \ 215 if (!(head)->hh.tbl) { \ 216 HASH_RECORD_OOM(oomed); \ 218 uthash_bzero((head)->hh.tbl, sizeof(UT_hash_table)); \ 219 (head)->hh.tbl->tail = &((head)->hh); \ 220 (head)->hh.tbl->num_buckets = HASH_INITIAL_NUM_BUCKETS; \ 221 (head)->hh.tbl->log2_num_buckets = HASH_INITIAL_NUM_BUCKETS_LOG2; \ 222 (head)->hh.tbl->hho = (char*)(&(head)->hh) - (char*)(head); \ 223 (head)->hh.tbl->buckets = (UT_hash_bucket*)uthash_malloc( \ 224 HASH_INITIAL_NUM_BUCKETS * sizeof(struct UT_hash_bucket)); \ 225 (head)->hh.tbl->signature = HASH_SIGNATURE; \ 226 if (!(head)->hh.tbl->buckets) { \ 227 HASH_RECORD_OOM(oomed); \ 228 uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ 230 uthash_bzero((head)->hh.tbl->buckets, \ 231 HASH_INITIAL_NUM_BUCKETS * sizeof(struct UT_hash_bucket)); \ 232 HASH_BLOOM_MAKE((head)->hh.tbl, oomed); \ 233 IF_HASH_NONFATAL_OOM( \ 235 uthash_free((head)->hh.tbl->buckets, \ 236 HASH_INITIAL_NUM_BUCKETS*sizeof(struct UT_hash_bucket)); \ 237 uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ 244 #define HASH_REPLACE_BYHASHVALUE_INORDER(hh,head,fieldname,keylen_in,hashval,add,replaced,cmpfcn) \ 247 HASH_FIND_BYHASHVALUE(hh, head, &((add)->fieldname), keylen_in, hashval, replaced); \ 249 HASH_DELETE(hh, head, replaced); \ 251 HASH_ADD_KEYPTR_BYHASHVALUE_INORDER(hh, head, &((add)->fieldname), keylen_in, hashval, add, cmpfcn); \ 254 #define HASH_REPLACE_BYHASHVALUE(hh,head,fieldname,keylen_in,hashval,add,replaced) \ 257 HASH_FIND_BYHASHVALUE(hh, head, &((add)->fieldname), keylen_in, hashval, replaced); \ 259 HASH_DELETE(hh, head, replaced); \ 261 HASH_ADD_KEYPTR_BYHASHVALUE(hh, head, &((add)->fieldname), keylen_in, hashval, add); \ 264 #define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced) \ 266 unsigned _hr_hashv; \ 267 HASH_VALUE(&((add)->fieldname), keylen_in, _hr_hashv); \ 268 HASH_REPLACE_BYHASHVALUE(hh, head, fieldname, keylen_in, _hr_hashv, add, replaced); \ 271 #define HASH_REPLACE_INORDER(hh,head,fieldname,keylen_in,add,replaced,cmpfcn) \ 273 unsigned _hr_hashv; \ 274 HASH_VALUE(&((add)->fieldname), keylen_in, _hr_hashv); \ 275 HASH_REPLACE_BYHASHVALUE_INORDER(hh, head, fieldname, keylen_in, _hr_hashv, add, replaced, cmpfcn); \ 278 #define HASH_APPEND_LIST(hh, head, add) \ 280 (add)->hh.next = NULL; \ 281 (add)->hh.prev = ELMT_FROM_HH((head)->hh.tbl, (head)->hh.tbl->tail); \ 282 (head)->hh.tbl->tail->next = (add); \ 283 (head)->hh.tbl->tail = &((add)->hh); \ 286 #define HASH_AKBI_INNER_LOOP(hh,head,add,cmpfcn) \ 289 if (cmpfcn(DECLTYPE(head)(_hs_iter), add) > 0) { \ 292 } while ((_hs_iter = HH_FROM_ELMT((head)->hh.tbl, _hs_iter)->next)); \ 296 #undef HASH_AKBI_INNER_LOOP 297 #define HASH_AKBI_INNER_LOOP(hh,head,add,cmpfcn) \ 299 char *_hs_saved_head = (char*)(head); \ 301 DECLTYPE_ASSIGN(head, _hs_iter); \ 302 if (cmpfcn(head, add) > 0) { \ 303 DECLTYPE_ASSIGN(head, _hs_saved_head); \ 306 DECLTYPE_ASSIGN(head, _hs_saved_head); \ 307 } while ((_hs_iter = HH_FROM_ELMT((head)->hh.tbl, _hs_iter)->next)); \ 311 #if HASH_NONFATAL_OOM 313 #define HASH_ADD_TO_TABLE(hh,head,keyptr,keylen_in,hashval,add,oomed) \ 317 (head)->hh.tbl->num_items++; \ 318 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _ha_bkt); \ 319 HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt], hh, &(add)->hh, oomed); \ 321 HASH_ROLLBACK_BKT(hh, head, &(add)->hh); \ 322 HASH_DELETE_HH(hh, head, &(add)->hh); \ 323 (add)->hh.tbl = NULL; \ 324 uthash_nonfatal_oom(add); \ 326 HASH_BLOOM_ADD((head)->hh.tbl, hashval); \ 327 HASH_EMIT_KEY(hh, head, keyptr, keylen_in); \ 330 (add)->hh.tbl = NULL; \ 331 uthash_nonfatal_oom(add); \ 337 #define HASH_ADD_TO_TABLE(hh,head,keyptr,keylen_in,hashval,add,oomed) \ 340 (head)->hh.tbl->num_items++; \ 341 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _ha_bkt); \ 342 HASH_ADD_TO_BKT((head)->hh.tbl->buckets[_ha_bkt], hh, &(add)->hh, oomed); \ 343 HASH_BLOOM_ADD((head)->hh.tbl, hashval); \ 344 HASH_EMIT_KEY(hh, head, keyptr, keylen_in); \ 350 #define HASH_ADD_KEYPTR_BYHASHVALUE_INORDER(hh,head,keyptr,keylen_in,hashval,add,cmpfcn) \ 352 IF_HASH_NONFATAL_OOM( int _ha_oomed = 0; ) \ 353 (add)->hh.hashv = (hashval); \ 354 (add)->hh.key = (char*) (keyptr); \ 355 (add)->hh.keylen = (unsigned) (keylen_in); \ 357 (add)->hh.next = NULL; \ 358 (add)->hh.prev = NULL; \ 359 HASH_MAKE_TABLE(hh, add, _ha_oomed); \ 360 IF_HASH_NONFATAL_OOM( if (!_ha_oomed) { ) \ 362 IF_HASH_NONFATAL_OOM( } ) \ 364 void *_hs_iter = (head); \ 365 (add)->hh.tbl = (head)->hh.tbl; \ 366 HASH_AKBI_INNER_LOOP(hh, head, add, cmpfcn); \ 368 (add)->hh.next = _hs_iter; \ 369 if (((add)->hh.prev = HH_FROM_ELMT((head)->hh.tbl, _hs_iter)->prev)) { \ 370 HH_FROM_ELMT((head)->hh.tbl, (add)->hh.prev)->next = (add); \ 374 HH_FROM_ELMT((head)->hh.tbl, _hs_iter)->prev = (add); \ 376 HASH_APPEND_LIST(hh, head, add); \ 379 HASH_ADD_TO_TABLE(hh, head, keyptr, keylen_in, hashval, add, _ha_oomed); \ 380 HASH_FSCK(hh, head, "HASH_ADD_KEYPTR_BYHASHVALUE_INORDER"); \ 383 #define HASH_ADD_KEYPTR_INORDER(hh,head,keyptr,keylen_in,add,cmpfcn) \ 385 unsigned _hs_hashv; \ 386 HASH_VALUE(keyptr, keylen_in, _hs_hashv); \ 387 HASH_ADD_KEYPTR_BYHASHVALUE_INORDER(hh, head, keyptr, keylen_in, _hs_hashv, add, cmpfcn); \ 390 #define HASH_ADD_BYHASHVALUE_INORDER(hh,head,fieldname,keylen_in,hashval,add,cmpfcn) \ 391 HASH_ADD_KEYPTR_BYHASHVALUE_INORDER(hh, head, &((add)->fieldname), keylen_in, hashval, add, cmpfcn) 393 #define HASH_ADD_INORDER(hh,head,fieldname,keylen_in,add,cmpfcn) \ 394 HASH_ADD_KEYPTR_INORDER(hh, head, &((add)->fieldname), keylen_in, add, cmpfcn) 396 #define HASH_ADD_KEYPTR_BYHASHVALUE(hh,head,keyptr,keylen_in,hashval,add) \ 398 IF_HASH_NONFATAL_OOM( int _ha_oomed = 0; ) \ 399 (add)->hh.hashv = (hashval); \ 400 (add)->hh.key = (char*) (keyptr); \ 401 (add)->hh.keylen = (unsigned) (keylen_in); \ 403 (add)->hh.next = NULL; \ 404 (add)->hh.prev = NULL; \ 405 HASH_MAKE_TABLE(hh, add, _ha_oomed); \ 406 IF_HASH_NONFATAL_OOM( if (!_ha_oomed) { ) \ 408 IF_HASH_NONFATAL_OOM( } ) \ 410 (add)->hh.tbl = (head)->hh.tbl; \ 411 HASH_APPEND_LIST(hh, head, add); \ 413 HASH_ADD_TO_TABLE(hh, head, keyptr, keylen_in, hashval, add, _ha_oomed); \ 414 HASH_FSCK(hh, head, "HASH_ADD_KEYPTR_BYHASHVALUE"); \ 417 #define HASH_ADD_KEYPTR(hh,head,keyptr,keylen_in,add) \ 419 unsigned _ha_hashv; \ 420 HASH_VALUE(keyptr, keylen_in, _ha_hashv); \ 421 HASH_ADD_KEYPTR_BYHASHVALUE(hh, head, keyptr, keylen_in, _ha_hashv, add); \ 424 #define HASH_ADD_BYHASHVALUE(hh,head,fieldname,keylen_in,hashval,add) \ 425 HASH_ADD_KEYPTR_BYHASHVALUE(hh, head, &((add)->fieldname), keylen_in, hashval, add) 427 #define HASH_ADD(hh,head,fieldname,keylen_in,add) \ 428 HASH_ADD_KEYPTR(hh, head, &((add)->fieldname), keylen_in, add) 430 #define HASH_TO_BKT(hashv,num_bkts,bkt) \ 432 bkt = ((hashv) & ((num_bkts) - 1U)); \ 447 #define HASH_DELETE(hh,head,delptr) \ 448 HASH_DELETE_HH(hh, head, &(delptr)->hh) 450 #define HASH_DELETE_HH(hh,head,delptrhh) \ 452 struct UT_hash_handle *_hd_hh_del = (delptrhh); \ 453 if ((_hd_hh_del->prev == NULL) && (_hd_hh_del->next == NULL)) { \ 454 HASH_BLOOM_FREE((head)->hh.tbl); \ 455 uthash_free((head)->hh.tbl->buckets, \ 456 (head)->hh.tbl->num_buckets * sizeof(struct UT_hash_bucket)); \ 457 uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ 461 if (_hd_hh_del == (head)->hh.tbl->tail) { \ 462 (head)->hh.tbl->tail = HH_FROM_ELMT((head)->hh.tbl, _hd_hh_del->prev); \ 464 if (_hd_hh_del->prev != NULL) { \ 465 HH_FROM_ELMT((head)->hh.tbl, _hd_hh_del->prev)->next = _hd_hh_del->next; \ 467 DECLTYPE_ASSIGN(head, _hd_hh_del->next); \ 469 if (_hd_hh_del->next != NULL) { \ 470 HH_FROM_ELMT((head)->hh.tbl, _hd_hh_del->next)->prev = _hd_hh_del->prev; \ 472 HASH_TO_BKT(_hd_hh_del->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \ 473 HASH_DEL_IN_BKT((head)->hh.tbl->buckets[_hd_bkt], _hd_hh_del); \ 474 (head)->hh.tbl->num_items--; \ 476 HASH_FSCK(hh, head, "HASH_DELETE_HH"); \ 480 #define HASH_FIND_STR(head,findstr,out) \ 481 HASH_FIND(hh,head,findstr,(unsigned)uthash_strlen(findstr),out) 482 #define HASH_ADD_STR(head,strfield,add) \ 483 HASH_ADD(hh,head,strfield[0],(unsigned)uthash_strlen(add->strfield),add) 484 #define HASH_REPLACE_STR(head,strfield,add,replaced) \ 485 HASH_REPLACE(hh,head,strfield[0],(unsigned)uthash_strlen(add->strfield),add,replaced) 486 #define HASH_FIND_INT(head,findint,out) \ 487 HASH_FIND(hh,head,findint,sizeof(int),out) 488 #define HASH_ADD_INT(head,intfield,add) \ 489 HASH_ADD(hh,head,intfield,sizeof(int),add) 490 #define HASH_REPLACE_INT(head,intfield,add,replaced) \ 491 HASH_REPLACE(hh,head,intfield,sizeof(int),add,replaced) 492 #define HASH_FIND_PTR(head,findptr,out) \ 493 HASH_FIND(hh,head,findptr,sizeof(void *),out) 494 #define HASH_ADD_PTR(head,ptrfield,add) \ 495 HASH_ADD(hh,head,ptrfield,sizeof(void *),add) 496 #define HASH_REPLACE_PTR(head,ptrfield,add,replaced) \ 497 HASH_REPLACE(hh,head,ptrfield,sizeof(void *),add,replaced) 498 #define HASH_DEL(head,delptr) \ 499 HASH_DELETE(hh,head,delptr) 505 #define HASH_OOPS(...) do { fprintf(stderr,__VA_ARGS__); exit(-1); } while (0) 506 #define HASH_FSCK(hh,head,where) \ 508 struct UT_hash_handle *_thh; \ 511 unsigned _count = 0; \ 513 for (_bkt_i = 0; _bkt_i < (head)->hh.tbl->num_buckets; ++_bkt_i) { \ 514 unsigned _bkt_count = 0; \ 515 _thh = (head)->hh.tbl->buckets[_bkt_i].hh_head; \ 518 if (_prev != (char*)(_thh->hh_prev)) { \ 519 HASH_OOPS("%s: invalid hh_prev %p, actual %p\n", \ 520 (where), (void*)_thh->hh_prev, (void*)_prev); \ 523 _prev = (char*)(_thh); \ 524 _thh = _thh->hh_next; \ 526 _count += _bkt_count; \ 527 if ((head)->hh.tbl->buckets[_bkt_i].count != _bkt_count) { \ 528 HASH_OOPS("%s: invalid bucket count %u, actual %u\n", \ 529 (where), (head)->hh.tbl->buckets[_bkt_i].count, _bkt_count); \ 532 if (_count != (head)->hh.tbl->num_items) { \ 533 HASH_OOPS("%s: invalid hh item count %u, actual %u\n", \ 534 (where), (head)->hh.tbl->num_items, _count); \ 538 _thh = &(head)->hh; \ 541 if (_prev != (char*)_thh->prev) { \ 542 HASH_OOPS("%s: invalid prev %p, actual %p\n", \ 543 (where), (void*)_thh->prev, (void*)_prev); \ 545 _prev = (char*)ELMT_FROM_HH((head)->hh.tbl, _thh); \ 546 _thh = (_thh->next ? HH_FROM_ELMT((head)->hh.tbl, _thh->next) : NULL); \ 548 if (_count != (head)->hh.tbl->num_items) { \ 549 HASH_OOPS("%s: invalid app item count %u, actual %u\n", \ 550 (where), (head)->hh.tbl->num_items, _count); \ 555 #define HASH_FSCK(hh,head,where) 561 #ifdef HASH_EMIT_KEYS 562 #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) \ 564 unsigned _klen = fieldlen; \ 565 write(HASH_EMIT_KEYS, &_klen, sizeof(_klen)); \ 566 write(HASH_EMIT_KEYS, keyptr, (unsigned long)fieldlen); \ 569 #define HASH_EMIT_KEY(hh,head,keyptr,fieldlen) 574 #define HASH_FCN HASH_FUNCTION 576 #define HASH_FCN HASH_JEN 580 #define HASH_BER(key,keylen,hashv) \ 582 unsigned _hb_keylen = (unsigned)keylen; \ 583 const unsigned char *_hb_key = (const unsigned char*)(key); \ 585 while (_hb_keylen-- != 0U) { \ 586 (hashv) = (((hashv) << 5) + (hashv)) + *_hb_key++; \ 593 #define HASH_SAX(key,keylen,hashv) \ 596 const unsigned char *_hs_key = (const unsigned char*)(key); \ 598 for (_sx_i=0; _sx_i < keylen; _sx_i++) { \ 599 hashv ^= (hashv << 5) + (hashv >> 2) + _hs_key[_sx_i]; \ 603 #define HASH_FNV(key,keylen,hashv) \ 606 const unsigned char *_hf_key = (const unsigned char*)(key); \ 607 (hashv) = 2166136261U; \ 608 for (_fn_i=0; _fn_i < keylen; _fn_i++) { \ 609 hashv = hashv ^ _hf_key[_fn_i]; \ 610 hashv = hashv * 16777619U; \ 614 #define HASH_OAT(key,keylen,hashv) \ 617 const unsigned char *_ho_key=(const unsigned char*)(key); \ 619 for(_ho_i=0; _ho_i < keylen; _ho_i++) { \ 620 hashv += _ho_key[_ho_i]; \ 621 hashv += (hashv << 10); \ 622 hashv ^= (hashv >> 6); \ 624 hashv += (hashv << 3); \ 625 hashv ^= (hashv >> 11); \ 626 hashv += (hashv << 15); \ 629 #define HASH_JEN_MIX(a,b,c) \ 631 a -= b; a -= c; a ^= ( c >> 13 ); \ 632 b -= c; b -= a; b ^= ( a << 8 ); \ 633 c -= a; c -= b; c ^= ( b >> 13 ); \ 634 a -= b; a -= c; a ^= ( c >> 12 ); \ 635 b -= c; b -= a; b ^= ( a << 16 ); \ 636 c -= a; c -= b; c ^= ( b >> 5 ); \ 637 a -= b; a -= c; a ^= ( c >> 3 ); \ 638 b -= c; b -= a; b ^= ( a << 10 ); \ 639 c -= a; c -= b; c ^= ( b >> 15 ); \ 642 #define HASH_JEN(key,keylen,hashv) \ 644 unsigned _hj_i,_hj_j,_hj_k; \ 645 unsigned const char *_hj_key=(unsigned const char*)(key); \ 646 hashv = 0xfeedbeefu; \ 647 _hj_i = _hj_j = 0x9e3779b9u; \ 648 _hj_k = (unsigned)(keylen); \ 649 while (_hj_k >= 12U) { \ 650 _hj_i += (_hj_key[0] + ( (unsigned)_hj_key[1] << 8 ) \ 651 + ( (unsigned)_hj_key[2] << 16 ) \ 652 + ( (unsigned)_hj_key[3] << 24 ) ); \ 653 _hj_j += (_hj_key[4] + ( (unsigned)_hj_key[5] << 8 ) \ 654 + ( (unsigned)_hj_key[6] << 16 ) \ 655 + ( (unsigned)_hj_key[7] << 24 ) ); \ 656 hashv += (_hj_key[8] + ( (unsigned)_hj_key[9] << 8 ) \ 657 + ( (unsigned)_hj_key[10] << 16 ) \ 658 + ( (unsigned)_hj_key[11] << 24 ) ); \ 660 HASH_JEN_MIX(_hj_i, _hj_j, hashv); \ 665 hashv += (unsigned)(keylen); \ 667 case 11: hashv += ( (unsigned)_hj_key[10] << 24 ); \ 668 case 10: hashv += ( (unsigned)_hj_key[9] << 16 ); \ 669 case 9: hashv += ( (unsigned)_hj_key[8] << 8 ); \ 670 case 8: _hj_j += ( (unsigned)_hj_key[7] << 24 ); \ 671 case 7: _hj_j += ( (unsigned)_hj_key[6] << 16 ); \ 672 case 6: _hj_j += ( (unsigned)_hj_key[5] << 8 ); \ 673 case 5: _hj_j += _hj_key[4]; \ 674 case 4: _hj_i += ( (unsigned)_hj_key[3] << 24 ); \ 675 case 3: _hj_i += ( (unsigned)_hj_key[2] << 16 ); \ 676 case 2: _hj_i += ( (unsigned)_hj_key[1] << 8 ); \ 677 case 1: _hj_i += _hj_key[0]; \ 681 HASH_JEN_MIX(_hj_i, _hj_j, hashv); \ 686 #if (defined(__GNUC__) && defined(__i386__)) || defined(__WATCOMC__) \ 687 || defined(_MSC_VER) || defined (__BORLANDC__) || defined (__TURBOC__) 688 #define get16bits(d) (*((const uint16_t *) (d))) 691 #if !defined (get16bits) 692 #define get16bits(d) ((((uint32_t)(((const uint8_t *)(d))[1])) << 8) \ 693 +(uint32_t)(((const uint8_t *)(d))[0]) ) 695 #define HASH_SFH(key,keylen,hashv) \ 697 unsigned const char *_sfh_key=(unsigned const char*)(key); \ 698 uint32_t _sfh_tmp, _sfh_len = (uint32_t)keylen; \ 700 unsigned _sfh_rem = _sfh_len & 3U; \ 702 hashv = 0xcafebabeu; \ 705 for (;_sfh_len > 0U; _sfh_len--) { \ 706 hashv += get16bits (_sfh_key); \ 707 _sfh_tmp = ((uint32_t)(get16bits (_sfh_key+2)) << 11) ^ hashv; \ 708 hashv = (hashv << 16) ^ _sfh_tmp; \ 709 _sfh_key += 2U*sizeof (uint16_t); \ 710 hashv += hashv >> 11; \ 714 switch (_sfh_rem) { \ 715 case 3: hashv += get16bits (_sfh_key); \ 716 hashv ^= hashv << 16; \ 717 hashv ^= (uint32_t)(_sfh_key[sizeof (uint16_t)]) << 18; \ 718 hashv += hashv >> 11; \ 720 case 2: hashv += get16bits (_sfh_key); \ 721 hashv ^= hashv << 11; \ 722 hashv += hashv >> 17; \ 724 case 1: hashv += *_sfh_key; \ 725 hashv ^= hashv << 10; \ 726 hashv += hashv >> 1; \ 730 hashv ^= hashv << 3; \ 731 hashv += hashv >> 5; \ 732 hashv ^= hashv << 4; \ 733 hashv += hashv >> 17; \ 734 hashv ^= hashv << 25; \ 735 hashv += hashv >> 6; \ 738 #ifdef HASH_USING_NO_STRICT_ALIASING 748 #if (defined(__i386__) || defined(__x86_64__) || defined(_M_IX86)) 749 #define MUR_GETBLOCK(p,i) p[i] 751 #define MUR_PLUS0_ALIGNED(p) (((unsigned long)p & 3UL) == 0UL) 752 #define MUR_PLUS1_ALIGNED(p) (((unsigned long)p & 3UL) == 1UL) 753 #define MUR_PLUS2_ALIGNED(p) (((unsigned long)p & 3UL) == 2UL) 754 #define MUR_PLUS3_ALIGNED(p) (((unsigned long)p & 3UL) == 3UL) 755 #define WP(p) ((uint32_t*)((unsigned long)(p) & ~3UL)) 756 #if (defined(__BIG_ENDIAN__) || defined(SPARC) || defined(__ppc__) || defined(__ppc64__)) 757 #define MUR_THREE_ONE(p) ((((*WP(p))&0x00ffffff) << 8) | (((*(WP(p)+1))&0xff000000) >> 24)) 758 #define MUR_TWO_TWO(p) ((((*WP(p))&0x0000ffff) <<16) | (((*(WP(p)+1))&0xffff0000) >> 16)) 759 #define MUR_ONE_THREE(p) ((((*WP(p))&0x000000ff) <<24) | (((*(WP(p)+1))&0xffffff00) >> 8)) 761 #define MUR_THREE_ONE(p) ((((*WP(p))&0xffffff00) >> 8) | (((*(WP(p)+1))&0x000000ff) << 24)) 762 #define MUR_TWO_TWO(p) ((((*WP(p))&0xffff0000) >>16) | (((*(WP(p)+1))&0x0000ffff) << 16)) 763 #define MUR_ONE_THREE(p) ((((*WP(p))&0xff000000) >>24) | (((*(WP(p)+1))&0x00ffffff) << 8)) 765 #define MUR_GETBLOCK(p,i) (MUR_PLUS0_ALIGNED(p) ? ((p)[i]) : \ 766 (MUR_PLUS1_ALIGNED(p) ? MUR_THREE_ONE(p) : \ 767 (MUR_PLUS2_ALIGNED(p) ? MUR_TWO_TWO(p) : \ 770 #define MUR_ROTL32(x,r) (((x) << (r)) | ((x) >> (32 - (r)))) 771 #define MUR_FMIX(_h) \ 780 #define HASH_MUR(key,keylen,hashv) \ 782 const uint8_t *_mur_data = (const uint8_t*)(key); \ 783 const int _mur_nblocks = (int)(keylen) / 4; \ 784 uint32_t _mur_h1 = 0xf88D5353u; \ 785 uint32_t _mur_c1 = 0xcc9e2d51u; \ 786 uint32_t _mur_c2 = 0x1b873593u; \ 787 uint32_t _mur_k1 = 0; \ 788 const uint8_t *_mur_tail; \ 789 const uint32_t *_mur_blocks = (const uint32_t*)(_mur_data+(_mur_nblocks*4)); \ 791 for (_mur_i = -_mur_nblocks; _mur_i != 0; _mur_i++) { \ 792 _mur_k1 = MUR_GETBLOCK(_mur_blocks,_mur_i); \ 793 _mur_k1 *= _mur_c1; \ 794 _mur_k1 = MUR_ROTL32(_mur_k1,15); \ 795 _mur_k1 *= _mur_c2; \ 797 _mur_h1 ^= _mur_k1; \ 798 _mur_h1 = MUR_ROTL32(_mur_h1,13); \ 799 _mur_h1 = (_mur_h1*5U) + 0xe6546b64u; \ 801 _mur_tail = (const uint8_t*)(_mur_data + (_mur_nblocks*4)); \ 803 switch ((keylen) & 3U) { \ 805 case 3: _mur_k1 ^= (uint32_t)_mur_tail[2] << 16; \ 806 case 2: _mur_k1 ^= (uint32_t)_mur_tail[1] << 8; \ 807 case 1: _mur_k1 ^= (uint32_t)_mur_tail[0]; \ 808 _mur_k1 *= _mur_c1; \ 809 _mur_k1 = MUR_ROTL32(_mur_k1,15); \ 810 _mur_k1 *= _mur_c2; \ 811 _mur_h1 ^= _mur_k1; \ 813 _mur_h1 ^= (uint32_t)(keylen); \ 820 #define HASH_FIND_IN_BKT(tbl,hh,head,keyptr,keylen_in,hashval,out) \ 822 if ((head).hh_head != NULL) { \ 823 DECLTYPE_ASSIGN(out, ELMT_FROM_HH(tbl, (head).hh_head)); \ 827 while ((out) != NULL) { \ 828 if ((out)->hh.hashv == (hashval) && (out)->hh.keylen == (keylen_in)) { \ 829 if (uthash_memcmp((out)->hh.key, keyptr, keylen_in) == 0) { \ 833 if ((out)->hh.hh_next != NULL) { \ 834 DECLTYPE_ASSIGN(out, ELMT_FROM_HH(tbl, (out)->hh.hh_next)); \ 842 #define HASH_ADD_TO_BKT(head,hh,addhh,oomed) \ 844 UT_hash_bucket *_ha_head = &(head); \ 846 (addhh)->hh_next = _ha_head->hh_head; \ 847 (addhh)->hh_prev = NULL; \ 848 if (_ha_head->hh_head != NULL) { \ 849 _ha_head->hh_head->hh_prev = (addhh); \ 851 _ha_head->hh_head = (addhh); \ 852 if ((_ha_head->count >= ((_ha_head->expand_mult + 1U) * HASH_BKT_CAPACITY_THRESH)) \ 853 && !(addhh)->tbl->noexpand) { \ 854 HASH_EXPAND_BUCKETS(addhh,(addhh)->tbl, oomed); \ 855 IF_HASH_NONFATAL_OOM( \ 857 HASH_DEL_IN_BKT(head,addhh); \ 864 #define HASH_DEL_IN_BKT(head,delhh) \ 866 UT_hash_bucket *_hd_head = &(head); \ 868 if (_hd_head->hh_head == (delhh)) { \ 869 _hd_head->hh_head = (delhh)->hh_next; \ 871 if ((delhh)->hh_prev) { \ 872 (delhh)->hh_prev->hh_next = (delhh)->hh_next; \ 874 if ((delhh)->hh_next) { \ 875 (delhh)->hh_next->hh_prev = (delhh)->hh_prev; \ 908 #define HASH_EXPAND_BUCKETS(hh,tbl,oomed) \ 911 unsigned _he_bkt_i; \ 912 struct UT_hash_handle *_he_thh, *_he_hh_nxt; \ 913 UT_hash_bucket *_he_new_buckets, *_he_newbkt; \ 914 _he_new_buckets = (UT_hash_bucket*)uthash_malloc( \ 915 2UL * (tbl)->num_buckets * sizeof(struct UT_hash_bucket)); \ 916 if (!_he_new_buckets) { \ 917 HASH_RECORD_OOM(oomed); \ 919 uthash_bzero(_he_new_buckets, \ 920 2UL * (tbl)->num_buckets * sizeof(struct UT_hash_bucket)); \ 921 (tbl)->ideal_chain_maxlen = \ 922 ((tbl)->num_items >> ((tbl)->log2_num_buckets+1U)) + \ 923 ((((tbl)->num_items & (((tbl)->num_buckets*2U)-1U)) != 0U) ? 1U : 0U); \ 924 (tbl)->nonideal_items = 0; \ 925 for (_he_bkt_i = 0; _he_bkt_i < (tbl)->num_buckets; _he_bkt_i++) { \ 926 _he_thh = (tbl)->buckets[ _he_bkt_i ].hh_head; \ 927 while (_he_thh != NULL) { \ 928 _he_hh_nxt = _he_thh->hh_next; \ 929 HASH_TO_BKT(_he_thh->hashv, (tbl)->num_buckets * 2U, _he_bkt); \ 930 _he_newbkt = &(_he_new_buckets[_he_bkt]); \ 931 if (++(_he_newbkt->count) > (tbl)->ideal_chain_maxlen) { \ 932 (tbl)->nonideal_items++; \ 933 _he_newbkt->expand_mult = _he_newbkt->count / (tbl)->ideal_chain_maxlen; \ 935 _he_thh->hh_prev = NULL; \ 936 _he_thh->hh_next = _he_newbkt->hh_head; \ 937 if (_he_newbkt->hh_head != NULL) { \ 938 _he_newbkt->hh_head->hh_prev = _he_thh; \ 940 _he_newbkt->hh_head = _he_thh; \ 941 _he_thh = _he_hh_nxt; \ 944 uthash_free((tbl)->buckets, (tbl)->num_buckets * sizeof(struct UT_hash_bucket)); \ 945 (tbl)->num_buckets *= 2U; \ 946 (tbl)->log2_num_buckets++; \ 947 (tbl)->buckets = _he_new_buckets; \ 948 (tbl)->ineff_expands = ((tbl)->nonideal_items > ((tbl)->num_items >> 1)) ? \ 949 ((tbl)->ineff_expands+1U) : 0U; \ 950 if ((tbl)->ineff_expands > 1U) { \ 951 (tbl)->noexpand = 1; \ 952 uthash_noexpand_fyi(tbl); \ 954 uthash_expand_fyi(tbl); \ 962 #define HASH_SORT(head,cmpfcn) HASH_SRT(hh,head,cmpfcn) 963 #define HASH_SRT(hh,head,cmpfcn) \ 966 unsigned _hs_looping,_hs_nmerges,_hs_insize,_hs_psize,_hs_qsize; \ 967 struct UT_hash_handle *_hs_p, *_hs_q, *_hs_e, *_hs_list, *_hs_tail; \ 968 if (head != NULL) { \ 971 _hs_list = &((head)->hh); \ 972 while (_hs_looping != 0U) { \ 977 while (_hs_p != NULL) { \ 981 for (_hs_i = 0; _hs_i < _hs_insize; ++_hs_i) { \ 983 _hs_q = ((_hs_q->next != NULL) ? \ 984 HH_FROM_ELMT((head)->hh.tbl, _hs_q->next) : NULL); \ 985 if (_hs_q == NULL) { \ 989 _hs_qsize = _hs_insize; \ 990 while ((_hs_psize != 0U) || ((_hs_qsize != 0U) && (_hs_q != NULL))) { \ 991 if (_hs_psize == 0U) { \ 993 _hs_q = ((_hs_q->next != NULL) ? \ 994 HH_FROM_ELMT((head)->hh.tbl, _hs_q->next) : NULL); \ 996 } else if ((_hs_qsize == 0U) || (_hs_q == NULL)) { \ 998 if (_hs_p != NULL) { \ 999 _hs_p = ((_hs_p->next != NULL) ? \ 1000 HH_FROM_ELMT((head)->hh.tbl, _hs_p->next) : NULL); \ 1003 } else if ((cmpfcn( \ 1004 DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl, _hs_p)), \ 1005 DECLTYPE(head)(ELMT_FROM_HH((head)->hh.tbl, _hs_q)) \ 1008 if (_hs_p != NULL) { \ 1009 _hs_p = ((_hs_p->next != NULL) ? \ 1010 HH_FROM_ELMT((head)->hh.tbl, _hs_p->next) : NULL); \ 1015 _hs_q = ((_hs_q->next != NULL) ? \ 1016 HH_FROM_ELMT((head)->hh.tbl, _hs_q->next) : NULL); \ 1019 if ( _hs_tail != NULL ) { \ 1020 _hs_tail->next = ((_hs_e != NULL) ? \ 1021 ELMT_FROM_HH((head)->hh.tbl, _hs_e) : NULL); \ 1025 if (_hs_e != NULL) { \ 1026 _hs_e->prev = ((_hs_tail != NULL) ? \ 1027 ELMT_FROM_HH((head)->hh.tbl, _hs_tail) : NULL); \ 1033 if (_hs_tail != NULL) { \ 1034 _hs_tail->next = NULL; \ 1036 if (_hs_nmerges <= 1U) { \ 1038 (head)->hh.tbl->tail = _hs_tail; \ 1039 DECLTYPE_ASSIGN(head, ELMT_FROM_HH((head)->hh.tbl, _hs_list)); \ 1043 HASH_FSCK(hh, head, "HASH_SRT"); \ 1052 #define HASH_SELECT(hh_dst, dst, hh_src, src, cond) \ 1054 unsigned _src_bkt, _dst_bkt; \ 1055 void *_last_elt = NULL, *_elt; \ 1056 UT_hash_handle *_src_hh, *_dst_hh, *_last_elt_hh=NULL; \ 1057 ptrdiff_t _dst_hho = ((char*)(&(dst)->hh_dst) - (char*)(dst)); \ 1058 if ((src) != NULL) { \ 1059 for (_src_bkt=0; _src_bkt < (src)->hh_src.tbl->num_buckets; _src_bkt++) { \ 1060 for (_src_hh = (src)->hh_src.tbl->buckets[_src_bkt].hh_head; \ 1062 _src_hh = _src_hh->hh_next) { \ 1063 _elt = ELMT_FROM_HH((src)->hh_src.tbl, _src_hh); \ 1065 IF_HASH_NONFATAL_OOM( int _hs_oomed = 0; ) \ 1066 _dst_hh = (UT_hash_handle*)(((char*)_elt) + _dst_hho); \ 1067 _dst_hh->key = _src_hh->key; \ 1068 _dst_hh->keylen = _src_hh->keylen; \ 1069 _dst_hh->hashv = _src_hh->hashv; \ 1070 _dst_hh->prev = _last_elt; \ 1071 _dst_hh->next = NULL; \ 1072 if (_last_elt_hh != NULL) { \ 1073 _last_elt_hh->next = _elt; \ 1075 if ((dst) == NULL) { \ 1076 DECLTYPE_ASSIGN(dst, _elt); \ 1077 HASH_MAKE_TABLE(hh_dst, dst, _hs_oomed); \ 1078 IF_HASH_NONFATAL_OOM( \ 1080 uthash_nonfatal_oom(_elt); \ 1086 _dst_hh->tbl = (dst)->hh_dst.tbl; \ 1088 HASH_TO_BKT(_dst_hh->hashv, _dst_hh->tbl->num_buckets, _dst_bkt); \ 1089 HASH_ADD_TO_BKT(_dst_hh->tbl->buckets[_dst_bkt], hh_dst, _dst_hh, _hs_oomed); \ 1090 (dst)->hh_dst.tbl->num_items++; \ 1091 IF_HASH_NONFATAL_OOM( \ 1093 HASH_ROLLBACK_BKT(hh_dst, dst, _dst_hh); \ 1094 HASH_DELETE_HH(hh_dst, dst, _dst_hh); \ 1095 _dst_hh->tbl = NULL; \ 1096 uthash_nonfatal_oom(_elt); \ 1100 HASH_BLOOM_ADD(_dst_hh->tbl, _dst_hh->hashv); \ 1102 _last_elt_hh = _dst_hh; \ 1107 HASH_FSCK(hh_dst, dst, "HASH_SELECT"); \ 1110 #define HASH_CLEAR(hh,head) \ 1112 if ((head) != NULL) { \ 1113 HASH_BLOOM_FREE((head)->hh.tbl); \ 1114 uthash_free((head)->hh.tbl->buckets, \ 1115 (head)->hh.tbl->num_buckets*sizeof(struct UT_hash_bucket)); \ 1116 uthash_free((head)->hh.tbl, sizeof(UT_hash_table)); \ 1121 #define HASH_OVERHEAD(hh,head) \ 1122 (((head) != NULL) ? ( \ 1123 (size_t)(((head)->hh.tbl->num_items * sizeof(UT_hash_handle)) + \ 1124 ((head)->hh.tbl->num_buckets * sizeof(UT_hash_bucket)) + \ 1125 sizeof(UT_hash_table) + \ 1126 (HASH_BLOOM_BYTELEN))) : 0U) 1129 #define HASH_ITER(hh,head,el,tmp) \ 1130 for(((el)=(head)), ((*(char**)(&(tmp)))=(char*)((head!=NULL)?(head)->hh.next:NULL)); \ 1131 (el) != NULL; ((el)=(tmp)), ((*(char**)(&(tmp)))=(char*)((tmp!=NULL)?(tmp)->hh.next:NULL))) 1133 #define HASH_ITER(hh,head,el,tmp) \ 1134 for(((el)=(head)), ((tmp)=DECLTYPE(el)((head!=NULL)?(head)->hh.next:NULL)); \ 1135 (el) != NULL; ((el)=(tmp)), ((tmp)=DECLTYPE(el)((tmp!=NULL)?(tmp)->hh.next:NULL))) 1139 #define HASH_COUNT(head) HASH_CNT(hh,head) 1140 #define HASH_CNT(hh,head) ((head != NULL)?((head)->hh.tbl->num_items):0U) 1163 #define HASH_SIGNATURE 0xa0111fe1u 1164 #define HASH_BLOOM_SIGNATURE 0xb12220f2u struct UT_hash_handle * tail
struct UT_hash_handle * hh_head
struct UT_hash_handle * hh_next
struct UT_hash_bucket UT_hash_bucket
struct UT_hash_table * tbl
struct UT_hash_table UT_hash_table
unsigned ideal_chain_maxlen
struct UT_hash_handle UT_hash_handle
struct UT_hash_handle * hh_prev