/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
/**
* @file
- * @brief Performs lowering of perm nodes. Inserts copies to assure register constraints.
+ * @brief Performs lowering of perm nodes. Inserts copies to assure
+ * register constraints.
* @author Christian Wuerdig
* @date 14.12.2005
- * @version $Id$
*/
#include "config.h"
#include "debug.h"
#include "xmalloc.h"
#include "irnodeset.h"
-#include "irnodemap.h"
+#include "irnodehashmap.h"
#include "irgmod.h"
#include "iredges_t.h"
#include "irgwalk.h"
#include "array_t.h"
-#include "bearch_t.h"
+#include "bearch.h"
+#include "beirg.h"
#include "belower.h"
-#include "benode_t.h"
-#include "besched_t.h"
+#include "benode.h"
+#include "besched.h"
#include "bestat.h"
#include "bessaconstr.h"
#include "beintlive_t.h"
DEBUG_ONLY(static firm_dbg_module_t *dbg_constr;)
DEBUG_ONLY(static firm_dbg_module_t *dbg_permmove;)
-/** Associates an ir_node with it's copy and CopyKeep. */
+/** Associates an ir_node with its copy and CopyKeep. */
typedef struct {
ir_nodeset_t copies; /**< all non-spillable copies of this irn */
const arch_register_class_t *cls;
/** Environment for constraints. */
typedef struct {
- be_irg_t *birg;
- ir_nodemap_t op_set;
- struct obstack obst;
+ ir_graph *irg;
+ ir_nodehashmap_t op_set;
+ struct obstack obst;
} constraint_env_t;
/** Lowering walker environment. */
-typedef struct _lower_env_t {
- be_irg_t *birg;
- unsigned do_copy : 1;
+typedef struct lower_env_t {
+ ir_graph *irg;
+ unsigned do_copy : 1;
} lower_env_t;
/** Holds a Perm register pair. */
-typedef struct _reg_pair_t {
+typedef struct reg_pair_t {
const arch_register_t *in_reg; /**< a perm IN register */
ir_node *in_node; /**< the in node to which the register belongs */
int checked; /**< indicates whether the pair was check for cycle or not */
} reg_pair_t;
-typedef enum _perm_type_t {
+typedef enum perm_type_t {
PERM_CYCLE,
PERM_CHAIN,
- PERM_SWAP,
- PERM_COPY
} perm_type_t;
/** Structure to represent cycles or chains in a Perm. */
-typedef struct _perm_cycle_t {
+typedef struct perm_cycle_t {
const arch_register_t **elems; /**< the registers in the cycle */
int n_elems; /**< number of elements in the cycle */
perm_type_t type; /**< type (CHAIN or CYCLE) */
* @param reg The register to look for
* @return The corresponding node or NULL if not found
*/
-static ir_node *get_node_for_in_register(reg_pair_t *pairs, int n, const arch_register_t *reg) {
+static ir_node *get_node_for_in_register(reg_pair_t *pairs, int n, const arch_register_t *reg)
+{
int i;
for (i = 0; i < n; i++) {
* @param reg The register to look for
* @return The corresponding node or NULL if not found
*/
-static ir_node *get_node_for_out_register(reg_pair_t *pairs, int n, const arch_register_t *reg) {
+static ir_node *get_node_for_out_register(reg_pair_t *pairs, int n, const arch_register_t *reg)
+{
int i;
for (i = 0; i < n; i++) {
*
* @return The corresponding index in pairs or -1 if not found
*/
-static int get_pairidx_for_in_regidx(reg_pair_t *pairs, int n, unsigned reg_idx) {
+static int get_pairidx_for_in_regidx(reg_pair_t *pairs, int n, unsigned reg_idx)
+{
int i;
for (i = 0; i < n; i++) {
*
* @return The corresponding index in pairs or -1 if not found
*/
-static int get_pairidx_for_out_regidx(reg_pair_t *pairs, int n, unsigned reg_idx) {
+static int get_pairidx_for_out_regidx(reg_pair_t *pairs, int n, unsigned reg_idx)
+{
int i;
for (i = 0; i < n; i++) {
* NOTE: This works with auto-magic. If we insert the new copy/exchange
* nodes after this node, everything should be ok. */
ir_node * sched_point = sched_prev(irn);
- const ir_edge_t * edge;
- const ir_edge_t * next;
int n;
int i;
/* build the list of register pairs (in, out) */
n = 0;
- foreach_out_edge_safe(irn, edge, next) {
+ foreach_out_edge_safe(irn, edge) {
ir_node *const out = get_edge_src_irn(edge);
long const pn = get_Proj_proj(out);
ir_node *const in = get_irn_n(irn, pn);
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_2 = in node with register i + 1
* OUT_1 = out node with register i + 1
* OUT_2 = out node with register i */
+ ir_node *cpyxchg;
if (cycle.type == PERM_CYCLE && !do_copy) {
ir_node *in[2];
- ir_node *cpyxchg;
in[0] = arg1;
in[1] = arg2;
int pidx = get_pairidx_for_in_regidx(pairs, n, cycle.elems[i]->index);
/* create intermediate proj */
- res1 = new_r_Proj(block, cpyxchg, get_irn_mode(res1), 0);
+ res1 = new_r_Proj(cpyxchg, get_irn_mode(res1), 0);
/* set as in for next Perm */
pairs[pidx].in_node = res1;
arch_set_irn_register(res2, cycle.elems[i + 1]);
arch_set_irn_register(res1, cycle.elems[i]);
- /* insert the copy/exchange node in schedule after the magic schedule node (see above) */
- sched_add_after(skip_Proj(sched_point), cpyxchg);
-
DB((dbg, LEVEL_1, "replacing %+F with %+F, placed new node after %+F\n", irn, cpyxchg, sched_point));
-
- /* set the new scheduling point */
- sched_point = res1;
} else {
- ir_node *cpyxchg;
-
DB((dbg, LEVEL_1, "%+F creating copy node (%+F, %s) -> (%+F, %s)\n",
irn, arg1, cycle.elems[i]->name, res2, cycle.elems[i + 1]->name));
- cpyxchg = be_new_Copy(reg_class, block, arg1);
+ cpyxchg = be_new_Copy(block, arg1);
arch_set_irn_register(cpyxchg, cycle.elems[i + 1]);
/* exchange copy node and proj */
exchange(res2, cpyxchg);
+ }
- /* insert the copy/exchange node in schedule after the magic schedule node (see above) */
- sched_add_after(skip_Proj(sched_point), cpyxchg);
+ /* insert the copy/exchange node in schedule after the magic schedule node (see above) */
+ sched_add_after(sched_point, cpyxchg);
- /* set the new scheduling point */
- sched_point = cpyxchg;
- }
+ /* set the new scheduling point */
+ sched_point = cpyxchg;
}
}
-static int has_irn_users(const ir_node *irn) {
+static int has_irn_users(const ir_node *irn)
+{
return get_irn_out_edge_first_kind(irn, EDGE_KIND_NORMAL) != 0;
}
}
}
-static void gen_assure_different_pattern(ir_node *irn, ir_node *other_different, constraint_env_t *env) {
- ir_graph *irg;
- ir_nodemap_t *op_set;
+static void gen_assure_different_pattern(ir_node *irn, ir_node *other_different, constraint_env_t *env)
+{
+ ir_nodehashmap_t *op_set;
ir_node *block;
const arch_register_class_t *cls;
ir_node *keep, *cpy;
op_copy_assoc_t *entry;
- if (arch_irn_is_ignore(other_different) ||
+ arch_register_req_t const *const req = arch_get_irn_register_req(other_different);
+ if (arch_register_req_is(req, ignore) ||
!mode_is_datab(get_irn_mode(other_different))) {
DB((dbg_constr, LEVEL_1, "ignore constraint for %+F because other_irn is ignore or not a datab node\n", irn));
return;
}
- irg = be_get_birg_irg(env->birg);
op_set = &env->op_set;
block = get_nodes_block(irn);
- cls = arch_get_irn_reg_class_out(other_different);
+ cls = req->cls;
/* Make a not spillable copy of the different node */
/* this is needed because the different irn could be */
/* check if already exists such a copy in the schedule immediately before */
cpy = find_copy(skip_Proj(irn), other_different);
if (! cpy) {
- cpy = be_new_Copy(cls, block, other_different);
- arch_irn_set_flags(cpy, arch_irn_flags_dont_spill);
+ cpy = be_new_Copy(block, other_different);
+ arch_set_irn_flags(cpy, arch_irn_flags_dont_spill);
DB((dbg_constr, LEVEL_1, "created non-spillable %+F for value %+F\n", cpy, other_different));
} else {
DB((dbg_constr, LEVEL_1, "using already existing %+F for value %+F\n", cpy, other_different));
/* Add the Keep resp. CopyKeep and reroute the users */
/* of the other_different irn in case of CopyKeep. */
if (has_irn_users(other_different)) {
- keep = be_new_CopyKeep_single(cls, block, cpy, irn, get_irn_mode(other_different));
+ keep = be_new_CopyKeep_single(block, cpy, irn);
be_node_set_reg_class_in(keep, 1, cls);
} else {
ir_node *in[2];
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));
sched_add_before(skip_Proj(irn), cpy);
sched_add_after(skip_Proj(irn), keep);
- /* insert the other different and it's copies into the map */
- entry = ir_nodemap_get(op_set, other_different);
+ /* insert the other different and its copies into the map */
+ entry = ir_nodehashmap_get(op_copy_assoc_t, 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);
- ir_nodemap_insert(op_set, other_different, entry);
+ ir_nodehashmap_insert(op_set, other_different, entry);
}
/* insert copy */
* @param skipped_irn if irn is a Proj node, its predecessor, else irn
* @param env the constraint environment
*/
-static void assure_different_constraints(ir_node *irn, ir_node *skipped_irn, constraint_env_t *env) {
- const arch_register_req_t *req = arch_get_register_req_out(irn);
+static void assure_different_constraints(ir_node *irn, ir_node *skipped_irn, constraint_env_t *env)
+{
+ const arch_register_req_t *req = arch_get_irn_register_req(irn);
if (arch_register_req_is(req, must_be_different)) {
const unsigned other = req->other_different;
* @param block The block to be checked
* @param walk_env The walker environment
*/
-static void assure_constraints_walker(ir_node *block, void *walk_env) {
- ir_node *irn;
+static void assure_constraints_walker(ir_node *block, void *walk_env)
+{
+ constraint_env_t *env = (constraint_env_t*)walk_env;
sched_foreach_reverse(block, irn) {
- ir_mode *mode = get_irn_mode(irn);
-
- if (mode == mode_T) {
- const ir_edge_t *edge;
-
- foreach_out_edge(irn, edge) {
- ir_node *proj = get_edge_src_irn(edge);
-
- mode = get_irn_mode(proj);
- if (mode_is_datab(mode))
- assure_different_constraints(proj, irn, walk_env);
- }
- } else if (mode_is_datab(mode)) {
- assure_different_constraints(irn, irn, walk_env);
- }
+ be_foreach_value(irn, value,
+ if (mode_is_datab(get_irn_mode(value)))
+ assure_different_constraints(value, irn, env);
+ );
}
}
* Melt all copykeeps pointing to the same node
* (or Projs of the same node), copying the same operand.
*/
-static void melt_copykeeps(constraint_env_t *cenv) {
- ir_nodemap_iterator_t map_iter;
- ir_nodemap_entry_t map_entry;
+static void melt_copykeeps(constraint_env_t *cenv)
+{
+ ir_nodehashmap_iterator_t map_iter;
+ ir_nodehashmap_entry_t map_entry;
/* for all */
- foreach_ir_nodemap(&cenv->op_set, map_entry, map_iter) {
- op_copy_assoc_t *entry = map_entry.data;
+ foreach_ir_nodehashmap(&cenv->op_set, map_entry, map_iter) {
+ op_copy_assoc_t *entry = (op_copy_assoc_t*)map_entry.data;
int idx, num_ck;
- ir_node *cp;
struct obstack obst;
- ir_nodeset_iterator_t iter;
ir_node **ck_arr, **melt_arr;
obstack_init(&obst);
if (ck_arr[idx]) {
int j, n_melt;
ir_node **new_ck_in;
- ir_node *new_ck;
ir_node *sched_pt = NULL;
n_melt = 1;
kill_node(melt_arr[j]);
}
+ ir_node *const new_ck = be_new_CopyKeep(get_nodes_block(ref), be_get_CopyKeep_op(ref), n_melt, new_ck_in);
#ifdef KEEP_ALIVE_COPYKEEP_HACK
- new_ck = be_new_CopyKeep(entry->cls, get_nodes_block(ref), be_get_CopyKeep_op(ref), n_melt, new_ck_in, mode_ANY);
keep_alive(new_ck);
-#else
- new_ck = be_new_CopyKeep(entry->cls, 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 kept inputs */
}
}
-/**
- * Walks over all nodes to assure register constraints.
- *
- * @param birg The birg structure containing the irg
- */
-void assure_constraints(be_irg_t *birg) {
- ir_graph *irg = be_get_birg_irg(birg);
- constraint_env_t cenv;
- ir_nodemap_iterator_t map_iter;
- ir_nodemap_entry_t map_entry;
+void assure_constraints(ir_graph *irg)
+{
+ constraint_env_t cenv;
+ ir_nodehashmap_iterator_t map_iter;
+ ir_nodehashmap_entry_t map_entry;
FIRM_DBG_REGISTER(dbg_constr, "firm.be.lower.constr");
- cenv.birg = birg;
- ir_nodemap_init(&cenv.op_set);
+ cenv.irg = irg;
+ ir_nodehashmap_init(&cenv.op_set);
obstack_init(&cenv.obst);
irg_block_walk_graph(irg, NULL, assure_constraints_walker, &cenv);
melt_copykeeps(&cenv);
/* for all */
- foreach_ir_nodemap(&cenv.op_set, map_entry, map_iter) {
- op_copy_assoc_t *entry = map_entry.data;
- int n = ir_nodeset_size(&entry->copies);
+ foreach_ir_nodehashmap(&cenv.op_set, map_entry, map_iter) {
+ op_copy_assoc_t *entry = (op_copy_assoc_t*)map_entry.data;
+ size_t n = ir_nodeset_size(&entry->copies);
ir_node **nodes = ALLOCAN(ir_node*, n);
- ir_node *cp;
- ir_nodeset_iterator_t iter;
be_ssa_construction_env_t senv;
/* put the node in an array */
DB((dbg_constr, LEVEL_1, "\n"));
- /* introduce the copies for the operand and it's copies */
- be_ssa_construction_init(&senv, birg);
+ /* introduce the copies for the operand and its copies */
+ be_ssa_construction_init(&senv, irg);
be_ssa_construction_add_copy(&senv, map_entry.node);
be_ssa_construction_add_copies(&senv, nodes, n);
be_ssa_construction_fix_users(&senv, map_entry.node);
/* 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. */
ir_nodeset_destroy(&entry->copies);
}
- ir_nodemap_destroy(&cenv.op_set);
+ ir_nodehashmap_destroy(&cenv.op_set);
obstack_free(&cenv.obst, NULL);
- be_liveness_invalidate(be_get_birg_liveness(birg));
+ be_invalidate_live_sets(irg);
}
-
/**
* Push nodes that do not need to be permed through the Perm.
* This is commonly a reload cascade at block ends.
* @return 1, if there is something left to perm over.
* 0, if removed the complete perm.
*/
-static int push_through_perm(ir_node *perm, lower_env_t *env)
+static int push_through_perm(ir_node *perm)
{
ir_graph *irg = get_irn_irg(perm);
ir_node *bl = get_nodes_block(perm);
- ir_node *node;
int arity = get_irn_arity(perm);
int *map;
int *proj_map;
int n_moved;
int new_size;
ir_node *frontier = bl;
- ir_node *irn;
int i, n;
+ be_lv_t *lv = be_get_irg_liveness(irg);
/* get some Proj and find out the register class of that Proj. */
- const ir_edge_t *edge = get_irn_out_edge_first_kind(perm, EDGE_KIND_NORMAL);
- ir_node *one_proj = get_edge_src_irn(edge);
- const arch_register_class_t *cls = arch_get_irn_reg_class_out(one_proj);
+ ir_node *one_proj = get_edge_src_irn(get_irn_out_edge_first_kind(perm, EDGE_KIND_NORMAL));
+ const arch_register_class_t *cls = arch_get_irn_reg_class(one_proj);
assert(is_Proj(one_proj));
DB((dbg_permmove, LEVEL_1, "perm move %+F irg %+F\n", perm, irg));
* the Perm, increasing the register pressure by one.
*/
sched_foreach_reverse_from(sched_prev(perm), irn) {
- for (i = get_irn_arity(irn) - 1; i >= 0; --i) {
- ir_node *op = get_irn_n(irn, i);
- if (arch_irn_consider_in_reg_alloc(cls, op) &&
- !values_interfere(env->birg, op, one_proj)) {
+ be_foreach_use(irn, cls, in_req_, op, op_req_,
+ if (!be_values_interfere(lv, op, one_proj)) {
frontier = irn;
goto found_front;
}
- }
+ );
}
found_front:
DB((dbg_permmove, LEVEL_2, "\tfrontier: %+F\n", frontier));
- node = sched_prev(perm);
n_moved = 0;
- while (!sched_is_begin(node)) {
+ for (;;) {
+ ir_node *const node = sched_prev(perm);
+ if (node == frontier)
+ break;
+
const arch_register_req_t *req;
int input = -1;
- ir_node *proj;
+ ir_node *proj = NULL;
/* search if node is a INPUT of Perm */
foreach_out_edge(perm, edge) {
/* 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(node, modify_flags))
break;
- req = arch_get_register_req_out(node);
+ req = arch_get_irn_register_req(node);
if (req->type != arch_register_req_type_normal)
break;
for (i = get_irn_arity(node) - 1; i >= 0; --i) {
arch_set_irn_register(node, arch_get_irn_register(proj));
/* reroute all users of the proj to the moved node. */
- edges_reroute(proj, node, irg);
-
- /* and kill it */
- set_Proj_pred(proj, new_Bad());
- kill_node(proj);
+ exchange(proj, node);
bitset_set(moved, input);
n_moved++;
-
- node = sched_prev(node);
}
/* well, we could not push anything through the perm */
- if(n_moved == 0)
+ if (n_moved == 0)
return 1;
new_size = arity - n_moved;
- if(new_size == 0) {
+ if (new_size == 0) {
sched_remove(perm);
kill_node(perm);
return 0;
if (!be_is_Perm(irn))
return;
- perm_stayed = push_through_perm(irn, walk_env);
+ perm_stayed = push_through_perm(irn);
if (perm_stayed)
- lower_perm_node(irn, walk_env);
+ lower_perm_node(irn, (lower_env_t*)walk_env);
}
-/**
- * Walks over all blocks in an irg and performs lowering need to be
- * done after register allocation (e.g. perm lowering).
- *
- * @param birg The birg object
- * @param do_copy 1 == resolve cycles with a free reg if available
- */
-void lower_nodes_after_ra(be_irg_t *birg, int do_copy) {
+void lower_nodes_after_ra(ir_graph *irg, int do_copy)
+{
lower_env_t env;
- ir_graph *irg;
FIRM_DBG_REGISTER(dbg, "firm.be.lower");
FIRM_DBG_REGISTER(dbg_permmove, "firm.be.lower.permmove");
- env.birg = birg;
+ env.irg = irg;
env.do_copy = do_copy;
/* we will need interference */
- be_liveness_assure_chk(be_get_birg_liveness(birg));
+ be_assure_live_chk(irg);
- irg = be_get_birg_irg(birg);
irg_walk_graph(irg, NULL, lower_nodes_after_ra_walker, &env);
}