From 1c5fd343ded2f26d6bf1e6459d6d7b80cb8564e6 Mon Sep 17 00:00:00 2001 From: Felix Yang Date: Thu, 13 Nov 2014 16:04:30 +0000 Subject: [PATCH] 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 --- gcc/ChangeLog | 6 ++++++ gcc/ipa-profile.c | 2 +- gcc/ipa-utils.h | 2 +- gcc/tree-ssa-loop-ivcanon.c | 8 ++++---- 4 files changed, 12 insertions(+), 6 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index c6014e993a3..7bc943ad9fb 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,9 @@ +2014-11-13 Felix Yang + + * 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 PR tree-optimization/63841 diff --git a/gcc/ipa-profile.c b/gcc/ipa-profile.c index b83d1cf7cbc..99d13098534 100644 --- a/gcc/ipa-profile.c +++ b/gcc/ipa-profile.c @@ -22,7 +22,7 @@ along with GCC; see the file COPYING3. If not see - Count histogram construction. This is a histogram analyzing how much 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. Similar histogram is also estimated by coverage runtime. This histogram diff --git a/gcc/ipa-utils.h b/gcc/ipa-utils.h index b3701af7c24..e285722b190 100644 --- a/gcc/ipa-utils.h +++ b/gcc/ipa-utils.h @@ -85,7 +85,7 @@ cgraph_node *try_speculative_devirtualization (tree, HOST_WIDE_INT, ipa_polymorphic_call_context); /* 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 in the target cache. If user needs to visit every target list just once, it can memoize them. diff --git a/gcc/tree-ssa-loop-ivcanon.c b/gcc/tree-ssa-loop-ivcanon.c index 73ad46aedac..9bc8842946c 100644 --- a/gcc/tree-ssa-loop-ivcanon.c +++ b/gcc/tree-ssa-loop-ivcanon.c @@ -29,7 +29,7 @@ along with GCC; see the file COPYING3. If not see to pay up. 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 - simple peeling (i.e. copying few initial iterations prior the loop) when number of iteration estimate is known (typically by the profile @@ -422,7 +422,7 @@ estimated_unrolled_size (struct loop_size *size, the same time it does not make any code potentially executed 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. This is quite common case for loops of form @@ -775,7 +775,7 @@ try_unroll_loop_completely (struct loop *loop, loop->num); 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 body. For now we disable outer loop unrolling when the code would grow. */ @@ -986,7 +986,7 @@ try_peel_loop (struct loop *loop, { if (dump_file) fprintf (dump_file, "Not peeling: upper bound is known so can " - "unroll complettely\n"); + "unroll completely\n"); return false; } -- 2.30.2