-/**
- * Author: Daniel Grund
- * Date: 28.02.2006
- * Copyright: (c) Universitaet Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
*
- * Common stuff used by all ILP fomulations.
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
*
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief Common stuff used by all ILP formulations.
+ * @author Daniel Grund
+ * @date 28.02.2006
+ * @version $Id$
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
LC_OPT_ENT_BOOL ("net", "solve over the net", &solve_net),
LC_OPT_ENT_BOOL ("log", "show ilp solving log", &solve_log),
LC_OPT_ENT_ENUM_MASK("dump", "dump flags", &dump_var),
- { NULL }
+ LC_OPT_LAST
};
void be_init_copyilp(void)
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; i<size; ++i)
req = arch_get_register_req(sr->co->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;
pset_insert_ptr(sr->all_removed, irn);
redo = 1;
- }
+ }
}
}
- be_ifg_nodes_break(ifg, iter);
}
}
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);