| /external/guava/guava/src/com/google/common/hash/ |
| D | BloomFilterStrategies.java | 50 int hash2 = (int) (hash64 >>> 32); in MURMUR128_MITZ_32() local
54 int combinedHash = hash1 + (i * hash2); in MURMUR128_MITZ_32()
69 int hash2 = (int) (hash64 >>> 32); in MURMUR128_MITZ_32() local
72 int combinedHash = hash1 + (i * hash2); in MURMUR128_MITZ_32()
97 long hash2 = upperEight(bytes); in MURMUR128_MITZ_64() local
104 combinedHash += hash2; in MURMUR128_MITZ_64()
115 long hash2 = upperEight(bytes); in MURMUR128_MITZ_64() local
123 combinedHash += hash2; in MURMUR128_MITZ_64()
|
| /external/libyuv/files/util/ |
| D | compare.cc | 35 uint32 hash2 = 5381; in main() local
45 if (amt2 > 0) hash2 = libyuv::HashDjb2(buf2, amt2, hash2); in main()
54 printf(", hash2 %x", hash2); in main()
|
| /external/v8/src/ |
| D | transitions-inl.h | 123 uint32_t hash2, PropertyKind kind2, in CompareKeys() argument
125 int cmp = CompareNames(key1, hash1, key2, hash2); in CompareKeys()
133 uint32_t hash2) { in CompareNames() argument
136 return hash1 <= hash2 ? -1 : 1; in CompareNames()
|
| D | transitions.h | 295 uint32_t hash2, PropertyKind kind2,
301 uint32_t hash2);
|
| /external/ltrace/ |
| D | dict.c | 42 size_t (*hash2)(size_t)) in dict_init()
53 dict->hash2 = hash2; in dict_init()
109 source->hash1, source->eq, source->hash2); in dict_clone()
190 hash2(struct dict *dict))(size_t) in hash2() function
192 if (dict->hash2 != NULL) in hash2()
193 return dict->hash2; in hash2()
221 size_t d = hash2(dict)(pos); in find_slot()
278 dict->hash1, dict->eq, dict->hash2); in rehash()
|
| D | dict.h | 38 size_t (*hash2)(size_t); member
50 size_t (*hash2)(size_t));
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| D | HashTestUtils.java | 263 int hash2 = function.hashInt(key2).asInt(); in checkNoFunnels() local
265 same |= ~(hash1 ^ hash2); in checkNoFunnels()
267 diff |= (hash1 ^ hash2); in checkNoFunnels()
302 int hash2 = function.hashInt(key2).asInt(); in checkAvalanche() local
304 if ((hash1 & (1 << k)) == (hash2 & (1 << k))) { in checkAvalanche()
348 int hash2 = function.hashInt(key2).asInt(); in checkNo2BitCharacteristics() local
352 if ((hash1 ^ hash2) != delta) { in checkNo2BitCharacteristics()
392 int hash2 = function.hashInt(key2).asInt(); in check2BitAvalanche() local
394 if ((hash1 & (1 << k)) == (hash2 & (1 << k))) { in check2BitAvalanche()
|
| D | HashCodeTest.java | 174 HashCode hash2 = in testRoundTripHashCodeUsingBaseEncoding() local
176 assertEquals(hash1, hash2); in testRoundTripHashCodeUsingBaseEncoding()
207 HashCode hash2 = HashCode.fromString(hash1.toString()); in testRoundTripHashCodeUsingFromString() local
208 assertEquals(hash1, hash2); in testRoundTripHashCodeUsingFromString()
|
| /external/v8/src/heap/ |
| D | store-buffer.cc | 551 uintptr_t hash2 = (hash_addr - (hash_addr >> kHashSetLengthLog2)); in Compact() local
552 hash2 ^= hash2 >> (kHashSetLengthLog2 * 2); in Compact()
553 hash2 &= (kHashSetLength - 1); in Compact()
554 if (hash_set_2_[hash2] == int_addr) continue; in Compact()
557 } else if (hash_set_2_[hash2] == 0) { in Compact()
558 hash_set_2_[hash2] = int_addr; in Compact()
563 hash_set_2_[hash2] = 0; in Compact()
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | CalendarCache.java | 64 delta = hash2(key); in findIndex()
107 private final int hash2(long key) { in hash2() method in CalendarCache
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | CalendarCache.java | 62 delta = hash2(key); in findIndex()
105 private final int hash2(long key) { in hash2() method in CalendarCache
|
| /external/autotest/client/site_tests/login_OwnershipNotRetaken/ |
| D | login_OwnershipNotRetaken.py | 57 hash2 = hashlib.md5(key2.read())
59 if hash.hexdigest() != hash2.hexdigest():
|
| /external/icu/icu4c/source/common/ |
| D | uhash.c | 855 uhash_equals(const UHashtable* hash1, const UHashtable* hash2){ in uhash_equals() argument
858 if(hash1==hash2){ in uhash_equals()
870 if (hash1==NULL || hash2==NULL || in uhash_equals()
871 hash1->keyComparator != hash2->keyComparator || in uhash_equals()
872 hash1->valueComparator != hash2->valueComparator || in uhash_equals()
883 count2 = uhash_count(hash2); in uhash_equals()
897 const UHashElement* elem2 = _uhash_find(hash2, key1, hash2->keyHasher(key1)); in uhash_equals()
|
| D | uhash.h | 675 uhash_equals(const UHashtable* hash1, const UHashtable* hash2);
|
| /external/giflib/ |
| D | quantize.c | 323 int hash2 = entry2->RGB[SortRGBAxis] * 256 * 256 in SortCmpRtn() local
327 return hash1 - hash2; in SortCmpRtn()
|
| /external/elfutils/src/ |
| D | elfcmp.c | 840 const Hash_Word *const hash2 = data2->d_buf; \ in hash_content_equivalent()
844 || hash2[0] != nbucket || hash2[1] != nchain) \ in hash_content_equivalent()
849 const Hash_Word *const bucket2 = &hash2[2]; \ in hash_content_equivalent()
|
| /external/icu/icu4c/source/test/intltest/ |
| D | loctest.cpp | 576 int32_t hash2 = test2.hashCode(); in TestSimpleObjectStuff() local
579 test_assert(hash1 == hash2); in TestSimpleObjectStuff()
581 test_assert(hash2 == hash3); in TestSimpleObjectStuff()
663 int32_t hash2 = test2.hashCode(); in TestPOSIXParsing() local
666 test_assert(hash1 == hash2); in TestPOSIXParsing()
667 test_assert(hash2 == hash3); in TestPOSIXParsing()
|
| /external/llvm/lib/Target/X86/ |
| D | README.txt | 183 lambda, siod, optimizer-eval, ackermann, hash2, nestedloop, strcat, and Treesor.
|
| /external/llvm/lib/Target/ |
| D | README.txt | 270 The SingleSource/Benchmarks/Shootout-C++/hash and hash2 tests have examples of
|
| /external/v8/test/cctest/ |
| D | test-api.cc | 2448 int hash2 = v8::Object::New(isolate)->GetIdentityHash(); in THREADED_TEST() local
2452 CHECK_NE(hash, hash2); in THREADED_TEST()
2503 int hash2 = global_proxy->GetIdentityHash(); in GlobalProxyIdentityHash() local
2504 CHECK_EQ(hash1, hash2); in GlobalProxyIdentityHash()
|