Searched refs:adjacency_count (Results 1 – 1 of 1) sorted by relevance
133 unsigned int adjacency_count; member405 if (g->nodes[n1].adjacency_count >= in ra_add_node_adjacency()413 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2; in ra_add_node_adjacency()414 g->nodes[n1].adjacency_count++; in ra_add_node_adjacency()437 g->nodes[i].adjacency_count = 0; in ra_alloc_interference_graph()487 for (i = 0; i < g->nodes[n].adjacency_count; i++) { in decrement_q()560 for (i = 0; i < g->nodes[n].adjacency_count; i++) { in ra_any_neighbors_conflict()589 for (int i = 0; i < g->nodes[n].adjacency_count; i++) { in ra_compute_available_regs()725 for (j = 0; j < g->nodes[n].adjacency_count; j++) { in ra_get_spill_benefit()