Lines Matching refs:SE
36 ScalarEvolution &SE);
42 LoopNest::LoopNest(Loop &Root, ScalarEvolution &SE) in LoopNest() argument
43 : MaxPerfectDepth(getMaxPerfectDepth(Root, SE)) { in LoopNest()
48 ScalarEvolution &SE) { in getLoopNest() argument
49 return std::make_unique<LoopNest>(Root, SE); in getLoopNest()
104 ScalarEvolution &SE) { in arePerfectlyNested() argument
105 return (analyzeLoopNestForPerfectNest(OuterLoop, InnerLoop, SE) == in arePerfectlyNested()
110 const Loop &OuterLoop, const Loop &InnerLoop, ScalarEvolution &SE) { in analyzeLoopNestForPerfectNest() argument
124 if (!checkLoopsStructure(OuterLoop, InnerLoop, SE)) { in analyzeLoopNestForPerfectNest()
130 auto OuterLoopLB = OuterLoop.getBounds(SE); in analyzeLoopNestForPerfectNest()
182 const Loop &OuterLoop, const Loop &InnerLoop, ScalarEvolution &SE) { in getInterveningInstructions() argument
184 switch (analyzeLoopNestForPerfectNest(OuterLoop, InnerLoop, SE)) { in getInterveningInstructions()
205 auto OuterLoopLB = OuterLoop.getBounds(SE); in getInterveningInstructions()
241 LoopNest::getPerfectLoops(ScalarEvolution &SE) const { in getPerfectLoops()
250 if (SubLoops.size() == 1 && arePerfectlyNested(*L, *SubLoops.front(), SE)) { in getPerfectLoops()
261 unsigned LoopNest::getMaxPerfectDepth(const Loop &Root, ScalarEvolution &SE) { in getMaxPerfectDepth() argument
271 if (!arePerfectlyNested(*CurrentLoop, *InnerLoop, SE)) { in getMaxPerfectDepth()
316 ScalarEvolution &SE) { in checkLoopsStructure() argument
460 if (auto LN = LoopNest::getLoopNest(L, AR.SE)) in run()