summaryrefslogtreecommitdiffhomepage
path: root/ir/be/bespillslots.c
diff options
context:
space:
mode:
authorChristoph Mallon <christoph.mallon@gmx.de>2012-07-13 09:01:53 +0200
committerChristoph Mallon <christoph.mallon@gmx.de>2012-07-13 23:03:57 +0200
commita84d17b8fe60c1dd028b832033dadb97ce9123bc (patch)
treea0ddd1e0d2f5520bcaecfee81db66297a340beed /ir/be/bespillslots.c
parente9237e148a4cd289c02e4800f094cd64445fd2fd (diff)
Fix indentation.
Diffstat (limited to 'ir/be/bespillslots.c')
-rw-r--r--ir/be/bespillslots.c86
1 files changed, 43 insertions, 43 deletions
diff --git a/ir/be/bespillslots.c b/ir/be/bespillslots.c
index 34187f4..5e3b6f8 100644
--- a/ir/be/bespillslots.c
+++ b/ir/be/bespillslots.c
@@ -219,46 +219,46 @@ static int my_values_interfere2(ir_graph *irg, const ir_node *a,
{
be_lv_t *lv = be_get_irg_liveness(irg);
- int a2b = _value_dominates(a, b);
- int b2a = _value_dominates(b, a);
-
- /* If there is no dominance relation, they do not interfere. */
- if ((a2b | b2a) > 0) {
- const ir_edge_t *edge;
- ir_node *bb;
-
- /*
- * Adjust a and b so, that a dominates b if
- * a dominates b or vice versa.
- */
- if (b2a) {
- const ir_node *t = a;
- a = b;
- b = t;
- }
-
- bb = get_nodes_block(b);
-
- /*
- * If a is live end in b's block it is
- * live at b's definition (a dominates b)
- */
- if (be_is_live_end(lv, bb, a))
- return 1;
-
- /*
- * Look at all usages of a.
- * If there's one usage of a in the block of b, then
- * we check, if this use is dominated by b, if that's true
- * a and b interfere. Note that b must strictly dominate the user,
- * since if b is the last user of in the block, b and a do not
- * interfere.
- * Uses of a not in b's block can be disobeyed, because the
- * check for a being live at the end of b's block is already
- * performed.
- */
- foreach_out_edge(a, edge) {
- const ir_node *user = get_edge_src_irn(edge);
+ int a2b = _value_dominates(a, b);
+ int b2a = _value_dominates(b, a);
+
+ /* If there is no dominance relation, they do not interfere. */
+ if ((a2b | b2a) > 0) {
+ const ir_edge_t *edge;
+ ir_node *bb;
+
+ /*
+ * Adjust a and b so, that a dominates b if
+ * a dominates b or vice versa.
+ */
+ if (b2a) {
+ const ir_node *t = a;
+ a = b;
+ b = t;
+ }
+
+ bb = get_nodes_block(b);
+
+ /*
+ * If a is live end in b's block it is
+ * live at b's definition (a dominates b)
+ */
+ if (be_is_live_end(lv, bb, a))
+ return 1;
+
+ /*
+ * Look at all usages of a.
+ * If there's one usage of a in the block of b, then
+ * we check, if this use is dominated by b, if that's true
+ * a and b interfere. Note that b must strictly dominate the user,
+ * since if b is the last user of in the block, b and a do not
+ * interfere.
+ * Uses of a not in b's block can be disobeyed, because the
+ * check for a being live at the end of b's block is already
+ * performed.
+ */
+ foreach_out_edge(a, edge) {
+ const ir_node *user = get_edge_src_irn(edge);
if (is_Sync(user)) {
const ir_edge_t *edge2;
foreach_out_edge(user, edge2) {
@@ -271,10 +271,10 @@ static int my_values_interfere2(ir_graph *irg, const ir_node *a,
} else {
if (get_nodes_block(user) == bb && !is_Phi(user) &&
_value_strictly_dominates(b, user))
- return 1;
+ return 1;
}
- }
- }
+ }
+ }
return 0;
}