diff options
| author | Jan Hubicka <jh@suse.cz> | 2005-05-19 12:38:42 +0200 |
|---|---|---|
| committer | Jan Hubicka <hubicka@gcc.gnu.org> | 2005-05-19 10:38:42 +0000 |
| commit | e42922b1ae4c3da94882d3a92ce978a0db123064 (patch) | |
| tree | 1d011084a5002e1aadab35d8ef841e441fb68211 /gcc/ipa-inline.c | |
| parent | eef16504e21f8d504b6a648cf73955e977d5adf6 (diff) | |
| download | gcc-e42922b1ae4c3da94882d3a92ce978a0db123064.zip gcc-e42922b1ae4c3da94882d3a92ce978a0db123064.tar.gz gcc-e42922b1ae4c3da94882d3a92ce978a0db123064.tar.bz2 | |
basic-block.h (REG_BR_PROB_BASE): Define.
* basic-block.h (REG_BR_PROB_BASE): Define.
* cgraph.c (cgraph_create_edge): Initialize loop_nest and count.
(dump_cgraph_node): Dump count.
(cgraph_clone_edge): Rescale counts.
(cgraph_clone_node): Likewise.
* cgraph.h: Include basic-block.h
(cgraph_node): Add count.
(cgraph_edge): Add count and loop_nest.
(cgraph_node, cgraph_edge, cgraph_clone_edge, cgraph_clone_node):
Update prototypes.
* cgraphunit.c: Kill now redundant inlining comment.
(cgraph_create_edges): Make static, maintain current basic block;
fix pasto.
(record_call_1): Fill in new fields.
* ipa-inline.c (cgraph_clone_inlined_nodes): Update call of
cgraph_clone_node.
(cgraph_decide_recursive_inlining): Likewise.
* rtl.h (REG_BR_PROB_BASE): Kill.
* tree-inline.c (copy_body_r): Update call of cgraph_clone_edge.
(expand_call_inline): Update call of cgraph_create_edge.
* tree-optimize.c (tree_rest_of_compilation): Likewise.
From-SVN: r99976
Diffstat (limited to 'gcc/ipa-inline.c')
| -rw-r--r-- | gcc/ipa-inline.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c index f1236ea..79150d2 100644 --- a/gcc/ipa-inline.c +++ b/gcc/ipa-inline.c @@ -123,7 +123,7 @@ cgraph_clone_inlined_nodes (struct cgraph_edge *e, bool duplicate) } else if (duplicate) { - n = cgraph_clone_node (e->callee); + n = cgraph_clone_node (e->callee, e->count, e->loop_nest); cgraph_redirect_edge_callee (e, n); } @@ -369,7 +369,7 @@ cgraph_decide_recursive_inlining (struct cgraph_node *node) cgraph_node_name (node)); /* We need original clone to copy around. */ - master_clone = cgraph_clone_node (node); + master_clone = cgraph_clone_node (node, 0, 1); master_clone->needed = true; for (e = master_clone->callees; e; e = e->next_callee) if (!e->inline_failed) |