3 * @author Sebastian Hack
13 #include <libcore/lc_opts.h>
14 #include <libcore/lc_opts_enum.h>
15 #endif /* WITH_LIBCORE */
26 #include "iredges_t.h"
31 #include "firm/bearch_firm.h"
32 #include "ia32/bearch_ia32.h"
39 #include "besched_t.h"
40 #include "belistsched.h"
42 #include "bespillilp.h"
43 #include "bespillbelady.h"
45 #include "beraextern.h"
46 #include "bechordal_t.h"
48 #include "beifg_impl.h"
49 #include "becopyoptmain.h"
50 #include "becopystat.h"
51 #include "bessadestr.h"
55 #define DUMP_INITIAL (1 << 0)
56 #define DUMP_SCHED (1 << 1)
57 #define DUMP_PREPARED (1 << 2)
58 #define DUMP_RA (1 << 3)
59 #define DUMP_FINAL (1 << 4)
61 /* options visible for anyone */
62 be_options_t be_options = {
64 "i44pc52.info.uni-karlsruhe.de",
71 static unsigned dump_flags = DUMP_INITIAL | DUMP_SCHED | DUMP_PREPARED | DUMP_RA | DUMP_FINAL;
73 /* register allocator to use. */
74 static const be_ra_t *ra = &be_ra_chordal_allocator;
76 /* back end instruction set architecture to use */
77 static const arch_isa_if_t *isa_if = &ia32_isa_if;
81 static lc_opt_entry_t *be_grp_root = NULL;
83 /* possible dumping options */
84 static const lc_opt_enum_mask_items_t dump_items[] = {
86 { "initial", DUMP_INITIAL },
87 { "sched", DUMP_SCHED },
88 { "prepared", DUMP_PREPARED },
89 { "regalloc", DUMP_RA },
90 { "final", DUMP_FINAL },
91 { "all", 2 * DUMP_FINAL - 1 },
95 /* register allocators */
96 static const lc_opt_enum_const_ptr_items_t ra_items[] = {
97 { "chordal", &be_ra_chordal_allocator },
98 { "external", &be_ra_external_allocator },
102 /* instruction set architectures. */
103 static const lc_opt_enum_const_ptr_items_t isa_items[] = {
104 { "firm", &firm_isa },
105 { "ia32", &ia32_isa_if },
109 static lc_opt_enum_mask_var_t dump_var = {
110 &dump_flags, dump_items
113 static lc_opt_enum_const_ptr_var_t ra_var = {
114 (const void **) &ra, ra_items
117 static lc_opt_enum_const_ptr_var_t isa_var = {
118 (const void **) &isa_if, isa_items
121 static const lc_opt_table_entry_t be_main_options[] = {
122 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
123 LC_OPT_ENT_ENUM_PTR("ra", "register allocator", &ra_var),
124 LC_OPT_ENT_ENUM_PTR("isa", "the instruction set architecture", &isa_var),
126 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
127 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
131 #endif /* WITH_LIBCORE */
133 void be_opt_register(void)
137 lc_opt_entry_t *be_grp_ra;
139 be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
140 be_grp_ra = lc_opt_get_grp(be_grp_root, "ra");
142 lc_opt_add_table(be_grp_root, be_main_options);
144 /* register allocator options */
145 for(i = 0; ra_items[i].name != NULL; ++i) {
146 const be_ra_t *ra = ra_items[i].value;
147 ra->register_options(be_grp_ra);
150 /* register isa options */
151 for(i = 0; isa_items[i].name != NULL; ++i) {
152 const arch_isa_if_t *isa = isa_items[i].value;
153 isa->register_options(be_grp_root);
155 #endif /* WITH_LIBCORE */
171 static be_main_env_t *be_init_env(be_main_env_t *env)
175 memset(env, 0, sizeof(*env));
176 obstack_init(&env->obst);
177 env->dbg = firm_dbg_register("be.main");
179 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
180 arch_env_init(env->arch_env, isa_if);
182 /* Register the irn handler of the architecture */
183 if (arch_isa_get_irn_handler(env->arch_env->isa))
184 arch_env_add_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
187 * Register the node handler of the back end infrastructure.
188 * This irn handler takes care of the platform independent
189 * spill, reload and perm nodes.
191 arch_env_add_irn_handler(env->arch_env, &be_node_irn_handler);
194 * Create the list of caller save registers.
196 for(i = 0, n = arch_isa_get_n_reg_class(env->arch_env->isa); i < n; ++i) {
197 const arch_register_class_t *cls = arch_isa_get_reg_class(env->arch_env->isa, i);
198 for(j = 0; j < cls->n_regs; ++j) {
199 const arch_register_t *reg = arch_register_for_index(cls, j);
200 if(arch_register_type_is(reg, caller_save))
201 obstack_ptr_grow(&env->obst, reg);
204 obstack_ptr_grow(&env->obst, NULL);
205 env->caller_save = obstack_finish(&env->obst);
208 * Create the list of callee save registers.
210 for(i = 0, n = arch_isa_get_n_reg_class(env->arch_env->isa); i < n; ++i) {
211 const arch_register_class_t *cls = arch_isa_get_reg_class(env->arch_env->isa, i);
212 for(j = 0; j < cls->n_regs; ++j) {
213 const arch_register_t *reg = arch_register_for_index(cls, j);
214 if(arch_register_type_is(reg, callee_save))
215 obstack_ptr_grow(&env->obst, reg);
218 obstack_ptr_grow(&env->obst, NULL);
219 env->callee_save = obstack_finish(&env->obst);
224 static void be_done_env(be_main_env_t *env)
226 env->arch_env->isa->impl->done(env->arch_env->isa);
227 obstack_free(&env->obst, NULL);
230 static void dump(int mask, ir_graph *irg, const char *suffix,
231 void (*dumper)(ir_graph *, const char *))
233 if(dump_flags & mask)
237 static void prepare_graph(be_irg_t *birg)
239 ir_graph *irg = birg->irg;
241 /* Normalize proj nodes. */
242 normalize_proj_nodes(irg);
244 /* Remove critical edges */
245 remove_critical_cf_edges(irg);
247 /* Compute the dominance information. */
251 /* Ensure, that the ir_edges are computed. */
254 /* Compute loop nesting information (for weighting copies) */
255 if (get_irg_loopinfo_state(irg) != (loopinfo_valid & loopinfo_cf_consistent))
256 construct_cf_backedges(irg);
258 /* check, if the dominance property is fulfilled. */
259 be_check_dominance(irg);
261 /* compute the dominance frontiers. */
262 birg->dom_front = be_compute_dominance_frontiers(irg);
265 static void be_main_loop(FILE *file_handle)
273 isa = arch_env_get_isa(env.arch_env);
276 for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
277 ir_graph *irg = get_irp_irg(i);
278 const arch_code_generator_if_t *cg_if;
282 birg.main_env = &env;
284 DBG((env.dbg, LEVEL_2, "====> IRG: %F\n", irg));
285 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
287 /* set the current graph (this is important for several firm functions) */
288 current_ir_graph = birg.irg;
290 /* Get the code generator interface. */
291 cg_if = isa->impl->get_code_generator_if(isa);
293 /* get a code generator for this graph. */
294 birg.cg = cg_if->init(file_handle, birg.irg, env.arch_env);
296 /* create the code generator and generate code. */
297 prepare_graph(&birg);
299 /* implement the ABI conventions. */
300 // birg.abi = be_abi_introduce(&birg);
302 arch_code_generator_prepare_graph(birg.cg);
305 * Since the code generator made a lot of new nodes and skipped
306 * a lot of old ones, we should do dead node elim here.
307 * Note that this requires disabling the edges here.
309 edges_deactivate(irg);
310 dead_node_elimination(irg);
313 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
315 /* Schedule the graphs. */
316 arch_code_generator_before_sched(birg.cg);
317 list_sched(isa, irg);
319 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
321 /* connect all stack modifying nodes together (see beabi.c) */
322 // be_abi_fix_stack(birg.abi);
324 /* Verify the schedule */
325 sched_verify_irg(irg);
327 /* Do register allocation */
328 arch_code_generator_before_ra(birg.cg);
331 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
333 arch_code_generator_done(birg.cg);
334 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
336 be_free_dominance_frontiers(birg.dom_front);
342 void be_main(FILE *file_handle)
344 /* never build code for pseudo irgs */
345 set_visit_pseudo_irgs(0);
348 be_main_loop(file_handle);