Lines Matching refs:getSUnit
664 NewInstrChanges[KV.first] = InstrChanges[getSUnit(KV.first)]; in schedule()
732 SUnit *SuccSU = SI.getSUnit(); in isSuccOrder()
898 SUnit *SU = getSUnit(UseMI); in updatePhiDependences()
918 SUnit *SU = getSUnit(DefMI); in updatePhiDependences()
939 MachineInstr *PMI = PI.getSUnit()->getInstr(); in updatePhiDependences()
973 SUnit *DefSU = getSUnit(DefMI); in changeDependences()
980 SUnit *LastSU = getSUnit(LastMI); in changeDependences()
990 if (P.getSUnit() == DefSU) in changeDependences()
993 Topo.RemovePred(&I, Deps[i].getSUnit()); in changeDependences()
999 if (P.getSUnit() == &I && P.getKind() == SDep::Order) in changeDependences()
1002 Topo.RemovePred(LastSU, Deps[i].getSUnit()); in changeDependences()
1581 SUnit *TargetSU = D.getSUnit(); in swapAntiDependences()
1603 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1614 if (SI.getSUnit()->isBoundaryNode() || SI.isArtificial() || in createAdjacencyStructure()
1615 (SI.getKind() == SDep::Anti && !SI.getSUnit()->getInstr()->isPHI())) in createAdjacencyStructure()
1617 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1629 if (PI.getKind() == SDep::Order && PI.getSUnit()->getInstr()->mayLoad()) { in createAdjacencyStructure()
1630 int N = PI.getSUnit()->NodeNum; in createAdjacencyStructure()
1749 SUnit *TmpSU = Dep.getSUnit(); in apply()
1773 SUnit *TmpSU = Dep.getSUnit(); in apply()
1803 if (D.isArtificial() || D.getSUnit()->isBoundaryNode()) in ignoreDependence()
1831 SUnit *pred = P.getSUnit(); in computeNodeFunctions()
1851 SUnit *succ = S.getSUnit(); in computeNodeFunctions()
1894 if (S && S->count(Pred.getSUnit()) == 0) in pred_L()
1898 if (NodeOrder.count(Pred.getSUnit()) == 0) in pred_L()
1899 Preds.insert(Pred.getSUnit()); in pred_L()
1905 if (S && S->count(Succ.getSUnit()) == 0) in pred_L()
1907 if (NodeOrder.count(Succ.getSUnit()) == 0) in pred_L()
1908 Preds.insert(Succ.getSUnit()); in pred_L()
1923 if (S && S->count(Succ.getSUnit()) == 0) in succ_L()
1927 if (NodeOrder.count(Succ.getSUnit()) == 0) in succ_L()
1928 Succs.insert(Succ.getSUnit()); in succ_L()
1933 if (S && S->count(Pred.getSUnit()) == 0) in succ_L()
1935 if (NodeOrder.count(Pred.getSUnit()) == 0) in succ_L()
1936 Succs.insert(Pred.getSUnit()); in succ_L()
1960 computePath(SI.getSUnit(), Path, DestNodes, Exclude, Visited); in computePath()
1964 computePath(PI.getSUnit(), Path, DestNodes, Exclude, Visited); in computePath()
2169 SUnit *Successor = SI.getSUnit(); in addConnectedNodes()
2175 SUnit *Predecessor = PI.getSUnit(); in addConnectedNodes()
2297 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
2299 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
2303 R.insert(I.getSUnit()); in computeNodeOrder()
2309 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
2311 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
2313 R.insert(I.getSUnit()); in computeNodeOrder()
2348 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
2350 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
2352 R.insert(I.getSUnit()); in computeNodeOrder()
2358 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
2360 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
2362 R.insert(I.getSUnit()); in computeNodeOrder()
2612 SUnit *SU = getSUnit(MI); in applyInstrChange()
2622 int DefStageNum = Schedule.stageScheduled(getSUnit(LoopDef)); in applyInstrChange()
2623 int DefCycleNum = Schedule.cycleScheduled(getSUnit(LoopDef)); in applyInstrChange()
2668 Dep.isArtificial() || Dep.getSUnit()->isBoundaryNode()) in isLoopCarriedDep()
2678 MachineInstr *DI = Dep.getSUnit()->getInstr(); in isLoopCarriedDep()
2808 SUnit *PrevSU = Cur.getSUnit(); in earliestCycleInChain()
2831 SUnit *SuccSU = Cur.getSUnit(); in latestCycleInChain()
2851 if (DAG->isBackedge(SU, P) && P.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2852 for (auto &S : P.getSUnit()->Succs) in multipleIterations()
2853 if (S.getKind() == SDep::Data && S.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2854 return P.getSUnit(); in multipleIterations()
2874 if (Dep.getSUnit() == I) { in computeStart()
2877 DAG->getDistance(Dep.getSUnit(), SU, Dep) * II; in computeStart()
2885 DAG->getDistance(SU, Dep.getSUnit(), Dep) * II; in computeStart()
2892 if (BE && Dep.getSUnit() == BE && !SU->getInstr()->isPHI() && in computeStart()
2897 if (SU->Succs[i].getSUnit() == I) { in computeStart()
2901 DAG->getDistance(SU, Dep.getSUnit(), Dep) * II; in computeStart()
2909 DAG->getDistance(Dep.getSUnit(), SU, Dep) * II; in computeStart()
2988 if (S.getSUnit() != *I) in orderDependence()
3005 if (P.getSUnit() != *I) in orderDependence()
3054 SUnit *DefSU = SSD->getSUnit(&Phi); in isLoopCarried()
3061 SUnit *UseSU = SSD->getSUnit(MRI.getVRegDef(LoopVal)); in isLoopCarried()
3115 Worklist.push_back(Dep.getSUnit()); in computeUnpipelineableNodes()
3119 Worklist.push_back(Dep.getSUnit()); in computeUnpipelineableNodes()
3142 NewCycle = std::max(InstrToCycle[Dep.getSUnit()], NewCycle); in normalizeNonPipelinedInstructions()
3176 if (SI.isAssignedRegDep() && !SI.getSUnit()->isBoundaryNode()) in isValidSchedule()
3178 if (stageScheduled(SI.getSUnit()) != StageDef) in isValidSchedule()
3180 if (InstrToCycle[SI.getSUnit()] <= CycleDef) in isValidSchedule()
3233 SUnit *PredSU = PredEdge.getSUnit(); in checkValidNodeOrder()
3244 SUnit *SuccSU = SuccEdge.getSUnit(); in checkValidNodeOrder()
3598 unsigned NumCycles = DAG->getSUnit(MI)->Latency; in calculateResMIIDFA()