/osnet-11/usr/src/grub/grub2/grub-core/disk/ |
H A D | geli.c | 149 grub_uint64_t key[(dev->hash->mdlen + 7) / 8]; 153 gcry_err = grub_crypto_hmac_buffer (dev->hash, dev->rekey_key, 64, 370 newdev->hash = GRUB_MD_SHA512; 397 grub_uint8_t digest[dev->hash->mdlen]; 398 grub_uint8_t geomkey[dev->hash->mdlen]; 399 grub_uint8_t verify_key[dev->hash->mdlen]; 438 gcry_err = grub_crypto_pbkdf2 (dev->hash, (grub_uint8_t *) passphrase, 448 gcry_err = grub_crypto_hmac_buffer (dev->hash, NULL, 0, pbkdf_key, 457 hnd = grub_crypto_hmac_init (dev->hash, NULL, 0); 469 gcry_err = grub_crypto_hmac_buffer (dev->hash, geomke [all...] |
/osnet-11/usr/src/lib/libcurses/screen/ |
H A D | scr_reset.c | 80 int *hash, y; local 279 hash = _VIRTHASH; 289 /* clear the hash table */ 291 *hash++ = _NOHASH; 301 hash = _CURHASH; 305 /* clear the hash table */ 307 *hash++ = _NOHASH;
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/ |
H A D | fields.pm | 23 # The %attr hash holds the attributes of the currently assigned fields 24 # per class. The hash is indexed by class names and the hash value is 41 # Quiet pseudo-hash deprecation warning for uses of fields::new. 151 Carp::croak ("Odd number of elements initializing pseudo-hash\n"); 218 hash of the calling package, but this may change in future versions. 219 Do B<not> update the %FIELDS hash directly, because it must be created 225 hash element and a package with the same name as the type has 255 pseudo-hash comprised of the fields declared using the C<fields> 259 restricted-hash comprise [all...] |
/osnet-11/usr/src/lib/libdhcpsvc/modules/binfiles/ |
H A D | dhcp_network.c | 46 * in-use record is also on exactly one doubly-linked client id hash chain; 47 * the hash chains heads are contained in the header). For all other 49 * walking all of the hash chains. Here's a crude illustration of what 50 * this looks like on-disk (note that hash chains 2 and 3 are empty): 53 * | container info | hash chain heads (buckets) | 100 * when trying to achieve robustness is updating the client id hash chain. 103 * could leave our hash chains in an inconsistent state. 106 * the hash chains in the container. At any point in time, exactly one of 109 * operation, all hash chain modifications are done on the *inactive* 110 * image, then, once the inactive image has completed the hash chai 323 uint16_t hash; local 572 uint16_t hash; local 697 uint16_t hash; local 832 uint16_t hash, new_hash; local 1190 uint16_t hash; local 1340 nhconvert_header(dn_header_t *hdrp, boolean_t hash) argument 1397 read_header(int fd, dn_header_t *hdrp, boolean_t hash) argument [all...] |
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/crypto/keyhash_provider/ |
H A D | k5_md5des.c | 99 /* hash the confounder, then the input data */ 151 krb5_const krb5_data *hash, 168 if (hash->length != (CONFLENGTH + MD5_CKSUM_LENGTH)) { 170 if (hash->length != MD5_CKSUM_LENGTH) 206 (krb5_pointer) hash->data, 207 (krb5_pointer) plaintext, hash->length, 211 (krb5_pointer) hash->data, 212 (krb5_pointer) plaintext, hash->length, 217 /* hash the confounder, then the input data */ 245 /* compare the decrypted hash t 146 k5_md5des_verify(krb5_context context, krb5_const krb5_keyblock *key, krb5_keyusage usage, krb5_const krb5_data *ivec, krb5_const krb5_data *input, krb5_const krb5_data *hash, krb5_boolean *valid) argument [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/ExtUtils/ |
H A D | Packlist.pm | 199 The hash reference returned by the new() function can be used to examine and 201 .packlist by modifying the hash. If the value associated with a hash key is a 203 simple filename. If the value is a hash, the entry written will be the 204 filename followed by the key=value pairs from the hash. Reading back the 215 returns a reference to a hash. This hash holds an entry for each line in the 218 each key is a hash containing the key=value pairs following the filename in the 236 from the internal hash. The return value is a list of the missing files, which
|
/osnet-11/usr/src/lib/nsswitch/files/common/ |
H A D | gethostent6.c | 57 uint_t hash = 0; local 74 hash = *value; 76 return (hash); 115 * For systems without nscd and for libnsl API there is non-hash
|
/osnet-11/usr/src/lib/libsmb/common/ |
H A D | smb_auth.c | 94 * make a 16-byte hash. 113 * Create a LM response from the given LM hash and challenge. 119 smb_auth_lm_response(unsigned char *hash, argument 131 bcopy(hash, S21, SMBAUTH_HASH_SZ); 142 * The result will contain a 16-byte NTLM hash. 145 smb_auth_ntlm_hash(const char *password, unsigned char *hash) argument 151 if (password == NULL || hash == NULL) 162 rc = smb_auth_md4(hash, (unsigned char *)unicode_password, length); 175 smb_auth_ntlm_response(unsigned char *hash, argument 181 bcopy(hash, S2 384 smb_auth_v2_response( unsigned char *hash, unsigned char *srv_challenge, int slen, unsigned char *clnt_data, int clen, unsigned char *v2_rsp) argument [all...] |
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/rcache/ |
H A D | rc_common.c | 14 hash(krb5_donot_replay *rep, unsigned int hsize) function
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/DBM_Filter/ |
H A D | compress.pm | 33 $db = tie %hash, ...
|
H A D | int32.pm | 33 $db = tie %hash, ...
|
H A D | utf8.pm | 33 $db = tie %hash, ...
|
/osnet-11/usr/src/lib/libast/amd64/include/ast/ |
H A D | hash.h | 29 * hash table library interface definitions 97 #define hashcover(b) (((b)->hash&HASH_HIDES)?(Hash_bucket_t*)((b)->name):(Hash_bucket_t*)0) 101 #define hashkeep(b) ((b)->hash|=HASH_KEEP) 102 #define hashname(b) ((((b)->hash&HASH_HIDES)?((Hash_bucket_t*)((b)->name)):(b))->name) 134 unsigned int hash; /* hash flags and value */ \ 151 typedef struct /* hash scan bucket position */ 168 struct Hash_root /* root hash table information */ 180 struct Hash_table /* hash table information */ 182 Hash_root_t* root; /* root hash tabl [all...] |
/osnet-11/usr/src/lib/libast/common/include/ |
H A D | hash.h | 27 * hash table library interface definitions 88 #define hashcover(b) (((b)->hash&HASH_HIDES)?(Hash_bucket_t*)((b)->name):(Hash_bucket_t*)0) 92 #define hashkeep(b) ((b)->hash|=HASH_KEEP) 93 #define hashname(b) ((((b)->hash&HASH_HIDES)?((Hash_bucket_t*)((b)->name)):(b))->name) 125 unsigned int hash; /* hash flags and value */ \ 142 typedef struct /* hash scan bucket position */ 159 struct Hash_root /* root hash table information */ 171 struct Hash_table /* hash table information */ 173 Hash_root_t* root; /* root hash tabl [all...] |
/osnet-11/usr/src/lib/libast/i386/include/ast/ |
H A D | hash.h | 29 * hash table library interface definitions 97 #define hashcover(b) (((b)->hash&HASH_HIDES)?(Hash_bucket_t*)((b)->name):(Hash_bucket_t*)0) 101 #define hashkeep(b) ((b)->hash|=HASH_KEEP) 102 #define hashname(b) ((((b)->hash&HASH_HIDES)?((Hash_bucket_t*)((b)->name)):(b))->name) 134 unsigned int hash; /* hash flags and value */ \ 151 typedef struct /* hash scan bucket position */ 168 struct Hash_root /* root hash table information */ 180 struct Hash_table /* hash table information */ 182 Hash_root_t* root; /* root hash tabl [all...] |
/osnet-11/usr/src/lib/libast/sparc/include/ast/ |
H A D | hash.h | 29 * hash table library interface definitions 97 #define hashcover(b) (((b)->hash&HASH_HIDES)?(Hash_bucket_t*)((b)->name):(Hash_bucket_t*)0) 101 #define hashkeep(b) ((b)->hash|=HASH_KEEP) 102 #define hashname(b) ((((b)->hash&HASH_HIDES)?((Hash_bucket_t*)((b)->name)):(b))->name) 134 unsigned int hash; /* hash flags and value */ \ 151 typedef struct /* hash scan bucket position */ 168 struct Hash_root /* root hash table information */ 180 struct Hash_table /* hash table information */ 182 Hash_root_t* root; /* root hash tabl [all...] |
/osnet-11/usr/src/lib/libast/sparcv9/include/ast/ |
H A D | hash.h | 29 * hash table library interface definitions 97 #define hashcover(b) (((b)->hash&HASH_HIDES)?(Hash_bucket_t*)((b)->name):(Hash_bucket_t*)0) 101 #define hashkeep(b) ((b)->hash|=HASH_KEEP) 102 #define hashname(b) ((((b)->hash&HASH_HIDES)?((Hash_bucket_t*)((b)->name)):(b))->name) 134 unsigned int hash; /* hash flags and value */ \ 151 typedef struct /* hash scan bucket position */ 168 struct Hash_root /* root hash table information */ 180 struct Hash_table /* hash table information */ 182 Hash_root_t* root; /* root hash tabl [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/IO/lib/IO/ |
H A D | Dir.pm | 207 hash. The tied hash extends the interface beyond just the directory 213 =item tie %hash, 'IO::Dir', DIRNAME [, OPTIONS ] 217 The keys of the hash will be the names of the entries in the directory. 218 Reading a value from the hash will be the result of calling 219 C<File::stat::lstat>. Deleting an element from the hash will 223 Assigning to an entry in the hash will cause the time stamps of the file 225 a single integer to a hash element will cause both the access and
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/SDBM_File/sdbm/ |
H A D | Makefile.PL | 41 C => [qw(sdbm.c pair.c hash.c)]
|
H A D | sdbm.c | 228 register long hash; local 242 if (getpage(db, (hash = exhash(key)))) { 257 if (!makroom(db, hash, need)) 283 makroom(register DBM *db, long int hash, int need) argument 303 newp = (hash & db->hmask) | (db->hmask + 1); 330 if (hash & (db->hmask + 1)) { 355 ((hash & (db->hmask + 1)) ? 2 : 1); 408 getpage(register DBM *db, register long int hash) argument 417 dbit = 2 * dbit + ((hash & (1 << hbit++)) ? 2 : 1); 424 pagb = hash [all...] |
/osnet-11/usr/src/lib/libast/common/cdt/ |
H A D | dtrenew.c | 64 { s = dt->data->htab + HINDEX(dt->data->ntab,e->hash); 73 e->hash = _DTHSH(dt,key,disc,disc->size);
|
/osnet-11/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/ |
H A D | Option.java | 641 int hash = 17; 642 hash = (37 * hash) + name.hashCode(); 643 hash = (37 * hash) + value.hashCode(); 644 return hash;
|
/osnet-11/usr/src/lib/pkcs11/pkcs11_tpm/common/ |
H A D | dig_mgr.c | 480 CK_BYTE *hash, 491 if (hash == NULL && hash_len == NULL) 496 if (hash == NULL) { 502 SHA1Final(hash, ctx->context.sha1ctx); 508 if (hash == NULL) { 514 MD5Final(hash, ctx->context.md5ctx); 478 digest_mgr_digest_final(SESSION *sess, DIGEST_CONTEXT *ctx, CK_BYTE *hash, CK_ULONG *hash_len) argument
|
/osnet-11/usr/src/lib/libc/port/gen/ |
H A D | ndbm.c | 235 unsigned long hash; local 237 hash = dcalchash(key); 239 db->dbm_blkno = hash & db->dbm_hmask; 399 dbm_hashinc(DBM *db, unsigned long hash) argument 403 hash &= db->dbm_hmask; 409 if ((hash&bit) == 0) 410 return (hash|bit); 411 hash &= ~bit; 420 dbm_firsthash(DBM *db, unsigned long hash) argument 426 dbm_access(db, hash); 541 unsigned long hash; local 714 dbm_access(DBM *db, unsigned long hash) argument [all...] |
/osnet-11/usr/src/lib/libproc/common/ |
H A D | Psymtab_machelf32.c | 103 * DT_HASH base of hash table for dynamic lookups 107 * dynamic lookup hash table. Here's the layout of the hash table: 127 * consumer where the next entry in the hash chain is. We can use 353 Word hash[2]; local 359 if (Pread(P, hash, sizeof (hash), hptr) != sizeof (hash)) { 360 dprintf("Pread of .hash at %lx failed\n", 365 hnbuckets = hash[ 608 uint_t *hash; local [all...] |