Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
R
riscv-gcc-1
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
riscv-gcc-1
Commits
7ba03e5e
Commit
7ba03e5e
authored
Feb 07, 2014
by
Jeff Law
Committed by
Jeff Law
Feb 07, 2014
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* ipa-inline.c (inline_small_functions): Fix typos.
From-SVN: r207608
parent
acf601ae
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
12 additions
and
7 deletions
+12
-7
gcc/ChangeLog
+4
-0
gcc/ipa-inline.c
+8
-7
No files found.
gcc/ChangeLog
View file @
7ba03e5e
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)
...
...
gcc/ipa-inline.c
View file @
7ba03e5e
...
...
@@ -1749,9 +1749,9 @@ inline_small_functions (void)
continue
;
}
/* Heuristics for inlining small functions work
s
poorly for
recursive calls where we do ef
ect
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 ef
fects
similar to loop unrolling.
When inli
n
ing 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
)
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment