OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

tree-flow.h (struct bb_ann_d): Remove num_preds member.

Browse Source 
* 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.

Co-Authored-By: Andrew Pinski <pinskia@physics.uc.edu>
Co-Authored-By: Steven Bosscher <stevenb@suse.de>

From-SVN: r88308
This commit is contained in:
Ben Elliston 2004-09-29 21:23:35 +00:00 committed by Ben Elliston
parent 983de0da66
commit 2a7cd6864b
4 changed files with 12 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
gcc/ChangeLog
View File

@ -1,3 +1,11 @@
2004-09-30 Ben Elliston <bje@au.ibm.com>
* 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.
2004-09-29 Joseph S. Myers <jsm@polyomino.org.uk>
PR c/7425
@ -257,7 +265,7 @@
Properly mask the immediate field of the 'unimp' instruction.
(call_symbolic_struct_value_sp32): Likewise.
2004-09-24 Ben Elliston <bje@au.ibm.com>
2004-09-28 Ben Elliston <bje@au.ibm.com>
Steven Bosscher <stevenb@suse.de>
Andrew Pinski <pinskia@physics.uc.edu>

4
gcc/tree-flow.h
View File

@ -342,10 +342,6 @@ struct bb_ann_d GTY(())
/* Chain of PHI nodes for this block. */
tree phi_nodes;
/* Number of predecessors for this block. This is only valid during
SSA rewriting. It is not maintained after conversion into SSA form. */
int num_preds;
/* Nonzero if this block is forwardable during cfg cleanups. This is also
used to detect loops during cfg cleanups. */
unsigned forwardable: 1;

10
gcc/tree-into-ssa.c
View File

@ -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);

2
gcc/tree-phinodes.c
View File

@ -291,7 +291,7 @@ create_phi_node (tree var, basic_block bb)
{
tree phi;
phi = make_phi_node (var, bb_ann (bb)->num_preds);
phi = make_phi_node (var, EDGE_COUNT (bb->preds));
/* This is a new phi node, so note that is has not yet been
rewritten. */