Searched defs:hash (Results 101 - 125 of 263) sorted by relevance

1234567891011

/illumos-gate/usr/src/cmd/boot/common/
H A Dbblk_einfo.c38 bblk_hash_t bblk_no_hash = {BBLK_NO_HASH, 0, "(no hash)", NULL};
192 unsigned char *hash = NULL; local
205 "present but hash offset %d is beyond the buffer "
209 hash = (unsigned char *)einfo + einfo->hash_off;
239 (void) fprintf(stdout, "%s hash: ",
248 (void) fprintf(stdout, "%02x", hash[i]);
255 compute_hash(bblk_hs_t *hs, unsigned char *dest, bblk_hash_t *hash) argument
257 if (hs == NULL || dest == NULL || hash == NULL)
260 hash->compute_hash(dest, hs->src_buf, hs->src_size);
275 * 'dest' might be both containing the buffer we want to hash an
[all...]
/illumos-gate/usr/src/lib/passwdutil/
H A Dfiles_attr.c703 char *hash = NULL; local
715 hash = crypt(p->data.val_s, salt);
717 if (hash == NULL) {
721 pword = strdup(hash);
/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
/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/lib/libbc/libc/gen/common/
H A Dndbm.c174 long hash; local
176 hash = dcalchash(key);
178 db->dbm_blkno = hash & db->dbm_hmask;
324 dbm_hashinc(DBM *db, long hash) argument
329 hash &= db->dbm_hmask;
335 if((hash&bit) == 0)
336 return(hash|bit);
337 hash &= ~bit;
346 dbm_firsthash(DBM *db, long hash) argument
352 dbm_access(db, hash);
446 long hash; local
609 dbm_access(DBM *db, long hash) argument
[all...]
/illumos-gate/usr/src/lib/libkvm/common/
H A Dkvm.c311 long hash = DUMP_HASH(&kd->kvm_dump, as, page); local
312 off = kd->kvm_map[hash].dm_first;
321 hash) {
/illumos-gate/usr/src/cmd/ypcmd/mknetid/
H A Dmknetid.c380 hash(str, size) function
412 val = hash((unsigned char *) name, PRNTABSIZE);
438 val = hash((unsigned char *) user, GRPTABSIZE);
476 val = hash((unsigned char *) user, GRPTABSIZE);
/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/cmd-inet/usr.sbin/in.routed/
H A Dinput.c1261 * Get a peer_hash structure from the hash of known peers. Create a
1281 msglog("no memory for peer hash");
1285 /* Search for peer in existing hash table */
1320 msglog("no memory for peer hash entry");
1381 uchar_t hash[RIP_AUTH_PW_LEN]; local
1472 * Given a good hash value, these are not security
1493 "MD5 RIPv2 hash has %#x"
1507 MD5Final(hash, &md5_ctx);
1508 if (0 == memcmp(hash, na2->au.au_pw, sizeof (hash)))
[all...]
/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/cmd/sgs/libld/common/
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/cmd/abi/spectrans/spec2map/
H A Dbucket.c63 * create_lists -- initialize the bucket list and hash map.
638 * new_hashmap -- create the hash.
647 errlog(FATAL, "out of memory creating a hash-map of "
694 int hash = checksum(version_name); local
699 if (Hashhead.hh_last != NULL && Hashhead.hh_last->h_hash == hash &&
706 if (current->h_hash == hash &&
/illumos-gate/usr/src/cmd/awk/
H A Dtran.c229 h = hash(s, tp->size);
269 h = hash(n, tp->size);
278 hash(uchar *s, int n) /* form hash value for string s */ function
300 nh = hash(cp->nval, nsz);
316 h = hash(s, tp->size);
/illumos-gate/usr/src/cmd/bart/
H A Dcreate.c644 * to update the md5 hash buffer, and outputs the chunks
645 * to stdout. When stdin is exhausted, the hash is computed,
648 * returns: The md5 hash of stdin, or NULL if unsuccessful for any reason.
654 unsigned char hash[MD5_DIGEST_LENGTH]; local
667 /* got some data. Now update hash */
671 /* done passing through data, calculate hash */
672 MD5Final(hash, &ctx);
675 (void) sprintf(hash_str + (i*2), "%2.2x", hash[i]);
/illumos-gate/usr/src/cmd/ipf/tools/
H A Dip_fil.c880 u_char hash[16]; local
885 * Compute the base value of the ISS. It is a hash
898 MD5Final(hash, &ctx);
900 memcpy(&newiss, hash, sizeof(newiss));
/illumos-gate/usr/src/uts/common/inet/ip/
H A Dip_dce.c133 uint_t hash; local
157 hash = RANDOM_HASH((uint64_t)((uintptr_t)dce | seed));
160 if (hash % fraction_pmtu != 0) {
165 if (hash % fraction != 0) {
207 * mean that the number of entries in the hash buckets has exceeded a tunable
299 * Allocate a default DCE and a hash table for per-IP address DCEs
407 uint_t hash; local
415 hash = IRE_ADDR_HASH(dst, ipst->ips_dce_hashsize);
416 dcb = &ipst->ips_dce_hash_v4[hash];
448 uint_t hash; local
490 uint_t hash; local
556 uint_t hash; local
[all...]
/illumos-gate/usr/src/uts/common/fs/nfs/
H A Dnfs4_idmap.c154 #define ID_HASH(id, hash) \
156 (hash) = MOD2(((id) ^ NFSID_CACHE_ANCHORS), NFSID_CACHE_ANCHORS); \
1081 * Ops per hash queue
1154 * The only serialization required it to hold the hash chain lock
1156 * to all hash chains while flushing. It is possible that (valid)
1157 * entries could be cached in later hash chains after we start flushing.
1161 * Ops per hash queue
1179 * remove list from hash header so we can release
1245 * Callback reclaim function for VM. We reap timed-out entries from all hash
1269 * hash queu
1459 uint_t hash; local
[all...]
/illumos-gate/usr/src/uts/common/fs/sockfs/
H A Dnl7curi.h124 struct uri_desc_s *hash; /* Hash *next */ member in struct:uri_desc_s
153 /* Hash the (char)c to the hash accumulator (uint32_t)hv */
156 #define URI_TEMP (uri_desc_t *)-1 /* Temp (nocache) uri_t.hash pointer */
/illumos-gate/usr/src/tools/ctf/cvt/
H A Dtdata.c40 * The layout hash is used during the equivalency checking. We have a node in
45 * the node into the hash. If we don't, we'll end up with the vast majority of
51 * incorporate anything into the hash for a named struct or union node that
87 * the hash value, assuming there are any.
93 /* Use the first element in the hash value */
379 * we store the iidescs as a hash.
438 tdata_build_hashes_common(tdata_t *td, hash_t *hash) argument
440 (void) iitraverse_hash(hash, &td->td_curvgen, NULL, NULL,
/illumos-gate/usr/src/tools/stabs/
H A Dstabs.c248 * Check if we have this node in the hash table already
253 int hash = HASH(h); local
254 struct tdesc *tdp = hash_table[hash];
259 tdp = tdp->hash;
597 * find the tdesc struct in the hash table for this type
601 if (tdp == NULL) { /* not in hash list */
712 * Add a node to the hash queues.
717 int hash = HASH(num); local
722 * If it already exists in the hash table don't add it again
728 tdp->hash
751 int hash = compute_sum(name); local
[all...]
/illumos-gate/usr/src/uts/common/inet/kssl/
H A Dksslapi.c690 uchar_t hash[MAX_HASH_LEN]; local
701 version, mp->b_rptr, rec_sz, hash);
703 bcmp(hash, recend, mac_sz)) {
900 uchar_t hash[MAX_HASH_LEN]; local
912 version, mp->b_rptr, rec_sz, hash);
914 bcmp(hash, recend, mac_sz)) {
/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...]
/illumos-gate/usr/src/uts/i86pc/io/amd_iommu/
H A Damd_iommu_acpi.c461 amd_iommu_acpi_ivhd_t **hash)
529 /* All range type entries are put on hash entry 0 */
610 * Now add it to the hash
612 ASSERT(hash[idx] != acpi_ivhdp);
613 acpi_ivhdp->ach_next = hash[idx];
614 hash[idx] = acpi_ivhdp;
619 * in an alias entry. This routine adds it to the hash
622 add_implicit_deventry(ivhd_container_t *ivhdcp, amd_iommu_acpi_ivhd_t **hash) argument
651 add_deventry_info(ivhdcp->ivhdc_ivhd, &deventry, hash);
662 add_ivhdc_info(ivhd_container_t *ivhdcp, amd_iommu_acpi_ivhd_t **hash) argument
460 add_deventry_info(ivhd_t *ivhdp, ivhd_deventry_t *deventry, amd_iommu_acpi_ivhd_t **hash) argument
677 add_ivhd_info(amd_iommu_acpi_t *acpi, amd_iommu_acpi_ivhd_t **hash) argument
688 set_ivmd_info(ivmd_t *ivmdp, amd_iommu_acpi_ivmd_t **hash) argument
743 add_ivmdc_info(ivmd_container_t *ivmdcp, amd_iommu_acpi_ivmd_t **hash) argument
749 add_ivmd_info(amd_iommu_acpi_t *acpi, amd_iommu_acpi_ivmd_t **hash) argument
[all...]
/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/lib/smbsrv/libsmb/common/
H A Dsmb_auth.c149 * make a 16-byte hash.
168 * Create a LM response from the given LM hash and challenge.
174 smb_auth_lm_response(unsigned char *hash, argument
185 bcopy(hash, S21, SMBAUTH_HASH_SZ);
196 * The result will contain a 16-byte NTLM hash.
199 smb_auth_ntlm_hash(const char *password, unsigned char *hash) argument
205 if (password == NULL || hash == NULL)
216 rc = smb_auth_md4(hash, (unsigned char *)unicode_password, length);
231 smb_auth_ntlm_response(unsigned char *hash, argument
237 bcopy(hash, S2
309 smb_auth_v2_response( unsigned char *hash, unsigned char *srv_challenge, unsigned char *clnt_data, int clen, unsigned char *v2_rsp) argument
[all...]

Completed in 102 milliseconds

1234567891011