Lines Matching refs:OE
1851 for (auto &OE : DAG->DDG->getOutEdges(&SUnits[i])) { in createAdjacencyStructure() local
1854 if (OE.isOutputDep()) { in createAdjacencyStructure()
1855 int N = OE.getDst()->NodeNum; in createAdjacencyStructure()
1865 if (OE.getDst()->isBoundaryNode() || OE.isArtificial()) in createAdjacencyStructure()
1874 if (OE.isAntiDep()) in createAdjacencyStructure()
1877 int N = OE.getDst()->NodeNum; in createAdjacencyStructure()
2097 for (const auto &OE : DDG->getOutEdges(SU)) { in computeNodeFunctions() local
2098 SUnit *Succ = OE.getDst(); in computeNodeFunctions()
2101 if (OE.getLatency() == 0) in computeNodeFunctions()
2104 if (OE.ignoreDependence(true)) in computeNodeFunctions()
2106 alap = std::min(alap, (int)(getALAP(Succ) - OE.getLatency() + in computeNodeFunctions()
2107 OE.getDistance() * MII)); in computeNodeFunctions()
2155 for (const auto &OE : DDG->getOutEdges(SU)) { in pred_L() local
2156 SUnit *SuccSU = OE.getDst(); in pred_L()
2157 if (!OE.isAntiDep()) in pred_L()
2177 for (const auto &OE : DDG->getOutEdges(SU)) { in succ_L() local
2178 SUnit *SuccSU = OE.getDst(); in succ_L()
2181 if (OE.ignoreDependence(false)) in succ_L()
2220 for (const auto &OE : DDG->getOutEdges(Cur)) in computePath() local
2221 if (!OE.ignoreDependence(false)) in computePath()
2223 computePath(OE.getDst(), Path, DestNodes, Exclude, Visited, DDG); in computePath()
2428 for (auto &OE : DDG->getOutEdges(SU)) { in addConnectedNodes() local
2429 SUnit *Successor = OE.getDst(); in addConnectedNodes()
2430 if (!OE.isArtificial() && !Successor->isBoundaryNode() && in addConnectedNodes()
2557 for (const auto &OE : DDG->getOutEdges(maxHeight)) { in computeNodeOrder() local
2558 SUnit *SU = OE.getDst(); in computeNodeOrder()
2563 if (OE.ignoreDependence(false)) in computeNodeOrder()
2627 for (const auto &OE : DDG->getOutEdges(maxDepth)) { in computeNodeOrder() local
2628 SUnit *SU = OE.getDst(); in computeNodeOrder()
2629 if (!OE.isAntiDep()) in computeNodeOrder()
3231 for (const auto &OE : DDG->getOutEdges(SuccSU)) in latestCycleInChain() local
3232 if (OE.isOrderDep() || OE.isOutputDep()) in latestCycleInChain()
3233 Worklist.push_back(OE); in latestCycleInChain()
3275 for (const auto &OE : DDG->getOutEdges(SU)) { in computeStart() local
3276 if (OE.getDst() == I) { in computeStart()
3279 if (DAG->isLoopCarriedDep(OE)) { in computeStart()
3280 int Start = latestCycleInChain(OE, DDG) + 1 - II; in computeStart()
3283 int LateStart = cycle - OE.getLatency() + OE.getDistance() * II; in computeStart()
3370 for (auto &OE : DDG->getOutEdges(SU)) { in orderDependence() local
3371 if (OE.getDst() != *I) in orderDependence()
3373 if (OE.isOrderDep() && stageScheduled(*I) == StageInst1) { in orderDependence()
3381 else if ((OE.isAntiDep() || OE.isOutputDep()) && in orderDependence()
3515 for (const auto &OE : DDG->getOutEdges(SU)) in computeUnpipelineableNodes() local
3516 if (OE.getDistance() == 1) in computeUnpipelineableNodes()
3517 Worklist.push_back(OE.getDst()); in computeUnpipelineableNodes()
3545 for (auto &OE : SSD->getDDG()->getOutEdges(&SU)) in normalizeNonPipelinedInstructions() local
3546 if (OE.getDistance() == 1) in normalizeNonPipelinedInstructions()
3547 NewCycle = std::max(InstrToCycle[OE.getDst()], NewCycle); in normalizeNonPipelinedInstructions()
3606 for (auto &OE : SSD->getDDG()->getOutEdges(&SU)) { in isValidSchedule() local
3607 SUnit *Dst = OE.getDst(); in isValidSchedule()
3608 if (OE.isAssignedRegDep() && !Dst->isBoundaryNode()) in isValidSchedule()
3609 if (OE.getReg().isPhysical()) { in isValidSchedule()
3676 for (const auto &OE : DDG->getOutEdges(SU)) { in checkValidNodeOrder() local
3677 SUnit *SuccSU = OE.getDst(); in checkValidNodeOrder()