/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.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...] |
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,
|
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/chromium_org/third_party/sqlite/src/test/ |
trans2.test | 48 proc hash1 {} { 94 } [list [hash1] [hash2]] 114 set origres [list [hash1] [hash2]] 141 set newres [list [hash1] [hash2]]
|
/external/ltrace/ |
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; \
|
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);
|
/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/chrome/browser/chromeos/drive/ |
file_system_util_unittest.cc | 82 Profile* profile = CreateProfileWithName("hash1"); 83 EXPECT_EQ(base::FilePath::FromUTF8Unsafe("/special/drive-hash1"), 88 Profile* profile1 = CreateProfileWithName("hash1"); 91 base::FilePath::FromUTF8Unsafe("/special/drive-hash1")));
|
/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/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...] |
/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...] |
/external/chromium_org/v8/tools/ |
test-push-to-trunk.sh | 77 OUT[8]="hash1" 78 EXP[9]="git log -1 hash1" 80 EXP[10]="git log hash1..HEAD --format=%H"
|
/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/wpa_supplicant_8/src/wps/ |
wps_module_tests.c | 107 /* R-Hash1 */ 115 /* E-Hash1 */
|
wps_enrollee.c | 53 wpa_printf(MSG_DEBUG, "WPS: * E-Hash1"); 57 /* E-Hash1 = HMAC_AuthKey(E-S1 || PSK1 || PK_E || PK_R) */ 67 wpa_hexdump(MSG_DEBUG, "WPS: E-Hash1", hash, SHA256_MAC_LEN); 558 wpa_printf(MSG_DEBUG, "WPS: No R-Hash1 received"); 563 wpa_hexdump(MSG_DEBUG, "WPS: R-Hash1", wps->peer_hash1, WPS_HASH_LEN); 597 /* R-Hash1 = HMAC_AuthKey(R-S1 || PSK1 || PK_E || PK_R) */ 609 wpa_printf(MSG_DEBUG, "WPS: R-Hash1 derived from R-S1 does " [all...] |
wps_attr_parse.c | 314 wpa_printf(MSG_DEBUG, "WPS: Invalid R-Hash1 length %u", 330 wpa_printf(MSG_DEBUG, "WPS: Invalid E-Hash1 length %u",
|
/external/chromium_org/v8/tools/push-to-trunk/ |
test_scripts.py | 596 self._state["last_push_trunk"] = "hash1" 599 Git("checkout -f hash1 -- %s" % TEST_CONFIG[VERSION_FILE], "") 619 Git("diff svn/trunk hash1", "patch content"), 620 Git("svn find-rev hash1", "123455\n"), 623 self._state["push_hash"] = "hash1" [all...] |
/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/emma/core/java12/com/vladium/jcd/cls/ |
ClassDef.java | 471 // final int hash1 = hash [1]; 473 // ((hash1 >>> 24) & 0xFF) << 32 | ((hash1 >>> 16) & 0xFF) << 40 | ((hash1 >>> 8) & 0xFF) << 48 | ((hash1 >>> 0) & 0xFF) << 56;
|
/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);
|