#include "becopystat.h"
#include "bessadestr.h"
#include "beabi.h"
-
+#include "belower.h"
#define DUMP_INITIAL (1 << 0)
#define DUMP_ABI (1 << 1)
LC_OPT_ENT_ENUM_PTR("ra", "register allocator", &ra_var),
LC_OPT_ENT_ENUM_PTR("isa", "the instruction set architecture", &isa_var),
+#ifdef WITH_ILP
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)),
+#endif /* WITH_ILP */
{ NULL }
};
/* create the code generator and generate code. */
prepare_graph(&birg);
+ /* some transformations need to be done before abi introduce */
+ arch_code_generator_before_abi(birg.cg);
+
/* implement the ABI conventions. */
birg.abi = be_abi_introduce(&birg);
dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
+ /* add Keeps for should_be_different constrained nodes */
+ assure_constraints(&birg);
+
/* Schedule the graphs. */
arch_code_generator_before_sched(birg.cg);
- list_sched(isa, irg);
+ list_sched(env.arch_env, irg);
/* connect all stack modifying nodes together (see beabi.c) */
be_abi_fix_stack_nodes(birg.abi);
ra->allocate(&birg);
dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
+ arch_code_generator_after_ra(birg.cg);
be_abi_fix_stack_bias(birg.abi);
arch_code_generator_done(birg.cg);