projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
- finally understand HOW n-input nodes made the Follower -> Leader transition
[libfirm]
/
ir
/
be
/
becopystat.c
diff --git
a/ir/be/becopystat.c
b/ir/be/becopystat.c
index
8ea2fbc
..
a095a20
100644
(file)
--- a/
ir/be/becopystat.c
+++ b/
ir/be/becopystat.c
@@
-29,8
+29,8
@@
#endif
#include <string.h>
#endif
#include <string.h>
-#include <libcore/lc_timing.h>
+#include "timing.h"
#include "xmalloc.h"
#include "irgraph.h"
#include "irgwalk.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;
*/
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;
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) */
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);
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));
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) */
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);
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));
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) */
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);
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));
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);
copystat_add_heur_costs(costs_solved);
assert(lower_bound <= costs_solved);