From 89dbed81f485455d27b9822c1de921571580fe65 Mon Sep 17 00:00:00 2001 From: Kazu Hirata Date: Fri, 10 Sep 2004 15:09:39 +0000 Subject: bb-reorder.c, [...]: Fix comment typos. * bb-reorder.c, c-common.c, c-incpath.c, c-typeck.c, genrecog.c, lambda-code.c, mips-tdump.c, mips-tfile.c, passes.c, tree-data-ref.c, tree-data-ref.h, tree-mudflap.c, tree-scalar-evolution.c, tree-ssa-copyrename.c, tree-ssa-live.c, tree-ssa-live.h: Fix comment typos. From-SVN: r87302 --- gcc/lambda-code.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'gcc/lambda-code.c') diff --git a/gcc/lambda-code.c b/gcc/lambda-code.c index 325bb91..21bea19 100644 --- a/gcc/lambda-code.c +++ b/gcc/lambda-code.c @@ -1931,7 +1931,7 @@ lambda_vector_lexico_pos (lambda_vector v, unsigned n) 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.1