blob: da64250f5bb493761557a8710e8d97764b5ed8a5 [file] [log] [blame]
Brian Carlstrom7940e442013-07-12 13:46:57 -07001/*
2 * Copyright (C) 2012 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
Nicolas Geoffrayf3e2cc42014-02-18 18:37:26 +000017#include <string>
18#include <inttypes.h>
19
Brian Carlstrom7940e442013-07-12 13:46:57 -070020#include "codegen_x86.h"
21#include "dex/compiler_internals.h"
22#include "dex/quick/mir_to_lir-inl.h"
Mark Mendelle19c91f2014-02-25 08:19:08 -080023#include "mirror/array.h"
24#include "mirror/string.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070025#include "x86_lir.h"
26
Brian Carlstrom7940e442013-07-12 13:46:57 -070027namespace art {
28
Brian Carlstrom7934ac22013-07-26 10:54:15 -070029// FIXME: restore "static" when usage uncovered
Brian Carlstrom7940e442013-07-12 13:46:57 -070030/*static*/ int core_regs[] = {
31 rAX, rCX, rDX, rBX, rX86_SP, rBP, rSI, rDI
32#ifdef TARGET_REX_SUPPORT
33 r8, r9, r10, r11, r12, r13, r14, 15
34#endif
35};
36/*static*/ int ReservedRegs[] = {rX86_SP};
37/*static*/ int core_temps[] = {rAX, rCX, rDX, rBX};
38/*static*/ int FpRegs[] = {
39 fr0, fr1, fr2, fr3, fr4, fr5, fr6, fr7,
40#ifdef TARGET_REX_SUPPORT
41 fr8, fr9, fr10, fr11, fr12, fr13, fr14, fr15
42#endif
43};
44/*static*/ int fp_temps[] = {
45 fr0, fr1, fr2, fr3, fr4, fr5, fr6, fr7,
46#ifdef TARGET_REX_SUPPORT
47 fr8, fr9, fr10, fr11, fr12, fr13, fr14, fr15
48#endif
49};
50
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070051RegLocation X86Mir2Lir::LocCReturn() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +000052 return x86_loc_c_return;
Brian Carlstrom7940e442013-07-12 13:46:57 -070053}
54
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070055RegLocation X86Mir2Lir::LocCReturnWide() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +000056 return x86_loc_c_return_wide;
Brian Carlstrom7940e442013-07-12 13:46:57 -070057}
58
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070059RegLocation X86Mir2Lir::LocCReturnFloat() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +000060 return x86_loc_c_return_float;
Brian Carlstrom7940e442013-07-12 13:46:57 -070061}
62
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070063RegLocation X86Mir2Lir::LocCReturnDouble() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +000064 return x86_loc_c_return_double;
Brian Carlstrom7940e442013-07-12 13:46:57 -070065}
66
67// Return a target-dependent special register.
buzbee2700f7e2014-03-07 09:46:20 -080068RegStorage X86Mir2Lir::TargetReg(SpecialTargetRegister reg) {
69 int res_reg = RegStorage::kInvalidRegVal;
Brian Carlstrom7940e442013-07-12 13:46:57 -070070 switch (reg) {
buzbee2700f7e2014-03-07 09:46:20 -080071 case kSelf: res_reg = rX86_SELF; break;
72 case kSuspend: res_reg = rX86_SUSPEND; break;
73 case kLr: res_reg = rX86_LR; break;
74 case kPc: res_reg = rX86_PC; break;
75 case kSp: res_reg = rX86_SP; break;
76 case kArg0: res_reg = rX86_ARG0; break;
77 case kArg1: res_reg = rX86_ARG1; break;
78 case kArg2: res_reg = rX86_ARG2; break;
79 case kArg3: res_reg = rX86_ARG3; break;
80 case kFArg0: res_reg = rX86_FARG0; break;
81 case kFArg1: res_reg = rX86_FARG1; break;
82 case kFArg2: res_reg = rX86_FARG2; break;
83 case kFArg3: res_reg = rX86_FARG3; break;
84 case kRet0: res_reg = rX86_RET0; break;
85 case kRet1: res_reg = rX86_RET1; break;
86 case kInvokeTgt: res_reg = rX86_INVOKE_TGT; break;
87 case kHiddenArg: res_reg = rAX; break;
88 case kHiddenFpArg: res_reg = fr0; break;
89 case kCount: res_reg = rX86_COUNT; break;
Brian Carlstrom7940e442013-07-12 13:46:57 -070090 }
buzbee2700f7e2014-03-07 09:46:20 -080091 return RegStorage::Solo32(res_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -070092}
93
buzbee2700f7e2014-03-07 09:46:20 -080094RegStorage X86Mir2Lir::GetArgMappingToPhysicalReg(int arg_num) {
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -080095 // For the 32-bit internal ABI, the first 3 arguments are passed in registers.
96 // TODO: This is not 64-bit compliant and depends on new internal ABI.
97 switch (arg_num) {
98 case 0:
buzbee2700f7e2014-03-07 09:46:20 -080099 return rs_rX86_ARG1;
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800100 case 1:
buzbee2700f7e2014-03-07 09:46:20 -0800101 return rs_rX86_ARG2;
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800102 case 2:
buzbee2700f7e2014-03-07 09:46:20 -0800103 return rs_rX86_ARG3;
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800104 default:
buzbee2700f7e2014-03-07 09:46:20 -0800105 return RegStorage::InvalidReg();
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800106 }
107}
108
Brian Carlstrom7940e442013-07-12 13:46:57 -0700109// Create a double from a pair of singles.
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700110int X86Mir2Lir::S2d(int low_reg, int high_reg) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700111 return X86_S2D(low_reg, high_reg);
112}
113
114// Return mask to strip off fp reg flags and bias.
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700115uint32_t X86Mir2Lir::FpRegMask() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700116 return X86_FP_REG_MASK;
117}
118
119// True if both regs single, both core or both double.
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700120bool X86Mir2Lir::SameRegType(int reg1, int reg2) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700121 return (X86_REGTYPE(reg1) == X86_REGTYPE(reg2));
122}
123
124/*
125 * Decode the register id.
126 */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700127uint64_t X86Mir2Lir::GetRegMaskCommon(int reg) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700128 uint64_t seed;
129 int shift;
130 int reg_id;
131
132 reg_id = reg & 0xf;
133 /* Double registers in x86 are just a single FP register */
134 seed = 1;
135 /* FP register starts at bit position 16 */
136 shift = X86_FPREG(reg) ? kX86FPReg0 : 0;
137 /* Expand the double register id into single offset */
138 shift += reg_id;
139 return (seed << shift);
140}
141
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700142uint64_t X86Mir2Lir::GetPCUseDefEncoding() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700143 /*
144 * FIXME: might make sense to use a virtual resource encoding bit for pc. Might be
145 * able to clean up some of the x86/Arm_Mips differences
146 */
147 LOG(FATAL) << "Unexpected call to GetPCUseDefEncoding for x86";
148 return 0ULL;
149}
150
buzbeeb48819d2013-09-14 16:15:25 -0700151void X86Mir2Lir::SetupTargetResourceMasks(LIR* lir, uint64_t flags) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700152 DCHECK_EQ(cu_->instruction_set, kX86);
buzbeeb48819d2013-09-14 16:15:25 -0700153 DCHECK(!lir->flags.use_def_invalid);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700154
155 // X86-specific resource map setup here.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700156 if (flags & REG_USE_SP) {
buzbeeb48819d2013-09-14 16:15:25 -0700157 lir->u.m.use_mask |= ENCODE_X86_REG_SP;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700158 }
159
160 if (flags & REG_DEF_SP) {
buzbeeb48819d2013-09-14 16:15:25 -0700161 lir->u.m.def_mask |= ENCODE_X86_REG_SP;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700162 }
163
164 if (flags & REG_DEFA) {
buzbeeb48819d2013-09-14 16:15:25 -0700165 SetupRegMask(&lir->u.m.def_mask, rAX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700166 }
167
168 if (flags & REG_DEFD) {
buzbeeb48819d2013-09-14 16:15:25 -0700169 SetupRegMask(&lir->u.m.def_mask, rDX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700170 }
171 if (flags & REG_USEA) {
buzbeeb48819d2013-09-14 16:15:25 -0700172 SetupRegMask(&lir->u.m.use_mask, rAX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700173 }
174
175 if (flags & REG_USEC) {
buzbeeb48819d2013-09-14 16:15:25 -0700176 SetupRegMask(&lir->u.m.use_mask, rCX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700177 }
178
179 if (flags & REG_USED) {
buzbeeb48819d2013-09-14 16:15:25 -0700180 SetupRegMask(&lir->u.m.use_mask, rDX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700181 }
Vladimir Marko70b797d2013-12-03 15:25:24 +0000182
183 if (flags & REG_USEB) {
184 SetupRegMask(&lir->u.m.use_mask, rBX);
185 }
Mark Mendell4028a6c2014-02-19 20:06:20 -0800186
187 // Fixup hard to describe instruction: Uses rAX, rCX, rDI; sets rDI.
188 if (lir->opcode == kX86RepneScasw) {
189 SetupRegMask(&lir->u.m.use_mask, rAX);
190 SetupRegMask(&lir->u.m.use_mask, rCX);
191 SetupRegMask(&lir->u.m.use_mask, rDI);
192 SetupRegMask(&lir->u.m.def_mask, rDI);
193 }
Serguei Katkove90501d2014-03-12 15:56:54 +0700194
195 if (flags & USE_FP_STACK) {
196 lir->u.m.use_mask |= ENCODE_X86_FP_STACK;
197 lir->u.m.def_mask |= ENCODE_X86_FP_STACK;
198 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700199}
200
201/* For dumping instructions */
202static const char* x86RegName[] = {
203 "rax", "rcx", "rdx", "rbx", "rsp", "rbp", "rsi", "rdi",
204 "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15"
205};
206
207static const char* x86CondName[] = {
208 "O",
209 "NO",
210 "B/NAE/C",
211 "NB/AE/NC",
212 "Z/EQ",
213 "NZ/NE",
214 "BE/NA",
215 "NBE/A",
216 "S",
217 "NS",
218 "P/PE",
219 "NP/PO",
220 "L/NGE",
221 "NL/GE",
222 "LE/NG",
223 "NLE/G"
224};
225
226/*
227 * Interpret a format string and build a string no longer than size
228 * See format key in Assemble.cc.
229 */
230std::string X86Mir2Lir::BuildInsnString(const char *fmt, LIR *lir, unsigned char* base_addr) {
231 std::string buf;
232 size_t i = 0;
233 size_t fmt_len = strlen(fmt);
234 while (i < fmt_len) {
235 if (fmt[i] != '!') {
236 buf += fmt[i];
237 i++;
238 } else {
239 i++;
240 DCHECK_LT(i, fmt_len);
241 char operand_number_ch = fmt[i];
242 i++;
243 if (operand_number_ch == '!') {
244 buf += "!";
245 } else {
246 int operand_number = operand_number_ch - '0';
247 DCHECK_LT(operand_number, 6); // Expect upto 6 LIR operands.
248 DCHECK_LT(i, fmt_len);
249 int operand = lir->operands[operand_number];
250 switch (fmt[i]) {
251 case 'c':
252 DCHECK_LT(static_cast<size_t>(operand), sizeof(x86CondName));
253 buf += x86CondName[operand];
254 break;
255 case 'd':
256 buf += StringPrintf("%d", operand);
257 break;
258 case 'p': {
buzbee0d829482013-10-11 15:24:55 -0700259 EmbeddedData *tab_rec = reinterpret_cast<EmbeddedData*>(UnwrapPointer(operand));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700260 buf += StringPrintf("0x%08x", tab_rec->offset);
261 break;
262 }
263 case 'r':
264 if (X86_FPREG(operand) || X86_DOUBLEREG(operand)) {
265 int fp_reg = operand & X86_FP_REG_MASK;
266 buf += StringPrintf("xmm%d", fp_reg);
267 } else {
268 DCHECK_LT(static_cast<size_t>(operand), sizeof(x86RegName));
269 buf += x86RegName[operand];
270 }
271 break;
272 case 't':
Ian Rogers107c31e2014-01-23 20:55:29 -0800273 buf += StringPrintf("0x%08" PRIxPTR " (L%p)",
274 reinterpret_cast<uintptr_t>(base_addr) + lir->offset + operand,
275 lir->target);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700276 break;
277 default:
278 buf += StringPrintf("DecodeError '%c'", fmt[i]);
279 break;
280 }
281 i++;
282 }
283 }
284 }
285 return buf;
286}
287
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700288void X86Mir2Lir::DumpResourceMask(LIR *x86LIR, uint64_t mask, const char *prefix) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700289 char buf[256];
290 buf[0] = 0;
291
292 if (mask == ENCODE_ALL) {
293 strcpy(buf, "all");
294 } else {
295 char num[8];
296 int i;
297
298 for (i = 0; i < kX86RegEnd; i++) {
299 if (mask & (1ULL << i)) {
Ian Rogers988e6ea2014-01-08 11:30:50 -0800300 snprintf(num, arraysize(num), "%d ", i);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700301 strcat(buf, num);
302 }
303 }
304
305 if (mask & ENCODE_CCODE) {
306 strcat(buf, "cc ");
307 }
308 /* Memory bits */
309 if (x86LIR && (mask & ENCODE_DALVIK_REG)) {
Ian Rogers988e6ea2014-01-08 11:30:50 -0800310 snprintf(buf + strlen(buf), arraysize(buf) - strlen(buf), "dr%d%s",
311 DECODE_ALIAS_INFO_REG(x86LIR->flags.alias_info),
312 (DECODE_ALIAS_INFO_WIDE(x86LIR->flags.alias_info)) ? "(+1)" : "");
Brian Carlstrom7940e442013-07-12 13:46:57 -0700313 }
314 if (mask & ENCODE_LITERAL) {
315 strcat(buf, "lit ");
316 }
317
318 if (mask & ENCODE_HEAP_REF) {
319 strcat(buf, "heap ");
320 }
321 if (mask & ENCODE_MUST_NOT_ALIAS) {
322 strcat(buf, "noalias ");
323 }
324 }
325 if (buf[0]) {
326 LOG(INFO) << prefix << ": " << buf;
327 }
328}
329
330void X86Mir2Lir::AdjustSpillMask() {
331 // Adjustment for LR spilling, x86 has no LR so nothing to do here
332 core_spill_mask_ |= (1 << rRET);
333 num_core_spills_++;
334}
335
336/*
337 * Mark a callee-save fp register as promoted. Note that
338 * vpush/vpop uses contiguous register lists so we must
339 * include any holes in the mask. Associate holes with
340 * Dalvik register INVALID_VREG (0xFFFFU).
341 */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700342void X86Mir2Lir::MarkPreservedSingle(int v_reg, int reg) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700343 UNIMPLEMENTED(WARNING) << "MarkPreservedSingle";
344#if 0
345 LOG(FATAL) << "No support yet for promoted FP regs";
346#endif
347}
348
buzbee2700f7e2014-03-07 09:46:20 -0800349void X86Mir2Lir::FlushRegWide(RegStorage reg) {
350 RegisterInfo* info1 = GetRegInfo(reg.GetLowReg());
351 RegisterInfo* info2 = GetRegInfo(reg.GetHighReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700352 DCHECK(info1 && info2 && info1->pair && info2->pair &&
353 (info1->partner == info2->reg) &&
354 (info2->partner == info1->reg));
355 if ((info1->live && info1->dirty) || (info2->live && info2->dirty)) {
356 if (!(info1->is_temp && info2->is_temp)) {
357 /* Should not happen. If it does, there's a problem in eval_loc */
358 LOG(FATAL) << "Long half-temp, half-promoted";
359 }
360
361 info1->dirty = false;
362 info2->dirty = false;
363 if (mir_graph_->SRegToVReg(info2->s_reg) < mir_graph_->SRegToVReg(info1->s_reg))
364 info1 = info2;
365 int v_reg = mir_graph_->SRegToVReg(info1->s_reg);
buzbee2700f7e2014-03-07 09:46:20 -0800366 StoreBaseDispWide(rs_rX86_SP, VRegOffset(v_reg),
367 RegStorage(RegStorage::k64BitPair, info1->reg, info1->partner));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700368 }
369}
370
buzbee2700f7e2014-03-07 09:46:20 -0800371void X86Mir2Lir::FlushReg(RegStorage reg) {
372 DCHECK(!reg.IsPair());
373 RegisterInfo* info = GetRegInfo(reg.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700374 if (info->live && info->dirty) {
375 info->dirty = false;
376 int v_reg = mir_graph_->SRegToVReg(info->s_reg);
buzbee2700f7e2014-03-07 09:46:20 -0800377 StoreBaseDisp(rs_rX86_SP, VRegOffset(v_reg), reg, kWord);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700378 }
379}
380
381/* Give access to the target-dependent FP register encoding to common code */
382bool X86Mir2Lir::IsFpReg(int reg) {
383 return X86_FPREG(reg);
384}
385
buzbee2700f7e2014-03-07 09:46:20 -0800386bool X86Mir2Lir::IsFpReg(RegStorage reg) {
387 return IsFpReg(reg.IsPair() ? reg.GetLowReg() : reg.GetReg());
388}
389
Brian Carlstrom7940e442013-07-12 13:46:57 -0700390/* Clobber all regs that might be used by an external C call */
Vladimir Marko31c2aac2013-12-09 16:31:19 +0000391void X86Mir2Lir::ClobberCallerSave() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700392 Clobber(rAX);
393 Clobber(rCX);
394 Clobber(rDX);
Vladimir Marko31c2aac2013-12-09 16:31:19 +0000395 Clobber(rBX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700396}
397
398RegLocation X86Mir2Lir::GetReturnWideAlt() {
399 RegLocation res = LocCReturnWide();
buzbee2700f7e2014-03-07 09:46:20 -0800400 CHECK(res.reg.GetLowReg() == rAX);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000401 CHECK(res.reg.GetHighReg() == rDX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700402 Clobber(rAX);
403 Clobber(rDX);
404 MarkInUse(rAX);
405 MarkInUse(rDX);
buzbee2700f7e2014-03-07 09:46:20 -0800406 MarkPair(res.reg.GetLowReg(), res.reg.GetHighReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700407 return res;
408}
409
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700410RegLocation X86Mir2Lir::GetReturnAlt() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700411 RegLocation res = LocCReturn();
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000412 res.reg.SetReg(rDX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700413 Clobber(rDX);
414 MarkInUse(rDX);
415 return res;
416}
417
Brian Carlstrom7940e442013-07-12 13:46:57 -0700418/* To be used when explicitly managing register use */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700419void X86Mir2Lir::LockCallTemps() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700420 LockTemp(rX86_ARG0);
421 LockTemp(rX86_ARG1);
422 LockTemp(rX86_ARG2);
423 LockTemp(rX86_ARG3);
424}
425
426/* To be used when explicitly managing register use */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700427void X86Mir2Lir::FreeCallTemps() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700428 FreeTemp(rX86_ARG0);
429 FreeTemp(rX86_ARG1);
430 FreeTemp(rX86_ARG2);
431 FreeTemp(rX86_ARG3);
432}
433
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800434bool X86Mir2Lir::ProvidesFullMemoryBarrier(X86OpCode opcode) {
435 switch (opcode) {
436 case kX86LockCmpxchgMR:
437 case kX86LockCmpxchgAR:
438 case kX86LockCmpxchg8bM:
439 case kX86LockCmpxchg8bA:
440 case kX86XchgMR:
441 case kX86Mfence:
442 // Atomic memory instructions provide full barrier.
443 return true;
444 default:
445 break;
446 }
447
448 // Conservative if cannot prove it provides full barrier.
449 return false;
450}
451
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700452void X86Mir2Lir::GenMemBarrier(MemBarrierKind barrier_kind) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700453#if ANDROID_SMP != 0
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800454 // Start off with using the last LIR as the barrier. If it is not enough, then we will update it.
455 LIR* mem_barrier = last_lir_insn_;
456
457 /*
458 * According to the JSR-133 Cookbook, for x86 only StoreLoad barriers need memory fence. All other barriers
459 * (LoadLoad, LoadStore, StoreStore) are nops due to the x86 memory model. For those cases, all we need
460 * to ensure is that there is a scheduling barrier in place.
461 */
462 if (barrier_kind == kStoreLoad) {
463 // If no LIR exists already that can be used a barrier, then generate an mfence.
464 if (mem_barrier == nullptr) {
465 mem_barrier = NewLIR0(kX86Mfence);
466 }
467
468 // If last instruction does not provide full barrier, then insert an mfence.
469 if (ProvidesFullMemoryBarrier(static_cast<X86OpCode>(mem_barrier->opcode)) == false) {
470 mem_barrier = NewLIR0(kX86Mfence);
471 }
472 }
473
474 // Now ensure that a scheduling barrier is in place.
475 if (mem_barrier == nullptr) {
476 GenBarrier();
477 } else {
478 // Mark as a scheduling barrier.
479 DCHECK(!mem_barrier->flags.use_def_invalid);
480 mem_barrier->u.m.def_mask = ENCODE_ALL;
481 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700482#endif
483}
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000484
485// Alloc a pair of core registers, or a double.
486RegStorage X86Mir2Lir::AllocTypedTempWide(bool fp_hint, int reg_class) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700487 if (((reg_class == kAnyReg) && fp_hint) || (reg_class == kFPReg)) {
buzbee2700f7e2014-03-07 09:46:20 -0800488 return AllocTempDouble();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700489 }
buzbee2700f7e2014-03-07 09:46:20 -0800490 RegStorage low_reg = AllocTemp();
491 RegStorage high_reg = AllocTemp();
492 return RegStorage::MakeRegPair(low_reg, high_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700493}
494
buzbee2700f7e2014-03-07 09:46:20 -0800495RegStorage X86Mir2Lir::AllocTypedTemp(bool fp_hint, int reg_class) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700496 if (((reg_class == kAnyReg) && fp_hint) || (reg_class == kFPReg)) {
497 return AllocTempFloat();
498 }
499 return AllocTemp();
500}
501
502void X86Mir2Lir::CompilerInitializeRegAlloc() {
503 int num_regs = sizeof(core_regs)/sizeof(*core_regs);
504 int num_reserved = sizeof(ReservedRegs)/sizeof(*ReservedRegs);
505 int num_temps = sizeof(core_temps)/sizeof(*core_temps);
506 int num_fp_regs = sizeof(FpRegs)/sizeof(*FpRegs);
507 int num_fp_temps = sizeof(fp_temps)/sizeof(*fp_temps);
Mathieu Chartierf6c4b3b2013-08-24 16:11:37 -0700508 reg_pool_ = static_cast<RegisterPool*>(arena_->Alloc(sizeof(*reg_pool_),
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000509 kArenaAllocRegAlloc));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700510 reg_pool_->num_core_regs = num_regs;
511 reg_pool_->core_regs =
Mathieu Chartierf6c4b3b2013-08-24 16:11:37 -0700512 static_cast<RegisterInfo*>(arena_->Alloc(num_regs * sizeof(*reg_pool_->core_regs),
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000513 kArenaAllocRegAlloc));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700514 reg_pool_->num_fp_regs = num_fp_regs;
515 reg_pool_->FPRegs =
Mathieu Chartierf6c4b3b2013-08-24 16:11:37 -0700516 static_cast<RegisterInfo *>(arena_->Alloc(num_fp_regs * sizeof(*reg_pool_->FPRegs),
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000517 kArenaAllocRegAlloc));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700518 CompilerInitPool(reg_pool_->core_regs, core_regs, reg_pool_->num_core_regs);
519 CompilerInitPool(reg_pool_->FPRegs, FpRegs, reg_pool_->num_fp_regs);
520 // Keep special registers from being allocated
521 for (int i = 0; i < num_reserved; i++) {
522 MarkInUse(ReservedRegs[i]);
523 }
524 // Mark temp regs - all others not in use can be used for promotion
525 for (int i = 0; i < num_temps; i++) {
526 MarkTemp(core_temps[i]);
527 }
528 for (int i = 0; i < num_fp_temps; i++) {
529 MarkTemp(fp_temps[i]);
530 }
531}
532
buzbee2700f7e2014-03-07 09:46:20 -0800533void X86Mir2Lir::FreeRegLocTemps(RegLocation rl_keep, RegLocation rl_free) {
534 DCHECK(rl_keep.wide);
535 DCHECK(rl_free.wide);
536 int free_low = rl_free.reg.GetLowReg();
537 int free_high = rl_free.reg.GetHighReg();
538 int keep_low = rl_keep.reg.GetLowReg();
539 int keep_high = rl_keep.reg.GetHighReg();
540 if ((free_low != keep_low) && (free_low != keep_high) &&
541 (free_high != keep_low) && (free_high != keep_high)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700542 // No overlap, free both
buzbee2700f7e2014-03-07 09:46:20 -0800543 FreeTemp(free_low);
544 FreeTemp(free_high);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700545 }
546}
547
548void X86Mir2Lir::SpillCoreRegs() {
549 if (num_core_spills_ == 0) {
550 return;
551 }
552 // Spill mask not including fake return address register
553 uint32_t mask = core_spill_mask_ & ~(1 << rRET);
554 int offset = frame_size_ - (4 * num_core_spills_);
555 for (int reg = 0; mask; mask >>= 1, reg++) {
556 if (mask & 0x1) {
buzbee2700f7e2014-03-07 09:46:20 -0800557 StoreWordDisp(rs_rX86_SP, offset, RegStorage::Solo32(reg));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700558 offset += 4;
559 }
560 }
561}
562
563void X86Mir2Lir::UnSpillCoreRegs() {
564 if (num_core_spills_ == 0) {
565 return;
566 }
567 // Spill mask not including fake return address register
568 uint32_t mask = core_spill_mask_ & ~(1 << rRET);
569 int offset = frame_size_ - (4 * num_core_spills_);
570 for (int reg = 0; mask; mask >>= 1, reg++) {
571 if (mask & 0x1) {
buzbee2700f7e2014-03-07 09:46:20 -0800572 LoadWordDisp(rs_rX86_SP, offset, RegStorage::Solo32(reg));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700573 offset += 4;
574 }
575 }
576}
577
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700578bool X86Mir2Lir::IsUnconditionalBranch(LIR* lir) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700579 return (lir->opcode == kX86Jmp8 || lir->opcode == kX86Jmp32);
580}
581
582X86Mir2Lir::X86Mir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena)
Mark Mendell55d0eac2014-02-06 11:02:52 -0800583 : Mir2Lir(cu, mir_graph, arena),
584 method_address_insns_(arena, 100, kGrowableArrayMisc),
585 class_type_address_insns_(arena, 100, kGrowableArrayMisc),
Mark Mendellae9fd932014-02-10 16:14:35 -0800586 call_method_insns_(arena, 100, kGrowableArrayMisc),
587 stack_decrement_(nullptr), stack_increment_(nullptr) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800588 store_method_addr_used_ = false;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700589 for (int i = 0; i < kX86Last; i++) {
590 if (X86Mir2Lir::EncodingMap[i].opcode != i) {
591 LOG(FATAL) << "Encoding order for " << X86Mir2Lir::EncodingMap[i].name
592 << " is wrong: expecting " << i << ", seeing "
593 << static_cast<int>(X86Mir2Lir::EncodingMap[i].opcode);
594 }
595 }
596}
597
598Mir2Lir* X86CodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
599 ArenaAllocator* const arena) {
600 return new X86Mir2Lir(cu, mir_graph, arena);
601}
602
603// Not used in x86
buzbee2700f7e2014-03-07 09:46:20 -0800604RegStorage X86Mir2Lir::LoadHelper(ThreadOffset offset) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700605 LOG(FATAL) << "Unexpected use of LoadHelper in x86";
buzbee2700f7e2014-03-07 09:46:20 -0800606 return RegStorage::InvalidReg();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700607}
608
Dave Allisonb373e092014-02-20 16:06:36 -0800609LIR* X86Mir2Lir::CheckSuspendUsingLoad() {
610 LOG(FATAL) << "Unexpected use of CheckSuspendUsingLoad in x86";
611 return nullptr;
612}
613
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700614uint64_t X86Mir2Lir::GetTargetInstFlags(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700615 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700616 return X86Mir2Lir::EncodingMap[opcode].flags;
617}
618
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700619const char* X86Mir2Lir::GetTargetInstName(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700620 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700621 return X86Mir2Lir::EncodingMap[opcode].name;
622}
623
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700624const char* X86Mir2Lir::GetTargetInstFmt(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700625 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700626 return X86Mir2Lir::EncodingMap[opcode].fmt;
627}
628
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000629/*
630 * Return an updated location record with current in-register status.
631 * If the value lives in live temps, reflect that fact. No code
632 * is generated. If the live value is part of an older pair,
633 * clobber both low and high.
634 */
635// TODO: Reunify with common code after 'pair mess' has been fixed
636RegLocation X86Mir2Lir::UpdateLocWide(RegLocation loc) {
637 DCHECK(loc.wide);
638 DCHECK(CheckCorePoolSanity());
639 if (loc.location != kLocPhysReg) {
640 DCHECK((loc.location == kLocDalvikFrame) ||
641 (loc.location == kLocCompilerTemp));
642 // Are the dalvik regs already live in physical registers?
643 RegisterInfo* info_lo = AllocLive(loc.s_reg_low, kAnyReg);
644
645 // Handle FP registers specially on x86.
646 if (info_lo && IsFpReg(info_lo->reg)) {
647 bool match = true;
648
649 // We can't match a FP register with a pair of Core registers.
650 match = match && (info_lo->pair == 0);
651
652 if (match) {
653 // We can reuse;update the register usage info.
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000654 loc.location = kLocPhysReg;
655 loc.vec_len = kVectorLength8;
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000656 // TODO: use k64BitVector
657 loc.reg = RegStorage(RegStorage::k64BitPair, info_lo->reg, info_lo->reg);
buzbee2700f7e2014-03-07 09:46:20 -0800658 DCHECK(IsFpReg(loc.reg.GetLowReg()));
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000659 return loc;
660 }
661 // We can't easily reuse; clobber and free any overlaps.
662 if (info_lo) {
663 Clobber(info_lo->reg);
664 FreeTemp(info_lo->reg);
665 if (info_lo->pair)
666 Clobber(info_lo->partner);
667 }
668 } else {
669 RegisterInfo* info_hi = AllocLive(GetSRegHi(loc.s_reg_low), kAnyReg);
670 bool match = true;
671 match = match && (info_lo != NULL);
672 match = match && (info_hi != NULL);
673 // Are they both core or both FP?
674 match = match && (IsFpReg(info_lo->reg) == IsFpReg(info_hi->reg));
675 // If a pair of floating point singles, are they properly aligned?
676 if (match && IsFpReg(info_lo->reg)) {
677 match &= ((info_lo->reg & 0x1) == 0);
678 match &= ((info_hi->reg - info_lo->reg) == 1);
679 }
680 // If previously used as a pair, it is the same pair?
681 if (match && (info_lo->pair || info_hi->pair)) {
682 match = (info_lo->pair == info_hi->pair);
683 match &= ((info_lo->reg == info_hi->partner) &&
684 (info_hi->reg == info_lo->partner));
685 }
686 if (match) {
687 // Can reuse - update the register usage info
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000688 loc.reg = RegStorage(RegStorage::k64BitPair, info_lo->reg, info_hi->reg);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000689 loc.location = kLocPhysReg;
buzbee2700f7e2014-03-07 09:46:20 -0800690 MarkPair(loc.reg.GetLowReg(), loc.reg.GetHighReg());
691 DCHECK(!IsFpReg(loc.reg.GetLowReg()) || ((loc.reg.GetLowReg() & 0x1) == 0));
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000692 return loc;
693 }
694 // Can't easily reuse - clobber and free any overlaps
695 if (info_lo) {
696 Clobber(info_lo->reg);
697 FreeTemp(info_lo->reg);
698 if (info_lo->pair)
699 Clobber(info_lo->partner);
700 }
701 if (info_hi) {
702 Clobber(info_hi->reg);
703 FreeTemp(info_hi->reg);
704 if (info_hi->pair)
705 Clobber(info_hi->partner);
706 }
707 }
708 }
709 return loc;
710}
711
712// TODO: Reunify with common code after 'pair mess' has been fixed
713RegLocation X86Mir2Lir::EvalLocWide(RegLocation loc, int reg_class, bool update) {
714 DCHECK(loc.wide);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000715
716 loc = UpdateLocWide(loc);
717
718 /* If it is already in a register, we can assume proper form. Is it the right reg class? */
719 if (loc.location == kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -0800720 DCHECK_EQ(IsFpReg(loc.reg.GetLowReg()), loc.IsVectorScalar());
721 if (!RegClassMatches(reg_class, loc.reg)) {
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000722 /* It is the wrong register class. Reallocate and copy. */
buzbee2700f7e2014-03-07 09:46:20 -0800723 if (!IsFpReg(loc.reg.GetLowReg())) {
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000724 // We want this in a FP reg, and it is in core registers.
725 DCHECK(reg_class != kCoreReg);
726 // Allocate this into any FP reg, and mark it with the right size.
buzbee2700f7e2014-03-07 09:46:20 -0800727 int32_t low_reg = AllocTypedTemp(true, reg_class).GetReg();
728 OpVectorRegCopyWide(low_reg, loc.reg.GetLowReg(), loc.reg.GetHighReg());
729 CopyRegInfo(low_reg, loc.reg.GetLowReg());
730 Clobber(loc.reg);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000731 loc.reg.SetReg(low_reg);
732 loc.reg.SetHighReg(low_reg); // Play nice with existing code.
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000733 loc.vec_len = kVectorLength8;
734 } else {
735 // The value is in a FP register, and we want it in a pair of core registers.
736 DCHECK_EQ(reg_class, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800737 DCHECK_EQ(loc.reg.GetLowReg(), loc.reg.GetHighReg());
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000738 RegStorage new_regs = AllocTypedTempWide(false, kCoreReg); // Force to core registers.
buzbee2700f7e2014-03-07 09:46:20 -0800739 OpRegCopyWide(new_regs, loc.reg);
740 CopyRegInfo(new_regs.GetLowReg(), loc.reg.GetLowReg());
741 CopyRegInfo(new_regs.GetHighReg(), loc.reg.GetHighReg());
742 Clobber(loc.reg);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000743 loc.reg = new_regs;
buzbee2700f7e2014-03-07 09:46:20 -0800744 MarkPair(loc.reg.GetLowReg(), loc.reg.GetHighReg());
745 DCHECK(!IsFpReg(loc.reg.GetLowReg()) || ((loc.reg.GetLowReg() & 0x1) == 0));
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000746 }
747 }
748 return loc;
749 }
750
751 DCHECK_NE(loc.s_reg_low, INVALID_SREG);
Mark Mendelle02d48f2014-01-15 11:19:23 -0800752 DCHECK_NE(GetSRegHi(loc.s_reg_low), INVALID_SREG);
753
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000754 loc.reg = AllocTypedTempWide(loc.fp, reg_class);
Mark Mendelle02d48f2014-01-15 11:19:23 -0800755
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000756 // FIXME: take advantage of RegStorage notation.
buzbee2700f7e2014-03-07 09:46:20 -0800757 if (loc.reg.GetLowReg() == loc.reg.GetHighReg()) {
758 DCHECK(IsFpReg(loc.reg.GetLowReg()));
Mark Mendelle02d48f2014-01-15 11:19:23 -0800759 loc.vec_len = kVectorLength8;
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000760 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800761 MarkPair(loc.reg.GetLowReg(), loc.reg.GetHighReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -0800762 }
763 if (update) {
764 loc.location = kLocPhysReg;
buzbee2700f7e2014-03-07 09:46:20 -0800765 MarkLive(loc.reg.GetLow(), loc.s_reg_low);
766 if (loc.reg.GetLowReg() != loc.reg.GetHighReg()) {
767 MarkLive(loc.reg.GetHigh(), GetSRegHi(loc.s_reg_low));
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000768 }
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000769 }
770 return loc;
771}
772
773// TODO: Reunify with common code after 'pair mess' has been fixed
774RegLocation X86Mir2Lir::EvalLoc(RegLocation loc, int reg_class, bool update) {
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000775 if (loc.wide)
776 return EvalLocWide(loc, reg_class, update);
777
778 loc = UpdateLoc(loc);
779
780 if (loc.location == kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -0800781 if (!RegClassMatches(reg_class, loc.reg)) {
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000782 /* Wrong register class. Realloc, copy and transfer ownership. */
buzbee2700f7e2014-03-07 09:46:20 -0800783 RegStorage new_reg = AllocTypedTemp(loc.fp, reg_class);
784 OpRegCopy(new_reg, loc.reg);
785 CopyRegInfo(new_reg, loc.reg);
786 Clobber(loc.reg);
787 loc.reg = new_reg;
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000788 if (IsFpReg(loc.reg.GetReg()) && reg_class != kCoreReg)
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000789 loc.vec_len = kVectorLength4;
790 }
791 return loc;
792 }
793
794 DCHECK_NE(loc.s_reg_low, INVALID_SREG);
795
buzbee2700f7e2014-03-07 09:46:20 -0800796 loc.reg = AllocTypedTemp(loc.fp, reg_class);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000797 if (IsFpReg(loc.reg.GetReg()) && reg_class != kCoreReg)
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000798 loc.vec_len = kVectorLength4;
799
800 if (update) {
801 loc.location = kLocPhysReg;
buzbee2700f7e2014-03-07 09:46:20 -0800802 MarkLive(loc.reg, loc.s_reg_low);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000803 }
804 return loc;
805}
806
buzbee2700f7e2014-03-07 09:46:20 -0800807RegStorage X86Mir2Lir::AllocTempDouble() {
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000808 // We really don't need a pair of registers.
buzbee2700f7e2014-03-07 09:46:20 -0800809 // FIXME - update to double
810 int reg = AllocTempFloat().GetReg();
811 return RegStorage(RegStorage::k64BitPair, reg, reg);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000812}
813
814// TODO: Reunify with common code after 'pair mess' has been fixed
815void X86Mir2Lir::ResetDefLocWide(RegLocation rl) {
816 DCHECK(rl.wide);
buzbee2700f7e2014-03-07 09:46:20 -0800817 RegisterInfo* p_low = IsTemp(rl.reg.GetLowReg());
818 if (IsFpReg(rl.reg.GetLowReg())) {
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000819 // We are using only the low register.
820 if (p_low && !(cu_->disable_opt & (1 << kSuppressLoads))) {
821 NullifyRange(p_low->def_start, p_low->def_end, p_low->s_reg, rl.s_reg_low);
822 }
buzbee2700f7e2014-03-07 09:46:20 -0800823 ResetDef(rl.reg.GetLowReg());
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000824 } else {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000825 RegisterInfo* p_high = IsTemp(rl.reg.GetHighReg());
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000826 if (p_low && !(cu_->disable_opt & (1 << kSuppressLoads))) {
827 DCHECK(p_low->pair);
828 NullifyRange(p_low->def_start, p_low->def_end, p_low->s_reg, rl.s_reg_low);
829 }
830 if (p_high && !(cu_->disable_opt & (1 << kSuppressLoads))) {
831 DCHECK(p_high->pair);
832 }
buzbee2700f7e2014-03-07 09:46:20 -0800833 ResetDef(rl.reg.GetLowReg());
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000834 ResetDef(rl.reg.GetHighReg());
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000835 }
836}
837
838void X86Mir2Lir::GenConstWide(RegLocation rl_dest, int64_t value) {
839 // Can we do this directly to memory?
840 rl_dest = UpdateLocWide(rl_dest);
841 if ((rl_dest.location == kLocDalvikFrame) ||
842 (rl_dest.location == kLocCompilerTemp)) {
843 int32_t val_lo = Low32Bits(value);
844 int32_t val_hi = High32Bits(value);
buzbee2700f7e2014-03-07 09:46:20 -0800845 int r_base = TargetReg(kSp).GetReg();
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000846 int displacement = SRegOffset(rl_dest.s_reg_low);
847
buzbee2700f7e2014-03-07 09:46:20 -0800848 LIR * store = NewLIR3(kX86Mov32MI, r_base, displacement + LOWORD_OFFSET, val_lo);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000849 AnnotateDalvikRegAccess(store, (displacement + LOWORD_OFFSET) >> 2,
850 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -0800851 store = NewLIR3(kX86Mov32MI, r_base, displacement + HIWORD_OFFSET, val_hi);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000852 AnnotateDalvikRegAccess(store, (displacement + HIWORD_OFFSET) >> 2,
853 false /* is_load */, true /* is64bit */);
854 return;
855 }
856
857 // Just use the standard code to do the generation.
858 Mir2Lir::GenConstWide(rl_dest, value);
859}
Mark Mendelle02d48f2014-01-15 11:19:23 -0800860
861// TODO: Merge with existing RegLocation dumper in vreg_analysis.cc
862void X86Mir2Lir::DumpRegLocation(RegLocation loc) {
863 LOG(INFO) << "location: " << loc.location << ','
864 << (loc.wide ? " w" : " ")
865 << (loc.defined ? " D" : " ")
866 << (loc.is_const ? " c" : " ")
867 << (loc.fp ? " F" : " ")
868 << (loc.core ? " C" : " ")
869 << (loc.ref ? " r" : " ")
870 << (loc.high_word ? " h" : " ")
871 << (loc.home ? " H" : " ")
872 << " vec_len: " << loc.vec_len
buzbee2700f7e2014-03-07 09:46:20 -0800873 << ", low: " << static_cast<int>(loc.reg.GetLowReg())
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000874 << ", high: " << static_cast<int>(loc.reg.GetHighReg())
Mark Mendelle02d48f2014-01-15 11:19:23 -0800875 << ", s_reg: " << loc.s_reg_low
876 << ", orig: " << loc.orig_sreg;
877}
878
Mark Mendell67c39c42014-01-31 17:28:00 -0800879void X86Mir2Lir::Materialize() {
880 // A good place to put the analysis before starting.
881 AnalyzeMIR();
882
883 // Now continue with regular code generation.
884 Mir2Lir::Materialize();
885}
886
Jeff Hao49161ce2014-03-12 11:05:25 -0700887void X86Mir2Lir::LoadMethodAddress(const MethodReference& target_method, InvokeType type,
Mark Mendell55d0eac2014-02-06 11:02:52 -0800888 SpecialTargetRegister symbolic_reg) {
889 /*
890 * For x86, just generate a 32 bit move immediate instruction, that will be filled
891 * in at 'link time'. For now, put a unique value based on target to ensure that
892 * code deduplication works.
893 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700894 int target_method_idx = target_method.dex_method_index;
895 const DexFile* target_dex_file = target_method.dex_file;
896 const DexFile::MethodId& target_method_id = target_dex_file->GetMethodId(target_method_idx);
897 uintptr_t target_method_id_ptr = reinterpret_cast<uintptr_t>(&target_method_id);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800898
Jeff Hao49161ce2014-03-12 11:05:25 -0700899 // Generate the move instruction with the unique pointer and save index, dex_file, and type.
buzbee2700f7e2014-03-07 09:46:20 -0800900 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI, TargetReg(symbolic_reg).GetReg(),
Jeff Hao49161ce2014-03-12 11:05:25 -0700901 static_cast<int>(target_method_id_ptr), target_method_idx,
902 WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800903 AppendLIR(move);
904 method_address_insns_.Insert(move);
905}
906
907void X86Mir2Lir::LoadClassType(uint32_t type_idx, SpecialTargetRegister symbolic_reg) {
908 /*
909 * For x86, just generate a 32 bit move immediate instruction, that will be filled
910 * in at 'link time'. For now, put a unique value based on target to ensure that
911 * code deduplication works.
912 */
913 const DexFile::TypeId& id = cu_->dex_file->GetTypeId(type_idx);
914 uintptr_t ptr = reinterpret_cast<uintptr_t>(&id);
915
916 // Generate the move instruction with the unique pointer and save index and type.
buzbee2700f7e2014-03-07 09:46:20 -0800917 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI, TargetReg(symbolic_reg).GetReg(),
Mark Mendell55d0eac2014-02-06 11:02:52 -0800918 static_cast<int>(ptr), type_idx);
919 AppendLIR(move);
920 class_type_address_insns_.Insert(move);
921}
922
Jeff Hao49161ce2014-03-12 11:05:25 -0700923LIR *X86Mir2Lir::CallWithLinkerFixup(const MethodReference& target_method, InvokeType type) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800924 /*
925 * For x86, just generate a 32 bit call relative instruction, that will be filled
926 * in at 'link time'. For now, put a unique value based on target to ensure that
927 * code deduplication works.
928 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700929 int target_method_idx = target_method.dex_method_index;
930 const DexFile* target_dex_file = target_method.dex_file;
931 const DexFile::MethodId& target_method_id = target_dex_file->GetMethodId(target_method_idx);
932 uintptr_t target_method_id_ptr = reinterpret_cast<uintptr_t>(&target_method_id);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800933
Jeff Hao49161ce2014-03-12 11:05:25 -0700934 // Generate the call instruction with the unique pointer and save index, dex_file, and type.
935 LIR *call = RawLIR(current_dalvik_offset_, kX86CallI, static_cast<int>(target_method_id_ptr),
936 target_method_idx, WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800937 AppendLIR(call);
938 call_method_insns_.Insert(call);
939 return call;
940}
941
942void X86Mir2Lir::InstallLiteralPools() {
943 // These are handled differently for x86.
944 DCHECK(code_literal_list_ == nullptr);
945 DCHECK(method_literal_list_ == nullptr);
946 DCHECK(class_literal_list_ == nullptr);
947
948 // Handle the fixups for methods.
949 for (uint32_t i = 0; i < method_address_insns_.Size(); i++) {
950 LIR* p = method_address_insns_.Get(i);
951 DCHECK_EQ(p->opcode, kX86Mov32RI);
Jeff Hao49161ce2014-03-12 11:05:25 -0700952 uint32_t target_method_idx = p->operands[2];
953 const DexFile* target_dex_file =
954 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[3]));
Mark Mendell55d0eac2014-02-06 11:02:52 -0800955
956 // The offset to patch is the last 4 bytes of the instruction.
957 int patch_offset = p->offset + p->flags.size - 4;
958 cu_->compiler_driver->AddMethodPatch(cu_->dex_file, cu_->class_def_idx,
959 cu_->method_idx, cu_->invoke_type,
Jeff Hao49161ce2014-03-12 11:05:25 -0700960 target_method_idx, target_dex_file,
961 static_cast<InvokeType>(p->operands[4]),
Mark Mendell55d0eac2014-02-06 11:02:52 -0800962 patch_offset);
963 }
964
965 // Handle the fixups for class types.
966 for (uint32_t i = 0; i < class_type_address_insns_.Size(); i++) {
967 LIR* p = class_type_address_insns_.Get(i);
968 DCHECK_EQ(p->opcode, kX86Mov32RI);
Jeff Hao49161ce2014-03-12 11:05:25 -0700969 uint32_t target_method_idx = p->operands[2];
Mark Mendell55d0eac2014-02-06 11:02:52 -0800970
971 // The offset to patch is the last 4 bytes of the instruction.
972 int patch_offset = p->offset + p->flags.size - 4;
973 cu_->compiler_driver->AddClassPatch(cu_->dex_file, cu_->class_def_idx,
Jeff Hao49161ce2014-03-12 11:05:25 -0700974 cu_->method_idx, target_method_idx, patch_offset);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800975 }
976
977 // And now the PC-relative calls to methods.
978 for (uint32_t i = 0; i < call_method_insns_.Size(); i++) {
979 LIR* p = call_method_insns_.Get(i);
980 DCHECK_EQ(p->opcode, kX86CallI);
Jeff Hao49161ce2014-03-12 11:05:25 -0700981 uint32_t target_method_idx = p->operands[1];
982 const DexFile* target_dex_file =
983 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[2]));
Mark Mendell55d0eac2014-02-06 11:02:52 -0800984
985 // The offset to patch is the last 4 bytes of the instruction.
986 int patch_offset = p->offset + p->flags.size - 4;
987 cu_->compiler_driver->AddRelativeCodePatch(cu_->dex_file, cu_->class_def_idx,
Jeff Hao49161ce2014-03-12 11:05:25 -0700988 cu_->method_idx, cu_->invoke_type,
989 target_method_idx, target_dex_file,
990 static_cast<InvokeType>(p->operands[3]),
Mark Mendell55d0eac2014-02-06 11:02:52 -0800991 patch_offset, -4 /* offset */);
992 }
993
994 // And do the normal processing.
995 Mir2Lir::InstallLiteralPools();
996}
997
Mark Mendell4028a6c2014-02-19 20:06:20 -0800998/*
999 * Fast string.index_of(I) & (II). Inline check for simple case of char <= 0xffff,
1000 * otherwise bails to standard library code.
1001 */
1002bool X86Mir2Lir::GenInlinedIndexOf(CallInfo* info, bool zero_based) {
1003 ClobberCallerSave();
1004 LockCallTemps(); // Using fixed registers
1005
1006 // EAX: 16 bit character being searched.
1007 // ECX: count: number of words to be searched.
1008 // EDI: String being searched.
1009 // EDX: temporary during execution.
1010 // EBX: temporary during execution.
1011
1012 RegLocation rl_obj = info->args[0];
1013 RegLocation rl_char = info->args[1];
buzbeea44d4f52014-03-05 11:26:39 -08001014 RegLocation rl_start; // Note: only present in III flavor or IndexOf.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001015
1016 uint32_t char_value =
1017 rl_char.is_const ? mir_graph_->ConstantValue(rl_char.orig_sreg) : 0;
1018
1019 if (char_value > 0xFFFF) {
1020 // We have to punt to the real String.indexOf.
1021 return false;
1022 }
1023
1024 // Okay, we are commited to inlining this.
1025 RegLocation rl_return = GetReturn(false);
1026 RegLocation rl_dest = InlineTarget(info);
1027
1028 // Is the string non-NULL?
buzbee2700f7e2014-03-07 09:46:20 -08001029 LoadValueDirectFixed(rl_obj, rs_rDX);
1030 GenNullCheck(rs_rDX, info->opt_flags);
Vladimir Marko3bc86152014-03-13 14:11:28 +00001031 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've null checked.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001032
1033 // Does the character fit in 16 bits?
Vladimir Marko3bc86152014-03-13 14:11:28 +00001034 LIR* launchpad_branch = nullptr;
Mark Mendell4028a6c2014-02-19 20:06:20 -08001035 if (rl_char.is_const) {
1036 // We need the value in EAX.
buzbee2700f7e2014-03-07 09:46:20 -08001037 LoadConstantNoClobber(rs_rAX, char_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001038 } else {
1039 // Character is not a constant; compare at runtime.
buzbee2700f7e2014-03-07 09:46:20 -08001040 LoadValueDirectFixed(rl_char, rs_rAX);
1041 launchpad_branch = OpCmpImmBranch(kCondGt, rs_rAX, 0xFFFF, nullptr);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001042 }
1043
1044 // From here down, we know that we are looking for a char that fits in 16 bits.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001045 // Location of reference to data array within the String object.
1046 int value_offset = mirror::String::ValueOffset().Int32Value();
1047 // Location of count within the String object.
1048 int count_offset = mirror::String::CountOffset().Int32Value();
1049 // Starting offset within data array.
1050 int offset_offset = mirror::String::OffsetOffset().Int32Value();
1051 // Start of char data with array_.
1052 int data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Int32Value();
Mark Mendell4028a6c2014-02-19 20:06:20 -08001053
1054 // Character is in EAX.
1055 // Object pointer is in EDX.
1056
1057 // We need to preserve EDI, but have no spare registers, so push it on the stack.
1058 // We have to remember that all stack addresses after this are offset by sizeof(EDI).
1059 NewLIR1(kX86Push32R, rDI);
1060
1061 // Compute the number of words to search in to rCX.
buzbee2700f7e2014-03-07 09:46:20 -08001062 LoadWordDisp(rs_rDX, count_offset, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001063 LIR *length_compare = nullptr;
1064 int start_value = 0;
1065 if (zero_based) {
1066 // We have to handle an empty string. Use special instruction JECXZ.
1067 length_compare = NewLIR0(kX86Jecxz8);
1068 } else {
buzbeea44d4f52014-03-05 11:26:39 -08001069 rl_start = info->args[2];
Mark Mendell4028a6c2014-02-19 20:06:20 -08001070 // We have to offset by the start index.
1071 if (rl_start.is_const) {
1072 start_value = mir_graph_->ConstantValue(rl_start.orig_sreg);
1073 start_value = std::max(start_value, 0);
1074
1075 // Is the start > count?
buzbee2700f7e2014-03-07 09:46:20 -08001076 length_compare = OpCmpImmBranch(kCondLe, rs_rCX, start_value, nullptr);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001077
1078 if (start_value != 0) {
buzbee2700f7e2014-03-07 09:46:20 -08001079 OpRegImm(kOpSub, rs_rCX, start_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001080 }
1081 } else {
1082 // Runtime start index.
1083 rl_start = UpdateLoc(rl_start);
1084 if (rl_start.location == kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08001085 length_compare = OpCmpBranch(kCondLe, rs_rCX, rl_start.reg, nullptr);
1086 OpRegReg(kOpSub, rs_rCX, rl_start.reg);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001087 } else {
1088 // Compare to memory to avoid a register load. Handle pushed EDI.
1089 int displacement = SRegOffset(rl_start.s_reg_low) + sizeof(uint32_t);
buzbee2700f7e2014-03-07 09:46:20 -08001090 OpRegMem(kOpCmp, rs_rCX, rs_rX86_SP, displacement);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001091 length_compare = NewLIR2(kX86Jcc8, 0, kX86CondLe);
buzbee2700f7e2014-03-07 09:46:20 -08001092 OpRegMem(kOpSub, rs_rCX, rs_rX86_SP, displacement);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001093 }
1094 }
1095 }
1096 DCHECK(length_compare != nullptr);
1097
1098 // ECX now contains the count in words to be searched.
1099
1100 // Load the address of the string into EBX.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001101 // The string starts at VALUE(String) + 2 * OFFSET(String) + DATA_OFFSET.
buzbee2700f7e2014-03-07 09:46:20 -08001102 LoadWordDisp(rs_rDX, value_offset, rs_rDI);
1103 LoadWordDisp(rs_rDX, offset_offset, rs_rBX);
1104 OpLea(rs_rBX, rs_rDI, rs_rBX, 1, data_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001105
1106 // Now compute into EDI where the search will start.
1107 if (zero_based || rl_start.is_const) {
1108 if (start_value == 0) {
buzbee2700f7e2014-03-07 09:46:20 -08001109 OpRegCopy(rs_rDI, rs_rBX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001110 } else {
1111 NewLIR3(kX86Lea32RM, rDI, rBX, 2 * start_value);
1112 }
1113 } else {
1114 if (rl_start.location == kLocPhysReg) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001115 if (rl_start.reg.GetReg() == rDI) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001116 // We have a slight problem here. We are already using RDI!
1117 // Grab the value from the stack.
buzbee2700f7e2014-03-07 09:46:20 -08001118 LoadWordDisp(rs_rX86_SP, 0, rs_rDX);
1119 OpLea(rs_rDI, rs_rBX, rs_rDX, 1, 0);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001120 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001121 OpLea(rs_rDI, rs_rBX, rl_start.reg, 1, 0);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001122 }
1123 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001124 OpRegCopy(rs_rDI, rs_rBX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001125 // Load the start index from stack, remembering that we pushed EDI.
1126 int displacement = SRegOffset(rl_start.s_reg_low) + sizeof(uint32_t);
buzbee2700f7e2014-03-07 09:46:20 -08001127 LoadWordDisp(rs_rX86_SP, displacement, rs_rDX);
1128 OpLea(rs_rDI, rs_rBX, rs_rDX, 1, 0);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001129 }
1130 }
1131
1132 // EDI now contains the start of the string to be searched.
1133 // We are all prepared to do the search for the character.
1134 NewLIR0(kX86RepneScasw);
1135
1136 // Did we find a match?
1137 LIR* failed_branch = OpCondBranch(kCondNe, nullptr);
1138
1139 // yes, we matched. Compute the index of the result.
1140 // index = ((curr_ptr - orig_ptr) / 2) - 1.
buzbee2700f7e2014-03-07 09:46:20 -08001141 OpRegReg(kOpSub, rs_rDI, rs_rBX);
1142 OpRegImm(kOpAsr, rs_rDI, 1);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001143 NewLIR3(kX86Lea32RM, rl_return.reg.GetReg(), rDI, -1);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001144 LIR *all_done = NewLIR1(kX86Jmp8, 0);
1145
1146 // Failed to match; return -1.
1147 LIR *not_found = NewLIR0(kPseudoTargetLabel);
1148 length_compare->target = not_found;
1149 failed_branch->target = not_found;
buzbee2700f7e2014-03-07 09:46:20 -08001150 LoadConstantNoClobber(rl_return.reg, -1);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001151
1152 // And join up at the end.
1153 all_done->target = NewLIR0(kPseudoTargetLabel);
1154 // Restore EDI from the stack.
1155 NewLIR1(kX86Pop32R, rDI);
1156
1157 // Out of line code returns here.
Vladimir Marko3bc86152014-03-13 14:11:28 +00001158 if (launchpad_branch != nullptr) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001159 LIR *return_point = NewLIR0(kPseudoTargetLabel);
Vladimir Marko3bc86152014-03-13 14:11:28 +00001160 AddIntrinsicLaunchpad(info, launchpad_branch, return_point);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001161 }
1162
1163 StoreValue(rl_dest, rl_return);
1164 return true;
1165}
1166
Mark Mendellae9fd932014-02-10 16:14:35 -08001167/*
1168 * @brief Enter a 32 bit quantity into the FDE buffer
1169 * @param buf FDE buffer.
1170 * @param data Data value.
1171 */
1172static void PushWord(std::vector<uint8_t>&buf, int data) {
1173 buf.push_back(data & 0xff);
1174 buf.push_back((data >> 8) & 0xff);
1175 buf.push_back((data >> 16) & 0xff);
1176 buf.push_back((data >> 24) & 0xff);
1177}
1178
1179/*
1180 * @brief Enter an 'advance LOC' into the FDE buffer
1181 * @param buf FDE buffer.
1182 * @param increment Amount by which to increase the current location.
1183 */
1184static void AdvanceLoc(std::vector<uint8_t>&buf, uint32_t increment) {
1185 if (increment < 64) {
1186 // Encoding in opcode.
1187 buf.push_back(0x1 << 6 | increment);
1188 } else if (increment < 256) {
1189 // Single byte delta.
1190 buf.push_back(0x02);
1191 buf.push_back(increment);
1192 } else if (increment < 256 * 256) {
1193 // Two byte delta.
1194 buf.push_back(0x03);
1195 buf.push_back(increment & 0xff);
1196 buf.push_back((increment >> 8) & 0xff);
1197 } else {
1198 // Four byte delta.
1199 buf.push_back(0x04);
1200 PushWord(buf, increment);
1201 }
1202}
1203
1204
1205std::vector<uint8_t>* X86CFIInitialization() {
1206 return X86Mir2Lir::ReturnCommonCallFrameInformation();
1207}
1208
1209std::vector<uint8_t>* X86Mir2Lir::ReturnCommonCallFrameInformation() {
1210 std::vector<uint8_t>*cfi_info = new std::vector<uint8_t>;
1211
1212 // Length of the CIE (except for this field).
1213 PushWord(*cfi_info, 16);
1214
1215 // CIE id.
1216 PushWord(*cfi_info, 0xFFFFFFFFU);
1217
1218 // Version: 3.
1219 cfi_info->push_back(0x03);
1220
1221 // Augmentation: empty string.
1222 cfi_info->push_back(0x0);
1223
1224 // Code alignment: 1.
1225 cfi_info->push_back(0x01);
1226
1227 // Data alignment: -4.
1228 cfi_info->push_back(0x7C);
1229
1230 // Return address register (R8).
1231 cfi_info->push_back(0x08);
1232
1233 // Initial return PC is 4(ESP): DW_CFA_def_cfa R4 4.
1234 cfi_info->push_back(0x0C);
1235 cfi_info->push_back(0x04);
1236 cfi_info->push_back(0x04);
1237
1238 // Return address location: 0(SP): DW_CFA_offset R8 1 (* -4);.
1239 cfi_info->push_back(0x2 << 6 | 0x08);
1240 cfi_info->push_back(0x01);
1241
1242 // And 2 Noops to align to 4 byte boundary.
1243 cfi_info->push_back(0x0);
1244 cfi_info->push_back(0x0);
1245
1246 DCHECK_EQ(cfi_info->size() & 3, 0U);
1247 return cfi_info;
1248}
1249
1250static void EncodeUnsignedLeb128(std::vector<uint8_t>& buf, uint32_t value) {
1251 uint8_t buffer[12];
1252 uint8_t *ptr = EncodeUnsignedLeb128(buffer, value);
1253 for (uint8_t *p = buffer; p < ptr; p++) {
1254 buf.push_back(*p);
1255 }
1256}
1257
1258std::vector<uint8_t>* X86Mir2Lir::ReturnCallFrameInformation() {
1259 std::vector<uint8_t>*cfi_info = new std::vector<uint8_t>;
1260
1261 // Generate the FDE for the method.
1262 DCHECK_NE(data_offset_, 0U);
1263
1264 // Length (will be filled in later in this routine).
1265 PushWord(*cfi_info, 0);
1266
1267 // CIE_pointer (can be filled in by linker); might be left at 0 if there is only
1268 // one CIE for the whole debug_frame section.
1269 PushWord(*cfi_info, 0);
1270
1271 // 'initial_location' (filled in by linker).
1272 PushWord(*cfi_info, 0);
1273
1274 // 'address_range' (number of bytes in the method).
1275 PushWord(*cfi_info, data_offset_);
1276
1277 // The instructions in the FDE.
1278 if (stack_decrement_ != nullptr) {
1279 // Advance LOC to just past the stack decrement.
1280 uint32_t pc = NEXT_LIR(stack_decrement_)->offset;
1281 AdvanceLoc(*cfi_info, pc);
1282
1283 // Now update the offset to the call frame: DW_CFA_def_cfa_offset frame_size.
1284 cfi_info->push_back(0x0e);
1285 EncodeUnsignedLeb128(*cfi_info, frame_size_);
1286
1287 // We continue with that stack until the epilogue.
1288 if (stack_increment_ != nullptr) {
1289 uint32_t new_pc = NEXT_LIR(stack_increment_)->offset;
1290 AdvanceLoc(*cfi_info, new_pc - pc);
1291
1292 // We probably have code snippets after the epilogue, so save the
1293 // current state: DW_CFA_remember_state.
1294 cfi_info->push_back(0x0a);
1295
1296 // We have now popped the stack: DW_CFA_def_cfa_offset 4. There is only the return
1297 // PC on the stack now.
1298 cfi_info->push_back(0x0e);
1299 EncodeUnsignedLeb128(*cfi_info, 4);
1300
1301 // Everything after that is the same as before the epilogue.
1302 // Stack bump was followed by RET instruction.
1303 LIR *post_ret_insn = NEXT_LIR(NEXT_LIR(stack_increment_));
1304 if (post_ret_insn != nullptr) {
1305 pc = new_pc;
1306 new_pc = post_ret_insn->offset;
1307 AdvanceLoc(*cfi_info, new_pc - pc);
1308 // Restore the state: DW_CFA_restore_state.
1309 cfi_info->push_back(0x0b);
1310 }
1311 }
1312 }
1313
1314 // Padding to a multiple of 4
1315 while ((cfi_info->size() & 3) != 0) {
1316 // DW_CFA_nop is encoded as 0.
1317 cfi_info->push_back(0);
1318 }
1319
1320 // Set the length of the FDE inside the generated bytes.
1321 uint32_t length = cfi_info->size() - 4;
1322 (*cfi_info)[0] = length;
1323 (*cfi_info)[1] = length >> 8;
1324 (*cfi_info)[2] = length >> 16;
1325 (*cfi_info)[3] = length >> 24;
1326 return cfi_info;
1327}
1328
Brian Carlstrom7934ac22013-07-26 10:54:15 -07001329} // namespace art