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
38 static copy_attr_func old_phi_copy_attr;
40 void be_info_new_node(ir_node *node)
45 /* Projs need no be info, their tuple holds all information */
49 obst = be_get_be_obst(current_ir_graph);
50 info = OALLOCZ(obst, backend_info_t);
52 assert(node->backend_info == NULL);
53 node->backend_info = info;
55 /* Hack! We still have middle end nodes in the backend (which was probably
56 a bad decision back then), which have no register constraints.
57 Set some none_requirements here.
59 if (get_irn_mode(node) != mode_T
60 && get_irn_opcode(node) <= iro_Last) {
61 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
62 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
63 info->out_infos[0].req = arch_no_register_req;
67 static void new_Phi_copy_attr(ir_graph *irg, const ir_node *old_node,
70 backend_info_t *old_info = be_get_info(old_node);
71 backend_info_t *new_info = be_get_info(new_node);
73 *new_info = *old_info;
75 old_phi_copy_attr(irg, old_node, new_node);
78 int be_nodes_equal(ir_node *node1, ir_node *node2)
80 const backend_info_t *info1 = be_get_info(node1);
81 const backend_info_t *info2 = be_get_info(node2);
82 int len = ARR_LEN(info1->out_infos);
83 int arity = get_irn_arity(node1);
86 if (ARR_LEN(info2->out_infos) != len)
89 assert(arity == get_irn_arity(node2));
91 for (i = 0; i < arity; ++i) {
92 if (info1->in_reqs[i] != info2->in_reqs[i])
96 for (i = 0; i < len; ++i) {
97 const reg_out_info_t *out1 = &info1->out_infos[i];
98 const reg_out_info_t *out2 = &info2->out_infos[i];
99 if (out1->reg != out2->reg)
101 if (!reg_reqs_equal(out1->req, out2->req))
108 static void init_walker(ir_node *node, void *data)
111 be_info_new_node(node);
114 static bool initialized = false;
116 void be_info_init(void)
119 panic("double initialization of be_info");
121 old_phi_copy_attr = op_Phi->ops.copy_attr;
122 op_Phi->ops.copy_attr = new_Phi_copy_attr;
125 /* phis have register and register requirements now which we want to dump */
126 assert(op_Phi->ops.dump_node == NULL);
127 op_Phi->ops.dump_node = be_dump_phi_reg_reqs;
131 * Edge hook to dump the schedule edges.
133 static void sched_edge_hook(FILE *F, ir_node *irn)
137 if (get_irn_irg(irn)->be_data == NULL)
140 if (sched_is_scheduled(irn) && sched_has_prev(irn)) {
141 ir_node *prev = sched_prev(irn);
142 fprintf(F, "edge:{sourcename:\"");
144 fprintf(F, "\" targetname:\"");
146 fprintf(F, "\" color:magenta}\n");
150 void be_info_init_irg(ir_graph *irg)
152 irg_walk_anchors(irg, init_walker, NULL, NULL);
154 set_dump_node_edge_hook(sched_edge_hook);
157 void be_info_free(void)
160 panic("be_info_free called without prior init");
162 assert(op_Phi->ops.copy_attr == new_Phi_copy_attr);
163 op_Phi->ops.copy_attr = old_phi_copy_attr;
166 assert(op_Phi->ops.dump_node == be_dump_phi_reg_reqs);
167 op_Phi->ops.dump_node = NULL;
170 int be_info_initialized(const ir_graph *irg)