#include "iredges_t.h"
#include "irgwalk.h"
-#include "../benode_t.h"
+#include "../benode.h"
+#include "../belive.h"
#define AGGRESSIVE_AM
/* gas/ld don't support negative symconsts :-( */
#undef SUPPORT_NEGATIVE_SYMCONSTS
-static be_lv_t *lv;
static bitset_t *non_address_mode_nodes;
/**
return 0;
return 1;
+ case iro_Unknown:
+ /* we can use '0' for Unknowns */
+ return 1;
case iro_Add:
case iro_Sub:
/* Add's and Sub's are typically supported as long as both operands are
* @return non-zero if the DAG represents an immediate, 0 else
*/
#if 0
-static int is_immediate_simple(const ir_node *node) {
+static int is_immediate_simple(const ir_node *node)
+{
int symconsts = 0;
return do_is_immediate(node, &symconsts, 0);
}
#endif
addr->symconst_sign = negate;
break;
+ case iro_Unknown:
+ break;
case iro_Add:
assert(!ia32_is_non_address_mode_node(node));
left = get_Add_left(node);
/* Create an address mode for a given node. */
void ia32_create_address_mode(ia32_address_t *addr, ir_node *node, ia32_create_am_flags_t flags)
{
- int res = 0;
ir_node *eat_imms;
if (is_immediate(addr, node, 0)) {
eat_imms = ia32_skip_downconv(eat_imms);
}
- res = 1;
node = eat_imms;
#ifndef AGGRESSIVE_AM
if (get_irn_n_edges(node) > 1) {
return bitset_is_set(non_address_mode_nodes, get_irn_idx(node));
}
-static int value_last_used_here(ir_node *here, ir_node *value)
+static int value_last_used_here(be_lv_t *lv, ir_node *here, ir_node *value)
{
- ir_node *block = get_nodes_block(here);
+ ir_node *block = get_nodes_block(here);
const ir_edge_t *edge;
/* If the value is live end it is for sure it does not die here */
*/
static void mark_non_address_nodes(ir_node *node, void *env)
{
- int i, arity;
+ be_lv_t *lv = env;
+ int arity;
+ int i;
ir_node *val;
ir_node *left;
ir_node *right;
ir_mode *mode;
- (void) env;
mode = get_irn_mode(node);
if (!mode_is_int(mode) && !mode_is_reference(mode) && mode != mode_b)
case iro_Store:
/* Do not mark the pointer, because we want to turn it into AM. */
val = get_Store_value(node);
- bitset_set(non_address_mode_nodes, get_irn_idx(val));
+ ia32_mark_non_am(val);
break;
case iro_Shl:
* 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. */
- bitset_set(non_address_mode_nodes, get_irn_idx(node));
+ ia32_mark_non_am(node);
break;
default:
for (i = 0; i < arity; ++i) {
ir_node *in = get_irn_n(node, i);
- bitset_set(non_address_mode_nodes, get_irn_idx(in));
+ ia32_mark_non_am(in);
}
break;
}
}
-void ia32_calculate_non_address_mode_nodes(be_irg_t *birg)
+void ia32_calculate_non_address_mode_nodes(ir_graph *irg)
{
- ir_graph *irg = be_get_birg_irg(birg);
+ be_lv_t *lv = be_assure_liveness(irg);
- lv = be_assure_liveness(birg);
non_address_mode_nodes = bitset_malloc(get_irg_last_idx(irg));
- irg_walk_graph(irg, NULL, mark_non_address_nodes, NULL);
+ irg_walk_graph(irg, NULL, mark_non_address_nodes, lv);
}
void ia32_free_non_address_mode_nodes(void)