Lines Matching defs:conflicts
102 regs->regs[i].conflicts = rzalloc_array(regs->regs, BITSET_WORD,
104 BITSET_SET(regs->regs[i].conflicts, i);
139 BITSET_SET(reg1->conflicts, r2);
145 if (!BITSET_TEST(regs->regs[r1].conflicts, r2)) {
153 * anything that base_reg conflicts with.
172 * Set up conflicts between base_reg and it's two half registers reg0 and
173 * reg1, but take care to not add conflicts between reg0 and reg1.
196 * every register that conflicts with r will now conflict with every other
209 BITSET_FOREACH_SET(c, reg->conflicts, regs->count) {
213 other->conflicts[i] |= reg->conflicts[i];
287 * Must be called after all conflicts and register classes have been
337 unsigned int conflicts = 0;
340 conflicts++;
342 max_conflicts = MAX2(max_conflicts, conflicts);
362 int conflicts = 0;
368 conflicts++;
370 max_conflicts = MAX2(max_conflicts, conflicts);
386 /* In this case, we never need the conflicts lists (and it would probably
387 * be a mistake to look at conflicts when doing contiguous classes!), so
391 ralloc_free(regs->regs[i].conflicts);
392 regs->regs[i].conflicts = NULL;
409 blob_write_bytes(blob, reg->conflicts, BITSET_WORDS(regs->count) *
439 ralloc_free(regs->regs[i].conflicts);
440 regs->regs[i].conflicts = NULL;
445 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) *
805 return BITSET_TEST(c1->regset->regs[r1].conflicts, r2);
855 regs[j] &= ~g->regs->regs[n2->reg].conflicts[j];