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"
49 #include "execfreq_t.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"
75 #include "beemitter.h"
77 #define NEW_ID(s) new_id_from_chars(s, sizeof(s) - 1)
79 /* options visible for anyone */
80 be_options_t be_options = {
81 DUMP_NONE, /* dump flags */
82 BE_TIME_OFF, /* no timing */
83 false, /* profile_generate */
84 false, /* profile_use */
85 0, /* try to omit frame pointer */
86 0, /* create PIC code */
87 BE_VERIFY_WARN, /* verification level: warn */
90 0, /* enable statistic event dumping */
91 "", /* print stat events */
92 1, /* verbose assembler output */
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),
138 LC_OPT_ENT_BOOL ("verboseasm", "enable verbose assembler output", &be_options.verbose_asm),
140 LC_OPT_ENT_STR("ilp.server", "the ilp server name", be_options.ilp_server),
141 LC_OPT_ENT_STR("ilp.solver", "the ilp solver name", be_options.ilp_solver),
145 static be_module_list_entry_t *isa_ifs = NULL;
146 static bool isa_initialized = false;
148 asm_constraint_flags_t asm_constraint_flags[256];
150 static void initialize_isa(void)
155 isa_initialized = true;
158 static void finish_isa(void)
160 if (isa_initialized) {
162 isa_initialized = false;
166 void be_init_default_asm_constraint_flags(void)
168 asm_constraint_flags['?'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
169 asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
170 asm_constraint_flags['&'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
171 | ASM_CONSTRAINT_FLAG_MODIFIER_EARLYCLOBBER;
172 asm_constraint_flags['%'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
173 | ASM_CONSTRAINT_FLAG_MODIFIER_COMMUTATIVE;
174 asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
176 asm_constraint_flags['='] = ASM_CONSTRAINT_FLAG_MODIFIER_WRITE
177 | ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ;
178 asm_constraint_flags['+'] = ASM_CONSTRAINT_FLAG_MODIFIER_READ
179 | ASM_CONSTRAINT_FLAG_MODIFIER_WRITE;
181 asm_constraint_flags['i'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
182 asm_constraint_flags['s'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
183 asm_constraint_flags['E'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
184 asm_constraint_flags['F'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
185 asm_constraint_flags['G'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
186 asm_constraint_flags['H'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
187 asm_constraint_flags['I'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
188 asm_constraint_flags['J'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
189 asm_constraint_flags['K'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
190 asm_constraint_flags['L'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
191 asm_constraint_flags['M'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
192 asm_constraint_flags['N'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
193 asm_constraint_flags['O'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
194 asm_constraint_flags['P'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
196 asm_constraint_flags['m'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
197 asm_constraint_flags['o'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
198 asm_constraint_flags['V'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
199 asm_constraint_flags['<'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
200 asm_constraint_flags['>'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
202 asm_constraint_flags['p'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
203 asm_constraint_flags['0'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
204 asm_constraint_flags['1'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
205 asm_constraint_flags['2'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
206 asm_constraint_flags['3'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
207 asm_constraint_flags['4'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
208 asm_constraint_flags['5'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
209 asm_constraint_flags['6'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
210 asm_constraint_flags['7'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
211 asm_constraint_flags['8'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
212 asm_constraint_flags['9'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
214 asm_constraint_flags['X'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER
215 | ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP
216 | ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
218 /* these should have been catched by the parsing code already */
219 asm_constraint_flags['#'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
220 asm_constraint_flags['*'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
221 asm_constraint_flags[' '] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
222 asm_constraint_flags['\t'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
223 asm_constraint_flags['\n'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
224 asm_constraint_flags['\r'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
227 asm_constraint_flags_t be_parse_asm_constraints(const char *constraint)
229 asm_constraint_flags_t flags = ASM_CONSTRAINT_FLAG_NONE;
231 asm_constraint_flags_t tflags;
235 for (c = constraint; *c != '\0'; ++c) {
238 /* 'comment' stuff */
239 while (*c != 0 && *c != ',')
243 /* 'comment' character */
252 tflags = asm_constraint_flags[(int) *c];
256 flags |= isa_if->parse_asm_constraint(&c);
263 flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE &&
264 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE
266 flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ &&
267 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ
269 flags |= ASM_CONSTRAINT_FLAG_INVALID;
271 if (!(flags & (ASM_CONSTRAINT_FLAG_MODIFIER_READ |
272 ASM_CONSTRAINT_FLAG_MODIFIER_WRITE |
273 ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE |
274 ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ)
276 flags |= ASM_CONSTRAINT_FLAG_MODIFIER_READ;
282 int be_is_valid_clobber(const char *clobber)
286 /* memory is a valid clobber. (the frontend has to detect this case too,
287 * because it has to add memory edges to the asm) */
288 if (strcmp(clobber, "memory") == 0)
290 /* cc (condition code) is always valid */
291 if (strcmp(clobber, "cc") == 0)
294 return isa_if->is_valid_clobber(clobber);
297 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
302 be_add_module_to_list(&isa_ifs, name, (void*) isa);
305 static void be_opt_register(void)
307 lc_opt_entry_t *be_grp;
308 static int run_once = 0;
314 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
315 lc_opt_add_table(be_grp, be_main_options);
317 be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
318 &isa_ifs, (void**) &isa_if);
323 /* Parse one argument. */
324 int be_parse_arg(const char *arg)
326 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
327 if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
328 lc_opt_print_help_for_entry(be_grp, '-', stdout);
331 return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
334 /* Perform schedule verification if requested. */
335 static void be_sched_verify(ir_graph *irg, int verify_opt)
337 if (verify_opt == BE_VERIFY_WARN) {
338 be_verify_schedule(irg);
339 } else if (verify_opt == BE_VERIFY_ASSERT) {
340 assert(be_verify_schedule(irg) && "Schedule verification failed.");
344 /* Initialize the Firm backend. Must be run first in init_firm()! */
345 void firm_be_init(void)
351 /* Finalize the Firm backend. */
352 void firm_be_finish(void)
358 /* Returns the backend parameter */
359 const backend_params *be_get_backend_param(void)
362 return isa_if->get_params();
365 int be_is_big_endian(void)
367 return be_get_backend_param()->byte_order_big_endian;
370 unsigned be_get_machine_size(void)
372 return be_get_backend_param()->machine_size;
375 ir_mode *be_get_mode_float_arithmetic(void)
377 return be_get_backend_param()->mode_float_arithmetic;
380 ir_type *be_get_type_long_long(void)
382 return be_get_backend_param()->type_long_long;
385 ir_type *be_get_type_unsigned_long_long(void)
387 return be_get_backend_param()->type_unsigned_long_long;
390 ir_type *be_get_type_long_double(void)
392 return be_get_backend_param()->type_long_double;
396 * Initializes the main environment for the backend.
398 * @param env an empty environment
399 * @param file_handle the file handle where the output will be written to
401 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle,
402 const char *compilation_unit_name)
404 memset(env, 0, sizeof(*env));
405 env->file_handle = file_handle;
406 env->ent_trampoline_map = pmap_create();
407 env->pic_trampolines_type = new_type_class(NEW_ID("$PIC_TRAMPOLINE_TYPE"));
408 env->ent_pic_symbol_map = pmap_create();
409 env->pic_symbols_type = new_type_struct(NEW_ID("$PIC_SYMBOLS_TYPE"));
410 env->cup_name = compilation_unit_name;
412 set_class_final(env->pic_trampolines_type, 1);
414 memset(asm_constraint_flags, 0, sizeof(asm_constraint_flags));
415 env->arch_env = arch_env_begin_codegeneration(isa_if, env);
421 * Called when the be_main_env_t can be destroyed.
423 static void be_done_env(be_main_env_t *env)
425 pmap_destroy(env->ent_trampoline_map);
426 pmap_destroy(env->ent_pic_symbol_map);
427 free_type(env->pic_trampolines_type);
428 free_type(env->pic_symbols_type);
432 * A wrapper around a firm dumper. Dumps only, if
435 * @param mask a bitmask containing the reason what will be dumped
436 * @param irg the IR graph to dump
437 * @param suffix the suffix for the dumper
438 * @param dumper the dumper to be called
440 static void dump(int mask, ir_graph *irg, const char *suffix)
442 if (be_options.dump_flags & mask)
443 dump_ir_graph(irg, suffix);
447 * Prepare a backend graph for code generation and initialize its irg
449 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
451 /* don't duplicate locals in backend when dumping... */
452 ir_remove_dump_flags(ir_dump_flag_consts_local);
454 dump(DUMP_INITIAL, irg, "begin");
458 memset(birg, 0, sizeof(*birg));
459 birg->main_env = env;
460 obstack_init(&birg->obst);
461 birg->lv = be_liveness_new(irg);
463 edges_deactivate(irg);
466 /* set the current graph (this is important for several firm functions) */
467 current_ir_graph = irg;
469 /* we do this before critical edge split. As this produces less returns,
470 because sometimes (= 164.gzip) multiple returns are slower */
471 normalize_n_returns(irg);
473 /* Remove critical edges */
474 remove_critical_cf_edges_ex(irg, /*ignore_exception_edges=*/0);
476 /* For code generation all unreachable code and Bad nodes should be gone */
477 remove_unreachable_code(irg);
480 /* Ensure, that the ir_edges are computed. */
483 add_irg_constraints(irg, IR_GRAPH_CONSTRAINT_BACKEND);
484 be_info_init_irg(irg);
486 dump(DUMP_INITIAL, irg, "prepared");
491 static const char *get_timer_name(be_timer_id_t id)
494 case T_ABI: return "abi";
495 case T_CODEGEN: return "codegen";
496 case T_RA_PREPARATION: return "ra_preparation";
497 case T_SCHED: return "sched";
498 case T_SPLIT: return "split";
499 case T_CONSTR: return "constr";
500 case T_FINISH: return "finish";
501 case T_EMIT: return "emit";
502 case T_VERIFY: return "verify";
503 case T_OTHER: return "other";
504 case T_HEIGHTS: return "heights";
505 case T_LIVE: return "live";
506 case T_EXECFREQ: return "execfreq";
507 case T_SSA_CONSTR: return "ssa_constr";
508 case T_RA_PROLOG: return "ra_prolog";
509 case T_RA_EPILOG: return "ra_epilog";
510 case T_RA_CONSTR: return "ra_constr";
511 case T_RA_SPILL: return "ra_spill";
512 case T_RA_SPILL_APPLY: return "ra_spill_apply";
513 case T_RA_COLOR: return "ra_color";
514 case T_RA_IFG: return "ra_ifg";
515 case T_RA_COPYMIN: return "ra_copymin";
516 case T_RA_SSA: return "ra_ssa";
517 case T_RA_OTHER: return "ra_other";
521 ir_timer_t *be_timers[T_LAST+1];
523 void be_lower_for_target(void)
529 isa_if->lower_for_target();
530 /* set the phase to low */
531 for (i = get_irp_n_irgs(); i > 0;) {
532 ir_graph *irg = get_irp_irg(--i);
533 assert(!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_TARGET_LOWERED));
534 add_irg_constraints(irg, IR_GRAPH_CONSTRAINT_TARGET_LOWERED);
539 * The Firm backend main loop.
540 * Do architecture specific lowering for all graphs
541 * and call the architecture specific code generator.
543 * @param file_handle the file handle the output will be written to
544 * @param cup_name name of the compilation unit
546 static void be_main_loop(FILE *file_handle, const char *cup_name)
548 static const char suffix[] = ".prof";
554 char prof_filename[256];
556 arch_env_t *arch_env;
558 be_timing = (be_options.timing == BE_TIME_ON);
560 /* perform target lowering if it didn't happen yet */
561 if (get_irp_n_irgs() > 0 && !irg_is_constrained(get_irp_irg(0), IR_GRAPH_CONSTRAINT_TARGET_LOWERED))
562 be_lower_for_target();
565 for (i = 0; i < T_LAST+1; ++i) {
566 be_timers[i] = ir_timer_new();
570 be_init_env(&env, file_handle, cup_name);
572 arch_env = env.arch_env;
574 /* we might need 1 birg more for instrumentation constructor */
575 num_irgs = get_irp_n_irgs();
576 birgs = ALLOCAN(be_irg_t, num_irgs + 1);
580 /* First: initialize all birgs */
582 for (i = 0; i < num_irgs; ++i) {
583 ir_graph *irg = get_irp_irg(i);
584 ir_entity *entity = get_irg_entity(irg);
585 if (get_entity_linkage(entity) & IR_LINKAGE_NO_CODEGEN)
587 initialize_birg(&birgs[num_birgs++], irg, &env);
589 arch_env_handle_intrinsics(arch_env);
592 Get the filename for the profiling data.
593 Beware: '\0' is already included in sizeof(suffix)
595 sprintf(prof_filename, "%.*s%s",
596 (int)(sizeof(prof_filename) - sizeof(suffix)), cup_name, suffix);
598 bool have_profile = false;
599 if (be_options.opt_profile_use) {
600 bool res = ir_profile_read(prof_filename);
602 fprintf(stderr, "Warning: Couldn't read profile data '%s'\n",
605 ir_create_execfreqs_from_profile();
611 if (num_birgs > 0 && be_options.opt_profile_generate) {
612 ir_graph *const prof_init_irg = ir_profile_instrument(prof_filename);
613 assert(prof_init_irg->be_data == NULL);
614 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
617 assert(num_irgs == get_irp_n_irgs());
620 for (be_timer_id_t t = T_FIRST; t < T_LAST+1; ++t) {
621 ir_timer_init_parent(be_timers[t]);
624 be_timer_push(T_EXECFREQ);
625 for (i = 0; i < num_irgs; ++i) {
626 ir_graph *irg = get_irp_irg(i);
627 ir_estimate_execfreq(irg);
629 be_timer_pop(T_EXECFREQ);
633 for (i = 0; i < num_irgs; ++i) {
634 ir_graph *const irg = get_irp_irg(i);
635 ir_entity *const entity = get_irg_entity(irg);
636 if (get_entity_linkage(entity) & IR_LINKAGE_NO_CODEGEN)
639 /* set the current graph (this is important for several firm functions) */
640 current_ir_graph = irg;
642 if (stat_ev_enabled) {
643 stat_ev_ctx_push_fmt("bemain_irg", "%+F", irg);
644 stat_ev_ull("bemain_insns_start", be_count_insns(irg));
645 stat_ev_ull("bemain_blocks_start", be_count_blocks(irg));
648 /* stop and reset timers */
649 be_timer_push(T_OTHER);
651 /* Verify the initial graph */
652 be_timer_push(T_VERIFY);
653 if (be_options.verify_option == BE_VERIFY_WARN) {
654 irg_verify(irg, VERIFY_ENFORCE_SSA);
655 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
656 assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
658 be_timer_pop(T_VERIFY);
660 /* get a code generator for this graph. */
661 if (arch_env->impl->init_graph)
662 arch_env->impl->init_graph(irg);
664 /* some transformations need to be done before abi introduce */
665 if (arch_env->impl->before_abi != NULL)
666 arch_env->impl->before_abi(irg);
668 /* implement the ABI conventions. */
669 if (!arch_env->custom_abi) {
670 be_timer_push(T_ABI);
671 be_abi_introduce(irg);
673 dump(DUMP_ABI, irg, "abi");
676 /* We can't have Bad-blocks or critical edges in the backend.
677 * Before removing Bads, we remove unreachable code. */
678 optimize_graph_df(irg);
679 remove_critical_cf_edges(irg);
682 /* We often have dead code reachable through out-edges here. So for
683 * now we rebuild edges (as we need correct user count for code
685 edges_deactivate(irg);
688 dump(DUMP_PREPARED, irg, "before-code-selection");
690 /* perform codeselection */
691 be_timer_push(T_CODEGEN);
692 if (arch_env->impl->prepare_graph != NULL)
693 arch_env->impl->prepare_graph(irg);
694 be_timer_pop(T_CODEGEN);
696 dump(DUMP_PREPARED, irg, "code-selection");
698 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
699 /* be_live_chk_compare(irg); */
701 /* schedule the irg */
702 be_timer_push(T_SCHED);
703 be_schedule_graph(irg);
704 be_timer_pop(T_SCHED);
706 dump(DUMP_SCHED, irg, "sched");
709 be_timer_push(T_VERIFY);
710 be_sched_verify(irg, be_options.verify_option);
711 be_timer_pop(T_VERIFY);
713 /* introduce patterns to assure constraints */
714 be_timer_push(T_CONSTR);
715 /* we switch off optimizations here, because they might cause trouble */
716 optimization_state_t state;
717 save_optimization_state(&state);
721 /* add Keeps for should_be_different constrained nodes */
722 /* beware: needs schedule due to usage of be_ssa_constr */
723 assure_constraints(irg);
724 be_timer_pop(T_CONSTR);
726 dump(DUMP_SCHED, irg, "assured");
728 /* stuff needs to be done after scheduling but before register allocation */
729 be_timer_push(T_RA_PREPARATION);
730 if (arch_env->impl->before_ra != NULL)
731 arch_env->impl->before_ra(irg);
732 be_timer_pop(T_RA_PREPARATION);
734 /* connect all stack modifying nodes together (see beabi.c) */
735 be_timer_push(T_ABI);
736 be_abi_fix_stack_nodes(irg);
739 dump(DUMP_SCHED, irg, "fix_stack");
742 be_timer_push(T_VERIFY);
743 be_sched_verify(irg, be_options.verify_option);
744 be_timer_pop(T_VERIFY);
746 if (stat_ev_enabled) {
747 stat_ev_dbl("bemain_costs_before_ra", be_estimate_irg_costs(irg));
748 stat_ev_ull("bemain_insns_before_ra", be_count_insns(irg));
749 stat_ev_ull("bemain_blocks_before_ra", be_count_blocks(irg));
752 /* Do register allocation */
753 be_allocate_registers(irg);
755 stat_ev_dbl("bemain_costs_before_ra", be_estimate_irg_costs(irg));
757 dump(DUMP_RA, irg, "ra");
759 be_timer_push(T_FINISH);
760 if (arch_env->impl->finish_graph != NULL)
761 arch_env->impl->finish_graph(irg);
762 be_timer_pop(T_FINISH);
764 dump(DUMP_FINAL, irg, "finish");
766 if (stat_ev_enabled) {
767 stat_ev_ull("bemain_insns_finish", be_count_insns(irg));
768 stat_ev_ull("bemain_blocks_finish", be_count_blocks(irg));
771 /* check schedule and register allocation */
772 be_timer_push(T_VERIFY);
773 if (be_options.verify_option == BE_VERIFY_WARN) {
774 irg_verify(irg, VERIFY_ENFORCE_SSA);
775 be_verify_schedule(irg);
776 be_verify_register_allocation(irg);
777 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
778 assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
779 assert(be_verify_schedule(irg) && "Schedule verification failed");
780 assert(be_verify_register_allocation(irg)
781 && "register allocation verification failed");
784 be_timer_pop(T_VERIFY);
786 /* emit assembler code */
787 be_timer_push(T_EMIT);
788 if (arch_env->impl->emit != NULL)
789 arch_env->impl->emit(irg);
790 be_timer_pop(T_EMIT);
792 dump(DUMP_FINAL, irg, "end");
794 restore_optimization_state(&state);
796 be_timer_pop(T_OTHER);
800 if (stat_ev_enabled) {
801 for (t = T_FIRST; t < T_LAST+1; ++t) {
803 snprintf(buf, sizeof(buf), "bemain_time_%s",
805 stat_ev_dbl(buf, ir_timer_elapsed_usec(be_timers[i]));
808 printf("==>> IRG %s <<==\n",
809 get_entity_name(get_irg_entity(irg)));
810 for (t = T_FIRST; t < T_LAST+1; ++t) {
811 double val = ir_timer_elapsed_usec(be_timers[t]) / 1000.0;
812 printf("%-20s: %10.3f msec\n", get_timer_name(t), val);
815 for (t = T_FIRST; t < T_LAST+1; ++t) {
816 ir_timer_reset(be_timers[t]);
821 stat_ev_ctx_pop("bemain_irg");
824 arch_env_end_codegeneration(arch_env);
831 /* Main interface to the frontend. */
832 void be_main(FILE *file_handle, const char *cup_name)
834 ir_timer_t *t = NULL;
836 if (be_options.timing == BE_TIME_ON) {
839 if (ir_timer_enter_high_priority()) {
840 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
843 ir_timer_reset_and_start(t);
846 if (be_options.statev) {
847 const char *dot = strrchr(cup_name, '.');
848 const char *pos = dot ? dot : cup_name + strlen(cup_name);
849 char *buf = ALLOCAN(char, pos - cup_name + 1);
850 strncpy(buf, cup_name, pos - cup_name);
851 buf[pos - cup_name] = '\0';
853 be_options.statev = 1;
854 stat_ev_begin(buf, be_options.filtev);
855 stat_ev_ctx_push_str("bemain_compilation_unit", cup_name);
858 be_main_loop(file_handle, cup_name);
860 if (be_options.timing == BE_TIME_ON) {
862 ir_timer_leave_high_priority();
863 if (stat_ev_enabled) {
864 stat_ev_dbl("bemain_backend_time", ir_timer_elapsed_msec(t));
866 double val = ir_timer_elapsed_usec(t) / 1000.0;
867 printf("%-20s: %10.3f msec\n", "BEMAINLOOP", val);
871 if (be_options.statev) {
872 stat_ev_ctx_pop("bemain_compilation_unit");
877 static int do_lower_for_target(ir_prog *irp, void *context)
879 be_lower_for_target();
885 ir_prog_pass_t *lower_for_target_pass(const char *name)
887 ir_prog_pass_t *pass = XMALLOCZ(ir_prog_pass_t);
888 return def_prog_pass_constructor(pass,
889 name ? name : "lower_for_target",
890 do_lower_for_target);