From 6416ae7f28ac516401f1f64715effce670b76d6f Mon Sep 17 00:00:00 2001 From: Kazu Hirata Date: Fri, 16 Dec 2005 06:09:31 +0000 Subject: basic-block.h, [...]: Fix comment typos. * basic-block.h, config/i386/winnt.c, config/pa/pa.c, config/s390/s390.c, dfp.c, expr.c, fold-const.c, params.def, reload.c, struct-equiv.c, tree-ssa-ccp.c, tree-ssa-pre.c, tree-ssa-reassoc.c, tree-ssa-structalias.c: Fix comment typos. * doc/invoke.texi, doc/tm.texi: Fix typos. From-SVN: r108626 --- gcc/tree-ssa-reassoc.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'gcc/tree-ssa-reassoc.c') diff --git a/gcc/tree-ssa-reassoc.c b/gcc/tree-ssa-reassoc.c index 6f19408..edca241 100644 --- a/gcc/tree-ssa-reassoc.c +++ b/gcc/tree-ssa-reassoc.c @@ -69,7 +69,7 @@ Boston, MA 02110-1301, USA. */ In order to promote the most redundancy elimination, you want binary expressions whose operands are the same rank (or - preferrably, the same value) exposed to the redundancy eliminator, + preferably, the same value) exposed to the redundancy eliminator, for possible elimination. So the way to do this if we really cared, is to build the new op -- cgit v1.1