Lines Matching defs:n1
477 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
479 BITSET_SET(g->nodes[n1].adjacency, n2);
481 assert(n1 != n2);
483 int n1_class = g->nodes[n1].class;
485 g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class];
487 util_dynarray_append(&g->nodes[n1].adjacency_list, unsigned int, n2);
491 ra_node_remove_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
493 BITSET_CLEAR(g->nodes[n1].adjacency, n2);
495 assert(n1 != n2);
497 int n1_class = g->nodes[n1].class;
499 g->nodes[n1].q_total -= g->regs->classes[n1_class]->q[n2_class];
501 util_dynarray_delete_unordered(&g->nodes[n1].adjacency_list, unsigned int,
612 unsigned int n1, unsigned int n2)
614 assert(n1 < g->count && n2 < g->count);
615 if (n1 != n2 && !BITSET_TEST(g->nodes[n1].adjacency, n2)) {
616 ra_add_node_adjacency(g, n1, n2);
617 ra_add_node_adjacency(g, n2, n1);