| /external/clang/test/CodeGen/ |
| ubsan-blacklist.c | 2 // RUN: echo "fun:hash" > %t-func.blacklist
13 // DEFAULT: @hash
14 // FUNC: @hash
15 // FILE: @hash
16 unsigned hash() { function
|
| /external/e2fsprogs/lib/e2p/ |
| hashstr.c | 20 struct hash { struct
25 static struct hash hash_list[] = {
34 struct hash *p;
46 * Returns the hash algorithm, or -1 on error
50 struct hash *p;
|
| /external/libvpx/libvpx/third_party/libyuv/source/ |
| compare_common.cc | 28 // hash seed of 5381 recommended.
31 uint32 hash = seed; local
34 hash += (hash << 5) + src[i];
36 return hash;
|
| /external/libyuv/files/source/ |
| compare_common.cc | 30 // hash seed of 5381 recommended.
33 uint32 hash = seed; local
36 hash += (hash << 5) + src[i];
38 return hash;
|
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/ |
| HC4.java | 2 * Hash Chain match finder with 2-, 3-, and 4-byte hashing
14 private final Hash234 hash; field in class:HC4
38 hash = new Hash234(dictSize);
58 * and possibly normalizes the hash tables and the hash chain.
68 hash.normalize(normalizationOffset);
95 hash.calcHashes(buf, readPos);
96 int delta2 = lzPos - hash.getHash2Pos();
97 int delta3 = lzPos - hash.getHash3Pos();
98 int currentMatch = hash.getHash4Pos()
[all...] |
| /external/v8/tools/gyp/test/ninja/action-rule-hash/ |
| gyptest-action-rule-hash.py | 23 test.run_gyp('subdir/action-rule-hash.gyp')
24 test.build('subdir/action-rule-hash.gyp', test.ALL)
25 test.up_to_date('subdir/action-rule-hash.gyp')
29 test.run_gyp('action-rule-hash.gyp', '--depth=../', chdir='subdir')
30 test.up_to_date('subdir/action-rule-hash.gyp')
|
| /libcore/luni/src/main/java/libcore/icu/ |
| CollationKeyICU.java | 54 * Creates a hash code for this CollationKey.
55 * Compute the hash by iterating sparsely over about 32 (up to 63) bytes
57 * hash value by a prime number and add the new byte in, like a linear
61 * @return hash value of collation key. Hash value is never 0.
|
| /system/bt/osi/src/ |
| hash_functions.c | 36 hash_index_t hash = 5381; local
40 hash = ((hash << 5) + hash ) + name[i];
41 return hash;
|
| /system/core/metricsd/uploader/ |
| metrics_hashes.cc | 27 // Converts the 8-byte prefix of an MD5 hash into a uint64 value.
28 inline uint64_t HashToUInt64(const std::string& hash) {
30 DCHECK_GE(hash.size(), sizeof(value));
31 memcpy(&value, hash.data(), sizeof(value));
38 // Create an MD5 hash of the given |name|, represented as a byte buffer
|
| /external/deqp/framework/delibs/depool/ |
| dePoolHashArray.h | 23 * \brief Memory pool hash-array class.
37 * \brief Declare a template pool hash-array (array with hash) class interface.
38 * \param TYPENAME Type name of the declared hash-array.
46 * The functions for operating the hash are:
54 * Value* HashArray_find (Hash* hashArray, Key key);
55 * deBool HashArray_insert (Hash* hashArray, Key key, Value value);
56 * deBool HashArray_copyToArray (Hash* hashArray, KeyArray* keys, ValueArray* values);
62 DE_DECLARE_POOL_HASH(TYPENAME##Hash, KEYTYPE, int); \
66 TYPENAME##Hash* hash;
[all...] |
| dePoolHashSet.c | 21 * \brief Memory pool hash-set class.
57 /* Test find() on empty hash. */
61 const int* val = deTestHash_find(hash, (deInt16)i);
68 deTestHash_insert(hash, (deInt16)i, -i);
71 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 5000);
74 const int* val = deTestHash_find(hash, (deInt16)i);
80 deTestHash_delete(hash, (deInt16)i);
82 DE_TEST_ASSERT(deTestHash_getNumElements(hash) == 4000);
85 const int* val = deTestHash_find(hash, (deInt16)i);
94 deTestHash_insert(hash, (deInt16)i, -i)
[all...] |
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| codegen_unittest.cc | 23 // Hash provides an abstraction for building "hash trees" from BPF
27 // convenient API for its use. However, any collision-resistant hash
29 class Hash {
31 static const Hash kZero;
33 Hash() : digest_() {}
35 Hash(uint16_t code,
37 const Hash& jt = kZero,
38 const Hash& jf = kZero)
49 Hash(const Hash& hash) = default member in class:sandbox::__anon14499::Hash
139 Hash& hash = prog_hashes.at(i - 1); 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...] |
| /external/dbus/dbus/ |
| dbus-hash.c | 2 /* dbus-hash.c Generic hash table utility (internal to D-Bus implementation)
8 * Hash table implementation based on generic/tclHash.c from the Tcl
78 #include "dbus-hash.h"
83 * @defgroup DBusHashTable Hash table
91 * @defgroup DBusHashTableInternals Hash table implementation details
102 * the hash table to make it larger.
107 * Takes a preliminary integer hash value and produces an index into a
108 * hash tables bucket list. The idea is to make it so that
110 * different buckets. The hash function was taken from
[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...] |
| /external/wpa_supplicant_8/src/eap_common/ |
| eap_pwd_common.c | 26 void eap_pwd_h_update(struct crypto_hash *hash, const u8 *data, size_t len)
28 crypto_hash_update(hash, data, len);
32 void eap_pwd_h_final(struct crypto_hash *hash, u8 *digest)
35 crypto_hash_finish(hash, digest, &len);
43 struct crypto_hash *hash; local
54 hash = crypto_hash_init(CRYPTO_HASH_ALG_HMAC_SHA256,
56 if (hash == NULL)
59 crypto_hash_update(hash, digest, SHA256_MAC_LEN);
60 crypto_hash_update(hash, (u8 *) &i, sizeof(u16));
61 crypto_hash_update(hash, label, labellen)
95 struct crypto_hash *hash; local
312 struct crypto_hash *hash; local
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
| btHashedSimplePairCache.cpp | 72 int hash = static_cast<int>(getHash(static_cast<unsigned int>(indexA), static_cast<unsigned int>(indexB)) & (m_overlappingPairArray.capacity()-1)); local
74 if (hash >= m_hashTable.size())
79 int index = m_hashTable[hash];
129 int hashValue = static_cast<int>(getHash(static_cast<unsigned int>(indexA),static_cast<unsigned int>(indexB)) & (m_overlappingPairArray.capacity()-1)); // New hash value with new mask
141 int hash = static_cast<int>(getHash(static_cast<unsigned int>(indexA),static_cast<unsigned int>(indexB)) & (m_overlappingPairArray.capacity()-1)); // New hash value with new mask
144 btSimplePair* pair = internalFindPair(indexA, indexB, hash);
159 //hash with new capacity
160 hash = static_cast<int>(getHash(static_cast<unsigned int>(indexA),static_cast<unsigned int>(indexB)) & (m_overlappingPairArray.capacity()-1));
167 m_next[count] = m_hashTable[hash];
[all...] |
| /frameworks/base/libs/hwui/ |
| TextDropShadowCache.cpp | 32 hash_t ShadowText::hash() const { function in class:android::uirenderer::ShadowText
33 uint32_t hash = JenkinsHashMix(0, glyphCount); local
34 hash = JenkinsHashMix(hash, android::hash_type(radius));
35 hash = JenkinsHashMix(hash, android::hash_type(textSize));
36 hash = JenkinsHashMix(hash, android::hash_type(typeface));
37 hash = JenkinsHashMix(hash, flags)
[all...] |
| /external/caliper/caliper/src/main/java/com/google/caliper/model/ |
| Host.java | 26 import com.google.common.hash.Funnel;
27 import com.google.common.hash.HashFunction;
28 import com.google.common.hash.PrimitiveSink;
45 @ExcludeFromJson private int hash; field in class:Host
53 // eagerly initialize hash to allow for the test-only hash function
73 if (hash == 0) {
74 this.hash = hashFunction.hashObject(this, HostFunnel.INSTANCE).asInt();
84 return hash;
116 * This only exists for tests to induce hash collisions. Only use this in test code as changin
[all...] |
| PersistentHashing.java | 19 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/chromium-trace/catapult/third_party/gsutil/gslib/tests/ |
| test_hash.py | 15 """Unit tests for hash command."""
24 """Unit tests for hash command."""
34 stdout = self.RunCommand('hash', args=[tmp_file], return_stdout=True)
41 self.RunCommand('hash', args=['non-existent-file'])
49 self.RunCommand('hash', args=['gs://bucket/object'])
52 self.assertEquals('"hash" command requires a file URL', e.reason)
56 stdout = self.RunCommand('hash', args=['-h', tmp_file], return_stdout=True)
64 stdout = self.RunCommand('hash', args=[os.path.join(tmp_dir, '*')],
66 # One summary line and two hash lines per file.
72 stdout_crc = self.RunCommand('hash', args=['-c', tmp_file]
[all...] |
| /external/clang/test/CXX/temp/temp.spec/temp.explicit/ |
| p6.cpp | 17 template<typename T> struct hash { }; struct
24 hash<T> h;
32 template<> struct hash<S> { struct
|
| /external/e2fsprogs/lib/ext2fs/ |
| ext_attr.c | 32 * Compute the hash of an extended attribute.
36 __u32 hash = 0; local
41 hash = (hash << NAME_HASH_SHIFT) ^
42 (hash >> (8*sizeof(hash) - NAME_HASH_SHIFT)) ^
46 /* The hash needs to be calculated on the data in little-endian. */
51 hash = (hash << VALUE_HASH_SHIFT) ^
52 (hash >> (8*sizeof(hash) - VALUE_HASH_SHIFT))
[all...] |
| /external/e2fsprogs/tests/f_h_badnode/ |
| expect.1 | 3 Problem in HTREE directory inode 12929: block #531 has bad max hash
5 Problem in HTREE directory inode 12929: block #1061 has bad min hash
7 Problem in HTREE directory inode 12929: block #1062 has bad max hash
|
| /external/libchrome/base/trace_event/ |
| memory_allocator_dump_guid.cc | 16 uint64_t hash[(kSHA1Length + sizeof(uint64_t) - 1) / sizeof(uint64_t)] = {0}; local
18 reinterpret_cast<unsigned char*>(hash));
19 return hash[0];
|
