blob: 33084df94b5c5c2e278312263e43c3de14908f47 [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"
18#include "nodes.h"
19
20namespace art {
21
Nicolas Geoffraya7062e02014-05-22 12:50:17 +010022static Primitive::Type MergeTypes(Primitive::Type existing, Primitive::Type new_type) {
23 // We trust the verifier has already done the necessary checking.
24 switch (existing) {
25 case Primitive::kPrimFloat:
26 case Primitive::kPrimDouble:
27 case Primitive::kPrimNot:
28 return existing;
29 default:
30 return new_type;
31 }
32}
33
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010034void SsaBuilder::BuildSsa() {
Nicolas Geoffray804d0932014-05-02 08:46:00 +010035 // 1) Visit in reverse post order. We need to have all predecessors of a block visited
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010036 // (with the exception of loops) in order to create the right environment for that
37 // block. For loops, we create phis whose inputs will be set in 2).
Nicolas Geoffray804d0932014-05-02 08:46:00 +010038 for (HReversePostOrderIterator it(*GetGraph()); !it.Done(); it.Advance()) {
39 VisitBasicBlock(it.Current());
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010040 }
41
42 // 2) Set inputs of loop phis.
43 for (size_t i = 0; i < loop_headers_.Size(); i++) {
44 HBasicBlock* block = loop_headers_.Get(i);
Nicolas Geoffrayf635e632014-05-14 09:43:38 +010045 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010046 HPhi* phi = it.Current()->AsPhi();
Nicolas Geoffraya7062e02014-05-22 12:50:17 +010047 Primitive::Type type = Primitive::kPrimVoid;
Nicolas Geoffray622d9c32014-05-12 16:11:02 +010048 for (size_t pred = 0; pred < block->GetPredecessors().Size(); pred++) {
Nicolas Geoffraya7062e02014-05-22 12:50:17 +010049 HInstruction* input = ValueOfLocal(block->GetPredecessors().Get(pred), phi->GetRegNumber());
50 phi->AddInput(input);
51 type = MergeTypes(type, input->GetType());
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010052 }
Nicolas Geoffraya7062e02014-05-22 12:50:17 +010053 phi->SetType(type);
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010054 }
55 }
Nicolas Geoffraya7062e02014-05-22 12:50:17 +010056 // TODO: Now that the type of loop phis is set, we need a type propagation phase.
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010057
58 // 3) Clear locals.
59 // TODO: Move this to a dead code eliminator phase.
Nicolas Geoffrayf635e632014-05-14 09:43:38 +010060 for (HInstructionIterator it(GetGraph()->GetEntryBlock()->GetInstructions());
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010061 !it.Done();
62 it.Advance()) {
63 HInstruction* current = it.Current();
64 if (current->AsLocal() != nullptr) {
65 current->GetBlock()->RemoveInstruction(current);
66 }
67 }
68}
69
70HInstruction* SsaBuilder::ValueOfLocal(HBasicBlock* block, size_t local) {
71 return GetLocalsFor(block)->Get(local);
72}
73
74void SsaBuilder::VisitBasicBlock(HBasicBlock* block) {
75 current_locals_ = GetLocalsFor(block);
76
77 if (block->IsLoopHeader()) {
78 // If the block is a loop header, we know we only have visited the pre header
Nicolas Geoffray804d0932014-05-02 08:46:00 +010079 // because we are visiting in reverse post order. We create phis for all initialized
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010080 // locals from the pre header. Their inputs will be populated at the end of
81 // the analysis.
82 for (size_t local = 0; local < current_locals_->Size(); local++) {
83 HInstruction* incoming = ValueOfLocal(block->GetLoopInformation()->GetPreHeader(), local);
84 if (incoming != nullptr) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010085 HPhi* phi = new (GetGraph()->GetArena()) HPhi(
86 GetGraph()->GetArena(), local, 0, Primitive::kPrimVoid);
87 block->AddPhi(phi);
88 current_locals_->Put(local, phi);
89 }
90 }
91 // Save the loop header so that the last phase of the analysis knows which
92 // blocks need to be updated.
93 loop_headers_.Add(block);
Nicolas Geoffray622d9c32014-05-12 16:11:02 +010094 } else if (block->GetPredecessors().Size() > 0) {
Nicolas Geoffray804d0932014-05-02 08:46:00 +010095 // All predecessors have already been visited because we are visiting in reverse post order.
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010096 // We merge the values of all locals, creating phis if those values differ.
97 for (size_t local = 0; local < current_locals_->Size(); local++) {
98 bool is_different = false;
Nicolas Geoffray622d9c32014-05-12 16:11:02 +010099 HInstruction* value = ValueOfLocal(block->GetPredecessors().Get(0), local);
100 for (size_t i = 1; i < block->GetPredecessors().Size(); i++) {
101 if (ValueOfLocal(block->GetPredecessors().Get(i), local) != value) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100102 is_different = true;
103 break;
104 }
105 }
106 if (is_different) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100107 HPhi* phi = new (GetGraph()->GetArena()) HPhi(
Nicolas Geoffray622d9c32014-05-12 16:11:02 +0100108 GetGraph()->GetArena(), local, block->GetPredecessors().Size(), Primitive::kPrimVoid);
Nicolas Geoffraya7062e02014-05-22 12:50:17 +0100109 Primitive::Type type = Primitive::kPrimVoid;
Nicolas Geoffray622d9c32014-05-12 16:11:02 +0100110 for (size_t i = 0; i < block->GetPredecessors().Size(); i++) {
Nicolas Geoffraya7062e02014-05-22 12:50:17 +0100111 HInstruction* value = ValueOfLocal(block->GetPredecessors().Get(i), local);
112 // We need to merge the incoming types, as the Dex format does not
113 // guarantee the inputs have the same type. In particular the 0 constant is
114 // used for all types, but the graph builder treats it as an int.
115 type = MergeTypes(type, value->GetType());
116 phi->SetRawInputAt(i, value);
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100117 }
Nicolas Geoffraya7062e02014-05-22 12:50:17 +0100118 phi->SetType(type);
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100119 block->AddPhi(phi);
120 value = phi;
121 }
122 current_locals_->Put(local, value);
123 }
124 }
125
126 // Visit all instructions. The instructions of interest are:
127 // - HLoadLocal: replace them with the current value of the local.
128 // - HStoreLocal: update current value of the local and remove the instruction.
129 // - Instructions that require an environment: populate their environment
130 // with the current values of the locals.
Nicolas Geoffrayf635e632014-05-14 09:43:38 +0100131 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) {
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +0100132 it.Current()->Accept(this);
133 }
134}
135
136void SsaBuilder::VisitLoadLocal(HLoadLocal* load) {
137 load->ReplaceWith(current_locals_->Get(load->GetLocal()->GetRegNumber()));
138 load->GetBlock()->RemoveInstruction(load);
139}
140
141void SsaBuilder::VisitStoreLocal(HStoreLocal* store) {
142 current_locals_->Put(store->GetLocal()->GetRegNumber(), store->InputAt(1));
143 store->GetBlock()->RemoveInstruction(store);
144}
145
146void SsaBuilder::VisitInstruction(HInstruction* instruction) {
147 if (!instruction->NeedsEnvironment()) {
148 return;
149 }
150 HEnvironment* environment = new (GetGraph()->GetArena()) HEnvironment(
151 GetGraph()->GetArena(), current_locals_->Size());
152 environment->Populate(*current_locals_);
153 instruction->SetEnvironment(environment);
154}
155
156} // namespace art