#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
#define DEBUG_LVL_HEUR SET_LEVEL_0
#define DEBUG_LVL_ILP SET_LEVEL_0
+#define MIS_HEUR_TRIGGER 8
+
+
typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
/**
/**
* Checks if a node is optimizable, viz. is a target of a 'copy-op'
*/
-#define is_optimizable(arch_env, irn) ((is_Phi(irn) && mode_is_datab(get_irn_mode(irn))) || is_Copy(arch_env, irn))
+#define is_optimizable(arch_env, irn) ((is_Phi(irn) && is_firm_be_mode(get_irn_mode(irn))) || is_Copy(arch_env, irn))
/**
* Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
/**
* Solves the problem using mixed integer programming
+ * @returns 1 iff solution state was optimal
*/
-void co_ilp_opt(copy_opt_t *co);
+int co_ilp_opt(copy_opt_t *co, double time_limit);
#endif