blob: babb1f5628f8718e25b21ad3e4b45c47d8b2db9c [file] [log] [blame]
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +00001/*
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 "code_generator.h"
18
19#include "code_generator_arm.h"
20#include "code_generator_x86.h"
Nicolas Geoffray92cf83e2014-03-18 17:59:20 +000021#include "dex/verified_method.h"
22#include "driver/dex_compilation_unit.h"
23#include "gc_map_builder.h"
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +000024#include "leb128.h"
25#include "mapping_table.h"
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000026#include "utils/assembler.h"
Nicolas Geoffray92cf83e2014-03-18 17:59:20 +000027#include "verifier/dex_gc_map.h"
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +000028#include "vmap_table.h"
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000029
30namespace art {
31
32void CodeGenerator::Compile(CodeAllocator* allocator) {
Nicolas Geoffray787c3072014-03-17 10:20:19 +000033 const GrowableArray<HBasicBlock*>* blocks = GetGraph()->GetBlocks();
34 DCHECK(blocks->Get(0) == GetGraph()->GetEntryBlock());
35 DCHECK(GoesToNextBlock(GetGraph()->GetEntryBlock(), blocks->Get(1)));
Nicolas Geoffrayb55f8352014-04-07 15:26:35 +010036 GenerateFrameEntry();
37 for (size_t i = 0; i < blocks->Size(); i++) {
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000038 CompileBlock(blocks->Get(i));
39 }
Nicolas Geoffray787c3072014-03-17 10:20:19 +000040 size_t code_size = GetAssembler()->CodeSize();
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000041 uint8_t* buffer = allocator->Allocate(code_size);
42 MemoryRegion code(buffer, code_size);
Nicolas Geoffray787c3072014-03-17 10:20:19 +000043 GetAssembler()->FinalizeInstructions(code);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000044}
45
46void CodeGenerator::CompileBlock(HBasicBlock* block) {
47 Bind(GetLabelOf(block));
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +000048 HGraphVisitor* location_builder = GetLocationBuilder();
Nicolas Geoffray787c3072014-03-17 10:20:19 +000049 HGraphVisitor* instruction_visitor = GetInstructionVisitor();
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010050 for (HInstructionIterator it(*block->GetInstructions()); !it.Done(); it.Advance()) {
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +000051 HInstruction* current = it.Current();
52 current->Accept(location_builder);
53 InitLocations(current);
Nicolas Geoffray787c3072014-03-17 10:20:19 +000054 current->Accept(instruction_visitor);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000055 }
56}
57
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +000058void CodeGenerator::InitLocations(HInstruction* instruction) {
Nicolas Geoffray787c3072014-03-17 10:20:19 +000059 if (instruction->GetLocations() == nullptr) return;
Nicolas Geoffrayc32e7702014-04-24 12:43:16 +010060 for (size_t i = 0; i < instruction->InputCount(); i++) {
Nicolas Geoffray787c3072014-03-17 10:20:19 +000061 Location location = instruction->GetLocations()->InAt(i);
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +000062 if (location.IsValid()) {
63 // Move the input to the desired location.
Nicolas Geoffray4a34a422014-04-03 10:38:37 +010064 Move(instruction->InputAt(i), location, instruction);
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +000065 }
66 }
67}
68
69bool CodeGenerator::GoesToNextBlock(HBasicBlock* current, HBasicBlock* next) const {
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000070 // We currently iterate over the block in insertion order.
Nicolas Geoffray787c3072014-03-17 10:20:19 +000071 return current->GetBlockId() + 1 == next->GetBlockId();
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000072}
73
74Label* CodeGenerator::GetLabelOf(HBasicBlock* block) const {
Nicolas Geoffray787c3072014-03-17 10:20:19 +000075 return block_labels_.GetRawStorage() + block->GetBlockId();
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000076}
77
Nicolas Geoffray787c3072014-03-17 10:20:19 +000078CodeGenerator* CodeGenerator::Create(ArenaAllocator* allocator,
79 HGraph* graph,
80 InstructionSet instruction_set) {
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000081 switch (instruction_set) {
82 case kArm:
83 case kThumb2: {
Nicolas Geoffray787c3072014-03-17 10:20:19 +000084 return new (allocator) arm::CodeGeneratorARM(graph);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000085 }
86 case kMips:
Nicolas Geoffray787c3072014-03-17 10:20:19 +000087 return nullptr;
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000088 case kX86: {
Nicolas Geoffray787c3072014-03-17 10:20:19 +000089 return new (allocator) x86::CodeGeneratorX86(graph);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000090 }
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +070091 case kX86_64: {
92 return new (allocator) x86::CodeGeneratorX86(graph);
93 }
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000094 default:
Nicolas Geoffray787c3072014-03-17 10:20:19 +000095 return nullptr;
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000096 }
97}
98
Nicolas Geoffray92cf83e2014-03-18 17:59:20 +000099void CodeGenerator::BuildNativeGCMap(
100 std::vector<uint8_t>* data, const DexCompilationUnit& dex_compilation_unit) const {
101 const std::vector<uint8_t>& gc_map_raw =
102 dex_compilation_unit.GetVerifiedMethod()->GetDexGcMap();
103 verifier::DexPcToReferenceMap dex_gc_map(&(gc_map_raw)[0]);
104
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000105 uint32_t max_native_offset = 0;
106 for (size_t i = 0; i < pc_infos_.Size(); i++) {
107 uint32_t native_offset = pc_infos_.Get(i).native_pc;
108 if (native_offset > max_native_offset) {
109 max_native_offset = native_offset;
110 }
111 }
112
113 GcMapBuilder builder(data, pc_infos_.Size(), max_native_offset, dex_gc_map.RegWidth());
114 for (size_t i = 0; i < pc_infos_.Size(); i++) {
115 struct PcInfo pc_info = pc_infos_.Get(i);
116 uint32_t native_offset = pc_info.native_pc;
117 uint32_t dex_pc = pc_info.dex_pc;
118 const uint8_t* references = dex_gc_map.FindBitMap(dex_pc, false);
119 CHECK(references != NULL) << "Missing ref for dex pc 0x" << std::hex << dex_pc;
120 builder.AddEntry(native_offset, references);
121 }
Nicolas Geoffray92cf83e2014-03-18 17:59:20 +0000122}
123
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000124void CodeGenerator::BuildMappingTable(std::vector<uint8_t>* data) const {
125 uint32_t pc2dex_data_size = 0u;
126 uint32_t pc2dex_entries = pc_infos_.Size();
127 uint32_t pc2dex_offset = 0u;
128 int32_t pc2dex_dalvik_offset = 0;
129 uint32_t dex2pc_data_size = 0u;
130 uint32_t dex2pc_entries = 0u;
131
132 // We currently only have pc2dex entries.
133 for (size_t i = 0; i < pc2dex_entries; i++) {
134 struct PcInfo pc_info = pc_infos_.Get(i);
135 pc2dex_data_size += UnsignedLeb128Size(pc_info.native_pc - pc2dex_offset);
136 pc2dex_data_size += SignedLeb128Size(pc_info.dex_pc - pc2dex_dalvik_offset);
137 pc2dex_offset = pc_info.native_pc;
138 pc2dex_dalvik_offset = pc_info.dex_pc;
139 }
140
141 uint32_t total_entries = pc2dex_entries + dex2pc_entries;
142 uint32_t hdr_data_size = UnsignedLeb128Size(total_entries) + UnsignedLeb128Size(pc2dex_entries);
143 uint32_t data_size = hdr_data_size + pc2dex_data_size + dex2pc_data_size;
144 data->resize(data_size);
145
146 uint8_t* data_ptr = &(*data)[0];
147 uint8_t* write_pos = data_ptr;
148 write_pos = EncodeUnsignedLeb128(write_pos, total_entries);
149 write_pos = EncodeUnsignedLeb128(write_pos, pc2dex_entries);
150 DCHECK_EQ(static_cast<size_t>(write_pos - data_ptr), hdr_data_size);
151 uint8_t* write_pos2 = write_pos + pc2dex_data_size;
152
153 pc2dex_offset = 0u;
154 pc2dex_dalvik_offset = 0u;
155 for (size_t i = 0; i < pc2dex_entries; i++) {
156 struct PcInfo pc_info = pc_infos_.Get(i);
157 DCHECK(pc2dex_offset <= pc_info.native_pc);
158 write_pos = EncodeUnsignedLeb128(write_pos, pc_info.native_pc - pc2dex_offset);
159 write_pos = EncodeSignedLeb128(write_pos, pc_info.dex_pc - pc2dex_dalvik_offset);
160 pc2dex_offset = pc_info.native_pc;
161 pc2dex_dalvik_offset = pc_info.dex_pc;
162 }
163 DCHECK_EQ(static_cast<size_t>(write_pos - data_ptr), hdr_data_size + pc2dex_data_size);
164 DCHECK_EQ(static_cast<size_t>(write_pos2 - data_ptr), data_size);
165
166 if (kIsDebugBuild) {
167 // Verify the encoded table holds the expected data.
168 MappingTable table(data_ptr);
169 CHECK_EQ(table.TotalSize(), total_entries);
170 CHECK_EQ(table.PcToDexSize(), pc2dex_entries);
171 auto it = table.PcToDexBegin();
172 auto it2 = table.DexToPcBegin();
173 for (size_t i = 0; i < pc2dex_entries; i++) {
174 struct PcInfo pc_info = pc_infos_.Get(i);
175 CHECK_EQ(pc_info.native_pc, it.NativePcOffset());
176 CHECK_EQ(pc_info.dex_pc, it.DexPc());
177 ++it;
178 }
179 CHECK(it == table.PcToDexEnd());
180 CHECK(it2 == table.DexToPcEnd());
181 }
182}
183
184void CodeGenerator::BuildVMapTable(std::vector<uint8_t>* data) const {
185 Leb128EncodingVector vmap_encoder;
Nicolas Geoffray4a34a422014-04-03 10:38:37 +0100186 // We currently don't use callee-saved registers.
187 size_t size = 0 + 1 /* marker */ + 0;
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000188 vmap_encoder.Reserve(size + 1u); // All values are likely to be one byte in ULEB128 (<128).
189 vmap_encoder.PushBackUnsigned(size);
Nicolas Geoffray8ccc3f52014-03-19 10:34:11 +0000190 vmap_encoder.PushBackUnsigned(VmapTable::kAdjustedFpMarker);
191
192 *data = vmap_encoder.GetData();
193}
Nicolas Geoffray92cf83e2014-03-18 17:59:20 +0000194
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000195} // namespace art