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 * @brief Spill module selection; Preparation steps
23 * @author Matthias Braun
31 #include "iredges_t.h"
32 #include "raw_bitset.h"
45 #include "beintlive_t.h"
48 #include "lc_opts_enum.h"
50 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
52 typedef struct be_pre_spill_env_t {
54 const arch_register_class_t *cls;
57 static void prepare_constr_insn(be_pre_spill_env_t *env, ir_node *node)
59 const arch_register_class_t *cls = env->cls;
60 ir_node *block = get_nodes_block(node);
61 const ir_graph *irg = env->irg;
62 be_irg_t *birg = be_birg_from_irg(irg);
63 be_lv_t *lv = be_get_irg_liveness(irg);
65 unsigned *def_constr = NULL;
66 int arity = get_irn_arity(node);
70 /* Insert a copy for constraint inputs attached to a value which can't
71 * fullfil the constraint
72 * (typical example: stack pointer as input to copyb)
73 * TODO: This really just checks precolored registers at the moment and
74 * ignores the general case of not matching in/out constraints
76 for (i = 0; i < arity; ++i) {
77 ir_node *op = get_irn_n(node, i);
78 const arch_register_req_t *req = arch_get_register_req(node, i);
79 const arch_register_t *reg;
84 reg = arch_get_irn_register(op);
88 /* precolored with an ignore register (which is not a joker like
90 if (arch_register_type_is(reg, joker)
91 || rbitset_is_set(birg->allocatable_regs, reg->global_index))
94 if (! (req->type & arch_register_req_type_limited))
96 if (rbitset_is_set(req->limited, reg->index))
99 copy = be_new_Copy(cls, block, op);
100 stat_ev_int("constr_copy", 1);
101 sched_add_before(node, copy);
102 set_irn_n(node, i, copy);
103 DBG((dbg, LEVEL_3, "inserting ignore arg copy %+F for %+F pos %d\n",
107 /* insert copies for nodes that occur constrained more than once. */
108 for (i = 0; i < arity; ++i) {
111 const arch_register_req_t *req;
113 req = arch_get_register_req(node, i);
117 if (! (req->type & arch_register_req_type_limited))
120 in = get_irn_n(node, i);
121 if (!arch_irn_consider_in_reg_alloc(cls, in))
124 for (i2 = i + 1; i2 < arity; ++i2) {
126 const arch_register_req_t *req2;
128 req2 = arch_get_register_req(node, i2);
129 if (req2->cls != cls)
131 if (! (req2->type & arch_register_req_type_limited))
134 in2 = get_irn_n(node, i2);
138 /* if the constraint is the same, no copy is necessary
139 * TODO generalise unequal but overlapping constraints */
140 if (rbitsets_equal(req->limited, req2->limited, cls->n_regs))
143 copy = be_new_Copy(cls, block, in);
144 stat_ev_int("constr_copy", 1);
146 sched_add_before(node, copy);
147 set_irn_n(node, i2, copy);
149 "inserting multiple constr copy %+F for %+F pos %d\n",
154 /* collect all registers occurring in out constraints. */
155 if (get_irn_mode(node) == mode_T) {
156 const ir_edge_t *edge;
158 foreach_out_edge(node, edge) {
159 ir_node *proj = get_edge_src_irn(edge);
160 const arch_register_req_t *req = arch_get_register_req_out(proj);
161 if (! (req->type & arch_register_req_type_limited))
164 if (def_constr == NULL) {
165 rbitset_alloca(def_constr, cls->n_regs);
167 rbitset_or(def_constr, req->limited, cls->n_regs);
170 const arch_register_req_t *req = arch_get_register_req_out(node);
171 if (req->type & arch_register_req_type_limited) {
172 rbitset_alloca(def_constr, cls->n_regs);
173 rbitset_or(def_constr, req->limited, cls->n_regs);
177 /* no output constraints => we're good */
178 if (def_constr == NULL) {
183 * insert copies for all constrained arguments living through the node
184 * and being constrained to a register which also occurs in out constraints.
186 rbitset_alloca(tmp, cls->n_regs);
187 for (i = 0; i < arity; ++i) {
188 const arch_register_req_t *req;
194 * 1) the operand is constrained.
195 * 2) lives through the node.
196 * 3) is constrained to a register occurring in out constraints.
198 req = arch_get_register_req(node, i);
201 if (!(req->type & arch_register_req_type_limited))
204 in = get_irn_n(node, i);
205 if (!arch_irn_consider_in_reg_alloc(cls, in))
207 if (!be_values_interfere(lv, node, in))
210 rbitset_copy(tmp, req->limited, cls->n_regs);
211 rbitset_and(tmp, def_constr, cls->n_regs);
213 if (rbitset_is_empty(tmp, cls->n_regs))
217 * only create the copy if the operand is no copy.
218 * this is necessary since the assure constraints phase inserts
219 * Copies and Keeps for operands which must be different from the
220 * results. Additional copies here would destroy this.
225 copy = be_new_Copy(cls, block, in);
226 sched_add_before(node, copy);
227 set_irn_n(node, i, copy);
228 DBG((dbg, LEVEL_3, "inserting constr copy %+F for %+F pos %d\n",
230 be_liveness_update(lv, in);
234 static void pre_spill_prepare_constr_walker(ir_node *block, void *data)
236 be_pre_spill_env_t *env = (be_pre_spill_env_t*)data;
238 sched_foreach(block, node) {
239 prepare_constr_insn(env, node);
243 void be_pre_spill_prepare_constr(ir_graph *irg,
244 const arch_register_class_t *cls)
246 be_pre_spill_env_t env;
247 memset(&env, 0, sizeof(env));
251 be_assure_liveness(irg);
253 irg_block_walk_graph(irg, pre_spill_prepare_constr_walker, NULL, &env);
258 int be_coalesce_spill_slots = 1;
259 int be_do_remats = 1;
261 static const lc_opt_table_entry_t be_spill_options[] = {
262 LC_OPT_ENT_BOOL ("coalesce_slots", "coalesce the spill slots", &be_coalesce_spill_slots),
263 LC_OPT_ENT_BOOL ("remat", "try to rematerialize values instead of reloading", &be_do_remats),
267 static be_module_list_entry_t *spillers = NULL;
268 static const be_spiller_t *selected_spiller = NULL;
270 void be_register_spiller(const char *name, be_spiller_t *spiller)
272 if (selected_spiller == NULL)
273 selected_spiller = spiller;
274 be_add_module_to_list(&spillers, name, spiller);
277 void be_do_spill(ir_graph *irg, const arch_register_class_t *cls)
279 assert(selected_spiller != NULL);
281 selected_spiller->spill(irg, cls);
284 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_spilloptions);
285 void be_init_spilloptions(void)
287 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
288 lc_opt_entry_t *spill_grp = lc_opt_get_grp(be_grp, "spill");
290 lc_opt_add_table(spill_grp, be_spill_options);
291 be_add_module_list_opt(spill_grp, "spiller", "spill algorithm",
292 &spillers, (void**) &selected_spiller);
294 FIRM_DBG_REGISTER(dbg, "firm.be.spillprepare");