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