| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/tests/ |
| control_flow_tests.cpp | 90 /* Verify the successors and predecessors. */
99 EXPECT_EQ(0, block_0->predecessors->entries);
100 EXPECT_EQ(1, block_1->predecessors->entries);
101 EXPECT_EQ(1, block_2->predecessors->entries);
102 EXPECT_EQ(1, block_3->predecessors->entries);
103 EXPECT_TRUE(_mesa_set_search(block_1->predecessors, block_0));
104 EXPECT_TRUE(_mesa_set_search(block_2->predecessors, block_1));
105 EXPECT_TRUE(_mesa_set_search(block_3->predecessors, block_2));
131 * Re-verify the predecessors and successors.
141 EXPECT_EQ(0, block_0->predecessors->entries)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/tests/ |
| control_flow_tests.cpp | 87 /* Verify the successors and predecessors. */
96 EXPECT_EQ(0, block_0->predecessors->entries);
97 EXPECT_EQ(1, block_1->predecessors->entries);
98 EXPECT_EQ(1, block_2->predecessors->entries);
99 EXPECT_EQ(1, block_3->predecessors->entries);
100 EXPECT_TRUE(_mesa_set_search(block_1->predecessors, block_0));
101 EXPECT_TRUE(_mesa_set_search(block_2->predecessors, block_1));
102 EXPECT_TRUE(_mesa_set_search(block_3->predecessors, block_2));
128 * Re-verify the predecessors and successors.
138 EXPECT_EQ(0, block_0->predecessors->entries)
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/intel/compiler/ |
| brw_nir_tcs_workarounds.c | 118 * which splits it in two. This changes the set of predecessors of
122 const unsigned num_end_preds = impl->end_block->predecessors->entries;
126 set_foreach(impl->end_block->predecessors, entry) {
|
| brw_nir_lower_intersection_shader.c | 159 assert(impl->end_block->predecessors->entries == 1);
160 set_foreach(impl->end_block->predecessors, block_entry) {
|
| brw_nir_lower_shader_calls.c | 56 set_foreach(impl->end_block->predecessors, block_entry) {
94 assert(impl->end_block->predecessors->entries == 1);
|
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/ |
| nir_gs_count_vertices.c | 62 /* set_vertex_count intrinsics only appear in predecessors of the
65 set_foreach(function->impl->end_block->predecessors, entry) {
|
| nir_dominance.c | 74 set_foreach(block->predecessors, entry) {
96 if (block->predecessors->entries > 1) {
97 set_foreach(block->predecessors, entry) {
100 /* Skip unreachable predecessors */
|
| nir_opt_if.c | 45 assert(header_block->predecessors->entries == 2);
47 set_foreach(header_block->predecessors, pred_entry) {
148 assert(_mesa_set_search(header_block->predecessors, prev_block));
154 if (header_block->predecessors->entries != 2)
382 assert(_mesa_set_search(header_block->predecessors, prev_block));
388 if (header_block->predecessors->entries != 2)
659 assert(_mesa_set_search(header_block->predecessors, prev_block));
665 if (header_block->predecessors->entries != 2)
|
| /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/ |
| ir3_remove_unreachable.c | 79 succ->predecessors[pred_idx] =
80 succ->predecessors[succ->predecessors_count - 1];
|
| ir3_dominance.c | 58 struct ir3_block *pred = block->predecessors[i];
|
| ir3_array_to_ssa.c | 100 read_value_end(ctx, block->predecessors[0], arr);
121 read_value_end(ctx, block->predecessors[i], arr);
|
| ir3_lower_subgroups.c | 41 if (block->predecessors[i] == old_pred) {
42 block->predecessors[i] = new_pred;
|
| /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/ |
| bir.c | 197 * fallthrough successor has multiple predecessors.
215 assert(succ->predecessors);
217 /* Reconverge if the successor has multiple predecessors */
218 return (succ->predecessors->entries > 1);
|
| bi_test.h | 48 blk->predecessors = _mesa_set_create(blk,
|
| bi_print.c | 152 if (block->predecessors->entries) {
|
| /xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/ |
| brw_nir_tcs_workarounds.c | 134 * which splits it in two. This changes the set of predecessors of
138 const unsigned num_end_preds = impl->end_block->predecessors->entries;
142 set_foreach(impl->end_block->predecessors, entry) {
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| nir_gs_count_vertices.c | 71 /* set_vertex_and_primitive_count intrinsics only appear in predecessors of the
74 set_foreach(function->impl->end_block->predecessors, entry) {
|
| nir_opt_dce.c | 176 struct set *predecessors = nir_loop_first_block(loop)->predecessors; local
177 if (predecessors->entries == 1 &&
178 _mesa_set_next_entry(predecessors, NULL)->key == inner_state.preheader) {
|
| nir_dominance.c | 76 set_foreach(block->predecessors, entry) {
98 if (block->predecessors->entries > 1) {
99 set_foreach(block->predecessors, entry) {
102 /* Skip unreachable predecessors */
|
| nir_opt_if.c | 45 assert(header_block->predecessors->entries == 2);
47 set_foreach(header_block->predecessors, pred_entry) {
146 assert(_mesa_set_search(header_block->predecessors, prev_block));
152 if (header_block->predecessors->entries != 2)
402 assert(_mesa_set_search(header_block->predecessors, prev_block));
408 if (header_block->predecessors->entries != 2)
633 assert(_mesa_set_search(header_block->predecessors, prev_block));
639 if (header_block->predecessors->entries != 2)
|
| nir_control_flow.c | 51 _mesa_set_add(block->predecessors, pred);
57 struct set_entry *entry = _mesa_set_search(block->predecessors, pred);
61 _mesa_set_remove(block->predecessors, entry);
147 * any predecessors that need to be unlinked.
179 * predecessors point to the new block. This essentially splits the block into
192 set_foreach(block->predecessors, entry) {
548 * predecessors as the first and the same successors as the second.
556 * possibly a large number of predecessors.
|
| /xsrc/external/mit/MesaLib/dist/src/panfrost/util/ |
| pan_ir.c | 97 _mesa_set_add(successor->predecessors, block);
|
| pan_ir.h | 277 struct set *predecessors; member in struct:pan_block
305 for (_entry_##v = _mesa_set_next_entry(blk->predecessors, NULL), \
308 _entry_##v = _mesa_set_next_entry(blk->predecessors, _entry_##v), \
|
| /xsrc/external/mit/MesaLib/dist/src/asahi/compiler/ |
| agx_compiler.h | 335 struct set *predecessors; member in struct:agx_block
510 for (_entry_##v = _mesa_set_next_entry(blk->predecessors, NULL), \
513 _entry_##v = _mesa_set_next_entry(blk->predecessors, _entry_##v), \
|
| agx_print.c | 211 if (block->predecessors->entries) {
|
