| /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/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/skqp/tests/ |
| D | DynamicHashTest.cpp | 21 static uint32_t Hash(const int& key) { return key; } in Hash() function
25 class Hash : public SkTDynamicHash<Entry, int> { class
27 Hash() : INHERITED() {} in Hash() function in __anon31efb7e40111::Hash
48 Hash hash; in DEF_TEST() local
49 ASSERT(hash.capacity() == 0); in DEF_TEST()
51 hash.add(&a); in DEF_TEST()
52 ASSERT(hash.capacity() == 4); in DEF_TEST()
54 hash.add(&b); in DEF_TEST()
55 ASSERT(hash.capacity() == 4); in DEF_TEST()
57 hash.add(&c); in DEF_TEST()
[all …]
|
| /external/skia/tests/ |
| D | DynamicHashTest.cpp | 21 static uint32_t Hash(const int& key) { return key; } in Hash() function
25 class Hash : public SkTDynamicHash<Entry, int> { class
27 Hash() : INHERITED() {} in Hash() function in __anonf8f7600d0111::Hash
48 Hash hash; in DEF_TEST() local
49 ASSERT(hash.capacity() == 0); in DEF_TEST()
51 hash.add(&a); in DEF_TEST()
52 ASSERT(hash.capacity() == 4); in DEF_TEST()
54 hash.add(&b); in DEF_TEST()
55 ASSERT(hash.capacity() == 4); in DEF_TEST()
57 hash.add(&c); in DEF_TEST()
[all …]
|
| /external/kmod/shared/ |
| D | hash.c | 25 #include <shared/hash.h>
39 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()
[all …]
|
| D | hash.h | 5 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/antlr/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/mesa3d/src/compiler/nir/ |
| D | nir_instr_set.c | 27 #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/mesa3d/src/gallium/auxiliary/cso_cache/ |
| D | cso_hash.c | 86 static void *cso_data_allocate_node(struct cso_hash_data *hash) in cso_data_allocate_node() argument
88 return MALLOC(hash->nodeSize); in cso_data_allocate_node()
97 cso_hash_create_node(struct cso_hash *hash, in cso_hash_create_node() argument
101 struct cso_node *node = cso_data_allocate_node(hash->data.d); in cso_hash_create_node()
111 ++hash->data.d->size; in cso_hash_create_node()
115 static void cso_data_rehash(struct cso_hash_data *hash, int hint) in cso_data_rehash() argument
121 hash->userNumBits = (short)hint; in cso_data_rehash()
122 while (primeForNumBits(hint) < (hash->size >> 1)) in cso_data_rehash()
128 if (hash->numBits != hint) { in cso_data_rehash()
129 struct cso_node *e = (struct cso_node *)(hash); in cso_data_rehash()
[all …]
|
| /external/libdrm/amdgpu/ |
| D | util_hash.c | 96 static void *util_data_allocate_node(struct util_hash_data *hash) in util_data_allocate_node() argument
98 return malloc(hash->nodeSize); in util_data_allocate_node()
107 util_hash_create_node(struct util_hash *hash, in util_hash_create_node() argument
111 struct util_node *node = util_data_allocate_node(hash->data.d); in util_hash_create_node()
121 ++hash->data.d->size; in util_hash_create_node()
125 static void util_data_rehash(struct util_hash_data *hash, int hint) in util_data_rehash() argument
131 hash->userNumBits = (short)hint; in util_data_rehash()
132 while (primeForNumBits(hint) < (hash->size >> 1)) in util_data_rehash()
138 if (hash->numBits != hint) { in util_data_rehash()
139 struct util_node *e = (struct util_node *)(hash); in util_data_rehash()
[all …]
|
| /external/virglrenderer/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/deqp/framework/delibs/depool/ |
| D | dePoolHash.h | 23 * \brief Memory pool hash class.
45 * \brief Declare a template pool hash class interface.
46 * \param TYPENAME Type name of the declared hash.
50 * This macro declares the interface for a hash. For the implementation of
51 * the hash, see DE_IMPLEMENT_POOL_HASH. Usually this macro is put into the
56 * The functions for operating the hash are:
60 * Hash* Hash_create (deMemPool* pool);
61 * int Hash_getNumElements (const Hash* hash);
62 * Value* Hash_find (Hash* hash, Key key);
63 * deBool Hash_insert (Hash* hash, Key key, Value value);
[all …]
|
| /external/skia/src/opts/ |
| D | SkChecksum_opts.h | 30 // This is not a CRC32. It's Just A Hash that uses those instructions because they're fast.
35 uint64_t hash = seed; in hash_fn() local
38 // to hash 8 bytes per step. Both 3 and independent are important: in hash_fn()
40 uint64_t a = hash, in hash_fn()
41 b = hash, in hash_fn()
42 c = hash; in hash_fn()
51 hash = _mm_crc32_u32(a, _mm_crc32_u32(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()
[all …]
|
| /external/skqp/src/opts/ |
| D | SkChecksum_opts.h | 30 // This is not a CRC32. It's Just A Hash that uses those instructions because they're fast.
35 uint64_t hash = seed; in hash_fn() local
38 // to hash 8 bytes per step. Both 3 and independent are important: in hash_fn()
40 uint64_t a = hash, in hash_fn()
41 b = hash, in hash_fn()
42 c = hash; in hash_fn()
51 hash = _mm_crc32_u32(a, _mm_crc32_u32(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()
[all …]
|
| /external/freetype/src/base/ |
| D | fthash.c | 57 /* Mocklisp hash function. */ in hash_str_lookup()
72 /* Mocklisp hash function. */ in hash_num_lookup()
107 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()
[all …]
|
| /external/adhd/cras/src/common/ |
| D | sfh.c | 43 uint32_t SuperFastHash (const char * data, int len, uint32_t hash) { in SuperFastHash() argument
54 hash += get16bits (data); in SuperFastHash()
55 tmp = (get16bits (data+2) << 11) ^ hash; in SuperFastHash()
56 hash = (hash << 16) ^ tmp; in SuperFastHash()
58 hash += hash >> 11; in SuperFastHash()
63 case 3: hash += get16bits (data); in SuperFastHash()
64 hash ^= hash << 16; in SuperFastHash()
65 hash ^= ((signed char)data[sizeof (uint16_t)]) << 18; in SuperFastHash()
66 hash += hash >> 11; in SuperFastHash()
68 case 2: hash += get16bits (data); in SuperFastHash()
[all …]
|
| /external/boringssl/src/third_party/wycheproof_testvectors/ |
| D | rsa_pss_2048_sha1_mgf1_20_test.txt | 21 # The key for this test vector uses a weak hash function.
27 # The key for this test vector uses a weak hash function.
33 # The key for this test vector uses a weak hash function.
39 # The key for this test vector uses a weak hash function.
45 # The key for this test vector uses a weak hash function.
51 # The key for this test vector uses a weak hash function.
57 # The key for this test vector uses a weak hash function.
64 # The key for this test vector uses a weak hash function.
71 # The key for this test vector uses a weak hash function.
78 # The key for this test vector uses a weak hash function.
[all …]
|
| /external/libcxx/test/support/ |
| D | poisoned_hash_helper.hpp | 25 // Test that the specified Hash meets the requirements of an enabled hash
26 template <class Hash, class Key, class InputKey = Key>
31 return test_hash_enabled<std::hash<T>, T, InputKey>(key);
34 // Test that the specified Hash meets the requirements of a disabled hash.
35 template <class Hash, class Key>
40 return test_hash_disabled<std::hash<T>, T>(); in test_hash_disabled_for_type()
49 // Each header that declares the template hash provides enabled
50 // specializations of hash for nullptr t and all cv-unqualified
92 // Test that each of the library hash specializations for arithmetic types,
131 template <class Hash, class Key, class InputKey>
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | uhash.cpp | 22 /* This hashtable is implemented as a double hash. All elements are
24 * resolution (no linked list, etc.). When there is a hash collision
26 * using a secondary hash. The secondary hash is an increment
27 * computed as a hash function (a different one) of the primary
28 * hashcode. This increment is added to the initial hash value to
29 * obtain further slots assigned to the same hash code. For this to
122 #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) { \
[all …]
|
| /external/icu/icu4c/source/test/cintltst/ |
| D | chashtst.c | 32 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/epid-sdk/ext/ipp/sources/ippcp/ |
| D | pcphashmessage.c | 45 // Security Hash Standard
62 // Purpose: Hash of the whole message.
68 // ippStsNotSupportedModeErr if hashAlg is not match to supported hash alg
75 // hashAlg hash alg ID
82 /* test hash alg */
100 int ivSize = pAttr->ivSize; /* size of hash's IV */
101 int hashSize = pAttr->hashSize; /* hash size */
115 /* init hash */
116 cpHash hash; variable
118 CopyBlock(iv, hash, ivSize);
[all …]
|
| D | pcphash_digest.c | 45 // Security Hash Standard
61 /* hash alg and parameters */ in cpComputeDigest()
68 int ivSize = pAttr->ivSize; /* size of hash's IV */ in cpComputeDigest()
77 /* copy current hash value */ in cpComputeDigest()
78 cpHash hash; in cpComputeDigest() local
79 CopyBlock(HASH_VALUE(pCtx), hash, ivSize); in cpComputeDigest()
121 /* copmplete hash computation */ in cpComputeDigest()
122 hashFunc(hash, buffer, bufferLen, pParam); in cpComputeDigest()
127 hash[0] = ENDIANNESS64(hash[0]); in cpComputeDigest()
128 hash[1] = ENDIANNESS64(hash[1]); in cpComputeDigest()
[all …]
|
| /external/guava/guava/src/com/google/common/hash/ |
| D | HashFunction.java | 15 package com.google.common.hash;
23 * A hash function is a collision-averse pure function that maps an arbitrary block of
24 * data to a number called a <i>hash code</i>.
31 * <li><b>block of data:</b> the input for a hash function is always, in concept, an
36 * <li><b>hash code:</b> each hash function always yields hash codes of the same fixed bit
39 * {@code long} value is clearly insufficient to hold all hash code values, this API
40 * represents a hash code as an instance of {@link HashCode}.
46 * <li><b>collision-averse:</b> while it can't be helped that a hash function will
47 * sometimes produce the same hash code for distinct inputs (a "collision"), every
48 * hash function strives to <i>some</i> degree to make this unlikely. (Without this
[all …]
|
| /external/deqp/framework/delibs/debase/ |
| D | deSha1.c | 21 * \brief SHA1 hash functions.
50 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()
[all …]
|
| /external/lzma/C/ |
| D | LzFind.c | 144 p->hash = NULL; in MatchFinder_Construct()
160 ISzAlloc_Free(alloc, p->hash); in MatchFinder_FreeThisClassMemory()
161 p->hash = NULL; in MatchFinder_FreeThisClassMemory()
252 if (p->hash && p->numRefs == newSize) in MatchFinder_Create()
257 p->hash = AllocRefs(newSize, alloc); in MatchFinder_Create()
259 if (p->hash) in MatchFinder_Create()
261 p->son = p->hash + p->hashSizeSum; in MatchFinder_Create()
304 CLzRef *items = p->hash; in MatchFinder_Init_LowHash()
314 CLzRef *items = p->hash + p->fixedHashSize; in MatchFinder_Init_HighHash()
367 MatchFinder_Normalize3(subValue, p->hash, p->numRefs); in MatchFinder_Normalize()
[all …]
|