| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/ |
| D | PPCMachineScheduler.cpp | 19 bool PPCPreRASchedStrategy::biasAddiLoadCandidate(SchedCandidate &Cand, in biasAddiLoadCandidate() 45 void PPCPreRASchedStrategy::tryCandidate(SchedCandidate &Cand, in tryCandidate()
|
| D | PPCBranchCoalescing.cpp | 234 bool PPCBranchCoalescing::canCoalesceBranch(CoalescingCandidateInfo &Cand) { in canCoalesceBranch()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopLoadElimination.cpp | 102 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-10.0/llvm/lib/Transforms/Scalar/ |
| D | LoopLoadElimination.cpp | 135 const StoreToLoadForwardingCandidate &Cand) { in operator <<() 266 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local 292 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores() 415 propagateStoredValueToLoadUsers(const StoreToLoadForwardingCandidate &Cand, in propagateStoredValueToLoadUsers() 492 for (const StoreToLoadForwardingCandidate &Cand : StoreToLoadDependences) { in processLoop() local 575 for (const auto &Cand : Candidates) in processLoop() local
|
| D | ConstantHoisting.cpp | 375 ConstPtrUnionType Cand = ConstInt; in collectConstantCandidates() local 423 ConstPtrUnionType Cand = ConstExpr; in collectConstantCandidates() local
|
| D | GVNSink.cpp | 751 SinkingInstructionCandidate Cand; in analyzeInstructionForSinking() local 795 auto Cand = analyzeInstructionForSinking(LRI, InstNum, MemoryInstNum, in sinkBB() local
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
| D | GCNSchedStrategy.cpp | 62 void GCNMaxOccupancySchedStrategy::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate() 145 SchedCandidate &Cand) { in pickNodeFromQueue() 234 SchedCandidate Cand; in pickNodeBidirectional() local
|
| D | SIMachineScheduler.cpp | 161 SISchedulerCandidate &Cand, in tryLess() 178 SISchedulerCandidate &Cand, in tryGreater() 203 void SIScheduleBlock::traceCandidate(const SISchedCandidate &Cand) { in traceCandidate() 210 void SIScheduleBlock::tryCandidateTopDown(SISchedCandidate &Cand, in tryCandidateTopDown() 1560 bool SIScheduleBlockScheduler::tryCandidateLatency(SIBlockSchedCandidate &Cand, in tryCandidateLatency() 1585 bool SIScheduleBlockScheduler::tryCandidateRegUsage(SIBlockSchedCandidate &Cand, in tryCandidateRegUsage() 1608 SIBlockSchedCandidate Cand; in pickBlock() local
|
| D | GCNMinRegStrategy.cpp | 129 auto &Cand = *I++; in findMax() local
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | RegAllocGreedy.cpp | 1312 bool RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion() 1371 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion() 1484 GlobalSplitCandidate &Cand, in splitCanCauseEvictionChain() 1544 GlobalSplitCandidate &Cand, in splitCanCauseLocalSpill() 1583 BlockFrequency RAGreedy::calcGlobalSplitCost(GlobalSplitCandidate &Cand, in calcGlobalSplitCost() 1702 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local 1711 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local 1751 GlobalSplitCandidate &Cand = GlobalCand[CandIn]; in splitAroundRegion() local 1759 GlobalSplitCandidate &Cand = GlobalCand[CandOut]; in splitAroundRegion() local 1905 GlobalSplitCandidate &Cand = GlobalCand[NumCands]; in calculateRegionSplitCost() local [all …]
|
| D | MachineScheduler.cpp | 2594 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate() 2651 GenericSchedulerBase::SchedCandidate &Cand, in tryLess() 2667 GenericSchedulerBase::SchedCandidate &Cand, in tryGreater() 2682 GenericSchedulerBase::SchedCandidate &Cand, in tryLatency() 2712 static void tracePick(const GenericSchedulerBase::SchedCandidate &Cand) { in tracePick() 2866 GenericSchedulerBase::SchedCandidate &Cand, in tryPressure() 2950 void GenericScheduler::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate() 2997 void GenericScheduler::tryCandidate(SchedCandidate &Cand, in tryCandidate() 3108 SchedCandidate &Cand) { in pickNodeFromQueue() 3196 SchedCandidate Cand = BotCand; in pickNodeBidirectional() local [all …]
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocGreedy.cpp | 1044 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
|
| D | MachineScheduler.cpp | 2415 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/ |
| D | SIMachineScheduler.cpp | 144 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/ |
| D | SemaOverload.cpp | 1238 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 …]
|
| D | SemaLookup.cpp | 2954 DeclAccessPair Cand = DeclAccessPair::make(CandDecl, AS_public); in LookupSpecialMember() local
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/ |
| D | InstrProfiling.cpp | 266 for (auto &Cand : LoopToCandidates[&L]) { in run() local
|
| D | PGOInstrumentation.cpp | 848 for (VPCandidateInfo Cand : FuncInfo.ValueSites[Kind]) { in instrumentOneFunc() local
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/ |
| D | PartialInlining.cpp | 677 BasicBlock *Cand = OutliningInfo->NonReturnBlock; in computeOutliningInfo() local
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenRegisters.cpp | 421 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); in computeSecondarySubRegs() local
|
| /external/llvm/lib/Target/ARM/ |
| D | ARMLoadStoreOptimizer.cpp | 814 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARM/ |
| D | ARMLoadStoreOptimizer.cpp | 856 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonBitSimplify.cpp | 2738 std::vector<LoopCand> Cand; in runOnMachineFunction() local
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonBitSimplify.cpp | 3324 std::vector<LoopCand> Cand; in runOnMachineFunction() local
|