fixed indents
[libfirm] / ir / be / bemain.c
index 25cffd7..bc4f54c 100644 (file)
@@ -9,16 +9,29 @@
 
 #include <stdarg.h>
 
+#ifdef WITH_LIBCORE
+#include <libcore/lc_opts.h>
+#include <libcore/lc_opts_enum.h>
+#endif /* WITH_LIBCORE */
+
 #include "obst.h"
 #include "bitset.h"
 
 #include "irprog.h"
+#include "irgopt.h"
 #include "irgraph.h"
 #include "irdump.h"
 #include "phiclass.h"
+#include "irdom_t.h"
+#include "iredges_t.h"
+#include "irloop_t.h"
+#include "irtools.h"
 
 #include "be_t.h"
-#include "bera_t.h"
+#include "bechordal_t.h"
+#include "bera.h"
+#include "beifg.h"
+#include "beifg_impl.h"
 #include "benumb_t.h"
 #include "besched_t.h"
 #include "belistsched.h"
 #include "bearch.h"
 #include "becopyoptmain.h"
 #include "becopystat.h"
-#include "bearch_firm.h"
+#include "bessadestr.h"
+#include "benode_t.h"
+#include "beirgmod.h"
+#include "bespillilp.h"
+#include "bespillbelady.h"
+
+#include "firm/bearch_firm.h"
+#include "ia32/bearch_ia32.h"
+
+#define DUMP_INITIAL           (1 << 0)
+#define DUMP_SCHED                     (1 << 1)
+#define DUMP_PREPARED          (1 << 2)
+#define DUMP_RA                                (1 << 3)
+#define DUMP_FINAL                     (1 << 4)
+
+/* options visible for anyone */
+be_options_t be_options = {
+       /* ilp server */
+       "i44pc52.info.uni-karlsruhe.de",
+
+       /* ilp solver */
+       "cplex"
+};
+
+/* dump flags */
+static unsigned dump_flags = DUMP_INITIAL | DUMP_SCHED | DUMP_PREPARED | DUMP_RA | DUMP_FINAL;
+
+/* register allocator to use. */
+static const be_ra_t *ra = &be_ra_chordal_allocator;
+
+/* back end instruction set architecture to use */
+static const arch_isa_if_t *isa_if = &firm_isa;
+
+#ifdef WITH_LIBCORE
+
+static lc_opt_entry_t *be_grp_root = NULL;
+
+/* possible dumping options */
+static const lc_opt_enum_mask_items_t dump_items[] = {
+       { "none",       0 },
+       { "initial",    DUMP_INITIAL },
+       { "sched",      DUMP_SCHED  },
+       { "prepared",   DUMP_PREPARED },
+       { "regalloc",   DUMP_RA },
+       { "final",      DUMP_FINAL },
+       { "all",        2 * DUMP_FINAL - 1 },
+       { NULL,         0 }
+};
+
+/* register allocators */
+static const lc_opt_enum_const_ptr_items_t ra_items[] = {
+       { "chordal", &be_ra_chordal_allocator },
+       { NULL,      NULL }
+};
+
+/* instruction set architectures. */
+static const lc_opt_enum_const_ptr_items_t isa_items[] = {
+       { "firm",    &firm_isa },
+       { "ia32",    &ia32_isa_if },
+       { NULL,      NULL }
+};
+
+static lc_opt_enum_mask_var_t dump_var = {
+       &dump_flags, dump_items
+};
+
+static lc_opt_enum_const_ptr_var_t ra_var = {
+       (const void **) &ra, ra_items
+};
 
-#include "beasm_dump_globals.h"
-#include "beasm_asm_gnu.h"
+static lc_opt_enum_const_ptr_var_t isa_var = {
+       (const void **) &isa_if, isa_items
+};
 
-#undef DUMP_ALLOCATED
-#undef DUMP_LOCALIZED
+static const lc_opt_table_entry_t be_main_options[] = {
+       LC_OPT_ENT_ENUM_MASK("dump", "dump irg on several occasions", &dump_var),
+       LC_OPT_ENT_ENUM_PTR("ra", "register allocator", &ra_var),
+       LC_OPT_ENT_ENUM_PTR("isa", "the instruction set architecture", &isa_var),
 
-#define N_PHASES 256
+       LC_OPT_ENT_STR ("ilp.server", "the ilp server name", be_options.ilp_server, sizeof(be_options.ilp_server)),
+       LC_OPT_ENT_STR ("ilp.solver", "the ilp solver name", be_options.ilp_solver, sizeof(be_options.ilp_solver)),
+       { NULL }
+};
+
+#endif /* WITH_LIBCORE */
+
+void be_opt_register(void)
+{
+#ifdef WITH_LIBCORE
+       int i;
+
+       be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
+
+       lc_opt_add_table(be_grp_root, be_main_options);
+
+       /* register register allocator options */
+       for(i = 0; ra_items[i].name != NULL; ++i) {
+               const be_ra_t *ra = ra_items[i].value;
+               ra->register_options(be_grp_root);
+       }
+
+       /* register isa options */
+       for(i = 0; isa_items[i].name != NULL; ++i) {
+               const arch_isa_if_t *isa = isa_items[i].value;
+               isa->register_options(be_grp_root);
+       }
+#endif /* WITH_LIBCORE */
+}
 
 
 void be_init(void)
 {
+       be_opt_register();
+
        be_sched_init();
        be_liveness_init();
        be_numbering_init();
-       be_ra_init();
-       be_ra_chordal_init();
        be_copy_opt_init();
-#ifdef DO_STAT
-       stat_init();
-#endif
+       copystat_init();
+       phi_class_init();
+}
+
+static be_main_env_t *be_init_env(be_main_env_t *env)
+{
+  obstack_init(&env->obst);
+  env->dbg = firm_dbg_register("be.main");
+
+  env->arch_env = obstack_alloc(&env->obst, sizeof(env->arch_env[0]));
+  arch_env_init(env->arch_env, isa_if);
+
+  /* Register the irn handler of the architecture */
+  if (arch_isa_get_irn_handler(env->arch_env->isa))
+               arch_env_add_irn_handler(env->arch_env, arch_isa_get_irn_handler(env->arch_env->isa));
+
+  /*
+   * Register the node handler of the back end infrastructure.
+   * This irn handler takes care of the platform independent
+   * spill, reload and perm nodes.
+   */
+  env->node_factory = obstack_alloc(&env->obst, sizeof(*env->node_factory));
+  be_node_factory_init(env->node_factory, env->arch_env->isa);
+  arch_env_add_irn_handler(env->arch_env, be_node_get_irn_handler(env->node_factory));
+
+  return env;
 }
 
