Home
last modified time | relevance | path

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

12345678910>>...19

/illumos-gate/usr/src/uts/common/os/
H A Dmodhash.c151 #define MH_KEY_DESTROY(hash, key) ((hash->mh_kdtor)(key)) argument
157 #define MH_VAL_DESTROY(hash, val) ((hash->mh_vdtor)(val)) argument
213 hash = (hash << 4) + *p; in mod_hash_bystr()
216 hash ^= g; in mod_hash_bystr()
219 return (hash); in mod_hash_bystr()
319 ASSERT(hash); in mod_hash_destroy_ptrhash()
395 ASSERT(hash); in mod_hash_destroy_idhash()
509 kmem_free(hash->mh_name, strlen(hash->mh_name) + 1); in mod_hash_destroy_hash()
510 kmem_free(hash, MH_SIZE(hash->mh_nchains)); in mod_hash_destroy_hash()
528 h = (hash->mh_hashalg)(hash->mh_hashalg_data, key); in i_mod_hash()
[all …]
/illumos-gate/usr/src/lib/libtecla/common/
H A Dhash.c238 if(!hash) { in _new_HashTable()
249 hash->mem = mem; in _new_HashTable()
252 hash->size = size; in _new_HashTable()
254 hash->keycmp = hash->case_sensitive ? _ht_strcmp : _ht_lower_strcmp; in _new_HashTable()
276 return hash; in _new_HashTable()
289 if(hash) { in _del_HashTable()
302 hash->del_fn(hash->app_data); in _del_HashTable()
311 hash = (HashTable *) _del_FreeListNode(hash->mem->hash_memory, hash); in _del_HashTable()
443 if(!hash) in _find_HashSymbol()
581 return hash->bucket + (h % hash->size); in _find_HashBucket()
[all …]
/illumos-gate/usr/src/common/ficl/
H A Dhash.c17 FICL_ASSERT_PHASH(hash, hash); in ficlHashForget()
21 pWord = hash->table[i]; in ficlHashForget()
27 hash->table[i] = pWord; in ficlHashForget()
74 FICL_ASSERT_PHASH(hash, hash); in ficlHashInsertWord()
78 pList = hash->table; in ficlHashInsertWord()
80 pList = hash->table + (word->hash % hash->size); in ficlHashInsertWord()
106 for (; hash != NULL; hash = hash->link) { in ficlHashLookup()
107 if (hash->size > 1) in ficlHashLookup()
134 FICL_ASSERT_PHASH(hash, hash); in ficlHashReset()
140 hash->link = NULL; in ficlHashReset()
[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()
H A Dsearch.c80 ficlStackPushPointer(vm->dataStack, hash); in ficlPrimitiveForthWordlist()
136 ficlHash *hash = ficlStackPopPointer(vm->dataStack); in ficlPrimitiveSearchWordlist() local
143 word = ficlHashLookup(hash, name, hashCode); in ficlPrimitiveSearchWordlist()
166 dictionary->compilationWordlist = hash; in ficlPrimitiveSetCurrent()
227 ficlHash *hash; in ficlPrimitiveFiclWordlist() local
234 ficlStackPushPointer(vm->dataStack, hash); in ficlPrimitiveFiclWordlist()
285 ficlHash *hash; in ficlPrimitiveWidGetName() local
290 hash = ficlVmPop(vm).p; in ficlPrimitiveWidGetName()
291 name = hash->name; in ficlPrimitiveWidGetName()
314 ficlHash *hash = ficlVmPop(vm).p; in ficlPrimitiveWidSetName() local
[all …]
/illumos-gate/usr/src/contrib/ast/src/lib/libast/cdt/
H A Ddthash.c52 if((n = hash->tblz) > 0 && (hash->type&H_FIXED) ) in htable()
79 for(endt = (t = hash->htbl) + hash->tblz; t < endt; ++t) in htable()
103 for(endt = (t = hash->htbl) + hash->tblz; t < endt; ++t) in hclear()
119 for(endt = (t = hash->htbl) + hash->tblz; t < endt; ++t) in hfirst()
139 { t = hash->htbl + (l->_hash & (hash->tblz-1)) + 1; in hnext()
140 endt = hash->htbl + hash->tblz; in hnext()
312 tbl = hash->htbl + (hsh & (hash->tblz-1));
362 if(hash->tblz < HLOAD(hash->data.size) )
364 tbl = hash->htbl + (hsh & (hash->tblz-1));
391 { if(hash) in hashevent()
[all …]
/illumos-gate/usr/src/cmd/nscd/
H A Dnscd_dbimpl.c166 unsigned long hash; in _nscd_get_db_entry() local
195 unsigned long hash; in _nscd_add_db_entry() local
293 unsigned long hash; in _nscd_delete_db_entry() local
381 nscd_hash_t *hash; in _nscd_alloc_db_entry() local
399 if (hash == NULL) in _nscd_alloc_db_entry()
406 hash->db_entry.name = (char *)hash + sizeof (*hash); in _nscd_alloc_db_entry()
409 *(hash->db_entry.data_array) = (char *)hash + data_o; in _nscd_alloc_db_entry()
440 hp = c->hash; in _nscd_delete_db_entry_cookie()
456 c->hash = NULL; in _nscd_delete_db_entry_cookie()
584 c->hash = c->hash->next_p; in _nscd_walk_db()
[all …]
/illumos-gate/usr/src/tools/smatch/src/
H A Dstorage.c27 hash += hash / MAX_STORAGE_HASH; in storage_hash()
52 struct storage_hash *hash; in gather_storage() local
54 if (hash->bb == bb && hash->inout == inout) in gather_storage()
56 } END_FOR_EACH_PTR(hash); in gather_storage()
84 } END_FOR_EACH_PTR(hash); in name_storage()
94 if (hash->bb == bb && hash->pseudo == pseudo && hash->inout == inout) in lookup_storage()
95 return hash->storage; in lookup_storage()
96 } END_FOR_EACH_PTR(hash); in lookup_storage()
105 hash->bb = bb; in add_storage()
106 hash->pseudo = pseudo; in add_storage()
[all …]
/illumos-gate/usr/src/cmd/sgs/link_audit/common/
H A Dhash.h36 typedef struct hash { struct
44 } hash; argument
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 *);
/illumos-gate/usr/src/uts/common/inet/ilb/
H A Dilb_conn.c131 ilb_conn_hash_t *hash; in ilb_conn_remove_common() local
159 hash->ilb_connp = *next; in ilb_conn_remove_common()
169 hash->ilb_conn_cnt--; in ilb_conn_remove_common()
372 ilb_conn_hash_t *hash; in ilb_conn_hash_fini() local
509 ilb_conn_hash_t *hash; in ilb_conn_add() local
757 ilb_conn_hash_t *hash; in ilb_find_conn() local
896 ilb_conn_hash_t *hash; in ilb_check_icmp_conn() local
1041 ilb_conn_hash_t *hash; in ilb_list_nat() local
1215 s->hash = hash; in ilb_sticky_add()
1226 hash->sticky_cnt++; in ilb_sticky_add()
[all …]
/illumos-gate/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()
230 if (p->hash != 0) in MatchFinder_Create()
270 p->hash[i] = kEmptyHashValue; in MatchFinder_Init()
484 curMatch = p->hash[hashValue]; in Bt2_MatchFinder_GetMatches()
485 p->hash[hashValue] = p->pos; in Bt2_MatchFinder_GetMatches()
496 p->hash[hashValue] = p->pos; in Bt3Zip_MatchFinder_GetMatches()
511 p->hash[hash2Value] = in Bt3_MatchFinder_GetMatches()
636 p->hash[hashValue] = p->pos; in Hc3Zip_MatchFinder_GetMatches()
[all …]
/illumos-gate/usr/src/cmd/sendmail/db/include/
H A Ddb_shash.h33 #define HASHLOOKUP(begin, type, field, elt, r, n, hash, cmp) do { \ argument
37 __ndx = hash(elt) % (n); \
57 #define HASHINSERT(begin, type, field, elt, n, hash) do { \ argument
61 __ndx = hash(elt) % (n); \
78 #define HASHREMOVE(begin, type, field, elt, n, hash, cmp) { \ argument
83 __ndx = hash(elt) % (n); \
85 HASHLOOKUP(begin, type, field, elt, __entp, n, hash, cmp); \
99 #define HASHREMOVE_EL(begin, type, field, obj, n, hash) { \ argument
103 __ndx = hash(obj) % (n); \
/illumos-gate/usr/src/uts/common/fs/
H A Dpkp_hash.c59 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()
/illumos-gate/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()
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->cur != NULL) { in __cpc_strhash_next()
215 p = hash->cur; in __cpc_strhash_next()
[all …]
/illumos-gate/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()
/illumos-gate/usr/src/lib/libnsl/yp/
H A Ddbm.c127 long hash; in forder() local
265 long hash; in nextkey() local
273 dbm_access(hash); in nextkey()
288 hash = hashinc(hash); in nextkey()
289 if (hash == 0) in nextkey()
301 dbm_access(hash); in firsthash()
312 hash = hashinc(hash); in firsthash()
313 if (hash == 0) in firsthash()
469 hashinc(long hash) in hashinc() argument
473 hash &= hmask; in hashinc()
[all …]
/illumos-gate/usr/src/lib/lib9p/common/
H A Dhashtable.c74 ht_find(struct ht *h, uint32_t hash) in ht_find() argument
80 result = ht_find_locked(h, hash); in ht_find()
86 ht_find_locked(struct ht *h, uint32_t hash) in ht_find_locked() argument
94 if (item->hti_hash == hash) in ht_find_locked()
114 if (item->hti_hash == hash) { in ht_add()
122 item->hti_hash = hash; in ht_add()
131 ht_remove(struct ht *h, uint32_t hash) in ht_remove() argument
138 result = ht_remove_locked(h, hash); in ht_remove()
144 ht_remove_locked(struct ht *h, uint32_t hash) in ht_remove_locked() argument
148 ssize_t slot = hash % h->ht_nentries; in ht_remove_locked()
[all …]
/illumos-gate/usr/src/ucblib/libdbm/
H A Ddbm.c134 long hash; in forder() local
284 long hash; in nextkey() local
288 dbm_access(hash); in nextkey()
303 hash = hashinc(hash); in nextkey()
304 if (hash == 0) in nextkey()
316 dbm_access(hash); in firsthash()
327 hash = hashinc(hash); in firsthash()
328 if (hash == 0) in firsthash()
481 hashinc(long hash) in hashinc() argument
485 hash &= hmask; in hashinc()
[all …]
/illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
H A DProcessState.java306 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) + (exitStatus == null ? 0 : in hashCode()
312 hash = (37 * hash) + (message == null ? 0 : message.hashCode()); in hashCode()
313 return hash; in hashCode()
/illumos-gate/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;
/illumos-gate/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()
107 hash = (hash << 24 | hash << 16 | hash); in aggr_find_tx_ring()
108 hash = (hash << 32 | hash); in aggr_find_tx_ring()
110 hash = hint; in aggr_find_tx_ring()
112 hash = HASH_HINT(hash); in aggr_find_tx_ring()
113 *rh = port->lp_pseudo_tx_rings[hash % port->lp_tx_ring_cnt]; in aggr_find_tx_ring()
/illumos-gate/usr/src/cmd/fs.d/nfs/mountd/
H A Dhashset.c92 h_create(uint_t (*hash) (const void *), in h_create()
119 h->h_hash = hash; in h_create()
135 uint_t hash = h->h_hash(key); in h_get() local
136 uint_t i = hash % h->h_tableSize; in h_get()
140 if (e->e_hash == hash && h->h_equal(e->e_key, key)) in h_get()
189 uint_t hash = h->h_hash(key); in h_put() local
190 uint_t indx = hash % h->h_tableSize; in h_put()
200 indx = hash % h->h_tableSize; in h_put()
204 e->e_hash = hash; in h_put()
225 uint_t hash = h->h_hash(key); in h_delete() local
[all …]
/illumos-gate/usr/src/contrib/ast/src/lib/libast/hash/
H A Dhashlook.c96 last->hash = i = HASHVAL(n); in hashlook()
136 n = i = last->hash; in hashlook()
184 if (tab->frozen || (b->hash & HASH_OPAQUED)) b->hash |= HASH_DELETED; in hashlook()
190 else if (!(b->hash & HASH_KEEP)) in hashlook()
236 if (name && (b->hash & HASH_FREENAME)) in hashlook()
238 b->hash &= ~HASH_FREENAME; in hashlook()
246 i = last->hash; in hashlook()
331 b->hash = n = i; in hashlook()
339 b->hash |= HASH_DELETED|HASH_OPAQUED; in hashlook()
348 if (b->hash & HASH_DELETED) in hashlook()
[all …]
/illumos-gate/usr/src/uts/common/fs/zfs/lua/
H A Dlstring.c70 luaM_reallocvector(L, tb->hash, tb->size, newsize, GCObject *); in luaS_resize()
71 for (i = tb->size; i < newsize; i++) tb->hash[i] = NULL; in luaS_resize()
75 GCObject *p = tb->hash[i]; in luaS_resize()
76 tb->hash[i] = NULL; in luaS_resize()
80 gch(p)->next = tb->hash[h]; /* chain it */ in luaS_resize()
81 tb->hash[h] = p; in luaS_resize()
88 lua_assert(tb->hash[newsize] == NULL && tb->hash[tb->size - 1] == NULL); in luaS_resize()
105 ts->tsv.hash = h; in createstrobj()
123 list = &tb->hash[lmod(h, tb->size)]; in newshrstr()
137 for (o = g->strt.hash[lmod(h, g->strt.size)]; in internshrstr()
[all …]
/illumos-gate/usr/src/uts/common/io/sfxge/
H A Dsfxge_hash.c54 uint32_t hash = 0; in toeplitz_hash() local
56 hash ^= cache[pos * (UINT8_MAX + 1) + *input]; in toeplitz_hash()
59 return (hash); in toeplitz_hash()
66 uint32_t hash = 0; in sfxge_toeplitz_hash() local
69 hash ^= toeplitz_hash(sp->s_toeplitz_cache, src_addr, pos, addr_size); in sfxge_toeplitz_hash()
71 hash ^= toeplitz_hash(sp->s_toeplitz_cache, dst_addr, pos, addr_size); in sfxge_toeplitz_hash()
74 hash ^= toeplitz_hash(sp->s_toeplitz_cache, in sfxge_toeplitz_hash()
77 hash ^= toeplitz_hash(sp->s_toeplitz_cache, in sfxge_toeplitz_hash()
80 return (hash); in sfxge_toeplitz_hash()

12345678910>>...19