Home
last modified time | relevance | path

Searched refs:successors (Results 1 - 25 of 219) sorted by relevance

123456789

/third_party/mesa3d/src/compiler/nir/tests/
H A Dcontrol_flow_tests.cpp90 /* Verify the successors and predecessors. */ in TEST_F()
91 EXPECT_EQ(block_1, block_0->successors[0]); in TEST_F()
92 EXPECT_EQ(NULL, block_0->successors[1]); in TEST_F()
93 EXPECT_EQ(block_2, block_1->successors[0]); in TEST_F()
94 EXPECT_EQ(NULL, block_1->successors[1]); in TEST_F()
95 EXPECT_EQ(block_3, block_2->successors[0]); in TEST_F()
96 EXPECT_EQ(NULL, block_2->successors[1]); in TEST_F()
97 EXPECT_EQ(NULL, block_3->successors[0]); in TEST_F()
98 EXPECT_EQ(NULL, block_3->successors[1]); in TEST_F()
131 * Re-verify the predecessors and successors in TEST_F()
[all...]
/third_party/mesa3d/src/compiler/nir/
H A Dnir_control_flow.c67 pred->successors[0] = succ1; in link_blocks()
71 pred->successors[1] = succ2; in link_blocks()
79 if (pred->successors[0] == succ) { in unlink_blocks()
80 pred->successors[0] = pred->successors[1]; in unlink_blocks()
81 pred->successors[1] = NULL; in unlink_blocks()
83 assert(pred->successors[1] == succ); in unlink_blocks()
84 pred->successors[1] = NULL; in unlink_blocks()
93 if (block->successors[1] != NULL) in unlink_block_successors()
94 unlink_blocks(block, block->successors[ in unlink_block_successors()
[all...]
H A Dnir_validate.c1030 validate_assert(state, block->successors[0] == state->impl->end_block); in validate_jump_instr()
1031 validate_assert(state, block->successors[1] == NULL); in validate_jump_instr()
1042 validate_assert(state, block->successors[0] == after); in validate_jump_instr()
1044 validate_assert(state, block->successors[1] == NULL); in validate_jump_instr()
1054 validate_assert(state, block->successors[0] == first); in validate_jump_instr()
1056 validate_assert(state, block->successors[1] == NULL); in validate_jump_instr()
1063 validate_assert(state, instr->target == block->successors[0]); in validate_jump_instr()
1070 validate_assert(state, instr->target == block->successors[1]); in validate_jump_instr()
1071 validate_assert(state, instr->else_target == block->successors[0]); in validate_jump_instr()
1220 if (block->successors[ in validate_block_predecessors()
[all...]
H A Dnir_lower_goto_ifs.c220 assert(!target->successors[0]); /* target is endblock */ in route_to()
494 if (block->successors[i] && block->successors[i]->successors[0] && in inside_outside()
495 !_mesa_set_search(loop_heads, block->successors[i])) { in inside_outside()
496 _mesa_set_add(reach, block->successors[i]); in inside_outside()
890 if (block->successors[0]->successors[0]) /* it is not the end_block */ in nir_structurize()
891 _mesa_set_add(reach, block->successors[0]); in nir_structurize()
892 if (block->successors[ in nir_structurize()
[all...]
H A Dnir_dominance.c330 if (block->successors[0]) in nir_dump_cfg_impl()
331 fprintf(fp, "\t%u -> %u\n", block->index, block->successors[0]->index); in nir_dump_cfg_impl()
332 if (block->successors[1]) in nir_dump_cfg_impl()
333 fprintf(fp, "\t%u -> %u\n", block->index, block->successors[1]->index); in nir_dump_cfg_impl()
/third_party/mesa3d/src/freedreno/ir3/
H A Dir3_legalize.c361 * successors: in legalize_block()
363 for (unsigned i = 0; i < ARRAY_SIZE(block->successors); i++) { in legalize_block()
364 if (!block->successors[i]) in legalize_block()
366 struct ir3_legalize_block_data *pbd = block->successors[i]->data; in legalize_block()
449 if (!block->successors[0]) in resolve_dest_block()
459 if (block->successors[1] == NULL) { in resolve_dest_block()
461 return block->successors[0]; in resolve_dest_block()
472 if (block->successors[0]->index <= block->index) in resolve_dest_block()
474 return block->successors[0]; in resolve_dest_block()
487 * fall through to any of the physical successors o in remove_unused_block()
[all...]
H A Dir3_lower_subgroups.c175 for (unsigned i = 0; i < ARRAY_SIZE(before_block->successors); i++) { in split_block()
176 after_block->successors[i] = before_block->successors[i]; in split_block()
177 if (after_block->successors[i]) in split_block()
178 replace_pred(after_block->successors[i], before_block, after_block); in split_block()
191 before_block->successors[0] = before_block->successors[1] = NULL; in split_block()
218 pred->successors[index] = succ; in link_blocks()
/third_party/skia/third_party/externals/spirv-tools/tools/cfg/
H A Dbin_to_dot.cpp58 void FlushBlock(const std::vector<uint32_t>& successors);
104 std::vector<uint32_t> successors{inst.words[2]}; in HandleInstruction()
106 successors.push_back(inst.words[inst.operands[i].offset]); in HandleInstruction()
108 FlushBlock(successors); in HandleInstruction()
131 void DotConverter::FlushBlock(const std::vector<uint32_t>& successors) { in FlushBlock() argument
140 for (auto successor : successors) { in FlushBlock()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/tools/cfg/
H A Dbin_to_dot.cpp58 void FlushBlock(const std::vector<uint32_t>& successors);
104 std::vector<uint32_t> successors{inst.words[2]}; in HandleInstruction()
106 successors.push_back(inst.words[inst.operands[i].offset]); in HandleInstruction()
108 FlushBlock(successors); in HandleInstruction()
131 void DotConverter::FlushBlock(const std::vector<uint32_t>& successors) { in FlushBlock() argument
140 for (auto successor : successors) { in FlushBlock()
/third_party/spirv-tools/tools/cfg/
H A Dbin_to_dot.cpp58 void FlushBlock(const std::vector<uint32_t>& successors);
104 std::vector<uint32_t> successors{inst.words[2]}; in HandleInstruction()
106 successors.push_back(inst.words[inst.operands[i].offset]); in HandleInstruction()
108 FlushBlock(successors); in HandleInstruction()
131 void DotConverter::FlushBlock(const std::vector<uint32_t>& successors) { in FlushBlock() argument
140 for (auto successor : successors) { in FlushBlock()
/third_party/node/deps/v8/src/compiler/backend/
H A Dframe-elider.cc50 for (RpoNumber& succ : block->successors()) { in MarkDeConstruction()
68 for (RpoNumber& succ : block->successors()) { in MarkDeConstruction()
100 if (block->successors().empty()) return false; in PropagateIntoBlock()
115 // For single successors, propagate the needs_frame information. in PropagateIntoBlock()
117 InstructionBlockAt(block->successors()[0])->needs_frame(); in PropagateIntoBlock()
119 // For multiple successors, each successor must only have a single in PropagateIntoBlock()
124 for (RpoNumber& succ : block->successors()) { in PropagateIntoBlock()
/third_party/mesa3d/src/panfrost/util/
H A Dpan_ir.c88 for (unsigned i = 0; i < ARRAY_SIZE(block->successors); ++i) { in pan_block_add_successor()
89 if (block->successors[i]) { in pan_block_add_successor()
90 if (block->successors[i] == successor) in pan_block_add_successor()
96 block->successors[i] = successor; in pan_block_add_successor()
101 unreachable("Too many successors"); in pan_block_add_successor()
H A Dpan_ir.h393 struct pan_block *successors[2]; member
414 for (_v = (pan_block **) &blk->successors[0], \
416 v != NULL && _v < (pan_block **) &blk->successors[2]; \
432 assert(!last->successors[0] && !last->successors[1]); in pan_exit_block()
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dnir.c366 if (block_nir->successors[0] == impl->end_block) in gpir_emit_function()
367 block->successors[0] = NULL; in gpir_emit_function()
369 block->successors[0] = comp->blocks[block_nir->successors[0]->index]; in gpir_emit_function()
370 block->successors[1] = NULL; in gpir_emit_function()
372 if (block_nir->successors[1] != NULL) { in gpir_emit_function()
383 branch->dest = comp->blocks[block_nir->successors[1]->index]; in gpir_emit_function()
384 block->successors[1] = branch->dest; in gpir_emit_function()
389 assert(block_nir->successors[0]->index == block_nir->index + 1); in gpir_emit_function()
390 } else if (block_nir->successors[ in gpir_emit_function()
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DRangeTreeConverterTest.java131 assertThat(nfa.successors(node)).hasSize(1); in assertOutEdge()
132 Node target = Iterables.getOnlyElement(nfa.successors(node)); in assertOutEdge()
139 assertThat(nfa.successors(node)).hasSize(edges.length); in assertOutEdges()
140 List<Edge> out = nfa.successors(node).stream() in assertOutEdges()
149 return nfa.successors(node).stream() in follow()
/third_party/python/Lib/
H A Dgraphlib.py10 __slots__ = "node", "npredecessors", "successors"
23 self.successors = []
84 pred_info.successors.append(node)
189 # Go to all the successors and reduce the number of predecessors, collecting all the ones
191 for successor in nodeinfo.successors:
218 itstack.append(iter(n2i[node].successors).__next__)
/third_party/mesa3d/src/gallium/drivers/vc4/
H A Dvc4_qir.c555 if (block->successors[1]) { in qir_dump()
557 block->successors[0]->index, in qir_dump()
558 block->successors[1]->index); in qir_dump()
559 } else if (block->successors[0]) { in qir_dump()
561 block->successors[0]->index); in qir_dump()
680 if (predecessor->successors[0]) { in qir_link_blocks()
681 assert(!predecessor->successors[1]); in qir_link_blocks()
682 predecessor->successors[1] = successor; in qir_link_blocks()
684 predecessor->successors[0] = successor; in qir_link_blocks()
/third_party/glslang/SPIRV/
H A DInReadableOrder.cpp68 // successors. Delays merge-block and continue-block processing until all
96 const auto& successors = block->getSuccessors(); in visit() local
97 for (auto it = successors.cbegin(); it != successors.cend(); ++it) in visit()
H A DspvIR.h204 void addPredecessor(Block* pred) { predecessors.push_back(pred); pred->successors.push_back(this);} in addPredecessor()
207 const std::vector<Block*>& getSuccessors() const { return successors; } in getSuccessors()
236 successors.clear(); in rewriteAsCanonicalUnreachableMerge()
248 successors.clear(); in rewriteAsCanonicalUnreachableContinue()
254 successors.push_back(header); in rewriteAsCanonicalUnreachableContinue()
291 std::vector<Block*> predecessors, successors; member in spv::Block
/third_party/mesa3d/src/gallium/drivers/lima/ir/pp/
H A Dliveness.c216 ppir_block *succ = block->successors[i]; in ppir_liveness_compute_live_sets()
223 assert(succ->successors[0] && !succ->successors[1]); in ppir_liveness_compute_live_sets()
224 succ = succ->successors[0]; in ppir_liveness_compute_live_sets()
H A Dnir.c598 assert(comp->current_block->successors[0]); in ppir_emit_jump()
599 assert(!comp->current_block->successors[1]); in ppir_emit_jump()
600 jump_block = comp->current_block->successors[0]; in ppir_emit_jump()
704 assert(nblock->successors[0]); in ppir_emit_if()
705 assert(!nblock->successors[1]); in ppir_emit_if()
706 else_branch->target = ppir_get_block(comp, nblock->successors[0]); in ppir_emit_if()
708 list_addtail(&block->successors[1]->list, &comp->block_list); in ppir_emit_if()
715 assert(last_then_block->successors[0]); in ppir_emit_if()
716 assert(!last_then_block->successors[1]); in ppir_emit_if()
724 after_branch->target = ppir_get_block(comp, last_then_block->successors[ in ppir_emit_if()
[all...]
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbir.c232 if (!block->successors[0]) { in bi_reconverge_branches()
233 assert(!block->successors[1]); in bi_reconverge_branches()
237 /* Multiple successors? We're branching */ in bi_reconverge_branches()
238 if (block->successors[1]) in bi_reconverge_branches()
242 struct bi_block *succ = block->successors[0]; in bi_reconverge_branches()
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaFlattener.java109 Node target = Iterables.getOnlyElement(graph.successors(node)); in visitSubgraph()
115 for (Node t : graph.successors(node)) { in visitSubgraph()
190 for (Node target : graph.successors(node)) { in recursivelySetMaxPathLength()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Ddominator_tree.cpp24 // 1 - Compute the successors and predecessors for each BasicBlock. We add a
28 // all BasicBlocks. Using the successors (or for postdominator, predecessors)
31 // the predecessors list (or for postdominator, successors). This will give us a
58 static void DepthFirstSearch(const BBType* bb, SuccessorLambda successors, in DepthFirstSearch() argument
62 CFA<BBType>::DepthFirstTraversal(bb, successors, pre, post, nop_backedge); in DepthFirstSearch()
77 SuccessorLambda successors, in DepthFirstSearchPostOrder()
81 DepthFirstSearch(bb, successors, nop_preorder, post); in DepthFirstSearchPostOrder()
90 // Helper class to compute predecessors and successors for each Basic Block in a
94 // functions which take as parameter an std::function returning the successors
97 // When computing the post-dominator tree, all edges are inverted. So successors
76 DepthFirstSearchPostOrder(const BBType* bb, SuccessorLambda successors, PostLambda post) DepthFirstSearchPostOrder() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Ddominator_tree.cpp24 // 1 - Compute the successors and predecessors for each BasicBlock. We add a
28 // all BasicBlocks. Using the successors (or for postdominator, predecessors)
31 // the predecessors list (or for postdominator, successors). This will give us a
58 static void DepthFirstSearch(const BBType* bb, SuccessorLambda successors, in DepthFirstSearch() argument
62 CFA<BBType>::DepthFirstTraversal(bb, successors, pre, post, nop_backedge); in DepthFirstSearch()
77 SuccessorLambda successors, in DepthFirstSearchPostOrder()
81 DepthFirstSearch(bb, successors, nop_preorder, post); in DepthFirstSearchPostOrder()
90 // Helper class to compute predecessors and successors for each Basic Block in a
94 // functions which take as parameter an std::function returning the successors
97 // When computing the post-dominator tree, all edges are inverted. So successors
76 DepthFirstSearchPostOrder(const BBType* bb, SuccessorLambda successors, PostLambda post) DepthFirstSearchPostOrder() argument
[all...]

Completed in 18 milliseconds

123456789