-static bool
-is_head (ir_node *n, ir_node *root)
-{
- int i, arity;
- int some_outof_loop = 0, some_in_loop = 0;
-
- assert(is_Block(n));
-
- if (!is_outermost_StartBlock(n)) {
- arity = get_irn_arity(n);
- for (i = 0; i < arity; i++) {
- ir_node *pred = get_nodes_block(skip_Proj(get_irn_n(n, i)));
- if (is_backedge(n, i)) continue;
- if (!irn_is_in_stack(pred)) {
- some_outof_loop = 1;
- } else {
- if (get_irn_uplink(pred) < get_irn_uplink(root)) {
- DDMN(pred); DDMN(root);
- assert(get_irn_uplink(pred) >= get_irn_uplink(root));
- }
- some_in_loop = 1;
- }
- }
- }
- return some_outof_loop && some_in_loop;
-}
-
-
-/* Returns true if n is possible loop head of an endless loop.
- I.e., it is a Block, Phi or Filter node and has only predecessors
- within the loop.
- @arg root: only needed for assertion. */
-static bool
-is_endless_head (ir_node *n, ir_node *root)
-{
- int i, arity;
- int some_outof_loop = 0, some_in_loop = 0;
-
- assert(is_Block(n));
- /* Test for legal loop header: Block, Phi, ... */
- if (!is_outermost_StartBlock(n)) {
- arity = get_irn_arity(n);
- for (i = 0; i < arity; i++) {
- ir_node *pred = get_nodes_block(skip_Proj(get_irn_n(n, i)));
- assert(pred);
- if (is_backedge(n, i)) { continue; }
- if (!irn_is_in_stack(pred)) {
- some_outof_loop = 1; //printf(" some out of loop ");
- } else {
- if(get_irn_uplink(pred) < get_irn_uplink(root)) {
- DDMN(pred); DDMN(root);
- assert(get_irn_uplink(pred) >= get_irn_uplink(root));
- }
- some_in_loop = 1;
- }
- }
- }
- return !some_outof_loop && some_in_loop;
-}
-
-/* Returns index of the predecessor with the smallest dfn number
- greater-equal than limit. */
-static int
-smallest_dfn_pred (ir_node *n, int limit)
-{
- int i, index = -2, min = -1;
-
- if (!is_outermost_StartBlock(n)) {
- int arity = get_irn_arity(n);
- for (i = 0; i < arity; i++) {
- ir_node *pred = get_nodes_block(skip_Proj(get_irn_n(n, i)));
- if (is_backedge(n, i) || !irn_is_in_stack(pred)) continue;
- if (get_irn_dfn(pred) >= limit && (min == -1 || get_irn_dfn(pred) < min)) {
- index = i;
- min = get_irn_dfn(pred);
- }
- }
- }
- return index;
-}
-
-/* Returns index of the predecessor with the largest dfn number. */
-static int
-largest_dfn_pred (ir_node *n)
-{
- int i, index = -2, max = -1;
-
- if (!is_outermost_StartBlock(n)) {
- int arity = get_irn_arity(n);
- for (i = 0; i < arity; i++) {
- ir_node *pred = get_nodes_block(skip_Proj(get_irn_n(n, i)));
- if (is_backedge (n, i) || !irn_is_in_stack(pred)) continue;
- if (get_irn_dfn(pred) > max) {
- index = i;
- max = get_irn_dfn(pred);
- }
- }
- }
- return index;
-}
-
-/* Searches the stack for possible loop heads. Tests these for backedges.
- If it finds a head with an unmarked backedge it marks this edge and
- returns the tail of the loop.
- If it finds no backedge returns NULL. */
-static ir_node *
-find_tail (ir_node *n) {
- ir_node *m;
- int i, res_index = -2;
-
- m = stack[tos-1]; /* tos = top of stack */
- if (is_head (m, n)) {
- res_index = smallest_dfn_pred(m, 0);
- if ((res_index == -2) && /* no smallest dfn pred found. */
- (n == m))
- return NULL;
- } else {
- if (m == n) return NULL;
- for (i = tos-2; i >= 0; --i) {
-
- m = stack[i];
- if (is_head (m, n)) {
- res_index = smallest_dfn_pred (m, get_irn_dfn(m) + 1);
- if (res_index == -2) /* no smallest dfn pred found. */
- res_index = largest_dfn_pred (m);
-
- if ((m == n) && (res_index == -2)) {
- i = -1;