}
}
+
+/**
+ * TODO: Remove the dependency of the opt-units data structure
+ * by walking over all affinity edges. Graph structure
+ * does not provide this walker, yet.
+ */
static void build_affinity_cstr(ilp_env_t *ienv) {
unit_t *curr;
int n_colors = arch_register_class_n_regs(ienv->co->cls);
* At most 1 node of the clique can be colored equally with the external node.
*/
static void build_clique_star_cstr(ilp_env_t *ienv) {
- affinity_t *aff;
+ affinity_node_t *aff;
/* for each node with affinity edges */
co_gs_foreach_aff_node(ienv->co, aff) {
be_ifg_t *ifg = ienv->co->cenv->ifg;
int i, len;
ir_node **curr_path;
- affinity_t *aff;
+ affinity_node_t *aff;
neighb_t *nbr;
/* do not walk backwards or in circles */
/* check for forbidden interferences */
len = pdeq_len(path);
curr_path = alloca(len * sizeof(*curr_path));
- pdeq_copyl(path, curr_path);
+ pdeq_copyl(path, (const void **)curr_path);
for (i=1; i<len; ++i)
if (be_ifg_connected(ifg, irn, curr_path[i]))
* Then at least one of these affinity edges must break.
*/
static void build_path_cstr(ilp_env_t *ienv) {
- affinity_t *aff_info;
+ affinity_node_t *aff_info;
/* for each node with affinity edges */
co_gs_foreach_aff_node(ienv->co, aff_info) {
ilp_env_t *ienv;
local_env_t my;
+ ASSERT_OU_AVAIL(co); //See build_clique_st
+ ASSERT_GS_AVAIL(co);
+
my.time_limit = time_limit;
my.first_x_var = -1;
my.last_x_var = -1;
my.nr_2_irn = pmap_create();
- my.dbg = firm_dbg_register("ir.be.coilp2");
+ FIRM_DBG_REGISTER(my.dbg, "ir.be.coilp2");
firm_dbg_set_mask(my.dbg, DEBUG_LVL);
ienv = new_ilp_env(co, ilp2_build, ilp2_apply, &my);