145    unsigned int q_total;  member
158       unsigned int q_total;  member
496    g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class];  in ra_add_node_adjacency()
510    g->nodes[n1].q_total -= g->regs->classes[n1_class]->q[n2_class];  in ra_node_remove_adjacency()
544       g->nodes[i].q_total = 0;  in ra_realloc_interference_graph()
649    if (g->nodes[n].tmp.q_total < g->regs->classes[n_class]->p) {  in update_pq_info()
658       if (g->nodes[n].tmp.q_total < g->tmp.min_q_total[i] ||  in update_pq_info()
659           (g->nodes[n].tmp.q_total == g->tmp.min_q_total[i] &&  in update_pq_info()
661          g->tmp.min_q_total[i] = g->nodes[n].tmp.q_total;  in update_pq_info()
680          assert(g->nodes[n2].tmp.q_total >= g->regs->classes[n2_class]->q[n_class]);  in add_node_to_stack()
681          g->nodes[n2].tmp.q_total -= g->regs->classes[n2_class]->q[n_class];  in add_node_to_stack()
727          g->nodes[n].tmp.q_total = g->nodes[n].q_total;  in ra_simplify()
780                   if (g->nodes[n].tmp.q_total < g->tmp.min_q_total[i]) {  in ra_simplify()
781                      g->tmp.min_q_total[i] = g->nodes[n].tmp.q_total;  in ra_simplify()