Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2014 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | #ifndef ART_COMPILER_OPTIMIZING_OPTIMIZATION_H_ |
| 18 | #define ART_COMPILER_OPTIMIZING_OPTIMIZATION_H_ |
| 19 | |
Vladimir Marko | a3a3c59 | 2015-06-12 14:30:53 +0100 | [diff] [blame] | 20 | #include "base/arena_object.h" |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 21 | #include "nodes.h" |
Calin Juravle | acf735c | 2015-02-12 15:25:22 +0000 | [diff] [blame] | 22 | #include "optimizing_compiler_stats.h" |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 23 | |
Vladimir Marko | 0a51605 | 2019-10-14 13:00:44 +0000 | [diff] [blame] | 24 | namespace art { |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 25 | |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 26 | class CodeGenerator; |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 27 | class DexCompilationUnit; |
| 28 | |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 29 | /** |
| 30 | * Abstraction to implement an optimization pass. |
| 31 | */ |
Vladimir Marko | f9f6441 | 2015-09-02 14:05:49 +0100 | [diff] [blame] | 32 | class HOptimization : public ArenaObject<kArenaAllocOptimization> { |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 33 | public: |
| 34 | HOptimization(HGraph* graph, |
Calin Juravle | acf735c | 2015-02-12 15:25:22 +0000 | [diff] [blame] | 35 | const char* pass_name, |
| 36 | OptimizingCompilerStats* stats = nullptr) |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 37 | : graph_(graph), |
Calin Juravle | acf735c | 2015-02-12 15:25:22 +0000 | [diff] [blame] | 38 | stats_(stats), |
Nicolas Geoffray | 5e6916c | 2014-11-18 16:53:35 +0000 | [diff] [blame] | 39 | pass_name_(pass_name) {} |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 40 | |
| 41 | virtual ~HOptimization() {} |
| 42 | |
Wojciech Staszkiewicz | 5319d3c | 2016-08-01 17:48:59 -0700 | [diff] [blame] | 43 | // Return the name of the pass. Pass names for a single HOptimization should be of form |
| 44 | // <optimization_name> or <optimization_name>$<pass_name> for common <optimization_name> prefix. |
| 45 | // Example: 'instruction_simplifier', 'instruction_simplifier$after_bce', |
| 46 | // 'instruction_simplifier$before_codegen'. |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 47 | const char* GetPassName() const { return pass_name_; } |
| 48 | |
Aart Bik | 2477320 | 2018-04-26 10:28:51 -0700 | [diff] [blame] | 49 | // Perform the pass or analysis. Returns false if no optimizations occurred or no useful |
| 50 | // information was computed (this is best effort, returning true is always ok). |
| 51 | virtual bool Run() = 0; |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 52 | |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 53 | protected: |
| 54 | HGraph* const graph_; |
Calin Juravle | acf735c | 2015-02-12 15:25:22 +0000 | [diff] [blame] | 55 | // Used to record stats about the optimization. |
| 56 | OptimizingCompilerStats* const stats_; |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 57 | |
| 58 | private: |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 59 | // Optimization pass name. |
| 60 | const char* pass_name_; |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 61 | |
| 62 | DISALLOW_COPY_AND_ASSIGN(HOptimization); |
| 63 | }; |
| 64 | |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 65 | // Optimization passes that can be constructed by the helper method below. An enum |
| 66 | // field is preferred over a string lookup at places where performance matters. |
| 67 | // TODO: generate this table and lookup methods below automatically? |
| 68 | enum class OptimizationPass { |
Evgeny Astigeevich | 6587d91 | 2020-06-12 10:51:43 +0100 | [diff] [blame] | 69 | kAggressiveInstructionSimplifier, |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 70 | kBoundsCheckElimination, |
| 71 | kCHAGuardOptimization, |
| 72 | kCodeSinking, |
| 73 | kConstantFolding, |
| 74 | kConstructorFenceRedundancyElimination, |
| 75 | kDeadCodeElimination, |
| 76 | kGlobalValueNumbering, |
| 77 | kInductionVarAnalysis, |
| 78 | kInliner, |
| 79 | kInstructionSimplifier, |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 80 | kInvariantCodeMotion, |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 81 | kLoadStoreElimination, |
| 82 | kLoopOptimization, |
| 83 | kScheduling, |
| 84 | kSelectGenerator, |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 85 | kSideEffectsAnalysis, |
| 86 | #ifdef ART_ENABLE_CODEGEN_arm |
| 87 | kInstructionSimplifierArm, |
Vladimir Marko | d3e9c62 | 2020-08-05 12:20:28 +0100 | [diff] [blame] | 88 | kCriticalNativeAbiFixupArm, |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 89 | #endif |
| 90 | #ifdef ART_ENABLE_CODEGEN_arm64 |
| 91 | kInstructionSimplifierArm64, |
| 92 | #endif |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 93 | #ifdef ART_ENABLE_CODEGEN_x86 |
| 94 | kPcRelativeFixupsX86, |
Shalini Salomi Bodapati | dd121f6 | 2018-10-26 15:03:53 +0530 | [diff] [blame] | 95 | kInstructionSimplifierX86, |
| 96 | #endif |
| 97 | #ifdef ART_ENABLE_CODEGEN_x86_64 |
| 98 | kInstructionSimplifierX86_64, |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 99 | #endif |
| 100 | #if defined(ART_ENABLE_CODEGEN_x86) || defined(ART_ENABLE_CODEGEN_x86_64) |
| 101 | kX86MemoryOperandGeneration, |
| 102 | #endif |
Aart Bik | 2e14868 | 2018-04-18 16:11:12 -0700 | [diff] [blame] | 103 | kNone, |
| 104 | kLast = kNone |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 105 | }; |
| 106 | |
| 107 | // Lookup name of optimization pass. |
| 108 | const char* OptimizationPassName(OptimizationPass pass); |
| 109 | |
| 110 | // Lookup optimization pass by name. |
Aart Bik | 2e14868 | 2018-04-18 16:11:12 -0700 | [diff] [blame] | 111 | OptimizationPass OptimizationPassByName(const std::string& pass_name); |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 112 | |
| 113 | // Optimization definition consisting of an optimization pass |
Aart Bik | 2e14868 | 2018-04-18 16:11:12 -0700 | [diff] [blame] | 114 | // an optional alternative name (nullptr denotes default), and |
| 115 | // an optional pass dependence (kNone denotes no dependence). |
| 116 | struct OptimizationDef { |
| 117 | OptimizationDef(OptimizationPass p, const char* pn, OptimizationPass d) |
| 118 | : pass(p), pass_name(pn), depends_on(d) {} |
| 119 | OptimizationPass pass; |
| 120 | const char* pass_name; |
| 121 | OptimizationPass depends_on; |
| 122 | }; |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 123 | |
| 124 | // Helper method for optimization definition array entries. |
Aart Bik | 2e14868 | 2018-04-18 16:11:12 -0700 | [diff] [blame] | 125 | inline OptimizationDef OptDef(OptimizationPass pass, |
| 126 | const char* pass_name = nullptr, |
| 127 | OptimizationPass depends_on = OptimizationPass::kNone) { |
| 128 | return OptimizationDef(pass, pass_name, depends_on); |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 129 | } |
| 130 | |
| 131 | // Helper method to construct series of optimization passes. |
| 132 | // The array should consist of the requested optimizations |
| 133 | // and optional alternative names for repeated passes. |
| 134 | // Example: |
| 135 | // { OptPass(kConstantFolding), |
| 136 | // OptPass(Inliner), |
| 137 | // OptPass(kConstantFolding, "constant_folding$after_inlining") |
| 138 | // } |
| 139 | ArenaVector<HOptimization*> ConstructOptimizations( |
| 140 | const OptimizationDef definitions[], |
| 141 | size_t length, |
| 142 | ArenaAllocator* allocator, |
| 143 | HGraph* graph, |
| 144 | OptimizingCompilerStats* stats, |
| 145 | CodeGenerator* codegen, |
Vladimir Marko | 02ca05a | 2020-05-12 13:58:51 +0100 | [diff] [blame] | 146 | const DexCompilationUnit& dex_compilation_unit); |
Aart Bik | 2ca10eb | 2017-11-15 15:17:53 -0800 | [diff] [blame] | 147 | |
Roland Levillain | 75be283 | 2014-10-17 17:02:00 +0100 | [diff] [blame] | 148 | } // namespace art |
| 149 | |
| 150 | #endif // ART_COMPILER_OPTIMIZING_OPTIMIZATION_H_ |