diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2006-03-04 23:05:24 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2006-03-04 23:05:24 +0000 |
| commit | 334ec2d868e3e9826b43a221aed0ce9316dce19d (patch) | |
| tree | 4350c209f16fe5635562cd7e6a9850c631419372 /gcc/tree-ssa-loop-prefetch.c | |
| parent | 3b94331f5f97e6c371e4f1506691a849440836d8 (diff) | |
| download | gcc-334ec2d868e3e9826b43a221aed0ce9316dce19d.tar.gz | |
* builtins.c, c-pragma.h, c-typeck.c, cgraph.c, cgraphunit.c,
combine.c, common.opt, config/dfp-bit.c, config/i386/i386.c,
config/m68k/m68k.c, config/m68k/m68k.md, config/mt/mt.c,
config/mt/mt.h, config/s390/s390.md, df-core.c, df-problems.c,
df-scan.c, df.h, diagnostic.c, expr.c, function.h, gimplify.c,
loop-invariant.c, omp-low.c, opts.c, passes.c,
rtl-factoring.c, rtlanal.c, struct-equiv.c, tree-cfgcleanup.c,
tree-ssa-loop-niter.c, tree-ssa-loop-prefetch.c,
tree-ssa-structalias.c, tree-ssa-threadedge.c,
tree-ssa-threadupdate.c, tree-vect-patterns.c,
tree-vect-transform.c, tree-vectorizer.h, tree-vrp.c,
unwind-dw2.c: Fix comment typos. Follow spelling conventions.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@111721 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/tree-ssa-loop-prefetch.c')
| -rw-r--r-- | gcc/tree-ssa-loop-prefetch.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/tree-ssa-loop-prefetch.c b/gcc/tree-ssa-loop-prefetch.c index 911b389ecd2..c00aaea3093 100644 --- a/gcc/tree-ssa-loop-prefetch.c +++ b/gcc/tree-ssa-loop-prefetch.c @@ -115,7 +115,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA /* Magic constants follow. These should be replaced by machine specific numbers. */ -/* A number that should rouhgly correspond to the number of instructions +/* A number that should roughly correspond to the number of instructions executed before the prefetch is completed. */ #ifndef PREFETCH_LATENCY @@ -768,7 +768,7 @@ schedule_prefetches (struct mem_ref_group *groups, unsigned unroll_factor, /* For now we just take memory references one by one and issue prefetches for as many as possible. The groups are sorted starting with the largest step, since the references with - large step are more likely to cause many cache mises. */ + large step are more likely to cause many cache misses. */ for (; groups; groups = groups->next) for (ref = groups->refs; ref; ref = ref->next) |