diff options
author | bje <bje@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-09-29 21:23:35 +0000 |
---|---|---|
committer | bje <bje@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-09-29 21:23:35 +0000 |
commit | 90aca266ceba90050158e8146fef07ad8f976e7d (patch) | |
tree | 686caa606abc0cc169ce57c7911125aa93f2bb68 /gcc/tree-into-ssa.c | |
parent | 86777552b33412a3437f8253546d3e9bf3b4b76d (diff) | |
download | gcc-90aca266ceba90050158e8146fef07ad8f976e7d.tar.gz |
* tree-flow.h (struct bb_ann_d): Remove num_preds member.
* tree-into-ssa.c (rewrite_into_ssa): Don't set it.
(rewrite_ssa_into_ssa): Likewise.
* tree-phinodes.c (create_phi_node): Access the number of
predecessor edges using EDGE_COUNT() and not num_preds.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@88308 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/tree-into-ssa.c')
-rw-r--r-- | gcc/tree-into-ssa.c | 10 |
1 files changed, 2 insertions, 8 deletions
diff --git a/gcc/tree-into-ssa.c b/gcc/tree-into-ssa.c index ec51faaa3cb..841938db1a9 100644 --- a/gcc/tree-into-ssa.c +++ b/gcc/tree-into-ssa.c @@ -1450,10 +1450,7 @@ rewrite_into_ssa (bool all) can save significant time during PHI insertion for large graphs. */ dfs = (bitmap *) xmalloc (last_basic_block * sizeof (bitmap *)); FOR_EACH_BB (bb) - { - bb_ann (bb)->num_preds = EDGE_COUNT (bb->preds); - dfs[bb->index] = BITMAP_XMALLOC (); - } + dfs[bb->index] = BITMAP_XMALLOC (); for (i = 0; i < num_referenced_vars; i++) set_current_def (referenced_var (i), NULL_TREE); @@ -1579,10 +1576,7 @@ rewrite_ssa_into_ssa (void) can save significant time during PHI insertion for large graphs. */ dfs = (bitmap *) xmalloc (last_basic_block * sizeof (bitmap *)); FOR_EACH_BB (bb) - { - bb_ann (bb)->num_preds = EDGE_COUNT (bb->preds); - dfs[bb->index] = BITMAP_XMALLOC (); - } + dfs[bb->index] = BITMAP_XMALLOC (); /* Ensure that the dominance information is OK. */ calculate_dominance_info (CDI_DOMINATORS); |