blob: a8706c3b09427b356b3f346acff756399c726703 [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
17/* This file contains codegen for the X86 ISA */
18
19#include "codegen_x86.h"
Andreas Gampe0b9203e2015-01-22 20:39:27 -080020
Mathieu Chartiere401d142015-04-22 13:56:20 -070021#include "art_method.h"
Vladimir Marko80afd022015-05-19 18:08:00 +010022#include "base/bit_utils.h"
Andreas Gampe0b9203e2015-01-22 20:39:27 -080023#include "base/logging.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070024#include "dex/quick/mir_to_lir-inl.h"
buzbeeb5860fb2014-06-21 15:31:01 -070025#include "dex/reg_storage_eq.h"
Ian Rogers7e70b002014-10-08 11:47:24 -070026#include "mirror/array-inl.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070027#include "x86_lir.h"
28
29namespace art {
30
31/*
Brian Carlstrom7940e442013-07-12 13:46:57 -070032 * Compare two 64-bit values
33 * x = y return 0
34 * x < y return -1
35 * x > y return 1
36 */
37void X86Mir2Lir::GenCmpLong(RegLocation rl_dest, RegLocation rl_src1,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070038 RegLocation rl_src2) {
Elena Sayapinadd644502014-07-01 18:39:52 +070039 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -070040 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
41 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
42 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Chao-ying Fua0147762014-06-06 18:38:49 -070043 RegStorage temp_reg = AllocTemp();
Serguei Katkov1c557032014-06-23 13:23:38 +070044 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
45 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondG); // result = (src1 > src2) ? 1 : 0
46 NewLIR2(kX86Set8R, temp_reg.GetReg(), kX86CondL); // temp = (src1 >= src2) ? 0 : 1
47 NewLIR2(kX86Sub8RR, rl_result.reg.GetReg(), temp_reg.GetReg());
48 NewLIR2(kX86Movsx8qRR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Serguei Katkov04982232014-06-20 18:17:16 +070049
Chao-ying Fua0147762014-06-06 18:38:49 -070050 StoreValue(rl_dest, rl_result);
51 FreeTemp(temp_reg);
52 return;
53 }
54
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +070055 // Prepare for explicit register usage
56 ExplicitTempRegisterLock(this, 4, &rs_r0, &rs_r1, &rs_r2, &rs_r3);
buzbee091cc402014-03-31 10:14:40 -070057 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
58 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -080059 LoadValueDirectWideFixed(rl_src1, r_tmp1);
60 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Brian Carlstrom7940e442013-07-12 13:46:57 -070061 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -080062 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
63 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
buzbee091cc402014-03-31 10:14:40 -070064 NewLIR2(kX86Set8R, rs_r2.GetReg(), kX86CondL); // r2 = (r1:r0) < (r3:r2) ? 1 : 0
65 NewLIR2(kX86Movzx8RR, rs_r2.GetReg(), rs_r2.GetReg());
buzbee2700f7e2014-03-07 09:46:20 -080066 OpReg(kOpNeg, rs_r2); // r2 = -r2
67 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = high | low - sets ZF
buzbee091cc402014-03-31 10:14:40 -070068 NewLIR2(kX86Set8R, rs_r0.GetReg(), kX86CondNz); // r0 = (r1:r0) != (r3:r2) ? 1 : 0
Brian Carlstrom7940e442013-07-12 13:46:57 -070069 NewLIR2(kX86Movzx8RR, r0, r0);
buzbee2700f7e2014-03-07 09:46:20 -080070 OpRegReg(kOpOr, rs_r0, rs_r2); // r0 = r0 | r2
Brian Carlstrom7940e442013-07-12 13:46:57 -070071 RegLocation rl_result = LocCReturn();
72 StoreValue(rl_dest, rl_result);
73}
74
75X86ConditionCode X86ConditionEncoding(ConditionCode cond) {
76 switch (cond) {
77 case kCondEq: return kX86CondEq;
78 case kCondNe: return kX86CondNe;
79 case kCondCs: return kX86CondC;
80 case kCondCc: return kX86CondNc;
Vladimir Marko58af1f92013-12-19 13:31:15 +000081 case kCondUlt: return kX86CondC;
82 case kCondUge: return kX86CondNc;
Brian Carlstrom7940e442013-07-12 13:46:57 -070083 case kCondMi: return kX86CondS;
84 case kCondPl: return kX86CondNs;
85 case kCondVs: return kX86CondO;
86 case kCondVc: return kX86CondNo;
87 case kCondHi: return kX86CondA;
88 case kCondLs: return kX86CondBe;
89 case kCondGe: return kX86CondGe;
90 case kCondLt: return kX86CondL;
91 case kCondGt: return kX86CondG;
92 case kCondLe: return kX86CondLe;
93 case kCondAl:
94 case kCondNv: LOG(FATAL) << "Should not reach here";
95 }
96 return kX86CondO;
97}
98
buzbee2700f7e2014-03-07 09:46:20 -080099LIR* X86Mir2Lir::OpCmpBranch(ConditionCode cond, RegStorage src1, RegStorage src2, LIR* target) {
Chao-ying Fua77ee512014-07-01 17:43:41 -0700100 NewLIR2(src1.Is64Bit() ? kX86Cmp64RR : kX86Cmp32RR, src1.GetReg(), src2.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700101 X86ConditionCode cc = X86ConditionEncoding(cond);
102 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ ,
103 cc);
104 branch->target = target;
105 return branch;
106}
107
buzbee2700f7e2014-03-07 09:46:20 -0800108LIR* X86Mir2Lir::OpCmpImmBranch(ConditionCode cond, RegStorage reg,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700109 int check_value, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700110 if ((check_value == 0) && (cond == kCondEq || cond == kCondNe)) {
111 // TODO: when check_value == 0 and reg is rCX, use the jcxz/nz opcode
Chao-ying Fua77ee512014-07-01 17:43:41 -0700112 NewLIR2(reg.Is64Bit() ? kX86Test64RR: kX86Test32RR, reg.GetReg(), reg.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700113 } else {
Chao-ying Fua77ee512014-07-01 17:43:41 -0700114 if (reg.Is64Bit()) {
115 NewLIR2(IS_SIMM8(check_value) ? kX86Cmp64RI8 : kX86Cmp64RI, reg.GetReg(), check_value);
116 } else {
117 NewLIR2(IS_SIMM8(check_value) ? kX86Cmp32RI8 : kX86Cmp32RI, reg.GetReg(), check_value);
118 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700119 }
120 X86ConditionCode cc = X86ConditionEncoding(cond);
121 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ , cc);
122 branch->target = target;
123 return branch;
124}
125
buzbee2700f7e2014-03-07 09:46:20 -0800126LIR* X86Mir2Lir::OpRegCopyNoInsert(RegStorage r_dest, RegStorage r_src) {
127 // If src or dest is a pair, we'll be using low reg.
128 if (r_dest.IsPair()) {
129 r_dest = r_dest.GetLow();
130 }
131 if (r_src.IsPair()) {
132 r_src = r_src.GetLow();
133 }
buzbee091cc402014-03-31 10:14:40 -0700134 if (r_dest.IsFloat() || r_src.IsFloat())
Brian Carlstrom7940e442013-07-12 13:46:57 -0700135 return OpFpRegCopy(r_dest, r_src);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700136 LIR* res = RawLIR(current_dalvik_offset_, r_dest.Is64Bit() ? kX86Mov64RR : kX86Mov32RR,
buzbee2700f7e2014-03-07 09:46:20 -0800137 r_dest.GetReg(), r_src.GetReg());
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800138 if (!(cu_->disable_opt & (1 << kSafeOptimizations)) && r_dest == r_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700139 res->flags.is_nop = true;
140 }
141 return res;
142}
143
buzbee7a11ab02014-04-28 20:02:38 -0700144void X86Mir2Lir::OpRegCopy(RegStorage r_dest, RegStorage r_src) {
145 if (r_dest != r_src) {
146 LIR *res = OpRegCopyNoInsert(r_dest, r_src);
147 AppendLIR(res);
148 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700149}
150
buzbee2700f7e2014-03-07 09:46:20 -0800151void X86Mir2Lir::OpRegCopyWide(RegStorage r_dest, RegStorage r_src) {
buzbee7a11ab02014-04-28 20:02:38 -0700152 if (r_dest != r_src) {
buzbee091cc402014-03-31 10:14:40 -0700153 bool dest_fp = r_dest.IsFloat();
154 bool src_fp = r_src.IsFloat();
buzbee7a11ab02014-04-28 20:02:38 -0700155 if (dest_fp) {
156 if (src_fp) {
buzbee091cc402014-03-31 10:14:40 -0700157 OpRegCopy(r_dest, r_src);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700158 } else {
buzbee7a11ab02014-04-28 20:02:38 -0700159 // TODO: Prevent this from happening in the code. The result is often
160 // unused or could have been loaded more easily from memory.
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700161 if (!r_src.IsPair()) {
162 DCHECK(!r_dest.IsPair());
163 NewLIR2(kX86MovqxrRR, r_dest.GetReg(), r_src.GetReg());
164 } else {
165 NewLIR2(kX86MovdxrRR, r_dest.GetReg(), r_src.GetLowReg());
166 RegStorage r_tmp = AllocTempDouble();
167 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), r_src.GetHighReg());
168 NewLIR2(kX86PunpckldqRR, r_dest.GetReg(), r_tmp.GetReg());
169 FreeTemp(r_tmp);
170 }
buzbee7a11ab02014-04-28 20:02:38 -0700171 }
172 } else {
173 if (src_fp) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700174 if (!r_dest.IsPair()) {
175 DCHECK(!r_src.IsPair());
176 NewLIR2(kX86MovqrxRR, r_dest.GetReg(), r_src.GetReg());
buzbee7a11ab02014-04-28 20:02:38 -0700177 } else {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700178 NewLIR2(kX86MovdrxRR, r_dest.GetLowReg(), r_src.GetReg());
179 RegStorage temp_reg = AllocTempDouble();
180 NewLIR2(kX86MovsdRR, temp_reg.GetReg(), r_src.GetReg());
181 NewLIR2(kX86PsrlqRI, temp_reg.GetReg(), 32);
182 NewLIR2(kX86MovdrxRR, r_dest.GetHighReg(), temp_reg.GetReg());
183 }
184 } else {
185 DCHECK_EQ(r_dest.IsPair(), r_src.IsPair());
186 if (!r_src.IsPair()) {
187 // Just copy the register directly.
188 OpRegCopy(r_dest, r_src);
189 } else {
190 // Handle overlap
191 if (r_src.GetHighReg() == r_dest.GetLowReg() &&
192 r_src.GetLowReg() == r_dest.GetHighReg()) {
193 // Deal with cycles.
194 RegStorage temp_reg = AllocTemp();
195 OpRegCopy(temp_reg, r_dest.GetHigh());
196 OpRegCopy(r_dest.GetHigh(), r_dest.GetLow());
197 OpRegCopy(r_dest.GetLow(), temp_reg);
198 FreeTemp(temp_reg);
199 } else if (r_src.GetHighReg() == r_dest.GetLowReg()) {
200 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
201 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
202 } else {
203 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
204 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
205 }
buzbee7a11ab02014-04-28 20:02:38 -0700206 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700207 }
208 }
209 }
210}
211
Andreas Gampe90969af2014-07-15 23:02:11 -0700212void X86Mir2Lir::GenSelectConst32(RegStorage left_op, RegStorage right_op, ConditionCode code,
213 int32_t true_val, int32_t false_val, RegStorage rs_dest,
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700214 RegisterClass dest_reg_class) {
Serguei Katkov9ee45192014-07-17 14:39:03 +0700215 DCHECK(!left_op.IsPair() && !right_op.IsPair() && !rs_dest.IsPair());
216 DCHECK(!left_op.IsFloat() && !right_op.IsFloat() && !rs_dest.IsFloat());
217
218 // We really need this check for correctness, otherwise we will need to do more checks in
219 // non zero/one case
220 if (true_val == false_val) {
221 LoadConstantNoClobber(rs_dest, true_val);
222 return;
Andreas Gampe90969af2014-07-15 23:02:11 -0700223 }
224
Serguei Katkov9ee45192014-07-17 14:39:03 +0700225 const bool dest_intersect = IsSameReg(rs_dest, left_op) || IsSameReg(rs_dest, right_op);
226
227 const bool zero_one_case = (true_val == 0 && false_val == 1) || (true_val == 1 && false_val == 0);
228 if (zero_one_case && IsByteRegister(rs_dest)) {
229 if (!dest_intersect) {
230 LoadConstantNoClobber(rs_dest, 0);
231 }
232 OpRegReg(kOpCmp, left_op, right_op);
233 // Set the low byte of the result to 0 or 1 from the compare condition code.
234 NewLIR2(kX86Set8R, rs_dest.GetReg(),
235 X86ConditionEncoding(true_val == 1 ? code : FlipComparisonOrder(code)));
236 if (dest_intersect) {
237 NewLIR2(rs_dest.Is64Bit() ? kX86Movzx8qRR : kX86Movzx8RR, rs_dest.GetReg(), rs_dest.GetReg());
238 }
239 } else {
240 // Be careful rs_dest can be changed only after cmp because it can be the same as one of ops
241 // and it cannot use xor because it makes cc flags to be dirty
242 RegStorage temp_reg = AllocTypedTemp(false, dest_reg_class, false);
243 if (temp_reg.Valid()) {
244 if (false_val == 0 && dest_intersect) {
245 code = FlipComparisonOrder(code);
246 std::swap(true_val, false_val);
247 }
248 if (!dest_intersect) {
249 LoadConstantNoClobber(rs_dest, false_val);
250 }
251 LoadConstantNoClobber(temp_reg, true_val);
252 OpRegReg(kOpCmp, left_op, right_op);
253 if (dest_intersect) {
254 LoadConstantNoClobber(rs_dest, false_val);
255 DCHECK(!last_lir_insn_->u.m.def_mask->HasBit(ResourceMask::kCCode));
256 }
257 OpCondRegReg(kOpCmov, code, rs_dest, temp_reg);
258 FreeTemp(temp_reg);
259 } else {
260 // slow path
261 LIR* cmp_branch = OpCmpBranch(code, left_op, right_op, nullptr);
262 LoadConstantNoClobber(rs_dest, false_val);
263 LIR* that_is_it = NewLIR1(kX86Jmp8, 0);
264 LIR* true_case = NewLIR0(kPseudoTargetLabel);
265 cmp_branch->target = true_case;
266 LoadConstantNoClobber(rs_dest, true_val);
267 LIR* end = NewLIR0(kPseudoTargetLabel);
268 that_is_it->target = end;
269 }
270 }
Andreas Gampe90969af2014-07-15 23:02:11 -0700271}
272
Roland Levillain4b8f1ec2015-08-26 18:34:03 +0100273void X86Mir2Lir::GenSelect(BasicBlock* bb ATTRIBUTE_UNUSED, MIR* mir) {
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800274 RegLocation rl_result;
275 RegLocation rl_src = mir_graph_->GetSrc(mir, 0);
276 RegLocation rl_dest = mir_graph_->GetDest(mir);
buzbeea0cd2d72014-06-01 09:33:49 -0700277 // Avoid using float regs here.
278 RegisterClass src_reg_class = rl_src.ref ? kRefReg : kCoreReg;
279 RegisterClass result_reg_class = rl_dest.ref ? kRefReg : kCoreReg;
Vladimir Markoa1a70742014-03-03 10:28:05 +0000280 ConditionCode ccode = mir->meta.ccode;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800281
282 // The kMirOpSelect has two variants, one for constants and one for moves.
283 const bool is_constant_case = (mir->ssa_rep->num_uses == 1);
284
285 if (is_constant_case) {
286 int true_val = mir->dalvikInsn.vB;
287 int false_val = mir->dalvikInsn.vC;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800288
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700289 // simplest strange case
290 if (true_val == false_val) {
291 rl_result = EvalLoc(rl_dest, result_reg_class, true);
292 LoadConstantNoClobber(rl_result.reg, true_val);
293 } else {
294 // TODO: use GenSelectConst32 and handle additional opcode patterns such as
295 // "cmp; setcc; movzx" or "cmp; sbb r0,r0; and r0,$mask; add r0,$literal".
296 rl_src = LoadValue(rl_src, src_reg_class);
297 rl_result = EvalLoc(rl_dest, result_reg_class, true);
298 /*
299 * For ccode == kCondEq:
300 *
301 * 1) When the true case is zero and result_reg is not same as src_reg:
302 * xor result_reg, result_reg
303 * cmp $0, src_reg
304 * mov t1, $false_case
305 * cmovnz result_reg, t1
306 * 2) When the false case is zero and result_reg is not same as src_reg:
307 * xor result_reg, result_reg
308 * cmp $0, src_reg
309 * mov t1, $true_case
310 * cmovz result_reg, t1
311 * 3) All other cases (we do compare first to set eflags):
312 * cmp $0, src_reg
313 * mov result_reg, $false_case
314 * mov t1, $true_case
315 * cmovz result_reg, t1
316 */
317 // FIXME: depending on how you use registers you could get a false != mismatch when dealing
318 // with different views of the same underlying physical resource (i.e. solo32 vs. solo64).
319 const bool result_reg_same_as_src =
320 (rl_src.location == kLocPhysReg && rl_src.reg.GetRegNum() == rl_result.reg.GetRegNum());
321 const bool true_zero_case = (true_val == 0 && false_val != 0 && !result_reg_same_as_src);
322 const bool false_zero_case = (false_val == 0 && true_val != 0 && !result_reg_same_as_src);
323 const bool catch_all_case = !(true_zero_case || false_zero_case);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800324
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700325 if (true_zero_case || false_zero_case) {
326 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
327 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800328
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700329 if (true_zero_case || false_zero_case || catch_all_case) {
330 OpRegImm(kOpCmp, rl_src.reg, 0);
331 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800332
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700333 if (catch_all_case) {
334 OpRegImm(kOpMov, rl_result.reg, false_val);
335 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800336
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700337 if (true_zero_case || false_zero_case || catch_all_case) {
338 ConditionCode cc = true_zero_case ? NegateComparison(ccode) : ccode;
339 int immediateForTemp = true_zero_case ? false_val : true_val;
340 RegStorage temp1_reg = AllocTypedTemp(false, result_reg_class);
341 OpRegImm(kOpMov, temp1_reg, immediateForTemp);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800342
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700343 OpCondRegReg(kOpCmov, cc, rl_result.reg, temp1_reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800344
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700345 FreeTemp(temp1_reg);
346 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800347 }
348 } else {
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700349 rl_src = LoadValue(rl_src, src_reg_class);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800350 RegLocation rl_true = mir_graph_->GetSrc(mir, 1);
351 RegLocation rl_false = mir_graph_->GetSrc(mir, 2);
buzbeea0cd2d72014-06-01 09:33:49 -0700352 rl_true = LoadValue(rl_true, result_reg_class);
353 rl_false = LoadValue(rl_false, result_reg_class);
354 rl_result = EvalLoc(rl_dest, result_reg_class, true);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800355
356 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000357 * For ccode == kCondEq:
358 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800359 * 1) When true case is already in place:
360 * cmp $0, src_reg
361 * cmovnz result_reg, false_reg
362 * 2) When false case is already in place:
363 * cmp $0, src_reg
364 * cmovz result_reg, true_reg
365 * 3) When neither cases are in place:
366 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000367 * mov result_reg, false_reg
368 * cmovz result_reg, true_reg
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800369 */
370
371 // kMirOpSelect is generated just for conditional cases when comparison is done with zero.
buzbee2700f7e2014-03-07 09:46:20 -0800372 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800373
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000374 if (rl_result.reg.GetReg() == rl_true.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800375 OpCondRegReg(kOpCmov, NegateComparison(ccode), rl_result.reg, rl_false.reg);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000376 } else if (rl_result.reg.GetReg() == rl_false.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800377 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800378 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800379 OpRegCopy(rl_result.reg, rl_false.reg);
380 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800381 }
382 }
383
384 StoreValue(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700385}
386
387void X86Mir2Lir::GenFusedLongCmpBranch(BasicBlock* bb, MIR* mir) {
buzbee0d829482013-10-11 15:24:55 -0700388 LIR* taken = &block_label_list_[bb->taken];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700389 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
390 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
Vladimir Markoa8946072014-01-22 10:30:44 +0000391 ConditionCode ccode = mir->meta.ccode;
Mark Mendell412d4f82013-12-18 13:32:36 -0800392
393 if (rl_src1.is_const) {
394 std::swap(rl_src1, rl_src2);
395 ccode = FlipComparisonOrder(ccode);
396 }
397 if (rl_src2.is_const) {
398 // Do special compare/branch against simple const operand
399 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
400 GenFusedLongCmpImmBranch(bb, rl_src1, val, ccode);
401 return;
402 }
403
Elena Sayapinadd644502014-07-01 18:39:52 +0700404 if (cu_->target64) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700405 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
406 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
407
408 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
409 OpCondBranch(ccode, taken);
410 return;
411 }
412
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700413 // Prepare for explicit register usage
414 ExplicitTempRegisterLock(this, 4, &rs_r0, &rs_r1, &rs_r2, &rs_r3);
buzbee091cc402014-03-31 10:14:40 -0700415 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
416 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -0800417 LoadValueDirectWideFixed(rl_src1, r_tmp1);
418 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700419
Brian Carlstrom7940e442013-07-12 13:46:57 -0700420 // Swap operands and condition code to prevent use of zero flag.
421 if (ccode == kCondLe || ccode == kCondGt) {
422 // Compute (r3:r2) = (r3:r2) - (r1:r0)
buzbee2700f7e2014-03-07 09:46:20 -0800423 OpRegReg(kOpSub, rs_r2, rs_r0); // r2 = r2 - r0
424 OpRegReg(kOpSbc, rs_r3, rs_r1); // r3 = r3 - r1 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700425 } else {
426 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -0800427 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
428 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700429 }
430 switch (ccode) {
431 case kCondEq:
432 case kCondNe:
buzbee2700f7e2014-03-07 09:46:20 -0800433 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = r0 | r1
Brian Carlstrom7940e442013-07-12 13:46:57 -0700434 break;
435 case kCondLe:
436 ccode = kCondGe;
437 break;
438 case kCondGt:
439 ccode = kCondLt;
440 break;
441 case kCondLt:
442 case kCondGe:
443 break;
444 default:
445 LOG(FATAL) << "Unexpected ccode: " << ccode;
446 }
447 OpCondBranch(ccode, taken);
448}
449
Mark Mendell412d4f82013-12-18 13:32:36 -0800450void X86Mir2Lir::GenFusedLongCmpImmBranch(BasicBlock* bb, RegLocation rl_src1,
451 int64_t val, ConditionCode ccode) {
452 int32_t val_lo = Low32Bits(val);
453 int32_t val_hi = High32Bits(val);
454 LIR* taken = &block_label_list_[bb->taken];
Mark Mendell412d4f82013-12-18 13:32:36 -0800455 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Mark Mendell752e2052014-05-01 10:19:04 -0400456 bool is_equality_test = ccode == kCondEq || ccode == kCondNe;
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700457
Elena Sayapinadd644502014-07-01 18:39:52 +0700458 if (cu_->target64) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700459 if (is_equality_test && val == 0) {
460 // We can simplify of comparing for ==, != to 0.
461 NewLIR2(kX86Test64RR, rl_src1.reg.GetReg(), rl_src1.reg.GetReg());
462 } else if (is_equality_test && val_hi == 0 && val_lo > 0) {
463 OpRegImm(kOpCmp, rl_src1.reg, val_lo);
464 } else {
465 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
466 LoadConstantWide(tmp, val);
467 OpRegReg(kOpCmp, rl_src1.reg, tmp);
468 FreeTemp(tmp);
469 }
470 OpCondBranch(ccode, taken);
471 return;
472 }
473
Mark Mendell752e2052014-05-01 10:19:04 -0400474 if (is_equality_test && val != 0) {
475 rl_src1 = ForceTempWide(rl_src1);
476 }
buzbee2700f7e2014-03-07 09:46:20 -0800477 RegStorage low_reg = rl_src1.reg.GetLow();
478 RegStorage high_reg = rl_src1.reg.GetHigh();
Mark Mendell412d4f82013-12-18 13:32:36 -0800479
Mark Mendell752e2052014-05-01 10:19:04 -0400480 if (is_equality_test) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700481 // We can simplify of comparing for ==, != to 0.
Mark Mendell752e2052014-05-01 10:19:04 -0400482 if (val == 0) {
483 if (IsTemp(low_reg)) {
484 OpRegReg(kOpOr, low_reg, high_reg);
485 // We have now changed it; ignore the old values.
486 Clobber(rl_src1.reg);
487 } else {
488 RegStorage t_reg = AllocTemp();
489 OpRegRegReg(kOpOr, t_reg, low_reg, high_reg);
490 FreeTemp(t_reg);
491 }
492 OpCondBranch(ccode, taken);
493 return;
494 }
495
496 // Need to compute the actual value for ==, !=.
497 OpRegImm(kOpSub, low_reg, val_lo);
498 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
499 OpRegReg(kOpOr, high_reg, low_reg);
500 Clobber(rl_src1.reg);
501 } else if (ccode == kCondLe || ccode == kCondGt) {
502 // Swap operands and condition code to prevent use of zero flag.
503 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
504 LoadConstantWide(tmp, val);
505 OpRegReg(kOpSub, tmp.GetLow(), low_reg);
506 OpRegReg(kOpSbc, tmp.GetHigh(), high_reg);
507 ccode = (ccode == kCondLe) ? kCondGe : kCondLt;
508 FreeTemp(tmp);
509 } else {
510 // We can use a compare for the low word to set CF.
511 OpRegImm(kOpCmp, low_reg, val_lo);
512 if (IsTemp(high_reg)) {
513 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
514 // We have now changed it; ignore the old values.
515 Clobber(rl_src1.reg);
516 } else {
517 // mov temp_reg, high_reg; sbb temp_reg, high_constant
518 RegStorage t_reg = AllocTemp();
519 OpRegCopy(t_reg, high_reg);
520 NewLIR2(kX86Sbb32RI, t_reg.GetReg(), val_hi);
521 FreeTemp(t_reg);
522 }
Mark Mendell412d4f82013-12-18 13:32:36 -0800523 }
524
Mark Mendell752e2052014-05-01 10:19:04 -0400525 OpCondBranch(ccode, taken);
Mark Mendell412d4f82013-12-18 13:32:36 -0800526}
527
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700528void X86Mir2Lir::CalculateMagicAndShift(int64_t divisor, int64_t& magic, int& shift, bool is_long) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800529 // It does not make sense to calculate magic and shift for zero divisor.
530 DCHECK_NE(divisor, 0);
531
532 /* According to H.S.Warren's Hacker's Delight Chapter 10 and
533 * T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
534 * The magic number M and shift S can be calculated in the following way:
535 * Let nc be the most positive value of numerator(n) such that nc = kd - 1,
536 * where divisor(d) >=2.
537 * Let nc be the most negative value of numerator(n) such that nc = kd + 1,
538 * where divisor(d) <= -2.
539 * Thus nc can be calculated like:
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700540 * nc = exp + exp % d - 1, where d >= 2 and exp = 2^31 for int or 2^63 for long
541 * nc = -exp + (exp + 1) % d, where d >= 2 and exp = 2^31 for int or 2^63 for long
Mark Mendell2bf31e62014-01-23 12:13:40 -0800542 *
543 * So the shift p is the smallest p satisfying
544 * 2^p > nc * (d - 2^p % d), where d >= 2
545 * 2^p > nc * (d + 2^p % d), where d <= -2.
546 *
547 * the magic number M is calcuated by
548 * M = (2^p + d - 2^p % d) / d, where d >= 2
549 * M = (2^p - d - 2^p % d) / d, where d <= -2.
550 *
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700551 * Notice that p is always bigger than or equal to 32/64, so we just return 32-p/64-p as
Mark Mendell2bf31e62014-01-23 12:13:40 -0800552 * the shift number S.
553 */
554
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700555 int64_t p = (is_long) ? 63 : 31;
556 const uint64_t exp = (is_long) ? 0x8000000000000000ULL : 0x80000000U;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800557
558 // Initialize the computations.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700559 uint64_t abs_d = (divisor >= 0) ? divisor : -divisor;
560 uint64_t tmp = exp + ((is_long) ? static_cast<uint64_t>(divisor) >> 63 :
561 static_cast<uint32_t>(divisor) >> 31);
562 uint64_t abs_nc = tmp - 1 - tmp % abs_d;
563 uint64_t quotient1 = exp / abs_nc;
564 uint64_t remainder1 = exp % abs_nc;
565 uint64_t quotient2 = exp / abs_d;
566 uint64_t remainder2 = exp % abs_d;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800567
568 /*
569 * To avoid handling both positive and negative divisor, Hacker's Delight
570 * introduces a method to handle these 2 cases together to avoid duplication.
571 */
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700572 uint64_t delta;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800573 do {
574 p++;
575 quotient1 = 2 * quotient1;
576 remainder1 = 2 * remainder1;
577 if (remainder1 >= abs_nc) {
578 quotient1++;
579 remainder1 = remainder1 - abs_nc;
580 }
581 quotient2 = 2 * quotient2;
582 remainder2 = 2 * remainder2;
583 if (remainder2 >= abs_d) {
584 quotient2++;
585 remainder2 = remainder2 - abs_d;
586 }
587 delta = abs_d - remainder2;
588 } while (quotient1 < delta || (quotient1 == delta && remainder1 == 0));
589
590 magic = (divisor > 0) ? (quotient2 + 1) : (-quotient2 - 1);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700591
592 if (!is_long) {
593 magic = static_cast<int>(magic);
594 }
595
596 shift = (is_long) ? p - 64 : p - 32;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800597}
598
Roland Levillain4b8f1ec2015-08-26 18:34:03 +0100599RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest ATTRIBUTE_UNUSED,
600 RegStorage reg_lo ATTRIBUTE_UNUSED,
601 int lit ATTRIBUTE_UNUSED,
602 bool is_div ATTRIBUTE_UNUSED) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700603 LOG(FATAL) << "Unexpected use of GenDivRemLit for x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700604 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700605}
606
Mark Mendell2bf31e62014-01-23 12:13:40 -0800607RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegLocation rl_src,
608 int imm, bool is_div) {
609 // Use a multiply (and fixup) to perform an int div/rem by a constant.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700610 RegLocation rl_result;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800611
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700612 if (imm == 1) {
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700613 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800614 if (is_div) {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700615 // x / 1 == x.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700616 LoadValueDirectFixed(rl_src, rl_result.reg);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700617 } else {
618 // x % 1 == 0.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700619 LoadConstantNoClobber(rl_result.reg, 0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700620 }
621 } else if (imm == -1) { // handle 0x80000000 / -1 special case.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700622 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700623 if (is_div) {
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700624 LoadValueDirectFixed(rl_src, rl_result.reg);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400625
626 // Check if numerator is 0
627 OpRegImm(kOpCmp, rl_result.reg, 0);
628 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
629
630 // handle 0x80000000 / -1
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700631 OpRegImm(kOpCmp, rl_result.reg, 0x80000000);
632 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800633
634 // for x != MIN_INT, x / -1 == -x.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700635 NewLIR1(kX86Neg32R, rl_result.reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800636
Mark Mendell2bf31e62014-01-23 12:13:40 -0800637 // EAX already contains the right value (0x80000000),
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700638 minint_branch->target = NewLIR0(kPseudoTargetLabel);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400639 branch->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800640 } else {
641 // x % -1 == 0.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700642 LoadConstantNoClobber(rl_result.reg, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800643 }
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700644 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
645 // Division using shifting.
646 rl_src = LoadValue(rl_src, kCoreReg);
647 rl_result = EvalLoc(rl_dest, kCoreReg, true);
648 if (IsSameReg(rl_result.reg, rl_src.reg)) {
649 RegStorage rs_temp = AllocTypedTemp(false, kCoreReg);
650 rl_result.reg.SetReg(rs_temp.GetReg());
651 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400652
653 // Check if numerator is 0
654 OpRegImm(kOpCmp, rl_src.reg, 0);
655 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
656 LoadConstantNoClobber(rl_result.reg, 0);
657 LIR* done = NewLIR1(kX86Jmp8, 0);
658 branch->target = NewLIR0(kPseudoTargetLabel);
659
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700660 NewLIR3(kX86Lea32RM, rl_result.reg.GetReg(), rl_src.reg.GetReg(), std::abs(imm) - 1);
661 NewLIR2(kX86Test32RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
662 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
Andreas Gampe7e499922015-01-06 08:28:12 -0800663 int shift_amount = CTZ(imm);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700664 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
665 if (imm < 0) {
666 OpReg(kOpNeg, rl_result.reg);
667 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400668 done->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800669 } else {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700670 CHECK(imm <= -2 || imm >= 2);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700671
Mark Mendell2bf31e62014-01-23 12:13:40 -0800672 // Use H.S.Warren's Hacker's Delight Chapter 10 and
673 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700674 int64_t magic;
675 int shift;
676 CalculateMagicAndShift((int64_t)imm, magic, shift, false /* is_long */);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800677
678 /*
679 * For imm >= 2,
680 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
681 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
682 * For imm <= -2,
683 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
684 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
685 * We implement this algorithm in the following way:
686 * 1. multiply magic number m and numerator n, get the higher 32bit result in EDX
687 * 2. if imm > 0 and magic < 0, add numerator to EDX
688 * if imm < 0 and magic > 0, sub numerator from EDX
689 * 3. if S !=0, SAR S bits for EDX
690 * 4. add 1 to EDX if EDX < 0
691 * 5. Thus, EDX is the quotient
692 */
693
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700694 FlushReg(rs_r0);
695 Clobber(rs_r0);
696 LockTemp(rs_r0);
697 FlushReg(rs_r2);
698 Clobber(rs_r2);
699 LockTemp(rs_r2);
700
Mark Mendell3a91f442014-09-02 12:44:24 -0400701 // Assume that the result will be in EDX for divide, and EAX for remainder.
702 rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, is_div ? rs_r2 : rs_r0,
703 INVALID_SREG, INVALID_SREG};
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700704
Mark Mendell3a91f442014-09-02 12:44:24 -0400705 // We need the value at least twice. Load into a temp.
706 rl_src = LoadValue(rl_src, kCoreReg);
707 RegStorage numerator_reg = rl_src.reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800708
Mark Mendell3a91f442014-09-02 12:44:24 -0400709 // Check if numerator is 0.
710 OpRegImm(kOpCmp, numerator_reg, 0);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400711 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell3a91f442014-09-02 12:44:24 -0400712 // Return result 0 if numerator was 0.
713 LoadConstantNoClobber(rl_result.reg, 0);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400714 LIR* done = NewLIR1(kX86Jmp8, 0);
715 branch->target = NewLIR0(kPseudoTargetLabel);
716
Mark Mendell3a91f442014-09-02 12:44:24 -0400717 // EAX = magic.
718 LoadConstant(rs_r0, magic);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800719
Mark Mendell3a91f442014-09-02 12:44:24 -0400720 // EDX:EAX = magic * numerator.
721 NewLIR1(kX86Imul32DaR, numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800722
723 if (imm > 0 && magic < 0) {
724 // Add numerator to EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800725 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700726 NewLIR2(kX86Add32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800727 } else if (imm < 0 && magic > 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800728 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700729 NewLIR2(kX86Sub32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800730 }
731
732 // Do we need the shift?
733 if (shift != 0) {
734 // Shift EDX by 'shift' bits.
buzbee091cc402014-03-31 10:14:40 -0700735 NewLIR2(kX86Sar32RI, rs_r2.GetReg(), shift);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800736 }
737
738 // Add 1 to EDX if EDX < 0.
739
740 // Move EDX to EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800741 OpRegCopy(rs_r0, rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800742
743 // Move sign bit to bit 0, zeroing the rest.
buzbee091cc402014-03-31 10:14:40 -0700744 NewLIR2(kX86Shr32RI, rs_r2.GetReg(), 31);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800745
746 // EDX = EDX + EAX.
buzbee091cc402014-03-31 10:14:40 -0700747 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r0.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800748
749 // Quotient is in EDX.
750 if (!is_div) {
751 // We need to compute the remainder.
752 // Remainder is divisor - (quotient * imm).
buzbee2700f7e2014-03-07 09:46:20 -0800753 DCHECK(numerator_reg.Valid());
754 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800755
756 // EAX = numerator * imm.
buzbee2700f7e2014-03-07 09:46:20 -0800757 OpRegRegImm(kOpMul, rs_r2, rs_r2, imm);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800758
Mark Mendell3a91f442014-09-02 12:44:24 -0400759 // EAX -= EDX.
buzbee091cc402014-03-31 10:14:40 -0700760 NewLIR2(kX86Sub32RR, rs_r0.GetReg(), rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800761
762 // For this case, return the result in EAX.
Mark Mendell2bf31e62014-01-23 12:13:40 -0800763 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400764 done->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800765 }
766
767 return rl_result;
768}
769
Roland Levillain4b8f1ec2015-08-26 18:34:03 +0100770RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest ATTRIBUTE_UNUSED,
771 RegStorage reg_lo ATTRIBUTE_UNUSED,
772 RegStorage reg_hi ATTRIBUTE_UNUSED,
773 bool is_div ATTRIBUTE_UNUSED) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700774 LOG(FATAL) << "Unexpected use of GenDivRem for x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700775 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700776}
777
Roland Levillain4b8f1ec2015-08-26 18:34:03 +0100778RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest ATTRIBUTE_UNUSED,
779 RegLocation rl_src1,
780 RegLocation rl_src2,
781 bool is_div,
782 int flags) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800783 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700784
785 // Prepare for explicit register usage.
786 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800787
788 // Load LHS into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800789 LoadValueDirectFixed(rl_src1, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800790
791 // Load RHS into EBX.
buzbee2700f7e2014-03-07 09:46:20 -0800792 LoadValueDirectFixed(rl_src2, rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800793
794 // Copy LHS sign bit into EDX.
795 NewLIR0(kx86Cdq32Da);
796
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -0700797 if ((flags & MIR_IGNORE_DIV_ZERO_CHECK) == 0) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800798 // Handle division by zero case.
Mingyao Yange643a172014-04-08 11:02:52 -0700799 GenDivZeroCheck(rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800800 }
801
Yixin Shou2ddd1752014-08-26 15:15:13 -0400802 // Check if numerator is 0
803 OpRegImm(kOpCmp, rs_r0, 0);
804 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
805
Mark Mendell2bf31e62014-01-23 12:13:40 -0800806 // Have to catch 0x80000000/-1 case, or we will get an exception!
buzbee2700f7e2014-03-07 09:46:20 -0800807 OpRegImm(kOpCmp, rs_r1, -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700808 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800809
810 // RHS is -1.
buzbee2700f7e2014-03-07 09:46:20 -0800811 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700812 LIR* minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800813
Yixin Shou2ddd1752014-08-26 15:15:13 -0400814 branch->target = NewLIR0(kPseudoTargetLabel);
815
Mark Mendell2bf31e62014-01-23 12:13:40 -0800816 // In 0x80000000/-1 case.
817 if (!is_div) {
818 // For DIV, EAX is already right. For REM, we need EDX 0.
buzbee2700f7e2014-03-07 09:46:20 -0800819 LoadConstantNoClobber(rs_r2, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800820 }
821 LIR* done = NewLIR1(kX86Jmp8, 0);
822
823 // Expected case.
824 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
825 minint_branch->target = minus_one_branch->target;
buzbee091cc402014-03-31 10:14:40 -0700826 NewLIR1(kX86Idivmod32DaR, rs_r1.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800827 done->target = NewLIR0(kPseudoTargetLabel);
828
829 // Result is in EAX for div and EDX for rem.
buzbee091cc402014-03-31 10:14:40 -0700830 RegLocation rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, rs_r0, INVALID_SREG, INVALID_SREG};
Mark Mendell2bf31e62014-01-23 12:13:40 -0800831 if (!is_div) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000832 rl_result.reg.SetReg(r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800833 }
834 return rl_result;
835}
836
David Srbecky1109fb32015-04-07 20:21:06 +0100837static dwarf::Reg DwarfCoreReg(bool is_x86_64, int num) {
838 return is_x86_64 ? dwarf::Reg::X86_64Core(num) : dwarf::Reg::X86Core(num);
839}
840
Serban Constantinescu23abec92014-07-02 16:13:38 +0100841bool X86Mir2Lir::GenInlinedMinMax(CallInfo* info, bool is_min, bool is_long) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700842 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800843
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700844 if (is_long && !cu_->target64) {
845 /*
846 * We want to implement the following algorithm
847 * mov eax, low part of arg1
848 * mov edx, high part of arg1
849 * mov ebx, low part of arg2
850 * mov ecx, high part of arg2
851 * mov edi, eax
852 * sub edi, ebx
853 * mov edi, edx
854 * sbb edi, ecx
855 * is_min ? "cmovgel eax, ebx" : "cmovll eax, ebx"
856 * is_min ? "cmovgel edx, ecx" : "cmovll edx, ecx"
857 *
858 * The algorithm above needs 5 registers: a pair for the first operand
859 * (which later will be used as result), a pair for the second operand
860 * and a temp register (e.g. 'edi') for intermediate calculations.
861 * Ideally we have 6 GP caller-save registers in 32-bit mode. They are:
862 * 'eax', 'ebx', 'ecx', 'edx', 'esi' and 'edi'. So there should be
863 * always enough registers to operate on. Practically, there is a pair
864 * of registers 'edi' and 'esi' which holds promoted values and
865 * sometimes should be treated as 'callee save'. If one of the operands
866 * is in the promoted registers then we have enough register to
867 * operate on. Otherwise there is lack of resources and we have to
868 * save 'edi' before calculations and restore after.
869 */
870
871 RegLocation rl_src1 = info->args[0];
872 RegLocation rl_src2 = info->args[2];
873 RegLocation rl_dest = InlineTargetWide(info);
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700874
Mark Mendella65c1db2014-10-21 17:44:32 -0400875 if (rl_dest.s_reg_low == INVALID_SREG) {
876 // Result is unused, the code is dead. Inlining successful, no code generated.
877 return true;
878 }
879
nikolay serdjuk55693282015-01-20 17:03:02 +0600880 if (PartiallyIntersects(rl_src1, rl_dest) &&
881 PartiallyIntersects(rl_src2, rl_dest)) {
882 // A special case which we don't want to handle.
883 // This is when src1 is mapped on v0 and v1,
884 // src2 is mapped on v2, v3,
885 // result is mapped on v1, v2
886 return false;
887 }
888
889
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700890 /*
891 * If the result register is the same as the second element, then we
892 * need to be careful. The reason is that the first copy will
893 * inadvertently clobber the second element with the first one thus
894 * yielding the wrong result. Thus we do a swap in that case.
895 */
nikolay serdjuk55693282015-01-20 17:03:02 +0600896 if (Intersects(rl_src2, rl_dest)) {
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700897 std::swap(rl_src1, rl_src2);
898 }
899
900 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
901 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
902
903 // Pick the first integer as min/max.
904 OpRegCopyWide(rl_result.reg, rl_src1.reg);
905
906 /*
907 * If the integers are both in the same register, then there is
908 * nothing else to do because they are equal and we have already
909 * moved one into the result.
910 */
nikolay serdjuk55693282015-01-20 17:03:02 +0600911 if (mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
912 mir_graph_->SRegToVReg(rl_src2.s_reg_low)) {
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700913 StoreValueWide(rl_dest, rl_result);
914 return true;
915 }
916
917 // Free registers to make some room for the second operand.
nikolay serdjuk55693282015-01-20 17:03:02 +0600918 // But don't try to free part of a source which intersects
919 // part of result or promoted registers.
920
921 if (IsTemp(rl_src1.reg.GetLow()) &&
922 (rl_src1.reg.GetLowReg() != rl_result.reg.GetHighReg()) &&
923 (rl_src1.reg.GetLowReg() != rl_result.reg.GetLowReg())) {
924 // Is low part temporary and doesn't intersect any parts of result?
925 FreeTemp(rl_src1.reg.GetLow());
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700926 }
nikolay serdjuk55693282015-01-20 17:03:02 +0600927
928 if (IsTemp(rl_src1.reg.GetHigh()) &&
929 (rl_src1.reg.GetHighReg() != rl_result.reg.GetLowReg()) &&
930 (rl_src1.reg.GetHighReg() != rl_result.reg.GetHighReg())) {
931 // Is high part temporary and doesn't intersect any parts of result?
932 FreeTemp(rl_src1.reg.GetHigh());
933 }
934
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700935 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
936
937 // Do we have a free register for intermediate calculations?
938 RegStorage tmp = AllocTemp(false);
David Srbecky1109fb32015-04-07 20:21:06 +0100939 const int kRegSize = cu_->target64 ? 8 : 4;
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700940 if (tmp == RegStorage::InvalidReg()) {
941 /*
942 * No, will use 'edi'.
943 *
944 * As mentioned above we have 4 temporary and 2 promotable
945 * caller-save registers. Therefore, we assume that a free
946 * register can be allocated only if 'esi' and 'edi' are
947 * already used as operands. If number of promotable registers
948 * increases from 2 to 4 then our assumption fails and operand
949 * data is corrupted.
950 * Let's DCHECK it.
951 */
952 DCHECK(IsTemp(rl_src2.reg.GetLow()) &&
953 IsTemp(rl_src2.reg.GetHigh()) &&
954 IsTemp(rl_result.reg.GetLow()) &&
955 IsTemp(rl_result.reg.GetHigh()));
956 tmp = rs_rDI;
957 NewLIR1(kX86Push32R, tmp.GetReg());
David Srbecky1109fb32015-04-07 20:21:06 +0100958 cfi_.AdjustCFAOffset(kRegSize);
959 // Record cfi only if it is not already spilled.
960 if (!CoreSpillMaskContains(tmp.GetReg())) {
961 cfi_.RelOffset(DwarfCoreReg(cu_->target64, tmp.GetReg()), 0);
962 }
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700963 }
964
965 // Now we are ready to do calculations.
966 OpRegReg(kOpMov, tmp, rl_result.reg.GetLow());
967 OpRegReg(kOpSub, tmp, rl_src2.reg.GetLow());
968 OpRegReg(kOpMov, tmp, rl_result.reg.GetHigh());
969 OpRegReg(kOpSbc, tmp, rl_src2.reg.GetHigh());
970
971 // Let's put pop 'edi' here to break a bit the dependency chain.
972 if (tmp == rs_rDI) {
973 NewLIR1(kX86Pop32R, tmp.GetReg());
David Srbecky1109fb32015-04-07 20:21:06 +0100974 cfi_.AdjustCFAOffset(-kRegSize);
975 if (!CoreSpillMaskContains(tmp.GetReg())) {
976 cfi_.Restore(DwarfCoreReg(cu_->target64, tmp.GetReg()));
977 }
nikolay serdjuk55693282015-01-20 17:03:02 +0600978 } else {
979 FreeTemp(tmp);
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700980 }
981
982 // Conditionally move the other integer into the destination register.
983 ConditionCode cc = is_min ? kCondGe : kCondLt;
984 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetLow(), rl_src2.reg.GetLow());
985 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetHigh(), rl_src2.reg.GetHigh());
nikolay serdjuk55693282015-01-20 17:03:02 +0600986 FreeTemp(rl_src2.reg);
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700987 StoreValueWide(rl_dest, rl_result);
988 return true;
Serban Constantinescu23abec92014-07-02 16:13:38 +0100989 }
990
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800991 // Get the two arguments to the invoke and place them in GP registers.
Chao-ying Fuff87d7b2015-01-19 15:51:57 -0800992 RegLocation rl_dest = (is_long) ? InlineTargetWide(info) : InlineTarget(info);
993 if (rl_dest.s_reg_low == INVALID_SREG) {
994 // Result is unused, the code is dead. Inlining successful, no code generated.
995 return true;
996 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700997 RegLocation rl_src1 = info->args[0];
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700998 RegLocation rl_src2 = (is_long) ? info->args[2] : info->args[1];
999 rl_src1 = (is_long) ? LoadValueWide(rl_src1, kCoreReg) : LoadValue(rl_src1, kCoreReg);
1000 rl_src2 = (is_long) ? LoadValueWide(rl_src2, kCoreReg) : LoadValue(rl_src2, kCoreReg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -08001001
Brian Carlstrom7940e442013-07-12 13:46:57 -07001002 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -08001003
1004 /*
1005 * If the result register is the same as the second element, then we need to be careful.
1006 * The reason is that the first copy will inadvertently clobber the second element with
1007 * the first one thus yielding the wrong result. Thus we do a swap in that case.
1008 */
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001009 if (rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -08001010 std::swap(rl_src1, rl_src2);
1011 }
1012
1013 // Pick the first integer as min/max.
buzbee2700f7e2014-03-07 09:46:20 -08001014 OpRegCopy(rl_result.reg, rl_src1.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -08001015
1016 // If the integers are both in the same register, then there is nothing else to do
1017 // because they are equal and we have already moved one into the result.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001018 if (rl_src1.reg.GetReg() != rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -08001019 // It is possible we didn't pick correctly so do the actual comparison now.
buzbee2700f7e2014-03-07 09:46:20 -08001020 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -08001021
1022 // Conditionally move the other integer into the destination register.
1023 ConditionCode condition_code = is_min ? kCondGt : kCondLt;
buzbee2700f7e2014-03-07 09:46:20 -08001024 OpCondRegReg(kOpCmov, condition_code, rl_result.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -08001025 }
1026
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001027 if (is_long) {
Vladimir Markoe508a202013-11-04 15:24:22 +00001028 StoreValueWide(rl_dest, rl_result);
1029 } else {
Vladimir Markoe508a202013-11-04 15:24:22 +00001030 StoreValue(rl_dest, rl_result);
1031 }
1032 return true;
1033}
1034
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001035bool X86Mir2Lir::GenInlinedPeek(CallInfo* info, OpSize size) {
Chao-ying Fuff87d7b2015-01-19 15:51:57 -08001036 RegLocation rl_dest = size == k64 ? InlineTargetWide(info) : InlineTarget(info);
1037 if (rl_dest.s_reg_low == INVALID_SREG) {
1038 // Result is unused, the code is dead. Inlining successful, no code generated.
1039 return true;
1040 }
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +07001041 RegLocation rl_src_address = info->args[0]; // long address
1042 RegLocation rl_address;
1043 if (!cu_->target64) {
1044 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
1045 rl_address = LoadValue(rl_src_address, kCoreReg);
1046 } else {
1047 rl_address = LoadValueWide(rl_src_address, kCoreReg);
1048 }
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +07001049 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1050 // Unaligned access is allowed on x86.
1051 LoadBaseDisp(rl_address.reg, 0, rl_result.reg, size, kNotVolatile);
1052 if (size == k64) {
1053 StoreValueWide(rl_dest, rl_result);
1054 } else {
1055 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
1056 StoreValue(rl_dest, rl_result);
1057 }
1058 return true;
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001059}
1060
Vladimir Markoe508a202013-11-04 15:24:22 +00001061bool X86Mir2Lir::GenInlinedPoke(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +07001062 RegLocation rl_src_address = info->args[0]; // long address
1063 RegLocation rl_address;
1064 if (!cu_->target64) {
1065 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
1066 rl_address = LoadValue(rl_src_address, kCoreReg);
1067 } else {
1068 rl_address = LoadValueWide(rl_src_address, kCoreReg);
1069 }
1070 RegLocation rl_src_value = info->args[2]; // [size] value
1071 RegLocation rl_value;
1072 if (size == k64) {
1073 // Unaligned access is allowed on x86.
1074 rl_value = LoadValueWide(rl_src_value, kCoreReg);
1075 } else {
1076 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
1077 // In 32-bit mode the only EAX..EDX registers can be used with Mov8MR.
1078 if (!cu_->target64 && size == kSignedByte) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001079 rl_src_value = UpdateLocTyped(rl_src_value);
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +07001080 if (rl_src_value.location == kLocPhysReg && !IsByteRegister(rl_src_value.reg)) {
1081 RegStorage temp = AllocateByteRegister();
1082 OpRegCopy(temp, rl_src_value.reg);
1083 rl_value.reg = temp;
1084 } else {
1085 rl_value = LoadValue(rl_src_value, kCoreReg);
1086 }
1087 } else {
1088 rl_value = LoadValue(rl_src_value, kCoreReg);
1089 }
1090 }
1091 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size, kNotVolatile);
1092 return true;
Vladimir Markoe508a202013-11-04 15:24:22 +00001093}
1094
buzbee2700f7e2014-03-07 09:46:20 -08001095void X86Mir2Lir::OpLea(RegStorage r_base, RegStorage reg1, RegStorage reg2, int scale, int offset) {
1096 NewLIR5(kX86Lea32RA, r_base.GetReg(), reg1.GetReg(), reg2.GetReg(), scale, offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001097}
1098
Ian Rogersdd7624d2014-03-14 17:43:00 -07001099void X86Mir2Lir::OpTlsCmp(ThreadOffset<4> offset, int val) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001100 DCHECK_EQ(kX86, cu_->instruction_set);
1101 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
1102}
1103
1104void X86Mir2Lir::OpTlsCmp(ThreadOffset<8> offset, int val) {
1105 DCHECK_EQ(kX86_64, cu_->instruction_set);
Ian Rogers468532e2013-08-05 10:56:33 -07001106 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001107}
1108
buzbee2700f7e2014-03-07 09:46:20 -08001109static bool IsInReg(X86Mir2Lir *pMir2Lir, const RegLocation &rl, RegStorage reg) {
1110 return rl.reg.Valid() && rl.reg.GetReg() == reg.GetReg() && (pMir2Lir->IsLive(reg) || rl.home);
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001111}
1112
Vladimir Marko1c282e22013-11-21 14:49:47 +00001113bool X86Mir2Lir::GenInlinedCas(CallInfo* info, bool is_long, bool is_object) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +07001114 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001115 // Unused - RegLocation rl_src_unsafe = info->args[0];
1116 RegLocation rl_src_obj = info->args[1]; // Object - known non-null
1117 RegLocation rl_src_offset = info->args[2]; // long low
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001118 if (!cu_->target64) {
1119 rl_src_offset = NarrowRegLoc(rl_src_offset); // ignore high half in info->args[3]
1120 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001121 RegLocation rl_src_expected = info->args[4]; // int, long or Object
1122 // If is_long, high half is in info->args[5]
1123 RegLocation rl_src_new_value = info->args[is_long ? 6 : 5]; // int, long or Object
1124 // If is_long, high half is in info->args[7]
David Srbecky1109fb32015-04-07 20:21:06 +01001125 const int kRegSize = cu_->target64 ? 8 : 4;
Vladimir Markoc29bb612013-11-27 16:47:25 +00001126
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001127 if (is_long && cu_->target64) {
1128 // RAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in RAX.
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001129 FlushReg(rs_r0q);
1130 Clobber(rs_r0q);
1131 LockTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001132
1133 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
1134 RegLocation rl_new_value = LoadValueWide(rl_src_new_value, kCoreReg);
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001135 RegLocation rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1136 LoadValueDirectWide(rl_src_expected, rs_r0q);
Andreas Gampeccc60262014-07-04 18:02:38 -07001137 NewLIR5(kX86LockCmpxchg64AR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1138 rl_new_value.reg.GetReg());
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001139
1140 // After a store we need to insert barrier in case of potential load. Since the
1141 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
Hans Boehm48f5c472014-06-27 14:50:10 -07001142 GenMemBarrier(kAnyAny);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001143
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001144 FreeTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001145 } else if (is_long) {
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001146 // TODO: avoid unnecessary loads of SI and DI when the values are in registers.
Vladimir Marko70b797d2013-12-03 15:25:24 +00001147 FlushAllRegs();
1148 LockCallTemps();
buzbee091cc402014-03-31 10:14:40 -07001149 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
1150 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_rBX, rs_rCX);
buzbee2700f7e2014-03-07 09:46:20 -08001151 LoadValueDirectWideFixed(rl_src_expected, r_tmp1);
1152 LoadValueDirectWideFixed(rl_src_new_value, r_tmp2);
buzbee695d13a2014-04-19 13:32:20 -07001153 // FIXME: needs 64-bit update.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001154 const bool obj_in_di = IsInReg(this, rl_src_obj, rs_rDI);
1155 const bool obj_in_si = IsInReg(this, rl_src_obj, rs_rSI);
1156 DCHECK(!obj_in_si || !obj_in_di);
1157 const bool off_in_di = IsInReg(this, rl_src_offset, rs_rDI);
1158 const bool off_in_si = IsInReg(this, rl_src_offset, rs_rSI);
1159 DCHECK(!off_in_si || !off_in_di);
1160 // If obj/offset is in a reg, use that reg. Otherwise, use the empty reg.
1161 RegStorage rs_obj = obj_in_di ? rs_rDI : obj_in_si ? rs_rSI : !off_in_di ? rs_rDI : rs_rSI;
1162 RegStorage rs_off = off_in_si ? rs_rSI : off_in_di ? rs_rDI : !obj_in_si ? rs_rSI : rs_rDI;
1163 bool push_di = (!obj_in_di && !off_in_di) && (rs_obj == rs_rDI || rs_off == rs_rDI);
1164 bool push_si = (!obj_in_si && !off_in_si) && (rs_obj == rs_rSI || rs_off == rs_rSI);
1165 if (push_di) {
1166 NewLIR1(kX86Push32R, rs_rDI.GetReg());
1167 MarkTemp(rs_rDI);
1168 LockTemp(rs_rDI);
David Srbecky1109fb32015-04-07 20:21:06 +01001169 cfi_.AdjustCFAOffset(kRegSize);
1170 // Record cfi only if it is not already spilled.
1171 if (!CoreSpillMaskContains(rs_rDI.GetReg())) {
1172 cfi_.RelOffset(DwarfCoreReg(cu_->target64, rs_rDI.GetReg()), 0);
1173 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001174 }
1175 if (push_si) {
1176 NewLIR1(kX86Push32R, rs_rSI.GetReg());
1177 MarkTemp(rs_rSI);
1178 LockTemp(rs_rSI);
David Srbecky1109fb32015-04-07 20:21:06 +01001179 cfi_.AdjustCFAOffset(kRegSize);
1180 // Record cfi only if it is not already spilled.
1181 if (!CoreSpillMaskContains(rs_rSI.GetReg())) {
1182 cfi_.RelOffset(DwarfCoreReg(cu_->target64, rs_rSI.GetReg()), 0);
1183 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001184 }
1185 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1186 const size_t push_offset = (push_si ? 4u : 0u) + (push_di ? 4u : 0u);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001187 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001188 if (!obj_in_si && !obj_in_di) {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001189 LoadWordDisp(rs_rSP, SRegOffset(rl_src_obj.s_reg_low) + push_offset, rs_obj);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001190 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1191 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1192 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1193 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1194 }
1195 if (!off_in_si && !off_in_di) {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001196 LoadWordDisp(rs_rSP, SRegOffset(rl_src_offset.s_reg_low) + push_offset, rs_off);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001197 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1198 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1199 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1200 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1201 }
1202 NewLIR4(kX86LockCmpxchg64A, rs_obj.GetReg(), rs_off.GetReg(), 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001203
Hans Boehm48f5c472014-06-27 14:50:10 -07001204 // After a store we need to insert barrier to prevent reordering with either
1205 // earlier or later memory accesses. Since
1206 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1207 // and it will be associated with the cmpxchg instruction, preventing both.
1208 GenMemBarrier(kAnyAny);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001209
1210 if (push_si) {
1211 FreeTemp(rs_rSI);
1212 UnmarkTemp(rs_rSI);
1213 NewLIR1(kX86Pop32R, rs_rSI.GetReg());
David Srbecky1109fb32015-04-07 20:21:06 +01001214 cfi_.AdjustCFAOffset(-kRegSize);
1215 if (!CoreSpillMaskContains(rs_rSI.GetReg())) {
1216 cfi_.Restore(DwarfCoreReg(cu_->target64, rs_rSI.GetRegNum()));
1217 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001218 }
1219 if (push_di) {
1220 FreeTemp(rs_rDI);
1221 UnmarkTemp(rs_rDI);
1222 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
David Srbecky1109fb32015-04-07 20:21:06 +01001223 cfi_.AdjustCFAOffset(-kRegSize);
1224 if (!CoreSpillMaskContains(rs_rDI.GetReg())) {
1225 cfi_.Restore(DwarfCoreReg(cu_->target64, rs_rDI.GetRegNum()));
1226 }
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001227 }
Vladimir Marko70b797d2013-12-03 15:25:24 +00001228 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +00001229 } else {
1230 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -08001231 FlushReg(rs_r0);
buzbee091cc402014-03-31 10:14:40 -07001232 Clobber(rs_r0);
buzbee2700f7e2014-03-07 09:46:20 -08001233 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001234
buzbeea0cd2d72014-06-01 09:33:49 -07001235 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
Vladimir Markofac10702015-04-22 11:51:52 +01001236 RegLocation rl_new_value = LoadValue(rl_src_new_value, is_object ? kRefReg : kCoreReg);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001237
1238 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
1239 // Mark card for object assuming new value is stored.
buzbee091cc402014-03-31 10:14:40 -07001240 FreeTemp(rs_r0); // Temporarily release EAX for MarkGCCard().
Vladimir Marko743b98c2014-11-24 19:45:41 +00001241 MarkGCCard(0, rl_new_value.reg, rl_object.reg);
buzbee091cc402014-03-31 10:14:40 -07001242 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001243 }
1244
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001245 RegLocation rl_offset;
1246 if (cu_->target64) {
1247 rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1248 } else {
1249 rl_offset = LoadValue(rl_src_offset, kCoreReg);
1250 }
buzbee2700f7e2014-03-07 09:46:20 -08001251 LoadValueDirect(rl_src_expected, rs_r0);
Andreas Gampeccc60262014-07-04 18:02:38 -07001252 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1253 rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +00001254
Hans Boehm48f5c472014-06-27 14:50:10 -07001255 // After a store we need to insert barrier to prevent reordering with either
1256 // earlier or later memory accesses. Since
1257 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1258 // and it will be associated with the cmpxchg instruction, preventing both.
1259 GenMemBarrier(kAnyAny);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001260
buzbee091cc402014-03-31 10:14:40 -07001261 FreeTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001262 }
1263
1264 // Convert ZF to boolean
1265 RegLocation rl_dest = InlineTarget(info); // boolean place for result
1266 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001267 RegStorage result_reg = rl_result.reg;
1268
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001269 // For 32-bit, SETcc only works with EAX..EDX.
1270 if (!IsByteRegister(result_reg)) {
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001271 result_reg = AllocateByteRegister();
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001272 }
1273 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondZ);
1274 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), result_reg.GetReg());
1275 if (IsTemp(result_reg)) {
1276 FreeTemp(result_reg);
1277 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001278 StoreValue(rl_dest, rl_result);
1279 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001280}
1281
Yixin Shou8c914c02014-07-28 14:17:09 -04001282void X86Mir2Lir::SwapBits(RegStorage result_reg, int shift, int32_t value) {
1283 RegStorage r_temp = AllocTemp();
1284 OpRegCopy(r_temp, result_reg);
1285 OpRegImm(kOpLsr, result_reg, shift);
1286 OpRegImm(kOpAnd, r_temp, value);
1287 OpRegImm(kOpAnd, result_reg, value);
1288 OpRegImm(kOpLsl, r_temp, shift);
1289 OpRegReg(kOpOr, result_reg, r_temp);
1290 FreeTemp(r_temp);
1291}
1292
1293void X86Mir2Lir::SwapBits64(RegStorage result_reg, int shift, int64_t value) {
1294 RegStorage r_temp = AllocTempWide();
1295 OpRegCopy(r_temp, result_reg);
1296 OpRegImm(kOpLsr, result_reg, shift);
1297 RegStorage r_value = AllocTempWide();
1298 LoadConstantWide(r_value, value);
1299 OpRegReg(kOpAnd, r_temp, r_value);
1300 OpRegReg(kOpAnd, result_reg, r_value);
1301 OpRegImm(kOpLsl, r_temp, shift);
1302 OpRegReg(kOpOr, result_reg, r_temp);
1303 FreeTemp(r_temp);
1304 FreeTemp(r_value);
1305}
1306
1307bool X86Mir2Lir::GenInlinedReverseBits(CallInfo* info, OpSize size) {
Chao-ying Fuff87d7b2015-01-19 15:51:57 -08001308 RegLocation rl_dest = (size == k64) ? InlineTargetWide(info) : InlineTarget(info);
1309 if (rl_dest.s_reg_low == INVALID_SREG) {
1310 // Result is unused, the code is dead. Inlining successful, no code generated.
1311 return true;
1312 }
Yixin Shou8c914c02014-07-28 14:17:09 -04001313 RegLocation rl_src_i = info->args[0];
1314 RegLocation rl_i = (size == k64) ? LoadValueWide(rl_src_i, kCoreReg)
1315 : LoadValue(rl_src_i, kCoreReg);
Yixin Shou8c914c02014-07-28 14:17:09 -04001316 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1317 if (size == k64) {
1318 if (cu_->instruction_set == kX86_64) {
1319 /* Use one bswap instruction to reverse byte order first and then use 3 rounds of
1320 swapping bits to reverse bits in a long number x. Using bswap to save instructions
1321 compared to generic luni implementation which has 5 rounds of swapping bits.
1322 x = bswap x
1323 x = (x & 0x5555555555555555) << 1 | (x >> 1) & 0x5555555555555555;
1324 x = (x & 0x3333333333333333) << 2 | (x >> 2) & 0x3333333333333333;
1325 x = (x & 0x0F0F0F0F0F0F0F0F) << 4 | (x >> 4) & 0x0F0F0F0F0F0F0F0F;
1326 */
1327 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1328 SwapBits64(rl_result.reg, 1, 0x5555555555555555);
1329 SwapBits64(rl_result.reg, 2, 0x3333333333333333);
1330 SwapBits64(rl_result.reg, 4, 0x0f0f0f0f0f0f0f0f);
1331 StoreValueWide(rl_dest, rl_result);
1332 return true;
1333 }
1334 RegStorage r_i_low = rl_i.reg.GetLow();
1335 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1336 // First REV shall clobber rl_result.reg.GetLowReg(), save the value in a temp for the second
1337 // REV.
1338 r_i_low = AllocTemp();
1339 OpRegCopy(r_i_low, rl_i.reg);
1340 }
1341 OpRegReg(kOpRev, rl_result.reg.GetLow(), rl_i.reg.GetHigh());
1342 OpRegReg(kOpRev, rl_result.reg.GetHigh(), r_i_low);
Andreas Gampe575422f2015-07-07 13:25:58 -07001343 // Free up at least one input register if it was a temp. Otherwise we may be in the bad
1344 // situation of not having a temp available for SwapBits. Make sure it's not overlapping
1345 // with the output, though.
Yixin Shou8c914c02014-07-28 14:17:09 -04001346 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
Andreas Gampe575422f2015-07-07 13:25:58 -07001347 // There's definitely a free temp after this.
Yixin Shou8c914c02014-07-28 14:17:09 -04001348 FreeTemp(r_i_low);
Andreas Gampe575422f2015-07-07 13:25:58 -07001349 } else {
1350 // We opportunistically release both here. That saves duplication of the register state
1351 // lookup (to see if it's actually a temp).
1352 if (rl_i.reg.GetLowReg() != rl_result.reg.GetHighReg()) {
1353 FreeTemp(rl_i.reg.GetLow());
1354 }
1355 if (rl_i.reg.GetHighReg() != rl_result.reg.GetLowReg() &&
1356 rl_i.reg.GetHighReg() != rl_result.reg.GetHighReg()) {
1357 FreeTemp(rl_i.reg.GetHigh());
1358 }
Yixin Shou8c914c02014-07-28 14:17:09 -04001359 }
Andreas Gampe575422f2015-07-07 13:25:58 -07001360
Yixin Shou8c914c02014-07-28 14:17:09 -04001361 SwapBits(rl_result.reg.GetLow(), 1, 0x55555555);
1362 SwapBits(rl_result.reg.GetLow(), 2, 0x33333333);
1363 SwapBits(rl_result.reg.GetLow(), 4, 0x0f0f0f0f);
1364 SwapBits(rl_result.reg.GetHigh(), 1, 0x55555555);
1365 SwapBits(rl_result.reg.GetHigh(), 2, 0x33333333);
1366 SwapBits(rl_result.reg.GetHigh(), 4, 0x0f0f0f0f);
1367 StoreValueWide(rl_dest, rl_result);
1368 } else {
1369 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1370 SwapBits(rl_result.reg, 1, 0x55555555);
1371 SwapBits(rl_result.reg, 2, 0x33333333);
1372 SwapBits(rl_result.reg, 4, 0x0f0f0f0f);
1373 StoreValue(rl_dest, rl_result);
1374 }
1375 return true;
1376}
1377
Vladimir Markof6737f72015-03-23 17:05:14 +00001378void X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell27dee8b2014-12-01 19:06:12 -05001379 if (cu_->target64) {
1380 // We can do this directly using RIP addressing.
Mark Mendell27dee8b2014-12-01 19:06:12 -05001381 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
Vladimir Markodc56cc52015-03-27 18:18:36 +00001382 LIR* res = NewLIR3(kX86Mov32RM, reg.GetReg(), kRIPReg, kDummy32BitOffset);
Mark Mendell27dee8b2014-12-01 19:06:12 -05001383 res->target = target;
1384 res->flags.fixup = kFixupLoad;
Vladimir Markof6737f72015-03-23 17:05:14 +00001385 return;
Mark Mendell27dee8b2014-12-01 19:06:12 -05001386 }
1387
Vladimir Marko1961b602015-04-08 20:51:48 +01001388 // Get the PC to a register and get the anchor.
1389 LIR* anchor;
1390 RegStorage r_pc = GetPcAndAnchor(&anchor);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001391
1392 // Load the proper value from the literal area.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001393 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
Vladimir Marko1961b602015-04-08 20:51:48 +01001394 LIR* res = NewLIR3(kX86Mov32RM, reg.GetReg(), r_pc.GetReg(), kDummy32BitOffset);
1395 res->operands[4] = WrapPointer(anchor);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001396 res->target = target;
1397 res->flags.fixup = kFixupLoad;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001398}
1399
Vladimir Markodc56cc52015-03-27 18:18:36 +00001400bool X86Mir2Lir::CanUseOpPcRelDexCacheArrayLoad() const {
Vladimir Marko1961b602015-04-08 20:51:48 +01001401 return dex_cache_arrays_layout_.Valid();
1402}
1403
1404LIR* X86Mir2Lir::OpLoadPc(RegStorage r_dest) {
1405 DCHECK(!cu_->target64);
1406 LIR* call = NewLIR1(kX86CallI, 0);
1407 call->flags.fixup = kFixupLabel;
1408 LIR* pop = NewLIR1(kX86Pop32R, r_dest.GetReg());
1409 pop->flags.fixup = kFixupLabel;
1410 DCHECK(NEXT_LIR(call) == pop);
1411 return call;
1412}
1413
1414RegStorage X86Mir2Lir::GetPcAndAnchor(LIR** anchor, RegStorage r_tmp) {
1415 if (pc_rel_base_reg_.Valid()) {
1416 DCHECK(setup_pc_rel_base_reg_ != nullptr);
1417 *anchor = NEXT_LIR(setup_pc_rel_base_reg_);
1418 DCHECK(*anchor != nullptr);
1419 DCHECK_EQ((*anchor)->opcode, kX86Pop32R);
1420 pc_rel_base_reg_used_ = true;
1421 return pc_rel_base_reg_;
1422 } else {
1423 RegStorage r_pc = r_tmp.Valid() ? r_tmp : AllocTempRef();
1424 LIR* load_pc = OpLoadPc(r_pc);
1425 *anchor = NEXT_LIR(load_pc);
1426 DCHECK(*anchor != nullptr);
1427 DCHECK_EQ((*anchor)->opcode, kX86Pop32R);
1428 return r_pc;
1429 }
Vladimir Markodc56cc52015-03-27 18:18:36 +00001430}
1431
Mathieu Chartiere401d142015-04-22 13:56:20 -07001432void X86Mir2Lir::OpPcRelDexCacheArrayLoad(const DexFile* dex_file, int offset, RegStorage r_dest,
1433 bool wide) {
Vladimir Markodc56cc52015-03-27 18:18:36 +00001434 if (cu_->target64) {
Mathieu Chartiere401d142015-04-22 13:56:20 -07001435 LIR* mov = NewLIR3(wide ? kX86Mov64RM : kX86Mov32RM, r_dest.GetReg(), kRIPReg,
1436 kDummy32BitOffset);
Vladimir Markodc56cc52015-03-27 18:18:36 +00001437 mov->flags.fixup = kFixupLabel;
1438 mov->operands[3] = WrapPointer(dex_file);
1439 mov->operands[4] = offset;
Vladimir Marko1961b602015-04-08 20:51:48 +01001440 mov->target = mov; // Used for pc_insn_offset (not used by x86-64 relative patcher).
Vladimir Markodc56cc52015-03-27 18:18:36 +00001441 dex_cache_access_insns_.push_back(mov);
1442 } else {
Mathieu Chartiere401d142015-04-22 13:56:20 -07001443 CHECK(!wide) << "Unsupported";
Vladimir Marko1961b602015-04-08 20:51:48 +01001444 // Get the PC to a register and get the anchor. Use r_dest for the temp if needed.
1445 LIR* anchor;
1446 RegStorage r_pc = GetPcAndAnchor(&anchor, r_dest);
1447 LIR* mov = NewLIR3(kX86Mov32RM, r_dest.GetReg(), r_pc.GetReg(), kDummy32BitOffset);
1448 mov->flags.fixup = kFixupLabel;
1449 mov->operands[3] = WrapPointer(dex_file);
1450 mov->operands[4] = offset;
1451 mov->target = anchor; // Used for pc_insn_offset.
1452 dex_cache_access_insns_.push_back(mov);
Vladimir Markodc56cc52015-03-27 18:18:36 +00001453 }
1454}
1455
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01001456LIR* X86Mir2Lir::OpVldm(RegStorage r_base ATTRIBUTE_UNUSED, int count ATTRIBUTE_UNUSED) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001457 LOG(FATAL) << "Unexpected use of OpVldm for x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001458 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001459}
1460
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01001461LIR* X86Mir2Lir::OpVstm(RegStorage r_base ATTRIBUTE_UNUSED, int count ATTRIBUTE_UNUSED) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001462 LOG(FATAL) << "Unexpected use of OpVstm for x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001463 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001464}
1465
1466void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01001467 RegLocation rl_result,
1468 int lit ATTRIBUTE_UNUSED,
1469 int first_bit,
1470 int second_bit) {
buzbee2700f7e2014-03-07 09:46:20 -08001471 RegStorage t_reg = AllocTemp();
1472 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
1473 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001474 FreeTemp(t_reg);
1475 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -08001476 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001477 }
1478}
1479
Mingyao Yange643a172014-04-08 11:02:52 -07001480void X86Mir2Lir::GenDivZeroCheckWide(RegStorage reg) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001481 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001482 DCHECK(reg.Is64Bit());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001483
Chao-ying Fua0147762014-06-06 18:38:49 -07001484 NewLIR2(kX86Cmp64RI8, reg.GetReg(), 0);
1485 } else {
1486 DCHECK(reg.IsPair());
1487
1488 // We are not supposed to clobber the incoming storage, so allocate a temporary.
1489 RegStorage t_reg = AllocTemp();
1490 // Doing an OR is a quick way to check if both registers are zero. This will set the flags.
1491 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
1492 // The temp is no longer needed so free it at this time.
1493 FreeTemp(t_reg);
1494 }
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001495
1496 // In case of zero, throw ArithmeticException.
Mingyao Yange643a172014-04-08 11:02:52 -07001497 GenDivZeroCheck(kCondEq);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001498}
1499
Mingyao Yang80365d92014-04-18 12:10:58 -07001500void X86Mir2Lir::GenArrayBoundsCheck(RegStorage index,
1501 RegStorage array_base,
1502 int len_offset) {
1503 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1504 public:
Andreas Gampe277ccbd2014-11-03 21:36:10 -08001505 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch_in,
1506 RegStorage index_in, RegStorage array_base_in, int32_t len_offset_in)
Vladimir Marko0b40ecf2015-03-20 12:08:03 +00001507 : LIRSlowPath(m2l, branch_in),
Andreas Gampe277ccbd2014-11-03 21:36:10 -08001508 index_(index_in), array_base_(array_base_in), len_offset_(len_offset_in) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001509 }
1510
1511 void Compile() OVERRIDE {
1512 m2l_->ResetRegPool();
1513 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001514 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001515
1516 RegStorage new_index = index_;
1517 // Move index out of kArg1, either directly to kArg0, or to kArg2.
Serguei Katkov4c7cc152014-06-24 00:50:02 +07001518 // TODO: clean-up to check not a number but with type
Andreas Gampeccc60262014-07-04 18:02:38 -07001519 if (index_ == m2l_->TargetReg(kArg1, kNotWide)) {
1520 if (array_base_ == m2l_->TargetReg(kArg0, kRef)) {
1521 m2l_->OpRegCopy(m2l_->TargetReg(kArg2, kNotWide), index_);
1522 new_index = m2l_->TargetReg(kArg2, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001523 } else {
Andreas Gampeccc60262014-07-04 18:02:38 -07001524 m2l_->OpRegCopy(m2l_->TargetReg(kArg0, kNotWide), index_);
1525 new_index = m2l_->TargetReg(kArg0, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001526 }
1527 }
1528 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001529 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1530 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1531 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, new_index,
1532 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001533 }
1534
1535 private:
1536 const RegStorage index_;
1537 const RegStorage array_base_;
1538 const int32_t len_offset_;
1539 };
1540
1541 OpRegMem(kOpCmp, index, array_base, len_offset);
Dave Allison69dfe512014-07-11 17:11:58 +00001542 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001543 LIR* branch = OpCondBranch(kCondUge, nullptr);
1544 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1545 index, array_base, len_offset));
1546}
1547
1548void X86Mir2Lir::GenArrayBoundsCheck(int32_t index,
1549 RegStorage array_base,
1550 int32_t len_offset) {
1551 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1552 public:
Andreas Gampe277ccbd2014-11-03 21:36:10 -08001553 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch_in,
1554 int32_t index_in, RegStorage array_base_in, int32_t len_offset_in)
Vladimir Marko0b40ecf2015-03-20 12:08:03 +00001555 : LIRSlowPath(m2l, branch_in),
Andreas Gampe277ccbd2014-11-03 21:36:10 -08001556 index_(index_in), array_base_(array_base_in), len_offset_(len_offset_in) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001557 }
1558
1559 void Compile() OVERRIDE {
1560 m2l_->ResetRegPool();
1561 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001562 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001563
1564 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001565 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1566 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1567 x86_m2l->LoadConstant(m2l_->TargetReg(kArg0, kNotWide), index_);
1568 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, m2l_->TargetReg(kArg0, kNotWide),
1569 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001570 }
1571
1572 private:
1573 const int32_t index_;
1574 const RegStorage array_base_;
1575 const int32_t len_offset_;
1576 };
1577
1578 NewLIR3(IS_SIMM8(index) ? kX86Cmp32MI8 : kX86Cmp32MI, array_base.GetReg(), len_offset, index);
Dave Allison69dfe512014-07-11 17:11:58 +00001579 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001580 LIR* branch = OpCondBranch(kCondLs, nullptr);
1581 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1582 index, array_base, len_offset));
1583}
1584
Brian Carlstrom7940e442013-07-12 13:46:57 -07001585// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001586LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
buzbee33ae5582014-06-12 14:56:32 -07001587 if (cu_->target64) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001588 OpTlsCmp(Thread::ThreadFlagsOffset<8>(), 0);
1589 } else {
1590 OpTlsCmp(Thread::ThreadFlagsOffset<4>(), 0);
1591 }
Mathieu Chartier2cebb242015-04-21 16:50:40 -07001592 return OpCondBranch((target == nullptr) ? kCondNe : kCondEq, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001593}
1594
1595// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -08001596LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001597 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -08001598 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001599}
1600
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01001601bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode ATTRIBUTE_UNUSED,
1602 bool is_div ATTRIBUTE_UNUSED,
1603 RegLocation rl_src ATTRIBUTE_UNUSED,
1604 RegLocation rl_dest ATTRIBUTE_UNUSED,
1605 int lit ATTRIBUTE_UNUSED) {
1606 LOG(FATAL) << "Unexpected use of smallLiteralDivRem in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001607 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001608}
1609
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01001610bool X86Mir2Lir::EasyMultiply(RegLocation rl_src ATTRIBUTE_UNUSED,
1611 RegLocation rl_dest ATTRIBUTE_UNUSED,
1612 int lit ATTRIBUTE_UNUSED) {
Ian Rogerse2143c02014-03-28 08:47:16 -07001613 LOG(FATAL) << "Unexpected use of easyMultiply in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001614 UNREACHABLE();
Ian Rogerse2143c02014-03-28 08:47:16 -07001615}
1616
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01001617LIR* X86Mir2Lir::OpIT(ConditionCode cond ATTRIBUTE_UNUSED, const char* guide ATTRIBUTE_UNUSED) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001618 LOG(FATAL) << "Unexpected use of OpIT in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001619 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001620}
1621
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01001622void X86Mir2Lir::OpEndIT(LIR* it ATTRIBUTE_UNUSED) {
Dave Allison3da67a52014-04-02 17:03:45 -07001623 LOG(FATAL) << "Unexpected use of OpEndIT in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001624 UNREACHABLE();
Dave Allison3da67a52014-04-02 17:03:45 -07001625}
1626
buzbee2700f7e2014-03-07 09:46:20 -08001627void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001628 switch (val) {
1629 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001630 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001631 break;
1632 case 1:
1633 OpRegCopy(dest, src);
1634 break;
1635 default:
1636 OpRegRegImm(kOpMul, dest, src, val);
1637 break;
1638 }
1639}
1640
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01001641void X86Mir2Lir::GenImulMemImm(RegStorage dest,
1642 int sreg ATTRIBUTE_UNUSED,
1643 int displacement,
1644 int val) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001645 // All memory accesses below reference dalvik regs.
1646 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1647
Mark Mendell4708dcd2014-01-22 09:05:18 -08001648 LIR *m;
1649 switch (val) {
1650 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001651 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001652 break;
Ian Rogersb28c1c02014-11-08 11:21:21 -08001653 case 1: {
1654 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
1655 LoadBaseDisp(rs_rSP, displacement, dest, k32, kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001656 break;
Ian Rogersb28c1c02014-11-08 11:21:21 -08001657 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001658 default:
buzbee091cc402014-03-31 10:14:40 -07001659 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(),
Ian Rogersb28c1c02014-11-08 11:21:21 -08001660 rs_rX86_SP_32.GetReg(), displacement, val);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001661 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
1662 break;
1663 }
1664}
1665
Andreas Gampec76c6142014-08-04 16:30:03 -07001666void X86Mir2Lir::GenArithOpLong(Instruction::Code opcode, RegLocation rl_dest, RegLocation rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001667 RegLocation rl_src2, int flags) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001668 if (!cu_->target64) {
1669 // Some x86 32b ops are fallback.
1670 switch (opcode) {
1671 case Instruction::NOT_LONG:
1672 case Instruction::DIV_LONG:
1673 case Instruction::DIV_LONG_2ADDR:
1674 case Instruction::REM_LONG:
1675 case Instruction::REM_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001676 Mir2Lir::GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001677 return;
1678
1679 default:
1680 // Everything else we can handle.
1681 break;
1682 }
1683 }
1684
1685 switch (opcode) {
1686 case Instruction::NOT_LONG:
1687 GenNotLong(rl_dest, rl_src2);
1688 return;
1689
1690 case Instruction::ADD_LONG:
1691 case Instruction::ADD_LONG_2ADDR:
1692 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1693 return;
1694
1695 case Instruction::SUB_LONG:
1696 case Instruction::SUB_LONG_2ADDR:
1697 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1698 return;
1699
1700 case Instruction::MUL_LONG:
1701 case Instruction::MUL_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001702 GenMulLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001703 return;
1704
1705 case Instruction::DIV_LONG:
1706 case Instruction::DIV_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001707 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ true, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001708 return;
1709
1710 case Instruction::REM_LONG:
1711 case Instruction::REM_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001712 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ false, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001713 return;
1714
1715 case Instruction::AND_LONG_2ADDR:
1716 case Instruction::AND_LONG:
1717 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1718 return;
1719
1720 case Instruction::OR_LONG:
1721 case Instruction::OR_LONG_2ADDR:
1722 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1723 return;
1724
1725 case Instruction::XOR_LONG:
1726 case Instruction::XOR_LONG_2ADDR:
1727 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1728 return;
1729
1730 case Instruction::NEG_LONG:
1731 GenNegLong(rl_dest, rl_src2);
1732 return;
1733
1734 default:
1735 LOG(FATAL) << "Invalid long arith op";
1736 return;
1737 }
1738}
1739
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001740bool X86Mir2Lir::GenMulLongConst(RegLocation rl_dest, RegLocation rl_src1, int64_t val, int flags) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001741 // All memory accesses below reference dalvik regs.
1742 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1743
Andreas Gampec76c6142014-08-04 16:30:03 -07001744 if (val == 0) {
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001745 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Andreas Gampec76c6142014-08-04 16:30:03 -07001746 if (cu_->target64) {
1747 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001748 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001749 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
1750 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001751 }
Andreas Gampec76c6142014-08-04 16:30:03 -07001752 StoreValueWide(rl_dest, rl_result);
1753 return true;
1754 } else if (val == 1) {
1755 StoreValueWide(rl_dest, rl_src1);
1756 return true;
1757 } else if (val == 2) {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001758 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001759 return true;
1760 } else if (IsPowerOfTwo(val)) {
Andreas Gampe7e499922015-01-06 08:28:12 -08001761 int shift_amount = CTZ(val);
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001762 if (!PartiallyIntersects(rl_src1, rl_dest)) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001763 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1764 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest, rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001765 shift_amount, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001766 StoreValueWide(rl_dest, rl_result);
1767 return true;
1768 }
1769 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001770
Andreas Gampec76c6142014-08-04 16:30:03 -07001771 // Okay, on 32b just bite the bullet and do it, still better than the general case.
1772 if (!cu_->target64) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001773 int32_t val_lo = Low32Bits(val);
1774 int32_t val_hi = High32Bits(val);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001775 // Prepare for explicit register usage.
1776 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001777 rl_src1 = UpdateLocWideTyped(rl_src1);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001778 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1779 int displacement = SRegOffset(rl_src1.s_reg_low);
1780
1781 // ECX <- 1H * 2L
1782 // EAX <- 1L * 2H
1783 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001784 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
1785 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001786 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001787 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
1788 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001789 }
1790
1791 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001792 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001793
1794 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001795 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001796
1797 // EDX:EAX <- 2L * 1L (double precision)
1798 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001799 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001800 } else {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001801 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP_32.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001802 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1803 true /* is_load */, true /* is_64bit */);
1804 }
1805
1806 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001807 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001808
1809 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001810 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
1811 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001812 StoreValueWide(rl_dest, rl_result);
Andreas Gampec76c6142014-08-04 16:30:03 -07001813 return true;
1814 }
1815 return false;
1816}
1817
1818void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001819 RegLocation rl_src2, int flags) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001820 if (rl_src1.is_const) {
1821 std::swap(rl_src1, rl_src2);
1822 }
1823
1824 if (rl_src2.is_const) {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001825 if (GenMulLongConst(rl_dest, rl_src1, mir_graph_->ConstantValueWide(rl_src2), flags)) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001826 return;
1827 }
1828 }
1829
1830 // All memory accesses below reference dalvik regs.
1831 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1832
1833 if (cu_->target64) {
1834 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1835 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1836 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1837 if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1838 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1839 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
1840 } else if (rl_result.reg.GetReg() != rl_src1.reg.GetReg() &&
1841 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1842 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src1.reg.GetReg());
1843 } else if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1844 rl_result.reg.GetReg() != rl_src2.reg.GetReg()) {
1845 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1846 } else {
1847 OpRegCopy(rl_result.reg, rl_src1.reg);
1848 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1849 }
1850 StoreValueWide(rl_dest, rl_result);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001851 return;
1852 }
1853
Andreas Gampec76c6142014-08-04 16:30:03 -07001854 // Not multiplying by a constant. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001855 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1856 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1857 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1858
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001859 // Prepare for explicit register usage.
1860 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001861 rl_src1 = UpdateLocWideTyped(rl_src1);
1862 rl_src2 = UpdateLocWideTyped(rl_src2);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001863
1864 // At this point, the VRs are in their home locations.
1865 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1866 bool src2_in_reg = rl_src2.location == kLocPhysReg;
Ian Rogersb28c1c02014-11-08 11:21:21 -08001867 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Mark Mendell4708dcd2014-01-22 09:05:18 -08001868
1869 // ECX <- 1H
1870 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001871 NewLIR2(kX86Mov32RR, rs_r1.GetReg(), rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001872 } else {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001873 LoadBaseDisp(rs_rSP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1, k32,
Andreas Gampe3c12c512014-06-24 18:46:29 +00001874 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001875 }
1876
Mark Mendellde99bba2014-02-14 12:15:02 -08001877 if (is_square) {
1878 // Take advantage of the fact that the values are the same.
1879 // ECX <- ECX * 2L (1H * 2L)
1880 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001881 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001882 } else {
1883 int displacement = SRegOffset(rl_src2.s_reg_low);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001884 LIR* m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP_32.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001885 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001886 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1887 true /* is_load */, true /* is_64bit */);
1888 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001889
Mark Mendellde99bba2014-02-14 12:15:02 -08001890 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001891 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001892 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001893 // EAX <- 2H
1894 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001895 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001896 } else {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001897 LoadBaseDisp(rs_rSP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0, k32,
Andreas Gampe3c12c512014-06-24 18:46:29 +00001898 kNotVolatile);
Mark Mendellde99bba2014-02-14 12:15:02 -08001899 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001900
Mark Mendellde99bba2014-02-14 12:15:02 -08001901 // EAX <- EAX * 1L (2H * 1L)
1902 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001903 NewLIR2(kX86Imul32RR, rs_r0.GetReg(), rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001904 } else {
1905 int displacement = SRegOffset(rl_src1.s_reg_low);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001906 LIR *m = NewLIR3(kX86Imul32RM, rs_r0.GetReg(), rs_rX86_SP_32.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001907 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001908 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1909 true /* is_load */, true /* is_64bit */);
1910 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001911
Mark Mendellde99bba2014-02-14 12:15:02 -08001912 // ECX <- ECX * 2L (1H * 2L)
1913 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001914 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001915 } else {
1916 int displacement = SRegOffset(rl_src2.s_reg_low);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001917 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP_32.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001918 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001919 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1920 true /* is_load */, true /* is_64bit */);
1921 }
1922
1923 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001924 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001925 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001926
1927 // EAX <- 2L
1928 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001929 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001930 } else {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001931 LoadBaseDisp(rs_rSP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0, k32,
Andreas Gampe3c12c512014-06-24 18:46:29 +00001932 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001933 }
1934
1935 // EDX:EAX <- 2L * 1L (double precision)
1936 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001937 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001938 } else {
1939 int displacement = SRegOffset(rl_src1.s_reg_low);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001940 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP_32.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001941 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1942 true /* is_load */, true /* is_64bit */);
1943 }
1944
1945 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001946 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001947
1948 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001949 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
buzbee2700f7e2014-03-07 09:46:20 -08001950 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001951 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001952}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001953
1954void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1955 Instruction::Code op) {
1956 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1957 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1958 if (rl_src.location == kLocPhysReg) {
1959 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001960 // But we must ensure that rl_src is in pair
Elena Sayapinadd644502014-07-01 18:39:52 +07001961 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001962 NewLIR2(x86op, rl_dest.reg.GetReg(), rl_src.reg.GetReg());
1963 } else {
1964 rl_src = LoadValueWide(rl_src, kCoreReg);
1965 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
1966 // The registers are the same, so we would clobber it before the use.
1967 RegStorage temp_reg = AllocTemp();
1968 OpRegCopy(temp_reg, rl_dest.reg);
1969 rl_src.reg.SetHighReg(temp_reg.GetReg());
1970 }
1971 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001972
Chao-ying Fua0147762014-06-06 18:38:49 -07001973 x86op = GetOpcode(op, rl_dest, rl_src, true);
1974 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
Chao-ying Fua0147762014-06-06 18:38:49 -07001975 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001976 return;
1977 }
1978
1979 // RHS is in memory.
1980 DCHECK((rl_src.location == kLocDalvikFrame) ||
1981 (rl_src.location == kLocCompilerTemp));
Ian Rogersb28c1c02014-11-08 11:21:21 -08001982 int r_base = rs_rX86_SP_32.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001983 int displacement = SRegOffset(rl_src.s_reg_low);
1984
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001985 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Andreas Gampeccc60262014-07-04 18:02:38 -07001986 LIR *lir = NewLIR3(x86op, cu_->target64 ? rl_dest.reg.GetReg() : rl_dest.reg.GetLowReg(),
1987 r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001988 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1989 true /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001990 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001991 x86op = GetOpcode(op, rl_dest, rl_src, true);
1992 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001993 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1994 true /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001995 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001996}
1997
Mark Mendelle02d48f2014-01-15 11:19:23 -08001998void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001999 rl_dest = UpdateLocWideTyped(rl_dest);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002000 if (rl_dest.location == kLocPhysReg) {
2001 // Ensure we are in a register pair
2002 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2003
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002004 rl_src = UpdateLocWideTyped(rl_src);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002005 GenLongRegOrMemOp(rl_result, rl_src, op);
2006 StoreFinalValueWide(rl_dest, rl_result);
2007 return;
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07002008 } else if (!cu_->target64 && Intersects(rl_src, rl_dest)) {
2009 // Handle the case when src and dest are intersect.
2010 rl_src = LoadValueWide(rl_src, kCoreReg);
2011 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002012 rl_src = UpdateLocWideTyped(rl_src);
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07002013 GenLongRegOrMemOp(rl_result, rl_src, op);
2014 StoreFinalValueWide(rl_dest, rl_result);
2015 return;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002016 }
2017
2018 // It wasn't in registers, so it better be in memory.
2019 DCHECK((rl_dest.location == kLocDalvikFrame) ||
2020 (rl_dest.location == kLocCompilerTemp));
2021 rl_src = LoadValueWide(rl_src, kCoreReg);
2022
2023 // Operate directly into memory.
2024 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
Ian Rogersb28c1c02014-11-08 11:21:21 -08002025 int r_base = rs_rX86_SP_32.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002026 int displacement = SRegOffset(rl_dest.s_reg_low);
2027
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002028 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002029 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET,
Elena Sayapinadd644502014-07-01 18:39:52 +07002030 cu_->target64 ? rl_src.reg.GetReg() : rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002031 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002032 true /* is_load */, true /* is64bit */);
2033 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002034 false /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07002035 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002036 x86op = GetOpcode(op, rl_dest, rl_src, true);
2037 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002038 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
2039 true /* is_load */, true /* is64bit */);
2040 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
2041 false /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07002042 }
nikolay serdjuk6b9356c2014-11-13 18:15:23 +06002043
2044 int v_src_reg = mir_graph_->SRegToVReg(rl_src.s_reg_low);
2045 int v_dst_reg = mir_graph_->SRegToVReg(rl_dest.s_reg_low);
2046
2047 // If the left operand is in memory and the right operand is in a register
2048 // and both belong to the same dalvik register then we should clobber the
2049 // right one because it doesn't hold valid data anymore.
2050 if (v_src_reg == v_dst_reg) {
2051 Clobber(rl_src.reg);
2052 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002053}
2054
Mark Mendelle02d48f2014-01-15 11:19:23 -08002055void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
2056 RegLocation rl_src2, Instruction::Code op,
2057 bool is_commutative) {
2058 // Is this really a 2 operand operation?
2059 switch (op) {
2060 case Instruction::ADD_LONG_2ADDR:
2061 case Instruction::SUB_LONG_2ADDR:
2062 case Instruction::AND_LONG_2ADDR:
2063 case Instruction::OR_LONG_2ADDR:
2064 case Instruction::XOR_LONG_2ADDR:
Mark Mendelle87f9b52014-04-30 14:13:18 -04002065 if (GenerateTwoOperandInstructions()) {
2066 GenLongArith(rl_dest, rl_src2, op);
2067 return;
2068 }
2069 break;
2070
Mark Mendelle02d48f2014-01-15 11:19:23 -08002071 default:
2072 break;
2073 }
2074
2075 if (rl_dest.location == kLocPhysReg) {
2076 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
2077
2078 // We are about to clobber the LHS, so it needs to be a temp.
2079 rl_result = ForceTempWide(rl_result);
2080
2081 // Perform the operation using the RHS.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002082 rl_src2 = UpdateLocWideTyped(rl_src2);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002083 GenLongRegOrMemOp(rl_result, rl_src2, op);
2084
2085 // And now record that the result is in the temp.
2086 StoreFinalValueWide(rl_dest, rl_result);
2087 return;
2088 }
2089
2090 // It wasn't in registers, so it better be in memory.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002091 DCHECK((rl_dest.location == kLocDalvikFrame) || (rl_dest.location == kLocCompilerTemp));
2092 rl_src1 = UpdateLocWideTyped(rl_src1);
2093 rl_src2 = UpdateLocWideTyped(rl_src2);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002094
2095 // Get one of the source operands into temporary register.
2096 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +07002097 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002098 if (IsTemp(rl_src1.reg)) {
2099 GenLongRegOrMemOp(rl_src1, rl_src2, op);
2100 } else if (is_commutative) {
2101 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
2102 // We need at least one of them to be a temporary.
2103 if (!IsTemp(rl_src2.reg)) {
2104 rl_src1 = ForceTempWide(rl_src1);
2105 GenLongRegOrMemOp(rl_src1, rl_src2, op);
2106 } else {
2107 GenLongRegOrMemOp(rl_src2, rl_src1, op);
2108 StoreFinalValueWide(rl_dest, rl_src2);
2109 return;
2110 }
2111 } else {
2112 // Need LHS to be the temp.
Mark Mendelle02d48f2014-01-15 11:19:23 -08002113 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07002114 GenLongRegOrMemOp(rl_src1, rl_src2, op);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002115 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002116 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07002117 if (IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
2118 GenLongRegOrMemOp(rl_src1, rl_src2, op);
2119 } else if (is_commutative) {
2120 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
2121 // We need at least one of them to be a temporary.
2122 if (!(IsTemp(rl_src2.reg.GetLow()) && IsTemp(rl_src2.reg.GetHigh()))) {
2123 rl_src1 = ForceTempWide(rl_src1);
2124 GenLongRegOrMemOp(rl_src1, rl_src2, op);
2125 } else {
2126 GenLongRegOrMemOp(rl_src2, rl_src1, op);
2127 StoreFinalValueWide(rl_dest, rl_src2);
2128 return;
2129 }
2130 } else {
2131 // Need LHS to be the temp.
2132 rl_src1 = ForceTempWide(rl_src1);
2133 GenLongRegOrMemOp(rl_src1, rl_src2, op);
2134 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002135 }
2136
2137 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002138}
2139
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002140void X86Mir2Lir::GenNotLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002141 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002142 rl_src = LoadValueWide(rl_src, kCoreReg);
2143 RegLocation rl_result;
2144 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2145 OpRegCopy(rl_result.reg, rl_src.reg);
2146 OpReg(kOpNot, rl_result.reg);
2147 StoreValueWide(rl_dest, rl_result);
2148 } else {
2149 LOG(FATAL) << "Unexpected use GenNotLong()";
2150 }
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002151}
2152
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002153void X86Mir2Lir::GenDivRemLongLit(RegLocation rl_dest, RegLocation rl_src,
2154 int64_t imm, bool is_div) {
2155 if (imm == 0) {
2156 GenDivZeroException();
2157 } else if (imm == 1) {
2158 if (is_div) {
2159 // x / 1 == x.
2160 StoreValueWide(rl_dest, rl_src);
2161 } else {
2162 // x % 1 == 0.
2163 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2164 LoadConstantWide(rl_result.reg, 0);
2165 StoreValueWide(rl_dest, rl_result);
2166 }
2167 } else if (imm == -1) { // handle 0x8000000000000000 / -1 special case.
2168 if (is_div) {
2169 rl_src = LoadValueWide(rl_src, kCoreReg);
2170 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2171 RegStorage rs_temp = AllocTempWide();
2172
2173 OpRegCopy(rl_result.reg, rl_src.reg);
2174 LoadConstantWide(rs_temp, 0x8000000000000000);
2175
2176 // If x == MIN_LONG, return MIN_LONG.
2177 OpRegReg(kOpCmp, rl_src.reg, rs_temp);
2178 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
2179
2180 // For x != MIN_LONG, x / -1 == -x.
2181 OpReg(kOpNeg, rl_result.reg);
2182
2183 minint_branch->target = NewLIR0(kPseudoTargetLabel);
2184 FreeTemp(rs_temp);
2185 StoreValueWide(rl_dest, rl_result);
2186 } else {
2187 // x % -1 == 0.
2188 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2189 LoadConstantWide(rl_result.reg, 0);
2190 StoreValueWide(rl_dest, rl_result);
2191 }
2192 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
2193 // Division using shifting.
2194 rl_src = LoadValueWide(rl_src, kCoreReg);
2195 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2196 if (IsSameReg(rl_result.reg, rl_src.reg)) {
2197 RegStorage rs_temp = AllocTypedTempWide(false, kCoreReg);
2198 rl_result.reg.SetReg(rs_temp.GetReg());
2199 }
2200 LoadConstantWide(rl_result.reg, std::abs(imm) - 1);
2201 OpRegReg(kOpAdd, rl_result.reg, rl_src.reg);
2202 NewLIR2(kX86Test64RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
2203 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
Andreas Gampe7e499922015-01-06 08:28:12 -08002204 int shift_amount = CTZ(imm);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002205 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
2206 if (imm < 0) {
2207 OpReg(kOpNeg, rl_result.reg);
2208 }
2209 StoreValueWide(rl_dest, rl_result);
2210 } else {
2211 CHECK(imm <= -2 || imm >= 2);
2212
2213 FlushReg(rs_r0q);
2214 Clobber(rs_r0q);
2215 LockTemp(rs_r0q);
2216 FlushReg(rs_r2q);
2217 Clobber(rs_r2q);
2218 LockTemp(rs_r2q);
2219
Mark Mendell3a91f442014-09-02 12:44:24 -04002220 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
2221 is_div ? rs_r2q : rs_r0q, INVALID_SREG, INVALID_SREG};
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002222
2223 // Use H.S.Warren's Hacker's Delight Chapter 10 and
2224 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
2225 int64_t magic;
2226 int shift;
2227 CalculateMagicAndShift(imm, magic, shift, true /* is_long */);
2228
2229 /*
2230 * For imm >= 2,
2231 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
2232 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
2233 * For imm <= -2,
2234 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
2235 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
2236 * We implement this algorithm in the following way:
2237 * 1. multiply magic number m and numerator n, get the higher 64bit result in RDX
2238 * 2. if imm > 0 and magic < 0, add numerator to RDX
2239 * if imm < 0 and magic > 0, sub numerator from RDX
2240 * 3. if S !=0, SAR S bits for RDX
2241 * 4. add 1 to RDX if RDX < 0
2242 * 5. Thus, RDX is the quotient
2243 */
2244
Mark Mendell3a91f442014-09-02 12:44:24 -04002245 // RAX = magic.
2246 LoadConstantWide(rs_r0q, magic);
2247
2248 // Multiply by numerator.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002249 RegStorage numerator_reg;
2250 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
2251 // We will need the value later.
2252 rl_src = LoadValueWide(rl_src, kCoreReg);
2253 numerator_reg = rl_src.reg;
Mark Mendell3a91f442014-09-02 12:44:24 -04002254
2255 // RDX:RAX = magic * numerator.
2256 NewLIR1(kX86Imul64DaR, numerator_reg.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002257 } else {
Mark Mendell3a91f442014-09-02 12:44:24 -04002258 // Only need this once. Multiply directly from the value.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002259 rl_src = UpdateLocWideTyped(rl_src);
Mark Mendell3a91f442014-09-02 12:44:24 -04002260 if (rl_src.location != kLocPhysReg) {
2261 // Okay, we can do this from memory.
2262 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2263 int displacement = SRegOffset(rl_src.s_reg_low);
2264 // RDX:RAX = magic * numerator.
Ian Rogersb28c1c02014-11-08 11:21:21 -08002265 LIR *m = NewLIR2(kX86Imul64DaM, rs_rX86_SP_32.GetReg(), displacement);
Mark Mendell3a91f442014-09-02 12:44:24 -04002266 AnnotateDalvikRegAccess(m, displacement >> 2,
2267 true /* is_load */, true /* is_64bit */);
2268 } else {
2269 // RDX:RAX = magic * numerator.
2270 NewLIR1(kX86Imul64DaR, rl_src.reg.GetReg());
2271 }
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002272 }
2273
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002274 if (imm > 0 && magic < 0) {
2275 // Add numerator to RDX.
2276 DCHECK(numerator_reg.Valid());
2277 OpRegReg(kOpAdd, rs_r2q, numerator_reg);
2278 } else if (imm < 0 && magic > 0) {
2279 DCHECK(numerator_reg.Valid());
2280 OpRegReg(kOpSub, rs_r2q, numerator_reg);
2281 }
2282
2283 // Do we need the shift?
2284 if (shift != 0) {
2285 // Shift RDX by 'shift' bits.
2286 OpRegImm(kOpAsr, rs_r2q, shift);
2287 }
2288
2289 // Move RDX to RAX.
2290 OpRegCopyWide(rs_r0q, rs_r2q);
2291
2292 // Move sign bit to bit 0, zeroing the rest.
2293 OpRegImm(kOpLsr, rs_r2q, 63);
2294
2295 // RDX = RDX + RAX.
2296 OpRegReg(kOpAdd, rs_r2q, rs_r0q);
2297
2298 // Quotient is in RDX.
2299 if (!is_div) {
2300 // We need to compute the remainder.
2301 // Remainder is divisor - (quotient * imm).
2302 DCHECK(numerator_reg.Valid());
2303 OpRegCopyWide(rs_r0q, numerator_reg);
2304
2305 // Imul doesn't support 64-bit imms.
2306 if (imm > std::numeric_limits<int32_t>::max() ||
2307 imm < std::numeric_limits<int32_t>::min()) {
2308 RegStorage rs_temp = AllocTempWide();
2309 LoadConstantWide(rs_temp, imm);
2310
2311 // RAX = numerator * imm.
2312 NewLIR2(kX86Imul64RR, rs_r2q.GetReg(), rs_temp.GetReg());
2313
2314 FreeTemp(rs_temp);
2315 } else {
2316 // RAX = numerator * imm.
2317 int short_imm = static_cast<int>(imm);
2318 NewLIR3(kX86Imul64RRI, rs_r2q.GetReg(), rs_r2q.GetReg(), short_imm);
2319 }
2320
Mark Mendell3a91f442014-09-02 12:44:24 -04002321 // RAX -= RDX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002322 OpRegReg(kOpSub, rs_r0q, rs_r2q);
2323
Mark Mendell3a91f442014-09-02 12:44:24 -04002324 // Result in RAX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002325 } else {
Mark Mendell3a91f442014-09-02 12:44:24 -04002326 // Result in RDX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002327 }
2328 StoreValueWide(rl_dest, rl_result);
2329 FreeTemp(rs_r0q);
2330 FreeTemp(rs_r2q);
2331 }
2332}
2333
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002334void X86Mir2Lir::GenDivRemLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002335 RegLocation rl_src2, bool is_div, int flags) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002336 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002337 LOG(FATAL) << "Unexpected use GenDivRemLong()";
2338 return;
2339 }
2340
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002341 if (rl_src2.is_const) {
2342 DCHECK(rl_src2.wide);
2343 int64_t imm = mir_graph_->ConstantValueWide(rl_src2);
2344 GenDivRemLongLit(rl_dest, rl_src1, imm, is_div);
2345 return;
2346 }
2347
Chao-ying Fua0147762014-06-06 18:38:49 -07002348 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002349 // Prepare for explicit register usage.
2350 ExplicitTempRegisterLock(this, 4, &rs_r0q, &rs_r1q, &rs_r2q, &rs_r6q);
Chao-ying Fua0147762014-06-06 18:38:49 -07002351
2352 // Load LHS into RAX.
2353 LoadValueDirectWideFixed(rl_src1, rs_r0q);
2354
2355 // Load RHS into RCX.
2356 LoadValueDirectWideFixed(rl_src2, rs_r1q);
2357
2358 // Copy LHS sign bit into RDX.
2359 NewLIR0(kx86Cqo64Da);
2360
2361 // Handle division by zero case.
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002362 if ((flags & MIR_IGNORE_DIV_ZERO_CHECK) == 0) {
2363 GenDivZeroCheckWide(rs_r1q);
2364 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002365
2366 // Have to catch 0x8000000000000000/-1 case, or we will get an exception!
2367 NewLIR2(kX86Cmp64RI8, rs_r1q.GetReg(), -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002368 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002369
2370 // RHS is -1.
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002371 LoadConstantWide(rs_r6q, 0x8000000000000000);
2372 NewLIR2(kX86Cmp64RR, rs_r0q.GetReg(), rs_r6q.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002373 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002374
2375 // In 0x8000000000000000/-1 case.
2376 if (!is_div) {
2377 // For DIV, RAX is already right. For REM, we need RDX 0.
2378 NewLIR2(kX86Xor64RR, rs_r2q.GetReg(), rs_r2q.GetReg());
2379 }
2380 LIR* done = NewLIR1(kX86Jmp8, 0);
2381
2382 // Expected case.
2383 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
2384 minint_branch->target = minus_one_branch->target;
2385 NewLIR1(kX86Idivmod64DaR, rs_r1q.GetReg());
2386 done->target = NewLIR0(kPseudoTargetLabel);
2387
2388 // Result is in RAX for div and RDX for rem.
2389 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, rs_r0q, INVALID_SREG, INVALID_SREG};
2390 if (!is_div) {
2391 rl_result.reg.SetReg(r2q);
2392 }
2393
2394 StoreValueWide(rl_dest, rl_result);
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002395}
2396
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002397void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002398 rl_src = LoadValueWide(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002399 RegLocation rl_result;
Elena Sayapinadd644502014-07-01 18:39:52 +07002400 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002401 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2402 OpRegReg(kOpNeg, rl_result.reg, rl_src.reg);
2403 } else {
2404 rl_result = ForceTempWide(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07002405 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
2406 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
2407 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Mark Mendelle02d48f2014-01-15 11:19:23 -08002408 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002409 StoreValueWide(rl_dest, rl_result);
2410}
2411
buzbee091cc402014-03-31 10:14:40 -07002412void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<4> thread_offset) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07002413 DCHECK_EQ(kX86, cu_->instruction_set);
2414 X86OpCode opcode = kX86Bkpt;
2415 switch (op) {
2416 case kOpCmp: opcode = kX86Cmp32RT; break;
2417 case kOpMov: opcode = kX86Mov32RT; break;
2418 default:
2419 LOG(FATAL) << "Bad opcode: " << op;
2420 break;
2421 }
2422 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
2423}
2424
2425void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<8> thread_offset) {
2426 DCHECK_EQ(kX86_64, cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002427 X86OpCode opcode = kX86Bkpt;
Elena Sayapinadd644502014-07-01 18:39:52 +07002428 if (cu_->target64 && r_dest.Is64BitSolo()) {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +07002429 switch (op) {
2430 case kOpCmp: opcode = kX86Cmp64RT; break;
2431 case kOpMov: opcode = kX86Mov64RT; break;
2432 default:
2433 LOG(FATAL) << "Bad opcode(OpRegThreadMem 64): " << op;
2434 break;
2435 }
2436 } else {
2437 switch (op) {
2438 case kOpCmp: opcode = kX86Cmp32RT; break;
2439 case kOpMov: opcode = kX86Mov32RT; break;
2440 default:
2441 LOG(FATAL) << "Bad opcode: " << op;
2442 break;
2443 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002444 }
buzbee091cc402014-03-31 10:14:40 -07002445 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07002446}
2447
2448/*
2449 * Generate array load
2450 */
2451void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002452 RegLocation rl_index, RegLocation rl_dest, int scale) {
Mark Mendellca541342014-10-15 16:59:49 -04002453 RegisterClass reg_class = RegClassForFieldLoadStore(size, false);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002454 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07002455 RegLocation rl_result;
buzbeea0cd2d72014-06-01 09:33:49 -07002456 rl_array = LoadValue(rl_array, kRefReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002457
Mark Mendell343adb52013-12-18 06:02:17 -08002458 int data_offset;
buzbee695d13a2014-04-19 13:32:20 -07002459 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002460 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2461 } else {
2462 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2463 }
2464
Mark Mendell343adb52013-12-18 06:02:17 -08002465 bool constant_index = rl_index.is_const;
2466 int32_t constant_index_value = 0;
2467 if (!constant_index) {
2468 rl_index = LoadValue(rl_index, kCoreReg);
2469 } else {
2470 constant_index_value = mir_graph_->ConstantValue(rl_index);
2471 // If index is constant, just fold it into the data offset
2472 data_offset += constant_index_value << scale;
2473 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002474 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002475 }
2476
Brian Carlstrom7940e442013-07-12 13:46:57 -07002477 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002478 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002479
2480 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002481 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002482 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002483 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002484 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002485 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002486 }
Mark Mendell343adb52013-12-18 06:02:17 -08002487 rl_result = EvalLoc(rl_dest, reg_class, true);
Vladimir Marko3bf7c602014-05-07 14:55:43 +01002488 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg, size);
buzbee695d13a2014-04-19 13:32:20 -07002489 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002490 StoreValueWide(rl_dest, rl_result);
2491 } else {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002492 StoreValue(rl_dest, rl_result);
2493 }
2494}
2495
2496/*
2497 * Generate array store
2498 *
2499 */
2500void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002501 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
Mark Mendellca541342014-10-15 16:59:49 -04002502 RegisterClass reg_class = RegClassForFieldLoadStore(size, false);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002503 int len_offset = mirror::Array::LengthOffset().Int32Value();
2504 int data_offset;
2505
buzbee695d13a2014-04-19 13:32:20 -07002506 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002507 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2508 } else {
2509 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2510 }
2511
buzbeea0cd2d72014-06-01 09:33:49 -07002512 rl_array = LoadValue(rl_array, kRefReg);
Mark Mendell343adb52013-12-18 06:02:17 -08002513 bool constant_index = rl_index.is_const;
2514 int32_t constant_index_value = 0;
2515 if (!constant_index) {
2516 rl_index = LoadValue(rl_index, kCoreReg);
2517 } else {
2518 // If index is constant, just fold it into the data offset
2519 constant_index_value = mir_graph_->ConstantValue(rl_index);
2520 data_offset += constant_index_value << scale;
2521 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002522 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002523 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002524
2525 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002526 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002527
2528 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002529 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002530 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002531 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002532 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002533 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002534 }
buzbee695d13a2014-04-19 13:32:20 -07002535 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002536 rl_src = LoadValueWide(rl_src, reg_class);
2537 } else {
2538 rl_src = LoadValue(rl_src, reg_class);
2539 }
2540 // If the src reg can't be byte accessed, move it to a temp first.
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002541 if ((size == kSignedByte || size == kUnsignedByte) && !IsByteRegister(rl_src.reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002542 RegStorage temp = AllocTemp();
2543 OpRegCopy(temp, rl_src.reg);
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002544 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002545 } else {
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002546 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002547 }
Ian Rogersa9a82542013-10-04 11:17:26 -07002548 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07002549 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08002550 if (!constant_index) {
buzbee091cc402014-03-31 10:14:40 -07002551 FreeTemp(rl_index.reg);
Mark Mendell343adb52013-12-18 06:02:17 -08002552 }
Vladimir Marko743b98c2014-11-24 19:45:41 +00002553 MarkGCCard(opt_flags, rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002554 }
2555}
2556
Roland Levillain4b8f1ec2015-08-26 18:34:03 +01002557RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode,
2558 RegLocation rl_dest,
2559 RegLocation rl_src,
2560 int shift_amount,
2561 int flags ATTRIBUTE_UNUSED) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002562 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Elena Sayapinadd644502014-07-01 18:39:52 +07002563 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002564 OpKind op = static_cast<OpKind>(0); /* Make gcc happy */
2565 switch (opcode) {
2566 case Instruction::SHL_LONG:
2567 case Instruction::SHL_LONG_2ADDR:
2568 op = kOpLsl;
2569 break;
2570 case Instruction::SHR_LONG:
2571 case Instruction::SHR_LONG_2ADDR:
2572 op = kOpAsr;
2573 break;
2574 case Instruction::USHR_LONG:
2575 case Instruction::USHR_LONG_2ADDR:
2576 op = kOpLsr;
2577 break;
2578 default:
2579 LOG(FATAL) << "Unexpected case";
2580 }
2581 OpRegRegImm(op, rl_result.reg, rl_src.reg, shift_amount);
2582 } else {
2583 switch (opcode) {
2584 case Instruction::SHL_LONG:
2585 case Instruction::SHL_LONG_2ADDR:
2586 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
2587 if (shift_amount == 32) {
2588 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2589 LoadConstant(rl_result.reg.GetLow(), 0);
2590 } else if (shift_amount > 31) {
2591 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2592 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
2593 LoadConstant(rl_result.reg.GetLow(), 0);
2594 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002595 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002596 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2597 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(),
2598 shift_amount);
2599 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
2600 }
2601 break;
2602 case Instruction::SHR_LONG:
2603 case Instruction::SHR_LONG_2ADDR:
2604 if (shift_amount == 32) {
2605 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2606 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2607 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2608 } else if (shift_amount > 31) {
2609 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2610 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2611 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2612 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2613 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002614 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002615 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2616 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2617 shift_amount);
2618 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
2619 }
2620 break;
2621 case Instruction::USHR_LONG:
2622 case Instruction::USHR_LONG_2ADDR:
2623 if (shift_amount == 32) {
2624 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2625 LoadConstant(rl_result.reg.GetHigh(), 0);
2626 } else if (shift_amount > 31) {
2627 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2628 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2629 LoadConstant(rl_result.reg.GetHigh(), 0);
2630 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002631 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002632 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2633 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2634 shift_amount);
2635 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
2636 }
2637 break;
2638 default:
2639 LOG(FATAL) << "Unexpected case";
2640 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08002641 }
2642 return rl_result;
2643}
2644
Brian Carlstrom7940e442013-07-12 13:46:57 -07002645void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002646 RegLocation rl_src, RegLocation rl_shift, int flags) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08002647 // Per spec, we only care about low 6 bits of shift amount.
2648 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
2649 if (shift_amount == 0) {
2650 rl_src = LoadValueWide(rl_src, kCoreReg);
2651 StoreValueWide(rl_dest, rl_src);
2652 return;
2653 } else if (shift_amount == 1 &&
2654 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
2655 // Need to handle this here to avoid calling StoreValueWide twice.
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002656 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src, flags);
Mark Mendell4708dcd2014-01-22 09:05:18 -08002657 return;
2658 }
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07002659 if (PartiallyIntersects(rl_src, rl_dest)) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08002660 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
2661 return;
2662 }
2663 rl_src = LoadValueWide(rl_src, kCoreReg);
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002664 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount, flags);
Mark Mendell4708dcd2014-01-22 09:05:18 -08002665 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002666}
2667
2668void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002669 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2,
2670 int flags) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002671 bool isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002672 switch (opcode) {
2673 case Instruction::ADD_LONG:
2674 case Instruction::AND_LONG:
2675 case Instruction::OR_LONG:
2676 case Instruction::XOR_LONG:
2677 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002678 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002679 } else {
2680 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002681 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002682 }
2683 break;
2684 case Instruction::SUB_LONG:
2685 case Instruction::SUB_LONG_2ADDR:
2686 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002687 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002688 } else {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002689 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Chao-ying Fua0147762014-06-06 18:38:49 -07002690 isConstSuccess = true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002691 }
2692 break;
2693 case Instruction::ADD_LONG_2ADDR:
2694 case Instruction::OR_LONG_2ADDR:
2695 case Instruction::XOR_LONG_2ADDR:
2696 case Instruction::AND_LONG_2ADDR:
2697 if (rl_src2.is_const) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002698 if (GenerateTwoOperandInstructions()) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002699 isConstSuccess = GenLongImm(rl_dest, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002700 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07002701 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002702 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002703 } else {
2704 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002705 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002706 }
2707 break;
2708 default:
Chao-ying Fua0147762014-06-06 18:38:49 -07002709 isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002710 break;
2711 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002712
2713 if (!isConstSuccess) {
2714 // Default - bail to non-const handler.
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002715 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Chao-ying Fua0147762014-06-06 18:38:49 -07002716 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002717}
2718
2719bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
2720 switch (op) {
2721 case Instruction::AND_LONG_2ADDR:
2722 case Instruction::AND_LONG:
2723 return value == -1;
2724 case Instruction::OR_LONG:
2725 case Instruction::OR_LONG_2ADDR:
2726 case Instruction::XOR_LONG:
2727 case Instruction::XOR_LONG_2ADDR:
2728 return value == 0;
2729 default:
2730 return false;
2731 }
2732}
2733
2734X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
2735 bool is_high_op) {
2736 bool rhs_in_mem = rhs.location != kLocPhysReg;
2737 bool dest_in_mem = dest.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002738 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002739 DCHECK(!rhs_in_mem || !dest_in_mem);
2740 switch (op) {
2741 case Instruction::ADD_LONG:
2742 case Instruction::ADD_LONG_2ADDR:
2743 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002744 return is64Bit ? kX86Add64MR : is_high_op ? kX86Adc32MR : kX86Add32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002745 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002746 return is64Bit ? kX86Add64RM : is_high_op ? kX86Adc32RM : kX86Add32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002747 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002748 return is64Bit ? kX86Add64RR : is_high_op ? kX86Adc32RR : kX86Add32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002749 case Instruction::SUB_LONG:
2750 case Instruction::SUB_LONG_2ADDR:
2751 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002752 return is64Bit ? kX86Sub64MR : is_high_op ? kX86Sbb32MR : kX86Sub32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002753 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002754 return is64Bit ? kX86Sub64RM : is_high_op ? kX86Sbb32RM : kX86Sub32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002755 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002756 return is64Bit ? kX86Sub64RR : is_high_op ? kX86Sbb32RR : kX86Sub32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002757 case Instruction::AND_LONG_2ADDR:
2758 case Instruction::AND_LONG:
2759 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002760 return is64Bit ? kX86And64MR : kX86And32MR;
2761 }
2762 if (is64Bit) {
2763 return rhs_in_mem ? kX86And64RM : kX86And64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002764 }
2765 return rhs_in_mem ? kX86And32RM : kX86And32RR;
2766 case Instruction::OR_LONG:
2767 case Instruction::OR_LONG_2ADDR:
2768 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002769 return is64Bit ? kX86Or64MR : kX86Or32MR;
2770 }
2771 if (is64Bit) {
2772 return rhs_in_mem ? kX86Or64RM : kX86Or64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002773 }
2774 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
2775 case Instruction::XOR_LONG:
2776 case Instruction::XOR_LONG_2ADDR:
2777 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002778 return is64Bit ? kX86Xor64MR : kX86Xor32MR;
2779 }
2780 if (is64Bit) {
2781 return rhs_in_mem ? kX86Xor64RM : kX86Xor64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002782 }
2783 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
2784 default:
2785 LOG(FATAL) << "Unexpected opcode: " << op;
2786 return kX86Add32RR;
2787 }
2788}
2789
2790X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
2791 int32_t value) {
2792 bool in_mem = loc.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002793 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002794 bool byte_imm = IS_SIMM8(value);
buzbee091cc402014-03-31 10:14:40 -07002795 DCHECK(in_mem || !loc.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002796 switch (op) {
2797 case Instruction::ADD_LONG:
2798 case Instruction::ADD_LONG_2ADDR:
2799 if (byte_imm) {
2800 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002801 return is64Bit ? kX86Add64MI8 : is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002802 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002803 return is64Bit ? kX86Add64RI8 : is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002804 }
2805 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002806 return is64Bit ? kX86Add64MI : is_high_op ? kX86Adc32MI : kX86Add32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002807 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002808 return is64Bit ? kX86Add64RI : is_high_op ? kX86Adc32RI : kX86Add32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002809 case Instruction::SUB_LONG:
2810 case Instruction::SUB_LONG_2ADDR:
2811 if (byte_imm) {
2812 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002813 return is64Bit ? kX86Sub64MI8 : is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002814 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002815 return is64Bit ? kX86Sub64RI8 : is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002816 }
2817 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002818 return is64Bit ? kX86Sub64MI : is_high_op ? kX86Sbb32MI : kX86Sub32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002819 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002820 return is64Bit ? kX86Sub64RI : is_high_op ? kX86Sbb32RI : kX86Sub32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002821 case Instruction::AND_LONG_2ADDR:
2822 case Instruction::AND_LONG:
2823 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002824 if (is64Bit) {
2825 return in_mem ? kX86And64MI8 : kX86And64RI8;
2826 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002827 return in_mem ? kX86And32MI8 : kX86And32RI8;
2828 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002829 if (is64Bit) {
2830 return in_mem ? kX86And64MI : kX86And64RI;
2831 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002832 return in_mem ? kX86And32MI : kX86And32RI;
2833 case Instruction::OR_LONG:
2834 case Instruction::OR_LONG_2ADDR:
2835 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002836 if (is64Bit) {
2837 return in_mem ? kX86Or64MI8 : kX86Or64RI8;
2838 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002839 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
2840 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002841 if (is64Bit) {
2842 return in_mem ? kX86Or64MI : kX86Or64RI;
2843 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002844 return in_mem ? kX86Or32MI : kX86Or32RI;
2845 case Instruction::XOR_LONG:
2846 case Instruction::XOR_LONG_2ADDR:
2847 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002848 if (is64Bit) {
2849 return in_mem ? kX86Xor64MI8 : kX86Xor64RI8;
2850 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002851 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
2852 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002853 if (is64Bit) {
2854 return in_mem ? kX86Xor64MI : kX86Xor64RI;
2855 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002856 return in_mem ? kX86Xor32MI : kX86Xor32RI;
2857 default:
2858 LOG(FATAL) << "Unexpected opcode: " << op;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002859 UNREACHABLE();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002860 }
2861}
2862
Chao-ying Fua0147762014-06-06 18:38:49 -07002863bool X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002864 DCHECK(rl_src.is_const);
2865 int64_t val = mir_graph_->ConstantValueWide(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07002866
Elena Sayapinadd644502014-07-01 18:39:52 +07002867 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002868 // We can do with imm only if it fits 32 bit
2869 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2870 return false;
2871 }
2872
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002873 rl_dest = UpdateLocWideTyped(rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07002874
2875 if ((rl_dest.location == kLocDalvikFrame) ||
2876 (rl_dest.location == kLocCompilerTemp)) {
Ian Rogersb28c1c02014-11-08 11:21:21 -08002877 int r_base = rs_rX86_SP_32.GetReg();
Chao-ying Fua0147762014-06-06 18:38:49 -07002878 int displacement = SRegOffset(rl_dest.s_reg_low);
2879
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002880 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002881 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
2882 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val);
2883 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2884 true /* is_load */, true /* is64bit */);
2885 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2886 false /* is_load */, true /* is64bit */);
2887 return true;
2888 }
2889
2890 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2891 DCHECK_EQ(rl_result.location, kLocPhysReg);
2892 DCHECK(!rl_result.reg.IsFloat());
2893
2894 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2895 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2896
2897 StoreValueWide(rl_dest, rl_result);
2898 return true;
2899 }
2900
Mark Mendelle02d48f2014-01-15 11:19:23 -08002901 int32_t val_lo = Low32Bits(val);
2902 int32_t val_hi = High32Bits(val);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002903 rl_dest = UpdateLocWideTyped(rl_dest);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002904
2905 // Can we just do this into memory?
2906 if ((rl_dest.location == kLocDalvikFrame) ||
2907 (rl_dest.location == kLocCompilerTemp)) {
Ian Rogersb28c1c02014-11-08 11:21:21 -08002908 int r_base = rs_rX86_SP_32.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002909 int displacement = SRegOffset(rl_dest.s_reg_low);
2910
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002911 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002912 if (!IsNoOp(op, val_lo)) {
2913 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002914 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002915 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002916 true /* is_load */, true /* is64bit */);
2917 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002918 false /* is_load */, true /* is64bit */);
2919 }
2920 if (!IsNoOp(op, val_hi)) {
2921 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08002922 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002923 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002924 true /* is_load */, true /* is64bit */);
2925 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002926 false /* is_load */, true /* is64bit */);
2927 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002928 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002929 }
2930
2931 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2932 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee091cc402014-03-31 10:14:40 -07002933 DCHECK(!rl_result.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002934
2935 if (!IsNoOp(op, val_lo)) {
2936 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002937 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002938 }
2939 if (!IsNoOp(op, val_hi)) {
2940 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002941 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002942 }
2943 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002944 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002945}
2946
Chao-ying Fua0147762014-06-06 18:38:49 -07002947bool X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002948 RegLocation rl_src2, Instruction::Code op) {
2949 DCHECK(rl_src2.is_const);
2950 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002951
Elena Sayapinadd644502014-07-01 18:39:52 +07002952 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002953 // We can do with imm only if it fits 32 bit
2954 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2955 return false;
2956 }
2957 if (rl_dest.location == kLocPhysReg &&
2958 rl_src1.location == kLocPhysReg && !rl_dest.reg.IsFloat()) {
2959 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002960 OpRegCopy(rl_dest.reg, rl_src1.reg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002961 NewLIR2(x86op, rl_dest.reg.GetReg(), val);
2962 StoreFinalValueWide(rl_dest, rl_dest);
2963 return true;
2964 }
2965
2966 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2967 // We need the values to be in a temporary
2968 RegLocation rl_result = ForceTempWide(rl_src1);
2969
2970 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2971 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2972
2973 StoreFinalValueWide(rl_dest, rl_result);
2974 return true;
2975 }
2976
Mark Mendelle02d48f2014-01-15 11:19:23 -08002977 int32_t val_lo = Low32Bits(val);
2978 int32_t val_hi = High32Bits(val);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002979 rl_dest = UpdateLocWideTyped(rl_dest);
2980 rl_src1 = UpdateLocWideTyped(rl_src1);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002981
2982 // Can we do this directly into the destination registers?
2983 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08002984 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
buzbee091cc402014-03-31 10:14:40 -07002985 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() && !rl_dest.reg.IsFloat()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002986 if (!IsNoOp(op, val_lo)) {
2987 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002988 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002989 }
2990 if (!IsNoOp(op, val_hi)) {
2991 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002992 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002993 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07002994
2995 StoreFinalValueWide(rl_dest, rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07002996 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002997 }
2998
2999 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
3000 DCHECK_EQ(rl_src1.location, kLocPhysReg);
3001
3002 // We need the values to be in a temporary
3003 RegLocation rl_result = ForceTempWide(rl_src1);
3004 if (!IsNoOp(op, val_lo)) {
3005 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08003006 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08003007 }
3008 if (!IsNoOp(op, val_hi)) {
3009 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00003010 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08003011 }
3012
3013 StoreFinalValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07003014 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07003015}
3016
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003017// For final classes there are no sub-classes to check and so we can answer the instance-of
3018// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
3019void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
3020 RegLocation rl_dest, RegLocation rl_src) {
buzbeea0cd2d72014-06-01 09:33:49 -07003021 RegLocation object = LoadValue(rl_src, kRefReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003022 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003023 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003024
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07003025 // For 32-bit, SETcc only works with EAX..EDX.
Chao-ying Fua77ee512014-07-01 17:43:41 -07003026 RegStorage object_32reg = object.reg.Is64Bit() ? As32BitReg(object.reg) : object.reg;
Dmitry Petrochenko407f5c12014-07-01 01:21:38 +07003027 if (result_reg.GetRegNum() == object_32reg.GetRegNum() || !IsByteRegister(result_reg)) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04003028 result_reg = AllocateByteRegister();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003029 }
3030
3031 // Assume that there is no match.
3032 LoadConstant(result_reg, 0);
Mathieu Chartier2cebb242015-04-21 16:50:40 -07003033 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, nullptr);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003034
Mark Mendellade54a22014-06-09 12:49:55 -04003035 // We will use this register to compare to memory below.
3036 // References are 32 bit in memory, and 64 bit in registers (in 64 bit mode).
3037 // For this reason, force allocation of a 32 bit register to use, so that the
3038 // compare to memory will be done using a 32 bit comparision.
3039 // The LoadRefDisp(s) below will work normally, even in 64 bit mode.
3040 RegStorage check_class = AllocTemp();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003041
Vladimir Marko05792b92015-08-03 11:56:49 +01003042 if (use_declaring_class) {
3043 RegStorage r_method = LoadCurrMethodWithHint(check_class);
3044 LoadRefDisp(r_method, ArtMethod::DeclaringClassOffset().Int32Value(),
3045 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003046 } else {
Vladimir Marko05792b92015-08-03 11:56:49 +01003047 LoadTypeFromCache(type_idx, check_class);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003048 }
3049
3050 // Compare the computed class to the class in the object.
3051 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08003052 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003053
3054 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08003055 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003056
3057 LIR* target = NewLIR0(kPseudoTargetLabel);
3058 null_branchover->target = target;
3059 FreeTemp(check_class);
3060 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08003061 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08003062 FreeTemp(result_reg);
3063 }
3064 StoreValue(rl_dest, rl_result);
3065}
3066
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003067void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
Mathieu Chartiere401d142015-04-22 13:56:20 -07003068 RegLocation rl_lhs, RegLocation rl_rhs, int flags) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003069 OpKind op = kOpBkpt;
3070 bool is_div_rem = false;
3071 bool unary = false;
3072 bool shift_op = false;
3073 bool is_two_addr = false;
3074 RegLocation rl_result;
3075 switch (opcode) {
3076 case Instruction::NEG_INT:
3077 op = kOpNeg;
3078 unary = true;
3079 break;
3080 case Instruction::NOT_INT:
3081 op = kOpMvn;
3082 unary = true;
3083 break;
3084 case Instruction::ADD_INT_2ADDR:
3085 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003086 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003087 case Instruction::ADD_INT:
3088 op = kOpAdd;
3089 break;
3090 case Instruction::SUB_INT_2ADDR:
3091 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003092 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003093 case Instruction::SUB_INT:
3094 op = kOpSub;
3095 break;
3096 case Instruction::MUL_INT_2ADDR:
3097 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003098 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003099 case Instruction::MUL_INT:
3100 op = kOpMul;
3101 break;
3102 case Instruction::DIV_INT_2ADDR:
3103 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003104 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003105 case Instruction::DIV_INT:
3106 op = kOpDiv;
3107 is_div_rem = true;
3108 break;
3109 /* NOTE: returns in kArg1 */
3110 case Instruction::REM_INT_2ADDR:
3111 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003112 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003113 case Instruction::REM_INT:
3114 op = kOpRem;
3115 is_div_rem = true;
3116 break;
3117 case Instruction::AND_INT_2ADDR:
3118 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003119 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003120 case Instruction::AND_INT:
3121 op = kOpAnd;
3122 break;
3123 case Instruction::OR_INT_2ADDR:
3124 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003125 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003126 case Instruction::OR_INT:
3127 op = kOpOr;
3128 break;
3129 case Instruction::XOR_INT_2ADDR:
3130 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003131 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003132 case Instruction::XOR_INT:
3133 op = kOpXor;
3134 break;
3135 case Instruction::SHL_INT_2ADDR:
3136 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003137 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003138 case Instruction::SHL_INT:
3139 shift_op = true;
3140 op = kOpLsl;
3141 break;
3142 case Instruction::SHR_INT_2ADDR:
3143 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003144 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003145 case Instruction::SHR_INT:
3146 shift_op = true;
3147 op = kOpAsr;
3148 break;
3149 case Instruction::USHR_INT_2ADDR:
3150 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003151 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003152 case Instruction::USHR_INT:
3153 shift_op = true;
3154 op = kOpLsr;
3155 break;
3156 default:
3157 LOG(FATAL) << "Invalid word arith op: " << opcode;
3158 }
3159
Mark Mendelle87f9b52014-04-30 14:13:18 -04003160 // Can we convert to a two address instruction?
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003161 if (!is_two_addr &&
3162 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3163 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04003164 is_two_addr = true;
3165 }
3166
3167 if (!GenerateTwoOperandInstructions()) {
3168 is_two_addr = false;
3169 }
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003170
3171 // Get the div/rem stuff out of the way.
3172 if (is_div_rem) {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07003173 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, flags);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003174 StoreValue(rl_dest, rl_result);
3175 return;
3176 }
3177
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003178 // If we generate any memory access below, it will reference a dalvik reg.
3179 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
3180
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003181 if (unary) {
3182 rl_lhs = LoadValue(rl_lhs, kCoreReg);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003183 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003184 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003185 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003186 } else {
3187 if (shift_op) {
3188 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003189 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003190 LoadValueDirectFixed(rl_rhs, t_reg);
3191 if (is_two_addr) {
3192 // Can we do this directly into memory?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003193 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003194 if (rl_result.location != kLocPhysReg) {
3195 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08003196 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003197 FreeTemp(t_reg);
3198 return;
buzbee091cc402014-03-31 10:14:40 -07003199 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003200 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08003201 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003202 FreeTemp(t_reg);
3203 StoreFinalValue(rl_dest, rl_result);
3204 return;
3205 }
3206 }
3207 // Three address form, or we can't do directly.
3208 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3209 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003210 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003211 FreeTemp(t_reg);
3212 } else {
3213 // Multiply is 3 operand only (sort of).
3214 if (is_two_addr && op != kOpMul) {
3215 // Can we do this directly into memory?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003216 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003217 if (rl_result.location == kLocPhysReg) {
Serguei Katkov366f8ae2014-04-15 16:55:26 +07003218 // Ensure res is in a core reg
3219 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003220 // Can we do this from memory directly?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003221 rl_rhs = UpdateLocTyped(rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003222 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08003223 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003224 StoreFinalValue(rl_dest, rl_result);
3225 return;
buzbee091cc402014-03-31 10:14:40 -07003226 } else if (!rl_rhs.reg.IsFloat()) {
buzbee2700f7e2014-03-07 09:46:20 -08003227 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003228 StoreFinalValue(rl_dest, rl_result);
3229 return;
3230 }
3231 }
3232 rl_rhs = LoadValue(rl_rhs, kCoreReg);
Serguei Katkovd293fb42014-05-19 15:45:42 +07003233 // It might happen rl_rhs and rl_dest are the same VR
3234 // in this case rl_dest is in reg after LoadValue while
3235 // rl_result is not updated yet, so do this
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003236 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003237 if (rl_result.location != kLocPhysReg) {
3238 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00003239 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003240 return;
buzbee091cc402014-03-31 10:14:40 -07003241 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003242 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08003243 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003244 StoreFinalValue(rl_dest, rl_result);
3245 return;
3246 } else {
3247 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3248 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003249 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003250 }
3251 } else {
3252 // Try to use reg/memory instructions.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003253 rl_lhs = UpdateLocTyped(rl_lhs);
3254 rl_rhs = UpdateLocTyped(rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003255 // We can't optimize with FP registers.
3256 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
3257 // Something is difficult, so fall back to the standard case.
3258 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3259 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3260 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003261 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003262 } else {
3263 // We can optimize by moving to result and using memory operands.
3264 if (rl_rhs.location != kLocPhysReg) {
3265 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07003266 // We should be careful with order here
3267 // If rl_dest and rl_lhs points to the same VR we should load first
3268 // If the are different we should find a register first for dest
Chao-ying Fua0147762014-06-06 18:38:49 -07003269 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3270 mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
Serguei Katkov66da1362014-03-14 13:33:33 +07003271 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3272 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendelle87f9b52014-04-30 14:13:18 -04003273 // No-op if these are the same.
3274 OpRegCopy(rl_result.reg, rl_lhs.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003275 } else {
3276 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003277 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003278 }
buzbee2700f7e2014-03-07 09:46:20 -08003279 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003280 } else if (rl_lhs.location != kLocPhysReg) {
3281 // RHS is in a register; LHS is in memory.
3282 if (op != kOpSub) {
3283 // Force RHS into result and operate on memory.
3284 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003285 OpRegCopy(rl_result.reg, rl_rhs.reg);
3286 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003287 } else {
3288 // Subtraction isn't commutative.
3289 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3290 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3291 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003292 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003293 }
3294 } else {
3295 // Both are in registers.
3296 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3297 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3298 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003299 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003300 }
3301 }
3302 }
3303 }
3304 }
3305 StoreValue(rl_dest, rl_result);
3306}
3307
3308bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
3309 // If we have non-core registers, then we can't do good things.
buzbee091cc402014-03-31 10:14:40 -07003310 if (rl_lhs.location == kLocPhysReg && rl_lhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003311 return false;
3312 }
buzbee091cc402014-03-31 10:14:40 -07003313 if (rl_rhs.location == kLocPhysReg && rl_rhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003314 return false;
3315 }
3316
3317 // Everything will be fine :-).
3318 return true;
3319}
Chao-ying Fua0147762014-06-06 18:38:49 -07003320
3321void X86Mir2Lir::GenIntToLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003322 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07003323 Mir2Lir::GenIntToLong(rl_dest, rl_src);
3324 return;
3325 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003326 rl_src = UpdateLocTyped(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07003327 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
3328 if (rl_src.location == kLocPhysReg) {
3329 NewLIR2(kX86MovsxdRR, rl_result.reg.GetReg(), rl_src.reg.GetReg());
3330 } else {
3331 int displacement = SRegOffset(rl_src.s_reg_low);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003332 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Ian Rogersb28c1c02014-11-08 11:21:21 -08003333 LIR *m = NewLIR3(kX86MovsxdRM, rl_result.reg.GetReg(), rs_rX86_SP_32.GetReg(),
Chao-ying Fua0147762014-06-06 18:38:49 -07003334 displacement + LOWORD_OFFSET);
3335 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
3336 true /* is_load */, true /* is_64bit */);
3337 }
3338 StoreValueWide(rl_dest, rl_result);
3339}
3340
Yevgeny Rouban6af82062014-11-26 18:11:54 +06003341void X86Mir2Lir::GenLongToInt(RegLocation rl_dest, RegLocation rl_src) {
3342 rl_src = UpdateLocWide(rl_src);
3343 rl_src = NarrowRegLoc(rl_src);
3344 StoreValue(rl_dest, rl_src);
3345
3346 if (cu_->target64) {
3347 // if src and dest are in the same phys reg then StoreValue generates
3348 // no operation but we need explicit 32-bit mov R, R to clear
3349 // the higher 32-bits
3350 rl_dest = UpdateLoc(rl_dest);
3351 if (rl_src.location == kLocPhysReg && rl_dest.location == kLocPhysReg
3352 && IsSameReg(rl_src.reg, rl_dest.reg)) {
3353 LIR* copy_lir = OpRegCopyNoInsert(rl_dest.reg, rl_dest.reg);
3354 // remove nop flag set by OpRegCopyNoInsert if src == dest
3355 copy_lir->flags.is_nop = false;
3356 AppendLIR(copy_lir);
3357 }
3358 }
3359}
3360
Chao-ying Fua0147762014-06-06 18:38:49 -07003361void X86Mir2Lir::GenShiftOpLong(Instruction::Code opcode, RegLocation rl_dest,
3362 RegLocation rl_src1, RegLocation rl_shift) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003363 if (!cu_->target64) {
Yixin Shouf40f8902014-08-14 14:10:32 -04003364 // Long shift operations in 32-bit. Use shld or shrd to create a 32-bit register filled from
3365 // the other half, shift the other half, if the shift amount is less than 32 we're done,
3366 // otherwise move one register to the other and place zero or sign bits in the other.
3367 LIR* branch;
3368 FlushAllRegs();
3369 LockCallTemps();
3370 LoadValueDirectFixed(rl_shift, rs_rCX);
3371 RegStorage r_tmp = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
3372 LoadValueDirectWideFixed(rl_src1, r_tmp);
3373 switch (opcode) {
3374 case Instruction::SHL_LONG:
3375 case Instruction::SHL_LONG_2ADDR:
3376 NewLIR3(kX86Shld32RRC, r_tmp.GetHighReg(), r_tmp.GetLowReg(), rs_rCX.GetReg());
3377 NewLIR2(kX86Sal32RC, r_tmp.GetLowReg(), rs_rCX.GetReg());
3378 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3379 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3380 OpRegCopy(r_tmp.GetHigh(), r_tmp.GetLow());
3381 LoadConstant(r_tmp.GetLow(), 0);
3382 branch->target = NewLIR0(kPseudoTargetLabel);
3383 break;
3384 case Instruction::SHR_LONG:
3385 case Instruction::SHR_LONG_2ADDR:
3386 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(), rs_rCX.GetReg());
3387 NewLIR2(kX86Sar32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3388 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3389 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3390 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3391 NewLIR2(kX86Sar32RI, r_tmp.GetHighReg(), 31);
3392 branch->target = NewLIR0(kPseudoTargetLabel);
3393 break;
3394 case Instruction::USHR_LONG:
3395 case Instruction::USHR_LONG_2ADDR:
3396 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(),
3397 rs_rCX.GetReg());
3398 NewLIR2(kX86Shr32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3399 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3400 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3401 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3402 LoadConstant(r_tmp.GetHigh(), 0);
3403 branch->target = NewLIR0(kPseudoTargetLabel);
3404 break;
3405 default:
3406 LOG(FATAL) << "Unexpected case: " << opcode;
3407 return;
3408 }
3409 RegLocation rl_result = LocCReturnWide();
3410 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07003411 return;
3412 }
3413
3414 bool is_two_addr = false;
3415 OpKind op = kOpBkpt;
3416 RegLocation rl_result;
3417
3418 switch (opcode) {
3419 case Instruction::SHL_LONG_2ADDR:
3420 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003421 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003422 case Instruction::SHL_LONG:
3423 op = kOpLsl;
3424 break;
3425 case Instruction::SHR_LONG_2ADDR:
3426 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003427 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003428 case Instruction::SHR_LONG:
3429 op = kOpAsr;
3430 break;
3431 case Instruction::USHR_LONG_2ADDR:
3432 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003433 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003434 case Instruction::USHR_LONG:
3435 op = kOpLsr;
3436 break;
3437 default:
3438 op = kOpBkpt;
3439 }
3440
3441 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003442 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Chao-ying Fua0147762014-06-06 18:38:49 -07003443 LoadValueDirectFixed(rl_shift, t_reg);
3444 if (is_two_addr) {
3445 // Can we do this directly into memory?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003446 rl_result = UpdateLocWideTyped(rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07003447 if (rl_result.location != kLocPhysReg) {
3448 // Okay, we can do this into memory
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003449 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003450 OpMemReg(op, rl_result, t_reg.GetReg());
3451 } else if (!rl_result.reg.IsFloat()) {
3452 // Can do this directly into the result register
3453 OpRegReg(op, rl_result.reg, t_reg);
3454 StoreFinalValueWide(rl_dest, rl_result);
3455 }
3456 } else {
3457 // Three address form, or we can't do directly.
3458 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
3459 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
3460 OpRegRegReg(op, rl_result.reg, rl_src1.reg, t_reg);
3461 StoreFinalValueWide(rl_dest, rl_result);
3462 }
3463
3464 FreeTemp(t_reg);
3465}
3466
Brian Carlstrom7940e442013-07-12 13:46:57 -07003467} // namespace art