summaryrefslogtreecommitdiff
path: root/gcc/ipa-utils.c
diff options
context:
space:
mode:
Diffstat (limited to 'gcc/ipa-utils.c')
-rw-r--r--gcc/ipa-utils.c28
1 files changed, 14 insertions, 14 deletions
diff --git a/gcc/ipa-utils.c b/gcc/ipa-utils.c
index 590ac270d0a..552071ed024 100644
--- a/gcc/ipa-utils.c
+++ b/gcc/ipa-utils.c
@@ -173,7 +173,7 @@ ipa_reduced_postorder (struct cgraph_node **order,
struct cgraph_node *node;
struct searchc_env env;
splay_tree_node result;
- env.stack = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes);
+ env.stack = XCNEWVEC (struct cgraph_node *, symtab->cgraph_count);
env.stack_size = 0;
env.result = order;
env.order_pos = 0;
@@ -292,7 +292,7 @@ ipa_reverse_postorder (struct cgraph_node **order)
struct ipa_ref *ref = NULL;
struct postorder_stack *stack =
- XCNEWVEC (struct postorder_stack, cgraph_n_nodes);
+ XCNEWVEC (struct postorder_stack, symtab->cgraph_count);
/* We have to deal with cycles nicely, so use a depth first traversal
output algorithm. Ignore the fact that some functions won't need
@@ -407,9 +407,9 @@ ipa_merge_profiles (struct cgraph_node *dst,
if (!dst->count)
return;
- if (cgraph_dump_file)
+ if (symtab->dump_file)
{
- fprintf (cgraph_dump_file, "Merging profiles of %s/%i to %s/%i\n",
+ fprintf (symtab->dump_file, "Merging profiles of %s/%i to %s/%i\n",
xstrdup (src->name ()), src->order,
xstrdup (dst->name ()), dst->order);
}
@@ -456,16 +456,16 @@ ipa_merge_profiles (struct cgraph_node *dst,
if (n_basic_blocks_for_fn (srccfun)
!= n_basic_blocks_for_fn (dstcfun))
{
- if (cgraph_dump_file)
- fprintf (cgraph_dump_file,
+ if (symtab->dump_file)
+ fprintf (symtab->dump_file,
"Giving up; number of basic block mismatch.\n");
match = false;
}
else if (last_basic_block_for_fn (srccfun)
!= last_basic_block_for_fn (dstcfun))
{
- if (cgraph_dump_file)
- fprintf (cgraph_dump_file,
+ if (symtab->dump_file)
+ fprintf (symtab->dump_file,
"Giving up; last block mismatch.\n");
match = false;
}
@@ -480,8 +480,8 @@ ipa_merge_profiles (struct cgraph_node *dst,
dstbb = BASIC_BLOCK_FOR_FN (dstcfun, srcbb->index);
if (dstbb == NULL)
{
- if (cgraph_dump_file)
- fprintf (cgraph_dump_file,
+ if (symtab->dump_file)
+ fprintf (symtab->dump_file,
"No matching block for bb %i.\n",
srcbb->index);
match = false;
@@ -489,8 +489,8 @@ ipa_merge_profiles (struct cgraph_node *dst,
}
if (EDGE_COUNT (srcbb->succs) != EDGE_COUNT (dstbb->succs))
{
- if (cgraph_dump_file)
- fprintf (cgraph_dump_file,
+ if (symtab->dump_file)
+ fprintf (symtab->dump_file,
"Edge count mistmatch for bb %i.\n",
srcbb->index);
match = false;
@@ -502,8 +502,8 @@ ipa_merge_profiles (struct cgraph_node *dst,
edge dste = EDGE_SUCC (dstbb, i);
if (srce->dest->index != dste->dest->index)
{
- if (cgraph_dump_file)
- fprintf (cgraph_dump_file,
+ if (symtab->dump_file)
+ fprintf (symtab->dump_file,
"Succ edge mistmatch for bb %i.\n",
srce->dest->index);
match = false;