Home
last modified time | relevance | path

Searched refs:hash (Results 1 – 25 of 88) sorted by relevance

1234

/dalvik/vm/test/
DTestHash.c83 u4 hash; in dvmTestHash() local
97 hash = dvmComputeUtf8Hash(tmpStr); in dvmTestHash()
98 dvmHashTableLookup(pTab, hash, strdup(tmpStr), in dvmTestHash()
107 hash = dvmComputeUtf8Hash(tmpStr); in dvmTestHash()
108 str = (const char*) dvmHashTableLookup(pTab, hash, tmpStr, in dvmTestHash()
118 hash = dvmComputeUtf8Hash(tmpStr); in dvmTestHash()
119 str = (const char*) dvmHashTableLookup(pTab, hash, tmpStr, in dvmTestHash()
141 hash = 0; in dvmTestHash()
145 str1 = dvmHashTableLookup(pTab, hash, strdup("one"), in dvmTestHash()
148 str = dvmHashTableLookup(pTab, hash, strdup("two"), in dvmTestHash()
[all …]
/dalvik/libcore/luni/src/main/java/java/util/
DUUID.java55 private transient int hash; field in UUID
82 hash = msbHash ^ lsbHash; in init()
168 byte[] hash; in nameUUIDFromBytes()
171 hash = md.digest(name); in nameUUIDFromBytes()
176 long msb = (hash[0] & 0xFFL) << 56; in nameUUIDFromBytes()
177 msb |= (hash[1] & 0xFFL) << 48; in nameUUIDFromBytes()
178 msb |= (hash[2] & 0xFFL) << 40; in nameUUIDFromBytes()
179 msb |= (hash[3] & 0xFFL) << 32; in nameUUIDFromBytes()
180 msb |= (hash[4] & 0xFFL) << 24; in nameUUIDFromBytes()
181 msb |= (hash[5] & 0xFFL) << 16; in nameUUIDFromBytes()
[all …]
DHashMap.java284 int hash = key.hashCode(); in get() local
285 hash ^= (hash >>> 20) ^ (hash >>> 12); in get()
286 hash ^= (hash >>> 7) ^ (hash >>> 4); in get()
289 for (HashMapEntry<K, V> e = tab[hash & (tab.length - 1)]; in get()
292 if (eKey == key || (e.hash == hash && key.equals(eKey))) { in get()
313 int hash = key.hashCode(); in containsKey() local
314 hash ^= (hash >>> 20) ^ (hash >>> 12); in containsKey()
315 hash ^= (hash >>> 7) ^ (hash >>> 4); in containsKey()
318 for (HashMapEntry<K, V> e = tab[hash & (tab.length - 1)]; in containsKey()
321 if (eKey == key || (e.hash == hash && key.equals(eKey))) { in containsKey()
[all …]
DHashtable.java274 int hash = key.hashCode(); in get() local
275 hash ^= (hash >>> 20) ^ (hash >>> 12); in get()
276 hash ^= (hash >>> 7) ^ (hash >>> 4); in get()
279 for (HashtableEntry<K, V> e = tab[hash & (tab.length - 1)]; in get()
282 if (eKey == key || (e.hash == hash && key.equals(eKey))) { in get()
302 int hash = key.hashCode(); in containsKey() local
303 hash ^= (hash >>> 20) ^ (hash >>> 12); in containsKey()
304 hash ^= (hash >>> 7) ^ (hash >>> 4); in containsKey()
307 for (HashtableEntry<K, V> e = tab[hash & (tab.length - 1)]; in containsKey()
310 if (eKey == key || (e.hash == hash && key.equals(eKey))) { in containsKey()
[all …]
DLinkedHashMap.java159 LinkedEntry(K key, V value, int hash, HashMapEntry<K, V> next, in LinkedEntry() argument
161 super(key, value, hash, next); in LinkedEntry()
180 @Override void addNewEntry(K key, V value, int hash, int index) { in addNewEntry() argument
192 key, value, hash, table[index], header, oldTail); in addNewEntry()
216 K key, V value, int hash, HashMapEntry<K, V> next) { in constructorNewEntry() argument
220 = new LinkedEntry<K,V>(key, value, hash, next, header, oldTail); in constructorNewEntry()
247 int hash = key.hashCode(); in get() local
248 hash ^= (hash >>> 20) ^ (hash >>> 12); in get()
249 hash ^= (hash >>> 7) ^ (hash >>> 4); in get()
252 for (HashMapEntry<K, V> e = tab[hash & (tab.length - 1)]; in get()
[all …]
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/cert/
DCache.java190 long hash = 0; in getHash() local
192 hash += (arr[i] & 0xFF); in getHash()
196 hash = hash << 32; in getHash()
197 return hash; in getHash()
230 public Object get(long hash, byte[] encoding) { in get() argument
231 hash |= getSuffHash(encoding); in get()
232 int idx = -1*Arrays.binarySearch(hashes_idx, hash)-1; in get()
236 while ((hashes_idx[idx] & HASH_MASK) == hash) { in get()
255 public void put(long hash, byte[] encoding, Object object) { in put() argument
268 hash |= getSuffHash(encoding); in put()
[all …]
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
DConcurrentHashMap.java155 private static int hash(int h) { in hash() method in ConcurrentHashMap
171 final Segment<K,V> segmentFor(int hash) { in segmentFor() argument
172 return segments[(hash >>> segmentShift) & segmentMask]; in segmentFor()
191 final int hash; field in ConcurrentHashMap.HashEntry
195 HashEntry(K key, int hash, HashEntry<K,V> next, V value) { in HashEntry() argument
197 this.hash = hash; in HashEntry()
310 HashEntry<K,V> getFirst(int hash) { in getFirst() argument
312 return tab[hash & (tab.length - 1)]; in getFirst()
333 V get(Object key, int hash) { in get() argument
335 HashEntry<K,V> e = getFirst(hash); in get()
[all …]
/dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/
DServerKeyExchange.java50 final byte[] hash; field in ServerKeyExchange
62 byte[] hash) { in ServerKeyExchange() argument
66 this.hash = hash; in ServerKeyExchange()
86 if (hash != null) { in ServerKeyExchange()
87 length += 2 + hash.length; in ServerKeyExchange()
133 hash = in.read(size); in ServerKeyExchange()
134 this.length += 2 + hash.length; in ServerKeyExchange()
136 hash = null; in ServerKeyExchange()
158 if (hash != null) { in send()
159 out.writeUint16(hash.length); in send()
[all …]
DCertificateVerify.java44 public CertificateVerify(byte[] hash) { in CertificateVerify() argument
45 if (hash == null || hash.length == 0) { in CertificateVerify()
49 this.signedHash = hash; in CertificateVerify()
50 length = hash.length + 2; in CertificateVerify()
DKeyManagerImpl.java51 private final Hashtable<String, PrivateKeyEntry> hash; field in KeyManagerImpl
61 this.hash = new Hashtable<String, PrivateKeyEntry>(); in KeyManagerImpl()
74 hash.put(alias, entry); in KeyManagerImpl()
102 if (hash.containsKey(alias)) { in getCertificateChain()
103 Certificate[] certs = hash.get(alias).getCertificateChain(); in getCertificateChain()
130 if (hash.containsKey(alias)) { in getPrivateKey()
131 return hash.get(alias).getPrivateKey(); in getPrivateKey()
153 for (Enumeration<String> aliases = hash.keys(); aliases.hasMoreElements();) { in chooseAlias()
155 final KeyStore.PrivateKeyEntry entry = hash.get(alias); in chooseAlias()
DPRF.java160 byte[] hash = md5_mac.doFinal(seed); // A(1) in computePRF()
162 md5_mac.update(hash); in computePRF()
174 hash = md5_mac.doFinal(hash); in computePRF()
183 hash = sha_mac.doFinal(seed); // A(1) in computePRF()
186 sha_mac.update(hash); in computePRF()
193 hash = sha_mac.doFinal(hash); in computePRF()
/dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/encodings/
DOAEPEncoding.java20 private Digest hash; field in OAEPEncoding
34 Digest hash) in OAEPEncoding() argument
36 this(cipher, hash, null); in OAEPEncoding()
41 Digest hash, in OAEPEncoding() argument
45 this.hash = hash; in OAEPEncoding()
46 this.defHash = new byte[hash.getDigestSize()]; in OAEPEncoding()
50 hash.update(encodingParams, 0, encodingParams.length); in OAEPEncoding()
53 hash.doFinal(defHash, 0); in OAEPEncoding()
315 hash.reset(); in maskGeneratorFunction1()
321 hash.update(Z, zOff, zLen); in maskGeneratorFunction1()
[all …]
/dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/
DJDKDigestSignature.java123 byte[] hash = new byte[digest.getDigestSize()]; in engineSign()
125 digest.doFinal(hash, 0); in engineSign()
129 byte[] bytes = derEncode(hash); in engineSign()
147 byte[] hash = new byte[digest.getDigestSize()]; in engineVerify()
149 digest.doFinal(hash, 0); in engineVerify()
158 expected = derEncode(hash); in engineVerify()
177 int sigOffset = sig.length - hash.length - 2; in engineVerify()
178 int expectedOffset = expected.length - hash.length - 2; in engineVerify()
183 for (int i = 0; i < hash.length; i++) in engineVerify()
233 byte[] hash) in derEncode() argument
[all …]
/dalvik/libcore/security/src/main/java/java/security/
DCodeSigner.java44 private transient int hash; field in CodeSigner
126 if (hash == 0) { in hashCode()
127 hash = signerCertPath.hashCode() in hashCode()
130 return hash; in hashCode()
DTimestamp.java46 private transient int hash; field in Timestamp
134 if (hash == 0) { in hashCode()
135 hash = timestamp.hashCode() ^ signerCertPath.hashCode(); in hashCode()
137 return hash; in hashCode()
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/util/
DSHAOutputStream.java184 byte[] hash = new byte[HashSizeInBytes]; in getHashAsBytes()
191 hash[i * 4] = (byte) (HConstants[i] >>> 24 & 0xff); in getHashAsBytes()
192 hash[i * 4 + 1] = (byte) (HConstants[i] >>> 16 & 0xff); in getHashAsBytes()
193 hash[i * 4 + 2] = (byte) (HConstants[i] >>> 8 & 0xff); in getHashAsBytes()
194 hash[i * 4 + 3] = (byte) (HConstants[i] & 0xff); in getHashAsBytes()
199 return hash; in getHashAsBytes()
210 byte[] hash = new byte[HashSizeInBytes]; in getHashAsBytes()
218 hash[i * 4] = (byte) (HConstants[i] >>> 24 & 0xff); in getHashAsBytes()
219 hash[i * 4 + 1] = (byte) (HConstants[i] >>> 16 & 0xff); in getHashAsBytes()
220 hash[i * 4 + 2] = (byte) (HConstants[i] >>> 8 & 0xff); in getHashAsBytes()
[all …]
DTwoKeyHashMap.java156 int hash = key1.hashCode() + key2.hashCode(); in put() local
157 int index = (hash & 0x7fffffff) % arrSize; in put()
161 if (hash == e.hash && key1.equals(e.getKey1()) in put()
170 arr[index] = createEntry(hash, key1, key2, value, arr[index]); in put()
197 int newIndex = (entry.hash & 0x7fffffff) % newArrSize; in rehash()
295 int hash; field in TwoKeyHashMap.Entry
301 public Entry(int hash, E key1, K key2, V value, Entry<E, K, V> next) { in Entry() argument
302 this.hash = hash; in Entry()
475 int hash = key1.hashCode() + key2.hashCode(); in findEntry() local
476 int index = (hash & 0x7fffffff) % arrSize; in findEntry()
[all …]
/dalvik/vm/
DIntern.c69 u4 hash; in lookupInternedString() local
72 hash = dvmComputeStringHash(strObj); in lookupInternedString()
87 hash, strObj, hashcmpImmortalStrings, true); in lookupInternedString()
96 dvmHashTableRemove(gDvm.internedStrings, hash, found); in lookupInternedString()
99 hash, found, hashcmpImmortalStrings, true); in lookupInternedString()
/dalvik/libcore/luni-kernel/src/main/java/org/apache/harmony/lang/annotation/
DAnnotationMember.java260 int hash = name.hashCode() * 127; in hashCode() local
264 return hash ^ Arrays.hashCode((int[])value); in hashCode()
266 return hash ^ Arrays.hashCode((byte[])value); in hashCode()
268 return hash ^ Arrays.hashCode((short[])value); in hashCode()
270 return hash ^ Arrays.hashCode((long[])value); in hashCode()
272 return hash ^ Arrays.hashCode((char[])value); in hashCode()
274 return hash ^ Arrays.hashCode((boolean[])value); in hashCode()
276 return hash ^ Arrays.hashCode((float[])value); in hashCode()
278 return hash ^ Arrays.hashCode((double[])value); in hashCode()
280 return hash ^ Arrays.hashCode((Object[])value); in hashCode()
[all …]
/dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/ess/
DESSCertID.java54 byte[] hash) in ESSCertID() argument
56 certHash = new DEROctetString(hash); in ESSCertID()
60 byte[] hash, in ESSCertID() argument
63 this.certHash = new DEROctetString(hash); in ESSCertID()
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/
DUnresolvedPrincipal.java127 int hash = 0; in hashCode() local
129 hash ^= name.hashCode(); in hashCode()
132 hash ^= klass.hashCode(); in hashCode()
134 return hash; in hashCode()
/dalvik/vm/hprof/
DHprofString.c43 u4 hash = 0; in computeUtf8Hash() local
49 hash = hash * 31 + c; in computeUtf8Hash()
52 return hash; in computeUtf8Hash()
DHprofClass.c45 u4 hash; in computeClassHash() local
50 hash = (u4)clazz->classLoader; in computeClassHash()
52 hash = hash * 31 + c; in computeClassHash()
55 return hash; in computeClassHash()
/dalvik/dx/src/com/android/dx/dex/code/
DCatchTable.java133 int hash = (start * 31) + end; in hashCode() local
134 hash = (hash * 31) + handlers.hashCode(); in hashCode()
135 return hash; in hashCode()
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/utils/
DObjectIdentifier.java48 private int hash = -1; field in ObjectIdentifier
177 if (hash == -1) { in hashCode()
178 hash = hashIntArray(oid); in hashCode()
180 return hash; in hashCode()

1234