Lines Matching refs:getSUnit
719 NewInstrChanges[KV.first] = InstrChanges[getSUnit(KV.first)]; in schedule()
792 SUnit *SuccSU = SI.getSUnit(); in isSuccOrder()
957 SUnit *SU = getSUnit(UseMI); in updatePhiDependences()
977 SUnit *SU = getSUnit(DefMI); in updatePhiDependences()
999 MachineInstr *PMI = PI.getSUnit()->getInstr(); in updatePhiDependences()
1033 SUnit *DefSU = getSUnit(DefMI); in changeDependences()
1040 SUnit *LastSU = getSUnit(LastMI); in changeDependences()
1050 if (P.getSUnit() == DefSU) in changeDependences()
1053 Topo.RemovePred(&I, D.getSUnit()); in changeDependences()
1059 if (P.getSUnit() == &I && P.getKind() == SDep::Order) in changeDependences()
1062 Topo.RemovePred(LastSU, D.getSUnit()); in changeDependences()
1641 SUnit *TargetSU = D.getSUnit(); in swapAntiDependences()
1663 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1674 if (SI.getSUnit()->isBoundaryNode() || SI.isArtificial() || in createAdjacencyStructure()
1675 (SI.getKind() == SDep::Anti && !SI.getSUnit()->getInstr()->isPHI())) in createAdjacencyStructure()
1677 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1689 if (PI.getKind() == SDep::Order && PI.getSUnit()->getInstr()->mayLoad()) { in createAdjacencyStructure()
1690 int N = PI.getSUnit()->NodeNum; in createAdjacencyStructure()
1809 SUnit *TmpSU = Dep.getSUnit(); in apply()
1833 SUnit *TmpSU = Dep.getSUnit(); in apply()
1863 if (D.isArtificial() || D.getSUnit()->isBoundaryNode()) in ignoreDependence()
1891 SUnit *pred = P.getSUnit(); in computeNodeFunctions()
1911 SUnit *succ = S.getSUnit(); in computeNodeFunctions()
1954 if (S && S->count(Pred.getSUnit()) == 0) in pred_L()
1958 if (NodeOrder.count(Pred.getSUnit()) == 0) in pred_L()
1959 Preds.insert(Pred.getSUnit()); in pred_L()
1965 if (S && S->count(Succ.getSUnit()) == 0) in pred_L()
1967 if (NodeOrder.count(Succ.getSUnit()) == 0) in pred_L()
1968 Preds.insert(Succ.getSUnit()); in pred_L()
1983 if (S && S->count(Succ.getSUnit()) == 0) in succ_L()
1987 if (NodeOrder.count(Succ.getSUnit()) == 0) in succ_L()
1988 Succs.insert(Succ.getSUnit()); in succ_L()
1993 if (S && S->count(Pred.getSUnit()) == 0) in succ_L()
1995 if (NodeOrder.count(Pred.getSUnit()) == 0) in succ_L()
1996 Succs.insert(Pred.getSUnit()); in succ_L()
2020 computePath(SI.getSUnit(), Path, DestNodes, Exclude, Visited); in computePath()
2024 computePath(PI.getSUnit(), Path, DestNodes, Exclude, Visited); in computePath()
2229 SUnit *Successor = SI.getSUnit(); in addConnectedNodes()
2235 SUnit *Predecessor = PI.getSUnit(); in addConnectedNodes()
2357 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
2359 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
2363 R.insert(I.getSUnit()); in computeNodeOrder()
2369 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
2371 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
2373 R.insert(I.getSUnit()); in computeNodeOrder()
2408 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
2410 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
2412 R.insert(I.getSUnit()); in computeNodeOrder()
2418 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
2420 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
2422 R.insert(I.getSUnit()); in computeNodeOrder()
2668 SUnit *SU = getSUnit(MI); in applyInstrChange()
2678 int DefStageNum = Schedule.stageScheduled(getSUnit(LoopDef)); in applyInstrChange()
2679 int DefCycleNum = Schedule.cycleScheduled(getSUnit(LoopDef)); in applyInstrChange()
2724 Dep.isArtificial() || Dep.getSUnit()->isBoundaryNode()) in isLoopCarriedDep()
2734 MachineInstr *DI = Dep.getSUnit()->getInstr(); in isLoopCarriedDep()
2865 SUnit *PrevSU = Cur.getSUnit(); in earliestCycleInChain()
2888 SUnit *SuccSU = Cur.getSUnit(); in latestCycleInChain()
2908 if (DAG->isBackedge(SU, P) && P.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2909 for (auto &S : P.getSUnit()->Succs) in multipleIterations()
2910 if (S.getKind() == SDep::Data && S.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2911 return P.getSUnit(); in multipleIterations()
2930 if (Dep.getSUnit() == I) { in computeStart()
2933 DAG->getDistance(Dep.getSUnit(), SU, Dep) * II; in computeStart()
2941 DAG->getDistance(SU, Dep.getSUnit(), Dep) * II; in computeStart()
2948 if (BE && Dep.getSUnit() == BE && !SU->getInstr()->isPHI() && in computeStart()
2953 if (SU->Succs[i].getSUnit() == I) { in computeStart()
2957 DAG->getDistance(SU, Dep.getSUnit(), Dep) * II; in computeStart()
2965 DAG->getDistance(Dep.getSUnit(), SU, Dep) * II; in computeStart()
3044 if (S.getSUnit() != *I) in orderDependence()
3061 if (P.getSUnit() != *I) in orderDependence()
3110 SUnit *DefSU = SSD->getSUnit(&Phi); in isLoopCarried()
3117 SUnit *UseSU = SSD->getSUnit(MRI.getVRegDef(LoopVal)); in isLoopCarried()
3159 if (InstrToCycle.count(Pred.getSUnit()) && !DAG->isBackedge(SU, Pred)) in onlyHasLoopCarriedOutputOrOrderPreds()
3162 if (InstrToCycle.count(Succ.getSUnit()) && DAG->isBackedge(SU, Succ)) in onlyHasLoopCarriedOutputOrOrderPreds()
3184 Worklist.push_back(Dep.getSUnit()); in computeUnpipelineableNodes()
3188 Worklist.push_back(Dep.getSUnit()); in computeUnpipelineableNodes()
3211 NewCycle = std::max(InstrToCycle[Dep.getSUnit()], NewCycle); in normalizeNonPipelinedInstructions()
3245 if (SI.isAssignedRegDep() && !SI.getSUnit()->isBoundaryNode()) in isValidSchedule()
3247 if (stageScheduled(SI.getSUnit()) != StageDef) in isValidSchedule()
3249 if (InstrToCycle[SI.getSUnit()] <= CycleDef) in isValidSchedule()
3302 SUnit *PredSU = PredEdge.getSUnit(); in checkValidNodeOrder()
3313 SUnit *SuccSU = SuccEdge.getSUnit(); in checkValidNodeOrder()
3667 unsigned NumCycles = DAG->getSUnit(MI)->Latency; in calculateResMIIDFA()