diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2004-09-05 15:24:15 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2004-09-05 15:24:15 +0000 |
| commit | 2a7e31df70cf600dfaa401cb426578994739bce0 (patch) | |
| tree | db2d4b4b49c75785725db3dc511e5abdabfec0c9 /gcc/tree-ssa-loop-niter.c | |
| parent | 2addf92620c2d652f72c4cb204fb46d980e784e5 (diff) | |
| download | gcc-2a7e31df70cf600dfaa401cb426578994739bce0.zip gcc-2a7e31df70cf600dfaa401cb426578994739bce0.tar.gz gcc-2a7e31df70cf600dfaa401cb426578994739bce0.tar.bz2 | |
c-common.c, [...]: Fix comment typos.
* c-common.c, cfgexpand.c, cgraphunit.c, defaults.h,
et-forest.c, expr.c, gimplify.c, global.c, gthr-lynx.h,
hard-reg-set.h, modulo-sched.c, optabs.c, postreload-gcse.c,
tree-data-ref.c, tree-flow.h, tree-if-conv.c, tree-inline.c,
tree-sra.c, tree-ssa-loop-im.c, tree-ssa-loop-ivopts.c,
tree-ssa-loop-niter.c, tree-ssa-operands.c,
tree-ssa-operands.h, tree-ssa-propagate.c,
tree-ssa-propagate.h, tree-ssa-threadupdate.c, value-prof.c,
vec.c, vec.h: Fix comment typos. Follow spelling conventions.
From-SVN: r87104
Diffstat (limited to 'gcc/tree-ssa-loop-niter.c')
| -rw-r--r-- | gcc/tree-ssa-loop-niter.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/tree-ssa-loop-niter.c b/gcc/tree-ssa-loop-niter.c index 7135cee..dd5fad9 100644 --- a/gcc/tree-ssa-loop-niter.c +++ b/gcc/tree-ssa-loop-niter.c @@ -190,7 +190,7 @@ number_of_iterations_cond (tree type, tree base0, tree step0, /* We want to take care only of <=; this is easy, as in cases the overflow would make the transformation unsafe the loop does not roll. Seemingly it would make more sense to want to take - care of <, as NE is more simmilar to it, but the problem is that here + care of <, as NE is more similar to it, but the problem is that here the transformation would be more difficult due to possibly infinite loops. */ if (zero_p (step0)) @@ -266,7 +266,7 @@ number_of_iterations_cond (tree type, tree base0, tree step0, obviously if the test for overflow during that transformation passed, we cannot overflow here. Most importantly any loop with sharp end condition and step 1 falls into this - cathegory, so handling this case specially is definitely + category, so handling this case specially is definitely worth the troubles. */ may_xform = boolean_true_node; } |