+/*
+ * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
/*
* Project: libFIRM
* File name: ir/ir/irgwalk_blk.c
* Created:
* CVS-ID: $Id$
* Copyright: (c) 1999-2004 Universität Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#include "pset.h"
#include "irhooks.h"
#include "array.h"
+#include "hashptr.h"
+
+#define _get_walk_arity(env, node) \
+ ((env)->follow_deps ? get_irn_ins_or_deps((node)) : get_irn_arity((node)))
+#define _get_walk_irn_n(env, node, pos) \
+ ((env)->follow_deps ? get_irn_in_or_dep((node), (pos)) : get_irn_n((node), (pos)))
/**
* Metadata for block walker
*/
typedef struct _blk_collect_data_t {
- struct obstack obst; /**< obstack to allocate objects on */
- pset *blk_map; /**< Hash map: Block -> List */
- ir_node **blk_list; /**< the Block list */
+ struct obstack obst; /**< obstack to allocate objects on */
+ pset *blk_map; /**< Hash map: Block -> List */
+ ir_node **blk_list; /**< the Block list */
+ unsigned follow_deps : 1; /**< follow dependency edges */
} blk_collect_data_t;
/**
return e1->block != e2->block;
}
-/**
- * calculates a hash value for an block address
- * Addresses are typically aligned at 32bit, so we ignore the lowest bits
- */
-static INLINE unsigned block_hash(const ir_node *node) {
- return (unsigned)node >> 3;
-}
-
/**
* Returns the associates block_entry_t for an block
*/
block_entry_t *elem;
key.block = block;
- elem = pset_find(ctx->blk_map, &key, block_hash(block));
+ elem = pset_find(ctx->blk_map, &key, HASH_PTR(block));
if (elem)
return elem;
elem->cf_list = NEW_ARR_F(ir_node *, 0);
elem->entry_list = NEW_ARR_F(ir_node *, 0);
- return pset_insert(ctx->blk_map, elem, block_hash(block));
+ return pset_insert(ctx->blk_map, elem, HASH_PTR(block));
}
/**
block_entry_t *entry;
ir_node *block;
- set_irn_visited(node, current_ir_graph->visited);
+ mark_irn_visited(node);
if (node->op == op_Block) {
/* predecessors of a block are control flow nodes */
- for (i = get_irn_arity(node) - 1; i >= 0; --i) {
- ir_node *pred = get_irn_n(node, i);
+ for (i = _get_walk_arity(env, node) - 1; i >= 0; --i) {
+ ir_node *pred = _get_walk_irn_n(env, node, i);
ir_node *blk = get_nodes_block(pred);
- if (pred->visited < current_ir_graph->visited) {
+ if (irn_not_visited(pred)) {
collect_walk(pred, env);
/* control flow predecessors are always block inputs */
else {
block = get_nodes_block(node);
- if (block->visited < current_ir_graph->visited)
+ if (irn_not_visited(block))
collect_walk(block, env);
is_phi = is_Phi(node);
- for (i = get_irn_arity(node) - 1; i >= 0; --i) {
- ir_node *pred = get_irn_n(node, i);
- ir_node *blk = get_nodes_block(pred);
+ for (i = _get_walk_arity(env, node) - 1; i >= 0; --i) {
+ ir_node *pred = _get_walk_irn_n(env, node, i);
- if (pred->visited < current_ir_graph->visited) {
+ if (irn_not_visited(pred)) {
collect_walk(pred, env);
- /*
- * Note that Phi predecessors are always block entries
- * because Phi edges are always "outside" a block
- */
- if (block != blk || is_phi) {
- entry = block_find_entry(blk, env);
- ARR_APP1(ir_node *, entry->entry_list, pred);
+ /* BEWARE: predecessors of End nodes might be blocks */
+ if (is_no_Block(pred)) {
+ ir_node *blk = get_nodes_block(pred);
+
+ /*
+ * Note that Phi predecessors are always block entries
+ * because Phi edges are always "outside" a block
+ */
+ if (block != blk || is_phi) {
+ entry = block_find_entry(blk, env);
+ ARR_APP1(ir_node *, entry->entry_list, pred);
+ }
}
}
}
{
int i;
- set_irn_visited(node, current_ir_graph->visited);
+ mark_irn_visited(node);
/*
* Do not descent into Phi predecessors, these are always
* "outside".
*/
if (! is_Phi(node)) {
- for (i = get_irn_arity(node) - 1; i >= 0; --i) {
- ir_node *pred = get_irn_n(node, i);
- ir_node *blk = get_nodes_block(pred);
+ for (i = _get_walk_arity(env, node) - 1; i >= 0; --i) {
+ ir_node *pred = _get_walk_irn_n(env, node, i);
- if (pred->visited < current_ir_graph->visited) {
- if (block != blk)
- continue;
- collect_blks_lists(pred, block, entry, 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 (block != blk)
+ continue;
+ collect_blks_lists(pred, block, entry, env);
+ }
}
}
}
* Intraprozedural graph walker over blocks.
*/
static void
-do_irg_walk_blk(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
+do_irg_walk_blk(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env, unsigned follow_deps)
{
ir_node *end_node = get_irg_end(irg);
ir_node *end_blk = get_irg_end_block(irg);
block_entry_t *entry;
/* switch off interprocedural view */
- set_interprocedural_view(false);
+ set_interprocedural_view(0);
obstack_init(&blks.obst);
- blks.blk_map = new_pset(addr_cmp, 1);
- blks.blk_list = NEW_ARR_F(ir_node *, 0);
+ blks.blk_map = new_pset(addr_cmp, 1);
+ blks.blk_list = NEW_ARR_F(ir_node *, 0);
+ blks.follow_deps = follow_deps != 0;
/* first step: traverse the graph and fill the lists */
+ set_using_visited(irg);
inc_irg_visited(irg);
collect_walk(end_node, &blks);
obstack_free(&blks.obst, NULL);
set_interprocedural_view(old_view);
+ clear_using_visited(irg);
}
void irg_walk_blkwise_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
{
ir_graph * rem = current_ir_graph;
- hook_irg_walk_blkwise(irg, (void *)pre, (void *)post);
+ hook_irg_walk_blkwise(irg, (generic_func *)pre, (generic_func *)post);
+ current_ir_graph = irg;
+ do_irg_walk_blk(irg, pre, post, env, 0);
+ current_ir_graph = rem;
+}
+
+
+void irg_walk_in_or_dep_blkwise_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
+{
+ ir_graph * rem = current_ir_graph;
+
+ hook_irg_walk_blkwise(irg, (generic_func *)pre, (generic_func *)post);
current_ir_graph = irg;
- do_irg_walk_blk(irg, pre, post, env);
+ do_irg_walk_blk(irg, pre, post, env, 1);
current_ir_graph = rem;
}
projects / libfirm / blobdiff