| /external/mesa3d/src/mesa/program/ |
| prog_cache.c | 39 GLuint hash; member in struct:cache_item
55 * Compute hash index from state key.
61 GLuint hash = 0, i; local
65 /* Make a slightly better attempt at a hash function:
69 hash += ikey[i];
70 hash += (hash << 10);
71 hash ^= (hash >> 6);
74 return hash;
182 const GLuint hash = hash_key(key, keysize); local
203 const GLuint hash = hash_key(key, keysize); local
231 const GLuint hash = hash_key(key, keysize); local
[all...] |
| /external/wpa_supplicant_8/src/crypto/ |
| sha1-tprf.c | 34 u8 hash[SHA1_MAC_LEN]; local
40 addr[0] = hash;
57 if (hmac_sha1_vector(key, key_len, 5, addr, len, hash))
60 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
63 os_memcpy(&buf[pos], hash, plen);
69 os_memset(hash, 0, SHA1_MAC_LEN);
|
| sha256-prf.c | 60 u8 hash[SHA256_MAC_LEN]; local
87 hash) < 0)
89 os_memcpy(&buf[pos], hash, plen);
105 os_memset(hash, 0, sizeof(hash));
|
| sha384-prf.c | 57 u8 hash[SHA384_MAC_LEN]; local
82 hmac_sha384_vector(key, key_len, 4, addr, len, hash);
83 os_memcpy(&buf[pos], hash, plen);
99 os_memset(hash, 0, sizeof(hash));
|
| /frameworks/base/core/java/android/view/ |
| DisplayAdjustments.java | 74 int hash = 17; local
75 hash = hash * 31 + Objects.hashCode(mCompatInfo);
76 hash = hash * 31 + Objects.hashCode(mConfiguration);
77 return hash;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| size_hash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<NotConstructible> >,
36 test_hash<std::hash<NotConstructible> >(8)
39 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
51 test_hash<std::hash<NotConstructible> >,
56 test_hash<std::hash<NotConstructible> >(8)
59 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| size_hash.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
31 test_hash<std::hash<NotConstructible> >,
36 test_hash<std::hash<NotConstructible> >(8)
39 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
51 test_hash<std::hash<NotConstructible> >,
56 test_hash<std::hash<NotConstructible> >(8)
59 assert(c.hash_function() == test_hash<std::hash<NotConstructible> >(8));
|
| /external/v8/src/js/ |
| collection.js | 35 function HashToEntry(table, hash, numBuckets) {
36 var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
42 function SetFindEntry(table, numBuckets, key, hash) {
43 var entry = HashToEntry(table, hash, numBuckets);
62 function MapFindEntry(table, numBuckets, key, hash) {
63 var entry = HashToEntry(table, hash, numBuckets);
83 var hash = key;
84 hash = hash ^ seed;
85 hash = ~hash + (hash << 15); // hash = (hash << 15) - hash - 1
[all...] |
| /external/fio/ |
| filelock.c | 3 * No hash indexing, just a list, so only works well for < 100 files or
15 #include "hash.h"
19 uint32_t hash; member in struct:fio_filelock
119 static struct fio_filelock *fio_hash_find(uint32_t hash)
126 if (ff->hash == hash)
133 static struct fio_filelock *fio_hash_get(uint32_t hash, int trylock)
137 ff = fio_hash_find(hash);
146 * If we dropped the main lock, re-lookup the hash in case
153 __ff = fio_hash_find(hash);
171 uint32_t hash; local
228 uint32_t hash; local
[all...] |
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/resources/ |
| sort.js | 16 * Sets the initial sorting derived from the hash.
20 * hash links
24 var hash = window.location.hash; variable
25 if (hash) {
26 var m = hash.match(/up-./);
34 var m = hash.match(/dn-./);
70 var hash;
77 hash = 'up-' + header.id;
83 hash = 'dn-' + header.id
[all...] |
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| cso_cache.c | 51 unsigned hash = 0, i; local
58 hash ^= ikey[i];
60 return hash;
85 struct cso_hash *hash; local
86 hash = sc->hashes[type];
87 return hash;
156 struct cso_hash *hash,
161 sc->sanitize_cb(hash, type, max_size, sc->sanitize_data);
165 static INLINE void sanitize_cb(struct cso_hash *hash, enum cso_cache_type type,
170 int hash_size = cso_hash_size(hash);
190 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
200 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
242 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
266 struct cso_hash *hash = _cso_hash_for_type(sc, type); local
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_cache.c | 51 uint32_t hash; member in struct:util_cache_entry
67 /** Hash function */
68 uint32_t (*hash)(const void *key); member in struct:util_cache
90 util_cache_create(uint32_t (*hash)(const void *key),
101 cache->hash = hash;
123 uint32_t hash,
127 uint32_t index = hash % cache->size;
142 if (current->hash == hash &
186 uint32_t hash = cache->hash(key); local
221 uint32_t hash = cache->hash(key); local
292 uint32_t hash; local
[all...] |
| u_surfaces.c | 42 if(!us->u.hash)
43 us->u.hash = cso_hash_create();
45 ps = cso_hash_iter_data(cso_hash_find(us->u.hash, (layer << 8) | level));
71 cso_hash_insert(us->u.hash, (layer << 8) | level, ps);
85 cso_hash_erase(us->u.hash, cso_hash_find(us->u.hash, (ps->u.tex.first_layer << 8) | ps->u.tex.level));
96 if(us->u.hash)
99 iter = cso_hash_first_node(us->u.hash);
105 cso_hash_delete(us->u.hash);
106 us->u.hash = NULL
[all...] |
| /external/skia/include/private/ |
| SkTHash.h | 21 // - static uint32_t Hash(K)
51 // Copy val into the hash table, returning a pointer to the copy now in the table.
62 uint32_t hash = Hash(key); local
63 int index = hash & (fCapacity-1);
69 if (!s.removed() && hash == s.hash && key == Traits::GetKey(s.val)) {
78 // Remove the value with this key from the hash table.
82 uint32_t hash = Hash(key) local
121 uint32_t hash = Hash(key); local
173 uint32_t hash = Traits::Hash(key); local
185 uint32_t hash; member in struct:SkTHashTable::Slot
[all...] |
| /frameworks/base/tools/aapt/ |
| ResourceIdCache.cpp | 34 static inline uint32_t hashround(uint32_t hash, int c) {
35 return ((hash << 5) + hash) + c; /* hash * 33 + c */
38 static uint32_t hash(const android::String16& hashableString) { function
39 uint32_t hash = 5381; local
41 while (int c = *str++) hash = hashround(hash, c);
42 return hash;
63 const uint32_t hashcode = hash(hashedName)
[all...] |
| /external/icu/icu4c/source/test/perf/unisetperf/draft/ |
| bitset.cpp | 17 * Uses a simple hash table for compaction.
26 * Hash table for up to 1k 64-bit words, for 1 bit per BMP code point.
48 int32_t hash=(int32_t)(key>>55)&0x1ff; local
49 hash^=(int32_t)(key>>44)&0x7ff;
50 hash^=(int32_t)(key>>33)&0x7ff;
51 hash^=(int32_t)(key>>22)&0x7ff;
52 hash^=(int32_t)(key>>11)&0x7ff;
53 hash^=(int32_t)key&0x7ff;
55 if(values[hash]==0xffff) {
57 keys[hash]=key
[all...] |
| /art/compiler/utils/ |
| dedupe_set_test.cc | 33 size_t hash = 0; local
35 hash += c;
36 hash += hash << 10;
37 hash += hash >> 6;
39 return hash;
|
| /external/guava/guava-tests/benchmark/com/google/common/hash/ |
| MessageDigestAlgorithmBenchmark.java | 17 package com.google.common.hash;
22 import com.google.common.hash.HashFunction;
23 import com.google.common.hash.Hashing;
35 * <li>size: The length of the byte array to hash.
36 * <li>algorithm: the algorithm to hash with (e.g. MD5, SHA1, etc.).
37 * <li>hashMethod: how to hash the data (using the Hashing API or the MessageDigest API).
49 @Override public byte[] hash(Algorithm algorithm, byte[] input) { method
56 @Override public byte[] hash(Algorithm algorithm, byte[] input) { method
60 public abstract byte[] hash(Algorithm algorithm, byte[] input); method in class:MessageDigestAlgorithmBenchmark.HashMethod
102 result ^= hashMethod.hash(algorithm, testBytes)[0]
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| CollectionBenchmarkSampleData.java | 113 final int hash; field in class:CollectionBenchmarkSampleData.Element
114 Element(int hash) {
115 this.hash = hash;
119 || (obj instanceof Element && ((Element) obj).hash == hash);
122 return hash;
126 return Ints.compare(hash, that.hash);
129 return String.valueOf(hash);
[all...] |
| /external/guava/guava/src/com/google/common/base/ |
| PairwiseEquivalence.java | 52 int hash = 78721; local
54 hash = hash * 24943 + elementEquivalence.hash(element);
56 return hash;
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| Murmur3Hash32Test.java | 17 package com.google.common.hash;
19 import static com.google.common.hash.Hashing.murmur3_32;
21 import com.google.common.hash.HashTestUtils.HashFn;
61 @Override public byte[] hash(byte[] input, int seed) {
64 return hasher.hash().asBytes();
|
| /external/libphonenumber/libphonenumber/src/com/google/i18n/phonenumbers/ |
| Phonenumber.java | 248 int hash = 41; local
249 hash = (53 * hash) + getCountryCode();
250 hash = (53 * hash) + Long.valueOf(getNationalNumber()).hashCode();
251 hash = (53 * hash) + getExtension().hashCode();
252 hash = (53 * hash) + (isItalianLeadingZero() ? 1231 : 1237);
253 hash = (53 * hash) + getNumberOfLeadingZeros()
[all...] |
| /external/wpa_supplicant_8/src/eap_common/ |
| eap_peap_common.c | 21 u8 hash[SHA1_MAC_LEN]; local
27 addr[0] = hash;
72 if (hmac_sha1_vector(key, key_len, 5, addr, len, hash) < 0)
75 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
78 os_memcpy(&buf[pos], hash, plen);
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_state_cache.c | 35 * consumers can query the hash table of state using a cache_id,
40 * The inner workings are a simple hash table based on a CRC of the
57 GLuint hash = item->cache_id, i; local
64 hash ^= ikey[i];
65 hash = (hash << 5) | (hash >> 27);
68 return hash;
76 a->hash == b->hash &
141 GLuint hash; local
274 GLuint hash; local
[all...] |
| /system/core/crash_reporter/ |
| warn_collector.l | 114 uint32_t hash = 0;
116 hash = (hash << 5) + hash + *string++;
118 return hash;
123 * (unless warnings with the same hash also happens in tandem, which is even
126 static int HashSeen(uint32_t hash) {
127 int word_index = (hash & HASH_BITMAP_MASK) / 32;
128 int bit_index = (hash & HASH_BITMAP_MASK) % 32;
132 static void SetHashSeen(uint32_t hash) {
[all...] |
