diff options
author | Jan Hubicka <jh@suse.cz> | 2011-05-08 21:14:24 +0200 |
---|---|---|
committer | Jan Hubicka <hubicka@gcc.gnu.org> | 2011-05-08 19:14:24 +0000 |
commit | 74605a11f3c482656558d332058870d15cc718d5 (patch) | |
tree | bacaa437c56da65959eaf4a81ceee12d963848df /gcc/ipa-inline-transform.c | |
parent | 5c04950727f2a7a0e00c07776a417f24aea7da9a (diff) | |
download | gcc-74605a11f3c482656558d332058870d15cc718d5.zip gcc-74605a11f3c482656558d332058870d15cc718d5.tar.gz gcc-74605a11f3c482656558d332058870d15cc718d5.tar.bz2 |
cgraph.c (cgraph_clone_node): Add call_duplication_hook parameter.
* cgraph.c (cgraph_clone_node): Add call_duplication_hook parameter.
(cgraph_create_virtual_clone): Call hooks once virtual clone is finished.
* cgraph.h (cgraph_clone_node): Update prototype.
* ipa-cp.c (ipcp_estimate_growth): Use estimate_ipcp_clone_size_and_time.
* ipa-inline-transform.c (clone_inlined_nodes): Update.
* lto-cgraph.c (input_node): Update.
* ipa-inline.c (recursive_inlining): Update.
* ipa-inline.h (estimate_ipcp_clone_size_and_time): New function.
(evaluate_conditions_for_known_args): Break out from ...
(evaluate_conditions_for_edge): ... here.
(evaluate_conditions_for_ipcp_clone): New function.
(inline_node_duplication_hook): Update clone summary based
on parameter map.
(estimate_callee_size_and_time): Rename to ...
(estimate_node_size_and_time): take NODE instead of EDGE;
take POSSIBLE_TRUTHS as argument.
(estimate_callee_size_and_time): Update.
(estimate_ipcp_clone_size_and_time): New function.
(do_estimate_edge_time): Update.
From-SVN: r173551
Diffstat (limited to 'gcc/ipa-inline-transform.c')
-rw-r--r-- | gcc/ipa-inline-transform.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/ipa-inline-transform.c b/gcc/ipa-inline-transform.c index cf24a62c..85a47f8 100644 --- a/gcc/ipa-inline-transform.c +++ b/gcc/ipa-inline-transform.c @@ -133,7 +133,7 @@ clone_inlined_nodes (struct cgraph_edge *e, bool duplicate, struct cgraph_node *n; n = cgraph_clone_node (e->callee, e->callee->decl, e->count, e->frequency, - update_original, NULL); + update_original, NULL, true); cgraph_redirect_edge_callee (e, n); } } |