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)
43 /* Projs need no be info, their tuple holds all information */
47 obst = be_get_birg_obst(current_ir_graph);
48 info = OALLOCZ(obst, backend_info_t);
50 assert(node->backend_info == NULL);
51 node->backend_info = info;
53 /* Hack! We still have middle end nodes in the backend (which was probably
54 a bad decision back then), which have no register constraints.
55 Set some none_requirements here.
57 if (get_irn_mode(node) != mode_T
58 && get_irn_opcode(node) <= iro_Last) {
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]));
61 info->out_infos[0].req = arch_no_register_req;
65 static void new_Phi_copy_attr(ir_graph *irg, const ir_node *old_node,
68 backend_info_t *old_info = be_get_info(old_node);
69 backend_info_t *new_info = be_get_info(new_node);
71 *new_info = *old_info;
73 old_phi_copy_attr(irg, old_node, new_node);
76 int be_infos_equal(const backend_info_t *info1, const backend_info_t *info2)
78 int len = ARR_LEN(info1->out_infos);
81 if (ARR_LEN(info2->out_infos) != len)
84 for (i = 0; i < len; ++i) {
85 const reg_out_info_t *out1 = &info1->out_infos[i];
86 const reg_out_info_t *out2 = &info2->out_infos[i];
87 if (out1->reg != out2->reg)
89 if (!reg_reqs_equal(out1->req, out2->req))
96 int be_nodes_equal(const ir_node *node1, const ir_node *node2)
98 backend_info_t *info1 = be_get_info(node1);
99 backend_info_t *info2 = be_get_info(node2);
100 return be_infos_equal(info1, info2);
103 static void init_walker(ir_node *node, void *data)
106 be_info_new_node(node);
109 static bool initialized = false;
111 void be_info_init(void)
114 panic("double initialization of be_info");
116 old_phi_copy_attr = op_Phi->ops.copy_attr;
117 op_Phi->ops.copy_attr = new_Phi_copy_attr;
120 /* phis have register and register requirements now which we want to dump */
121 assert(op_Phi->ops.dump_node == NULL);
122 op_Phi->ops.dump_node = be_dump_phi_reg_reqs;
125 void be_info_init_irg(ir_graph *irg)
127 irg_walk_anchors(irg, init_walker, NULL, NULL);
130 void be_info_free(void)
133 panic("be_info_free called without prior init");
135 assert(op_Phi->ops.copy_attr == new_Phi_copy_attr);
136 op_Phi->ops.copy_attr = old_phi_copy_attr;
139 assert(op_Phi->ops.dump_node == be_dump_phi_reg_reqs);
140 op_Phi->ops.dump_node = NULL;
143 int be_info_initialized(const ir_graph *irg)