/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
* @file
* @brief Blockwise walker implementation
* @author Michael Beck
- * @version $Id$
*/
#include "config.h"
#include "irhooks.h"
#include "array.h"
#include "hashptr.h"
+#include "ircons.h"
#define _get_walk_arity(env, node) \
((env)->follow_deps ? get_irn_ins_or_deps((node)) : get_irn_arity((node)))
*/
static int addr_cmp(const void *elt, const void *key)
{
- const block_entry_t *e1 = elt;
- const block_entry_t *e2 = key;
+ const block_entry_t *e1 = (const block_entry_t*)elt;
+ const block_entry_t *e2 = (const block_entry_t*)key;
return e1->block != e2->block;
}
block_entry_t *elem;
key.block = block;
- elem = pset_find(ctx->blk_map, &key, HASH_PTR(block));
+ elem = (block_entry_t*)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, HASH_PTR(block));
+ return (block_entry_t*)pset_insert(ctx->blk_map, elem, hash_ptr(block));
}
/**
*/
static void traverse_block_pre(ir_node *block, block_entry_t *entry, irg_walk_func *pre, void *env)
{
- int j;
+ size_t j;
- for (j = ARR_LEN(entry->cf_list) - 1; j >= 0; --j) {
- ir_node *node = entry->cf_list[j];
+ for (j = ARR_LEN(entry->cf_list); j > 0;) {
+ ir_node *node = entry->cf_list[--j];
pre(node, env);
}
- for (j = ARR_LEN(entry->df_list) - 1; j >= 0; --j) {
- ir_node *node = entry->df_list[j];
+ for (j = ARR_LEN(entry->df_list); j > 0;) {
+ ir_node *node = entry->df_list[--j];
pre(node, env);
}
- for (j = ARR_LEN(entry->phi_list) - 1; j >= 0; --j) {
- ir_node *node = entry->phi_list[j];
+ for (j = ARR_LEN(entry->phi_list); j > 0;) {
+ ir_node *node = entry->phi_list[--j];
pre(node, env);
}
static void traverse_block_post(ir_node *block, block_entry_t *entry,
irg_walk_func *post, void *env)
{
- int j, n;
+ size_t j, n;
post(block, env);
*/
static void traverse_pre(blk_collect_data_t *blks, irg_walk_func *pre, void *env)
{
- int i;
+ size_t i;
- for (i = ARR_LEN(blks->blk_list) - 1; i >= 0; --i) {
- ir_node *block = blks->blk_list[i];
+ for (i = ARR_LEN(blks->blk_list); i > 0;) {
+ ir_node *block = blks->blk_list[--i];
block_entry_t *entry = block_find_entry(block, blks);
traverse_block_pre(block, entry, pre, env);
*/
static void traverse_post(blk_collect_data_t *blks, irg_walk_func *post, void *env)
{
- int i, k;
+ size_t i, k;
for (i = 0, k = ARR_LEN(blks->blk_list); i < k; ++i) {
ir_node *block = blks->blk_list[i];
*/
static void traverse_both(blk_collect_data_t *blks, irg_walk_func *pre, irg_walk_func *post, void *env)
{
- int i;
+ size_t i;
- for (i = ARR_LEN(blks->blk_list) - 1; i >= 0; --i) {
- ir_node *block = blks->blk_list[i];
+ for (i = ARR_LEN(blks->blk_list); i > 0;) {
+ ir_node *block = blks->blk_list[--i];
block_entry_t *entry = block_find_entry(block, blks);
traverse_block_pre(block, entry, pre, env);
*/
static void dom_block_visit_pre(ir_node *block, void *env)
{
- dom_traversal_t *ctx = env;
+ dom_traversal_t *ctx = (dom_traversal_t*)env;
block_entry_t *entry = block_find_entry(block, ctx->blks);
traverse_block_pre(block, entry, ctx->pre, ctx->env);
*/
static void dom_block_visit_post(ir_node *block, void *env)
{
- dom_traversal_t *ctx = env;
+ dom_traversal_t *ctx = (dom_traversal_t*)env;
block_entry_t *entry = block_find_entry(block, ctx->blks);
traverse_block_post(block, entry, ctx->post, ctx->env);
*/
static void dom_block_visit_both(ir_node *block, void *env)
{
- dom_traversal_t *ctx = env;
+ dom_traversal_t *ctx = (dom_traversal_t*)env;
block_entry_t *entry = block_find_entry(block, ctx->blks);
traverse_block_pre(block, entry, ctx->pre, ctx->env);
ctx.env = env;
if (pre != NULL && post != NULL)
- dom_tree_walk_irg(current_ir_graph, dom_block_visit_both, NULL, &ctx);
+ dom_tree_walk_irg(current_ir_graph, dom_block_visit_both, NULL, &ctx);
else if (pre != NULL)
- dom_tree_walk_irg(current_ir_graph, dom_block_visit_pre, NULL, &ctx);
+ dom_tree_walk_irg(current_ir_graph, dom_block_visit_pre, NULL, &ctx);
else if (post != NULL)
- dom_tree_walk_irg(current_ir_graph, dom_block_visit_post, NULL, &ctx);
+ dom_tree_walk_irg(current_ir_graph, dom_block_visit_post, NULL, &ctx);
}
/**
mark_irn_visited(node);
- if (node->op == op_Block) {
+ if (is_Block(node)) {
/* predecessors of a block are control flow nodes */
for (i = _get_walk_arity(env, node) - 1; i >= 0; --i) {
ir_node *pred = _get_walk_irn_n(env, node, i);
*/
static void collect_lists(blk_collect_data_t *env)
{
- int i, j;
+ size_t i, j;
ir_node *block, *node;
block_entry_t *entry;
inc_irg_visited(current_ir_graph);
- for (i = ARR_LEN(env->blk_list) - 1; i >= 0; --i) {
- block = env->blk_list[i];
+ for (i = ARR_LEN(env->blk_list); i > 0;) {
+ block = env->blk_list[--i];
entry = block_find_entry(block, env);
- for (j = ARR_LEN(entry->entry_list) - 1; j >= 0; --j) {
- node = entry->entry_list[j];
+ for (j = ARR_LEN(entry->entry_list); j > 0;) {
+ node = entry->entry_list[--j];
/* a entry might already be visited due to Phi loops */
if (node->visited < current_ir_graph->visited)
}
/**
- * Intraprozedural graph walker over blocks.
+ * Intra procedural graph walker over blocks.
*/
static void do_irg_walk_blk(ir_graph *irg, irg_walk_func *pre,
irg_walk_func *post, void *env, unsigned follow_deps,