X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Firscc.c;h=a37b057f4aa21e2ef689007271d2723133dad7da;hb=3e32262d83cf529f74aae833c7557557ab39782a;hp=bea7231112f3614665402d37520889affec260f6;hpb=48b0fa8564962b17e136a0f925eff458ca16abef;p=libfirm diff --git a/ir/ana/irscc.c b/ir/ana/irscc.c index bea723111..a37b057f4 100644 --- a/ir/ana/irscc.c +++ b/ir/ana/irscc.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -25,7 +25,6 @@ * Chapter 5.2.1.2. * @author Goetz Lindenmaier * @date 7.2002 - * @version $Id$ */ #include "config.h" @@ -41,6 +40,7 @@ #include "irdump.h" #include "array.h" #include "pmap.h" +#include "ircons.h" /* A variant of the loop tree that avoids loops without head. This reduces the depth of the loop tree. */ @@ -58,7 +58,7 @@ static int loop_node_cnt = 0; /** Counter to generate depth first numbering of visited nodes. */ static int current_dfn = 1; -static int max_loop_depth = 0; +static unsigned max_loop_depth = 0; void link_to_reg_end(ir_node *n, void *env); void set_projx_link(ir_node *cb_projx, ir_node *end_projx); @@ -87,17 +87,17 @@ typedef struct scc_info { /** * Allocates a new SCC info on the given obstack. */ -static inline scc_info *new_scc_info(struct obstack *obst) { - scc_info *info = obstack_alloc(obst, sizeof(*info)); - memset(info, 0, sizeof(*info)); - return info; +static inline scc_info *new_scc_info(struct obstack *obst) +{ + return OALLOCZ(obst, scc_info); } /** * Mark node n being on the SCC stack. */ -static inline void mark_irn_in_stack(ir_node *n) { - scc_info *scc = get_irn_link(n); +static inline void mark_irn_in_stack(ir_node *n) +{ + scc_info *scc = (scc_info*) get_irn_link(n); assert(scc); scc->in_stack = 1; } @@ -105,8 +105,9 @@ static inline void mark_irn_in_stack(ir_node *n) { /** * Mark node n NOT being on the SCC stack. */ -static inline void mark_irn_not_in_stack(ir_node *n) { - scc_info *scc = get_irn_link(n); +static inline void mark_irn_not_in_stack(ir_node *n) +{ + scc_info *scc = (scc_info*) get_irn_link(n); assert(scc); scc->in_stack = 0; } @@ -114,8 +115,9 @@ static inline void mark_irn_not_in_stack(ir_node *n) { /** * Checks if a node is on the SCC stack. */ -static inline int irn_is_in_stack(ir_node *n) { - scc_info *scc = get_irn_link(n); +static inline int irn_is_in_stack(ir_node *n) +{ + scc_info *scc = (scc_info*) get_irn_link(n); assert(scc); return scc->in_stack; } @@ -123,8 +125,9 @@ static inline int irn_is_in_stack(ir_node *n) { /** * Sets the uplink number for a node. */ -static inline void set_irn_uplink(ir_node *n, int uplink) { - scc_info *scc = get_irn_link(n); +static inline void set_irn_uplink(ir_node *n, int uplink) +{ + scc_info *scc = (scc_info*) get_irn_link(n); assert(scc); scc->uplink = uplink; } @@ -132,8 +135,9 @@ static inline void set_irn_uplink(ir_node *n, int uplink) { /** * Returns the uplink number for a node. */ -static int get_irn_uplink(ir_node *n) { - scc_info *scc = get_irn_link(n); +static int get_irn_uplink(ir_node *n) +{ + scc_info *scc = (scc_info*) get_irn_link(n); assert(scc); return scc->uplink; } @@ -141,8 +145,9 @@ static int get_irn_uplink(ir_node *n) { /** * Sets the depth-first-search number for a node. */ -static inline void set_irn_dfn(ir_node *n, int dfn) { - scc_info *scc = get_irn_link(n); +static inline void set_irn_dfn(ir_node *n, int dfn) +{ + scc_info *scc = (scc_info*) get_irn_link(n); assert(scc); scc->dfn = dfn; } @@ -150,14 +155,16 @@ static inline void set_irn_dfn(ir_node *n, int dfn) { /** * Returns the depth-first-search number of a node. */ -static int get_irn_dfn(ir_node *n) { - scc_info *scc = get_irn_link(n); +static int get_irn_dfn(ir_node *n) +{ + scc_info *scc = (scc_info*) get_irn_link(n); assert(scc); return scc->dfn; } #if 0 -static ir_loop *find_nodes_loop(ir_node *n, ir_loop *l) { +static ir_loop *find_nodes_loop(ir_node *n, ir_loop *l) +{ int i; ir_loop *res = NULL; @@ -177,7 +184,8 @@ static ir_loop *find_nodes_loop(ir_node *n, ir_loop *l) { } /* @@@ temporary implementation, costly!!! */ -ir_loop * get_irn_loop(ir_node *n) { +ir_loop * get_irn_loop(ir_node *n) +{ ir_loop *l = get_irg_loop(current_ir_graph); l = find_nodes_loop(n, l); return l; @@ -189,12 +197,13 @@ ir_loop * get_irn_loop(ir_node *n) { /**********************************************************************/ static ir_node **stack = NULL; -static int tos = 0; /* top of stack */ +static size_t tos = 0; /* top of stack */ /** * initializes the stack */ -static inline void init_stack(void) { +static inline void init_stack(void) +{ if (stack) { ARR_RESIZE(ir_node *, stack, 1000); } else { @@ -206,7 +215,8 @@ static inline void init_stack(void) { /** * Frees the stack. */ -static void finish_stack(void) { +static void finish_stack(void) +{ DEL_ARR_F(stack); stack = NULL; } @@ -216,12 +226,13 @@ static void finish_stack(void) { * * @param n The node to push */ -static inline void push(ir_node *n) { +static inline void push(ir_node *n) +{ if (tos == ARR_LEN(stack)) { - int nlen = ARR_LEN(stack) * 2; + size_t nlen = ARR_LEN(stack) * 2; ARR_RESIZE(ir_node *, stack, nlen); } - stack [tos++] = n; + stack[tos++] = n; mark_irn_in_stack(n); } @@ -230,8 +241,12 @@ static inline void push(ir_node *n) { * * @return The topmost node */ -static inline ir_node *pop(void) { - ir_node *n = stack[--tos]; +static inline ir_node *pop(void) +{ + ir_node *n; + + assert(tos > 0); + n = stack[--tos]; mark_irn_not_in_stack(n); return n; } @@ -240,9 +255,9 @@ static inline ir_node *pop(void) { * The nodes up to n belong to the current loop. * Removes them from the stack and adds them to the current loop. */ -static inline void pop_scc_to_loop(ir_node *n) { +static inline void pop_scc_to_loop(ir_node *n) +{ ir_node *m; - int i = 0; do { m = pop(); @@ -251,20 +266,15 @@ static inline void pop_scc_to_loop(ir_node *n) { set_irn_dfn(m, loop_node_cnt); add_loop_node(current_loop, m); set_irn_loop(m, current_loop); - ++i; } while (m != n); - - /* i might be bigger than 1 for dead (and that's why bad) loops */ - /* if(i > 1) - printf("Mehr als eine Iteration!!!!!!!!!!!!!!!!!!!!!!!!!!!!11111\n"); - */ } /* GL ??? my last son is my grandson??? Removes loops with no ir_nodes in them. Such loops have only another loop as son. (Why can't they have two loops as sons? Does it never get that far? ) */ -static void close_loop(ir_loop *l) { - int last = get_loop_n_elements(l) - 1; +static void close_loop(ir_loop *l) +{ + size_t last = get_loop_n_elements(l) - 1; loop_element lelement = get_loop_element(l, last); ir_loop *last_son = lelement.son; @@ -289,7 +299,8 @@ static void close_loop(ir_loop *l) { /* Removes and unmarks all nodes up to n from the stack. The nodes must be visited once more to assign them to a scc. */ -static inline void pop_scc_unmark_visit(ir_node *n) { +static inline void pop_scc_unmark_visit(ir_node *n) +{ ir_node *m = NULL; while (m != n) { @@ -304,7 +315,8 @@ static inline void pop_scc_unmark_visit(ir_node *n) { /* Allocates a new loop as son of current_loop. Sets current_loop to the new loop and returns the father. */ -static ir_loop *new_loop(void) { +static ir_loop *new_loop(void) +{ ir_loop *father = current_loop; ir_loop *son = alloc_loop(father, outermost_ir_graph->obst); @@ -319,19 +331,22 @@ static ir_loop *new_loop(void) { /* Initialization steps. **********************************************/ -static inline void init_node(ir_node *n, void *env) { - struct obstack *obst = env; +static inline void init_node(ir_node *n, void *env) +{ + struct obstack *obst = (struct obstack*) env; set_irn_link(n, new_scc_info(obst)); clear_backedges(n); } -static inline void init_scc_common(void) { +static inline void init_scc_common(void) +{ current_dfn = 1; loop_node_cnt = 0; init_stack(); } -static inline void init_scc(ir_graph *irg, struct obstack *obst) { +static inline void init_scc(ir_graph *irg, struct obstack *obst) +{ init_scc_common(); irg_walk_graph(irg, init_node, NULL, obst); /* @@ -344,17 +359,6 @@ static inline void finish_scc(void) finish_stack(); } -#ifdef INTERPROCEDURAL_VIEW -static inline void init_ip_scc(struct obstack *obst) { - init_scc_common(); - cg_walk(init_node, NULL, obst); - -#if EXPERIMENTAL_LOOP_TREE - cg_walk(link_to_reg_end, NULL, NULL); -#endif -} -#endif - /** * Check weather a given node represents the outer most Start * block. In intra-procedural view this is the start block of the @@ -365,7 +369,8 @@ static inline void init_ip_scc(struct obstack *obst) { * * This is the condition for breaking the scc recursion. */ -static int is_outermost_Start(ir_node *n) { +static int is_outermost_Start(ir_node *n) +{ /* Test whether this is the outermost Start node. */ if (is_Block(n) && get_Block_n_cfgpreds(n) == 1) { ir_node *pred = skip_Proj(get_Block_cfgpred(n, 0)); @@ -376,23 +381,22 @@ static int is_outermost_Start(ir_node *n) { } /* When to walk from nodes to blocks. Only for Control flow operations? */ -static inline int get_start_index(ir_node *n) { +static inline int get_start_index(ir_node *n) +{ #undef BLOCK_BEFORE_NODE #define BLOCK_BEFORE_NODE 1 #if BLOCK_BEFORE_NODE /* This version assures, that all nodes are ordered absolutely. This allows - to undef all nodes in the heap analysis if the block is false, which means - not reachable. - I.e., with this code, the order on the loop tree is correct. But a (single) - test showed the loop tree is deeper. */ - if (get_irn_op(n) == op_Phi || - is_Block(n) || - (is_Filter(n) && get_interprocedural_view()) || ( - get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats && - get_irn_pinned(n) == op_pin_state_floats - )) + to undef all nodes in the heap analysis if the block is false, which + means not reachable. + I.e., with this code, the order on the loop tree is correct. But a + (single) test showed the loop tree is deeper. */ + if (get_irn_op(n) == op_Phi || + is_Block(n) || + (get_irg_pinned(get_irn_irg(n)) == op_pin_state_floats && + get_irn_pinned(n) == op_pin_state_floats)) // Here we could test for backedge at -1 which is illegal return 0; else @@ -415,26 +419,26 @@ static inline int get_start_index(ir_node *n) { /** * Return non-zero if the given node is a legal loop header: - * Block, Phi, Filter. + * Block, Phi * * @param n the node to check */ -static inline int is_possible_loop_head(ir_node *n) { +static inline int is_possible_loop_head(ir_node *n) +{ ir_op *op = get_irn_op(n); return ((op == op_Block) || - (op == op_Phi) || - ((op == op_Filter) && get_interprocedural_view())); + (op == op_Phi)); } /** - * Returns non-zero if n is a loop header, i.e., it is a Block, Phi - * or Filter node and has predecessors within the loop and out - * of the loop. + * Returns non-zero if n is a loop header, i.e., it is a Block or Phi + * node and has predecessors within the loop and out of the loop. * * @param n the node to check * @param root only needed for assertion. */ -static int is_head(ir_node *n, ir_node *root) { +static int is_head(ir_node *n, ir_node *root) +{ int i, arity; int some_outof_loop = 0, some_in_loop = 0; @@ -467,13 +471,14 @@ static int is_head(ir_node *n, ir_node *root) { /** * Returns non-zero if n is possible loop head of an endless loop. - * I.e., it is a Block, Phi or Filter node and has only predecessors + * I.e., it is a Block or Phi node and has only predecessors * within the loop. * * @param n the node to check * @param root only needed for assertion. */ -static int is_endless_head(ir_node *n, ir_node *root) { +static int is_endless_head(ir_node *n, ir_node *root) +{ int i, arity; int none_outof_loop = 1, some_in_loop = 0; @@ -506,7 +511,8 @@ static int is_endless_head(ir_node *n, ir_node *root) { /** Returns index of the predecessor with the smallest dfn number greater-equal than limit. */ -static int smallest_dfn_pred(ir_node *n, int limit) { +static int smallest_dfn_pred(ir_node *n, int limit) +{ int i, index = -2, min = -1; if (!is_outermost_Start(n)) { @@ -527,7 +533,8 @@ static int smallest_dfn_pred(ir_node *n, int limit) { /** * Returns index of the predecessor with the largest dfn number. */ -static int largest_dfn_pred(ir_node *n) { +static int largest_dfn_pred(ir_node *n) +{ int i, index = -2, max = -1; if (!is_outermost_Start(n)) { @@ -554,7 +561,8 @@ static int largest_dfn_pred(ir_node *n) { * * @param n A node where uplink == dfn. */ -static ir_node *find_tail(ir_node *n) { +static ir_node *find_tail(ir_node *n) +{ ir_node *m; int i, res_index = -2; @@ -601,7 +609,9 @@ static ir_node *find_tail(ir_node *n) { res_index = largest_dfn_pred (m); break; } - if (m == n) { break; } /* It's not an unreachable loop, either. */ + /* It's not an unreachable loop, either. */ + if (m == n) + break; } //assert(0 && "no head found on stack"); } @@ -611,8 +621,10 @@ static ir_node *find_tail(ir_node *n) { /* It's a completely bad loop: without Phi/Block nodes that can be a head. I.e., the code is "dying". We break the loop by setting Bad nodes. */ - int arity = get_irn_arity(n); - ir_node *bad = get_irg_bad(get_irn_irg(n)); + ir_graph *irg = get_irn_irg(n); + ir_mode *mode = get_irn_mode(n); + ir_node *bad = new_r_Bad(irg, mode); + int arity = get_irn_arity(n); for (i = -1; i < arity; ++i) { set_irn_n(n, i, bad); } @@ -624,81 +636,11 @@ static ir_node *find_tail(ir_node *n) { return is_outermost_Start(n) ? NULL : get_irn_n(m, res_index); } - -#if EXPERIMENTAL_LOOP_TREE - -/* ---------------------------------------------------------------- - AS: This is experimental code to build loop trees suitable for - the heap analysis. Does not work correctly right now... :-( - - - Search in stack for the corresponding first Call-End-ProjX that - corresponds to one of the control flow predecessors of the given - block, that is the possible callers. - returns: the control predecessor to chose\ - or -1 if no corresponding Call-End-Node could be found - on the stack. - - -------------------------------------------------------------- */ - -int search_endproj_in_stack(ir_node *start_block) { - int i, j; - assert(is_Block(start_block)); - for(i = tos - 1; i >= 0; --i) - { - if(get_irn_op(stack[i]) == op_Proj && get_irn_mode(stack[i]) == mode_X && - get_irn_op(get_irn_n(stack[i], 0)) == op_EndReg) - { - printf("FOUND PROJ!!!!!!!!!!!!!!!!!!!!!!!!!!\n"); - ir_node *end_projx = stack[i]; - - int arity = get_irn_arity(start_block); - for(j = 0; j < arity; j++) - { - ir_node *begin_projx = get_Block_cfgpred(get_irg_start_block(get_irn_irg(end_projx)), - get_Proj_proj(end_projx)); - if(get_irn_n(start_block, j) == begin_projx) - { - printf("FOUND IT!!!!!!!!!!!!!!!!!!\n"); - return(j); - } - } - } - } - return(-1); -} - - -static pmap *projx_link = NULL; - -void link_to_reg_end (ir_node *n, void *env) { - if(get_irn_op(n) == op_Proj && - get_irn_mode(n) == mode_X && - get_irn_op(get_irn_n(n, 0)) == op_EndReg) { - /* Reg End Projx -> Find the CallBegin Projx and hash it */ - ir_node *end_projx = n; - ir_node *begin_projx = get_Block_cfgpred(get_irg_start_block(get_irn_irg(end_projx)), - get_Proj_proj(end_projx)); - set_projx_link(begin_projx, end_projx); - } -} - -void set_projx_link(ir_node *cb_projx, ir_node *end_projx) { - if(projx_link == NULL) - projx_link = pmap_create(); - pmap_insert(projx_link, (void *)cb_projx, (void *)end_projx); -} - -ir_node *get_projx_link(ir_node *cb_projx) { - return((ir_node *) pmap_get(projx_link, (void *)cb_projx)); -} - -#endif - -static inline int is_outermost_loop(ir_loop *l) { +static inline int is_outermost_loop(ir_loop *l) +{ return l == get_loop_outer_loop(l); } - /*-----------------------------------------------------------* * The core algorithm. * *-----------------------------------------------------------*/ @@ -708,7 +650,8 @@ static inline int is_outermost_loop(ir_loop *l) { * * @param n node to start */ -static void scc(ir_node *n) { +static void scc(ir_node *n) +{ if (irn_visited_else_mark(n)) return; @@ -806,114 +749,12 @@ static void scc(ir_node *n) { } } -#ifdef INTERPROCEDURAL_VIEW -static void my_scc(ir_node *n) { - int i; - if (irn_visited_else_mark(n)) - return; - - /* Initialize the node */ - set_irn_dfn(n, current_dfn); /* Depth first number for this node */ - set_irn_uplink(n, current_dfn); /* ... is default uplink. */ - set_irn_loop(n, NULL); - current_dfn ++; - push(n); - - /* AS: get_start_index might return -1 for Control Flow Nodes, and thus a negative - array index would be passed to is_backedge(). But CFG Nodes dont't have a backedge array, - so is_backedge does not access array[-1] but correctly returns false! */ - - if (!is_outermost_Start(n)) { - int arity = get_irn_arity(n); - - for (i = get_start_index(n); i < arity; i++) { - ir_node *m; - if (is_backedge(n, i)) continue; - m = get_irn_n(n, i); /* get_irn_ip_pred(n, i); */ - /* if (!m || is_Unknown(m)) continue; */ - my_scc(m); - if (irn_is_in_stack(m)) { - /* Uplink of m is smaller if n->m is a backedge. - Propagate the uplink to mark the loop. */ - if (get_irn_uplink(m) < get_irn_uplink(n)) - set_irn_uplink(n, get_irn_uplink(m)); - } - } - } - - if (get_irn_dfn(n) == get_irn_uplink(n)) { - /* This condition holds for - 1) the node with the incoming backedge. - That is: We found a loop! - 2) Straight line code, because no uplink has been propagated, so the - uplink still is the same as the dfn. - - But n might not be a proper loop head for the analysis. Proper loop - heads are Block and Phi nodes. find_tail searches the stack for - Block's and Phi's and takes those nodes as loop heads for the current - loop instead and marks the incoming edge as backedge. */ - - ir_node *tail = find_tail(n); - if (tail) { - /* We have a loop, that is no straight line code, - because we found a loop head! - Next actions: Open a new loop on the loop tree and - try to find inner loops */ - -#if NO_LOOPS_WITHOUT_HEAD - /* This is an adaption of the algorithm from fiasco / optscc to - * avoid loops without Block or Phi as first node. This should - * severely reduce the number of evaluations of nodes to detect - * a fixpoint in the heap analysis. - * Further it avoids loops without firm nodes that cause errors - * in the heap analyses. */ - - ir_loop *l; - int close; - if ((get_loop_n_elements(current_loop) > 0) || (is_outermost_loop(current_loop))) { - l = new_loop(); - close = 1; - } else { - l = current_loop; - close = 0; - } -#else - ir_loop *l = new_loop(); -#endif - - /* Remove the loop from the stack ... */ - pop_scc_unmark_visit(n); - - /* The current backedge has been marked, that is temporarily eliminated, - by find tail. Start the scc algorithm - anew on the subgraph that is left (the current loop without the backedge) - in order to find more inner loops. */ - my_scc(tail); - - assert(irn_visited(n)); -#if NO_LOOPS_WITHOUT_HEAD - if (close) -#endif - close_loop(l); - } else { - /* No loop head was found, that is we have straightline code. - Pop all nodes from the stack to the current loop. */ - pop_scc_to_loop(n); - } - } -} -#endif /* INTERPROCEDURAL_VIEW */ - -/* Constructs backedge information for irg. In interprocedural view constructs - backedges for all methods called by irg, too. */ -int construct_backedges(ir_graph *irg) { +int construct_backedges(ir_graph *irg) +{ ir_graph *rem = current_ir_graph; ir_loop *head_rem; struct obstack temp; - assert(!get_interprocedural_view() && - "not implemented, use construct_ip_backedges()"); - max_loop_depth = 0; current_ir_graph = irg; outermost_ir_graph = irg; @@ -935,178 +776,22 @@ int construct_backedges(ir_graph *irg) { assert(head_rem == current_loop); mature_loops(current_loop, irg->obst); set_irg_loop(irg, current_loop); - set_irg_loopinfo_state(irg, loopinfo_consistent); + set_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_LOOPINFO); assert(get_irg_loop(irg)->kind == k_ir_loop); current_ir_graph = rem; return max_loop_depth; } - -#ifdef INTERPROCEDURAL_VIEW -int construct_ip_backedges(void) { - ir_graph *rem = current_ir_graph; - int rem_ipv = get_interprocedural_view(); - int i; - strcut obstack temp; - - max_loop_depth = 0; - assert(get_irp_ip_view_state() == ip_view_valid); - - outermost_ir_graph = get_irp_main_irg(); - - obstack_init(&temp); - init_ip_scc(&temp); - - current_loop = NULL; - new_loop(); /* sets current_loop */ - set_interprocedural_view(1); - - inc_max_irg_visited(); - for (i = 0; i < get_irp_n_irgs(); i++) - set_irg_visited(get_irp_irg(i), get_max_irg_visited()); - - /** We have to start the walk at the same nodes as cg_walk. **/ - /* Walk starting at unreachable procedures. Only these - * have End blocks visible in interprocedural view. */ - for (i = 0; i < get_irp_n_irgs(); i++) { - ir_node *sb; - current_ir_graph = get_irp_irg(i); - - sb = get_irg_start_block(current_ir_graph); - - if ((get_Block_n_cfgpreds(sb) > 1) || - (get_nodes_block(get_Block_cfgpred(sb, 0)) != sb)) - continue; - - scc(get_irg_end(current_ir_graph)); - } - - /* Check whether we walked all procedures: there could be procedures - with cyclic calls but no call from the outside. */ - for (i = 0; i < get_irp_n_irgs(); i++) { - ir_node *sb; - current_ir_graph = get_irp_irg(i); - - /* Test start block: if inner procedure end and end block are not - * visible and therefore not marked. */ - sb = get_irg_start_block(current_ir_graph); - if (get_irn_visited(sb) < get_irg_visited(current_ir_graph)) scc(sb); - } - - /* Walk all endless loops in inner procedures. - * We recognize an inner procedure if the End node is not visited. */ - for (i = 0; i < get_irp_n_irgs(); i++) { - ir_node *e; - current_ir_graph = get_irp_irg(i); - - e = get_irg_end(current_ir_graph); - if (get_irn_visited(e) < get_irg_visited(current_ir_graph)) { - int j; - /* Don't visit the End node. */ - for (j = 0; j < get_End_n_keepalives(e); j++) - scc(get_End_keepalive(e, j)); - } - } - - set_irg_loop(outermost_ir_graph, current_loop); - set_irg_loopinfo_state(current_ir_graph, loopinfo_ip_consistent); - assert(get_irg_loop(outermost_ir_graph)->kind == k_ir_loop); - - obstack_free(&temp, NULL); - current_ir_graph = rem; - set_interprocedural_view(rem_ipv); - return max_loop_depth; -} - -void my_construct_ip_backedges(void) { - ir_graph *rem = current_ir_graph; - int rem_ipv = get_interprocedural_view(); - int i; - - assert(get_irp_ip_view_state() == ip_view_valid); - - outermost_ir_graph = get_irp_main_irg(); - - init_ip_scc(); - - current_loop = NULL; - new_loop(); /* sets current_loop */ - set_interprocedural_view(1); - - inc_max_irg_visited(); - for (i = 0; i < get_irp_n_irgs(); i++) - set_irg_visited(get_irp_irg(i), get_max_irg_visited()); - - /** We have to start the walk at the same nodes as cg_walk. **/ - /* Walk starting at unreachable procedures. Only these - * have End blocks visible in interprocedural view. */ - for (i = 0; i < get_irp_n_irgs(); i++) { - ir_node *sb; - current_ir_graph = get_irp_irg(i); - - sb = get_irg_start_block(current_ir_graph); - - if ((get_Block_n_cfgpreds(sb) > 1) || - (get_nodes_block(get_Block_cfgpred(sb, 0)) != sb)) continue; - - my_scc(get_irg_end(current_ir_graph)); - } - - /* Check whether we walked all procedures: there could be procedures - with cyclic calls but no call from the outside. */ - for (i = 0; i < get_irp_n_irgs(); i++) { - ir_node *sb; - current_ir_graph = get_irp_irg(i); - - /* Test start block: if inner procedure end and end block are not - * visible and therefore not marked. */ - sb = get_irg_start_block(current_ir_graph); - if (get_irn_visited(sb) < get_irg_visited(current_ir_graph)) - scc(sb); - } - - /* Walk all endless loops in inner procedures. - * We recognize an inner procedure if the End node is not visited. */ - for (i = 0; i < get_irp_n_irgs(); i++) { - ir_node *e; - current_ir_graph = get_irp_irg(i); - - e = get_irg_end(current_ir_graph); - if (get_irn_visited(e) < get_irg_visited(current_ir_graph)) { - int j; - /* Don't visit the End node. */ - for (j = 0; j < get_End_n_keepalives(e); j++) scc(get_End_keepalive(e, j)); - } - } - - set_irg_loop(outermost_ir_graph, current_loop); - set_irg_loopinfo_state(current_ir_graph, loopinfo_ip_consistent); - assert(get_irg_loop(outermost_ir_graph)->kind == k_ir_loop); - - current_ir_graph = rem; - set_interprocedural_view(rem_ipv); -} -#endif - -static void reset_backedges(ir_node *n) { +static void reset_backedges(ir_node *n) +{ if (is_possible_loop_head(n)) { -#ifdef INTERPROCEDURAL_VIEW - int rem = get_interprocedural_view(); - - set_interprocedural_view(1); - clear_backedges(n); - set_interprocedural_view(1); clear_backedges(n); - set_interprocedural_view(rem); -#else - clear_backedges(n); -#endif } } - /* -static void loop_reset_backedges(ir_loop *l) { +static void loop_reset_backedges(ir_loop *l) +{ int i; reset_backedges(get_loop_node(l, 0)); for (i = 0; i < get_loop_n_nodes(l); ++i) @@ -1117,16 +802,15 @@ static void loop_reset_backedges(ir_loop *l) { } */ -static void loop_reset_node(ir_node *n, void *env) { +static void loop_reset_node(ir_node *n, void *env) +{ (void) env; set_irn_loop(n, NULL); reset_backedges(n); } - -/** Removes all loop information. - Resets all backedges */ -void free_loop_information(ir_graph *irg) { +void free_loop_information(ir_graph *irg) +{ /* We can not use this recursion, as the loop might contain illegal nodes by now. Why else would we throw away the representation? @@ -1134,97 +818,25 @@ void free_loop_information(ir_graph *irg) { */ irg_walk_graph(irg, loop_reset_node, NULL, NULL); set_irg_loop(irg, NULL); - set_irg_loopinfo_state(current_ir_graph, loopinfo_none); + clear_irg_state(current_ir_graph, IR_GRAPH_STATE_CONSISTENT_LOOPINFO); /* We cannot free the loop nodes, they are on the obstack. */ } - -void free_all_loop_information(void) { - int i; -#ifdef INTERPROCEDURAL_VIEW - int rem = get_interprocedural_view(); - set_interprocedural_view(1); /* To visit all filter nodes */ -#endif +void free_all_loop_information(void) +{ + size_t i; for (i = 0; i < get_irp_n_irgs(); i++) { free_loop_information(get_irp_irg(i)); } -#ifdef INTERPROCEDURAL_VIEW - set_interprocedural_view(rem); -#endif -} - - - - - -/* Debug stuff *************************************************/ - -static int test_loop_node(ir_loop *l) { - int i, has_node = 0, found_problem = 0; - loop_element le; - - assert(l && l->kind == k_ir_loop); - - if (get_loop_n_elements(l) == 0) { - found_problem = 1; - dump_loop(l, "-ha"); - } - - le = get_loop_element(l, 0); - if (*(le.kind) != k_ir_node) { - assert(le.kind && *(le.kind) == k_ir_loop); - - found_problem = 1; - dump_loop(l, "-ha"); - } - - if ((*(le.kind) == k_ir_node) && !is_possible_loop_head(le.node)) { - found_problem = 1; - dump_loop(l, "-ha"); - } - - if ((get_loop_depth(l) != 0) && - (*(le.kind) == k_ir_node) && !has_backedges(le.node)) { - found_problem = 1; - dump_loop(l, "-ha"); - } - - /* Recur */ - has_node = 0; - for (i = 0; i < get_loop_n_elements(l); ++i) { - le = get_loop_element(l, i); - if (*(le.kind) == k_ir_node) - has_node++; - else - if (test_loop_node(le.son)) found_problem = 1; - } - - if (has_node == 0) { - found_problem = 1; - dump_loop(l, "-ha"); - } - - return found_problem; -} - -/** Prints all loop nodes that - * - do not have any firm nodes, only loop sons - * - the header is not a Phi, Block or Filter. - */ -void find_strange_loop_nodes(ir_loop *l) { - int found_problem = 0; - found_problem = test_loop_node(l); - printf("Finished Test\n\n"); - if (found_problem) exit(0); - } /* ------------------------------------------------------------------- */ /* Simple analyses based on the loop information */ /* ------------------------------------------------------------------- */ -int is_loop_variant(ir_loop *l, ir_loop *b) { - int i, n_elems; +static int is_loop_variant(ir_loop *l, ir_loop *b) +{ + size_t i, n_elems; if (l == b) return 1; @@ -1239,15 +851,8 @@ int is_loop_variant(ir_loop *l, ir_loop *b) { return 0; } -/* Test whether a value is loop invariant. - * - * @param n The node to be tested. - * @param block A block node. We pass the block, not the loop as we must - * start off with a block loop to find all proper uses. - * - * Returns non-zero, if the node n is not changed in the loop block - * belongs to or in inner loops of this blocks loop. */ -int is_loop_invariant(const ir_node *n, const ir_node *block) { +int is_loop_invariant(const ir_node *n, const ir_node *block) +{ ir_loop *l = get_irn_loop(block); const ir_node *b = is_Block(n) ? n : get_nodes_block(n); return !is_loop_variant(l, get_irn_loop(b));