| /third_party/skia/third_party/externals/spirv-tools/source/reduce/ |
| H A D | reduction_pass.cpp | 36 std::vector<std::unique_ptr<ReductionOpportunity>> opportunities = in TryApplyReduction() local
40 // opportunities, so reduce the granularity in this case. in TryApplyReduction()
41 if (granularity_ > opportunities.size()) { in TryApplyReduction()
42 granularity_ = std::max((uint32_t)1, (uint32_t)opportunities.size()); in TryApplyReduction()
47 if (index_ >= opportunities.size()) { in TryApplyReduction()
48 // We have reached the end of the available opportunities and, therefore, in TryApplyReduction()
58 i < std::min(index_ + granularity_, (uint32_t)opportunities.size()); in TryApplyReduction()
60 opportunities[i]->TryToApply(); in TryApplyReduction()
|
| H A D | operand_to_dominating_id_reduction_opportunity_finder.cpp | 31 // (1) it is profitable for multiple opportunities to replace the same id x by in GetAvailableOpportunities()
35 // (2) We want to prioritise opportunities to replace an id with a more in GetAvailableOpportunities()
59 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities, in GetOpportunitiesForDominatingInst()
72 // cannot be any of the desired reduction opportunities in this block. in GetOpportunitiesForDominatingInst()
99 opportunities->push_back( in GetOpportunitiesForDominatingInst()
58 GetOpportunitiesForDominatingInst( std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities, opt::Instruction* candidate_dominator, opt::Function::iterator candidate_dominator_block, opt::Function* function, opt::IRContext* context) const GetOpportunitiesForDominatingInst() argument
|
| H A D | operand_to_dominating_id_reduction_opportunity_finder.h | 24 // human-readable languages of e.g. finding opportunities to replace an
47 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities,
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/reduce/ |
| H A D | reduction_pass.cpp | 36 std::vector<std::unique_ptr<ReductionOpportunity>> opportunities = in TryApplyReduction() local
40 // opportunities, so reduce the granularity in this case. in TryApplyReduction()
41 if (granularity_ > opportunities.size()) { in TryApplyReduction()
42 granularity_ = std::max((uint32_t)1, (uint32_t)opportunities.size()); in TryApplyReduction()
47 if (index_ >= opportunities.size()) { in TryApplyReduction()
48 // We have reached the end of the available opportunities and, therefore, in TryApplyReduction()
58 i < std::min(index_ + granularity_, (uint32_t)opportunities.size()); in TryApplyReduction()
60 opportunities[i]->TryToApply(); in TryApplyReduction()
|
| H A D | operand_to_dominating_id_reduction_opportunity_finder.cpp | 31 // (1) it is profitable for multiple opportunities to replace the same id x by in GetAvailableOpportunities()
35 // (2) We want to prioritise opportunities to replace an id with a more in GetAvailableOpportunities()
59 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities, in GetOpportunitiesForDominatingInst()
72 // cannot be any of the desired reduction opportunities in this block. in GetOpportunitiesForDominatingInst()
99 opportunities->push_back( in GetOpportunitiesForDominatingInst()
58 GetOpportunitiesForDominatingInst( std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities, opt::Instruction* candidate_dominator, opt::Function::iterator candidate_dominator_block, opt::Function* function, opt::IRContext* context) const GetOpportunitiesForDominatingInst() argument
|
| H A D | operand_to_dominating_id_reduction_opportunity_finder.h | 24 // human-readable languages of e.g. finding opportunities to replace an
47 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities,
|
| /third_party/spirv-tools/source/reduce/ |
| H A D | reduction_pass.cpp | 36 std::vector<std::unique_ptr<ReductionOpportunity>> opportunities = in TryApplyReduction() local
40 // opportunities, so reduce the granularity in this case. in TryApplyReduction()
41 if (granularity_ > opportunities.size()) { in TryApplyReduction()
42 granularity_ = std::max((uint32_t)1, (uint32_t)opportunities.size()); in TryApplyReduction()
47 if (index_ >= opportunities.size()) { in TryApplyReduction()
48 // We have reached the end of the available opportunities and, therefore, in TryApplyReduction()
58 i < std::min(index_ + granularity_, (uint32_t)opportunities.size()); in TryApplyReduction()
60 opportunities[i]->TryToApply(); in TryApplyReduction()
|
| H A D | operand_to_dominating_id_reduction_opportunity_finder.cpp | 31 // (1) it is profitable for multiple opportunities to replace the same id x by in GetAvailableOpportunities()
35 // (2) We want to prioritise opportunities to replace an id with a more in GetAvailableOpportunities()
59 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities, in GetOpportunitiesForDominatingInst()
72 // cannot be any of the desired reduction opportunities in this block. in GetOpportunitiesForDominatingInst()
99 opportunities->push_back( in GetOpportunitiesForDominatingInst()
58 GetOpportunitiesForDominatingInst( std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities, opt::Instruction* candidate_dominator, opt::Function::iterator candidate_dominator_block, opt::Function* function, opt::IRContext* context) const GetOpportunitiesForDominatingInst() argument
|
| H A D | operand_to_dominating_id_reduction_opportunity_finder.h | 24 // human-readable languages of e.g. finding opportunities to replace an
47 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities,
|
| /third_party/skia/third_party/externals/spirv-tools/test/reduce/ |
| H A D | merge_blocks_test.cpp | 557 auto opportunities = in MergeBlocksReductionPassTest_LoopReturn_Helper() local
562 ASSERT_EQ(opportunities.size(), 2); in MergeBlocksReductionPassTest_LoopReturn_Helper()
564 // Test applying opportunities in both orders. in MergeBlocksReductionPassTest_LoopReturn_Helper()
566 std::reverse(opportunities.begin(), opportunities.end()); in MergeBlocksReductionPassTest_LoopReturn_Helper()
570 for (auto& ri : opportunities) { in MergeBlocksReductionPassTest_LoopReturn_Helper()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/reduce/ |
| H A D | merge_blocks_test.cpp | 557 auto opportunities = in MergeBlocksReductionPassTest_LoopReturn_Helper() local
562 ASSERT_EQ(opportunities.size(), 2); in MergeBlocksReductionPassTest_LoopReturn_Helper()
564 // Test applying opportunities in both orders. in MergeBlocksReductionPassTest_LoopReturn_Helper()
566 std::reverse(opportunities.begin(), opportunities.end()); in MergeBlocksReductionPassTest_LoopReturn_Helper()
570 for (auto& ri : opportunities) { in MergeBlocksReductionPassTest_LoopReturn_Helper()
|
| /third_party/spirv-tools/test/reduce/ |
| H A D | merge_blocks_test.cpp | 557 auto opportunities = in MergeBlocksReductionPassTest_LoopReturn_Helper() local
562 ASSERT_EQ(opportunities.size(), 2); in MergeBlocksReductionPassTest_LoopReturn_Helper()
564 // Test applying opportunities in both orders. in MergeBlocksReductionPassTest_LoopReturn_Helper()
566 std::reverse(opportunities.begin(), opportunities.end()); in MergeBlocksReductionPassTest_LoopReturn_Helper()
570 for (auto& ri : opportunities) { in MergeBlocksReductionPassTest_LoopReturn_Helper()
|