Searched refs:hash (Results 1 - 25 of 1550) sorted by relevance

1234567891011>>

/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
H A DObjectExtensions.cs55 int hash = 23;
56 hash = ( ( hash << 5 ) * 37 ) ^ a;
57 hash = ( ( hash << 5 ) * 37 ) ^ b;
58 return hash;
63 int hash = 23;
64 hash = ( ( hash << 5 ) * 37 ) ^ a;
65 hash
[all...]
/external/elfutils/libelf/
H A Ddl-hash.h1 /* Compute hash value for given string according to ELF standard.
31 unsigned long int hash = *name; local
32 if (hash != 0 && name[1] != '\0')
34 hash = (hash << 4) + name[1];
37 hash = (hash << 4) + name[2];
40 hash = (hash << 4) + name[3];
43 hash
[all...]
/external/kmod/shared/
H A Dhash.h5 struct hash;
8 const struct hash *hash; member in struct:hash_iter
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, cons
[all...]
H A Dhash.c25 #include <shared/hash.h>
39 struct hash { struct
47 struct hash *hash_new(unsigned int n_buckets,
50 struct hash *hash; local
53 hash = calloc(1, sizeof(struct hash) +
55 if (hash == NULL)
57 hash->n_buckets = n_buckets;
58 hash
67 hash_free(struct hash *hash) argument
95 unsigned int tmp, hash = len, rem = len & 3; local
146 hash_add(struct hash *hash, const char *key, const void *value) argument
189 hash_add_unique(struct hash *hash, const char *key, const void *value) argument
234 hash_find(const struct hash *hash, const char *key) argument
252 hash_del(struct hash *hash, const char *key) argument
295 hash_get_count(const struct hash *hash) argument
300 hash_iter_init(const struct hash *hash, struct hash_iter *iter) argument
[all...]
/external/libcxx/test/libcxx/extensions/hash/
H A Dspecializations.pass.cpp19 assert(__gnu_cxx::hash<const char *>()("test") ==
20 std::hash<std::string>()("test"));
21 assert(__gnu_cxx::hash<char *>()(str) == std::hash<std::string>()("test"));
22 assert(__gnu_cxx::hash<char>()(42) == 42);
23 assert(__gnu_cxx::hash<signed char>()(42) == 42);
24 assert(__gnu_cxx::hash<unsigned char>()(42) == 42);
25 assert(__gnu_cxx::hash<short>()(42) == 42);
26 assert(__gnu_cxx::hash<unsigned short>()(42) == 42);
27 assert(__gnu_cxx::hash<in
[all...]
/external/skia/include/private/
H A DSkChecksum.h24 * uint32_t -> uint32_t hash, useful for when you're about to trucate this hash but you
29 static uint32_t Mix(uint32_t hash) { argument
30 hash ^= hash >> 16;
31 hash *= 0x85ebca6b;
32 hash ^= hash >> 13;
33 hash *= 0xc2b2ae35;
34 hash
44 CheapMix(uint32_t hash) argument
[all...]
/external/clang/test/CodeGen/
H A Dubsan-blacklist.c2 // RUN: echo "fun:hash" > %t-func.blacklist
13 // DEFAULT: @hash
14 // FUNC: @hash
15 // FILE: @hash
16 unsigned hash() { function
/external/clang/test/PCH/Inputs/
H A Dpr27445.h3 void hash() {} function in struct:Info
/external/deqp/framework/delibs/decpp/
H A DdeSha1.cpp21 * \brief SHA1 hash functions
31 deSha1 hash; local
34 DE_CHECK_RUNTIME_ERR_MSG(deSha1_parse(&hash, str.c_str()), "Failed to parse SHA1. Invalid characters..");
36 return Sha1(hash);
41 deSha1 hash; local
43 deSha1_compute(&hash, size, data);
44 return Sha1(hash);
59 deSha1 hash; local
60 deSha1Stream_finalize(&m_stream, &hash);
62 return Sha1(hash);
[all...]
/external/skia/tests/
H A DDynamicHashTest.cpp45 Hash hash; local
46 ASSERT(hash.capacity() == 0);
48 hash.add(&a);
49 ASSERT(hash.capacity() == 4);
51 hash.add(&b);
52 ASSERT(hash.capacity() == 4);
54 hash.add(&c);
55 ASSERT(hash.capacity() == 4);
57 hash.add(&d);
58 ASSERT(hash
67 Hash hash; local
79 Hash hash; local
114 Hash hash; local
140 Hash hash; local
193 Hash hash; local
[all...]
/external/icu/icu4c/source/test/cintltst/
H A Dchashtst.c32 static void _put(UHashtable* hash,
37 static void _get(UHashtable* hash,
41 static void _remove(UHashtable* hash,
106 UHashtable *hash; local
108 hash = uhash_open(hashChars, isEqualChars, NULL, &status);
111 u_errorName(status), hash);
114 if (hash == NULL) {
118 log_verbose("Ok: uhash_open returned 0x%08X\n", hash);
120 _put(hash, one, 1, 0);
121 _put(hash, omeg
156 UHashtable *hash; local
290 UHashtable *hash; local
338 _put(UHashtable* hash, const char* key, int32_t value, int32_t expectedOldValue) argument
357 _get(UHashtable* hash, const char* key, int32_t expectedValue) argument
374 _remove(UHashtable* hash, const char* key, int32_t expectedValue) argument
[all...]
/external/libdrm/amdgpu/
H A Dutil_hash.c100 static void *util_data_allocate_node(struct util_hash_data *hash) argument
102 return malloc(hash->nodeSize);
111 util_hash_create_node(struct util_hash *hash, argument
115 struct util_node *node = util_data_allocate_node(hash->data.d);
125 ++hash->data.d->size;
129 static void util_data_rehash(struct util_hash_data *hash, int hint) argument
135 hash->userNumBits = (short)hint;
136 while (primeForNumBits(hint) < (hash->size >> 1))
142 if (hash->numBits != hint) {
143 struct util_node *e = (struct util_node *)(hash);
178 util_data_might_grow(struct util_hash_data *hash) argument
184 util_data_has_shrunk(struct util_hash_data *hash) argument
193 util_data_first_node(struct util_hash_data *hash) argument
206 util_hash_find_node(struct util_hash *hash, unsigned akey) argument
222 util_hash_insert(struct util_hash *hash, unsigned key, void *data) argument
243 struct util_hash *hash = malloc(sizeof(struct util_hash)); local
264 util_hash_delete(struct util_hash *hash) argument
283 util_hash_find(struct util_hash *hash, unsigned key) argument
348 util_hash_take(struct util_hash *hash, unsigned akey) argument
363 util_hash_first_node(struct util_hash *hash) argument
370 util_hash_erase(struct util_hash *hash, struct util_hash_iter iter) argument
[all...]
/external/guava/guava/src/com/google/common/hash/
H A Dpackage-info.java24 package com.google.common.hash;
/external/mesa3d/src/gallium/auxiliary/cso_cache/
H A Dcso_hash.h32 * This file provides a hash implementation that is capable of dealing
34 * functions operating on the hash return an iterator. The iterator
59 struct cso_hash *hash; member in struct:cso_hash_iter
65 void cso_hash_delete(struct cso_hash *hash);
68 int cso_hash_size(struct cso_hash *hash);
72 * Adds a data with the given key to the hash. If entry with the given
73 * key is already in the hash, this current entry is instered before it
75 * Function returns iterator pointing to the inserted item in the hash.
77 struct cso_hash_iter cso_hash_insert(struct cso_hash *hash, unsigned key,
80 * Removes the item pointed to by the current iterator from the hash
[all...]
H A Dcso_hash.c97 static void *cso_data_allocate_node(struct cso_hash_data *hash) argument
99 return MALLOC(hash->nodeSize);
108 cso_hash_create_node(struct cso_hash *hash, argument
112 struct cso_node *node = cso_data_allocate_node(hash->data.d);
122 ++hash->data.d->size;
126 static void cso_data_rehash(struct cso_hash_data *hash, int hint) argument
132 hash->userNumBits = (short)hint;
133 while (primeForNumBits(hint) < (hash->size >> 1))
139 if (hash->numBits != hint) {
140 struct cso_node *e = (struct cso_node *)(hash);
175 cso_data_might_grow(struct cso_hash_data *hash) argument
181 cso_data_has_shrunk(struct cso_hash_data *hash) argument
190 cso_data_first_node(struct cso_hash_data *hash) argument
203 cso_hash_find_node(struct cso_hash *hash, unsigned akey) argument
218 cso_hash_insert(struct cso_hash *hash, unsigned key, void *data) argument
240 struct cso_hash *hash = MALLOC_STRUCT(cso_hash); local
261 cso_hash_delete(struct cso_hash *hash) argument
279 cso_hash_find(struct cso_hash *hash, unsigned key) argument
382 cso_hash_take(struct cso_hash *hash, unsigned akey) argument
405 cso_hash_first_node(struct cso_hash *hash) argument
411 cso_hash_size(struct cso_hash *hash) argument
416 cso_hash_erase(struct cso_hash *hash, struct cso_hash_iter iter) argument
435 cso_hash_contains(struct cso_hash *hash, unsigned key) argument
[all...]
/external/libcxx/test/std/experimental/optional/optional.hash/
H A Dhash.pass.cpp13 // template <class T> struct hash<optional<T>>;
28 assert(std::hash<optional<T>>{}(opt) == 0);
30 assert(std::hash<optional<T>>{}(opt) == std::hash<T>{}(*opt));
35 assert(std::hash<optional<T>>{}(opt) == 0);
37 assert(std::hash<optional<T>>{}(opt) == std::hash<T>{}(*opt));
42 assert(std::hash<optional<T>>{}(opt) == 0);
44 assert(std::hash<optional<T>>{}(opt) == std::hash<
[all...]
/external/deqp/framework/delibs/debase/
H A DdeSha1.h23 * \brief SHA1 hash functions.
33 deUint32 hash[5]; member in struct:deSha1Stream_s
40 deUint32 hash[5]; member in struct:deSha1_s
49 /* Finalize the stream and output the hash. */
50 void deSha1Stream_finalize (deSha1Stream* stream, deSha1* hash);
52 /* Compute the sha1 hash from data. */
53 void deSha1_compute (deSha1* hash, size_t size, const void* data);
55 /* Render sha1 hash as 40 digit hex string. */
56 void deSha1_render (const deSha1* hash, char* buffer);
59 deBool deSha1_parse (deSha1* hash, cons
[all...]
/external/libxml2/python/tests/
H A DcompareNodes.py9 # Testing XML Node comparison and Node hash-value
30 # Next check that the hash function for the objects also works ok
31 if not (hash(foonode1) == hash(foonode2)):
32 print("Error hash values for two equal nodes are different")
34 if not (hash(foonode1) != hash(root)):
35 print("Error hash values for two unequal nodes are not different")
37 if hash(foonode1) == hash(roo
[all...]
/external/swiftshader/src/Common/
H A DMath.cpp21 inline uint64_t FNV_1a(uint64_t hash, unsigned char data) argument
23 return (hash ^ data) * 1099511628211;
28 int64_t hash = 0xCBF29CE484222325; local
32 hash = FNV_1a(hash, data[i]);
35 return hash;
/external/libchrome/crypto/third_party/nss/
H A Drsawrapr.c26 const SECHashObject *hash; local
30 hash = HASH_GetHashObject(hashAlg);
31 if (hash == NULL)
34 hashContext = (*hash->create)();
35 rounds = (maskLen + hash->length - 1) / hash->length;
44 (*hash->begin)(hashContext);
45 (*hash->update)(hashContext, mgfSeed, mgfSeedLen);
46 (*hash->update)(hashContext, C, sizeof C);
48 tempHash = mask + counter * hash
78 const SECHashObject *hash; local
[all...]
/external/caliper/caliper/src/main/java/com/google/caliper/model/
H A DPersistentHashing.java19 import com.google.common.hash.HashFunction;
20 import com.google.common.hash.Hashing;
23 * A utility class for standardizing the hash function that we're using for persistence.
/external/skia/src/opts/
H A DSkChecksum_opts.h35 uint64_t hash = seed; local
38 // to hash 8 bytes per step. Both 3 and independent are important:
40 uint64_t a = hash,
41 b = hash,
42 c = hash;
51 hash = a^b^c;
56 hash = _mm_crc32_u64(hash, unaligned_load<uint64_t>(data));
63 hash = _mm_crc32_u64(hash, unaligned_loa
[all...]
/external/v8/src/base/
H A Dhashmap-entry.h13 // HashMap entries are (key, value, hash) triplets, with a boolean indicating if
20 uint32_t hash; // The full hash value for key member in struct:v8::base::TemplateHashMapEntry
22 TemplateHashMapEntry(Key key, Value value, uint32_t hash) argument
23 : key(key), value(value), hash(hash), exists_(true) {}
38 uint32_t hash; // The full hash value for key member in struct:v8::base::TemplateHashMapEntry
40 TemplateHashMapEntry(Key* key, Value value, uint32_t hash) argument
41 : key(key), value(value), hash(has
[all...]
/external/doclava/res/assets/templates/assets/
H A Djquery-history.js15 return msie.getDoc().location.hash;
17 setHash: function(hash) {
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) {
[all...]
/external/freetype/src/base/
H A Dfthash.c57 /* Mocklisp hash function. */
72 /* Mocklisp hash function. */
107 FT_Hash hash )
110 FT_Hashnode* bp = hash->table;
114 res = (hash->lookup)( &key );
116 ndp = bp + ( res % hash->size );
119 if ( (hash->compare)( &(*ndp)->key, &key ) )
124 ndp = bp + ( hash->size - 1 );
132 hash_rehash( FT_Hash hash, argument
135 FT_Hashnode* obp = hash
166 hash_init( FT_Hash hash, FT_Bool is_num, FT_Memory memory ) argument
196 ft_hash_str_init( FT_Hash hash, FT_Memory memory ) argument
204 ft_hash_num_init( FT_Hash hash, FT_Memory memory ) argument
212 ft_hash_str_free( FT_Hash hash, FT_Memory memory ) argument
234 hash_insert( FT_Hashkey key, size_t data, FT_Hash hash, FT_Memory memory ) argument
272 ft_hash_str_insert( const char* key, size_t data, FT_Hash hash, FT_Memory memory ) argument
287 ft_hash_num_insert( FT_Int num, size_t data, FT_Hash hash, FT_Memory memory ) argument
[all...]

Completed in 611 milliseconds

1234567891011>>