2 * Copyright (C) 1995-2011 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
32 #include "lc_opts_enum.h"
42 #include "iredges_t.h"
47 #include "iroptimize.h"
50 #include "irprofile.h"
61 #include "belistsched.h"
64 #include "bechordal_t.h"
66 #include "becopyopt.h"
67 #include "becopystat.h"
68 #include "bessadestr.h"
73 #include "be_dbgout.h"
76 #include "beemitter.h"
78 #define NEW_ID(s) new_id_from_chars(s, sizeof(s) - 1)
80 /* options visible for anyone */
81 static be_options_t be_options = {
82 DUMP_NONE, /* dump flags */
83 BE_TIME_OFF, /* no timing */
84 false, /* profile_generate */
85 false, /* profile_use */
86 0, /* try to omit frame pointer */
87 0, /* create PIC code */
88 BE_VERIFY_WARN, /* verification level: warn */
91 0, /* enable statistic event dumping */
92 "", /* print stat events */
95 /* back end instruction set architecture to use */
96 static const arch_isa_if_t *isa_if = NULL;
98 /* possible dumping options */
99 static const lc_opt_enum_mask_items_t dump_items[] = {
100 { "none", DUMP_NONE },
101 { "initial", DUMP_INITIAL },
103 { "sched", DUMP_SCHED },
104 { "prepared", DUMP_PREPARED },
105 { "regalloc", DUMP_RA },
106 { "final", DUMP_FINAL },
108 { "all", 2 * DUMP_BE - 1 },
112 /* verify options. */
113 static const lc_opt_enum_int_items_t verify_items[] = {
114 { "off", BE_VERIFY_OFF },
115 { "warn", BE_VERIFY_WARN },
116 { "assert", BE_VERIFY_ASSERT },
120 static lc_opt_enum_mask_var_t dump_var = {
121 &be_options.dump_flags, dump_items
124 static lc_opt_enum_int_var_t verify_var = {
125 &be_options.verify_option, verify_items
128 static const lc_opt_table_entry_t be_main_options[] = {
129 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
130 LC_OPT_ENT_BOOL ("omitfp", "omit frame pointer", &be_options.omit_fp),
131 LC_OPT_ENT_BOOL ("pic", "create PIC code", &be_options.pic),
132 LC_OPT_ENT_ENUM_INT ("verify", "verify the backend irg", &verify_var),
133 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
134 LC_OPT_ENT_BOOL ("profilegenerate", "instrument the code for execution count profiling", &be_options.opt_profile_generate),
135 LC_OPT_ENT_BOOL ("profileuse", "use existing profile data", &be_options.opt_profile_use),
136 LC_OPT_ENT_BOOL ("statev", "dump statistic events", &be_options.statev),
137 LC_OPT_ENT_STR ("filtev", "filter for stat events (regex if support is active", be_options.filtev),
139 LC_OPT_ENT_STR("ilp.server", "the ilp server name", be_options.ilp_server),
140 LC_OPT_ENT_STR("ilp.solver", "the ilp solver name", be_options.ilp_solver),
144 static be_module_list_entry_t *isa_ifs = NULL;
145 static bool isa_initialized = false;
147 asm_constraint_flags_t asm_constraint_flags[256];
149 static void initialize_isa(void)
156 void be_init_default_asm_constraint_flags(void)
158 asm_constraint_flags['?'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
159 asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
160 asm_constraint_flags['&'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
161 | ASM_CONSTRAINT_FLAG_MODIFIER_EARLYCLOBBER;
162 asm_constraint_flags['%'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
163 | ASM_CONSTRAINT_FLAG_MODIFIER_COMMUTATIVE;
164 asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
166 asm_constraint_flags['='] = ASM_CONSTRAINT_FLAG_MODIFIER_WRITE
167 | ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ;
168 asm_constraint_flags['+'] = ASM_CONSTRAINT_FLAG_MODIFIER_READ
169 | ASM_CONSTRAINT_FLAG_MODIFIER_WRITE;
171 asm_constraint_flags['i'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
172 asm_constraint_flags['s'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
173 asm_constraint_flags['E'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
174 asm_constraint_flags['F'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
175 asm_constraint_flags['G'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
176 asm_constraint_flags['H'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
177 asm_constraint_flags['I'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
178 asm_constraint_flags['J'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
179 asm_constraint_flags['K'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
180 asm_constraint_flags['L'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
181 asm_constraint_flags['M'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
182 asm_constraint_flags['N'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
183 asm_constraint_flags['O'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
184 asm_constraint_flags['P'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
186 asm_constraint_flags['m'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
187 asm_constraint_flags['o'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
188 asm_constraint_flags['V'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
189 asm_constraint_flags['<'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
190 asm_constraint_flags['>'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
192 asm_constraint_flags['p'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
193 asm_constraint_flags['0'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
194 asm_constraint_flags['1'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
195 asm_constraint_flags['2'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
196 asm_constraint_flags['3'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
197 asm_constraint_flags['4'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
198 asm_constraint_flags['5'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
199 asm_constraint_flags['6'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
200 asm_constraint_flags['7'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
201 asm_constraint_flags['8'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
202 asm_constraint_flags['9'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
204 asm_constraint_flags['X'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER
205 | ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP
206 | ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
208 /* these should have been catched by the parsing code already */
209 asm_constraint_flags['#'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
210 asm_constraint_flags['*'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
211 asm_constraint_flags[' '] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
212 asm_constraint_flags['\t'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
213 asm_constraint_flags['\n'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
214 asm_constraint_flags['\r'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
217 asm_constraint_flags_t be_parse_asm_constraints(const char *constraint)
219 asm_constraint_flags_t flags = ASM_CONSTRAINT_FLAG_NONE;
221 asm_constraint_flags_t tflags;
225 for (c = constraint; *c != '\0'; ++c) {
228 /* 'comment' stuff */
229 while (*c != 0 && *c != ',')
233 /* 'comment' character */
242 tflags = asm_constraint_flags[(int) *c];
246 flags |= isa_if->parse_asm_constraint(&c);
253 flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE &&
254 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE
256 flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ &&
257 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ
259 flags |= ASM_CONSTRAINT_FLAG_INVALID;
261 if (!(flags & (ASM_CONSTRAINT_FLAG_MODIFIER_READ |
262 ASM_CONSTRAINT_FLAG_MODIFIER_WRITE |
263 ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE |
264 ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ)
266 flags |= ASM_CONSTRAINT_FLAG_MODIFIER_READ;
272 int be_is_valid_clobber(const char *clobber)
276 /* memory is a valid clobber. (the frontend has to detect this case too,
277 * because it has to add memory edges to the asm) */
278 if (strcmp(clobber, "memory") == 0)
280 /* cc (condition code) is always valid */
281 if (strcmp(clobber, "cc") == 0)
284 return isa_if->is_valid_clobber(clobber);
287 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
292 be_add_module_to_list(&isa_ifs, name, (void*) isa);
295 static void be_opt_register(void)
297 lc_opt_entry_t *be_grp;
298 static int run_once = 0;
304 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
305 lc_opt_add_table(be_grp, be_main_options);
307 be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
308 &isa_ifs, (void**) &isa_if);
313 /* Parse one argument. */
314 int be_parse_arg(const char *arg)
316 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
317 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
318 lc_opt_print_help_for_entry(be_grp, '-', stdout);
321 return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
324 /* Perform schedule verification if requested. */
325 static void be_sched_verify(ir_graph *irg, int verify_opt)
327 if (verify_opt == BE_VERIFY_WARN) {
328 be_verify_schedule(irg);
329 } else if (verify_opt == BE_VERIFY_ASSERT) {
330 assert(be_verify_schedule(irg) && "Schedule verification failed.");
334 /* Initialize the Firm backend. Must be run first in init_firm()! */
335 void firm_be_init(void)
341 /* Finalize the Firm backend. */
342 void firm_be_finish(void)
347 /* Returns the backend parameter */
348 const backend_params *be_get_backend_param(void)
351 return isa_if->get_params();
355 * Initializes the main environment for the backend.
357 * @param env an empty environment
358 * @param file_handle the file handle where the output will be written to
360 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle,
361 const char *compilation_unit_name)
363 memset(env, 0, sizeof(*env));
364 env->options = &be_options;
365 env->file_handle = file_handle;
366 env->ent_trampoline_map = pmap_create();
367 env->pic_trampolines_type = new_type_class(NEW_ID("$PIC_TRAMPOLINE_TYPE"));
368 env->ent_pic_symbol_map = pmap_create();
369 env->pic_symbols_type = new_type_struct(NEW_ID("$PIC_SYMBOLS_TYPE"));
370 env->cup_name = compilation_unit_name;
372 set_class_final(env->pic_trampolines_type, 1);
374 memset(asm_constraint_flags, 0, sizeof(asm_constraint_flags));
375 env->arch_env = arch_env_begin_codegeneration(isa_if, env);
381 * Called when the be_main_env_t can be destroyed.
383 static void be_done_env(be_main_env_t *env)
385 pmap_destroy(env->ent_trampoline_map);
386 pmap_destroy(env->ent_pic_symbol_map);
387 free_type(env->pic_trampolines_type);
388 free_type(env->pic_symbols_type);
392 * A wrapper around a firm dumper. Dumps only, if
395 * @param mask a bitmask containing the reason what will be dumped
396 * @param irg the IR graph to dump
397 * @param suffix the suffix for the dumper
398 * @param dumper the dumper to be called
400 static void dump(int mask, ir_graph *irg, const char *suffix)
402 if (be_options.dump_flags & mask)
403 dump_ir_graph(irg, suffix);
407 * Prepare a backend graph for code generation and initialize its irg
409 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
411 /* don't duplicate locals in backend when dumping... */
412 ir_remove_dump_flags(ir_dump_flag_consts_local);
414 dump(DUMP_INITIAL, irg, "begin");
418 memset(birg, 0, sizeof(*birg));
420 birg->main_env = env;
421 obstack_init(&birg->obst);
423 edges_deactivate_kind(irg, EDGE_KIND_DEP);
424 edges_activate_kind(irg, EDGE_KIND_DEP);
426 /* set the current graph (this is important for several firm functions) */
427 current_ir_graph = irg;
429 /* we do this before critical edge split. As this produces less returns,
430 because sometimes (= 164.gzip) multiple returns are slower */
431 normalize_n_returns(irg);
433 /* Remove critical edges */
434 remove_critical_cf_edges_ex(irg, /*ignore_exception_edges=*/0);
436 /* For code generation all unreachable code and Bad nodes should be gone */
437 remove_unreachable_code(irg);
440 /* Ensure, that the ir_edges are computed. */
443 set_irg_phase_state(irg, phase_backend);
444 be_info_init_irg(irg);
446 dump(DUMP_INITIAL, irg, "prepared");
451 static const char *get_timer_name(be_timer_id_t id)
454 case T_ABI: return "abi";
455 case T_CODEGEN: return "codegen";
456 case T_RA_PREPARATION: return "ra_preparation";
457 case T_SCHED: return "sched";
458 case T_CONSTR: return "constr";
459 case T_FINISH: return "finish";
460 case T_EMIT: return "emit";
461 case T_VERIFY: return "verify";
462 case T_OTHER: return "other";
463 case T_HEIGHTS: return "heights";
464 case T_LIVE: return "live";
465 case T_EXECFREQ: return "execfreq";
466 case T_SSA_CONSTR: return "ssa_constr";
467 case T_RA_PROLOG: return "ra_prolog";
468 case T_RA_EPILOG: return "ra_epilog";
469 case T_RA_CONSTR: return "ra_constr";
470 case T_RA_SPILL: return "ra_spill";
471 case T_RA_SPILL_APPLY: return "ra_spill_apply";
472 case T_RA_COLOR: return "ra_color";
473 case T_RA_IFG: return "ra_ifg";
474 case T_RA_COPYMIN: return "ra_copymin";
475 case T_RA_SSA: return "ra_ssa";
476 case T_RA_OTHER: return "ra_other";
480 ir_timer_t *be_timers[T_LAST+1];
482 void be_lower_for_target(void)
488 /* shouldn't lower program twice */
489 assert(get_irp_phase_state() != phase_low);
491 isa_if->lower_for_target();
492 /* set the phase to low */
493 for (i = get_irp_n_irgs(); i > 0;) {
494 ir_graph *irg = get_irp_irg(--i);
495 set_irg_phase_state(irg, phase_low);
497 set_irp_phase_state(phase_low);
501 * The Firm backend main loop.
502 * Do architecture specific lowering for all graphs
503 * and call the architecture specific code generator.
505 * @param file_handle the file handle the output will be written to
506 * @param cup_name name of the compilation unit
508 static void be_main_loop(FILE *file_handle, const char *cup_name)
510 static const char suffix[] = ".prof";
514 char prof_filename[256];
516 arch_env_t *arch_env;
518 be_timing = (be_options.timing == BE_TIME_ON);
520 /* perform target lowering if it didn't happen yet */
521 if (get_irp_phase_state() != phase_low)
522 be_lower_for_target();
525 for (i = 0; i < T_LAST+1; ++i) {
526 be_timers[i] = ir_timer_new();
530 be_init_env(&env, file_handle, cup_name);
532 arch_env = env.arch_env;
534 /* we might need 1 birg more for instrumentation constructor */
535 num_birgs = get_irp_n_irgs();
536 birgs = ALLOCAN(be_irg_t, num_birgs + 1);
540 /* First: initialize all birgs */
541 for (i = 0; i < num_birgs; ++i) {
542 ir_graph *irg = get_irp_irg(i);
543 initialize_birg(&birgs[i], irg, &env);
545 arch_env_handle_intrinsics(arch_env);
548 Get the filename for the profiling data.
549 Beware: '\0' is already included in sizeof(suffix)
551 sprintf(prof_filename, "%.*s%s",
552 (int)(sizeof(prof_filename) - sizeof(suffix)), cup_name, suffix);
554 if (be_options.opt_profile_use) {
555 bool res = ir_profile_read(prof_filename);
557 fprintf(stderr, "Warning: Couldn't read profile data '%s'\n",
561 if (num_birgs > 0 && be_options.opt_profile_generate) {
562 ir_graph *prof_init_irg
563 = ir_profile_instrument(prof_filename);
564 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
569 for (i = 0; i < num_birgs; ++i) {
570 be_irg_t *birg = &birgs[i];
571 ir_graph *irg = birg->irg;
572 optimization_state_t state;
574 /* set the current graph (this is important for several firm functions) */
575 current_ir_graph = irg;
577 if (stat_ev_enabled) {
578 stat_ev_ctx_push_fobj("bemain_irg", irg);
579 be_stat_ev("bemain_insns_start", be_count_insns(irg));
580 be_stat_ev("bemain_blocks_start", be_count_blocks(irg));
583 /* stop and reset timers */
584 be_timer_push(T_OTHER);
586 /* Verify the initial graph */
587 be_timer_push(T_VERIFY);
588 if (be_options.verify_option == BE_VERIFY_WARN) {
589 irg_verify(irg, VERIFY_ENFORCE_SSA);
590 be_check_dominance(irg);
591 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
592 assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
593 assert(be_check_dominance(irg) && "Dominance verification failed");
595 be_timer_pop(T_VERIFY);
597 /* get a code generator for this graph. */
598 arch_env->impl->init_graph(irg);
600 /* some transformations need to be done before abi introduce */
601 if (arch_env->impl->before_abi != NULL)
602 arch_env->impl->before_abi(irg);
604 /* implement the ABI conventions. */
605 if (!arch_env->custom_abi) {
606 be_timer_push(T_ABI);
607 be_abi_introduce(irg);
609 dump(DUMP_ABI, irg, "abi");
612 /* We can't have Bad-blocks or critical edges in the backend.
613 * Before removing Bads, we remove unreachable code. */
614 optimize_graph_df(irg);
615 remove_critical_cf_edges(irg);
618 /* We often have dead code reachable through out-edges here. So for
619 * now we rebuild edges (as we need correct user count for code
621 edges_deactivate(irg);
624 dump(DUMP_PREPARED, irg, "before-code-selection");
626 if (be_options.verify_option == BE_VERIFY_WARN) {
627 be_check_dominance(irg);
628 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
629 assert(be_check_dominance(irg) && "Dominance verification failed");
632 /* perform codeselection */
633 be_timer_push(T_CODEGEN);
634 if (arch_env->impl->prepare_graph != NULL)
635 arch_env->impl->prepare_graph(irg);
636 be_timer_pop(T_CODEGEN);
638 if (be_options.verify_option == BE_VERIFY_WARN) {
639 be_check_dominance(irg);
640 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
641 assert(be_check_dominance(irg) && "Dominance verification failed");
644 dump(DUMP_PREPARED, irg, "code-selection");
646 be_timer_push(T_EXECFREQ);
648 * Create execution frequencies from profile data or estimate some
650 if (ir_profile_has_data())
651 birg->exec_freq = ir_create_execfreqs_from_profile(irg);
653 /* TODO: edges are corrupt for EDGE_KIND_BLOCK after the local
654 * optimize graph phase merges blocks in the x86 backend */
655 edges_deactivate(irg);
656 birg->exec_freq = compute_execfreq(irg, 10);
658 be_timer_pop(T_EXECFREQ);
661 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
662 /* be_live_chk_compare(irg); */
664 /* schedule the irg */
665 be_timer_push(T_SCHED);
666 be_schedule_graph(irg);
667 be_timer_pop(T_SCHED);
669 dump(DUMP_SCHED, irg, "sched");
672 be_timer_push(T_VERIFY);
673 be_sched_verify(irg, be_options.verify_option);
674 be_timer_pop(T_VERIFY);
676 /* introduce patterns to assure constraints */
677 be_timer_push(T_CONSTR);
678 /* we switch off optimizations here, because they might cause trouble */
679 save_optimization_state(&state);
683 /* add Keeps for should_be_different constrained nodes */
684 /* beware: needs schedule due to usage of be_ssa_constr */
685 assure_constraints(irg);
686 be_timer_pop(T_CONSTR);
688 dump(DUMP_SCHED, irg, "assured");
690 /* stuff needs to be done after scheduling but before register allocation */
691 be_timer_push(T_RA_PREPARATION);
692 if (arch_env->impl->before_ra != NULL)
693 arch_env->impl->before_ra(irg);
694 be_timer_pop(T_RA_PREPARATION);
696 /* connect all stack modifying nodes together (see beabi.c) */
697 be_timer_push(T_ABI);
698 be_abi_fix_stack_nodes(irg);
701 dump(DUMP_SCHED, irg, "fix_stack");
704 be_timer_push(T_VERIFY);
705 be_sched_verify(irg, be_options.verify_option);
706 be_timer_pop(T_VERIFY);
708 if (stat_ev_enabled) {
709 stat_ev_dbl("bemain_costs_before_ra",
710 be_estimate_irg_costs(irg, birg->exec_freq));
711 be_stat_ev("bemain_insns_before_ra", be_count_insns(irg));
712 be_stat_ev("bemain_blocks_before_ra", be_count_blocks(irg));
715 /* Do register allocation */
716 be_allocate_registers(irg);
718 stat_ev_dbl("bemain_costs_before_ra", be_estimate_irg_costs(irg, birg->exec_freq));
720 dump(DUMP_RA, irg, "ra");
722 be_timer_push(T_FINISH);
723 if (arch_env->impl->finish != NULL)
724 arch_env->impl->finish(irg);
725 be_timer_pop(T_FINISH);
727 dump(DUMP_FINAL, irg, "finish");
729 if (stat_ev_enabled) {
730 be_stat_ev("bemain_insns_finish", be_count_insns(irg));
731 be_stat_ev("bemain_blocks_finish", be_count_blocks(irg));
734 /* check schedule and register allocation */
735 be_timer_push(T_VERIFY);
736 if (be_options.verify_option == BE_VERIFY_WARN) {
737 irg_verify(irg, VERIFY_ENFORCE_SSA);
738 be_check_dominance(irg);
739 be_verify_schedule(irg);
740 be_verify_register_allocation(irg);
741 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
742 assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
743 assert(be_check_dominance(irg) && "Dominance verification failed");
744 assert(be_verify_schedule(irg) && "Schedule verification failed");
745 assert(be_verify_register_allocation(irg)
746 && "register allocation verification failed");
749 be_timer_pop(T_VERIFY);
751 /* emit assembler code */
752 be_timer_push(T_EMIT);
753 if (arch_env->impl->emit != NULL)
754 arch_env->impl->emit(irg);
755 be_timer_pop(T_EMIT);
757 dump(DUMP_FINAL, irg, "end");
759 if (!arch_env->custom_abi) {
760 be_timer_push(T_ABI);
765 restore_optimization_state(&state);
767 be_timer_pop(T_OTHER);
771 if (stat_ev_enabled) {
772 for (t = T_FIRST; t < T_LAST+1; ++t) {
774 snprintf(buf, sizeof(buf), "bemain_time_%s",
776 stat_ev_dbl(buf, ir_timer_elapsed_usec(be_timers[i]));
779 printf("==>> IRG %s <<==\n",
780 get_entity_name(get_irg_entity(irg)));
781 for (t = T_FIRST; t < T_LAST+1; ++t) {
782 double val = ir_timer_elapsed_usec(be_timers[t]) / 1000.0;
783 printf("%-20s: %8.3lf msec\n", get_timer_name(t), val);
786 for (t = T_FIRST; t < T_LAST+1; ++t) {
787 ir_timer_stop(be_timers[t]);
788 ir_timer_reset(be_timers[t]);
793 stat_ev_ctx_pop("bemain_irg");
796 arch_env_end_codegeneration(arch_env);
804 /* Main interface to the frontend. */
805 void be_main(FILE *file_handle, const char *cup_name)
807 ir_timer_t *t = NULL;
809 if (be_options.timing == BE_TIME_ON) {
812 if (ir_timer_enter_high_priority()) {
813 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
816 ir_timer_reset_and_start(t);
819 if (be_options.statev) {
820 const char *dot = strrchr(cup_name, '.');
821 const char *pos = dot ? dot : cup_name + strlen(cup_name);
822 char *buf = ALLOCAN(char, pos - cup_name + 1);
823 strncpy(buf, cup_name, pos - cup_name);
824 buf[pos - cup_name] = '\0';
826 be_options.statev = 1;
827 stat_ev_begin(buf, be_options.filtev);
828 stat_ev_ctx_push_str("bemain_compilation_unit", cup_name);
831 be_main_loop(file_handle, cup_name);
833 if (be_options.timing == BE_TIME_ON) {
835 ir_timer_leave_high_priority();
836 if (stat_ev_enabled) {
837 stat_ev_dbl("bemain_backend_time", ir_timer_elapsed_msec(t));
839 double val = ir_timer_elapsed_usec(t) / 1000.0;
840 printf("%-20s: %8.3lf msec\n", "BEMAINLOOP", val);
844 if (be_options.statev) {
845 stat_ev_ctx_pop("bemain_compilation_unit");
850 static int do_lower_for_target(ir_prog *irp, void *context)
852 be_lower_for_target();
858 ir_prog_pass_t *lower_for_target_pass(const char *name)
860 ir_prog_pass_t *pass = XMALLOCZ(ir_prog_pass_t);
861 return def_prog_pass_constructor(pass,
862 name ? name : "lower_for_target",
863 do_lower_for_target);