Searched refs:hash (Results 1 - 25 of 81) sorted by relevance

1234

/dalvik/vm/test/
H A DTestHash.c17 * Test the hash table functions.
73 * Some quick hash table tests.
80 u4 hash; local
94 hash = dvmComputeUtf8Hash(tmpStr);
95 dvmHashTableLookup(pTab, hash, strdup(tmpStr),
104 hash = dvmComputeUtf8Hash(tmpStr);
105 str = (const char*) dvmHashTableLookup(pTab, hash, tmpStr,
115 hash = dvmComputeUtf8Hash(tmpStr);
116 str = (const char*) dvmHashTableLookup(pTab, hash, tmpStr,
138 hash
[all...]
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/cert/
H A DCache.java75 // 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
230 get(long hash, byte[] encoding) argument
255 put(long hash, byte[] encoding, Object object) argument
[all...]
/dalvik/libcore/luni/src/main/java/java/util/
H A DUUID.java58 private transient int hash; field in class:UUID
85 // setup hash field
88 hash = msbHash ^ lsbHash;
179 byte[] hash;
182 hash = md.digest(name);
187 long msb = (hash[0] & 0xFFL) << 56;
188 msb |= (hash[1] & 0xFFL) << 48;
189 msb |= (hash[2] & 0xFFL) << 40;
190 msb |= (hash[3] & 0xFFL) << 32;
191 msb |= (hash[
[all...]
/dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/
H A DCertificateVerify.java48 * @param hash
50 public CertificateVerify(byte[] hash) { argument
51 if (hash == null || hash.length == 0) {
53 "INTERNAL ERROR: incorrect certificate verify hash");
55 this.signedHash = hash;
56 length = hash.length + 2;
H A DServerKeyExchange.java55 final byte[] hash; field in class:ServerKeyExchange
64 * @param hash should be null for anonymous SignatureAlgorithm
67 byte[] hash) {
71 this.hash = hash;
91 if (hash != null) {
92 length += 2 + hash.length;
138 hash = in.read(size);
139 this.length += 2 + hash.length;
141 hash
66 ServerKeyExchange(BigInteger par1, BigInteger par2, BigInteger par3, byte[] hash) argument
[all...]
H A DPRF.java165 byte[] hash = md5_mac.doFinal(seed); // A(1)
167 md5_mac.update(hash);
179 hash = md5_mac.doFinal(hash);
188 hash = sha_mac.doFinal(seed); // A(1)
191 sha_mac.update(hash);
198 hash = sha_mac.doFinal(hash);
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java21 * A hash table supporting full concurrency of retrievals and
39 * Enumerations return elements reflecting the state of the hash table
50 * in hash tables is essentially random, the actual concurrency will
78 * each of which itself is a concurrently readable hash table.
118 * key's hash code are used to choose the segment.
128 * The segments, each of which is a specialized hash table
139 * Returns a hash code for non-null Object x.
140 * Uses the same hash code spreader as most other java.util hash tables.
142 * @return the hash cod
144 static int hash(Object x) { method in class:ConcurrentHashMap
158 segmentFor(int hash) argument
260 get(Object key, int hash) argument
274 containsKey(Object key, int hash) argument
300 replace(K key, int hash, V oldValue, V newValue) argument
329 replace(K key, int hash, V newValue) argument
356 put(K key, int hash, V value, boolean onlyIfAbsent) argument
453 remove(Object key, int hash, Object value) argument
510 final int hash; field in class:ConcurrentHashMap.HashEntry
513 HashEntry(int hash, K key, V value, HashEntry<K,V> next) argument
[all...]
/dalvik/libcore/security/src/main/java/java/security/
H A DCodeSigner.java43 // Cached hash code value
44 private transient int hash; field in class:CodeSigner
116 * Returns the hash code value for this {@code CodeSigner}. Returns the same
117 * hash code for {@code CodeSigner}s that are equal to each other as
120 * @return the hash code value for this {@code CodeSigner}.
126 if (hash == 0) {
127 hash = signerCertPath.hashCode()
130 return hash;
H A DTimestamp.java45 // Cached hash
46 private transient int hash; field in class:Timestamp
124 * Returns the hash code value for this {@code Timestamp}. Returns the same
125 * hash code for {@code Timestamp}s that are equal to each other as
128 * @return the hash code value for this {@code Timestamp}.
134 if (hash == 0) {
135 hash = timestamp.hashCode() ^ signerCertPath.hashCode();
137 return hash;
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/
H A DUnresolvedPrincipal.java124 * Returns the hash code value for this object.
127 int hash = 0;
129 hash ^= name.hashCode();
132 hash ^= klass.hashCode();
134 return hash;
/dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/ess/
H A DESSCertID.java54 byte[] hash)
56 certHash = new DEROctetString(hash);
60 byte[] hash,
63 this.certHash = new DEROctetString(hash);
53 ESSCertID( byte[] hash) argument
59 ESSCertID( byte[] hash, IssuerSerial issuerSerial) argument
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/encodings/
H A DOAEPEncoding.java20 private Digest hash; field in class:OAEPEncoding
34 Digest hash)
36 this(cipher, hash, null);
41 Digest hash,
45 this.hash = hash;
46 this.defHash = new byte[hash.getDigestSize()];
50 hash.update(encodingParams, 0, encodingParams.length);
53 hash.doFinal(defHash, 0);
152 // add the hash o
32 OAEPEncoding( AsymmetricBlockCipher cipher, Digest hash) argument
39 OAEPEncoding( AsymmetricBlockCipher cipher, Digest hash, byte[] encodingParams) argument
[all...]
/dalvik/vm/hprof/
H A DHprofString.c43 u4 hash = 0; local
49 hash = hash * 31 + c;
52 return hash;
H A DHprofClass.c45 u4 hash; local
50 hash = (u4)clazz->classLoader;
52 hash = hash * 31 + c;
55 return hash;
163 /* We're using the hash table as a list.
164 * TODO: replace the hash table with a more suitable structure
/dalvik/vm/
H A DIntern.c69 u4 hash; local
72 hash = dvmComputeStringHash(strObj);
87 hash, strObj, hashcmpImmortalStrings, true);
92 * There's no way to get a pointer to the actual hash table entry,
96 dvmHashTableRemove(gDvm.internedStrings, hash, found);
99 hash, found, hashcmpImmortalStrings, true);
H A DAtomicCache.h98 int hash; \
102 /* simple hash function */ \
103 hash = (((u4)(_key1) >> 2) ^ (u4)(_key2)) & ((_cacheSize)-1); \
104 pEntry = (_cache)->entries + hash; \
/dalvik/dx/src/com/android/dx/dex/code/
H A DCatchTable.java133 int hash = (start * 31) + end;
134 hash = (hash * 31) + handlers.hashCode();
135 return hash;
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/utils/
H A DObjectIdentifier.java47 //hash code
48 private int hash = -1; field in class:ObjectIdentifier
177 if (hash == -1) {
178 hash = hashIntArray(oid);
180 return hash;
211 * Returns hash code for array of integers
/dalvik/libcore/luni-kernel/src/main/java/org/apache/harmony/lang/annotation/
H A DAnnotationMember.java251 * 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...]
/dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/
H A DJDKDigestSignature.java123 byte[] hash = new byte[digest.getDigestSize()];
125 digest.doFinal(hash, 0);
129 byte[] bytes = derEncode(hash);
147 byte[] hash = new byte[digest.getDigestSize()];
149 digest.doFinal(hash, 0);
158 expected = derEncode(hash);
177 int sigOffset = sig.length - hash.length - 2;
178 int expectedOffset = expected.length - hash.length - 2;
183 for (int i = 0; i < hash.length; i++)
185 if (sig[sigOffset + i] != expected[expectedOffset + i]) // check hash
232 derEncode( byte[] hash) argument
[all...]
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/
H A DTwoKeyHashMap.java33 * Reductive hash with two keys
150 int hash = key1.hashCode() + key2.hashCode();
151 int index = (hash & 0x7fffffff) % arrSize;
155 if (hash == e.hash && key1.equals(e.getKey1()) && key2.equals(e.getKey2())) {
163 arr[index] = createEntry(hash, key1, key2, value, arr[index]);
189 int newIndex = (entry.hash & 0x7fffffff) % newArrSize;
282 int hash; field in class:TwoKeyHashMap.Entry
288 public Entry(int hash, E key1, K key2, V value, Entry<E, K, V> next) { argument
289 this.hash
[all...]
H A DSHAOutputStream.java170 // After the user asks for the hash value, the stream is put back to the
184 byte[] hash = new byte[HashSizeInBytes];
191 hash[i * 4] = (byte) (HConstants[i] >>> 24 & 0xff);
192 hash[i * 4 + 1] = (byte) (HConstants[i] >>> 16 & 0xff);
193 hash[i * 4 + 2] = (byte) (HConstants[i] >>> 8 & 0xff);
194 hash[i * 4 + 3] = (byte) (HConstants[i] & 0xff);
196 // After the user asks for the hash value, the stream is put back to the
199 return hash;
210 byte[] hash = new byte[HashSizeInBytes];
218 hash[
[all...]
/dalvik/dx/src/com/android/dx/rop/annotation/
H A DAnnotation.java92 int hash = type.hashCode();
93 hash = (hash * 31) + elements.hashCode();
94 hash = (hash * 31) + visibility.hashCode();
95 return hash;
/dalvik/libcore/security/src/main/java/java/security/cert/
H A DCertificate.java100 * Returns an integer hash code for the certificate. Any two objects which
104 * @return the certificate's hash
111 int hash = 0;
113 hash += i*encoded[i];
115 return hash;
H A DCertPath.java106 * @return the hash code for this instance.
111 int hash = getType().hashCode();
112 hash = hash*31 + getCertificates().hashCode();
113 return hash;

Completed in 768 milliseconds

1234