FreeChainXenon/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

ipa-fnsummary.h (enum ipa_hints_vals): Fix comment typo, preffer -> prefer.

Browse source 
* ipa-fnsummary.h (enum ipa_hints_vals): Fix comment typo,
	preffer -> prefer.
	* ipa-inline.c (edge_badness): Likewise.
	* lto-streamer.h (class lto_location_cache): Likewise.
	* tree-ssa-sink.c (select_best_block): Likewise.  Fix comment typos,
	gratutious -> gratuitous.

From-SVN: r278546
This commit is contained in:
Jakub Jelinek 2019-11-21 10:39:47 +01:00 • committed by Jakub Jelinek
parent a877996fa3
commit e4112065b0
5 changed files with 15 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
gcc/ChangeLog
View file

@ -1,3 +1,12 @@
2019-11-21 Jakub Jelinek <jakub@redhat.com>
* ipa-fnsummary.h (enum ipa_hints_vals): Fix comment typo,
preffer -> prefer.
* ipa-inline.c (edge_badness): Likewise.
* lto-streamer.h (class lto_location_cache): Likewise.
* tree-ssa-sink.c (select_best_block): Likewise. Fix comment typos,
gratutious -> gratuitous.
2019-11-21 Richard Biener <rguenther@suse.de> 2019-11-21 Richard Biener <rguenther@suse.de>
Revert Revert

2
gcc/ipa-fnsummary.h
View file

@ -25,7 +25,7 @@ along with GCC; see the file COPYING3. If not see
#include "ipa-predicate.h" #include "ipa-predicate.h"
/* Hints are reasons why IPA heuristics should preffer specializing given /* Hints are reasons why IPA heuristics should prefer specializing given
function. They are represtented as bitmap of the following values. */ function. They are represtented as bitmap of the following values. */
enum ipa_hints_vals { enum ipa_hints_vals {
/* When specialization turns indirect call into a direct call, /* When specialization turns indirect call into a direct call,

2
gcc/ipa-inline.c
View file

@ -1265,7 +1265,7 @@ edge_badness (struct cgraph_edge *edge, bool dump)
} }
if (overall_growth > 0) if (overall_growth > 0)
{ {
/* Strongly preffer functions with few callers that can be inlined /* Strongly prefer functions with few callers that can be inlined
fully. The square root here leads to smaller binaries at average. fully. The square root here leads to smaller binaries at average.
Watch however for extreme cases and return to linear function Watch however for extreme cases and return to linear function
when growth is large. */ when growth is large. */

2
gcc/lto-streamer.h
View file

@ -296,7 +296,7 @@ typedef void (lto_free_section_data_f) (struct lto_file_decl_data *,
size_t); size_t);
/* The location cache holds expanded locations for streamed in trees. /* The location cache holds expanded locations for streamed in trees.
This is done to reduce memory usage of libcpp linemap that strongly preffers This is done to reduce memory usage of libcpp linemap that strongly prefers
locations to be inserted in the soruce order. */ locations to be inserted in the soruce order. */
class lto_location_cache class lto_location_cache

6
gcc/tree-ssa-sink.c
View file

@ -176,7 +176,7 @@ nearest_common_dominator_of_uses (def_operand_p def_p, bool *debug_stmts)
If the resulting block is in a shallower loop nest, then use it. Else If the resulting block is in a shallower loop nest, then use it. Else
only use the resulting block if it has significantly lower execution only use the resulting block if it has significantly lower execution
frequency than EARLY_BB to avoid gratutious statement movement. We frequency than EARLY_BB to avoid gratuitous statement movement. We
consider statements with VOPS more desirable to move. consider statements with VOPS more desirable to move.
This pass would obviously benefit from PDO as it utilizes block This pass would obviously benefit from PDO as it utilizes block
@ -223,9 +223,9 @@ select_best_block (basic_block early_bb,
} }
/* If BEST_BB is at the same nesting level, then require it to have /* If BEST_BB is at the same nesting level, then require it to have
significantly lower execution frequency to avoid gratutious movement. */ significantly lower execution frequency to avoid gratuitous movement. */
if (bb_loop_depth (best_bb) == bb_loop_depth (early_bb) if (bb_loop_depth (best_bb) == bb_loop_depth (early_bb)
/* If result of comparsion is unknown, preffer EARLY_BB. /* If result of comparsion is unknown, prefer EARLY_BB.
Thus use !(...>=..) rather than (...<...) */ Thus use !(...>=..) rather than (...<...) */
&& !(best_bb->count.apply_scale (100, 1) && !(best_bb->count.apply_scale (100, 1)
> (early_bb->count.apply_scale (threshold, 1)))) > (early_bb->count.apply_scale (threshold, 1))))