| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| StableHashing.h | 22 /// An opaque object representing a stable hash code. It can be serialized,
30 // Stable hashes are based on the 64-bit FNV-1 hash:
36 inline void stable_hash_append(stable_hash &Hash, const char Value) {
37 Hash = Hash ^ (Value & 0xFF);
38 Hash = Hash * FNV_PRIME_64;
41 inline void stable_hash_append(stable_hash &Hash, stable_hash Value) {
43 stable_hash_append(Hash, static_cast<char>(Value));
52 stable_hash Hash = hashing::detail::FNV_OFFSET_64
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/ |
| Hash.cpp | 1 //===- Hash.cpp - PDB Hash Functions --------------------------------------===//
9 #include "llvm/DebugInfo/PDB/Native/Hash.h"
19 // Used for name hash table and TPI/IPI hashes.
33 // Maximum of 3 bytes left. Hash a 2 byte word if possible, then hash the
42 // hash possible odd byte
55 // Used for name hash table.
57 uint32_t Hash = 0xb170a1bf;
65 Hash += Item
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/ubsan/ |
| ubsan_handlers_cxx.h | 33 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
36 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
|
| ubsan_type_hash_itanium.cc | 79 // (vptr,type) pair, a hash is computed. This hash is assumed to be globally
84 // * the vptr, and thus the hash, can be affected by ASLR, so multiple runs
87 // The first caching layer is a small hash table with no chaining; buckets are
88 // reused as needed. The second caching layer is a large hash table with open
91 // FIXME: Make these hash table accesses thread-safe. The races here are benign:
96 /// Find a bucket to store the given hash value in.
211 bool __ubsan::checkDynamicType(void *Object, void *Type, HashValue Hash) {
216 HashValue *Bucket = getTypeCacheHashTableBucket(Hash);
217 if (*Bucket == Hash) {
[all...] |
| ubsan_handlers_cxx.cc | 35 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash,
37 if (checkDynamicType((void*)Pointer, Data->TypeInfo, Hash))
86 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash) {
88 HandleDynamicTypeCacheMiss(Data, Pointer, Hash, Opts);
91 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash) {
94 if (HandleDynamicTypeCacheMiss(Data, Pointer, Hash, Opts))
|
| ubsan_type_hash.h | 52 bool checkDynamicType(void *Object, void *Type, HashValue Hash);
61 /// return \c true (modulo hash collisions) if
63 /// __ubsan_vptr_type_cache[Hash % VptrTypeCacheSize] == Hash
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| CachedHashString.h | 10 // and not-owning string types that store their hash in addition to their string
27 /// A container which contains a StringRef plus a precomputed hash.
31 uint32_t Hash;
38 CachedHashStringRef(StringRef S, uint32_t Hash)
39 : P(S.data()), Size(S.size()), Hash(Hash) {
46 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashStringRef
57 assert(!isEqual(S, getEmptyKey()) && "Cannot hash the empty key!");
58 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!")
137 uint32_t hash() const { return Hash; } function in class:llvm::CachedHashString
[all...] |
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| unordered_map.h | 28 typename Hash = ankerl::unordered_dense::hash<Key>,
32 <Key, T, Hash, KeyEqual, std::allocator<std::pair<Key, T>>,
|
| unordered_set.h | 27 typename Hash = ankerl::unordered_dense::hash<Key>,
31 <Key, Hash, KeyEqual, std::allocator<Key>,
|
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| unordered_map.h | 28 typename Hash = ankerl::unordered_dense::hash<Key>,
32 <Key, T, Hash, KeyEqual, std::allocator<std::pair<Key, T>>,
|
| unordered_set.h | 27 typename Hash = ankerl::unordered_dense::hash<Key>,
31 <Key, Hash, KeyEqual, std::allocator<Key>,
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ObjectYAML/ |
| CodeViewYAMLTypeHashing.h | 33 explicit GlobalHash(StringRef S) : Hash(S) {
34 assert(S.size() == 8 && "Invalid hash size!");
36 explicit GlobalHash(ArrayRef<uint8_t> S) : Hash(S) {
37 assert(S.size() == 8 && "Invalid hash size!");
39 yaml::BinaryRef Hash;
|
| /src/external/apache2/llvm/dist/llvm/lib/ObjectYAML/ |
| CodeViewYAMLTypeHashing.cpp | 37 ScalarTraits<BinaryRef>::output(GH.Hash, Ctx, OS);
42 return ScalarTraits<BinaryRef>::input(Scalar, Ctx, GH.Hash);
77 SmallString<8> Hash;
79 Hash.clear();
80 raw_svector_ostream OS(Hash);
81 H.Hash.writeAsBinary(OS);
82 assert((Hash.size() == 8) && "Invalid hash size!");
83 cantFail(Writer.writeFixedString(Hash));
|
| /src/external/gpl3/gcc/dist/libsanitizer/ubsan/ |
| ubsan_handlers_cxx.h | 32 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
35 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/ubsan/ |
| ubsan_handlers_cxx.h | 32 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
35 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash);
|
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerSHA1.h | 24 // Computes SHA1 hash of 'Len' bytes in 'Data', writes kSHA1NumBytes to 'Out'.
29 std::string Hash(const Unit &U);
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| StructuralHash.cpp | 1 //===-- StructuralHash.cpp - IR Hash for expensive checks -------*- C++ -*-===//
26 uint64_t Hash = 0x6acaa36bef8325c5ULL;
28 void update(uint64_t V) { Hash = hashing::detail::hash_16_bytes(Hash, V); }
65 uint64_t getHash() const { return Hash; }
|
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| ODRHash.cpp | 10 /// This file implements the ODRHash class, which calculates a hash based
242 ODRHash &Hash;
245 ODRDeclVisitor(llvm::FoldingSetNodeID &ID, ODRHash &Hash)
246 : ID(ID), Hash(Hash) {}
249 Hash.AddBoolean(S);
251 Hash.AddStmt(S);
256 Hash.AddBoolean(II);
258 Hash.AddIdentifierInfo(II);
263 Hash.AddQualType(T)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/CodeView/ |
| TypeHashing.h | 26 /// A locally hashed type represents a straightforward hash code of a serialized
33 hash_code Hash;
36 /// Given a type, compute its local hash.
61 SHA1 = 0, // standard 20-byte SHA1 hash
62 SHA1_8 // last 8-bytes of standard SHA1 hash
65 /// A globally hashed type represents a hash value that is sufficient to
68 /// TypeIndex that refers to B with a previously-computed global hash for B. As
69 /// this is a recursive algorithm (e.g. the global hash of B also depends on the
70 /// global hashes of the types that B refers to), a global hash can uniquely
72 /// different graph structure. Although the hash itself is slower to compute
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/rsa/ |
| rsa_pss.c | 32 const EVP_MD *Hash, const unsigned char *EM,
35 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen);
39 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
42 return ossl_rsa_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, mgf1Hash, EM, &sLen);
46 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
62 mgf1Hash = Hash;
64 hLen = EVP_MD_get_size(Hash);
133 if (!EVP_DigestInit_ex(ctx, Hash, NULL)
160 const EVP_MD *Hash, int sLen)
162 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen)
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/rsa/ |
| rsa_pss.c | 26 const EVP_MD *Hash, const unsigned char *EM,
29 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen);
33 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
48 mgf1Hash = Hash;
50 hLen = EVP_MD_size(Hash);
113 if (!EVP_DigestInit_ex(ctx, Hash, NULL)
140 const EVP_MD *Hash, int sLen)
142 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen);
147 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
157 mgf1Hash = Hash;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| ByteStreamer.h | 61 DIEHash &Hash;
63 HashingByteStreamer(DIEHash &H) : Hash(H) {}
65 Hash.update(Byte);
68 Hash.addSLEB128(DWord);
72 Hash.addULEB128(DWord);
|
| /src/crypto/external/bsd/openssl/dist/crypto/rsa/ |
| rsa_pss.c | 32 const EVP_MD *Hash, const unsigned char *EM,
35 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen);
39 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
54 mgf1Hash = Hash;
56 hLen = EVP_MD_get_size(Hash);
121 if (!EVP_DigestInit_ex(ctx, Hash, NULL)
148 const EVP_MD *Hash, int sLen)
150 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen);
155 const EVP_MD *Hash, const EVP_MD *mgf1Hash,
165 mgf1Hash = Hash;
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| MD5.h | 84 /// Updates the hash for the byte stream provided.
87 /// Updates the hash for the StringRef provided.
90 /// Finishes off the hash and puts the result in result.
97 /// Computes the hash for a given bytes.
98 static std::array<uint8_t, 16> hash(ArrayRef<uint8_t> Data);
108 /// Helper to compute and return lower 64 bits of the given string's MD5 hash.
112 MD5 Hash;
113 Hash.update(Str);
115 Hash.final(Result);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| NameAnonGlobals.cpp | 24 // Compute a "unique" hash for the module based on the name of the public
33 /// Return the lazily computed hash.
54 MD5::MD5Result Hash;
55 Hasher.final(Hash);
57 MD5::stringifyResult(Hash, Result);
|
