diff options
| author | Jan Hubicka <jh@suse.cz> | 2005-09-24 14:43:30 +0200 |
|---|---|---|
| committer | Jan Hubicka <hubicka@gcc.gnu.org> | 2005-09-24 12:43:30 +0000 |
| commit | 06191a239b2fe34bcc7338dcefdb1f3b9289c239 (patch) | |
| tree | 65dc8daa11fadff0c648fecf430944f0ddcca2f3 /gcc/cgraph.c | |
| parent | 26b7ebf6bf2dac324aaba62bab4b07863abe2c37 (diff) | |
| download | gcc-06191a239b2fe34bcc7338dcefdb1f3b9289c239.zip gcc-06191a239b2fe34bcc7338dcefdb1f3b9289c239.tar.gz gcc-06191a239b2fe34bcc7338dcefdb1f3b9289c239.tar.bz2 | |
cgraph.c (cgraph_clone_edge): Make the scale gcov_type.
* cgraph.c (cgraph_clone_edge): Make the scale gcov_type.
(cgraph_clone_node): Likewise.
* cgraph.h (cgraph_clone_edge): Update prototype.
(cgraph_mark_inline_edge, cgraph_clone_inlined_nodes): Remove
duplicated prototypes; add updating argument.
* cgraphunit.c (verify_cgraph_node): Verify that counts are non-negative.
* ipa-inline.c (cgraph_clone_inlined_nodes): Allow clonning without
updating profile.
(cgraph_mark_inline_edge): Likewise.
(cgraph_mark_inline): Update use of cgraph_mark_inline_edge.
(cgraph_flatten_node): Likewise.
(cgraph_decide_recursive_inlining): Likewise.
(cgraph_decide_inlining_of_small_function): Likewise.
* tree-optimize.c (tree_rest_of_compilation): Likewise.
From-SVN: r104601
Diffstat (limited to 'gcc/cgraph.c')
| -rw-r--r-- | gcc/cgraph.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/cgraph.c b/gcc/cgraph.c index 7a67f6d..32fbe30 100644 --- a/gcc/cgraph.c +++ b/gcc/cgraph.c @@ -884,7 +884,7 @@ cgraph_function_possibly_inlined_p (tree decl) /* Create clone of E in the node N represented by CALL_EXPR the callgraph. */ struct cgraph_edge * cgraph_clone_edge (struct cgraph_edge *e, struct cgraph_node *n, - tree call_stmt, int count_scale, int loop_nest, + tree call_stmt, gcov_type count_scale, int loop_nest, bool update_original) { struct cgraph_edge *new; @@ -911,7 +911,7 @@ cgraph_clone_node (struct cgraph_node *n, gcov_type count, int loop_nest, { struct cgraph_node *new = cgraph_create_node (); struct cgraph_edge *e; - int count_scale; + gcov_type count_scale; new->decl = n->decl; new->origin = n->origin; |