/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
#include "besched_t.h"
#include "bestat.h"
#include "bessaconstr.h"
-#include "benodesets.h"
#include "beintlive_t.h"
#undef KEEP_ALIVE_COPYKEEP_HACK
sched_add_after(irn, keep);
/* insert the other different and it's copies into the set */
- key.op = other_different;
- entry = pset_find(op_set, &key, nodeset_hash(other_different));
+ key.op = other_different;
+ entry = pset_find(op_set, &key, hash_irn(other_different));
if (! entry) {
entry = obstack_alloc(&env->obst, sizeof(*entry));
ir_nodeset_insert(&entry->copies, keep);
}
- pset_insert(op_set, entry, nodeset_hash(other_different));
+ pset_insert(op_set, entry, hash_irn(other_different));
}
/**
req = arch_get_register_req(arch_env, irn, -1);
if (arch_register_req_is(req, should_be_different)) {
- ir_node *different_from = get_irn_n(belower_skip_proj(irn), req->other_different);
- gen_assure_different_pattern(irn, different_from, env);
- } else if (arch_register_req_is(req, should_be_different_from_all)) {
- int i, n = get_irn_arity(belower_skip_proj(irn));
- for (i = 0; i < n; i++) {
- gen_assure_different_pattern(irn, get_irn_n(belower_skip_proj(irn), i), env);
+ const unsigned other = req->other_different;
+ int i;
+
+ for (i = 0; 1U << i <= other; ++i) {
+ if (other & (1U << i)) {
+ ir_node *different_from = get_irn_n(belower_skip_proj(irn), i);
+ gen_assure_different_pattern(irn, different_from, env);
+ }
}
}
}
new_ck = be_new_CopyKeep(entry->cls, irg, get_nodes_block(ref), be_get_CopyKeep_op(ref), n_melt, new_ck_in, get_irn_mode(ref));
#endif /* KEEP_ALIVE_COPYKEEP_HACK */
- /* set register class for all keeped inputs */
+ /* set register class for all kept inputs */
for (j = 1; j <= n_melt; ++j)
be_node_set_reg_class(new_ck, j, entry->cls);
ir_nodeset_insert(&entry->copies, new_ck);
/* find scheduling point */
- if (get_irn_mode(ref_mode_T) == mode_T) {
- /* walk along the Projs */
- for (sched_pt = sched_next(ref_mode_T); is_Proj(sched_pt) || be_is_Keep(sched_pt) || be_is_CopyKeep(sched_pt); sched_pt = sched_next(sched_pt))
- /* just walk along the schedule until a non-Proj/Keep/CopyKeep node is found*/ ;
- }
- else {
- sched_pt = ref_mode_T;
- }
+ sched_pt = ref_mode_T;
+ do {
+ /* just walk along the schedule until a non-Keep/CopyKeep node is found */
+ sched_pt = sched_next(sched_pt);
+ } while (be_is_Keep(sched_pt) || be_is_CopyKeep(sched_pt));
sched_add_before(sched_pt, new_ck);
DBG((cenv->dbg, LEVEL_1, "created %+F, scheduled before %+F\n", new_ck, sched_pt));
int i, n;
const ir_edge_t *edge;
- ir_node *last_proj, *irn;
+ ir_node *last_proj = NULL, *irn;
const arch_register_class_t *cls = NULL;
DBG((mod, LEVEL_1, "perm move %+F irg %+F\n", perm, irg));