blob: 2ef4c218c327bd131d1deaa9806ac7e0b9497da3 [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
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +070017#include <cstdarg>
Nicolas Geoffrayf3e2cc42014-02-18 18:37:26 +000018#include <inttypes.h>
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +070019#include <string>
Nicolas Geoffrayf3e2cc42014-02-18 18:37:26 +000020
Andreas Gampe53c913b2014-08-12 23:19:23 -070021#include "backend_x86.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070022#include "codegen_x86.h"
23#include "dex/compiler_internals.h"
24#include "dex/quick/mir_to_lir-inl.h"
buzbeeb5860fb2014-06-21 15:31:01 -070025#include "dex/reg_storage_eq.h"
Ian Rogers7e70b002014-10-08 11:47:24 -070026#include "mirror/array-inl.h"
Vladimir Markof4da6752014-08-01 19:04:18 +010027#include "mirror/art_method.h"
Mark Mendelle19c91f2014-02-25 08:19:08 -080028#include "mirror/string.h"
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -070029#include "oat.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070030#include "x86_lir.h"
Tong Shen547cdfd2014-08-05 01:54:19 -070031#include "utils/dwarf_cfi.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070032
Brian Carlstrom7940e442013-07-12 13:46:57 -070033namespace art {
34
Vladimir Marko089142c2014-06-05 10:57:05 +010035static constexpr RegStorage core_regs_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070036 rs_rAX, rs_rCX, rs_rDX, rs_rBX, rs_rX86_SP_32, rs_rBP, rs_rSI, rs_rDI,
37};
Vladimir Marko089142c2014-06-05 10:57:05 +010038static constexpr RegStorage core_regs_arr_64[] = {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +070039 rs_rAX, rs_rCX, rs_rDX, rs_rBX, rs_rX86_SP_32, rs_rBP, rs_rSI, rs_rDI,
buzbee091cc402014-03-31 10:14:40 -070040 rs_r8, rs_r9, rs_r10, rs_r11, rs_r12, rs_r13, rs_r14, rs_r15
Brian Carlstrom7940e442013-07-12 13:46:57 -070041};
Vladimir Marko089142c2014-06-05 10:57:05 +010042static constexpr RegStorage core_regs_arr_64q[] = {
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070043 rs_r0q, rs_r1q, rs_r2q, rs_r3q, rs_rX86_SP_64, rs_r5q, rs_r6q, rs_r7q,
Dmitry Petrochenkoa20468c2014-04-30 13:40:19 +070044 rs_r8q, rs_r9q, rs_r10q, rs_r11q, rs_r12q, rs_r13q, rs_r14q, rs_r15q
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070045};
Vladimir Marko089142c2014-06-05 10:57:05 +010046static constexpr RegStorage sp_regs_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070047 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
48};
Vladimir Marko089142c2014-06-05 10:57:05 +010049static constexpr RegStorage sp_regs_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -070050 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
buzbee091cc402014-03-31 10:14:40 -070051 rs_fr8, rs_fr9, rs_fr10, rs_fr11, rs_fr12, rs_fr13, rs_fr14, rs_fr15
Brian Carlstrom7940e442013-07-12 13:46:57 -070052};
Vladimir Marko089142c2014-06-05 10:57:05 +010053static constexpr RegStorage dp_regs_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070054 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
55};
Vladimir Marko089142c2014-06-05 10:57:05 +010056static constexpr RegStorage dp_regs_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -070057 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
buzbee091cc402014-03-31 10:14:40 -070058 rs_dr8, rs_dr9, rs_dr10, rs_dr11, rs_dr12, rs_dr13, rs_dr14, rs_dr15
Brian Carlstrom7940e442013-07-12 13:46:57 -070059};
Serguei Katkovc3801912014-07-08 17:21:53 +070060static constexpr RegStorage xp_regs_arr_32[] = {
61 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
62};
63static constexpr RegStorage xp_regs_arr_64[] = {
64 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
65 rs_xr8, rs_xr9, rs_xr10, rs_xr11, rs_xr12, rs_xr13, rs_xr14, rs_xr15
66};
Vladimir Marko089142c2014-06-05 10:57:05 +010067static constexpr RegStorage reserved_regs_arr_32[] = {rs_rX86_SP_32};
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +070068static constexpr RegStorage reserved_regs_arr_64[] = {rs_rX86_SP_32};
Vladimir Marko089142c2014-06-05 10:57:05 +010069static constexpr RegStorage reserved_regs_arr_64q[] = {rs_rX86_SP_64};
70static constexpr RegStorage core_temps_arr_32[] = {rs_rAX, rs_rCX, rs_rDX, rs_rBX};
71static constexpr RegStorage core_temps_arr_64[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070072 rs_rAX, rs_rCX, rs_rDX, rs_rSI, rs_rDI,
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070073 rs_r8, rs_r9, rs_r10, rs_r11
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070074};
Serguei Katkovc3801912014-07-08 17:21:53 +070075
76// How to add register to be available for promotion:
77// 1) Remove register from array defining temp
78// 2) Update ClobberCallerSave
79// 3) Update JNI compiler ABI:
80// 3.1) add reg in JniCallingConvention method
81// 3.2) update CoreSpillMask/FpSpillMask
82// 4) Update entrypoints
83// 4.1) Update constants in asm_support_x86_64.h for new frame size
84// 4.2) Remove entry in SmashCallerSaves
85// 4.3) Update jni_entrypoints to spill/unspill new callee save reg
86// 4.4) Update quick_entrypoints to spill/unspill new callee save reg
87// 5) Update runtime ABI
88// 5.1) Update quick_method_frame_info with new required spills
89// 5.2) Update QuickArgumentVisitor with new offsets to gprs and xmms
90// Note that you cannot use register corresponding to incoming args
91// according to ABI and QCG needs one additional XMM temp for
92// bulk copy in preparation to call.
Vladimir Marko089142c2014-06-05 10:57:05 +010093static constexpr RegStorage core_temps_arr_64q[] = {
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070094 rs_r0q, rs_r1q, rs_r2q, rs_r6q, rs_r7q,
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070095 rs_r8q, rs_r9q, rs_r10q, rs_r11q
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070096};
Vladimir Marko089142c2014-06-05 10:57:05 +010097static constexpr RegStorage sp_temps_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070098 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
99};
Vladimir Marko089142c2014-06-05 10:57:05 +0100100static constexpr RegStorage sp_temps_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -0700101 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
Serguei Katkovc3801912014-07-08 17:21:53 +0700102 rs_fr8, rs_fr9, rs_fr10, rs_fr11
buzbee091cc402014-03-31 10:14:40 -0700103};
Vladimir Marko089142c2014-06-05 10:57:05 +0100104static constexpr RegStorage dp_temps_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700105 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
106};
Vladimir Marko089142c2014-06-05 10:57:05 +0100107static constexpr RegStorage dp_temps_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -0700108 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
Serguei Katkovc3801912014-07-08 17:21:53 +0700109 rs_dr8, rs_dr9, rs_dr10, rs_dr11
buzbee091cc402014-03-31 10:14:40 -0700110};
111
Vladimir Marko089142c2014-06-05 10:57:05 +0100112static constexpr RegStorage xp_temps_arr_32[] = {
Mark Mendellfe945782014-05-22 09:52:36 -0400113 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
114};
Vladimir Marko089142c2014-06-05 10:57:05 +0100115static constexpr RegStorage xp_temps_arr_64[] = {
Mark Mendellfe945782014-05-22 09:52:36 -0400116 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
Serguei Katkovc3801912014-07-08 17:21:53 +0700117 rs_xr8, rs_xr9, rs_xr10, rs_xr11
Mark Mendellfe945782014-05-22 09:52:36 -0400118};
119
Vladimir Marko089142c2014-06-05 10:57:05 +0100120static constexpr ArrayRef<const RegStorage> empty_pool;
121static constexpr ArrayRef<const RegStorage> core_regs_32(core_regs_arr_32);
122static constexpr ArrayRef<const RegStorage> core_regs_64(core_regs_arr_64);
123static constexpr ArrayRef<const RegStorage> core_regs_64q(core_regs_arr_64q);
124static constexpr ArrayRef<const RegStorage> sp_regs_32(sp_regs_arr_32);
125static constexpr ArrayRef<const RegStorage> sp_regs_64(sp_regs_arr_64);
126static constexpr ArrayRef<const RegStorage> dp_regs_32(dp_regs_arr_32);
127static constexpr ArrayRef<const RegStorage> dp_regs_64(dp_regs_arr_64);
Serguei Katkovc3801912014-07-08 17:21:53 +0700128static constexpr ArrayRef<const RegStorage> xp_regs_32(xp_regs_arr_32);
129static constexpr ArrayRef<const RegStorage> xp_regs_64(xp_regs_arr_64);
Vladimir Marko089142c2014-06-05 10:57:05 +0100130static constexpr ArrayRef<const RegStorage> reserved_regs_32(reserved_regs_arr_32);
131static constexpr ArrayRef<const RegStorage> reserved_regs_64(reserved_regs_arr_64);
132static constexpr ArrayRef<const RegStorage> reserved_regs_64q(reserved_regs_arr_64q);
133static constexpr ArrayRef<const RegStorage> core_temps_32(core_temps_arr_32);
134static constexpr ArrayRef<const RegStorage> core_temps_64(core_temps_arr_64);
135static constexpr ArrayRef<const RegStorage> core_temps_64q(core_temps_arr_64q);
136static constexpr ArrayRef<const RegStorage> sp_temps_32(sp_temps_arr_32);
137static constexpr ArrayRef<const RegStorage> sp_temps_64(sp_temps_arr_64);
138static constexpr ArrayRef<const RegStorage> dp_temps_32(dp_temps_arr_32);
139static constexpr ArrayRef<const RegStorage> dp_temps_64(dp_temps_arr_64);
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700140
Vladimir Marko089142c2014-06-05 10:57:05 +0100141static constexpr ArrayRef<const RegStorage> xp_temps_32(xp_temps_arr_32);
142static constexpr ArrayRef<const RegStorage> xp_temps_64(xp_temps_arr_64);
Mark Mendellfe945782014-05-22 09:52:36 -0400143
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700144RegStorage rs_rX86_SP;
145
146X86NativeRegisterPool rX86_ARG0;
147X86NativeRegisterPool rX86_ARG1;
148X86NativeRegisterPool rX86_ARG2;
149X86NativeRegisterPool rX86_ARG3;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700150X86NativeRegisterPool rX86_ARG4;
151X86NativeRegisterPool rX86_ARG5;
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700152X86NativeRegisterPool rX86_FARG0;
153X86NativeRegisterPool rX86_FARG1;
154X86NativeRegisterPool rX86_FARG2;
155X86NativeRegisterPool rX86_FARG3;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700156X86NativeRegisterPool rX86_FARG4;
157X86NativeRegisterPool rX86_FARG5;
158X86NativeRegisterPool rX86_FARG6;
159X86NativeRegisterPool rX86_FARG7;
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700160X86NativeRegisterPool rX86_RET0;
161X86NativeRegisterPool rX86_RET1;
162X86NativeRegisterPool rX86_INVOKE_TGT;
163X86NativeRegisterPool rX86_COUNT;
164
165RegStorage rs_rX86_ARG0;
166RegStorage rs_rX86_ARG1;
167RegStorage rs_rX86_ARG2;
168RegStorage rs_rX86_ARG3;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700169RegStorage rs_rX86_ARG4;
170RegStorage rs_rX86_ARG5;
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700171RegStorage rs_rX86_FARG0;
172RegStorage rs_rX86_FARG1;
173RegStorage rs_rX86_FARG2;
174RegStorage rs_rX86_FARG3;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700175RegStorage rs_rX86_FARG4;
176RegStorage rs_rX86_FARG5;
177RegStorage rs_rX86_FARG6;
178RegStorage rs_rX86_FARG7;
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700179RegStorage rs_rX86_RET0;
180RegStorage rs_rX86_RET1;
181RegStorage rs_rX86_INVOKE_TGT;
182RegStorage rs_rX86_COUNT;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700183
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700184RegLocation X86Mir2Lir::LocCReturn() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000185 return x86_loc_c_return;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700186}
187
buzbeea0cd2d72014-06-01 09:33:49 -0700188RegLocation X86Mir2Lir::LocCReturnRef() {
Chao-ying Fua77ee512014-07-01 17:43:41 -0700189 return cu_->target64 ? x86_64_loc_c_return_ref : x86_loc_c_return_ref;
buzbeea0cd2d72014-06-01 09:33:49 -0700190}
191
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700192RegLocation X86Mir2Lir::LocCReturnWide() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700193 return cu_->target64 ? x86_64_loc_c_return_wide : x86_loc_c_return_wide;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700194}
195
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700196RegLocation X86Mir2Lir::LocCReturnFloat() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000197 return x86_loc_c_return_float;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700198}
199
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700200RegLocation X86Mir2Lir::LocCReturnDouble() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000201 return x86_loc_c_return_double;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700202}
203
Chao-ying Fua77ee512014-07-01 17:43:41 -0700204// Return a target-dependent special register for 32-bit.
205RegStorage X86Mir2Lir::TargetReg32(SpecialTargetRegister reg) {
buzbee091cc402014-03-31 10:14:40 -0700206 RegStorage res_reg = RegStorage::InvalidReg();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700207 switch (reg) {
buzbee091cc402014-03-31 10:14:40 -0700208 case kSelf: res_reg = RegStorage::InvalidReg(); break;
209 case kSuspend: res_reg = RegStorage::InvalidReg(); break;
210 case kLr: res_reg = RegStorage::InvalidReg(); break;
211 case kPc: res_reg = RegStorage::InvalidReg(); break;
Andreas Gampeccc60262014-07-04 18:02:38 -0700212 case kSp: res_reg = rs_rX86_SP_32; break; // This must be the concrete one, as _SP is target-
213 // specific size.
buzbee091cc402014-03-31 10:14:40 -0700214 case kArg0: res_reg = rs_rX86_ARG0; break;
215 case kArg1: res_reg = rs_rX86_ARG1; break;
216 case kArg2: res_reg = rs_rX86_ARG2; break;
217 case kArg3: res_reg = rs_rX86_ARG3; break;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700218 case kArg4: res_reg = rs_rX86_ARG4; break;
219 case kArg5: res_reg = rs_rX86_ARG5; break;
buzbee091cc402014-03-31 10:14:40 -0700220 case kFArg0: res_reg = rs_rX86_FARG0; break;
221 case kFArg1: res_reg = rs_rX86_FARG1; break;
222 case kFArg2: res_reg = rs_rX86_FARG2; break;
223 case kFArg3: res_reg = rs_rX86_FARG3; break;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700224 case kFArg4: res_reg = rs_rX86_FARG4; break;
225 case kFArg5: res_reg = rs_rX86_FARG5; break;
226 case kFArg6: res_reg = rs_rX86_FARG6; break;
227 case kFArg7: res_reg = rs_rX86_FARG7; break;
buzbee091cc402014-03-31 10:14:40 -0700228 case kRet0: res_reg = rs_rX86_RET0; break;
229 case kRet1: res_reg = rs_rX86_RET1; break;
230 case kInvokeTgt: res_reg = rs_rX86_INVOKE_TGT; break;
231 case kHiddenArg: res_reg = rs_rAX; break;
Elena Sayapinadd644502014-07-01 18:39:52 +0700232 case kHiddenFpArg: DCHECK(!cu_->target64); res_reg = rs_fr0; break;
buzbee091cc402014-03-31 10:14:40 -0700233 case kCount: res_reg = rs_rX86_COUNT; break;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700234 default: res_reg = RegStorage::InvalidReg();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700235 }
buzbee091cc402014-03-31 10:14:40 -0700236 return res_reg;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700237}
238
Chao-ying Fua77ee512014-07-01 17:43:41 -0700239RegStorage X86Mir2Lir::TargetReg(SpecialTargetRegister reg) {
240 LOG(FATAL) << "Do not use this function!!!";
241 return RegStorage::InvalidReg();
242}
243
Brian Carlstrom7940e442013-07-12 13:46:57 -0700244/*
245 * Decode the register id.
246 */
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100247ResourceMask X86Mir2Lir::GetRegMaskCommon(const RegStorage& reg) const {
248 /* Double registers in x86 are just a single FP register. This is always just a single bit. */
249 return ResourceMask::Bit(
250 /* FP register starts at bit position 16 */
251 ((reg.IsFloat() || reg.StorageSize() > 8) ? kX86FPReg0 : 0) + reg.GetRegNum());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700252}
253
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100254ResourceMask X86Mir2Lir::GetPCUseDefEncoding() const {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100255 return kEncodeNone;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700256}
257
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100258void X86Mir2Lir::SetupTargetResourceMasks(LIR* lir, uint64_t flags,
259 ResourceMask* use_mask, ResourceMask* def_mask) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700260 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
buzbeeb48819d2013-09-14 16:15:25 -0700261 DCHECK(!lir->flags.use_def_invalid);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700262
263 // X86-specific resource map setup here.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700264 if (flags & REG_USE_SP) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100265 use_mask->SetBit(kX86RegSP);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700266 }
267
268 if (flags & REG_DEF_SP) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100269 def_mask->SetBit(kX86RegSP);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700270 }
271
272 if (flags & REG_DEFA) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100273 SetupRegMask(def_mask, rs_rAX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700274 }
275
276 if (flags & REG_DEFD) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100277 SetupRegMask(def_mask, rs_rDX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700278 }
279 if (flags & REG_USEA) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100280 SetupRegMask(use_mask, rs_rAX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700281 }
282
283 if (flags & REG_USEC) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100284 SetupRegMask(use_mask, rs_rCX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700285 }
286
287 if (flags & REG_USED) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100288 SetupRegMask(use_mask, rs_rDX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700289 }
Vladimir Marko70b797d2013-12-03 15:25:24 +0000290
291 if (flags & REG_USEB) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100292 SetupRegMask(use_mask, rs_rBX.GetReg());
Vladimir Marko70b797d2013-12-03 15:25:24 +0000293 }
Mark Mendell4028a6c2014-02-19 20:06:20 -0800294
295 // Fixup hard to describe instruction: Uses rAX, rCX, rDI; sets rDI.
296 if (lir->opcode == kX86RepneScasw) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100297 SetupRegMask(use_mask, rs_rAX.GetReg());
298 SetupRegMask(use_mask, rs_rCX.GetReg());
299 SetupRegMask(use_mask, rs_rDI.GetReg());
300 SetupRegMask(def_mask, rs_rDI.GetReg());
Mark Mendell4028a6c2014-02-19 20:06:20 -0800301 }
Serguei Katkove90501d2014-03-12 15:56:54 +0700302
303 if (flags & USE_FP_STACK) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100304 use_mask->SetBit(kX86FPStack);
305 def_mask->SetBit(kX86FPStack);
Serguei Katkove90501d2014-03-12 15:56:54 +0700306 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700307}
308
309/* For dumping instructions */
310static const char* x86RegName[] = {
311 "rax", "rcx", "rdx", "rbx", "rsp", "rbp", "rsi", "rdi",
312 "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15"
313};
314
315static const char* x86CondName[] = {
316 "O",
317 "NO",
318 "B/NAE/C",
319 "NB/AE/NC",
320 "Z/EQ",
321 "NZ/NE",
322 "BE/NA",
323 "NBE/A",
324 "S",
325 "NS",
326 "P/PE",
327 "NP/PO",
328 "L/NGE",
329 "NL/GE",
330 "LE/NG",
331 "NLE/G"
332};
333
334/*
335 * Interpret a format string and build a string no longer than size
336 * See format key in Assemble.cc.
337 */
338std::string X86Mir2Lir::BuildInsnString(const char *fmt, LIR *lir, unsigned char* base_addr) {
339 std::string buf;
340 size_t i = 0;
341 size_t fmt_len = strlen(fmt);
342 while (i < fmt_len) {
343 if (fmt[i] != '!') {
344 buf += fmt[i];
345 i++;
346 } else {
347 i++;
348 DCHECK_LT(i, fmt_len);
349 char operand_number_ch = fmt[i];
350 i++;
351 if (operand_number_ch == '!') {
352 buf += "!";
353 } else {
354 int operand_number = operand_number_ch - '0';
355 DCHECK_LT(operand_number, 6); // Expect upto 6 LIR operands.
356 DCHECK_LT(i, fmt_len);
357 int operand = lir->operands[operand_number];
358 switch (fmt[i]) {
359 case 'c':
360 DCHECK_LT(static_cast<size_t>(operand), sizeof(x86CondName));
361 buf += x86CondName[operand];
362 break;
363 case 'd':
364 buf += StringPrintf("%d", operand);
365 break;
Yixin Shou5192cbb2014-07-01 13:48:17 -0400366 case 'q': {
367 int64_t value = static_cast<int64_t>(static_cast<int64_t>(operand) << 32 |
368 static_cast<uint32_t>(lir->operands[operand_number+1]));
369 buf +=StringPrintf("%" PRId64, value);
Haitao Fenge70f1792014-08-09 08:31:02 +0800370 break;
Yixin Shou5192cbb2014-07-01 13:48:17 -0400371 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700372 case 'p': {
buzbee0d829482013-10-11 15:24:55 -0700373 EmbeddedData *tab_rec = reinterpret_cast<EmbeddedData*>(UnwrapPointer(operand));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700374 buf += StringPrintf("0x%08x", tab_rec->offset);
375 break;
376 }
377 case 'r':
buzbee091cc402014-03-31 10:14:40 -0700378 if (RegStorage::IsFloat(operand)) {
379 int fp_reg = RegStorage::RegNum(operand);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700380 buf += StringPrintf("xmm%d", fp_reg);
381 } else {
buzbee091cc402014-03-31 10:14:40 -0700382 int reg_num = RegStorage::RegNum(operand);
383 DCHECK_LT(static_cast<size_t>(reg_num), sizeof(x86RegName));
384 buf += x86RegName[reg_num];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700385 }
386 break;
387 case 't':
Ian Rogers107c31e2014-01-23 20:55:29 -0800388 buf += StringPrintf("0x%08" PRIxPTR " (L%p)",
389 reinterpret_cast<uintptr_t>(base_addr) + lir->offset + operand,
390 lir->target);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700391 break;
392 default:
393 buf += StringPrintf("DecodeError '%c'", fmt[i]);
394 break;
395 }
396 i++;
397 }
398 }
399 }
400 return buf;
401}
402
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100403void X86Mir2Lir::DumpResourceMask(LIR *x86LIR, const ResourceMask& mask, const char *prefix) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700404 char buf[256];
405 buf[0] = 0;
406
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100407 if (mask.Equals(kEncodeAll)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700408 strcpy(buf, "all");
409 } else {
410 char num[8];
411 int i;
412
413 for (i = 0; i < kX86RegEnd; i++) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100414 if (mask.HasBit(i)) {
Ian Rogers988e6ea2014-01-08 11:30:50 -0800415 snprintf(num, arraysize(num), "%d ", i);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700416 strcat(buf, num);
417 }
418 }
419
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100420 if (mask.HasBit(ResourceMask::kCCode)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700421 strcat(buf, "cc ");
422 }
423 /* Memory bits */
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100424 if (x86LIR && (mask.HasBit(ResourceMask::kDalvikReg))) {
Ian Rogers988e6ea2014-01-08 11:30:50 -0800425 snprintf(buf + strlen(buf), arraysize(buf) - strlen(buf), "dr%d%s",
426 DECODE_ALIAS_INFO_REG(x86LIR->flags.alias_info),
427 (DECODE_ALIAS_INFO_WIDE(x86LIR->flags.alias_info)) ? "(+1)" : "");
Brian Carlstrom7940e442013-07-12 13:46:57 -0700428 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100429 if (mask.HasBit(ResourceMask::kLiteral)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700430 strcat(buf, "lit ");
431 }
432
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100433 if (mask.HasBit(ResourceMask::kHeapRef)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700434 strcat(buf, "heap ");
435 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100436 if (mask.HasBit(ResourceMask::kMustNotAlias)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700437 strcat(buf, "noalias ");
438 }
439 }
440 if (buf[0]) {
441 LOG(INFO) << prefix << ": " << buf;
442 }
443}
444
445void X86Mir2Lir::AdjustSpillMask() {
446 // Adjustment for LR spilling, x86 has no LR so nothing to do here
buzbee091cc402014-03-31 10:14:40 -0700447 core_spill_mask_ |= (1 << rs_rRET.GetRegNum());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700448 num_core_spills_++;
449}
450
Mark Mendelle87f9b52014-04-30 14:13:18 -0400451RegStorage X86Mir2Lir::AllocateByteRegister() {
Chao-ying Fu7e399fd2014-06-10 18:11:11 -0700452 RegStorage reg = AllocTypedTemp(false, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +0700453 if (!cu_->target64) {
Chao-ying Fu7e399fd2014-06-10 18:11:11 -0700454 DCHECK_LT(reg.GetRegNum(), rs_rX86_SP.GetRegNum());
455 }
456 return reg;
457}
458
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700459RegStorage X86Mir2Lir::Get128BitRegister(RegStorage reg) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -0700460 return GetRegInfo(reg)->Master()->GetReg();
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700461}
462
Chao-ying Fu7e399fd2014-06-10 18:11:11 -0700463bool X86Mir2Lir::IsByteRegister(RegStorage reg) {
Elena Sayapinadd644502014-07-01 18:39:52 +0700464 return cu_->target64 || reg.GetRegNum() < rs_rX86_SP.GetRegNum();
Mark Mendelle87f9b52014-04-30 14:13:18 -0400465}
466
Brian Carlstrom7940e442013-07-12 13:46:57 -0700467/* Clobber all regs that might be used by an external C call */
Vladimir Marko31c2aac2013-12-09 16:31:19 +0000468void X86Mir2Lir::ClobberCallerSave() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700469 if (cu_->target64) {
Serguei Katkovc3801912014-07-08 17:21:53 +0700470 Clobber(rs_rAX);
471 Clobber(rs_rCX);
472 Clobber(rs_rDX);
473 Clobber(rs_rSI);
474 Clobber(rs_rDI);
475
Chao-ying Fu35ec2b52014-06-16 16:40:31 -0700476 Clobber(rs_r8);
477 Clobber(rs_r9);
478 Clobber(rs_r10);
479 Clobber(rs_r11);
480
481 Clobber(rs_fr8);
482 Clobber(rs_fr9);
483 Clobber(rs_fr10);
484 Clobber(rs_fr11);
Serguei Katkovc3801912014-07-08 17:21:53 +0700485 } else {
486 Clobber(rs_rAX);
487 Clobber(rs_rCX);
488 Clobber(rs_rDX);
489 Clobber(rs_rBX);
Chao-ying Fu35ec2b52014-06-16 16:40:31 -0700490 }
Serguei Katkovc3801912014-07-08 17:21:53 +0700491
492 Clobber(rs_fr0);
493 Clobber(rs_fr1);
494 Clobber(rs_fr2);
495 Clobber(rs_fr3);
496 Clobber(rs_fr4);
497 Clobber(rs_fr5);
498 Clobber(rs_fr6);
499 Clobber(rs_fr7);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700500}
501
502RegLocation X86Mir2Lir::GetReturnWideAlt() {
503 RegLocation res = LocCReturnWide();
buzbee091cc402014-03-31 10:14:40 -0700504 DCHECK(res.reg.GetLowReg() == rs_rAX.GetReg());
505 DCHECK(res.reg.GetHighReg() == rs_rDX.GetReg());
506 Clobber(rs_rAX);
507 Clobber(rs_rDX);
508 MarkInUse(rs_rAX);
509 MarkInUse(rs_rDX);
510 MarkWide(res.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700511 return res;
512}
513
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700514RegLocation X86Mir2Lir::GetReturnAlt() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700515 RegLocation res = LocCReturn();
buzbee091cc402014-03-31 10:14:40 -0700516 res.reg.SetReg(rs_rDX.GetReg());
517 Clobber(rs_rDX);
518 MarkInUse(rs_rDX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700519 return res;
520}
521
Brian Carlstrom7940e442013-07-12 13:46:57 -0700522/* To be used when explicitly managing register use */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700523void X86Mir2Lir::LockCallTemps() {
buzbee091cc402014-03-31 10:14:40 -0700524 LockTemp(rs_rX86_ARG0);
525 LockTemp(rs_rX86_ARG1);
526 LockTemp(rs_rX86_ARG2);
527 LockTemp(rs_rX86_ARG3);
Elena Sayapinadd644502014-07-01 18:39:52 +0700528 if (cu_->target64) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700529 LockTemp(rs_rX86_ARG4);
530 LockTemp(rs_rX86_ARG5);
531 LockTemp(rs_rX86_FARG0);
532 LockTemp(rs_rX86_FARG1);
533 LockTemp(rs_rX86_FARG2);
534 LockTemp(rs_rX86_FARG3);
535 LockTemp(rs_rX86_FARG4);
536 LockTemp(rs_rX86_FARG5);
537 LockTemp(rs_rX86_FARG6);
538 LockTemp(rs_rX86_FARG7);
539 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700540}
541
542/* To be used when explicitly managing register use */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700543void X86Mir2Lir::FreeCallTemps() {
buzbee091cc402014-03-31 10:14:40 -0700544 FreeTemp(rs_rX86_ARG0);
545 FreeTemp(rs_rX86_ARG1);
546 FreeTemp(rs_rX86_ARG2);
547 FreeTemp(rs_rX86_ARG3);
Elena Sayapinadd644502014-07-01 18:39:52 +0700548 if (cu_->target64) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700549 FreeTemp(rs_rX86_ARG4);
550 FreeTemp(rs_rX86_ARG5);
551 FreeTemp(rs_rX86_FARG0);
552 FreeTemp(rs_rX86_FARG1);
553 FreeTemp(rs_rX86_FARG2);
554 FreeTemp(rs_rX86_FARG3);
555 FreeTemp(rs_rX86_FARG4);
556 FreeTemp(rs_rX86_FARG5);
557 FreeTemp(rs_rX86_FARG6);
558 FreeTemp(rs_rX86_FARG7);
559 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700560}
561
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800562bool X86Mir2Lir::ProvidesFullMemoryBarrier(X86OpCode opcode) {
563 switch (opcode) {
564 case kX86LockCmpxchgMR:
565 case kX86LockCmpxchgAR:
Ian Rogers0f9b9c52014-06-09 01:32:12 -0700566 case kX86LockCmpxchg64M:
567 case kX86LockCmpxchg64A:
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800568 case kX86XchgMR:
569 case kX86Mfence:
570 // Atomic memory instructions provide full barrier.
571 return true;
572 default:
573 break;
574 }
575
576 // Conservative if cannot prove it provides full barrier.
577 return false;
578}
579
Andreas Gampeb14329f2014-05-15 11:16:06 -0700580bool X86Mir2Lir::GenMemBarrier(MemBarrierKind barrier_kind) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700581#if ANDROID_SMP != 0
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800582 // Start off with using the last LIR as the barrier. If it is not enough, then we will update it.
583 LIR* mem_barrier = last_lir_insn_;
584
Andreas Gampeb14329f2014-05-15 11:16:06 -0700585 bool ret = false;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800586 /*
Hans Boehm48f5c472014-06-27 14:50:10 -0700587 * According to the JSR-133 Cookbook, for x86 only StoreLoad/AnyAny barriers need memory fence.
588 * All other barriers (LoadAny, AnyStore, StoreStore) are nops due to the x86 memory model.
589 * For those cases, all we need to ensure is that there is a scheduling barrier in place.
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800590 */
Hans Boehm48f5c472014-06-27 14:50:10 -0700591 if (barrier_kind == kAnyAny) {
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800592 // If no LIR exists already that can be used a barrier, then generate an mfence.
593 if (mem_barrier == nullptr) {
594 mem_barrier = NewLIR0(kX86Mfence);
Andreas Gampeb14329f2014-05-15 11:16:06 -0700595 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800596 }
597
598 // If last instruction does not provide full barrier, then insert an mfence.
599 if (ProvidesFullMemoryBarrier(static_cast<X86OpCode>(mem_barrier->opcode)) == false) {
600 mem_barrier = NewLIR0(kX86Mfence);
Andreas Gampeb14329f2014-05-15 11:16:06 -0700601 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800602 }
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -0700603 } else if (barrier_kind == kNTStoreStore) {
604 mem_barrier = NewLIR0(kX86Sfence);
605 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800606 }
607
608 // Now ensure that a scheduling barrier is in place.
609 if (mem_barrier == nullptr) {
610 GenBarrier();
611 } else {
612 // Mark as a scheduling barrier.
613 DCHECK(!mem_barrier->flags.use_def_invalid);
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100614 mem_barrier->u.m.def_mask = &kEncodeAll;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800615 }
Andreas Gampeb14329f2014-05-15 11:16:06 -0700616 return ret;
617#else
618 return false;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700619#endif
620}
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000621
Brian Carlstrom7940e442013-07-12 13:46:57 -0700622void X86Mir2Lir::CompilerInitializeRegAlloc() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700623 if (cu_->target64) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100624 reg_pool_.reset(new (arena_) RegisterPool(this, arena_, core_regs_64, core_regs_64q, sp_regs_64,
625 dp_regs_64, reserved_regs_64, reserved_regs_64q,
626 core_temps_64, core_temps_64q,
627 sp_temps_64, dp_temps_64));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700628 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100629 reg_pool_.reset(new (arena_) RegisterPool(this, arena_, core_regs_32, empty_pool, sp_regs_32,
630 dp_regs_32, reserved_regs_32, empty_pool,
631 core_temps_32, empty_pool,
632 sp_temps_32, dp_temps_32));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700633 }
buzbee091cc402014-03-31 10:14:40 -0700634
635 // Target-specific adjustments.
636
Mark Mendellfe945782014-05-22 09:52:36 -0400637 // Add in XMM registers.
Serguei Katkovc3801912014-07-08 17:21:53 +0700638 const ArrayRef<const RegStorage> *xp_regs = cu_->target64 ? &xp_regs_64 : &xp_regs_32;
639 for (RegStorage reg : *xp_regs) {
Mark Mendellfe945782014-05-22 09:52:36 -0400640 RegisterInfo* info = new (arena_) RegisterInfo(reg, GetRegMaskCommon(reg));
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100641 reginfo_map_[reg.GetReg()] = info;
Serguei Katkovc3801912014-07-08 17:21:53 +0700642 }
643 const ArrayRef<const RegStorage> *xp_temps = cu_->target64 ? &xp_temps_64 : &xp_temps_32;
644 for (RegStorage reg : *xp_temps) {
645 RegisterInfo* xp_reg_info = GetRegInfo(reg);
646 xp_reg_info->SetIsTemp(true);
Mark Mendellfe945782014-05-22 09:52:36 -0400647 }
648
buzbee091cc402014-03-31 10:14:40 -0700649 // Alias single precision xmm to double xmms.
650 // TODO: as needed, add larger vector sizes - alias all to the largest.
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100651 for (RegisterInfo* info : reg_pool_->sp_regs_) {
buzbee091cc402014-03-31 10:14:40 -0700652 int sp_reg_num = info->GetReg().GetRegNum();
Mark Mendellfe945782014-05-22 09:52:36 -0400653 RegStorage xp_reg = RegStorage::Solo128(sp_reg_num);
654 RegisterInfo* xp_reg_info = GetRegInfo(xp_reg);
655 // 128-bit xmm vector register's master storage should refer to itself.
656 DCHECK_EQ(xp_reg_info, xp_reg_info->Master());
657
658 // Redirect 32-bit vector's master storage to 128-bit vector.
659 info->SetMaster(xp_reg_info);
660
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700661 RegStorage dp_reg = RegStorage::FloatSolo64(sp_reg_num);
buzbee091cc402014-03-31 10:14:40 -0700662 RegisterInfo* dp_reg_info = GetRegInfo(dp_reg);
Mark Mendellfe945782014-05-22 09:52:36 -0400663 // Redirect 64-bit vector's master storage to 128-bit vector.
664 dp_reg_info->SetMaster(xp_reg_info);
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700665 // Singles should show a single 32-bit mask bit, at first referring to the low half.
666 DCHECK_EQ(info->StorageMask(), 0x1U);
667 }
668
Elena Sayapinadd644502014-07-01 18:39:52 +0700669 if (cu_->target64) {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700670 // Alias 32bit W registers to corresponding 64bit X registers.
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100671 for (RegisterInfo* info : reg_pool_->core_regs_) {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700672 int x_reg_num = info->GetReg().GetRegNum();
673 RegStorage x_reg = RegStorage::Solo64(x_reg_num);
674 RegisterInfo* x_reg_info = GetRegInfo(x_reg);
675 // 64bit X register's master storage should refer to itself.
676 DCHECK_EQ(x_reg_info, x_reg_info->Master());
677 // Redirect 32bit W master storage to 64bit X.
678 info->SetMaster(x_reg_info);
679 // 32bit W should show a single 32-bit mask bit, at first referring to the low half.
680 DCHECK_EQ(info->StorageMask(), 0x1U);
681 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700682 }
buzbee091cc402014-03-31 10:14:40 -0700683
684 // Don't start allocating temps at r0/s0/d0 or you may clobber return regs in early-exit methods.
685 // TODO: adjust for x86/hard float calling convention.
686 reg_pool_->next_core_reg_ = 2;
687 reg_pool_->next_sp_reg_ = 2;
688 reg_pool_->next_dp_reg_ = 1;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700689}
690
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700691int X86Mir2Lir::VectorRegisterSize() {
692 return 128;
693}
694
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -0700695int X86Mir2Lir::NumReservableVectorRegisters(bool long_or_fp) {
696 int num_vector_temps = cu_->target64 ? xp_temps_64.size() : xp_temps_32.size();
697
698 // Leave a few temps for use by backend as scratch.
699 return long_or_fp ? num_vector_temps - 2 : num_vector_temps - 1;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700700}
701
Brian Carlstrom7940e442013-07-12 13:46:57 -0700702void X86Mir2Lir::SpillCoreRegs() {
703 if (num_core_spills_ == 0) {
704 return;
705 }
706 // Spill mask not including fake return address register
buzbee091cc402014-03-31 10:14:40 -0700707 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700708 int offset = frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
Serguei Katkovc3801912014-07-08 17:21:53 +0700709 OpSize size = cu_->target64 ? k64 : k32;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700710 for (int reg = 0; mask; mask >>= 1, reg++) {
711 if (mask & 0x1) {
Serguei Katkovc3801912014-07-08 17:21:53 +0700712 StoreBaseDisp(rs_rX86_SP, offset, cu_->target64 ? RegStorage::Solo64(reg) : RegStorage::Solo32(reg),
713 size, kNotVolatile);
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700714 offset += GetInstructionSetPointerSize(cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700715 }
716 }
717}
718
719void X86Mir2Lir::UnSpillCoreRegs() {
720 if (num_core_spills_ == 0) {
721 return;
722 }
723 // Spill mask not including fake return address register
buzbee091cc402014-03-31 10:14:40 -0700724 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700725 int offset = frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
Serguei Katkovc3801912014-07-08 17:21:53 +0700726 OpSize size = cu_->target64 ? k64 : k32;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700727 for (int reg = 0; mask; mask >>= 1, reg++) {
728 if (mask & 0x1) {
Serguei Katkovc3801912014-07-08 17:21:53 +0700729 LoadBaseDisp(rs_rX86_SP, offset, cu_->target64 ? RegStorage::Solo64(reg) : RegStorage::Solo32(reg),
730 size, kNotVolatile);
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700731 offset += GetInstructionSetPointerSize(cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700732 }
733 }
734}
735
Serguei Katkovc3801912014-07-08 17:21:53 +0700736void X86Mir2Lir::SpillFPRegs() {
737 if (num_fp_spills_ == 0) {
738 return;
739 }
740 uint32_t mask = fp_spill_mask_;
741 int offset = frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * (num_fp_spills_ + num_core_spills_));
742 for (int reg = 0; mask; mask >>= 1, reg++) {
743 if (mask & 0x1) {
744 StoreBaseDisp(rs_rX86_SP, offset, RegStorage::FloatSolo64(reg),
745 k64, kNotVolatile);
746 offset += sizeof(double);
747 }
748 }
749}
750void X86Mir2Lir::UnSpillFPRegs() {
751 if (num_fp_spills_ == 0) {
752 return;
753 }
754 uint32_t mask = fp_spill_mask_;
755 int offset = frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * (num_fp_spills_ + num_core_spills_));
756 for (int reg = 0; mask; mask >>= 1, reg++) {
757 if (mask & 0x1) {
758 LoadBaseDisp(rs_rX86_SP, offset, RegStorage::FloatSolo64(reg),
759 k64, kNotVolatile);
760 offset += sizeof(double);
761 }
762 }
763}
764
765
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700766bool X86Mir2Lir::IsUnconditionalBranch(LIR* lir) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700767 return (lir->opcode == kX86Jmp8 || lir->opcode == kX86Jmp32);
768}
769
Vladimir Marko674744e2014-04-24 15:18:26 +0100770RegisterClass X86Mir2Lir::RegClassForFieldLoadStore(OpSize size, bool is_volatile) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700771 // X86_64 can handle any size.
Elena Sayapinadd644502014-07-01 18:39:52 +0700772 if (cu_->target64) {
Chao-ying Fu06839f82014-08-14 15:59:17 -0700773 return RegClassBySize(size);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700774 }
775
Vladimir Marko674744e2014-04-24 15:18:26 +0100776 if (UNLIKELY(is_volatile)) {
777 // On x86, atomic 64-bit load/store requires an fp register.
778 // Smaller aligned load/store is atomic for both core and fp registers.
779 if (size == k64 || size == kDouble) {
780 return kFPReg;
781 }
782 }
783 return RegClassBySize(size);
784}
785
Elena Sayapinadd644502014-07-01 18:39:52 +0700786X86Mir2Lir::X86Mir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena)
Mark Mendell55d0eac2014-02-06 11:02:52 -0800787 : Mir2Lir(cu, mir_graph, arena),
Ian Rogersdd7624d2014-03-14 17:43:00 -0700788 base_of_code_(nullptr), store_method_addr_(false), store_method_addr_used_(false),
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100789 method_address_insns_(arena->Adapter()),
790 class_type_address_insns_(arena->Adapter()),
791 call_method_insns_(arena->Adapter()),
Elena Sayapinadd644502014-07-01 18:39:52 +0700792 stack_decrement_(nullptr), stack_increment_(nullptr),
Mark Mendelld65c51a2014-04-29 16:55:20 -0400793 const_vectors_(nullptr) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100794 method_address_insns_.reserve(100);
795 class_type_address_insns_.reserve(100);
796 call_method_insns_.reserve(100);
Mark Mendelld65c51a2014-04-29 16:55:20 -0400797 store_method_addr_used_ = false;
Ian Rogersdd7624d2014-03-14 17:43:00 -0700798 if (kIsDebugBuild) {
799 for (int i = 0; i < kX86Last; i++) {
800 if (X86Mir2Lir::EncodingMap[i].opcode != i) {
801 LOG(FATAL) << "Encoding order for " << X86Mir2Lir::EncodingMap[i].name
Mark Mendelld65c51a2014-04-29 16:55:20 -0400802 << " is wrong: expecting " << i << ", seeing "
803 << static_cast<int>(X86Mir2Lir::EncodingMap[i].opcode);
Ian Rogersdd7624d2014-03-14 17:43:00 -0700804 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700805 }
806 }
Elena Sayapinadd644502014-07-01 18:39:52 +0700807 if (cu_->target64) {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700808 rs_rX86_SP = rs_rX86_SP_64;
809
810 rs_rX86_ARG0 = rs_rDI;
811 rs_rX86_ARG1 = rs_rSI;
812 rs_rX86_ARG2 = rs_rDX;
813 rs_rX86_ARG3 = rs_rCX;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700814 rs_rX86_ARG4 = rs_r8;
815 rs_rX86_ARG5 = rs_r9;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700816 rs_rX86_FARG0 = rs_fr0;
817 rs_rX86_FARG1 = rs_fr1;
818 rs_rX86_FARG2 = rs_fr2;
819 rs_rX86_FARG3 = rs_fr3;
820 rs_rX86_FARG4 = rs_fr4;
821 rs_rX86_FARG5 = rs_fr5;
822 rs_rX86_FARG6 = rs_fr6;
823 rs_rX86_FARG7 = rs_fr7;
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700824 rX86_ARG0 = rDI;
825 rX86_ARG1 = rSI;
826 rX86_ARG2 = rDX;
827 rX86_ARG3 = rCX;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700828 rX86_ARG4 = r8;
829 rX86_ARG5 = r9;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700830 rX86_FARG0 = fr0;
831 rX86_FARG1 = fr1;
832 rX86_FARG2 = fr2;
833 rX86_FARG3 = fr3;
834 rX86_FARG4 = fr4;
835 rX86_FARG5 = fr5;
836 rX86_FARG6 = fr6;
837 rX86_FARG7 = fr7;
Mark Mendell55884bc2014-06-10 10:21:29 -0400838 rs_rX86_INVOKE_TGT = rs_rDI;
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700839 } else {
840 rs_rX86_SP = rs_rX86_SP_32;
841
842 rs_rX86_ARG0 = rs_rAX;
843 rs_rX86_ARG1 = rs_rCX;
844 rs_rX86_ARG2 = rs_rDX;
845 rs_rX86_ARG3 = rs_rBX;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700846 rs_rX86_ARG4 = RegStorage::InvalidReg();
847 rs_rX86_ARG5 = RegStorage::InvalidReg();
848 rs_rX86_FARG0 = rs_rAX;
849 rs_rX86_FARG1 = rs_rCX;
850 rs_rX86_FARG2 = rs_rDX;
851 rs_rX86_FARG3 = rs_rBX;
852 rs_rX86_FARG4 = RegStorage::InvalidReg();
853 rs_rX86_FARG5 = RegStorage::InvalidReg();
854 rs_rX86_FARG6 = RegStorage::InvalidReg();
855 rs_rX86_FARG7 = RegStorage::InvalidReg();
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700856 rX86_ARG0 = rAX;
857 rX86_ARG1 = rCX;
858 rX86_ARG2 = rDX;
859 rX86_ARG3 = rBX;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700860 rX86_FARG0 = rAX;
861 rX86_FARG1 = rCX;
862 rX86_FARG2 = rDX;
863 rX86_FARG3 = rBX;
Mark Mendell55884bc2014-06-10 10:21:29 -0400864 rs_rX86_INVOKE_TGT = rs_rAX;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700865 // TODO(64): Initialize with invalid reg
866// rX86_ARG4 = RegStorage::InvalidReg();
867// rX86_ARG5 = RegStorage::InvalidReg();
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700868 }
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700869 rs_rX86_RET0 = rs_rAX;
870 rs_rX86_RET1 = rs_rDX;
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700871 rs_rX86_COUNT = rs_rCX;
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700872 rX86_RET0 = rAX;
873 rX86_RET1 = rDX;
874 rX86_INVOKE_TGT = rAX;
875 rX86_COUNT = rCX;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700876}
877
878Mir2Lir* X86CodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
879 ArenaAllocator* const arena) {
Elena Sayapinadd644502014-07-01 18:39:52 +0700880 return new X86Mir2Lir(cu, mir_graph, arena);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700881}
882
Andreas Gampe98430592014-07-27 19:44:50 -0700883// Not used in x86(-64)
884RegStorage X86Mir2Lir::LoadHelper(QuickEntrypointEnum trampoline) {
Andreas Gampe2f244e92014-05-08 03:35:25 -0700885 LOG(FATAL) << "Unexpected use of LoadHelper in x86";
886 return RegStorage::InvalidReg();
887}
888
Dave Allisonb373e092014-02-20 16:06:36 -0800889LIR* X86Mir2Lir::CheckSuspendUsingLoad() {
Dave Allison69dfe512014-07-11 17:11:58 +0000890 // First load the pointer in fs:[suspend-trigger] into eax
891 // Then use a test instruction to indirect via that address.
Dave Allisondfd3b472014-07-16 16:04:32 -0700892 if (cu_->target64) {
893 NewLIR2(kX86Mov64RT, rs_rAX.GetReg(),
894 Thread::ThreadSuspendTriggerOffset<8>().Int32Value());
895 } else {
896 NewLIR2(kX86Mov32RT, rs_rAX.GetReg(),
897 Thread::ThreadSuspendTriggerOffset<4>().Int32Value());
898 }
Dave Allison69dfe512014-07-11 17:11:58 +0000899 return NewLIR3(kX86Test32RM, rs_rAX.GetReg(), rs_rAX.GetReg(), 0);
Dave Allisonb373e092014-02-20 16:06:36 -0800900}
901
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700902uint64_t X86Mir2Lir::GetTargetInstFlags(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700903 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700904 return X86Mir2Lir::EncodingMap[opcode].flags;
905}
906
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700907const char* X86Mir2Lir::GetTargetInstName(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700908 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700909 return X86Mir2Lir::EncodingMap[opcode].name;
910}
911
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700912const char* X86Mir2Lir::GetTargetInstFmt(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700913 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700914 return X86Mir2Lir::EncodingMap[opcode].fmt;
915}
916
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000917void X86Mir2Lir::GenConstWide(RegLocation rl_dest, int64_t value) {
918 // Can we do this directly to memory?
919 rl_dest = UpdateLocWide(rl_dest);
920 if ((rl_dest.location == kLocDalvikFrame) ||
921 (rl_dest.location == kLocCompilerTemp)) {
922 int32_t val_lo = Low32Bits(value);
923 int32_t val_hi = High32Bits(value);
Chao-ying Fua77ee512014-07-01 17:43:41 -0700924 int r_base = rs_rX86_SP.GetReg();
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000925 int displacement = SRegOffset(rl_dest.s_reg_low);
926
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100927 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
buzbee2700f7e2014-03-07 09:46:20 -0800928 LIR * store = NewLIR3(kX86Mov32MI, r_base, displacement + LOWORD_OFFSET, val_lo);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000929 AnnotateDalvikRegAccess(store, (displacement + LOWORD_OFFSET) >> 2,
930 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -0800931 store = NewLIR3(kX86Mov32MI, r_base, displacement + HIWORD_OFFSET, val_hi);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000932 AnnotateDalvikRegAccess(store, (displacement + HIWORD_OFFSET) >> 2,
933 false /* is_load */, true /* is64bit */);
934 return;
935 }
936
937 // Just use the standard code to do the generation.
938 Mir2Lir::GenConstWide(rl_dest, value);
939}
Mark Mendelle02d48f2014-01-15 11:19:23 -0800940
941// TODO: Merge with existing RegLocation dumper in vreg_analysis.cc
942void X86Mir2Lir::DumpRegLocation(RegLocation loc) {
943 LOG(INFO) << "location: " << loc.location << ','
944 << (loc.wide ? " w" : " ")
945 << (loc.defined ? " D" : " ")
946 << (loc.is_const ? " c" : " ")
947 << (loc.fp ? " F" : " ")
948 << (loc.core ? " C" : " ")
949 << (loc.ref ? " r" : " ")
950 << (loc.high_word ? " h" : " ")
951 << (loc.home ? " H" : " ")
buzbee2700f7e2014-03-07 09:46:20 -0800952 << ", low: " << static_cast<int>(loc.reg.GetLowReg())
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000953 << ", high: " << static_cast<int>(loc.reg.GetHighReg())
Mark Mendelle02d48f2014-01-15 11:19:23 -0800954 << ", s_reg: " << loc.s_reg_low
955 << ", orig: " << loc.orig_sreg;
956}
957
Mark Mendell67c39c42014-01-31 17:28:00 -0800958void X86Mir2Lir::Materialize() {
959 // A good place to put the analysis before starting.
960 AnalyzeMIR();
961
962 // Now continue with regular code generation.
963 Mir2Lir::Materialize();
964}
965
Jeff Hao49161ce2014-03-12 11:05:25 -0700966void X86Mir2Lir::LoadMethodAddress(const MethodReference& target_method, InvokeType type,
Mark Mendell55d0eac2014-02-06 11:02:52 -0800967 SpecialTargetRegister symbolic_reg) {
968 /*
969 * For x86, just generate a 32 bit move immediate instruction, that will be filled
970 * in at 'link time'. For now, put a unique value based on target to ensure that
971 * code deduplication works.
972 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700973 int target_method_idx = target_method.dex_method_index;
974 const DexFile* target_dex_file = target_method.dex_file;
975 const DexFile::MethodId& target_method_id = target_dex_file->GetMethodId(target_method_idx);
976 uintptr_t target_method_id_ptr = reinterpret_cast<uintptr_t>(&target_method_id);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800977
Jeff Hao49161ce2014-03-12 11:05:25 -0700978 // Generate the move instruction with the unique pointer and save index, dex_file, and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700979 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
980 TargetReg(symbolic_reg, kNotWide).GetReg(),
Jeff Hao49161ce2014-03-12 11:05:25 -0700981 static_cast<int>(target_method_id_ptr), target_method_idx,
982 WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800983 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100984 method_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800985}
986
Fred Shihe7f82e22014-08-06 10:46:37 -0700987void X86Mir2Lir::LoadClassType(const DexFile& dex_file, uint32_t type_idx,
988 SpecialTargetRegister symbolic_reg) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800989 /*
990 * For x86, just generate a 32 bit move immediate instruction, that will be filled
991 * in at 'link time'. For now, put a unique value based on target to ensure that
992 * code deduplication works.
993 */
Fred Shihe7f82e22014-08-06 10:46:37 -0700994 const DexFile::TypeId& id = dex_file.GetTypeId(type_idx);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800995 uintptr_t ptr = reinterpret_cast<uintptr_t>(&id);
996
997 // Generate the move instruction with the unique pointer and save index and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700998 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
999 TargetReg(symbolic_reg, kNotWide).GetReg(),
Fred Shihe7f82e22014-08-06 10:46:37 -07001000 static_cast<int>(ptr), type_idx,
1001 WrapPointer(const_cast<DexFile*>(&dex_file)));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001002 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001003 class_type_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001004}
1005
Vladimir Markof4da6752014-08-01 19:04:18 +01001006LIR* X86Mir2Lir::CallWithLinkerFixup(const MethodReference& target_method, InvokeType type) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001007 /*
1008 * For x86, just generate a 32 bit call relative instruction, that will be filled
Vladimir Markof4da6752014-08-01 19:04:18 +01001009 * in at 'link time'.
Mark Mendell55d0eac2014-02-06 11:02:52 -08001010 */
Jeff Hao49161ce2014-03-12 11:05:25 -07001011 int target_method_idx = target_method.dex_method_index;
1012 const DexFile* target_dex_file = target_method.dex_file;
Mark Mendell55d0eac2014-02-06 11:02:52 -08001013
Jeff Hao49161ce2014-03-12 11:05:25 -07001014 // Generate the call instruction with the unique pointer and save index, dex_file, and type.
Vladimir Markof4da6752014-08-01 19:04:18 +01001015 // NOTE: Method deduplication takes linker patches into account, so we can just pass 0
1016 // as a placeholder for the offset.
1017 LIR* call = RawLIR(current_dalvik_offset_, kX86CallI, 0,
Jeff Hao49161ce2014-03-12 11:05:25 -07001018 target_method_idx, WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001019 AppendLIR(call);
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001020 call_method_insns_.push_back(call);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001021 return call;
1022}
1023
Vladimir Markof4da6752014-08-01 19:04:18 +01001024static LIR* GenInvokeNoInlineCall(Mir2Lir* mir_to_lir, InvokeType type) {
1025 QuickEntrypointEnum trampoline;
1026 switch (type) {
1027 case kInterface:
1028 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
1029 break;
1030 case kDirect:
1031 trampoline = kQuickInvokeDirectTrampolineWithAccessCheck;
1032 break;
1033 case kStatic:
1034 trampoline = kQuickInvokeStaticTrampolineWithAccessCheck;
1035 break;
1036 case kSuper:
1037 trampoline = kQuickInvokeSuperTrampolineWithAccessCheck;
1038 break;
1039 case kVirtual:
1040 trampoline = kQuickInvokeVirtualTrampolineWithAccessCheck;
1041 break;
1042 default:
1043 LOG(FATAL) << "Unexpected invoke type";
1044 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
1045 }
1046 return mir_to_lir->InvokeTrampoline(kOpBlx, RegStorage::InvalidReg(), trampoline);
1047}
1048
1049LIR* X86Mir2Lir::GenCallInsn(const MirMethodLoweringInfo& method_info) {
1050 LIR* call_insn;
1051 if (method_info.FastPath()) {
1052 if (method_info.DirectCode() == static_cast<uintptr_t>(-1)) {
1053 // We can have the linker fixup a call relative.
1054 call_insn = CallWithLinkerFixup(method_info.GetTargetMethod(), method_info.GetSharpType());
1055 } else {
1056 call_insn = OpMem(kOpBlx, TargetReg(kArg0, kRef),
1057 mirror::ArtMethod::EntryPointFromQuickCompiledCodeOffset().Int32Value());
1058 }
1059 } else {
1060 call_insn = GenInvokeNoInlineCall(this, method_info.GetSharpType());
1061 }
1062 return call_insn;
1063}
1064
Mark Mendell55d0eac2014-02-06 11:02:52 -08001065void X86Mir2Lir::InstallLiteralPools() {
1066 // These are handled differently for x86.
1067 DCHECK(code_literal_list_ == nullptr);
1068 DCHECK(method_literal_list_ == nullptr);
1069 DCHECK(class_literal_list_ == nullptr);
1070
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001071
Mark Mendelld65c51a2014-04-29 16:55:20 -04001072 if (const_vectors_ != nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001073 // Vector literals must be 16-byte aligned. The header that is placed
1074 // in the code section causes misalignment so we take it into account.
1075 // Otherwise, we are sure that for x86 method is aligned to 16.
1076 DCHECK_EQ(GetInstructionSetAlignment(cu_->instruction_set), 16u);
1077 uint32_t bytes_to_fill = (0x10 - ((code_buffer_.size() + sizeof(OatQuickMethodHeader)) & 0xF)) & 0xF;
1078 while (bytes_to_fill > 0) {
1079 code_buffer_.push_back(0);
1080 bytes_to_fill--;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001081 }
1082
Mark Mendelld65c51a2014-04-29 16:55:20 -04001083 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Tong Shen547cdfd2014-08-05 01:54:19 -07001084 PushWord(&code_buffer_, p->operands[0]);
1085 PushWord(&code_buffer_, p->operands[1]);
1086 PushWord(&code_buffer_, p->operands[2]);
1087 PushWord(&code_buffer_, p->operands[3]);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001088 }
1089 }
1090
Mark Mendell55d0eac2014-02-06 11:02:52 -08001091 // Handle the fixups for methods.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001092 for (LIR* p : method_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001093 DCHECK_EQ(p->opcode, kX86Mov32RI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001094 uint32_t target_method_idx = p->operands[2];
1095 const DexFile* target_dex_file =
1096 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[3]));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001097
1098 // The offset to patch is the last 4 bytes of the instruction.
1099 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001100 patches_.push_back(LinkerPatch::MethodPatch(patch_offset,
1101 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001102 }
1103
1104 // Handle the fixups for class types.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001105 for (LIR* p : class_type_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001106 DCHECK_EQ(p->opcode, kX86Mov32RI);
Fred Shihe7f82e22014-08-06 10:46:37 -07001107
1108 const DexFile* class_dex_file =
1109 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[3]));
Vladimir Markof4da6752014-08-01 19:04:18 +01001110 uint32_t target_type_idx = p->operands[2];
Mark Mendell55d0eac2014-02-06 11:02:52 -08001111
1112 // The offset to patch is the last 4 bytes of the instruction.
1113 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001114 patches_.push_back(LinkerPatch::TypePatch(patch_offset,
1115 class_dex_file, target_type_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001116 }
1117
1118 // And now the PC-relative calls to methods.
Vladimir Markof4da6752014-08-01 19:04:18 +01001119 patches_.reserve(call_method_insns_.size());
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001120 for (LIR* p : call_method_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001121 DCHECK_EQ(p->opcode, kX86CallI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001122 uint32_t target_method_idx = p->operands[1];
1123 const DexFile* target_dex_file =
1124 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[2]));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001125
1126 // The offset to patch is the last 4 bytes of the instruction.
1127 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001128 patches_.push_back(LinkerPatch::RelativeCodePatch(patch_offset,
1129 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001130 }
1131
1132 // And do the normal processing.
1133 Mir2Lir::InstallLiteralPools();
1134}
1135
DaniilSokolov70c4f062014-06-24 17:34:00 -07001136bool X86Mir2Lir::GenInlinedArrayCopyCharArray(CallInfo* info) {
DaniilSokolov70c4f062014-06-24 17:34:00 -07001137 RegLocation rl_src = info->args[0];
1138 RegLocation rl_srcPos = info->args[1];
1139 RegLocation rl_dst = info->args[2];
1140 RegLocation rl_dstPos = info->args[3];
1141 RegLocation rl_length = info->args[4];
1142 if (rl_srcPos.is_const && (mir_graph_->ConstantValue(rl_srcPos) < 0)) {
1143 return false;
1144 }
1145 if (rl_dstPos.is_const && (mir_graph_->ConstantValue(rl_dstPos) < 0)) {
1146 return false;
1147 }
1148 ClobberCallerSave();
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001149 LockCallTemps(); // Using fixed registers.
1150 RegStorage tmp_reg = cu_->target64 ? rs_r11 : rs_rBX;
1151 LoadValueDirectFixed(rl_src, rs_rAX);
1152 LoadValueDirectFixed(rl_dst, rs_rCX);
1153 LIR* src_dst_same = OpCmpBranch(kCondEq, rs_rAX, rs_rCX, nullptr);
1154 LIR* src_null_branch = OpCmpImmBranch(kCondEq, rs_rAX, 0, nullptr);
1155 LIR* dst_null_branch = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1156 LoadValueDirectFixed(rl_length, rs_rDX);
1157 // If the length of the copy is > 128 characters (256 bytes) or negative then go slow path.
1158 LIR* len_too_big = OpCmpImmBranch(kCondHi, rs_rDX, 128, nullptr);
1159 LoadValueDirectFixed(rl_src, rs_rAX);
1160 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001161 LIR* src_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001162 LIR* src_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001163 LIR* srcPos_negative = nullptr;
1164 if (!rl_srcPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001165 LoadValueDirectFixed(rl_srcPos, tmp_reg);
1166 srcPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001167 // src_pos < src_len
1168 src_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1169 // src_len - src_pos < copy_len
1170 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1171 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001172 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001173 int32_t pos_val = mir_graph_->ConstantValue(rl_srcPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001174 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001175 src_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001176 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001177 // src_pos < src_len
1178 src_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1179 // src_len - src_pos < copy_len
1180 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1181 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001182 }
1183 }
1184 LIR* dstPos_negative = nullptr;
1185 LIR* dst_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001186 LIR* dst_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001187 LoadValueDirectFixed(rl_dst, rs_rAX);
1188 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
1189 if (!rl_dstPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001190 LoadValueDirectFixed(rl_dstPos, tmp_reg);
1191 dstPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001192 // dst_pos < dst_len
1193 dst_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1194 // dst_len - dst_pos < copy_len
1195 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1196 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001197 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001198 int32_t pos_val = mir_graph_->ConstantValue(rl_dstPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001199 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001200 dst_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001201 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001202 // dst_pos < dst_len
1203 dst_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1204 // dst_len - dst_pos < copy_len
1205 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1206 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001207 }
1208 }
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001209 // Everything is checked now.
1210 LoadValueDirectFixed(rl_src, rs_rAX);
1211 LoadValueDirectFixed(rl_dst, tmp_reg);
1212 LoadValueDirectFixed(rl_srcPos, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001213 NewLIR5(kX86Lea32RA, rs_rAX.GetReg(), rs_rAX.GetReg(),
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001214 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value());
1215 // RAX now holds the address of the first src element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001216
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001217 LoadValueDirectFixed(rl_dstPos, rs_rCX);
1218 NewLIR5(kX86Lea32RA, tmp_reg.GetReg(), tmp_reg.GetReg(),
1219 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value() );
1220 // RBX now holds the address of the first dst element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001221
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001222 // Check if the number of elements to be copied is odd or even. If odd
DaniilSokolov70c4f062014-06-24 17:34:00 -07001223 // then copy the first element (so that the remaining number of elements
1224 // is even).
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001225 LoadValueDirectFixed(rl_length, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001226 OpRegImm(kOpAnd, rs_rCX, 1);
1227 LIR* jmp_to_begin_loop = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1228 OpRegImm(kOpSub, rs_rDX, 1);
1229 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001230 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001231
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001232 // Since the remaining number of elements is even, we will copy by
DaniilSokolov70c4f062014-06-24 17:34:00 -07001233 // two elements at a time.
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001234 LIR* beginLoop = NewLIR0(kPseudoTargetLabel);
1235 LIR* jmp_to_ret = OpCmpImmBranch(kCondEq, rs_rDX, 0, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001236 OpRegImm(kOpSub, rs_rDX, 2);
1237 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001238 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001239 OpUnconditionalBranch(beginLoop);
1240 LIR *check_failed = NewLIR0(kPseudoTargetLabel);
1241 LIR* launchpad_branch = OpUnconditionalBranch(nullptr);
1242 LIR *return_point = NewLIR0(kPseudoTargetLabel);
1243 jmp_to_ret->target = return_point;
1244 jmp_to_begin_loop->target = beginLoop;
1245 src_dst_same->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001246 len_too_big->target = check_failed;
1247 src_null_branch->target = check_failed;
1248 if (srcPos_negative != nullptr)
1249 srcPos_negative ->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001250 if (src_bad_off != nullptr)
1251 src_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001252 if (src_bad_len != nullptr)
1253 src_bad_len->target = check_failed;
1254 dst_null_branch->target = check_failed;
1255 if (dstPos_negative != nullptr)
1256 dstPos_negative->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001257 if (dst_bad_off != nullptr)
1258 dst_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001259 if (dst_bad_len != nullptr)
1260 dst_bad_len->target = check_failed;
1261 AddIntrinsicSlowPath(info, launchpad_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001262 ClobberCallerSave(); // We must clobber everything because slow path will return here
DaniilSokolov70c4f062014-06-24 17:34:00 -07001263 return true;
1264}
1265
1266
Mark Mendell4028a6c2014-02-19 20:06:20 -08001267/*
1268 * Fast string.index_of(I) & (II). Inline check for simple case of char <= 0xffff,
1269 * otherwise bails to standard library code.
1270 */
1271bool X86Mir2Lir::GenInlinedIndexOf(CallInfo* info, bool zero_based) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001272 RegLocation rl_obj = info->args[0];
1273 RegLocation rl_char = info->args[1];
buzbeea44d4f52014-03-05 11:26:39 -08001274 RegLocation rl_start; // Note: only present in III flavor or IndexOf.
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001275 // RBX is promotable in 64-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001276 RegStorage rs_tmp = cu_->target64 ? rs_r11 : rs_rBX;
1277 int start_value = -1;
Mark Mendell4028a6c2014-02-19 20:06:20 -08001278
1279 uint32_t char_value =
1280 rl_char.is_const ? mir_graph_->ConstantValue(rl_char.orig_sreg) : 0;
1281
1282 if (char_value > 0xFFFF) {
1283 // We have to punt to the real String.indexOf.
1284 return false;
1285 }
1286
1287 // Okay, we are commited to inlining this.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001288 // EAX: 16 bit character being searched.
1289 // ECX: count: number of words to be searched.
1290 // EDI: String being searched.
1291 // EDX: temporary during execution.
1292 // EBX or R11: temporary during execution (depending on mode).
1293 // REP SCASW: search instruction.
1294
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001295 FlushAllRegs();
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001296
buzbeea0cd2d72014-06-01 09:33:49 -07001297 RegLocation rl_return = GetReturn(kCoreReg);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001298 RegLocation rl_dest = InlineTarget(info);
1299
1300 // Is the string non-NULL?
buzbee2700f7e2014-03-07 09:46:20 -08001301 LoadValueDirectFixed(rl_obj, rs_rDX);
1302 GenNullCheck(rs_rDX, info->opt_flags);
Vladimir Marko3bc86152014-03-13 14:11:28 +00001303 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've null checked.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001304
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001305 LIR *slowpath_branch = nullptr, *length_compare = nullptr;
1306
1307 // We need the value in EAX.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001308 if (rl_char.is_const) {
buzbee2700f7e2014-03-07 09:46:20 -08001309 LoadConstantNoClobber(rs_rAX, char_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001310 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001311 // Does the character fit in 16 bits? Compare it at runtime.
buzbee2700f7e2014-03-07 09:46:20 -08001312 LoadValueDirectFixed(rl_char, rs_rAX);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001313 slowpath_branch = OpCmpImmBranch(kCondGt, rs_rAX, 0xFFFF, nullptr);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001314 }
1315
1316 // From here down, we know that we are looking for a char that fits in 16 bits.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001317 // Location of reference to data array within the String object.
1318 int value_offset = mirror::String::ValueOffset().Int32Value();
1319 // Location of count within the String object.
1320 int count_offset = mirror::String::CountOffset().Int32Value();
1321 // Starting offset within data array.
1322 int offset_offset = mirror::String::OffsetOffset().Int32Value();
1323 // Start of char data with array_.
1324 int data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Int32Value();
Mark Mendell4028a6c2014-02-19 20:06:20 -08001325
Dave Allison69dfe512014-07-11 17:11:58 +00001326 // Compute the number of words to search in to rCX.
1327 Load32Disp(rs_rDX, count_offset, rs_rCX);
1328
Dave Allisondfd3b472014-07-16 16:04:32 -07001329 // Possible signal here due to null pointer dereference.
1330 // Note that the signal handler will expect the top word of
1331 // the stack to be the ArtMethod*. If the PUSH edi instruction
1332 // below is ahead of the load above then this will not be true
1333 // and the signal handler will not work.
1334 MarkPossibleNullPointerException(0);
Dave Allison69dfe512014-07-11 17:11:58 +00001335
Dave Allisondfd3b472014-07-16 16:04:32 -07001336 if (!cu_->target64) {
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001337 // EDI is promotable in 32-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001338 NewLIR1(kX86Push32R, rs_rDI.GetReg());
1339 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001340
Mark Mendell4028a6c2014-02-19 20:06:20 -08001341 if (zero_based) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001342 // Start index is not present.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001343 // We have to handle an empty string. Use special instruction JECXZ.
1344 length_compare = NewLIR0(kX86Jecxz8);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001345
1346 // Copy the number of words to search in a temporary register.
1347 // We will use the register at the end to calculate result.
1348 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001349 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001350 // Start index is present.
buzbeea44d4f52014-03-05 11:26:39 -08001351 rl_start = info->args[2];
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001352
Mark Mendell4028a6c2014-02-19 20:06:20 -08001353 // We have to offset by the start index.
1354 if (rl_start.is_const) {
1355 start_value = mir_graph_->ConstantValue(rl_start.orig_sreg);
1356 start_value = std::max(start_value, 0);
1357
1358 // Is the start > count?
buzbee2700f7e2014-03-07 09:46:20 -08001359 length_compare = OpCmpImmBranch(kCondLe, rs_rCX, start_value, nullptr);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001360 OpRegImm(kOpMov, rs_rDI, start_value);
1361
1362 // Copy the number of words to search in a temporary register.
1363 // We will use the register at the end to calculate result.
1364 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001365
1366 if (start_value != 0) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001367 // Decrease the number of words to search by the start index.
buzbee2700f7e2014-03-07 09:46:20 -08001368 OpRegImm(kOpSub, rs_rCX, start_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001369 }
1370 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001371 // Handle "start index < 0" case.
1372 if (!cu_->target64 && rl_start.location != kLocPhysReg) {
Alexei Zavjalova1758d82014-04-17 01:55:43 +07001373 // Load the start index from stack, remembering that we pushed EDI.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001374 int displacement = SRegOffset(rl_start.s_reg_low) + sizeof(uint32_t);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001375 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1376 Load32Disp(rs_rX86_SP, displacement, rs_rDI);
1377 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1378 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1379 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - 1;
1380 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001381 } else {
1382 LoadValueDirectFixed(rl_start, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001383 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001384 OpRegReg(kOpXor, rs_tmp, rs_tmp);
1385 OpRegReg(kOpCmp, rs_rDI, rs_tmp);
1386 OpCondRegReg(kOpCmov, kCondLt, rs_rDI, rs_tmp);
1387
1388 // The length of the string should be greater than the start index.
1389 length_compare = OpCmpBranch(kCondLe, rs_rCX, rs_rDI, nullptr);
1390
1391 // Copy the number of words to search in a temporary register.
1392 // We will use the register at the end to calculate result.
1393 OpRegReg(kOpMov, rs_tmp, rs_rCX);
1394
1395 // Decrease the number of words to search by the start index.
1396 OpRegReg(kOpSub, rs_rCX, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001397 }
1398 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001399
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001400 // Load the address of the string into EDI.
1401 // In case of start index we have to add the address to existing value in EDI.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001402 // The string starts at VALUE(String) + 2 * OFFSET(String) + DATA_OFFSET.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001403 if (zero_based || (!zero_based && rl_start.is_const && start_value == 0)) {
1404 Load32Disp(rs_rDX, offset_offset, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001405 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001406 OpRegMem(kOpAdd, rs_rDI, rs_rDX, offset_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001407 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001408 OpRegImm(kOpLsl, rs_rDI, 1);
1409 OpRegMem(kOpAdd, rs_rDI, rs_rDX, value_offset);
1410 OpRegImm(kOpAdd, rs_rDI, data_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001411
1412 // EDI now contains the start of the string to be searched.
1413 // We are all prepared to do the search for the character.
1414 NewLIR0(kX86RepneScasw);
1415
1416 // Did we find a match?
1417 LIR* failed_branch = OpCondBranch(kCondNe, nullptr);
1418
1419 // yes, we matched. Compute the index of the result.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001420 OpRegReg(kOpSub, rs_tmp, rs_rCX);
1421 NewLIR3(kX86Lea32RM, rl_return.reg.GetReg(), rs_tmp.GetReg(), -1);
1422
Mark Mendell4028a6c2014-02-19 20:06:20 -08001423 LIR *all_done = NewLIR1(kX86Jmp8, 0);
1424
1425 // Failed to match; return -1.
1426 LIR *not_found = NewLIR0(kPseudoTargetLabel);
1427 length_compare->target = not_found;
1428 failed_branch->target = not_found;
buzbee2700f7e2014-03-07 09:46:20 -08001429 LoadConstantNoClobber(rl_return.reg, -1);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001430
1431 // And join up at the end.
1432 all_done->target = NewLIR0(kPseudoTargetLabel);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001433
1434 if (!cu_->target64)
1435 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
Mark Mendell4028a6c2014-02-19 20:06:20 -08001436
1437 // Out of line code returns here.
Mingyao Yang3a74d152014-04-21 15:39:44 -07001438 if (slowpath_branch != nullptr) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001439 LIR *return_point = NewLIR0(kPseudoTargetLabel);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001440 AddIntrinsicSlowPath(info, slowpath_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001441 ClobberCallerSave(); // We must clobber everything because slow path will return here
Mark Mendell4028a6c2014-02-19 20:06:20 -08001442 }
1443
1444 StoreValue(rl_dest, rl_return);
1445 return true;
1446}
1447
Tong Shen35e1e6a2014-07-30 09:31:22 -07001448static bool ARTRegIDToDWARFRegID(bool is_x86_64, int art_reg_id, int* dwarf_reg_id) {
1449 if (is_x86_64) {
1450 switch (art_reg_id) {
Andreas Gampebda27222014-07-30 23:21:36 -07001451 case 3 : *dwarf_reg_id = 3; return true; // %rbx
Tong Shen35e1e6a2014-07-30 09:31:22 -07001452 // This is the only discrepancy between ART & DWARF register numbering.
Andreas Gampebda27222014-07-30 23:21:36 -07001453 case 5 : *dwarf_reg_id = 6; return true; // %rbp
1454 case 12: *dwarf_reg_id = 12; return true; // %r12
1455 case 13: *dwarf_reg_id = 13; return true; // %r13
1456 case 14: *dwarf_reg_id = 14; return true; // %r14
1457 case 15: *dwarf_reg_id = 15; return true; // %r15
1458 default: return false; // Should not get here
Tong Shen35e1e6a2014-07-30 09:31:22 -07001459 }
1460 } else {
1461 switch (art_reg_id) {
Andreas Gampebda27222014-07-30 23:21:36 -07001462 case 5: *dwarf_reg_id = 5; return true; // %ebp
1463 case 6: *dwarf_reg_id = 6; return true; // %esi
1464 case 7: *dwarf_reg_id = 7; return true; // %edi
1465 default: return false; // Should not get here
Tong Shen35e1e6a2014-07-30 09:31:22 -07001466 }
1467 }
1468}
1469
Tong Shen547cdfd2014-08-05 01:54:19 -07001470std::vector<uint8_t>* X86Mir2Lir::ReturnFrameDescriptionEntry() {
1471 std::vector<uint8_t>* cfi_info = new std::vector<uint8_t>;
Mark Mendellae9fd932014-02-10 16:14:35 -08001472
1473 // Generate the FDE for the method.
1474 DCHECK_NE(data_offset_, 0U);
1475
Yevgeny Roubane3ea8382014-08-08 16:29:38 +07001476 WriteFDEHeader(cfi_info, cu_->target64);
1477 WriteFDEAddressRange(cfi_info, data_offset_, cu_->target64);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001478
Mark Mendellae9fd932014-02-10 16:14:35 -08001479 // The instructions in the FDE.
1480 if (stack_decrement_ != nullptr) {
1481 // Advance LOC to just past the stack decrement.
1482 uint32_t pc = NEXT_LIR(stack_decrement_)->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001483 DW_CFA_advance_loc(cfi_info, pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001484
1485 // Now update the offset to the call frame: DW_CFA_def_cfa_offset frame_size.
Tong Shen547cdfd2014-08-05 01:54:19 -07001486 DW_CFA_def_cfa_offset(cfi_info, frame_size_);
Mark Mendellae9fd932014-02-10 16:14:35 -08001487
Tong Shen35e1e6a2014-07-30 09:31:22 -07001488 // Handle register spills
1489 const uint32_t kSpillInstLen = (cu_->target64) ? 5 : 4;
1490 const int kDataAlignmentFactor = (cu_->target64) ? -8 : -4;
1491 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
1492 int offset = -(GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
1493 for (int reg = 0; mask; mask >>= 1, reg++) {
1494 if (mask & 0x1) {
1495 pc += kSpillInstLen;
1496
1497 // Advance LOC to pass this instruction
Tong Shen547cdfd2014-08-05 01:54:19 -07001498 DW_CFA_advance_loc(cfi_info, kSpillInstLen);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001499
1500 int dwarf_reg_id;
1501 if (ARTRegIDToDWARFRegID(cu_->target64, reg, &dwarf_reg_id)) {
Tong Shen547cdfd2014-08-05 01:54:19 -07001502 // DW_CFA_offset_extended_sf reg offset
1503 DW_CFA_offset_extended_sf(cfi_info, dwarf_reg_id, offset / kDataAlignmentFactor);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001504 }
1505
1506 offset += GetInstructionSetPointerSize(cu_->instruction_set);
1507 }
1508 }
1509
Mark Mendellae9fd932014-02-10 16:14:35 -08001510 // We continue with that stack until the epilogue.
1511 if (stack_increment_ != nullptr) {
1512 uint32_t new_pc = NEXT_LIR(stack_increment_)->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001513 DW_CFA_advance_loc(cfi_info, new_pc - pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001514
1515 // We probably have code snippets after the epilogue, so save the
1516 // current state: DW_CFA_remember_state.
Tong Shen547cdfd2014-08-05 01:54:19 -07001517 DW_CFA_remember_state(cfi_info);
Mark Mendellae9fd932014-02-10 16:14:35 -08001518
Tong Shen35e1e6a2014-07-30 09:31:22 -07001519 // We have now popped the stack: DW_CFA_def_cfa_offset 4/8.
1520 // There is only the return PC on the stack now.
Tong Shen547cdfd2014-08-05 01:54:19 -07001521 DW_CFA_def_cfa_offset(cfi_info, GetInstructionSetPointerSize(cu_->instruction_set));
Mark Mendellae9fd932014-02-10 16:14:35 -08001522
1523 // Everything after that is the same as before the epilogue.
1524 // Stack bump was followed by RET instruction.
1525 LIR *post_ret_insn = NEXT_LIR(NEXT_LIR(stack_increment_));
1526 if (post_ret_insn != nullptr) {
1527 pc = new_pc;
1528 new_pc = post_ret_insn->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001529 DW_CFA_advance_loc(cfi_info, new_pc - pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001530 // Restore the state: DW_CFA_restore_state.
Tong Shen547cdfd2014-08-05 01:54:19 -07001531 DW_CFA_restore_state(cfi_info);
Mark Mendellae9fd932014-02-10 16:14:35 -08001532 }
1533 }
1534 }
1535
Tong Shen547cdfd2014-08-05 01:54:19 -07001536 PadCFI(cfi_info);
Yevgeny Roubane3ea8382014-08-08 16:29:38 +07001537 WriteCFILength(cfi_info, cu_->target64);
Mark Mendellae9fd932014-02-10 16:14:35 -08001538
Mark Mendellae9fd932014-02-10 16:14:35 -08001539 return cfi_info;
1540}
1541
Mark Mendelld65c51a2014-04-29 16:55:20 -04001542void X86Mir2Lir::GenMachineSpecificExtendedMethodMIR(BasicBlock* bb, MIR* mir) {
1543 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001544 case kMirOpReserveVectorRegisters:
1545 ReserveVectorRegisters(mir);
1546 break;
1547 case kMirOpReturnVectorRegisters:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001548 ReturnVectorRegisters(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001549 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001550 case kMirOpConstVector:
1551 GenConst128(bb, mir);
1552 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001553 case kMirOpMoveVector:
1554 GenMoveVector(bb, mir);
1555 break;
1556 case kMirOpPackedMultiply:
1557 GenMultiplyVector(bb, mir);
1558 break;
1559 case kMirOpPackedAddition:
1560 GenAddVector(bb, mir);
1561 break;
1562 case kMirOpPackedSubtract:
1563 GenSubtractVector(bb, mir);
1564 break;
1565 case kMirOpPackedShiftLeft:
1566 GenShiftLeftVector(bb, mir);
1567 break;
1568 case kMirOpPackedSignedShiftRight:
1569 GenSignedShiftRightVector(bb, mir);
1570 break;
1571 case kMirOpPackedUnsignedShiftRight:
1572 GenUnsignedShiftRightVector(bb, mir);
1573 break;
1574 case kMirOpPackedAnd:
1575 GenAndVector(bb, mir);
1576 break;
1577 case kMirOpPackedOr:
1578 GenOrVector(bb, mir);
1579 break;
1580 case kMirOpPackedXor:
1581 GenXorVector(bb, mir);
1582 break;
1583 case kMirOpPackedAddReduce:
1584 GenAddReduceVector(bb, mir);
1585 break;
1586 case kMirOpPackedReduce:
1587 GenReduceVector(bb, mir);
1588 break;
1589 case kMirOpPackedSet:
1590 GenSetVector(bb, mir);
1591 break;
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07001592 case kMirOpMemBarrier:
1593 GenMemBarrier(static_cast<MemBarrierKind>(mir->dalvikInsn.vA));
1594 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001595 case kMirOpPackedArrayGet:
1596 GenPackedArrayGet(bb, mir);
1597 break;
1598 case kMirOpPackedArrayPut:
1599 GenPackedArrayPut(bb, mir);
1600 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001601 default:
1602 break;
1603 }
1604}
1605
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001606void X86Mir2Lir::ReserveVectorRegisters(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001607 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001608 RegStorage xp_reg = RegStorage::Solo128(i);
1609 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1610 Clobber(xp_reg);
1611
1612 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1613 info != nullptr;
1614 info = info->GetAliasChain()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001615 ArenaVector<RegisterInfo*>* regs =
1616 info->GetReg().IsSingle() ? &reg_pool_->sp_regs_ : &reg_pool_->dp_regs_;
1617 auto it = std::find(regs->begin(), regs->end(), info);
1618 DCHECK(it != regs->end());
1619 regs->erase(it);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001620 }
1621 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001622}
1623
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001624void X86Mir2Lir::ReturnVectorRegisters(MIR* mir) {
1625 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001626 RegStorage xp_reg = RegStorage::Solo128(i);
1627 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1628
1629 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1630 info != nullptr;
1631 info = info->GetAliasChain()) {
1632 if (info->GetReg().IsSingle()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001633 reg_pool_->sp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001634 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001635 reg_pool_->dp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001636 }
1637 }
1638 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001639}
1640
Mark Mendelld65c51a2014-04-29 16:55:20 -04001641void X86Mir2Lir::GenConst128(BasicBlock* bb, MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001642 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001643 Clobber(rs_dest);
1644
Mark Mendelld65c51a2014-04-29 16:55:20 -04001645 uint32_t *args = mir->dalvikInsn.arg;
Mark Mendellfe945782014-05-22 09:52:36 -04001646 int reg = rs_dest.GetReg();
Mark Mendelld65c51a2014-04-29 16:55:20 -04001647 // Check for all 0 case.
1648 if (args[0] == 0 && args[1] == 0 && args[2] == 0 && args[3] == 0) {
1649 NewLIR2(kX86XorpsRR, reg, reg);
1650 return;
1651 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001652
1653 // Append the mov const vector to reg opcode.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001654 AppendOpcodeWithConst(kX86MovdqaRM, reg, mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001655}
1656
1657void X86Mir2Lir::AppendOpcodeWithConst(X86OpCode opcode, int reg, MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001658 // The literal pool needs position independent logic.
1659 store_method_addr_used_ = true;
1660
1661 // To deal with correct memory ordering, reverse order of constants.
1662 int32_t constants[4];
1663 constants[3] = mir->dalvikInsn.arg[0];
1664 constants[2] = mir->dalvikInsn.arg[1];
1665 constants[1] = mir->dalvikInsn.arg[2];
1666 constants[0] = mir->dalvikInsn.arg[3];
1667
1668 // Search if there is already a constant in pool with this value.
1669 LIR *data_target = ScanVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001670 if (data_target == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001671 data_target = AddVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001672 }
1673
1674 // Address the start of the method.
1675 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07001676 if (rl_method.wide) {
1677 rl_method = LoadValueWide(rl_method, kCoreReg);
1678 } else {
1679 rl_method = LoadValue(rl_method, kCoreReg);
1680 }
Mark Mendelld65c51a2014-04-29 16:55:20 -04001681
1682 // Load the proper value from the literal area.
1683 // We don't know the proper offset for the value, so pick one that will force
1684 // 4 byte offset. We will fix this up in the assembler later to have the right
1685 // value.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001686 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001687 LIR *load = NewLIR3(opcode, reg, rl_method.reg.GetReg(), 256 /* bogus */);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001688 load->flags.fixup = kFixupLoad;
1689 load->target = data_target;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001690}
1691
Mark Mendellfe945782014-05-22 09:52:36 -04001692void X86Mir2Lir::GenMoveVector(BasicBlock *bb, MIR *mir) {
1693 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001694 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1695 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001696 Clobber(rs_dest);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001697 RegStorage rs_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001698 NewLIR2(kX86MovdqaRR, rs_dest.GetReg(), rs_src.GetReg());
Mark Mendellfe945782014-05-22 09:52:36 -04001699}
1700
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001701void X86Mir2Lir::GenMultiplyVectorSignedByte(RegStorage rs_dest_src1, RegStorage rs_src2) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001702 /*
1703 * Emulate the behavior of a kSignedByte by separating out the 16 values in the two XMM
1704 * and multiplying 8 at a time before recombining back into one XMM register.
1705 *
1706 * let xmm1, xmm2 be real srcs (keep low bits of 16bit lanes)
1707 * xmm3 is tmp (operate on high bits of 16bit lanes)
1708 *
1709 * xmm3 = xmm1
1710 * xmm1 = xmm1 .* xmm2
1711 * xmm1 = xmm1 & 0x00ff00ff00ff00ff00ff00ff00ff00ff // xmm1 now has low bits
1712 * xmm3 = xmm3 .>> 8
1713 * xmm2 = xmm2 & 0xff00ff00ff00ff00ff00ff00ff00ff00
1714 * xmm2 = xmm2 .* xmm3 // xmm2 now has high bits
1715 * xmm1 = xmm1 | xmm2 // combine results
1716 */
1717
1718 // Copy xmm1.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001719 RegStorage rs_src1_high_tmp = Get128BitRegister(AllocTempDouble());
1720 RegStorage rs_dest_high_tmp = Get128BitRegister(AllocTempDouble());
1721 NewLIR2(kX86MovdqaRR, rs_src1_high_tmp.GetReg(), rs_src2.GetReg());
1722 NewLIR2(kX86MovdqaRR, rs_dest_high_tmp.GetReg(), rs_dest_src1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001723
1724 // Multiply low bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001725 // x7 *= x3
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001726 NewLIR2(kX86PmullwRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1727
1728 // xmm1 now has low bits.
1729 AndMaskVectorRegister(rs_dest_src1, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF);
1730
1731 // Prepare high bits for multiplication.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001732 NewLIR2(kX86PsrlwRI, rs_src1_high_tmp.GetReg(), 0x8);
1733 AndMaskVectorRegister(rs_dest_high_tmp, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001734
1735 // Multiply high bits and xmm2 now has high bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001736 NewLIR2(kX86PmullwRR, rs_src1_high_tmp.GetReg(), rs_dest_high_tmp.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001737
1738 // Combine back into dest XMM register.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001739 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src1_high_tmp.GetReg());
1740}
1741
1742void X86Mir2Lir::GenMultiplyVectorLong(RegStorage rs_dest_src1, RegStorage rs_src2) {
1743 /*
1744 * We need to emulate the packed long multiply.
1745 * For kMirOpPackedMultiply xmm1, xmm0:
1746 * - xmm1 is src/dest
1747 * - xmm0 is src
1748 * - Get xmm2 and xmm3 as temp
1749 * - Idea is to multiply the lower 32 of each operand with the higher 32 of the other.
1750 * - Then add the two results.
1751 * - Move it to the upper 32 of the destination
1752 * - Then multiply the lower 32-bits of the operands and add the result to the destination.
1753 *
1754 * (op dest src )
1755 * movdqa %xmm2, %xmm1
1756 * movdqa %xmm3, %xmm0
1757 * psrlq %xmm3, $0x20
1758 * pmuludq %xmm3, %xmm2
1759 * psrlq %xmm1, $0x20
1760 * pmuludq %xmm1, %xmm0
1761 * paddq %xmm1, %xmm3
1762 * psllq %xmm1, $0x20
1763 * pmuludq %xmm2, %xmm0
1764 * paddq %xmm1, %xmm2
1765 *
1766 * When both the operands are the same, then we need to calculate the lower-32 * higher-32
1767 * calculation only once. Thus we don't need the xmm3 temp above. That sequence becomes:
1768 *
1769 * (op dest src )
1770 * movdqa %xmm2, %xmm1
1771 * psrlq %xmm1, $0x20
1772 * pmuludq %xmm1, %xmm0
1773 * paddq %xmm1, %xmm1
1774 * psllq %xmm1, $0x20
1775 * pmuludq %xmm2, %xmm0
1776 * paddq %xmm1, %xmm2
1777 *
1778 */
1779
1780 bool both_operands_same = (rs_dest_src1.GetReg() == rs_src2.GetReg());
1781
1782 RegStorage rs_tmp_vector_1;
1783 RegStorage rs_tmp_vector_2;
1784 rs_tmp_vector_1 = Get128BitRegister(AllocTempDouble());
1785 NewLIR2(kX86MovdqaRR, rs_tmp_vector_1.GetReg(), rs_dest_src1.GetReg());
1786
1787 if (both_operands_same == false) {
1788 rs_tmp_vector_2 = Get128BitRegister(AllocTempDouble());
1789 NewLIR2(kX86MovdqaRR, rs_tmp_vector_2.GetReg(), rs_src2.GetReg());
1790 NewLIR2(kX86PsrlqRI, rs_tmp_vector_2.GetReg(), 0x20);
1791 NewLIR2(kX86PmuludqRR, rs_tmp_vector_2.GetReg(), rs_tmp_vector_1.GetReg());
1792 }
1793
1794 NewLIR2(kX86PsrlqRI, rs_dest_src1.GetReg(), 0x20);
1795 NewLIR2(kX86PmuludqRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1796
1797 if (both_operands_same == false) {
1798 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_2.GetReg());
1799 } else {
1800 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1801 }
1802
1803 NewLIR2(kX86PsllqRI, rs_dest_src1.GetReg(), 0x20);
1804 NewLIR2(kX86PmuludqRR, rs_tmp_vector_1.GetReg(), rs_src2.GetReg());
1805 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001806}
1807
Mark Mendellfe945782014-05-22 09:52:36 -04001808void X86Mir2Lir::GenMultiplyVector(BasicBlock *bb, MIR *mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001809 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1810 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1811 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001812 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001813 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001814 int opcode = 0;
1815 switch (opsize) {
1816 case k32:
1817 opcode = kX86PmulldRR;
1818 break;
1819 case kSignedHalf:
1820 opcode = kX86PmullwRR;
1821 break;
1822 case kSingle:
1823 opcode = kX86MulpsRR;
1824 break;
1825 case kDouble:
1826 opcode = kX86MulpdRR;
1827 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001828 case kSignedByte:
1829 // HW doesn't support 16x16 byte multiplication so emulate it.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001830 GenMultiplyVectorSignedByte(rs_dest_src1, rs_src2);
1831 return;
1832 case k64:
1833 GenMultiplyVectorLong(rs_dest_src1, rs_src2);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001834 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001835 default:
1836 LOG(FATAL) << "Unsupported vector multiply " << opsize;
1837 break;
1838 }
1839 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1840}
1841
1842void X86Mir2Lir::GenAddVector(BasicBlock *bb, MIR *mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001843 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1844 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1845 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001846 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001847 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001848 int opcode = 0;
1849 switch (opsize) {
1850 case k32:
1851 opcode = kX86PadddRR;
1852 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001853 case k64:
1854 opcode = kX86PaddqRR;
1855 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001856 case kSignedHalf:
1857 case kUnsignedHalf:
1858 opcode = kX86PaddwRR;
1859 break;
1860 case kUnsignedByte:
1861 case kSignedByte:
1862 opcode = kX86PaddbRR;
1863 break;
1864 case kSingle:
1865 opcode = kX86AddpsRR;
1866 break;
1867 case kDouble:
1868 opcode = kX86AddpdRR;
1869 break;
1870 default:
1871 LOG(FATAL) << "Unsupported vector addition " << opsize;
1872 break;
1873 }
1874 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1875}
1876
1877void X86Mir2Lir::GenSubtractVector(BasicBlock *bb, MIR *mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001878 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1879 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1880 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001881 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001882 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001883 int opcode = 0;
1884 switch (opsize) {
1885 case k32:
1886 opcode = kX86PsubdRR;
1887 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001888 case k64:
1889 opcode = kX86PsubqRR;
1890 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001891 case kSignedHalf:
1892 case kUnsignedHalf:
1893 opcode = kX86PsubwRR;
1894 break;
1895 case kUnsignedByte:
1896 case kSignedByte:
1897 opcode = kX86PsubbRR;
1898 break;
1899 case kSingle:
1900 opcode = kX86SubpsRR;
1901 break;
1902 case kDouble:
1903 opcode = kX86SubpdRR;
1904 break;
1905 default:
1906 LOG(FATAL) << "Unsupported vector subtraction " << opsize;
1907 break;
1908 }
1909 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1910}
1911
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001912void X86Mir2Lir::GenShiftByteVector(BasicBlock *bb, MIR *mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001913 // Destination does not need clobbered because it has already been as part
1914 // of the general packed shift handler (caller of this method).
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001915 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001916
1917 int opcode = 0;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001918 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
1919 case kMirOpPackedShiftLeft:
1920 opcode = kX86PsllwRI;
1921 break;
1922 case kMirOpPackedSignedShiftRight:
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001923 case kMirOpPackedUnsignedShiftRight:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001924 // TODO Add support for emulated byte shifts.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001925 default:
1926 LOG(FATAL) << "Unsupported shift operation on byte vector " << opcode;
1927 break;
1928 }
1929
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001930 // Clear xmm register and return if shift more than byte length.
1931 int imm = mir->dalvikInsn.vB;
1932 if (imm >= 8) {
1933 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1934 return;
1935 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001936
1937 // Shift lower values.
1938 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1939
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001940 /*
1941 * The above shift will shift the whole word, but that means
1942 * both the bytes will shift as well. To emulate a byte level
1943 * shift, we can just throw away the lower (8 - N) bits of the
1944 * upper byte, and we are done.
1945 */
1946 uint8_t byte_mask = 0xFF << imm;
1947 uint32_t int_mask = byte_mask;
1948 int_mask = int_mask << 8 | byte_mask;
1949 int_mask = int_mask << 8 | byte_mask;
1950 int_mask = int_mask << 8 | byte_mask;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001951
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001952 // And the destination with the mask
1953 AndMaskVectorRegister(rs_dest_src1, int_mask, int_mask, int_mask, int_mask);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001954}
1955
Mark Mendellfe945782014-05-22 09:52:36 -04001956void X86Mir2Lir::GenShiftLeftVector(BasicBlock *bb, MIR *mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001957 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1958 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1959 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001960 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001961 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001962 int opcode = 0;
1963 switch (opsize) {
1964 case k32:
1965 opcode = kX86PslldRI;
1966 break;
1967 case k64:
1968 opcode = kX86PsllqRI;
1969 break;
1970 case kSignedHalf:
1971 case kUnsignedHalf:
1972 opcode = kX86PsllwRI;
1973 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001974 case kSignedByte:
1975 case kUnsignedByte:
1976 GenShiftByteVector(bb, mir);
1977 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001978 default:
1979 LOG(FATAL) << "Unsupported vector shift left " << opsize;
1980 break;
1981 }
1982 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1983}
1984
1985void X86Mir2Lir::GenSignedShiftRightVector(BasicBlock *bb, MIR *mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001986 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1987 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1988 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001989 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001990 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001991 int opcode = 0;
1992 switch (opsize) {
1993 case k32:
1994 opcode = kX86PsradRI;
1995 break;
1996 case kSignedHalf:
1997 case kUnsignedHalf:
1998 opcode = kX86PsrawRI;
1999 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002000 case kSignedByte:
2001 case kUnsignedByte:
2002 GenShiftByteVector(bb, mir);
2003 return;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002004 case k64:
2005 // TODO Implement emulated shift algorithm.
Mark Mendellfe945782014-05-22 09:52:36 -04002006 default:
2007 LOG(FATAL) << "Unsupported vector signed shift right " << opsize;
2008 break;
2009 }
2010 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
2011}
2012
2013void X86Mir2Lir::GenUnsignedShiftRightVector(BasicBlock *bb, MIR *mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002014 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2015 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2016 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002017 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002018 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04002019 int opcode = 0;
2020 switch (opsize) {
2021 case k32:
2022 opcode = kX86PsrldRI;
2023 break;
2024 case k64:
2025 opcode = kX86PsrlqRI;
2026 break;
2027 case kSignedHalf:
2028 case kUnsignedHalf:
2029 opcode = kX86PsrlwRI;
2030 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002031 case kSignedByte:
2032 case kUnsignedByte:
2033 GenShiftByteVector(bb, mir);
2034 return;
Mark Mendellfe945782014-05-22 09:52:36 -04002035 default:
2036 LOG(FATAL) << "Unsupported vector unsigned shift right " << opsize;
2037 break;
2038 }
2039 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
2040}
2041
2042void X86Mir2Lir::GenAndVector(BasicBlock *bb, MIR *mir) {
2043 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002044 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2045 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002046 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002047 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002048 NewLIR2(kX86PandRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2049}
2050
2051void X86Mir2Lir::GenOrVector(BasicBlock *bb, MIR *mir) {
2052 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002053 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2054 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002055 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002056 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002057 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2058}
2059
2060void X86Mir2Lir::GenXorVector(BasicBlock *bb, MIR *mir) {
2061 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002062 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2063 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002064 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002065 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002066 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2067}
2068
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002069void X86Mir2Lir::AndMaskVectorRegister(RegStorage rs_src1, uint32_t m1, uint32_t m2, uint32_t m3, uint32_t m4) {
2070 MaskVectorRegister(kX86PandRM, rs_src1, m1, m2, m3, m4);
2071}
2072
2073void X86Mir2Lir::MaskVectorRegister(X86OpCode opcode, RegStorage rs_src1, uint32_t m0, uint32_t m1, uint32_t m2, uint32_t m3) {
2074 // Create temporary MIR as container for 128-bit binary mask.
2075 MIR const_mir;
2076 MIR* const_mirp = &const_mir;
2077 const_mirp->dalvikInsn.opcode = static_cast<Instruction::Code>(kMirOpConstVector);
2078 const_mirp->dalvikInsn.arg[0] = m0;
2079 const_mirp->dalvikInsn.arg[1] = m1;
2080 const_mirp->dalvikInsn.arg[2] = m2;
2081 const_mirp->dalvikInsn.arg[3] = m3;
2082
2083 // Mask vector with const from literal pool.
2084 AppendOpcodeWithConst(opcode, rs_src1.GetReg(), const_mirp);
2085}
2086
Mark Mendellfe945782014-05-22 09:52:36 -04002087void X86Mir2Lir::GenAddReduceVector(BasicBlock *bb, MIR *mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002088 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002089 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
2090 bool is_wide = opsize == k64 || opsize == kDouble;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002091
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002092 // Get the location of the virtual register. Since this bytecode is overloaded
2093 // for different types (and sizes), we need different logic for each path.
2094 // The design of bytecode uses same VR for source and destination.
2095 RegLocation rl_src, rl_dest, rl_result;
2096 if (is_wide) {
2097 rl_src = mir_graph_->GetSrcWide(mir, 0);
2098 rl_dest = mir_graph_->GetDestWide(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002099 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002100 rl_src = mir_graph_->GetSrc(mir, 0);
2101 rl_dest = mir_graph_->GetDest(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002102 }
2103
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002104 // We need a temp for byte and short values
2105 RegStorage temp;
2106
2107 // There is a different path depending on type and size.
2108 if (opsize == kSingle) {
2109 // Handle float case.
2110 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
2111
2112 rl_src = LoadValue(rl_src, kFPReg);
2113 rl_result = EvalLoc(rl_dest, kFPReg, true);
2114
2115 // Since we are doing an add-reduce, we move the reg holding the VR
2116 // into the result so we include it in result.
2117 OpRegCopy(rl_result.reg, rl_src.reg);
2118 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2119
2120 // Since FP must keep order of operation for value safety, we shift to low
2121 // 32-bits and add to result.
2122 for (int i = 0; i < 3; i++) {
2123 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), 0x39);
2124 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2125 }
2126
2127 StoreValue(rl_dest, rl_result);
2128 } else if (opsize == kDouble) {
2129 // Handle double case.
2130 rl_src = LoadValueWide(rl_src, kFPReg);
2131 rl_result = EvalLocWide(rl_dest, kFPReg, true);
2132 LOG(FATAL) << "Unsupported vector add reduce for double.";
2133 } else if (opsize == k64) {
2134 /*
2135 * Handle long case:
2136 * 1) Reduce the vector register to lower half (with addition).
2137 * 1-1) Get an xmm temp and fill it with vector register.
2138 * 1-2) Shift the xmm temp by 8-bytes.
2139 * 1-3) Add the xmm temp to vector register that is being reduced.
2140 * 2) Allocate temp GP / GP pair.
2141 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2142 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2143 * 3) Finish the add reduction by doing what add-long/2addr does,
2144 * but instead of having a VR as one of the sources, we have our temp GP.
2145 */
2146 RegStorage rs_tmp_vector = Get128BitRegister(AllocTempDouble());
2147 NewLIR2(kX86MovdqaRR, rs_tmp_vector.GetReg(), vector_src.GetReg());
2148 NewLIR2(kX86PsrldqRI, rs_tmp_vector.GetReg(), 8);
2149 NewLIR2(kX86PaddqRR, vector_src.GetReg(), rs_tmp_vector.GetReg());
2150 FreeTemp(rs_tmp_vector);
2151
2152 // We would like to be able to reuse the add-long implementation, so set up a fake
2153 // register location to pass it.
2154 RegLocation temp_loc = mir_graph_->GetBadLoc();
2155 temp_loc.core = 1;
2156 temp_loc.wide = 1;
2157 temp_loc.location = kLocPhysReg;
2158 temp_loc.reg = AllocTempWide();
2159
2160 if (cu_->target64) {
2161 DCHECK(!temp_loc.reg.IsPair());
2162 NewLIR2(kX86MovqrxRR, temp_loc.reg.GetReg(), vector_src.GetReg());
2163 } else {
2164 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetLowReg(), vector_src.GetReg());
2165 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2166 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetHighReg(), vector_src.GetReg());
2167 }
2168
2169 GenArithOpLong(Instruction::ADD_LONG_2ADDR, rl_dest, temp_loc, temp_loc);
2170 } else if (opsize == kSignedByte || opsize == kUnsignedByte) {
2171 RegStorage rs_tmp = Get128BitRegister(AllocTempDouble());
2172 NewLIR2(kX86PxorRR, rs_tmp.GetReg(), rs_tmp.GetReg());
2173 NewLIR2(kX86PsadbwRR, vector_src.GetReg(), rs_tmp.GetReg());
2174 NewLIR3(kX86PshufdRRI, rs_tmp.GetReg(), vector_src.GetReg(), 0x4e);
2175 NewLIR2(kX86PaddbRR, vector_src.GetReg(), rs_tmp.GetReg());
2176 // Move to a GPR
2177 temp = AllocTemp();
2178 NewLIR2(kX86MovdrxRR, temp.GetReg(), vector_src.GetReg());
2179 } else {
2180 // Handle and the int and short cases together
2181
2182 // Initialize as if we were handling int case. Below we update
2183 // the opcode if handling byte or short.
2184 int vec_bytes = (mir->dalvikInsn.vC & 0xFFFF) / 8;
2185 int vec_unit_size;
2186 int horizontal_add_opcode;
2187 int extract_opcode;
2188
2189 if (opsize == kSignedHalf || opsize == kUnsignedHalf) {
2190 extract_opcode = kX86PextrwRRI;
2191 horizontal_add_opcode = kX86PhaddwRR;
2192 vec_unit_size = 2;
2193 } else if (opsize == k32) {
2194 vec_unit_size = 4;
2195 horizontal_add_opcode = kX86PhadddRR;
2196 extract_opcode = kX86PextrdRRI;
2197 } else {
2198 LOG(FATAL) << "Unsupported vector add reduce " << opsize;
2199 return;
2200 }
2201
2202 int elems = vec_bytes / vec_unit_size;
2203
2204 while (elems > 1) {
2205 NewLIR2(horizontal_add_opcode, vector_src.GetReg(), vector_src.GetReg());
2206 elems >>= 1;
2207 }
2208
2209 // Handle this as arithmetic unary case.
2210 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2211
2212 // Extract to a GP register because this is integral typed.
2213 temp = AllocTemp();
2214 NewLIR3(extract_opcode, temp.GetReg(), vector_src.GetReg(), 0);
2215 }
2216
2217 if (opsize != k64 && opsize != kSingle && opsize != kDouble) {
2218 // The logic below looks very similar to the handling of ADD_INT_2ADDR
2219 // except the rhs is not a VR but a physical register allocated above.
2220 // No load of source VR is done because it assumes that rl_result will
2221 // share physical register / memory location.
2222 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
2223 if (rl_result.location == kLocPhysReg) {
2224 // Ensure res is in a core reg.
2225 rl_result = EvalLoc(rl_dest, kCoreReg, true);
2226 OpRegReg(kOpAdd, rl_result.reg, temp);
2227 StoreFinalValue(rl_dest, rl_result);
2228 } else {
2229 // Do the addition directly to memory.
2230 OpMemReg(kOpAdd, rl_result, temp.GetReg());
2231 }
2232 }
Mark Mendellfe945782014-05-22 09:52:36 -04002233}
2234
2235void X86Mir2Lir::GenReduceVector(BasicBlock *bb, MIR *mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002236 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2237 RegLocation rl_dest = mir_graph_->GetDest(mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002238 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002239 RegLocation rl_result;
2240 bool is_wide = false;
2241
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002242 // There is a different path depending on type and size.
2243 if (opsize == kSingle) {
2244 // Handle float case.
2245 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
Mark Mendellfe945782014-05-22 09:52:36 -04002246
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002247 rl_result = EvalLoc(rl_dest, kFPReg, true);
2248 NewLIR2(kX86PxorRR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
2249 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2250
2251 // Since FP must keep order of operation for value safety, we shift to low
2252 // 32-bits and add to result.
2253 for (int i = 0; i < 3; i++) {
2254 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), 0x39);
2255 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002256 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002257
2258 StoreValue(rl_dest, rl_result);
2259 } else if (opsize == kDouble) {
2260 // TODO Handle double case.
2261 LOG(FATAL) << "Unsupported add reduce for double.";
2262 } else if (opsize == k64) {
2263 /*
2264 * Handle long case:
2265 * 1) Reduce the vector register to lower half (with addition).
2266 * 1-1) Get an xmm temp and fill it with vector register.
2267 * 1-2) Shift the xmm temp by 8-bytes.
2268 * 1-3) Add the xmm temp to vector register that is being reduced.
2269 * 2) Evaluate destination to a GP / GP pair.
2270 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2271 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2272 * 3) Store the result to the final destination.
2273 */
Udayan Banerji53cec002014-09-26 10:41:47 -07002274 NewLIR2(kX86PsrldqRI, vector_src.GetReg(), 8);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002275 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2276 if (cu_->target64) {
2277 DCHECK(!rl_result.reg.IsPair());
2278 NewLIR2(kX86MovqrxRR, rl_result.reg.GetReg(), vector_src.GetReg());
2279 } else {
2280 NewLIR2(kX86MovdrxRR, rl_result.reg.GetLowReg(), vector_src.GetReg());
2281 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2282 NewLIR2(kX86MovdrxRR, rl_result.reg.GetHighReg(), vector_src.GetReg());
2283 }
2284
2285 StoreValueWide(rl_dest, rl_result);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002286 } else {
Udayan Banerji53cec002014-09-26 10:41:47 -07002287 int extract_index = mir->dalvikInsn.arg[0];
2288 int extr_opcode = 0;
2289 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
2290
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002291 // Handle the rest of integral types now.
2292 switch (opsize) {
2293 case k32:
Udayan Banerji53cec002014-09-26 10:41:47 -07002294 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrdRRI : kX86PextrdMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002295 break;
2296 case kSignedHalf:
2297 case kUnsignedHalf:
Udayan Banerji53cec002014-09-26 10:41:47 -07002298 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrwRRI : kX86PextrwMRI;
2299 break;
2300 case kSignedByte:
2301 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrbRRI : kX86PextrbMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002302 break;
2303 default:
2304 LOG(FATAL) << "Unsupported vector reduce " << opsize;
2305 return;
2306 }
2307
2308 if (rl_result.location == kLocPhysReg) {
2309 NewLIR3(extr_opcode, rl_result.reg.GetReg(), vector_src.GetReg(), extract_index);
Udayan Banerji53cec002014-09-26 10:41:47 -07002310 StoreFinalValue(rl_dest, rl_result);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002311 } else {
2312 int displacement = SRegOffset(rl_result.s_reg_low);
2313 LIR *l = NewLIR3(extr_opcode, rs_rX86_SP.GetReg(), displacement, vector_src.GetReg());
2314 AnnotateDalvikRegAccess(l, displacement >> 2, true /* is_load */, is_wide /* is_64bit */);
2315 AnnotateDalvikRegAccess(l, displacement >> 2, false /* is_load */, is_wide /* is_64bit */);
2316 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002317 }
Mark Mendellfe945782014-05-22 09:52:36 -04002318}
2319
Mark Mendell0a1174e2014-09-11 14:51:02 -04002320void X86Mir2Lir::LoadVectorRegister(RegStorage rs_dest, RegStorage rs_src,
2321 OpSize opsize, int op_mov) {
2322 if (!cu_->target64 && opsize == k64) {
2323 // Logic assumes that longs are loaded in GP register pairs.
2324 NewLIR2(kX86MovdxrRR, rs_dest.GetReg(), rs_src.GetLowReg());
2325 RegStorage r_tmp = AllocTempDouble();
2326 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), rs_src.GetHighReg());
2327 NewLIR2(kX86PunpckldqRR, rs_dest.GetReg(), r_tmp.GetReg());
2328 FreeTemp(r_tmp);
2329 } else {
2330 NewLIR2(op_mov, rs_dest.GetReg(), rs_src.GetReg());
2331 }
2332}
2333
Mark Mendellfe945782014-05-22 09:52:36 -04002334void X86Mir2Lir::GenSetVector(BasicBlock *bb, MIR *mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002335 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2336 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2337 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002338 Clobber(rs_dest);
2339 int op_shuffle = 0, op_shuffle_high = 0, op_mov = kX86MovdxrRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002340 RegisterClass reg_type = kCoreReg;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002341 bool is_wide = false;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002342
Mark Mendellfe945782014-05-22 09:52:36 -04002343 switch (opsize) {
2344 case k32:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002345 op_shuffle = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002346 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002347 case kSingle:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002348 op_shuffle = kX86PshufdRRI;
2349 op_mov = kX86MovdqaRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002350 reg_type = kFPReg;
2351 break;
2352 case k64:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002353 op_shuffle = kX86PunpcklqdqRR;
Udayan Banerji53cec002014-09-26 10:41:47 -07002354 op_mov = kX86MovqxrRR;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002355 is_wide = true;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002356 break;
2357 case kSignedByte:
2358 case kUnsignedByte:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002359 // We will have the source loaded up in a
2360 // double-word before we use this shuffle
2361 op_shuffle = kX86PshufdRRI;
2362 break;
Mark Mendellfe945782014-05-22 09:52:36 -04002363 case kSignedHalf:
2364 case kUnsignedHalf:
2365 // Handles low quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002366 op_shuffle = kX86PshuflwRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002367 // Handles upper quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002368 op_shuffle_high = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002369 break;
2370 default:
2371 LOG(FATAL) << "Unsupported vector set " << opsize;
2372 break;
2373 }
2374
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002375 // Load the value from the VR into a physical register.
2376 RegLocation rl_src;
2377 if (!is_wide) {
2378 rl_src = mir_graph_->GetSrc(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002379 rl_src = LoadValue(rl_src, reg_type);
2380 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002381 rl_src = mir_graph_->GetSrcWide(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002382 rl_src = LoadValueWide(rl_src, reg_type);
2383 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002384 RegStorage reg_to_shuffle = rl_src.reg;
Mark Mendellfe945782014-05-22 09:52:36 -04002385
2386 // Load the value into the XMM register.
Mark Mendell0a1174e2014-09-11 14:51:02 -04002387 LoadVectorRegister(rs_dest, reg_to_shuffle, opsize, op_mov);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002388
2389 if (opsize == kSignedByte || opsize == kUnsignedByte) {
2390 // In the byte case, first duplicate it to be a word
2391 // Then duplicate it to be a double-word
2392 NewLIR2(kX86PunpcklbwRR, rs_dest.GetReg(), rs_dest.GetReg());
2393 NewLIR2(kX86PunpcklwdRR, rs_dest.GetReg(), rs_dest.GetReg());
2394 }
Mark Mendellfe945782014-05-22 09:52:36 -04002395
2396 // Now shuffle the value across the destination.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002397 if (op_shuffle == kX86PunpcklqdqRR) {
2398 NewLIR2(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg());
2399 } else {
2400 NewLIR3(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg(), 0);
2401 }
Mark Mendellfe945782014-05-22 09:52:36 -04002402
2403 // And then repeat as needed.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002404 if (op_shuffle_high != 0) {
2405 NewLIR3(op_shuffle_high, rs_dest.GetReg(), rs_dest.GetReg(), 0);
Mark Mendellfe945782014-05-22 09:52:36 -04002406 }
2407}
2408
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002409void X86Mir2Lir::GenPackedArrayGet(BasicBlock *bb, MIR *mir) {
2410 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayGet not supported.";
2411}
2412
2413void X86Mir2Lir::GenPackedArrayPut(BasicBlock *bb, MIR *mir) {
2414 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayPut not supported.";
2415}
2416
2417LIR* X86Mir2Lir::ScanVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002418 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002419 if (constants[0] == p->operands[0] && constants[1] == p->operands[1] &&
2420 constants[2] == p->operands[2] && constants[3] == p->operands[3]) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002421 return p;
2422 }
2423 }
2424 return nullptr;
2425}
2426
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002427LIR* X86Mir2Lir::AddVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002428 LIR* new_value = static_cast<LIR*>(arena_->Alloc(sizeof(LIR), kArenaAllocData));
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002429 new_value->operands[0] = constants[0];
2430 new_value->operands[1] = constants[1];
2431 new_value->operands[2] = constants[2];
2432 new_value->operands[3] = constants[3];
Mark Mendelld65c51a2014-04-29 16:55:20 -04002433 new_value->next = const_vectors_;
2434 if (const_vectors_ == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002435 estimated_native_code_size_ += 12; // Maximum needed to align to 16 byte boundary.
Mark Mendelld65c51a2014-04-29 16:55:20 -04002436 }
2437 estimated_native_code_size_ += 16; // Space for one vector.
2438 const_vectors_ = new_value;
2439 return new_value;
2440}
2441
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002442// ------------ ABI support: mapping of args to physical registers -------------
Andreas Gampeccc60262014-07-04 18:02:38 -07002443RegStorage X86Mir2Lir::InToRegStorageX86_64Mapper::GetNextReg(bool is_double_or_float, bool is_wide,
2444 bool is_ref) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002445 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3, kArg4, kArg5};
Andreas Gampeccc60262014-07-04 18:02:38 -07002446 const int coreArgMappingToPhysicalRegSize = sizeof(coreArgMappingToPhysicalReg) /
2447 sizeof(SpecialTargetRegister);
Chao-ying Fua77ee512014-07-01 17:43:41 -07002448 const SpecialTargetRegister fpArgMappingToPhysicalReg[] = {kFArg0, kFArg1, kFArg2, kFArg3,
Andreas Gampeccc60262014-07-04 18:02:38 -07002449 kFArg4, kFArg5, kFArg6, kFArg7};
2450 const int fpArgMappingToPhysicalRegSize = sizeof(fpArgMappingToPhysicalReg) /
2451 sizeof(SpecialTargetRegister);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002452
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002453 if (is_double_or_float) {
2454 if (cur_fp_reg_ < fpArgMappingToPhysicalRegSize) {
Andreas Gampeccc60262014-07-04 18:02:38 -07002455 return ml_->TargetReg(fpArgMappingToPhysicalReg[cur_fp_reg_++], is_wide ? kWide : kNotWide);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002456 }
2457 } else {
2458 if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
Andreas Gampeccc60262014-07-04 18:02:38 -07002459 return ml_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2460 is_ref ? kRef : (is_wide ? kWide : kNotWide));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002461 }
2462 }
Chao-ying Fua77ee512014-07-01 17:43:41 -07002463 return RegStorage::InvalidReg();
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002464}
2465
2466RegStorage X86Mir2Lir::InToRegStorageMapping::Get(int in_position) {
2467 DCHECK(IsInitialized());
2468 auto res = mapping_.find(in_position);
2469 return res != mapping_.end() ? res->second : RegStorage::InvalidReg();
2470}
2471
Andreas Gampeccc60262014-07-04 18:02:38 -07002472void X86Mir2Lir::InToRegStorageMapping::Initialize(RegLocation* arg_locs, int count,
2473 InToRegStorageMapper* mapper) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002474 DCHECK(mapper != nullptr);
2475 max_mapped_in_ = -1;
2476 is_there_stack_mapped_ = false;
2477 for (int in_position = 0; in_position < count; in_position++) {
Serguei Katkov407a9d22014-07-05 03:09:32 +07002478 RegStorage reg = mapper->GetNextReg(arg_locs[in_position].fp,
2479 arg_locs[in_position].wide, arg_locs[in_position].ref);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002480 if (reg.Valid()) {
2481 mapping_[in_position] = reg;
2482 max_mapped_in_ = std::max(max_mapped_in_, in_position);
Serguei Katkov407a9d22014-07-05 03:09:32 +07002483 if (arg_locs[in_position].wide) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002484 // We covered 2 args, so skip the next one
2485 in_position++;
2486 }
2487 } else {
2488 is_there_stack_mapped_ = true;
2489 }
2490 }
2491 initialized_ = true;
2492}
2493
2494RegStorage X86Mir2Lir::GetArgMappingToPhysicalReg(int arg_num) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002495 if (!cu_->target64) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002496 return GetCoreArgMappingToPhysicalReg(arg_num);
2497 }
2498
2499 if (!in_to_reg_storage_mapping_.IsInitialized()) {
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -07002500 int start_vreg = cu_->mir_graph->GetFirstInVR();
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002501 RegLocation* arg_locs = &mir_graph_->reg_location_[start_vreg];
2502
Chao-ying Fua77ee512014-07-01 17:43:41 -07002503 InToRegStorageX86_64Mapper mapper(this);
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -07002504 in_to_reg_storage_mapping_.Initialize(arg_locs, mir_graph_->GetNumOfInVRs(), &mapper);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002505 }
2506 return in_to_reg_storage_mapping_.Get(arg_num);
2507}
2508
2509RegStorage X86Mir2Lir::GetCoreArgMappingToPhysicalReg(int core_arg_num) {
2510 // For the 32-bit internal ABI, the first 3 arguments are passed in registers.
2511 // Not used for 64-bit, TODO: Move X86_32 to the same framework
2512 switch (core_arg_num) {
2513 case 0:
2514 return rs_rX86_ARG1;
2515 case 1:
2516 return rs_rX86_ARG2;
2517 case 2:
2518 return rs_rX86_ARG3;
2519 default:
2520 return RegStorage::InvalidReg();
2521 }
2522}
2523
2524// ---------End of ABI support: mapping of args to physical registers -------------
2525
2526/*
2527 * If there are any ins passed in registers that have not been promoted
2528 * to a callee-save register, flush them to the frame. Perform initial
2529 * assignment of promoted arguments.
2530 *
2531 * ArgLocs is an array of location records describing the incoming arguments
2532 * with one location record per word of argument.
2533 */
2534void X86Mir2Lir::FlushIns(RegLocation* ArgLocs, RegLocation rl_method) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002535 if (!cu_->target64) return Mir2Lir::FlushIns(ArgLocs, rl_method);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002536 /*
2537 * Dummy up a RegLocation for the incoming Method*
2538 * It will attempt to keep kArg0 live (or copy it to home location
2539 * if promoted).
2540 */
2541
2542 RegLocation rl_src = rl_method;
2543 rl_src.location = kLocPhysReg;
Andreas Gampeccc60262014-07-04 18:02:38 -07002544 rl_src.reg = TargetReg(kArg0, kRef);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002545 rl_src.home = false;
2546 MarkLive(rl_src);
2547 StoreValue(rl_method, rl_src);
2548 // If Method* has been promoted, explicitly flush
2549 if (rl_method.location == kLocPhysReg) {
Andreas Gampeccc60262014-07-04 18:02:38 -07002550 StoreRefDisp(rs_rX86_SP, 0, As32BitReg(TargetReg(kArg0, kRef)), kNotVolatile);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002551 }
2552
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -07002553 if (mir_graph_->GetNumOfInVRs() == 0) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002554 return;
2555 }
2556
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -07002557 int start_vreg = cu_->mir_graph->GetFirstInVR();
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002558 /*
2559 * Copy incoming arguments to their proper home locations.
2560 * NOTE: an older version of dx had an issue in which
2561 * it would reuse static method argument registers.
2562 * This could result in the same Dalvik virtual register
2563 * being promoted to both core and fp regs. To account for this,
2564 * we only copy to the corresponding promoted physical register
2565 * if it matches the type of the SSA name for the incoming
2566 * argument. It is also possible that long and double arguments
2567 * end up half-promoted. In those cases, we must flush the promoted
2568 * half to memory as well.
2569 */
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002570 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -07002571 for (uint32_t i = 0; i < mir_graph_->GetNumOfInVRs(); i++) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002572 // get reg corresponding to input
Dmitry Petrochenko4d5d7942014-06-27 12:25:01 +07002573 RegStorage reg = GetArgMappingToPhysicalReg(i);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002574
Dmitry Petrochenko4d5d7942014-06-27 12:25:01 +07002575 RegLocation* t_loc = &ArgLocs[i];
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002576 if (reg.Valid()) {
Dmitry Petrochenko4d5d7942014-06-27 12:25:01 +07002577 // If arriving in register.
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002578
Dmitry Petrochenko4d5d7942014-06-27 12:25:01 +07002579 // We have already updated the arg location with promoted info
2580 // so we can be based on it.
2581 if (t_loc->location == kLocPhysReg) {
2582 // Just copy it.
2583 OpRegCopy(t_loc->reg, reg);
2584 } else {
2585 // Needs flush.
2586 if (t_loc->ref) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002587 StoreRefDisp(rs_rX86_SP, SRegOffset(start_vreg + i), reg, kNotVolatile);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002588 } else {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002589 StoreBaseDisp(rs_rX86_SP, SRegOffset(start_vreg + i), reg, t_loc->wide ? k64 : k32,
Dmitry Petrochenko4d5d7942014-06-27 12:25:01 +07002590 kNotVolatile);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002591 }
2592 }
2593 } else {
Dmitry Petrochenko4d5d7942014-06-27 12:25:01 +07002594 // If arriving in frame & promoted.
2595 if (t_loc->location == kLocPhysReg) {
2596 if (t_loc->ref) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002597 LoadRefDisp(rs_rX86_SP, SRegOffset(start_vreg + i), t_loc->reg, kNotVolatile);
Dmitry Petrochenko4d5d7942014-06-27 12:25:01 +07002598 } else {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002599 LoadBaseDisp(rs_rX86_SP, SRegOffset(start_vreg + i), t_loc->reg,
Dmitry Petrochenko4d5d7942014-06-27 12:25:01 +07002600 t_loc->wide ? k64 : k32, kNotVolatile);
2601 }
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002602 }
Dmitry Petrochenko4d5d7942014-06-27 12:25:01 +07002603 }
2604 if (t_loc->wide) {
2605 // Increment i to skip the next one.
2606 i++;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002607 }
2608 }
2609}
2610
2611/*
2612 * Load up to 5 arguments, the first three of which will be in
2613 * kArg1 .. kArg3. On entry kArg0 contains the current method pointer,
2614 * and as part of the load sequence, it must be replaced with
2615 * the target method pointer. Note, this may also be called
2616 * for "range" variants if the number of arguments is 5 or fewer.
2617 */
2618int X86Mir2Lir::GenDalvikArgsNoRange(CallInfo* info,
2619 int call_state, LIR** pcrLabel, NextCallInsn next_call_insn,
2620 const MethodReference& target_method,
2621 uint32_t vtable_idx, uintptr_t direct_code,
2622 uintptr_t direct_method, InvokeType type, bool skip_this) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002623 if (!cu_->target64) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002624 return Mir2Lir::GenDalvikArgsNoRange(info,
2625 call_state, pcrLabel, next_call_insn,
2626 target_method,
2627 vtable_idx, direct_code,
2628 direct_method, type, skip_this);
2629 }
2630 return GenDalvikArgsRange(info,
2631 call_state, pcrLabel, next_call_insn,
2632 target_method,
2633 vtable_idx, direct_code,
2634 direct_method, type, skip_this);
2635}
2636
2637/*
2638 * May have 0+ arguments (also used for jumbo). Note that
2639 * source virtual registers may be in physical registers, so may
2640 * need to be flushed to home location before copying. This
2641 * applies to arg3 and above (see below).
2642 *
2643 * Two general strategies:
2644 * If < 20 arguments
2645 * Pass args 3-18 using vldm/vstm block copy
2646 * Pass arg0, arg1 & arg2 in kArg1-kArg3
2647 * If 20+ arguments
2648 * Pass args arg19+ using memcpy block copy
2649 * Pass arg0, arg1 & arg2 in kArg1-kArg3
2650 *
2651 */
2652int X86Mir2Lir::GenDalvikArgsRange(CallInfo* info, int call_state,
2653 LIR** pcrLabel, NextCallInsn next_call_insn,
2654 const MethodReference& target_method,
2655 uint32_t vtable_idx, uintptr_t direct_code, uintptr_t direct_method,
2656 InvokeType type, bool skip_this) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002657 if (!cu_->target64) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002658 return Mir2Lir::GenDalvikArgsRange(info, call_state,
2659 pcrLabel, next_call_insn,
2660 target_method,
2661 vtable_idx, direct_code, direct_method,
2662 type, skip_this);
2663 }
2664
2665 /* If no arguments, just return */
2666 if (info->num_arg_words == 0)
2667 return call_state;
2668
2669 const int start_index = skip_this ? 1 : 0;
2670
Chao-ying Fua77ee512014-07-01 17:43:41 -07002671 InToRegStorageX86_64Mapper mapper(this);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002672 InToRegStorageMapping in_to_reg_storage_mapping;
2673 in_to_reg_storage_mapping.Initialize(info->args, info->num_arg_words, &mapper);
2674 const int last_mapped_in = in_to_reg_storage_mapping.GetMaxMappedIn();
2675 const int size_of_the_last_mapped = last_mapped_in == -1 ? 1 :
Serguei Katkov8e3acdd2014-07-15 12:01:00 +07002676 info->args[last_mapped_in].wide ? 2 : 1;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002677 int regs_left_to_pass_via_stack = info->num_arg_words - (last_mapped_in + size_of_the_last_mapped);
2678
2679 // Fisrt of all, check whether it make sense to use bulk copying
2680 // Optimization is aplicable only for range case
2681 // TODO: make a constant instead of 2
2682 if (info->is_range && regs_left_to_pass_via_stack >= 2) {
2683 // Scan the rest of the args - if in phys_reg flush to memory
2684 for (int next_arg = last_mapped_in + size_of_the_last_mapped; next_arg < info->num_arg_words;) {
2685 RegLocation loc = info->args[next_arg];
2686 if (loc.wide) {
2687 loc = UpdateLocWide(loc);
2688 if (loc.location == kLocPhysReg) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002689 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua77ee512014-07-01 17:43:41 -07002690 StoreBaseDisp(rs_rX86_SP, SRegOffset(loc.s_reg_low), loc.reg, k64, kNotVolatile);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002691 }
2692 next_arg += 2;
2693 } else {
2694 loc = UpdateLoc(loc);
2695 if (loc.location == kLocPhysReg) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002696 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua77ee512014-07-01 17:43:41 -07002697 StoreBaseDisp(rs_rX86_SP, SRegOffset(loc.s_reg_low), loc.reg, k32, kNotVolatile);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002698 }
2699 next_arg++;
2700 }
2701 }
2702
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002703 // The rest can be copied together
2704 int start_offset = SRegOffset(info->args[last_mapped_in + size_of_the_last_mapped].s_reg_low);
Andreas Gampeccc60262014-07-04 18:02:38 -07002705 int outs_offset = StackVisitor::GetOutVROffset(last_mapped_in + size_of_the_last_mapped,
2706 cu_->instruction_set);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002707
2708 int current_src_offset = start_offset;
2709 int current_dest_offset = outs_offset;
2710
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002711 // Only davik regs are accessed in this loop; no next_call_insn() calls.
2712 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002713 while (regs_left_to_pass_via_stack > 0) {
2714 // This is based on the knowledge that the stack itself is 16-byte aligned.
2715 bool src_is_16b_aligned = (current_src_offset & 0xF) == 0;
2716 bool dest_is_16b_aligned = (current_dest_offset & 0xF) == 0;
2717 size_t bytes_to_move;
2718
2719 /*
2720 * The amount to move defaults to 32-bit. If there are 4 registers left to move, then do a
2721 * a 128-bit move because we won't get the chance to try to aligned. If there are more than
2722 * 4 registers left to move, consider doing a 128-bit only if either src or dest are aligned.
2723 * We do this because we could potentially do a smaller move to align.
2724 */
2725 if (regs_left_to_pass_via_stack == 4 ||
2726 (regs_left_to_pass_via_stack > 4 && (src_is_16b_aligned || dest_is_16b_aligned))) {
2727 // Moving 128-bits via xmm register.
2728 bytes_to_move = sizeof(uint32_t) * 4;
2729
2730 // Allocate a free xmm temp. Since we are working through the calling sequence,
2731 // we expect to have an xmm temporary available. AllocTempDouble will abort if
2732 // there are no free registers.
2733 RegStorage temp = AllocTempDouble();
2734
2735 LIR* ld1 = nullptr;
2736 LIR* ld2 = nullptr;
2737 LIR* st1 = nullptr;
2738 LIR* st2 = nullptr;
2739
2740 /*
2741 * The logic is similar for both loads and stores. If we have 16-byte alignment,
2742 * do an aligned move. If we have 8-byte alignment, then do the move in two
2743 * parts. This approach prevents possible cache line splits. Finally, fall back
2744 * to doing an unaligned move. In most cases we likely won't split the cache
2745 * line but we cannot prove it and thus take a conservative approach.
2746 */
2747 bool src_is_8b_aligned = (current_src_offset & 0x7) == 0;
2748 bool dest_is_8b_aligned = (current_dest_offset & 0x7) == 0;
2749
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002750 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002751 if (src_is_16b_aligned) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002752 ld1 = OpMovRegMem(temp, rs_rX86_SP, current_src_offset, kMovA128FP);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002753 } else if (src_is_8b_aligned) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002754 ld1 = OpMovRegMem(temp, rs_rX86_SP, current_src_offset, kMovLo128FP);
2755 ld2 = OpMovRegMem(temp, rs_rX86_SP, current_src_offset + (bytes_to_move >> 1),
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002756 kMovHi128FP);
2757 } else {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002758 ld1 = OpMovRegMem(temp, rs_rX86_SP, current_src_offset, kMovU128FP);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002759 }
2760
2761 if (dest_is_16b_aligned) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002762 st1 = OpMovMemReg(rs_rX86_SP, current_dest_offset, temp, kMovA128FP);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002763 } else if (dest_is_8b_aligned) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002764 st1 = OpMovMemReg(rs_rX86_SP, current_dest_offset, temp, kMovLo128FP);
2765 st2 = OpMovMemReg(rs_rX86_SP, current_dest_offset + (bytes_to_move >> 1),
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002766 temp, kMovHi128FP);
2767 } else {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002768 st1 = OpMovMemReg(rs_rX86_SP, current_dest_offset, temp, kMovU128FP);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002769 }
2770
2771 // TODO If we could keep track of aliasing information for memory accesses that are wider
2772 // than 64-bit, we wouldn't need to set up a barrier.
2773 if (ld1 != nullptr) {
2774 if (ld2 != nullptr) {
2775 // For 64-bit load we can actually set up the aliasing information.
2776 AnnotateDalvikRegAccess(ld1, current_src_offset >> 2, true, true);
2777 AnnotateDalvikRegAccess(ld2, (current_src_offset + (bytes_to_move >> 1)) >> 2, true, true);
2778 } else {
2779 // Set barrier for 128-bit load.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002780 ld1->u.m.def_mask = &kEncodeAll;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002781 }
2782 }
2783 if (st1 != nullptr) {
2784 if (st2 != nullptr) {
2785 // For 64-bit store we can actually set up the aliasing information.
2786 AnnotateDalvikRegAccess(st1, current_dest_offset >> 2, false, true);
2787 AnnotateDalvikRegAccess(st2, (current_dest_offset + (bytes_to_move >> 1)) >> 2, false, true);
2788 } else {
2789 // Set barrier for 128-bit store.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002790 st1->u.m.def_mask = &kEncodeAll;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002791 }
2792 }
2793
2794 // Free the temporary used for the data movement.
2795 FreeTemp(temp);
2796 } else {
2797 // Moving 32-bits via general purpose register.
2798 bytes_to_move = sizeof(uint32_t);
2799
2800 // Instead of allocating a new temp, simply reuse one of the registers being used
2801 // for argument passing.
Andreas Gampeccc60262014-07-04 18:02:38 -07002802 RegStorage temp = TargetReg(kArg3, kNotWide);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002803
2804 // Now load the argument VR and store to the outs.
Chao-ying Fua77ee512014-07-01 17:43:41 -07002805 Load32Disp(rs_rX86_SP, current_src_offset, temp);
2806 Store32Disp(rs_rX86_SP, current_dest_offset, temp);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002807 }
2808
2809 current_src_offset += bytes_to_move;
2810 current_dest_offset += bytes_to_move;
2811 regs_left_to_pass_via_stack -= (bytes_to_move >> 2);
2812 }
2813 DCHECK_EQ(regs_left_to_pass_via_stack, 0);
2814 }
2815
2816 // Now handle rest not registers if they are
2817 if (in_to_reg_storage_mapping.IsThereStackMapped()) {
Andreas Gampeccc60262014-07-04 18:02:38 -07002818 RegStorage regSingle = TargetReg(kArg2, kNotWide);
2819 RegStorage regWide = TargetReg(kArg3, kWide);
Chao-ying Fub6564c12014-06-24 13:24:36 -07002820 for (int i = start_index;
2821 i < last_mapped_in + size_of_the_last_mapped + regs_left_to_pass_via_stack; i++) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002822 RegLocation rl_arg = info->args[i];
2823 rl_arg = UpdateRawLoc(rl_arg);
2824 RegStorage reg = in_to_reg_storage_mapping.Get(i);
2825 if (!reg.Valid()) {
2826 int out_offset = StackVisitor::GetOutVROffset(i, cu_->instruction_set);
2827
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002828 {
2829 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2830 if (rl_arg.wide) {
2831 if (rl_arg.location == kLocPhysReg) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002832 StoreBaseDisp(rs_rX86_SP, out_offset, rl_arg.reg, k64, kNotVolatile);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002833 } else {
2834 LoadValueDirectWideFixed(rl_arg, regWide);
Chao-ying Fua77ee512014-07-01 17:43:41 -07002835 StoreBaseDisp(rs_rX86_SP, out_offset, regWide, k64, kNotVolatile);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002836 }
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002837 } else {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002838 if (rl_arg.location == kLocPhysReg) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002839 StoreBaseDisp(rs_rX86_SP, out_offset, rl_arg.reg, k32, kNotVolatile);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002840 } else {
2841 LoadValueDirectFixed(rl_arg, regSingle);
Chao-ying Fua77ee512014-07-01 17:43:41 -07002842 StoreBaseDisp(rs_rX86_SP, out_offset, regSingle, k32, kNotVolatile);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002843 }
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002844 }
2845 }
2846 call_state = next_call_insn(cu_, info, call_state, target_method,
2847 vtable_idx, direct_code, direct_method, type);
2848 }
Chao-ying Fub6564c12014-06-24 13:24:36 -07002849 if (rl_arg.wide) {
2850 i++;
2851 }
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002852 }
2853 }
2854
2855 // Finish with mapped registers
2856 for (int i = start_index; i <= last_mapped_in; i++) {
2857 RegLocation rl_arg = info->args[i];
2858 rl_arg = UpdateRawLoc(rl_arg);
2859 RegStorage reg = in_to_reg_storage_mapping.Get(i);
2860 if (reg.Valid()) {
2861 if (rl_arg.wide) {
2862 LoadValueDirectWideFixed(rl_arg, reg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002863 } else {
2864 LoadValueDirectFixed(rl_arg, reg);
2865 }
2866 call_state = next_call_insn(cu_, info, call_state, target_method, vtable_idx,
2867 direct_code, direct_method, type);
2868 }
Chao-ying Fub6564c12014-06-24 13:24:36 -07002869 if (rl_arg.wide) {
2870 i++;
2871 }
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002872 }
2873
2874 call_state = next_call_insn(cu_, info, call_state, target_method, vtable_idx,
2875 direct_code, direct_method, type);
2876 if (pcrLabel) {
Dave Allison69dfe512014-07-11 17:11:58 +00002877 if (!cu_->compiler_driver->GetCompilerOptions().GetImplicitNullChecks()) {
Andreas Gampeccc60262014-07-04 18:02:38 -07002878 *pcrLabel = GenExplicitNullCheck(TargetReg(kArg1, kRef), info->opt_flags);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002879 } else {
2880 *pcrLabel = nullptr;
2881 // In lieu of generating a check for kArg1 being null, we need to
2882 // perform a load when doing implicit checks.
2883 RegStorage tmp = AllocTemp();
Andreas Gampeccc60262014-07-04 18:02:38 -07002884 Load32Disp(TargetReg(kArg1, kRef), 0, tmp);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002885 MarkPossibleNullPointerException(info->opt_flags);
2886 FreeTemp(tmp);
2887 }
2888 }
2889 return call_state;
2890}
2891
Andreas Gampe98430592014-07-27 19:44:50 -07002892bool X86Mir2Lir::GenInlinedCharAt(CallInfo* info) {
2893 // Location of reference to data array
2894 int value_offset = mirror::String::ValueOffset().Int32Value();
2895 // Location of count
2896 int count_offset = mirror::String::CountOffset().Int32Value();
2897 // Starting offset within data array
2898 int offset_offset = mirror::String::OffsetOffset().Int32Value();
2899 // Start of char data with array_
2900 int data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Int32Value();
2901
2902 RegLocation rl_obj = info->args[0];
2903 RegLocation rl_idx = info->args[1];
2904 rl_obj = LoadValue(rl_obj, kRefReg);
2905 // X86 wants to avoid putting a constant index into a register.
2906 if (!rl_idx.is_const) {
2907 rl_idx = LoadValue(rl_idx, kCoreReg);
2908 }
2909 RegStorage reg_max;
2910 GenNullCheck(rl_obj.reg, info->opt_flags);
2911 bool range_check = (!(info->opt_flags & MIR_IGNORE_RANGE_CHECK));
2912 LIR* range_check_branch = nullptr;
2913 RegStorage reg_off;
2914 RegStorage reg_ptr;
2915 if (range_check) {
2916 // On x86, we can compare to memory directly
2917 // Set up a launch pad to allow retry in case of bounds violation */
2918 if (rl_idx.is_const) {
2919 LIR* comparison;
2920 range_check_branch = OpCmpMemImmBranch(
2921 kCondUlt, RegStorage::InvalidReg(), rl_obj.reg, count_offset,
2922 mir_graph_->ConstantValue(rl_idx.orig_sreg), nullptr, &comparison);
2923 MarkPossibleNullPointerExceptionAfter(0, comparison);
2924 } else {
2925 OpRegMem(kOpCmp, rl_idx.reg, rl_obj.reg, count_offset);
2926 MarkPossibleNullPointerException(0);
2927 range_check_branch = OpCondBranch(kCondUge, nullptr);
2928 }
2929 }
2930 reg_off = AllocTemp();
2931 reg_ptr = AllocTempRef();
2932 Load32Disp(rl_obj.reg, offset_offset, reg_off);
2933 LoadRefDisp(rl_obj.reg, value_offset, reg_ptr, kNotVolatile);
2934 if (rl_idx.is_const) {
2935 OpRegImm(kOpAdd, reg_off, mir_graph_->ConstantValue(rl_idx.orig_sreg));
2936 } else {
2937 OpRegReg(kOpAdd, reg_off, rl_idx.reg);
2938 }
2939 FreeTemp(rl_obj.reg);
2940 if (rl_idx.location == kLocPhysReg) {
2941 FreeTemp(rl_idx.reg);
2942 }
2943 RegLocation rl_dest = InlineTarget(info);
2944 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
2945 LoadBaseIndexedDisp(reg_ptr, reg_off, 1, data_offset, rl_result.reg, kUnsignedHalf);
2946 FreeTemp(reg_off);
2947 FreeTemp(reg_ptr);
2948 StoreValue(rl_dest, rl_result);
2949 if (range_check) {
2950 DCHECK(range_check_branch != nullptr);
2951 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've already null checked.
2952 AddIntrinsicSlowPath(info, range_check_branch);
2953 }
2954 return true;
2955}
2956
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002957bool X86Mir2Lir::GenInlinedCurrentThread(CallInfo* info) {
2958 RegLocation rl_dest = InlineTarget(info);
2959
2960 // Early exit if the result is unused.
2961 if (rl_dest.orig_sreg < 0) {
2962 return true;
2963 }
2964
2965 RegLocation rl_result = EvalLoc(rl_dest, kRefReg, true);
2966
2967 if (cu_->target64) {
2968 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<8>());
2969 } else {
2970 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<4>());
2971 }
2972
2973 StoreValue(rl_dest, rl_result);
2974 return true;
2975}
2976
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002977/**
2978 * Lock temp registers for explicit usage. Registers will be freed in destructor.
2979 */
2980X86Mir2Lir::ExplicitTempRegisterLock::ExplicitTempRegisterLock(X86Mir2Lir* mir_to_lir,
2981 int n_regs, ...) :
2982 temp_regs_(n_regs),
2983 mir_to_lir_(mir_to_lir) {
2984 va_list regs;
2985 va_start(regs, n_regs);
2986 for (int i = 0; i < n_regs; i++) {
2987 RegStorage reg = *(va_arg(regs, RegStorage*));
2988 RegisterInfo* info = mir_to_lir_->GetRegInfo(reg);
2989
2990 // Make sure we don't have promoted register here.
2991 DCHECK(info->IsTemp());
2992
2993 temp_regs_.push_back(reg);
2994 mir_to_lir_->FlushReg(reg);
2995
2996 if (reg.IsPair()) {
2997 RegStorage partner = info->Partner();
2998 temp_regs_.push_back(partner);
2999 mir_to_lir_->FlushReg(partner);
3000 }
3001
3002 mir_to_lir_->Clobber(reg);
3003 mir_to_lir_->LockTemp(reg);
3004 }
3005
3006 va_end(regs);
3007}
3008
3009/*
3010 * Free all locked registers.
3011 */
3012X86Mir2Lir::ExplicitTempRegisterLock::~ExplicitTempRegisterLock() {
3013 // Free all locked temps.
3014 for (auto it : temp_regs_) {
3015 mir_to_lir_->FreeTemp(it);
3016 }
3017}
3018
Brian Carlstrom7934ac22013-07-26 10:54:15 -07003019} // namespace art