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

gimple-iterator.c (gimple_find_edge_insert_loc): Use gimple_seq_empty_p to test for no PHI nodes. 

* gimple-iterator.c (gimple_find_edge_insert_loc): Use
        gimple_seq_empty_p to test for no PHI nodes.
        * tree-cfg.c (split_critical_edges): Likewise.

From-SVN: r151602
This commit is contained in:
Richard Henderson 2009-09-10 11:01:23 -07:00 committed by Richard Henderson
parent 15a15e8dc4
commit 671f9f3098
3 changed files with 9 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/ChangeLog
View File

@ -1,3 +1,9 @@
2009-09-10 Richard Henderson <rth@redhat.com>
* gimple-iterator.c (gimple_find_edge_insert_loc): Use
gimple_seq_empty_p to test for no PHI nodes.
* tree-cfg.c (split_critical_edges): Likewise.
2009-09-10 Richard Henderson <rth@redhat.com>
* c-common.h (c_dialect_cxx, c_dialect_objc): Boolify.

4
gcc/gimple-iterator.c
View File

@ -623,9 +623,9 @@ gimple_find_edge_insert_loc (edge e, gimple_stmt_iterator *gsi,
would have to examine the PHIs to prove that none of them used
the value set by the statement we want to insert on E. That
hardly seems worth the effort. */
restart:
restart:
if (single_pred_p (dest)
&& ! phi_nodes (dest)
&& gimple_seq_empty_p (phi_nodes (dest))
&& dest != EXIT_BLOCK_PTR)
{
*gsi = gsi_start_bb (dest);

2
gcc/tree-cfg.c
View File

@ -7250,7 +7250,7 @@ split_critical_edges (void)
Go ahead and split them too. This matches the logic in
gimple_find_edge_insert_loc. */
else if ((!single_pred_p (e->dest)
|| phi_nodes (e->dest)
|| !gimple_seq_empty_p (phi_nodes (e->dest))
|| e->dest == EXIT_BLOCK_PTR)
&& e->src != ENTRY_BLOCK_PTR
&& !(e->flags & EDGE_ABNORMAL))