/external/libyuv/files/util/ |
H A D | compare.cc | 34 uint32 hash1 = 5381; local 42 if (amt1 > 0) hash1 = libyuv::HashDjb2(buf1, amt1, hash1); 52 printf("hash1 %x", hash1);
|
/external/guava/guava/src/com/google/common/hash/ |
H A D | BloomFilterStrategies.java | 30 int hash1 = (int) hash64; 33 int nextHash = hash1 + i * hash2; 45 int hash1 = (int) hash64; 48 int nextHash = hash1 + i * hash2;
|
/external/chromium_org/third_party/smhasher/src/ |
H A D | Spooky.h | 55 uint64 *hash1, // in/out: in seed 1, out hash value 1 66 uint64 hash1 = seed; local 67 Hash128(message, length, &hash1, &seed); 68 return hash1; 79 uint64 hash1 = seed, hash2 = seed; local 80 Hash128(message, length, &hash1, &hash2); 81 return (uint32)hash1; 108 uint64 *hash1, // out only: first 64 bits of hash value. 266 uint64 *hash1,
|
H A D | Spooky.cpp | 20 uint64 *hash1, 41 uint64 a=*hash1; 115 *hash1 = a; 126 uint64 *hash1, 131 Short(message, length, hash1, hash2); 146 h0=h3=h6=h9 = *hash1; 181 *hash1 = h0; 302 void SpookyHash::Final(uint64 *hash1, uint64 *hash2) argument 307 Short( m_data, m_length, hash1, hash2); 344 *hash1 17 Short( const void *message, size_t length, uint64 *hash1, uint64 *hash2) argument 123 Hash128( const void *message, size_t length, uint64 *hash1, uint64 *hash2) argument [all...] |
H A D | KeysetTest.cpp | 91 uint8_t * hash1 = new uint8_t[hashbytes]; local 112 hash(key1,len,0,hash1); 121 if(memcmp(hash1,hash2,hashbytes) == 0) 131 if(memcmp(hash1,hash2,hashbytes) != 0) 152 delete [] hash1;
|
/external/chromium_org/courgette/ |
H A D | difference_estimator.cc | 24 size_t hash1 = *reinterpret_cast<const uint32*>(source); local 26 size_t hash = ((hash1 * 17 + hash2 * 37) + (hash1 >> 17)) ^ (hash2 >> 23);
|
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/ |
H A D | SHA1ImplTest.java | 69 int[] hash1 = {0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0 }; 78 alternateHash(words, hash1); 90 assertTrue("false1: k=" + k + " hash1[k]=" + Integer.toHexString(hash1[k]), 91 hash[k] == hash1[k] );
|
/external/chromium_org/third_party/lcov/contrib/galaxy/ |
H A D | genflat.pl | 946 my $data1_count; # Count of line in hash1 1160 my %hash1 = %{$_[0]}; 1166 if ($hash1{$filename}) 1168 # Entry already exists in hash1, combine them 1169 $hash1{$filename} = 1170 combine_info_entries($hash1{$filename}, 1177 $hash1{$filename} = $hash2{$filename}; 1181 return(\%hash1);
|
/external/chromium_org/third_party/lcov-1.9/contrib/galaxy/ |
H A D | genflat.pl | 946 my $data1_count; # Count of line in hash1 1160 my %hash1 = %{$_[0]}; 1166 if ($hash1{$filename}) 1168 # Entry already exists in hash1, combine them 1169 $hash1{$filename} = 1170 combine_info_entries($hash1{$filename}, 1177 $hash1{$filename} = $hash2{$filename}; 1181 return(\%hash1);
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | dirhash.c | 122 __u32 hash, hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9; local 132 hash = hash1 + (hash0 ^ (c * 7152373)); 135 hash1 = hash0;
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | uhash.c | 880 uhash_equals(const UHashtable* hash1, const UHashtable* hash2){ argument 884 if(hash1==hash2){ 896 if (hash1==NULL || hash2==NULL || 897 hash1->keyComparator != hash2->keyComparator || 898 hash1->valueComparator != hash2->valueComparator || 899 hash1->valueComparator == NULL) 908 count1 = uhash_count(hash1); 916 const UHashElement* elem1 = uhash_nextElement(hash1, &pos); 919 /* here the keys are not compared, instead the key form hash1 is used to fetch 925 if(hash1 [all...] |
H A D | uhash.h | 722 * @param hash1 727 uhash_equals(const UHashtable* hash1, const UHashtable* hash2);
|
/external/icu4c/common/ |
H A D | uhash.c | 855 uhash_equals(const UHashtable* hash1, const UHashtable* hash2){ argument 858 if(hash1==hash2){ 870 if (hash1==NULL || hash2==NULL || 871 hash1->keyComparator != hash2->keyComparator || 872 hash1->valueComparator != hash2->valueComparator || 873 hash1->valueComparator == NULL) 882 count1 = uhash_count(hash1); 890 const UHashElement* elem1 = uhash_nextElement(hash1, &pos); 893 /* here the keys are not compared, instead the key form hash1 is used to fetch 899 if(hash1 [all...] |
H A D | uhash.h | 659 * @param hash1 664 uhash_equals(const UHashtable* hash1, const UHashtable* hash2);
|
/external/chromium_org/v8/src/ |
H A D | store-buffer.cc | 702 int hash1 = ((hash_addr ^ (hash_addr >> kHashSetLengthLog2)) & local 704 if (hash_set_1_[hash1] == int_addr) continue; 709 if (hash_set_1_[hash1] == 0) { 710 hash_set_1_[hash1] = int_addr; 716 hash_set_1_[hash1] = int_addr;
|
/external/elfutils/src/ |
H A D | elfcmp.c | 681 const Hash_Word *const hash1 = data1->d_buf; \ 683 const size_t nbucket = hash1[0]; \ 684 const size_t nchain = hash1[1]; \ 685 if (data1->d_size != (2 + nbucket + nchain) * sizeof hash1[0] \ 689 const Hash_Word *const bucket1 = &hash1[2]; \
|
/external/v8/src/ |
H A D | store-buffer.cc | 688 int hash1 = local 690 if (hash_set_1_[hash1] == int_addr) continue; 695 if (hash_set_1_[hash1] == 0) { 696 hash_set_1_[hash1] = int_addr; 702 hash_set_1_[hash1] = int_addr;
|
/external/chromium_org/net/disk_cache/simple/ |
H A D | simple_index.cc | 54 bool operator()(uint64 hash1, uint64 hash2); 63 bool CompareHashesForTimestamp::operator()(uint64 hash1, uint64 hash2) { argument 64 EntrySet::const_iterator it1 = entry_set_.find(hash1);
|
/external/jmonkeyengine/engine/src/core/com/jme3/input/ |
H A D | InputManager.java | 307 int hash1 = JoyAxisTrigger.joyAxisHash(joyId, axis, true);
310 Float val1 = axisValues.get(hash1);
314 invokeActions(hash1, false);
320 axisValues.remove(hash1);
|
/external/chromium_org/third_party/lcov/bin/ |
H A D | lcov | 1255 my $data1_count; # Count of line in hash1 1541 my %hash1 = %{$_[0]}; 1547 if ($hash1{$filename}) 1549 # Entry already exists in hash1, combine them 1550 $hash1{$filename} = 1551 combine_info_entries($hash1{$filename}, 1559 $hash1{$filename} = $hash2{$filename}; 1563 return(\%hash1);
|
/external/chromium/chrome/browser/ |
H A D | enumerate_modules_model_win.cc | 626 std::string hash1, hash2, hash3; local 627 GenerateHash(kModuleBlacklist[i].filename, &hash1); 628 hashes += " - " + hash1;
|
/external/chromium_org/chrome/browser/ |
H A D | enumerate_modules_model_win.cc | 686 std::string hash1, hash2, hash3; local 687 GenerateHash(kModuleBlacklist[i].filename, &hash1); 688 hashes += " - " + hash1;
|
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | loctest.cpp | 581 int32_t hash1 = test1.hashCode(); local 585 test_assert(hash1 == hash2); 586 test_assert(hash1 == hash3); 668 int32_t hash1 = test1.hashCode(); local 672 test_assert(hash1 == hash2); 674 test_assert(hash3 == hash1);
|
/external/chromium_org/third_party/lcov-1.9/bin/ |
H A D | lcov | 1919 my $data1_count; # Count of line in hash1 2384 my %hash1 = %{$_[0]}; 2390 if ($hash1{$filename}) 2392 # Entry already exists in hash1, combine them 2393 $hash1{$filename} = 2394 combine_info_entries($hash1{$filename}, 2402 $hash1{$filename} = $hash2{$filename}; 2406 return(\%hash1);
|
/external/icu4c/test/intltest/ |
H A D | loctest.cpp | 582 int32_t hash1 = test1.hashCode(); local 586 test_assert(hash1 == hash2); 587 test_assert(hash1 == hash3); 669 int32_t hash1 = test1.hashCode(); local 673 test_assert(hash1 == hash2); 675 test_assert(hash3 == hash1);
|