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