Lines Matching refs:su
175 void ReleaseSucc(SUnit *SU, SDep *SuccEdge);
176 void ReleaseSuccessors(SUnit *SU);
177 void ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
240 if (SUnit *SU = Sequence[i])
241 SU->dump(this);
389 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
390 SUnits[su].dumpAll(this));
421 void SchedulePostRATDList::ReleaseSucc(SUnit *SU, SDep *SuccEdge) {
440 // SuccSU->setDepthToAtLeast(SU->getDepth() + SuccEdge->getLatency());
455 /// ReleaseSuccessors - Call ReleaseSucc on each of SU's successors.
456 SU) {
457 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
459 ReleaseSucc(SU, &*I);
466 void SchedulePostRATDList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
468 DEBUG(SU->dump(this));
470 Sequence.push_back(SU);
471 assert(CurCycle >= SU->getDepth() &&
473 SU->setDepthToAtLeast(CurCycle);
475 ReleaseSuccessors(SU);
476 SU->isScheduled = true;
477 AvailableQueue.scheduledNode(SU);
645 if (SUnit *SU = Sequence[i])
646 BB->splice(RegionEnd, BB, SU->getInstr());