HomeSort by relevance Sort by last modified time
    Searched refs:hash2 (Results 1 - 25 of 45) sorted by null

1 2

  /external/chromium_org/third_party/libyuv/util/
compare.cc 35 uint32 hash2 = 5381; local
45 if (amt2 > 0) hash2 = libyuv::HashDjb2(buf2, amt2, hash2);
54 printf(", hash2 %x", hash2);
  /external/libyuv/files/util/
compare.cc 35 uint32 hash2 = 5381; local
45 if (amt2 > 0) hash2 = libyuv::HashDjb2(buf2, amt2, hash2);
54 printf(", hash2 %x", hash2);
  /external/guava/guava/src/com/google/common/hash/
BloomFilterStrategies.java 31 int hash2 = (int) (hash64 >>> 32); local
33 int nextHash = hash1 + i * hash2;
46 int hash2 = (int) (hash64 >>> 32); local
48 int nextHash = hash1 + i * hash2;
  /external/chromium_org/courgette/
difference_estimator.cc 25 size_t hash2 = *reinterpret_cast<const uint32*>(source + kTupleSize - 4); local
26 size_t hash = ((hash1 * 17 + hash2 * 37) + (hash1 >> 17)) ^ (hash2 >> 23);
  /external/chromium_org/third_party/smhasher/src/
KeysetTest.cpp 92 uint8_t * hash2 = new uint8_t[hashbytes]; local
119 hash(key2,len,0,hash2);
121 if(memcmp(hash1,hash2,hashbytes) == 0)
129 hash(key2,len,0,hash2);
131 if(memcmp(hash1,hash2,hashbytes) != 0)
153 delete [] hash2;
Spooky.cpp 21 uint64 *hash2)
42 uint64 b=*hash2;
116 *hash2 = b;
127 uint64 *hash2)
131 Short(message, length, hash1, hash2);
147 h1=h4=h7=h10 = *hash2;
182 *hash2 = h1;
302 void SpookyHash::Final(uint64 *hash1, uint64 *hash2)
307 Short( m_data, m_length, hash1, hash2);
345 *hash2 = h1
    [all...]
Spooky.h 56 uint64 *hash2); // in/out: in seed 2, out hash value 2
79 uint64 hash1 = seed, hash2 = seed; local
80 Hash128(message, length, &hash1, &hash2);
109 uint64 *hash2); // out only: second 64 bits of hash value.
267 uint64 *hash2);
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/
BigDecimalTest.java 356 BigDecimal hash2 = new BigDecimal(1.00D); local
358 hash.hashCode() != hash2.hashCode() && !hash.equals(hash2));
359 hash2 = new BigDecimal("1.0");
361 hash.hashCode() != hash2.hashCode() && !hash.equals(hash2));
363 hash2 = new BigDecimal(val, 2);
365 .hashCode() == hash2.hashCode()
366 && hash.equals(hash2));
368 hash2 = new BigDecimal("-1233456.0000")
    [all...]
  /external/ltrace/
dict.c 42 size_t (*hash2)(size_t))
53 dict->hash2 = hash2;
109 source->hash1, source->eq, source->hash2);
190 hash2(struct dict *dict))(size_t) function
192 if (dict->hash2 != NULL)
193 return dict->hash2;
221 size_t d = hash2(dict)(pos);
278 dict->hash1, dict->eq, dict->hash2);
dict.h 38 size_t (*hash2)(size_t); member in struct:dict
42 * size KEY_SIZE and values of the size VALUE_SIZE. HASH1 and HASH2
50 size_t (*hash2)(size_t));
55 #define DICT_INIT(DICTP, KEY_TYPE, VALUE_TYPE, HASH1, EQ, HASH2) \
63 HASH2); \
  /external/chromium_org/v8/src/heap/
store-buffer.cc 559 uintptr_t hash2 = (hash_addr - (hash_addr >> kHashSetLengthLog2)); local
560 hash2 ^= hash2 >> (kHashSetLengthLog2 * 2);
561 hash2 &= (kHashSetLength - 1);
562 if (hash_set_2_[hash2] == int_addr) continue;
565 } else if (hash_set_2_[hash2] == 0) {
566 hash_set_2_[hash2] = int_addr;
571 hash_set_2_[hash2] = 0;
  /external/chromium_org/third_party/icu/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 ||
883 count2 = uhash_count(hash2);
894 * value from hash2. If the hashes are equal then then both hashes should
897 const UHashElement* elem2 = _uhash_find(hash2, key1, hash2->keyHasher(key1));
uhash.h 660 * @param hash2
664 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 ||
883 count2 = uhash_count(hash2);
894 * value from hash2. If the hashes are equal then then both hashes should
897 const UHashElement* elem2 = _uhash_find(hash2, key1, hash2->keyHasher(key1));
uhash.h 660 * @param hash2
664 uhash_equals(const UHashtable* hash1, const UHashtable* hash2);
  /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) {
70 EntrySet::const_iterator it2 = entry_set_.find(hash2);
  /external/chromium_org/third_party/lcov/contrib/galaxy/
genflat.pl 947 my $data2_count; # Count of line in hash2
1161 my %hash2 = %{$_[1]};
1164 foreach $filename (keys(%hash2))
1171 $hash2{$filename});
1177 $hash1{$filename} = $hash2{$filename};
  /external/elfutils/0.153/src/
elfcmp.c 839 const Hash_Word *const hash2 = data2->d_buf; \
843 || hash2[0] != nbucket || hash2[1] != nchain) \
848 const Hash_Word *const bucket2 = &hash2[2]; \
  /external/chromium_org/chrome/browser/
enumerate_modules_model_win.cc 684 std::string hash1, hash2, hash3; local
687 GenerateHash(kModuleBlacklist[i].location, &hash2);
688 hashes += " - " + hash2;
    [all...]
  /external/chromium_org/third_party/icu/source/test/intltest/
loctest.cpp 583 int32_t hash2 = test2.hashCode(); local
586 test_assert(hash1 == hash2);
588 test_assert(hash2 == hash3);
670 int32_t hash2 = test2.hashCode(); local
673 test_assert(hash1 == hash2);
674 test_assert(hash2 == hash3);
    [all...]
  /external/icu/icu4c/source/test/intltest/
loctest.cpp 583 int32_t hash2 = test2.hashCode(); local
586 test_assert(hash1 == hash2);
588 test_assert(hash2 == hash3);
670 int32_t hash2 = test2.hashCode(); local
673 test_assert(hash1 == hash2);
674 test_assert(hash2 == hash3);
    [all...]
  /external/chromium_org/third_party/lcov/bin/
lcov     [all...]
genhtml     [all...]
  /external/chromium_org/chrome/browser/extensions/updater/
extension_updater_unittest.cc 1417 std::string hash2; local
    [all...]
  /external/chromium_org/v8/test/cctest/
test-api.cc 2764 int hash2 = v8::Object::New(isolate)->GetIdentityHash(); local
2805 int hash2 = global_proxy->GetIdentityHash(); local
    [all...]

Completed in 524 milliseconds

1 2