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);
*/
int co_solve_ilp2(copy_opt_t *co, double time_limit);
-/**
- * Compares different solutions of the same problem
- */
-void co_compare_solvers(be_chordal_env_t *chordal_env);
-
#endif