X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=38a0298d5dc46a5706e80e7e93fa577a53e5a7df;hb=1670ff3bb630369f79c4f2a1846ebcf32fe19133;hp=632c6b27aa1b953abc82f05b3abd092d6da91ce4;hpb=165e48ff9dc8753e95565ddf6c58b3f128490406;p=libfirm

diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h
index 632c6b27a..38a0298d5 100644
--- a/ir/be/becopyopt.h
+++ b/ir/be/becopyopt.h
@@ -16,7 +16,6 @@
 #include "set.h"
 #include "pset.h"
 #include "bitset.h"
-#include "sp_matrix.h"
 
 #include "irgraph.h"
 #include "irgwalk.h"
@@ -30,21 +29,18 @@
 #include "bechordal_t.h"
 #include "bearch.h"
 
-/* TODO is_Copy */
-#define is_Copy(irn) 0
-#define DEBUG_IRG "-scanner.c__init_td__gp"
+#define MIS_HEUR_TRIGGER 8
+
+typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
 
 /**
  * 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 */
+	be_chordal_env_t *chordal_env;
+	char *name;						/**< ProgName__IrgName__RegClass */
+	struct list_head units;			/**< all units to optimize in specific order */
+	cost_fct_t get_costs;			/**< function ptr used to get costs for copies */
 	struct obstack ob;
 } copy_opt_t;
 
@@ -54,35 +50,53 @@ typedef struct _copy_opt_t {
 typedef struct _unit_t {
 	struct list_head units;		/**< chain for all units */
 	copy_opt_t *co;				/**< the copy_opt this unit belongs to */
-	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 *costs;					/**< costs[i] are arising, if nodes[i] has a different color */
+	int inevitable_costs;		/**< sum of costs of all args interfering with root */
+	int all_nodes_costs;		/**< sum of all costs[i] */
+	int min_nodes_costs;		/**< a lower bound for the costs in costs[], determined by a max indep. set */
+	int sort_key;				/**< maximum costs. controls the order of ou's in the struct list_head units. */
 
 	/* 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 */
+	struct list_head queue;		/**< list of qn's sorted by weight of qn-mis */
 } unit_t;
 
 /* Helpers */
+#define get_arch_env(co) ((co)->chordal_env->main_env->arch_env)
+#define get_irg(co)      ((co)->chordal_env->irg)
+#define get_irn_col(co, irn) \
+	arch_register_get_index(arch_get_irn_register(get_arch_env(co), irn))
 #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(get_arch_env(co), irn, 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))
+
+#define list_entry_units(lh) list_entry(lh, unit_t, units)
+
+#define get_Copy_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
+#define is_Perm(arch_env, irn)				(arch_irn_classify(arch_env, irn) == arch_irn_class_perm)
+#define is_Reg_Phi(irn)						(is_Phi(irn) && mode_is_data(get_irn_mode(irn)))
+#define is_Perm_Proj(arch_env, irn)			(is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn)))
+#define is_2addr_code(arch_env, irn, req)	(arch_get_register_req(arch_env, req, irn, -1)->type == arch_register_req_type_should_be_same)
 
 
 /**
  * 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, int (*get_costs)(ir_node*, ir_node*, int));
 
 /**
  * Free the space...
  */
 void free_copy_opt(copy_opt_t *co);
 
-#define is_optimizable(irn) (is_Phi(irn) || is_Copy(irn))
+/**
+ * Checks if a node is optimizable, viz. has somthing to do with coalescing
+ * @param arch The architecture environment
+ * @param irn  The irn to check
+ * @param req  A register_requirement structure (used to check for 2-addr-code)
+ */
+#define is_optimizable(arch, irn, req) (is_Reg_Phi(irn) || is_Perm_Proj(arch, irn) || is_2addr_code(arch, irn, req))
 
 /**
  * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
@@ -90,36 +104,53 @@ void free_copy_opt(copy_opt_t *co);
 int is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
 
 /**
- * Returns the current number of copies needed
+ * Computes the costs of a copy according to loop depth
+ * @param pos:	the argument position of arg in the root arguments
+ * @return Must be >= 0 in all cases.
  */
-int co_get_copy_count(const copy_opt_t *co);
+int get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
 
 /**
- * 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.
+ * All costs equal 1. Using this will reduce the number of copies.
+ * @return Must be >= 0 in all cases.
  */
-int co_get_lower_bound(const copy_opt_t *co);
+int get_costs_all_one(ir_node *root, ir_node* arg, int pos);
 
 /**
- * Returns the number of arguments interfering with their root node. This also
- * is a (worse) lower bound for the number of copies needed.
+ * Returns the maximal costs possible, i.e. the costs if all
+ * pairs would be assigned different registers.
  */
-int co_get_interferer_count(const copy_opt_t *co);
+int co_get_max_copy_costs(const copy_opt_t *co);
 
 /**
- * Solves the problem using a heuristic approach
+ * Returns the inevitable costs, i.e. the costs of
+ * all copy pairs which interfere.
  */
-void co_heur_opt(copy_opt_t *co);
+int co_get_inevit_copy_costs(const copy_opt_t *co);
 
 /**
- * Solves the problem using mixed integer programming
+ * Returns the current costs the copies are causing.
+ * The result includes inevitable costs and the costs
+ * of the copies regarding the current register allocation
  */
-void co_ilp_opt(copy_opt_t *co);
+int co_get_copy_costs(const copy_opt_t *co);
 
 /**
- * Checks the register allocation for correctness
+ * Returns a lower bound for the costs of copies in this ou.
+ * The result includes inevitable costs and the costs of a
+ * minimal costs caused by the nodes of the ou.
+ */
+int co_get_lower_bound(const copy_opt_t *co);
+
+/**
+ * Solves the problem using a heuristic approach
+ */
+void co_heur_opt(copy_opt_t *co);
+
+/**
+ * Solves the problem using mixed integer programming
+ * @returns 1 iff solution state was optimal
  */
-void co_check_allocation(copy_opt_t *co);
+int co_ilp_opt(copy_opt_t *co, double time_limit);
 
 #endif