| /external/clang/test/PCH/Inputs/ |
| pr27445.h | 3 void hash() {} function in struct:Info
|
| /art/libdexfile/dex/ |
| utf.h | 81 uint32_t hash = 0; local
83 hash = hash * 31 + *chars++;
85 return static_cast<int32_t>(hash);
90 // Compute a hash code of a modified UTF-8 string. Not the standard java hash since it returns a
|
| /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/guava/guava/src/com/google/common/hash/ |
| package-info.java | 17 * Hash functions and related structures.
24 package com.google.common.hash;
|
| Funnel.java | 15 package com.google.common.hash;
|
| /external/kmod/shared/ |
| hash.h | 5 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, const char *key, const void *value)
[all...] |
| /external/libdrm/amdgpu/ |
| util_hash.h | 30 * Hash implementation.
32 * This file provides a hash implementation that is capable of dealing
34 * functions operating on the hash return an iterator. The iterator
59 struct util_hash *hash; member in struct:util_hash_iter
65 drm_private void util_hash_delete(struct util_hash *hash);
69 * Adds a data with the given key to the hash. If entry with the given
70 * key is already in the hash, this current entry is instered before it
72 * Function returns iterator pointing to the inserted item in the hash.
75 util_hash_insert(struct util_hash *hash, unsigned key, void *data);
78 * Removes the item pointed to by the current iterator from the hash
[all...] |
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| cso_hash.h | 30 * Hash table implementation.
32 * 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
[all...] |
| /prebuilts/go/darwin-x86/src/hash/ |
| hash.go | 5 // Package hash provides interfaces for hash functions.
6 package hash package
10 // Hash is the common interface implemented by all hash functions.
12 // Hash implementations in the standard library (e.g. hash/crc32 and
14 // encoding.BinaryUnmarshaler interfaces. Marshaling a hash implementation
16 // later, without having to re-write the data previously written to the hash.
17 // The hash state may contain portions of the input in its original form
[all...] |
| /prebuilts/go/linux-x86/src/hash/ |
| hash.go | 5 // Package hash provides interfaces for hash functions.
6 package hash package
10 // Hash is the common interface implemented by all hash functions.
12 // Hash implementations in the standard library (e.g. hash/crc32 and
14 // encoding.BinaryUnmarshaler interfaces. Marshaling a hash implementation
16 // later, without having to re-write the data previously written to the hash.
17 // The hash state may contain portions of the input in its original form
[all...] |
| /external/elfutils/libelf/ |
| dl-hash.h | 1 /* 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 = (hash << 4) + name[4]
[all...] |
| /external/libchrome/base/containers/ |
| hash_tables.h | 13 #include "base/hash.h"
23 // A separate hasher which, by default, forwards to std::hash. This is so legacy
25 // std::hash mid-transition.
27 struct hash { struct in namespace:BASE_HASH_NAMESPACE
28 std::size_t operator()(const T& value) const { return std::hash<T>()(value); }
31 // Use base::IntPairHash from base/hash.h as a custom hasher instead.
33 struct hash<std::pair<Type1, Type2>> { struct in namespace:BASE_HASH_NAMESPACE
46 class Hash = BASE_HASH_NAMESPACE::hash<Key>,
49 using hash_map = std::unordered_map<Key, T, Hash, Pred, Alloc>
[all...] |
| /external/libmojo/mojo/public/cpp/bindings/ |
| native_enum.h | 23 struct hash<mojo::NativeEnum> struct in namespace:std
|
| /external/skia/src/core/ |
| SkOpts.h | 52 // The fastest high quality 32-bit hash we can provide on this platform.
54 static inline uint32_t hash(const void* data, size_t bytes, uint32_t seed=0) { function in namespace:SkOpts
|
| /external/skqp/src/core/ |
| SkOpts.h | 52 // The fastest high quality 32-bit hash we can provide on this platform.
54 static inline uint32_t hash(const void* data, size_t bytes, uint32_t seed=0) { function in namespace:SkOpts
|
| /external/swiftshader/src/Common/ |
| Math.cpp | 19 inline uint64_t FNV_1a(uint64_t hash, unsigned char data)
21 return (hash ^ data) * 1099511628211;
26 int64_t hash = 0xCBF29CE484222325; local
30 hash = FNV_1a(hash, data[i]);
33 return hash;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/gp_hash_table_map_/ |
| erase_no_store_hash_fn_imps.hpp | 39 * when the hash value is not stored.
48 size_type hash = ranged_probe_fn_base::operator()(r_key); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/gp_hash_table_map_/ |
| erase_no_store_hash_fn_imps.hpp | 39 * when the hash value is not stored.
48 size_type hash = ranged_probe_fn_base::operator()(r_key); local
54 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
|
| /cts/tests/tests/jni/libjnitest/ |
| android_jni_cts_JniStaticTest.cpp | 34 jint hash = env->CallIntMethod(coreClass, midHashCode); local
36 return hash;
|
| /external/annotation-tools/scene-lib/src/annotations/util/ |
| Hasher.java | 8 * A simple class to mash a lot of data into a hash code for use in
15 * The calculated hash code for the data that has been contributed so far.
17 public int hash = 0; field in class:Hasher
22 * Contributes the data <code>x</code> to the calculation of the hash code.
25 hash = ((hash << SHIFT) | (hash >> (32 - SHIFT))) ^ x;
|
| /external/deqp/framework/delibs/decpp/ |
| deSha1.cpp | 21 * \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/guava/guava-tests/test/com/google/common/hash/ |
| PackageSanityTests.java | 17 package com.google.common.hash;
19 import com.google.common.hash.BloomFilterStrategies.BitArray;
|
| /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/libchrome/base/metrics/ |
| metrics_hashes_unittest.cc | 29 uint64_t hash = HashMetricName(cases[i].input); local
30 std::string hash_hex = base::StringPrintf("0x%016" PRIx64, 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];
|
