loop_wrap_around = 0x00000010, /**< this loop is NOT endless, because of wrap around */
loop_end_false = 0x00000020, /**< this loop end can't be computed "from compute_loop_info.c" */
do_loop = 0x00000040, /**< this is a do loop */
- once = 0x00000080, /**< this is a do loop, with a false condition.It itarate once */
+ once = 0x00000080, /**< this is a do loop, with a false condition. It iterate exactly once. */
+ loop_outer_loop = 0x00000100 /**< id set, this loop has child loops (is a no leaf). */
} loop_flags_t;
/**
*/
struct ir_loop {
firm_kind kind; /**< A type tag, set to k_ir_loop. */
-
- struct ir_loop *outer_loop; /**< The outer loop */
- loop_element *children; /**< Mixed flexible array: Contains sons and loop_nodes */
int depth; /**< Nesting depth */
int n_sons; /**< Number of ir_nodes in array "children" */
int n_nodes; /**< Number of loop_nodes in array "children" */
unsigned flags; /**< a set of loop_flags_t */
+ struct ir_loop *outer_loop; /**< The outer loop */
+ loop_element *children; /**< Mixed flexible array: Contains sons and loop_nodes */
tarval *loop_iter_start; /**< counting loop: the start value */
tarval *loop_iter_end; /**< counting loop: the last value reached */
tarval *loop_iter_increment; /**< counting loop: the increment */
/** Add a node to a loop. */
void add_loop_node(ir_loop *loop, ir_node *n);
+/** Add an IR graph to a loop. */
+void add_loop_irg(ir_loop *loop, ir_graph *irg);
+
/** Sets the loop a node belonging to. */
void set_irn_loop(ir_node *n, ir_loop *loop);