diff options
| author | Kazu Hirata <kazu@codesourcery.com> | 2006-05-28 17:46:46 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2006-05-28 17:46:46 +0000 |
| commit | 6fc0bb99a7d0fcedd1b345da14d4dd16926b5458 (patch) | |
| tree | bfad2d717d3d9605e8fb4c3cba410dc93fdf4df4 /gcc/lambda-code.c | |
| parent | 8967e0295db5621216719a0ea9723774fba31977 (diff) | |
| download | gcc-6fc0bb99a7d0fcedd1b345da14d4dd16926b5458.zip gcc-6fc0bb99a7d0fcedd1b345da14d4dd16926b5458.tar.gz gcc-6fc0bb99a7d0fcedd1b345da14d4dd16926b5458.tar.bz2 | |
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
Diffstat (limited to 'gcc/lambda-code.c')
| -rw-r--r-- | gcc/lambda-code.c | 4 |
1 files changed, 2 insertions, 2 deletions
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); |