Home
last modified time | relevance | path

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

12345678910>>...18

/titanic_50/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 …]
/titanic_50/usr/src/tools/ctf/cvt/
H A Dhash.c43 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()
106 hash_add(hash_t *hash, void *key) in hash_add() argument
108 int bucket = hash->h_hashfn(hash->h_nbuckets, key); in hash_add()
[all …]
/titanic_50/usr/src/lib/libtecla/common/
H A Dhash.c93 static HashNode *_del_HashNode(HashTable *hash, HashNode *node);
94 static HashNode *_new_HashNode(HashTable *hash, const char *name, int code,
96 static HashNode *_find_HashNode(HashTable *hash, HashBucket *bucket,
98 static HashBucket *_find_HashBucket(HashTable *hash, const char *name);
216 HashTable *hash; /* The table to be returned */ in _new_HashTable() local
237 hash = (HashTable *) _new_FreeListNode(mem->hash_memory); in _new_HashTable()
238 if(!hash) { in _new_HashTable()
249 hash->mem = mem; in _new_HashTable()
250 hash->internal_mem = allocate_mem; in _new_HashTable()
251 hash->case_sensitive = hcase==HONOUR_CASE; in _new_HashTable()
[all …]
/titanic_50/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()
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, char *key) in nsc_remove_node() argument
101 if (!hash[ index ]) { in nsc_remove_node()
[all …]
/titanic_50/usr/src/cmd/nscd/
H A Dnscd_dbimpl.c77 nscd_hash_t *hash; /* the current hash entry */ member
168 unsigned long hash; in _nscd_get_db_entry() local
174 hash = calc_hash(str); in _nscd_get_db_entry()
175 idx_p = db->hash_tbl_p[hash % db->array_size]; in _nscd_get_db_entry()
197 unsigned long hash; in _nscd_add_db_entry() local
203 hash = calc_hash(str); in _nscd_add_db_entry()
204 i = hash % db->array_size; in _nscd_add_db_entry()
295 unsigned long hash; in _nscd_delete_db_entry() local
300 hash = calc_hash(str); in _nscd_delete_db_entry()
301 i = hash % db->array_size; in _nscd_delete_db_entry()
[all …]
/titanic_50/usr/src/uts/common/io/drm/
H A Ddrm_auth.c55 int hash; in drm_find_file() local
57 hash = drm_hash_magic(magic); in drm_find_file()
58 for (pt = dev->magiclist[hash].head; pt; pt = pt->next) { in drm_find_file()
71 int hash; in drm_add_magic() local
74 hash = drm_hash_magic(magic); in drm_add_magic()
83 if (dev->magiclist[hash].tail) { in drm_add_magic()
84 dev->magiclist[hash].tail->next = entry; in drm_add_magic()
85 dev->magiclist[hash].tail = entry; in drm_add_magic()
87 dev->magiclist[hash].head = entry; in drm_add_magic()
88 dev->magiclist[hash].tail = entry; in drm_add_magic()
[all …]
/titanic_50/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 *);
/titanic_50/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
136 hash = connp->conn_c2s_hash; in ilb_conn_remove_common()
137 ASSERT(MUTEX_HELD(&hash->ilb_conn_hash_lock)); in ilb_conn_remove_common()
145 hash = connp->conn_s2c_hash; in ilb_conn_remove_common()
146 ASSERT(MUTEX_HELD(&hash->ilb_conn_hash_lock)); in ilb_conn_remove_common()
155 if (hash->ilb_connp == connp) { in ilb_conn_remove_common()
156 hash->ilb_connp = *next; in ilb_conn_remove_common()
165 ASSERT(hash->ilb_conn_cnt > 0); in ilb_conn_remove_common()
[all …]
/titanic_50/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 …]
/titanic_50/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()
/titanic_50/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); \
/titanic_50/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_50/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 …]
/titanic_50/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) in firsthash() argument
[all …]
/titanic_50/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_50/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 == 0) in nextkey()
302 return (firsthash(hash)); in nextkey()
[all …]
/titanic_50/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()
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) + function.hashCode(); in hashCode()
450 hash = (37 * hash) + name.hashCode(); in hashCode()
451 return hash; in hashCode()
H A DProgramInfo.java208 int hash = 17; in hashCode() local
209 hash = (37 * hash) + minimumProbeAttributes.hashCode(); in hashCode()
210 hash = (37 * hash) + minimumStatementAttributes.hashCode(); in hashCode()
211 hash = (37 * hash) + matchingProbeCount; in hashCode()
212 return hash; in hashCode()
/titanic_50/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()
/titanic_50/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 …]
/titanic_50/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_50/usr/src/cmd/sgs/tools/common/
H A Dstrhash.c41 uint_t hash = 5381; in sgs_str_hash() local
45 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */ in sgs_str_hash()
46 return (hash); in sgs_str_hash()
/titanic_50/usr/src/cmd/ldmad/
H A Dmdesc_lib.c46 uint32_t hash = 0; in md_byte_hash() local
51 hash = (hash >> 27) | (hash << 5) | bp[i]; in md_byte_hash()
54 return (hash); in md_byte_hash()
61 uint32_t hash; in md_find_string() local
63 hash = md_byte_hash((uint8_t *)strp, strlen(strp)); in md_find_string()
66 *hashp = hash; in md_find_string()
69 if (msp->hash == hash && strcmp(msp->strp, strp) == 0) in md_find_string()
80 uint32_t hash; in md_new_string() local
82 msp = md_find_string(mdp, strp, &hash); in md_new_string()
93 msp->hash = hash; in md_new_string()
[all …]
/titanic_50/usr/src/grub/grub-0.97/netboot/
H A Dtlan.h487 u8 hash; in TLan_HashFunc() local
489 hash = (a[0] ^ a[3]); /* & 077 */ in TLan_HashFunc()
490 hash ^= ((a[0] ^ a[3]) >> 6); /* & 003 */ in TLan_HashFunc()
491 hash ^= ((a[1] ^ a[4]) << 2); /* & 074 */ in TLan_HashFunc()
492 hash ^= ((a[1] ^ a[4]) >> 4); /* & 017 */ in TLan_HashFunc()
493 hash ^= ((a[2] ^ a[5]) << 4); /* & 060 */ in TLan_HashFunc()
494 hash ^= ((a[2] ^ a[5]) >> 2); /* & 077 */ in TLan_HashFunc()
496 return (hash & 077); in TLan_HashFunc()
511 u32 hash; in TLan_HashFunc() local
513 hash = in TLan_HashFunc()
[all …]

12345678910>>...18