Transforms/Scalar/IndVarSimplify.cpp

94 STATISTIC(NumReplaced    , "Number of exit values replaced");
111     cl::values(clEnumValN(NeverRepl, "never", "never replace exit value"),
115                           "only replace exit values when loop def likely dead"),
393   // The start/stride/exit values must all fit in signed i32.
577 /// that are recurrent in the loop, and substitute the exit values from the loop
578 /// into any instructions outside of the loop that use the final values of the
594   // Find all values that are computed inside the loop, but used outside of it.
595   // Because of LCSSA, these values will only occur in LCSSA PHI Nodes.  Scan
598     // If there are no PHI nodes in this exit block, then no values defined
621       // Iterate over all of the values in all the PHI nodes.
766 // rewriteFirstIterationLoopExitValues: Rewrite loop exit values if we know
772 /// loop iteration. This lets us predict exit values of PHI nodes that live in
784     // values defined inside the loop are used on this path.
1028   // a ConstantRange representing possible values of the def at the given
1435 /// then scalar evolution can not proceed with loop variant values and
2204   // Load and return values may be undef.
2306     // Avoid reusing a potentially undef value to compute other values that may
2434     // type. In the presence of null pointer values, we have an integer type
2590 /// If there's a single exit block, sink any loop-invariant values that
2842   // a path which does not need any of the values computed within the loop, we
2884     // If the exit block has phis, we need to be able to compute the values
3053   // that are recurrent in the loop, and substitute the exit values from the
3054   // loop into any instructions outside of the loop that use the final values
3132   // Clear the rewriter cache, because values that are in the rewriter's cache
3151   // trip count and therefore can further simplify exit values in addition to