Home
last modified time | relevance | path

Searched refs:Hash (Results 1 – 25 of 231) sorted by relevance

12345678910

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DStableHashing.h
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/
H A DHash.cpp57 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/llvm/include/llvm/ADT/
H A DCachedHashString.h32 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 …]
H A DConcurrentHashtable.h42 /// [------- 64-bit Hash value --------]
77 /// \returns Hash value for the specified \p Key.
173 uint64_t Hash = Info::getHashValue(NewValue); in insert()
174 Bucket &CurBucket = BucketsArray[getBucketIdx(Hash)]; in insert() local
175 uint32_t ExtHashBits = getExtHashBits(Hash); in insert()
206 // Hash matched. Check value for equality. in insert()
361 uint32_t getBucketIdx(hash_code Hash) { return Hash & HashMask; }
363 uint32_t getExtHashBits(uint64_t Hash) {
364 return (Hash argument
362 getBucketIdx(hash_code Hash) getBucketIdx() argument
[all...]
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DODRHash.cpp263 ODRHash &Hash; member in __anonb4317f1a0111::ODRDeclVisitor
266 ODRDeclVisitor(llvm::FoldingSetNodeID &ID, ODRHash &Hash) in ODRDeclVisitor() argument
267 : ID(ID), Hash(Hash) {} in ODRDeclVisitor()
270 Hash.AddBoolean(S); in AddStmt()
272 Hash.AddStmt(S); in AddStmt()
277 Hash.AddBoolean(II); in AddIdentifierInfo()
279 Hash.AddIdentifierInfo(II); in AddIdentifierInfo()
284 Hash.AddQualType(T); in AddQualType()
288 Hash.AddBoolean(D); in AddDecl()
290 Hash.AddDecl(D); in AddDecl()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/
H A DTypeHashing.h35 hash_code Hash; member
86 ::memcpy(Hash.data(), H.data(), 8); in GloballyHashedType()
88 std::array<uint8_t, 8> Hash; member
90 bool empty() const { return *(const uint64_t*)Hash.data() == 0; } in empty()
94 return L.Hash == R.Hash;
99 return !(L.Hash == R.Hash);
192 return Val.Hash;
197 if (LHS.Hash !
[all...]
/freebsd/contrib/llvm-project/llvm/lib/ObjectYAML/
H A DCodeViewYAMLTypeHashing.cpp37 ScalarTraits<BinaryRef>::output(GH.Hash, Ctx, OS); in output()
42 return ScalarTraits<BinaryRef>::input(Scalar, Ctx, GH.Hash); in input()
77 SmallString<8> Hash; in toDebugH() local
79 Hash.clear(); in toDebugH()
80 raw_svector_ostream OS(Hash); in toDebugH()
81 H.Hash.writeAsBinary(OS); in toDebugH()
82 assert((Hash.size() == 8) && "Invalid hash size!"); in toDebugH()
83 cantFail(Writer.writeFixedString(Hash)); in toDebugH()
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dstack_depot.h140 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/lib/CodeGenData/
H A DOutlinedHashTreeRecord.cpp31 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 DOutlinedHashTree.cpp39 for (const auto &[Hash, Successor] : Current->Successors) in walkGraph()
40 SortedSuccessors.emplace_back(Hash, Successor.get()); in walkGraph()
80 NextPtr->Hash = StableHash; in insert()
103 for (auto &[Hash, NextSrcNode] : SrcNode->Successors) { in merge()
105 auto I = DstNode->Successors.find(Hash); in merge()
109 NextDstNode->Hash = Hash; in merge()
110 DstNode->Successors.emplace(Hash, std::move(NextDst)); in merge()
/freebsd/crypto/openssl/crypto/rsa/
H A Drsa_pss.c32 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
54 mgf1Hash = Hash; in RSA_verify_PKCS1_PSS_mgf1()
56 hLen = EVP_MD_get_size(Hash); in RSA_verify_PKCS1_PSS_mgf1()
121 if (!EVP_DigestInit_ex(ctx, Hash, NULL) in RSA_verify_PKCS1_PSS_mgf1()
148 const EVP_MD *Hash, int sLen) in RSA_padding_add_PKCS1_PSS() argument
150 return RSA_padding_add_PKCS1_PSS_mgf1(rsa, EM, mHash, Hash, NULL, sLen); in RSA_padding_add_PKCS1_PSS()
155 const EVP_MD *Hash, const EVP_MD *mgf1Hash, in RSA_padding_add_PKCS1_PSS_mgf1() argument
165 mgf1Hash = Hash; in RSA_padding_add_PKCS1_PSS_mgf1()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/BinaryFormat/
H A DWasmTraits.h73 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/llvm/lib/IR/
H A DStructuralHash.cpp27 uint64_t Hash;
29 void hash(uint64_t V) { Hash = hashing::detail::hash_16_bytes(Hash, V); }
46 StructuralHashImpl() : Hash(4) {} in update()
151 uint64_t getHash() const { return Hash; }
23 hash_code Hash; global() member in __anon8dbff9370111::StructuralHashImpl
/freebsd/contrib/llvm-project/compiler-rt/lib/ubsan/
H A Dubsan_type_hash_itanium.cpp223 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 Dubsan_handlers_cxx.cpp34 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 DAccelTable.cpp254 for (const auto &Hash : Bucket) { in emitHashes() local
255 uint32_t HashValue = Hash->HashValue; in emitHashes()
270 for (auto *Hash : Buckets[i]) { in emitOffsets() local
271 uint32_t HashValue = Hash->HashValue; in emitOffsets()
276 Asm->emitLabelDifference(Hash->Sym, Base, Asm->getDwarfOffsetByteSize()); in emitOffsets()
335 for (const auto &Hash : Bucket) { in emitData() local
339 PrevHash != Hash->HashValue) in emitData()
342 Asm->OutStreamer->emitLabel(Hash->Sym); in emitData()
343 Asm->OutStreamer->AddComment(Hash->Name.getString()); in emitData()
344 Asm->emitDwarfStringOffset(Hash->Name); in emitData()
[all …]
H A DByteStreamer.h71 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 DDIEHash.cpp44 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 DSampleProfileProbe.cpp56 uint64_t Hash = 0; in getCallStackHash() local
59 Hash ^= MD5Hash(std::to_string(InlinedAt->getLine())); in getCallStackHash()
60 Hash ^= MD5Hash(std::to_string(InlinedAt->getColumn())); in getCallStackHash()
62 Hash ^= MD5Hash(Name); in getCallStackHash()
65 return Hash; in getCallStackHash()
140 uint64_t Hash = computeCallStackHash(I); in collectProbeFactors() local
141 ProbeFactors[{Probe->Id, Hash}] += Probe->Factor; in collectProbeFactors()
447 auto Hash = getFunctionHash(); in instrumentOneFunc() local
448 auto *MD = MDB.createPseudoProbeDesc(Guid, Hash, FName); in instrumentOneFunc()
484 uint64_t Hash = computeCallStackHash(I); in runOnFunction() local
[all …]
H A DSampleContextTracker.cpp35 uint64_t Hash = FunctionSamples::getCallSiteHash(CalleeName, CallSite); in getChildContext() local
36 auto It = AllChildContext.find(Hash); in getChildContext()
69 uint64_t Hash = in moveContextSamples() local
73 assert(!AllChildContext.count(Hash) && "Node to remove must exist"); in moveContextSamples()
74 AllChildContext[Hash] = NodeToMove; in moveContextSamples()
75 ContextTrieNode &NewNode = AllChildContext[Hash]; in moveContextSamples()
107 uint64_t Hash = FunctionSamples::getCallSiteHash(CalleeName, CallSite); in removeChildContext() local
109 AllChildContext.erase(Hash); in removeChildContext()
181 uint64_t Hash = FunctionSamples::getCallSiteHash(CalleeName, CallSite); in getOrCreateChildContext() local
182 auto It = AllChildContext.find(Hash); in getOrCreateChildContext()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86OptimizeLEAs.cpp140 hash_code Hash = hash_combine(*Val.Operands[0], *Val.Operands[1], in getHashValue() local
152 Hash = hash_combine(Hash, Val.Disp->getIndex()); in getHashValue()
155 Hash = hash_combine(Hash, Val.Disp->getSymbolName()); in getHashValue()
158 Hash = hash_combine(Hash, Val.Disp->getGlobal()); in getHashValue()
161 Hash = hash_combine(Hash, Val.Disp->getBlockAddress()); in getHashValue()
164 Hash = hash_combine(Hash, Val.Disp->getMCSymbol()); in getHashValue()
167 Hash = hash_combine(Hash, Val.Disp->getMBB()); in getHashValue()
173 return (unsigned)Hash; in getHashValue()
/freebsd/contrib/llvm-project/libcxx/include/experimental/
H A Dunordered_set
/freebsd/contrib/llvm-project/llvm/include/llvm/ObjectYAML/
H A DCodeViewYAMLTypeHashing.h33 explicit GlobalHash(StringRef S) : Hash(S) { in GlobalHash()
36 explicit GlobalHash(ArrayRef<uint8_t> S) : Hash(S) { in GlobalHash()
39 yaml::BinaryRef Hash; member
/freebsd/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set20 template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
28 typedef Hash hasher;
92 template <class Value, class Hash, class Pred, class Alloc>
93 void swap(hash_set<Value, Hash, Pred, Alloc>& x,
94 hash_set<Value, Hash, Pred, Alloc>& y);
96 template <class Value, class Hash, class Pred, class Alloc>
98 operator==(const hash_set<Value, Hash, Pred, Alloc>& x,
99 const hash_set<Value, Hash, Pred, Alloc>& y);
101 template <class Value, class Hash, class Pred, class Alloc>
103 operator!=(const hash_set<Value, Hash, Pred, Alloc>& x,
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DWARFLinker/
H A DDWARFLinkerDeclContext.cpp

12345678910