Searched refs:hash (Results 26 - 50 of 258) sorted by relevance

1234567891011

/osnet-11/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
H A DPrintfRecord.java232 * Overridden to ensure that equal instances have equal hash codes.
238 int hash = 17;
239 hash = (37 * hash) + records.hashCode();
240 hash = (37 * hash) + formattedString.hashCode();
241 return hash;
H A DProbeDescription.java441 int hash = id;
442 if (hash != ID_NONE) {
443 return hash;
446 hash = 17;
447 hash = (37 * hash) + provider.hashCode();
448 hash = (37 * hash) + module.hashCode();
449 hash = (37 * hash)
[all...]
H A DInterfaceAttributes.java487 int hash = 17;
488 hash = (37 * hash) + nameStability.hashCode();
489 hash = (37 * hash) + dataStability.hashCode();
490 hash = (37 * hash) + dependencyClass.hashCode();
491 return hash;
H A DAggregation.java264 * Overridden to ensure that equal aggregations have equal hash
271 int hash = 17;
272 hash = (37 * hash) + name.hashCode();
273 hash = (37 * hash) + map.hashCode();
274 return hash;
H A DUserSymbolRecord.java205 * Overridden to ensure that equal instances have equal hash codes.
399 * Overridden to ensure that equal instances have equal hash
406 int hash = 17;
407 hash = 37 * hash + processID;
408 hash = 37 * hash + (int)(address ^ (address >>> 32));
409 return hash;
H A DDistribution.java308 * Overridden to ensure that equals instances have equal hash codes.
482 int hash = 17;
483 hash = (37 * hash) + ((int)(min ^ (min >>> 32)));
484 hash = (37 * hash) + ((int)(max ^ (max >>> 32)));
485 hash = (37 * hash) + ((int)(frequency ^ (frequency >>> 32)));
486 return hash;
H A DPrintaRecord.java456 * Overridden to ensure that equal instances have equal hash codes.
462 int hash = 17;
463 hash = (hash * 37) + aggregations.hashCode();
464 hash = (hash * 37) + ((formattedStrings == null ||
467 hash = (hash * 37) + tuples.hashCode();
468 return hash;
/osnet-11/usr/src/lib/libnsl/yp/
H A Ddbm.c123 long hash; local
125 hash = calchash(key);
127 blkno = hash & hmask;
261 long hash; local
268 hash = calchash(key);
269 dbm_access(hash);
284 hash = hashinc(hash);
285 if (hash == 0)
287 return (firsthash(hash));
291 firsthash(long hash) argument
315 dbm_access(long hash) argument
465 hashinc(long hash) argument
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/lib/
H A DLzFind.c153 p->hash = 0;
168 alloc->Free(alloc, p->hash);
169 p->hash = 0;
247 if (p->hash != 0 && prevSize == newSize)
250 p->hash = AllocRefs(newSize, alloc);
251 if (p->hash != 0)
253 p->son = p->hash + p->hashSizeSum;
291 p->hash[i] = kEmptyHashValue;
323 MatchFinder_Normalize3(subValue, p->hash, p->hashSizeSum + p->numSons);
505 curMatch = p->hash[hashValu
[all...]
/osnet-11/usr/src/lib/libast/common/hash/
H A Dhashlook.c27 * hash table library
33 * hash table lookup
88 if (flags & HASH_BUCKET) n = last->bucket->hash;
96 last->hash = i = HASHVAL(n);
102 if (i == HASHVAL(b->hash) && ((b->hash & (HASH_DELETED|HASH_OPAQUED)) != HASH_DELETED || (flags & (HASH_CREATE|HASH_DELETE|HASH_INSTALL|HASH_RENAME))))
136 n = i = last->hash;
162 if (flags & HASH_OPAQUE) b->hash |= HASH_OPAQUED;
169 if (flags & HASH_OPAQUE) b->hash &= ~HASH_OPAQUED;
184 if (tab->frozen || (b->hash
[all...]
H A Dhashfree.c27 * hash table library
33 * free (remove) a hash table
76 if (p->hash & HASH_FREENAME)
78 p->hash &= ~HASH_FREENAME;
82 if (!(p->hash & HASH_KEEP))
87 else if (p->hash & HASH_HIDES)
89 p->hash &= ~HASH_HIDES;
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Tie/
H A DHash.pm54 This module provides some skeletal methods for hash-tying classes. See
55 L<perltie> for a list of the functions required in order to tie a hash
73 The method invoked by the command C<tie %hash, classname>. Associates a new
74 hash instance with the specified class. C<LIST> would represent additional
80 Store datum I<value> into I<key> for the tied hash I<this>.
84 Retrieve the datum in I<key> for the tied hash I<this>.
88 Return the first key in the hash.
92 Return the next key in the hash.
96 Verify that I<key> exists with the tied hash I<this>.
102 Delete the key I<key> from the tied hash
[all...]
H A DMemoize.pm42 croak 'syntax: tie %hash, \'Tie::AutoLoad\', \&fetch_subr' if @_ < 2;
43 croak 'syntax: tie %hash, \'Tie::AutoLoad\', \&fetch_subr, $data, \&exists_subr, \%data_cache, \%existence_cache' if @_ > 6;
54 Tie::Memoize - add data to hash when needed
59 tie %hash, 'Tie::Memoize',
66 This package allows a tied hash to autoload its values on the first access,
70 the functions; the modify-accesses are performed as on a normal hash.
72 The required arguments during C<tie> are the hash, the package, and
75 and initial values of the hash and of the existence cache.
107 tie %hash, 'Tie::Memoize', \&slurp, $directory, \&exists,
112 hash
[all...]
H A DRefHash.pm7 Tie::RefHash - use references as hash keys
20 This module provides the ability to use references as hash keys if you
21 first C<tie> the hash variable to this module. Normally, only the
22 keys of the tied hash itself are preserved as references; to use
29 The Nestable version works by looking for hash references being stored
32 store a reference to one of your own hashes in the tied hash.
/osnet-11/usr/src/lib/libpool/common/
H A Ddict.c195 * Return a hash which is built by manipulating each byte in the
196 * supplied data. The hash logic follows the approach suggested in the
197 * FNV hash.
204 uint64_t hash = HASH_64_INIT; local
207 hash *= HASH_64_PRIME;
208 hash ^= (uint64_t)*start++;
211 return (hash);
216 * Return a hash which is built by manipulating each byte in the
217 * supplied string. The hash logic follows the approach suggested in
218 * the FNV hash
224 uint64_t hash = HASH_64_INIT; local
[all...]
/osnet-11/usr/src/lib/pkcs11/pkcs11_tpm/common/
H A Dmech_sha.c65 CK_BYTE hash[SHA1_DIGEST_LENGTH]; local
118 hash_len = sizeof (hash);
120 attr->pValue, attr->ulValueLen, hash, &hash_len);
130 k_ipad[i] = hash[i] ^ 0x36;
131 k_opad[i] = hash[i] ^ 0x5C;
170 hash_len = sizeof (hash);
171 rc = digest_mgr_digest_final(sess, &digest_ctx, hash, &hash_len);
193 rc = digest_mgr_digest_update(sess, &digest_ctx, hash, hash_len);
199 hash_len = sizeof (hash);
200 rc = digest_mgr_digest_final(sess, &digest_ctx, hash,
[all...]
H A Dmech_md5.c331 CK_BYTE hash[MD5_DIGEST_LENGTH]; local
389 hash, &hash_len);
399 k_ipad[i] = hash[i] ^ 0x36;
400 k_opad[i] = hash[i] ^ 0x5C;
441 hash_len = sizeof (hash);
442 rc = digest_mgr_digest_final(sess, &digest_ctx, hash, &hash_len);
464 rc = digest_mgr_digest_update(sess, &digest_ctx, hash, hash_len);
470 hash_len = sizeof (hash);
471 rc = digest_mgr_digest_final(sess, &digest_ctx, hash, &hash_len);
477 (void) memcpy(out_data, hash, hmac_le
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Getopt/
H A DStd.pm39 and getopts() will also accept a hash reference as an optional second argument.
88 my ($argumentative, $hash) = @_;
108 if (ref $hash) {
109 $$hash{$first} = $rest;
117 if (ref $hash) {
118 $$hash{$first} = 1;
132 unless (ref $hash) {
219 my ($argumentative, $hash) = @_;
240 if (ref $hash) {
241 $$hash{
[all...]
/osnet-11/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...]
/osnet-11/usr/src/grub/grub2/grub-core/disk/arc/
H A Darcdisk.c43 int hash = 0; local
45 hash ^= *devpath++;
46 return (hash & (ARCDISK_HASH_SZ - 1));
141 struct arcdisk_hash_ent *hash; local
177 hash = arcdisk_hash_find (fullname);
178 if (!hash)
179 hash = arcdisk_hash_add (fullname);
180 if (!hash)
217 disk->id = hash->num;
/osnet-11/usr/src/lib/libdtrace/common/
H A Ddt_aggregate.c49 * 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/cmd/perl/5.8.4/distrib/
H A Dhv.c81 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 Dhv.h15 /* entry in hash value chain */
18 HEK *hent_hek; /* hash key */
22 /* hash key -- defined separately for use as shared pointer */
24 U32 hek_hash; /* hash of key */
25 I32 hek_len; /* length of hash key */
26 char hek_key[1]; /* variable-length hash key */
27 /* the hash-key is \0-terminated */
32 /* hash structure: */
50 /* hash a key */
53 * (http://burtleburtle.net/bob/hash/doob
[all...]
/osnet-11/usr/src/lib/libnisdb/yptol/
H A Dstubs.c105 #pragma weak hash macro
107 hash(char *s) function
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Text/
H A DAbbrev.pm27 %hash = abbrev qw(list edit send abort gripe);
31 abbrev(*hash, qw(list edit send abort gripe));
47 if (ref($_[0])) { # hash reference preferably

Completed in 104 milliseconds

1234567891011