Home
last modified time | relevance | path

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

12345678910>>...78

/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/kmod/shared/
Dhash.c39 struct hash { struct
47 struct hash *hash_new(unsigned int n_buckets, in hash_new() argument
50 struct hash *hash; in hash_new() local
53 hash = calloc(1, sizeof(struct hash) + in hash_new()
55 if (hash == NULL) in hash_new()
57 hash->n_buckets = n_buckets; in hash_new()
58 hash->free_value = free_value; in hash_new()
59 hash->step = n_buckets / 32; in hash_new()
60 if (hash->step == 0) in hash_new()
61 hash->step = 4; in hash_new()
[all …]
Dhash.h5 struct hash;
8 const struct hash *hash; member
13 struct hash *hash_new(unsigned int n_buckets, void (*free_value)(void *value));
14 void hash_free(struct hash *hash);
15 int hash_add(struct hash *hash, const char *key, const void *value);
16 int hash_add_unique(struct hash *hash, const char *key, const void *value);
17 int hash_del(struct hash *hash, const char *key);
18 void *hash_find(const struct hash *hash, const char *key);
19 unsigned int hash_get_count(const struct hash *hash);
20 void hash_iter_init(const struct hash *hash, struct hash_iter *iter);
/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.c32 static void _put(UHashtable* hash,
37 static void _get(UHashtable* hash,
41 static void _remove(UHashtable* hash,
106 UHashtable *hash; in TestBasic() local
108 hash = uhash_open(hashChars, isEqualChars, NULL, &status); in TestBasic()
111 u_errorName(status), hash); in TestBasic()
114 if (hash == NULL) { in TestBasic()
118 log_verbose("Ok: uhash_open returned 0x%08X\n", hash); in TestBasic()
120 _put(hash, one, 1, 0); in TestBasic()
121 _put(hash, omega, 24, 0); in TestBasic()
[all …]
/external/libdrm/amdgpu/
Dutil_hash.c100 static void *util_data_allocate_node(struct util_hash_data *hash) in util_data_allocate_node() argument
102 return malloc(hash->nodeSize); in util_data_allocate_node()
111 util_hash_create_node(struct util_hash *hash, in util_hash_create_node() argument
115 struct util_node *node = util_data_allocate_node(hash->data.d); in util_hash_create_node()
125 ++hash->data.d->size; in util_hash_create_node()
129 static void util_data_rehash(struct util_hash_data *hash, int hint) in util_data_rehash() argument
135 hash->userNumBits = (short)hint; in util_data_rehash()
136 while (primeForNumBits(hint) < (hash->size >> 1)) in util_data_rehash()
142 if (hash->numBits != hint) { in util_data_rehash()
143 struct util_node *e = (struct util_node *)(hash); in util_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/mesa3d/src/gallium/auxiliary/cso_cache/
Dcso_hash.c99 static void *cso_data_allocate_node(struct cso_hash_data *hash) in cso_data_allocate_node() argument
101 return MALLOC(hash->nodeSize); in cso_data_allocate_node()
110 cso_hash_create_node(struct cso_hash *hash, in cso_hash_create_node() argument
114 struct cso_node *node = cso_data_allocate_node(hash->data.d); in cso_hash_create_node()
124 ++hash->data.d->size; in cso_hash_create_node()
128 static void cso_data_rehash(struct cso_hash_data *hash, int hint) in cso_data_rehash() argument
134 hash->userNumBits = (short)hint; in cso_data_rehash()
135 while (primeForNumBits(hint) < (hash->size >> 1)) in cso_data_rehash()
141 if (hash->numBits != hint) { in cso_data_rehash()
142 struct cso_node *e = (struct cso_node *)(hash); in cso_data_rehash()
[all …]
/external/icu/icu4c/source/common/
Duhash.c122 #define HASH_DELETE_KEY_VALUE(hash, keypointer, valuepointer) \ argument
123 if (hash->keyDeleter != NULL && keypointer != NULL) { \
124 (*hash->keyDeleter)(keypointer); \
126 if (hash->valueDeleter != NULL && valuepointer != NULL) { \
127 (*hash->valueDeleter)(valuepointer); \
143 _uhash_setElement(UHashtable *hash, UHashElement* e, in _uhash_setElement() argument
148 if (hash->keyDeleter != NULL && e->key.pointer != NULL && in _uhash_setElement()
150 (*hash->keyDeleter)(e->key.pointer); in _uhash_setElement()
152 if (hash->valueDeleter != NULL) { in _uhash_setElement()
155 (*hash->valueDeleter)(oldValue.pointer); in _uhash_setElement()
[all …]
Dhash.h31 UHashtable* hash; variable
117 hash = &hashObj; in init()
118 uhash_setKeyDeleter(hash, uprv_deleteUObject); in init()
123 UErrorCode& status) : hash(0) { in Hashtable()
127 : hash(0) in Hashtable()
138 : hash(0) in Hashtable()
144 : hash(0) in Hashtable()
151 if (hash != NULL) { in ~Hashtable()
152 uhash_close(hash); in ~Hashtable()
157 return uhash_setValueDeleter(hash, fn); in setValueDeleter()
[all …]
/external/skia/src/opts/
DSkChecksum_opts.h35 uint64_t hash = seed; in hash_fn() local
40 uint64_t a = hash, in hash_fn()
41 b = hash, in hash_fn()
42 c = hash; in hash_fn()
51 hash = a^b^c; in hash_fn()
56 hash = _mm_crc32_u64(hash, unaligned_load<uint64_t>(data)); in hash_fn()
63 hash = _mm_crc32_u64(hash, unaligned_load<uint64_t>(data)); in hash_fn()
69 auto hash32 = (uint32_t)hash; in hash_fn()
87 static uint32_t hash_fn(const void* vdata, size_t bytes, uint32_t hash) { in hash_fn() argument
94 uint32_t a = hash, in hash_fn()
[all …]
/external/freetype/src/base/
Dfthash.c107 FT_Hash hash ) in hash_bucket() argument
110 FT_Hashnode* bp = hash->table; in hash_bucket()
114 res = (hash->lookup)( &key ); in hash_bucket()
116 ndp = bp + ( res % hash->size ); in hash_bucket()
119 if ( (hash->compare)( &(*ndp)->key, &key ) ) in hash_bucket()
124 ndp = bp + ( hash->size - 1 ); in hash_bucket()
132 hash_rehash( FT_Hash hash, in hash_rehash() argument
135 FT_Hashnode* obp = hash->table; in hash_rehash()
139 FT_UInt i, sz = hash->size; in hash_rehash()
143 hash->size <<= 1; in hash_rehash()
[all …]
/external/mesa3d/src/compiler/nir/
Dnir_instr_set.c27 #define HASH(hash, data) _mesa_fnv32_1a_accumulate((hash), (data)) argument
30 hash_src(uint32_t hash, const nir_src *src) in hash_src() argument
33 hash = HASH(hash, src->ssa); in hash_src()
34 return hash; in hash_src()
38 hash_alu_src(uint32_t hash, const nir_alu_src *src, unsigned num_components) in hash_alu_src() argument
40 hash = HASH(hash, src->abs); in hash_alu_src()
41 hash = HASH(hash, src->negate); in hash_alu_src()
44 hash = HASH(hash, src->swizzle[i]); in hash_alu_src()
46 hash = hash_src(hash, &src->src); in hash_alu_src()
47 return hash; in hash_alu_src()
[all …]
/external/syslinux/gpxe/src/util/Option/
DROM.pm220 my $hash = {};
221 tie %$hash, "Option::ROM::Fields", {
238 bless $hash, $class;
239 return $hash;
251 my $hash = shift;
252 my $self = tied(%$hash);
274 my $hash = shift;
275 my $self = tied(%$hash);
296 my $hash = shift;
297 my $self = tied(%$hash);
[all …]
/external/deqp/framework/delibs/depool/
DdePoolHash.h91 const TYPENAME* hash; \
98 void TYPENAME##_reset (DE_PTR_TYPE(TYPENAME) hash); \
99 deBool TYPENAME##_reserve (DE_PTR_TYPE(TYPENAME) hash, int capacity); \
100 VALUETYPE* TYPENAME##_find (const TYPENAME* hash, KEYTYPE key); \
101 deBool TYPENAME##_insert (DE_PTR_TYPE(TYPENAME) hash, KEYTYPE key, VALUETYPE value); \
102 void TYPENAME##_delete (DE_PTR_TYPE(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 …]
/external/libchrome/crypto/third_party/nss/
Drsawrapr.c26 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/deqp/framework/delibs/debase/
DdeSha1.c50 stream->hash[0] = 0x67452301u; in deSha1Stream_init()
51 stream->hash[1] = 0xEFCDAB89u; in deSha1Stream_init()
52 stream->hash[2] = 0x98BADCFEu; in deSha1Stream_init()
53 stream->hash[3] = 0x10325476u; in deSha1Stream_init()
54 stream->hash[4] = 0xC3D2E1F0u; in deSha1Stream_init()
75 deUint32 a = stream->hash[0]; in deSha1Stream_flushChunk()
76 deUint32 b = stream->hash[1]; in deSha1Stream_flushChunk()
77 deUint32 c = stream->hash[2]; in deSha1Stream_flushChunk()
78 deUint32 d = stream->hash[3]; in deSha1Stream_flushChunk()
79 deUint32 e = stream->hash[4]; in deSha1Stream_flushChunk()
[all …]
/external/elfutils/libelf/
Ddl-hash.h31 unsigned long int hash = *name; in _dl_elf_hash() local
32 if (hash != 0 && name[1] != '\0') in _dl_elf_hash()
34 hash = (hash << 4) + name[1]; in _dl_elf_hash()
37 hash = (hash << 4) + name[2]; in _dl_elf_hash()
40 hash = (hash << 4) + name[3]; in _dl_elf_hash()
43 hash = (hash << 4) + name[4]; in _dl_elf_hash()
48 hash = (hash << 4) + *name++; in _dl_elf_hash()
49 hi = hash & 0xf0000000; in _dl_elf_hash()
62 hash ^= hi >> 24; in _dl_elf_hash()
67 hash &= 0x0fffffff; in _dl_elf_hash()
[all …]
/external/v8/src/js/
Dcollection.js29 function HashToEntry(table, hash, numBuckets) { argument
30 var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
36 function SetFindEntry(table, numBuckets, key, hash) { argument
37 var entry = HashToEntry(table, hash, numBuckets);
56 function MapFindEntry(table, numBuckets, key, hash) { argument
57 var entry = HashToEntry(table, hash, numBuckets);
77 var hash = key;
78 hash = hash ^ seed;
79 hash = ~hash + (hash << 15); // hash = (hash << 15) - hash - 1;
80 hash = hash ^ (hash >>> 12);
[all …]
/external/guava/guava/src/com/google/common/hash/
DHashCode.java15 package com.google.common.hash;
119 public static HashCode fromInt(int hash) { in fromInt() argument
120 return new IntHashCode(hash); in fromInt()
124 final int hash; field in HashCode.IntHashCode
126 IntHashCode(int hash) { in IntHashCode() argument
127 this.hash = hash; in IntHashCode()
138 (byte) hash, in asBytes()
139 (byte) (hash >> 8), in asBytes()
140 (byte) (hash >> 16), in asBytes()
141 (byte) (hash >> 24)}; in asBytes()
[all …]
/external/skia/include/private/
DSkChecksum.h29 static uint32_t Mix(uint32_t hash) { in Mix() argument
30 hash ^= hash >> 16; in Mix()
31 hash *= 0x85ebca6b; in Mix()
32 hash ^= hash >> 13; in Mix()
33 hash *= 0xc2b2ae35; in Mix()
34 hash ^= hash >> 16; in Mix()
35 return hash; in Mix()
44 static uint32_t CheapMix(uint32_t hash) { in CheapMix() argument
45 hash ^= hash >> 16; in CheapMix()
46 hash *= 0x85ebca6b; in CheapMix()
[all …]
/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/libcxx/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 …]

12345678910>>...78