X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgwalk.c;h=5ed8c0153eb519b1b5d7722dd39930fc8338f273;hb=27177e293d914d15fdef3798c1ce1628f83d55ef;hp=fe3685c2e820fd8a4dee3469a7b90857b712a583;hpb=2f01596b117f89869d3cbb611f972ee1ddba4fa5;p=libfirm diff --git a/ir/ir/irgwalk.c b/ir/ir/irgwalk.c index fe3685c2e..5ed8c0153 100644 --- a/ir/ir/irgwalk.c +++ b/ir/ir/irgwalk.c @@ -1,636 +1,519 @@ /* - * Project: libFIRM - * File name: ir/ir/irgwalk.c - * Purpose: - * Author: Boris Boesler - * Modified by: Goetz Lindenmaier - * Created: - * CVS-ID: $Id$ - * Copyright: (c) 1999-2003 Universität Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ /** -* traverse an ir graph -* - execute the pre function before recursion -* - execute the post function after recursion -*/ - - -#ifdef HAVE_CONFIG_H -# include -#endif - -# include - -# include "irnode_t.h" -# include "irgraph.h" /* visited flag */ -# include "irprog.h" -# include "irgwalk.h" -# include "typewalk.h" - -# include "eset.h" -# include "array.h" - -/* walk over an interprocedural graph (callgraph). Visits only graphs in irg_set. */ -static void irg_walk_cg(ir_node * node, int visited, eset * irg_set, - irg_walk_func *pre, irg_walk_func *post, void * env) { - int i; - ir_graph * rem = current_ir_graph; - ir_node * pred; - - assert(node && node->kind==k_ir_node); - if (get_irn_visited(node) >= visited) return; - - set_irn_visited(node, visited); - - 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 (pre) pre(node, env); - - if (is_no_Block(node)) - irg_walk_cg(get_nodes_block(node), visited, irg_set, pre, post, env); - - if (get_irn_op(node) == op_Block) { /* 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) - || eset_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) { - 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) { - 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)); - assert(get_irn_op(exec) == op_CallBegin - || get_irn_op(exec) == op_EndReg - || get_irn_op(exec) == op_EndExcept); - if (eset_contains(irg_set, get_irn_irg(exec))) { - current_ir_graph = get_irn_irg(exec); - irg_walk_cg(pred, visited, irg_set, pre, post, env); - current_ir_graph = rem; - } - } - } - } else { - for (i = get_irn_arity(node) - 1; i >= 0; --i) { - irg_walk_cg(get_irn_n(node, i), visited, irg_set, pre, post, env); - } - } - - if (post) post(node, env); + * @file + * @brief Functions for traversing ir graphs + * @author Boris Boesler, Goetz Lindenmaier, Michael Beck + * @version $Id$ + * @brief + * traverse an ir graph + * - execute the pre function before recursion + * - execute the post function after recursion + */ +#include "config.h" - current_ir_graph = rem; -} +#include +#include "irnode_t.h" +#include "irgraph_t.h" +#include "irprog.h" +#include "irgwalk.h" +#include "irhooks.h" +#include "entity_t.h" -/* Insert all ir_graphs in irg_set, that are (transitive) reachable. */ -static void collect_irgs(ir_node * node, eset * irg_set) { - if (get_irn_op(node) == op_Call) { - int i; - for (i = get_Call_n_callees(node) - 1; i >= 0; --i) { - entity * ent = get_Call_callee(node, i); - ir_graph * irg = ent ? get_entity_irg(ent) : NULL; - if (irg && !eset_contains(irg_set, irg)) { - eset_insert(irg_set, irg); - irg_walk_graph(irg, (irg_walk_func *) collect_irgs, NULL, irg_set); - } - } - } -} +#include "error.h" +#include "pset_new.h" +#include "array.h" -static void -irg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) +/** + * 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) { - int i; - assert(node && node->kind==k_ir_node); - - if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) { - set_irn_visited(node, get_irg_visited(current_ir_graph)); + int i; + unsigned cnt = 1; + ir_graph *irg = get_irn_irg(node); - if (pre) pre(node, env); + set_irn_visited(node, irg->visited); - if (is_no_Block(node)) - irg_walk_2(get_nodes_block(node), pre, post, env); - for (i = get_irn_arity(node) - 1; i >= 0; --i) - irg_walk_2(get_irn_n(node, i), pre, post, env); + pre(node, env); - if (post) post(node, env); - } - return; + if (node->op != op_Block) { + ir_node *pred = get_irn_n(node, -1); + if (pred->visited < irg->visited) + cnt += irg_walk_2_pre(pred, pre, env); + } + for (i = get_irn_arity(node) - 1; i >= 0; --i) { + ir_node *pred = get_irn_n(node, i); + if (pred->visited < irg->visited) + cnt += irg_walk_2_pre(pred, pre, env); + } + return cnt; } - -void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) +/** + * specialized version of irg_walk_2, called if only post callback exists + * + * @return number of visited nodes + */ +static unsigned irg_walk_2_post(ir_node *node, irg_walk_func *post, void *env) { - assert(node && node->kind==k_ir_node); - if (interprocedural_view) { - eset * irg_set = eset_create(); - int visited; - ir_graph * irg; - interprocedural_view = false; - eset_insert(irg_set, current_ir_graph); - irg_walk(node, (irg_walk_func *) collect_irgs, NULL, irg_set); - interprocedural_view = true; - visited = get_max_irg_visited() + 1; - irg_walk_cg(node, visited, irg_set, pre, post, env); - for (irg = eset_first(irg_set); irg; irg = eset_next(irg_set)) { - set_irg_visited(irg, visited); - } - eset_destroy(irg_set); - } else { - inc_irg_visited(current_ir_graph); - irg_walk_2(node, pre, post, env); - } - return; -} - + int i; + unsigned cnt = 1; + ir_graph *irg = get_irn_irg(node); -void irg_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) { - ir_graph * rem = current_ir_graph; - current_ir_graph = irg; - irg_walk(get_irg_end(irg), pre, post, env); - current_ir_graph = rem; -} + set_irn_visited(node, irg->visited); -/* 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) { - int i; - ir_graph *irg, *rem; - - rem = current_ir_graph; - - for (i = 0; i < get_irp_n_irgs(); i++) { - irg = get_irp_irg(i); - current_ir_graph = irg; - irg_walk(get_irg_end(irg), pre, post, env); - } - current_ir_graph = rem; -} - -/***************************************************************************/ + if (node->op != op_Block) { + ir_node *pred = get_irn_n(node, -1); + if (pred->visited < irg->visited) + cnt += irg_walk_2_post(pred, post, env); + } + for (i = get_irn_arity(node) - 1; i >= 0; --i) { + ir_node *pred = get_irn_n(node, i); + if (pred->visited < irg->visited) + cnt += irg_walk_2_post(pred, post, env); + } -/* 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) { - ir_graph *old_current = current_ir_graph; - - if (interprocedural_view) { - /* Only Filter and Block nodes can have predecessors in other graphs. */ - if (get_irn_op(n) == op_Filter) - n = get_nodes_block(n); - if (get_irn_op(n) == op_Block) { - ir_node *cfop = skip_Proj(get_Block_cfgpred(n, index)); - if (is_ip_cfop(cfop)) { - current_ir_graph = get_irn_irg(cfop); - } - } - } + post(node, env); - return old_current; + return cnt; } -static void -cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) +/** + * specialized version of irg_walk_2, called if pre and post callbacks exist + * + * @return number of visited nodes + */ +static unsigned irg_walk_2_both(ir_node *node, irg_walk_func *pre, + irg_walk_func *post, void *env) { - int i; - ir_graph *rem = NULL; - assert(node); - - if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) { - set_irn_visited(node, get_irg_visited(current_ir_graph)); - - if (pre) pre(node, env); - - if (is_no_Block(node)) - cg_walk_2(get_nodes_block(node), pre, post, env); - for (i = get_irn_arity(node) - 1; i >= 0; --i) { - rem = switch_irg(node, i); - cg_walk_2(get_irn_n(node, i), pre, post, env); - current_ir_graph = rem; - } + int i; + unsigned cnt = 1; + ir_graph *irg = get_irn_irg(node); - 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) { - int i; - ir_graph *rem = current_ir_graph; - int rem_view = interprocedural_view; - - interprocedural_view = true; - - inc_max_irg_visited(); - /* Fix all irg_visited flags */ - for (i = 0; i < get_irp_n_irgs(); i++) - set_irg_visited(get_irp_irg(i), get_max_irg_visited()); + set_irn_visited(node, irg->visited); - /* Walk starting at unreachable procedures. */ - for (i = 0; i < get_irp_n_irgs(); i++) { - ir_node *sb; - current_ir_graph = get_irp_irg(i); + pre(node, env); - 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; + if (node->op != op_Block) { + ir_node *pred = get_irn_n(node, -1); + if (pred->visited < irg->visited) + cnt += irg_walk_2_both(pred, pre, post, env); + } + for (i = get_irn_arity(node) - 1; i >= 0; --i) { + ir_node *pred = get_irn_n(node, i); + if (pred->visited < irg->visited) + cnt += irg_walk_2_both(pred, pre, post, env); + } - cg_walk_2(get_irg_end(current_ir_graph), pre, post, env); - } + post(node, env); - interprocedural_view = rem_view; - current_ir_graph = rem; + return cnt; } +/** + * Intraprozedural graph walker. + * + * @return number of visited nodes + */ +unsigned irg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, + void *env) +{ + if (irn_visited(node)) + return 0; -/***************************************************************************/ - -/* Walks back from n until it finds a real cf op. */ -static ir_node *get_cf_op(ir_node *n) { - ir_node *pred; + if (!post) return irg_walk_2_pre (node, pre, env); + else if (!pre) return irg_walk_2_post(node, post, env); + else return irg_walk_2_both(node, pre, post, env); +} - n = skip_nop(n); - n = skip_Tuple(n); - pred = skip_Proj(n); - if (!(is_cfop(pred) || is_fragile_op(pred) || - (get_irn_op(pred) == op_Bad))) - n = get_cf_op(n); +/* a counter */ +static unsigned nodes_touched = 0; - return skip_Proj(n); +void irg_walk_core(ir_node *node, irg_walk_func *pre, irg_walk_func *post, + void *env) +{ + assert(is_ir_node(node)); + nodes_touched = irg_walk_2(node, pre, post, env); } -static void irg_block_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) +void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, + void *env) { - int i; - assert(get_irn_opcode(node) == iro_Block); - - if(get_Block_block_visited(node) < get_irg_block_visited(current_ir_graph)) { - set_Block_block_visited(node, get_irg_block_visited(current_ir_graph)); - - if(pre) pre(node, env); - - 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) { - /* recursion */ - irg_block_walk_2(pred, pre, post, env); - } - else { - assert(get_irn_opcode(pred) == iro_Bad); - } - } - - if(post) post(node, env); - } - return; + ir_graph *irg = get_irn_irg(node); + ir_graph *rem = current_ir_graph; + + current_ir_graph = irg; + ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED); + inc_irg_visited(irg); + irg_walk_core(node, pre, post, env); + ir_free_resources(irg, IR_RESOURCE_IRN_VISITED); + current_ir_graph = rem; } - -/* walks only over Block nodes in the graph. Has it's own visited - 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) +/* + * walk over a graph + */ +void irg_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) { - ir_node *block, *pred; - int i; - - assert(node); - assert(!interprocedural_view); /* interprocedural_view not implemented, because it - * interleaves with irg_walk */ - inc_irg_block_visited(current_ir_graph); - if (is_no_Block(node)) block = get_nodes_block(node); else block = node; - assert(get_irn_opcode(block) == iro_Block); - irg_block_walk_2(block, pre, post, env); - /* keepalive: the endless loops ... */ - if (get_irn_op(node) == op_End) - for (i = 0; i < get_irn_arity(node); i++) { - pred = get_irn_n(node, i); - if (get_irn_op(pred) == op_Block) - irg_block_walk_2(pred, pre, post, env); - } + ir_graph * rem = current_ir_graph; - return; + hook_irg_walk(irg, (generic_func *)pre, (generic_func *)post); + current_ir_graph = irg; + irg_walk(get_irg_end(irg), pre, post, env); + irg->estimated_node_count = nodes_touched; + current_ir_graph = rem; } +/* 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) +{ + size_t i, n; + ir_graph *irg; -void irg_block_walk_graph(ir_graph *irg, irg_walk_func *pre, - 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); - current_ir_graph = rem; + for (i = 0, n = get_irp_n_irgs(); i < n; i++) { + irg = get_irp_irg(i); + irg_walk_graph(irg, pre, post, env); + } } -/********************************************************************/ - -typedef struct walk_env { - irg_walk_func *pre; - irg_walk_func *post; - void *env; -} walk_env; +/***************************************************************************/ -/* Walk to all constant expressions in this entity. */ -static void walk_entity(entity *ent, void *env) +/** + * specialized version of irg_walk_in_or_dep_2, called if only pre callback exists + * + * @return number of visited nodes + */ +static unsigned irg_walk_in_or_dep_2_pre(ir_node *node, irg_walk_func *pre, 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 = get_compound_ent_n_values(ent); + int i; + unsigned cnt = 1; + ir_graph *irg = get_irn_irg(node); - for (i = 0; i < n; i++) - irg_walk(get_compound_ent_value(ent, i), my_env->pre, my_env->post, my_env->env); - } - } -} + set_irn_visited(node, irg->visited); -/* Walks over all code in const_code_irg. */ -void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) { - int i, j; - walk_env my_env; - - ir_graph *rem = current_ir_graph; - current_ir_graph = get_const_code_irg(); - inc_irg_visited(current_ir_graph); - - my_env.pre = pre; - my_env.post = post; - my_env.env = env; - - /* Walk all types that can contain constant entities. */ - walk_types_entities(get_glob_type(), &walk_entity, &my_env); - for (i = 0; i < get_irp_n_types(); i++) - walk_types_entities(get_irp_type(i), &walk_entity, &my_env); - for (i = 0; i < get_irp_n_irgs(); i++) - walk_types_entities(get_irg_frame_type(get_irp_irg(i)), &walk_entity, &my_env); - - /* Walk constant array bounds. */ - for (i = 0; i < get_irp_n_types(); i++) { - type *tp = get_irp_type(i); - if (is_array_type(tp)) { - for (j = 0; j < get_array_n_dimensions(tp); j++) { - ir_node *n; - n = get_array_lower_bound(tp, j); - if (n) irg_walk(n, pre, post, env); - n = get_array_upper_bound(tp, j); - if (n) irg_walk(n, pre, post, env); - } - } - } + pre(node, env); - current_ir_graph = rem; + if (node->op != op_Block) { + ir_node *pred = get_irn_n(node, -1); + if (pred->visited < irg->visited) + cnt += irg_walk_in_or_dep_2_pre(pred, pre, env); + } + for (i = get_irn_ins_or_deps(node) - 1; i >= 0; --i) { + ir_node *pred = get_irn_in_or_dep(node, i); + if (pred->visited < irg->visited) + cnt += irg_walk_in_or_dep_2_pre(pred, pre, env); + } + return cnt; } +/** + * specialized version of irg_walk_in_or_dep_2, called if only post callback exists + * + * @return number of visited nodes + */ +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 = get_irn_irg(node); -/********************************************************************/ -/** Walking support for interprocedural analysis **/ -/** **/ -/** @@@ Don't use, not operational yet, doesn't grok recursions!! **/ -/** @@@ Header for irgwalk.h, here until it works. **/ -/** **/ -/** Interprocedural walking should not walk all predecessors of **/ -/** all nodes. When leaving a procedure the walker should only **/ -/** follow the edge corresponding to the most recent entry of the **/ -/** procedure. The following functions use an internal stack to **/ -/** remember the current call site of a procedure. **/ -/** They also set current_ir_graph correctly. **/ -/** **/ -/** Usage example: **/ -/** **/ -/** void init_ip_walk (); **/ -/** work_on_graph(some_end_node); **/ -/** void finish_ip_walk(); **/ -/** **/ -/** work_on_graph(ir_node *n) { **/ -/** for (i = 0; i < get_irn_arity(n); i++) { **/ -/** if (...) continue; **/ -/** ir_node *m = get_irn_ip_pred(n, i); **/ -/** if !m continue; **/ -/** work_on_graph(m); **/ -/** return_recur(n, i); **/ -/** } **/ -/** } **/ -/********************************************************************/ - -/* Call for i in {0|-1 ... get_irn_arity(n)}. - If n is a conventional node returns the same node as get_irn_n(n, i). - If the predecessors of n are in the callee of the procedure n belongs - to, returns get_irn_n(n, i) if this node is in the callee on the top - of the stack, else returns NULL. - If the predecessors of n are in a procedure called by the procedure n - belongs to pushes the caller on the caller stack in the callee. - Sets current_ir_graph to the graph the node returned is in. */ -ir_node *get_irn_ip_pred(ir_node *n, int pos); + set_irn_visited(node, irg->visited); -/* If get_irn_ip_pred() returned a node (not NULL) this must be - called to clear up the stacks. - Sets current_ir_graph to the graph n is in. */ -void return_recur(ir_node *n, int pos); + if (node->op != op_Block) { + ir_node *pred = get_irn_n(node, -1); + if (pred->visited < irg->visited) + cnt += irg_walk_in_or_dep_2_post(pred, post, env); + } + for (i = get_irn_ins_or_deps(node) - 1; i >= 0; --i) { + ir_node *pred = get_irn_in_or_dep(node, i); + if (pred->visited < irg->visited) + cnt += irg_walk_in_or_dep_2_post(pred, post, env); + } + post(node, env); -/********************************************************************/ -/** Walking support for interprocedural analysis **/ -/********************************************************************/ + return cnt; +} -#define MIN_STACK_SIZE 40 +/** + * specialized version of irg_walk_in_or_dep_2, called if pre and post callbacks exist + * + * @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) +{ + int i; + unsigned cnt = 1; + ir_graph *irg = get_irn_irg(node); -typedef struct callsite_stack { - int tos; - ir_node **s; -} callsite_stack; + set_irn_visited(node, irg->visited); -/* Access the stack in the irg **************************************/ + pre(node, env); -static INLINE void -set_irg_callsite_stack(ir_graph *g, callsite_stack *s) { - set_irg_link(g, s); -} + if (node->op != op_Block) { + ir_node *pred = get_irn_n(node, -1); + if (pred->visited < irg->visited) + cnt += irg_walk_in_or_dep_2_both(pred, pre, post, env); + } + for (i = get_irn_ins_or_deps(node) - 1; i >= 0; --i) { + ir_node *pred = get_irn_in_or_dep(node, i); + if (pred->visited < irg->visited) + cnt += irg_walk_in_or_dep_2_both(pred, pre, post, env); + } -static INLINE callsite_stack * -get_irg_callsite_stack(ir_graph *g) { - return (callsite_stack *) get_irg_link(g); -} + post(node, env); -/* A stack of callsites *********************************************/ - -/* @@@ eventually change the implementation so the new_ only sets the field - to NULL, and the stack is only allocated if used. Saves Memory! */ -static INLINE callsite_stack * -new_callsite_stack(ir_graph *g) { - callsite_stack *res = (callsite_stack *)malloc(sizeof(callsite_stack)); - res->tos = 0; - res->s = NEW_ARR_F (ir_node *, MIN_STACK_SIZE); - set_irg_callsite_stack(g, res); - return(res); + return cnt; } -static INLINE void -free_callsite_stack(ir_graph *g) { - callsite_stack *s = get_irg_callsite_stack(g); - DEL_ARR_F(s->s); - free(s); -} +/** + * Intraprozedural graph walker. Follows dependency edges as well. + * + * @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) +{ + if (irn_visited(node)) + return 0; -static INLINE void -push_callsite(ir_graph *callee, ir_node *callsite) { - callsite_stack *s = get_irg_callsite_stack(callee); - if (s->tos == ARR_LEN(s->s)) { - int nlen = ARR_LEN (s->s) * 2; - ARR_RESIZE (ir_node *, s->s, nlen); - } - s->s[s->tos] = callsite; - s->tos++; + if (! post) return irg_walk_in_or_dep_2_pre (node, pre, env); + else if (! pre) return irg_walk_in_or_dep_2_post(node, post, env); + else return irg_walk_in_or_dep_2_both(node, pre, post, env); } -static INLINE ir_node * -get_top_of_callsite_stack(ir_graph *callee) { - callsite_stack *s = get_irg_callsite_stack(callee); - return (s->s[s->tos-1]); -} +/* + * Generic graph walker. Follows dependency edges as well. + */ +void irg_walk_in_or_dep(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) +{ + assert(is_ir_node(node)); -static INLINE -ir_node * pop_callsite(ir_graph *callee) { - callsite_stack *s = get_irg_callsite_stack(callee); - s->tos--; - return (s->s[s->tos]); + 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); + ir_free_resources(current_ir_graph, IR_RESOURCE_IRN_VISITED); } +/* + * 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) +{ + ir_graph * rem = current_ir_graph; -/* Initialization routines ******************************************/ - -void init_ip_walk (void) { - int i; - for (i = 0; i < get_irp_n_irgs(); i++) - new_callsite_stack(get_irp_irg(i)); + hook_irg_walk(irg, (generic_func *)pre, (generic_func *)post); + current_ir_graph = irg; + irg_walk_in_or_dep(get_irg_end(irg), pre, post, env); + irg->estimated_node_count = nodes_touched; + current_ir_graph = rem; } -void finish_ip_walk(void) { - int i; - for (i = 0; i < get_irp_n_irgs(); i++) - free_callsite_stack(get_irp_irg(i)); - set_irg_link(get_irp_irg(i), NULL); +/***************************************************************************/ + +/* Walks back from n until it finds a real cf op. */ +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; } -/* walker routines **************************************************/ +static void irg_block_walk_2(ir_node *node, irg_walk_func *pre, + irg_walk_func *post, void *env) +{ + int i; + + if (Block_block_visited(node)) + return; + mark_Block_block_visited(node); + + if (pre) + pre(node, env); + + 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) { + /* recursion */ + irg_block_walk_2(pred, pre, post, env); + } else { + assert(get_irn_opcode(pred) == iro_Bad); + } + } -/* cf_pred is End* */ -static INLINE void -enter_procedure(ir_node *block, ir_node *cf_pred, int pos) { - ir_node *callbegin; - ir_graph *irg = get_irn_irg(cf_pred); + if (post) + post(node, env); +} - assert(interprocedural_view); - interprocedural_view = 0; - callbegin = skip_Proj(get_irn_n(block, 0)); - assert(get_irn_op(callbegin) == op_CallBegin); - interprocedural_view = 1; +/* walks only over Block nodes in the graph. Has its own visited + 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 = get_irn_irg(node); + ir_node *block = is_Block(node) ? node : get_nodes_block(node); + + hook_irg_block_walk(irg, node, (generic_func *)pre, (generic_func *)post); + + ir_reserve_resources(irg, IR_RESOURCE_BLOCK_VISITED); + inc_irg_block_visited(irg); + irg_block_walk_2(block, pre, post, env); + + /* Some blocks might be only reachable through keep-alive edges */ + if (is_End(node)) { + int arity = get_irn_arity(node); + int i; + for (i = 0; i < arity; i++) { + ir_node *pred = get_irn_n(node, i); + if (!is_Block(pred)) + continue; + irg_block_walk_2(pred, pre, post, env); + } + } - push_callsite(irg, callbegin); - current_ir_graph = irg; + ir_free_resources(irg, IR_RESOURCE_BLOCK_VISITED); } -/* cf_pred is CallBegin */ -static INLINE bool -leave_procedure(ir_node *block, ir_node *cf_pred, int pos) { - ir_node *tos = get_top_of_callsite_stack(current_ir_graph); - - assert(get_irn_op(cf_pred) == op_CallBegin); - - if (tos == cf_pred) { - /* We entered this procedure by the call pred pos refers to. */ - pop_callsite(current_ir_graph); - current_ir_graph = get_CallBegin_irg(cf_pred); - return true; - } else { - /* We won't walk. */ - return false; - } +/* + * walk over a graph block wise + */ +void irg_block_walk_graph(ir_graph *irg, irg_walk_func *pre, + 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); + current_ir_graph = rem; } -ir_node *get_irn_ip_pred(ir_node *n, int pos) { +/* + * 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) +{ + ir_graph * rem = current_ir_graph; + current_ir_graph = irg; - if (interprocedural_view) { + inc_irg_visited(irg); + irg_walk_2(irg->anchor, pre, post, env); - /* Find the cf_pred refering to pos. */ - ir_node *block = n; - ir_node *cf_pred; - if (get_irn_opcode(n) == iro_Filter) block = get_nodes_block(n); - cf_pred = skip_Proj(get_irn_n(block, pos)); + current_ir_graph = rem; +} - /* Check whether we enter or leave a procedure and act according. */ - if ((get_irn_op(cf_pred) == op_EndReg) || - (get_irn_op(cf_pred) == op_EndExcept)) - enter_procedure(block, cf_pred, pos); - if (get_irn_op(cf_pred) == op_CallBegin) - if (!leave_procedure(block, cf_pred, pos)) return NULL; - } +/********************************************************************/ - return get_irn_n(n, pos); -} +typedef struct walk_env { + irg_walk_func *pre; + irg_walk_func *post; + void *env; +} walk_env; -static INLINE void -re_enter_procedure(ir_node *block, ir_node *cf_pred, int pos) { - ir_node *callbegin = pop_callsite(current_ir_graph); - assert(interprocedural_view); - current_ir_graph = get_CallBegin_irg(callbegin); +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"); } -static INLINE void -re_leave_procedure(ir_node *block, ir_node *cf_pred, int pos) { - ir_node *proj; - ir_graph *callee; +/** + * Walk to all constant expressions in this entity. + */ +static void walk_entity(ir_entity *ent, void *env) +{ + walk_env *my_env = (walk_env *)env; - assert(get_irn_op(cf_pred) == op_CallBegin); + if (ent->initializer != NULL) { + walk_initializer(ent->initializer, my_env); + } else if (entity_has_compound_ent_values(ent)) { + size_t i, n_vals = get_compound_ent_n_values(ent); - /* Find the irg block is in. */ - proj = get_Block_cg_cfgpred(block, pos); - assert(is_Proj(proj)); - callee = get_entity_irg(get_Call_callee(get_CallBegin_call(cf_pred), - get_Proj_proj(proj))); - current_ir_graph = callee; - push_callsite(callee, cf_pred); + for (i = 0; i < n_vals; i++) + irg_walk(get_compound_ent_value(ent, i), my_env->pre, my_env->post, my_env->env); + } } -void -return_recur(ir_node *n, int pos) { - ir_node *block; - ir_node *cf_pred; - - if (!interprocedural_view) return; - - /* Find the cf_pred refering to pos. */ - block = n; - if (get_irn_opcode(n) == iro_Filter) block = get_nodes_block(n); - cf_pred = skip_Proj(get_irn_n(block, pos)); +/* Walks over all code in const_code_irg. */ +void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) +{ + walk_env my_env; + ir_segment_t s; + size_t i; + size_t n_types; + + ir_graph *rem = current_ir_graph; + current_ir_graph = get_const_code_irg(); + inc_irg_visited(current_ir_graph); + + my_env.pre = pre; + my_env.post = post; + my_env.env = env; + + /* Walk all types that can contain constant entities. */ + 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); + for (i = 0; i < get_irp_n_irgs(); i++) + walk_types_entities(get_irg_frame_type(get_irp_irg(i)), &walk_entity, &my_env); + + /* Walk constant array bounds. */ + for (i = 0; i < n_types; i++) { + ir_type *tp = get_irp_type(i); + if (is_Array_type(tp)) { + size_t j, n_dim = get_array_n_dimensions(tp); + for (j = 0; j < n_dim; j++) { + ir_node *n = get_array_lower_bound(tp, j); + if (n) irg_walk(n, pre, post, env); + n = get_array_upper_bound(tp, j); + if (n) irg_walk(n, pre, post, env); + } + } + } - /* Check whether we re_enter or re_leave a procedure and act according. */ - if ((get_irn_op(cf_pred) == op_EndReg) || - (get_irn_op(cf_pred) == op_EndExcept)) - re_enter_procedure(block, cf_pred, pos); - if (get_irn_op(cf_pred) == op_CallBegin) - re_leave_procedure(block, cf_pred, pos); + current_ir_graph = rem; }