Searched defs:hash (Results 201 - 225 of 263) sorted by relevance

1234567891011

/illumos-gate/usr/src/cmd/idmap/idmapd/
H A Ddbutils.c3309 uint_t hash, next; local
3312 hash = next = gethash(prefix, rid, htsize);
3318 if (hash == next)
3320 state->sid_history[next].next = state->sid_history[hash].next;
3321 state->sid_history[hash].next = next;
/illumos-gate/usr/src/cmd/keyserv/
H A Dsetkey.c460 int hash = HASH_UID(uid); local
462 debug(KEYSERV_DEBUG, ("mapuid2cache %d %d %x", uid, hash, mdp));
463 for (cpp = &mdp->bucket[hash];
781 int hash = HASH_UID(uid); local
784 for (l = &g_secretkey_netname[hash]; *l != NULL && (*l)->uid != uid;
965 int hash = HASH_UID(uid); local
968 for (l = g_secretkey_netname[hash]; l != NULL; l = l->next) {
1163 readcache(pub, sec, deskey, hash)
1167 int hash;
1171 for (l = &g_cachedkeys[hash]; (*
1242 int hash = HASH_UID(uid); local
1289 int hash; local
1348 int hash = 0; local
1368 int hash = hash_keys3(public, secret); local
1652 int hash; local
1739 int hash = HASH_UID(uid); local
1831 int hash = 0; local
[all...]
/illumos-gate/usr/src/cmd/sgs/rtld/common/
H A Danalyze.c797 uint_t hash = sgs_str_hash(name); local
799 if (((lmp = fpavl_recorded(lml, name, hash, &where)) != NULL) &&
803 if (pnavl_recorded(&nfavl, name, hash, NULL)) {
1147 uint_t hash = sgs_str_hash(nname); local
1150 if ((nname = stravl_insert(fdp->fd_nname, hash, 0, 0)) == NULL)
1164 if ((nlmp = fpavl_recorded(lml, nname, hash,
1169 if (pnavl_recorded(&nfavl, nname, hash, &nfavlwhere)) {
3164 * To improve ELF performance, we first compute the ELF hash value and pass
H A Delf.c1312 * Compute the elf hash value (as defined in the ELF access library).
1313 * The form of the hash table is:
1350 ulong_t hash = slp->sl_hash; local
1369 hashoff = ((uint_t)hash % buckets) + 2;
1372 * Get the first symbol from the hash chain and initialize the string
1388 * names don't match continue with the next hash entry.
2510 * symbol lookup hash table.
2516 * If we don't have a .hash table there are no symbols
/illumos-gate/usr/src/cmd/ldapcachemgr/
H A Dcachemgr_getldap.c202 * Calculate a hash for a string
203 * Based on elf_hash algorithm, hash is case insensitive
224 * Remove a hash table entry.
245 * Scan a hash table hit for a matching hash entry.
304 unsigned long hash; local
351 hash = getldap_hash(from) % CACHE_HASH_MAX;
353 idx = hashTbl[hash];
383 hashTbl[hash] = newp;
395 hash
[all...]
/illumos-gate/usr/src/uts/common/inet/ipf/
H A Dip_fil_solaris.c1517 u_char hash[16]; local
1523 * Compute the base value of the ISS. It is a hash
1536 MD5Final(hash, &ctx);
1538 bcopy(hash, &newiss, sizeof(newiss));
/illumos-gate/usr/src/uts/common/io/
H A Dcryptmod.c341 /* Need extra space for hash and counfounder */
701 * Get a SHA1 hash on the input data.
714 * Get an MD5 hash on the input data.
1573 hash_info_t *hash)
1606 (char *)hmacbuff, hash->hash_len);
1655 hash_info_t *hash)
1685 (char *)hmacbuff, hash->hash_len);
1746 hash_info_t *hash)
1776 * at the head of the mblk for the confounder and hash info.
1784 cipherlen = inlen - hash
1572 aes_decrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
1654 aes_encrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
1745 arcfour_hmac_md5_decrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
1978 arcfour_hmac_md5_encrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
2235 des_cbc_encrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
2397 des_cbc_decrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
[all...]
/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/uts/common/sys/fibre-channel/fca/oce/
H A Doce_hw_eth.h654 uint32_t hash[10]; member in struct:mbx_config_nic_rss::__anon7747::__anon7748
662 uint32_t hash[10];
/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...]
H A Dmac_sched.c128 * hence the invariant that fanout always hash a given flow to the same
547 * | | v hash % nrings v
882 * same * +===========+ v from hash v
883 * hash | | +===============+
888 * hash or
895 * v Applies hash based on aggr v
1437 * hash based on the src address, dst address and the port information.
1711 uint_t hash; local
1779 * Extract next-header, full header length, and source-hash value
1836 hash
1905 uint_t hash; local
3786 uint64_t hash; local
3932 uint_t indx, hash; local
[all...]
/illumos-gate/usr/src/uts/common/io/myri10ge/firmware/
H A Dmyri10ge_mcp.h63 /* Place hash value at the top so it gets written before length.
66 uint32_t hash; member in struct:mcp_slot_8
72 /* Two bits of length in mcp_slot are used to indicate hash type. */
338 * data1 = hash type
/illumos-gate/usr/src/uts/common/rpc/
H A Dclnt_clts.c158 * Response completion hash queue
2093 uint_t hash; local
2155 hash = call_hash(xid, clnt_clts_hash_size);
2156 chtp = &clts_call_ht[hash];
2157 /* call_table_find returns with the hash bucket locked */
/illumos-gate/usr/src/lib/libc/port/threads/
H A Dsynch.c464 * Allocate the sleep queue hash table.
867 /* empty queue root; just delete from the hash list */
1931 uint_t hash = LOCK_HASH(mp); local
1953 for (rlp = table[hash]; rlp != NULL; rlp = rlp->robust_next) {
1965 for (rlpp = &table[hash];
1991 * the hash table and to the global list.
2029 * Do this by traversing the global list, not the hash table.
/illumos-gate/usr/src/uts/common/vm/
H A Dvm_usage.c190 * hash of visited objects (vnodes or shared amps)
425 "vmusage vnode hash", VMUSAGE_HASH_SIZE, vmu_free_object,
428 "vmusage amp hash", VMUSAGE_HASH_SIZE, vmu_free_object,
431 "vmusage collapsed project hash", VMUSAGE_HASH_SIZE,
434 "vmusage collapsed ruser hash", VMUSAGE_HASH_SIZE,
437 "vmusage collpased euser hash", VMUSAGE_HASH_SIZE,
440 "vmusage zone hash", VMUSAGE_HASH_SIZE, vmu_free_zone);
480 "vmusage vnode hash", VMUSAGE_HASH_SIZE, vmu_free_object,
485 "vmusage amp hash", VMUSAGE_HASH_SIZE, vmu_free_object,
490 "vmusage anon hash", VMUSAGE_HASH_SIZ
599 vmu_find_insert_object(mod_hash_t *hash, caddr_t key, uint_t type) argument
616 vmu_find_insert_anon(mod_hash_t *hash, caddr_t key) argument
636 vmu_find_insert_entity(mod_hash_t *hash, id_t id, uint_t type, id_t zoneid) argument
[all...]
H A Dvm_anon.c138 * Global hash table for (vp, off) -> anon slot
253 * Global anon slot hash table manipulation.
3607 int hash; local
3619 hash = ANON_ARRAY_HASH(amp, an_idx);
3620 sobj->sync_mutex = mtx = &anon_array_lock[hash].pad_mutex;
3621 sobj->sync_cv = cv = &anon_array_cv[hash];
3637 int hash; local
3651 hash = ANON_ARRAY_HASH(amp, an_idx);
3652 sobj->sync_mutex = mtx = &anon_array_lock[hash].pad_mutex;
3653 sobj->sync_cv = &anon_array_cv[hash];
[all...]
/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/lib/libdtrace/common/
H A Ddt_aggregate.c442 dt_ahash_t *hash = &agp->dtat_hash; local
472 if (hash->dtah_hash == NULL) {
475 hash->dtah_size = DTRACE_AHASHSIZE;
476 size = hash->dtah_size * sizeof (dt_ahashent_t *);
478 if ((hash->dtah_hash = malloc(size)) == NULL)
481 bzero(hash->dtah_hash, size);
542 ndx = hashval % hash->dtah_size;
544 for (h = hash->dtah_hash[ndx]; h != NULL; h = h->dtahe_next) {
681 if (hash->dtah_hash[ndx] != NULL)
682 hash
1200 dt_ahash_t *hash = &agp->dtat_hash; local
1216 dt_ahash_t *hash = &agp->dtat_hash; local
1282 dt_ahash_t *hash = &dtp->dt_aggregate.dtat_hash; local
1306 dt_ahash_t *hash = &agp->dtat_hash; local
1417 dt_ahash_t *hash = &agp->dtat_hash; local
1531 dt_ahash_t *hash = &agp->dtat_hash; local
1676 dt_ahash_t *hash = &agp->dtat_hash; local
2137 dt_ahash_t *hash = &agp->dtat_hash; local
2163 dt_ahash_t *hash = &agp->dtat_hash; local
[all...]
/illumos-gate/usr/src/common/ficl/
H A Dficl.h521 * Default size of hash table. For most uniform
1204 ficlUnsigned16 hash; member in struct:ficlWord
1313 * Ficl hash table - variable size.
1323 unsigned size; /* number of buckets in the hash */
1327 FICL_PLATFORM_EXTERN void ficlHashForget(ficlHash *hash, void *where);
1329 FICL_PLATFORM_EXTERN void ficlHashInsertWord(ficlHash *hash, ficlWord *word);
1331 ficlHashLookup(ficlHash *hash, ficlString name, ficlUnsigned16 hashCode);
1332 FICL_PLATFORM_EXTERN void ficlHashReset(ficlHash *hash);
1344 * linked into the hash table. If unsuccessful, dictUnsmudge
/illumos-gate/usr/src/uts/common/fs/zfs/
H A Dsa.c406 uint64_t lot_num, uint64_t hash, boolean_t zapadd, dmu_tx_t *tx)
420 tb->lot_hash = hash;
448 /* verify we don't have a hash collision */
450 for (; findtb && findtb->lot_hash == hash;
462 sa_find_layout(objset_t *os, uint64_t hash, sa_attr_type_t *attrs, argument
471 tbsearch.lot_hash = hash;
475 for (; tb && tb->lot_hash == hash;
485 avl_numnodes(&sa->sa_layout_num_tree), hash, B_TRUE, tx);
649 uint64_t hash; local
721 for (i = 0, len_idx = 0, hash
405 sa_add_layout_entry(objset_t *os, sa_attr_type_t *attrs, int attr_count, uint64_t lot_num, uint64_t hash, boolean_t zapadd, dmu_tx_t *tx) argument
[all...]
/illumos-gate/usr/src/uts/common/io/bge/
H A Dbge_main2.c1307 * Compute the index of the required bit in the multicast hash map.
1314 uint32_t hash; local
1316 CRC32(hash, mca, ETHERADDRL, -1U, crc32_table);
1318 return (hash);
1328 uint32_t hash; local
1340 hash = bge_hash_index(mca);
1341 index = hash % BGE_HASH_TABLE_SIZE;
1346 BGE_DEBUG(("bge_m_multicst: hash 0x%x index %d (%d:0x%x) = %d",
1347 hash, index, word, bit, *refp));
1350 * We must set the appropriate bit in the hash ma
[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/uts/common/io/usbgem/
H A Dusbgem.h78 uint32_t hash; member in struct:mcast_addr
/illumos-gate/usr/src/grub/grub-0.97/netboot/
H A Dtlan.h487 u8 hash; local
489 hash = (a[0] ^ a[3]); /* & 077 */
490 hash ^= ((a[0] ^ a[3]) >> 6); /* & 003 */
491 hash ^= ((a[1] ^ a[4]) << 2); /* & 074 */
492 hash ^= ((a[1] ^ a[4]) >> 4); /* & 017 */
493 hash ^= ((a[2] ^ a[5]) << 4); /* & 060 */
494 hash ^= ((a[2] ^ a[5]) >> 2); /* & 077 */
496 return (hash & 077);
511 u32 hash; local
513 hash
[all...]

Completed in 192 milliseconds

1234567891011