HomeSort by: relevance | last modified time | path
    Searched defs:n_class (Results 1 - 2 of 2) sorted by relevancy

  /xsrc/external/mit/MesaLib/dist/src/util/
register_allocate.c 637 int n_class = g->nodes[n].class; local
638 if (g->nodes[n].tmp.q_total < g->regs->classes[n_class]->p) {
659 int n_class = g->nodes[n].class; local
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];
994 int n_class = g->nodes[n].class; local
1004 benefit += ((float)g->regs->classes[n_class]->q[n2_class] /
1005 g->regs->classes[n_class]->p);
  /xsrc/external/mit/MesaLib.old/dist/src/util/
register_allocate.c 475 int n_class = g->nodes[n].class; local
477 return g->nodes[n].q_total < g->regs->classes[n_class]->p;
484 int n_class = g->nodes[n].class; local
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];
717 int n_class = g->nodes[n].class; local
727 benefit += ((float)g->regs->classes[n_class]->q[n2_class] /
728 g->regs->classes[n_class]->p);

Completed in 22 milliseconds