Lines Matching defs:count
91 ra_alloc_reg_set(void *mem_ctx, unsigned int count, bool need_conflict_lists)
97 regs->count = count;
98 regs->regs = rzalloc_array(regs, struct ra_reg, count);
100 for (i = 0; i < count; i++) {
102 BITSET_WORDS(count));
208 BITSET_FOREACH_SET(c, reg->conflicts, regs->count) {
211 for (i = 0; i < BITSET_WORDS(regs->count); i++)
231 class->regs = rzalloc_array(class, BITSET_WORD, BITSET_WORDS(regs->count));
269 assert(r < class->regset->count);
270 assert(r + class->contig_len <= class->regset->count);
322 for (int i = 0; i < BITSET_WORDS(regs->count); i++) {
333 BITSET_FOREACH_SET(rc, regs->classes[c]->regs, regs->count) {
335 int end = MIN2(regs->count, rc + class_c->contig_len);
360 BITSET_FOREACH_SET(rc, regs->classes[c]->regs, regs->count) {
377 for (b = 0; b < regs->count; b++) {
389 for (int i = 0; i < regs->count; i++) {
399 blob_write_uint32(blob, regs->count);
406 for (unsigned int r = 0; r < regs->count; r++) {
408 blob_write_bytes(blob, reg->conflicts, BITSET_WORDS(regs->count) *
416 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) *
434 assert(regs->count == reg_count);
437 for (int i = 0; i < regs->count; i++) {
581 ra_alloc_interference_graph(struct ra_regs *regs, unsigned int count)
587 g->count = count;
588 ra_realloc_interference_graph(g, count);
594 ra_resize_interference_graph(struct ra_graph *g, unsigned int count)
596 g->count = count;
597 if (count > g->alloc)
626 unsigned int n = g->count;
627 ra_resize_interference_graph(g, g->count + 1);
638 assert(n1 < g->count && n2 < g->count);
725 const unsigned int top_word_high_bit = (g->count - 1) % BITSET_WORDBITS;
729 for (int i = BITSET_WORDS(g->count) - 1, high_bit = top_word_high_bit;
752 for (int i = BITSET_WORDS(g->count) - 1, high_bit = top_word_high_bit;
771 assert(n < g->count);
791 assert(n < g->count);
861 memcpy(regs, c->regs, BITSET_WORDS(g->regs->count) * sizeof(BITSET_WORD));
873 int end = MIN2(g->regs->count, n2->reg + n2c->contig_len);
877 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++)
883 for (int i = 0; i < BITSET_WORDS(g->regs->count); i++) {
905 select_regs = malloc(BITSET_WORDS(g->regs->count) * sizeof(BITSET_WORD));
925 assert(r < g->regs->count);
930 for (ri = 0; ri < g->regs->count; ri++) {
931 r = (start_search_reg + ri) % g->regs->count;
952 if (ri >= g->regs->count)
1021 * "count number of edges" approach of traditional graph coloring,
1050 for (n = 0; n < g->count; n++) {