analyses polymorphic calls if callee info is available

[libfirm] / ir / ana / irbackedge.c

diff --git a/ir/ana/irbackedge.c b/ir/ana/irbackedge.c
index b4a2463..77b1750 100644 (file)
--- a/ir/ana/irbackedge.c
+++ b/ir/ana/irbackedge.c
@@ -82,22 +82,31 @@ static INLINE bool legal_backarray (ir_node *n) {
 }
 
 
-INLINE void fix_backedges(struct obstack *obst, ir_node *n) {
-  opcode opc = get_irn_opcode(n);
+void fix_backedges(struct obstack *obst, ir_node *n) {
   int *arr = mere_get_backarray(n);
-  if (ARR_LEN(arr) == ARR_LEN(get_irn_in(n))-1)
+  opcode opc;
+
+  if (! arr)
     return;
+
   if (ARR_LEN(arr) != ARR_LEN(get_irn_in(n))-1) {
     arr = new_backedge_arr(obst, ARR_LEN(get_irn_in(n))-1);
-    if (opc == iro_Phi)    n->attr.phi_backedge = arr;
-    if ((opc == iro_Block) && !get_interprocedural_view())
-      n->attr.block.backedge = arr;
-    if ((opc == iro_Block) && get_interprocedural_view())
-      n->attr.block.cg_backedge = arr;
-    if (opc == iro_Filter) n->attr.filter.backedge = arr;
-    return;
+
+    opc = get_irn_opcode(n);
+    if (opc == iro_Phi)
+      n->attr.phi_backedge = arr;
+    else if (opc == iro_Block) {
+      if (!get_interprocedural_view())
+        n->attr.block.backedge = arr;
+      else
+        n->attr.block.cg_backedge = arr;
+    }
+    else if (opc == iro_Filter)
+      n->attr.filter.backedge = arr;
   }
+
   assert(legal_backarray(n));
+
   /* @@@ more efficient in memory consumption, not possible with
    array implementation.
   if (ARR_LEN(arr) < ARR_LEN(get_irn_in(n))-1) {
@@ -105,7 +114,26 @@ INLINE void fix_backedges(struct obstack *obst, ir_node *n) {
   }*/
 }
 
-/** Returns true if the predesessor pos is a backedge. */
+int is_inter_backedge(ir_node *n, int pos) {
+  int res;
+  int rem = get_interprocedural_view();
+  set_interprocedural_view(0);
+  res = is_backedge(n, pos);
+  set_interprocedural_view(rem);
+  return res;
+}
+
+int is_intra_backedge(ir_node *n, int pos) {
+  int res;
+  int rem = get_interprocedural_view();
+  set_interprocedural_view(1);
+  res = is_backedge(n, pos);
+  set_interprocedural_view(rem);
+  return res;
+}
+
+
+/** Returns true if the predecessor pos is a backedge. */
 bool is_backedge (ir_node *n, int pos) {
   int *ba = get_backarray (n);
   if (ba) return ba[pos];