/illumos-gate/usr/src/cmd/cmd-inet/usr.lib/wpad/ |
H A D | wpa_enc.c | 174 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/msgfmt/ |
H A D | gnu_msgfmt.h | 88 unsigned int hash; /* hash value of msgid */ member in struct:messages 103 unsigned int hash_size; /* hash table size */
|
/illumos-gate/usr/src/cmd/fm/modules/sun4v/etm/ |
H A D | etm_ckpt.c | 81 uint_t hash = 0; /* hash value */ local 87 hash += *str++; 89 return (hash);
|
/illumos-gate/usr/src/cmd/sgs/crle/common/ |
H A D | print.c | 224 Word *hash, *chain; local 769 * If there's no hash table there's nothing else to process. 960 * If we've in verbose mode scan the hash list. 963 hash = (Word *)(CAST_PTRINT(char *, head->ch_hash) + addr); 964 bkts = hash[0]; 965 chain = &hash[2 + bkts]; 966 hash += 2; 971 * Scan the hash buckets looking for valid entries. 973 for (ndx = 0; ndx < bkts; ndx++, hash++) { 979 if (*hash [all...] |
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppd/ |
H A D | chap.c | 442 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)
|
H A D | chap_ms.c | 34 * The hash text (StdText) was taken from Win95 RASAPI32.DLL. 300 u_char hash[MD4_SIGNATURE_SIZE]; local 312 MD4Final(hash, &md4Context); /* Tell MD4 we're done */ 314 ChallengeResponse(rchallenge, hash, response->NTResp); 467 u_char hash[MD4_SIGNATURE_SIZE]; local 483 MD4Final(hash, &md4Context); /* Tell MD4 we're done */ 485 ChallengeResponse(challenge, hash, response->NTResp); 536 u_char hash[MD4_SIGNATURE_SIZE]; local 555 MD4Final(hash, &md4Context); 557 /* Now hash th [all...] |
/illumos-gate/usr/src/cmd/isns/isnsd/ |
H A D | htable.c | 52 * tab - the hash table. 85 * tab - the hash table. 269 * tab - the hash table. 379 * tab - the hash table. 448 * tab - the hash table. 450 * hval - the hash value of the new node. 526 * enlarge the hash table when it gets too full. 528 * tab - the hash table. 551 /* re-hash all items to the new table */ 590 * some generic initialization for the hash tabl 669 uint32_t hash = 5381; local [all...] |
/illumos-gate/usr/src/cmd/sgs/mcs/common/ |
H A D | utils.c | 410 int hash; local 475 hash = dohash(pos + strings); 477 if (hash != hash_key[i]) 498 hash_key[hash_num] = hash;
|
/illumos-gate/usr/src/cmd/sgs/rtld/common/ |
H A D | cache_a.out.c | 46 static int hash(); 99 * Search appropriate hash bucket for a matching entry. 101 index = hash(libname, liblen, major); 170 int index; /* the hash value */ 246 index = hash(cp, cplen, m); 427 * Calculate hash index for link object. 431 hash(np, nchrs, m) function 433 int nchrs; /* no of chrs. to hash on */
|
H A D | config_elf.c | 443 elf_config_ent(const char *name, Word hash, int id, const char **alternate) argument 449 bkt = hash % config->c_hashtbl[0]; 456 if ((obj->co_hash != hash) || (strcmp(name, str) != 0) ||
|
/illumos-gate/usr/src/cmd/sh/ |
H A D | hashserv.c | 34 #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/cmd/svc/common/ |
H A D | manifest_hash.c | 116 mhash_retrieve_entry(scf_handle_t *hndl, const char *name, uchar_t *hash, argument 132 * In this implementation the hash for name is the opaque value of 170 szret = scf_value_get_opaque(val, hash, MHASH_SIZE); 177 * Make sure that the old hash is returned with 181 (void) memset(hash + MHASH_SIZE_OLD, 0, 233 uchar_t *hash, apply_action_t apply_late, char **errstr) 276 *errstr = gettext("Could not get manifest hash " 293 *errstr = gettext("Could not store file hash: " 300 *errstr = gettext("Could not add manifest hash " 308 *errstr = gettext("Could not store file hash 232 mhash_store_entry(scf_handle_t *hndl, const char *name, const char *fname, uchar_t *hash, apply_action_t apply_late, char **errstr) argument 521 md5_hash_file(const char *file, off64_t sz, uchar_t *hash) argument 590 uchar_t hash[MHASH_SIZE]; local [all...] |
/illumos-gate/usr/src/cmd/svc/startd/ |
H A D | contract.c | 248 * 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/cmd/ldmad/ |
H A D | mdesc_lib.c | 46 uint32_t hash = 0; local 51 hash = (hash >> 27) | (hash << 5) | bp[i]; 54 return (hash); 61 uint32_t hash; local 63 hash = md_byte_hash((uint8_t *)strp, strlen(strp)); 66 *hashp = hash; 69 if (msp->hash == hash 80 uint32_t hash; local 107 uint32_t hash; local 127 uint32_t hash; local [all...] |
H A D | mdesc_mutable.h | 96 uint32_t hash; member in struct:md_string 105 uint32_t hash; member in struct:md_data_block
|
/illumos-gate/usr/src/uts/common/fs/lofs/ |
H A D | lofs_subr.c | 61 * 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/fs/tmpfs/ |
H A D | tmp_dir.c | 64 #define TMPFS_HASH(tp, name, hash) \ 67 hash = (uint_t)(uintptr_t)(tp) >> 8; \ 69 hash = (hash << 4) + hash + (uint_t)Xc; \ 87 uint_t hash; local 91 TMPFS_HASH(t->td_parent, t->td_name, hash); 92 t->td_hash = hash; 93 prevpp = &t_hashtable[T_HASH_INDEX(hash)]; 94 t_hmtx = &t_hashmutex[T_MUTEX_INDEX(hash)]; 107 uint_t hash; local 129 uint_t hash; local 144 uint_t hash; local [all...] |
/illumos-gate/usr/src/tools/ctf/cvt/ |
H A D | hash.c | 30 * Routines for manipulating hash tables 39 #include "hash.h" 43 struct hash { struct 94 hash_t *hash; local 96 hash = xmalloc(sizeof (hash_t)); 97 hash->h_buckets = xcalloc(sizeof (list_t *) * nbuckets); 98 hash->h_nbuckets = nbuckets; 99 hash->h_hashfn = hashfn ? hashfn : (int (*)())hash_def_hash; 100 hash->h_cmp = cmp ? cmp : (int (*)())hash_def_cmp; 102 return (hash); 106 hash_add(hash_t *hash, void *key) argument 127 hash_remove_cb(void *key1, void *key2, hash_t *hash) argument 133 hash_remove(hash_t *hash, void *key) argument 142 hash_match(hash_t *hash, void *key, int (*fun)(void *, void *), void *private) argument 166 hash_find_iter(hash_t *hash, void *key, int (*fun)(void *, void *), void *private) argument 194 hash_find(hash_t *hash, void *key, void **value) argument 211 hash_iter(hash_t *hash, int (*fun)(void *, void *), void *private) argument 230 hash_count(hash_t *hash) argument 241 hash_free(hash_t *hash, void (*datafree)(void *, void *), void *private) argument 255 hash_stats(hash_t *hash, int verbose) argument [all...] |
/illumos-gate/usr/src/tools/stabs/ |
H A D | stabs.h | 91 struct tdesc *hash; member in struct:tdesc
|
/illumos-gate/usr/src/ucbcmd/mkstr/ |
H A D | mkstr.c | 35 * Modified March 1978 to hash old messages to be able to recompile 263 static struct hash { struct 266 struct hash *hnext; 273 struct hash *hp; 294 hp = (struct hash *)calloc(1, sizeof (*hp));
|
/illumos-gate/usr/src/ucblib/libdbm/ |
H A D | dbm.c | 51 void dbm_access(long hash); 130 long hash; local 132 hash = calchash(key); 134 blkno = hash & hmask; 280 long hash; local 283 hash = calchash(key); 284 dbm_access(hash); 299 hash = hashinc(hash); 300 if (hash 306 firsthash(long hash) argument 330 dbm_access(long hash) argument 476 hashinc(long hash) argument [all...] |
/illumos-gate/usr/src/uts/common/sys/ |
H A D | strft.h | 121 * a hash value (for recovering trace information) 130 uint_t hash; /* accumulated hash value (sum of mid's) */ member in struct:fthdr 155 _hp->hash = 0; \
|
/illumos-gate/usr/src/uts/common/io/fibre-channel/fca/emlxs/ |
H A D | emlxs_node.c | 479 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/cmd/fs.d/nfs/mountd/ |
H A D | rmtab.c | 265 * Compute a 32 bit hash value for an mntlist entry. 276 mntentry_str_hash(char *s, uint_t hash) argument 281 hash = (hash << 4) + *s; 282 if ((g = (hash & 0xf0000000)) != 0) { 283 hash ^= (g >> 24); 284 hash ^= g; 288 return (hash); 295 uint_t hash; local 297 hash [all...] |
/illumos-gate/usr/src/lib/libproc/common/ |
H A D | Psymtab_machelf32.c | 107 * DT_HASH base of hash table for dynamic lookups 111 * dynamic lookup hash table. Here's the layout of the hash table: 131 * consumer where the next entry in the hash chain is. We can use 358 Word hash[2]; local 364 if (Pread(P, hash, sizeof (hash), hptr) != sizeof (hash)) { 365 dprintf("Pread of .hash at %lx failed\n", 370 hnbuckets = hash[ 615 uint_t *hash; local [all...] |