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
38 static copy_attr_func old_phi_copy_attr;
40 void be_info_new_node(ir_graph *irg, ir_node *node)
45 /* Projs need no be info, all info is fetched from their predecessor */
49 obst = be_get_be_obst(irg);
50 info = OALLOCZ(obst, backend_info_t);
52 assert(node->backend_info == NULL);
53 node->backend_info = info;
56 * Set backend info for some middleend nodes which still appear in
59 switch (get_irn_opcode(node)) {
69 info->flags |= arch_irn_flags_not_scheduled;
70 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
71 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
72 info->out_infos[0].req = arch_no_register_req;
75 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
76 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
77 info->out_infos[0].req = arch_no_register_req;
84 static void new_phi_copy_attr(ir_graph *irg, const ir_node *old_node,
87 backend_info_t *old_info = be_get_info(old_node);
88 backend_info_t *new_info = be_get_info(new_node);
90 *new_info = *old_info;
92 old_phi_copy_attr(irg, old_node, new_node);
95 int be_nodes_equal(const ir_node *node1, const ir_node *node2)
97 const backend_info_t *info1 = be_get_info(node1);
98 const backend_info_t *info2 = be_get_info(node2);
99 size_t len = ARR_LEN(info1->out_infos);
100 int arity = get_irn_arity(node1);
104 if (ARR_LEN(info2->out_infos) != len)
107 assert(arity == get_irn_arity(node2));
109 for (in = 0; in < arity; ++in) {
110 if (info1->in_reqs[in] != info2->in_reqs[in])
114 for (i = 0; i < len; ++i) {
115 const reg_out_info_t *out1 = &info1->out_infos[i];
116 const reg_out_info_t *out2 = &info2->out_infos[i];
117 if (out1->reg != out2->reg)
119 if (!reg_reqs_equal(out1->req, out2->req))
126 static void init_walker(ir_node *node, void *data)
128 ir_graph *irg = get_irn_irg(node);
130 be_info_new_node(irg, node);
133 static bool initialized = false;
135 void be_info_init(void)
138 panic("double initialization of be_info");
140 old_phi_copy_attr = op_Phi->ops.copy_attr;
141 op_Phi->ops.copy_attr = new_phi_copy_attr;
144 /* phis have register and register requirements now which we want to dump */
145 assert(op_Phi->ops.dump_node == NULL);
146 op_Phi->ops.dump_node = be_dump_phi_reg_reqs;
150 * Edge hook to dump the schedule edges.
152 static void sched_edge_hook(FILE *F, const ir_node *irn)
154 if (get_irn_irg(irn)->be_data == NULL)
157 if (sched_is_scheduled(irn) && !is_Block(irn)) {
158 ir_node *const prev = sched_prev(irn);
159 if (!sched_is_begin(prev)) {
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");
169 void be_info_init_irg(ir_graph *irg)
171 irg_walk_anchors(irg, init_walker, NULL, NULL);
173 set_dump_node_edge_hook(sched_edge_hook);
176 void be_info_free(void)
179 panic("called without prior init");
181 assert(op_Phi->ops.copy_attr == new_phi_copy_attr);
182 op_Phi->ops.copy_attr = old_phi_copy_attr;
185 assert(op_Phi->ops.dump_node == be_dump_phi_reg_reqs);
186 op_Phi->ops.dump_node = NULL;
189 int be_info_initialized(const ir_graph *irg)