Home
last modified time | relevance | path

Searched refs:hash (Results 1 – 25 of 473) sorted by relevance

12345678910>>...19

/titanic_51/usr/src/uts/common/os/
H A Dmodhash.c27 * mod_hash: flexible hash table implementation.
29 * This is a reasonably fast, reasonably flexible hash table implementation
30 * which features pluggable hash algorithms to support storing arbitrary keys
32 * data. The hash uses chaining to resolve collisions, and does not feature a
33 * mechanism to grow the hash. Care must be taken to pick nchains to be large
35 * hash chains.
37 * The client of the hash is required to supply a number of items to support
38 * the various hash functions:
41 * A destructor is responsible for freeing an object when the hash
47 * - A hashing algorithm which returns a uint_t representing a hash inde
151 MH_KEY_DESTROY(hash,key) global() argument
157 MH_VAL_DESTROY(hash,val) global() argument
163 MH_KEYCMP(hash,key1,key2) global() argument
207 uint_t hash = 0; mod_hash_bystr() local
317 mod_hash_destroy_ptrhash(mod_hash_t * hash) mod_hash_destroy_ptrhash() argument
393 mod_hash_destroy_idhash(mod_hash_t * hash) mod_hash_destroy_idhash() argument
476 mod_hash_destroy_hash(mod_hash_t * hash) mod_hash_destroy_hash() argument
518 i_mod_hash(mod_hash_t * hash,mod_hash_key_t key) i_mod_hash() argument
545 i_mod_hash_insert_nosync(mod_hash_t * hash,mod_hash_key_t key,mod_hash_val_t val,mod_hash_hndl_t handle) i_mod_hash_insert_nosync() argument
579 mod_hash_insert(mod_hash_t * hash,mod_hash_key_t key,mod_hash_val_t val) mod_hash_insert() argument
602 mod_hash_insert_reserve(mod_hash_t * hash,mod_hash_key_t key,mod_hash_val_t val,mod_hash_hndl_t handle) mod_hash_insert_reserve() argument
632 mod_hash_reserve(mod_hash_t * hash,mod_hash_hndl_t * handlep) mod_hash_reserve() argument
644 mod_hash_reserve_nosleep(mod_hash_t * hash,mod_hash_hndl_t * handlep) mod_hash_reserve_nosleep() argument
658 mod_hash_cancel(mod_hash_t * hash,mod_hash_hndl_t * handlep) mod_hash_cancel() argument
670 i_mod_hash_remove_nosync(mod_hash_t * hash,mod_hash_key_t key,mod_hash_val_t * val) i_mod_hash_remove_nosync() argument
707 mod_hash_remove(mod_hash_t * hash,mod_hash_key_t key,mod_hash_val_t * val) mod_hash_remove() argument
725 mod_hash_replace(mod_hash_t * hash,mod_hash_key_t key,mod_hash_val_t val) mod_hash_replace() argument
750 mod_hash_destroy(mod_hash_t * hash,mod_hash_key_t key) mod_hash_destroy() argument
774 i_mod_hash_find_nosync(mod_hash_t * hash,mod_hash_key_t key,mod_hash_val_t * val) i_mod_hash_find_nosync() argument
794 mod_hash_find(mod_hash_t * hash,mod_hash_key_t key,mod_hash_val_t * val) mod_hash_find() argument
806 mod_hash_find_cb(mod_hash_t * hash,mod_hash_key_t key,mod_hash_val_t * val,void (* find_cb)(mod_hash_key_t,mod_hash_val_t)) mod_hash_find_cb() argument
822 mod_hash_find_cb_rval(mod_hash_t * hash,mod_hash_key_t key,mod_hash_val_t * val,int (* find_cb)(mod_hash_key_t,mod_hash_val_t),int * cb_rval) mod_hash_find_cb_rval() argument
838 i_mod_hash_walk_nosync(mod_hash_t * hash,uint_t (* callback)(mod_hash_key_t,mod_hash_val_t *,void *),void * arg) i_mod_hash_walk_nosync() argument
866 mod_hash_walk(mod_hash_t * hash,uint_t (* callback)(mod_hash_key_t,mod_hash_val_t *,void *),void * arg) mod_hash_walk() argument
882 i_mod_hash_clear_nosync(mod_hash_t * hash) i_mod_hash_clear_nosync() argument
902 mod_hash_clear(mod_hash_t * hash) mod_hash_clear() argument
[all...]
/titanic_51/usr/src/tools/ctf/cvt/
H A Dhash.c30 * Routines for manipulating hash tables
39 #include "hash.h"
43 struct hash { struct
94 hash_t *hash; in hash_new() local
96 hash = xmalloc(sizeof (hash_t)); in hash_new()
97 hash->h_buckets = xcalloc(sizeof (list_t *) * nbuckets); in hash_new()
98 hash->h_nbuckets = nbuckets; in hash_new()
99 hash->h_hashfn = hashfn ? hashfn : (int (*)())hash_def_hash; in hash_new()
100 hash->h_cmp = cmp ? cmp : (int (*)())hash_def_cmp; in hash_new()
102 return (hash); in hash_new()
47 h_hashfnhash global() argument
51 h_cmphash global() argument
106 hash_add(hash_t * hash,void * key) hash_add() argument
127 hash_remove_cb(void * key1,void * key2,hash_t * hash) hash_remove_cb() argument
133 hash_remove(hash_t * hash,void * key) hash_remove() argument
142 hash_match(hash_t * hash,void * key,int (* fun)(void *,void *),void * private) hash_match() argument
166 hash_find_iter(hash_t * hash,void * key,int (* fun)(void *,void *),void * private) hash_find_iter() argument
194 hash_find(hash_t * hash,void * key,void ** value) hash_find() argument
211 hash_iter(hash_t * hash,int (* fun)(void *,void *),void * private) hash_iter() argument
230 hash_count(hash_t * hash) hash_count() argument
241 hash_free(hash_t * hash,void (* datafree)(void *,void *),void * private) hash_free() argument
255 hash_stats(hash_t * hash,int verbose) hash_stats() argument
[all...]
/titanic_51/usr/src/lib/libtecla/common/
H A Dhash.c45 #include "hash.h"
56 StringMem *string_memory; /* Memory used to allocate hash strings */
60 * Define a hash symbol-table entry.
65 Symbol symbol; /* The symbol stored in the hash-entry */
66 HashNode *next; /* The next hash-table entry in a bucket list */
70 * Each hash-table bucket contains a linked list of entries that
71 * hash to the same bucket.
74 HashNode *head; /* The head of the bucket hash-node list */
79 * A hash-table consists of 'size' hash bucket
216 HashTable *hash; /* The table to be returned */ _new_HashTable() local
287 _del_HashTable(HashTable * hash) _del_HashTable() argument
340 _new_HashSymbol(HashTable * hash,const char * name,int code,void (* fn)(void),void * data,SYM_DEL_FN (* del_fn)) _new_HashSymbol() argument
395 _del_HashSymbol(HashTable * hash,const char * name) _del_HashSymbol() argument
436 _find_HashSymbol(HashTable * hash,const char * name) _find_HashSymbol() argument
478 _new_HashNode(HashTable * hash,const char * name,int code,void (* fn)(void),void * data,SYM_DEL_FN (* del_fn)) _new_HashNode() argument
535 _del_HashNode(HashTable * hash,HashNode * node) _del_HashNode() argument
570 _find_HashBucket(HashTable * hash,const char * name) _find_HashBucket() argument
600 _find_HashNode(HashTable * hash,HashBucket * bucket,const char * name,HashNode ** prev) _find_HashNode() argument
675 _clear_HashTable(HashTable * hash) _clear_HashTable() argument
721 _scan_HashTable(HashTable * hash,HASH_SCAN_FN (* scan_fn),void * context) _scan_HashTable() argument
[all...]
/titanic_51/usr/src/common/ficl/
H A Dhash.c3 #define FICL_ASSERT_PHASH(hash, expression) FICL_ASSERT(NULL, expression) argument
7 * Unlink all words in the hash that have addresses greater than or
12 ficlHashForget(ficlHash *hash, void *where) in ficlHashForget() argument
17 FICL_ASSERT_PHASH(hash, hash); in ficlHashForget()
18 FICL_ASSERT_PHASH(hash, where); in ficlHashForget()
20 for (i = 0; i < hash->size; i++) { in ficlHashForget()
21 pWord = hash->table[i]; in ficlHashForget()
27 hash->table[i] = pWord; in ficlHashForget()
66 * Put a word into the hash tabl
70 ficlHashInsertWord(ficlHash * hash,ficlWord * word) ficlHashInsertWord() argument
97 ficlHashLookup(ficlHash * hash,ficlString name,ficlUnsigned16 hashCode) ficlHashLookup() argument
130 ficlHashReset(ficlHash * hash) ficlHashReset() argument
[all...]
H A Dprefix.c72 ficlHash *hash; in ficlVmParsePrefix() local
83 hash = (ficlHash *)(word->param[0].p); in ficlVmParsePrefix()
88 for (i = 0; i < (int)hash->size; i++) { in ficlVmParsePrefix()
89 word = hash->table[i]; in ficlVmParsePrefix()
144 ficlHash *hash; in ficlSystemCompilePrefix() local
151 hash = ficlDictionaryCreateWordlist(dictionary, 1); in ficlSystemCompilePrefix()
152 hash->name = list_name; in ficlSystemCompilePrefix()
153 ficlDictionaryAppendConstantPointer(dictionary, list_name, hash); in ficlSystemCompilePrefix()
171 * dictionary->compilationWordlist = hash; in ficlSystemCompilePrefix()
H A Dsearch.c79 ficlHash *hash = ficlVmGetDictionary(vm)->forthWordlist; in ficlPrimitiveForthWordlist() local
80 ficlStackPushPointer(vm->dataStack, hash); in ficlPrimitiveForthWordlist()
136 ficlHash *hash = ficlStackPopPointer(vm->dataStack); in ficlPrimitiveSearchWordlist() local
143 word = ficlHashLookup(hash, name, hashCode); in ficlPrimitiveSearchWordlist()
163 ficlHash *hash = ficlStackPopPointer(vm->dataStack); in ficlPrimitiveSetCurrent() local
166 dictionary->compilationWordlist = hash; in ficlPrimitiveSetCurrent()
217 * 1. Ficl creates a new single-list hash in the dictionary and returns
220 * hash entries in the wordlist. Ficl 2.02 and later define WORDLIST as
227 ficlHash *hash; in ficlPrimitiveFiclWordlist() local
233 hash in ficlPrimitiveFiclWordlist()
285 ficlHash *hash; ficlPrimitiveWidGetName() local
314 ficlHash *hash = ficlVmPop(vm).p; ficlPrimitiveWidSetName() local
[all...]
/titanic_51/usr/src/contrib/ast/src/lib/libast/cdt/
H A Ddthash.c35 /* internal data structure for hash table with chaining */
40 Dtlink_t** htbl; /* hash table slots */
41 ssize_t tblz; /* size of hash table */
44 /* make/resize hash table */
50 Dthash_t *hash = (Dthash_t*)dt->data; in htable() local
52 if((n = hash->tblz) > 0 && (hash->type&H_FIXED) ) in htable()
58 { hash->type |= H_FIXED; in htable()
65 n = n < HLOAD(hash->data.size) ? HLOAD(hash in htable()
98 Dthash_t *hash = (Dthash_t*)dt->data; hclear() local
117 Dthash_t *hash = (Dthash_t*)dt->data; hfirst() local
132 Dthash_t *hash = (Dthash_t*)dt->data; hnext() local
154 Dthash_t *hash = (Dthash_t*)dt->data; hflatten() local
226 Dthash_t *hash = (Dthash_t*)dt->data; hstat() local
262 Dthash_t *hash = (Dthash_t*)dt->data; global() local
388 Dthash_t *hash = (Dthash_t*)dt->data; hashevent() local
[all...]
/titanic_51/usr/src/lib/libnsctl/common/
H A Dhash.c37 hash_node_t **hash; in nsc_create_hash() local
39 hash = (hash_node_t **)calloc(HASH_PRIME, sizeof (hash_node_t *)); in nsc_create_hash()
40 return (hash); in nsc_create_hash()
44 nsc_insert_node(hash_node_t **hash, void *data, const char *key) in nsc_insert_node() argument
61 node->next = hash[ index ]; in nsc_insert_node()
62 hash[ index ] = node; in nsc_insert_node()
71 * Searches the hash to find a node.
78 nsc_lookup(hash_node_t **hash, const char *key) in nsc_lookup() argument
84 node = hash[ index ]; in nsc_lookup()
94 nsc_remove_node(hash_node_t **hash, cha argument
132 nsc_remove_all(hash_node_t ** hash,void (* callback)(void *)) nsc_remove_all() argument
160 unsigned int hash, i; calc_hash() local
[all...]
/titanic_51/usr/src/cmd/nscd/
H A Dnscd_dbimpl.c37 * based on hash and has table. If the need arises in the future,
51 * This structure defines an instance of the hash entry
77 nscd_hash_t *hash; /* the current hash entry */ member
84 * Calculate a hash for a string based on the elf_hash
85 * algorithm, hash is case insensitive. Uses tolower
112 * Scan a hash table for a matching hash entry. Assume 'str' is
168 unsigned long hash; in _nscd_get_db_entry() local
174 hash in _nscd_get_db_entry()
197 unsigned long hash; _nscd_add_db_entry() local
295 unsigned long hash; _nscd_delete_db_entry() local
383 nscd_hash_t *hash; _nscd_alloc_db_entry() local
[all...]
/titanic_51/usr/src/cmd/sgs/link_audit/common/
H A Dhash.h36 typedef struct hash { struct
44 } hash; typedef
46 extern hash *make_hash(size_t);
47 extern hash *make_ihash(size_t);
48 extern char **get_hash(hash *, char *);
49 extern char **find_hash(hash *, const char *);
50 extern char *del_hash(hash *, const char *);
51 extern size_t operate_hash(hash *, void (*)(), const char *);
52 extern void destroy_hash(hash *, int (*)(), const char *);
38 tablehash global() argument
39 starthash global() argument
40 hash_typehash global() argument
43 hash_typehash global() argument
/titanic_51/usr/src/uts/common/inet/ilb/
H A Dilb_conn.c51 * start: starting index into the hash table to do gc
52 * end: ending index into the hash table to do gc
65 /* Hash macro for finding the index to the conn hash table */
73 /* Kmem cache for the conn hash entry */
78 * gc thread is responsible for 1/60 of the conn hash table.
95 * gc thread is responsible for 1/60 of the sticky hash table.
104 mutex_enter(&(s)->hash->sticky_lock); \
107 mutex_exit(&s->hash->sticky_lock); \
131 ilb_conn_hash_t *hash; in ilb_conn_remove_common() local
136 hash in ilb_conn_remove_common()
369 ilb_conn_hash_t *hash; ilb_conn_hash_fini() local
506 ilb_conn_hash_t *hash; ilb_conn_add() local
753 ilb_conn_hash_t *hash; ilb_find_conn() local
892 ilb_conn_hash_t *hash; ilb_check_icmp_conn() local
1032 ilb_conn_hash_t *hash; ilb_list_nat() local
1157 ilb_sticky_lookup(ilb_sticky_hash_t * hash,ilb_rule_t * rule,in6_addr_t * src) ilb_sticky_lookup() argument
1174 ilb_sticky_add(ilb_sticky_hash_t * hash,ilb_rule_t * rule,ilb_server_t * server,in6_addr_t * src) ilb_sticky_add() argument
1231 ilb_sticky_hash_t *hash; ilb_sticky_find_add() local
1312 ilb_sticky_hash_t *hash; ilb_sticky_cleanup() local
1461 ilb_sticky_hash_t *hash; ilb_list_sticky() local
[all...]
/titanic_51/usr/src/common/lzma/
H A DLzFind.c132 p->hash = 0; in MatchFinder_Construct()
147 alloc->Free(alloc, p->hash, 0); in MatchFinder_FreeThisClassMemory()
148 p->hash = 0; in MatchFinder_FreeThisClassMemory()
226 if (p->hash != 0 && prevSize == newSize) in MatchFinder_Create()
229 p->hash = AllocRefs(newSize, alloc); in MatchFinder_Create()
230 if (p->hash != 0) in MatchFinder_Create()
232 p->son = p->hash + p->hashSizeSum; in MatchFinder_Create()
270 p->hash[i] = kEmptyHashValue; in MatchFinder_Init()
302 MatchFinder_Normalize3(subValue, p->hash, p->hashSizeSum + p->numSons); in MatchFinder_Normalize()
484 curMatch = p->hash[hashValu in Bt2_MatchFinder_GetMatches()
[all...]
/titanic_51/usr/src/uts/common/fs/
H A Dpkp_hash.c28 * Pearson's string hash
59 uint_t hash; in pkp_tab_hash() local
62 hash = MOD2((key + len), PKP_HASH_SIZE); in pkp_tab_hash()
65 hash = MOD2((hash + str[i]), PKP_HASH_SIZE); in pkp_tab_hash()
66 hash = pkp_tab[hash]; in pkp_tab_hash()
69 return (hash); in pkp_tab_hash()
/titanic_51/usr/src/cmd/sendmail/db/include/
H A Ddb_shash.h16 * Look up something in a shared memory hash table. The "elt" argument
18 * structure it is that appears in the hash table. The comparison function
20 * begin: address of the beginning of the hash table.
23 * elt: the item for which we are searching in the hash table.
25 * nelems: the number of buckets in the hash table.
26 * hash_func: the hash function that operates on elements of the type of elt
30 * If the element is not in the hash table, this macro exits with result
33 #define HASHLOOKUP(begin, type, field, elt, r, n, hash, cmp) do { \ argument
37 __ndx = hash(elt) % (n); \
48 * Insert a new entry into the hash tabl
57 HASHINSERT(begin,type,field,elt,n,hash) global() argument
78 HASHREMOVE(begin,type,field,elt,n,hash,cmp) global() argument
99 HASHREMOVE_EL(begin,type,field,obj,n,hash) global() argument
[all...]
/titanic_51/usr/src/cmd/refer/
H A Dinv6.c27 int hash = 0, hused = 0; in whash() local
47 if (hash < k) { in whash()
51 hfreq[hash] = ct; in whash()
52 while (hash < k) { in whash()
53 hpt[++hash] = lp; in whash()
54 hfreq[hash] = 0; in whash()
56 hpt[hash] = lp += iflong ? sizeof (long) : sizeof (int); in whash()
71 while (hash < nhash) in whash()
72 hpt[++hash] = lp; in whash()
/titanic_51/usr/src/lib/libcpc/common/
H A Dsubr.c163 __cpc_strhash_free(cpc_strhash_t *hash) in __cpc_strhash_free() argument
165 cpc_strhash_t *p = hash, *f; in __cpc_strhash_free()
175 * Insert a new key into the hash table.
184 __cpc_strhash_add(cpc_strhash_t *hash, char *key) in __cpc_strhash_add() argument
188 for (p = hash; p != NULL; p = p->next) { in __cpc_strhash_add()
197 tmp = hash->next; in __cpc_strhash_add()
198 hash->next = p; in __cpc_strhash_add()
204 hash->cur = p; in __cpc_strhash_add()
210 __cpc_strhash_next(cpc_strhash_t *hash) in __cpc_strhash_next() argument
214 if (hash in __cpc_strhash_next()
[all...]
/titanic_51/usr/src/lib/libnsl/yp/
H A Ddbm.c127 long hash; in forder() local
129 hash = calchash(key); in forder()
131 blkno = hash & hmask; in forder()
265 long hash; in nextkey() local
272 hash = calchash(key); in nextkey()
273 dbm_access(hash); in nextkey()
288 hash = hashinc(hash); in nextkey()
289 if (hash == 0) in nextkey()
291 return (firsthash(hash)); in nextkey()
295 firsthash(long hash) firsthash() argument
319 dbm_access(long hash) dbm_access() argument
469 hashinc(long hash) hashinc() argument
[all...]
/titanic_51/usr/src/cmd/dtrace/demo/
H A Dmkdemo.pl44 my %hash;
59 if (exists $hash{'name'}) {
60 if (exists $chaps{$hash{'name'}}) {
61 print "$cmd: chapter $hash{'name'} ";
66 $chaps{$hash{'name'}} = { %hash };
67 %hash = ();
71 %hash = ();
81 $hash{$field} .= $value;
/titanic_51/usr/src/ucblib/libdbm/
H A Ddbm.c51 void dbm_access(long hash);
130 long hash; in forder() local
132 hash = calchash(key); in forder()
134 blkno = hash & hmask; in forder()
280 long hash; in nextkey() local
283 hash = calchash(key); in nextkey()
284 dbm_access(hash); in nextkey()
299 hash = hashinc(hash); in nextkey()
300 if (hash in nextkey()
306 firsthash(long hash) firsthash() argument
330 dbm_access(long hash) dbm_access() argument
476 hashinc(long hash) hashinc() argument
[all...]
/titanic_51/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
H A DProcessState.java300 * Overridden to ensure that equal instances have equal hash codes.
306 int hash = 17; in hashCode() local
307 hash = (37 * hash) + processID; in hashCode()
308 hash = (37 * hash) + state.hashCode(); in hashCode()
309 hash = (37 * hash) + terminationSignal; in hashCode()
310 hash = (37 * hash) in hashCode()
[all...]
H A DProbeDescription.java441 int hash = id; in hashCode() local
442 if (hash != ID_NONE) { in hashCode()
443 return hash; in hashCode()
446 hash = 17; in hashCode()
447 hash = (37 * hash) + provider.hashCode(); in hashCode()
448 hash = (37 * hash) + module.hashCode(); in hashCode()
449 hash = (37 * hash) in hashCode()
[all...]
/titanic_51/usr/src/uts/common/io/aggr/
H A Daggr_send.c84 uint64_t hash; in aggr_find_tx_ring() local
96 hash = mac_pkt_hash(DL_ETHER, mp, grp->lg_mac_tx_policy, B_TRUE); in aggr_find_tx_ring()
97 port = grp->lg_tx_ports[hash % grp->lg_ntx_ports]; in aggr_find_tx_ring()
100 * Use hash as the hint so to direct traffic to in aggr_find_tx_ring()
107 hash = (hash << 24 | hash << 16 | hash); in aggr_find_tx_ring()
108 hash = (hash << 3 in aggr_find_tx_ring()
[all...]
/titanic_51/usr/src/cmd/fs.d/nfs/mountd/
H A Dhashset.c35 * HASHSET is hash table managing pointers to a set of keys
38 * Unlike the libc `hsearch' based hash table, this implementation
45 * the actual key data only through the hash and equal functions given
81 * - HASHSET is a hash table of pointers to keys
86 * - the function hash(key) is used to compute hash values for keys; if
87 * keys are "equal" the values returned by the hash function must be
92 h_create(uint_t (*hash) (const void *), in h_create()
119 h->h_hash = hash; in h_create()
135 uint_t hash in h_get() local
189 uint_t hash = h->h_hash(key); h_put() local
225 uint_t hash = h->h_hash(key); h_delete() local
[all...]
/titanic_51/usr/src/lib/libast/common/hash/
H A Dhashlook.c88 if (flags & HASH_BUCKET) n = last->bucket->hash; in hashlook()
96 last->hash = i = HASHVAL(n); in hashlook()
102 …if (i == HASHVAL(b->hash) && ((b->hash & (HASH_DELETED|HASH_OPAQUED)) != HASH_DELETED || (flags & … in hashlook()
136 n = i = last->hash; in hashlook()
162 if (flags & HASH_OPAQUE) b->hash |= HASH_OPAQUED; in hashlook()
169 if (flags & HASH_OPAQUE) b->hash &= ~HASH_OPAQUED; in hashlook()
184 if (tab->frozen || (b->hash & HASH_OPAQUED)) b->hash |= HASH_DELETED; in hashlook()
188 name = (b->hash & HASH_FREENAME) ? (char*)b->name : (char*)0; in hashlook()
190 else if (!(b->hash & HASH_KEEP)) in hashlook()
205 …if (tab != top || tab->frozen || (b->hash & (HASH_KEEP|HASH_OPAQUED)) || hashlook(top, value, (fla… in hashlook()
[all …]
/titanic_51/usr/src/contrib/ast/src/lib/libast/hash/
H A Dhashlook.c27 * hash table library
33 * hash table lookup
88 if (flags & HASH_BUCKET) n = last->bucket->hash; in hashlook()
96 last->hash = i = HASHVAL(n); in hashlook()
102 if (i == HASHVAL(b->hash) && ((b->hash & (HASH_DELETED|HASH_OPAQUED)) != HASH_DELETED || (flags & (HASH_CREATE|HASH_DELETE|HASH_INSTALL|HASH_RENAME)))) in hashlook()
136 n = i = last->hash; in hashlook()
162 if (flags & HASH_OPAQUE) b->hash |= HASH_OPAQUED; in hashlook()
169 if (flags & HASH_OPAQUE) b->hash &= ~HASH_OPAQUED; in hashlook()
184 if (tab->frozen || (b->hash in hashlook()
[all...]

12345678910>>...19