aboutsummaryrefslogtreecommitdiff
path: root/gcc/cprop.c
diff options
context:
space:
mode:
authorDavid Malcolm <dmalcolm@redhat.com>2013-11-19 16:50:04 +0000
committerDavid Malcolm <dmalcolm@gcc.gnu.org>2013-11-19 16:50:04 +0000
commitdc936fb236f9e85b88a8f59e2d33af2b76b786f7 (patch)
tree0e4b37c013785f1d15280b4b88f14b5e0e90663e /gcc/cprop.c
parente0f396bc05ef40940f4f158209df176e6c120b1c (diff)
downloadgcc-dc936fb236f9e85b88a8f59e2d33af2b76b786f7.zip
gcc-dc936fb236f9e85b88a8f59e2d33af2b76b786f7.tar.gz
gcc-dc936fb236f9e85b88a8f59e2d33af2b76b786f7.tar.bz2
Eliminate n_edges macro
* basic-block.h (n_edges_for_function): Rename macro to... (n_edges_for_fn): ...this. (n_edges): Eliminate macro as work towards making uses of cfun be explicit. * cfg.c (init_flow): Update for renaming of "n_edges_for_function" to "n_edges_for_fn". * cfg.c (unchecked_make_edge): Remove usage of n_edges macro. (clear_edges): Likewise. (free_edge): Likewise. * cfghooks.c (dump_flow_info): Likewise. * cprop.c (is_too_expensive): Likewise. * df-core.c (df_worklist_dataflow_doublequeue): Likewise. * gcse.c (is_too_expensive): Likewise. (prune_insertions_deletions): Likewise. * mcf.c (create_fixup_graph): Likewise. * sched-rgn.c (haifa_find_rgns): Likewise. * tree-cfg.c (gimple_dump_cfg): Likewise. * var-tracking.c (variable_tracking_main_1): Likewise. From-SVN: r205044
Diffstat (limited to 'gcc/cprop.c')
-rw-r--r--gcc/cprop.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/cprop.c b/gcc/cprop.c
index 78cfeba..35a44f2 100644
--- a/gcc/cprop.c
+++ b/gcc/cprop.c
@@ -1729,12 +1729,12 @@ is_too_expensive (const char *pass)
which have a couple switch statements. Rather than simply
threshold the number of blocks, uses something with a more
graceful degradation. */
- if (n_edges > 20000 + n_basic_blocks_for_fn (cfun) * 4)
+ if (n_edges_for_fn (cfun) > 20000 + n_basic_blocks_for_fn (cfun) * 4)
{
warning (OPT_Wdisabled_optimization,
"%s: %d basic blocks and %d edges/basic block",
pass, n_basic_blocks_for_fn (cfun),
- n_edges / n_basic_blocks_for_fn (cfun));
+ n_edges_for_fn (cfun) / n_basic_blocks_for_fn (cfun));
return true;
}