+ set_irn_visited(node, visited);
+
+ if (pre) pre(node, env);
+
+ pred = skip_Proj(node);
+ 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 (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 ((
+ !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 (is_Filter(node)) { /* filter */
+ for (i = get_irn_arity(node) - 1; i >= 0; --i) {
+ ir_node * pred = get_irn_n(node, i);
+ 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 (is_Bad(exec)) {
+ continue;
+ }
+
+ 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);
+ current_ir_graph = rem;
+ }
+ }
+ }
+ } 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);
+ }
+ }
+
+ if (post) post(node, env);
+
+ current_ir_graph = rem;
+}
+#endif
+
+/**
+ * Insert all ir_graphs in irg_set, that are (transitive) reachable.
+ */
+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) {
+ ir_entity * ent = get_Call_callee(node, i);
+ ir_graph * irg = get_entity_irg(ent);
+ if (irg && !pset_new_contains(irg_set, irg)) {
+ pset_new_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;
+
+ 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);
+
+ 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);
+ }
+
+ post(node, env);
+
+ return cnt;
+}
+
+/**
+ * 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;
+
+ 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_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);
+ }
+
+ 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;
+}
+
+/* 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(is_ir_node(node));
+
+#ifdef INTERPROCEDURAL_VIEW
+ if (get_interprocedural_view()) {
+ pset_new_t irg_set;
+ pset_new_iterator_t iter;
+ ir_visited_t visited;
+ ir_graph *irg;
+ assert(get_irp_ip_view_state() == ip_view_valid);
+
+ pset_new_init(&irg_set);
+ set_interprocedural_view(0);
+ pset_new_insert(&irg_set, current_ir_graph);
+ irg_walk(node, (irg_walk_func *) collect_irgs, NULL, &irg_set);
+ set_interprocedural_view(1);
+ visited = get_max_irg_visited() + 1;
+
+ foreach_pset_new(&irg_set, irg, iter) {
+ set_irg_visited(irg, visited);
+ }
+ irg_walk_cg(node, visited, &irg_set, pre, post, env);
+ pset_new_destroy(&irg_set);
+ } else {
+#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);
+ ir_free_resources(current_ir_graph, IR_RESOURCE_IRN_VISITED);
+#ifdef INTERPROCEDURAL_VIEW
+ }
+#endif
+}
+
+/*
+ * 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) {
+ int i, n;
+ ir_graph *irg;
+
+ for (i = 0, n = get_irp_n_irgs(); i < n; i++) {
+ irg = get_irp_irg(i);
+ irg_walk_graph(irg, pre, post, 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) {
+ int i;
+ unsigned cnt = 1;
+ ir_graph *irg = current_ir_graph;
+
+ 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_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 = current_ir_graph;
+
+ set_irn_visited(node, irg->visited);
+
+ 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);
+
+ return cnt;
+}