| /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/lib/CodeGen/ |
| D | RegAllocGreedy.cpp | 259 void growRegion(GlobalSplitCandidate &Cand);
778 void RAGreedy::growRegion(GlobalSplitCandidate &Cand) { in growRegion() argument
781 SmallVectorImpl<unsigned> &ActiveBlocks = Cand.ActiveBlocks; in growRegion()
814 if (Cand.PhysReg) in growRegion()
815 addThroughConstraints(Cand.Intf, NewBlocks); in growRegion()
835 bool RAGreedy::calcCompactRegion(GlobalSplitCandidate &Cand) { in calcCompactRegion() argument
841 Cand.reset(IntfCache, 0); in calcCompactRegion()
847 SpillPlacer->prepare(Cand.LiveBundles); in calcCompactRegion()
851 if (!addSplitConstraints(Cand.Intf, Cost)) { in calcCompactRegion()
856 growRegion(Cand); 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/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/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/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()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonBitSimplify.cpp | 2738 std::vector<LoopCand> Cand; in runOnMachineFunction() local
2765 Cand.push_back(LoopCand(&B, PB, EB)); in runOnMachineFunction()
2769 for (auto &C : Cand) in runOnMachineFunction()
|