/illumos-gate/usr/src/lib/libcpc/common/ |
H A D | subr.c | 163 __cpc_strhash_free(cpc_strhash_t *hash) argument 165 cpc_strhash_t *p = hash, *f; 175 * Insert a new key into the hash table. 184 __cpc_strhash_add(cpc_strhash_t *hash, char *key) argument 188 for (p = hash; p != NULL; p = p->next) { 197 tmp = hash->next; 198 hash->next = p; 204 hash->cur = p; 210 __cpc_strhash_next(cpc_strhash_t *hash) argument 214 if (hash [all...] |
/illumos-gate/usr/src/lib/libcurses/screen/ |
H A D | scr_reset.c | 80 int *hash, y; local 279 hash = _VIRTHASH; 289 /* clear the hash table */ 291 *hash++ = _NOHASH; 301 hash = _CURHASH; 305 /* clear the hash table */ 307 *hash++ = _NOHASH;
|
H A D | wnoutref.c | 55 int *hash; local 113 hash = _VIRTHASH + yorg; 125 for (y = 0; y < boty; ++y, ++hash, ++bch, ++ech, ++sbch, 194 /* the hash value of the line */ 195 *hash = _NOHASH;
|
/illumos-gate/usr/src/lib/libnisdb/yptol/ |
H A D | stubs.c | 109 #pragma weak hash macro 111 hash(char *s) function
|
/illumos-gate/usr/src/cmd/vi/misc/ |
H A D | mkstr.c | 46 * Modified March 1978 to hash old messages to be able to recompile 230 struct hash { struct 233 struct hash *hnext; 242 register struct hash *hp; 266 hp = (struct hash *) calloc(1, sizeof *hp);
|
/illumos-gate/usr/src/cmd/refer/ |
H A D | inv6.c | 27 int hash = 0, hused = 0; local 47 if (hash < k) { 51 hfreq[hash] = ct; 52 while (hash < k) { 53 hpt[++hash] = lp; 54 hfreq[hash] = 0; 56 hpt[hash] = lp += iflong ? sizeof (long) : sizeof (int); 71 while (hash < nhash) 72 hpt[++hash] = lp;
|
/illumos-gate/usr/src/cmd/sh/ |
H A D | hash.c | 34 #include "hash.h" 49 #define hash(str) (int)(((unsigned)(crunch(str) * FACTOR)) >> shift) macro 119 i = hash(str);
|
/illumos-gate/usr/src/uts/common/fs/zfs/ |
H A D | lzjb.c | 57 int mlen, offset, hash; local 73 hash = (src[0] << 16) + (src[1] << 8) + src[2]; 74 hash += hash >> 9; 75 hash += hash >> 5; 76 hp = &lempel[hash & (LEMPEL_SIZE - 1)];
|
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/dk/ |
H A D | dk_decrypt.c | 41 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/keyhash_provider/ |
H A D | k5_kmd5des.c | 87 /* hash the confounder, then the input data */ 101 * Move the output ptr ahead so we can write the hash 106 /* Use generic hash function that calls to kEF */ 159 krb5_const krb5_data *hash, 177 if (hash->length != (CONFLENGTH + MD5_CKSUM_LENGTH)) { 179 if (hash->length != MD5_CKSUM_LENGTH) 209 ret = mit_des_cbc_encrypt(context, (krb5_pointer) hash->data, 210 (krb5_pointer) plaintext, hash->length, 213 ret = mit_des_cbc_encrypt(context, (krb5_pointer) hash->data, 214 (krb5_pointer) plaintext, hash 154 k5_md5des_verify(krb5_context context, krb5_const krb5_keyblock *key, krb5_keyusage usage, krb5_const krb5_data *ivec, krb5_const krb5_data *input, krb5_const krb5_data *hash, krb5_boolean *valid) argument [all...] |
/illumos-gate/usr/src/uts/common/io/cxgbe/t4nex/ |
H A D | t4_l2t.h | 36 * packets awaiting address resolution. Second, it is a node of a hash table 38 * pointer. Finally, each node is a bucket of a hash table, pointing to the 50 struct l2t_entry *first; /* start of hash chain */ 56 uint16_t hash; /* hash bucket the entry is on */ member in struct:l2t_entry
|
/illumos-gate/usr/src/lib/libast/common/cdt/ |
H A D | dthdr.h | 43 #define hash hl._hash macro 49 #define DT_WALK 020000 /* hash table being walked */ 58 /* hash start size and load factor */
|
/illumos-gate/usr/src/lib/libast/common/hash/ |
H A D | hashlib.h | 27 * hash table library private definitions 45 Hash_hash_f hash; /* name hash routine */ member in struct:__anon2616 61 unsigned int hash; /* last lookup hash */ 73 Hash_bucket_t** table; /* hash slot table */ \ 76 #include <hash.h> 84 #define HASH(r,n,h) if (r->local->hash) h = r->namesize ? (*r->local->hash)(n, r->namesize) : (*r->local->hash)( [all...] |
/illumos-gate/usr/src/uts/common/io/sfxge/ |
H A D | sfxge_hash.c | 42 * The largest amount of the data which the hash may be calculated over 54 uint32_t hash = 0; local 56 hash ^= cache[pos * (UINT8_MAX + 1) + *input]; 59 return (hash); 66 uint32_t hash = 0; local 69 hash ^= toeplitz_hash(sp->s_toeplitz_cache, src_addr, pos, addr_size); 71 hash ^= toeplitz_hash(sp->s_toeplitz_cache, dst_addr, pos, addr_size); 74 hash ^= toeplitz_hash(sp->s_toeplitz_cache, 77 hash ^= toeplitz_hash(sp->s_toeplitz_cache, 80 return (hash); [all...] |
/illumos-gate/usr/src/common/ficl/ |
H A D | extras.c | 122 * dictionary hash table by hashcode... 127 ficlHash *hash = ficlVmGetDictionary(vm)->forthWordlist; local 131 unsigned hashSize = hash->size; 145 word = hash->table[i]; 153 word = hash->table[i];
|
/illumos-gate/usr/src/lib/nsswitch/files/common/ |
H A D | files_common.c | 392 uint_t hash, line, f; local 429 hash = fhp->fh_hash_func[hashop](args, 1, NULL, 0); 430 for (hp = htab[hash % fhp->fh_size].h_first; hp != NULL; 432 if (hp->h_hash != hash) 576 * Populate the hash tables in reverse order so that the hash chains
|
H A D | getgrent.c | 40 uint_t hash = 0; local 53 hash = hash * 15 + name[i]; 54 return (hash);
|
H A D | getpwnam.c | 41 uint_t hash = 0; local 54 hash = hash * 15 + name[i]; 55 return (hash);
|
/illumos-gate/usr/src/lib/libtnf/ |
H A D | info.c | 95 /* 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/ypcmd/shared/ |
H A D | lockmap.c | 66 * - hash() is the front-end function that gets called. 69 * It is called by hash() in N2L mode. 76 * Local references to hash table for map lists 93 syslog(LOG_WARNING, "get_map_id: no hash id found for %s" 106 hash(char *s) function 290 hashval = hash(mapname); 300 * GIVEN : Map hash value 373 hashval = hash(mapname); 383 * GIVEN : Map hash value
|
/illumos-gate/usr/src/cmd/prstat/ |
H A D | prfile.c | 170 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/mdb/common/modules/genunix/ |
H A D | ldi.c | 47 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/cmd/fm/eversholt/common/ |
H A D | stable.c | 43 #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/cmd/fm/fminject/common/ |
H A D | inj_decl.c | 66 inj_hash_t *hash = item2hash(type); local 69 if ((v = inj_strhash_lookup(hash, name)) == NULL) 244 inj_hash_t *hash = item2hash(type); local 255 if ((v = inj_strhash_lookup(hash, name)) != NULL) { 264 (void) inj_strhash_insert(hash, name, (uintptr_t)decl);
|
/illumos-gate/usr/src/cmd/fs.d/nfs/mountd/ |
H A D | hashset.c | 35 * HASHSET is hash table managing pointers to a set of keys 38 * Unlike the libc `hsearch' based hash table, this implementation 45 * the actual key data only through the hash and equal functions given 81 * - HASHSET is a hash table of pointers to keys 86 * - the function hash(key) is used to compute hash values for keys; if 87 * keys are "equal" the values returned by the hash function must be 92 h_create(uint_t (*hash) (const void *), 119 h->h_hash = hash; 135 uint_t hash local 189 uint_t hash = h->h_hash(key); local 225 uint_t hash = h->h_hash(key); local [all...] |