#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 "bearch.h"
+#include "firm/bearch_firm.h"
+#include "ia32/bearch_ia32.h"
#include "be_t.h"
-#include "bera_t.h"
#include "benumb_t.h"
+#include "beutil.h"
+#include "benode_t.h"
+#include "beirgmod.h"
#include "besched_t.h"
#include "belistsched.h"
#include "belive_t.h"
-#include "beutil.h"
-#include "bechordal.h"
-#include "bechordal.h"
-#include "bephiopt.h"
-#include "phistat.h"
+#include "bespillilp.h"
+#include "bespillbelady.h"
+#include "bera.h"
+#include "beraextern.h"
+#include "bechordal_t.h"
+#include "beifg.h"
+#include "beifg_impl.h"
+#include "becopyoptmain.h"
+#include "becopystat.h"
+#include "bessadestr.h"
+#include "beabi.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 = &ia32_isa_if;
+
+#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 },
+ { "external", &be_ra_external_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
+};
+
+static lc_opt_enum_const_ptr_var_t isa_var = {
+ (const void **) &isa_if, isa_items
+};
+
+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),
+
+ 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;
+ lc_opt_entry_t *be_grp_ra;
-#include "beasm_dump_globals.h"
-#include "beasm_asm_gnu.h"
+ be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
+ be_grp_ra = lc_opt_get_grp(be_grp_root, "ra");
-#define DUMP_ALLOCATED
-#undef DUMP_LOCALIZED
+ lc_opt_add_table(be_grp_root, be_main_options);
-#define N_PHASES 256
+ /* 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_ra);
+ }
-typedef struct _be_graph_info_t {
- bitset_t *applied_phases;
-} be_graph_info_t;
+ /* 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 */
+}
-static size_t be_info_offset = 0;
-#define get_irg_be_info(irg) get_irg_data(irg, be_graph_info_t, be_info_offset)
+void be_init(void)
+{
+ be_opt_register();
-static int phase_ids = 1;
-static struct obstack obst;
+ be_sched_init();
+ be_liveness_init();
+ be_numbering_init();
+ be_copy_opt_init();
+ copystat_init();
+ phi_class_init();
+}
-int phase_register(phase_t *phase)
+static be_main_env_t *be_init_env(be_main_env_t *env)
{
- phase->id = phase_ids;
- return phase_ids++;
+ int i, j, n;
+
+ memset(env, 0, sizeof(*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.
+ */
+ arch_env_add_irn_handler(env->arch_env, &be_node_irn_handler);
+
+ /*
+ * Create the list of caller save registers.
+ */
+ for(i = 0, n = arch_isa_get_n_reg_class(env->arch_env->isa); i < n; ++i) {
+ const arch_register_class_t *cls = arch_isa_get_reg_class(env->arch_env->isa, i);
+ for(j = 0; j < cls->n_regs; ++j) {
+ const arch_register_t *reg = arch_register_for_index(cls, j);
+ if(arch_register_type_is(reg, caller_save))
+ obstack_ptr_grow(&env->obst, reg);
+ }
+ }
+ obstack_ptr_grow(&env->obst, NULL);
+ env->caller_save = obstack_finish(&env->obst);
+
+ /*
+ * Create the list of callee save registers.
+ */
+ for(i = 0, n = arch_isa_get_n_reg_class(env->arch_env->isa); i < n; ++i) {
+ const arch_register_class_t *cls = arch_isa_get_reg_class(env->arch_env->isa, i);
+ for(j = 0; j < cls->n_regs; ++j) {
+ const arch_register_t *reg = arch_register_for_index(cls, j);
+ if(arch_register_type_is(reg, callee_save))
+ obstack_ptr_grow(&env->obst, reg);
+ }
+ }
+ obstack_ptr_grow(&env->obst, NULL);
+ env->callee_save = obstack_finish(&env->obst);
+
+ return env;
}
-void phase_applied(const ir_graph *irg, const phase_t *phase)
+static void be_done_env(be_main_env_t *env)
{
- be_graph_info_t *info = get_irg_be_info(irg);
-
- if(!info->applied_phases)
- info->applied_phases = bitset_obstack_alloc(&obst, N_PHASES);
+ env->arch_env->isa->impl->done(env->arch_env->isa);
+ obstack_free(&env->obst, NULL);
+}
- bitset_set(info->applied_phases, phase->id);
+static void dump(int mask, ir_graph *irg, const char *suffix,
+ void (*dumper)(ir_graph *, const char *))
+{
+ if(dump_flags & mask)
+ dumper(irg, suffix);
}
-int phase_depends_on(const ir_graph *irg, const phase_t *phase, int n, ...)
+static void prepare_graph(be_irg_t *birg)
{
- int errors = 0;
- int i;
- va_list args;
+ ir_graph *irg = birg->irg;
- if(n > 0) {
- const be_graph_info_t *info = get_irg_be_info(irg);
- const bitset_t *applied_phases = info->applied_phases;
+ /* Normalize proj nodes. */
+ normalize_proj_nodes(irg);
- va_start(args, n);
+ /* Remove critical edges */
+ remove_critical_cf_edges(irg);
- for(i = 0; i < n; ++i) {
- const phase_t *dep_phase = va_arg(args, const phase_t *);
+ /* Compute the dominance information. */
+ free_dom(irg);
+ compute_doms(irg);
- if(!applied_phases || !bitset_is_set(applied_phases, dep_phase->id)) {
- errors++;
- fprintf(stderr, "phase dependency unfulfilled: \"%s\" depends on \"%s\"\n",
- phase->name, dep_phase->name);
- }
- }
+ /* Ensure, that the ir_edges are computed. */
+ edges_activate(irg);
- va_end(args);
+ /* Compute loop nesting information (for weighting copies) */
+ if (get_irg_loopinfo_state(irg) != (loopinfo_valid & loopinfo_cf_consistent))
+ construct_cf_backedges(irg);
- assert(errors > 0 && "There were phase dependency errors");
- }
+ /* check, if the dominance property is fulfilled. */
+ be_check_dominance(irg);
- return errors;
+ /* compute the dominance frontiers. */
+ birg->dom_front = be_compute_dominance_frontiers(irg);
}
-void be_init(void)
+static void be_main_loop(FILE *file_handle)
{
- obstack_init(&obst);
- be_info_offset = register_additional_graph_data(sizeof(be_graph_info_t));
-
- be_sched_init();
- be_liveness_init();
- be_numbering_init();
- be_ra_init();
- be_ra_chordal_init();
- be_phi_opt_init();
-}
+ int i, n;
+ arch_isa_t *isa;
+ be_main_env_t env;
-extern void be_ra_chordal(ir_graph *irg);
+ be_init_env(&env);
-static void be_main_loop(void)
-{
- int i, n;
+ isa = arch_env_get_isa(env.arch_env);
+ /* For all graphs */
for(i = 0, n = get_irp_n_irgs(); i < n; ++i) {
ir_graph *irg = get_irp_irg(i);
+ const arch_code_generator_if_t *cg_if;
+ be_irg_t birg;
- localize_consts(irg);
-#ifdef DUMP_LOCALIZED
- dump_consts_local(0);
- dump_ir_block_graph(irg, "-local-const");
-#endif
- be_numbering(irg);
- list_sched(irg, trivial_selector, NULL);
- be_liveness(irg);
- be_ra_chordal(irg);
+ birg.irg = irg;
+ birg.main_env = &env;
-#ifdef DUMP_ALLOCATED
- dump_allocated_irg(irg, "");
-#endif
- //be_phi_opt(irg);
+ 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 = birg.irg;
+
+ /* Get the code generator interface. */
+ cg_if = isa->impl->get_code_generator_if(isa);
+
+ /* get a code generator for this graph. */
+ birg.cg = cg_if->init(file_handle, birg.irg, env.arch_env);
+
+ /* create the code generator and generate code. */
+ prepare_graph(&birg);
- be_ra_chordal_done(irg);
- be_numbering_done(irg);
+ /* implement the ABI conventions. */
+ // birg.abi = be_abi_introduce(&birg);
+
+ arch_code_generator_prepare_graph(birg.cg);
+
+ /*
+ * Since the code generator made a lot of new nodes and skipped
+ * a lot of old ones, we should do dead node elim here.
+ * Note that this requires disabling the edges here.
+ */
+ edges_deactivate(irg);
+ dead_node_elimination(irg);
+ edges_activate(irg);
+
+ dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
+
+ /* Schedule the graphs. */
+ arch_code_generator_before_sched(birg.cg);
+ list_sched(isa, irg);
+
+ dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
+
+ /* connect all stack modifying nodes together (see beabi.c) */
+ // be_abi_fix_stack(birg.abi);
+
+ /* Verify the schedule */
+ sched_verify_irg(irg);
+
+ /* Do register allocation */
+ arch_code_generator_before_ra(birg.cg);
+ ra->allocate(&birg);
+
+ dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
+
+ arch_code_generator_done(birg.cg);
+ dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
+
+ be_free_dominance_frontiers(birg.dom_front);
}
+
+ 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");
+ /* never build code for pseudo irgs */
+ set_visit_pseudo_irgs(0);
- asm_dump_globals ( gnu_assembler );
- gnuasm_dump ( gnu_assembler, asm_output_file );
- gnuasm_delete_assembler ( gnu_assembler );
- fclose(asm_output_file);
+ be_node_init();
+ be_main_loop(file_handle);
}