Searched refs:hash (Results 101 - 125 of 258) sorted by relevance

1234567891011

/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Data/Dumper/
H A DDumper.pm66 apad => "", # added padding for hash keys n such
68 pair => $Pair, # hash key/value separator: defaults to ' => '
79 quotekeys => $Quotekeys, # quote hash keys
84 sortkeys => $Sortkeys, # flag or filter for sorting hash keys
648 # helper sub to sort hash keys in Perl < 5.8.0 where we don't have
764 Expects an anonymous hash of name => value pairs. Same rules apply for names
828 which takes into account the length of hash keys (so the hash value lines
914 Can be set to a boolean value to control whether hash keys are quoted.
915 A false value will avoid quoting hash key
[all...]
/osnet-11/usr/src/lib/libelfsign/common/
H A Delfsignlib.c893 elfsign_hash_common(ELFsign_t ess, uchar_t *hash, size_t *hash_len, argument
901 /* The buffer must be large enough to hold the hash */
905 bzero(hash, *hash_len);
945 * throw this section into the hash
956 cryptodebug("elfsign_hash: updating hash "
967 SHA1Final(hash, &ctx);
974 tohexstr(hash, *hash_len, hashstr, hashstr_len);
975 cryptodebug("hash value is: %s", hashstr);
985 * elfsign_hash - return the hash of the ELF sections affecting execution.
988 * OUT: hash, hash_le
991 elfsign_hash(ELFsign_t ess, uchar_t *hash, size_t *hash_len) argument
1004 elfsign_hash_mem_resident(ELFsign_t ess, uchar_t *hash, size_t *hash_len) argument
1026 uchar_t hash[SIG_MAX_LENGTH]; local
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/disk/ieee1275/
H A Dofdisk.c44 int hash = 0; local
46 hash ^= *devpath++;
47 return (hash & (OFDISK_HASH_SZ - 1));
/osnet-11/usr/src/grub/grub2/util/
H A Dgrub-solvers.c83 bblk_hash_t bblk_no_hash = {BBLK_NO_HASH, 0, "(no hash)", NULL};
87 compute_hash(bblk_hs_t *hs, unsigned char *dest, bblk_hash_t *hash) argument
89 if (hs == NULL || dest == NULL || hash == NULL)
92 hash->compute_hash(dest, hs->src_buf, hs->src_size);
107 * 'dest' might be both containing the buffer we want to hash and
124 (void) fprintf(stderr, gettext("%s hash operation failed\n"),
/osnet-11/usr/src/lib/pkcs11/pkcs11_tpm/common/
H A Dmech_rsa.c403 CK_BYTE hash[SHA1_DIGEST_LENGTH]; local
437 in_data_len, hash, &hash_len);
442 hash, hash_len);
532 CK_BYTE hash[SHA1_DIGEST_LENGTH]; local
566 in_data_len, hash, &hash_len);
571 hash, hash_len);
657 CK_BYTE hash[SHA1_DIGEST_LENGTH]; local
683 &context->hash_context, hash, &hash_len);
689 hash, hash_len);
739 CK_BYTE hash[SHA1_DIGEST_LENGT local
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/
H A DMemoize.pm102 $revmemotable{$wrapper} = "" . $cref; # Turn code ref into hash key
118 } elsif ($cache_opt eq 'HASH') { # user-supplied hash
126 # default is that we make up an in-memory hash
136 # both get merged to the same in-memory hash.
170 # This function tries to load a tied hash class and tie the hash to it.
172 my ($context, $hash, $options) = @_;
192 croak "Memoize: Couldn't load hash tie module `$module': $@; aborting";
194 my $rc = (tie %$hash => $module, @args);
196 croak "Memoize: Couldn't tie hash t
[all...]
/osnet-11/usr/src/lib/libzfs/common/
H A Dlibzfs_graph.c119 * Graph structure. Vertices are maintained in a hash indexed by dataset name.
252 * parameter so in the future we can size the hash according to the number of
277 * Destroy a graph object. We have to iterate over all the hash chains,
300 * Graph hash function. Classic bernstein k=33 hash function, taken from
306 size_t hash = 5381; local
310 hash = ((hash << 5) + hash) + c; /* hash * 3
[all...]
/osnet-11/usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/
H A Dhash.c41 static char sccsid[] = "@(#)hash.c 8.12 (Berkeley) 11/7/95";
62 #include "hash.h"
155 /* Process arguments to set up hash table header. */
161 if (info && info->hash)
162 hashp->hash = info->hash;
164 hashp->hash = __default_hash;
172 /* Verify file type, versions and hash function */
179 if (hashp->hash(CHARKEY, sizeof(CHARKEY))
332 hashp->hash
[all...]
/osnet-11/usr/src/cmd/perl/contrib/Sun/Solaris/Kstat/
H A DKstat.xs31 * scripts this module presents the information as a nested hash data structure.
172 * corresponding perl hash. All such conversion functions are in the following
438 * The following struct => hash functions are all only present on the sparc
609 * structure to find the appropriate function. We use a perl hash to manage the
628 /* Create new hash */
683 * This module converts the flat list returned by kstat_read() into a perl hash
689 * Given module, instance and name keys return a pointer to the hash tied to
690 * the bottommost hash. If the hash already exists, we just return a pointer
691 * to it, otherwise we create the hash an
[all...]
/osnet-11/usr/src/lib/nsswitch/files/common/
H A Dgethostent.c50 uint_t hash = 0; local
54 hash = hash * 15 + tolower(name[i]);
57 return (hash);
172 uint_t hash; local
186 /* hash is equal to IPv4 address */
187 hash = addr_ipv4.s_addr;
189 return (hash);
422 * For non-nscd and libnsl API there is non-hash function with different output.
432 * For systems without nscd and for libnsl API there is non-hash
[all...]
/osnet-11/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
H A DLocalConsumer.java1417 int hash = 17;
1418 hash = (37 * hash) + id;
1419 hash = (37 * hash) + ((int)(timestamp ^ (timestamp >>> 32)));
1420 hash = (37 * hash) + (localHost == null ? 0 :
1422 hash = (37 * hash) + tag.hashCode();
1423 return hash;
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/gnulib/
H A Dfnmatch_loop.c476 int32_t hash; local
498 hash = elem_hash (str, c1);
501 elem = hash % table_size;
504 second = hash % (table_size - 2) + 1;
509 if (symb_table[2 * elem] == hash
697 int32_t hash; local
720 hash = elem_hash (str, c1);
723 elem = hash % table_size;
726 second = hash % (table_size - 2) + 1;
731 if (symb_table[2 * elem] == hash
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/
H A Dav.c932 * first element of the array should be a hash reference that maps
933 * hash keys to array indices.
941 Perl_croak(aTHX_ "Bad index while coercing array into hash");
946 S_avhv_index(pTHX_ AV *av, SV *keysv, U32 hash) argument
953 he = hv_fetch_ent(keys, keysv, FALSE, hash);
955 Perl_croak(aTHX_ "No such pseudo-hash field \"%s\"", SvPV(keysv,n_a));
976 Perl_croak(aTHX_ "Can't coerce array into hash");
981 Perl_avhv_store_ent(pTHX_ AV *av, SV *keysv, SV *val, U32 hash) argument
983 return av_store(av, avhv_index(av, keysv, hash), val);
987 Perl_avhv_fetch_ent(pTHX_ AV *av, SV *keysv, I32 lval, U32 hash) argument
993 Perl_avhv_delete_ent(pTHX_ AV *av, SV *keysv, I32 flags, U32 hash) argument
1009 Perl_avhv_exists_ent(pTHX_ AV *av, SV *keysv, U32 hash) argument
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Devel/Peek/
H A DPeek.pm145 First, use C<mstats_fillhash(%hash)> to get the information contained
146 in the output of mstat() into %hash. The field of this hash are
175 C<mstats2hash($buf, %hash)> to use this information to fill %hash.
177 All three APIs C<fill_mstats($buf)>, C<mstats_fillhash(%hash)>, and
178 C<mstats2hash($buf, %hash)> are designed to allocate no memory if used
179 I<the second time> on the same $buf and/or %hash.
384 =head2 A reference to a hash
386 The following shows the raw form of a reference to a hash
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/lib/libgcrypt/cipher/
H A Dpubkey.c37 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/cmd/perl/5.8.4/distrib/lib/Net/
H A DNNTP.pm580 my $hash = {};
586 $hash->{$a[0]} = [ @a[1,2,3] ];
589 $hash;
598 my $hash = {};
605 $hash->{$m} = [ @a ];
608 $hash;
628 my $hash = {};
635 $hash->{$1} = $ln
639 $hash;
719 C<OPTIONS> are passed in a hash lik
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/commands/
H A Dlegacycfg.c537 grub_uint8_t hash[MD5_HASHLEN]; member in struct:legacy_md5_password
594 return (grub_crypto_memcmp (digest, pw->hash, MD5_HASHLEN) == 0);
661 pw->hash[i == 4 ? 5 : 12+i] = w & 0xff;
662 pw->hash[6+i] = (w >> 8) & 0xff;
663 pw->hash[i] = (w >> 16) & 0xff;
677 pw->hash[11] = w;
/osnet-11/usr/src/lib/libc/port/threads/
H A Dtdb_agent.c112 * This knows for a fact that the hash table has
183 * There is no point allocating the hash table
263 * On the first time through, initialize the hash table and free list.
277 * Look up an address in the synchronization object hash table.
303 * statistics block of every element in the hash table.
358 uint_t hash; local
367 * never been initiated or there is nothing in the hash bucket.
368 * (Once the hash table is allocated, it is never deallocated.)
371 tdbp->tdb_sync_addr_hash[hash = tdb_addr_hash(addr)] == NULL)
375 sapp = &tdbp->tdb_sync_addr_hash[hash];
[all...]
/osnet-11/usr/src/lib/libshell/common/sh/
H A Dparse.c47 #define hash nvlink.hl._hash macro
2033 sfprintf(lexp->kiafile,"%..64d;%c;%.*s;%d;%d;%..64d;%..64d;%c;%d;%s\n",np->hash,type,len,name,first,last,parent,lexp->fscript,pkind,width,attr);
2035 sfprintf(lexp->kiafile,"%..64d;%c;%s;%d;%d;%..64d;%..64d;%c;%d;%s\n",np->hash,type,name,first,last,parent,lexp->fscript,pkind,width,attr);
2037 return(np->hash);
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/include/
H A Ddb.h141 u_int32_t /* hash function */
142 (*hash) __P((const void *, size_t)); member in struct:__anon1014
/osnet-11/usr/src/grub/grub2/include/grub/
H A Dcryptodisk.h71 const gcry_md_spec_t *essiv_hash, *hash, *iv_hash; member in struct:grub_cryptodisk
/osnet-11/usr/src/grub/grub2/include/grub/lib/
H A DLzFind.h46 CLzRef *hash; member in struct:_CMatchFinder
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/t/pod/
H A Dtestcmp.pl37 hash may have a subroutine reference as its corresponding value.
/osnet-11/usr/src/lib/libast/common/cdt/
H A Ddtdisc.c117 if(!(type&DT_SAMEHASH)) /* new hash value */
120 r->hash = _DTHSH(dt,k,disc,disc->size);
H A Ddtmethod.c99 list->hash = _DTHSH(dt,key,disc,disc->size);

Completed in 89 milliseconds

1234567891011