-/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
-** All rights reserved.
-**
-** Author: Boris Boesler
-**
-** traverse an ir graph
-** - execute the pre function before recursion
-** - execute the post function after recursion
-*/
-
-/* $Id$ */
+/*
+ * Project: libFIRM
+ * File name: ir/ir/irgwalk.c
+ * Purpose:
+ * Author: Boris Boesler
+ * Modified by: Goetz Lindenmaier, Michael Beck
+ * Created:
+ * CVS-ID: $Id$
+ * Copyright: (c) 1999-20036Universität Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ */
+
+/**
+ * @file irgwalk.c
+ *
+ * traverse an ir graph
+ * - execute the pre function before recursion
+ * - execute the post function after recursion
+ */
+
#ifdef HAVE_CONFIG_H
-# include <config.h>
+# include "config.h"
#endif
-# include "irnode.h"
-# include "irgraph.h" /* visited flag */
-# include "irprog.h"
-# include "irgwalk.h"
-
-# include "eset.h"
-# include "array.h"
+#ifdef HAVE_STDLIB_H
+# include <stdlib.h>
+#endif
-/* 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) {
+#include "irnode_t.h"
+#include "irgraph_t.h" /* visited flag */
+#include "irprog.h"
+#include "irgwalk.h"
+#include "typewalk.h"
+#include "irhooks.h"
+#include "ircgcons.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, unsigned long 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);
+ assert(node && node->kind == k_ir_node);
if (get_irn_visited(node) >= visited) return;
set_irn_visited(node, visited);
+ if (pre) pre(node, env);
+
pred = skip_Proj(node);
if (get_irn_op(pred) == op_CallBegin
|| get_irn_op(pred) == op_EndReg
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 (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 */
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);
+ && 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) {
+ } else if (get_irn_op(node) == op_Filter) { /* 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);
+ 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;
- }
+ ir_node * exec;
+ exec = skip_Proj(get_Block_cfgpred(get_nodes_block(node), i));
+
+ if (op_Bad == get_irn_op (exec)) {
+ continue;
+ }
+
+ 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 {
+ } else { /* everything 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);
}
}
-/* Insert all ir_graphs in irg_set, that are (transitive) reachable. */
+/**
+ * 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) {
+ if (is_Call(node)) {
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;
+ ir_graph * irg = get_entity_irg(ent);
if (irg && !eset_contains(irg_set, irg)) {
- eset_insert(irg_set, irg);
- irg_walk_graph(irg, (irg_walk_func) collect_irgs, NULL, irg_set);
+ eset_insert(irg_set, irg);
+ irg_walk_graph(irg, (irg_walk_func *) collect_irgs, NULL, irg_set);
}
}
}
}
+/**
+ * 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;
+ unsigned cnt = 1;
+ ir_graph *irg = current_ir_graph;
-void irg_walk_2(ir_node *node, irg_walk_func pre, irg_walk_func post, void * env)
-{
+ set_irn_visited(node, irg->visited);
+
+ pre(node, env);
+
+ 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;
+}
+
+/**
+ * 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) {
int i;
+ unsigned cnt = 1;
+ ir_graph *irg = current_ir_graph;
+ set_irn_visited(node, irg->visited);
- assert(node);
- /* printf(" - "); DDMSG2(node); */
+ 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);
+ }
- if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) {
+ post(node, env);
-/* printf(" -> "); DDMSG2(node); */
- set_irn_visited(node, get_irg_visited(current_ir_graph));
+ return cnt;
+}
- if (pre) {
- pre(node, 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;
+ unsigned cnt = 1;
+ ir_graph *irg = current_ir_graph;
- 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) {
- /* printf(" "); DDMSG2(node);
- printf(" "); DDMSG2(get_irn_n(node, i)); */
+ set_irn_visited(node, irg->visited);
- irg_walk_2(get_irn_n(node, i), pre, post, env);
- }
+ pre(node, env);
-/* printf(" <- "); DDMSG2(node); */
- if (post)
- post(node, env);
+ 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);
}
- return;
+ 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);
+ }
+
+ post(node, env);
+
+ return cnt;
}
+/**
+ * Intraprozedural graph walker.
+ *
+ * @return number of visited nodes
+ */
+static 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);
+ else if (!pre) return irg_walk_2_post(node, post, env);
+ else return irg_walk_2_both(node, pre, post, env);
+ }
+ return 0;
+}
-void irg_walk(ir_node *node, irg_walk_func pre, irg_walk_func post, void *env)
+/* a counter */
+static unsigned nodes_touched = 0;
+
+/*
+ * generic graph walker
+ */
+void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
{
- assert(node);
- if (interprocedural_view) {
+ assert(is_ir_node(node));
+
+ if (get_interprocedural_view()) {
eset * irg_set = eset_create();
- int visited;
+ unsigned long visited;
ir_graph * irg;
- interprocedural_view = false;
+ assert(get_irp_ip_view_state() == ip_view_valid);
+
+ set_interprocedural_view(0);
eset_insert(irg_set, current_ir_graph);
- irg_walk(node, (irg_walk_func) collect_irgs, NULL, irg_set);
- interprocedural_view = true;
+ irg_walk(node, (irg_walk_func *) collect_irgs, NULL, irg_set);
+ set_interprocedural_view(1);
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);
}
+ irg_walk_cg(node, visited, irg_set, pre, post, env);
eset_destroy(irg_set);
} else {
inc_irg_visited(current_ir_graph);
- irg_walk_2(node, pre, post, env);
+ nodes_touched = irg_walk_2(node, pre, post, env);
}
return;
}
-
-void irg_walk_graph(ir_graph *irg, 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_graph * rem = current_ir_graph;
+
+ 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) {
+void all_irg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) {
int i;
ir_graph *irg, *rem;
/***************************************************************************/
-/* Walks back from n until it finds a real cf op. */
-ir_node *get_cf_op(ir_node *n) {
- ir_node *pred;
+/**
+ * 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) {
+ int i;
+ unsigned cnt = 1;
+ ir_graph *irg = current_ir_graph;
- 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);
+ set_irn_visited(node, irg->visited);
- return skip_Proj(n);
+ pre(node, env);
+
+ 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;
}
-void irg_block_walk_2(ir_node *node, irg_walk_func pre, irg_walk_func post, void *env)
-{
+/**
+ * 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 = current_ir_graph;
- assert(get_irn_opcode(node) == iro_Block);
+ set_irn_visited(node, irg->visited);
- 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 (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);
+ }
- if(pre)
- pre(node, env);
+ post(node, env);
- for(i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
+ return cnt;
+}
- /* find the corresponding predecessor block. */
- ir_node *pred = get_cf_op(get_Block_cfgpred(node, i));
- /* GL: I'm not sure whether this assert must go through. There
- could be Id chains?? Tuple/Proj .... */
+/**
+ * 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 = current_ir_graph;
- assert(is_cfop(pred)
- || is_fragile_op(pred)
- || (get_irn_op(pred) == op_Bad));
+ set_irn_visited(node, irg->visited);
- 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);
- }
- }
+ pre(node, env);
- if(post)
- post(node, env);
+ 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);
}
- return;
-}
+ post(node, env);
-/* 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)
+ return cnt;
+}
+
+/**
+ * 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)
{
- ir_node *block, *pred;
- int i;
+ if (node->visited < current_ir_graph->visited) {
+ 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);
+ }
+ return 0;
+}
- 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);
- }
+/*
+ * 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));
+ if (get_interprocedural_view()) {
+ assert(0 && "This is not yet implemented.");
+ } else {
+ inc_irg_visited(current_ir_graph);
+ nodes_touched = irg_walk_in_or_dep_2(node, pre, post, env);
+ }
return;
}
-
-void irg_block_walk_graph(ir_graph *irg, irg_walk_func pre, irg_walk_func post, void *env) {
+/*
+ * 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;
+
+ hook_irg_walk(irg, (generic_func *)pre, (generic_func *)post);
current_ir_graph = irg;
- irg_block_walk(get_irg_end(irg), pre, post, env);
+ irg_walk_in_or_dep(get_irg_end(irg), pre, post, env);
+ irg->estimated_node_count = nodes_touched;
current_ir_graph = rem;
}
+/***************************************************************************/
+/**
+ * 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 (get_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);
+ }
+ }
+ }
-/********************************************************************/
-/** Walking support for interprocedural analysis **/
-/********************************************************************/
+ return old_current;
+}
-#define MIN_STACK_SIZE 40
+static void
+cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
+{
+ int i;
+ ir_graph *rem = NULL;
+ assert(node);
-typedef struct callsite_stack {
- int tos;
- ir_node **s;
-} callsite_stack;
+ if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) {
+ set_irn_visited(node, get_irg_visited(current_ir_graph));
-/* Access the stack in the irg **************************************/
+ if (pre) pre(node, env);
-static INLINE void
-set_irg_callsite_stack(ir_graph *g, callsite_stack *s) {
- set_irg_link(g, s);
-}
+ 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); /* @@@ AS: Is this wrong? We do have to
+ switch to the irg of the predecessor, don't we? */
+ cg_walk_2(get_irn_n(node, i), pre, post, env);
+ current_ir_graph = rem;
+ }
-static INLINE callsite_stack *
-get_irg_callsite_stack(ir_graph *g) {
- return (callsite_stack *) get_irg_link(g);
+ if (post) post(node, env);
+ }
+ return;
}
-/* 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);
-}
+/* 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 = get_interprocedural_view();
-static INLINE void
-free_callsite_stack(ir_graph *g) {
- callsite_stack *s = get_irg_callsite_stack(g);
- DEL_ARR_F(s->s);
- free(s);
-}
+ set_interprocedural_view(1);
-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++;
-}
+ 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());
-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]);
-}
+ /* 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);
-static INLINE
-ir_node * pop_callsite(ir_graph *callee) {
- callsite_stack *s = get_irg_callsite_stack(callee);
- s->tos--;
- return (s->s[s->tos]);
-}
+ 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;
-/* Initialization routines ******************************************/
+ cg_walk_2(get_irg_end(current_ir_graph), pre, post, env);
+ }
-void init_ip_walk () {
- int i;
- for (i = 0; i < get_irp_n_irgs(); i++)
- new_callsite_stack(get_irp_irg(i));
-}
+ /* 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)) {
+ cg_walk_2(sb, pre, post, env);
+ }
+ }
-void finish_ip_walk() {
- 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);
+ /* 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++)
+ cg_walk_2(get_End_keepalive(e, j), pre, post, env);
+ }
+ }
+
+ set_interprocedural_view(rem_view);
+ current_ir_graph = rem;
}
-/* walker routines **************************************************/
-/* 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);
+/***************************************************************************/
- assert(interprocedural_view);
+/* Walks back from n until it finds a real cf op. */
+static ir_node *get_cf_op(ir_node *n) {
+ ir_node *pred;
- interprocedural_view = 0;
- callbegin = skip_Proj(get_irn_n(block, 0));
- assert(get_irn_op(callbegin) == op_CallBegin);
- interprocedural_view = 1;
+ 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);
- push_callsite(irg, callbegin);
- current_ir_graph = irg;
+ return skip_Proj(n);
}
-/* 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);
+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)) {
+ mark_Block_block_visited(node);
- assert(get_irn_op(cf_pred) == op_CallBegin);
+ if(pre) pre(node, env);
- 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;
+ 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_node *get_irn_ip_pred(ir_node *n, int pos) {
- if (interprocedural_view) {
+/* 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)
+{
+ ir_node *block, *pred;
+ int i;
- /* 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));
+ hook_irg_block_walk(current_ir_graph, node, (generic_func *)pre, (generic_func *)post);
- /* 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;
+ assert(node);
+ assert(!get_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_op(block) == op_Block);
+ irg_block_walk_2(block, pre, post, env);
+
+ /* keepalive: the endless loops ... */
+ if (get_irn_op(node) == op_End) {
+ 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);
+ }
+ }
}
- return get_irn_n(n, pos);
+ return;
+}
+
+/*
+ * 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;
}
-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);
+/*
+ * 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) {
+ int i;
+ ir_graph * rem = current_ir_graph;
+ current_ir_graph = irg;
+
+ for (i = 0; i < anchor_max; ++i) {
+ ir_node *anchor = irg->anchors[i];
+
+ irg_walk_2(anchor, pre, post, env);
+ }
+ current_ir_graph = rem;
}
-static INLINE void
-re_leave_procedure(ir_node *block, ir_node *cf_pred, int pos) {
- ir_node *proj;
- ir_graph *callee;
+/********************************************************************/
- assert(get_irn_op(cf_pred) == op_CallBegin);
+typedef struct walk_env {
+ irg_walk_func *pre;
+ irg_walk_func *post;
+ void *env;
+} walk_env;
- /* 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);
+/**
+ * Walk to all constant expressions in this entity.
+ */
+static void walk_entity(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);
+
+ 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;
+/* 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;
- if (!interprocedural_view) return;
+ ir_graph *rem = current_ir_graph;
+ current_ir_graph = get_const_code_irg();
+ inc_irg_visited(current_ir_graph);
- /* 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));
+ my_env.pre = pre;
+ my_env.post = post;
+ my_env.env = 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);
+ /* 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++) {
+ ir_type *tp = get_irp_type(i);
+ if (is_Array_type(tp)) {
+ for (j = 0; j < get_array_n_dimensions(tp); 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);
+ }
+ }
+ }
+
+ current_ir_graph = rem;
}
projects / libfirm / blobdiff