#include "irnode.h"
#include "bechordal.h"
-
-typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
-
-typedef struct _copy_opt_t copy_opt_t;
-
/**
* Has to be called during the firm init phase
*/
void be_copy_opt_init(void);
+typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
+
+typedef struct _copy_opt_t copy_opt_t;
+
/**
* Generate the problem. Collect all information and optimizable nodes.
*/
*/
void free_copy_opt(copy_opt_t *co);
+/**
+ * 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)
+ */
+int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn);
+
+/**
+ * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
+ */
+int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
+
/**
* Computes the costs of a copy according to loop depth
* @param pos: the argument position of arg in the root arguments
int co_get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
/**
- * All costs equal 1. Using this will reduce the number of copies.
+ * All costs equal 1. Using this will reduce the _number_ of copies.
* @return Must be >= 0 in all cases.
*/
int co_get_costs_all_one(ir_node *root, ir_node* arg, int pos);
+
+
+
+/**
+ * Build internal optimization units structure
+ */
+void co_build_ou_structure(copy_opt_t *co);
+
+/**
+ * Frees the space used by the opt unit representation.
+ * Does NOT free the whole copyopt structure
+ */
+void co_free_ou_structure(copy_opt_t *co);
+
/**
* Solves the problem using a heuristic approach
*/
int co_solve_heuristic(copy_opt_t *co);
+/**
+ * Returns the maximal costs possible, i.e. the costs if all
+ * pairs would be assigned different registers.
+ */
+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.
+ */
+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
+ */
+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.
+ */
+int co_get_lower_bound(const copy_opt_t *co);
+
+
+
+
+
+/**
+ * Constructs another internal representation of the affinity edges
+ */
+void co_build_graph_structure(copy_opt_t *co);
+
+/**
+ * Frees the space used by the graph representation.
+ * Does NOT free the whole copyopt structure
+ */
+void co_free_graph_structure(copy_opt_t *co);
+
/**
* Solves the problem using mixed integer programming
* @returns 1 iff solution state was optimal
int co_solve_ilp2(copy_opt_t *co, double time_limit);
/**
- * Compares different solutions of the same problem
+ * Checks if a node is optimizable, viz. has somthing to do with coalescing.
+ * Uses the graph representation
*/
-void co_compare_solvers(be_chordal_env_t *chordal_env);
+int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);
#endif