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 iterate exactly once. */
- loop_outer_loop = 0x00000100 /**< id set, this loop has child loops (is a no leaf). */
+ loop_outer_loop = 0x00000100 /**< if set, this loop has child loops (is a no leaf). */
} loop_flags_t;
/**
* the loop within the nesting. Further it contains a list of the
* loops with nesting depth -1. Finally it contains a list of all
* nodes in the loop.
- *
- * @todo We could add a field pointing from a node to the containing loop,
- * this would cost a lot of memory, though.
*/
struct ir_loop {
- firm_kind kind; /**< A type tag, set to k_ir_loop. */
- 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 */
+ firm_kind kind; /**< A type tag, set to k_ir_loop. */
+ unsigned depth; /**< Nesting depth */
+ size_t n_sons; /**< Number of ir_nodes in array "children" */
+ size_t 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 */
- ir_node *loop_iter_variable; /**< The iteration variable of counting loop.*/
+ ir_tarval *loop_iter_start; /**< counting loop: the start value */
+ ir_tarval *loop_iter_end; /**< counting loop: the last value reached */
+ ir_tarval *loop_iter_increment; /**< counting loop: the increment */
+ ir_node *loop_iter_variable; /**< The iteration variable of counting loop.*/
void *link; /**< link field. */
#ifdef DEBUG_libfirm
/* -------- inline functions -------- */
-static inline int
-_is_ir_loop(const void *thing) {
+static inline int _is_ir_loop(const void *thing)
+{
return get_kind(thing) == k_ir_loop;
}
-static inline void
-_set_irg_loop(ir_graph *irg, ir_loop *loop) {
+static inline void _set_irg_loop(ir_graph *irg, ir_loop *loop)
+{
assert(irg);
irg->loop = loop;
}
-static inline ir_loop *
-_get_irg_loop(ir_graph *irg) {
+static inline ir_loop *_get_irg_loop(const ir_graph *irg)
+{
assert(irg);
return irg->loop;
}
-static inline ir_loop *
-_get_loop_outer_loop(const ir_loop *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) {
+static inline unsigned _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) {
+static inline size_t _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) {
+static inline ir_loop *_get_irn_loop(const ir_node *n)
+{
return n->loop;
}