/dports/math/igraph/igraph-0.9.5/src/games/degree_sequence_vl/ |
H A D | gengraph_hash.h | 94 #define HASH_KEY(x,size) ((x*2198737)&((size)-1)) macro 101 #define HASH_KEY(x,size) ((x)%(size)) macro 107 inline int HASH_KEY(const int x, const int size) { in HASH_KEY() function 137 return HASH_KEY(x * 1434879443 + y, size); in HASH_PAIR_KEY() 156 int k = HASH_KEY(a, size); in H_add() 172 int k = HASH_KEY(a, size); in H_better() 204 int k = HASH_KEY(a, size); in H_put() 219 int k = HASH_KEY(a, size); in H_find() 273 yo = mem + HASH_KEY(my_random(), size); in H_random()
|
/dports/math/R-cran-igraph/igraph/src/ |
H A D | gengraph_hash.h | 94 #define HASH_KEY(x,size) ((x*2198737)&((size)-1)) macro 101 #define HASH_KEY(x,size) ((x)%(size)) macro 107 inline int HASH_KEY(const int x, const int size) { in HASH_KEY() function 137 return HASH_KEY(x * 1434879443 + y, size); in HASH_PAIR_KEY() 156 int k = HASH_KEY(a, size); in H_add() 172 int k = HASH_KEY(a, size); in H_better() 204 int k = HASH_KEY(a, size); in H_put() 219 int k = HASH_KEY(a, size); in H_find() 273 yo = mem + HASH_KEY(my_random(), size); in H_random()
|
/dports/devel/global/global-6.6.7/htags/ |
H A D | incop.c | 49 #define HASH_KEY(name) strtolower(name) macro 51 #define HASH_KEY(name) (name) macro 79 entry = strhash_assign(head_inc, HASH_KEY(file), 1); in put_inc() 107 struct sh_entry *entry = strhash_assign(head_inc, HASH_KEY(name), 0); in get_inc()
|
/dports/misc/p5-Tie-DxHash/Tie-DxHash-1.05/lib/Tie/ |
H A D | DxHash.pm | 61 HASH_KEY: label 63 next HASH_KEY if $key ne $self->{data}[$offset]{key}; 64 next HASH_KEY if $dup++ != $self->{iterators}{$key}; 103 HASH_KEY: label
|
/dports/net/rdesktop/rdesktop-1.9.0/ |
H A D | pstcache.c | 92 memcpy(cellhdr.key, key, sizeof(HASH_KEY)); in pstcache_save_bitmap() 108 pstcache_enumerate(uint8 id, HASH_KEY * keylist) in pstcache_enumerate() 131 if (memcmp(cellhdr.key, zero_key, sizeof(HASH_KEY)) != 0) in pstcache_enumerate() 133 memcpy(keylist[idx], cellhdr.key, sizeof(HASH_KEY)); in pstcache_enumerate()
|
H A D | types.h | 177 typedef uint8 HASH_KEY[8]; typedef 182 HASH_KEY key;
|
H A D | rdp.c | 674 HASH_KEY keylist[BMPCACHE2_NUM_PSTCELLS]; in rdp_enum_bmpcache2() 686 s = rdp_init_data(24 + count * sizeof(HASH_KEY)); in rdp_enum_bmpcache2() 706 out_uint8a(s, keylist[offset], count * sizeof(HASH_KEY)); in rdp_enum_bmpcache2()
|
/dports/biology/infernal/infernal-1.1.3/hmmer/src/ |
H A D | cachedb.c | 350 #define HASH_KEY 52807 macro 414 ESL_ALLOC(hash, sizeof(char *) * HASH_KEY); in main() 415 memset(hash, 0, sizeof(char *) * HASH_KEY); in main() 446 inx = inx % HASH_KEY; in main() 497 for (inx = 0; inx < HASH_KEY; ++inx) { in main()
|
H A D | cachedb_shard.c | 694 #define HASH_KEY 52807 macro 758 ESL_ALLOC(hash, sizeof(char *) * HASH_KEY); in main() 759 memset(hash, 0, sizeof(char *) * HASH_KEY); in main() 790 inx = inx % HASH_KEY; in main() 841 for (inx = 0; inx < HASH_KEY; ++inx) { in main()
|
/dports/biology/hmmer/hmmer-3.3/src/ |
H A D | cachedb.c | 350 #define HASH_KEY 52807 macro 414 ESL_ALLOC(hash, sizeof(char *) * HASH_KEY); in main() 415 memset(hash, 0, sizeof(char *) * HASH_KEY); in main() 446 inx = inx % HASH_KEY; in main() 497 for (inx = 0; inx < HASH_KEY; ++inx) { in main()
|
H A D | cachedb_shard.c | 694 #define HASH_KEY 52807 macro 758 ESL_ALLOC(hash, sizeof(char *) * HASH_KEY); in main() 759 memset(hash, 0, sizeof(char *) * HASH_KEY); in main() 790 inx = inx % HASH_KEY; in main() 841 for (inx = 0; inx < HASH_KEY; ++inx) { in main()
|
/dports/net/rdesktop/rdesktop-1.9.0/tests/ |
H A D | pstcache_mock.c | 4 int pstcache_enumerate(uint8 id, HASH_KEY * keylist) in pstcache_enumerate()
|
/dports/editors/emacs-devel/emacs-4d1968b/src/ |
H A D | profiler.c | 129 Lisp_Object key = HASH_KEY (log, i); in evict_lower_half() 135 eassert (EQ (Qunbound, HASH_KEY (log, i))); in evict_lower_half() 161 eassert (EQ (Qunbound, HASH_KEY (log, index))); in record_backtrace()
|
H A D | minibuf.c | 1673 && EQ (HASH_KEY (XHASH_TABLE (collection), idx), Qunbound)) 1678 elt = eltstring = HASH_KEY (XHASH_TABLE (collection), idx++); 1904 && EQ (HASH_KEY (XHASH_TABLE (collection), idx), Qunbound)) 1909 elt = eltstring = HASH_KEY (XHASH_TABLE (collection), idx++); 2104 tem = HASH_KEY (h, i); 2110 tem = HASH_KEY (h, i);
|
H A D | category.c | 61 return HASH_KEY (h, i); in hash_get_category_set()
|
H A D | fns.c | 4459 Lisp_Object key = HASH_KEY (h, i); in hash_table_rehash() 4489 if (EQ (key, HASH_KEY (h, i)) in hash_lookup() 4492 && !NILP (h->test.cmpfn (key, HASH_KEY (h, i), h)))) in hash_lookup() 4532 eassert (EQ (Qunbound, (HASH_KEY (h, i)))); in hash_put() 4561 if (EQ (key, HASH_KEY (h, i)) in hash_remove_from_table() 4564 && !NILP (h->test.cmpfn (key, HASH_KEY (h, i), h)))) in hash_remove_from_table() 4638 bool key_known_to_survive_p = survives_gc_p (HASH_KEY (h, i)); in sweep_weak_table() 4692 mark_object (HASH_KEY (h, i)); in sweep_weak_table() 5270 Lisp_Object k = HASH_KEY (h, i);
|
/dports/editors/emacs/emacs-27.2/src/ |
H A D | profiler.c | 129 Lisp_Object key = HASH_KEY (log, i); in evict_lower_half() 135 eassert (EQ (Qunbound, HASH_KEY (log, i))); in evict_lower_half() 161 eassert (EQ (Qunbound, HASH_KEY (log, index))); in record_backtrace()
|
H A D | minibuf.c | 1257 && EQ (HASH_KEY (XHASH_TABLE (collection), idx), Qunbound)) 1262 elt = eltstring = HASH_KEY (XHASH_TABLE (collection), idx++); 1514 && EQ (HASH_KEY (XHASH_TABLE (collection), idx), Qunbound)) 1519 elt = eltstring = HASH_KEY (XHASH_TABLE (collection), idx++); 1735 tem = HASH_KEY (h, i); 1741 tem = HASH_KEY (h, i);
|
H A D | category.c | 61 return HASH_KEY (h, i); in hash_get_category_set()
|
H A D | fns.c | 4275 Lisp_Object key = HASH_KEY (h, i); in hash_table_rehash() 4321 if (EQ (key, HASH_KEY (h, i)) in hash_lookup() 4324 && !NILP (h->test.cmpfn (key, HASH_KEY (h, i), h)))) in hash_lookup() 4357 eassert (EQ (Qunbound, (HASH_KEY (h, i)))); in hash_put() 4388 if (EQ (key, HASH_KEY (h, i)) in hash_remove_from_table() 4391 && !NILP (h->test.cmpfn (key, HASH_KEY (h, i), h)))) in hash_remove_from_table() 4468 bool key_known_to_survive_p = survives_gc_p (HASH_KEY (h, i)); in sweep_weak_table() 4522 mark_object (HASH_KEY (h, i)); in sweep_weak_table() 5043 Lisp_Object k = HASH_KEY (h, i);
|
/dports/games/libretro-scummvm/scummvm-7b1e929/engines/glk/hugo/ |
H A D | htokens.h | 39 #define HASH_KEY 1023 macro
|
/dports/games/scummvm/scummvm-2.5.1/engines/glk/hugo/ |
H A D | htokens.h | 39 #define HASH_KEY 1023 macro
|
/dports/mail/mairix/mairix-0.24/test/scripts/ |
H A D | test.sh | 928 --force-hash-key-new-database "$HASH_KEY" \ 1086 HASH_KEY=1 # the hash key used for new databases.
|
/dports/net/frr7-pythontools/frr-frr-7.5.1/lib/ |
H A D | typesafe.h | 599 #define HASH_KEY(head, val) \ macro 642 uint32_t hval = hashfn(item), hbits = HASH_KEY(h->hh, hval); \ 660 uint32_t hval = hashfn(item), hbits = HASH_KEY(h->hh, hval); \ 676 uint32_t hval = item->field.hi.hashval, hbits = HASH_KEY(h->hh, hval); \ 720 uint32_t i = HASH_KEY(h->hh, hitem->hashval) + 1; \
|
/dports/net/frr7/frr-frr-7.5.1/lib/ |
H A D | typesafe.h | 599 #define HASH_KEY(head, val) \ macro 642 uint32_t hval = hashfn(item), hbits = HASH_KEY(h->hh, hval); \ 660 uint32_t hval = hashfn(item), hbits = HASH_KEY(h->hh, hval); \ 676 uint32_t hval = item->field.hi.hashval, hbits = HASH_KEY(h->hh, hval); \ 720 uint32_t i = HASH_KEY(h->hh, hitem->hashval) + 1; \
|