Home
last modified time | relevance | path

Searched defs:Cand (Results 1 – 25 of 28) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCMachineScheduler.cpp24 static bool isADDIInstr(const GenericScheduler::SchedCandidate &Cand) { in isADDIInstr()
29 bool PPCPreRASchedStrategy::biasAddiLoadCandidate(SchedCandidate &Cand, in biasAddiLoadCandidate()
49 bool PPCPreRASchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate()
165 bool PPCPostRASchedStrategy::biasAddiCandidate(SchedCandidate &Cand, in biasAddiCandidate()
177 bool PPCPostRASchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate()
H A DPPCBranchCoalescing.cpp233 bool PPCBranchCoalescing::canCoalesceBranch(CoalescingCandidateInfo &Cand) { in canCoalesceBranch()
H A DPPCFrameLowering.cpp2772 MCPhysReg Cand = CSRegs[i]; in updateCalleeSaves() local
2788 MCPhysReg Cand = CSRegs[i]; in updateCalleeSaves() local
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp141 const StoreToLoadForwardingCandidate &Cand) { in operator <<()
276 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local
302 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores()
424 propagateStoredValueToLoadUsers(const StoreToLoadForwardingCandidate &Cand, in propagateStoredValueToLoadUsers()
526 for (const StoreToLoadForwardingCandidate &Cand : StoreToLoadDependences) { in processLoop() local
609 const StoreToLoadForwardingCandidate &Cand) { in processLoop()
622 for (const auto &Cand : Candidates) in processLoop() local
H A DTLSVariableHoist.cpp150 if (Cand.Users.size() != 1) in oneUseOutsideLoop() argument
196 tlshoist::TLSCandidate &Cand = TLSCandMap[GV]; findInsertPos() local
232 tlshoist::TLSCandidate &Cand = TLSCandMap[GV]; tryReplaceTLSCandidate() local
H A DConstantHoisting.cpp387 ConstPtrUnionType Cand = ConstInt; in collectConstantCandidates() local
445 ConstPtrUnionType Cand = ConstExpr; in collectConstantCandidates() local
H A DGVNSink.cpp797 SinkingInstructionCandidate Cand; in analyzeInstructionForSinking() local
844 auto Cand = analyzeInstructionForSinking(LRI, InstNum, MemoryInstNum, in sinkBB() local
H A DRewriteStatepointsForGC.cpp2426 Instruction *Cand = cast<Instruction>(It.first); in rematerializeLiveValuesAtUses() local
2506 for (auto *Cand : LiveValuesToBeDeleted) { in rematerializeLiveValuesAtUses() local
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64MachineScheduler.cpp61 bool AArch64PostRASchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocGreedy.cpp727 bool RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion()
806 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion()
868 BlockFrequency RAGreedy::calcGlobalSplitCost(GlobalSplitCandidate &Cand, in calcGlobalSplitCost()
946 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
955 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
994 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
1002 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
1121 GlobalSplitCandidate &Cand = GlobalCand[NumCands]; in calculateRegionSplitCostAroundReg() local
1202 GlobalSplitCandidate &Cand = GlobalCand[BestCand]; in doRegionSplit() local
1214 GlobalSplitCandidate &Cand = GlobalCand.front(); in doRegionSplit() local
H A DMachineScheduler.cpp3116 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate()
3175 GenericSchedulerBase::SchedCandidate &Cand, in tryLess()
3191 GenericSchedulerBase::SchedCandidate &Cand, in tryGreater()
3206 GenericSchedulerBase::SchedCandidate &Cand, in tryLatency()
3244 static void tracePick(const GenericSchedulerBase::SchedCandidate &Cand) { in tracePick()
3399 GenericSchedulerBase::SchedCandidate &Cand, in tryPressure()
3483 void GenericScheduler::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate()
3531 bool GenericScheduler::tryCandidate(SchedCandidate &Cand, in tryCandidate()
3645 SchedCandidate &Cand) { in pickNodeFromQueue()
3732 SchedCandidate Cand = BotCand; in pickNodeBidirectional() local
[all …]
H A DMachineOutliner.cpp775 for (auto &Cand : OF.Candidates) { in createOutlinedFunction() local
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp141 SISchedulerCandidate &Cand, in tryLess()
158 SISchedulerCandidate &Cand, in tryGreater()
182 void SIScheduleBlock::traceCandidate(const SISchedCandidate &Cand) { in traceCandidate()
189 void SIScheduleBlock::tryCandidateTopDown(SISchedCandidate &Cand, in tryCandidateTopDown()
1518 bool SIScheduleBlockScheduler::tryCandidateLatency(SIBlockSchedCandidate &Cand, in tryCandidateLatency()
1543 bool SIScheduleBlockScheduler::tryCandidateRegUsage(SIBlockSchedCandidate &Cand, in tryCandidateRegUsage()
1566 SIBlockSchedCandidate Cand; in pickBlock() local
H A DGCNSchedStrategy.cpp164 void GCNSchedStrategy::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate()
290 SchedCandidate &Cand, in pickNodeFromQueue()
388 SchedCandidate Cand = BotCand; in pickNodeBidirectional() local
486 bool GCNMaxILPSchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate()
H A DGCNMinRegStrategy.cpp123 auto &Cand = *I++; in findMax() local
H A DAMDGPUIGroupLP.cpp2115 SUnit *Cand = nullptr; in applyIGLPStrategy() local
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaOverload.cpp1647 for (OverloadCandidateSet::iterator Cand = Conversions.begin(); in TryUserDefinedConversion() local
5010 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(); in FindConversionForRefInit() local
9976 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(), in AddArgumentDependentLookupCandidates() local
10680 [](OverloadCandidate &Cand) { return &Cand; }); in BestViableFunction()
10696 llvm::any_of(Candidates, [&](OverloadCandidate *Cand) { in BestViableFunction()
10703 auto IsWrongSideCandidate = [&](OverloadCandidate *Cand) { in BestViableFunction()
10715 for (auto *Cand : Candidates) { in BestViableFunction() local
10745 for (auto *Cand : Candidates) { in BestViableFunction() local
11120 static void DiagnoseBadConversion(Sema &S, OverloadCandidate *Cand, in DiagnoseBadConversion()
11360 static bool CheckArityMismatch(Sema &S, OverloadCandidate *Cand, in CheckArityMismatch()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DAMDGPU.cpp42 RocmInstallationDetector::findSPACKPackage(const Candidate &Cand, in findSPACKPackage()
189 for (auto Cand : ROCmSearchDirs) { in getInstallationPathCandidates() local
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp841 populateEHOperandBundle(VPCandidateInfo &Cand, in populateEHOperandBundle()
993 for (VPCandidateInfo Cand : FuncInfo.ValueSites[Kind]) { in instrumentOneFunc() local
H A DInstrProfiling.cpp525 for (auto &Cand : LoopToCandidates[&L]) { in run() local
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp635 BasicBlock *Cand = OutliningInfo->NonReturnBlock; in computeOutliningInfo() local
H A DIROutliner.cpp1181 IRSimilarityCandidate &Cand = *Region.Candidate; in getGVNForPHINode() local
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenRegisters.cpp494 CodeGenRegister *Cand = const_cast<CodeGenRegister *>(Leads[i]); in computeSecondarySubRegs() local
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DTextNodeDumper.cpp1310 if (const VarDecl *Cand = Node->getNRVOCandidate()) { in VisitReturnStmt() local
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMLoadStoreOptimizer.cpp861 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate()

12