left = get_Add_left(node);
right = get_Add_right(node);
eat_immediate(addr, left, negate);
eat_immediate(addr, right, negate);
break;
case iro_Sub:
left = get_Add_left(node);
right = get_Add_right(node);
eat_immediate(addr, left, negate);
eat_immediate(addr, right, negate);
break;
case iro_Sub:
left = get_Sub_left(node);
right = get_Sub_right(node);
eat_immediate(addr, left, negate);
left = get_Sub_left(node);
right = get_Sub_right(node);
eat_immediate(addr, left, negate);
static ir_node *eat_immediates(ia32_address_t *addr, ir_node *node,
ia32_create_am_flags_t flags)
{
static ir_node *eat_immediates(ia32_address_t *addr, ir_node *node,
ia32_create_am_flags_t flags)
{
- if (!(flags & ia32_create_am_force) &&
- bitset_is_set(non_address_mode_nodes, get_irn_idx(node)) &&
+ if (!(flags & ia32_create_am_force) &&
+ ia32_is_non_address_mode_node(node) &&
/* we can only eat a shl if we don't have a scale or index set yet */
if (addr->scale != 0 || addr->index != NULL)
return 0;
/* we can only eat a shl if we don't have a scale or index set yet */
if (addr->scale != 0 || addr->index != NULL)
return 0;
- if (!(flags & ia32_create_am_force) &&
- bitset_is_set(non_address_mode_nodes, get_irn_idx(node)) &&
+ if (!(flags & ia32_create_am_force) &&
+ ia32_is_non_address_mode_node(node) &&
assert(addr->base == NULL);
assert(addr->frame_entity == NULL);
addr->base = be_get_FrameAddr_frame(left);
assert(addr->base == NULL);
assert(addr->frame_entity == NULL);
addr->base = be_get_FrameAddr_frame(left);
assert(addr->base == NULL);
assert(addr->frame_entity == NULL);
addr->base = be_get_FrameAddr_frame(right);
assert(addr->base == NULL);
assert(addr->frame_entity == NULL);
addr->base = be_get_FrameAddr_frame(right);
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);