/libcore/luni/src/main/java/java/lang/ |
H A D | ThreadLocal.java | 57 int index = hash & values.mask; 132 * Internal hash. We deliberately don't bother with #hashCode(). 134 * (hash & (table.length - 1)) points to a key and not a value. 139 private final int hash = hashCounter.getAndAdd(0x61c88647 * 2); field in class:ThreadLocal 366 for (int index = key.hash & mask;; index = next(index)) { 387 for (int index = key.hash & mask;; index = next(index)) { 426 int index = key.hash & mask; 507 for (int index = key.hash & mask;; index = next(index)) {
|
/libcore/luni/src/main/java/java/net/ |
H A D | URI.java | 194 private transient int hash = -1; field in class:URI 1019 if (hash == -1) { 1020 hash = getHashString().hashCode(); 1022 return hash;
|
/libcore/luni/src/main/java/java/security/ |
H A D | CodeSigner.java | 34 // Cached hash code value 35 private transient int hash; field in class:CodeSigner 104 * Returns the hash code value for this {@code CodeSigner}. Returns the same 105 * hash code for {@code CodeSigner}s that are equal to each other as 108 * @return the hash code value for this {@code CodeSigner}. 114 if (hash == 0) { 115 hash = signerCertPath.hashCode() 118 return hash;
|
H A D | Timestamp.java | 36 // Cached hash 37 private transient int hash; field in class:Timestamp 109 * Returns the hash code value for this {@code Timestamp}. Returns the same 110 * hash code for {@code Timestamp}s that are equal to each other as 113 * @return the hash code value for this {@code Timestamp}. 119 if (hash == 0) { 120 hash = timestamp.hashCode() ^ signerCertPath.hashCode(); 122 return hash;
|
/libcore/luni/src/main/java/java/security/spec/ |
H A D | EllipticCurve.java | 42 private volatile int hash; field in class:EllipticCurve 189 // hash init is delayed 190 if (hash == 0) { 202 hash = hash0; 204 return hash;
|
/libcore/luni/src/main/java/java/util/ |
H A D | HashMap.java | 87 * The hash table. If this hash map contains a mapping for null, it is 88 * not represented this hash table. 98 * The number of mappings in this hash map. 134 * the initial capacity of this hash map. 166 * the initial capacity of this hash map. 298 int hash = key.hashCode(); 299 hash ^= (hash >>> 20) ^ (hash >>> 1 475 addNewEntry(K key, V value, int hash, int index) argument 493 constructorNewEntry( K key, V value, int hash, HashMapEntry<K, V> first) argument 726 final int hash; field in class:HashMap.HashMapEntry 729 HashMapEntry(K key, V value, int hash, HashMapEntry<K, V> next) argument [all...] |
H A D | Hashtable.java | 72 * The hash table. 77 * The number of mappings in this hash map. 263 int hash = key.hashCode(); 264 hash ^= (hash >>> 20) ^ (hash >>> 12); 265 hash ^= (hash >>> 7) ^ (hash >>> 4); 268 for (HashtableEntry<K, V> e = tab[hash 667 final int hash; field in class:Hashtable.HashtableEntry 670 HashtableEntry(K key, V value, int hash, HashtableEntry<K, V> next) argument [all...] |
H A D | LinkedHashMap.java | 105 * the initial capacity of this hash map. 154 LinkedEntry(K key, V value, int hash, HashMapEntry<K, V> next, argument 156 super(key, value, hash, next); 177 * to the hash table (which is properly the province of our superclass). 182 * the resulting hash table corrupt. 184 @Override void addNewEntry(K key, V value, int hash, int index) { argument 196 key, value, hash, table[index], header, oldTail); 220 K key, V value, int hash, HashMapEntry<K, V> next) { 224 = new LinkedEntry<K,V>(key, value, hash, next, header, oldTail); 251 int hash 219 constructorNewEntry( K key, V value, int hash, HashMapEntry<K, V> next) argument [all...] |
H A D | UUID.java | 55 private transient int hash; field in class:UUID 78 // setup hash field 81 hash = msbHash ^ lsbHash; 155 private static UUID makeUuid(byte[] hash, int version) { argument 156 long msb = Memory.peekLong(hash, 0, ByteOrder.BIG_ENDIAN); 157 long lsb = Memory.peekLong(hash, 8, ByteOrder.BIG_ENDIAN); 382 * Returns a hash value for this UUID that is consistent with the 389 return hash;
|
H A D | WeakHashMap.java | 58 int hash; field in class:WeakHashMap.Entry 73 hash = isNull ? 0 : key.hashCode(); 106 return hash + (value == null ? 0 : value.hashCode()); 576 int index = (toRemove.hash & 0x7FFFFFFF) % elementData.length; 649 int index = entry.isNull ? 0 : (entry.hash & 0x7FFFFFFF)
|
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentHashMap.java | 17 * A hash table supporting full concurrency of retrievals and 35 * Enumerations return elements reflecting the state of the hash table 45 * in hash tables is essentially random, the actual concurrency will 54 * hash table is a relatively slow operation, so, when possible, it is 76 * each of which itself is a concurrently readable hash table. To 150 * key's hash code are used to choose the segment. 160 * The segments, each of which is a specialized hash table. 173 final int hash; field in class:ConcurrentHashMap.HashEntry 178 HashEntry(int hash, K key, V value, HashEntry<K,V> next) { argument 179 this.hash 236 private static int hash(int h) { method in class:ConcurrentHashMap 333 put(K key, int hash, V value, boolean onlyIfAbsent) argument 453 scanAndLockForPut(K key, int hash, V value) argument 491 scanAndLock(Object key, int hash) argument 519 remove(Object key, int hash, Object value) argument 554 replace(K key, int hash, V oldValue, V newValue) argument 578 replace(K key, int hash, V value) argument [all...] |
/libcore/luni/src/main/java/java/util/jar/ |
H A D | JarVerifier.java | 72 * Stores and a hash and a message digest and verifies that massage digest 73 * matches the hash. 81 private byte[] hash; field in class:JarVerifier.VerifierEntry 85 VerifierEntry(String name, MessageDigest digest, byte[] hash, argument 89 this.hash = hash; 122 if (!MessageDigest.isEqual(d, Base64.decode(hash))) { 152 * which contains the certificates used to sign the entry and its hash value 200 String hash = attributes.getValue(algorithm + "-Digest"); 201 if (hash [all...] |
/libcore/luni/src/main/java/org/apache/harmony/security/provider/cert/ |
H A D | Cache.java | 75 // AA - 2 bytes for prefix hash 77 // BB - 2 bytes for tail hash 82 // the similar hash codes. 84 // The masks to work with hash codes: 85 // the hash code without the reserved bytes 87 // the hash code of the prefix 94 // the number of bytes which will be used for array hash generation. 98 // This information includes: hash of the array, encoded form of the object, 100 // The hash-encoding-object correspondence is made by means of index 101 // in the particular array. I.e. for index N hash containe 213 get(long hash, byte[] encoding) argument 241 put(long hash, byte[] encoding, Object object) argument [all...] |
/libcore/luni/src/main/java/org/apache/harmony/security/utils/ |
H A D | ObjectIdentifier.java | 45 //hash code 46 private int hash = -1; field in class:ObjectIdentifier 175 if (hash == -1) { 176 hash = hashIntArray(oid); 178 return hash; 206 * Returns hash code for array of integers
|
/libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
H A D | CertificateVerify.java | 37 * @param hash 39 public CertificateVerify(byte[] hash) { argument 40 if (hash == null || hash.length == 0) { 42 "INTERNAL ERROR: incorrect certificate verify hash"); 44 this.signedHash = hash; 45 length = hash.length + 2;
|
H A D | CipherSuite.java | 702 // hash for quick access to cipher suite by name 854 String authType, String cipherName, String hash, byte[] code) { 940 if ("MD5".equals(hash)) { 944 } else if ("SHA".equals(hash)) { 1050 * Returns hash algorithm name 1058 * Returns hash size 853 CipherSuite(String name, boolean isExportable, int keyExchange, String authType, String cipherName, String hash, byte[] code) argument
|
H A D | KeyManagerImpl.java | 53 private final Hashtable<String, PrivateKeyEntry> hash; field in class:KeyManagerImpl 62 this.hash = new Hashtable<String, PrivateKeyEntry>(); 75 hash.put(alias, entry); 101 if (hash.containsKey(alias)) { 102 Certificate[] certs = hash.get(alias).getCertificateChain(); 127 if (hash.containsKey(alias)) { 128 return hash.get(alias).getPrivateKey(); 151 for (Enumeration<String> aliases = hash.keys(); aliases.hasMoreElements();) { 153 final KeyStore.PrivateKeyEntry entry = hash.get(alias);
|
H A D | NativeCrypto.java | 153 public static native int EVP_DigestFinal(int ctx, byte[] hash, int offset); argument
|
H A D | ServerKeyExchange.java | 48 final byte[] hash; field in class:ServerKeyExchange 57 * @param hash should be null for anonymous SignatureAlgorithm 60 byte[] hash) { 64 this.hash = hash; 71 if (hash != null) { 72 length += 2 + hash.length; 131 hash = in.read(size); 132 this.length += 2 + hash.length; 134 hash 59 ServerKeyExchange(BigInteger par1, BigInteger par2, BigInteger par3, byte[] hash) argument [all...] |
H A D | TrustedCertificateStore.java | 61 * the subject hash, operations such as {@link #getCertificateAlias 494 String hash = hash(subject); 496 File file = file(dir, hash, index); 533 private String hash(X500Principal name) { method in class:TrustedCertificateStore 534 int hash = NativeCrypto.X509_NAME_hash_old(name); 535 return IntegralToString.intToHexString(hash, false, 8); 538 private File file(File dir, String hash, int index) { argument 539 return new File(dir, hash + '.' + index); 625 String hash [all...] |
/libcore/luni/src/main/native/ |
H A D | org_apache_harmony_xml_ExpatParser.cpp | 55 int hash; member in struct:InternedString 220 * Calculates a hash code for a null-terminated string. This is *not* equivalent 224 * @param s null-terminated string to hash 225 * @returns hash code 228 int hash = 0; local 231 hash = hash * 31 + *s++; 234 return hash; 242 * @param hash of bytes 245 static InternedString* newInternedString(JNIEnv* env, const char* bytes, int hash) { argument 338 findInternedString(InternedString** bucket, const char* s, int hash) argument 356 int hash = hashString(s); local [all...] |
H A D | org_apache_harmony_xnet_provider_jsse_NativeCrypto.cpp | 1481 jbyteArray hash, jint offset) { 1483 JNI_TRACE("NativeCrypto_EVP_DigestFinal(%p, %p, %d)", ctx, hash, offset); 1485 if (ctx == NULL || hash == NULL) { 1490 ScopedByteArrayRW hashBytes(env, hash); 1503 JNI_TRACE("NativeCrypto_EVP_DigestFinal(%p, %p, %d) => %d", ctx, hash, offset, bytesWritten); 1480 NativeCrypto_EVP_DigestFinal(JNIEnv* env, jclass, jint ctxRef, jbyteArray hash, jint offset) argument
|