Before benchmarking

[libfirm] / ir / be / becopyopt.h

diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h
index 3b56cf4..07e52bb 100644 (file)
--- a/ir/be/becopyopt.h
+++ b/ir/be/becopyopt.h
@@ -29,7 +29,7 @@
 #include "bechordal_t.h"
 #include "bearch.h"
 
-#define DEBUG_IRG "MergeSort.c__merge__datab"
+#define DEBUG_IRG "!!deflate.c__longest_match__datab"
 #define DEBUG_IRG_LVL_CO   SET_LEVEL_1
 #define DEBUG_IRG_LVL_HEUR SET_LEVEL_1
 #define DEBUG_IRG_LVL_ILP  SET_LEVEL_1
@@ -107,7 +107,7 @@ void free_copy_opt(copy_opt_t *co);
 /**
  * Checks if a node is optimizable, viz. is a target of a 'copy-op'
  */
-#define is_optimizable(arch_env, irn) (is_Phi(irn) || is_Copy(arch_env, irn))
+#define is_optimizable(arch_env, irn) ((is_Phi(irn) && mode_is_datab(get_irn_mode(irn))) || is_Copy(arch_env, irn))
 
 /**
  * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
@@ -129,6 +129,18 @@ int get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
  */
 int get_costs_all_one(ir_node *root, ir_node* arg, int pos);
 
+/**
+ * Returns the maximal costs possible, i.e. the costs if all
+ * pairs would be assigned different registers.
+ */
+int co_get_max_copy_costs(const copy_opt_t *co);
+
+/**
+ * Returns the inevitable costs, i.e. the costs of
+ * all copy pairs which interfere.
+ */
+int co_get_inevit_copy_costs(const copy_opt_t *co);
+
 /**
  * Returns the current costs the copies are causing.
  * The result includes inevitable costs and the costs
@@ -151,6 +163,6 @@ void co_heur_opt(copy_opt_t *co);
 /**
  * Solves the problem using mixed integer programming
  */
-void co_ilp_opt(copy_opt_t *co);
+void co_ilp_opt(copy_opt_t *co, double time_limit);
 
 #endif