ARR_APP1(loop_element, loop->children, ln);
}
-/**
- * Mature all loops by removing the flexible arrays of a loop.
- *
- * @param loop the loop to mature
- * @param obst an obstack, where the new arrays are allocated on
- */
void mature_loops(ir_loop *loop, struct obstack *obst)
{
size_t i;
}
}
-/* Returns outer loop, itself if outermost. */
ir_loop *(get_loop_outer_loop)(const ir_loop *loop)
{
return _get_loop_outer_loop(loop);
}
-/* Returns nesting depth of this loop */
unsigned (get_loop_depth)(const ir_loop *loop)
{
return _get_loop_depth(loop);
}
-/* Returns the number of elements contained in loop. */
size_t get_loop_n_elements(const ir_loop *loop)
{
assert(loop && loop->kind == k_ir_loop);
return(loop -> children[pos]);
}
-/**
- * Sets the loop for a node.
- */
void set_irn_loop(ir_node *n, ir_loop *loop)
{
n->loop = loop;
return _is_ir_loop(thing);
}
-/* The outermost loop is remarked in the surrounding graph. */
void (set_irg_loop)(ir_graph *irg, ir_loop *loop)
{
_set_irg_loop(irg, loop);
}
-/* Returns the root loop info (if exists) for an irg. */
ir_loop *(get_irg_loop)(const ir_graph *irg)
{
return _get_irg_loop(irg);
}
-/*
- * Allocates a new loop as son of father on the given obstack.
- * If father is equal NULL, a new root loop is created.
- */
ir_loop *alloc_loop(ir_loop *father, struct obstack *obst)
{
ir_loop *son;