blob: 0c6436235ffe8ffbe37062881ee4679cc1d0ac0e [file] [log] [blame]
Nicolas Geoffraye53798a2014-12-01 10:31:54 +00001/*
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_INLINER_H_
18#define ART_COMPILER_OPTIMIZING_INLINER_H_
19
Andreas Gampea5b09a62016-11-17 15:21:22 -080020#include "dex_file_types.h"
Nicolas Geoffraye53798a2014-12-01 10:31:54 +000021#include "invoke_type.h"
22#include "optimization.h"
23
24namespace art {
25
Vladimir Markodc151b22015-10-15 18:02:30 +010026class CodeGenerator;
Nicolas Geoffraye53798a2014-12-01 10:31:54 +000027class CompilerDriver;
28class DexCompilationUnit;
29class HGraph;
30class HInvoke;
31class OptimizingCompilerStats;
32
33class HInliner : public HOptimization {
34 public:
35 HInliner(HGraph* outer_graph,
Nicolas Geoffray73be1e82015-09-17 15:22:56 +010036 HGraph* outermost_graph,
Vladimir Markodc151b22015-10-15 18:02:30 +010037 CodeGenerator* codegen,
Nicolas Geoffraye53798a2014-12-01 10:31:54 +000038 const DexCompilationUnit& outer_compilation_unit,
Nicolas Geoffray9437b782015-03-25 10:08:51 +000039 const DexCompilationUnit& caller_compilation_unit,
Nicolas Geoffraye53798a2014-12-01 10:31:54 +000040 CompilerDriver* compiler_driver,
Mathieu Chartiere8a3c572016-10-11 16:52:17 -070041 VariableSizedHandleScope* handles,
Nicolas Geoffrayef87c5d2015-01-30 12:41:14 +000042 OptimizingCompilerStats* stats,
Nicolas Geoffray5949fa02015-12-18 10:57:10 +000043 size_t total_number_of_dex_registers,
44 size_t depth)
David Brazdil69ba7b72015-06-23 18:27:30 +010045 : HOptimization(outer_graph, kInlinerPassName, stats),
Nicolas Geoffray73be1e82015-09-17 15:22:56 +010046 outermost_graph_(outermost_graph),
Nicolas Geoffraye53798a2014-12-01 10:31:54 +000047 outer_compilation_unit_(outer_compilation_unit),
Nicolas Geoffray9437b782015-03-25 10:08:51 +000048 caller_compilation_unit_(caller_compilation_unit),
Vladimir Markodc151b22015-10-15 18:02:30 +010049 codegen_(codegen),
Nicolas Geoffraye53798a2014-12-01 10:31:54 +000050 compiler_driver_(compiler_driver),
Nicolas Geoffray5949fa02015-12-18 10:57:10 +000051 total_number_of_dex_registers_(total_number_of_dex_registers),
Nicolas Geoffray454a4812015-06-09 10:37:32 +010052 depth_(depth),
Nicolas Geoffraye418dda2015-08-11 20:03:09 -070053 number_of_inlined_instructions_(0),
Nicolas Geoffray454a4812015-06-09 10:37:32 +010054 handles_(handles) {}
Nicolas Geoffraye53798a2014-12-01 10:31:54 +000055
56 void Run() OVERRIDE;
57
Andreas Gampe7c3952f2015-02-19 18:21:24 -080058 static constexpr const char* kInlinerPassName = "inliner";
59
Nicolas Geoffraye53798a2014-12-01 10:31:54 +000060 private:
Nicolas Geoffraye418dda2015-08-11 20:03:09 -070061 bool TryInline(HInvoke* invoke_instruction);
Nicolas Geoffray73be1e82015-09-17 15:22:56 +010062
63 // Try to inline `resolved_method` in place of `invoke_instruction`. `do_rtp` is whether
Nicolas Geoffray55bd7492016-02-16 15:37:12 +000064 // reference type propagation can run after the inlining. If the inlining is successful, this
Mingyao Yang063fc772016-08-02 11:02:54 -070065 // method will replace and remove the `invoke_instruction`. If `cha_devirtualize` is true,
66 // a CHA guard needs to be added for the inlining.
67 bool TryInlineAndReplace(HInvoke* invoke_instruction,
68 ArtMethod* resolved_method,
69 bool do_rtp,
70 bool cha_devirtualize)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -070071 REQUIRES_SHARED(Locks::mutator_lock_);
Nicolas Geoffray73be1e82015-09-17 15:22:56 +010072
Nicolas Geoffray55bd7492016-02-16 15:37:12 +000073 bool TryBuildAndInline(HInvoke* invoke_instruction,
74 ArtMethod* resolved_method,
75 HInstruction** return_replacement)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -070076 REQUIRES_SHARED(Locks::mutator_lock_);
Nicolas Geoffray55bd7492016-02-16 15:37:12 +000077
78 bool TryBuildAndInlineHelper(HInvoke* invoke_instruction,
79 ArtMethod* resolved_method,
80 bool same_dex_file,
81 HInstruction** return_replacement);
82
Roland Levillaina3aef2e2016-04-06 17:45:58 +010083 // Run simple optimizations on `callee_graph`.
84 // Returns the number of inlined instructions.
85 size_t RunOptimizations(HGraph* callee_graph,
86 const DexFile::CodeItem* code_item,
87 const DexCompilationUnit& dex_compilation_unit);
88
Vladimir Markobe10e8e2016-01-22 12:09:44 +000089 // Try to recognize known simple patterns and replace invoke call with appropriate instructions.
Nicolas Geoffray55bd7492016-02-16 15:37:12 +000090 bool TryPatternSubstitution(HInvoke* invoke_instruction,
91 ArtMethod* resolved_method,
92 HInstruction** return_replacement)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -070093 REQUIRES_SHARED(Locks::mutator_lock_);
Vladimir Markobe10e8e2016-01-22 12:09:44 +000094
95 // Create a new HInstanceFieldGet.
Vladimir Marko354efa62016-02-04 19:46:56 +000096 HInstanceFieldGet* CreateInstanceFieldGet(Handle<mirror::DexCache> dex_cache,
Vladimir Markobe10e8e2016-01-22 12:09:44 +000097 uint32_t field_index,
98 HInstruction* obj);
99 // Create a new HInstanceFieldSet.
Vladimir Marko354efa62016-02-04 19:46:56 +0000100 HInstanceFieldSet* CreateInstanceFieldSet(Handle<mirror::DexCache> dex_cache,
Vladimir Markobe10e8e2016-01-22 12:09:44 +0000101 uint32_t field_index,
102 HInstruction* obj,
103 HInstruction* value);
104
Nicolas Geoffray73be1e82015-09-17 15:22:56 +0100105 // Try to inline the target of a monomorphic call. If successful, the code
106 // in the graph will look like:
107 // if (receiver.getClass() != ic.GetMonomorphicType()) deopt
108 // ... // inlined code
109 bool TryInlineMonomorphicCall(HInvoke* invoke_instruction,
110 ArtMethod* resolved_method,
Nicolas Geoffraye51ca8b2016-11-22 14:49:31 +0000111 Handle<mirror::ObjectArray<mirror::Class>> classes)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -0700112 REQUIRES_SHARED(Locks::mutator_lock_);
Nicolas Geoffray73be1e82015-09-17 15:22:56 +0100113
Nicolas Geoffray916cc1d2016-02-18 11:12:31 +0000114 // Try to inline targets of a polymorphic call.
Nicolas Geoffray73be1e82015-09-17 15:22:56 +0100115 bool TryInlinePolymorphicCall(HInvoke* invoke_instruction,
116 ArtMethod* resolved_method,
Nicolas Geoffraye51ca8b2016-11-22 14:49:31 +0000117 Handle<mirror::ObjectArray<mirror::Class>> classes)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -0700118 REQUIRES_SHARED(Locks::mutator_lock_);
Nicolas Geoffray73be1e82015-09-17 15:22:56 +0100119
Nicolas Geoffray916cc1d2016-02-18 11:12:31 +0000120 bool TryInlinePolymorphicCallToSameTarget(HInvoke* invoke_instruction,
121 ArtMethod* resolved_method,
Nicolas Geoffraye51ca8b2016-11-22 14:49:31 +0000122 Handle<mirror::ObjectArray<mirror::Class>> classes)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -0700123 REQUIRES_SHARED(Locks::mutator_lock_);
Nicolas Geoffray916cc1d2016-02-18 11:12:31 +0000124
Mingyao Yang063fc772016-08-02 11:02:54 -0700125 // Try CHA-based devirtualization to change virtual method calls into
126 // direct calls.
127 // Returns the actual method that resolved_method can be devirtualized to.
128 ArtMethod* TryCHADevirtualization(ArtMethod* resolved_method)
129 REQUIRES_SHARED(Locks::mutator_lock_);
130
131 // Add a CHA guard for a CHA-based devirtualized call. A CHA guard checks a
132 // should_deoptimize flag and if it's true, does deoptimization.
133 void AddCHAGuard(HInstruction* invoke_instruction,
134 uint32_t dex_pc,
135 HInstruction* cursor,
136 HBasicBlock* bb_cursor);
Nicolas Geoffray916cc1d2016-02-18 11:12:31 +0000137
Nicolas Geoffraya42363f2015-12-17 14:57:09 +0000138 HInstanceFieldGet* BuildGetReceiverClass(ClassLinker* class_linker,
139 HInstruction* receiver,
140 uint32_t dex_pc) const
Andreas Gampebdf7f1c2016-08-30 16:38:47 -0700141 REQUIRES_SHARED(Locks::mutator_lock_);
Nicolas Geoffraya42363f2015-12-17 14:57:09 +0000142
David Brazdil94ab38f2016-06-21 17:48:19 +0100143 void FixUpReturnReferenceType(ArtMethod* resolved_method, HInstruction* return_replacement)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -0700144 REQUIRES_SHARED(Locks::mutator_lock_);
David Brazdil94ab38f2016-06-21 17:48:19 +0100145
146 // Creates an instance of ReferenceTypeInfo from `klass` if `klass` is
147 // admissible (see ReferenceTypePropagation::IsAdmissible for details).
148 // Otherwise returns inexact Object RTI.
Andreas Gampebdf7f1c2016-08-30 16:38:47 -0700149 ReferenceTypeInfo GetClassRTI(mirror::Class* klass) REQUIRES_SHARED(Locks::mutator_lock_);
David Brazdil94ab38f2016-06-21 17:48:19 +0100150
151 bool ArgumentTypesMoreSpecific(HInvoke* invoke_instruction, ArtMethod* resolved_method)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -0700152 REQUIRES_SHARED(Locks::mutator_lock_);
David Brazdil94ab38f2016-06-21 17:48:19 +0100153
154 bool ReturnTypeMoreSpecific(HInvoke* invoke_instruction, HInstruction* return_replacement)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -0700155 REQUIRES_SHARED(Locks::mutator_lock_);
Vladimir Markobe10e8e2016-01-22 12:09:44 +0000156
Nicolas Geoffray916cc1d2016-02-18 11:12:31 +0000157 // Add a type guard on the given `receiver`. This will add to the graph:
158 // i0 = HFieldGet(receiver, klass)
159 // i1 = HLoadClass(class_index, is_referrer)
160 // i2 = HNotEqual(i0, i1)
161 //
162 // And if `with_deoptimization` is true:
163 // HDeoptimize(i2)
164 //
165 // The method returns the `HNotEqual`, that will be used for polymorphic inlining.
166 HInstruction* AddTypeGuard(HInstruction* receiver,
167 HInstruction* cursor,
168 HBasicBlock* bb_cursor,
Andreas Gampea5b09a62016-11-17 15:21:22 -0800169 dex::TypeIndex class_index,
Nicolas Geoffray56876342016-12-16 16:09:08 +0000170 mirror::Class* klass,
Nicolas Geoffray916cc1d2016-02-18 11:12:31 +0000171 HInstruction* invoke_instruction,
172 bool with_deoptimization)
Andreas Gampebdf7f1c2016-08-30 16:38:47 -0700173 REQUIRES_SHARED(Locks::mutator_lock_);
Nicolas Geoffray916cc1d2016-02-18 11:12:31 +0000174
175 /*
176 * Ad-hoc implementation for implementing a diamond pattern in the graph for
177 * polymorphic inlining:
178 * 1) `compare` becomes the input of the new `HIf`.
179 * 2) Everything up until `invoke_instruction` is in the then branch (could
180 * contain multiple blocks).
181 * 3) `invoke_instruction` is moved to the otherwise block.
182 * 4) If `return_replacement` is not null, the merge block will have
183 * a phi whose inputs are `return_replacement` and `invoke_instruction`.
184 *
185 * Before:
186 * Block1
187 * compare
188 * ...
189 * invoke_instruction
190 *
191 * After:
192 * Block1
193 * compare
194 * if
195 * / \
196 * / \
197 * Then block Otherwise block
198 * ... invoke_instruction
199 * \ /
200 * \ /
201 * Merge block
202 * phi(return_replacement, invoke_instruction)
203 */
204 void CreateDiamondPatternForPolymorphicInline(HInstruction* compare,
205 HInstruction* return_replacement,
206 HInstruction* invoke_instruction);
207
Nicolas Geoffray73be1e82015-09-17 15:22:56 +0100208 HGraph* const outermost_graph_;
Nicolas Geoffraye53798a2014-12-01 10:31:54 +0000209 const DexCompilationUnit& outer_compilation_unit_;
Nicolas Geoffray9437b782015-03-25 10:08:51 +0000210 const DexCompilationUnit& caller_compilation_unit_;
Vladimir Markodc151b22015-10-15 18:02:30 +0100211 CodeGenerator* const codegen_;
Nicolas Geoffraye53798a2014-12-01 10:31:54 +0000212 CompilerDriver* const compiler_driver_;
Nicolas Geoffray5949fa02015-12-18 10:57:10 +0000213 const size_t total_number_of_dex_registers_;
Nicolas Geoffrayef87c5d2015-01-30 12:41:14 +0000214 const size_t depth_;
Nicolas Geoffraye418dda2015-08-11 20:03:09 -0700215 size_t number_of_inlined_instructions_;
Mathieu Chartiere8a3c572016-10-11 16:52:17 -0700216 VariableSizedHandleScope* const handles_;
Nicolas Geoffraye53798a2014-12-01 10:31:54 +0000217
218 DISALLOW_COPY_AND_ASSIGN(HInliner);
219};
220
221} // namespace art
222
223#endif // ART_COMPILER_OPTIMIZING_INLINER_H_