diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-10-22 17:05:11 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-10-22 17:05:11 +0000 |
| commit | dac49aa5c53ad15cdab5f898160dbe72708c98d3 (patch) | |
| tree | 78237ea08ce69e2e4f29b80e8bf73c2c708305a4 /gcc/lambda-code.c | |
| parent | e1cc2b2778f70e065dbe4189d50399c926a6221c (diff) | |
| download | gcc-dac49aa5c53ad15cdab5f898160dbe72708c98d3.tar.gz | |
* alias.c, basic-block.h, cgraphunit.c, combine.c, domwalk.h,
final.c, gengtype.c, genpreds.c, ggc-page.c, insn-notes.def,
lambda-code.c, loop-unroll.c, modulo-sched.c, pointer-set.c,
pretty-print.c, ra-colorize.c, sbitmap.c, tree-complex.c,
tree-data-ref.c, tree-dfa.c, tree-inline.c, tree-into-ssa.c,
tree-scalar-evolution.c, tree-ssa-dom.c,
tree-ssa-loop-manip.c, tree-ssa-loop-niter.c,
tree-ssa-phiopt.c, tree-ssa-pre.c, tree-ssa-threadupdate.c,
tree-vectorizer.c, vec.h: Fix comment formatting.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@89453 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/lambda-code.c')
| -rw-r--r-- | gcc/lambda-code.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/lambda-code.c b/gcc/lambda-code.c index 4ad62b49eff..4ff4859881f 100644 --- a/gcc/lambda-code.c +++ b/gcc/lambda-code.c @@ -357,7 +357,7 @@ print_lambda_loopnest (FILE * outfile, lambda_loopnest nest, char start) } /* Allocate a new lattice structure of DEPTH x DEPTH, with INVARIANTS number - of invariants. */ + of invariants. */ static lambda_lattice lambda_lattice_new (int depth, int invariants) @@ -575,7 +575,7 @@ compute_nest_using_fourier_motzkin (int size, else if (A[j][i] > 0) { /* Any linear expression with a coefficient greater than 0 - becomes part of the new upper bound. */ + becomes part of the new upper bound. */ expression = lambda_linear_expression_new (depth, invariants); for (k = 0; k < i; k++) LLE_COEFFICIENTS (expression)[k] = -1 * A[j][k]; @@ -2008,7 +2008,7 @@ stmt_uses_phi_result (tree stmt, tree phi_result) use_optype uses = STMT_USE_OPS (stmt); /* This is conservatively true, because we only want SIMPLE bumpers - of the form x +- constant for our pass. */ + of the form x +- constant for our pass. */ if (NUM_USES (uses) != 1) return false; if (USE_OP (uses, 0) == phi_result) @@ -2148,7 +2148,7 @@ replace_uses_of_x_with_y (tree stmt, tree x, tree y) } } -/* Return TRUE if STMT uses tree OP in it's uses. */ +/* Return TRUE if STMT uses tree OP in it's uses. */ static bool stmt_uses_op (tree stmt, tree op) @@ -2206,7 +2206,7 @@ can_convert_to_perfect_nest (struct loop *loop, } /* If the bb of a statement we care about isn't dominated by - the header of the inner loop, then we are also screwed. */ + the header of the inner loop, then we are also screwed. */ if (!dominated_by_p (CDI_DOMINATORS, bb_for_stmt (stmt), loop->inner->header)) |