1 /*
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 "builder.h"
18
19 #include "art_field-inl.h"
20 #include "base/arena_bit_vector.h"
21 #include "base/bit_vector-inl.h"
22 #include "base/logging.h"
23 #include "block_builder.h"
24 #include "code_generator.h"
25 #include "data_type-inl.h"
26 #include "driver/compiler_options.h"
27 #include "driver/dex_compilation_unit.h"
28 #include "instruction_builder.h"
29 #include "mirror/class_loader.h"
30 #include "mirror/dex_cache.h"
31 #include "nodes.h"
32 #include "optimizing_compiler_stats.h"
33 #include "ssa_builder.h"
34 #include "thread.h"
35
36 namespace art {
37
HGraphBuilder(HGraph * graph,const CodeItemDebugInfoAccessor & accessor,const DexCompilationUnit * dex_compilation_unit,const DexCompilationUnit * outer_compilation_unit,CodeGenerator * code_generator,OptimizingCompilerStats * compiler_stats)38 HGraphBuilder::HGraphBuilder(HGraph* graph,
39 const CodeItemDebugInfoAccessor& accessor,
40 const DexCompilationUnit* dex_compilation_unit,
41 const DexCompilationUnit* outer_compilation_unit,
42 CodeGenerator* code_generator,
43 OptimizingCompilerStats* compiler_stats)
44 : graph_(graph),
45 dex_file_(&graph->GetDexFile()),
46 code_item_accessor_(accessor),
47 dex_compilation_unit_(dex_compilation_unit),
48 outer_compilation_unit_(outer_compilation_unit),
49 code_generator_(code_generator),
50 compilation_stats_(compiler_stats),
51 return_type_(DataType::FromShorty(dex_compilation_unit_->GetShorty()[0])) {}
52
HGraphBuilder(HGraph * graph,const DexCompilationUnit * dex_compilation_unit,const CodeItemDebugInfoAccessor & accessor,DataType::Type return_type)53 HGraphBuilder::HGraphBuilder(HGraph* graph,
54 const DexCompilationUnit* dex_compilation_unit,
55 const CodeItemDebugInfoAccessor& accessor,
56 DataType::Type return_type)
57 : graph_(graph),
58 dex_file_(&graph->GetDexFile()),
59 code_item_accessor_(accessor),
60 dex_compilation_unit_(dex_compilation_unit),
61 outer_compilation_unit_(nullptr),
62 code_generator_(nullptr),
63 compilation_stats_(nullptr),
64 return_type_(return_type) {}
65
SkipCompilation(size_t number_of_branches)66 bool HGraphBuilder::SkipCompilation(size_t number_of_branches) {
67 if (code_generator_ == nullptr) {
68 // Note that the codegen is null when unit testing.
69 return false;
70 }
71
72 const CompilerOptions& compiler_options = code_generator_->GetCompilerOptions();
73 CompilerFilter::Filter compiler_filter = compiler_options.GetCompilerFilter();
74 if (compiler_filter == CompilerFilter::kEverything) {
75 return false;
76 }
77
78 const uint32_t code_units = code_item_accessor_.InsnsSizeInCodeUnits();
79 if (compiler_options.IsHugeMethod(code_units)) {
80 VLOG(compiler) << "Skip compilation of huge method "
81 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
82 << ": " << code_units << " code units";
83 MaybeRecordStat(compilation_stats_, MethodCompilationStat::kNotCompiledHugeMethod);
84 return true;
85 }
86
87 // If it's large and contains no branches, it's likely to be machine generated initialization.
88 if (compiler_options.IsLargeMethod(code_units) && (number_of_branches == 0)) {
89 VLOG(compiler) << "Skip compilation of large method with no branch "
90 << dex_file_->PrettyMethod(dex_compilation_unit_->GetDexMethodIndex())
91 << ": " << code_units << " code units";
92 MaybeRecordStat(compilation_stats_, MethodCompilationStat::kNotCompiledLargeMethodNoBranches);
93 return true;
94 }
95
96 return false;
97 }
98
BuildGraph()99 GraphAnalysisResult HGraphBuilder::BuildGraph() {
100 DCHECK(code_item_accessor_.HasCodeItem());
101 DCHECK(graph_->GetBlocks().empty());
102
103 graph_->SetNumberOfVRegs(code_item_accessor_.RegistersSize());
104 graph_->SetNumberOfInVRegs(code_item_accessor_.InsSize());
105 graph_->SetMaximumNumberOfOutVRegs(code_item_accessor_.OutsSize());
106 graph_->SetHasTryCatch(code_item_accessor_.TriesSize() != 0);
107
108 // Use ScopedArenaAllocator for all local allocations.
109 ScopedArenaAllocator local_allocator(graph_->GetArenaStack());
110 HBasicBlockBuilder block_builder(graph_, dex_file_, code_item_accessor_, &local_allocator);
111 SsaBuilder ssa_builder(graph_,
112 dex_compilation_unit_->GetClassLoader(),
113 dex_compilation_unit_->GetDexCache(),
114 &local_allocator);
115 HInstructionBuilder instruction_builder(graph_,
116 &block_builder,
117 &ssa_builder,
118 dex_file_,
119 code_item_accessor_,
120 return_type_,
121 dex_compilation_unit_,
122 outer_compilation_unit_,
123 code_generator_,
124 compilation_stats_,
125 &local_allocator);
126
127 // 1) Create basic blocks and link them together. Basic blocks are left
128 // unpopulated with the exception of synthetic blocks, e.g. HTryBoundaries.
129 if (!block_builder.Build()) {
130 return kAnalysisInvalidBytecode;
131 }
132
133 // 2) Decide whether to skip this method based on its code size and number
134 // of branches.
135 if (SkipCompilation(block_builder.GetNumberOfBranches())) {
136 return kAnalysisSkipped;
137 }
138
139 // 3) Build the dominator tree and fill in loop and try/catch metadata.
140 GraphAnalysisResult result = graph_->BuildDominatorTree();
141 if (result != kAnalysisSuccess) {
142 return result;
143 }
144
145 // 4) Populate basic blocks with instructions.
146 if (!instruction_builder.Build()) {
147 return kAnalysisInvalidBytecode;
148 }
149
150 // 5) Type the graph and eliminate dead/redundant phis.
151 return ssa_builder.BuildSsa();
152 }
153
BuildIntrinsicGraph(ArtMethod * method)154 void HGraphBuilder::BuildIntrinsicGraph(ArtMethod* method) {
155 DCHECK(!code_item_accessor_.HasCodeItem());
156 DCHECK(graph_->GetBlocks().empty());
157
158 // Determine the number of arguments and associated vregs.
159 uint32_t method_idx = dex_compilation_unit_->GetDexMethodIndex();
160 const char* shorty = dex_file_->GetMethodShorty(dex_file_->GetMethodId(method_idx));
161 size_t num_args = strlen(shorty + 1);
162 size_t num_wide_args = std::count(shorty + 1, shorty + 1 + num_args, 'J') +
163 std::count(shorty + 1, shorty + 1 + num_args, 'D');
164 size_t num_arg_vregs = num_args + num_wide_args + (dex_compilation_unit_->IsStatic() ? 0u : 1u);
165
166 // For simplicity, reserve 2 vregs (the maximum) for return value regardless of the return type.
167 size_t return_vregs = 2u;
168 graph_->SetNumberOfVRegs(return_vregs + num_arg_vregs);
169 graph_->SetNumberOfInVRegs(num_arg_vregs);
170 graph_->SetMaximumNumberOfOutVRegs(num_arg_vregs);
171 graph_->SetHasTryCatch(false);
172
173 // Use ScopedArenaAllocator for all local allocations.
174 ScopedArenaAllocator local_allocator(graph_->GetArenaStack());
175 HBasicBlockBuilder block_builder(graph_,
176 dex_file_,
177 CodeItemDebugInfoAccessor(),
178 &local_allocator);
179 SsaBuilder ssa_builder(graph_,
180 dex_compilation_unit_->GetClassLoader(),
181 dex_compilation_unit_->GetDexCache(),
182 &local_allocator);
183 HInstructionBuilder instruction_builder(graph_,
184 &block_builder,
185 &ssa_builder,
186 dex_file_,
187 CodeItemDebugInfoAccessor(),
188 return_type_,
189 dex_compilation_unit_,
190 outer_compilation_unit_,
191 code_generator_,
192 compilation_stats_,
193 &local_allocator);
194
195 // 1) Create basic blocks for the intrinsic and link them together.
196 block_builder.BuildIntrinsic();
197
198 // 2) Build the trivial dominator tree.
199 GraphAnalysisResult bdt_result = graph_->BuildDominatorTree();
200 DCHECK_EQ(bdt_result, kAnalysisSuccess);
201
202 // 3) Populate basic blocks with instructions for the intrinsic.
203 instruction_builder.BuildIntrinsic(method);
204
205 // 4) Type the graph (no dead/redundant phis to eliminate).
206 GraphAnalysisResult build_ssa_result = ssa_builder.BuildSsa();
207 DCHECK_EQ(build_ssa_result, kAnalysisSuccess);
208 }
209
210 } // namespace art
211