56cc48a714077b9d012b83cabe43b31cd4417a78
[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 "iroptimize.h"
53 #include "firmstat.h"
54 #include "execfreq.h"
55 #include "irprofile.h"
56
57 #include "bearch_t.h"
58 #include "be_t.h"
59 #include "bemodule.h"
60 #include "beutil.h"
61 #include "benode_t.h"
62 #include "beirgmod.h"
63 #include "besched_t.h"
64 #include "belistsched.h"
65 #include "belive_t.h"
66 #include "bera.h"
67 #include "bechordal_t.h"
68 #include "beifg.h"
69 #include "beifg_impl.h"
70 #include "becopyopt.h"
71 #include "becopystat.h"
72 #include "bessadestr.h"
73 #include "beabi.h"
74 #include "belower.h"
75 #include "beschedmris.h"
76 #include "bestat.h"
77 #include "beverify.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         0,                                 /* 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         0,                                 /* enable statistic event dumping */
97         "",                                /* print stat events */
98 };
99
100 /* config file. */
101 static char config_file[256] = { 0 };
102
103 /* back end instruction set architecture to use */
104 static const arch_isa_if_t *isa_if = NULL;
105
106 /* possible dumping options */
107 static const lc_opt_enum_mask_items_t dump_items[] = {
108         { "none",       DUMP_NONE },
109         { "initial",    DUMP_INITIAL },
110         { "abi",        DUMP_ABI    },
111         { "sched",      DUMP_SCHED  },
112         { "prepared",   DUMP_PREPARED },
113         { "regalloc",   DUMP_RA },
114         { "final",      DUMP_FINAL },
115         { "be",         DUMP_BE },
116         { "all",        2 * DUMP_BE - 1 },
117         { NULL,         0 }
118 };
119
120 /* verify options. */
121 static const lc_opt_enum_int_items_t vrfy_items[] = {
122         { "off",    BE_VRFY_OFF    },
123         { "warn",   BE_VRFY_WARN   },
124         { "assert", BE_VRFY_ASSERT },
125         { NULL,     0 }
126 };
127
128 /* scheduling options. */
129 static const lc_opt_enum_int_items_t sched_items[] = {
130         { "list", BE_SCHED_LIST },
131 #ifdef WITH_ILP
132         { "ilp",  BE_SCHED_ILP  },
133 #endif /* WITH_ILP */
134         { NULL,   0 }
135 };
136
137 static lc_opt_enum_mask_var_t dump_var = {
138         &be_options.dump_flags, dump_items
139 };
140
141 static lc_opt_enum_int_var_t vrfy_var = {
142         &be_options.vrfy_option, vrfy_items
143 };
144
145 static lc_opt_enum_int_var_t sched_var = {
146         &be_options.scheduler, sched_items
147 };
148
149 static const lc_opt_table_entry_t be_main_options[] = {
150         LC_OPT_ENT_STR      ("config",   "read another config file containing backend options", config_file, sizeof(config_file)),
151         LC_OPT_ENT_ENUM_MASK("dump",     "dump irg on several occasions",                       &dump_var),
152         LC_OPT_ENT_BOOL     ("omitfp",   "omit frame pointer",                                  &be_options.omit_fp),
153         LC_OPT_ENT_BOOL     ("stabs",    "enable stabs debug support",                          &be_options.stabs_debug_support),
154         LC_OPT_ENT_ENUM_PTR ("vrfy",     "verify the backend irg",                              &vrfy_var),
155         LC_OPT_ENT_BOOL     ("time",     "get backend timing statistics",                       &be_options.timing),
156         LC_OPT_ENT_BOOL     ("profile",  "instrument the code for execution count profiling",   &be_options.opt_profile),
157         LC_OPT_ENT_ENUM_PTR ("sched",    "select a scheduler",                                  &sched_var),
158 #ifdef FIRM_STATISTICS
159         LC_OPT_ENT_BOOL     ("statev",   "dump statistic events",                               &be_options.statev),
160         LC_OPT_ENT_STR      ("filtev",   "filter for stat events (regex if support is active",  &be_options.printev, sizeof(be_options.printev)),
161 #endif
162
163 #ifdef WITH_ILP
164         LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
165         LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
166 #endif /* WITH_ILP */
167         LC_OPT_LAST
168 };
169
170 static be_module_list_entry_t *isa_ifs = NULL;
171
172 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
173 {
174         if(isa_if == NULL)
175                 isa_if = isa;
176
177         be_add_module_to_list(&isa_ifs, name, (void*) isa);
178 }
179
180 void be_opt_register(void)
181 {
182         lc_opt_entry_t *be_grp;
183         static int run_once = 0;
184
185         if (run_once) {
186                 return;
187         }
188         run_once     = 1;
189
190         be_init_modules();
191
192         be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
193         lc_opt_add_table(be_grp, be_main_options);
194
195         be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
196                                &isa_ifs, (void**) &isa_if);
197 }
198
199 /* Parse one argument. */
200 int be_parse_arg(const char *arg) {
201         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
202         if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
203                 lc_opt_print_help(be_grp, stdout);
204                 return -1;
205         }
206         return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
207 }
208
209 /** The be parameters returned by default, all off. */
210 static const backend_params be_params = {
211         0,    /* need dword lowering */
212         0,    /* don't support inlien assembler yet */
213         NULL, /* no additional opcodes */
214         NULL, /* will be set later */
215         NULL, /* but yet no creator function */
216         NULL, /* context for create_intrinsic_fkt */
217         NULL, /* no if conversion settings */
218 };
219
220 /* Perform schedule verification if requested. */
221 static void be_sched_vrfy(be_irg_t *birg, int vrfy_opt) {
222         if (vrfy_opt == BE_VRFY_WARN) {
223                 be_verify_schedule(birg);
224         }
225         else if (vrfy_opt == BE_VRFY_ASSERT) {
226                 assert(be_verify_schedule(birg) && "Schedule verification failed.");
227         }
228 }
229
230 /* Initialize the Firm backend. Must be run BEFORE init_firm()! */
231 const backend_params *be_init(void)
232 {
233         be_opt_register();
234         be_init_modules();
235
236         if (isa_if->get_params)
237                 return isa_if->get_params();
238         return &be_params;
239 }
240
241 /**
242  * Initializes the main environment for the backend.
243  *
244  * @param env          an empty environment
245  * @param file_handle  the file handle where the output will be written to
246  */
247 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle)
248 {
249         memset(env, 0, sizeof(*env));
250         obstack_init(&env->obst);
251         env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
252         env->options  = &be_options;
253
254         arch_env_init(env->arch_env, isa_if, file_handle, env);
255
256         /* Register the irn handler of the architecture */
257         if (arch_isa_get_irn_handler(env->arch_env->isa))
258                 arch_env_push_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
259
260         /*
261          * Register the node handler of the back end infrastructure.
262          * This irn handler takes care of the platform independent
263          * spill, reload and perm nodes.
264          */
265         arch_env_push_irn_handler(env->arch_env, &be_node_irn_handler);
266         env->phi_handler = be_phi_handler_new(env->arch_env);
267         arch_env_push_irn_handler(env->arch_env, env->phi_handler);
268
269         env->db_handle = be_options.stabs_debug_support ? be_stabs_open(file_handle) : be_nulldbg_open();
270         return env;
271 }
272
273 static void be_done_env(be_main_env_t *env)
274 {
275         env->arch_env->isa->impl->done(env->arch_env->isa);
276         be_dbg_close(env->db_handle);
277         be_phi_handler_free(env->phi_handler);
278         obstack_free(&env->obst, NULL);
279 }
280
281 /**
282  * A wrapper around a firm dumper. Dumps only, if
283  * flags are enabled.
284  *
285  * @param mask    a bitmask containing the reason what will be dumped
286  * @param irg     the IR graph to dump
287  * @param suffix  the suffix for the dumper
288  * @param dumper  the dumper to be called
289  */
290 static void dump(int mask, ir_graph *irg, const char *suffix,
291                  void (*dumper)(ir_graph *, const char *))
292 {
293         if(be_options.dump_flags & mask)
294                 be_dump(irg, suffix, dumper);
295 }
296
297 /**
298  * Prepare a backend graph for code generation and initialize its birg
299  */
300 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
301 {
302         memset(birg, 0, sizeof(*birg));
303         birg->irg = irg;
304         birg->main_env = env;
305
306         edges_deactivate_kind(irg, EDGE_KIND_DEP);
307         edges_activate_kind(irg, EDGE_KIND_DEP);
308
309         dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
310
311         be_stat_init_irg(env->arch_env, irg);
312         be_do_stat_nodes(irg, "01 Begin");
313
314         /* set the current graph (this is important for several firm functions) */
315         current_ir_graph = irg;
316
317         /* Normalize proj nodes. */
318         normalize_proj_nodes(irg);
319
320         /* we do this before critical edge split. As this produces less returns,
321            because sometimes (= 164.gzip) multiple returns are slower */
322         normalize_n_returns(irg);
323
324         /* Remove critical edges */
325         remove_critical_cf_edges(irg);
326
327         /* Ensure, that the ir_edges are computed. */
328         edges_assure(irg);
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         env.cup_name = cup_name;
403
404         isa = arch_env_get_isa(env.arch_env);
405
406         be_dbg_so(env.db_handle, cup_name);
407         be_dbg_types(env.db_handle);
408
409         /* backend may provide an ordered list of irgs where code should be generated for */
410         irg_list         = NEW_ARR_F(ir_graph *, 0);
411         backend_irg_list = arch_isa_get_backend_irg_list(isa, &irg_list);
412
413         /* we might need 1 birg more for instrumentation constructor */
414         num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs();
415         birgs     = alloca(sizeof(birgs[0]) * (num_birgs + 1));
416
417         /* First: initialize all birgs */
418         for(i = 0; i < num_birgs; ++i) {
419                 ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i);
420                 initialize_birg(&birgs[i], irg, &env);
421         }
422         DEL_ARR_F(irg_list);
423
424         /*
425                 Get the filename for the profiling data.
426                 Beware: '\0' is already included in sizeof(suffix)
427         */
428         memset(prof_filename, 0, sizeof(prof_filename));
429         strncpy(prof_filename, cup_name, sizeof(prof_filename) - sizeof(suffix));
430         strcat(prof_filename, suffix);
431
432         /*
433                 Next: Either instruments all irgs with profiling code
434                 or try to read in profile data for current translation unit.
435         */
436         if (be_options.opt_profile) {
437                 ir_graph *prof_init_irg = ir_profile_instrument(prof_filename, profile_default);
438                 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
439                 num_birgs++;
440                 set_method_img_section(get_irg_entity(prof_init_irg), section_constructors);
441         } else {
442                 ir_profile_read(prof_filename);
443         }
444
445         /* For all graphs */
446         for (i = 0; i < num_birgs; ++i) {
447                 be_irg_t *birg = &birgs[i];
448                 ir_graph *irg  = birg->irg;
449                 optimization_state_t state;
450                 const arch_code_generator_if_t *cg_if;
451
452                 /* set the current graph (this is important for several firm functions) */
453                 current_ir_graph = irg;
454
455                 /* reset the phi handler. */
456                 be_phi_handler_reset(env.phi_handler);
457
458                 stat_ev_ctx_push_fobj("bemain_irg", irg);
459
460                 /* stop and reset timers */
461                 BE_TIMER_ONLY(
462                         LC_STOP_AND_RESET_TIMER(t_abi);
463                         LC_STOP_AND_RESET_TIMER(t_codegen);
464                         LC_STOP_AND_RESET_TIMER(t_sched);
465                         LC_STOP_AND_RESET_TIMER(t_constr);
466                         LC_STOP_AND_RESET_TIMER(t_regalloc);
467                         LC_STOP_AND_RESET_TIMER(t_finish);
468                         LC_STOP_AND_RESET_TIMER(t_emit);
469                         LC_STOP_AND_RESET_TIMER(t_verify);
470                         LC_STOP_AND_RESET_TIMER(t_other);
471                 );
472                 BE_TIMER_PUSH(t_other);   /* t_other */
473
474                 /* Verify the initial graph */
475                 BE_TIMER_PUSH(t_verify);
476                 if (be_options.vrfy_option == BE_VRFY_WARN) {
477                         irg_verify(irg, VRFY_ENFORCE_SSA);
478                         be_check_dominance(irg);
479                 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
480                         assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
481                         assert(be_check_dominance(irg) && "Dominance verification failed");
482                 }
483                 BE_TIMER_POP(t_verify);
484
485                 BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
486
487                 /* Get the code generator interface. */
488                 cg_if = isa->impl->get_code_generator_if(isa);
489
490                 /* get a code generator for this graph. */
491                 birg->cg = cg_if->init(birg);
492
493                 /* some transformations need to be done before abi introduce */
494                 arch_code_generator_before_abi(birg->cg);
495
496                 /* implement the ABI conventions. */
497                 BE_TIMER_PUSH(t_abi);
498                 birg->abi = be_abi_introduce(birg);
499                 BE_TIMER_POP(t_abi);
500
501                 dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
502                 be_do_stat_nodes(irg, "02 Abi");
503
504                 if (be_options.vrfy_option == BE_VRFY_WARN) {
505                         be_check_dominance(irg);
506                         be_verify_out_edges(irg);
507                 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
508                         assert(be_verify_out_edges(irg));
509                         assert(be_check_dominance(irg) && "Dominance verification failed");
510                 }
511
512                 /* generate code */
513                 stat_ev_ctx_push_str("bemain_phase", "prepare");
514                 BE_TIMER_PUSH(t_codegen);
515                 arch_code_generator_prepare_graph(birg->cg);
516                 BE_TIMER_POP(t_codegen);
517                 stat_ev_ctx_pop("bemain_phase");
518
519                 /* reset the phi handler. */
520                 be_phi_handler_reset(env.phi_handler);
521
522                 be_do_stat_nodes(irg, "03 Prepare");
523
524                 dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
525                 BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
526
527                 if (be_options.vrfy_option == BE_VRFY_WARN) {
528                         be_check_dominance(irg);
529                         be_verify_out_edges(irg);
530                 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
531                         assert(be_verify_out_edges(irg));
532                         assert(be_check_dominance(irg) && "Dominance verification failed");
533                 }
534
535                 /**
536                  * Create execution frequencies from profile data or estimate some
537                  */
538                 if (ir_profile_has_data())
539                         birg->exec_freq = ir_create_execfreqs_from_profile(irg);
540                 else
541                         birg->exec_freq = compute_execfreq(irg, 10);
542
543
544                 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
545                 /* be_live_chk_compare(birg); */
546
547                 /* let backend prepare scheduling */
548                 stat_ev_ctx_push_str("bemain_phase", "before_sched");
549                 BE_TIMER_PUSH(t_codegen);
550                 arch_code_generator_before_sched(birg->cg);
551                 BE_TIMER_POP(t_codegen);
552                 stat_ev_ctx_pop("bemain_phase");
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                 set_opt_cse(0);
586
587                 assert(!get_opt_cse());
588
589                 /* add Keeps for should_be_different constrained nodes  */
590                 /* beware: needs schedule due to usage of be_ssa_constr */
591                 assure_constraints(birg);
592                 BE_TIMER_POP(t_constr);
593
594                 dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
595                 be_do_stat_nodes(irg, "05 Constraints");
596
597                 /* stuff needs to be done after scheduling but before register allocation */
598                 BE_TIMER_PUSH(t_codegen);
599                 arch_code_generator_before_ra(birg->cg);
600                 BE_TIMER_POP(t_codegen);
601
602                 /* connect all stack modifying nodes together (see beabi.c) */
603                 BE_TIMER_PUSH(t_abi);
604                 be_abi_fix_stack_nodes(birg->abi);
605                 BE_TIMER_POP(t_abi);
606
607                 dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
608
609                 /* check schedule */
610                 BE_TIMER_PUSH(t_verify);
611                 be_sched_vrfy(birg, be_options.vrfy_option);
612                 BE_TIMER_POP(t_verify);
613
614                 /* do some statistics */
615                 //be_do_stat_reg_pressure(birg);
616
617 #ifdef FIRM_STATISTICS
618                 stat_ev_dbl("costs_before_ra", be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
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                 stat_ev_dbl("costs_before_ra", be_estimate_irg_costs(irg, env.arch_env, birg->exec_freq));
628 #endif
629
630                 dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
631                 be_do_stat_nodes(irg, "06 Register Allocation");
632
633                 /* let the code generator prepare the graph for emitter */
634                 BE_TIMER_PUSH(t_finish);
635                 arch_code_generator_after_ra(birg->cg);
636                 BE_TIMER_POP(t_finish);
637
638                 /* fix stack offsets */
639                 BE_TIMER_PUSH(t_abi);
640                 be_abi_fix_stack_nodes(birg->abi);
641                 be_remove_dead_nodes_from_schedule(birg);
642                 be_abi_fix_stack_bias(birg->abi);
643                 BE_TIMER_POP(t_abi);
644
645                 dump(DUMP_SCHED, irg, "-fix_stack_after_ra", dump_ir_block_graph_sched);
646
647                 BE_TIMER_PUSH(t_finish);
648                 arch_code_generator_finish(birg->cg);
649                 BE_TIMER_POP(t_finish);
650
651                 dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
652
653                 /* check schedule and register allocation */
654                 BE_TIMER_PUSH(t_verify);
655                 if (be_options.vrfy_option == BE_VRFY_WARN) {
656                         irg_verify(irg, VRFY_ENFORCE_SSA);
657                         be_check_dominance(irg);
658                         be_verify_out_edges(irg);
659                         be_verify_schedule(birg);
660                         be_verify_register_allocation(birg);
661                 } else if (be_options.vrfy_option == BE_VRFY_ASSERT) {
662                         assert(irg_verify(irg, VRFY_ENFORCE_SSA) && "irg verification failed");
663                         assert(be_verify_out_edges(irg) && "out edge verification failed");
664                         assert(be_check_dominance(irg) && "Dominance verification failed");
665                         assert(be_verify_schedule(birg) && "Schedule verification failed");
666                         assert(be_verify_register_allocation(birg)
667                                && "register allocation verification failed");
668
669                 }
670                 BE_TIMER_POP(t_verify);
671
672                 /* emit assembler code */
673                 BE_TIMER_PUSH(t_emit);
674                 arch_code_generator_done(birg->cg);
675                 BE_TIMER_POP(t_emit);
676
677                 dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
678
679                 BE_TIMER_PUSH(t_abi);
680                 be_abi_free(birg->abi);
681                 BE_TIMER_POP(t_abi);
682
683                 be_do_stat_nodes(irg, "07 Final");
684                 restore_optimization_state(&state);
685
686                 BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
687                 BE_TIMER_POP(t_other);
688
689 #define LC_EMIT(timer)  \
690                 printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
691                 stat_ev_dbl(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer));
692
693 #define LC_EMIT_RA(timer) \
694                 printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0); \
695                 stat_ev_dbl(lc_timer_get_name(timer), lc_timer_elapsed_msec(timer)); \
696
697                 BE_TIMER_ONLY(
698                         printf("==>> IRG %s <<==\n", get_entity_name(get_irg_entity(irg)));
699                         printf("# nodes at begin:  %u\n", num_nodes_b);
700                         printf("# nodes before ra: %u\n", num_nodes_r);
701                         printf("# nodes at end:    %u\n\n", num_nodes_a);
702                         LC_EMIT(t_abi);
703                         LC_EMIT(t_codegen);
704                         LC_EMIT(t_sched);
705                         LC_EMIT(t_constr);
706                         LC_EMIT(t_regalloc);
707                         if(global_ra_timer != NULL) {
708                                 LC_EMIT_RA(global_ra_timer->t_prolog);
709                                 LC_EMIT_RA(global_ra_timer->t_live);
710                                 LC_EMIT_RA(global_ra_timer->t_spill);
711                                 LC_EMIT_RA(global_ra_timer->t_spillslots);
712                                 LC_EMIT_RA(global_ra_timer->t_color);
713                                 LC_EMIT_RA(global_ra_timer->t_ifg);
714                                 LC_EMIT_RA(global_ra_timer->t_copymin);
715                                 LC_EMIT_RA(global_ra_timer->t_ssa);
716                                 LC_EMIT_RA(global_ra_timer->t_epilog);
717                                 LC_EMIT_RA(global_ra_timer->t_verify);
718                                 LC_EMIT_RA(global_ra_timer->t_other);
719                         }
720                         LC_EMIT(t_finish);
721                         LC_EMIT(t_emit);
722                         LC_EMIT(t_verify);
723                         LC_EMIT(t_other);
724                 );
725 #undef LC_EMIT_RA
726 #undef LC_EMIT
727
728                 be_free_birg(birg);
729
730         /* switched off due to statistics (statistic module needs all irgs) */
731 #if 0   /* STA needs irgs */
732 #ifdef FIRM_STATISTICS
733                 if (! stat_is_active())
734 #endif /* FIRM_STATISTICS */
735                         free_ir_graph(irg);
736 #endif /* if 0 */
737                 stat_ev_ctx_pop("bemain_irg");
738         }
739         ir_profile_free();
740         be_done_env(&env);
741
742 #undef BE_TIMER_POP
743 #undef BE_TIMER_PUSH
744 #undef BE_TIMER_ONLY
745 }
746
747 /* Main interface to the frontend. */
748 void be_main(FILE *file_handle, const char *cup_name)
749 {
750         lc_timer_t *t = NULL;
751
752         /* The user specified another config file to read. do that now. */
753         if(strlen(config_file) > 0) {
754                 FILE *f;
755
756                 if((f = fopen(config_file, "rt")) != NULL) {
757                         lc_opt_from_file(config_file, f, NULL);
758                         fclose(f);
759                 }
760         }
761
762         if (be_options.timing == BE_TIME_ON) {
763                 t = lc_timer_register("bemain", "measure complete bemain loop");
764
765                 if (lc_timer_enter_high_priority()) {
766                         fprintf(stderr, "Warning: Could not enter high priority mode.\n");
767                 }
768
769                 lc_timer_reset_and_start(t);
770         }
771
772 #ifdef FIRM_STATISTICS
773         if (be_options.statev) {
774                 const char *dot = strrchr(cup_name, '.');
775                 const char *pos = dot ? dot : cup_name + strlen(cup_name);
776                 char       *buf = alloca(pos - cup_name + 1);
777                 strncpy(buf, cup_name, pos - cup_name);
778                 buf[pos - cup_name] = '\0';
779
780                 be_options.statev = 1;
781                 stat_ev_begin(buf, be_options.printev);
782         }
783 #endif
784
785         /* never build code for pseudo irgs */
786         set_visit_pseudo_irgs(0);
787
788         be_node_init();
789
790         be_main_loop(file_handle, cup_name);
791
792         if (be_options.timing == BE_TIME_ON) {
793                 lc_timer_stop(t);
794                 lc_timer_leave_high_priority();
795                 stat_ev_dbl("backend_time", lc_timer_elapsed_msec(t));
796                 printf("%-20s: %lu msec\n", "BEMAINLOOP", lc_timer_elapsed_msec(t));
797         }
798
799 #ifdef FIRM_STATISTICS
800         if (be_options.statev)
801                 stat_ev_end();
802 #endif
803 }
804
805 unsigned be_put_ignore_regs(const be_irg_t *birg, const arch_register_class_t *cls, bitset_t *bs)
806 {
807         if (bs == NULL)
808                 bs = bitset_alloca(cls->n_regs);
809         else
810                 bitset_clear_all(bs);
811
812         assert(bitset_size(bs) == (unsigned)cls->n_regs);
813         arch_put_non_ignore_regs(birg->main_env->arch_env, cls, bs);
814         bitset_flip_all(bs);
815         be_abi_put_ignore_regs(birg->abi, cls, bs);
816
817         return bitset_popcnt(bs);
818 }