X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgwalk.c;h=10484be99d1450f771d07ec131b1e2bc68e44c71;hb=a826556627270364ae3683c31e4b8cec4b5479c4;hp=3fc2fa9932fe1001952ff2d05b83efed37b27e3b;hpb=443730f33bedbae60304c7773d6b14062eceaa6d;p=libfirm diff --git a/ir/ir/irgwalk.c b/ir/ir/irgwalk.c index 3fc2fa993..10484be99 100644 --- a/ir/ir/irgwalk.c +++ b/ir/ir/irgwalk.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -22,36 +22,36 @@ * @brief Functions for traversing ir graphs * @author Boris Boesler, Goetz Lindenmaier, Michael Beck * @version $Id$ - * @summary + * @brief * traverse an ir graph * - execute the pre function before recursion * - execute the post function after recursion */ -#ifdef HAVE_CONFIG_H -# include "config.h" -#endif +#include "config.h" -#ifdef HAVE_STDLIB_H -# include -#endif +#include #include "irnode_t.h" -#include "irgraph_t.h" /* visited flag */ +#include "irgraph_t.h" #include "irprog.h" #include "irgwalk.h" #include "irhooks.h" #include "ircgcons.h" +#include "entity_t.h" +#include "error.h" #include "pset_new.h" #include "array.h" +#ifdef INTERPROCEDURAL_VIEW /** * Walk over an interprocedural graph (callgraph). * Visits only graphs in irg_set. */ -static void irg_walk_cg(ir_node * node, unsigned long visited, +static void irg_walk_cg(ir_node * node, ir_visited_t visited, pset_new_t *irg_set, irg_walk_func *pre, - irg_walk_func *post, void * env) { + irg_walk_func *post, void * env) +{ int i; ir_graph * rem = current_ir_graph; ir_node * pred; @@ -64,43 +64,44 @@ static void irg_walk_cg(ir_node * node, unsigned long visited, if (pre) pre(node, env); pred = skip_Proj(node); - if (get_irn_op(pred) == op_CallBegin - || get_irn_op(pred) == op_EndReg - || get_irn_op(pred) == op_EndExcept) { - current_ir_graph = get_irn_irg(pred); + if (is_CallBegin(pred) || + get_irn_op(pred) == op_EndReg || + get_irn_op(pred) == op_EndExcept) { + current_ir_graph = get_irn_irg(pred); } if (is_no_Block(node)) { /* not block */ irg_walk_cg(get_nodes_block(node), visited, irg_set, pre, post, env); } - if (get_irn_op(node) == op_Block) { /* block */ + if (is_Block(node)) { /* block */ for (i = get_irn_arity(node) - 1; i >= 0; --i) { ir_node * exec = get_irn_n(node, i); ir_node * pred = skip_Proj(exec); - if ((get_irn_op(pred) != op_CallBegin - && get_irn_op(pred) != op_EndReg - && get_irn_op(pred) != op_EndExcept) - || pset_new_contains(irg_set, get_irn_irg(pred))) { - irg_walk_cg(exec, visited, irg_set, pre, post, env); + if (( + !is_CallBegin(pred) && + get_irn_op(pred) != op_EndReg && + get_irn_op(pred) != op_EndExcept + ) || pset_new_contains(irg_set, get_irn_irg(pred))) { + irg_walk_cg(exec, visited, irg_set, pre, post, env); } } - } else if (get_irn_op(node) == op_Filter) { /* filter */ + } else if (is_Filter(node)) { /* filter */ for (i = get_irn_arity(node) - 1; i >= 0; --i) { ir_node * pred = get_irn_n(node, i); - if (get_irn_op(pred) == op_Unknown || get_irn_op(pred) == op_Bad) { + if (is_Unknown(pred) || is_Bad(pred)) { irg_walk_cg(pred, visited, irg_set, pre, post, env); } else { ir_node * exec; exec = skip_Proj(get_Block_cfgpred(get_nodes_block(node), i)); - if (op_Bad == get_irn_op (exec)) { + if (is_Bad(exec)) { continue; } - assert(get_irn_op(exec) == op_CallBegin - || get_irn_op(exec) == op_EndReg - || get_irn_op(exec) == op_EndExcept); + assert(is_CallBegin(exec) || + get_irn_op(exec) == op_EndReg || + get_irn_op(exec) == op_EndExcept); if (pset_new_contains(irg_set, get_irn_irg(exec))) { current_ir_graph = get_irn_irg(exec); irg_walk_cg(pred, visited, irg_set, pre, post, env); @@ -119,11 +120,11 @@ static void irg_walk_cg(ir_node * node, unsigned long visited, current_ir_graph = rem; } - /** * Insert all ir_graphs in irg_set, that are (transitive) reachable. */ -static void collect_irgs(ir_node * node, pset_new_t *irg_set) { +static void collect_irgs(ir_node * node, pset_new_t *irg_set) +{ if (is_Call(node)) { int i; for (i = get_Call_n_callees(node) - 1; i >= 0; --i) { @@ -136,14 +137,15 @@ static void collect_irgs(ir_node * node, pset_new_t *irg_set) { } } } +#endif /** * specialized version of irg_walk_2, called if only pre callback exists * * @return number of visited nodes */ -static unsigned -irg_walk_2_pre(ir_node *node, irg_walk_func *pre, void * env) { +static unsigned irg_walk_2_pre(ir_node *node, irg_walk_func *pre, void * env) +{ int i; unsigned cnt = 1; ir_graph *irg = current_ir_graph; @@ -170,8 +172,8 @@ irg_walk_2_pre(ir_node *node, irg_walk_func *pre, void * env) { * * @return number of visited nodes */ -static unsigned -irg_walk_2_post(ir_node *node, irg_walk_func *post, void * env) { +static unsigned irg_walk_2_post(ir_node *node, irg_walk_func *post, void * env) +{ int i; unsigned cnt = 1; ir_graph *irg = current_ir_graph; @@ -199,8 +201,8 @@ irg_walk_2_post(ir_node *node, irg_walk_func *post, void * env) { * * @return number of visited nodes */ -static unsigned -irg_walk_2_both(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) { +static unsigned irg_walk_2_both(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) +{ int i; unsigned cnt = 1; ir_graph *irg = current_ir_graph; @@ -230,8 +232,8 @@ irg_walk_2_both(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * e * * @return number of visited nodes */ -static unsigned -irg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) +unsigned irg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, + void *env) { if (node->visited < current_ir_graph->visited) { if (!post) return irg_walk_2_pre (node, pre, env); @@ -251,10 +253,11 @@ void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) { assert(is_ir_node(node)); +#ifdef INTERPROCEDURAL_VIEW if (get_interprocedural_view()) { pset_new_t irg_set; pset_new_iterator_t iter; - unsigned long visited; + ir_visited_t visited; ir_graph *irg; assert(get_irp_ip_view_state() == ip_view_valid); @@ -271,18 +274,21 @@ void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) irg_walk_cg(node, visited, &irg_set, pre, post, env); pset_new_destroy(&irg_set); } else { - set_using_visited(current_ir_graph); +#endif + ir_reserve_resources(current_ir_graph, IR_RESOURCE_IRN_VISITED); inc_irg_visited(current_ir_graph); nodes_touched = irg_walk_2(node, pre, post, env); - clear_using_visited(current_ir_graph); + ir_free_resources(current_ir_graph, IR_RESOURCE_IRN_VISITED); +#ifdef INTERPROCEDURAL_VIEW } - return; +#endif } /* * walk over a graph */ -void irg_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) { +void irg_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) +{ ir_graph * rem = current_ir_graph; hook_irg_walk(irg, (generic_func *)pre, (generic_func *)post); @@ -295,7 +301,8 @@ void irg_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void /* Executes irg_walk(end, pre, post, env) for all irgraphs in irprog. Sets current_ir_graph properly for each walk. Conserves current current_ir_graph. */ -void all_irg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) { +void all_irg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) +{ int i, n; ir_graph *irg; @@ -312,8 +319,8 @@ void all_irg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) { * * @return number of visited nodes */ -static unsigned -irg_walk_in_or_dep_2_pre(ir_node *node, irg_walk_func *pre, void *env) { +static unsigned irg_walk_in_or_dep_2_pre(ir_node *node, irg_walk_func *pre, void *env) +{ int i; unsigned cnt = 1; ir_graph *irg = current_ir_graph; @@ -340,8 +347,8 @@ irg_walk_in_or_dep_2_pre(ir_node *node, irg_walk_func *pre, void *env) { * * @return number of visited nodes */ -static unsigned -irg_walk_in_or_dep_2_post(ir_node *node, irg_walk_func *post, void *env) { +static unsigned irg_walk_in_or_dep_2_post(ir_node *node, irg_walk_func *post, void *env) +{ int i; unsigned cnt = 1; ir_graph *irg = current_ir_graph; @@ -369,8 +376,8 @@ irg_walk_in_or_dep_2_post(ir_node *node, irg_walk_func *post, void *env) { * * @return number of visited nodes */ -static unsigned -irg_walk_in_or_dep_2_both(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) { +static unsigned irg_walk_in_or_dep_2_both(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) +{ int i; unsigned cnt = 1; ir_graph *irg = current_ir_graph; @@ -400,8 +407,7 @@ irg_walk_in_or_dep_2_both(ir_node *node, irg_walk_func *pre, irg_walk_func *post * * @return number of visited nodes */ -static unsigned -irg_walk_in_or_dep_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) +static unsigned irg_walk_in_or_dep_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) { if (node->visited < current_ir_graph->visited) { if (! post) return irg_walk_in_or_dep_2_pre (node, pre, env); @@ -421,18 +427,18 @@ void irg_walk_in_or_dep(ir_node *node, irg_walk_func *pre, irg_walk_func *post, if (get_interprocedural_view()) { assert(0 && "This is not yet implemented."); } else { - set_using_visited(current_ir_graph); + ir_reserve_resources(current_ir_graph, IR_RESOURCE_IRN_VISITED); inc_irg_visited(current_ir_graph); nodes_touched = irg_walk_in_or_dep_2(node, pre, post, env); - clear_using_visited(current_ir_graph); + ir_free_resources(current_ir_graph, IR_RESOURCE_IRN_VISITED); } - return; } /* * Walk over a graph. Follow all edges (including dependencies) */ -void irg_walk_in_or_dep_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) { +void irg_walk_in_or_dep_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) +{ ir_graph * rem = current_ir_graph; hook_irg_walk(irg, (generic_func *)pre, (generic_func *)post); @@ -448,15 +454,15 @@ void irg_walk_in_or_dep_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func * * Returns current_ir_graph and sets it to the irg of predecessor index * of node n. */ -static INLINE ir_graph * -switch_irg(ir_node *n, int index) { +static inline ir_graph * switch_irg(ir_node *n, int index) +{ ir_graph *old_current = current_ir_graph; if (get_interprocedural_view()) { /* Only Filter and Block nodes can have predecessors in other graphs. */ - if (get_irn_op(n) == op_Filter) + if (is_Filter(n)) n = get_nodes_block(n); - if (get_irn_op(n) == op_Block) { + if (is_Block(n)) { ir_node *cfop = skip_Proj(get_Block_cfgpred(n, index)); if (is_ip_cfop(cfop)) { current_ir_graph = get_irn_irg(cfop); @@ -467,8 +473,8 @@ switch_irg(ir_node *n, int index) { return old_current; } -static void -cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) +#ifdef INTERPROCEDURAL_VIEW +static void cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) { int i; ir_graph *rem = NULL; @@ -490,12 +496,11 @@ cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) if (post) post(node, env); } - return; } - /* Walks all irgs in interprocedural view. Visits each node only once. */ -void cg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) { +void cg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) +{ int i; ir_graph *rem = current_ir_graph; int rem_view = get_interprocedural_view(); @@ -552,37 +557,36 @@ void cg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) { set_interprocedural_view(rem_view); current_ir_graph = rem; } +#endif /***************************************************************************/ /* Walks back from n until it finds a real cf op. */ -static ir_node *get_cf_op(ir_node *n) { - ir_node *pred; - - n = skip_Id(n); - n = skip_Tuple(n); - pred = skip_Proj(n); - if (!(is_cfop(pred) || is_fragile_op(pred) || is_Bad(pred))) - n = get_cf_op(n); - - return skip_Proj(n); +static ir_node *get_cf_op(ir_node *n) +{ + while (!is_cfop(n) && !is_fragile_op(n) && !is_Bad(n)) { + n = skip_Id(n); + n = skip_Tuple(n); + n = skip_Proj(n); + } + return n; } static void irg_block_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) { int i; - if (Block_not_block_visited(node)) { + if (!Block_block_visited(node)) { mark_Block_block_visited(node); - if(pre) pre(node, env); + if (pre) pre(node, env); - for(i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) { + for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) { /* find the corresponding predecessor block. */ ir_node *pred = get_cf_op(get_Block_cfgpred(node, i)); pred = get_nodes_block(pred); - if(get_irn_opcode(pred) == iro_Block) { + if (get_irn_opcode(pred) == iro_Block) { /* recursion */ irg_block_walk_2(pred, pre, post, env); } @@ -591,7 +595,7 @@ static void irg_block_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *p } } - if(post) post(node, env); + if (post) post(node, env); } } @@ -600,49 +604,48 @@ static void irg_block_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *p flag, so that it can be interleaved with the other walker. */ void irg_block_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) { + ir_graph *irg = current_ir_graph; ir_node *block, *pred; int i; - hook_irg_block_walk(current_ir_graph, node, (generic_func *)pre, (generic_func *)post); + hook_irg_block_walk(irg, node, (generic_func *)pre, (generic_func *)post); assert(node); assert(!get_interprocedural_view()); /* interprocedural_view not implemented, because it - * interleaves with irg_walk */ - set_using_block_visited(current_ir_graph); - inc_irg_block_visited(current_ir_graph); + * interleaves with irg_walk */ + ir_reserve_resources(irg, IR_RESOURCE_BLOCK_VISITED); + inc_irg_block_visited(irg); block = is_Block(node) ? node : get_nodes_block(node); - assert(get_irn_op(block) == op_Block); + assert(is_Block(block)); irg_block_walk_2(block, pre, post, env); /* keepalive: the endless loops ... */ - if (get_irn_op(node) == op_End) { + if (is_End(node)) { int arity = get_irn_arity(node); for (i = 0; i < arity; i++) { pred = get_irn_n(node, i); - if (get_irn_op(pred) == op_Block) - irg_block_walk_2(pred, pre, post, env); - } - /* Sometimes the blocks died, but are still reachable through Phis. - * Make sure the algorithms that try to remove these reach them. */ - for (i = 0; i < arity; i++) { - pred = get_irn_n(node, i); - if (get_irn_op(pred) == op_Phi) { - ir_node *block = get_nodes_block(pred); - - if (! is_Bad(block)) - irg_block_walk_2(block, pre, post, env); + if (!is_Block(pred)) { + pred = get_nodes_block(pred); + if (!is_Block(pred)) { + /* if rare cases a kept node might have a bad block input */ + continue; + } } + /* Sometimes the blocks died, but are still reachable through kept nodes. + * Make sure the algorithms that try to remove these reach them. */ + irg_block_walk_2(pred, pre, post, env); } } - clear_using_block_visited(current_ir_graph); + ir_free_resources(irg, IR_RESOURCE_BLOCK_VISITED); } /* * walk over a graph block wise */ void irg_block_walk_graph(ir_graph *irg, irg_walk_func *pre, - irg_walk_func *post, void *env) { + irg_walk_func *post, void *env) +{ ir_graph * rem = current_ir_graph; current_ir_graph = irg; irg_block_walk(get_irg_end(irg), pre, post, env); @@ -652,7 +655,8 @@ void irg_block_walk_graph(ir_graph *irg, irg_walk_func *pre, /* * Additionally walk over all anchors. Do NOT increase the visit flag. */ -void irg_walk_anchors(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) { +void irg_walk_anchors(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) +{ ir_graph * rem = current_ir_graph; current_ir_graph = irg; @@ -670,6 +674,29 @@ typedef struct walk_env { void *env; } walk_env; +static void walk_initializer(ir_initializer_t *initializer, walk_env *env) +{ + switch (initializer->kind) { + case IR_INITIALIZER_CONST: + irg_walk(initializer->consti.value, env->pre, env->post, env->env); + return; + case IR_INITIALIZER_TARVAL: + case IR_INITIALIZER_NULL: + return; + + case IR_INITIALIZER_COMPOUND: { + size_t i; + for (i = 0; i < initializer->compound.n_initializers; ++i) { + ir_initializer_t *subinitializer + = initializer->compound.initializers[i]; + walk_initializer(subinitializer, env); + } + return; + } + } + panic("invalid initializer found"); +} + /** * Walk to all constant expressions in this entity. */ @@ -677,22 +704,22 @@ static void walk_entity(ir_entity *ent, void *env) { walk_env *my_env = (walk_env *)env; - if (get_entity_variability(ent) != variability_uninitialized) { - if (is_atomic_entity(ent)) { - irg_walk(get_atomic_ent_value(ent), my_env->pre, my_env->post, my_env->env); - } else { - int i, n_vals = get_compound_ent_n_values(ent); + if (ent->initializer != NULL) { + walk_initializer(ent->initializer, my_env); + } else if (entity_has_compound_ent_values(ent)) { + int i, n_vals = get_compound_ent_n_values(ent); - for (i = 0; i < n_vals; i++) - irg_walk(get_compound_ent_value(ent, i), my_env->pre, my_env->post, my_env->env); - } + for (i = 0; i < n_vals; i++) + irg_walk(get_compound_ent_value(ent, i), my_env->pre, my_env->post, my_env->env); } } /* Walks over all code in const_code_irg. */ -void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) { +void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) +{ int i, j, n_types; walk_env my_env; + ir_segment_t s; ir_graph *rem = current_ir_graph; current_ir_graph = get_const_code_irg(); @@ -703,7 +730,8 @@ void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) { my_env.env = env; /* Walk all types that can contain constant entities. */ - walk_types_entities(get_glob_type(), &walk_entity, &my_env); + for (s = IR_SEGMENT_FIRST; s <= IR_SEGMENT_LAST; s++) + walk_types_entities(get_segment_type(s), &walk_entity, &my_env); n_types = get_irp_n_types(); for (i = 0; i < n_types; i++) walk_types_entities(get_irp_type(i), &walk_entity, &my_env);