return 1;
}
-static int cmp_node_order(const void *a, const void *b)
-{
- return 0;
-}
-
/** compares two affinity edges by its weight */
static int cmp_aff_edge(const void *a, const void *b) {
const aff_edge_t *e1 = a;
of the current node, every thing was ok and we can return safely.
*/
if (neigh_ok) {
- co_mst_irn_t *n, *temp;
/* append the local_changed ones to global ones */
list_splice(&local_changed, changed_ones);
return 1;
waitq *best_starts = NULL;
bitset_t *visited;
int col, idx, len;
- co_mst_irn_t *n;
struct list_head changed_ones;
DB((dbg, LEVEL_2, "fragmentizing chunk #%d", c->id));
for (idx = 0, len = ARR_LEN(best_chunk->n); idx < len; ++idx) {
ir_node *irn = best_chunk->n[idx];
co_mst_irn_t *node = get_co_mst_irn(env, irn);
- co_mst_irn_t *n, *temp;
int res;
/* bring the node to the color. */