4709cb8b0000f0d9c82806d5acd100816f3d1d05
[libfirm] / ir / be / bemain.c
1 /*
2  * Copyright (C) 1995-2011 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  */
26 #include "config.h"
27
28 #include <stdarg.h>
29 #include <stdio.h>
30
31 #include "lc_opts.h"
32 #include "lc_opts_enum.h"
33
34 #include "obst.h"
35 #include "bitset.h"
36
37 #include "irprog.h"
38 #include "irgopt.h"
39 #include "irgraph.h"
40 #include "irdump.h"
41 #include "irdom_t.h"
42 #include "iredges_t.h"
43 #include "irloop_t.h"
44 #include "irtools.h"
45 #include "irverify.h"
46 #include "irprintf.h"
47 #include "iroptimize.h"
48 #include "firmstat.h"
49 #include "execfreq.h"
50 #include "irprofile.h"
51 #include "irpass_t.h"
52
53 #include "bearch.h"
54 #include "be_t.h"
55 #include "bemodule.h"
56 #include "beutil.h"
57 #include "benode.h"
58 #include "beirgmod.h"
59 #include "besched.h"
60 #include "belistsched.h"
61 #include "belive_t.h"
62 #include "bera.h"
63 #include "bechordal_t.h"
64 #include "beifg.h"
65 #include "becopyopt.h"
66 #include "becopystat.h"
67 #include "bessadestr.h"
68 #include "beabi.h"
69 #include "belower.h"
70 #include "bestat.h"
71 #include "beverify.h"
72 #include "be_dbgout.h"
73 #include "beirg.h"
74 #include "bestack.h"
75 #include "beemitter.h"
76
77 #define NEW_ID(s) new_id_from_chars(s, sizeof(s) - 1)
78
79 /* options visible for anyone */
80 static be_options_t be_options = {
81         DUMP_NONE,                         /* dump flags */
82         BE_TIME_OFF,                       /* no timing */
83         false,                             /* profile_generate */
84         false,                             /* profile_use */
85         0,                                 /* try to omit frame pointer */
86         0,                                 /* create PIC code */
87         BE_VERIFY_WARN,                    /* verification level: warn */
88         "",                                /* ilp server */
89         "",                                /* ilp solver */
90         0,                                 /* enable statistic event dumping */
91         "",                                /* print stat events */
92 };
93
94 /* back end instruction set architecture to use */
95 static const arch_isa_if_t *isa_if = NULL;
96
97 /* possible dumping options */
98 static const lc_opt_enum_mask_items_t dump_items[] = {
99         { "none",       DUMP_NONE },
100         { "initial",    DUMP_INITIAL },
101         { "abi",        DUMP_ABI    },
102         { "sched",      DUMP_SCHED  },
103         { "prepared",   DUMP_PREPARED },
104         { "regalloc",   DUMP_RA },
105         { "final",      DUMP_FINAL },
106         { "be",         DUMP_BE },
107         { "all",        2 * DUMP_BE - 1 },
108         { NULL,         0 }
109 };
110
111 /* verify options. */
112 static const lc_opt_enum_int_items_t verify_items[] = {
113         { "off",    BE_VERIFY_OFF    },
114         { "warn",   BE_VERIFY_WARN   },
115         { "assert", BE_VERIFY_ASSERT },
116         { NULL,     0 }
117 };
118
119 static lc_opt_enum_mask_var_t dump_var = {
120         &be_options.dump_flags, dump_items
121 };
122
123 static lc_opt_enum_int_var_t verify_var = {
124         &be_options.verify_option, verify_items
125 };
126
127 static const lc_opt_table_entry_t be_main_options[] = {
128         LC_OPT_ENT_ENUM_MASK("dump",       "dump irg on several occasions",                       &dump_var),
129         LC_OPT_ENT_BOOL     ("omitfp",     "omit frame pointer",                                  &be_options.omit_fp),
130         LC_OPT_ENT_BOOL     ("pic",        "create PIC code",                                     &be_options.pic),
131         LC_OPT_ENT_ENUM_INT ("verify",     "verify the backend irg",                              &verify_var),
132         LC_OPT_ENT_BOOL     ("time",       "get backend timing statistics",                       &be_options.timing),
133         LC_OPT_ENT_BOOL     ("profilegenerate", "instrument the code for execution count profiling",   &be_options.opt_profile_generate),
134         LC_OPT_ENT_BOOL     ("profileuse",      "use existing profile data",                           &be_options.opt_profile_use),
135         LC_OPT_ENT_BOOL     ("statev",     "dump statistic events",                               &be_options.statev),
136         LC_OPT_ENT_STR      ("filtev",     "filter for stat events (regex if support is active",   be_options.filtev),
137
138         LC_OPT_ENT_STR("ilp.server", "the ilp server name", be_options.ilp_server),
139         LC_OPT_ENT_STR("ilp.solver", "the ilp solver name", be_options.ilp_solver),
140         LC_OPT_LAST
141 };
142
143 static be_module_list_entry_t *isa_ifs = NULL;
144
145
146 asm_constraint_flags_t asm_constraint_flags[256];
147
148 void be_init_default_asm_constraint_flags(void)
149 {
150         asm_constraint_flags['?'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
151         asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
152         asm_constraint_flags['&'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
153                 | ASM_CONSTRAINT_FLAG_MODIFIER_EARLYCLOBBER;
154         asm_constraint_flags['%'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT
155                 | ASM_CONSTRAINT_FLAG_MODIFIER_COMMUTATIVE;
156         asm_constraint_flags['!'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
157
158         asm_constraint_flags['='] = ASM_CONSTRAINT_FLAG_MODIFIER_WRITE
159                 | ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ;
160         asm_constraint_flags['+'] = ASM_CONSTRAINT_FLAG_MODIFIER_READ
161                 | ASM_CONSTRAINT_FLAG_MODIFIER_WRITE;
162
163         asm_constraint_flags['i'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
164         asm_constraint_flags['s'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
165         asm_constraint_flags['E'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
166         asm_constraint_flags['F'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
167         asm_constraint_flags['G'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
168         asm_constraint_flags['H'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
169         asm_constraint_flags['I'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
170         asm_constraint_flags['J'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
171         asm_constraint_flags['K'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
172         asm_constraint_flags['L'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
173         asm_constraint_flags['M'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
174         asm_constraint_flags['N'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
175         asm_constraint_flags['O'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
176         asm_constraint_flags['P'] = ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
177
178         asm_constraint_flags['m'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
179         asm_constraint_flags['o'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
180         asm_constraint_flags['V'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
181         asm_constraint_flags['<'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
182         asm_constraint_flags['>'] = ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP;
183
184         asm_constraint_flags['p'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
185         asm_constraint_flags['0'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
186         asm_constraint_flags['1'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
187         asm_constraint_flags['2'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
188         asm_constraint_flags['3'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
189         asm_constraint_flags['4'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
190         asm_constraint_flags['5'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
191         asm_constraint_flags['6'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
192         asm_constraint_flags['7'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
193         asm_constraint_flags['8'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
194         asm_constraint_flags['9'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER;
195
196         asm_constraint_flags['X'] = ASM_CONSTRAINT_FLAG_SUPPORTS_REGISTER
197                 | ASM_CONSTRAINT_FLAG_SUPPORTS_MEMOP
198                 | ASM_CONSTRAINT_FLAG_SUPPORTS_IMMEDIATE;
199
200         /* these should have been catched by the parsing code already */
201         asm_constraint_flags['#']  = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
202         asm_constraint_flags['*']  = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
203         asm_constraint_flags[' ']  = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
204         asm_constraint_flags['\t'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
205         asm_constraint_flags['\n'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
206         asm_constraint_flags['\r'] = ASM_CONSTRAINT_FLAG_NO_SUPPORT;
207 }
208
209 asm_constraint_flags_t be_parse_asm_constraints(const char *constraint)
210 {
211         asm_constraint_flags_t  flags = ASM_CONSTRAINT_FLAG_NONE;
212         const char             *c;
213         asm_constraint_flags_t  tflags;
214
215         for (c = constraint; *c != '\0'; ++c) {
216                 switch (*c) {
217                 case '#':
218                         /* 'comment' stuff */
219                         while (*c != 0 && *c != ',')
220                                 ++c;
221                         break;
222                 case '*':
223                         /* 'comment' character */
224                         ++c;
225                         break;
226                 case ' ':
227                 case '\t':
228                 case '\n':
229                 case '\r':
230                         break;
231                 default:
232                         tflags = asm_constraint_flags[(int) *c];
233                         if (tflags != 0) {
234                                 flags |= tflags;
235                         } else {
236                                 flags |= isa_if->parse_asm_constraint(&c);
237                         }
238                         break;
239                 }
240         }
241
242         if ((
243                 flags & ASM_CONSTRAINT_FLAG_MODIFIER_WRITE &&
244                 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE
245             ) || (
246                 flags & ASM_CONSTRAINT_FLAG_MODIFIER_READ &&
247                 flags & ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ
248             )) {
249                 flags |= ASM_CONSTRAINT_FLAG_INVALID;
250         }
251         if (!(flags & (ASM_CONSTRAINT_FLAG_MODIFIER_READ     |
252                        ASM_CONSTRAINT_FLAG_MODIFIER_WRITE    |
253                        ASM_CONSTRAINT_FLAG_MODIFIER_NO_WRITE |
254                        ASM_CONSTRAINT_FLAG_MODIFIER_NO_READ)
255             )) {
256                 flags |= ASM_CONSTRAINT_FLAG_MODIFIER_READ;
257         }
258
259         return flags;
260 }
261
262 int be_is_valid_clobber(const char *clobber)
263 {
264         /* memory is a valid clobber. (the frontend has to detect this case too,
265          * because it has to add memory edges to the asm) */
266         if (strcmp(clobber, "memory") == 0)
267                 return 1;
268         /* cc (condition code) is always valid */
269         if (strcmp(clobber, "cc") == 0)
270                 return 1;
271
272         return isa_if->is_valid_clobber(clobber);
273 }
274
275 void be_register_isa_if(const char *name, const arch_isa_if_t *isa)
276 {
277         if (isa_if == NULL)
278                 isa_if = isa;
279
280         be_add_module_to_list(&isa_ifs, name, (void*) isa);
281 }
282
283 void be_opt_register(void)
284 {
285         lc_opt_entry_t *be_grp;
286         static int run_once = 0;
287
288         if (run_once)
289                 return;
290         run_once = 1;
291
292         be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
293         lc_opt_add_table(be_grp, be_main_options);
294
295         be_add_module_list_opt(be_grp, "isa", "the instruction set architecture",
296                                &isa_ifs, (void**) &isa_if);
297
298         be_init_modules();
299 }
300
301 /* Parse one argument. */
302 int be_parse_arg(const char *arg)
303 {
304         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
305         if (strcmp(arg, "help") == 0 || (arg[0] == '?' && arg[1] == '\0')) {
306                 lc_opt_print_help_for_entry(be_grp, '-', stdout);
307                 return -1;
308         }
309         return lc_opt_from_single_arg(be_grp, NULL, arg, NULL);
310 }
311
312 /* Perform schedule verification if requested. */
313 static void be_sched_verify(ir_graph *irg, int verify_opt)
314 {
315         if (verify_opt == BE_VERIFY_WARN) {
316                 be_verify_schedule(irg);
317         } else if (verify_opt == BE_VERIFY_ASSERT) {
318                 assert(be_verify_schedule(irg) && "Schedule verification failed.");
319         }
320 }
321
322 /* Initialize the Firm backend. Must be run first in init_firm()! */
323 void firm_be_init(void)
324 {
325         be_opt_register();
326         be_init_modules();
327 }
328
329 /* Finalize the Firm backend. */
330 void firm_be_finish(void)
331 {
332         be_quit_modules();
333 }
334
335 /* Returns the backend parameter */
336 const backend_params *be_get_backend_param(void)
337 {
338         return isa_if->get_params();
339 }
340
341 /**
342  * Initializes the main environment for the backend.
343  *
344  * @param env          an empty environment
345  * @param file_handle  the file handle where the output will be written to
346  */
347 static be_main_env_t *be_init_env(be_main_env_t *env, FILE *file_handle,
348                                   const char *compilation_unit_name)
349 {
350         memset(env, 0, sizeof(*env));
351         env->options              = &be_options;
352         env->file_handle          = file_handle;
353         env->ent_trampoline_map   = pmap_create();
354         env->pic_trampolines_type = new_type_class(NEW_ID("$PIC_TRAMPOLINE_TYPE"));
355         env->ent_pic_symbol_map   = pmap_create();
356         env->pic_symbols_type     = new_type_struct(NEW_ID("$PIC_SYMBOLS_TYPE"));
357         env->cup_name             = compilation_unit_name;
358
359         remove_irp_type(env->pic_trampolines_type);
360         remove_irp_type(env->pic_symbols_type);
361         set_class_final(env->pic_trampolines_type, 1);
362
363         memset(asm_constraint_flags, 0, sizeof(asm_constraint_flags));
364         env->arch_env = arch_env_init(isa_if, env);
365
366         return env;
367 }
368
369 /**
370  * Called when the be_main_env_t can be destroyed.
371  */
372 static void be_done_env(be_main_env_t *env)
373 {
374         pmap_destroy(env->ent_trampoline_map);
375         pmap_destroy(env->ent_pic_symbol_map);
376         free_type(env->pic_trampolines_type);
377         free_type(env->pic_symbols_type);
378 }
379
380 /**
381  * A wrapper around a firm dumper. Dumps only, if
382  * flags are enabled.
383  *
384  * @param mask    a bitmask containing the reason what will be dumped
385  * @param irg     the IR graph to dump
386  * @param suffix  the suffix for the dumper
387  * @param dumper  the dumper to be called
388  */
389 static void dump(int mask, ir_graph *irg, const char *suffix)
390 {
391         if (be_options.dump_flags & mask)
392                 dump_ir_graph(irg, suffix);
393 }
394
395 /**
396  * Prepare a backend graph for code generation and initialize its irg
397  */
398 static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
399 {
400         /* don't duplicate locals in backend when dumping... */
401         ir_remove_dump_flags(ir_dump_flag_consts_local);
402
403         dump(DUMP_INITIAL, irg, "begin");
404
405         irg->be_data = birg;
406
407         memset(birg, 0, sizeof(*birg));
408         birg->irg = irg;
409         birg->main_env = env;
410         obstack_init(&birg->obst);
411
412         edges_deactivate_kind(irg, EDGE_KIND_DEP);
413         edges_activate_kind(irg, EDGE_KIND_DEP);
414
415         /* set the current graph (this is important for several firm functions) */
416         current_ir_graph = irg;
417
418         /* we do this before critical edge split. As this produces less returns,
419            because sometimes (= 164.gzip) multiple returns are slower */
420         normalize_n_returns(irg);
421
422         /* Remove critical edges */
423         remove_critical_cf_edges_ex(irg, /*ignore_exception_edges=*/0);
424
425         /* For code generation all unreachable code and Bad nodes should be gone */
426         remove_unreachable_code(irg);
427         remove_bads(irg);
428
429         /* Ensure, that the ir_edges are computed. */
430         edges_assure(irg);
431
432         set_irg_phase_state(irg, phase_backend);
433         be_info_init_irg(irg);
434
435         dump(DUMP_INITIAL, irg, "prepared");
436 }
437
438 int be_timing;
439
440 static const char *get_timer_name(be_timer_id_t id)
441 {
442         switch (id) {
443         case T_ABI:            return "abi";
444         case T_CODEGEN:        return "codegen";
445         case T_RA_PREPARATION: return "ra_preparation";
446         case T_SCHED:          return "sched";
447         case T_CONSTR:         return "constr";
448         case T_FINISH:         return "finish";
449         case T_EMIT:           return "emit";
450         case T_VERIFY:         return "verify";
451         case T_OTHER:          return "other";
452         case T_HEIGHTS:        return "heights";
453         case T_LIVE:           return "live";
454         case T_EXECFREQ:       return "execfreq";
455         case T_SSA_CONSTR:     return "ssa_constr";
456         case T_RA_PROLOG:      return "ra_prolog";
457         case T_RA_EPILOG:      return "ra_epilog";
458         case T_RA_CONSTR:      return "ra_constr";
459         case T_RA_SPILL:       return "ra_spill";
460         case T_RA_SPILL_APPLY: return "ra_spill_apply";
461         case T_RA_COLOR:       return "ra_color";
462         case T_RA_IFG:         return "ra_ifg";
463         case T_RA_COPYMIN:     return "ra_copymin";
464         case T_RA_SSA:         return "ra_ssa";
465         case T_RA_OTHER:       return "ra_other";
466         }
467         return "unknown";
468 }
469 ir_timer_t *be_timers[T_LAST+1];
470
471 void be_lower_for_target(void)
472 {
473         size_t i;
474
475         isa_if->lower_for_target();
476         /* set the phase to low */
477         for (i = get_irp_n_irgs(); i > 0;) {
478                 ir_graph *irg = get_irp_irg(--i);
479                 set_irg_phase_state(irg, phase_low);
480         }
481         set_irp_phase_state(phase_low);
482 }
483
484 /**
485  * The Firm backend main loop.
486  * Do architecture specific lowering for all graphs
487  * and call the architecture specific code generator.
488  *
489  * @param file_handle   the file handle the output will be written to
490  * @param cup_name      name of the compilation unit
491  */
492 static void be_main_loop(FILE *file_handle, const char *cup_name)
493 {
494         static const char suffix[] = ".prof";
495
496         size_t        i, num_birgs;
497         be_main_env_t env;
498         char          prof_filename[256];
499         be_irg_t      *birgs;
500         ir_graph      **irg_list, **backend_irg_list;
501         arch_env_t    *arch_env;
502
503         be_timing = (be_options.timing == BE_TIME_ON);
504
505         if (be_timing) {
506                 for (i = 0; i < T_LAST+1; ++i) {
507                         be_timers[i] = ir_timer_new();
508                 }
509         }
510
511         be_init_env(&env, file_handle, cup_name);
512
513         arch_env = env.arch_env;
514
515         /* backend may provide an ordered list of irgs where code should be
516          * generated for */
517         irg_list         = NEW_ARR_F(ir_graph *, 0);
518         backend_irg_list = arch_env_get_backend_irg_list(arch_env, &irg_list);
519
520         /* we might need 1 birg more for instrumentation constructor */
521         num_birgs = backend_irg_list ? ARR_LEN(backend_irg_list) : get_irp_n_irgs();
522         birgs     = ALLOCAN(be_irg_t, num_birgs + 1);
523
524         be_info_init();
525
526         /* First: initialize all birgs */
527         for (i = 0; i < num_birgs; ++i) {
528                 ir_graph *irg = backend_irg_list ? backend_irg_list[i] : get_irp_irg(i);
529                 initialize_birg(&birgs[i], irg, &env);
530         }
531         arch_env_handle_intrinsics(arch_env);
532         DEL_ARR_F(irg_list);
533
534         /*
535                 Get the filename for the profiling data.
536                 Beware: '\0' is already included in sizeof(suffix)
537         */
538         sprintf(prof_filename, "%.*s%s",
539                 (int)(sizeof(prof_filename) - sizeof(suffix)), cup_name, suffix);
540
541         if (be_options.opt_profile_use) {
542                 bool res = ir_profile_read(prof_filename);
543                 if (!res) {
544                         fprintf(stderr, "Warning: Couldn't read profile data '%s'\n",
545                                 prof_filename);
546                 }
547         }
548         if (be_options.opt_profile_generate) {
549                 ir_graph *prof_init_irg
550                         = ir_profile_instrument(prof_filename);
551                 initialize_birg(&birgs[num_birgs], prof_init_irg, &env);
552                 num_birgs++;
553         }
554
555         /* For all graphs */
556         for (i = 0; i < num_birgs; ++i) {
557                 be_irg_t *birg = &birgs[i];
558                 ir_graph *irg  = birg->irg;
559                 optimization_state_t state;
560
561                 /* set the current graph (this is important for several firm functions) */
562                 current_ir_graph = irg;
563
564                 if (stat_ev_enabled) {
565                         stat_ev_ctx_push_fobj("bemain_irg", irg);
566                         be_stat_ev("bemain_insns_start", be_count_insns(irg));
567                         be_stat_ev("bemain_blocks_start", be_count_blocks(irg));
568                 }
569
570                 /* stop and reset timers */
571                 be_timer_push(T_OTHER);
572
573                 /* Verify the initial graph */
574                 be_timer_push(T_VERIFY);
575                 if (be_options.verify_option == BE_VERIFY_WARN) {
576                         irg_verify(irg, VERIFY_ENFORCE_SSA);
577                         be_check_dominance(irg);
578                 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
579                         assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
580                         assert(be_check_dominance(irg) && "Dominance verification failed");
581                 }
582                 be_timer_pop(T_VERIFY);
583
584                 /* get a code generator for this graph. */
585                 arch_env->impl->init_graph(irg);
586
587                 /* some transformations need to be done before abi introduce */
588                 if (arch_env->impl->before_abi != NULL)
589                         arch_env->impl->before_abi(irg);
590
591                 /* implement the ABI conventions. */
592                 if (!arch_env->custom_abi) {
593                         be_timer_push(T_ABI);
594                         be_abi_introduce(irg);
595                         be_timer_pop(T_ABI);
596                         dump(DUMP_ABI, irg, "abi");
597                 }
598
599                 /* We can't have Bad-blocks or critical edges in the backend.
600                  * Before removing Bads, we remove unreachable code. */
601                 optimize_graph_df(irg);
602                 remove_critical_cf_edges(irg);
603                 remove_bads(irg);
604
605                 /* We often have dead code reachable through out-edges here. So for
606                  * now we rebuild edges (as we need correct user count for code
607                  * selection) */
608                 edges_deactivate(irg);
609                 edges_activate(irg);
610
611                 dump(DUMP_PREPARED, irg, "before-code-selection");
612
613                 if (be_options.verify_option == BE_VERIFY_WARN) {
614                         be_check_dominance(irg);
615                 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
616                         assert(be_check_dominance(irg) && "Dominance verification failed");
617                 }
618
619                 /* perform codeselection */
620                 be_timer_push(T_CODEGEN);
621                 if (arch_env->impl->prepare_graph != NULL)
622                         arch_env->impl->prepare_graph(irg);
623                 be_timer_pop(T_CODEGEN);
624
625                 if (be_options.verify_option == BE_VERIFY_WARN) {
626                         be_check_dominance(irg);
627                 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
628                         assert(be_check_dominance(irg) && "Dominance verification failed");
629                 }
630
631                 dump(DUMP_PREPARED, irg, "code-selection");
632
633                 be_timer_push(T_EXECFREQ);
634                 /**
635                  * Create execution frequencies from profile data or estimate some
636                  */
637                 if (ir_profile_has_data())
638                         birg->exec_freq = ir_create_execfreqs_from_profile(irg);
639                 else {
640                         /* TODO: edges are corrupt for EDGE_KIND_BLOCK after the local
641                          * optimize graph phase merges blocks in the x86 backend */
642                         edges_deactivate(irg);
643                         birg->exec_freq = compute_execfreq(irg, 10);
644                 }
645                 be_timer_pop(T_EXECFREQ);
646
647
648                 /* disabled for now, fails for EmptyFor.c and XXEndless.c */
649                 /* be_live_chk_compare(irg); */
650
651                 /* schedule the irg */
652                 be_timer_push(T_SCHED);
653                 be_schedule_graph(irg);
654                 be_timer_pop(T_SCHED);
655
656                 dump(DUMP_SCHED, irg, "sched");
657
658                 /* check schedule */
659                 be_timer_push(T_VERIFY);
660                 be_sched_verify(irg, be_options.verify_option);
661                 be_timer_pop(T_VERIFY);
662
663                 /* introduce patterns to assure constraints */
664                 be_timer_push(T_CONSTR);
665                 /* we switch off optimizations here, because they might cause trouble */
666                 save_optimization_state(&state);
667                 set_optimize(0);
668                 set_opt_cse(0);
669
670                 /* add Keeps for should_be_different constrained nodes  */
671                 /* beware: needs schedule due to usage of be_ssa_constr */
672                 assure_constraints(irg);
673                 be_timer_pop(T_CONSTR);
674
675                 dump(DUMP_SCHED, irg, "assured");
676
677                 /* stuff needs to be done after scheduling but before register allocation */
678                 be_timer_push(T_RA_PREPARATION);
679                 if (arch_env->impl->before_ra != NULL)
680                         arch_env->impl->before_ra(irg);
681                 be_timer_pop(T_RA_PREPARATION);
682
683                 /* connect all stack modifying nodes together (see beabi.c) */
684                 be_timer_push(T_ABI);
685                 be_abi_fix_stack_nodes(irg);
686                 be_timer_pop(T_ABI);
687
688                 dump(DUMP_SCHED, irg, "fix_stack");
689
690                 /* check schedule */
691                 be_timer_push(T_VERIFY);
692                 be_sched_verify(irg, be_options.verify_option);
693                 be_timer_pop(T_VERIFY);
694
695                 if (stat_ev_enabled) {
696                         stat_ev_dbl("bemain_costs_before_ra",
697                                         be_estimate_irg_costs(irg, birg->exec_freq));
698                         be_stat_ev("bemain_insns_before_ra", be_count_insns(irg));
699                         be_stat_ev("bemain_blocks_before_ra", be_count_blocks(irg));
700                 }
701
702                 /* Do register allocation */
703                 be_allocate_registers(irg);
704
705                 stat_ev_dbl("bemain_costs_before_ra", be_estimate_irg_costs(irg, birg->exec_freq));
706
707                 dump(DUMP_RA, irg, "ra");
708
709                 be_timer_push(T_FINISH);
710                 if (arch_env->impl->finish != NULL)
711                         arch_env->impl->finish(irg);
712                 be_timer_pop(T_FINISH);
713
714                 dump(DUMP_FINAL, irg, "finish");
715
716                 if (stat_ev_enabled) {
717                         be_stat_ev("bemain_insns_finish", be_count_insns(irg));
718                         be_stat_ev("bemain_blocks_finish", be_count_blocks(irg));
719                 }
720
721                 /* check schedule and register allocation */
722                 be_timer_push(T_VERIFY);
723                 if (be_options.verify_option == BE_VERIFY_WARN) {
724                         irg_verify(irg, VERIFY_ENFORCE_SSA);
725                         be_check_dominance(irg);
726                         be_verify_schedule(irg);
727                         be_verify_register_allocation(irg);
728                 } else if (be_options.verify_option == BE_VERIFY_ASSERT) {
729                         assert(irg_verify(irg, VERIFY_ENFORCE_SSA) && "irg verification failed");
730                         assert(be_check_dominance(irg) && "Dominance verification failed");
731                         assert(be_verify_schedule(irg) && "Schedule verification failed");
732                         assert(be_verify_register_allocation(irg)
733                                && "register allocation verification failed");
734
735                 }
736                 be_timer_pop(T_VERIFY);
737
738                 /* emit assembler code */
739                 be_timer_push(T_EMIT);
740                 if (arch_env->impl->emit != NULL)
741                         arch_env->impl->emit(irg);
742                 be_timer_pop(T_EMIT);
743
744                 dump(DUMP_FINAL, irg, "end");
745
746                 if (!arch_env->custom_abi) {
747                         be_timer_push(T_ABI);
748                         be_abi_free(irg);
749                         be_timer_pop(T_ABI);
750                 }
751
752                 restore_optimization_state(&state);
753
754                 be_timer_pop(T_OTHER);
755
756                 if (be_timing) {
757                         be_timer_id_t t;
758                         if (stat_ev_enabled) {
759                                 for (t = T_FIRST; t < T_LAST+1; ++t) {
760                                         char buf[128];
761                                         snprintf(buf, sizeof(buf), "bemain_time_%s",
762                                                  get_timer_name(t));
763                                         stat_ev_dbl(buf, ir_timer_elapsed_usec(be_timers[i]));
764                                 }
765                         } else {
766                                 printf("==>> IRG %s <<==\n",
767                                        get_entity_name(get_irg_entity(irg)));
768                                 for (t = T_FIRST; t < T_LAST+1; ++t) {
769                                         double val = ir_timer_elapsed_usec(be_timers[t]) / 1000.0;
770                                         printf("%-20s: %8.3lf msec\n", get_timer_name(t), val);
771                                 }
772                         }
773                         for (t = T_FIRST; t < T_LAST+1; ++t) {
774                                 ir_timer_stop(be_timers[t]);
775                                 ir_timer_reset(be_timers[t]);
776                         }
777                 }
778
779                 be_free_birg(irg);
780                 stat_ev_ctx_pop("bemain_irg");
781         }
782
783         arch_env_done(arch_env);
784
785         ir_profile_free();
786         be_done_env(&env);
787
788         be_info_free();
789 }
790
791 /* Main interface to the frontend. */
792 void be_main(FILE *file_handle, const char *cup_name)
793 {
794         ir_timer_t *t = NULL;
795
796         if (be_options.timing == BE_TIME_ON) {
797                 t = ir_timer_new();
798
799                 if (ir_timer_enter_high_priority()) {
800                         fprintf(stderr, "Warning: Could not enter high priority mode.\n");
801                 }
802
803                 ir_timer_reset_and_start(t);
804         }
805
806         if (be_options.statev) {
807                 const char *dot = strrchr(cup_name, '.');
808                 const char *pos = dot ? dot : cup_name + strlen(cup_name);
809                 char       *buf = ALLOCAN(char, pos - cup_name + 1);
810                 strncpy(buf, cup_name, pos - cup_name);
811                 buf[pos - cup_name] = '\0';
812
813                 be_options.statev = 1;
814                 stat_ev_begin(buf, be_options.filtev);
815                 stat_ev_ctx_push_str("bemain_compilation_unit", cup_name);
816         }
817
818         be_main_loop(file_handle, cup_name);
819
820         if (be_options.timing == BE_TIME_ON) {
821                 ir_timer_stop(t);
822                 ir_timer_leave_high_priority();
823                 if (stat_ev_enabled) {
824                         stat_ev_dbl("bemain_backend_time", ir_timer_elapsed_msec(t));
825                 } else {
826                         double val = ir_timer_elapsed_usec(t) / 1000.0;
827                         printf("%-20s: %8.3lf msec\n", "BEMAINLOOP", val);
828                 }
829         }
830
831         if (be_options.statev) {
832                 stat_ev_ctx_pop("bemain_compilation_unit");
833                 stat_ev_end();
834         }
835 }
836
837 static int do_lower_for_target(ir_prog *irp, void *context)
838 {
839         be_lower_for_target();
840         (void) context;
841         (void) irp;
842         return 0;
843 }
844
845 ir_prog_pass_t *lower_for_target_pass(const char *name)
846 {
847         ir_prog_pass_t *pass = XMALLOCZ(ir_prog_pass_t);
848         return def_prog_pass_constructor(pass,
849                                          name ? name : "lower_for_target",
850                                          do_lower_for_target);
851 }