Home
last modified time | relevance | path

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

/external/llvm/lib/Transforms/Scalar/
DLoopLoadElimination.cpp102 const StoreToLoadForwardingCandidate &Cand) { in operator <<()
230 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local
256 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores()
376 propagateStoredValueToLoadUsers(const StoreToLoadForwardingCandidate &Cand, in propagateStoredValueToLoadUsers()
450 for (const StoreToLoadForwardingCandidate Cand : StoreToLoadDependences) { in processLoop() local
515 for (const auto &Cand : Candidates) in processLoop() local
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/
DLoopLoadElimination.cpp130 const StoreToLoadForwardingCandidate &Cand) { in operator <<()
260 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local
286 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores()
409 propagateStoredValueToLoadUsers(const StoreToLoadForwardingCandidate &Cand, in propagateStoredValueToLoadUsers()
485 for (const StoreToLoadForwardingCandidate Cand : StoreToLoadDependences) { in processLoop() local
557 for (const auto &Cand : Candidates) in processLoop() local
DGVNSink.cpp741 SinkingInstructionCandidate Cand; in analyzeInstructionForSinking() local
785 auto Cand = analyzeInstructionForSinking(LRI, InstNum, MemoryInstNum, in sinkBB() local
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/
DGCNSchedStrategy.cpp62 void GCNMaxOccupancySchedStrategy::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate()
145 SchedCandidate &Cand) { in pickNodeFromQueue()
215 SchedCandidate Cand; in pickNodeBidirectional() local
DSIMachineScheduler.cpp162 SISchedulerCandidate &Cand, in tryLess()
179 SISchedulerCandidate &Cand, in tryGreater()
204 void SIScheduleBlock::traceCandidate(const SISchedCandidate &Cand) { in traceCandidate()
211 void SIScheduleBlock::tryCandidateTopDown(SISchedCandidate &Cand, in tryCandidateTopDown()
1571 bool SIScheduleBlockScheduler::tryCandidateLatency(SIBlockSchedCandidate &Cand, in tryCandidateLatency()
1596 bool SIScheduleBlockScheduler::tryCandidateRegUsage(SIBlockSchedCandidate &Cand, in tryCandidateRegUsage()
1619 SIBlockSchedCandidate Cand; in pickBlock() local
DGCNMinRegStrategy.cpp130 auto &Cand = *I++; in findMax() local
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DRegAllocGreedy.cpp778 void RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion()
835 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion()
895 float RAGreedy::calcGlobalSplitCost(GlobalSplitCandidate &Cand) { in calcGlobalSplitCost()
969 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
978 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
1018 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
1026 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
1125 GlobalSplitCandidate &Cand = GlobalCand[NumCands]; in tryRegionSplit() local
1183 GlobalSplitCandidate &Cand = GlobalCand[BestCand]; in tryRegionSplit() local
1195 GlobalSplitCandidate &Cand = GlobalCand.front(); in tryRegionSplit() local
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DRegAllocGreedy.cpp1281 void RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion()
1338 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion()
1447 GlobalSplitCandidate &Cand, in splitCanCauseEvictionChain()
1507 GlobalSplitCandidate &Cand, in splitCanCauseLocalSpill()
1546 BlockFrequency RAGreedy::calcGlobalSplitCost(GlobalSplitCandidate &Cand, in calcGlobalSplitCost()
1665 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
1674 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
1714 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
1722 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
1868 GlobalSplitCandidate &Cand = GlobalCand[NumCands]; in calculateRegionSplitCost() local
[all …]
DMachineScheduler.cpp2495 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate()
2552 GenericSchedulerBase::SchedCandidate &Cand, in tryLess()
2568 GenericSchedulerBase::SchedCandidate &Cand, in tryGreater()
2583 GenericSchedulerBase::SchedCandidate &Cand, in tryLatency()
2613 static void tracePick(const GenericSchedulerBase::SchedCandidate &Cand) { in tracePick()
2765 GenericSchedulerBase::SchedCandidate &Cand, in tryPressure()
2834 void GenericScheduler::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate()
2881 void GenericScheduler::tryCandidate(SchedCandidate &Cand, in tryCandidate()
2992 SchedCandidate &Cand) { in pickNodeFromQueue()
3080 SchedCandidate Cand = BotCand; in pickNodeBidirectional() local
[all …]
/external/llvm/lib/CodeGen/
DRegAllocGreedy.cpp1044 void RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion()
1101 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion()
1161 BlockFrequency RAGreedy::calcGlobalSplitCost(GlobalSplitCandidate &Cand) { in calcGlobalSplitCost()
1237 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
1246 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
1286 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local
1294 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local
1416 GlobalSplitCandidate &Cand = GlobalCand[NumCands]; in calculateRegionSplitCost() local
1478 GlobalSplitCandidate &Cand = GlobalCand[BestCand]; in doRegionSplit() local
1490 GlobalSplitCandidate &Cand = GlobalCand.front(); in doRegionSplit() local
DMachineScheduler.cpp2415 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate()
2471 GenericSchedulerBase::SchedCandidate &Cand, in tryLess()
2487 GenericSchedulerBase::SchedCandidate &Cand, in tryGreater()
2502 GenericSchedulerBase::SchedCandidate &Cand, in tryLatency()
2531 static void tracePick(const GenericSchedulerBase::SchedCandidate &Cand) { in tracePick()
2680 GenericSchedulerBase::SchedCandidate &Cand, in tryPressure()
2748 void GenericScheduler::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate()
2795 void GenericScheduler::tryCandidate(SchedCandidate &Cand, in tryCandidate()
2914 SchedCandidate &Cand) { in pickNodeFromQueue()
3002 SchedCandidate Cand = BotCand; in pickNodeBidirectional() local
[all …]
/external/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.cpp144 SISchedulerCandidate &Cand, in tryLess()
161 SISchedulerCandidate &Cand, in tryGreater()
185 void SIScheduleBlock::traceCandidate(const SISchedCandidate &Cand) { in traceCandidate()
192 void SIScheduleBlock::tryCandidateTopDown(SISchedCandidate &Cand, in tryCandidateTopDown()
1409 bool SIScheduleBlockScheduler::tryCandidateLatency(SIBlockSchedCandidate &Cand, in tryCandidateLatency()
1434 bool SIScheduleBlockScheduler::tryCandidateRegUsage(SIBlockSchedCandidate &Cand, in tryCandidateRegUsage()
1457 SIBlockSchedCandidate Cand; in pickBlock() local
/external/clang/lib/Sema/
DSemaOverload.cpp1238 for (OverloadCandidateSet::iterator Cand = Conversions.begin(); in TryUserDefinedConversion() local
4267 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(); in FindConversionForRefInit() local
8463 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(), in AddArgumentDependentLookupCandidates() local
8771 [](OverloadCandidate &Cand) { return &Cand; }); in BestViableFunction()
8783 llvm::any_of(Candidates, [&](OverloadCandidate *Cand) { in BestViableFunction()
8789 auto IsWrongSideCandidate = [&](OverloadCandidate *Cand) { in BestViableFunction()
8802 for (auto *Cand : Candidates) in BestViableFunction() local
8816 for (auto *Cand : Candidates) { in BestViableFunction() local
9057 static void DiagnoseBadConversion(Sema &S, OverloadCandidate *Cand, in DiagnoseBadConversion()
9295 static bool CheckArityMismatch(Sema &S, OverloadCandidate *Cand, in CheckArityMismatch()
[all …]
DSemaLookup.cpp2954 DeclAccessPair Cand = DeclAccessPair::make(CandDecl, AS_public); in LookupSpecialMember() local
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/PowerPC/
DPPCBranchCoalescing.cpp238 bool PPCBranchCoalescing::canCoalesceBranch(CoalescingCandidateInfo &Cand) { in canCoalesceBranch()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Instrumentation/
DInstrProfiling.cpp255 for (auto &Cand : LoopToCandidates[&L]) { in run() local
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/IPO/
DPartialInlining.cpp667 BasicBlock *Cand = OutliningInfo->NonReturnBlock; in computeOutliningInfo() local
/external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/
DCodeGenRegisters.cpp483 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); in computeSecondarySubRegs() local
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/ARM/
DARMLoadStoreOptimizer.cpp845 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate()
/external/llvm/lib/Target/ARM/
DARMLoadStoreOptimizer.cpp814 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate()
/external/llvm/utils/TableGen/
DCodeGenRegisters.cpp421 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); in computeSecondarySubRegs() local
/external/llvm/lib/Target/Hexagon/
DHexagonBitSimplify.cpp2738 std::vector<LoopCand> Cand; in runOnMachineFunction() local
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
DHexagonBitSimplify.cpp3319 std::vector<LoopCand> Cand; in runOnMachineFunction() local