| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
| D | ObjectExtensions.cs | 55 int hash = 23; in ShiftPrimeXOR()
56 hash = ( ( hash << 5 ) * 37 ) ^ a; in ShiftPrimeXOR()
57 hash = ( ( hash << 5 ) * 37 ) ^ b; in ShiftPrimeXOR()
58 return hash; in ShiftPrimeXOR()
63 int hash = 23; in ShiftPrimeXOR()
64 hash = ( ( hash << 5 ) * 37 ) ^ a; in ShiftPrimeXOR()
65 hash = ( ( hash << 5 ) * 37 ) ^ b; in ShiftPrimeXOR()
66 hash = ( ( hash << 5 ) * 37 ) ^ c; in ShiftPrimeXOR()
67 return hash; in ShiftPrimeXOR()
72 int hash = 23; in ShiftPrimeXOR()
[all …]
|
| /external/chromium_org/third_party/skia/tests/ |
| D | DynamicHashTest.cpp | 45 Hash hash; in DEF_TEST() local
46 ASSERT(hash.capacity() == 0); in DEF_TEST()
48 hash.add(&a); in DEF_TEST()
49 ASSERT(hash.capacity() == 4); in DEF_TEST()
51 hash.add(&b); in DEF_TEST()
52 ASSERT(hash.capacity() == 4); in DEF_TEST()
54 hash.add(&c); in DEF_TEST()
55 ASSERT(hash.capacity() == 4); in DEF_TEST()
57 hash.add(&d); in DEF_TEST()
58 ASSERT(hash.capacity() == 8); in DEF_TEST()
[all …]
|
| /external/chromium_org/third_party/smhasher/src/ |
| D | SuperFastHash.cpp | 29 uint32_t hash = 0, tmp; in SuperFastHash() local
39 hash += get16bits (data); in SuperFastHash()
40 tmp = (get16bits (data+2) << 11) ^ hash; in SuperFastHash()
41 hash = (hash << 16) ^ tmp; in SuperFastHash()
43 hash += hash >> 11; in SuperFastHash()
48 case 3: hash += get16bits (data); in SuperFastHash()
49 hash ^= hash << 16; in SuperFastHash()
50 hash ^= data[sizeof (uint16_t)] << 18; in SuperFastHash()
51 hash += hash >> 11; in SuperFastHash()
53 case 2: hash += get16bits (data); in SuperFastHash()
[all …]
|
| D | main.cpp | 37 pfHash hash; member
106 pass &= VerificationTest(info->hash,info->hashbits,info->verification,false); in SelfTest()
118 pass &= VerificationTest(info->hash,info->hashbits,info->verification,true); in SelfTest()
128 void test ( hashfunc<hashtype> hash, HashInfo * info ) in test() argument
142 VerificationTest(hash,hashbits,info->verification,true); in test()
143 SanityTest(hash,hashbits); in test()
144 AppendedZeroesTest(hash,hashbits); in test()
155 BulkSpeedTest(info->hash,info->verification); in test()
162 … TinySpeedTest(hashfunc<hashtype>(info->hash),sizeof(hashtype),i,info->verification,true,cycles); in test()
178 result &= DiffTest< Blob<64>, hashtype >(hash,5,1000,dumpCollisions); in test()
[all …]
|
| /external/chromium_org/base/third_party/superfasthash/ |
| D | superfasthash.c | 42 uint32_t hash = len, tmp; in SuperFastHash() local
52 hash += get16bits (data); in SuperFastHash()
53 tmp = (get16bits (data+2) << 11) ^ hash; in SuperFastHash()
54 hash = (hash << 16) ^ tmp; in SuperFastHash()
56 hash += hash >> 11; in SuperFastHash()
61 case 3: hash += get16bits (data); in SuperFastHash()
62 hash ^= hash << 16; in SuperFastHash()
63 hash ^= ((signed char)data[sizeof (uint16_t)]) << 18; in SuperFastHash()
64 hash += hash >> 11; in SuperFastHash()
66 case 2: hash += get16bits (data); in SuperFastHash()
[all …]
|
| /external/e2fsprogs/ext2ed/ |
| D | ext2.descriptors | 416 __u32 hash[1];
418 __u32 hash[2];
420 __u32 hash[3];
422 __u32 hash[4];
424 __u32 hash[5];
426 __u32 hash[6];
428 __u32 hash[7];
430 __u32 hash[8];
432 __u32 hash[9];
434 __u32 hash[10];
[all …]
|
| /external/icu/icu4c/source/test/cintltst/ |
| D | chashtst.c | 30 static void _put(UHashtable* hash,
35 static void _get(UHashtable* hash,
39 static void _remove(UHashtable* hash,
104 UHashtable *hash; in TestBasic() local
106 hash = uhash_open(hashChars, isEqualChars, NULL, &status); in TestBasic()
109 u_errorName(status), hash); in TestBasic()
112 if (hash == NULL) { in TestBasic()
116 log_verbose("Ok: uhash_open returned 0x%08X\n", hash); in TestBasic()
118 _put(hash, one, 1, 0); in TestBasic()
119 _put(hash, omega, 24, 0); in TestBasic()
[all …]
|
| /external/chromium_org/third_party/icu/source/test/cintltst/ |
| D | chashtst.c | 30 static void _put(UHashtable* hash,
35 static void _get(UHashtable* hash,
39 static void _remove(UHashtable* hash,
104 UHashtable *hash; in TestBasic() local
106 hash = uhash_open(hashChars, isEqualChars, NULL, &status); in TestBasic()
109 u_errorName(status), hash); in TestBasic()
112 if (hash == NULL) { in TestBasic()
116 log_verbose("Ok: uhash_open returned 0x%08X\n", hash); in TestBasic()
118 _put(hash, one, 1, 0); in TestBasic()
119 _put(hash, omega, 24, 0); in TestBasic()
[all …]
|
| /external/skia/tests/ |
| D | DynamicHashTest.cpp | 45 Hash hash; in DEF_TEST() local
46 ASSERT(hash.capacity() == 0); in DEF_TEST()
48 hash.add(&a); in DEF_TEST()
49 ASSERT(hash.capacity() == 4); in DEF_TEST()
51 hash.add(&b); in DEF_TEST()
52 ASSERT(hash.capacity() == 4); in DEF_TEST()
54 hash.add(&c); in DEF_TEST()
55 ASSERT(hash.capacity() == 4); in DEF_TEST()
57 hash.add(&d); in DEF_TEST()
58 ASSERT(hash.capacity() == 8); in DEF_TEST()
[all …]
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
| D | cso_hash.c | 97 static void *cso_data_allocate_node(struct cso_hash_data *hash) in cso_data_allocate_node() argument
99 return MALLOC(hash->nodeSize); in cso_data_allocate_node()
108 cso_hash_create_node(struct cso_hash *hash, in cso_hash_create_node() argument
112 struct cso_node *node = cso_data_allocate_node(hash->data.d); in cso_hash_create_node()
122 ++hash->data.d->size; in cso_hash_create_node()
126 static void cso_data_rehash(struct cso_hash_data *hash, int hint) in cso_data_rehash() argument
132 hash->userNumBits = (short)hint; in cso_data_rehash()
133 while (primeForNumBits(hint) < (hash->size >> 1)) in cso_data_rehash()
139 if (hash->numBits != hint) { in cso_data_rehash()
140 struct cso_node *e = (struct cso_node *)(hash); in cso_data_rehash()
[all …]
|
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| D | cso_hash.c | 97 static void *cso_data_allocate_node(struct cso_hash_data *hash) in cso_data_allocate_node() argument
99 return MALLOC(hash->nodeSize); in cso_data_allocate_node()
108 cso_hash_create_node(struct cso_hash *hash, in cso_hash_create_node() argument
112 struct cso_node *node = cso_data_allocate_node(hash->data.d); in cso_hash_create_node()
122 ++hash->data.d->size; in cso_hash_create_node()
126 static void cso_data_rehash(struct cso_hash_data *hash, int hint) in cso_data_rehash() argument
132 hash->userNumBits = (short)hint; in cso_data_rehash()
133 while (primeForNumBits(hint) < (hash->size >> 1)) in cso_data_rehash()
139 if (hash->numBits != hint) { in cso_data_rehash()
140 struct cso_node *e = (struct cso_node *)(hash); in cso_data_rehash()
[all …]
|
| /external/e2fsprogs/tests/f_h_reindex/ |
| D | expect.1 | 5 Problem in HTREE directory inode 16001: block #1 has bad max hash
6 Problem in HTREE directory inode 16001: block #2 has bad min hash
7 Problem in HTREE directory inode 16001: block #2 has bad max hash
8 Problem in HTREE directory inode 16001: block #3 has bad min hash
9 Problem in HTREE directory inode 16001: block #3 has bad max hash
10 Problem in HTREE directory inode 16001: block #4 has bad min hash
11 Problem in HTREE directory inode 16001: block #4 has bad max hash
12 Problem in HTREE directory inode 16001: block #5 has bad min hash
13 Problem in HTREE directory inode 16001: block #5 has bad max hash
14 Problem in HTREE directory inode 16001: block #6 has bad min hash
[all …]
|
| /external/chromium_org/third_party/icu/source/common/ |
| D | uhash.c | 120 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \ argument
121 if (hash->keyDeleter != NULL && keypointer != NULL) { \
122 (*hash->keyDeleter)(keypointer); \
124 if (hash->valueDeleter != NULL && valuepointer != NULL) { \
125 (*hash->valueDeleter)(valuepointer); \
141 _uhash_setElement(UHashtable *hash, UHashElement* e, in _uhash_setElement() argument
146 if (hash->keyDeleter != NULL && e->key.pointer != NULL && in _uhash_setElement()
148 (*hash->keyDeleter)(e->key.pointer); in _uhash_setElement()
150 if (hash->valueDeleter != NULL) { in _uhash_setElement()
153 (*hash->valueDeleter)(oldValue.pointer); in _uhash_setElement()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | uhash.c | 120 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \ argument
121 if (hash->keyDeleter != NULL && keypointer != NULL) { \
122 (*hash->keyDeleter)(keypointer); \
124 if (hash->valueDeleter != NULL && valuepointer != NULL) { \
125 (*hash->valueDeleter)(valuepointer); \
141 _uhash_setElement(UHashtable *hash, UHashElement* e, in _uhash_setElement() argument
146 if (hash->keyDeleter != NULL && e->key.pointer != NULL && in _uhash_setElement()
148 (*hash->keyDeleter)(e->key.pointer); in _uhash_setElement()
150 if (hash->valueDeleter != NULL) { in _uhash_setElement()
153 (*hash->valueDeleter)(oldValue.pointer); in _uhash_setElement()
[all …]
|
| /external/guava/guava/src/com/google/common/hash/ |
| D | HashCodes.java | 15 package com.google.common.hash;
29 static HashCode fromInt(int hash) { in fromInt() argument
30 return new IntHashCode(hash); in fromInt()
34 final int hash; field in HashCodes.IntHashCode
36 IntHashCode(int hash) { in IntHashCode() argument
37 this.hash = hash; in IntHashCode()
46 (byte) hash, in asBytes()
47 (byte) (hash >> 8), in asBytes()
48 (byte) (hash >> 16), in asBytes()
49 (byte) (hash >> 24)}; in asBytes()
[all …]
|
| /external/deqp/framework/delibs/depool/ |
| D | dePoolHash.h | 91 const TYPENAME* hash; \
98 void TYPENAME##_reset (TYPENAME* hash); \
99 deBool TYPENAME##_reserve (TYPENAME* hash, int capacity); \
100 VALUETYPE* TYPENAME##_find (const TYPENAME* hash, KEYTYPE key); \
101 deBool TYPENAME##_insert (TYPENAME* hash, KEYTYPE key, VALUETYPE value); \
102 void TYPENAME##_delete (TYPENAME* hash, KEYTYPE key); \
104 DE_INLINE int TYPENAME##_getNumElements (const TYPENAME* hash) DE_UNUSED_FUNCTION; \
105 DE_INLINE void TYPENAME##Iter_init (const TYPENAME* hash, TYPENAME##Iter* iter) DE_UNUSED_FUNCTI…
111 DE_INLINE int TYPENAME##_getNumElements (const TYPENAME* hash) \
113 return hash->numElements; \
[all …]
|
| D | dePoolHash.c | 40 deTestHash* hash = deTestHash_create(pool); in dePoolHash_selfTest() local
48 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 0); in dePoolHash_selfTest()
51 const int* val = deTestHash_find(hash, (deInt16)i); in dePoolHash_selfTest()
58 deTestHash_insert(hash, (deInt16)i, -i); in dePoolHash_selfTest()
61 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 5000); in dePoolHash_selfTest()
64 const int* val = deTestHash_find(hash, (deInt16)i); in dePoolHash_selfTest()
70 deTestHash_delete(hash, (deInt16)i); in dePoolHash_selfTest()
72 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 4000); in dePoolHash_selfTest()
75 const int* val = deTestHash_find(hash, (deInt16)i); in dePoolHash_selfTest()
84 deTestHash_insert(hash, (deInt16)i, -i); in dePoolHash_selfTest()
[all …]
|
| /external/chromium_org/crypto/third_party/nss/ |
| D | rsawrapr.c | 26 const SECHashObject *hash; in MGF1() local
30 hash = HASH_GetHashObject(hashAlg); in MGF1()
31 if (hash == NULL) in MGF1()
34 hashContext = (*hash->create)(); in MGF1()
35 rounds = (maskLen + hash->length - 1) / hash->length; in MGF1()
44 (*hash->begin)(hashContext); in MGF1()
45 (*hash->update)(hashContext, mgfSeed, mgfSeedLen); in MGF1()
46 (*hash->update)(hashContext, C, sizeof C); in MGF1()
48 tempHash = mask + counter * hash->length; in MGF1()
50 (*hash->end)(hashContext, tempHash, &digestLen, hash->length); in MGF1()
[all …]
|
| /external/elfutils/0.153/libelf/ |
| D | dl-hash.h | 62 unsigned int hash = (unsigned int) *iname++; in _dl_elf_hash() local
65 hash = (hash << 4) + (unsigned int) *iname++; in _dl_elf_hash()
68 hash = (hash << 4) + (unsigned int) *iname++; in _dl_elf_hash()
71 hash = (hash << 4) + (unsigned int) *iname++; in _dl_elf_hash()
74 hash = (hash << 4) + (unsigned int) *iname++; in _dl_elf_hash()
78 hash = (hash << 4) + (unsigned int) *iname++; in _dl_elf_hash()
79 hi = hash & 0xf0000000; in _dl_elf_hash()
92 hash ^= hi; in _dl_elf_hash()
93 hash ^= hi >> 24; in _dl_elf_hash()
99 return hash; in _dl_elf_hash()
|
| /external/chromium_org/net/disk_cache/blockfile/ |
| D | index_table_v3_unittest.cc | 149 uint32 hash = 0x55aa6699; in TEST() local
160 EntryCell entry = EntryCell::GetEntryCellForTest(cell_num, hash, addr, NULL, in TEST()
171 EXPECT_EQ(hash, entry.hash()); in TEST()
184 EntryCell entry2 = EntryCell::GetEntryCellForTest(cell_num, hash, addr, in TEST()
196 hash = ~hash; in TEST()
278 uint32 hash = i * i * 1111 + i * 11; in TEST() local
280 EntryCell entry = index.CreateEntryCell(hash, addr); in TEST()
283 disk_cache::CellInfo info = { hash, addr }; in TEST()
290 uint32 hash = entries[i].hash; in TEST() local
293 disk_cache::EntrySet found_entries = index.LookupEntries(hash); in TEST()
[all …]
|
| /external/chromium_org/third_party/WebKit/Source/wtf/text/ |
| D | StringHash.h | 45 static unsigned hash(StringImpl* key) { return key->hash(); } in hash() function
51 static unsigned hash(const RefPtr<StringImpl>& key) { return key->hash(); } in hash() function
57 static unsigned hash(const String& key) { return key.impl()->hash(); } in hash() function
73 static unsigned hash(const UChar* data, unsigned length) in hash() function
78 static unsigned hash(StringImpl* str) in hash() function
81 return hash(str->characters8(), str->length()); in hash()
82 return hash(str->characters16(), str->length()); in hash()
85 static unsigned hash(const LChar* data, unsigned length) in hash() function
90 static inline unsigned hash(const char* data, unsigned length) in hash() function
92 return CaseFoldingHash::hash(reinterpret_cast<const LChar*>(data), length); in hash()
[all …]
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| D | BloomFilter.h | 48 void add(unsigned hash);
49 void remove(unsigned hash);
53 bool mayContain(unsigned hash) const { return firstSlot(hash) && secondSlot(hash); } in mayContain() argument
60 void add(const String& string) { add(string.impl()->hash()); } in add()
62 void remove(const String& string) { remove(string.impl()->hash()); } in remove()
65 bool mayContain(const String& string) const { return mayContain(string.impl()->hash()); } in mayContain()
74 uint8_t& firstSlot(unsigned hash) { return m_table[hash & keyMask]; } in firstSlot() argument
75 uint8_t& secondSlot(unsigned hash) { return m_table[(hash >> 16) & keyMask]; } in secondSlot() argument
76 const uint8_t& firstSlot(unsigned hash) const { return m_table[hash & keyMask]; } in firstSlot() argument
77 const uint8_t& secondSlot(unsigned hash) const { return m_table[(hash >> 16) & keyMask]; } in secondSlot() argument
[all …]
|
| D | StringHasherTest.cpp | 60 EXPECT_EQ(emptyStringHash, hasher.hash()); in TEST()
71 EXPECT_EQ(singleNullCharacterHash, hasher.hash()); in TEST()
77 EXPECT_EQ(testAHash1, hasher.hash()); in TEST()
80 EXPECT_EQ(testAHash2, hasher.hash()); in TEST()
83 EXPECT_EQ(testAHash3, hasher.hash()); in TEST()
86 EXPECT_EQ(testAHash4, hasher.hash()); in TEST()
89 EXPECT_EQ(testAHash5, hasher.hash()); in TEST()
95 EXPECT_EQ(testBHash1, hasher.hash()); in TEST()
98 EXPECT_EQ(testBHash2, hasher.hash()); in TEST()
101 EXPECT_EQ(testBHash3, hasher.hash()); in TEST()
[all …]
|
| /external/chromium_org/third_party/skia/src/core/ |
| D | SkChecksum.h | 45 static uint32_t Mix(uint32_t hash) { in Mix() argument
46 hash ^= hash >> 16; in Mix()
47 hash *= 0x85ebca6b; in Mix()
48 hash ^= hash >> 13; in Mix()
49 hash *= 0xc2b2ae35; in Mix()
50 hash ^= hash >> 16; in Mix()
51 return hash; in Mix()
74 uint32_t hash = seed; variable
81 hash ^= k;
82 hash = (hash << 13) | (hash >> 19);
[all …]
|
| /external/libcxx/test/extensions/hash/ |
| D | specializations.pass.cpp | 17 assert(__gnu_cxx::hash<const char *>()("test") == in main()
18 std::hash<std::string>()("test")); in main()
19 assert(__gnu_cxx::hash<char *>()(str) == std::hash<std::string>()("test")); in main()
20 assert(__gnu_cxx::hash<char>()(42) == 42); in main()
21 assert(__gnu_cxx::hash<signed char>()(42) == 42); in main()
22 assert(__gnu_cxx::hash<unsigned char>()(42) == 42); in main()
23 assert(__gnu_cxx::hash<short>()(42) == 42); in main()
24 assert(__gnu_cxx::hash<unsigned short>()(42) == 42); in main()
25 assert(__gnu_cxx::hash<int>()(42) == 42); in main()
26 assert(__gnu_cxx::hash<unsigned int>()(42) == 42); in main()
[all …]
|