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