Lines Matching refs:getSUnit
626 NewInstrChanges[KV.first] = InstrChanges[getSUnit(KV.first)]; in schedule()
693 SUnit *SuccSU = SI.getSUnit(); in isSuccOrder()
861 SUnit *SU = getSUnit(UseMI); in updatePhiDependences()
881 SUnit *SU = getSUnit(DefMI); in updatePhiDependences()
902 MachineInstr *PMI = PI.getSUnit()->getInstr(); in updatePhiDependences()
936 SUnit *DefSU = getSUnit(DefMI); in changeDependences()
943 SUnit *LastSU = getSUnit(LastMI); in changeDependences()
953 if (P.getSUnit() == DefSU) in changeDependences()
956 Topo.RemovePred(&I, Deps[i].getSUnit()); in changeDependences()
962 if (P.getSUnit() == &I && P.getKind() == SDep::Order) in changeDependences()
965 Topo.RemovePred(LastSU, Deps[i].getSUnit()); in changeDependences()
1122 unsigned NumCycles = getSUnit(MI)->Latency; in calculateResMII()
1203 SUnit *TargetSU = D.getSUnit(); in swapAntiDependences()
1225 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1236 if (SI.getSUnit()->isBoundaryNode() || SI.isArtificial() || in createAdjacencyStructure()
1237 (SI.getKind() == SDep::Anti && !SI.getSUnit()->getInstr()->isPHI())) in createAdjacencyStructure()
1239 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1251 if (PI.getKind() == SDep::Order && PI.getSUnit()->getInstr()->mayLoad()) { in createAdjacencyStructure()
1252 int N = PI.getSUnit()->NodeNum; in createAdjacencyStructure()
1371 SUnit *TmpSU = Dep.getSUnit(); in apply()
1395 SUnit *TmpSU = Dep.getSUnit(); in apply()
1425 if (D.isArtificial() || D.getSUnit()->isBoundaryNode()) in ignoreDependence()
1453 SUnit *pred = P.getSUnit(); in computeNodeFunctions()
1473 SUnit *succ = S.getSUnit(); in computeNodeFunctions()
1516 if (S && S->count(Pred.getSUnit()) == 0) in pred_L()
1520 if (NodeOrder.count(Pred.getSUnit()) == 0) in pred_L()
1521 Preds.insert(Pred.getSUnit()); in pred_L()
1527 if (S && S->count(Succ.getSUnit()) == 0) in pred_L()
1529 if (NodeOrder.count(Succ.getSUnit()) == 0) in pred_L()
1530 Preds.insert(Succ.getSUnit()); in pred_L()
1545 if (S && S->count(Succ.getSUnit()) == 0) in succ_L()
1549 if (NodeOrder.count(Succ.getSUnit()) == 0) in succ_L()
1550 Succs.insert(Succ.getSUnit()); in succ_L()
1555 if (S && S->count(Pred.getSUnit()) == 0) in succ_L()
1557 if (NodeOrder.count(Pred.getSUnit()) == 0) in succ_L()
1558 Succs.insert(Pred.getSUnit()); in succ_L()
1582 computePath(SI.getSUnit(), Path, DestNodes, Exclude, Visited); in computePath()
1586 computePath(PI.getSUnit(), Path, DestNodes, Exclude, Visited); in computePath()
1794 SUnit *Successor = SI.getSUnit(); in addConnectedNodes()
1800 SUnit *Predecessor = PI.getSUnit(); in addConnectedNodes()
1922 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
1924 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
1928 R.insert(I.getSUnit()); in computeNodeOrder()
1934 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
1936 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
1938 R.insert(I.getSUnit()); in computeNodeOrder()
1973 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
1975 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
1977 R.insert(I.getSUnit()); in computeNodeOrder()
1983 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
1985 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
1987 R.insert(I.getSUnit()); in computeNodeOrder()
2219 SUnit *SU = getSUnit(MI); in applyInstrChange()
2229 int DefStageNum = Schedule.stageScheduled(getSUnit(LoopDef)); in applyInstrChange()
2230 int DefCycleNum = Schedule.cycleScheduled(getSUnit(LoopDef)); in applyInstrChange()
2275 Dep.isArtificial() || Dep.getSUnit()->isBoundaryNode()) in isLoopCarriedDep()
2285 MachineInstr *DI = Dep.getSUnit()->getInstr(); in isLoopCarriedDep()
2418 SUnit *PrevSU = Cur.getSUnit(); in earliestCycleInChain()
2441 SUnit *SuccSU = Cur.getSUnit(); in latestCycleInChain()
2461 if (DAG->isBackedge(SU, P) && P.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2462 for (auto &S : P.getSUnit()->Succs) in multipleIterations()
2463 if (S.getKind() == SDep::Data && S.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2464 return P.getSUnit(); in multipleIterations()
2484 if (Dep.getSUnit() == I) { in computeStart()
2487 DAG->getDistance(Dep.getSUnit(), SU, Dep) * II; in computeStart()
2495 DAG->getDistance(SU, Dep.getSUnit(), Dep) * II; in computeStart()
2502 if (BE && Dep.getSUnit() == BE && !SU->getInstr()->isPHI() && in computeStart()
2507 if (SU->Succs[i].getSUnit() == I) { in computeStart()
2511 DAG->getDistance(SU, Dep.getSUnit(), Dep) * II; in computeStart()
2519 DAG->getDistance(Dep.getSUnit(), SU, Dep) * II; in computeStart()
2598 if (S.getSUnit() != *I) in orderDependence()
2615 if (P.getSUnit() != *I) in orderDependence()
2663 SUnit *DefSU = SSD->getSUnit(&Phi); in isLoopCarried()
2670 SUnit *UseSU = SSD->getSUnit(MRI.getVRegDef(LoopVal)); in isLoopCarried()
2726 Worklist.push_back(Dep.getSUnit()); in computeUnpipelineableNodes()
2730 Worklist.push_back(Dep.getSUnit()); in computeUnpipelineableNodes()
2753 NewCycle = std::max(InstrToCycle[Dep.getSUnit()], NewCycle); in normalizeNonPipelinedInstructions()
2787 if (SI.isAssignedRegDep() && !SI.getSUnit()->isBoundaryNode()) in isValidSchedule()
2789 if (stageScheduled(SI.getSUnit()) != StageDef) in isValidSchedule()
2791 if (InstrToCycle[SI.getSUnit()] <= CycleDef) in isValidSchedule()
2844 SUnit *PredSU = PredEdge.getSUnit(); in checkValidNodeOrder()
2855 SUnit *SuccSU = SuccEdge.getSUnit(); in checkValidNodeOrder()