/**
- * @author Daniel Grund
- * @date 11.04.2005
+ * Author: Daniel Grund
+ * Date: 11.04.2005
+ * Copyright: (c) Universitaet Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
-#define DO_STAT
-
-#ifdef DO_STAT
-
#ifndef _BECOPYSTAT_H
#define _BECOPYSTAT_H
-#include "irgraph.h"
-
-#define MAX_ARITY 10
-#define MAX_CLS_SIZE 10
-#define MAX_PHASE 2
-/**
- * For an explanation of these values see phi_stat_dump_pretty
- */
-enum vals_t {
- I_ALL_NODES = 0,
- I_BLOCKS,
-
- I_PHI_CNT, /* number of phi nodes */
- I_PHI_ARG_CNT, /* number of arguments of phis */
- I_PHI_ARG_SELF, /* number of arguments of phis being the phi itself */
- I_PHI_ARG_CONST, /* number of arguments of phis being consts */
- I_PHI_ARG_PRED, /* ... being defined in a cf-pred */
- I_PHI_ARG_GLOB, /* ... being defined elsewhere */
- I_PHI_ARITY_S,
- I_PHI_ARITY_E = I_PHI_ARITY_S+MAX_ARITY,
-
- I_CLS_CNT, /* number of phi classes */
- I_CLS_IF_FREE, /* number of pc having no interference */
- I_CLS_IF_MAX, /* number of possible interferences in all classes */
- I_CLS_IF_CNT, /* number of actual interferences in all classes */
- I_CLS_SIZE_S,
- I_CLS_SIZE_E = I_CLS_SIZE_S+MAX_CLS_SIZE,
-
- I_COPIES_MAX, /* max number of copies possible */
- I_COPIES_INIT, /* !external set! number of copies in initial allocation */
- I_COPIES_HEUR, /* !external set! number of copies after heuristic */
- I_COPIES_OPT, /* !external set! number of copies after ilp */
- I_COPIES_LB, /* !external set! the lower bound used for number of copies */
- I_COPIES_IF, /* number of copies inevitable due to root-arg-interf */
+#undef COPYOPT_STAT
- ASIZE
-};
+#ifdef COPYOPT_STAT
-/**
- * Holds current values. Values are added till next phi_stat_reset
- */
-int curr_vals[ASIZE];
+#include "irgraph.h"
+#include "bearch.h"
+#include "bechordal_t.h"
-void stat_init(void);
+void copystat_init(void);
+void copystat_reset(void);
+void copystat_collect_cls(be_chordal_env_t *chordal_env);
+void copystat_add_max_costs(int costs);
+void copystat_add_inevit_costs(int costs);
+void copystat_add_init_costs(int costs);
+void copystat_add_heur_costs(int costs);
+void copystat_add_ilp_5_sec_costs(int costs);
+void copystat_add_ilp_30_sec_costs(int costs);
+void copystat_add_opt_costs(int costs);
+void copystat_add_heur_time(int time);
+void copystat_add_ilp_time(int time);
+void copystat_add_ilp_vars(int vars);
+void copystat_add_ilp_csts(int csts);
+void copystat_add_ilp_iter(int iters);
+void copystat_dump(ir_graph *irg);
+void copystat_dump_pretty(ir_graph *irg);
/**
- * Resets the array holding the data
+ * Compares different solutions of the same problem
*/
-void stat_reset(void);
+void co_compare_solvers(be_chordal_env_t *chordal_env);
-/**
- * Collect common irg data
- */
-void stat_collect_irg(ir_graph *irg);
+#else /* COPYOPT_STAT */
-/**
- * Dumps the current contents of the internal values to a file.
- */
-void stat_dump(ir_graph *irg);
+#define copystat_init();
+#define copystat_reset();
+#define copystat_collect_cls(env);
+#define copystat_add_max_costs(costs);
+#define copystat_add_inevit_costs(costs);
+#define copystat_add_init_costs(costs);
+#define copystat_add_heur_costs(costs);
+#define copystat_add_ilp_5_sec_costs(costs);
+#define copystat_add_ilp_30_sec_costs(costs);
+#define copystat_add_opt_costs(costs);
+#define copystat_add_heur_time(time);
+#define copystat_add_ilp_time(time);
+#define copystat_add_ilp_vars(vars);
+#define copystat_add_ilp_csts(csts);
+#define copystat_add_ilp_iter(iters);
+#define copystat_dump(irg);
+#define copystat_dump(irg);
+#define copystat_dump_pretty(irg);
-/**
- * Dumps the current contents of the values array and annotations to a file.
- */
-void stat_dump_pretty(ir_graph *irg);
+#endif /* COPYOPT_STAT */
-#endif
-#endif
+#endif /* _BECOPYSTAT_H */