blob: b2cc11996e700003706b699ff0f8142759a7e7b1 [file] [log] [blame]
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +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 "ssa_builder.h"
Nicolas Geoffray184d6402014-06-09 14:06:02 +010018
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010019#include "nodes.h"
Nicolas Geoffray184d6402014-06-09 14:06:02 +010020#include "ssa_type_propagation.h"
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010021
22namespace art {
23
24void SsaBuilder::BuildSsa() {
Nicolas Geoffray804d0932014-05-02 08:46:00 +010025 // 1) Visit in reverse post order. We need to have all predecessors of a block visited
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010026 // (with the exception of loops) in order to create the right environment for that
27 // block. For loops, we create phis whose inputs will be set in 2).
Nicolas Geoffray804d0932014-05-02 08:46:00 +010028 for (HReversePostOrderIterator it(*GetGraph()); !it.Done(); it.Advance()) {
29 VisitBasicBlock(it.Current());
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010030 }
31
32 // 2) Set inputs of loop phis.
33 for (size_t i = 0; i < loop_headers_.Size(); i++) {
34 HBasicBlock* block = loop_headers_.Get(i);
Nicolas Geoffrayf635e632014-05-14 09:43:38 +010035 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010036 HPhi* phi = it.Current()->AsPhi();
Nicolas Geoffray622d9c32014-05-12 16:11:02 +010037 for (size_t pred = 0; pred < block->GetPredecessors().Size(); pred++) {
Nicolas Geoffraya7062e02014-05-22 12:50:17 +010038 HInstruction* input = ValueOfLocal(block->GetPredecessors().Get(pred), phi->GetRegNumber());
39 phi->AddInput(input);
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010040 }
41 }
42 }
43
Nicolas Geoffray184d6402014-06-09 14:06:02 +010044 // 3) Propagate types of phis.
45 SsaTypePropagation type_propagation(GetGraph());
46 type_propagation.Run();
47
48 // 4) Clear locals.
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010049 // TODO: Move this to a dead code eliminator phase.
Nicolas Geoffrayf635e632014-05-14 09:43:38 +010050 for (HInstructionIterator it(GetGraph()->GetEntryBlock()->GetInstructions());
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010051 !it.Done();
52 it.Advance()) {
53 HInstruction* current = it.Current();
Roland Levillain476df552014-10-09 17:51:36 +010054 if (current->IsLocal()) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010055 current->GetBlock()->RemoveInstruction(current);
56 }
57 }
58}
59
60HInstruction* SsaBuilder::ValueOfLocal(HBasicBlock* block, size_t local) {
61 return GetLocalsFor(block)->Get(local);
62}
63
64void SsaBuilder::VisitBasicBlock(HBasicBlock* block) {
65 current_locals_ = GetLocalsFor(block);
66
67 if (block->IsLoopHeader()) {
68 // If the block is a loop header, we know we only have visited the pre header
Nicolas Geoffray804d0932014-05-02 08:46:00 +010069 // because we are visiting in reverse post order. We create phis for all initialized
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010070 // locals from the pre header. Their inputs will be populated at the end of
71 // the analysis.
72 for (size_t local = 0; local < current_locals_->Size(); local++) {
73 HInstruction* incoming = ValueOfLocal(block->GetLoopInformation()->GetPreHeader(), local);
74 if (incoming != nullptr) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010075 HPhi* phi = new (GetGraph()->GetArena()) HPhi(
76 GetGraph()->GetArena(), local, 0, Primitive::kPrimVoid);
77 block->AddPhi(phi);
78 current_locals_->Put(local, phi);
79 }
80 }
81 // Save the loop header so that the last phase of the analysis knows which
82 // blocks need to be updated.
83 loop_headers_.Add(block);
Nicolas Geoffray622d9c32014-05-12 16:11:02 +010084 } else if (block->GetPredecessors().Size() > 0) {
Nicolas Geoffray804d0932014-05-02 08:46:00 +010085 // All predecessors have already been visited because we are visiting in reverse post order.
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010086 // We merge the values of all locals, creating phis if those values differ.
87 for (size_t local = 0; local < current_locals_->Size(); local++) {
Nicolas Geoffray7c3560f2014-06-04 12:12:08 +010088 bool one_predecessor_has_no_value = false;
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010089 bool is_different = false;
Nicolas Geoffray622d9c32014-05-12 16:11:02 +010090 HInstruction* value = ValueOfLocal(block->GetPredecessors().Get(0), local);
Nicolas Geoffray7c3560f2014-06-04 12:12:08 +010091
92 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) {
93 HInstruction* current = ValueOfLocal(block->GetPredecessors().Get(i), local);
94 if (current == nullptr) {
Nicolas Geoffrayec7e4722014-06-06 11:24:33 +010095 one_predecessor_has_no_value = true;
96 break;
Nicolas Geoffray7c3560f2014-06-04 12:12:08 +010097 } else if (current != value) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010098 is_different = true;
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010099 }
100 }
Nicolas Geoffray7c3560f2014-06-04 12:12:08 +0100101
102 if (one_predecessor_has_no_value) {
103 // If one predecessor has no value for this local, we trust the verifier has
104 // successfully checked that there is a store dominating any read after this block.
105 continue;
106 }
107
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100108 if (is_different) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100109 HPhi* phi = new (GetGraph()->GetArena()) HPhi(
Nicolas Geoffray622d9c32014-05-12 16:11:02 +0100110 GetGraph()->GetArena(), local, block->GetPredecessors().Size(), Primitive::kPrimVoid);
111 for (size_t i = 0; i < block->GetPredecessors().Size(); i++) {
Andreas Gampe277ccbd2014-11-03 21:36:10 -0800112 HInstruction* pred_value = ValueOfLocal(block->GetPredecessors().Get(i), local);
113 phi->SetRawInputAt(i, pred_value);
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100114 }
115 block->AddPhi(phi);
116 value = phi;
117 }
118 current_locals_->Put(local, value);
119 }
120 }
121
122 // Visit all instructions. The instructions of interest are:
123 // - HLoadLocal: replace them with the current value of the local.
124 // - HStoreLocal: update current value of the local and remove the instruction.
125 // - Instructions that require an environment: populate their environment
126 // with the current values of the locals.
Nicolas Geoffrayf635e632014-05-14 09:43:38 +0100127 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100128 it.Current()->Accept(this);
129 }
130}
131
Nicolas Geoffray102cbed2014-10-15 18:31:05 +0100132/**
133 * Constants in the Dex format are not typed. So the builder types them as
134 * integers, but when doing the SSA form, we might realize the constant
135 * is used for floating point operations. We create a floating-point equivalent
136 * constant to make the operations correctly typed.
137 */
138static HFloatConstant* GetFloatEquivalent(HIntConstant* constant) {
139 // We place the floating point constant next to this constant.
140 HFloatConstant* result = constant->GetNext()->AsFloatConstant();
141 if (result == nullptr) {
142 HGraph* graph = constant->GetBlock()->GetGraph();
143 ArenaAllocator* allocator = graph->GetArena();
144 result = new (allocator) HFloatConstant(bit_cast<int32_t, float>(constant->GetValue()));
145 constant->GetBlock()->InsertInstructionBefore(result, constant->GetNext());
146 } else {
147 // If there is already a constant with the expected type, we know it is
148 // the floating point equivalent of this constant.
149 DCHECK_EQ((bit_cast<float, int32_t>(result->GetValue())), constant->GetValue());
150 }
151 return result;
152}
153
154/**
155 * Wide constants in the Dex format are not typed. So the builder types them as
156 * longs, but when doing the SSA form, we might realize the constant
157 * is used for floating point operations. We create a floating-point equivalent
158 * constant to make the operations correctly typed.
159 */
160static HDoubleConstant* GetDoubleEquivalent(HLongConstant* constant) {
161 // We place the floating point constant next to this constant.
162 HDoubleConstant* result = constant->GetNext()->AsDoubleConstant();
163 if (result == nullptr) {
164 HGraph* graph = constant->GetBlock()->GetGraph();
165 ArenaAllocator* allocator = graph->GetArena();
166 result = new (allocator) HDoubleConstant(bit_cast<int64_t, double>(constant->GetValue()));
167 constant->GetBlock()->InsertInstructionBefore(result, constant->GetNext());
168 } else {
169 // If there is already a constant with the expected type, we know it is
170 // the floating point equivalent of this constant.
171 DCHECK_EQ((bit_cast<double, int64_t>(result->GetValue())), constant->GetValue());
172 }
173 return result;
174}
175
176/**
177 * Because of Dex format, we might end up having the same phi being
178 * used for non floating point operations and floating point operations. Because
179 * we want the graph to be correctly typed (and thereafter avoid moves between
180 * floating point registers and core registers), we need to create a copy of the
181 * phi with a floating point type.
182 */
183static HPhi* GetFloatOrDoubleEquivalentOfPhi(HPhi* phi, Primitive::Type type) {
184 // We place the floating point phi next to this phi.
185 HInstruction* next = phi->GetNext();
Nicolas Geoffray21cc7982014-11-17 17:50:33 +0000186 if (next == nullptr || (next->AsPhi()->GetRegNumber() != phi->GetRegNumber())) {
Nicolas Geoffray102cbed2014-10-15 18:31:05 +0100187 ArenaAllocator* allocator = phi->GetBlock()->GetGraph()->GetArena();
188 HPhi* new_phi = new (allocator) HPhi(allocator, phi->GetRegNumber(), phi->InputCount(), type);
189 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) {
190 // Copy the inputs. Note that the graph may not be correctly typed by doing this copy,
191 // but the type propagation phase will fix it.
192 new_phi->SetRawInputAt(i, phi->InputAt(i));
193 }
194 phi->GetBlock()->InsertPhiAfter(new_phi, phi);
195 return new_phi;
196 } else {
Nicolas Geoffray21cc7982014-11-17 17:50:33 +0000197 DCHECK_EQ(next->GetType(), type);
Nicolas Geoffray102cbed2014-10-15 18:31:05 +0100198 return next->AsPhi();
199 }
200}
201
202HInstruction* SsaBuilder::GetFloatOrDoubleEquivalent(HInstruction* user,
203 HInstruction* value,
204 Primitive::Type type) {
205 if (value->IsArrayGet()) {
206 // The verifier has checked that values in arrays cannot be used for both
207 // floating point and non-floating point operations. It is therefore safe to just
208 // change the type of the operation.
209 value->AsArrayGet()->SetType(type);
210 return value;
211 } else if (value->IsLongConstant()) {
212 return GetDoubleEquivalent(value->AsLongConstant());
213 } else if (value->IsIntConstant()) {
214 return GetFloatEquivalent(value->AsIntConstant());
215 } else if (value->IsPhi()) {
216 return GetFloatOrDoubleEquivalentOfPhi(value->AsPhi(), type);
217 } else {
218 // For other instructions, we assume the verifier has checked that the dex format is correctly
219 // typed and the value in a dex register will not be used for both floating point and
220 // non-floating point operations. So the only reason an instruction would want a floating
221 // point equivalent is for an unused phi that will be removed by the dead phi elimination phase.
222 DCHECK(user->IsPhi());
223 return value;
224 }
225}
226
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100227void SsaBuilder::VisitLoadLocal(HLoadLocal* load) {
Nicolas Geoffray102cbed2014-10-15 18:31:05 +0100228 HInstruction* value = current_locals_->Get(load->GetLocal()->GetRegNumber());
229 if (load->GetType() != value->GetType()
230 && (load->GetType() == Primitive::kPrimFloat || load->GetType() == Primitive::kPrimDouble)) {
231 // If the operation requests a specific type, we make sure its input is of that type.
232 value = GetFloatOrDoubleEquivalent(load, value, load->GetType());
233 }
234 load->ReplaceWith(value);
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100235 load->GetBlock()->RemoveInstruction(load);
236}
237
238void SsaBuilder::VisitStoreLocal(HStoreLocal* store) {
239 current_locals_->Put(store->GetLocal()->GetRegNumber(), store->InputAt(1));
240 store->GetBlock()->RemoveInstruction(store);
241}
242
243void SsaBuilder::VisitInstruction(HInstruction* instruction) {
244 if (!instruction->NeedsEnvironment()) {
245 return;
246 }
247 HEnvironment* environment = new (GetGraph()->GetArena()) HEnvironment(
248 GetGraph()->GetArena(), current_locals_->Size());
249 environment->Populate(*current_locals_);
250 instruction->SetEnvironment(environment);
251}
252
Nicolas Geoffray421e9f92014-11-11 18:21:53 +0000253void SsaBuilder::VisitTemporary(HTemporary* temp) {
254 // Temporaries are only used by the baseline register allocator.
255 temp->GetBlock()->RemoveInstruction(temp);
256}
257
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100258} // namespace art