/*
- * 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 *pred = _get_walk_irn_n(env, node, i);
ir_node *blk = get_nodes_block(pred);
- if (irn_not_visited(pred)) {
+ if (!irn_visited(pred)) {
collect_walk(pred, env);
/* control flow predecessors are always block inputs */
else {
block = get_nodes_block(node);
- if (irn_not_visited(block))
+ if (!irn_visited(block))
collect_walk(block, env);
is_phi = is_Phi(node);
for (i = _get_walk_arity(env, node) - 1; i >= 0; --i) {
ir_node *pred = _get_walk_irn_n(env, node, i);
- if (irn_not_visited(pred)) {
+ if (!irn_visited(pred)) {
collect_walk(pred, env);
/* BEWARE: predecessors of End nodes might be blocks */
if (is_no_Block(pred)) {
ir_node *blk = get_nodes_block(pred);
- if (irn_not_visited(pred)) {
+ if (!irn_visited(pred)) {
if (block != blk)
continue;
collect_blks_lists(pred, block, entry, env);
blks.follow_deps = follow_deps != 0;
/* first step: traverse the graph and fill the lists */
- set_using_visited(irg);
+ ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
inc_irg_visited(irg);
collect_walk(end_node, &blks);
#ifdef INTERPROCEDURAL_VIEW
set_interprocedural_view(old_view);
#endif
- clear_using_visited(irg);
+ ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
}
void irg_walk_blkwise_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)