Lines Matching defs:n2
394 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
396 BITSET_SET(g->nodes[n1].adjacency, n2);
398 assert(n1 != n2);
401 int n2_class = g->nodes[n2].class;
412 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
464 unsigned int n1, unsigned int n2)
466 if (n1 != n2 && !BITSET_TEST(g->nodes[n1].adjacency, n2)) {
467 ra_add_node_adjacency(g, n1, n2);
468 ra_add_node_adjacency(g, n2, n1);
487 unsigned int n2 = g->nodes[n].adjacency_list[i];
488 unsigned int n2_class = g->nodes[n2].class;
490 if (!g->nodes[n2].in_stack) {
491 assert(g->nodes[n2].q_total >= g->regs->classes[n2_class]->q[n_class]);
492 g->nodes[n2].q_total -= g->regs->classes[n2_class]->q[n_class];
560 unsigned int n2 = g->nodes[n].adjacency_list[i];
562 if (!g->nodes[n2].in_stack &&
563 BITSET_TEST(g->regs->regs[r].conflicts, g->nodes[n2].reg)) {
589 unsigned int n2 = g->nodes[n].adjacency_list[i];
590 unsigned int r = g->nodes[n2].reg;
592 if (!g->nodes[n2].in_stack) {
719 /* Define the benefit of eliminating an interference between n, n2
725 unsigned int n2 = g->nodes[n].adjacency_list[j];
726 unsigned int n2_class = g->nodes[n2].class;