tree-ssa-loop-niter.c (number_of_iterations_exit): Update function comment to reflect...
authorAldy Hernandez <aldyh@redhat.com>
Fri, 24 Feb 2017 11:02:16 +0000 (11:02 +0000)
committerAldy Hernandez <aldyh@gcc.gnu.org>
Fri, 24 Feb 2017 11:02:16 +0000 (11:02 +0000)
* tree-ssa-loop-niter.c (number_of_iterations_exit): Update
function comment to reflect reality.
(loop_exits_before_overflow): Fix typo in function description.

From-SVN: r245709

gcc/ChangeLog
gcc/tree-ssa-loop-niter.c

index f90686c2d98914adc36d78d33515d6e5fe65b72c..66535bf4e3c3839075fc1496ae55344f33c4f7f0 100644 (file)
@@ -1,3 +1,9 @@
+2017-02-24  Aldy Hernandez  <aldyh@redhat.com>
+
+       * tree-ssa-loop-niter.c (number_of_iterations_exit): Update
+       function comment to reflect reality.
+       (loop_exits_before_overflow): Fix typo in function description.
+
 2017-02-24  Richard Biener  <rguenther@suse.de>
 
        PR tree-optimization/79389
index efcf3ed65a63f5001517cb5f99245b73b5f2fc56..269a2ba86a3033eb4fcbcb486b878b8362290bab 100644 (file)
@@ -2345,8 +2345,8 @@ number_of_iterations_exit_assumptions (struct loop *loop, edge exit,
   return (!integer_zerop (niter->assumptions));
 }
 
-/* Like number_of_iterations_exit, but return TRUE only if the niter
-   information holds unconditionally.  */
+/* Like number_of_iterations_exit_assumptions, but return TRUE only if
+   the niter information holds unconditionally.  */
 
 bool
 number_of_iterations_exit (struct loop *loop, edge exit,
@@ -4194,7 +4194,7 @@ nowrap_type_p (tree type)
 }
 
 /* Return true if we can prove LOOP is exited before evolution of induction
-   variabled {BASE, STEP} overflows with respect to its type bound.  */
+   variable {BASE, STEP} overflows with respect to its type bound.  */
 
 static bool
 loop_exits_before_overflow (tree base, tree step,