forgot 2 files

[r23143]

diff --git a/ir/be/beinfo.c b/ir/be/beinfo.c
new file mode 100644 (file)
index 0000000..1e56921
--- /dev/null
+++ b/ir/be/beinfo.c
@@ -0,0 +1,128 @@
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @author      Matthias Braun
+ * @version     $Id$
+ */
+#include "config.h"
+
+#include "beinfo.h"
+#include "bearch_t.h"
+#include "irgwalk.h"
+#include "irnode_t.h"
+#include "error.h"
+
+static copy_attr_func  old_phi_copy_attr;
+
+void be_info_new_node(ir_node *node)
+{
+       if (is_Anchor(node))
+               return;
+
+       struct obstack *obst  = get_irg_obstack(current_ir_graph);
+       backend_info_t *info  = obstack_alloc(obst, sizeof(*info));
+       sched_info_t   *sinfo = &info->sched_info;
+
+       memset(info, 0, sizeof(*info));
+
+       sinfo->idx  = get_irn_idx(node);
+       INIT_LIST_HEAD(&sinfo->list);
+
+       if (is_Phi(node)) {
+               info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
+               memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
+       }
+       assert(node->backend_info == NULL);
+       node->backend_info = info;
+}
+
+static void new_Phi_copy_attr(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);
+}
+
+int be_info_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);
+       int             len   = ARR_LEN(info1->out_infos);
+       int             i;
+
+       if (ARR_LEN(info2->out_infos) != len)
+               return 0;
+
+       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;
+               if (!reg_reqs_equal(out1->req, out2->req))
+                       return 0;
+       }
+
+       /* TODO: in reqs */
+
+       return 1;
+}
+
+static void init_walker(ir_node *node, void *data)
+{
+       (void) data;
+       be_info_new_node(node);
+}
+
+static int initialized = 0;
+
+void be_info_init(void)
+{
+       if (initialized == 1)
+               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;
+}
+
+void be_info_init_irg(ir_graph *irg)
+{
+       irg_walk_anchors(irg, init_walker, NULL, NULL);
+}
+
+void be_info_free(void)
+{
+       if (!initialized)
+               panic("be_info_free called without prior init");
+
+       assert(op_Phi->ops.copy_attr == new_Phi_copy_attr);
+       op_Phi->ops.copy_attr = old_phi_copy_attr;
+       initialized = 0;
+}
+
+int be_info_initialized(const ir_graph *irg)
+{
+       (void) irg;
+       return initialized;
+}

diff --git a/ir/be/beinfo.h b/ir/be/beinfo.h
new file mode 100644 (file)
index 0000000..c373b29
--- /dev/null
+++ b/ir/be/beinfo.h
@@ -0,0 +1,75 @@
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief       additional backend node infos
+ * @author      Matthias Braun
+ * @version     $Id$
+ */
+#ifndef FIRM_BE_BEINFO_H
+#define FIRM_BE_BEINFO_H
+
+#include "bearch.h"
+#include "irphase_t.h"
+#include "irphases_t.h"
+
+typedef unsigned int sched_timestep_t;
+
+/**
+ * The schedule structure which is present at each ir node.
+ *
+ * Currently, only basic blocks are scheduled. The list head of
+ * every block schedule list is the Block list.
+ */
+typedef struct sched_info_t {
+       struct list_head list;         /**< The list head to list the nodes in a schedule. */
+       unsigned idx;                  /**< The node index of the nodes this schedule info belongs to. */
+       sched_timestep_t time_step;    /**< If a is after b in a schedule, its time step is larger than b's. */
+       unsigned scheduled : 1;        /**< 1, if the node is in the schedule of the block, 0 else. */
+} sched_info_t;
+
+typedef struct reg_out_info_t {
+       const arch_register_t     *reg;
+       const arch_register_req_t *req;
+} reg_out_info_t;
+
+typedef struct backend_info_t {
+       sched_info_t                sched_info;
+       const arch_register_req_t **in_reqs;
+       reg_out_info_t             *out_infos;
+       arch_irn_flags_t            flags;
+} backend_info_t;
+
+static inline backend_info_t *be_get_info(const ir_node *node)
+{
+       backend_info_t *info = node->backend_info;
+       return info;
+}
+
+void be_info_init(void);
+void be_info_free(void);
+void be_info_init_irg(ir_graph *irg);
+void be_info_new_node(ir_node *node);
+void be_info_duplicate(const ir_node *old_node, ir_node *new_node);
+int be_info_initialized(const ir_graph *irg);
+
+int be_info_equal(const ir_node *node1, const ir_node *node2);
+
+#endif