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