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