| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopLoadElimination.cpp | 102 const StoreToLoadForwardingCandidate &Cand) { in operator <<() argument
103 OS << *Cand.Store << " -->\n"; in operator <<()
104 OS.indent(2) << *Cand.Load << "\n"; in operator <<()
230 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local
235 LoadToSingleCand.insert(std::make_pair(Cand.Load, &Cand)); in removeDependencesFromMultipleStores()
245 if (Cand.Store->getParent() == OtherCand->Store->getParent() && in removeDependencesFromMultipleStores()
246 Cand.isDependenceDistanceOfOne(PSE, L) && in removeDependencesFromMultipleStores()
249 if (getInstrIndex(OtherCand->Store) < getInstrIndex(Cand.Store)) in removeDependencesFromMultipleStores()
250 OtherCand = &Cand; in removeDependencesFromMultipleStores()
256 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores() argument
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| D | LoopLoadElimination.cpp | 130 const StoreToLoadForwardingCandidate &Cand) { in operator <<() argument
131 OS << *Cand.Store << " -->\n"; in operator <<()
132 OS.indent(2) << *Cand.Load << "\n"; in operator <<()
260 for (const auto &Cand : Candidates) { in removeDependencesFromMultipleStores() local
265 LoadToSingleCand.insert(std::make_pair(Cand.Load, &Cand)); in removeDependencesFromMultipleStores()
275 if (Cand.Store->getParent() == OtherCand->Store->getParent() && in removeDependencesFromMultipleStores()
276 Cand.isDependenceDistanceOfOne(PSE, L) && in removeDependencesFromMultipleStores()
279 if (getInstrIndex(OtherCand->Store) < getInstrIndex(Cand.Store)) in removeDependencesFromMultipleStores()
280 OtherCand = &Cand; in removeDependencesFromMultipleStores()
286 Candidates.remove_if([&](const StoreToLoadForwardingCandidate &Cand) { in removeDependencesFromMultipleStores() argument
[all …]
|
| D | GVNSink.cpp | 741 SinkingInstructionCandidate Cand; in analyzeInstructionForSinking() local
742 Cand.NumInstructions = ++InstNum; in analyzeInstructionForSinking()
743 Cand.NumMemoryInsts = MemoryInstNum; in analyzeInstructionForSinking()
744 Cand.NumBlocks = ActivePreds.size(); in analyzeInstructionForSinking()
745 Cand.NumPHIs = NeededPHIs.size(); in analyzeInstructionForSinking()
747 Cand.Blocks.push_back(C); in analyzeInstructionForSinking()
749 return Cand; in analyzeInstructionForSinking()
785 auto Cand = analyzeInstructionForSinking(LRI, InstNum, MemoryInstNum, in sinkBB() local
787 if (!Cand) in sinkBB()
789 Cand->calculateCost(NumOrigPHIs, Preds.size()); in sinkBB()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/ |
| D | GCNSchedStrategy.cpp | 62 void GCNMaxOccupancySchedStrategy::initCandidate(SchedCandidate &Cand, SUnit *SU, in initCandidate() argument
68 Cand.SU = SU; in initCandidate()
69 Cand.AtTop = AtTop; in initCandidate()
112 Cand.RPDelta.Excess = PressureChange(SRI->getVGPRPressureSet()); in initCandidate()
113 Cand.RPDelta.Excess.setUnitInc(NewVGPRPressure - VGPRExcessLimit); in initCandidate()
117 Cand.RPDelta.Excess = PressureChange(SRI->getSGPRPressureSet()); in initCandidate()
118 Cand.RPDelta.Excess.setUnitInc(NewSGPRPressure - SGPRExcessLimit); in initCandidate()
131 Cand.RPDelta.CriticalMax = PressureChange(SRI->getSGPRPressureSet()); in initCandidate()
132 Cand.RPDelta.CriticalMax.setUnitInc(SGPRDelta); in initCandidate()
134 Cand.RPDelta.CriticalMax = PressureChange(SRI->getVGPRPressureSet()); in initCandidate()
[all …]
|
| D | SIMachineScheduler.cpp | 162 SISchedulerCandidate &Cand, in tryLess() argument
169 if (Cand.Reason > Reason) in tryLess()
170 Cand.Reason = Reason; in tryLess()
173 Cand.setRepeat(Reason); in tryLess()
179 SISchedulerCandidate &Cand, in tryGreater() argument
186 if (Cand.Reason > Reason) in tryGreater()
187 Cand.Reason = Reason; in tryGreater()
190 Cand.setRepeat(Reason); in tryGreater()
204 void SIScheduleBlock::traceCandidate(const SISchedCandidate &Cand) { in traceCandidate() argument
206 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
[all …]
|
| D | SIMachineScheduler.h | 206 void tryCandidateTopDown(SISchedCandidate &Cand, SISchedCandidate &TryCand);
207 void tryCandidateBottomUp(SISchedCandidate &Cand, SISchedCandidate &TryCand);
209 void traceCandidate(const SISchedCandidate &Cand);
391 bool tryCandidateLatency(SIBlockSchedCandidate &Cand,
393 bool tryCandidateRegUsage(SIBlockSchedCandidate &Cand,
|
| D | GCNSchedStrategy.h | 37 SchedCandidate &Cand);
39 void initCandidate(SchedCandidate &Cand, SUnit *SU,
|
| D | GCNMinRegStrategy.cpp | 130 auto &Cand = *I++; in findMax() local
131 RQ.remove(Cand); in findMax()
132 RQ.push_front(Cand); in findMax()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/PowerPC/ |
| D | PPCBranchCoalescing.cpp | 159 bool canCoalesceBranch(CoalescingCandidateInfo &Cand);
238 bool PPCBranchCoalescing::canCoalesceBranch(CoalescingCandidateInfo &Cand) { in canCoalesceBranch() argument
240 << Cand.BranchBlock->getNumber() << " can be coalesced:"); in canCoalesceBranch()
243 if (TII->analyzeBranch(*Cand.BranchBlock, Cand.BranchTargetBlock, FalseMBB, in canCoalesceBranch()
244 Cand.Cond)) { in canCoalesceBranch()
249 for (auto &I : Cand.BranchBlock->terminators()) { in canCoalesceBranch()
274 if (Cand.BranchBlock->isEHPad() || Cand.BranchBlock->hasEHPadSuccessor()) { in canCoalesceBranch()
281 if (!Cand.BranchTargetBlock || FalseMBB || in canCoalesceBranch()
282 !Cand.BranchBlock->isSuccessor(Cand.BranchTargetBlock)) { in canCoalesceBranch()
288 if (Cand.BranchBlock->succ_size() != 2) { in canCoalesceBranch()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 2495 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate() argument
2499 switch (Cand.Reason) { in traceCandidate()
2503 P = Cand.RPDelta.Excess; in traceCandidate()
2506 P = Cand.RPDelta.CriticalMax; in traceCandidate()
2509 P = Cand.RPDelta.CurrentMax; in traceCandidate()
2512 ResIdx = Cand.Policy.ReduceResIdx; in traceCandidate()
2515 ResIdx = Cand.Policy.DemandResIdx; in traceCandidate()
2518 Latency = Cand.SU->getDepth(); in traceCandidate()
2521 Latency = Cand.SU->getHeight(); in traceCandidate()
2524 Latency = Cand.SU->getHeight(); in traceCandidate()
[all …]
|
| D | RegAllocGreedy.cpp | 453 void growRegion(GlobalSplitCandidate &Cand);
454 bool splitCanCauseEvictionChain(unsigned Evictee, GlobalSplitCandidate &Cand,
458 GlobalSplitCandidate &Cand, unsigned BBNumber,
1281 void RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion() argument
1284 SmallVectorImpl<unsigned> &ActiveBlocks = Cand.ActiveBlocks; in growRegion()
1317 if (Cand.PhysReg) in growRegion()
1318 addThroughConstraints(Cand.Intf, NewBlocks); in growRegion()
1338 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion() argument
1344 Cand.reset(IntfCache, 0); in calcCompactRegion()
1350 SpillPlacer->prepare(Cand.LiveBundles); in calcCompactRegion()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 2415 void GenericSchedulerBase::traceCandidate(const SchedCandidate &Cand) { in traceCandidate() argument
2419 switch (Cand.Reason) { in traceCandidate()
2423 P = Cand.RPDelta.Excess; in traceCandidate()
2426 P = Cand.RPDelta.CriticalMax; in traceCandidate()
2429 P = Cand.RPDelta.CurrentMax; in traceCandidate()
2432 ResIdx = Cand.Policy.ReduceResIdx; in traceCandidate()
2435 ResIdx = Cand.Policy.DemandResIdx; in traceCandidate()
2438 Latency = Cand.SU->getDepth(); in traceCandidate()
2441 Latency = Cand.SU->getHeight(); in traceCandidate()
2444 Latency = Cand.SU->getHeight(); in traceCandidate()
[all …]
|
| D | RegAllocGreedy.cpp | 352 void growRegion(GlobalSplitCandidate &Cand);
1044 void RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion() argument
1047 SmallVectorImpl<unsigned> &ActiveBlocks = Cand.ActiveBlocks; in growRegion()
1080 if (Cand.PhysReg) in growRegion()
1081 addThroughConstraints(Cand.Intf, NewBlocks); in growRegion()
1101 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion() argument
1107 Cand.reset(IntfCache, 0); in calcCompactRegion()
1113 SpillPlacer->prepare(Cand.LiveBundles); in calcCompactRegion()
1117 if (!addSplitConstraints(Cand.Intf, Cost)) { in calcCompactRegion()
1122 growRegion(Cand); in calcCompactRegion()
[all …]
|
| /external/llvm/lib/Target/AMDGPU/ |
| D | SIMachineScheduler.cpp | 144 SISchedulerCandidate &Cand, in tryLess() argument
151 if (Cand.Reason > Reason) in tryLess()
152 Cand.Reason = Reason; in tryLess()
155 Cand.setRepeat(Reason); in tryLess()
161 SISchedulerCandidate &Cand, in tryGreater() argument
168 if (Cand.Reason > Reason) in tryGreater()
169 Cand.Reason = Reason; in tryGreater()
172 Cand.setRepeat(Reason); in tryGreater()
185 void SIScheduleBlock::traceCandidate(const SISchedCandidate &Cand) { in traceCandidate() argument
187 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
[all …]
|
| D | SIMachineScheduler.h | 199 void tryCandidateTopDown(SISchedCandidate &Cand, SISchedCandidate &TryCand);
200 void tryCandidateBottomUp(SISchedCandidate &Cand, SISchedCandidate &TryCand);
202 void traceCandidate(const SISchedCandidate &Cand);
382 bool tryCandidateLatency(SIBlockSchedCandidate &Cand,
384 bool tryCandidateRegUsage(SIBlockSchedCandidate &Cand,
|
| /external/clang/lib/Sema/ |
| D | SemaOverload.cpp | 1238 for (OverloadCandidateSet::iterator Cand = Conversions.begin(); in TryUserDefinedConversion() local
1239 Cand != Conversions.end(); ++Cand) in TryUserDefinedConversion()
1240 if (Cand->Viable) in TryUserDefinedConversion()
1241 ICS.Ambiguous.addConversion(Cand->FoundDecl, Cand->Function); in TryUserDefinedConversion()
4267 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(); in FindConversionForRefInit() local
4268 Cand != CandidateSet.end(); ++Cand) in FindConversionForRefInit()
4269 if (Cand->Viable) in FindConversionForRefInit()
4270 ICS.Ambiguous.addConversion(Cand->FoundDecl, Cand->Function); in FindConversionForRefInit()
8463 for (OverloadCandidateSet::iterator Cand = CandidateSet.begin(), in AddArgumentDependentLookupCandidates() local
8465 Cand != CandEnd; ++Cand) in AddArgumentDependentLookupCandidates()
[all …]
|
| D | SemaLookup.cpp | 2954 DeclAccessPair Cand = DeclAccessPair::make(CandDecl, AS_public); in LookupSpecialMember() local
2955 auto CtorInfo = getConstructorInfo(Cand); in LookupSpecialMember()
2956 if (CXXMethodDecl *M = dyn_cast<CXXMethodDecl>(Cand->getUnderlyingDecl())) { in LookupSpecialMember()
2958 AddMethodCandidate(M, Cand, RD, ThisTy, Classification, in LookupSpecialMember()
2964 AddOverloadCandidate(M, Cand, llvm::makeArrayRef(&Arg, NumArgs), OCS, in LookupSpecialMember()
2967 dyn_cast<FunctionTemplateDecl>(Cand->getUnderlyingDecl())) { in LookupSpecialMember()
2970 Tmpl, Cand, RD, nullptr, ThisTy, Classification, in LookupSpecialMember()
2978 Tmpl, Cand, nullptr, llvm::makeArrayRef(&Arg, NumArgs), OCS, true); in LookupSpecialMember()
2980 assert(isa<UsingDecl>(Cand.getDecl()) && in LookupSpecialMember()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 896 void traceCandidate(const SchedCandidate &Cand);
903 GenericSchedulerBase::SchedCandidate &Cand,
907 GenericSchedulerBase::SchedCandidate &Cand,
910 GenericSchedulerBase::SchedCandidate &Cand,
915 GenericSchedulerBase::SchedCandidate &Cand,
984 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop,
988 virtual void tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand,
1050 void tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand);
1052 void pickNodeFromQueue(SchedCandidate &Cand);
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 872 void traceCandidate(const SchedCandidate &Cand);
931 void initCandidate(SchedCandidate &Cand, SUnit *SU, bool AtTop,
935 void tryCandidate(SchedCandidate &Cand,
995 void tryCandidate(SchedCandidate &Cand, SchedCandidate &TryCand);
997 void pickNodeFromQueue(SchedCandidate &Cand);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/IPO/ |
| D | PartialInlining.cpp | 667 BasicBlock *Cand = OutliningInfo->NonReturnBlock; in computeOutliningInfo() local
668 if (succ_size(Cand) != 2) in computeOutliningInfo()
671 if (HasNonEntryPred(Cand)) in computeOutliningInfo()
674 BasicBlock *Succ1 = *succ_begin(Cand); in computeOutliningInfo()
675 BasicBlock *Succ2 = *(succ_begin(Cand) + 1); in computeOutliningInfo()
682 if (NonReturnBlock->getSinglePredecessor() != Cand) in computeOutliningInfo()
686 OutliningInfo->Entries.push_back(Cand); in computeOutliningInfo()
688 OutliningInfo->ReturnBlockPreds.push_back(Cand); in computeOutliningInfo()
689 Entries.insert(Cand); in computeOutliningInfo()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Instrumentation/ |
| D | InstrProfiling.cpp | 255 for (auto &Cand : LoopToCandidates[&L]) { in run() local
259 Value *InitVal = ConstantInt::get(Cand.first->getType(), 0); in run()
261 PGOCounterPromoterHelper Promoter(Cand.first, Cand.second, SSA, InitVal, in run()
264 Promoter.run(SmallVector<Instruction *, 2>({Cand.first, Cand.second})); in run()
|
| /external/llvm/lib/Target/ARM/ |
| D | ARMLoadStoreOptimizer.cpp | 162 MachineInstr *MergeOpsUpdate(const MergeCandidate &Cand);
814 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate() argument
815 const MachineInstr *First = Cand.Instrs.front(); in MergeOpsUpdate()
823 for (const MachineInstr *MI : Cand.Instrs) { in MergeOpsUpdate()
854 MachineInstr *LatestMI = Cand.Instrs[Cand.LatestMIIdx]; in MergeOpsUpdate()
864 if (Cand.CanMergeToLSDouble) in MergeOpsUpdate()
867 if (!Merged && Cand.CanMergeToLSMulti) in MergeOpsUpdate()
875 iterator EarliestI(Cand.Instrs[Cand.EarliestMIIdx]); in MergeOpsUpdate()
884 for (MachineInstr *MI : Cand.Instrs) in MergeOpsUpdate()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/ARM/ |
| D | ARMLoadStoreOptimizer.cpp | 184 MachineInstr *MergeOpsUpdate(const MergeCandidate &Cand);
845 MachineInstr *ARMLoadStoreOpt::MergeOpsUpdate(const MergeCandidate &Cand) { in MergeOpsUpdate() argument
846 const MachineInstr *First = Cand.Instrs.front(); in MergeOpsUpdate()
854 for (const MachineInstr *MI : Cand.Instrs) { in MergeOpsUpdate()
886 MachineInstr *LatestMI = Cand.Instrs[Cand.LatestMIIdx]; in MergeOpsUpdate()
896 if (Cand.CanMergeToLSDouble) in MergeOpsUpdate()
899 if (!Merged && Cand.CanMergeToLSMulti) in MergeOpsUpdate()
907 iterator EarliestI(Cand.Instrs[Cand.EarliestMIIdx]); in MergeOpsUpdate()
916 for (MachineInstr *MI : Cand.Instrs) in MergeOpsUpdate()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/ |
| D | CodeGenRegisters.cpp | 483 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); in computeSecondarySubRegs() local
485 if (Cand == this || getSubRegIndex(Cand)) in computeSecondarySubRegs()
488 assert(!Cand->ExplicitSubRegs.empty() && in computeSecondarySubRegs()
490 if (Cand->ExplicitSubRegs.size() == 1) in computeSecondarySubRegs()
495 assert(Cand->ExplicitSubRegs[0] == SubReg && "LeadingSuperRegs correct"); in computeSecondarySubRegs()
497 for (CodeGenRegister *SubReg : Cand->ExplicitSubRegs) { in computeSecondarySubRegs()
519 std::make_pair(Concat, Cand); in computeSecondarySubRegs()
527 SubReg2Idx.insert(std::make_pair(Cand, Concat)); in computeSecondarySubRegs()
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenRegisters.cpp | 421 CodeGenRegister *Cand = const_cast<CodeGenRegister*>(Leads[i]); in computeSecondarySubRegs() local
423 if (Cand == this || getSubRegIndex(Cand)) in computeSecondarySubRegs()
429 assert(!Cand->ExplicitSubRegs.empty() && in computeSecondarySubRegs()
431 for (unsigned j = 1, e = Cand->ExplicitSubRegs.size(); j != e; ++j) { in computeSecondarySubRegs()
432 if (CodeGenSubRegIndex *Idx = getSubRegIndex(Cand->ExplicitSubRegs[j])) in computeSecondarySubRegs()
448 NewSubRegs.push_back(std::make_pair(Concat, Cand)); in computeSecondarySubRegs()
|