X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopystat.c;h=a095a200b27db1b43c92660e238ef219dd840a95;hb=dd4cd761ab637d4488c7e29f49843b1b02366acf;hp=4790b57d595f29de795038aa8f8b48124ca3a73b;hpb=8eee0e6361868153ae82c8d8bdda1446a9af9084;p=libfirm

diff --git a/ir/be/becopystat.c b/ir/be/becopystat.c
index 4790b57d5..a095a200b 100644
--- a/ir/be/becopystat.c
+++ b/ir/be/becopystat.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -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"
@@ -188,10 +188,12 @@ static INLINE int was_edge_critical(const ir_node *bl, int pos) {
 /**
  * Collect phi node data
  */
-static void stat_phi_node(be_chordal_env_t *chordal_env, ir_node *phi) {
+static void stat_phi_node(be_chordal_env_t *chordal_env, ir_node *phi)
+{
  	int arity, i;
  	ir_node *phi_bl;
 	assert(is_Phi(phi));
+	(void) chordal_env;
 
 	/* count all phi phis */
 	curr_vals[I_PHI_CNT]++;
@@ -476,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;
 
@@ -507,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);