4
};
+#ifdef DUMP_INTERVALS
static void draw_interval_graphs(ir_node *block,
struct list_head *border_head,
const be_chordal_dump_params_t *params)
fclose(f);
}
}
+#endif
#if 0
typedef struct _tree_layout_info_t {
n_edges++;
}
- fprintf(f, "\tx [label=\"nodes: %d, edges: %d\"]\n", bitset_popcnt(bs), n_edges);
+ fprintf(f, "\tx [label=\"nodes: %lu, edges: %d\"]\n", bitset_popcnt(bs), n_edges);
bitset_foreach(bs, pos) {
int nr = (int) pos;
/* Mark the obstack level and allocate the temporary tmp_colors */
void *obstack_level = obstack_base(obst);
- bitset_t *tmp_colors = bitset_obstack_alloc(obst, env->colors_n);
+ /*bitset_t *tmp_colors = bitset_obstack_alloc(obst, env->colors_n);*/
const ir_node *irn;
border_t *b;