if (in_out) {
for (i = 0; i < n; i++) {
/* out register matches */
- if (pairs[i].out_reg->index == reg_idx)
+ if ((int) pairs[i].out_reg->index == reg_idx)
return i;
}
}
else {
for (i = 0; i < n; i++) {
/* in register matches */
- if (pairs[i].in_reg->index == reg_idx)
+ if ((int) pairs[i].in_reg->index == reg_idx)
return i;
}
}
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));
ir_graph *irg = get_irn_irg(perm);
ir_node *bl = get_nodes_block(perm);
- int n = get_irn_arity(perm);
- int *map = alloca(n * sizeof(map[0]));
- ir_node **projs = alloca(n * sizeof(projs[0]));
- bitset_t *keep = bitset_alloca(n);
+ ir_node *node;
+ int arity = get_irn_arity(perm);
+ int *map;
+ int *proj_map;
+ bitset_t *moved = bitset_alloca(arity);
+ int n_moved;
+ int new_size;
ir_node *frontier = sched_first(bl);
FIRM_DBG_REGISTER(firm_dbg_module_t *mod, "firm.be.lower.permmove");
- int i, new_size, n_keep;
+ int i, n;
const ir_edge_t *edge;
- ir_node *last_proj, *irn;
- const arch_register_class_t *cls;
+ 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));
DBG((mod, LEVEL_2, "\tfrontier: %+F\n", frontier));
- foreach_out_edge (perm, edge) {
- ir_node *proj = get_edge_src_irn(edge);
- int nr = get_Proj_proj(proj);
- ir_node *op = get_irn_n(perm, nr);
-
- assert(nr < n);
-
- /* we will need the last Proj as an insertion point
- * for the instruction(s) pushed through the Perm */
- if (sched_comes_after(last_proj, proj))
- last_proj = proj;
-
- projs[nr] = proj;
-
- bitset_set(keep, nr);
- if (!is_Proj(op) && get_nodes_block(op) == bl
- && (op == frontier || sched_comes_after(frontier, op))) {
- for (i = get_irn_arity(op) - 1; i >= 0; --i) {
- ir_node *opop = get_irn_n(op, i);
- if (!arch_irn_consider_in_reg_alloc(aenv, cls, opop)) {
- bitset_clear(keep, nr);
- break;
- }
+ node = sched_prev(perm);
+ n_moved = 0;
+ while(!sched_is_begin(node)) {
+ const arch_register_req_t *req;
+ int input = -1;
+ ir_node *proj;
+
+ foreach_out_edge(perm, edge) {
+ ir_node *out = get_edge_src_irn(edge);
+ int pn = get_Proj_proj(out);
+ ir_node *in = get_irn_n(perm, pn);
+ if(node == in) {
+ proj = out;
+ input = pn;
+ break;
}
}
- }
-
- n_keep = bitset_popcnt(keep);
-
- /* well, we could not push enything through the perm */
- if (n_keep == n)
- return 1;
-
- assert(is_Proj(last_proj));
-
- DBG((mod, LEVEL_2, "\tkeep: %d, total: %d, mask: %b\n", n_keep, n, keep));
- last_proj = sched_next(last_proj);
- for (new_size = 0, i = 0; i < n; ++i) {
- ir_node *proj = projs[i];
-
- if (bitset_is_set(keep, i)) {
- map[i] = new_size++;
- set_Proj_proj(proj, map[i]);
- DBG((mod, LEVEL_1, "\targ %d remap to %d\n", i, map[i]));
+ /* it wasn't an input to the perm, we can't do anything more */
+ if(input < 0)
+ break;
+ if(!sched_comes_after(frontier, node))
+ break;
+ if(arch_irn_is(aenv, node, modify_flags))
+ break;
+ if(is_Proj(node)) {
+ req = arch_get_register_req(aenv, get_Proj_pred(node),
+ -1 - get_Proj_proj(node));
+ } else {
+ req = arch_get_register_req(aenv, node, -1);
+ }
+ if(req->type != arch_register_req_type_normal)
+ break;
+ for(i = get_irn_arity(node) - 1; i >= 0; --i) {
+ ir_node *opop = get_irn_n(node, i);
+ if (arch_irn_consider_in_reg_alloc(aenv, cls, opop)) {
+ break;
+ }
}
+ if(i >= 0)
+ break;
- else {
- ir_node *move = get_irn_n(perm, i);
+ DBG((mod, LEVEL_2, "\tmoving %+F after %+F, killing %+F\n", node, perm, proj));
- DBG((mod, LEVEL_2, "\tmoving %+F before %+F, killing %+F\n", move, last_proj, proj));
+ /* move the movable node in front of the Perm */
+ sched_remove(node);
+ sched_add_after(perm, node);
- /* move the movable node in front of the Perm */
- sched_remove(move);
- sched_add_before(last_proj, move);
+ /* give it the proj's register */
+ arch_set_irn_register(aenv, node, arch_get_irn_register(aenv, proj));
- /* give it the proj's register */
- arch_set_irn_register(aenv, move, arch_get_irn_register(aenv, proj));
+ /* reroute all users of the proj to the moved node. */
+ edges_reroute(proj, node, irg);
- /* reroute all users of the proj to the moved node. */
- edges_reroute(proj, move, irg);
+ /* and kill it */
+ set_Proj_pred(proj, new_Bad());
+ be_kill_node(proj);
- /* and like it to bad so it is no more in the use array of the perm */
- set_Proj_pred(proj, get_irg_bad(irg));
+ bitset_set(moved, input);
+ n_moved++;
- map[i] = -1;
- }
+ node = sched_prev(node);
+ }
+
+ /* well, we could not push anything through the perm */
+ if(n_moved == 0)
+ return 1;
+ new_size = arity - n_moved;
+ if(new_size == 0) {
+ return 0;
}
- if (n_keep > 0)
- be_Perm_reduce(perm, new_size, map);
+ map = alloca(new_size * sizeof(map[0]));
+ proj_map = alloca(arity * sizeof(proj_map[0]));
+ memset(proj_map, -1, sizeof(proj_map[0]));
+ n = 0;
+ for(i = 0; i < arity; ++i) {
+ if(bitset_is_set(moved, i))
+ continue;
+ map[n] = i;
+ proj_map[i] = n;
+ n++;
+ }
+ assert(n == new_size);
+ foreach_out_edge(perm, edge) {
+ ir_node *proj = get_edge_src_irn(edge);
+ int pn = get_Proj_proj(proj);
+ pn = proj_map[pn];
+ assert(pn >= 0);
+ set_Proj_proj(proj, pn);
+ }
- return n_keep > 0;
+ be_Perm_reduce(perm, new_size, map);
+ return 1;
}
/**