From: Sebastian Hack Date: Wed, 7 Nov 2007 10:44:21 +0000 (+0000) Subject: Fixed a bug with ofg iteration. X-Git-Url: http://nsz.repo.hu/git/?a=commitdiff_plain;h=9f4b95b8b2c1055da6e8c8072c7da29ffcef5686;p=libfirm Fixed a bug with ofg iteration. The ..._break functions are no longer needed to close the iteration but were still present [r16480] --- diff --git a/ir/be/becopyilp.c b/ir/be/becopyilp.c index 1199df0b6..fe641ba46 100644 --- a/ir/be/becopyilp.c +++ b/ir/be/becopyilp.c @@ -120,7 +120,6 @@ static INLINE int sr_is_simplicial(size_red_t *sr, const ir_node *ifn) { be_ifg_foreach_neighbour(ifg, iter, ifn, curr) if (!sr_is_removed(sr, curr)) all[size++] = curr; - be_ifg_neighbours_break(ifg, iter); /* check if these form a clique */ for (i=0; ico->aenv, irn, -1); if (!arch_register_req_is(req, limited) && !sr_is_removed(sr, irn) && !co_gs_is_optimizable(sr->co, irn)) { - if (sr_is_simplicial(sr, irn)) { + if (sr_is_simplicial(sr, irn)) { coloring_suffix_t *cs = obstack_alloc(&sr->ob, sizeof(*cs)); cs->irn = irn; @@ -156,10 +155,9 @@ void sr_remove(size_red_t *sr) { pset_insert_ptr(sr->all_removed, irn); redo = 1; - } + } } } - be_ifg_nodes_break(ifg, iter); } } @@ -182,7 +180,6 @@ void sr_reinsert(size_red_t *sr) { if (!sr_is_removed(sr, other)) /* only inspect nodes which are in graph right now */ bitset_set(used_cols, get_irn_col(sr->co, other)); } - be_ifg_neighbours_break(ifg, iter); /* now all bits not set are possible colors */ free_col = bitset_next_clear(used_cols, 0);