+ if (post) post(node, env);
+
+ current_ir_graph = rem;
+}
+
+
+/* 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);
+ }
+ }
+ }
+}
+
+/**
+ * specialized version of irg_walk_2, called if only pre callback exists
+ */
+static void
+irg_walk_2_pre(ir_node *node, irg_walk_func *pre, void * env) {
+ int i;
+ set_irn_visited(node, current_ir_graph->visited);
+
+ pre(node, env);
+
+ if (node->op != op_Block) {
+ ir_node *pred = get_irn_n(node, -1);
+ if (pred->visited < current_ir_graph->visited)
+ 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 < current_ir_graph->visited)
+ irg_walk_2_pre(pred, pre, env);
+ }
+}
+
+/**
+ * specialized version of irg_walk_2, called if only post callback exists
+ */
+static void
+irg_walk_2_post(ir_node *node, irg_walk_func *post, void * env) {
+ int i;
+ set_irn_visited(node, current_ir_graph->visited);
+
+ if (node->op != op_Block) {
+ ir_node *pred = get_irn_n(node, -1);
+ if (pred->visited < current_ir_graph->visited)
+ 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 < current_ir_graph->visited)
+ irg_walk_2_post(pred, post, env);
+ }
+
+ post(node, env);
+}
+
+/**
+ * specialized version of irg_walk_2, called if pre and post callbacks exist
+ */
+static void
+irg_walk_2_both(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) {
+ int i;
+ set_irn_visited(node, current_ir_graph->visited);
+
+ pre(node, env);
+
+ if (node->op != op_Block) {
+ ir_node *pred = get_irn_n(node, -1);
+ if (pred->visited < current_ir_graph->visited)
+ 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 < current_ir_graph->visited)
+ irg_walk_2_both(pred, pre, post, env);
+ }
+
+ post(node, env);
+}
+
+/**
+ * Intraprozedural graph walker.
+ */
+static void
+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) irg_walk_2_pre (node, pre, env);
+ else if (!pre) irg_walk_2_post(node, post, env);
+ else irg_walk_2_both(node, pre, post, env);
+ }
+}
+
+/*
+ * generic graph walker
+ */
+void irg_walk(ir_node *node, irg_walk_func *pre, 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;
+ assert(get_irp_ip_view_state() == ip_view_valid);
+
+ 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;
+ 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);