2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @author Matthias Braun
36 static copy_attr_func old_phi_copy_attr;
38 void be_info_new_node(ir_node *node)
47 if (is_Proj(node)) // Projs need no be info, their tuple holds all information
50 obst = get_irg_obstack(current_ir_graph);
51 info = obstack_alloc(obst, sizeof(*info));
52 sinfo = &info->sched_info;
54 memset(info, 0, sizeof(*info));
59 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
60 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
62 assert(node->backend_info == NULL);
63 node->backend_info = info;
66 static void new_Phi_copy_attr(const ir_node *old_node, ir_node *new_node)
68 struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
69 backend_info_t *old_info = be_get_info(old_node);
70 backend_info_t *new_info = be_get_info(new_node);
72 old_phi_copy_attr(old_node, new_node);
73 new_info->out_infos = DUP_ARR_D(reg_out_info_t, obst, old_info->out_infos);
76 int be_info_equal(const ir_node *node1, const ir_node *node2)
78 backend_info_t *info1 = be_get_info(node1);
79 backend_info_t *info2 = be_get_info(node2);
80 int len = ARR_LEN(info1->out_infos);
83 if (ARR_LEN(info2->out_infos) != len)
86 for (i = 0; i < len; ++i) {
87 const reg_out_info_t *out1 = &info1->out_infos[i];
88 const reg_out_info_t *out2 = &info2->out_infos[i];
89 if (out1->reg != out2->reg)
91 if (!reg_reqs_equal(out1->req, out2->req))
100 static void init_walker(ir_node *node, void *data)
103 be_info_new_node(node);
106 static bool initialized = false;
108 void be_info_init(void)
111 panic("double initialization of be_info");
113 old_phi_copy_attr = op_Phi->ops.copy_attr;
114 op_Phi->ops.copy_attr = new_Phi_copy_attr;
117 /* phis have register and register requirements now which we want to dump */
118 assert(op_Phi->ops.dump_node == NULL);
119 op_Phi->ops.dump_node = be_dump_phi_reg_reqs;
122 void be_info_init_irg(ir_graph *irg)
124 irg_walk_anchors(irg, init_walker, NULL, NULL);
127 void be_info_free(void)
130 panic("be_info_free called without prior init");
132 assert(op_Phi->ops.copy_attr == new_Phi_copy_attr);
133 op_Phi->ops.copy_attr = old_phi_copy_attr;
136 assert(op_Phi->ops.dump_node == be_dump_phi_reg_reqs);
137 op_Phi->ops.dump_node = NULL;
140 int be_info_initialized(const ir_graph *irg)