+/**
+ * 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 *);
+
+/**
+ * Generate the problem. Collect all information and optimizable nodes.
+ */
+copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs);
+
+/**
+ * Free the space used...
+ */
+void free_copy_opt(copy_opt_t *co);
+
+/**
+ * Computes the costs of a copy according to loop depth
+ * @param co The copy opt object.
+ * @param pos the argument position of arg in the root arguments
+ * @return Must be >= 0 in all cases.
+ */
+int co_get_costs_loop_depth(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);