Commit 0161c959 authored by Matthias Braun's avatar Matthias Braun
Browse files

use libfirm timing facilities

[r17695]
parent 3da73bb7
......@@ -26,12 +26,11 @@
#ifndef FIRM_BE_BE_T_H
#define FIRM_BE_BE_T_H
#include <libcore/lc_timing.h>
#include "firm_types.h"
#include "obst.h"
#include "debug.h"
#include "bitset.h"
#include "timing.h"
#include "be.h"
#include "bearch.h"
......@@ -102,39 +101,39 @@ extern int be_timing;
#define BE_TIMER_PUSH(timer) \
if (be_timing) { \
int res = lc_timer_push(timer); \
int res = ir_timer_push(timer); \
(void) res; \
assert(res && "Timer already on stack, cannot be pushed twice."); \
}
#define BE_TIMER_POP(timer) \
if (be_timing) { \
lc_timer_t *tmp = lc_timer_pop(); \
ir_timer_t *tmp = ir_timer_pop(); \
(void) tmp; \
assert(tmp == timer && "Attempt to pop wrong timer."); \
}
extern lc_timer_t *t_abi;
extern lc_timer_t *t_codegen;
extern lc_timer_t *t_sched;
extern lc_timer_t *t_constr;
extern lc_timer_t *t_finish;
extern lc_timer_t *t_emit;
extern lc_timer_t *t_other;
extern lc_timer_t *t_execfreq;
extern lc_timer_t *t_verify;
extern lc_timer_t *t_heights;
extern lc_timer_t *t_live; /**< timer for liveness calculation */
extern lc_timer_t *t_ssa_constr; /**< timer for ssa reconstruction */
extern lc_timer_t *t_ra_prolog; /**< timer for prolog */
extern lc_timer_t *t_ra_epilog; /**< timer for epilog */
extern lc_timer_t *t_ra_constr; /**< timer for spill constraints */
extern lc_timer_t *t_ra_spill; /**< timer for spilling */
extern lc_timer_t *t_ra_spill_apply;
extern lc_timer_t *t_ra_color; /**< timer for graph coloring */
extern lc_timer_t *t_ra_ifg; /**< timer for building interference graph */
extern lc_timer_t *t_ra_copymin; /**< timer for copy minimization */
extern lc_timer_t *t_ra_ssa; /**< timer for ssa destruction */
extern lc_timer_t *t_ra_other; /**< timer for remaining stuff */
extern ir_timer_t *t_abi;
extern ir_timer_t *t_codegen;
extern ir_timer_t *t_sched;
extern ir_timer_t *t_constr;
extern ir_timer_t *t_finish;
extern ir_timer_t *t_emit;
extern ir_timer_t *t_other;
extern ir_timer_t *t_execfreq;
extern ir_timer_t *t_verify;
extern ir_timer_t *t_heights;
extern ir_timer_t *t_live; /**< timer for liveness calculation */
extern ir_timer_t *t_ssa_constr; /**< timer for ssa reconstruction */
extern ir_timer_t *t_ra_prolog; /**< timer for prolog */
extern ir_timer_t *t_ra_epilog; /**< timer for epilog */
extern ir_timer_t *t_ra_constr; /**< timer for spill constraints */
extern ir_timer_t *t_ra_spill; /**< timer for spilling */
extern ir_timer_t *t_ra_spill_apply;
extern ir_timer_t *t_ra_color; /**< timer for graph coloring */
extern ir_timer_t *t_ra_ifg; /**< timer for building interference graph */
extern ir_timer_t *t_ra_copymin; /**< timer for copy minimization */
extern ir_timer_t *t_ra_ssa; /**< timer for ssa destruction */
extern ir_timer_t *t_ra_other; /**< timer for remaining stuff */
#endif /* FIRM_BE_BE_T_H */
......@@ -61,7 +61,6 @@
#include <libcore/lc_opts.h>
#include <libcore/lc_opts_enum.h>
#include <libcore/lc_timing.h>
#ifdef WITH_ILP
#include <lpp/lpp.h>
......
......@@ -40,7 +40,6 @@
#include <libcore/lc_opts.h>
#include <libcore/lc_opts_enum.h>
#include <libcore/lc_timing.h>
#include "ircons_t.h"
#include "irmode_t.h"
......
......@@ -65,9 +65,8 @@
#include "beirg_t.h"
#include "error.h"
#include <libcore/lc_timing.h>
#include <libcore/lc_opts.h>
#include <libcore/lc_opts_enum.h>
#include "lc_opts.h"
#include "lc_opts_enum.h"
#define DUMP_BEFORE 1
#define DUMP_AFTER 2
......@@ -1161,7 +1160,7 @@ static FILE *my_open(const be_chordal_env_t *env, const char *prefix, const char
void co_driver(be_chordal_env_t *cenv)
{
lc_timer_t *timer = lc_timer_register("firm.be.copyopt", "runtime");
ir_timer_t *timer = ir_timer_register("firm.be.copyopt", "runtime");
co_complete_stats_t before, after;
copy_opt_t *co;
co_algo_t *algo_func;
......@@ -1218,11 +1217,11 @@ void co_driver(be_chordal_env_t *cenv)
algo_func = algos[algo].algo;
/* perform actual copy minimization */
lc_timer_reset_and_start(timer);
ir_timer_reset_and_start(timer);
was_optimal = algo_func(co);
lc_timer_stop(timer);
ir_timer_stop(timer);
be_stat_ev("co_time", lc_timer_elapsed_msec(timer));
be_stat_ev("co_time", ir_timer_elapsed_msec(timer));
be_stat_ev_ull("co_optimal", was_optimal);
if (dump_flags & DUMP_AFTER) {
......
......@@ -29,8 +29,8 @@
#endif
#include <string.h>
#include <libcore/lc_timing.h>
#include "timing.h"
#include "xmalloc.h"
#include "irgraph.h"
#include "irgwalk.h"
......@@ -478,7 +478,7 @@ static void load_colors(color_save_t *color_saver) {
*/
void co_compare_solvers(be_chordal_env_t *chordal_env) {
copy_opt_t *co;
lc_timer_t *timer;
ir_timer_t *timer;
color_save_t saver;
int costs_inevit, costs_init, costs_solved, lower_bound;
......@@ -509,44 +509,44 @@ void co_compare_solvers(be_chordal_env_t *chordal_env) {
copystat_add_max_costs(co_get_max_copy_costs(co));
/* heuristic 1 (Daniel Grund) */
timer = lc_timer_register("heur1", NULL);
lc_timer_reset_and_start(timer);
timer = ir_timer_register("heur1", NULL);
ir_timer_reset_and_start(timer);
co_solve_heuristic(co);
lc_timer_stop(timer);
ir_timer_stop(timer);
costs_solved = co_get_copy_costs(co);
DBG((dbg, LEVEL_1, "HEUR1 costs: %3d\n", costs_solved));
copystat_add_heur_time(lc_timer_elapsed_msec(timer));
copystat_add_heur_time(ir_timer_elapsed_msec(timer));
copystat_add_heur_costs(costs_solved);
assert(lower_bound <= costs_solved);
/* heuristic 2 (Sebastian Hack) */
timer = lc_timer_register("heur2", NULL);
lc_timer_reset_and_start(timer);
timer = ir_timer_register("heur2", NULL);
ir_timer_reset_and_start(timer);
co_solve_heuristic_new(co);
lc_timer_stop(timer);
ir_timer_stop(timer);
costs_solved = co_get_copy_costs(co);
DBG((dbg, LEVEL_1, "HEUR2 costs: %3d\n", costs_solved));
copystat_add_heur_time(lc_timer_elapsed_msec(timer));
copystat_add_heur_time(ir_timer_elapsed_msec(timer));
copystat_add_heur_costs(costs_solved);
assert(lower_bound <= costs_solved);
/* Park & Moon register coalescing (Kimon Hoffmann) */
timer = lc_timer_register("park", NULL);
lc_timer_reset_and_start(timer);
timer = ir_timer_register("park", NULL);
ir_timer_reset_and_start(timer);
co_solve_park_moon(co);
lc_timer_stop(timer);
ir_timer_stop(timer);
costs_solved = co_get_copy_costs(co);
DBG((dbg, LEVEL_1, "Park/Moon costs: %3d\n", costs_solved));
copystat_add_heur_time(lc_timer_elapsed_msec(timer));
copystat_add_heur_time(ir_timer_elapsed_msec(timer));
copystat_add_heur_costs(costs_solved);
assert(lower_bound <= costs_solved);
......
......@@ -32,8 +32,8 @@
#include <libcore/lc_opts.h>
#include <libcore/lc_opts_enum.h>
#include <libcore/lc_timing.h>
#include "timing.h"
#include "bitset.h"
#include "irgwalk.h"
#include "irnode_t.h"
......@@ -395,7 +395,7 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
copy_opt_t *co;
be_ifg_t *old_if = chordal_env->ifg;
lc_timer_t *timer = lc_timer_register("getTime","get Time of copy minimization using the ifg");
ir_timer_t *timer = ir_timer_register("getTime","get Time of copy minimization using the ifg");
unsigned long elapsed_usec = 0;
if (get_irg_estimated_node_cnt(chordal_env->irg) >= BE_CH_PERFORMANCETEST_MIN_NODES)
......@@ -403,22 +403,22 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
coloring_init(&coloring, chordal_env->irg, chordal_env->birg->main_env->arch_env);
coloring_save(&coloring);
lc_timer_reset(timer);
ir_timer_reset(timer);
for (i = 0; i<tests; i++) /* performance test with std */
{
used_memory = lc_get_heap_used_bytes();
used_memory = ir_get_heap_used_bytes();
rt = lc_timer_enter_high_priority();
lc_timer_start(timer);
rt = ir_timer_enter_high_priority();
ir_timer_start(timer);
chordal_env->ifg = be_ifg_std_new(chordal_env);
lc_timer_stop(timer);
rt = lc_timer_leave_high_priority();
ir_timer_stop(timer);
rt = ir_timer_leave_high_priority();
used_memory = lc_get_heap_used_bytes() - used_memory;
used_memory = ir_get_heap_used_bytes() - used_memory;
coloring_restore(&coloring);
......@@ -427,13 +427,13 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
co_build_ou_structure(co);
co_build_graph_structure(co);
rt = lc_timer_enter_high_priority();
lc_timer_start(timer);
rt = ir_timer_enter_high_priority();
ir_timer_start(timer);
co_solve_heuristic_new(co);
lc_timer_stop(timer);
rt = lc_timer_leave_high_priority();
ir_timer_stop(timer);
rt = ir_timer_leave_high_priority();
co_free_graph_structure(co);
co_free_ou_structure(co);
......@@ -442,7 +442,7 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
}
elapsed_usec = lc_timer_elapsed_usec(timer);
elapsed_usec = ir_timer_elapsed_usec(timer);
/* calculating average */
elapsed_usec = elapsed_usec / tests;
......@@ -453,17 +453,17 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
for (i = 0; i<tests; i++) /* performance test with clique */
{
used_memory = lc_get_heap_used_bytes();
used_memory = ir_get_heap_used_bytes();
rt = lc_timer_enter_high_priority();
lc_timer_start(timer);
rt = ir_timer_enter_high_priority();
ir_timer_start(timer);
chordal_env->ifg = be_ifg_clique_new(chordal_env);
lc_timer_stop(timer);
rt = lc_timer_leave_high_priority();
ir_timer_stop(timer);
rt = ir_timer_leave_high_priority();
used_memory = lc_get_heap_used_bytes() - used_memory;
used_memory = ir_get_heap_used_bytes() - used_memory;
coloring_restore(&coloring);
......@@ -472,13 +472,13 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
co_build_ou_structure(co);
co_build_graph_structure(co);
rt = lc_timer_enter_high_priority();
lc_timer_start(timer);
rt = ir_timer_enter_high_priority();
ir_timer_start(timer);
co_solve_heuristic_new(co);
lc_timer_stop(timer);
rt = lc_timer_leave_high_priority();
ir_timer_stop(timer);
rt = ir_timer_leave_high_priority();
co_free_graph_structure(co);
co_free_ou_structure(co);
......@@ -487,7 +487,7 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
}
elapsed_usec = lc_timer_elapsed_usec(timer);
elapsed_usec = ir_timer_elapsed_usec(timer);
/* calculating average */
elapsed_usec = elapsed_usec / tests;
......@@ -498,17 +498,17 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
for (i = 0; i<tests; i++) /* performance test with list */
{
used_memory = lc_get_heap_used_bytes();
used_memory = ir_get_heap_used_bytes();
rt = lc_timer_enter_high_priority();
lc_timer_start(timer);
rt = ir_timer_enter_high_priority();
ir_timer_start(timer);
chordal_env->ifg = be_ifg_list_new(chordal_env);
lc_timer_stop(timer);
rt = lc_timer_leave_high_priority();
ir_timer_stop(timer);
rt = ir_timer_leave_high_priority();
used_memory = lc_get_heap_used_bytes() - used_memory;
used_memory = ir_get_heap_used_bytes() - used_memory;
coloring_restore(&coloring);
......@@ -517,13 +517,13 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
co_build_ou_structure(co);
co_build_graph_structure(co);
rt = lc_timer_enter_high_priority();
lc_timer_start(timer);
rt = ir_timer_enter_high_priority();
ir_timer_start(timer);
co_solve_heuristic_new(co);
lc_timer_stop(timer);
rt = lc_timer_leave_high_priority();
ir_timer_stop(timer);
rt = ir_timer_leave_high_priority();
co_free_graph_structure(co);
co_free_ou_structure(co);
......@@ -532,7 +532,7 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
}
elapsed_usec = lc_timer_elapsed_usec(timer);
elapsed_usec = ir_timer_elapsed_usec(timer);
/* calculating average */
elapsed_usec = elapsed_usec / tests;
......@@ -543,17 +543,17 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
for (i = 0; i<tests; i++) /* performance test with pointer */
{
used_memory = lc_get_heap_used_bytes();
used_memory = ir_get_heap_used_bytes();
rt = lc_timer_enter_high_priority();
lc_timer_start(timer);
rt = ir_timer_enter_high_priority();
ir_timer_start(timer);
chordal_env->ifg = be_ifg_pointer_new(chordal_env);
lc_timer_stop(timer);
rt = lc_timer_leave_high_priority();
ir_timer_stop(timer);
rt = ir_timer_leave_high_priority();
used_memory = lc_get_heap_used_bytes() - used_memory;
used_memory = ir_get_heap_used_bytes() - used_memory;
coloring_restore(&coloring);
......@@ -562,13 +562,13 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
co_build_ou_structure(co);
co_build_graph_structure(co);
rt = lc_timer_enter_high_priority();
lc_timer_start(timer);
rt = ir_timer_enter_high_priority();
ir_timer_start(timer);
co_solve_heuristic_new(co);
lc_timer_stop(timer);
rt = lc_timer_leave_high_priority();
ir_timer_stop(timer);
rt = ir_timer_leave_high_priority();
co_free_graph_structure(co);
co_free_ou_structure(co);
......@@ -577,7 +577,7 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env)
}
elapsed_usec = lc_timer_elapsed_usec(timer);
elapsed_usec = ir_timer_elapsed_usec(timer);
/* calculating average */
elapsed_usec = elapsed_usec / tests;
......
......@@ -56,13 +56,13 @@
#include "irprintf.h"
#include "plist.h"
#include "irprintf.h"
#include "timing.h"
#include <lpp/lpp.h>
#include <lpp/lpp_net.h>
#include <libcore/lc_opts.h>
#include <libcore/lc_opts_enum.h>
#include <libcore/lc_timing.h>
#include "be.h"
#include "benode_t.h"
......@@ -194,9 +194,9 @@ typedef struct {
/* check if a double value is within an epsilon environment of 0 */
#define LPP_VALUE_IS_0(dbl) (fabs((dbl)) <= 1e-10)
#define ilp_timer_push(t) lc_timer_push((t))
#define ilp_timer_pop() lc_timer_pop()
#define ilp_timer_elapsed_usec(t) lc_timer_elapsed_usec((t))
#define ilp_timer_push(t) ir_timer_push((t))
#define ilp_timer_pop() ir_timer_pop()
#define ilp_timer_elapsed_usec(t) ir_timer_elapsed_usec((t))
/* option variable */
static ilpsched_options_t ilp_opts = {
......@@ -980,7 +980,7 @@ static void create_variables(be_ilpsched_env_t *env, lpp_t *lpp, be_ilpsched_irn
ilp_livein_node_t *livein;
ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
unsigned weigth_y = ba->n_interesting_nodes * ba->n_interesting_nodes;
lc_timer_t *t_var = lc_timer_register("beilpsched_var", "create ilp variables");
ir_timer_t *t_var = ir_timer_register("beilpsched_var", "create ilp variables");
ilp_timer_push(t_var);
num_block_var = num_nodes = 0;
......@@ -1162,8 +1162,8 @@ static void create_assignment_and_precedence_constraints(be_ilpsched_env_t *env,
ir_node *irn;
ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
bitset_t *bs_block_irns = bitset_alloca(ba->block_last_idx);
lc_timer_t *t_cst_assign = lc_timer_register("beilpsched_cst_assign", "create assignment constraints");
lc_timer_t *t_cst_prec = lc_timer_register("beilpsched_cst_prec", "create precedence constraints");
ir_timer_t *t_cst_assign = ir_timer_register("beilpsched_cst_assign", "create assignment constraints");
ir_timer_t *t_cst_prec = ir_timer_register("beilpsched_cst_prec", "create precedence constraints");
num_cst_assign = num_cst_prec = num_cst_dead = 0;
foreach_linked_irns(ba->head_ilp_nodes, irn) {
......@@ -1293,7 +1293,7 @@ static void create_ressource_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_
char buf[1024];
unsigned num_cst_resrc = 0;
ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
lc_timer_t *t_cst_rsrc = lc_timer_register("beilpsched_cst_rsrc", "create resource constraints");
ir_timer_t *t_cst_rsrc = ir_timer_register("beilpsched_cst_rsrc", "create resource constraints");
ilp_timer_push(t_cst_rsrc);
for (glob_type_idx = env->cpu->n_unit_types - 1; glob_type_idx >= 0; --glob_type_idx) {
......@@ -1349,7 +1349,7 @@ static void create_bundle_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_ilp
unsigned num_cst_bundle = 0;
unsigned n_instr_max = env->cpu->bundle_size * env->cpu->bundels_per_cycle;
ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
lc_timer_t *t_cst_bundle = lc_timer_register("beilpsched_cst_bundle", "create bundle constraints");
ir_timer_t *t_cst_bundle = ir_timer_register("beilpsched_cst_bundle", "create bundle constraints");
ilp_timer_push(t_cst_bundle);
for (t = 0; t < ba->max_steps; ++t) {
......@@ -1405,7 +1405,7 @@ static void create_alive_nodes_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be
ir_node *irn;
unsigned num_cst = 0;
ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
lc_timer_t *t_cst = lc_timer_register("beilpsched_cst_alive_nodes", "create alive nodes constraints");
ir_timer_t *t_cst = ir_timer_register("beilpsched_cst_alive_nodes", "create alive nodes constraints");
ilp_timer_push(t_cst);
/* for each node */
......@@ -1487,7 +1487,7 @@ static void create_alive_livein_nodes_constraint(be_ilpsched_env_t *env, lpp_t *
ilp_livein_node_t *livein;
unsigned num_cst = 0;
ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
lc_timer_t *t_cst = lc_timer_register("beilpsched_cst_alive_livein_nodes", "create alive livein nodes constraints");
ir_timer_t *t_cst = ir_timer_register("beilpsched_cst_alive_livein_nodes", "create alive livein nodes constraints");
ilp_timer_push(t_cst);
/* for each node */
......@@ -1566,7 +1566,7 @@ static void create_pressure_alive_constraint(be_ilpsched_env_t *env, lpp_t *lpp,
ir_node *cur_irn;
unsigned num_cst = 0;
ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
lc_timer_t *t_cst = lc_timer_register("beilpsched_cst_pressure", "create pressure constraints");
ir_timer_t *t_cst = ir_timer_register("beilpsched_cst_pressure", "create pressure constraints");
ilp_timer_push(t_cst);
/* y_{nt}^k is set for each node and timestep and unit type */
......@@ -1669,7 +1669,7 @@ static void create_branch_constraint(be_ilpsched_env_t *env, lpp_t *lpp, be_ilps
unsigned num_cst = 0;
unsigned num_non_branches = 0;
ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
lc_timer_t *t_cst = lc_timer_register("beilpsched_cst_branch", "create branch constraints");
ir_timer_t *t_cst = ir_timer_register("beilpsched_cst_branch", "create branch constraints");
ilp_timer_push(t_cst);
cfop = NULL;
......@@ -1761,7 +1761,7 @@ static void create_proj_keep_constraints(be_ilpsched_env_t *env, lpp_t *lpp, be_
ir_node *irn;
unsigned num_cst = 0;
ilpsched_block_attr_t *ba = get_ilpsched_block_attr(block_node);
lc_timer_t *t_cst = lc_timer_register("beilpsched_cst_projkeep", "create proj and keep constraints");
ir_timer_t *t_cst = ir_timer_register("beilpsched_cst_projkeep", "create proj and keep constraints");
ilp_timer_push(t_cst);
/* check all nodes */
......
......@@ -33,7 +33,6 @@
#include <libcore/lc_opts.h>
#include <libcore/lc_opts_enum.h>
#include <libcore/lc_timing.h>
#include "obst.h"
#include "bitset.h"
......@@ -335,28 +334,28 @@ static void initialize_birg(be_irg_t *birg, ir_graph *irg, be_main_env_t *env)
#define BE_TIMER_ONLY(code) do { if (be_timing) { code; } } while(0)
int be_timing;
lc_timer_t *t_abi;
lc_timer_t *t_codegen;
lc_timer_t *t_sched;
lc_timer_t *t_constr;
lc_timer_t *t_finish;
lc_timer_t *t_emit;
lc_timer_t *t_other;
lc_timer_t *t_verify;
lc_timer_t *t_heights;
lc_timer_t *t_live;
lc_timer_t *t_execfreq;
lc_timer_t *t_ssa_constr;
lc_timer_t *t_ra_constr;
lc_timer_t *t_ra_prolog;
lc_timer_t *t_ra_epilog;
lc_timer_t *t_ra_spill;
lc_timer_t *t_ra_spill_apply;
lc_timer_t *t_ra_color;
lc_timer_t *t_ra_ifg;
lc_timer_t *t_ra_copymin;
lc_timer_t *t_ra_ssa;
lc_timer_t *t_ra_other;
ir_timer_t *t_abi;
ir_timer_t *t_codegen;
ir_timer_t *t_sched;
ir_timer_t *t_constr;
ir_timer_t *t_finish;
ir_timer_t *t_emit;
ir_timer_t *t_other;
ir_timer_t *t_verify;
ir_timer_t *t_heights;
ir_timer_t *t_live;
ir_timer_t *t_execfreq;
ir_timer_t *t_ssa_constr;
ir_timer_t *t_ra_constr;
ir_timer_t *t_ra_prolog;
ir_timer_t *t_ra_epilog;
ir_timer_t *t_ra_spill;
ir_timer_t *t_ra_spill_apply;
ir_timer_t *t_ra_color;
ir_timer_t *t_ra_ifg;
ir_timer_t *t_ra_copymin;
ir_timer_t *t_ra_ssa;
ir_timer_t *t_ra_other;
/**
* The Firm backend main loop.
......@@ -380,29 +379,29 @@ static void be_main_loop(FILE *file_handle, const char *cup_name)
be_timing = (be_options.timing == BE_TIME_ON);
if (be_timing) {
t_abi = lc_timer_register("time_beabi", "be abi introduction");
t_codegen = lc_timer_register("time_codegen", "codegeneration");
t_sched = lc_timer_register("time_sched", "scheduling");
t_constr = lc_timer_register("time_constr", "assure constraints");
t_finish = lc_timer_register("time_finish", "graph finish");
t_emit = lc_timer_register("time_emiter", "code emiter");
t_verify = lc_timer_register("time_verify", "graph verification");
t_other = lc_timer_register("time_other", "other");
t_heights = lc_timer_register("time_heights", "heights");
t_live = lc_timer_register("time_liveness", "be liveness");
t_execfreq = lc_timer_register("time_execfreq", "execfreq");
t_ssa_constr = lc_timer_register("time_ssa_constr", "ssa reconstruction");
t_ra_prolog = lc_timer_register("time_ra_prolog", "regalloc prolog");
t_ra_epilog = lc_timer_register("time_ra_epilog", "regalloc epilog");
t_ra_constr = lc_timer_register("time_ra_constr", "regalloc constraints");
t_ra_spill = lc_timer_register("time_ra_spill", "spiller");
t_abi = ir_timer_register("time_beabi", "be abi introduction");
t_codegen = ir_timer_register("time_codegen", "codegeneration");
t_sched = ir_timer_register("time_sched", "scheduling");
t_constr = ir_timer_register("time_constr", "assure constraints");
t_finish = ir_timer_register("time_finish", "graph finish");
t_emit = ir_timer_register("time_emiter", "code emiter");
t_verify = ir_timer_register("time_verify", "graph verification");
t_other = ir_timer_register("time_other", "other");
t_heights = ir_timer_register("time_heights", "heights");
t_live = ir_timer_register("time_liveness", "be liveness");
t_execfreq = ir_timer_register("time_execfreq", "execfreq");
t_ssa_constr = ir_timer_register("time_ssa_constr", "ssa reconstruction");
t_ra_prolog = ir_timer_register("time_ra_prolog", "regalloc prolog"