Lines Matching defs:Loops
1 //===- LoopStrengthReduce.cpp - Strength Reduce IVs in Loops --------------===//
14 // This pass performs a strength reduction on array references inside loops that
38 // TODO: Handle multiple loops at a time.
928 // loop at a time. LSR has already run on inner loops, will not run on outer
929 // loops, and cannot be expected to change sibling loops.
1666 /// induction variable increment should be placed. In simple loops, this is
1946 /// This is a narrow solution to a specific, but acute, problem. For loops
1955 /// unfortunately this can come up even for loops where the user didn't use
1956 /// a C do-while loop. For example, seemingly well-behaved top-test loops
1969 /// When indvars can't find the if test in loops like this, it creates a
2393 // Add strides for mentioned loops.
3010 // equality icmps is not a problem because all interesting loops use
3881 // This is split into multiple loops so that hasRegsUsedByUsesOtherThan
3940 // nonexistent AddRecs from other loops. These need to be filtered
3952 // by uses within other loops that have some non-trivial address mode or
4115 // This is especially useful for unrolled loops.
4479 // loops it for which it is using post-inc mode.
4563 PostIncLoopSet &Loops = const_cast<PostIncLoopSet &>(LF.PostIncLoops);
4566 Loops, SE, DT);
4577 PostIncLoopSet &Loops = const_cast<PostIncLoopSet &>(LF.PostIncLoops);
4580 Loops, SE, DT);
4890 // All dominating loops must have preheaders, or SCEVExpander may not be able
4917 // Skip nested loops until we can model them better with formulae.
5093 // Remove any extra phis created by processing inner loops.
