From 2a7e31df70cf600dfaa401cb426578994739bce0 Mon Sep 17 00:00:00 2001 From: Kazu Hirata Date: Sun, 5 Sep 2004 15:24:15 +0000 Subject: c-common.c, [...]: Fix comment typos. * c-common.c, cfgexpand.c, cgraphunit.c, defaults.h, et-forest.c, expr.c, gimplify.c, global.c, gthr-lynx.h, hard-reg-set.h, modulo-sched.c, optabs.c, postreload-gcse.c, tree-data-ref.c, tree-flow.h, tree-if-conv.c, tree-inline.c, tree-sra.c, tree-ssa-loop-im.c, tree-ssa-loop-ivopts.c, tree-ssa-loop-niter.c, tree-ssa-operands.c, tree-ssa-operands.h, tree-ssa-propagate.c, tree-ssa-propagate.h, tree-ssa-threadupdate.c, value-prof.c, vec.c, vec.h: Fix comment typos. Follow spelling conventions. From-SVN: r87104 --- gcc/value-prof.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'gcc/value-prof.c') diff --git a/gcc/value-prof.c b/gcc/value-prof.c index a01c1c9..3f9caeb 100644 --- a/gcc/value-prof.c +++ b/gcc/value-prof.c @@ -62,7 +62,7 @@ static struct value_prof_hooks *value_prof_hooks; -- list of counters starting from the first one. */ /* For speculative prefetching, the range in that we do not prefetch (because - we assume that it will be in cache anyway). The assymetry between min and + we assume that it will be in cache anyway). The asymmetry between min and max range is trying to reflect the fact that the sequential prefetching of the data is commonly done directly by hardware. Nevertheless, these values are just a guess and should of course be target-specific. */ @@ -971,7 +971,7 @@ speculative_prefetching_transform (rtx insn) /* We require that count is at least half of all; this means that for the transformation to fire the value must be constant - at least 50% of time (and 75% gives the garantee of usage). */ + at least 50% of time (and 75% gives the guarantee of usage). */ if (!rtx_equal_p (address, value) || 2 * count < all) return false; -- cgit v1.1