Searched refs:n_class (Results 1 – 2 of 2) sorted by relevance
476 int n_class = g->nodes[n].class; in pq_test() local478 return g->nodes[n].q_total < g->regs->classes[n_class]->p; in pq_test()485 int n_class = g->nodes[n].class; in decrement_q() local492 assert(g->nodes[n2].q_total >= g->regs->classes[n2_class]->q[n_class]); in decrement_q()493 g->nodes[n2].q_total -= g->regs->classes[n2_class]->q[n_class]; in decrement_q()718 int n_class = g->nodes[n].class; in ra_get_spill_benefit() local728 benefit += ((float)g->regs->classes[n_class]->q[n2_class] / in ra_get_spill_benefit()729 g->regs->classes[n_class]->p); in ra_get_spill_benefit()
407 n_class = array_ops.size(partitioned_samples_indices[c])409 samples_class_c = self.components[c].sample(n_class, seed=seed)427 batch_size * math_ops.range(n_class) +431 array_ops.concat([[n_class * batch_size], event_shape], 0))