X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=c245e10b3f7787f58972fae108fce8be4d48ff1c;hb=1161999117f5c0f56b3af2dc9bb7150e03761905;hp=988df82da3c8b07598e581ad2bbf16af063b1a30;hpb=8e151352b37def96022ce4ef94071d3328efb026;p=libfirm

diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h
index 988df82da..c245e10b3 100644
--- a/ir/be/becopyopt.h
+++ b/ir/be/becopyopt.h
@@ -76,18 +76,21 @@ void co_free_ou_structure(copy_opt_t *co);
 
 /**
  * Solves the problem using a heuristic approach
+ * Uses the OU data structure
  */
 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.
+ * 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);
 
@@ -95,6 +98,7 @@ 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);
 
@@ -102,6 +106,7 @@ 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);
 
@@ -123,18 +128,21 @@ void co_free_graph_structure(copy_opt_t *co);
 /**
  * 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);