| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | StableHashing.h | |
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | TrieRawHashMap.h | 125 LLVM_ABI PointerBase find(ArrayRef<uint8_t> Hash) const; 129 insert(PointerBase Hint, ArrayRef<uint8_t> Hash, 130 function_ref<const uint8_t *(void *Mem, ArrayRef<uint8_t> Hash)> 192 const HashT Hash; member 198 value_type(ArrayRef<uint8_t> Hash, const T &Data) in value_type() 199 : Hash(makeHash(Hash)), Data(Data) {} in value_type() 200 value_type(ArrayRef<uint8_t> Hash, T &&Data) in value_type() 201 : Hash(makeHash(Hash)), Data(std::move(Data)) {} in value_type() 208 value_type(ArrayRef<uint8_t> Hash, EmplaceTag, ArgsT &&...Args) in value_type() 209 : Hash(makeHash(Hash)), Data(std::forward<ArgsT>(Args)...) {} in value_type() [all …]
|
| H A D | CachedHashString.h | 32 uint32_t Hash; variable 39 CachedHashStringRef(StringRef S, uint32_t Hash) in CachedHashStringRef() argument 40 : P(S.data()), Size(S.size()), Hash(Hash) { in CachedHashStringRef() 47 uint32_t hash() const { return Hash; } in hash() 77 uint32_t Hash; 91 : P(EmptyOrTombstonePtr), Size(0), Hash(0) { 104 CachedHashString(StringRef S, uint32_t Hash) 105 : P(new char[S.size()]), Size(S.size()), Hash(Hash) { 112 : Size(Other.Size), Hash(Other.Hash) { 127 : P(Other.P), Size(Other.Size), Hash(Other.Hash) { [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | Hash.cpp | 57 uint32_t Hash = 0xb170a1bf; in hashStringV2() local 65 Hash += Item; in hashStringV2() 66 Hash += (Hash << 10); in hashStringV2() 67 Hash ^= (Hash >> 6); in hashStringV2() 71 Hash += Item; in hashStringV2() 72 Hash += (Hash << 10); in hashStringV2() 73 Hash ^= (Hash >> 6); in hashStringV2() 76 return Hash * 1664525U + 1013904223U; in hashStringV2()
|
| /freebsd/contrib/llvm-project/clang/lib/Serialization/ |
| H A D | TemplateArgumentHasher.cpp | 223 TemplateArgumentHasher &Hash; member in __anon91a37be10111::TypeVisitorHelper 226 TypeVisitorHelper(llvm::FoldingSetNodeID &ID, TemplateArgumentHasher &Hash) in TypeVisitorHelper() argument 227 : ID(ID), Hash(Hash) {} in TypeVisitorHelper() 231 Hash.AddDecl(D); in AddDecl() 233 Hash.AddInteger(0); in AddDecl() 236 void AddQualType(QualType T) { Hash.AddQualType(T); } in AddQualType() 240 Hash.AddType(T); in AddType() 242 Hash.AddInteger(0); in AddType() 246 Hash.AddInteger(Quals.getAsOpaqueValue()); in VisitQualifiers() 252 void VisitType(const Type *T) { Hash.setBailedOut(); } in VisitType() [all …]
|
| /freebsd/contrib/llvm-project/clang/lib/AST/ |
| H A D | ODRHash.cpp | 279 ODRHash &Hash; member in __anonb4317f1a0111::ODRDeclVisitor 282 ODRDeclVisitor(llvm::FoldingSetNodeID &ID, ODRHash &Hash) in ODRDeclVisitor() argument 283 : ID(ID), Hash(Hash) {} in ODRDeclVisitor() 286 Hash.AddBoolean(S); in AddStmt() 288 Hash.AddStmt(S); in AddStmt() 293 Hash.AddBoolean(II); in AddIdentifierInfo() 295 Hash.AddIdentifierInfo(II); in AddIdentifierInfo() 300 Hash.AddQualType(T); in AddQualType() 304 Hash.AddBoolean(D); in AddDecl() 306 Hash.AddDecl(D); in AddDecl() [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CGData/ |
| H A D | StableFunctionMap.h | 33 stable_hash Hash; member 43 StableFunction(stable_hash Hash, const std::string FunctionName, in StableFunction() 46 : Hash(Hash), FunctionName(FunctionName), ModuleName(ModuleName), in StableFunction() 56 stable_hash Hash; member 67 stable_hash Hash, unsigned FunctionNameId, unsigned ModuleNameId, in StableFunctionEntry() 70 : Hash(Hash), FunctionNameId(FunctionNameId), in StableFunctionEntry() 122 HashToFuncs[FuncEntry->Hash].emplace_back(std::move(FuncEntry)); in insert()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/ |
| H A D | TypeHashing.h | 36 hash_code Hash; member 87 ::memcpy(Hash.data(), H.data(), 8); in GloballyHashedType() 89 std::array<uint8_t, 8> Hash; member 91 bool empty() const { return *(const uint64_t*)Hash.data() == 0; } in empty() 95 return L.Hash == R.Hash; 100 return !(L.Hash == R.Hash); 194 return Val.Hash; 199 if (LHS.Hash != RHS.Hash) 214 return *reinterpret_cast<const unsigned *>(Val.Hash.data()); 227 write_hex(Stream, V.Hash, HexPrintStyle::Upper, 8); [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CGData/ |
| H A D | StableFunctionMap.cpp | 86 for (auto &[Index, Hash] : Func.IndexOperandHashes) in insert() 87 (*IndexOperandHashMap)[Index] = Hash; in insert() 89 Func.Hash, FuncNameId, ModuleNameId, Func.InstCount, in insert() 96 for (auto &[Hash, Funcs] : OtherMap.HashToFuncs) { in merge() 97 auto &ThisFuncs = HashToFuncs[Hash]; in merge() 106 Func->Hash, FuncNameId, ModuleNameId, Func->InstCount, in merge() 124 for (auto &[Hash, Funcs] : HashToFuncs) in size() 140 for (auto &[Pair, Hash] : *(RSF->IndexOperandHashMap)) { in removeIdenticalIndexPair() 145 if (Hash != SHash) { in removeIdenticalIndexPair() 177 for (auto &[IndexPair, Hash] : *SF->IndexOperandHashMap) in isProfitable() [all …]
|
| H A D | OutlinedHashTreeRecord.cpp | 31 io.mapRequired("Hash", res.Hash); in mapping() 66 Writer.write<uint64_t>(NodeStable.Hash); in serialize() 82 NodeStable.Hash = in deserialize() 132 NodeStable.Hash = Node->Hash; in convertToStableData() 156 Curr->Hash = NodeStable.Hash; in convertFromStableData() 164 auto Hash = IdNodeStableMap.at(SuccessorId).Hash; in convertFromStableData() local 165 Successors[Hash] = std::move(Sucessor); in convertFromStableData()
|
| H A D | OutlinedHashTree.cpp | 39 for (const auto &[Hash, Successor] : Current->Successors) in walkGraph() 40 SortedSuccessors.emplace_back(Hash, Successor.get()); in walkGraph() 80 NextPtr->Hash = StableHash; in insert() 102 for (auto &[Hash, NextSrcNode] : SrcNode->Successors) { in merge() 104 auto I = DstNode->Successors.find(Hash); in merge() 108 NextDstNode->Hash = Hash; in merge() 109 DstNode->Successors.emplace(Hash, std::move(NextDst)); in merge()
|
| /freebsd/crypto/openssl/crypto/rsa/ |
| H A D | rsa_pss.c | 32 const EVP_MD *Hash, const unsigned char *EM, in RSA_verify_PKCS1_PSS() argument 35 return RSA_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, NULL, EM, sLen); in RSA_verify_PKCS1_PSS() 39 const EVP_MD *Hash, const EVP_MD *mgf1Hash, in RSA_verify_PKCS1_PSS_mgf1() argument 42 return ossl_rsa_verify_PKCS1_PSS_mgf1(rsa, mHash, Hash, mgf1Hash, EM, &sLen); in RSA_verify_PKCS1_PSS_mgf1() 46 const EVP_MD *Hash, const EVP_MD *mgf1Hash, in ossl_rsa_verify_PKCS1_PSS_mgf1() argument 62 mgf1Hash = Hash; in ossl_rsa_verify_PKCS1_PSS_mgf1() 64 hLen = EVP_MD_get_size(Hash); in ossl_rsa_verify_PKCS1_PSS_mgf1() 133 if (!EVP_DigestInit_ex(ctx, Hash, NULL) in ossl_rsa_verify_PKCS1_PSS_mgf1() 160 const EVP_MD *Hash, int sLen) in RSA_padding_add_PKCS1_PSS() argument 162 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen); in RSA_padding_add_PKCS1_PSS() [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/ObjectYAML/ |
| H A D | CodeViewYAMLTypeHashing.cpp | 35 ScalarTraits<BinaryRef>::output(GH.Hash, Ctx, OS); in output() 40 return ScalarTraits<BinaryRef>::input(Scalar, Ctx, GH.Hash); in input() 75 SmallString<8> Hash; in toDebugH() local 77 Hash.clear(); in toDebugH() 78 raw_svector_ostream OS(Hash); in toDebugH() 79 H.Hash.writeAsBinary(OS); in toDebugH() 80 assert((Hash.size() == 8) && "Invalid hash size!"); in toDebugH() 81 cantFail(Writer.writeFixedString(Hash)); in toDebugH()
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
| H A D | stack_depot.h | 140 u32 Hash = B.get(); in insert() local 142 u32 Pos = Hash & TabMask; in insert() 145 u64 Id = (u64(End - Begin) << 33) | (u64(Hash) << 1) | 1; in insert() 147 return Hash; in insert() 158 return Hash; in insert() 164 bool find(u32 Hash, uptr *RingPosPtr, uptr *SizePtr) const { in find() argument 168 u32 Pos = Hash & TabMask; in find() 173 u64 HashWithTagBit = (u64(Hash) << 1) | 1; in find() 186 return B.get() == Hash; in find()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ProfileData/ |
| H A D | IndexedMemProfData.h | 70 llvm::BLAKE3Result<8> Hash = HashBuilder.final(); in hashFrame() local 72 std::memcpy(&Id, Hash.data(), sizeof(Hash)); in hashFrame() 82 llvm::BLAKE3Result<8> Hash = HashBuilder.final(); in hashCallStack() local 84 std::memcpy(&CSId, Hash.data(), sizeof(Hash)); in hashCallStack()
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/ |
| H A D | unordered_set | 24 template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>, 32 typedef Hash hasher; 200 class Hash = hash<typename iterator_traits<InputIterator>::value_type>, 204 Hash = Hash(), Pred = Pred(), Allocator = Allocator()) 206 Hash, Pred, Allocator>; // C++17 209 class Hash = hash<ranges::range_value_t<R>>, 212 …unordered_set(from_range_t, R&&, typename see below::size_type = see below, Hash = Hash(), Pred = … 213 -> unordered_set<ranges::range_value_t<R>, Hash, Pred, Allocator>; // C++23 215 template<class T, class Hash = hash<T>, 218 Hash = Hash(), Pred = Pred(), Allocator = Allocator()) [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | IRNormalizer.cpp | 136 uint64_t Hash = MagicHashConstant; in nameBasicBlocks() local 141 Hash = hashing::detail::hash_16_bytes(Hash, I.getOpcode()); in nameBasicBlocks() 145 B.setName("bb" + std::to_string(Hash).substr(0, 5)); in nameBasicBlocks() 215 uint64_t Hash = MagicHashConstant; in nameAsInitialInstruction() local 218 Hash = hashing::detail::hash_16_bytes(Hash, I->getOpcode()); in nameAsInitialInstruction() 226 Hash = hashing::detail::hash_16_bytes(Hash, Output); in nameAsInitialInstruction() 230 Name.append("vl" + std::to_string(Hash).substr(0, 5)); in nameAsInitialInstruction() 298 uint64_t Hash = MagicHashConstant; in nameAsRegularInstruction() local 301 Hash = hashing::detail::hash_16_bytes(Hash, I->getOpcode()); in nameAsRegularInstruction() 315 Hash = hashing::detail::hash_16_bytes(Hash, Code); in nameAsRegularInstruction() [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/BinaryFormat/ |
| H A D | WasmTraits.h | 73 unsigned Hash = hash_value(Limits.Flags); 74 Hash = hash_combine(Hash, Limits.Minimum); 76 Hash = hash_combine(Hash, Limits.Maximum); 78 return Hash;
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/ubsan/ |
| H A D | ubsan_type_hash_itanium.cpp | 223 bool __ubsan::checkDynamicType(void *Object, void *Type, HashValue Hash) { in checkDynamicType() argument 228 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() 229 if (*Bucket == Hash) { in checkDynamicType() 230 __ubsan_vptr_type_cache[Hash % VptrTypeCacheSize] = Hash; in checkDynamicType() 254 __ubsan_vptr_type_cache[Hash % VptrTypeCacheSize] = Hash; in checkDynamicType() 255 *Bucket = Hash; in checkDynamicType()
|
| H A D | ubsan_handlers_cxx.cpp | 34 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash, in HandleDynamicTypeCacheMiss() argument 36 if (checkDynamicType((void*)Pointer, Data->TypeInfo, Hash)) in HandleDynamicTypeCacheMiss() 85 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash) { in __ubsan_handle_dynamic_type_cache_miss() argument 87 HandleDynamicTypeCacheMiss(Data, Pointer, Hash, Opts); in __ubsan_handle_dynamic_type_cache_miss() 90 DynamicTypeCacheMissData *Data, ValueHandle Pointer, ValueHandle Hash) { in __ubsan_handle_dynamic_type_cache_miss_abort() argument 93 if (HandleDynamicTypeCacheMiss(Data, Pointer, Hash, Opts)) in __ubsan_handle_dynamic_type_cache_miss_abort()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | AccelTable.cpp | 253 for (const auto &Hash : Bucket) { in emitHashes() local 254 uint32_t HashValue = Hash->HashValue; in emitHashes() 269 for (auto *Hash : Buckets[i]) { in emitOffsets() local 270 uint32_t HashValue = Hash->HashValue; in emitOffsets() 275 Asm->emitLabelDifference(Hash->Sym, Base, Asm->getDwarfOffsetByteSize()); in emitOffsets() 334 for (const auto &Hash : Bucket) { in emitData() local 338 PrevHash != Hash->HashValue) in emitData() 341 Asm->OutStreamer->emitLabel(Hash->Sym); in emitData() 342 Asm->OutStreamer->AddComment(Hash->Name.getString()); in emitData() 343 Asm->emitDwarfStringOffset(Hash->Name); in emitData() [all …]
|
| H A D | ByteStreamer.h | 71 DIEHash &Hash; 73 HashingByteStreamer(DIEHash &H) : Hash(H) {} in HashingByteStreamer() 75 Hash.update(Byte); in emitInt8() 78 Hash.addSLEB128(DWord); in emitSLEB128() 82 Hash.addULEB128(DWord); in emitULEB128() 85 Hash.hashRawTypeReference(D); in emitDIERef()
|
| H A D | DIEHash.cpp | 44 Hash.update(Str); in addString() 45 Hash.update(ArrayRef((uint8_t)'\0')); in addString() 59 Hash.update(Byte); in addULEB128() 73 Hash.update(Byte); in addSLEB128() 233 Hash.update((uint64_t)V.getDIEInteger().getValue()); in hashBlockData() 392 Hash.update(ArrayRef((uint8_t)'\0')); in computeHash() 404 Hash.update(DWOName); in computeCUSignature() 410 Hash.final(Result); in computeCUSignature() 434 Hash.final(Result); in computeTypeSignature()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | SampleProfileProbe.cpp | 55 uint64_t Hash = 0; in getCallStackHash() local 58 Hash ^= MD5Hash(std::to_string(InlinedAt->getLine())); in getCallStackHash() 59 Hash ^= MD5Hash(std::to_string(InlinedAt->getColumn())); in getCallStackHash() 61 Hash ^= MD5Hash(Name); in getCallStackHash() 64 return Hash; in getCallStackHash() 139 uint64_t Hash = computeCallStackHash(I); in collectProbeFactors() local 140 ProbeFactors[{Probe->Id, Hash}] += Probe->Factor; in collectProbeFactors() 443 auto Hash = getFunctionHash(); in instrumentOneFunc() local 444 auto *MD = MDB.createPseudoProbeDesc(Guid, Hash, FName); in instrumentOneFunc() 479 uint64_t Hash = computeCallStackHash(I); in runOnFunction() local [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | TrieRawHashMap.cpp | 231 ThreadSafeTrieRawHashMapBase::find(ArrayRef<uint8_t> Hash) const { in find() 232 assert(!Hash.empty() && "Uninitialized hash"); in find() 239 TrieHashIndexGenerator IndexGen{NumRootBits, NumSubtrieBits, Hash}; in find() 249 return ExistingContent->getHash() == Hash in find() 260 PointerBase Hint, ArrayRef<uint8_t> Hash, in insert() argument 261 function_ref<const uint8_t *(void *Mem, ArrayRef<uint8_t> Hash)> in insert() 263 assert(!Hash.empty() && "Uninitialized hash"); in insert() 267 TrieHashIndexGenerator IndexGen{NumRootBits, NumSubtrieBits, Hash}; in insert() 286 const uint8_t *HashStorage = Constructor(Memory + ContentOffset, Hash); in insert() 290 TrieContent(ContentOffset, Hash.size(), HashStorage - Memory); in insert() [all …]
|