blob: 26465a55684eb7066761483aeffcc2d38329f9f1 [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"
20#include "dex/quick/mir_to_lir-inl.h"
buzbeeb5860fb2014-06-21 15:31:01 -070021#include "dex/reg_storage_eq.h"
Mingyao Yang98d1cc82014-05-15 17:02:16 -070022#include "mirror/art_method.h"
Ian Rogers7e70b002014-10-08 11:47:24 -070023#include "mirror/array-inl.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070024#include "x86_lir.h"
25
26namespace art {
27
28/*
Brian Carlstrom7940e442013-07-12 13:46:57 -070029 * Compare two 64-bit values
30 * x = y return 0
31 * x < y return -1
32 * x > y return 1
33 */
34void X86Mir2Lir::GenCmpLong(RegLocation rl_dest, RegLocation rl_src1,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070035 RegLocation rl_src2) {
Elena Sayapinadd644502014-07-01 18:39:52 +070036 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -070037 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
38 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
39 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Chao-ying Fua0147762014-06-06 18:38:49 -070040 RegStorage temp_reg = AllocTemp();
Serguei Katkov1c557032014-06-23 13:23:38 +070041 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
42 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondG); // result = (src1 > src2) ? 1 : 0
43 NewLIR2(kX86Set8R, temp_reg.GetReg(), kX86CondL); // temp = (src1 >= src2) ? 0 : 1
44 NewLIR2(kX86Sub8RR, rl_result.reg.GetReg(), temp_reg.GetReg());
45 NewLIR2(kX86Movsx8qRR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Serguei Katkov04982232014-06-20 18:17:16 +070046
Chao-ying Fua0147762014-06-06 18:38:49 -070047 StoreValue(rl_dest, rl_result);
48 FreeTemp(temp_reg);
49 return;
50 }
51
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +070052 // Prepare for explicit register usage
53 ExplicitTempRegisterLock(this, 4, &rs_r0, &rs_r1, &rs_r2, &rs_r3);
buzbee091cc402014-03-31 10:14:40 -070054 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
55 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -080056 LoadValueDirectWideFixed(rl_src1, r_tmp1);
57 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Brian Carlstrom7940e442013-07-12 13:46:57 -070058 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -080059 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
60 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
buzbee091cc402014-03-31 10:14:40 -070061 NewLIR2(kX86Set8R, rs_r2.GetReg(), kX86CondL); // r2 = (r1:r0) < (r3:r2) ? 1 : 0
62 NewLIR2(kX86Movzx8RR, rs_r2.GetReg(), rs_r2.GetReg());
buzbee2700f7e2014-03-07 09:46:20 -080063 OpReg(kOpNeg, rs_r2); // r2 = -r2
64 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = high | low - sets ZF
buzbee091cc402014-03-31 10:14:40 -070065 NewLIR2(kX86Set8R, rs_r0.GetReg(), kX86CondNz); // r0 = (r1:r0) != (r3:r2) ? 1 : 0
Brian Carlstrom7940e442013-07-12 13:46:57 -070066 NewLIR2(kX86Movzx8RR, r0, r0);
buzbee2700f7e2014-03-07 09:46:20 -080067 OpRegReg(kOpOr, rs_r0, rs_r2); // r0 = r0 | r2
Brian Carlstrom7940e442013-07-12 13:46:57 -070068 RegLocation rl_result = LocCReturn();
69 StoreValue(rl_dest, rl_result);
70}
71
72X86ConditionCode X86ConditionEncoding(ConditionCode cond) {
73 switch (cond) {
74 case kCondEq: return kX86CondEq;
75 case kCondNe: return kX86CondNe;
76 case kCondCs: return kX86CondC;
77 case kCondCc: return kX86CondNc;
Vladimir Marko58af1f92013-12-19 13:31:15 +000078 case kCondUlt: return kX86CondC;
79 case kCondUge: return kX86CondNc;
Brian Carlstrom7940e442013-07-12 13:46:57 -070080 case kCondMi: return kX86CondS;
81 case kCondPl: return kX86CondNs;
82 case kCondVs: return kX86CondO;
83 case kCondVc: return kX86CondNo;
84 case kCondHi: return kX86CondA;
85 case kCondLs: return kX86CondBe;
86 case kCondGe: return kX86CondGe;
87 case kCondLt: return kX86CondL;
88 case kCondGt: return kX86CondG;
89 case kCondLe: return kX86CondLe;
90 case kCondAl:
91 case kCondNv: LOG(FATAL) << "Should not reach here";
92 }
93 return kX86CondO;
94}
95
buzbee2700f7e2014-03-07 09:46:20 -080096LIR* X86Mir2Lir::OpCmpBranch(ConditionCode cond, RegStorage src1, RegStorage src2, LIR* target) {
Chao-ying Fua77ee512014-07-01 17:43:41 -070097 NewLIR2(src1.Is64Bit() ? kX86Cmp64RR : kX86Cmp32RR, src1.GetReg(), src2.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -070098 X86ConditionCode cc = X86ConditionEncoding(cond);
99 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ ,
100 cc);
101 branch->target = target;
102 return branch;
103}
104
buzbee2700f7e2014-03-07 09:46:20 -0800105LIR* X86Mir2Lir::OpCmpImmBranch(ConditionCode cond, RegStorage reg,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700106 int check_value, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700107 if ((check_value == 0) && (cond == kCondEq || cond == kCondNe)) {
108 // TODO: when check_value == 0 and reg is rCX, use the jcxz/nz opcode
Chao-ying Fua77ee512014-07-01 17:43:41 -0700109 NewLIR2(reg.Is64Bit() ? kX86Test64RR: kX86Test32RR, reg.GetReg(), reg.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700110 } else {
Chao-ying Fua77ee512014-07-01 17:43:41 -0700111 if (reg.Is64Bit()) {
112 NewLIR2(IS_SIMM8(check_value) ? kX86Cmp64RI8 : kX86Cmp64RI, reg.GetReg(), check_value);
113 } else {
114 NewLIR2(IS_SIMM8(check_value) ? kX86Cmp32RI8 : kX86Cmp32RI, reg.GetReg(), check_value);
115 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700116 }
117 X86ConditionCode cc = X86ConditionEncoding(cond);
118 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ , cc);
119 branch->target = target;
120 return branch;
121}
122
buzbee2700f7e2014-03-07 09:46:20 -0800123LIR* X86Mir2Lir::OpRegCopyNoInsert(RegStorage r_dest, RegStorage r_src) {
124 // If src or dest is a pair, we'll be using low reg.
125 if (r_dest.IsPair()) {
126 r_dest = r_dest.GetLow();
127 }
128 if (r_src.IsPair()) {
129 r_src = r_src.GetLow();
130 }
buzbee091cc402014-03-31 10:14:40 -0700131 if (r_dest.IsFloat() || r_src.IsFloat())
Brian Carlstrom7940e442013-07-12 13:46:57 -0700132 return OpFpRegCopy(r_dest, r_src);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700133 LIR* res = RawLIR(current_dalvik_offset_, r_dest.Is64Bit() ? kX86Mov64RR : kX86Mov32RR,
buzbee2700f7e2014-03-07 09:46:20 -0800134 r_dest.GetReg(), r_src.GetReg());
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800135 if (!(cu_->disable_opt & (1 << kSafeOptimizations)) && r_dest == r_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700136 res->flags.is_nop = true;
137 }
138 return res;
139}
140
buzbee7a11ab02014-04-28 20:02:38 -0700141void X86Mir2Lir::OpRegCopy(RegStorage r_dest, RegStorage r_src) {
142 if (r_dest != r_src) {
143 LIR *res = OpRegCopyNoInsert(r_dest, r_src);
144 AppendLIR(res);
145 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700146}
147
buzbee2700f7e2014-03-07 09:46:20 -0800148void X86Mir2Lir::OpRegCopyWide(RegStorage r_dest, RegStorage r_src) {
buzbee7a11ab02014-04-28 20:02:38 -0700149 if (r_dest != r_src) {
buzbee091cc402014-03-31 10:14:40 -0700150 bool dest_fp = r_dest.IsFloat();
151 bool src_fp = r_src.IsFloat();
buzbee7a11ab02014-04-28 20:02:38 -0700152 if (dest_fp) {
153 if (src_fp) {
buzbee091cc402014-03-31 10:14:40 -0700154 OpRegCopy(r_dest, r_src);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700155 } else {
buzbee7a11ab02014-04-28 20:02:38 -0700156 // TODO: Prevent this from happening in the code. The result is often
157 // unused or could have been loaded more easily from memory.
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700158 if (!r_src.IsPair()) {
159 DCHECK(!r_dest.IsPair());
160 NewLIR2(kX86MovqxrRR, r_dest.GetReg(), r_src.GetReg());
161 } else {
162 NewLIR2(kX86MovdxrRR, r_dest.GetReg(), r_src.GetLowReg());
163 RegStorage r_tmp = AllocTempDouble();
164 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), r_src.GetHighReg());
165 NewLIR2(kX86PunpckldqRR, r_dest.GetReg(), r_tmp.GetReg());
166 FreeTemp(r_tmp);
167 }
buzbee7a11ab02014-04-28 20:02:38 -0700168 }
169 } else {
170 if (src_fp) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700171 if (!r_dest.IsPair()) {
172 DCHECK(!r_src.IsPair());
173 NewLIR2(kX86MovqrxRR, r_dest.GetReg(), r_src.GetReg());
buzbee7a11ab02014-04-28 20:02:38 -0700174 } else {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700175 NewLIR2(kX86MovdrxRR, r_dest.GetLowReg(), r_src.GetReg());
176 RegStorage temp_reg = AllocTempDouble();
177 NewLIR2(kX86MovsdRR, temp_reg.GetReg(), r_src.GetReg());
178 NewLIR2(kX86PsrlqRI, temp_reg.GetReg(), 32);
179 NewLIR2(kX86MovdrxRR, r_dest.GetHighReg(), temp_reg.GetReg());
180 }
181 } else {
182 DCHECK_EQ(r_dest.IsPair(), r_src.IsPair());
183 if (!r_src.IsPair()) {
184 // Just copy the register directly.
185 OpRegCopy(r_dest, r_src);
186 } else {
187 // Handle overlap
188 if (r_src.GetHighReg() == r_dest.GetLowReg() &&
189 r_src.GetLowReg() == r_dest.GetHighReg()) {
190 // Deal with cycles.
191 RegStorage temp_reg = AllocTemp();
192 OpRegCopy(temp_reg, r_dest.GetHigh());
193 OpRegCopy(r_dest.GetHigh(), r_dest.GetLow());
194 OpRegCopy(r_dest.GetLow(), temp_reg);
195 FreeTemp(temp_reg);
196 } else if (r_src.GetHighReg() == r_dest.GetLowReg()) {
197 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
198 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
199 } else {
200 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
201 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
202 }
buzbee7a11ab02014-04-28 20:02:38 -0700203 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700204 }
205 }
206 }
207}
208
Andreas Gampe90969af2014-07-15 23:02:11 -0700209void X86Mir2Lir::GenSelectConst32(RegStorage left_op, RegStorage right_op, ConditionCode code,
210 int32_t true_val, int32_t false_val, RegStorage rs_dest,
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700211 RegisterClass dest_reg_class) {
Serguei Katkov9ee45192014-07-17 14:39:03 +0700212 DCHECK(!left_op.IsPair() && !right_op.IsPair() && !rs_dest.IsPair());
213 DCHECK(!left_op.IsFloat() && !right_op.IsFloat() && !rs_dest.IsFloat());
214
215 // We really need this check for correctness, otherwise we will need to do more checks in
216 // non zero/one case
217 if (true_val == false_val) {
218 LoadConstantNoClobber(rs_dest, true_val);
219 return;
Andreas Gampe90969af2014-07-15 23:02:11 -0700220 }
221
Serguei Katkov9ee45192014-07-17 14:39:03 +0700222 const bool dest_intersect = IsSameReg(rs_dest, left_op) || IsSameReg(rs_dest, right_op);
223
224 const bool zero_one_case = (true_val == 0 && false_val == 1) || (true_val == 1 && false_val == 0);
225 if (zero_one_case && IsByteRegister(rs_dest)) {
226 if (!dest_intersect) {
227 LoadConstantNoClobber(rs_dest, 0);
228 }
229 OpRegReg(kOpCmp, left_op, right_op);
230 // Set the low byte of the result to 0 or 1 from the compare condition code.
231 NewLIR2(kX86Set8R, rs_dest.GetReg(),
232 X86ConditionEncoding(true_val == 1 ? code : FlipComparisonOrder(code)));
233 if (dest_intersect) {
234 NewLIR2(rs_dest.Is64Bit() ? kX86Movzx8qRR : kX86Movzx8RR, rs_dest.GetReg(), rs_dest.GetReg());
235 }
236 } else {
237 // Be careful rs_dest can be changed only after cmp because it can be the same as one of ops
238 // and it cannot use xor because it makes cc flags to be dirty
239 RegStorage temp_reg = AllocTypedTemp(false, dest_reg_class, false);
240 if (temp_reg.Valid()) {
241 if (false_val == 0 && dest_intersect) {
242 code = FlipComparisonOrder(code);
243 std::swap(true_val, false_val);
244 }
245 if (!dest_intersect) {
246 LoadConstantNoClobber(rs_dest, false_val);
247 }
248 LoadConstantNoClobber(temp_reg, true_val);
249 OpRegReg(kOpCmp, left_op, right_op);
250 if (dest_intersect) {
251 LoadConstantNoClobber(rs_dest, false_val);
252 DCHECK(!last_lir_insn_->u.m.def_mask->HasBit(ResourceMask::kCCode));
253 }
254 OpCondRegReg(kOpCmov, code, rs_dest, temp_reg);
255 FreeTemp(temp_reg);
256 } else {
257 // slow path
258 LIR* cmp_branch = OpCmpBranch(code, left_op, right_op, nullptr);
259 LoadConstantNoClobber(rs_dest, false_val);
260 LIR* that_is_it = NewLIR1(kX86Jmp8, 0);
261 LIR* true_case = NewLIR0(kPseudoTargetLabel);
262 cmp_branch->target = true_case;
263 LoadConstantNoClobber(rs_dest, true_val);
264 LIR* end = NewLIR0(kPseudoTargetLabel);
265 that_is_it->target = end;
266 }
267 }
Andreas Gampe90969af2014-07-15 23:02:11 -0700268}
269
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700270void X86Mir2Lir::GenSelect(BasicBlock* bb, MIR* mir) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700271 UNUSED(bb);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800272 RegLocation rl_result;
273 RegLocation rl_src = mir_graph_->GetSrc(mir, 0);
274 RegLocation rl_dest = mir_graph_->GetDest(mir);
buzbeea0cd2d72014-06-01 09:33:49 -0700275 // Avoid using float regs here.
276 RegisterClass src_reg_class = rl_src.ref ? kRefReg : kCoreReg;
277 RegisterClass result_reg_class = rl_dest.ref ? kRefReg : kCoreReg;
Vladimir Markoa1a70742014-03-03 10:28:05 +0000278 ConditionCode ccode = mir->meta.ccode;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800279
280 // The kMirOpSelect has two variants, one for constants and one for moves.
281 const bool is_constant_case = (mir->ssa_rep->num_uses == 1);
282
283 if (is_constant_case) {
284 int true_val = mir->dalvikInsn.vB;
285 int false_val = mir->dalvikInsn.vC;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800286
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700287 // simplest strange case
288 if (true_val == false_val) {
289 rl_result = EvalLoc(rl_dest, result_reg_class, true);
290 LoadConstantNoClobber(rl_result.reg, true_val);
291 } else {
292 // TODO: use GenSelectConst32 and handle additional opcode patterns such as
293 // "cmp; setcc; movzx" or "cmp; sbb r0,r0; and r0,$mask; add r0,$literal".
294 rl_src = LoadValue(rl_src, src_reg_class);
295 rl_result = EvalLoc(rl_dest, result_reg_class, true);
296 /*
297 * For ccode == kCondEq:
298 *
299 * 1) When the true case is zero and result_reg is not same as src_reg:
300 * xor result_reg, result_reg
301 * cmp $0, src_reg
302 * mov t1, $false_case
303 * cmovnz result_reg, t1
304 * 2) When the false case is zero and result_reg is not same as src_reg:
305 * xor result_reg, result_reg
306 * cmp $0, src_reg
307 * mov t1, $true_case
308 * cmovz result_reg, t1
309 * 3) All other cases (we do compare first to set eflags):
310 * cmp $0, src_reg
311 * mov result_reg, $false_case
312 * mov t1, $true_case
313 * cmovz result_reg, t1
314 */
315 // FIXME: depending on how you use registers you could get a false != mismatch when dealing
316 // with different views of the same underlying physical resource (i.e. solo32 vs. solo64).
317 const bool result_reg_same_as_src =
318 (rl_src.location == kLocPhysReg && rl_src.reg.GetRegNum() == rl_result.reg.GetRegNum());
319 const bool true_zero_case = (true_val == 0 && false_val != 0 && !result_reg_same_as_src);
320 const bool false_zero_case = (false_val == 0 && true_val != 0 && !result_reg_same_as_src);
321 const bool catch_all_case = !(true_zero_case || false_zero_case);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800322
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700323 if (true_zero_case || false_zero_case) {
324 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
325 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800326
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700327 if (true_zero_case || false_zero_case || catch_all_case) {
328 OpRegImm(kOpCmp, rl_src.reg, 0);
329 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800330
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700331 if (catch_all_case) {
332 OpRegImm(kOpMov, rl_result.reg, false_val);
333 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800334
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700335 if (true_zero_case || false_zero_case || catch_all_case) {
336 ConditionCode cc = true_zero_case ? NegateComparison(ccode) : ccode;
337 int immediateForTemp = true_zero_case ? false_val : true_val;
338 RegStorage temp1_reg = AllocTypedTemp(false, result_reg_class);
339 OpRegImm(kOpMov, temp1_reg, immediateForTemp);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800340
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700341 OpCondRegReg(kOpCmov, cc, rl_result.reg, temp1_reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800342
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700343 FreeTemp(temp1_reg);
344 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800345 }
346 } else {
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700347 rl_src = LoadValue(rl_src, src_reg_class);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800348 RegLocation rl_true = mir_graph_->GetSrc(mir, 1);
349 RegLocation rl_false = mir_graph_->GetSrc(mir, 2);
buzbeea0cd2d72014-06-01 09:33:49 -0700350 rl_true = LoadValue(rl_true, result_reg_class);
351 rl_false = LoadValue(rl_false, result_reg_class);
352 rl_result = EvalLoc(rl_dest, result_reg_class, true);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800353
354 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000355 * For ccode == kCondEq:
356 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800357 * 1) When true case is already in place:
358 * cmp $0, src_reg
359 * cmovnz result_reg, false_reg
360 * 2) When false case is already in place:
361 * cmp $0, src_reg
362 * cmovz result_reg, true_reg
363 * 3) When neither cases are in place:
364 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000365 * mov result_reg, false_reg
366 * cmovz result_reg, true_reg
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800367 */
368
369 // kMirOpSelect is generated just for conditional cases when comparison is done with zero.
buzbee2700f7e2014-03-07 09:46:20 -0800370 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800371
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000372 if (rl_result.reg.GetReg() == rl_true.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800373 OpCondRegReg(kOpCmov, NegateComparison(ccode), rl_result.reg, rl_false.reg);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000374 } else if (rl_result.reg.GetReg() == rl_false.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800375 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800376 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800377 OpRegCopy(rl_result.reg, rl_false.reg);
378 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800379 }
380 }
381
382 StoreValue(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700383}
384
385void X86Mir2Lir::GenFusedLongCmpBranch(BasicBlock* bb, MIR* mir) {
buzbee0d829482013-10-11 15:24:55 -0700386 LIR* taken = &block_label_list_[bb->taken];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700387 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
388 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
Vladimir Markoa8946072014-01-22 10:30:44 +0000389 ConditionCode ccode = mir->meta.ccode;
Mark Mendell412d4f82013-12-18 13:32:36 -0800390
391 if (rl_src1.is_const) {
392 std::swap(rl_src1, rl_src2);
393 ccode = FlipComparisonOrder(ccode);
394 }
395 if (rl_src2.is_const) {
396 // Do special compare/branch against simple const operand
397 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
398 GenFusedLongCmpImmBranch(bb, rl_src1, val, ccode);
399 return;
400 }
401
Elena Sayapinadd644502014-07-01 18:39:52 +0700402 if (cu_->target64) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700403 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
404 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
405
406 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
407 OpCondBranch(ccode, taken);
408 return;
409 }
410
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700411 // Prepare for explicit register usage
412 ExplicitTempRegisterLock(this, 4, &rs_r0, &rs_r1, &rs_r2, &rs_r3);
buzbee091cc402014-03-31 10:14:40 -0700413 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
414 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -0800415 LoadValueDirectWideFixed(rl_src1, r_tmp1);
416 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700417
Brian Carlstrom7940e442013-07-12 13:46:57 -0700418 // Swap operands and condition code to prevent use of zero flag.
419 if (ccode == kCondLe || ccode == kCondGt) {
420 // Compute (r3:r2) = (r3:r2) - (r1:r0)
buzbee2700f7e2014-03-07 09:46:20 -0800421 OpRegReg(kOpSub, rs_r2, rs_r0); // r2 = r2 - r0
422 OpRegReg(kOpSbc, rs_r3, rs_r1); // r3 = r3 - r1 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700423 } else {
424 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -0800425 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
426 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700427 }
428 switch (ccode) {
429 case kCondEq:
430 case kCondNe:
buzbee2700f7e2014-03-07 09:46:20 -0800431 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = r0 | r1
Brian Carlstrom7940e442013-07-12 13:46:57 -0700432 break;
433 case kCondLe:
434 ccode = kCondGe;
435 break;
436 case kCondGt:
437 ccode = kCondLt;
438 break;
439 case kCondLt:
440 case kCondGe:
441 break;
442 default:
443 LOG(FATAL) << "Unexpected ccode: " << ccode;
444 }
445 OpCondBranch(ccode, taken);
446}
447
Mark Mendell412d4f82013-12-18 13:32:36 -0800448void X86Mir2Lir::GenFusedLongCmpImmBranch(BasicBlock* bb, RegLocation rl_src1,
449 int64_t val, ConditionCode ccode) {
450 int32_t val_lo = Low32Bits(val);
451 int32_t val_hi = High32Bits(val);
452 LIR* taken = &block_label_list_[bb->taken];
Mark Mendell412d4f82013-12-18 13:32:36 -0800453 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Mark Mendell752e2052014-05-01 10:19:04 -0400454 bool is_equality_test = ccode == kCondEq || ccode == kCondNe;
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700455
Elena Sayapinadd644502014-07-01 18:39:52 +0700456 if (cu_->target64) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700457 if (is_equality_test && val == 0) {
458 // We can simplify of comparing for ==, != to 0.
459 NewLIR2(kX86Test64RR, rl_src1.reg.GetReg(), rl_src1.reg.GetReg());
460 } else if (is_equality_test && val_hi == 0 && val_lo > 0) {
461 OpRegImm(kOpCmp, rl_src1.reg, val_lo);
462 } else {
463 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
464 LoadConstantWide(tmp, val);
465 OpRegReg(kOpCmp, rl_src1.reg, tmp);
466 FreeTemp(tmp);
467 }
468 OpCondBranch(ccode, taken);
469 return;
470 }
471
Mark Mendell752e2052014-05-01 10:19:04 -0400472 if (is_equality_test && val != 0) {
473 rl_src1 = ForceTempWide(rl_src1);
474 }
buzbee2700f7e2014-03-07 09:46:20 -0800475 RegStorage low_reg = rl_src1.reg.GetLow();
476 RegStorage high_reg = rl_src1.reg.GetHigh();
Mark Mendell412d4f82013-12-18 13:32:36 -0800477
Mark Mendell752e2052014-05-01 10:19:04 -0400478 if (is_equality_test) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700479 // We can simplify of comparing for ==, != to 0.
Mark Mendell752e2052014-05-01 10:19:04 -0400480 if (val == 0) {
481 if (IsTemp(low_reg)) {
482 OpRegReg(kOpOr, low_reg, high_reg);
483 // We have now changed it; ignore the old values.
484 Clobber(rl_src1.reg);
485 } else {
486 RegStorage t_reg = AllocTemp();
487 OpRegRegReg(kOpOr, t_reg, low_reg, high_reg);
488 FreeTemp(t_reg);
489 }
490 OpCondBranch(ccode, taken);
491 return;
492 }
493
494 // Need to compute the actual value for ==, !=.
495 OpRegImm(kOpSub, low_reg, val_lo);
496 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
497 OpRegReg(kOpOr, high_reg, low_reg);
498 Clobber(rl_src1.reg);
499 } else if (ccode == kCondLe || ccode == kCondGt) {
500 // Swap operands and condition code to prevent use of zero flag.
501 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
502 LoadConstantWide(tmp, val);
503 OpRegReg(kOpSub, tmp.GetLow(), low_reg);
504 OpRegReg(kOpSbc, tmp.GetHigh(), high_reg);
505 ccode = (ccode == kCondLe) ? kCondGe : kCondLt;
506 FreeTemp(tmp);
507 } else {
508 // We can use a compare for the low word to set CF.
509 OpRegImm(kOpCmp, low_reg, val_lo);
510 if (IsTemp(high_reg)) {
511 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
512 // We have now changed it; ignore the old values.
513 Clobber(rl_src1.reg);
514 } else {
515 // mov temp_reg, high_reg; sbb temp_reg, high_constant
516 RegStorage t_reg = AllocTemp();
517 OpRegCopy(t_reg, high_reg);
518 NewLIR2(kX86Sbb32RI, t_reg.GetReg(), val_hi);
519 FreeTemp(t_reg);
520 }
Mark Mendell412d4f82013-12-18 13:32:36 -0800521 }
522
Mark Mendell752e2052014-05-01 10:19:04 -0400523 OpCondBranch(ccode, taken);
Mark Mendell412d4f82013-12-18 13:32:36 -0800524}
525
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700526void X86Mir2Lir::CalculateMagicAndShift(int64_t divisor, int64_t& magic, int& shift, bool is_long) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800527 // It does not make sense to calculate magic and shift for zero divisor.
528 DCHECK_NE(divisor, 0);
529
530 /* According to H.S.Warren's Hacker's Delight Chapter 10 and
531 * T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
532 * The magic number M and shift S can be calculated in the following way:
533 * Let nc be the most positive value of numerator(n) such that nc = kd - 1,
534 * where divisor(d) >=2.
535 * Let nc be the most negative value of numerator(n) such that nc = kd + 1,
536 * where divisor(d) <= -2.
537 * Thus nc can be calculated like:
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700538 * nc = exp + exp % d - 1, where d >= 2 and exp = 2^31 for int or 2^63 for long
539 * 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 -0800540 *
541 * So the shift p is the smallest p satisfying
542 * 2^p > nc * (d - 2^p % d), where d >= 2
543 * 2^p > nc * (d + 2^p % d), where d <= -2.
544 *
545 * the magic number M is calcuated by
546 * M = (2^p + d - 2^p % d) / d, where d >= 2
547 * M = (2^p - d - 2^p % d) / d, where d <= -2.
548 *
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700549 * 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 -0800550 * the shift number S.
551 */
552
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700553 int64_t p = (is_long) ? 63 : 31;
554 const uint64_t exp = (is_long) ? 0x8000000000000000ULL : 0x80000000U;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800555
556 // Initialize the computations.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700557 uint64_t abs_d = (divisor >= 0) ? divisor : -divisor;
558 uint64_t tmp = exp + ((is_long) ? static_cast<uint64_t>(divisor) >> 63 :
559 static_cast<uint32_t>(divisor) >> 31);
560 uint64_t abs_nc = tmp - 1 - tmp % abs_d;
561 uint64_t quotient1 = exp / abs_nc;
562 uint64_t remainder1 = exp % abs_nc;
563 uint64_t quotient2 = exp / abs_d;
564 uint64_t remainder2 = exp % abs_d;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800565
566 /*
567 * To avoid handling both positive and negative divisor, Hacker's Delight
568 * introduces a method to handle these 2 cases together to avoid duplication.
569 */
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700570 uint64_t delta;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800571 do {
572 p++;
573 quotient1 = 2 * quotient1;
574 remainder1 = 2 * remainder1;
575 if (remainder1 >= abs_nc) {
576 quotient1++;
577 remainder1 = remainder1 - abs_nc;
578 }
579 quotient2 = 2 * quotient2;
580 remainder2 = 2 * remainder2;
581 if (remainder2 >= abs_d) {
582 quotient2++;
583 remainder2 = remainder2 - abs_d;
584 }
585 delta = abs_d - remainder2;
586 } while (quotient1 < delta || (quotient1 == delta && remainder1 == 0));
587
588 magic = (divisor > 0) ? (quotient2 + 1) : (-quotient2 - 1);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700589
590 if (!is_long) {
591 magic = static_cast<int>(magic);
592 }
593
594 shift = (is_long) ? p - 64 : p - 32;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800595}
596
buzbee2700f7e2014-03-07 09:46:20 -0800597RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegStorage reg_lo, int lit, bool is_div) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700598 UNUSED(rl_dest, reg_lo, lit, is_div);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700599 LOG(FATAL) << "Unexpected use of GenDivRemLit for x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700600 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700601}
602
Mark Mendell2bf31e62014-01-23 12:13:40 -0800603RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegLocation rl_src,
604 int imm, bool is_div) {
605 // Use a multiply (and fixup) to perform an int div/rem by a constant.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700606 RegLocation rl_result;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800607
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700608 if (imm == 1) {
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700609 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800610 if (is_div) {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700611 // x / 1 == x.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700612 LoadValueDirectFixed(rl_src, rl_result.reg);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700613 } else {
614 // x % 1 == 0.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700615 LoadConstantNoClobber(rl_result.reg, 0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700616 }
617 } else if (imm == -1) { // handle 0x80000000 / -1 special case.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700618 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700619 if (is_div) {
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700620 LoadValueDirectFixed(rl_src, rl_result.reg);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400621
622 // Check if numerator is 0
623 OpRegImm(kOpCmp, rl_result.reg, 0);
624 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
625
626 // handle 0x80000000 / -1
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700627 OpRegImm(kOpCmp, rl_result.reg, 0x80000000);
628 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800629
630 // for x != MIN_INT, x / -1 == -x.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700631 NewLIR1(kX86Neg32R, rl_result.reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800632
Mark Mendell2bf31e62014-01-23 12:13:40 -0800633 // EAX already contains the right value (0x80000000),
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700634 minint_branch->target = NewLIR0(kPseudoTargetLabel);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400635 branch->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800636 } else {
637 // x % -1 == 0.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700638 LoadConstantNoClobber(rl_result.reg, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800639 }
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700640 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
641 // Division using shifting.
642 rl_src = LoadValue(rl_src, kCoreReg);
643 rl_result = EvalLoc(rl_dest, kCoreReg, true);
644 if (IsSameReg(rl_result.reg, rl_src.reg)) {
645 RegStorage rs_temp = AllocTypedTemp(false, kCoreReg);
646 rl_result.reg.SetReg(rs_temp.GetReg());
647 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400648
649 // Check if numerator is 0
650 OpRegImm(kOpCmp, rl_src.reg, 0);
651 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
652 LoadConstantNoClobber(rl_result.reg, 0);
653 LIR* done = NewLIR1(kX86Jmp8, 0);
654 branch->target = NewLIR0(kPseudoTargetLabel);
655
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700656 NewLIR3(kX86Lea32RM, rl_result.reg.GetReg(), rl_src.reg.GetReg(), std::abs(imm) - 1);
657 NewLIR2(kX86Test32RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
658 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
659 int shift_amount = LowestSetBit(imm);
660 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
661 if (imm < 0) {
662 OpReg(kOpNeg, rl_result.reg);
663 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400664 done->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800665 } else {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700666 CHECK(imm <= -2 || imm >= 2);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700667
Mark Mendell2bf31e62014-01-23 12:13:40 -0800668 // Use H.S.Warren's Hacker's Delight Chapter 10 and
669 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700670 int64_t magic;
671 int shift;
672 CalculateMagicAndShift((int64_t)imm, magic, shift, false /* is_long */);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800673
674 /*
675 * For imm >= 2,
676 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
677 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
678 * For imm <= -2,
679 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
680 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
681 * We implement this algorithm in the following way:
682 * 1. multiply magic number m and numerator n, get the higher 32bit result in EDX
683 * 2. if imm > 0 and magic < 0, add numerator to EDX
684 * if imm < 0 and magic > 0, sub numerator from EDX
685 * 3. if S !=0, SAR S bits for EDX
686 * 4. add 1 to EDX if EDX < 0
687 * 5. Thus, EDX is the quotient
688 */
689
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700690 FlushReg(rs_r0);
691 Clobber(rs_r0);
692 LockTemp(rs_r0);
693 FlushReg(rs_r2);
694 Clobber(rs_r2);
695 LockTemp(rs_r2);
696
Mark Mendell3a91f442014-09-02 12:44:24 -0400697 // Assume that the result will be in EDX for divide, and EAX for remainder.
698 rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, is_div ? rs_r2 : rs_r0,
699 INVALID_SREG, INVALID_SREG};
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700700
Mark Mendell3a91f442014-09-02 12:44:24 -0400701 // We need the value at least twice. Load into a temp.
702 rl_src = LoadValue(rl_src, kCoreReg);
703 RegStorage numerator_reg = rl_src.reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800704
Mark Mendell3a91f442014-09-02 12:44:24 -0400705 // Check if numerator is 0.
706 OpRegImm(kOpCmp, numerator_reg, 0);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400707 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell3a91f442014-09-02 12:44:24 -0400708 // Return result 0 if numerator was 0.
709 LoadConstantNoClobber(rl_result.reg, 0);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400710 LIR* done = NewLIR1(kX86Jmp8, 0);
711 branch->target = NewLIR0(kPseudoTargetLabel);
712
Mark Mendell3a91f442014-09-02 12:44:24 -0400713 // EAX = magic.
714 LoadConstant(rs_r0, magic);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800715
Mark Mendell3a91f442014-09-02 12:44:24 -0400716 // EDX:EAX = magic * numerator.
717 NewLIR1(kX86Imul32DaR, numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800718
719 if (imm > 0 && magic < 0) {
720 // Add numerator to EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800721 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700722 NewLIR2(kX86Add32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800723 } else if (imm < 0 && magic > 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800724 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700725 NewLIR2(kX86Sub32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800726 }
727
728 // Do we need the shift?
729 if (shift != 0) {
730 // Shift EDX by 'shift' bits.
buzbee091cc402014-03-31 10:14:40 -0700731 NewLIR2(kX86Sar32RI, rs_r2.GetReg(), shift);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800732 }
733
734 // Add 1 to EDX if EDX < 0.
735
736 // Move EDX to EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800737 OpRegCopy(rs_r0, rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800738
739 // Move sign bit to bit 0, zeroing the rest.
buzbee091cc402014-03-31 10:14:40 -0700740 NewLIR2(kX86Shr32RI, rs_r2.GetReg(), 31);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800741
742 // EDX = EDX + EAX.
buzbee091cc402014-03-31 10:14:40 -0700743 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r0.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800744
745 // Quotient is in EDX.
746 if (!is_div) {
747 // We need to compute the remainder.
748 // Remainder is divisor - (quotient * imm).
buzbee2700f7e2014-03-07 09:46:20 -0800749 DCHECK(numerator_reg.Valid());
750 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800751
752 // EAX = numerator * imm.
buzbee2700f7e2014-03-07 09:46:20 -0800753 OpRegRegImm(kOpMul, rs_r2, rs_r2, imm);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800754
Mark Mendell3a91f442014-09-02 12:44:24 -0400755 // EAX -= EDX.
buzbee091cc402014-03-31 10:14:40 -0700756 NewLIR2(kX86Sub32RR, rs_r0.GetReg(), rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800757
758 // For this case, return the result in EAX.
Mark Mendell2bf31e62014-01-23 12:13:40 -0800759 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400760 done->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800761 }
762
763 return rl_result;
764}
765
buzbee2700f7e2014-03-07 09:46:20 -0800766RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegStorage reg_lo, RegStorage reg_hi,
767 bool is_div) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700768 UNUSED(rl_dest, reg_lo, reg_hi, is_div);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700769 LOG(FATAL) << "Unexpected use of GenDivRem for x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700770 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700771}
772
Mark Mendell2bf31e62014-01-23 12:13:40 -0800773RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegLocation rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -0700774 RegLocation rl_src2, bool is_div, int flags) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700775 UNUSED(rl_dest);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800776 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700777
778 // Prepare for explicit register usage.
779 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800780
781 // Load LHS into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800782 LoadValueDirectFixed(rl_src1, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800783
784 // Load RHS into EBX.
buzbee2700f7e2014-03-07 09:46:20 -0800785 LoadValueDirectFixed(rl_src2, rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800786
787 // Copy LHS sign bit into EDX.
788 NewLIR0(kx86Cdq32Da);
789
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -0700790 if ((flags & MIR_IGNORE_DIV_ZERO_CHECK) == 0) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800791 // Handle division by zero case.
Mingyao Yange643a172014-04-08 11:02:52 -0700792 GenDivZeroCheck(rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800793 }
794
Yixin Shou2ddd1752014-08-26 15:15:13 -0400795 // Check if numerator is 0
796 OpRegImm(kOpCmp, rs_r0, 0);
797 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
798
Mark Mendell2bf31e62014-01-23 12:13:40 -0800799 // Have to catch 0x80000000/-1 case, or we will get an exception!
buzbee2700f7e2014-03-07 09:46:20 -0800800 OpRegImm(kOpCmp, rs_r1, -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700801 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800802
803 // RHS is -1.
buzbee2700f7e2014-03-07 09:46:20 -0800804 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700805 LIR* minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800806
Yixin Shou2ddd1752014-08-26 15:15:13 -0400807 branch->target = NewLIR0(kPseudoTargetLabel);
808
Mark Mendell2bf31e62014-01-23 12:13:40 -0800809 // In 0x80000000/-1 case.
810 if (!is_div) {
811 // For DIV, EAX is already right. For REM, we need EDX 0.
buzbee2700f7e2014-03-07 09:46:20 -0800812 LoadConstantNoClobber(rs_r2, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800813 }
814 LIR* done = NewLIR1(kX86Jmp8, 0);
815
816 // Expected case.
817 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
818 minint_branch->target = minus_one_branch->target;
buzbee091cc402014-03-31 10:14:40 -0700819 NewLIR1(kX86Idivmod32DaR, rs_r1.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800820 done->target = NewLIR0(kPseudoTargetLabel);
821
822 // Result is in EAX for div and EDX for rem.
buzbee091cc402014-03-31 10:14:40 -0700823 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 -0800824 if (!is_div) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000825 rl_result.reg.SetReg(r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800826 }
827 return rl_result;
828}
829
Serban Constantinescu23abec92014-07-02 16:13:38 +0100830bool X86Mir2Lir::GenInlinedMinMax(CallInfo* info, bool is_min, bool is_long) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700831 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800832
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700833 if (is_long && !cu_->target64) {
834 /*
835 * We want to implement the following algorithm
836 * mov eax, low part of arg1
837 * mov edx, high part of arg1
838 * mov ebx, low part of arg2
839 * mov ecx, high part of arg2
840 * mov edi, eax
841 * sub edi, ebx
842 * mov edi, edx
843 * sbb edi, ecx
844 * is_min ? "cmovgel eax, ebx" : "cmovll eax, ebx"
845 * is_min ? "cmovgel edx, ecx" : "cmovll edx, ecx"
846 *
847 * The algorithm above needs 5 registers: a pair for the first operand
848 * (which later will be used as result), a pair for the second operand
849 * and a temp register (e.g. 'edi') for intermediate calculations.
850 * Ideally we have 6 GP caller-save registers in 32-bit mode. They are:
851 * 'eax', 'ebx', 'ecx', 'edx', 'esi' and 'edi'. So there should be
852 * always enough registers to operate on. Practically, there is a pair
853 * of registers 'edi' and 'esi' which holds promoted values and
854 * sometimes should be treated as 'callee save'. If one of the operands
855 * is in the promoted registers then we have enough register to
856 * operate on. Otherwise there is lack of resources and we have to
857 * save 'edi' before calculations and restore after.
858 */
859
860 RegLocation rl_src1 = info->args[0];
861 RegLocation rl_src2 = info->args[2];
862 RegLocation rl_dest = InlineTargetWide(info);
863 int res_vreg, src1_vreg, src2_vreg;
864
Mark Mendella65c1db2014-10-21 17:44:32 -0400865 if (rl_dest.s_reg_low == INVALID_SREG) {
866 // Result is unused, the code is dead. Inlining successful, no code generated.
867 return true;
868 }
869
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700870 /*
871 * If the result register is the same as the second element, then we
872 * need to be careful. The reason is that the first copy will
873 * inadvertently clobber the second element with the first one thus
874 * yielding the wrong result. Thus we do a swap in that case.
875 */
876 res_vreg = mir_graph_->SRegToVReg(rl_dest.s_reg_low);
877 src2_vreg = mir_graph_->SRegToVReg(rl_src2.s_reg_low);
878 if (res_vreg == src2_vreg) {
879 std::swap(rl_src1, rl_src2);
880 }
881
882 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
883 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
884
885 // Pick the first integer as min/max.
886 OpRegCopyWide(rl_result.reg, rl_src1.reg);
887
888 /*
889 * If the integers are both in the same register, then there is
890 * nothing else to do because they are equal and we have already
891 * moved one into the result.
892 */
893 src1_vreg = mir_graph_->SRegToVReg(rl_src1.s_reg_low);
894 src2_vreg = mir_graph_->SRegToVReg(rl_src2.s_reg_low);
895 if (src1_vreg == src2_vreg) {
896 StoreValueWide(rl_dest, rl_result);
897 return true;
898 }
899
900 // Free registers to make some room for the second operand.
901 // But don't try to free ourselves or promoted registers.
902 if (res_vreg != src1_vreg &&
903 IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
904 FreeTemp(rl_src1.reg);
905 }
906 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
907
908 // Do we have a free register for intermediate calculations?
909 RegStorage tmp = AllocTemp(false);
910 if (tmp == RegStorage::InvalidReg()) {
911 /*
912 * No, will use 'edi'.
913 *
914 * As mentioned above we have 4 temporary and 2 promotable
915 * caller-save registers. Therefore, we assume that a free
916 * register can be allocated only if 'esi' and 'edi' are
917 * already used as operands. If number of promotable registers
918 * increases from 2 to 4 then our assumption fails and operand
919 * data is corrupted.
920 * Let's DCHECK it.
921 */
922 DCHECK(IsTemp(rl_src2.reg.GetLow()) &&
923 IsTemp(rl_src2.reg.GetHigh()) &&
924 IsTemp(rl_result.reg.GetLow()) &&
925 IsTemp(rl_result.reg.GetHigh()));
926 tmp = rs_rDI;
927 NewLIR1(kX86Push32R, tmp.GetReg());
928 }
929
930 // Now we are ready to do calculations.
931 OpRegReg(kOpMov, tmp, rl_result.reg.GetLow());
932 OpRegReg(kOpSub, tmp, rl_src2.reg.GetLow());
933 OpRegReg(kOpMov, tmp, rl_result.reg.GetHigh());
934 OpRegReg(kOpSbc, tmp, rl_src2.reg.GetHigh());
935
936 // Let's put pop 'edi' here to break a bit the dependency chain.
937 if (tmp == rs_rDI) {
938 NewLIR1(kX86Pop32R, tmp.GetReg());
939 }
940
941 // Conditionally move the other integer into the destination register.
942 ConditionCode cc = is_min ? kCondGe : kCondLt;
943 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetLow(), rl_src2.reg.GetLow());
944 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetHigh(), rl_src2.reg.GetHigh());
945 StoreValueWide(rl_dest, rl_result);
946 return true;
Serban Constantinescu23abec92014-07-02 16:13:38 +0100947 }
948
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800949 // Get the two arguments to the invoke and place them in GP registers.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700950 RegLocation rl_src1 = info->args[0];
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700951 RegLocation rl_src2 = (is_long) ? info->args[2] : info->args[1];
952 rl_src1 = (is_long) ? LoadValueWide(rl_src1, kCoreReg) : LoadValue(rl_src1, kCoreReg);
953 rl_src2 = (is_long) ? LoadValueWide(rl_src2, kCoreReg) : LoadValue(rl_src2, kCoreReg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800954
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700955 RegLocation rl_dest = (is_long) ? InlineTargetWide(info) : InlineTarget(info);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700956 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800957
958 /*
959 * If the result register is the same as the second element, then we need to be careful.
960 * The reason is that the first copy will inadvertently clobber the second element with
961 * the first one thus yielding the wrong result. Thus we do a swap in that case.
962 */
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000963 if (rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800964 std::swap(rl_src1, rl_src2);
965 }
966
967 // Pick the first integer as min/max.
buzbee2700f7e2014-03-07 09:46:20 -0800968 OpRegCopy(rl_result.reg, rl_src1.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800969
970 // If the integers are both in the same register, then there is nothing else to do
971 // because they are equal and we have already moved one into the result.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000972 if (rl_src1.reg.GetReg() != rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800973 // It is possible we didn't pick correctly so do the actual comparison now.
buzbee2700f7e2014-03-07 09:46:20 -0800974 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800975
976 // Conditionally move the other integer into the destination register.
977 ConditionCode condition_code = is_min ? kCondGt : kCondLt;
buzbee2700f7e2014-03-07 09:46:20 -0800978 OpCondRegReg(kOpCmov, condition_code, rl_result.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800979 }
980
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700981 if (is_long) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000982 StoreValueWide(rl_dest, rl_result);
983 } else {
Vladimir Markoe508a202013-11-04 15:24:22 +0000984 StoreValue(rl_dest, rl_result);
985 }
986 return true;
987}
988
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700989bool X86Mir2Lir::GenInlinedPeek(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +0700990 RegLocation rl_src_address = info->args[0]; // long address
991 RegLocation rl_address;
992 if (!cu_->target64) {
993 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
994 rl_address = LoadValue(rl_src_address, kCoreReg);
995 } else {
996 rl_address = LoadValueWide(rl_src_address, kCoreReg);
997 }
998 RegLocation rl_dest = size == k64 ? InlineTargetWide(info) : InlineTarget(info);
999 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1000 // Unaligned access is allowed on x86.
1001 LoadBaseDisp(rl_address.reg, 0, rl_result.reg, size, kNotVolatile);
1002 if (size == k64) {
1003 StoreValueWide(rl_dest, rl_result);
1004 } else {
1005 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
1006 StoreValue(rl_dest, rl_result);
1007 }
1008 return true;
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001009}
1010
Vladimir Markoe508a202013-11-04 15:24:22 +00001011bool X86Mir2Lir::GenInlinedPoke(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +07001012 RegLocation rl_src_address = info->args[0]; // long address
1013 RegLocation rl_address;
1014 if (!cu_->target64) {
1015 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
1016 rl_address = LoadValue(rl_src_address, kCoreReg);
1017 } else {
1018 rl_address = LoadValueWide(rl_src_address, kCoreReg);
1019 }
1020 RegLocation rl_src_value = info->args[2]; // [size] value
1021 RegLocation rl_value;
1022 if (size == k64) {
1023 // Unaligned access is allowed on x86.
1024 rl_value = LoadValueWide(rl_src_value, kCoreReg);
1025 } else {
1026 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
1027 // In 32-bit mode the only EAX..EDX registers can be used with Mov8MR.
1028 if (!cu_->target64 && size == kSignedByte) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001029 rl_src_value = UpdateLocTyped(rl_src_value);
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +07001030 if (rl_src_value.location == kLocPhysReg && !IsByteRegister(rl_src_value.reg)) {
1031 RegStorage temp = AllocateByteRegister();
1032 OpRegCopy(temp, rl_src_value.reg);
1033 rl_value.reg = temp;
1034 } else {
1035 rl_value = LoadValue(rl_src_value, kCoreReg);
1036 }
1037 } else {
1038 rl_value = LoadValue(rl_src_value, kCoreReg);
1039 }
1040 }
1041 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size, kNotVolatile);
1042 return true;
Vladimir Markoe508a202013-11-04 15:24:22 +00001043}
1044
buzbee2700f7e2014-03-07 09:46:20 -08001045void X86Mir2Lir::OpLea(RegStorage r_base, RegStorage reg1, RegStorage reg2, int scale, int offset) {
1046 NewLIR5(kX86Lea32RA, r_base.GetReg(), reg1.GetReg(), reg2.GetReg(), scale, offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001047}
1048
Ian Rogersdd7624d2014-03-14 17:43:00 -07001049void X86Mir2Lir::OpTlsCmp(ThreadOffset<4> offset, int val) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001050 DCHECK_EQ(kX86, cu_->instruction_set);
1051 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
1052}
1053
1054void X86Mir2Lir::OpTlsCmp(ThreadOffset<8> offset, int val) {
1055 DCHECK_EQ(kX86_64, cu_->instruction_set);
Ian Rogers468532e2013-08-05 10:56:33 -07001056 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001057}
1058
buzbee2700f7e2014-03-07 09:46:20 -08001059static bool IsInReg(X86Mir2Lir *pMir2Lir, const RegLocation &rl, RegStorage reg) {
1060 return rl.reg.Valid() && rl.reg.GetReg() == reg.GetReg() && (pMir2Lir->IsLive(reg) || rl.home);
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001061}
1062
Vladimir Marko1c282e22013-11-21 14:49:47 +00001063bool X86Mir2Lir::GenInlinedCas(CallInfo* info, bool is_long, bool is_object) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +07001064 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001065 // Unused - RegLocation rl_src_unsafe = info->args[0];
1066 RegLocation rl_src_obj = info->args[1]; // Object - known non-null
1067 RegLocation rl_src_offset = info->args[2]; // long low
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001068 if (!cu_->target64) {
1069 rl_src_offset = NarrowRegLoc(rl_src_offset); // ignore high half in info->args[3]
1070 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001071 RegLocation rl_src_expected = info->args[4]; // int, long or Object
1072 // If is_long, high half is in info->args[5]
1073 RegLocation rl_src_new_value = info->args[is_long ? 6 : 5]; // int, long or Object
1074 // If is_long, high half is in info->args[7]
1075
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001076 if (is_long && cu_->target64) {
1077 // 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 -07001078 FlushReg(rs_r0q);
1079 Clobber(rs_r0q);
1080 LockTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001081
1082 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
1083 RegLocation rl_new_value = LoadValueWide(rl_src_new_value, kCoreReg);
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001084 RegLocation rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1085 LoadValueDirectWide(rl_src_expected, rs_r0q);
Andreas Gampeccc60262014-07-04 18:02:38 -07001086 NewLIR5(kX86LockCmpxchg64AR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1087 rl_new_value.reg.GetReg());
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001088
1089 // After a store we need to insert barrier in case of potential load. Since the
1090 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
Hans Boehm48f5c472014-06-27 14:50:10 -07001091 GenMemBarrier(kAnyAny);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001092
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001093 FreeTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001094 } else if (is_long) {
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001095 // TODO: avoid unnecessary loads of SI and DI when the values are in registers.
1096 // TODO: CFI support.
Vladimir Marko70b797d2013-12-03 15:25:24 +00001097 FlushAllRegs();
1098 LockCallTemps();
buzbee091cc402014-03-31 10:14:40 -07001099 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
1100 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_rBX, rs_rCX);
buzbee2700f7e2014-03-07 09:46:20 -08001101 LoadValueDirectWideFixed(rl_src_expected, r_tmp1);
1102 LoadValueDirectWideFixed(rl_src_new_value, r_tmp2);
buzbee695d13a2014-04-19 13:32:20 -07001103 // FIXME: needs 64-bit update.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001104 const bool obj_in_di = IsInReg(this, rl_src_obj, rs_rDI);
1105 const bool obj_in_si = IsInReg(this, rl_src_obj, rs_rSI);
1106 DCHECK(!obj_in_si || !obj_in_di);
1107 const bool off_in_di = IsInReg(this, rl_src_offset, rs_rDI);
1108 const bool off_in_si = IsInReg(this, rl_src_offset, rs_rSI);
1109 DCHECK(!off_in_si || !off_in_di);
1110 // If obj/offset is in a reg, use that reg. Otherwise, use the empty reg.
1111 RegStorage rs_obj = obj_in_di ? rs_rDI : obj_in_si ? rs_rSI : !off_in_di ? rs_rDI : rs_rSI;
1112 RegStorage rs_off = off_in_si ? rs_rSI : off_in_di ? rs_rDI : !obj_in_si ? rs_rSI : rs_rDI;
1113 bool push_di = (!obj_in_di && !off_in_di) && (rs_obj == rs_rDI || rs_off == rs_rDI);
1114 bool push_si = (!obj_in_si && !off_in_si) && (rs_obj == rs_rSI || rs_off == rs_rSI);
1115 if (push_di) {
1116 NewLIR1(kX86Push32R, rs_rDI.GetReg());
1117 MarkTemp(rs_rDI);
1118 LockTemp(rs_rDI);
1119 }
1120 if (push_si) {
1121 NewLIR1(kX86Push32R, rs_rSI.GetReg());
1122 MarkTemp(rs_rSI);
1123 LockTemp(rs_rSI);
1124 }
1125 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1126 const size_t push_offset = (push_si ? 4u : 0u) + (push_di ? 4u : 0u);
1127 if (!obj_in_si && !obj_in_di) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07001128 LoadWordDisp(rs_rX86_SP, SRegOffset(rl_src_obj.s_reg_low) + push_offset, rs_obj);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001129 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1130 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1131 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1132 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1133 }
1134 if (!off_in_si && !off_in_di) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07001135 LoadWordDisp(rs_rX86_SP, SRegOffset(rl_src_offset.s_reg_low) + push_offset, rs_off);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001136 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1137 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1138 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1139 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1140 }
1141 NewLIR4(kX86LockCmpxchg64A, rs_obj.GetReg(), rs_off.GetReg(), 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001142
Hans Boehm48f5c472014-06-27 14:50:10 -07001143 // After a store we need to insert barrier to prevent reordering with either
1144 // earlier or later memory accesses. Since
1145 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1146 // and it will be associated with the cmpxchg instruction, preventing both.
1147 GenMemBarrier(kAnyAny);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001148
1149 if (push_si) {
1150 FreeTemp(rs_rSI);
1151 UnmarkTemp(rs_rSI);
1152 NewLIR1(kX86Pop32R, rs_rSI.GetReg());
1153 }
1154 if (push_di) {
1155 FreeTemp(rs_rDI);
1156 UnmarkTemp(rs_rDI);
1157 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
1158 }
Vladimir Marko70b797d2013-12-03 15:25:24 +00001159 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +00001160 } else {
1161 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -08001162 FlushReg(rs_r0);
buzbee091cc402014-03-31 10:14:40 -07001163 Clobber(rs_r0);
buzbee2700f7e2014-03-07 09:46:20 -08001164 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001165
buzbeea0cd2d72014-06-01 09:33:49 -07001166 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
buzbee7c02e912014-10-03 13:14:17 -07001167 RegLocation rl_new_value = LoadValue(rl_src_new_value, LocToRegClass(rl_src_new_value));
Vladimir Markoc29bb612013-11-27 16:47:25 +00001168
1169 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
1170 // Mark card for object assuming new value is stored.
buzbee091cc402014-03-31 10:14:40 -07001171 FreeTemp(rs_r0); // Temporarily release EAX for MarkGCCard().
buzbee2700f7e2014-03-07 09:46:20 -08001172 MarkGCCard(rl_new_value.reg, rl_object.reg);
buzbee091cc402014-03-31 10:14:40 -07001173 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001174 }
1175
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001176 RegLocation rl_offset;
1177 if (cu_->target64) {
1178 rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1179 } else {
1180 rl_offset = LoadValue(rl_src_offset, kCoreReg);
1181 }
buzbee2700f7e2014-03-07 09:46:20 -08001182 LoadValueDirect(rl_src_expected, rs_r0);
Andreas Gampeccc60262014-07-04 18:02:38 -07001183 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1184 rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +00001185
Hans Boehm48f5c472014-06-27 14:50:10 -07001186 // After a store we need to insert barrier to prevent reordering with either
1187 // earlier or later memory accesses. Since
1188 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1189 // and it will be associated with the cmpxchg instruction, preventing both.
1190 GenMemBarrier(kAnyAny);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001191
buzbee091cc402014-03-31 10:14:40 -07001192 FreeTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001193 }
1194
1195 // Convert ZF to boolean
1196 RegLocation rl_dest = InlineTarget(info); // boolean place for result
1197 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001198 RegStorage result_reg = rl_result.reg;
1199
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001200 // For 32-bit, SETcc only works with EAX..EDX.
1201 if (!IsByteRegister(result_reg)) {
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001202 result_reg = AllocateByteRegister();
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001203 }
1204 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondZ);
1205 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), result_reg.GetReg());
1206 if (IsTemp(result_reg)) {
1207 FreeTemp(result_reg);
1208 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001209 StoreValue(rl_dest, rl_result);
1210 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001211}
1212
Yixin Shou8c914c02014-07-28 14:17:09 -04001213void X86Mir2Lir::SwapBits(RegStorage result_reg, int shift, int32_t value) {
1214 RegStorage r_temp = AllocTemp();
1215 OpRegCopy(r_temp, result_reg);
1216 OpRegImm(kOpLsr, result_reg, shift);
1217 OpRegImm(kOpAnd, r_temp, value);
1218 OpRegImm(kOpAnd, result_reg, value);
1219 OpRegImm(kOpLsl, r_temp, shift);
1220 OpRegReg(kOpOr, result_reg, r_temp);
1221 FreeTemp(r_temp);
1222}
1223
1224void X86Mir2Lir::SwapBits64(RegStorage result_reg, int shift, int64_t value) {
1225 RegStorage r_temp = AllocTempWide();
1226 OpRegCopy(r_temp, result_reg);
1227 OpRegImm(kOpLsr, result_reg, shift);
1228 RegStorage r_value = AllocTempWide();
1229 LoadConstantWide(r_value, value);
1230 OpRegReg(kOpAnd, r_temp, r_value);
1231 OpRegReg(kOpAnd, result_reg, r_value);
1232 OpRegImm(kOpLsl, r_temp, shift);
1233 OpRegReg(kOpOr, result_reg, r_temp);
1234 FreeTemp(r_temp);
1235 FreeTemp(r_value);
1236}
1237
1238bool X86Mir2Lir::GenInlinedReverseBits(CallInfo* info, OpSize size) {
1239 RegLocation rl_src_i = info->args[0];
1240 RegLocation rl_i = (size == k64) ? LoadValueWide(rl_src_i, kCoreReg)
1241 : LoadValue(rl_src_i, kCoreReg);
1242 RegLocation rl_dest = (size == k64) ? InlineTargetWide(info) : InlineTarget(info);
1243 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1244 if (size == k64) {
1245 if (cu_->instruction_set == kX86_64) {
1246 /* Use one bswap instruction to reverse byte order first and then use 3 rounds of
1247 swapping bits to reverse bits in a long number x. Using bswap to save instructions
1248 compared to generic luni implementation which has 5 rounds of swapping bits.
1249 x = bswap x
1250 x = (x & 0x5555555555555555) << 1 | (x >> 1) & 0x5555555555555555;
1251 x = (x & 0x3333333333333333) << 2 | (x >> 2) & 0x3333333333333333;
1252 x = (x & 0x0F0F0F0F0F0F0F0F) << 4 | (x >> 4) & 0x0F0F0F0F0F0F0F0F;
1253 */
1254 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1255 SwapBits64(rl_result.reg, 1, 0x5555555555555555);
1256 SwapBits64(rl_result.reg, 2, 0x3333333333333333);
1257 SwapBits64(rl_result.reg, 4, 0x0f0f0f0f0f0f0f0f);
1258 StoreValueWide(rl_dest, rl_result);
1259 return true;
1260 }
1261 RegStorage r_i_low = rl_i.reg.GetLow();
1262 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1263 // First REV shall clobber rl_result.reg.GetLowReg(), save the value in a temp for the second
1264 // REV.
1265 r_i_low = AllocTemp();
1266 OpRegCopy(r_i_low, rl_i.reg);
1267 }
1268 OpRegReg(kOpRev, rl_result.reg.GetLow(), rl_i.reg.GetHigh());
1269 OpRegReg(kOpRev, rl_result.reg.GetHigh(), r_i_low);
1270 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1271 FreeTemp(r_i_low);
1272 }
1273 SwapBits(rl_result.reg.GetLow(), 1, 0x55555555);
1274 SwapBits(rl_result.reg.GetLow(), 2, 0x33333333);
1275 SwapBits(rl_result.reg.GetLow(), 4, 0x0f0f0f0f);
1276 SwapBits(rl_result.reg.GetHigh(), 1, 0x55555555);
1277 SwapBits(rl_result.reg.GetHigh(), 2, 0x33333333);
1278 SwapBits(rl_result.reg.GetHigh(), 4, 0x0f0f0f0f);
1279 StoreValueWide(rl_dest, rl_result);
1280 } else {
1281 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1282 SwapBits(rl_result.reg, 1, 0x55555555);
1283 SwapBits(rl_result.reg, 2, 0x33333333);
1284 SwapBits(rl_result.reg, 4, 0x0f0f0f0f);
1285 StoreValue(rl_dest, rl_result);
1286 }
1287 return true;
1288}
1289
buzbee2700f7e2014-03-07 09:46:20 -08001290LIR* X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001291 CHECK(base_of_code_ != nullptr);
1292
1293 // Address the start of the method
1294 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07001295 if (rl_method.wide) {
1296 LoadValueDirectWideFixed(rl_method, reg);
1297 } else {
1298 LoadValueDirectFixed(rl_method, reg);
1299 }
Mark Mendell55d0eac2014-02-06 11:02:52 -08001300 store_method_addr_used_ = true;
1301
1302 // Load the proper value from the literal area.
1303 // We don't know the proper offset for the value, so pick one that will force
1304 // 4 byte offset. We will fix this up in the assembler later to have the right
1305 // value.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001306 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
buzbee2700f7e2014-03-07 09:46:20 -08001307 LIR *res = RawLIR(current_dalvik_offset_, kX86Mov32RM, reg.GetReg(), reg.GetReg(), 256,
1308 0, 0, target);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001309 res->target = target;
1310 res->flags.fixup = kFixupLoad;
Mark Mendell55d0eac2014-02-06 11:02:52 -08001311 store_method_addr_used_ = true;
1312 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001313}
1314
buzbee2700f7e2014-03-07 09:46:20 -08001315LIR* X86Mir2Lir::OpVldm(RegStorage r_base, int count) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001316 UNUSED(r_base, count);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001317 LOG(FATAL) << "Unexpected use of OpVldm for x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001318 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001319}
1320
buzbee2700f7e2014-03-07 09:46:20 -08001321LIR* X86Mir2Lir::OpVstm(RegStorage r_base, int count) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001322 UNUSED(r_base, count);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001323 LOG(FATAL) << "Unexpected use of OpVstm for x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001324 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001325}
1326
1327void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
1328 RegLocation rl_result, int lit,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001329 int first_bit, int second_bit) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001330 UNUSED(lit);
buzbee2700f7e2014-03-07 09:46:20 -08001331 RegStorage t_reg = AllocTemp();
1332 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
1333 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001334 FreeTemp(t_reg);
1335 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -08001336 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001337 }
1338}
1339
Mingyao Yange643a172014-04-08 11:02:52 -07001340void X86Mir2Lir::GenDivZeroCheckWide(RegStorage reg) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001341 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001342 DCHECK(reg.Is64Bit());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001343
Chao-ying Fua0147762014-06-06 18:38:49 -07001344 NewLIR2(kX86Cmp64RI8, reg.GetReg(), 0);
1345 } else {
1346 DCHECK(reg.IsPair());
1347
1348 // We are not supposed to clobber the incoming storage, so allocate a temporary.
1349 RegStorage t_reg = AllocTemp();
1350 // Doing an OR is a quick way to check if both registers are zero. This will set the flags.
1351 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
1352 // The temp is no longer needed so free it at this time.
1353 FreeTemp(t_reg);
1354 }
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001355
1356 // In case of zero, throw ArithmeticException.
Mingyao Yange643a172014-04-08 11:02:52 -07001357 GenDivZeroCheck(kCondEq);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001358}
1359
Mingyao Yang80365d92014-04-18 12:10:58 -07001360void X86Mir2Lir::GenArrayBoundsCheck(RegStorage index,
1361 RegStorage array_base,
1362 int len_offset) {
1363 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1364 public:
Andreas Gampe277ccbd2014-11-03 21:36:10 -08001365 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch_in,
1366 RegStorage index_in, RegStorage array_base_in, int32_t len_offset_in)
1367 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch_in),
1368 index_(index_in), array_base_(array_base_in), len_offset_(len_offset_in) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001369 }
1370
1371 void Compile() OVERRIDE {
1372 m2l_->ResetRegPool();
1373 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001374 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001375
1376 RegStorage new_index = index_;
1377 // Move index out of kArg1, either directly to kArg0, or to kArg2.
Serguei Katkov4c7cc152014-06-24 00:50:02 +07001378 // TODO: clean-up to check not a number but with type
Andreas Gampeccc60262014-07-04 18:02:38 -07001379 if (index_ == m2l_->TargetReg(kArg1, kNotWide)) {
1380 if (array_base_ == m2l_->TargetReg(kArg0, kRef)) {
1381 m2l_->OpRegCopy(m2l_->TargetReg(kArg2, kNotWide), index_);
1382 new_index = m2l_->TargetReg(kArg2, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001383 } else {
Andreas Gampeccc60262014-07-04 18:02:38 -07001384 m2l_->OpRegCopy(m2l_->TargetReg(kArg0, kNotWide), index_);
1385 new_index = m2l_->TargetReg(kArg0, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001386 }
1387 }
1388 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001389 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1390 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1391 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, new_index,
1392 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001393 }
1394
1395 private:
1396 const RegStorage index_;
1397 const RegStorage array_base_;
1398 const int32_t len_offset_;
1399 };
1400
1401 OpRegMem(kOpCmp, index, array_base, len_offset);
Dave Allison69dfe512014-07-11 17:11:58 +00001402 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001403 LIR* branch = OpCondBranch(kCondUge, nullptr);
1404 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1405 index, array_base, len_offset));
1406}
1407
1408void X86Mir2Lir::GenArrayBoundsCheck(int32_t index,
1409 RegStorage array_base,
1410 int32_t len_offset) {
1411 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1412 public:
Andreas Gampe277ccbd2014-11-03 21:36:10 -08001413 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch_in,
1414 int32_t index_in, RegStorage array_base_in, int32_t len_offset_in)
1415 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch_in),
1416 index_(index_in), array_base_(array_base_in), len_offset_(len_offset_in) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001417 }
1418
1419 void Compile() OVERRIDE {
1420 m2l_->ResetRegPool();
1421 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001422 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001423
1424 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001425 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1426 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1427 x86_m2l->LoadConstant(m2l_->TargetReg(kArg0, kNotWide), index_);
1428 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, m2l_->TargetReg(kArg0, kNotWide),
1429 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001430 }
1431
1432 private:
1433 const int32_t index_;
1434 const RegStorage array_base_;
1435 const int32_t len_offset_;
1436 };
1437
1438 NewLIR3(IS_SIMM8(index) ? kX86Cmp32MI8 : kX86Cmp32MI, array_base.GetReg(), len_offset, index);
Dave Allison69dfe512014-07-11 17:11:58 +00001439 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001440 LIR* branch = OpCondBranch(kCondLs, nullptr);
1441 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1442 index, array_base, len_offset));
1443}
1444
Brian Carlstrom7940e442013-07-12 13:46:57 -07001445// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001446LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
buzbee33ae5582014-06-12 14:56:32 -07001447 if (cu_->target64) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001448 OpTlsCmp(Thread::ThreadFlagsOffset<8>(), 0);
1449 } else {
1450 OpTlsCmp(Thread::ThreadFlagsOffset<4>(), 0);
1451 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001452 return OpCondBranch((target == NULL) ? kCondNe : kCondEq, target);
1453}
1454
1455// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -08001456LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001457 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -08001458 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001459}
1460
buzbee11b63d12013-08-27 07:34:17 -07001461bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001462 RegLocation rl_src, RegLocation rl_dest, int lit) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001463 UNUSED(dalvik_opcode, is_div, rl_src, rl_dest, lit);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001464 LOG(FATAL) << "Unexpected use of smallLiteralDive in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001465 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001466}
1467
Ian Rogerse2143c02014-03-28 08:47:16 -07001468bool X86Mir2Lir::EasyMultiply(RegLocation rl_src, RegLocation rl_dest, int lit) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001469 UNUSED(rl_src, rl_dest, lit);
Ian Rogerse2143c02014-03-28 08:47:16 -07001470 LOG(FATAL) << "Unexpected use of easyMultiply in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001471 UNREACHABLE();
Ian Rogerse2143c02014-03-28 08:47:16 -07001472}
1473
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001474LIR* X86Mir2Lir::OpIT(ConditionCode cond, const char* guide) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001475 UNUSED(cond, guide);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001476 LOG(FATAL) << "Unexpected use of OpIT in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001477 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001478}
1479
Dave Allison3da67a52014-04-02 17:03:45 -07001480void X86Mir2Lir::OpEndIT(LIR* it) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001481 UNUSED(it);
Dave Allison3da67a52014-04-02 17:03:45 -07001482 LOG(FATAL) << "Unexpected use of OpEndIT in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001483 UNREACHABLE();
Dave Allison3da67a52014-04-02 17:03:45 -07001484}
1485
buzbee2700f7e2014-03-07 09:46:20 -08001486void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001487 switch (val) {
1488 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001489 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001490 break;
1491 case 1:
1492 OpRegCopy(dest, src);
1493 break;
1494 default:
1495 OpRegRegImm(kOpMul, dest, src, val);
1496 break;
1497 }
1498}
1499
buzbee2700f7e2014-03-07 09:46:20 -08001500void X86Mir2Lir::GenImulMemImm(RegStorage dest, int sreg, int displacement, int val) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001501 UNUSED(sreg);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001502 // All memory accesses below reference dalvik regs.
1503 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1504
Mark Mendell4708dcd2014-01-22 09:05:18 -08001505 LIR *m;
1506 switch (val) {
1507 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001508 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001509 break;
1510 case 1:
Andreas Gampe3c12c512014-06-24 18:46:29 +00001511 LoadBaseDisp(rs_rX86_SP, displacement, dest, k32, kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001512 break;
1513 default:
buzbee091cc402014-03-31 10:14:40 -07001514 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(),
1515 rs_rX86_SP.GetReg(), displacement, val);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001516 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
1517 break;
1518 }
1519}
1520
Andreas Gampec76c6142014-08-04 16:30:03 -07001521void X86Mir2Lir::GenArithOpLong(Instruction::Code opcode, RegLocation rl_dest, RegLocation rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001522 RegLocation rl_src2, int flags) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001523 if (!cu_->target64) {
1524 // Some x86 32b ops are fallback.
1525 switch (opcode) {
1526 case Instruction::NOT_LONG:
1527 case Instruction::DIV_LONG:
1528 case Instruction::DIV_LONG_2ADDR:
1529 case Instruction::REM_LONG:
1530 case Instruction::REM_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001531 Mir2Lir::GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001532 return;
1533
1534 default:
1535 // Everything else we can handle.
1536 break;
1537 }
1538 }
1539
1540 switch (opcode) {
1541 case Instruction::NOT_LONG:
1542 GenNotLong(rl_dest, rl_src2);
1543 return;
1544
1545 case Instruction::ADD_LONG:
1546 case Instruction::ADD_LONG_2ADDR:
1547 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1548 return;
1549
1550 case Instruction::SUB_LONG:
1551 case Instruction::SUB_LONG_2ADDR:
1552 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1553 return;
1554
1555 case Instruction::MUL_LONG:
1556 case Instruction::MUL_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001557 GenMulLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001558 return;
1559
1560 case Instruction::DIV_LONG:
1561 case Instruction::DIV_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001562 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ true, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001563 return;
1564
1565 case Instruction::REM_LONG:
1566 case Instruction::REM_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001567 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ false, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001568 return;
1569
1570 case Instruction::AND_LONG_2ADDR:
1571 case Instruction::AND_LONG:
1572 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1573 return;
1574
1575 case Instruction::OR_LONG:
1576 case Instruction::OR_LONG_2ADDR:
1577 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1578 return;
1579
1580 case Instruction::XOR_LONG:
1581 case Instruction::XOR_LONG_2ADDR:
1582 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1583 return;
1584
1585 case Instruction::NEG_LONG:
1586 GenNegLong(rl_dest, rl_src2);
1587 return;
1588
1589 default:
1590 LOG(FATAL) << "Invalid long arith op";
1591 return;
1592 }
1593}
1594
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001595bool X86Mir2Lir::GenMulLongConst(RegLocation rl_dest, RegLocation rl_src1, int64_t val, int flags) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001596 // All memory accesses below reference dalvik regs.
1597 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1598
Andreas Gampec76c6142014-08-04 16:30:03 -07001599 if (val == 0) {
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001600 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Andreas Gampec76c6142014-08-04 16:30:03 -07001601 if (cu_->target64) {
1602 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001603 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001604 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
1605 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001606 }
Andreas Gampec76c6142014-08-04 16:30:03 -07001607 StoreValueWide(rl_dest, rl_result);
1608 return true;
1609 } else if (val == 1) {
1610 StoreValueWide(rl_dest, rl_src1);
1611 return true;
1612 } else if (val == 2) {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001613 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001614 return true;
1615 } else if (IsPowerOfTwo(val)) {
1616 int shift_amount = LowestSetBit(val);
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001617 if (!PartiallyIntersects(rl_src1, rl_dest)) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001618 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1619 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest, rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001620 shift_amount, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001621 StoreValueWide(rl_dest, rl_result);
1622 return true;
1623 }
1624 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001625
Andreas Gampec76c6142014-08-04 16:30:03 -07001626 // Okay, on 32b just bite the bullet and do it, still better than the general case.
1627 if (!cu_->target64) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001628 int32_t val_lo = Low32Bits(val);
1629 int32_t val_hi = High32Bits(val);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001630 // Prepare for explicit register usage.
1631 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001632 rl_src1 = UpdateLocWideTyped(rl_src1);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001633 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1634 int displacement = SRegOffset(rl_src1.s_reg_low);
1635
1636 // ECX <- 1H * 2L
1637 // EAX <- 1L * 2H
1638 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001639 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
1640 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001641 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001642 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
1643 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001644 }
1645
1646 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001647 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001648
1649 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001650 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001651
1652 // EDX:EAX <- 2L * 1L (double precision)
1653 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001654 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001655 } else {
buzbee091cc402014-03-31 10:14:40 -07001656 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001657 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1658 true /* is_load */, true /* is_64bit */);
1659 }
1660
1661 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001662 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001663
1664 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001665 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
1666 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001667 StoreValueWide(rl_dest, rl_result);
Andreas Gampec76c6142014-08-04 16:30:03 -07001668 return true;
1669 }
1670 return false;
1671}
1672
1673void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001674 RegLocation rl_src2, int flags) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001675 if (rl_src1.is_const) {
1676 std::swap(rl_src1, rl_src2);
1677 }
1678
1679 if (rl_src2.is_const) {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001680 if (GenMulLongConst(rl_dest, rl_src1, mir_graph_->ConstantValueWide(rl_src2), flags)) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001681 return;
1682 }
1683 }
1684
1685 // All memory accesses below reference dalvik regs.
1686 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1687
1688 if (cu_->target64) {
1689 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1690 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1691 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1692 if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1693 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1694 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
1695 } else if (rl_result.reg.GetReg() != rl_src1.reg.GetReg() &&
1696 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1697 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src1.reg.GetReg());
1698 } else if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1699 rl_result.reg.GetReg() != rl_src2.reg.GetReg()) {
1700 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1701 } else {
1702 OpRegCopy(rl_result.reg, rl_src1.reg);
1703 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1704 }
1705 StoreValueWide(rl_dest, rl_result);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001706 return;
1707 }
1708
Andreas Gampec76c6142014-08-04 16:30:03 -07001709 // Not multiplying by a constant. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001710 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1711 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1712 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1713
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001714 // Prepare for explicit register usage.
1715 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001716 rl_src1 = UpdateLocWideTyped(rl_src1);
1717 rl_src2 = UpdateLocWideTyped(rl_src2);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001718
1719 // At this point, the VRs are in their home locations.
1720 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1721 bool src2_in_reg = rl_src2.location == kLocPhysReg;
1722
1723 // ECX <- 1H
1724 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001725 NewLIR2(kX86Mov32RR, rs_r1.GetReg(), rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001726 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001727 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1, k32,
1728 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001729 }
1730
Mark Mendellde99bba2014-02-14 12:15:02 -08001731 if (is_square) {
1732 // Take advantage of the fact that the values are the same.
1733 // ECX <- ECX * 2L (1H * 2L)
1734 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001735 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001736 } else {
1737 int displacement = SRegOffset(rl_src2.s_reg_low);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001738 LIR* m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001739 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001740 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1741 true /* is_load */, true /* is_64bit */);
1742 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001743
Mark Mendellde99bba2014-02-14 12:15:02 -08001744 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001745 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001746 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001747 // EAX <- 2H
1748 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001749 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001750 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001751 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0, k32,
1752 kNotVolatile);
Mark Mendellde99bba2014-02-14 12:15:02 -08001753 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001754
Mark Mendellde99bba2014-02-14 12:15:02 -08001755 // EAX <- EAX * 1L (2H * 1L)
1756 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001757 NewLIR2(kX86Imul32RR, rs_r0.GetReg(), rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001758 } else {
1759 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001760 LIR *m = NewLIR3(kX86Imul32RM, rs_r0.GetReg(), rs_rX86_SP.GetReg(),
1761 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001762 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1763 true /* is_load */, true /* is_64bit */);
1764 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001765
Mark Mendellde99bba2014-02-14 12:15:02 -08001766 // ECX <- ECX * 2L (1H * 2L)
1767 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001768 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001769 } else {
1770 int displacement = SRegOffset(rl_src2.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001771 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
1772 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001773 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1774 true /* is_load */, true /* is_64bit */);
1775 }
1776
1777 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001778 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001779 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001780
1781 // EAX <- 2L
1782 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001783 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001784 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001785 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0, k32,
1786 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001787 }
1788
1789 // EDX:EAX <- 2L * 1L (double precision)
1790 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001791 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001792 } else {
1793 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001794 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001795 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1796 true /* is_load */, true /* is_64bit */);
1797 }
1798
1799 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001800 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001801
1802 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001803 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
buzbee2700f7e2014-03-07 09:46:20 -08001804 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001805 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001806}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001807
1808void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1809 Instruction::Code op) {
1810 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1811 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1812 if (rl_src.location == kLocPhysReg) {
1813 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001814 // But we must ensure that rl_src is in pair
Elena Sayapinadd644502014-07-01 18:39:52 +07001815 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001816 NewLIR2(x86op, rl_dest.reg.GetReg(), rl_src.reg.GetReg());
1817 } else {
1818 rl_src = LoadValueWide(rl_src, kCoreReg);
1819 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
1820 // The registers are the same, so we would clobber it before the use.
1821 RegStorage temp_reg = AllocTemp();
1822 OpRegCopy(temp_reg, rl_dest.reg);
1823 rl_src.reg.SetHighReg(temp_reg.GetReg());
1824 }
1825 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001826
Chao-ying Fua0147762014-06-06 18:38:49 -07001827 x86op = GetOpcode(op, rl_dest, rl_src, true);
1828 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
Chao-ying Fua0147762014-06-06 18:38:49 -07001829 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001830 return;
1831 }
1832
1833 // RHS is in memory.
1834 DCHECK((rl_src.location == kLocDalvikFrame) ||
1835 (rl_src.location == kLocCompilerTemp));
Chao-ying Fua77ee512014-07-01 17:43:41 -07001836 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001837 int displacement = SRegOffset(rl_src.s_reg_low);
1838
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001839 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Andreas Gampeccc60262014-07-04 18:02:38 -07001840 LIR *lir = NewLIR3(x86op, cu_->target64 ? rl_dest.reg.GetReg() : rl_dest.reg.GetLowReg(),
1841 r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001842 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1843 true /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001844 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001845 x86op = GetOpcode(op, rl_dest, rl_src, true);
1846 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001847 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1848 true /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001849 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001850}
1851
Mark Mendelle02d48f2014-01-15 11:19:23 -08001852void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001853 rl_dest = UpdateLocWideTyped(rl_dest);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001854 if (rl_dest.location == kLocPhysReg) {
1855 // Ensure we are in a register pair
1856 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1857
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001858 rl_src = UpdateLocWideTyped(rl_src);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001859 GenLongRegOrMemOp(rl_result, rl_src, op);
1860 StoreFinalValueWide(rl_dest, rl_result);
1861 return;
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001862 } else if (!cu_->target64 && Intersects(rl_src, rl_dest)) {
1863 // Handle the case when src and dest are intersect.
1864 rl_src = LoadValueWide(rl_src, kCoreReg);
1865 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001866 rl_src = UpdateLocWideTyped(rl_src);
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001867 GenLongRegOrMemOp(rl_result, rl_src, op);
1868 StoreFinalValueWide(rl_dest, rl_result);
1869 return;
Mark Mendelle02d48f2014-01-15 11:19:23 -08001870 }
1871
1872 // It wasn't in registers, so it better be in memory.
1873 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1874 (rl_dest.location == kLocCompilerTemp));
1875 rl_src = LoadValueWide(rl_src, kCoreReg);
1876
1877 // Operate directly into memory.
1878 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
Chao-ying Fua77ee512014-07-01 17:43:41 -07001879 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001880 int displacement = SRegOffset(rl_dest.s_reg_low);
1881
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001882 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07001883 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET,
Elena Sayapinadd644502014-07-01 18:39:52 +07001884 cu_->target64 ? rl_src.reg.GetReg() : rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001885 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001886 true /* is_load */, true /* is64bit */);
1887 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001888 false /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001889 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001890 x86op = GetOpcode(op, rl_dest, rl_src, true);
1891 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001892 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1893 true /* is_load */, true /* is64bit */);
1894 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1895 false /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001896 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001897}
1898
Mark Mendelle02d48f2014-01-15 11:19:23 -08001899void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
1900 RegLocation rl_src2, Instruction::Code op,
1901 bool is_commutative) {
1902 // Is this really a 2 operand operation?
1903 switch (op) {
1904 case Instruction::ADD_LONG_2ADDR:
1905 case Instruction::SUB_LONG_2ADDR:
1906 case Instruction::AND_LONG_2ADDR:
1907 case Instruction::OR_LONG_2ADDR:
1908 case Instruction::XOR_LONG_2ADDR:
Mark Mendelle87f9b52014-04-30 14:13:18 -04001909 if (GenerateTwoOperandInstructions()) {
1910 GenLongArith(rl_dest, rl_src2, op);
1911 return;
1912 }
1913 break;
1914
Mark Mendelle02d48f2014-01-15 11:19:23 -08001915 default:
1916 break;
1917 }
1918
1919 if (rl_dest.location == kLocPhysReg) {
1920 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
1921
1922 // We are about to clobber the LHS, so it needs to be a temp.
1923 rl_result = ForceTempWide(rl_result);
1924
1925 // Perform the operation using the RHS.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001926 rl_src2 = UpdateLocWideTyped(rl_src2);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001927 GenLongRegOrMemOp(rl_result, rl_src2, op);
1928
1929 // And now record that the result is in the temp.
1930 StoreFinalValueWide(rl_dest, rl_result);
1931 return;
1932 }
1933
1934 // It wasn't in registers, so it better be in memory.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001935 DCHECK((rl_dest.location == kLocDalvikFrame) || (rl_dest.location == kLocCompilerTemp));
1936 rl_src1 = UpdateLocWideTyped(rl_src1);
1937 rl_src2 = UpdateLocWideTyped(rl_src2);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001938
1939 // Get one of the source operands into temporary register.
1940 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +07001941 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001942 if (IsTemp(rl_src1.reg)) {
1943 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1944 } else if (is_commutative) {
1945 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1946 // We need at least one of them to be a temporary.
1947 if (!IsTemp(rl_src2.reg)) {
1948 rl_src1 = ForceTempWide(rl_src1);
1949 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1950 } else {
1951 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1952 StoreFinalValueWide(rl_dest, rl_src2);
1953 return;
1954 }
1955 } else {
1956 // Need LHS to be the temp.
Mark Mendelle02d48f2014-01-15 11:19:23 -08001957 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07001958 GenLongRegOrMemOp(rl_src1, rl_src2, op);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001959 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001960 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07001961 if (IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
1962 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1963 } else if (is_commutative) {
1964 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1965 // We need at least one of them to be a temporary.
1966 if (!(IsTemp(rl_src2.reg.GetLow()) && IsTemp(rl_src2.reg.GetHigh()))) {
1967 rl_src1 = ForceTempWide(rl_src1);
1968 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1969 } else {
1970 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1971 StoreFinalValueWide(rl_dest, rl_src2);
1972 return;
1973 }
1974 } else {
1975 // Need LHS to be the temp.
1976 rl_src1 = ForceTempWide(rl_src1);
1977 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1978 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001979 }
1980
1981 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001982}
1983
Serban Constantinescued65c5e2014-05-22 15:10:18 +01001984void X86Mir2Lir::GenNotLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001985 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001986 rl_src = LoadValueWide(rl_src, kCoreReg);
1987 RegLocation rl_result;
1988 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1989 OpRegCopy(rl_result.reg, rl_src.reg);
1990 OpReg(kOpNot, rl_result.reg);
1991 StoreValueWide(rl_dest, rl_result);
1992 } else {
1993 LOG(FATAL) << "Unexpected use GenNotLong()";
1994 }
Serban Constantinescued65c5e2014-05-22 15:10:18 +01001995}
1996
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07001997void X86Mir2Lir::GenDivRemLongLit(RegLocation rl_dest, RegLocation rl_src,
1998 int64_t imm, bool is_div) {
1999 if (imm == 0) {
2000 GenDivZeroException();
2001 } else if (imm == 1) {
2002 if (is_div) {
2003 // x / 1 == x.
2004 StoreValueWide(rl_dest, rl_src);
2005 } else {
2006 // x % 1 == 0.
2007 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2008 LoadConstantWide(rl_result.reg, 0);
2009 StoreValueWide(rl_dest, rl_result);
2010 }
2011 } else if (imm == -1) { // handle 0x8000000000000000 / -1 special case.
2012 if (is_div) {
2013 rl_src = LoadValueWide(rl_src, kCoreReg);
2014 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2015 RegStorage rs_temp = AllocTempWide();
2016
2017 OpRegCopy(rl_result.reg, rl_src.reg);
2018 LoadConstantWide(rs_temp, 0x8000000000000000);
2019
2020 // If x == MIN_LONG, return MIN_LONG.
2021 OpRegReg(kOpCmp, rl_src.reg, rs_temp);
2022 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
2023
2024 // For x != MIN_LONG, x / -1 == -x.
2025 OpReg(kOpNeg, rl_result.reg);
2026
2027 minint_branch->target = NewLIR0(kPseudoTargetLabel);
2028 FreeTemp(rs_temp);
2029 StoreValueWide(rl_dest, rl_result);
2030 } else {
2031 // x % -1 == 0.
2032 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2033 LoadConstantWide(rl_result.reg, 0);
2034 StoreValueWide(rl_dest, rl_result);
2035 }
2036 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
2037 // Division using shifting.
2038 rl_src = LoadValueWide(rl_src, kCoreReg);
2039 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2040 if (IsSameReg(rl_result.reg, rl_src.reg)) {
2041 RegStorage rs_temp = AllocTypedTempWide(false, kCoreReg);
2042 rl_result.reg.SetReg(rs_temp.GetReg());
2043 }
2044 LoadConstantWide(rl_result.reg, std::abs(imm) - 1);
2045 OpRegReg(kOpAdd, rl_result.reg, rl_src.reg);
2046 NewLIR2(kX86Test64RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
2047 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
2048 int shift_amount = LowestSetBit(imm);
2049 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
2050 if (imm < 0) {
2051 OpReg(kOpNeg, rl_result.reg);
2052 }
2053 StoreValueWide(rl_dest, rl_result);
2054 } else {
2055 CHECK(imm <= -2 || imm >= 2);
2056
2057 FlushReg(rs_r0q);
2058 Clobber(rs_r0q);
2059 LockTemp(rs_r0q);
2060 FlushReg(rs_r2q);
2061 Clobber(rs_r2q);
2062 LockTemp(rs_r2q);
2063
Mark Mendell3a91f442014-09-02 12:44:24 -04002064 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
2065 is_div ? rs_r2q : rs_r0q, INVALID_SREG, INVALID_SREG};
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002066
2067 // Use H.S.Warren's Hacker's Delight Chapter 10 and
2068 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
2069 int64_t magic;
2070 int shift;
2071 CalculateMagicAndShift(imm, magic, shift, true /* is_long */);
2072
2073 /*
2074 * For imm >= 2,
2075 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
2076 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
2077 * For imm <= -2,
2078 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
2079 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
2080 * We implement this algorithm in the following way:
2081 * 1. multiply magic number m and numerator n, get the higher 64bit result in RDX
2082 * 2. if imm > 0 and magic < 0, add numerator to RDX
2083 * if imm < 0 and magic > 0, sub numerator from RDX
2084 * 3. if S !=0, SAR S bits for RDX
2085 * 4. add 1 to RDX if RDX < 0
2086 * 5. Thus, RDX is the quotient
2087 */
2088
Mark Mendell3a91f442014-09-02 12:44:24 -04002089 // RAX = magic.
2090 LoadConstantWide(rs_r0q, magic);
2091
2092 // Multiply by numerator.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002093 RegStorage numerator_reg;
2094 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
2095 // We will need the value later.
2096 rl_src = LoadValueWide(rl_src, kCoreReg);
2097 numerator_reg = rl_src.reg;
Mark Mendell3a91f442014-09-02 12:44:24 -04002098
2099 // RDX:RAX = magic * numerator.
2100 NewLIR1(kX86Imul64DaR, numerator_reg.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002101 } else {
Mark Mendell3a91f442014-09-02 12:44:24 -04002102 // Only need this once. Multiply directly from the value.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002103 rl_src = UpdateLocWideTyped(rl_src);
Mark Mendell3a91f442014-09-02 12:44:24 -04002104 if (rl_src.location != kLocPhysReg) {
2105 // Okay, we can do this from memory.
2106 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2107 int displacement = SRegOffset(rl_src.s_reg_low);
2108 // RDX:RAX = magic * numerator.
2109 LIR *m = NewLIR2(kX86Imul64DaM, rs_rX86_SP.GetReg(), displacement);
2110 AnnotateDalvikRegAccess(m, displacement >> 2,
2111 true /* is_load */, true /* is_64bit */);
2112 } else {
2113 // RDX:RAX = magic * numerator.
2114 NewLIR1(kX86Imul64DaR, rl_src.reg.GetReg());
2115 }
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002116 }
2117
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002118 if (imm > 0 && magic < 0) {
2119 // Add numerator to RDX.
2120 DCHECK(numerator_reg.Valid());
2121 OpRegReg(kOpAdd, rs_r2q, numerator_reg);
2122 } else if (imm < 0 && magic > 0) {
2123 DCHECK(numerator_reg.Valid());
2124 OpRegReg(kOpSub, rs_r2q, numerator_reg);
2125 }
2126
2127 // Do we need the shift?
2128 if (shift != 0) {
2129 // Shift RDX by 'shift' bits.
2130 OpRegImm(kOpAsr, rs_r2q, shift);
2131 }
2132
2133 // Move RDX to RAX.
2134 OpRegCopyWide(rs_r0q, rs_r2q);
2135
2136 // Move sign bit to bit 0, zeroing the rest.
2137 OpRegImm(kOpLsr, rs_r2q, 63);
2138
2139 // RDX = RDX + RAX.
2140 OpRegReg(kOpAdd, rs_r2q, rs_r0q);
2141
2142 // Quotient is in RDX.
2143 if (!is_div) {
2144 // We need to compute the remainder.
2145 // Remainder is divisor - (quotient * imm).
2146 DCHECK(numerator_reg.Valid());
2147 OpRegCopyWide(rs_r0q, numerator_reg);
2148
2149 // Imul doesn't support 64-bit imms.
2150 if (imm > std::numeric_limits<int32_t>::max() ||
2151 imm < std::numeric_limits<int32_t>::min()) {
2152 RegStorage rs_temp = AllocTempWide();
2153 LoadConstantWide(rs_temp, imm);
2154
2155 // RAX = numerator * imm.
2156 NewLIR2(kX86Imul64RR, rs_r2q.GetReg(), rs_temp.GetReg());
2157
2158 FreeTemp(rs_temp);
2159 } else {
2160 // RAX = numerator * imm.
2161 int short_imm = static_cast<int>(imm);
2162 NewLIR3(kX86Imul64RRI, rs_r2q.GetReg(), rs_r2q.GetReg(), short_imm);
2163 }
2164
Mark Mendell3a91f442014-09-02 12:44:24 -04002165 // RAX -= RDX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002166 OpRegReg(kOpSub, rs_r0q, rs_r2q);
2167
Mark Mendell3a91f442014-09-02 12:44:24 -04002168 // Result in RAX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002169 } else {
Mark Mendell3a91f442014-09-02 12:44:24 -04002170 // Result in RDX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002171 }
2172 StoreValueWide(rl_dest, rl_result);
2173 FreeTemp(rs_r0q);
2174 FreeTemp(rs_r2q);
2175 }
2176}
2177
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002178void X86Mir2Lir::GenDivRemLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002179 RegLocation rl_src2, bool is_div, int flags) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002180 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002181 LOG(FATAL) << "Unexpected use GenDivRemLong()";
2182 return;
2183 }
2184
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002185 if (rl_src2.is_const) {
2186 DCHECK(rl_src2.wide);
2187 int64_t imm = mir_graph_->ConstantValueWide(rl_src2);
2188 GenDivRemLongLit(rl_dest, rl_src1, imm, is_div);
2189 return;
2190 }
2191
Chao-ying Fua0147762014-06-06 18:38:49 -07002192 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002193 // Prepare for explicit register usage.
2194 ExplicitTempRegisterLock(this, 4, &rs_r0q, &rs_r1q, &rs_r2q, &rs_r6q);
Chao-ying Fua0147762014-06-06 18:38:49 -07002195
2196 // Load LHS into RAX.
2197 LoadValueDirectWideFixed(rl_src1, rs_r0q);
2198
2199 // Load RHS into RCX.
2200 LoadValueDirectWideFixed(rl_src2, rs_r1q);
2201
2202 // Copy LHS sign bit into RDX.
2203 NewLIR0(kx86Cqo64Da);
2204
2205 // Handle division by zero case.
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002206 if ((flags & MIR_IGNORE_DIV_ZERO_CHECK) == 0) {
2207 GenDivZeroCheckWide(rs_r1q);
2208 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002209
2210 // Have to catch 0x8000000000000000/-1 case, or we will get an exception!
2211 NewLIR2(kX86Cmp64RI8, rs_r1q.GetReg(), -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002212 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002213
2214 // RHS is -1.
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002215 LoadConstantWide(rs_r6q, 0x8000000000000000);
2216 NewLIR2(kX86Cmp64RR, rs_r0q.GetReg(), rs_r6q.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002217 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002218
2219 // In 0x8000000000000000/-1 case.
2220 if (!is_div) {
2221 // For DIV, RAX is already right. For REM, we need RDX 0.
2222 NewLIR2(kX86Xor64RR, rs_r2q.GetReg(), rs_r2q.GetReg());
2223 }
2224 LIR* done = NewLIR1(kX86Jmp8, 0);
2225
2226 // Expected case.
2227 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
2228 minint_branch->target = minus_one_branch->target;
2229 NewLIR1(kX86Idivmod64DaR, rs_r1q.GetReg());
2230 done->target = NewLIR0(kPseudoTargetLabel);
2231
2232 // Result is in RAX for div and RDX for rem.
2233 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, rs_r0q, INVALID_SREG, INVALID_SREG};
2234 if (!is_div) {
2235 rl_result.reg.SetReg(r2q);
2236 }
2237
2238 StoreValueWide(rl_dest, rl_result);
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002239}
2240
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002241void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002242 rl_src = LoadValueWide(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002243 RegLocation rl_result;
Elena Sayapinadd644502014-07-01 18:39:52 +07002244 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002245 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2246 OpRegReg(kOpNeg, rl_result.reg, rl_src.reg);
2247 } else {
2248 rl_result = ForceTempWide(rl_src);
2249 if (((rl_dest.location == kLocPhysReg) && (rl_src.location == kLocPhysReg)) &&
2250 ((rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()))) {
2251 // The registers are the same, so we would clobber it before the use.
2252 RegStorage temp_reg = AllocTemp();
2253 OpRegCopy(temp_reg, rl_result.reg);
2254 rl_result.reg.SetHighReg(temp_reg.GetReg());
2255 }
2256 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
2257 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
2258 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Mark Mendelle02d48f2014-01-15 11:19:23 -08002259 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002260 StoreValueWide(rl_dest, rl_result);
2261}
2262
buzbee091cc402014-03-31 10:14:40 -07002263void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<4> thread_offset) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07002264 DCHECK_EQ(kX86, cu_->instruction_set);
2265 X86OpCode opcode = kX86Bkpt;
2266 switch (op) {
2267 case kOpCmp: opcode = kX86Cmp32RT; break;
2268 case kOpMov: opcode = kX86Mov32RT; break;
2269 default:
2270 LOG(FATAL) << "Bad opcode: " << op;
2271 break;
2272 }
2273 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
2274}
2275
2276void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<8> thread_offset) {
2277 DCHECK_EQ(kX86_64, cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002278 X86OpCode opcode = kX86Bkpt;
Elena Sayapinadd644502014-07-01 18:39:52 +07002279 if (cu_->target64 && r_dest.Is64BitSolo()) {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +07002280 switch (op) {
2281 case kOpCmp: opcode = kX86Cmp64RT; break;
2282 case kOpMov: opcode = kX86Mov64RT; break;
2283 default:
2284 LOG(FATAL) << "Bad opcode(OpRegThreadMem 64): " << op;
2285 break;
2286 }
2287 } else {
2288 switch (op) {
2289 case kOpCmp: opcode = kX86Cmp32RT; break;
2290 case kOpMov: opcode = kX86Mov32RT; break;
2291 default:
2292 LOG(FATAL) << "Bad opcode: " << op;
2293 break;
2294 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002295 }
buzbee091cc402014-03-31 10:14:40 -07002296 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07002297}
2298
2299/*
2300 * Generate array load
2301 */
2302void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002303 RegLocation rl_index, RegLocation rl_dest, int scale) {
buzbee091cc402014-03-31 10:14:40 -07002304 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002305 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07002306 RegLocation rl_result;
buzbeea0cd2d72014-06-01 09:33:49 -07002307 rl_array = LoadValue(rl_array, kRefReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002308
Mark Mendell343adb52013-12-18 06:02:17 -08002309 int data_offset;
buzbee695d13a2014-04-19 13:32:20 -07002310 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002311 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2312 } else {
2313 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2314 }
2315
Mark Mendell343adb52013-12-18 06:02:17 -08002316 bool constant_index = rl_index.is_const;
2317 int32_t constant_index_value = 0;
2318 if (!constant_index) {
2319 rl_index = LoadValue(rl_index, kCoreReg);
2320 } else {
2321 constant_index_value = mir_graph_->ConstantValue(rl_index);
2322 // If index is constant, just fold it into the data offset
2323 data_offset += constant_index_value << scale;
2324 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002325 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002326 }
2327
Brian Carlstrom7940e442013-07-12 13:46:57 -07002328 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002329 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002330
2331 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002332 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002333 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002334 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002335 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002336 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002337 }
Mark Mendell343adb52013-12-18 06:02:17 -08002338 rl_result = EvalLoc(rl_dest, reg_class, true);
Vladimir Marko3bf7c602014-05-07 14:55:43 +01002339 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg, size);
buzbee695d13a2014-04-19 13:32:20 -07002340 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002341 StoreValueWide(rl_dest, rl_result);
2342 } else {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002343 StoreValue(rl_dest, rl_result);
2344 }
2345}
2346
2347/*
2348 * Generate array store
2349 *
2350 */
2351void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002352 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
buzbee091cc402014-03-31 10:14:40 -07002353 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002354 int len_offset = mirror::Array::LengthOffset().Int32Value();
2355 int data_offset;
2356
buzbee695d13a2014-04-19 13:32:20 -07002357 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002358 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2359 } else {
2360 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2361 }
2362
buzbeea0cd2d72014-06-01 09:33:49 -07002363 rl_array = LoadValue(rl_array, kRefReg);
Mark Mendell343adb52013-12-18 06:02:17 -08002364 bool constant_index = rl_index.is_const;
2365 int32_t constant_index_value = 0;
2366 if (!constant_index) {
2367 rl_index = LoadValue(rl_index, kCoreReg);
2368 } else {
2369 // If index is constant, just fold it into the data offset
2370 constant_index_value = mir_graph_->ConstantValue(rl_index);
2371 data_offset += constant_index_value << scale;
2372 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002373 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002374 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002375
2376 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002377 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002378
2379 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002380 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002381 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002382 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002383 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002384 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002385 }
buzbee695d13a2014-04-19 13:32:20 -07002386 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002387 rl_src = LoadValueWide(rl_src, reg_class);
2388 } else {
2389 rl_src = LoadValue(rl_src, reg_class);
2390 }
2391 // If the src reg can't be byte accessed, move it to a temp first.
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002392 if ((size == kSignedByte || size == kUnsignedByte) && !IsByteRegister(rl_src.reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002393 RegStorage temp = AllocTemp();
2394 OpRegCopy(temp, rl_src.reg);
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002395 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002396 } else {
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002397 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002398 }
Ian Rogersa9a82542013-10-04 11:17:26 -07002399 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07002400 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08002401 if (!constant_index) {
buzbee091cc402014-03-31 10:14:40 -07002402 FreeTemp(rl_index.reg);
Mark Mendell343adb52013-12-18 06:02:17 -08002403 }
buzbee2700f7e2014-03-07 09:46:20 -08002404 MarkGCCard(rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002405 }
2406}
2407
Mark Mendell4708dcd2014-01-22 09:05:18 -08002408RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002409 RegLocation rl_src, int shift_amount, int flags) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002410 UNUSED(flags);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002411 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Elena Sayapinadd644502014-07-01 18:39:52 +07002412 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002413 OpKind op = static_cast<OpKind>(0); /* Make gcc happy */
2414 switch (opcode) {
2415 case Instruction::SHL_LONG:
2416 case Instruction::SHL_LONG_2ADDR:
2417 op = kOpLsl;
2418 break;
2419 case Instruction::SHR_LONG:
2420 case Instruction::SHR_LONG_2ADDR:
2421 op = kOpAsr;
2422 break;
2423 case Instruction::USHR_LONG:
2424 case Instruction::USHR_LONG_2ADDR:
2425 op = kOpLsr;
2426 break;
2427 default:
2428 LOG(FATAL) << "Unexpected case";
2429 }
2430 OpRegRegImm(op, rl_result.reg, rl_src.reg, shift_amount);
2431 } else {
2432 switch (opcode) {
2433 case Instruction::SHL_LONG:
2434 case Instruction::SHL_LONG_2ADDR:
2435 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
2436 if (shift_amount == 32) {
2437 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2438 LoadConstant(rl_result.reg.GetLow(), 0);
2439 } else if (shift_amount > 31) {
2440 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2441 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
2442 LoadConstant(rl_result.reg.GetLow(), 0);
2443 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002444 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002445 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2446 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(),
2447 shift_amount);
2448 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
2449 }
2450 break;
2451 case Instruction::SHR_LONG:
2452 case Instruction::SHR_LONG_2ADDR:
2453 if (shift_amount == 32) {
2454 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2455 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2456 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2457 } else if (shift_amount > 31) {
2458 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2459 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2460 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2461 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2462 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002463 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002464 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2465 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2466 shift_amount);
2467 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
2468 }
2469 break;
2470 case Instruction::USHR_LONG:
2471 case Instruction::USHR_LONG_2ADDR:
2472 if (shift_amount == 32) {
2473 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2474 LoadConstant(rl_result.reg.GetHigh(), 0);
2475 } else if (shift_amount > 31) {
2476 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2477 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2478 LoadConstant(rl_result.reg.GetHigh(), 0);
2479 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002480 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002481 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2482 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2483 shift_amount);
2484 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
2485 }
2486 break;
2487 default:
2488 LOG(FATAL) << "Unexpected case";
2489 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08002490 }
2491 return rl_result;
2492}
2493
Brian Carlstrom7940e442013-07-12 13:46:57 -07002494void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002495 RegLocation rl_src, RegLocation rl_shift, int flags) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08002496 // Per spec, we only care about low 6 bits of shift amount.
2497 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
2498 if (shift_amount == 0) {
2499 rl_src = LoadValueWide(rl_src, kCoreReg);
2500 StoreValueWide(rl_dest, rl_src);
2501 return;
2502 } else if (shift_amount == 1 &&
2503 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
2504 // Need to handle this here to avoid calling StoreValueWide twice.
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002505 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src, flags);
Mark Mendell4708dcd2014-01-22 09:05:18 -08002506 return;
2507 }
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07002508 if (PartiallyIntersects(rl_src, rl_dest)) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08002509 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
2510 return;
2511 }
2512 rl_src = LoadValueWide(rl_src, kCoreReg);
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002513 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount, flags);
Mark Mendell4708dcd2014-01-22 09:05:18 -08002514 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002515}
2516
2517void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002518 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2,
2519 int flags) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002520 bool isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002521 switch (opcode) {
2522 case Instruction::ADD_LONG:
2523 case Instruction::AND_LONG:
2524 case Instruction::OR_LONG:
2525 case Instruction::XOR_LONG:
2526 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002527 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002528 } else {
2529 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002530 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002531 }
2532 break;
2533 case Instruction::SUB_LONG:
2534 case Instruction::SUB_LONG_2ADDR:
2535 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002536 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002537 } else {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002538 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Chao-ying Fua0147762014-06-06 18:38:49 -07002539 isConstSuccess = true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002540 }
2541 break;
2542 case Instruction::ADD_LONG_2ADDR:
2543 case Instruction::OR_LONG_2ADDR:
2544 case Instruction::XOR_LONG_2ADDR:
2545 case Instruction::AND_LONG_2ADDR:
2546 if (rl_src2.is_const) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002547 if (GenerateTwoOperandInstructions()) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002548 isConstSuccess = GenLongImm(rl_dest, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002549 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07002550 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002551 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002552 } else {
2553 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002554 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002555 }
2556 break;
2557 default:
Chao-ying Fua0147762014-06-06 18:38:49 -07002558 isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002559 break;
2560 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002561
2562 if (!isConstSuccess) {
2563 // Default - bail to non-const handler.
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002564 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Chao-ying Fua0147762014-06-06 18:38:49 -07002565 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002566}
2567
2568bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
2569 switch (op) {
2570 case Instruction::AND_LONG_2ADDR:
2571 case Instruction::AND_LONG:
2572 return value == -1;
2573 case Instruction::OR_LONG:
2574 case Instruction::OR_LONG_2ADDR:
2575 case Instruction::XOR_LONG:
2576 case Instruction::XOR_LONG_2ADDR:
2577 return value == 0;
2578 default:
2579 return false;
2580 }
2581}
2582
2583X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
2584 bool is_high_op) {
2585 bool rhs_in_mem = rhs.location != kLocPhysReg;
2586 bool dest_in_mem = dest.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002587 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002588 DCHECK(!rhs_in_mem || !dest_in_mem);
2589 switch (op) {
2590 case Instruction::ADD_LONG:
2591 case Instruction::ADD_LONG_2ADDR:
2592 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002593 return is64Bit ? kX86Add64MR : is_high_op ? kX86Adc32MR : kX86Add32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002594 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002595 return is64Bit ? kX86Add64RM : is_high_op ? kX86Adc32RM : kX86Add32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002596 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002597 return is64Bit ? kX86Add64RR : is_high_op ? kX86Adc32RR : kX86Add32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002598 case Instruction::SUB_LONG:
2599 case Instruction::SUB_LONG_2ADDR:
2600 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002601 return is64Bit ? kX86Sub64MR : is_high_op ? kX86Sbb32MR : kX86Sub32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002602 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002603 return is64Bit ? kX86Sub64RM : is_high_op ? kX86Sbb32RM : kX86Sub32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002604 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002605 return is64Bit ? kX86Sub64RR : is_high_op ? kX86Sbb32RR : kX86Sub32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002606 case Instruction::AND_LONG_2ADDR:
2607 case Instruction::AND_LONG:
2608 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002609 return is64Bit ? kX86And64MR : kX86And32MR;
2610 }
2611 if (is64Bit) {
2612 return rhs_in_mem ? kX86And64RM : kX86And64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002613 }
2614 return rhs_in_mem ? kX86And32RM : kX86And32RR;
2615 case Instruction::OR_LONG:
2616 case Instruction::OR_LONG_2ADDR:
2617 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002618 return is64Bit ? kX86Or64MR : kX86Or32MR;
2619 }
2620 if (is64Bit) {
2621 return rhs_in_mem ? kX86Or64RM : kX86Or64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002622 }
2623 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
2624 case Instruction::XOR_LONG:
2625 case Instruction::XOR_LONG_2ADDR:
2626 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002627 return is64Bit ? kX86Xor64MR : kX86Xor32MR;
2628 }
2629 if (is64Bit) {
2630 return rhs_in_mem ? kX86Xor64RM : kX86Xor64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002631 }
2632 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
2633 default:
2634 LOG(FATAL) << "Unexpected opcode: " << op;
2635 return kX86Add32RR;
2636 }
2637}
2638
2639X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
2640 int32_t value) {
2641 bool in_mem = loc.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002642 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002643 bool byte_imm = IS_SIMM8(value);
buzbee091cc402014-03-31 10:14:40 -07002644 DCHECK(in_mem || !loc.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002645 switch (op) {
2646 case Instruction::ADD_LONG:
2647 case Instruction::ADD_LONG_2ADDR:
2648 if (byte_imm) {
2649 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002650 return is64Bit ? kX86Add64MI8 : is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002651 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002652 return is64Bit ? kX86Add64RI8 : is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002653 }
2654 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002655 return is64Bit ? kX86Add64MI : is_high_op ? kX86Adc32MI : kX86Add32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002656 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002657 return is64Bit ? kX86Add64RI : is_high_op ? kX86Adc32RI : kX86Add32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002658 case Instruction::SUB_LONG:
2659 case Instruction::SUB_LONG_2ADDR:
2660 if (byte_imm) {
2661 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002662 return is64Bit ? kX86Sub64MI8 : is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002663 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002664 return is64Bit ? kX86Sub64RI8 : is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002665 }
2666 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002667 return is64Bit ? kX86Sub64MI : is_high_op ? kX86Sbb32MI : kX86Sub32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002668 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002669 return is64Bit ? kX86Sub64RI : is_high_op ? kX86Sbb32RI : kX86Sub32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002670 case Instruction::AND_LONG_2ADDR:
2671 case Instruction::AND_LONG:
2672 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002673 if (is64Bit) {
2674 return in_mem ? kX86And64MI8 : kX86And64RI8;
2675 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002676 return in_mem ? kX86And32MI8 : kX86And32RI8;
2677 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002678 if (is64Bit) {
2679 return in_mem ? kX86And64MI : kX86And64RI;
2680 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002681 return in_mem ? kX86And32MI : kX86And32RI;
2682 case Instruction::OR_LONG:
2683 case Instruction::OR_LONG_2ADDR:
2684 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002685 if (is64Bit) {
2686 return in_mem ? kX86Or64MI8 : kX86Or64RI8;
2687 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002688 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
2689 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002690 if (is64Bit) {
2691 return in_mem ? kX86Or64MI : kX86Or64RI;
2692 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002693 return in_mem ? kX86Or32MI : kX86Or32RI;
2694 case Instruction::XOR_LONG:
2695 case Instruction::XOR_LONG_2ADDR:
2696 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002697 if (is64Bit) {
2698 return in_mem ? kX86Xor64MI8 : kX86Xor64RI8;
2699 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002700 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
2701 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002702 if (is64Bit) {
2703 return in_mem ? kX86Xor64MI : kX86Xor64RI;
2704 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002705 return in_mem ? kX86Xor32MI : kX86Xor32RI;
2706 default:
2707 LOG(FATAL) << "Unexpected opcode: " << op;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002708 UNREACHABLE();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002709 }
2710}
2711
Chao-ying Fua0147762014-06-06 18:38:49 -07002712bool X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002713 DCHECK(rl_src.is_const);
2714 int64_t val = mir_graph_->ConstantValueWide(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07002715
Elena Sayapinadd644502014-07-01 18:39:52 +07002716 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002717 // We can do with imm only if it fits 32 bit
2718 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2719 return false;
2720 }
2721
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002722 rl_dest = UpdateLocWideTyped(rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07002723
2724 if ((rl_dest.location == kLocDalvikFrame) ||
2725 (rl_dest.location == kLocCompilerTemp)) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002726 int r_base = rs_rX86_SP.GetReg();
Chao-ying Fua0147762014-06-06 18:38:49 -07002727 int displacement = SRegOffset(rl_dest.s_reg_low);
2728
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002729 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002730 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
2731 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val);
2732 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2733 true /* is_load */, true /* is64bit */);
2734 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2735 false /* is_load */, true /* is64bit */);
2736 return true;
2737 }
2738
2739 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2740 DCHECK_EQ(rl_result.location, kLocPhysReg);
2741 DCHECK(!rl_result.reg.IsFloat());
2742
2743 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2744 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2745
2746 StoreValueWide(rl_dest, rl_result);
2747 return true;
2748 }
2749
Mark Mendelle02d48f2014-01-15 11:19:23 -08002750 int32_t val_lo = Low32Bits(val);
2751 int32_t val_hi = High32Bits(val);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002752 rl_dest = UpdateLocWideTyped(rl_dest);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002753
2754 // Can we just do this into memory?
2755 if ((rl_dest.location == kLocDalvikFrame) ||
2756 (rl_dest.location == kLocCompilerTemp)) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002757 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002758 int displacement = SRegOffset(rl_dest.s_reg_low);
2759
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002760 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002761 if (!IsNoOp(op, val_lo)) {
2762 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002763 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002764 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002765 true /* is_load */, true /* is64bit */);
2766 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002767 false /* is_load */, true /* is64bit */);
2768 }
2769 if (!IsNoOp(op, val_hi)) {
2770 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08002771 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002772 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002773 true /* is_load */, true /* is64bit */);
2774 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002775 false /* is_load */, true /* is64bit */);
2776 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002777 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002778 }
2779
2780 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2781 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee091cc402014-03-31 10:14:40 -07002782 DCHECK(!rl_result.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002783
2784 if (!IsNoOp(op, val_lo)) {
2785 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002786 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002787 }
2788 if (!IsNoOp(op, val_hi)) {
2789 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002790 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002791 }
2792 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002793 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002794}
2795
Chao-ying Fua0147762014-06-06 18:38:49 -07002796bool X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002797 RegLocation rl_src2, Instruction::Code op) {
2798 DCHECK(rl_src2.is_const);
2799 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002800
Elena Sayapinadd644502014-07-01 18:39:52 +07002801 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002802 // We can do with imm only if it fits 32 bit
2803 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2804 return false;
2805 }
2806 if (rl_dest.location == kLocPhysReg &&
2807 rl_src1.location == kLocPhysReg && !rl_dest.reg.IsFloat()) {
2808 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002809 OpRegCopy(rl_dest.reg, rl_src1.reg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002810 NewLIR2(x86op, rl_dest.reg.GetReg(), val);
2811 StoreFinalValueWide(rl_dest, rl_dest);
2812 return true;
2813 }
2814
2815 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2816 // We need the values to be in a temporary
2817 RegLocation rl_result = ForceTempWide(rl_src1);
2818
2819 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2820 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2821
2822 StoreFinalValueWide(rl_dest, rl_result);
2823 return true;
2824 }
2825
Mark Mendelle02d48f2014-01-15 11:19:23 -08002826 int32_t val_lo = Low32Bits(val);
2827 int32_t val_hi = High32Bits(val);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002828 rl_dest = UpdateLocWideTyped(rl_dest);
2829 rl_src1 = UpdateLocWideTyped(rl_src1);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002830
2831 // Can we do this directly into the destination registers?
2832 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08002833 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
buzbee091cc402014-03-31 10:14:40 -07002834 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() && !rl_dest.reg.IsFloat()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002835 if (!IsNoOp(op, val_lo)) {
2836 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002837 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002838 }
2839 if (!IsNoOp(op, val_hi)) {
2840 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002841 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002842 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07002843
2844 StoreFinalValueWide(rl_dest, rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07002845 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002846 }
2847
2848 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2849 DCHECK_EQ(rl_src1.location, kLocPhysReg);
2850
2851 // We need the values to be in a temporary
2852 RegLocation rl_result = ForceTempWide(rl_src1);
2853 if (!IsNoOp(op, val_lo)) {
2854 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002855 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002856 }
2857 if (!IsNoOp(op, val_hi)) {
2858 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002859 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002860 }
2861
2862 StoreFinalValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002863 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07002864}
2865
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002866// For final classes there are no sub-classes to check and so we can answer the instance-of
2867// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
2868void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
2869 RegLocation rl_dest, RegLocation rl_src) {
buzbeea0cd2d72014-06-01 09:33:49 -07002870 RegLocation object = LoadValue(rl_src, kRefReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002871 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002872 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002873
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002874 // For 32-bit, SETcc only works with EAX..EDX.
Chao-ying Fua77ee512014-07-01 17:43:41 -07002875 RegStorage object_32reg = object.reg.Is64Bit() ? As32BitReg(object.reg) : object.reg;
Dmitry Petrochenko407f5c12014-07-01 01:21:38 +07002876 if (result_reg.GetRegNum() == object_32reg.GetRegNum() || !IsByteRegister(result_reg)) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002877 result_reg = AllocateByteRegister();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002878 }
2879
2880 // Assume that there is no match.
2881 LoadConstant(result_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -08002882 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, NULL);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002883
Mark Mendellade54a22014-06-09 12:49:55 -04002884 // We will use this register to compare to memory below.
2885 // References are 32 bit in memory, and 64 bit in registers (in 64 bit mode).
2886 // For this reason, force allocation of a 32 bit register to use, so that the
2887 // compare to memory will be done using a 32 bit comparision.
2888 // The LoadRefDisp(s) below will work normally, even in 64 bit mode.
2889 RegStorage check_class = AllocTemp();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002890
2891 // If Method* is already in a register, we can save a copy.
2892 RegLocation rl_method = mir_graph_->GetMethodLoc();
Andreas Gampeccc60262014-07-04 18:02:38 -07002893 int32_t offset_of_type = mirror::Array::DataOffset(
2894 sizeof(mirror::HeapReference<mirror::Class*>)).Int32Value() +
2895 (sizeof(mirror::HeapReference<mirror::Class*>) * type_idx);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002896
2897 if (rl_method.location == kLocPhysReg) {
2898 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002899 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002900 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002901 } else {
buzbee695d13a2014-04-19 13:32:20 -07002902 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002903 check_class, kNotVolatile);
2904 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002905 }
2906 } else {
2907 LoadCurrMethodDirect(check_class);
2908 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002909 LoadRefDisp(check_class, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002910 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002911 } else {
buzbee695d13a2014-04-19 13:32:20 -07002912 LoadRefDisp(check_class, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002913 check_class, kNotVolatile);
2914 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002915 }
2916 }
2917
2918 // Compare the computed class to the class in the object.
2919 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08002920 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002921
2922 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08002923 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002924
2925 LIR* target = NewLIR0(kPseudoTargetLabel);
2926 null_branchover->target = target;
2927 FreeTemp(check_class);
2928 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002929 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002930 FreeTemp(result_reg);
2931 }
2932 StoreValue(rl_dest, rl_result);
2933}
2934
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002935void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002936 RegLocation rl_lhs, RegLocation rl_rhs, int flags) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002937 OpKind op = kOpBkpt;
2938 bool is_div_rem = false;
2939 bool unary = false;
2940 bool shift_op = false;
2941 bool is_two_addr = false;
2942 RegLocation rl_result;
2943 switch (opcode) {
2944 case Instruction::NEG_INT:
2945 op = kOpNeg;
2946 unary = true;
2947 break;
2948 case Instruction::NOT_INT:
2949 op = kOpMvn;
2950 unary = true;
2951 break;
2952 case Instruction::ADD_INT_2ADDR:
2953 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002954 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002955 case Instruction::ADD_INT:
2956 op = kOpAdd;
2957 break;
2958 case Instruction::SUB_INT_2ADDR:
2959 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002960 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002961 case Instruction::SUB_INT:
2962 op = kOpSub;
2963 break;
2964 case Instruction::MUL_INT_2ADDR:
2965 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002966 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002967 case Instruction::MUL_INT:
2968 op = kOpMul;
2969 break;
2970 case Instruction::DIV_INT_2ADDR:
2971 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002972 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002973 case Instruction::DIV_INT:
2974 op = kOpDiv;
2975 is_div_rem = true;
2976 break;
2977 /* NOTE: returns in kArg1 */
2978 case Instruction::REM_INT_2ADDR:
2979 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002980 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002981 case Instruction::REM_INT:
2982 op = kOpRem;
2983 is_div_rem = true;
2984 break;
2985 case Instruction::AND_INT_2ADDR:
2986 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002987 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002988 case Instruction::AND_INT:
2989 op = kOpAnd;
2990 break;
2991 case Instruction::OR_INT_2ADDR:
2992 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002993 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002994 case Instruction::OR_INT:
2995 op = kOpOr;
2996 break;
2997 case Instruction::XOR_INT_2ADDR:
2998 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002999 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003000 case Instruction::XOR_INT:
3001 op = kOpXor;
3002 break;
3003 case Instruction::SHL_INT_2ADDR:
3004 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003005 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003006 case Instruction::SHL_INT:
3007 shift_op = true;
3008 op = kOpLsl;
3009 break;
3010 case Instruction::SHR_INT_2ADDR:
3011 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003012 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003013 case Instruction::SHR_INT:
3014 shift_op = true;
3015 op = kOpAsr;
3016 break;
3017 case Instruction::USHR_INT_2ADDR:
3018 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003019 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003020 case Instruction::USHR_INT:
3021 shift_op = true;
3022 op = kOpLsr;
3023 break;
3024 default:
3025 LOG(FATAL) << "Invalid word arith op: " << opcode;
3026 }
3027
Mark Mendelle87f9b52014-04-30 14:13:18 -04003028 // Can we convert to a two address instruction?
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003029 if (!is_two_addr &&
3030 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3031 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04003032 is_two_addr = true;
3033 }
3034
3035 if (!GenerateTwoOperandInstructions()) {
3036 is_two_addr = false;
3037 }
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003038
3039 // Get the div/rem stuff out of the way.
3040 if (is_div_rem) {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07003041 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, flags);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003042 StoreValue(rl_dest, rl_result);
3043 return;
3044 }
3045
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003046 // If we generate any memory access below, it will reference a dalvik reg.
3047 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
3048
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003049 if (unary) {
3050 rl_lhs = LoadValue(rl_lhs, kCoreReg);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003051 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003052 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003053 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003054 } else {
3055 if (shift_op) {
3056 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003057 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003058 LoadValueDirectFixed(rl_rhs, t_reg);
3059 if (is_two_addr) {
3060 // Can we do this directly into memory?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003061 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003062 if (rl_result.location != kLocPhysReg) {
3063 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08003064 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003065 FreeTemp(t_reg);
3066 return;
buzbee091cc402014-03-31 10:14:40 -07003067 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003068 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08003069 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003070 FreeTemp(t_reg);
3071 StoreFinalValue(rl_dest, rl_result);
3072 return;
3073 }
3074 }
3075 // Three address form, or we can't do directly.
3076 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3077 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003078 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003079 FreeTemp(t_reg);
3080 } else {
3081 // Multiply is 3 operand only (sort of).
3082 if (is_two_addr && op != kOpMul) {
3083 // Can we do this directly into memory?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003084 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003085 if (rl_result.location == kLocPhysReg) {
Serguei Katkov366f8ae2014-04-15 16:55:26 +07003086 // Ensure res is in a core reg
3087 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003088 // Can we do this from memory directly?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003089 rl_rhs = UpdateLocTyped(rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003090 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08003091 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003092 StoreFinalValue(rl_dest, rl_result);
3093 return;
buzbee091cc402014-03-31 10:14:40 -07003094 } else if (!rl_rhs.reg.IsFloat()) {
buzbee2700f7e2014-03-07 09:46:20 -08003095 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003096 StoreFinalValue(rl_dest, rl_result);
3097 return;
3098 }
3099 }
3100 rl_rhs = LoadValue(rl_rhs, kCoreReg);
Serguei Katkovd293fb42014-05-19 15:45:42 +07003101 // It might happen rl_rhs and rl_dest are the same VR
3102 // in this case rl_dest is in reg after LoadValue while
3103 // rl_result is not updated yet, so do this
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003104 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003105 if (rl_result.location != kLocPhysReg) {
3106 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00003107 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003108 return;
buzbee091cc402014-03-31 10:14:40 -07003109 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003110 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08003111 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003112 StoreFinalValue(rl_dest, rl_result);
3113 return;
3114 } else {
3115 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3116 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003117 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003118 }
3119 } else {
3120 // Try to use reg/memory instructions.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003121 rl_lhs = UpdateLocTyped(rl_lhs);
3122 rl_rhs = UpdateLocTyped(rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003123 // We can't optimize with FP registers.
3124 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
3125 // Something is difficult, so fall back to the standard case.
3126 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3127 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3128 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003129 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003130 } else {
3131 // We can optimize by moving to result and using memory operands.
3132 if (rl_rhs.location != kLocPhysReg) {
3133 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07003134 // We should be careful with order here
3135 // If rl_dest and rl_lhs points to the same VR we should load first
3136 // If the are different we should find a register first for dest
Chao-ying Fua0147762014-06-06 18:38:49 -07003137 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3138 mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
Serguei Katkov66da1362014-03-14 13:33:33 +07003139 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3140 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendelle87f9b52014-04-30 14:13:18 -04003141 // No-op if these are the same.
3142 OpRegCopy(rl_result.reg, rl_lhs.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003143 } else {
3144 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003145 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003146 }
buzbee2700f7e2014-03-07 09:46:20 -08003147 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003148 } else if (rl_lhs.location != kLocPhysReg) {
3149 // RHS is in a register; LHS is in memory.
3150 if (op != kOpSub) {
3151 // Force RHS into result and operate on memory.
3152 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003153 OpRegCopy(rl_result.reg, rl_rhs.reg);
3154 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003155 } else {
3156 // Subtraction isn't commutative.
3157 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3158 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3159 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003160 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003161 }
3162 } else {
3163 // Both are in registers.
3164 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3165 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3166 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003167 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003168 }
3169 }
3170 }
3171 }
3172 }
3173 StoreValue(rl_dest, rl_result);
3174}
3175
3176bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
3177 // If we have non-core registers, then we can't do good things.
buzbee091cc402014-03-31 10:14:40 -07003178 if (rl_lhs.location == kLocPhysReg && rl_lhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003179 return false;
3180 }
buzbee091cc402014-03-31 10:14:40 -07003181 if (rl_rhs.location == kLocPhysReg && rl_rhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003182 return false;
3183 }
3184
3185 // Everything will be fine :-).
3186 return true;
3187}
Chao-ying Fua0147762014-06-06 18:38:49 -07003188
3189void X86Mir2Lir::GenIntToLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003190 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07003191 Mir2Lir::GenIntToLong(rl_dest, rl_src);
3192 return;
3193 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003194 rl_src = UpdateLocTyped(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07003195 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
3196 if (rl_src.location == kLocPhysReg) {
3197 NewLIR2(kX86MovsxdRR, rl_result.reg.GetReg(), rl_src.reg.GetReg());
3198 } else {
3199 int displacement = SRegOffset(rl_src.s_reg_low);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003200 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003201 LIR *m = NewLIR3(kX86MovsxdRM, rl_result.reg.GetReg(), rs_rX86_SP.GetReg(),
3202 displacement + LOWORD_OFFSET);
3203 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
3204 true /* is_load */, true /* is_64bit */);
3205 }
3206 StoreValueWide(rl_dest, rl_result);
3207}
3208
3209void X86Mir2Lir::GenShiftOpLong(Instruction::Code opcode, RegLocation rl_dest,
3210 RegLocation rl_src1, RegLocation rl_shift) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003211 if (!cu_->target64) {
Yixin Shouf40f8902014-08-14 14:10:32 -04003212 // Long shift operations in 32-bit. Use shld or shrd to create a 32-bit register filled from
3213 // the other half, shift the other half, if the shift amount is less than 32 we're done,
3214 // otherwise move one register to the other and place zero or sign bits in the other.
3215 LIR* branch;
3216 FlushAllRegs();
3217 LockCallTemps();
3218 LoadValueDirectFixed(rl_shift, rs_rCX);
3219 RegStorage r_tmp = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
3220 LoadValueDirectWideFixed(rl_src1, r_tmp);
3221 switch (opcode) {
3222 case Instruction::SHL_LONG:
3223 case Instruction::SHL_LONG_2ADDR:
3224 NewLIR3(kX86Shld32RRC, r_tmp.GetHighReg(), r_tmp.GetLowReg(), rs_rCX.GetReg());
3225 NewLIR2(kX86Sal32RC, r_tmp.GetLowReg(), rs_rCX.GetReg());
3226 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3227 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3228 OpRegCopy(r_tmp.GetHigh(), r_tmp.GetLow());
3229 LoadConstant(r_tmp.GetLow(), 0);
3230 branch->target = NewLIR0(kPseudoTargetLabel);
3231 break;
3232 case Instruction::SHR_LONG:
3233 case Instruction::SHR_LONG_2ADDR:
3234 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(), rs_rCX.GetReg());
3235 NewLIR2(kX86Sar32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3236 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3237 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3238 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3239 NewLIR2(kX86Sar32RI, r_tmp.GetHighReg(), 31);
3240 branch->target = NewLIR0(kPseudoTargetLabel);
3241 break;
3242 case Instruction::USHR_LONG:
3243 case Instruction::USHR_LONG_2ADDR:
3244 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(),
3245 rs_rCX.GetReg());
3246 NewLIR2(kX86Shr32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3247 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3248 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3249 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3250 LoadConstant(r_tmp.GetHigh(), 0);
3251 branch->target = NewLIR0(kPseudoTargetLabel);
3252 break;
3253 default:
3254 LOG(FATAL) << "Unexpected case: " << opcode;
3255 return;
3256 }
3257 RegLocation rl_result = LocCReturnWide();
3258 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07003259 return;
3260 }
3261
3262 bool is_two_addr = false;
3263 OpKind op = kOpBkpt;
3264 RegLocation rl_result;
3265
3266 switch (opcode) {
3267 case Instruction::SHL_LONG_2ADDR:
3268 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003269 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003270 case Instruction::SHL_LONG:
3271 op = kOpLsl;
3272 break;
3273 case Instruction::SHR_LONG_2ADDR:
3274 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003275 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003276 case Instruction::SHR_LONG:
3277 op = kOpAsr;
3278 break;
3279 case Instruction::USHR_LONG_2ADDR:
3280 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003281 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003282 case Instruction::USHR_LONG:
3283 op = kOpLsr;
3284 break;
3285 default:
3286 op = kOpBkpt;
3287 }
3288
3289 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003290 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Chao-ying Fua0147762014-06-06 18:38:49 -07003291 LoadValueDirectFixed(rl_shift, t_reg);
3292 if (is_two_addr) {
3293 // Can we do this directly into memory?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003294 rl_result = UpdateLocWideTyped(rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07003295 if (rl_result.location != kLocPhysReg) {
3296 // Okay, we can do this into memory
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003297 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003298 OpMemReg(op, rl_result, t_reg.GetReg());
3299 } else if (!rl_result.reg.IsFloat()) {
3300 // Can do this directly into the result register
3301 OpRegReg(op, rl_result.reg, t_reg);
3302 StoreFinalValueWide(rl_dest, rl_result);
3303 }
3304 } else {
3305 // Three address form, or we can't do directly.
3306 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
3307 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
3308 OpRegRegReg(op, rl_result.reg, rl_src1.reg, t_reg);
3309 StoreFinalValueWide(rl_dest, rl_result);
3310 }
3311
3312 FreeTemp(t_reg);
3313}
3314
Brian Carlstrom7940e442013-07-12 13:46:57 -07003315} // namespace art