From 9ee93cffc1a8ef9df2bef8ec9c98299a89d57b15 Mon Sep 17 00:00:00 2001
From: Michael Beck <beck@ipd.info.uni-karlsruhe.de>
Date: Tue, 13 Jun 2006 15:17:05 +0000
Subject: [PATCH] add inline functions document destroyed link fields

[r7923]
---
 ir/ana/irloop.h   | 33 +++++++++++++++++++--------------
 ir/ana/irloop_t.h | 30 ++++++++++++++++++++++++++++++
 2 files changed, 49 insertions(+), 14 deletions(-)

diff --git a/ir/ana/irloop.h b/ir/ana/irloop.h
index aa4546904..337cb909b 100644
--- a/ir/ana/irloop.h
+++ b/ir/ana/irloop.h
@@ -11,15 +11,15 @@
  */
 
 /**
-* @file irloop.h
-*
-*  Computes backedges in the control and data flow.
-*
-*  @author Goetz Lindenmaier
-*
-*  Only Block and Phi/Filter nodes can have incoming backedges.
-*  Constructs loops data structure: indicates loop nesting.
-*/
+ * @file irloop.h
+ *
+ *  Computes backedges in the control and data flow.
+ *
+ *  @author Goetz Lindenmaier
+ *
+ *  Only Block and Phi/Filter nodes can have incoming backedges.
+ *  Constructs loops data structure: indicates loop nesting.
+ */
 
 # ifndef _IRLOOP_H_
 # define _IRLOOP_H_
@@ -93,16 +93,16 @@ void     set_irg_loop(ir_graph *irg, ir_loop *l);
 ir_loop *get_irg_loop(ir_graph *irg);
 
 /** Returns the loop n is contained in.  NULL if node is in no loop. */
-ir_loop *get_irn_loop(ir_node *n);
+ir_loop *get_irn_loop(const ir_node *n);
 
 /** Returns outer loop, itself if outermost. */
-ir_loop *get_loop_outer_loop (ir_loop *loop);
+ir_loop *get_loop_outer_loop (const ir_loop *loop);
 /** Returns nesting depth of this loop */
-int      get_loop_depth (ir_loop *loop);
+int      get_loop_depth (const ir_loop *loop);
 
 /* Sons are the inner loops contained in this loop. */
 /** Returns the number of inner loops */
-int      get_loop_n_sons (ir_loop *loop);
+int      get_loop_n_sons (const ir_loop *loop);
 
 /** Returns the pos`th son loop (inner loop) of a loop.
     Returns NULL if there is not a pos`th loop_node. */
@@ -146,6 +146,8 @@ void *get_loop_link (const ir_loop *loop);
  *  The resulting loop tree is a possible visiting order for dataflow
  *  analysis.
  *
+ *  This algorithm destoyes the link field of block nodes.
+ *
  *  @returns Maximal depth of loop tree.
  *
  *  @remark
@@ -183,7 +185,10 @@ int construct_ip_backedges(void);
  *  This algorithm computes only back edge information for Block nodes, not
  *  for Phi nodes.
  *
- * @returns Maximal depth of loop tree. */
+ *  This algorithm destoyes the link field of block nodes.
+ *
+ * @returns Maximal depth of loop tree.
+ */
 int construct_cf_backedges(ir_graph *irg);
 
 /** Construct interprocedural loop tree for control flow.
diff --git a/ir/ana/irloop_t.h b/ir/ana/irloop_t.h
index 36132164d..4a6433484 100644
--- a/ir/ana/irloop_t.h
+++ b/ir/ana/irloop_t.h
@@ -19,6 +19,7 @@
 
 #include "firm_common.h"
 #include "irgraph_t.h"
+#include "irnode_t.h"
 #include "irloop.h"
 
 #ifndef _IRLOOP_T_H_
@@ -96,8 +97,37 @@ _get_irg_loop(ir_graph *irg) {
   return irg->loop;
 }
 
+static INLINE ir_loop *
+_get_loop_outer_loop(const ir_loop *loop) {
+  assert(_is_ir_loop(loop));
+  return loop->outer_loop;
+}
+
+static INLINE int
+_get_loop_depth(const ir_loop *loop) {
+  assert(_is_ir_loop(loop));
+  return loop->depth;
+}
+
+static INLINE int
+_get_loop_n_sons(const ir_loop *loop) {
+  assert(_is_ir_loop(loop));
+  return loop->n_sons;
+}
+
+/* Uses temporary information to get the loop */
+static INLINE ir_loop *
+_get_irn_loop(const ir_node *n) {
+  return n->loop;
+}
+
+
 #define is_ir_loop(thing)         _is_ir_loop(thing)
 #define set_irg_loop(irg, loop)   _set_irg_loop(irg, loop)
 #define get_irg_loop(irg)         _get_irg_loop(irg)
+#define get_loop_outer_loop(loop) _get_loop_outer_loop(loop)
+#define get_loop_depth(loop)      _get_loop_depth(loop)
+#define get_loop_n_sons(loop)     _get_loop_n_sons(loop)
+#define get_irn_loop(n)           _get_irn_loop(n)
 
 #endif /* _IRLOOP_T_H_ */
-- 
2.20.1