| /third_party/mesa3d/src/compiler/nir/tests/ |
| D | control_flow_tests.cpp | 99 EXPECT_EQ(0, block_0->predecessors->entries); in TEST_F()
100 EXPECT_EQ(1, block_1->predecessors->entries); in TEST_F()
101 EXPECT_EQ(1, block_2->predecessors->entries); in TEST_F()
102 EXPECT_EQ(1, block_3->predecessors->entries); in TEST_F()
103 EXPECT_TRUE(_mesa_set_search(block_1->predecessors, block_0)); in TEST_F()
104 EXPECT_TRUE(_mesa_set_search(block_2->predecessors, block_1)); in TEST_F()
105 EXPECT_TRUE(_mesa_set_search(block_3->predecessors, block_2)); in TEST_F()
141 EXPECT_EQ(0, block_0->predecessors->entries); in TEST_F()
142 EXPECT_EQ(2, block_1->predecessors->entries); in TEST_F()
143 EXPECT_EQ(0, block_2->predecessors->entries); in TEST_F()
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/source/reduce/ |
| D | merge_blocks_reduction_opportunity.cpp | 43 const auto predecessors = context_->cfg()->preds(successor_block_->id()); in PreconditionHolds() local
44 assert(1 == predecessors.size() && in PreconditionHolds()
47 const uint32_t predecessor_id = predecessors[0]; in PreconditionHolds()
59 const auto predecessors = context_->cfg()->preds(successor_block_->id()); in Apply() local
60 assert(1 == predecessors.size() && in Apply()
63 const uint32_t predecessor_id = predecessors[0]; in Apply()
|
| /third_party/spirv-tools/source/reduce/ |
| D | merge_blocks_reduction_opportunity.cpp | 43 const auto predecessors = context_->cfg()->preds(successor_block_->id()); in PreconditionHolds() local
44 assert(1 == predecessors.size() && in PreconditionHolds()
47 const uint32_t predecessor_id = predecessors[0]; in PreconditionHolds()
59 const auto predecessors = context_->cfg()->preds(successor_block_->id()); in Apply() local
60 assert(1 == predecessors.size() && in Apply()
63 const uint32_t predecessor_id = predecessors[0]; in Apply()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/reduce/ |
| D | merge_blocks_reduction_opportunity.cpp | 43 const auto predecessors = context_->cfg()->preds(successor_block_->id()); in PreconditionHolds() local
44 assert(1 == predecessors.size() && in PreconditionHolds()
47 const uint32_t predecessor_id = predecessors[0]; in PreconditionHolds()
59 const auto predecessors = context_->cfg()->preds(successor_block_->id()); in Apply() local
60 assert(1 == predecessors.size() && in Apply()
63 const uint32_t predecessor_id = predecessors[0]; in Apply()
|
| /third_party/python/Lib/ |
| D | graphlib.py | 49 for node, predecessors in graph.items():
50 self.add(node, *predecessors)
57 def add(self, node, *predecessors): argument
77 nodeinfo.npredecessors += len(predecessors)
80 for pred in predecessors:
|
| /third_party/spirv-tools/source/fuzz/ |
| D | transformation_add_opphi_synonym.cpp | 52 std::vector<uint32_t> predecessors = ir_context->cfg()->preds(block->id()); in IsApplicable() local
55 if (predecessors.empty()) { in IsApplicable()
69 for (uint32_t pred : predecessors) { in IsApplicable()
82 uint32_t first_id = preds_to_ids[predecessors[0]]; in IsApplicable()
90 for (uint32_t pred : predecessors) { in IsApplicable()
|
| D | transformation_merge_blocks.cpp | 40 auto predecessors = ir_context->cfg()->preds(second_block->id()); in IsApplicable() local
41 if (predecessors.size() != 1) { in IsApplicable()
44 auto first_block = ir_context->cfg()->block(predecessors.at(0)); in IsApplicable()
|
| D | transformation_replace_opselect_with_conditional_branch.cpp | 82 auto predecessors = ir_context->cfg()->preds(block->id()); in IsApplicable() local
83 if (predecessors.size() != 1) { in IsApplicable()
87 uint32_t pred_id = predecessors[0]; in IsApplicable()
|
| D | fuzzer_pass.cpp | 624 auto predecessors = GetIRContext()->cfg()->preds(header_id); in GetOrCreateSimpleLoopPreheader() local
626 assert(predecessors.size() >= 2 && in GetOrCreateSimpleLoopPreheader()
631 if (predecessors.size() == 2) { in GetOrCreateSimpleLoopPreheader()
638 header_id, predecessors[0])) { in GetOrCreateSimpleLoopPreheader()
641 maybe_preheader = &*function->FindBlock(predecessors[1]); in GetOrCreateSimpleLoopPreheader()
644 maybe_preheader = &*function->FindBlock(predecessors[0]); in GetOrCreateSimpleLoopPreheader()
663 if (predecessors.size() > 2) { in GetOrCreateSimpleLoopPreheader()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| D | transformation_add_opphi_synonym.cpp | 52 std::vector<uint32_t> predecessors = ir_context->cfg()->preds(block->id()); in IsApplicable() local
55 if (predecessors.empty()) { in IsApplicable()
69 for (uint32_t pred : predecessors) { in IsApplicable()
82 uint32_t first_id = preds_to_ids[predecessors[0]]; in IsApplicable()
90 for (uint32_t pred : predecessors) { in IsApplicable()
|
| D | transformation_merge_blocks.cpp | 40 auto predecessors = ir_context->cfg()->preds(second_block->id()); in IsApplicable() local
41 if (predecessors.size() != 1) { in IsApplicable()
44 auto first_block = ir_context->cfg()->block(predecessors.at(0)); in IsApplicable()
|
| D | transformation_replace_opselect_with_conditional_branch.cpp | 82 auto predecessors = ir_context->cfg()->preds(block->id()); in IsApplicable() local
83 if (predecessors.size() != 1) { in IsApplicable()
87 uint32_t pred_id = predecessors[0]; in IsApplicable()
|
| D | fuzzer_pass.cpp | 624 auto predecessors = GetIRContext()->cfg()->preds(header_id); in GetOrCreateSimpleLoopPreheader() local
626 assert(predecessors.size() >= 2 && in GetOrCreateSimpleLoopPreheader()
631 if (predecessors.size() == 2) { in GetOrCreateSimpleLoopPreheader()
638 header_id, predecessors[0])) { in GetOrCreateSimpleLoopPreheader()
641 maybe_preheader = &*function->FindBlock(predecessors[1]); in GetOrCreateSimpleLoopPreheader()
644 maybe_preheader = &*function->FindBlock(predecessors[0]); in GetOrCreateSimpleLoopPreheader()
663 if (predecessors.size() > 2) { in GetOrCreateSimpleLoopPreheader()
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| D | transformation_add_opphi_synonym.cpp | 52 std::vector<uint32_t> predecessors = ir_context->cfg()->preds(block->id()); in IsApplicable() local
55 if (predecessors.empty()) { in IsApplicable()
69 for (uint32_t pred : predecessors) { in IsApplicable()
82 uint32_t first_id = preds_to_ids[predecessors[0]]; in IsApplicable()
90 for (uint32_t pred : predecessors) { in IsApplicable()
|
| D | transformation_merge_blocks.cpp | 40 auto predecessors = ir_context->cfg()->preds(second_block->id()); in IsApplicable() local
41 if (predecessors.size() != 1) { in IsApplicable()
44 auto first_block = ir_context->cfg()->block(predecessors.at(0)); in IsApplicable()
|
| D | transformation_replace_opselect_with_conditional_branch.cpp | 82 auto predecessors = ir_context->cfg()->preds(block->id()); in IsApplicable() local
83 if (predecessors.size() != 1) { in IsApplicable()
87 uint32_t pred_id = predecessors[0]; in IsApplicable()
|
| D | fuzzer_pass.cpp | 624 auto predecessors = GetIRContext()->cfg()->preds(header_id); in GetOrCreateSimpleLoopPreheader() local
626 assert(predecessors.size() >= 2 && in GetOrCreateSimpleLoopPreheader()
631 if (predecessors.size() == 2) { in GetOrCreateSimpleLoopPreheader()
638 header_id, predecessors[0])) { in GetOrCreateSimpleLoopPreheader()
641 maybe_preheader = &*function->FindBlock(predecessors[1]); in GetOrCreateSimpleLoopPreheader()
644 maybe_preheader = &*function->FindBlock(predecessors[0]); in GetOrCreateSimpleLoopPreheader()
663 if (predecessors.size() > 2) { in GetOrCreateSimpleLoopPreheader()
|
| D | transformation_propagate_instruction_up.cpp | 385 const auto& predecessors = ir_context->cfg()->preds(block_id); in IsApplicableToBlock() local
386 if (predecessors.empty()) { in IsApplicableToBlock()
399 return std::all_of(predecessors.begin(), predecessors.end(), in IsApplicableToBlock()
|
| /third_party/python/Doc/library/ |
| D | graphlib.rst | 33 are iterables of all predecessors of that node in the graph (the nodes that
85 .. method:: add(node, *predecessors)
87 Add a new node and its predecessors to the graph. Both the *node* and all
88 elements in *predecessors* must be hashable.
93 It is possible to add a node with no dependencies (*predecessors* is not
95 provided before is included among *predecessors* it will be automatically
96 added to the graph with no predecessors of its own.
147 returns all nodes with no predecessors, and once those are marked as
149 return all new nodes that have all their predecessors already processed.
|
| /third_party/mesa3d/src/compiler/nir/ |
| D | nir_opt_dce.c | 176 struct set *predecessors = nir_loop_first_block(loop)->predecessors; in dce_cf_list() local
177 if (predecessors->entries == 1 && in dce_cf_list()
178 _mesa_set_next_entry(predecessors, NULL)->key == inner_state.preheader) { in dce_cf_list()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyFixIrreducibleControlFlow.cpp | 80 for (auto *Pred : MBB->predecessors()) { in ReachabilityGraph()
147 for (auto *Pred : MBB->predecessors()) { in calculate()
166 for (auto *Pred : Looper->predecessors()) { in calculate()
201 for (auto *Pred : Entry->predecessors()) { in calculate()
212 for (auto *Pred : MBB->predecessors()) { in calculate()
385 for (auto *Pred : Entry->predecessors()) { in makeSingleEntryLoop()
|
| /third_party/flutter/skia/third_party/externals/spirv-tools/source/ |
| D | cfa.h | 194 const vector<BB*>& predecessors = *predecessor_func(*b); in CalculateDominators() local
197 auto res = find_if(begin(predecessors), end(predecessors), in CalculateDominators()
202 if (res == end(predecessors)) continue; in CalculateDominators()
207 for (const auto* p : predecessors) { in CalculateDominators()
|
| /third_party/skia/third_party/externals/spirv-tools/source/ |
| D | cfa.h | 193 const std::vector<BB*>& predecessors = *predecessor_func(*b); in CalculateDominators() local
196 auto res = std::find_if(std::begin(predecessors), std::end(predecessors), in CalculateDominators()
201 if (res == end(predecessors)) continue; in CalculateDominators()
206 for (const auto* p : predecessors) { in CalculateDominators()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/ |
| D | cfa.h | 193 const std::vector<BB*>& predecessors = *predecessor_func(*b); in CalculateDominators() local
196 auto res = std::find_if(std::begin(predecessors), std::end(predecessors), in CalculateDominators()
201 if (res == end(predecessors)) continue; in CalculateDominators()
206 for (const auto* p : predecessors) { in CalculateDominators()
|
| /third_party/spirv-tools/source/ |
| D | cfa.h | 236 const std::vector<BB*>& predecessors = *predecessor_func(*b); in CalculateDominators() local
239 auto res = std::find_if(std::begin(predecessors), std::end(predecessors), in CalculateDominators()
244 if (res == end(predecessors)) continue; in CalculateDominators()
249 for (const auto* p : predecessors) { in CalculateDominators()
|