-/* Returns the number of inner loops */
-int (get_loop_n_sons)(const ir_loop *loop) {
- return _get_loop_n_sons(loop);
-}
-
-/* Returns the pos`th loop_node-child *
- * TODO: This method isn`t very efficient ! *
- * Returns NULL if there isn`t a pos`th loop_node */
-ir_loop *get_loop_son(ir_loop *loop, int pos) {
- int child_nr = 0, loop_nr = -1;
-
- assert(loop && loop->kind == k_ir_loop);
- while (child_nr < ARR_LEN(loop->children)) {
- if (*(loop->children[child_nr].kind) == k_ir_loop)
- loop_nr++;
- if (loop_nr == pos)
- return loop->children[child_nr].son;
- child_nr++;
- }
- return NULL;
-}
-
-/* Returns the number of nodes in the loop */
-int get_loop_n_nodes(ir_loop *loop) {
- assert(loop); assert(loop->kind == k_ir_loop);
- return loop->n_nodes;
-}
-
-/* Returns the pos'th ir_node-child *
- * TODO: This method isn't very efficient ! *
- * Returns NULL if there isn't a pos'th ir_node */
-ir_node *get_loop_node(ir_loop *loop, int pos) {
- int child_nr, node_nr = -1;
-
- assert(loop && loop->kind == k_ir_loop);
- assert(pos < get_loop_n_nodes(loop));
-
- for (child_nr = 0; child_nr < ARR_LEN(loop->children); child_nr++) {
- if (*(loop->children[child_nr].kind) == k_ir_node)
- node_nr++;
- if (node_nr == pos)
- return loop -> children[child_nr].node;
- }
-
- assert(0 && "no child at pos found");
- return NULL;
-}
-
-/* Returns the number of elements contained in loop. */
-int get_loop_n_elements(const ir_loop *loop) {