Fixed small copy & paste error in the "foreach" defines and added additional defines...

[libfirm] / ir / be / becopyopt.h

diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h
index 65ae75a..e60d4b4 100644 (file)
--- a/ir/be/becopyopt.h
+++ b/ir/be/becopyopt.h
@@ -30,19 +30,17 @@
 #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.
  */
 typedef struct _copy_opt_t {
        be_chordal_env_t *chordal_env;
-       ir_graph *irg;                                          /**< the irg to process */
        char *name;                                                     /**< ProgName__IrgName__RegClass */
-       const arch_env_t *env;                          /**< Environment (isa + handlers) */
-       const arch_register_class_t *cls;       /**< the registerclass all nodes belong to (in this pass) */
        struct list_head units;                         /**< all units to optimize in right order */
        pset *roots;                                            /**< used only temporary for detecting multiple appends */
        struct obstack ob;
@@ -57,45 +55,60 @@ typedef struct _unit_t {
        int interf;                                     /**< number of nodes dropped due to interference */
        int node_count;                         /**< size of the nodes array */
        ir_node **nodes;                        /**< [0] is the root-node, others are non interfering args of it. */
+       int ifg_mis_size;                       /**< size of a mis considering only ifg (not coloring conflicts) */
 
        /* for heuristic */
-       int mis_size;                           /**< size of a mis considering only ifg (not coloring conflicts) */
        struct list_head queue;         /**< list of (mis/color) sorted by size of mis */
 } unit_t;
 
 /* Helpers */
 #define set_irn_col(co, irn, col) \
-       arch_set_irn_register(co->env, irn, 0, arch_register_for_index(co->cls, col))
+       arch_set_irn_register(co->chordal_env->arch_env, irn, 0, arch_register_for_index(co->chordal_env->cls, col))
 
 #define get_irn_col(co, irn) \
-       arch_register_get_index(arch_get_irn_register(co->env, irn, 0))
+       arch_register_get_index(arch_get_irn_register(co->chordal_env->arch_env, irn, 0))
 
 
 /**
  * Generate the problem. Collect all infos and optimizable nodes.
  */
-copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env,
-    const arch_env_t *env, const arch_register_class_t *cls);
+copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env);
 
 /**
  * Free the space...
  */
 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.
  */