Searched refs:hash (Results 51 - 75 of 401) sorted by relevance

1234567891011>>

/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/dk/
H A Ddk_decrypt.c41 const struct krb5_hash_provider *hash,
53 const struct krb5_hash_provider *hash,
58 return krb5_dk_decrypt_maybe_trunc_hmac(context, enc, hash, key, usage,
66 const struct krb5_hash_provider *hash,
71 return krb5_dk_decrypt_maybe_trunc_hmac(context, enc, hash, key, usage,
79 const struct krb5_hash_provider *hash,
106 hashsize = hash->hashsize;
145 /* verify the hash */
158 if ((ret = krb5_hmac(context, hash, derived_hmac_key,
50 krb5_dk_decrypt( krb5_context context, const struct krb5_enc_provider *enc, const struct krb5_hash_provider *hash, const krb5_keyblock *key, krb5_keyusage usage, const krb5_data *ivec, const krb5_data *input, krb5_data *output) argument
63 krb5int_aes_dk_decrypt( krb5_context context, const struct krb5_enc_provider *enc, const struct krb5_hash_provider *hash, const krb5_keyblock *key, krb5_keyusage usage, const krb5_data *ivec, const krb5_data *input, krb5_data *output) argument
76 krb5_dk_decrypt_maybe_trunc_hmac( krb5_context context, const struct krb5_enc_provider *enc, const struct krb5_hash_provider *hash, const krb5_keyblock *key, krb5_keyusage usage, const krb5_data *ivec, const krb5_data *input, krb5_data *output, size_t hmacsize) argument
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/
H A Dhmac.c98 * where H is a cryptographic hash
107 krb5_const struct krb5_hash_provider *hash,
122 if (hash == NULL) {
123 KRB5_LOG0(KRB5_ERR, "krb5_hmac() error hash == NULL\n");
139 hashsize = hash->hashsize;
140 blocksize = hash->blocksize;
147 array to compute the outer hash */
151 /* allocate space for the xor key, hash input vector, and inner hash */
173 /* compute the inner hash */
106 krb5_hmac(krb5_context context, krb5_const struct krb5_hash_provider *hash, krb5_const krb5_keyblock *key, krb5_const unsigned int icount, krb5_const krb5_data *input, krb5_data *output) argument
[all...]
H A Dchecksum_length.c50 *length = krb5_cksumtypes_list[i].hash->hashsize;
H A Dencrypt_length.c46 (krb5_enctypes_list[i].enc, krb5_enctypes_list[i].hash,
/illumos-gate/usr/src/lib/libnsl/yp/
H A Ddbm.c127 long hash; local
129 hash = calchash(key);
131 blkno = hash & hmask;
265 long hash; local
272 hash = calchash(key);
273 dbm_access(hash);
288 hash = hashinc(hash);
289 if (hash == 0)
291 return (firsthash(hash));
295 firsthash(long hash) argument
319 dbm_access(long hash) argument
469 hashinc(long hash) argument
[all...]
/illumos-gate/usr/src/cmd/refer/
H A Dinv2.c21 extern int hash();
29 * format of outf is : hash code space record pointer
71 fprintf(outf, "%04d %06ld\n", hash(keyv[i])%nhash, lp);
74 printf("key %s hash %d\n",
75 keyv[i], hash(keyv[i])%nhash);
89 hash(key)%nhash, lp);
/illumos-gate/usr/src/cmd/fs.d/nfs/mountd/
H A Dhashset.h41 extern HASHSET h_create(uint_t (*hash) (const void *),
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Ddnlc.c65 nc_hash_t hash; local
75 if (mdb_vread(&hash, sizeof (hash), dwp->dw_head) == -1) {
81 addr = (uintptr_t)hash.hash_next;
H A Dldi.c47 struct ldi_handle **hash; /* current bucket pointer */ member in struct:lh_walk
49 size_t index; /* hash table index */
57 struct ldi_ident **hash; /* current bucket pointer */ member in struct:li_walk
59 size_t index; /* hash table index */
77 /* get the address of the hash table */
84 lhwp->hash = (struct ldi_handle **)(uintptr_t)sym.st_value;
87 /* get the address of the first element in the first hash bucket */
89 (uintptr_t)lhwp->hash)) == -1) {
90 mdb_warn("couldn't read ldi handle hash at %p", lhwp->hash);
[all...]
/illumos-gate/usr/src/boot/sys/boot/efi/loader/arch/arm/
H A Dldscript.arm61 .hash : { *(.hash) }
/illumos-gate/usr/src/common/lzma/
H A DLzFind.c132 p->hash = 0;
147 alloc->Free(alloc, p->hash, 0);
148 p->hash = 0;
226 if (p->hash != 0 && prevSize == newSize)
229 p->hash = AllocRefs(newSize, alloc);
230 if (p->hash != 0)
232 p->son = p->hash + p->hashSizeSum;
270 p->hash[i] = kEmptyHashValue;
302 MatchFinder_Normalize3(subValue, p->hash, p->hashSizeSum + p->numSons);
484 curMatch = p->hash[hashValu
[all...]
/illumos-gate/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;
/illumos-gate/usr/src/cmd/fm/eversholt/common/
H A Dstable.c43 #define DEF_HASH_SIZE 11113 /* default hash table size */
46 static char **Stable; /* the hash table */
69 * hash table is sized according to sz. sz of zero means pick
76 /* allocate hash table */
85 Stablecount = stats_new_counter("stable.size", "hash table size", 1);
145 unsigned hash = DEF_HASH_SIZE ^ ((unsigned)*s << 2); local
157 hash ^= (((unsigned)*sptr) << (slen % 3)) +
160 hash ^= slen;
163 hash %= Stablesz;
165 ptrp = &Stable[hash];
[all...]
/illumos-gate/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...]
/illumos-gate/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...]
/illumos-gate/usr/src/cmd/truss/
H A Dhtbl.c101 uint_t hash = 0; local
107 hash = (hash << 4) + *p;
108 if ((g = (hash & 0xf0000000)) != 0) {
109 hash ^= (g >> 24);
110 hash ^= g;
114 return (hash & (sz - 1));
169 * using this it is possible to iterate through the entries of a hash table
223 htbl_t *hash; local
231 hash
[all...]
/illumos-gate/usr/src/cmd/prstat/
H A Dprfile.c170 int hash = pid % FDS_TABLE_SIZE; local
172 for (fdsp = fds_tbl[hash]; fdsp; fdsp = fdsp->fds_next)
178 fdsp->fds_next = fds_tbl[hash];
179 fds_tbl[hash] = fdsp;
188 int hash = pid % FDS_TABLE_SIZE; local
190 for (fds = fds_tbl[hash]; fds && fds->fds_pid != pid;
204 fds_tbl[hash] = fds->fds_next;
/illumos-gate/usr/src/cmd/fs.d/nfs/statd/
H A Dsm_proc.c406 unsigned int hash; local
468 SMHASH(new->id.mon_id.mon_name, hash);
469 mutex_lock(&mon_table[hash].lock);
470 monitor_q = mon_table[hash].sm_monhdp;
472 /* If mon_table hash list is empty. */
475 (void) printf("\nAdding to monitor_q hash %d\n", hash);
477 mon_table[hash].sm_monhdp = new;
478 mutex_unlock(&mon_table[hash].lock);
515 mutex_unlock(&mon_table[hash]
560 unsigned int hash; local
637 unsigned int hash; local
845 int hash; local
[all...]
/illumos-gate/usr/src/cmd/sgs/link_audit/common/
H A Dhash.c30 #include "hash.h"
34 hash *
37 hash *ptr;
48 hash *
51 hash *ptr;
63 get_hash(hash *tbl, char *key)
114 find_hash(hash *tbl, const char *key)
137 del_hash(hash *tbl, const char *key)
201 operate_hash(hash *tbl, void (*ptr)(), const char *usr_arg)
215 operate_hash_addr(hash *tb
[all...]
/illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
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;
/illumos-gate/usr/src/cmd/svc/common/
H A Dmanifest_find.c70 int tsd_flags; /* Check flags for hash and extension */
77 * Add the manifest info consisting of filename (fn), hash property name
78 * (pname) and hash to the array at tsd_array. If necessary, realloc()
85 add_pointer(mftsd_t *tsdp, const char *fn, const char *pname, uchar_t *hash) argument
115 if (hash != NULL)
116 (void) memcpy(info->mi_hash, hash, MHASH_SIZE);
188 uchar_t hash[MHASH_SIZE]; local
212 hash) == MHASH_NEWFILE) {
213 return (add_pointer(tsdp, fn, pname, hash));
231 * 0x1 - CHECKHASH - do the hash chec
[all...]
/illumos-gate/usr/src/uts/common/sys/
H A Ddnlc.h79 struct ncache *hash_next; /* hash chain, MUST BE FIRST */
83 int hash; /* hash signature */ member in struct:ncache
115 int move_to_front; /* entry moved to front of hash chain */
158 * 'hash' and 'namlen' must be l-values. A check is made to ensure
161 #define DNLCHASH(name, dvp, hash, namlen) \
165 hash = (int)((uintptr_t)(dvp)) >> 8; \
167 (hash) = ((hash) << 4) + (hash)
[all...]

Completed in 165 milliseconds

1234567891011>>