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 HIDDEN {
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()66 bool HGraphBuilder::SkipCompilation() {
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 return false;
88 }
89
BuildGraph()90 GraphAnalysisResult HGraphBuilder::BuildGraph() {
91 DCHECK(code_item_accessor_.HasCodeItem());
92 DCHECK(graph_->GetBlocks().empty());
93
94 graph_->SetNumberOfVRegs(code_item_accessor_.RegistersSize());
95 graph_->SetNumberOfInVRegs(code_item_accessor_.InsSize());
96
97 // Use ScopedArenaAllocator for all local allocations.
98 ScopedArenaAllocator local_allocator(graph_->GetArenaStack());
99 HBasicBlockBuilder block_builder(graph_, dex_file_, code_item_accessor_, &local_allocator);
100 SsaBuilder ssa_builder(graph_,
101 dex_compilation_unit_->GetClassLoader(),
102 dex_compilation_unit_->GetDexCache(),
103 &local_allocator);
104 HInstructionBuilder instruction_builder(graph_,
105 &block_builder,
106 &ssa_builder,
107 dex_file_,
108 code_item_accessor_,
109 return_type_,
110 dex_compilation_unit_,
111 outer_compilation_unit_,
112 code_generator_,
113 compilation_stats_,
114 &local_allocator);
115
116 // 1) Create basic blocks and link them together. Basic blocks are left
117 // unpopulated with the exception of synthetic blocks, e.g. HTryBoundaries.
118 if (!block_builder.Build()) {
119 return kAnalysisInvalidBytecode;
120 }
121
122 // 2) Decide whether to skip compiling this method based on e.g. the compiler filter and method's
123 // code size.
124 if (SkipCompilation()) {
125 return kAnalysisSkipped;
126 }
127
128 // 3) Build the dominator tree and fill in loop and try/catch metadata.
129 GraphAnalysisResult result = graph_->BuildDominatorTree();
130 if (result != kAnalysisSuccess) {
131 return result;
132 }
133
134 // 4) Populate basic blocks with instructions.
135 if (!instruction_builder.Build()) {
136 return kAnalysisInvalidBytecode;
137 }
138
139 // 5) Type the graph and eliminate dead/redundant phis.
140 return ssa_builder.BuildSsa();
141 }
142
BuildIntrinsicGraph(ArtMethod * method)143 void HGraphBuilder::BuildIntrinsicGraph(ArtMethod* method) {
144 DCHECK(!code_item_accessor_.HasCodeItem());
145 DCHECK(graph_->GetBlocks().empty());
146
147 // Determine the number of arguments and associated vregs.
148 uint32_t method_idx = dex_compilation_unit_->GetDexMethodIndex();
149 const char* shorty = dex_file_->GetMethodShorty(dex_file_->GetMethodId(method_idx));
150 size_t num_args = strlen(shorty + 1);
151 size_t num_wide_args = std::count(shorty + 1, shorty + 1 + num_args, 'J') +
152 std::count(shorty + 1, shorty + 1 + num_args, 'D');
153 size_t num_arg_vregs = num_args + num_wide_args + (dex_compilation_unit_->IsStatic() ? 0u : 1u);
154
155 // For simplicity, reserve 2 vregs (the maximum) for return value regardless of the return type.
156 size_t return_vregs = 2u;
157 graph_->SetNumberOfVRegs(return_vregs + num_arg_vregs);
158 graph_->SetNumberOfInVRegs(num_arg_vregs);
159
160 // Use ScopedArenaAllocator for all local allocations.
161 ScopedArenaAllocator local_allocator(graph_->GetArenaStack());
162 HBasicBlockBuilder block_builder(graph_,
163 dex_file_,
164 CodeItemDebugInfoAccessor(),
165 &local_allocator);
166 SsaBuilder ssa_builder(graph_,
167 dex_compilation_unit_->GetClassLoader(),
168 dex_compilation_unit_->GetDexCache(),
169 &local_allocator);
170 HInstructionBuilder instruction_builder(graph_,
171 &block_builder,
172 &ssa_builder,
173 dex_file_,
174 CodeItemDebugInfoAccessor(),
175 return_type_,
176 dex_compilation_unit_,
177 outer_compilation_unit_,
178 code_generator_,
179 compilation_stats_,
180 &local_allocator);
181
182 // 1) Create basic blocks for the intrinsic and link them together.
183 block_builder.BuildIntrinsic();
184
185 // 2) Build the trivial dominator tree.
186 GraphAnalysisResult bdt_result = graph_->BuildDominatorTree();
187 DCHECK_EQ(bdt_result, kAnalysisSuccess);
188
189 // 3) Populate basic blocks with instructions for the intrinsic.
190 instruction_builder.BuildIntrinsic(method);
191
192 // 4) Type the graph (no dead/redundant phis to eliminate).
193 GraphAnalysisResult build_ssa_result = ssa_builder.BuildSsa();
194 DCHECK_EQ(build_ssa_result, kAnalysisSuccess);
195 }
196
197 } // namespace art
198