blob: 25fb8869b609dda2404cf15875d16dd89fb162ca [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"
Mathieu Chartiere401d142015-04-22 13:56:20 -070024#include "art_method.h"
Andreas Gampe53c913b2014-08-12 23:19:23 -070025#include "backend_x86.h"
Andreas Gampe0b9203e2015-01-22 20:39:27 -080026#include "base/logging.h"
27#include "dex/compiler_ir.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070028#include "dex/quick/mir_to_lir-inl.h"
buzbeeb5860fb2014-06-21 15:31:01 -070029#include "dex/reg_storage_eq.h"
Andreas Gampe0b9203e2015-01-22 20:39:27 -080030#include "driver/compiler_driver.h"
Ian Rogers7e70b002014-10-08 11:47:24 -070031#include "mirror/array-inl.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
Roland Levillain4b8f1ec2015-08-26 18:34:03 +0100257RegStorage X86Mir2Lir::TargetReg(SpecialTargetRegister reg ATTRIBUTE_UNUSED) {
Chao-ying Fua77ee512014-07-01 17:43:41 -0700258 LOG(FATAL) << "Do not use this function!!!";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700259 UNREACHABLE();
Chao-ying Fua77ee512014-07-01 17:43:41 -0700260}
261
Brian Carlstrom7940e442013-07-12 13:46:57 -0700262/*
263 * Decode the register id.
264 */
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100265ResourceMask X86Mir2Lir::GetRegMaskCommon(const RegStorage& reg) const {
266 /* Double registers in x86 are just a single FP register. This is always just a single bit. */
267 return ResourceMask::Bit(
268 /* FP register starts at bit position 16 */
269 ((reg.IsFloat() || reg.StorageSize() > 8) ? kX86FPReg0 : 0) + reg.GetRegNum());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700270}
271
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100272ResourceMask X86Mir2Lir::GetPCUseDefEncoding() const {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100273 return kEncodeNone;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700274}
275
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100276void X86Mir2Lir::SetupTargetResourceMasks(LIR* lir, uint64_t flags,
277 ResourceMask* use_mask, ResourceMask* def_mask) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700278 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
buzbeeb48819d2013-09-14 16:15:25 -0700279 DCHECK(!lir->flags.use_def_invalid);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700280
281 // X86-specific resource map setup here.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700282 if (flags & REG_USE_SP) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100283 use_mask->SetBit(kX86RegSP);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700284 }
285
286 if (flags & REG_DEF_SP) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100287 def_mask->SetBit(kX86RegSP);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700288 }
289
290 if (flags & REG_DEFA) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100291 SetupRegMask(def_mask, rs_rAX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700292 }
293
294 if (flags & REG_DEFD) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100295 SetupRegMask(def_mask, rs_rDX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700296 }
297 if (flags & REG_USEA) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100298 SetupRegMask(use_mask, rs_rAX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700299 }
300
301 if (flags & REG_USEC) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100302 SetupRegMask(use_mask, rs_rCX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700303 }
304
305 if (flags & REG_USED) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100306 SetupRegMask(use_mask, rs_rDX.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700307 }
Vladimir Marko70b797d2013-12-03 15:25:24 +0000308
309 if (flags & REG_USEB) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100310 SetupRegMask(use_mask, rs_rBX.GetReg());
Vladimir Marko70b797d2013-12-03 15:25:24 +0000311 }
Mark Mendell4028a6c2014-02-19 20:06:20 -0800312
313 // Fixup hard to describe instruction: Uses rAX, rCX, rDI; sets rDI.
314 if (lir->opcode == kX86RepneScasw) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100315 SetupRegMask(use_mask, rs_rAX.GetReg());
316 SetupRegMask(use_mask, rs_rCX.GetReg());
317 SetupRegMask(use_mask, rs_rDI.GetReg());
318 SetupRegMask(def_mask, rs_rDI.GetReg());
Mark Mendell4028a6c2014-02-19 20:06:20 -0800319 }
Serguei Katkove90501d2014-03-12 15:56:54 +0700320
321 if (flags & USE_FP_STACK) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100322 use_mask->SetBit(kX86FPStack);
323 def_mask->SetBit(kX86FPStack);
Serguei Katkove90501d2014-03-12 15:56:54 +0700324 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700325}
326
327/* For dumping instructions */
328static const char* x86RegName[] = {
329 "rax", "rcx", "rdx", "rbx", "rsp", "rbp", "rsi", "rdi",
330 "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15"
331};
332
333static const char* x86CondName[] = {
334 "O",
335 "NO",
336 "B/NAE/C",
337 "NB/AE/NC",
338 "Z/EQ",
339 "NZ/NE",
340 "BE/NA",
341 "NBE/A",
342 "S",
343 "NS",
344 "P/PE",
345 "NP/PO",
346 "L/NGE",
347 "NL/GE",
348 "LE/NG",
349 "NLE/G"
350};
351
352/*
353 * Interpret a format string and build a string no longer than size
354 * See format key in Assemble.cc.
355 */
356std::string X86Mir2Lir::BuildInsnString(const char *fmt, LIR *lir, unsigned char* base_addr) {
357 std::string buf;
358 size_t i = 0;
359 size_t fmt_len = strlen(fmt);
360 while (i < fmt_len) {
361 if (fmt[i] != '!') {
362 buf += fmt[i];
363 i++;
364 } else {
365 i++;
366 DCHECK_LT(i, fmt_len);
367 char operand_number_ch = fmt[i];
368 i++;
369 if (operand_number_ch == '!') {
370 buf += "!";
371 } else {
372 int operand_number = operand_number_ch - '0';
373 DCHECK_LT(operand_number, 6); // Expect upto 6 LIR operands.
374 DCHECK_LT(i, fmt_len);
375 int operand = lir->operands[operand_number];
376 switch (fmt[i]) {
377 case 'c':
378 DCHECK_LT(static_cast<size_t>(operand), sizeof(x86CondName));
379 buf += x86CondName[operand];
380 break;
381 case 'd':
382 buf += StringPrintf("%d", operand);
383 break;
Yixin Shou5192cbb2014-07-01 13:48:17 -0400384 case 'q': {
385 int64_t value = static_cast<int64_t>(static_cast<int64_t>(operand) << 32 |
386 static_cast<uint32_t>(lir->operands[operand_number+1]));
387 buf +=StringPrintf("%" PRId64, value);
Haitao Fenge70f1792014-08-09 08:31:02 +0800388 break;
Yixin Shou5192cbb2014-07-01 13:48:17 -0400389 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700390 case 'p': {
Vladimir Markof6737f72015-03-23 17:05:14 +0000391 const EmbeddedData* tab_rec = UnwrapPointer<EmbeddedData>(operand);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700392 buf += StringPrintf("0x%08x", tab_rec->offset);
393 break;
394 }
395 case 'r':
buzbee091cc402014-03-31 10:14:40 -0700396 if (RegStorage::IsFloat(operand)) {
397 int fp_reg = RegStorage::RegNum(operand);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700398 buf += StringPrintf("xmm%d", fp_reg);
399 } else {
buzbee091cc402014-03-31 10:14:40 -0700400 int reg_num = RegStorage::RegNum(operand);
401 DCHECK_LT(static_cast<size_t>(reg_num), sizeof(x86RegName));
402 buf += x86RegName[reg_num];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700403 }
404 break;
405 case 't':
Ian Rogers107c31e2014-01-23 20:55:29 -0800406 buf += StringPrintf("0x%08" PRIxPTR " (L%p)",
407 reinterpret_cast<uintptr_t>(base_addr) + lir->offset + operand,
408 lir->target);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700409 break;
410 default:
411 buf += StringPrintf("DecodeError '%c'", fmt[i]);
412 break;
413 }
414 i++;
415 }
416 }
417 }
418 return buf;
419}
420
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100421void X86Mir2Lir::DumpResourceMask(LIR *x86LIR, const ResourceMask& mask, const char *prefix) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700422 char buf[256];
423 buf[0] = 0;
424
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100425 if (mask.Equals(kEncodeAll)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700426 strcpy(buf, "all");
427 } else {
428 char num[8];
429 int i;
430
431 for (i = 0; i < kX86RegEnd; i++) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100432 if (mask.HasBit(i)) {
Ian Rogers988e6ea2014-01-08 11:30:50 -0800433 snprintf(num, arraysize(num), "%d ", i);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700434 strcat(buf, num);
435 }
436 }
437
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100438 if (mask.HasBit(ResourceMask::kCCode)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700439 strcat(buf, "cc ");
440 }
441 /* Memory bits */
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100442 if (x86LIR && (mask.HasBit(ResourceMask::kDalvikReg))) {
Ian Rogers988e6ea2014-01-08 11:30:50 -0800443 snprintf(buf + strlen(buf), arraysize(buf) - strlen(buf), "dr%d%s",
444 DECODE_ALIAS_INFO_REG(x86LIR->flags.alias_info),
445 (DECODE_ALIAS_INFO_WIDE(x86LIR->flags.alias_info)) ? "(+1)" : "");
Brian Carlstrom7940e442013-07-12 13:46:57 -0700446 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100447 if (mask.HasBit(ResourceMask::kLiteral)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700448 strcat(buf, "lit ");
449 }
450
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100451 if (mask.HasBit(ResourceMask::kHeapRef)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700452 strcat(buf, "heap ");
453 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100454 if (mask.HasBit(ResourceMask::kMustNotAlias)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700455 strcat(buf, "noalias ");
456 }
457 }
458 if (buf[0]) {
459 LOG(INFO) << prefix << ": " << buf;
460 }
461}
462
463void X86Mir2Lir::AdjustSpillMask() {
464 // Adjustment for LR spilling, x86 has no LR so nothing to do here
buzbee091cc402014-03-31 10:14:40 -0700465 core_spill_mask_ |= (1 << rs_rRET.GetRegNum());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700466 num_core_spills_++;
467}
468
Mark Mendelle87f9b52014-04-30 14:13:18 -0400469RegStorage X86Mir2Lir::AllocateByteRegister() {
Chao-ying Fu7e399fd2014-06-10 18:11:11 -0700470 RegStorage reg = AllocTypedTemp(false, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +0700471 if (!cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800472 DCHECK_LT(reg.GetRegNum(), rs_rX86_SP_32.GetRegNum());
Chao-ying Fu7e399fd2014-06-10 18:11:11 -0700473 }
474 return reg;
475}
476
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700477RegStorage X86Mir2Lir::Get128BitRegister(RegStorage reg) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -0700478 return GetRegInfo(reg)->Master()->GetReg();
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700479}
480
Ian Rogersb28c1c02014-11-08 11:21:21 -0800481bool X86Mir2Lir::IsByteRegister(RegStorage reg) const {
482 return cu_->target64 || reg.GetRegNum() < rs_rX86_SP_32.GetRegNum();
Mark Mendelle87f9b52014-04-30 14:13:18 -0400483}
484
Brian Carlstrom7940e442013-07-12 13:46:57 -0700485/* Clobber all regs that might be used by an external C call */
Vladimir Marko31c2aac2013-12-09 16:31:19 +0000486void X86Mir2Lir::ClobberCallerSave() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700487 if (cu_->target64) {
Serguei Katkovc3801912014-07-08 17:21:53 +0700488 Clobber(rs_rAX);
489 Clobber(rs_rCX);
490 Clobber(rs_rDX);
491 Clobber(rs_rSI);
492 Clobber(rs_rDI);
493
Chao-ying Fu35ec2b52014-06-16 16:40:31 -0700494 Clobber(rs_r8);
495 Clobber(rs_r9);
496 Clobber(rs_r10);
497 Clobber(rs_r11);
498
499 Clobber(rs_fr8);
500 Clobber(rs_fr9);
501 Clobber(rs_fr10);
502 Clobber(rs_fr11);
Serguei Katkovc3801912014-07-08 17:21:53 +0700503 } else {
504 Clobber(rs_rAX);
505 Clobber(rs_rCX);
506 Clobber(rs_rDX);
507 Clobber(rs_rBX);
Chao-ying Fu35ec2b52014-06-16 16:40:31 -0700508 }
Serguei Katkovc3801912014-07-08 17:21:53 +0700509
510 Clobber(rs_fr0);
511 Clobber(rs_fr1);
512 Clobber(rs_fr2);
513 Clobber(rs_fr3);
514 Clobber(rs_fr4);
515 Clobber(rs_fr5);
516 Clobber(rs_fr6);
517 Clobber(rs_fr7);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700518}
519
520RegLocation X86Mir2Lir::GetReturnWideAlt() {
521 RegLocation res = LocCReturnWide();
Ian Rogersb28c1c02014-11-08 11:21:21 -0800522 DCHECK_EQ(res.reg.GetLowReg(), rs_rAX.GetReg());
523 DCHECK_EQ(res.reg.GetHighReg(), rs_rDX.GetReg());
buzbee091cc402014-03-31 10:14:40 -0700524 Clobber(rs_rAX);
525 Clobber(rs_rDX);
526 MarkInUse(rs_rAX);
527 MarkInUse(rs_rDX);
528 MarkWide(res.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700529 return res;
530}
531
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700532RegLocation X86Mir2Lir::GetReturnAlt() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700533 RegLocation res = LocCReturn();
buzbee091cc402014-03-31 10:14:40 -0700534 res.reg.SetReg(rs_rDX.GetReg());
535 Clobber(rs_rDX);
536 MarkInUse(rs_rDX);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700537 return res;
538}
539
Brian Carlstrom7940e442013-07-12 13:46:57 -0700540/* To be used when explicitly managing register use */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700541void X86Mir2Lir::LockCallTemps() {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800542 LockTemp(TargetReg32(kArg0));
543 LockTemp(TargetReg32(kArg1));
544 LockTemp(TargetReg32(kArg2));
545 LockTemp(TargetReg32(kArg3));
Mark P Mendell966c3ae2015-01-27 15:45:27 +0000546 LockTemp(TargetReg32(kFArg0));
547 LockTemp(TargetReg32(kFArg1));
548 LockTemp(TargetReg32(kFArg2));
549 LockTemp(TargetReg32(kFArg3));
Elena Sayapinadd644502014-07-01 18:39:52 +0700550 if (cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800551 LockTemp(TargetReg32(kArg4));
552 LockTemp(TargetReg32(kArg5));
Ian Rogersb28c1c02014-11-08 11:21:21 -0800553 LockTemp(TargetReg32(kFArg4));
554 LockTemp(TargetReg32(kFArg5));
555 LockTemp(TargetReg32(kFArg6));
556 LockTemp(TargetReg32(kFArg7));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700557 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700558}
559
560/* To be used when explicitly managing register use */
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700561void X86Mir2Lir::FreeCallTemps() {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800562 FreeTemp(TargetReg32(kArg0));
563 FreeTemp(TargetReg32(kArg1));
564 FreeTemp(TargetReg32(kArg2));
565 FreeTemp(TargetReg32(kArg3));
Vladimir Markobfe400b2014-12-19 19:27:26 +0000566 FreeTemp(TargetReg32(kHiddenArg));
Mark P Mendell966c3ae2015-01-27 15:45:27 +0000567 FreeTemp(TargetReg32(kFArg0));
568 FreeTemp(TargetReg32(kFArg1));
569 FreeTemp(TargetReg32(kFArg2));
570 FreeTemp(TargetReg32(kFArg3));
Elena Sayapinadd644502014-07-01 18:39:52 +0700571 if (cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800572 FreeTemp(TargetReg32(kArg4));
573 FreeTemp(TargetReg32(kArg5));
Ian Rogersb28c1c02014-11-08 11:21:21 -0800574 FreeTemp(TargetReg32(kFArg4));
575 FreeTemp(TargetReg32(kFArg5));
576 FreeTemp(TargetReg32(kFArg6));
577 FreeTemp(TargetReg32(kFArg7));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +0700578 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700579}
580
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800581bool X86Mir2Lir::ProvidesFullMemoryBarrier(X86OpCode opcode) {
582 switch (opcode) {
583 case kX86LockCmpxchgMR:
584 case kX86LockCmpxchgAR:
Ian Rogers0f9b9c52014-06-09 01:32:12 -0700585 case kX86LockCmpxchg64M:
586 case kX86LockCmpxchg64A:
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800587 case kX86XchgMR:
588 case kX86Mfence:
589 // Atomic memory instructions provide full barrier.
590 return true;
591 default:
592 break;
593 }
594
595 // Conservative if cannot prove it provides full barrier.
596 return false;
597}
598
Andreas Gampeb14329f2014-05-15 11:16:06 -0700599bool X86Mir2Lir::GenMemBarrier(MemBarrierKind barrier_kind) {
Andreas Gampe0b9203e2015-01-22 20:39:27 -0800600 if (!cu_->compiler_driver->GetInstructionSetFeatures()->IsSmp()) {
Elliott Hughes8366ca02014-11-17 12:02:05 -0800601 return false;
602 }
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800603 // Start off with using the last LIR as the barrier. If it is not enough, then we will update it.
604 LIR* mem_barrier = last_lir_insn_;
605
Andreas Gampeb14329f2014-05-15 11:16:06 -0700606 bool ret = false;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800607 /*
Hans Boehm48f5c472014-06-27 14:50:10 -0700608 * According to the JSR-133 Cookbook, for x86 only StoreLoad/AnyAny barriers need memory fence.
609 * All other barriers (LoadAny, AnyStore, StoreStore) are nops due to the x86 memory model.
610 * 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 -0800611 */
Hans Boehm48f5c472014-06-27 14:50:10 -0700612 if (barrier_kind == kAnyAny) {
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800613 // If no LIR exists already that can be used a barrier, then generate an mfence.
614 if (mem_barrier == nullptr) {
615 mem_barrier = NewLIR0(kX86Mfence);
Andreas Gampeb14329f2014-05-15 11:16:06 -0700616 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800617 }
618
619 // If last instruction does not provide full barrier, then insert an mfence.
620 if (ProvidesFullMemoryBarrier(static_cast<X86OpCode>(mem_barrier->opcode)) == false) {
621 mem_barrier = NewLIR0(kX86Mfence);
Andreas Gampeb14329f2014-05-15 11:16:06 -0700622 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800623 }
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -0700624 } else if (barrier_kind == kNTStoreStore) {
625 mem_barrier = NewLIR0(kX86Sfence);
626 ret = true;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800627 }
628
629 // Now ensure that a scheduling barrier is in place.
630 if (mem_barrier == nullptr) {
631 GenBarrier();
632 } else {
633 // Mark as a scheduling barrier.
634 DCHECK(!mem_barrier->flags.use_def_invalid);
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100635 mem_barrier->u.m.def_mask = &kEncodeAll;
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800636 }
Andreas Gampeb14329f2014-05-15 11:16:06 -0700637 return ret;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700638}
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000639
Brian Carlstrom7940e442013-07-12 13:46:57 -0700640void X86Mir2Lir::CompilerInitializeRegAlloc() {
Elena Sayapinadd644502014-07-01 18:39:52 +0700641 if (cu_->target64) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100642 reg_pool_.reset(new (arena_) RegisterPool(this, arena_, core_regs_64, core_regs_64q, sp_regs_64,
643 dp_regs_64, reserved_regs_64, reserved_regs_64q,
644 core_temps_64, core_temps_64q,
645 sp_temps_64, dp_temps_64));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700646 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100647 reg_pool_.reset(new (arena_) RegisterPool(this, arena_, core_regs_32, empty_pool, sp_regs_32,
648 dp_regs_32, reserved_regs_32, empty_pool,
649 core_temps_32, empty_pool,
650 sp_temps_32, dp_temps_32));
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700651 }
buzbee091cc402014-03-31 10:14:40 -0700652
653 // Target-specific adjustments.
654
Mark Mendellfe945782014-05-22 09:52:36 -0400655 // Add in XMM registers.
Serguei Katkovc3801912014-07-08 17:21:53 +0700656 const ArrayRef<const RegStorage> *xp_regs = cu_->target64 ? &xp_regs_64 : &xp_regs_32;
657 for (RegStorage reg : *xp_regs) {
Mark Mendellfe945782014-05-22 09:52:36 -0400658 RegisterInfo* info = new (arena_) RegisterInfo(reg, GetRegMaskCommon(reg));
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100659 reginfo_map_[reg.GetReg()] = info;
Serguei Katkovc3801912014-07-08 17:21:53 +0700660 }
661 const ArrayRef<const RegStorage> *xp_temps = cu_->target64 ? &xp_temps_64 : &xp_temps_32;
662 for (RegStorage reg : *xp_temps) {
663 RegisterInfo* xp_reg_info = GetRegInfo(reg);
664 xp_reg_info->SetIsTemp(true);
Mark Mendellfe945782014-05-22 09:52:36 -0400665 }
666
Mark Mendell27dee8b2014-12-01 19:06:12 -0500667 // Special Handling for x86_64 RIP addressing.
668 if (cu_->target64) {
669 RegisterInfo* info = new (arena_) RegisterInfo(RegStorage(kRIPReg), kEncodeNone);
670 reginfo_map_[kRIPReg] = info;
671 }
672
buzbee091cc402014-03-31 10:14:40 -0700673 // Alias single precision xmm to double xmms.
674 // TODO: as needed, add larger vector sizes - alias all to the largest.
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100675 for (RegisterInfo* info : reg_pool_->sp_regs_) {
buzbee091cc402014-03-31 10:14:40 -0700676 int sp_reg_num = info->GetReg().GetRegNum();
Mark Mendellfe945782014-05-22 09:52:36 -0400677 RegStorage xp_reg = RegStorage::Solo128(sp_reg_num);
678 RegisterInfo* xp_reg_info = GetRegInfo(xp_reg);
679 // 128-bit xmm vector register's master storage should refer to itself.
680 DCHECK_EQ(xp_reg_info, xp_reg_info->Master());
681
682 // Redirect 32-bit vector's master storage to 128-bit vector.
683 info->SetMaster(xp_reg_info);
684
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700685 RegStorage dp_reg = RegStorage::FloatSolo64(sp_reg_num);
buzbee091cc402014-03-31 10:14:40 -0700686 RegisterInfo* dp_reg_info = GetRegInfo(dp_reg);
Mark Mendellfe945782014-05-22 09:52:36 -0400687 // Redirect 64-bit vector's master storage to 128-bit vector.
688 dp_reg_info->SetMaster(xp_reg_info);
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700689 // Singles should show a single 32-bit mask bit, at first referring to the low half.
690 DCHECK_EQ(info->StorageMask(), 0x1U);
691 }
692
Elena Sayapinadd644502014-07-01 18:39:52 +0700693 if (cu_->target64) {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700694 // Alias 32bit W registers to corresponding 64bit X registers.
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100695 for (RegisterInfo* info : reg_pool_->core_regs_) {
Dmitry Petrochenko76af0d32014-06-05 21:15:08 +0700696 int x_reg_num = info->GetReg().GetRegNum();
697 RegStorage x_reg = RegStorage::Solo64(x_reg_num);
698 RegisterInfo* x_reg_info = GetRegInfo(x_reg);
699 // 64bit X register's master storage should refer to itself.
700 DCHECK_EQ(x_reg_info, x_reg_info->Master());
701 // Redirect 32bit W master storage to 64bit X.
702 info->SetMaster(x_reg_info);
703 // 32bit W should show a single 32-bit mask bit, at first referring to the low half.
704 DCHECK_EQ(info->StorageMask(), 0x1U);
705 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700706 }
buzbee091cc402014-03-31 10:14:40 -0700707
708 // Don't start allocating temps at r0/s0/d0 or you may clobber return regs in early-exit methods.
709 // TODO: adjust for x86/hard float calling convention.
710 reg_pool_->next_core_reg_ = 2;
711 reg_pool_->next_sp_reg_ = 2;
712 reg_pool_->next_dp_reg_ = 1;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700713}
714
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700715int X86Mir2Lir::VectorRegisterSize() {
716 return 128;
717}
718
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -0700719int X86Mir2Lir::NumReservableVectorRegisters(bool long_or_fp) {
720 int num_vector_temps = cu_->target64 ? xp_temps_64.size() : xp_temps_32.size();
721
722 // Leave a few temps for use by backend as scratch.
723 return long_or_fp ? num_vector_temps - 2 : num_vector_temps - 1;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -0700724}
725
David Srbecky1109fb32015-04-07 20:21:06 +0100726static dwarf::Reg DwarfCoreReg(bool is_x86_64, int num) {
727 return is_x86_64 ? dwarf::Reg::X86_64Core(num) : dwarf::Reg::X86Core(num);
728}
729
730static dwarf::Reg DwarfFpReg(bool is_x86_64, int num) {
731 return is_x86_64 ? dwarf::Reg::X86_64Fp(num) : dwarf::Reg::X86Fp(num);
732}
733
Brian Carlstrom7940e442013-07-12 13:46:57 -0700734void X86Mir2Lir::SpillCoreRegs() {
735 if (num_core_spills_ == 0) {
736 return;
737 }
738 // Spill mask not including fake return address register
buzbee091cc402014-03-31 10:14:40 -0700739 uint32_t mask = core_spill_mask_ & ~(1 << rs_rRET.GetRegNum());
Ian Rogersb28c1c02014-11-08 11:21:21 -0800740 int offset =
741 frame_size_ - (GetInstructionSetPointerSize(cu_->instruction_set) * num_core_spills_);
Serguei Katkovc3801912014-07-08 17:21:53 +0700742 OpSize size = cu_->target64 ? k64 : k32;
Ian Rogersb28c1c02014-11-08 11:21:21 -0800743 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
David Srbecky1109fb32015-04-07 20:21:06 +0100744 for (int reg = 0; mask != 0u; mask >>= 1, reg++) {
745 if ((mask & 0x1) != 0u) {
Mathieu Chartiere401d142015-04-22 13:56:20 -0700746 DCHECK_NE(offset, 0) << "offset 0 should be for method";
David Srbecky1109fb32015-04-07 20:21:06 +0100747 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)
Roland Levillain4b8f1ec2015-08-26 18:34:03 +0100863RegStorage X86Mir2Lir::LoadHelper(QuickEntrypointEnum trampoline ATTRIBUTE_UNUSED) {
Andreas Gampe2f244e92014-05-08 03:35:25 -0700864 LOG(FATAL) << "Unexpected use of LoadHelper in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700865 UNREACHABLE();
Andreas Gampe2f244e92014-05-08 03:35:25 -0700866}
867
Dave Allisonb373e092014-02-20 16:06:36 -0800868LIR* X86Mir2Lir::CheckSuspendUsingLoad() {
Dave Allison69dfe512014-07-11 17:11:58 +0000869 // First load the pointer in fs:[suspend-trigger] into eax
870 // Then use a test instruction to indirect via that address.
Dave Allisondfd3b472014-07-16 16:04:32 -0700871 if (cu_->target64) {
872 NewLIR2(kX86Mov64RT, rs_rAX.GetReg(),
873 Thread::ThreadSuspendTriggerOffset<8>().Int32Value());
874 } else {
875 NewLIR2(kX86Mov32RT, rs_rAX.GetReg(),
876 Thread::ThreadSuspendTriggerOffset<4>().Int32Value());
877 }
Dave Allison69dfe512014-07-11 17:11:58 +0000878 return NewLIR3(kX86Test32RM, rs_rAX.GetReg(), rs_rAX.GetReg(), 0);
Dave Allisonb373e092014-02-20 16:06:36 -0800879}
880
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700881uint64_t X86Mir2Lir::GetTargetInstFlags(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700882 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700883 return X86Mir2Lir::EncodingMap[opcode].flags;
884}
885
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700886const char* X86Mir2Lir::GetTargetInstName(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700887 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700888 return X86Mir2Lir::EncodingMap[opcode].name;
889}
890
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700891const char* X86Mir2Lir::GetTargetInstFmt(int opcode) {
buzbee409fe942013-10-11 10:49:56 -0700892 DCHECK(!IsPseudoLirOp(opcode));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700893 return X86Mir2Lir::EncodingMap[opcode].fmt;
894}
895
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000896void X86Mir2Lir::GenConstWide(RegLocation rl_dest, int64_t value) {
897 // Can we do this directly to memory?
898 rl_dest = UpdateLocWide(rl_dest);
899 if ((rl_dest.location == kLocDalvikFrame) ||
900 (rl_dest.location == kLocCompilerTemp)) {
901 int32_t val_lo = Low32Bits(value);
902 int32_t val_hi = High32Bits(value);
Ian Rogersb28c1c02014-11-08 11:21:21 -0800903 int r_base = rs_rX86_SP_32.GetReg();
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000904 int displacement = SRegOffset(rl_dest.s_reg_low);
905
Vladimir Marko8dea81c2014-06-06 14:50:36 +0100906 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
buzbee2700f7e2014-03-07 09:46:20 -0800907 LIR * store = NewLIR3(kX86Mov32MI, r_base, displacement + LOWORD_OFFSET, val_lo);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000908 AnnotateDalvikRegAccess(store, (displacement + LOWORD_OFFSET) >> 2,
909 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -0800910 store = NewLIR3(kX86Mov32MI, r_base, displacement + HIWORD_OFFSET, val_hi);
Bill Buzbeed61ba4b2014-01-13 21:44:01 +0000911 AnnotateDalvikRegAccess(store, (displacement + HIWORD_OFFSET) >> 2,
912 false /* is_load */, true /* is64bit */);
913 return;
914 }
915
916 // Just use the standard code to do the generation.
917 Mir2Lir::GenConstWide(rl_dest, value);
918}
Mark Mendelle02d48f2014-01-15 11:19:23 -0800919
920// TODO: Merge with existing RegLocation dumper in vreg_analysis.cc
921void X86Mir2Lir::DumpRegLocation(RegLocation loc) {
922 LOG(INFO) << "location: " << loc.location << ','
923 << (loc.wide ? " w" : " ")
924 << (loc.defined ? " D" : " ")
925 << (loc.is_const ? " c" : " ")
926 << (loc.fp ? " F" : " ")
927 << (loc.core ? " C" : " ")
928 << (loc.ref ? " r" : " ")
929 << (loc.high_word ? " h" : " ")
930 << (loc.home ? " H" : " ")
buzbee2700f7e2014-03-07 09:46:20 -0800931 << ", low: " << static_cast<int>(loc.reg.GetLowReg())
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000932 << ", high: " << static_cast<int>(loc.reg.GetHighReg())
Mark Mendelle02d48f2014-01-15 11:19:23 -0800933 << ", s_reg: " << loc.s_reg_low
934 << ", orig: " << loc.orig_sreg;
935}
936
Jeff Hao49161ce2014-03-12 11:05:25 -0700937void X86Mir2Lir::LoadMethodAddress(const MethodReference& target_method, InvokeType type,
Mark Mendell55d0eac2014-02-06 11:02:52 -0800938 SpecialTargetRegister symbolic_reg) {
939 /*
940 * For x86, just generate a 32 bit move immediate instruction, that will be filled
941 * in at 'link time'. For now, put a unique value based on target to ensure that
942 * code deduplication works.
943 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700944 int target_method_idx = target_method.dex_method_index;
945 const DexFile* target_dex_file = target_method.dex_file;
946 const DexFile::MethodId& target_method_id = target_dex_file->GetMethodId(target_method_idx);
947 uintptr_t target_method_id_ptr = reinterpret_cast<uintptr_t>(&target_method_id);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800948
Jeff Hao49161ce2014-03-12 11:05:25 -0700949 // Generate the move instruction with the unique pointer and save index, dex_file, and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700950 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
951 TargetReg(symbolic_reg, kNotWide).GetReg(),
Jeff Hao49161ce2014-03-12 11:05:25 -0700952 static_cast<int>(target_method_id_ptr), target_method_idx,
953 WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800954 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100955 method_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800956}
957
Fred Shihe7f82e22014-08-06 10:46:37 -0700958void X86Mir2Lir::LoadClassType(const DexFile& dex_file, uint32_t type_idx,
959 SpecialTargetRegister symbolic_reg) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800960 /*
961 * For x86, just generate a 32 bit move immediate instruction, that will be filled
962 * in at 'link time'. For now, put a unique value based on target to ensure that
963 * code deduplication works.
964 */
Fred Shihe7f82e22014-08-06 10:46:37 -0700965 const DexFile::TypeId& id = dex_file.GetTypeId(type_idx);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800966 uintptr_t ptr = reinterpret_cast<uintptr_t>(&id);
967
968 // Generate the move instruction with the unique pointer and save index and type.
Andreas Gampeccc60262014-07-04 18:02:38 -0700969 LIR *move = RawLIR(current_dalvik_offset_, kX86Mov32RI,
970 TargetReg(symbolic_reg, kNotWide).GetReg(),
Fred Shihe7f82e22014-08-06 10:46:37 -0700971 static_cast<int>(ptr), type_idx,
972 WrapPointer(const_cast<DexFile*>(&dex_file)));
Mark Mendell55d0eac2014-02-06 11:02:52 -0800973 AppendLIR(move);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100974 class_type_address_insns_.push_back(move);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800975}
976
Vladimir Markof4da6752014-08-01 19:04:18 +0100977LIR* X86Mir2Lir::CallWithLinkerFixup(const MethodReference& target_method, InvokeType type) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800978 /*
979 * For x86, just generate a 32 bit call relative instruction, that will be filled
Vladimir Markof4da6752014-08-01 19:04:18 +0100980 * in at 'link time'.
Mark Mendell55d0eac2014-02-06 11:02:52 -0800981 */
Jeff Hao49161ce2014-03-12 11:05:25 -0700982 int target_method_idx = target_method.dex_method_index;
983 const DexFile* target_dex_file = target_method.dex_file;
Mark Mendell55d0eac2014-02-06 11:02:52 -0800984
Jeff Hao49161ce2014-03-12 11:05:25 -0700985 // Generate the call instruction with the unique pointer and save index, dex_file, and type.
Vladimir Markof4da6752014-08-01 19:04:18 +0100986 // NOTE: Method deduplication takes linker patches into account, so we can just pass 0
987 // as a placeholder for the offset.
988 LIR* call = RawLIR(current_dalvik_offset_, kX86CallI, 0,
Jeff Hao49161ce2014-03-12 11:05:25 -0700989 target_method_idx, WrapPointer(const_cast<DexFile*>(target_dex_file)), type);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800990 AppendLIR(call);
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100991 call_method_insns_.push_back(call);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800992 return call;
993}
994
Vladimir Markof4da6752014-08-01 19:04:18 +0100995static LIR* GenInvokeNoInlineCall(Mir2Lir* mir_to_lir, InvokeType type) {
996 QuickEntrypointEnum trampoline;
997 switch (type) {
998 case kInterface:
999 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
1000 break;
1001 case kDirect:
1002 trampoline = kQuickInvokeDirectTrampolineWithAccessCheck;
1003 break;
1004 case kStatic:
1005 trampoline = kQuickInvokeStaticTrampolineWithAccessCheck;
1006 break;
1007 case kSuper:
1008 trampoline = kQuickInvokeSuperTrampolineWithAccessCheck;
1009 break;
1010 case kVirtual:
1011 trampoline = kQuickInvokeVirtualTrampolineWithAccessCheck;
1012 break;
1013 default:
1014 LOG(FATAL) << "Unexpected invoke type";
1015 trampoline = kQuickInvokeInterfaceTrampolineWithAccessCheck;
1016 }
1017 return mir_to_lir->InvokeTrampoline(kOpBlx, RegStorage::InvalidReg(), trampoline);
1018}
1019
1020LIR* X86Mir2Lir::GenCallInsn(const MirMethodLoweringInfo& method_info) {
1021 LIR* call_insn;
1022 if (method_info.FastPath()) {
1023 if (method_info.DirectCode() == static_cast<uintptr_t>(-1)) {
1024 // We can have the linker fixup a call relative.
1025 call_insn = CallWithLinkerFixup(method_info.GetTargetMethod(), method_info.GetSharpType());
1026 } else {
1027 call_insn = OpMem(kOpBlx, TargetReg(kArg0, kRef),
Mathieu Chartiere401d142015-04-22 13:56:20 -07001028 ArtMethod::EntryPointFromQuickCompiledCodeOffset(
Mathieu Chartier2d721012014-11-10 11:08:06 -08001029 cu_->target64 ? 8 : 4).Int32Value());
Vladimir Markof4da6752014-08-01 19:04:18 +01001030 }
1031 } else {
1032 call_insn = GenInvokeNoInlineCall(this, method_info.GetSharpType());
1033 }
1034 return call_insn;
1035}
1036
Mark Mendell55d0eac2014-02-06 11:02:52 -08001037void X86Mir2Lir::InstallLiteralPools() {
1038 // These are handled differently for x86.
1039 DCHECK(code_literal_list_ == nullptr);
1040 DCHECK(method_literal_list_ == nullptr);
1041 DCHECK(class_literal_list_ == nullptr);
1042
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001043
Mark Mendelld65c51a2014-04-29 16:55:20 -04001044 if (const_vectors_ != nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001045 // Vector literals must be 16-byte aligned. The header that is placed
1046 // in the code section causes misalignment so we take it into account.
1047 // Otherwise, we are sure that for x86 method is aligned to 16.
1048 DCHECK_EQ(GetInstructionSetAlignment(cu_->instruction_set), 16u);
1049 uint32_t bytes_to_fill = (0x10 - ((code_buffer_.size() + sizeof(OatQuickMethodHeader)) & 0xF)) & 0xF;
1050 while (bytes_to_fill > 0) {
1051 code_buffer_.push_back(0);
1052 bytes_to_fill--;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001053 }
1054
Mark Mendelld65c51a2014-04-29 16:55:20 -04001055 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Vladimir Marko80b96d12015-02-19 15:50:28 +00001056 Push32(&code_buffer_, p->operands[0]);
1057 Push32(&code_buffer_, p->operands[1]);
1058 Push32(&code_buffer_, p->operands[2]);
1059 Push32(&code_buffer_, p->operands[3]);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001060 }
1061 }
1062
Vladimir Markodc56cc52015-03-27 18:18:36 +00001063 patches_.reserve(method_address_insns_.size() + class_type_address_insns_.size() +
1064 call_method_insns_.size() + dex_cache_access_insns_.size());
1065
Mark Mendell55d0eac2014-02-06 11:02:52 -08001066 // Handle the fixups for methods.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001067 for (LIR* p : method_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001068 DCHECK_EQ(p->opcode, kX86Mov32RI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001069 uint32_t target_method_idx = p->operands[2];
Vladimir Markof6737f72015-03-23 17:05:14 +00001070 const DexFile* target_dex_file = UnwrapPointer<DexFile>(p->operands[3]);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001071
1072 // The offset to patch is the last 4 bytes of the instruction.
1073 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001074 patches_.push_back(LinkerPatch::MethodPatch(patch_offset,
1075 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001076 }
1077
1078 // Handle the fixups for class types.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001079 for (LIR* p : class_type_address_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001080 DCHECK_EQ(p->opcode, kX86Mov32RI);
Fred Shihe7f82e22014-08-06 10:46:37 -07001081
Vladimir Markof6737f72015-03-23 17:05:14 +00001082 const DexFile* class_dex_file = UnwrapPointer<DexFile>(p->operands[3]);
Vladimir Markof4da6752014-08-01 19:04:18 +01001083 uint32_t target_type_idx = p->operands[2];
Mark Mendell55d0eac2014-02-06 11:02:52 -08001084
1085 // The offset to patch is the last 4 bytes of the instruction.
1086 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001087 patches_.push_back(LinkerPatch::TypePatch(patch_offset,
1088 class_dex_file, target_type_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001089 }
1090
1091 // And now the PC-relative calls to methods.
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001092 for (LIR* p : call_method_insns_) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001093 DCHECK_EQ(p->opcode, kX86CallI);
Jeff Hao49161ce2014-03-12 11:05:25 -07001094 uint32_t target_method_idx = p->operands[1];
Vladimir Markof6737f72015-03-23 17:05:14 +00001095 const DexFile* target_dex_file = UnwrapPointer<DexFile>(p->operands[2]);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001096
1097 // The offset to patch is the last 4 bytes of the instruction.
1098 int patch_offset = p->offset + p->flags.size - 4;
Vladimir Markof4da6752014-08-01 19:04:18 +01001099 patches_.push_back(LinkerPatch::RelativeCodePatch(patch_offset,
1100 target_dex_file, target_method_idx));
Mark Mendell55d0eac2014-02-06 11:02:52 -08001101 }
1102
Vladimir Markodc56cc52015-03-27 18:18:36 +00001103 // PC-relative references to dex cache arrays.
1104 for (LIR* p : dex_cache_access_insns_) {
Mathieu Chartiere401d142015-04-22 13:56:20 -07001105 DCHECK(p->opcode == kX86Mov32RM || p->opcode == kX86Mov64RM);
Vladimir Markodc56cc52015-03-27 18:18:36 +00001106 const DexFile* dex_file = UnwrapPointer<DexFile>(p->operands[3]);
1107 uint32_t offset = p->operands[4];
1108 // The offset to patch is the last 4 bytes of the instruction.
1109 int patch_offset = p->offset + p->flags.size - 4;
1110 DCHECK(!p->flags.is_nop);
Vladimir Marko1961b602015-04-08 20:51:48 +01001111 patches_.push_back(LinkerPatch::DexCacheArrayPatch(patch_offset, dex_file,
1112 p->target->offset, offset));
Vladimir Markodc56cc52015-03-27 18:18:36 +00001113 }
1114
Mark Mendell55d0eac2014-02-06 11:02:52 -08001115 // And do the normal processing.
1116 Mir2Lir::InstallLiteralPools();
1117}
1118
DaniilSokolov70c4f062014-06-24 17:34:00 -07001119bool X86Mir2Lir::GenInlinedArrayCopyCharArray(CallInfo* info) {
DaniilSokolov70c4f062014-06-24 17:34:00 -07001120 RegLocation rl_src = info->args[0];
1121 RegLocation rl_srcPos = info->args[1];
1122 RegLocation rl_dst = info->args[2];
1123 RegLocation rl_dstPos = info->args[3];
1124 RegLocation rl_length = info->args[4];
1125 if (rl_srcPos.is_const && (mir_graph_->ConstantValue(rl_srcPos) < 0)) {
1126 return false;
1127 }
1128 if (rl_dstPos.is_const && (mir_graph_->ConstantValue(rl_dstPos) < 0)) {
1129 return false;
1130 }
1131 ClobberCallerSave();
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001132 LockCallTemps(); // Using fixed registers.
1133 RegStorage tmp_reg = cu_->target64 ? rs_r11 : rs_rBX;
1134 LoadValueDirectFixed(rl_src, rs_rAX);
1135 LoadValueDirectFixed(rl_dst, rs_rCX);
1136 LIR* src_dst_same = OpCmpBranch(kCondEq, rs_rAX, rs_rCX, nullptr);
1137 LIR* src_null_branch = OpCmpImmBranch(kCondEq, rs_rAX, 0, nullptr);
1138 LIR* dst_null_branch = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1139 LoadValueDirectFixed(rl_length, rs_rDX);
1140 // If the length of the copy is > 128 characters (256 bytes) or negative then go slow path.
1141 LIR* len_too_big = OpCmpImmBranch(kCondHi, rs_rDX, 128, nullptr);
1142 LoadValueDirectFixed(rl_src, rs_rAX);
1143 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001144 LIR* src_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001145 LIR* src_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001146 LIR* srcPos_negative = nullptr;
1147 if (!rl_srcPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001148 LoadValueDirectFixed(rl_srcPos, tmp_reg);
1149 srcPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001150 // src_pos < src_len
1151 src_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1152 // src_len - src_pos < copy_len
1153 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1154 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001155 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001156 int32_t pos_val = mir_graph_->ConstantValue(rl_srcPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001157 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001158 src_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001159 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001160 // src_pos < src_len
1161 src_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1162 // src_len - src_pos < copy_len
1163 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1164 src_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001165 }
1166 }
1167 LIR* dstPos_negative = nullptr;
1168 LIR* dst_bad_len = nullptr;
avignatef9f0ed42014-09-17 22:35:07 +07001169 LIR* dst_bad_off = nullptr;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001170 LoadValueDirectFixed(rl_dst, rs_rAX);
1171 LoadWordDisp(rs_rAX, mirror::Array::LengthOffset().Int32Value(), rs_rAX);
1172 if (!rl_dstPos.is_const) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001173 LoadValueDirectFixed(rl_dstPos, tmp_reg);
1174 dstPos_negative = OpCmpImmBranch(kCondLt, tmp_reg, 0, nullptr);
avignatef9f0ed42014-09-17 22:35:07 +07001175 // dst_pos < dst_len
1176 dst_bad_off = OpCmpBranch(kCondLt, rs_rAX, tmp_reg, nullptr);
1177 // dst_len - dst_pos < copy_len
1178 OpRegRegReg(kOpSub, tmp_reg, rs_rAX, tmp_reg);
1179 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001180 } else {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001181 int32_t pos_val = mir_graph_->ConstantValue(rl_dstPos.orig_sreg);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001182 if (pos_val == 0) {
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001183 dst_bad_len = OpCmpBranch(kCondLt, rs_rAX, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001184 } else {
avignatef9f0ed42014-09-17 22:35:07 +07001185 // dst_pos < dst_len
1186 dst_bad_off = OpCmpImmBranch(kCondLt, rs_rAX, pos_val, nullptr);
1187 // dst_len - dst_pos < copy_len
1188 OpRegRegImm(kOpSub, tmp_reg, rs_rAX, pos_val);
1189 dst_bad_len = OpCmpBranch(kCondLt, tmp_reg, rs_rDX, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001190 }
1191 }
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001192 // Everything is checked now.
1193 LoadValueDirectFixed(rl_src, rs_rAX);
1194 LoadValueDirectFixed(rl_dst, tmp_reg);
1195 LoadValueDirectFixed(rl_srcPos, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001196 NewLIR5(kX86Lea32RA, rs_rAX.GetReg(), rs_rAX.GetReg(),
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001197 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value());
1198 // RAX now holds the address of the first src element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001199
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001200 LoadValueDirectFixed(rl_dstPos, rs_rCX);
1201 NewLIR5(kX86Lea32RA, tmp_reg.GetReg(), tmp_reg.GetReg(),
1202 rs_rCX.GetReg(), 1, mirror::Array::DataOffset(2).Int32Value() );
1203 // RBX now holds the address of the first dst element to be copied.
DaniilSokolov70c4f062014-06-24 17:34:00 -07001204
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001205 // Check if the number of elements to be copied is odd or even. If odd
DaniilSokolov70c4f062014-06-24 17:34:00 -07001206 // then copy the first element (so that the remaining number of elements
1207 // is even).
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001208 LoadValueDirectFixed(rl_length, rs_rCX);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001209 OpRegImm(kOpAnd, rs_rCX, 1);
1210 LIR* jmp_to_begin_loop = OpCmpImmBranch(kCondEq, rs_rCX, 0, nullptr);
1211 OpRegImm(kOpSub, rs_rDX, 1);
1212 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001213 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSignedHalf);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001214
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001215 // Since the remaining number of elements is even, we will copy by
DaniilSokolov70c4f062014-06-24 17:34:00 -07001216 // two elements at a time.
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001217 LIR* beginLoop = NewLIR0(kPseudoTargetLabel);
1218 LIR* jmp_to_ret = OpCmpImmBranch(kCondEq, rs_rDX, 0, nullptr);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001219 OpRegImm(kOpSub, rs_rDX, 2);
1220 LoadBaseIndexedDisp(rs_rAX, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov5a5e8562014-07-17 18:58:15 -07001221 StoreBaseIndexedDisp(tmp_reg, rs_rDX, 1, 0, rs_rCX, kSingle);
DaniilSokolov70c4f062014-06-24 17:34:00 -07001222 OpUnconditionalBranch(beginLoop);
1223 LIR *check_failed = NewLIR0(kPseudoTargetLabel);
1224 LIR* launchpad_branch = OpUnconditionalBranch(nullptr);
1225 LIR *return_point = NewLIR0(kPseudoTargetLabel);
1226 jmp_to_ret->target = return_point;
1227 jmp_to_begin_loop->target = beginLoop;
1228 src_dst_same->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001229 len_too_big->target = check_failed;
1230 src_null_branch->target = check_failed;
1231 if (srcPos_negative != nullptr)
1232 srcPos_negative ->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001233 if (src_bad_off != nullptr)
1234 src_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001235 if (src_bad_len != nullptr)
1236 src_bad_len->target = check_failed;
1237 dst_null_branch->target = check_failed;
1238 if (dstPos_negative != nullptr)
1239 dstPos_negative->target = check_failed;
avignatef9f0ed42014-09-17 22:35:07 +07001240 if (dst_bad_off != nullptr)
1241 dst_bad_off->target = check_failed;
DaniilSokolov70c4f062014-06-24 17:34:00 -07001242 if (dst_bad_len != nullptr)
1243 dst_bad_len->target = check_failed;
1244 AddIntrinsicSlowPath(info, launchpad_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001245 ClobberCallerSave(); // We must clobber everything because slow path will return here
DaniilSokolov70c4f062014-06-24 17:34:00 -07001246 return true;
1247}
1248
1249
Mark Mendell4028a6c2014-02-19 20:06:20 -08001250/*
1251 * Fast string.index_of(I) & (II). Inline check for simple case of char <= 0xffff,
1252 * otherwise bails to standard library code.
1253 */
1254bool X86Mir2Lir::GenInlinedIndexOf(CallInfo* info, bool zero_based) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001255 RegLocation rl_obj = info->args[0];
1256 RegLocation rl_char = info->args[1];
buzbeea44d4f52014-03-05 11:26:39 -08001257 RegLocation rl_start; // Note: only present in III flavor or IndexOf.
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001258 // RBX is promotable in 64-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001259 RegStorage rs_tmp = cu_->target64 ? rs_r11 : rs_rBX;
1260 int start_value = -1;
Mark Mendell4028a6c2014-02-19 20:06:20 -08001261
1262 uint32_t char_value =
1263 rl_char.is_const ? mir_graph_->ConstantValue(rl_char.orig_sreg) : 0;
1264
1265 if (char_value > 0xFFFF) {
1266 // We have to punt to the real String.indexOf.
1267 return false;
1268 }
1269
1270 // Okay, we are commited to inlining this.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001271 // EAX: 16 bit character being searched.
1272 // ECX: count: number of words to be searched.
1273 // EDI: String being searched.
1274 // EDX: temporary during execution.
1275 // EBX or R11: temporary during execution (depending on mode).
1276 // REP SCASW: search instruction.
1277
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001278 FlushAllRegs();
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001279
buzbeea0cd2d72014-06-01 09:33:49 -07001280 RegLocation rl_return = GetReturn(kCoreReg);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001281 RegLocation rl_dest = InlineTarget(info);
1282
Mathieu Chartier2cebb242015-04-21 16:50:40 -07001283 // Is the string non-null?
buzbee2700f7e2014-03-07 09:46:20 -08001284 LoadValueDirectFixed(rl_obj, rs_rDX);
1285 GenNullCheck(rs_rDX, info->opt_flags);
Vladimir Marko3bc86152014-03-13 14:11:28 +00001286 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've null checked.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001287
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001288 LIR *slowpath_branch = nullptr, *length_compare = nullptr;
1289
1290 // We need the value in EAX.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001291 if (rl_char.is_const) {
buzbee2700f7e2014-03-07 09:46:20 -08001292 LoadConstantNoClobber(rs_rAX, char_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001293 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001294 // Does the character fit in 16 bits? Compare it at runtime.
buzbee2700f7e2014-03-07 09:46:20 -08001295 LoadValueDirectFixed(rl_char, rs_rAX);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001296 slowpath_branch = OpCmpImmBranch(kCondGt, rs_rAX, 0xFFFF, nullptr);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001297 }
1298
1299 // From here down, we know that we are looking for a char that fits in 16 bits.
Mark Mendelle19c91f2014-02-25 08:19:08 -08001300 // Location of reference to data array within the String object.
1301 int value_offset = mirror::String::ValueOffset().Int32Value();
1302 // Location of count within the String object.
1303 int count_offset = mirror::String::CountOffset().Int32Value();
Mark Mendell4028a6c2014-02-19 20:06:20 -08001304
Dave Allison69dfe512014-07-11 17:11:58 +00001305 // Compute the number of words to search in to rCX.
1306 Load32Disp(rs_rDX, count_offset, rs_rCX);
1307
Dave Allisondfd3b472014-07-16 16:04:32 -07001308 // Possible signal here due to null pointer dereference.
1309 // Note that the signal handler will expect the top word of
1310 // the stack to be the ArtMethod*. If the PUSH edi instruction
1311 // below is ahead of the load above then this will not be true
1312 // and the signal handler will not work.
1313 MarkPossibleNullPointerException(0);
Dave Allison69dfe512014-07-11 17:11:58 +00001314
Dave Allisondfd3b472014-07-16 16:04:32 -07001315 if (!cu_->target64) {
nikolay serdjuk8bd698f2014-08-01 09:24:06 +07001316 // EDI is promotable in 32-bit mode.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001317 NewLIR1(kX86Push32R, rs_rDI.GetReg());
David Srbecky1109fb32015-04-07 20:21:06 +01001318 cfi_.AdjustCFAOffset(4);
1319 // Record cfi only if it is not already spilled.
1320 if (!CoreSpillMaskContains(rs_rDI.GetReg())) {
1321 cfi_.RelOffset(DwarfCoreReg(cu_->target64, rs_rDI.GetReg()), 0);
1322 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001323 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001324
Mark Mendell4028a6c2014-02-19 20:06:20 -08001325 if (zero_based) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001326 // Start index is not present.
Mark Mendell4028a6c2014-02-19 20:06:20 -08001327 // We have to handle an empty string. Use special instruction JECXZ.
1328 length_compare = NewLIR0(kX86Jecxz8);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001329
1330 // Copy the number of words to search in a temporary register.
1331 // We will use the register at the end to calculate result.
1332 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001333 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001334 // Start index is present.
buzbeea44d4f52014-03-05 11:26:39 -08001335 rl_start = info->args[2];
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001336
Mark Mendell4028a6c2014-02-19 20:06:20 -08001337 // We have to offset by the start index.
1338 if (rl_start.is_const) {
1339 start_value = mir_graph_->ConstantValue(rl_start.orig_sreg);
1340 start_value = std::max(start_value, 0);
1341
1342 // Is the start > count?
buzbee2700f7e2014-03-07 09:46:20 -08001343 length_compare = OpCmpImmBranch(kCondLe, rs_rCX, start_value, nullptr);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001344 OpRegImm(kOpMov, rs_rDI, start_value);
1345
1346 // Copy the number of words to search in a temporary register.
1347 // We will use the register at the end to calculate result.
1348 OpRegReg(kOpMov, rs_tmp, rs_rCX);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001349
1350 if (start_value != 0) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001351 // Decrease the number of words to search by the start index.
buzbee2700f7e2014-03-07 09:46:20 -08001352 OpRegImm(kOpSub, rs_rCX, start_value);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001353 }
1354 } else {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001355 // Handle "start index < 0" case.
1356 if (!cu_->target64 && rl_start.location != kLocPhysReg) {
Alexei Zavjalova1758d82014-04-17 01:55:43 +07001357 // Load the start index from stack, remembering that we pushed EDI.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001358 int displacement = SRegOffset(rl_start.s_reg_low) + sizeof(uint32_t);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001359 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001360 Load32Disp(rs_rX86_SP_32, displacement, rs_rDI);
Vladimir Marko74de63b2014-08-19 15:00:34 +01001361 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1362 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1363 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - 1;
1364 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001365 } else {
1366 LoadValueDirectFixed(rl_start, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001367 }
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001368 OpRegReg(kOpXor, rs_tmp, rs_tmp);
1369 OpRegReg(kOpCmp, rs_rDI, rs_tmp);
1370 OpCondRegReg(kOpCmov, kCondLt, rs_rDI, rs_tmp);
1371
1372 // The length of the string should be greater than the start index.
1373 length_compare = OpCmpBranch(kCondLe, rs_rCX, rs_rDI, nullptr);
1374
1375 // Copy the number of words to search in a temporary register.
1376 // We will use the register at the end to calculate result.
1377 OpRegReg(kOpMov, rs_tmp, rs_rCX);
1378
1379 // Decrease the number of words to search by the start index.
1380 OpRegReg(kOpSub, rs_rCX, rs_rDI);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001381 }
1382 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001383
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001384 // Load the address of the string into EDI.
1385 // In case of start index we have to add the address to existing value in EDI.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001386 if (zero_based || (!zero_based && rl_start.is_const && start_value == 0)) {
Jeff Hao848f70a2014-01-15 13:49:50 -08001387 OpRegRegImm(kOpAdd, rs_rDI, rs_rDX, value_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001388 } else {
Jeff Hao848f70a2014-01-15 13:49:50 -08001389 OpRegImm(kOpLsl, rs_rDI, 1);
1390 OpRegReg(kOpAdd, rs_rDI, rs_rDX);
1391 OpRegImm(kOpAdd, rs_rDI, value_offset);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001392 }
1393
1394 // EDI now contains the start of the string to be searched.
1395 // We are all prepared to do the search for the character.
1396 NewLIR0(kX86RepneScasw);
1397
1398 // Did we find a match?
1399 LIR* failed_branch = OpCondBranch(kCondNe, nullptr);
1400
1401 // yes, we matched. Compute the index of the result.
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001402 OpRegReg(kOpSub, rs_tmp, rs_rCX);
1403 NewLIR3(kX86Lea32RM, rl_return.reg.GetReg(), rs_tmp.GetReg(), -1);
1404
Mark Mendell4028a6c2014-02-19 20:06:20 -08001405 LIR *all_done = NewLIR1(kX86Jmp8, 0);
1406
1407 // Failed to match; return -1.
1408 LIR *not_found = NewLIR0(kPseudoTargetLabel);
1409 length_compare->target = not_found;
1410 failed_branch->target = not_found;
buzbee2700f7e2014-03-07 09:46:20 -08001411 LoadConstantNoClobber(rl_return.reg, -1);
Mark Mendell4028a6c2014-02-19 20:06:20 -08001412
1413 // And join up at the end.
1414 all_done->target = NewLIR0(kPseudoTargetLabel);
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001415
David Srbecky1109fb32015-04-07 20:21:06 +01001416 if (!cu_->target64) {
nikolay serdjukc3561ae2014-07-18 12:35:46 +07001417 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
David Srbecky1109fb32015-04-07 20:21:06 +01001418 cfi_.AdjustCFAOffset(-4);
1419 if (!CoreSpillMaskContains(rs_rDI.GetReg())) {
1420 cfi_.Restore(DwarfCoreReg(cu_->target64, rs_rDI.GetReg()));
1421 }
1422 }
Mark Mendell4028a6c2014-02-19 20:06:20 -08001423
1424 // Out of line code returns here.
Mingyao Yang3a74d152014-04-21 15:39:44 -07001425 if (slowpath_branch != nullptr) {
Mark Mendell4028a6c2014-02-19 20:06:20 -08001426 LIR *return_point = NewLIR0(kPseudoTargetLabel);
Mingyao Yang3a74d152014-04-21 15:39:44 -07001427 AddIntrinsicSlowPath(info, slowpath_branch, return_point);
Serguei Katkov9863daf2014-09-04 15:21:32 +07001428 ClobberCallerSave(); // We must clobber everything because slow path will return here
Mark Mendell4028a6c2014-02-19 20:06:20 -08001429 }
1430
1431 StoreValue(rl_dest, rl_return);
1432 return true;
1433}
1434
Mark Mendelld65c51a2014-04-29 16:55:20 -04001435void X86Mir2Lir::GenMachineSpecificExtendedMethodMIR(BasicBlock* bb, MIR* mir) {
1436 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001437 case kMirOpReserveVectorRegisters:
1438 ReserveVectorRegisters(mir);
1439 break;
1440 case kMirOpReturnVectorRegisters:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001441 ReturnVectorRegisters(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001442 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001443 case kMirOpConstVector:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001444 GenConst128(mir);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001445 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001446 case kMirOpMoveVector:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001447 GenMoveVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001448 break;
1449 case kMirOpPackedMultiply:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001450 GenMultiplyVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001451 break;
1452 case kMirOpPackedAddition:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001453 GenAddVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001454 break;
1455 case kMirOpPackedSubtract:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001456 GenSubtractVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001457 break;
1458 case kMirOpPackedShiftLeft:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001459 GenShiftLeftVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001460 break;
1461 case kMirOpPackedSignedShiftRight:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001462 GenSignedShiftRightVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001463 break;
1464 case kMirOpPackedUnsignedShiftRight:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001465 GenUnsignedShiftRightVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001466 break;
1467 case kMirOpPackedAnd:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001468 GenAndVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001469 break;
1470 case kMirOpPackedOr:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001471 GenOrVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001472 break;
1473 case kMirOpPackedXor:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001474 GenXorVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001475 break;
1476 case kMirOpPackedAddReduce:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001477 GenAddReduceVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001478 break;
1479 case kMirOpPackedReduce:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001480 GenReduceVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001481 break;
1482 case kMirOpPackedSet:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001483 GenSetVector(mir);
Mark Mendellfe945782014-05-22 09:52:36 -04001484 break;
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07001485 case kMirOpMemBarrier:
1486 GenMemBarrier(static_cast<MemBarrierKind>(mir->dalvikInsn.vA));
1487 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001488 case kMirOpPackedArrayGet:
1489 GenPackedArrayGet(bb, mir);
1490 break;
1491 case kMirOpPackedArrayPut:
1492 GenPackedArrayPut(bb, mir);
1493 break;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001494 default:
1495 break;
1496 }
1497}
1498
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001499void X86Mir2Lir::ReserveVectorRegisters(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001500 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001501 RegStorage xp_reg = RegStorage::Solo128(i);
1502 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1503 Clobber(xp_reg);
1504
1505 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1506 info != nullptr;
1507 info = info->GetAliasChain()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001508 ArenaVector<RegisterInfo*>* regs =
1509 info->GetReg().IsSingle() ? &reg_pool_->sp_regs_ : &reg_pool_->dp_regs_;
1510 auto it = std::find(regs->begin(), regs->end(), info);
1511 DCHECK(it != regs->end());
1512 regs->erase(it);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001513 }
1514 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001515}
1516
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001517void X86Mir2Lir::ReturnVectorRegisters(MIR* mir) {
1518 for (uint32_t i = mir->dalvikInsn.vA; i <= mir->dalvikInsn.vB; i++) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001519 RegStorage xp_reg = RegStorage::Solo128(i);
1520 RegisterInfo *xp_reg_info = GetRegInfo(xp_reg);
1521
1522 for (RegisterInfo *info = xp_reg_info->GetAliasChain();
1523 info != nullptr;
1524 info = info->GetAliasChain()) {
1525 if (info->GetReg().IsSingle()) {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001526 reg_pool_->sp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001527 } else {
Vladimir Markoe39c54e2014-09-22 14:50:02 +01001528 reg_pool_->dp_regs_.push_back(info);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001529 }
1530 }
1531 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001532}
1533
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001534void X86Mir2Lir::GenConst128(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001535 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001536 Clobber(rs_dest);
1537
Mark Mendelld65c51a2014-04-29 16:55:20 -04001538 uint32_t *args = mir->dalvikInsn.arg;
Mark Mendellfe945782014-05-22 09:52:36 -04001539 int reg = rs_dest.GetReg();
Mark Mendelld65c51a2014-04-29 16:55:20 -04001540 // Check for all 0 case.
1541 if (args[0] == 0 && args[1] == 0 && args[2] == 0 && args[3] == 0) {
1542 NewLIR2(kX86XorpsRR, reg, reg);
1543 return;
1544 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001545
1546 // Append the mov const vector to reg opcode.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001547 AppendOpcodeWithConst(kX86MovdqaRM, reg, mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001548}
1549
1550void X86Mir2Lir::AppendOpcodeWithConst(X86OpCode opcode, int reg, MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001551 // To deal with correct memory ordering, reverse order of constants.
1552 int32_t constants[4];
1553 constants[3] = mir->dalvikInsn.arg[0];
1554 constants[2] = mir->dalvikInsn.arg[1];
1555 constants[1] = mir->dalvikInsn.arg[2];
1556 constants[0] = mir->dalvikInsn.arg[3];
1557
1558 // Search if there is already a constant in pool with this value.
1559 LIR *data_target = ScanVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001560 if (data_target == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001561 data_target = AddVectorLiteral(constants);
Mark Mendelld65c51a2014-04-29 16:55:20 -04001562 }
1563
Mark Mendelld65c51a2014-04-29 16:55:20 -04001564 // Load the proper value from the literal area.
1565 // We don't know the proper offset for the value, so pick one that will force
Mark Mendell27dee8b2014-12-01 19:06:12 -05001566 // 4 byte offset. We will fix this up in the assembler later to have the
1567 // right value.
1568 LIR* load;
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001569 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
Mark Mendell27dee8b2014-12-01 19:06:12 -05001570 if (cu_->target64) {
Vladimir Marko1961b602015-04-08 20:51:48 +01001571 load = NewLIR3(opcode, reg, kRIPReg, kDummy32BitOffset);
Mark Mendell27dee8b2014-12-01 19:06:12 -05001572 } else {
Vladimir Marko1961b602015-04-08 20:51:48 +01001573 // Get the PC to a register and get the anchor.
1574 LIR* anchor;
1575 RegStorage r_pc = GetPcAndAnchor(&anchor);
1576
1577 load = NewLIR3(opcode, reg, r_pc.GetReg(), kDummy32BitOffset);
1578 load->operands[4] = WrapPointer(anchor);
1579 if (IsTemp(r_pc)) {
1580 FreeTemp(r_pc);
Mark Mendell27dee8b2014-12-01 19:06:12 -05001581 }
Mark Mendell27dee8b2014-12-01 19:06:12 -05001582 }
Mark Mendelld65c51a2014-04-29 16:55:20 -04001583 load->flags.fixup = kFixupLoad;
1584 load->target = data_target;
Mark Mendelld65c51a2014-04-29 16:55:20 -04001585}
1586
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001587void X86Mir2Lir::GenMoveVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001588 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001589 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1590 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001591 Clobber(rs_dest);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001592 RegStorage rs_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001593 NewLIR2(kX86MovdqaRR, rs_dest.GetReg(), rs_src.GetReg());
Mark Mendellfe945782014-05-22 09:52:36 -04001594}
1595
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001596void X86Mir2Lir::GenMultiplyVectorSignedByte(RegStorage rs_dest_src1, RegStorage rs_src2) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001597 /*
1598 * Emulate the behavior of a kSignedByte by separating out the 16 values in the two XMM
1599 * and multiplying 8 at a time before recombining back into one XMM register.
1600 *
1601 * let xmm1, xmm2 be real srcs (keep low bits of 16bit lanes)
1602 * xmm3 is tmp (operate on high bits of 16bit lanes)
1603 *
1604 * xmm3 = xmm1
1605 * xmm1 = xmm1 .* xmm2
1606 * xmm1 = xmm1 & 0x00ff00ff00ff00ff00ff00ff00ff00ff // xmm1 now has low bits
1607 * xmm3 = xmm3 .>> 8
1608 * xmm2 = xmm2 & 0xff00ff00ff00ff00ff00ff00ff00ff00
1609 * xmm2 = xmm2 .* xmm3 // xmm2 now has high bits
1610 * xmm1 = xmm1 | xmm2 // combine results
1611 */
1612
1613 // Copy xmm1.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001614 RegStorage rs_src1_high_tmp = Get128BitRegister(AllocTempDouble());
1615 RegStorage rs_dest_high_tmp = Get128BitRegister(AllocTempDouble());
1616 NewLIR2(kX86MovdqaRR, rs_src1_high_tmp.GetReg(), rs_src2.GetReg());
1617 NewLIR2(kX86MovdqaRR, rs_dest_high_tmp.GetReg(), rs_dest_src1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001618
1619 // Multiply low bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001620 // x7 *= x3
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001621 NewLIR2(kX86PmullwRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1622
1623 // xmm1 now has low bits.
1624 AndMaskVectorRegister(rs_dest_src1, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF, 0x00FF00FF);
1625
1626 // Prepare high bits for multiplication.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001627 NewLIR2(kX86PsrlwRI, rs_src1_high_tmp.GetReg(), 0x8);
1628 AndMaskVectorRegister(rs_dest_high_tmp, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00, 0xFF00FF00);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001629
1630 // Multiply high bits and xmm2 now has high bits.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001631 NewLIR2(kX86PmullwRR, rs_src1_high_tmp.GetReg(), rs_dest_high_tmp.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001632
1633 // Combine back into dest XMM register.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001634 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src1_high_tmp.GetReg());
1635}
1636
1637void X86Mir2Lir::GenMultiplyVectorLong(RegStorage rs_dest_src1, RegStorage rs_src2) {
1638 /*
1639 * We need to emulate the packed long multiply.
1640 * For kMirOpPackedMultiply xmm1, xmm0:
1641 * - xmm1 is src/dest
1642 * - xmm0 is src
1643 * - Get xmm2 and xmm3 as temp
1644 * - Idea is to multiply the lower 32 of each operand with the higher 32 of the other.
1645 * - Then add the two results.
1646 * - Move it to the upper 32 of the destination
1647 * - Then multiply the lower 32-bits of the operands and add the result to the destination.
1648 *
1649 * (op dest src )
1650 * movdqa %xmm2, %xmm1
1651 * movdqa %xmm3, %xmm0
1652 * psrlq %xmm3, $0x20
1653 * pmuludq %xmm3, %xmm2
1654 * psrlq %xmm1, $0x20
1655 * pmuludq %xmm1, %xmm0
1656 * paddq %xmm1, %xmm3
1657 * psllq %xmm1, $0x20
1658 * pmuludq %xmm2, %xmm0
1659 * paddq %xmm1, %xmm2
1660 *
1661 * When both the operands are the same, then we need to calculate the lower-32 * higher-32
1662 * calculation only once. Thus we don't need the xmm3 temp above. That sequence becomes:
1663 *
1664 * (op dest src )
1665 * movdqa %xmm2, %xmm1
1666 * psrlq %xmm1, $0x20
1667 * pmuludq %xmm1, %xmm0
1668 * paddq %xmm1, %xmm1
1669 * psllq %xmm1, $0x20
1670 * pmuludq %xmm2, %xmm0
1671 * paddq %xmm1, %xmm2
1672 *
1673 */
1674
1675 bool both_operands_same = (rs_dest_src1.GetReg() == rs_src2.GetReg());
1676
1677 RegStorage rs_tmp_vector_1;
1678 RegStorage rs_tmp_vector_2;
1679 rs_tmp_vector_1 = Get128BitRegister(AllocTempDouble());
1680 NewLIR2(kX86MovdqaRR, rs_tmp_vector_1.GetReg(), rs_dest_src1.GetReg());
1681
1682 if (both_operands_same == false) {
1683 rs_tmp_vector_2 = Get128BitRegister(AllocTempDouble());
1684 NewLIR2(kX86MovdqaRR, rs_tmp_vector_2.GetReg(), rs_src2.GetReg());
1685 NewLIR2(kX86PsrlqRI, rs_tmp_vector_2.GetReg(), 0x20);
1686 NewLIR2(kX86PmuludqRR, rs_tmp_vector_2.GetReg(), rs_tmp_vector_1.GetReg());
1687 }
1688
1689 NewLIR2(kX86PsrlqRI, rs_dest_src1.GetReg(), 0x20);
1690 NewLIR2(kX86PmuludqRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1691
1692 if (both_operands_same == false) {
1693 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_2.GetReg());
1694 } else {
1695 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1696 }
1697
1698 NewLIR2(kX86PsllqRI, rs_dest_src1.GetReg(), 0x20);
1699 NewLIR2(kX86PmuludqRR, rs_tmp_vector_1.GetReg(), rs_src2.GetReg());
1700 NewLIR2(kX86PaddqRR, rs_dest_src1.GetReg(), rs_tmp_vector_1.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001701}
1702
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001703void X86Mir2Lir::GenMultiplyVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001704 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1705 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1706 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001707 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001708 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001709 int opcode = 0;
1710 switch (opsize) {
1711 case k32:
1712 opcode = kX86PmulldRR;
1713 break;
1714 case kSignedHalf:
1715 opcode = kX86PmullwRR;
1716 break;
1717 case kSingle:
1718 opcode = kX86MulpsRR;
1719 break;
1720 case kDouble:
1721 opcode = kX86MulpdRR;
1722 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001723 case kSignedByte:
1724 // HW doesn't support 16x16 byte multiplication so emulate it.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001725 GenMultiplyVectorSignedByte(rs_dest_src1, rs_src2);
1726 return;
1727 case k64:
1728 GenMultiplyVectorLong(rs_dest_src1, rs_src2);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001729 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001730 default:
1731 LOG(FATAL) << "Unsupported vector multiply " << opsize;
1732 break;
1733 }
1734 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1735}
1736
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001737void X86Mir2Lir::GenAddVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001738 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1739 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1740 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001741 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001742 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001743 int opcode = 0;
1744 switch (opsize) {
1745 case k32:
1746 opcode = kX86PadddRR;
1747 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001748 case k64:
1749 opcode = kX86PaddqRR;
1750 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001751 case kSignedHalf:
1752 case kUnsignedHalf:
1753 opcode = kX86PaddwRR;
1754 break;
1755 case kUnsignedByte:
1756 case kSignedByte:
1757 opcode = kX86PaddbRR;
1758 break;
1759 case kSingle:
1760 opcode = kX86AddpsRR;
1761 break;
1762 case kDouble:
1763 opcode = kX86AddpdRR;
1764 break;
1765 default:
1766 LOG(FATAL) << "Unsupported vector addition " << opsize;
1767 break;
1768 }
1769 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1770}
1771
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001772void X86Mir2Lir::GenSubtractVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001773 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1774 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1775 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001776 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001777 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001778 int opcode = 0;
1779 switch (opsize) {
1780 case k32:
1781 opcode = kX86PsubdRR;
1782 break;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001783 case k64:
1784 opcode = kX86PsubqRR;
1785 break;
Mark Mendellfe945782014-05-22 09:52:36 -04001786 case kSignedHalf:
1787 case kUnsignedHalf:
1788 opcode = kX86PsubwRR;
1789 break;
1790 case kUnsignedByte:
1791 case kSignedByte:
1792 opcode = kX86PsubbRR;
1793 break;
1794 case kSingle:
1795 opcode = kX86SubpsRR;
1796 break;
1797 case kDouble:
1798 opcode = kX86SubpdRR;
1799 break;
1800 default:
1801 LOG(FATAL) << "Unsupported vector subtraction " << opsize;
1802 break;
1803 }
1804 NewLIR2(opcode, rs_dest_src1.GetReg(), rs_src2.GetReg());
1805}
1806
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001807void X86Mir2Lir::GenShiftByteVector(MIR* mir) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001808 // Destination does not need clobbered because it has already been as part
1809 // of the general packed shift handler (caller of this method).
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001810 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001811
1812 int opcode = 0;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001813 switch (static_cast<ExtendedMIROpcode>(mir->dalvikInsn.opcode)) {
1814 case kMirOpPackedShiftLeft:
1815 opcode = kX86PsllwRI;
1816 break;
1817 case kMirOpPackedSignedShiftRight:
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001818 case kMirOpPackedUnsignedShiftRight:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001819 // TODO Add support for emulated byte shifts.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001820 default:
1821 LOG(FATAL) << "Unsupported shift operation on byte vector " << opcode;
1822 break;
1823 }
1824
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001825 // Clear xmm register and return if shift more than byte length.
1826 int imm = mir->dalvikInsn.vB;
1827 if (imm >= 8) {
1828 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_dest_src1.GetReg());
1829 return;
1830 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001831
1832 // Shift lower values.
1833 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1834
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001835 /*
1836 * The above shift will shift the whole word, but that means
1837 * both the bytes will shift as well. To emulate a byte level
1838 * shift, we can just throw away the lower (8 - N) bits of the
1839 * upper byte, and we are done.
1840 */
1841 uint8_t byte_mask = 0xFF << imm;
1842 uint32_t int_mask = byte_mask;
1843 int_mask = int_mask << 8 | byte_mask;
1844 int_mask = int_mask << 8 | byte_mask;
1845 int_mask = int_mask << 8 | byte_mask;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001846
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001847 // And the destination with the mask
1848 AndMaskVectorRegister(rs_dest_src1, int_mask, int_mask, int_mask, int_mask);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001849}
1850
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001851void X86Mir2Lir::GenShiftLeftVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001852 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1853 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1854 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001855 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001856 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001857 int opcode = 0;
1858 switch (opsize) {
1859 case k32:
1860 opcode = kX86PslldRI;
1861 break;
1862 case k64:
1863 opcode = kX86PsllqRI;
1864 break;
1865 case kSignedHalf:
1866 case kUnsignedHalf:
1867 opcode = kX86PsllwRI;
1868 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001869 case kSignedByte:
1870 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001871 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001872 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001873 default:
1874 LOG(FATAL) << "Unsupported vector shift left " << opsize;
1875 break;
1876 }
1877 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1878}
1879
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001880void X86Mir2Lir::GenSignedShiftRightVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001881 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1882 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1883 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001884 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001885 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001886 int opcode = 0;
1887 switch (opsize) {
1888 case k32:
1889 opcode = kX86PsradRI;
1890 break;
1891 case kSignedHalf:
1892 case kUnsignedHalf:
1893 opcode = kX86PsrawRI;
1894 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001895 case kSignedByte:
1896 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001897 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001898 return;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001899 case k64:
1900 // TODO Implement emulated shift algorithm.
Mark Mendellfe945782014-05-22 09:52:36 -04001901 default:
1902 LOG(FATAL) << "Unsupported vector signed shift right " << opsize;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001903 UNREACHABLE();
Mark Mendellfe945782014-05-22 09:52:36 -04001904 }
1905 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1906}
1907
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001908void X86Mir2Lir::GenUnsignedShiftRightVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001909 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1910 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
1911 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001912 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001913 int imm = mir->dalvikInsn.vB;
Mark Mendellfe945782014-05-22 09:52:36 -04001914 int opcode = 0;
1915 switch (opsize) {
1916 case k32:
1917 opcode = kX86PsrldRI;
1918 break;
1919 case k64:
1920 opcode = kX86PsrlqRI;
1921 break;
1922 case kSignedHalf:
1923 case kUnsignedHalf:
1924 opcode = kX86PsrlwRI;
1925 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001926 case kSignedByte:
1927 case kUnsignedByte:
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001928 GenShiftByteVector(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001929 return;
Mark Mendellfe945782014-05-22 09:52:36 -04001930 default:
1931 LOG(FATAL) << "Unsupported vector unsigned shift right " << opsize;
1932 break;
1933 }
1934 NewLIR2(opcode, rs_dest_src1.GetReg(), imm);
1935}
1936
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001937void X86Mir2Lir::GenAndVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001938 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001939 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1940 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001941 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001942 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001943 NewLIR2(kX86PandRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1944}
1945
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001946void X86Mir2Lir::GenOrVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001947 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001948 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1949 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001950 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001951 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001952 NewLIR2(kX86PorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1953}
1954
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001955void X86Mir2Lir::GenXorVector(MIR* mir) {
Mark Mendellfe945782014-05-22 09:52:36 -04001956 // We only support 128 bit registers.
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001957 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
1958 RegStorage rs_dest_src1 = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001959 Clobber(rs_dest_src1);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001960 RegStorage rs_src2 = RegStorage::Solo128(mir->dalvikInsn.vB);
Mark Mendellfe945782014-05-22 09:52:36 -04001961 NewLIR2(kX86PxorRR, rs_dest_src1.GetReg(), rs_src2.GetReg());
1962}
1963
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001964void X86Mir2Lir::AndMaskVectorRegister(RegStorage rs_src1, uint32_t m1, uint32_t m2, uint32_t m3, uint32_t m4) {
1965 MaskVectorRegister(kX86PandRM, rs_src1, m1, m2, m3, m4);
1966}
1967
1968void X86Mir2Lir::MaskVectorRegister(X86OpCode opcode, RegStorage rs_src1, uint32_t m0, uint32_t m1, uint32_t m2, uint32_t m3) {
1969 // Create temporary MIR as container for 128-bit binary mask.
1970 MIR const_mir;
1971 MIR* const_mirp = &const_mir;
1972 const_mirp->dalvikInsn.opcode = static_cast<Instruction::Code>(kMirOpConstVector);
1973 const_mirp->dalvikInsn.arg[0] = m0;
1974 const_mirp->dalvikInsn.arg[1] = m1;
1975 const_mirp->dalvikInsn.arg[2] = m2;
1976 const_mirp->dalvikInsn.arg[3] = m3;
1977
1978 // Mask vector with const from literal pool.
1979 AppendOpcodeWithConst(opcode, rs_src1.GetReg(), const_mirp);
1980}
1981
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001982void X86Mir2Lir::GenAddReduceVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001983 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001984 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
1985 bool is_wide = opsize == k64 || opsize == kDouble;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001986
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001987 // Get the location of the virtual register. Since this bytecode is overloaded
1988 // for different types (and sizes), we need different logic for each path.
1989 // The design of bytecode uses same VR for source and destination.
1990 RegLocation rl_src, rl_dest, rl_result;
1991 if (is_wide) {
1992 rl_src = mir_graph_->GetSrcWide(mir, 0);
1993 rl_dest = mir_graph_->GetDestWide(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001994 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001995 rl_src = mir_graph_->GetSrc(mir, 0);
1996 rl_dest = mir_graph_->GetDest(mir);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07001997 }
1998
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07001999 // We need a temp for byte and short values
2000 RegStorage temp;
2001
2002 // There is a different path depending on type and size.
2003 if (opsize == kSingle) {
2004 // Handle float case.
2005 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
2006
2007 rl_src = LoadValue(rl_src, kFPReg);
2008 rl_result = EvalLoc(rl_dest, kFPReg, true);
2009
2010 // Since we are doing an add-reduce, we move the reg holding the VR
2011 // into the result so we include it in result.
2012 OpRegCopy(rl_result.reg, rl_src.reg);
2013 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2014
2015 // Since FP must keep order of operation for value safety, we shift to low
2016 // 32-bits and add to result.
2017 for (int i = 0; i < 3; i++) {
2018 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), 0x39);
2019 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2020 }
2021
2022 StoreValue(rl_dest, rl_result);
2023 } else if (opsize == kDouble) {
2024 // Handle double case.
2025 rl_src = LoadValueWide(rl_src, kFPReg);
2026 rl_result = EvalLocWide(rl_dest, kFPReg, true);
2027 LOG(FATAL) << "Unsupported vector add reduce for double.";
2028 } else if (opsize == k64) {
2029 /*
2030 * Handle long case:
2031 * 1) Reduce the vector register to lower half (with addition).
2032 * 1-1) Get an xmm temp and fill it with vector register.
2033 * 1-2) Shift the xmm temp by 8-bytes.
2034 * 1-3) Add the xmm temp to vector register that is being reduced.
2035 * 2) Allocate temp GP / GP pair.
2036 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2037 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2038 * 3) Finish the add reduction by doing what add-long/2addr does,
2039 * but instead of having a VR as one of the sources, we have our temp GP.
2040 */
2041 RegStorage rs_tmp_vector = Get128BitRegister(AllocTempDouble());
2042 NewLIR2(kX86MovdqaRR, rs_tmp_vector.GetReg(), vector_src.GetReg());
2043 NewLIR2(kX86PsrldqRI, rs_tmp_vector.GetReg(), 8);
2044 NewLIR2(kX86PaddqRR, vector_src.GetReg(), rs_tmp_vector.GetReg());
2045 FreeTemp(rs_tmp_vector);
2046
2047 // We would like to be able to reuse the add-long implementation, so set up a fake
2048 // register location to pass it.
2049 RegLocation temp_loc = mir_graph_->GetBadLoc();
2050 temp_loc.core = 1;
2051 temp_loc.wide = 1;
2052 temp_loc.location = kLocPhysReg;
2053 temp_loc.reg = AllocTempWide();
2054
2055 if (cu_->target64) {
2056 DCHECK(!temp_loc.reg.IsPair());
2057 NewLIR2(kX86MovqrxRR, temp_loc.reg.GetReg(), vector_src.GetReg());
2058 } else {
2059 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetLowReg(), vector_src.GetReg());
2060 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2061 NewLIR2(kX86MovdrxRR, temp_loc.reg.GetHighReg(), vector_src.GetReg());
2062 }
2063
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002064 GenArithOpLong(Instruction::ADD_LONG_2ADDR, rl_dest, temp_loc, temp_loc, mir->optimization_flags);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002065 } else if (opsize == kSignedByte || opsize == kUnsignedByte) {
2066 RegStorage rs_tmp = Get128BitRegister(AllocTempDouble());
2067 NewLIR2(kX86PxorRR, rs_tmp.GetReg(), rs_tmp.GetReg());
2068 NewLIR2(kX86PsadbwRR, vector_src.GetReg(), rs_tmp.GetReg());
2069 NewLIR3(kX86PshufdRRI, rs_tmp.GetReg(), vector_src.GetReg(), 0x4e);
2070 NewLIR2(kX86PaddbRR, vector_src.GetReg(), rs_tmp.GetReg());
2071 // Move to a GPR
2072 temp = AllocTemp();
2073 NewLIR2(kX86MovdrxRR, temp.GetReg(), vector_src.GetReg());
2074 } else {
2075 // Handle and the int and short cases together
2076
2077 // Initialize as if we were handling int case. Below we update
2078 // the opcode if handling byte or short.
2079 int vec_bytes = (mir->dalvikInsn.vC & 0xFFFF) / 8;
2080 int vec_unit_size;
2081 int horizontal_add_opcode;
2082 int extract_opcode;
2083
2084 if (opsize == kSignedHalf || opsize == kUnsignedHalf) {
2085 extract_opcode = kX86PextrwRRI;
2086 horizontal_add_opcode = kX86PhaddwRR;
2087 vec_unit_size = 2;
2088 } else if (opsize == k32) {
2089 vec_unit_size = 4;
2090 horizontal_add_opcode = kX86PhadddRR;
2091 extract_opcode = kX86PextrdRRI;
2092 } else {
2093 LOG(FATAL) << "Unsupported vector add reduce " << opsize;
2094 return;
2095 }
2096
2097 int elems = vec_bytes / vec_unit_size;
2098
2099 while (elems > 1) {
2100 NewLIR2(horizontal_add_opcode, vector_src.GetReg(), vector_src.GetReg());
2101 elems >>= 1;
2102 }
2103
2104 // Handle this as arithmetic unary case.
2105 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2106
2107 // Extract to a GP register because this is integral typed.
2108 temp = AllocTemp();
2109 NewLIR3(extract_opcode, temp.GetReg(), vector_src.GetReg(), 0);
2110 }
2111
2112 if (opsize != k64 && opsize != kSingle && opsize != kDouble) {
2113 // The logic below looks very similar to the handling of ADD_INT_2ADDR
2114 // except the rhs is not a VR but a physical register allocated above.
2115 // No load of source VR is done because it assumes that rl_result will
2116 // share physical register / memory location.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002117 rl_result = UpdateLocTyped(rl_dest);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002118 if (rl_result.location == kLocPhysReg) {
2119 // Ensure res is in a core reg.
2120 rl_result = EvalLoc(rl_dest, kCoreReg, true);
2121 OpRegReg(kOpAdd, rl_result.reg, temp);
2122 StoreFinalValue(rl_dest, rl_result);
2123 } else {
2124 // Do the addition directly to memory.
Maxim Kazantsev085b7332015-02-24 15:07:55 +06002125 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002126 OpMemReg(kOpAdd, rl_result, temp.GetReg());
2127 }
2128 }
Mark Mendellfe945782014-05-22 09:52:36 -04002129}
2130
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002131void X86Mir2Lir::GenReduceVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002132 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2133 RegLocation rl_dest = mir_graph_->GetDest(mir);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002134 RegStorage vector_src = RegStorage::Solo128(mir->dalvikInsn.vB);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002135 RegLocation rl_result;
2136 bool is_wide = false;
2137
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002138 // There is a different path depending on type and size.
2139 if (opsize == kSingle) {
2140 // Handle float case.
2141 // TODO Add support for fast math (not value safe) and do horizontal add in that case.
Mark Mendellfe945782014-05-22 09:52:36 -04002142
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002143 int extract_index = mir->dalvikInsn.arg[0];
2144
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002145 rl_result = EvalLoc(rl_dest, kFPReg, true);
2146 NewLIR2(kX86PxorRR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002147
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002148 if (LIKELY(extract_index != 0)) {
2149 // We know the index of element which we want to extract. We want to extract it and
2150 // keep values in vector register correct for future use. So the way we act is:
2151 // 1. Generate shuffle mask that allows to swap zeroth and required elements;
2152 // 2. Shuffle vector register with this mask;
2153 // 3. Extract zeroth element where required value lies;
2154 // 4. Shuffle with same mask again to restore original values in vector register.
2155 // The mask is generated from equivalence mask 0b11100100 swapping 0th and extracted
2156 // element indices.
2157 int shuffle[4] = {0b00, 0b01, 0b10, 0b11};
2158 shuffle[0] = extract_index;
2159 shuffle[extract_index] = 0;
2160 int mask = 0;
2161 for (int i = 0; i < 4; i++) {
2162 mask |= (shuffle[i] << (2 * i));
2163 }
2164 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), mask);
2165 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
2166 NewLIR3(kX86ShufpsRRI, vector_src.GetReg(), vector_src.GetReg(), mask);
2167 } else {
2168 // We need to extract zeroth element and don't need any complex stuff to do it.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002169 NewLIR2(kX86AddssRR, rl_result.reg.GetReg(), vector_src.GetReg());
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002170 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002171
Maxim Kazantsev6f5f5d02014-12-08 12:39:16 +06002172 StoreFinalValue(rl_dest, rl_result);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002173 } else if (opsize == kDouble) {
2174 // TODO Handle double case.
2175 LOG(FATAL) << "Unsupported add reduce for double.";
2176 } else if (opsize == k64) {
2177 /*
2178 * Handle long case:
2179 * 1) Reduce the vector register to lower half (with addition).
2180 * 1-1) Get an xmm temp and fill it with vector register.
2181 * 1-2) Shift the xmm temp by 8-bytes.
2182 * 1-3) Add the xmm temp to vector register that is being reduced.
2183 * 2) Evaluate destination to a GP / GP pair.
2184 * 2-1) In 64-bit case, use movq to move result to a 64-bit GP.
2185 * 2-2) In 32-bit case, use movd twice to move to 32-bit GP pair.
2186 * 3) Store the result to the final destination.
2187 */
Udayan Banerji53cec002014-09-26 10:41:47 -07002188 NewLIR2(kX86PsrldqRI, vector_src.GetReg(), 8);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002189 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2190 if (cu_->target64) {
2191 DCHECK(!rl_result.reg.IsPair());
2192 NewLIR2(kX86MovqrxRR, rl_result.reg.GetReg(), vector_src.GetReg());
2193 } else {
2194 NewLIR2(kX86MovdrxRR, rl_result.reg.GetLowReg(), vector_src.GetReg());
2195 NewLIR2(kX86PsrlqRI, vector_src.GetReg(), 0x20);
2196 NewLIR2(kX86MovdrxRR, rl_result.reg.GetHighReg(), vector_src.GetReg());
2197 }
2198
2199 StoreValueWide(rl_dest, rl_result);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002200 } else {
Udayan Banerji53cec002014-09-26 10:41:47 -07002201 int extract_index = mir->dalvikInsn.arg[0];
2202 int extr_opcode = 0;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002203 rl_result = UpdateLocTyped(rl_dest);
Udayan Banerji53cec002014-09-26 10:41:47 -07002204
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002205 // Handle the rest of integral types now.
2206 switch (opsize) {
2207 case k32:
Udayan Banerji53cec002014-09-26 10:41:47 -07002208 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrdRRI : kX86PextrdMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002209 break;
2210 case kSignedHalf:
2211 case kUnsignedHalf:
Udayan Banerji53cec002014-09-26 10:41:47 -07002212 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrwRRI : kX86PextrwMRI;
2213 break;
2214 case kSignedByte:
2215 extr_opcode = (rl_result.location == kLocPhysReg) ? kX86PextrbRRI : kX86PextrbMRI;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002216 break;
2217 default:
2218 LOG(FATAL) << "Unsupported vector reduce " << opsize;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002219 UNREACHABLE();
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002220 }
2221
2222 if (rl_result.location == kLocPhysReg) {
2223 NewLIR3(extr_opcode, rl_result.reg.GetReg(), vector_src.GetReg(), extract_index);
Udayan Banerji53cec002014-09-26 10:41:47 -07002224 StoreFinalValue(rl_dest, rl_result);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002225 } else {
2226 int displacement = SRegOffset(rl_result.s_reg_low);
Mark Mendellb3cdf932015-01-27 09:51:26 -05002227 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Razvan A Lupusorub72c7232014-10-28 19:29:52 -07002228 LIR *l = NewLIR4(extr_opcode, rs_rX86_SP_32.GetReg(), displacement, vector_src.GetReg(),
2229 extract_index);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002230 AnnotateDalvikRegAccess(l, displacement >> 2, false /* is_load */, is_wide /* is_64bit */);
2231 }
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002232 }
Mark Mendellfe945782014-05-22 09:52:36 -04002233}
2234
Mark Mendell0a1174e2014-09-11 14:51:02 -04002235void X86Mir2Lir::LoadVectorRegister(RegStorage rs_dest, RegStorage rs_src,
2236 OpSize opsize, int op_mov) {
2237 if (!cu_->target64 && opsize == k64) {
2238 // Logic assumes that longs are loaded in GP register pairs.
2239 NewLIR2(kX86MovdxrRR, rs_dest.GetReg(), rs_src.GetLowReg());
2240 RegStorage r_tmp = AllocTempDouble();
2241 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), rs_src.GetHighReg());
2242 NewLIR2(kX86PunpckldqRR, rs_dest.GetReg(), r_tmp.GetReg());
2243 FreeTemp(r_tmp);
2244 } else {
2245 NewLIR2(op_mov, rs_dest.GetReg(), rs_src.GetReg());
2246 }
2247}
2248
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002249void X86Mir2Lir::GenSetVector(MIR* mir) {
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002250 DCHECK_EQ(mir->dalvikInsn.vC & 0xFFFF, 128U);
2251 OpSize opsize = static_cast<OpSize>(mir->dalvikInsn.vC >> 16);
2252 RegStorage rs_dest = RegStorage::Solo128(mir->dalvikInsn.vA);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002253 Clobber(rs_dest);
2254 int op_shuffle = 0, op_shuffle_high = 0, op_mov = kX86MovdxrRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002255 RegisterClass reg_type = kCoreReg;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002256 bool is_wide = false;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002257
Mark Mendellfe945782014-05-22 09:52:36 -04002258 switch (opsize) {
2259 case k32:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002260 op_shuffle = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002261 break;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002262 case kSingle:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002263 op_shuffle = kX86PshufdRRI;
2264 op_mov = kX86MovdqaRR;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002265 reg_type = kFPReg;
2266 break;
2267 case k64:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002268 op_shuffle = kX86PunpcklqdqRR;
Udayan Banerji53cec002014-09-26 10:41:47 -07002269 op_mov = kX86MovqxrRR;
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002270 is_wide = true;
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002271 break;
2272 case kSignedByte:
2273 case kUnsignedByte:
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002274 // We will have the source loaded up in a
2275 // double-word before we use this shuffle
2276 op_shuffle = kX86PshufdRRI;
2277 break;
Mark Mendellfe945782014-05-22 09:52:36 -04002278 case kSignedHalf:
2279 case kUnsignedHalf:
2280 // Handles low quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002281 op_shuffle = kX86PshuflwRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002282 // Handles upper quadword.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002283 op_shuffle_high = kX86PshufdRRI;
Mark Mendellfe945782014-05-22 09:52:36 -04002284 break;
2285 default:
2286 LOG(FATAL) << "Unsupported vector set " << opsize;
2287 break;
2288 }
2289
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002290 // Load the value from the VR into a physical register.
2291 RegLocation rl_src;
2292 if (!is_wide) {
2293 rl_src = mir_graph_->GetSrc(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002294 rl_src = LoadValue(rl_src, reg_type);
2295 } else {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002296 rl_src = mir_graph_->GetSrcWide(mir, 0);
Udayan Banerji60bfe7b2014-07-08 19:59:43 -07002297 rl_src = LoadValueWide(rl_src, reg_type);
2298 }
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002299 RegStorage reg_to_shuffle = rl_src.reg;
Mark Mendellfe945782014-05-22 09:52:36 -04002300
2301 // Load the value into the XMM register.
Mark Mendell0a1174e2014-09-11 14:51:02 -04002302 LoadVectorRegister(rs_dest, reg_to_shuffle, opsize, op_mov);
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002303
2304 if (opsize == kSignedByte || opsize == kUnsignedByte) {
2305 // In the byte case, first duplicate it to be a word
2306 // Then duplicate it to be a double-word
2307 NewLIR2(kX86PunpcklbwRR, rs_dest.GetReg(), rs_dest.GetReg());
2308 NewLIR2(kX86PunpcklwdRR, rs_dest.GetReg(), rs_dest.GetReg());
2309 }
Mark Mendellfe945782014-05-22 09:52:36 -04002310
2311 // Now shuffle the value across the destination.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002312 if (op_shuffle == kX86PunpcklqdqRR) {
2313 NewLIR2(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg());
2314 } else {
2315 NewLIR3(op_shuffle, rs_dest.GetReg(), rs_dest.GetReg(), 0);
2316 }
Mark Mendellfe945782014-05-22 09:52:36 -04002317
2318 // And then repeat as needed.
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002319 if (op_shuffle_high != 0) {
2320 NewLIR3(op_shuffle_high, rs_dest.GetReg(), rs_dest.GetReg(), 0);
Mark Mendellfe945782014-05-22 09:52:36 -04002321 }
2322}
2323
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01002324void X86Mir2Lir::GenPackedArrayGet(BasicBlock* bb ATTRIBUTE_UNUSED, MIR* mir ATTRIBUTE_UNUSED) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002325 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayGet not supported.";
2326}
2327
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01002328void X86Mir2Lir::GenPackedArrayPut(BasicBlock* bb ATTRIBUTE_UNUSED, MIR* mir ATTRIBUTE_UNUSED) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002329 UNIMPLEMENTED(FATAL) << "Extended opcode kMirOpPackedArrayPut not supported.";
2330}
2331
2332LIR* X86Mir2Lir::ScanVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002333 for (LIR *p = const_vectors_; p != nullptr; p = p->next) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002334 if (constants[0] == p->operands[0] && constants[1] == p->operands[1] &&
2335 constants[2] == p->operands[2] && constants[3] == p->operands[3]) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002336 return p;
2337 }
2338 }
2339 return nullptr;
2340}
2341
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002342LIR* X86Mir2Lir::AddVectorLiteral(int32_t* constants) {
Mark Mendelld65c51a2014-04-29 16:55:20 -04002343 LIR* new_value = static_cast<LIR*>(arena_->Alloc(sizeof(LIR), kArenaAllocData));
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002344 new_value->operands[0] = constants[0];
2345 new_value->operands[1] = constants[1];
2346 new_value->operands[2] = constants[2];
2347 new_value->operands[3] = constants[3];
Mark Mendelld65c51a2014-04-29 16:55:20 -04002348 new_value->next = const_vectors_;
2349 if (const_vectors_ == nullptr) {
Lupusoru, Razvan Ab3a84e22014-07-28 14:11:01 -07002350 estimated_native_code_size_ += 12; // Maximum needed to align to 16 byte boundary.
Mark Mendelld65c51a2014-04-29 16:55:20 -04002351 }
2352 estimated_native_code_size_ += 16; // Space for one vector.
2353 const_vectors_ = new_value;
2354 return new_value;
2355}
2356
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002357// ------------ ABI support: mapping of args to physical registers -------------
Serguei Katkov717a3e42014-11-13 17:19:42 +06002358RegStorage X86Mir2Lir::InToRegStorageX86_64Mapper::GetNextReg(ShortyArg arg) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002359 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3, kArg4, kArg5};
Serguei Katkov717a3e42014-11-13 17:19:42 +06002360 const size_t coreArgMappingToPhysicalRegSize = arraysize(coreArgMappingToPhysicalReg);
Chao-ying Fua77ee512014-07-01 17:43:41 -07002361 const SpecialTargetRegister fpArgMappingToPhysicalReg[] = {kFArg0, kFArg1, kFArg2, kFArg3,
Andreas Gampeccc60262014-07-04 18:02:38 -07002362 kFArg4, kFArg5, kFArg6, kFArg7};
Serguei Katkov717a3e42014-11-13 17:19:42 +06002363 const size_t fpArgMappingToPhysicalRegSize = arraysize(fpArgMappingToPhysicalReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002364
Serguei Katkov717a3e42014-11-13 17:19:42 +06002365 if (arg.IsFP()) {
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002366 if (cur_fp_reg_ < fpArgMappingToPhysicalRegSize) {
Serguei Katkov717a3e42014-11-13 17:19:42 +06002367 return m2l_->TargetReg(fpArgMappingToPhysicalReg[cur_fp_reg_++],
2368 arg.IsWide() ? kWide : kNotWide);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002369 }
2370 } else {
2371 if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
Serguei Katkov717a3e42014-11-13 17:19:42 +06002372 return m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2373 arg.IsRef() ? kRef : (arg.IsWide() ? kWide : kNotWide));
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002374 }
2375 }
Chao-ying Fua77ee512014-07-01 17:43:41 -07002376 return RegStorage::InvalidReg();
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002377}
2378
Serguei Katkov717a3e42014-11-13 17:19:42 +06002379RegStorage X86Mir2Lir::InToRegStorageX86Mapper::GetNextReg(ShortyArg arg) {
2380 const SpecialTargetRegister coreArgMappingToPhysicalReg[] = {kArg1, kArg2, kArg3};
2381 const size_t coreArgMappingToPhysicalRegSize = arraysize(coreArgMappingToPhysicalReg);
Mark P Mendell966c3ae2015-01-27 15:45:27 +00002382 const SpecialTargetRegister fpArgMappingToPhysicalReg[] = {kFArg0, kFArg1, kFArg2, kFArg3};
2383 const size_t fpArgMappingToPhysicalRegSize = arraysize(fpArgMappingToPhysicalReg);
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002384
Serguei Katkov717a3e42014-11-13 17:19:42 +06002385 RegStorage result = RegStorage::InvalidReg();
Mark P Mendell966c3ae2015-01-27 15:45:27 +00002386 if (arg.IsFP()) {
2387 if (cur_fp_reg_ < fpArgMappingToPhysicalRegSize) {
2388 return m2l_->TargetReg(fpArgMappingToPhysicalReg[cur_fp_reg_++],
2389 arg.IsWide() ? kWide : kNotWide);
2390 }
Mark Mendell3e6a3bf2015-01-19 14:09:22 -05002391 } else if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
2392 result = m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++],
2393 arg.IsRef() ? kRef : kNotWide);
2394 if (arg.IsWide()) {
2395 // This must be a long, as double is handled above.
2396 // Ensure that we don't split a long across the last register and the stack.
2397 if (cur_core_reg_ == coreArgMappingToPhysicalRegSize) {
2398 // Leave the last core register unused and force the whole long to the stack.
2399 cur_core_reg_++;
2400 result = RegStorage::InvalidReg();
2401 } else if (cur_core_reg_ < coreArgMappingToPhysicalRegSize) {
Mark P Mendell966c3ae2015-01-27 15:45:27 +00002402 result = RegStorage::MakeRegPair(
2403 result, m2l_->TargetReg(coreArgMappingToPhysicalReg[cur_core_reg_++], kNotWide));
2404 }
Serguei Katkov717a3e42014-11-13 17:19:42 +06002405 }
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002406 }
Serguei Katkov717a3e42014-11-13 17:19:42 +06002407 return result;
Dmitry Petrochenko58994cd2014-05-17 01:02:18 +07002408}
2409
2410// ---------End of ABI support: mapping of args to physical registers -------------
2411
Andreas Gampe98430592014-07-27 19:44:50 -07002412bool X86Mir2Lir::GenInlinedCharAt(CallInfo* info) {
2413 // Location of reference to data array
2414 int value_offset = mirror::String::ValueOffset().Int32Value();
2415 // Location of count
2416 int count_offset = mirror::String::CountOffset().Int32Value();
Andreas Gampe98430592014-07-27 19:44:50 -07002417
2418 RegLocation rl_obj = info->args[0];
2419 RegLocation rl_idx = info->args[1];
2420 rl_obj = LoadValue(rl_obj, kRefReg);
Jeff Hao848f70a2014-01-15 13:49:50 -08002421 rl_idx = LoadValue(rl_idx, kCoreReg);
Andreas Gampe98430592014-07-27 19:44:50 -07002422 RegStorage reg_max;
2423 GenNullCheck(rl_obj.reg, info->opt_flags);
2424 bool range_check = (!(info->opt_flags & MIR_IGNORE_RANGE_CHECK));
2425 LIR* range_check_branch = nullptr;
Andreas Gampe98430592014-07-27 19:44:50 -07002426 if (range_check) {
2427 // On x86, we can compare to memory directly
2428 // Set up a launch pad to allow retry in case of bounds violation */
2429 if (rl_idx.is_const) {
2430 LIR* comparison;
2431 range_check_branch = OpCmpMemImmBranch(
Vladimir Marko00ca8472015-01-26 14:06:46 +00002432 kCondLs, RegStorage::InvalidReg(), rl_obj.reg, count_offset,
Andreas Gampe98430592014-07-27 19:44:50 -07002433 mir_graph_->ConstantValue(rl_idx.orig_sreg), nullptr, &comparison);
2434 MarkPossibleNullPointerExceptionAfter(0, comparison);
2435 } else {
2436 OpRegMem(kOpCmp, rl_idx.reg, rl_obj.reg, count_offset);
2437 MarkPossibleNullPointerException(0);
2438 range_check_branch = OpCondBranch(kCondUge, nullptr);
2439 }
2440 }
Andreas Gampe98430592014-07-27 19:44:50 -07002441 RegLocation rl_dest = InlineTarget(info);
2442 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Jeff Hao848f70a2014-01-15 13:49:50 -08002443 LoadBaseIndexedDisp(rl_obj.reg, rl_idx.reg, 1, value_offset, rl_result.reg, kUnsignedHalf);
2444 FreeTemp(rl_idx.reg);
2445 FreeTemp(rl_obj.reg);
Andreas Gampe98430592014-07-27 19:44:50 -07002446 StoreValue(rl_dest, rl_result);
2447 if (range_check) {
2448 DCHECK(range_check_branch != nullptr);
2449 info->opt_flags |= MIR_IGNORE_NULL_CHECK; // Record that we've already null checked.
2450 AddIntrinsicSlowPath(info, range_check_branch);
2451 }
2452 return true;
2453}
2454
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002455bool X86Mir2Lir::GenInlinedCurrentThread(CallInfo* info) {
2456 RegLocation rl_dest = InlineTarget(info);
2457
2458 // Early exit if the result is unused.
2459 if (rl_dest.orig_sreg < 0) {
2460 return true;
2461 }
2462
2463 RegLocation rl_result = EvalLoc(rl_dest, kRefReg, true);
2464
2465 if (cu_->target64) {
2466 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<8>());
2467 } else {
2468 OpRegThreadMem(kOpMov, rl_result.reg, Thread::PeerOffset<4>());
2469 }
2470
2471 StoreValue(rl_dest, rl_result);
2472 return true;
2473}
2474
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002475/**
2476 * Lock temp registers for explicit usage. Registers will be freed in destructor.
2477 */
2478X86Mir2Lir::ExplicitTempRegisterLock::ExplicitTempRegisterLock(X86Mir2Lir* mir_to_lir,
2479 int n_regs, ...) :
2480 temp_regs_(n_regs),
2481 mir_to_lir_(mir_to_lir) {
2482 va_list regs;
2483 va_start(regs, n_regs);
2484 for (int i = 0; i < n_regs; i++) {
2485 RegStorage reg = *(va_arg(regs, RegStorage*));
2486 RegisterInfo* info = mir_to_lir_->GetRegInfo(reg);
2487
2488 // Make sure we don't have promoted register here.
2489 DCHECK(info->IsTemp());
2490
2491 temp_regs_.push_back(reg);
2492 mir_to_lir_->FlushReg(reg);
2493
2494 if (reg.IsPair()) {
2495 RegStorage partner = info->Partner();
2496 temp_regs_.push_back(partner);
2497 mir_to_lir_->FlushReg(partner);
2498 }
2499
2500 mir_to_lir_->Clobber(reg);
2501 mir_to_lir_->LockTemp(reg);
2502 }
2503
2504 va_end(regs);
2505}
2506
2507/*
2508 * Free all locked registers.
2509 */
2510X86Mir2Lir::ExplicitTempRegisterLock::~ExplicitTempRegisterLock() {
2511 // Free all locked temps.
2512 for (auto it : temp_regs_) {
2513 mir_to_lir_->FreeTemp(it);
2514 }
2515}
2516
Serguei Katkov717a3e42014-11-13 17:19:42 +06002517int X86Mir2Lir::GenDalvikArgsBulkCopy(CallInfo* info, int first, int count) {
2518 if (count < 4) {
2519 // It does not make sense to use this utility if we have no chance to use
2520 // 128-bit move.
2521 return count;
2522 }
2523 GenDalvikArgsFlushPromoted(info, first);
2524
2525 // The rest can be copied together
2526 int current_src_offset = SRegOffset(info->args[first].s_reg_low);
2527 int current_dest_offset = StackVisitor::GetOutVROffset(first, cu_->instruction_set);
2528
2529 // Only davik regs are accessed in this loop; no next_call_insn() calls.
2530 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2531 while (count > 0) {
2532 // This is based on the knowledge that the stack itself is 16-byte aligned.
2533 bool src_is_16b_aligned = (current_src_offset & 0xF) == 0;
2534 bool dest_is_16b_aligned = (current_dest_offset & 0xF) == 0;
2535 size_t bytes_to_move;
2536
2537 /*
2538 * The amount to move defaults to 32-bit. If there are 4 registers left to move, then do a
2539 * a 128-bit move because we won't get the chance to try to aligned. If there are more than
2540 * 4 registers left to move, consider doing a 128-bit only if either src or dest are aligned.
2541 * We do this because we could potentially do a smaller move to align.
2542 */
2543 if (count == 4 || (count > 4 && (src_is_16b_aligned || dest_is_16b_aligned))) {
2544 // Moving 128-bits via xmm register.
2545 bytes_to_move = sizeof(uint32_t) * 4;
2546
2547 // Allocate a free xmm temp. Since we are working through the calling sequence,
2548 // we expect to have an xmm temporary available. AllocTempDouble will abort if
2549 // there are no free registers.
2550 RegStorage temp = AllocTempDouble();
2551
2552 LIR* ld1 = nullptr;
2553 LIR* ld2 = nullptr;
2554 LIR* st1 = nullptr;
2555 LIR* st2 = nullptr;
2556
2557 /*
2558 * The logic is similar for both loads and stores. If we have 16-byte alignment,
2559 * do an aligned move. If we have 8-byte alignment, then do the move in two
2560 * parts. This approach prevents possible cache line splits. Finally, fall back
2561 * to doing an unaligned move. In most cases we likely won't split the cache
2562 * line but we cannot prove it and thus take a conservative approach.
2563 */
2564 bool src_is_8b_aligned = (current_src_offset & 0x7) == 0;
2565 bool dest_is_8b_aligned = (current_dest_offset & 0x7) == 0;
2566
2567 if (src_is_16b_aligned) {
2568 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovA128FP);
2569 } else if (src_is_8b_aligned) {
2570 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovLo128FP);
2571 ld2 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset + (bytes_to_move >> 1),
2572 kMovHi128FP);
2573 } else {
2574 ld1 = OpMovRegMem(temp, TargetPtrReg(kSp), current_src_offset, kMovU128FP);
2575 }
2576
2577 if (dest_is_16b_aligned) {
2578 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovA128FP);
2579 } else if (dest_is_8b_aligned) {
2580 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovLo128FP);
2581 st2 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset + (bytes_to_move >> 1),
2582 temp, kMovHi128FP);
2583 } else {
2584 st1 = OpMovMemReg(TargetPtrReg(kSp), current_dest_offset, temp, kMovU128FP);
2585 }
2586
2587 // TODO If we could keep track of aliasing information for memory accesses that are wider
2588 // than 64-bit, we wouldn't need to set up a barrier.
2589 if (ld1 != nullptr) {
2590 if (ld2 != nullptr) {
2591 // For 64-bit load we can actually set up the aliasing information.
2592 AnnotateDalvikRegAccess(ld1, current_src_offset >> 2, true, true);
2593 AnnotateDalvikRegAccess(ld2, (current_src_offset + (bytes_to_move >> 1)) >> 2, true,
2594 true);
2595 } else {
2596 // Set barrier for 128-bit load.
2597 ld1->u.m.def_mask = &kEncodeAll;
2598 }
2599 }
2600 if (st1 != nullptr) {
2601 if (st2 != nullptr) {
2602 // For 64-bit store we can actually set up the aliasing information.
2603 AnnotateDalvikRegAccess(st1, current_dest_offset >> 2, false, true);
2604 AnnotateDalvikRegAccess(st2, (current_dest_offset + (bytes_to_move >> 1)) >> 2, false,
2605 true);
2606 } else {
2607 // Set barrier for 128-bit store.
2608 st1->u.m.def_mask = &kEncodeAll;
2609 }
2610 }
2611
2612 // Free the temporary used for the data movement.
2613 FreeTemp(temp);
2614 } else {
2615 // Moving 32-bits via general purpose register.
2616 bytes_to_move = sizeof(uint32_t);
2617
2618 // Instead of allocating a new temp, simply reuse one of the registers being used
2619 // for argument passing.
2620 RegStorage temp = TargetReg(kArg3, kNotWide);
2621
2622 // Now load the argument VR and store to the outs.
2623 Load32Disp(TargetPtrReg(kSp), current_src_offset, temp);
2624 Store32Disp(TargetPtrReg(kSp), current_dest_offset, temp);
2625 }
2626
2627 current_src_offset += bytes_to_move;
2628 current_dest_offset += bytes_to_move;
2629 count -= (bytes_to_move >> 2);
2630 }
2631 DCHECK_EQ(count, 0);
2632 return count;
2633}
2634
Brian Carlstrom7934ac22013-07-26 10:54:15 -07002635} // namespace art