Lines Matching defs:reg

87  * mem_ctx is a ralloc context for the allocator.  The reg set may be freed
151  * Adds a conflict between base_reg and reg, and also between reg and
160                                unsigned int base_reg, unsigned int reg)
162    ra_add_reg_conflict(regs, reg, base_reg);
166       ra_add_reg_conflict(regs, reg, *r2p);
205    struct ra_reg *reg = &regs->regs[r];
208    BITSET_FOREACH_SET(c, reg->conflicts, regs->count) {
212          other->conflicts[i] |= reg->conflicts[i];
240  * A reg set using this type of register class must use only this type of
407          struct ra_reg *reg = &regs->regs[r];
408          blob_write_bytes(blob, reg->conflicts, BITSET_WORDS(regs->count) *
410          assert(util_dynarray_num_elements(&reg->conflict_list, unsigned int) == 0);
443          struct ra_reg *reg = &regs->regs[r];
444          blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) *
559       node->reg = NO_REG;
738          g->nodes[n].reg = g->nodes[n].forced_reg;
740          if (g->nodes[n].reg != NO_REG)
841                                         g->regs->classes[g->nodes[n2].class], g->nodes[n2].reg)) {
872             int start = MAX2(0, (int)n2->reg - c->contig_len + 1);
873             int end = MIN2(g->regs->count, n2->reg + n2c->contig_len);
878                regs[j] &= ~g->regs->regs[n2->reg].conflicts[j];
927          /* Find the lowest-numbered reg which is not used by a member
937                /* Found a reg! */
941                /* Skip to point at the last base reg of the conflicting reg
942                 * allocation -- the loop will increment us to check the next reg
945                unsigned conflicting_end = (conflicting->reg +
956       g->nodes[n].reg = r;
991       return g->nodes[n].reg;
1008 ra_set_node_reg(struct ra_graph *g, unsigned int n, unsigned int reg)
1010    g->nodes[n].forced_reg = reg;