out edges for entities and types

[libfirm] / ir / ana / irbackedge.c

diff --git a/ir/ana/irbackedge.c b/ir/ana/irbackedge.c
index bcf9f3b..da5690b 100644 (file)
--- a/ir/ana/irbackedge.c
+++ b/ir/ana/irbackedge.c
@@ -1,20 +1,21 @@
-/* Copyright (C) 2002 by Universitaet Karlsruhe
-* All rights reserved.
-*
-* Authors:  Goetz Lindenmaier
-*
-* irbackedges.c  Access function for backedges.
-*
-*/
-
-/* $Id$ */
+/*
+ * 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.
+ */
 
 #include "irnode_t.h"
 #include "array.h"
 #include "irbackedge_t.h"
 
 /*--------------------------------------------------------------------*/
-/* Backedge information. *                                            */
+/* Backedge information.                                              */
 /*--------------------------------------------------------------------*/
 
 
@@ -26,7 +27,7 @@
  * very careful!
  */
 static INLINE int *mere_get_backarray(ir_node *n) {
-  switch(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) {
@@ -96,11 +97,11 @@ INLINE void fix_backedges(struct obstack *obst, ir_node *n) {
     return;
   }
   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) {
-  //  ARR_SETLEN(int, arr, ARR_LEN(get_irn_in(n))-1);
-  //}
+  /* @@@ more efficient in memory consumption, not possible with
+   array implementation.
+  if (ARR_LEN(arr) < ARR_LEN(get_irn_in(n))-1) {
+    ARR_SETLEN(int, arr, ARR_LEN(get_irn_in(n))-1);
+  }*/
 }
 
 /** Returns true if the predesessor pos is a backedge. */
@@ -128,25 +129,32 @@ void set_not_backedge (ir_node *n, int pos) {
 bool has_backedges (ir_node *n) {
   int i;
   int *ba = get_backarray (n);
-  if (ba)
-    for (i = 0; i < get_irn_arity(n); i++)
+  if (ba) {
+    int arity = get_irn_arity(n);
+    for (i = 0; i < arity; i++)
       if (ba[i]) return true;
+  }
   return false;
 }
 
 /** Sets all backedge information to zero. */
 void clear_backedges (ir_node *n) {
-  int i, rem = interprocedural_view;
+  int i, arity;
+  int rem = interprocedural_view;
   int *ba;
   interprocedural_view = 0;
   ba = get_backarray (n);
-  if (ba)
-    for (i = 0; i < get_irn_arity(n); i++)
+  if (ba) {
+    arity = get_irn_arity(n);
+    for (i = 0; i < arity; i++)
       ba[i] = 0;
+  }
   interprocedural_view = 1;
   ba = get_backarray (n);
-  if (ba)
-    for (i = 0; i < get_irn_arity(n); i++)
+  if (ba) {
+    arity = get_irn_arity(n);
+    for (i = 0; i < arity; i++)
       ba[i] = 0;
+  }
   interprocedural_view = rem;
 }