blob: 2f211da2641b1ddfea8d055385dcb656b760b33d [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
Andreas Gampe0b9203e2015-01-22 20:39:27 -080017#include "codegen_x86.h"
18
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +070019#include <cstdarg>
Nicolas Geoffrayf3e2cc42014-02-18 18:37:26 +000020#include <inttypes.h>
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +070021#include <string>
Nicolas Geoffrayf3e2cc42014-02-18 18:37:26 +000022
Elliott Hughes8366ca02014-11-17 12:02:05 -080023#include "arch/instruction_set_features.h"
Andreas Gampe53c913b2014-08-12 23:19:23 -070024#include "backend_x86.h"
Andreas Gampe0b9203e2015-01-22 20:39:27 -080025#include "base/logging.h"
26#include "dex/compiler_ir.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070027#include "dex/quick/mir_to_lir-inl.h"
buzbeeb5860fb2014-06-21 15:31:01 -070028#include "dex/reg_storage_eq.h"
Andreas Gampe0b9203e2015-01-22 20:39:27 -080029#include "driver/compiler_driver.h"
Ian Rogers7e70b002014-10-08 11:47:24 -070030#include "mirror/array-inl.h"
Vladimir Markof4da6752014-08-01 19:04:18 +010031#include "mirror/art_method.h"
Mark Mendelle19c91f2014-02-25 08:19:08 -080032#include "mirror/string.h"
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -070033#include "oat.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070034#include "x86_lir.h"
35
Brian Carlstrom7940e442013-07-12 13:46:57 -070036namespace art {
37
Vladimir Marko089142c2014-06-05 10:57:05 +010038static constexpr RegStorage core_regs_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070039 rs_rAX, rs_rCX, rs_rDX, rs_rBX, rs_rX86_SP_32, rs_rBP, rs_rSI, rs_rDI,
40};
Vladimir Marko089142c2014-06-05 10:57:05 +010041static constexpr RegStorage core_regs_arr_64[] = {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +070042 rs_rAX, rs_rCX, rs_rDX, rs_rBX, rs_rX86_SP_32, rs_rBP, rs_rSI, rs_rDI,
buzbee091cc402014-03-31 10:14:40 -070043 rs_r8, rs_r9, rs_r10, rs_r11, rs_r12, rs_r13, rs_r14, rs_r15
Brian Carlstrom7940e442013-07-12 13:46:57 -070044};
Vladimir Marko089142c2014-06-05 10:57:05 +010045static constexpr RegStorage core_regs_arr_64q[] = {
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070046 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 +070047 rs_r8q, rs_r9q, rs_r10q, rs_r11q, rs_r12q, rs_r13q, rs_r14q, rs_r15q
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070048};
Vladimir Marko089142c2014-06-05 10:57:05 +010049static constexpr RegStorage sp_regs_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070050 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
51};
Vladimir Marko089142c2014-06-05 10:57:05 +010052static constexpr RegStorage sp_regs_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -070053 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
buzbee091cc402014-03-31 10:14:40 -070054 rs_fr8, rs_fr9, rs_fr10, rs_fr11, rs_fr12, rs_fr13, rs_fr14, rs_fr15
Brian Carlstrom7940e442013-07-12 13:46:57 -070055};
Vladimir Marko089142c2014-06-05 10:57:05 +010056static constexpr RegStorage dp_regs_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070057 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
58};
Vladimir Marko089142c2014-06-05 10:57:05 +010059static constexpr RegStorage dp_regs_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -070060 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
buzbee091cc402014-03-31 10:14:40 -070061 rs_dr8, rs_dr9, rs_dr10, rs_dr11, rs_dr12, rs_dr13, rs_dr14, rs_dr15
Brian Carlstrom7940e442013-07-12 13:46:57 -070062};
Serguei Katkovc3801912014-07-08 17:21:53 +070063static constexpr RegStorage xp_regs_arr_32[] = {
64 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
65};
66static constexpr RegStorage xp_regs_arr_64[] = {
67 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
68 rs_xr8, rs_xr9, rs_xr10, rs_xr11, rs_xr12, rs_xr13, rs_xr14, rs_xr15
69};
Vladimir Marko089142c2014-06-05 10:57:05 +010070static constexpr RegStorage reserved_regs_arr_32[] = {rs_rX86_SP_32};
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +070071static constexpr RegStorage reserved_regs_arr_64[] = {rs_rX86_SP_32};
Vladimir Marko089142c2014-06-05 10:57:05 +010072static constexpr RegStorage reserved_regs_arr_64q[] = {rs_rX86_SP_64};
73static constexpr RegStorage core_temps_arr_32[] = {rs_rAX, rs_rCX, rs_rDX, rs_rBX};
74static constexpr RegStorage core_temps_arr_64[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070075 rs_rAX, rs_rCX, rs_rDX, rs_rSI, rs_rDI,
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070076 rs_r8, rs_r9, rs_r10, rs_r11
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +070077};
Serguei Katkovc3801912014-07-08 17:21:53 +070078
79// How to add register to be available for promotion:
80// 1) Remove register from array defining temp
81// 2) Update ClobberCallerSave
82// 3) Update JNI compiler ABI:
83// 3.1) add reg in JniCallingConvention method
84// 3.2) update CoreSpillMask/FpSpillMask
85// 4) Update entrypoints
86// 4.1) Update constants in asm_support_x86_64.h for new frame size
87// 4.2) Remove entry in SmashCallerSaves
88// 4.3) Update jni_entrypoints to spill/unspill new callee save reg
89// 4.4) Update quick_entrypoints to spill/unspill new callee save reg
90// 5) Update runtime ABI
91// 5.1) Update quick_method_frame_info with new required spills
92// 5.2) Update QuickArgumentVisitor with new offsets to gprs and xmms
93// Note that you cannot use register corresponding to incoming args
94// according to ABI and QCG needs one additional XMM temp for
95// bulk copy in preparation to call.
Vladimir Marko089142c2014-06-05 10:57:05 +010096static constexpr RegStorage core_temps_arr_64q[] = {
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070097 rs_r0q, rs_r1q, rs_r2q, rs_r6q, rs_r7q,
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070098 rs_r8q, rs_r9q, rs_r10q, rs_r11q
Dmitry Petrochenko0999a6f2014-05-22 12:26:50 +070099};
Vladimir Marko089142c2014-06-05 10:57:05 +0100100static constexpr RegStorage sp_temps_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700101 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
102};
Vladimir Marko089142c2014-06-05 10:57:05 +0100103static constexpr RegStorage sp_temps_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -0700104 rs_fr0, rs_fr1, rs_fr2, rs_fr3, rs_fr4, rs_fr5, rs_fr6, rs_fr7,
Serguei Katkovc3801912014-07-08 17:21:53 +0700105 rs_fr8, rs_fr9, rs_fr10, rs_fr11
buzbee091cc402014-03-31 10:14:40 -0700106};
Vladimir Marko089142c2014-06-05 10:57:05 +0100107static constexpr RegStorage dp_temps_arr_32[] = {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700108 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
109};
Vladimir Marko089142c2014-06-05 10:57:05 +0100110static constexpr RegStorage dp_temps_arr_64[] = {
buzbee091cc402014-03-31 10:14:40 -0700111 rs_dr0, rs_dr1, rs_dr2, rs_dr3, rs_dr4, rs_dr5, rs_dr6, rs_dr7,
Serguei Katkovc3801912014-07-08 17:21:53 +0700112 rs_dr8, rs_dr9, rs_dr10, rs_dr11
buzbee091cc402014-03-31 10:14:40 -0700113};
114
Vladimir Marko089142c2014-06-05 10:57:05 +0100115static constexpr RegStorage xp_temps_arr_32[] = {
Mark Mendellfe945782014-05-22 09:52:36 -0400116 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
117};
Vladimir Marko089142c2014-06-05 10:57:05 +0100118static constexpr RegStorage xp_temps_arr_64[] = {
Mark Mendellfe945782014-05-22 09:52:36 -0400119 rs_xr0, rs_xr1, rs_xr2, rs_xr3, rs_xr4, rs_xr5, rs_xr6, rs_xr7,
Serguei Katkovc3801912014-07-08 17:21:53 +0700120 rs_xr8, rs_xr9, rs_xr10, rs_xr11
Mark Mendellfe945782014-05-22 09:52:36 -0400121};
122
Vladimir Marko089142c2014-06-05 10:57:05 +0100123static constexpr ArrayRef<const RegStorage> empty_pool;
124static constexpr ArrayRef<const RegStorage> core_regs_32(core_regs_arr_32);
125static constexpr ArrayRef<const RegStorage> core_regs_64(core_regs_arr_64);
126static constexpr ArrayRef<const RegStorage> core_regs_64q(core_regs_arr_64q);
127static constexpr ArrayRef<const RegStorage> sp_regs_32(sp_regs_arr_32);
128static constexpr ArrayRef<const RegStorage> sp_regs_64(sp_regs_arr_64);
129static constexpr ArrayRef<const RegStorage> dp_regs_32(dp_regs_arr_32);
130static constexpr ArrayRef<const RegStorage> dp_regs_64(dp_regs_arr_64);
Serguei Katkovc3801912014-07-08 17:21:53 +0700131static constexpr ArrayRef<const RegStorage> xp_regs_32(xp_regs_arr_32);
132static constexpr ArrayRef<const RegStorage> xp_regs_64(xp_regs_arr_64);
Vladimir Marko089142c2014-06-05 10:57:05 +0100133static constexpr ArrayRef<const RegStorage> reserved_regs_32(reserved_regs_arr_32);
134static constexpr ArrayRef<const RegStorage> reserved_regs_64(reserved_regs_arr_64);
135static constexpr ArrayRef<const RegStorage> reserved_regs_64q(reserved_regs_arr_64q);
136static constexpr ArrayRef<const RegStorage> core_temps_32(core_temps_arr_32);
137static constexpr ArrayRef<const RegStorage> core_temps_64(core_temps_arr_64);
138static constexpr ArrayRef<const RegStorage> core_temps_64q(core_temps_arr_64q);
139static constexpr ArrayRef<const RegStorage> sp_temps_32(sp_temps_arr_32);
140static constexpr ArrayRef<const RegStorage> sp_temps_64(sp_temps_arr_64);
141static constexpr ArrayRef<const RegStorage> dp_temps_32(dp_temps_arr_32);
142static constexpr ArrayRef<const RegStorage> dp_temps_64(dp_temps_arr_64);
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700143
Vladimir Marko089142c2014-06-05 10:57:05 +0100144static constexpr ArrayRef<const RegStorage> xp_temps_32(xp_temps_arr_32);
145static constexpr ArrayRef<const RegStorage> xp_temps_64(xp_temps_arr_64);
Mark Mendellfe945782014-05-22 09:52:36 -0400146
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700147RegLocation X86Mir2Lir::LocCReturn() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000148 return x86_loc_c_return;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700149}
150
buzbeea0cd2d72014-06-01 09:33:49 -0700151RegLocation X86Mir2Lir::LocCReturnRef() {
Chao-ying Fua77ee512014-07-01 17:43:41 -0700152 return cu_->target64 ? x86_64_loc_c_return_ref : x86_loc_c_return_ref;
buzbeea0cd2d72014-06-01 09:33:49 -0700153}
154
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700155RegLocation X86Mir2Lir::LocCReturnWide() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700156 return cu_->target64 ? x86_64_loc_c_return_wide : x86_loc_c_return_wide;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700157}
158
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700159RegLocation X86Mir2Lir::LocCReturnFloat() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000160 return x86_loc_c_return_float;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700161}
162
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700163RegLocation X86Mir2Lir::LocCReturnDouble() {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000164 return x86_loc_c_return_double;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700165}
166
Ian Rogersb28c1c02014-11-08 11:21:21 -0800167// 32-bit reg storage locations for 32-bit targets.
168static const RegStorage RegStorage32FromSpecialTargetRegister_Target32[] {
169 RegStorage::InvalidReg(), // kSelf - Thread pointer.
170 RegStorage::InvalidReg(), // kSuspend - Used to reduce suspend checks for some targets.
171 RegStorage::InvalidReg(), // kLr - no register as the return address is pushed on entry.
172 RegStorage::InvalidReg(), // kPc - not exposed on X86 see kX86StartOfMethod.
173 rs_rX86_SP_32, // kSp
174 rs_rAX, // kArg0
175 rs_rCX, // kArg1
176 rs_rDX, // kArg2
177 rs_rBX, // kArg3
178 RegStorage::InvalidReg(), // kArg4
179 RegStorage::InvalidReg(), // kArg5
180 RegStorage::InvalidReg(), // kArg6
181 RegStorage::InvalidReg(), // kArg7
Mark P Mendell966c3ae2015-01-27 15:45:27 +0000182 rs_fr0, // kFArg0
183 rs_fr1, // kFArg1
184 rs_fr2, // kFArg2
185 rs_fr3, // kFArg3
Ian Rogersb28c1c02014-11-08 11:21:21 -0800186 RegStorage::InvalidReg(), // kFArg4
187 RegStorage::InvalidReg(), // kFArg5
188 RegStorage::InvalidReg(), // kFArg6
189 RegStorage::InvalidReg(), // kFArg7
190 RegStorage::InvalidReg(), // kFArg8
191 RegStorage::InvalidReg(), // kFArg9
192 RegStorage::InvalidReg(), // kFArg10
193 RegStorage::InvalidReg(), // kFArg11
194 RegStorage::InvalidReg(), // kFArg12
195 RegStorage::InvalidReg(), // kFArg13
196 RegStorage::InvalidReg(), // kFArg14
197 RegStorage::InvalidReg(), // kFArg15
198 rs_rAX, // kRet0
199 rs_rDX, // kRet1
200 rs_rAX, // kInvokeTgt
201 rs_rAX, // kHiddenArg - used to hold the method index before copying to fr0.
Mark P Mendell966c3ae2015-01-27 15:45:27 +0000202 rs_fr7, // kHiddenFpArg
Ian Rogersb28c1c02014-11-08 11:21:21 -0800203 rs_rCX, // kCount
204};
205
206// 32-bit reg storage locations for 64-bit targets.
207static const RegStorage RegStorage32FromSpecialTargetRegister_Target64[] {
208 RegStorage::InvalidReg(), // kSelf - Thread pointer.
209 RegStorage::InvalidReg(), // kSuspend - Used to reduce suspend checks for some targets.
210 RegStorage::InvalidReg(), // kLr - no register as the return address is pushed on entry.
Mark Mendell27dee8b2014-12-01 19:06:12 -0500211 RegStorage(kRIPReg), // kPc
Ian Rogersb28c1c02014-11-08 11:21:21 -0800212 rs_rX86_SP_32, // kSp
213 rs_rDI, // kArg0
214 rs_rSI, // kArg1
215 rs_rDX, // kArg2
216 rs_rCX, // kArg3
217 rs_r8, // kArg4
218 rs_r9, // kArg5
219 RegStorage::InvalidReg(), // kArg6
220 RegStorage::InvalidReg(), // kArg7
221 rs_fr0, // kFArg0
222 rs_fr1, // kFArg1
223 rs_fr2, // kFArg2
224 rs_fr3, // kFArg3
225 rs_fr4, // kFArg4
226 rs_fr5, // kFArg5
227 rs_fr6, // kFArg6
228 rs_fr7, // kFArg7
229 RegStorage::InvalidReg(), // kFArg8
230 RegStorage::InvalidReg(), // kFArg9
231 RegStorage::InvalidReg(), // kFArg10
232 RegStorage::InvalidReg(), // kFArg11
233 RegStorage::InvalidReg(), // kFArg12
234 RegStorage::InvalidReg(), // kFArg13
235 RegStorage::InvalidReg(), // kFArg14
236 RegStorage::InvalidReg(), // kFArg15
237 rs_rAX, // kRet0
238 rs_rDX, // kRet1
239 rs_rAX, // kInvokeTgt
240 rs_rAX, // kHiddenArg
241 RegStorage::InvalidReg(), // kHiddenFpArg
242 rs_rCX, // kCount
243};
244static_assert(arraysize(RegStorage32FromSpecialTargetRegister_Target32) ==
245 arraysize(RegStorage32FromSpecialTargetRegister_Target64),
246 "Mismatch in RegStorage array sizes");
247
Chao-ying Fua77ee512014-07-01 17:43:41 -0700248// Return a target-dependent special register for 32-bit.
Ian Rogersb28c1c02014-11-08 11:21:21 -0800249RegStorage X86Mir2Lir::TargetReg32(SpecialTargetRegister reg) const {
250 DCHECK_EQ(RegStorage32FromSpecialTargetRegister_Target32[kCount], rs_rCX);
251 DCHECK_EQ(RegStorage32FromSpecialTargetRegister_Target64[kCount], rs_rCX);
252 DCHECK_LT(reg, arraysize(RegStorage32FromSpecialTargetRegister_Target32));
253 return cu_->target64 ? RegStorage32FromSpecialTargetRegister_Target64[reg]
254 : RegStorage32FromSpecialTargetRegister_Target32[reg];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700255}
256
Chao-ying Fua77ee512014-07-01 17:43:41 -0700257RegStorage X86Mir2Lir::TargetReg(SpecialTargetRegister reg) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700258 UNUSED(reg);
Chao-ying Fua77ee512014-07-01 17:43:41 -0700259 LOG(FATAL) << "Do not use this function!!!";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700260 UNREACHABLE();
Chao-ying Fua77ee512014-07-01 17:43:41 -0700261}
262
Brian Carlstrom7940e442013-07-12 13:46:57 -0700263/*
264 * Decode the register id.
265 */
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100266ResourceMask X86Mir2Lir::GetRegMaskCommon(const RegStorage& reg) const {
267 /* Double registers in x86 are just a single FP register. This is always just a single bit. */
268 return ResourceMask::Bit(
269 /* FP register starts at bit position 16 */
270 ((reg.IsFloat() || reg.StorageSize() > 8) ? kX86FPReg0 : 0) + reg.GetRegNum());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700271}
272
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100273ResourceMask X86Mir2Lir::GetPCUseDefEncoding() const {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100274 return kEncodeNone;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700275}
276
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100277void X86Mir2Lir::SetupTargetResourceMasks(LIR* lir, uint64_t flags,
278 ResourceMask* use_mask, ResourceMask* def_mask) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700279 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
buzbeeb48819d2013-09-14 16:15:25 -0700280 DCHECK(!lir->flags.use_def_invalid);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700281
282 // X86-specific resource map setup here.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700283 if (flags & REG_USE_SP) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100284 use_mask->SetBit(kX86RegSP);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700285 }
286
287 if (flags & REG_DEF_SP) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100288 def_mask->SetBit(kX86RegSP);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700289 }
290
291 if (flags & REG_DEFA) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100292 SetupRegMask(def_mask, rs_rAX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700293 }
294
295 if (flags & REG_DEFD) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100296 SetupRegMask(def_mask, rs_rDX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700297 }
298 if (flags & REG_USEA) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100299 SetupRegMask(use_mask, rs_rAX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700300 }
301
302 if (flags & REG_USEC) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100303 SetupRegMask(use_mask, rs_rCX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700304 }
305
306 if (flags & REG_USED) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100307 SetupRegMask(use_mask, rs_rDX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700308 }
Vladimir Marko70b797d2013-12-03 15:25:24 +0000309
310 if (flags & REG_USEB) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100311 SetupRegMask(use_mask, rs_rBX.GetReg());
Vladimir Marko70b797d2013-12-03 15:25:24 +0000312 }
Mark Mendell4028a6c2014-02-19 20:06:20 -0800313
314 // Fixup hard to describe instruction: Uses rAX, rCX, rDI; sets rDI.
315 if (lir->opcode == kX86RepneScasw) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100316 SetupRegMask(use_mask, rs_rAX.GetReg());
317 SetupRegMask(use_mask, rs_rCX.GetReg());
318 SetupRegMask(use_mask, rs_rDI.GetReg());
319 SetupRegMask(def_mask, rs_rDI.GetReg());
Mark Mendell4028a6c2014-02-19 20:06:20 -0800320 }
Serguei Katkove90501d2014-03-12 15:56:54 +0700321
322 if (flags & USE_FP_STACK) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100323 use_mask->SetBit(kX86FPStack);
324 def_mask->SetBit(kX86FPStack);
Serguei Katkove90501d2014-03-12 15:56:54 +0700325 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700326}
327
328/* For dumping instructions */
329static const char* x86RegName[] = {
330 "rax", "rcx", "rdx", "rbx", "rsp", "rbp", "rsi", "rdi",
331 "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15"
332};
333
334static const char* x86CondName[] = {
335 "O",
336 "NO",
337 "B/NAE/C",
338 "NB/AE/NC",
339 "Z/EQ",
340 "NZ/NE",
341 "BE/NA",
342 "NBE/A",
343 "S",
344 "NS",
345 "P/PE",
346 "NP/PO",
347 "L/NGE",
348 "NL/GE",
349 "LE/NG",
350 "NLE/G"
351};
352
353/*
354 * Interpret a format string and build a string no longer than size
355 * See format key in Assemble.cc.
356 */
357std::string X86Mir2Lir::BuildInsnString(const char *fmt, LIR *lir, unsigned char* base_addr) {
358 std::string buf;
359 size_t i = 0;
360 size_t fmt_len = strlen(fmt);
361 while (i < fmt_len) {
362 if (fmt[i] != '!') {
363 buf += fmt[i];
364 i++;
365 } else {
366 i++;
367 DCHECK_LT(i, fmt_len);
368 char operand_number_ch = fmt[i];
369 i++;
370 if (operand_number_ch == '!') {
371 buf += "!";
372 } else {
373 int operand_number = operand_number_ch - '0';
374 DCHECK_LT(operand_number, 6); // Expect upto 6 LIR operands.
375 DCHECK_LT(i, fmt_len);
376 int operand = lir->operands[operand_number];
377 switch (fmt[i]) {
378 case 'c':
379 DCHECK_LT(static_cast<size_t>(operand), sizeof(x86CondName));
380 buf += x86CondName[operand];
381 break;
382 case 'd':
383 buf += StringPrintf("%d", operand);
384 break;
Yixin Shou5192cbb2014-07-01 13:48:17 -0400385 case 'q': {
386 int64_t value = static_cast<int64_t>(static_cast<int64_t>(operand) << 32 |
387 static_cast<uint32_t>(lir->operands[operand_number+1]));
388 buf +=StringPrintf("%" PRId64, value);
Haitao Fenge70f1792014-08-09 08:31:02 +0800389 break;
Yixin Shou5192cbb2014-07-01 13:48:17 -0400390 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700391 case 'p': {
Vladimir Markof6737f72015-03-23 17:05:14 +0000392 const EmbeddedData* tab_rec = UnwrapPointer<EmbeddedData>(operand);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700393 buf += StringPrintf("0x%08x", tab_rec->offset);
394 break;
395 }
396 case 'r':
buzbee091cc402014-03-31 10:14:40 -0700397 if (RegStorage::IsFloat(operand)) {
398 int fp_reg = RegStorage::RegNum(operand);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700399 buf += StringPrintf("xmm%d", fp_reg);
400 } else {
buzbee091cc402014-03-31 10:14:40 -0700401 int reg_num = RegStorage::RegNum(operand);
402 DCHECK_LT(static_cast<size_t>(reg_num), sizeof(x86RegName));
403 buf += x86RegName[reg_num];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700404 }
405 break;
406 case 't':
Ian Rogers107c31e2014-01-23 20:55:29 -0800407 buf += StringPrintf("0x%08" PRIxPTR " (L%p)",
408 reinterpret_cast<uintptr_t>(base_addr) + lir->offset + operand,
409 lir->target);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700410 break;
411 default:
412 buf += StringPrintf("DecodeError '%c'", fmt[i]);
413 break;
414 }
415 i++;
416 }
417 }
418 }
419 return buf;
420}
421
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100422void X86Mir2Lir::DumpResourceMask(LIR *x86LIR, const ResourceMask& mask, const char *prefix) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700423 char buf[256];
424 buf[0] = 0;
425
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100426 if (mask.Equals(kEncodeAll)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700427 strcpy(buf, "all");
428 } else {
429 char num[8];
430 int i;
431
432 for (i = 0; i < kX86RegEnd; i++) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100433 if (mask.HasBit(i)) {
Ian Rogers988e6ea2014-01-08 11:30:50 -0800434 snprintf(num, arraysize(num), "%d ", i);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700435 strcat(buf, num);
436 }
437 }
438
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100439 if (mask.HasBit(ResourceMask::kCCode)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700440 strcat(buf, "cc ");
441 }
442 /* Memory bits */
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100443 if (x86LIR && (mask.HasBit(ResourceMask::kDalvikReg))) {
Ian Rogers988e6ea2014-01-08 11:30:50 -0800444 snprintf(buf + strlen(buf), arraysize(buf) - strlen(buf), "dr%d%s",
445 DECODE_ALIAS_INFO_REG(x86LIR->flags.alias_info),
446 (DECODE_ALIAS_INFO_WIDE(x86LIR->flags.alias_info)) ? "(+1)" : "");
Brian Carlstrom7940e442013-07-12 13:46:57 -0700447 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100448 if (mask.HasBit(ResourceMask::kLiteral)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700449 strcat(buf, "lit ");
450 }
451
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100452 if (mask.HasBit(ResourceMask::kHeapRef)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700453 strcat(buf, "heap ");
454 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100455 if (mask.HasBit(ResourceMask::kMustNotAlias)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700456 strcat(buf, "noalias ");
457 }
458 }
459 if (buf[0]) {
460 LOG(INFO) << prefix << ": " << buf;
461 }
462}
463
464void X86Mir2Lir::AdjustSpillMask() {
465 // Adjustment for LR spilling, x86 has no LR so nothing to do here
buzbee091cc402014-03-31 10:14:40 -0700466 core_spill_mask_ |= (1 << rs_rRET.GetRegNum());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700467 num_core_spills_++;
468}
469
Mark Mendelle87f9b52014-04-30 14:13:18 -0400470RegStorage X86Mir2Lir::AllocateByteRegister() {
Chao-ying Fu7e399fd2014-06-10 18:11:11 -0700471 RegStorage reg = AllocTypedTemp(false, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +0700472 if (!cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800473 DCHECK_LT(reg.GetRegNum(), rs_rX86_SP_32.GetRegNum());
Chao-ying Fu7e399fd2014-06-10 18:11:11 -0700474 }
475 return reg;
476}
477
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700478RegStorage X86Mir2Lir::Get128BitRegister(RegStorage reg) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -0700479 return GetRegInfo(reg)->Master()->GetReg();
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700480}
481
Ian Rogersb28c1c02014-11-08 11:21:21 -0800482bool X86Mir2Lir::IsByteRegister(RegStorage reg) const {
483 return cu_->target64 || reg.GetRegNum() < rs_rX86_SP_32.GetRegNum();
Mark Mendelle87f9b52014-04-30 14:13:18 -0400484}
485
Brian Carlstrom7940e442013-07-12 13:46:57 -0700486/* Clobber all regs that might be used by an external C call */
Vladimir Marko31c2aac2013-12-09 16:31:19 +0000487void X86Mir2Lir::ClobberCallerSave() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700488 if (cu_->target64) {
Serguei Katkovc3801912014-07-08 17:21:53 +0700489 Clobber(rs_rAX);
490 Clobber(rs_rCX);
491 Clobber(rs_rDX);
492 Clobber(rs_rSI);
493 Clobber(rs_rDI);
494
Chao-ying Fu35ec2b52014-06-16 16:40:31 -0700495 Clobber(rs_r8);
496 Clobber(rs_r9);
497 Clobber(rs_r10);
498 Clobber(rs_r11);
499
500 Clobber(rs_fr8);
501 Clobber(rs_fr9);
502 Clobber(rs_fr10);
503 Clobber(rs_fr11);
Serguei Katkovc3801912014-07-08 17:21:53 +0700504 } else {
505 Clobber(rs_rAX);
506 Clobber(rs_rCX);
507 Clobber(rs_rDX);
508 Clobber(rs_rBX);
Chao-ying Fu35ec2b52014-06-16 16:40:31 -0700509 }
Serguei Katkovc3801912014-07-08 17:21:53 +0700510
511 Clobber(rs_fr0);
512 Clobber(rs_fr1);
513 Clobber(rs_fr2);
514 Clobber(rs_fr3);
515 Clobber(rs_fr4);
516 Clobber(rs_fr5);
517 Clobber(rs_fr6);
518 Clobber(rs_fr7);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700519}
520
521RegLocation X86Mir2Lir::GetReturnWideAlt() {
522 RegLocation res = LocCReturnWide();
Ian Rogersb28c1c02014-11-08 11:21:21 -0800523 DCHECK_EQ(res.reg.GetLowReg(), rs_rAX.GetReg());
524 DCHECK_EQ(res.reg.GetHighReg(), rs_rDX.GetReg());
buzbee091cc402014-03-31 10:14:40 -0700525 Clobber(rs_rAX);
526 Clobber(rs_rDX);
527 MarkInUse(rs_rAX);
528 MarkInUse(rs_rDX);
529 MarkWide(res.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700530 return res;
531}
532
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700533RegLocation X86Mir2Lir::GetReturnAlt() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700534 RegLocation res = LocCReturn();
buzbee091cc402014-03-31 10:14:40 -0700535 res.reg.SetReg(rs_rDX.GetReg());
536 Clobber(rs_rDX);
537 MarkInUse(rs_rDX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700538 return res;
539}
540
Brian Carlstrom7940e442013-07-12 13:46:57 -0700541/* To be used when explicitly managing register use */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700542void X86Mir2Lir::LockCallTemps() {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800543 LockTemp(TargetReg32(kArg0));
544 LockTemp(TargetReg32(kArg1));
545 LockTemp(TargetReg32(kArg2));
546 LockTemp(TargetReg32(kArg3));
Mark P Mendell966c3ae2015-01-27 15:45:27 +0000547 LockTemp(TargetReg32(kFArg0));
548 LockTemp(TargetReg32(kFArg1));
549 LockTemp(TargetReg32(kFArg2));
550 LockTemp(TargetReg32(kFArg3));
Elena Sayapinadd644502014-07-01 18:39:52 +0700551 if (cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800552 LockTemp(TargetReg32(kArg4));
553 LockTemp(TargetReg32(kArg5));
Ian Rogersb28c1c02014-11-08 11:21:21 -0800554 LockTemp(TargetReg32(kFArg4));
555 LockTemp(TargetReg32(kFArg5));
556 LockTemp(TargetReg32(kFArg6));
557 LockTemp(TargetReg32(kFArg7));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700558 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700559}
560
561/* To be used when explicitly managing register use */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700562void X86Mir2Lir::FreeCallTemps() {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800563 FreeTemp(TargetReg32(kArg0));
564 FreeTemp(TargetReg32(kArg1));
565 FreeTemp(TargetReg32(kArg2));
566 FreeTemp(TargetReg32(kArg3));
Vladimir Markobfe400b2014-12-19 19:27:26 +0000567 FreeTemp(TargetReg32(kHiddenArg));
Mark P Mendell966c3ae2015-01-27 15:45:27 +0000568 FreeTemp(TargetReg32(kFArg0));
569 FreeTemp(TargetReg32(kFArg1));
570 FreeTemp(TargetReg32(kFArg2));
571 FreeTemp(TargetReg32(kFArg3));
Elena Sayapinadd644502014-07-01 18:39:52 +0700572 if (cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800573 FreeTemp(TargetReg32(kArg4));
574 FreeTemp(TargetReg32(kArg5));
Ian Rogersb28c1c02014-11-08 11:21:21 -0800575 FreeTemp(TargetReg32(kFArg4));
576 FreeTemp(TargetReg32(kFArg5));
577 FreeTemp(TargetReg32(kFArg6));
578 FreeTemp(TargetReg32(kFArg7));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700579 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700580}
581
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800582bool X86Mir2Lir::ProvidesFullMemoryBarrier(X86OpCode opcode) {
583 switch (opcode) {
584 case kX86LockCmpxchgMR:
585 case kX86LockCmpxchgAR:
Ian Rogers0f9b9c52014-06-09 01:32:12 -0700586 case kX86LockCmpxchg64M:
587 case kX86LockCmpxchg64A:
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800588 case kX86XchgMR:
589 case kX86Mfence:
590 // Atomic memory instructions provide full barrier.
591 return true;
592 default:
593 break;
594 }
595
596 // Conservative if cannot prove it provides full barrier.
597 return false;
598}
599
Andreas Gampeb14329f2014-05-15 11:16:06 -0700600bool X86Mir2Lir::GenMemBarrier(MemBarrierKind barrier_kind) {
Andreas Gampe0b9203e2015-01-22 20:39:27 -0800601 if (!cu_->compiler_driver->GetInstructionSetFeatures()->IsSmp()) {
Elliott Hughes8366ca02014-11-17 12:02:05 -0800602 return false;
603 }
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800604 // Start off with using the last LIR as the barrier. If it is not enough, then we will update it.
605 LIR* mem_barrier = last_lir_insn_;
606
Andreas Gampeb14329f2014-05-15 11:16:06 -0700607 bool ret = false;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800608 /*
Hans Boehm48f5c472014-06-27 14:50:10 -0700609 * According to the JSR-133 Cookbook, for x86 only StoreLoad/AnyAny barriers need memory fence.
610 * All other barriers (LoadAny, AnyStore, StoreStore) are nops due to the x86 memory model.
611 * 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 -0800612 */
Hans Boehm48f5c472014-06-27 14:50:10 -0700613 if (barrier_kind == kAnyAny) {
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800614 // If no LIR exists already that can be used a barrier, then generate an mfence.
615 if (mem_barrier == nullptr) {
616 mem_barrier = NewLIR0(kX86Mfence);
Andreas Gampeb14329f2014-05-15 11:16:06 -0700617 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800618 }
619
620 // If last instruction does not provide full barrier, then insert an mfence.
621 if (ProvidesFullMemoryBarrier(static_cast<X86OpCode>(mem_barrier->opcode)) == false) {
622 mem_barrier = NewLIR0(kX86Mfence);
Andreas Gampeb14329f2014-05-15 11:16:06 -0700623 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800624 }
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -0700625 } else if (barrier_kind == kNTStoreStore) {
626 mem_barrier = NewLIR0(kX86Sfence);
627 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800628 }
629
630 // Now ensure that a scheduling barrier is in place.
631 if (mem_barrier == nullptr) {
632 GenBarrier();
633 } else {
634 // Mark as a scheduling barrier.
635 DCHECK(!mem_barrier->flags.use_def_invalid);
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100636 mem_barrier->u.m.def_mask = &kEncodeAll;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800637 }
Andreas Gampeb14329f2014-05-15 11:16:06 -0700638 return ret;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700639}
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000640
Brian Carlstrom7940e442013-07-12 13:46:57 -0700641void X86Mir2Lir::CompilerInitializeRegAlloc() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700642 if (cu_->target64) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100643 reg_pool_.reset(new (arena_) RegisterPool(this, arena_, core_regs_64, core_regs_64q, sp_regs_64,
644 dp_regs_64, reserved_regs_64, reserved_regs_64q,
645 core_temps_64, core_temps_64q,
646 sp_temps_64, dp_temps_64));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700647 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100648 reg_pool_.reset(new (arena_) RegisterPool(this, arena_, core_regs_32, empty_pool, sp_regs_32,
649 dp_regs_32, reserved_regs_32, empty_pool,
650 core_temps_32, empty_pool,
651 sp_temps_32, dp_temps_32));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700652 }
buzbee091cc402014-03-31 10:14:40 -0700653
654 // Target-specific adjustments.
655
Mark Mendellfe945782014-05-22 09:52:36 -0400656 // Add in XMM registers.
Serguei Katkovc3801912014-07-08 17:21:53 +0700657 const ArrayRef<const RegStorage> *xp_regs = cu_->target64 ? &xp_regs_64 : &xp_regs_32;
658 for (RegStorage reg : *xp_regs) {
Mark Mendellfe945782014-05-22 09:52:36 -0400659 RegisterInfo* info = new (arena_) RegisterInfo(reg, GetRegMaskCommon(reg));
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100660 reginfo_map_[reg.GetReg()] = info;
Serguei Katkovc3801912014-07-08 17:21:53 +0700661 }
662 const ArrayRef<const RegStorage> *xp_temps = cu_->target64 ? &xp_temps_64 : &xp_temps_32;
663 for (RegStorage reg : *xp_temps) {
664 RegisterInfo* xp_reg_info = GetRegInfo(reg);
665 xp_reg_info->SetIsTemp(true);
Mark Mendellfe945782014-05-22 09:52:36 -0400666 }
667
Mark Mendell27dee8b2014-12-01 19:06:12 -0500668 // Special Handling for x86_64 RIP addressing.
669 if (cu_->target64) {
670 RegisterInfo* info = new (arena_) RegisterInfo(RegStorage(kRIPReg), kEncodeNone);
671 reginfo_map_[kRIPReg] = info;
672 }
673
buzbee091cc402014-03-31 10:14:40 -0700674 // Alias single precision xmm to double xmms.
675 // TODO: as needed, add larger vector sizes - alias all to the largest.
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100676 for (RegisterInfo* info : reg_pool_->sp_regs_) {
buzbee091cc402014-03-31 10:14:40 -0700677 int sp_reg_num = info->GetReg().GetRegNum();
Mark Mendellfe945782014-05-22 09:52:36 -0400678 RegStorage xp_reg = RegStorage::Solo128(sp_reg_num);
679 RegisterInfo* xp_reg_info = GetRegInfo(xp_reg);
680 // 128-bit xmm vector register's master storage should refer to itself.
681 DCHECK_EQ(xp_reg_info, xp_reg_info->Master());
682
683 // Redirect 32-bit vector's master storage to 128-bit vector.
684 info->SetMaster(xp_reg_info);
685
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700686 RegStorage dp_reg = RegStorage::FloatSolo64(sp_reg_num);
buzbee091cc402014-03-31 10:14:40 -0700687 RegisterInfo* dp_reg_info = GetRegInfo(dp_reg);
Mark Mendellfe945782014-05-22 09:52:36 -0400688 // Redirect 64-bit vector's master storage to 128-bit vector.
689 dp_reg_info->SetMaster(xp_reg_info);
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700690 // Singles should show a single 32-bit mask bit, at first referring to the low half.
691 DCHECK_EQ(info->StorageMask(), 0x1U);
692 }
693
Elena Sayapinadd644502014-07-01 18:39:52 +0700694 if (cu_->target64) {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700695 // Alias 32bit W registers to corresponding 64bit X registers.
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100696 for (RegisterInfo* info : reg_pool_->core_regs_) {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700697 int x_reg_num = info->GetReg().GetRegNum();
698 RegStorage x_reg = RegStorage::Solo64(x_reg_num);
699 RegisterInfo* x_reg_info = GetRegInfo(x_reg);
700 // 64bit X register's master storage should refer to itself.
701 DCHECK_EQ(x_reg_info, x_reg_info->Master());
702 // Redirect 32bit W master storage to 64bit X.
703 info->SetMaster(x_reg_info);
704 // 32bit W should show a single 32-bit mask bit, at first referring to the low half.
705 DCHECK_EQ(info->StorageMask(), 0x1U);
706 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700707 }
buzbee091cc402014-03-31 10:14:40 -0700708
709 // Don't start allocating temps at r0/s0/d0 or you may clobber return regs in early-exit methods.
710 // TODO: adjust for x86/hard float calling convention.
711 reg_pool_->next_core_reg_ = 2;
712 reg_pool_->next_sp_reg_ = 2;
713 reg_pool_->next_dp_reg_ = 1;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700714}
715
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700716int X86Mir2Lir::VectorRegisterSize() {
717 return 128;
718}
719
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -0700720int X86Mir2Lir::NumReservableVectorRegisters(bool long_or_fp) {
721 int num_vector_temps = cu_->target64 ? xp_temps_64.size() : xp_temps_32.size();
722
723 // Leave a few temps for use by backend as scratch.
724 return long_or_fp ? num_vector_temps - 2 : num_vector_temps - 1;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700725}
726
David Srbecky1109fb32015-04-07 20:21:06 +0100727static dwarf::Reg DwarfCoreReg(bool is_x86_64, int num) {
728 return is_x86_64 ? dwarf::Reg::X86_64Core(num) : dwarf::Reg::X86Core(num);
729}
730
731static dwarf::Reg DwarfFpReg(bool is_x86_64, int num) {
732 return is_x86_64 ? dwarf::Reg::X86_64Fp(num) : dwarf::Reg::X86Fp(num);
733}
734
Brian Carlstrom7940e442013-07-12 13:46:57 -0700735void X86Mir2Lir::SpillCoreRegs() {
736 if (num_core_spills_ == 0) {
737 return;
738 }
739 // Spill mask not including fake return address register
buzbee091cc402014-03-31 10:14:40 -0700740 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
Ian Rogersb28c1c02014-11-08 11:21:21 -0800741 int offset =
742 frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
Serguei Katkovc3801912014-07-08 17:21:53 +0700743 OpSize size = cu_->target64 ? k64 : k32;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800744 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
David Srbecky1109fb32015-04-07 20:21:06 +0100745 for (int reg = 0; mask != 0u; mask >>= 1, reg++) {
746 if ((mask & 0x1) != 0u) {
747 RegStorage r_src = cu_->target64 ? RegStorage::Solo64(reg) : RegStorage::Solo32(reg);
748 StoreBaseDisp(rs_rSP, offset, r_src, size, kNotVolatile);
749 cfi_.RelOffset(DwarfCoreReg(cu_->target64, reg), offset);
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700750 offset += GetInstructionSetPointerSize(cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700751 }
752 }
753}
754
755void X86Mir2Lir::UnSpillCoreRegs() {
756 if (num_core_spills_ == 0) {
757 return;
758 }
759 // Spill mask not including fake return address register
buzbee091cc402014-03-31 10:14:40 -0700760 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700761 int offset = frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
Serguei Katkovc3801912014-07-08 17:21:53 +0700762 OpSize size = cu_->target64 ? k64 : k32;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800763 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
David Srbecky1109fb32015-04-07 20:21:06 +0100764 for (int reg = 0; mask != 0u; mask >>= 1, reg++) {
765 if ((mask & 0x1) != 0u) {
766 RegStorage r_dest = cu_->target64 ? RegStorage::Solo64(reg) : RegStorage::Solo32(reg);
767 LoadBaseDisp(rs_rSP, offset, r_dest, size, kNotVolatile);
768 cfi_.Restore(DwarfCoreReg(cu_->target64, reg));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700769 offset += GetInstructionSetPointerSize(cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700770 }
771 }
772}
773
Serguei Katkovc3801912014-07-08 17:21:53 +0700774void X86Mir2Lir::SpillFPRegs() {
775 if (num_fp_spills_ == 0) {
776 return;
777 }
778 uint32_t mask = fp_spill_mask_;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800779 int offset = frame_size_ -
780 (GetInstructionSetPointerSize(cu_->instruction_set) * (num_fp_spills_ + num_core_spills_));
781 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
David Srbecky1109fb32015-04-07 20:21:06 +0100782 for (int reg = 0; mask != 0u; mask >>= 1, reg++) {
783 if ((mask & 0x1) != 0u) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800784 StoreBaseDisp(rs_rSP, offset, RegStorage::FloatSolo64(reg), k64, kNotVolatile);
David Srbecky1109fb32015-04-07 20:21:06 +0100785 cfi_.RelOffset(DwarfFpReg(cu_->target64, reg), offset);
Serguei Katkovc3801912014-07-08 17:21:53 +0700786 offset += sizeof(double);
787 }
788 }
789}
790void X86Mir2Lir::UnSpillFPRegs() {
791 if (num_fp_spills_ == 0) {
792 return;
793 }
794 uint32_t mask = fp_spill_mask_;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800795 int offset = frame_size_ -
796 (GetInstructionSetPointerSize(cu_->instruction_set) * (num_fp_spills_ + num_core_spills_));
797 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
David Srbecky1109fb32015-04-07 20:21:06 +0100798 for (int reg = 0; mask != 0u; mask >>= 1, reg++) {
799 if ((mask & 0x1) != 0u) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800800 LoadBaseDisp(rs_rSP, offset, RegStorage::FloatSolo64(reg),
Serguei Katkovc3801912014-07-08 17:21:53 +0700801 k64, kNotVolatile);
David Srbecky1109fb32015-04-07 20:21:06 +0100802 cfi_.Restore(DwarfFpReg(cu_->target64, reg));
Serguei Katkovc3801912014-07-08 17:21:53 +0700803 offset += sizeof(double);
804 }
805 }
806}
807
808
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700809bool X86Mir2Lir::IsUnconditionalBranch(LIR* lir) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700810 return (lir->opcode == kX86Jmp8 || lir->opcode == kX86Jmp32);
811}
812
Vladimir Marko674744e2014-04-24 15:18:26 +0100813RegisterClass X86Mir2Lir::RegClassForFieldLoadStore(OpSize size, bool is_volatile) {
Mark Mendellca541342014-10-15 16:59:49 -0400814 // Prefer XMM registers. Fixes a problem with iget/iput to a FP when cached temporary
815 // with same VR is a Core register.
816 if (size == kSingle || size == kDouble) {
817 return kFPReg;
818 }
819
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700820 // X86_64 can handle any size.
Elena Sayapinadd644502014-07-01 18:39:52 +0700821 if (cu_->target64) {
Chao-ying Fu06839f82014-08-14 15:59:17 -0700822 return RegClassBySize(size);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700823 }
824
Vladimir Marko674744e2014-04-24 15:18:26 +0100825 if (UNLIKELY(is_volatile)) {
826 // On x86, atomic 64-bit load/store requires an fp register.
827 // Smaller aligned load/store is atomic for both core and fp registers.
828 if (size == k64 || size == kDouble) {
829 return kFPReg;
830 }
831 }
832 return RegClassBySize(size);
833}
834
Elena Sayapinadd644502014-07-01 18:39:52 +0700835X86Mir2Lir::X86Mir2Lir(CompilationUnit* cu, MIRGraph* mir_graph, ArenaAllocator* arena)
Mark Mendell55d0eac2014-02-06 11:02:52 -0800836 : Mir2Lir(cu, mir_graph, arena),
Serguei Katkov717a3e42014-11-13 17:19:42 +0600837 in_to_reg_storage_x86_64_mapper_(this), in_to_reg_storage_x86_mapper_(this),
Vladimir Marko1961b602015-04-08 20:51:48 +0100838 pc_rel_base_reg_(RegStorage::InvalidReg()),
839 pc_rel_base_reg_used_(false),
840 setup_pc_rel_base_reg_(nullptr),
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100841 method_address_insns_(arena->Adapter()),
842 class_type_address_insns_(arena->Adapter()),
843 call_method_insns_(arena->Adapter()),
Vladimir Markodc56cc52015-03-27 18:18:36 +0000844 dex_cache_access_insns_(arena->Adapter()),
Mark Mendelld65c51a2014-04-29 16:55:20 -0400845 const_vectors_(nullptr) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100846 method_address_insns_.reserve(100);
847 class_type_address_insns_.reserve(100);
848 call_method_insns_.reserve(100);
Vladimir Marko1961b602015-04-08 20:51:48 +0100849 for (int i = 0; i < kX86Last; i++) {
850 DCHECK_EQ(X86Mir2Lir::EncodingMap[i].opcode, i)
851 << "Encoding order for " << X86Mir2Lir::EncodingMap[i].name
852 << " is wrong: expecting " << i << ", seeing "
853 << static_cast<int>(X86Mir2Lir::EncodingMap[i].opcode);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700854 }
855}
856
857Mir2Lir* X86CodeGenerator(CompilationUnit* const cu, MIRGraph* const mir_graph,
858 ArenaAllocator* const arena) {
Elena Sayapinadd644502014-07-01 18:39:52 +0700859 return new X86Mir2Lir(cu, mir_graph, arena);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700860}
861
Andreas Gampe98430592014-07-27 19:44:50 -0700862// Not used in x86(-64)
863RegStorage X86Mir2Lir::LoadHelper(QuickEntrypointEnum trampoline) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700864 UNUSED(trampoline);
Andreas Gampe2f244e92014-05-08 03:35:25 -0700865 LOG(FATAL) << "Unexpected use of LoadHelper in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700866 UNREACHABLE();
Andreas Gampe2f244e92014-05-08 03:35:25 -0700867}
868
Dave Allisonb373e092014-02-20 16:06:36 -0800869LIR* X86Mir2Lir::CheckSuspendUsingLoad() {
Dave Allison69dfe512014-07-11 17:11:58 +0000870 // First load the pointer in fs:[suspend-trigger] into eax
871 // Then use a test instruction to indirect via that address.
Dave Allisondfd3b472014-07-16 16:04:32 -0700872 if (cu_->target64) {
873 NewLIR2(kX86Mov64RT, rs_rAX.GetReg(),
874 Thread::ThreadSuspendTriggerOffset<8>().Int32Value());
875 } else {
876 NewLIR2(kX86Mov32RT, rs_rAX.GetReg(),
877 Thread::ThreadSuspendTriggerOffset<4>().Int32Value());
878 }
Dave Allison69dfe512014-07-11 17:11:58 +0000879 return NewLIR3(kX86Test32RM, rs_rAX.GetReg(), rs_rAX.GetReg(), 0);
Dave Allisonb373e092014-02-20 16:06:36 -0800880}
881
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700882uint64_t X86Mir2Lir::GetTargetInstFlags(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700883 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700884 return X86Mir2Lir::EncodingMap[opcode].flags;
885}
886
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700887const char* X86Mir2Lir::GetTargetInstName(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700888 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700889 return X86Mir2Lir::EncodingMap[opcode].name;
890}
891
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700892const char* X86Mir2Lir::GetTargetInstFmt(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700893 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700894 return X86Mir2Lir::EncodingMap[opcode].fmt;
895}
896
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000897void X86Mir2Lir::GenConstWide(RegLocation rl_dest, int64_t value) {
898 // Can we do this directly to memory?
899 rl_dest = UpdateLocWide(rl_dest);
900 if ((rl_dest.location == kLocDalvikFrame) ||
901 (rl_dest.location == kLocCompilerTemp)) {
902 int32_t val_lo = Low32Bits(value);
903 int32_t val_hi = High32Bits(value);
Ian Rogersb28c1c02014-11-08 11:21:21 -0800904 int r_base = rs_rX86_SP_32.GetReg();
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000905 int displacement = SRegOffset(rl_dest.s_reg_low);
906
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100907 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
buzbee2700f7e2014-03-07 09:46:20 -0800908 LIR * store = NewLIR3(kX86Mov32MI, r_base, displacement + LOWORD_OFFSET, val_lo);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000909 AnnotateDalvikRegAccess(store, (displacement + LOWORD_OFFSET) >> 2,
910 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -0800911 store = NewLIR3(kX86Mov32MI, r_base, displacement + HIWORD_OFFSET, val_hi);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000912 AnnotateDalvikRegAccess(store, (displacement + HIWORD_OFFSET) >> 2,
913 false /* is_load */, true /* is64bit */);
914 return;
915 }
916
917 // Just use the standard code to do the generation.
918 Mir2Lir::GenConstWide(rl_dest, value);
919}
Mark Mendelle02d48f2014-01-15 11:19:23 -0800920
921// TODO: Merge with existing RegLocation dumper in vreg_analysis.cc
922void X86Mir2Lir::DumpRegLocation(RegLocation loc) {
923 LOG(INFO) << "location: " << loc.location << ','
924 << (loc.wide ? " w" : " ")
925 << (loc.defined ? " D" : " ")
926 << (loc.is_const ? " c" : " ")
927 << (loc.fp ? " F" : " ")
928 << (loc.core ? " C" : " ")
929 << (loc.ref ? " r" : " ")
930 << (loc.high_word ? " h" : " ")
931 << (loc.home ? " H" : " ")
buzbee2700f7e2014-03-07 09:46:20 -0800932 << ", low: " << static_cast<int>(loc.reg.GetLowReg())
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000933 << ", high: " << static_cast<int>(loc.reg.GetHighReg())
Mark Mendelle02d48f2014-01-15 11:19:23 -0800934 << ", s_reg: " << loc.s_reg_low
935 << ", orig: " << loc.orig_sreg;
936}
937
Jeff Hao49161ce2014-03-12 11:05:25 -0700938void X86Mir2Lir::LoadMethodAddress(const MethodReference& target_method, InvokeType type,
Mark Mendell55d0eac2014-02-06 11:02:52 -0800939 SpecialTargetRegister symbolic_reg) {
940 /*
941 * For x86, just generate a 32 bit move immediate instruction, that will be filled
942 * in at 'link time'. For now, put a unique value based on target to ensure that
943 * code deduplication works.
944 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700945 int target_method_idx = target_method.dex_method_index;
946 const DexFile* target_dex_file = target_method.dex_file;
947 const DexFile::MethodId& target_method_id = target_dex_file->GetMethodId(target_method_idx);
948 uintptr_t target_method_id_ptr = reinterpret_cast<uintptr_t>(&target_method_id);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800949
Jeff Hao49161ce2014-03-12 11:05:25 -0700950 // Generate the move instruction with the unique pointer and save index, dex_file, and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700951 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
952 TargetReg(symbolic_reg, kNotWide).GetReg(),
Jeff Hao49161ce2014-03-12 11:05:25 -0700953 static_cast<int>(target_method_id_ptr), target_method_idx,
954 WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800955 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100956 method_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800957}
958
Fred Shihe7f82e22014-08-06 10:46:37 -0700959void X86Mir2Lir::LoadClassType(const DexFile& dex_file, uint32_t type_idx,
960 SpecialTargetRegister symbolic_reg) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800961 /*
962 * For x86, just generate a 32 bit move immediate instruction, that will be filled
963 * in at 'link time'. For now, put a unique value based on target to ensure that
964 * code deduplication works.
965 */
Fred Shihe7f82e22014-08-06 10:46:37 -0700966 const DexFile::TypeId& id = dex_file.GetTypeId(type_idx);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800967 uintptr_t ptr = reinterpret_cast<uintptr_t>(&id);
968
969 // Generate the move instruction with the unique pointer and save index and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700970 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
971 TargetReg(symbolic_reg, kNotWide).GetReg(),
Fred Shihe7f82e22014-08-06 10:46:37 -0700972 static_cast<int>(ptr), type_idx,
973 WrapPointer(const_cast<DexFile*>(&dex_file)));
Mark Mendell55d0eac2014-02-06 11:02:52 -0800974 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100975 class_type_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800976}
977
Vladimir Markof4da6752014-08-01 19:04:18 +0100978LIR* X86Mir2Lir::CallWithLinkerFixup(const MethodReference& target_method, InvokeType type) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800979 /*
980 * For x86, just generate a 32 bit call relative instruction, that will be filled
Vladimir Markof4da6752014-08-01 19:04:18 +0100981 * in at 'link time'.
Mark Mendell55d0eac2014-02-06 11:02:52 -0800982 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700983 int target_method_idx = target_method.dex_method_index;
984 const DexFile* target_dex_file = target_method.dex_file;
Mark Mendell55d0eac2014-02-06 11:02:52 -0800985
Jeff Hao49161ce2014-03-12 11:05:25 -0700986 // Generate the call instruction with the unique pointer and save index, dex_file, and type.
Vladimir Markof4da6752014-08-01 19:04:18 +0100987 // NOTE: Method deduplication takes linker patches into account, so we can just pass 0
988 // as a placeholder for the offset.
989 LIR* call = RawLIR(current_dalvik_offset_, kX86CallI, 0,
Jeff Hao49161ce2014-03-12 11:05:25 -0700990 target_method_idx, WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800991 AppendLIR(call);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100992 call_method_insns_.push_back(call);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800993 return call;
994}
995
Vladimir Markof4da6752014-08-01 19:04:18 +0100996static LIR* GenInvokeNoInlineCall(Mir2Lir* mir_to_lir, InvokeType type) {
997 QuickEntrypointEnum trampoline;
998 switch (type) {
999 case kInterface:
1000 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
1001 break;
1002 case kDirect:
1003 trampoline = kQuickInvokeDirectTrampolineWithAccessCheck;
1004 break;
1005 case kStatic:
1006 trampoline = kQuickInvokeStaticTrampolineWithAccessCheck;
1007 break;
1008 case kSuper:
1009 trampoline = kQuickInvokeSuperTrampolineWithAccessCheck;
1010 break;
1011 case kVirtual:
1012 trampoline = kQuickInvokeVirtualTrampolineWithAccessCheck;
1013 break;
1014 default:
1015 LOG(FATAL) << "Unexpected invoke type";
1016 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
1017 }
1018 return mir_to_lir->InvokeTrampoline(kOpBlx, RegStorage::InvalidReg(), trampoline);
1019}
1020
1021LIR* X86Mir2Lir::GenCallInsn(const MirMethodLoweringInfo& method_info) {
1022 LIR* call_insn;
1023 if (method_info.FastPath()) {
1024 if (method_info.DirectCode() == static_cast<uintptr_t>(-1)) {
1025 // We can have the linker fixup a call relative.
1026 call_insn = CallWithLinkerFixup(method_info.GetTargetMethod(), method_info.GetSharpType());
1027 } else {
1028 call_insn = OpMem(kOpBlx, TargetReg(kArg0, kRef),
Mathieu Chartier2d721012014-11-10 11:08:06 -08001029 mirror::ArtMethod::EntryPointFromQuickCompiledCodeOffset(
1030 cu_->target64 ? 8 : 4).Int32Value());
Vladimir Markof4da6752014-08-01 19:04:18 +01001031 }
1032 } else {
1033 call_insn = GenInvokeNoInlineCall(this, method_info.GetSharpType());
1034 }
1035 return call_insn;
1036}
1037
Mark Mendell55d0eac2014-02-06 11:02:52 -08001038void X86Mir2Lir::InstallLiteralPools() {
1039 // These are handled differently for x86.
1040 DCHECK(code_literal_list_ == nullptr);
1041 DCHECK(method_literal_list_ == nullptr);
1042 DCHECK(class_literal_list_ == nullptr);
1043
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001044
Mark Mendelld65c51a2014-04-29 16:55:20 -04001045 if (const_vectors_ != nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001046 // Vector literals must be 16-byte aligned. The header that is placed
1047 // in the code section causes misalignment so we take it into account.
1048 // Otherwise, we are sure that for x86 method is aligned to 16.
1049 DCHECK_EQ(GetInstructionSetAlignment(cu_->instruction_set), 16u);
1050 uint32_t bytes_to_fill = (0x10 - ((code_buffer_.size() + sizeof(OatQuickMethodHeader)) & 0xF)) & 0xF;
1051 while (bytes_to_fill > 0) {
1052 code_buffer_.push_back(0);
1053 bytes_to_fill--;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001054 }
1055
Mark Mendelld65c51a2014-04-29 16:55:20 -04001056 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Vladimir Marko80b96d12015-02-19 15:50:28 +00001057 Push32(&code_buffer_, p->operands[0]);
1058 Push32(&code_buffer_, p->operands[1]);
1059 Push32(&code_buffer_, p->operands[2]);
1060 Push32(&code_buffer_, p->operands[3]);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001061 }
1062 }
1063
Vladimir Markodc56cc52015-03-27 18:18:36 +00001064 patches_.reserve(method_address_insns_.size() + class_type_address_insns_.size() +
1065 call_method_insns_.size() + dex_cache_access_insns_.size());
1066
Mark Mendell55d0eac2014-02-06 11:02:52 -08001067 // Handle the fixups for methods.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001068 for (LIR* p : method_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001069 DCHECK_EQ(p->opcode, kX86Mov32RI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001070 uint32_t target_method_idx = p->operands[2];
Vladimir Markof6737f72015-03-23 17:05:14 +00001071 const DexFile* target_dex_file = UnwrapPointer<DexFile>(p->operands[3]);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001072
1073 // The offset to patch is the last 4 bytes of the instruction.
1074 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001075 patches_.push_back(LinkerPatch::MethodPatch(patch_offset,
1076 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001077 }
1078
1079 // Handle the fixups for class types.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001080 for (LIR* p : class_type_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001081 DCHECK_EQ(p->opcode, kX86Mov32RI);
Fred Shihe7f82e22014-08-06 10:46:37 -07001082
Vladimir Markof6737f72015-03-23 17:05:14 +00001083 const DexFile* class_dex_file = UnwrapPointer<DexFile>(p->operands[3]);
Vladimir Markof4da6752014-08-01 19:04:18 +01001084 uint32_t target_type_idx = p->operands[2];
Mark Mendell55d0eac2014-02-06 11:02:52 -08001085
1086 // The offset to patch is the last 4 bytes of the instruction.
1087 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001088 patches_.push_back(LinkerPatch::TypePatch(patch_offset,
1089 class_dex_file, target_type_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001090 }
1091
1092 // And now the PC-relative calls to methods.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001093 for (LIR* p : call_method_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001094 DCHECK_EQ(p->opcode, kX86CallI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001095 uint32_t target_method_idx = p->operands[1];
Vladimir Markof6737f72015-03-23 17:05:14 +00001096 const DexFile* target_dex_file = UnwrapPointer<DexFile>(p->operands[2]);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001097
1098 // The offset to patch is the last 4 bytes of the instruction.
1099 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001100 patches_.push_back(LinkerPatch::RelativeCodePatch(patch_offset,
1101 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001102 }
1103
Vladimir Markodc56cc52015-03-27 18:18:36 +00001104 // PC-relative references to dex cache arrays.
1105 for (LIR* p : dex_cache_access_insns_) {
1106 DCHECK(p->opcode == kX86Mov32RM);
1107 const DexFile* dex_file = UnwrapPointer<DexFile>(p->operands[3]);
1108 uint32_t offset = p->operands[4];
1109 // The offset to patch is the last 4 bytes of the instruction.
1110 int patch_offset = p->offset + p->flags.size - 4;
1111 DCHECK(!p->flags.is_nop);
Vladimir Marko1961b602015-04-08 20:51:48 +01001112 patches_.push_back(LinkerPatch::DexCacheArrayPatch(patch_offset, dex_file,
1113 p->target->offset, offset));
Vladimir Markodc56cc52015-03-27 18:18:36 +00001114 }
1115
Mark Mendell55d0eac2014-02-06 11:02:52 -08001116 // And do the normal processing.
1117 Mir2Lir::InstallLiteralPools();
1118}
1119
DaniilSokolov70c4f062014-06-24 17:34:00 -07001120bool X86Mir2Lir::GenInlinedArrayCopyCharArray(CallInfo* info) {
DaniilSokolov70c4f062014-06-24 17:34:00 -07001121 RegLocation rl_src = info->args[0];
1122 RegLocation rl_srcPos = info->args[1];
1123 RegLocation rl_dst = info->args[2];
1124 RegLocation rl_dstPos = info->args[3];
1125 RegLocation rl_length = info->args[4];
1126 if (rl_srcPos.is_const && (mir_graph_->ConstantValue(rl_srcPos) < 0)) {
1127 return false;
1128 }
1129 if (rl_dstPos.is_const && (mir_graph_->ConstantValue(rl_dstPos) < 0)) {
1130 return false;
1131 }
1132 ClobberCallerSave();
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001133 LockCallTemps(); // Using fixed registers.
1134 RegStorage tmp_reg = cu_->target64 ? rs_r11 : rs_rBX;
1135 LoadValueDirectFixed(rl_src, rs_rAX);
1136 LoadValueDirectFixed(rl_dst, rs_rCX);
1137 LIR* src_dst_same = OpCmpBranch(kCondEq, rs_rAX, rs_rCX, nullptr);
1138 LIR* src_null_branch = OpCmpImmBranch(kCondEq, rs_rAX, 0, nullptr);
1139 LIR* dst_null_branch = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1140 LoadValueDirectFixed(rl_length, rs_rDX);
1141 // If the length of the copy is > 128 characters (256 bytes) or negative then go slow path.
1142 LIR* len_too_big = OpCmpImmBranch(kCondHi, rs_rDX, 128, nullptr);
1143 LoadValueDirectFixed(rl_src, rs_rAX);
1144 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001145 LIR* src_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001146 LIR* src_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001147 LIR* srcPos_negative = nullptr;
1148 if (!rl_srcPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001149 LoadValueDirectFixed(rl_srcPos, tmp_reg);
1150 srcPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001151 // src_pos < src_len
1152 src_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1153 // src_len - src_pos < copy_len
1154 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1155 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001156 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001157 int32_t pos_val = mir_graph_->ConstantValue(rl_srcPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001158 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001159 src_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001160 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001161 // src_pos < src_len
1162 src_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1163 // src_len - src_pos < copy_len
1164 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1165 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001166 }
1167 }
1168 LIR* dstPos_negative = nullptr;
1169 LIR* dst_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001170 LIR* dst_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001171 LoadValueDirectFixed(rl_dst, rs_rAX);
1172 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
1173 if (!rl_dstPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001174 LoadValueDirectFixed(rl_dstPos, tmp_reg);
1175 dstPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001176 // dst_pos < dst_len
1177 dst_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1178 // dst_len - dst_pos < copy_len
1179 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1180 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001181 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001182 int32_t pos_val = mir_graph_->ConstantValue(rl_dstPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001183 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001184 dst_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001185 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001186 // dst_pos < dst_len
1187 dst_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1188 // dst_len - dst_pos < copy_len
1189 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1190 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001191 }
1192 }
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001193 // Everything is checked now.
1194 LoadValueDirectFixed(rl_src, rs_rAX);
1195 LoadValueDirectFixed(rl_dst, tmp_reg);
1196 LoadValueDirectFixed(rl_srcPos, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001197 NewLIR5(kX86Lea32RA, rs_rAX.GetReg(), rs_rAX.GetReg(),
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001198 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value());
1199 // RAX now holds the address of the first src element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001200
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001201 LoadValueDirectFixed(rl_dstPos, rs_rCX);
1202 NewLIR5(kX86Lea32RA, tmp_reg.GetReg(), tmp_reg.GetReg(),
1203 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value() );
1204 // RBX now holds the address of the first dst element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001205
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001206 // Check if the number of elements to be copied is odd or even. If odd
DaniilSokolov70c4f062014-06-24 17:34:00 -07001207 // then copy the first element (so that the remaining number of elements
1208 // is even).
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001209 LoadValueDirectFixed(rl_length, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001210 OpRegImm(kOpAnd, rs_rCX, 1);
1211 LIR* jmp_to_begin_loop = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1212 OpRegImm(kOpSub, rs_rDX, 1);
1213 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001214 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001215
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001216 // Since the remaining number of elements is even, we will copy by
DaniilSokolov70c4f062014-06-24 17:34:00 -07001217 // two elements at a time.
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001218 LIR* beginLoop = NewLIR0(kPseudoTargetLabel);
1219 LIR* jmp_to_ret = OpCmpImmBranch(kCondEq, rs_rDX, 0, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001220 OpRegImm(kOpSub, rs_rDX, 2);
1221 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001222 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001223 OpUnconditionalBranch(beginLoop);
1224 LIR *check_failed = NewLIR0(kPseudoTargetLabel);
1225 LIR* launchpad_branch = OpUnconditionalBranch(nullptr);
1226 LIR *return_point = NewLIR0(kPseudoTargetLabel);
1227 jmp_to_ret->target = return_point;
1228 jmp_to_begin_loop->target = beginLoop;
1229 src_dst_same->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001230 len_too_big->target = check_failed;
1231 src_null_branch->target = check_failed;
1232 if (srcPos_negative != nullptr)
1233 srcPos_negative ->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001234 if (src_bad_off != nullptr)
1235 src_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001236 if (src_bad_len != nullptr)
1237 src_bad_len->target = check_failed;
1238 dst_null_branch->target = check_failed;
1239 if (dstPos_negative != nullptr)
1240 dstPos_negative->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001241 if (dst_bad_off != nullptr)
1242 dst_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001243 if (dst_bad_len != nullptr)
1244 dst_bad_len->target = check_failed;
1245 AddIntrinsicSlowPath(info, launchpad_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001246 ClobberCallerSave(); // We must clobber everything because slow path will return here
DaniilSokolov70c4f062014-06-24 17:34:00 -07001247 return true;
1248}
1249
1250
Mark Mendell4028a6c2014-02-19 20:06:20 -08001251/*
1252 * Fast string.index_of(I) & (II). Inline check for simple case of char <= 0xffff,
1253 * otherwise bails to standard library code.
1254 */
1255bool X86Mir2Lir::GenInlinedIndexOf(CallInfo* info, bool zero_based) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001256 RegLocation rl_obj = info->args[0];
1257 RegLocation rl_char = info->args[1];
buzbeea44d4f52014-03-05 11:26:39 -08001258 RegLocation rl_start; // Note: only present in III flavor or IndexOf.
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001259 // RBX is promotable in 64-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001260 RegStorage rs_tmp = cu_->target64 ? rs_r11 : rs_rBX;
1261 int start_value = -1;
Mark Mendell4028a6c2014-02-19 20:06:20 -08001262
1263 uint32_t char_value =
1264 rl_char.is_const ? mir_graph_->ConstantValue(rl_char.orig_sreg) : 0;
1265
1266 if (char_value > 0xFFFF) {
1267 // We have to punt to the real String.indexOf.
1268 return false;
1269 }
1270
1271 // Okay, we are commited to inlining this.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001272 // EAX: 16 bit character being searched.
1273 // ECX: count: number of words to be searched.
1274 // EDI: String being searched.
1275 // EDX: temporary during execution.
1276 // EBX or R11: temporary during execution (depending on mode).
1277 // REP SCASW: search instruction.
1278
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001279 FlushAllRegs();
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001280
buzbeea0cd2d72014-06-01 09:33:49 -07001281 RegLocation rl_return = GetReturn(kCoreReg);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001282 RegLocation rl_dest = InlineTarget(info);
1283
Mathieu Chartier2cebb242015-04-21 16:50:40 -07001284 // Is the string non-null?
buzbee2700f7e2014-03-07 09:46:20 -08001285 LoadValueDirectFixed(rl_obj, rs_rDX);
1286 GenNullCheck(rs_rDX, info->opt_flags);
Vladimir Marko3bc86152014-03-13 14:11:28 +00001287 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've null checked.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001288
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001289 LIR *slowpath_branch = nullptr, *length_compare = nullptr;
1290
1291 // We need the value in EAX.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001292 if (rl_char.is_const) {
buzbee2700f7e2014-03-07 09:46:20 -08001293 LoadConstantNoClobber(rs_rAX, char_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001294 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001295 // Does the character fit in 16 bits? Compare it at runtime.
buzbee2700f7e2014-03-07 09:46:20 -08001296 LoadValueDirectFixed(rl_char, rs_rAX);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001297 slowpath_branch = OpCmpImmBranch(kCondGt, rs_rAX, 0xFFFF, nullptr);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001298 }
1299
1300 // From here down, we know that we are looking for a char that fits in 16 bits.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001301 // Location of reference to data array within the String object.
1302 int value_offset = mirror::String::ValueOffset().Int32Value();
1303 // Location of count within the String object.
1304 int count_offset = mirror::String::CountOffset().Int32Value();
Mark Mendell4028a6c2014-02-19 20:06:20 -08001305
Dave Allison69dfe512014-07-11 17:11:58 +00001306 // Compute the number of words to search in to rCX.
1307 Load32Disp(rs_rDX, count_offset, rs_rCX);
1308
Dave Allisondfd3b472014-07-16 16:04:32 -07001309 // Possible signal here due to null pointer dereference.
1310 // Note that the signal handler will expect the top word of
1311 // the stack to be the ArtMethod*. If the PUSH edi instruction
1312 // below is ahead of the load above then this will not be true
1313 // and the signal handler will not work.
1314 MarkPossibleNullPointerException(0);
Dave Allison69dfe512014-07-11 17:11:58 +00001315
Dave Allisondfd3b472014-07-16 16:04:32 -07001316 if (!cu_->target64) {
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001317 // EDI is promotable in 32-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001318 NewLIR1(kX86Push32R, rs_rDI.GetReg());
David Srbecky1109fb32015-04-07 20:21:06 +01001319 cfi_.AdjustCFAOffset(4);
1320 // Record cfi only if it is not already spilled.
1321 if (!CoreSpillMaskContains(rs_rDI.GetReg())) {
1322 cfi_.RelOffset(DwarfCoreReg(cu_->target64, rs_rDI.GetReg()), 0);
1323 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001324 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001325
Mark Mendell4028a6c2014-02-19 20:06:20 -08001326 if (zero_based) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001327 // Start index is not present.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001328 // We have to handle an empty string. Use special instruction JECXZ.
1329 length_compare = NewLIR0(kX86Jecxz8);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001330
1331 // Copy the number of words to search in a temporary register.
1332 // We will use the register at the end to calculate result.
1333 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001334 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001335 // Start index is present.
buzbeea44d4f52014-03-05 11:26:39 -08001336 rl_start = info->args[2];
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001337
Mark Mendell4028a6c2014-02-19 20:06:20 -08001338 // We have to offset by the start index.
1339 if (rl_start.is_const) {
1340 start_value = mir_graph_->ConstantValue(rl_start.orig_sreg);
1341 start_value = std::max(start_value, 0);
1342
1343 // Is the start > count?
buzbee2700f7e2014-03-07 09:46:20 -08001344 length_compare = OpCmpImmBranch(kCondLe, rs_rCX, start_value, nullptr);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001345 OpRegImm(kOpMov, rs_rDI, start_value);
1346
1347 // Copy the number of words to search in a temporary register.
1348 // We will use the register at the end to calculate result.
1349 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001350
1351 if (start_value != 0) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001352 // Decrease the number of words to search by the start index.
buzbee2700f7e2014-03-07 09:46:20 -08001353 OpRegImm(kOpSub, rs_rCX, start_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001354 }
1355 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001356 // Handle "start index < 0" case.
1357 if (!cu_->target64 && rl_start.location != kLocPhysReg) {
Alexei Zavjalova1758d82014-04-17 01:55:43 +07001358 // Load the start index from stack, remembering that we pushed EDI.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001359 int displacement = SRegOffset(rl_start.s_reg_low) + sizeof(uint32_t);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001360 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001361 Load32Disp(rs_rX86_SP_32, displacement, rs_rDI);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001362 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1363 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1364 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - 1;
1365 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001366 } else {
1367 LoadValueDirectFixed(rl_start, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001368 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001369 OpRegReg(kOpXor, rs_tmp, rs_tmp);
1370 OpRegReg(kOpCmp, rs_rDI, rs_tmp);
1371 OpCondRegReg(kOpCmov, kCondLt, rs_rDI, rs_tmp);
1372
1373 // The length of the string should be greater than the start index.
1374 length_compare = OpCmpBranch(kCondLe, rs_rCX, rs_rDI, nullptr);
1375
1376 // Copy the number of words to search in a temporary register.
1377 // We will use the register at the end to calculate result.
1378 OpRegReg(kOpMov, rs_tmp, rs_rCX);
1379
1380 // Decrease the number of words to search by the start index.
1381 OpRegReg(kOpSub, rs_rCX, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001382 }
1383 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001384
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001385 // Load the address of the string into EDI.
1386 // In case of start index we have to add the address to existing value in EDI.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001387 if (zero_based || (!zero_based && rl_start.is_const && start_value == 0)) {
Jeff Hao848f70a2014-01-15 13:49:50 -08001388 OpRegRegImm(kOpAdd, rs_rDI, rs_rDX, value_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001389 } else {
Jeff Hao848f70a2014-01-15 13:49:50 -08001390 OpRegImm(kOpLsl, rs_rDI, 1);
1391 OpRegReg(kOpAdd, rs_rDI, rs_rDX);
1392 OpRegImm(kOpAdd, rs_rDI, value_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001393 }
1394
1395 // EDI now contains the start of the string to be searched.
1396 // We are all prepared to do the search for the character.
1397 NewLIR0(kX86RepneScasw);
1398
1399 // Did we find a match?
1400 LIR* failed_branch = OpCondBranch(kCondNe, nullptr);
1401
1402 // yes, we matched. Compute the index of the result.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001403 OpRegReg(kOpSub, rs_tmp, rs_rCX);
1404 NewLIR3(kX86Lea32RM, rl_return.reg.GetReg(), rs_tmp.GetReg(), -1);
1405
Mark Mendell4028a6c2014-02-19 20:06:20 -08001406 LIR *all_done = NewLIR1(kX86Jmp8, 0);
1407
1408 // Failed to match; return -1.
1409 LIR *not_found = NewLIR0(kPseudoTargetLabel);
1410 length_compare->target = not_found;
1411 failed_branch->target = not_found;
buzbee2700f7e2014-03-07 09:46:20 -08001412 LoadConstantNoClobber(rl_return.reg, -1);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001413
1414 // And join up at the end.
1415 all_done->target = NewLIR0(kPseudoTargetLabel);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001416
David Srbecky1109fb32015-04-07 20:21:06 +01001417 if (!cu_->target64) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001418 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
David Srbecky1109fb32015-04-07 20:21:06 +01001419 cfi_.AdjustCFAOffset(-4);
1420 if (!CoreSpillMaskContains(rs_rDI.GetReg())) {
1421 cfi_.Restore(DwarfCoreReg(cu_->target64, rs_rDI.GetReg()));
1422 }
1423 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001424
1425 // Out of line code returns here.
Mingyao Yang3a74d152014-04-21 15:39:44 -07001426 if (slowpath_branch != nullptr) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001427 LIR *return_point = NewLIR0(kPseudoTargetLabel);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001428 AddIntrinsicSlowPath(info, slowpath_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001429 ClobberCallerSave(); // We must clobber everything because slow path will return here
Mark Mendell4028a6c2014-02-19 20:06:20 -08001430 }
1431
1432 StoreValue(rl_dest, rl_return);
1433 return true;
1434}
1435
Mark Mendelld65c51a2014-04-29 16:55:20 -04001436void X86Mir2Lir::GenMachineSpecificExtendedMethodMIR(BasicBlock* bb, MIR* mir) {
1437 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001438 case kMirOpReserveVectorRegisters:
1439 ReserveVectorRegisters(mir);
1440 break;
1441 case kMirOpReturnVectorRegisters:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001442 ReturnVectorRegisters(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001443 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001444 case kMirOpConstVector:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001445 GenConst128(mir);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001446 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001447 case kMirOpMoveVector:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001448 GenMoveVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001449 break;
1450 case kMirOpPackedMultiply:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001451 GenMultiplyVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001452 break;
1453 case kMirOpPackedAddition:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001454 GenAddVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001455 break;
1456 case kMirOpPackedSubtract:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001457 GenSubtractVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001458 break;
1459 case kMirOpPackedShiftLeft:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001460 GenShiftLeftVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001461 break;
1462 case kMirOpPackedSignedShiftRight:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001463 GenSignedShiftRightVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001464 break;
1465 case kMirOpPackedUnsignedShiftRight:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001466 GenUnsignedShiftRightVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001467 break;
1468 case kMirOpPackedAnd:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001469 GenAndVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001470 break;
1471 case kMirOpPackedOr:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001472 GenOrVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001473 break;
1474 case kMirOpPackedXor:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001475 GenXorVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001476 break;
1477 case kMirOpPackedAddReduce:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001478 GenAddReduceVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001479 break;
1480 case kMirOpPackedReduce:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001481 GenReduceVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001482 break;
1483 case kMirOpPackedSet:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001484 GenSetVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001485 break;
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07001486 case kMirOpMemBarrier:
1487 GenMemBarrier(static_cast<MemBarrierKind>(mir->dalvikInsn.vA));
1488 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001489 case kMirOpPackedArrayGet:
1490 GenPackedArrayGet(bb, mir);
1491 break;
1492 case kMirOpPackedArrayPut:
1493 GenPackedArrayPut(bb, mir);
1494 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001495 default:
1496 break;
1497 }
1498}
1499
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001500void X86Mir2Lir::ReserveVectorRegisters(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001501 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001502 RegStorage xp_reg = RegStorage::Solo128(i);
1503 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1504 Clobber(xp_reg);
1505
1506 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1507 info != nullptr;
1508 info = info->GetAliasChain()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001509 ArenaVector<RegisterInfo*>* regs =
1510 info->GetReg().IsSingle() ? &reg_pool_->sp_regs_ : &reg_pool_->dp_regs_;
1511 auto it = std::find(regs->begin(), regs->end(), info);
1512 DCHECK(it != regs->end());
1513 regs->erase(it);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001514 }
1515 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001516}
1517
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001518void X86Mir2Lir::ReturnVectorRegisters(MIR* mir) {
1519 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001520 RegStorage xp_reg = RegStorage::Solo128(i);
1521 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1522
1523 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1524 info != nullptr;
1525 info = info->GetAliasChain()) {
1526 if (info->GetReg().IsSingle()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001527 reg_pool_->sp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001528 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001529 reg_pool_->dp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001530 }
1531 }
1532 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001533}
1534
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001535void X86Mir2Lir::GenConst128(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001536 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001537 Clobber(rs_dest);
1538
Mark Mendelld65c51a2014-04-29 16:55:20 -04001539 uint32_t *args = mir->dalvikInsn.arg;
Mark Mendellfe945782014-05-22 09:52:36 -04001540 int reg = rs_dest.GetReg();
Mark Mendelld65c51a2014-04-29 16:55:20 -04001541 // Check for all 0 case.
1542 if (args[0] == 0 && args[1] == 0 && args[2] == 0 && args[3] == 0) {
1543 NewLIR2(kX86XorpsRR, reg, reg);
1544 return;
1545 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001546
1547 // Append the mov const vector to reg opcode.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001548 AppendOpcodeWithConst(kX86MovdqaRM, reg, mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001549}
1550
1551void X86Mir2Lir::AppendOpcodeWithConst(X86OpCode opcode, int reg, MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001552 // To deal with correct memory ordering, reverse order of constants.
1553 int32_t constants[4];
1554 constants[3] = mir->dalvikInsn.arg[0];
1555 constants[2] = mir->dalvikInsn.arg[1];
1556 constants[1] = mir->dalvikInsn.arg[2];
1557 constants[0] = mir->dalvikInsn.arg[3];
1558
1559 // Search if there is already a constant in pool with this value.
1560 LIR *data_target = ScanVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001561 if (data_target == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001562 data_target = AddVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001563 }
1564
Mark Mendelld65c51a2014-04-29 16:55:20 -04001565 // Load the proper value from the literal area.
1566 // We don't know the proper offset for the value, so pick one that will force
Mark Mendell27dee8b2014-12-01 19:06:12 -05001567 // 4 byte offset. We will fix this up in the assembler later to have the
1568 // right value.
1569 LIR* load;
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001570 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
Mark Mendell27dee8b2014-12-01 19:06:12 -05001571 if (cu_->target64) {
Vladimir Marko1961b602015-04-08 20:51:48 +01001572 load = NewLIR3(opcode, reg, kRIPReg, kDummy32BitOffset);
Mark Mendell27dee8b2014-12-01 19:06:12 -05001573 } else {
Vladimir Marko1961b602015-04-08 20:51:48 +01001574 // Get the PC to a register and get the anchor.
1575 LIR* anchor;
1576 RegStorage r_pc = GetPcAndAnchor(&anchor);
1577
1578 load = NewLIR3(opcode, reg, r_pc.GetReg(), kDummy32BitOffset);
1579 load->operands[4] = WrapPointer(anchor);
1580 if (IsTemp(r_pc)) {
1581 FreeTemp(r_pc);
Mark Mendell27dee8b2014-12-01 19:06:12 -05001582 }
Mark Mendell27dee8b2014-12-01 19:06:12 -05001583 }
Mark Mendelld65c51a2014-04-29 16:55:20 -04001584 load->flags.fixup = kFixupLoad;
1585 load->target = data_target;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001586}
1587
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001588void X86Mir2Lir::GenMoveVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001589 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001590 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1591 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001592 Clobber(rs_dest);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001593 RegStorage rs_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001594 NewLIR2(kX86MovdqaRR, rs_dest.GetReg(), rs_src.GetReg());
Mark Mendellfe945782014-05-22 09:52:36 -04001595}
1596
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001597void X86Mir2Lir::GenMultiplyVectorSignedByte(RegStorage rs_dest_src1, RegStorage rs_src2) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001598 /*
1599 * Emulate the behavior of a kSignedByte by separating out the 16 values in the two XMM
1600 * and multiplying 8 at a time before recombining back into one XMM register.
1601 *
1602 * let xmm1, xmm2 be real srcs (keep low bits of 16bit lanes)
1603 * xmm3 is tmp (operate on high bits of 16bit lanes)
1604 *
1605 * xmm3 = xmm1
1606 * xmm1 = xmm1 .* xmm2
1607 * xmm1 = xmm1 & 0x00ff00ff00ff00ff00ff00ff00ff00ff // xmm1 now has low bits
1608 * xmm3 = xmm3 .>> 8
1609 * xmm2 = xmm2 & 0xff00ff00ff00ff00ff00ff00ff00ff00
1610 * xmm2 = xmm2 .* xmm3 // xmm2 now has high bits
1611 * xmm1 = xmm1 | xmm2 // combine results
1612 */
1613
1614 // Copy xmm1.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001615 RegStorage rs_src1_high_tmp = Get128BitRegister(AllocTempDouble());
1616 RegStorage rs_dest_high_tmp = Get128BitRegister(AllocTempDouble());
1617 NewLIR2(kX86MovdqaRR, rs_src1_high_tmp.GetReg(), rs_src2.GetReg());
1618 NewLIR2(kX86MovdqaRR, rs_dest_high_tmp.GetReg(), rs_dest_src1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001619
1620 // Multiply low bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001621 // x7 *= x3
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001622 NewLIR2(kX86PmullwRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1623
1624 // xmm1 now has low bits.
1625 AndMaskVectorRegister(rs_dest_src1, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF);
1626
1627 // Prepare high bits for multiplication.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001628 NewLIR2(kX86PsrlwRI, rs_src1_high_tmp.GetReg(), 0x8);
1629 AndMaskVectorRegister(rs_dest_high_tmp, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001630
1631 // Multiply high bits and xmm2 now has high bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001632 NewLIR2(kX86PmullwRR, rs_src1_high_tmp.GetReg(), rs_dest_high_tmp.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001633
1634 // Combine back into dest XMM register.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001635 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src1_high_tmp.GetReg());
1636}
1637
1638void X86Mir2Lir::GenMultiplyVectorLong(RegStorage rs_dest_src1, RegStorage rs_src2) {
1639 /*
1640 * We need to emulate the packed long multiply.
1641 * For kMirOpPackedMultiply xmm1, xmm0:
1642 * - xmm1 is src/dest
1643 * - xmm0 is src
1644 * - Get xmm2 and xmm3 as temp
1645 * - Idea is to multiply the lower 32 of each operand with the higher 32 of the other.
1646 * - Then add the two results.
1647 * - Move it to the upper 32 of the destination
1648 * - Then multiply the lower 32-bits of the operands and add the result to the destination.
1649 *
1650 * (op dest src )
1651 * movdqa %xmm2, %xmm1
1652 * movdqa %xmm3, %xmm0
1653 * psrlq %xmm3, $0x20
1654 * pmuludq %xmm3, %xmm2
1655 * psrlq %xmm1, $0x20
1656 * pmuludq %xmm1, %xmm0
1657 * paddq %xmm1, %xmm3
1658 * psllq %xmm1, $0x20
1659 * pmuludq %xmm2, %xmm0
1660 * paddq %xmm1, %xmm2
1661 *
1662 * When both the operands are the same, then we need to calculate the lower-32 * higher-32
1663 * calculation only once. Thus we don't need the xmm3 temp above. That sequence becomes:
1664 *
1665 * (op dest src )
1666 * movdqa %xmm2, %xmm1
1667 * psrlq %xmm1, $0x20
1668 * pmuludq %xmm1, %xmm0
1669 * paddq %xmm1, %xmm1
1670 * psllq %xmm1, $0x20
1671 * pmuludq %xmm2, %xmm0
1672 * paddq %xmm1, %xmm2
1673 *
1674 */
1675
1676 bool both_operands_same = (rs_dest_src1.GetReg() == rs_src2.GetReg());
1677
1678 RegStorage rs_tmp_vector_1;
1679 RegStorage rs_tmp_vector_2;
1680 rs_tmp_vector_1 = Get128BitRegister(AllocTempDouble());
1681 NewLIR2(kX86MovdqaRR, rs_tmp_vector_1.GetReg(), rs_dest_src1.GetReg());
1682
1683 if (both_operands_same == false) {
1684 rs_tmp_vector_2 = Get128BitRegister(AllocTempDouble());
1685 NewLIR2(kX86MovdqaRR, rs_tmp_vector_2.GetReg(), rs_src2.GetReg());
1686 NewLIR2(kX86PsrlqRI, rs_tmp_vector_2.GetReg(), 0x20);
1687 NewLIR2(kX86PmuludqRR, rs_tmp_vector_2.GetReg(), rs_tmp_vector_1.GetReg());
1688 }
1689
1690 NewLIR2(kX86PsrlqRI, rs_dest_src1.GetReg(), 0x20);
1691 NewLIR2(kX86PmuludqRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1692
1693 if (both_operands_same == false) {
1694 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_2.GetReg());
1695 } else {
1696 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1697 }
1698
1699 NewLIR2(kX86PsllqRI, rs_dest_src1.GetReg(), 0x20);
1700 NewLIR2(kX86PmuludqRR, rs_tmp_vector_1.GetReg(), rs_src2.GetReg());
1701 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001702}
1703
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001704void X86Mir2Lir::GenMultiplyVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001705 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1706 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1707 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001708 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001709 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001710 int opcode = 0;
1711 switch (opsize) {
1712 case k32:
1713 opcode = kX86PmulldRR;
1714 break;
1715 case kSignedHalf:
1716 opcode = kX86PmullwRR;
1717 break;
1718 case kSingle:
1719 opcode = kX86MulpsRR;
1720 break;
1721 case kDouble:
1722 opcode = kX86MulpdRR;
1723 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001724 case kSignedByte:
1725 // HW doesn't support 16x16 byte multiplication so emulate it.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001726 GenMultiplyVectorSignedByte(rs_dest_src1, rs_src2);
1727 return;
1728 case k64:
1729 GenMultiplyVectorLong(rs_dest_src1, rs_src2);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001730 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001731 default:
1732 LOG(FATAL) << "Unsupported vector multiply " << opsize;
1733 break;
1734 }
1735 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1736}
1737
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001738void X86Mir2Lir::GenAddVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001739 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1740 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1741 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001742 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001743 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001744 int opcode = 0;
1745 switch (opsize) {
1746 case k32:
1747 opcode = kX86PadddRR;
1748 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001749 case k64:
1750 opcode = kX86PaddqRR;
1751 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001752 case kSignedHalf:
1753 case kUnsignedHalf:
1754 opcode = kX86PaddwRR;
1755 break;
1756 case kUnsignedByte:
1757 case kSignedByte:
1758 opcode = kX86PaddbRR;
1759 break;
1760 case kSingle:
1761 opcode = kX86AddpsRR;
1762 break;
1763 case kDouble:
1764 opcode = kX86AddpdRR;
1765 break;
1766 default:
1767 LOG(FATAL) << "Unsupported vector addition " << opsize;
1768 break;
1769 }
1770 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1771}
1772
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001773void X86Mir2Lir::GenSubtractVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001774 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1775 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1776 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001777 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001778 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001779 int opcode = 0;
1780 switch (opsize) {
1781 case k32:
1782 opcode = kX86PsubdRR;
1783 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001784 case k64:
1785 opcode = kX86PsubqRR;
1786 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001787 case kSignedHalf:
1788 case kUnsignedHalf:
1789 opcode = kX86PsubwRR;
1790 break;
1791 case kUnsignedByte:
1792 case kSignedByte:
1793 opcode = kX86PsubbRR;
1794 break;
1795 case kSingle:
1796 opcode = kX86SubpsRR;
1797 break;
1798 case kDouble:
1799 opcode = kX86SubpdRR;
1800 break;
1801 default:
1802 LOG(FATAL) << "Unsupported vector subtraction " << opsize;
1803 break;
1804 }
1805 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1806}
1807
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001808void X86Mir2Lir::GenShiftByteVector(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001809 // Destination does not need clobbered because it has already been as part
1810 // of the general packed shift handler (caller of this method).
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001811 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001812
1813 int opcode = 0;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001814 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
1815 case kMirOpPackedShiftLeft:
1816 opcode = kX86PsllwRI;
1817 break;
1818 case kMirOpPackedSignedShiftRight:
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001819 case kMirOpPackedUnsignedShiftRight:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001820 // TODO Add support for emulated byte shifts.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001821 default:
1822 LOG(FATAL) << "Unsupported shift operation on byte vector " << opcode;
1823 break;
1824 }
1825
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001826 // Clear xmm register and return if shift more than byte length.
1827 int imm = mir->dalvikInsn.vB;
1828 if (imm >= 8) {
1829 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1830 return;
1831 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001832
1833 // Shift lower values.
1834 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1835
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001836 /*
1837 * The above shift will shift the whole word, but that means
1838 * both the bytes will shift as well. To emulate a byte level
1839 * shift, we can just throw away the lower (8 - N) bits of the
1840 * upper byte, and we are done.
1841 */
1842 uint8_t byte_mask = 0xFF << imm;
1843 uint32_t int_mask = byte_mask;
1844 int_mask = int_mask << 8 | byte_mask;
1845 int_mask = int_mask << 8 | byte_mask;
1846 int_mask = int_mask << 8 | byte_mask;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001847
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001848 // And the destination with the mask
1849 AndMaskVectorRegister(rs_dest_src1, int_mask, int_mask, int_mask, int_mask);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001850}
1851
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001852void X86Mir2Lir::GenShiftLeftVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001853 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1854 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1855 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001856 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001857 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001858 int opcode = 0;
1859 switch (opsize) {
1860 case k32:
1861 opcode = kX86PslldRI;
1862 break;
1863 case k64:
1864 opcode = kX86PsllqRI;
1865 break;
1866 case kSignedHalf:
1867 case kUnsignedHalf:
1868 opcode = kX86PsllwRI;
1869 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001870 case kSignedByte:
1871 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001872 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001873 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001874 default:
1875 LOG(FATAL) << "Unsupported vector shift left " << opsize;
1876 break;
1877 }
1878 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1879}
1880
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001881void X86Mir2Lir::GenSignedShiftRightVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001882 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1883 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1884 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001885 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001886 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001887 int opcode = 0;
1888 switch (opsize) {
1889 case k32:
1890 opcode = kX86PsradRI;
1891 break;
1892 case kSignedHalf:
1893 case kUnsignedHalf:
1894 opcode = kX86PsrawRI;
1895 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001896 case kSignedByte:
1897 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001898 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001899 return;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001900 case k64:
1901 // TODO Implement emulated shift algorithm.
Mark Mendellfe945782014-05-22 09:52:36 -04001902 default:
1903 LOG(FATAL) << "Unsupported vector signed shift right " << opsize;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001904 UNREACHABLE();
Mark Mendellfe945782014-05-22 09:52:36 -04001905 }
1906 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1907}
1908
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001909void X86Mir2Lir::GenUnsignedShiftRightVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001910 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1911 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1912 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001913 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001914 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001915 int opcode = 0;
1916 switch (opsize) {
1917 case k32:
1918 opcode = kX86PsrldRI;
1919 break;
1920 case k64:
1921 opcode = kX86PsrlqRI;
1922 break;
1923 case kSignedHalf:
1924 case kUnsignedHalf:
1925 opcode = kX86PsrlwRI;
1926 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001927 case kSignedByte:
1928 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001929 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001930 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001931 default:
1932 LOG(FATAL) << "Unsupported vector unsigned shift right " << opsize;
1933 break;
1934 }
1935 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1936}
1937
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001938void X86Mir2Lir::GenAndVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001939 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001940 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1941 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001942 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001943 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001944 NewLIR2(kX86PandRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1945}
1946
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001947void X86Mir2Lir::GenOrVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001948 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001949 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1950 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001951 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001952 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001953 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1954}
1955
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001956void X86Mir2Lir::GenXorVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001957 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001958 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1959 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001960 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001961 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001962 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1963}
1964
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001965void X86Mir2Lir::AndMaskVectorRegister(RegStorage rs_src1, uint32_t m1, uint32_t m2, uint32_t m3, uint32_t m4) {
1966 MaskVectorRegister(kX86PandRM, rs_src1, m1, m2, m3, m4);
1967}
1968
1969void X86Mir2Lir::MaskVectorRegister(X86OpCode opcode, RegStorage rs_src1, uint32_t m0, uint32_t m1, uint32_t m2, uint32_t m3) {
1970 // Create temporary MIR as container for 128-bit binary mask.
1971 MIR const_mir;
1972 MIR* const_mirp = &const_mir;
1973 const_mirp->dalvikInsn.opcode = static_cast<Instruction::Code>(kMirOpConstVector);
1974 const_mirp->dalvikInsn.arg[0] = m0;
1975 const_mirp->dalvikInsn.arg[1] = m1;
1976 const_mirp->dalvikInsn.arg[2] = m2;
1977 const_mirp->dalvikInsn.arg[3] = m3;
1978
1979 // Mask vector with const from literal pool.
1980 AppendOpcodeWithConst(opcode, rs_src1.GetReg(), const_mirp);
1981}
1982
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001983void X86Mir2Lir::GenAddReduceVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001984 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001985 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
1986 bool is_wide = opsize == k64 || opsize == kDouble;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001987
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001988 // Get the location of the virtual register. Since this bytecode is overloaded
1989 // for different types (and sizes), we need different logic for each path.
1990 // The design of bytecode uses same VR for source and destination.
1991 RegLocation rl_src, rl_dest, rl_result;
1992 if (is_wide) {
1993 rl_src = mir_graph_->GetSrcWide(mir, 0);
1994 rl_dest = mir_graph_->GetDestWide(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001995 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001996 rl_src = mir_graph_->GetSrc(mir, 0);
1997 rl_dest = mir_graph_->GetDest(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001998 }
1999
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002000 // We need a temp for byte and short values
2001 RegStorage temp;
2002
2003 // There is a different path depending on type and size.
2004 if (opsize == kSingle) {
2005 // Handle float case.
2006 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
2007
2008 rl_src = LoadValue(rl_src, kFPReg);
2009 rl_result = EvalLoc(rl_dest, kFPReg, true);
2010
2011 // Since we are doing an add-reduce, we move the reg holding the VR
2012 // into the result so we include it in result.
2013 OpRegCopy(rl_result.reg, rl_src.reg);
2014 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2015
2016 // Since FP must keep order of operation for value safety, we shift to low
2017 // 32-bits and add to result.
2018 for (int i = 0; i < 3; i++) {
2019 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), 0x39);
2020 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2021 }
2022
2023 StoreValue(rl_dest, rl_result);
2024 } else if (opsize == kDouble) {
2025 // Handle double case.
2026 rl_src = LoadValueWide(rl_src, kFPReg);
2027 rl_result = EvalLocWide(rl_dest, kFPReg, true);
2028 LOG(FATAL) << "Unsupported vector add reduce for double.";
2029 } else if (opsize == k64) {
2030 /*
2031 * Handle long case:
2032 * 1) Reduce the vector register to lower half (with addition).
2033 * 1-1) Get an xmm temp and fill it with vector register.
2034 * 1-2) Shift the xmm temp by 8-bytes.
2035 * 1-3) Add the xmm temp to vector register that is being reduced.
2036 * 2) Allocate temp GP / GP pair.
2037 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2038 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2039 * 3) Finish the add reduction by doing what add-long/2addr does,
2040 * but instead of having a VR as one of the sources, we have our temp GP.
2041 */
2042 RegStorage rs_tmp_vector = Get128BitRegister(AllocTempDouble());
2043 NewLIR2(kX86MovdqaRR, rs_tmp_vector.GetReg(), vector_src.GetReg());
2044 NewLIR2(kX86PsrldqRI, rs_tmp_vector.GetReg(), 8);
2045 NewLIR2(kX86PaddqRR, vector_src.GetReg(), rs_tmp_vector.GetReg());
2046 FreeTemp(rs_tmp_vector);
2047
2048 // We would like to be able to reuse the add-long implementation, so set up a fake
2049 // register location to pass it.
2050 RegLocation temp_loc = mir_graph_->GetBadLoc();
2051 temp_loc.core = 1;
2052 temp_loc.wide = 1;
2053 temp_loc.location = kLocPhysReg;
2054 temp_loc.reg = AllocTempWide();
2055
2056 if (cu_->target64) {
2057 DCHECK(!temp_loc.reg.IsPair());
2058 NewLIR2(kX86MovqrxRR, temp_loc.reg.GetReg(), vector_src.GetReg());
2059 } else {
2060 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetLowReg(), vector_src.GetReg());
2061 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2062 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetHighReg(), vector_src.GetReg());
2063 }
2064
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002065 GenArithOpLong(Instruction::ADD_LONG_2ADDR, rl_dest, temp_loc, temp_loc, mir->optimization_flags);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002066 } else if (opsize == kSignedByte || opsize == kUnsignedByte) {
2067 RegStorage rs_tmp = Get128BitRegister(AllocTempDouble());
2068 NewLIR2(kX86PxorRR, rs_tmp.GetReg(), rs_tmp.GetReg());
2069 NewLIR2(kX86PsadbwRR, vector_src.GetReg(), rs_tmp.GetReg());
2070 NewLIR3(kX86PshufdRRI, rs_tmp.GetReg(), vector_src.GetReg(), 0x4e);
2071 NewLIR2(kX86PaddbRR, vector_src.GetReg(), rs_tmp.GetReg());
2072 // Move to a GPR
2073 temp = AllocTemp();
2074 NewLIR2(kX86MovdrxRR, temp.GetReg(), vector_src.GetReg());
2075 } else {
2076 // Handle and the int and short cases together
2077
2078 // Initialize as if we were handling int case. Below we update
2079 // the opcode if handling byte or short.
2080 int vec_bytes = (mir->dalvikInsn.vC & 0xFFFF) / 8;
2081 int vec_unit_size;
2082 int horizontal_add_opcode;
2083 int extract_opcode;
2084
2085 if (opsize == kSignedHalf || opsize == kUnsignedHalf) {
2086 extract_opcode = kX86PextrwRRI;
2087 horizontal_add_opcode = kX86PhaddwRR;
2088 vec_unit_size = 2;
2089 } else if (opsize == k32) {
2090 vec_unit_size = 4;
2091 horizontal_add_opcode = kX86PhadddRR;
2092 extract_opcode = kX86PextrdRRI;
2093 } else {
2094 LOG(FATAL) << "Unsupported vector add reduce " << opsize;
2095 return;
2096 }
2097
2098 int elems = vec_bytes / vec_unit_size;
2099
2100 while (elems > 1) {
2101 NewLIR2(horizontal_add_opcode, vector_src.GetReg(), vector_src.GetReg());
2102 elems >>= 1;
2103 }
2104
2105 // Handle this as arithmetic unary case.
2106 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2107
2108 // Extract to a GP register because this is integral typed.
2109 temp = AllocTemp();
2110 NewLIR3(extract_opcode, temp.GetReg(), vector_src.GetReg(), 0);
2111 }
2112
2113 if (opsize != k64 && opsize != kSingle && opsize != kDouble) {
2114 // The logic below looks very similar to the handling of ADD_INT_2ADDR
2115 // except the rhs is not a VR but a physical register allocated above.
2116 // No load of source VR is done because it assumes that rl_result will
2117 // share physical register / memory location.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002118 rl_result = UpdateLocTyped(rl_dest);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002119 if (rl_result.location == kLocPhysReg) {
2120 // Ensure res is in a core reg.
2121 rl_result = EvalLoc(rl_dest, kCoreReg, true);
2122 OpRegReg(kOpAdd, rl_result.reg, temp);
2123 StoreFinalValue(rl_dest, rl_result);
2124 } else {
2125 // Do the addition directly to memory.
Maxim Kazantsev085b7332015-02-24 15:07:55 +06002126 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002127 OpMemReg(kOpAdd, rl_result, temp.GetReg());
2128 }
2129 }
Mark Mendellfe945782014-05-22 09:52:36 -04002130}
2131
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002132void X86Mir2Lir::GenReduceVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002133 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2134 RegLocation rl_dest = mir_graph_->GetDest(mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002135 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002136 RegLocation rl_result;
2137 bool is_wide = false;
2138
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002139 // There is a different path depending on type and size.
2140 if (opsize == kSingle) {
2141 // Handle float case.
2142 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
Mark Mendellfe945782014-05-22 09:52:36 -04002143
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002144 int extract_index = mir->dalvikInsn.arg[0];
2145
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002146 rl_result = EvalLoc(rl_dest, kFPReg, true);
2147 NewLIR2(kX86PxorRR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002148
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002149 if (LIKELY(extract_index != 0)) {
2150 // We know the index of element which we want to extract. We want to extract it and
2151 // keep values in vector register correct for future use. So the way we act is:
2152 // 1. Generate shuffle mask that allows to swap zeroth and required elements;
2153 // 2. Shuffle vector register with this mask;
2154 // 3. Extract zeroth element where required value lies;
2155 // 4. Shuffle with same mask again to restore original values in vector register.
2156 // The mask is generated from equivalence mask 0b11100100 swapping 0th and extracted
2157 // element indices.
2158 int shuffle[4] = {0b00, 0b01, 0b10, 0b11};
2159 shuffle[0] = extract_index;
2160 shuffle[extract_index] = 0;
2161 int mask = 0;
2162 for (int i = 0; i < 4; i++) {
2163 mask |= (shuffle[i] << (2 * i));
2164 }
2165 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), mask);
2166 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2167 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), mask);
2168 } else {
2169 // We need to extract zeroth element and don't need any complex stuff to do it.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002170 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002171 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002172
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002173 StoreFinalValue(rl_dest, rl_result);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002174 } else if (opsize == kDouble) {
2175 // TODO Handle double case.
2176 LOG(FATAL) << "Unsupported add reduce for double.";
2177 } else if (opsize == k64) {
2178 /*
2179 * Handle long case:
2180 * 1) Reduce the vector register to lower half (with addition).
2181 * 1-1) Get an xmm temp and fill it with vector register.
2182 * 1-2) Shift the xmm temp by 8-bytes.
2183 * 1-3) Add the xmm temp to vector register that is being reduced.
2184 * 2) Evaluate destination to a GP / GP pair.
2185 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2186 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2187 * 3) Store the result to the final destination.
2188 */
Udayan Banerji53cec002014-09-26 10:41:47 -07002189 NewLIR2(kX86PsrldqRI, vector_src.GetReg(), 8);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002190 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2191 if (cu_->target64) {
2192 DCHECK(!rl_result.reg.IsPair());
2193 NewLIR2(kX86MovqrxRR, rl_result.reg.GetReg(), vector_src.GetReg());
2194 } else {
2195 NewLIR2(kX86MovdrxRR, rl_result.reg.GetLowReg(), vector_src.GetReg());
2196 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2197 NewLIR2(kX86MovdrxRR, rl_result.reg.GetHighReg(), vector_src.GetReg());
2198 }
2199
2200 StoreValueWide(rl_dest, rl_result);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002201 } else {
Udayan Banerji53cec002014-09-26 10:41:47 -07002202 int extract_index = mir->dalvikInsn.arg[0];
2203 int extr_opcode = 0;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002204 rl_result = UpdateLocTyped(rl_dest);
Udayan Banerji53cec002014-09-26 10:41:47 -07002205
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002206 // Handle the rest of integral types now.
2207 switch (opsize) {
2208 case k32:
Udayan Banerji53cec002014-09-26 10:41:47 -07002209 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrdRRI : kX86PextrdMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002210 break;
2211 case kSignedHalf:
2212 case kUnsignedHalf:
Udayan Banerji53cec002014-09-26 10:41:47 -07002213 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrwRRI : kX86PextrwMRI;
2214 break;
2215 case kSignedByte:
2216 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrbRRI : kX86PextrbMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002217 break;
2218 default:
2219 LOG(FATAL) << "Unsupported vector reduce " << opsize;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002220 UNREACHABLE();
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002221 }
2222
2223 if (rl_result.location == kLocPhysReg) {
2224 NewLIR3(extr_opcode, rl_result.reg.GetReg(), vector_src.GetReg(), extract_index);
Udayan Banerji53cec002014-09-26 10:41:47 -07002225 StoreFinalValue(rl_dest, rl_result);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002226 } else {
2227 int displacement = SRegOffset(rl_result.s_reg_low);
Mark Mendellb3cdf932015-01-27 09:51:26 -05002228 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Razvan A Lupusorub72c7232014-10-28 19:29:52 -07002229 LIR *l = NewLIR4(extr_opcode, rs_rX86_SP_32.GetReg(), displacement, vector_src.GetReg(),
2230 extract_index);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002231 AnnotateDalvikRegAccess(l, displacement >> 2, false /* is_load */, is_wide /* is_64bit */);
2232 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002233 }
Mark Mendellfe945782014-05-22 09:52:36 -04002234}
2235
Mark Mendell0a1174e2014-09-11 14:51:02 -04002236void X86Mir2Lir::LoadVectorRegister(RegStorage rs_dest, RegStorage rs_src,
2237 OpSize opsize, int op_mov) {
2238 if (!cu_->target64 && opsize == k64) {
2239 // Logic assumes that longs are loaded in GP register pairs.
2240 NewLIR2(kX86MovdxrRR, rs_dest.GetReg(), rs_src.GetLowReg());
2241 RegStorage r_tmp = AllocTempDouble();
2242 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), rs_src.GetHighReg());
2243 NewLIR2(kX86PunpckldqRR, rs_dest.GetReg(), r_tmp.GetReg());
2244 FreeTemp(r_tmp);
2245 } else {
2246 NewLIR2(op_mov, rs_dest.GetReg(), rs_src.GetReg());
2247 }
2248}
2249
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002250void X86Mir2Lir::GenSetVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002251 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2252 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2253 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002254 Clobber(rs_dest);
2255 int op_shuffle = 0, op_shuffle_high = 0, op_mov = kX86MovdxrRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002256 RegisterClass reg_type = kCoreReg;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002257 bool is_wide = false;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002258
Mark Mendellfe945782014-05-22 09:52:36 -04002259 switch (opsize) {
2260 case k32:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002261 op_shuffle = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002262 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002263 case kSingle:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002264 op_shuffle = kX86PshufdRRI;
2265 op_mov = kX86MovdqaRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002266 reg_type = kFPReg;
2267 break;
2268 case k64:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002269 op_shuffle = kX86PunpcklqdqRR;
Udayan Banerji53cec002014-09-26 10:41:47 -07002270 op_mov = kX86MovqxrRR;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002271 is_wide = true;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002272 break;
2273 case kSignedByte:
2274 case kUnsignedByte:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002275 // We will have the source loaded up in a
2276 // double-word before we use this shuffle
2277 op_shuffle = kX86PshufdRRI;
2278 break;
Mark Mendellfe945782014-05-22 09:52:36 -04002279 case kSignedHalf:
2280 case kUnsignedHalf:
2281 // Handles low quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002282 op_shuffle = kX86PshuflwRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002283 // Handles upper quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002284 op_shuffle_high = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002285 break;
2286 default:
2287 LOG(FATAL) << "Unsupported vector set " << opsize;
2288 break;
2289 }
2290
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002291 // Load the value from the VR into a physical register.
2292 RegLocation rl_src;
2293 if (!is_wide) {
2294 rl_src = mir_graph_->GetSrc(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002295 rl_src = LoadValue(rl_src, reg_type);
2296 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002297 rl_src = mir_graph_->GetSrcWide(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002298 rl_src = LoadValueWide(rl_src, reg_type);
2299 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002300 RegStorage reg_to_shuffle = rl_src.reg;
Mark Mendellfe945782014-05-22 09:52:36 -04002301
2302 // Load the value into the XMM register.
Mark Mendell0a1174e2014-09-11 14:51:02 -04002303 LoadVectorRegister(rs_dest, reg_to_shuffle, opsize, op_mov);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002304
2305 if (opsize == kSignedByte || opsize == kUnsignedByte) {
2306 // In the byte case, first duplicate it to be a word
2307 // Then duplicate it to be a double-word
2308 NewLIR2(kX86PunpcklbwRR, rs_dest.GetReg(), rs_dest.GetReg());
2309 NewLIR2(kX86PunpcklwdRR, rs_dest.GetReg(), rs_dest.GetReg());
2310 }
Mark Mendellfe945782014-05-22 09:52:36 -04002311
2312 // Now shuffle the value across the destination.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002313 if (op_shuffle == kX86PunpcklqdqRR) {
2314 NewLIR2(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg());
2315 } else {
2316 NewLIR3(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg(), 0);
2317 }
Mark Mendellfe945782014-05-22 09:52:36 -04002318
2319 // And then repeat as needed.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002320 if (op_shuffle_high != 0) {
2321 NewLIR3(op_shuffle_high, rs_dest.GetReg(), rs_dest.GetReg(), 0);
Mark Mendellfe945782014-05-22 09:52:36 -04002322 }
2323}
2324
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002325void X86Mir2Lir::GenPackedArrayGet(BasicBlock* bb, MIR* mir) {
2326 UNUSED(bb, mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002327 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayGet not supported.";
2328}
2329
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002330void X86Mir2Lir::GenPackedArrayPut(BasicBlock* bb, MIR* mir) {
2331 UNUSED(bb, mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002332 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayPut not supported.";
2333}
2334
2335LIR* X86Mir2Lir::ScanVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002336 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002337 if (constants[0] == p->operands[0] && constants[1] == p->operands[1] &&
2338 constants[2] == p->operands[2] && constants[3] == p->operands[3]) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002339 return p;
2340 }
2341 }
2342 return nullptr;
2343}
2344
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002345LIR* X86Mir2Lir::AddVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002346 LIR* new_value = static_cast<LIR*>(arena_->Alloc(sizeof(LIR), kArenaAllocData));
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002347 new_value->operands[0] = constants[0];
2348 new_value->operands[1] = constants[1];
2349 new_value->operands[2] = constants[2];
2350 new_value->operands[3] = constants[3];
Mark Mendelld65c51a2014-04-29 16:55:20 -04002351 new_value->next = const_vectors_;
2352 if (const_vectors_ == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002353 estimated_native_code_size_ += 12; // Maximum needed to align to 16 byte boundary.
Mark Mendelld65c51a2014-04-29 16:55:20 -04002354 }
2355 estimated_native_code_size_ += 16; // Space for one vector.
2356 const_vectors_ = new_value;
2357 return new_value;
2358}
2359
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002360// ------------ ABI support: mapping of args to physical registers -------------
Serguei Katkov717a3e42014-11-13 17:19:42 +06002361RegStorage X86Mir2Lir::InToRegStorageX86_64Mapper::GetNextReg(ShortyArg arg) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002362 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3, kArg4, kArg5};
Serguei Katkov717a3e42014-11-13 17:19:42 +06002363 const size_t coreArgMappingToPhysicalRegSize = arraysize(coreArgMappingToPhysicalReg);
Chao-ying Fua77ee512014-07-01 17:43:41 -07002364 const SpecialTargetRegister fpArgMappingToPhysicalReg[] = {kFArg0, kFArg1, kFArg2, kFArg3,
Andreas Gampeccc60262014-07-04 18:02:38 -07002365 kFArg4, kFArg5, kFArg6, kFArg7};
Serguei Katkov717a3e42014-11-13 17:19:42 +06002366 const size_t fpArgMappingToPhysicalRegSize = arraysize(fpArgMappingToPhysicalReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002367
Serguei Katkov717a3e42014-11-13 17:19:42 +06002368 if (arg.IsFP()) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002369 if (cur_fp_reg_ < fpArgMappingToPhysicalRegSize) {
Serguei Katkov717a3e42014-11-13 17:19:42 +06002370 return m2l_->TargetReg(fpArgMappingToPhysicalReg[cur_fp_reg_++],
2371 arg.IsWide() ? kWide : kNotWide);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002372 }
2373 } else {
2374 if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
Serguei Katkov717a3e42014-11-13 17:19:42 +06002375 return m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2376 arg.IsRef() ? kRef : (arg.IsWide() ? kWide : kNotWide));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002377 }
2378 }
Chao-ying Fua77ee512014-07-01 17:43:41 -07002379 return RegStorage::InvalidReg();
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002380}
2381
Serguei Katkov717a3e42014-11-13 17:19:42 +06002382RegStorage X86Mir2Lir::InToRegStorageX86Mapper::GetNextReg(ShortyArg arg) {
2383 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3};
2384 const size_t coreArgMappingToPhysicalRegSize = arraysize(coreArgMappingToPhysicalReg);
Mark P Mendell966c3ae2015-01-27 15:45:27 +00002385 const SpecialTargetRegister fpArgMappingToPhysicalReg[] = {kFArg0, kFArg1, kFArg2, kFArg3};
2386 const size_t fpArgMappingToPhysicalRegSize = arraysize(fpArgMappingToPhysicalReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002387
Serguei Katkov717a3e42014-11-13 17:19:42 +06002388 RegStorage result = RegStorage::InvalidReg();
Mark P Mendell966c3ae2015-01-27 15:45:27 +00002389 if (arg.IsFP()) {
2390 if (cur_fp_reg_ < fpArgMappingToPhysicalRegSize) {
2391 return m2l_->TargetReg(fpArgMappingToPhysicalReg[cur_fp_reg_++],
2392 arg.IsWide() ? kWide : kNotWide);
2393 }
Mark Mendell3e6a3bf2015-01-19 14:09:22 -05002394 } else if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
2395 result = m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2396 arg.IsRef() ? kRef : kNotWide);
2397 if (arg.IsWide()) {
2398 // This must be a long, as double is handled above.
2399 // Ensure that we don't split a long across the last register and the stack.
2400 if (cur_core_reg_ == coreArgMappingToPhysicalRegSize) {
2401 // Leave the last core register unused and force the whole long to the stack.
2402 cur_core_reg_++;
2403 result = RegStorage::InvalidReg();
2404 } else if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
Mark P Mendell966c3ae2015-01-27 15:45:27 +00002405 result = RegStorage::MakeRegPair(
2406 result, m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++], kNotWide));
2407 }
Serguei Katkov717a3e42014-11-13 17:19:42 +06002408 }
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002409 }
Serguei Katkov717a3e42014-11-13 17:19:42 +06002410 return result;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002411}
2412
2413// ---------End of ABI support: mapping of args to physical registers -------------
2414
Andreas Gampe98430592014-07-27 19:44:50 -07002415bool X86Mir2Lir::GenInlinedCharAt(CallInfo* info) {
2416 // Location of reference to data array
2417 int value_offset = mirror::String::ValueOffset().Int32Value();
2418 // Location of count
2419 int count_offset = mirror::String::CountOffset().Int32Value();
Andreas Gampe98430592014-07-27 19:44:50 -07002420
2421 RegLocation rl_obj = info->args[0];
2422 RegLocation rl_idx = info->args[1];
2423 rl_obj = LoadValue(rl_obj, kRefReg);
Jeff Hao848f70a2014-01-15 13:49:50 -08002424 rl_idx = LoadValue(rl_idx, kCoreReg);
Andreas Gampe98430592014-07-27 19:44:50 -07002425 RegStorage reg_max;
2426 GenNullCheck(rl_obj.reg, info->opt_flags);
2427 bool range_check = (!(info->opt_flags & MIR_IGNORE_RANGE_CHECK));
2428 LIR* range_check_branch = nullptr;
Andreas Gampe98430592014-07-27 19:44:50 -07002429 if (range_check) {
2430 // On x86, we can compare to memory directly
2431 // Set up a launch pad to allow retry in case of bounds violation */
2432 if (rl_idx.is_const) {
2433 LIR* comparison;
2434 range_check_branch = OpCmpMemImmBranch(
Vladimir Marko00ca8472015-01-26 14:06:46 +00002435 kCondLs, RegStorage::InvalidReg(), rl_obj.reg, count_offset,
Andreas Gampe98430592014-07-27 19:44:50 -07002436 mir_graph_->ConstantValue(rl_idx.orig_sreg), nullptr, &comparison);
2437 MarkPossibleNullPointerExceptionAfter(0, comparison);
2438 } else {
2439 OpRegMem(kOpCmp, rl_idx.reg, rl_obj.reg, count_offset);
2440 MarkPossibleNullPointerException(0);
2441 range_check_branch = OpCondBranch(kCondUge, nullptr);
2442 }
2443 }
Andreas Gampe98430592014-07-27 19:44:50 -07002444 RegLocation rl_dest = InlineTarget(info);
2445 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Jeff Hao848f70a2014-01-15 13:49:50 -08002446 LoadBaseIndexedDisp(rl_obj.reg, rl_idx.reg, 1, value_offset, rl_result.reg, kUnsignedHalf);
2447 FreeTemp(rl_idx.reg);
2448 FreeTemp(rl_obj.reg);
Andreas Gampe98430592014-07-27 19:44:50 -07002449 StoreValue(rl_dest, rl_result);
2450 if (range_check) {
2451 DCHECK(range_check_branch != nullptr);
2452 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've already null checked.
2453 AddIntrinsicSlowPath(info, range_check_branch);
2454 }
2455 return true;
2456}
2457
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002458bool X86Mir2Lir::GenInlinedCurrentThread(CallInfo* info) {
2459 RegLocation rl_dest = InlineTarget(info);
2460
2461 // Early exit if the result is unused.
2462 if (rl_dest.orig_sreg < 0) {
2463 return true;
2464 }
2465
2466 RegLocation rl_result = EvalLoc(rl_dest, kRefReg, true);
2467
2468 if (cu_->target64) {
2469 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<8>());
2470 } else {
2471 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<4>());
2472 }
2473
2474 StoreValue(rl_dest, rl_result);
2475 return true;
2476}
2477
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002478/**
2479 * Lock temp registers for explicit usage. Registers will be freed in destructor.
2480 */
2481X86Mir2Lir::ExplicitTempRegisterLock::ExplicitTempRegisterLock(X86Mir2Lir* mir_to_lir,
2482 int n_regs, ...) :
2483 temp_regs_(n_regs),
2484 mir_to_lir_(mir_to_lir) {
2485 va_list regs;
2486 va_start(regs, n_regs);
2487 for (int i = 0; i < n_regs; i++) {
2488 RegStorage reg = *(va_arg(regs, RegStorage*));
2489 RegisterInfo* info = mir_to_lir_->GetRegInfo(reg);
2490
2491 // Make sure we don't have promoted register here.
2492 DCHECK(info->IsTemp());
2493
2494 temp_regs_.push_back(reg);
2495 mir_to_lir_->FlushReg(reg);
2496
2497 if (reg.IsPair()) {
2498 RegStorage partner = info->Partner();
2499 temp_regs_.push_back(partner);
2500 mir_to_lir_->FlushReg(partner);
2501 }
2502
2503 mir_to_lir_->Clobber(reg);
2504 mir_to_lir_->LockTemp(reg);
2505 }
2506
2507 va_end(regs);
2508}
2509
2510/*
2511 * Free all locked registers.
2512 */
2513X86Mir2Lir::ExplicitTempRegisterLock::~ExplicitTempRegisterLock() {
2514 // Free all locked temps.
2515 for (auto it : temp_regs_) {
2516 mir_to_lir_->FreeTemp(it);
2517 }
2518}
2519
Serguei Katkov717a3e42014-11-13 17:19:42 +06002520int X86Mir2Lir::GenDalvikArgsBulkCopy(CallInfo* info, int first, int count) {
2521 if (count < 4) {
2522 // It does not make sense to use this utility if we have no chance to use
2523 // 128-bit move.
2524 return count;
2525 }
2526 GenDalvikArgsFlushPromoted(info, first);
2527
2528 // The rest can be copied together
2529 int current_src_offset = SRegOffset(info->args[first].s_reg_low);
2530 int current_dest_offset = StackVisitor::GetOutVROffset(first, cu_->instruction_set);
2531
2532 // Only davik regs are accessed in this loop; no next_call_insn() calls.
2533 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2534 while (count > 0) {
2535 // This is based on the knowledge that the stack itself is 16-byte aligned.
2536 bool src_is_16b_aligned = (current_src_offset & 0xF) == 0;
2537 bool dest_is_16b_aligned = (current_dest_offset & 0xF) == 0;
2538 size_t bytes_to_move;
2539
2540 /*
2541 * The amount to move defaults to 32-bit. If there are 4 registers left to move, then do a
2542 * a 128-bit move because we won't get the chance to try to aligned. If there are more than
2543 * 4 registers left to move, consider doing a 128-bit only if either src or dest are aligned.
2544 * We do this because we could potentially do a smaller move to align.
2545 */
2546 if (count == 4 || (count > 4 && (src_is_16b_aligned || dest_is_16b_aligned))) {
2547 // Moving 128-bits via xmm register.
2548 bytes_to_move = sizeof(uint32_t) * 4;
2549
2550 // Allocate a free xmm temp. Since we are working through the calling sequence,
2551 // we expect to have an xmm temporary available. AllocTempDouble will abort if
2552 // there are no free registers.
2553 RegStorage temp = AllocTempDouble();
2554
2555 LIR* ld1 = nullptr;
2556 LIR* ld2 = nullptr;
2557 LIR* st1 = nullptr;
2558 LIR* st2 = nullptr;
2559
2560 /*
2561 * The logic is similar for both loads and stores. If we have 16-byte alignment,
2562 * do an aligned move. If we have 8-byte alignment, then do the move in two
2563 * parts. This approach prevents possible cache line splits. Finally, fall back
2564 * to doing an unaligned move. In most cases we likely won't split the cache
2565 * line but we cannot prove it and thus take a conservative approach.
2566 */
2567 bool src_is_8b_aligned = (current_src_offset & 0x7) == 0;
2568 bool dest_is_8b_aligned = (current_dest_offset & 0x7) == 0;
2569
2570 if (src_is_16b_aligned) {
2571 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovA128FP);
2572 } else if (src_is_8b_aligned) {
2573 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovLo128FP);
2574 ld2 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset + (bytes_to_move >> 1),
2575 kMovHi128FP);
2576 } else {
2577 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovU128FP);
2578 }
2579
2580 if (dest_is_16b_aligned) {
2581 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovA128FP);
2582 } else if (dest_is_8b_aligned) {
2583 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovLo128FP);
2584 st2 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset + (bytes_to_move >> 1),
2585 temp, kMovHi128FP);
2586 } else {
2587 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovU128FP);
2588 }
2589
2590 // TODO If we could keep track of aliasing information for memory accesses that are wider
2591 // than 64-bit, we wouldn't need to set up a barrier.
2592 if (ld1 != nullptr) {
2593 if (ld2 != nullptr) {
2594 // For 64-bit load we can actually set up the aliasing information.
2595 AnnotateDalvikRegAccess(ld1, current_src_offset >> 2, true, true);
2596 AnnotateDalvikRegAccess(ld2, (current_src_offset + (bytes_to_move >> 1)) >> 2, true,
2597 true);
2598 } else {
2599 // Set barrier for 128-bit load.
2600 ld1->u.m.def_mask = &kEncodeAll;
2601 }
2602 }
2603 if (st1 != nullptr) {
2604 if (st2 != nullptr) {
2605 // For 64-bit store we can actually set up the aliasing information.
2606 AnnotateDalvikRegAccess(st1, current_dest_offset >> 2, false, true);
2607 AnnotateDalvikRegAccess(st2, (current_dest_offset + (bytes_to_move >> 1)) >> 2, false,
2608 true);
2609 } else {
2610 // Set barrier for 128-bit store.
2611 st1->u.m.def_mask = &kEncodeAll;
2612 }
2613 }
2614
2615 // Free the temporary used for the data movement.
2616 FreeTemp(temp);
2617 } else {
2618 // Moving 32-bits via general purpose register.
2619 bytes_to_move = sizeof(uint32_t);
2620
2621 // Instead of allocating a new temp, simply reuse one of the registers being used
2622 // for argument passing.
2623 RegStorage temp = TargetReg(kArg3, kNotWide);
2624
2625 // Now load the argument VR and store to the outs.
2626 Load32Disp(TargetPtrReg(kSp), current_src_offset, temp);
2627 Store32Disp(TargetPtrReg(kSp), current_dest_offset, temp);
2628 }
2629
2630 current_src_offset += bytes_to_move;
2631 current_dest_offset += bytes_to_move;
2632 count -= (bytes_to_move >> 2);
2633 }
2634 DCHECK_EQ(count, 0);
2635 return count;
2636}
2637
Brian Carlstrom7934ac22013-07-26 10:54:15 -07002638} // namespace art