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 *);
*/
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.
*/
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