Searched refs:q_total (Results 1 - 3 of 3) sorted by relevance

/xsrc/external/mit/MesaLib/dist/src/util/
H A Dregister_allocate_internal.h112 unsigned int q_total; member in struct:ra_node
122 * Temporary version of q_total which we decrement as things are placed
125 unsigned int q_total; member in struct:ra_node::__anon02efe9240108
160 * * For each BITSET_WORD, the node with the minimum q_total if
H A Dregister_allocate.c485 g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class];
499 g->nodes[n1].q_total -= g->regs->classes[n1_class]->q[n2_class];
533 g->nodes[i].q_total = 0;
638 if (g->nodes[n].tmp.q_total < g->regs->classes[n_class]->p) {
647 if (g->nodes[n].tmp.q_total < g->tmp.min_q_total[i] ||
648 (g->nodes[n].tmp.q_total == g->tmp.min_q_total[i] &&
650 g->tmp.min_q_total[i] = g->nodes[n].tmp.q_total;
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];
716 g->nodes[n].tmp.q_total
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/util/
H A Dregister_allocate.c152 unsigned int q_total; member in struct:ra_node
402 g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class];
437 g->nodes[i].q_total = 0;
477 return g->nodes[n].q_total < g->regs->classes[n_class]->p;
491 assert(g->nodes[n2].q_total >= g->regs->classes[n2_class]->q[n_class]);
492 g->nodes[n2].q_total -= g->regs->classes[n2_class]->q[n_class];
531 unsigned int new_q_total = g->nodes[i].q_total;

Completed in 4 milliseconds