/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 | OpenSSLKey.java | 89 int hash = 1; 90 hash = hash * 17 + ctx; 91 hash = hash * 31 + (engine == null ? 0 : engine.getEngineContext()); 92 return hash;
|
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 | PRF.java | 157 byte[] hash = md5_mac.doFinal(seed); // A(1) 159 md5_mac.update(hash); 171 hash = md5_mac.doFinal(hash); 180 hash = sha_mac.doFinal(seed); // A(1) 183 sha_mac.update(hash); 190 hash = sha_mac.doFinal(hash);
|
H A D | OpenSSLDSAPrivateKey.java | 170 int hash = 1; 174 hash = hash * 3 + x.hashCode(); 177 hash = hash * 7 + params.hashCode(); 179 return hash;
|
H A D | OpenSSLRSAPrivateKey.java | 221 int hash = 1; 223 hash = hash * 3 + modulus.hashCode(); 225 hash = hash * 7 + privateExponent.hashCode(); 228 return hash;
|
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);
|
/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...] |
H A D | X509CertFactoryImpl.java | 58 // number of leading/trailing bytes used for cert hash computation 62 // number of leading/trailing bytes used for crl hash computation 606 long hash = CERT_CACHE.getHash(encoding); 607 if (CERT_CACHE.contains(hash)) { 609 (Certificate) CERT_CACHE.get(hash, encoding); 615 CERT_CACHE.put(hash, encoding, res); 640 long hash = CERT_CACHE.getHash(buff); 641 if (CERT_CACHE.contains(hash)) { 647 Certificate res = (Certificate) CERT_CACHE.get(hash, encoding); 652 CERT_CACHE.put(hash, encodin [all...] |
/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/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...] |
/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/security/cert/ |
H A D | CertPath.java | 98 * @return the hash code for this instance. 101 int hash = getType().hashCode(); 102 hash = hash*31 + getCertificates().hashCode(); 103 return hash;
|
H A D | Certificate.java | 93 * Returns an integer hash code for the certificate. Any two objects which 97 * @return the certificate's hash 103 int hash = 0; 105 hash += i*encoded[i]; 107 return hash;
|
/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/java/io/ |
H A D | SerializationHandleMap.java | 126 int index, next, hash; 148 hash = getModuloHash(object, length); 149 hashedOk = hash > index; 151 hashedOk = hashedOk || (hash <= next); 153 hashedOk = hashedOk && (hash <= next);
|
/libcore/luni/src/main/java/org/apache/harmony/lang/annotation/ |
H A D | AnnotationMember.java | 251 * Computes hash code of this element. The formula is as follows: 255 * @return the hash code 260 int hash = name.hashCode() * 127; 264 return hash ^ Arrays.hashCode((int[])value); 266 return hash ^ Arrays.hashCode((byte[])value); 268 return hash ^ Arrays.hashCode((short[])value); 270 return hash ^ Arrays.hashCode((long[])value); 272 return hash ^ Arrays.hashCode((char[])value); 274 return hash ^ Arrays.hashCode((boolean[])value); 276 return hash [all...] |
/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/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/crypto/ |
H A D | SHA1_MessageDigestImpl.java | 163 byte[] hash = new byte[DIGEST_LENGTH]; 164 processDigest(hash, 0); 165 return hash;
|
/libcore/luni/src/main/java/java/nio/ |
H A D | DoubleBuffer.java | 296 * Calculates this buffer's hash code from the remaining chars. The 297 * position, limit, capacity and mark don't affect the hash code. 299 * @return the hash code calculated from the remaining chars. 304 int hash = 0; 308 hash = hash + ((int) l) ^ ((int) (l >> 32)); 310 return hash;
|
H A D | FloatBuffer.java | 297 * Calculates this buffer's hash code from the remaining chars. The 298 * position, limit, capacity and mark don't affect the hash code. 300 * @return the hash code calculated from the remaining floats. 305 int hash = 0; 307 hash = hash + Float.floatToIntBits(get(myPosition++)); 309 return hash;
|