/*
- * 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.
*
#include "beirgmod.h"
#include "bearch_t.h"
#include "beuses.h"
-#include "benodesets.h"
#define SCAN_INTERBLOCK_USES
const ir_node *block,
const ir_node *def)
{
- unsigned hash = HASH_COMBINE(nodeset_hash(block), nodeset_hash(def));
+ unsigned hash = HASH_COMBINE(hash_irn(block), hash_irn(def));
be_use_t temp;
be_use_t* result;
be_next_use_t result;
result.time = next_use_step - timestep + skip_from_uses;
result.outermost_loop = get_loop_depth(get_irn_loop(block));
+ result.before = next_use;
return result;
}
return be_get_next_use(env, node, step, node, 1);
}
- result.time = step;
+ result.time = step;
result.outermost_loop = get_loop_depth(get_irn_loop(block));
+ result.before = node;
return result;
}
}
be_next_use_t result;
result.time = step;
result.outermost_loop = get_loop_depth(get_irn_loop(block));
+ result.before = block;
return result;
}
ir_graph *irg = get_irn_irg(block);
ir_node *startblock = get_irg_start_block(irg);
+ result.before = NULL;
outermost_loop = loopdepth;
foreach_block_succ(block, edge) {
const be_use_t *use;
}
if(use_dist < next_use) {
- next_use = use_dist;
+ next_use = use_dist;
outermost_loop = use->outermost_loop;
+ result.before = use->node;
}
}
if(loopdepth < outermost_loop)
outermost_loop = loopdepth;
- result.time = next_use + step;
+ result.time = next_use + step;
result.outermost_loop = outermost_loop;
if(!found_use && found_visited) {