/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ |
H A D | hv.c | 81 S_save_hek_flags(pTHX_ const char *str, I32 len, U32 hash, int flags) argument 92 HEK_HASH(hek) = hash; 168 Perl_sv_setpvf(aTHX_ esv, "Attempt to %s a restricted hash", msg); 183 Stores an SV in a hash. The hash key is specified as C<key> and C<klen> is 184 the length of the key. The C<hash> parameter is the precomputed hash 187 stored within the hash (as in the case of tied hashes). Otherwise it can 193 if all your code does is create SVs then store them in a hash, hv_store 207 Perl_hv_store(pTHX_ HV *hv, const char *key, I32 klen_i32, SV *val, U32 hash) argument 226 Perl_hv_store_flags(pTHX_ HV *hv, const char *key, I32 klen, SV *val, register U32 hash, int flags) argument 264 Perl_hv_store_ent(pTHX_ HV *hv, SV *keysv, SV *val, U32 hash) argument 340 Perl_hv_exists_ent(pTHX_ HV *hv, SV *keysv, U32 hash) argument 366 Perl_hv_fetch_ent(pTHX_ HV *hv, SV *keysv, I32 lval, register U32 hash) argument 373 S_hv_fetch_common(pTHX_ HV *hv, SV *keysv, const char *key, STRLEN klen, int flags, int action, SV *val, register U32 hash) argument 868 Perl_hv_delete_ent(pTHX_ HV *hv, SV *keysv, I32 flags, U32 hash) argument 874 S_hv_delete_common(pTHX_ HV *hv, SV *keysv, const char *key, STRLEN klen, int k_flags, I32 d_flags, U32 hash) argument 1168 UV hash; local 1341 U32 hash = HeHASH(oent); local 1935 Perl_unsharepvn(pTHX_ const char *str, I32 len, U32 hash) argument 1952 S_unshare_hek_or_pvn(pTHX_ HEK *hek, const char *str, I32 len, U32 hash) argument 2036 Perl_share_hek(pTHX_ const char *str, I32 len, register U32 hash) argument 2063 S_share_hek_flags(pTHX_ const char *str, I32 len, register U32 hash, int flags) argument [all...] |
H A D | pp.c | 101 Perl_croak(aTHX_ "Can't return hash to lvalue scalar context"); 3718 HV *hash = (HV*)POPs; local 3721 I32 realhv = (SvTYPE(hash) == SVt_PVHV); 3725 entry = realhv ? hv_iternext(hash) : avhv_iternext((AV*)hash); 3737 hv_iterval(hash, entry) : avhv_iterval((AV*)hash, entry); 3771 if (hvtype == SVt_PVHV) { /* hash element */ 3784 else { /* pseudo-hash element */ 3853 else if (avhv_exists_ent((AV*)hv, tmpsv, 0)) /* pseudo-hash elemen [all...] |
H A D | sv.c | 4268 U32 hash = SvUVX(sv); local 4274 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash); 6857 first. Turns on READONLY and FAKE. The string's hash is stored in the UV 6858 slot of the SV; if the C<hash> parameter is non-zero, that value is used; 6859 otherwise the hash is computed. The idea here is that as the string table 6860 is used for shared hash keys these strings will have SvPVX == HeKEY and 6861 hash lookup will avoid string compare. 6867 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash) argument 6878 if (!hash) 6879 PERL_HASH(hash, sr 9616 UV hash = PTR_TABLE_HASH(sv); local 9635 UV hash = PTR_TABLE_HASH(oldv); local [all...] |
/osnet-11/usr/src/lib/libsqlite/src/ |
H A D | vdbeInt.h | 177 HashElem *pSearch; /* The hash element for pCurrent */ 178 Hash hash; /* Hash table of all aggregate elements */ member in struct:Agg 195 Hash hash; /* A set is just a hash table */ member in struct:Set 196 HashElem *prev; /* Previously accessed hash elemen */
|
/osnet-11/usr/src/lib/nsswitch/files/common/ |
H A D | files_common.c | 246 * Shared hash functions for multiple databases. 252 uint_t hash = 0; local 255 hash = hash * 15 + name[i]; 257 return (hash); 724 * There are two different functions using the hash table. 725 * _nss_files_XY_hash - searches the hash table for a particular key. 726 * _nss_files_XY_hashgetent - implements getent on the hash table. 741 uint_t hash, line; local 775 hash 1230 uint_t hash = hp->h_hash; local [all...] |
/osnet-11/usr/src/lib/pkcs11/pkcs11_kms/common/ |
H A D | kmsKeystoreUtil.c | 78 kms_hash_string(char *label, uchar_t *hash) argument 84 SHA2Final(hash, &ctx);
|
/osnet-11/usr/src/lib/pkcs11/pkcs11_softtoken/common/ |
H A D | softKeysUtil.c | 654 /* U = hash function output bits */ 878 CK_BYTE hash[SHA512_DIGEST_LENGTH]; /* space enough for all mechs */ local 1024 OBJ_SEC_VALUE_LEN(basekey_p), hash, &hash_len); 1061 (hash + hash_len - secret_key_len),
|
/osnet-11/usr/src/lib/libdtrace/common/ |
H A D | dt_aggregate.c | 49 * Rotate the hash by LSHIFT bits, then XOR the next word. 378 dt_ahash_t *hash = &agp->dtat_hash; local 381 if ((hash->dtah_sizendx + 1) >= DTRACE_NUM_AHASHSIZE) { 389 old_size = dtrace_ahashsize[hash->dtah_sizendx]; 390 hash->dtah_sizendx++; 391 new_size = new_hash.dtah_size = dtrace_ahashsize[hash->dtah_sizendx]; 395 hash->dtah_sizendx--; 402 for (h = hash->dtah_hash[i]; h != NULL; ) { 421 * All moved, now update hash info. 423 hash 440 dt_ahash_t *hash = &agp->dtat_hash; local 1219 dt_ahash_t *hash = &agp->dtat_hash; local 1235 dt_ahash_t *hash = &agp->dtat_hash; local 1303 dt_ahash_t *hash = &dtp->dt_aggregate.dtat_hash; local 1327 dt_ahash_t *hash = &agp->dtat_hash; local 1449 dt_ahash_t *hash = &agp->dtat_hash; local 1907 dt_ahash_t *hash = &agp->dtat_hash; local 1933 dt_ahash_t *hash = &agp->dtat_hash; local [all...] |
/osnet-11/usr/src/lib/libinetsvc/common/ |
H A D | inetsvc.c | 31 * reading, calculating and writing the hash of an inetd.conf file, and 114 #define HASH_PG "hash" 1323 * On success, hash is modified to point to the digest string and 0 is returned. 1329 calculate_hash(const char *pathname, char **hash) argument 1376 *hash = digest; 1381 * retrieve_inetd_hash retrieves inetd's configuration file hash from the 1382 * repository. On success, hash is modified to point to the hash string and 1384 * The space for the hash string is obtained using malloc(3C) and should be 1388 retrieve_inetd_hash(char **hash) argument 1419 store_inetd_hash(const char *hash) argument [all...] |
/osnet-11/usr/src/grub/grub2/grub-core/gnulib/ |
H A D | regcomp.c | 2805 int32_t hash = elem_hash ((const char *) name, name_len); 2806 int32_t elem = hash % table_size; 2809 int32_t second = hash % (table_size - 2) + 1; 2814 if (symb_table[2 * elem] == hash 2796 int32_t hash = elem_hash ((const char *) name, name_len); local
|
H A D | regex_internal.h | 59 # include <locale/elem-hash.h> 151 /* A hash value, suitable for computing hash tables. */ 539 re_hashval_t hash; member in struct:re_dfastate_t
|
/osnet-11/usr/src/grub/grub2/grub-core/lib/libgcrypt/cipher/ |
H A D | pubkey.c | 37 gcry_mpi_t hash, gcry_mpi_t *skey); 38 static gcry_err_code_t pubkey_verify (int algo, gcry_mpi_t hash, 170 dummy_verify (int algorithm, gcry_mpi_t hash, gcry_mpi_t *data, argument 175 (void)hash; 748 pubkey_verify (int algorithm, gcry_mpi_t hash, gcry_mpi_t *data, argument 764 log_mpidump (" hash:", hash); 772 rc = pubkey->verify (algorithm, hash, data, pkey, cmp, opaquev); 1290 /* Take the hash value and convert into an MPI, suitable for 1300 [(hash <alg 1831 gcry_mpi_t *skey = NULL, hash = NULL, *result = NULL; local 1946 gcry_mpi_t *pkey = NULL, hash = NULL, *sig = NULL; local [all...] |
/osnet-11/usr/src/grub/grub2/grub-core/loader/i386/ |
H A D | bsd.c | 970 grub_uint8_t *hash; local 1008 hash = GRUB_MD_MD5->read (&ctx); 1009 memcpy (biw.matchhash, hash, 16);
|
/osnet-11/usr/src/grub/grub-0.97/stage2/ |
H A D | fsys_zfs.c | 662 uint64_t hash, idx, blkid; local 670 hash = zap_hash(zap->zap_salt, name); 679 idx = ZAP_HASH_IDX(hash, zap->zap_ptrtbl.zt_shift); 690 return (zap_leaf_lookup(l, blksft, hash, name, value));
|
/osnet-11/usr/src/lib/libc/port/threads/ |
H A D | synch.c | 462 * Allocate the sleep queue hash table. 865 /* empty queue root; just delete from the hash list */ 1960 uint_t hash = LOCK_HASH(mp); local 1982 for (rlp = table[hash]; rlp != NULL; rlp = rlp->robust_next) { 1994 for (rlpp = &table[hash]; 2020 * the hash table and to the global list. 2058 * Do this by traversing the global list, not the hash table.
|
/osnet-11/usr/src/lib/pkcs11/pkcs11_tpm/common/ |
H A D | tpm_specific.c | 991 * Assign the PIN hash (optional) to the newly loaded key object, 1080 BYTE *hash, TSS_HKEY *hKey) 1097 if (hash != NULL) { 1099 TSS_POLICY_USAGE, *hKey, (CK_BYTE *)hash); 1900 /* if we're already logged in, just verify the hash */ 2043 /* If the hash given is wrong, the verify will fail */ 2235 /* get a random SHA1 hash for the auth data */ 2247 /* get a random SHA1 hash for the auth data */ 2582 /* Create the hash object we'll use to sign */ 2590 /* Insert the data into the hash objec 1078 tss_find_and_load_key(TSS_HCONTEXT hContext, char *keyid, TSS_UUID *uuid, TSS_HKEY hParent, BYTE *hash, TSS_HKEY *hKey) argument [all...] |
/osnet-11/usr/src/grub/grub-0.97/netboot/ |
H A D | tlan.h | 487 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...] |
/osnet-11/usr/src/lib/nsswitch/ldap/common/ |
H A D | getgrent.c | 794 * by an optional hash (#) and uniqueIdentifier. 801 char *hash, *eq; local 803 if ((hash = strrchr(dn, '#')) == NULL) 806 if ((eq = strrchr(dn, '=')) == NULL || eq > hash) 809 *hash = '\0';
|
/osnet-11/usr/src/lib/libsmb/common/ |
H A D | libsmb.h | 507 #define SMBAUTH_HASH_SZ 16 /* LM/NTLM/NTLMv2 hash size */ 508 #define SMBAUTH_SESSION_HASH_SZ 8 /* NTLM2 session hash size */ 609 * hash - NTLM hash 610 * hash_v2 - NTLMv2 hash 624 unsigned char hash[SMBAUTH_HASH_SZ]; member in struct:smb_auth_info 638 #define SMB_PWF_LM 0x01 /* LM hash is present */ 639 #define SMB_PWF_NT 0x02 /* NT hash is present */
|
/osnet-11/usr/src/lib/libkmf/plugins/kmf_openssl/common/ |
H A D | openssl_spi.c | 1843 uchar_t hash[EVP_MAX_MD_SIZE]; local 1867 (void) EVP_DigestFinal_ex(&ctx, hash, &hashlen); 1872 dsasig = DSA_do_sign(hash, hashlen, dsa); 2489 /* Lookup by key hash */ 2491 /* If key hash isn't SHA1 length then forget it */ 2496 /* Calculate hash of each key and compare */
|
/osnet-11/usr/src/grub/grub2/grub-core/fs/zfs/ |
H A D | zfs.c | 80 ZAP_HASH_IDX (grub_uint64_t hash, grub_uint64_t n) argument 82 return (((n) == 0) ? 0 : ((hash) >> (64 - (n)))); 114 * block size shift - hash entry size (2) * number of hash 125 * The chunks start immediately after the hash table. The end of the 126 * hash table is at l_hash + HASH_NUMENTRIES, which we simply cast to a 2481 grub_uint64_t hash, idx, blkid; local 2491 hash = zap_hash (zap->zap_salt, name, case_insensitive); 2497 idx = ZAP_HASH_IDX (hash, zap->zap_ptrtbl.zt_shift); 2507 err = zap_leaf_lookup (l, leafendian, blksft, hash, nam [all...] |
/osnet-11/usr/src/lib/libsqlite/tool/ |
H A D | lemon.c | 204 struct action *collide; /* Next action with the same hash */ 3017 char **types; /* A hash table of datatypes */ 3022 int hash; /* For hashing the name of a type */ local 3046 /* Build a hash table of datatypes. The ".dtnum" field of each symbol 3047 ** is filled in with the hash index plus 1. A ".dtnum" value of 0 is 3070 hash = 0; 3072 hash = hash*53 + stddt[j]; 3074 hash = (hash [all...] |
/osnet-11/usr/src/lib/sasl_plugins/digestmd5/ |
H A D | digestmd5.c | 208 reauth_entry_t *e; /* fixed-size hash table of entries */ 290 static unsigned hash(const char *str) function 428 /* convert to 8859-1 prior to applying hash */ 3065 unsigned val = hash(username) % text->reauth->size; 3520 unsigned val = hash(username) % text->reauth->size; 4819 val = hash(params->serverFQDN) % text->reauth->size; 5018 unsigned val = hash(params->serverFQDN) % text->reauth->size; 5069 unsigned val = hash(params->serverFQDN) % text->reauth->size;
|
/osnet-11/usr/src/lib/libntfs/common/include/ntfs/ |
H A D | layout.h | 577 * COLLATION_NTOFS_SECURITY_HASH - Sorting is done first by ascending hash 2081 * A simple hash is computed from each security descriptor. This hash is used 2084 * The $SDH index is sorted by security descriptor hash and is stored in a B+ 2087 * matching hash is found, but the security descriptors do not match, the 2088 * search in the $SDH index is continued, searching for a next matching hash. 2116 le32 hash; /* Hash of the security descriptor. */ member in struct:__anon2096 2132 le32 hash; /* Hash of the security descriptor. */ member in struct:__anon2097 2167 le32 hash; /* Hash of the security descriptor. */ member in struct:__anon2098 2196 * The keys are sorted first by hash an 2203 le32 hash; /* Hash of the security descriptor. */ member in struct:__anon2100 [all...] |