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"
32 #include "firm/bearch_firm.h"
33 #include "ia32/bearch_ia32.h"
34 #include "arm/bearch_arm.h"
35 #include "ppc32/bearch_ppc32.h"
36 #include "mips/bearch_mips.h"
43 #include "besched_t.h"
44 #include "belistsched.h"
46 #include "bespillilp.h"
47 #include "bespillbelady.h"
49 #include "beraextern.h"
50 #include "bechordal_t.h"
52 #include "beifg_impl.h"
53 #include "becopyopt.h"
54 #include "becopystat.h"
55 #include "bessadestr.h"
58 #include "beschedmris.h"
61 #define DUMP_INITIAL (1 << 0)
62 #define DUMP_ABI (1 << 1)
63 #define DUMP_SCHED (1 << 2)
64 #define DUMP_PREPARED (1 << 3)
65 #define DUMP_RA (1 << 4)
66 #define DUMP_FINAL (1 << 5)
68 /* options visible for anyone */
69 static be_options_t be_options = {
71 "i44pc52.info.uni-karlsruhe.de",
78 static unsigned dump_flags = 2 * DUMP_FINAL - 1;
80 /* register allocator to use. */
81 static const be_ra_t *ra = &be_ra_chordal_allocator;
83 /* back end instruction set architecture to use */
84 static const arch_isa_if_t *isa_if = &ia32_isa_if;
87 static lc_opt_entry_t *be_grp_root = NULL;
89 static int be_disable_mris = 0;
91 /* possible dumping options */
92 static const lc_opt_enum_mask_items_t dump_items[] = {
94 { "initial", DUMP_INITIAL },
96 { "sched", DUMP_SCHED },
97 { "prepared", DUMP_PREPARED },
98 { "regalloc", DUMP_RA },
99 { "final", DUMP_FINAL },
100 { "all", 2 * DUMP_FINAL - 1 },
104 /* register allocators */
105 static const lc_opt_enum_const_ptr_items_t ra_items[] = {
106 { "chordal", &be_ra_chordal_allocator },
107 { "external", &be_ra_external_allocator },
111 /* instruction set architectures. */
112 static const lc_opt_enum_const_ptr_items_t isa_items[] = {
113 { "firm", &firm_isa },
114 { "ia32", &ia32_isa_if },
115 { "arm", &arm_isa_if },
116 { "ppc32", &ppc32_isa_if },
117 { "mips", &mips_isa_if },
121 static lc_opt_enum_mask_var_t dump_var = {
122 &dump_flags, dump_items
125 static lc_opt_enum_const_ptr_var_t ra_var = {
126 (const void **) &ra, ra_items
129 static lc_opt_enum_const_ptr_var_t isa_var = {
130 (const void **) &isa_if, isa_items
133 static const lc_opt_table_entry_t be_main_options[] = {
134 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
135 LC_OPT_ENT_ENUM_PTR ("ra", "register allocator", &ra_var),
136 LC_OPT_ENT_ENUM_PTR ("isa", "the instruction set architecture", &isa_var),
137 LC_OPT_ENT_NEGBOOL ("noomitfp", "do not omit frame pointer", &be_omit_fp),
138 LC_OPT_ENT_NEGBOOL ("nomris", "disable mris schedule preparation", &be_disable_mris),
141 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
142 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
143 #endif /* WITH_ILP */
147 #endif /* WITH_LIBCORE */
149 void be_opt_register(void)
153 lc_opt_entry_t *be_grp_ra;
154 static int run_once = 0;
158 be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
159 be_grp_ra = lc_opt_get_grp(be_grp_root, "ra");
161 lc_opt_add_table(be_grp_root, be_main_options);
163 /* register allocator options */
164 for(i = 0; ra_items[i].name != NULL; ++i) {
165 const be_ra_t *ra = ra_items[i].value;
166 ra->register_options(be_grp_ra);
169 /* register isa options */
170 for(i = 0; isa_items[i].name != NULL; ++i) {
171 const arch_isa_if_t *isa = isa_items[i].value;
172 isa->register_options(be_grp_root);
175 #endif /* WITH_LIBCORE */
178 /* Parse one argument. */
179 int be_parse_arg(const char *arg) {
181 return lc_opt_from_single_arg(be_grp_root, NULL, arg, NULL);
182 #endif /* WITH_LIBCORE */
198 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
200 memset(env, 0, sizeof(*env));
201 obstack_init(&env->obst);
202 env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
203 env->options = &be_options;
204 FIRM_DBG_REGISTER(env->dbg, "be.main");
206 arch_env_init(env->arch_env, isa_if, file_handle);
208 /* Register the irn handler of the architecture */
209 if (arch_isa_get_irn_handler(env->arch_env->isa))
210 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
213 * Register the node handler of the back end infrastructure.
214 * This irn handler takes care of the platform independent
215 * spill, reload and perm nodes.
217 arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
218 env->phi_handler = be_phi_handler_new(env->arch_env);
219 arch_env_push_irn_handler(env->arch_env, env->phi_handler);
224 static void be_done_env(be_main_env_t *env)
226 env->arch_env->isa->impl->done(env->arch_env->isa);
227 be_phi_handler_free(env->phi_handler);
228 obstack_free(&env->obst, NULL);
231 static void dump(int mask, ir_graph *irg, const char *suffix,
232 void (*dumper)(ir_graph *, const char *))
234 if(dump_flags & mask)
235 be_dump(irg, suffix, dumper);
239 * Prepare a backend graph for code generation.
241 static void prepare_graph(be_irg_t *birg)
243 ir_graph *irg = birg->irg;
245 /* Normalize proj nodes. */
246 normalize_proj_nodes(irg);
248 /* Make just one return node. */
249 normalize_one_return(irg);
251 /* Remove critical edges */
252 remove_critical_cf_edges(irg);
254 /* Compute the dominance information. */
258 /* Ensure, that the ir_edges are computed. */
261 /* check, if the dominance property is fulfilled. */
262 be_check_dominance(irg);
264 /* reset the phi handler. */
265 be_phi_handler_reset(birg->main_env->phi_handler);
269 * The Firm backend main loop.
270 * Do architecture specific lowering for all graphs
271 * and call the architecture specific code generator.
273 static void be_main_loop(FILE *file_handle)
279 be_init_env(&env, file_handle);
281 isa = arch_env_get_isa(env.arch_env);
284 for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
285 ir_graph *irg = get_irp_irg(i);
286 const arch_code_generator_if_t *cg_if;
290 birg.main_env = &env;
292 DBG((env.dbg, LEVEL_2, "====> IRG: %F\n", irg));
293 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
295 /* set the current graph (this is important for several firm functions) */
296 current_ir_graph = birg.irg;
298 /* Get the code generator interface. */
299 cg_if = isa->impl->get_code_generator_if(isa);
301 /* get a code generator for this graph. */
302 birg.cg = cg_if->init(&birg);
304 /* create the code generator and generate code. */
305 prepare_graph(&birg);
307 /* some transformations need to be done before abi introduce */
308 arch_code_generator_before_abi(birg.cg);
310 /* implement the ABI conventions. */
311 birg.abi = be_abi_introduce(&birg);
312 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
315 arch_code_generator_prepare_graph(birg.cg);
318 * Since the code generator made a lot of new nodes and skipped
319 * a lot of old ones, we should do dead node elimination here.
320 * Note that this requires disabling the edges here.
322 edges_deactivate(irg);
323 //dead_node_elimination(irg);
326 /* Compute loop nesting information (for weighting copies) */
327 construct_cf_backedges(irg);
329 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
331 /* add Keeps for should_be_different constrained nodes */
332 assure_constraints(&birg);
333 dump(DUMP_PREPARED, irg, "-assured", dump_ir_block_graph);
335 /* Schedule the graphs. */
336 arch_code_generator_before_sched(birg.cg);
337 list_sched(&birg, be_disable_mris);
338 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
340 /* connect all stack modifying nodes together (see beabi.c) */
341 be_abi_fix_stack_nodes(birg.abi);
342 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
344 /* Verify the schedule */
345 sched_verify_irg(irg);
347 /* do some statistics */
348 be_do_stat_reg_pressure(&birg);
350 /* Do register allocation */
351 arch_code_generator_before_ra(birg.cg);
353 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
355 arch_code_generator_after_ra(birg.cg);
356 be_abi_fix_stack_bias(birg.abi);
358 arch_code_generator_done(birg.cg);
359 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
360 be_abi_free(birg.abi);
362 // free_ir_graph(irg);
368 /* Main interface to the frontend. */
369 void be_main(FILE *file_handle)
371 /* never build code for pseudo irgs */
372 set_visit_pseudo_irgs(0);
375 be_main_loop(file_handle);
378 /** The debug info retriever function. */
379 static retrieve_dbg_func retrieve_dbg = NULL;
381 /* Sets a debug info retriever. */
382 void be_set_debug_retrieve(retrieve_dbg_func func) {
386 /* Retrieve the debug info. */
387 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
389 return retrieve_dbg(dbg, line);