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;
/**
*/
void mature_loops(ir_loop *loop, struct obstack *obst);
-/* -------- INLINE functions -------- */
+/* -------- inline functions -------- */
-static INLINE int
+static inline int
_is_ir_loop(const void *thing) {
return get_kind(thing) == k_ir_loop;
}
-static INLINE void
+static inline void
_set_irg_loop(ir_graph *irg, ir_loop *loop) {
assert(irg);
irg->loop = loop;
}
-static INLINE ir_loop *
+static inline ir_loop *
_get_irg_loop(ir_graph *irg) {
assert(irg);
return irg->loop;
}
-static INLINE ir_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
+static inline int
_get_loop_depth(const ir_loop *loop) {
assert(_is_ir_loop(loop));
return loop->depth;
}
-static INLINE int
+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 *
+static inline ir_loop *
_get_irn_loop(const ir_node *n) {
return n->loop;
}