Searched refs:isReducible (Results 1 – 6 of 6) sorted by relevance
705 if (Cycle->isReducible()) { in computeJoinPoints()960 assert(Cycle == OriginalCycle || !Cycle->isReducible()); in getExtDivCycle()962 if (Cycle->isReducible()) { in getExtDivCycle()992 if (!Cycle || Cycle->isReducible()) in getIntDivCycle()1336 appendBlock(*CycleHeader, Cycle->isReducible()); in computeCyclePO()
90 assert(isReducible() && "Cycle Predecessor must be in a reducible cycle!");104 if (!isReducible())
97 bool isReducible() const { return Entries.size() == 1; } in isReducible() function
182 Check(BBCycle->isReducible() && BB == BBCycle->getHeader(), in verify()
972 (!FromCycle->isReducible() || FromCycle->getHeader() == ToBB)) in isLegalToBreakCriticalEdge()1172 if (Cycle != MCycle || (DefMI->isPHI() && Cycle && Cycle->isReducible() && in isProfitableToSinkTo()1722 (!CI->getCycle(SuccToSinkTo)->isReducible() || in SinkInstruction()
995 auto isReducible = [](const Value *B, const Value *D, const Value *E) { in foldNegativePower2AndShiftedMask() local1020 if (!isReducible(BElt, DElt, EElt)) in foldNegativePower2AndShiftedMask()1025 if (!isReducible(B, D, E)) in foldNegativePower2AndShiftedMask()