Lines Matching refs:conflicts
101 regs->regs[i].conflicts = rzalloc_array(regs->regs, BITSET_WORD,
103 BITSET_SET(regs->regs[i].conflicts, i);
138 BITSET_SET(reg1->conflicts, r2);
144 if (!BITSET_TEST(regs->regs[r1].conflicts, r2)) {
152 * anything that base_reg conflicts with.
171 * Set up conflicts between base_reg and it's two half registers reg0 and
172 * reg1, but take care to not add conflicts between reg0 and reg1.
195 * every register that conflicts with r will now conflict with every other
208 BITSET_FOREACH_SET(c, reg->conflicts, regs->count) {
212 other->conflicts[i] |= reg->conflicts[i];
286 * Must be called after all conflicts and register classes have been
336 unsigned int conflicts = 0;
339 conflicts++;
341 max_conflicts = MAX2(max_conflicts, conflicts);
361 int conflicts = 0;
367 conflicts++;
369 max_conflicts = MAX2(max_conflicts, conflicts);
385 /* In this case, we never need the conflicts lists (and it would probably
386 * be a mistake to look at conflicts when doing contiguous classes!), so
390 ralloc_free(regs->regs[i].conflicts);
391 regs->regs[i].conflicts = NULL;
408 blob_write_bytes(blob, reg->conflicts, BITSET_WORDS(regs->count) *
438 ralloc_free(regs->regs[i].conflicts);
439 regs->regs[i].conflicts = NULL;
444 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) *
828 return BITSET_TEST(c1->regset->regs[r1].conflicts, r2);
878 regs[j] &= ~g->regs->regs[n2->reg].conflicts[j];