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

/freebsd-10.1-release/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp76 SUnit *PredSU = I->getSUnit(); local
80 for (SmallVectorImpl<SDep>::iterator II = PredSU->Succs.begin(),
81 EE = PredSU->Succs.end(); II != EE; ++II) {
203 SUnit *PredSU = I->getSUnit();
204 if (PredSU->isHeightCurrent)
205 WorkList.push_back(PredSU);
244 SUnit *PredSU = I->getSUnit();
245 if (PredSU->isDepthCurrent)
247 PredSU->Depth + I->getLatency());
250 WorkList.push_back(PredSU);
[all...]
H A DMachineScheduler.cpp371 bool ScheduleDAGMI::canAddEdge(SUnit *SuccSU, SUnit *PredSU) { argument
372 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU);
425 /// FIXME: Adjust PredSU height based on MinLatency.
427 SUnit *PredSU = PredEdge->getSUnit(); local
430 --PredSU->WeakSuccsLeft;
432 NextClusterPred = PredSU;
436 if (PredSU->NumSuccsLeft == 0) {
438 PredSU->dump(this);
443 --PredSU->NumSuccsLeft;
444 if (PredSU
[all...]
H A DCriticalAntiDepBreaker.cpp132 const SUnit *PredSU = P->getSUnit(); local
134 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency;
H A DScheduleDAGInstrs.cpp1037 /// List PredSU, SuccSU pairs that represent data edges between subtrees.
1179 const SUnit *PredSU = PredDep.getSUnit(); local
1180 unsigned PredNum = PredSU->NodeNum;
1187 for (SUnit::const_succ_iterator SI = PredSU->Succs.begin(),
1188 SE = PredSU->Succs.end(); SI != SE; ++SI) {
H A DAggressiveAntiDepBreaker.cpp282 const SUnit *PredSU = P->getSUnit();
284 unsigned PredTotalLatency = PredSU->getDepth() + PredLatency;
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp365 SUnit *PredSU = PredEdge->getSUnit(); local
368 if (PredSU->NumSuccsLeft == 0) {
370 PredSU->dump(this);
375 --PredSU->NumSuccsLeft;
380 PredSU->setHeightToAtLeast(SU->getHeight() + PredEdge->getLatency());
385 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) {
386 PredSU->isAvailable = true;
388 unsigned Height = PredSU->getHeight();
392 if (isReady(PredSU)) {
791 SUnit *PredSU = PredEdge->getSUnit(); local
[all...]
H A DScheduleDAGFast.cpp140 SUnit *PredSU = PredEdge->getSUnit(); local
143 if (PredSU->NumSuccsLeft == 0) {
145 PredSU->dump(this);
150 --PredSU->NumSuccsLeft;
154 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) {
155 PredSU->isAvailable = true;
156 AvailableQueue.push(PredSU);
H A DResourcePriorityQueue.cpp78 SUnit *PredSU = I->getSUnit(); local
79 const SDNode *ScegN = PredSU->getNode();
/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h357 /// \brief True if an edge can be added from PredSU to SuccSU without creating
359 bool canAddEdge(SUnit *SuccSU, SUnit *PredSU);

Completed in 189 milliseconds