#include "becopystat.h"
#include "bessadestr.h"
#include "beabi.h"
-
+#include "belower.h"
#define DUMP_INITIAL (1 << 0)
#define DUMP_ABI (1 << 1)
void (*dumper)(ir_graph *, const char *))
{
if(dump_flags & mask)
- dumper(irg, suffix);
+ be_dump(irg, suffix, dumper);
}
static void prepare_graph(be_irg_t *birg)
/* 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);
+
+ dump(DUMP_PREPARED, irg, "-assured", dump_ir_block_graph);
+
/* 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);