| /external/chromium_org/third_party/libyuv/util/ |
| compare.cc | 34 uint32 hash1 = 5381; local
42 if (amt1 > 0) hash1 = libyuv::HashDjb2(buf1, amt1, hash1);
52 printf("hash1 %x", hash1);
|
| /external/libyuv/files/util/ |
| 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/ |
| BloomFilterStrategies.java | 30 int hash1 = (int) hash64; local
33 int nextHash = hash1 + i * hash2;
45 int hash1 = (int) hash64; local
48 int nextHash = hash1 + i * hash2;
|
| /external/chromium_org/third_party/smhasher/src/ |
| 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,
|
| 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)
307 Short( m_data, m_length, hash1, hash2);
344 *hash1 = h0
[all...] |
| 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/ |
| 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/ |
| SHA1ImplTest.java | 69 int[] hash1 = { 0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0 }; local
78 alternateHash(words, hash1);
90 assertTrue("false1: k=" + k + " hash1[k]=" + Integer.toHexString(hash1[k]),
91 hash[k] == hash1[k]);
|
| /external/ltrace/ |
| dict.c | 40 size_t (*hash1)(const void *),
44 assert(hash1 != NULL);
52 dict->hash1 = hash1;
109 source->hash1, source->eq, source->hash2);
219 size_t pos = dict->hash1(key) % n(dict);
278 dict->hash1, dict->eq, dict->hash2);
|
| dict.h | 36 size_t (*hash1)(const void *); member in struct:dict
42 * size KEY_SIZE and values of the size VALUE_SIZE. HASH1 and HASH2
48 size_t (*hash1)(const void *),
55 #define DICT_INIT(DICTP, KEY_TYPE, VALUE_TYPE, HASH1, EQ, HASH2) \
58 size_t (*_hash1_callback)(const KEY_TYPE *) = HASH1; \
|
| /external/chromium_org/third_party/lcov/contrib/galaxy/ |
| 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/ |
| 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/ |
| uhash.c | 880 uhash_equals(const UHashtable* hash1, const UHashtable* hash2){
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->valueComparator(val1, val2)==FALSE)
[all...] |
| uhash.h | 722 * @param hash1
727 uhash_equals(const UHashtable* hash1, const UHashtable* hash2);
|
| /external/icu/icu4c/source/common/ |
| uhash.c | 855 uhash_equals(const UHashtable* hash1, const UHashtable* hash2){
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->valueComparator(val1, val2)==FALSE)
[all...] |
| uhash.h | 659 * @param hash1
664 uhash_equals(const UHashtable* hash1, const UHashtable* hash2);
|
| /external/chromium_org/v8/src/ |
| store-buffer.cc | 595 int hash1 = ((hash_addr ^ (hash_addr >> kHashSetLengthLog2)) & local
597 if (hash_set_1_[hash1] == int_addr) continue;
602 if (hash_set_1_[hash1] == 0) {
603 hash_set_1_[hash1] = int_addr;
609 hash_set_1_[hash1] = int_addr;
|
| /external/chromium_org/net/disk_cache/simple/ |
| simple_index.cc | 58 bool operator()(uint64 hash1, uint64 hash2);
67 bool CompareHashesForTimestamp::operator()(uint64 hash1, uint64 hash2) {
68 EntrySet::const_iterator it1 = entry_set_.find(hash1);
|
| /external/elfutils/0.153/src/ |
| elfcmp.c | 838 const Hash_Word *const hash1 = data1->d_buf; \
840 const size_t nbucket = hash1[0]; \
841 const size_t nchain = hash1[1]; \
842 if (data1->d_size != (2 + nbucket + nchain) * sizeof hash1[0] \
846 const Hash_Word *const bucket1 = &hash1[2]; \
|
| /external/chromium_org/chrome/browser/ |
| enumerate_modules_model_win.cc | 685 std::string hash1, hash2, hash3; local
686 GenerateHash(kModuleBlacklist[i].filename, &hash1);
687 hashes += " - " + hash1;
[all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| 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);
[all...] |
| /external/chromium_org/third_party/lcov/bin/ |
| lcov | [all...] |
| genhtml | [all...] |
| /external/icu/icu4c/source/test/intltest/ |
| 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);
[all...] |
| /external/chromium_org/chrome/browser/extensions/updater/ |
| extension_updater_unittest.cc | 1268 std::string hash1; local
[all...] |
