#include "irloop_t.h"
#include "irtools.h"
#include "return.h"
+#include "firmstat.h"
#include "bearch.h"
#include "firm/bearch_firm.h"
#include "besched_t.h"
#include "belistsched.h"
#include "belive_t.h"
-#include "bespillilp.h"
#include "bespillbelady.h"
#include "bera.h"
#include "beraextern.h"
static unsigned dump_flags = 0;
/* verify options */
-static unsigned vrfy_option = BE_VRFY_WARN;
+static int vrfy_option = BE_VRFY_WARN;
/* register allocator to use. */
static const be_ra_t *ra = &be_ra_chordal_allocator;
be_opt_register();
be_sched_init();
- be_liveness_init();
be_numbering_init();
be_copy_opt_init();
copystat_init();
unsigned num_nodes_b = 0;
unsigned num_nodes_a = 0;
unsigned num_nodes_r = 0;
- unsigned ra_prolog = 0;
- unsigned ra_epilog = 0;
- unsigned ra_live = 0;
- unsigned ra_spill = 0;
- unsigned ra_color = 0;
- unsigned ra_ifg = 0;
- unsigned ra_copymin = 0;
- unsigned ra_ssa = 0;
- unsigned ra_other = 0;
lc_timer_t *t_prolog, *t_abi, *t_codegen, *t_sched, *t_constr, *t_regalloc, *t_finish, *t_emit, *t_other, *t_verify;
be_ra_timer_t *ra_timer;
/* for debugging, anchors helps */
// dump_all_anchors(1);
-#define BE_TIMER_PUSH(timer) if (be_options.timing == BE_TIME_ON) lc_timer_push(timer)
-#define BE_TIMER_POP() if (be_options.timing == BE_TIME_ON) lc_timer_pop()
+#define BE_TIMER_PUSH(timer) \
+ if (be_options.timing == BE_TIME_ON) { \
+ int res = lc_timer_push(timer); \
+ if (vrfy_option == BE_VRFY_ASSERT) \
+ assert(res && "Timer already on stack, cannot be pushed twice."); \
+ else if (vrfy_option == BE_VRFY_WARN && ! res) \
+ fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
+ lc_timer_get_name(timer)); \
+ }
+#define BE_TIMER_POP(timer) \
+ if (be_options.timing == BE_TIME_ON) { \
+ lc_timer_t *tmp = lc_timer_pop(); \
+ if (vrfy_option == BE_VRFY_ASSERT) \
+ assert(tmp == timer && "Attempt to pop wrong timer."); \
+ else if (vrfy_option == BE_VRFY_WARN && tmp != timer) \
+ fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
+ lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
+ timer = tmp; \
+ }
+
#define BE_TIMER_ONLY(code) if (be_options.timing == BE_TIME_ON) do { code; } while(0)
/* For all graphs */
LC_STOP_AND_RESET_TIMER(t_verify);
LC_STOP_AND_RESET_TIMER(t_other);
}
- BE_TIMER_PUSH(t_other);
+ BE_TIMER_PUSH(t_other); /* t_other */
BE_TIMER_ONLY(num_nodes_b = get_num_reachable_nodes(irg));
/* create the code generator and generate code. */
prepare_graph(&birg);
+ BE_TIMER_POP(t_prolog);
+
/* some transformations need to be done before abi introduce */
+ BE_TIMER_PUSH(t_codegen);
arch_code_generator_before_abi(birg.cg);
-
- BE_TIMER_POP();
- BE_TIMER_PUSH(t_abi);
+ BE_TIMER_POP(t_codegen);
/* implement the ABI conventions. */
+ BE_TIMER_PUSH(t_abi);
birg.abi = be_abi_introduce(&birg);
- dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
+ BE_TIMER_POP(t_abi);
+ dump(DUMP_ABI, irg, "-abi", dump_ir_block_graph);
be_do_stat_nodes(irg, "02 Abi");
- BE_TIMER_POP();
- BE_TIMER_PUSH(t_codegen);
-
/* generate code */
+ BE_TIMER_PUSH(t_codegen);
arch_code_generator_prepare_graph(birg.cg);
+ BE_TIMER_POP(t_codegen);
be_do_stat_nodes(irg, "03 Prepare");
/* Compute loop nesting information (for weighting copies) */
construct_cf_backedges(irg);
-
dump(DUMP_PREPARED, irg, "-prepared", dump_ir_block_graph);
-
- BE_TIMER_POP();
BE_TIMER_ONLY(num_nodes_r = get_num_reachable_nodes(irg));
- BE_TIMER_PUSH(t_codegen);
- /* Schedule the graphs. */
+ /* let backend prepare scheduling */
+ BE_TIMER_PUSH(t_codegen);
arch_code_generator_before_sched(birg.cg);
+ BE_TIMER_POP(t_codegen);
- BE_TIMER_POP();
+ /* schedule the irg */
BE_TIMER_PUSH(t_sched);
-
list_sched(&birg, be_enable_mris);
- dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
+ BE_TIMER_POP(t_sched);
- BE_TIMER_POP();
- BE_TIMER_PUSH(t_verify);
+ dump(DUMP_SCHED, irg, "-sched", dump_ir_block_graph_sched);
/* check schedule */
+ BE_TIMER_PUSH(t_verify);
be_sched_vrfy(birg.irg, vrfy_option);
+ BE_TIMER_POP(t_verify);
be_do_stat_nodes(irg, "04 Schedule");
- BE_TIMER_POP();
+ /* introduce patterns to assure constraints */
BE_TIMER_PUSH(t_constr);
-
/* we switch off optimizations here, because they might cause trouble */
save_optimization_state(&state);
set_optimize(0);
/* add Keeps for should_be_different constrained nodes */
/* beware: needs schedule due to usage of be_ssa_constr */
assure_constraints(&birg);
- dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
+ BE_TIMER_POP(t_constr);
+ dump(DUMP_SCHED, irg, "-assured", dump_ir_block_graph_sched);
be_do_stat_nodes(irg, "05 Constraints");
/* connect all stack modifying nodes together (see beabi.c) */
- be_abi_fix_stack_nodes(birg.abi);
- BE_TIMER_POP();
+ BE_TIMER_PUSH(t_abi);
+ be_abi_fix_stack_nodes(birg.abi, NULL);
+ BE_TIMER_POP(t_abi);
dump(DUMP_SCHED, irg, "-fix_stack", dump_ir_block_graph_sched);
- BE_TIMER_PUSH(t_verify);
/* check schedule */
+ BE_TIMER_PUSH(t_verify);
be_sched_vrfy(birg.irg, vrfy_option);
- BE_TIMER_POP();
+ BE_TIMER_POP(t_verify);
- BE_TIMER_PUSH(t_codegen);
/* do some statistics */
be_do_stat_reg_pressure(&birg);
/* stuff needs to be done after scheduling but before register allocation */
+ BE_TIMER_PUSH(t_codegen);
arch_code_generator_before_ra(birg.cg);
-
- BE_TIMER_POP();
-
- lc_timer_start(t_regalloc);
+ BE_TIMER_POP(t_codegen);
/* Do register allocation */
+ BE_TIMER_ONLY(lc_timer_start(t_regalloc));
ra_timer = ra->allocate(&birg);
- dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
-
- lc_timer_stop(t_regalloc);
+ BE_TIMER_ONLY(lc_timer_stop(t_regalloc));
+ dump(DUMP_RA, irg, "-ra", dump_ir_block_graph_sched);
be_do_stat_nodes(irg, "06 Register Allocation");
+ /* let the codegenerator prepare the graph for emitter */
BE_TIMER_PUSH(t_finish);
-
arch_code_generator_after_ra(birg.cg);
+ BE_TIMER_POP(t_finish);
+
+ /* fix stack offsets */
+ BE_TIMER_PUSH(t_abi);
be_abi_fix_stack_bias(birg.abi);
+ BE_TIMER_POP(t_abi);
- BE_TIMER_POP();
- BE_TIMER_PUSH(t_verify);
+ BE_TIMER_PUSH(t_finish);
+ arch_code_generator_finish(birg.cg);
+ BE_TIMER_POP(t_finish);
- /* check schedule */
+ dump(DUMP_FINAL, irg, "-finish", dump_ir_block_graph_sched);
+
+ /* check schedule and register allocation */
+ BE_TIMER_PUSH(t_verify);
be_sched_vrfy(birg.irg, vrfy_option);
+ be_verify_register_allocation(env.arch_env, birg.irg);
+ BE_TIMER_POP(t_verify);
- BE_TIMER_POP();
+ /* emit assembler code */
BE_TIMER_PUSH(t_emit);
arch_code_generator_done(birg.cg);
- BE_TIMER_POP();
+ BE_TIMER_POP(t_emit);
dump(DUMP_FINAL, irg, "-end", dump_ir_extblock_graph_sched);
+
+ BE_TIMER_PUSH(t_abi);
be_abi_free(birg.abi);
+ BE_TIMER_POP(t_abi);
be_do_stat_nodes(irg, "07 Final");
restore_optimization_state(&state);
BE_TIMER_ONLY(num_nodes_a = get_num_reachable_nodes(irg));
-
- /* switched off due to statistics (statistic module needs all irgs) */
- // free_ir_graph(irg);
- BE_TIMER_POP();
+ BE_TIMER_POP(t_other);
#define LC_EMIT(timer) printf("%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0)
#define LC_EMIT_RA(timer) printf("\t%-20s: %.3lf msec\n", lc_timer_get_description(timer), (double)lc_timer_elapsed_usec(timer) / 1000.0)
LC_EMIT_RA(ra_timer->t_prolog);
LC_EMIT_RA(ra_timer->t_live);
LC_EMIT_RA(ra_timer->t_spill);
+ LC_EMIT_RA(ra_timer->t_spillslots);
LC_EMIT_RA(ra_timer->t_color);
LC_EMIT_RA(ra_timer->t_ifg);
LC_EMIT_RA(ra_timer->t_copymin);
LC_EMIT(t_other);
}
#undef LC_EMIT
+
+ /* switched off due to statistics (statistic module needs all irgs) */
+ if (! stat_is_active())
+ free_ir_graph(irg);
+
}
be_done_env(&env);