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
68cc8feb
Commit
68cc8feb
authored
Oct 28, 2012
by
Jan Hubicka
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Fix previous commit.
From-SVN: r192889
parent
b48ccf0d
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
3 additions
and
0 deletions
+3
-0
gcc/ipa-inline.c
+3
-0
No files found.
gcc/ipa-inline.c
View file @
68cc8feb
...
@@ -1337,6 +1337,7 @@ inline_small_functions (void)
...
@@ -1337,6 +1337,7 @@ inline_small_functions (void)
int
min_size
,
max_size
;
int
min_size
,
max_size
;
VEC
(
cgraph_edge_p
,
heap
)
*
new_indirect_edges
=
NULL
;
VEC
(
cgraph_edge_p
,
heap
)
*
new_indirect_edges
=
NULL
;
int
initial_size
=
0
;
int
initial_size
=
0
;
struct
cgraph_node
**
order
=
XCNEWVEC
(
struct
cgraph_node
*
,
cgraph_n_nodes
);
if
(
flag_indirect_inlining
)
if
(
flag_indirect_inlining
)
new_indirect_edges
=
VEC_alloc
(
cgraph_edge_p
,
heap
,
8
);
new_indirect_edges
=
VEC_alloc
(
cgraph_edge_p
,
heap
,
8
);
...
@@ -1345,6 +1346,8 @@ inline_small_functions (void)
...
@@ -1345,6 +1346,8 @@ inline_small_functions (void)
metrics. */
metrics. */
max_count
=
0
;
max_count
=
0
;
ipa_reduced_postorder
(
order
,
true
,
true
,
NULL
);
free
(
order
);
FOR_EACH_DEFINED_FUNCTION
(
node
)
FOR_EACH_DEFINED_FUNCTION
(
node
)
if
(
!
node
->
global
.
inlined_to
)
if
(
!
node
->
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