| /external/tpm2/ |
| PolicyAuthValue.c | 25 // Update policy hash
26 // policyDigestnew = hash(policyDigestold || TPM_CC_PolicyAuthValue)
27 // Start hash
36 // complete the hash and get the results
|
| /frameworks/base/core/java/android/content/res/ |
| ResourcesKey.java | 66 int hash = 17; local
67 hash = 31 * hash + Objects.hashCode(mResDir);
68 hash = 31 * hash + Arrays.hashCode(mSplitResDirs);
69 hash = 31 * hash + Arrays.hashCode(mOverlayDirs);
70 hash = 31 * hash + Arrays.hashCode(mLibDirs);
71 hash = 31 * hash + mDisplayId
[all...] |
| /system/tools/hidl/ |
| Hash.cpp | 17 #include "Hash.h"
31 const std::vector<uint8_t> Hash::kEmptyHash = std::vector<uint8_t>(SHA256_DIGEST_LENGTH, 0);
33 Hash& Hash::getMutableHash(const std::string& path) {
34 static std::map<std::string, Hash> hashes;
39 it = hashes.insert(it, {path, Hash(path)});
45 const Hash& Hash::getHash(const std::string& path) {
49 void Hash::clearHash(const std::string& path) {
67 Hash::Hash(const std::string &path
148 std::string hash = match.str(1); local
[all...] |
| /toolchain/binutils/binutils-2.27/gas/ |
| hash.h | 0 /* hash.h -- header file for gas hash table routines
26 /* Set the size of the hash table used. */
30 /* Create a hash table. This return a control block. */
35 /* Delete a hash table, freeing all allocated memory. */
39 /* Insert an entry into a hash table. This returns NULL on success.
42 hash table. */
47 /* Insert or replace an entry in a hash table. This returns NULL on
54 /* Replace an existing entry in a hash table. This returns the old
55 value stored for the entry. If the entry is not found in the hash
[all...] |
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-arm/ |
| ifunc-dynamic.ld | 6 .hash : { *(.hash) }
7 .gnu.hash : { *(.gnu.hash) }
|
| /toolchain/binutils/binutils-2.27/opcodes/ |
| cgen-dis.c | 53 /* Add an instruction to the hash chain. */
58 unsigned int hash)
69 for (current_buf = htable[hash]; current_buf != NULL;
82 htable[hash] = hentbuf;
87 /* Subroutine of build_dis_hash_table to add INSNS to the hash table.
92 HTABLE points to the hash table.
93 HENTBUF is a pointer to sufficiently large buffer of hash entries.
112 unsigned int hash; local
121 to hash on, so set both up. */
128 hash = (* cd->dis_hash) (buf, value)
150 unsigned int hash; local
232 unsigned int hash; local
[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/libchrome/base/ |
| hash.cc | 5 #include "base/hash.h"
12 std::hash<std::string> hash_fn;
|
| /external/libcxx/include/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /frameworks/minikin/include/minikin/ |
| LayoutCache.h | 63 android::hash_t hash() const { return mHash; } function in class:minikin::LayoutCacheKey
107 uint32_t hash = android::JenkinsHashMix(0, mId); local
108 hash = android::JenkinsHashMix(hash, mStart);
109 hash = android::JenkinsHashMix(hash, mCount);
110 hash = android::JenkinsHashMix(hash, android::hash_type(mStyle.identifier()));
111 hash = android::JenkinsHashMix(hash, android::hash_type(mSize))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/linux-x86/clang-4053586/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/c++/v1/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/include/experimental/ |
| unordered_set | 22 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
23 using unordered_set = std::unordered_set<T, Hash, Pred,
26 template <class T, class Hash = hash<T>, class Pred = equal_to<T>>
27 using unordered_multiset = std::unordered_multiset<T, Hash, Pred,
48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
|
