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()
1124 unsigned NumCycles = getSUnit(MI)->Latency; in calculateResMII()
1209 SUnit *TargetSU = D.getSUnit(); in swapAntiDependences()
1231 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1242 if (SI.getSUnit()->isBoundaryNode() || SI.isArtificial() || in createAdjacencyStructure()
1243 (SI.getKind() == SDep::Anti && !SI.getSUnit()->getInstr()->isPHI())) in createAdjacencyStructure()
1245 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1257 if (PI.getKind() == SDep::Order && PI.getSUnit()->getInstr()->mayLoad()) { in createAdjacencyStructure()
1258 int N = PI.getSUnit()->NodeNum; in createAdjacencyStructure()
1378 SUnit *TmpSU = Dep.getSUnit(); in apply()
1402 SUnit *TmpSU = Dep.getSUnit(); in apply()
1462 SUnit *pred = IP->getSUnit(); in computeNodeFunctions()
1486 SUnit *succ = IS->getSUnit(); in computeNodeFunctions()
1528 if (S && S->count(Pred.getSUnit()) == 0) in pred_L()
1532 if (NodeOrder.count(Pred.getSUnit()) == 0) in pred_L()
1533 Preds.insert(Pred.getSUnit()); in pred_L()
1539 if (S && S->count(Succ.getSUnit()) == 0) in pred_L()
1541 if (NodeOrder.count(Succ.getSUnit()) == 0) in pred_L()
1542 Preds.insert(Succ.getSUnit()); in pred_L()
1558 if (S && S->count(Succ.getSUnit()) == 0) in succ_L()
1562 if (NodeOrder.count(Succ.getSUnit()) == 0) in succ_L()
1563 Succs.insert(Succ.getSUnit()); in succ_L()
1568 if (S && S->count(Pred.getSUnit()) == 0) in succ_L()
1570 if (NodeOrder.count(Pred.getSUnit()) == 0) in succ_L()
1571 Succs.insert(Pred.getSUnit()); in succ_L()
1593 FoundPath |= computePath(SI.getSUnit(), Path, DestNodes, Exclude, Visited); in computePath()
1597 computePath(PI.getSUnit(), Path, DestNodes, Exclude, Visited); in computePath()
1805 SUnit *Successor = SI.getSUnit(); in addConnectedNodes()
1810 SUnit *Predecessor = PI.getSUnit(); in addConnectedNodes()
1933 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
1935 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
1939 R.insert(I.getSUnit()); in computeNodeOrder()
1945 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
1947 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
1949 R.insert(I.getSUnit()); in computeNodeOrder()
1984 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
1986 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
1988 R.insert(I.getSUnit()); in computeNodeOrder()
1994 if (Nodes.count(I.getSUnit()) == 0) in computeNodeOrder()
1996 if (NodeOrder.contains(I.getSUnit())) in computeNodeOrder()
1998 R.insert(I.getSUnit()); in computeNodeOrder()
2225 SUnit *SU = getSUnit(MI); in applyInstrChange()
2235 int DefStageNum = Schedule.stageScheduled(getSUnit(LoopDef)); in applyInstrChange()
2236 int DefCycleNum = Schedule.cycleScheduled(getSUnit(LoopDef)); in applyInstrChange()
2291 MachineInstr *DI = Dep.getSUnit()->getInstr(); in isLoopCarriedDep()
2424 SUnit *PrevSU = Cur.getSUnit(); in earliestCycleInChain()
2447 SUnit *SuccSU = Cur.getSUnit(); in latestCycleInChain()
2467 if (DAG->isBackedge(SU, P) && P.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2468 for (auto &S : P.getSUnit()->Succs) in multipleIterations()
2469 if (S.getKind() == SDep::Data && S.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2470 return P.getSUnit(); in multipleIterations()
2490 if (Dep.getSUnit() == I) { in computeStart()
2493 DAG->getDistance(Dep.getSUnit(), SU, Dep) * II; in computeStart()
2501 DAG->getDistance(SU, Dep.getSUnit(), Dep) * II; in computeStart()
2508 if (BE && Dep.getSUnit() == BE && !SU->getInstr()->isPHI() && in computeStart()
2513 if (SU->Succs[i].getSUnit() == I) { in computeStart()
2517 DAG->getDistance(SU, Dep.getSUnit(), Dep) * II; in computeStart()
2525 DAG->getDistance(Dep.getSUnit(), SU, Dep) * II; in computeStart()
2605 if (S.getSUnit() != *I) in orderDependence()
2622 if (P.getSUnit() != *I) in orderDependence()
2670 SUnit *DefSU = SSD->getSUnit(&Phi); in isLoopCarried()
2677 SUnit *UseSU = SSD->getSUnit(MRI.getVRegDef(LoopVal)); in isLoopCarried()
2729 if (stageScheduled(SI.getSUnit()) != StageDef) in isValidSchedule()
2781 SUnit *PredSU = PredEdge.getSUnit(); in checkValidNodeOrder()
2792 SUnit *SuccSU = SuccEdge.getSUnit(); in checkValidNodeOrder()