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"
43 #include "iredges_t.h"
48 #include "iroptimize.h"
51 #include "irprofile.h"
61 #include "belistsched.h"
64 #include "bechordal_t.h"
66 #include "becopyopt.h"
67 #include "becopystat.h"
68 #include "bessadestr.h"
71 #include "beschedmris.h"
74 #include "be_dbgout.h"
77 #define NEW_ID(s) new_id_from_chars(s, sizeof(s) - 1)
80 #include "beilpsched.h"
83 /* options visible for anyone */
84 static be_options_t be_options = {
85 DUMP_NONE, /* dump flags */
86 BE_TIME_OFF, /* no timing */
87 0, /* no opt profile */
88 0, /* try to omit frame pointer */
89 0, /* try to omit leaf frame pointer */
90 0, /* create PIC code */
91 0, /* create gprof compatible profiling code */
92 BE_VERIFY_WARN, /* verification level: warn */
93 BE_SCHED_LIST, /* scheduler: list scheduler */
94 "linux", /* target OS name */
95 "i44pc52.info.uni-karlsruhe.de", /* ilp server */
96 "cplex", /* ilp solver */
97 0, /* enable statistic event dumping */
98 "", /* print stat events */
102 static char config_file[256] = { 0 };
104 /* back end instruction set architecture to use */
105 static const arch_isa_if_t *isa_if = NULL;
107 /* possible dumping options */
108 static const lc_opt_enum_mask_items_t dump_items[] = {
109 { "none", DUMP_NONE },
110 { "initial", DUMP_INITIAL },
112 { "sched", DUMP_SCHED },
113 { "prepared", DUMP_PREPARED },
114 { "regalloc", DUMP_RA },
115 { "final", DUMP_FINAL },
117 { "all", 2 * DUMP_BE - 1 },
121 /* verify options. */
122 static const lc_opt_enum_int_items_t verify_items[] = {
123 { "off", BE_VERIFY_OFF },
124 { "warn", BE_VERIFY_WARN },
125 { "assert", BE_VERIFY_ASSERT },
129 /* scheduling options. */
130 static const lc_opt_enum_int_items_t sched_items[] = {
131 { "list", BE_SCHED_LIST },
133 { "ilp", BE_SCHED_ILP },
134 #endif /* WITH_ILP */
138 static lc_opt_enum_mask_var_t dump_var = {
139 &be_options.dump_flags, dump_items
142 static lc_opt_enum_int_var_t verify_var = {
143 &be_options.verify_option, verify_items
146 static lc_opt_enum_int_var_t sched_var = {
147 &be_options.scheduler, sched_items
150 static const lc_opt_table_entry_t be_main_options[] = {
151 LC_OPT_ENT_STR ("config", "read another config file containing backend options", config_file, sizeof(config_file)),
152 LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
153 LC_OPT_ENT_BOOL ("omitfp", "omit frame pointer", &be_options.omit_fp),
154 LC_OPT_ENT_BOOL ("omitleaffp", "omit frame pointer in leaf routines", &be_options.omit_leaf_fp),
155 LC_OPT_ENT_BOOL ("pic", "create PIC code", &be_options.pic),
156 LC_OPT_ENT_BOOL ("gprof", "create gprof profiling code", &be_options.gprof),
157 LC_OPT_ENT_ENUM_PTR ("verify", "verify the backend irg", &verify_var),
158 LC_OPT_ENT_BOOL ("time", "get backend timing statistics", &be_options.timing),
159 LC_OPT_ENT_BOOL ("profile", "instrument the code for execution count profiling", &be_options.opt_profile),
160 LC_OPT_ENT_ENUM_PTR ("sched", "select a scheduler", &sched_var),
161 LC_OPT_ENT_STR ("os", "specify target operating system", &be_options.target_os, sizeof(be_options.target_os)),
162 #ifdef FIRM_STATISTICS
163 LC_OPT_ENT_BOOL ("statev", "dump statistic events", &be_options.statev),
164 LC_OPT_ENT_STR ("filtev", "filter for stat events (regex if support is active", &be_options.filtev, sizeof(be_options.filtev)),
168 LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
169 LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
170 #endif /* WITH_ILP */
174 static be_module_list_entry_t *isa_ifs = NULL;
177 unsigned short asm_constraint_flags[256];
179 void be_init_default_asm_constraint_flags(void)
181 asm_constraint_flags['?'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
182 asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
183 asm_constraint_flags['&'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
184 | ASM_CONSTRAINT_FLAG_MODIFIER_EARLYCLOBBER;
185 asm_constraint_flags['%'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
186 | ASM_CONSTRAINT_FLAG_MODIFIER_COMMUTATIVE;
187 asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
189 asm_constraint_flags['='] = ASM_CONSTRAINT_FLAG_MODIFIER_WRITE
190 | ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ;
191 asm_constraint_flags['+'] = ASM_CONSTRAINT_FLAG_MODIFIER_READ
192 | ASM_CONSTRAINT_FLAG_MODIFIER_WRITE;
194 asm_constraint_flags['i'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
195 asm_constraint_flags['s'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
196 asm_constraint_flags['E'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
197 asm_constraint_flags['F'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
198 asm_constraint_flags['G'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
199 asm_constraint_flags['H'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
200 asm_constraint_flags['I'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
201 asm_constraint_flags['J'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
202 asm_constraint_flags['K'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
203 asm_constraint_flags['L'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
204 asm_constraint_flags['M'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
205 asm_constraint_flags['N'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
206 asm_constraint_flags['O'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
207 asm_constraint_flags['P'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
209 asm_constraint_flags['m'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
210 asm_constraint_flags['o'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
211 asm_constraint_flags['V'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
212 asm_constraint_flags['<'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
213 asm_constraint_flags['>'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
215 asm_constraint_flags['p'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
216 asm_constraint_flags['0'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
217 asm_constraint_flags['1'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
218 asm_constraint_flags['2'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
219 asm_constraint_flags['3'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
220 asm_constraint_flags['4'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
221 asm_constraint_flags['5'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
222 asm_constraint_flags['6'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
223 asm_constraint_flags['7'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
224 asm_constraint_flags['8'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
225 asm_constraint_flags['9'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
227 asm_constraint_flags['X'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER
228 | ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP
229 | ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
231 /* these should have been catched by the parsing code already */
232 asm_constraint_flags['#'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
233 asm_constraint_flags['*'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
234 asm_constraint_flags[' '] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
235 asm_constraint_flags['\t'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
236 asm_constraint_flags['\n'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
237 asm_constraint_flags['\r'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
240 asm_constraint_flags_t be_parse_asm_constraints(const char *constraint)
242 asm_constraint_flags_t flags = 0;
244 asm_constraint_flags_t tflags;
246 for (c = constraint; *c != '\0'; ++c) {
249 /* 'comment' stuff */
250 while (*c != 0 && *c != ',')
254 /* 'comment' character */
263 tflags = asm_constraint_flags[(int) *c];
267 flags |= isa_if->parse_asm_constraint(&c);
274 flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE &&
275 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE
277 flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ &&
278 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ
280 flags |= ASM_CONSTRAINT_FLAG_INVALID;
282 if (!(flags & (ASM_CONSTRAINT_FLAG_MODIFIER_READ |
283 ASM_CONSTRAINT_FLAG_MODIFIER_WRITE |
284 ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE |
285 ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ)
287 flags |= ASM_CONSTRAINT_FLAG_MODIFIER_READ;
293 int be_is_valid_clobber(const char *clobber)
295 /* memory is a valid clobber. (the frontend has to detect this case too,
296 * because it has to add memory edges to the asm) */
297 if (strcmp(clobber, "memory") == 0)
299 /* cc (condition code) is always valid */
300 if (strcmp(clobber, "cc") == 0)
303 return isa_if->is_valid_clobber(clobber);
306 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
311 be_add_module_to_list(&isa_ifs, name, (void*) isa);
314 void be_opt_register(void)
316 lc_opt_entry_t *be_grp;
317 static int run_once = 0;
323 be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
324 lc_opt_add_table(be_grp, be_main_options);
326 be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
327 &isa_ifs, (void**) &isa_if);
332 /* Parse one argument. */
333 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 /* Perform schedule verification if requested. */
344 static void be_sched_verify(ir_graph *irg, int verify_opt)
346 if (verify_opt == BE_VERIFY_WARN) {
347 be_verify_schedule(irg);
348 } else if (verify_opt == BE_VERIFY_ASSERT) {
349 assert(be_verify_schedule(irg) && "Schedule verification failed.");
353 /* Initialize the Firm backend. Must be run first in init_firm()! */
354 void firm_be_init(void)
360 /* Finalize the Firm backend. */
361 void firm_be_finish(void)
366 /* Returns the backend parameter */
367 const backend_params *be_get_backend_param(void)
369 return isa_if->get_params();
373 * Initializes the main environment for the backend.
375 * @param env an empty environment
376 * @param file_handle the file handle where the output will be written to
378 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
380 memset(env, 0, sizeof(*env));
381 env->options = &be_options;
382 env->ent_trampoline_map = pmap_create();
383 env->pic_trampolines_type = new_type_class(NEW_ID("$PIC_TRAMPOLINE_TYPE"));
384 env->ent_pic_symbol_map = pmap_create();
385 env->pic_symbols_type = new_type_struct(NEW_ID("$PIC_SYMBOLS_TYPE"));
387 remove_irp_type(env->pic_trampolines_type);
388 remove_irp_type(env->pic_symbols_type);
389 set_class_final(env->pic_trampolines_type, 1);
391 memset(asm_constraint_flags, 0, sizeof(asm_constraint_flags));
392 env->arch_env = arch_env_init(isa_if, file_handle, env);
399 * Called when the be_main_env_t can be destroyed.
401 static void be_done_env(be_main_env_t *env)
403 arch_env_done(env->arch_env);
406 pmap_destroy(env->ent_trampoline_map);
407 pmap_destroy(env->ent_pic_symbol_map);
408 free_type(env->pic_trampolines_type);
409 free_type(env->pic_symbols_type);
413 * A wrapper around a firm dumper. Dumps only, if
416 * @param mask a bitmask containing the reason what will be dumped
417 * @param irg the IR graph to dump
418 * @param suffix the suffix for the dumper
419 * @param dumper the dumper to be called
421 static void dump(int mask, ir_graph *irg, const char *suffix)
423 if (be_options.dump_flags & mask)
424 dump_ir_graph(irg, suffix);
428 * Prepare a backend graph for code generation and initialize its irg
430 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
432 /* don't duplicate locals in backend when dumping... */
433 ir_remove_dump_flags(ir_dump_flag_consts_local);
435 dump(DUMP_INITIAL, irg, "begin");
439 memset(birg, 0, sizeof(*birg));
441 birg->main_env = env;
442 obstack_init(&birg->obst);
444 edges_deactivate_kind(irg, EDGE_KIND_DEP);
445 edges_activate_kind(irg, EDGE_KIND_DEP);
447 /* set the current graph (this is important for several firm functions) */
448 current_ir_graph = irg;
450 /* Normalize proj nodes. */
451 normalize_proj_nodes(irg);
453 /* we do this before critical edge split. As this produces less returns,
454 because sometimes (= 164.gzip) multiple returns are slower */
455 normalize_n_returns(irg);
457 /* Remove critical edges */
458 remove_critical_cf_edges_ex(irg, /*ignore_exception_edges=*/0);
460 /* Ensure, that the ir_edges are computed. */
463 set_irg_phase_state(irg, phase_backend);
464 be_info_init_irg(irg);
466 dump(DUMP_INITIAL, irg, "prepared");
469 #define BE_TIMER_ONLY(code) do { if (be_timing) { code; } } while (0)
473 static const char *get_timer_name(be_timer_id_t id)
476 case T_ABI: return "abi";
477 case T_CODEGEN: return "codegen";
478 case T_RA_PREPARATION: return "ra_preparation";
479 case T_SCHED: return "sched";
480 case T_CONSTR: return "constr";
481 case T_FINISH: return "finish";
482 case T_EMIT: return "emit";
483 case T_VERIFY: return "verify";
484 case T_OTHER: return "other";
485 case T_HEIGHTS: return "heights";
486 case T_LIVE: return "live";
487 case T_EXECFREQ: return "execfreq";
488 case T_SSA_CONSTR: return "ssa_constr";
489 case T_RA_PROLOG: return "ra_prolog";
490 case T_RA_EPILOG: return "ra_epilog";
491 case T_RA_CONSTR: return "ra_constr";
492 case T_RA_SPILL: return "ra_spill";
493 case T_RA_SPILL_APPLY: return "ra_spill_apply";
494 case T_RA_COLOR: return "ra_color";
495 case T_RA_IFG: return "ra_ifg";
496 case T_RA_COPYMIN: return "ra_copymin";
497 case T_RA_SSA: return "ra_ssa";
498 case T_RA_OTHER: return "ra_other";
502 ir_timer_t *be_timers[T_LAST+1];
505 * The Firm backend main loop.
506 * Do architecture specific lowering for all graphs
507 * and call the architecture specific code generator.
509 * @param file_handle the file handle the output will be written to
510 * @param cup_name name of the compilation unit
512 static void be_main_loop(FILE *file_handle, const char *cup_name)
514 static const char suffix[] = ".prof";
516 int i, num_birgs, stat_active = 0;
518 char prof_filename[256];
520 ir_graph **irg_list, **backend_irg_list;
521 arch_env_t *arch_env;
523 be_timing = (be_options.timing == BE_TIME_ON);
526 for (i = 0; i < T_LAST+1; ++i) {
527 be_timers[i] = ir_timer_new();
531 be_init_env(&env, file_handle);
532 env.cup_name = cup_name;
537 arch_env = env.arch_env;
539 /* backend may provide an ordered list of irgs where code should be
541 irg_list = NEW_ARR_F(ir_graph *, 0);
542 backend_irg_list = arch_env_get_backend_irg_list(arch_env, &irg_list);
544 /* we might need 1 birg more for instrumentation constructor */
545 num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs();
546 birgs = ALLOCAN(be_irg_t, num_birgs + 1);
550 /* First: initialize all birgs */
551 for (i = 0; i < num_birgs; ++i) {
552 ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i);
553 initialize_birg(&birgs[i], irg, &env);
555 arch_env_handle_intrinsics(arch_env);
559 Get the filename for the profiling data.
560 Beware: '\0' is already included in sizeof(suffix)
562 memset(prof_filename, 0, sizeof(prof_filename));
563 strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
564 strcat(prof_filename, suffix);
567 Next: Either instruments all irgs with profiling code
568 or try to read in profile data for current translation unit.
570 if (be_options.opt_profile) {
571 ir_graph *prof_init_irg = ir_profile_instrument(prof_filename, profile_default);
572 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
575 ir_profile_read(prof_filename);
578 #ifdef FIRM_STATISTICS
579 stat_active = stat_is_active();
580 #endif /* FIRM_STATISTICS */
583 for (i = 0; i < num_birgs; ++i) {
584 be_irg_t *birg = &birgs[i];
585 ir_graph *irg = birg->irg;
586 optimization_state_t state;
587 const arch_code_generator_if_t *cg_if;
589 /* set the current graph (this is important for several firm functions) */
590 current_ir_graph = irg;
593 stat_ev_ctx_push_fobj("bemain_irg", irg);
594 be_stat_ev("bemain_insns_start", be_count_insns(irg));
595 be_stat_ev("bemain_blocks_start", be_count_blocks(irg));
598 /* stop and reset timers */
599 be_timer_push(T_OTHER);
601 /* Verify the initial graph */
602 be_timer_push(T_VERIFY);
603 if (be_options.verify_option == BE_VERIFY_WARN) {
604 irg_verify(irg, VERIFY_ENFORCE_SSA);
605 be_check_dominance(irg);
606 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
607 assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
608 assert(be_check_dominance(irg) && "Dominance verification failed");
610 be_timer_pop(T_VERIFY);
612 /* Get the code generator interface. */
613 cg_if = arch_env_get_code_generator_if(arch_env);
615 /* get a code generator for this graph. */
616 birg->cg = cg_if->init(irg);
618 /* some transformations need to be done before abi introduce */
619 assert(birg->cg->impl->before_abi == NULL || !arch_env->custom_abi);
620 arch_code_generator_before_abi(birg->cg);
622 /* implement the ABI conventions. */
623 be_timer_push(T_ABI);
624 be_abi_introduce(irg);
627 if (!arch_env->custom_abi) {
628 dump(DUMP_ABI, irg, "abi");
631 /* we have to do cfopt+remove_critical_edges as we can't have Bad-blocks
632 * or critical edges in the backend */
634 remove_critical_cf_edges(irg);
636 /* We often have dead code reachable through out-edges here. So for
637 * now we rebuild edges (as we need correct user count for code
639 edges_deactivate(irg);
642 dump(DUMP_PREPARED, irg, "before-code-selection");
644 if (be_options.verify_option == BE_VERIFY_WARN) {
645 be_check_dominance(irg);
646 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
647 assert(be_check_dominance(irg) && "Dominance verification failed");
650 /* perform codeselection */
651 be_timer_push(T_CODEGEN);
652 arch_code_generator_prepare_graph(birg->cg);
653 be_timer_pop(T_CODEGEN);
655 if (be_options.verify_option == BE_VERIFY_WARN) {
656 be_check_dominance(irg);
657 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
658 assert(be_check_dominance(irg) && "Dominance verification failed");
661 be_timer_push(T_EXECFREQ);
663 * Create execution frequencies from profile data or estimate some
665 if (ir_profile_has_data())
666 birg->exec_freq = ir_create_execfreqs_from_profile(irg);
668 /* TODO: edges are corrupt for EDGE_KIND_BLOCK after the local
669 * optimize graph phase merges blocks in the x86 backend */
670 edges_deactivate(irg);
671 birg->exec_freq = compute_execfreq(irg, 10);
673 be_timer_pop(T_EXECFREQ);
676 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
677 /* be_live_chk_compare(irg); */
679 /* schedule the irg */
680 be_timer_push(T_SCHED);
681 switch (be_options.scheduler) {
683 fprintf(stderr, "Warning: invalid scheduler (%d) selected, falling back to list scheduler.\n", be_options.scheduler);
691 #endif /* WITH_ILP */
693 be_timer_pop(T_SCHED);
695 dump(DUMP_SCHED, irg, "sched");
698 be_timer_push(T_VERIFY);
699 be_sched_verify(irg, be_options.verify_option);
700 be_timer_pop(T_VERIFY);
702 /* introduce patterns to assure constraints */
703 be_timer_push(T_CONSTR);
704 /* we switch off optimizations here, because they might cause trouble */
705 save_optimization_state(&state);
707 set_opt_normalize(0);
710 /* add Keeps for should_be_different constrained nodes */
711 /* beware: needs schedule due to usage of be_ssa_constr */
712 assure_constraints(irg);
713 be_timer_pop(T_CONSTR);
715 dump(DUMP_SCHED, irg, "assured");
717 /* stuff needs to be done after scheduling but before register allocation */
718 be_timer_push(T_RA_PREPARATION);
719 arch_code_generator_before_ra(birg->cg);
720 be_timer_pop(T_RA_PREPARATION);
722 /* connect all stack modifying nodes together (see beabi.c) */
723 be_timer_push(T_ABI);
724 be_abi_fix_stack_nodes(irg);
727 dump(DUMP_SCHED, irg, "fix_stack");
730 be_timer_push(T_VERIFY);
731 be_sched_verify(irg, be_options.verify_option);
732 be_timer_pop(T_VERIFY);
735 stat_ev_dbl("bemain_costs_before_ra",
736 be_estimate_irg_costs(irg, birg->exec_freq));
737 be_stat_ev("bemain_insns_before_ra", be_count_insns(irg));
738 be_stat_ev("bemain_blocks_before_ra", be_count_blocks(irg));
741 /* Do register allocation */
742 be_allocate_registers(irg);
744 #ifdef FIRM_STATISTICS
745 stat_ev_dbl("bemain_costs_before_ra", be_estimate_irg_costs(irg, birg->exec_freq));
748 dump(DUMP_RA, irg, "ra");
750 /* let the code generator prepare the graph for emitter */
751 be_timer_push(T_FINISH);
752 arch_code_generator_after_ra(birg->cg);
753 be_timer_pop(T_FINISH);
755 /* fix stack offsets */
756 be_timer_push(T_ABI);
757 be_abi_fix_stack_nodes(irg);
758 be_remove_dead_nodes_from_schedule(irg);
759 be_abi_fix_stack_bias(irg);
762 dump(DUMP_SCHED, irg, "fix_stack_after_ra");
764 be_timer_push(T_FINISH);
765 arch_code_generator_finish(birg->cg);
766 be_timer_pop(T_FINISH);
768 dump(DUMP_FINAL, irg, "finish");
771 be_stat_ev("bemain_insns_finish", be_count_insns(irg));
772 be_stat_ev("bemain_blocks_finish", be_count_blocks(irg));
775 /* check schedule and register allocation */
776 be_timer_push(T_VERIFY);
777 if (be_options.verify_option == BE_VERIFY_WARN) {
778 irg_verify(irg, VERIFY_ENFORCE_SSA);
779 be_check_dominance(irg);
780 be_verify_schedule(irg);
781 be_verify_register_allocation(irg);
782 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
783 assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
784 assert(be_check_dominance(irg) && "Dominance verification failed");
785 assert(be_verify_schedule(irg) && "Schedule verification failed");
786 assert(be_verify_register_allocation(irg)
787 && "register allocation verification failed");
790 be_timer_pop(T_VERIFY);
792 /* emit assembler code */
793 be_timer_push(T_EMIT);
794 arch_code_generator_done(birg->cg);
795 be_timer_pop(T_EMIT);
797 dump(DUMP_FINAL, irg, "end");
799 be_timer_push(T_ABI);
803 restore_optimization_state(&state);
805 be_timer_pop(T_OTHER);
809 if (stat_ev_enabled) {
810 for (t = 0; t < T_LAST+1; ++t) {
812 snprintf(buf, sizeof(buf), "bemain_time_%s",
814 stat_ev_dbl(buf, ir_timer_elapsed_usec(be_timers[i]));
817 printf("==>> IRG %s <<==\n",
818 get_entity_name(get_irg_entity(irg)));
819 for (t = 0; t < T_LAST+1; ++t) {
820 double val = ir_timer_elapsed_usec(be_timers[t]) / 1000.0;
821 printf("%-20s: %8.3lf msec\n", get_timer_name(t), val);
824 for (t = 0; t < T_LAST+1; ++t) {
825 ir_timer_stop(be_timers[t]);
826 ir_timer_reset(be_timers[t]);
831 stat_ev_ctx_pop("bemain_irg");
839 /* Main interface to the frontend. */
840 void be_main(FILE *file_handle, const char *cup_name)
842 ir_timer_t *t = NULL;
844 /* The user specified another config file to read. do that now. */
845 if (config_file[0] != '\0') {
846 FILE *f = fopen(config_file, "rt");
849 lc_opt_from_file(config_file, f, NULL);
852 fprintf(stderr, "Warning: Cannot open config file '%s'\n", config_file);
856 if (be_options.timing == BE_TIME_ON) {
859 if (ir_timer_enter_high_priority()) {
860 fprintf(stderr, "Warning: Could not enter high priority mode.\n");
863 ir_timer_reset_and_start(t);
866 #ifdef FIRM_STATISTICS
867 if (be_options.statev) {
868 const char *dot = strrchr(cup_name, '.');
869 const char *pos = dot ? dot : cup_name + strlen(cup_name);
870 char *buf = ALLOCAN(char, pos - cup_name + 1);
871 strncpy(buf, cup_name, pos - cup_name);
872 buf[pos - cup_name] = '\0';
874 be_options.statev = 1;
875 stat_ev_begin(buf, be_options.filtev);
876 stat_ev_ctx_push_str("bemain_compilation_unit", cup_name);
880 be_main_loop(file_handle, cup_name);
882 if (be_options.timing == BE_TIME_ON) {
884 ir_timer_leave_high_priority();
886 stat_ev_dbl("bemain_backend_time", ir_timer_elapsed_msec(t));
888 double val = ir_timer_elapsed_usec(t) / 1000.0;
889 printf("%-20s: %8.3lf msec\n", "BEMAINLOOP", val);
893 #ifdef FIRM_STATISTICS
894 if (be_options.statev) {
895 stat_ev_ctx_pop("bemain_compilation_unit");
901 static int do_lower_for_target(ir_prog *irp, void *context)
903 const backend_params *be_params = be_get_backend_param();
904 be_params->lower_for_target();
910 ir_prog_pass_t *lower_for_target_pass(const char *name)
912 ir_prog_pass_t *pass = XMALLOCZ(ir_prog_pass_t);
913 return def_prog_pass_constructor(pass,
914 name ? name : "lower_for_target",
915 do_lower_for_target);
918 unsigned be_put_ignore_regs(const ir_graph *irg,
919 const arch_register_class_t *cls, bitset_t *bs)
922 bs = bitset_alloca(cls->n_regs);
924 bitset_clear_all(bs);
926 assert(bitset_size(bs) == cls->n_regs);
927 arch_put_non_ignore_regs(cls, bs);
929 be_abi_put_ignore_regs(be_get_irg_abi(irg), cls, bs);
931 return bitset_popcount(bs);