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

diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h
index d13c36770..c245e10b3 100644
--- a/ir/be/becopyopt.h
+++ b/ir/be/becopyopt.h
@@ -136,11 +136,12 @@ 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.
+ * 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);