blob: 230f611de031791f090db3958eff7be9007bdaab [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) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700800 // X86_64 can handle any size.
Elena Sayapinadd644502014-07-01 18:39:52 +0700801 if (cu_->target64) {
Chao-ying Fu06839f82014-08-14 15:59:17 -0700802 return RegClassBySize(size);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700803 }
804
Vladimir Marko674744e2014-04-24 15:18:26 +0100805 if (UNLIKELY(is_volatile)) {
806 // On x86, atomic 64-bit load/store requires an fp register.
807 // Smaller aligned load/store is atomic for both core and fp registers.
808 if (size == k64 || size == kDouble) {
809 return kFPReg;
810 }
811 }
812 return RegClassBySize(size);
813}
814
Elena Sayapinadd644502014-07-01 18:39:52 +0700815X86Mir2Lir::X86Mir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena)
Mark Mendell55d0eac2014-02-06 11:02:52 -0800816 : Mir2Lir(cu, mir_graph, arena),
Serguei Katkov717a3e42014-11-13 17:19:42 +0600817 in_to_reg_storage_x86_64_mapper_(this), in_to_reg_storage_x86_mapper_(this),
Ian Rogersdd7624d2014-03-14 17:43:00 -0700818 base_of_code_(nullptr), store_method_addr_(false), store_method_addr_used_(false),
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100819 method_address_insns_(arena->Adapter()),
820 class_type_address_insns_(arena->Adapter()),
821 call_method_insns_(arena->Adapter()),
Elena Sayapinadd644502014-07-01 18:39:52 +0700822 stack_decrement_(nullptr), stack_increment_(nullptr),
Mark Mendelld65c51a2014-04-29 16:55:20 -0400823 const_vectors_(nullptr) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100824 method_address_insns_.reserve(100);
825 class_type_address_insns_.reserve(100);
826 call_method_insns_.reserve(100);
Mark Mendelld65c51a2014-04-29 16:55:20 -0400827 store_method_addr_used_ = false;
Ian Rogersdd7624d2014-03-14 17:43:00 -0700828 for (int i = 0; i < kX86Last; i++) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700829 DCHECK_EQ(X86Mir2Lir::EncodingMap[i].opcode, i)
830 << "Encoding order for " << X86Mir2Lir::EncodingMap[i].name
831 << " is wrong: expecting " << i << ", seeing "
832 << static_cast<int>(X86Mir2Lir::EncodingMap[i].opcode);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700833 }
834}
835
836Mir2Lir* X86CodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
837 ArenaAllocator* const arena) {
Elena Sayapinadd644502014-07-01 18:39:52 +0700838 return new X86Mir2Lir(cu, mir_graph, arena);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700839}
840
Andreas Gampe98430592014-07-27 19:44:50 -0700841// Not used in x86(-64)
842RegStorage X86Mir2Lir::LoadHelper(QuickEntrypointEnum trampoline) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700843 UNUSED(trampoline);
Andreas Gampe2f244e92014-05-08 03:35:25 -0700844 LOG(FATAL) << "Unexpected use of LoadHelper in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700845 UNREACHABLE();
Andreas Gampe2f244e92014-05-08 03:35:25 -0700846}
847
Dave Allisonb373e092014-02-20 16:06:36 -0800848LIR* X86Mir2Lir::CheckSuspendUsingLoad() {
Dave Allison69dfe512014-07-11 17:11:58 +0000849 // First load the pointer in fs:[suspend-trigger] into eax
850 // Then use a test instruction to indirect via that address.
Dave Allisondfd3b472014-07-16 16:04:32 -0700851 if (cu_->target64) {
852 NewLIR2(kX86Mov64RT, rs_rAX.GetReg(),
853 Thread::ThreadSuspendTriggerOffset<8>().Int32Value());
854 } else {
855 NewLIR2(kX86Mov32RT, rs_rAX.GetReg(),
856 Thread::ThreadSuspendTriggerOffset<4>().Int32Value());
857 }
Dave Allison69dfe512014-07-11 17:11:58 +0000858 return NewLIR3(kX86Test32RM, rs_rAX.GetReg(), rs_rAX.GetReg(), 0);
Dave Allisonb373e092014-02-20 16:06:36 -0800859}
860
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700861uint64_t X86Mir2Lir::GetTargetInstFlags(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700862 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700863 return X86Mir2Lir::EncodingMap[opcode].flags;
864}
865
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700866const char* X86Mir2Lir::GetTargetInstName(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700867 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700868 return X86Mir2Lir::EncodingMap[opcode].name;
869}
870
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700871const char* X86Mir2Lir::GetTargetInstFmt(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700872 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700873 return X86Mir2Lir::EncodingMap[opcode].fmt;
874}
875
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000876void X86Mir2Lir::GenConstWide(RegLocation rl_dest, int64_t value) {
877 // Can we do this directly to memory?
878 rl_dest = UpdateLocWide(rl_dest);
879 if ((rl_dest.location == kLocDalvikFrame) ||
880 (rl_dest.location == kLocCompilerTemp)) {
881 int32_t val_lo = Low32Bits(value);
882 int32_t val_hi = High32Bits(value);
Ian Rogersb28c1c02014-11-08 11:21:21 -0800883 int r_base = rs_rX86_SP_32.GetReg();
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000884 int displacement = SRegOffset(rl_dest.s_reg_low);
885
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100886 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
buzbee2700f7e2014-03-07 09:46:20 -0800887 LIR * store = NewLIR3(kX86Mov32MI, r_base, displacement + LOWORD_OFFSET, val_lo);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000888 AnnotateDalvikRegAccess(store, (displacement + LOWORD_OFFSET) >> 2,
889 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -0800890 store = NewLIR3(kX86Mov32MI, r_base, displacement + HIWORD_OFFSET, val_hi);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000891 AnnotateDalvikRegAccess(store, (displacement + HIWORD_OFFSET) >> 2,
892 false /* is_load */, true /* is64bit */);
893 return;
894 }
895
896 // Just use the standard code to do the generation.
897 Mir2Lir::GenConstWide(rl_dest, value);
898}
Mark Mendelle02d48f2014-01-15 11:19:23 -0800899
900// TODO: Merge with existing RegLocation dumper in vreg_analysis.cc
901void X86Mir2Lir::DumpRegLocation(RegLocation loc) {
902 LOG(INFO) << "location: " << loc.location << ','
903 << (loc.wide ? " w" : " ")
904 << (loc.defined ? " D" : " ")
905 << (loc.is_const ? " c" : " ")
906 << (loc.fp ? " F" : " ")
907 << (loc.core ? " C" : " ")
908 << (loc.ref ? " r" : " ")
909 << (loc.high_word ? " h" : " ")
910 << (loc.home ? " H" : " ")
buzbee2700f7e2014-03-07 09:46:20 -0800911 << ", low: " << static_cast<int>(loc.reg.GetLowReg())
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000912 << ", high: " << static_cast<int>(loc.reg.GetHighReg())
Mark Mendelle02d48f2014-01-15 11:19:23 -0800913 << ", s_reg: " << loc.s_reg_low
914 << ", orig: " << loc.orig_sreg;
915}
916
Mark Mendell67c39c42014-01-31 17:28:00 -0800917void X86Mir2Lir::Materialize() {
918 // A good place to put the analysis before starting.
919 AnalyzeMIR();
920
921 // Now continue with regular code generation.
922 Mir2Lir::Materialize();
923}
924
Jeff Hao49161ce2014-03-12 11:05:25 -0700925void X86Mir2Lir::LoadMethodAddress(const MethodReference& target_method, InvokeType type,
Mark Mendell55d0eac2014-02-06 11:02:52 -0800926 SpecialTargetRegister symbolic_reg) {
927 /*
928 * For x86, just generate a 32 bit move immediate instruction, that will be filled
929 * in at 'link time'. For now, put a unique value based on target to ensure that
930 * code deduplication works.
931 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700932 int target_method_idx = target_method.dex_method_index;
933 const DexFile* target_dex_file = target_method.dex_file;
934 const DexFile::MethodId& target_method_id = target_dex_file->GetMethodId(target_method_idx);
935 uintptr_t target_method_id_ptr = reinterpret_cast<uintptr_t>(&target_method_id);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800936
Jeff Hao49161ce2014-03-12 11:05:25 -0700937 // Generate the move instruction with the unique pointer and save index, dex_file, and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700938 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
939 TargetReg(symbolic_reg, kNotWide).GetReg(),
Jeff Hao49161ce2014-03-12 11:05:25 -0700940 static_cast<int>(target_method_id_ptr), target_method_idx,
941 WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800942 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100943 method_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800944}
945
Fred Shihe7f82e22014-08-06 10:46:37 -0700946void X86Mir2Lir::LoadClassType(const DexFile& dex_file, uint32_t type_idx,
947 SpecialTargetRegister symbolic_reg) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800948 /*
949 * For x86, just generate a 32 bit move immediate instruction, that will be filled
950 * in at 'link time'. For now, put a unique value based on target to ensure that
951 * code deduplication works.
952 */
Fred Shihe7f82e22014-08-06 10:46:37 -0700953 const DexFile::TypeId& id = dex_file.GetTypeId(type_idx);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800954 uintptr_t ptr = reinterpret_cast<uintptr_t>(&id);
955
956 // Generate the move instruction with the unique pointer and save index and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700957 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
958 TargetReg(symbolic_reg, kNotWide).GetReg(),
Fred Shihe7f82e22014-08-06 10:46:37 -0700959 static_cast<int>(ptr), type_idx,
960 WrapPointer(const_cast<DexFile*>(&dex_file)));
Mark Mendell55d0eac2014-02-06 11:02:52 -0800961 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100962 class_type_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800963}
964
Vladimir Markof4da6752014-08-01 19:04:18 +0100965LIR* X86Mir2Lir::CallWithLinkerFixup(const MethodReference& target_method, InvokeType type) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800966 /*
967 * For x86, just generate a 32 bit call relative instruction, that will be filled
Vladimir Markof4da6752014-08-01 19:04:18 +0100968 * in at 'link time'.
Mark Mendell55d0eac2014-02-06 11:02:52 -0800969 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700970 int target_method_idx = target_method.dex_method_index;
971 const DexFile* target_dex_file = target_method.dex_file;
Mark Mendell55d0eac2014-02-06 11:02:52 -0800972
Jeff Hao49161ce2014-03-12 11:05:25 -0700973 // Generate the call instruction with the unique pointer and save index, dex_file, and type.
Vladimir Markof4da6752014-08-01 19:04:18 +0100974 // NOTE: Method deduplication takes linker patches into account, so we can just pass 0
975 // as a placeholder for the offset.
976 LIR* call = RawLIR(current_dalvik_offset_, kX86CallI, 0,
Jeff Hao49161ce2014-03-12 11:05:25 -0700977 target_method_idx, WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800978 AppendLIR(call);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100979 call_method_insns_.push_back(call);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800980 return call;
981}
982
Vladimir Markof4da6752014-08-01 19:04:18 +0100983static LIR* GenInvokeNoInlineCall(Mir2Lir* mir_to_lir, InvokeType type) {
984 QuickEntrypointEnum trampoline;
985 switch (type) {
986 case kInterface:
987 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
988 break;
989 case kDirect:
990 trampoline = kQuickInvokeDirectTrampolineWithAccessCheck;
991 break;
992 case kStatic:
993 trampoline = kQuickInvokeStaticTrampolineWithAccessCheck;
994 break;
995 case kSuper:
996 trampoline = kQuickInvokeSuperTrampolineWithAccessCheck;
997 break;
998 case kVirtual:
999 trampoline = kQuickInvokeVirtualTrampolineWithAccessCheck;
1000 break;
1001 default:
1002 LOG(FATAL) << "Unexpected invoke type";
1003 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
1004 }
1005 return mir_to_lir->InvokeTrampoline(kOpBlx, RegStorage::InvalidReg(), trampoline);
1006}
1007
1008LIR* X86Mir2Lir::GenCallInsn(const MirMethodLoweringInfo& method_info) {
1009 LIR* call_insn;
1010 if (method_info.FastPath()) {
1011 if (method_info.DirectCode() == static_cast<uintptr_t>(-1)) {
1012 // We can have the linker fixup a call relative.
1013 call_insn = CallWithLinkerFixup(method_info.GetTargetMethod(), method_info.GetSharpType());
1014 } else {
1015 call_insn = OpMem(kOpBlx, TargetReg(kArg0, kRef),
Mathieu Chartier2d721012014-11-10 11:08:06 -08001016 mirror::ArtMethod::EntryPointFromQuickCompiledCodeOffset(
1017 cu_->target64 ? 8 : 4).Int32Value());
Vladimir Markof4da6752014-08-01 19:04:18 +01001018 }
1019 } else {
1020 call_insn = GenInvokeNoInlineCall(this, method_info.GetSharpType());
1021 }
1022 return call_insn;
1023}
1024
Mark Mendell55d0eac2014-02-06 11:02:52 -08001025void X86Mir2Lir::InstallLiteralPools() {
1026 // These are handled differently for x86.
1027 DCHECK(code_literal_list_ == nullptr);
1028 DCHECK(method_literal_list_ == nullptr);
1029 DCHECK(class_literal_list_ == nullptr);
1030
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001031
Mark Mendelld65c51a2014-04-29 16:55:20 -04001032 if (const_vectors_ != nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001033 // Vector literals must be 16-byte aligned. The header that is placed
1034 // in the code section causes misalignment so we take it into account.
1035 // Otherwise, we are sure that for x86 method is aligned to 16.
1036 DCHECK_EQ(GetInstructionSetAlignment(cu_->instruction_set), 16u);
1037 uint32_t bytes_to_fill = (0x10 - ((code_buffer_.size() + sizeof(OatQuickMethodHeader)) & 0xF)) & 0xF;
1038 while (bytes_to_fill > 0) {
1039 code_buffer_.push_back(0);
1040 bytes_to_fill--;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001041 }
1042
Mark Mendelld65c51a2014-04-29 16:55:20 -04001043 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Tong Shen547cdfd2014-08-05 01:54:19 -07001044 PushWord(&code_buffer_, p->operands[0]);
1045 PushWord(&code_buffer_, p->operands[1]);
1046 PushWord(&code_buffer_, p->operands[2]);
1047 PushWord(&code_buffer_, p->operands[3]);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001048 }
1049 }
1050
Mark Mendell55d0eac2014-02-06 11:02:52 -08001051 // Handle the fixups for methods.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001052 for (LIR* p : method_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001053 DCHECK_EQ(p->opcode, kX86Mov32RI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001054 uint32_t target_method_idx = p->operands[2];
1055 const DexFile* target_dex_file =
1056 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[3]));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001057
1058 // The offset to patch is the last 4 bytes of the instruction.
1059 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001060 patches_.push_back(LinkerPatch::MethodPatch(patch_offset,
1061 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001062 }
1063
1064 // Handle the fixups for class types.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001065 for (LIR* p : class_type_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001066 DCHECK_EQ(p->opcode, kX86Mov32RI);
Fred Shihe7f82e22014-08-06 10:46:37 -07001067
1068 const DexFile* class_dex_file =
1069 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[3]));
Vladimir Markof4da6752014-08-01 19:04:18 +01001070 uint32_t target_type_idx = p->operands[2];
Mark Mendell55d0eac2014-02-06 11:02:52 -08001071
1072 // The offset to patch is the last 4 bytes of the instruction.
1073 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001074 patches_.push_back(LinkerPatch::TypePatch(patch_offset,
1075 class_dex_file, target_type_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001076 }
1077
1078 // And now the PC-relative calls to methods.
Vladimir Markof4da6752014-08-01 19:04:18 +01001079 patches_.reserve(call_method_insns_.size());
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001080 for (LIR* p : call_method_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001081 DCHECK_EQ(p->opcode, kX86CallI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001082 uint32_t target_method_idx = p->operands[1];
1083 const DexFile* target_dex_file =
1084 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[2]));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001085
1086 // The offset to patch is the last 4 bytes of the instruction.
1087 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001088 patches_.push_back(LinkerPatch::RelativeCodePatch(patch_offset,
1089 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001090 }
1091
1092 // And do the normal processing.
1093 Mir2Lir::InstallLiteralPools();
1094}
1095
DaniilSokolov70c4f062014-06-24 17:34:00 -07001096bool X86Mir2Lir::GenInlinedArrayCopyCharArray(CallInfo* info) {
DaniilSokolov70c4f062014-06-24 17:34:00 -07001097 RegLocation rl_src = info->args[0];
1098 RegLocation rl_srcPos = info->args[1];
1099 RegLocation rl_dst = info->args[2];
1100 RegLocation rl_dstPos = info->args[3];
1101 RegLocation rl_length = info->args[4];
1102 if (rl_srcPos.is_const && (mir_graph_->ConstantValue(rl_srcPos) < 0)) {
1103 return false;
1104 }
1105 if (rl_dstPos.is_const && (mir_graph_->ConstantValue(rl_dstPos) < 0)) {
1106 return false;
1107 }
1108 ClobberCallerSave();
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001109 LockCallTemps(); // Using fixed registers.
1110 RegStorage tmp_reg = cu_->target64 ? rs_r11 : rs_rBX;
1111 LoadValueDirectFixed(rl_src, rs_rAX);
1112 LoadValueDirectFixed(rl_dst, rs_rCX);
1113 LIR* src_dst_same = OpCmpBranch(kCondEq, rs_rAX, rs_rCX, nullptr);
1114 LIR* src_null_branch = OpCmpImmBranch(kCondEq, rs_rAX, 0, nullptr);
1115 LIR* dst_null_branch = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1116 LoadValueDirectFixed(rl_length, rs_rDX);
1117 // If the length of the copy is > 128 characters (256 bytes) or negative then go slow path.
1118 LIR* len_too_big = OpCmpImmBranch(kCondHi, rs_rDX, 128, nullptr);
1119 LoadValueDirectFixed(rl_src, rs_rAX);
1120 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001121 LIR* src_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001122 LIR* src_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001123 LIR* srcPos_negative = nullptr;
1124 if (!rl_srcPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001125 LoadValueDirectFixed(rl_srcPos, tmp_reg);
1126 srcPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001127 // src_pos < src_len
1128 src_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1129 // src_len - src_pos < copy_len
1130 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1131 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001132 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001133 int32_t pos_val = mir_graph_->ConstantValue(rl_srcPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001134 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001135 src_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001136 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001137 // src_pos < src_len
1138 src_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1139 // src_len - src_pos < copy_len
1140 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1141 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001142 }
1143 }
1144 LIR* dstPos_negative = nullptr;
1145 LIR* dst_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001146 LIR* dst_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001147 LoadValueDirectFixed(rl_dst, rs_rAX);
1148 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
1149 if (!rl_dstPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001150 LoadValueDirectFixed(rl_dstPos, tmp_reg);
1151 dstPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001152 // dst_pos < dst_len
1153 dst_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1154 // dst_len - dst_pos < copy_len
1155 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1156 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001157 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001158 int32_t pos_val = mir_graph_->ConstantValue(rl_dstPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001159 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001160 dst_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001161 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001162 // dst_pos < dst_len
1163 dst_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1164 // dst_len - dst_pos < copy_len
1165 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1166 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001167 }
1168 }
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001169 // Everything is checked now.
1170 LoadValueDirectFixed(rl_src, rs_rAX);
1171 LoadValueDirectFixed(rl_dst, tmp_reg);
1172 LoadValueDirectFixed(rl_srcPos, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001173 NewLIR5(kX86Lea32RA, rs_rAX.GetReg(), rs_rAX.GetReg(),
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001174 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value());
1175 // RAX now holds the address of the first src element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001176
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001177 LoadValueDirectFixed(rl_dstPos, rs_rCX);
1178 NewLIR5(kX86Lea32RA, tmp_reg.GetReg(), tmp_reg.GetReg(),
1179 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value() );
1180 // RBX now holds the address of the first dst element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001181
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001182 // Check if the number of elements to be copied is odd or even. If odd
DaniilSokolov70c4f062014-06-24 17:34:00 -07001183 // then copy the first element (so that the remaining number of elements
1184 // is even).
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001185 LoadValueDirectFixed(rl_length, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001186 OpRegImm(kOpAnd, rs_rCX, 1);
1187 LIR* jmp_to_begin_loop = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1188 OpRegImm(kOpSub, rs_rDX, 1);
1189 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001190 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001191
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001192 // Since the remaining number of elements is even, we will copy by
DaniilSokolov70c4f062014-06-24 17:34:00 -07001193 // two elements at a time.
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001194 LIR* beginLoop = NewLIR0(kPseudoTargetLabel);
1195 LIR* jmp_to_ret = OpCmpImmBranch(kCondEq, rs_rDX, 0, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001196 OpRegImm(kOpSub, rs_rDX, 2);
1197 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001198 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001199 OpUnconditionalBranch(beginLoop);
1200 LIR *check_failed = NewLIR0(kPseudoTargetLabel);
1201 LIR* launchpad_branch = OpUnconditionalBranch(nullptr);
1202 LIR *return_point = NewLIR0(kPseudoTargetLabel);
1203 jmp_to_ret->target = return_point;
1204 jmp_to_begin_loop->target = beginLoop;
1205 src_dst_same->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001206 len_too_big->target = check_failed;
1207 src_null_branch->target = check_failed;
1208 if (srcPos_negative != nullptr)
1209 srcPos_negative ->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001210 if (src_bad_off != nullptr)
1211 src_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001212 if (src_bad_len != nullptr)
1213 src_bad_len->target = check_failed;
1214 dst_null_branch->target = check_failed;
1215 if (dstPos_negative != nullptr)
1216 dstPos_negative->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001217 if (dst_bad_off != nullptr)
1218 dst_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001219 if (dst_bad_len != nullptr)
1220 dst_bad_len->target = check_failed;
1221 AddIntrinsicSlowPath(info, launchpad_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001222 ClobberCallerSave(); // We must clobber everything because slow path will return here
DaniilSokolov70c4f062014-06-24 17:34:00 -07001223 return true;
1224}
1225
1226
Mark Mendell4028a6c2014-02-19 20:06:20 -08001227/*
1228 * Fast string.index_of(I) & (II). Inline check for simple case of char <= 0xffff,
1229 * otherwise bails to standard library code.
1230 */
1231bool X86Mir2Lir::GenInlinedIndexOf(CallInfo* info, bool zero_based) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001232 RegLocation rl_obj = info->args[0];
1233 RegLocation rl_char = info->args[1];
buzbeea44d4f52014-03-05 11:26:39 -08001234 RegLocation rl_start; // Note: only present in III flavor or IndexOf.
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001235 // RBX is promotable in 64-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001236 RegStorage rs_tmp = cu_->target64 ? rs_r11 : rs_rBX;
1237 int start_value = -1;
Mark Mendell4028a6c2014-02-19 20:06:20 -08001238
1239 uint32_t char_value =
1240 rl_char.is_const ? mir_graph_->ConstantValue(rl_char.orig_sreg) : 0;
1241
1242 if (char_value > 0xFFFF) {
1243 // We have to punt to the real String.indexOf.
1244 return false;
1245 }
1246
1247 // Okay, we are commited to inlining this.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001248 // EAX: 16 bit character being searched.
1249 // ECX: count: number of words to be searched.
1250 // EDI: String being searched.
1251 // EDX: temporary during execution.
1252 // EBX or R11: temporary during execution (depending on mode).
1253 // REP SCASW: search instruction.
1254
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001255 FlushAllRegs();
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001256
buzbeea0cd2d72014-06-01 09:33:49 -07001257 RegLocation rl_return = GetReturn(kCoreReg);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001258 RegLocation rl_dest = InlineTarget(info);
1259
1260 // Is the string non-NULL?
buzbee2700f7e2014-03-07 09:46:20 -08001261 LoadValueDirectFixed(rl_obj, rs_rDX);
1262 GenNullCheck(rs_rDX, info->opt_flags);
Vladimir Marko3bc86152014-03-13 14:11:28 +00001263 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've null checked.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001264
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001265 LIR *slowpath_branch = nullptr, *length_compare = nullptr;
1266
1267 // We need the value in EAX.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001268 if (rl_char.is_const) {
buzbee2700f7e2014-03-07 09:46:20 -08001269 LoadConstantNoClobber(rs_rAX, char_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001270 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001271 // Does the character fit in 16 bits? Compare it at runtime.
buzbee2700f7e2014-03-07 09:46:20 -08001272 LoadValueDirectFixed(rl_char, rs_rAX);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001273 slowpath_branch = OpCmpImmBranch(kCondGt, rs_rAX, 0xFFFF, nullptr);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001274 }
1275
1276 // From here down, we know that we are looking for a char that fits in 16 bits.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001277 // Location of reference to data array within the String object.
1278 int value_offset = mirror::String::ValueOffset().Int32Value();
1279 // Location of count within the String object.
1280 int count_offset = mirror::String::CountOffset().Int32Value();
1281 // Starting offset within data array.
1282 int offset_offset = mirror::String::OffsetOffset().Int32Value();
1283 // Start of char data with array_.
1284 int data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Int32Value();
Mark Mendell4028a6c2014-02-19 20:06:20 -08001285
Dave Allison69dfe512014-07-11 17:11:58 +00001286 // Compute the number of words to search in to rCX.
1287 Load32Disp(rs_rDX, count_offset, rs_rCX);
1288
Dave Allisondfd3b472014-07-16 16:04:32 -07001289 // Possible signal here due to null pointer dereference.
1290 // Note that the signal handler will expect the top word of
1291 // the stack to be the ArtMethod*. If the PUSH edi instruction
1292 // below is ahead of the load above then this will not be true
1293 // and the signal handler will not work.
1294 MarkPossibleNullPointerException(0);
Dave Allison69dfe512014-07-11 17:11:58 +00001295
Dave Allisondfd3b472014-07-16 16:04:32 -07001296 if (!cu_->target64) {
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001297 // EDI is promotable in 32-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001298 NewLIR1(kX86Push32R, rs_rDI.GetReg());
1299 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001300
Mark Mendell4028a6c2014-02-19 20:06:20 -08001301 if (zero_based) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001302 // Start index is not present.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001303 // We have to handle an empty string. Use special instruction JECXZ.
1304 length_compare = NewLIR0(kX86Jecxz8);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001305
1306 // Copy the number of words to search in a temporary register.
1307 // We will use the register at the end to calculate result.
1308 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001309 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001310 // Start index is present.
buzbeea44d4f52014-03-05 11:26:39 -08001311 rl_start = info->args[2];
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001312
Mark Mendell4028a6c2014-02-19 20:06:20 -08001313 // We have to offset by the start index.
1314 if (rl_start.is_const) {
1315 start_value = mir_graph_->ConstantValue(rl_start.orig_sreg);
1316 start_value = std::max(start_value, 0);
1317
1318 // Is the start > count?
buzbee2700f7e2014-03-07 09:46:20 -08001319 length_compare = OpCmpImmBranch(kCondLe, rs_rCX, start_value, nullptr);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001320 OpRegImm(kOpMov, rs_rDI, start_value);
1321
1322 // Copy the number of words to search in a temporary register.
1323 // We will use the register at the end to calculate result.
1324 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001325
1326 if (start_value != 0) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001327 // Decrease the number of words to search by the start index.
buzbee2700f7e2014-03-07 09:46:20 -08001328 OpRegImm(kOpSub, rs_rCX, start_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001329 }
1330 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001331 // Handle "start index < 0" case.
1332 if (!cu_->target64 && rl_start.location != kLocPhysReg) {
Alexei Zavjalova1758d82014-04-17 01:55:43 +07001333 // Load the start index from stack, remembering that we pushed EDI.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001334 int displacement = SRegOffset(rl_start.s_reg_low) + sizeof(uint32_t);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001335 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001336 Load32Disp(rs_rX86_SP_32, displacement, rs_rDI);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001337 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1338 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1339 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - 1;
1340 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001341 } else {
1342 LoadValueDirectFixed(rl_start, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001343 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001344 OpRegReg(kOpXor, rs_tmp, rs_tmp);
1345 OpRegReg(kOpCmp, rs_rDI, rs_tmp);
1346 OpCondRegReg(kOpCmov, kCondLt, rs_rDI, rs_tmp);
1347
1348 // The length of the string should be greater than the start index.
1349 length_compare = OpCmpBranch(kCondLe, rs_rCX, rs_rDI, nullptr);
1350
1351 // Copy the number of words to search in a temporary register.
1352 // We will use the register at the end to calculate result.
1353 OpRegReg(kOpMov, rs_tmp, rs_rCX);
1354
1355 // Decrease the number of words to search by the start index.
1356 OpRegReg(kOpSub, rs_rCX, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001357 }
1358 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001359
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001360 // Load the address of the string into EDI.
1361 // In case of start index we have to add the address to existing value in EDI.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001362 // The string starts at VALUE(String) + 2 * OFFSET(String) + DATA_OFFSET.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001363 if (zero_based || (!zero_based && rl_start.is_const && start_value == 0)) {
1364 Load32Disp(rs_rDX, offset_offset, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001365 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001366 OpRegMem(kOpAdd, rs_rDI, rs_rDX, offset_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001367 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001368 OpRegImm(kOpLsl, rs_rDI, 1);
1369 OpRegMem(kOpAdd, rs_rDI, rs_rDX, value_offset);
1370 OpRegImm(kOpAdd, rs_rDI, data_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001371
1372 // EDI now contains the start of the string to be searched.
1373 // We are all prepared to do the search for the character.
1374 NewLIR0(kX86RepneScasw);
1375
1376 // Did we find a match?
1377 LIR* failed_branch = OpCondBranch(kCondNe, nullptr);
1378
1379 // yes, we matched. Compute the index of the result.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001380 OpRegReg(kOpSub, rs_tmp, rs_rCX);
1381 NewLIR3(kX86Lea32RM, rl_return.reg.GetReg(), rs_tmp.GetReg(), -1);
1382
Mark Mendell4028a6c2014-02-19 20:06:20 -08001383 LIR *all_done = NewLIR1(kX86Jmp8, 0);
1384
1385 // Failed to match; return -1.
1386 LIR *not_found = NewLIR0(kPseudoTargetLabel);
1387 length_compare->target = not_found;
1388 failed_branch->target = not_found;
buzbee2700f7e2014-03-07 09:46:20 -08001389 LoadConstantNoClobber(rl_return.reg, -1);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001390
1391 // And join up at the end.
1392 all_done->target = NewLIR0(kPseudoTargetLabel);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001393
1394 if (!cu_->target64)
1395 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
Mark Mendell4028a6c2014-02-19 20:06:20 -08001396
1397 // Out of line code returns here.
Mingyao Yang3a74d152014-04-21 15:39:44 -07001398 if (slowpath_branch != nullptr) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001399 LIR *return_point = NewLIR0(kPseudoTargetLabel);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001400 AddIntrinsicSlowPath(info, slowpath_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001401 ClobberCallerSave(); // We must clobber everything because slow path will return here
Mark Mendell4028a6c2014-02-19 20:06:20 -08001402 }
1403
1404 StoreValue(rl_dest, rl_return);
1405 return true;
1406}
1407
Tong Shen35e1e6a2014-07-30 09:31:22 -07001408static bool ARTRegIDToDWARFRegID(bool is_x86_64, int art_reg_id, int* dwarf_reg_id) {
1409 if (is_x86_64) {
1410 switch (art_reg_id) {
Andreas Gampebda27222014-07-30 23:21:36 -07001411 case 3 : *dwarf_reg_id = 3; return true; // %rbx
Tong Shen35e1e6a2014-07-30 09:31:22 -07001412 // This is the only discrepancy between ART & DWARF register numbering.
Andreas Gampebda27222014-07-30 23:21:36 -07001413 case 5 : *dwarf_reg_id = 6; return true; // %rbp
1414 case 12: *dwarf_reg_id = 12; return true; // %r12
1415 case 13: *dwarf_reg_id = 13; return true; // %r13
1416 case 14: *dwarf_reg_id = 14; return true; // %r14
1417 case 15: *dwarf_reg_id = 15; return true; // %r15
1418 default: return false; // Should not get here
Tong Shen35e1e6a2014-07-30 09:31:22 -07001419 }
1420 } else {
1421 switch (art_reg_id) {
Andreas Gampebda27222014-07-30 23:21:36 -07001422 case 5: *dwarf_reg_id = 5; return true; // %ebp
1423 case 6: *dwarf_reg_id = 6; return true; // %esi
1424 case 7: *dwarf_reg_id = 7; return true; // %edi
1425 default: return false; // Should not get here
Tong Shen35e1e6a2014-07-30 09:31:22 -07001426 }
1427 }
1428}
1429
Tong Shen547cdfd2014-08-05 01:54:19 -07001430std::vector<uint8_t>* X86Mir2Lir::ReturnFrameDescriptionEntry() {
1431 std::vector<uint8_t>* cfi_info = new std::vector<uint8_t>;
Mark Mendellae9fd932014-02-10 16:14:35 -08001432
1433 // Generate the FDE for the method.
1434 DCHECK_NE(data_offset_, 0U);
1435
Yevgeny Roubane3ea8382014-08-08 16:29:38 +07001436 WriteFDEHeader(cfi_info, cu_->target64);
1437 WriteFDEAddressRange(cfi_info, data_offset_, cu_->target64);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001438
Mark Mendellae9fd932014-02-10 16:14:35 -08001439 // The instructions in the FDE.
1440 if (stack_decrement_ != nullptr) {
1441 // Advance LOC to just past the stack decrement.
1442 uint32_t pc = NEXT_LIR(stack_decrement_)->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001443 DW_CFA_advance_loc(cfi_info, pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001444
1445 // Now update the offset to the call frame: DW_CFA_def_cfa_offset frame_size.
Tong Shen547cdfd2014-08-05 01:54:19 -07001446 DW_CFA_def_cfa_offset(cfi_info, frame_size_);
Mark Mendellae9fd932014-02-10 16:14:35 -08001447
Tong Shen35e1e6a2014-07-30 09:31:22 -07001448 // Handle register spills
1449 const uint32_t kSpillInstLen = (cu_->target64) ? 5 : 4;
1450 const int kDataAlignmentFactor = (cu_->target64) ? -8 : -4;
1451 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
1452 int offset = -(GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
1453 for (int reg = 0; mask; mask >>= 1, reg++) {
1454 if (mask & 0x1) {
1455 pc += kSpillInstLen;
1456
1457 // Advance LOC to pass this instruction
Tong Shen547cdfd2014-08-05 01:54:19 -07001458 DW_CFA_advance_loc(cfi_info, kSpillInstLen);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001459
1460 int dwarf_reg_id;
1461 if (ARTRegIDToDWARFRegID(cu_->target64, reg, &dwarf_reg_id)) {
Tong Shen547cdfd2014-08-05 01:54:19 -07001462 // DW_CFA_offset_extended_sf reg offset
1463 DW_CFA_offset_extended_sf(cfi_info, dwarf_reg_id, offset / kDataAlignmentFactor);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001464 }
1465
1466 offset += GetInstructionSetPointerSize(cu_->instruction_set);
1467 }
1468 }
1469
Mark Mendellae9fd932014-02-10 16:14:35 -08001470 // We continue with that stack until the epilogue.
1471 if (stack_increment_ != nullptr) {
1472 uint32_t new_pc = NEXT_LIR(stack_increment_)->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001473 DW_CFA_advance_loc(cfi_info, new_pc - pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001474
1475 // We probably have code snippets after the epilogue, so save the
1476 // current state: DW_CFA_remember_state.
Tong Shen547cdfd2014-08-05 01:54:19 -07001477 DW_CFA_remember_state(cfi_info);
Mark Mendellae9fd932014-02-10 16:14:35 -08001478
Tong Shen35e1e6a2014-07-30 09:31:22 -07001479 // We have now popped the stack: DW_CFA_def_cfa_offset 4/8.
1480 // There is only the return PC on the stack now.
Tong Shen547cdfd2014-08-05 01:54:19 -07001481 DW_CFA_def_cfa_offset(cfi_info, GetInstructionSetPointerSize(cu_->instruction_set));
Mark Mendellae9fd932014-02-10 16:14:35 -08001482
1483 // Everything after that is the same as before the epilogue.
1484 // Stack bump was followed by RET instruction.
1485 LIR *post_ret_insn = NEXT_LIR(NEXT_LIR(stack_increment_));
1486 if (post_ret_insn != nullptr) {
1487 pc = new_pc;
1488 new_pc = post_ret_insn->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001489 DW_CFA_advance_loc(cfi_info, new_pc - pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001490 // Restore the state: DW_CFA_restore_state.
Tong Shen547cdfd2014-08-05 01:54:19 -07001491 DW_CFA_restore_state(cfi_info);
Mark Mendellae9fd932014-02-10 16:14:35 -08001492 }
1493 }
1494 }
1495
Tong Shen547cdfd2014-08-05 01:54:19 -07001496 PadCFI(cfi_info);
Yevgeny Roubane3ea8382014-08-08 16:29:38 +07001497 WriteCFILength(cfi_info, cu_->target64);
Mark Mendellae9fd932014-02-10 16:14:35 -08001498
Mark Mendellae9fd932014-02-10 16:14:35 -08001499 return cfi_info;
1500}
1501
Mark Mendelld65c51a2014-04-29 16:55:20 -04001502void X86Mir2Lir::GenMachineSpecificExtendedMethodMIR(BasicBlock* bb, MIR* mir) {
1503 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001504 case kMirOpReserveVectorRegisters:
1505 ReserveVectorRegisters(mir);
1506 break;
1507 case kMirOpReturnVectorRegisters:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001508 ReturnVectorRegisters(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001509 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001510 case kMirOpConstVector:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001511 GenConst128(mir);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001512 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001513 case kMirOpMoveVector:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001514 GenMoveVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001515 break;
1516 case kMirOpPackedMultiply:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001517 GenMultiplyVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001518 break;
1519 case kMirOpPackedAddition:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001520 GenAddVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001521 break;
1522 case kMirOpPackedSubtract:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001523 GenSubtractVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001524 break;
1525 case kMirOpPackedShiftLeft:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001526 GenShiftLeftVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001527 break;
1528 case kMirOpPackedSignedShiftRight:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001529 GenSignedShiftRightVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001530 break;
1531 case kMirOpPackedUnsignedShiftRight:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001532 GenUnsignedShiftRightVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001533 break;
1534 case kMirOpPackedAnd:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001535 GenAndVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001536 break;
1537 case kMirOpPackedOr:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001538 GenOrVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001539 break;
1540 case kMirOpPackedXor:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001541 GenXorVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001542 break;
1543 case kMirOpPackedAddReduce:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001544 GenAddReduceVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001545 break;
1546 case kMirOpPackedReduce:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001547 GenReduceVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001548 break;
1549 case kMirOpPackedSet:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001550 GenSetVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001551 break;
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07001552 case kMirOpMemBarrier:
1553 GenMemBarrier(static_cast<MemBarrierKind>(mir->dalvikInsn.vA));
1554 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001555 case kMirOpPackedArrayGet:
1556 GenPackedArrayGet(bb, mir);
1557 break;
1558 case kMirOpPackedArrayPut:
1559 GenPackedArrayPut(bb, mir);
1560 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001561 default:
1562 break;
1563 }
1564}
1565
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001566void X86Mir2Lir::ReserveVectorRegisters(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001567 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001568 RegStorage xp_reg = RegStorage::Solo128(i);
1569 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1570 Clobber(xp_reg);
1571
1572 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1573 info != nullptr;
1574 info = info->GetAliasChain()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001575 ArenaVector<RegisterInfo*>* regs =
1576 info->GetReg().IsSingle() ? &reg_pool_->sp_regs_ : &reg_pool_->dp_regs_;
1577 auto it = std::find(regs->begin(), regs->end(), info);
1578 DCHECK(it != regs->end());
1579 regs->erase(it);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001580 }
1581 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001582}
1583
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001584void X86Mir2Lir::ReturnVectorRegisters(MIR* mir) {
1585 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001586 RegStorage xp_reg = RegStorage::Solo128(i);
1587 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1588
1589 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1590 info != nullptr;
1591 info = info->GetAliasChain()) {
1592 if (info->GetReg().IsSingle()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001593 reg_pool_->sp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001594 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001595 reg_pool_->dp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001596 }
1597 }
1598 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001599}
1600
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001601void X86Mir2Lir::GenConst128(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001602 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001603 Clobber(rs_dest);
1604
Mark Mendelld65c51a2014-04-29 16:55:20 -04001605 uint32_t *args = mir->dalvikInsn.arg;
Mark Mendellfe945782014-05-22 09:52:36 -04001606 int reg = rs_dest.GetReg();
Mark Mendelld65c51a2014-04-29 16:55:20 -04001607 // Check for all 0 case.
1608 if (args[0] == 0 && args[1] == 0 && args[2] == 0 && args[3] == 0) {
1609 NewLIR2(kX86XorpsRR, reg, reg);
1610 return;
1611 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001612
1613 // Append the mov const vector to reg opcode.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001614 AppendOpcodeWithConst(kX86MovdqaRM, reg, mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001615}
1616
1617void X86Mir2Lir::AppendOpcodeWithConst(X86OpCode opcode, int reg, MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001618 // To deal with correct memory ordering, reverse order of constants.
1619 int32_t constants[4];
1620 constants[3] = mir->dalvikInsn.arg[0];
1621 constants[2] = mir->dalvikInsn.arg[1];
1622 constants[1] = mir->dalvikInsn.arg[2];
1623 constants[0] = mir->dalvikInsn.arg[3];
1624
1625 // Search if there is already a constant in pool with this value.
1626 LIR *data_target = ScanVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001627 if (data_target == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001628 data_target = AddVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001629 }
1630
Mark Mendelld65c51a2014-04-29 16:55:20 -04001631 // Load the proper value from the literal area.
1632 // We don't know the proper offset for the value, so pick one that will force
Mark Mendell27dee8b2014-12-01 19:06:12 -05001633 // 4 byte offset. We will fix this up in the assembler later to have the
1634 // right value.
1635 LIR* load;
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001636 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
Mark Mendell27dee8b2014-12-01 19:06:12 -05001637 if (cu_->target64) {
1638 load = NewLIR3(opcode, reg, kRIPReg, 256 /* bogus */);
1639 } else {
1640 // Address the start of the method.
1641 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
1642 if (rl_method.wide) {
1643 rl_method = LoadValueWide(rl_method, kCoreReg);
1644 } else {
1645 rl_method = LoadValue(rl_method, kCoreReg);
1646 }
1647
1648 load = NewLIR3(opcode, reg, rl_method.reg.GetReg(), 256 /* bogus */);
1649
1650 // The literal pool needs position independent logic.
1651 store_method_addr_used_ = true;
1652 }
Mark Mendelld65c51a2014-04-29 16:55:20 -04001653 load->flags.fixup = kFixupLoad;
1654 load->target = data_target;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001655}
1656
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001657void X86Mir2Lir::GenMoveVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001658 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001659 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1660 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001661 Clobber(rs_dest);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001662 RegStorage rs_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001663 NewLIR2(kX86MovdqaRR, rs_dest.GetReg(), rs_src.GetReg());
Mark Mendellfe945782014-05-22 09:52:36 -04001664}
1665
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001666void X86Mir2Lir::GenMultiplyVectorSignedByte(RegStorage rs_dest_src1, RegStorage rs_src2) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001667 /*
1668 * Emulate the behavior of a kSignedByte by separating out the 16 values in the two XMM
1669 * and multiplying 8 at a time before recombining back into one XMM register.
1670 *
1671 * let xmm1, xmm2 be real srcs (keep low bits of 16bit lanes)
1672 * xmm3 is tmp (operate on high bits of 16bit lanes)
1673 *
1674 * xmm3 = xmm1
1675 * xmm1 = xmm1 .* xmm2
1676 * xmm1 = xmm1 & 0x00ff00ff00ff00ff00ff00ff00ff00ff // xmm1 now has low bits
1677 * xmm3 = xmm3 .>> 8
1678 * xmm2 = xmm2 & 0xff00ff00ff00ff00ff00ff00ff00ff00
1679 * xmm2 = xmm2 .* xmm3 // xmm2 now has high bits
1680 * xmm1 = xmm1 | xmm2 // combine results
1681 */
1682
1683 // Copy xmm1.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001684 RegStorage rs_src1_high_tmp = Get128BitRegister(AllocTempDouble());
1685 RegStorage rs_dest_high_tmp = Get128BitRegister(AllocTempDouble());
1686 NewLIR2(kX86MovdqaRR, rs_src1_high_tmp.GetReg(), rs_src2.GetReg());
1687 NewLIR2(kX86MovdqaRR, rs_dest_high_tmp.GetReg(), rs_dest_src1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001688
1689 // Multiply low bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001690 // x7 *= x3
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001691 NewLIR2(kX86PmullwRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1692
1693 // xmm1 now has low bits.
1694 AndMaskVectorRegister(rs_dest_src1, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF);
1695
1696 // Prepare high bits for multiplication.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001697 NewLIR2(kX86PsrlwRI, rs_src1_high_tmp.GetReg(), 0x8);
1698 AndMaskVectorRegister(rs_dest_high_tmp, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001699
1700 // Multiply high bits and xmm2 now has high bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001701 NewLIR2(kX86PmullwRR, rs_src1_high_tmp.GetReg(), rs_dest_high_tmp.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001702
1703 // Combine back into dest XMM register.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001704 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src1_high_tmp.GetReg());
1705}
1706
1707void X86Mir2Lir::GenMultiplyVectorLong(RegStorage rs_dest_src1, RegStorage rs_src2) {
1708 /*
1709 * We need to emulate the packed long multiply.
1710 * For kMirOpPackedMultiply xmm1, xmm0:
1711 * - xmm1 is src/dest
1712 * - xmm0 is src
1713 * - Get xmm2 and xmm3 as temp
1714 * - Idea is to multiply the lower 32 of each operand with the higher 32 of the other.
1715 * - Then add the two results.
1716 * - Move it to the upper 32 of the destination
1717 * - Then multiply the lower 32-bits of the operands and add the result to the destination.
1718 *
1719 * (op dest src )
1720 * movdqa %xmm2, %xmm1
1721 * movdqa %xmm3, %xmm0
1722 * psrlq %xmm3, $0x20
1723 * pmuludq %xmm3, %xmm2
1724 * psrlq %xmm1, $0x20
1725 * pmuludq %xmm1, %xmm0
1726 * paddq %xmm1, %xmm3
1727 * psllq %xmm1, $0x20
1728 * pmuludq %xmm2, %xmm0
1729 * paddq %xmm1, %xmm2
1730 *
1731 * When both the operands are the same, then we need to calculate the lower-32 * higher-32
1732 * calculation only once. Thus we don't need the xmm3 temp above. That sequence becomes:
1733 *
1734 * (op dest src )
1735 * movdqa %xmm2, %xmm1
1736 * psrlq %xmm1, $0x20
1737 * pmuludq %xmm1, %xmm0
1738 * paddq %xmm1, %xmm1
1739 * psllq %xmm1, $0x20
1740 * pmuludq %xmm2, %xmm0
1741 * paddq %xmm1, %xmm2
1742 *
1743 */
1744
1745 bool both_operands_same = (rs_dest_src1.GetReg() == rs_src2.GetReg());
1746
1747 RegStorage rs_tmp_vector_1;
1748 RegStorage rs_tmp_vector_2;
1749 rs_tmp_vector_1 = Get128BitRegister(AllocTempDouble());
1750 NewLIR2(kX86MovdqaRR, rs_tmp_vector_1.GetReg(), rs_dest_src1.GetReg());
1751
1752 if (both_operands_same == false) {
1753 rs_tmp_vector_2 = Get128BitRegister(AllocTempDouble());
1754 NewLIR2(kX86MovdqaRR, rs_tmp_vector_2.GetReg(), rs_src2.GetReg());
1755 NewLIR2(kX86PsrlqRI, rs_tmp_vector_2.GetReg(), 0x20);
1756 NewLIR2(kX86PmuludqRR, rs_tmp_vector_2.GetReg(), rs_tmp_vector_1.GetReg());
1757 }
1758
1759 NewLIR2(kX86PsrlqRI, rs_dest_src1.GetReg(), 0x20);
1760 NewLIR2(kX86PmuludqRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1761
1762 if (both_operands_same == false) {
1763 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_2.GetReg());
1764 } else {
1765 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1766 }
1767
1768 NewLIR2(kX86PsllqRI, rs_dest_src1.GetReg(), 0x20);
1769 NewLIR2(kX86PmuludqRR, rs_tmp_vector_1.GetReg(), rs_src2.GetReg());
1770 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001771}
1772
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001773void X86Mir2Lir::GenMultiplyVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001774 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1775 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1776 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001777 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001778 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001779 int opcode = 0;
1780 switch (opsize) {
1781 case k32:
1782 opcode = kX86PmulldRR;
1783 break;
1784 case kSignedHalf:
1785 opcode = kX86PmullwRR;
1786 break;
1787 case kSingle:
1788 opcode = kX86MulpsRR;
1789 break;
1790 case kDouble:
1791 opcode = kX86MulpdRR;
1792 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001793 case kSignedByte:
1794 // HW doesn't support 16x16 byte multiplication so emulate it.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001795 GenMultiplyVectorSignedByte(rs_dest_src1, rs_src2);
1796 return;
1797 case k64:
1798 GenMultiplyVectorLong(rs_dest_src1, rs_src2);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001799 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001800 default:
1801 LOG(FATAL) << "Unsupported vector multiply " << opsize;
1802 break;
1803 }
1804 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1805}
1806
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001807void X86Mir2Lir::GenAddVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001808 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1809 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1810 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001811 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001812 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001813 int opcode = 0;
1814 switch (opsize) {
1815 case k32:
1816 opcode = kX86PadddRR;
1817 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001818 case k64:
1819 opcode = kX86PaddqRR;
1820 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001821 case kSignedHalf:
1822 case kUnsignedHalf:
1823 opcode = kX86PaddwRR;
1824 break;
1825 case kUnsignedByte:
1826 case kSignedByte:
1827 opcode = kX86PaddbRR;
1828 break;
1829 case kSingle:
1830 opcode = kX86AddpsRR;
1831 break;
1832 case kDouble:
1833 opcode = kX86AddpdRR;
1834 break;
1835 default:
1836 LOG(FATAL) << "Unsupported vector addition " << opsize;
1837 break;
1838 }
1839 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1840}
1841
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001842void X86Mir2Lir::GenSubtractVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001843 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1844 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1845 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001846 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001847 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001848 int opcode = 0;
1849 switch (opsize) {
1850 case k32:
1851 opcode = kX86PsubdRR;
1852 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001853 case k64:
1854 opcode = kX86PsubqRR;
1855 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001856 case kSignedHalf:
1857 case kUnsignedHalf:
1858 opcode = kX86PsubwRR;
1859 break;
1860 case kUnsignedByte:
1861 case kSignedByte:
1862 opcode = kX86PsubbRR;
1863 break;
1864 case kSingle:
1865 opcode = kX86SubpsRR;
1866 break;
1867 case kDouble:
1868 opcode = kX86SubpdRR;
1869 break;
1870 default:
1871 LOG(FATAL) << "Unsupported vector subtraction " << opsize;
1872 break;
1873 }
1874 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1875}
1876
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001877void X86Mir2Lir::GenShiftByteVector(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001878 // Destination does not need clobbered because it has already been as part
1879 // of the general packed shift handler (caller of this method).
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001880 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001881
1882 int opcode = 0;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001883 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
1884 case kMirOpPackedShiftLeft:
1885 opcode = kX86PsllwRI;
1886 break;
1887 case kMirOpPackedSignedShiftRight:
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001888 case kMirOpPackedUnsignedShiftRight:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001889 // TODO Add support for emulated byte shifts.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001890 default:
1891 LOG(FATAL) << "Unsupported shift operation on byte vector " << opcode;
1892 break;
1893 }
1894
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001895 // Clear xmm register and return if shift more than byte length.
1896 int imm = mir->dalvikInsn.vB;
1897 if (imm >= 8) {
1898 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1899 return;
1900 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001901
1902 // Shift lower values.
1903 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1904
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001905 /*
1906 * The above shift will shift the whole word, but that means
1907 * both the bytes will shift as well. To emulate a byte level
1908 * shift, we can just throw away the lower (8 - N) bits of the
1909 * upper byte, and we are done.
1910 */
1911 uint8_t byte_mask = 0xFF << imm;
1912 uint32_t int_mask = byte_mask;
1913 int_mask = int_mask << 8 | byte_mask;
1914 int_mask = int_mask << 8 | byte_mask;
1915 int_mask = int_mask << 8 | byte_mask;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001916
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001917 // And the destination with the mask
1918 AndMaskVectorRegister(rs_dest_src1, int_mask, int_mask, int_mask, int_mask);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001919}
1920
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001921void X86Mir2Lir::GenShiftLeftVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001922 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1923 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1924 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001925 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001926 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001927 int opcode = 0;
1928 switch (opsize) {
1929 case k32:
1930 opcode = kX86PslldRI;
1931 break;
1932 case k64:
1933 opcode = kX86PsllqRI;
1934 break;
1935 case kSignedHalf:
1936 case kUnsignedHalf:
1937 opcode = kX86PsllwRI;
1938 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001939 case kSignedByte:
1940 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001941 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001942 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001943 default:
1944 LOG(FATAL) << "Unsupported vector shift left " << opsize;
1945 break;
1946 }
1947 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1948}
1949
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001950void X86Mir2Lir::GenSignedShiftRightVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001951 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1952 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1953 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001954 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001955 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001956 int opcode = 0;
1957 switch (opsize) {
1958 case k32:
1959 opcode = kX86PsradRI;
1960 break;
1961 case kSignedHalf:
1962 case kUnsignedHalf:
1963 opcode = kX86PsrawRI;
1964 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001965 case kSignedByte:
1966 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001967 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001968 return;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001969 case k64:
1970 // TODO Implement emulated shift algorithm.
Mark Mendellfe945782014-05-22 09:52:36 -04001971 default:
1972 LOG(FATAL) << "Unsupported vector signed shift right " << opsize;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001973 UNREACHABLE();
Mark Mendellfe945782014-05-22 09:52:36 -04001974 }
1975 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1976}
1977
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001978void X86Mir2Lir::GenUnsignedShiftRightVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001979 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1980 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1981 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001982 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001983 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001984 int opcode = 0;
1985 switch (opsize) {
1986 case k32:
1987 opcode = kX86PsrldRI;
1988 break;
1989 case k64:
1990 opcode = kX86PsrlqRI;
1991 break;
1992 case kSignedHalf:
1993 case kUnsignedHalf:
1994 opcode = kX86PsrlwRI;
1995 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001996 case kSignedByte:
1997 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001998 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001999 return;
Mark Mendellfe945782014-05-22 09:52:36 -04002000 default:
2001 LOG(FATAL) << "Unsupported vector unsigned shift right " << opsize;
2002 break;
2003 }
2004 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
2005}
2006
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002007void X86Mir2Lir::GenAndVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04002008 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002009 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2010 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002011 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002012 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002013 NewLIR2(kX86PandRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2014}
2015
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002016void X86Mir2Lir::GenOrVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04002017 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002018 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2019 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002020 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002021 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002022 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2023}
2024
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002025void X86Mir2Lir::GenXorVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04002026 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002027 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2028 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002029 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002030 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002031 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2032}
2033
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002034void X86Mir2Lir::AndMaskVectorRegister(RegStorage rs_src1, uint32_t m1, uint32_t m2, uint32_t m3, uint32_t m4) {
2035 MaskVectorRegister(kX86PandRM, rs_src1, m1, m2, m3, m4);
2036}
2037
2038void X86Mir2Lir::MaskVectorRegister(X86OpCode opcode, RegStorage rs_src1, uint32_t m0, uint32_t m1, uint32_t m2, uint32_t m3) {
2039 // Create temporary MIR as container for 128-bit binary mask.
2040 MIR const_mir;
2041 MIR* const_mirp = &const_mir;
2042 const_mirp->dalvikInsn.opcode = static_cast<Instruction::Code>(kMirOpConstVector);
2043 const_mirp->dalvikInsn.arg[0] = m0;
2044 const_mirp->dalvikInsn.arg[1] = m1;
2045 const_mirp->dalvikInsn.arg[2] = m2;
2046 const_mirp->dalvikInsn.arg[3] = m3;
2047
2048 // Mask vector with const from literal pool.
2049 AppendOpcodeWithConst(opcode, rs_src1.GetReg(), const_mirp);
2050}
2051
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002052void X86Mir2Lir::GenAddReduceVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002053 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002054 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
2055 bool is_wide = opsize == k64 || opsize == kDouble;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002056
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002057 // Get the location of the virtual register. Since this bytecode is overloaded
2058 // for different types (and sizes), we need different logic for each path.
2059 // The design of bytecode uses same VR for source and destination.
2060 RegLocation rl_src, rl_dest, rl_result;
2061 if (is_wide) {
2062 rl_src = mir_graph_->GetSrcWide(mir, 0);
2063 rl_dest = mir_graph_->GetDestWide(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002064 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002065 rl_src = mir_graph_->GetSrc(mir, 0);
2066 rl_dest = mir_graph_->GetDest(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002067 }
2068
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002069 // We need a temp for byte and short values
2070 RegStorage temp;
2071
2072 // There is a different path depending on type and size.
2073 if (opsize == kSingle) {
2074 // Handle float case.
2075 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
2076
2077 rl_src = LoadValue(rl_src, kFPReg);
2078 rl_result = EvalLoc(rl_dest, kFPReg, true);
2079
2080 // Since we are doing an add-reduce, we move the reg holding the VR
2081 // into the result so we include it in result.
2082 OpRegCopy(rl_result.reg, rl_src.reg);
2083 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2084
2085 // Since FP must keep order of operation for value safety, we shift to low
2086 // 32-bits and add to result.
2087 for (int i = 0; i < 3; i++) {
2088 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), 0x39);
2089 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2090 }
2091
2092 StoreValue(rl_dest, rl_result);
2093 } else if (opsize == kDouble) {
2094 // Handle double case.
2095 rl_src = LoadValueWide(rl_src, kFPReg);
2096 rl_result = EvalLocWide(rl_dest, kFPReg, true);
2097 LOG(FATAL) << "Unsupported vector add reduce for double.";
2098 } else if (opsize == k64) {
2099 /*
2100 * Handle long case:
2101 * 1) Reduce the vector register to lower half (with addition).
2102 * 1-1) Get an xmm temp and fill it with vector register.
2103 * 1-2) Shift the xmm temp by 8-bytes.
2104 * 1-3) Add the xmm temp to vector register that is being reduced.
2105 * 2) Allocate temp GP / GP pair.
2106 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2107 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2108 * 3) Finish the add reduction by doing what add-long/2addr does,
2109 * but instead of having a VR as one of the sources, we have our temp GP.
2110 */
2111 RegStorage rs_tmp_vector = Get128BitRegister(AllocTempDouble());
2112 NewLIR2(kX86MovdqaRR, rs_tmp_vector.GetReg(), vector_src.GetReg());
2113 NewLIR2(kX86PsrldqRI, rs_tmp_vector.GetReg(), 8);
2114 NewLIR2(kX86PaddqRR, vector_src.GetReg(), rs_tmp_vector.GetReg());
2115 FreeTemp(rs_tmp_vector);
2116
2117 // We would like to be able to reuse the add-long implementation, so set up a fake
2118 // register location to pass it.
2119 RegLocation temp_loc = mir_graph_->GetBadLoc();
2120 temp_loc.core = 1;
2121 temp_loc.wide = 1;
2122 temp_loc.location = kLocPhysReg;
2123 temp_loc.reg = AllocTempWide();
2124
2125 if (cu_->target64) {
2126 DCHECK(!temp_loc.reg.IsPair());
2127 NewLIR2(kX86MovqrxRR, temp_loc.reg.GetReg(), vector_src.GetReg());
2128 } else {
2129 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetLowReg(), vector_src.GetReg());
2130 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2131 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetHighReg(), vector_src.GetReg());
2132 }
2133
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002134 GenArithOpLong(Instruction::ADD_LONG_2ADDR, rl_dest, temp_loc, temp_loc, mir->optimization_flags);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002135 } else if (opsize == kSignedByte || opsize == kUnsignedByte) {
2136 RegStorage rs_tmp = Get128BitRegister(AllocTempDouble());
2137 NewLIR2(kX86PxorRR, rs_tmp.GetReg(), rs_tmp.GetReg());
2138 NewLIR2(kX86PsadbwRR, vector_src.GetReg(), rs_tmp.GetReg());
2139 NewLIR3(kX86PshufdRRI, rs_tmp.GetReg(), vector_src.GetReg(), 0x4e);
2140 NewLIR2(kX86PaddbRR, vector_src.GetReg(), rs_tmp.GetReg());
2141 // Move to a GPR
2142 temp = AllocTemp();
2143 NewLIR2(kX86MovdrxRR, temp.GetReg(), vector_src.GetReg());
2144 } else {
2145 // Handle and the int and short cases together
2146
2147 // Initialize as if we were handling int case. Below we update
2148 // the opcode if handling byte or short.
2149 int vec_bytes = (mir->dalvikInsn.vC & 0xFFFF) / 8;
2150 int vec_unit_size;
2151 int horizontal_add_opcode;
2152 int extract_opcode;
2153
2154 if (opsize == kSignedHalf || opsize == kUnsignedHalf) {
2155 extract_opcode = kX86PextrwRRI;
2156 horizontal_add_opcode = kX86PhaddwRR;
2157 vec_unit_size = 2;
2158 } else if (opsize == k32) {
2159 vec_unit_size = 4;
2160 horizontal_add_opcode = kX86PhadddRR;
2161 extract_opcode = kX86PextrdRRI;
2162 } else {
2163 LOG(FATAL) << "Unsupported vector add reduce " << opsize;
2164 return;
2165 }
2166
2167 int elems = vec_bytes / vec_unit_size;
2168
2169 while (elems > 1) {
2170 NewLIR2(horizontal_add_opcode, vector_src.GetReg(), vector_src.GetReg());
2171 elems >>= 1;
2172 }
2173
2174 // Handle this as arithmetic unary case.
2175 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2176
2177 // Extract to a GP register because this is integral typed.
2178 temp = AllocTemp();
2179 NewLIR3(extract_opcode, temp.GetReg(), vector_src.GetReg(), 0);
2180 }
2181
2182 if (opsize != k64 && opsize != kSingle && opsize != kDouble) {
2183 // The logic below looks very similar to the handling of ADD_INT_2ADDR
2184 // except the rhs is not a VR but a physical register allocated above.
2185 // No load of source VR is done because it assumes that rl_result will
2186 // share physical register / memory location.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002187 rl_result = UpdateLocTyped(rl_dest);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002188 if (rl_result.location == kLocPhysReg) {
2189 // Ensure res is in a core reg.
2190 rl_result = EvalLoc(rl_dest, kCoreReg, true);
2191 OpRegReg(kOpAdd, rl_result.reg, temp);
2192 StoreFinalValue(rl_dest, rl_result);
2193 } else {
2194 // Do the addition directly to memory.
2195 OpMemReg(kOpAdd, rl_result, temp.GetReg());
2196 }
2197 }
Mark Mendellfe945782014-05-22 09:52:36 -04002198}
2199
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002200void X86Mir2Lir::GenReduceVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002201 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2202 RegLocation rl_dest = mir_graph_->GetDest(mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002203 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002204 RegLocation rl_result;
2205 bool is_wide = false;
2206
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002207 // There is a different path depending on type and size.
2208 if (opsize == kSingle) {
2209 // Handle float case.
2210 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
Mark Mendellfe945782014-05-22 09:52:36 -04002211
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002212 int extract_index = mir->dalvikInsn.arg[0];
2213
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002214 rl_result = EvalLoc(rl_dest, kFPReg, true);
2215 NewLIR2(kX86PxorRR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002216
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002217 if (LIKELY(extract_index != 0)) {
2218 // We know the index of element which we want to extract. We want to extract it and
2219 // keep values in vector register correct for future use. So the way we act is:
2220 // 1. Generate shuffle mask that allows to swap zeroth and required elements;
2221 // 2. Shuffle vector register with this mask;
2222 // 3. Extract zeroth element where required value lies;
2223 // 4. Shuffle with same mask again to restore original values in vector register.
2224 // The mask is generated from equivalence mask 0b11100100 swapping 0th and extracted
2225 // element indices.
2226 int shuffle[4] = {0b00, 0b01, 0b10, 0b11};
2227 shuffle[0] = extract_index;
2228 shuffle[extract_index] = 0;
2229 int mask = 0;
2230 for (int i = 0; i < 4; i++) {
2231 mask |= (shuffle[i] << (2 * i));
2232 }
2233 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), mask);
2234 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2235 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), mask);
2236 } else {
2237 // We need to extract zeroth element and don't need any complex stuff to do it.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002238 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002239 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002240
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002241 StoreFinalValue(rl_dest, rl_result);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002242 } else if (opsize == kDouble) {
2243 // TODO Handle double case.
2244 LOG(FATAL) << "Unsupported add reduce for double.";
2245 } else if (opsize == k64) {
2246 /*
2247 * Handle long case:
2248 * 1) Reduce the vector register to lower half (with addition).
2249 * 1-1) Get an xmm temp and fill it with vector register.
2250 * 1-2) Shift the xmm temp by 8-bytes.
2251 * 1-3) Add the xmm temp to vector register that is being reduced.
2252 * 2) Evaluate destination to a GP / GP pair.
2253 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2254 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2255 * 3) Store the result to the final destination.
2256 */
Udayan Banerji53cec002014-09-26 10:41:47 -07002257 NewLIR2(kX86PsrldqRI, vector_src.GetReg(), 8);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002258 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2259 if (cu_->target64) {
2260 DCHECK(!rl_result.reg.IsPair());
2261 NewLIR2(kX86MovqrxRR, rl_result.reg.GetReg(), vector_src.GetReg());
2262 } else {
2263 NewLIR2(kX86MovdrxRR, rl_result.reg.GetLowReg(), vector_src.GetReg());
2264 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2265 NewLIR2(kX86MovdrxRR, rl_result.reg.GetHighReg(), vector_src.GetReg());
2266 }
2267
2268 StoreValueWide(rl_dest, rl_result);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002269 } else {
Udayan Banerji53cec002014-09-26 10:41:47 -07002270 int extract_index = mir->dalvikInsn.arg[0];
2271 int extr_opcode = 0;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002272 rl_result = UpdateLocTyped(rl_dest);
Udayan Banerji53cec002014-09-26 10:41:47 -07002273
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002274 // Handle the rest of integral types now.
2275 switch (opsize) {
2276 case k32:
Udayan Banerji53cec002014-09-26 10:41:47 -07002277 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrdRRI : kX86PextrdMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002278 break;
2279 case kSignedHalf:
2280 case kUnsignedHalf:
Udayan Banerji53cec002014-09-26 10:41:47 -07002281 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrwRRI : kX86PextrwMRI;
2282 break;
2283 case kSignedByte:
2284 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrbRRI : kX86PextrbMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002285 break;
2286 default:
2287 LOG(FATAL) << "Unsupported vector reduce " << opsize;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002288 UNREACHABLE();
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002289 }
2290
2291 if (rl_result.location == kLocPhysReg) {
2292 NewLIR3(extr_opcode, rl_result.reg.GetReg(), vector_src.GetReg(), extract_index);
Udayan Banerji53cec002014-09-26 10:41:47 -07002293 StoreFinalValue(rl_dest, rl_result);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002294 } else {
2295 int displacement = SRegOffset(rl_result.s_reg_low);
Razvan A Lupusorub72c7232014-10-28 19:29:52 -07002296 LIR *l = NewLIR4(extr_opcode, rs_rX86_SP_32.GetReg(), displacement, vector_src.GetReg(),
2297 extract_index);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002298 AnnotateDalvikRegAccess(l, displacement >> 2, true /* is_load */, is_wide /* is_64bit */);
2299 AnnotateDalvikRegAccess(l, displacement >> 2, false /* is_load */, is_wide /* is_64bit */);
2300 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002301 }
Mark Mendellfe945782014-05-22 09:52:36 -04002302}
2303
Mark Mendell0a1174e2014-09-11 14:51:02 -04002304void X86Mir2Lir::LoadVectorRegister(RegStorage rs_dest, RegStorage rs_src,
2305 OpSize opsize, int op_mov) {
2306 if (!cu_->target64 && opsize == k64) {
2307 // Logic assumes that longs are loaded in GP register pairs.
2308 NewLIR2(kX86MovdxrRR, rs_dest.GetReg(), rs_src.GetLowReg());
2309 RegStorage r_tmp = AllocTempDouble();
2310 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), rs_src.GetHighReg());
2311 NewLIR2(kX86PunpckldqRR, rs_dest.GetReg(), r_tmp.GetReg());
2312 FreeTemp(r_tmp);
2313 } else {
2314 NewLIR2(op_mov, rs_dest.GetReg(), rs_src.GetReg());
2315 }
2316}
2317
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002318void X86Mir2Lir::GenSetVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002319 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2320 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2321 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002322 Clobber(rs_dest);
2323 int op_shuffle = 0, op_shuffle_high = 0, op_mov = kX86MovdxrRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002324 RegisterClass reg_type = kCoreReg;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002325 bool is_wide = false;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002326
Mark Mendellfe945782014-05-22 09:52:36 -04002327 switch (opsize) {
2328 case k32:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002329 op_shuffle = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002330 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002331 case kSingle:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002332 op_shuffle = kX86PshufdRRI;
2333 op_mov = kX86MovdqaRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002334 reg_type = kFPReg;
2335 break;
2336 case k64:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002337 op_shuffle = kX86PunpcklqdqRR;
Udayan Banerji53cec002014-09-26 10:41:47 -07002338 op_mov = kX86MovqxrRR;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002339 is_wide = true;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002340 break;
2341 case kSignedByte:
2342 case kUnsignedByte:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002343 // We will have the source loaded up in a
2344 // double-word before we use this shuffle
2345 op_shuffle = kX86PshufdRRI;
2346 break;
Mark Mendellfe945782014-05-22 09:52:36 -04002347 case kSignedHalf:
2348 case kUnsignedHalf:
2349 // Handles low quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002350 op_shuffle = kX86PshuflwRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002351 // Handles upper quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002352 op_shuffle_high = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002353 break;
2354 default:
2355 LOG(FATAL) << "Unsupported vector set " << opsize;
2356 break;
2357 }
2358
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002359 // Load the value from the VR into a physical register.
2360 RegLocation rl_src;
2361 if (!is_wide) {
2362 rl_src = mir_graph_->GetSrc(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002363 rl_src = LoadValue(rl_src, reg_type);
2364 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002365 rl_src = mir_graph_->GetSrcWide(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002366 rl_src = LoadValueWide(rl_src, reg_type);
2367 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002368 RegStorage reg_to_shuffle = rl_src.reg;
Mark Mendellfe945782014-05-22 09:52:36 -04002369
2370 // Load the value into the XMM register.
Mark Mendell0a1174e2014-09-11 14:51:02 -04002371 LoadVectorRegister(rs_dest, reg_to_shuffle, opsize, op_mov);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002372
2373 if (opsize == kSignedByte || opsize == kUnsignedByte) {
2374 // In the byte case, first duplicate it to be a word
2375 // Then duplicate it to be a double-word
2376 NewLIR2(kX86PunpcklbwRR, rs_dest.GetReg(), rs_dest.GetReg());
2377 NewLIR2(kX86PunpcklwdRR, rs_dest.GetReg(), rs_dest.GetReg());
2378 }
Mark Mendellfe945782014-05-22 09:52:36 -04002379
2380 // Now shuffle the value across the destination.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002381 if (op_shuffle == kX86PunpcklqdqRR) {
2382 NewLIR2(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg());
2383 } else {
2384 NewLIR3(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg(), 0);
2385 }
Mark Mendellfe945782014-05-22 09:52:36 -04002386
2387 // And then repeat as needed.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002388 if (op_shuffle_high != 0) {
2389 NewLIR3(op_shuffle_high, rs_dest.GetReg(), rs_dest.GetReg(), 0);
Mark Mendellfe945782014-05-22 09:52:36 -04002390 }
2391}
2392
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002393void X86Mir2Lir::GenPackedArrayGet(BasicBlock* bb, MIR* mir) {
2394 UNUSED(bb, mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002395 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayGet not supported.";
2396}
2397
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002398void X86Mir2Lir::GenPackedArrayPut(BasicBlock* bb, MIR* mir) {
2399 UNUSED(bb, mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002400 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayPut not supported.";
2401}
2402
2403LIR* X86Mir2Lir::ScanVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002404 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002405 if (constants[0] == p->operands[0] && constants[1] == p->operands[1] &&
2406 constants[2] == p->operands[2] && constants[3] == p->operands[3]) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002407 return p;
2408 }
2409 }
2410 return nullptr;
2411}
2412
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002413LIR* X86Mir2Lir::AddVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002414 LIR* new_value = static_cast<LIR*>(arena_->Alloc(sizeof(LIR), kArenaAllocData));
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002415 new_value->operands[0] = constants[0];
2416 new_value->operands[1] = constants[1];
2417 new_value->operands[2] = constants[2];
2418 new_value->operands[3] = constants[3];
Mark Mendelld65c51a2014-04-29 16:55:20 -04002419 new_value->next = const_vectors_;
2420 if (const_vectors_ == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002421 estimated_native_code_size_ += 12; // Maximum needed to align to 16 byte boundary.
Mark Mendelld65c51a2014-04-29 16:55:20 -04002422 }
2423 estimated_native_code_size_ += 16; // Space for one vector.
2424 const_vectors_ = new_value;
2425 return new_value;
2426}
2427
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002428// ------------ ABI support: mapping of args to physical registers -------------
Serguei Katkov717a3e42014-11-13 17:19:42 +06002429RegStorage X86Mir2Lir::InToRegStorageX86_64Mapper::GetNextReg(ShortyArg arg) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002430 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3, kArg4, kArg5};
Serguei Katkov717a3e42014-11-13 17:19:42 +06002431 const size_t coreArgMappingToPhysicalRegSize = arraysize(coreArgMappingToPhysicalReg);
Chao-ying Fua77ee512014-07-01 17:43:41 -07002432 const SpecialTargetRegister fpArgMappingToPhysicalReg[] = {kFArg0, kFArg1, kFArg2, kFArg3,
Andreas Gampeccc60262014-07-04 18:02:38 -07002433 kFArg4, kFArg5, kFArg6, kFArg7};
Serguei Katkov717a3e42014-11-13 17:19:42 +06002434 const size_t fpArgMappingToPhysicalRegSize = arraysize(fpArgMappingToPhysicalReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002435
Serguei Katkov717a3e42014-11-13 17:19:42 +06002436 if (arg.IsFP()) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002437 if (cur_fp_reg_ < fpArgMappingToPhysicalRegSize) {
Serguei Katkov717a3e42014-11-13 17:19:42 +06002438 return m2l_->TargetReg(fpArgMappingToPhysicalReg[cur_fp_reg_++],
2439 arg.IsWide() ? kWide : kNotWide);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002440 }
2441 } else {
2442 if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
Serguei Katkov717a3e42014-11-13 17:19:42 +06002443 return m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2444 arg.IsRef() ? kRef : (arg.IsWide() ? kWide : kNotWide));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002445 }
2446 }
Chao-ying Fua77ee512014-07-01 17:43:41 -07002447 return RegStorage::InvalidReg();
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002448}
2449
Serguei Katkov717a3e42014-11-13 17:19:42 +06002450RegStorage X86Mir2Lir::InToRegStorageX86Mapper::GetNextReg(ShortyArg arg) {
2451 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3};
2452 const size_t coreArgMappingToPhysicalRegSize = arraysize(coreArgMappingToPhysicalReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002453
Serguei Katkov717a3e42014-11-13 17:19:42 +06002454 RegStorage result = RegStorage::InvalidReg();
2455 if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
2456 result = m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2457 arg.IsRef() ? kRef : kNotWide);
2458 if (arg.IsWide() && cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
2459 result = RegStorage::MakeRegPair(
2460 result, m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++], kNotWide));
2461 }
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002462 }
Serguei Katkov717a3e42014-11-13 17:19:42 +06002463 return result;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002464}
2465
2466// ---------End of ABI support: mapping of args to physical registers -------------
2467
Andreas Gampe98430592014-07-27 19:44:50 -07002468bool X86Mir2Lir::GenInlinedCharAt(CallInfo* info) {
2469 // Location of reference to data array
2470 int value_offset = mirror::String::ValueOffset().Int32Value();
2471 // Location of count
2472 int count_offset = mirror::String::CountOffset().Int32Value();
2473 // Starting offset within data array
2474 int offset_offset = mirror::String::OffsetOffset().Int32Value();
2475 // Start of char data with array_
2476 int data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Int32Value();
2477
2478 RegLocation rl_obj = info->args[0];
2479 RegLocation rl_idx = info->args[1];
2480 rl_obj = LoadValue(rl_obj, kRefReg);
2481 // X86 wants to avoid putting a constant index into a register.
2482 if (!rl_idx.is_const) {
2483 rl_idx = LoadValue(rl_idx, kCoreReg);
2484 }
2485 RegStorage reg_max;
2486 GenNullCheck(rl_obj.reg, info->opt_flags);
2487 bool range_check = (!(info->opt_flags & MIR_IGNORE_RANGE_CHECK));
2488 LIR* range_check_branch = nullptr;
2489 RegStorage reg_off;
2490 RegStorage reg_ptr;
2491 if (range_check) {
2492 // On x86, we can compare to memory directly
2493 // Set up a launch pad to allow retry in case of bounds violation */
2494 if (rl_idx.is_const) {
2495 LIR* comparison;
2496 range_check_branch = OpCmpMemImmBranch(
2497 kCondUlt, RegStorage::InvalidReg(), rl_obj.reg, count_offset,
2498 mir_graph_->ConstantValue(rl_idx.orig_sreg), nullptr, &comparison);
2499 MarkPossibleNullPointerExceptionAfter(0, comparison);
2500 } else {
2501 OpRegMem(kOpCmp, rl_idx.reg, rl_obj.reg, count_offset);
2502 MarkPossibleNullPointerException(0);
2503 range_check_branch = OpCondBranch(kCondUge, nullptr);
2504 }
2505 }
2506 reg_off = AllocTemp();
2507 reg_ptr = AllocTempRef();
2508 Load32Disp(rl_obj.reg, offset_offset, reg_off);
2509 LoadRefDisp(rl_obj.reg, value_offset, reg_ptr, kNotVolatile);
2510 if (rl_idx.is_const) {
2511 OpRegImm(kOpAdd, reg_off, mir_graph_->ConstantValue(rl_idx.orig_sreg));
2512 } else {
2513 OpRegReg(kOpAdd, reg_off, rl_idx.reg);
2514 }
2515 FreeTemp(rl_obj.reg);
2516 if (rl_idx.location == kLocPhysReg) {
2517 FreeTemp(rl_idx.reg);
2518 }
2519 RegLocation rl_dest = InlineTarget(info);
2520 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
2521 LoadBaseIndexedDisp(reg_ptr, reg_off, 1, data_offset, rl_result.reg, kUnsignedHalf);
2522 FreeTemp(reg_off);
2523 FreeTemp(reg_ptr);
2524 StoreValue(rl_dest, rl_result);
2525 if (range_check) {
2526 DCHECK(range_check_branch != nullptr);
2527 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've already null checked.
2528 AddIntrinsicSlowPath(info, range_check_branch);
2529 }
2530 return true;
2531}
2532
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002533bool X86Mir2Lir::GenInlinedCurrentThread(CallInfo* info) {
2534 RegLocation rl_dest = InlineTarget(info);
2535
2536 // Early exit if the result is unused.
2537 if (rl_dest.orig_sreg < 0) {
2538 return true;
2539 }
2540
2541 RegLocation rl_result = EvalLoc(rl_dest, kRefReg, true);
2542
2543 if (cu_->target64) {
2544 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<8>());
2545 } else {
2546 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<4>());
2547 }
2548
2549 StoreValue(rl_dest, rl_result);
2550 return true;
2551}
2552
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002553/**
2554 * Lock temp registers for explicit usage. Registers will be freed in destructor.
2555 */
2556X86Mir2Lir::ExplicitTempRegisterLock::ExplicitTempRegisterLock(X86Mir2Lir* mir_to_lir,
2557 int n_regs, ...) :
2558 temp_regs_(n_regs),
2559 mir_to_lir_(mir_to_lir) {
2560 va_list regs;
2561 va_start(regs, n_regs);
2562 for (int i = 0; i < n_regs; i++) {
2563 RegStorage reg = *(va_arg(regs, RegStorage*));
2564 RegisterInfo* info = mir_to_lir_->GetRegInfo(reg);
2565
2566 // Make sure we don't have promoted register here.
2567 DCHECK(info->IsTemp());
2568
2569 temp_regs_.push_back(reg);
2570 mir_to_lir_->FlushReg(reg);
2571
2572 if (reg.IsPair()) {
2573 RegStorage partner = info->Partner();
2574 temp_regs_.push_back(partner);
2575 mir_to_lir_->FlushReg(partner);
2576 }
2577
2578 mir_to_lir_->Clobber(reg);
2579 mir_to_lir_->LockTemp(reg);
2580 }
2581
2582 va_end(regs);
2583}
2584
2585/*
2586 * Free all locked registers.
2587 */
2588X86Mir2Lir::ExplicitTempRegisterLock::~ExplicitTempRegisterLock() {
2589 // Free all locked temps.
2590 for (auto it : temp_regs_) {
2591 mir_to_lir_->FreeTemp(it);
2592 }
2593}
2594
Serguei Katkov717a3e42014-11-13 17:19:42 +06002595int X86Mir2Lir::GenDalvikArgsBulkCopy(CallInfo* info, int first, int count) {
2596 if (count < 4) {
2597 // It does not make sense to use this utility if we have no chance to use
2598 // 128-bit move.
2599 return count;
2600 }
2601 GenDalvikArgsFlushPromoted(info, first);
2602
2603 // The rest can be copied together
2604 int current_src_offset = SRegOffset(info->args[first].s_reg_low);
2605 int current_dest_offset = StackVisitor::GetOutVROffset(first, cu_->instruction_set);
2606
2607 // Only davik regs are accessed in this loop; no next_call_insn() calls.
2608 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2609 while (count > 0) {
2610 // This is based on the knowledge that the stack itself is 16-byte aligned.
2611 bool src_is_16b_aligned = (current_src_offset & 0xF) == 0;
2612 bool dest_is_16b_aligned = (current_dest_offset & 0xF) == 0;
2613 size_t bytes_to_move;
2614
2615 /*
2616 * The amount to move defaults to 32-bit. If there are 4 registers left to move, then do a
2617 * a 128-bit move because we won't get the chance to try to aligned. If there are more than
2618 * 4 registers left to move, consider doing a 128-bit only if either src or dest are aligned.
2619 * We do this because we could potentially do a smaller move to align.
2620 */
2621 if (count == 4 || (count > 4 && (src_is_16b_aligned || dest_is_16b_aligned))) {
2622 // Moving 128-bits via xmm register.
2623 bytes_to_move = sizeof(uint32_t) * 4;
2624
2625 // Allocate a free xmm temp. Since we are working through the calling sequence,
2626 // we expect to have an xmm temporary available. AllocTempDouble will abort if
2627 // there are no free registers.
2628 RegStorage temp = AllocTempDouble();
2629
2630 LIR* ld1 = nullptr;
2631 LIR* ld2 = nullptr;
2632 LIR* st1 = nullptr;
2633 LIR* st2 = nullptr;
2634
2635 /*
2636 * The logic is similar for both loads and stores. If we have 16-byte alignment,
2637 * do an aligned move. If we have 8-byte alignment, then do the move in two
2638 * parts. This approach prevents possible cache line splits. Finally, fall back
2639 * to doing an unaligned move. In most cases we likely won't split the cache
2640 * line but we cannot prove it and thus take a conservative approach.
2641 */
2642 bool src_is_8b_aligned = (current_src_offset & 0x7) == 0;
2643 bool dest_is_8b_aligned = (current_dest_offset & 0x7) == 0;
2644
2645 if (src_is_16b_aligned) {
2646 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovA128FP);
2647 } else if (src_is_8b_aligned) {
2648 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovLo128FP);
2649 ld2 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset + (bytes_to_move >> 1),
2650 kMovHi128FP);
2651 } else {
2652 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovU128FP);
2653 }
2654
2655 if (dest_is_16b_aligned) {
2656 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovA128FP);
2657 } else if (dest_is_8b_aligned) {
2658 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovLo128FP);
2659 st2 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset + (bytes_to_move >> 1),
2660 temp, kMovHi128FP);
2661 } else {
2662 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovU128FP);
2663 }
2664
2665 // TODO If we could keep track of aliasing information for memory accesses that are wider
2666 // than 64-bit, we wouldn't need to set up a barrier.
2667 if (ld1 != nullptr) {
2668 if (ld2 != nullptr) {
2669 // For 64-bit load we can actually set up the aliasing information.
2670 AnnotateDalvikRegAccess(ld1, current_src_offset >> 2, true, true);
2671 AnnotateDalvikRegAccess(ld2, (current_src_offset + (bytes_to_move >> 1)) >> 2, true,
2672 true);
2673 } else {
2674 // Set barrier for 128-bit load.
2675 ld1->u.m.def_mask = &kEncodeAll;
2676 }
2677 }
2678 if (st1 != nullptr) {
2679 if (st2 != nullptr) {
2680 // For 64-bit store we can actually set up the aliasing information.
2681 AnnotateDalvikRegAccess(st1, current_dest_offset >> 2, false, true);
2682 AnnotateDalvikRegAccess(st2, (current_dest_offset + (bytes_to_move >> 1)) >> 2, false,
2683 true);
2684 } else {
2685 // Set barrier for 128-bit store.
2686 st1->u.m.def_mask = &kEncodeAll;
2687 }
2688 }
2689
2690 // Free the temporary used for the data movement.
2691 FreeTemp(temp);
2692 } else {
2693 // Moving 32-bits via general purpose register.
2694 bytes_to_move = sizeof(uint32_t);
2695
2696 // Instead of allocating a new temp, simply reuse one of the registers being used
2697 // for argument passing.
2698 RegStorage temp = TargetReg(kArg3, kNotWide);
2699
2700 // Now load the argument VR and store to the outs.
2701 Load32Disp(TargetPtrReg(kSp), current_src_offset, temp);
2702 Store32Disp(TargetPtrReg(kSp), current_dest_offset, temp);
2703 }
2704
2705 current_src_offset += bytes_to_move;
2706 current_dest_offset += bytes_to_move;
2707 count -= (bytes_to_move >> 2);
2708 }
2709 DCHECK_EQ(count, 0);
2710 return count;
2711}
2712
Brian Carlstrom7934ac22013-07-26 10:54:15 -07002713} // namespace art