1885     for (auto &IE : DAG->DDG->getInEdges(&SUnits[i])) {  in createAdjacencyStructure()  local
1886       SUnit *Src = IE.getSrc();  in createAdjacencyStructure()
1887       SUnit *Dst = IE.getDst();  in createAdjacencyStructure()
1888       if (!Dst->getInstr()->mayStore() || !DAG->isLoopCarriedDep(IE))  in createAdjacencyStructure()
1890       if (IE.isOrderDep() && Src->getInstr()->mayLoad()) {  in createAdjacencyStructure()
2077     for (const auto &IE : DDG->getInEdges(SU)) {  in computeNodeFunctions()  local
2078       SUnit *Pred = IE.getSrc();  in computeNodeFunctions()
2079       if (IE.getLatency() == 0)  in computeNodeFunctions()
2082       if (IE.ignoreDependence(true))  in computeNodeFunctions()
2084       asap = std::max(asap, (int)(getASAP(Pred) + IE.getLatency() -  in computeNodeFunctions()
2085                                   IE.getDistance() * MII));  in computeNodeFunctions()
2141     for (const auto &IE : DDG->getInEdges(SU)) {  in pred_L()  local
2142       SUnit *PredSU = IE.getSrc();  in pred_L()
2145       if (IE.ignoreDependence(true))  in pred_L()
2191     for (const auto &IE : DDG->getInEdges(SU)) {  in succ_L()  local
2192       SUnit *PredSU = IE.getSrc();  in succ_L()
2193       if (!IE.isAntiDep())  in succ_L()
2224   for (const auto &IE : DDG->getInEdges(Cur))  in computePath()  local
2225     if (IE.isAntiDep() && IE.getDistance() == 0)  in computePath()
2227           computePath(IE.getSrc(), Path, DestNodes, Exclude, Visited, DDG);  in computePath()
2434   for (auto &IE : DDG->getInEdges(SU)) {  in addConnectedNodes()  local
2435     SUnit *Predecessor = IE.getSrc();  in addConnectedNodes()
2436     if (!IE.isArtificial() && NodesAdded.count(Predecessor) == 0)  in addConnectedNodes()
2572           for (const auto &IE : DDG->getInEdges(maxHeight)) {  in computeNodeOrder()  local
2573             SUnit *SU = IE.getSrc();  in computeNodeOrder()
2574             if (!IE.isAntiDep())  in computeNodeOrder()
2614           for (const auto &IE : DDG->getInEdges(maxDepth)) {  in computeNodeOrder()  local
2615             SUnit *SU = IE.getSrc();  in computeNodeOrder()
3207     for (const auto &IE : DDG->getInEdges(PrevSU))  in earliestCycleInChain()  local
3208       if (IE.isOrderDep() || IE.isOutputDep())  in earliestCycleInChain()
3209         Worklist.push_back(IE);  in earliestCycleInChain()
3262       for (const auto &IE : DDG->getInEdges(SU)) {  in computeStart()  local
3263         if (IE.getSrc() == I) {  in computeStart()
3266           if (DAG->isLoopCarriedDep(IE)) {  in computeStart()
3267             int End = earliestCycleInChain(IE, DDG) + (II - 1);  in computeStart()
3270           int EarlyStart = cycle + IE.getLatency() - IE.getDistance() * II;  in computeStart()
3388     for (auto &IE : DDG->getInEdges(SU)) {  in orderDependence()  local
3389       if (IE.getSrc() != *I)  in orderDependence()
3391       if ((IE.isAntiDep() || IE.isOutputDep() || IE.isOrderDep()) &&  in orderDependence()
3487   for (const auto &IE : DDG->getInEdges(SU))  in onlyHasLoopCarriedOutputOrOrderPreds()  local
3488     if (InstrToCycle.count(IE.getSrc()))  in onlyHasLoopCarriedOutputOrOrderPreds()
3510     for (const auto &IE : DDG->getInEdges(SU))  in computeUnpipelineableNodes()  local
3511       Worklist.push_back(IE.getSrc());  in computeUnpipelineableNodes()
3539     for (const auto &IE : SSD->getDDG()->getInEdges(&SU))  in normalizeNonPipelinedInstructions()  local
3540       if (IE.getDistance() == 0)  in normalizeNonPipelinedInstructions()
3541         NewCycle = std::max(InstrToCycle[IE.getSrc()], NewCycle);  in normalizeNonPipelinedInstructions()
3665     for (const auto &IE : DDG->getInEdges(SU)) {  in checkValidNodeOrder()  local
3666       SUnit *PredSU = IE.getSrc();  in checkValidNodeOrder()