Commit 1c5fd343 by Felix Yang Committed by Fei Yang

ipa-utils.h: Fix typo in comments.

        * ipa-utils.h: Fix typo in comments.
        * ipa-profile.c: Likewise.
        * tree-ssa-loop-ivcanon.c: Fix typo in comments and debugging dump.

From-SVN: r217507
parent 37e10165
2014-11-13 Felix Yang <felix.yang@huawei.com>
* ipa-utils.h: Fix typo in comments.
* ipa-profile.c: Likewise.
* tree-ssa-loop-ivcanon.c: Fix typo in comments and debugging dumps.
2014-11-13 Teresa Johnson <tejohnson@google.com> 2014-11-13 Teresa Johnson <tejohnson@google.com>
PR tree-optimization/63841 PR tree-optimization/63841
...@@ -22,7 +22,7 @@ along with GCC; see the file COPYING3. If not see ...@@ -22,7 +22,7 @@ along with GCC; see the file COPYING3. If not see
- Count histogram construction. This is a histogram analyzing how much - Count histogram construction. This is a histogram analyzing how much
time is spent executing statements with a given execution count read time is spent executing statements with a given execution count read
from profile feedback. This histogram is complette only with LTO, from profile feedback. This histogram is complete only with LTO,
otherwise it contains information only about the current unit. otherwise it contains information only about the current unit.
Similar histogram is also estimated by coverage runtime. This histogram Similar histogram is also estimated by coverage runtime. This histogram
......
...@@ -85,7 +85,7 @@ cgraph_node *try_speculative_devirtualization (tree, HOST_WIDE_INT, ...@@ -85,7 +85,7 @@ cgraph_node *try_speculative_devirtualization (tree, HOST_WIDE_INT,
ipa_polymorphic_call_context); ipa_polymorphic_call_context);
/* Return vector containing possible targets of polymorphic call E. /* Return vector containing possible targets of polymorphic call E.
If COMPLETEP is non-NULL, store true if the list is complette. If COMPLETEP is non-NULL, store true if the list is complete.
CACHE_TOKEN (if non-NULL) will get stored to an unique ID of entry CACHE_TOKEN (if non-NULL) will get stored to an unique ID of entry
in the target cache. If user needs to visit every target list in the target cache. If user needs to visit every target list
just once, it can memoize them. just once, it can memoize them.
......
...@@ -29,7 +29,7 @@ along with GCC; see the file COPYING3. If not see ...@@ -29,7 +29,7 @@ along with GCC; see the file COPYING3. If not see
to pay up. to pay up.
We also perform We also perform
- complette unrolling (or peeling) when the loops is rolling few enough - complete unrolling (or peeling) when the loops is rolling few enough
times times
- simple peeling (i.e. copying few initial iterations prior the loop) - simple peeling (i.e. copying few initial iterations prior the loop)
when number of iteration estimate is known (typically by the profile when number of iteration estimate is known (typically by the profile
...@@ -422,7 +422,7 @@ estimated_unrolled_size (struct loop_size *size, ...@@ -422,7 +422,7 @@ estimated_unrolled_size (struct loop_size *size,
the same time it does not make any code potentially executed the same time it does not make any code potentially executed
during the last iteration dead. during the last iteration dead.
After complette unrolling we still may get rid of the conditional After complete unrolling we still may get rid of the conditional
on the exit in the last copy even if we have no idea what it does. on the exit in the last copy even if we have no idea what it does.
This is quite common case for loops of form This is quite common case for loops of form
...@@ -775,7 +775,7 @@ try_unroll_loop_completely (struct loop *loop, ...@@ -775,7 +775,7 @@ try_unroll_loop_completely (struct loop *loop,
loop->num); loop->num);
return false; return false;
} }
/* Outer loops tend to be less interesting candidates for complette /* Outer loops tend to be less interesting candidates for complete
unrolling unless we can do a lot of propagation into the inner loop unrolling unless we can do a lot of propagation into the inner loop
body. For now we disable outer loop unrolling when the code would body. For now we disable outer loop unrolling when the code would
grow. */ grow. */
...@@ -986,7 +986,7 @@ try_peel_loop (struct loop *loop, ...@@ -986,7 +986,7 @@ try_peel_loop (struct loop *loop,
{ {
if (dump_file) if (dump_file)
fprintf (dump_file, "Not peeling: upper bound is known so can " fprintf (dump_file, "Not peeling: upper bound is known so can "
"unroll complettely\n"); "unroll completely\n");
return false; return false;
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment