#ifndef _BECOPYOPT_H
#define _BECOPYOPT_H
-#include "irnode.h"
+#include <stdio.h>
+
+#include "firm_types.h"
#include "bechordal.h"
/**
void free_copy_opt(copy_opt_t *co);
/**
- * Checks if a node is optimizable, viz. has somthing to do with coalescing
+ * Checks if a node is optimizable, viz. has something 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)
*/
int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn);
/**
* Solves the problem using a heuristic approach
+ * Uses the OU data structure
*/
int co_solve_heuristic(copy_opt_t *co);
+void co_solve_heuristic_new(copy_opt_t *co);
+
+
+/**
+ * Solves the copy minimization problem using another heuristic approach.
+ * Uses the OU and the GRAPH data structure.
+ */
+void co_solve_heuristic_new(copy_opt_t *co);
+
/**
* Returns the maximal costs possible, i.e. the costs if all
* pairs would be assigned different registers.
+ * Uses the OU data structure
*/
int co_get_max_copy_costs(const copy_opt_t *co);
/**
* Returns the inevitable costs, i.e. the costs of
* all copy pairs which interfere.
+ * Uses the OU data structure
*/
int co_get_inevit_copy_costs(const copy_opt_t *co);
* Returns the current costs the copies are causing.
* The result includes inevitable costs and the costs
* of the copies regarding the current register allocation
+ * Uses the OU data structure
*/
int co_get_copy_costs(const copy_opt_t *co);
* 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.
+ * Uses the OU data structure
*/
int co_get_lower_bound(const copy_opt_t *co);
-
+/**
+ * Dump the interference graph according to the Appel/George coalescing contest file format.
+ * See: http://www.cs.princeton.edu/~appel/coalesce/format.html
+ * @note Requires graph structure.
+ * @param co The copy opt object.
+ * @param f A file to dump to.
+ */
+void co_dump_appel_graph(const copy_opt_t *co, FILE *f);
/**
* Solves the problem using mixed integer programming
* @returns 1 iff solution state was optimal
+ * NYI
*/
int co_solve_ilp1(copy_opt_t *co, double time_limit);
/**
* Solves the problem using mixed integer programming
* @returns 1 iff solution state was optimal
+ * Uses the OU and the GRAPH data structure
+ * Dependency of the OU structure can be removed
*/
int co_solve_ilp2(copy_opt_t *co, double time_limit);
/**
- * Checks if a node is optimizable, viz. has somthing to do with coalescing.
- * Uses the graph representation
+ * Checks if a node is optimizable, viz has something to do with coalescing.
+ * Uses the GRAPH data structure
*/
int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);
-#endif
+#endif /* _BECOPYOPT_H */