|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/CodeGen/ScheduleDAG.h 432 for (const SDep &Pred : Preds)
631 return Node->Preds[Operand].getSUnit();
645 return SUnitIterator(N, (unsigned)N->Preds.size());
659 return Node->Preds[Operand];
lib/CodeGen/AggressiveAntiDepBreaker.cpp 267 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
267 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
283 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
283 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
894 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
895 PE = PathSU->Preds.end(); P != PE; ++P) {
903 for (SUnit::const_pred_iterator P = PathSU->Preds.begin(),
904 PE = PathSU->Preds.end(); P != PE; ++P) {
lib/CodeGen/CriticalAntiDepBreaker.cpp 149 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
149 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
578 for (SUnit::const_pred_iterator P = CriticalPathSU->Preds.begin(),
579 PE = CriticalPathSU->Preds.end(); P != PE; ++P)
lib/CodeGen/LatencyPriorityQueue.cpp 58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
58 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
lib/CodeGen/MachinePipeliner.cpp 820 for (auto &PI : I.Preds) {
871 for (SUnit::pred_iterator P = I.Preds.begin(), E = I.Preds.end(); P != E;
871 for (SUnit::pred_iterator P = I.Preds.begin(), E = I.Preds.end(); P != E;
881 for (auto &P : LastSU->Preds)
1117 for (SUnit::pred_iterator IP = SU->Preds.begin(), EP = SU->Preds.end();
1117 for (SUnit::pred_iterator IP = SU->Preds.begin(), EP = SU->Preds.end();
1174 for (auto &PI : SUnits[i].Preds) {
1298 for (auto &Dep : SU.Preds) {
1383 for (SUnit::const_pred_iterator IP = SU->Preds.begin(),
1384 EP = SU->Preds.end();
1451 for (SUnit::pred_iterator PI = (*I)->Preds.begin(), PE = (*I)->Preds.end();
1451 for (SUnit::pred_iterator PI = (*I)->Preds.begin(), PE = (*I)->Preds.end();
1493 for (SUnit::const_pred_iterator PI = (*I)->Preds.begin(),
1494 PE = (*I)->Preds.end();
1524 for (auto &PI : Cur->Preds)
1747 for (auto &PI : SU->Preds) {
1881 for (const auto &I : maxHeight->Preds) {
1922 for (const auto &I : maxDepth->Preds) {
2353 for (const auto &PI : PrevSU->Preds)
2388 for (auto &P : SU->Preds)
2410 for (unsigned i = 0, e = (unsigned)SU->Preds.size(); i != e; ++i) {
2411 const SDep &Dep = SU->Preds[i];
2543 for (auto &P : SU->Preds) {
2703 for (SDep &PredEdge : SU->Preds) {
lib/CodeGen/MachineScheduler.cpp 683 for (SDep &Pred : SU->Preds)
1608 for (const SDep &Pred : SU.Preds) {
1785 for (const SDep &Pred : GlobalSU->Preds) {
3257 SmallVectorImpl<SDep> &Deps = isTop ? SU->Preds : SU->Succs;
3266 if (isTop ? DepSU->Succs.size() > 1 : DepSU->Preds.size() > 1)
3695 return (Node->Preds.size() > ViewMISchedCutoff
lib/CodeGen/MacroFusion.cpp 47 for (SDep &SI : SecondSU.Preds)
64 for (SDep &SI : SecondSU.Preds)
90 for (const SDep &SI : SecondSU.Preds) {
155 for (SDep &Dep : AnchorSU.Preds) {
lib/CodeGen/ScheduleDAG.cpp 109 for (SDep &PredDep : Preds) {
166 Preds.push_back(D);
177 SmallVectorImpl<SDep>::iterator I = llvm::find(Preds, D);
178 if (I == Preds.end())
187 Preds.erase(I);
239 for (SDep &PredDep : SU->Preds) {
272 for (const SDep &PredDep : Cur->Preds) {
329 SUnit::pred_iterator BestI = Preds.begin();
331 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E;
336 if (BestI != Preds.begin())
337 std::swap(*Preds.begin(), *BestI);
366 if (SU.Preds.size() > 0) {
368 for (const SDep &Dep : SU.Preds) {
500 for (const SDep &PredDep : SU->Preds) {
515 for (const SDep &PD : SU.Preds) {
656 for (int I = SU->Preds.size()-1; I >= 0; --I) {
657 const SUnit *Pred = SU->Preds[I].getSUnit();
709 for (const SDep &PredDep : TargetSU->Preds)
lib/CodeGen/ScheduleDAGInstrs.cpp 1274 for (const SDep &PredDep : SU->Preds) {
1411 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin()));
1425 return getCurr()->Preds.end();
lib/CodeGen/SelectionDAG/ResourcePriorityQueue.cpp 69 for (SDep &Pred : SU->Preds) {
153 for (SDep &Pred : SU->Preds)
212 for (const SDep &Pred : SU->Preds) {
498 for (SDep &Pred : SU->Preds) {
531 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU));
lib/CodeGen/SelectionDAG/ScheduleDAGFast.cpp 162 for (SDep &Pred : SU->Preds) {
282 for (SDep &Pred : SU->Preds) {
352 for (SDep &Pred : SU->Preds)
474 for (SDep &Pred : SU->Preds) {
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 556 for (SDep &Pred : SU->Preds) {
839 for (SDep &Pred : SU->Preds) {
1062 for (SDep &Pred : SU->Preds) {
1187 for (SDep &Pred : SU->Preds)
1355 for (SDep &Pred : SU->Preds) {
1960 for (unsigned P = Temp.PredsProcessed; P < TempSU->Preds.size(); ++P) {
1961 auto &Pred = TempSU->Preds[P];
1984 for (const SDep &Pred : TempSU->Preds) {
2087 for (const SDep &Pred : SU->Preds) {
2136 for (const SDep &Pred : SU->Preds) {
2179 for (const SDep &Pred : SU->Preds) {
2261 for (const SDep &Pred : SU->Preds) {
2347 for (const SDep &Pred : SU->Preds) {
2358 for (const SDep &Pred : SU->Preds) {
2417 for (const SDep &Pred : SU->Preds) {
2429 for (const SDep &Pred : SU->Preds) {
2447 for (const SDep &Pred : SU->Preds) {
2849 for (const SDep &SuccPred : SuccSU->Preds) {
2960 for (const SDep &Pred : SU.Preds)
2984 for (const SDep &Pred : SU.Preds)
lib/CodeGen/SelectionDAG/ScheduleDAGSDNodes.cpp 789 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
789 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
lib/CodeGen/SelectionDAG/ScheduleDAGVLIW.cpp 175 if (SUnits[i].Preds.empty()) {
lib/Target/AMDGPU/AMDGPUSubtarget.cpp 746 for (const SDep &SI : SU.Preds) {
801 for (const SDep &SI : SU->Preds)
lib/Target/AMDGPU/GCNILPSched.cpp 65 for (const SDep &Pred : SU->Preds) {
124 for (const SDep &Pred : SU->Preds) {
277 for (const auto &PredEdge : SU->Preds) {
lib/Target/AMDGPU/GCNMinRegStrategy.cpp 96 for (auto PDep : SDep.getSUnit()->Preds) {
189 for (const auto &P : S.getSUnit()->Preds) {
201 for (const auto &P : SU->Preds) {
lib/Target/AMDGPU/SIMachineScheduler.cpp 671 for (const auto &PredDep : SU.Preds) {
827 for (SDep& PredDep : SU->Preds) {
1020 if (SU->Preds.size() > 0 && !DAG->IsLowLatencySU[SU->NodeNum])
1251 for (SDep& PredDep : SU->Preds) {
1840 for (SDep& PredDep : SU->Preds) {
lib/Target/Hexagon/HexagonMachineScheduler.cpp 292 for (const SDep &PI : SU->Preds) {
525 for (auto &Pred : SU->Preds) {
652 for (const SDep &PI : SU->Preds)
706 for (const SDep &PI : SU->Preds) {
732 for (const auto &PI : SU->Preds) {
839 CurrSize = (*I)->Preds.size();
840 CandSize = Candidate.SU->Preds.size();
lib/Target/Hexagon/HexagonSubtarget.cpp 133 for (auto &D : SU.Preds)
162 for (SDep &PI : SI.getSUnit()->Preds) {
450 auto F = std::find(Dst->Preds.begin(), Dst->Preds.end(), T);
450 auto F = std::find(Dst->Preds.begin(), Dst->Preds.end(), T);
451 assert(F != Dst->Preds.end());
467 auto F = std::find(Dst->Preds.begin(), Dst->Preds.end(), T);
467 auto F = std::find(Dst->Preds.begin(), Dst->Preds.end(), T);
468 assert(F != Dst->Preds.end());
512 SUnit *SrcBest = getZeroLatency(Dst, Dst->Preds);
554 for (auto &I : DstBest->Preds)
lib/Target/Hexagon/HexagonVLIWPacketizer.cpp 525 for (const auto &PI : SUI->Preds)
1860 for (auto &Pred : SUI->Preds)
1871 for (auto &Pred : SUI->Preds)
lib/Target/PowerPC/PPCHazardRecognizers.cpp 38 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
39 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit());
43 if (!SU->Preds[i].isNormalMemory() && !SU->Preds[i].isBarrier())
43 if (!SU->Preds[i].isNormalMemory() && !SU->Preds[i].isBarrier())
47 if (SU->Preds[i].getSUnit() == CurGroup[j])
64 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
65 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit());
69 if (SU->Preds[i].isCtrl())
73 if (SU->Preds[i].getSUnit() == CurGroup[j])