From 6fc0bb99a7d0fcedd1b345da14d4dd16926b5458 Mon Sep 17 00:00:00 2001 From: Kazu Hirata Date: Sun, 28 May 2006 17:46:46 +0000 Subject: cfgcleanup.c, [...]: Fix comment typos. * cfgcleanup.c, cfgexpand.c, cgraphunit.c, config/arm/arm.c, config/fr30/fr30.md, config/i386/i386-interix.h, config/i386/i386.c, config/i386/i386.md, config/sh/superh.h, config/sh/superh64.h, config/v850/v850.c, df-core.c, df-problems.c, df.h, except.c, final.c, haifa-sched.c, lambda-code.c, libgcc2.h, omp-low.c, optabs.c, predict.c, reload.c, tree-flow.h, tree-outof-ssa.c, tree-ssa-dce.c, tree-ssa-pre.c, tree-vect-transform.c: Fix comment typos. Follow spelling conventions. * doc/invoke.texi, doc/rtl.texi, doc/tm.texi: Fix typos. Follow spelling conventions. From-SVN: r114168 --- 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 c59de3c..8ed9610 100644 --- a/gcc/lambda-code.c +++ b/gcc/lambda-code.c @@ -623,7 +623,7 @@ compute_nest_using_fourier_motzkin (int size, 4. Multiply the composed transformation matrix times the matrix form of the loop. 5. Transform the newly created matrix (from step 4) back into a loop nest - using fourier motzkin elimination to figure out the bounds. */ + using Fourier-Motzkin elimination to figure out the bounds. */ static lambda_loopnest lambda_compute_auxillary_space (lambda_loopnest nest, @@ -742,7 +742,7 @@ lambda_compute_auxillary_space (lambda_loopnest nest, lambda_matrix_add_mc (B, 1, B1, -1, B1, size, invariants); /* Now compute the auxiliary space bounds by first inverting U, multiplying - it by A1, then performing fourier motzkin. */ + it by A1, then performing Fourier-Motzkin. */ invertedtrans = lambda_matrix_new (depth, depth); -- cgit v1.1