blob: 142acbc8a42dde0cced8b9200d327da26a1e0085 [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
Vladimir Marko0f9b03c2015-01-12 18:21:07 +0000180 rs_rAX, // kFArg0
181 rs_rCX, // kFArg1
182 rs_rDX, // kFArg2
183 rs_rBX, // kFArg3
Ian Rogersb28c1c02014-11-08 11:21:21 -0800184 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.
Vladimir Marko0f9b03c2015-01-12 18:21:07 +0000200 rs_fr0, // kHiddenFpArg
Ian Rogersb28c1c02014-11-08 11:21:21 -0800201 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));
Vladimir Marko0f9b03c2015-01-12 18:21:07 +0000548 LockTemp(TargetReg32(kFArg0));
549 LockTemp(TargetReg32(kFArg1));
550 LockTemp(TargetReg32(kFArg2));
551 LockTemp(TargetReg32(kFArg3));
Ian Rogersb28c1c02014-11-08 11:21:21 -0800552 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));
Vladimir Markobfe400b2014-12-19 19:27:26 +0000565 FreeTemp(TargetReg32(kHiddenArg));
Elena Sayapinadd644502014-07-01 18:39:52 +0700566 if (cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800567 FreeTemp(TargetReg32(kArg4));
568 FreeTemp(TargetReg32(kArg5));
Vladimir Marko0f9b03c2015-01-12 18:21:07 +0000569 FreeTemp(TargetReg32(kFArg0));
570 FreeTemp(TargetReg32(kFArg1));
571 FreeTemp(TargetReg32(kFArg2));
572 FreeTemp(TargetReg32(kFArg3));
Ian Rogersb28c1c02014-11-08 11:21:21 -0800573 FreeTemp(TargetReg32(kFArg4));
574 FreeTemp(TargetReg32(kFArg5));
575 FreeTemp(TargetReg32(kFArg6));
576 FreeTemp(TargetReg32(kFArg7));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700577 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700578}
579
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800580bool X86Mir2Lir::ProvidesFullMemoryBarrier(X86OpCode opcode) {
581 switch (opcode) {
582 case kX86LockCmpxchgMR:
583 case kX86LockCmpxchgAR:
Ian Rogers0f9b9c52014-06-09 01:32:12 -0700584 case kX86LockCmpxchg64M:
585 case kX86LockCmpxchg64A:
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800586 case kX86XchgMR:
587 case kX86Mfence:
588 // Atomic memory instructions provide full barrier.
589 return true;
590 default:
591 break;
592 }
593
594 // Conservative if cannot prove it provides full barrier.
595 return false;
596}
597
Andreas Gampeb14329f2014-05-15 11:16:06 -0700598bool X86Mir2Lir::GenMemBarrier(MemBarrierKind barrier_kind) {
Elliott Hughes8366ca02014-11-17 12:02:05 -0800599 if (!cu_->GetInstructionSetFeatures()->IsSmp()) {
600 return false;
601 }
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800602 // Start off with using the last LIR as the barrier. If it is not enough, then we will update it.
603 LIR* mem_barrier = last_lir_insn_;
604
Andreas Gampeb14329f2014-05-15 11:16:06 -0700605 bool ret = false;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800606 /*
Hans Boehm48f5c472014-06-27 14:50:10 -0700607 * According to the JSR-133 Cookbook, for x86 only StoreLoad/AnyAny barriers need memory fence.
608 * All other barriers (LoadAny, AnyStore, StoreStore) are nops due to the x86 memory model.
609 * 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 -0800610 */
Hans Boehm48f5c472014-06-27 14:50:10 -0700611 if (barrier_kind == kAnyAny) {
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800612 // If no LIR exists already that can be used a barrier, then generate an mfence.
613 if (mem_barrier == nullptr) {
614 mem_barrier = NewLIR0(kX86Mfence);
Andreas Gampeb14329f2014-05-15 11:16:06 -0700615 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800616 }
617
618 // If last instruction does not provide full barrier, then insert an mfence.
619 if (ProvidesFullMemoryBarrier(static_cast<X86OpCode>(mem_barrier->opcode)) == false) {
620 mem_barrier = NewLIR0(kX86Mfence);
Andreas Gampeb14329f2014-05-15 11:16:06 -0700621 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800622 }
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -0700623 } else if (barrier_kind == kNTStoreStore) {
624 mem_barrier = NewLIR0(kX86Sfence);
625 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800626 }
627
628 // Now ensure that a scheduling barrier is in place.
629 if (mem_barrier == nullptr) {
630 GenBarrier();
631 } else {
632 // Mark as a scheduling barrier.
633 DCHECK(!mem_barrier->flags.use_def_invalid);
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100634 mem_barrier->u.m.def_mask = &kEncodeAll;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800635 }
Andreas Gampeb14329f2014-05-15 11:16:06 -0700636 return ret;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700637}
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000638
Brian Carlstrom7940e442013-07-12 13:46:57 -0700639void X86Mir2Lir::CompilerInitializeRegAlloc() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700640 if (cu_->target64) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100641 reg_pool_.reset(new (arena_) RegisterPool(this, arena_, core_regs_64, core_regs_64q, sp_regs_64,
642 dp_regs_64, reserved_regs_64, reserved_regs_64q,
643 core_temps_64, core_temps_64q,
644 sp_temps_64, dp_temps_64));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700645 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100646 reg_pool_.reset(new (arena_) RegisterPool(this, arena_, core_regs_32, empty_pool, sp_regs_32,
647 dp_regs_32, reserved_regs_32, empty_pool,
648 core_temps_32, empty_pool,
649 sp_temps_32, dp_temps_32));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700650 }
buzbee091cc402014-03-31 10:14:40 -0700651
652 // Target-specific adjustments.
653
Mark Mendellfe945782014-05-22 09:52:36 -0400654 // Add in XMM registers.
Serguei Katkovc3801912014-07-08 17:21:53 +0700655 const ArrayRef<const RegStorage> *xp_regs = cu_->target64 ? &xp_regs_64 : &xp_regs_32;
656 for (RegStorage reg : *xp_regs) {
Mark Mendellfe945782014-05-22 09:52:36 -0400657 RegisterInfo* info = new (arena_) RegisterInfo(reg, GetRegMaskCommon(reg));
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100658 reginfo_map_[reg.GetReg()] = info;
Serguei Katkovc3801912014-07-08 17:21:53 +0700659 }
660 const ArrayRef<const RegStorage> *xp_temps = cu_->target64 ? &xp_temps_64 : &xp_temps_32;
661 for (RegStorage reg : *xp_temps) {
662 RegisterInfo* xp_reg_info = GetRegInfo(reg);
663 xp_reg_info->SetIsTemp(true);
Mark Mendellfe945782014-05-22 09:52:36 -0400664 }
665
Mark Mendell27dee8b2014-12-01 19:06:12 -0500666 // Special Handling for x86_64 RIP addressing.
667 if (cu_->target64) {
668 RegisterInfo* info = new (arena_) RegisterInfo(RegStorage(kRIPReg), kEncodeNone);
669 reginfo_map_[kRIPReg] = info;
670 }
671
buzbee091cc402014-03-31 10:14:40 -0700672 // Alias single precision xmm to double xmms.
673 // TODO: as needed, add larger vector sizes - alias all to the largest.
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100674 for (RegisterInfo* info : reg_pool_->sp_regs_) {
buzbee091cc402014-03-31 10:14:40 -0700675 int sp_reg_num = info->GetReg().GetRegNum();
Mark Mendellfe945782014-05-22 09:52:36 -0400676 RegStorage xp_reg = RegStorage::Solo128(sp_reg_num);
677 RegisterInfo* xp_reg_info = GetRegInfo(xp_reg);
678 // 128-bit xmm vector register's master storage should refer to itself.
679 DCHECK_EQ(xp_reg_info, xp_reg_info->Master());
680
681 // Redirect 32-bit vector's master storage to 128-bit vector.
682 info->SetMaster(xp_reg_info);
683
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700684 RegStorage dp_reg = RegStorage::FloatSolo64(sp_reg_num);
buzbee091cc402014-03-31 10:14:40 -0700685 RegisterInfo* dp_reg_info = GetRegInfo(dp_reg);
Mark Mendellfe945782014-05-22 09:52:36 -0400686 // Redirect 64-bit vector's master storage to 128-bit vector.
687 dp_reg_info->SetMaster(xp_reg_info);
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700688 // Singles should show a single 32-bit mask bit, at first referring to the low half.
689 DCHECK_EQ(info->StorageMask(), 0x1U);
690 }
691
Elena Sayapinadd644502014-07-01 18:39:52 +0700692 if (cu_->target64) {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700693 // Alias 32bit W registers to corresponding 64bit X registers.
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100694 for (RegisterInfo* info : reg_pool_->core_regs_) {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700695 int x_reg_num = info->GetReg().GetRegNum();
696 RegStorage x_reg = RegStorage::Solo64(x_reg_num);
697 RegisterInfo* x_reg_info = GetRegInfo(x_reg);
698 // 64bit X register's master storage should refer to itself.
699 DCHECK_EQ(x_reg_info, x_reg_info->Master());
700 // Redirect 32bit W master storage to 64bit X.
701 info->SetMaster(x_reg_info);
702 // 32bit W should show a single 32-bit mask bit, at first referring to the low half.
703 DCHECK_EQ(info->StorageMask(), 0x1U);
704 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700705 }
buzbee091cc402014-03-31 10:14:40 -0700706
707 // Don't start allocating temps at r0/s0/d0 or you may clobber return regs in early-exit methods.
708 // TODO: adjust for x86/hard float calling convention.
709 reg_pool_->next_core_reg_ = 2;
710 reg_pool_->next_sp_reg_ = 2;
711 reg_pool_->next_dp_reg_ = 1;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700712}
713
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700714int X86Mir2Lir::VectorRegisterSize() {
715 return 128;
716}
717
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -0700718int X86Mir2Lir::NumReservableVectorRegisters(bool long_or_fp) {
719 int num_vector_temps = cu_->target64 ? xp_temps_64.size() : xp_temps_32.size();
720
721 // Leave a few temps for use by backend as scratch.
722 return long_or_fp ? num_vector_temps - 2 : num_vector_temps - 1;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700723}
724
Brian Carlstrom7940e442013-07-12 13:46:57 -0700725void X86Mir2Lir::SpillCoreRegs() {
726 if (num_core_spills_ == 0) {
727 return;
728 }
729 // Spill mask not including fake return address register
buzbee091cc402014-03-31 10:14:40 -0700730 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
Ian Rogersb28c1c02014-11-08 11:21:21 -0800731 int offset =
732 frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
Serguei Katkovc3801912014-07-08 17:21:53 +0700733 OpSize size = cu_->target64 ? k64 : k32;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800734 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700735 for (int reg = 0; mask; mask >>= 1, reg++) {
736 if (mask & 0x1) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800737 StoreBaseDisp(rs_rSP, offset,
738 cu_->target64 ? RegStorage::Solo64(reg) : RegStorage::Solo32(reg),
Serguei Katkovc3801912014-07-08 17:21:53 +0700739 size, kNotVolatile);
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700740 offset += GetInstructionSetPointerSize(cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700741 }
742 }
743}
744
745void X86Mir2Lir::UnSpillCoreRegs() {
746 if (num_core_spills_ == 0) {
747 return;
748 }
749 // Spill mask not including fake return address register
buzbee091cc402014-03-31 10:14:40 -0700750 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700751 int offset = frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
Serguei Katkovc3801912014-07-08 17:21:53 +0700752 OpSize size = cu_->target64 ? k64 : k32;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800753 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700754 for (int reg = 0; mask; mask >>= 1, reg++) {
755 if (mask & 0x1) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800756 LoadBaseDisp(rs_rSP, offset, cu_->target64 ? RegStorage::Solo64(reg) : RegStorage::Solo32(reg),
Serguei Katkovc3801912014-07-08 17:21:53 +0700757 size, kNotVolatile);
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700758 offset += GetInstructionSetPointerSize(cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700759 }
760 }
761}
762
Serguei Katkovc3801912014-07-08 17:21:53 +0700763void X86Mir2Lir::SpillFPRegs() {
764 if (num_fp_spills_ == 0) {
765 return;
766 }
767 uint32_t mask = fp_spill_mask_;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800768 int offset = frame_size_ -
769 (GetInstructionSetPointerSize(cu_->instruction_set) * (num_fp_spills_ + num_core_spills_));
770 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Serguei Katkovc3801912014-07-08 17:21:53 +0700771 for (int reg = 0; mask; mask >>= 1, reg++) {
772 if (mask & 0x1) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800773 StoreBaseDisp(rs_rSP, offset, RegStorage::FloatSolo64(reg), k64, kNotVolatile);
Serguei Katkovc3801912014-07-08 17:21:53 +0700774 offset += sizeof(double);
775 }
776 }
777}
778void X86Mir2Lir::UnSpillFPRegs() {
779 if (num_fp_spills_ == 0) {
780 return;
781 }
782 uint32_t mask = fp_spill_mask_;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800783 int offset = frame_size_ -
784 (GetInstructionSetPointerSize(cu_->instruction_set) * (num_fp_spills_ + num_core_spills_));
785 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Serguei Katkovc3801912014-07-08 17:21:53 +0700786 for (int reg = 0; mask; mask >>= 1, reg++) {
787 if (mask & 0x1) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800788 LoadBaseDisp(rs_rSP, offset, RegStorage::FloatSolo64(reg),
Serguei Katkovc3801912014-07-08 17:21:53 +0700789 k64, kNotVolatile);
790 offset += sizeof(double);
791 }
792 }
793}
794
795
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700796bool X86Mir2Lir::IsUnconditionalBranch(LIR* lir) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700797 return (lir->opcode == kX86Jmp8 || lir->opcode == kX86Jmp32);
798}
799
Vladimir Marko674744e2014-04-24 15:18:26 +0100800RegisterClass X86Mir2Lir::RegClassForFieldLoadStore(OpSize size, bool is_volatile) {
Mark Mendellca541342014-10-15 16:59:49 -0400801 // Prefer XMM registers. Fixes a problem with iget/iput to a FP when cached temporary
802 // with same VR is a Core register.
803 if (size == kSingle || size == kDouble) {
804 return kFPReg;
805 }
806
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700807 // X86_64 can handle any size.
Elena Sayapinadd644502014-07-01 18:39:52 +0700808 if (cu_->target64) {
Chao-ying Fu06839f82014-08-14 15:59:17 -0700809 return RegClassBySize(size);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700810 }
811
Vladimir Marko674744e2014-04-24 15:18:26 +0100812 if (UNLIKELY(is_volatile)) {
813 // On x86, atomic 64-bit load/store requires an fp register.
814 // Smaller aligned load/store is atomic for both core and fp registers.
815 if (size == k64 || size == kDouble) {
816 return kFPReg;
817 }
818 }
819 return RegClassBySize(size);
820}
821
Elena Sayapinadd644502014-07-01 18:39:52 +0700822X86Mir2Lir::X86Mir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena)
Mark Mendell55d0eac2014-02-06 11:02:52 -0800823 : Mir2Lir(cu, mir_graph, arena),
Serguei Katkov717a3e42014-11-13 17:19:42 +0600824 in_to_reg_storage_x86_64_mapper_(this), in_to_reg_storage_x86_mapper_(this),
Ian Rogersdd7624d2014-03-14 17:43:00 -0700825 base_of_code_(nullptr), store_method_addr_(false), store_method_addr_used_(false),
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100826 method_address_insns_(arena->Adapter()),
827 class_type_address_insns_(arena->Adapter()),
828 call_method_insns_(arena->Adapter()),
Elena Sayapinadd644502014-07-01 18:39:52 +0700829 stack_decrement_(nullptr), stack_increment_(nullptr),
Mark Mendelld65c51a2014-04-29 16:55:20 -0400830 const_vectors_(nullptr) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100831 method_address_insns_.reserve(100);
832 class_type_address_insns_.reserve(100);
833 call_method_insns_.reserve(100);
Mark Mendelld65c51a2014-04-29 16:55:20 -0400834 store_method_addr_used_ = false;
Ian Rogersdd7624d2014-03-14 17:43:00 -0700835 for (int i = 0; i < kX86Last; i++) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700836 DCHECK_EQ(X86Mir2Lir::EncodingMap[i].opcode, i)
837 << "Encoding order for " << X86Mir2Lir::EncodingMap[i].name
838 << " is wrong: expecting " << i << ", seeing "
839 << static_cast<int>(X86Mir2Lir::EncodingMap[i].opcode);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700840 }
841}
842
843Mir2Lir* X86CodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
844 ArenaAllocator* const arena) {
Elena Sayapinadd644502014-07-01 18:39:52 +0700845 return new X86Mir2Lir(cu, mir_graph, arena);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700846}
847
Andreas Gampe98430592014-07-27 19:44:50 -0700848// Not used in x86(-64)
849RegStorage X86Mir2Lir::LoadHelper(QuickEntrypointEnum trampoline) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700850 UNUSED(trampoline);
Andreas Gampe2f244e92014-05-08 03:35:25 -0700851 LOG(FATAL) << "Unexpected use of LoadHelper in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700852 UNREACHABLE();
Andreas Gampe2f244e92014-05-08 03:35:25 -0700853}
854
Dave Allisonb373e092014-02-20 16:06:36 -0800855LIR* X86Mir2Lir::CheckSuspendUsingLoad() {
Dave Allison69dfe512014-07-11 17:11:58 +0000856 // First load the pointer in fs:[suspend-trigger] into eax
857 // Then use a test instruction to indirect via that address.
Dave Allisondfd3b472014-07-16 16:04:32 -0700858 if (cu_->target64) {
859 NewLIR2(kX86Mov64RT, rs_rAX.GetReg(),
860 Thread::ThreadSuspendTriggerOffset<8>().Int32Value());
861 } else {
862 NewLIR2(kX86Mov32RT, rs_rAX.GetReg(),
863 Thread::ThreadSuspendTriggerOffset<4>().Int32Value());
864 }
Dave Allison69dfe512014-07-11 17:11:58 +0000865 return NewLIR3(kX86Test32RM, rs_rAX.GetReg(), rs_rAX.GetReg(), 0);
Dave Allisonb373e092014-02-20 16:06:36 -0800866}
867
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700868uint64_t X86Mir2Lir::GetTargetInstFlags(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700869 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700870 return X86Mir2Lir::EncodingMap[opcode].flags;
871}
872
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700873const char* X86Mir2Lir::GetTargetInstName(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700874 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700875 return X86Mir2Lir::EncodingMap[opcode].name;
876}
877
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700878const char* X86Mir2Lir::GetTargetInstFmt(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700879 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700880 return X86Mir2Lir::EncodingMap[opcode].fmt;
881}
882
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000883void X86Mir2Lir::GenConstWide(RegLocation rl_dest, int64_t value) {
884 // Can we do this directly to memory?
885 rl_dest = UpdateLocWide(rl_dest);
886 if ((rl_dest.location == kLocDalvikFrame) ||
887 (rl_dest.location == kLocCompilerTemp)) {
888 int32_t val_lo = Low32Bits(value);
889 int32_t val_hi = High32Bits(value);
Ian Rogersb28c1c02014-11-08 11:21:21 -0800890 int r_base = rs_rX86_SP_32.GetReg();
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000891 int displacement = SRegOffset(rl_dest.s_reg_low);
892
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100893 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
buzbee2700f7e2014-03-07 09:46:20 -0800894 LIR * store = NewLIR3(kX86Mov32MI, r_base, displacement + LOWORD_OFFSET, val_lo);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000895 AnnotateDalvikRegAccess(store, (displacement + LOWORD_OFFSET) >> 2,
896 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -0800897 store = NewLIR3(kX86Mov32MI, r_base, displacement + HIWORD_OFFSET, val_hi);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000898 AnnotateDalvikRegAccess(store, (displacement + HIWORD_OFFSET) >> 2,
899 false /* is_load */, true /* is64bit */);
900 return;
901 }
902
903 // Just use the standard code to do the generation.
904 Mir2Lir::GenConstWide(rl_dest, value);
905}
Mark Mendelle02d48f2014-01-15 11:19:23 -0800906
907// TODO: Merge with existing RegLocation dumper in vreg_analysis.cc
908void X86Mir2Lir::DumpRegLocation(RegLocation loc) {
909 LOG(INFO) << "location: " << loc.location << ','
910 << (loc.wide ? " w" : " ")
911 << (loc.defined ? " D" : " ")
912 << (loc.is_const ? " c" : " ")
913 << (loc.fp ? " F" : " ")
914 << (loc.core ? " C" : " ")
915 << (loc.ref ? " r" : " ")
916 << (loc.high_word ? " h" : " ")
917 << (loc.home ? " H" : " ")
buzbee2700f7e2014-03-07 09:46:20 -0800918 << ", low: " << static_cast<int>(loc.reg.GetLowReg())
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000919 << ", high: " << static_cast<int>(loc.reg.GetHighReg())
Mark Mendelle02d48f2014-01-15 11:19:23 -0800920 << ", s_reg: " << loc.s_reg_low
921 << ", orig: " << loc.orig_sreg;
922}
923
Mark Mendell67c39c42014-01-31 17:28:00 -0800924void X86Mir2Lir::Materialize() {
925 // A good place to put the analysis before starting.
926 AnalyzeMIR();
927
928 // Now continue with regular code generation.
929 Mir2Lir::Materialize();
930}
931
Jeff Hao49161ce2014-03-12 11:05:25 -0700932void X86Mir2Lir::LoadMethodAddress(const MethodReference& target_method, InvokeType type,
Mark Mendell55d0eac2014-02-06 11:02:52 -0800933 SpecialTargetRegister symbolic_reg) {
934 /*
935 * For x86, just generate a 32 bit move immediate instruction, that will be filled
936 * in at 'link time'. For now, put a unique value based on target to ensure that
937 * code deduplication works.
938 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700939 int target_method_idx = target_method.dex_method_index;
940 const DexFile* target_dex_file = target_method.dex_file;
941 const DexFile::MethodId& target_method_id = target_dex_file->GetMethodId(target_method_idx);
942 uintptr_t target_method_id_ptr = reinterpret_cast<uintptr_t>(&target_method_id);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800943
Jeff Hao49161ce2014-03-12 11:05:25 -0700944 // Generate the move instruction with the unique pointer and save index, dex_file, and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700945 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
946 TargetReg(symbolic_reg, kNotWide).GetReg(),
Jeff Hao49161ce2014-03-12 11:05:25 -0700947 static_cast<int>(target_method_id_ptr), target_method_idx,
948 WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800949 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100950 method_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800951}
952
Fred Shihe7f82e22014-08-06 10:46:37 -0700953void X86Mir2Lir::LoadClassType(const DexFile& dex_file, uint32_t type_idx,
954 SpecialTargetRegister symbolic_reg) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800955 /*
956 * For x86, just generate a 32 bit move immediate instruction, that will be filled
957 * in at 'link time'. For now, put a unique value based on target to ensure that
958 * code deduplication works.
959 */
Fred Shihe7f82e22014-08-06 10:46:37 -0700960 const DexFile::TypeId& id = dex_file.GetTypeId(type_idx);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800961 uintptr_t ptr = reinterpret_cast<uintptr_t>(&id);
962
963 // Generate the move instruction with the unique pointer and save index and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700964 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
965 TargetReg(symbolic_reg, kNotWide).GetReg(),
Fred Shihe7f82e22014-08-06 10:46:37 -0700966 static_cast<int>(ptr), type_idx,
967 WrapPointer(const_cast<DexFile*>(&dex_file)));
Mark Mendell55d0eac2014-02-06 11:02:52 -0800968 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100969 class_type_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800970}
971
Vladimir Markof4da6752014-08-01 19:04:18 +0100972LIR* X86Mir2Lir::CallWithLinkerFixup(const MethodReference& target_method, InvokeType type) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800973 /*
974 * For x86, just generate a 32 bit call relative instruction, that will be filled
Vladimir Markof4da6752014-08-01 19:04:18 +0100975 * in at 'link time'.
Mark Mendell55d0eac2014-02-06 11:02:52 -0800976 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700977 int target_method_idx = target_method.dex_method_index;
978 const DexFile* target_dex_file = target_method.dex_file;
Mark Mendell55d0eac2014-02-06 11:02:52 -0800979
Jeff Hao49161ce2014-03-12 11:05:25 -0700980 // Generate the call instruction with the unique pointer and save index, dex_file, and type.
Vladimir Markof4da6752014-08-01 19:04:18 +0100981 // NOTE: Method deduplication takes linker patches into account, so we can just pass 0
982 // as a placeholder for the offset.
983 LIR* call = RawLIR(current_dalvik_offset_, kX86CallI, 0,
Jeff Hao49161ce2014-03-12 11:05:25 -0700984 target_method_idx, WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800985 AppendLIR(call);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100986 call_method_insns_.push_back(call);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800987 return call;
988}
989
Vladimir Markof4da6752014-08-01 19:04:18 +0100990static LIR* GenInvokeNoInlineCall(Mir2Lir* mir_to_lir, InvokeType type) {
991 QuickEntrypointEnum trampoline;
992 switch (type) {
993 case kInterface:
994 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
995 break;
996 case kDirect:
997 trampoline = kQuickInvokeDirectTrampolineWithAccessCheck;
998 break;
999 case kStatic:
1000 trampoline = kQuickInvokeStaticTrampolineWithAccessCheck;
1001 break;
1002 case kSuper:
1003 trampoline = kQuickInvokeSuperTrampolineWithAccessCheck;
1004 break;
1005 case kVirtual:
1006 trampoline = kQuickInvokeVirtualTrampolineWithAccessCheck;
1007 break;
1008 default:
1009 LOG(FATAL) << "Unexpected invoke type";
1010 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
1011 }
1012 return mir_to_lir->InvokeTrampoline(kOpBlx, RegStorage::InvalidReg(), trampoline);
1013}
1014
1015LIR* X86Mir2Lir::GenCallInsn(const MirMethodLoweringInfo& method_info) {
1016 LIR* call_insn;
1017 if (method_info.FastPath()) {
1018 if (method_info.DirectCode() == static_cast<uintptr_t>(-1)) {
1019 // We can have the linker fixup a call relative.
1020 call_insn = CallWithLinkerFixup(method_info.GetTargetMethod(), method_info.GetSharpType());
1021 } else {
1022 call_insn = OpMem(kOpBlx, TargetReg(kArg0, kRef),
Mathieu Chartier2d721012014-11-10 11:08:06 -08001023 mirror::ArtMethod::EntryPointFromQuickCompiledCodeOffset(
1024 cu_->target64 ? 8 : 4).Int32Value());
Vladimir Markof4da6752014-08-01 19:04:18 +01001025 }
1026 } else {
1027 call_insn = GenInvokeNoInlineCall(this, method_info.GetSharpType());
1028 }
1029 return call_insn;
1030}
1031
Mark Mendell55d0eac2014-02-06 11:02:52 -08001032void X86Mir2Lir::InstallLiteralPools() {
1033 // These are handled differently for x86.
1034 DCHECK(code_literal_list_ == nullptr);
1035 DCHECK(method_literal_list_ == nullptr);
1036 DCHECK(class_literal_list_ == nullptr);
1037
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001038
Mark Mendelld65c51a2014-04-29 16:55:20 -04001039 if (const_vectors_ != nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001040 // Vector literals must be 16-byte aligned. The header that is placed
1041 // in the code section causes misalignment so we take it into account.
1042 // Otherwise, we are sure that for x86 method is aligned to 16.
1043 DCHECK_EQ(GetInstructionSetAlignment(cu_->instruction_set), 16u);
1044 uint32_t bytes_to_fill = (0x10 - ((code_buffer_.size() + sizeof(OatQuickMethodHeader)) & 0xF)) & 0xF;
1045 while (bytes_to_fill > 0) {
1046 code_buffer_.push_back(0);
1047 bytes_to_fill--;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001048 }
1049
Mark Mendelld65c51a2014-04-29 16:55:20 -04001050 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Tong Shen547cdfd2014-08-05 01:54:19 -07001051 PushWord(&code_buffer_, p->operands[0]);
1052 PushWord(&code_buffer_, p->operands[1]);
1053 PushWord(&code_buffer_, p->operands[2]);
1054 PushWord(&code_buffer_, p->operands[3]);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001055 }
1056 }
1057
Mark Mendell55d0eac2014-02-06 11:02:52 -08001058 // Handle the fixups for methods.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001059 for (LIR* p : method_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001060 DCHECK_EQ(p->opcode, kX86Mov32RI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001061 uint32_t target_method_idx = p->operands[2];
1062 const DexFile* target_dex_file =
1063 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[3]));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001064
1065 // The offset to patch is the last 4 bytes of the instruction.
1066 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001067 patches_.push_back(LinkerPatch::MethodPatch(patch_offset,
1068 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001069 }
1070
1071 // Handle the fixups for class types.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001072 for (LIR* p : class_type_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001073 DCHECK_EQ(p->opcode, kX86Mov32RI);
Fred Shihe7f82e22014-08-06 10:46:37 -07001074
1075 const DexFile* class_dex_file =
1076 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[3]));
Vladimir Markof4da6752014-08-01 19:04:18 +01001077 uint32_t target_type_idx = p->operands[2];
Mark Mendell55d0eac2014-02-06 11:02:52 -08001078
1079 // The offset to patch is the last 4 bytes of the instruction.
1080 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001081 patches_.push_back(LinkerPatch::TypePatch(patch_offset,
1082 class_dex_file, target_type_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001083 }
1084
1085 // And now the PC-relative calls to methods.
Vladimir Markof4da6752014-08-01 19:04:18 +01001086 patches_.reserve(call_method_insns_.size());
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001087 for (LIR* p : call_method_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001088 DCHECK_EQ(p->opcode, kX86CallI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001089 uint32_t target_method_idx = p->operands[1];
1090 const DexFile* target_dex_file =
1091 reinterpret_cast<const DexFile*>(UnwrapPointer(p->operands[2]));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001092
1093 // The offset to patch is the last 4 bytes of the instruction.
1094 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001095 patches_.push_back(LinkerPatch::RelativeCodePatch(patch_offset,
1096 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001097 }
1098
1099 // And do the normal processing.
1100 Mir2Lir::InstallLiteralPools();
1101}
1102
DaniilSokolov70c4f062014-06-24 17:34:00 -07001103bool X86Mir2Lir::GenInlinedArrayCopyCharArray(CallInfo* info) {
DaniilSokolov70c4f062014-06-24 17:34:00 -07001104 RegLocation rl_src = info->args[0];
1105 RegLocation rl_srcPos = info->args[1];
1106 RegLocation rl_dst = info->args[2];
1107 RegLocation rl_dstPos = info->args[3];
1108 RegLocation rl_length = info->args[4];
1109 if (rl_srcPos.is_const && (mir_graph_->ConstantValue(rl_srcPos) < 0)) {
1110 return false;
1111 }
1112 if (rl_dstPos.is_const && (mir_graph_->ConstantValue(rl_dstPos) < 0)) {
1113 return false;
1114 }
1115 ClobberCallerSave();
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001116 LockCallTemps(); // Using fixed registers.
1117 RegStorage tmp_reg = cu_->target64 ? rs_r11 : rs_rBX;
1118 LoadValueDirectFixed(rl_src, rs_rAX);
1119 LoadValueDirectFixed(rl_dst, rs_rCX);
1120 LIR* src_dst_same = OpCmpBranch(kCondEq, rs_rAX, rs_rCX, nullptr);
1121 LIR* src_null_branch = OpCmpImmBranch(kCondEq, rs_rAX, 0, nullptr);
1122 LIR* dst_null_branch = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1123 LoadValueDirectFixed(rl_length, rs_rDX);
1124 // If the length of the copy is > 128 characters (256 bytes) or negative then go slow path.
1125 LIR* len_too_big = OpCmpImmBranch(kCondHi, rs_rDX, 128, nullptr);
1126 LoadValueDirectFixed(rl_src, rs_rAX);
1127 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001128 LIR* src_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001129 LIR* src_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001130 LIR* srcPos_negative = nullptr;
1131 if (!rl_srcPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001132 LoadValueDirectFixed(rl_srcPos, tmp_reg);
1133 srcPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001134 // src_pos < src_len
1135 src_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1136 // src_len - src_pos < copy_len
1137 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1138 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001139 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001140 int32_t pos_val = mir_graph_->ConstantValue(rl_srcPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001141 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001142 src_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001143 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001144 // src_pos < src_len
1145 src_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1146 // src_len - src_pos < copy_len
1147 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1148 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001149 }
1150 }
1151 LIR* dstPos_negative = nullptr;
1152 LIR* dst_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001153 LIR* dst_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001154 LoadValueDirectFixed(rl_dst, rs_rAX);
1155 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
1156 if (!rl_dstPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001157 LoadValueDirectFixed(rl_dstPos, tmp_reg);
1158 dstPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001159 // dst_pos < dst_len
1160 dst_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1161 // dst_len - dst_pos < copy_len
1162 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1163 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001164 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001165 int32_t pos_val = mir_graph_->ConstantValue(rl_dstPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001166 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001167 dst_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001168 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001169 // dst_pos < dst_len
1170 dst_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1171 // dst_len - dst_pos < copy_len
1172 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1173 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001174 }
1175 }
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001176 // Everything is checked now.
1177 LoadValueDirectFixed(rl_src, rs_rAX);
1178 LoadValueDirectFixed(rl_dst, tmp_reg);
1179 LoadValueDirectFixed(rl_srcPos, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001180 NewLIR5(kX86Lea32RA, rs_rAX.GetReg(), rs_rAX.GetReg(),
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001181 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value());
1182 // RAX now holds the address of the first src element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001183
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001184 LoadValueDirectFixed(rl_dstPos, rs_rCX);
1185 NewLIR5(kX86Lea32RA, tmp_reg.GetReg(), tmp_reg.GetReg(),
1186 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value() );
1187 // RBX now holds the address of the first dst element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001188
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001189 // Check if the number of elements to be copied is odd or even. If odd
DaniilSokolov70c4f062014-06-24 17:34:00 -07001190 // then copy the first element (so that the remaining number of elements
1191 // is even).
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001192 LoadValueDirectFixed(rl_length, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001193 OpRegImm(kOpAnd, rs_rCX, 1);
1194 LIR* jmp_to_begin_loop = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1195 OpRegImm(kOpSub, rs_rDX, 1);
1196 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001197 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001198
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001199 // Since the remaining number of elements is even, we will copy by
DaniilSokolov70c4f062014-06-24 17:34:00 -07001200 // two elements at a time.
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001201 LIR* beginLoop = NewLIR0(kPseudoTargetLabel);
1202 LIR* jmp_to_ret = OpCmpImmBranch(kCondEq, rs_rDX, 0, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001203 OpRegImm(kOpSub, rs_rDX, 2);
1204 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001205 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001206 OpUnconditionalBranch(beginLoop);
1207 LIR *check_failed = NewLIR0(kPseudoTargetLabel);
1208 LIR* launchpad_branch = OpUnconditionalBranch(nullptr);
1209 LIR *return_point = NewLIR0(kPseudoTargetLabel);
1210 jmp_to_ret->target = return_point;
1211 jmp_to_begin_loop->target = beginLoop;
1212 src_dst_same->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001213 len_too_big->target = check_failed;
1214 src_null_branch->target = check_failed;
1215 if (srcPos_negative != nullptr)
1216 srcPos_negative ->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001217 if (src_bad_off != nullptr)
1218 src_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001219 if (src_bad_len != nullptr)
1220 src_bad_len->target = check_failed;
1221 dst_null_branch->target = check_failed;
1222 if (dstPos_negative != nullptr)
1223 dstPos_negative->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001224 if (dst_bad_off != nullptr)
1225 dst_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001226 if (dst_bad_len != nullptr)
1227 dst_bad_len->target = check_failed;
1228 AddIntrinsicSlowPath(info, launchpad_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001229 ClobberCallerSave(); // We must clobber everything because slow path will return here
DaniilSokolov70c4f062014-06-24 17:34:00 -07001230 return true;
1231}
1232
1233
Mark Mendell4028a6c2014-02-19 20:06:20 -08001234/*
1235 * Fast string.index_of(I) & (II). Inline check for simple case of char <= 0xffff,
1236 * otherwise bails to standard library code.
1237 */
1238bool X86Mir2Lir::GenInlinedIndexOf(CallInfo* info, bool zero_based) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001239 RegLocation rl_obj = info->args[0];
1240 RegLocation rl_char = info->args[1];
buzbeea44d4f52014-03-05 11:26:39 -08001241 RegLocation rl_start; // Note: only present in III flavor or IndexOf.
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001242 // RBX is promotable in 64-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001243 RegStorage rs_tmp = cu_->target64 ? rs_r11 : rs_rBX;
1244 int start_value = -1;
Mark Mendell4028a6c2014-02-19 20:06:20 -08001245
1246 uint32_t char_value =
1247 rl_char.is_const ? mir_graph_->ConstantValue(rl_char.orig_sreg) : 0;
1248
1249 if (char_value > 0xFFFF) {
1250 // We have to punt to the real String.indexOf.
1251 return false;
1252 }
1253
1254 // Okay, we are commited to inlining this.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001255 // EAX: 16 bit character being searched.
1256 // ECX: count: number of words to be searched.
1257 // EDI: String being searched.
1258 // EDX: temporary during execution.
1259 // EBX or R11: temporary during execution (depending on mode).
1260 // REP SCASW: search instruction.
1261
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001262 FlushAllRegs();
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001263
buzbeea0cd2d72014-06-01 09:33:49 -07001264 RegLocation rl_return = GetReturn(kCoreReg);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001265 RegLocation rl_dest = InlineTarget(info);
1266
1267 // Is the string non-NULL?
buzbee2700f7e2014-03-07 09:46:20 -08001268 LoadValueDirectFixed(rl_obj, rs_rDX);
1269 GenNullCheck(rs_rDX, info->opt_flags);
Vladimir Marko3bc86152014-03-13 14:11:28 +00001270 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've null checked.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001271
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001272 LIR *slowpath_branch = nullptr, *length_compare = nullptr;
1273
1274 // We need the value in EAX.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001275 if (rl_char.is_const) {
buzbee2700f7e2014-03-07 09:46:20 -08001276 LoadConstantNoClobber(rs_rAX, char_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001277 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001278 // Does the character fit in 16 bits? Compare it at runtime.
buzbee2700f7e2014-03-07 09:46:20 -08001279 LoadValueDirectFixed(rl_char, rs_rAX);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001280 slowpath_branch = OpCmpImmBranch(kCondGt, rs_rAX, 0xFFFF, nullptr);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001281 }
1282
1283 // From here down, we know that we are looking for a char that fits in 16 bits.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001284 // Location of reference to data array within the String object.
1285 int value_offset = mirror::String::ValueOffset().Int32Value();
1286 // Location of count within the String object.
1287 int count_offset = mirror::String::CountOffset().Int32Value();
1288 // Starting offset within data array.
1289 int offset_offset = mirror::String::OffsetOffset().Int32Value();
1290 // Start of char data with array_.
1291 int data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Int32Value();
Mark Mendell4028a6c2014-02-19 20:06:20 -08001292
Dave Allison69dfe512014-07-11 17:11:58 +00001293 // Compute the number of words to search in to rCX.
1294 Load32Disp(rs_rDX, count_offset, rs_rCX);
1295
Dave Allisondfd3b472014-07-16 16:04:32 -07001296 // Possible signal here due to null pointer dereference.
1297 // Note that the signal handler will expect the top word of
1298 // the stack to be the ArtMethod*. If the PUSH edi instruction
1299 // below is ahead of the load above then this will not be true
1300 // and the signal handler will not work.
1301 MarkPossibleNullPointerException(0);
Dave Allison69dfe512014-07-11 17:11:58 +00001302
Dave Allisondfd3b472014-07-16 16:04:32 -07001303 if (!cu_->target64) {
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001304 // EDI is promotable in 32-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001305 NewLIR1(kX86Push32R, rs_rDI.GetReg());
1306 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001307
Mark Mendell4028a6c2014-02-19 20:06:20 -08001308 if (zero_based) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001309 // Start index is not present.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001310 // We have to handle an empty string. Use special instruction JECXZ.
1311 length_compare = NewLIR0(kX86Jecxz8);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001312
1313 // Copy the number of words to search in a temporary register.
1314 // We will use the register at the end to calculate result.
1315 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001316 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001317 // Start index is present.
buzbeea44d4f52014-03-05 11:26:39 -08001318 rl_start = info->args[2];
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001319
Mark Mendell4028a6c2014-02-19 20:06:20 -08001320 // We have to offset by the start index.
1321 if (rl_start.is_const) {
1322 start_value = mir_graph_->ConstantValue(rl_start.orig_sreg);
1323 start_value = std::max(start_value, 0);
1324
1325 // Is the start > count?
buzbee2700f7e2014-03-07 09:46:20 -08001326 length_compare = OpCmpImmBranch(kCondLe, rs_rCX, start_value, nullptr);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001327 OpRegImm(kOpMov, rs_rDI, start_value);
1328
1329 // Copy the number of words to search in a temporary register.
1330 // We will use the register at the end to calculate result.
1331 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001332
1333 if (start_value != 0) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001334 // Decrease the number of words to search by the start index.
buzbee2700f7e2014-03-07 09:46:20 -08001335 OpRegImm(kOpSub, rs_rCX, start_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001336 }
1337 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001338 // Handle "start index < 0" case.
1339 if (!cu_->target64 && rl_start.location != kLocPhysReg) {
Alexei Zavjalova1758d82014-04-17 01:55:43 +07001340 // Load the start index from stack, remembering that we pushed EDI.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001341 int displacement = SRegOffset(rl_start.s_reg_low) + sizeof(uint32_t);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001342 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001343 Load32Disp(rs_rX86_SP_32, displacement, rs_rDI);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001344 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1345 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1346 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - 1;
1347 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001348 } else {
1349 LoadValueDirectFixed(rl_start, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001350 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001351 OpRegReg(kOpXor, rs_tmp, rs_tmp);
1352 OpRegReg(kOpCmp, rs_rDI, rs_tmp);
1353 OpCondRegReg(kOpCmov, kCondLt, rs_rDI, rs_tmp);
1354
1355 // The length of the string should be greater than the start index.
1356 length_compare = OpCmpBranch(kCondLe, rs_rCX, rs_rDI, nullptr);
1357
1358 // Copy the number of words to search in a temporary register.
1359 // We will use the register at the end to calculate result.
1360 OpRegReg(kOpMov, rs_tmp, rs_rCX);
1361
1362 // Decrease the number of words to search by the start index.
1363 OpRegReg(kOpSub, rs_rCX, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001364 }
1365 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001366
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001367 // Load the address of the string into EDI.
1368 // In case of start index we have to add the address to existing value in EDI.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001369 // The string starts at VALUE(String) + 2 * OFFSET(String) + DATA_OFFSET.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001370 if (zero_based || (!zero_based && rl_start.is_const && start_value == 0)) {
1371 Load32Disp(rs_rDX, offset_offset, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001372 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001373 OpRegMem(kOpAdd, rs_rDI, rs_rDX, offset_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001374 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001375 OpRegImm(kOpLsl, rs_rDI, 1);
1376 OpRegMem(kOpAdd, rs_rDI, rs_rDX, value_offset);
1377 OpRegImm(kOpAdd, rs_rDI, data_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001378
1379 // EDI now contains the start of the string to be searched.
1380 // We are all prepared to do the search for the character.
1381 NewLIR0(kX86RepneScasw);
1382
1383 // Did we find a match?
1384 LIR* failed_branch = OpCondBranch(kCondNe, nullptr);
1385
1386 // yes, we matched. Compute the index of the result.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001387 OpRegReg(kOpSub, rs_tmp, rs_rCX);
1388 NewLIR3(kX86Lea32RM, rl_return.reg.GetReg(), rs_tmp.GetReg(), -1);
1389
Mark Mendell4028a6c2014-02-19 20:06:20 -08001390 LIR *all_done = NewLIR1(kX86Jmp8, 0);
1391
1392 // Failed to match; return -1.
1393 LIR *not_found = NewLIR0(kPseudoTargetLabel);
1394 length_compare->target = not_found;
1395 failed_branch->target = not_found;
buzbee2700f7e2014-03-07 09:46:20 -08001396 LoadConstantNoClobber(rl_return.reg, -1);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001397
1398 // And join up at the end.
1399 all_done->target = NewLIR0(kPseudoTargetLabel);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001400
1401 if (!cu_->target64)
1402 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
Mark Mendell4028a6c2014-02-19 20:06:20 -08001403
1404 // Out of line code returns here.
Mingyao Yang3a74d152014-04-21 15:39:44 -07001405 if (slowpath_branch != nullptr) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001406 LIR *return_point = NewLIR0(kPseudoTargetLabel);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001407 AddIntrinsicSlowPath(info, slowpath_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001408 ClobberCallerSave(); // We must clobber everything because slow path will return here
Mark Mendell4028a6c2014-02-19 20:06:20 -08001409 }
1410
1411 StoreValue(rl_dest, rl_return);
1412 return true;
1413}
1414
Tong Shen35e1e6a2014-07-30 09:31:22 -07001415static bool ARTRegIDToDWARFRegID(bool is_x86_64, int art_reg_id, int* dwarf_reg_id) {
1416 if (is_x86_64) {
1417 switch (art_reg_id) {
Andreas Gampebda27222014-07-30 23:21:36 -07001418 case 3 : *dwarf_reg_id = 3; return true; // %rbx
Tong Shen35e1e6a2014-07-30 09:31:22 -07001419 // This is the only discrepancy between ART & DWARF register numbering.
Andreas Gampebda27222014-07-30 23:21:36 -07001420 case 5 : *dwarf_reg_id = 6; return true; // %rbp
1421 case 12: *dwarf_reg_id = 12; return true; // %r12
1422 case 13: *dwarf_reg_id = 13; return true; // %r13
1423 case 14: *dwarf_reg_id = 14; return true; // %r14
1424 case 15: *dwarf_reg_id = 15; return true; // %r15
1425 default: return false; // Should not get here
Tong Shen35e1e6a2014-07-30 09:31:22 -07001426 }
1427 } else {
1428 switch (art_reg_id) {
Andreas Gampebda27222014-07-30 23:21:36 -07001429 case 5: *dwarf_reg_id = 5; return true; // %ebp
1430 case 6: *dwarf_reg_id = 6; return true; // %esi
1431 case 7: *dwarf_reg_id = 7; return true; // %edi
1432 default: return false; // Should not get here
Tong Shen35e1e6a2014-07-30 09:31:22 -07001433 }
1434 }
1435}
1436
Tong Shen547cdfd2014-08-05 01:54:19 -07001437std::vector<uint8_t>* X86Mir2Lir::ReturnFrameDescriptionEntry() {
1438 std::vector<uint8_t>* cfi_info = new std::vector<uint8_t>;
Mark Mendellae9fd932014-02-10 16:14:35 -08001439
1440 // Generate the FDE for the method.
1441 DCHECK_NE(data_offset_, 0U);
1442
Yevgeny Roubane3ea8382014-08-08 16:29:38 +07001443 WriteFDEHeader(cfi_info, cu_->target64);
1444 WriteFDEAddressRange(cfi_info, data_offset_, cu_->target64);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001445
Mark Mendellae9fd932014-02-10 16:14:35 -08001446 // The instructions in the FDE.
1447 if (stack_decrement_ != nullptr) {
1448 // Advance LOC to just past the stack decrement.
1449 uint32_t pc = NEXT_LIR(stack_decrement_)->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001450 DW_CFA_advance_loc(cfi_info, pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001451
1452 // Now update the offset to the call frame: DW_CFA_def_cfa_offset frame_size.
Tong Shen547cdfd2014-08-05 01:54:19 -07001453 DW_CFA_def_cfa_offset(cfi_info, frame_size_);
Mark Mendellae9fd932014-02-10 16:14:35 -08001454
Tong Shen35e1e6a2014-07-30 09:31:22 -07001455 // Handle register spills
1456 const uint32_t kSpillInstLen = (cu_->target64) ? 5 : 4;
1457 const int kDataAlignmentFactor = (cu_->target64) ? -8 : -4;
1458 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
1459 int offset = -(GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
1460 for (int reg = 0; mask; mask >>= 1, reg++) {
1461 if (mask & 0x1) {
1462 pc += kSpillInstLen;
1463
1464 // Advance LOC to pass this instruction
Tong Shen547cdfd2014-08-05 01:54:19 -07001465 DW_CFA_advance_loc(cfi_info, kSpillInstLen);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001466
1467 int dwarf_reg_id;
1468 if (ARTRegIDToDWARFRegID(cu_->target64, reg, &dwarf_reg_id)) {
Tong Shen547cdfd2014-08-05 01:54:19 -07001469 // DW_CFA_offset_extended_sf reg offset
1470 DW_CFA_offset_extended_sf(cfi_info, dwarf_reg_id, offset / kDataAlignmentFactor);
Tong Shen35e1e6a2014-07-30 09:31:22 -07001471 }
1472
1473 offset += GetInstructionSetPointerSize(cu_->instruction_set);
1474 }
1475 }
1476
Mark Mendellae9fd932014-02-10 16:14:35 -08001477 // We continue with that stack until the epilogue.
1478 if (stack_increment_ != nullptr) {
1479 uint32_t new_pc = NEXT_LIR(stack_increment_)->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001480 DW_CFA_advance_loc(cfi_info, new_pc - pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001481
1482 // We probably have code snippets after the epilogue, so save the
1483 // current state: DW_CFA_remember_state.
Tong Shen547cdfd2014-08-05 01:54:19 -07001484 DW_CFA_remember_state(cfi_info);
Mark Mendellae9fd932014-02-10 16:14:35 -08001485
Tong Shen35e1e6a2014-07-30 09:31:22 -07001486 // We have now popped the stack: DW_CFA_def_cfa_offset 4/8.
1487 // There is only the return PC on the stack now.
Tong Shen547cdfd2014-08-05 01:54:19 -07001488 DW_CFA_def_cfa_offset(cfi_info, GetInstructionSetPointerSize(cu_->instruction_set));
Mark Mendellae9fd932014-02-10 16:14:35 -08001489
1490 // Everything after that is the same as before the epilogue.
1491 // Stack bump was followed by RET instruction.
1492 LIR *post_ret_insn = NEXT_LIR(NEXT_LIR(stack_increment_));
1493 if (post_ret_insn != nullptr) {
1494 pc = new_pc;
1495 new_pc = post_ret_insn->offset;
Tong Shen547cdfd2014-08-05 01:54:19 -07001496 DW_CFA_advance_loc(cfi_info, new_pc - pc);
Mark Mendellae9fd932014-02-10 16:14:35 -08001497 // Restore the state: DW_CFA_restore_state.
Tong Shen547cdfd2014-08-05 01:54:19 -07001498 DW_CFA_restore_state(cfi_info);
Mark Mendellae9fd932014-02-10 16:14:35 -08001499 }
1500 }
1501 }
1502
Tong Shen547cdfd2014-08-05 01:54:19 -07001503 PadCFI(cfi_info);
Yevgeny Roubane3ea8382014-08-08 16:29:38 +07001504 WriteCFILength(cfi_info, cu_->target64);
Mark Mendellae9fd932014-02-10 16:14:35 -08001505
Mark Mendellae9fd932014-02-10 16:14:35 -08001506 return cfi_info;
1507}
1508
Mark Mendelld65c51a2014-04-29 16:55:20 -04001509void X86Mir2Lir::GenMachineSpecificExtendedMethodMIR(BasicBlock* bb, MIR* mir) {
1510 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001511 case kMirOpReserveVectorRegisters:
1512 ReserveVectorRegisters(mir);
1513 break;
1514 case kMirOpReturnVectorRegisters:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001515 ReturnVectorRegisters(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001516 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001517 case kMirOpConstVector:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001518 GenConst128(mir);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001519 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001520 case kMirOpMoveVector:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001521 GenMoveVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001522 break;
1523 case kMirOpPackedMultiply:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001524 GenMultiplyVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001525 break;
1526 case kMirOpPackedAddition:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001527 GenAddVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001528 break;
1529 case kMirOpPackedSubtract:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001530 GenSubtractVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001531 break;
1532 case kMirOpPackedShiftLeft:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001533 GenShiftLeftVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001534 break;
1535 case kMirOpPackedSignedShiftRight:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001536 GenSignedShiftRightVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001537 break;
1538 case kMirOpPackedUnsignedShiftRight:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001539 GenUnsignedShiftRightVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001540 break;
1541 case kMirOpPackedAnd:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001542 GenAndVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001543 break;
1544 case kMirOpPackedOr:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001545 GenOrVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001546 break;
1547 case kMirOpPackedXor:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001548 GenXorVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001549 break;
1550 case kMirOpPackedAddReduce:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001551 GenAddReduceVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001552 break;
1553 case kMirOpPackedReduce:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001554 GenReduceVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001555 break;
1556 case kMirOpPackedSet:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001557 GenSetVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001558 break;
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07001559 case kMirOpMemBarrier:
1560 GenMemBarrier(static_cast<MemBarrierKind>(mir->dalvikInsn.vA));
1561 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001562 case kMirOpPackedArrayGet:
1563 GenPackedArrayGet(bb, mir);
1564 break;
1565 case kMirOpPackedArrayPut:
1566 GenPackedArrayPut(bb, mir);
1567 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001568 default:
1569 break;
1570 }
1571}
1572
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001573void X86Mir2Lir::ReserveVectorRegisters(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001574 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001575 RegStorage xp_reg = RegStorage::Solo128(i);
1576 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1577 Clobber(xp_reg);
1578
1579 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1580 info != nullptr;
1581 info = info->GetAliasChain()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001582 ArenaVector<RegisterInfo*>* regs =
1583 info->GetReg().IsSingle() ? &reg_pool_->sp_regs_ : &reg_pool_->dp_regs_;
1584 auto it = std::find(regs->begin(), regs->end(), info);
1585 DCHECK(it != regs->end());
1586 regs->erase(it);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001587 }
1588 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001589}
1590
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001591void X86Mir2Lir::ReturnVectorRegisters(MIR* mir) {
1592 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001593 RegStorage xp_reg = RegStorage::Solo128(i);
1594 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1595
1596 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1597 info != nullptr;
1598 info = info->GetAliasChain()) {
1599 if (info->GetReg().IsSingle()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001600 reg_pool_->sp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001601 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001602 reg_pool_->dp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001603 }
1604 }
1605 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001606}
1607
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001608void X86Mir2Lir::GenConst128(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001609 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001610 Clobber(rs_dest);
1611
Mark Mendelld65c51a2014-04-29 16:55:20 -04001612 uint32_t *args = mir->dalvikInsn.arg;
Mark Mendellfe945782014-05-22 09:52:36 -04001613 int reg = rs_dest.GetReg();
Mark Mendelld65c51a2014-04-29 16:55:20 -04001614 // Check for all 0 case.
1615 if (args[0] == 0 && args[1] == 0 && args[2] == 0 && args[3] == 0) {
1616 NewLIR2(kX86XorpsRR, reg, reg);
1617 return;
1618 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001619
1620 // Append the mov const vector to reg opcode.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001621 AppendOpcodeWithConst(kX86MovdqaRM, reg, mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001622}
1623
1624void X86Mir2Lir::AppendOpcodeWithConst(X86OpCode opcode, int reg, MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001625 // To deal with correct memory ordering, reverse order of constants.
1626 int32_t constants[4];
1627 constants[3] = mir->dalvikInsn.arg[0];
1628 constants[2] = mir->dalvikInsn.arg[1];
1629 constants[1] = mir->dalvikInsn.arg[2];
1630 constants[0] = mir->dalvikInsn.arg[3];
1631
1632 // Search if there is already a constant in pool with this value.
1633 LIR *data_target = ScanVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001634 if (data_target == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001635 data_target = AddVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001636 }
1637
Mark Mendelld65c51a2014-04-29 16:55:20 -04001638 // Load the proper value from the literal area.
1639 // We don't know the proper offset for the value, so pick one that will force
Mark Mendell27dee8b2014-12-01 19:06:12 -05001640 // 4 byte offset. We will fix this up in the assembler later to have the
1641 // right value.
1642 LIR* load;
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001643 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
Mark Mendell27dee8b2014-12-01 19:06:12 -05001644 if (cu_->target64) {
1645 load = NewLIR3(opcode, reg, kRIPReg, 256 /* bogus */);
1646 } else {
1647 // Address the start of the method.
1648 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
1649 if (rl_method.wide) {
1650 rl_method = LoadValueWide(rl_method, kCoreReg);
1651 } else {
1652 rl_method = LoadValue(rl_method, kCoreReg);
1653 }
1654
1655 load = NewLIR3(opcode, reg, rl_method.reg.GetReg(), 256 /* bogus */);
1656
1657 // The literal pool needs position independent logic.
1658 store_method_addr_used_ = true;
1659 }
Mark Mendelld65c51a2014-04-29 16:55:20 -04001660 load->flags.fixup = kFixupLoad;
1661 load->target = data_target;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001662}
1663
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001664void X86Mir2Lir::GenMoveVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001665 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001666 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1667 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001668 Clobber(rs_dest);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001669 RegStorage rs_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001670 NewLIR2(kX86MovdqaRR, rs_dest.GetReg(), rs_src.GetReg());
Mark Mendellfe945782014-05-22 09:52:36 -04001671}
1672
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001673void X86Mir2Lir::GenMultiplyVectorSignedByte(RegStorage rs_dest_src1, RegStorage rs_src2) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001674 /*
1675 * Emulate the behavior of a kSignedByte by separating out the 16 values in the two XMM
1676 * and multiplying 8 at a time before recombining back into one XMM register.
1677 *
1678 * let xmm1, xmm2 be real srcs (keep low bits of 16bit lanes)
1679 * xmm3 is tmp (operate on high bits of 16bit lanes)
1680 *
1681 * xmm3 = xmm1
1682 * xmm1 = xmm1 .* xmm2
1683 * xmm1 = xmm1 & 0x00ff00ff00ff00ff00ff00ff00ff00ff // xmm1 now has low bits
1684 * xmm3 = xmm3 .>> 8
1685 * xmm2 = xmm2 & 0xff00ff00ff00ff00ff00ff00ff00ff00
1686 * xmm2 = xmm2 .* xmm3 // xmm2 now has high bits
1687 * xmm1 = xmm1 | xmm2 // combine results
1688 */
1689
1690 // Copy xmm1.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001691 RegStorage rs_src1_high_tmp = Get128BitRegister(AllocTempDouble());
1692 RegStorage rs_dest_high_tmp = Get128BitRegister(AllocTempDouble());
1693 NewLIR2(kX86MovdqaRR, rs_src1_high_tmp.GetReg(), rs_src2.GetReg());
1694 NewLIR2(kX86MovdqaRR, rs_dest_high_tmp.GetReg(), rs_dest_src1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001695
1696 // Multiply low bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001697 // x7 *= x3
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001698 NewLIR2(kX86PmullwRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1699
1700 // xmm1 now has low bits.
1701 AndMaskVectorRegister(rs_dest_src1, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF);
1702
1703 // Prepare high bits for multiplication.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001704 NewLIR2(kX86PsrlwRI, rs_src1_high_tmp.GetReg(), 0x8);
1705 AndMaskVectorRegister(rs_dest_high_tmp, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001706
1707 // Multiply high bits and xmm2 now has high bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001708 NewLIR2(kX86PmullwRR, rs_src1_high_tmp.GetReg(), rs_dest_high_tmp.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001709
1710 // Combine back into dest XMM register.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001711 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src1_high_tmp.GetReg());
1712}
1713
1714void X86Mir2Lir::GenMultiplyVectorLong(RegStorage rs_dest_src1, RegStorage rs_src2) {
1715 /*
1716 * We need to emulate the packed long multiply.
1717 * For kMirOpPackedMultiply xmm1, xmm0:
1718 * - xmm1 is src/dest
1719 * - xmm0 is src
1720 * - Get xmm2 and xmm3 as temp
1721 * - Idea is to multiply the lower 32 of each operand with the higher 32 of the other.
1722 * - Then add the two results.
1723 * - Move it to the upper 32 of the destination
1724 * - Then multiply the lower 32-bits of the operands and add the result to the destination.
1725 *
1726 * (op dest src )
1727 * movdqa %xmm2, %xmm1
1728 * movdqa %xmm3, %xmm0
1729 * psrlq %xmm3, $0x20
1730 * pmuludq %xmm3, %xmm2
1731 * psrlq %xmm1, $0x20
1732 * pmuludq %xmm1, %xmm0
1733 * paddq %xmm1, %xmm3
1734 * psllq %xmm1, $0x20
1735 * pmuludq %xmm2, %xmm0
1736 * paddq %xmm1, %xmm2
1737 *
1738 * When both the operands are the same, then we need to calculate the lower-32 * higher-32
1739 * calculation only once. Thus we don't need the xmm3 temp above. That sequence becomes:
1740 *
1741 * (op dest src )
1742 * movdqa %xmm2, %xmm1
1743 * psrlq %xmm1, $0x20
1744 * pmuludq %xmm1, %xmm0
1745 * paddq %xmm1, %xmm1
1746 * psllq %xmm1, $0x20
1747 * pmuludq %xmm2, %xmm0
1748 * paddq %xmm1, %xmm2
1749 *
1750 */
1751
1752 bool both_operands_same = (rs_dest_src1.GetReg() == rs_src2.GetReg());
1753
1754 RegStorage rs_tmp_vector_1;
1755 RegStorage rs_tmp_vector_2;
1756 rs_tmp_vector_1 = Get128BitRegister(AllocTempDouble());
1757 NewLIR2(kX86MovdqaRR, rs_tmp_vector_1.GetReg(), rs_dest_src1.GetReg());
1758
1759 if (both_operands_same == false) {
1760 rs_tmp_vector_2 = Get128BitRegister(AllocTempDouble());
1761 NewLIR2(kX86MovdqaRR, rs_tmp_vector_2.GetReg(), rs_src2.GetReg());
1762 NewLIR2(kX86PsrlqRI, rs_tmp_vector_2.GetReg(), 0x20);
1763 NewLIR2(kX86PmuludqRR, rs_tmp_vector_2.GetReg(), rs_tmp_vector_1.GetReg());
1764 }
1765
1766 NewLIR2(kX86PsrlqRI, rs_dest_src1.GetReg(), 0x20);
1767 NewLIR2(kX86PmuludqRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1768
1769 if (both_operands_same == false) {
1770 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_2.GetReg());
1771 } else {
1772 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1773 }
1774
1775 NewLIR2(kX86PsllqRI, rs_dest_src1.GetReg(), 0x20);
1776 NewLIR2(kX86PmuludqRR, rs_tmp_vector_1.GetReg(), rs_src2.GetReg());
1777 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001778}
1779
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001780void X86Mir2Lir::GenMultiplyVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001781 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1782 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1783 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001784 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001785 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001786 int opcode = 0;
1787 switch (opsize) {
1788 case k32:
1789 opcode = kX86PmulldRR;
1790 break;
1791 case kSignedHalf:
1792 opcode = kX86PmullwRR;
1793 break;
1794 case kSingle:
1795 opcode = kX86MulpsRR;
1796 break;
1797 case kDouble:
1798 opcode = kX86MulpdRR;
1799 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001800 case kSignedByte:
1801 // HW doesn't support 16x16 byte multiplication so emulate it.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001802 GenMultiplyVectorSignedByte(rs_dest_src1, rs_src2);
1803 return;
1804 case k64:
1805 GenMultiplyVectorLong(rs_dest_src1, rs_src2);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001806 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001807 default:
1808 LOG(FATAL) << "Unsupported vector multiply " << opsize;
1809 break;
1810 }
1811 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1812}
1813
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001814void X86Mir2Lir::GenAddVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001815 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1816 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1817 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001818 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001819 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001820 int opcode = 0;
1821 switch (opsize) {
1822 case k32:
1823 opcode = kX86PadddRR;
1824 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001825 case k64:
1826 opcode = kX86PaddqRR;
1827 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001828 case kSignedHalf:
1829 case kUnsignedHalf:
1830 opcode = kX86PaddwRR;
1831 break;
1832 case kUnsignedByte:
1833 case kSignedByte:
1834 opcode = kX86PaddbRR;
1835 break;
1836 case kSingle:
1837 opcode = kX86AddpsRR;
1838 break;
1839 case kDouble:
1840 opcode = kX86AddpdRR;
1841 break;
1842 default:
1843 LOG(FATAL) << "Unsupported vector addition " << opsize;
1844 break;
1845 }
1846 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1847}
1848
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001849void X86Mir2Lir::GenSubtractVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001850 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1851 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1852 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001853 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001854 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001855 int opcode = 0;
1856 switch (opsize) {
1857 case k32:
1858 opcode = kX86PsubdRR;
1859 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001860 case k64:
1861 opcode = kX86PsubqRR;
1862 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001863 case kSignedHalf:
1864 case kUnsignedHalf:
1865 opcode = kX86PsubwRR;
1866 break;
1867 case kUnsignedByte:
1868 case kSignedByte:
1869 opcode = kX86PsubbRR;
1870 break;
1871 case kSingle:
1872 opcode = kX86SubpsRR;
1873 break;
1874 case kDouble:
1875 opcode = kX86SubpdRR;
1876 break;
1877 default:
1878 LOG(FATAL) << "Unsupported vector subtraction " << opsize;
1879 break;
1880 }
1881 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1882}
1883
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001884void X86Mir2Lir::GenShiftByteVector(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001885 // Destination does not need clobbered because it has already been as part
1886 // of the general packed shift handler (caller of this method).
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001887 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001888
1889 int opcode = 0;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001890 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
1891 case kMirOpPackedShiftLeft:
1892 opcode = kX86PsllwRI;
1893 break;
1894 case kMirOpPackedSignedShiftRight:
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001895 case kMirOpPackedUnsignedShiftRight:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001896 // TODO Add support for emulated byte shifts.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001897 default:
1898 LOG(FATAL) << "Unsupported shift operation on byte vector " << opcode;
1899 break;
1900 }
1901
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001902 // Clear xmm register and return if shift more than byte length.
1903 int imm = mir->dalvikInsn.vB;
1904 if (imm >= 8) {
1905 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1906 return;
1907 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001908
1909 // Shift lower values.
1910 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1911
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001912 /*
1913 * The above shift will shift the whole word, but that means
1914 * both the bytes will shift as well. To emulate a byte level
1915 * shift, we can just throw away the lower (8 - N) bits of the
1916 * upper byte, and we are done.
1917 */
1918 uint8_t byte_mask = 0xFF << imm;
1919 uint32_t int_mask = byte_mask;
1920 int_mask = int_mask << 8 | byte_mask;
1921 int_mask = int_mask << 8 | byte_mask;
1922 int_mask = int_mask << 8 | byte_mask;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001923
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001924 // And the destination with the mask
1925 AndMaskVectorRegister(rs_dest_src1, int_mask, int_mask, int_mask, int_mask);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001926}
1927
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001928void X86Mir2Lir::GenShiftLeftVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001929 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1930 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1931 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001932 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001933 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001934 int opcode = 0;
1935 switch (opsize) {
1936 case k32:
1937 opcode = kX86PslldRI;
1938 break;
1939 case k64:
1940 opcode = kX86PsllqRI;
1941 break;
1942 case kSignedHalf:
1943 case kUnsignedHalf:
1944 opcode = kX86PsllwRI;
1945 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001946 case kSignedByte:
1947 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001948 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001949 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001950 default:
1951 LOG(FATAL) << "Unsupported vector shift left " << opsize;
1952 break;
1953 }
1954 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1955}
1956
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001957void X86Mir2Lir::GenSignedShiftRightVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001958 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1959 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1960 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001961 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001962 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001963 int opcode = 0;
1964 switch (opsize) {
1965 case k32:
1966 opcode = kX86PsradRI;
1967 break;
1968 case kSignedHalf:
1969 case kUnsignedHalf:
1970 opcode = kX86PsrawRI;
1971 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001972 case kSignedByte:
1973 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001974 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001975 return;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001976 case k64:
1977 // TODO Implement emulated shift algorithm.
Mark Mendellfe945782014-05-22 09:52:36 -04001978 default:
1979 LOG(FATAL) << "Unsupported vector signed shift right " << opsize;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001980 UNREACHABLE();
Mark Mendellfe945782014-05-22 09:52:36 -04001981 }
1982 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1983}
1984
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001985void X86Mir2Lir::GenUnsignedShiftRightVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001986 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1987 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1988 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001989 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001990 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001991 int opcode = 0;
1992 switch (opsize) {
1993 case k32:
1994 opcode = kX86PsrldRI;
1995 break;
1996 case k64:
1997 opcode = kX86PsrlqRI;
1998 break;
1999 case kSignedHalf:
2000 case kUnsignedHalf:
2001 opcode = kX86PsrlwRI;
2002 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002003 case kSignedByte:
2004 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002005 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002006 return;
Mark Mendellfe945782014-05-22 09:52:36 -04002007 default:
2008 LOG(FATAL) << "Unsupported vector unsigned shift right " << opsize;
2009 break;
2010 }
2011 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
2012}
2013
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002014void X86Mir2Lir::GenAndVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04002015 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002016 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2017 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002018 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002019 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002020 NewLIR2(kX86PandRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2021}
2022
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002023void X86Mir2Lir::GenOrVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04002024 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002025 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2026 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002027 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002028 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002029 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2030}
2031
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002032void X86Mir2Lir::GenXorVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04002033 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002034 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2035 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002036 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002037 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04002038 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
2039}
2040
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002041void X86Mir2Lir::AndMaskVectorRegister(RegStorage rs_src1, uint32_t m1, uint32_t m2, uint32_t m3, uint32_t m4) {
2042 MaskVectorRegister(kX86PandRM, rs_src1, m1, m2, m3, m4);
2043}
2044
2045void X86Mir2Lir::MaskVectorRegister(X86OpCode opcode, RegStorage rs_src1, uint32_t m0, uint32_t m1, uint32_t m2, uint32_t m3) {
2046 // Create temporary MIR as container for 128-bit binary mask.
2047 MIR const_mir;
2048 MIR* const_mirp = &const_mir;
2049 const_mirp->dalvikInsn.opcode = static_cast<Instruction::Code>(kMirOpConstVector);
2050 const_mirp->dalvikInsn.arg[0] = m0;
2051 const_mirp->dalvikInsn.arg[1] = m1;
2052 const_mirp->dalvikInsn.arg[2] = m2;
2053 const_mirp->dalvikInsn.arg[3] = m3;
2054
2055 // Mask vector with const from literal pool.
2056 AppendOpcodeWithConst(opcode, rs_src1.GetReg(), const_mirp);
2057}
2058
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002059void X86Mir2Lir::GenAddReduceVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002060 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002061 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
2062 bool is_wide = opsize == k64 || opsize == kDouble;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002063
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002064 // Get the location of the virtual register. Since this bytecode is overloaded
2065 // for different types (and sizes), we need different logic for each path.
2066 // The design of bytecode uses same VR for source and destination.
2067 RegLocation rl_src, rl_dest, rl_result;
2068 if (is_wide) {
2069 rl_src = mir_graph_->GetSrcWide(mir, 0);
2070 rl_dest = mir_graph_->GetDestWide(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002071 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002072 rl_src = mir_graph_->GetSrc(mir, 0);
2073 rl_dest = mir_graph_->GetDest(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002074 }
2075
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002076 // We need a temp for byte and short values
2077 RegStorage temp;
2078
2079 // There is a different path depending on type and size.
2080 if (opsize == kSingle) {
2081 // Handle float case.
2082 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
2083
2084 rl_src = LoadValue(rl_src, kFPReg);
2085 rl_result = EvalLoc(rl_dest, kFPReg, true);
2086
2087 // Since we are doing an add-reduce, we move the reg holding the VR
2088 // into the result so we include it in result.
2089 OpRegCopy(rl_result.reg, rl_src.reg);
2090 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2091
2092 // Since FP must keep order of operation for value safety, we shift to low
2093 // 32-bits and add to result.
2094 for (int i = 0; i < 3; i++) {
2095 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), 0x39);
2096 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2097 }
2098
2099 StoreValue(rl_dest, rl_result);
2100 } else if (opsize == kDouble) {
2101 // Handle double case.
2102 rl_src = LoadValueWide(rl_src, kFPReg);
2103 rl_result = EvalLocWide(rl_dest, kFPReg, true);
2104 LOG(FATAL) << "Unsupported vector add reduce for double.";
2105 } else if (opsize == k64) {
2106 /*
2107 * Handle long case:
2108 * 1) Reduce the vector register to lower half (with addition).
2109 * 1-1) Get an xmm temp and fill it with vector register.
2110 * 1-2) Shift the xmm temp by 8-bytes.
2111 * 1-3) Add the xmm temp to vector register that is being reduced.
2112 * 2) Allocate temp GP / GP pair.
2113 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2114 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2115 * 3) Finish the add reduction by doing what add-long/2addr does,
2116 * but instead of having a VR as one of the sources, we have our temp GP.
2117 */
2118 RegStorage rs_tmp_vector = Get128BitRegister(AllocTempDouble());
2119 NewLIR2(kX86MovdqaRR, rs_tmp_vector.GetReg(), vector_src.GetReg());
2120 NewLIR2(kX86PsrldqRI, rs_tmp_vector.GetReg(), 8);
2121 NewLIR2(kX86PaddqRR, vector_src.GetReg(), rs_tmp_vector.GetReg());
2122 FreeTemp(rs_tmp_vector);
2123
2124 // We would like to be able to reuse the add-long implementation, so set up a fake
2125 // register location to pass it.
2126 RegLocation temp_loc = mir_graph_->GetBadLoc();
2127 temp_loc.core = 1;
2128 temp_loc.wide = 1;
2129 temp_loc.location = kLocPhysReg;
2130 temp_loc.reg = AllocTempWide();
2131
2132 if (cu_->target64) {
2133 DCHECK(!temp_loc.reg.IsPair());
2134 NewLIR2(kX86MovqrxRR, temp_loc.reg.GetReg(), vector_src.GetReg());
2135 } else {
2136 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetLowReg(), vector_src.GetReg());
2137 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2138 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetHighReg(), vector_src.GetReg());
2139 }
2140
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002141 GenArithOpLong(Instruction::ADD_LONG_2ADDR, rl_dest, temp_loc, temp_loc, mir->optimization_flags);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002142 } else if (opsize == kSignedByte || opsize == kUnsignedByte) {
2143 RegStorage rs_tmp = Get128BitRegister(AllocTempDouble());
2144 NewLIR2(kX86PxorRR, rs_tmp.GetReg(), rs_tmp.GetReg());
2145 NewLIR2(kX86PsadbwRR, vector_src.GetReg(), rs_tmp.GetReg());
2146 NewLIR3(kX86PshufdRRI, rs_tmp.GetReg(), vector_src.GetReg(), 0x4e);
2147 NewLIR2(kX86PaddbRR, vector_src.GetReg(), rs_tmp.GetReg());
2148 // Move to a GPR
2149 temp = AllocTemp();
2150 NewLIR2(kX86MovdrxRR, temp.GetReg(), vector_src.GetReg());
2151 } else {
2152 // Handle and the int and short cases together
2153
2154 // Initialize as if we were handling int case. Below we update
2155 // the opcode if handling byte or short.
2156 int vec_bytes = (mir->dalvikInsn.vC & 0xFFFF) / 8;
2157 int vec_unit_size;
2158 int horizontal_add_opcode;
2159 int extract_opcode;
2160
2161 if (opsize == kSignedHalf || opsize == kUnsignedHalf) {
2162 extract_opcode = kX86PextrwRRI;
2163 horizontal_add_opcode = kX86PhaddwRR;
2164 vec_unit_size = 2;
2165 } else if (opsize == k32) {
2166 vec_unit_size = 4;
2167 horizontal_add_opcode = kX86PhadddRR;
2168 extract_opcode = kX86PextrdRRI;
2169 } else {
2170 LOG(FATAL) << "Unsupported vector add reduce " << opsize;
2171 return;
2172 }
2173
2174 int elems = vec_bytes / vec_unit_size;
2175
2176 while (elems > 1) {
2177 NewLIR2(horizontal_add_opcode, vector_src.GetReg(), vector_src.GetReg());
2178 elems >>= 1;
2179 }
2180
2181 // Handle this as arithmetic unary case.
2182 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2183
2184 // Extract to a GP register because this is integral typed.
2185 temp = AllocTemp();
2186 NewLIR3(extract_opcode, temp.GetReg(), vector_src.GetReg(), 0);
2187 }
2188
2189 if (opsize != k64 && opsize != kSingle && opsize != kDouble) {
2190 // The logic below looks very similar to the handling of ADD_INT_2ADDR
2191 // except the rhs is not a VR but a physical register allocated above.
2192 // No load of source VR is done because it assumes that rl_result will
2193 // share physical register / memory location.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002194 rl_result = UpdateLocTyped(rl_dest);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002195 if (rl_result.location == kLocPhysReg) {
2196 // Ensure res is in a core reg.
2197 rl_result = EvalLoc(rl_dest, kCoreReg, true);
2198 OpRegReg(kOpAdd, rl_result.reg, temp);
2199 StoreFinalValue(rl_dest, rl_result);
2200 } else {
2201 // Do the addition directly to memory.
2202 OpMemReg(kOpAdd, rl_result, temp.GetReg());
2203 }
2204 }
Mark Mendellfe945782014-05-22 09:52:36 -04002205}
2206
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002207void X86Mir2Lir::GenReduceVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002208 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2209 RegLocation rl_dest = mir_graph_->GetDest(mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002210 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002211 RegLocation rl_result;
2212 bool is_wide = false;
2213
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002214 // There is a different path depending on type and size.
2215 if (opsize == kSingle) {
2216 // Handle float case.
2217 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
Mark Mendellfe945782014-05-22 09:52:36 -04002218
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002219 int extract_index = mir->dalvikInsn.arg[0];
2220
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002221 rl_result = EvalLoc(rl_dest, kFPReg, true);
2222 NewLIR2(kX86PxorRR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002223
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002224 if (LIKELY(extract_index != 0)) {
2225 // We know the index of element which we want to extract. We want to extract it and
2226 // keep values in vector register correct for future use. So the way we act is:
2227 // 1. Generate shuffle mask that allows to swap zeroth and required elements;
2228 // 2. Shuffle vector register with this mask;
2229 // 3. Extract zeroth element where required value lies;
2230 // 4. Shuffle with same mask again to restore original values in vector register.
2231 // The mask is generated from equivalence mask 0b11100100 swapping 0th and extracted
2232 // element indices.
2233 int shuffle[4] = {0b00, 0b01, 0b10, 0b11};
2234 shuffle[0] = extract_index;
2235 shuffle[extract_index] = 0;
2236 int mask = 0;
2237 for (int i = 0; i < 4; i++) {
2238 mask |= (shuffle[i] << (2 * i));
2239 }
2240 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), mask);
2241 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2242 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), mask);
2243 } else {
2244 // We need to extract zeroth element and don't need any complex stuff to do it.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002245 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002246 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002247
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002248 StoreFinalValue(rl_dest, rl_result);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002249 } else if (opsize == kDouble) {
2250 // TODO Handle double case.
2251 LOG(FATAL) << "Unsupported add reduce for double.";
2252 } else if (opsize == k64) {
2253 /*
2254 * Handle long case:
2255 * 1) Reduce the vector register to lower half (with addition).
2256 * 1-1) Get an xmm temp and fill it with vector register.
2257 * 1-2) Shift the xmm temp by 8-bytes.
2258 * 1-3) Add the xmm temp to vector register that is being reduced.
2259 * 2) Evaluate destination to a GP / GP pair.
2260 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2261 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2262 * 3) Store the result to the final destination.
2263 */
Udayan Banerji53cec002014-09-26 10:41:47 -07002264 NewLIR2(kX86PsrldqRI, vector_src.GetReg(), 8);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002265 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2266 if (cu_->target64) {
2267 DCHECK(!rl_result.reg.IsPair());
2268 NewLIR2(kX86MovqrxRR, rl_result.reg.GetReg(), vector_src.GetReg());
2269 } else {
2270 NewLIR2(kX86MovdrxRR, rl_result.reg.GetLowReg(), vector_src.GetReg());
2271 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2272 NewLIR2(kX86MovdrxRR, rl_result.reg.GetHighReg(), vector_src.GetReg());
2273 }
2274
2275 StoreValueWide(rl_dest, rl_result);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002276 } else {
Udayan Banerji53cec002014-09-26 10:41:47 -07002277 int extract_index = mir->dalvikInsn.arg[0];
2278 int extr_opcode = 0;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002279 rl_result = UpdateLocTyped(rl_dest);
Udayan Banerji53cec002014-09-26 10:41:47 -07002280
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002281 // Handle the rest of integral types now.
2282 switch (opsize) {
2283 case k32:
Udayan Banerji53cec002014-09-26 10:41:47 -07002284 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrdRRI : kX86PextrdMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002285 break;
2286 case kSignedHalf:
2287 case kUnsignedHalf:
Udayan Banerji53cec002014-09-26 10:41:47 -07002288 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrwRRI : kX86PextrwMRI;
2289 break;
2290 case kSignedByte:
2291 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrbRRI : kX86PextrbMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002292 break;
2293 default:
2294 LOG(FATAL) << "Unsupported vector reduce " << opsize;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002295 UNREACHABLE();
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002296 }
2297
2298 if (rl_result.location == kLocPhysReg) {
2299 NewLIR3(extr_opcode, rl_result.reg.GetReg(), vector_src.GetReg(), extract_index);
Udayan Banerji53cec002014-09-26 10:41:47 -07002300 StoreFinalValue(rl_dest, rl_result);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002301 } else {
2302 int displacement = SRegOffset(rl_result.s_reg_low);
Razvan A Lupusorub72c7232014-10-28 19:29:52 -07002303 LIR *l = NewLIR4(extr_opcode, rs_rX86_SP_32.GetReg(), displacement, vector_src.GetReg(),
2304 extract_index);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002305 AnnotateDalvikRegAccess(l, displacement >> 2, true /* is_load */, is_wide /* is_64bit */);
2306 AnnotateDalvikRegAccess(l, displacement >> 2, false /* is_load */, is_wide /* is_64bit */);
2307 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002308 }
Mark Mendellfe945782014-05-22 09:52:36 -04002309}
2310
Mark Mendell0a1174e2014-09-11 14:51:02 -04002311void X86Mir2Lir::LoadVectorRegister(RegStorage rs_dest, RegStorage rs_src,
2312 OpSize opsize, int op_mov) {
2313 if (!cu_->target64 && opsize == k64) {
2314 // Logic assumes that longs are loaded in GP register pairs.
2315 NewLIR2(kX86MovdxrRR, rs_dest.GetReg(), rs_src.GetLowReg());
2316 RegStorage r_tmp = AllocTempDouble();
2317 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), rs_src.GetHighReg());
2318 NewLIR2(kX86PunpckldqRR, rs_dest.GetReg(), r_tmp.GetReg());
2319 FreeTemp(r_tmp);
2320 } else {
2321 NewLIR2(op_mov, rs_dest.GetReg(), rs_src.GetReg());
2322 }
2323}
2324
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002325void X86Mir2Lir::GenSetVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002326 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2327 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2328 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002329 Clobber(rs_dest);
2330 int op_shuffle = 0, op_shuffle_high = 0, op_mov = kX86MovdxrRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002331 RegisterClass reg_type = kCoreReg;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002332 bool is_wide = false;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002333
Mark Mendellfe945782014-05-22 09:52:36 -04002334 switch (opsize) {
2335 case k32:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002336 op_shuffle = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002337 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002338 case kSingle:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002339 op_shuffle = kX86PshufdRRI;
2340 op_mov = kX86MovdqaRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002341 reg_type = kFPReg;
2342 break;
2343 case k64:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002344 op_shuffle = kX86PunpcklqdqRR;
Udayan Banerji53cec002014-09-26 10:41:47 -07002345 op_mov = kX86MovqxrRR;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002346 is_wide = true;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002347 break;
2348 case kSignedByte:
2349 case kUnsignedByte:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002350 // We will have the source loaded up in a
2351 // double-word before we use this shuffle
2352 op_shuffle = kX86PshufdRRI;
2353 break;
Mark Mendellfe945782014-05-22 09:52:36 -04002354 case kSignedHalf:
2355 case kUnsignedHalf:
2356 // Handles low quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002357 op_shuffle = kX86PshuflwRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002358 // Handles upper quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002359 op_shuffle_high = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002360 break;
2361 default:
2362 LOG(FATAL) << "Unsupported vector set " << opsize;
2363 break;
2364 }
2365
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002366 // Load the value from the VR into a physical register.
2367 RegLocation rl_src;
2368 if (!is_wide) {
2369 rl_src = mir_graph_->GetSrc(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002370 rl_src = LoadValue(rl_src, reg_type);
2371 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002372 rl_src = mir_graph_->GetSrcWide(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002373 rl_src = LoadValueWide(rl_src, reg_type);
2374 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002375 RegStorage reg_to_shuffle = rl_src.reg;
Mark Mendellfe945782014-05-22 09:52:36 -04002376
2377 // Load the value into the XMM register.
Mark Mendell0a1174e2014-09-11 14:51:02 -04002378 LoadVectorRegister(rs_dest, reg_to_shuffle, opsize, op_mov);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002379
2380 if (opsize == kSignedByte || opsize == kUnsignedByte) {
2381 // In the byte case, first duplicate it to be a word
2382 // Then duplicate it to be a double-word
2383 NewLIR2(kX86PunpcklbwRR, rs_dest.GetReg(), rs_dest.GetReg());
2384 NewLIR2(kX86PunpcklwdRR, rs_dest.GetReg(), rs_dest.GetReg());
2385 }
Mark Mendellfe945782014-05-22 09:52:36 -04002386
2387 // Now shuffle the value across the destination.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002388 if (op_shuffle == kX86PunpcklqdqRR) {
2389 NewLIR2(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg());
2390 } else {
2391 NewLIR3(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg(), 0);
2392 }
Mark Mendellfe945782014-05-22 09:52:36 -04002393
2394 // And then repeat as needed.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002395 if (op_shuffle_high != 0) {
2396 NewLIR3(op_shuffle_high, rs_dest.GetReg(), rs_dest.GetReg(), 0);
Mark Mendellfe945782014-05-22 09:52:36 -04002397 }
2398}
2399
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002400void X86Mir2Lir::GenPackedArrayGet(BasicBlock* bb, MIR* mir) {
2401 UNUSED(bb, mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002402 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayGet not supported.";
2403}
2404
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002405void X86Mir2Lir::GenPackedArrayPut(BasicBlock* bb, MIR* mir) {
2406 UNUSED(bb, mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002407 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayPut not supported.";
2408}
2409
2410LIR* X86Mir2Lir::ScanVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002411 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002412 if (constants[0] == p->operands[0] && constants[1] == p->operands[1] &&
2413 constants[2] == p->operands[2] && constants[3] == p->operands[3]) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002414 return p;
2415 }
2416 }
2417 return nullptr;
2418}
2419
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002420LIR* X86Mir2Lir::AddVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002421 LIR* new_value = static_cast<LIR*>(arena_->Alloc(sizeof(LIR), kArenaAllocData));
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002422 new_value->operands[0] = constants[0];
2423 new_value->operands[1] = constants[1];
2424 new_value->operands[2] = constants[2];
2425 new_value->operands[3] = constants[3];
Mark Mendelld65c51a2014-04-29 16:55:20 -04002426 new_value->next = const_vectors_;
2427 if (const_vectors_ == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002428 estimated_native_code_size_ += 12; // Maximum needed to align to 16 byte boundary.
Mark Mendelld65c51a2014-04-29 16:55:20 -04002429 }
2430 estimated_native_code_size_ += 16; // Space for one vector.
2431 const_vectors_ = new_value;
2432 return new_value;
2433}
2434
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002435// ------------ ABI support: mapping of args to physical registers -------------
Serguei Katkov717a3e42014-11-13 17:19:42 +06002436RegStorage X86Mir2Lir::InToRegStorageX86_64Mapper::GetNextReg(ShortyArg arg) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002437 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3, kArg4, kArg5};
Serguei Katkov717a3e42014-11-13 17:19:42 +06002438 const size_t coreArgMappingToPhysicalRegSize = arraysize(coreArgMappingToPhysicalReg);
Chao-ying Fua77ee512014-07-01 17:43:41 -07002439 const SpecialTargetRegister fpArgMappingToPhysicalReg[] = {kFArg0, kFArg1, kFArg2, kFArg3,
Andreas Gampeccc60262014-07-04 18:02:38 -07002440 kFArg4, kFArg5, kFArg6, kFArg7};
Serguei Katkov717a3e42014-11-13 17:19:42 +06002441 const size_t fpArgMappingToPhysicalRegSize = arraysize(fpArgMappingToPhysicalReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002442
Serguei Katkov717a3e42014-11-13 17:19:42 +06002443 if (arg.IsFP()) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002444 if (cur_fp_reg_ < fpArgMappingToPhysicalRegSize) {
Serguei Katkov717a3e42014-11-13 17:19:42 +06002445 return m2l_->TargetReg(fpArgMappingToPhysicalReg[cur_fp_reg_++],
2446 arg.IsWide() ? kWide : kNotWide);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002447 }
2448 } else {
2449 if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
Serguei Katkov717a3e42014-11-13 17:19:42 +06002450 return m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2451 arg.IsRef() ? kRef : (arg.IsWide() ? kWide : kNotWide));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002452 }
2453 }
Chao-ying Fua77ee512014-07-01 17:43:41 -07002454 return RegStorage::InvalidReg();
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002455}
2456
Serguei Katkov717a3e42014-11-13 17:19:42 +06002457RegStorage X86Mir2Lir::InToRegStorageX86Mapper::GetNextReg(ShortyArg arg) {
2458 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3};
2459 const size_t coreArgMappingToPhysicalRegSize = arraysize(coreArgMappingToPhysicalReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002460
Serguei Katkov717a3e42014-11-13 17:19:42 +06002461 RegStorage result = RegStorage::InvalidReg();
Vladimir Marko0f9b03c2015-01-12 18:21:07 +00002462 if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
2463 result = m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2464 arg.IsRef() ? kRef : kNotWide);
2465 if (arg.IsWide() && cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
2466 result = RegStorage::MakeRegPair(
2467 result, m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++], kNotWide));
Serguei Katkov717a3e42014-11-13 17:19:42 +06002468 }
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002469 }
Serguei Katkov717a3e42014-11-13 17:19:42 +06002470 return result;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002471}
2472
2473// ---------End of ABI support: mapping of args to physical registers -------------
2474
Andreas Gampe98430592014-07-27 19:44:50 -07002475bool X86Mir2Lir::GenInlinedCharAt(CallInfo* info) {
2476 // Location of reference to data array
2477 int value_offset = mirror::String::ValueOffset().Int32Value();
2478 // Location of count
2479 int count_offset = mirror::String::CountOffset().Int32Value();
2480 // Starting offset within data array
2481 int offset_offset = mirror::String::OffsetOffset().Int32Value();
2482 // Start of char data with array_
2483 int data_offset = mirror::Array::DataOffset(sizeof(uint16_t)).Int32Value();
2484
2485 RegLocation rl_obj = info->args[0];
2486 RegLocation rl_idx = info->args[1];
2487 rl_obj = LoadValue(rl_obj, kRefReg);
2488 // X86 wants to avoid putting a constant index into a register.
2489 if (!rl_idx.is_const) {
2490 rl_idx = LoadValue(rl_idx, kCoreReg);
2491 }
2492 RegStorage reg_max;
2493 GenNullCheck(rl_obj.reg, info->opt_flags);
2494 bool range_check = (!(info->opt_flags & MIR_IGNORE_RANGE_CHECK));
2495 LIR* range_check_branch = nullptr;
2496 RegStorage reg_off;
2497 RegStorage reg_ptr;
2498 if (range_check) {
2499 // On x86, we can compare to memory directly
2500 // Set up a launch pad to allow retry in case of bounds violation */
2501 if (rl_idx.is_const) {
2502 LIR* comparison;
2503 range_check_branch = OpCmpMemImmBranch(
2504 kCondUlt, RegStorage::InvalidReg(), rl_obj.reg, count_offset,
2505 mir_graph_->ConstantValue(rl_idx.orig_sreg), nullptr, &comparison);
2506 MarkPossibleNullPointerExceptionAfter(0, comparison);
2507 } else {
2508 OpRegMem(kOpCmp, rl_idx.reg, rl_obj.reg, count_offset);
2509 MarkPossibleNullPointerException(0);
2510 range_check_branch = OpCondBranch(kCondUge, nullptr);
2511 }
2512 }
2513 reg_off = AllocTemp();
2514 reg_ptr = AllocTempRef();
2515 Load32Disp(rl_obj.reg, offset_offset, reg_off);
2516 LoadRefDisp(rl_obj.reg, value_offset, reg_ptr, kNotVolatile);
2517 if (rl_idx.is_const) {
2518 OpRegImm(kOpAdd, reg_off, mir_graph_->ConstantValue(rl_idx.orig_sreg));
2519 } else {
2520 OpRegReg(kOpAdd, reg_off, rl_idx.reg);
2521 }
2522 FreeTemp(rl_obj.reg);
2523 if (rl_idx.location == kLocPhysReg) {
2524 FreeTemp(rl_idx.reg);
2525 }
2526 RegLocation rl_dest = InlineTarget(info);
2527 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
2528 LoadBaseIndexedDisp(reg_ptr, reg_off, 1, data_offset, rl_result.reg, kUnsignedHalf);
2529 FreeTemp(reg_off);
2530 FreeTemp(reg_ptr);
2531 StoreValue(rl_dest, rl_result);
2532 if (range_check) {
2533 DCHECK(range_check_branch != nullptr);
2534 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've already null checked.
2535 AddIntrinsicSlowPath(info, range_check_branch);
2536 }
2537 return true;
2538}
2539
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002540bool X86Mir2Lir::GenInlinedCurrentThread(CallInfo* info) {
2541 RegLocation rl_dest = InlineTarget(info);
2542
2543 // Early exit if the result is unused.
2544 if (rl_dest.orig_sreg < 0) {
2545 return true;
2546 }
2547
2548 RegLocation rl_result = EvalLoc(rl_dest, kRefReg, true);
2549
2550 if (cu_->target64) {
2551 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<8>());
2552 } else {
2553 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<4>());
2554 }
2555
2556 StoreValue(rl_dest, rl_result);
2557 return true;
2558}
2559
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002560/**
2561 * Lock temp registers for explicit usage. Registers will be freed in destructor.
2562 */
2563X86Mir2Lir::ExplicitTempRegisterLock::ExplicitTempRegisterLock(X86Mir2Lir* mir_to_lir,
2564 int n_regs, ...) :
2565 temp_regs_(n_regs),
2566 mir_to_lir_(mir_to_lir) {
2567 va_list regs;
2568 va_start(regs, n_regs);
2569 for (int i = 0; i < n_regs; i++) {
2570 RegStorage reg = *(va_arg(regs, RegStorage*));
2571 RegisterInfo* info = mir_to_lir_->GetRegInfo(reg);
2572
2573 // Make sure we don't have promoted register here.
2574 DCHECK(info->IsTemp());
2575
2576 temp_regs_.push_back(reg);
2577 mir_to_lir_->FlushReg(reg);
2578
2579 if (reg.IsPair()) {
2580 RegStorage partner = info->Partner();
2581 temp_regs_.push_back(partner);
2582 mir_to_lir_->FlushReg(partner);
2583 }
2584
2585 mir_to_lir_->Clobber(reg);
2586 mir_to_lir_->LockTemp(reg);
2587 }
2588
2589 va_end(regs);
2590}
2591
2592/*
2593 * Free all locked registers.
2594 */
2595X86Mir2Lir::ExplicitTempRegisterLock::~ExplicitTempRegisterLock() {
2596 // Free all locked temps.
2597 for (auto it : temp_regs_) {
2598 mir_to_lir_->FreeTemp(it);
2599 }
2600}
2601
Serguei Katkov717a3e42014-11-13 17:19:42 +06002602int X86Mir2Lir::GenDalvikArgsBulkCopy(CallInfo* info, int first, int count) {
2603 if (count < 4) {
2604 // It does not make sense to use this utility if we have no chance to use
2605 // 128-bit move.
2606 return count;
2607 }
2608 GenDalvikArgsFlushPromoted(info, first);
2609
2610 // The rest can be copied together
2611 int current_src_offset = SRegOffset(info->args[first].s_reg_low);
2612 int current_dest_offset = StackVisitor::GetOutVROffset(first, cu_->instruction_set);
2613
2614 // Only davik regs are accessed in this loop; no next_call_insn() calls.
2615 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2616 while (count > 0) {
2617 // This is based on the knowledge that the stack itself is 16-byte aligned.
2618 bool src_is_16b_aligned = (current_src_offset & 0xF) == 0;
2619 bool dest_is_16b_aligned = (current_dest_offset & 0xF) == 0;
2620 size_t bytes_to_move;
2621
2622 /*
2623 * The amount to move defaults to 32-bit. If there are 4 registers left to move, then do a
2624 * a 128-bit move because we won't get the chance to try to aligned. If there are more than
2625 * 4 registers left to move, consider doing a 128-bit only if either src or dest are aligned.
2626 * We do this because we could potentially do a smaller move to align.
2627 */
2628 if (count == 4 || (count > 4 && (src_is_16b_aligned || dest_is_16b_aligned))) {
2629 // Moving 128-bits via xmm register.
2630 bytes_to_move = sizeof(uint32_t) * 4;
2631
2632 // Allocate a free xmm temp. Since we are working through the calling sequence,
2633 // we expect to have an xmm temporary available. AllocTempDouble will abort if
2634 // there are no free registers.
2635 RegStorage temp = AllocTempDouble();
2636
2637 LIR* ld1 = nullptr;
2638 LIR* ld2 = nullptr;
2639 LIR* st1 = nullptr;
2640 LIR* st2 = nullptr;
2641
2642 /*
2643 * The logic is similar for both loads and stores. If we have 16-byte alignment,
2644 * do an aligned move. If we have 8-byte alignment, then do the move in two
2645 * parts. This approach prevents possible cache line splits. Finally, fall back
2646 * to doing an unaligned move. In most cases we likely won't split the cache
2647 * line but we cannot prove it and thus take a conservative approach.
2648 */
2649 bool src_is_8b_aligned = (current_src_offset & 0x7) == 0;
2650 bool dest_is_8b_aligned = (current_dest_offset & 0x7) == 0;
2651
2652 if (src_is_16b_aligned) {
2653 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovA128FP);
2654 } else if (src_is_8b_aligned) {
2655 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovLo128FP);
2656 ld2 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset + (bytes_to_move >> 1),
2657 kMovHi128FP);
2658 } else {
2659 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovU128FP);
2660 }
2661
2662 if (dest_is_16b_aligned) {
2663 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovA128FP);
2664 } else if (dest_is_8b_aligned) {
2665 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovLo128FP);
2666 st2 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset + (bytes_to_move >> 1),
2667 temp, kMovHi128FP);
2668 } else {
2669 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovU128FP);
2670 }
2671
2672 // TODO If we could keep track of aliasing information for memory accesses that are wider
2673 // than 64-bit, we wouldn't need to set up a barrier.
2674 if (ld1 != nullptr) {
2675 if (ld2 != nullptr) {
2676 // For 64-bit load we can actually set up the aliasing information.
2677 AnnotateDalvikRegAccess(ld1, current_src_offset >> 2, true, true);
2678 AnnotateDalvikRegAccess(ld2, (current_src_offset + (bytes_to_move >> 1)) >> 2, true,
2679 true);
2680 } else {
2681 // Set barrier for 128-bit load.
2682 ld1->u.m.def_mask = &kEncodeAll;
2683 }
2684 }
2685 if (st1 != nullptr) {
2686 if (st2 != nullptr) {
2687 // For 64-bit store we can actually set up the aliasing information.
2688 AnnotateDalvikRegAccess(st1, current_dest_offset >> 2, false, true);
2689 AnnotateDalvikRegAccess(st2, (current_dest_offset + (bytes_to_move >> 1)) >> 2, false,
2690 true);
2691 } else {
2692 // Set barrier for 128-bit store.
2693 st1->u.m.def_mask = &kEncodeAll;
2694 }
2695 }
2696
2697 // Free the temporary used for the data movement.
2698 FreeTemp(temp);
2699 } else {
2700 // Moving 32-bits via general purpose register.
2701 bytes_to_move = sizeof(uint32_t);
2702
2703 // Instead of allocating a new temp, simply reuse one of the registers being used
2704 // for argument passing.
2705 RegStorage temp = TargetReg(kArg3, kNotWide);
2706
2707 // Now load the argument VR and store to the outs.
2708 Load32Disp(TargetPtrReg(kSp), current_src_offset, temp);
2709 Store32Disp(TargetPtrReg(kSp), current_dest_offset, temp);
2710 }
2711
2712 current_src_offset += bytes_to_move;
2713 current_dest_offset += bytes_to_move;
2714 count -= (bytes_to_move >> 2);
2715 }
2716 DCHECK_EQ(count, 0);
2717 return count;
2718}
2719
Brian Carlstrom7934ac22013-07-26 10:54:15 -07002720} // namespace art