blob: 52b2e15342cae50a568b30f2dc2cc48f40f02515 [file] [log] [blame]
Brian Carlstrom7940e442013-07-12 13:46:57 -07001/*
2 * Copyright (C) 2011 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
Andreas Gampe0b9203e2015-01-22 20:39:27 -080017#include "mir_to_lir-inl.h"
18
19#include "dex/mir_graph.h"
20#include "driver/compiler_driver.h"
Yevgeny Roubane3ea8382014-08-08 16:29:38 +070021#include "driver/compiler_options.h"
Andreas Gampe0b9203e2015-01-22 20:39:27 -080022#include "driver/dex_compilation_unit.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070023#include "dex_file-inl.h"
24#include "gc_map.h"
Nicolas Geoffray92cf83e2014-03-18 17:59:20 +000025#include "gc_map_builder.h"
Ian Rogers96faf5b2013-08-09 22:05:32 -070026#include "mapping_table.h"
Vladimir Marko5816ed42013-11-27 17:04:20 +000027#include "dex/quick/dex_file_method_inliner.h"
28#include "dex/quick/dex_file_to_method_inliner_map.h"
Vladimir Markoc7f83202014-01-24 17:55:18 +000029#include "dex/verification_results.h"
Vladimir Marko2730db02014-01-27 11:15:17 +000030#include "dex/verified_method.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070031#include "verifier/dex_gc_map.h"
32#include "verifier/method_verifier.h"
Vladimir Marko2e589aa2014-02-25 17:53:53 +000033#include "vmap_table.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070034
35namespace art {
36
Vladimir Marko06606b92013-12-02 15:31:08 +000037namespace {
38
39/* Dump a mapping table */
40template <typename It>
41void DumpMappingTable(const char* table_name, const char* descriptor, const char* name,
42 const Signature& signature, uint32_t size, It first) {
43 if (size != 0) {
Ian Rogers107c31e2014-01-23 20:55:29 -080044 std::string line(StringPrintf("\n %s %s%s_%s_table[%u] = {", table_name,
Vladimir Marko06606b92013-12-02 15:31:08 +000045 descriptor, name, signature.ToString().c_str(), size));
46 std::replace(line.begin(), line.end(), ';', '_');
47 LOG(INFO) << line;
48 for (uint32_t i = 0; i != size; ++i) {
49 line = StringPrintf(" {0x%05x, 0x%04x},", first.NativePcOffset(), first.DexPc());
50 ++first;
51 LOG(INFO) << line;
52 }
53 LOG(INFO) <<" };\n\n";
54 }
55}
56
57} // anonymous namespace
58
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070059bool Mir2Lir::IsInexpensiveConstant(RegLocation rl_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -070060 bool res = false;
61 if (rl_src.is_const) {
62 if (rl_src.wide) {
Andreas Gampede0b9962014-08-27 14:24:42 -070063 // For wide registers, check whether we're the high partner. In that case we need to switch
64 // to the lower one for the correct value.
65 if (rl_src.high_word) {
66 rl_src.high_word = false;
67 rl_src.s_reg_low--;
68 rl_src.orig_sreg--;
69 }
Brian Carlstrom7940e442013-07-12 13:46:57 -070070 if (rl_src.fp) {
Andreas Gampede0b9962014-08-27 14:24:42 -070071 res = InexpensiveConstantDouble(mir_graph_->ConstantValueWide(rl_src));
Brian Carlstrom7940e442013-07-12 13:46:57 -070072 } else {
Andreas Gampede0b9962014-08-27 14:24:42 -070073 res = InexpensiveConstantLong(mir_graph_->ConstantValueWide(rl_src));
Brian Carlstrom7940e442013-07-12 13:46:57 -070074 }
75 } else {
76 if (rl_src.fp) {
Andreas Gampede0b9962014-08-27 14:24:42 -070077 res = InexpensiveConstantFloat(mir_graph_->ConstantValue(rl_src));
Brian Carlstrom7940e442013-07-12 13:46:57 -070078 } else {
Andreas Gampede0b9962014-08-27 14:24:42 -070079 res = InexpensiveConstantInt(mir_graph_->ConstantValue(rl_src));
Brian Carlstrom7940e442013-07-12 13:46:57 -070080 }
81 }
82 }
83 return res;
84}
85
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070086void Mir2Lir::MarkSafepointPC(LIR* inst) {
buzbeeb48819d2013-09-14 16:15:25 -070087 DCHECK(!inst->flags.use_def_invalid);
Vladimir Marko8dea81c2014-06-06 14:50:36 +010088 inst->u.m.def_mask = &kEncodeAll;
Brian Carlstrom7940e442013-07-12 13:46:57 -070089 LIR* safepoint_pc = NewLIR0(kPseudoSafepointPC);
Vladimir Marko8dea81c2014-06-06 14:50:36 +010090 DCHECK(safepoint_pc->u.m.def_mask->Equals(kEncodeAll));
Brian Carlstrom7940e442013-07-12 13:46:57 -070091}
92
Andreas Gampe3c12c512014-06-24 18:46:29 +000093void Mir2Lir::MarkSafepointPCAfter(LIR* after) {
94 DCHECK(!after->flags.use_def_invalid);
95 after->u.m.def_mask = &kEncodeAll;
96 // As NewLIR0 uses Append, we need to create the LIR by hand.
97 LIR* safepoint_pc = RawLIR(current_dalvik_offset_, kPseudoSafepointPC);
98 if (after->next == nullptr) {
99 DCHECK_EQ(after, last_lir_insn_);
100 AppendLIR(safepoint_pc);
101 } else {
102 InsertLIRAfter(after, safepoint_pc);
103 }
104 DCHECK(safepoint_pc->u.m.def_mask->Equals(kEncodeAll));
105}
106
buzbee252254b2013-09-08 16:20:53 -0700107/* Remove a LIR from the list. */
108void Mir2Lir::UnlinkLIR(LIR* lir) {
109 if (UNLIKELY(lir == first_lir_insn_)) {
110 first_lir_insn_ = lir->next;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700111 if (lir->next != nullptr) {
112 lir->next->prev = nullptr;
buzbee252254b2013-09-08 16:20:53 -0700113 } else {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700114 DCHECK(lir->next == nullptr);
buzbee252254b2013-09-08 16:20:53 -0700115 DCHECK(lir == last_lir_insn_);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700116 last_lir_insn_ = nullptr;
buzbee252254b2013-09-08 16:20:53 -0700117 }
118 } else if (lir == last_lir_insn_) {
119 last_lir_insn_ = lir->prev;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700120 lir->prev->next = nullptr;
121 } else if ((lir->prev != nullptr) && (lir->next != nullptr)) {
buzbee252254b2013-09-08 16:20:53 -0700122 lir->prev->next = lir->next;
123 lir->next->prev = lir->prev;
124 }
125}
126
Brian Carlstrom7940e442013-07-12 13:46:57 -0700127/* Convert an instruction to a NOP */
Brian Carlstromdf629502013-07-17 22:39:56 -0700128void Mir2Lir::NopLIR(LIR* lir) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700129 lir->flags.is_nop = true;
buzbee252254b2013-09-08 16:20:53 -0700130 if (!cu_->verbose) {
131 UnlinkLIR(lir);
132 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700133}
134
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700135void Mir2Lir::SetMemRefType(LIR* lir, bool is_load, int mem_type) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700136 DCHECK(GetTargetInstFlags(lir->opcode) & (IS_LOAD | IS_STORE));
buzbeeb48819d2013-09-14 16:15:25 -0700137 DCHECK(!lir->flags.use_def_invalid);
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100138 // TODO: Avoid the extra Arena allocation!
139 const ResourceMask** mask_ptr;
140 ResourceMask mask;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700141 if (is_load) {
buzbeeb48819d2013-09-14 16:15:25 -0700142 mask_ptr = &lir->u.m.use_mask;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700143 } else {
buzbeeb48819d2013-09-14 16:15:25 -0700144 mask_ptr = &lir->u.m.def_mask;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700145 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100146 mask = **mask_ptr;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700147 /* Clear out the memref flags */
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100148 mask.ClearBits(kEncodeMem);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700149 /* ..and then add back the one we need */
150 switch (mem_type) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100151 case ResourceMask::kLiteral:
Brian Carlstrom7940e442013-07-12 13:46:57 -0700152 DCHECK(is_load);
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100153 mask.SetBit(ResourceMask::kLiteral);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700154 break;
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100155 case ResourceMask::kDalvikReg:
156 mask.SetBit(ResourceMask::kDalvikReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700157 break;
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100158 case ResourceMask::kHeapRef:
159 mask.SetBit(ResourceMask::kHeapRef);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700160 break;
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100161 case ResourceMask::kMustNotAlias:
Brian Carlstrom7940e442013-07-12 13:46:57 -0700162 /* Currently only loads can be marked as kMustNotAlias */
163 DCHECK(!(GetTargetInstFlags(lir->opcode) & IS_STORE));
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100164 mask.SetBit(ResourceMask::kMustNotAlias);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700165 break;
166 default:
167 LOG(FATAL) << "Oat: invalid memref kind - " << mem_type;
168 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100169 *mask_ptr = mask_cache_.GetMask(mask);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700170}
171
172/*
173 * Mark load/store instructions that access Dalvik registers through the stack.
174 */
175void Mir2Lir::AnnotateDalvikRegAccess(LIR* lir, int reg_id, bool is_load,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700176 bool is64bit) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100177 DCHECK((is_load ? lir->u.m.use_mask : lir->u.m.def_mask)->Intersection(kEncodeMem).Equals(
178 kEncodeDalvikReg));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700179
180 /*
181 * Store the Dalvik register id in alias_info. Mark the MSB if it is a 64-bit
182 * access.
183 */
buzbeeb48819d2013-09-14 16:15:25 -0700184 lir->flags.alias_info = ENCODE_ALIAS_INFO(reg_id, is64bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700185}
186
187/*
188 * Debugging macros
189 */
190#define DUMP_RESOURCE_MASK(X)
191
192/* Pretty-print a LIR instruction */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700193void Mir2Lir::DumpLIRInsn(LIR* lir, unsigned char* base_addr) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700194 int offset = lir->offset;
195 int dest = lir->operands[0];
196 const bool dump_nop = (cu_->enable_debug & (1 << kDebugShowNops));
197
198 /* Handle pseudo-ops individually, and all regular insns as a group */
199 switch (lir->opcode) {
200 case kPseudoMethodEntry:
201 LOG(INFO) << "-------- method entry "
202 << PrettyMethod(cu_->method_idx, *cu_->dex_file);
203 break;
204 case kPseudoMethodExit:
205 LOG(INFO) << "-------- Method_Exit";
206 break;
207 case kPseudoBarrier:
208 LOG(INFO) << "-------- BARRIER";
209 break;
210 case kPseudoEntryBlock:
211 LOG(INFO) << "-------- entry offset: 0x" << std::hex << dest;
212 break;
213 case kPseudoDalvikByteCodeBoundary:
214 if (lir->operands[0] == 0) {
buzbee0d829482013-10-11 15:24:55 -0700215 // NOTE: only used for debug listings.
216 lir->operands[0] = WrapPointer(ArenaStrdup("No instruction string"));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700217 }
218 LOG(INFO) << "-------- dalvik offset: 0x" << std::hex
Bill Buzbee0b1191c2013-10-28 22:11:59 +0000219 << lir->dalvik_offset << " @ "
220 << reinterpret_cast<char*>(UnwrapPointer(lir->operands[0]));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700221 break;
222 case kPseudoExitBlock:
223 LOG(INFO) << "-------- exit offset: 0x" << std::hex << dest;
224 break;
225 case kPseudoPseudoAlign4:
226 LOG(INFO) << reinterpret_cast<uintptr_t>(base_addr) + offset << " (0x" << std::hex
227 << offset << "): .align4";
228 break;
229 case kPseudoEHBlockLabel:
230 LOG(INFO) << "Exception_Handling:";
231 break;
232 case kPseudoTargetLabel:
233 case kPseudoNormalBlockLabel:
234 LOG(INFO) << "L" << reinterpret_cast<void*>(lir) << ":";
235 break;
236 case kPseudoThrowTarget:
237 LOG(INFO) << "LT" << reinterpret_cast<void*>(lir) << ":";
238 break;
239 case kPseudoIntrinsicRetry:
240 LOG(INFO) << "IR" << reinterpret_cast<void*>(lir) << ":";
241 break;
242 case kPseudoSuspendTarget:
243 LOG(INFO) << "LS" << reinterpret_cast<void*>(lir) << ":";
244 break;
245 case kPseudoSafepointPC:
246 LOG(INFO) << "LsafepointPC_0x" << std::hex << lir->offset << "_" << lir->dalvik_offset << ":";
247 break;
248 case kPseudoExportedPC:
249 LOG(INFO) << "LexportedPC_0x" << std::hex << lir->offset << "_" << lir->dalvik_offset << ":";
250 break;
251 case kPseudoCaseLabel:
252 LOG(INFO) << "LC" << reinterpret_cast<void*>(lir) << ": Case target 0x"
253 << std::hex << lir->operands[0] << "|" << std::dec <<
254 lir->operands[0];
255 break;
256 default:
257 if (lir->flags.is_nop && !dump_nop) {
258 break;
259 } else {
260 std::string op_name(BuildInsnString(GetTargetInstName(lir->opcode),
261 lir, base_addr));
262 std::string op_operands(BuildInsnString(GetTargetInstFmt(lir->opcode),
263 lir, base_addr));
Ian Rogers107c31e2014-01-23 20:55:29 -0800264 LOG(INFO) << StringPrintf("%5p: %-9s%s%s",
265 base_addr + offset,
Brian Carlstrom7940e442013-07-12 13:46:57 -0700266 op_name.c_str(), op_operands.c_str(),
267 lir->flags.is_nop ? "(nop)" : "");
268 }
269 break;
270 }
271
buzbeeb48819d2013-09-14 16:15:25 -0700272 if (lir->u.m.use_mask && (!lir->flags.is_nop || dump_nop)) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100273 DUMP_RESOURCE_MASK(DumpResourceMask(lir, *lir->u.m.use_mask, "use"));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700274 }
buzbeeb48819d2013-09-14 16:15:25 -0700275 if (lir->u.m.def_mask && (!lir->flags.is_nop || dump_nop)) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100276 DUMP_RESOURCE_MASK(DumpResourceMask(lir, *lir->u.m.def_mask, "def"));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700277 }
278}
279
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700280void Mir2Lir::DumpPromotionMap() {
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -0700281 uint32_t num_regs = mir_graph_->GetNumOfCodeAndTempVRs();
282 for (uint32_t i = 0; i < num_regs; i++) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700283 PromotionMap v_reg_map = promotion_map_[i];
284 std::string buf;
285 if (v_reg_map.fp_location == kLocPhysReg) {
buzbeeb5860fb2014-06-21 15:31:01 -0700286 StringAppendF(&buf, " : s%d", RegStorage::RegNum(v_reg_map.fp_reg));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700287 }
288
289 std::string buf3;
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -0700290 if (i < mir_graph_->GetNumOfCodeVRs()) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700291 StringAppendF(&buf3, "%02d", i);
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -0700292 } else if (i == mir_graph_->GetNumOfCodeVRs()) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700293 buf3 = "Method*";
294 } else {
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -0700295 uint32_t diff = i - mir_graph_->GetNumOfCodeVRs();
296 StringAppendF(&buf3, "ct%d", diff);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700297 }
298
299 LOG(INFO) << StringPrintf("V[%s] -> %s%d%s", buf3.c_str(),
300 v_reg_map.core_location == kLocPhysReg ?
301 "r" : "SP+", v_reg_map.core_location == kLocPhysReg ?
302 v_reg_map.core_reg : SRegOffset(i),
303 buf.c_str());
304 }
305}
306
buzbee7a11ab02014-04-28 20:02:38 -0700307void Mir2Lir::UpdateLIROffsets() {
308 // Only used for code listings.
309 size_t offset = 0;
310 for (LIR* lir = first_lir_insn_; lir != nullptr; lir = lir->next) {
311 lir->offset = offset;
312 if (!lir->flags.is_nop && !IsPseudoLirOp(lir->opcode)) {
313 offset += GetInsnSize(lir);
314 } else if (lir->opcode == kPseudoPseudoAlign4) {
315 offset += (offset & 0x2);
316 }
317 }
318}
319
Vladimir Marko743b98c2014-11-24 19:45:41 +0000320void Mir2Lir::MarkGCCard(int opt_flags, RegStorage val_reg, RegStorage tgt_addr_reg) {
Vladimir Markobf535be2014-11-19 18:52:35 +0000321 DCHECK(val_reg.Valid());
322 DCHECK_EQ(val_reg.Is64Bit(), cu_->target64);
Vladimir Marko743b98c2014-11-24 19:45:41 +0000323 if ((opt_flags & MIR_STORE_NON_NULL_VALUE) != 0) {
324 UnconditionallyMarkGCCard(tgt_addr_reg);
325 } else {
326 LIR* branch_over = OpCmpImmBranch(kCondEq, val_reg, 0, nullptr);
327 UnconditionallyMarkGCCard(tgt_addr_reg);
328 LIR* target = NewLIR0(kPseudoTargetLabel);
329 branch_over->target = target;
330 }
Vladimir Markobf535be2014-11-19 18:52:35 +0000331}
332
Brian Carlstrom7940e442013-07-12 13:46:57 -0700333/* Dump instructions and constant pool contents */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700334void Mir2Lir::CodegenDump() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700335 LOG(INFO) << "Dumping LIR insns for "
336 << PrettyMethod(cu_->method_idx, *cu_->dex_file);
337 LIR* lir_insn;
Razvan A Lupusoru75035972014-09-11 15:24:59 -0700338 int insns_size = mir_graph_->GetNumDalvikInsns();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700339
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -0700340 LOG(INFO) << "Regs (excluding ins) : " << mir_graph_->GetNumOfLocalCodeVRs();
341 LOG(INFO) << "Ins : " << mir_graph_->GetNumOfInVRs();
342 LOG(INFO) << "Outs : " << mir_graph_->GetNumOfOutVRs();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700343 LOG(INFO) << "CoreSpills : " << num_core_spills_;
344 LOG(INFO) << "FPSpills : " << num_fp_spills_;
Razvan A Lupusoruda7a69b2014-01-08 15:09:50 -0800345 LOG(INFO) << "CompilerTemps : " << mir_graph_->GetNumUsedCompilerTemps();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700346 LOG(INFO) << "Frame size : " << frame_size_;
347 LOG(INFO) << "code size is " << total_size_ <<
348 " bytes, Dalvik size is " << insns_size * 2;
349 LOG(INFO) << "expansion factor: "
350 << static_cast<float>(total_size_) / static_cast<float>(insns_size * 2);
351 DumpPromotionMap();
buzbee7a11ab02014-04-28 20:02:38 -0700352 UpdateLIROffsets();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700353 for (lir_insn = first_lir_insn_; lir_insn != nullptr; lir_insn = lir_insn->next) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700354 DumpLIRInsn(lir_insn, 0);
355 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700356 for (lir_insn = literal_list_; lir_insn != nullptr; lir_insn = lir_insn->next) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700357 LOG(INFO) << StringPrintf("%x (%04x): .word (%#x)", lir_insn->offset, lir_insn->offset,
358 lir_insn->operands[0]);
359 }
360
361 const DexFile::MethodId& method_id =
362 cu_->dex_file->GetMethodId(cu_->method_idx);
Ian Rogersd91d6d62013-09-25 20:26:14 -0700363 const Signature signature = cu_->dex_file->GetMethodSignature(method_id);
364 const char* name = cu_->dex_file->GetMethodName(method_id);
365 const char* descriptor(cu_->dex_file->GetMethodDeclaringClassDescriptor(method_id));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700366
367 // Dump mapping tables
Vladimir Marko06606b92013-12-02 15:31:08 +0000368 if (!encoded_mapping_table_.empty()) {
369 MappingTable table(&encoded_mapping_table_[0]);
370 DumpMappingTable("PC2Dex_MappingTable", descriptor, name, signature,
371 table.PcToDexSize(), table.PcToDexBegin());
372 DumpMappingTable("Dex2PC_MappingTable", descriptor, name, signature,
373 table.DexToPcSize(), table.DexToPcBegin());
374 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700375}
376
377/*
378 * Search the existing constants in the literal pool for an exact or close match
379 * within specified delta (greater or equal to 0).
380 */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700381LIR* Mir2Lir::ScanLiteralPool(LIR* data_target, int value, unsigned int delta) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700382 while (data_target) {
383 if ((static_cast<unsigned>(value - data_target->operands[0])) <= delta)
384 return data_target;
385 data_target = data_target->next;
386 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700387 return nullptr;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700388}
389
390/* Search the existing constants in the literal pool for an exact wide match */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700391LIR* Mir2Lir::ScanLiteralPoolWide(LIR* data_target, int val_lo, int val_hi) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700392 bool lo_match = false;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700393 LIR* lo_target = nullptr;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700394 while (data_target) {
395 if (lo_match && (data_target->operands[0] == val_hi)) {
396 // Record high word in case we need to expand this later.
397 lo_target->operands[1] = val_hi;
398 return lo_target;
399 }
400 lo_match = false;
401 if (data_target->operands[0] == val_lo) {
402 lo_match = true;
403 lo_target = data_target;
404 }
405 data_target = data_target->next;
406 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700407 return nullptr;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700408}
409
Vladimir Markoa51a0b02014-05-21 12:08:39 +0100410/* Search the existing constants in the literal pool for an exact method match */
411LIR* Mir2Lir::ScanLiteralPoolMethod(LIR* data_target, const MethodReference& method) {
412 while (data_target) {
413 if (static_cast<uint32_t>(data_target->operands[0]) == method.dex_method_index &&
414 UnwrapPointer(data_target->operands[1]) == method.dex_file) {
415 return data_target;
416 }
417 data_target = data_target->next;
418 }
419 return nullptr;
420}
421
Fred Shihe7f82e22014-08-06 10:46:37 -0700422/* Search the existing constants in the literal pool for an exact class match */
423LIR* Mir2Lir::ScanLiteralPoolClass(LIR* data_target, const DexFile& dex_file, uint32_t type_idx) {
424 while (data_target) {
425 if (static_cast<uint32_t>(data_target->operands[0]) == type_idx &&
426 UnwrapPointer(data_target->operands[1]) == &dex_file) {
427 return data_target;
428 }
429 data_target = data_target->next;
430 }
431 return nullptr;
432}
433
Brian Carlstrom7940e442013-07-12 13:46:57 -0700434/*
435 * The following are building blocks to insert constants into the pool or
436 * instruction streams.
437 */
438
439/* Add a 32-bit constant to the constant pool */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700440LIR* Mir2Lir::AddWordData(LIR* *constant_list_p, int value) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700441 /* Add the constant to the literal pool */
442 if (constant_list_p) {
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000443 LIR* new_value = static_cast<LIR*>(arena_->Alloc(sizeof(LIR), kArenaAllocData));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700444 new_value->operands[0] = value;
445 new_value->next = *constant_list_p;
446 *constant_list_p = new_value;
buzbeeb48819d2013-09-14 16:15:25 -0700447 estimated_native_code_size_ += sizeof(value);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700448 return new_value;
449 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700450 return nullptr;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700451}
452
453/* Add a 64-bit constant to the constant pool or mixed with code */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700454LIR* Mir2Lir::AddWideData(LIR* *constant_list_p, int val_lo, int val_hi) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700455 AddWordData(constant_list_p, val_hi);
456 return AddWordData(constant_list_p, val_lo);
457}
458
Andreas Gampe2da88232014-02-27 12:26:20 -0800459static void Push32(std::vector<uint8_t>&buf, int data) {
Brian Carlstromdf629502013-07-17 22:39:56 -0700460 buf.push_back(data & 0xff);
461 buf.push_back((data >> 8) & 0xff);
462 buf.push_back((data >> 16) & 0xff);
463 buf.push_back((data >> 24) & 0xff);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700464}
465
Matteo Franchin27cc0932014-09-08 18:29:24 +0100466/**
467 * @brief Push a compressed reference which needs patching at link/patchoat-time.
468 * @details This needs to be kept consistent with the code which actually does the patching in
469 * oat_writer.cc and in the patchoat tool.
470 */
471static void PushUnpatchedReference(std::vector<uint8_t>&buf) {
472 // Note that we can safely initialize the patches to zero. The code deduplication mechanism takes
473 // the patches into account when determining whether two pieces of codes are functionally
474 // equivalent.
475 Push32(buf, UINT32_C(0));
buzbee0d829482013-10-11 15:24:55 -0700476}
477
Brian Carlstrom7940e442013-07-12 13:46:57 -0700478static void AlignBuffer(std::vector<uint8_t>&buf, size_t offset) {
479 while (buf.size() < offset) {
480 buf.push_back(0);
481 }
482}
483
484/* Write the literal pool to the output stream */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700485void Mir2Lir::InstallLiteralPools() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700486 AlignBuffer(code_buffer_, data_offset_);
487 LIR* data_lir = literal_list_;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700488 while (data_lir != nullptr) {
Andreas Gampe2da88232014-02-27 12:26:20 -0800489 Push32(code_buffer_, data_lir->operands[0]);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700490 data_lir = NEXT_LIR(data_lir);
491 }
Vladimir Markof4da6752014-08-01 19:04:18 +0100492 // TODO: patches_.reserve() as needed.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700493 // Push code and method literals, record offsets for the compiler to patch.
494 data_lir = code_literal_list_;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700495 while (data_lir != nullptr) {
Jeff Hao49161ce2014-03-12 11:05:25 -0700496 uint32_t target_method_idx = data_lir->operands[0];
497 const DexFile* target_dex_file =
498 reinterpret_cast<const DexFile*>(UnwrapPointer(data_lir->operands[1]));
Vladimir Markof4da6752014-08-01 19:04:18 +0100499 patches_.push_back(LinkerPatch::CodePatch(code_buffer_.size(),
500 target_dex_file, target_method_idx));
Matteo Franchin27cc0932014-09-08 18:29:24 +0100501 PushUnpatchedReference(code_buffer_);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700502 data_lir = NEXT_LIR(data_lir);
503 }
504 data_lir = method_literal_list_;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700505 while (data_lir != nullptr) {
Jeff Hao49161ce2014-03-12 11:05:25 -0700506 uint32_t target_method_idx = data_lir->operands[0];
507 const DexFile* target_dex_file =
508 reinterpret_cast<const DexFile*>(UnwrapPointer(data_lir->operands[1]));
Vladimir Markof4da6752014-08-01 19:04:18 +0100509 patches_.push_back(LinkerPatch::MethodPatch(code_buffer_.size(),
510 target_dex_file, target_method_idx));
Matteo Franchin27cc0932014-09-08 18:29:24 +0100511 PushUnpatchedReference(code_buffer_);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700512 data_lir = NEXT_LIR(data_lir);
513 }
Hiroshi Yamauchibe1ca552014-01-15 11:46:48 -0800514 // Push class literals.
515 data_lir = class_literal_list_;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700516 while (data_lir != nullptr) {
Vladimir Markof4da6752014-08-01 19:04:18 +0100517 uint32_t target_type_idx = data_lir->operands[0];
Fred Shihe7f82e22014-08-06 10:46:37 -0700518 const DexFile* class_dex_file =
519 reinterpret_cast<const DexFile*>(UnwrapPointer(data_lir->operands[1]));
Vladimir Markof4da6752014-08-01 19:04:18 +0100520 patches_.push_back(LinkerPatch::TypePatch(code_buffer_.size(),
521 class_dex_file, target_type_idx));
Matteo Franchin27cc0932014-09-08 18:29:24 +0100522 PushUnpatchedReference(code_buffer_);
Hiroshi Yamauchibe1ca552014-01-15 11:46:48 -0800523 data_lir = NEXT_LIR(data_lir);
524 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700525}
526
527/* Write the switch tables to the output stream */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700528void Mir2Lir::InstallSwitchTables() {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100529 for (Mir2Lir::SwitchTable* tab_rec : switch_tables_) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700530 AlignBuffer(code_buffer_, tab_rec->offset);
531 /*
532 * For Arm, our reference point is the address of the bx
533 * instruction that does the launch, so we have to subtract
534 * the auto pc-advance. For other targets the reference point
535 * is a label, so we can use the offset as-is.
536 */
537 int bx_offset = INVALID_OFFSET;
538 switch (cu_->instruction_set) {
539 case kThumb2:
buzbeeb48819d2013-09-14 16:15:25 -0700540 DCHECK(tab_rec->anchor->flags.fixup != kFixupNone);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700541 bx_offset = tab_rec->anchor->offset + 4;
542 break;
543 case kX86:
544 bx_offset = 0;
545 break;
Mark Mendell27dee8b2014-12-01 19:06:12 -0500546 case kX86_64:
547 // RIP relative to switch table.
548 bx_offset = tab_rec->offset;
549 break;
Matteo Franchine45fb9e2014-05-06 10:10:30 +0100550 case kArm64:
Brian Carlstrom7940e442013-07-12 13:46:57 -0700551 case kMips:
552 bx_offset = tab_rec->anchor->offset;
553 break;
554 default: LOG(FATAL) << "Unexpected instruction set: " << cu_->instruction_set;
555 }
556 if (cu_->verbose) {
557 LOG(INFO) << "Switch table for offset 0x" << std::hex << bx_offset;
558 }
559 if (tab_rec->table[0] == Instruction::kSparseSwitchSignature) {
buzbee0d829482013-10-11 15:24:55 -0700560 const int32_t* keys = reinterpret_cast<const int32_t*>(&(tab_rec->table[2]));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700561 for (int elems = 0; elems < tab_rec->table[1]; elems++) {
562 int disp = tab_rec->targets[elems]->offset - bx_offset;
563 if (cu_->verbose) {
564 LOG(INFO) << " Case[" << elems << "] key: 0x"
565 << std::hex << keys[elems] << ", disp: 0x"
566 << std::hex << disp;
567 }
Andreas Gampe2da88232014-02-27 12:26:20 -0800568 Push32(code_buffer_, keys[elems]);
569 Push32(code_buffer_,
Brian Carlstrom7940e442013-07-12 13:46:57 -0700570 tab_rec->targets[elems]->offset - bx_offset);
571 }
572 } else {
573 DCHECK_EQ(static_cast<int>(tab_rec->table[0]),
574 static_cast<int>(Instruction::kPackedSwitchSignature));
575 for (int elems = 0; elems < tab_rec->table[1]; elems++) {
576 int disp = tab_rec->targets[elems]->offset - bx_offset;
577 if (cu_->verbose) {
578 LOG(INFO) << " Case[" << elems << "] disp: 0x"
579 << std::hex << disp;
580 }
Andreas Gampe2da88232014-02-27 12:26:20 -0800581 Push32(code_buffer_, tab_rec->targets[elems]->offset - bx_offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700582 }
583 }
584 }
585}
586
587/* Write the fill array dta to the output stream */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700588void Mir2Lir::InstallFillArrayData() {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100589 for (Mir2Lir::FillArrayData* tab_rec : fill_array_data_) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700590 AlignBuffer(code_buffer_, tab_rec->offset);
591 for (int i = 0; i < (tab_rec->size + 1) / 2; i++) {
Brian Carlstromdf629502013-07-17 22:39:56 -0700592 code_buffer_.push_back(tab_rec->table[i] & 0xFF);
593 code_buffer_.push_back((tab_rec->table[i] >> 8) & 0xFF);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700594 }
595 }
596}
597
buzbee0d829482013-10-11 15:24:55 -0700598static int AssignLiteralOffsetCommon(LIR* lir, CodeOffset offset) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700599 for (; lir != nullptr; lir = lir->next) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700600 lir->offset = offset;
601 offset += 4;
602 }
603 return offset;
604}
605
Ian Rogersff093b32014-04-30 19:04:27 -0700606static int AssignLiteralPointerOffsetCommon(LIR* lir, CodeOffset offset,
607 unsigned int element_size) {
buzbee0d829482013-10-11 15:24:55 -0700608 // Align to natural pointer size.
Andreas Gampe66018822014-05-05 20:47:19 -0700609 offset = RoundUp(offset, element_size);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700610 for (; lir != nullptr; lir = lir->next) {
buzbee0d829482013-10-11 15:24:55 -0700611 lir->offset = offset;
612 offset += element_size;
613 }
614 return offset;
615}
616
Brian Carlstrom7940e442013-07-12 13:46:57 -0700617// Make sure we have a code address for every declared catch entry
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700618bool Mir2Lir::VerifyCatchEntries() {
Vladimir Marko06606b92013-12-02 15:31:08 +0000619 MappingTable table(&encoded_mapping_table_[0]);
620 std::vector<uint32_t> dex_pcs;
621 dex_pcs.reserve(table.DexToPcSize());
622 for (auto it = table.DexToPcBegin(), end = table.DexToPcEnd(); it != end; ++it) {
623 dex_pcs.push_back(it.DexPc());
624 }
625 // Sort dex_pcs, so that we can quickly check it against the ordered mir_graph_->catches_.
626 std::sort(dex_pcs.begin(), dex_pcs.end());
627
Brian Carlstrom7940e442013-07-12 13:46:57 -0700628 bool success = true;
Vladimir Marko06606b92013-12-02 15:31:08 +0000629 auto it = dex_pcs.begin(), end = dex_pcs.end();
630 for (uint32_t dex_pc : mir_graph_->catches_) {
631 while (it != end && *it < dex_pc) {
632 LOG(INFO) << "Unexpected catch entry @ dex pc 0x" << std::hex << *it;
633 ++it;
634 success = false;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700635 }
Vladimir Marko06606b92013-12-02 15:31:08 +0000636 if (it == end || *it > dex_pc) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700637 LOG(INFO) << "Missing native PC for catch entry @ 0x" << std::hex << dex_pc;
638 success = false;
Vladimir Marko06606b92013-12-02 15:31:08 +0000639 } else {
640 ++it;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700641 }
642 }
643 if (!success) {
644 LOG(INFO) << "Bad dex2pcMapping table in " << PrettyMethod(cu_->method_idx, *cu_->dex_file);
645 LOG(INFO) << "Entries @ decode: " << mir_graph_->catches_.size() << ", Entries in table: "
Vladimir Marko06606b92013-12-02 15:31:08 +0000646 << table.DexToPcSize();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700647 }
648 return success;
649}
650
651
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700652void Mir2Lir::CreateMappingTables() {
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700653 bool generate_src_map = cu_->compiler_driver->GetCompilerOptions().GetIncludeDebugSymbols();
654
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000655 uint32_t pc2dex_data_size = 0u;
656 uint32_t pc2dex_entries = 0u;
657 uint32_t pc2dex_offset = 0u;
658 uint32_t pc2dex_dalvik_offset = 0u;
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700659 uint32_t pc2dex_src_entries = 0u;
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000660 uint32_t dex2pc_data_size = 0u;
661 uint32_t dex2pc_entries = 0u;
662 uint32_t dex2pc_offset = 0u;
663 uint32_t dex2pc_dalvik_offset = 0u;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700664 for (LIR* tgt_lir = first_lir_insn_; tgt_lir != nullptr; tgt_lir = NEXT_LIR(tgt_lir)) {
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700665 pc2dex_src_entries++;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700666 if (!tgt_lir->flags.is_nop && (tgt_lir->opcode == kPseudoSafepointPC)) {
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000667 pc2dex_entries += 1;
668 DCHECK(pc2dex_offset <= tgt_lir->offset);
669 pc2dex_data_size += UnsignedLeb128Size(tgt_lir->offset - pc2dex_offset);
670 pc2dex_data_size += SignedLeb128Size(static_cast<int32_t>(tgt_lir->dalvik_offset) -
671 static_cast<int32_t>(pc2dex_dalvik_offset));
672 pc2dex_offset = tgt_lir->offset;
673 pc2dex_dalvik_offset = tgt_lir->dalvik_offset;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700674 }
675 if (!tgt_lir->flags.is_nop && (tgt_lir->opcode == kPseudoExportedPC)) {
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000676 dex2pc_entries += 1;
677 DCHECK(dex2pc_offset <= tgt_lir->offset);
678 dex2pc_data_size += UnsignedLeb128Size(tgt_lir->offset - dex2pc_offset);
679 dex2pc_data_size += SignedLeb128Size(static_cast<int32_t>(tgt_lir->dalvik_offset) -
680 static_cast<int32_t>(dex2pc_dalvik_offset));
681 dex2pc_offset = tgt_lir->offset;
682 dex2pc_dalvik_offset = tgt_lir->dalvik_offset;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700683 }
684 }
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000685
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700686 if (generate_src_map) {
687 src_mapping_table_.reserve(pc2dex_src_entries);
688 }
689
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000690 uint32_t total_entries = pc2dex_entries + dex2pc_entries;
691 uint32_t hdr_data_size = UnsignedLeb128Size(total_entries) + UnsignedLeb128Size(pc2dex_entries);
692 uint32_t data_size = hdr_data_size + pc2dex_data_size + dex2pc_data_size;
Vladimir Marko06606b92013-12-02 15:31:08 +0000693 encoded_mapping_table_.resize(data_size);
694 uint8_t* write_pos = &encoded_mapping_table_[0];
695 write_pos = EncodeUnsignedLeb128(write_pos, total_entries);
696 write_pos = EncodeUnsignedLeb128(write_pos, pc2dex_entries);
697 DCHECK_EQ(static_cast<size_t>(write_pos - &encoded_mapping_table_[0]), hdr_data_size);
698 uint8_t* write_pos2 = write_pos + pc2dex_data_size;
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000699
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000700 pc2dex_offset = 0u;
701 pc2dex_dalvik_offset = 0u;
Vladimir Marko06606b92013-12-02 15:31:08 +0000702 dex2pc_offset = 0u;
703 dex2pc_dalvik_offset = 0u;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700704 for (LIR* tgt_lir = first_lir_insn_; tgt_lir != nullptr; tgt_lir = NEXT_LIR(tgt_lir)) {
Yevgeny Roubane3ea8382014-08-08 16:29:38 +0700705 if (generate_src_map && !tgt_lir->flags.is_nop) {
706 src_mapping_table_.push_back(SrcMapElem({tgt_lir->offset,
707 static_cast<int32_t>(tgt_lir->dalvik_offset)}));
708 }
Vladimir Marko06606b92013-12-02 15:31:08 +0000709 if (!tgt_lir->flags.is_nop && (tgt_lir->opcode == kPseudoSafepointPC)) {
710 DCHECK(pc2dex_offset <= tgt_lir->offset);
711 write_pos = EncodeUnsignedLeb128(write_pos, tgt_lir->offset - pc2dex_offset);
712 write_pos = EncodeSignedLeb128(write_pos, static_cast<int32_t>(tgt_lir->dalvik_offset) -
713 static_cast<int32_t>(pc2dex_dalvik_offset));
714 pc2dex_offset = tgt_lir->offset;
715 pc2dex_dalvik_offset = tgt_lir->dalvik_offset;
716 }
717 if (!tgt_lir->flags.is_nop && (tgt_lir->opcode == kPseudoExportedPC)) {
718 DCHECK(dex2pc_offset <= tgt_lir->offset);
719 write_pos2 = EncodeUnsignedLeb128(write_pos2, tgt_lir->offset - dex2pc_offset);
720 write_pos2 = EncodeSignedLeb128(write_pos2, static_cast<int32_t>(tgt_lir->dalvik_offset) -
721 static_cast<int32_t>(dex2pc_dalvik_offset));
722 dex2pc_offset = tgt_lir->offset;
723 dex2pc_dalvik_offset = tgt_lir->dalvik_offset;
724 }
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000725 }
Vladimir Marko06606b92013-12-02 15:31:08 +0000726 DCHECK_EQ(static_cast<size_t>(write_pos - &encoded_mapping_table_[0]),
727 hdr_data_size + pc2dex_data_size);
728 DCHECK_EQ(static_cast<size_t>(write_pos2 - &encoded_mapping_table_[0]), data_size);
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000729
Ian Rogers96faf5b2013-08-09 22:05:32 -0700730 if (kIsDebugBuild) {
Vladimir Marko06606b92013-12-02 15:31:08 +0000731 CHECK(VerifyCatchEntries());
732
Ian Rogers96faf5b2013-08-09 22:05:32 -0700733 // Verify the encoded table holds the expected data.
Vladimir Marko06606b92013-12-02 15:31:08 +0000734 MappingTable table(&encoded_mapping_table_[0]);
Ian Rogers96faf5b2013-08-09 22:05:32 -0700735 CHECK_EQ(table.TotalSize(), total_entries);
736 CHECK_EQ(table.PcToDexSize(), pc2dex_entries);
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000737 auto it = table.PcToDexBegin();
Vladimir Marko06606b92013-12-02 15:31:08 +0000738 auto it2 = table.DexToPcBegin();
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700739 for (LIR* tgt_lir = first_lir_insn_; tgt_lir != nullptr; tgt_lir = NEXT_LIR(tgt_lir)) {
Vladimir Marko06606b92013-12-02 15:31:08 +0000740 if (!tgt_lir->flags.is_nop && (tgt_lir->opcode == kPseudoSafepointPC)) {
741 CHECK_EQ(tgt_lir->offset, it.NativePcOffset());
742 CHECK_EQ(tgt_lir->dalvik_offset, it.DexPc());
743 ++it;
744 }
745 if (!tgt_lir->flags.is_nop && (tgt_lir->opcode == kPseudoExportedPC)) {
746 CHECK_EQ(tgt_lir->offset, it2.NativePcOffset());
747 CHECK_EQ(tgt_lir->dalvik_offset, it2.DexPc());
748 ++it2;
749 }
Ian Rogers96faf5b2013-08-09 22:05:32 -0700750 }
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000751 CHECK(it == table.PcToDexEnd());
Vladimir Marko1e6cb632013-11-28 16:27:29 +0000752 CHECK(it2 == table.DexToPcEnd());
Ian Rogers96faf5b2013-08-09 22:05:32 -0700753 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700754}
755
Brian Carlstrom7940e442013-07-12 13:46:57 -0700756void Mir2Lir::CreateNativeGcMap() {
Vladimir Marko06606b92013-12-02 15:31:08 +0000757 DCHECK(!encoded_mapping_table_.empty());
758 MappingTable mapping_table(&encoded_mapping_table_[0]);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700759 uint32_t max_native_offset = 0;
Vladimir Marko06606b92013-12-02 15:31:08 +0000760 for (auto it = mapping_table.PcToDexBegin(), end = mapping_table.PcToDexEnd(); it != end; ++it) {
761 uint32_t native_offset = it.NativePcOffset();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700762 if (native_offset > max_native_offset) {
763 max_native_offset = native_offset;
764 }
765 }
766 MethodReference method_ref(cu_->dex_file, cu_->method_idx);
Vladimir Marko2730db02014-01-27 11:15:17 +0000767 const std::vector<uint8_t>& gc_map_raw =
768 mir_graph_->GetCurrentDexCompilationUnit()->GetVerifiedMethod()->GetDexGcMap();
769 verifier::DexPcToReferenceMap dex_gc_map(&(gc_map_raw)[0]);
770 DCHECK_EQ(gc_map_raw.size(), dex_gc_map.RawSize());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700771 // Compute native offset to references size.
Nicolas Geoffray92cf83e2014-03-18 17:59:20 +0000772 GcMapBuilder native_gc_map_builder(&native_gc_map_,
773 mapping_table.PcToDexSize(),
774 max_native_offset, dex_gc_map.RegWidth());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700775
Vladimir Marko06606b92013-12-02 15:31:08 +0000776 for (auto it = mapping_table.PcToDexBegin(), end = mapping_table.PcToDexEnd(); it != end; ++it) {
777 uint32_t native_offset = it.NativePcOffset();
778 uint32_t dex_pc = it.DexPc();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700779 const uint8_t* references = dex_gc_map.FindBitMap(dex_pc, false);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700780 CHECK(references != nullptr) << "Missing ref for dex pc 0x" << std::hex << dex_pc <<
Dave Allisonf9439142014-03-27 15:10:22 -0700781 ": " << PrettyMethod(cu_->method_idx, *cu_->dex_file);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700782 native_gc_map_builder.AddEntry(native_offset, references);
783 }
Mathieu Chartierab972ef2014-12-03 17:38:22 -0800784
785 // Maybe not necessary, but this could help prevent errors where we access the verified method
786 // after it has been deleted.
787 mir_graph_->GetCurrentDexCompilationUnit()->ClearVerifiedMethod();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700788}
789
790/* Determine the offset of each literal field */
buzbee0d829482013-10-11 15:24:55 -0700791int Mir2Lir::AssignLiteralOffset(CodeOffset offset) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700792 offset = AssignLiteralOffsetCommon(literal_list_, offset);
Matteo Franchin27cc0932014-09-08 18:29:24 +0100793 constexpr unsigned int ptr_size = sizeof(uint32_t);
Andreas Gampe785d2f22014-11-03 22:57:30 -0800794 static_assert(ptr_size >= sizeof(mirror::HeapReference<mirror::Object>),
795 "Pointer size cannot hold a heap reference");
Ian Rogersff093b32014-04-30 19:04:27 -0700796 offset = AssignLiteralPointerOffsetCommon(code_literal_list_, offset, ptr_size);
797 offset = AssignLiteralPointerOffsetCommon(method_literal_list_, offset, ptr_size);
798 offset = AssignLiteralPointerOffsetCommon(class_literal_list_, offset, ptr_size);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700799 return offset;
800}
801
buzbee0d829482013-10-11 15:24:55 -0700802int Mir2Lir::AssignSwitchTablesOffset(CodeOffset offset) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100803 for (Mir2Lir::SwitchTable* tab_rec : switch_tables_) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700804 tab_rec->offset = offset;
805 if (tab_rec->table[0] == Instruction::kSparseSwitchSignature) {
806 offset += tab_rec->table[1] * (sizeof(int) * 2);
807 } else {
808 DCHECK_EQ(static_cast<int>(tab_rec->table[0]),
809 static_cast<int>(Instruction::kPackedSwitchSignature));
810 offset += tab_rec->table[1] * sizeof(int);
811 }
812 }
813 return offset;
814}
815
buzbee0d829482013-10-11 15:24:55 -0700816int Mir2Lir::AssignFillArrayDataOffset(CodeOffset offset) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100817 for (Mir2Lir::FillArrayData* tab_rec : fill_array_data_) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700818 tab_rec->offset = offset;
819 offset += tab_rec->size;
820 // word align
Andreas Gampe66018822014-05-05 20:47:19 -0700821 offset = RoundUp(offset, 4);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100822 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700823 return offset;
824}
825
Brian Carlstrom7940e442013-07-12 13:46:57 -0700826/*
827 * Insert a kPseudoCaseLabel at the beginning of the Dalvik
buzbeeb48819d2013-09-14 16:15:25 -0700828 * offset vaddr if pretty-printing, otherise use the standard block
829 * label. The selected label will be used to fix up the case
buzbee252254b2013-09-08 16:20:53 -0700830 * branch table during the assembly phase. All resource flags
831 * are set to prevent code motion. KeyVal is just there for debugging.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700832 */
buzbee0d829482013-10-11 15:24:55 -0700833LIR* Mir2Lir::InsertCaseLabel(DexOffset vaddr, int keyVal) {
buzbee252254b2013-09-08 16:20:53 -0700834 LIR* boundary_lir = &block_label_list_[mir_graph_->FindBlock(vaddr)->id];
buzbeeb48819d2013-09-14 16:15:25 -0700835 LIR* res = boundary_lir;
836 if (cu_->verbose) {
837 // Only pay the expense if we're pretty-printing.
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000838 LIR* new_label = static_cast<LIR*>(arena_->Alloc(sizeof(LIR), kArenaAllocLIR));
buzbeeb48819d2013-09-14 16:15:25 -0700839 new_label->dalvik_offset = vaddr;
840 new_label->opcode = kPseudoCaseLabel;
841 new_label->operands[0] = keyVal;
842 new_label->flags.fixup = kFixupLabel;
843 DCHECK(!new_label->flags.use_def_invalid);
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100844 new_label->u.m.def_mask = &kEncodeAll;
buzbeeb48819d2013-09-14 16:15:25 -0700845 InsertLIRAfter(boundary_lir, new_label);
846 res = new_label;
847 }
848 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700849}
850
buzbee0d829482013-10-11 15:24:55 -0700851void Mir2Lir::MarkPackedCaseLabels(Mir2Lir::SwitchTable* tab_rec) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700852 const uint16_t* table = tab_rec->table;
buzbee0d829482013-10-11 15:24:55 -0700853 DexOffset base_vaddr = tab_rec->vaddr;
854 const int32_t *targets = reinterpret_cast<const int32_t*>(&table[4]);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700855 int entries = table[1];
856 int low_key = s4FromSwitchData(&table[2]);
857 for (int i = 0; i < entries; i++) {
858 tab_rec->targets[i] = InsertCaseLabel(base_vaddr + targets[i], i + low_key);
859 }
860}
861
buzbee0d829482013-10-11 15:24:55 -0700862void Mir2Lir::MarkSparseCaseLabels(Mir2Lir::SwitchTable* tab_rec) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700863 const uint16_t* table = tab_rec->table;
buzbee0d829482013-10-11 15:24:55 -0700864 DexOffset base_vaddr = tab_rec->vaddr;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700865 int entries = table[1];
buzbee0d829482013-10-11 15:24:55 -0700866 const int32_t* keys = reinterpret_cast<const int32_t*>(&table[2]);
867 const int32_t* targets = &keys[entries];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700868 for (int i = 0; i < entries; i++) {
869 tab_rec->targets[i] = InsertCaseLabel(base_vaddr + targets[i], keys[i]);
870 }
871}
872
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700873void Mir2Lir::ProcessSwitchTables() {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100874 for (Mir2Lir::SwitchTable* tab_rec : switch_tables_) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700875 if (tab_rec->table[0] == Instruction::kPackedSwitchSignature) {
876 MarkPackedCaseLabels(tab_rec);
877 } else if (tab_rec->table[0] == Instruction::kSparseSwitchSignature) {
878 MarkSparseCaseLabels(tab_rec);
879 } else {
880 LOG(FATAL) << "Invalid switch table";
881 }
882 }
883}
884
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700885void Mir2Lir::DumpSparseSwitchTable(const uint16_t* table) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700886 /*
887 * Sparse switch data format:
888 * ushort ident = 0x0200 magic value
889 * ushort size number of entries in the table; > 0
890 * int keys[size] keys, sorted low-to-high; 32-bit aligned
891 * int targets[size] branch targets, relative to switch opcode
892 *
893 * Total size is (2+size*4) 16-bit code units.
894 */
Brian Carlstrom7940e442013-07-12 13:46:57 -0700895 uint16_t ident = table[0];
896 int entries = table[1];
buzbee0d829482013-10-11 15:24:55 -0700897 const int32_t* keys = reinterpret_cast<const int32_t*>(&table[2]);
898 const int32_t* targets = &keys[entries];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700899 LOG(INFO) << "Sparse switch table - ident:0x" << std::hex << ident
900 << ", entries: " << std::dec << entries;
901 for (int i = 0; i < entries; i++) {
902 LOG(INFO) << " Key[" << keys[i] << "] -> 0x" << std::hex << targets[i];
903 }
904}
905
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700906void Mir2Lir::DumpPackedSwitchTable(const uint16_t* table) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700907 /*
908 * Packed switch data format:
909 * ushort ident = 0x0100 magic value
910 * ushort size number of entries in the table
911 * int first_key first (and lowest) switch case value
912 * int targets[size] branch targets, relative to switch opcode
913 *
914 * Total size is (4+size*2) 16-bit code units.
915 */
Brian Carlstrom7940e442013-07-12 13:46:57 -0700916 uint16_t ident = table[0];
buzbee0d829482013-10-11 15:24:55 -0700917 const int32_t* targets = reinterpret_cast<const int32_t*>(&table[4]);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700918 int entries = table[1];
919 int low_key = s4FromSwitchData(&table[2]);
920 LOG(INFO) << "Packed switch table - ident:0x" << std::hex << ident
921 << ", entries: " << std::dec << entries << ", low_key: " << low_key;
922 for (int i = 0; i < entries; i++) {
923 LOG(INFO) << " Key[" << (i + low_key) << "] -> 0x" << std::hex
924 << targets[i];
925 }
926}
927
buzbee252254b2013-09-08 16:20:53 -0700928/* Set up special LIR to mark a Dalvik byte-code instruction start for pretty printing */
buzbee0d829482013-10-11 15:24:55 -0700929void Mir2Lir::MarkBoundary(DexOffset offset, const char* inst_str) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700930 UNUSED(offset);
buzbee0d829482013-10-11 15:24:55 -0700931 // NOTE: only used for debug listings.
932 NewLIR1(kPseudoDalvikByteCodeBoundary, WrapPointer(ArenaStrdup(inst_str)));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700933}
934
Brian Carlstrom7940e442013-07-12 13:46:57 -0700935// Convert relation of src1/src2 to src2/src1
936ConditionCode Mir2Lir::FlipComparisonOrder(ConditionCode before) {
937 ConditionCode res;
938 switch (before) {
939 case kCondEq: res = kCondEq; break;
940 case kCondNe: res = kCondNe; break;
941 case kCondLt: res = kCondGt; break;
942 case kCondGt: res = kCondLt; break;
943 case kCondLe: res = kCondGe; break;
944 case kCondGe: res = kCondLe; break;
945 default:
Brian Carlstrom7940e442013-07-12 13:46:57 -0700946 LOG(FATAL) << "Unexpected ccode " << before;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700947 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700948 }
949 return res;
950}
951
Vladimir Markoa1a70742014-03-03 10:28:05 +0000952ConditionCode Mir2Lir::NegateComparison(ConditionCode before) {
953 ConditionCode res;
954 switch (before) {
955 case kCondEq: res = kCondNe; break;
956 case kCondNe: res = kCondEq; break;
957 case kCondLt: res = kCondGe; break;
958 case kCondGt: res = kCondLe; break;
959 case kCondLe: res = kCondGt; break;
960 case kCondGe: res = kCondLt; break;
961 default:
Vladimir Markoa1a70742014-03-03 10:28:05 +0000962 LOG(FATAL) << "Unexpected ccode " << before;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700963 UNREACHABLE();
Vladimir Markoa1a70742014-03-03 10:28:05 +0000964 }
965 return res;
966}
967
Brian Carlstrom7940e442013-07-12 13:46:57 -0700968// TODO: move to mir_to_lir.cc
969Mir2Lir::Mir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena)
970 : Backend(arena),
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700971 literal_list_(nullptr),
972 method_literal_list_(nullptr),
973 class_literal_list_(nullptr),
974 code_literal_list_(nullptr),
975 first_fixup_(nullptr),
Brian Carlstrom7940e442013-07-12 13:46:57 -0700976 cu_(cu),
977 mir_graph_(mir_graph),
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100978 switch_tables_(arena->Adapter(kArenaAllocSwitchTable)),
979 fill_array_data_(arena->Adapter(kArenaAllocFillArrayData)),
980 tempreg_info_(arena->Adapter()),
981 reginfo_map_(arena->Adapter()),
982 pointer_storage_(arena->Adapter()),
Brian Carlstrom7940e442013-07-12 13:46:57 -0700983 data_offset_(0),
984 total_size_(0),
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700985 block_label_list_(nullptr),
986 promotion_map_(nullptr),
Brian Carlstrom7940e442013-07-12 13:46:57 -0700987 current_dalvik_offset_(0),
buzbeeb48819d2013-09-14 16:15:25 -0700988 estimated_native_code_size_(0),
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100989 reg_pool_(nullptr),
Brian Carlstrom7940e442013-07-12 13:46:57 -0700990 live_sreg_(0),
Vladimir Marko8081d2b2014-07-31 15:33:43 +0100991 core_vmap_table_(mir_graph->GetArena()->Adapter()),
992 fp_vmap_table_(mir_graph->GetArena()->Adapter()),
Vladimir Markof4da6752014-08-01 19:04:18 +0100993 patches_(mir_graph->GetArena()->Adapter()),
Brian Carlstrom7940e442013-07-12 13:46:57 -0700994 num_core_spills_(0),
995 num_fp_spills_(0),
996 frame_size_(0),
997 core_spill_mask_(0),
998 fp_spill_mask_(0),
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700999 first_lir_insn_(nullptr),
1000 last_lir_insn_(nullptr),
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001001 slow_paths_(arena->Adapter(kArenaAllocSlowPaths)),
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001002 mem_ref_type_(ResourceMask::kHeapRef),
Serguei Katkov717a3e42014-11-13 17:19:42 +06001003 mask_cache_(arena),
1004 in_to_reg_storage_mapping_(arena) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001005 switch_tables_.reserve(4);
1006 fill_array_data_.reserve(4);
1007 tempreg_info_.reserve(20);
1008 reginfo_map_.reserve(RegStorage::kMaxRegs);
1009 pointer_storage_.reserve(128);
1010 slow_paths_.reserve(32);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001011 // Reserve pointer id 0 for nullptr.
1012 size_t null_idx = WrapPointer(nullptr);
buzbee0d829482013-10-11 15:24:55 -07001013 DCHECK_EQ(null_idx, 0U);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001014}
1015
1016void Mir2Lir::Materialize() {
buzbeea61f4952013-08-23 14:27:06 -07001017 cu_->NewTimingSplit("RegisterAllocation");
Brian Carlstrom7940e442013-07-12 13:46:57 -07001018 CompilerInitializeRegAlloc(); // Needs to happen after SSA naming
1019
1020 /* Allocate Registers using simple local allocation scheme */
1021 SimpleRegAlloc();
1022
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -08001023 /* First try the custom light codegen for special cases. */
Vladimir Marko5816ed42013-11-27 17:04:20 +00001024 DCHECK(cu_->compiler_driver->GetMethodInlinerMap() != nullptr);
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -08001025 bool special_worked = cu_->compiler_driver->GetMethodInlinerMap()->GetMethodInliner(cu_->dex_file)
Vladimir Marko5816ed42013-11-27 17:04:20 +00001026 ->GenSpecial(this, cu_->method_idx);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001027
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -08001028 /* Take normal path for converting MIR to LIR only if the special codegen did not succeed. */
1029 if (special_worked == false) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001030 MethodMIR2LIR();
1031 }
1032
1033 /* Method is not empty */
1034 if (first_lir_insn_) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001035 // mark the targets of switch statement case labels
1036 ProcessSwitchTables();
1037
1038 /* Convert LIR into machine code. */
1039 AssembleLIR();
1040
buzbeeb01bf152014-05-13 15:59:07 -07001041 if ((cu_->enable_debug & (1 << kDebugCodegenDump)) != 0) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001042 CodegenDump();
1043 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001044 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001045}
1046
1047CompiledMethod* Mir2Lir::GetCompiledMethod() {
Vladimir Marko2e589aa2014-02-25 17:53:53 +00001048 // Combine vmap tables - core regs, then fp regs - into vmap_table.
1049 Leb128EncodingVector vmap_encoder;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001050 if (frame_size_ > 0) {
Vladimir Marko2e589aa2014-02-25 17:53:53 +00001051 // Prefix the encoded data with its size.
1052 size_t size = core_vmap_table_.size() + 1 /* marker */ + fp_vmap_table_.size();
1053 vmap_encoder.Reserve(size + 1u); // All values are likely to be one byte in ULEB128 (<128).
1054 vmap_encoder.PushBackUnsigned(size);
1055 // Core regs may have been inserted out of order - sort first.
1056 std::sort(core_vmap_table_.begin(), core_vmap_table_.end());
1057 for (size_t i = 0 ; i < core_vmap_table_.size(); ++i) {
1058 // Copy, stripping out the phys register sort key.
1059 vmap_encoder.PushBackUnsigned(
1060 ~(-1 << VREG_NUM_WIDTH) & (core_vmap_table_[i] + VmapTable::kEntryAdjustment));
1061 }
1062 // Push a marker to take place of lr.
1063 vmap_encoder.PushBackUnsigned(VmapTable::kAdjustedFpMarker);
Serguei Katkovc3801912014-07-08 17:21:53 +07001064 if (cu_->instruction_set == kThumb2) {
1065 // fp regs already sorted.
1066 for (uint32_t i = 0; i < fp_vmap_table_.size(); i++) {
1067 vmap_encoder.PushBackUnsigned(fp_vmap_table_[i] + VmapTable::kEntryAdjustment);
1068 }
1069 } else {
1070 // For other platforms regs may have been inserted out of order - sort first.
1071 std::sort(fp_vmap_table_.begin(), fp_vmap_table_.end());
1072 for (size_t i = 0 ; i < fp_vmap_table_.size(); ++i) {
1073 // Copy, stripping out the phys register sort key.
1074 vmap_encoder.PushBackUnsigned(
1075 ~(-1 << VREG_NUM_WIDTH) & (fp_vmap_table_[i] + VmapTable::kEntryAdjustment));
1076 }
Vladimir Marko2e589aa2014-02-25 17:53:53 +00001077 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001078 } else {
Vladimir Marko81949632014-05-02 11:53:22 +01001079 DCHECK_EQ(POPCOUNT(core_spill_mask_), 0);
1080 DCHECK_EQ(POPCOUNT(fp_spill_mask_), 0);
Vladimir Marko2e589aa2014-02-25 17:53:53 +00001081 DCHECK_EQ(core_vmap_table_.size(), 0u);
1082 DCHECK_EQ(fp_vmap_table_.size(), 0u);
1083 vmap_encoder.PushBackUnsigned(0u); // Size is 0.
Brian Carlstrom7940e442013-07-12 13:46:57 -07001084 }
Mark Mendellae9fd932014-02-10 16:14:35 -08001085
Vladimir Markof4da6752014-08-01 19:04:18 +01001086 // Sort patches by literal offset for better deduplication.
1087 std::sort(patches_.begin(), patches_.end(), [](const LinkerPatch& lhs, const LinkerPatch& rhs) {
1088 return lhs.LiteralOffset() < rhs.LiteralOffset();
1089 });
1090
Tong Shen547cdfd2014-08-05 01:54:19 -07001091 std::unique_ptr<std::vector<uint8_t>> cfi_info(ReturnFrameDescriptionEntry());
Andreas Gampee21dc3d2014-12-08 16:59:43 -08001092 ArrayRef<const uint8_t> cfi_ref;
1093 if (cfi_info.get() != nullptr) {
1094 cfi_ref = ArrayRef<const uint8_t>(*cfi_info);
1095 }
1096 return CompiledMethod::SwapAllocCompiledMethod(
1097 cu_->compiler_driver, cu_->instruction_set,
1098 ArrayRef<const uint8_t>(code_buffer_),
1099 frame_size_, core_spill_mask_, fp_spill_mask_,
1100 &src_mapping_table_,
1101 ArrayRef<const uint8_t>(encoded_mapping_table_),
1102 ArrayRef<const uint8_t>(vmap_encoder.GetData()),
1103 ArrayRef<const uint8_t>(native_gc_map_),
1104 cfi_ref,
1105 ArrayRef<LinkerPatch>(patches_));
Brian Carlstrom7940e442013-07-12 13:46:57 -07001106}
1107
Razvan A Lupusoruda7a69b2014-01-08 15:09:50 -08001108size_t Mir2Lir::GetMaxPossibleCompilerTemps() const {
1109 // Chose a reasonably small value in order to contain stack growth.
1110 // Backends that are smarter about spill region can return larger values.
1111 const size_t max_compiler_temps = 10;
1112 return max_compiler_temps;
1113}
1114
1115size_t Mir2Lir::GetNumBytesForCompilerTempSpillRegion() {
1116 // By default assume that the Mir2Lir will need one slot for each temporary.
1117 // If the backend can better determine temps that have non-overlapping ranges and
1118 // temps that do not need spilled, it can actually provide a small region.
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -07001119 mir_graph_->CommitCompilerTemps();
1120 return mir_graph_->GetNumBytesForSpecialTemps() + mir_graph_->GetMaximumBytesForNonSpecialTemps();
Razvan A Lupusoruda7a69b2014-01-08 15:09:50 -08001121}
1122
Brian Carlstrom7940e442013-07-12 13:46:57 -07001123int Mir2Lir::ComputeFrameSize() {
1124 /* Figure out the frame size */
Dmitry Petrochenkof29a4242014-05-05 20:28:47 +07001125 uint32_t size = num_core_spills_ * GetBytesPerGprSpillLocation(cu_->instruction_set)
1126 + num_fp_spills_ * GetBytesPerFprSpillLocation(cu_->instruction_set)
1127 + sizeof(uint32_t) // Filler.
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -07001128 + mir_graph_->GetNumOfLocalCodeVRs() * sizeof(uint32_t)
1129 + mir_graph_->GetNumOfOutVRs() * sizeof(uint32_t)
Dmitry Petrochenkof29a4242014-05-05 20:28:47 +07001130 + GetNumBytesForCompilerTempSpillRegion();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001131 /* Align and set */
Andreas Gampe66018822014-05-05 20:47:19 -07001132 return RoundUp(size, kStackAlignment);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001133}
1134
1135/*
1136 * Append an LIR instruction to the LIR list maintained by a compilation
1137 * unit
1138 */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001139void Mir2Lir::AppendLIR(LIR* lir) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001140 if (first_lir_insn_ == nullptr) {
1141 DCHECK(last_lir_insn_ == nullptr);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001142 last_lir_insn_ = first_lir_insn_ = lir;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001143 lir->prev = lir->next = nullptr;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001144 } else {
1145 last_lir_insn_->next = lir;
1146 lir->prev = last_lir_insn_;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001147 lir->next = nullptr;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001148 last_lir_insn_ = lir;
1149 }
1150}
1151
1152/*
1153 * Insert an LIR instruction before the current instruction, which cannot be the
1154 * first instruction.
1155 *
1156 * prev_lir <-> new_lir <-> current_lir
1157 */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001158void Mir2Lir::InsertLIRBefore(LIR* current_lir, LIR* new_lir) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001159 DCHECK(current_lir->prev != nullptr);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001160 LIR *prev_lir = current_lir->prev;
1161
1162 prev_lir->next = new_lir;
1163 new_lir->prev = prev_lir;
1164 new_lir->next = current_lir;
1165 current_lir->prev = new_lir;
1166}
1167
1168/*
1169 * Insert an LIR instruction after the current instruction, which cannot be the
Andreas Gampe3c12c512014-06-24 18:46:29 +00001170 * last instruction.
Brian Carlstrom7940e442013-07-12 13:46:57 -07001171 *
1172 * current_lir -> new_lir -> old_next
1173 */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001174void Mir2Lir::InsertLIRAfter(LIR* current_lir, LIR* new_lir) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001175 new_lir->prev = current_lir;
1176 new_lir->next = current_lir->next;
1177 current_lir->next = new_lir;
1178 new_lir->next->prev = new_lir;
1179}
1180
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001181bool Mir2Lir::PartiallyIntersects(RegLocation rl_src, RegLocation rl_dest) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001182 DCHECK(rl_src.wide);
1183 DCHECK(rl_dest.wide);
1184 return (abs(mir_graph_->SRegToVReg(rl_src.s_reg_low) - mir_graph_->SRegToVReg(rl_dest.s_reg_low)) == 1);
1185}
1186
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001187bool Mir2Lir::Intersects(RegLocation rl_src, RegLocation rl_dest) {
1188 DCHECK(rl_src.wide);
1189 DCHECK(rl_dest.wide);
1190 return (abs(mir_graph_->SRegToVReg(rl_src.s_reg_low) - mir_graph_->SRegToVReg(rl_dest.s_reg_low)) <= 1);
1191}
1192
buzbee2700f7e2014-03-07 09:46:20 -08001193LIR *Mir2Lir::OpCmpMemImmBranch(ConditionCode cond, RegStorage temp_reg, RegStorage base_reg,
Dave Allison69dfe512014-07-11 17:11:58 +00001194 int offset, int check_value, LIR* target, LIR** compare) {
Mark Mendell766e9292014-01-27 07:55:47 -08001195 // Handle this for architectures that can't compare to memory.
Dave Allison69dfe512014-07-11 17:11:58 +00001196 LIR* inst = Load32Disp(base_reg, offset, temp_reg);
1197 if (compare != nullptr) {
1198 *compare = inst;
1199 }
Mark Mendell766e9292014-01-27 07:55:47 -08001200 LIR* branch = OpCmpImmBranch(cond, temp_reg, check_value, target);
1201 return branch;
1202}
1203
Dave Allisonbcec6fb2014-01-17 12:52:22 -08001204void Mir2Lir::AddSlowPath(LIRSlowPath* slowpath) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001205 slow_paths_.push_back(slowpath);
Serguei Katkov589e0462014-09-05 18:37:22 +07001206 ResetDefTracking();
Dave Allisonbcec6fb2014-01-17 12:52:22 -08001207}
Mark Mendell55d0eac2014-02-06 11:02:52 -08001208
Jeff Hao49161ce2014-03-12 11:05:25 -07001209void Mir2Lir::LoadCodeAddress(const MethodReference& target_method, InvokeType type,
1210 SpecialTargetRegister symbolic_reg) {
Vladimir Markoa51a0b02014-05-21 12:08:39 +01001211 LIR* data_target = ScanLiteralPoolMethod(code_literal_list_, target_method);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001212 if (data_target == nullptr) {
Vladimir Markoa51a0b02014-05-21 12:08:39 +01001213 data_target = AddWordData(&code_literal_list_, target_method.dex_method_index);
Jeff Hao49161ce2014-03-12 11:05:25 -07001214 data_target->operands[1] = WrapPointer(const_cast<DexFile*>(target_method.dex_file));
Vladimir Markoa51a0b02014-05-21 12:08:39 +01001215 // NOTE: The invoke type doesn't contribute to the literal identity. In fact, we can have
1216 // the same method invoked with kVirtual, kSuper and kInterface but the class linker will
1217 // resolve these invokes to the same method, so we don't care which one we record here.
Jeff Hao49161ce2014-03-12 11:05:25 -07001218 data_target->operands[2] = type;
Mark Mendell55d0eac2014-02-06 11:02:52 -08001219 }
Chao-ying Fua77ee512014-07-01 17:43:41 -07001220 // Loads a code pointer. Code from oat file can be mapped anywhere.
1221 LIR* load_pc_rel = OpPcRelLoad(TargetPtrReg(symbolic_reg), data_target);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001222 AppendLIR(load_pc_rel);
1223 DCHECK_NE(cu_->instruction_set, kMips) << reinterpret_cast<void*>(data_target);
1224}
1225
Jeff Hao49161ce2014-03-12 11:05:25 -07001226void Mir2Lir::LoadMethodAddress(const MethodReference& target_method, InvokeType type,
1227 SpecialTargetRegister symbolic_reg) {
Vladimir Markoa51a0b02014-05-21 12:08:39 +01001228 LIR* data_target = ScanLiteralPoolMethod(method_literal_list_, target_method);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001229 if (data_target == nullptr) {
Vladimir Markoa51a0b02014-05-21 12:08:39 +01001230 data_target = AddWordData(&method_literal_list_, target_method.dex_method_index);
Jeff Hao49161ce2014-03-12 11:05:25 -07001231 data_target->operands[1] = WrapPointer(const_cast<DexFile*>(target_method.dex_file));
Vladimir Markoa51a0b02014-05-21 12:08:39 +01001232 // NOTE: The invoke type doesn't contribute to the literal identity. In fact, we can have
1233 // the same method invoked with kVirtual, kSuper and kInterface but the class linker will
1234 // resolve these invokes to the same method, so we don't care which one we record here.
Jeff Hao49161ce2014-03-12 11:05:25 -07001235 data_target->operands[2] = type;
Mark Mendell55d0eac2014-02-06 11:02:52 -08001236 }
Chao-ying Fua77ee512014-07-01 17:43:41 -07001237 // Loads an ArtMethod pointer, which is a reference as it lives in the heap.
Andreas Gampeccc60262014-07-04 18:02:38 -07001238 LIR* load_pc_rel = OpPcRelLoad(TargetReg(symbolic_reg, kRef), data_target);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001239 AppendLIR(load_pc_rel);
1240 DCHECK_NE(cu_->instruction_set, kMips) << reinterpret_cast<void*>(data_target);
1241}
1242
Fred Shihe7f82e22014-08-06 10:46:37 -07001243void Mir2Lir::LoadClassType(const DexFile& dex_file, uint32_t type_idx,
1244 SpecialTargetRegister symbolic_reg) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001245 // Use the literal pool and a PC-relative load from a data word.
Fred Shihe7f82e22014-08-06 10:46:37 -07001246 LIR* data_target = ScanLiteralPoolClass(class_literal_list_, dex_file, type_idx);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001247 if (data_target == nullptr) {
1248 data_target = AddWordData(&class_literal_list_, type_idx);
Fred Shih4fc78532014-08-06 16:44:22 -07001249 data_target->operands[1] = WrapPointer(const_cast<DexFile*>(&dex_file));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001250 }
Chao-ying Fua77ee512014-07-01 17:43:41 -07001251 // Loads a Class pointer, which is a reference as it lives in the heap.
Andreas Gampeccc60262014-07-04 18:02:38 -07001252 LIR* load_pc_rel = OpPcRelLoad(TargetReg(symbolic_reg, kRef), data_target);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001253 AppendLIR(load_pc_rel);
1254}
1255
Tong Shen547cdfd2014-08-05 01:54:19 -07001256std::vector<uint8_t>* Mir2Lir::ReturnFrameDescriptionEntry() {
Mark Mendellae9fd932014-02-10 16:14:35 -08001257 // Default case is to do nothing.
1258 return nullptr;
1259}
1260
buzbee2700f7e2014-03-07 09:46:20 -08001261RegLocation Mir2Lir::NarrowRegLoc(RegLocation loc) {
buzbee091cc402014-03-31 10:14:40 -07001262 if (loc.location == kLocPhysReg) {
buzbee85089dd2014-05-25 15:10:52 -07001263 DCHECK(!loc.reg.Is32Bit());
buzbee091cc402014-03-31 10:14:40 -07001264 if (loc.reg.IsPair()) {
buzbee85089dd2014-05-25 15:10:52 -07001265 RegisterInfo* info_lo = GetRegInfo(loc.reg.GetLow());
1266 RegisterInfo* info_hi = GetRegInfo(loc.reg.GetHigh());
1267 info_lo->SetIsWide(false);
1268 info_hi->SetIsWide(false);
1269 loc.reg = info_lo->GetReg();
buzbee091cc402014-03-31 10:14:40 -07001270 } else {
buzbee85089dd2014-05-25 15:10:52 -07001271 RegisterInfo* info = GetRegInfo(loc.reg);
1272 RegisterInfo* info_new = info->FindMatchingView(RegisterInfo::k32SoloStorageMask);
1273 DCHECK(info_new != nullptr);
1274 if (info->IsLive() && (info->SReg() == loc.s_reg_low)) {
1275 info->MarkDead();
1276 info_new->MarkLive(loc.s_reg_low);
1277 }
1278 loc.reg = info_new->GetReg();
buzbee091cc402014-03-31 10:14:40 -07001279 }
buzbee85089dd2014-05-25 15:10:52 -07001280 DCHECK(loc.reg.Valid());
buzbee2700f7e2014-03-07 09:46:20 -08001281 }
buzbee85089dd2014-05-25 15:10:52 -07001282 loc.wide = false;
buzbee2700f7e2014-03-07 09:46:20 -08001283 return loc;
1284}
1285
Mark Mendelld65c51a2014-04-29 16:55:20 -04001286void Mir2Lir::GenMachineSpecificExtendedMethodMIR(BasicBlock* bb, MIR* mir) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001287 UNUSED(bb, mir);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001288 LOG(FATAL) << "Unknown MIR opcode not supported on this architecture";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001289 UNREACHABLE();
Mark Mendelld65c51a2014-04-29 16:55:20 -04001290}
1291
Brian Carlstrom7934ac22013-07-26 10:54:15 -07001292} // namespace art