{
const be_use_t *p = a;
const be_use_t *q = b;
+ (void) n;
+
return !(p->block == q->block && p->node == q->node);
}
return result;
}
-static int be_is_phi_argument(const be_lv_t *lv, const ir_node *block, const ir_node *def)
+static int be_is_phi_argument(const ir_node *block, const ir_node *def)
{
ir_node *node;
ir_node *succ_block = NULL;
unsigned from_step, const ir_node *def,
int skip_from_uses)
{
- unsigned step = from_step;
+ unsigned step = from_step;
ir_node *block = get_nodes_block(from);
ir_node *next_use;
ir_node *node;
unsigned timestep;
- int next_use_step;
+ unsigned next_use_step;
const ir_edge_t *edge;
#if 1
ir_node *node = get_edge_src_irn(edge);
unsigned node_step;
+ if(is_Anchor(node))
+ continue;
if(get_nodes_block(node) != block)
continue;
if(is_Phi(node))
}
#endif
- if(be_is_phi_argument(env->lv, block, def)) {
+ if(be_is_phi_argument(block, def)) {
// TODO we really should continue searching the uses of the phi,
// as a phi isn't a real use that implies a reload (because we could
// easily spill the whole phi)
{
ir_node *node;
unsigned step = 0;
+ (void) data;
sched_foreach(block, node) {
set_irn_link(node, INT_TO_PTR(step));