stabs support updated
[libfirm] / ir / be / bemain.c
1 /**
2  * Backend driver.
3  * @author Sebastian Hack
4  * @date   25.11.2004
5  * @cvsid  $Id$
6  */
7 #ifdef HAVE_CONFIG_H
8 #include "config.h"
9 #endif
10
11 #include <stdarg.h>
12 #include <stdio.h>
13
14 #ifdef WITH_LIBCORE
15 #include <libcore/lc_opts.h>
16 #include <libcore/lc_opts_enum.h>
17 #include <libcore/lc_timing.h>
18 #endif /* WITH_LIBCORE */
19
20 #include "obst.h"
21 #include "bitset.h"
22
23 #include "irprog.h"
24 #include "irgopt.h"
25 #include "irgraph.h"
26 #include "irdump.h"
27 #include "phiclass.h"
28 #include "irdom_t.h"
29 #include "iredges_t.h"
30 #include "irloop_t.h"
31 #include "irtools.h"
32 #include "irvrfy.h"
33 #include "return.h"
34 #include "firmstat.h"
35 #include "cfopt.h"
36 #include "execfreq.h"
37
38 #include "bearch.h"
39 #include "firm/bearch_firm.h"
40 #include "ia32/bearch_ia32.h"
41 #include "arm/bearch_arm.h"
42 #include "ppc32/bearch_ppc32.h"
43 #include "mips/bearch_mips.h"
44
45 #include "be_t.h"
46 #include "benumb_t.h"
47 #include "beutil.h"
48 #include "benode_t.h"
49 #include "beirgmod.h"
50 #include "besched_t.h"
51 #include "belistsched.h"
52 #include "belive_t.h"
53 #include "bespillbelady.h"
54 #include "bera.h"
55 #include "beraextern.h"
56 #include "bechordal_t.h"
57 #include "beifg.h"
58 #include "beifg_impl.h"
59 #include "becopyopt.h"
60 #include "becopystat.h"
61 #include "bessadestr.h"
62 #include "beabi.h"
63 #include "belower.h"
64 #include "beschedmris.h"
65 #include "bestat.h"
66 #include "beverify.h"
67 #include "beprofile.h"
68 #include "be_dbgout.h"
69
70 /* options visible for anyone */
71 static be_options_t be_options = {
72         DUMP_NONE,                         /* dump flags */
73         BE_TIME_OFF,                       /* no timing */
74         BE_SCHED_SELECT_HEUR,              /* mueller heuristic selector */
75         0,                                 /* no opt profile */
76         0,                                 /* disable mris */
77         1,                                 /* try to omit frame pointer */
78         BE_VRFY_WARN,                      /* verification level: warn */
79         "i44pc52.info.uni-karlsruhe.de",   /* ilp server */
80         "cplex"                            /* ilp solver */
81 };
82
83 /* config file. */
84 static char config_file[256] = { 0 };
85
86 /* register allocator to use. */
87 static const be_ra_t *ra = &be_ra_chordal_allocator;
88
89 /* back end instruction set architecture to use */
90 static const arch_isa_if_t *isa_if = &ia32_isa_if;
91
92 #ifdef WITH_LIBCORE
93
94 static lc_opt_entry_t *be_grp_root = NULL;
95
96 /* possible dumping options */
97 static const lc_opt_enum_mask_items_t dump_items[] = {
98         { "none",       DUMP_NONE },
99         { "initial",    DUMP_INITIAL },
100         { "abi",        DUMP_ABI    },
101         { "sched",      DUMP_SCHED  },
102         { "prepared",   DUMP_PREPARED },
103         { "regalloc",   DUMP_RA },
104         { "final",      DUMP_FINAL },
105         { "be",         DUMP_BE },
106         { "all",        2 * DUMP_BE - 1 },
107         { NULL,         0 }
108 };
109
110 /* register allocators */
111 static const lc_opt_enum_const_ptr_items_t ra_items[] = {
112         { "chordal",  &be_ra_chordal_allocator },
113         { "external", &be_ra_external_allocator },
114         { NULL,      NULL }
115 };
116
117 /* instruction set architectures. */
118 static const lc_opt_enum_const_ptr_items_t isa_items[] = {
119         { "ia32",    &ia32_isa_if },
120 #if 0
121         { "arm",     &arm_isa_if },
122         { "ppc32",   &ppc32_isa_if },
123         { "mips",    &mips_isa_if },
124 #endif
125         { NULL,      NULL }
126 };
127
128 /* verify options. */
129 static const lc_opt_enum_int_items_t vrfy_items[] = {
130         { "off",    BE_VRFY_OFF    },
131         { "warn",   BE_VRFY_WARN   },
132         { "assert", BE_VRFY_ASSERT },
133         { NULL,     0 }
134 };
135
136 /* schedule selector options. */
137 static const lc_opt_enum_int_items_t sched_select_items[] = {
138         { "trivial",  BE_SCHED_SELECT_TRIVIAL  },
139         { "random",   BE_SCHED_SELECT_RANDOM },
140         { "regpress", BE_SCHED_SELECT_REGPRESS },
141         { "muchnik",  BE_SCHED_SELECT_MUCHNIK  },
142         { "heur",     BE_SCHED_SELECT_HEUR     },
143         { "hmuchnik", BE_SCHED_SELECT_HMUCHNIK },
144         { NULL,     0 }
145 };
146
147 static lc_opt_enum_mask_var_t dump_var = {
148         &be_options.dump_flags, dump_items
149 };
150
151 static lc_opt_enum_const_ptr_var_t ra_var = {
152         (const void **) &ra, ra_items
153 };
154
155 static lc_opt_enum_const_ptr_var_t isa_var = {
156         (const void **) &isa_if, isa_items
157 };
158
159 static lc_opt_enum_int_var_t vrfy_var = {
160         &be_options.vrfy_option, vrfy_items
161 };
162
163 static lc_opt_enum_int_var_t sched_select_var = {
164         &be_options.sched_select, sched_select_items
165 };
166
167 static const lc_opt_table_entry_t be_main_options[] = {
168         LC_OPT_ENT_STR      ("config",       "read another config file containing backend options",                 config_file, sizeof(config_file)),
169         LC_OPT_ENT_ENUM_MASK("dump",         "dump irg on several occasions",                                       &dump_var),
170         LC_OPT_ENT_ENUM_PTR ("ra",           "register allocator",                                                  &ra_var),
171         LC_OPT_ENT_ENUM_PTR ("isa",          "the instruction set architecture",                                    &isa_var),
172         LC_OPT_ENT_NEGBOOL  ("noomitfp",     "do not omit frame pointer",                                           &be_options.omit_fp),
173         LC_OPT_ENT_ENUM_PTR ("vrfy",         "verify the backend irg (off, warn, assert)",                          &vrfy_var),
174         LC_OPT_ENT_BOOL     ("time",         "get backend timing statistics",                                       &be_options.timing),
175         LC_OPT_ENT_BOOL     ("profile",      "instrument the code for execution count profiling",                   &be_options.opt_profile),
176         LC_OPT_ENT_BOOL     ("sched.mris",   "enable mris schedule preparation",                                    &be_options.mris),
177         LC_OPT_ENT_ENUM_PTR ("sched.select", "schedule node selector (trivial, regpress, muchnik, heur, hmuchnik)", &sched_select_var),
178
179 #ifdef WITH_ILP
180         LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
181         LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
182 #endif /* WITH_ILP */
183         { NULL }
184 };
185
186 #endif /* WITH_LIBCORE */
187
188 void be_opt_register(void)
189 {
190 #ifdef WITH_LIBCORE
191         int i;
192         lc_opt_entry_t *be_grp_ra;
193         static int run_once = 0;
194
195         if (! run_once) {
196                 run_once    = 1;
197                 be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
198                 be_grp_ra   = lc_opt_get_grp(be_grp_root, "ra");
199
200                 lc_opt_add_table(be_grp_root, be_main_options);
201
202                 /* register allocator options */
203                 for(i = 0; ra_items[i].name != NULL; ++i) {
204                         const be_ra_t *ra = ra_items[i].value;
205                         ra->register_options(be_grp_ra);
206                 }
207
208                 /* register isa options */
209                 for(i = 0; isa_items[i].name != NULL; ++i) {
210                         const arch_isa_if_t *isa = isa_items[i].value;
211                         isa->register_options(be_grp_root);
212                 }
213         }
214 #endif /* WITH_LIBCORE */
215 }
216
217 /* Parse one argument. */
218 int be_parse_arg(const char *arg) {
219 #ifdef WITH_LIBCORE
220         if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
221                 lc_opt_print_help(be_grp_root, stdout);
222                 return -1;
223         }
224         return lc_opt_from_single_arg(be_grp_root, NULL, arg, NULL);
225 #else
226         return 0;
227 #endif /* WITH_LIBCORE */
228 }
229
230 /** The be parameters returned by default, all off. */
231 const static backend_params be_params = {
232         NULL,
233         NULL,
234         0,
235         NULL,
236 };
237
238 /* Perform schedule verification if requested. */
239 static void be_sched_vrfy(ir_graph *irg, int vrfy_opt) {
240         if (vrfy_opt == BE_VRFY_WARN) {
241                 be_verify_schedule(irg);
242         }
243         else if (vrfy_opt == BE_VRFY_ASSERT) {
244                 assert(be_verify_schedule(irg) && "Schedule verification failed.");
245         }
246 }
247
248 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
249 const backend_params *be_init(void)
250 {
251         be_opt_register();
252
253         be_sched_init();
254         be_numbering_init();
255         be_copy_opt_init();
256         copystat_init();
257         phi_class_init();
258
259         if (isa_if->get_params)
260                 return isa_if->get_params();
261         return &be_params;
262 }
263
264 /**
265  * Initializes the main environment for the backend.
266  *
267  * @param env          an empty environment
268  * @param file_handle  the file handle where the output will be written to
269  */
270 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
271 {
272         memset(env, 0, sizeof(*env));
273         obstack_init(&env->obst);
274         env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
275         env->options  = &be_options;
276         FIRM_DBG_REGISTER(env->dbg, "be.main");
277
278         arch_env_init(env->arch_env, isa_if, file_handle, env);
279
280         /* Register the irn handler of the architecture */
281         if (arch_isa_get_irn_handler(env->arch_env->isa))
282                 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
283
284         /*
285          * Register the node handler of the back end infrastructure.
286          * This irn handler takes care of the platform independent
287          * spill, reload and perm nodes.
288          */
289         arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
290         env->phi_handler = be_phi_handler_new(env->arch_env);
291         arch_env_push_irn_handler(env->arch_env, env->phi_handler);
292
293         env->db_handle = be_stabs_open(file_handle);
294         return env;
295 }
296
297 static void be_done_env(be_main_env_t *env)
298 {
299         env->arch_env->isa->impl->done(env->arch_env->isa);
300         be_dbg_close(env->db_handle);
301         be_phi_handler_free(env->phi_handler);
302         obstack_free(&env->obst, NULL);
303 }
304
305 /**
306  * A wrapper around a firm dumper. Dumps only, if
307  * flags are enabled.
308  *
309  * @param mask    a bitmask containing the reason what will be dumped
310  * @param irg     the IR graph to dump
311  * @param suffix  the suffix for the dumper
312  * @param dumper  the dumper to be called
313  */
314 static void dump(int mask, ir_graph *irg, const char *suffix,
315                  void (*dumper)(ir_graph *, const char *))
316 {
317         if(be_options.dump_flags & mask)
318                 be_dump(irg, suffix, dumper);
319 }
320
321 /**
322  * Prepare a backend graph for code generation and initialize its birg
323  */
324 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
325 {
326         memset(birg, 0, sizeof(*birg));
327         birg->irg = irg;
328         birg->main_env = env;
329
330         edges_deactivate_kind(irg, EDGE_KIND_DEP);
331         edges_activate_kind(irg, EDGE_KIND_DEP);
332
333         DBG((env->dbg, LEVEL_2, "====> IRG: %F\n", irg));
334         dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
335
336         be_stat_init_irg(env->arch_env, irg);
337         be_do_stat_nodes(irg, "01 Begin");
338
339         /* set the current graph (this is important for several firm functions) */
340         current_ir_graph = irg;
341
342         /* Normalize proj nodes. */
343         normalize_proj_nodes(irg);
344
345         /* Make just one return node. */
346         normalize_one_return(irg);
347
348         /* Remove critical edges */
349         remove_critical_cf_edges(irg);
350
351         /* Compute the dominance information. */
352         free_dom(irg);
353         compute_doms(irg);
354
355         /* Ensure, that the ir_edges are computed. */
356         edges_assure(irg);
357
358         /* check, if the dominance property is fulfilled. */
359         be_check_dominance(irg);
360
361         /* reset the phi handler. */
362         be_phi_handler_reset(env->phi_handler);
363 }
364
365 #ifdef WITH_LIBCORE
366
367 #define BE_TIMER_PUSH(timer)                                                        \
368         if (be_options.timing == BE_TIME_ON) {                                          \
369                 int res = lc_timer_push(timer);                                             \
370                 if (be_options.vrfy_option == BE_VRFY_ASSERT)                               \
371                         assert(res && "Timer already on stack, cannot be pushed twice.");       \
372                 else if (be_options.vrfy_option == BE_VRFY_WARN && ! res)                   \
373                         fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
374                                 lc_timer_get_name(timer));                                          \
375         }
376 #define BE_TIMER_POP(timer)                                                                    \
377         if (be_options.timing == BE_TIME_ON) {                                                     \
378                 lc_timer_t *tmp = lc_timer_pop();                                                      \
379                 if (be_options.vrfy_option == BE_VRFY_ASSERT)                                          \
380                         assert(tmp == timer && "Attempt to pop wrong timer.");                             \
381                 else if (be_options.vrfy_option == BE_VRFY_WARN && tmp != timer)                       \
382                         fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
383                                 lc_timer_get_name(tmp), lc_timer_get_name(timer));                             \
384                 timer = tmp;                                                                           \
385         }
386
387 #define BE_TIMER_ONLY(code)   do { if (be_options.timing == BE_TIME_ON) { code; } } while(0)
388
389 #else
390
391 #define BE_TIMER_PUSH(timer)
392 #define BE_TIMER_POP(timer)
393 #define BE_TIMER_ONLY(code)
394
395 #endif /* WITH_LIBCORE */
396
397
398 /**
399  * The Firm backend main loop.
400  * Do architecture specific lowering for all graphs
401  * and call the architecture specific code generator.
402  *
403  * @param file_handle   the file handle the output will be written to
404  * @param cup_name      name of the compilation unit
405  */
406 static void be_main_loop(FILE *file_handle, const char *cup_name)
407 {
408         int i;
409         arch_isa_t *isa;
410         be_main_env_t env;
411         unsigned num_nodes_b = 0;
412         unsigned num_nodes_a = 0;
413         unsigned num_nodes_r = 0;
414         char prof_filename[256];
415         static const char suffix[] = ".prof";
416         be_irg_t *birgs;
417         unsigned num_birgs;
418
419 #ifdef WITH_LIBCORE
420         lc_timer_t *t_abi      = NULL;
421         lc_timer_t *t_codegen  = NULL;
422         lc_timer_t *t_sched    = NULL;
423         lc_timer_t *t_constr   = NULL;
424         lc_timer_t *t_regalloc = NULL;
425         lc_timer_t *t_finish   = NULL;
426         lc_timer_t *t_emit     = NULL;
427         lc_timer_t *t_other    = NULL;
428         lc_timer_t *t_verify   = NULL;
429         be_ra_timer_t *ra_timer;
430
431         if (be_options.timing == BE_TIME_ON) {
432                 t_abi      = lc_timer_register("beabi",    "be abi introduction");
433                 t_codegen  = lc_timer_register("codegen",  "codegeneration");
434                 t_sched    = lc_timer_register("sched",    "scheduling");
435                 t_constr   = lc_timer_register("constr",   "assure constraints");
436                 t_regalloc = lc_timer_register("regalloc", "register allocation");
437                 t_finish   = lc_timer_register("finish",   "graph finish");
438                 t_emit     = lc_timer_register("emiter",   "code emiter");
439                 t_verify   = lc_timer_register("verify",   "graph verification");
440                 t_other    = lc_timer_register("other",    "other");
441         }
442 #endif /* WITH_LIBCORE */
443
444         be_init_env(&env, file_handle);
445
446         isa = arch_env_get_isa(env.arch_env);
447
448         be_dbg_so(env.db_handle, cup_name);
449         be_dbg_types(env.db_handle);
450
451         /* we might need 1 birg more for instrumentation constructor */
452         num_birgs = get_irp_n_irgs();
453         birgs     = alloca(sizeof(birgs[0]) * (num_birgs + 1));
454
455         /* First: initialize all birgs */
456         for(i = 0; i < get_irp_n_irgs(); ++i) {
457                 ir_graph *irg = get_irp_irg(i);
458
459                 initialize_birg(&birgs[i], irg, &env);
460         }
461
462         /*
463                 Get the filename for the profiling data.
464                 Beware: '\0' is already included in sizeof(suffix)
465         */
466         memset(prof_filename, 0, sizeof(prof_filename));
467         strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
468         strcat(prof_filename, suffix);
469
470         /*
471                 Next: Either instruments all irgs with profiling code
472                 or try to read in profile data for current translation unit.
473         */
474         if (be_options.opt_profile) {
475                 ir_graph *prof_init_irg = be_profile_instrument(prof_filename, profile_default);
476                 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
477                 num_birgs++;
478                 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
479         }
480         else {
481                 be_profile_read(prof_filename);
482         }
483
484         /* For all graphs */
485         for (i = 0; i < num_birgs; ++i) {
486                 be_irg_t *birg = & birgs[i];
487                 ir_graph *irg  = birg->irg;
488                 optimization_state_t state;
489                 const arch_code_generator_if_t *cg_if;
490
491                 /* stop and reset timers */
492                 BE_TIMER_ONLY(
493                         LC_STOP_AND_RESET_TIMER(t_abi);
494                         LC_STOP_AND_RESET_TIMER(t_codegen);
495                         LC_STOP_AND_RESET_TIMER(t_sched);
496                         LC_STOP_AND_RESET_TIMER(t_constr);
497                         LC_STOP_AND_RESET_TIMER(t_regalloc);
498                         LC_STOP_AND_RESET_TIMER(t_finish);
499                         LC_STOP_AND_RESET_TIMER(t_emit);
500                         LC_STOP_AND_RESET_TIMER(t_verify);
501                         LC_STOP_AND_RESET_TIMER(t_other);
502                 );
503                 BE_TIMER_PUSH(t_other);   /* t_other */
504
505                 /**
506                  * Create execution frequencies from profile data or estimate some
507                  */
508                 if(be_profile_has_data()) {
509                         birg->execfreqs = be_create_execfreqs_from_profile(irg);
510                 } else {
511                         birg->execfreqs = compute_execfreq(irg, 10);
512                 }
513
514                 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
515
516                 /* Get the code generator interface. */
517                 cg_if = isa->impl->get_code_generator_if(isa);
518
519                 /* get a code generator for this graph. */
520                 birg->cg = cg_if->init(birg);
521
522                 /* some transformations need to be done before abi introduce */
523                 arch_code_generator_before_abi(birg->cg);
524
525                 /* set the current graph (this is important for several firm functions) */
526                 current_ir_graph = irg;
527
528                 /* reset the phi handler. */
529                 be_phi_handler_reset(env.phi_handler);
530
531                 /* implement the ABI conventions. */
532                 BE_TIMER_PUSH(t_abi);
533                 birg->abi = be_abi_introduce(birg);
534                 BE_TIMER_POP(t_abi);
535
536                 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
537                 be_do_stat_nodes(irg, "02 Abi");
538
539                 /* generate code */
540                 BE_TIMER_PUSH(t_codegen);
541                 arch_code_generator_prepare_graph(birg->cg);
542                 BE_TIMER_POP(t_codegen);
543
544                 be_do_stat_nodes(irg, "03 Prepare");
545
546                 /*
547                         Since the code generator made a lot of new nodes and skipped
548                         a lot of old ones, we should do dead node elimination here.
549                         Note that this requires disabling the edges here.
550                  */
551                 edges_deactivate(irg);
552                 //dead_node_elimination(irg);
553                 edges_activate(irg);
554
555                 /* Compute loop nesting information (for weighting copies) */
556                 construct_cf_backedges(irg);
557                 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
558                 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
559
560                 /* let backend prepare scheduling */
561                 BE_TIMER_PUSH(t_codegen);
562                 arch_code_generator_before_sched(birg->cg);
563                 BE_TIMER_POP(t_codegen);
564
565                 /* schedule the irg */
566                 BE_TIMER_PUSH(t_sched);
567                 list_sched(birg, &be_options);
568                 BE_TIMER_POP(t_sched);
569
570                 dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
571
572                 /* check schedule */
573                 BE_TIMER_PUSH(t_verify);
574                 be_sched_vrfy(irg, be_options.vrfy_option);
575                 BE_TIMER_POP(t_verify);
576
577                 be_do_stat_nodes(irg, "04 Schedule");
578
579                 /* introduce patterns to assure constraints */
580                 BE_TIMER_PUSH(t_constr);
581                 /* we switch off optimizations here, because they might cause trouble */
582                 save_optimization_state(&state);
583                 set_optimize(0);
584                 set_opt_normalize(0);
585
586                 /* add Keeps for should_be_different constrained nodes  */
587                 /* beware: needs schedule due to usage of be_ssa_constr */
588                 assure_constraints(birg);
589                 BE_TIMER_POP(t_constr);
590
591                 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
592                 be_do_stat_nodes(irg, "05 Constraints");
593
594                 /* connect all stack modifying nodes together (see beabi.c) */
595                 BE_TIMER_PUSH(t_abi);
596                 be_abi_fix_stack_nodes(birg->abi, NULL);
597                 BE_TIMER_POP(t_abi);
598
599                 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
600
601                 /* check schedule */
602                 BE_TIMER_PUSH(t_verify);
603                 be_sched_vrfy(irg, be_options.vrfy_option);
604                 BE_TIMER_POP(t_verify);
605
606                 /* do some statistics */
607                 be_do_stat_reg_pressure(birg);
608
609                 /* stuff needs to be done after scheduling but before register allocation */
610                 BE_TIMER_PUSH(t_codegen);
611                 arch_code_generator_before_ra(birg->cg);
612                 BE_TIMER_POP(t_codegen);
613
614                 /* Do register allocation */
615                 BE_TIMER_PUSH(t_regalloc);
616                 ra_timer = ra->allocate(birg);
617                 BE_TIMER_POP(t_regalloc);
618
619                 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
620                 be_do_stat_nodes(irg, "06 Register Allocation");
621
622                 /* let the code generator prepare the graph for emitter */
623                 BE_TIMER_PUSH(t_finish);
624                 arch_code_generator_after_ra(birg->cg);
625                 BE_TIMER_POP(t_finish);
626
627                 /* fix stack offsets */
628                 BE_TIMER_PUSH(t_abi);
629                 be_abi_fix_stack_nodes(birg->abi, NULL);
630                 be_remove_dead_nodes_from_schedule(irg);
631                 be_abi_fix_stack_bias(birg->abi);
632                 BE_TIMER_POP(t_abi);
633
634                 BE_TIMER_PUSH(t_finish);
635                 arch_code_generator_finish(birg->cg);
636                 BE_TIMER_POP(t_finish);
637
638                 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
639
640                 /* check schedule and register allocation */
641                 BE_TIMER_PUSH(t_verify);
642                 if (be_options.vrfy_option == BE_VRFY_WARN) {
643                         //irg_verify(irg, VRFY_ENFORCE_SSA);
644                         be_check_dominance(irg);
645                         be_verify_out_edges(irg);
646                         be_verify_schedule(irg);
647                         be_verify_register_allocation(env.arch_env, irg);
648                 }
649                 else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
650                         //assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
651                         assert(be_verify_out_edges(irg));
652                         assert(be_check_dominance(irg) && "Dominance verification failed");
653                         assert(be_verify_schedule(irg) && "Schedule verification failed");
654                         assert(be_verify_register_allocation(env.arch_env, irg)
655                                && "register allocation verification failed");
656                 }
657                 BE_TIMER_POP(t_verify);
658
659                 /* emit assembler code */
660                 BE_TIMER_PUSH(t_emit);
661                 arch_code_generator_done(birg->cg);
662                 BE_TIMER_POP(t_emit);
663
664                 dump(DUMP_FINAL, irg, "-end", dump_ir_extblock_graph_sched);
665
666                 BE_TIMER_PUSH(t_abi);
667                 be_abi_free(birg->abi);
668                 BE_TIMER_POP(t_abi);
669
670                 be_do_stat_nodes(irg, "07 Final");
671                 restore_optimization_state(&state);
672
673                 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
674                 BE_TIMER_POP(t_other);
675
676 #define LC_EMIT(timer)    printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0)
677 #define LC_EMIT_RA(timer) printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0)
678                 BE_TIMER_ONLY(
679                         printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
680                         printf("# nodes at begin:  %u\n", num_nodes_b);
681                         printf("# nodes before ra: %u\n", num_nodes_r);
682                         printf("# nodes at end:    %u\n\n", num_nodes_a);
683                         LC_EMIT(t_abi);
684                         LC_EMIT(t_codegen);
685                         LC_EMIT(t_sched);
686                         LC_EMIT(t_constr);
687                         LC_EMIT(t_regalloc);
688                         LC_EMIT_RA(ra_timer->t_prolog);
689                         LC_EMIT_RA(ra_timer->t_live);
690                         LC_EMIT_RA(ra_timer->t_spill);
691                         LC_EMIT_RA(ra_timer->t_spillslots);
692                         LC_EMIT_RA(ra_timer->t_color);
693                         LC_EMIT_RA(ra_timer->t_ifg);
694                         LC_EMIT_RA(ra_timer->t_copymin);
695                         LC_EMIT_RA(ra_timer->t_ssa);
696                         LC_EMIT_RA(ra_timer->t_epilog);
697                         LC_EMIT_RA(ra_timer->t_verify);
698                         LC_EMIT_RA(ra_timer->t_other);
699                         LC_EMIT(t_finish);
700                         LC_EMIT(t_emit);
701                         LC_EMIT(t_verify);
702                         LC_EMIT(t_other);
703                 );
704 #undef LC_EMIT_RA
705 #undef LC_EMIT
706
707                 free_execfreq(birg->execfreqs);
708
709         /* switched off due to statistics (statistic module needs all irgs) */
710                 if (! stat_is_active())
711                         free_ir_graph(irg);
712         }
713         be_profile_free();
714         be_done_env(&env);
715
716 #undef BE_TIMER_POP
717 #undef BE_TIMER_PUSH
718 #undef BE_TIMER_ONLY
719 }
720
721 /* Main interface to the frontend. */
722 void be_main(FILE *file_handle, const char *cup_name)
723 {
724 #ifdef WITH_LIBCORE
725         lc_timer_t *t = NULL;
726 #endif /* WITH_LIBCORE */
727
728 #ifdef WITH_LIBCORE
729         /* The user specified another config file to read. do that now. */
730         if(strlen(config_file) > 0) {
731                 FILE *f;
732
733                 if((f = fopen(config_file, "rt")) != NULL) {
734                         lc_opt_from_file(config_file, f, NULL);
735                         fclose(f);
736                 }
737         }
738
739         if (be_options.timing == BE_TIME_ON) {
740                 t = lc_timer_register("bemain", "measure complete bemain loop");
741
742                 if (lc_timer_enter_high_priority()) {
743                         fprintf(stderr, "Warning: Could not enter high priority mode.\n");
744                 }
745
746                 lc_timer_reset_and_start(t);
747         }
748 #endif /* WITH_LIBCORE */
749
750         /* never build code for pseudo irgs */
751         set_visit_pseudo_irgs(0);
752
753         be_node_init();
754         be_main_loop(file_handle, cup_name);
755
756 #ifdef WITH_LIBCORE
757         if (be_options.timing == BE_TIME_ON) {
758                 lc_timer_stop(t);
759                 lc_timer_leave_high_priority();
760                 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
761         }
762 #endif /* WITH_LIBCORE */
763 }
764
765 /** The debug info retriever function. */
766 static retrieve_dbg_func retrieve_dbg = NULL;
767
768 /* Sets a debug info retriever. */
769 void be_set_debug_retrieve(retrieve_dbg_func func) {
770         retrieve_dbg = func;
771 }
772
773 /* Retrieve the debug info. */
774 const char *be_retrieve_dbg_info(const dbg_info *dbg, unsigned *line) {
775         if (retrieve_dbg)
776                 return retrieve_dbg(dbg, line);
777         *line = 0;
778         return NULL;
779 }
780
781 int be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
782 {
783         if(bs == NULL)
784                 bs = bitset_alloca(cls->n_regs);
785         else
786                 bitset_clear_all(bs);
787
788         assert(bitset_size(bs) == (unsigned) cls->n_regs);
789         arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
790         bitset_flip_all(bs);
791         be_abi_put_ignore_regs(birg->abi, cls, bs);
792         return bitset_popcnt(bs);
793
794 }