-static void be_init_arch_env(arch_env_t *env)
+static void be_done_env(be_main_env_t *env)
 {
-  arch_env_init(env, &firm_isa);
-  arch_env_add_irn_handler(env, &firm_irn_handler);
+       env->arch_env->isa->impl->done(env->arch_env->isa);
+       obstack_free(&env->obst, NULL);
+}
 
-  env->isa->init();
+static void dump(int mask, ir_graph *irg, const char *suffix,
+                                void (*dumper)(ir_graph *, const char *))
+{
+       if(dump_flags & mask)
+               dumper(irg, suffix);
 }
 
-static void be_main_loop(void)
+static void prepare_graph(be_main_env_t *s, ir_graph *irg)
+{
+       /* Normalize proj nodes. */
+       normalize_proj_nodes(irg);
+
+       /* Remove critical edges */
+       remove_critical_cf_edges(irg);
+
+       /* Compute the dominance information. */
+       free_dom(irg);
+       compute_doms(irg);
+
+       /* Ensure, that the ir_edges are computed. */
+       edges_activate(irg);
+
+       /* Compute loop nesting information (for weighting copies) */
+       if (get_irg_loopinfo_state(irg) != (loopinfo_valid & loopinfo_cf_consistent))
+               construct_cf_backedges(irg);
+
+       be_check_dominance(irg);
+}
+
+static void be_main_loop(FILE *file_handle)
 {
        int i, n;
-  arch_env_t env;
-  const arch_isa_if_t *isa;
+       arch_isa_t *isa;
+       be_main_env_t env;
 
-  be_init_arch_env(&env);
+       be_init_env(&env);
 
-  isa = arch_env_get_isa(&env);
+       isa = arch_env_get_isa(env.arch_env);
 
+       /* For all graphs */
        for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
-               int j, m;
                ir_graph *irg = get_irp_irg(i);
 
-               localize_consts(irg);
-#ifdef DUMP_LOCALIZED
-               dump_consts_local(0);
-               dump_ir_block_graph(irg, "-local-const");
-#endif
-               be_numbering(irg);
+               arch_code_generator_t *cg;
+               const arch_code_generator_if_t *cg_if;
+
+               DBG((env.dbg, LEVEL_2, "====> IRG: %F\n", irg));
+               dump(DUMP_INITIAL, irg, "-begin", dump_ir_block_graph);
+
+               /* set the current graph (this is important for several firm functions) */
+               current_ir_graph = irg;
+
+               /* Get the code generator interface. */
+               cg_if = isa->impl->get_code_generator(isa);
+
+               /* get a code generator for this graph. */
+               cg = cg_if->init(file_handle, irg, env.arch_env);
+
+               /* create the code generator and generate code. */
+               prepare_graph(&env, irg);
+               arch_code_generator_prepare_graph(cg);
+
+               edges_deactivate(irg);
+               dead_node_elimination(irg);
+               edges_activate(irg);
+
+               dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
 
                /* Schedule the graphs. */
-               list_sched(irg, trivial_selector);
+               arch_code_generator_before_sched(cg);
+               list_sched(isa, irg);
 
-               /* Liveness analysis */
-               be_liveness(irg);
+               dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
 
-#ifdef DO_STAT
-               stat_reset();
-#endif
-               /* Perform the following for each register class. */
-               for(j = 0, m = isa->get_n_reg_class(); j < m; ++j) {
-                       const arch_register_class_t *cls = isa->get_reg_class(j);
+               /* Verify the schedule */
+               sched_verify_irg(irg);
 
-                       be_ra_chordal(irg, &env, cls);
+               /* Do register allocation */
+               arch_code_generator_before_ra(cg);
+               ra->allocate(&env, irg);
 
-#ifdef DUMP_ALLOCATED
-                       dump_allocated_irg(&env, irg, "");
-#endif
-#ifdef DO_STAT
-                       stat_collect_irg(irg);
-#endif
-                       be_copy_opt(irg, &env, cls);
-                       be_ra_chordal_done(irg);
-               }
-#ifdef DO_STAT
-               stat_dump(irg);
-#endif
-           be_numbering_done(irg);
+               dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
+
+               arch_code_generator_done(cg);
+               dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
        }
+
+       be_done_env(&env);
 }
 
-void be_main(int argc, const char *argv[])
+void be_main(FILE *file_handle)
 {
-       assembler_t *gnu_assembler;
-       FILE *asm_output_file;
-
-       be_main_loop();
-       gnu_assembler = gnuasm_create_assembler();
-       asm_output_file = fopen("asm_output.asm", "w");
-
-       asm_dump_globals(gnu_assembler);
-       gnuasm_dump(gnu_assembler, asm_output_file);
-       gnuasm_delete_assembler(gnu_assembler);
-       fclose(asm_output_file);
+  be_main_loop(file_handle);
 }