+2012-11-08 Steven Bosscher <steven@gcc.gnu.org>
+
+ PR tree-optimization/55191
+ * cfganal.c (connect_infinite_loops_to_exit): Call dfs_deadend here.
+ (flow_dfs_compute_reverse_execute): Don't call it here.
+
2012-11-08 Jakub Jelinek <jakub@redhat.com>
PR debug/53145
connect_infinite_loops_to_exit (void)
{
basic_block unvisited_block = EXIT_BLOCK_PTR;
+ basic_block deadend_block;
struct depth_first_search_dsS dfs_ds;
/* Perform depth-first search in the reverse graph to find nodes
if (!unvisited_block)
break;
- make_edge (unvisited_block, EXIT_BLOCK_PTR, EDGE_FAKE);
- flow_dfs_compute_reverse_add_bb (&dfs_ds, unvisited_block);
+ deadend_block = dfs_find_deadend (unvisited_block);
+ make_edge (deadend_block, EXIT_BLOCK_PTR, EDGE_FAKE);
+ flow_dfs_compute_reverse_add_bb (&dfs_ds, deadend_block);
}
flow_dfs_compute_reverse_finish (&dfs_ds);
/* Determine if there are unvisited basic blocks. */
FOR_BB_BETWEEN (bb, last_unvisited, NULL, prev_bb)
if (!bitmap_bit_p (data->visited_blocks, bb->index))
- return dfs_find_deadend (bb);
+ return bb;
return NULL;
}
+2012-11-08 Steven Bosscher <steven@gcc.gnu.org>
+
+ PR tree-optimization/55191
+ * gcc.dg/pr55191.c: New test.
+
2012-11-08 Jakub Jelinek <jakub@redhat.com>
PR debug/54499
--- /dev/null
+/* PR tree-optimization/55191 */
+/* { dg-do compile } */
+/* { dg-options "-O2" } */
+
+int a, b;
+
+void f(void)
+{
+ b = a || b;
+
+ for(a = 0; a < 2; a++);
+ while(1);
+}
+