diff options
author | Jeff Law <law@redhat.com> | 2014-02-07 10:29:26 -0700 |
---|---|---|
committer | Jeff Law <law@gcc.gnu.org> | 2014-02-07 10:29:26 -0700 |
commit | 7ba03e5e3f37374e30fc67e059f5eb46364c0474 (patch) | |
tree | 1e004f7c1b7e5d06ac0ee2672c43dd8a9a6a2f4a | |
parent | acf601aefd44b7c2615c78408b32e862212d34ef (diff) | |
download | gcc-7ba03e5e3f37374e30fc67e059f5eb46364c0474.zip gcc-7ba03e5e3f37374e30fc67e059f5eb46364c0474.tar.gz gcc-7ba03e5e3f37374e30fc67e059f5eb46364c0474.tar.bz2 |
* ipa-inline.c (inline_small_functions): Fix typos.
From-SVN: r207608
-rw-r--r-- | gcc/ChangeLog | 4 | ||||
-rw-r--r-- | gcc/ipa-inline.c | 15 |
2 files changed, 12 insertions, 7 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 5703bb5..ce9c066 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,7 @@ +2014-02-07 Jeff Law <law@redhat.com> + + * ipa-inline.c (inline_small_functions): Fix typos. + 2014-02-07 Richard Sandiford <rsandifo@linux.vnet.ibm.com> * config/s390/s390-protos.h (s390_can_use_simple_return_insn) diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c index ce24ea5..d304133 100644 --- a/gcc/ipa-inline.c +++ b/gcc/ipa-inline.c @@ -1749,9 +1749,9 @@ inline_small_functions (void) continue; } - /* Heuristics for inlining small functions works poorly for - recursive calls where we do efect similar to loop unrolling. - When inliing such edge seems profitable, leave decision on + /* Heuristics for inlining small functions work poorly for + recursive calls where we do effects similar to loop unrolling. + When inlining such edge seems profitable, leave decision on specific inliner. */ if (cgraph_edge_recursive_p (edge)) { @@ -1779,10 +1779,11 @@ inline_small_functions (void) struct cgraph_node *outer_node = NULL; int depth = 0; - /* Consider the case where self recursive function A is inlined into B. - This is desired optimization in some cases, since it leads to effect - similar of loop peeling and we might completely optimize out the - recursive call. However we must be extra selective. */ + /* Consider the case where self recursive function A is inlined + into B. This is desired optimization in some cases, since it + leads to effect similar of loop peeling and we might completely + optimize out the recursive call. However we must be extra + selective. */ where = edge->caller; while (where->global.inlined_to) |