refactoring: split stackframe handling completely from beabi struct

[libfirm] / ir / be / beinfo.c

diff --git a/ir/be/beinfo.c b/ir/be/beinfo.c
index 02f52d9..837d223 100644 (file)
--- a/ir/be/beinfo.c
+++ b/ir/be/beinfo.c
@@ -24,10 +24,15 @@
  */
 #include "config.h"
 
+#include <stdbool.h>
+
 #include "beinfo.h"
-#include "bearch_t.h"
+#include "bearch.h"
+#include "benode.h"
+#include "besched.h"
 #include "irgwalk.h"
 #include "irnode_t.h"
+#include "irdump_t.h"
 #include "error.h"
 
 static copy_attr_func  old_phi_copy_attr;
@@ -36,60 +41,65 @@ void be_info_new_node(ir_node *node)
 {
        struct obstack *obst;
        backend_info_t *info;
-       sched_info_t   *sinfo;
 
-       if (is_Anchor(node))
+       /* Projs need no be info, their tuple holds all information */
+       if (is_Proj(node))
                return;
 
-       obst  = get_irg_obstack(current_ir_graph);
-       info  = obstack_alloc(obst, sizeof(*info));
-       sinfo = &info->sched_info;
-
-       memset(info, 0, sizeof(*info));
+       obst = be_get_be_obst(current_ir_graph);
+       info = OALLOCZ(obst, backend_info_t);
 
-       sinfo->idx = get_irn_idx(node);
-       INIT_LIST_HEAD(&sinfo->list);
+       assert(node->backend_info == NULL);
+       node->backend_info = info;
 
-       if (is_Phi(node)) {
+       /* Hack! We still have middle end nodes in the backend (which was probably
+          a bad decision back then), which have no register constraints.
+          Set some none_requirements here.
+        */
+       if (get_irn_mode(node) != mode_T
+                       && get_irn_opcode(node) <= iro_Last) {
                info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
                memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
+               info->out_infos[0].req = arch_no_register_req;
        }
-       assert(node->backend_info == NULL);
-       node->backend_info = info;
 }
 
-static void new_Phi_copy_attr(const ir_node *old_node, ir_node *new_node)
+static void new_Phi_copy_attr(ir_graph *irg, const ir_node *old_node,
+                              ir_node *new_node)
 {
-       struct obstack *obst  = get_irg_obstack(get_irn_irg(new_node));
        backend_info_t *old_info = be_get_info(old_node);
        backend_info_t *new_info = be_get_info(new_node);
 
-       old_phi_copy_attr(old_node, new_node);
-       new_info->out_infos = DUP_ARR_D(reg_out_info_t, obst, old_info->out_infos);
+       *new_info = *old_info;
+
+       old_phi_copy_attr(irg, old_node, new_node);
 }
 
-int be_info_equal(const ir_node *node1, const ir_node *node2)
+int be_infos_equal(const backend_info_t *info1, const backend_info_t *info2)
 {
-       backend_info_t *info1 = be_get_info(node1);
-       backend_info_t *info2 = be_get_info(node2);
-       int             len   = ARR_LEN(info1->out_infos);
-       int             i;
+       int len = ARR_LEN(info1->out_infos);
+       int i;
 
        if (ARR_LEN(info2->out_infos) != len)
-               return 0;
+               return false;
 
        for (i = 0; i < len; ++i) {
                const reg_out_info_t *out1 = &info1->out_infos[i];
                const reg_out_info_t *out2 = &info2->out_infos[i];
                if (out1->reg != out2->reg)
-                       return 0;
+                       return false;
                if (!reg_reqs_equal(out1->req, out2->req))
-                       return 0;
+                       return false;
        }
 
-       /* TODO: in reqs */
+       return true;
+}
 
-       return 1;
+int be_nodes_equal(const ir_node *node1, const ir_node *node2)
+{
+       backend_info_t *info1 = be_get_info(node1);
+       backend_info_t *info2 = be_get_info(node2);
+       return be_infos_equal(info1, info2);
 }
 
 static void init_walker(ir_node *node, void *data)
@@ -98,21 +108,47 @@ static void init_walker(ir_node *node, void *data)
        be_info_new_node(node);
 }
 
-static int initialized = 0;
+static bool initialized = false;
 
 void be_info_init(void)
 {
-       if (initialized == 1)
+       if (initialized)
                panic("double initialization of be_info");
 
        old_phi_copy_attr = op_Phi->ops.copy_attr;
        op_Phi->ops.copy_attr = new_Phi_copy_attr;
-       initialized = 1;
+       initialized = true;
+
+       /* phis have register and register requirements now which we want to dump */
+       assert(op_Phi->ops.dump_node == NULL);
+       op_Phi->ops.dump_node = be_dump_phi_reg_reqs;
+}
+
+/**
+ * Edge hook to dump the schedule edges.
+ */
+static void sched_edge_hook(FILE *F, ir_node *irn)
+{
+       if (is_Proj(irn))
+               return;
+       if (get_irn_irg(irn)->be_data == NULL)
+               return;
+
+       if (sched_is_scheduled(irn) && sched_has_prev(irn)) {
+               ir_node *prev = sched_prev(irn);
+               fprintf(F, "edge:{sourcename:\"");
+               PRINT_NODEID(irn);
+               fprintf(F, "\" targetname:\"");
+               PRINT_NODEID(prev);
+               fprintf(F, "\" color:magenta}\n");
+       }
 }
 
 void be_info_init_irg(ir_graph *irg)
 {
        irg_walk_anchors(irg, init_walker, NULL, NULL);
+
+       set_dump_node_edge_hook(sched_edge_hook);
 }
 
 void be_info_free(void)
@@ -122,7 +158,10 @@ void be_info_free(void)
 
        assert(op_Phi->ops.copy_attr == new_Phi_copy_attr);
        op_Phi->ops.copy_attr = old_phi_copy_attr;
-       initialized = 0;
+       initialized = false;
+
+       assert(op_Phi->ops.dump_node == be_dump_phi_reg_reqs);
+       op_Phi->ops.dump_node = NULL;
 }
 
 int be_info_initialized(const ir_graph *irg)