X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyheur.c;h=627810f014ceca39e03b7bde6cc8762c11feccb7;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=165db4ae62e71fd34e14401b7abd777d7623c628;hpb=41dc42afc8d00e0f364711ed0c919e4e29cb20e4;p=libfirm

diff --git a/ir/be/becopyheur.c b/ir/be/becopyheur.c
index 165db4ae6..627810f01 100644
--- a/ir/be/becopyheur.c
+++ b/ir/be/becopyheur.c
@@ -22,7 +22,6 @@
  * @brief       First simple copy minimization heuristics.
  * @author      Daniel Grund
  * @date        12.04.2005
- * @version     $Id$
  *
  * Heuristic for minimizing copies using a queue which holds 'qnodes' not yet
  * examined. A qnode has a 'target color', nodes out of the opt unit and
@@ -627,7 +626,7 @@ static void ou_optimize(unit_t *ou)
 			/* NO_COLOR is possible, if we had an undo */
 			if (ns->new_color != NO_COLOR) {
 				DBG((dbg, LEVEL_1, "\t    color(%+F) := %d\n", ns->irn, ns->new_color));
-				set_irn_col(ou->co, ns->irn, ns->new_color);
+				set_irn_col(ou->co->cls, ns->irn, ns->new_color);
 			}
 		}
 	}