blob: 5d14869287609c27e308c3c06a7ba504738fe156 [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
Elliott Hughes8366ca02014-11-17 12:02:05 -080021#include "arch/instruction_set_features.h"
Andreas Gampe53c913b2014-08-12 23:19:23 -070022#include "backend_x86.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070023#include "codegen_x86.h"
24#include "dex/compiler_internals.h"
25#include "dex/quick/mir_to_lir-inl.h"
buzbeeb5860fb2014-06-21 15:31:01 -070026#include "dex/reg_storage_eq.h"
Ian Rogers7e70b002014-10-08 11:47:24 -070027#include "mirror/array-inl.h"
Vladimir Markof4da6752014-08-01 19:04:18 +010028#include "mirror/art_method.h"
Mark Mendelle19c91f2014-02-25 08:19:08 -080029#include "mirror/string.h"
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -070030#include "oat.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070031#include "x86_lir.h"
Tong Shen547cdfd2014-08-05 01:54:19 -070032#include "utils/dwarf_cfi.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070033
Brian Carlstrom7940e442013-07-12 13:46:57 -070034namespace art {
35
Vladimir Marko089142c2014-06-05 10:57:05 +010036static constexpr RegStorage core_regs_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070037 rs_rAX, rs_rCX, rs_rDX, rs_rBX, rs_rX86_SP_32, rs_rBP, rs_rSI, rs_rDI,
38};
Vladimir Marko089142c2014-06-05 10:57:05 +010039static constexpr RegStorage core_regs_arr_64[] = {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +070040 rs_rAX, rs_rCX, rs_rDX, rs_rBX, rs_rX86_SP_32, rs_rBP, rs_rSI, rs_rDI,
buzbee091cc402014-03-31 10:14:40 -070041 rs_r8, rs_r9, rs_r10, rs_r11, rs_r12, rs_r13, rs_r14, rs_r15
Brian Carlstrom7940e442013-07-12 13:46:57 -070042};
Vladimir Marko089142c2014-06-05 10:57:05 +010043static constexpr RegStorage core_regs_arr_64q[] = {
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070044 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 +070045 rs_r8q, rs_r9q, rs_r10q, rs_r11q, rs_r12q, rs_r13q, rs_r14q, rs_r15q
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070046};
Vladimir Marko089142c2014-06-05 10:57:05 +010047static constexpr RegStorage sp_regs_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070048 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
49};
Vladimir Marko089142c2014-06-05 10:57:05 +010050static constexpr RegStorage sp_regs_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -070051 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
buzbee091cc402014-03-31 10:14:40 -070052 rs_fr8, rs_fr9, rs_fr10, rs_fr11, rs_fr12, rs_fr13, rs_fr14, rs_fr15
Brian Carlstrom7940e442013-07-12 13:46:57 -070053};
Vladimir Marko089142c2014-06-05 10:57:05 +010054static constexpr RegStorage dp_regs_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070055 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
56};
Vladimir Marko089142c2014-06-05 10:57:05 +010057static constexpr RegStorage dp_regs_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -070058 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
buzbee091cc402014-03-31 10:14:40 -070059 rs_dr8, rs_dr9, rs_dr10, rs_dr11, rs_dr12, rs_dr13, rs_dr14, rs_dr15
Brian Carlstrom7940e442013-07-12 13:46:57 -070060};
Serguei Katkovc3801912014-07-08 17:21:53 +070061static constexpr RegStorage xp_regs_arr_32[] = {
62 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
63};
64static constexpr RegStorage xp_regs_arr_64[] = {
65 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
66 rs_xr8, rs_xr9, rs_xr10, rs_xr11, rs_xr12, rs_xr13, rs_xr14, rs_xr15
67};
Vladimir Marko089142c2014-06-05 10:57:05 +010068static constexpr RegStorage reserved_regs_arr_32[] = {rs_rX86_SP_32};
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +070069static constexpr RegStorage reserved_regs_arr_64[] = {rs_rX86_SP_32};
Vladimir Marko089142c2014-06-05 10:57:05 +010070static constexpr RegStorage reserved_regs_arr_64q[] = {rs_rX86_SP_64};
71static constexpr RegStorage core_temps_arr_32[] = {rs_rAX, rs_rCX, rs_rDX, rs_rBX};
72static constexpr RegStorage core_temps_arr_64[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070073 rs_rAX, rs_rCX, rs_rDX, rs_rSI, rs_rDI,
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070074 rs_r8, rs_r9, rs_r10, rs_r11
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070075};
Serguei Katkovc3801912014-07-08 17:21:53 +070076
77// How to add register to be available for promotion:
78// 1) Remove register from array defining temp
79// 2) Update ClobberCallerSave
80// 3) Update JNI compiler ABI:
81// 3.1) add reg in JniCallingConvention method
82// 3.2) update CoreSpillMask/FpSpillMask
83// 4) Update entrypoints
84// 4.1) Update constants in asm_support_x86_64.h for new frame size
85// 4.2) Remove entry in SmashCallerSaves
86// 4.3) Update jni_entrypoints to spill/unspill new callee save reg
87// 4.4) Update quick_entrypoints to spill/unspill new callee save reg
88// 5) Update runtime ABI
89// 5.1) Update quick_method_frame_info with new required spills
90// 5.2) Update QuickArgumentVisitor with new offsets to gprs and xmms
91// Note that you cannot use register corresponding to incoming args
92// according to ABI and QCG needs one additional XMM temp for
93// bulk copy in preparation to call.
Vladimir Marko089142c2014-06-05 10:57:05 +010094static constexpr RegStorage core_temps_arr_64q[] = {
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070095 rs_r0q, rs_r1q, rs_r2q, rs_r6q, rs_r7q,
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070096 rs_r8q, rs_r9q, rs_r10q, rs_r11q
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070097};
Vladimir Marko089142c2014-06-05 10:57:05 +010098static constexpr RegStorage sp_temps_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070099 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
100};
Vladimir Marko089142c2014-06-05 10:57:05 +0100101static constexpr RegStorage sp_temps_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -0700102 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
Serguei Katkovc3801912014-07-08 17:21:53 +0700103 rs_fr8, rs_fr9, rs_fr10, rs_fr11
buzbee091cc402014-03-31 10:14:40 -0700104};
Vladimir Marko089142c2014-06-05 10:57:05 +0100105static constexpr RegStorage dp_temps_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700106 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
107};
Vladimir Marko089142c2014-06-05 10:57:05 +0100108static constexpr RegStorage dp_temps_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -0700109 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
Serguei Katkovc3801912014-07-08 17:21:53 +0700110 rs_dr8, rs_dr9, rs_dr10, rs_dr11
buzbee091cc402014-03-31 10:14:40 -0700111};
112
Vladimir Marko089142c2014-06-05 10:57:05 +0100113static constexpr RegStorage xp_temps_arr_32[] = {
Mark Mendellfe945782014-05-22 09:52:36 -0400114 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
115};
Vladimir Marko089142c2014-06-05 10:57:05 +0100116static constexpr RegStorage xp_temps_arr_64[] = {
Mark Mendellfe945782014-05-22 09:52:36 -0400117 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
Serguei Katkovc3801912014-07-08 17:21:53 +0700118 rs_xr8, rs_xr9, rs_xr10, rs_xr11
Mark Mendellfe945782014-05-22 09:52:36 -0400119};
120
Vladimir Marko089142c2014-06-05 10:57:05 +0100121static constexpr ArrayRef<const RegStorage> empty_pool;
122static constexpr ArrayRef<const RegStorage> core_regs_32(core_regs_arr_32);
123static constexpr ArrayRef<const RegStorage> core_regs_64(core_regs_arr_64);
124static constexpr ArrayRef<const RegStorage> core_regs_64q(core_regs_arr_64q);
125static constexpr ArrayRef<const RegStorage> sp_regs_32(sp_regs_arr_32);
126static constexpr ArrayRef<const RegStorage> sp_regs_64(sp_regs_arr_64);
127static constexpr ArrayRef<const RegStorage> dp_regs_32(dp_regs_arr_32);
128static constexpr ArrayRef<const RegStorage> dp_regs_64(dp_regs_arr_64);
Serguei Katkovc3801912014-07-08 17:21:53 +0700129static constexpr ArrayRef<const RegStorage> xp_regs_32(xp_regs_arr_32);
130static constexpr ArrayRef<const RegStorage> xp_regs_64(xp_regs_arr_64);
Vladimir Marko089142c2014-06-05 10:57:05 +0100131static constexpr ArrayRef<const RegStorage> reserved_regs_32(reserved_regs_arr_32);
132static constexpr ArrayRef<const RegStorage> reserved_regs_64(reserved_regs_arr_64);
133static constexpr ArrayRef<const RegStorage> reserved_regs_64q(reserved_regs_arr_64q);
134static constexpr ArrayRef<const RegStorage> core_temps_32(core_temps_arr_32);
135static constexpr ArrayRef<const RegStorage> core_temps_64(core_temps_arr_64);
136static constexpr ArrayRef<const RegStorage> core_temps_64q(core_temps_arr_64q);
137static constexpr ArrayRef<const RegStorage> sp_temps_32(sp_temps_arr_32);
138static constexpr ArrayRef<const RegStorage> sp_temps_64(sp_temps_arr_64);
139static constexpr ArrayRef<const RegStorage> dp_temps_32(dp_temps_arr_32);
140static constexpr ArrayRef<const RegStorage> dp_temps_64(dp_temps_arr_64);
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700141
Vladimir Marko089142c2014-06-05 10:57:05 +0100142static constexpr ArrayRef<const RegStorage> xp_temps_32(xp_temps_arr_32);
143static constexpr ArrayRef<const RegStorage> xp_temps_64(xp_temps_arr_64);
Mark Mendellfe945782014-05-22 09:52:36 -0400144
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700145RegLocation X86Mir2Lir::LocCReturn() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000146 return x86_loc_c_return;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700147}
148
buzbeea0cd2d72014-06-01 09:33:49 -0700149RegLocation X86Mir2Lir::LocCReturnRef() {
Chao-ying Fua77ee512014-07-01 17:43:41 -0700150 return cu_->target64 ? x86_64_loc_c_return_ref : x86_loc_c_return_ref;
buzbeea0cd2d72014-06-01 09:33:49 -0700151}
152
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700153RegLocation X86Mir2Lir::LocCReturnWide() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700154 return cu_->target64 ? x86_64_loc_c_return_wide : x86_loc_c_return_wide;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700155}
156
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700157RegLocation X86Mir2Lir::LocCReturnFloat() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000158 return x86_loc_c_return_float;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700159}
160
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700161RegLocation X86Mir2Lir::LocCReturnDouble() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000162 return x86_loc_c_return_double;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700163}
164
Ian Rogersb28c1c02014-11-08 11:21:21 -0800165// 32-bit reg storage locations for 32-bit targets.
166static const RegStorage RegStorage32FromSpecialTargetRegister_Target32[] {
167 RegStorage::InvalidReg(), // kSelf - Thread pointer.
168 RegStorage::InvalidReg(), // kSuspend - Used to reduce suspend checks for some targets.
169 RegStorage::InvalidReg(), // kLr - no register as the return address is pushed on entry.
170 RegStorage::InvalidReg(), // kPc - not exposed on X86 see kX86StartOfMethod.
171 rs_rX86_SP_32, // kSp
172 rs_rAX, // kArg0
173 rs_rCX, // kArg1
174 rs_rDX, // kArg2
175 rs_rBX, // kArg3
176 RegStorage::InvalidReg(), // kArg4
177 RegStorage::InvalidReg(), // kArg5
178 RegStorage::InvalidReg(), // kArg6
179 RegStorage::InvalidReg(), // kArg7
180 rs_rAX, // kFArg0
181 rs_rCX, // kFArg1
182 rs_rDX, // kFArg2
183 rs_rBX, // kFArg3
184 RegStorage::InvalidReg(), // kFArg4
185 RegStorage::InvalidReg(), // kFArg5
186 RegStorage::InvalidReg(), // kFArg6
187 RegStorage::InvalidReg(), // kFArg7
188 RegStorage::InvalidReg(), // kFArg8
189 RegStorage::InvalidReg(), // kFArg9
190 RegStorage::InvalidReg(), // kFArg10
191 RegStorage::InvalidReg(), // kFArg11
192 RegStorage::InvalidReg(), // kFArg12
193 RegStorage::InvalidReg(), // kFArg13
194 RegStorage::InvalidReg(), // kFArg14
195 RegStorage::InvalidReg(), // kFArg15
196 rs_rAX, // kRet0
197 rs_rDX, // kRet1
198 rs_rAX, // kInvokeTgt
199 rs_rAX, // kHiddenArg - used to hold the method index before copying to fr0.
200 rs_fr0, // kHiddenFpArg
201 rs_rCX, // kCount
202};
203
204// 32-bit reg storage locations for 64-bit targets.
205static const RegStorage RegStorage32FromSpecialTargetRegister_Target64[] {
206 RegStorage::InvalidReg(), // kSelf - Thread pointer.
207 RegStorage::InvalidReg(), // kSuspend - Used to reduce suspend checks for some targets.
208 RegStorage::InvalidReg(), // kLr - no register as the return address is pushed on entry.
Mark Mendell27dee8b2014-12-01 19:06:12 -0500209 RegStorage(kRIPReg), // kPc
Ian Rogersb28c1c02014-11-08 11:21:21 -0800210 rs_rX86_SP_32, // kSp
211 rs_rDI, // kArg0
212 rs_rSI, // kArg1
213 rs_rDX, // kArg2
214 rs_rCX, // kArg3
215 rs_r8, // kArg4
216 rs_r9, // kArg5
217 RegStorage::InvalidReg(), // kArg6
218 RegStorage::InvalidReg(), // kArg7
219 rs_fr0, // kFArg0
220 rs_fr1, // kFArg1
221 rs_fr2, // kFArg2
222 rs_fr3, // kFArg3
223 rs_fr4, // kFArg4
224 rs_fr5, // kFArg5
225 rs_fr6, // kFArg6
226 rs_fr7, // kFArg7
227 RegStorage::InvalidReg(), // kFArg8
228 RegStorage::InvalidReg(), // kFArg9
229 RegStorage::InvalidReg(), // kFArg10
230 RegStorage::InvalidReg(), // kFArg11
231 RegStorage::InvalidReg(), // kFArg12
232 RegStorage::InvalidReg(), // kFArg13
233 RegStorage::InvalidReg(), // kFArg14
234 RegStorage::InvalidReg(), // kFArg15
235 rs_rAX, // kRet0
236 rs_rDX, // kRet1
237 rs_rAX, // kInvokeTgt
238 rs_rAX, // kHiddenArg
239 RegStorage::InvalidReg(), // kHiddenFpArg
240 rs_rCX, // kCount
241};
242static_assert(arraysize(RegStorage32FromSpecialTargetRegister_Target32) ==
243 arraysize(RegStorage32FromSpecialTargetRegister_Target64),
244 "Mismatch in RegStorage array sizes");
245
Chao-ying Fua77ee512014-07-01 17:43:41 -0700246// Return a target-dependent special register for 32-bit.
Ian Rogersb28c1c02014-11-08 11:21:21 -0800247RegStorage X86Mir2Lir::TargetReg32(SpecialTargetRegister reg) const {
248 DCHECK_EQ(RegStorage32FromSpecialTargetRegister_Target32[kCount], rs_rCX);
249 DCHECK_EQ(RegStorage32FromSpecialTargetRegister_Target64[kCount], rs_rCX);
250 DCHECK_LT(reg, arraysize(RegStorage32FromSpecialTargetRegister_Target32));
251 return cu_->target64 ? RegStorage32FromSpecialTargetRegister_Target64[reg]
252 : RegStorage32FromSpecialTargetRegister_Target32[reg];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700253}
254
Chao-ying Fua77ee512014-07-01 17:43:41 -0700255RegStorage X86Mir2Lir::TargetReg(SpecialTargetRegister reg) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700256 UNUSED(reg);
Chao-ying Fua77ee512014-07-01 17:43:41 -0700257 LOG(FATAL) << "Do not use this function!!!";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700258 UNREACHABLE();
Chao-ying Fua77ee512014-07-01 17:43:41 -0700259}
260
Brian Carlstrom7940e442013-07-12 13:46:57 -0700261/*
262 * Decode the register id.
263 */
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100264ResourceMask X86Mir2Lir::GetRegMaskCommon(const RegStorage& reg) const {
265 /* Double registers in x86 are just a single FP register. This is always just a single bit. */
266 return ResourceMask::Bit(
267 /* FP register starts at bit position 16 */
268 ((reg.IsFloat() || reg.StorageSize() > 8) ? kX86FPReg0 : 0) + reg.GetRegNum());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700269}
270
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100271ResourceMask X86Mir2Lir::GetPCUseDefEncoding() const {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100272 return kEncodeNone;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700273}
274
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100275void X86Mir2Lir::SetupTargetResourceMasks(LIR* lir, uint64_t flags,
276 ResourceMask* use_mask, ResourceMask* def_mask) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700277 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
buzbeeb48819d2013-09-14 16:15:25 -0700278 DCHECK(!lir->flags.use_def_invalid);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700279
280 // X86-specific resource map setup here.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700281 if (flags & REG_USE_SP) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100282 use_mask->SetBit(kX86RegSP);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700283 }
284
285 if (flags & REG_DEF_SP) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100286 def_mask->SetBit(kX86RegSP);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700287 }
288
289 if (flags & REG_DEFA) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100290 SetupRegMask(def_mask, rs_rAX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700291 }
292
293 if (flags & REG_DEFD) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100294 SetupRegMask(def_mask, rs_rDX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700295 }
296 if (flags & REG_USEA) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100297 SetupRegMask(use_mask, rs_rAX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700298 }
299
300 if (flags & REG_USEC) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100301 SetupRegMask(use_mask, rs_rCX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700302 }
303
304 if (flags & REG_USED) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100305 SetupRegMask(use_mask, rs_rDX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700306 }
Vladimir Marko70b797d2013-12-03 15:25:24 +0000307
308 if (flags & REG_USEB) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100309 SetupRegMask(use_mask, rs_rBX.GetReg());
Vladimir Marko70b797d2013-12-03 15:25:24 +0000310 }
Mark Mendell4028a6c2014-02-19 20:06:20 -0800311
312 // Fixup hard to describe instruction: Uses rAX, rCX, rDI; sets rDI.
313 if (lir->opcode == kX86RepneScasw) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100314 SetupRegMask(use_mask, rs_rAX.GetReg());
315 SetupRegMask(use_mask, rs_rCX.GetReg());
316 SetupRegMask(use_mask, rs_rDI.GetReg());
317 SetupRegMask(def_mask, rs_rDI.GetReg());
Mark Mendell4028a6c2014-02-19 20:06:20 -0800318 }
Serguei Katkove90501d2014-03-12 15:56:54 +0700319
320 if (flags & USE_FP_STACK) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100321 use_mask->SetBit(kX86FPStack);
322 def_mask->SetBit(kX86FPStack);
Serguei Katkove90501d2014-03-12 15:56:54 +0700323 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700324}
325
326/* For dumping instructions */
327static const char* x86RegName[] = {
328 "rax", "rcx", "rdx", "rbx", "rsp", "rbp", "rsi", "rdi",
329 "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15"
330};
331
332static const char* x86CondName[] = {
333 "O",
334 "NO",
335 "B/NAE/C",
336 "NB/AE/NC",
337 "Z/EQ",
338 "NZ/NE",
339 "BE/NA",
340 "NBE/A",
341 "S",
342 "NS",
343 "P/PE",
344 "NP/PO",
345 "L/NGE",
346 "NL/GE",
347 "LE/NG",
348 "NLE/G"
349};
350
351/*
352 * Interpret a format string and build a string no longer than size
353 * See format key in Assemble.cc.
354 */
355std::string X86Mir2Lir::BuildInsnString(const char *fmt, LIR *lir, unsigned char* base_addr) {
356 std::string buf;
357 size_t i = 0;
358 size_t fmt_len = strlen(fmt);
359 while (i < fmt_len) {
360 if (fmt[i] != '!') {
361 buf += fmt[i];
362 i++;
363 } else {
364 i++;
365 DCHECK_LT(i, fmt_len);
366 char operand_number_ch = fmt[i];
367 i++;
368 if (operand_number_ch == '!') {
369 buf += "!";
370 } else {
371 int operand_number = operand_number_ch - '0';
372 DCHECK_LT(operand_number, 6); // Expect upto 6 LIR operands.
373 DCHECK_LT(i, fmt_len);
374 int operand = lir->operands[operand_number];
375 switch (fmt[i]) {
376 case 'c':
377 DCHECK_LT(static_cast<size_t>(operand), sizeof(x86CondName));
378 buf += x86CondName[operand];
379 break;
380 case 'd':
381 buf += StringPrintf("%d", operand);
382 break;
Yixin Shou5192cbb2014-07-01 13:48:17 -0400383 case 'q': {
384 int64_t value = static_cast<int64_t>(static_cast<int64_t>(operand) << 32 |
385 static_cast<uint32_t>(lir->operands[operand_number+1]));
386 buf +=StringPrintf("%" PRId64, value);
Haitao Fenge70f1792014-08-09 08:31:02 +0800387 break;
Yixin Shou5192cbb2014-07-01 13:48:17 -0400388 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700389 case 'p': {
buzbee0d829482013-10-11 15:24:55 -0700390 EmbeddedData *tab_rec = reinterpret_cast<EmbeddedData*>(UnwrapPointer(operand));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700391 buf += StringPrintf("0x%08x", tab_rec->offset);
392 break;
393 }
394 case 'r':
buzbee091cc402014-03-31 10:14:40 -0700395 if (RegStorage::IsFloat(operand)) {
396 int fp_reg = RegStorage::RegNum(operand);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700397 buf += StringPrintf("xmm%d", fp_reg);
398 } else {
buzbee091cc402014-03-31 10:14:40 -0700399 int reg_num = RegStorage::RegNum(operand);
400 DCHECK_LT(static_cast<size_t>(reg_num), sizeof(x86RegName));
401 buf += x86RegName[reg_num];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700402 }
403 break;
404 case 't':
Ian Rogers107c31e2014-01-23 20:55:29 -0800405 buf += StringPrintf("0x%08" PRIxPTR " (L%p)",
406 reinterpret_cast<uintptr_t>(base_addr) + lir->offset + operand,
407 lir->target);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700408 break;
409 default:
410 buf += StringPrintf("DecodeError '%c'", fmt[i]);
411 break;
412 }
413 i++;
414 }
415 }
416 }
417 return buf;
418}
419
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100420void X86Mir2Lir::DumpResourceMask(LIR *x86LIR, const ResourceMask& mask, const char *prefix) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700421 char buf[256];
422 buf[0] = 0;
423
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100424 if (mask.Equals(kEncodeAll)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700425 strcpy(buf, "all");
426 } else {
427 char num[8];
428 int i;
429
430 for (i = 0; i < kX86RegEnd; i++) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100431 if (mask.HasBit(i)) {
Ian Rogers988e6ea2014-01-08 11:30:50 -0800432 snprintf(num, arraysize(num), "%d ", i);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700433 strcat(buf, num);
434 }
435 }
436
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100437 if (mask.HasBit(ResourceMask::kCCode)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700438 strcat(buf, "cc ");
439 }
440 /* Memory bits */
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100441 if (x86LIR && (mask.HasBit(ResourceMask::kDalvikReg))) {
Ian Rogers988e6ea2014-01-08 11:30:50 -0800442 snprintf(buf + strlen(buf), arraysize(buf) - strlen(buf), "dr%d%s",
443 DECODE_ALIAS_INFO_REG(x86LIR->flags.alias_info),
444 (DECODE_ALIAS_INFO_WIDE(x86LIR->flags.alias_info)) ? "(+1)" : "");
Brian Carlstrom7940e442013-07-12 13:46:57 -0700445 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100446 if (mask.HasBit(ResourceMask::kLiteral)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700447 strcat(buf, "lit ");
448 }
449
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100450 if (mask.HasBit(ResourceMask::kHeapRef)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700451 strcat(buf, "heap ");
452 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100453 if (mask.HasBit(ResourceMask::kMustNotAlias)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700454 strcat(buf, "noalias ");
455 }
456 }
457 if (buf[0]) {
458 LOG(INFO) << prefix << ": " << buf;
459 }
460}
461
462void X86Mir2Lir::AdjustSpillMask() {
463 // Adjustment for LR spilling, x86 has no LR so nothing to do here
buzbee091cc402014-03-31 10:14:40 -0700464 core_spill_mask_ |= (1 << rs_rRET.GetRegNum());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700465 num_core_spills_++;
466}
467
Mark Mendelle87f9b52014-04-30 14:13:18 -0400468RegStorage X86Mir2Lir::AllocateByteRegister() {
Chao-ying Fu7e399fd2014-06-10 18:11:11 -0700469 RegStorage reg = AllocTypedTemp(false, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +0700470 if (!cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800471 DCHECK_LT(reg.GetRegNum(), rs_rX86_SP_32.GetRegNum());
Chao-ying Fu7e399fd2014-06-10 18:11:11 -0700472 }
473 return reg;
474}
475
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700476RegStorage X86Mir2Lir::Get128BitRegister(RegStorage reg) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -0700477 return GetRegInfo(reg)->Master()->GetReg();
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700478}
479
Ian Rogersb28c1c02014-11-08 11:21:21 -0800480bool X86Mir2Lir::IsByteRegister(RegStorage reg) const {
481 return cu_->target64 || reg.GetRegNum() < rs_rX86_SP_32.GetRegNum();
Mark Mendelle87f9b52014-04-30 14:13:18 -0400482}
483
Brian Carlstrom7940e442013-07-12 13:46:57 -0700484/* Clobber all regs that might be used by an external C call */
Vladimir Marko31c2aac2013-12-09 16:31:19 +0000485void X86Mir2Lir::ClobberCallerSave() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700486 if (cu_->target64) {
Serguei Katkovc3801912014-07-08 17:21:53 +0700487 Clobber(rs_rAX);
488 Clobber(rs_rCX);
489 Clobber(rs_rDX);
490 Clobber(rs_rSI);
491 Clobber(rs_rDI);
492
Chao-ying Fu35ec2b52014-06-16 16:40:31 -0700493 Clobber(rs_r8);
494 Clobber(rs_r9);
495 Clobber(rs_r10);
496 Clobber(rs_r11);
497
498 Clobber(rs_fr8);
499 Clobber(rs_fr9);
500 Clobber(rs_fr10);
501 Clobber(rs_fr11);
Serguei Katkovc3801912014-07-08 17:21:53 +0700502 } else {
503 Clobber(rs_rAX);
504 Clobber(rs_rCX);
505 Clobber(rs_rDX);
506 Clobber(rs_rBX);
Chao-ying Fu35ec2b52014-06-16 16:40:31 -0700507 }
Serguei Katkovc3801912014-07-08 17:21:53 +0700508
509 Clobber(rs_fr0);
510 Clobber(rs_fr1);
511 Clobber(rs_fr2);
512 Clobber(rs_fr3);
513 Clobber(rs_fr4);
514 Clobber(rs_fr5);
515 Clobber(rs_fr6);
516 Clobber(rs_fr7);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700517}
518
519RegLocation X86Mir2Lir::GetReturnWideAlt() {
520 RegLocation res = LocCReturnWide();
Ian Rogersb28c1c02014-11-08 11:21:21 -0800521 DCHECK_EQ(res.reg.GetLowReg(), rs_rAX.GetReg());
522 DCHECK_EQ(res.reg.GetHighReg(), rs_rDX.GetReg());
buzbee091cc402014-03-31 10:14:40 -0700523 Clobber(rs_rAX);
524 Clobber(rs_rDX);
525 MarkInUse(rs_rAX);
526 MarkInUse(rs_rDX);
527 MarkWide(res.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700528 return res;
529}
530
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700531RegLocation X86Mir2Lir::GetReturnAlt() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700532 RegLocation res = LocCReturn();
buzbee091cc402014-03-31 10:14:40 -0700533 res.reg.SetReg(rs_rDX.GetReg());
534 Clobber(rs_rDX);
535 MarkInUse(rs_rDX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700536 return res;
537}
538
Brian Carlstrom7940e442013-07-12 13:46:57 -0700539/* To be used when explicitly managing register use */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700540void X86Mir2Lir::LockCallTemps() {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800541 LockTemp(TargetReg32(kArg0));
542 LockTemp(TargetReg32(kArg1));
543 LockTemp(TargetReg32(kArg2));
544 LockTemp(TargetReg32(kArg3));
Elena Sayapinadd644502014-07-01 18:39:52 +0700545 if (cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800546 LockTemp(TargetReg32(kArg4));
547 LockTemp(TargetReg32(kArg5));
548 LockTemp(TargetReg32(kFArg0));
549 LockTemp(TargetReg32(kFArg1));
550 LockTemp(TargetReg32(kFArg2));
551 LockTemp(TargetReg32(kFArg3));
552 LockTemp(TargetReg32(kFArg4));
553 LockTemp(TargetReg32(kFArg5));
554 LockTemp(TargetReg32(kFArg6));
555 LockTemp(TargetReg32(kFArg7));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700556 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700557}
558
559/* To be used when explicitly managing register use */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700560void X86Mir2Lir::FreeCallTemps() {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800561 FreeTemp(TargetReg32(kArg0));
562 FreeTemp(TargetReg32(kArg1));
563 FreeTemp(TargetReg32(kArg2));
564 FreeTemp(TargetReg32(kArg3));
Elena Sayapinadd644502014-07-01 18:39:52 +0700565 if (cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800566 FreeTemp(TargetReg32(kArg4));
567 FreeTemp(TargetReg32(kArg5));
568 FreeTemp(TargetReg32(kFArg0));
569 FreeTemp(TargetReg32(kFArg1));
570 FreeTemp(TargetReg32(kFArg2));
571 FreeTemp(TargetReg32(kFArg3));
572 FreeTemp(TargetReg32(kFArg4));
573 FreeTemp(TargetReg32(kFArg5));
574 FreeTemp(TargetReg32(kFArg6));
575 FreeTemp(TargetReg32(kFArg7));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700576 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700577}
578
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800579bool X86Mir2Lir::ProvidesFullMemoryBarrier(X86OpCode opcode) {
580 switch (opcode) {
581 case kX86LockCmpxchgMR:
582 case kX86LockCmpxchgAR:
Ian Rogers0f9b9c52014-06-09 01:32:12 -0700583 case kX86LockCmpxchg64M:
584 case kX86LockCmpxchg64A:
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800585 case kX86XchgMR:
586 case kX86Mfence:
587 // Atomic memory instructions provide full barrier.
588 return true;
589 default:
590 break;
591 }
592
593 // Conservative if cannot prove it provides full barrier.
594 return false;
595}
596
Andreas Gampeb14329f2014-05-15 11:16:06 -0700597bool X86Mir2Lir::GenMemBarrier(MemBarrierKind barrier_kind) {
Elliott Hughes8366ca02014-11-17 12:02:05 -0800598 if (!cu_->GetInstructionSetFeatures()->IsSmp()) {
599 return false;
600 }
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800601 // Start off with using the last LIR as the barrier. If it is not enough, then we will update it.
602 LIR* mem_barrier = last_lir_insn_;
603
Andreas Gampeb14329f2014-05-15 11:16:06 -0700604 bool ret = false;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800605 /*
Hans Boehm48f5c472014-06-27 14:50:10 -0700606 * According to the JSR-133 Cookbook, for x86 only StoreLoad/AnyAny barriers need memory fence.
607 * All other barriers (LoadAny, AnyStore, StoreStore) are nops due to the x86 memory model.
608 * 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 -0800609 */
Hans Boehm48f5c472014-06-27 14:50:10 -0700610 if (barrier_kind == kAnyAny) {
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800611 // If no LIR exists already that can be used a barrier, then generate an mfence.
612 if (mem_barrier == nullptr) {
613 mem_barrier = NewLIR0(kX86Mfence);
Andreas Gampeb14329f2014-05-15 11:16:06 -0700614 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800615 }
616
617 // If last instruction does not provide full barrier, then insert an mfence.
618 if (ProvidesFullMemoryBarrier(static_cast<X86OpCode>(mem_barrier->opcode)) == false) {
619 mem_barrier = NewLIR0(kX86Mfence);
Andreas Gampeb14329f2014-05-15 11:16:06 -0700620 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800621 }
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -0700622 } else if (barrier_kind == kNTStoreStore) {
623 mem_barrier = NewLIR0(kX86Sfence);
624 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800625 }
626
627 // Now ensure that a scheduling barrier is in place.
628 if (mem_barrier == nullptr) {
629 GenBarrier();
630 } else {
631 // Mark as a scheduling barrier.
632 DCHECK(!mem_barrier->flags.use_def_invalid);
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100633 mem_barrier->u.m.def_mask = &kEncodeAll;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800634 }
Andreas Gampeb14329f2014-05-15 11:16:06 -0700635 return ret;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700636}
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000637
Brian Carlstrom7940e442013-07-12 13:46:57 -0700638void X86Mir2Lir::CompilerInitializeRegAlloc() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700639 if (cu_->target64) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100640 reg_pool_.reset(new (arena_) RegisterPool(this, arena_, core_regs_64, core_regs_64q, sp_regs_64,
641 dp_regs_64, reserved_regs_64, reserved_regs_64q,
642 core_temps_64, core_temps_64q,
643 sp_temps_64, dp_temps_64));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700644 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100645 reg_pool_.reset(new (arena_) RegisterPool(this, arena_, core_regs_32, empty_pool, sp_regs_32,
646 dp_regs_32, reserved_regs_32, empty_pool,
647 core_temps_32, empty_pool,
648 sp_temps_32, dp_temps_32));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700649 }
buzbee091cc402014-03-31 10:14:40 -0700650
651 // Target-specific adjustments.
652
Mark Mendellfe945782014-05-22 09:52:36 -0400653 // Add in XMM registers.
Serguei Katkovc3801912014-07-08 17:21:53 +0700654 const ArrayRef<const RegStorage> *xp_regs = cu_->target64 ? &xp_regs_64 : &xp_regs_32;
655 for (RegStorage reg : *xp_regs) {
Mark Mendellfe945782014-05-22 09:52:36 -0400656 RegisterInfo* info = new (arena_) RegisterInfo(reg, GetRegMaskCommon(reg));
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100657 reginfo_map_[reg.GetReg()] = info;
Serguei Katkovc3801912014-07-08 17:21:53 +0700658 }
659 const ArrayRef<const RegStorage> *xp_temps = cu_->target64 ? &xp_temps_64 : &xp_temps_32;
660 for (RegStorage reg : *xp_temps) {
661 RegisterInfo* xp_reg_info = GetRegInfo(reg);
662 xp_reg_info->SetIsTemp(true);
Mark Mendellfe945782014-05-22 09:52:36 -0400663 }
664
Mark Mendell27dee8b2014-12-01 19:06:12 -0500665 // Special Handling for x86_64 RIP addressing.
666 if (cu_->target64) {
667 RegisterInfo* info = new (arena_) RegisterInfo(RegStorage(kRIPReg), kEncodeNone);
668 reginfo_map_[kRIPReg] = info;
669 }
670
buzbee091cc402014-03-31 10:14:40 -0700671 // Alias single precision xmm to double xmms.
672 // TODO: as needed, add larger vector sizes - alias all to the largest.
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100673 for (RegisterInfo* info : reg_pool_->sp_regs_) {
buzbee091cc402014-03-31 10:14:40 -0700674 int sp_reg_num = info->GetReg().GetRegNum();
Mark Mendellfe945782014-05-22 09:52:36 -0400675 RegStorage xp_reg = RegStorage::Solo128(sp_reg_num);
676 RegisterInfo* xp_reg_info = GetRegInfo(xp_reg);
677 // 128-bit xmm vector register's master storage should refer to itself.
678 DCHECK_EQ(xp_reg_info, xp_reg_info->Master());
679
680 // Redirect 32-bit vector's master storage to 128-bit vector.
681 info->SetMaster(xp_reg_info);
682
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700683 RegStorage dp_reg = RegStorage::FloatSolo64(sp_reg_num);
buzbee091cc402014-03-31 10:14:40 -0700684 RegisterInfo* dp_reg_info = GetRegInfo(dp_reg);
Mark Mendellfe945782014-05-22 09:52:36 -0400685 // Redirect 64-bit vector's master storage to 128-bit vector.
686 dp_reg_info->SetMaster(xp_reg_info);
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700687 // Singles should show a single 32-bit mask bit, at first referring to the low half.
688 DCHECK_EQ(info->StorageMask(), 0x1U);
689 }
690
Elena Sayapinadd644502014-07-01 18:39:52 +0700691 if (cu_->target64) {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700692 // Alias 32bit W registers to corresponding 64bit X registers.
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100693 for (RegisterInfo* info : reg_pool_->core_regs_) {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700694 int x_reg_num = info->GetReg().GetRegNum();
695 RegStorage x_reg = RegStorage::Solo64(x_reg_num);
696 RegisterInfo* x_reg_info = GetRegInfo(x_reg);
697 // 64bit X register's master storage should refer to itself.
698 DCHECK_EQ(x_reg_info, x_reg_info->Master());
699 // Redirect 32bit W master storage to 64bit X.
700 info->SetMaster(x_reg_info);
701 // 32bit W should show a single 32-bit mask bit, at first referring to the low half.
702 DCHECK_EQ(info->StorageMask(), 0x1U);
703 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700704 }
buzbee091cc402014-03-31 10:14:40 -0700705
706 // Don't start allocating temps at r0/s0/d0 or you may clobber return regs in early-exit methods.
707 // TODO: adjust for x86/hard float calling convention.
708 reg_pool_->next_core_reg_ = 2;
709 reg_pool_->next_sp_reg_ = 2;
710 reg_pool_->next_dp_reg_ = 1;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700711}
712
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700713int X86Mir2Lir::VectorRegisterSize() {
714 return 128;
715}
716
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -0700717int X86Mir2Lir::NumReservableVectorRegisters(bool long_or_fp) {
718 int num_vector_temps = cu_->target64 ? xp_temps_64.size() : xp_temps_32.size();
719
720 // Leave a few temps for use by backend as scratch.
721 return long_or_fp ? num_vector_temps - 2 : num_vector_temps - 1;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700722}
723
Brian Carlstrom7940e442013-07-12 13:46:57 -0700724void X86Mir2Lir::SpillCoreRegs() {
725 if (num_core_spills_ == 0) {
726 return;
727 }
728 // Spill mask not including fake return address register
buzbee091cc402014-03-31 10:14:40 -0700729 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
Ian Rogersb28c1c02014-11-08 11:21:21 -0800730 int offset =
731 frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
Serguei Katkovc3801912014-07-08 17:21:53 +0700732 OpSize size = cu_->target64 ? k64 : k32;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800733 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700734 for (int reg = 0; mask; mask >>= 1, reg++) {
735 if (mask & 0x1) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800736 StoreBaseDisp(rs_rSP, offset,
737 cu_->target64 ? RegStorage::Solo64(reg) : RegStorage::Solo32(reg),
Serguei Katkovc3801912014-07-08 17:21:53 +0700738 size, kNotVolatile);
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700739 offset += GetInstructionSetPointerSize(cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700740 }
741 }
742}
743
744void X86Mir2Lir::UnSpillCoreRegs() {
745 if (num_core_spills_ == 0) {
746 return;
747 }
748 // Spill mask not including fake return address register
buzbee091cc402014-03-31 10:14:40 -0700749 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700750 int offset = frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
Serguei Katkovc3801912014-07-08 17:21:53 +0700751 OpSize size = cu_->target64 ? k64 : k32;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800752 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700753 for (int reg = 0; mask; mask >>= 1, reg++) {
754 if (mask & 0x1) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800755 LoadBaseDisp(rs_rSP, offset, cu_->target64 ? RegStorage::Solo64(reg) : RegStorage::Solo32(reg),
Serguei Katkovc3801912014-07-08 17:21:53 +0700756 size, kNotVolatile);
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700757 offset += GetInstructionSetPointerSize(cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700758 }
759 }
760}
761
Serguei Katkovc3801912014-07-08 17:21:53 +0700762void X86Mir2Lir::SpillFPRegs() {
763 if (num_fp_spills_ == 0) {
764 return;
765 }
766 uint32_t mask = fp_spill_mask_;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800767 int offset = frame_size_ -
768 (GetInstructionSetPointerSize(cu_->instruction_set) * (num_fp_spills_ + num_core_spills_));
769 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Serguei Katkovc3801912014-07-08 17:21:53 +0700770 for (int reg = 0; mask; mask >>= 1, reg++) {
771 if (mask & 0x1) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800772 StoreBaseDisp(rs_rSP, offset, RegStorage::FloatSolo64(reg), k64, kNotVolatile);
Serguei Katkovc3801912014-07-08 17:21:53 +0700773 offset += sizeof(double);
774 }
775 }
776}
777void X86Mir2Lir::UnSpillFPRegs() {
778 if (num_fp_spills_ == 0) {
779 return;
780 }
781 uint32_t mask = fp_spill_mask_;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800782 int offset = frame_size_ -
783 (GetInstructionSetPointerSize(cu_->instruction_set) * (num_fp_spills_ + num_core_spills_));
784 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Serguei Katkovc3801912014-07-08 17:21:53 +0700785 for (int reg = 0; mask; mask >>= 1, reg++) {
786 if (mask & 0x1) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800787 LoadBaseDisp(rs_rSP, offset, RegStorage::FloatSolo64(reg),
Serguei Katkovc3801912014-07-08 17:21:53 +0700788 k64, kNotVolatile);
789 offset += sizeof(double);
790 }
791 }
792}
793
794
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700795bool X86Mir2Lir::IsUnconditionalBranch(LIR* lir) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700796 return (lir->opcode == kX86Jmp8 || lir->opcode == kX86Jmp32);
797}
798
Vladimir Marko674744e2014-04-24 15:18:26 +0100799RegisterClass X86Mir2Lir::RegClassForFieldLoadStore(OpSize size, bool is_volatile) {
Mark Mendellca541342014-10-15 16:59:49 -0400800 // Prefer XMM registers. Fixes a problem with iget/iput to a FP when cached temporary
801 // with same VR is a Core register.
802 if (size == kSingle || size == kDouble) {
803 return kFPReg;
804 }
805
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700806 // X86_64 can handle any size.
Elena Sayapinadd644502014-07-01 18:39:52 +0700807 if (cu_->target64) {
Chao-ying Fu06839f82014-08-14 15:59:17 -0700808 return RegClassBySize(size);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700809 }
810
Vladimir Marko674744e2014-04-24 15:18:26 +0100811 if (UNLIKELY(is_volatile)) {
812 // On x86, atomic 64-bit load/store requires an fp register.
813 // Smaller aligned load/store is atomic for both core and fp registers.
814 if (size == k64 || size == kDouble) {
815 return kFPReg;
816 }
817 }
818 return RegClassBySize(size);
819}
820
Elena Sayapinadd644502014-07-01 18:39:52 +0700821X86Mir2Lir::X86Mir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena)
Mark Mendell55d0eac2014-02-06 11:02:52 -0800822 : Mir2Lir(cu, mir_graph, arena),
Serguei Katkov717a3e42014-11-13 17:19:42 +0600823 in_to_reg_storage_x86_64_mapper_(this), in_to_reg_storage_x86_mapper_(this),
Ian Rogersdd7624d2014-03-14 17:43:00 -0700824 base_of_code_(nullptr), store_method_addr_(false), store_method_addr_used_(false),
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100825 method_address_insns_(arena->Adapter()),
826 class_type_address_insns_(arena->Adapter()),
827 call_method_insns_(arena->Adapter()),
Elena Sayapinadd644502014-07-01 18:39:52 +0700828 stack_decrement_(nullptr), stack_increment_(nullptr),
Mark Mendelld65c51a2014-04-29 16:55:20 -0400829 const_vectors_(nullptr) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100830 method_address_insns_.reserve(100);
831 class_type_address_insns_.reserve(100);
832 call_method_insns_.reserve(100);
Mark Mendelld65c51a2014-04-29 16:55:20 -0400833 store_method_addr_used_ = false;
Ian Rogersdd7624d2014-03-14 17:43:00 -0700834 for (int i = 0; i < kX86Last; i++) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700835 DCHECK_EQ(X86Mir2Lir::EncodingMap[i].opcode, i)
836 << "Encoding order for " << X86Mir2Lir::EncodingMap[i].name
837 << " is wrong: expecting " << i << ", seeing "
838 << static_cast<int>(X86Mir2Lir::EncodingMap[i].opcode);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700839 }
840}
841
842Mir2Lir* X86CodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
843 ArenaAllocator* const arena) {
Elena Sayapinadd644502014-07-01 18:39:52 +0700844 return new X86Mir2Lir(cu, mir_graph, arena);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700845}
846
Andreas Gampe98430592014-07-27 19:44:50 -0700847// Not used in x86(-64)
848RegStorage X86Mir2Lir::LoadHelper(QuickEntrypointEnum trampoline) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700849 UNUSED(trampoline);
Andreas Gampe2f244e92014-05-08 03:35:25 -0700850 LOG(FATAL) << "Unexpected use of LoadHelper in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700851 UNREACHABLE();
Andreas Gampe2f244e92014-05-08 03:35:25 -0700852}
853
Dave Allisonb373e092014-02-20 16:06:36 -0800854LIR* X86Mir2Lir::CheckSuspendUsingLoad() {
Dave Allison69dfe512014-07-11 17:11:58 +0000855 // First load the pointer in fs:[suspend-trigger] into eax
856 // Then use a test instruction to indirect via that address.
Dave Allisondfd3b472014-07-16 16:04:32 -0700857 if (cu_->target64) {
858 NewLIR2(kX86Mov64RT, rs_rAX.GetReg(),
859 Thread::ThreadSuspendTriggerOffset<8>().Int32Value());
860 } else {
861 NewLIR2(kX86Mov32RT, rs_rAX.GetReg(),
862 Thread::ThreadSuspendTriggerOffset<4>().Int32Value());
863 }
Dave Allison69dfe512014-07-11 17:11:58 +0000864 return NewLIR3(kX86Test32RM, rs_rAX.GetReg(), rs_rAX.GetReg(), 0);
Dave Allisonb373e092014-02-20 16:06:36 -0800865}
866
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700867uint64_t X86Mir2Lir::GetTargetInstFlags(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700868 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700869 return X86Mir2Lir::EncodingMap[opcode].flags;
870}
871
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700872const char* X86Mir2Lir::GetTargetInstName(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700873 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700874 return X86Mir2Lir::EncodingMap[opcode].name;
875}
876
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700877const char* X86Mir2Lir::GetTargetInstFmt(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700878 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700879 return X86Mir2Lir::EncodingMap[opcode].fmt;
880}
881
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000882void X86Mir2Lir::GenConstWide(RegLocation rl_dest, int64_t value) {
883 // Can we do this directly to memory?
884 rl_dest = UpdateLocWide(rl_dest);
885 if ((rl_dest.location == kLocDalvikFrame) ||
886 (rl_dest.location == kLocCompilerTemp)) {
887 int32_t val_lo = Low32Bits(value);
888 int32_t val_hi = High32Bits(value);
Ian Rogersb28c1c02014-11-08 11:21:21 -0800889 int r_base = rs_rX86_SP_32.GetReg();
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000890 int displacement = SRegOffset(rl_dest.s_reg_low);
891
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100892 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
buzbee2700f7e2014-03-07 09:46:20 -0800893 LIR * store = NewLIR3(kX86Mov32MI, r_base, displacement + LOWORD_OFFSET, val_lo);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000894 AnnotateDalvikRegAccess(store, (displacement + LOWORD_OFFSET) >> 2,
895 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -0800896 store = NewLIR3(kX86Mov32MI, r_base, displacement + HIWORD_OFFSET, val_hi);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000897 AnnotateDalvikRegAccess(store, (displacement + HIWORD_OFFSET) >> 2,
898 false /* is_load */, true /* is64bit */);
899 return;
900 }
901
902 // Just use the standard code to do the generation.
903 Mir2Lir::GenConstWide(rl_dest, value);
904}
Mark Mendelle02d48f2014-01-15 11:19:23 -0800905
906// TODO: Merge with existing RegLocation dumper in vreg_analysis.cc
907void X86Mir2Lir::DumpRegLocation(RegLocation loc) {
908 LOG(INFO) << "location: " << loc.location << ','
909 << (loc.wide ? " w" : " ")
910 << (loc.defined ? " D" : " ")
911 << (loc.is_const ? " c" : " ")
912 << (loc.fp ? " F" : " ")
913 << (loc.core ? " C" : " ")
914 << (loc.ref ? " r" : " ")
915 << (loc.high_word ? " h" : " ")
916 << (loc.home ? " H" : " ")
buzbee2700f7e2014-03-07 09:46:20 -0800917 << ", low: " << static_cast<int>(loc.reg.GetLowReg())
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000918 << ", high: " << static_cast<int>(loc.reg.GetHighReg())
Mark Mendelle02d48f2014-01-15 11:19:23 -0800919 << ", s_reg: " << loc.s_reg_low
920 << ", orig: " << loc.orig_sreg;
921}
922
Mark Mendell67c39c42014-01-31 17:28:00 -0800923void X86Mir2Lir::Materialize() {
924 // A good place to put the analysis before starting.
925 AnalyzeMIR();
926
927 // Now continue with regular code generation.
928 Mir2Lir::Materialize();
929}
930
Jeff Hao49161ce2014-03-12 11:05:25 -0700931void X86Mir2Lir::LoadMethodAddress(const MethodReference& target_method, InvokeType type,
Mark Mendell55d0eac2014-02-06 11:02:52 -0800932 SpecialTargetRegister symbolic_reg) {
933 /*
934 * For x86, just generate a 32 bit move immediate instruction, that will be filled
935 * in at 'link time'. For now, put a unique value based on target to ensure that
936 * code deduplication works.
937 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700938 int target_method_idx = target_method.dex_method_index;
939 const DexFile* target_dex_file = target_method.dex_file;
940 const DexFile::MethodId& target_method_id = target_dex_file->GetMethodId(target_method_idx);
941 uintptr_t target_method_id_ptr = reinterpret_cast<uintptr_t>(&target_method_id);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800942
Jeff Hao49161ce2014-03-12 11:05:25 -0700943 // Generate the move instruction with the unique pointer and save index, dex_file, and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700944 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
945 TargetReg(symbolic_reg, kNotWide).GetReg(),
Jeff Hao49161ce2014-03-12 11:05:25 -0700946 static_cast<int>(target_method_id_ptr), target_method_idx,
947 WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800948 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100949 method_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800950}
951
Fred Shihe7f82e22014-08-06 10:46:37 -0700952void X86Mir2Lir::LoadClassType(const DexFile& dex_file, uint32_t type_idx,
953 SpecialTargetRegister symbolic_reg) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800954 /*
955 * For x86, just generate a 32 bit move immediate instruction, that will be filled
956 * in at 'link time'. For now, put a unique value based on target to ensure that
957 * code deduplication works.
958 */
Fred Shihe7f82e22014-08-06 10:46:37 -0700959 const DexFile::TypeId& id = dex_file.GetTypeId(type_idx);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800960 uintptr_t ptr = reinterpret_cast<uintptr_t>(&id);
961
962 // Generate the move instruction with the unique pointer and save index and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700963 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
964 TargetReg(symbolic_reg, kNotWide).GetReg(),
Fred Shihe7f82e22014-08-06 10:46:37 -0700965 static_cast<int>(ptr), type_idx,
966 WrapPointer(const_cast<DexFile*>(&dex_file)));
Mark Mendell55d0eac2014-02-06 11:02:52 -0800967 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100968 class_type_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800969}
970
Vladimir Markof4da6752014-08-01 19:04:18 +0100971LIR* X86Mir2Lir::CallWithLinkerFixup(const MethodReference& target_method, InvokeType type) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800972 /*
973 * For x86, just generate a 32 bit call relative instruction, that will be filled
Vladimir Markof4da6752014-08-01 19:04:18 +0100974 * in at 'link time'.
Mark Mendell55d0eac2014-02-06 11:02:52 -0800975 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700976 int target_method_idx = target_method.dex_method_index;
977 const DexFile* target_dex_file = target_method.dex_file;
Mark Mendell55d0eac2014-02-06 11:02:52 -0800978
Jeff Hao49161ce2014-03-12 11:05:25 -0700979 // Generate the call instruction with the unique pointer and save index, dex_file, and type.
Vladimir Markof4da6752014-08-01 19:04:18 +0100980 // NOTE: Method deduplication takes linker patches into account, so we can just pass 0
981 // as a placeholder for the offset.
982 LIR* call = RawLIR(current_dalvik_offset_, kX86CallI, 0,
Jeff Hao49161ce2014-03-12 11:05:25 -0700983 target_method_idx, WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800984 AppendLIR(call);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100985 call_method_insns_.push_back(call);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800986 return call;
987}
988
Vladimir Markof4da6752014-08-01 19:04:18 +0100989static LIR* GenInvokeNoInlineCall(Mir2Lir* mir_to_lir, InvokeType type) {
990 QuickEntrypointEnum trampoline;
991 switch (type) {
992 case kInterface:
993 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
994 break;
995 case kDirect:
996 trampoline = kQuickInvokeDirectTrampolineWithAccessCheck;
997 break;
998 case kStatic:
999 trampoline = kQuickInvokeStaticTrampolineWithAccessCheck;
1000 break;
1001 case kSuper:
1002 trampoline = kQuickInvokeSuperTrampolineWithAccessCheck;
1003 break;
1004 case kVirtual:
1005 trampoline = kQuickInvokeVirtualTrampolineWithAccessCheck;
1006 break;
1007 default:
1008 LOG(FATAL) << "Unexpected invoke type";
1009 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
1010 }
1011 return mir_to_lir->InvokeTrampoline(kOpBlx, RegStorage::InvalidReg(), trampoline);
1012}
1013
1014LIR* X86Mir2Lir::GenCallInsn(const MirMethodLoweringInfo& method_info) {
1015 LIR* call_insn;
1016 if (method_info.FastPath()) {
1017 if (method_info.DirectCode() == static_cast<uintptr_t>(-1)) {
1018 // We can have the linker fixup a call relative.
1019 call_insn = CallWithLinkerFixup(method_info.GetTargetMethod(), method_info.GetSharpType());
1020 } else {
1021 call_insn = OpMem(kOpBlx, TargetReg(kArg0, kRef),
Mathieu Chartier2d721012014-11-10 11:08:06 -08001022 mirror::ArtMethod::EntryPointFromQuickCompiledCodeOffset(
1023 cu_->target64 ? 8 : 4).Int32Value());
Vladimir Markof4da6752014-08-01 19:04:18 +01001024 }
1025 } else {
1026 call_insn = GenInvokeNoInlineCall(this, method_info.GetSharpType());
1027 }
1028 return call_insn;
1029}
1030
Mark Mendell55d0eac2014-02-06 11:02:52 -08001031void X86Mir2Lir::InstallLiteralPools() {
1032 // These are handled differently for x86.
1033 DCHECK(code_literal_list_ == nullptr);
1034 DCHECK(method_literal_list_ == nullptr);
1035 DCHECK(class_literal_list_ == nullptr);
1036
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001037
Mark Mendelld65c51a2014-04-29 16:55:20 -04001038 if (const_vectors_ != nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001039 // Vector literals must be 16-byte aligned. The header that is placed
1040 // in the code section causes misalignment so we take it into account.
1041 // Otherwise, we are sure that for x86 method is aligned to 16.
1042 DCHECK_EQ(GetInstructionSetAlignment(cu_->instruction_set), 16u);
1043 uint32_t bytes_to_fill = (0x10 - ((code_buffer_.size() + sizeof(OatQuickMethodHeader)) & 0xF)) & 0xF;
1044 while (bytes_to_fill > 0) {
1045 code_buffer_.push_back(0);
1046 bytes_to_fill--;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001047 }
1048
Mark Mendelld65c51a2014-04-29 16:55:20 -04001049 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Tong Shen547cdfd2014-08-05 01:54:19 -07001050 PushWord(&code_buffer_, p->operands[0]);
1051 PushWord(&code_buffer_, p->operands[1]);
1052 PushWord(&code_buffer_, p->operands[2]);
1053 PushWord(&code_buffer_, p->operands[3]);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001054 }
1055 }
1056
Mark Mendell55d0eac2014-02-06 11:02:52 -08001057 // Handle the fixups for methods.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001058 for (LIR* p : method_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001059 DCHECK_EQ(p->opcode, kX86Mov32RI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001060 uint32_t target_method_idx = p->operands[2];
1061 const DexFile* target_dex_file =
1062 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[3]));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001063
1064 // The offset to patch is the last 4 bytes of the instruction.
1065 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001066 patches_.push_back(LinkerPatch::MethodPatch(patch_offset,
1067 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001068 }
1069
1070 // Handle the fixups for class types.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001071 for (LIR* p : class_type_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001072 DCHECK_EQ(p->opcode, kX86Mov32RI);
Fred Shihe7f82e22014-08-06 10:46:37 -07001073
1074 const DexFile* class_dex_file =
1075 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[3]));
Vladimir Markof4da6752014-08-01 19:04:18 +01001076 uint32_t target_type_idx = p->operands[2];
Mark Mendell55d0eac2014-02-06 11:02:52 -08001077
1078 // The offset to patch is the last 4 bytes of the instruction.
1079 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001080 patches_.push_back(LinkerPatch::TypePatch(patch_offset,
1081 class_dex_file, target_type_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001082 }
1083
1084 // And now the PC-relative calls to methods.
Vladimir Markof4da6752014-08-01 19:04:18 +01001085 patches_.reserve(call_method_insns_.size());
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001086 for (LIR* p : call_method_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001087 DCHECK_EQ(p->opcode, kX86CallI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001088 uint32_t target_method_idx = p->operands[1];
1089 const DexFile* target_dex_file =
1090 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[2]));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001091
1092 // The offset to patch is the last 4 bytes of the instruction.
1093 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001094 patches_.push_back(LinkerPatch::RelativeCodePatch(patch_offset,
1095 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001096 }
1097
1098 // And do the normal processing.
1099 Mir2Lir::InstallLiteralPools();
1100}
1101
DaniilSokolov70c4f062014-06-24 17:34:00 -07001102bool X86Mir2Lir::GenInlinedArrayCopyCharArray(CallInfo* info) {
DaniilSokolov70c4f062014-06-24 17:34:00 -07001103 RegLocation rl_src = info->args[0];
1104 RegLocation rl_srcPos = info->args[1];
1105 RegLocation rl_dst = info->args[2];
1106 RegLocation rl_dstPos = info->args[3];
1107 RegLocation rl_length = info->args[4];
1108 if (rl_srcPos.is_const && (mir_graph_->ConstantValue(rl_srcPos) < 0)) {
1109 return false;
1110 }
1111 if (rl_dstPos.is_const && (mir_graph_->ConstantValue(rl_dstPos) < 0)) {
1112 return false;
1113 }
1114 ClobberCallerSave();
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001115 LockCallTemps(); // Using fixed registers.
1116 RegStorage tmp_reg = cu_->target64 ? rs_r11 : rs_rBX;
1117 LoadValueDirectFixed(rl_src, rs_rAX);
1118 LoadValueDirectFixed(rl_dst, rs_rCX);
1119 LIR* src_dst_same = OpCmpBranch(kCondEq, rs_rAX, rs_rCX, nullptr);
1120 LIR* src_null_branch = OpCmpImmBranch(kCondEq, rs_rAX, 0, nullptr);
1121 LIR* dst_null_branch = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1122 LoadValueDirectFixed(rl_length, rs_rDX);
1123 // If the length of the copy is > 128 characters (256 bytes) or negative then go slow path.
1124 LIR* len_too_big = OpCmpImmBranch(kCondHi, rs_rDX, 128, nullptr);
1125 LoadValueDirectFixed(rl_src, rs_rAX);
1126 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001127 LIR* src_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001128 LIR* src_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001129 LIR* srcPos_negative = nullptr;
1130 if (!rl_srcPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001131 LoadValueDirectFixed(rl_srcPos, tmp_reg);
1132 srcPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001133 // src_pos < src_len
1134 src_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1135 // src_len - src_pos < copy_len
1136 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1137 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001138 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001139 int32_t pos_val = mir_graph_->ConstantValue(rl_srcPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001140 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001141 src_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001142 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001143 // src_pos < src_len
1144 src_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1145 // src_len - src_pos < copy_len
1146 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1147 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001148 }
1149 }
1150 LIR* dstPos_negative = nullptr;
1151 LIR* dst_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001152 LIR* dst_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001153 LoadValueDirectFixed(rl_dst, rs_rAX);
1154 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
1155 if (!rl_dstPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001156 LoadValueDirectFixed(rl_dstPos, tmp_reg);
1157 dstPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001158 // dst_pos < dst_len
1159 dst_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1160 // dst_len - dst_pos < copy_len
1161 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1162 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001163 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001164 int32_t pos_val = mir_graph_->ConstantValue(rl_dstPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001165 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001166 dst_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001167 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001168 // dst_pos < dst_len
1169 dst_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1170 // dst_len - dst_pos < copy_len
1171 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1172 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001173 }
1174 }
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001175 // Everything is checked now.
1176 LoadValueDirectFixed(rl_src, rs_rAX);
1177 LoadValueDirectFixed(rl_dst, tmp_reg);
1178 LoadValueDirectFixed(rl_srcPos, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001179 NewLIR5(kX86Lea32RA, rs_rAX.GetReg(), rs_rAX.GetReg(),
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001180 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value());
1181 // RAX now holds the address of the first src element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001182
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001183 LoadValueDirectFixed(rl_dstPos, rs_rCX);
1184 NewLIR5(kX86Lea32RA, tmp_reg.GetReg(), tmp_reg.GetReg(),
1185 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value() );
1186 // RBX now holds the address of the first dst element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001187
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001188 // Check if the number of elements to be copied is odd or even. If odd
DaniilSokolov70c4f062014-06-24 17:34:00 -07001189 // then copy the first element (so that the remaining number of elements
1190 // is even).
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001191 LoadValueDirectFixed(rl_length, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001192 OpRegImm(kOpAnd, rs_rCX, 1);
1193 LIR* jmp_to_begin_loop = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1194 OpRegImm(kOpSub, rs_rDX, 1);
1195 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001196 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001197
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001198 // Since the remaining number of elements is even, we will copy by
DaniilSokolov70c4f062014-06-24 17:34:00 -07001199 // two elements at a time.
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001200 LIR* beginLoop = NewLIR0(kPseudoTargetLabel);
1201 LIR* jmp_to_ret = OpCmpImmBranch(kCondEq, rs_rDX, 0, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001202 OpRegImm(kOpSub, rs_rDX, 2);
1203 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001204 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001205 OpUnconditionalBranch(beginLoop);
1206 LIR *check_failed = NewLIR0(kPseudoTargetLabel);
1207 LIR* launchpad_branch = OpUnconditionalBranch(nullptr);
1208 LIR *return_point = NewLIR0(kPseudoTargetLabel);
1209 jmp_to_ret->target = return_point;
1210 jmp_to_begin_loop->target = beginLoop;
1211 src_dst_same->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001212 len_too_big->target = check_failed;
1213 src_null_branch->target = check_failed;
1214 if (srcPos_negative != nullptr)
1215 srcPos_negative ->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001216 if (src_bad_off != nullptr)
1217 src_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001218 if (src_bad_len != nullptr)
1219 src_bad_len->target = check_failed;
1220 dst_null_branch->target = check_failed;
1221 if (dstPos_negative != nullptr)
1222 dstPos_negative->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001223 if (dst_bad_off != nullptr)
1224 dst_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001225 if (dst_bad_len != nullptr)
1226 dst_bad_len->target = check_failed;
1227 AddIntrinsicSlowPath(info, launchpad_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001228 ClobberCallerSave(); // We must clobber everything because slow path will return here
DaniilSokolov70c4f062014-06-24 17:34:00 -07001229 return true;
1230}
1231
1232
Mark Mendell4028a6c2014-02-19 20:06:20 -08001233/*
1234 * Fast string.index_of(I) & (II). Inline check for simple case of char <= 0xffff,
1235 * otherwise bails to standard library code.
1236 */
1237bool X86Mir2Lir::GenInlinedIndexOf(CallInfo* info, bool zero_based) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001238 RegLocation rl_obj = info->args[0];
1239 RegLocation rl_char = info->args[1];
buzbeea44d4f52014-03-05 11:26:39 -08001240 RegLocation rl_start; // Note: only present in III flavor or IndexOf.
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001241 // RBX is promotable in 64-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001242 RegStorage rs_tmp = cu_->target64 ? rs_r11 : rs_rBX;
1243 int start_value = -1;
Mark Mendell4028a6c2014-02-19 20:06:20 -08001244
1245 uint32_t char_value =
1246 rl_char.is_const ? mir_graph_->ConstantValue(rl_char.orig_sreg) : 0;
1247
1248 if (char_value > 0xFFFF) {
1249 // We have to punt to the real String.indexOf.
1250 return false;
1251 }
1252
1253 // Okay, we are commited to inlining this.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001254 // EAX: 16 bit character being searched.
1255 // ECX: count: number of words to be searched.
1256 // EDI: String being searched.
1257 // EDX: temporary during execution.
1258 // EBX or R11: temporary during execution (depending on mode).
1259 // REP SCASW: search instruction.
1260
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001261 FlushAllRegs();
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001262
buzbeea0cd2d72014-06-01 09:33:49 -07001263 RegLocation rl_return = GetReturn(kCoreReg);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001264 RegLocation rl_dest = InlineTarget(info);
1265
1266 // Is the string non-NULL?
buzbee2700f7e2014-03-07 09:46:20 -08001267 LoadValueDirectFixed(rl_obj, rs_rDX);
1268 GenNullCheck(rs_rDX, info->opt_flags);
Vladimir Marko3bc86152014-03-13 14:11:28 +00001269 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've null checked.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001270
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001271 LIR *slowpath_branch = nullptr, *length_compare = nullptr;
1272
1273 // We need the value in EAX.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001274 if (rl_char.is_const) {
buzbee2700f7e2014-03-07 09:46:20 -08001275 LoadConstantNoClobber(rs_rAX, char_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001276 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001277 // Does the character fit in 16 bits? Compare it at runtime.
buzbee2700f7e2014-03-07 09:46:20 -08001278 LoadValueDirectFixed(rl_char, rs_rAX);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001279 slowpath_branch = OpCmpImmBranch(kCondGt, rs_rAX, 0xFFFF, nullptr);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001280 }
1281
1282 // From here down, we know that we are looking for a char that fits in 16 bits.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001283 // Location of reference to data array within the String object.
1284 int value_offset = mirror::String::ValueOffset().Int32Value();
1285 // Location of count within the String object.
1286 int count_offset = mirror::String::CountOffset().Int32Value();
1287 // Starting offset within data array.
1288 int offset_offset = mirror::String::OffsetOffset().Int32Value();
1289 // Start of char data with array_.
1290 int data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Int32Value();
Mark Mendell4028a6c2014-02-19 20:06:20 -08001291
Dave Allison69dfe512014-07-11 17:11:58 +00001292 // Compute the number of words to search in to rCX.
1293 Load32Disp(rs_rDX, count_offset, rs_rCX);
1294
Dave Allisondfd3b472014-07-16 16:04:32 -07001295 // Possible signal here due to null pointer dereference.
1296 // Note that the signal handler will expect the top word of
1297 // the stack to be the ArtMethod*. If the PUSH edi instruction
1298 // below is ahead of the load above then this will not be true
1299 // and the signal handler will not work.
1300 MarkPossibleNullPointerException(0);
Dave Allison69dfe512014-07-11 17:11:58 +00001301
Dave Allisondfd3b472014-07-16 16:04:32 -07001302 if (!cu_->target64) {
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001303 // EDI is promotable in 32-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001304 NewLIR1(kX86Push32R, rs_rDI.GetReg());
1305 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001306
Mark Mendell4028a6c2014-02-19 20:06:20 -08001307 if (zero_based) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001308 // Start index is not present.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001309 // We have to handle an empty string. Use special instruction JECXZ.
1310 length_compare = NewLIR0(kX86Jecxz8);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001311
1312 // Copy the number of words to search in a temporary register.
1313 // We will use the register at the end to calculate result.
1314 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001315 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001316 // Start index is present.
buzbeea44d4f52014-03-05 11:26:39 -08001317 rl_start = info->args[2];
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001318
Mark Mendell4028a6c2014-02-19 20:06:20 -08001319 // We have to offset by the start index.
1320 if (rl_start.is_const) {
1321 start_value = mir_graph_->ConstantValue(rl_start.orig_sreg);
1322 start_value = std::max(start_value, 0);
1323
1324 // Is the start > count?
buzbee2700f7e2014-03-07 09:46:20 -08001325 length_compare = OpCmpImmBranch(kCondLe, rs_rCX, start_value, nullptr);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001326 OpRegImm(kOpMov, rs_rDI, start_value);
1327
1328 // Copy the number of words to search in a temporary register.
1329 // We will use the register at the end to calculate result.
1330 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001331
1332 if (start_value != 0) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001333 // Decrease the number of words to search by the start index.
buzbee2700f7e2014-03-07 09:46:20 -08001334 OpRegImm(kOpSub, rs_rCX, start_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001335 }
1336 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001337 // Handle "start index < 0" case.
1338 if (!cu_->target64 && rl_start.location != kLocPhysReg) {
Alexei Zavjalova1758d82014-04-17 01:55:43 +07001339 // Load the start index from stack, remembering that we pushed EDI.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001340 int displacement = SRegOffset(rl_start.s_reg_low) + sizeof(uint32_t);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001341 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001342 Load32Disp(rs_rX86_SP_32, displacement, rs_rDI);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001343 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1344 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1345 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - 1;
1346 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001347 } else {
1348 LoadValueDirectFixed(rl_start, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001349 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001350 OpRegReg(kOpXor, rs_tmp, rs_tmp);
1351 OpRegReg(kOpCmp, rs_rDI, rs_tmp);
1352 OpCondRegReg(kOpCmov, kCondLt, rs_rDI, rs_tmp);
1353
1354 // The length of the string should be greater than the start index.
1355 length_compare = OpCmpBranch(kCondLe, rs_rCX, rs_rDI, nullptr);
1356
1357 // Copy the number of words to search in a temporary register.
1358 // We will use the register at the end to calculate result.
1359 OpRegReg(kOpMov, rs_tmp, rs_rCX);
1360
1361 // Decrease the number of words to search by the start index.
1362 OpRegReg(kOpSub, rs_rCX, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001363 }
1364 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001365
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001366 // Load the address of the string into EDI.
1367 // In case of start index we have to add the address to existing value in EDI.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001368 // The string starts at VALUE(String) + 2 * OFFSET(String) + DATA_OFFSET.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001369 if (zero_based || (!zero_based && rl_start.is_const && start_value == 0)) {
1370 Load32Disp(rs_rDX, offset_offset, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001371 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001372 OpRegMem(kOpAdd, rs_rDI, rs_rDX, offset_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001373 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001374 OpRegImm(kOpLsl, rs_rDI, 1);
1375 OpRegMem(kOpAdd, rs_rDI, rs_rDX, value_offset);
1376 OpRegImm(kOpAdd, rs_rDI, data_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001377
1378 // EDI now contains the start of the string to be searched.
1379 // We are all prepared to do the search for the character.
1380 NewLIR0(kX86RepneScasw);
1381
1382 // Did we find a match?
1383 LIR* failed_branch = OpCondBranch(kCondNe, nullptr);
1384
1385 // yes, we matched. Compute the index of the result.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001386 OpRegReg(kOpSub, rs_tmp, rs_rCX);
1387 NewLIR3(kX86Lea32RM, rl_return.reg.GetReg(), rs_tmp.GetReg(), -1);
1388
Mark Mendell4028a6c2014-02-19 20:06:20 -08001389 LIR *all_done = NewLIR1(kX86Jmp8, 0);
1390
1391 // Failed to match; return -1.
1392 LIR *not_found = NewLIR0(kPseudoTargetLabel);
1393 length_compare->target = not_found;
1394 failed_branch->target = not_found;
buzbee2700f7e2014-03-07 09:46:20 -08001395 LoadConstantNoClobber(rl_return.reg, -1);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001396
1397 // And join up at the end.
1398 all_done->target = NewLIR0(kPseudoTargetLabel);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001399
1400 if (!cu_->target64)
1401 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
Mark Mendell4028a6c2014-02-19 20:06:20 -08001402
1403 // Out of line code returns here.
Mingyao Yang3a74d152014-04-21 15:39:44 -07001404 if (slowpath_branch != nullptr) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001405 LIR *return_point = NewLIR0(kPseudoTargetLabel);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001406 AddIntrinsicSlowPath(info, slowpath_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001407 ClobberCallerSave(); // We must clobber everything because slow path will return here
Mark Mendell4028a6c2014-02-19 20:06:20 -08001408 }
1409
1410 StoreValue(rl_dest, rl_return);
1411 return true;
1412}
1413
Tong Shen35e1e6a2014-07-30 09:31:22 -07001414static bool ARTRegIDToDWARFRegID(bool is_x86_64, int art_reg_id, int* dwarf_reg_id) {
1415 if (is_x86_64) {
1416 switch (art_reg_id) {
Andreas Gampebda27222014-07-30 23:21:36 -07001417 case 3 : *dwarf_reg_id = 3; return true; // %rbx
Tong Shen35e1e6a2014-07-30 09:31:22 -07001418 // This is the only discrepancy between ART & DWARF register numbering.
Andreas Gampebda27222014-07-30 23:21:36 -07001419 case 5 : *dwarf_reg_id = 6; return true; // %rbp
1420 case 12: *dwarf_reg_id = 12; return true; // %r12
1421 case 13: *dwarf_reg_id = 13; return true; // %r13
1422 case 14: *dwarf_reg_id = 14; return true; // %r14
1423 case 15: *dwarf_reg_id = 15; return true; // %r15
1424 default: return false; // Should not get here
Tong Shen35e1e6a2014-07-30 09:31:22 -07001425 }
1426 } else {
1427 switch (art_reg_id) {
Andreas Gampebda27222014-07-30 23:21:36 -07001428 case 5: *dwarf_reg_id = 5; return true; // %ebp
1429 case 6: *dwarf_reg_id = 6; return true; // %esi
1430 case 7: *dwarf_reg_id = 7; return true; // %edi
1431 default: return false; // Should not get here
Tong Shen35e1e6a2014-07-30 09:31:22 -07001432 }
1433 }
1434}
1435
Tong Shen547cdfd2014-08-05 01:54:19 -07001436std::vector<uint8_t>* X86Mir2Lir::ReturnFrameDescriptionEntry() {
1437 std::vector<uint8_t>* cfi_info = new std::vector<uint8_t>;
Mark Mendellae9fd932014-02-10 16:14:35 -08001438
1439 // Generate the FDE for the method.
1440 DCHECK_NE(data_offset_, 0U);
1441
Yevgeny Roubane3ea8382014-08-08 16:29:38 +07001442 WriteFDEHeader(cfi_info, cu_->target64);
1443 WriteFDEAddressRange(cfi_info, data_offset_, cu_->target64);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001444
Mark Mendellae9fd932014-02-10 16:14:35 -08001445 // The instructions in the FDE.
1446 if (stack_decrement_ != nullptr) {
1447 // Advance LOC to just past the stack decrement.
1448 uint32_t pc = NEXT_LIR(stack_decrement_)->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001449 DW_CFA_advance_loc(cfi_info, pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001450
1451 // Now update the offset to the call frame: DW_CFA_def_cfa_offset frame_size.
Tong Shen547cdfd2014-08-05 01:54:19 -07001452 DW_CFA_def_cfa_offset(cfi_info, frame_size_);
Mark Mendellae9fd932014-02-10 16:14:35 -08001453
Tong Shen35e1e6a2014-07-30 09:31:22 -07001454 // Handle register spills
1455 const uint32_t kSpillInstLen = (cu_->target64) ? 5 : 4;
1456 const int kDataAlignmentFactor = (cu_->target64) ? -8 : -4;
1457 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
1458 int offset = -(GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
1459 for (int reg = 0; mask; mask >>= 1, reg++) {
1460 if (mask & 0x1) {
1461 pc += kSpillInstLen;
1462
1463 // Advance LOC to pass this instruction
Tong Shen547cdfd2014-08-05 01:54:19 -07001464 DW_CFA_advance_loc(cfi_info, kSpillInstLen);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001465
1466 int dwarf_reg_id;
1467 if (ARTRegIDToDWARFRegID(cu_->target64, reg, &dwarf_reg_id)) {
Tong Shen547cdfd2014-08-05 01:54:19 -07001468 // DW_CFA_offset_extended_sf reg offset
1469 DW_CFA_offset_extended_sf(cfi_info, dwarf_reg_id, offset / kDataAlignmentFactor);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001470 }
1471
1472 offset += GetInstructionSetPointerSize(cu_->instruction_set);
1473 }
1474 }
1475
Mark Mendellae9fd932014-02-10 16:14:35 -08001476 // We continue with that stack until the epilogue.
1477 if (stack_increment_ != nullptr) {
1478 uint32_t new_pc = NEXT_LIR(stack_increment_)->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001479 DW_CFA_advance_loc(cfi_info, new_pc - pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001480
1481 // We probably have code snippets after the epilogue, so save the
1482 // current state: DW_CFA_remember_state.
Tong Shen547cdfd2014-08-05 01:54:19 -07001483 DW_CFA_remember_state(cfi_info);
Mark Mendellae9fd932014-02-10 16:14:35 -08001484
Tong Shen35e1e6a2014-07-30 09:31:22 -07001485 // We have now popped the stack: DW_CFA_def_cfa_offset 4/8.
1486 // There is only the return PC on the stack now.
Tong Shen547cdfd2014-08-05 01:54:19 -07001487 DW_CFA_def_cfa_offset(cfi_info, GetInstructionSetPointerSize(cu_->instruction_set));
Mark Mendellae9fd932014-02-10 16:14:35 -08001488
1489 // Everything after that is the same as before the epilogue.
1490 // Stack bump was followed by RET instruction.
1491 LIR *post_ret_insn = NEXT_LIR(NEXT_LIR(stack_increment_));
1492 if (post_ret_insn != nullptr) {
1493 pc = new_pc;
1494 new_pc = post_ret_insn->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001495 DW_CFA_advance_loc(cfi_info, new_pc - pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001496 // Restore the state: DW_CFA_restore_state.
Tong Shen547cdfd2014-08-05 01:54:19 -07001497 DW_CFA_restore_state(cfi_info);
Mark Mendellae9fd932014-02-10 16:14:35 -08001498 }
1499 }
1500 }
1501
Tong Shen547cdfd2014-08-05 01:54:19 -07001502 PadCFI(cfi_info);
Yevgeny Roubane3ea8382014-08-08 16:29:38 +07001503 WriteCFILength(cfi_info, cu_->target64);
Mark Mendellae9fd932014-02-10 16:14:35 -08001504
Mark Mendellae9fd932014-02-10 16:14:35 -08001505 return cfi_info;
1506}
1507
Mark Mendelld65c51a2014-04-29 16:55:20 -04001508void X86Mir2Lir::GenMachineSpecificExtendedMethodMIR(BasicBlock* bb, MIR* mir) {
1509 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001510 case kMirOpReserveVectorRegisters:
1511 ReserveVectorRegisters(mir);
1512 break;
1513 case kMirOpReturnVectorRegisters:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001514 ReturnVectorRegisters(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001515 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001516 case kMirOpConstVector:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001517 GenConst128(mir);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001518 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001519 case kMirOpMoveVector:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001520 GenMoveVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001521 break;
1522 case kMirOpPackedMultiply:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001523 GenMultiplyVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001524 break;
1525 case kMirOpPackedAddition:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001526 GenAddVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001527 break;
1528 case kMirOpPackedSubtract:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001529 GenSubtractVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001530 break;
1531 case kMirOpPackedShiftLeft:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001532 GenShiftLeftVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001533 break;
1534 case kMirOpPackedSignedShiftRight:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001535 GenSignedShiftRightVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001536 break;
1537 case kMirOpPackedUnsignedShiftRight:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001538 GenUnsignedShiftRightVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001539 break;
1540 case kMirOpPackedAnd:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001541 GenAndVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001542 break;
1543 case kMirOpPackedOr:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001544 GenOrVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001545 break;
1546 case kMirOpPackedXor:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001547 GenXorVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001548 break;
1549 case kMirOpPackedAddReduce:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001550 GenAddReduceVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001551 break;
1552 case kMirOpPackedReduce:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001553 GenReduceVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001554 break;
1555 case kMirOpPackedSet:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001556 GenSetVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001557 break;
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07001558 case kMirOpMemBarrier:
1559 GenMemBarrier(static_cast<MemBarrierKind>(mir->dalvikInsn.vA));
1560 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001561 case kMirOpPackedArrayGet:
1562 GenPackedArrayGet(bb, mir);
1563 break;
1564 case kMirOpPackedArrayPut:
1565 GenPackedArrayPut(bb, mir);
1566 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001567 default:
1568 break;
1569 }
1570}
1571
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001572void X86Mir2Lir::ReserveVectorRegisters(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001573 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001574 RegStorage xp_reg = RegStorage::Solo128(i);
1575 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1576 Clobber(xp_reg);
1577
1578 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1579 info != nullptr;
1580 info = info->GetAliasChain()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001581 ArenaVector<RegisterInfo*>* regs =
1582 info->GetReg().IsSingle() ? &reg_pool_->sp_regs_ : &reg_pool_->dp_regs_;
1583 auto it = std::find(regs->begin(), regs->end(), info);
1584 DCHECK(it != regs->end());
1585 regs->erase(it);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001586 }
1587 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001588}
1589
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001590void X86Mir2Lir::ReturnVectorRegisters(MIR* mir) {
1591 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001592 RegStorage xp_reg = RegStorage::Solo128(i);
1593 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1594
1595 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1596 info != nullptr;
1597 info = info->GetAliasChain()) {
1598 if (info->GetReg().IsSingle()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001599 reg_pool_->sp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001600 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001601 reg_pool_->dp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001602 }
1603 }
1604 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001605}
1606
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001607void X86Mir2Lir::GenConst128(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001608 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001609 Clobber(rs_dest);
1610
Mark Mendelld65c51a2014-04-29 16:55:20 -04001611 uint32_t *args = mir->dalvikInsn.arg;
Mark Mendellfe945782014-05-22 09:52:36 -04001612 int reg = rs_dest.GetReg();
Mark Mendelld65c51a2014-04-29 16:55:20 -04001613 // Check for all 0 case.
1614 if (args[0] == 0 && args[1] == 0 && args[2] == 0 && args[3] == 0) {
1615 NewLIR2(kX86XorpsRR, reg, reg);
1616 return;
1617 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001618
1619 // Append the mov const vector to reg opcode.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001620 AppendOpcodeWithConst(kX86MovdqaRM, reg, mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001621}
1622
1623void X86Mir2Lir::AppendOpcodeWithConst(X86OpCode opcode, int reg, MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001624 // To deal with correct memory ordering, reverse order of constants.
1625 int32_t constants[4];
1626 constants[3] = mir->dalvikInsn.arg[0];
1627 constants[2] = mir->dalvikInsn.arg[1];
1628 constants[1] = mir->dalvikInsn.arg[2];
1629 constants[0] = mir->dalvikInsn.arg[3];
1630
1631 // Search if there is already a constant in pool with this value.
1632 LIR *data_target = ScanVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001633 if (data_target == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001634 data_target = AddVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001635 }
1636
Mark Mendelld65c51a2014-04-29 16:55:20 -04001637 // Load the proper value from the literal area.
1638 // We don't know the proper offset for the value, so pick one that will force
Mark Mendell27dee8b2014-12-01 19:06:12 -05001639 // 4 byte offset. We will fix this up in the assembler later to have the
1640 // right value.
1641 LIR* load;
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001642 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
Mark Mendell27dee8b2014-12-01 19:06:12 -05001643 if (cu_->target64) {
1644 load = NewLIR3(opcode, reg, kRIPReg, 256 /* bogus */);
1645 } else {
1646 // Address the start of the method.
1647 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
1648 if (rl_method.wide) {
1649 rl_method = LoadValueWide(rl_method, kCoreReg);
1650 } else {
1651 rl_method = LoadValue(rl_method, kCoreReg);
1652 }
1653
1654 load = NewLIR3(opcode, reg, rl_method.reg.GetReg(), 256 /* bogus */);
1655
1656 // The literal pool needs position independent logic.
1657 store_method_addr_used_ = true;
1658 }
Mark Mendelld65c51a2014-04-29 16:55:20 -04001659 load->flags.fixup = kFixupLoad;
1660 load->target = data_target;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001661}
1662
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001663void X86Mir2Lir::GenMoveVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001664 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001665 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1666 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001667 Clobber(rs_dest);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001668 RegStorage rs_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001669 NewLIR2(kX86MovdqaRR, rs_dest.GetReg(), rs_src.GetReg());
Mark Mendellfe945782014-05-22 09:52:36 -04001670}
1671
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001672void X86Mir2Lir::GenMultiplyVectorSignedByte(RegStorage rs_dest_src1, RegStorage rs_src2) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001673 /*
1674 * Emulate the behavior of a kSignedByte by separating out the 16 values in the two XMM
1675 * and multiplying 8 at a time before recombining back into one XMM register.
1676 *
1677 * let xmm1, xmm2 be real srcs (keep low bits of 16bit lanes)
1678 * xmm3 is tmp (operate on high bits of 16bit lanes)
1679 *
1680 * xmm3 = xmm1
1681 * xmm1 = xmm1 .* xmm2
1682 * xmm1 = xmm1 & 0x00ff00ff00ff00ff00ff00ff00ff00ff // xmm1 now has low bits
1683 * xmm3 = xmm3 .>> 8
1684 * xmm2 = xmm2 & 0xff00ff00ff00ff00ff00ff00ff00ff00
1685 * xmm2 = xmm2 .* xmm3 // xmm2 now has high bits
1686 * xmm1 = xmm1 | xmm2 // combine results
1687 */
1688
1689 // Copy xmm1.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001690 RegStorage rs_src1_high_tmp = Get128BitRegister(AllocTempDouble());
1691 RegStorage rs_dest_high_tmp = Get128BitRegister(AllocTempDouble());
1692 NewLIR2(kX86MovdqaRR, rs_src1_high_tmp.GetReg(), rs_src2.GetReg());
1693 NewLIR2(kX86MovdqaRR, rs_dest_high_tmp.GetReg(), rs_dest_src1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001694
1695 // Multiply low bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001696 // x7 *= x3
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001697 NewLIR2(kX86PmullwRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1698
1699 // xmm1 now has low bits.
1700 AndMaskVectorRegister(rs_dest_src1, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF);
1701
1702 // Prepare high bits for multiplication.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001703 NewLIR2(kX86PsrlwRI, rs_src1_high_tmp.GetReg(), 0x8);
1704 AndMaskVectorRegister(rs_dest_high_tmp, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001705
1706 // Multiply high bits and xmm2 now has high bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001707 NewLIR2(kX86PmullwRR, rs_src1_high_tmp.GetReg(), rs_dest_high_tmp.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001708
1709 // Combine back into dest XMM register.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001710 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src1_high_tmp.GetReg());
1711}
1712
1713void X86Mir2Lir::GenMultiplyVectorLong(RegStorage rs_dest_src1, RegStorage rs_src2) {
1714 /*
1715 * We need to emulate the packed long multiply.
1716 * For kMirOpPackedMultiply xmm1, xmm0:
1717 * - xmm1 is src/dest
1718 * - xmm0 is src
1719 * - Get xmm2 and xmm3 as temp
1720 * - Idea is to multiply the lower 32 of each operand with the higher 32 of the other.
1721 * - Then add the two results.
1722 * - Move it to the upper 32 of the destination
1723 * - Then multiply the lower 32-bits of the operands and add the result to the destination.
1724 *
1725 * (op dest src )
1726 * movdqa %xmm2, %xmm1
1727 * movdqa %xmm3, %xmm0
1728 * psrlq %xmm3, $0x20
1729 * pmuludq %xmm3, %xmm2
1730 * psrlq %xmm1, $0x20
1731 * pmuludq %xmm1, %xmm0
1732 * paddq %xmm1, %xmm3
1733 * psllq %xmm1, $0x20
1734 * pmuludq %xmm2, %xmm0
1735 * paddq %xmm1, %xmm2
1736 *
1737 * When both the operands are the same, then we need to calculate the lower-32 * higher-32
1738 * calculation only once. Thus we don't need the xmm3 temp above. That sequence becomes:
1739 *
1740 * (op dest src )
1741 * movdqa %xmm2, %xmm1
1742 * psrlq %xmm1, $0x20
1743 * pmuludq %xmm1, %xmm0
1744 * paddq %xmm1, %xmm1
1745 * psllq %xmm1, $0x20
1746 * pmuludq %xmm2, %xmm0
1747 * paddq %xmm1, %xmm2
1748 *
1749 */
1750
1751 bool both_operands_same = (rs_dest_src1.GetReg() == rs_src2.GetReg());
1752
1753 RegStorage rs_tmp_vector_1;
1754 RegStorage rs_tmp_vector_2;
1755 rs_tmp_vector_1 = Get128BitRegister(AllocTempDouble());
1756 NewLIR2(kX86MovdqaRR, rs_tmp_vector_1.GetReg(), rs_dest_src1.GetReg());
1757
1758 if (both_operands_same == false) {
1759 rs_tmp_vector_2 = Get128BitRegister(AllocTempDouble());
1760 NewLIR2(kX86MovdqaRR, rs_tmp_vector_2.GetReg(), rs_src2.GetReg());
1761 NewLIR2(kX86PsrlqRI, rs_tmp_vector_2.GetReg(), 0x20);
1762 NewLIR2(kX86PmuludqRR, rs_tmp_vector_2.GetReg(), rs_tmp_vector_1.GetReg());
1763 }
1764
1765 NewLIR2(kX86PsrlqRI, rs_dest_src1.GetReg(), 0x20);
1766 NewLIR2(kX86PmuludqRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1767
1768 if (both_operands_same == false) {
1769 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_2.GetReg());
1770 } else {
1771 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1772 }
1773
1774 NewLIR2(kX86PsllqRI, rs_dest_src1.GetReg(), 0x20);
1775 NewLIR2(kX86PmuludqRR, rs_tmp_vector_1.GetReg(), rs_src2.GetReg());
1776 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001777}
1778
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001779void X86Mir2Lir::GenMultiplyVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001780 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1781 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1782 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001783 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001784 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001785 int opcode = 0;
1786 switch (opsize) {
1787 case k32:
1788 opcode = kX86PmulldRR;
1789 break;
1790 case kSignedHalf:
1791 opcode = kX86PmullwRR;
1792 break;
1793 case kSingle:
1794 opcode = kX86MulpsRR;
1795 break;
1796 case kDouble:
1797 opcode = kX86MulpdRR;
1798 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001799 case kSignedByte:
1800 // HW doesn't support 16x16 byte multiplication so emulate it.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001801 GenMultiplyVectorSignedByte(rs_dest_src1, rs_src2);
1802 return;
1803 case k64:
1804 GenMultiplyVectorLong(rs_dest_src1, rs_src2);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001805 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001806 default:
1807 LOG(FATAL) << "Unsupported vector multiply " << opsize;
1808 break;
1809 }
1810 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1811}
1812
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001813void X86Mir2Lir::GenAddVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001814 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1815 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1816 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001817 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001818 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001819 int opcode = 0;
1820 switch (opsize) {
1821 case k32:
1822 opcode = kX86PadddRR;
1823 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001824 case k64:
1825 opcode = kX86PaddqRR;
1826 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001827 case kSignedHalf:
1828 case kUnsignedHalf:
1829 opcode = kX86PaddwRR;
1830 break;
1831 case kUnsignedByte:
1832 case kSignedByte:
1833 opcode = kX86PaddbRR;
1834 break;
1835 case kSingle:
1836 opcode = kX86AddpsRR;
1837 break;
1838 case kDouble:
1839 opcode = kX86AddpdRR;
1840 break;
1841 default:
1842 LOG(FATAL) << "Unsupported vector addition " << opsize;
1843 break;
1844 }
1845 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1846}
1847
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001848void X86Mir2Lir::GenSubtractVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001849 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1850 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1851 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001852 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001853 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001854 int opcode = 0;
1855 switch (opsize) {
1856 case k32:
1857 opcode = kX86PsubdRR;
1858 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001859 case k64:
1860 opcode = kX86PsubqRR;
1861 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001862 case kSignedHalf:
1863 case kUnsignedHalf:
1864 opcode = kX86PsubwRR;
1865 break;
1866 case kUnsignedByte:
1867 case kSignedByte:
1868 opcode = kX86PsubbRR;
1869 break;
1870 case kSingle:
1871 opcode = kX86SubpsRR;
1872 break;
1873 case kDouble:
1874 opcode = kX86SubpdRR;
1875 break;
1876 default:
1877 LOG(FATAL) << "Unsupported vector subtraction " << opsize;
1878 break;
1879 }
1880 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1881}
1882
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001883void X86Mir2Lir::GenShiftByteVector(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001884 // Destination does not need clobbered because it has already been as part
1885 // of the general packed shift handler (caller of this method).
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001886 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001887
1888 int opcode = 0;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001889 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
1890 case kMirOpPackedShiftLeft:
1891 opcode = kX86PsllwRI;
1892 break;
1893 case kMirOpPackedSignedShiftRight:
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001894 case kMirOpPackedUnsignedShiftRight:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001895 // TODO Add support for emulated byte shifts.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001896 default:
1897 LOG(FATAL) << "Unsupported shift operation on byte vector " << opcode;
1898 break;
1899 }
1900
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001901 // Clear xmm register and return if shift more than byte length.
1902 int imm = mir->dalvikInsn.vB;
1903 if (imm >= 8) {
1904 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1905 return;
1906 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001907
1908 // Shift lower values.
1909 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1910
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001911 /*
1912 * The above shift will shift the whole word, but that means
1913 * both the bytes will shift as well. To emulate a byte level
1914 * shift, we can just throw away the lower (8 - N) bits of the
1915 * upper byte, and we are done.
1916 */
1917 uint8_t byte_mask = 0xFF << imm;
1918 uint32_t int_mask = byte_mask;
1919 int_mask = int_mask << 8 | byte_mask;
1920 int_mask = int_mask << 8 | byte_mask;
1921 int_mask = int_mask << 8 | byte_mask;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001922
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001923 // And the destination with the mask
1924 AndMaskVectorRegister(rs_dest_src1, int_mask, int_mask, int_mask, int_mask);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001925}
1926
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001927void X86Mir2Lir::GenShiftLeftVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001928 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1929 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1930 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001931 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001932 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001933 int opcode = 0;
1934 switch (opsize) {
1935 case k32:
1936 opcode = kX86PslldRI;
1937 break;
1938 case k64:
1939 opcode = kX86PsllqRI;
1940 break;
1941 case kSignedHalf:
1942 case kUnsignedHalf:
1943 opcode = kX86PsllwRI;
1944 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001945 case kSignedByte:
1946 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001947 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001948 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001949 default:
1950 LOG(FATAL) << "Unsupported vector shift left " << opsize;
1951 break;
1952 }
1953 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1954}
1955
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001956void X86Mir2Lir::GenSignedShiftRightVector(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 = kX86PsradRI;
1966 break;
1967 case kSignedHalf:
1968 case kUnsignedHalf:
1969 opcode = kX86PsrawRI;
1970 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001971 case kSignedByte:
1972 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001973 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001974 return;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001975 case k64:
1976 // TODO Implement emulated shift algorithm.
Mark Mendellfe945782014-05-22 09:52:36 -04001977 default:
1978 LOG(FATAL) << "Unsupported vector signed shift right " << opsize;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001979 UNREACHABLE();
Mark Mendellfe945782014-05-22 09:52:36 -04001980 }
1981 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1982}
1983
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001984void X86Mir2Lir::GenUnsignedShiftRightVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001985 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1986 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1987 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001988 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001989 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001990 int opcode = 0;
1991 switch (opsize) {
1992 case k32:
1993 opcode = kX86PsrldRI;
1994 break;
1995 case k64:
1996 opcode = kX86PsrlqRI;
1997 break;
1998 case kSignedHalf:
1999 case kUnsignedHalf:
2000 opcode = kX86PsrlwRI;
2001 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002002 case kSignedByte:
2003 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002004 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002005 return;
Mark Mendellfe945782014-05-22 09:52:36 -04002006 default:
2007 LOG(FATAL) << "Unsupported vector unsigned shift right " << opsize;
2008 break;
2009 }
2010 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
2011}
2012
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002013void X86Mir2Lir::GenAndVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04002014 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002015 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
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 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002019 NewLIR2(kX86PandRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2020}
2021
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002022void X86Mir2Lir::GenOrVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04002023 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002024 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2025 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002026 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002027 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002028 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2029}
2030
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002031void X86Mir2Lir::GenXorVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04002032 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002033 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2034 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002035 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002036 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002037 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2038}
2039
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002040void X86Mir2Lir::AndMaskVectorRegister(RegStorage rs_src1, uint32_t m1, uint32_t m2, uint32_t m3, uint32_t m4) {
2041 MaskVectorRegister(kX86PandRM, rs_src1, m1, m2, m3, m4);
2042}
2043
2044void X86Mir2Lir::MaskVectorRegister(X86OpCode opcode, RegStorage rs_src1, uint32_t m0, uint32_t m1, uint32_t m2, uint32_t m3) {
2045 // Create temporary MIR as container for 128-bit binary mask.
2046 MIR const_mir;
2047 MIR* const_mirp = &const_mir;
2048 const_mirp->dalvikInsn.opcode = static_cast<Instruction::Code>(kMirOpConstVector);
2049 const_mirp->dalvikInsn.arg[0] = m0;
2050 const_mirp->dalvikInsn.arg[1] = m1;
2051 const_mirp->dalvikInsn.arg[2] = m2;
2052 const_mirp->dalvikInsn.arg[3] = m3;
2053
2054 // Mask vector with const from literal pool.
2055 AppendOpcodeWithConst(opcode, rs_src1.GetReg(), const_mirp);
2056}
2057
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002058void X86Mir2Lir::GenAddReduceVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002059 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002060 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
2061 bool is_wide = opsize == k64 || opsize == kDouble;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002062
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002063 // Get the location of the virtual register. Since this bytecode is overloaded
2064 // for different types (and sizes), we need different logic for each path.
2065 // The design of bytecode uses same VR for source and destination.
2066 RegLocation rl_src, rl_dest, rl_result;
2067 if (is_wide) {
2068 rl_src = mir_graph_->GetSrcWide(mir, 0);
2069 rl_dest = mir_graph_->GetDestWide(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002070 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002071 rl_src = mir_graph_->GetSrc(mir, 0);
2072 rl_dest = mir_graph_->GetDest(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002073 }
2074
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002075 // We need a temp for byte and short values
2076 RegStorage temp;
2077
2078 // There is a different path depending on type and size.
2079 if (opsize == kSingle) {
2080 // Handle float case.
2081 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
2082
2083 rl_src = LoadValue(rl_src, kFPReg);
2084 rl_result = EvalLoc(rl_dest, kFPReg, true);
2085
2086 // Since we are doing an add-reduce, we move the reg holding the VR
2087 // into the result so we include it in result.
2088 OpRegCopy(rl_result.reg, rl_src.reg);
2089 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2090
2091 // Since FP must keep order of operation for value safety, we shift to low
2092 // 32-bits and add to result.
2093 for (int i = 0; i < 3; i++) {
2094 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), 0x39);
2095 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2096 }
2097
2098 StoreValue(rl_dest, rl_result);
2099 } else if (opsize == kDouble) {
2100 // Handle double case.
2101 rl_src = LoadValueWide(rl_src, kFPReg);
2102 rl_result = EvalLocWide(rl_dest, kFPReg, true);
2103 LOG(FATAL) << "Unsupported vector add reduce for double.";
2104 } else if (opsize == k64) {
2105 /*
2106 * Handle long case:
2107 * 1) Reduce the vector register to lower half (with addition).
2108 * 1-1) Get an xmm temp and fill it with vector register.
2109 * 1-2) Shift the xmm temp by 8-bytes.
2110 * 1-3) Add the xmm temp to vector register that is being reduced.
2111 * 2) Allocate temp GP / GP pair.
2112 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2113 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2114 * 3) Finish the add reduction by doing what add-long/2addr does,
2115 * but instead of having a VR as one of the sources, we have our temp GP.
2116 */
2117 RegStorage rs_tmp_vector = Get128BitRegister(AllocTempDouble());
2118 NewLIR2(kX86MovdqaRR, rs_tmp_vector.GetReg(), vector_src.GetReg());
2119 NewLIR2(kX86PsrldqRI, rs_tmp_vector.GetReg(), 8);
2120 NewLIR2(kX86PaddqRR, vector_src.GetReg(), rs_tmp_vector.GetReg());
2121 FreeTemp(rs_tmp_vector);
2122
2123 // We would like to be able to reuse the add-long implementation, so set up a fake
2124 // register location to pass it.
2125 RegLocation temp_loc = mir_graph_->GetBadLoc();
2126 temp_loc.core = 1;
2127 temp_loc.wide = 1;
2128 temp_loc.location = kLocPhysReg;
2129 temp_loc.reg = AllocTempWide();
2130
2131 if (cu_->target64) {
2132 DCHECK(!temp_loc.reg.IsPair());
2133 NewLIR2(kX86MovqrxRR, temp_loc.reg.GetReg(), vector_src.GetReg());
2134 } else {
2135 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetLowReg(), vector_src.GetReg());
2136 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2137 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetHighReg(), vector_src.GetReg());
2138 }
2139
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002140 GenArithOpLong(Instruction::ADD_LONG_2ADDR, rl_dest, temp_loc, temp_loc, mir->optimization_flags);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002141 } else if (opsize == kSignedByte || opsize == kUnsignedByte) {
2142 RegStorage rs_tmp = Get128BitRegister(AllocTempDouble());
2143 NewLIR2(kX86PxorRR, rs_tmp.GetReg(), rs_tmp.GetReg());
2144 NewLIR2(kX86PsadbwRR, vector_src.GetReg(), rs_tmp.GetReg());
2145 NewLIR3(kX86PshufdRRI, rs_tmp.GetReg(), vector_src.GetReg(), 0x4e);
2146 NewLIR2(kX86PaddbRR, vector_src.GetReg(), rs_tmp.GetReg());
2147 // Move to a GPR
2148 temp = AllocTemp();
2149 NewLIR2(kX86MovdrxRR, temp.GetReg(), vector_src.GetReg());
2150 } else {
2151 // Handle and the int and short cases together
2152
2153 // Initialize as if we were handling int case. Below we update
2154 // the opcode if handling byte or short.
2155 int vec_bytes = (mir->dalvikInsn.vC & 0xFFFF) / 8;
2156 int vec_unit_size;
2157 int horizontal_add_opcode;
2158 int extract_opcode;
2159
2160 if (opsize == kSignedHalf || opsize == kUnsignedHalf) {
2161 extract_opcode = kX86PextrwRRI;
2162 horizontal_add_opcode = kX86PhaddwRR;
2163 vec_unit_size = 2;
2164 } else if (opsize == k32) {
2165 vec_unit_size = 4;
2166 horizontal_add_opcode = kX86PhadddRR;
2167 extract_opcode = kX86PextrdRRI;
2168 } else {
2169 LOG(FATAL) << "Unsupported vector add reduce " << opsize;
2170 return;
2171 }
2172
2173 int elems = vec_bytes / vec_unit_size;
2174
2175 while (elems > 1) {
2176 NewLIR2(horizontal_add_opcode, vector_src.GetReg(), vector_src.GetReg());
2177 elems >>= 1;
2178 }
2179
2180 // Handle this as arithmetic unary case.
2181 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2182
2183 // Extract to a GP register because this is integral typed.
2184 temp = AllocTemp();
2185 NewLIR3(extract_opcode, temp.GetReg(), vector_src.GetReg(), 0);
2186 }
2187
2188 if (opsize != k64 && opsize != kSingle && opsize != kDouble) {
2189 // The logic below looks very similar to the handling of ADD_INT_2ADDR
2190 // except the rhs is not a VR but a physical register allocated above.
2191 // No load of source VR is done because it assumes that rl_result will
2192 // share physical register / memory location.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002193 rl_result = UpdateLocTyped(rl_dest);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002194 if (rl_result.location == kLocPhysReg) {
2195 // Ensure res is in a core reg.
2196 rl_result = EvalLoc(rl_dest, kCoreReg, true);
2197 OpRegReg(kOpAdd, rl_result.reg, temp);
2198 StoreFinalValue(rl_dest, rl_result);
2199 } else {
2200 // Do the addition directly to memory.
2201 OpMemReg(kOpAdd, rl_result, temp.GetReg());
2202 }
2203 }
Mark Mendellfe945782014-05-22 09:52:36 -04002204}
2205
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002206void X86Mir2Lir::GenReduceVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002207 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2208 RegLocation rl_dest = mir_graph_->GetDest(mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002209 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002210 RegLocation rl_result;
2211 bool is_wide = false;
2212
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002213 // There is a different path depending on type and size.
2214 if (opsize == kSingle) {
2215 // Handle float case.
2216 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
Mark Mendellfe945782014-05-22 09:52:36 -04002217
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002218 rl_result = EvalLoc(rl_dest, kFPReg, true);
2219 NewLIR2(kX86PxorRR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
2220 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2221
2222 // Since FP must keep order of operation for value safety, we shift to low
2223 // 32-bits and add to result.
2224 for (int i = 0; i < 3; i++) {
2225 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), 0x39);
2226 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002227 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002228
2229 StoreValue(rl_dest, rl_result);
2230 } else if (opsize == kDouble) {
2231 // TODO Handle double case.
2232 LOG(FATAL) << "Unsupported add reduce for double.";
2233 } else if (opsize == k64) {
2234 /*
2235 * Handle long case:
2236 * 1) Reduce the vector register to lower half (with addition).
2237 * 1-1) Get an xmm temp and fill it with vector register.
2238 * 1-2) Shift the xmm temp by 8-bytes.
2239 * 1-3) Add the xmm temp to vector register that is being reduced.
2240 * 2) Evaluate destination to a GP / GP pair.
2241 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2242 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2243 * 3) Store the result to the final destination.
2244 */
Udayan Banerji53cec002014-09-26 10:41:47 -07002245 NewLIR2(kX86PsrldqRI, vector_src.GetReg(), 8);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002246 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2247 if (cu_->target64) {
2248 DCHECK(!rl_result.reg.IsPair());
2249 NewLIR2(kX86MovqrxRR, rl_result.reg.GetReg(), vector_src.GetReg());
2250 } else {
2251 NewLIR2(kX86MovdrxRR, rl_result.reg.GetLowReg(), vector_src.GetReg());
2252 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2253 NewLIR2(kX86MovdrxRR, rl_result.reg.GetHighReg(), vector_src.GetReg());
2254 }
2255
2256 StoreValueWide(rl_dest, rl_result);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002257 } else {
Udayan Banerji53cec002014-09-26 10:41:47 -07002258 int extract_index = mir->dalvikInsn.arg[0];
2259 int extr_opcode = 0;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002260 rl_result = UpdateLocTyped(rl_dest);
Udayan Banerji53cec002014-09-26 10:41:47 -07002261
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002262 // Handle the rest of integral types now.
2263 switch (opsize) {
2264 case k32:
Udayan Banerji53cec002014-09-26 10:41:47 -07002265 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrdRRI : kX86PextrdMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002266 break;
2267 case kSignedHalf:
2268 case kUnsignedHalf:
Udayan Banerji53cec002014-09-26 10:41:47 -07002269 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrwRRI : kX86PextrwMRI;
2270 break;
2271 case kSignedByte:
2272 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrbRRI : kX86PextrbMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002273 break;
2274 default:
2275 LOG(FATAL) << "Unsupported vector reduce " << opsize;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002276 UNREACHABLE();
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002277 }
2278
2279 if (rl_result.location == kLocPhysReg) {
2280 NewLIR3(extr_opcode, rl_result.reg.GetReg(), vector_src.GetReg(), extract_index);
Udayan Banerji53cec002014-09-26 10:41:47 -07002281 StoreFinalValue(rl_dest, rl_result);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002282 } else {
2283 int displacement = SRegOffset(rl_result.s_reg_low);
Razvan A Lupusorub72c7232014-10-28 19:29:52 -07002284 LIR *l = NewLIR4(extr_opcode, rs_rX86_SP_32.GetReg(), displacement, vector_src.GetReg(),
2285 extract_index);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002286 AnnotateDalvikRegAccess(l, displacement >> 2, true /* is_load */, is_wide /* is_64bit */);
2287 AnnotateDalvikRegAccess(l, displacement >> 2, false /* is_load */, is_wide /* is_64bit */);
2288 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002289 }
Mark Mendellfe945782014-05-22 09:52:36 -04002290}
2291
Mark Mendell0a1174e2014-09-11 14:51:02 -04002292void X86Mir2Lir::LoadVectorRegister(RegStorage rs_dest, RegStorage rs_src,
2293 OpSize opsize, int op_mov) {
2294 if (!cu_->target64 && opsize == k64) {
2295 // Logic assumes that longs are loaded in GP register pairs.
2296 NewLIR2(kX86MovdxrRR, rs_dest.GetReg(), rs_src.GetLowReg());
2297 RegStorage r_tmp = AllocTempDouble();
2298 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), rs_src.GetHighReg());
2299 NewLIR2(kX86PunpckldqRR, rs_dest.GetReg(), r_tmp.GetReg());
2300 FreeTemp(r_tmp);
2301 } else {
2302 NewLIR2(op_mov, rs_dest.GetReg(), rs_src.GetReg());
2303 }
2304}
2305
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002306void X86Mir2Lir::GenSetVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002307 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2308 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2309 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002310 Clobber(rs_dest);
2311 int op_shuffle = 0, op_shuffle_high = 0, op_mov = kX86MovdxrRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002312 RegisterClass reg_type = kCoreReg;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002313 bool is_wide = false;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002314
Mark Mendellfe945782014-05-22 09:52:36 -04002315 switch (opsize) {
2316 case k32:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002317 op_shuffle = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002318 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002319 case kSingle:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002320 op_shuffle = kX86PshufdRRI;
2321 op_mov = kX86MovdqaRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002322 reg_type = kFPReg;
2323 break;
2324 case k64:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002325 op_shuffle = kX86PunpcklqdqRR;
Udayan Banerji53cec002014-09-26 10:41:47 -07002326 op_mov = kX86MovqxrRR;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002327 is_wide = true;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002328 break;
2329 case kSignedByte:
2330 case kUnsignedByte:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002331 // We will have the source loaded up in a
2332 // double-word before we use this shuffle
2333 op_shuffle = kX86PshufdRRI;
2334 break;
Mark Mendellfe945782014-05-22 09:52:36 -04002335 case kSignedHalf:
2336 case kUnsignedHalf:
2337 // Handles low quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002338 op_shuffle = kX86PshuflwRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002339 // Handles upper quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002340 op_shuffle_high = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002341 break;
2342 default:
2343 LOG(FATAL) << "Unsupported vector set " << opsize;
2344 break;
2345 }
2346
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002347 // Load the value from the VR into a physical register.
2348 RegLocation rl_src;
2349 if (!is_wide) {
2350 rl_src = mir_graph_->GetSrc(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002351 rl_src = LoadValue(rl_src, reg_type);
2352 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002353 rl_src = mir_graph_->GetSrcWide(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002354 rl_src = LoadValueWide(rl_src, reg_type);
2355 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002356 RegStorage reg_to_shuffle = rl_src.reg;
Mark Mendellfe945782014-05-22 09:52:36 -04002357
2358 // Load the value into the XMM register.
Mark Mendell0a1174e2014-09-11 14:51:02 -04002359 LoadVectorRegister(rs_dest, reg_to_shuffle, opsize, op_mov);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002360
2361 if (opsize == kSignedByte || opsize == kUnsignedByte) {
2362 // In the byte case, first duplicate it to be a word
2363 // Then duplicate it to be a double-word
2364 NewLIR2(kX86PunpcklbwRR, rs_dest.GetReg(), rs_dest.GetReg());
2365 NewLIR2(kX86PunpcklwdRR, rs_dest.GetReg(), rs_dest.GetReg());
2366 }
Mark Mendellfe945782014-05-22 09:52:36 -04002367
2368 // Now shuffle the value across the destination.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002369 if (op_shuffle == kX86PunpcklqdqRR) {
2370 NewLIR2(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg());
2371 } else {
2372 NewLIR3(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg(), 0);
2373 }
Mark Mendellfe945782014-05-22 09:52:36 -04002374
2375 // And then repeat as needed.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002376 if (op_shuffle_high != 0) {
2377 NewLIR3(op_shuffle_high, rs_dest.GetReg(), rs_dest.GetReg(), 0);
Mark Mendellfe945782014-05-22 09:52:36 -04002378 }
2379}
2380
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002381void X86Mir2Lir::GenPackedArrayGet(BasicBlock* bb, MIR* mir) {
2382 UNUSED(bb, mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002383 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayGet not supported.";
2384}
2385
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002386void X86Mir2Lir::GenPackedArrayPut(BasicBlock* bb, MIR* mir) {
2387 UNUSED(bb, mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002388 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayPut not supported.";
2389}
2390
2391LIR* X86Mir2Lir::ScanVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002392 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002393 if (constants[0] == p->operands[0] && constants[1] == p->operands[1] &&
2394 constants[2] == p->operands[2] && constants[3] == p->operands[3]) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002395 return p;
2396 }
2397 }
2398 return nullptr;
2399}
2400
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002401LIR* X86Mir2Lir::AddVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002402 LIR* new_value = static_cast<LIR*>(arena_->Alloc(sizeof(LIR), kArenaAllocData));
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002403 new_value->operands[0] = constants[0];
2404 new_value->operands[1] = constants[1];
2405 new_value->operands[2] = constants[2];
2406 new_value->operands[3] = constants[3];
Mark Mendelld65c51a2014-04-29 16:55:20 -04002407 new_value->next = const_vectors_;
2408 if (const_vectors_ == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002409 estimated_native_code_size_ += 12; // Maximum needed to align to 16 byte boundary.
Mark Mendelld65c51a2014-04-29 16:55:20 -04002410 }
2411 estimated_native_code_size_ += 16; // Space for one vector.
2412 const_vectors_ = new_value;
2413 return new_value;
2414}
2415
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002416// ------------ ABI support: mapping of args to physical registers -------------
Serguei Katkov717a3e42014-11-13 17:19:42 +06002417RegStorage X86Mir2Lir::InToRegStorageX86_64Mapper::GetNextReg(ShortyArg arg) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002418 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3, kArg4, kArg5};
Serguei Katkov717a3e42014-11-13 17:19:42 +06002419 const size_t coreArgMappingToPhysicalRegSize = arraysize(coreArgMappingToPhysicalReg);
Chao-ying Fua77ee512014-07-01 17:43:41 -07002420 const SpecialTargetRegister fpArgMappingToPhysicalReg[] = {kFArg0, kFArg1, kFArg2, kFArg3,
Andreas Gampeccc60262014-07-04 18:02:38 -07002421 kFArg4, kFArg5, kFArg6, kFArg7};
Serguei Katkov717a3e42014-11-13 17:19:42 +06002422 const size_t fpArgMappingToPhysicalRegSize = arraysize(fpArgMappingToPhysicalReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002423
Serguei Katkov717a3e42014-11-13 17:19:42 +06002424 if (arg.IsFP()) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002425 if (cur_fp_reg_ < fpArgMappingToPhysicalRegSize) {
Serguei Katkov717a3e42014-11-13 17:19:42 +06002426 return m2l_->TargetReg(fpArgMappingToPhysicalReg[cur_fp_reg_++],
2427 arg.IsWide() ? kWide : kNotWide);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002428 }
2429 } else {
2430 if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
Serguei Katkov717a3e42014-11-13 17:19:42 +06002431 return m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2432 arg.IsRef() ? kRef : (arg.IsWide() ? kWide : kNotWide));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002433 }
2434 }
Chao-ying Fua77ee512014-07-01 17:43:41 -07002435 return RegStorage::InvalidReg();
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002436}
2437
Serguei Katkov717a3e42014-11-13 17:19:42 +06002438RegStorage X86Mir2Lir::InToRegStorageX86Mapper::GetNextReg(ShortyArg arg) {
2439 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3};
2440 const size_t coreArgMappingToPhysicalRegSize = arraysize(coreArgMappingToPhysicalReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002441
Serguei Katkov717a3e42014-11-13 17:19:42 +06002442 RegStorage result = RegStorage::InvalidReg();
2443 if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
2444 result = m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2445 arg.IsRef() ? kRef : kNotWide);
2446 if (arg.IsWide() && cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
2447 result = RegStorage::MakeRegPair(
2448 result, m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++], kNotWide));
2449 }
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002450 }
Serguei Katkov717a3e42014-11-13 17:19:42 +06002451 return result;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002452}
2453
2454// ---------End of ABI support: mapping of args to physical registers -------------
2455
Andreas Gampe98430592014-07-27 19:44:50 -07002456bool X86Mir2Lir::GenInlinedCharAt(CallInfo* info) {
2457 // Location of reference to data array
2458 int value_offset = mirror::String::ValueOffset().Int32Value();
2459 // Location of count
2460 int count_offset = mirror::String::CountOffset().Int32Value();
2461 // Starting offset within data array
2462 int offset_offset = mirror::String::OffsetOffset().Int32Value();
2463 // Start of char data with array_
2464 int data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Int32Value();
2465
2466 RegLocation rl_obj = info->args[0];
2467 RegLocation rl_idx = info->args[1];
2468 rl_obj = LoadValue(rl_obj, kRefReg);
2469 // X86 wants to avoid putting a constant index into a register.
2470 if (!rl_idx.is_const) {
2471 rl_idx = LoadValue(rl_idx, kCoreReg);
2472 }
2473 RegStorage reg_max;
2474 GenNullCheck(rl_obj.reg, info->opt_flags);
2475 bool range_check = (!(info->opt_flags & MIR_IGNORE_RANGE_CHECK));
2476 LIR* range_check_branch = nullptr;
2477 RegStorage reg_off;
2478 RegStorage reg_ptr;
2479 if (range_check) {
2480 // On x86, we can compare to memory directly
2481 // Set up a launch pad to allow retry in case of bounds violation */
2482 if (rl_idx.is_const) {
2483 LIR* comparison;
2484 range_check_branch = OpCmpMemImmBranch(
2485 kCondUlt, RegStorage::InvalidReg(), rl_obj.reg, count_offset,
2486 mir_graph_->ConstantValue(rl_idx.orig_sreg), nullptr, &comparison);
2487 MarkPossibleNullPointerExceptionAfter(0, comparison);
2488 } else {
2489 OpRegMem(kOpCmp, rl_idx.reg, rl_obj.reg, count_offset);
2490 MarkPossibleNullPointerException(0);
2491 range_check_branch = OpCondBranch(kCondUge, nullptr);
2492 }
2493 }
2494 reg_off = AllocTemp();
2495 reg_ptr = AllocTempRef();
2496 Load32Disp(rl_obj.reg, offset_offset, reg_off);
2497 LoadRefDisp(rl_obj.reg, value_offset, reg_ptr, kNotVolatile);
2498 if (rl_idx.is_const) {
2499 OpRegImm(kOpAdd, reg_off, mir_graph_->ConstantValue(rl_idx.orig_sreg));
2500 } else {
2501 OpRegReg(kOpAdd, reg_off, rl_idx.reg);
2502 }
2503 FreeTemp(rl_obj.reg);
2504 if (rl_idx.location == kLocPhysReg) {
2505 FreeTemp(rl_idx.reg);
2506 }
2507 RegLocation rl_dest = InlineTarget(info);
2508 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
2509 LoadBaseIndexedDisp(reg_ptr, reg_off, 1, data_offset, rl_result.reg, kUnsignedHalf);
2510 FreeTemp(reg_off);
2511 FreeTemp(reg_ptr);
2512 StoreValue(rl_dest, rl_result);
2513 if (range_check) {
2514 DCHECK(range_check_branch != nullptr);
2515 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've already null checked.
2516 AddIntrinsicSlowPath(info, range_check_branch);
2517 }
2518 return true;
2519}
2520
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002521bool X86Mir2Lir::GenInlinedCurrentThread(CallInfo* info) {
2522 RegLocation rl_dest = InlineTarget(info);
2523
2524 // Early exit if the result is unused.
2525 if (rl_dest.orig_sreg < 0) {
2526 return true;
2527 }
2528
2529 RegLocation rl_result = EvalLoc(rl_dest, kRefReg, true);
2530
2531 if (cu_->target64) {
2532 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<8>());
2533 } else {
2534 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<4>());
2535 }
2536
2537 StoreValue(rl_dest, rl_result);
2538 return true;
2539}
2540
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002541/**
2542 * Lock temp registers for explicit usage. Registers will be freed in destructor.
2543 */
2544X86Mir2Lir::ExplicitTempRegisterLock::ExplicitTempRegisterLock(X86Mir2Lir* mir_to_lir,
2545 int n_regs, ...) :
2546 temp_regs_(n_regs),
2547 mir_to_lir_(mir_to_lir) {
2548 va_list regs;
2549 va_start(regs, n_regs);
2550 for (int i = 0; i < n_regs; i++) {
2551 RegStorage reg = *(va_arg(regs, RegStorage*));
2552 RegisterInfo* info = mir_to_lir_->GetRegInfo(reg);
2553
2554 // Make sure we don't have promoted register here.
2555 DCHECK(info->IsTemp());
2556
2557 temp_regs_.push_back(reg);
2558 mir_to_lir_->FlushReg(reg);
2559
2560 if (reg.IsPair()) {
2561 RegStorage partner = info->Partner();
2562 temp_regs_.push_back(partner);
2563 mir_to_lir_->FlushReg(partner);
2564 }
2565
2566 mir_to_lir_->Clobber(reg);
2567 mir_to_lir_->LockTemp(reg);
2568 }
2569
2570 va_end(regs);
2571}
2572
2573/*
2574 * Free all locked registers.
2575 */
2576X86Mir2Lir::ExplicitTempRegisterLock::~ExplicitTempRegisterLock() {
2577 // Free all locked temps.
2578 for (auto it : temp_regs_) {
2579 mir_to_lir_->FreeTemp(it);
2580 }
2581}
2582
Serguei Katkov717a3e42014-11-13 17:19:42 +06002583int X86Mir2Lir::GenDalvikArgsBulkCopy(CallInfo* info, int first, int count) {
2584 if (count < 4) {
2585 // It does not make sense to use this utility if we have no chance to use
2586 // 128-bit move.
2587 return count;
2588 }
2589 GenDalvikArgsFlushPromoted(info, first);
2590
2591 // The rest can be copied together
2592 int current_src_offset = SRegOffset(info->args[first].s_reg_low);
2593 int current_dest_offset = StackVisitor::GetOutVROffset(first, cu_->instruction_set);
2594
2595 // Only davik regs are accessed in this loop; no next_call_insn() calls.
2596 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2597 while (count > 0) {
2598 // This is based on the knowledge that the stack itself is 16-byte aligned.
2599 bool src_is_16b_aligned = (current_src_offset & 0xF) == 0;
2600 bool dest_is_16b_aligned = (current_dest_offset & 0xF) == 0;
2601 size_t bytes_to_move;
2602
2603 /*
2604 * The amount to move defaults to 32-bit. If there are 4 registers left to move, then do a
2605 * a 128-bit move because we won't get the chance to try to aligned. If there are more than
2606 * 4 registers left to move, consider doing a 128-bit only if either src or dest are aligned.
2607 * We do this because we could potentially do a smaller move to align.
2608 */
2609 if (count == 4 || (count > 4 && (src_is_16b_aligned || dest_is_16b_aligned))) {
2610 // Moving 128-bits via xmm register.
2611 bytes_to_move = sizeof(uint32_t) * 4;
2612
2613 // Allocate a free xmm temp. Since we are working through the calling sequence,
2614 // we expect to have an xmm temporary available. AllocTempDouble will abort if
2615 // there are no free registers.
2616 RegStorage temp = AllocTempDouble();
2617
2618 LIR* ld1 = nullptr;
2619 LIR* ld2 = nullptr;
2620 LIR* st1 = nullptr;
2621 LIR* st2 = nullptr;
2622
2623 /*
2624 * The logic is similar for both loads and stores. If we have 16-byte alignment,
2625 * do an aligned move. If we have 8-byte alignment, then do the move in two
2626 * parts. This approach prevents possible cache line splits. Finally, fall back
2627 * to doing an unaligned move. In most cases we likely won't split the cache
2628 * line but we cannot prove it and thus take a conservative approach.
2629 */
2630 bool src_is_8b_aligned = (current_src_offset & 0x7) == 0;
2631 bool dest_is_8b_aligned = (current_dest_offset & 0x7) == 0;
2632
2633 if (src_is_16b_aligned) {
2634 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovA128FP);
2635 } else if (src_is_8b_aligned) {
2636 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovLo128FP);
2637 ld2 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset + (bytes_to_move >> 1),
2638 kMovHi128FP);
2639 } else {
2640 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovU128FP);
2641 }
2642
2643 if (dest_is_16b_aligned) {
2644 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovA128FP);
2645 } else if (dest_is_8b_aligned) {
2646 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovLo128FP);
2647 st2 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset + (bytes_to_move >> 1),
2648 temp, kMovHi128FP);
2649 } else {
2650 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovU128FP);
2651 }
2652
2653 // TODO If we could keep track of aliasing information for memory accesses that are wider
2654 // than 64-bit, we wouldn't need to set up a barrier.
2655 if (ld1 != nullptr) {
2656 if (ld2 != nullptr) {
2657 // For 64-bit load we can actually set up the aliasing information.
2658 AnnotateDalvikRegAccess(ld1, current_src_offset >> 2, true, true);
2659 AnnotateDalvikRegAccess(ld2, (current_src_offset + (bytes_to_move >> 1)) >> 2, true,
2660 true);
2661 } else {
2662 // Set barrier for 128-bit load.
2663 ld1->u.m.def_mask = &kEncodeAll;
2664 }
2665 }
2666 if (st1 != nullptr) {
2667 if (st2 != nullptr) {
2668 // For 64-bit store we can actually set up the aliasing information.
2669 AnnotateDalvikRegAccess(st1, current_dest_offset >> 2, false, true);
2670 AnnotateDalvikRegAccess(st2, (current_dest_offset + (bytes_to_move >> 1)) >> 2, false,
2671 true);
2672 } else {
2673 // Set barrier for 128-bit store.
2674 st1->u.m.def_mask = &kEncodeAll;
2675 }
2676 }
2677
2678 // Free the temporary used for the data movement.
2679 FreeTemp(temp);
2680 } else {
2681 // Moving 32-bits via general purpose register.
2682 bytes_to_move = sizeof(uint32_t);
2683
2684 // Instead of allocating a new temp, simply reuse one of the registers being used
2685 // for argument passing.
2686 RegStorage temp = TargetReg(kArg3, kNotWide);
2687
2688 // Now load the argument VR and store to the outs.
2689 Load32Disp(TargetPtrReg(kSp), current_src_offset, temp);
2690 Store32Disp(TargetPtrReg(kSp), current_dest_offset, temp);
2691 }
2692
2693 current_src_offset += bytes_to_move;
2694 current_dest_offset += bytes_to_move;
2695 count -= (bytes_to_move >> 2);
2696 }
2697 DCHECK_EQ(count, 0);
2698 return count;
2699}
2700
Brian Carlstrom7934ac22013-07-26 10:54:15 -07002701} // namespace art