/illumos-gate/usr/src/tools/cscope-fast/ |
H A D | lookup.c | 112 j = hash(p->text) % HASHMOD; 127 for (p = hashtab[hash(ident) % HASHMOD]; p != NULL; p = p->next) { 139 /* form hash value for string */ 142 hash(char *s) function
|
/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/nsswitch/files/common/ |
H A D | getprojent.c | 40 uint_t hash = 0; local 53 hash = hash * 15 + name[i]; 54 return (hash);
|
H A D | getgrent.c | 40 uint_t hash = 0; local 53 hash = hash * 15 + name[i]; 54 return (hash);
|
/illumos-gate/usr/src/grub/grub-0.97/netboot/ |
H A D | tlan.h | 487 u8 hash; local 489 hash = (a[0] ^ a[3]); /* & 077 */ 490 hash ^= ((a[0] ^ a[3]) >> 6); /* & 003 */ 491 hash ^= ((a[1] ^ a[4]) << 2); /* & 074 */ 492 hash ^= ((a[1] ^ a[4]) >> 4); /* & 017 */ 493 hash ^= ((a[2] ^ a[5]) << 4); /* & 060 */ 494 hash ^= ((a[2] ^ a[5]) >> 2); /* & 077 */ 496 return (hash & 077); 511 u32 hash; local 513 hash [all...] |
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/old/ |
H A D | old_decrypt.c | 40 const struct krb5_hash_provider *hash, 55 hashsize = hash->hashsize; 111 if ((ret = ((*(hash->hash))(context, 1, &output, &cksum)))) 38 krb5_old_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 *arg_output) argument
|
/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...] |
/illumos-gate/usr/src/uts/common/inet/ilb/ |
H A D | ilb_alg_hash.c | 38 #define HASH_IP_V4(hash, addr, size) \ 40 CRC32((hash), &(addr), sizeof (in_addr_t), -1U, crc32_table); \ 41 (hash) %= (size); \ 43 #define HASH_IP_V6(hash, addr, size) \ 44 HASH_IP_V4((hash), (addr)->s6_addr32[3], (size)) 46 #define HASH_IP_PORT_V4(hash, addr, port, size) \ 49 CRC32((hash), &val, sizeof (uint32_t), -1U, crc32_table); \ 50 (hash) %= (size); \ 52 #define HASH_IP_PORT_V6(hash, addr, port, size) \ 53 HASH_IP_PORT_V4((hash), (add [all...] |
/illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/ |
H A D | Distribution.java | 308 * Overridden to ensure that equals instances have equal hash codes. 482 int hash = 17; 483 hash = (37 * hash) + ((int)(min ^ (min >>> 32))); 484 hash = (37 * hash) + ((int)(max ^ (max >>> 32))); 485 hash = (37 * hash) + ((int)(frequency ^ (frequency >>> 32))); 486 return hash;
|
H A D | PrintaRecord.java | 456 * Overridden to ensure that equal instances have equal hash codes. 462 int hash = 17; 463 hash = (hash * 37) + aggregations.hashCode(); 464 hash = (hash * 37) + ((formattedStrings == null || 467 hash = (hash * 37) + tuples.hashCode(); 468 return hash;
|
/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/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;
|
/illumos-gate/usr/src/cmd/mailx/ |
H A D | vars.c | 69 h = hash(name); 110 h = hash(s); 190 h = hash(name); 207 h = hash(name); 235 * the variable or group hash table. 239 hash(char name[]) function
|
/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/uts/common/gssapi/mechs/krb5/crypto/ |
H A D | make_checksum.c | 60 cksumlen = krb5_cksumtypes_list[i].hash->hashsize; 108 ret = (*(krb5_cksumtypes_list[i].keyhash->hash))(context, key, 118 * because "hash" and "checksum" are overloaded terms 129 krb5_cksumtypes_list[i].hash, 133 * No key is used, hash and cksum are synonymous 139 ret = (*(krb5_cksumtypes_list[i].hash->hash))(context, 1,
|
/illumos-gate/usr/src/cmd/make/bin/ |
H A D | implicit.cc | 170 (int) target_body->hash.length); 171 put_suffix = sourcename + target_body->hash.length; 185 suffix.suffix->hash.length); 187 suffix.suffix->hash.length] = 222 if(source->string_mb[source->hash.length - 1] == '~' && 228 tmpbuf = getmem(source->hash.length + 8); 230 memset(tmpbuf,0,source->hash.length + 8); 231 source->string_mb[source->hash.length - 1] = '\0'; 232 if(p = (char *) memchr((char *)source->string_mb,'/',source->hash.length)) 235 if(np = (char *) memchr((char *)p+1,'/',source->hash [all...] |
/illumos-gate/usr/src/cmd/tsol/tnd/ |
H A D | tnd.c | 156 * This is a table of hash tables to keep 158 * a separate hash bucket structure, instead mantain 159 * a pointer to the hash chain. 170 * This is a hash table which keeps fully resolved 172 * a separate hash bucket structure, instead 173 * mantain a pointer to the hash chain. 924 * Search the hash chain for the address. If not found, 925 * add the entry to the hash table. If necessary, 926 * construct the hash table. 933 unsigned char hash; local 1032 unsigned char hash; local 1108 unsigned char hash; local 1149 unsigned char hash; local 1172 unsigned char hash; local 1209 unsigned char hash; local 1225 unsigned char hash; local 1257 unsigned char hash; local [all...] |
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/crypto/keyhash_provider/ |
H A D | k5_md5des.c | 98 /* hash the confounder, then the input data */ 158 krb5_const krb5_data *hash, 175 if (hash->length != (CONFLENGTH + MD5_CKSUM_LENGTH)) { 177 if (hash->length != MD5_CKSUM_LENGTH) 213 (krb5_pointer) hash->data, 214 (krb5_pointer) plaintext, hash->length, 218 (krb5_pointer) hash->data, 219 (krb5_pointer) plaintext, hash->length, 224 /* hash the confounder, then the input data */ 260 /* compare the decrypted hash t 153 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/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/os/ |
H A D | callout.c | 81 #define CALLOUT_HASH_INSERT(hash, cp, cnext, cprev) \ 83 callout_hash_t *hashp = &(hash); \ 94 #define CALLOUT_HASH_APPEND(hash, cp, cnext, cprev) \ 96 callout_hash_t *hashp = &(hash); \ 107 #define CALLOUT_HASH_DELETE(hash, cp, cnext, cprev) \ 109 callout_hash_t *hashp = &(hash); \ 125 * - callouts are queued in a FIFO manner in the ID hash table. 136 * hash table buckets: 144 * them. Keeping these callout lists in the rear of the hash 166 #define CALLOUT_LIST_INSERT(hash, c 319 callout_list_get(callout_table_t *ct, hrtime_t expiration, int flags, int hash) argument 754 int hash; local 864 int i, hash, clflags; local 988 int hash, clflags; local 1284 int hash, flags; local [all...] |
/illumos-gate/usr/src/lib/smbsrv/libsmb/common/ |
H A D | smb_auth.c | 149 * 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...] |
/illumos-gate/usr/src/lib/libdtrace/common/ |
H A D | dt_aggregate.c | 442 dt_ahash_t *hash = &agp->dtat_hash; local 472 if (hash->dtah_hash == NULL) { 475 hash->dtah_size = DTRACE_AHASHSIZE; 476 size = hash->dtah_size * sizeof (dt_ahashent_t *); 478 if ((hash->dtah_hash = malloc(size)) == NULL) 481 bzero(hash->dtah_hash, size); 542 ndx = hashval % hash->dtah_size; 544 for (h = hash->dtah_hash[ndx]; h != NULL; h = h->dtahe_next) { 681 if (hash->dtah_hash[ndx] != NULL) 682 hash 1200 dt_ahash_t *hash = &agp->dtat_hash; local 1216 dt_ahash_t *hash = &agp->dtat_hash; local 1282 dt_ahash_t *hash = &dtp->dt_aggregate.dtat_hash; local 1306 dt_ahash_t *hash = &agp->dtat_hash; local 1417 dt_ahash_t *hash = &agp->dtat_hash; local 1531 dt_ahash_t *hash = &agp->dtat_hash; local 1676 dt_ahash_t *hash = &agp->dtat_hash; local 2137 dt_ahash_t *hash = &agp->dtat_hash; local 2163 dt_ahash_t *hash = &agp->dtat_hash; local [all...] |
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/dk/ |
H A D | checksum.c | 113 krb5_dk_make_checksum(context, hash, key, usage, input, output) 115 krb5_const struct krb5_hash_provider *hash; 157 if ((ret = krb5_hmac(context, hash, cksum_key, 1, input, output)) != 0) {
|
/illumos-gate/usr/src/common/ficl/ |
H A D | dictionary.c | 17 * 29 jun 1998 (sadler) added variable sized hash table support 70 * has been successfully defined (ie linked into a hash). It 357 word->hash = ficlHashCode(name); 450 * of ficlCells capacity, and no hashing (hash size == 1). 485 ficlHash *hash; local 488 hash = (ficlHash *)dictionary->here; 492 hash->size = bucketCount; 493 ficlHashReset(hash); 494 return (hash); 510 * Empty the dictionary, reset its hash tabl 516 ficlHash *hash; local 618 ficlHash *hash; local 859 ficlHash *hash = dictionary->compilationWordlist; local [all...] |
/illumos-gate/usr/src/uts/common/fs/ |
H A D | dnlc.c | 61 * for future reference. Each hash chain is ordered by LRU 62 * Cache is indexed by hash value obtained from (vp, name) 96 * NC_MOVETOFRONT is the move-to-front threshold: if the hash lookup 98 * its hash chain. The idea is to make sure that the most frequently 100 * front of their hash chains). 120 * from each hash chain), before having to cycle around and retry. 146 static int nc_hashsz; /* size of hash table */ 147 static int nc_hashmask; /* size of hash table minus 1 */ 241 * Remove entry from hash queue 267 * Cached directory free space hash functio 440 int hash; local 507 int hash; local 588 int hash, depth; local 669 int hash; local 972 dnlc_search(vnode_t *dp, const char *name, uchar_t namlen, int hash) argument 1149 int hash; local 1290 int hash; local 1592 int hash; local 1790 int hash; local [all...] |