#include "bechordal_t.h"
#include "bearch.h"
-/* TODO is_Copy */
-#define is_Copy(irn) 0
-#define DEBUG_IRG "-scanner.c__init_td__gp"
+#define DEBUG_IRG "NONE spec.c__main__datab"
+#define DEBUG_LVL_CO LEVEL_1
+#define DEBUG_LVL_HEUR LEVEL_1
+#define DEBUG_LVL_ILP LEVEL_1
/**
* Data representing the problem of copy minimization.
*/
void free_copy_opt(copy_opt_t *co);
-#define is_optimizable(irn) (is_Phi(irn) || is_Copy(irn))
+
+#define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm)
+
+/**
+ * A copy is a proj haning out of perm node
+ */
+#define is_Copy(arch_env, irn) (is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn)))
+
+/**
+ * returns the corresponding argument of the perm node for a copy
+ */
+#define get_Copy_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
+
+/**
+ * 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))
/**
* Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
*/
int is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
+
/**
* Returns the current number of copies needed
*/
int co_get_copy_count(const copy_opt_t *co);
/**
- * IMPORTANT: Available only iff heuristic has run!
* Returns a lower bound for the number of copies needed based on interfering
* arguments and the size of a max indep. set (only ifg-edges) of the other args.
*/