#define get_reg_cls(irn) (arch_get_irn_reg_class(arch_env, irn, arch_pos_make_out(0)))
#define is_curr_reg_class(irn) (get_reg_cls(p) == chordal_env->cls)
-static ir_node *get_perm(be_main_session_env_t *session, be_chordal_env_t *chordal_env, ir_node *block) {
+static ir_node *get_or_insert_perm(be_main_session_env_t *session, be_chordal_env_t *chordal_env, ir_node *block) {
block2perm_t find, *found;
ir_node *p;
set *b2p = chordal_env->data;
if (! (is_Perm(p) && is_curr_reg_class(p)))
p = insert_Perm_after(session, chordal_env->cls, p);
- /* insert perm into pset */
- found->perm = p;
- return p;
+ /* insert perm into pset */
+ found->perm = p;
+ return p;
}
+#define is_pinned(irn) ((irn)->link)
+#define get_pinning_block(irn) ((ir_node *)(irn)->link)
+#define pin_irn(irn, lock) ((irn)->link = lock)
+
/**
* Adjusts the register allocation for the phi-operands
* by inserting perm nodes, if necessary.
* @param phi The phi node to adjust operands for
*/
-static void adjust_arguments(be_main_session_env_t *session, be_chordal_env_t *chordal_env, const ir_node *phi) {
+static void adjust_arguments(be_main_session_env_t *session, be_chordal_env_t *chordal_env, ir_node *phi) {
int i, max;
- ir_node *arg;
- const arch_register_t *phi_reg, *arg_reg, *proj_reg;
- const ir_edge_t *edge;
- ir_node *phi_block = get_nodes_block(phi);
+ ir_node *arg, *phi_block, *arg_block;
+ const arch_register_t *phi_reg, *arg_reg;
+ const arch_register_class_t *cls;
assert(is_Phi(phi) && "Can only handle phi-destruction :)");
+ cls = arch_get_irn_reg_class(session->main_env->arch_env, phi, arch_pos_make_out(0));
+ phi_block = get_nodes_block(phi);
phi_reg = get_reg(phi);
/* all arguments of the phi */
for(i=0, max=get_irn_arity(phi); i<max; ++i) {
+ ir_node *perm;
+
arg = get_irn_n(phi, i);
+ arg_block = get_nodes_block(arg);
arg_reg = get_reg(arg);
+ perm = get_Proj_pred(arg);
+
/* if registers don't match ...*/
if (phi_reg != arg_reg) {
- ir_node *perm;
-
- perm = get_perm(session, chordal_env, get_nodes_block(get_irn_n(phi_block, i)));
-
- /*
- * Look at the projs of the perm.
- * Find the one which corresponds to the phi argument
- * This is done via the proj number: If
- * the i-th argument of the perm is the old Phi
- * argument, then the Proj with number i is the
- * one we want.
- */
- foreach_out_edge(perm, edge) {
- ir_node *proj = get_edge_src_irn(edge);
- int proj_nr = get_Proj_proj(proj);
-
- if(get_irn_n(perm, proj_nr) == arg) {
- assert(get_reg(proj) == NULL);
- set_reg(proj, phi_reg);
- }
+
+ /* First check if there is another phi in the same block
+ * having arg at the same pos in its arg-list */
+ if (!is_pinned(arg)) {
+ ir_node *other_phi = phi;
+ while ((other_phi = other_phi->link) != phi) {
+ assert(is_Phi(other_phi) && "link fields are screwed up");
+ if (get_irn_n(other_phi, i) == arg && get_reg(other_phi) == arg_reg)
+ pin_irn(arg, phi_block);
+ }
+ }
+
+ if (is_pinned(arg)) {
+ ir_node *dupl, *tmp;
+ /* Arg is pinned. So another phi has locked it.
+ * Hence, a duplicate must be inserted */
+ assert(get_pinning_block(arg) == phi_block && "If arg is pinned it must be due to a phi in the same block");
+ dupl = new_Copy(session->main_env->node_factory, cls, session->irg, arg_block, arg);
+ set_irn_n(phi, i, dupl);
+ set_reg(dupl, phi_reg);
+
+ /* Add dupl to schedule */
+ tmp = sched_next(perm);
+ while (is_Proj(tmp) && sched_has_next(tmp))
+ tmp = sched_next(tmp);
+ sched_add_after(tmp, dupl);
+
+ /* Add dupl to chained list of duplicates. Ptrs starting at the Perm */
+ tmp = perm;
+ while (tmp->link)
+ tmp = tmp->link;
+ tmp->link = dupl;
+ dupl->link = NULL;
+
+ /* now the arg is the dupl */
+ arg = dupl;
+ } else {
+ /* Arg is not pinned. So set its color to the color of the phi.
+ * If the phi color is used by another proj of this perm
+ * one must NOT swap the colors. Proof: Critical edges removed,
+ * livein(PhiBl) = liveout(ArgBl), if all phis are processed then
+ * every color is used exactly once.
+ */
+ set_reg(arg, phi_reg);
}
}
+ /* Now the color of the arg and the phi-result are equal.
+ * Pin it, so everyone knows
+ * An arg never is a phi, because perms were inserted. So the link field is free */
+ pin_irn(arg, phi_block);
}
}
-static void checker(be_chordal_env_t *chordal_env) {
- pmap_entry *pme;
- int i, max;
-
- /* iterate over all blocks */
- pmap_foreach(chordal_env->border_heads, pme) {
- border_t *curr;
- struct list_head *head = pme->value;
-
- /* iterate over the first ops in the block */
- list_for_each_entry_reverse(border_t, curr, head, list)
- if (curr->is_def && curr->is_real && is_Phi(curr->irn)) {
- const arch_register_t *phi_reg, *arg_reg;
- if (!is_Phi(curr->irn))
- break;
-
- phi_reg = get_reg(curr->irn);
- /* iterate over all args of phi */
- for(i=0, max=get_irn_arity(curr->irn); i<max; ++i) {
- arg_reg = get_reg(get_irn_n(curr->irn, i));
- if(phi_reg != arg_reg)
- ir_printf("register differ: %s %s\n", phi_reg->name, arg_reg->name);
- }
- }
- }
-}
+//static void collect_phis(ir_node *node, void *env) {
+// pset *phis = env;
+// if (is_Phi(node))
+// pset_insert_ptr(phis, node);
+//}
void be_ssa_destruction(be_main_session_env_t *session, be_chordal_env_t *chordal_env) {
+ pset *all_phis;
pmap_entry *pme;
set *b2p;
+ int i, max;
+ ir_node *first_phi, *recent_phi;
b2p = new_set(set_cmp_b2p, 32);
chordal_env->data = b2p;
- /* iterate over all blocks */
+
+ /* get all phis */
+// all_phis = pset_new_ptr_default();
+// irg_walk_graph(session->irg, collect_phis, NULL, all_phis);
+
+
+ /* place perms in cf-preds of phis */
+ pmap_foreach(chordal_env->border_heads, pme) {
+ border_t *curr;
+ struct list_head *head = pme->value;
+
+ first_phi = NULL;
+ /* iterate over the first ops in the block until a non-phi is reached */
+ list_for_each_entry(border_t, curr, head, list) {
+ ir_node *phi = curr->irn;
+ if (curr->is_def && curr->is_real) {
+ if (!is_Phi(phi))
+ break;
+
+ phi->link = NULL;
+ /* chain of phis in a block */
+ if (first_phi == NULL)
+ first_phi = phi;
+ else
+ recent_phi->link = phi;
+ recent_phi = phi;
+
+ /* insert perms */
+ for(i=0, max=get_irn_arity(phi); i<max; ++i) {
+ ir_node *perm;
+
+ ir_printf("Placing perm for %+F \n", phi);
+ perm = get_or_insert_perm(session, chordal_env, get_Block_cfgpred_block(get_nodes_block(phi), i));
+ perm->link = NULL;
+ }
+ }
+ }
+ if (first_phi)
+ recent_phi->link = first_phi;
+ }
+
+ dump_ir_block_graph(session->irg, "-prems");
+
+ /* iterate over all blocks and correct color of arguments*/
pmap_foreach(chordal_env->border_heads, pme) {
border_t *curr;
struct list_head *head = pme->value;
/* iterate over the first ops in the block until a non-phi is reached */
- list_for_each_entry_reverse(border_t, curr, head, list)
+ list_for_each_entry(border_t, curr, head, list)
if (curr->is_def && curr->is_real) {
if (!is_Phi(curr->irn))
break;
adjust_arguments(session, chordal_env, curr->irn);
}
}
+
+
dump_ir_block_graph_sched(session->irg, "-ssa-destr");
del_set(b2p);
- checker(chordal_env);
+}
+
+void be_ssa_destruction_check(be_main_session_env_t *session, be_chordal_env_t *chordal_env) {
+ pmap_entry *pme;
+ int i, max;
+
+ /* iterate over all blocks */
+ pmap_foreach(chordal_env->border_heads, pme) {
+ border_t *curr;
+ struct list_head *head = pme->value;
+
+ /* iterate over the first ops in the block */
+ list_for_each_entry(border_t, curr, head, list)
+ if (curr->is_def && curr->is_real && is_Phi(curr->irn)) {
+ const arch_register_t *phi_reg, *arg_reg;
+ if (!is_Phi(curr->irn))
+ break;
+
+ phi_reg = get_reg(curr->irn);
+ /* iterate over all args of phi */
+ for(i=0, max=get_irn_arity(curr->irn); i<max; ++i) {
+ ir_node *arg = get_irn_n(curr->irn, i);
+ arg_reg = get_reg(arg);
+ if(phi_reg != arg_reg)
+ ir_printf("register differ: %s %s\n", phi_reg->name, arg_reg->name);
+ if(!is_pinned(arg))
+ ir_printf("Warning: Arg not pinned %n %N\n", arg, arg);
+ }
+ }
+ }
}
projects / libfirm / blobdiff