Lines Matching refs:n2
482 ra_get_adjacency_bit_index(unsigned n1, unsigned n2)
484 assert(n1 != n2);
485 unsigned k1 = MAX2(n1, n2);
486 unsigned k2 = MIN2(n1, n2);
491 ra_test_adjacency_bit(struct ra_graph *g, unsigned n1, unsigned n2)
493 uint64_t index = ra_get_adjacency_bit_index(n1, n2);
498 ra_set_adjacency_bit(struct ra_graph *g, unsigned n1, unsigned n2)
500 unsigned index = ra_get_adjacency_bit_index(n1, n2);
505 ra_clear_adjacency_bit(struct ra_graph *g, unsigned n1, unsigned n2)
507 unsigned index = ra_get_adjacency_bit_index(n1, n2);
512 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
514 assert(n1 != n2);
517 int n2_class = g->nodes[n2].class;
520 util_dynarray_append(&g->nodes[n1].adjacency_list, unsigned int, n2);
524 ra_node_remove_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
526 assert(n1 != n2);
527 ra_clear_adjacency_bit(g, n1, n2);
530 int n2_class = g->nodes[n2].class;
534 n2);
636 unsigned int n1, unsigned int n2)
638 assert(n1 < g->count && n2 < g->count);
639 if (n1 != n2 && !ra_test_adjacency_bit(g, n1, n2)) {
640 ra_set_adjacency_bit(g, n1, n2);
641 ra_add_node_adjacency(g, n1, n2);
642 ra_add_node_adjacency(g, n2, n1);
687 unsigned int n2 = *n2p;
688 unsigned int n2_class = g->nodes[n2].class;
690 if (!BITSET_TEST(g->tmp.in_stack, n2) &&
691 !BITSET_TEST(g->tmp.reg_assigned, n2)) {
692 assert(g->nodes[n2].tmp.q_total >= g->regs->classes[n2_class]->q[n_class]);
693 g->nodes[n2].tmp.q_total -= g->regs->classes[n2_class]->q[n_class];
694 update_pq_info(g, n2);
836 unsigned int n2 = *n2p;
839 if (!BITSET_TEST(g->tmp.in_stack, n2) &&
841 g->regs->classes[g->nodes[n2].class], g->nodes[n2].reg)) {
842 return &g->nodes[n2];
867 struct ra_node *n2 = &g->nodes[*n2p];
868 struct ra_class *n2c = g->regs->classes[n2->class];
872 int start = MAX2(0, (int)n2->reg - c->contig_len + 1);
873 int end = MIN2(g->regs->count, n2->reg + n2c->contig_len);
878 regs[j] &= ~g->regs->regs[n2->reg].conflicts[j];
1019 /* Define the benefit of eliminating an interference between n, n2
1025 unsigned int n2 = *n2p;
1026 unsigned int n2_class = g->nodes[n2].class;