document destroyed link fields
[r7923]
-* @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_
# ifndef _IRLOOP_H_
# define _IRLOOP_H_
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_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. */
/** 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 */
/** 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 */
/* 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. */
/** Returns the pos`th son loop (inner loop) of a loop.
Returns NULL if there is not a pos`th loop_node. */
* The resulting loop tree is a possible visiting order for dataflow
* analysis.
*
* 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
* @returns Maximal depth of loop tree.
*
* @remark
* This algorithm computes only back edge information for Block nodes, not
* for Phi nodes.
*
* 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.
int construct_cf_backedges(ir_graph *irg);
/** Construct interprocedural loop tree for control flow.
#include "firm_common.h"
#include "irgraph_t.h"
#include "firm_common.h"
#include "irgraph_t.h"
#include "irloop.h"
#ifndef _IRLOOP_T_H_
#include "irloop.h"
#ifndef _IRLOOP_T_H_
+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 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_ */
#endif /* _IRLOOP_T_H_ */