Home
last modified time | relevance | path

Searched refs:BITSET_WORDS (Results 1 – 4 of 4) sorted by relevance

/hardware/google/gfxstream/guest/mesa/src/util/
Dbitset.h46 #define BITSET_WORDS(bits) (((bits) + BITSET_WORDBITS - 1) / BITSET_WORDBITS) macro
47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)]
374 if (word >= BITSET_WORDS(size)) in __bitset_next_set()
410 if (word >= BITSET_WORDS(size)) { in __bitset_next_range()
417 if (word >= BITSET_WORDS(size)) { in __bitset_next_range()
431 if (word >= BITSET_WORDS(size)) { in __bitset_next_range()
438 if (word >= BITSET_WORDS(size)) { in __bitset_next_range()
480 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \
522 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \
530 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \
[all …]
Dregister_allocate.c102 BITSET_WORDS(count)); in ra_alloc_reg_set()
211 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive()
231 class->regs = rzalloc_array(class, BITSET_WORD, BITSET_WORDS(regs->count)); in ra_alloc_reg_class()
322 for (int i = 0; i < BITSET_WORDS(regs->count); i++) { in ra_set_finalize()
408 blob_write_bytes(blob, reg->conflicts, BITSET_WORDS(regs->count) * in ra_set_serialize()
416 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) * in ra_set_serialize()
444 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) * in ra_set_deserialize()
459 class->regs = ralloc_array(class, BITSET_WORD, BITSET_WORDS(reg_count)); in ra_set_deserialize()
460 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize()
550 BITSET_WORDS(ra_get_num_adjacency_bits(g->alloc)), in ra_realloc_interference_graph()
[all …]
Du_worklist.c35 w->present = rzalloc_array(mem_ctx, BITSET_WORD, BITSET_WORDS(num_entries)); in u_worklist_init()
/hardware/google/gfxstream/guest/mesa/src/vulkan/runtime/
Dvk_graphics_state.c33 BITSET_WORDS(MESA_VK_DYNAMIC_GRAPHICS_STATE_ENUM_MAX)); in clear_all_dynamic_state()