blob: 1ed190d328ee1be3167818301c7a20b72824efb6 [file] [log] [blame]
Nicolas Geoffray26a25ef2014-09-30 13:54:09 +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 "prepare_for_register_allocation.h"
18
Andreas Gampee2abbc62017-09-15 11:59:26 -070019#include "dex_file_types.h"
Nicolas Geoffray5d37c152017-01-12 13:25:19 +000020#include "jni_internal.h"
Igor Murashkin6ef45672017-08-08 13:59:55 -070021#include "optimizing_compiler_stats.h"
Nicolas Geoffray5d37c152017-01-12 13:25:19 +000022#include "well_known_classes.h"
23
Nicolas Geoffray26a25ef2014-09-30 13:54:09 +010024namespace art {
25
26void PrepareForRegisterAllocation::Run() {
27 // Order does not matter.
Vladimir Marko2c45bc92016-10-25 16:54:12 +010028 for (HBasicBlock* block : GetGraph()->GetReversePostOrder()) {
Nicolas Geoffray26a25ef2014-09-30 13:54:09 +010029 // No need to visit the phis.
Andreas Gampe277ccbd2014-11-03 21:36:10 -080030 for (HInstructionIterator inst_it(block->GetInstructions()); !inst_it.Done();
31 inst_it.Advance()) {
32 inst_it.Current()->Accept(this);
Nicolas Geoffray26a25ef2014-09-30 13:54:09 +010033 }
34 }
35}
36
37void PrepareForRegisterAllocation::VisitNullCheck(HNullCheck* check) {
38 check->ReplaceWith(check->InputAt(0));
39}
40
Calin Juravled0d48522014-11-04 16:40:20 +000041void PrepareForRegisterAllocation::VisitDivZeroCheck(HDivZeroCheck* check) {
42 check->ReplaceWith(check->InputAt(0));
43}
44
Nicolas Geoffray6f8e2c92017-03-23 14:37:26 +000045void PrepareForRegisterAllocation::VisitDeoptimize(HDeoptimize* deoptimize) {
46 if (deoptimize->GuardsAnInput()) {
47 // Replace the uses with the actual guarded instruction.
48 deoptimize->ReplaceWith(deoptimize->GuardedInput());
49 deoptimize->RemoveGuard();
50 }
51}
52
Nicolas Geoffray26a25ef2014-09-30 13:54:09 +010053void PrepareForRegisterAllocation::VisitBoundsCheck(HBoundsCheck* check) {
54 check->ReplaceWith(check->InputAt(0));
Vladimir Marko87f3fcb2016-04-28 15:52:11 +010055 if (check->IsStringCharAt()) {
Vladimir Marko92f7f3c2017-10-31 11:38:30 +000056 // Add a fake environment for String.charAt() inline info as we want the exception
57 // to appear as being thrown from there. Skip if we're compiling String.charAt() itself.
Nicolas Geoffray5d37c152017-01-12 13:25:19 +000058 ArtMethod* char_at_method = jni::DecodeArtMethod(WellKnownClasses::java_lang_String_charAt);
Vladimir Marko92f7f3c2017-10-31 11:38:30 +000059 if (GetGraph()->GetArtMethod() != char_at_method) {
60 ArenaAllocator* allocator = GetGraph()->GetAllocator();
61 HEnvironment* environment = new (allocator) HEnvironment(allocator,
62 /* number_of_vregs */ 0u,
63 char_at_method,
64 /* dex_pc */ dex::kDexNoIndex,
65 check);
66 check->InsertRawEnvironment(environment);
67 }
Vladimir Marko87f3fcb2016-04-28 15:52:11 +010068 }
Nicolas Geoffray26a25ef2014-09-30 13:54:09 +010069}
70
Calin Juravleb1498f62015-02-16 13:13:29 +000071void PrepareForRegisterAllocation::VisitBoundType(HBoundType* bound_type) {
72 bound_type->ReplaceWith(bound_type->InputAt(0));
73 bound_type->GetBlock()->RemoveInstruction(bound_type);
74}
75
Roland Levillainb133ec62016-03-23 12:40:35 +000076void PrepareForRegisterAllocation::VisitArraySet(HArraySet* instruction) {
77 HInstruction* value = instruction->GetValue();
78 // PrepareForRegisterAllocation::VisitBoundType may have replaced a
79 // BoundType (as value input of this ArraySet) with a NullConstant.
80 // If so, this ArraySet no longer needs a type check.
81 if (value->IsNullConstant()) {
Vladimir Marko0ebe0d82017-09-21 22:50:39 +010082 DCHECK_EQ(value->GetType(), DataType::Type::kReference);
Roland Levillainb133ec62016-03-23 12:40:35 +000083 if (instruction->NeedsTypeCheck()) {
84 instruction->ClearNeedsTypeCheck();
85 }
86 }
87}
88
Nicolas Geoffray19a19cf2014-10-22 16:07:05 +010089void PrepareForRegisterAllocation::VisitClinitCheck(HClinitCheck* check) {
Nicolas Geoffray729645a2015-11-19 13:29:02 +000090 // Try to find a static invoke or a new-instance from which this check originated.
91 HInstruction* implicit_clinit = nullptr;
Vladimir Marko46817b82016-03-29 12:21:58 +010092 for (const HUseListNode<HInstruction*>& use : check->GetUses()) {
93 HInstruction* user = use.GetUser();
Nicolas Geoffray729645a2015-11-19 13:29:02 +000094 if ((user->IsInvokeStaticOrDirect() || user->IsNewInstance()) &&
95 CanMoveClinitCheck(check, user)) {
96 implicit_clinit = user;
97 if (user->IsInvokeStaticOrDirect()) {
98 DCHECK(user->AsInvokeStaticOrDirect()->IsStaticWithExplicitClinitCheck());
99 user->AsInvokeStaticOrDirect()->RemoveExplicitClinitCheck(
100 HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit);
101 } else {
102 DCHECK(user->IsNewInstance());
103 // We delegate the initialization duty to the allocation.
104 if (user->AsNewInstance()->GetEntrypoint() == kQuickAllocObjectInitialized) {
105 user->AsNewInstance()->SetEntrypoint(kQuickAllocObjectResolved);
106 }
107 }
Vladimir Markofbb184a2015-11-13 14:47:00 +0000108 break;
109 }
110 }
Nicolas Geoffray729645a2015-11-19 13:29:02 +0000111 // If we found a static invoke or new-instance for merging, remove the check
112 // from dominated static invokes.
113 if (implicit_clinit != nullptr) {
Vladimir Marko46817b82016-03-29 12:21:58 +0100114 const HUseList<HInstruction*>& uses = check->GetUses();
115 for (auto it = uses.begin(), end = uses.end(); it != end; /* ++it below */) {
116 HInstruction* user = it->GetUser();
Nicolas Geoffray729645a2015-11-19 13:29:02 +0000117 // All other uses must be dominated.
118 DCHECK(implicit_clinit->StrictlyDominates(user) || (implicit_clinit == user));
Vladimir Marko46817b82016-03-29 12:21:58 +0100119 ++it; // Advance before we remove the node, reference to the next node is preserved.
Vladimir Markofbb184a2015-11-13 14:47:00 +0000120 if (user->IsInvokeStaticOrDirect()) {
121 user->AsInvokeStaticOrDirect()->RemoveExplicitClinitCheck(
122 HInvokeStaticOrDirect::ClinitCheckRequirement::kNone);
123 }
124 }
125 }
126
127 HLoadClass* load_class = check->GetLoadClass();
128 bool can_merge_with_load_class = CanMoveClinitCheck(load_class, check);
129
130 check->ReplaceWith(load_class);
131
Nicolas Geoffray729645a2015-11-19 13:29:02 +0000132 if (implicit_clinit != nullptr) {
133 // Remove the check from the graph. It has been merged into the invoke or new-instance.
Vladimir Markofbb184a2015-11-13 14:47:00 +0000134 check->GetBlock()->RemoveInstruction(check);
135 // Check if we can merge the load class as well.
136 if (can_merge_with_load_class && !load_class->HasUses()) {
137 load_class->GetBlock()->RemoveInstruction(load_class);
138 }
Nicolas Geoffray0580d962016-01-06 17:40:20 +0000139 } else if (can_merge_with_load_class && !load_class->NeedsAccessCheck()) {
Nicolas Geoffray424f6762014-11-03 14:51:25 +0000140 // Pass the initialization duty to the `HLoadClass` instruction,
141 // and remove the instruction from the graph.
Mathieu Chartier1ceb37c2016-08-30 10:23:01 -0700142 DCHECK(load_class->HasEnvironment());
Vladimir Markofbb184a2015-11-13 14:47:00 +0000143 load_class->SetMustGenerateClinitCheck(true);
Nicolas Geoffray424f6762014-11-03 14:51:25 +0000144 check->GetBlock()->RemoveInstruction(check);
145 }
Nicolas Geoffray19a19cf2014-10-22 16:07:05 +0100146}
147
David Brazdilb3e773e2016-01-26 11:28:37 +0000148bool PrepareForRegisterAllocation::CanEmitConditionAt(HCondition* condition,
149 HInstruction* user) const {
150 if (condition->GetNext() != user) {
151 return false;
Nicolas Geoffray360231a2014-10-08 21:07:48 +0100152 }
David Brazdilb3e773e2016-01-26 11:28:37 +0000153
154 if (user->IsIf() || user->IsDeoptimize()) {
155 return true;
156 }
157
David Brazdil74eb1b22015-12-14 11:44:01 +0000158 if (user->IsSelect() && user->AsSelect()->GetCondition() == condition) {
Mark Mendell0c5b18e2016-02-06 13:58:35 -0500159 return true;
David Brazdil74eb1b22015-12-14 11:44:01 +0000160 }
161
David Brazdilb3e773e2016-01-26 11:28:37 +0000162 return false;
163}
164
165void PrepareForRegisterAllocation::VisitCondition(HCondition* condition) {
166 if (condition->HasOnlyOneNonEnvironmentUse()) {
Vladimir Marko46817b82016-03-29 12:21:58 +0100167 HInstruction* user = condition->GetUses().front().GetUser();
David Brazdilb3e773e2016-01-26 11:28:37 +0000168 if (CanEmitConditionAt(condition, user)) {
169 condition->MarkEmittedAtUseSite();
170 }
Nicolas Geoffray360231a2014-10-08 21:07:48 +0100171 }
172}
173
Igor Murashkind01745e2017-04-05 16:40:31 -0700174void PrepareForRegisterAllocation::VisitConstructorFence(HConstructorFence* constructor_fence) {
Igor Murashkin79d8fa72017-04-18 09:37:23 -0700175 // Trivially remove redundant HConstructorFence when it immediately follows an HNewInstance
176 // to an uninitialized class. In this special case, the art_quick_alloc_object_resolved
177 // will already have the 'dmb' which is strictly stronger than an HConstructorFence.
178 //
179 // The instruction builder always emits "x = HNewInstance; HConstructorFence(x)" so this
180 // is effectively pattern-matching that particular case and undoing the redundancy the builder
181 // had introduced.
182 //
183 // TODO: Move this to a separate pass.
184 HInstruction* allocation_inst = constructor_fence->GetAssociatedAllocation();
185 if (allocation_inst != nullptr && allocation_inst->IsNewInstance()) {
186 HNewInstance* new_inst = allocation_inst->AsNewInstance();
187 // This relies on the entrypoint already being set to the more optimized version;
188 // as that happens in this pass, this redundancy removal also cannot happen any earlier.
189 if (new_inst != nullptr && new_inst->GetEntrypoint() == kQuickAllocObjectResolved) {
190 // If this was done in an earlier pass, we would want to match that `previous` was an input
191 // to the `constructor_fence`. However, since this pass removes the inputs to the fence,
192 // we can ignore the inputs and just remove the instruction from its block.
193 DCHECK_EQ(1u, constructor_fence->InputCount());
194 // TODO: GetAssociatedAllocation should not care about multiple inputs
195 // if we are in prepare_for_register_allocation pass only.
196 constructor_fence->GetBlock()->RemoveInstruction(constructor_fence);
Igor Murashkin6ef45672017-08-08 13:59:55 -0700197 MaybeRecordStat(stats_,
198 MethodCompilationStat::kConstructorFenceRemovedPFRA);
Igor Murashkin79d8fa72017-04-18 09:37:23 -0700199 return;
Igor Murashkin79d8fa72017-04-18 09:37:23 -0700200 }
201
202 // HNewArray does not need this check because the art_quick_alloc_array does not itself
203 // have a dmb in any normal situation (i.e. the array class is never exactly in the
204 // "resolved" state). If the array class is not yet loaded, it will always go from
205 // Unloaded->Initialized state.
206 }
207
208 // Remove all the inputs to the constructor fence;
Igor Murashkind01745e2017-04-05 16:40:31 -0700209 // they aren't used by the InstructionCodeGenerator and this lets us avoid creating a
210 // LocationSummary in the LocationsBuilder.
211 constructor_fence->RemoveAllInputs();
212}
213
Roland Levillain4c0eb422015-04-24 16:43:49 +0100214void PrepareForRegisterAllocation::VisitInvokeStaticOrDirect(HInvokeStaticOrDirect* invoke) {
215 if (invoke->IsStaticWithExplicitClinitCheck()) {
Nicolas Geoffraye8298312017-08-03 09:51:25 +0100216 HInstruction* last_input = invoke->GetInputs().back();
217 DCHECK(last_input->IsLoadClass())
Calin Juravle0ba218d2015-05-19 18:46:01 +0100218 << "Last input is not HLoadClass. It is " << last_input->DebugName();
219
Vladimir Markofbb184a2015-11-13 14:47:00 +0000220 // Detach the explicit class initialization check from the invoke.
221 // Keeping track of the initializing instruction is no longer required
222 // at this stage (i.e., after inlining has been performed).
223 invoke->RemoveExplicitClinitCheck(HInvokeStaticOrDirect::ClinitCheckRequirement::kNone);
Roland Levillain4c0eb422015-04-24 16:43:49 +0100224
Vladimir Markofbb184a2015-11-13 14:47:00 +0000225 // Merging with load class should have happened in VisitClinitCheck().
226 DCHECK(!CanMoveClinitCheck(last_input, invoke));
227 }
228}
Nicolas Geoffray78f4fa72015-06-12 09:35:05 +0100229
David Brazdilb3e773e2016-01-26 11:28:37 +0000230bool PrepareForRegisterAllocation::CanMoveClinitCheck(HInstruction* input,
231 HInstruction* user) const {
Vladimir Markofbb184a2015-11-13 14:47:00 +0000232 // Determine if input and user come from the same dex instruction, so that we can move
233 // the clinit check responsibility from one to the other, i.e. from HClinitCheck (user)
Vladimir Markoc7591b42016-06-29 14:59:07 +0100234 // to HLoadClass (input), or from HClinitCheck (input) to HInvokeStaticOrDirect (user),
235 // or from HLoadClass (input) to HNewInstance (user).
Vladimir Markofbb184a2015-11-13 14:47:00 +0000236
237 // Start with a quick dex pc check.
238 if (user->GetDexPc() != input->GetDexPc()) {
239 return false;
240 }
241
242 // Now do a thorough environment check that this is really coming from the same instruction in
243 // the same inlined graph. Unfortunately, we have to go through the whole environment chain.
244 HEnvironment* user_environment = user->GetEnvironment();
245 HEnvironment* input_environment = input->GetEnvironment();
246 while (user_environment != nullptr || input_environment != nullptr) {
247 if (user_environment == nullptr || input_environment == nullptr) {
248 // Different environment chain length. This happens when a method is called
249 // once directly and once indirectly through another inlined method.
250 return false;
251 }
252 if (user_environment->GetDexPc() != input_environment->GetDexPc() ||
Nicolas Geoffray5d37c152017-01-12 13:25:19 +0000253 user_environment->GetMethod() != input_environment->GetMethod()) {
Vladimir Markofbb184a2015-11-13 14:47:00 +0000254 return false;
255 }
256 user_environment = user_environment->GetParent();
257 input_environment = input_environment->GetParent();
258 }
259
260 // Check for code motion taking the input to a different block.
261 if (user->GetBlock() != input->GetBlock()) {
262 return false;
263 }
264
265 // In debug mode, check that we have not inserted a throwing instruction
266 // or an instruction with side effects between input and user.
267 if (kIsDebugBuild) {
268 for (HInstruction* between = input->GetNext(); between != user; between = between->GetNext()) {
269 CHECK(between != nullptr); // User must be after input in the same block.
270 CHECK(!between->CanThrow());
271 CHECK(!between->HasSideEffects());
Roland Levillain4c0eb422015-04-24 16:43:49 +0100272 }
273 }
Vladimir Markofbb184a2015-11-13 14:47:00 +0000274 return true;
Roland Levillain4c0eb422015-04-24 16:43:49 +0100275}
276
Nicolas Geoffray26a25ef2014-09-30 13:54:09 +0100277} // namespace art