#include "bearch.h"
#include "firm/bearch_firm.h"
#include "ia32/bearch_ia32.h"
+#include "TEMPLATE/bearch_TEMPLATE.h"
#include "be_t.h"
#include "benumb_t.h"
#include "bechordal_t.h"
#include "beifg.h"
#include "beifg_impl.h"
-#include "becopyoptmain.h"
+#include "becopyopt.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)
+#define DUMP_ABI (1 << 1)
+#define DUMP_SCHED (1 << 2)
+#define DUMP_PREPARED (1 << 3)
+#define DUMP_RA (1 << 4)
+#define DUMP_FINAL (1 << 5)
/* options visible for anyone */
be_options_t be_options = {
};
/* dump flags */
-static unsigned dump_flags = DUMP_INITIAL | DUMP_SCHED | DUMP_PREPARED | DUMP_RA | DUMP_FINAL;
+static unsigned dump_flags = 2 * DUMP_FINAL - 1;
/* 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;
static const lc_opt_enum_mask_items_t dump_items[] = {
{ "none", 0 },
{ "initial", DUMP_INITIAL },
+ { "abi", DUMP_ABI },
{ "sched", DUMP_SCHED },
{ "prepared", DUMP_PREPARED },
{ "regalloc", DUMP_RA },
static const lc_opt_enum_const_ptr_items_t isa_items[] = {
{ "firm", &firm_isa },
{ "ia32", &ia32_isa_if },
+ { "TEMPLATE",&TEMPLATE_isa_if },
{ NULL, NULL }
};
static be_main_env_t *be_init_env(be_main_env_t *env)
{
- int i, j, n;
-
+ memset(env, 0, sizeof(*env));
obstack_init(&env->obst);
env->dbg = firm_dbg_register("be.main");
*/
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;
}
/* Normalize proj nodes. */
normalize_proj_nodes(irg);
+ /* Make just one return node. */
+ // normalize_one_return(irg);
+
/* Remove critical edges */
remove_critical_cf_edges(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);
-
/* check, if the dominance property is fulfilled. */
be_check_dominance(irg);
- /* compute the dominance frontiers. */
- birg->dom_front = be_compute_dominance_frontiers(irg);
}
static void be_main_loop(FILE *file_handle)
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);
+ birg.cg = cg_if->init(file_handle, &birg);
/* create the code generator and generate code. */
prepare_graph(&birg);
/* implement the ABI conventions. */
- // birg.abi = be_abi_introduce(&birg);
+ birg.abi = be_abi_introduce(&birg);
+ dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
+ /* generate code */
arch_code_generator_prepare_graph(birg.cg);
/*
dead_node_elimination(irg);
edges_activate(irg);
+ /* Compute loop nesting information (for weighting copies) */
+ construct_cf_backedges(irg);
+
dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
/* Schedule the graphs. */
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);
+ be_abi_fix_stack_nodes(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);
+ /* This is not ready yet: */
+ /* be_abi_fix_stack_bias(birg.abi); */
+
arch_code_generator_done(birg.cg);
dump(DUMP_FINAL, irg, "-end", dump_ir_block_graph_sched);
-
- be_free_dominance_frontiers(birg.dom_front);
+ be_abi_free(birg.abi);
}
be_done_env(&env);
void be_main(FILE *file_handle)
{
+ /* never build code for pseudo irgs */
+ set_visit_pseudo_irgs(0);
+
be_node_init();
be_main_loop(file_handle);
}