| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachineOutliner.h | 37 struct Candidate { struct
45 // The first instruction in this \p Candidate. argument
48 // The last instruction in this \p Candidate. argument
51 // The basic block that contains this Candidate. argument
58 /// Liveness information for this Candidate. Tracks from the end of the argument
65 /// Liveness information restricted to this Candidate's instruction sequence. argument
80 "Candidate' in initFromEndOfBlockToStartOfSeq() argument
97 initInSeqCandidate initInSeq() argument
116 CallConstructionIDCandidate global() argument
119 FlagsCandidate global() argument
120 getLengthCandidate getLength() argument
123 getStartIdxCandidate getStartIdx() argument
126 getEndIdxCandidate getEndIdx() argument
130 setCallInfoCandidate setCallInfo() argument
136 getCallOverheadCandidate getCallOverhead() argument
138 frontCandidate front() argument
139 backCandidate back() argument
140 getMFCandidate getMF() argument
141 getMBBCandidate getMBB() argument
155 isAvailableAcrossAndOutOfSeqCandidate isAvailableAcrossAndOutOfSeq() argument
164 isAnyUnavailableAcrossOrOutOfSeqCandidate isAnyUnavailableAcrossOrOutOfSeq() argument
196 CandidateCandidate Candidate() argument
[all...] |
| /freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
| H A D | SystemZMachineScheduler.h | 41 struct Candidate { struct
50 Candidate() = default; argument
57 bool noCost() const { in noCost()
62 void dumpCosts() { in dumpCosts()
|
| H A D | SystemZMachineScheduler.cpp | 201 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec) : Candidate() { in Candidate() function in SystemZPostRASchedStrategy::Candidate
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | StraightLineStrengthReduce.cpp | 133 struct Candidate { struct in __anon0eec50480111::StraightLineStrengthReduce
134 enum Kind {
142 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate() function
146 Kind CandidateKind = Invalid;
148 const SCEV *Base = nullptr;
153 ConstantInt *Index = nullptr;
155 Value *Stride = nullptr;
171 Instruction *Ins = nullptr;
175 Candidate *Basis = nullptr;
|
| H A D | NaryReassociate.cpp | 419 Value *Candidate = findClosestMatchingDominator(CandidateExpr, GEP); in tryReassociateGEPAtIndex() local
569 if (Value *Candidate = Candidates.pop_back_val()) { in findClosestMatchingDominator() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | GCNMinRegStrategy.cpp | 24 struct Candidate : ilist_node<Candidate> { struct in __anon235545e00111::GCNMinRegScheduler
25 const SUnit *SU;
26 int Priority;
28 Candidate(const SUnit *SU_, int Priority_ = 0) in Candidate() argument
|
| H A D | GCNILPSched.cpp | 22 struct Candidate : ilist_node<Candidate> { struct in __anon1a74e9370111::GCNILPScheduler
23 SUnit *SU;
25 Candidate(SUnit *SU_) in Candidate() argument
|
| H A D | GCNNSAReassign.cpp | 254 using Candidate = std::pair<const MachineInstr*, bool>; in runOnMachineFunction() typedef
|
| H A D | SIOptimizeExecMasking.cpp | 361 Register Candidate = MO.getReg(); in findInstrBackwards() local
|
| /freebsd/contrib/llvm-project/clang/lib/Driver/ToolChains/ |
| H A D | Cuda.cpp | 139 struct Candidate { in CudaInstallationDetector() struct
140 std::string Path; in CudaInstallationDetector()
141 bool StrictChecking; in CudaInstallationDetector()
143 Candidate(std::string Path, bool StrictChecking = false) in CudaInstallationDetector() function
196 for (const auto &Candidate : Candidates) { in CudaInstallationDetector() local
|
| H A D | AMDGPU.cpp | 439 for (const auto &Candidate : ROCmDirs) { in detectDeviceLibrary() local
461 for (const auto &Candidate : HIPSearchDirs) { in detectHIPRuntime() local
|
| /freebsd/contrib/bmake/ |
| H A D | suff.c | 197 typedef struct Candidate { struct
212 struct Candidate *parent; argument
222 CandidateList childrenList; argument
224 } Candidate; argument
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonMachineScheduler.cpp | 46 SchedCandidate &Candidate, in SchedulingCost()
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | ThreadSafetyTIL.cpp | 209 BasicBlock *Candidate = nullptr; in computeDominator() local
236 BasicBlock *Candidate = nullptr; in computePostDominator() local
|
| H A D | CloneDetection.cpp | 505 const StmtSequence &Candidate = HashGroup[j]; in splitCloneGroups() local
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | VLIWMachineScheduler.cpp | 525 const RegPressureTracker &RPTracker, SchedCandidate &Candidate, in readyQueueVerboseDump()
597 SchedCandidate &Candidate, in SchedulingCost()
771 SchedCandidate &Candidate) { in pickNodeFromQueue()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | SampleProfile.cpp | 804 static bool doesHistoryAllowICP(const Instruction &Inst, StringRef Candidate) { in doesHistoryAllowICP()
920 Function &F, InlineCandidate &Candidate, uint64_t SumOrigin, uint64_t &Sum, in tryPromoteAndInlineCandidate()
1184 InlineCandidate Candidate = {I, LocalNotInlinedCallSites.lookup(I), in inlineHotFunctions() local
1231 InlineCandidate &Candidate, SmallVector<CallBase *, 8> *InlinedCallSites) { in tryInlineCandidate()
1343 SampleProfileLoader::shouldInlineCandidate(InlineCandidate &Candidate) { in shouldInlineCandidate()
1450 InlineCandidate Candidate = CQueue.top(); in inlineHotFunctionsWithPriority() local
|
| H A D | SampleProfileMatcher.cpp | 286 const auto &Candidate = R->second; in matchNonCallsiteLocs() local
301 LineLocation Candidate(CandidateLineOffset, L.Discriminator); in matchNonCallsiteLocs() local
314 LineLocation Candidate(CandidateLineOffset, Loc.Discriminator); in matchNonCallsiteLocs() local
|
| H A D | FunctionImport.cpp | 513 [&](const auto &Candidate) { in computeImportForModule()
521 [](const auto &Candidate) { return Candidate.second; }); in computeImportForModule()
543 PotentialCandidates, [&](const auto *Candidate) { in computeImportForModule()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 248 for (auto *Candidate : Candidates) { in getBest() local
272 for (auto *Candidate : BestCandidates) { in getBest() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | IndirectCallPromotion.cpp | 584 auto &Candidate = Candidates[CalleeIndexIter->second]; in computeVTableInfos() local
719 for (const auto &Candidate : Candidates) { in tryToPromoteWithVTableCmp() local
848 auto &Candidate = Candidates[I]; in isProfitableToCompareVTables() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/ |
| H A D | MipsELFObjectWriter.cpp | 197 static bool compareMatchingRelocs(const MipsRelocationEntry &Candidate, in compareMatchingRelocs()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/ |
| H A D | IROutliner.h | 65 IRSimilarityCandidate *Candidate = nullptr; member
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/ |
| H A D | SPIRVConvergenceRegionAnalysis.cpp | 91 ConvergenceRegion *Candidate = nullptr; in findParentRegion() local
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Target/ |
| H A D | TargetMachine.h | 183 bool isCompatibleDataLayout(const DataLayout &Candidate) const { in isCompatibleDataLayout()
|