Lines Matching defs:n1
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);
400 int n1_class = g->nodes[n1].class;
402 g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class];
404 if (g->nodes[n1].adjacency_count >=
405 g->nodes[n1].adjacency_list_size) {
406 g->nodes[n1].adjacency_list_size *= 2;
407 g->nodes[n1].adjacency_list = reralloc(g, g->nodes[n1].adjacency_list,
409 g->nodes[n1].adjacency_list_size);
412 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
413 g->nodes[n1].adjacency_count++;
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);