res = new_ir_node (current_ir_graph, NULL, op_Block, mode_R, arity, in);
+ irn_vrfy (res);
return res;
}
#else
res = known = new_ir_node (irg, block, op_Phi, mode, ins, in);
#endif
- /* The in-array can contain NULLs. These were returned by get_r_value_internal
- if it reached the same block/definition on a second path.
+ /* The in-array can contain NULLs. These were returned by
+ get_r_value_internal if it reached the same block/definition on a
+ second path.
The NULLs are replaced by the node itself to simplify the test in the
next loop. */
for (i=0; i < ins; ++i)
}
ir_node *
-new_r_Bad (ir_node *block)
+new_r_Bad ()
{
return current_ir_graph->bad;
}
res = optimize (res);
irn_vrfy (res);
+
return res;
}
if (block->attr.block.matured) { /* case 3 */
/* The Phi has the same amount of ins as the corresponding block. */
- int ins = get_irn_arity(block); // ARR_LEN (block->in)-1;
+ int ins = get_irn_arity(block);
ir_node **nin;
NEW_ARR_A (ir_node *, nin, ins);