Searched refs:PredSU (Results 1 - 9 of 9) sorted by relevance

/external/llvm/lib/CodeGen/
H A DScheduleDAG.cpp77 SUnit *PredSU = I->getSUnit(); local
81 for (SmallVectorImpl<SDep>::iterator II = PredSU->Succs.begin(),
82 EE = PredSU->Succs.end(); II != EE; ++II) {
204 SUnit *PredSU = I->getSUnit();
205 if (PredSU->isHeightCurrent)
206 WorkList.push_back(PredSU);
245 SUnit *PredSU = I->getSUnit();
246 if (PredSU->isDepthCurrent)
248 PredSU->Depth + I->getLatency());
251 WorkList.push_back(PredSU);
[all...]
H A DMachineScheduler.cpp499 bool ScheduleDAGMI::canAddEdge(SUnit *SuccSU, SUnit *PredSU) { argument
500 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU);
558 /// FIXME: Adjust PredSU height based on MinLatency.
560 SUnit *PredSU = PredEdge->getSUnit(); local
563 --PredSU->WeakSuccsLeft;
565 NextClusterPred = PredSU;
569 if (PredSU->NumSuccsLeft == 0) {
571 PredSU->dump(this);
578 if (PredSU->BotReadyCycle < SU->BotReadyCycle + PredEdge->getLatency())
579 PredSU
[all...]
H A DCriticalAntiDepBreaker.cpp140 const SUnit *PredSU = P->getSUnit(); local
142 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency;
H A DScheduleDAGInstrs.cpp1228 /// List PredSU, SuccSU pairs that represent data edges between subtrees.
1370 const SUnit *PredSU = PredDep.getSUnit(); local
1371 unsigned PredNum = PredSU->NodeNum;
1378 for (SUnit::const_succ_iterator SI = PredSU->Succs.begin(),
1379 SE = PredSU->Succs.end(); SI != SE; ++SI) {
H A DAggressiveAntiDepBreaker.cpp283 const SUnit *PredSU = P->getSUnit();
285 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency;
/external/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp367 SUnit *PredSU = PredEdge->getSUnit(); local
370 if (PredSU->NumSuccsLeft == 0) {
372 PredSU->dump(this);
377 --PredSU->NumSuccsLeft;
382 PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge->getLatency());
387 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) {
388 PredSU->isAvailable = true;
390 unsigned Height = PredSU->getHeight();
394 if (isReady(PredSU)) {
793 SUnit *PredSU = PredEdge->getSUnit(); local
[all...]
H A DScheduleDAGFast.cpp141 SUnit *PredSU = PredEdge->getSUnit(); local
144 if (PredSU->NumSuccsLeft == 0) {
146 PredSU->dump(this);
151 --PredSU->NumSuccsLeft;
155 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) {
156 PredSU->isAvailable = true;
157 AvailableQueue.push(PredSU);
H A DResourcePriorityQueue.cpp79 SUnit *PredSU = I->getSUnit(); local
80 const SDNode *ScegN = PredSU->getNode();
/external/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h277 /// \brief True if an edge can be added from PredSU to SuccSU without creating
279 bool canAddEdge(SUnit *SuccSU, SUnit *PredSU);

Completed in 778 milliseconds