diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2007-06-13 02:27:04 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2007-06-13 02:27:04 +0000 |
| commit | bef304b8b52eab3ee756fceadade96d3410ed78e (patch) | |
| tree | 53bc6532998c58f2c87be78479fff08b511afc9a /gcc/tree-ssa-loop-prefetch.c | |
| parent | ed1dc2cd1ec1aafbcac80f88f3dc858c27b1d4f0 (diff) | |
| download | gcc-bef304b8b52eab3ee756fceadade96d3410ed78e.tar.gz | |
* auto-inc-dec.c, c-incpath.c, config/c4x/libgcc.S,
config/sh/divcost-analysis, dbgcnt.def, df-core.c,
df-problems.c, df-scan.c, df.h, dominance.c, dse.c, regstat.c,
tree-data-ref.c, tree-ssa-loop-im.c, tree-ssa-loop-prefetch.c,
tree-vect-transform.c: Fix comment typos. Follow spelling
conventions.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@125666 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/tree-ssa-loop-prefetch.c')
| -rw-r--r-- | gcc/tree-ssa-loop-prefetch.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/tree-ssa-loop-prefetch.c b/gcc/tree-ssa-loop-prefetch.c index 2424c4a1832..a4c2d089795 100644 --- a/gcc/tree-ssa-loop-prefetch.c +++ b/gcc/tree-ssa-loop-prefetch.c @@ -1334,7 +1334,7 @@ determine_loop_nest_reuse (struct loop *loop, struct mem_ref_group *refs, } /* Prepare the references in the form suitable for data dependence - analysis. We ignore unanalysable data references (the results + analysis. We ignore unanalyzable data references (the results are used just as a heuristics to estimate temporality of the references, hence we do not need to worry about correctness). */ for (gr = refs; gr; gr = gr->next) @@ -1376,7 +1376,7 @@ determine_loop_nest_reuse (struct loop *loop, struct mem_ref_group *refs, if (DDR_ARE_DEPENDENT (dep) == chrec_dont_know || DDR_NUM_DIST_VECTS (dep) == 0) { - /* If the dependence cannot be analysed, assume that there might be + /* If the dependence cannot be analyzed, assume that there might be a reuse. */ dist = 0; @@ -1385,7 +1385,7 @@ determine_loop_nest_reuse (struct loop *loop, struct mem_ref_group *refs, } else { - /* The distance vectors are normalised to be always lexicographically + /* The distance vectors are normalized to be always lexicographically positive, hence we cannot tell just from them whether DDR_A comes before DDR_B or vice versa. However, it is not important, anyway -- if DDR_A is close to DDR_B, then it is either reused in |