Home
last modified time | relevance | path

Searched refs:hash (Results 1 – 25 of 461) 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
163 #define MH_KEYCMP(hash, key1, key2) ((hash->mh_keycmp)(key1, key2)) argument
207 uint_t hash = 0; in mod_hash_bystr() local
213 hash = (hash << 4) + *p; in mod_hash_bystr()
214 if ((g = (hash & 0xf0000000)) != 0) { in mod_hash_bystr()
215 hash ^= (g >> 24); in mod_hash_bystr()
216 hash ^= g; in mod_hash_bystr()
219 return (hash); in mod_hash_bystr()
317 mod_hash_destroy_ptrhash(mod_hash_t *hash) in mod_hash_destroy_ptrhash() argument
[all …]
/illumos-gate/usr/src/lib/libtecla/common/
H A Dhash.c91 static HashNode *_del_HashNode(HashTable *hash, HashNode *node);
92 static HashNode *_new_HashNode(HashTable *hash, const char *name, int code,
94 static HashNode *_find_HashNode(HashTable *hash, HashBucket *bucket,
96 static HashBucket *_find_HashBucket(HashTable *hash, const char *name);
214 HashTable *hash; /* The table to be returned */ in _new_HashTable() local
235 hash = (HashTable *) _new_FreeListNode(mem->hash_memory); in _new_HashTable()
236 if(!hash) { in _new_HashTable()
247 hash->mem = mem; in _new_HashTable()
248 hash->internal_mem = allocate_mem; in _new_HashTable()
249 hash->case_sensitive = hcase==HONOUR_CASE; in _new_HashTable()
[all …]
/illumos-gate/usr/src/common/ficl/
H A Dhash.c3 #define FICL_ASSERT_PHASH(hash, expression) FICL_ASSERT(NULL, expression) argument
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()
70 ficlHashInsertWord(ficlHash *hash, ficlWord *word) in ficlHashInsertWord() argument
74 FICL_ASSERT_PHASH(hash, hash); in ficlHashInsertWord()
75 FICL_ASSERT_PHASH(hash, word); in ficlHashInsertWord()
[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.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()
227 ficlHash *hash; in ficlPrimitiveFiclWordlist() local
233 hash = ficlDictionaryCreateWordlist(dictionary, nBuckets); in ficlPrimitiveFiclWordlist()
234 ficlStackPushPointer(vm->dataStack, hash); in ficlPrimitiveFiclWordlist()
285 ficlHash *hash; in ficlPrimitiveWidGetName() local
[all …]
/illumos-gate/usr/src/contrib/ast/src/lib/libast/cdt/
H A Ddthash.c50 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->data.size) : n; in htable()
68 if((n = k) <= hash->tblz) in htable()
79 for(endt = (t = hash->htbl) + hash->tblz; t < endt; ++t) in htable()
87 if(hash->htbl) /* free old table and set new table */ in htable()
88 (void)(*dt->memoryf)(dt, hash->htbl, 0, disc); in htable()
89 hash->htbl = htbl; in htable()
90 hash->tblz = n; in htable()
[all …]
/illumos-gate/usr/src/cmd/nscd/
H A Dnscd_dbimpl.c75 nscd_hash_t *hash; /* the current hash entry */ member
166 unsigned long hash; in _nscd_get_db_entry() local
172 hash = calc_hash(str); in _nscd_get_db_entry()
173 idx_p = db->hash_tbl_p[hash % db->array_size]; in _nscd_get_db_entry()
195 unsigned long hash; in _nscd_add_db_entry() local
201 hash = calc_hash(str); in _nscd_add_db_entry()
202 i = hash % db->array_size; in _nscd_add_db_entry()
293 unsigned long hash; in _nscd_delete_db_entry() local
298 hash = calc_hash(str); in _nscd_delete_db_entry()
299 i = hash % db->array_size; in _nscd_delete_db_entry()
[all …]
/illumos-gate/usr/src/tools/smatch/src/
H A Dstorage.c26 unsigned hash = hashval(bb) + hashval(pseudo) + hashval(inout); in storage_hash() local
27 hash += hash / MAX_STORAGE_HASH; in storage_hash()
28 return hash & (MAX_STORAGE_HASH-1); in storage_hash()
52 struct storage_hash *hash; in gather_storage() local
53 FOR_EACH_PTR(storage_hash_table[i], hash) { in gather_storage()
54 if (hash->bb == bb && hash->inout == inout) in gather_storage()
55 add_ptr_list(&list, hash); in gather_storage()
56 } END_FOR_EACH_PTR(hash); in gather_storage()
78 struct storage_hash *hash; in name_storage() local
79 FOR_EACH_PTR(storage_hash_table[i], hash) { in name_storage()
[all …]
/illumos-gate/usr/src/uts/common/inet/ilb/
H A Dilb_conn.c104 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
139 hash = connp->conn_c2s_hash; in ilb_conn_remove_common()
140 ASSERT(MUTEX_HELD(&hash->ilb_conn_hash_lock)); in ilb_conn_remove_common()
148 hash = connp->conn_s2c_hash; in ilb_conn_remove_common()
149 ASSERT(MUTEX_HELD(&hash->ilb_conn_hash_lock)); in ilb_conn_remove_common()
158 if (hash->ilb_connp == connp) { in ilb_conn_remove_common()
159 hash->ilb_connp = *next; in ilb_conn_remove_common()
168 ASSERT(hash->ilb_conn_cnt > 0); in ilb_conn_remove_common()
[all …]
/illumos-gate/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 *);
/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()
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[hashValue]; in Bt2_MatchFinder_GetMatches()
[all …]
/illumos-gate/usr/src/common/mc/zen_umc/
H A Dzen_umc_dump.c115 zen_umc_dump_chan_hash(umc_chan_hash_t *hash) in zen_umc_dump_chan_hash() argument
119 fnvlist_add_uint32(nvl, "uch_flags", hash->uch_flags); in zen_umc_dump_chan_hash()
121 if (hash->uch_flags & UMC_CHAN_HASH_F_BANK) { in zen_umc_dump_chan_hash()
127 hash->uch_bank_hashes[i].ubh_row_xor); in zen_umc_dump_chan_hash()
129 hash->uch_bank_hashes[i].ubh_col_xor); in zen_umc_dump_chan_hash()
131 hash->uch_bank_hashes[i].ubh_en); in zen_umc_dump_chan_hash()
141 if (hash->uch_flags & UMC_CHAN_HASH_F_RM) { in zen_umc_dump_chan_hash()
147 hash->uch_rm_hashes[i].uah_addr_xor); in zen_umc_dump_chan_hash()
149 hash->uch_rm_hashes[i].uah_en); in zen_umc_dump_chan_hash()
159 if (hash->uch_flags & UMC_CHAN_HASH_F_CS) { in zen_umc_dump_chan_hash()
[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/lib/libnsl/yp/
H A Ddbm.c125 long hash; in forder() local
127 hash = calchash(key); in forder()
129 blkno = hash & hmask; in forder()
263 long hash; in nextkey() local
270 hash = calchash(key); in nextkey()
271 dbm_access(hash); in nextkey()
286 hash = hashinc(hash); in nextkey()
287 if (hash == 0) in nextkey()
289 return (firsthash(hash)); in nextkey()
293 firsthash(long hash) in firsthash() argument
[all …]
/illumos-gate/usr/src/lib/libcpc/common/
H A Dsubr.c161 __cpc_strhash_free(cpc_strhash_t *hash) in __cpc_strhash_free() argument
163 cpc_strhash_t *p = hash, *f; in __cpc_strhash_free()
182 __cpc_strhash_add(cpc_strhash_t *hash, char *key) in __cpc_strhash_add() argument
186 for (p = hash; p != NULL; p = p->next) { in __cpc_strhash_add()
195 tmp = hash->next; in __cpc_strhash_add()
196 hash->next = p; in __cpc_strhash_add()
202 hash->cur = p; in __cpc_strhash_add()
208 __cpc_strhash_next(cpc_strhash_t *hash) in __cpc_strhash_next() argument
212 if (hash->cur != NULL) { in __cpc_strhash_next()
213 p = hash->cur; in __cpc_strhash_next()
[all …]
/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/ucblib/libdbm/
H A Ddbm.c55 void dbm_access(long hash);
134 long hash; in forder() local
136 hash = calchash(key); in forder()
138 blkno = hash & hmask; in forder()
284 long hash; in nextkey() local
287 hash = calchash(key); in nextkey()
288 dbm_access(hash); in nextkey()
303 hash = hashinc(hash); in nextkey()
304 if (hash == 0) in nextkey()
306 return (firsthash(hash)); in nextkey()
[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
91 entry = &h->ht_entries[hash % h->ht_nentries]; in ht_find_locked()
94 if (item->hti_hash == hash) in ht_find_locked()
102 ht_add(struct ht *h, uint32_t hash, void *value) in ht_add() argument
111 entry = &h->ht_entries[hash % h->ht_nentries]; in ht_add()
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
[all …]
/illumos-gate/usr/src/cmd/refer/
H A Dinv6.c25 int hash = 0, hused = 0; in whash() local
45 if (hash < k) { in whash()
49 hfreq[hash] = ct; in whash()
50 while (hash < k) { in whash()
51 hpt[++hash] = lp; in whash()
52 hfreq[hash] = 0; in whash()
54 hpt[hash] = lp += iflong ? sizeof (long) : sizeof (int); in whash()
69 while (hash < nhash) in whash()
70 hpt[++hash] = lp; in whash()
/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/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/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/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()
194 if (e->e_hash == hash && h->h_equal(e->e_key, key)) in h_put()
200 indx = hash % h->h_tableSize; in h_put()
204 e->e_hash = hash; in h_put()
[all …]
/illumos-gate/usr/src/contrib/ast/src/lib/libast/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 …]
/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()
79 unsigned int h = lmod(gco2ts(p)->hash, newsize); /* new position */ 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()
89 luaM_reallocvector(L, tb->hash, tb->size, newsize, GCObject *); in luaS_resize()
105 ts->tsv.hash = h; in createstrobj()
[all …]

12345678910>>...19