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 Main Backend driver.
23 * @author Sebastian Hack
33 #include "lc_opts_enum.h"
44 #include "iredges_t.h"
49 #include "iroptimize.h"
52 #include "irprofile.h"
60 #include "besched_t.h"
61 #include "belistsched.h"
64 #include "bechordal_t.h"
66 #include "beifg_impl.h"
67 #include "becopyopt.h"
68 #include "becopystat.h"
69 #include "bessadestr.h"
72 #include "beschedmris.h"
75 #include "be_dbgout.h"
78 #define NEW_ID(s) new_id_from_chars(s, sizeof(s) - 1)
81 #include "beilpsched.h"
84 /* options visible for anyone */
85 static be_options_t be_options = {
86 DUMP_NONE, /* dump flags */
87 BE_TIME_OFF, /* no timing */
88 0, /* no opt profile */
89 0, /* try to omit frame pointer */
90 0, /* try to omit leaf frame pointer */
91 0, /* create PIC code */
92 0, /* create gprof compatible profiling code */
93 BE_VRFY_WARN, /* verification level: warn */
94 BE_SCHED_LIST, /* scheduler: list scheduler */
95 "linux", /* target OS name */
96 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
97 "cplex", /* ilp solver */
98 0, /* enable statistic event dumping */
99 "", /* print stat events */
103 static char config_file[256] = { 0 };
105 /* back end instruction set architecture to use */
106 static const arch_isa_if_t *isa_if = NULL;
108 /* possible dumping options */
109 static const lc_opt_enum_mask_items_t dump_items[] = {
110 { "none", DUMP_NONE },
111 { "initial", DUMP_INITIAL },
113 { "sched", DUMP_SCHED },
114 { "prepared", DUMP_PREPARED },
115 { "regalloc", DUMP_RA },
116 { "final", DUMP_FINAL },
118 { "all", 2 * DUMP_BE - 1 },
122 /* verify options. */
123 static const lc_opt_enum_int_items_t vrfy_items[] = {
124 { "off", BE_VRFY_OFF },
125 { "warn", BE_VRFY_WARN },
126 { "assert", BE_VRFY_ASSERT },
130 /* scheduling options. */
131 static const lc_opt_enum_int_items_t sched_items[] = {
132 { "list", BE_SCHED_LIST },
134 { "ilp", BE_SCHED_ILP },
135 #endif /* WITH_ILP */
139 static lc_opt_enum_mask_var_t dump_var = {
140 &be_options.dump_flags, dump_items
143 static lc_opt_enum_int_var_t vrfy_var = {
144 &be_options.vrfy_option, vrfy_items
147 static lc_opt_enum_int_var_t sched_var = {
148 &be_options.scheduler, sched_items
151 static const lc_opt_table_entry_t be_main_options[] = {
152 LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
153 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
154 LC_OPT_ENT_BOOL ("omitfp", "omit frame pointer", &be_options.omit_fp),
155 LC_OPT_ENT_BOOL ("omitleaffp", "omit frame pointer in leaf routines", &be_options.omit_leaf_fp),
156 LC_OPT_ENT_BOOL ("pic", "create PIC code", &be_options.pic),
157 LC_OPT_ENT_BOOL ("gprof", "create gprof profiling code", &be_options.gprof),
158 LC_OPT_ENT_ENUM_PTR ("verify", "verify the backend irg", &vrfy_var),
159 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
160 LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
161 LC_OPT_ENT_ENUM_PTR ("sched", "select a scheduler", &sched_var),
162 LC_OPT_ENT_STR ("os", "specify target operating system", &be_options.target_os, sizeof(be_options.target_os)),
163 #ifdef FIRM_STATISTICS
164 LC_OPT_ENT_BOOL ("statev", "dump statistic events", &be_options.statev),
165 LC_OPT_ENT_STR ("filtev", "filter for stat events (regex if support is active", &be_options.filtev, sizeof(be_options.filtev)),
169 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
170 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
171 #endif /* WITH_ILP */
175 static be_module_list_entry_t *isa_ifs = NULL;
178 unsigned short asm_constraint_flags[256];
180 void be_init_default_asm_constraint_flags(void)
182 asm_constraint_flags['?'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
183 asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
184 asm_constraint_flags['&'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
185 | ASM_CONSTRAINT_FLAG_MODIFIER_EARLYCLOBBER;
186 asm_constraint_flags['%'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
187 | ASM_CONSTRAINT_FLAG_MODIFIER_COMMUTATIVE;
188 asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
190 asm_constraint_flags['='] = ASM_CONSTRAINT_FLAG_MODIFIER_WRITE
191 | ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ;
192 asm_constraint_flags['+'] = ASM_CONSTRAINT_FLAG_MODIFIER_READ
193 | ASM_CONSTRAINT_FLAG_MODIFIER_WRITE;
195 asm_constraint_flags['i'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
196 asm_constraint_flags['s'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
197 asm_constraint_flags['E'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
198 asm_constraint_flags['F'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
199 asm_constraint_flags['G'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
200 asm_constraint_flags['H'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
201 asm_constraint_flags['I'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
202 asm_constraint_flags['J'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
203 asm_constraint_flags['K'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
204 asm_constraint_flags['L'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
205 asm_constraint_flags['M'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
206 asm_constraint_flags['N'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
207 asm_constraint_flags['O'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
208 asm_constraint_flags['P'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
210 asm_constraint_flags['m'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
211 asm_constraint_flags['o'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
212 asm_constraint_flags['V'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
213 asm_constraint_flags['<'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
214 asm_constraint_flags['>'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
216 asm_constraint_flags['p'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
217 asm_constraint_flags['0'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
218 asm_constraint_flags['1'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
219 asm_constraint_flags['2'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
220 asm_constraint_flags['3'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
221 asm_constraint_flags['4'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
222 asm_constraint_flags['5'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
223 asm_constraint_flags['6'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
224 asm_constraint_flags['7'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
225 asm_constraint_flags['8'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
226 asm_constraint_flags['9'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
228 asm_constraint_flags['X'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER
229 | ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP
230 | ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
232 /* these should have been catched by the parsing code already */
233 asm_constraint_flags['#'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
234 asm_constraint_flags['*'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
235 asm_constraint_flags[' '] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
236 asm_constraint_flags['\t'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
237 asm_constraint_flags['\n'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
238 asm_constraint_flags['\r'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
241 asm_constraint_flags_t be_parse_asm_constraints(const char *constraint)
243 asm_constraint_flags_t flags = 0;
245 asm_constraint_flags_t tflags;
247 for (c = constraint; *c != '\0'; ++c) {
250 /* 'comment' stuff */
251 while(*c != 0 && *c != ',')
255 /* 'comment' character */
264 tflags = asm_constraint_flags[(int) *c];
268 flags |= isa_if->parse_asm_constraint(isa_if, &c);
275 flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE &&
276 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE
278 flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ &&
279 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ
281 flags |= ASM_CONSTRAINT_FLAG_INVALID;
283 if (!(flags & (ASM_CONSTRAINT_FLAG_MODIFIER_READ |
284 ASM_CONSTRAINT_FLAG_MODIFIER_WRITE |
285 ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE |
286 ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ)
288 flags |= ASM_CONSTRAINT_FLAG_MODIFIER_READ;
294 int be_is_valid_clobber(const char *clobber)
296 /* memory is a valid clobber. (the frontend has to detect this case too,
297 * because it has to add memory edges to the asm) */
298 if (strcmp(clobber, "memory") == 0)
300 /* cc (condition code) is always valid */
301 if (strcmp(clobber, "cc") == 0)
304 return isa_if->is_valid_clobber(isa_if, clobber);
307 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
312 be_add_module_to_list(&isa_ifs, name, (void*) isa);
315 void be_opt_register(void)
317 lc_opt_entry_t *be_grp;
318 static int run_once = 0;
324 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
325 lc_opt_add_table(be_grp, be_main_options);
327 be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
328 &isa_ifs, (void**) &isa_if);
333 /* Parse one argument. */
334 int be_parse_arg(const char *arg) {
335 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
336 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
337 lc_opt_print_help_for_entry(be_grp, '-', stdout);
340 return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
343 /** The be parameters returned by default, all off. */
344 static const backend_params be_params = {
345 0, /* need dword lowering */
346 0, /* don't support inline assembler yet */
347 NULL, /* will be set later */
348 NULL, /* but yet no creator function */
349 NULL, /* context for create_intrinsic_fkt */
350 NULL, /* no if conversion settings */
351 NULL, /* no float arithmetic mode */
352 0, /* no trampoline support: size 0 */
353 0, /* no trampoline support: align 0 */
354 NULL /* no trampoline support: no trampoline builder */
357 /* Perform schedule verification if requested. */
358 static void be_sched_vrfy(be_irg_t *birg, int vrfy_opt) {
359 if (vrfy_opt == BE_VRFY_WARN) {
360 be_verify_schedule(birg);
361 } else if (vrfy_opt == BE_VRFY_ASSERT) {
362 assert(be_verify_schedule(birg) && "Schedule verification failed.");
366 /* Initialize the Firm backend. Must be run first in init_firm()! */
367 void firm_be_init(void)
373 /* Finalize the Firm backend. */
374 void firm_be_finish(void)
379 /* Returns the backend parameter */
380 const backend_params *be_get_backend_param(void)
382 if (isa_if->get_params)
383 return isa_if->get_params();
388 * Initializes the main environment for the backend.
390 * @param env an empty environment
391 * @param file_handle the file handle where the output will be written to
393 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
395 memset(env, 0, sizeof(*env));
396 env->options = &be_options;
397 env->ent_trampoline_map = pmap_create();
398 env->pic_trampolines_type = new_type_class(NEW_ID("$PIC_TRAMPOLINE_TYPE"));
399 env->ent_pic_symbol_map = pmap_create();
400 env->pic_symbols_type = new_type_struct(NEW_ID("$PIC_SYMBOLS_TYPE"));
402 remove_irp_type(env->pic_trampolines_type);
403 remove_irp_type(env->pic_symbols_type);
404 set_class_final(env->pic_trampolines_type, 1);
406 memset(asm_constraint_flags, 0, sizeof(asm_constraint_flags));
407 env->arch_env = arch_env_init(isa_if, file_handle, env);
409 be_phi_handler_new();
416 * Called when the be_main_env_t can be destroyed.
418 static void be_done_env(be_main_env_t *env)
420 arch_env_done(env->arch_env);
422 be_phi_handler_free();
424 pmap_destroy(env->ent_trampoline_map);
425 pmap_destroy(env->ent_pic_symbol_map);
426 free_type(env->pic_trampolines_type);
427 free_type(env->pic_symbols_type);
431 * A wrapper around a firm dumper. Dumps only, if
434 * @param mask a bitmask containing the reason what will be dumped
435 * @param irg the IR graph to dump
436 * @param suffix the suffix for the dumper
437 * @param dumper the dumper to be called
439 static void dump(int mask, ir_graph *irg, const char *suffix,
440 void (*dumper)(ir_graph *, const char *))
442 if(be_options.dump_flags & mask)
443 be_dump(irg, suffix, dumper);
447 * Prepare a backend graph for code generation and initialize its birg
449 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
451 memset(birg, 0, sizeof(*birg));
453 birg->main_env = env;
455 edges_deactivate_kind(irg, EDGE_KIND_DEP);
456 edges_activate_kind(irg, EDGE_KIND_DEP);
458 dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
460 /* set the current graph (this is important for several firm functions) */
461 current_ir_graph = irg;
463 /* Normalize proj nodes. */
464 normalize_proj_nodes(irg);
466 /* we do this before critical edge split. As this produces less returns,
467 because sometimes (= 164.gzip) multiple returns are slower */
468 normalize_n_returns(irg);
470 /* Remove critical edges */
471 remove_critical_cf_edges_ex(irg, /*ignore_exception_edges=*/0);
473 /* Ensure, that the ir_edges are computed. */
476 set_irg_phase_state(irg, phase_backend);
477 be_info_init_irg(irg);
479 dump(DUMP_INITIAL, irg, "-prepared", dump_ir_block_graph);
482 #define BE_TIMER_ONLY(code) do { if (be_timing) { code; } } while(0)
486 ir_timer_t *t_codegen;
488 ir_timer_t *t_constr;
489 ir_timer_t *t_finish;
492 ir_timer_t *t_verify;
493 ir_timer_t *t_heights;
495 ir_timer_t *t_execfreq;
496 ir_timer_t *t_ssa_constr;
497 ir_timer_t *t_ra_constr;
498 ir_timer_t *t_ra_prolog;
499 ir_timer_t *t_ra_epilog;
500 ir_timer_t *t_ra_spill;
501 ir_timer_t *t_ra_spill_apply;
502 ir_timer_t *t_ra_color;
503 ir_timer_t *t_ra_ifg;
504 ir_timer_t *t_ra_copymin;
505 ir_timer_t *t_ra_ssa;
506 ir_timer_t *t_ra_other;
509 * The Firm backend main loop.
510 * Do architecture specific lowering for all graphs
511 * and call the architecture specific code generator.
513 * @param file_handle the file handle the output will be written to
514 * @param cup_name name of the compilation unit
516 static void be_main_loop(FILE *file_handle, const char *cup_name)
518 static const char suffix[] = ".prof";
520 int i, num_birgs, stat_active = 0;
522 char prof_filename[256];
524 ir_graph **irg_list, **backend_irg_list;
525 arch_env_t *arch_env;
527 be_timing = (be_options.timing == BE_TIME_ON);
530 t_abi = ir_timer_register("bemain_time_beabi", "be abi introduction");
531 t_codegen = ir_timer_register("bemain_time_codegen", "codegeneration");
532 t_sched = ir_timer_register("bemain_time_sched", "scheduling");
533 t_constr = ir_timer_register("bemain_time_constr", "assure constraints");
534 t_finish = ir_timer_register("bemain_time_finish", "graph finish");
535 t_emit = ir_timer_register("bemain_time_emiter", "code emiter");
536 t_verify = ir_timer_register("bemain_time_verify", "graph verification");
537 t_other = ir_timer_register("bemain_time_other", "other");
538 t_heights = ir_timer_register("bemain_time_heights", "heights");
539 t_live = ir_timer_register("bemain_time_liveness", "be liveness");
540 t_execfreq = ir_timer_register("bemain_time_execfreq", "execfreq");
541 t_ssa_constr = ir_timer_register("bemain_time_ssa_constr", "ssa reconstruction");
542 t_ra_prolog = ir_timer_register("bemain_time_ra_prolog", "regalloc prolog");
543 t_ra_epilog = ir_timer_register("bemain_time_ra_epilog", "regalloc epilog");
544 t_ra_constr = ir_timer_register("bemain_time_ra_constr", "regalloc constraints");
545 t_ra_spill = ir_timer_register("bemain_time_ra_spill", "spiller");
547 = ir_timer_register("bemain_time_ra_spill_apply", "apply spills");
548 t_ra_color = ir_timer_register("bemain_time_ra_color", "graph coloring");
549 t_ra_ifg = ir_timer_register("bemain_time_ra_ifg", "interference graph");
550 t_ra_copymin = ir_timer_register("bemain_time_ra_copymin", "copy minimization");
551 t_ra_ssa = ir_timer_register("bemain_time_ra_ssadestr", "ssa destruction");
552 t_ra_other = ir_timer_register("bemain_time_ra_other", "regalloc other");
555 be_init_env(&env, file_handle);
556 env.cup_name = cup_name;
561 arch_env = env.arch_env;
563 /* backend may provide an ordered list of irgs where code should be
565 irg_list = NEW_ARR_F(ir_graph *, 0);
566 backend_irg_list = arch_env_get_backend_irg_list(arch_env, &irg_list);
568 /* we might need 1 birg more for instrumentation constructor */
569 num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs();
570 birgs = ALLOCAN(be_irg_t, num_birgs + 1);
574 /* First: initialize all birgs */
575 for(i = 0; i < num_birgs; ++i) {
576 ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i);
577 initialize_birg(&birgs[i], irg, &env);
579 arch_env_handle_intrinsics(arch_env);
583 Get the filename for the profiling data.
584 Beware: '\0' is already included in sizeof(suffix)
586 memset(prof_filename, 0, sizeof(prof_filename));
587 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
588 strcat(prof_filename, suffix);
591 Next: Either instruments all irgs with profiling code
592 or try to read in profile data for current translation unit.
594 if (be_options.opt_profile) {
595 ir_graph *prof_init_irg = ir_profile_instrument(prof_filename, profile_default);
596 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
599 ir_profile_read(prof_filename);
602 #ifdef FIRM_STATISTICS
603 stat_active = stat_is_active();
604 #endif /* FIRM_STATISTICS */
607 for (i = 0; i < num_birgs; ++i) {
608 be_irg_t *birg = &birgs[i];
609 ir_graph *irg = birg->irg;
610 optimization_state_t state;
611 const arch_code_generator_if_t *cg_if;
613 /* set the current graph (this is important for several firm functions) */
614 current_ir_graph = irg;
616 /* reset the phi handler. */
617 be_phi_handler_reset();
620 stat_ev_ctx_push_fobj("bemain_irg", irg);
621 be_stat_ev("bemain_insns_start", be_count_insns(irg));
622 be_stat_ev("bemain_blocks_start", be_count_blocks(irg));
625 /* stop and reset timers */
626 BE_TIMER_PUSH(t_other); /* t_other */
628 /* Verify the initial graph */
629 BE_TIMER_PUSH(t_verify);
630 if (be_options.vrfy_option == BE_VRFY_WARN) {
631 irg_verify(irg, VRFY_ENFORCE_SSA);
632 be_check_dominance(irg);
633 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
634 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
635 assert(be_check_dominance(irg) && "Dominance verification failed");
637 BE_TIMER_POP(t_verify);
639 /* Get the code generator interface. */
640 cg_if = arch_env_get_code_generator_if(arch_env);
642 /* get a code generator for this graph. */
643 birg->cg = cg_if->init(birg);
645 /* some transformations need to be done before abi introduce */
646 arch_code_generator_before_abi(birg->cg);
648 /* implement the ABI conventions. */
649 BE_TIMER_PUSH(t_abi);
650 birg->abi = be_abi_introduce(birg);
653 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
655 if (be_options.vrfy_option == BE_VRFY_WARN) {
656 be_check_dominance(irg);
657 be_verify_out_edges(irg);
658 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
659 assert(be_verify_out_edges(irg));
660 assert(be_check_dominance(irg) && "Dominance verification failed");
664 BE_TIMER_PUSH(t_codegen);
665 arch_code_generator_prepare_graph(birg->cg);
666 BE_TIMER_POP(t_codegen);
668 /* reset the phi handler. */
669 be_phi_handler_reset();
671 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
673 if (be_options.vrfy_option == BE_VRFY_WARN) {
674 be_check_dominance(irg);
675 be_verify_out_edges(irg);
676 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
677 assert(be_verify_out_edges(irg));
678 assert(be_check_dominance(irg) && "Dominance verification failed");
681 BE_TIMER_PUSH(t_execfreq);
683 * Create execution frequencies from profile data or estimate some
685 if (ir_profile_has_data())
686 birg->exec_freq = ir_create_execfreqs_from_profile(irg);
688 /* TODO: edges are corrupt for EDGE_KIND_BLOCK after the local
689 * optimize graph phase merges blocks in the x86 backend */
690 edges_deactivate(irg);
691 birg->exec_freq = compute_execfreq(irg, 10);
693 BE_TIMER_POP(t_execfreq);
696 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
697 /* be_live_chk_compare(birg); */
699 /* schedule the irg */
700 BE_TIMER_PUSH(t_sched);
701 switch (be_options.scheduler) {
703 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
705 list_sched(birg, &be_options);
709 be_ilp_sched(birg, &be_options);
711 #endif /* WITH_ILP */
713 BE_TIMER_POP(t_sched);
715 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
718 BE_TIMER_PUSH(t_verify);
719 be_sched_vrfy(birg, be_options.vrfy_option);
720 BE_TIMER_POP(t_verify);
722 /* introduce patterns to assure constraints */
723 BE_TIMER_PUSH(t_constr);
724 /* we switch off optimizations here, because they might cause trouble */
725 save_optimization_state(&state);
727 set_opt_normalize(0);
730 /* add Keeps for should_be_different constrained nodes */
731 /* beware: needs schedule due to usage of be_ssa_constr */
732 assure_constraints(birg);
733 BE_TIMER_POP(t_constr);
735 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
737 /* stuff needs to be done after scheduling but before register allocation */
738 BE_TIMER_PUSH(t_codegen);
739 arch_code_generator_before_ra(birg->cg);
740 BE_TIMER_POP(t_codegen);
742 /* connect all stack modifying nodes together (see beabi.c) */
743 BE_TIMER_PUSH(t_abi);
744 be_abi_fix_stack_nodes(birg->abi);
747 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
750 BE_TIMER_PUSH(t_verify);
751 be_sched_vrfy(birg, be_options.vrfy_option);
752 BE_TIMER_POP(t_verify);
755 stat_ev_dbl("bemain_costs_before_ra",
756 be_estimate_irg_costs(irg, birg->exec_freq));
757 be_stat_ev("bemain_insns_before_ra", be_count_insns(irg));
758 be_stat_ev("bemain_blocks_before_ra", be_count_blocks(irg));
761 /* Do register allocation */
762 be_allocate_registers(birg);
764 #ifdef FIRM_STATISTICS
765 stat_ev_dbl("bemain_costs_before_ra", be_estimate_irg_costs(irg, birg->exec_freq));
768 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
770 /* let the code generator prepare the graph for emitter */
771 BE_TIMER_PUSH(t_finish);
772 arch_code_generator_after_ra(birg->cg);
773 BE_TIMER_POP(t_finish);
775 /* fix stack offsets */
776 BE_TIMER_PUSH(t_abi);
777 be_abi_fix_stack_nodes(birg->abi);
778 be_remove_dead_nodes_from_schedule(birg);
779 be_abi_fix_stack_bias(birg->abi);
782 dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched);
784 BE_TIMER_PUSH(t_finish);
785 arch_code_generator_finish(birg->cg);
786 BE_TIMER_POP(t_finish);
788 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
791 be_stat_ev("bemain_insns_finish", be_count_insns(irg));
792 be_stat_ev("bemain_blocks_finish", be_count_blocks(irg));
795 /* check schedule and register allocation */
796 BE_TIMER_PUSH(t_verify);
797 if (be_options.vrfy_option == BE_VRFY_WARN) {
798 irg_verify(irg, VRFY_ENFORCE_SSA);
799 be_check_dominance(irg);
800 be_verify_out_edges(irg);
801 be_verify_schedule(birg);
802 be_verify_register_allocation(birg);
803 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
804 assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
805 assert(be_verify_out_edges(irg) && "out edge verification failed");
806 assert(be_check_dominance(irg) && "Dominance verification failed");
807 assert(be_verify_schedule(birg) && "Schedule verification failed");
808 assert(be_verify_register_allocation(birg)
809 && "register allocation verification failed");
812 BE_TIMER_POP(t_verify);
814 /* emit assembler code */
815 BE_TIMER_PUSH(t_emit);
816 arch_code_generator_done(birg->cg);
817 BE_TIMER_POP(t_emit);
819 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
821 BE_TIMER_PUSH(t_abi);
822 be_abi_free(birg->abi);
825 restore_optimization_state(&state);
827 BE_TIMER_POP(t_other);
829 #define STOP_AND_RESET_TIMER(timer) do { ir_timer_stop(timer); ir_timer_reset(timer); } while(0)
831 #define LC_EMIT(timer) \
833 stat_ev_dbl(ir_timer_get_name(timer), ir_timer_elapsed_msec(timer)); \
835 printf("%-20s: %8.3lf msec\n", ir_timer_get_description(timer), (double)ir_timer_elapsed_usec(timer) / 1000.0); \
837 STOP_AND_RESET_TIMER(timer);
842 printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
849 LC_EMIT(t_ssa_constr);
852 LC_EMIT(t_ra_prolog);
854 LC_EMIT(t_ra_spill_apply);
855 LC_EMIT(t_ra_constr);
858 LC_EMIT(t_ra_copymin);
860 LC_EMIT(t_ra_epilog);
871 /* switched off due to statistics (statistic module needs all irgs) */
872 #ifdef FIRM_STATISTICS
874 #endif /* FIRM_STATISTICS */
876 stat_ev_ctx_pop("bemain_irg");
884 /* Main interface to the frontend. */
885 void be_main(FILE *file_handle, const char *cup_name)
887 ir_timer_t *t = NULL;
889 /* The user specified another config file to read. do that now. */
890 if (config_file[0] != '\0') {
891 FILE *f = fopen(config_file, "rt");
894 lc_opt_from_file(config_file, f, NULL);
897 fprintf(stderr, "Warning: Cannot open config file '%s'\n", config_file);
901 if (be_options.timing == BE_TIME_ON) {
902 t = ir_timer_register("bemain", "measure complete bemain loop");
904 if (ir_timer_enter_high_priority()) {
905 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
908 ir_timer_reset_and_start(t);
911 #ifdef FIRM_STATISTICS
912 if (be_options.statev) {
913 const char *dot = strrchr(cup_name, '.');
914 const char *pos = dot ? dot : cup_name + strlen(cup_name);
915 char *buf = ALLOCAN(char, pos - cup_name + 1);
916 strncpy(buf, cup_name, pos - cup_name);
917 buf[pos - cup_name] = '\0';
919 be_options.statev = 1;
920 stat_ev_begin(buf, be_options.filtev);
921 stat_ev_ctx_push_str("bemain_compilation_unit", cup_name);
925 /* never build code for pseudo irgs */
926 set_visit_pseudo_irgs(0);
930 be_main_loop(file_handle, cup_name);
932 if (be_options.timing == BE_TIME_ON) {
934 ir_timer_leave_high_priority();
936 stat_ev_dbl("bemain_backend_time", ir_timer_elapsed_msec(t));
938 printf("%-20s: %lu msec\n", "BEMAINLOOP", ir_timer_elapsed_msec(t));
942 #ifdef FIRM_STATISTICS
943 if (be_options.statev) {
944 stat_ev_ctx_pop("bemain_compilation_unit");
950 unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
953 bs = bitset_alloca(cls->n_regs);
955 bitset_clear_all(bs);
957 assert(bitset_size(bs) == cls->n_regs);
958 arch_put_non_ignore_regs(cls, bs);
960 be_abi_put_ignore_regs(birg->abi, cls, bs);
962 return bitset_popcnt(bs);