diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2004-10-28 13:31:53 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2004-10-28 13:31:53 +0000 |
| commit | 71882046281f1414174fb8ff14b072e159c5a2d4 (patch) | |
| tree | 0f497db2d97527ca7579bbfe5ed4c65acb24d5e8 /gcc/tree-cfg.c | |
| parent | 63058091fa0045a82d1777bd5046a80f920797ab (diff) | |
| download | gcc-71882046281f1414174fb8ff14b072e159c5a2d4.zip gcc-71882046281f1414174fb8ff14b072e159c5a2d4.tar.gz gcc-71882046281f1414174fb8ff14b072e159c5a2d4.tar.bz2 | |
lambda-code.c (nestify_update_pending_stmts): Remove.
* lambda-code.c (nestify_update_pending_stmts): Remove.
(perfect_nestify): Use flush_pending_stmts instead of
nestify_update_pending_stmts.
* tree-cfg.c (tree_make_forwarder_block): Use
flush_pending_stmts.
* tree-flow.h: Add a prototype for flush_pending_stmts.
* tree-ssa-loop-manip.c (tree_duplicate_loop_to_header_edge):
Use flush_pending_stmts.
(lv_update_pending_stmts): Remove.
(tree_ssa_loop_version): Use flush_pending_stmts instead of
lv_update_pending_stmts.
* tree-ssa.c (flush_pending_stmts): New.
From-SVN: r89757
Diffstat (limited to 'gcc/tree-cfg.c')
| -rw-r--r-- | gcc/tree-cfg.c | 15 |
1 files changed, 3 insertions, 12 deletions
diff --git a/gcc/tree-cfg.c b/gcc/tree-cfg.c index 8853ab5..e9f456d 100644 --- a/gcc/tree-cfg.c +++ b/gcc/tree-cfg.c @@ -3692,12 +3692,7 @@ tree_make_forwarder_block (edge fallthru) if (e == fallthru) continue; - for (phi = phi_nodes (bb), var = PENDING_STMT (e); - phi; - phi = PHI_CHAIN (phi), var = TREE_CHAIN (var)) - add_phi_arg (&phi, TREE_VALUE (var), e); - - PENDING_STMT (e) = NULL; + flush_pending_stmts (e); } } @@ -4598,7 +4593,7 @@ tree_duplicate_sese_region (edge entry, edge exit, struct loop *loop = entry->dest->loop_father; edge exit_copy; bitmap definitions; - tree phi, var; + tree phi; basic_block *doms; htab_t ssa_name_map = NULL; edge redirected; @@ -4667,11 +4662,7 @@ tree_duplicate_sese_region (edge entry, edge exit, /* Redirect the entry and add the phi node arguments. */ redirected = redirect_edge_and_branch (entry, entry->dest->rbi->copy); gcc_assert (redirected != NULL); - for (phi = phi_nodes (entry->dest), var = PENDING_STMT (entry); - phi; - phi = TREE_CHAIN (phi), var = TREE_CHAIN (var)) - add_phi_arg (&phi, TREE_VALUE (var), entry); - PENDING_STMT (entry) = NULL; + flush_pending_stmts (entry); /* Concerning updating of dominators: We must recount dominators for entry block and its copy. Anything that is outside of the region, but |