case iro_Store:
/* Do not mark the pointer, because we want to turn it into AM. */
val = get_Store_value(node);
case iro_Store:
/* Do not mark the pointer, because we want to turn it into AM. */
val = get_Store_value(node);
* an addition and has the same register pressure for the case that only
* one operand dies, but is faster (on Pentium 4).
* && instead of || only folds AM if both operands do not die here */
* an addition and has the same register pressure for the case that only
* one operand dies, but is faster (on Pentium 4).
* && instead of || only folds AM if both operands do not die here */
- if (!value_last_used_here(node, left) ||
- !value_last_used_here(node, right)) {
+ if (!value_last_used_here(lv, node, left) ||
+ !value_last_used_here(lv, node, right)) {
return;
}
/* At least one of left and right are not used by anyone else, so it is
* beneficial for the register pressure (if both are unused otherwise,
* else neutral) and ALU use to not fold AM. */
return;
}
/* At least one of left and right are not used by anyone else, so it is
* beneficial for the register pressure (if both are unused otherwise,
* else neutral) and ALU use to not fold AM. */
for (i = 0; i < arity; ++i) {
ir_node *in = get_irn_n(node, i);
for (i = 0; i < arity; ++i) {
ir_node *in = get_irn_n(node, i);
- irg_walk_graph(irg, NULL, mark_non_address_nodes, NULL);
+ irg_walk_graph(irg, NULL, mark_non_address_nodes, lv);