Searched refs:hash (Results 151 - 175 of 401) sorted by relevance

1234567891011>>

/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/
H A Dhsearch.c64 info.hash = NULL;
/illumos-gate/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 */
H A Ddthash.c32 /* resize the hash table */
87 if((is = s + HINDEX(n,t->hash)) == hs)
170 s = dt->data->htab + HINDEX(dt->data->ntab,dt->data->here->hash);
193 hsh = r->hash;
198 { hsh = t->hash;
209 { if(hsh == t->hash)
255 r->hash = hsh;
/illumos-gate/usr/src/lib/libast/common/hash/
H A Dhashsize.c27 * hash table library
69 index = new_b->hash;
/illumos-gate/usr/src/uts/common/sys/
H A Dmodhash_impl.h32 * Internal details for the kernel's generic hash implementation.
45 mod_hash_key_t mhe_key; /* stored hash key */
46 mod_hash_val_t mhe_val; /* stored hash value */
60 char *mh_name; /* hash name */
71 /* hash algorithm, and algorithm-private data */
75 struct mod_hash *mh_next; /* next hash in list */
105 void i_mod_hash_clear_nosync(mod_hash_t *hash);
/illumos-gate/usr/src/cmd/make/bin/
H A Ddosys.cc85 register int length = command->hash.length;
/illumos-gate/usr/src/boot/sys/boot/arm/uboot/
H A Dldscript.arm19 .hash : { *(.hash) }
/illumos-gate/usr/src/boot/sys/boot/efi/loader/arch/arm64/
H A Dldscript.arm6479 .hash : { *(.hash) }
/illumos-gate/usr/src/boot/sys/boot/efi/loader/arch/i386/
H A Dldscript.i38667 .hash : { *(.hash) }
/illumos-gate/usr/src/cmd/units/
H A Dunits.c80 struct table *hash(char *name);
255 q = hash(name);
323 lp = hash(np);
328 lp = hash("");
362 tp = hash(np);
374 lp = hash(np);
480 hash(char *name) function
/illumos-gate/usr/src/uts/intel/dtrace/
H A Dsdt.c196 sdt_probe_t *sdp = parg, *old, *last, *hash; local
215 hash = sdt_probetab[ndx];
217 while (hash != sdp) {
218 ASSERT(hash != NULL);
219 last = hash;
220 hash = hash->sdp_hashnext;
/illumos-gate/usr/src/uts/common/io/
H A Dcryptmod.c341 /* Need extra space for hash and counfounder */
701 * Get a SHA1 hash on the input data.
714 * Get an MD5 hash on the input data.
1573 hash_info_t *hash)
1606 (char *)hmacbuff, hash->hash_len);
1655 hash_info_t *hash)
1685 (char *)hmacbuff, hash->hash_len);
1746 hash_info_t *hash)
1776 * at the head of the mblk for the confounder and hash info.
1784 cipherlen = inlen - hash
1572 aes_decrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
1654 aes_encrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
1745 arcfour_hmac_md5_decrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
1978 arcfour_hmac_md5_encrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
2235 des_cbc_encrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
2397 des_cbc_decrypt(queue_t *q, struct tmodinfo *tmi, mblk_t *mp, hash_info_t *hash) argument
[all...]
/illumos-gate/usr/src/cmd/vi/misc/
H A Dxstr.c54 * xstr - extract and hash strings in a C program
303 struct hash { struct
306 struct hash *hnext;
316 register struct hash *hp, *hp0;
325 hp = (struct hash *) calloc(1, sizeof (*hp));
338 register struct hash *hp;
/illumos-gate/usr/src/uts/common/io/dls/
H A Ddls_link.c46 * Construct a hash key encompassing both DLSAP value and VLAN idenitifier.
275 mod_hash_t *hash = dlp->dl_str_hash; local
286 * Construct a hash key from the VLAN identifier and the
292 * Search the hash table for dld_str_t eligible to receive
293 * a packet chain for this DLSAP/VLAN combination. The mod hash's
294 * internal lock serializes find/insert/remove from the mod hash list.
295 * Incrementing the dh_ref (while holding the mod hash lock) ensures
298 if (mod_hash_find_cb_rval(hash, key, (mod_hash_val_t *)&dhp,
338 mod_hash_t *hash = dlp->dl_str_hash; local
410 * Construct a hash ke
914 mod_hash_t *hash = dlp->dl_str_hash; local
962 mod_hash_t *hash = dlp->dl_str_hash; local
[all...]
/illumos-gate/usr/src/lib/libsmbfs/smb/
H A Dntlm.c66 * Given a password, compute the LM hash.
70 * hash: 16-byte "LanMan" (LM) hash (normally ctx->ct_lmhash)
80 ntlm_compute_lm_hash(uchar_t *hash, const char *pass) argument
96 /* Compute the hash. */
97 err = smb_encrypt_DES(hash, NTLM_HASH_SZ,
107 * Given a password, compute the NT hash.
111 * hash: 16-byte "NT" hash (normally ctx->ct_nthash)
117 ntlm_compute_nt_hash(uchar_t *hash, cons argument
147 ntlm_v1_response(uchar_t *resp, const uchar_t *hash, const uchar_t *chal, int clen) argument
[all...]
/illumos-gate/usr/src/uts/common/io/net80211/
H A Dnet80211_node.c842 int32_t hash; local
851 hash = ieee80211_node_hash(macaddr);
863 list_insert_tail(&nt->nt_hash[hash], in);
956 int hash; local
960 hash = ieee80211_node_hash(macaddr);
961 in = list_head(&nt->nt_hash[hash]);
965 in = list_next(&nt->nt_hash[hash], in);
994 int hash; local
998 hash = ieee80211_node_hash(macaddr);
999 in = list_head(&nt->nt_hash[hash]);
1311 int32_t hash; local
1347 int32_t hash; local
[all...]
/illumos-gate/usr/src/cmd/sgs/libld/common/
H A Dmap_support.c817 Word hash; local
857 hash = (Word)elf_hash(name);
858 if (((mv->mv_vdp = ld_vers_find(name, hash,
860 ((mv->mv_vdp = ld_vers_desc(name, hash,
1065 Word hash; local
1079 hash = (Word)elf_hash(ms->ms_name);
1104 if ((sdp = ld_sym_find(ms->ms_name, hash, &where, ofl)) == NULL) {
1113 if ((sdp = ld_sym_enter(ms->ms_name, sym, hash,
1432 Word hash; local
1457 hash
[all...]
H A Dversion.c36 ld_vers_find(const char *name, Word hash, APlist *alp) argument
42 if (vdp->vd_hash != hash)
57 ld_vers_desc(const char *name, Word hash, APlist **alpp) argument
65 vdp->vd_hash = hash;
650 Word hash; local
665 hash = (Word)elf_hash(name);
666 if (((ivdp = ld_vers_find(name, hash,
668 ((ivdp = ld_vers_desc(name, hash,
704 if ((ovdp = ld_vers_find(name, hash,
706 if ((ovdp = ld_vers_desc(name, hash,
[all...]
/illumos-gate/usr/src/lib/pkcs11/pkcs11_softtoken/common/
H A DsoftEC.c429 CK_BYTE hash[SHA1_HASH_SIZE]; local
434 rv = soft_digest_final(session_p, hash, &hash_len);
436 rv = soft_digest(session_p, pData, ulDataLen, hash,
450 rv = soft_ecc_sign(session_p, hash, hash_len, pSigned, pulSignedLen);
599 CK_BYTE hash[SHA1_HASH_SIZE]; local
603 rv = soft_digest_final(session_p, hash, &hash_len);
605 rv = soft_digest(session_p, pData, ulDataLen, hash, &hash_len);
621 rv = soft_ecc_verify(session_p, hash, hash_len,
/illumos-gate/usr/src/lib/libelfsign/common/
H A Dlibelfsign.h130 extern ELFsign_status_t elfsign_hash(ELFsign_t ess, uchar_t *hash,
133 uchar_t *hash, size_t *hash_len);
/illumos-gate/usr/src/lib/libsqlite/src/
H A DvdbeInt.h177 HashElem *pSearch; /* The hash element for pCurrent */
178 Hash hash; /* Hash table of all aggregate elements */ member in struct:Agg
195 Hash hash; /* A set is just a hash table */ member in struct:Set
196 HashElem *prev; /* Previously accessed hash elemen */
/illumos-gate/usr/src/cmd/cmd-inet/usr.lib/in.ripngd/
H A Dtables.c122 * Computes a hash by XOR-ing the (up to sixteen) octets that make up an IPv6
182 uint_t hash; local
187 hash = rthash(dst, prefix_length);
189 rh = &net_hashes[prefix_length][hash & ROUTEHASHMASK];
192 if (rt->rt_hash != hash)
239 uint_t hash; local
259 hash = rthash(&pdst, prefix_length);
260 rh = &net_hashes[prefix_length][hash & ROUTEHASHMASK];
271 rt->rt_hash = hash;
/illumos-gate/usr/src/cmd/sgs/elfdump/common/
H A D_elfdump.h183 #define hash hash64 macro
207 #define hash hash32 macro
/illumos-gate/usr/src/uts/common/fs/lofs/
H A Dlofs_subr.c61 * Due to the hashing algorithm, the size of the hash table needs to be a
127 * the correct table), so we hash to the wrong bucket, grab the wrong
156 uint_t hash; local
162 hash = ltablehash(vp, htsize);
163 mutex_enter(&chain[hash].lh_lock);
166 mutex_exit(&chain[hash].lh_lock);
548 * TABLE_LOCK_ENTER() cannot hash to a bucket beyond oldsize,
560 uint_t hash = ltablehash(tlp->lo_vp, newsize); local
563 tlp->lo_next = newtable[hash].lh_chain;
564 newtable[hash]
[all...]
/illumos-gate/usr/src/uts/common/io/cxgbe/t4nex/
H A Dt4_l2t.c50 * jhash.h: Jenkins hash support.
54 * http://burtleburtle.net/bob/hash/
59 * hash(), hash2(), hash3, and mix() are externally useful functions.
60 * Routines to test the hash are included if SELF_TEST is defined.
168 * presently in the hash table. We need to remove it.
171 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next) {
269 * neighbors to be on the same hash chain. We keep v4 entries in the first
270 * half of available hash buckets and v6 in the second.
302 * family, something made trivial by the separation of IP and IPv6 hash chains
397 * Called when an L2T entry has no more users. The entry is left in the hash
480 int hash; local
[all...]

Completed in 100 milliseconds

1234567891011>>