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