Searched refs:hash (Results 176 - 200 of 401) sorted by relevance

1234567891011>>

/illumos-gate/usr/src/uts/common/io/scsi/adapters/iscsi/
H A DiscsiAuthClientGlue.c266 iscsiAuthMd5Final(uchar_t *hash, IscsiAuthMd5Context *context) argument
268 MD5Final(hash, context);
/illumos-gate/usr/src/grub/grub-0.97/stage2/
H A Dfsys_zfs.h178 #define ZAP_HASH_IDX(hash, n) (((n) == 0) ? 0 : ((hash) >> (64 - (n))))
195 * block size shift - hash entry size (2) * number of hash
203 * The chunks start immediately after the hash table. The end of the
204 * hash table is at l_hash + HASH_NUMENTRIES, which we simply cast to a
/illumos-gate/usr/src/uts/common/os/
H A Dkcpc.c122 long hash; local
138 for (hash = 0; hash < CPC_HASH_BUCKETS; hash++)
139 mutex_init(&kcpc_ctx_llock[hash],
814 long hash; local
820 hash = CPC_HASH_CTX(ctx);
821 mutex_enter(&kcpc_ctx_llock[hash]);
822 ctx->kc_next = kcpc_ctx_list[hash];
823 kcpc_ctx_list[hash]
896 long hash = CPC_HASH_CTX(ctx); local
1579 long hash; local
[all...]
H A Dmodsubr.c460 * remove specs from hash table
478 int hash = 0; local
481 hash ^= c;
483 return (hash & MOD_BIND_HASHMASK);
530 * hash table supplied. Reject the attempt to do so if 'name' is already
531 * in the hash table.
556 /* Insert at head of hash */
564 * Delete a binding from a binding-hash. Since there is no locking we
597 /* search all hash lists for items that associated with 'num' */
676 * two hash entrie
867 hwc_hash_insert(struct hwc_spec *spec, char *name, mod_hash_t *hash) argument
901 hwc_hash_remove(struct hwc_spec *spec, char *name, mod_hash_t *hash) argument
[all...]
H A Dbio.c153 #define BIO_HASHLEN 4 /* Target length of hash chains */
598 * Avoid holding the hash lock in the event that
599 * the buffer is locked by someone. Since the hash chain
600 * may change when we drop the hash lock
686 * bio_getfreeblk may block so check the hash chain again.
696 * New buffer. Assign nbp and stick it on the hash.
748 * Returns a locked buffer that is not on any hash or free list.
883 * Lock ordering is b_sem > hash lock (brelse).
886 * b_sem lock while holding hash lock. So transfer all the
887 * candidates on the delwri_list and then drop the hash lock
1452 int hash = 0; local
[all...]
/illumos-gate/usr/src/lib/libtnf/
H A Dinfo.c95 /* next in hash chain */
172 unsigned hash; local
187 hash = TAGHASH(tnf, tag);
188 bucket = tnf->tag_table[hash];
190 tnf->tag_table[hash] = info;
/illumos-gate/usr/src/cmd/xstr/
H A Dxstr.c26 * xstr - extract and hash strings in a C program
304 struct hash { struct
307 struct hash *hnext;
315 struct hash *hp, *hp0;
342 struct hash *hp;
/illumos-gate/usr/src/cmd/msgfmt/
H A Dgnu_msgfmt.h88 unsigned int hash; /* hash value of msgid */ member in struct:messages
103 unsigned int hash_size; /* hash table size */
/illumos-gate/usr/src/cmd/sh/
H A Dhashserv.c34 #include "hash.h"
352 short hash; local
356 hash = pathlook(name, 0, 0);
357 if (hashtype(hash) == NOTFOUND)
364 hashval = hashdata(hash);
/illumos-gate/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...]
/illumos-gate/usr/src/lib/libelfsign/common/
H A Delfsignlib.c894 elfsign_hash_common(ELFsign_t ess, uchar_t *hash, size_t *hash_len, argument
902 /* The buffer must be large enough to hold the hash */
906 bzero(hash, *hash_len);
946 * throw this section into the hash
957 cryptodebug("elfsign_hash: updating hash "
968 SHA1Final(hash, &ctx);
975 tohexstr(hash, *hash_len, hashstr, hashstr_len);
976 cryptodebug("hash value is: %s", hashstr);
986 * elfsign_hash - return the hash of the ELF sections affecting execution.
989 * OUT: hash, hash_le
992 elfsign_hash(ELFsign_t ess, uchar_t *hash, size_t *hash_len) argument
1005 elfsign_hash_mem_resident(ELFsign_t ess, uchar_t *hash, size_t *hash_len) argument
1027 uchar_t hash[SIG_MAX_LENGTH]; local
[all...]
/illumos-gate/usr/src/cmd/cmd-inet/usr.lib/wpad/
H A Dwpa_enc.c174 uint8_t hash[SHA1_MAC_LEN]; local
196 hmac_sha1_vector(key, key_len, 4, addr, len, hash);
197 (void) memcpy(&buf[pos], hash, plen);
/illumos-gate/usr/src/cmd/csh/
H A Dsh.exec.c135 hashval1 = hash(hashval, i);
411 hashval = hash(hashname(strtots(curdir_, dp->d_name)),
457 h = hash(h, *cp++);
/illumos-gate/usr/src/cmd/svc/startd/
H A Dcontract.c248 * contract_hash is a hash table of contract ids to restarter instance
259 int hash; local
261 hash = ctid & CI_HASH_MASK;
263 bp = &contract_hash[hash];
353 * Lookup the instance id in the hash table by the contract id.
/illumos-gate/usr/src/lib/libtecla/common/
H A Dhistory.c74 * History lines are recorded in a hash table, such that repeated
77 * Start by defining the size of the hash table. This should be a
85 * Each history line will be represented in the hash table by a
90 GlhHashBucket *bucket; /* The parent hash-table bucket of this node */
92 /* parent hash-table bucket. */
106 static int _glh_is_line(GlhHashNode *hash, const char *line, size_t n);
108 static void _glh_return_line(GlhHashNode *hash, char *line, size_t dim);
111 * All history lines which hash to a given bucket in the hash table, are
125 GlhHashBucket bucket[GLH_HASH_SIZE]; /* The buckets of the hash tabl
180 GlhLineHash hash; /* A hash-table of reference-counted history lines */ member in struct:GlHistory
2383 _glh_is_line(GlhHashNode *hash, const char *line, size_t n) argument
2467 _glh_return_line(GlhHashNode *hash, char *line, size_t dim) argument
[all...]
/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/
H A Dhash.c38 static char sccsid[] = "@(#)hash.c 8.12 (Berkeley) 11/7/95";
57 #include "hash.h"
164 /* Process arguments to set up hash table header. */
170 if (info && info->hash)
171 hashp->hash = info->hash;
173 hashp->hash = __default_hash;
181 /* Verify file type, versions and hash function */
188 if (hashp->hash(CHARKEY, sizeof(CHARKEY))
340 hashp->hash
[all...]
/illumos-gate/usr/src/uts/common/io/fibre-channel/fca/emlxs/
H A Demlxs_node.c479 uint32_t hash; local
520 hash = EMLXS_DID_HASH(did);
521 nlp = port->node_table[hash];
940 uint32_t hash; local
942 hash = EMLXS_DID_HASH(ndlp->nlp_DID);
943 np = port->node_table[hash];
948 port->node_table[hash] = ndlp;
975 uint32_t hash; local
978 hash = EMLXS_DID_HASH(ndlp->nlp_DID);
979 np = port->node_table[hash];
[all...]
/illumos-gate/usr/src/uts/intel/dtrace/
H A Dfbt.c449 fbt_probe_t *fbt = parg, *next, *hash, *last; local
467 hash = fbt_probetab[ndx];
469 while (hash != fbt) {
470 ASSERT(hash != NULL);
471 last = hash;
472 hash = hash->fbtp_hashnext;
/illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
H A DLocalConsumer.java1415 int hash = 17;
1416 hash = (37 * hash) + id;
1417 hash = (37 * hash) + ((int)(timestamp ^ (timestamp >>> 32)));
1418 hash = (37 * hash) + (localHost == null ? 0 :
1420 hash = (37 * hash) + tag.hashCode();
1421 return hash;
[all...]
/illumos-gate/usr/src/cmd/mdb/common/modules/libtopo/
H A Dlibtopo.c39 * the modhash and we also cache the length of the hash
53 * keep track of where they're at in the node hash
57 topo_nodehash_t hash; member in struct:tnwalk_state
132 "Module hash");
198 "Next module in hash chain");
302 "Parent hash bucket");
855 if (mdb_vread(&(state->hash), sizeof (topo_nodehash_t),
864 (uintptr_t)(state->hash.th_nodearr+i)) != sizeof (tnode_t *)) {
867 state->hash.th_nodearr+i);
874 if (state->hash_idx >= state->hash
[all...]
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppd/
H A Dchap.c442 u_char hash[MD5_SIGNATURE_SIZE]; local
533 MD5Final(hash, &mdContext);
538 BCOPY(hash, cstate->response, MD5_SIGNATURE_SIZE);
581 u_char hash[MD5_SIGNATURE_SIZE]; local
639 * do the hash ourselves, and compare the result.
663 MD5Final(hash, &mdContext);
666 if (memcmp (hash, remmd, MD5_SIGNATURE_SIZE) == 0)
/illumos-gate/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...]
/illumos-gate/usr/src/cmd/oawk/
H A Dtran.c156 h = hash(n);
166 hash(wchar_t *s) /* form hash value for string s */ function
184 for (p = tab[hash(s)]; p != NULL; p = p->nextval)
/illumos-gate/usr/src/cmd/keyserv/
H A Dkeyserv_cache.c596 printf("Active hash buckets:\n");
619 printf("\ncounted hash inuse = %d, errors = %d\n", inuse, inuse_err);
802 u_int hash; local
805 hash = hashval(uid);
810 for (cd = (*ch)->bucket[hash]; cd != 0; cd = cd->nexthash) {
815 list_remove_hash(cd, &((*ch)->bucket[hash]), 0, 0);
841 /* Extract from hash list */
910 /* Re-insert on hash list */
996 u_int hash; local
1004 hash
1044 u_int hash; local
[all...]
/illumos-gate/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:__anon2516

Completed in 105 milliseconds

1234567891011>>