blob: 85ab92bc08acc17b5fcd0945908b40c42f495b12 [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);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001127 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001128 if (!obj_in_si && !obj_in_di) {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001129 LoadWordDisp(rs_rSP, SRegOffset(rl_src_obj.s_reg_low) + push_offset, rs_obj);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001130 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1131 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1132 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1133 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1134 }
1135 if (!off_in_si && !off_in_di) {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001136 LoadWordDisp(rs_rSP, SRegOffset(rl_src_offset.s_reg_low) + push_offset, rs_off);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001137 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1138 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1139 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1140 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1141 }
1142 NewLIR4(kX86LockCmpxchg64A, rs_obj.GetReg(), rs_off.GetReg(), 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001143
Hans Boehm48f5c472014-06-27 14:50:10 -07001144 // After a store we need to insert barrier to prevent reordering with either
1145 // earlier or later memory accesses. Since
1146 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1147 // and it will be associated with the cmpxchg instruction, preventing both.
1148 GenMemBarrier(kAnyAny);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001149
1150 if (push_si) {
1151 FreeTemp(rs_rSI);
1152 UnmarkTemp(rs_rSI);
1153 NewLIR1(kX86Pop32R, rs_rSI.GetReg());
1154 }
1155 if (push_di) {
1156 FreeTemp(rs_rDI);
1157 UnmarkTemp(rs_rDI);
1158 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
1159 }
Vladimir Marko70b797d2013-12-03 15:25:24 +00001160 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +00001161 } else {
1162 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -08001163 FlushReg(rs_r0);
buzbee091cc402014-03-31 10:14:40 -07001164 Clobber(rs_r0);
buzbee2700f7e2014-03-07 09:46:20 -08001165 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001166
buzbeea0cd2d72014-06-01 09:33:49 -07001167 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
buzbee7c02e912014-10-03 13:14:17 -07001168 RegLocation rl_new_value = LoadValue(rl_src_new_value, LocToRegClass(rl_src_new_value));
Vladimir Markoc29bb612013-11-27 16:47:25 +00001169
1170 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
1171 // Mark card for object assuming new value is stored.
buzbee091cc402014-03-31 10:14:40 -07001172 FreeTemp(rs_r0); // Temporarily release EAX for MarkGCCard().
Vladimir Marko743b98c2014-11-24 19:45:41 +00001173 MarkGCCard(0, rl_new_value.reg, rl_object.reg);
buzbee091cc402014-03-31 10:14:40 -07001174 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001175 }
1176
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001177 RegLocation rl_offset;
1178 if (cu_->target64) {
1179 rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1180 } else {
1181 rl_offset = LoadValue(rl_src_offset, kCoreReg);
1182 }
buzbee2700f7e2014-03-07 09:46:20 -08001183 LoadValueDirect(rl_src_expected, rs_r0);
Andreas Gampeccc60262014-07-04 18:02:38 -07001184 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1185 rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +00001186
Hans Boehm48f5c472014-06-27 14:50:10 -07001187 // After a store we need to insert barrier to prevent reordering with either
1188 // earlier or later memory accesses. Since
1189 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1190 // and it will be associated with the cmpxchg instruction, preventing both.
1191 GenMemBarrier(kAnyAny);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001192
buzbee091cc402014-03-31 10:14:40 -07001193 FreeTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001194 }
1195
1196 // Convert ZF to boolean
1197 RegLocation rl_dest = InlineTarget(info); // boolean place for result
1198 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001199 RegStorage result_reg = rl_result.reg;
1200
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001201 // For 32-bit, SETcc only works with EAX..EDX.
1202 if (!IsByteRegister(result_reg)) {
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001203 result_reg = AllocateByteRegister();
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001204 }
1205 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondZ);
1206 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), result_reg.GetReg());
1207 if (IsTemp(result_reg)) {
1208 FreeTemp(result_reg);
1209 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001210 StoreValue(rl_dest, rl_result);
1211 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001212}
1213
Yixin Shou8c914c02014-07-28 14:17:09 -04001214void X86Mir2Lir::SwapBits(RegStorage result_reg, int shift, int32_t value) {
1215 RegStorage r_temp = AllocTemp();
1216 OpRegCopy(r_temp, result_reg);
1217 OpRegImm(kOpLsr, result_reg, shift);
1218 OpRegImm(kOpAnd, r_temp, value);
1219 OpRegImm(kOpAnd, result_reg, value);
1220 OpRegImm(kOpLsl, r_temp, shift);
1221 OpRegReg(kOpOr, result_reg, r_temp);
1222 FreeTemp(r_temp);
1223}
1224
1225void X86Mir2Lir::SwapBits64(RegStorage result_reg, int shift, int64_t value) {
1226 RegStorage r_temp = AllocTempWide();
1227 OpRegCopy(r_temp, result_reg);
1228 OpRegImm(kOpLsr, result_reg, shift);
1229 RegStorage r_value = AllocTempWide();
1230 LoadConstantWide(r_value, value);
1231 OpRegReg(kOpAnd, r_temp, r_value);
1232 OpRegReg(kOpAnd, result_reg, r_value);
1233 OpRegImm(kOpLsl, r_temp, shift);
1234 OpRegReg(kOpOr, result_reg, r_temp);
1235 FreeTemp(r_temp);
1236 FreeTemp(r_value);
1237}
1238
1239bool X86Mir2Lir::GenInlinedReverseBits(CallInfo* info, OpSize size) {
1240 RegLocation rl_src_i = info->args[0];
1241 RegLocation rl_i = (size == k64) ? LoadValueWide(rl_src_i, kCoreReg)
1242 : LoadValue(rl_src_i, kCoreReg);
1243 RegLocation rl_dest = (size == k64) ? InlineTargetWide(info) : InlineTarget(info);
1244 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1245 if (size == k64) {
1246 if (cu_->instruction_set == kX86_64) {
1247 /* Use one bswap instruction to reverse byte order first and then use 3 rounds of
1248 swapping bits to reverse bits in a long number x. Using bswap to save instructions
1249 compared to generic luni implementation which has 5 rounds of swapping bits.
1250 x = bswap x
1251 x = (x & 0x5555555555555555) << 1 | (x >> 1) & 0x5555555555555555;
1252 x = (x & 0x3333333333333333) << 2 | (x >> 2) & 0x3333333333333333;
1253 x = (x & 0x0F0F0F0F0F0F0F0F) << 4 | (x >> 4) & 0x0F0F0F0F0F0F0F0F;
1254 */
1255 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1256 SwapBits64(rl_result.reg, 1, 0x5555555555555555);
1257 SwapBits64(rl_result.reg, 2, 0x3333333333333333);
1258 SwapBits64(rl_result.reg, 4, 0x0f0f0f0f0f0f0f0f);
1259 StoreValueWide(rl_dest, rl_result);
1260 return true;
1261 }
1262 RegStorage r_i_low = rl_i.reg.GetLow();
1263 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1264 // First REV shall clobber rl_result.reg.GetLowReg(), save the value in a temp for the second
1265 // REV.
1266 r_i_low = AllocTemp();
1267 OpRegCopy(r_i_low, rl_i.reg);
1268 }
1269 OpRegReg(kOpRev, rl_result.reg.GetLow(), rl_i.reg.GetHigh());
1270 OpRegReg(kOpRev, rl_result.reg.GetHigh(), r_i_low);
1271 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1272 FreeTemp(r_i_low);
1273 }
1274 SwapBits(rl_result.reg.GetLow(), 1, 0x55555555);
1275 SwapBits(rl_result.reg.GetLow(), 2, 0x33333333);
1276 SwapBits(rl_result.reg.GetLow(), 4, 0x0f0f0f0f);
1277 SwapBits(rl_result.reg.GetHigh(), 1, 0x55555555);
1278 SwapBits(rl_result.reg.GetHigh(), 2, 0x33333333);
1279 SwapBits(rl_result.reg.GetHigh(), 4, 0x0f0f0f0f);
1280 StoreValueWide(rl_dest, rl_result);
1281 } else {
1282 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1283 SwapBits(rl_result.reg, 1, 0x55555555);
1284 SwapBits(rl_result.reg, 2, 0x33333333);
1285 SwapBits(rl_result.reg, 4, 0x0f0f0f0f);
1286 StoreValue(rl_dest, rl_result);
1287 }
1288 return true;
1289}
1290
buzbee2700f7e2014-03-07 09:46:20 -08001291LIR* X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell27dee8b2014-12-01 19:06:12 -05001292 if (cu_->target64) {
1293 // We can do this directly using RIP addressing.
1294 // We don't know the proper offset for the value, so pick one that will force
1295 // 4 byte offset. We will fix this up in the assembler later to have the right
1296 // value.
1297 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
1298 LIR* res = NewLIR3(kX86Mov32RM, reg.GetReg(), kRIPReg, 256);
1299 res->target = target;
1300 res->flags.fixup = kFixupLoad;
1301 return res;
1302 }
1303
Mark Mendell55d0eac2014-02-06 11:02:52 -08001304 CHECK(base_of_code_ != nullptr);
1305
1306 // Address the start of the method
1307 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07001308 if (rl_method.wide) {
1309 LoadValueDirectWideFixed(rl_method, reg);
1310 } else {
1311 LoadValueDirectFixed(rl_method, reg);
1312 }
Mark Mendell55d0eac2014-02-06 11:02:52 -08001313 store_method_addr_used_ = true;
1314
1315 // Load the proper value from the literal area.
1316 // We don't know the proper offset for the value, so pick one that will force
1317 // 4 byte offset. We will fix this up in the assembler later to have the right
1318 // value.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001319 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
buzbee2700f7e2014-03-07 09:46:20 -08001320 LIR *res = RawLIR(current_dalvik_offset_, kX86Mov32RM, reg.GetReg(), reg.GetReg(), 256,
1321 0, 0, target);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001322 res->target = target;
1323 res->flags.fixup = kFixupLoad;
Mark Mendell55d0eac2014-02-06 11:02:52 -08001324 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001325}
1326
buzbee2700f7e2014-03-07 09:46:20 -08001327LIR* X86Mir2Lir::OpVldm(RegStorage r_base, int count) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001328 UNUSED(r_base, count);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001329 LOG(FATAL) << "Unexpected use of OpVldm for x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001330 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001331}
1332
buzbee2700f7e2014-03-07 09:46:20 -08001333LIR* X86Mir2Lir::OpVstm(RegStorage r_base, int count) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001334 UNUSED(r_base, count);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001335 LOG(FATAL) << "Unexpected use of OpVstm for x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001336 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001337}
1338
1339void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
1340 RegLocation rl_result, int lit,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001341 int first_bit, int second_bit) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001342 UNUSED(lit);
buzbee2700f7e2014-03-07 09:46:20 -08001343 RegStorage t_reg = AllocTemp();
1344 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
1345 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001346 FreeTemp(t_reg);
1347 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -08001348 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001349 }
1350}
1351
Mingyao Yange643a172014-04-08 11:02:52 -07001352void X86Mir2Lir::GenDivZeroCheckWide(RegStorage reg) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001353 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001354 DCHECK(reg.Is64Bit());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001355
Chao-ying Fua0147762014-06-06 18:38:49 -07001356 NewLIR2(kX86Cmp64RI8, reg.GetReg(), 0);
1357 } else {
1358 DCHECK(reg.IsPair());
1359
1360 // We are not supposed to clobber the incoming storage, so allocate a temporary.
1361 RegStorage t_reg = AllocTemp();
1362 // Doing an OR is a quick way to check if both registers are zero. This will set the flags.
1363 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
1364 // The temp is no longer needed so free it at this time.
1365 FreeTemp(t_reg);
1366 }
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001367
1368 // In case of zero, throw ArithmeticException.
Mingyao Yange643a172014-04-08 11:02:52 -07001369 GenDivZeroCheck(kCondEq);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001370}
1371
Mingyao Yang80365d92014-04-18 12:10:58 -07001372void X86Mir2Lir::GenArrayBoundsCheck(RegStorage index,
1373 RegStorage array_base,
1374 int len_offset) {
1375 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1376 public:
Andreas Gampe277ccbd2014-11-03 21:36:10 -08001377 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch_in,
1378 RegStorage index_in, RegStorage array_base_in, int32_t len_offset_in)
1379 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch_in),
1380 index_(index_in), array_base_(array_base_in), len_offset_(len_offset_in) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001381 }
1382
1383 void Compile() OVERRIDE {
1384 m2l_->ResetRegPool();
1385 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001386 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001387
1388 RegStorage new_index = index_;
1389 // Move index out of kArg1, either directly to kArg0, or to kArg2.
Serguei Katkov4c7cc152014-06-24 00:50:02 +07001390 // TODO: clean-up to check not a number but with type
Andreas Gampeccc60262014-07-04 18:02:38 -07001391 if (index_ == m2l_->TargetReg(kArg1, kNotWide)) {
1392 if (array_base_ == m2l_->TargetReg(kArg0, kRef)) {
1393 m2l_->OpRegCopy(m2l_->TargetReg(kArg2, kNotWide), index_);
1394 new_index = m2l_->TargetReg(kArg2, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001395 } else {
Andreas Gampeccc60262014-07-04 18:02:38 -07001396 m2l_->OpRegCopy(m2l_->TargetReg(kArg0, kNotWide), index_);
1397 new_index = m2l_->TargetReg(kArg0, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001398 }
1399 }
1400 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001401 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1402 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1403 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, new_index,
1404 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001405 }
1406
1407 private:
1408 const RegStorage index_;
1409 const RegStorage array_base_;
1410 const int32_t len_offset_;
1411 };
1412
1413 OpRegMem(kOpCmp, index, array_base, len_offset);
Dave Allison69dfe512014-07-11 17:11:58 +00001414 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001415 LIR* branch = OpCondBranch(kCondUge, nullptr);
1416 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1417 index, array_base, len_offset));
1418}
1419
1420void X86Mir2Lir::GenArrayBoundsCheck(int32_t index,
1421 RegStorage array_base,
1422 int32_t len_offset) {
1423 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1424 public:
Andreas Gampe277ccbd2014-11-03 21:36:10 -08001425 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch_in,
1426 int32_t index_in, RegStorage array_base_in, int32_t len_offset_in)
1427 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch_in),
1428 index_(index_in), array_base_(array_base_in), len_offset_(len_offset_in) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001429 }
1430
1431 void Compile() OVERRIDE {
1432 m2l_->ResetRegPool();
1433 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001434 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001435
1436 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001437 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1438 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1439 x86_m2l->LoadConstant(m2l_->TargetReg(kArg0, kNotWide), index_);
1440 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, m2l_->TargetReg(kArg0, kNotWide),
1441 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001442 }
1443
1444 private:
1445 const int32_t index_;
1446 const RegStorage array_base_;
1447 const int32_t len_offset_;
1448 };
1449
1450 NewLIR3(IS_SIMM8(index) ? kX86Cmp32MI8 : kX86Cmp32MI, array_base.GetReg(), len_offset, index);
Dave Allison69dfe512014-07-11 17:11:58 +00001451 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001452 LIR* branch = OpCondBranch(kCondLs, nullptr);
1453 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1454 index, array_base, len_offset));
1455}
1456
Brian Carlstrom7940e442013-07-12 13:46:57 -07001457// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001458LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
buzbee33ae5582014-06-12 14:56:32 -07001459 if (cu_->target64) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001460 OpTlsCmp(Thread::ThreadFlagsOffset<8>(), 0);
1461 } else {
1462 OpTlsCmp(Thread::ThreadFlagsOffset<4>(), 0);
1463 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001464 return OpCondBranch((target == NULL) ? kCondNe : kCondEq, target);
1465}
1466
1467// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -08001468LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001469 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -08001470 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001471}
1472
buzbee11b63d12013-08-27 07:34:17 -07001473bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001474 RegLocation rl_src, RegLocation rl_dest, int lit) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001475 UNUSED(dalvik_opcode, is_div, rl_src, rl_dest, lit);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001476 LOG(FATAL) << "Unexpected use of smallLiteralDive in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001477 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001478}
1479
Ian Rogerse2143c02014-03-28 08:47:16 -07001480bool X86Mir2Lir::EasyMultiply(RegLocation rl_src, RegLocation rl_dest, int lit) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001481 UNUSED(rl_src, rl_dest, lit);
Ian Rogerse2143c02014-03-28 08:47:16 -07001482 LOG(FATAL) << "Unexpected use of easyMultiply in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001483 UNREACHABLE();
Ian Rogerse2143c02014-03-28 08:47:16 -07001484}
1485
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001486LIR* X86Mir2Lir::OpIT(ConditionCode cond, const char* guide) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001487 UNUSED(cond, guide);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001488 LOG(FATAL) << "Unexpected use of OpIT in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001489 UNREACHABLE();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001490}
1491
Dave Allison3da67a52014-04-02 17:03:45 -07001492void X86Mir2Lir::OpEndIT(LIR* it) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001493 UNUSED(it);
Dave Allison3da67a52014-04-02 17:03:45 -07001494 LOG(FATAL) << "Unexpected use of OpEndIT in x86";
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001495 UNREACHABLE();
Dave Allison3da67a52014-04-02 17:03:45 -07001496}
1497
buzbee2700f7e2014-03-07 09:46:20 -08001498void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001499 switch (val) {
1500 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001501 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001502 break;
1503 case 1:
1504 OpRegCopy(dest, src);
1505 break;
1506 default:
1507 OpRegRegImm(kOpMul, dest, src, val);
1508 break;
1509 }
1510}
1511
buzbee2700f7e2014-03-07 09:46:20 -08001512void X86Mir2Lir::GenImulMemImm(RegStorage dest, int sreg, int displacement, int val) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001513 UNUSED(sreg);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001514 // All memory accesses below reference dalvik regs.
1515 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1516
Mark Mendell4708dcd2014-01-22 09:05:18 -08001517 LIR *m;
1518 switch (val) {
1519 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001520 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001521 break;
Ian Rogersb28c1c02014-11-08 11:21:21 -08001522 case 1: {
1523 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
1524 LoadBaseDisp(rs_rSP, displacement, dest, k32, kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001525 break;
Ian Rogersb28c1c02014-11-08 11:21:21 -08001526 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001527 default:
buzbee091cc402014-03-31 10:14:40 -07001528 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(),
Ian Rogersb28c1c02014-11-08 11:21:21 -08001529 rs_rX86_SP_32.GetReg(), displacement, val);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001530 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
1531 break;
1532 }
1533}
1534
Andreas Gampec76c6142014-08-04 16:30:03 -07001535void X86Mir2Lir::GenArithOpLong(Instruction::Code opcode, RegLocation rl_dest, RegLocation rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001536 RegLocation rl_src2, int flags) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001537 if (!cu_->target64) {
1538 // Some x86 32b ops are fallback.
1539 switch (opcode) {
1540 case Instruction::NOT_LONG:
1541 case Instruction::DIV_LONG:
1542 case Instruction::DIV_LONG_2ADDR:
1543 case Instruction::REM_LONG:
1544 case Instruction::REM_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001545 Mir2Lir::GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001546 return;
1547
1548 default:
1549 // Everything else we can handle.
1550 break;
1551 }
1552 }
1553
1554 switch (opcode) {
1555 case Instruction::NOT_LONG:
1556 GenNotLong(rl_dest, rl_src2);
1557 return;
1558
1559 case Instruction::ADD_LONG:
1560 case Instruction::ADD_LONG_2ADDR:
1561 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1562 return;
1563
1564 case Instruction::SUB_LONG:
1565 case Instruction::SUB_LONG_2ADDR:
1566 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1567 return;
1568
1569 case Instruction::MUL_LONG:
1570 case Instruction::MUL_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001571 GenMulLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001572 return;
1573
1574 case Instruction::DIV_LONG:
1575 case Instruction::DIV_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001576 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ true, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001577 return;
1578
1579 case Instruction::REM_LONG:
1580 case Instruction::REM_LONG_2ADDR:
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001581 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ false, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001582 return;
1583
1584 case Instruction::AND_LONG_2ADDR:
1585 case Instruction::AND_LONG:
1586 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1587 return;
1588
1589 case Instruction::OR_LONG:
1590 case Instruction::OR_LONG_2ADDR:
1591 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1592 return;
1593
1594 case Instruction::XOR_LONG:
1595 case Instruction::XOR_LONG_2ADDR:
1596 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1597 return;
1598
1599 case Instruction::NEG_LONG:
1600 GenNegLong(rl_dest, rl_src2);
1601 return;
1602
1603 default:
1604 LOG(FATAL) << "Invalid long arith op";
1605 return;
1606 }
1607}
1608
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001609bool X86Mir2Lir::GenMulLongConst(RegLocation rl_dest, RegLocation rl_src1, int64_t val, int flags) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001610 // All memory accesses below reference dalvik regs.
1611 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1612
Andreas Gampec76c6142014-08-04 16:30:03 -07001613 if (val == 0) {
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001614 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Andreas Gampec76c6142014-08-04 16:30:03 -07001615 if (cu_->target64) {
1616 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001617 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001618 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
1619 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001620 }
Andreas Gampec76c6142014-08-04 16:30:03 -07001621 StoreValueWide(rl_dest, rl_result);
1622 return true;
1623 } else if (val == 1) {
1624 StoreValueWide(rl_dest, rl_src1);
1625 return true;
1626 } else if (val == 2) {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001627 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001628 return true;
1629 } else if (IsPowerOfTwo(val)) {
1630 int shift_amount = LowestSetBit(val);
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001631 if (!PartiallyIntersects(rl_src1, rl_dest)) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001632 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1633 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest, rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001634 shift_amount, flags);
Andreas Gampec76c6142014-08-04 16:30:03 -07001635 StoreValueWide(rl_dest, rl_result);
1636 return true;
1637 }
1638 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001639
Andreas Gampec76c6142014-08-04 16:30:03 -07001640 // Okay, on 32b just bite the bullet and do it, still better than the general case.
1641 if (!cu_->target64) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001642 int32_t val_lo = Low32Bits(val);
1643 int32_t val_hi = High32Bits(val);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001644 // Prepare for explicit register usage.
1645 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001646 rl_src1 = UpdateLocWideTyped(rl_src1);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001647 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1648 int displacement = SRegOffset(rl_src1.s_reg_low);
1649
1650 // ECX <- 1H * 2L
1651 // EAX <- 1L * 2H
1652 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001653 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
1654 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001655 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001656 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
1657 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001658 }
1659
1660 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001661 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001662
1663 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001664 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001665
1666 // EDX:EAX <- 2L * 1L (double precision)
1667 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001668 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001669 } else {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001670 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP_32.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001671 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1672 true /* is_load */, true /* is_64bit */);
1673 }
1674
1675 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001676 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001677
1678 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001679 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
1680 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001681 StoreValueWide(rl_dest, rl_result);
Andreas Gampec76c6142014-08-04 16:30:03 -07001682 return true;
1683 }
1684 return false;
1685}
1686
1687void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001688 RegLocation rl_src2, int flags) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001689 if (rl_src1.is_const) {
1690 std::swap(rl_src1, rl_src2);
1691 }
1692
1693 if (rl_src2.is_const) {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07001694 if (GenMulLongConst(rl_dest, rl_src1, mir_graph_->ConstantValueWide(rl_src2), flags)) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001695 return;
1696 }
1697 }
1698
1699 // All memory accesses below reference dalvik regs.
1700 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1701
1702 if (cu_->target64) {
1703 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1704 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1705 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1706 if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1707 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1708 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
1709 } else if (rl_result.reg.GetReg() != rl_src1.reg.GetReg() &&
1710 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1711 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src1.reg.GetReg());
1712 } else if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1713 rl_result.reg.GetReg() != rl_src2.reg.GetReg()) {
1714 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1715 } else {
1716 OpRegCopy(rl_result.reg, rl_src1.reg);
1717 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1718 }
1719 StoreValueWide(rl_dest, rl_result);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001720 return;
1721 }
1722
Andreas Gampec76c6142014-08-04 16:30:03 -07001723 // Not multiplying by a constant. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001724 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1725 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1726 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1727
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001728 // Prepare for explicit register usage.
1729 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001730 rl_src1 = UpdateLocWideTyped(rl_src1);
1731 rl_src2 = UpdateLocWideTyped(rl_src2);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001732
1733 // At this point, the VRs are in their home locations.
1734 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1735 bool src2_in_reg = rl_src2.location == kLocPhysReg;
Ian Rogersb28c1c02014-11-08 11:21:21 -08001736 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Mark Mendell4708dcd2014-01-22 09:05:18 -08001737
1738 // ECX <- 1H
1739 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001740 NewLIR2(kX86Mov32RR, rs_r1.GetReg(), rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001741 } else {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001742 LoadBaseDisp(rs_rSP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1, k32,
Andreas Gampe3c12c512014-06-24 18:46:29 +00001743 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001744 }
1745
Mark Mendellde99bba2014-02-14 12:15:02 -08001746 if (is_square) {
1747 // Take advantage of the fact that the values are the same.
1748 // ECX <- ECX * 2L (1H * 2L)
1749 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001750 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001751 } else {
1752 int displacement = SRegOffset(rl_src2.s_reg_low);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001753 LIR* m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP_32.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001754 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001755 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1756 true /* is_load */, true /* is_64bit */);
1757 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001758
Mark Mendellde99bba2014-02-14 12:15:02 -08001759 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001760 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001761 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001762 // EAX <- 2H
1763 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001764 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001765 } else {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001766 LoadBaseDisp(rs_rSP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0, k32,
Andreas Gampe3c12c512014-06-24 18:46:29 +00001767 kNotVolatile);
Mark Mendellde99bba2014-02-14 12:15:02 -08001768 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001769
Mark Mendellde99bba2014-02-14 12:15:02 -08001770 // EAX <- EAX * 1L (2H * 1L)
1771 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001772 NewLIR2(kX86Imul32RR, rs_r0.GetReg(), rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001773 } else {
1774 int displacement = SRegOffset(rl_src1.s_reg_low);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001775 LIR *m = NewLIR3(kX86Imul32RM, rs_r0.GetReg(), rs_rX86_SP_32.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001776 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001777 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1778 true /* is_load */, true /* is_64bit */);
1779 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001780
Mark Mendellde99bba2014-02-14 12:15:02 -08001781 // ECX <- ECX * 2L (1H * 2L)
1782 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001783 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001784 } else {
1785 int displacement = SRegOffset(rl_src2.s_reg_low);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001786 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP_32.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001787 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001788 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1789 true /* is_load */, true /* is_64bit */);
1790 }
1791
1792 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001793 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001794 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001795
1796 // EAX <- 2L
1797 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001798 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001799 } else {
Ian Rogersb28c1c02014-11-08 11:21:21 -08001800 LoadBaseDisp(rs_rSP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0, k32,
Andreas Gampe3c12c512014-06-24 18:46:29 +00001801 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001802 }
1803
1804 // EDX:EAX <- 2L * 1L (double precision)
1805 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001806 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001807 } else {
1808 int displacement = SRegOffset(rl_src1.s_reg_low);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001809 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP_32.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001810 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1811 true /* is_load */, true /* is_64bit */);
1812 }
1813
1814 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001815 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001816
1817 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001818 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
buzbee2700f7e2014-03-07 09:46:20 -08001819 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001820 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001821}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001822
1823void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1824 Instruction::Code op) {
1825 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1826 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1827 if (rl_src.location == kLocPhysReg) {
1828 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001829 // But we must ensure that rl_src is in pair
Elena Sayapinadd644502014-07-01 18:39:52 +07001830 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001831 NewLIR2(x86op, rl_dest.reg.GetReg(), rl_src.reg.GetReg());
1832 } else {
1833 rl_src = LoadValueWide(rl_src, kCoreReg);
1834 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
1835 // The registers are the same, so we would clobber it before the use.
1836 RegStorage temp_reg = AllocTemp();
1837 OpRegCopy(temp_reg, rl_dest.reg);
1838 rl_src.reg.SetHighReg(temp_reg.GetReg());
1839 }
1840 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001841
Chao-ying Fua0147762014-06-06 18:38:49 -07001842 x86op = GetOpcode(op, rl_dest, rl_src, true);
1843 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
Chao-ying Fua0147762014-06-06 18:38:49 -07001844 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001845 return;
1846 }
1847
1848 // RHS is in memory.
1849 DCHECK((rl_src.location == kLocDalvikFrame) ||
1850 (rl_src.location == kLocCompilerTemp));
Ian Rogersb28c1c02014-11-08 11:21:21 -08001851 int r_base = rs_rX86_SP_32.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001852 int displacement = SRegOffset(rl_src.s_reg_low);
1853
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001854 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Andreas Gampeccc60262014-07-04 18:02:38 -07001855 LIR *lir = NewLIR3(x86op, cu_->target64 ? rl_dest.reg.GetReg() : rl_dest.reg.GetLowReg(),
1856 r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001857 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1858 true /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001859 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001860 x86op = GetOpcode(op, rl_dest, rl_src, true);
1861 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001862 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1863 true /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001864 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001865}
1866
Mark Mendelle02d48f2014-01-15 11:19:23 -08001867void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001868 rl_dest = UpdateLocWideTyped(rl_dest);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001869 if (rl_dest.location == kLocPhysReg) {
1870 // Ensure we are in a register pair
1871 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1872
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001873 rl_src = UpdateLocWideTyped(rl_src);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001874 GenLongRegOrMemOp(rl_result, rl_src, op);
1875 StoreFinalValueWide(rl_dest, rl_result);
1876 return;
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001877 } else if (!cu_->target64 && Intersects(rl_src, rl_dest)) {
1878 // Handle the case when src and dest are intersect.
1879 rl_src = LoadValueWide(rl_src, kCoreReg);
1880 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001881 rl_src = UpdateLocWideTyped(rl_src);
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001882 GenLongRegOrMemOp(rl_result, rl_src, op);
1883 StoreFinalValueWide(rl_dest, rl_result);
1884 return;
Mark Mendelle02d48f2014-01-15 11:19:23 -08001885 }
1886
1887 // It wasn't in registers, so it better be in memory.
1888 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1889 (rl_dest.location == kLocCompilerTemp));
1890 rl_src = LoadValueWide(rl_src, kCoreReg);
1891
1892 // Operate directly into memory.
1893 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
Ian Rogersb28c1c02014-11-08 11:21:21 -08001894 int r_base = rs_rX86_SP_32.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001895 int displacement = SRegOffset(rl_dest.s_reg_low);
1896
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001897 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07001898 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET,
Elena Sayapinadd644502014-07-01 18:39:52 +07001899 cu_->target64 ? rl_src.reg.GetReg() : rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001900 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001901 true /* is_load */, true /* is64bit */);
1902 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001903 false /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001904 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001905 x86op = GetOpcode(op, rl_dest, rl_src, true);
1906 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001907 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1908 true /* is_load */, true /* is64bit */);
1909 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1910 false /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001911 }
nikolay serdjuk6b9356c2014-11-13 18:15:23 +06001912
1913 int v_src_reg = mir_graph_->SRegToVReg(rl_src.s_reg_low);
1914 int v_dst_reg = mir_graph_->SRegToVReg(rl_dest.s_reg_low);
1915
1916 // If the left operand is in memory and the right operand is in a register
1917 // and both belong to the same dalvik register then we should clobber the
1918 // right one because it doesn't hold valid data anymore.
1919 if (v_src_reg == v_dst_reg) {
1920 Clobber(rl_src.reg);
1921 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001922}
1923
Mark Mendelle02d48f2014-01-15 11:19:23 -08001924void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
1925 RegLocation rl_src2, Instruction::Code op,
1926 bool is_commutative) {
1927 // Is this really a 2 operand operation?
1928 switch (op) {
1929 case Instruction::ADD_LONG_2ADDR:
1930 case Instruction::SUB_LONG_2ADDR:
1931 case Instruction::AND_LONG_2ADDR:
1932 case Instruction::OR_LONG_2ADDR:
1933 case Instruction::XOR_LONG_2ADDR:
Mark Mendelle87f9b52014-04-30 14:13:18 -04001934 if (GenerateTwoOperandInstructions()) {
1935 GenLongArith(rl_dest, rl_src2, op);
1936 return;
1937 }
1938 break;
1939
Mark Mendelle02d48f2014-01-15 11:19:23 -08001940 default:
1941 break;
1942 }
1943
1944 if (rl_dest.location == kLocPhysReg) {
1945 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
1946
1947 // We are about to clobber the LHS, so it needs to be a temp.
1948 rl_result = ForceTempWide(rl_result);
1949
1950 // Perform the operation using the RHS.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001951 rl_src2 = UpdateLocWideTyped(rl_src2);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001952 GenLongRegOrMemOp(rl_result, rl_src2, op);
1953
1954 // And now record that the result is in the temp.
1955 StoreFinalValueWide(rl_dest, rl_result);
1956 return;
1957 }
1958
1959 // It wasn't in registers, so it better be in memory.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07001960 DCHECK((rl_dest.location == kLocDalvikFrame) || (rl_dest.location == kLocCompilerTemp));
1961 rl_src1 = UpdateLocWideTyped(rl_src1);
1962 rl_src2 = UpdateLocWideTyped(rl_src2);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001963
1964 // Get one of the source operands into temporary register.
1965 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +07001966 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001967 if (IsTemp(rl_src1.reg)) {
1968 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1969 } else if (is_commutative) {
1970 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1971 // We need at least one of them to be a temporary.
1972 if (!IsTemp(rl_src2.reg)) {
1973 rl_src1 = ForceTempWide(rl_src1);
1974 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1975 } else {
1976 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1977 StoreFinalValueWide(rl_dest, rl_src2);
1978 return;
1979 }
1980 } else {
1981 // Need LHS to be the temp.
Mark Mendelle02d48f2014-01-15 11:19:23 -08001982 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07001983 GenLongRegOrMemOp(rl_src1, rl_src2, op);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001984 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001985 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07001986 if (IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
1987 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1988 } else if (is_commutative) {
1989 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1990 // We need at least one of them to be a temporary.
1991 if (!(IsTemp(rl_src2.reg.GetLow()) && IsTemp(rl_src2.reg.GetHigh()))) {
1992 rl_src1 = ForceTempWide(rl_src1);
1993 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1994 } else {
1995 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1996 StoreFinalValueWide(rl_dest, rl_src2);
1997 return;
1998 }
1999 } else {
2000 // Need LHS to be the temp.
2001 rl_src1 = ForceTempWide(rl_src1);
2002 GenLongRegOrMemOp(rl_src1, rl_src2, op);
2003 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002004 }
2005
2006 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002007}
2008
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002009void X86Mir2Lir::GenNotLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002010 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002011 rl_src = LoadValueWide(rl_src, kCoreReg);
2012 RegLocation rl_result;
2013 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2014 OpRegCopy(rl_result.reg, rl_src.reg);
2015 OpReg(kOpNot, rl_result.reg);
2016 StoreValueWide(rl_dest, rl_result);
2017 } else {
2018 LOG(FATAL) << "Unexpected use GenNotLong()";
2019 }
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002020}
2021
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002022void X86Mir2Lir::GenDivRemLongLit(RegLocation rl_dest, RegLocation rl_src,
2023 int64_t imm, bool is_div) {
2024 if (imm == 0) {
2025 GenDivZeroException();
2026 } else if (imm == 1) {
2027 if (is_div) {
2028 // x / 1 == x.
2029 StoreValueWide(rl_dest, rl_src);
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 (imm == -1) { // handle 0x8000000000000000 / -1 special case.
2037 if (is_div) {
2038 rl_src = LoadValueWide(rl_src, kCoreReg);
2039 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2040 RegStorage rs_temp = AllocTempWide();
2041
2042 OpRegCopy(rl_result.reg, rl_src.reg);
2043 LoadConstantWide(rs_temp, 0x8000000000000000);
2044
2045 // If x == MIN_LONG, return MIN_LONG.
2046 OpRegReg(kOpCmp, rl_src.reg, rs_temp);
2047 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
2048
2049 // For x != MIN_LONG, x / -1 == -x.
2050 OpReg(kOpNeg, rl_result.reg);
2051
2052 minint_branch->target = NewLIR0(kPseudoTargetLabel);
2053 FreeTemp(rs_temp);
2054 StoreValueWide(rl_dest, rl_result);
2055 } else {
2056 // x % -1 == 0.
2057 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2058 LoadConstantWide(rl_result.reg, 0);
2059 StoreValueWide(rl_dest, rl_result);
2060 }
2061 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
2062 // Division using shifting.
2063 rl_src = LoadValueWide(rl_src, kCoreReg);
2064 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2065 if (IsSameReg(rl_result.reg, rl_src.reg)) {
2066 RegStorage rs_temp = AllocTypedTempWide(false, kCoreReg);
2067 rl_result.reg.SetReg(rs_temp.GetReg());
2068 }
2069 LoadConstantWide(rl_result.reg, std::abs(imm) - 1);
2070 OpRegReg(kOpAdd, rl_result.reg, rl_src.reg);
2071 NewLIR2(kX86Test64RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
2072 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
2073 int shift_amount = LowestSetBit(imm);
2074 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
2075 if (imm < 0) {
2076 OpReg(kOpNeg, rl_result.reg);
2077 }
2078 StoreValueWide(rl_dest, rl_result);
2079 } else {
2080 CHECK(imm <= -2 || imm >= 2);
2081
2082 FlushReg(rs_r0q);
2083 Clobber(rs_r0q);
2084 LockTemp(rs_r0q);
2085 FlushReg(rs_r2q);
2086 Clobber(rs_r2q);
2087 LockTemp(rs_r2q);
2088
Mark Mendell3a91f442014-09-02 12:44:24 -04002089 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
2090 is_div ? rs_r2q : rs_r0q, INVALID_SREG, INVALID_SREG};
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002091
2092 // Use H.S.Warren's Hacker's Delight Chapter 10 and
2093 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
2094 int64_t magic;
2095 int shift;
2096 CalculateMagicAndShift(imm, magic, shift, true /* is_long */);
2097
2098 /*
2099 * For imm >= 2,
2100 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
2101 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
2102 * For imm <= -2,
2103 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
2104 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
2105 * We implement this algorithm in the following way:
2106 * 1. multiply magic number m and numerator n, get the higher 64bit result in RDX
2107 * 2. if imm > 0 and magic < 0, add numerator to RDX
2108 * if imm < 0 and magic > 0, sub numerator from RDX
2109 * 3. if S !=0, SAR S bits for RDX
2110 * 4. add 1 to RDX if RDX < 0
2111 * 5. Thus, RDX is the quotient
2112 */
2113
Mark Mendell3a91f442014-09-02 12:44:24 -04002114 // RAX = magic.
2115 LoadConstantWide(rs_r0q, magic);
2116
2117 // Multiply by numerator.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002118 RegStorage numerator_reg;
2119 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
2120 // We will need the value later.
2121 rl_src = LoadValueWide(rl_src, kCoreReg);
2122 numerator_reg = rl_src.reg;
Mark Mendell3a91f442014-09-02 12:44:24 -04002123
2124 // RDX:RAX = magic * numerator.
2125 NewLIR1(kX86Imul64DaR, numerator_reg.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002126 } else {
Mark Mendell3a91f442014-09-02 12:44:24 -04002127 // Only need this once. Multiply directly from the value.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002128 rl_src = UpdateLocWideTyped(rl_src);
Mark Mendell3a91f442014-09-02 12:44:24 -04002129 if (rl_src.location != kLocPhysReg) {
2130 // Okay, we can do this from memory.
2131 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2132 int displacement = SRegOffset(rl_src.s_reg_low);
2133 // RDX:RAX = magic * numerator.
Ian Rogersb28c1c02014-11-08 11:21:21 -08002134 LIR *m = NewLIR2(kX86Imul64DaM, rs_rX86_SP_32.GetReg(), displacement);
Mark Mendell3a91f442014-09-02 12:44:24 -04002135 AnnotateDalvikRegAccess(m, displacement >> 2,
2136 true /* is_load */, true /* is_64bit */);
2137 } else {
2138 // RDX:RAX = magic * numerator.
2139 NewLIR1(kX86Imul64DaR, rl_src.reg.GetReg());
2140 }
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002141 }
2142
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002143 if (imm > 0 && magic < 0) {
2144 // Add numerator to RDX.
2145 DCHECK(numerator_reg.Valid());
2146 OpRegReg(kOpAdd, rs_r2q, numerator_reg);
2147 } else if (imm < 0 && magic > 0) {
2148 DCHECK(numerator_reg.Valid());
2149 OpRegReg(kOpSub, rs_r2q, numerator_reg);
2150 }
2151
2152 // Do we need the shift?
2153 if (shift != 0) {
2154 // Shift RDX by 'shift' bits.
2155 OpRegImm(kOpAsr, rs_r2q, shift);
2156 }
2157
2158 // Move RDX to RAX.
2159 OpRegCopyWide(rs_r0q, rs_r2q);
2160
2161 // Move sign bit to bit 0, zeroing the rest.
2162 OpRegImm(kOpLsr, rs_r2q, 63);
2163
2164 // RDX = RDX + RAX.
2165 OpRegReg(kOpAdd, rs_r2q, rs_r0q);
2166
2167 // Quotient is in RDX.
2168 if (!is_div) {
2169 // We need to compute the remainder.
2170 // Remainder is divisor - (quotient * imm).
2171 DCHECK(numerator_reg.Valid());
2172 OpRegCopyWide(rs_r0q, numerator_reg);
2173
2174 // Imul doesn't support 64-bit imms.
2175 if (imm > std::numeric_limits<int32_t>::max() ||
2176 imm < std::numeric_limits<int32_t>::min()) {
2177 RegStorage rs_temp = AllocTempWide();
2178 LoadConstantWide(rs_temp, imm);
2179
2180 // RAX = numerator * imm.
2181 NewLIR2(kX86Imul64RR, rs_r2q.GetReg(), rs_temp.GetReg());
2182
2183 FreeTemp(rs_temp);
2184 } else {
2185 // RAX = numerator * imm.
2186 int short_imm = static_cast<int>(imm);
2187 NewLIR3(kX86Imul64RRI, rs_r2q.GetReg(), rs_r2q.GetReg(), short_imm);
2188 }
2189
Mark Mendell3a91f442014-09-02 12:44:24 -04002190 // RAX -= RDX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002191 OpRegReg(kOpSub, rs_r0q, rs_r2q);
2192
Mark Mendell3a91f442014-09-02 12:44:24 -04002193 // Result in RAX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002194 } else {
Mark Mendell3a91f442014-09-02 12:44:24 -04002195 // Result in RDX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002196 }
2197 StoreValueWide(rl_dest, rl_result);
2198 FreeTemp(rs_r0q);
2199 FreeTemp(rs_r2q);
2200 }
2201}
2202
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002203void X86Mir2Lir::GenDivRemLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002204 RegLocation rl_src2, bool is_div, int flags) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002205 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002206 LOG(FATAL) << "Unexpected use GenDivRemLong()";
2207 return;
2208 }
2209
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002210 if (rl_src2.is_const) {
2211 DCHECK(rl_src2.wide);
2212 int64_t imm = mir_graph_->ConstantValueWide(rl_src2);
2213 GenDivRemLongLit(rl_dest, rl_src1, imm, is_div);
2214 return;
2215 }
2216
Chao-ying Fua0147762014-06-06 18:38:49 -07002217 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002218 // Prepare for explicit register usage.
2219 ExplicitTempRegisterLock(this, 4, &rs_r0q, &rs_r1q, &rs_r2q, &rs_r6q);
Chao-ying Fua0147762014-06-06 18:38:49 -07002220
2221 // Load LHS into RAX.
2222 LoadValueDirectWideFixed(rl_src1, rs_r0q);
2223
2224 // Load RHS into RCX.
2225 LoadValueDirectWideFixed(rl_src2, rs_r1q);
2226
2227 // Copy LHS sign bit into RDX.
2228 NewLIR0(kx86Cqo64Da);
2229
2230 // Handle division by zero case.
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002231 if ((flags & MIR_IGNORE_DIV_ZERO_CHECK) == 0) {
2232 GenDivZeroCheckWide(rs_r1q);
2233 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002234
2235 // Have to catch 0x8000000000000000/-1 case, or we will get an exception!
2236 NewLIR2(kX86Cmp64RI8, rs_r1q.GetReg(), -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002237 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002238
2239 // RHS is -1.
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002240 LoadConstantWide(rs_r6q, 0x8000000000000000);
2241 NewLIR2(kX86Cmp64RR, rs_r0q.GetReg(), rs_r6q.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002242 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002243
2244 // In 0x8000000000000000/-1 case.
2245 if (!is_div) {
2246 // For DIV, RAX is already right. For REM, we need RDX 0.
2247 NewLIR2(kX86Xor64RR, rs_r2q.GetReg(), rs_r2q.GetReg());
2248 }
2249 LIR* done = NewLIR1(kX86Jmp8, 0);
2250
2251 // Expected case.
2252 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
2253 minint_branch->target = minus_one_branch->target;
2254 NewLIR1(kX86Idivmod64DaR, rs_r1q.GetReg());
2255 done->target = NewLIR0(kPseudoTargetLabel);
2256
2257 // Result is in RAX for div and RDX for rem.
2258 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, rs_r0q, INVALID_SREG, INVALID_SREG};
2259 if (!is_div) {
2260 rl_result.reg.SetReg(r2q);
2261 }
2262
2263 StoreValueWide(rl_dest, rl_result);
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002264}
2265
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002266void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002267 rl_src = LoadValueWide(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002268 RegLocation rl_result;
Elena Sayapinadd644502014-07-01 18:39:52 +07002269 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002270 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2271 OpRegReg(kOpNeg, rl_result.reg, rl_src.reg);
2272 } else {
2273 rl_result = ForceTempWide(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07002274 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
2275 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
2276 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Mark Mendelle02d48f2014-01-15 11:19:23 -08002277 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002278 StoreValueWide(rl_dest, rl_result);
2279}
2280
buzbee091cc402014-03-31 10:14:40 -07002281void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<4> thread_offset) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07002282 DCHECK_EQ(kX86, cu_->instruction_set);
2283 X86OpCode opcode = kX86Bkpt;
2284 switch (op) {
2285 case kOpCmp: opcode = kX86Cmp32RT; break;
2286 case kOpMov: opcode = kX86Mov32RT; break;
2287 default:
2288 LOG(FATAL) << "Bad opcode: " << op;
2289 break;
2290 }
2291 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
2292}
2293
2294void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<8> thread_offset) {
2295 DCHECK_EQ(kX86_64, cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002296 X86OpCode opcode = kX86Bkpt;
Elena Sayapinadd644502014-07-01 18:39:52 +07002297 if (cu_->target64 && r_dest.Is64BitSolo()) {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +07002298 switch (op) {
2299 case kOpCmp: opcode = kX86Cmp64RT; break;
2300 case kOpMov: opcode = kX86Mov64RT; break;
2301 default:
2302 LOG(FATAL) << "Bad opcode(OpRegThreadMem 64): " << op;
2303 break;
2304 }
2305 } else {
2306 switch (op) {
2307 case kOpCmp: opcode = kX86Cmp32RT; break;
2308 case kOpMov: opcode = kX86Mov32RT; break;
2309 default:
2310 LOG(FATAL) << "Bad opcode: " << op;
2311 break;
2312 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002313 }
buzbee091cc402014-03-31 10:14:40 -07002314 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07002315}
2316
2317/*
2318 * Generate array load
2319 */
2320void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002321 RegLocation rl_index, RegLocation rl_dest, int scale) {
buzbee091cc402014-03-31 10:14:40 -07002322 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002323 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07002324 RegLocation rl_result;
buzbeea0cd2d72014-06-01 09:33:49 -07002325 rl_array = LoadValue(rl_array, kRefReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002326
Mark Mendell343adb52013-12-18 06:02:17 -08002327 int data_offset;
buzbee695d13a2014-04-19 13:32:20 -07002328 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002329 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2330 } else {
2331 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2332 }
2333
Mark Mendell343adb52013-12-18 06:02:17 -08002334 bool constant_index = rl_index.is_const;
2335 int32_t constant_index_value = 0;
2336 if (!constant_index) {
2337 rl_index = LoadValue(rl_index, kCoreReg);
2338 } else {
2339 constant_index_value = mir_graph_->ConstantValue(rl_index);
2340 // If index is constant, just fold it into the data offset
2341 data_offset += constant_index_value << scale;
2342 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002343 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002344 }
2345
Brian Carlstrom7940e442013-07-12 13:46:57 -07002346 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002347 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002348
2349 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002350 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002351 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002352 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002353 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002354 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002355 }
Mark Mendell343adb52013-12-18 06:02:17 -08002356 rl_result = EvalLoc(rl_dest, reg_class, true);
Vladimir Marko3bf7c602014-05-07 14:55:43 +01002357 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg, size);
buzbee695d13a2014-04-19 13:32:20 -07002358 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002359 StoreValueWide(rl_dest, rl_result);
2360 } else {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002361 StoreValue(rl_dest, rl_result);
2362 }
2363}
2364
2365/*
2366 * Generate array store
2367 *
2368 */
2369void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002370 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
buzbee091cc402014-03-31 10:14:40 -07002371 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002372 int len_offset = mirror::Array::LengthOffset().Int32Value();
2373 int data_offset;
2374
buzbee695d13a2014-04-19 13:32:20 -07002375 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002376 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2377 } else {
2378 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2379 }
2380
buzbeea0cd2d72014-06-01 09:33:49 -07002381 rl_array = LoadValue(rl_array, kRefReg);
Mark Mendell343adb52013-12-18 06:02:17 -08002382 bool constant_index = rl_index.is_const;
2383 int32_t constant_index_value = 0;
2384 if (!constant_index) {
2385 rl_index = LoadValue(rl_index, kCoreReg);
2386 } else {
2387 // If index is constant, just fold it into the data offset
2388 constant_index_value = mir_graph_->ConstantValue(rl_index);
2389 data_offset += constant_index_value << scale;
2390 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002391 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002392 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002393
2394 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002395 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002396
2397 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002398 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002399 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002400 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002401 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002402 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002403 }
buzbee695d13a2014-04-19 13:32:20 -07002404 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002405 rl_src = LoadValueWide(rl_src, reg_class);
2406 } else {
2407 rl_src = LoadValue(rl_src, reg_class);
2408 }
2409 // If the src reg can't be byte accessed, move it to a temp first.
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002410 if ((size == kSignedByte || size == kUnsignedByte) && !IsByteRegister(rl_src.reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002411 RegStorage temp = AllocTemp();
2412 OpRegCopy(temp, rl_src.reg);
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002413 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002414 } else {
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002415 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002416 }
Ian Rogersa9a82542013-10-04 11:17:26 -07002417 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07002418 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08002419 if (!constant_index) {
buzbee091cc402014-03-31 10:14:40 -07002420 FreeTemp(rl_index.reg);
Mark Mendell343adb52013-12-18 06:02:17 -08002421 }
Vladimir Marko743b98c2014-11-24 19:45:41 +00002422 MarkGCCard(opt_flags, rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002423 }
2424}
2425
Mark Mendell4708dcd2014-01-22 09:05:18 -08002426RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002427 RegLocation rl_src, int shift_amount, int flags) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002428 UNUSED(flags);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002429 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Elena Sayapinadd644502014-07-01 18:39:52 +07002430 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002431 OpKind op = static_cast<OpKind>(0); /* Make gcc happy */
2432 switch (opcode) {
2433 case Instruction::SHL_LONG:
2434 case Instruction::SHL_LONG_2ADDR:
2435 op = kOpLsl;
2436 break;
2437 case Instruction::SHR_LONG:
2438 case Instruction::SHR_LONG_2ADDR:
2439 op = kOpAsr;
2440 break;
2441 case Instruction::USHR_LONG:
2442 case Instruction::USHR_LONG_2ADDR:
2443 op = kOpLsr;
2444 break;
2445 default:
2446 LOG(FATAL) << "Unexpected case";
2447 }
2448 OpRegRegImm(op, rl_result.reg, rl_src.reg, shift_amount);
2449 } else {
2450 switch (opcode) {
2451 case Instruction::SHL_LONG:
2452 case Instruction::SHL_LONG_2ADDR:
2453 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
2454 if (shift_amount == 32) {
2455 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2456 LoadConstant(rl_result.reg.GetLow(), 0);
2457 } else if (shift_amount > 31) {
2458 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2459 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
2460 LoadConstant(rl_result.reg.GetLow(), 0);
2461 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002462 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002463 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2464 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(),
2465 shift_amount);
2466 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
2467 }
2468 break;
2469 case Instruction::SHR_LONG:
2470 case Instruction::SHR_LONG_2ADDR:
2471 if (shift_amount == 32) {
2472 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2473 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2474 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2475 } else if (shift_amount > 31) {
2476 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2477 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2478 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2479 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2480 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002481 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002482 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2483 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2484 shift_amount);
2485 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
2486 }
2487 break;
2488 case Instruction::USHR_LONG:
2489 case Instruction::USHR_LONG_2ADDR:
2490 if (shift_amount == 32) {
2491 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2492 LoadConstant(rl_result.reg.GetHigh(), 0);
2493 } else if (shift_amount > 31) {
2494 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2495 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2496 LoadConstant(rl_result.reg.GetHigh(), 0);
2497 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002498 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002499 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2500 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2501 shift_amount);
2502 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
2503 }
2504 break;
2505 default:
2506 LOG(FATAL) << "Unexpected case";
2507 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08002508 }
2509 return rl_result;
2510}
2511
Brian Carlstrom7940e442013-07-12 13:46:57 -07002512void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002513 RegLocation rl_src, RegLocation rl_shift, int flags) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08002514 // Per spec, we only care about low 6 bits of shift amount.
2515 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
2516 if (shift_amount == 0) {
2517 rl_src = LoadValueWide(rl_src, kCoreReg);
2518 StoreValueWide(rl_dest, rl_src);
2519 return;
2520 } else if (shift_amount == 1 &&
2521 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
2522 // Need to handle this here to avoid calling StoreValueWide twice.
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002523 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src, flags);
Mark Mendell4708dcd2014-01-22 09:05:18 -08002524 return;
2525 }
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07002526 if (PartiallyIntersects(rl_src, rl_dest)) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08002527 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
2528 return;
2529 }
2530 rl_src = LoadValueWide(rl_src, kCoreReg);
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002531 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount, flags);
Mark Mendell4708dcd2014-01-22 09:05:18 -08002532 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002533}
2534
2535void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002536 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2,
2537 int flags) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002538 bool isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002539 switch (opcode) {
2540 case Instruction::ADD_LONG:
2541 case Instruction::AND_LONG:
2542 case Instruction::OR_LONG:
2543 case Instruction::XOR_LONG:
2544 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002545 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002546 } else {
2547 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002548 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002549 }
2550 break;
2551 case Instruction::SUB_LONG:
2552 case Instruction::SUB_LONG_2ADDR:
2553 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002554 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002555 } else {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002556 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Chao-ying Fua0147762014-06-06 18:38:49 -07002557 isConstSuccess = true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002558 }
2559 break;
2560 case Instruction::ADD_LONG_2ADDR:
2561 case Instruction::OR_LONG_2ADDR:
2562 case Instruction::XOR_LONG_2ADDR:
2563 case Instruction::AND_LONG_2ADDR:
2564 if (rl_src2.is_const) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002565 if (GenerateTwoOperandInstructions()) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002566 isConstSuccess = GenLongImm(rl_dest, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002567 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07002568 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002569 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002570 } else {
2571 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002572 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002573 }
2574 break;
2575 default:
Chao-ying Fua0147762014-06-06 18:38:49 -07002576 isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002577 break;
2578 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002579
2580 if (!isConstSuccess) {
2581 // Default - bail to non-const handler.
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002582 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2, flags);
Chao-ying Fua0147762014-06-06 18:38:49 -07002583 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002584}
2585
2586bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
2587 switch (op) {
2588 case Instruction::AND_LONG_2ADDR:
2589 case Instruction::AND_LONG:
2590 return value == -1;
2591 case Instruction::OR_LONG:
2592 case Instruction::OR_LONG_2ADDR:
2593 case Instruction::XOR_LONG:
2594 case Instruction::XOR_LONG_2ADDR:
2595 return value == 0;
2596 default:
2597 return false;
2598 }
2599}
2600
2601X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
2602 bool is_high_op) {
2603 bool rhs_in_mem = rhs.location != kLocPhysReg;
2604 bool dest_in_mem = dest.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002605 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002606 DCHECK(!rhs_in_mem || !dest_in_mem);
2607 switch (op) {
2608 case Instruction::ADD_LONG:
2609 case Instruction::ADD_LONG_2ADDR:
2610 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002611 return is64Bit ? kX86Add64MR : is_high_op ? kX86Adc32MR : kX86Add32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002612 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002613 return is64Bit ? kX86Add64RM : is_high_op ? kX86Adc32RM : kX86Add32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002614 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002615 return is64Bit ? kX86Add64RR : is_high_op ? kX86Adc32RR : kX86Add32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002616 case Instruction::SUB_LONG:
2617 case Instruction::SUB_LONG_2ADDR:
2618 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002619 return is64Bit ? kX86Sub64MR : is_high_op ? kX86Sbb32MR : kX86Sub32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002620 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002621 return is64Bit ? kX86Sub64RM : is_high_op ? kX86Sbb32RM : kX86Sub32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002622 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002623 return is64Bit ? kX86Sub64RR : is_high_op ? kX86Sbb32RR : kX86Sub32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002624 case Instruction::AND_LONG_2ADDR:
2625 case Instruction::AND_LONG:
2626 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002627 return is64Bit ? kX86And64MR : kX86And32MR;
2628 }
2629 if (is64Bit) {
2630 return rhs_in_mem ? kX86And64RM : kX86And64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002631 }
2632 return rhs_in_mem ? kX86And32RM : kX86And32RR;
2633 case Instruction::OR_LONG:
2634 case Instruction::OR_LONG_2ADDR:
2635 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002636 return is64Bit ? kX86Or64MR : kX86Or32MR;
2637 }
2638 if (is64Bit) {
2639 return rhs_in_mem ? kX86Or64RM : kX86Or64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002640 }
2641 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
2642 case Instruction::XOR_LONG:
2643 case Instruction::XOR_LONG_2ADDR:
2644 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002645 return is64Bit ? kX86Xor64MR : kX86Xor32MR;
2646 }
2647 if (is64Bit) {
2648 return rhs_in_mem ? kX86Xor64RM : kX86Xor64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002649 }
2650 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
2651 default:
2652 LOG(FATAL) << "Unexpected opcode: " << op;
2653 return kX86Add32RR;
2654 }
2655}
2656
2657X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
2658 int32_t value) {
2659 bool in_mem = loc.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002660 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002661 bool byte_imm = IS_SIMM8(value);
buzbee091cc402014-03-31 10:14:40 -07002662 DCHECK(in_mem || !loc.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002663 switch (op) {
2664 case Instruction::ADD_LONG:
2665 case Instruction::ADD_LONG_2ADDR:
2666 if (byte_imm) {
2667 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002668 return is64Bit ? kX86Add64MI8 : is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002669 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002670 return is64Bit ? kX86Add64RI8 : is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002671 }
2672 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002673 return is64Bit ? kX86Add64MI : is_high_op ? kX86Adc32MI : kX86Add32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002674 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002675 return is64Bit ? kX86Add64RI : is_high_op ? kX86Adc32RI : kX86Add32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002676 case Instruction::SUB_LONG:
2677 case Instruction::SUB_LONG_2ADDR:
2678 if (byte_imm) {
2679 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002680 return is64Bit ? kX86Sub64MI8 : is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002681 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002682 return is64Bit ? kX86Sub64RI8 : is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002683 }
2684 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002685 return is64Bit ? kX86Sub64MI : is_high_op ? kX86Sbb32MI : kX86Sub32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002686 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002687 return is64Bit ? kX86Sub64RI : is_high_op ? kX86Sbb32RI : kX86Sub32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002688 case Instruction::AND_LONG_2ADDR:
2689 case Instruction::AND_LONG:
2690 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002691 if (is64Bit) {
2692 return in_mem ? kX86And64MI8 : kX86And64RI8;
2693 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002694 return in_mem ? kX86And32MI8 : kX86And32RI8;
2695 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002696 if (is64Bit) {
2697 return in_mem ? kX86And64MI : kX86And64RI;
2698 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002699 return in_mem ? kX86And32MI : kX86And32RI;
2700 case Instruction::OR_LONG:
2701 case Instruction::OR_LONG_2ADDR:
2702 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002703 if (is64Bit) {
2704 return in_mem ? kX86Or64MI8 : kX86Or64RI8;
2705 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002706 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
2707 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002708 if (is64Bit) {
2709 return in_mem ? kX86Or64MI : kX86Or64RI;
2710 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002711 return in_mem ? kX86Or32MI : kX86Or32RI;
2712 case Instruction::XOR_LONG:
2713 case Instruction::XOR_LONG_2ADDR:
2714 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002715 if (is64Bit) {
2716 return in_mem ? kX86Xor64MI8 : kX86Xor64RI8;
2717 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002718 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
2719 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002720 if (is64Bit) {
2721 return in_mem ? kX86Xor64MI : kX86Xor64RI;
2722 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002723 return in_mem ? kX86Xor32MI : kX86Xor32RI;
2724 default:
2725 LOG(FATAL) << "Unexpected opcode: " << op;
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002726 UNREACHABLE();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002727 }
2728}
2729
Chao-ying Fua0147762014-06-06 18:38:49 -07002730bool X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002731 DCHECK(rl_src.is_const);
2732 int64_t val = mir_graph_->ConstantValueWide(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07002733
Elena Sayapinadd644502014-07-01 18:39:52 +07002734 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002735 // We can do with imm only if it fits 32 bit
2736 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2737 return false;
2738 }
2739
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002740 rl_dest = UpdateLocWideTyped(rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07002741
2742 if ((rl_dest.location == kLocDalvikFrame) ||
2743 (rl_dest.location == kLocCompilerTemp)) {
Ian Rogersb28c1c02014-11-08 11:21:21 -08002744 int r_base = rs_rX86_SP_32.GetReg();
Chao-ying Fua0147762014-06-06 18:38:49 -07002745 int displacement = SRegOffset(rl_dest.s_reg_low);
2746
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002747 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002748 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
2749 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val);
2750 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2751 true /* is_load */, true /* is64bit */);
2752 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2753 false /* is_load */, true /* is64bit */);
2754 return true;
2755 }
2756
2757 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2758 DCHECK_EQ(rl_result.location, kLocPhysReg);
2759 DCHECK(!rl_result.reg.IsFloat());
2760
2761 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2762 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2763
2764 StoreValueWide(rl_dest, rl_result);
2765 return true;
2766 }
2767
Mark Mendelle02d48f2014-01-15 11:19:23 -08002768 int32_t val_lo = Low32Bits(val);
2769 int32_t val_hi = High32Bits(val);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002770 rl_dest = UpdateLocWideTyped(rl_dest);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002771
2772 // Can we just do this into memory?
2773 if ((rl_dest.location == kLocDalvikFrame) ||
2774 (rl_dest.location == kLocCompilerTemp)) {
Ian Rogersb28c1c02014-11-08 11:21:21 -08002775 int r_base = rs_rX86_SP_32.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002776 int displacement = SRegOffset(rl_dest.s_reg_low);
2777
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002778 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002779 if (!IsNoOp(op, val_lo)) {
2780 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002781 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002782 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002783 true /* is_load */, true /* is64bit */);
2784 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002785 false /* is_load */, true /* is64bit */);
2786 }
2787 if (!IsNoOp(op, val_hi)) {
2788 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08002789 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002790 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002791 true /* is_load */, true /* is64bit */);
2792 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002793 false /* is_load */, true /* is64bit */);
2794 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002795 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002796 }
2797
2798 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2799 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee091cc402014-03-31 10:14:40 -07002800 DCHECK(!rl_result.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002801
2802 if (!IsNoOp(op, val_lo)) {
2803 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002804 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002805 }
2806 if (!IsNoOp(op, val_hi)) {
2807 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002808 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002809 }
2810 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002811 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002812}
2813
Chao-ying Fua0147762014-06-06 18:38:49 -07002814bool X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002815 RegLocation rl_src2, Instruction::Code op) {
2816 DCHECK(rl_src2.is_const);
2817 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002818
Elena Sayapinadd644502014-07-01 18:39:52 +07002819 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002820 // We can do with imm only if it fits 32 bit
2821 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2822 return false;
2823 }
2824 if (rl_dest.location == kLocPhysReg &&
2825 rl_src1.location == kLocPhysReg && !rl_dest.reg.IsFloat()) {
2826 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002827 OpRegCopy(rl_dest.reg, rl_src1.reg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002828 NewLIR2(x86op, rl_dest.reg.GetReg(), val);
2829 StoreFinalValueWide(rl_dest, rl_dest);
2830 return true;
2831 }
2832
2833 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2834 // We need the values to be in a temporary
2835 RegLocation rl_result = ForceTempWide(rl_src1);
2836
2837 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2838 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2839
2840 StoreFinalValueWide(rl_dest, rl_result);
2841 return true;
2842 }
2843
Mark Mendelle02d48f2014-01-15 11:19:23 -08002844 int32_t val_lo = Low32Bits(val);
2845 int32_t val_hi = High32Bits(val);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07002846 rl_dest = UpdateLocWideTyped(rl_dest);
2847 rl_src1 = UpdateLocWideTyped(rl_src1);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002848
2849 // Can we do this directly into the destination registers?
2850 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08002851 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
buzbee091cc402014-03-31 10:14:40 -07002852 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() && !rl_dest.reg.IsFloat()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002853 if (!IsNoOp(op, val_lo)) {
2854 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002855 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002856 }
2857 if (!IsNoOp(op, val_hi)) {
2858 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002859 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002860 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07002861
2862 StoreFinalValueWide(rl_dest, rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07002863 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002864 }
2865
2866 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2867 DCHECK_EQ(rl_src1.location, kLocPhysReg);
2868
2869 // We need the values to be in a temporary
2870 RegLocation rl_result = ForceTempWide(rl_src1);
2871 if (!IsNoOp(op, val_lo)) {
2872 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002873 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002874 }
2875 if (!IsNoOp(op, val_hi)) {
2876 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002877 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002878 }
2879
2880 StoreFinalValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002881 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07002882}
2883
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002884// For final classes there are no sub-classes to check and so we can answer the instance-of
2885// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
2886void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
2887 RegLocation rl_dest, RegLocation rl_src) {
buzbeea0cd2d72014-06-01 09:33:49 -07002888 RegLocation object = LoadValue(rl_src, kRefReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002889 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002890 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002891
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002892 // For 32-bit, SETcc only works with EAX..EDX.
Chao-ying Fua77ee512014-07-01 17:43:41 -07002893 RegStorage object_32reg = object.reg.Is64Bit() ? As32BitReg(object.reg) : object.reg;
Dmitry Petrochenko407f5c12014-07-01 01:21:38 +07002894 if (result_reg.GetRegNum() == object_32reg.GetRegNum() || !IsByteRegister(result_reg)) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002895 result_reg = AllocateByteRegister();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002896 }
2897
2898 // Assume that there is no match.
2899 LoadConstant(result_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -08002900 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, NULL);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002901
Mark Mendellade54a22014-06-09 12:49:55 -04002902 // We will use this register to compare to memory below.
2903 // References are 32 bit in memory, and 64 bit in registers (in 64 bit mode).
2904 // For this reason, force allocation of a 32 bit register to use, so that the
2905 // compare to memory will be done using a 32 bit comparision.
2906 // The LoadRefDisp(s) below will work normally, even in 64 bit mode.
2907 RegStorage check_class = AllocTemp();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002908
2909 // If Method* is already in a register, we can save a copy.
2910 RegLocation rl_method = mir_graph_->GetMethodLoc();
Andreas Gampeccc60262014-07-04 18:02:38 -07002911 int32_t offset_of_type = mirror::Array::DataOffset(
2912 sizeof(mirror::HeapReference<mirror::Class*>)).Int32Value() +
2913 (sizeof(mirror::HeapReference<mirror::Class*>) * type_idx);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002914
2915 if (rl_method.location == kLocPhysReg) {
2916 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002917 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002918 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002919 } else {
buzbee695d13a2014-04-19 13:32:20 -07002920 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002921 check_class, kNotVolatile);
2922 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002923 }
2924 } else {
2925 LoadCurrMethodDirect(check_class);
2926 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002927 LoadRefDisp(check_class, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002928 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002929 } else {
buzbee695d13a2014-04-19 13:32:20 -07002930 LoadRefDisp(check_class, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002931 check_class, kNotVolatile);
2932 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002933 }
2934 }
2935
2936 // Compare the computed class to the class in the object.
2937 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08002938 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002939
2940 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08002941 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002942
2943 LIR* target = NewLIR0(kPseudoTargetLabel);
2944 null_branchover->target = target;
2945 FreeTemp(check_class);
2946 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002947 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002948 FreeTemp(result_reg);
2949 }
2950 StoreValue(rl_dest, rl_result);
2951}
2952
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002953void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07002954 RegLocation rl_lhs, RegLocation rl_rhs, int flags) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002955 OpKind op = kOpBkpt;
2956 bool is_div_rem = false;
2957 bool unary = false;
2958 bool shift_op = false;
2959 bool is_two_addr = false;
2960 RegLocation rl_result;
2961 switch (opcode) {
2962 case Instruction::NEG_INT:
2963 op = kOpNeg;
2964 unary = true;
2965 break;
2966 case Instruction::NOT_INT:
2967 op = kOpMvn;
2968 unary = true;
2969 break;
2970 case Instruction::ADD_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::ADD_INT:
2974 op = kOpAdd;
2975 break;
2976 case Instruction::SUB_INT_2ADDR:
2977 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002978 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002979 case Instruction::SUB_INT:
2980 op = kOpSub;
2981 break;
2982 case Instruction::MUL_INT_2ADDR:
2983 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002984 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002985 case Instruction::MUL_INT:
2986 op = kOpMul;
2987 break;
2988 case Instruction::DIV_INT_2ADDR:
2989 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002990 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002991 case Instruction::DIV_INT:
2992 op = kOpDiv;
2993 is_div_rem = true;
2994 break;
2995 /* NOTE: returns in kArg1 */
2996 case Instruction::REM_INT_2ADDR:
2997 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002998 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002999 case Instruction::REM_INT:
3000 op = kOpRem;
3001 is_div_rem = true;
3002 break;
3003 case Instruction::AND_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::AND_INT:
3007 op = kOpAnd;
3008 break;
3009 case Instruction::OR_INT_2ADDR:
3010 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003011 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003012 case Instruction::OR_INT:
3013 op = kOpOr;
3014 break;
3015 case Instruction::XOR_INT_2ADDR:
3016 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003017 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003018 case Instruction::XOR_INT:
3019 op = kOpXor;
3020 break;
3021 case Instruction::SHL_INT_2ADDR:
3022 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003023 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003024 case Instruction::SHL_INT:
3025 shift_op = true;
3026 op = kOpLsl;
3027 break;
3028 case Instruction::SHR_INT_2ADDR:
3029 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003030 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003031 case Instruction::SHR_INT:
3032 shift_op = true;
3033 op = kOpAsr;
3034 break;
3035 case Instruction::USHR_INT_2ADDR:
3036 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003037 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003038 case Instruction::USHR_INT:
3039 shift_op = true;
3040 op = kOpLsr;
3041 break;
3042 default:
3043 LOG(FATAL) << "Invalid word arith op: " << opcode;
3044 }
3045
Mark Mendelle87f9b52014-04-30 14:13:18 -04003046 // Can we convert to a two address instruction?
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003047 if (!is_two_addr &&
3048 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3049 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04003050 is_two_addr = true;
3051 }
3052
3053 if (!GenerateTwoOperandInstructions()) {
3054 is_two_addr = false;
3055 }
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003056
3057 // Get the div/rem stuff out of the way.
3058 if (is_div_rem) {
Razvan A Lupusoru5c5676b2014-09-29 16:42:11 -07003059 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, flags);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003060 StoreValue(rl_dest, rl_result);
3061 return;
3062 }
3063
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003064 // If we generate any memory access below, it will reference a dalvik reg.
3065 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
3066
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003067 if (unary) {
3068 rl_lhs = LoadValue(rl_lhs, kCoreReg);
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003069 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003070 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003071 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003072 } else {
3073 if (shift_op) {
3074 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003075 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003076 LoadValueDirectFixed(rl_rhs, t_reg);
3077 if (is_two_addr) {
3078 // Can we do this directly into memory?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003079 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003080 if (rl_result.location != kLocPhysReg) {
3081 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08003082 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003083 FreeTemp(t_reg);
3084 return;
buzbee091cc402014-03-31 10:14:40 -07003085 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003086 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08003087 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003088 FreeTemp(t_reg);
3089 StoreFinalValue(rl_dest, rl_result);
3090 return;
3091 }
3092 }
3093 // Three address form, or we can't do directly.
3094 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3095 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003096 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003097 FreeTemp(t_reg);
3098 } else {
3099 // Multiply is 3 operand only (sort of).
3100 if (is_two_addr && op != kOpMul) {
3101 // Can we do this directly into memory?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003102 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003103 if (rl_result.location == kLocPhysReg) {
Serguei Katkov366f8ae2014-04-15 16:55:26 +07003104 // Ensure res is in a core reg
3105 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003106 // Can we do this from memory directly?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003107 rl_rhs = UpdateLocTyped(rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003108 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08003109 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003110 StoreFinalValue(rl_dest, rl_result);
3111 return;
buzbee091cc402014-03-31 10:14:40 -07003112 } else if (!rl_rhs.reg.IsFloat()) {
buzbee2700f7e2014-03-07 09:46:20 -08003113 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003114 StoreFinalValue(rl_dest, rl_result);
3115 return;
3116 }
3117 }
3118 rl_rhs = LoadValue(rl_rhs, kCoreReg);
Serguei Katkovd293fb42014-05-19 15:45:42 +07003119 // It might happen rl_rhs and rl_dest are the same VR
3120 // in this case rl_dest is in reg after LoadValue while
3121 // rl_result is not updated yet, so do this
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003122 rl_result = UpdateLocTyped(rl_dest);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003123 if (rl_result.location != kLocPhysReg) {
3124 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00003125 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003126 return;
buzbee091cc402014-03-31 10:14:40 -07003127 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003128 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08003129 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003130 StoreFinalValue(rl_dest, rl_result);
3131 return;
3132 } else {
3133 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3134 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003135 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003136 }
3137 } else {
3138 // Try to use reg/memory instructions.
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003139 rl_lhs = UpdateLocTyped(rl_lhs);
3140 rl_rhs = UpdateLocTyped(rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003141 // We can't optimize with FP registers.
3142 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
3143 // Something is difficult, so fall back to the standard case.
3144 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3145 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3146 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003147 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003148 } else {
3149 // We can optimize by moving to result and using memory operands.
3150 if (rl_rhs.location != kLocPhysReg) {
3151 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07003152 // We should be careful with order here
3153 // If rl_dest and rl_lhs points to the same VR we should load first
3154 // If the are different we should find a register first for dest
Chao-ying Fua0147762014-06-06 18:38:49 -07003155 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3156 mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
Serguei Katkov66da1362014-03-14 13:33:33 +07003157 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3158 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendelle87f9b52014-04-30 14:13:18 -04003159 // No-op if these are the same.
3160 OpRegCopy(rl_result.reg, rl_lhs.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003161 } else {
3162 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003163 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003164 }
buzbee2700f7e2014-03-07 09:46:20 -08003165 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003166 } else if (rl_lhs.location != kLocPhysReg) {
3167 // RHS is in a register; LHS is in memory.
3168 if (op != kOpSub) {
3169 // Force RHS into result and operate on memory.
3170 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003171 OpRegCopy(rl_result.reg, rl_rhs.reg);
3172 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003173 } else {
3174 // Subtraction isn't commutative.
3175 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3176 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3177 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003178 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003179 }
3180 } else {
3181 // Both are in registers.
3182 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3183 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3184 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003185 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003186 }
3187 }
3188 }
3189 }
3190 }
3191 StoreValue(rl_dest, rl_result);
3192}
3193
3194bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
3195 // If we have non-core registers, then we can't do good things.
buzbee091cc402014-03-31 10:14:40 -07003196 if (rl_lhs.location == kLocPhysReg && rl_lhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003197 return false;
3198 }
buzbee091cc402014-03-31 10:14:40 -07003199 if (rl_rhs.location == kLocPhysReg && rl_rhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003200 return false;
3201 }
3202
3203 // Everything will be fine :-).
3204 return true;
3205}
Chao-ying Fua0147762014-06-06 18:38:49 -07003206
3207void X86Mir2Lir::GenIntToLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003208 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07003209 Mir2Lir::GenIntToLong(rl_dest, rl_src);
3210 return;
3211 }
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003212 rl_src = UpdateLocTyped(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07003213 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
3214 if (rl_src.location == kLocPhysReg) {
3215 NewLIR2(kX86MovsxdRR, rl_result.reg.GetReg(), rl_src.reg.GetReg());
3216 } else {
3217 int displacement = SRegOffset(rl_src.s_reg_low);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003218 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Ian Rogersb28c1c02014-11-08 11:21:21 -08003219 LIR *m = NewLIR3(kX86MovsxdRM, rl_result.reg.GetReg(), rs_rX86_SP_32.GetReg(),
Chao-ying Fua0147762014-06-06 18:38:49 -07003220 displacement + LOWORD_OFFSET);
3221 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
3222 true /* is_load */, true /* is_64bit */);
3223 }
3224 StoreValueWide(rl_dest, rl_result);
3225}
3226
Yevgeny Rouban6af82062014-11-26 18:11:54 +06003227void X86Mir2Lir::GenLongToInt(RegLocation rl_dest, RegLocation rl_src) {
3228 rl_src = UpdateLocWide(rl_src);
3229 rl_src = NarrowRegLoc(rl_src);
3230 StoreValue(rl_dest, rl_src);
3231
3232 if (cu_->target64) {
3233 // if src and dest are in the same phys reg then StoreValue generates
3234 // no operation but we need explicit 32-bit mov R, R to clear
3235 // the higher 32-bits
3236 rl_dest = UpdateLoc(rl_dest);
3237 if (rl_src.location == kLocPhysReg && rl_dest.location == kLocPhysReg
3238 && IsSameReg(rl_src.reg, rl_dest.reg)) {
3239 LIR* copy_lir = OpRegCopyNoInsert(rl_dest.reg, rl_dest.reg);
3240 // remove nop flag set by OpRegCopyNoInsert if src == dest
3241 copy_lir->flags.is_nop = false;
3242 AppendLIR(copy_lir);
3243 }
3244 }
3245}
3246
Chao-ying Fua0147762014-06-06 18:38:49 -07003247void X86Mir2Lir::GenShiftOpLong(Instruction::Code opcode, RegLocation rl_dest,
3248 RegLocation rl_src1, RegLocation rl_shift) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003249 if (!cu_->target64) {
Yixin Shouf40f8902014-08-14 14:10:32 -04003250 // Long shift operations in 32-bit. Use shld or shrd to create a 32-bit register filled from
3251 // the other half, shift the other half, if the shift amount is less than 32 we're done,
3252 // otherwise move one register to the other and place zero or sign bits in the other.
3253 LIR* branch;
3254 FlushAllRegs();
3255 LockCallTemps();
3256 LoadValueDirectFixed(rl_shift, rs_rCX);
3257 RegStorage r_tmp = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
3258 LoadValueDirectWideFixed(rl_src1, r_tmp);
3259 switch (opcode) {
3260 case Instruction::SHL_LONG:
3261 case Instruction::SHL_LONG_2ADDR:
3262 NewLIR3(kX86Shld32RRC, r_tmp.GetHighReg(), r_tmp.GetLowReg(), rs_rCX.GetReg());
3263 NewLIR2(kX86Sal32RC, r_tmp.GetLowReg(), rs_rCX.GetReg());
3264 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3265 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3266 OpRegCopy(r_tmp.GetHigh(), r_tmp.GetLow());
3267 LoadConstant(r_tmp.GetLow(), 0);
3268 branch->target = NewLIR0(kPseudoTargetLabel);
3269 break;
3270 case Instruction::SHR_LONG:
3271 case Instruction::SHR_LONG_2ADDR:
3272 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(), rs_rCX.GetReg());
3273 NewLIR2(kX86Sar32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3274 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3275 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3276 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3277 NewLIR2(kX86Sar32RI, r_tmp.GetHighReg(), 31);
3278 branch->target = NewLIR0(kPseudoTargetLabel);
3279 break;
3280 case Instruction::USHR_LONG:
3281 case Instruction::USHR_LONG_2ADDR:
3282 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(),
3283 rs_rCX.GetReg());
3284 NewLIR2(kX86Shr32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3285 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3286 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3287 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3288 LoadConstant(r_tmp.GetHigh(), 0);
3289 branch->target = NewLIR0(kPseudoTargetLabel);
3290 break;
3291 default:
3292 LOG(FATAL) << "Unexpected case: " << opcode;
3293 return;
3294 }
3295 RegLocation rl_result = LocCReturnWide();
3296 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07003297 return;
3298 }
3299
3300 bool is_two_addr = false;
3301 OpKind op = kOpBkpt;
3302 RegLocation rl_result;
3303
3304 switch (opcode) {
3305 case Instruction::SHL_LONG_2ADDR:
3306 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003307 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003308 case Instruction::SHL_LONG:
3309 op = kOpLsl;
3310 break;
3311 case Instruction::SHR_LONG_2ADDR:
3312 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003313 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003314 case Instruction::SHR_LONG:
3315 op = kOpAsr;
3316 break;
3317 case Instruction::USHR_LONG_2ADDR:
3318 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003319 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003320 case Instruction::USHR_LONG:
3321 op = kOpLsr;
3322 break;
3323 default:
3324 op = kOpBkpt;
3325 }
3326
3327 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003328 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Chao-ying Fua0147762014-06-06 18:38:49 -07003329 LoadValueDirectFixed(rl_shift, t_reg);
3330 if (is_two_addr) {
3331 // Can we do this directly into memory?
Ian Rogers6a3c1fc2014-10-31 00:33:20 -07003332 rl_result = UpdateLocWideTyped(rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07003333 if (rl_result.location != kLocPhysReg) {
3334 // Okay, we can do this into memory
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003335 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003336 OpMemReg(op, rl_result, t_reg.GetReg());
3337 } else if (!rl_result.reg.IsFloat()) {
3338 // Can do this directly into the result register
3339 OpRegReg(op, rl_result.reg, t_reg);
3340 StoreFinalValueWide(rl_dest, rl_result);
3341 }
3342 } else {
3343 // Three address form, or we can't do directly.
3344 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
3345 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
3346 OpRegRegReg(op, rl_result.reg, rl_src1.reg, t_reg);
3347 StoreFinalValueWide(rl_dest, rl_result);
3348 }
3349
3350 FreeTemp(t_reg);
3351}
3352
Brian Carlstrom7940e442013-07-12 13:46:57 -07003353} // namespace art