/illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/ |
H A D | ProcessState.java | 300 * Overridden to ensure that equal instances have equal hash codes. 306 int hash = 17; 307 hash = (37 * hash) + processID; 308 hash = (37 * hash) + state.hashCode(); 309 hash = (37 * hash) + terminationSignal; 310 hash = (37 * hash) [all...] |
H A D | Flow.java | 187 * Overridden to ensure that equal instances have equal hash codes. 193 int hash = 17; 194 hash = (37 * hash) + kind.hashCode(); 195 hash = (37 * hash) + depth; 196 return hash;
|
H A D | ProbeInfo.java | 161 * Overridden to ensure that equal instances have equal hash codes. 167 int hash = 17; 168 hash = (37 * hash) + probeAttributes.hashCode(); 169 hash = (37 * hash) + argumentAttributes.hashCode(); 170 return hash;
|
H A D | AggregationRecord.java | 222 * Overridden to ensure that equal records have equal hash codes. 228 int hash = 17; 229 hash = (37 * hash) + tuple.hashCode(); 230 hash = (37 * hash) + value.hashCode(); 231 return hash;
|
H A D | PrintfRecord.java | 232 * Overridden to ensure that equal instances have equal hash codes. 238 int hash = 17; 239 hash = (37 * hash) + records.hashCode(); 240 hash = (37 * hash) + formattedString.hashCode(); 241 return hash;
|
H A D | ProbeDescription.java | 441 int hash = id; 442 if (hash != ID_NONE) { 443 return hash; 446 hash = 17; 447 hash = (37 * hash) + provider.hashCode(); 448 hash = (37 * hash) + module.hashCode(); 449 hash = (37 * hash) [all...] |
H A D | InterfaceAttributes.java | 487 int hash = 17; 488 hash = (37 * hash) + nameStability.hashCode(); 489 hash = (37 * hash) + dataStability.hashCode(); 490 hash = (37 * hash) + dependencyClass.hashCode(); 491 return hash;
|
/illumos-gate/usr/src/cmd/dtrace/demo/ |
H A D | mkdemo.pl | 44 my %hash; 59 if (exists $hash{'name'}) { 60 if (exists $chaps{$hash{'name'}}) { 61 print "$cmd: chapter $hash{'name'} "; 66 $chaps{$hash{'name'}} = { %hash }; 67 %hash = (); 71 %hash = (); 81 $hash{$field} .= $value;
|
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/raw/ |
H A D | raw_encrypt.c | 39 const struct krb5_hash_provider *hash, 53 const struct krb5_hash_provider *hash, 38 krb5_raw_encrypt_length(const struct krb5_enc_provider *enc, const struct krb5_hash_provider *hash, size_t inputlen, size_t *length) argument 51 krb5_raw_encrypt(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
|
H A D | raw_decrypt.c | 40 const struct krb5_hash_provider *hash, 38 krb5_raw_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
|
/illumos-gate/usr/src/lib/libast/common/hash/ |
H A D | hashscan.c | 27 * hash table library 33 * hash table sequential scan 72 b->hash &= ~HASH_HIDDEN; 110 if (!(b->hash & HASH_DELETED) && (!(pos->tab->flags & HASH_VALUE) || b->value) && (!pos->flags || !(b->hash & (HASH_HIDDEN|HASH_HIDES)))) break; 111 if (b->hash & HASH_HIDES) 115 if (!(h->hash & HASH_HIDDEN)) 117 h->hash |= HASH_HIDDEN; 118 if (!(b->hash & HASH_DELETED)) break; 121 else b->hash [all...] |
H A D | hashview.c | 27 * hash table library 33 * push/pop/query hash table scope 66 b->name = (p->hash & HASH_HIDES) ? p->name : (char*)b; 67 b->hash |= HASH_HIDES; 79 if (b->hash & HASH_HIDES) 81 b->hash &= ~HASH_HIDES;
|
H A D | hashdump.c | 27 * hash table library 49 * dump hash table bucket info 67 if (!(b->hash & HASH_DELETED) && (!(tab->flags & HASH_VALUE) || b->value)) 73 if (!(b->hash & HASH_DELETED) && (!(tab->flags & HASH_VALUE) || b->value)) 83 if (b->hash & HASH_FLAGS) 86 if (b->hash & HASH_HIDES) sfprintf(sfstderr, "hides|"); 87 if (b->hash & HASH_HIDDEN) sfprintf(sfstderr, "hidden|"); 88 if (b->hash & HASH_KEEP) sfprintf(sfstderr, "keep|"); 89 if (b->hash & HASH_OPAQUED) sfprintf(sfstderr, "opaque|"); 130 * dump hash tabl [all...] |
/illumos-gate/usr/src/cmd/spell/ |
H A D | hashmake.c | 38 #include "hash.h" 55 (void) printf("%.*lo\n", (HASHWIDTH+2)/3, hash(word));
|
/illumos-gate/usr/src/tools/ctf/cvt/ |
H A D | hash.h | 33 * Routines for manipulating hash tables 40 typedef struct hash hash_t;
|
/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/io/aggr/ |
H A D | aggr_send.c | 84 uint64_t hash; local 96 hash = mac_pkt_hash(DL_ETHER, mp, grp->lg_mac_tx_policy, B_TRUE); 97 port = grp->lg_tx_ports[hash % grp->lg_ntx_ports]; 100 * Use hash as the hint so to direct traffic to 107 hash = (hash << 24 | hash << 16 | hash); 108 hash = (hash << 3 [all...] |
/illumos-gate/usr/src/common/ficl/ |
H A D | search.c | 79 ficlHash *hash = ficlVmGetDictionary(vm)->forthWordlist; local 80 ficlStackPushPointer(vm->dataStack, hash); 136 ficlHash *hash = ficlStackPopPointer(vm->dataStack); local 143 word = ficlHashLookup(hash, name, hashCode); 163 ficlHash *hash = ficlStackPopPointer(vm->dataStack); local 166 dictionary->compilationWordlist = hash; 217 * 1. Ficl creates a new single-list hash in the dictionary and returns 220 * hash entries in the wordlist. Ficl 2.02 and later define WORDLIST as 227 ficlHash *hash; local 233 hash 285 ficlHash *hash; local 314 ficlHash *hash = ficlVmPop(vm).p; local [all...] |
/illumos-gate/usr/src/uts/common/inet/ilb/ |
H A D | ilb_conn.c | 51 * start: starting index into the hash table to do gc 52 * end: ending index into the hash table to do gc 65 /* Hash macro for finding the index to the conn hash table */ 73 /* Kmem cache for the conn hash entry */ 78 * gc thread is responsible for 1/60 of the conn hash table. 95 * gc thread is responsible for 1/60 of the sticky hash table. 104 mutex_enter(&(s)->hash->sticky_lock); \ 107 mutex_exit(&s->hash->sticky_lock); \ 131 ilb_conn_hash_t *hash; local 136 hash 369 ilb_conn_hash_t *hash; local 506 ilb_conn_hash_t *hash; local 753 ilb_conn_hash_t *hash; local 892 ilb_conn_hash_t *hash; local 1032 ilb_conn_hash_t *hash; local 1157 ilb_sticky_lookup(ilb_sticky_hash_t *hash, ilb_rule_t *rule, in6_addr_t *src) argument 1174 ilb_sticky_add(ilb_sticky_hash_t *hash, ilb_rule_t *rule, ilb_server_t *server, in6_addr_t *src) argument 1231 ilb_sticky_hash_t *hash; local 1312 ilb_sticky_hash_t *hash; local 1461 ilb_sticky_hash_t *hash; local [all...] |
/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...] |
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/dk/ |
H A D | dk_encrypt.c | 47 const struct krb5_hash_provider *hash, 53 hashsize = hash->hashsize; 60 const struct krb5_hash_provider *hash, 90 krb5_dk_encrypt_length(enc, hash, input->length, &enclen); 130 /* hash the plaintext */ 143 if ((ret = krb5_hmac(context, hash, derived_hmac_key, 167 krb5int_aes_encrypt_length(enc, hash, inputlen, length) 169 const struct krb5_hash_provider *hash; 186 const struct krb5_hash_provider *hash, 195 hashsize = hash 46 krb5_dk_encrypt_length(const struct krb5_enc_provider *enc, const struct krb5_hash_provider *hash, size_t inputlen, size_t *length) argument 58 krb5_dk_encrypt(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 185 trunc_hmac(krb5_context context, const struct krb5_hash_provider *hash, const krb5_keyblock *ki, int num, const krb5_data *input, krb5_data *output) argument 220 krb5int_aes_dk_encrypt(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 [all...] |
/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/lib/libsmbfs/smb/ |
H A D | ntlm.h | 50 ntlm_compute_lm_hash(uchar_t *hash, const char *pw); 53 ntlm_compute_nt_hash(uchar_t *hash, const char *pw);
|
/illumos-gate/usr/src/cmd/refer/ |
H A D | mkey3.c | 29 extern int hash(); 67 h = hash(s) % (COMTSIZE);
|
/illumos-gate/usr/src/cmd/geniconvtbl/ |
H A D | hash.h | 39 static itm_size_t hash(const char *, itm_size_t, itm_size_t); 46 hash(const char *ptr, itm_size_t size, itm_size_t hash_size) function
|