blob: 2cac38b7159d41af8a697645bd6f12b3fc731c61 [file] [log] [blame]
Roland Levillain75be2832014-10-17 17:02:00 +01001/*
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#include "optimization.h"
18
Aart Bik2ca10eb2017-11-15 15:17:53 -080019#ifdef ART_ENABLE_CODEGEN_arm
Vladimir Markod3e9c622020-08-05 12:20:28 +010020#include "critical_native_abi_fixup_arm.h"
Aart Bik2ca10eb2017-11-15 15:17:53 -080021#include "instruction_simplifier_arm.h"
22#endif
23#ifdef ART_ENABLE_CODEGEN_arm64
24#include "instruction_simplifier_arm64.h"
25#endif
Aart Bik2ca10eb2017-11-15 15:17:53 -080026#ifdef ART_ENABLE_CODEGEN_x86
27#include "pc_relative_fixups_x86.h"
Shalini Salomi Bodapatidd121f62018-10-26 15:03:53 +053028#include "instruction_simplifier_x86.h"
Aart Bik2ca10eb2017-11-15 15:17:53 -080029#endif
30#if defined(ART_ENABLE_CODEGEN_x86) || defined(ART_ENABLE_CODEGEN_x86_64)
31#include "x86_memory_gen.h"
32#endif
Shalini Salomi Bodapatidd121f62018-10-26 15:03:53 +053033#ifdef ART_ENABLE_CODEGEN_x86_64
34#include "instruction_simplifier_x86_64.h"
35#endif
Aart Bik2ca10eb2017-11-15 15:17:53 -080036
37#include "bounds_check_elimination.h"
38#include "cha_guard_optimization.h"
39#include "code_sinking.h"
40#include "constant_folding.h"
41#include "constructor_fence_redundancy_elimination.h"
42#include "dead_code_elimination.h"
David Sehr9e734c72018-01-04 17:56:19 -080043#include "dex/code_item_accessors-inl.h"
Vladimir Markoa0431112018-06-25 09:32:54 +010044#include "driver/compiler_options.h"
Aart Bik2ca10eb2017-11-15 15:17:53 -080045#include "driver/dex_compilation_unit.h"
46#include "gvn.h"
47#include "induction_var_analysis.h"
48#include "inliner.h"
49#include "instruction_simplifier.h"
50#include "intrinsics.h"
51#include "licm.h"
Aart Bik2ca10eb2017-11-15 15:17:53 -080052#include "load_store_elimination.h"
53#include "loop_optimization.h"
54#include "scheduler.h"
55#include "select_generator.h"
56#include "sharpening.h"
57#include "side_effects_analysis.h"
58
59// Decide between default or alternative pass name.
60
Vladimir Marko0a516052019-10-14 13:00:44 +000061namespace art {
Aart Bik2ca10eb2017-11-15 15:17:53 -080062
63const char* OptimizationPassName(OptimizationPass pass) {
64 switch (pass) {
65 case OptimizationPass::kSideEffectsAnalysis:
66 return SideEffectsAnalysis::kSideEffectsAnalysisPassName;
67 case OptimizationPass::kInductionVarAnalysis:
68 return HInductionVarAnalysis::kInductionPassName;
Aart Bik2ca10eb2017-11-15 15:17:53 -080069 case OptimizationPass::kGlobalValueNumbering:
70 return GVNOptimization::kGlobalValueNumberingPassName;
71 case OptimizationPass::kInvariantCodeMotion:
72 return LICM::kLoopInvariantCodeMotionPassName;
73 case OptimizationPass::kLoopOptimization:
74 return HLoopOptimization::kLoopOptimizationPassName;
75 case OptimizationPass::kBoundsCheckElimination:
76 return BoundsCheckElimination::kBoundsCheckEliminationPassName;
77 case OptimizationPass::kLoadStoreElimination:
78 return LoadStoreElimination::kLoadStoreEliminationPassName;
79 case OptimizationPass::kConstantFolding:
80 return HConstantFolding::kConstantFoldingPassName;
81 case OptimizationPass::kDeadCodeElimination:
82 return HDeadCodeElimination::kDeadCodeEliminationPassName;
83 case OptimizationPass::kInliner:
84 return HInliner::kInlinerPassName;
Aart Bik2ca10eb2017-11-15 15:17:53 -080085 case OptimizationPass::kSelectGenerator:
86 return HSelectGenerator::kSelectGeneratorPassName;
Evgeny Astigeevich6587d912020-06-12 10:51:43 +010087 case OptimizationPass::kAggressiveInstructionSimplifier:
Aart Bik2ca10eb2017-11-15 15:17:53 -080088 case OptimizationPass::kInstructionSimplifier:
89 return InstructionSimplifier::kInstructionSimplifierPassName;
Aart Bik2ca10eb2017-11-15 15:17:53 -080090 case OptimizationPass::kCHAGuardOptimization:
91 return CHAGuardOptimization::kCHAGuardOptimizationPassName;
92 case OptimizationPass::kCodeSinking:
93 return CodeSinking::kCodeSinkingPassName;
94 case OptimizationPass::kConstructorFenceRedundancyElimination:
95 return ConstructorFenceRedundancyElimination::kCFREPassName;
96 case OptimizationPass::kScheduling:
97 return HInstructionScheduling::kInstructionSchedulingPassName;
98#ifdef ART_ENABLE_CODEGEN_arm
99 case OptimizationPass::kInstructionSimplifierArm:
100 return arm::InstructionSimplifierArm::kInstructionSimplifierArmPassName;
Vladimir Markod3e9c622020-08-05 12:20:28 +0100101 case OptimizationPass::kCriticalNativeAbiFixupArm:
102 return arm::CriticalNativeAbiFixupArm::kCriticalNativeAbiFixupArmPassName;
Aart Bik2ca10eb2017-11-15 15:17:53 -0800103#endif
104#ifdef ART_ENABLE_CODEGEN_arm64
105 case OptimizationPass::kInstructionSimplifierArm64:
106 return arm64::InstructionSimplifierArm64::kInstructionSimplifierArm64PassName;
107#endif
Aart Bik2ca10eb2017-11-15 15:17:53 -0800108#ifdef ART_ENABLE_CODEGEN_x86
109 case OptimizationPass::kPcRelativeFixupsX86:
110 return x86::PcRelativeFixups::kPcRelativeFixupsX86PassName;
Shalini Salomi Bodapatidd121f62018-10-26 15:03:53 +0530111 case OptimizationPass::kInstructionSimplifierX86:
112 return x86::InstructionSimplifierX86::kInstructionSimplifierX86PassName;
113#endif
114#ifdef ART_ENABLE_CODEGEN_x86_64
115 case OptimizationPass::kInstructionSimplifierX86_64:
116 return x86_64::InstructionSimplifierX86_64::kInstructionSimplifierX86_64PassName;
Aart Bik2ca10eb2017-11-15 15:17:53 -0800117#endif
118#if defined(ART_ENABLE_CODEGEN_x86) || defined(ART_ENABLE_CODEGEN_x86_64)
119 case OptimizationPass::kX86MemoryOperandGeneration:
120 return x86::X86MemoryOperandGeneration::kX86MemoryOperandGenerationPassName;
121#endif
Aart Bik2e148682018-04-18 16:11:12 -0700122 case OptimizationPass::kNone:
123 LOG(FATAL) << "kNone does not represent an actual pass";
124 UNREACHABLE();
Aart Bik2ca10eb2017-11-15 15:17:53 -0800125 }
126}
127
Aart Bik2e148682018-04-18 16:11:12 -0700128#define X(x) if (pass_name == OptimizationPassName((x))) return (x)
Aart Bik2ca10eb2017-11-15 15:17:53 -0800129
Aart Bik2e148682018-04-18 16:11:12 -0700130OptimizationPass OptimizationPassByName(const std::string& pass_name) {
Aart Bik2ca10eb2017-11-15 15:17:53 -0800131 X(OptimizationPass::kBoundsCheckElimination);
132 X(OptimizationPass::kCHAGuardOptimization);
133 X(OptimizationPass::kCodeSinking);
134 X(OptimizationPass::kConstantFolding);
135 X(OptimizationPass::kConstructorFenceRedundancyElimination);
136 X(OptimizationPass::kDeadCodeElimination);
137 X(OptimizationPass::kGlobalValueNumbering);
138 X(OptimizationPass::kInductionVarAnalysis);
139 X(OptimizationPass::kInliner);
140 X(OptimizationPass::kInstructionSimplifier);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800141 X(OptimizationPass::kInvariantCodeMotion);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800142 X(OptimizationPass::kLoadStoreElimination);
143 X(OptimizationPass::kLoopOptimization);
144 X(OptimizationPass::kScheduling);
145 X(OptimizationPass::kSelectGenerator);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800146 X(OptimizationPass::kSideEffectsAnalysis);
147#ifdef ART_ENABLE_CODEGEN_arm
148 X(OptimizationPass::kInstructionSimplifierArm);
Vladimir Markod3e9c622020-08-05 12:20:28 +0100149 X(OptimizationPass::kCriticalNativeAbiFixupArm);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800150#endif
151#ifdef ART_ENABLE_CODEGEN_arm64
152 X(OptimizationPass::kInstructionSimplifierArm64);
153#endif
Aart Bik2ca10eb2017-11-15 15:17:53 -0800154#ifdef ART_ENABLE_CODEGEN_x86
155 X(OptimizationPass::kPcRelativeFixupsX86);
156 X(OptimizationPass::kX86MemoryOperandGeneration);
157#endif
Aart Bik2e148682018-04-18 16:11:12 -0700158 LOG(FATAL) << "Cannot find optimization " << pass_name;
Aart Bik2ca10eb2017-11-15 15:17:53 -0800159 UNREACHABLE();
160}
161
162#undef X
163
164ArenaVector<HOptimization*> ConstructOptimizations(
165 const OptimizationDef definitions[],
166 size_t length,
167 ArenaAllocator* allocator,
168 HGraph* graph,
169 OptimizingCompilerStats* stats,
170 CodeGenerator* codegen,
Vladimir Marko02ca05a2020-05-12 13:58:51 +0100171 const DexCompilationUnit& dex_compilation_unit) {
Aart Bik2ca10eb2017-11-15 15:17:53 -0800172 ArenaVector<HOptimization*> optimizations(allocator->Adapter());
173
174 // Some optimizations require SideEffectsAnalysis or HInductionVarAnalysis
175 // instances. This method uses the nearest instance preceeding it in the pass
176 // name list or fails fatally if no such analysis can be found.
177 SideEffectsAnalysis* most_recent_side_effects = nullptr;
178 HInductionVarAnalysis* most_recent_induction = nullptr;
Aart Bik2ca10eb2017-11-15 15:17:53 -0800179
180 // Loop over the requested optimizations.
181 for (size_t i = 0; i < length; i++) {
Aart Bik2e148682018-04-18 16:11:12 -0700182 OptimizationPass pass = definitions[i].pass;
183 const char* alt_name = definitions[i].pass_name;
184 const char* pass_name = alt_name != nullptr
Aart Bik2ca10eb2017-11-15 15:17:53 -0800185 ? alt_name
186 : OptimizationPassName(pass);
187 HOptimization* opt = nullptr;
188
189 switch (pass) {
190 //
191 // Analysis passes (kept in most recent for subsequent passes).
192 //
193 case OptimizationPass::kSideEffectsAnalysis:
Aart Bik2e148682018-04-18 16:11:12 -0700194 opt = most_recent_side_effects = new (allocator) SideEffectsAnalysis(graph, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800195 break;
196 case OptimizationPass::kInductionVarAnalysis:
Aart Bik2e148682018-04-18 16:11:12 -0700197 opt = most_recent_induction = new (allocator) HInductionVarAnalysis(graph, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800198 break;
Aart Bik2ca10eb2017-11-15 15:17:53 -0800199 //
200 // Passes that need prior analysis.
201 //
202 case OptimizationPass::kGlobalValueNumbering:
203 CHECK(most_recent_side_effects != nullptr);
Aart Bik2e148682018-04-18 16:11:12 -0700204 opt = new (allocator) GVNOptimization(graph, *most_recent_side_effects, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800205 break;
206 case OptimizationPass::kInvariantCodeMotion:
207 CHECK(most_recent_side_effects != nullptr);
Aart Bik2e148682018-04-18 16:11:12 -0700208 opt = new (allocator) LICM(graph, *most_recent_side_effects, stats, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800209 break;
210 case OptimizationPass::kLoopOptimization:
211 CHECK(most_recent_induction != nullptr);
Aart Bik2e148682018-04-18 16:11:12 -0700212 opt = new (allocator) HLoopOptimization(
Artem Serovc8150b52019-07-31 18:28:00 +0100213 graph, *codegen, most_recent_induction, stats, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800214 break;
215 case OptimizationPass::kBoundsCheckElimination:
216 CHECK(most_recent_side_effects != nullptr && most_recent_induction != nullptr);
217 opt = new (allocator) BoundsCheckElimination(
Aart Bik2e148682018-04-18 16:11:12 -0700218 graph, *most_recent_side_effects, most_recent_induction, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800219 break;
Aart Bik2ca10eb2017-11-15 15:17:53 -0800220 //
221 // Regular passes.
222 //
223 case OptimizationPass::kConstantFolding:
Aart Bik2e148682018-04-18 16:11:12 -0700224 opt = new (allocator) HConstantFolding(graph, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800225 break;
226 case OptimizationPass::kDeadCodeElimination:
Aart Bik2e148682018-04-18 16:11:12 -0700227 opt = new (allocator) HDeadCodeElimination(graph, stats, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800228 break;
229 case OptimizationPass::kInliner: {
Mathieu Chartier698ebbc2018-01-05 11:00:42 -0800230 CodeItemDataAccessor accessor(*dex_compilation_unit.GetDexFile(),
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800231 dex_compilation_unit.GetCodeItem());
Aart Bik2ca10eb2017-11-15 15:17:53 -0800232 opt = new (allocator) HInliner(graph, // outer_graph
233 graph, // outermost_graph
234 codegen,
235 dex_compilation_unit, // outer_compilation_unit
236 dex_compilation_unit, // outermost_compilation_unit
Aart Bik2ca10eb2017-11-15 15:17:53 -0800237 stats,
Mathieu Chartier808c7a52017-12-15 11:19:33 -0800238 accessor.RegistersSize(),
Andreas Gampe3db70682018-12-26 15:12:03 -0800239 /* total_number_of_instructions= */ 0,
240 /* parent= */ nullptr,
241 /* depth= */ 0,
Aart Bik2e148682018-04-18 16:11:12 -0700242 pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800243 break;
244 }
Aart Bik2ca10eb2017-11-15 15:17:53 -0800245 case OptimizationPass::kSelectGenerator:
Vladimir Marko02ca05a2020-05-12 13:58:51 +0100246 opt = new (allocator) HSelectGenerator(graph, stats, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800247 break;
248 case OptimizationPass::kInstructionSimplifier:
Vladimir Markobb089b62018-06-28 17:30:16 +0100249 opt = new (allocator) InstructionSimplifier(graph, codegen, stats, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800250 break;
Evgeny Astigeevich6587d912020-06-12 10:51:43 +0100251 case OptimizationPass::kAggressiveInstructionSimplifier:
252 opt = new (allocator) InstructionSimplifier(graph,
253 codegen,
254 stats,
255 pass_name,
256 /* use_all_optimizations_ = */ true);
257 break;
Aart Bik2ca10eb2017-11-15 15:17:53 -0800258 case OptimizationPass::kCHAGuardOptimization:
Aart Bik2e148682018-04-18 16:11:12 -0700259 opt = new (allocator) CHAGuardOptimization(graph, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800260 break;
261 case OptimizationPass::kCodeSinking:
Aart Bik2e148682018-04-18 16:11:12 -0700262 opt = new (allocator) CodeSinking(graph, stats, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800263 break;
264 case OptimizationPass::kConstructorFenceRedundancyElimination:
Aart Bik2e148682018-04-18 16:11:12 -0700265 opt = new (allocator) ConstructorFenceRedundancyElimination(graph, stats, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800266 break;
Vladimir Marko3224f382020-06-23 14:19:53 +0100267 case OptimizationPass::kLoadStoreElimination:
268 opt = new (allocator) LoadStoreElimination(graph, stats, pass_name);
269 break;
Aart Bik2ca10eb2017-11-15 15:17:53 -0800270 case OptimizationPass::kScheduling:
271 opt = new (allocator) HInstructionScheduling(
Vladimir Markoa0431112018-06-25 09:32:54 +0100272 graph, codegen->GetCompilerOptions().GetInstructionSet(), codegen, pass_name);
Aart Bik2ca10eb2017-11-15 15:17:53 -0800273 break;
274 //
275 // Arch-specific passes.
276 //
277#ifdef ART_ENABLE_CODEGEN_arm
278 case OptimizationPass::kInstructionSimplifierArm:
279 DCHECK(alt_name == nullptr) << "arch-specific pass does not support alternative name";
280 opt = new (allocator) arm::InstructionSimplifierArm(graph, stats);
281 break;
Vladimir Markod3e9c622020-08-05 12:20:28 +0100282 case OptimizationPass::kCriticalNativeAbiFixupArm:
283 DCHECK(alt_name == nullptr) << "arch-specific pass does not support alternative name";
284 opt = new (allocator) arm::CriticalNativeAbiFixupArm(graph, stats);
285 break;
Aart Bik2ca10eb2017-11-15 15:17:53 -0800286#endif
287#ifdef ART_ENABLE_CODEGEN_arm64
288 case OptimizationPass::kInstructionSimplifierArm64:
289 DCHECK(alt_name == nullptr) << "arch-specific pass does not support alternative name";
290 opt = new (allocator) arm64::InstructionSimplifierArm64(graph, stats);
291 break;
292#endif
Aart Bik2ca10eb2017-11-15 15:17:53 -0800293#ifdef ART_ENABLE_CODEGEN_x86
294 case OptimizationPass::kPcRelativeFixupsX86:
295 DCHECK(alt_name == nullptr) << "arch-specific pass does not support alternative name";
296 opt = new (allocator) x86::PcRelativeFixups(graph, codegen, stats);
297 break;
298 case OptimizationPass::kX86MemoryOperandGeneration:
299 DCHECK(alt_name == nullptr) << "arch-specific pass does not support alternative name";
300 opt = new (allocator) x86::X86MemoryOperandGeneration(graph, codegen, stats);
301 break;
Shalini Salomi Bodapatidd121f62018-10-26 15:03:53 +0530302 case OptimizationPass::kInstructionSimplifierX86:
303 opt = new (allocator) x86::InstructionSimplifierX86(graph, codegen, stats);
304 break;
305#endif
306#ifdef ART_ENABLE_CODEGEN_x86_64
307 case OptimizationPass::kInstructionSimplifierX86_64:
308 opt = new (allocator) x86_64::InstructionSimplifierX86_64(graph, codegen, stats);
309 break;
Aart Bik2ca10eb2017-11-15 15:17:53 -0800310#endif
Aart Bik2e148682018-04-18 16:11:12 -0700311 case OptimizationPass::kNone:
312 LOG(FATAL) << "kNone does not represent an actual pass";
313 UNREACHABLE();
Aart Bik2ca10eb2017-11-15 15:17:53 -0800314 } // switch
315
316 // Add each next optimization to result vector.
317 CHECK(opt != nullptr);
David Srbecky346fd962020-07-27 16:51:00 +0100318 DCHECK_STREQ(pass_name, opt->GetPassName()); // Consistency check.
Aart Bik2ca10eb2017-11-15 15:17:53 -0800319 optimizations.push_back(opt);
320 }
321
322 return optimizations;
323}
324
Roland Levillain75be2832014-10-17 17:02:00 +0100325} // namespace art