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