diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2005-04-01 03:42:55 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2005-04-01 03:42:55 +0000 |
| commit | aabcd30904d8ae69db59eedd1120e26ee89b9c61 (patch) | |
| tree | 782893b0afb24d21b87a6216e40df5e5f887e02f /gcc/lambda-code.c | |
| parent | 59cffcf69a5026fc54a38479c93f8ea961db8ecd (diff) | |
| download | gcc-aabcd30904d8ae69db59eedd1120e26ee89b9c61.zip gcc-aabcd30904d8ae69db59eedd1120e26ee89b9c61.tar.gz gcc-aabcd30904d8ae69db59eedd1120e26ee89b9c61.tar.bz2 | |
cgraphunit.c, [...]: Fix comment typos.
* cgraphunit.c, dbxout.c, flow.c, gcse.c, gimplify.c,
lambda-code.c, loop.c, machmode.def, mips-tfile.c,
modulo-sched.c, passes.c, postreload-gcse.c, tree-eh.c,
tree-ssa-ccp.c, varasm.c, config/frv/frv.c, config/frv/frv.h,
config/frv/frv.md, config/i386/i386.c, config/i386/i386.h,
config/i386/i386.md, config/rs6000/predicates.md,
config/rs6000/rs6000.c, config/s390/fixdfdi.h,
config/s390/s390.c, config/stormy16/stormy16.c,
config/stormy16/stormy16.md, config/vax/vax.md: Fix comment
typos.
From-SVN: r97362
Diffstat (limited to 'gcc/lambda-code.c')
| -rw-r--r-- | gcc/lambda-code.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/gcc/lambda-code.c b/gcc/lambda-code.c index 80e1ef8..66745b6 100644 --- a/gcc/lambda-code.c +++ b/gcc/lambda-code.c @@ -489,7 +489,7 @@ lcm (int a, int b) } /* Perform Fourier-Motzkin elimination to calculate the bounds of the - auxillary nest. + auxiliary nest. Fourier-Motzkin is a way of reducing systems of linear inequalities so that it is easy to calculate the answer and bounds. A sketch of how it works: @@ -800,7 +800,7 @@ lambda_compute_auxillary_space (lambda_loopnest nest, /* Compute the loop bounds for the target space, using the bounds of the auxiliary nest AUXILLARY_NEST, and the triangular matrix H. The target space loop bounds are computed by multiplying the triangular - matrix H by the auxillary nest, to get the new loop bounds. The sign of + matrix H by the auxiliary nest, to get the new loop bounds. The sign of the loop steps (positive or negative) is then used to swap the bounds if the loop counts downwards. Return the target loopnest. */ @@ -1057,8 +1057,8 @@ lambda_compute_step_signs (lambda_trans_matrix trans, lambda_vector stepsigns) 2. Composing the dense base with the specified transformation (TRANS) 3. Decomposing the combined transformation into a lower triangular portion, and a unimodular portion. - 4. Computing the auxillary nest using the unimodular portion. - 5. Computing the target nest using the auxillary nest and the lower + 4. Computing the auxiliary nest using the unimodular portion. + 5. Computing the target nest using the auxiliary nest and the lower triangular portion. */ lambda_loopnest |