Lines Matching refs:BITSET_WORD
85 BITSET_WORD *conflicts;
105 BITSET_WORD *regs;
128 BITSET_WORD *adjacency;
181 BITSET_WORD *in_stack;
184 BITSET_WORD *reg_assigned;
187 BITSET_WORD *pq_test;
223 regs->regs[i].conflicts = rzalloc_array(regs->regs, BITSET_WORD, in ra_alloc_reg_set()
349 class->regs = rzalloc_array(class, BITSET_WORD, BITSET_WORDS(regs->count)); in ra_alloc_reg_class()
434 sizeof(BITSET_WORD)); in ra_set_serialize()
441 sizeof(BITSET_WORD)); in ra_set_serialize()
461 sizeof(BITSET_WORD)); in ra_set_deserialize()
472 class->regs = ralloc_array(class, BITSET_WORD, BITSET_WORDS(reg_count)); in ra_set_deserialize()
474 sizeof(BITSET_WORD)); in ra_set_deserialize()
535 g->nodes[i].adjacency = rerzalloc(g, g->nodes[i].adjacency, BITSET_WORD, in ra_realloc_interference_graph()
542 g->nodes[i].adjacency = rzalloc_array(g, BITSET_WORD, bitset_count); in ra_realloc_interference_graph()
554 g->tmp.in_stack = reralloc(g, g->tmp.in_stack, BITSET_WORD, bitset_count); in ra_realloc_interference_graph()
556 g->tmp.reg_assigned = reralloc(g, g->tmp.reg_assigned, BITSET_WORD, in ra_realloc_interference_graph()
558 g->tmp.pq_test = reralloc(g, g->tmp.pq_test, BITSET_WORD, bitset_count); in ra_realloc_interference_graph()
640 BITSET_WORDS(g->count) * sizeof(BITSET_WORD)); in ra_reset_node_interference()
742 BITSET_WORD mask = ~(BITSET_WORD)0 >> (31 - high_bit); in ra_simplify()
744 BITSET_WORD skip = g->tmp.in_stack[i] | g->tmp.reg_assigned[i]; in ra_simplify()
748 BITSET_WORD pq = g->tmp.pq_test[i] & ~skip; in ra_simplify()
827 ra_compute_available_regs(struct ra_graph *g, unsigned int n, BITSET_WORD *regs) in ra_compute_available_regs()
832 memcpy(regs, c->regs, BITSET_WORDS(g->regs->count) * sizeof(BITSET_WORD)); in ra_compute_available_regs()
866 BITSET_WORD *select_regs = NULL; in ra_select()
869 select_regs = malloc(BITSET_WORDS(g->regs->count) * sizeof(BITSET_WORD)); in ra_select()