#include "bearch.h"
#include "belower.h"
-#include "benode_t.h"
+#include "benode.h"
#include "besched.h"
#include "bestat.h"
#include "bessaconstr.h"
pair = &pairs[n++];
pair->in_node = in;
- pair->in_reg = arch_get_irn_register(in);
+ pair->in_reg = in_reg;
pair->out_node = out;
- pair->out_reg = arch_get_irn_register(out);
+ pair->out_reg = out_reg;
pair->checked = 0;
}
in[0] = irn;
in[1] = cpy;
- keep = be_new_Keep(cls, block, 2, in);
+ keep = be_new_Keep(block, 2, in);
}
DB((dbg_constr, LEVEL_1, "created %+F(%+F, %+F)\n\n", keep, irn, cpy));
/* insert the other different and it's copies into the map */
entry = ir_nodemap_get(op_set, other_different);
if (! entry) {
- entry = obstack_alloc(&env->obst, sizeof(*entry));
+ entry = OALLOC(&env->obst, op_copy_assoc_t);
entry->cls = cls;
ir_nodeset_init(&entry->copies);
/* so we transform unnecessary ones into Keeps. */
foreach_ir_nodeset(&entry->copies, cp, iter) {
if (be_is_CopyKeep(cp) && get_irn_n_edges(cp) < 1) {
- const arch_register_class_t *cls = arch_get_irn_reg_class_out(cp);
- int n = get_irn_arity(cp);
- ir_node *keep;
+ int n = get_irn_arity(cp);
+ ir_node *keep;
- keep = be_new_Keep(cls, get_nodes_block(cp), n, get_irn_in(cp) + 1);
+ keep = be_new_Keep(get_nodes_block(cp), n, get_irn_in(cp) + 1);
sched_add_before(cp, keep);
/* Set all ins (including the block) of the CopyKeep BAD to keep the verifier happy. */