2 * Copyright (C) 1995-2007 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 * @brief Peephole optimisation framework keeps track of which registers contain which values
23 * @author Matthias Braun
30 #include "bepeephole.h"
32 #include "iredges_t.h"
40 #include "besched_t.h"
42 static const arch_env_t *arch_env;
44 ir_node ***register_values;
46 static void clear_reg_value(ir_node *node)
48 const arch_register_t *reg;
49 const arch_register_class_t *cls;
53 if(!mode_is_data(get_irn_mode(node)))
56 reg = arch_get_irn_register(arch_env, node);
58 panic("No register assigned at %+F\n", node);
60 if(arch_register_type_is(reg, virtual))
62 cls = arch_register_get_class(reg);
63 reg_idx = arch_register_get_index(reg);
64 cls_idx = arch_register_class_index(cls);
66 //assert(register_values[cls_idx][reg_idx] != NULL);
67 register_values[cls_idx][reg_idx] = NULL;
70 static void set_reg_value(ir_node *node)
72 const arch_register_t *reg;
73 const arch_register_class_t *cls;
77 if(!mode_is_data(get_irn_mode(node)))
80 reg = arch_get_irn_register(arch_env, node);
82 panic("No register assigned at %+F\n", node);
84 if(arch_register_type_is(reg, virtual))
86 cls = arch_register_get_class(reg);
87 reg_idx = arch_register_get_index(reg);
88 cls_idx = arch_register_class_index(cls);
92 ir_node *old_value = register_values[cls_idx][reg_idx];
93 assert(old_value == NULL || old_value == node);
96 register_values[cls_idx][reg_idx] = node;
99 static void clear_defs(ir_node *node)
101 /* clear values defined */
102 if(get_irn_mode(node) == mode_T) {
103 const ir_edge_t *edge;
104 foreach_out_edge(node, edge) {
105 ir_node *proj = get_edge_src_irn(edge);
106 clear_reg_value(proj);
109 clear_reg_value(node);
113 static void set_uses(ir_node *node)
117 /* set values used */
118 arity = get_irn_arity(node);
119 for(i = 0; i < arity; ++i) {
120 ir_node *in = get_irn_n(node, i);
125 static void process_block(ir_node *block, void *data)
127 arch_isa_t *isa = arch_env->isa;
134 /* construct initial register assignment */
135 n_classes = arch_isa_get_n_reg_class(isa);
136 for(i = 0; i < n_classes; ++i) {
137 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
138 unsigned n_regs = arch_register_class_n_regs(cls);
139 memset(register_values[i], 0, sizeof(ir_node*) * n_regs);
142 assert(lv->nodes && "live sets must be computed");
143 be_lv_foreach(lv, block, be_lv_state_end, l) {
144 ir_node *node = be_lv_get_irn(lv, block, l);
148 /* walk the block from last insn to the first */
149 node = sched_last(block);
150 for( ; !sched_is_begin(node); node = sched_prev(node)) {
152 peephole_opt_func func;
160 op = get_irn_op(node);
161 func = (peephole_opt_func) op->ops.generic;
163 ir_node *new_node = func(node);
164 if(new_node != NULL && new_node != node) {
165 be_liveness_remove(lv, node);
166 be_liveness_introduce(lv, new_node);
174 void be_peephole_opt(be_irg_t *birg)
177 ir_graph *irg = be_get_birg_irg(birg);
181 /* we sometimes find BadE nodes in float apps like optest_float.c or
182 * kahansum.c for example... */
183 be_liveness_invalidate(birg->lv);
184 be_liveness_assure_sets(be_assure_liveness(birg));
186 arch_env = be_get_birg_arch_env(birg);
187 lv = be_get_birg_liveness(birg);
190 n_classes = arch_isa_get_n_reg_class(isa);
191 register_values = alloca(sizeof(register_values[0]) * n_classes);
192 for(i = 0; i < n_classes; ++i) {
193 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
194 unsigned n_regs = arch_register_class_n_regs(cls);
195 register_values[i] = alloca(sizeof(ir_node*) * n_regs);
198 irg_block_walk_graph(irg, process_block, NULL, NULL);
201 void be_peephole_init(void)
203 clear_irp_opcodes_generic_func();