X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbemain.c;h=bc4f54cebc6729c1d25efc9a7bed4626d8c779bf;hb=0d841728a12986b13b56bc5c019ff9466f1bd3ae;hp=b6a5320c1d3feb5918cb49ee9a658150aefb2a22;hpb=16cd557c101a0e9283182877b6c2362d548d02a5;p=libfirm

diff --git a/ir/be/bemain.c b/ir/be/bemain.c
index b6a5320c1..bc4f54ceb 100644
--- a/ir/be/bemain.c
+++ b/ir/be/bemain.c
@@ -9,128 +9,281 @@
 
 #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 "belive_t.h"
 #include "beutil.h"
-#include "phiclass_t.h"
-#include "bechordal.h"
 #include "bechordal.h"
-#include "bephiopt.h"
-#include "phistat.h"
+#include "bearch.h"
+#include "becopyoptmain.h"
+#include "becopystat.h"
+#include "bessadestr.h"
+#include "benode_t.h"
+#include "beirgmod.h"
+#include "bespillilp.h"
+#include "bespillbelady.h"
 
-#define DUMP_LOCAL 1
+#include "firm/bearch_firm.h"
+#include "ia32/bearch_ia32.h"
 
-#define N_PHASES 256
+#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)
 
-typedef struct _be_graph_info_t {
-	bitset_t *applied_phases;
-} be_graph_info_t;
+/* options visible for anyone */
+be_options_t be_options = {
+	/* ilp server */
+	"i44pc52.info.uni-karlsruhe.de",
 
-static size_t be_info_offset = 0;
+	/* ilp solver */
+	"cplex"
+};
 
-#define get_irg_be_info(irg) get_irg_data(irg, be_graph_info_t, be_info_offset)
+/* dump flags */
+static unsigned dump_flags = DUMP_INITIAL | DUMP_SCHED | DUMP_PREPARED | DUMP_RA | DUMP_FINAL;
 
-static int phase_ids = 1;
-static struct obstack obst;
+/* register allocator to use. */
+static const be_ra_t *ra = &be_ra_chordal_allocator;
 
-int phase_register(phase_t *phase)
-{
-	phase->id = phase_ids;
-	return phase_ids++;
-}
+/* back end instruction set architecture to use */
+static const arch_isa_if_t *isa_if = &firm_isa;
 
-void phase_applied(const ir_graph *irg, const phase_t *phase)
-{
-	be_graph_info_t *info = get_irg_be_info(irg);
+#ifdef WITH_LIBCORE
 
-	if(!info->applied_phases)
-		info->applied_phases = bitset_obstack_alloc(&obst, N_PHASES);
+static lc_opt_entry_t *be_grp_root = NULL;
 
-	bitset_set(info->applied_phases, phase->id);
-}
+/* 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 }
+};
 
-int phase_depends_on(const ir_graph *irg, const phase_t *phase, int n, ...)
-{
-	int errors = 0;
-	int i;
-	va_list args;
+/* 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
+};
 
-	if(n > 0) {
-		const be_graph_info_t *info = get_irg_be_info(irg);
-		const bitset_t *applied_phases = info->applied_phases;
+static lc_opt_enum_const_ptr_var_t isa_var = {
+	(const void **) &isa_if, isa_items
+};
 
-		va_start(args, n);
+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),
 
-		for(i = 0; i < n; ++i) {
-			const phase_t *dep_phase = va_arg(args, const phase_t *);
+	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 }
+};
 
-			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);
-			}
-		}
+#endif /* WITH_LIBCORE */
+
+void be_opt_register(void)
+{
+#ifdef WITH_LIBCORE
+	int i;
 
-		va_end(args);
+	be_grp_root = lc_opt_get_grp(firm_opt_get_root(), "be");
 
-		assert(errors > 0 && "There were phase dependency errors");
+	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);
 	}
 
-	return errors;
+	/* 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)
 {
-	obstack_init(&obst);
-	be_info_offset = register_additional_graph_data(sizeof(be_graph_info_t));
+	be_opt_register();
 
 	be_sched_init();
 	be_liveness_init();
 	be_numbering_init();
-	be_ra_init();
-	be_ra_chordal_init();
-	be_phi_opt_init();
+	be_copy_opt_init();
+	copystat_init();
+	phi_class_init();
 }
 
-extern void be_ra_chordal(ir_graph *irg);
+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));
 
-static void be_main_loop(void)
+  return env;
+}
+
+static void be_done_env(be_main_env_t *env)
+{
+	env->arch_env->isa->impl->done(env->arch_env->isa);
+	obstack_free(&env->obst, NULL);
+}
+
+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 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_isa_t *isa;
+	be_main_env_t env;
 
+	be_init_env(&env);
+
+	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);
 
-		localize_consts(irg);
-		if (DUMP_LOCAL) {
-			dump_consts_local(0);
-			dump_ir_block_graph(irg, "-local");
-		}
-
-		be_numbering(irg);
-		list_sched(irg, trivial_selector, NULL);
-		be_liveness(irg);
-		be_ra_chordal(irg);
-		//be_phi_opt(irg);
-		//be_phi_destruction(irg);
-
-		be_ra_chordal_done(irg);
-		be_numbering_done(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. */
+		arch_code_generator_before_sched(cg);
+		list_sched(isa, irg);
+
+		dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
+
+		/* Verify the schedule */
+		sched_verify_irg(irg);
+
+		/* Do register allocation */
+		arch_code_generator_before_ra(cg);
+		ra->allocate(&env, 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)
 {
-	be_main_loop();
+  be_main_loop(file_handle);
 }