Home | History | Annotate | Download | only in program

Lines Matching defs:class

57  * example, one might have a class of base registers, and a class of
59 * the base registers. Each node has a register class it needs to be
60 * assigned to. Define p(B) to be the size of register class B, and
64 * are registers" with "For this node of class B, the sum of q(B,C)
65 * for each neighbor node of class C is less than pB".
108 * q(B,C) (indexed by C, B is this register class) in
126 unsigned int class;
233 struct ra_class *class;
238 class = rzalloc(regs, struct ra_class);
239 regs->classes[regs->class_count] = class;
241 class->regs = rzalloc_array(class, GLboolean, regs->count);
249 struct ra_class *class = regs->classes[c];
251 class->regs[r] = GL_TRUE;
252 class->p++;
268 /* Compute, for each class B and C, how many regs of B an
329 unsigned int n, unsigned int class)
331 g->nodes[n].class = class;
348 int n_class = g->nodes[n].class;
352 unsigned int n2_class = g->nodes[n2].class;
416 struct ra_class *c = g->regs->classes[g->nodes[n].class];
487 * creating a register class containing one node when handling data
508 int n_class = g->nodes[n].class;
518 unsigned int n2_class = g->nodes[n2].class;