| /external/deqp-deps/SPIRV-Tools/source/reduce/ |
| D | reduction_pass.cpp | 36 std::vector<std::unique_ptr<ReductionOpportunity>> opportunities = in TryApplyReduction() local
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()
58 i < std::min(index_ + granularity_, (uint32_t)opportunities.size()); in TryApplyReduction()
60 opportunities[i]->TryToApply(); in TryApplyReduction()
|
| D | operand_to_dominating_id_reduction_opportunity_finder.cpp | 63 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities, in GetOpportunitiesForDominatingInst() argument
103 opportunities->push_back( in GetOpportunitiesForDominatingInst()
|
| D | operand_to_dominating_id_reduction_opportunity_finder.h | 47 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities,
|
| /external/angle/third_party/spirv-tools/src/source/reduce/ |
| D | reduction_pass.cpp | 36 std::vector<std::unique_ptr<ReductionOpportunity>> opportunities = in TryApplyReduction() local
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()
58 i < std::min(index_ + granularity_, (uint32_t)opportunities.size()); in TryApplyReduction()
60 opportunities[i]->TryToApply(); in TryApplyReduction()
|
| D | operand_to_dominating_id_reduction_opportunity_finder.cpp | 63 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities, in GetOpportunitiesForDominatingInst() argument
103 opportunities->push_back( in GetOpportunitiesForDominatingInst()
|
| D | operand_to_dominating_id_reduction_opportunity_finder.h | 47 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities,
|
| /external/swiftshader/third_party/SPIRV-Tools/source/reduce/ |
| D | reduction_pass.cpp | 36 std::vector<std::unique_ptr<ReductionOpportunity>> opportunities = in TryApplyReduction() local
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()
58 i < std::min(index_ + granularity_, (uint32_t)opportunities.size()); in TryApplyReduction()
60 opportunities[i]->TryToApply(); in TryApplyReduction()
|
| D | operand_to_dominating_id_reduction_opportunity_finder.cpp | 63 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities, in GetOpportunitiesForDominatingInst() argument
103 opportunities->push_back( in GetOpportunitiesForDominatingInst()
|
| D | operand_to_dominating_id_reduction_opportunity_finder.h | 47 std::vector<std::unique_ptr<ReductionOpportunity>>* opportunities,
|
| /external/deqp-deps/SPIRV-Tools/test/reduce/ |
| D | merge_blocks_test.cpp | 557 auto opportunities = in MergeBlocksReductionPassTest_LoopReturn_Helper() local
562 ASSERT_EQ(opportunities.size(), 2); in MergeBlocksReductionPassTest_LoopReturn_Helper()
566 std::reverse(opportunities.begin(), opportunities.end()); in MergeBlocksReductionPassTest_LoopReturn_Helper()
570 for (auto& ri : opportunities) { in MergeBlocksReductionPassTest_LoopReturn_Helper()
|
| /external/angle/third_party/spirv-tools/src/test/reduce/ |
| D | merge_blocks_test.cpp | 557 auto opportunities = in MergeBlocksReductionPassTest_LoopReturn_Helper() local
562 ASSERT_EQ(opportunities.size(), 2); in MergeBlocksReductionPassTest_LoopReturn_Helper()
566 std::reverse(opportunities.begin(), opportunities.end()); in MergeBlocksReductionPassTest_LoopReturn_Helper()
570 for (auto& ri : opportunities) { in MergeBlocksReductionPassTest_LoopReturn_Helper()
|
| /external/swiftshader/third_party/SPIRV-Tools/test/reduce/ |
| D | merge_blocks_test.cpp | 557 auto opportunities = in MergeBlocksReductionPassTest_LoopReturn_Helper() local
562 ASSERT_EQ(opportunities.size(), 2); in MergeBlocksReductionPassTest_LoopReturn_Helper()
566 std::reverse(opportunities.begin(), opportunities.end()); in MergeBlocksReductionPassTest_LoopReturn_Helper()
570 for (auto& ri : opportunities) { in MergeBlocksReductionPassTest_LoopReturn_Helper()
|
| /external/llvm/test/CodeGen/PowerPC/ |
| D | fma-mutate.ll | 1 ; Test several VSX FMA mutation opportunities. The first one isn't a
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/PowerPC/ |
| D | fma-mutate.ll | 1 ; Test several VSX FMA mutation opportunities. The first one isn't a
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/EarlyCSE/ |
| D | memoryssa.ll | 38 ;; more load CSE opportunities.
74 ;; happens during EarlyCSE, enabling more load CSE opportunities.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/Hexagon/ |
| D | undo-dag-shift.ll | 4 ; optimization opportunities. For example
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| D | 2011-08-09-IVSimplify.ll | 4 ; expose nice opportunities for GVN.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoopUnroll/ |
| D | 2011-08-09-IVSimplify.ll | 4 ; expose nice opportunities for GVN.
|
| /external/clang/lib/CodeGen/ |
| D | README.txt | 1 IRgen optimization opportunities.
|
| /external/zopfli/ |
| D | README.zopflipng | 30 a new image format, but the opportunities for optimization within PNG are
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2001-09-18-OptimizeExceptions.txt | 32 extra code motion opportunities could also be exploited though...
|
| /external/llvm/test/CodeGen/X86/ |
| D | lea-recursion.ll | 5 ; expression reassociation which causes it to miss opportunities for
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/GVNHoist/ |
| D | hoist-pr20242.ll | 2 ; Test to demonstrate that newgvn creates opportunities for
|
| /external/swiftshader/third_party/llvm-7.0/llvm/docs/HistoricalNotes/ |
| D | 2001-09-18-OptimizeExceptions.txt | 32 extra code motion opportunities could also be exploited though...
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/ |
| D | lea-recursion.ll | 5 ; expression reassociation which causes it to miss opportunities for
|