Home
last modified time | relevance | path

Searched refs:CandidateInfo (Results 1 – 7 of 7) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DValueProfilePlugins.inc22 using CandidateInfo = ValueProfileCollector::CandidateInfo;
30 std::vector<CandidateInfo> *Candidates;
38 void run(std::vector<CandidateInfo> &Cs) {
51 Candidates->emplace_back(CandidateInfo{Length, InsertPt, AnnotatedInst});
68 Candidates->emplace_back(CandidateInfo{Length, InsertPt, AnnotatedInst});
82 void run(std::vector<CandidateInfo> &Candidates) {
88 Candidates.emplace_back(CandidateInfo{Callee, InsertPt, AnnotatedInst});
102 void run(std::vector<CandidateInfo> &Candidates) {
118 Candidates.emplace_back(CandidateInfo{I, InsertPt, AnnotatedInst});
H A DValueProfileCollector.cpp39 void get(InstrProfValueKind K, std::vector<CandidateInfo> &Candidates) {} in get()
51 void get(InstrProfValueKind K, std::vector<CandidateInfo> &Candidates) { in get()
72 std::vector<CandidateInfo>
74 std::vector<CandidateInfo> Result; in get()
H A DValueProfileCollector.h59 struct CandidateInfo { struct
74 std::vector<CandidateInfo> get(InstrProfValueKind Kind) const; argument
H A DPGOInstrumentation.cpp132 using VPCandidateInfo = ValueProfileCollector::CandidateInfo;
/freebsd/contrib/llvm-project/llvm/lib/Option/
H A DOptTable.cpp241 [VisibilityMask](const Info &CandidateInfo) { in findNearest() argument
242 return (CandidateInfo.Visibility & VisibilityMask) == 0; in findNearest()
252 [FlagsToInclude, FlagsToExclude](const Info &CandidateInfo) { in findNearest() argument
253 if (FlagsToInclude && !(CandidateInfo.Flags & FlagsToInclude)) in findNearest()
255 if (CandidateInfo.Flags & FlagsToExclude) in findNearest()
274 for (const Info &CandidateInfo : in internalFindNearest() local
276 StringRef CandidateName = CandidateInfo.getName(*StrTable, PrefixesTable); in internalFindNearest()
285 if (ExcludeOption(CandidateInfo)) in internalFindNearest()
290 if (CandidateInfo.hasNoPrefix()) in internalFindNearest()
310 CandidateInfo.getPrefixOffsets(PrefixesTable)) { in internalFindNearest()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineLICM.cpp208 struct CandidateInfo { struct in __anona9a475ae0111::MachineLICMImpl
213 CandidateInfo(MachineInstr *mi, Register def, int fi) in CandidateInfo() function
223 SmallVectorImpl<CandidateInfo> &Candidates,
511 SmallVectorImpl<CandidateInfo> &Candidates, in ProcessMI()
587 Candidates.push_back(CandidateInfo(MI, Def, FI)); in ProcessMI()
602 SmallVector<CandidateInfo, 32> Candidates; in HoistRegionPostRA()
666 for (CandidateInfo &Candidate : Candidates) { in HoistRegionPostRA()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h340 const DFSInfo CandidateInfo = BlockDFSInfo.lookup(HeaderCandidate); in run() local
346 if (CandidateInfo.isAncestorOf(PredDFSInfo)) in run()
370 if (CandidateInfo.isAncestorOf(PredDFSInfo)) { in run()