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

diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h
index 93dc76252..c245e10b3 100644
--- a/ir/be/becopyopt.h
+++ b/ir/be/becopyopt.h
@@ -13,7 +13,7 @@
 #ifndef _BECOPYOPT_H
 #define _BECOPYOPT_H
 
-#include "irnode.h"
+#include "firm_types.h"
 #include "bechordal.h"
 
 /**
@@ -36,10 +36,9 @@ copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs);
 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);
 
@@ -77,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);
 
@@ -96,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);
 
@@ -103,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);
 
@@ -124,19 +128,22 @@ 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);
 
-#endif
+#endif /* _BECOPYOPT_H */