| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| H A D | if_conversion.cpp | 34 DominatorAnalysis* dominators = context()->GetDominatorAnalysis(&func); in Process() local
39 if (!CheckBlock(&block, dominators, &common)) continue; in Process()
51 dominators, &block, &vn_table](Instruction* phi) { in Process()
72 dominators->Dominates(then_block, inc0)) { in Process()
92 dominators->Dominates(true_def_block, &block)) { in Process()
95 dominators->Dominates(false_def_block, &block)) { in Process()
97 } else if (CanHoistInstruction(true_value, common, dominators)) { in Process()
99 } else if (CanHoistInstruction(false_value, common, dominators)) { in Process()
105 HoistInstruction(inst_to_use, common, dominators); in Process()
117 if (true_def_block && !dominators in Process()
150 CheckBlock(BasicBlock* block, DominatorAnalysis* dominators, BasicBlock** common) CheckBlock() argument
226 HoistInstruction(Instruction* inst, BasicBlock* target_block, DominatorAnalysis* dominators) HoistInstruction() argument
259 CanHoistInstruction(Instruction* inst, BasicBlock* target_block, DominatorAnalysis* dominators) CanHoistInstruction() argument
[all...] |
| H A D | if_conversion.h | 69 bool CheckBlock(BasicBlock* block, DominatorAnalysis* dominators,
75 // |CanHoistInstruction|. |dominators| is the dominator analysis for the
78 DominatorAnalysis* dominators);
83 DominatorAnalysis* dominators);
|
| H A D | dead_branch_elim_pass.cpp | 447 DominatorAnalysis* dominators = context()->GetDominatorAnalysis(function); in FixBlockOrder()
449 for (auto iter = dominators->GetDomTree().begin(); in FixBlockOrder()
450 iter != dominators->GetDomTree().end(); ++iter) { in FixBlockOrder()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| H A D | if_conversion.cpp | 34 DominatorAnalysis* dominators = context()->GetDominatorAnalysis(&func); in Process() local
39 if (!CheckBlock(&block, dominators, &common)) continue; in Process()
51 dominators, &block, &vn_table](Instruction* phi) { in Process()
72 dominators->Dominates(then_block, inc0)) { in Process()
92 dominators->Dominates(true_def_block, &block)) { in Process()
95 dominators->Dominates(false_def_block, &block)) { in Process()
97 } else if (CanHoistInstruction(true_value, common, dominators)) { in Process()
99 } else if (CanHoistInstruction(false_value, common, dominators)) { in Process()
105 HoistInstruction(inst_to_use, common, dominators); in Process()
117 if (true_def_block && !dominators in Process()
150 CheckBlock(BasicBlock* block, DominatorAnalysis* dominators, BasicBlock** common) CheckBlock() argument
226 HoistInstruction(Instruction* inst, BasicBlock* target_block, DominatorAnalysis* dominators) HoistInstruction() argument
259 CanHoistInstruction(Instruction* inst, BasicBlock* target_block, DominatorAnalysis* dominators) CanHoistInstruction() argument
[all...] |
| H A D | if_conversion.h | 69 bool CheckBlock(BasicBlock* block, DominatorAnalysis* dominators,
75 // |CanHoistInstruction|. |dominators| is the dominator analysis for the
78 DominatorAnalysis* dominators);
83 DominatorAnalysis* dominators);
|
| H A D | dead_branch_elim_pass.cpp | 447 DominatorAnalysis* dominators = context()->GetDominatorAnalysis(function); in FixBlockOrder()
449 for (auto iter = dominators->GetDomTree().begin(); in FixBlockOrder()
450 iter != dominators->GetDomTree().end(); ++iter) { in FixBlockOrder()
|
| /third_party/spirv-tools/source/opt/ |
| H A D | if_conversion.cpp | 34 DominatorAnalysis* dominators = context()->GetDominatorAnalysis(&func); in Process() local
39 if (!CheckBlock(&block, dominators, &common)) continue; in Process()
51 dominators, &block, &vn_table](Instruction* phi) { in Process()
72 dominators->Dominates(then_block, inc0)) { in Process()
92 dominators->Dominates(true_def_block, &block)) { in Process()
95 dominators->Dominates(false_def_block, &block)) { in Process()
97 } else if (CanHoistInstruction(true_value, common, dominators)) { in Process()
99 } else if (CanHoistInstruction(false_value, common, dominators)) { in Process()
105 HoistInstruction(inst_to_use, common, dominators); in Process()
117 if (true_def_block && !dominators in Process()
150 CheckBlock(BasicBlock* block, DominatorAnalysis* dominators, BasicBlock** common) CheckBlock() argument
236 HoistInstruction(Instruction* inst, BasicBlock* target_block, DominatorAnalysis* dominators) HoistInstruction() argument
269 CanHoistInstruction(Instruction* inst, BasicBlock* target_block, DominatorAnalysis* dominators) CanHoistInstruction() argument
[all...] |
| H A D | if_conversion.h | 69 bool CheckBlock(BasicBlock* block, DominatorAnalysis* dominators,
75 // |CanHoistInstruction|. |dominators| is the dominator analysis for the
78 DominatorAnalysis* dominators);
83 DominatorAnalysis* dominators);
|
| H A D | dead_branch_elim_pass.cpp | 443 DominatorAnalysis* dominators = context()->GetDominatorAnalysis(function); in FixBlockOrder()
445 for (auto iter = dominators->GetDomTree().begin(); in FixBlockOrder()
446 iter != dominators->GetDomTree().end(); ++iter) { in FixBlockOrder()
|
| /third_party/ltp/tools/sparse/sparse-src/ |
| H A D | memops.c | 20 static void rewrite_load_instruction(struct instruction *insn, struct pseudo_list *dominators) in rewrite_load_instruction() argument
29 FOR_EACH_PTR(dominators, phi) { in rewrite_load_instruction()
42 FOR_EACH_PTR(dominators, phi) { in rewrite_load_instruction()
50 insn->phi_list = dominators; in rewrite_load_instruction()
57 struct basic_block *bb, struct pseudo_list **dominators, in find_dominating_parents()
88 if (!find_dominating_parents(insn, parent, dominators, local)) in find_dominating_parents()
98 use_pseudo(insn, phi, add_pseudo(dominators, phi)); in find_dominating_parents()
143 struct pseudo_list *dominators; in simplify_loads() local
175 dominators = NULL; in simplify_loads()
176 if (find_dominating_parents(insn, bb, &dominators, loca in simplify_loads()
56 find_dominating_parents(struct instruction *insn, struct basic_block *bb, struct pseudo_list **dominators, int local) find_dominating_parents() argument
[all...] |
| /third_party/skia/third_party/externals/spirv-tools/source/reduce/ |
| H A D | structured_construct_to_block_reduction_opportunity_finder.cpp | 36 // Regions are identified using dominators and postdominators, so we compute in GetAvailableOpportunities()
38 auto* dominators = context->GetDominatorAnalysis(function); in GetAvailableOpportunities() local
60 dominators->Dominates(entry->first, &block) && in GetAvailableOpportunities()
91 assert(dominators->Dominates(&block, merge_block) && in GetAvailableOpportunities()
|
| H A D | structured_construct_to_block_reduction_opportunity.cpp | 30 // A region of blocks is defined in terms of dominators and post-dominators, in Apply()
32 auto* dominators = context_->GetDominatorAnalysis(enclosing_function); in Apply() local
40 dominators->Dominates(header_block, &*block_it) && in Apply()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/reduce/ |
| H A D | structured_construct_to_block_reduction_opportunity_finder.cpp | 36 // Regions are identified using dominators and postdominators, so we compute in GetAvailableOpportunities()
38 auto* dominators = context->GetDominatorAnalysis(function); in GetAvailableOpportunities() local
60 dominators->Dominates(entry->first, &block) && in GetAvailableOpportunities()
91 assert(dominators->Dominates(&block, merge_block) && in GetAvailableOpportunities()
|
| H A D | structured_construct_to_block_reduction_opportunity.cpp | 30 // A region of blocks is defined in terms of dominators and post-dominators, in Apply()
32 auto* dominators = context_->GetDominatorAnalysis(enclosing_function); in Apply() local
40 dominators->Dominates(header_block, &*block_it) && in Apply()
|
| /third_party/spirv-tools/source/reduce/ |
| H A D | structured_construct_to_block_reduction_opportunity_finder.cpp | 36 // Regions are identified using dominators and postdominators, so we compute in GetAvailableOpportunities()
38 auto* dominators = context->GetDominatorAnalysis(function); in GetAvailableOpportunities() local
60 dominators->Dominates(entry->first, &block) && in GetAvailableOpportunities()
91 assert(dominators->Dominates(&block, merge_block) && in GetAvailableOpportunities()
|
| H A D | structured_construct_to_block_reduction_opportunity.cpp | 30 // A region of blocks is defined in terms of dominators and post-dominators, in Apply()
32 auto* dominators = context_->GetDominatorAnalysis(enclosing_function); in Apply() local
40 dominators->Dominates(header_block, &*block_it) && in Apply()
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | verifier.cc | 2036 ZoneVector<BitVector*> dominators(zone); in Run()
2037 dominators.resize(count, nullptr); in Run()
2043 dominators[start->id().ToSize()] = in Run()
2048 BitVector* block_doms = dominators[block->id().ToSize()]; in Run()
2056 BitVector* succ_doms = dominators[succ->id().ToSize()]; in Run()
2063 dominators[succ->id().ToSize()] = succ_doms; in Run()
2075 // Verify the immediateness of dominators. in Run()
2081 BitVector* block_doms = dominators[block->id().ToSize()]; in Run()
2086 !dominators[idom->id().ToSize()]->Contains(dom->id().ToInt())) { in Run()
|
| H A D | scheduler.cc | 1272 // We use a one-element cache for previously-seen dominators. This gets in PropagateImmediateDominators()
1683 ZoneMap<BasicBlock*, Node*> dominators(scheduler_->zone_); in SplitNode()
1691 auto& use_node = dominators[use_block]; in SplitNode()
1693 if (dominators.size() == 1u) { in SplitNode()
|