summaryrefslogtreecommitdiff
path: root/gcc/ira-build.c
diff options
context:
space:
mode:
authorvmakarov <vmakarov@138bc75d-0d04-0410-961f-82ee72b054a4>2011-05-24 16:28:38 +0000
committervmakarov <vmakarov@138bc75d-0d04-0410-961f-82ee72b054a4>2011-05-24 16:28:38 +0000
commitc199e49cd8e01d5116dba333c3cd793ed65f3279 (patch)
tree4fb4b54df96d20c8e00030ffa6393278042fcecf /gcc/ira-build.c
parent59813b406b20d7bb8d630d4239d6220621920a32 (diff)
downloadgcc-c199e49cd8e01d5116dba333c3cd793ed65f3279.tar.gz
2011-05-24 Vladimir Makarov <vmakarov@redhat.com>
PR rtl-optimization/48633 * ira-build.c (loop_with_eh_edge_p): New function. (mark_loops_for_removal): Use it. 2011-05-24 Michael Matz <matz@gcc.gnu.org> PR rtl-optimization/48633 * g++.dg/pr48633.C: New test. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@174124 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ira-build.c')
-rw-r--r--gcc/ira-build.c32
1 files changed, 28 insertions, 4 deletions
diff --git a/gcc/ira-build.c b/gcc/ira-build.c
index 09897d95387..31d0199791a 100644
--- a/gcc/ira-build.c
+++ b/gcc/ira-build.c
@@ -1806,6 +1806,25 @@ low_pressure_loop_node_p (ira_loop_tree_node_t node)
return true;
}
+/* Return TRUE if LOOP has a EH enter or exit edge. */
+static bool
+loop_with_eh_edge_p (struct loop *loop)
+{
+ int i;
+ edge_iterator ei;
+ edge e;
+ VEC (edge, heap) *edges;
+
+ FOR_EACH_EDGE (e, ei, loop->header->preds)
+ if (e->flags & EDGE_EH)
+ return true;
+ edges = get_loop_exit_edges (loop);
+ FOR_EACH_VEC_ELT (edge, edges, i, e)
+ if (e->flags & EDGE_EH)
+ return true;
+ return false;
+}
+
/* Sort loops for marking them for removal. We put already marked
loops first, then less frequent loops next, and then outer loops
next. */
@@ -1829,14 +1848,18 @@ loop_compare_func (const void *v1p, const void *v2p)
return l1->loop->num - l2->loop->num;
}
-
/* Mark loops which should be removed from regional allocation. We
remove a loop with low register pressure inside another loop with
register pressure. In this case a separate allocation of the loop
hardly helps (for irregular register file architecture it could
help by choosing a better hard register in the loop but we prefer
faster allocation even in this case). We also remove cheap loops
- if there are more than IRA_MAX_LOOPS_NUM of them. */
+ if there are more than IRA_MAX_LOOPS_NUM of them. Loop with EH
+ exit or enter edges are removed too because the allocation might
+ require put pseudo moves on the EH edges (we could still do this
+ for pseudos with caller saved hard registers in some cases but it
+ is impossible to say here or during top-down allocation pass what
+ hard register the pseudos get finally). */
static void
mark_loops_for_removal (void)
{
@@ -1859,8 +1882,9 @@ mark_loops_for_removal (void)
}
sorted_loops[n++] = &ira_loop_nodes[i];
ira_loop_nodes[i].to_remove_p
- = (low_pressure_loop_node_p (ira_loop_nodes[i].parent)
- && low_pressure_loop_node_p (&ira_loop_nodes[i]));
+ = ((low_pressure_loop_node_p (ira_loop_nodes[i].parent)
+ && low_pressure_loop_node_p (&ira_loop_nodes[i]))
+ || loop_with_eh_edge_p (ira_loop_nodes[i].loop));
}
qsort (sorted_loops, n, sizeof (ira_loop_tree_node_t), loop_compare_func);
for (i = 0; n - i + 1 > IRA_MAX_LOOPS_NUM; i++)