HomeSort by: relevance | last modified time | path
    Searched refs:Hashes (Results 1 - 14 of 14) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/CodeView/
TypeHashing.h 39 /// Given a sequence of types, compute all of the local hashes.
42 std::vector<LocallyHashedType> Hashes;
43 Hashes.reserve(std::distance(std::begin(Records), std::end(Records)));
45 Hashes.push_back(hashType(R));
47 return Hashes;
52 std::vector<LocallyHashedType> Hashes;
53 Types.ForEachRecord([&Hashes](TypeIndex TI, const CVType &Type) {
54 Hashes.push_back(hashType(Type.RecordData));
56 return Hashes;
70 /// global hashes of the types that B refers to), a global hash can uniquel
    [all...]
TypeStreamMerger.h 92 ArrayRef<GloballyHashedType> Hashes,
98 ArrayRef<GloballyHashedType> Hashes,
104 ArrayRef<GloballyHashedType> Hashes);
  /src/external/apache2/llvm/dist/llvm/tools/llvm-pdbutil/
MinimalTypeDumper.h 28 bool Hashes, codeview::LazyRandomTypeCollection &Types,
33 : P(P), Width(Width), RecordBytes(RecordBytes), Hashes(Hashes),
59 bool Hashes = false;
MinimalTypeDumper.cpp 229 if (Hashes) {
  /src/external/apache2/llvm/dist/llvm/lib/ObjectYAML/
CodeViewYAMLTypeHashing.cpp 32 io.mapOptional("HashValues", DebugH.Hashes);
61 DHS.Hashes.emplace_back(S);
69 uint32_t Size = 8 + 8 * DebugH.Hashes.size();
78 for (const auto &H : DebugH.Hashes) {
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/
TypeStreamMerger.cpp 91 ArrayRef<GloballyHashedType> Hashes,
96 ArrayRef<GloballyHashedType> Hashes);
98 ArrayRef<GloballyHashedType> Hashes,
274 ArrayRef<GloballyHashedType> Hashes,
278 GlobalHashes = Hashes;
287 ArrayRef<GloballyHashedType> Hashes) {
291 GlobalHashes = Hashes;
299 ArrayRef<GloballyHashedType> Hashes,
304 GlobalHashes = Hashes;
457 ArrayRef<GloballyHashedType> Hashes, Optional<uint32_t> &PCHSignature)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ObjectYAML/
CodeViewYAMLTypeHashing.h 46 std::vector<GlobalHash> Hashes;
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
FuzzerCorpus.h 105 Hashes.insert(Sha1Str);
158 Hashes.erase(Sha1ToString(II->Sha1));
161 Hashes.insert(Sha1ToString(II->Sha1));
167 bool HasUnit(const Unit &U) { return Hashes.count(Hash(U)); }
168 bool HasUnit(const std::string &H) { return Hashes.count(H); }
302 std::unordered_set<std::string> Hashes;
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/
TpiStreamBuilder.cpp 78 ArrayRef<uint32_t> Hashes) {
79 // Ignore empty type buffers. There should be no hashes or sizes in this case.
81 assert(Sizes.empty() && Hashes.empty());
88 assert(Sizes.size() == Hashes.size() && "sizes and hashes should be in sync");
94 llvm::append_range(TypeHashes, Hashes);
138 "either all or no type records should have hashes");
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
TpiStreamBuilder.h 58 ArrayRef<uint32_t> Hashes);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
RegisterBankInfo.cpp 307 SmallVector<size_t, 8> Hashes(NumBreakDowns);
309 Hashes.push_back(hash_value(BreakDown[Idx]));
310 return hash_combine_range(Hashes.begin(), Hashes.end());
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
AccelTable.h 47 /// | HASHES |
55 /// the number of buckets, total number of hashes, and room for a special struct
58 /// The buckets contain an index (e.g. 6) into the hashes array. The hashes
64 /// as an index into the hashes table and look at each successive hash as long
169 HashList Hashes;
  /src/external/apache2/llvm/dist/llvm/tools/llvm-readobj/
COFFDumper.cpp 1317 std::vector<GloballyHashedType> Hashes =
1321 Types, Hashes, PCHSignature))
  /src/external/apache2/llvm/dist/clang/lib/Serialization/
ASTReader.cpp 9883 auto PopulateHashes = [&ComputeSubDeclODRHash](DeclHashes &Hashes,
9889 Hashes.emplace_back(D, ComputeSubDeclODRHash(D));
10131 [&ComputeSubDeclODRHash](DeclHashes &Hashes,
10134 Hashes.emplace_back(D, ComputeSubDeclODRHash(D));
11369 DeclHashes &Hashes, EnumDecl *Enum) {
11376 Hashes.emplace_back(cast<EnumConstantDecl>(D),

Completed in 30 milliseconds