tree-ssa.c (ssa_remove_edge): Remove.

* tree-ssa.c (ssa_remove_edge): Remove.
	* tree-flow.h: Remove the corresponding prototype.
	* tree-cfg.c: Replace ssa_remove_edge with remove_edge.
	* basic-block.h: Likewise.
	* tree-if-conv.c: Likewise.
	* tree-ssa-threadupdate.c: Likewise.

From-SVN: r91039
This commit is contained in:
Kazu Hirata 2004-11-22 22:12:58 +00:00 committed by Kazu Hirata
parent 5628fde184
commit d0d2cc2105
7 changed files with 14 additions and 18 deletions

View File

@ -36,6 +36,13 @@
* tree-phinodes.c (remove_phi_arg_num): Make it static.
* tree-flow.h: Remove the corresponding prototype.
* tree-ssa.c (ssa_remove_edge): Remove.
* tree-flow.h: Remove the corresponding prototype.
* tree-cfg.c: Replace ssa_remove_edge with remove_edge.
* basic-block.h: Likewise.
* tree-if-conv.c: Likewise.
* tree-ssa-threadupdate.c: Likewise.
2004-11-23 Ben Elliston <bje@au.ibm.com>
* doc/cfg.texi (Maintaining the CFG): Use @ftable instead of

View File

@ -621,7 +621,7 @@ ei_safe_edge (edge_iterator i)
FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
{
IF (e != taken_edge)
ssa_remove_edge (e);
remove_edge (e);
ELSE
ei_next (&ei);
}

View File

@ -1972,7 +1972,7 @@ remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
/* Remove edges to BB's successors. */
while (EDGE_COUNT (bb->succs) > 0)
ssa_remove_edge (EDGE_SUCC (bb, 0));
remove_edge (EDGE_SUCC (bb, 0));
}
@ -2109,7 +2109,7 @@ cleanup_control_expr_graph (basic_block bb, block_stmt_iterator bsi)
{
taken_edge->probability += e->probability;
taken_edge->count += e->count;
ssa_remove_edge (e);
remove_edge (e);
retval = true;
}
else
@ -5294,7 +5294,7 @@ tree_purge_dead_eh_edges (basic_block bb)
{
if (e->flags & EDGE_EH)
{
ssa_remove_edge (e);
remove_edge (e);
changed = true;
}
else

View File

@ -572,7 +572,6 @@ extern void debug_tree_ssa (void);
extern void debug_def_blocks (void);
extern void dump_tree_ssa_stats (FILE *);
extern void debug_tree_ssa_stats (void);
extern void ssa_remove_edge (edge);
extern edge ssa_redirect_edge (edge, basic_block);
extern void flush_pending_stmts (edge);
extern bool tree_ssa_useless_type_conversion (tree);

View File

@ -889,9 +889,9 @@ combine_blocks (struct loop *loop)
/* It is time to remove this basic block. First remove edges. */
while (EDGE_COUNT (bb->succs) > 0)
ssa_remove_edge (EDGE_SUCC (bb, 0));
remove_edge (EDGE_SUCC (bb, 0));
while (EDGE_COUNT (bb->preds) > 0)
ssa_remove_edge (EDGE_PRED (bb, 0));
remove_edge (EDGE_PRED (bb, 0));
/* Remove labels and make stmts member of loop->header. */
for (bsi = bsi_start (bb); !bsi_end_p (bsi); )

View File

@ -169,7 +169,7 @@ remove_ctrl_stmt_and_useless_edges (basic_block bb, basic_block dest_bb)
for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
{
if (e->dest != dest_bb)
ssa_remove_edge (e);
remove_edge (e);
else
ei_next (&ei);
}

View File

@ -46,16 +46,6 @@ Boston, MA 02111-1307, USA. */
#include "tree-dump.h"
#include "tree-pass.h"
/* Remove edge E and remove the corresponding arguments from the PHI nodes
in E's destination block. */
void
ssa_remove_edge (edge e)
{
remove_edge (e);
}
/* Remove the corresponding arguments from the PHI nodes in E's
destination block and redirect it to DEST. Return redirected edge.
The list of removed arguments is stored in PENDING_STMT (e). */