X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=6c371ea48697ec7b3db6cd8facbb56a94ac5064d;hb=a3ff5d70ee39a6308a81fb4d7f53258d11f93013;hp=a5b331bf49b9c845dc5df7fc6dec9634e2dd4c4b;hpb=04a44481131aeef9e6c67b26a9e76557e6873082;p=libfirm

diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h
index a5b331bf4..6c371ea48 100644
--- a/ir/be/becopyopt.h
+++ b/ir/be/becopyopt.h
@@ -55,20 +55,36 @@ enum {
 	CO_ALGO_NONE,
 	CO_ALGO_HEUR,
 	CO_ALGO_HEUR2,
-	CO_ALGO_HEUR3,
 	CO_ALGO_HEUR4,
 	CO_ALGO_ILP,
+#ifdef FIRM_KAPS
 	CO_ALGO_PBQP,
+#endif
 	CO_ALGO_LAST
 };
 
-/** The driver for copy minimization. */
-void co_driver(be_chordal_env_t *cenv);
-
 typedef struct _copy_opt_t copy_opt_t;
 
 typedef int(*cost_fct_t)(const copy_opt_t *, ir_node *, ir_node *, int);
 
+typedef struct {
+	int (*copyopt)(copy_opt_t *co); /**< function ptr to run copyopt */
+	int        can_improve_existing;
+} co_algo_info;
+
+
+/**
+ * Register a new copy optimization algorithm.
+ *
+ * @param name     the name of the copy optimazation algorithm,
+ *                 used to select it
+ * @param copyopt  a copy optimazation entry
+ */
+void be_register_copyopt(const char *name, co_algo_info *copyopt);
+
+/** The driver for copy minimization. */
+void co_driver(be_chordal_env_t *cenv);
+
 /** A coalescing algorithm. */
 typedef int (co_algo_t)(copy_opt_t *);
 
@@ -156,18 +172,6 @@ void co_solve_park_moon(copy_opt_t *co);
  */
 int co_solve_heuristic_new(copy_opt_t *co);
 
-/**
- * Solves the copy minimization problem using another heuristic approach implemented in Java.
- * This function needs a JVM which is started to call the Java module.
- * Uses the GRAPH data structure.
- */
-int co_solve_heuristic_java(copy_opt_t *co);
-
-/**
- * This is the pure C implementation of co_solve_heuristic_java().
- */
-int co_solve_heuristic_mst(copy_opt_t *co);
-
 /**
  * Returns the maximal costs possible, i.e. the costs if all
  * pairs would be assigned different registers.
@@ -247,8 +251,6 @@ int co_solve_ilp1(copy_opt_t *co, double time_limit);
  */
 int co_solve_ilp2(copy_opt_t *co);
 
-int co_solve_heuristic_pbqp(copy_opt_t *co);
-
 /**
  * Checks if a node is optimizable, viz has something to do with coalescing.
  * Uses the GRAPH data structure