/*
- * 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.
*
ir_node *end_node = get_irg_end(irg);
ir_node *end_blk = get_irg_end_block(irg);
blk_collect_data_t blks;
- int old_view = get_interprocedural_view();
block_entry_t *entry;
+#ifdef INTERPROCEDURAL_VIEW
/* switch off interprocedural view */
+ int old_view = get_interprocedural_view();
set_interprocedural_view(0);
+#endif
obstack_init(&blks.obst);
blks.blk_map = new_pset(addr_cmp, 1);
blks.follow_deps = follow_deps != 0;
/* first step: traverse the graph and fill the lists */
- set_using_visited(irg);
+ set_using_irn_visited(irg);
inc_irg_visited(irg);
collect_walk(end_node, &blks);
del_pset(blks.blk_map);
obstack_free(&blks.obst, NULL);
+#ifdef INTERPROCEDURAL_VIEW
set_interprocedural_view(old_view);
- clear_using_visited(irg);
+#endif
+ clear_using_irn_visited(irg);
}
void irg_walk_blkwise_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)