diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2004-09-25 14:36:40 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2004-09-25 14:36:40 +0000 |
| commit | ea4b78487cb4fa983c3bfa1f921c3b04f2fded93 (patch) | |
| tree | 5867ad91eef65934da4de107a8e9e80facc6cfd6 /gcc/lambda-code.c | |
| parent | e75220c8ced33002009c5c9aa43a6db9015c9f50 (diff) | |
| download | gcc-ea4b78487cb4fa983c3bfa1f921c3b04f2fded93.zip gcc-ea4b78487cb4fa983c3bfa1f921c3b04f2fded93.tar.gz gcc-ea4b78487cb4fa983c3bfa1f921c3b04f2fded93.tar.bz2 | |
c-typeck.c, [...]: Fix comment formatting.
* c-typeck.c, defaults.h, dwarf.h, dwarf2out.c, fold-const.c,
gthr-dce.h, gthr-posix.h, gthr-solaris.h, gthr-win32.h,
lambda-code.c, lambda-mat.c, libgcc2.c, stmt.c,
tree-ssa-pre.c, tree-vn.c, tree.h: Fix comment formatting.
From-SVN: r88102
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 3faeee1..c1eb476 100644 --- a/gcc/lambda-code.c +++ b/gcc/lambda-code.c @@ -644,7 +644,7 @@ lambda_compute_auxillary_space (lambda_loopnest nest, Remember the constant are in our vector a, our coefficient matrix is A, and our invariant coefficient matrix is B */ - /* Swap B and B1, and a1 and a */ + /* Swap B and B1, and a1 and a. */ temp0 = B1; B1 = B; B = temp0; @@ -806,10 +806,10 @@ lambda_compute_target_space (lambda_loopnest auxillary_nest, /* Computes the gcd of the coefficients of the linear part. */ gcd1 = gcd_vector (target[i], i); - /* Include the denominator in the GCD */ + /* Include the denominator in the GCD. */ gcd1 = gcd (gcd1, determinant); - /* Now divide through by the gcd */ + /* Now divide through by the gcd. */ for (j = 0; j < i; j++) target[i][j] = target[i][j] / gcd1; @@ -822,7 +822,7 @@ lambda_compute_target_space (lambda_loopnest auxillary_nest, LL_LINEAR_OFFSET (target_loop) = expression; } - /* For each loop, compute the new bounds from H */ + /* For each loop, compute the new bounds from H. */ for (i = 0; i < depth; i++) { auxillary_loop = LN_LOOPS (auxillary_nest)[i]; |