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/cgraphunit.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/cgraphunit.c')
| -rw-r--r-- | gcc/cgraphunit.c | 10 |
1 files changed, 10 insertions, 0 deletions
diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c index e357a25..181ee4e 100644 --- a/gcc/cgraphunit.c +++ b/gcc/cgraphunit.c @@ -663,8 +663,18 @@ verify_cgraph_node (struct cgraph_node *node) cgraph_node_name (e->caller), cgraph_node_name (e->callee)); error_found = true; } + if (node->count < 0) + { + error ("Execution count is negative"); + error_found = true; + } for (e = node->callers; e; e = e->next_caller) { + if (e->count < 0) + { + error ("caller edge count is negative"); + error_found = true; + } if (!e->inline_failed) { if (node->global.inlined_to |