/** Returns true if the predesessor pos is a backedge. */
int is_inter_backedge(ir_node *n, int pos);
int is_intra_backedge(ir_node *n, int pos);
-bool is_backedge (ir_node *n, int pos);
+/** Returns non-zero if the predecessor pos is a backedge. */
+int is_backedge (ir_node *n, int pos);
/** Remarks that edge pos is a backedge. */
void set_backedge (ir_node *n, int pos);
/** Remarks that edge pos is not a backedge. */
void set_not_backedge (ir_node *n, int pos);
-/** 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);
/** Sets backedge information to zero. */
void clear_backedges (ir_node *n);
* this would cost a lot of memory, though.
*/
/* ------------------------------------------------------------------- */
+#ifndef _IR_LOOP_TYPEDEF_
+#define _IR_LOOP_TYPEDEF_
typedef struct ir_loop ir_loop;
+#endif
-/* Loop elements are loop nodes and ir nodes */
+/** Loop elements: loop nodes and ir nodes */
typedef union {
firm_kind *kind; /**< is either k_ir_node or k_ir_loop */
ir_node *node; /**< Pointer to an ir_node element */
/** Set the outermost loop in ir graph as basic access to loop tree. */
void set_irg_loop(ir_graph *irg, ir_loop *l);
+
+/* Returns the root loop info (if exists) for an irg. */
ir_loop *get_irg_loop(ir_graph *irg);
/** Returns the loop n is contained in. NULL if node is in no loop. */
/* Sons are the inner loops contained in this loop. */
/** Returns the number of inner loops */
int get_loop_n_sons (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. */
ir_loop *get_loop_son (ir_loop *loop, int pos);
+
/** Returns the number of nodes contained in loop. */
int get_loop_n_nodes (ir_loop *loop);
+
+/** Returns the pos`th ir_node of a loop.
+ Returns NULL if there is not a pos`th ir_node. */
ir_node *get_loop_node (ir_loop *loop, int pos);
/** Returns the number of elements contained in loop. */
loop_element get_loop_element (ir_loop *loop, int pos);
/** Returns the element number of the loop son in loop.
- * Returns -1 if not found. O(#elements). */
+ * Returns -1 if not found. O(|elements|). */
int get_loop_element_pos(ir_loop *loop, void *le);
/** Returns a unique node number for the loop node to make output
* @param n The node to be tested.
* @param block A block node.
*
- * Returns true, if the node n is not changed in the loop block
+ * Returns non-zero, if the node n is not changed in the loop block
* belongs to or in inner loops of this block. */
int is_loop_invariant(ir_node *n, ir_node *block);