/dports/www/firefox/firefox-99.0/third_party/rust/glslopt/glsl-optimizer/src/util/ |
H A D | bitset.h | 46 #define BITSET_WORDS(bits) (((bits) + BITSET_WORDBITS - 1) / BITSET_WORDBITS) macro 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 117 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 157 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 199 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 207 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 223 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 256 BITSET_WORD words[BITSET_WORDS(N)]; \
|
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/glslopt/glsl-optimizer/src/util/ |
H A D | bitset.h | 46 #define BITSET_WORDS(bits) (((bits) + BITSET_WORDBITS - 1) / BITSET_WORDBITS) macro 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 117 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 157 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 199 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 207 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 223 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 256 BITSET_WORD words[BITSET_WORDS(N)]; \
|
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/glslopt/glsl-optimizer/src/util/ |
H A D | bitset.h | 46 #define BITSET_WORDS(bits) (((bits) + BITSET_WORDBITS - 1) / BITSET_WORDBITS) macro 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 117 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 157 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 199 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 207 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 223 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 256 BITSET_WORD words[BITSET_WORDS(N)]; \
|
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/glslopt/glsl-optimizer/src/util/ |
H A D | bitset.h | 46 #define BITSET_WORDS(bits) (((bits) + BITSET_WORDBITS - 1) / BITSET_WORDBITS) macro 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 117 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 157 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 199 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 207 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 223 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 256 BITSET_WORD words[BITSET_WORDS(N)]; \
|
/dports/graphics/mesa-dri-classic/mesa-20.2.3/src/util/ |
H A D | bitset.h | 46 #define BITSET_WORDS(bits) (((bits) + BITSET_WORDBITS - 1) / BITSET_WORDBITS) macro 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 131 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 171 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 213 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 221 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 237 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 270 BITSET_WORD words[BITSET_WORDS(N)]; \
|
H A D | register_allocate.c | 224 BITSET_WORDS(count)); in ra_alloc_reg_set() 333 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive() 433 blob_write_bytes(blob, reg->conflicts, BITSET_WORDS(regs->count) * in ra_set_serialize() 440 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) * in ra_set_serialize() 460 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) * in ra_set_deserialize() 473 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize() 530 unsigned g_bitset_count = BITSET_WORDS(g->alloc); in ra_realloc_interference_graph() 531 unsigned bitset_count = BITSET_WORDS(alloc); in ra_realloc_interference_graph() 640 BITSET_WORDS(g->count) * sizeof(BITSET_WORD)); in ra_reset_node_interference() 842 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++) in ra_compute_available_regs() [all …]
|
/dports/graphics/libosmesa-gallium/mesa-21.3.6/src/util/ |
H A D | bitset.h | 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 309 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 345 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 352 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 366 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 373 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 415 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 457 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 465 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 481 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ [all …]
|
H A D | register_allocate.c | 103 BITSET_WORDS(count)); in ra_alloc_reg_set() 212 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive() 323 for (int i = 0; i < BITSET_WORDS(regs->count); i++) { in ra_set_finalize() 417 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) * in ra_set_serialize() 445 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) * in ra_set_deserialize() 461 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize() 519 unsigned g_bitset_count = BITSET_WORDS(g->alloc); in ra_realloc_interference_graph() 520 unsigned bitset_count = BITSET_WORDS(alloc); in ra_realloc_interference_graph() 629 BITSET_WORDS(g->count) * sizeof(BITSET_WORD)); in ra_reset_node_interference() 854 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++) in ra_compute_available_regs() [all …]
|
/dports/lang/clover/mesa-21.3.6/src/util/ |
H A D | bitset.h | 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 309 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 345 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 352 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 366 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 373 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 415 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 457 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 465 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 481 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ [all …]
|
H A D | register_allocate.c | 103 BITSET_WORDS(count)); in ra_alloc_reg_set() 212 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive() 323 for (int i = 0; i < BITSET_WORDS(regs->count); i++) { in ra_set_finalize() 417 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) * in ra_set_serialize() 445 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) * in ra_set_deserialize() 461 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize() 519 unsigned g_bitset_count = BITSET_WORDS(g->alloc); in ra_realloc_interference_graph() 520 unsigned bitset_count = BITSET_WORDS(alloc); in ra_realloc_interference_graph() 629 BITSET_WORDS(g->count) * sizeof(BITSET_WORD)); in ra_reset_node_interference() 854 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++) in ra_compute_available_regs() [all …]
|
/dports/graphics/libosmesa/mesa-21.3.6/src/util/ |
H A D | bitset.h | 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 309 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 345 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 352 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 366 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 373 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 415 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 457 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 465 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 481 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ [all …]
|
H A D | register_allocate.c | 103 BITSET_WORDS(count)); in ra_alloc_reg_set() 212 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive() 323 for (int i = 0; i < BITSET_WORDS(regs->count); i++) { in ra_set_finalize() 417 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) * in ra_set_serialize() 445 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) * in ra_set_deserialize() 461 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize() 519 unsigned g_bitset_count = BITSET_WORDS(g->alloc); in ra_realloc_interference_graph() 520 unsigned bitset_count = BITSET_WORDS(alloc); in ra_realloc_interference_graph() 629 BITSET_WORDS(g->count) * sizeof(BITSET_WORD)); in ra_reset_node_interference() 854 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++) in ra_compute_available_regs() [all …]
|
/dports/graphics/mesa-libs/mesa-21.3.6/src/util/ |
H A D | bitset.h | 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 309 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 345 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 352 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 366 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 373 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 415 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 457 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 465 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 481 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ [all …]
|
H A D | register_allocate.c | 103 BITSET_WORDS(count)); in ra_alloc_reg_set() 212 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive() 323 for (int i = 0; i < BITSET_WORDS(regs->count); i++) { in ra_set_finalize() 417 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) * in ra_set_serialize() 445 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) * in ra_set_deserialize() 461 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize() 519 unsigned g_bitset_count = BITSET_WORDS(g->alloc); in ra_realloc_interference_graph() 520 unsigned bitset_count = BITSET_WORDS(alloc); in ra_realloc_interference_graph() 629 BITSET_WORDS(g->count) * sizeof(BITSET_WORD)); in ra_reset_node_interference() 854 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++) in ra_compute_available_regs() [all …]
|
/dports/graphics/mesa-dri-gallium/mesa-21.3.6/src/util/ |
H A D | bitset.h | 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 309 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 345 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 352 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 366 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 373 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 415 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 457 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 465 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 481 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ [all …]
|
H A D | register_allocate.c | 103 BITSET_WORDS(count)); in ra_alloc_reg_set() 212 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive() 323 for (int i = 0; i < BITSET_WORDS(regs->count); i++) { in ra_set_finalize() 417 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) * in ra_set_serialize() 445 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) * in ra_set_deserialize() 461 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize() 519 unsigned g_bitset_count = BITSET_WORDS(g->alloc); in ra_realloc_interference_graph() 520 unsigned bitset_count = BITSET_WORDS(alloc); in ra_realloc_interference_graph() 629 BITSET_WORDS(g->count) * sizeof(BITSET_WORD)); in ra_reset_node_interference() 854 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++) in ra_compute_available_regs() [all …]
|
/dports/graphics/mesa-gallium-va/mesa-21.3.6/src/util/ |
H A D | bitset.h | 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 309 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 345 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 352 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 366 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 373 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 415 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 457 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 465 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 481 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ [all …]
|
H A D | register_allocate.c | 103 BITSET_WORDS(count)); in ra_alloc_reg_set() 212 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive() 323 for (int i = 0; i < BITSET_WORDS(regs->count); i++) { in ra_set_finalize() 417 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) * in ra_set_serialize() 445 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) * in ra_set_deserialize() 461 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize() 519 unsigned g_bitset_count = BITSET_WORDS(g->alloc); in ra_realloc_interference_graph() 520 unsigned bitset_count = BITSET_WORDS(alloc); in ra_realloc_interference_graph() 629 BITSET_WORDS(g->count) * sizeof(BITSET_WORD)); in ra_reset_node_interference() 854 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++) in ra_compute_available_regs() [all …]
|
/dports/graphics/mesa-gallium-vdpau/mesa-21.3.6/src/util/ |
H A D | bitset.h | 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 309 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 345 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 352 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 366 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 373 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 415 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 457 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 465 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 481 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ [all …]
|
H A D | register_allocate.c | 103 BITSET_WORDS(count)); in ra_alloc_reg_set() 212 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive() 323 for (int i = 0; i < BITSET_WORDS(regs->count); i++) { in ra_set_finalize() 417 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) * in ra_set_serialize() 445 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) * in ra_set_deserialize() 461 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize() 519 unsigned g_bitset_count = BITSET_WORDS(g->alloc); in ra_realloc_interference_graph() 520 unsigned bitset_count = BITSET_WORDS(alloc); in ra_realloc_interference_graph() 629 BITSET_WORDS(g->count) * sizeof(BITSET_WORD)); in ra_reset_node_interference() 854 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++) in ra_compute_available_regs() [all …]
|
/dports/graphics/mesa-gallium-xa/mesa-21.3.6/src/util/ |
H A D | bitset.h | 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 309 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 345 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 352 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 366 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 373 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 415 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 457 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 465 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 481 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ [all …]
|
H A D | register_allocate.c | 103 BITSET_WORDS(count)); in ra_alloc_reg_set() 212 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive() 323 for (int i = 0; i < BITSET_WORDS(regs->count); i++) { in ra_set_finalize() 417 blob_write_bytes(blob, class->regs, BITSET_WORDS(regs->count) * in ra_set_serialize() 445 blob_copy_bytes(blob, reg->conflicts, BITSET_WORDS(reg_count) * in ra_set_deserialize() 461 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize() 519 unsigned g_bitset_count = BITSET_WORDS(g->alloc); in ra_realloc_interference_graph() 520 unsigned bitset_count = BITSET_WORDS(alloc); in ra_realloc_interference_graph() 629 BITSET_WORDS(g->count) * sizeof(BITSET_WORD)); in ra_reset_node_interference() 854 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++) in ra_compute_available_regs() [all …]
|
/dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/util/ |
H A D | bitset.h | 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 309 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 345 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 352 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 366 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 373 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 415 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 457 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 465 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 481 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ [all …]
|
H A D | register_allocate.c | 102 BITSET_WORDS(count)); in ra_alloc_reg_set() 211 for (i = 0; i < BITSET_WORDS(regs->count); i++) in ra_make_reg_conflicts_transitive() 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() 460 blob_copy_bytes(blob, class->regs, BITSET_WORDS(reg_count) * in ra_set_deserialize() 565 unsigned bitset_count = BITSET_WORDS(alloc); in ra_realloc_interference_graph() 729 for (int i = BITSET_WORDS(g->count) - 1, high_bit = top_word_high_bit; in ra_simplify() 877 for (int j = 0; j < BITSET_WORDS(g->regs->count); j++) in ra_compute_available_regs() [all …]
|
/dports/graphics/mesa-dri/mesa-21.3.6/src/util/ |
H A D | bitset.h | 47 #define BITSET_DECLARE(name, bits) BITSET_WORD name[BITSET_WORDS(bits)] 309 if (word >= BITSET_WORDS(size)) in __bitset_next_set() 345 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 352 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 366 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 373 if (word >= BITSET_WORDS(size)) { in __bitset_next_range() 415 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 457 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 465 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ 481 for (unsigned i = 0; i < BITSET_WORDS(N); i++) \ [all …]
|