From 19a8301a96cbab1046766864f4e527906f3fe846 Mon Sep 17 00:00:00 2001 From: rguenth Date: Thu, 21 Nov 2013 09:15:38 +0000 Subject: [PATCH] 2013-11-21 Richard Biener * tree-ssa-loop-ch.c (copy_loop_headers): Decrement nb_iterations_upper_bound by one. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@205198 138bc75d-0d04-0410-961f-82ee72b054a4 --- gcc/ChangeLog | 5 +++++ gcc/tree-ssa-loop-ch.c | 10 ++++++++++ 2 files changed, 15 insertions(+) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 1cfbefef29d..1ececafc827 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,5 +1,10 @@ 2013-11-21 Richard Biener + * tree-ssa-loop-ch.c (copy_loop_headers): Decrement + nb_iterations_upper_bound by one. + +2013-11-21 Richard Biener + PR tree-optimization/59058 * tree-loop-distribution.c (struct partition_s): Add plus_one member. diff --git a/gcc/tree-ssa-loop-ch.c b/gcc/tree-ssa-loop-ch.c index df45c286790..ccaa9c8987e 100644 --- a/gcc/tree-ssa-loop-ch.c +++ b/gcc/tree-ssa-loop-ch.c @@ -243,6 +243,16 @@ copy_loop_headers (void) are not now, since there was the loop exit condition. */ split_edge (loop_preheader_edge (loop)); split_edge (loop_latch_edge (loop)); + + /* We peeled off one iteration of the loop thus we can lower + the maximum number of iterations if we have a previously + recorded value for that. */ + double_int max; + if (get_max_loop_iterations (loop, &max)) + { + max -= double_int_one; + loop->nb_iterations_upper_bound = max; + } } update_ssa (TODO_update_ssa); -- 2.11.4.GIT