blob: 3ca85bf96a7845152faa94b1ec21a500e2e1903f [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"
Brian Carlstrom7940e442013-07-12 13:46:57 -070023#include "mirror/array.h"
24#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,
211 int 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) {
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800271 RegLocation rl_result;
272 RegLocation rl_src = mir_graph_->GetSrc(mir, 0);
273 RegLocation rl_dest = mir_graph_->GetDest(mir);
buzbeea0cd2d72014-06-01 09:33:49 -0700274 // Avoid using float regs here.
275 RegisterClass src_reg_class = rl_src.ref ? kRefReg : kCoreReg;
276 RegisterClass result_reg_class = rl_dest.ref ? kRefReg : kCoreReg;
Vladimir Markoa1a70742014-03-03 10:28:05 +0000277 ConditionCode ccode = mir->meta.ccode;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800278
279 // The kMirOpSelect has two variants, one for constants and one for moves.
280 const bool is_constant_case = (mir->ssa_rep->num_uses == 1);
281
282 if (is_constant_case) {
283 int true_val = mir->dalvikInsn.vB;
284 int false_val = mir->dalvikInsn.vC;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800285
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700286 // simplest strange case
287 if (true_val == false_val) {
288 rl_result = EvalLoc(rl_dest, result_reg_class, true);
289 LoadConstantNoClobber(rl_result.reg, true_val);
290 } else {
291 // TODO: use GenSelectConst32 and handle additional opcode patterns such as
292 // "cmp; setcc; movzx" or "cmp; sbb r0,r0; and r0,$mask; add r0,$literal".
293 rl_src = LoadValue(rl_src, src_reg_class);
294 rl_result = EvalLoc(rl_dest, result_reg_class, true);
295 /*
296 * For ccode == kCondEq:
297 *
298 * 1) When the true case is zero and result_reg is not same as src_reg:
299 * xor result_reg, result_reg
300 * cmp $0, src_reg
301 * mov t1, $false_case
302 * cmovnz result_reg, t1
303 * 2) When the false case is zero and result_reg is not same as src_reg:
304 * xor result_reg, result_reg
305 * cmp $0, src_reg
306 * mov t1, $true_case
307 * cmovz result_reg, t1
308 * 3) All other cases (we do compare first to set eflags):
309 * cmp $0, src_reg
310 * mov result_reg, $false_case
311 * mov t1, $true_case
312 * cmovz result_reg, t1
313 */
314 // FIXME: depending on how you use registers you could get a false != mismatch when dealing
315 // with different views of the same underlying physical resource (i.e. solo32 vs. solo64).
316 const bool result_reg_same_as_src =
317 (rl_src.location == kLocPhysReg && rl_src.reg.GetRegNum() == rl_result.reg.GetRegNum());
318 const bool true_zero_case = (true_val == 0 && false_val != 0 && !result_reg_same_as_src);
319 const bool false_zero_case = (false_val == 0 && true_val != 0 && !result_reg_same_as_src);
320 const bool catch_all_case = !(true_zero_case || false_zero_case);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800321
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700322 if (true_zero_case || false_zero_case) {
323 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
324 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800325
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700326 if (true_zero_case || false_zero_case || catch_all_case) {
327 OpRegImm(kOpCmp, rl_src.reg, 0);
328 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800329
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700330 if (catch_all_case) {
331 OpRegImm(kOpMov, rl_result.reg, false_val);
332 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800333
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700334 if (true_zero_case || false_zero_case || catch_all_case) {
335 ConditionCode cc = true_zero_case ? NegateComparison(ccode) : ccode;
336 int immediateForTemp = true_zero_case ? false_val : true_val;
337 RegStorage temp1_reg = AllocTypedTemp(false, result_reg_class);
338 OpRegImm(kOpMov, temp1_reg, immediateForTemp);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800339
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700340 OpCondRegReg(kOpCmov, cc, rl_result.reg, temp1_reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800341
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700342 FreeTemp(temp1_reg);
343 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800344 }
345 } else {
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700346 rl_src = LoadValue(rl_src, src_reg_class);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800347 RegLocation rl_true = mir_graph_->GetSrc(mir, 1);
348 RegLocation rl_false = mir_graph_->GetSrc(mir, 2);
buzbeea0cd2d72014-06-01 09:33:49 -0700349 rl_true = LoadValue(rl_true, result_reg_class);
350 rl_false = LoadValue(rl_false, result_reg_class);
351 rl_result = EvalLoc(rl_dest, result_reg_class, true);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800352
353 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000354 * For ccode == kCondEq:
355 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800356 * 1) When true case is already in place:
357 * cmp $0, src_reg
358 * cmovnz result_reg, false_reg
359 * 2) When false case is already in place:
360 * cmp $0, src_reg
361 * cmovz result_reg, true_reg
362 * 3) When neither cases are in place:
363 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000364 * mov result_reg, false_reg
365 * cmovz result_reg, true_reg
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800366 */
367
368 // kMirOpSelect is generated just for conditional cases when comparison is done with zero.
buzbee2700f7e2014-03-07 09:46:20 -0800369 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800370
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000371 if (rl_result.reg.GetReg() == rl_true.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800372 OpCondRegReg(kOpCmov, NegateComparison(ccode), rl_result.reg, rl_false.reg);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000373 } else if (rl_result.reg.GetReg() == rl_false.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800374 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800375 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800376 OpRegCopy(rl_result.reg, rl_false.reg);
377 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800378 }
379 }
380
381 StoreValue(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700382}
383
384void X86Mir2Lir::GenFusedLongCmpBranch(BasicBlock* bb, MIR* mir) {
buzbee0d829482013-10-11 15:24:55 -0700385 LIR* taken = &block_label_list_[bb->taken];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700386 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
387 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
Vladimir Markoa8946072014-01-22 10:30:44 +0000388 ConditionCode ccode = mir->meta.ccode;
Mark Mendell412d4f82013-12-18 13:32:36 -0800389
390 if (rl_src1.is_const) {
391 std::swap(rl_src1, rl_src2);
392 ccode = FlipComparisonOrder(ccode);
393 }
394 if (rl_src2.is_const) {
395 // Do special compare/branch against simple const operand
396 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
397 GenFusedLongCmpImmBranch(bb, rl_src1, val, ccode);
398 return;
399 }
400
Elena Sayapinadd644502014-07-01 18:39:52 +0700401 if (cu_->target64) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700402 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
403 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
404
405 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
406 OpCondBranch(ccode, taken);
407 return;
408 }
409
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700410 // Prepare for explicit register usage
411 ExplicitTempRegisterLock(this, 4, &rs_r0, &rs_r1, &rs_r2, &rs_r3);
buzbee091cc402014-03-31 10:14:40 -0700412 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
413 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -0800414 LoadValueDirectWideFixed(rl_src1, r_tmp1);
415 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700416
Brian Carlstrom7940e442013-07-12 13:46:57 -0700417 // Swap operands and condition code to prevent use of zero flag.
418 if (ccode == kCondLe || ccode == kCondGt) {
419 // Compute (r3:r2) = (r3:r2) - (r1:r0)
buzbee2700f7e2014-03-07 09:46:20 -0800420 OpRegReg(kOpSub, rs_r2, rs_r0); // r2 = r2 - r0
421 OpRegReg(kOpSbc, rs_r3, rs_r1); // r3 = r3 - r1 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700422 } else {
423 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -0800424 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
425 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700426 }
427 switch (ccode) {
428 case kCondEq:
429 case kCondNe:
buzbee2700f7e2014-03-07 09:46:20 -0800430 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = r0 | r1
Brian Carlstrom7940e442013-07-12 13:46:57 -0700431 break;
432 case kCondLe:
433 ccode = kCondGe;
434 break;
435 case kCondGt:
436 ccode = kCondLt;
437 break;
438 case kCondLt:
439 case kCondGe:
440 break;
441 default:
442 LOG(FATAL) << "Unexpected ccode: " << ccode;
443 }
444 OpCondBranch(ccode, taken);
445}
446
Mark Mendell412d4f82013-12-18 13:32:36 -0800447void X86Mir2Lir::GenFusedLongCmpImmBranch(BasicBlock* bb, RegLocation rl_src1,
448 int64_t val, ConditionCode ccode) {
449 int32_t val_lo = Low32Bits(val);
450 int32_t val_hi = High32Bits(val);
451 LIR* taken = &block_label_list_[bb->taken];
Mark Mendell412d4f82013-12-18 13:32:36 -0800452 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Mark Mendell752e2052014-05-01 10:19:04 -0400453 bool is_equality_test = ccode == kCondEq || ccode == kCondNe;
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700454
Elena Sayapinadd644502014-07-01 18:39:52 +0700455 if (cu_->target64) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700456 if (is_equality_test && val == 0) {
457 // We can simplify of comparing for ==, != to 0.
458 NewLIR2(kX86Test64RR, rl_src1.reg.GetReg(), rl_src1.reg.GetReg());
459 } else if (is_equality_test && val_hi == 0 && val_lo > 0) {
460 OpRegImm(kOpCmp, rl_src1.reg, val_lo);
461 } else {
462 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
463 LoadConstantWide(tmp, val);
464 OpRegReg(kOpCmp, rl_src1.reg, tmp);
465 FreeTemp(tmp);
466 }
467 OpCondBranch(ccode, taken);
468 return;
469 }
470
Mark Mendell752e2052014-05-01 10:19:04 -0400471 if (is_equality_test && val != 0) {
472 rl_src1 = ForceTempWide(rl_src1);
473 }
buzbee2700f7e2014-03-07 09:46:20 -0800474 RegStorage low_reg = rl_src1.reg.GetLow();
475 RegStorage high_reg = rl_src1.reg.GetHigh();
Mark Mendell412d4f82013-12-18 13:32:36 -0800476
Mark Mendell752e2052014-05-01 10:19:04 -0400477 if (is_equality_test) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700478 // We can simplify of comparing for ==, != to 0.
Mark Mendell752e2052014-05-01 10:19:04 -0400479 if (val == 0) {
480 if (IsTemp(low_reg)) {
481 OpRegReg(kOpOr, low_reg, high_reg);
482 // We have now changed it; ignore the old values.
483 Clobber(rl_src1.reg);
484 } else {
485 RegStorage t_reg = AllocTemp();
486 OpRegRegReg(kOpOr, t_reg, low_reg, high_reg);
487 FreeTemp(t_reg);
488 }
489 OpCondBranch(ccode, taken);
490 return;
491 }
492
493 // Need to compute the actual value for ==, !=.
494 OpRegImm(kOpSub, low_reg, val_lo);
495 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
496 OpRegReg(kOpOr, high_reg, low_reg);
497 Clobber(rl_src1.reg);
498 } else if (ccode == kCondLe || ccode == kCondGt) {
499 // Swap operands and condition code to prevent use of zero flag.
500 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
501 LoadConstantWide(tmp, val);
502 OpRegReg(kOpSub, tmp.GetLow(), low_reg);
503 OpRegReg(kOpSbc, tmp.GetHigh(), high_reg);
504 ccode = (ccode == kCondLe) ? kCondGe : kCondLt;
505 FreeTemp(tmp);
506 } else {
507 // We can use a compare for the low word to set CF.
508 OpRegImm(kOpCmp, low_reg, val_lo);
509 if (IsTemp(high_reg)) {
510 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
511 // We have now changed it; ignore the old values.
512 Clobber(rl_src1.reg);
513 } else {
514 // mov temp_reg, high_reg; sbb temp_reg, high_constant
515 RegStorage t_reg = AllocTemp();
516 OpRegCopy(t_reg, high_reg);
517 NewLIR2(kX86Sbb32RI, t_reg.GetReg(), val_hi);
518 FreeTemp(t_reg);
519 }
Mark Mendell412d4f82013-12-18 13:32:36 -0800520 }
521
Mark Mendell752e2052014-05-01 10:19:04 -0400522 OpCondBranch(ccode, taken);
Mark Mendell412d4f82013-12-18 13:32:36 -0800523}
524
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700525void X86Mir2Lir::CalculateMagicAndShift(int64_t divisor, int64_t& magic, int& shift, bool is_long) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800526 // It does not make sense to calculate magic and shift for zero divisor.
527 DCHECK_NE(divisor, 0);
528
529 /* According to H.S.Warren's Hacker's Delight Chapter 10 and
530 * T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
531 * The magic number M and shift S can be calculated in the following way:
532 * Let nc be the most positive value of numerator(n) such that nc = kd - 1,
533 * where divisor(d) >=2.
534 * Let nc be the most negative value of numerator(n) such that nc = kd + 1,
535 * where divisor(d) <= -2.
536 * Thus nc can be calculated like:
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700537 * nc = exp + exp % d - 1, where d >= 2 and exp = 2^31 for int or 2^63 for long
538 * 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 -0800539 *
540 * So the shift p is the smallest p satisfying
541 * 2^p > nc * (d - 2^p % d), where d >= 2
542 * 2^p > nc * (d + 2^p % d), where d <= -2.
543 *
544 * the magic number M is calcuated by
545 * M = (2^p + d - 2^p % d) / d, where d >= 2
546 * M = (2^p - d - 2^p % d) / d, where d <= -2.
547 *
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700548 * 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 -0800549 * the shift number S.
550 */
551
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700552 int64_t p = (is_long) ? 63 : 31;
553 const uint64_t exp = (is_long) ? 0x8000000000000000ULL : 0x80000000U;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800554
555 // Initialize the computations.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700556 uint64_t abs_d = (divisor >= 0) ? divisor : -divisor;
557 uint64_t tmp = exp + ((is_long) ? static_cast<uint64_t>(divisor) >> 63 :
558 static_cast<uint32_t>(divisor) >> 31);
559 uint64_t abs_nc = tmp - 1 - tmp % abs_d;
560 uint64_t quotient1 = exp / abs_nc;
561 uint64_t remainder1 = exp % abs_nc;
562 uint64_t quotient2 = exp / abs_d;
563 uint64_t remainder2 = exp % abs_d;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800564
565 /*
566 * To avoid handling both positive and negative divisor, Hacker's Delight
567 * introduces a method to handle these 2 cases together to avoid duplication.
568 */
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700569 uint64_t delta;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800570 do {
571 p++;
572 quotient1 = 2 * quotient1;
573 remainder1 = 2 * remainder1;
574 if (remainder1 >= abs_nc) {
575 quotient1++;
576 remainder1 = remainder1 - abs_nc;
577 }
578 quotient2 = 2 * quotient2;
579 remainder2 = 2 * remainder2;
580 if (remainder2 >= abs_d) {
581 quotient2++;
582 remainder2 = remainder2 - abs_d;
583 }
584 delta = abs_d - remainder2;
585 } while (quotient1 < delta || (quotient1 == delta && remainder1 == 0));
586
587 magic = (divisor > 0) ? (quotient2 + 1) : (-quotient2 - 1);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700588
589 if (!is_long) {
590 magic = static_cast<int>(magic);
591 }
592
593 shift = (is_long) ? p - 64 : p - 32;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800594}
595
buzbee2700f7e2014-03-07 09:46:20 -0800596RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegStorage reg_lo, int lit, bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700597 LOG(FATAL) << "Unexpected use of GenDivRemLit for x86";
598 return rl_dest;
599}
600
Mark Mendell2bf31e62014-01-23 12:13:40 -0800601RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegLocation rl_src,
602 int imm, bool is_div) {
603 // Use a multiply (and fixup) to perform an int div/rem by a constant.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700604 RegLocation rl_result;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800605
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700606 if (imm == 1) {
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700607 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800608 if (is_div) {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700609 // x / 1 == x.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700610 LoadValueDirectFixed(rl_src, rl_result.reg);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700611 } else {
612 // x % 1 == 0.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700613 LoadConstantNoClobber(rl_result.reg, 0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700614 }
615 } else if (imm == -1) { // handle 0x80000000 / -1 special case.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700616 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700617 if (is_div) {
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700618 LoadValueDirectFixed(rl_src, rl_result.reg);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400619
620 // Check if numerator is 0
621 OpRegImm(kOpCmp, rl_result.reg, 0);
622 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
623
624 // handle 0x80000000 / -1
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700625 OpRegImm(kOpCmp, rl_result.reg, 0x80000000);
626 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800627
628 // for x != MIN_INT, x / -1 == -x.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700629 NewLIR1(kX86Neg32R, rl_result.reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800630
Mark Mendell2bf31e62014-01-23 12:13:40 -0800631 // EAX already contains the right value (0x80000000),
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700632 minint_branch->target = NewLIR0(kPseudoTargetLabel);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400633 branch->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800634 } else {
635 // x % -1 == 0.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700636 LoadConstantNoClobber(rl_result.reg, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800637 }
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700638 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
639 // Division using shifting.
640 rl_src = LoadValue(rl_src, kCoreReg);
641 rl_result = EvalLoc(rl_dest, kCoreReg, true);
642 if (IsSameReg(rl_result.reg, rl_src.reg)) {
643 RegStorage rs_temp = AllocTypedTemp(false, kCoreReg);
644 rl_result.reg.SetReg(rs_temp.GetReg());
645 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400646
647 // Check if numerator is 0
648 OpRegImm(kOpCmp, rl_src.reg, 0);
649 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
650 LoadConstantNoClobber(rl_result.reg, 0);
651 LIR* done = NewLIR1(kX86Jmp8, 0);
652 branch->target = NewLIR0(kPseudoTargetLabel);
653
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700654 NewLIR3(kX86Lea32RM, rl_result.reg.GetReg(), rl_src.reg.GetReg(), std::abs(imm) - 1);
655 NewLIR2(kX86Test32RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
656 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
657 int shift_amount = LowestSetBit(imm);
658 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
659 if (imm < 0) {
660 OpReg(kOpNeg, rl_result.reg);
661 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400662 done->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800663 } else {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700664 CHECK(imm <= -2 || imm >= 2);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700665
Mark Mendell2bf31e62014-01-23 12:13:40 -0800666 // Use H.S.Warren's Hacker's Delight Chapter 10 and
667 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700668 int64_t magic;
669 int shift;
670 CalculateMagicAndShift((int64_t)imm, magic, shift, false /* is_long */);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800671
672 /*
673 * For imm >= 2,
674 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
675 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
676 * For imm <= -2,
677 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
678 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
679 * We implement this algorithm in the following way:
680 * 1. multiply magic number m and numerator n, get the higher 32bit result in EDX
681 * 2. if imm > 0 and magic < 0, add numerator to EDX
682 * if imm < 0 and magic > 0, sub numerator from EDX
683 * 3. if S !=0, SAR S bits for EDX
684 * 4. add 1 to EDX if EDX < 0
685 * 5. Thus, EDX is the quotient
686 */
687
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700688 FlushReg(rs_r0);
689 Clobber(rs_r0);
690 LockTemp(rs_r0);
691 FlushReg(rs_r2);
692 Clobber(rs_r2);
693 LockTemp(rs_r2);
694
Mark Mendell3a91f442014-09-02 12:44:24 -0400695 // Assume that the result will be in EDX for divide, and EAX for remainder.
696 rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, is_div ? rs_r2 : rs_r0,
697 INVALID_SREG, INVALID_SREG};
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700698
Mark Mendell3a91f442014-09-02 12:44:24 -0400699 // We need the value at least twice. Load into a temp.
700 rl_src = LoadValue(rl_src, kCoreReg);
701 RegStorage numerator_reg = rl_src.reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800702
Mark Mendell3a91f442014-09-02 12:44:24 -0400703 // Check if numerator is 0.
704 OpRegImm(kOpCmp, numerator_reg, 0);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400705 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell3a91f442014-09-02 12:44:24 -0400706 // Return result 0 if numerator was 0.
707 LoadConstantNoClobber(rl_result.reg, 0);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400708 LIR* done = NewLIR1(kX86Jmp8, 0);
709 branch->target = NewLIR0(kPseudoTargetLabel);
710
Mark Mendell3a91f442014-09-02 12:44:24 -0400711 // EAX = magic.
712 LoadConstant(rs_r0, magic);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800713
Mark Mendell3a91f442014-09-02 12:44:24 -0400714 // EDX:EAX = magic * numerator.
715 NewLIR1(kX86Imul32DaR, numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800716
717 if (imm > 0 && magic < 0) {
718 // Add numerator to EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800719 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700720 NewLIR2(kX86Add32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800721 } else if (imm < 0 && magic > 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800722 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700723 NewLIR2(kX86Sub32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800724 }
725
726 // Do we need the shift?
727 if (shift != 0) {
728 // Shift EDX by 'shift' bits.
buzbee091cc402014-03-31 10:14:40 -0700729 NewLIR2(kX86Sar32RI, rs_r2.GetReg(), shift);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800730 }
731
732 // Add 1 to EDX if EDX < 0.
733
734 // Move EDX to EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800735 OpRegCopy(rs_r0, rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800736
737 // Move sign bit to bit 0, zeroing the rest.
buzbee091cc402014-03-31 10:14:40 -0700738 NewLIR2(kX86Shr32RI, rs_r2.GetReg(), 31);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800739
740 // EDX = EDX + EAX.
buzbee091cc402014-03-31 10:14:40 -0700741 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r0.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800742
743 // Quotient is in EDX.
744 if (!is_div) {
745 // We need to compute the remainder.
746 // Remainder is divisor - (quotient * imm).
buzbee2700f7e2014-03-07 09:46:20 -0800747 DCHECK(numerator_reg.Valid());
748 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800749
750 // EAX = numerator * imm.
buzbee2700f7e2014-03-07 09:46:20 -0800751 OpRegRegImm(kOpMul, rs_r2, rs_r2, imm);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800752
Mark Mendell3a91f442014-09-02 12:44:24 -0400753 // EAX -= EDX.
buzbee091cc402014-03-31 10:14:40 -0700754 NewLIR2(kX86Sub32RR, rs_r0.GetReg(), rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800755
756 // For this case, return the result in EAX.
Mark Mendell2bf31e62014-01-23 12:13:40 -0800757 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400758 done->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800759 }
760
761 return rl_result;
762}
763
buzbee2700f7e2014-03-07 09:46:20 -0800764RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegStorage reg_lo, RegStorage reg_hi,
765 bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700766 LOG(FATAL) << "Unexpected use of GenDivRem for x86";
767 return rl_dest;
768}
769
Mark Mendell2bf31e62014-01-23 12:13:40 -0800770RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegLocation rl_src1,
771 RegLocation rl_src2, bool is_div, bool check_zero) {
772 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700773
774 // Prepare for explicit register usage.
775 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800776
777 // Load LHS into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800778 LoadValueDirectFixed(rl_src1, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800779
780 // Load RHS into EBX.
buzbee2700f7e2014-03-07 09:46:20 -0800781 LoadValueDirectFixed(rl_src2, rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800782
783 // Copy LHS sign bit into EDX.
784 NewLIR0(kx86Cdq32Da);
785
786 if (check_zero) {
787 // Handle division by zero case.
Mingyao Yange643a172014-04-08 11:02:52 -0700788 GenDivZeroCheck(rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800789 }
790
Yixin Shou2ddd1752014-08-26 15:15:13 -0400791 // Check if numerator is 0
792 OpRegImm(kOpCmp, rs_r0, 0);
793 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
794
Mark Mendell2bf31e62014-01-23 12:13:40 -0800795 // Have to catch 0x80000000/-1 case, or we will get an exception!
buzbee2700f7e2014-03-07 09:46:20 -0800796 OpRegImm(kOpCmp, rs_r1, -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700797 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800798
799 // RHS is -1.
buzbee2700f7e2014-03-07 09:46:20 -0800800 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700801 LIR* minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800802
Yixin Shou2ddd1752014-08-26 15:15:13 -0400803 branch->target = NewLIR0(kPseudoTargetLabel);
804
Mark Mendell2bf31e62014-01-23 12:13:40 -0800805 // In 0x80000000/-1 case.
806 if (!is_div) {
807 // For DIV, EAX is already right. For REM, we need EDX 0.
buzbee2700f7e2014-03-07 09:46:20 -0800808 LoadConstantNoClobber(rs_r2, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800809 }
810 LIR* done = NewLIR1(kX86Jmp8, 0);
811
812 // Expected case.
813 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
814 minint_branch->target = minus_one_branch->target;
buzbee091cc402014-03-31 10:14:40 -0700815 NewLIR1(kX86Idivmod32DaR, rs_r1.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800816 done->target = NewLIR0(kPseudoTargetLabel);
817
818 // Result is in EAX for div and EDX for rem.
buzbee091cc402014-03-31 10:14:40 -0700819 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 -0800820 if (!is_div) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000821 rl_result.reg.SetReg(r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800822 }
823 return rl_result;
824}
825
Serban Constantinescu23abec92014-07-02 16:13:38 +0100826bool X86Mir2Lir::GenInlinedMinMax(CallInfo* info, bool is_min, bool is_long) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700827 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800828
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700829 if (is_long && !cu_->target64) {
830 /*
831 * We want to implement the following algorithm
832 * mov eax, low part of arg1
833 * mov edx, high part of arg1
834 * mov ebx, low part of arg2
835 * mov ecx, high part of arg2
836 * mov edi, eax
837 * sub edi, ebx
838 * mov edi, edx
839 * sbb edi, ecx
840 * is_min ? "cmovgel eax, ebx" : "cmovll eax, ebx"
841 * is_min ? "cmovgel edx, ecx" : "cmovll edx, ecx"
842 *
843 * The algorithm above needs 5 registers: a pair for the first operand
844 * (which later will be used as result), a pair for the second operand
845 * and a temp register (e.g. 'edi') for intermediate calculations.
846 * Ideally we have 6 GP caller-save registers in 32-bit mode. They are:
847 * 'eax', 'ebx', 'ecx', 'edx', 'esi' and 'edi'. So there should be
848 * always enough registers to operate on. Practically, there is a pair
849 * of registers 'edi' and 'esi' which holds promoted values and
850 * sometimes should be treated as 'callee save'. If one of the operands
851 * is in the promoted registers then we have enough register to
852 * operate on. Otherwise there is lack of resources and we have to
853 * save 'edi' before calculations and restore after.
854 */
855
856 RegLocation rl_src1 = info->args[0];
857 RegLocation rl_src2 = info->args[2];
858 RegLocation rl_dest = InlineTargetWide(info);
859 int res_vreg, src1_vreg, src2_vreg;
860
861 /*
862 * If the result register is the same as the second element, then we
863 * need to be careful. The reason is that the first copy will
864 * inadvertently clobber the second element with the first one thus
865 * yielding the wrong result. Thus we do a swap in that case.
866 */
867 res_vreg = mir_graph_->SRegToVReg(rl_dest.s_reg_low);
868 src2_vreg = mir_graph_->SRegToVReg(rl_src2.s_reg_low);
869 if (res_vreg == src2_vreg) {
870 std::swap(rl_src1, rl_src2);
871 }
872
873 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
874 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
875
876 // Pick the first integer as min/max.
877 OpRegCopyWide(rl_result.reg, rl_src1.reg);
878
879 /*
880 * If the integers are both in the same register, then there is
881 * nothing else to do because they are equal and we have already
882 * moved one into the result.
883 */
884 src1_vreg = mir_graph_->SRegToVReg(rl_src1.s_reg_low);
885 src2_vreg = mir_graph_->SRegToVReg(rl_src2.s_reg_low);
886 if (src1_vreg == src2_vreg) {
887 StoreValueWide(rl_dest, rl_result);
888 return true;
889 }
890
891 // Free registers to make some room for the second operand.
892 // But don't try to free ourselves or promoted registers.
893 if (res_vreg != src1_vreg &&
894 IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
895 FreeTemp(rl_src1.reg);
896 }
897 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
898
899 // Do we have a free register for intermediate calculations?
900 RegStorage tmp = AllocTemp(false);
901 if (tmp == RegStorage::InvalidReg()) {
902 /*
903 * No, will use 'edi'.
904 *
905 * As mentioned above we have 4 temporary and 2 promotable
906 * caller-save registers. Therefore, we assume that a free
907 * register can be allocated only if 'esi' and 'edi' are
908 * already used as operands. If number of promotable registers
909 * increases from 2 to 4 then our assumption fails and operand
910 * data is corrupted.
911 * Let's DCHECK it.
912 */
913 DCHECK(IsTemp(rl_src2.reg.GetLow()) &&
914 IsTemp(rl_src2.reg.GetHigh()) &&
915 IsTemp(rl_result.reg.GetLow()) &&
916 IsTemp(rl_result.reg.GetHigh()));
917 tmp = rs_rDI;
918 NewLIR1(kX86Push32R, tmp.GetReg());
919 }
920
921 // Now we are ready to do calculations.
922 OpRegReg(kOpMov, tmp, rl_result.reg.GetLow());
923 OpRegReg(kOpSub, tmp, rl_src2.reg.GetLow());
924 OpRegReg(kOpMov, tmp, rl_result.reg.GetHigh());
925 OpRegReg(kOpSbc, tmp, rl_src2.reg.GetHigh());
926
927 // Let's put pop 'edi' here to break a bit the dependency chain.
928 if (tmp == rs_rDI) {
929 NewLIR1(kX86Pop32R, tmp.GetReg());
930 }
931
932 // Conditionally move the other integer into the destination register.
933 ConditionCode cc = is_min ? kCondGe : kCondLt;
934 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetLow(), rl_src2.reg.GetLow());
935 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetHigh(), rl_src2.reg.GetHigh());
936 StoreValueWide(rl_dest, rl_result);
937 return true;
Serban Constantinescu23abec92014-07-02 16:13:38 +0100938 }
939
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800940 // Get the two arguments to the invoke and place them in GP registers.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700941 RegLocation rl_src1 = info->args[0];
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700942 RegLocation rl_src2 = (is_long) ? info->args[2] : info->args[1];
943 rl_src1 = (is_long) ? LoadValueWide(rl_src1, kCoreReg) : LoadValue(rl_src1, kCoreReg);
944 rl_src2 = (is_long) ? LoadValueWide(rl_src2, kCoreReg) : LoadValue(rl_src2, kCoreReg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800945
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700946 RegLocation rl_dest = (is_long) ? InlineTargetWide(info) : InlineTarget(info);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700947 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800948
949 /*
950 * If the result register is the same as the second element, then we need to be careful.
951 * The reason is that the first copy will inadvertently clobber the second element with
952 * the first one thus yielding the wrong result. Thus we do a swap in that case.
953 */
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000954 if (rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800955 std::swap(rl_src1, rl_src2);
956 }
957
958 // Pick the first integer as min/max.
buzbee2700f7e2014-03-07 09:46:20 -0800959 OpRegCopy(rl_result.reg, rl_src1.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800960
961 // If the integers are both in the same register, then there is nothing else to do
962 // because they are equal and we have already moved one into the result.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000963 if (rl_src1.reg.GetReg() != rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800964 // It is possible we didn't pick correctly so do the actual comparison now.
buzbee2700f7e2014-03-07 09:46:20 -0800965 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800966
967 // Conditionally move the other integer into the destination register.
968 ConditionCode condition_code = is_min ? kCondGt : kCondLt;
buzbee2700f7e2014-03-07 09:46:20 -0800969 OpCondRegReg(kOpCmov, condition_code, rl_result.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800970 }
971
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700972 if (is_long) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000973 StoreValueWide(rl_dest, rl_result);
974 } else {
Vladimir Markoe508a202013-11-04 15:24:22 +0000975 StoreValue(rl_dest, rl_result);
976 }
977 return true;
978}
979
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700980bool X86Mir2Lir::GenInlinedPeek(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +0700981 RegLocation rl_src_address = info->args[0]; // long address
982 RegLocation rl_address;
983 if (!cu_->target64) {
984 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
985 rl_address = LoadValue(rl_src_address, kCoreReg);
986 } else {
987 rl_address = LoadValueWide(rl_src_address, kCoreReg);
988 }
989 RegLocation rl_dest = size == k64 ? InlineTargetWide(info) : InlineTarget(info);
990 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
991 // Unaligned access is allowed on x86.
992 LoadBaseDisp(rl_address.reg, 0, rl_result.reg, size, kNotVolatile);
993 if (size == k64) {
994 StoreValueWide(rl_dest, rl_result);
995 } else {
996 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
997 StoreValue(rl_dest, rl_result);
998 }
999 return true;
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001000}
1001
Vladimir Markoe508a202013-11-04 15:24:22 +00001002bool X86Mir2Lir::GenInlinedPoke(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +07001003 RegLocation rl_src_address = info->args[0]; // long address
1004 RegLocation rl_address;
1005 if (!cu_->target64) {
1006 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
1007 rl_address = LoadValue(rl_src_address, kCoreReg);
1008 } else {
1009 rl_address = LoadValueWide(rl_src_address, kCoreReg);
1010 }
1011 RegLocation rl_src_value = info->args[2]; // [size] value
1012 RegLocation rl_value;
1013 if (size == k64) {
1014 // Unaligned access is allowed on x86.
1015 rl_value = LoadValueWide(rl_src_value, kCoreReg);
1016 } else {
1017 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
1018 // In 32-bit mode the only EAX..EDX registers can be used with Mov8MR.
1019 if (!cu_->target64 && size == kSignedByte) {
1020 rl_src_value = UpdateLocTyped(rl_src_value, kCoreReg);
1021 if (rl_src_value.location == kLocPhysReg && !IsByteRegister(rl_src_value.reg)) {
1022 RegStorage temp = AllocateByteRegister();
1023 OpRegCopy(temp, rl_src_value.reg);
1024 rl_value.reg = temp;
1025 } else {
1026 rl_value = LoadValue(rl_src_value, kCoreReg);
1027 }
1028 } else {
1029 rl_value = LoadValue(rl_src_value, kCoreReg);
1030 }
1031 }
1032 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size, kNotVolatile);
1033 return true;
Vladimir Markoe508a202013-11-04 15:24:22 +00001034}
1035
buzbee2700f7e2014-03-07 09:46:20 -08001036void X86Mir2Lir::OpLea(RegStorage r_base, RegStorage reg1, RegStorage reg2, int scale, int offset) {
1037 NewLIR5(kX86Lea32RA, r_base.GetReg(), reg1.GetReg(), reg2.GetReg(), scale, offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001038}
1039
Ian Rogersdd7624d2014-03-14 17:43:00 -07001040void X86Mir2Lir::OpTlsCmp(ThreadOffset<4> offset, int val) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001041 DCHECK_EQ(kX86, cu_->instruction_set);
1042 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
1043}
1044
1045void X86Mir2Lir::OpTlsCmp(ThreadOffset<8> offset, int val) {
1046 DCHECK_EQ(kX86_64, cu_->instruction_set);
Ian Rogers468532e2013-08-05 10:56:33 -07001047 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001048}
1049
buzbee2700f7e2014-03-07 09:46:20 -08001050static bool IsInReg(X86Mir2Lir *pMir2Lir, const RegLocation &rl, RegStorage reg) {
1051 return rl.reg.Valid() && rl.reg.GetReg() == reg.GetReg() && (pMir2Lir->IsLive(reg) || rl.home);
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001052}
1053
Vladimir Marko1c282e22013-11-21 14:49:47 +00001054bool X86Mir2Lir::GenInlinedCas(CallInfo* info, bool is_long, bool is_object) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +07001055 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001056 // Unused - RegLocation rl_src_unsafe = info->args[0];
1057 RegLocation rl_src_obj = info->args[1]; // Object - known non-null
1058 RegLocation rl_src_offset = info->args[2]; // long low
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001059 if (!cu_->target64) {
1060 rl_src_offset = NarrowRegLoc(rl_src_offset); // ignore high half in info->args[3]
1061 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001062 RegLocation rl_src_expected = info->args[4]; // int, long or Object
1063 // If is_long, high half is in info->args[5]
1064 RegLocation rl_src_new_value = info->args[is_long ? 6 : 5]; // int, long or Object
1065 // If is_long, high half is in info->args[7]
1066
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001067 if (is_long && cu_->target64) {
1068 // 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 -07001069 FlushReg(rs_r0q);
1070 Clobber(rs_r0q);
1071 LockTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001072
1073 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
1074 RegLocation rl_new_value = LoadValueWide(rl_src_new_value, kCoreReg);
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001075 RegLocation rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1076 LoadValueDirectWide(rl_src_expected, rs_r0q);
Andreas Gampeccc60262014-07-04 18:02:38 -07001077 NewLIR5(kX86LockCmpxchg64AR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1078 rl_new_value.reg.GetReg());
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001079
1080 // After a store we need to insert barrier in case of potential load. Since the
1081 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
Hans Boehm48f5c472014-06-27 14:50:10 -07001082 GenMemBarrier(kAnyAny);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001083
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001084 FreeTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001085 } else if (is_long) {
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001086 // TODO: avoid unnecessary loads of SI and DI when the values are in registers.
1087 // TODO: CFI support.
Vladimir Marko70b797d2013-12-03 15:25:24 +00001088 FlushAllRegs();
1089 LockCallTemps();
buzbee091cc402014-03-31 10:14:40 -07001090 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
1091 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_rBX, rs_rCX);
buzbee2700f7e2014-03-07 09:46:20 -08001092 LoadValueDirectWideFixed(rl_src_expected, r_tmp1);
1093 LoadValueDirectWideFixed(rl_src_new_value, r_tmp2);
buzbee695d13a2014-04-19 13:32:20 -07001094 // FIXME: needs 64-bit update.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001095 const bool obj_in_di = IsInReg(this, rl_src_obj, rs_rDI);
1096 const bool obj_in_si = IsInReg(this, rl_src_obj, rs_rSI);
1097 DCHECK(!obj_in_si || !obj_in_di);
1098 const bool off_in_di = IsInReg(this, rl_src_offset, rs_rDI);
1099 const bool off_in_si = IsInReg(this, rl_src_offset, rs_rSI);
1100 DCHECK(!off_in_si || !off_in_di);
1101 // If obj/offset is in a reg, use that reg. Otherwise, use the empty reg.
1102 RegStorage rs_obj = obj_in_di ? rs_rDI : obj_in_si ? rs_rSI : !off_in_di ? rs_rDI : rs_rSI;
1103 RegStorage rs_off = off_in_si ? rs_rSI : off_in_di ? rs_rDI : !obj_in_si ? rs_rSI : rs_rDI;
1104 bool push_di = (!obj_in_di && !off_in_di) && (rs_obj == rs_rDI || rs_off == rs_rDI);
1105 bool push_si = (!obj_in_si && !off_in_si) && (rs_obj == rs_rSI || rs_off == rs_rSI);
1106 if (push_di) {
1107 NewLIR1(kX86Push32R, rs_rDI.GetReg());
1108 MarkTemp(rs_rDI);
1109 LockTemp(rs_rDI);
1110 }
1111 if (push_si) {
1112 NewLIR1(kX86Push32R, rs_rSI.GetReg());
1113 MarkTemp(rs_rSI);
1114 LockTemp(rs_rSI);
1115 }
1116 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1117 const size_t push_offset = (push_si ? 4u : 0u) + (push_di ? 4u : 0u);
1118 if (!obj_in_si && !obj_in_di) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07001119 LoadWordDisp(rs_rX86_SP, SRegOffset(rl_src_obj.s_reg_low) + push_offset, rs_obj);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001120 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1121 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1122 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1123 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1124 }
1125 if (!off_in_si && !off_in_di) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07001126 LoadWordDisp(rs_rX86_SP, SRegOffset(rl_src_offset.s_reg_low) + push_offset, rs_off);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001127 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1128 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1129 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1130 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1131 }
1132 NewLIR4(kX86LockCmpxchg64A, rs_obj.GetReg(), rs_off.GetReg(), 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001133
Hans Boehm48f5c472014-06-27 14:50:10 -07001134 // After a store we need to insert barrier to prevent reordering with either
1135 // earlier or later memory accesses. Since
1136 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1137 // and it will be associated with the cmpxchg instruction, preventing both.
1138 GenMemBarrier(kAnyAny);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001139
1140 if (push_si) {
1141 FreeTemp(rs_rSI);
1142 UnmarkTemp(rs_rSI);
1143 NewLIR1(kX86Pop32R, rs_rSI.GetReg());
1144 }
1145 if (push_di) {
1146 FreeTemp(rs_rDI);
1147 UnmarkTemp(rs_rDI);
1148 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
1149 }
Vladimir Marko70b797d2013-12-03 15:25:24 +00001150 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +00001151 } else {
1152 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -08001153 FlushReg(rs_r0);
buzbee091cc402014-03-31 10:14:40 -07001154 Clobber(rs_r0);
buzbee2700f7e2014-03-07 09:46:20 -08001155 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001156
buzbeea0cd2d72014-06-01 09:33:49 -07001157 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
1158 RegLocation rl_new_value = LoadValue(rl_src_new_value);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001159
1160 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
1161 // Mark card for object assuming new value is stored.
buzbee091cc402014-03-31 10:14:40 -07001162 FreeTemp(rs_r0); // Temporarily release EAX for MarkGCCard().
buzbee2700f7e2014-03-07 09:46:20 -08001163 MarkGCCard(rl_new_value.reg, rl_object.reg);
buzbee091cc402014-03-31 10:14:40 -07001164 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001165 }
1166
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001167 RegLocation rl_offset;
1168 if (cu_->target64) {
1169 rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1170 } else {
1171 rl_offset = LoadValue(rl_src_offset, kCoreReg);
1172 }
buzbee2700f7e2014-03-07 09:46:20 -08001173 LoadValueDirect(rl_src_expected, rs_r0);
Andreas Gampeccc60262014-07-04 18:02:38 -07001174 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1175 rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +00001176
Hans Boehm48f5c472014-06-27 14:50:10 -07001177 // After a store we need to insert barrier to prevent reordering with either
1178 // earlier or later memory accesses. Since
1179 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1180 // and it will be associated with the cmpxchg instruction, preventing both.
1181 GenMemBarrier(kAnyAny);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001182
buzbee091cc402014-03-31 10:14:40 -07001183 FreeTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001184 }
1185
1186 // Convert ZF to boolean
1187 RegLocation rl_dest = InlineTarget(info); // boolean place for result
1188 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001189 RegStorage result_reg = rl_result.reg;
1190
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001191 // For 32-bit, SETcc only works with EAX..EDX.
1192 if (!IsByteRegister(result_reg)) {
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001193 result_reg = AllocateByteRegister();
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001194 }
1195 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondZ);
1196 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), result_reg.GetReg());
1197 if (IsTemp(result_reg)) {
1198 FreeTemp(result_reg);
1199 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001200 StoreValue(rl_dest, rl_result);
1201 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001202}
1203
Yixin Shou8c914c02014-07-28 14:17:09 -04001204void X86Mir2Lir::SwapBits(RegStorage result_reg, int shift, int32_t value) {
1205 RegStorage r_temp = AllocTemp();
1206 OpRegCopy(r_temp, result_reg);
1207 OpRegImm(kOpLsr, result_reg, shift);
1208 OpRegImm(kOpAnd, r_temp, value);
1209 OpRegImm(kOpAnd, result_reg, value);
1210 OpRegImm(kOpLsl, r_temp, shift);
1211 OpRegReg(kOpOr, result_reg, r_temp);
1212 FreeTemp(r_temp);
1213}
1214
1215void X86Mir2Lir::SwapBits64(RegStorage result_reg, int shift, int64_t value) {
1216 RegStorage r_temp = AllocTempWide();
1217 OpRegCopy(r_temp, result_reg);
1218 OpRegImm(kOpLsr, result_reg, shift);
1219 RegStorage r_value = AllocTempWide();
1220 LoadConstantWide(r_value, value);
1221 OpRegReg(kOpAnd, r_temp, r_value);
1222 OpRegReg(kOpAnd, result_reg, r_value);
1223 OpRegImm(kOpLsl, r_temp, shift);
1224 OpRegReg(kOpOr, result_reg, r_temp);
1225 FreeTemp(r_temp);
1226 FreeTemp(r_value);
1227}
1228
1229bool X86Mir2Lir::GenInlinedReverseBits(CallInfo* info, OpSize size) {
1230 RegLocation rl_src_i = info->args[0];
1231 RegLocation rl_i = (size == k64) ? LoadValueWide(rl_src_i, kCoreReg)
1232 : LoadValue(rl_src_i, kCoreReg);
1233 RegLocation rl_dest = (size == k64) ? InlineTargetWide(info) : InlineTarget(info);
1234 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1235 if (size == k64) {
1236 if (cu_->instruction_set == kX86_64) {
1237 /* Use one bswap instruction to reverse byte order first and then use 3 rounds of
1238 swapping bits to reverse bits in a long number x. Using bswap to save instructions
1239 compared to generic luni implementation which has 5 rounds of swapping bits.
1240 x = bswap x
1241 x = (x & 0x5555555555555555) << 1 | (x >> 1) & 0x5555555555555555;
1242 x = (x & 0x3333333333333333) << 2 | (x >> 2) & 0x3333333333333333;
1243 x = (x & 0x0F0F0F0F0F0F0F0F) << 4 | (x >> 4) & 0x0F0F0F0F0F0F0F0F;
1244 */
1245 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1246 SwapBits64(rl_result.reg, 1, 0x5555555555555555);
1247 SwapBits64(rl_result.reg, 2, 0x3333333333333333);
1248 SwapBits64(rl_result.reg, 4, 0x0f0f0f0f0f0f0f0f);
1249 StoreValueWide(rl_dest, rl_result);
1250 return true;
1251 }
1252 RegStorage r_i_low = rl_i.reg.GetLow();
1253 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1254 // First REV shall clobber rl_result.reg.GetLowReg(), save the value in a temp for the second
1255 // REV.
1256 r_i_low = AllocTemp();
1257 OpRegCopy(r_i_low, rl_i.reg);
1258 }
1259 OpRegReg(kOpRev, rl_result.reg.GetLow(), rl_i.reg.GetHigh());
1260 OpRegReg(kOpRev, rl_result.reg.GetHigh(), r_i_low);
1261 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1262 FreeTemp(r_i_low);
1263 }
1264 SwapBits(rl_result.reg.GetLow(), 1, 0x55555555);
1265 SwapBits(rl_result.reg.GetLow(), 2, 0x33333333);
1266 SwapBits(rl_result.reg.GetLow(), 4, 0x0f0f0f0f);
1267 SwapBits(rl_result.reg.GetHigh(), 1, 0x55555555);
1268 SwapBits(rl_result.reg.GetHigh(), 2, 0x33333333);
1269 SwapBits(rl_result.reg.GetHigh(), 4, 0x0f0f0f0f);
1270 StoreValueWide(rl_dest, rl_result);
1271 } else {
1272 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1273 SwapBits(rl_result.reg, 1, 0x55555555);
1274 SwapBits(rl_result.reg, 2, 0x33333333);
1275 SwapBits(rl_result.reg, 4, 0x0f0f0f0f);
1276 StoreValue(rl_dest, rl_result);
1277 }
1278 return true;
1279}
1280
buzbee2700f7e2014-03-07 09:46:20 -08001281LIR* X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001282 CHECK(base_of_code_ != nullptr);
1283
1284 // Address the start of the method
1285 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07001286 if (rl_method.wide) {
1287 LoadValueDirectWideFixed(rl_method, reg);
1288 } else {
1289 LoadValueDirectFixed(rl_method, reg);
1290 }
Mark Mendell55d0eac2014-02-06 11:02:52 -08001291 store_method_addr_used_ = true;
1292
1293 // Load the proper value from the literal area.
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.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001297 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
buzbee2700f7e2014-03-07 09:46:20 -08001298 LIR *res = RawLIR(current_dalvik_offset_, kX86Mov32RM, reg.GetReg(), reg.GetReg(), 256,
1299 0, 0, target);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001300 res->target = target;
1301 res->flags.fixup = kFixupLoad;
Mark Mendell55d0eac2014-02-06 11:02:52 -08001302 store_method_addr_used_ = true;
1303 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001304}
1305
buzbee2700f7e2014-03-07 09:46:20 -08001306LIR* X86Mir2Lir::OpVldm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001307 LOG(FATAL) << "Unexpected use of OpVldm for x86";
1308 return NULL;
1309}
1310
buzbee2700f7e2014-03-07 09:46:20 -08001311LIR* X86Mir2Lir::OpVstm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001312 LOG(FATAL) << "Unexpected use of OpVstm for x86";
1313 return NULL;
1314}
1315
1316void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
1317 RegLocation rl_result, int lit,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001318 int first_bit, int second_bit) {
buzbee2700f7e2014-03-07 09:46:20 -08001319 RegStorage t_reg = AllocTemp();
1320 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
1321 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001322 FreeTemp(t_reg);
1323 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -08001324 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001325 }
1326}
1327
Mingyao Yange643a172014-04-08 11:02:52 -07001328void X86Mir2Lir::GenDivZeroCheckWide(RegStorage reg) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001329 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001330 DCHECK(reg.Is64Bit());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001331
Chao-ying Fua0147762014-06-06 18:38:49 -07001332 NewLIR2(kX86Cmp64RI8, reg.GetReg(), 0);
1333 } else {
1334 DCHECK(reg.IsPair());
1335
1336 // We are not supposed to clobber the incoming storage, so allocate a temporary.
1337 RegStorage t_reg = AllocTemp();
1338 // Doing an OR is a quick way to check if both registers are zero. This will set the flags.
1339 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
1340 // The temp is no longer needed so free it at this time.
1341 FreeTemp(t_reg);
1342 }
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001343
1344 // In case of zero, throw ArithmeticException.
Mingyao Yange643a172014-04-08 11:02:52 -07001345 GenDivZeroCheck(kCondEq);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001346}
1347
Mingyao Yang80365d92014-04-18 12:10:58 -07001348void X86Mir2Lir::GenArrayBoundsCheck(RegStorage index,
1349 RegStorage array_base,
1350 int len_offset) {
1351 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1352 public:
1353 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
1354 RegStorage index, RegStorage array_base, int32_t len_offset)
1355 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
1356 index_(index), array_base_(array_base), len_offset_(len_offset) {
1357 }
1358
1359 void Compile() OVERRIDE {
1360 m2l_->ResetRegPool();
1361 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001362 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001363
1364 RegStorage new_index = index_;
1365 // Move index out of kArg1, either directly to kArg0, or to kArg2.
Serguei Katkov4c7cc152014-06-24 00:50:02 +07001366 // TODO: clean-up to check not a number but with type
Andreas Gampeccc60262014-07-04 18:02:38 -07001367 if (index_ == m2l_->TargetReg(kArg1, kNotWide)) {
1368 if (array_base_ == m2l_->TargetReg(kArg0, kRef)) {
1369 m2l_->OpRegCopy(m2l_->TargetReg(kArg2, kNotWide), index_);
1370 new_index = m2l_->TargetReg(kArg2, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001371 } else {
Andreas Gampeccc60262014-07-04 18:02:38 -07001372 m2l_->OpRegCopy(m2l_->TargetReg(kArg0, kNotWide), index_);
1373 new_index = m2l_->TargetReg(kArg0, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001374 }
1375 }
1376 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001377 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1378 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1379 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, new_index,
1380 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001381 }
1382
1383 private:
1384 const RegStorage index_;
1385 const RegStorage array_base_;
1386 const int32_t len_offset_;
1387 };
1388
1389 OpRegMem(kOpCmp, index, array_base, len_offset);
Dave Allison69dfe512014-07-11 17:11:58 +00001390 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001391 LIR* branch = OpCondBranch(kCondUge, nullptr);
1392 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1393 index, array_base, len_offset));
1394}
1395
1396void X86Mir2Lir::GenArrayBoundsCheck(int32_t index,
1397 RegStorage array_base,
1398 int32_t len_offset) {
1399 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1400 public:
1401 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
1402 int32_t index, RegStorage array_base, int32_t len_offset)
1403 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
1404 index_(index), array_base_(array_base), len_offset_(len_offset) {
1405 }
1406
1407 void Compile() OVERRIDE {
1408 m2l_->ResetRegPool();
1409 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001410 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001411
1412 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001413 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1414 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1415 x86_m2l->LoadConstant(m2l_->TargetReg(kArg0, kNotWide), index_);
1416 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, m2l_->TargetReg(kArg0, kNotWide),
1417 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001418 }
1419
1420 private:
1421 const int32_t index_;
1422 const RegStorage array_base_;
1423 const int32_t len_offset_;
1424 };
1425
1426 NewLIR3(IS_SIMM8(index) ? kX86Cmp32MI8 : kX86Cmp32MI, array_base.GetReg(), len_offset, index);
Dave Allison69dfe512014-07-11 17:11:58 +00001427 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001428 LIR* branch = OpCondBranch(kCondLs, nullptr);
1429 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1430 index, array_base, len_offset));
1431}
1432
Brian Carlstrom7940e442013-07-12 13:46:57 -07001433// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001434LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
buzbee33ae5582014-06-12 14:56:32 -07001435 if (cu_->target64) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001436 OpTlsCmp(Thread::ThreadFlagsOffset<8>(), 0);
1437 } else {
1438 OpTlsCmp(Thread::ThreadFlagsOffset<4>(), 0);
1439 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001440 return OpCondBranch((target == NULL) ? kCondNe : kCondEq, target);
1441}
1442
1443// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -08001444LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001445 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -08001446 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001447}
1448
buzbee11b63d12013-08-27 07:34:17 -07001449bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001450 RegLocation rl_src, RegLocation rl_dest, int lit) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001451 LOG(FATAL) << "Unexpected use of smallLiteralDive in x86";
1452 return false;
1453}
1454
Ian Rogerse2143c02014-03-28 08:47:16 -07001455bool X86Mir2Lir::EasyMultiply(RegLocation rl_src, RegLocation rl_dest, int lit) {
1456 LOG(FATAL) << "Unexpected use of easyMultiply in x86";
1457 return false;
1458}
1459
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001460LIR* X86Mir2Lir::OpIT(ConditionCode cond, const char* guide) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001461 LOG(FATAL) << "Unexpected use of OpIT in x86";
1462 return NULL;
1463}
1464
Dave Allison3da67a52014-04-02 17:03:45 -07001465void X86Mir2Lir::OpEndIT(LIR* it) {
1466 LOG(FATAL) << "Unexpected use of OpEndIT in x86";
1467}
1468
buzbee2700f7e2014-03-07 09:46:20 -08001469void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001470 switch (val) {
1471 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001472 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001473 break;
1474 case 1:
1475 OpRegCopy(dest, src);
1476 break;
1477 default:
1478 OpRegRegImm(kOpMul, dest, src, val);
1479 break;
1480 }
1481}
1482
buzbee2700f7e2014-03-07 09:46:20 -08001483void X86Mir2Lir::GenImulMemImm(RegStorage dest, int sreg, int displacement, int val) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001484 // All memory accesses below reference dalvik regs.
1485 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1486
Mark Mendell4708dcd2014-01-22 09:05:18 -08001487 LIR *m;
1488 switch (val) {
1489 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001490 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001491 break;
1492 case 1:
Andreas Gampe3c12c512014-06-24 18:46:29 +00001493 LoadBaseDisp(rs_rX86_SP, displacement, dest, k32, kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001494 break;
1495 default:
buzbee091cc402014-03-31 10:14:40 -07001496 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(),
1497 rs_rX86_SP.GetReg(), displacement, val);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001498 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
1499 break;
1500 }
1501}
1502
Andreas Gampec76c6142014-08-04 16:30:03 -07001503void X86Mir2Lir::GenArithOpLong(Instruction::Code opcode, RegLocation rl_dest, RegLocation rl_src1,
1504 RegLocation rl_src2) {
1505 if (!cu_->target64) {
1506 // Some x86 32b ops are fallback.
1507 switch (opcode) {
1508 case Instruction::NOT_LONG:
1509 case Instruction::DIV_LONG:
1510 case Instruction::DIV_LONG_2ADDR:
1511 case Instruction::REM_LONG:
1512 case Instruction::REM_LONG_2ADDR:
1513 Mir2Lir::GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
1514 return;
1515
1516 default:
1517 // Everything else we can handle.
1518 break;
1519 }
1520 }
1521
1522 switch (opcode) {
1523 case Instruction::NOT_LONG:
1524 GenNotLong(rl_dest, rl_src2);
1525 return;
1526
1527 case Instruction::ADD_LONG:
1528 case Instruction::ADD_LONG_2ADDR:
1529 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1530 return;
1531
1532 case Instruction::SUB_LONG:
1533 case Instruction::SUB_LONG_2ADDR:
1534 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1535 return;
1536
1537 case Instruction::MUL_LONG:
1538 case Instruction::MUL_LONG_2ADDR:
1539 GenMulLong(opcode, rl_dest, rl_src1, rl_src2);
1540 return;
1541
1542 case Instruction::DIV_LONG:
1543 case Instruction::DIV_LONG_2ADDR:
1544 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ true);
1545 return;
1546
1547 case Instruction::REM_LONG:
1548 case Instruction::REM_LONG_2ADDR:
1549 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ false);
1550 return;
1551
1552 case Instruction::AND_LONG_2ADDR:
1553 case Instruction::AND_LONG:
1554 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1555 return;
1556
1557 case Instruction::OR_LONG:
1558 case Instruction::OR_LONG_2ADDR:
1559 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1560 return;
1561
1562 case Instruction::XOR_LONG:
1563 case Instruction::XOR_LONG_2ADDR:
1564 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1565 return;
1566
1567 case Instruction::NEG_LONG:
1568 GenNegLong(rl_dest, rl_src2);
1569 return;
1570
1571 default:
1572 LOG(FATAL) << "Invalid long arith op";
1573 return;
1574 }
1575}
1576
1577bool X86Mir2Lir::GenMulLongConst(RegLocation rl_dest, RegLocation rl_src1, int64_t val) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001578 // All memory accesses below reference dalvik regs.
1579 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1580
Andreas Gampec76c6142014-08-04 16:30:03 -07001581 if (val == 0) {
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001582 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Andreas Gampec76c6142014-08-04 16:30:03 -07001583 if (cu_->target64) {
1584 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001585 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001586 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
1587 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001588 }
Andreas Gampec76c6142014-08-04 16:30:03 -07001589 StoreValueWide(rl_dest, rl_result);
1590 return true;
1591 } else if (val == 1) {
1592 StoreValueWide(rl_dest, rl_src1);
1593 return true;
1594 } else if (val == 2) {
1595 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1);
1596 return true;
1597 } else if (IsPowerOfTwo(val)) {
1598 int shift_amount = LowestSetBit(val);
1599 if (!BadOverlap(rl_src1, rl_dest)) {
1600 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1601 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest, rl_src1,
1602 shift_amount);
1603 StoreValueWide(rl_dest, rl_result);
1604 return true;
1605 }
1606 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001607
Andreas Gampec76c6142014-08-04 16:30:03 -07001608 // Okay, on 32b just bite the bullet and do it, still better than the general case.
1609 if (!cu_->target64) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001610 int32_t val_lo = Low32Bits(val);
1611 int32_t val_hi = High32Bits(val);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001612 // Prepare for explicit register usage.
1613 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
buzbee30adc732014-05-09 15:10:18 -07001614 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001615 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1616 int displacement = SRegOffset(rl_src1.s_reg_low);
1617
1618 // ECX <- 1H * 2L
1619 // EAX <- 1L * 2H
1620 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001621 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
1622 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001623 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001624 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
1625 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001626 }
1627
1628 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001629 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001630
1631 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001632 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001633
1634 // EDX:EAX <- 2L * 1L (double precision)
1635 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001636 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001637 } else {
buzbee091cc402014-03-31 10:14:40 -07001638 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001639 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1640 true /* is_load */, true /* is_64bit */);
1641 }
1642
1643 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001644 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001645
1646 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001647 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
1648 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001649 StoreValueWide(rl_dest, rl_result);
Andreas Gampec76c6142014-08-04 16:30:03 -07001650 return true;
1651 }
1652 return false;
1653}
1654
1655void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
1656 RegLocation rl_src2) {
1657 if (rl_src1.is_const) {
1658 std::swap(rl_src1, rl_src2);
1659 }
1660
1661 if (rl_src2.is_const) {
1662 if (GenMulLongConst(rl_dest, rl_src1, mir_graph_->ConstantValueWide(rl_src2))) {
1663 return;
1664 }
1665 }
1666
1667 // All memory accesses below reference dalvik regs.
1668 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1669
1670 if (cu_->target64) {
1671 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1672 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1673 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1674 if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1675 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1676 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
1677 } else if (rl_result.reg.GetReg() != rl_src1.reg.GetReg() &&
1678 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1679 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src1.reg.GetReg());
1680 } else if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1681 rl_result.reg.GetReg() != rl_src2.reg.GetReg()) {
1682 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1683 } else {
1684 OpRegCopy(rl_result.reg, rl_src1.reg);
1685 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1686 }
1687 StoreValueWide(rl_dest, rl_result);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001688 return;
1689 }
1690
Andreas Gampec76c6142014-08-04 16:30:03 -07001691 // Not multiplying by a constant. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001692 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1693 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1694 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1695
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001696 // Prepare for explicit register usage.
1697 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
buzbee30adc732014-05-09 15:10:18 -07001698 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
1699 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001700
1701 // At this point, the VRs are in their home locations.
1702 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1703 bool src2_in_reg = rl_src2.location == kLocPhysReg;
1704
1705 // ECX <- 1H
1706 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001707 NewLIR2(kX86Mov32RR, rs_r1.GetReg(), rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001708 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001709 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1, k32,
1710 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001711 }
1712
Mark Mendellde99bba2014-02-14 12:15:02 -08001713 if (is_square) {
1714 // Take advantage of the fact that the values are the same.
1715 // ECX <- ECX * 2L (1H * 2L)
1716 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001717 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001718 } else {
1719 int displacement = SRegOffset(rl_src2.s_reg_low);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001720 LIR* m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001721 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001722 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1723 true /* is_load */, true /* is_64bit */);
1724 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001725
Mark Mendellde99bba2014-02-14 12:15:02 -08001726 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001727 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001728 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001729 // EAX <- 2H
1730 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001731 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001732 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001733 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0, k32,
1734 kNotVolatile);
Mark Mendellde99bba2014-02-14 12:15:02 -08001735 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001736
Mark Mendellde99bba2014-02-14 12:15:02 -08001737 // EAX <- EAX * 1L (2H * 1L)
1738 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001739 NewLIR2(kX86Imul32RR, rs_r0.GetReg(), rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001740 } else {
1741 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001742 LIR *m = NewLIR3(kX86Imul32RM, rs_r0.GetReg(), rs_rX86_SP.GetReg(),
1743 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001744 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1745 true /* is_load */, true /* is_64bit */);
1746 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001747
Mark Mendellde99bba2014-02-14 12:15:02 -08001748 // 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);
buzbee091cc402014-03-31 10:14:40 -07001753 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
1754 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 }
1758
1759 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001760 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001761 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001762
1763 // EAX <- 2L
1764 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001765 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001766 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001767 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0, k32,
1768 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001769 }
1770
1771 // EDX:EAX <- 2L * 1L (double precision)
1772 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001773 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001774 } else {
1775 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001776 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001777 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1778 true /* is_load */, true /* is_64bit */);
1779 }
1780
1781 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001782 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001783
1784 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001785 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
buzbee2700f7e2014-03-07 09:46:20 -08001786 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001787 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001788}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001789
1790void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1791 Instruction::Code op) {
1792 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1793 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1794 if (rl_src.location == kLocPhysReg) {
1795 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001796 // But we must ensure that rl_src is in pair
Elena Sayapinadd644502014-07-01 18:39:52 +07001797 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001798 NewLIR2(x86op, rl_dest.reg.GetReg(), rl_src.reg.GetReg());
1799 } else {
1800 rl_src = LoadValueWide(rl_src, kCoreReg);
1801 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
1802 // The registers are the same, so we would clobber it before the use.
1803 RegStorage temp_reg = AllocTemp();
1804 OpRegCopy(temp_reg, rl_dest.reg);
1805 rl_src.reg.SetHighReg(temp_reg.GetReg());
1806 }
1807 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001808
Chao-ying Fua0147762014-06-06 18:38:49 -07001809 x86op = GetOpcode(op, rl_dest, rl_src, true);
1810 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
1811 FreeTemp(rl_src.reg); // ???
1812 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001813 return;
1814 }
1815
1816 // RHS is in memory.
1817 DCHECK((rl_src.location == kLocDalvikFrame) ||
1818 (rl_src.location == kLocCompilerTemp));
Chao-ying Fua77ee512014-07-01 17:43:41 -07001819 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001820 int displacement = SRegOffset(rl_src.s_reg_low);
1821
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001822 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Andreas Gampeccc60262014-07-04 18:02:38 -07001823 LIR *lir = NewLIR3(x86op, cu_->target64 ? rl_dest.reg.GetReg() : rl_dest.reg.GetLowReg(),
1824 r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001825 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1826 true /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001827 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001828 x86op = GetOpcode(op, rl_dest, rl_src, true);
1829 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001830 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1831 true /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001832 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001833}
1834
Mark Mendelle02d48f2014-01-15 11:19:23 -08001835void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
buzbee30adc732014-05-09 15:10:18 -07001836 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001837 if (rl_dest.location == kLocPhysReg) {
1838 // Ensure we are in a register pair
1839 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1840
buzbee30adc732014-05-09 15:10:18 -07001841 rl_src = UpdateLocWideTyped(rl_src, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001842 GenLongRegOrMemOp(rl_result, rl_src, op);
1843 StoreFinalValueWide(rl_dest, rl_result);
1844 return;
1845 }
1846
1847 // It wasn't in registers, so it better be in memory.
1848 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1849 (rl_dest.location == kLocCompilerTemp));
1850 rl_src = LoadValueWide(rl_src, kCoreReg);
1851
1852 // Operate directly into memory.
1853 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
Chao-ying Fua77ee512014-07-01 17:43:41 -07001854 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001855 int displacement = SRegOffset(rl_dest.s_reg_low);
1856
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001857 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07001858 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET,
Elena Sayapinadd644502014-07-01 18:39:52 +07001859 cu_->target64 ? rl_src.reg.GetReg() : rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001860 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001861 true /* is_load */, true /* is64bit */);
1862 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001863 false /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001864 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001865 x86op = GetOpcode(op, rl_dest, rl_src, true);
1866 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001867 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1868 true /* is_load */, true /* is64bit */);
1869 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1870 false /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001871 }
buzbee2700f7e2014-03-07 09:46:20 -08001872 FreeTemp(rl_src.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001873}
1874
Mark Mendelle02d48f2014-01-15 11:19:23 -08001875void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
1876 RegLocation rl_src2, Instruction::Code op,
1877 bool is_commutative) {
1878 // Is this really a 2 operand operation?
1879 switch (op) {
1880 case Instruction::ADD_LONG_2ADDR:
1881 case Instruction::SUB_LONG_2ADDR:
1882 case Instruction::AND_LONG_2ADDR:
1883 case Instruction::OR_LONG_2ADDR:
1884 case Instruction::XOR_LONG_2ADDR:
Mark Mendelle87f9b52014-04-30 14:13:18 -04001885 if (GenerateTwoOperandInstructions()) {
1886 GenLongArith(rl_dest, rl_src2, op);
1887 return;
1888 }
1889 break;
1890
Mark Mendelle02d48f2014-01-15 11:19:23 -08001891 default:
1892 break;
1893 }
1894
1895 if (rl_dest.location == kLocPhysReg) {
1896 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
1897
1898 // We are about to clobber the LHS, so it needs to be a temp.
1899 rl_result = ForceTempWide(rl_result);
1900
1901 // Perform the operation using the RHS.
buzbee30adc732014-05-09 15:10:18 -07001902 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001903 GenLongRegOrMemOp(rl_result, rl_src2, op);
1904
1905 // And now record that the result is in the temp.
1906 StoreFinalValueWide(rl_dest, rl_result);
1907 return;
1908 }
1909
1910 // It wasn't in registers, so it better be in memory.
1911 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1912 (rl_dest.location == kLocCompilerTemp));
buzbee30adc732014-05-09 15:10:18 -07001913 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
1914 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001915
1916 // Get one of the source operands into temporary register.
1917 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +07001918 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001919 if (IsTemp(rl_src1.reg)) {
1920 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1921 } else if (is_commutative) {
1922 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1923 // We need at least one of them to be a temporary.
1924 if (!IsTemp(rl_src2.reg)) {
1925 rl_src1 = ForceTempWide(rl_src1);
1926 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1927 } else {
1928 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1929 StoreFinalValueWide(rl_dest, rl_src2);
1930 return;
1931 }
1932 } else {
1933 // Need LHS to be the temp.
Mark Mendelle02d48f2014-01-15 11:19:23 -08001934 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07001935 GenLongRegOrMemOp(rl_src1, rl_src2, op);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001936 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001937 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07001938 if (IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
1939 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1940 } else if (is_commutative) {
1941 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1942 // We need at least one of them to be a temporary.
1943 if (!(IsTemp(rl_src2.reg.GetLow()) && IsTemp(rl_src2.reg.GetHigh()))) {
1944 rl_src1 = ForceTempWide(rl_src1);
1945 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1946 } else {
1947 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1948 StoreFinalValueWide(rl_dest, rl_src2);
1949 return;
1950 }
1951 } else {
1952 // Need LHS to be the temp.
1953 rl_src1 = ForceTempWide(rl_src1);
1954 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1955 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001956 }
1957
1958 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001959}
1960
Serban Constantinescued65c5e2014-05-22 15:10:18 +01001961void X86Mir2Lir::GenNotLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001962 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001963 rl_src = LoadValueWide(rl_src, kCoreReg);
1964 RegLocation rl_result;
1965 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1966 OpRegCopy(rl_result.reg, rl_src.reg);
1967 OpReg(kOpNot, rl_result.reg);
1968 StoreValueWide(rl_dest, rl_result);
1969 } else {
1970 LOG(FATAL) << "Unexpected use GenNotLong()";
1971 }
Serban Constantinescued65c5e2014-05-22 15:10:18 +01001972}
1973
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07001974void X86Mir2Lir::GenDivRemLongLit(RegLocation rl_dest, RegLocation rl_src,
1975 int64_t imm, bool is_div) {
1976 if (imm == 0) {
1977 GenDivZeroException();
1978 } else if (imm == 1) {
1979 if (is_div) {
1980 // x / 1 == x.
1981 StoreValueWide(rl_dest, rl_src);
1982 } else {
1983 // x % 1 == 0.
1984 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1985 LoadConstantWide(rl_result.reg, 0);
1986 StoreValueWide(rl_dest, rl_result);
1987 }
1988 } else if (imm == -1) { // handle 0x8000000000000000 / -1 special case.
1989 if (is_div) {
1990 rl_src = LoadValueWide(rl_src, kCoreReg);
1991 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1992 RegStorage rs_temp = AllocTempWide();
1993
1994 OpRegCopy(rl_result.reg, rl_src.reg);
1995 LoadConstantWide(rs_temp, 0x8000000000000000);
1996
1997 // If x == MIN_LONG, return MIN_LONG.
1998 OpRegReg(kOpCmp, rl_src.reg, rs_temp);
1999 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
2000
2001 // For x != MIN_LONG, x / -1 == -x.
2002 OpReg(kOpNeg, rl_result.reg);
2003
2004 minint_branch->target = NewLIR0(kPseudoTargetLabel);
2005 FreeTemp(rs_temp);
2006 StoreValueWide(rl_dest, rl_result);
2007 } else {
2008 // x % -1 == 0.
2009 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2010 LoadConstantWide(rl_result.reg, 0);
2011 StoreValueWide(rl_dest, rl_result);
2012 }
2013 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
2014 // Division using shifting.
2015 rl_src = LoadValueWide(rl_src, kCoreReg);
2016 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2017 if (IsSameReg(rl_result.reg, rl_src.reg)) {
2018 RegStorage rs_temp = AllocTypedTempWide(false, kCoreReg);
2019 rl_result.reg.SetReg(rs_temp.GetReg());
2020 }
2021 LoadConstantWide(rl_result.reg, std::abs(imm) - 1);
2022 OpRegReg(kOpAdd, rl_result.reg, rl_src.reg);
2023 NewLIR2(kX86Test64RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
2024 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
2025 int shift_amount = LowestSetBit(imm);
2026 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
2027 if (imm < 0) {
2028 OpReg(kOpNeg, rl_result.reg);
2029 }
2030 StoreValueWide(rl_dest, rl_result);
2031 } else {
2032 CHECK(imm <= -2 || imm >= 2);
2033
2034 FlushReg(rs_r0q);
2035 Clobber(rs_r0q);
2036 LockTemp(rs_r0q);
2037 FlushReg(rs_r2q);
2038 Clobber(rs_r2q);
2039 LockTemp(rs_r2q);
2040
Mark Mendell3a91f442014-09-02 12:44:24 -04002041 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
2042 is_div ? rs_r2q : rs_r0q, INVALID_SREG, INVALID_SREG};
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002043
2044 // Use H.S.Warren's Hacker's Delight Chapter 10 and
2045 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
2046 int64_t magic;
2047 int shift;
2048 CalculateMagicAndShift(imm, magic, shift, true /* is_long */);
2049
2050 /*
2051 * For imm >= 2,
2052 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
2053 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
2054 * For imm <= -2,
2055 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
2056 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
2057 * We implement this algorithm in the following way:
2058 * 1. multiply magic number m and numerator n, get the higher 64bit result in RDX
2059 * 2. if imm > 0 and magic < 0, add numerator to RDX
2060 * if imm < 0 and magic > 0, sub numerator from RDX
2061 * 3. if S !=0, SAR S bits for RDX
2062 * 4. add 1 to RDX if RDX < 0
2063 * 5. Thus, RDX is the quotient
2064 */
2065
Mark Mendell3a91f442014-09-02 12:44:24 -04002066 // RAX = magic.
2067 LoadConstantWide(rs_r0q, magic);
2068
2069 // Multiply by numerator.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002070 RegStorage numerator_reg;
2071 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
2072 // We will need the value later.
2073 rl_src = LoadValueWide(rl_src, kCoreReg);
2074 numerator_reg = rl_src.reg;
Mark Mendell3a91f442014-09-02 12:44:24 -04002075
2076 // RDX:RAX = magic * numerator.
2077 NewLIR1(kX86Imul64DaR, numerator_reg.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002078 } else {
Mark Mendell3a91f442014-09-02 12:44:24 -04002079 // Only need this once. Multiply directly from the value.
2080 rl_src = UpdateLocWideTyped(rl_src, kCoreReg);
2081 if (rl_src.location != kLocPhysReg) {
2082 // Okay, we can do this from memory.
2083 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2084 int displacement = SRegOffset(rl_src.s_reg_low);
2085 // RDX:RAX = magic * numerator.
2086 LIR *m = NewLIR2(kX86Imul64DaM, rs_rX86_SP.GetReg(), displacement);
2087 AnnotateDalvikRegAccess(m, displacement >> 2,
2088 true /* is_load */, true /* is_64bit */);
2089 } else {
2090 // RDX:RAX = magic * numerator.
2091 NewLIR1(kX86Imul64DaR, rl_src.reg.GetReg());
2092 }
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002093 }
2094
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002095 if (imm > 0 && magic < 0) {
2096 // Add numerator to RDX.
2097 DCHECK(numerator_reg.Valid());
2098 OpRegReg(kOpAdd, rs_r2q, numerator_reg);
2099 } else if (imm < 0 && magic > 0) {
2100 DCHECK(numerator_reg.Valid());
2101 OpRegReg(kOpSub, rs_r2q, numerator_reg);
2102 }
2103
2104 // Do we need the shift?
2105 if (shift != 0) {
2106 // Shift RDX by 'shift' bits.
2107 OpRegImm(kOpAsr, rs_r2q, shift);
2108 }
2109
2110 // Move RDX to RAX.
2111 OpRegCopyWide(rs_r0q, rs_r2q);
2112
2113 // Move sign bit to bit 0, zeroing the rest.
2114 OpRegImm(kOpLsr, rs_r2q, 63);
2115
2116 // RDX = RDX + RAX.
2117 OpRegReg(kOpAdd, rs_r2q, rs_r0q);
2118
2119 // Quotient is in RDX.
2120 if (!is_div) {
2121 // We need to compute the remainder.
2122 // Remainder is divisor - (quotient * imm).
2123 DCHECK(numerator_reg.Valid());
2124 OpRegCopyWide(rs_r0q, numerator_reg);
2125
2126 // Imul doesn't support 64-bit imms.
2127 if (imm > std::numeric_limits<int32_t>::max() ||
2128 imm < std::numeric_limits<int32_t>::min()) {
2129 RegStorage rs_temp = AllocTempWide();
2130 LoadConstantWide(rs_temp, imm);
2131
2132 // RAX = numerator * imm.
2133 NewLIR2(kX86Imul64RR, rs_r2q.GetReg(), rs_temp.GetReg());
2134
2135 FreeTemp(rs_temp);
2136 } else {
2137 // RAX = numerator * imm.
2138 int short_imm = static_cast<int>(imm);
2139 NewLIR3(kX86Imul64RRI, rs_r2q.GetReg(), rs_r2q.GetReg(), short_imm);
2140 }
2141
Mark Mendell3a91f442014-09-02 12:44:24 -04002142 // RAX -= RDX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002143 OpRegReg(kOpSub, rs_r0q, rs_r2q);
2144
Mark Mendell3a91f442014-09-02 12:44:24 -04002145 // Result in RAX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002146 } else {
Mark Mendell3a91f442014-09-02 12:44:24 -04002147 // Result in RDX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002148 }
2149 StoreValueWide(rl_dest, rl_result);
2150 FreeTemp(rs_r0q);
2151 FreeTemp(rs_r2q);
2152 }
2153}
2154
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002155void X86Mir2Lir::GenDivRemLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002156 RegLocation rl_src2, bool is_div) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002157 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002158 LOG(FATAL) << "Unexpected use GenDivRemLong()";
2159 return;
2160 }
2161
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002162 if (rl_src2.is_const) {
2163 DCHECK(rl_src2.wide);
2164 int64_t imm = mir_graph_->ConstantValueWide(rl_src2);
2165 GenDivRemLongLit(rl_dest, rl_src1, imm, is_div);
2166 return;
2167 }
2168
Chao-ying Fua0147762014-06-06 18:38:49 -07002169 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002170 // Prepare for explicit register usage.
2171 ExplicitTempRegisterLock(this, 4, &rs_r0q, &rs_r1q, &rs_r2q, &rs_r6q);
Chao-ying Fua0147762014-06-06 18:38:49 -07002172
2173 // Load LHS into RAX.
2174 LoadValueDirectWideFixed(rl_src1, rs_r0q);
2175
2176 // Load RHS into RCX.
2177 LoadValueDirectWideFixed(rl_src2, rs_r1q);
2178
2179 // Copy LHS sign bit into RDX.
2180 NewLIR0(kx86Cqo64Da);
2181
2182 // Handle division by zero case.
2183 GenDivZeroCheckWide(rs_r1q);
2184
2185 // Have to catch 0x8000000000000000/-1 case, or we will get an exception!
2186 NewLIR2(kX86Cmp64RI8, rs_r1q.GetReg(), -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002187 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002188
2189 // RHS is -1.
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002190 LoadConstantWide(rs_r6q, 0x8000000000000000);
2191 NewLIR2(kX86Cmp64RR, rs_r0q.GetReg(), rs_r6q.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002192 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002193
2194 // In 0x8000000000000000/-1 case.
2195 if (!is_div) {
2196 // For DIV, RAX is already right. For REM, we need RDX 0.
2197 NewLIR2(kX86Xor64RR, rs_r2q.GetReg(), rs_r2q.GetReg());
2198 }
2199 LIR* done = NewLIR1(kX86Jmp8, 0);
2200
2201 // Expected case.
2202 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
2203 minint_branch->target = minus_one_branch->target;
2204 NewLIR1(kX86Idivmod64DaR, rs_r1q.GetReg());
2205 done->target = NewLIR0(kPseudoTargetLabel);
2206
2207 // Result is in RAX for div and RDX for rem.
2208 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, rs_r0q, INVALID_SREG, INVALID_SREG};
2209 if (!is_div) {
2210 rl_result.reg.SetReg(r2q);
2211 }
2212
2213 StoreValueWide(rl_dest, rl_result);
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002214}
2215
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002216void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002217 rl_src = LoadValueWide(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002218 RegLocation rl_result;
Elena Sayapinadd644502014-07-01 18:39:52 +07002219 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002220 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2221 OpRegReg(kOpNeg, rl_result.reg, rl_src.reg);
2222 } else {
2223 rl_result = ForceTempWide(rl_src);
2224 if (((rl_dest.location == kLocPhysReg) && (rl_src.location == kLocPhysReg)) &&
2225 ((rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()))) {
2226 // The registers are the same, so we would clobber it before the use.
2227 RegStorage temp_reg = AllocTemp();
2228 OpRegCopy(temp_reg, rl_result.reg);
2229 rl_result.reg.SetHighReg(temp_reg.GetReg());
2230 }
2231 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
2232 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
2233 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Mark Mendelle02d48f2014-01-15 11:19:23 -08002234 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002235 StoreValueWide(rl_dest, rl_result);
2236}
2237
buzbee091cc402014-03-31 10:14:40 -07002238void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<4> thread_offset) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07002239 DCHECK_EQ(kX86, cu_->instruction_set);
2240 X86OpCode opcode = kX86Bkpt;
2241 switch (op) {
2242 case kOpCmp: opcode = kX86Cmp32RT; break;
2243 case kOpMov: opcode = kX86Mov32RT; break;
2244 default:
2245 LOG(FATAL) << "Bad opcode: " << op;
2246 break;
2247 }
2248 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
2249}
2250
2251void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<8> thread_offset) {
2252 DCHECK_EQ(kX86_64, cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002253 X86OpCode opcode = kX86Bkpt;
Elena Sayapinadd644502014-07-01 18:39:52 +07002254 if (cu_->target64 && r_dest.Is64BitSolo()) {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +07002255 switch (op) {
2256 case kOpCmp: opcode = kX86Cmp64RT; break;
2257 case kOpMov: opcode = kX86Mov64RT; break;
2258 default:
2259 LOG(FATAL) << "Bad opcode(OpRegThreadMem 64): " << op;
2260 break;
2261 }
2262 } else {
2263 switch (op) {
2264 case kOpCmp: opcode = kX86Cmp32RT; break;
2265 case kOpMov: opcode = kX86Mov32RT; break;
2266 default:
2267 LOG(FATAL) << "Bad opcode: " << op;
2268 break;
2269 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002270 }
buzbee091cc402014-03-31 10:14:40 -07002271 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07002272}
2273
2274/*
2275 * Generate array load
2276 */
2277void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002278 RegLocation rl_index, RegLocation rl_dest, int scale) {
buzbee091cc402014-03-31 10:14:40 -07002279 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002280 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07002281 RegLocation rl_result;
buzbeea0cd2d72014-06-01 09:33:49 -07002282 rl_array = LoadValue(rl_array, kRefReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002283
Mark Mendell343adb52013-12-18 06:02:17 -08002284 int data_offset;
buzbee695d13a2014-04-19 13:32:20 -07002285 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002286 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2287 } else {
2288 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2289 }
2290
Mark Mendell343adb52013-12-18 06:02:17 -08002291 bool constant_index = rl_index.is_const;
2292 int32_t constant_index_value = 0;
2293 if (!constant_index) {
2294 rl_index = LoadValue(rl_index, kCoreReg);
2295 } else {
2296 constant_index_value = mir_graph_->ConstantValue(rl_index);
2297 // If index is constant, just fold it into the data offset
2298 data_offset += constant_index_value << scale;
2299 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002300 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002301 }
2302
Brian Carlstrom7940e442013-07-12 13:46:57 -07002303 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002304 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002305
2306 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002307 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002308 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002309 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002310 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002311 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002312 }
Mark Mendell343adb52013-12-18 06:02:17 -08002313 rl_result = EvalLoc(rl_dest, reg_class, true);
Vladimir Marko3bf7c602014-05-07 14:55:43 +01002314 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg, size);
buzbee695d13a2014-04-19 13:32:20 -07002315 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002316 StoreValueWide(rl_dest, rl_result);
2317 } else {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002318 StoreValue(rl_dest, rl_result);
2319 }
2320}
2321
2322/*
2323 * Generate array store
2324 *
2325 */
2326void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002327 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
buzbee091cc402014-03-31 10:14:40 -07002328 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002329 int len_offset = mirror::Array::LengthOffset().Int32Value();
2330 int data_offset;
2331
buzbee695d13a2014-04-19 13:32:20 -07002332 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002333 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2334 } else {
2335 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2336 }
2337
buzbeea0cd2d72014-06-01 09:33:49 -07002338 rl_array = LoadValue(rl_array, kRefReg);
Mark Mendell343adb52013-12-18 06:02:17 -08002339 bool constant_index = rl_index.is_const;
2340 int32_t constant_index_value = 0;
2341 if (!constant_index) {
2342 rl_index = LoadValue(rl_index, kCoreReg);
2343 } else {
2344 // If index is constant, just fold it into the data offset
2345 constant_index_value = mir_graph_->ConstantValue(rl_index);
2346 data_offset += constant_index_value << scale;
2347 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002348 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002349 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002350
2351 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002352 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002353
2354 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002355 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002356 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002357 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002358 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002359 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002360 }
buzbee695d13a2014-04-19 13:32:20 -07002361 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002362 rl_src = LoadValueWide(rl_src, reg_class);
2363 } else {
2364 rl_src = LoadValue(rl_src, reg_class);
2365 }
2366 // If the src reg can't be byte accessed, move it to a temp first.
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002367 if ((size == kSignedByte || size == kUnsignedByte) && !IsByteRegister(rl_src.reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002368 RegStorage temp = AllocTemp();
2369 OpRegCopy(temp, rl_src.reg);
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002370 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002371 } else {
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002372 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002373 }
Ian Rogersa9a82542013-10-04 11:17:26 -07002374 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07002375 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08002376 if (!constant_index) {
buzbee091cc402014-03-31 10:14:40 -07002377 FreeTemp(rl_index.reg);
Mark Mendell343adb52013-12-18 06:02:17 -08002378 }
buzbee2700f7e2014-03-07 09:46:20 -08002379 MarkGCCard(rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002380 }
2381}
2382
Mark Mendell4708dcd2014-01-22 09:05:18 -08002383RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
2384 RegLocation rl_src, int shift_amount) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002385 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Elena Sayapinadd644502014-07-01 18:39:52 +07002386 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002387 OpKind op = static_cast<OpKind>(0); /* Make gcc happy */
2388 switch (opcode) {
2389 case Instruction::SHL_LONG:
2390 case Instruction::SHL_LONG_2ADDR:
2391 op = kOpLsl;
2392 break;
2393 case Instruction::SHR_LONG:
2394 case Instruction::SHR_LONG_2ADDR:
2395 op = kOpAsr;
2396 break;
2397 case Instruction::USHR_LONG:
2398 case Instruction::USHR_LONG_2ADDR:
2399 op = kOpLsr;
2400 break;
2401 default:
2402 LOG(FATAL) << "Unexpected case";
2403 }
2404 OpRegRegImm(op, rl_result.reg, rl_src.reg, shift_amount);
2405 } else {
2406 switch (opcode) {
2407 case Instruction::SHL_LONG:
2408 case Instruction::SHL_LONG_2ADDR:
2409 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
2410 if (shift_amount == 32) {
2411 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2412 LoadConstant(rl_result.reg.GetLow(), 0);
2413 } else if (shift_amount > 31) {
2414 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2415 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
2416 LoadConstant(rl_result.reg.GetLow(), 0);
2417 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002418 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002419 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2420 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(),
2421 shift_amount);
2422 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
2423 }
2424 break;
2425 case Instruction::SHR_LONG:
2426 case Instruction::SHR_LONG_2ADDR:
2427 if (shift_amount == 32) {
2428 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2429 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2430 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2431 } else if (shift_amount > 31) {
2432 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2433 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2434 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2435 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2436 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002437 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002438 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2439 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2440 shift_amount);
2441 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
2442 }
2443 break;
2444 case Instruction::USHR_LONG:
2445 case Instruction::USHR_LONG_2ADDR:
2446 if (shift_amount == 32) {
2447 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2448 LoadConstant(rl_result.reg.GetHigh(), 0);
2449 } else if (shift_amount > 31) {
2450 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2451 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2452 LoadConstant(rl_result.reg.GetHigh(), 0);
2453 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002454 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002455 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2456 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2457 shift_amount);
2458 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
2459 }
2460 break;
2461 default:
2462 LOG(FATAL) << "Unexpected case";
2463 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08002464 }
2465 return rl_result;
2466}
2467
Brian Carlstrom7940e442013-07-12 13:46:57 -07002468void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Mark Mendell4708dcd2014-01-22 09:05:18 -08002469 RegLocation rl_src, RegLocation rl_shift) {
2470 // Per spec, we only care about low 6 bits of shift amount.
2471 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
2472 if (shift_amount == 0) {
2473 rl_src = LoadValueWide(rl_src, kCoreReg);
2474 StoreValueWide(rl_dest, rl_src);
2475 return;
2476 } else if (shift_amount == 1 &&
2477 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
2478 // Need to handle this here to avoid calling StoreValueWide twice.
Andreas Gampec76c6142014-08-04 16:30:03 -07002479 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src);
Mark Mendell4708dcd2014-01-22 09:05:18 -08002480 return;
2481 }
2482 if (BadOverlap(rl_src, rl_dest)) {
2483 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
2484 return;
2485 }
2486 rl_src = LoadValueWide(rl_src, kCoreReg);
2487 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount);
2488 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002489}
2490
2491void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002492 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002493 bool isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002494 switch (opcode) {
2495 case Instruction::ADD_LONG:
2496 case Instruction::AND_LONG:
2497 case Instruction::OR_LONG:
2498 case Instruction::XOR_LONG:
2499 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002500 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002501 } else {
2502 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002503 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002504 }
2505 break;
2506 case Instruction::SUB_LONG:
2507 case Instruction::SUB_LONG_2ADDR:
2508 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002509 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002510 } else {
Andreas Gampec76c6142014-08-04 16:30:03 -07002511 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002512 isConstSuccess = true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002513 }
2514 break;
2515 case Instruction::ADD_LONG_2ADDR:
2516 case Instruction::OR_LONG_2ADDR:
2517 case Instruction::XOR_LONG_2ADDR:
2518 case Instruction::AND_LONG_2ADDR:
2519 if (rl_src2.is_const) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002520 if (GenerateTwoOperandInstructions()) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002521 isConstSuccess = GenLongImm(rl_dest, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002522 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07002523 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002524 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002525 } else {
2526 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002527 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002528 }
2529 break;
2530 default:
Chao-ying Fua0147762014-06-06 18:38:49 -07002531 isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002532 break;
2533 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002534
2535 if (!isConstSuccess) {
2536 // Default - bail to non-const handler.
2537 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
2538 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002539}
2540
2541bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
2542 switch (op) {
2543 case Instruction::AND_LONG_2ADDR:
2544 case Instruction::AND_LONG:
2545 return value == -1;
2546 case Instruction::OR_LONG:
2547 case Instruction::OR_LONG_2ADDR:
2548 case Instruction::XOR_LONG:
2549 case Instruction::XOR_LONG_2ADDR:
2550 return value == 0;
2551 default:
2552 return false;
2553 }
2554}
2555
2556X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
2557 bool is_high_op) {
2558 bool rhs_in_mem = rhs.location != kLocPhysReg;
2559 bool dest_in_mem = dest.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002560 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002561 DCHECK(!rhs_in_mem || !dest_in_mem);
2562 switch (op) {
2563 case Instruction::ADD_LONG:
2564 case Instruction::ADD_LONG_2ADDR:
2565 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002566 return is64Bit ? kX86Add64MR : is_high_op ? kX86Adc32MR : kX86Add32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002567 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002568 return is64Bit ? kX86Add64RM : is_high_op ? kX86Adc32RM : kX86Add32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002569 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002570 return is64Bit ? kX86Add64RR : is_high_op ? kX86Adc32RR : kX86Add32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002571 case Instruction::SUB_LONG:
2572 case Instruction::SUB_LONG_2ADDR:
2573 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002574 return is64Bit ? kX86Sub64MR : is_high_op ? kX86Sbb32MR : kX86Sub32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002575 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002576 return is64Bit ? kX86Sub64RM : is_high_op ? kX86Sbb32RM : kX86Sub32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002577 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002578 return is64Bit ? kX86Sub64RR : is_high_op ? kX86Sbb32RR : kX86Sub32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002579 case Instruction::AND_LONG_2ADDR:
2580 case Instruction::AND_LONG:
2581 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002582 return is64Bit ? kX86And64MR : kX86And32MR;
2583 }
2584 if (is64Bit) {
2585 return rhs_in_mem ? kX86And64RM : kX86And64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002586 }
2587 return rhs_in_mem ? kX86And32RM : kX86And32RR;
2588 case Instruction::OR_LONG:
2589 case Instruction::OR_LONG_2ADDR:
2590 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002591 return is64Bit ? kX86Or64MR : kX86Or32MR;
2592 }
2593 if (is64Bit) {
2594 return rhs_in_mem ? kX86Or64RM : kX86Or64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002595 }
2596 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
2597 case Instruction::XOR_LONG:
2598 case Instruction::XOR_LONG_2ADDR:
2599 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002600 return is64Bit ? kX86Xor64MR : kX86Xor32MR;
2601 }
2602 if (is64Bit) {
2603 return rhs_in_mem ? kX86Xor64RM : kX86Xor64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002604 }
2605 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
2606 default:
2607 LOG(FATAL) << "Unexpected opcode: " << op;
2608 return kX86Add32RR;
2609 }
2610}
2611
2612X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
2613 int32_t value) {
2614 bool in_mem = loc.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002615 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002616 bool byte_imm = IS_SIMM8(value);
buzbee091cc402014-03-31 10:14:40 -07002617 DCHECK(in_mem || !loc.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002618 switch (op) {
2619 case Instruction::ADD_LONG:
2620 case Instruction::ADD_LONG_2ADDR:
2621 if (byte_imm) {
2622 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002623 return is64Bit ? kX86Add64MI8 : is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002624 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002625 return is64Bit ? kX86Add64RI8 : is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002626 }
2627 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002628 return is64Bit ? kX86Add64MI : is_high_op ? kX86Adc32MI : kX86Add32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002629 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002630 return is64Bit ? kX86Add64RI : is_high_op ? kX86Adc32RI : kX86Add32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002631 case Instruction::SUB_LONG:
2632 case Instruction::SUB_LONG_2ADDR:
2633 if (byte_imm) {
2634 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002635 return is64Bit ? kX86Sub64MI8 : is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002636 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002637 return is64Bit ? kX86Sub64RI8 : is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002638 }
2639 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002640 return is64Bit ? kX86Sub64MI : is_high_op ? kX86Sbb32MI : kX86Sub32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002641 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002642 return is64Bit ? kX86Sub64RI : is_high_op ? kX86Sbb32RI : kX86Sub32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002643 case Instruction::AND_LONG_2ADDR:
2644 case Instruction::AND_LONG:
2645 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002646 if (is64Bit) {
2647 return in_mem ? kX86And64MI8 : kX86And64RI8;
2648 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002649 return in_mem ? kX86And32MI8 : kX86And32RI8;
2650 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002651 if (is64Bit) {
2652 return in_mem ? kX86And64MI : kX86And64RI;
2653 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002654 return in_mem ? kX86And32MI : kX86And32RI;
2655 case Instruction::OR_LONG:
2656 case Instruction::OR_LONG_2ADDR:
2657 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002658 if (is64Bit) {
2659 return in_mem ? kX86Or64MI8 : kX86Or64RI8;
2660 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002661 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
2662 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002663 if (is64Bit) {
2664 return in_mem ? kX86Or64MI : kX86Or64RI;
2665 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002666 return in_mem ? kX86Or32MI : kX86Or32RI;
2667 case Instruction::XOR_LONG:
2668 case Instruction::XOR_LONG_2ADDR:
2669 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002670 if (is64Bit) {
2671 return in_mem ? kX86Xor64MI8 : kX86Xor64RI8;
2672 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002673 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
2674 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002675 if (is64Bit) {
2676 return in_mem ? kX86Xor64MI : kX86Xor64RI;
2677 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002678 return in_mem ? kX86Xor32MI : kX86Xor32RI;
2679 default:
2680 LOG(FATAL) << "Unexpected opcode: " << op;
2681 return kX86Add32MI;
2682 }
2683}
2684
Chao-ying Fua0147762014-06-06 18:38:49 -07002685bool X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002686 DCHECK(rl_src.is_const);
2687 int64_t val = mir_graph_->ConstantValueWide(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07002688
Elena Sayapinadd644502014-07-01 18:39:52 +07002689 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002690 // We can do with imm only if it fits 32 bit
2691 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2692 return false;
2693 }
2694
2695 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
2696
2697 if ((rl_dest.location == kLocDalvikFrame) ||
2698 (rl_dest.location == kLocCompilerTemp)) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002699 int r_base = rs_rX86_SP.GetReg();
Chao-ying Fua0147762014-06-06 18:38:49 -07002700 int displacement = SRegOffset(rl_dest.s_reg_low);
2701
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002702 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002703 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
2704 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val);
2705 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2706 true /* is_load */, true /* is64bit */);
2707 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2708 false /* is_load */, true /* is64bit */);
2709 return true;
2710 }
2711
2712 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2713 DCHECK_EQ(rl_result.location, kLocPhysReg);
2714 DCHECK(!rl_result.reg.IsFloat());
2715
2716 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2717 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2718
2719 StoreValueWide(rl_dest, rl_result);
2720 return true;
2721 }
2722
Mark Mendelle02d48f2014-01-15 11:19:23 -08002723 int32_t val_lo = Low32Bits(val);
2724 int32_t val_hi = High32Bits(val);
buzbee30adc732014-05-09 15:10:18 -07002725 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002726
2727 // Can we just do this into memory?
2728 if ((rl_dest.location == kLocDalvikFrame) ||
2729 (rl_dest.location == kLocCompilerTemp)) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002730 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002731 int displacement = SRegOffset(rl_dest.s_reg_low);
2732
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002733 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002734 if (!IsNoOp(op, val_lo)) {
2735 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002736 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002737 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002738 true /* is_load */, true /* is64bit */);
2739 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002740 false /* is_load */, true /* is64bit */);
2741 }
2742 if (!IsNoOp(op, val_hi)) {
2743 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08002744 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002745 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002746 true /* is_load */, true /* is64bit */);
2747 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002748 false /* is_load */, true /* is64bit */);
2749 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002750 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002751 }
2752
2753 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2754 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee091cc402014-03-31 10:14:40 -07002755 DCHECK(!rl_result.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002756
2757 if (!IsNoOp(op, val_lo)) {
2758 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002759 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002760 }
2761 if (!IsNoOp(op, val_hi)) {
2762 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002763 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002764 }
2765 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002766 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002767}
2768
Chao-ying Fua0147762014-06-06 18:38:49 -07002769bool X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002770 RegLocation rl_src2, Instruction::Code op) {
2771 DCHECK(rl_src2.is_const);
2772 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002773
Elena Sayapinadd644502014-07-01 18:39:52 +07002774 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002775 // We can do with imm only if it fits 32 bit
2776 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2777 return false;
2778 }
2779 if (rl_dest.location == kLocPhysReg &&
2780 rl_src1.location == kLocPhysReg && !rl_dest.reg.IsFloat()) {
2781 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002782 OpRegCopy(rl_dest.reg, rl_src1.reg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002783 NewLIR2(x86op, rl_dest.reg.GetReg(), val);
2784 StoreFinalValueWide(rl_dest, rl_dest);
2785 return true;
2786 }
2787
2788 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2789 // We need the values to be in a temporary
2790 RegLocation rl_result = ForceTempWide(rl_src1);
2791
2792 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2793 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2794
2795 StoreFinalValueWide(rl_dest, rl_result);
2796 return true;
2797 }
2798
Mark Mendelle02d48f2014-01-15 11:19:23 -08002799 int32_t val_lo = Low32Bits(val);
2800 int32_t val_hi = High32Bits(val);
buzbee30adc732014-05-09 15:10:18 -07002801 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
2802 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002803
2804 // Can we do this directly into the destination registers?
2805 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08002806 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
buzbee091cc402014-03-31 10:14:40 -07002807 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() && !rl_dest.reg.IsFloat()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002808 if (!IsNoOp(op, val_lo)) {
2809 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002810 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002811 }
2812 if (!IsNoOp(op, val_hi)) {
2813 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002814 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002815 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07002816
2817 StoreFinalValueWide(rl_dest, rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07002818 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002819 }
2820
2821 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2822 DCHECK_EQ(rl_src1.location, kLocPhysReg);
2823
2824 // We need the values to be in a temporary
2825 RegLocation rl_result = ForceTempWide(rl_src1);
2826 if (!IsNoOp(op, val_lo)) {
2827 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002828 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002829 }
2830 if (!IsNoOp(op, val_hi)) {
2831 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002832 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002833 }
2834
2835 StoreFinalValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002836 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07002837}
2838
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002839// For final classes there are no sub-classes to check and so we can answer the instance-of
2840// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
2841void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
2842 RegLocation rl_dest, RegLocation rl_src) {
buzbeea0cd2d72014-06-01 09:33:49 -07002843 RegLocation object = LoadValue(rl_src, kRefReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002844 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002845 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002846
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002847 // For 32-bit, SETcc only works with EAX..EDX.
Chao-ying Fua77ee512014-07-01 17:43:41 -07002848 RegStorage object_32reg = object.reg.Is64Bit() ? As32BitReg(object.reg) : object.reg;
Dmitry Petrochenko407f5c12014-07-01 01:21:38 +07002849 if (result_reg.GetRegNum() == object_32reg.GetRegNum() || !IsByteRegister(result_reg)) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002850 result_reg = AllocateByteRegister();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002851 }
2852
2853 // Assume that there is no match.
2854 LoadConstant(result_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -08002855 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, NULL);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002856
Mark Mendellade54a22014-06-09 12:49:55 -04002857 // We will use this register to compare to memory below.
2858 // References are 32 bit in memory, and 64 bit in registers (in 64 bit mode).
2859 // For this reason, force allocation of a 32 bit register to use, so that the
2860 // compare to memory will be done using a 32 bit comparision.
2861 // The LoadRefDisp(s) below will work normally, even in 64 bit mode.
2862 RegStorage check_class = AllocTemp();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002863
2864 // If Method* is already in a register, we can save a copy.
2865 RegLocation rl_method = mir_graph_->GetMethodLoc();
Andreas Gampeccc60262014-07-04 18:02:38 -07002866 int32_t offset_of_type = mirror::Array::DataOffset(
2867 sizeof(mirror::HeapReference<mirror::Class*>)).Int32Value() +
2868 (sizeof(mirror::HeapReference<mirror::Class*>) * type_idx);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002869
2870 if (rl_method.location == kLocPhysReg) {
2871 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002872 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002873 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002874 } else {
buzbee695d13a2014-04-19 13:32:20 -07002875 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002876 check_class, kNotVolatile);
2877 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002878 }
2879 } else {
2880 LoadCurrMethodDirect(check_class);
2881 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002882 LoadRefDisp(check_class, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002883 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002884 } else {
buzbee695d13a2014-04-19 13:32:20 -07002885 LoadRefDisp(check_class, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002886 check_class, kNotVolatile);
2887 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002888 }
2889 }
2890
2891 // Compare the computed class to the class in the object.
2892 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08002893 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002894
2895 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08002896 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002897
2898 LIR* target = NewLIR0(kPseudoTargetLabel);
2899 null_branchover->target = target;
2900 FreeTemp(check_class);
2901 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002902 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002903 FreeTemp(result_reg);
2904 }
2905 StoreValue(rl_dest, rl_result);
2906}
2907
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002908void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
2909 RegLocation rl_lhs, RegLocation rl_rhs) {
2910 OpKind op = kOpBkpt;
2911 bool is_div_rem = false;
2912 bool unary = false;
2913 bool shift_op = false;
2914 bool is_two_addr = false;
2915 RegLocation rl_result;
2916 switch (opcode) {
2917 case Instruction::NEG_INT:
2918 op = kOpNeg;
2919 unary = true;
2920 break;
2921 case Instruction::NOT_INT:
2922 op = kOpMvn;
2923 unary = true;
2924 break;
2925 case Instruction::ADD_INT_2ADDR:
2926 is_two_addr = true;
2927 // Fallthrough
2928 case Instruction::ADD_INT:
2929 op = kOpAdd;
2930 break;
2931 case Instruction::SUB_INT_2ADDR:
2932 is_two_addr = true;
2933 // Fallthrough
2934 case Instruction::SUB_INT:
2935 op = kOpSub;
2936 break;
2937 case Instruction::MUL_INT_2ADDR:
2938 is_two_addr = true;
2939 // Fallthrough
2940 case Instruction::MUL_INT:
2941 op = kOpMul;
2942 break;
2943 case Instruction::DIV_INT_2ADDR:
2944 is_two_addr = true;
2945 // Fallthrough
2946 case Instruction::DIV_INT:
2947 op = kOpDiv;
2948 is_div_rem = true;
2949 break;
2950 /* NOTE: returns in kArg1 */
2951 case Instruction::REM_INT_2ADDR:
2952 is_two_addr = true;
2953 // Fallthrough
2954 case Instruction::REM_INT:
2955 op = kOpRem;
2956 is_div_rem = true;
2957 break;
2958 case Instruction::AND_INT_2ADDR:
2959 is_two_addr = true;
2960 // Fallthrough
2961 case Instruction::AND_INT:
2962 op = kOpAnd;
2963 break;
2964 case Instruction::OR_INT_2ADDR:
2965 is_two_addr = true;
2966 // Fallthrough
2967 case Instruction::OR_INT:
2968 op = kOpOr;
2969 break;
2970 case Instruction::XOR_INT_2ADDR:
2971 is_two_addr = true;
2972 // Fallthrough
2973 case Instruction::XOR_INT:
2974 op = kOpXor;
2975 break;
2976 case Instruction::SHL_INT_2ADDR:
2977 is_two_addr = true;
2978 // Fallthrough
2979 case Instruction::SHL_INT:
2980 shift_op = true;
2981 op = kOpLsl;
2982 break;
2983 case Instruction::SHR_INT_2ADDR:
2984 is_two_addr = true;
2985 // Fallthrough
2986 case Instruction::SHR_INT:
2987 shift_op = true;
2988 op = kOpAsr;
2989 break;
2990 case Instruction::USHR_INT_2ADDR:
2991 is_two_addr = true;
2992 // Fallthrough
2993 case Instruction::USHR_INT:
2994 shift_op = true;
2995 op = kOpLsr;
2996 break;
2997 default:
2998 LOG(FATAL) << "Invalid word arith op: " << opcode;
2999 }
3000
Mark Mendelle87f9b52014-04-30 14:13:18 -04003001 // Can we convert to a two address instruction?
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003002 if (!is_two_addr &&
3003 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3004 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04003005 is_two_addr = true;
3006 }
3007
3008 if (!GenerateTwoOperandInstructions()) {
3009 is_two_addr = false;
3010 }
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003011
3012 // Get the div/rem stuff out of the way.
3013 if (is_div_rem) {
3014 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, true);
3015 StoreValue(rl_dest, rl_result);
3016 return;
3017 }
3018
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003019 // If we generate any memory access below, it will reference a dalvik reg.
3020 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
3021
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003022 if (unary) {
3023 rl_lhs = LoadValue(rl_lhs, kCoreReg);
buzbee30adc732014-05-09 15:10:18 -07003024 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003025 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003026 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003027 } else {
3028 if (shift_op) {
3029 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003030 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003031 LoadValueDirectFixed(rl_rhs, t_reg);
3032 if (is_two_addr) {
3033 // Can we do this directly into memory?
buzbee30adc732014-05-09 15:10:18 -07003034 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003035 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3036 if (rl_result.location != kLocPhysReg) {
3037 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08003038 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003039 FreeTemp(t_reg);
3040 return;
buzbee091cc402014-03-31 10:14:40 -07003041 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003042 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08003043 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003044 FreeTemp(t_reg);
3045 StoreFinalValue(rl_dest, rl_result);
3046 return;
3047 }
3048 }
3049 // Three address form, or we can't do directly.
3050 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3051 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003052 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003053 FreeTemp(t_reg);
3054 } else {
3055 // Multiply is 3 operand only (sort of).
3056 if (is_two_addr && op != kOpMul) {
3057 // Can we do this directly into memory?
buzbee30adc732014-05-09 15:10:18 -07003058 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003059 if (rl_result.location == kLocPhysReg) {
Serguei Katkov366f8ae2014-04-15 16:55:26 +07003060 // Ensure res is in a core reg
3061 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003062 // Can we do this from memory directly?
buzbee30adc732014-05-09 15:10:18 -07003063 rl_rhs = UpdateLocTyped(rl_rhs, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003064 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08003065 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003066 StoreFinalValue(rl_dest, rl_result);
3067 return;
buzbee091cc402014-03-31 10:14:40 -07003068 } else if (!rl_rhs.reg.IsFloat()) {
buzbee2700f7e2014-03-07 09:46:20 -08003069 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003070 StoreFinalValue(rl_dest, rl_result);
3071 return;
3072 }
3073 }
3074 rl_rhs = LoadValue(rl_rhs, kCoreReg);
Serguei Katkovd293fb42014-05-19 15:45:42 +07003075 // It might happen rl_rhs and rl_dest are the same VR
3076 // in this case rl_dest is in reg after LoadValue while
3077 // rl_result is not updated yet, so do this
3078 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003079 if (rl_result.location != kLocPhysReg) {
3080 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00003081 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003082 return;
buzbee091cc402014-03-31 10:14:40 -07003083 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003084 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08003085 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003086 StoreFinalValue(rl_dest, rl_result);
3087 return;
3088 } else {
3089 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3090 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003091 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003092 }
3093 } else {
3094 // Try to use reg/memory instructions.
buzbee30adc732014-05-09 15:10:18 -07003095 rl_lhs = UpdateLocTyped(rl_lhs, kCoreReg);
3096 rl_rhs = UpdateLocTyped(rl_rhs, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003097 // We can't optimize with FP registers.
3098 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
3099 // Something is difficult, so fall back to the standard case.
3100 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3101 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3102 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003103 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003104 } else {
3105 // We can optimize by moving to result and using memory operands.
3106 if (rl_rhs.location != kLocPhysReg) {
3107 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07003108 // We should be careful with order here
3109 // If rl_dest and rl_lhs points to the same VR we should load first
3110 // If the are different we should find a register first for dest
Chao-ying Fua0147762014-06-06 18:38:49 -07003111 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3112 mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
Serguei Katkov66da1362014-03-14 13:33:33 +07003113 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3114 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendelle87f9b52014-04-30 14:13:18 -04003115 // No-op if these are the same.
3116 OpRegCopy(rl_result.reg, rl_lhs.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003117 } else {
3118 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003119 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003120 }
buzbee2700f7e2014-03-07 09:46:20 -08003121 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003122 } else if (rl_lhs.location != kLocPhysReg) {
3123 // RHS is in a register; LHS is in memory.
3124 if (op != kOpSub) {
3125 // Force RHS into result and operate on memory.
3126 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003127 OpRegCopy(rl_result.reg, rl_rhs.reg);
3128 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003129 } else {
3130 // Subtraction isn't commutative.
3131 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3132 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3133 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003134 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003135 }
3136 } else {
3137 // Both are in registers.
3138 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3139 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3140 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003141 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003142 }
3143 }
3144 }
3145 }
3146 }
3147 StoreValue(rl_dest, rl_result);
3148}
3149
3150bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
3151 // If we have non-core registers, then we can't do good things.
buzbee091cc402014-03-31 10:14:40 -07003152 if (rl_lhs.location == kLocPhysReg && rl_lhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003153 return false;
3154 }
buzbee091cc402014-03-31 10:14:40 -07003155 if (rl_rhs.location == kLocPhysReg && rl_rhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003156 return false;
3157 }
3158
3159 // Everything will be fine :-).
3160 return true;
3161}
Chao-ying Fua0147762014-06-06 18:38:49 -07003162
3163void X86Mir2Lir::GenIntToLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003164 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07003165 Mir2Lir::GenIntToLong(rl_dest, rl_src);
3166 return;
3167 }
Serguei Katkove63d9d42014-06-25 00:25:35 +07003168 rl_src = UpdateLocTyped(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003169 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
3170 if (rl_src.location == kLocPhysReg) {
3171 NewLIR2(kX86MovsxdRR, rl_result.reg.GetReg(), rl_src.reg.GetReg());
3172 } else {
3173 int displacement = SRegOffset(rl_src.s_reg_low);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003174 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003175 LIR *m = NewLIR3(kX86MovsxdRM, rl_result.reg.GetReg(), rs_rX86_SP.GetReg(),
3176 displacement + LOWORD_OFFSET);
3177 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
3178 true /* is_load */, true /* is_64bit */);
3179 }
3180 StoreValueWide(rl_dest, rl_result);
3181}
3182
3183void X86Mir2Lir::GenShiftOpLong(Instruction::Code opcode, RegLocation rl_dest,
3184 RegLocation rl_src1, RegLocation rl_shift) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003185 if (!cu_->target64) {
Yixin Shouf40f8902014-08-14 14:10:32 -04003186 // Long shift operations in 32-bit. Use shld or shrd to create a 32-bit register filled from
3187 // the other half, shift the other half, if the shift amount is less than 32 we're done,
3188 // otherwise move one register to the other and place zero or sign bits in the other.
3189 LIR* branch;
3190 FlushAllRegs();
3191 LockCallTemps();
3192 LoadValueDirectFixed(rl_shift, rs_rCX);
3193 RegStorage r_tmp = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
3194 LoadValueDirectWideFixed(rl_src1, r_tmp);
3195 switch (opcode) {
3196 case Instruction::SHL_LONG:
3197 case Instruction::SHL_LONG_2ADDR:
3198 NewLIR3(kX86Shld32RRC, r_tmp.GetHighReg(), r_tmp.GetLowReg(), rs_rCX.GetReg());
3199 NewLIR2(kX86Sal32RC, r_tmp.GetLowReg(), rs_rCX.GetReg());
3200 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3201 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3202 OpRegCopy(r_tmp.GetHigh(), r_tmp.GetLow());
3203 LoadConstant(r_tmp.GetLow(), 0);
3204 branch->target = NewLIR0(kPseudoTargetLabel);
3205 break;
3206 case Instruction::SHR_LONG:
3207 case Instruction::SHR_LONG_2ADDR:
3208 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(), rs_rCX.GetReg());
3209 NewLIR2(kX86Sar32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3210 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3211 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3212 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3213 NewLIR2(kX86Sar32RI, r_tmp.GetHighReg(), 31);
3214 branch->target = NewLIR0(kPseudoTargetLabel);
3215 break;
3216 case Instruction::USHR_LONG:
3217 case Instruction::USHR_LONG_2ADDR:
3218 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(),
3219 rs_rCX.GetReg());
3220 NewLIR2(kX86Shr32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3221 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3222 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3223 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3224 LoadConstant(r_tmp.GetHigh(), 0);
3225 branch->target = NewLIR0(kPseudoTargetLabel);
3226 break;
3227 default:
3228 LOG(FATAL) << "Unexpected case: " << opcode;
3229 return;
3230 }
3231 RegLocation rl_result = LocCReturnWide();
3232 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07003233 return;
3234 }
3235
3236 bool is_two_addr = false;
3237 OpKind op = kOpBkpt;
3238 RegLocation rl_result;
3239
3240 switch (opcode) {
3241 case Instruction::SHL_LONG_2ADDR:
3242 is_two_addr = true;
3243 // Fallthrough
3244 case Instruction::SHL_LONG:
3245 op = kOpLsl;
3246 break;
3247 case Instruction::SHR_LONG_2ADDR:
3248 is_two_addr = true;
3249 // Fallthrough
3250 case Instruction::SHR_LONG:
3251 op = kOpAsr;
3252 break;
3253 case Instruction::USHR_LONG_2ADDR:
3254 is_two_addr = true;
3255 // Fallthrough
3256 case Instruction::USHR_LONG:
3257 op = kOpLsr;
3258 break;
3259 default:
3260 op = kOpBkpt;
3261 }
3262
3263 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003264 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Chao-ying Fua0147762014-06-06 18:38:49 -07003265 LoadValueDirectFixed(rl_shift, t_reg);
3266 if (is_two_addr) {
3267 // Can we do this directly into memory?
3268 rl_result = UpdateLocWideTyped(rl_dest, kCoreReg);
3269 if (rl_result.location != kLocPhysReg) {
3270 // Okay, we can do this into memory
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003271 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003272 OpMemReg(op, rl_result, t_reg.GetReg());
3273 } else if (!rl_result.reg.IsFloat()) {
3274 // Can do this directly into the result register
3275 OpRegReg(op, rl_result.reg, t_reg);
3276 StoreFinalValueWide(rl_dest, rl_result);
3277 }
3278 } else {
3279 // Three address form, or we can't do directly.
3280 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
3281 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
3282 OpRegRegReg(op, rl_result.reg, rl_src1.reg, t_reg);
3283 StoreFinalValueWide(rl_dest, rl_result);
3284 }
3285
3286 FreeTemp(t_reg);
3287}
3288
Brian Carlstrom7940e442013-07-12 13:46:57 -07003289} // namespace art