Searched refs:hash (Results 301 - 325 of 401) sorted by relevance

<<11121314151617

/illumos-gate/usr/src/uts/common/fs/nfs/
H A Dnfs_subr.c83 * The hash queues for the access to active and cached rnodes
85 * for each hash bucket is used to control access and to synchronize
86 * lookups, additions, and deletions from the hash queue.
93 * a hash queue and the exclusive lock to the hash queue be held.
94 * If an rnode is not hashed into a hash queue, then it is destroyed
96 * about the file. The exclusive lock to the hash queue must be
97 * held in order to prevent a lookup in the hash queue from finding
99 * freelist. The lookup in the hash queue will have the hash queu
2440 ulong_t hash, len, i; local
[all...]
/illumos-gate/usr/src/uts/common/vm/
H A Dseg_vn.c340 * mapping share the same amp. amp's are looked up in svntr_hashtab hash table
368 * implement this functionality hash entries are timestamped. Replica's can
370 * saved when hash entry was created. However just timestamps alone are not
5468 * locking scheme with per amp rwlock and a global set of hash
8771 * set of pages and lead to long hash chains that decrease pcache lookup
9725 * exist in svntr hash table create a new one. We may fail to bind to amp if
9740 ulong_t hash = SVNTR_HASH_FUNC(vp); local
9798 mutex_enter(&svntr_hashtab[hash].tr_lock);
9806 mutex_exit(&svntr_hashtab[hash].tr_lock);
9811 svntrp = svntr_hashtab[hash]
10024 ulong_t hash = SVNTR_HASH_FUNC(vp); local
10114 ulong_t hash = SVNTR_HASH_FUNC(vp); local
10187 ulong_t hash; local
10209 segvn_trupdate_seg(struct seg *seg, segvn_data_t *svd, svntr_t *svntrp, ulong_t hash) argument
[all...]
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dzap.c31 * The zdir is an extendable hash data structure. There is a table of
38 * by the pointer at index i in the table holds entries whose hash value
334 * The pointer table should never use more hash bits than we
492 * There should be more hash entries than there can be
493 * chunks to put in the hash table
497 /* The chunks should begin at the end of the hash table */
616 uint64_t hash = zn->zn_hash; local
625 ASSERT3U(ZAP_HASH_IDX(hash, old_prefix_len), ==,
650 err = zap_deref_leaf(zap, hash, tx, RW_WRITER, &l);
662 ASSERT3U(ZAP_HASH_IDX(hash, old_prefix_le
[all...]
H A Dzap_micro.c110 * disk, but didn't hash it, so we need to
111 * continue to not hash it. (The
273 mze_insert(zap_t *zap, int chunkid, uint64_t hash) argument
282 mze->mze_hash = hash;
319 mze_find_unused_cd(zap_t *zap, uint64_t hash) argument
330 mze_tofind.mze_hash = hash;
335 mze && mze->mze_hash == hash; mze = AVL_NEXT(avl, mze)) {
609 /* XXX destroy the avl later, so we can use the stored hash value */
1337 * (28-bit) hash value so we can fit 4 bits of cd into the low 32-bits
1340 * [ collision differentiator | zap_hashbits()-bit hash valu
[all...]
/illumos-gate/usr/src/boot/sys/boot/zfs/
H A Dzfsimpl.c1411 uint64_t hash; local
1433 hash = zap_hash(zh.zap_salt, name);
1438 off_t off = ptrtbl[hash >> (64 - zh.zap_ptrtbl.zt_shift)] << zl.l_bs;
1448 * Make sure this chunk matches our hash.
1452 != hash >> (64 - zl.l_phys->l_hdr.lh_prefix_len))
1459 int h = (hash >> shift) & ((1 << ZAP_LEAF_HASH_SHIFT(&zl)) - 1);
1464 while (zc->l_entry.le_hash != hash) {
/illumos-gate/usr/src/cmd/sgs/include/
H A Drtld.h635 uint_t pn_hash; /* path name hash value */
1047 * The symbols hash value is computed by lookup_sym, and propagated throughout
1050 * elf_find_sym(), in which case the caller must initialize the hash value.
1065 ulong_t sl_hash; /* symbol hash value */
1074 #define SLOOKUP_INIT(sl, name, cmap, imap, id, hash, rsymndx, rsym, rtype, \
1077 sl.sl_id = (id), sl.sl_hash = (hash), sl.sl_rsymndx = (rsymndx), \
/illumos-gate/usr/src/cmd/geniconvtbl/
H A Ditm_comp.l58 MAPTYPE_NAME (automatic|dense|index|hash|binary)
204 "@hash", MAPTYPE_HASH,
241 "hash", MAPTYPE_HASH,
/illumos-gate/usr/src/uts/common/ipp/
H A Dippconf.c169 static int hash(const char *);
2150 * Find the hash bucket where the module structure should be.
2153 hb = hash(modname);
2201 * Find the right hash bucket for a module of the given name.
2204 hb = hash(modname);
2253 * Set the reference and link it into the hash bucket.
2283 * Find the hash bucket where the module structure should be.
2286 hb = hash(imp->ippm_name);
2832 * Find the hash bucket where the action structure should be.
2835 hb = hash(anam
3224 hash( function
[all...]
/illumos-gate/usr/src/lib/libpp/common/
H A Dpp.h57 #include <hash.h>
163 #define PP_NOHASH 33 /* don't hash PP_COMPILE T_ID's */
378 HASH_HEADER; /* hash stuff and symbol name */
395 Hash_table_t* symtab; /* macro and id hash table */
/illumos-gate/usr/src/cmd/csh/
H A Dsh.h541 * to hash execs. If it is allocated (havhash true), then to tell
544 * hash(hashname("name"), i). This is setup automatically
547 * The two part hash function is designed to let texec() call the
548 * more expensive hashname() only once and the simple hash() several
564 #define hash(a, b) ((a) * HSHMUL + (b) & HSHMASK) macro
/illumos-gate/usr/src/cmd/awk/
H A Dawk.h112 Cell **tab; /* hash table pointers */
312 extern int hash(uchar *, int);
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/ftp/
H A Dftp_var.h105 EXTERN int hash; /* print # for each buffer transferred */ variable
/illumos-gate/usr/src/uts/common/os/
H A Dmsg.c183 * a negative message type. Unlike msg_wait_snd, the hash bucket
186 * negative message types that hash outside of MSG_MAX_QNUM - 1.
1286 long hash = -msg_type / MSG_NEG_INTERVAL; local
1293 if (hash > MSG_MAX_QNUM)
1294 hash = MSG_MAX_QNUM;
1295 return (hash);
1300 * message receivers of type 0, the other buckets we hash into.
1382 * The lowest hash bucket may actually contain
/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/
H A Dadb_openclose.c154 db->info.hash = NULL;
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Dmemory.c61 * number of hash locations remaining in the page hash table when
66 * hash table), and that pw_first is only used when reading the pages
101 * hash. hashloc is set the start of the page hash
103 * we aren't currently following a hash chain, and that
104 * we need to scan the page hash table for a page.
181 * the page hash table until we find a page.
186 * Iterate through the page hash table until we
308 struct vn_htable_list *vn_h_next; /* hash tabl
1584 int hash; local
[all...]
/illumos-gate/usr/src/grub/grub-0.97/stage2/
H A Dfsys_zfs.c725 uint64_t hash, idx, blkid; local
733 hash = zap_hash(zap->zap_salt, name);
742 idx = ZAP_HASH_IDX(hash, zap->zap_ptrtbl.zt_shift);
753 return (zap_leaf_lookup(l, blksft, hash, name, value));
/illumos-gate/usr/src/uts/common/io/usbgem/
H A Dusbgem.h78 uint32_t hash; member in struct:mcast_addr
/illumos-gate/usr/src/cmd/abi/appcert/scripts/
H A DAppcertUtil.pm392 # Returns a "neededs hash" as output. The keys being the things needed
394 # " => "). It returns the null hash if it had trouble, usually only if
443 # will do nothing and thus the empty hash will be
472 my (%hash, $key);
474 %hash = all_ldd_neededs($filename);
475 foreach $key (keys(%hash)) {
476 $str .= "$key $hash{$key}\n";
1746 # into a hash or two, e.g.
/illumos-gate/usr/src/cmd/ipf/tools/
H A Dip_fil.c880 u_char hash[16]; local
885 * Compute the base value of the ISS. It is a hash
898 MD5Final(hash, &ctx);
900 memcpy(&newiss, hash, sizeof(newiss));
/illumos-gate/usr/src/cmd/sgs/rtld/common/
H A Dcap.c1004 uint_t hash = sgs_str_hash(name); local
1009 if (pnavl_recorded(&capavl, name, hash, &where))
1014 pnp->pn_hash = hash;
/illumos-gate/usr/src/cmd/make/lib/mksh/
H A Dmisc.cc220 np->hash.length = length;
866 append_string(name->string_mb, &string, name->hash.length);
883 append_string(name->string_mb, &string, name->hash.length);
/illumos-gate/usr/src/common/ctf/
H A Dctf_create.c58 ctf_dtdef_t **hash = ctf_alloc(hashlen * sizeof (ctf_dtdef_t *)); local
62 if (hash == NULL)
74 ctf_free(hash, hashlen * sizeof (ctf_dtdef_t *));
80 bzero(hash, hashlen * sizeof (ctf_dtdef_t *));
81 fp->ctf_dthash = hash;
1322 * If the non-empty name was not found in the appropriate hash, search
/illumos-gate/usr/src/uts/common/fs/ufs/
H A Dufs_acl.c1833 * signature - the signature for the acl for lookup in the hash table
1841 int hash; local
1850 hash = SI_HASH(signature);
1851 for (tspp = &si_cachea[hash]; *tspp; tspp = &(*tspp)->s_next) {
1888 hash = SI_HASH(sp->s_shadow);
1889 for (tspp = &si_cachei[hash]; *tspp; tspp = &(*tspp)->s_forw) {
1907 * Alloc the hash buckets for the si cache & initialize
/illumos-gate/usr/src/uts/common/io/mac/
H A Dmac_flow.c309 * Flent is valid. now calculate hash and insert it
310 * into hash table.
338 * Insert flow to hash list.
349 * Save the hash index so it can be used by mac_flow_remove().
805 * been removed from the global flow hash.
915 * into a potentially diference hash line. The hash depends on
1041 * Add a new flow entry to the global flow hash table
1055 /* Mark as inserted into the global flow hash table */
1062 * Remove a flow entry from the global flow hash tabl
1603 uint32_t hash = 5381; local
[all...]
/illumos-gate/usr/src/cmd/mdb/common/modules/dtrace/
H A Ddtrace.c1176 uintptr_t *hash, addr; local
1190 hash = mdb_alloc(DTRACE_ERRHASHSZ * sizeof (uintptr_t),
1194 hash[i] = addr + i * sizeof (dtrace_errhash_t);
1196 qsort(hash, DTRACE_ERRHASHSZ, sizeof (uintptr_t), dtrace_errhash_cmp);
1199 wsp->walk_data = hash;
1208 uintptr_t *hash = wsp->walk_data; local
1216 addr = hash[ndx];
1773 mdb_warn("failed to read hash at %p",
1860 mdb_warn("failed to read hash at %p",
2153 * Now pick the largest prime smaller than the hash siz
[all...]

Completed in 188 milliseconds

<<11121314151617