X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Firbackedge.c;h=7bfd1c0c2108742c08ad4387483e1452c8a9167c;hb=fad022b108892a74b02bef7dfb13315caef5a3fc;hp=a596ac871d66f3144481d0f1e1680de2a9fa8982;hpb=4b13e0fa13fd6021973a7b09e6b3e9279dd1869e;p=libfirm

diff --git a/ir/ana/irbackedge.c b/ir/ana/irbackedge.c
index a596ac871..7bfd1c0c2 100644
--- a/ir/ana/irbackedge.c
+++ b/ir/ana/irbackedge.c
@@ -1,16 +1,35 @@
 /*
- * Project:     libFIRM
- * File name:   ir/ana/irbackedge.c
- * Purpose:     Access function for backedges.
- * Author:      Goetz Lindenmaier
- * Modified by:
- * Created:     7.2002
- * CVS-ID:      $Id$
- * Copyright:   (c) 2002-2003 Universität Karlsruhe
- * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
+ * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief     Access function for backedges.
+ * @author    Goetz Lindenmaier
+ * @date      7.2002
+ * @version   $Id$
  */
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
 
 #include "irnode_t.h"
+#include "irgraph_t.h"
 #include "array.h"
 #include "irbackedge_t.h"
 
@@ -27,10 +46,10 @@
  * very careful!
  */
 static INLINE int *mere_get_backarray(ir_node *n) {
-  switch(intern_get_irn_opcode(n)) {
+  switch (get_irn_opcode(n)) {
   case iro_Block:
     if (!get_Block_matured(n)) return NULL;
-    if (interprocedural_view && n->attr.block.in_cg) {
+    if (get_interprocedural_view() && n->attr.block.in_cg) {
       assert(n->attr.block.cg_backedge && "backedge array not allocated!");
       return n->attr.block.cg_backedge;
     } else {
@@ -43,7 +62,7 @@ static INLINE int *mere_get_backarray(ir_node *n) {
     return n->attr.phi_backedge;
     break;
   case iro_Filter:
-    if (interprocedural_view) {
+    if (get_interprocedural_view()) {
       assert(n->attr.filter.backedge && "backedge array not allocated!");
       return n->attr.filter.backedge;
     }
@@ -60,43 +79,54 @@ static INLINE int *mere_get_backarray(ir_node *n) {
 static INLINE int *get_backarray(ir_node *n) {
   int *ba = mere_get_backarray(n);
 
+#ifndef NDEBUG
   if (ba) {
     int bal = ARR_LEN(ba);  /* avoid makro expansion in assertion. */
     int inl = ARR_LEN(get_irn_in(n)) -1;  /* Use get_irn_in -- sensitive to view! */
     assert(bal == inl && "backedge array with faulty length");
   }
+#endif
 
   return ba;
 }
 
 /**
- * Returns true if node has no backarray, or
- *              if size of backarray == size of in array.
+ * Returns nin-zero if node has no backarray, or
+ *                  if size of backarray == size of in array.
  */
-static INLINE bool legal_backarray (ir_node *n) {
+static INLINE int legal_backarray (ir_node *n) {
   int *ba = mere_get_backarray(n);
   if (ba && (ARR_LEN(ba) != ARR_LEN(get_irn_in(n))-1))  /* Use get_irn_in -- sensitive to view! */
-    return false;
-  return true;
+    return 0;
+  return 1;
 }
 
 
-INLINE void fix_backedges(struct obstack *obst, ir_node *n) {
-  opcode opc = intern_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)
+  ir_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) && !interprocedural_view)
-      n->attr.block.backedge = arr;
-    if ((opc == iro_Block) && 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) {
@@ -104,50 +134,99 @@ INLINE void fix_backedges(struct obstack *obst, ir_node *n) {
   }*/
 }
 
-/** Returns true if the predesessor pos is a backedge. */
-bool is_backedge (ir_node *n, int pos) {
+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 non-zero if the predecessor pos is a backedge. */
+int is_backedge (ir_node *n, int pos) {
   int *ba = get_backarray (n);
   if (ba) return ba[pos];
-  return false;
+  return 0;
 }
 
-/** Remarks that edge pos is a backedge. */
+/* Remarks that edge pos is a backedge. */
 void set_backedge (ir_node *n, int pos) {
   int *ba = get_backarray (n);
   assert(ba && "can only set backedges at Phi, Filter, Block nodes.");
   ba[pos] = 1;
 }
 
-/** Remarks that edge pos is a backedge. */
+/* Remarks that edge pos is a backedge. */
 void set_not_backedge (ir_node *n, int pos) {
   int *ba = get_backarray (n);
   assert(ba && "can only set backedges at Phi, Filter, Block nodes.");
   ba[pos] = 0;
 }
 
-/** Returns true if n has backedges. */
-bool has_backedges (ir_node *n) {
+/* Returns non-zero if n has backedges. */
+int has_backedges (ir_node *n) {
   int i;
   int *ba = get_backarray (n);
-  if (ba)
-    for (i = 0; i < intern_get_irn_arity(n); i++)
-      if (ba[i]) return true;
-  return false;
+  if (ba) {
+    int arity = get_irn_arity(n);
+    for (i = 0; i < arity; i++)
+      if (ba[i]) return 1;
+  }
+  return 0;
 }
 
 /** Sets all backedge information to zero. */
 void clear_backedges (ir_node *n) {
-  int i, rem = interprocedural_view;
+  int i, arity;
+  int rem = get_interprocedural_view();
   int *ba;
-  interprocedural_view = 0;
+  set_interprocedural_view(0);
   ba = get_backarray (n);
-  if (ba)
-    for (i = 0; i < intern_get_irn_arity(n); i++)
+  if (ba) {
+    arity = get_irn_arity(n);
+    for (i = 0; i < arity; i++)
       ba[i] = 0;
-  interprocedural_view = 1;
+  }
+  set_interprocedural_view(1);
   ba = get_backarray (n);
-  if (ba)
-    for (i = 0; i < intern_get_irn_arity(n); i++)
+  if (ba) {
+    arity = get_irn_arity(n);
+    for (i = 0; i < arity; i++)
       ba[i] = 0;
-  interprocedural_view = rem;
+  }
+  set_interprocedural_view(rem);
+}
+
+int *new_backedge_arr(struct obstack *obst, int size) {
+  int *res = NEW_ARR_D (int, obst, size);
+  memset(res, 0, sizeof(int) * size);
+  return res;
+}
+
+/* TODO: add an ir_op operation */
+void new_backedge_info(ir_node *n) {
+  switch(get_irn_opcode(n)) {
+  case iro_Block:
+    n->attr.block.cg_backedge = NULL;
+    n->attr.block.backedge = new_backedge_arr(current_ir_graph->obst, get_irn_arity(n));
+    break;
+  case iro_Phi:
+    n->attr.phi_backedge = new_backedge_arr(current_ir_graph->obst, get_irn_arity(n));
+    break;
+  case iro_Filter:
+    n->attr.filter.backedge = new_backedge_arr(current_ir_graph->obst, get_irn_arity(n));
+    break;
+  default: ;
+  }
 }