Lines Matching refs:n2
296 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
299 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
336 unsigned int n1, unsigned int n2)
338 if (!g->nodes[n1].adjacency[n2]) {
339 ra_add_node_adjacency(g, n1, n2);
340 ra_add_node_adjacency(g, n2, n1);
351 unsigned int n2 = g->nodes[n].adjacency_list[j];
352 unsigned int n2_class = g->nodes[n2].class;
354 if (n != n2 && !g->nodes[n2].in_stack) {
427 unsigned int n2 = g->nodes[n].adjacency_list[i];
429 if (!g->nodes[n2].in_stack &&
430 g->regs->regs[r].conflicts[g->nodes[n2].reg]) {
510 /* Define the benefit of eliminating an interference between n, n2
516 unsigned int n2 = g->nodes[n].adjacency_list[j];
517 if (n != n2) {
518 unsigned int n2_class = g->nodes[n2].class;
