Searched refs:isBackedge (Results 1 – 3 of 3) sorted by relevance
257 bool isBackedge(SUnit *Source, const SDep &Dep) { in isBackedge() function
2908 if (DAG->isBackedge(SU, P) && P.getSUnit()->getInstr()->isPHI()) in multipleIterations()2931 if (!DAG->isBackedge(SU, Dep)) { in computeStart()2955 if (!DAG->isBackedge(SU, Dep)) { in computeStart()3159 if (InstrToCycle.count(Pred.getSUnit()) && !DAG->isBackedge(SU, Pred)) in onlyHasLoopCarriedOutputOrOrderPreds()3162 if (InstrToCycle.count(Succ.getSUnit()) && DAG->isBackedge(SU, Succ)) in onlyHasLoopCarriedOutputOrOrderPreds()
895 bool isBackedge(BasicBlock *From, BasicBlock *To) const;926 bool NewGVN::isBackedge(BasicBlock *From, BasicBlock *To) const { in isBackedge() function in NewGVN1039 HasBackedge = HasBackedge || isBackedge(BB, PHIBlock); in createPHIExpression()