Home
last modified time | relevance | path

Searched refs:hash (Results 1 – 25 of 1252) sorted by relevance

12345678910>>...51

/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
DObjectExtensions.cs55 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/skia/tests/
DDynamicHashTest.cpp45 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/e2fsprogs/ext2ed/
Dext2.descriptors416 __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/
Dchashtst.c30 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/mesa3d/src/gallium/auxiliary/cso_cache/
Dcso_hash.c97 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/
Dexpect.15 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/icu/icu4c/source/common/
Duhash.c120 #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 …]
Dhash.h29 UHashtable* hash; variable
115 hash = &hashObj; in init()
116 uhash_setKeyDeleter(hash, uprv_deleteUObject); in init()
121 UErrorCode& status) : hash(0) { in Hashtable()
125 : hash(0) in Hashtable()
136 : hash(0) in Hashtable()
142 : hash(0) in Hashtable()
149 if (hash != NULL) { in ~Hashtable()
150 uhash_close(hash); in ~Hashtable()
155 return uhash_setValueDeleter(hash, fn); in setValueDeleter()
[all …]
Duhash.h223 uhash_init(UHashtable *hash,
234 uhash_close(UHashtable *hash);
245 uhash_setKeyHasher(UHashtable *hash, UHashFunction *fn);
255 uhash_setKeyComparator(UHashtable *hash, UKeyComparator *fn);
265 uhash_setValueComparator(UHashtable *hash, UValueComparator *fn);
278 uhash_setKeyDeleter(UHashtable *hash, UObjectDeleter *fn);
291 uhash_setValueDeleter(UHashtable *hash, UObjectDeleter *fn);
301 uhash_setResizePolicy(UHashtable *hash, enum UHashResizePolicy policy);
309 uhash_count(const UHashtable *hash);
325 uhash_put(UHashtable *hash,
[all …]
/external/deqp/framework/delibs/depool/
DdePoolHash.h91 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 …]
DdePoolHash.c40 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 …]
DdePoolHashSet.c61 const int* val = deTestHash_find(hash, (deInt16)i); in dePoolHashSet_selfTest()
68 deTestHash_insert(hash, (deInt16)i, -i); in dePoolHashSet_selfTest()
71 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 5000); in dePoolHashSet_selfTest()
74 const int* val = deTestHash_find(hash, (deInt16)i); in dePoolHashSet_selfTest()
80 deTestHash_delete(hash, (deInt16)i); in dePoolHashSet_selfTest()
82 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 4000); in dePoolHashSet_selfTest()
85 const int* val = deTestHash_find(hash, (deInt16)i); in dePoolHashSet_selfTest()
94 deTestHash_insert(hash, (deInt16)i, -i); in dePoolHashSet_selfTest()
98 const int* val = deTestHash_find(hash, (deInt16)i); in dePoolHashSet_selfTest()
110 for (deTestHashIter_init(hash, &iter); deTestHashIter_hasItem(&iter); deTestHashIter_next(&iter)) in dePoolHashSet_selfTest()
[all …]
/external/skia/src/core/
DSkChecksum.h47 static uint32_t Mix(uint32_t hash) { in Mix() argument
48 hash ^= hash >> 16; in Mix()
49 hash *= 0x85ebca6b; in Mix()
50 hash ^= hash >> 13; in Mix()
51 hash *= 0xc2b2ae35; in Mix()
52 hash ^= hash >> 16; in Mix()
53 return hash; in Mix()
62 static uint32_t CheapMix(uint32_t hash) { in CheapMix() argument
63 hash ^= hash >> 16; in CheapMix()
64 hash *= 0x85ebca6b; in CheapMix()
[all …]
/external/guava/guava/src/com/google/common/hash/
DHashCode.java15 package com.google.common.hash;
113 public static HashCode fromInt(int hash) { in fromInt() argument
114 return new IntHashCode(hash); in fromInt()
118 final int hash; field in HashCode.IntHashCode
120 IntHashCode(int hash) { in IntHashCode() argument
121 this.hash = hash; in IntHashCode()
132 (byte) hash, in asBytes()
133 (byte) (hash >> 8), in asBytes()
134 (byte) (hash >> 16), in asBytes()
135 (byte) (hash >> 24)}; in asBytes()
[all …]
/external/elfutils/src/libelf/
Ddl-hash.h42 unsigned int hash = (unsigned int) *iname++; in _dl_elf_hash() local
45 hash = (hash << 4) + (unsigned int) *iname++; in _dl_elf_hash()
48 hash = (hash << 4) + (unsigned int) *iname++; in _dl_elf_hash()
51 hash = (hash << 4) + (unsigned int) *iname++; in _dl_elf_hash()
54 hash = (hash << 4) + (unsigned int) *iname++; in _dl_elf_hash()
58 hash = (hash << 4) + (unsigned int) *iname++; in _dl_elf_hash()
59 hi = hash & 0xf0000000; in _dl_elf_hash()
72 hash ^= hi; in _dl_elf_hash()
73 hash ^= hi >> 24; in _dl_elf_hash()
79 return hash; in _dl_elf_hash()
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/
DZHash.java28 private HashMap<KeyType, ValueType> hash; field in ZHash
34 hash = new HashMap<KeyType, ValueType>();
45 return hash.get(key); in get()
59 if(hash.containsKey(key)) { in addToTop()
60 hash.put(key, value); in addToTop()
63 hash.put(key, value); in addToTop()
76 if(hash.containsKey(key)) { in addToBottom()
77 hash.put(key, value); in addToBottom()
80 hash.put(key, value); in addToBottom()
87 if(!hash.containsKey(element)) { in moveToTop()
[all …]
/external/libcxx/test/std/extensions/hash/
Dspecializations.pass.cpp19 assert(__gnu_cxx::hash<const char *>()("test") == in main()
20 std::hash<std::string>()("test")); in main()
21 assert(__gnu_cxx::hash<char *>()(str) == std::hash<std::string>()("test")); in main()
22 assert(__gnu_cxx::hash<char>()(42) == 42); in main()
23 assert(__gnu_cxx::hash<signed char>()(42) == 42); in main()
24 assert(__gnu_cxx::hash<unsigned char>()(42) == 42); in main()
25 assert(__gnu_cxx::hash<short>()(42) == 42); in main()
26 assert(__gnu_cxx::hash<unsigned short>()(42) == 42); in main()
27 assert(__gnu_cxx::hash<int>()(42) == 42); in main()
28 assert(__gnu_cxx::hash<unsigned int>()(42) == 42); in main()
[all …]
/external/doclava/res/assets/templates/assets/
Djquery-history.js15 return msie.getDoc().location.hash;
17 setHash: function(hash) { argument
21 d.location.hash = hash;
26 var hash = msie.iframe ? msie.getHash() : location.hash;
27 if (hash != currentHash) {
28 currentHash = hash;
30 location.hash = currentHash;
39 add: function(hash) { argument
40 hash = '#' + hash.replace(hashTrim, '');
41 if (currentHash != hash) {
[all …]
/external/wpa_supplicant_8/src/eap_common/
Deap_pwd_common.c26 void eap_pwd_h_update(struct crypto_hash *hash, const u8 *data, size_t len) in eap_pwd_h_update() argument
28 crypto_hash_update(hash, data, len); in eap_pwd_h_update()
32 void eap_pwd_h_final(struct crypto_hash *hash, u8 *digest) in eap_pwd_h_final() argument
35 crypto_hash_finish(hash, digest, &len); in eap_pwd_h_final()
43 struct crypto_hash *hash; in eap_pwd_kdf() local
54 hash = crypto_hash_init(CRYPTO_HASH_ALG_HMAC_SHA256, in eap_pwd_kdf()
56 if (hash == NULL) in eap_pwd_kdf()
59 crypto_hash_update(hash, digest, SHA256_MAC_LEN); in eap_pwd_kdf()
60 crypto_hash_update(hash, (u8 *) &i, sizeof(u16)); in eap_pwd_kdf()
61 crypto_hash_update(hash, label, labellen); in eap_pwd_kdf()
[all …]
/external/mesa3d/src/mesa/program/
Dprog_cache.c39 GLuint hash; member
61 GLuint hash = 0, i; in hash_key() local
69 hash += ikey[i]; in hash_key()
70 hash += (hash << 10); in hash_key()
71 hash ^= (hash >> 6); in hash_key()
74 return hash; in hash_key()
97 c->next = items[c->hash % size]; in rehash()
98 items[c->hash % size] = c; in rehash()
182 const GLuint hash = hash_key(key, keysize); in _mesa_search_program_cache() local
185 for (c = cache->items[hash % cache->size]; c; c = c->next) { in _mesa_search_program_cache()
[all …]
/external/deqp/framework/delibs/debase/
DdeString.c48 deUint32 hash = 5381; in deStringHash() local
53 hash = (hash << 5) + hash + c; in deStringHash()
55 return hash; in deStringHash()
60 deUint32 hash = 5381; in deStringHashLeading() local
65 hash = (hash << 5) + hash + c; in deStringHashLeading()
67 return hash; in deStringHashLeading()
74 deUint32 hash = 5381; in deMemoryHash() local
78 hash = (hash << 5) + hash + *input++; in deMemoryHash()
80 return hash; in deMemoryHash()
/external/protobuf/src/google/protobuf/stubs/
Dhash.h63 struct hash { struct
77 struct hash<const char*> { argument
90 typename HashFcn = hash<Key>,
98 typename HashFcn = hash<Key>,
108 struct hash : public HASH_NAMESPACE::hash_compare<Key> {
121 struct hash<const char*>
126 typename HashFcn = hash<Key>,
135 typename HashFcn = hash<Key>,
146 struct hash : public HASH_NAMESPACE::hash<Key> {
150 struct hash<const Key*> {
[all …]
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/
DSHA1ImplTest.java70 int[] hash = { 0xA9993E36, 0x4706816A, 0xBA3E2571, 0x7850C26C, 0x9CD0D89D }; in testOneBlockMessage() local
91 hash[k] == hash1[k]); in testOneBlockMessage()
93 assertTrue("false2: k=" + k + " j=" + Integer.toHexString(j), hash[k] == j); in testOneBlockMessage()
105 int[] hash = { 0x84983e44, 0x1c3bd26e, 0xbaae4aa1, 0xf95129e5, 0xe54670f1 }; in testMultiBlockMessage() local
117 assertTrue("false: k=" + k + " j=" + Integer.toHexString(j), hash[k] == j); in testMultiBlockMessage()
129 int[] hash = { 0x34aa973c, 0xd4c4daa4, 0xf61eeb2b, 0xdbad2731, 0x6534016f }; in testLongMessage() local
155 hash[k] == j); in testLongMessage()
164 private void alternateHash(int[] bufW, int[] hash) { in alternateHash() argument
194 int a = hash[0]; //0x67452301 ; in alternateHash()
195 int b = hash[1]; //0xEFCDAB89 ; in alternateHash()
[all …]
/external/javassist/src/main/javassist/scopedpool/
DSoftValueHashMap.java56 return hash.entrySet(); in entrySet()
60 private Map hash; field in SoftValueHashMap
72 if (ref == (SoftValueRef)hash.get(ref.key)) { in processQueue()
75 hash.remove(ref.key); in processQueue()
97 hash = new HashMap(initialCapacity, loadFactor); in SoftValueHashMap()
111 hash = new HashMap(initialCapacity); in SoftValueHashMap()
119 hash = new HashMap(); in SoftValueHashMap()
146 return hash.size(); in size()
154 return hash.isEmpty(); in isEmpty()
166 return hash.containsKey(key); in containsKey()
[all …]
/external/linux-tools-perf/src/include/linux/
Dhash.h37 u64 hash = val; in hash_64() local
40 u64 n = hash; in hash_64()
42 hash -= n; in hash_64()
44 hash -= n; in hash_64()
46 hash += n; in hash_64()
48 hash -= n; in hash_64()
50 hash += n; in hash_64()
52 hash += n; in hash_64()
55 return hash >> (64 - bits); in hash_64()
61 u32 hash = val * GOLDEN_RATIO_PRIME_32; in hash_32() local
[all …]

12345678910>>...51