From 0c6d8c366480c5cdf12880f53c0f415b40817e7c Mon Sep 17 00:00:00 2001 From: kazu Date: Sat, 18 Sep 2004 19:47:10 +0000 Subject: * alias.c, crtstuff.c, dbxout.c, domwalk.c, domwalk.h, gcc.c, gcse.c, global.c, lambda-code.c, loop.c, mips-tdump.c, optabs.h, predict.c, reg-stack.c, regclass.c, sched-rgn.c, tree-optimize.c, tree-ssa-dom.c, tree-ssa-forwprop.c, tree-ssa-operands.c, tree-ssa-phiopt.c, tree-ssa-threadupdate.c: Fix comment typos. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@87707 138bc75d-0d04-0410-961f-82ee72b054a4 --- gcc/lambda-code.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'gcc/lambda-code.c') diff --git a/gcc/lambda-code.c b/gcc/lambda-code.c index c520a6bf501..3faeee1bb9b 100644 --- a/gcc/lambda-code.c +++ b/gcc/lambda-code.c @@ -2033,7 +2033,7 @@ stmt_is_bumper_for_loop (struct loop *loop, tree stmt) innermost loop body. If S is a program statement, then - ie + i.e. DO I = 1, 20 S1 DO J = 1, 20 @@ -2395,7 +2395,7 @@ perfect_nestify (struct loops *loops, matrix T is legal when applied to a loop nest with a set of lexicographically non-negative distance vectors RDG if and only if for each vector d in RDG, (T.d >= 0) is lexicographically positive. - ie.: if and only if it transforms the lexicographically positive + i.e.: if and only if it transforms the lexicographically positive distance vectors to lexicographically positive vectors. Note that a unimodular matrix must transform the zero vector (and only it) to the zero vector." S.Muchnick. */ -- cgit v1.2.3