| /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/CodeGen/AsmPrinter/ |
| DIEHash.h | 24 /// An object containing the capability of hashing and adding hash
45 /// Adds the parent context of \param Parent to the hash.
48 /// Adds the attributes of \param Die to the hash.
51 /// Computes the full DWARF4 7.27 hash of the DIE.
54 // Routines that add DIEValues to the hash.
56 /// Adds \param Value to the hash.
57 void update(uint8_t Value) { Hash.update(Value); }
59 /// Encodes and adds \param Value to the hash as a ULEB128.
62 /// Encodes and adds \param Value to the hash as a SLEB128.
66 /// Adds \param Str to the hash and includes a NULL byte
[all...] |
| ByteStreamer.h | 61 DIEHash &Hash;
63 HashingByteStreamer(DIEHash &H) : Hash(H) {}
65 Hash.update(Byte);
68 Hash.addSLEB128(DWord);
72 Hash.addULEB128(DWord);
|
| /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...] |
| PDBStringTable.cpp | 12 #include "llvm/DebugInfo/PDB/Native/Hash.h"
33 "Invalid hash table signature");
36 "Unsupported hash version");
50 "Invalid hash table byte length"));
96 // We don't know how long the hash table is until we parse it, so let the
114 uint32_t Hash =
117 uint32_t Start = Hash % Count;
119 // The hash is just a starting point for the search, but if it
124 // If we find 0, it means the item isn't in the hash table.
|
| PDBStringTableBuilder.cpp | 12 #include "llvm/DebugInfo/PDB/Native/Hash.h"
31 // this hash function truncates the hash to 16 bit.
133 uint32_t Size = sizeof(uint32_t); // Hash table begins with 4-byte size field.
174 // Write a hash table.
183 uint32_t Hash = hashStringV1(S);
186 uint32_t Slot = (Hash + I) % BucketCount;
|
| /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; }
|
| LLVMContextImpl.cpp | 161 /// MDOperand hash to the same value as a \a Metadata pointer.
176 unsigned Hash = hash_combine_range(N->op_begin() + Offset, N->op_end());
181 assert(Hash == RawHash &&
182 "Expected hash of MDOperand to equal hash of Metadata*");
185 return Hash;
|
| PseudoProbe.cpp | 141 auto Hash = [](const PseudoProbeInst *I) {
142 return std::hash<uint64_t>()(I->getFuncGuid()->getZExtValue()) ^
143 std::hash<uint64_t>()(I->getIndex()->getZExtValue());
154 std::unordered_set<PseudoProbeInst *, decltype(Hash), decltype(IsEqual)>
155 DanglingProbes(0, Hash, IsEqual);
|
| /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/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/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);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| PseudoProbeInserter.cpp | 119 auto Hash = [](const MachineInstr *MI) {
120 return std::hash<uint64_t>()(MI->getOperand(0).getImm()) ^
121 std::hash<uint64_t>()(MI->getOperand(1).getImm());
132 std::unordered_set<MachineInstr *, decltype(Hash), decltype(IsEqual)>
133 DanglingProbes(0, Hash, IsEqual);
|
| MIRVRegNamerUtils.cpp | 20 UseStableNamerHash("mir-vreg-namer-use-stable-hash", cl::init(false),
62 auto Hash = stableHashValue(MI, /* HashVRegs */ true,
65 assert(Hash && "Expected non-zero Hash");
66 return std::to_string(Hash).substr(0, 5);
95 // is contributing to a hash collision but there's enough information
105 // result in a stable hash, in most cases because they are pointers. We want
106 // stable hashes because we want the hash to be the same run to run.
|
| BranchFolding.h | 53 unsigned Hash;
58 : Hash(h), Block(b) {}
60 unsigned getHash() const { return Hash; }
152 /// Look through all the blocks in MergePotentials that have hash CurHash
165 /// Remove all blocks with hash CurHash from MergePotentials, restoring
|
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| IssueHash.cpp | 37 // distinct hash value for every instantiation. Use the signature from the
173 llvm::MD5 Hash;
177 Hash.update(Content);
178 Hash.final(MD5Res);
|
| CloneDetection.cpp | 225 static size_t createHash(llvm::MD5 &Hash) {
228 // Create the final hash code for the current Stmt.
230 Hash.final(HashResult);
232 // Copy as much as possible of the generated hash code to the Stmt's hash
240 /// Generates and saves a hash code for the given Stmt.
243 /// \param StmtsByHash Output parameter that will contain the hash codes for
245 /// \return The hash code of the given Stmt.
252 llvm::MD5 Hash;
255 CloneTypeIIStmtDataCollector<llvm::MD5>(S, Context, Hash);
[all...] |
| /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/apache2/llvm/dist/llvm/lib/DWARFLinker/ |
| DWARFLinkerDeclContext.cpp | 142 // We hash NameRef, which is the mangled name, in order to get most
151 // qualified name hash to get the same effect.
152 unsigned Hash = hash_combine(Context.getQualifiedNameHash(), Tag, NameRef);
157 Hash = hash_combine(Hash, FileRef);
160 DeclContext Key(Hash, Line, ByteSize, Tag, NameRef, FileRef, Context);
167 new (Allocator) DeclContext(Hash, Line, ByteSize, Tag, NameRef, FileRef,
|
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerSHA1.cpp | 193 // Return pointer to hash (20 characters)
216 std::string Hash(const Unit &U) {
217 uint8_t Hash[kSHA1NumBytes];
218 ComputeSHA1(U.data(), U.size(), Hash);
219 return Sha1ToString(Hash);
|
| /src/external/apache2/llvm/dist/clang/tools/libclang/ |
| CIndexer.cpp | 207 llvm::MD5 Hash;
208 Hash.update(getContents(UF.value()));
210 Hash.final(Result);
|
| /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/external/apache2/llvm/dist/llvm/lib/Support/ |
| MD5.cpp | 189 /// Incrementally add the bytes in \p Data to the hash.
225 /// Add the bytes in the StringRef \p Str to the hash.
233 /// Finish the hash and place the resulting hash into \p result.
277 std::array<uint8_t, 16> MD5::hash(ArrayRef<uint8_t> Data) { function in class:MD5
278 MD5 Hash;
279 Hash.update(Data);
281 Hash.final(Res);
|
| SHA1.cpp | 11 // http://cvsweb.netbsd.org/bsdweb.cgi/src/common/lib/libc/hash/sha1/sha1.c?rev=1.6)
285 // Return pointer to hash (20 characters)
292 auto Hash = final();
297 // Return pointer to hash (20 characters)
298 return Hash;
301 std::array<uint8_t, 20> SHA1::hash(ArrayRef<uint8_t> Data) { function in class:SHA1
302 SHA1 Hash;
303 Hash.update(Data);
304 StringRef S = Hash.final();
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-pdbutil/ |
| MinimalTypeDumper.cpp | 234 uint32_t Hash = HashValues[Index.toArrayIndex()];
240 if (Hash == OurHash)
241 H = "0x" + utohexstr(Hash);
243 H = "0x" + utohexstr(Hash) + ", our hash = 0x" + utohexstr(OurHash);
245 P.format(", hash = {0}", H);
|
