Cross Reference: /xsrc/external/mit/MesaLib/dist/src/util/register

Lines Matching defs:n2
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);
484    int n2_class = g->nodes[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);
498    int n2_class = g->nodes[n2].class;
502                                   n2);
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);
664       unsigned int n2 = *n2p;
665       unsigned int n2_class = g->nodes[n2].class;
667       if (!BITSET_TEST(g->tmp.in_stack, n2) &&
668           !BITSET_TEST(g->tmp.reg_assigned, n2)) {
669          assert(g->nodes[n2].tmp.q_total >= g->regs->classes[n2_class]->q[n_class]);
670          g->nodes[n2].tmp.q_total -= g->regs->classes[n2_class]->q[n_class];
671          update_pq_info(g, n2);
813       unsigned int n2 = *n2p;
816       if (!BITSET_TEST(g->tmp.in_stack, n2) &&
818                                         g->regs->classes[g->nodes[n2].class], g->nodes[n2].reg)) {
819          return &g->nodes[n2];
844       struct ra_node *n2 = &g->nodes[*n2p];
845       struct ra_class *n2c = g->regs->classes[n2->class];
849             int start = MAX2(0, (int)n2->reg - c->contig_len + 1);
850             int end = MIN2(g->regs->count, n2->reg + n2c->contig_len);
855                regs[j] &= ~g->regs->regs[n2->reg].conflicts[j];
996    /* Define the benefit of eliminating an interference between n, n2
1002       unsigned int n2 = *n2p;
1003       unsigned int n2_class = g->nodes[n2].class;