Lines Matching refs:SUnit
499 bool ScheduleDAGMI::canAddEdge(SUnit *SuccSU, SUnit *PredSU) { in canAddEdge()
503 bool ScheduleDAGMI::addEdge(SUnit *SuccSU, const SDep &PredDep) { in addEdge()
520 void ScheduleDAGMI::releaseSucc(SUnit *SU, SDep *SuccEdge) { in releaseSucc()
521 SUnit *SuccSU = SuccEdge->getSUnit(); in releaseSucc()
548 void ScheduleDAGMI::releaseSuccessors(SUnit *SU) { in releaseSuccessors()
549 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); in releaseSuccessors()
559 void ScheduleDAGMI::releasePred(SUnit *SU, SDep *PredEdge) { in releasePred()
560 SUnit *PredSU = PredEdge->getSUnit(); in releasePred()
587 void ScheduleDAGMI::releasePredecessors(SUnit *SU) { in releasePredecessors()
588 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end(); in releasePredecessors()
651 SmallVector<SUnit*, 8> TopRoots, BotRoots; in schedule()
666 while (SUnit *SU = SchedImpl->pickNode(IsTopNode)) { in schedule()
720 findRootsAndBiasEdges(SmallVectorImpl<SUnit*> &TopRoots, in findRootsAndBiasEdges()
721 SmallVectorImpl<SUnit*> &BotRoots) { in findRootsAndBiasEdges()
722 for (std::vector<SUnit>::iterator in findRootsAndBiasEdges()
724 SUnit *SU = &(*I); in findRootsAndBiasEdges()
741 void ScheduleDAGMI::initQueues(ArrayRef<SUnit*> TopRoots, in initQueues()
742 ArrayRef<SUnit*> BotRoots) { in initQueues()
750 for (SmallVectorImpl<SUnit*>::const_iterator in initQueues()
756 for (SmallVectorImpl<SUnit*>::const_reverse_iterator in initQueues()
772 void ScheduleDAGMI::updateQueues(SUnit *SU, bool IsTopNode) { in updateQueues()
808 if (SUnit *SU = getSUnit(&(*MI))) in dumpSchedule()
908 updateScheduledPressure(const SUnit *SU, in updateScheduledPressure()
961 SUnit *SU = UI->SU; in updatePressureDiffs()
993 SmallVector<SUnit*, 8> TopRoots, BotRoots; in schedule()
1013 while (SUnit *SU = SchedImpl->pickNode(IsTopNode)) { in schedule()
1125 const SUnit *DefSU = getSUnit(DefMI); in computeCyclicCriticalPath()
1169 void ScheduleDAGMILive::scheduleMI(SUnit *SU, bool IsTopNode) { in scheduleMI()
1223 SUnit *SU;
1226 LoadInfo(SUnit *su, unsigned reg, unsigned ofs) in LoadInfo()
1243 void clusterNeighboringLoads(ArrayRef<SUnit*> Loads, ScheduleDAGMI *DAG);
1247 void LoadClusterMutation::clusterNeighboringLoads(ArrayRef<SUnit*> Loads, in clusterNeighboringLoads()
1251 SUnit *SU = Loads[Idx]; in clusterNeighboringLoads()
1267 SUnit *SUa = LoadRecords[Idx].SU; in clusterNeighboringLoads()
1268 SUnit *SUb = LoadRecords[Idx+1].SU; in clusterNeighboringLoads()
1278 for (SUnit::const_succ_iterator in clusterNeighboringLoads()
1297 SmallVector<SmallVector<SUnit*,4>, 32> StoreChainDependents; in apply()
1299 SUnit *SU = &DAG->SUnits[Idx]; in apply()
1303 for (SUnit::const_pred_iterator in apply()
1349 SUnit *SU = &DAG->SUnits[--Idx]; in apply()
1388 void constrainLocalCopy(SUnit *CopySU, ScheduleDAGMILive *DAG);
1411 void CopyConstrain::constrainLocalCopy(SUnit *CopySU, ScheduleDAGMILive *DAG) { in constrainLocalCopy()
1480 SUnit *GlobalSU = DAG->getSUnit(GlobalDef); in constrainLocalCopy()
1486 SmallVector<SUnit*,8> LocalUses; in constrainLocalCopy()
1489 SUnit *LastLocalSU = DAG->getSUnit(LastLocalDef); in constrainLocalCopy()
1490 for (SUnit::const_succ_iterator in constrainLocalCopy()
1503 SmallVector<SUnit*,8> GlobalUses; in constrainLocalCopy()
1506 SUnit *FirstLocalSU = DAG->getSUnit(FirstLocalDef); in constrainLocalCopy()
1507 for (SUnit::const_pred_iterator in constrainLocalCopy()
1519 for (SmallVectorImpl<SUnit*>::const_iterator in constrainLocalCopy()
1525 for (SmallVectorImpl<SUnit*>::const_iterator in constrainLocalCopy()
1546 SUnit *SU = &DAG->SUnits[Idx]; in apply()
1602 for (std::vector<SUnit>::iterator in init()
1636 unsigned SchedBoundary::getLatencyStallCycles(SUnit *SU) { in getLatencyStallCycles()
1673 bool SchedBoundary::checkHazard(SUnit *SU) { in checkHazard()
1706 findMaxLatency(ArrayRef<SUnit*> ReadySUs) { in findMaxLatency()
1707 SUnit *LateSU = nullptr; in findMaxLatency()
1709 for (ArrayRef<SUnit*>::iterator I = ReadySUs.begin(), E = ReadySUs.end(); in findMaxLatency()
1753 void SchedBoundary::releaseNode(SUnit *SU, unsigned ReadyCycle) { in releaseNode()
1779 void SchedBoundary::releaseTopNode(SUnit *SU) { in releaseTopNode()
1786 void SchedBoundary::releaseBottomNode(SUnit *SU) { in releaseBottomNode()
1876 void SchedBoundary::bumpNode(SUnit *SU) { in bumpNode()
2015 SUnit *SU = *(Pending.begin()+i); in releasePending()
2036 void SchedBoundary::removeReady(SUnit *SU) { in removeReady()
2048 SUnit *SchedBoundary::pickOnlyChoice() { in pickOnlyChoice()
2458 for (std::vector<SUnit*>::const_iterator in registerRoots()
2495 static unsigned getWeakLeft(const SUnit *SU, bool isTop) { in getWeakLeft()
2506 static int biasPhysRegCopy(const SUnit *SU, bool isTop) { in biasPhysRegCopy()
2619 const SUnit *NextClusterSU = in tryCandidate()
2699 SUnit *GenericScheduler::pickNodeBidirectional(bool &IsTopNode) { in pickNodeBidirectional()
2702 if (SUnit *SU = Bot.pickOnlyChoice()) { in pickNodeBidirectional()
2707 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidirectional()
2758 SUnit *GenericScheduler::pickNode(bool &IsTopNode) { in pickNode()
2764 SUnit *SU; in pickNode()
2804 void GenericScheduler::reschedulePhysRegCopies(SUnit *SU, bool isTop) { in reschedulePhysRegCopies()
2817 SUnit *DepSU = I->getSUnit(); in reschedulePhysRegCopies()
2836 void GenericScheduler::schedNode(SUnit *SU, bool IsTopNode) { in schedNode()
2900 for (SmallVectorImpl<SUnit*>::const_iterator in registerRoots()
2963 SUnit *PostGenericScheduler::pickNode(bool &IsTopNode) { in pickNode()
2968 SUnit *SU; in pickNode()
2993 void PostGenericScheduler::schedNode(SUnit *SU, bool IsTopNode) { in schedNode()
3020 bool operator()(const SUnit *A, const SUnit *B) const { in operator ()()
3047 std::vector<SUnit*> ReadyQ;
3069 SUnit *pickNode(bool &IsTopNode) override { in pickNode()
3072 SUnit *SU = ReadyQ.back(); in pickNode()
3091 void schedNode(SUnit *SU, bool IsTopNode) override { in schedNode()
3095 void releaseTopNode(SUnit *) override { /*only called for top roots*/ } in releaseTopNode() argument
3097 void releaseBottomNode(SUnit *SU) override { in releaseBottomNode()
3125 bool operator()(SUnit *A, SUnit *B) const { in operator ()()
3141 PriorityQueue<SUnit*, std::vector<SUnit*>, SUnitOrder<false> >
3144 PriorityQueue<SUnit*, std::vector<SUnit*>, SUnitOrder<true> >
3158 SUnit *pickNode(bool &IsTopNode) override { in pickNode()
3159 SUnit *SU; in pickNode()
3181 void schedNode(SUnit *SU, bool IsTopNode) override {} in schedNode()
3183 void releaseTopNode(SUnit *SU) override { in releaseTopNode()
3186 void releaseBottomNode(SUnit *SU) override { in releaseBottomNode()
3227 static bool isNodeHidden(const SUnit *Node) { in isNodeHidden()
3231 static bool hasNodeAddressLabel(const SUnit *Node, in hasNodeAddressLabel()
3238 static std::string getEdgeAttributes(const SUnit *Node, in getEdgeAttributes()
3248 static std::string getNodeLabel(const SUnit *SU, const ScheduleDAG *G) { in getNodeLabel()
3259 static std::string getNodeDescription(const SUnit *SU, const ScheduleDAG *G) { in getNodeDescription()
3263 static std::string getNodeAttributes(const SUnit *N, const ScheduleDAG *G) { in getNodeAttributes()