diff options
| author | Sebastian Pop <sebastian.pop@amd.com> | 2010-06-09 22:09:28 +0000 |
|---|---|---|
| committer | Sebastian Pop <spop@gcc.gnu.org> | 2010-06-09 22:09:28 +0000 |
| commit | 072edf0751a79b7e49d2d5834cf2e097ce51ed19 (patch) | |
| tree | d84c1a8d9648f7dcd505bd39e0953b1994054393 /gcc/tree-ssa-loop-niter.c | |
| parent | 642d55de0e40c7bf59ab0043aeae756f004488dc (diff) | |
| download | gcc-072edf0751a79b7e49d2d5834cf2e097ce51ed19.zip gcc-072edf0751a79b7e49d2d5834cf2e097ce51ed19.tar.gz gcc-072edf0751a79b7e49d2d5834cf2e097ce51ed19.tar.bz2 | |
Fix comments and indentation.
2010-06-09 Sebastian Pop <sebastian.pop@amd.com>
* graphite-poly.h: Fix comments and indentation.
* graphite-sese-to-poly.c: Same.
(build_sese_conditions_before): Compute stmt and gbb only when needed.
* tree-chrec.c: Fix comments and indentation.
(tree-ssa-loop-niter.c): Same.
From-SVN: r160508
Diffstat (limited to 'gcc/tree-ssa-loop-niter.c')
| -rw-r--r-- | gcc/tree-ssa-loop-niter.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/tree-ssa-loop-niter.c b/gcc/tree-ssa-loop-niter.c index 170fb22..c0c89113 100644 --- a/gcc/tree-ssa-loop-niter.c +++ b/gcc/tree-ssa-loop-niter.c @@ -875,11 +875,11 @@ assert_loop_rolls_lt (tree type, affine_iv *iv0, affine_iv *iv1, -step + 1 <= (iv1->base - iv0->base) <= MAX - step + 1 (where MAX is the maximum value of the unsigned variant of TYPE, and - the computations in this formula are performed in full precision - (without overflows). + the computations in this formula are performed in full precision, + i.e., without overflows). Usually, for loops with exit condition iv0->base + step * i < iv1->base, - we have a condition of form iv0->base - step < iv1->base before the loop, + we have a condition of the form iv0->base - step < iv1->base before the loop, and for loops iv0->base < iv1->base - step * i the condition iv0->base < iv1->base + step, due to loop header copying, which enable us to prove the lower bound. |