2 * Copyright (C) 1995-2011 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
37 static copy_attr_func old_phi_copy_attr;
39 void be_info_new_node(ir_graph *irg, ir_node *node)
44 /* Projs need no be info, all info is fetched from their predecessor */
48 obst = be_get_be_obst(irg);
49 info = OALLOCZ(obst, backend_info_t);
51 assert(node->backend_info == NULL);
52 node->backend_info = info;
55 * Set backend info for some middleend nodes which still appear in
58 switch (get_irn_opcode(node)) {
68 info->flags |= arch_irn_flags_not_scheduled;
69 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
70 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
71 info->out_infos[0].req = arch_no_register_req;
74 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
75 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
76 info->out_infos[0].req = arch_no_register_req;
83 static void new_phi_copy_attr(ir_graph *irg, const ir_node *old_node,
86 backend_info_t *old_info = be_get_info(old_node);
87 backend_info_t *new_info = be_get_info(new_node);
89 *new_info = *old_info;
91 old_phi_copy_attr(irg, old_node, new_node);
94 int be_nodes_equal(const ir_node *node1, const ir_node *node2)
96 const backend_info_t *info1 = be_get_info(node1);
97 const backend_info_t *info2 = be_get_info(node2);
98 size_t len = ARR_LEN(info1->out_infos);
99 int arity = get_irn_arity(node1);
103 if (ARR_LEN(info2->out_infos) != len)
106 assert(arity == get_irn_arity(node2));
108 for (in = 0; in < arity; ++in) {
109 if (info1->in_reqs[in] != info2->in_reqs[in])
113 for (i = 0; i < len; ++i) {
114 const reg_out_info_t *out1 = &info1->out_infos[i];
115 const reg_out_info_t *out2 = &info2->out_infos[i];
116 if (out1->reg != out2->reg)
118 if (!reg_reqs_equal(out1->req, out2->req))
125 static void init_walker(ir_node *node, void *data)
127 ir_graph *irg = get_irn_irg(node);
129 be_info_new_node(irg, node);
132 static bool initialized = false;
134 void be_info_init(void)
137 panic("double initialization of be_info");
139 old_phi_copy_attr = op_Phi->ops.copy_attr;
140 op_Phi->ops.copy_attr = new_phi_copy_attr;
143 /* phis have register and register requirements now which we want to dump */
144 assert(op_Phi->ops.dump_node == NULL);
145 op_Phi->ops.dump_node = be_dump_phi_reg_reqs;
149 * Edge hook to dump the schedule edges.
151 static void sched_edge_hook(FILE *F, const ir_node *irn)
155 if (get_irn_irg(irn)->be_data == NULL)
158 if (sched_is_scheduled(irn) && sched_has_prev(irn) && !is_Block(irn)) {
159 ir_node *prev = sched_prev(irn);
160 fprintf(F, "edge:{sourcename: ");
161 print_nodeid(F, irn);
162 fprintf(F, " targetname: ");
163 print_nodeid(F, prev);
164 fprintf(F, " color:magenta}\n");
168 void be_info_init_irg(ir_graph *irg)
170 irg_walk_anchors(irg, init_walker, NULL, NULL);
172 set_dump_node_edge_hook(sched_edge_hook);
175 void be_info_free(void)
178 panic("called without prior init");
180 assert(op_Phi->ops.copy_attr == new_phi_copy_attr);
181 op_Phi->ops.copy_attr = old_phi_copy_attr;
184 assert(op_Phi->ops.dump_node == be_dump_phi_reg_reqs);
185 op_Phi->ops.dump_node = NULL;
188 int be_info_initialized(const ir_graph *irg)