Searched refs:hash (Results 126 - 150 of 401) sorted by relevance

1234567891011>>

/illumos-gate/usr/src/lib/libproc/common/
H A DPsymtab_machelf32.c107 * DT_HASH base of hash table for dynamic lookups
111 * dynamic lookup hash table. Here's the layout of the hash table:
131 * consumer where the next entry in the hash chain is. We can use
358 Word hash[2]; local
364 if (Pread(P, hash, sizeof (hash), hptr) != sizeof (hash)) {
365 dprintf("Pread of .hash at %lx failed\n",
370 hnbuckets = hash[
615 uint_t *hash; local
[all...]
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppd/
H A Dchap_ms.c34 * The hash text (StdText) was taken from Win95 RASAPI32.DLL.
300 u_char hash[MD4_SIGNATURE_SIZE]; local
312 MD4Final(hash, &md4Context); /* Tell MD4 we're done */
314 ChallengeResponse(rchallenge, hash, response->NTResp);
467 u_char hash[MD4_SIGNATURE_SIZE]; local
483 MD4Final(hash, &md4Context); /* Tell MD4 we're done */
485 ChallengeResponse(challenge, hash, response->NTResp);
536 u_char hash[MD4_SIGNATURE_SIZE]; local
555 MD4Final(hash, &md4Context);
557 /* Now hash th
[all...]
/illumos-gate/usr/src/common/ficl/
H A Dsystem.c431 ficlHash *hash = ficlSystemGetLocals(system)->forthWordlist; local
435 FICL_SYSTEM_ASSERT(system, hash);
442 word = ficlHashLookup(hash, name, hashCode);
449 hash = dictionary->wordlists[i];
450 word = ficlHashLookup(hash, name, hashCode);
/illumos-gate/usr/src/lib/libcpc/common/
H A Dlibcpc_impl.h137 extern void __cpc_strhash_free(cpc_strhash_t *hash);
138 extern int __cpc_strhash_add(cpc_strhash_t *hash, char *key);
139 extern char *__cpc_strhash_next(cpc_strhash_t *hash);
/illumos-gate/usr/src/cmd/ypcmd/shared/
H A Dlockmap.c66 * - hash() is the front-end function that gets called.
69 * It is called by hash() in N2L mode.
76 * Local references to hash table for map lists
93 syslog(LOG_WARNING, "get_map_id: no hash id found for %s"
106 hash(char *s) function
290 hashval = hash(mapname);
300 * GIVEN : Map hash value
373 hashval = hash(mapname);
383 * GIVEN : Map hash value
/illumos-gate/usr/src/tools/ctf/cvt/
H A Diidesc.c39 #include "hash.h"
85 iidesc_add(hash_t *hash, iidesc_t *new) argument
92 (void) hash_match(hash, new, (int (*)())iidesc_cmp, &find);
106 hash_add(hash, new);
/illumos-gate/usr/src/tools/stabs/
H A Dstabs.c248 * Check if we have this node in the hash table already
253 int hash = HASH(h); local
254 struct tdesc *tdp = hash_table[hash];
259 tdp = tdp->hash;
597 * find the tdesc struct in the hash table for this type
601 if (tdp == NULL) { /* not in hash list */
712 * Add a node to the hash queues.
717 int hash = HASH(num); local
722 * If it already exists in the hash table don't add it again
728 tdp->hash
751 int hash = compute_sum(name); local
[all...]
H A Dstabs.h91 struct tdesc *hash; member in struct:tdesc
/illumos-gate/usr/src/cmd/boot/common/
H A Dbblk_einfo.c38 bblk_hash_t bblk_no_hash = {BBLK_NO_HASH, 0, "(no hash)", NULL};
192 unsigned char *hash = NULL; local
205 "present but hash offset %d is beyond the buffer "
209 hash = (unsigned char *)einfo + einfo->hash_off;
239 (void) fprintf(stdout, "%s hash: ",
248 (void) fprintf(stdout, "%02x", hash[i]);
255 compute_hash(bblk_hs_t *hs, unsigned char *dest, bblk_hash_t *hash) argument
257 if (hs == NULL || dest == NULL || hash == NULL)
260 hash->compute_hash(dest, hs->src_buf, hs->src_size);
275 * 'dest' might be both containing the buffer we want to hash an
[all...]
/illumos-gate/usr/src/lib/pkcs11/pkcs11_softtoken/common/
H A DsoftDSA.c225 CK_BYTE hash[SHA1_HASH_SIZE]; /* space enough for SHA1 and MD5 */ local
245 rv = soft_digest_final(session_p, hash, &hash_len);
247 rv = soft_digest(session_p, pData, ulDataLen, hash, &hash_len);
261 rv = soft_dsa_sign(session_p, hash, hash_len, pSigned, pulSignedLen);
370 CK_BYTE hash[SHA1_HASH_SIZE]; /* space enough for SHA1 and MD5 */ local
376 rv = soft_digest_final(session_p, hash, &hash_len);
378 rv = soft_digest(session_p, pData, ulDataLen, hash, &hash_len);
392 rv = soft_dsa_verify(session_p, hash, hash_len,
H A DsoftRSA.c977 CK_BYTE hash[SHA512_DIGEST_LENGTH]; /* space enough for all mechs */ local
1017 rv = soft_digest_final(session_p, hash, &hash_len);
1019 rv = soft_digest(session_p, pData, ulDataLen, hash, &hash_len);
1038 (void) memcpy(der_data + MD5_DER_PREFIX_Len, hash, hash_len);
1045 (void) memcpy(der_data + der_len, hash, hash_len);
1051 (void) memcpy(der_data + SHA2_DER_PREFIX_Len, hash, hash_len);
1057 (void) memcpy(der_data + SHA2_DER_PREFIX_Len, hash, hash_len);
1063 (void) memcpy(der_data + SHA2_DER_PREFIX_Len, hash, hash_len);
1093 CK_BYTE hash[SHA512_DIGEST_LENGTH]; /* space for all mechs */ local
1103 rv = soft_digest_final(session_p, hash,
[all...]
/illumos-gate/usr/src/cmd/fs.d/nfs/statd/
H A Dsm_statd.c1181 unsigned int hash; local
1201 SMHASH(name, hash);
1204 (void) printf("inserting %s at hash %d,\n",
1205 name, hash);
1207 (void) printf("deleting %s at hash %d\n", name, hash);
1213 mutex_lock(&record_table[hash].lock);
1214 record_q = &record_table[hash].sm_rechdp;
1222 mutex_unlock(&record_table[hash].lock);
1259 mutex_unlock(&record_table[hash]
1515 unsigned int hash; local
[all...]
/illumos-gate/usr/src/cmd/ldmad/
H A Dmdesc_mutable.h96 uint32_t hash; member in struct:md_string
105 uint32_t hash; member in struct:md_data_block
/illumos-gate/usr/src/uts/i86pc/io/amd_iommu/
H A Damd_iommu_acpi.c461 amd_iommu_acpi_ivhd_t **hash)
529 /* All range type entries are put on hash entry 0 */
610 * Now add it to the hash
612 ASSERT(hash[idx] != acpi_ivhdp);
613 acpi_ivhdp->ach_next = hash[idx];
614 hash[idx] = acpi_ivhdp;
619 * in an alias entry. This routine adds it to the hash
622 add_implicit_deventry(ivhd_container_t *ivhdcp, amd_iommu_acpi_ivhd_t **hash) argument
651 add_deventry_info(ivhdcp->ivhdc_ivhd, &deventry, hash);
662 add_ivhdc_info(ivhd_container_t *ivhdcp, amd_iommu_acpi_ivhd_t **hash) argument
460 add_deventry_info(ivhd_t *ivhdp, ivhd_deventry_t *deventry, amd_iommu_acpi_ivhd_t **hash) argument
677 add_ivhd_info(amd_iommu_acpi_t *acpi, amd_iommu_acpi_ivhd_t **hash) argument
688 set_ivmd_info(ivmd_t *ivmdp, amd_iommu_acpi_ivmd_t **hash) argument
743 add_ivmdc_info(ivmd_container_t *ivmdcp, amd_iommu_acpi_ivmd_t **hash) argument
749 add_ivmd_info(amd_iommu_acpi_t *acpi, amd_iommu_acpi_ivmd_t **hash) argument
[all...]
/illumos-gate/usr/src/uts/common/sys/
H A Dstrft.h121 * a hash value (for recovering trace information)
130 uint_t hash; /* accumulated hash value (sum of mid's) */ member in struct:fthdr
155 _hp->hash = 0; \
/illumos-gate/usr/src/cmd/make/bin/
H A Dmacro.cc80 (int) val->hash.length);
89 (int) value->hash.length);
/illumos-gate/usr/src/uts/common/fs/sockfs/
H A Dnl7curi.c142 * The URI hash is a dynamically sized A/B bucket hash, when the current
143 * hash's average bucket chain length exceeds URI_HASH_AVRG a new hash of
146 * All lookups are done in the current hash then the new hash (if any),
147 * if there is a new has then when a current hash bucket chain is examined
148 * any uri_desc_t members will be migrated to the new hash and when the
149 * last uri_desc_t has been migrated then the new hash will become the
150 * current and the previous current hash wil
[all...]
/illumos-gate/usr/src/lib/nsswitch/files/common/
H A Dgetpwnam.c41 uint_t hash = 0; local
54 hash = hash * 15 + name[i];
55 return (hash);
/illumos-gate/usr/src/lib/libcurses/screen/
H A Dwnoutref.c55 int *hash; local
113 hash = _VIRTHASH + yorg;
125 for (y = 0; y < boty; ++y, ++hash, ++bch, ++ech, ++sbch,
194 /* the hash value of the line */
195 *hash = _NOHASH;
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/
H A Ddecrypt.c73 (context, krb5_enctypes_list[i].enc, krb5_enctypes_list[i].hash,
/illumos-gate/usr/src/uts/common/inet/ip/
H A Dip_dce.c133 uint_t hash; local
157 hash = RANDOM_HASH((uint64_t)((uintptr_t)dce | seed));
160 if (hash % fraction_pmtu != 0) {
165 if (hash % fraction != 0) {
207 * mean that the number of entries in the hash buckets has exceeded a tunable
299 * Allocate a default DCE and a hash table for per-IP address DCEs
407 uint_t hash; local
415 hash = IRE_ADDR_HASH(dst, ipst->ips_dce_hashsize);
416 dcb = &ipst->ips_dce_hash_v4[hash];
448 uint_t hash; local
490 uint_t hash; local
556 uint_t hash; local
[all...]
/illumos-gate/usr/src/tools/protocmp/
H A Dlist.c110 hash(const char *str) function
144 for (e = list->list[hash(key->name) % list->num_of_buckets]; e;
185 for (e = list->list[hash(key->name) % list->num_of_buckets]; e;
252 bucket = hash(e->name) % list->num_of_buckets;
H A Dlist.h151 extern unsigned int hash(const char *str);
/illumos-gate/usr/src/ucbcmd/mkstr/
H A Dmkstr.c35 * Modified March 1978 to hash old messages to be able to recompile
263 static struct hash { struct
266 struct hash *hnext;
273 struct hash *hp;
294 hp = (struct hash *)calloc(1, sizeof (*hp));
/illumos-gate/usr/src/uts/common/io/cxgbe/t4nex/
H A Dt4_l2t.h36 * packets awaiting address resolution. Second, it is a node of a hash table
38 * pointer. Finally, each node is a bucket of a hash table, pointing to the
50 struct l2t_entry *first; /* start of hash chain */
56 uint16_t hash; /* hash bucket the entry is on */ member in struct:l2t_entry

Completed in 244 milliseconds

1234567891011>>