Searched defs:hash (Results 1 - 25 of 99) sorted by relevance

1234

/osnet-11/usr/src/cmd/perl/5.8.4/distrib/t/op/
H A Dhash.t15 ok (!Internals::HvREHASH(%h), "hash doesn't start with rehash flag on");
33 # attack on a prepopulated hash. This is also useful if you need normal
41 # some initial hash data
45 "starting with pre-populated non-pathalogical hash (rehash flag if off)");
55 # the minimum of bits required to mount the attack on a hash
58 # if the hash has already been populated with a significant amount
74 my $hash;
76 # next if exists $hash->{$s};
77 $hash = hash(
93 sub hash { subroutine
[all...]
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/rcache/
H A Drc_common.c14 hash(krb5_donot_replay *rep, unsigned int hsize) function
H A Drc_conv.c39 * Generate a printable hash value for a message for use in a replay
40 * record. It is not necessary for this hash function to be
44 * MD5 hash of the message and convert it into uppercase hex
53 char *hash, *ptr; local
65 hash = malloc(cksum.length * 2 + 1);
66 if (!hash) {
71 for (i = 0, ptr = hash; i < cksum.length; i++, ptr += 2)
74 *out = hash;
/osnet-11/usr/src/lib/libdhcpsvc/modules/binfiles/tools/
H A Dprintnet.c105 unsigned int image, hash; local
107 for (hash = 0; hash < DN_CIDHASHSZ; hash++) {
109 if (header.dnh_cidhash[hash][image] == DN_NOREC)
112 (void) printf(" hash %4d/%d: ", hash, image);
113 recid = header.dnh_cidhash[hash][image];
/osnet-11/usr/src/grub/grub2/grub-core/disk/
H A DAFSplitter.c27 gcry_err_code_t AF_merge (const gcry_md_spec_t * hash, grub_uint8_t * src,
32 diffuse (const gcry_md_spec_t * hash, grub_uint8_t * src, argument
36 grub_uint32_t IV; /* host byte order independend hash IV */
38 grub_size_t fullblocks = size / hash->mdlen;
39 int padding = size % hash->mdlen;
40 grub_uint8_t final[hash->mdlen];
41 grub_uint8_t temp[sizeof (IV) + hash->mdlen];
43 /* hash block the whole data set with different IVs to produce
50 grub_memcpy (temp + sizeof (IV), src + hash->mdlen * i, hash
69 AF_merge(const gcry_md_spec_t * hash, grub_uint8_t * src, grub_uint8_t * dst, grub_size_t blocksize, grub_size_t blocknumbers) argument
[all...]
/osnet-11/usr/src/lib/lvm/libmeta/common/
H A Dmeta_stat.c51 int hash; local
54 hash = 0;
56 hash += *cp;
58 hash &= 0xf;
60 for (scp = statcache_head[hash]; scp != NULL; scp = scp->sc_next)
83 scp->sc_next = statcache_head[hash];
84 statcache_head[hash] = scp;
/osnet-11/usr/src/lib/libnsctl/common/
H A Dhash.c37 hash_node_t **hash; local
39 hash = (hash_node_t **)calloc(HASH_PRIME, sizeof (hash_node_t *));
40 return (hash);
44 nsc_insert_node(hash_node_t **hash, void *data, const char *key) argument
61 node->next = hash[ index ];
62 hash[ index ] = node;
71 * Searches the hash to find a node.
78 nsc_lookup(hash_node_t **hash, const char *key) argument
84 node = hash[ index ];
94 nsc_remove_node(hash_node_t **hash, cha argument
132 nsc_remove_all(hash_node_t **hash, void (*callback)(void *)) argument
160 unsigned int hash, i; local
[all...]
/osnet-11/usr/src/lib/libparted/common/libparted/labels/
H A Dpt-limit.c54 hash (register const char *str, register unsigned int len) function
153 register int key = hash (str, len);
/osnet-11/usr/src/lib/libnisdb/yptol/
H A Dstubs.c105 #pragma weak hash macro
107 hash(char *s) function
/osnet-11/usr/src/lib/libcpc/common/
H A Dsubr.c162 __cpc_strhash_free(cpc_strhash_t *hash) argument
164 cpc_strhash_t *p = hash, *f;
174 * Insert a new key into the hash table.
183 __cpc_strhash_add(cpc_strhash_t *hash, char *key) argument
187 for (p = hash; p != NULL; p = p->next) {
196 tmp = hash->next;
197 hash->next = p;
203 hash->cur = p;
209 __cpc_strhash_next(cpc_strhash_t *hash) argument
213 if (hash
[all...]
/osnet-11/usr/src/lib/libcurses/screen/
H A Dscr_reset.c80 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;
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;
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/crypto/keyhash_provider/
H A Dk5_md5des.c99 /* 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/x2p/
H A Dhash.c1 /* $RCSfile: hash.c,v $$Revision: 4.1 $$Date: 92/08/07 18:29:20 $
9 * $Log: hash.c,v $
26 register int hash; local
31 for (s=key, i=0, hash = 0;
33 s++, i++, hash *= 5) {
34 hash += *s * coeff[i];
36 entry = tb->tbl_array[hash & tb->tbl_max];
38 if (entry->hent_hash != hash) /* strings can't be equal */
52 register int hash; local
58 for (s=key, i=0, hash
101 register int hash; local
[all...]
/osnet-11/usr/src/lib/libast/common/cdt/
H A Ddthdr.h43 #define hash hl._hash macro
49 #define DT_WALK 020000 /* hash table being walked */
58 /* hash start size and load factor */
/osnet-11/usr/src/lib/libast/common/hash/
H A Dhashlib.h27 * hash table library private definitions
45 Hash_hash_f hash; /* name hash routine */ member in struct:__anon1135
61 unsigned int hash; /* last lookup hash */
73 Hash_bucket_t** table; /* hash slot table */ \
76 #include <hash.h>
84 #define HASH(r,n,h) if (r->local->hash) h = r->namesize ? (*r->local->hash)(n, r->namesize) : (*r->local->hash)(
[all...]
/osnet-11/usr/src/lib/nsswitch/files/common/
H A Dgethostent6.c57 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/pkcs11/pkcs11_tpm/common/
H A Ddig_mgr.c480 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
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...]
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...]
/osnet-11/usr/src/lib/libparted/common/libparted/fs/ext2/
H A Dext2_buffer.c144 int hash; local
146 hash = ext2_block_hash(block);
147 a = bc->hash[hash];
184 int hash; local
186 hash = ext2_block_hash(bh->block);
187 if (bh->bc->hash[hash] != NULL)
189 bh->next = bh->bc->hash[hash];
202 int hash; local
[all...]
/osnet-11/usr/src/lib/libproc/common/
H A DPsymtab_machelf32.c103 * 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...]
/osnet-11/usr/src/lib/libldap4/common/
H A Dcache.c427 int first, hash; local
443 hash = cache_hash( &reqber );
444 for ( m = ld->ld_cache->lc_buckets[ hash ]; m != NULLMSG; m = next ) {
451 ld->ld_cache->lc_buckets[ hash ] = next;
/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/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...]

Completed in 125 milliseconds

1234