blob: acf5599d5f45739ce3a5ceb1fe667b85999a2f8e [file] [log] [blame]
Brian Carlstrom7940e442013-07-12 13:46:57 -07001/*
2 * Copyright (C) 2012 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17/* This file contains codegen for the X86 ISA */
18
19#include "codegen_x86.h"
20#include "dex/quick/mir_to_lir-inl.h"
buzbeeb5860fb2014-06-21 15:31:01 -070021#include "dex/reg_storage_eq.h"
Mingyao Yang98d1cc82014-05-15 17:02:16 -070022#include "mirror/art_method.h"
Ian Rogers7e70b002014-10-08 11:47:24 -070023#include "mirror/array-inl.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070024#include "x86_lir.h"
25
26namespace art {
27
28/*
Brian Carlstrom7940e442013-07-12 13:46:57 -070029 * Compare two 64-bit values
30 * x = y return 0
31 * x < y return -1
32 * x > y return 1
33 */
34void X86Mir2Lir::GenCmpLong(RegLocation rl_dest, RegLocation rl_src1,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070035 RegLocation rl_src2) {
Elena Sayapinadd644502014-07-01 18:39:52 +070036 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -070037 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
38 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
39 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Chao-ying Fua0147762014-06-06 18:38:49 -070040 RegStorage temp_reg = AllocTemp();
Serguei Katkov1c557032014-06-23 13:23:38 +070041 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
42 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondG); // result = (src1 > src2) ? 1 : 0
43 NewLIR2(kX86Set8R, temp_reg.GetReg(), kX86CondL); // temp = (src1 >= src2) ? 0 : 1
44 NewLIR2(kX86Sub8RR, rl_result.reg.GetReg(), temp_reg.GetReg());
45 NewLIR2(kX86Movsx8qRR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Serguei Katkov04982232014-06-20 18:17:16 +070046
Chao-ying Fua0147762014-06-06 18:38:49 -070047 StoreValue(rl_dest, rl_result);
48 FreeTemp(temp_reg);
49 return;
50 }
51
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +070052 // Prepare for explicit register usage
53 ExplicitTempRegisterLock(this, 4, &rs_r0, &rs_r1, &rs_r2, &rs_r3);
buzbee091cc402014-03-31 10:14:40 -070054 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
55 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -080056 LoadValueDirectWideFixed(rl_src1, r_tmp1);
57 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Brian Carlstrom7940e442013-07-12 13:46:57 -070058 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -080059 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
60 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
buzbee091cc402014-03-31 10:14:40 -070061 NewLIR2(kX86Set8R, rs_r2.GetReg(), kX86CondL); // r2 = (r1:r0) < (r3:r2) ? 1 : 0
62 NewLIR2(kX86Movzx8RR, rs_r2.GetReg(), rs_r2.GetReg());
buzbee2700f7e2014-03-07 09:46:20 -080063 OpReg(kOpNeg, rs_r2); // r2 = -r2
64 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = high | low - sets ZF
buzbee091cc402014-03-31 10:14:40 -070065 NewLIR2(kX86Set8R, rs_r0.GetReg(), kX86CondNz); // r0 = (r1:r0) != (r3:r2) ? 1 : 0
Brian Carlstrom7940e442013-07-12 13:46:57 -070066 NewLIR2(kX86Movzx8RR, r0, r0);
buzbee2700f7e2014-03-07 09:46:20 -080067 OpRegReg(kOpOr, rs_r0, rs_r2); // r0 = r0 | r2
Brian Carlstrom7940e442013-07-12 13:46:57 -070068 RegLocation rl_result = LocCReturn();
69 StoreValue(rl_dest, rl_result);
70}
71
72X86ConditionCode X86ConditionEncoding(ConditionCode cond) {
73 switch (cond) {
74 case kCondEq: return kX86CondEq;
75 case kCondNe: return kX86CondNe;
76 case kCondCs: return kX86CondC;
77 case kCondCc: return kX86CondNc;
Vladimir Marko58af1f92013-12-19 13:31:15 +000078 case kCondUlt: return kX86CondC;
79 case kCondUge: return kX86CondNc;
Brian Carlstrom7940e442013-07-12 13:46:57 -070080 case kCondMi: return kX86CondS;
81 case kCondPl: return kX86CondNs;
82 case kCondVs: return kX86CondO;
83 case kCondVc: return kX86CondNo;
84 case kCondHi: return kX86CondA;
85 case kCondLs: return kX86CondBe;
86 case kCondGe: return kX86CondGe;
87 case kCondLt: return kX86CondL;
88 case kCondGt: return kX86CondG;
89 case kCondLe: return kX86CondLe;
90 case kCondAl:
91 case kCondNv: LOG(FATAL) << "Should not reach here";
92 }
93 return kX86CondO;
94}
95
buzbee2700f7e2014-03-07 09:46:20 -080096LIR* X86Mir2Lir::OpCmpBranch(ConditionCode cond, RegStorage src1, RegStorage src2, LIR* target) {
Chao-ying Fua77ee512014-07-01 17:43:41 -070097 NewLIR2(src1.Is64Bit() ? kX86Cmp64RR : kX86Cmp32RR, src1.GetReg(), src2.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -070098 X86ConditionCode cc = X86ConditionEncoding(cond);
99 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ ,
100 cc);
101 branch->target = target;
102 return branch;
103}
104
buzbee2700f7e2014-03-07 09:46:20 -0800105LIR* X86Mir2Lir::OpCmpImmBranch(ConditionCode cond, RegStorage reg,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700106 int check_value, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700107 if ((check_value == 0) && (cond == kCondEq || cond == kCondNe)) {
108 // TODO: when check_value == 0 and reg is rCX, use the jcxz/nz opcode
Chao-ying Fua77ee512014-07-01 17:43:41 -0700109 NewLIR2(reg.Is64Bit() ? kX86Test64RR: kX86Test32RR, reg.GetReg(), reg.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700110 } else {
Chao-ying Fua77ee512014-07-01 17:43:41 -0700111 if (reg.Is64Bit()) {
112 NewLIR2(IS_SIMM8(check_value) ? kX86Cmp64RI8 : kX86Cmp64RI, reg.GetReg(), check_value);
113 } else {
114 NewLIR2(IS_SIMM8(check_value) ? kX86Cmp32RI8 : kX86Cmp32RI, reg.GetReg(), check_value);
115 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700116 }
117 X86ConditionCode cc = X86ConditionEncoding(cond);
118 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ , cc);
119 branch->target = target;
120 return branch;
121}
122
buzbee2700f7e2014-03-07 09:46:20 -0800123LIR* X86Mir2Lir::OpRegCopyNoInsert(RegStorage r_dest, RegStorage r_src) {
124 // If src or dest is a pair, we'll be using low reg.
125 if (r_dest.IsPair()) {
126 r_dest = r_dest.GetLow();
127 }
128 if (r_src.IsPair()) {
129 r_src = r_src.GetLow();
130 }
buzbee091cc402014-03-31 10:14:40 -0700131 if (r_dest.IsFloat() || r_src.IsFloat())
Brian Carlstrom7940e442013-07-12 13:46:57 -0700132 return OpFpRegCopy(r_dest, r_src);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700133 LIR* res = RawLIR(current_dalvik_offset_, r_dest.Is64Bit() ? kX86Mov64RR : kX86Mov32RR,
buzbee2700f7e2014-03-07 09:46:20 -0800134 r_dest.GetReg(), r_src.GetReg());
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800135 if (!(cu_->disable_opt & (1 << kSafeOptimizations)) && r_dest == r_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700136 res->flags.is_nop = true;
137 }
138 return res;
139}
140
buzbee7a11ab02014-04-28 20:02:38 -0700141void X86Mir2Lir::OpRegCopy(RegStorage r_dest, RegStorage r_src) {
142 if (r_dest != r_src) {
143 LIR *res = OpRegCopyNoInsert(r_dest, r_src);
144 AppendLIR(res);
145 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700146}
147
buzbee2700f7e2014-03-07 09:46:20 -0800148void X86Mir2Lir::OpRegCopyWide(RegStorage r_dest, RegStorage r_src) {
buzbee7a11ab02014-04-28 20:02:38 -0700149 if (r_dest != r_src) {
buzbee091cc402014-03-31 10:14:40 -0700150 bool dest_fp = r_dest.IsFloat();
151 bool src_fp = r_src.IsFloat();
buzbee7a11ab02014-04-28 20:02:38 -0700152 if (dest_fp) {
153 if (src_fp) {
buzbee091cc402014-03-31 10:14:40 -0700154 OpRegCopy(r_dest, r_src);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700155 } else {
buzbee7a11ab02014-04-28 20:02:38 -0700156 // TODO: Prevent this from happening in the code. The result is often
157 // unused or could have been loaded more easily from memory.
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700158 if (!r_src.IsPair()) {
159 DCHECK(!r_dest.IsPair());
160 NewLIR2(kX86MovqxrRR, r_dest.GetReg(), r_src.GetReg());
161 } else {
162 NewLIR2(kX86MovdxrRR, r_dest.GetReg(), r_src.GetLowReg());
163 RegStorage r_tmp = AllocTempDouble();
164 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), r_src.GetHighReg());
165 NewLIR2(kX86PunpckldqRR, r_dest.GetReg(), r_tmp.GetReg());
166 FreeTemp(r_tmp);
167 }
buzbee7a11ab02014-04-28 20:02:38 -0700168 }
169 } else {
170 if (src_fp) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700171 if (!r_dest.IsPair()) {
172 DCHECK(!r_src.IsPair());
173 NewLIR2(kX86MovqrxRR, r_dest.GetReg(), r_src.GetReg());
buzbee7a11ab02014-04-28 20:02:38 -0700174 } else {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700175 NewLIR2(kX86MovdrxRR, r_dest.GetLowReg(), r_src.GetReg());
176 RegStorage temp_reg = AllocTempDouble();
177 NewLIR2(kX86MovsdRR, temp_reg.GetReg(), r_src.GetReg());
178 NewLIR2(kX86PsrlqRI, temp_reg.GetReg(), 32);
179 NewLIR2(kX86MovdrxRR, r_dest.GetHighReg(), temp_reg.GetReg());
180 }
181 } else {
182 DCHECK_EQ(r_dest.IsPair(), r_src.IsPair());
183 if (!r_src.IsPair()) {
184 // Just copy the register directly.
185 OpRegCopy(r_dest, r_src);
186 } else {
187 // Handle overlap
188 if (r_src.GetHighReg() == r_dest.GetLowReg() &&
189 r_src.GetLowReg() == r_dest.GetHighReg()) {
190 // Deal with cycles.
191 RegStorage temp_reg = AllocTemp();
192 OpRegCopy(temp_reg, r_dest.GetHigh());
193 OpRegCopy(r_dest.GetHigh(), r_dest.GetLow());
194 OpRegCopy(r_dest.GetLow(), temp_reg);
195 FreeTemp(temp_reg);
196 } else if (r_src.GetHighReg() == r_dest.GetLowReg()) {
197 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
198 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
199 } else {
200 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
201 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
202 }
buzbee7a11ab02014-04-28 20:02:38 -0700203 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700204 }
205 }
206 }
207}
208
Andreas Gampe90969af2014-07-15 23:02:11 -0700209void X86Mir2Lir::GenSelectConst32(RegStorage left_op, RegStorage right_op, ConditionCode code,
210 int32_t true_val, int32_t false_val, RegStorage rs_dest,
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
Mark Mendella65c1db2014-10-21 17:44:32 -0400861 if (rl_dest.s_reg_low == INVALID_SREG) {
862 // Result is unused, the code is dead. Inlining successful, no code generated.
863 return true;
864 }
865
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700866 /*
867 * If the result register is the same as the second element, then we
868 * need to be careful. The reason is that the first copy will
869 * inadvertently clobber the second element with the first one thus
870 * yielding the wrong result. Thus we do a swap in that case.
871 */
872 res_vreg = mir_graph_->SRegToVReg(rl_dest.s_reg_low);
873 src2_vreg = mir_graph_->SRegToVReg(rl_src2.s_reg_low);
874 if (res_vreg == src2_vreg) {
875 std::swap(rl_src1, rl_src2);
876 }
877
878 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
879 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
880
881 // Pick the first integer as min/max.
882 OpRegCopyWide(rl_result.reg, rl_src1.reg);
883
884 /*
885 * If the integers are both in the same register, then there is
886 * nothing else to do because they are equal and we have already
887 * moved one into the result.
888 */
889 src1_vreg = mir_graph_->SRegToVReg(rl_src1.s_reg_low);
890 src2_vreg = mir_graph_->SRegToVReg(rl_src2.s_reg_low);
891 if (src1_vreg == src2_vreg) {
892 StoreValueWide(rl_dest, rl_result);
893 return true;
894 }
895
896 // Free registers to make some room for the second operand.
897 // But don't try to free ourselves or promoted registers.
898 if (res_vreg != src1_vreg &&
899 IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
900 FreeTemp(rl_src1.reg);
901 }
902 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
903
904 // Do we have a free register for intermediate calculations?
905 RegStorage tmp = AllocTemp(false);
906 if (tmp == RegStorage::InvalidReg()) {
907 /*
908 * No, will use 'edi'.
909 *
910 * As mentioned above we have 4 temporary and 2 promotable
911 * caller-save registers. Therefore, we assume that a free
912 * register can be allocated only if 'esi' and 'edi' are
913 * already used as operands. If number of promotable registers
914 * increases from 2 to 4 then our assumption fails and operand
915 * data is corrupted.
916 * Let's DCHECK it.
917 */
918 DCHECK(IsTemp(rl_src2.reg.GetLow()) &&
919 IsTemp(rl_src2.reg.GetHigh()) &&
920 IsTemp(rl_result.reg.GetLow()) &&
921 IsTemp(rl_result.reg.GetHigh()));
922 tmp = rs_rDI;
923 NewLIR1(kX86Push32R, tmp.GetReg());
924 }
925
926 // Now we are ready to do calculations.
927 OpRegReg(kOpMov, tmp, rl_result.reg.GetLow());
928 OpRegReg(kOpSub, tmp, rl_src2.reg.GetLow());
929 OpRegReg(kOpMov, tmp, rl_result.reg.GetHigh());
930 OpRegReg(kOpSbc, tmp, rl_src2.reg.GetHigh());
931
932 // Let's put pop 'edi' here to break a bit the dependency chain.
933 if (tmp == rs_rDI) {
934 NewLIR1(kX86Pop32R, tmp.GetReg());
935 }
936
937 // Conditionally move the other integer into the destination register.
938 ConditionCode cc = is_min ? kCondGe : kCondLt;
939 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetLow(), rl_src2.reg.GetLow());
940 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetHigh(), rl_src2.reg.GetHigh());
941 StoreValueWide(rl_dest, rl_result);
942 return true;
Serban Constantinescu23abec92014-07-02 16:13:38 +0100943 }
944
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800945 // Get the two arguments to the invoke and place them in GP registers.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700946 RegLocation rl_src1 = info->args[0];
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700947 RegLocation rl_src2 = (is_long) ? info->args[2] : info->args[1];
948 rl_src1 = (is_long) ? LoadValueWide(rl_src1, kCoreReg) : LoadValue(rl_src1, kCoreReg);
949 rl_src2 = (is_long) ? LoadValueWide(rl_src2, kCoreReg) : LoadValue(rl_src2, kCoreReg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800950
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700951 RegLocation rl_dest = (is_long) ? InlineTargetWide(info) : InlineTarget(info);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700952 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800953
954 /*
955 * If the result register is the same as the second element, then we need to be careful.
956 * The reason is that the first copy will inadvertently clobber the second element with
957 * the first one thus yielding the wrong result. Thus we do a swap in that case.
958 */
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000959 if (rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800960 std::swap(rl_src1, rl_src2);
961 }
962
963 // Pick the first integer as min/max.
buzbee2700f7e2014-03-07 09:46:20 -0800964 OpRegCopy(rl_result.reg, rl_src1.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800965
966 // If the integers are both in the same register, then there is nothing else to do
967 // because they are equal and we have already moved one into the result.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000968 if (rl_src1.reg.GetReg() != rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800969 // It is possible we didn't pick correctly so do the actual comparison now.
buzbee2700f7e2014-03-07 09:46:20 -0800970 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800971
972 // Conditionally move the other integer into the destination register.
973 ConditionCode condition_code = is_min ? kCondGt : kCondLt;
buzbee2700f7e2014-03-07 09:46:20 -0800974 OpCondRegReg(kOpCmov, condition_code, rl_result.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800975 }
976
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700977 if (is_long) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000978 StoreValueWide(rl_dest, rl_result);
979 } else {
Vladimir Markoe508a202013-11-04 15:24:22 +0000980 StoreValue(rl_dest, rl_result);
981 }
982 return true;
983}
984
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700985bool X86Mir2Lir::GenInlinedPeek(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +0700986 RegLocation rl_src_address = info->args[0]; // long address
987 RegLocation rl_address;
988 if (!cu_->target64) {
989 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
990 rl_address = LoadValue(rl_src_address, kCoreReg);
991 } else {
992 rl_address = LoadValueWide(rl_src_address, kCoreReg);
993 }
994 RegLocation rl_dest = size == k64 ? InlineTargetWide(info) : InlineTarget(info);
995 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
996 // Unaligned access is allowed on x86.
997 LoadBaseDisp(rl_address.reg, 0, rl_result.reg, size, kNotVolatile);
998 if (size == k64) {
999 StoreValueWide(rl_dest, rl_result);
1000 } else {
1001 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
1002 StoreValue(rl_dest, rl_result);
1003 }
1004 return true;
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001005}
1006
Vladimir Markoe508a202013-11-04 15:24:22 +00001007bool X86Mir2Lir::GenInlinedPoke(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +07001008 RegLocation rl_src_address = info->args[0]; // long address
1009 RegLocation rl_address;
1010 if (!cu_->target64) {
1011 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
1012 rl_address = LoadValue(rl_src_address, kCoreReg);
1013 } else {
1014 rl_address = LoadValueWide(rl_src_address, kCoreReg);
1015 }
1016 RegLocation rl_src_value = info->args[2]; // [size] value
1017 RegLocation rl_value;
1018 if (size == k64) {
1019 // Unaligned access is allowed on x86.
1020 rl_value = LoadValueWide(rl_src_value, kCoreReg);
1021 } else {
1022 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
1023 // In 32-bit mode the only EAX..EDX registers can be used with Mov8MR.
1024 if (!cu_->target64 && size == kSignedByte) {
1025 rl_src_value = UpdateLocTyped(rl_src_value, kCoreReg);
1026 if (rl_src_value.location == kLocPhysReg && !IsByteRegister(rl_src_value.reg)) {
1027 RegStorage temp = AllocateByteRegister();
1028 OpRegCopy(temp, rl_src_value.reg);
1029 rl_value.reg = temp;
1030 } else {
1031 rl_value = LoadValue(rl_src_value, kCoreReg);
1032 }
1033 } else {
1034 rl_value = LoadValue(rl_src_value, kCoreReg);
1035 }
1036 }
1037 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size, kNotVolatile);
1038 return true;
Vladimir Markoe508a202013-11-04 15:24:22 +00001039}
1040
buzbee2700f7e2014-03-07 09:46:20 -08001041void X86Mir2Lir::OpLea(RegStorage r_base, RegStorage reg1, RegStorage reg2, int scale, int offset) {
1042 NewLIR5(kX86Lea32RA, r_base.GetReg(), reg1.GetReg(), reg2.GetReg(), scale, offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001043}
1044
Ian Rogersdd7624d2014-03-14 17:43:00 -07001045void X86Mir2Lir::OpTlsCmp(ThreadOffset<4> offset, int val) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001046 DCHECK_EQ(kX86, cu_->instruction_set);
1047 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
1048}
1049
1050void X86Mir2Lir::OpTlsCmp(ThreadOffset<8> offset, int val) {
1051 DCHECK_EQ(kX86_64, cu_->instruction_set);
Ian Rogers468532e2013-08-05 10:56:33 -07001052 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001053}
1054
buzbee2700f7e2014-03-07 09:46:20 -08001055static bool IsInReg(X86Mir2Lir *pMir2Lir, const RegLocation &rl, RegStorage reg) {
1056 return rl.reg.Valid() && rl.reg.GetReg() == reg.GetReg() && (pMir2Lir->IsLive(reg) || rl.home);
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001057}
1058
Vladimir Marko1c282e22013-11-21 14:49:47 +00001059bool X86Mir2Lir::GenInlinedCas(CallInfo* info, bool is_long, bool is_object) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +07001060 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001061 // Unused - RegLocation rl_src_unsafe = info->args[0];
1062 RegLocation rl_src_obj = info->args[1]; // Object - known non-null
1063 RegLocation rl_src_offset = info->args[2]; // long low
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001064 if (!cu_->target64) {
1065 rl_src_offset = NarrowRegLoc(rl_src_offset); // ignore high half in info->args[3]
1066 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001067 RegLocation rl_src_expected = info->args[4]; // int, long or Object
1068 // If is_long, high half is in info->args[5]
1069 RegLocation rl_src_new_value = info->args[is_long ? 6 : 5]; // int, long or Object
1070 // If is_long, high half is in info->args[7]
1071
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001072 if (is_long && cu_->target64) {
1073 // 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 -07001074 FlushReg(rs_r0q);
1075 Clobber(rs_r0q);
1076 LockTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001077
1078 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
1079 RegLocation rl_new_value = LoadValueWide(rl_src_new_value, kCoreReg);
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001080 RegLocation rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1081 LoadValueDirectWide(rl_src_expected, rs_r0q);
Andreas Gampeccc60262014-07-04 18:02:38 -07001082 NewLIR5(kX86LockCmpxchg64AR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1083 rl_new_value.reg.GetReg());
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001084
1085 // After a store we need to insert barrier in case of potential load. Since the
1086 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
Hans Boehm48f5c472014-06-27 14:50:10 -07001087 GenMemBarrier(kAnyAny);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001088
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001089 FreeTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001090 } else if (is_long) {
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001091 // TODO: avoid unnecessary loads of SI and DI when the values are in registers.
1092 // TODO: CFI support.
Vladimir Marko70b797d2013-12-03 15:25:24 +00001093 FlushAllRegs();
1094 LockCallTemps();
buzbee091cc402014-03-31 10:14:40 -07001095 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
1096 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_rBX, rs_rCX);
buzbee2700f7e2014-03-07 09:46:20 -08001097 LoadValueDirectWideFixed(rl_src_expected, r_tmp1);
1098 LoadValueDirectWideFixed(rl_src_new_value, r_tmp2);
buzbee695d13a2014-04-19 13:32:20 -07001099 // FIXME: needs 64-bit update.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001100 const bool obj_in_di = IsInReg(this, rl_src_obj, rs_rDI);
1101 const bool obj_in_si = IsInReg(this, rl_src_obj, rs_rSI);
1102 DCHECK(!obj_in_si || !obj_in_di);
1103 const bool off_in_di = IsInReg(this, rl_src_offset, rs_rDI);
1104 const bool off_in_si = IsInReg(this, rl_src_offset, rs_rSI);
1105 DCHECK(!off_in_si || !off_in_di);
1106 // If obj/offset is in a reg, use that reg. Otherwise, use the empty reg.
1107 RegStorage rs_obj = obj_in_di ? rs_rDI : obj_in_si ? rs_rSI : !off_in_di ? rs_rDI : rs_rSI;
1108 RegStorage rs_off = off_in_si ? rs_rSI : off_in_di ? rs_rDI : !obj_in_si ? rs_rSI : rs_rDI;
1109 bool push_di = (!obj_in_di && !off_in_di) && (rs_obj == rs_rDI || rs_off == rs_rDI);
1110 bool push_si = (!obj_in_si && !off_in_si) && (rs_obj == rs_rSI || rs_off == rs_rSI);
1111 if (push_di) {
1112 NewLIR1(kX86Push32R, rs_rDI.GetReg());
1113 MarkTemp(rs_rDI);
1114 LockTemp(rs_rDI);
1115 }
1116 if (push_si) {
1117 NewLIR1(kX86Push32R, rs_rSI.GetReg());
1118 MarkTemp(rs_rSI);
1119 LockTemp(rs_rSI);
1120 }
1121 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1122 const size_t push_offset = (push_si ? 4u : 0u) + (push_di ? 4u : 0u);
1123 if (!obj_in_si && !obj_in_di) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07001124 LoadWordDisp(rs_rX86_SP, SRegOffset(rl_src_obj.s_reg_low) + push_offset, rs_obj);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001125 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1126 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1127 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1128 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1129 }
1130 if (!off_in_si && !off_in_di) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07001131 LoadWordDisp(rs_rX86_SP, SRegOffset(rl_src_offset.s_reg_low) + push_offset, rs_off);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001132 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1133 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1134 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1135 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1136 }
1137 NewLIR4(kX86LockCmpxchg64A, rs_obj.GetReg(), rs_off.GetReg(), 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001138
Hans Boehm48f5c472014-06-27 14:50:10 -07001139 // After a store we need to insert barrier to prevent reordering with either
1140 // earlier or later memory accesses. Since
1141 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1142 // and it will be associated with the cmpxchg instruction, preventing both.
1143 GenMemBarrier(kAnyAny);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001144
1145 if (push_si) {
1146 FreeTemp(rs_rSI);
1147 UnmarkTemp(rs_rSI);
1148 NewLIR1(kX86Pop32R, rs_rSI.GetReg());
1149 }
1150 if (push_di) {
1151 FreeTemp(rs_rDI);
1152 UnmarkTemp(rs_rDI);
1153 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
1154 }
Vladimir Marko70b797d2013-12-03 15:25:24 +00001155 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +00001156 } else {
1157 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -08001158 FlushReg(rs_r0);
buzbee091cc402014-03-31 10:14:40 -07001159 Clobber(rs_r0);
buzbee2700f7e2014-03-07 09:46:20 -08001160 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001161
buzbeea0cd2d72014-06-01 09:33:49 -07001162 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
buzbee7c02e912014-10-03 13:14:17 -07001163 RegLocation rl_new_value = LoadValue(rl_src_new_value, LocToRegClass(rl_src_new_value));
Vladimir Markoc29bb612013-11-27 16:47:25 +00001164
1165 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
1166 // Mark card for object assuming new value is stored.
buzbee091cc402014-03-31 10:14:40 -07001167 FreeTemp(rs_r0); // Temporarily release EAX for MarkGCCard().
buzbee2700f7e2014-03-07 09:46:20 -08001168 MarkGCCard(rl_new_value.reg, rl_object.reg);
buzbee091cc402014-03-31 10:14:40 -07001169 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001170 }
1171
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001172 RegLocation rl_offset;
1173 if (cu_->target64) {
1174 rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1175 } else {
1176 rl_offset = LoadValue(rl_src_offset, kCoreReg);
1177 }
buzbee2700f7e2014-03-07 09:46:20 -08001178 LoadValueDirect(rl_src_expected, rs_r0);
Andreas Gampeccc60262014-07-04 18:02:38 -07001179 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1180 rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +00001181
Hans Boehm48f5c472014-06-27 14:50:10 -07001182 // After a store we need to insert barrier to prevent reordering with either
1183 // earlier or later memory accesses. Since
1184 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1185 // and it will be associated with the cmpxchg instruction, preventing both.
1186 GenMemBarrier(kAnyAny);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001187
buzbee091cc402014-03-31 10:14:40 -07001188 FreeTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001189 }
1190
1191 // Convert ZF to boolean
1192 RegLocation rl_dest = InlineTarget(info); // boolean place for result
1193 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001194 RegStorage result_reg = rl_result.reg;
1195
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001196 // For 32-bit, SETcc only works with EAX..EDX.
1197 if (!IsByteRegister(result_reg)) {
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001198 result_reg = AllocateByteRegister();
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001199 }
1200 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondZ);
1201 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), result_reg.GetReg());
1202 if (IsTemp(result_reg)) {
1203 FreeTemp(result_reg);
1204 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001205 StoreValue(rl_dest, rl_result);
1206 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001207}
1208
Yixin Shou8c914c02014-07-28 14:17:09 -04001209void X86Mir2Lir::SwapBits(RegStorage result_reg, int shift, int32_t value) {
1210 RegStorage r_temp = AllocTemp();
1211 OpRegCopy(r_temp, result_reg);
1212 OpRegImm(kOpLsr, result_reg, shift);
1213 OpRegImm(kOpAnd, r_temp, value);
1214 OpRegImm(kOpAnd, result_reg, value);
1215 OpRegImm(kOpLsl, r_temp, shift);
1216 OpRegReg(kOpOr, result_reg, r_temp);
1217 FreeTemp(r_temp);
1218}
1219
1220void X86Mir2Lir::SwapBits64(RegStorage result_reg, int shift, int64_t value) {
1221 RegStorage r_temp = AllocTempWide();
1222 OpRegCopy(r_temp, result_reg);
1223 OpRegImm(kOpLsr, result_reg, shift);
1224 RegStorage r_value = AllocTempWide();
1225 LoadConstantWide(r_value, value);
1226 OpRegReg(kOpAnd, r_temp, r_value);
1227 OpRegReg(kOpAnd, result_reg, r_value);
1228 OpRegImm(kOpLsl, r_temp, shift);
1229 OpRegReg(kOpOr, result_reg, r_temp);
1230 FreeTemp(r_temp);
1231 FreeTemp(r_value);
1232}
1233
1234bool X86Mir2Lir::GenInlinedReverseBits(CallInfo* info, OpSize size) {
1235 RegLocation rl_src_i = info->args[0];
1236 RegLocation rl_i = (size == k64) ? LoadValueWide(rl_src_i, kCoreReg)
1237 : LoadValue(rl_src_i, kCoreReg);
1238 RegLocation rl_dest = (size == k64) ? InlineTargetWide(info) : InlineTarget(info);
1239 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1240 if (size == k64) {
1241 if (cu_->instruction_set == kX86_64) {
1242 /* Use one bswap instruction to reverse byte order first and then use 3 rounds of
1243 swapping bits to reverse bits in a long number x. Using bswap to save instructions
1244 compared to generic luni implementation which has 5 rounds of swapping bits.
1245 x = bswap x
1246 x = (x & 0x5555555555555555) << 1 | (x >> 1) & 0x5555555555555555;
1247 x = (x & 0x3333333333333333) << 2 | (x >> 2) & 0x3333333333333333;
1248 x = (x & 0x0F0F0F0F0F0F0F0F) << 4 | (x >> 4) & 0x0F0F0F0F0F0F0F0F;
1249 */
1250 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1251 SwapBits64(rl_result.reg, 1, 0x5555555555555555);
1252 SwapBits64(rl_result.reg, 2, 0x3333333333333333);
1253 SwapBits64(rl_result.reg, 4, 0x0f0f0f0f0f0f0f0f);
1254 StoreValueWide(rl_dest, rl_result);
1255 return true;
1256 }
1257 RegStorage r_i_low = rl_i.reg.GetLow();
1258 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1259 // First REV shall clobber rl_result.reg.GetLowReg(), save the value in a temp for the second
1260 // REV.
1261 r_i_low = AllocTemp();
1262 OpRegCopy(r_i_low, rl_i.reg);
1263 }
1264 OpRegReg(kOpRev, rl_result.reg.GetLow(), rl_i.reg.GetHigh());
1265 OpRegReg(kOpRev, rl_result.reg.GetHigh(), r_i_low);
1266 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1267 FreeTemp(r_i_low);
1268 }
1269 SwapBits(rl_result.reg.GetLow(), 1, 0x55555555);
1270 SwapBits(rl_result.reg.GetLow(), 2, 0x33333333);
1271 SwapBits(rl_result.reg.GetLow(), 4, 0x0f0f0f0f);
1272 SwapBits(rl_result.reg.GetHigh(), 1, 0x55555555);
1273 SwapBits(rl_result.reg.GetHigh(), 2, 0x33333333);
1274 SwapBits(rl_result.reg.GetHigh(), 4, 0x0f0f0f0f);
1275 StoreValueWide(rl_dest, rl_result);
1276 } else {
1277 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1278 SwapBits(rl_result.reg, 1, 0x55555555);
1279 SwapBits(rl_result.reg, 2, 0x33333333);
1280 SwapBits(rl_result.reg, 4, 0x0f0f0f0f);
1281 StoreValue(rl_dest, rl_result);
1282 }
1283 return true;
1284}
1285
buzbee2700f7e2014-03-07 09:46:20 -08001286LIR* X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001287 CHECK(base_of_code_ != nullptr);
1288
1289 // Address the start of the method
1290 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07001291 if (rl_method.wide) {
1292 LoadValueDirectWideFixed(rl_method, reg);
1293 } else {
1294 LoadValueDirectFixed(rl_method, reg);
1295 }
Mark Mendell55d0eac2014-02-06 11:02:52 -08001296 store_method_addr_used_ = true;
1297
1298 // Load the proper value from the literal area.
1299 // We don't know the proper offset for the value, so pick one that will force
1300 // 4 byte offset. We will fix this up in the assembler later to have the right
1301 // value.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001302 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
buzbee2700f7e2014-03-07 09:46:20 -08001303 LIR *res = RawLIR(current_dalvik_offset_, kX86Mov32RM, reg.GetReg(), reg.GetReg(), 256,
1304 0, 0, target);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001305 res->target = target;
1306 res->flags.fixup = kFixupLoad;
Mark Mendell55d0eac2014-02-06 11:02:52 -08001307 store_method_addr_used_ = true;
1308 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001309}
1310
buzbee2700f7e2014-03-07 09:46:20 -08001311LIR* X86Mir2Lir::OpVldm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001312 LOG(FATAL) << "Unexpected use of OpVldm for x86";
1313 return NULL;
1314}
1315
buzbee2700f7e2014-03-07 09:46:20 -08001316LIR* X86Mir2Lir::OpVstm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001317 LOG(FATAL) << "Unexpected use of OpVstm for x86";
1318 return NULL;
1319}
1320
1321void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
1322 RegLocation rl_result, int lit,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001323 int first_bit, int second_bit) {
buzbee2700f7e2014-03-07 09:46:20 -08001324 RegStorage t_reg = AllocTemp();
1325 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
1326 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001327 FreeTemp(t_reg);
1328 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -08001329 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001330 }
1331}
1332
Mingyao Yange643a172014-04-08 11:02:52 -07001333void X86Mir2Lir::GenDivZeroCheckWide(RegStorage reg) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001334 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001335 DCHECK(reg.Is64Bit());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001336
Chao-ying Fua0147762014-06-06 18:38:49 -07001337 NewLIR2(kX86Cmp64RI8, reg.GetReg(), 0);
1338 } else {
1339 DCHECK(reg.IsPair());
1340
1341 // We are not supposed to clobber the incoming storage, so allocate a temporary.
1342 RegStorage t_reg = AllocTemp();
1343 // Doing an OR is a quick way to check if both registers are zero. This will set the flags.
1344 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
1345 // The temp is no longer needed so free it at this time.
1346 FreeTemp(t_reg);
1347 }
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001348
1349 // In case of zero, throw ArithmeticException.
Mingyao Yange643a172014-04-08 11:02:52 -07001350 GenDivZeroCheck(kCondEq);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001351}
1352
Mingyao Yang80365d92014-04-18 12:10:58 -07001353void X86Mir2Lir::GenArrayBoundsCheck(RegStorage index,
1354 RegStorage array_base,
1355 int len_offset) {
1356 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1357 public:
1358 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
1359 RegStorage index, RegStorage array_base, int32_t len_offset)
1360 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
1361 index_(index), array_base_(array_base), len_offset_(len_offset) {
1362 }
1363
1364 void Compile() OVERRIDE {
1365 m2l_->ResetRegPool();
1366 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001367 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001368
1369 RegStorage new_index = index_;
1370 // Move index out of kArg1, either directly to kArg0, or to kArg2.
Serguei Katkov4c7cc152014-06-24 00:50:02 +07001371 // TODO: clean-up to check not a number but with type
Andreas Gampeccc60262014-07-04 18:02:38 -07001372 if (index_ == m2l_->TargetReg(kArg1, kNotWide)) {
1373 if (array_base_ == m2l_->TargetReg(kArg0, kRef)) {
1374 m2l_->OpRegCopy(m2l_->TargetReg(kArg2, kNotWide), index_);
1375 new_index = m2l_->TargetReg(kArg2, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001376 } else {
Andreas Gampeccc60262014-07-04 18:02:38 -07001377 m2l_->OpRegCopy(m2l_->TargetReg(kArg0, kNotWide), index_);
1378 new_index = m2l_->TargetReg(kArg0, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001379 }
1380 }
1381 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001382 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1383 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1384 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, new_index,
1385 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001386 }
1387
1388 private:
1389 const RegStorage index_;
1390 const RegStorage array_base_;
1391 const int32_t len_offset_;
1392 };
1393
1394 OpRegMem(kOpCmp, index, array_base, len_offset);
Dave Allison69dfe512014-07-11 17:11:58 +00001395 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001396 LIR* branch = OpCondBranch(kCondUge, nullptr);
1397 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1398 index, array_base, len_offset));
1399}
1400
1401void X86Mir2Lir::GenArrayBoundsCheck(int32_t index,
1402 RegStorage array_base,
1403 int32_t len_offset) {
1404 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1405 public:
1406 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
1407 int32_t index, RegStorage array_base, int32_t len_offset)
1408 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
1409 index_(index), array_base_(array_base), len_offset_(len_offset) {
1410 }
1411
1412 void Compile() OVERRIDE {
1413 m2l_->ResetRegPool();
1414 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001415 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001416
1417 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001418 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1419 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1420 x86_m2l->LoadConstant(m2l_->TargetReg(kArg0, kNotWide), index_);
1421 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, m2l_->TargetReg(kArg0, kNotWide),
1422 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001423 }
1424
1425 private:
1426 const int32_t index_;
1427 const RegStorage array_base_;
1428 const int32_t len_offset_;
1429 };
1430
1431 NewLIR3(IS_SIMM8(index) ? kX86Cmp32MI8 : kX86Cmp32MI, array_base.GetReg(), len_offset, index);
Dave Allison69dfe512014-07-11 17:11:58 +00001432 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001433 LIR* branch = OpCondBranch(kCondLs, nullptr);
1434 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1435 index, array_base, len_offset));
1436}
1437
Brian Carlstrom7940e442013-07-12 13:46:57 -07001438// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001439LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
buzbee33ae5582014-06-12 14:56:32 -07001440 if (cu_->target64) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001441 OpTlsCmp(Thread::ThreadFlagsOffset<8>(), 0);
1442 } else {
1443 OpTlsCmp(Thread::ThreadFlagsOffset<4>(), 0);
1444 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001445 return OpCondBranch((target == NULL) ? kCondNe : kCondEq, target);
1446}
1447
1448// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -08001449LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001450 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -08001451 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001452}
1453
buzbee11b63d12013-08-27 07:34:17 -07001454bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001455 RegLocation rl_src, RegLocation rl_dest, int lit) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001456 LOG(FATAL) << "Unexpected use of smallLiteralDive in x86";
1457 return false;
1458}
1459
Ian Rogerse2143c02014-03-28 08:47:16 -07001460bool X86Mir2Lir::EasyMultiply(RegLocation rl_src, RegLocation rl_dest, int lit) {
1461 LOG(FATAL) << "Unexpected use of easyMultiply in x86";
1462 return false;
1463}
1464
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001465LIR* X86Mir2Lir::OpIT(ConditionCode cond, const char* guide) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001466 LOG(FATAL) << "Unexpected use of OpIT in x86";
1467 return NULL;
1468}
1469
Dave Allison3da67a52014-04-02 17:03:45 -07001470void X86Mir2Lir::OpEndIT(LIR* it) {
1471 LOG(FATAL) << "Unexpected use of OpEndIT in x86";
1472}
1473
buzbee2700f7e2014-03-07 09:46:20 -08001474void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001475 switch (val) {
1476 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001477 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001478 break;
1479 case 1:
1480 OpRegCopy(dest, src);
1481 break;
1482 default:
1483 OpRegRegImm(kOpMul, dest, src, val);
1484 break;
1485 }
1486}
1487
buzbee2700f7e2014-03-07 09:46:20 -08001488void X86Mir2Lir::GenImulMemImm(RegStorage dest, int sreg, int displacement, int val) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001489 // All memory accesses below reference dalvik regs.
1490 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1491
Mark Mendell4708dcd2014-01-22 09:05:18 -08001492 LIR *m;
1493 switch (val) {
1494 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001495 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001496 break;
1497 case 1:
Andreas Gampe3c12c512014-06-24 18:46:29 +00001498 LoadBaseDisp(rs_rX86_SP, displacement, dest, k32, kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001499 break;
1500 default:
buzbee091cc402014-03-31 10:14:40 -07001501 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(),
1502 rs_rX86_SP.GetReg(), displacement, val);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001503 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
1504 break;
1505 }
1506}
1507
Andreas Gampec76c6142014-08-04 16:30:03 -07001508void X86Mir2Lir::GenArithOpLong(Instruction::Code opcode, RegLocation rl_dest, RegLocation rl_src1,
1509 RegLocation rl_src2) {
1510 if (!cu_->target64) {
1511 // Some x86 32b ops are fallback.
1512 switch (opcode) {
1513 case Instruction::NOT_LONG:
1514 case Instruction::DIV_LONG:
1515 case Instruction::DIV_LONG_2ADDR:
1516 case Instruction::REM_LONG:
1517 case Instruction::REM_LONG_2ADDR:
1518 Mir2Lir::GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
1519 return;
1520
1521 default:
1522 // Everything else we can handle.
1523 break;
1524 }
1525 }
1526
1527 switch (opcode) {
1528 case Instruction::NOT_LONG:
1529 GenNotLong(rl_dest, rl_src2);
1530 return;
1531
1532 case Instruction::ADD_LONG:
1533 case Instruction::ADD_LONG_2ADDR:
1534 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1535 return;
1536
1537 case Instruction::SUB_LONG:
1538 case Instruction::SUB_LONG_2ADDR:
1539 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1540 return;
1541
1542 case Instruction::MUL_LONG:
1543 case Instruction::MUL_LONG_2ADDR:
1544 GenMulLong(opcode, rl_dest, rl_src1, rl_src2);
1545 return;
1546
1547 case Instruction::DIV_LONG:
1548 case Instruction::DIV_LONG_2ADDR:
1549 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ true);
1550 return;
1551
1552 case Instruction::REM_LONG:
1553 case Instruction::REM_LONG_2ADDR:
1554 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ false);
1555 return;
1556
1557 case Instruction::AND_LONG_2ADDR:
1558 case Instruction::AND_LONG:
1559 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1560 return;
1561
1562 case Instruction::OR_LONG:
1563 case Instruction::OR_LONG_2ADDR:
1564 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1565 return;
1566
1567 case Instruction::XOR_LONG:
1568 case Instruction::XOR_LONG_2ADDR:
1569 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1570 return;
1571
1572 case Instruction::NEG_LONG:
1573 GenNegLong(rl_dest, rl_src2);
1574 return;
1575
1576 default:
1577 LOG(FATAL) << "Invalid long arith op";
1578 return;
1579 }
1580}
1581
1582bool X86Mir2Lir::GenMulLongConst(RegLocation rl_dest, RegLocation rl_src1, int64_t val) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001583 // All memory accesses below reference dalvik regs.
1584 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1585
Andreas Gampec76c6142014-08-04 16:30:03 -07001586 if (val == 0) {
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001587 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Andreas Gampec76c6142014-08-04 16:30:03 -07001588 if (cu_->target64) {
1589 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001590 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001591 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
1592 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001593 }
Andreas Gampec76c6142014-08-04 16:30:03 -07001594 StoreValueWide(rl_dest, rl_result);
1595 return true;
1596 } else if (val == 1) {
1597 StoreValueWide(rl_dest, rl_src1);
1598 return true;
1599 } else if (val == 2) {
1600 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1);
1601 return true;
1602 } else if (IsPowerOfTwo(val)) {
1603 int shift_amount = LowestSetBit(val);
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001604 if (!PartiallyIntersects(rl_src1, rl_dest)) {
Andreas Gampec76c6142014-08-04 16:30:03 -07001605 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1606 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest, rl_src1,
1607 shift_amount);
1608 StoreValueWide(rl_dest, rl_result);
1609 return true;
1610 }
1611 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001612
Andreas Gampec76c6142014-08-04 16:30:03 -07001613 // Okay, on 32b just bite the bullet and do it, still better than the general case.
1614 if (!cu_->target64) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001615 int32_t val_lo = Low32Bits(val);
1616 int32_t val_hi = High32Bits(val);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001617 // Prepare for explicit register usage.
1618 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
buzbee30adc732014-05-09 15:10:18 -07001619 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001620 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1621 int displacement = SRegOffset(rl_src1.s_reg_low);
1622
1623 // ECX <- 1H * 2L
1624 // EAX <- 1L * 2H
1625 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001626 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
1627 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001628 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001629 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
1630 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001631 }
1632
1633 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001634 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001635
1636 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001637 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001638
1639 // EDX:EAX <- 2L * 1L (double precision)
1640 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001641 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001642 } else {
buzbee091cc402014-03-31 10:14:40 -07001643 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001644 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1645 true /* is_load */, true /* is_64bit */);
1646 }
1647
1648 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001649 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001650
1651 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001652 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
1653 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001654 StoreValueWide(rl_dest, rl_result);
Andreas Gampec76c6142014-08-04 16:30:03 -07001655 return true;
1656 }
1657 return false;
1658}
1659
1660void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
1661 RegLocation rl_src2) {
1662 if (rl_src1.is_const) {
1663 std::swap(rl_src1, rl_src2);
1664 }
1665
1666 if (rl_src2.is_const) {
1667 if (GenMulLongConst(rl_dest, rl_src1, mir_graph_->ConstantValueWide(rl_src2))) {
1668 return;
1669 }
1670 }
1671
1672 // All memory accesses below reference dalvik regs.
1673 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1674
1675 if (cu_->target64) {
1676 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1677 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1678 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1679 if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1680 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1681 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
1682 } else if (rl_result.reg.GetReg() != rl_src1.reg.GetReg() &&
1683 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1684 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src1.reg.GetReg());
1685 } else if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1686 rl_result.reg.GetReg() != rl_src2.reg.GetReg()) {
1687 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1688 } else {
1689 OpRegCopy(rl_result.reg, rl_src1.reg);
1690 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1691 }
1692 StoreValueWide(rl_dest, rl_result);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001693 return;
1694 }
1695
Andreas Gampec76c6142014-08-04 16:30:03 -07001696 // Not multiplying by a constant. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001697 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1698 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1699 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1700
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001701 // Prepare for explicit register usage.
1702 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
buzbee30adc732014-05-09 15:10:18 -07001703 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
1704 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001705
1706 // At this point, the VRs are in their home locations.
1707 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1708 bool src2_in_reg = rl_src2.location == kLocPhysReg;
1709
1710 // ECX <- 1H
1711 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001712 NewLIR2(kX86Mov32RR, rs_r1.GetReg(), rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001713 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001714 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1, k32,
1715 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001716 }
1717
Mark Mendellde99bba2014-02-14 12:15:02 -08001718 if (is_square) {
1719 // Take advantage of the fact that the values are the same.
1720 // ECX <- ECX * 2L (1H * 2L)
1721 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001722 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001723 } else {
1724 int displacement = SRegOffset(rl_src2.s_reg_low);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001725 LIR* m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001726 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001727 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1728 true /* is_load */, true /* is_64bit */);
1729 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001730
Mark Mendellde99bba2014-02-14 12:15:02 -08001731 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001732 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001733 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001734 // EAX <- 2H
1735 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001736 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001737 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001738 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0, k32,
1739 kNotVolatile);
Mark Mendellde99bba2014-02-14 12:15:02 -08001740 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001741
Mark Mendellde99bba2014-02-14 12:15:02 -08001742 // EAX <- EAX * 1L (2H * 1L)
1743 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001744 NewLIR2(kX86Imul32RR, rs_r0.GetReg(), rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001745 } else {
1746 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001747 LIR *m = NewLIR3(kX86Imul32RM, rs_r0.GetReg(), rs_rX86_SP.GetReg(),
1748 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001749 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1750 true /* is_load */, true /* is_64bit */);
1751 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001752
Mark Mendellde99bba2014-02-14 12:15:02 -08001753 // ECX <- ECX * 2L (1H * 2L)
1754 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001755 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001756 } else {
1757 int displacement = SRegOffset(rl_src2.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001758 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
1759 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001760 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1761 true /* is_load */, true /* is_64bit */);
1762 }
1763
1764 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001765 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001766 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001767
1768 // EAX <- 2L
1769 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001770 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001771 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001772 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0, k32,
1773 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001774 }
1775
1776 // EDX:EAX <- 2L * 1L (double precision)
1777 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001778 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001779 } else {
1780 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001781 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001782 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1783 true /* is_load */, true /* is_64bit */);
1784 }
1785
1786 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001787 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001788
1789 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001790 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
buzbee2700f7e2014-03-07 09:46:20 -08001791 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001792 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001793}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001794
1795void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1796 Instruction::Code op) {
1797 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1798 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1799 if (rl_src.location == kLocPhysReg) {
1800 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001801 // But we must ensure that rl_src is in pair
Elena Sayapinadd644502014-07-01 18:39:52 +07001802 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001803 NewLIR2(x86op, rl_dest.reg.GetReg(), rl_src.reg.GetReg());
1804 } else {
1805 rl_src = LoadValueWide(rl_src, kCoreReg);
1806 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
1807 // The registers are the same, so we would clobber it before the use.
1808 RegStorage temp_reg = AllocTemp();
1809 OpRegCopy(temp_reg, rl_dest.reg);
1810 rl_src.reg.SetHighReg(temp_reg.GetReg());
1811 }
1812 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001813
Chao-ying Fua0147762014-06-06 18:38:49 -07001814 x86op = GetOpcode(op, rl_dest, rl_src, true);
1815 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
Chao-ying Fua0147762014-06-06 18:38:49 -07001816 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001817 return;
1818 }
1819
1820 // RHS is in memory.
1821 DCHECK((rl_src.location == kLocDalvikFrame) ||
1822 (rl_src.location == kLocCompilerTemp));
Chao-ying Fua77ee512014-07-01 17:43:41 -07001823 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001824 int displacement = SRegOffset(rl_src.s_reg_low);
1825
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001826 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Andreas Gampeccc60262014-07-04 18:02:38 -07001827 LIR *lir = NewLIR3(x86op, cu_->target64 ? rl_dest.reg.GetReg() : rl_dest.reg.GetLowReg(),
1828 r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001829 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1830 true /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001831 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001832 x86op = GetOpcode(op, rl_dest, rl_src, true);
1833 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001834 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1835 true /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001836 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001837}
1838
Mark Mendelle02d48f2014-01-15 11:19:23 -08001839void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
buzbee30adc732014-05-09 15:10:18 -07001840 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001841 if (rl_dest.location == kLocPhysReg) {
1842 // Ensure we are in a register pair
1843 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1844
buzbee30adc732014-05-09 15:10:18 -07001845 rl_src = UpdateLocWideTyped(rl_src, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001846 GenLongRegOrMemOp(rl_result, rl_src, op);
1847 StoreFinalValueWide(rl_dest, rl_result);
1848 return;
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07001849 } else if (!cu_->target64 && Intersects(rl_src, rl_dest)) {
1850 // Handle the case when src and dest are intersect.
1851 rl_src = LoadValueWide(rl_src, kCoreReg);
1852 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1853 rl_src = UpdateLocWideTyped(rl_src, kCoreReg);
1854 GenLongRegOrMemOp(rl_result, rl_src, op);
1855 StoreFinalValueWide(rl_dest, rl_result);
1856 return;
Mark Mendelle02d48f2014-01-15 11:19:23 -08001857 }
1858
1859 // It wasn't in registers, so it better be in memory.
1860 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1861 (rl_dest.location == kLocCompilerTemp));
1862 rl_src = LoadValueWide(rl_src, kCoreReg);
1863
1864 // Operate directly into memory.
1865 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
Chao-ying Fua77ee512014-07-01 17:43:41 -07001866 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001867 int displacement = SRegOffset(rl_dest.s_reg_low);
1868
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001869 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07001870 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET,
Elena Sayapinadd644502014-07-01 18:39:52 +07001871 cu_->target64 ? rl_src.reg.GetReg() : rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001872 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001873 true /* is_load */, true /* is64bit */);
1874 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001875 false /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001876 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001877 x86op = GetOpcode(op, rl_dest, rl_src, true);
1878 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001879 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1880 true /* is_load */, true /* is64bit */);
1881 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1882 false /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001883 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001884}
1885
Mark Mendelle02d48f2014-01-15 11:19:23 -08001886void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
1887 RegLocation rl_src2, Instruction::Code op,
1888 bool is_commutative) {
1889 // Is this really a 2 operand operation?
1890 switch (op) {
1891 case Instruction::ADD_LONG_2ADDR:
1892 case Instruction::SUB_LONG_2ADDR:
1893 case Instruction::AND_LONG_2ADDR:
1894 case Instruction::OR_LONG_2ADDR:
1895 case Instruction::XOR_LONG_2ADDR:
Mark Mendelle87f9b52014-04-30 14:13:18 -04001896 if (GenerateTwoOperandInstructions()) {
1897 GenLongArith(rl_dest, rl_src2, op);
1898 return;
1899 }
1900 break;
1901
Mark Mendelle02d48f2014-01-15 11:19:23 -08001902 default:
1903 break;
1904 }
1905
1906 if (rl_dest.location == kLocPhysReg) {
1907 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
1908
1909 // We are about to clobber the LHS, so it needs to be a temp.
1910 rl_result = ForceTempWide(rl_result);
1911
1912 // Perform the operation using the RHS.
buzbee30adc732014-05-09 15:10:18 -07001913 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001914 GenLongRegOrMemOp(rl_result, rl_src2, op);
1915
1916 // And now record that the result is in the temp.
1917 StoreFinalValueWide(rl_dest, rl_result);
1918 return;
1919 }
1920
1921 // It wasn't in registers, so it better be in memory.
1922 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1923 (rl_dest.location == kLocCompilerTemp));
buzbee30adc732014-05-09 15:10:18 -07001924 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
1925 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001926
1927 // Get one of the source operands into temporary register.
1928 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +07001929 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001930 if (IsTemp(rl_src1.reg)) {
1931 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1932 } else if (is_commutative) {
1933 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1934 // We need at least one of them to be a temporary.
1935 if (!IsTemp(rl_src2.reg)) {
1936 rl_src1 = ForceTempWide(rl_src1);
1937 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1938 } else {
1939 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1940 StoreFinalValueWide(rl_dest, rl_src2);
1941 return;
1942 }
1943 } else {
1944 // Need LHS to be the temp.
Mark Mendelle02d48f2014-01-15 11:19:23 -08001945 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07001946 GenLongRegOrMemOp(rl_src1, rl_src2, op);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001947 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001948 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07001949 if (IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
1950 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1951 } else if (is_commutative) {
1952 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1953 // We need at least one of them to be a temporary.
1954 if (!(IsTemp(rl_src2.reg.GetLow()) && IsTemp(rl_src2.reg.GetHigh()))) {
1955 rl_src1 = ForceTempWide(rl_src1);
1956 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1957 } else {
1958 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1959 StoreFinalValueWide(rl_dest, rl_src2);
1960 return;
1961 }
1962 } else {
1963 // Need LHS to be the temp.
1964 rl_src1 = ForceTempWide(rl_src1);
1965 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1966 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001967 }
1968
1969 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001970}
1971
Serban Constantinescued65c5e2014-05-22 15:10:18 +01001972void X86Mir2Lir::GenNotLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001973 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001974 rl_src = LoadValueWide(rl_src, kCoreReg);
1975 RegLocation rl_result;
1976 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1977 OpRegCopy(rl_result.reg, rl_src.reg);
1978 OpReg(kOpNot, rl_result.reg);
1979 StoreValueWide(rl_dest, rl_result);
1980 } else {
1981 LOG(FATAL) << "Unexpected use GenNotLong()";
1982 }
Serban Constantinescued65c5e2014-05-22 15:10:18 +01001983}
1984
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07001985void X86Mir2Lir::GenDivRemLongLit(RegLocation rl_dest, RegLocation rl_src,
1986 int64_t imm, bool is_div) {
1987 if (imm == 0) {
1988 GenDivZeroException();
1989 } else if (imm == 1) {
1990 if (is_div) {
1991 // x / 1 == x.
1992 StoreValueWide(rl_dest, rl_src);
1993 } else {
1994 // x % 1 == 0.
1995 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1996 LoadConstantWide(rl_result.reg, 0);
1997 StoreValueWide(rl_dest, rl_result);
1998 }
1999 } else if (imm == -1) { // handle 0x8000000000000000 / -1 special case.
2000 if (is_div) {
2001 rl_src = LoadValueWide(rl_src, kCoreReg);
2002 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2003 RegStorage rs_temp = AllocTempWide();
2004
2005 OpRegCopy(rl_result.reg, rl_src.reg);
2006 LoadConstantWide(rs_temp, 0x8000000000000000);
2007
2008 // If x == MIN_LONG, return MIN_LONG.
2009 OpRegReg(kOpCmp, rl_src.reg, rs_temp);
2010 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
2011
2012 // For x != MIN_LONG, x / -1 == -x.
2013 OpReg(kOpNeg, rl_result.reg);
2014
2015 minint_branch->target = NewLIR0(kPseudoTargetLabel);
2016 FreeTemp(rs_temp);
2017 StoreValueWide(rl_dest, rl_result);
2018 } else {
2019 // x % -1 == 0.
2020 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2021 LoadConstantWide(rl_result.reg, 0);
2022 StoreValueWide(rl_dest, rl_result);
2023 }
2024 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
2025 // Division using shifting.
2026 rl_src = LoadValueWide(rl_src, kCoreReg);
2027 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2028 if (IsSameReg(rl_result.reg, rl_src.reg)) {
2029 RegStorage rs_temp = AllocTypedTempWide(false, kCoreReg);
2030 rl_result.reg.SetReg(rs_temp.GetReg());
2031 }
2032 LoadConstantWide(rl_result.reg, std::abs(imm) - 1);
2033 OpRegReg(kOpAdd, rl_result.reg, rl_src.reg);
2034 NewLIR2(kX86Test64RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
2035 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
2036 int shift_amount = LowestSetBit(imm);
2037 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
2038 if (imm < 0) {
2039 OpReg(kOpNeg, rl_result.reg);
2040 }
2041 StoreValueWide(rl_dest, rl_result);
2042 } else {
2043 CHECK(imm <= -2 || imm >= 2);
2044
2045 FlushReg(rs_r0q);
2046 Clobber(rs_r0q);
2047 LockTemp(rs_r0q);
2048 FlushReg(rs_r2q);
2049 Clobber(rs_r2q);
2050 LockTemp(rs_r2q);
2051
Mark Mendell3a91f442014-09-02 12:44:24 -04002052 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
2053 is_div ? rs_r2q : rs_r0q, INVALID_SREG, INVALID_SREG};
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002054
2055 // Use H.S.Warren's Hacker's Delight Chapter 10 and
2056 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
2057 int64_t magic;
2058 int shift;
2059 CalculateMagicAndShift(imm, magic, shift, true /* is_long */);
2060
2061 /*
2062 * For imm >= 2,
2063 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
2064 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
2065 * For imm <= -2,
2066 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
2067 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
2068 * We implement this algorithm in the following way:
2069 * 1. multiply magic number m and numerator n, get the higher 64bit result in RDX
2070 * 2. if imm > 0 and magic < 0, add numerator to RDX
2071 * if imm < 0 and magic > 0, sub numerator from RDX
2072 * 3. if S !=0, SAR S bits for RDX
2073 * 4. add 1 to RDX if RDX < 0
2074 * 5. Thus, RDX is the quotient
2075 */
2076
Mark Mendell3a91f442014-09-02 12:44:24 -04002077 // RAX = magic.
2078 LoadConstantWide(rs_r0q, magic);
2079
2080 // Multiply by numerator.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002081 RegStorage numerator_reg;
2082 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
2083 // We will need the value later.
2084 rl_src = LoadValueWide(rl_src, kCoreReg);
2085 numerator_reg = rl_src.reg;
Mark Mendell3a91f442014-09-02 12:44:24 -04002086
2087 // RDX:RAX = magic * numerator.
2088 NewLIR1(kX86Imul64DaR, numerator_reg.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002089 } else {
Mark Mendell3a91f442014-09-02 12:44:24 -04002090 // Only need this once. Multiply directly from the value.
2091 rl_src = UpdateLocWideTyped(rl_src, kCoreReg);
2092 if (rl_src.location != kLocPhysReg) {
2093 // Okay, we can do this from memory.
2094 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
2095 int displacement = SRegOffset(rl_src.s_reg_low);
2096 // RDX:RAX = magic * numerator.
2097 LIR *m = NewLIR2(kX86Imul64DaM, rs_rX86_SP.GetReg(), displacement);
2098 AnnotateDalvikRegAccess(m, displacement >> 2,
2099 true /* is_load */, true /* is_64bit */);
2100 } else {
2101 // RDX:RAX = magic * numerator.
2102 NewLIR1(kX86Imul64DaR, rl_src.reg.GetReg());
2103 }
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002104 }
2105
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002106 if (imm > 0 && magic < 0) {
2107 // Add numerator to RDX.
2108 DCHECK(numerator_reg.Valid());
2109 OpRegReg(kOpAdd, rs_r2q, numerator_reg);
2110 } else if (imm < 0 && magic > 0) {
2111 DCHECK(numerator_reg.Valid());
2112 OpRegReg(kOpSub, rs_r2q, numerator_reg);
2113 }
2114
2115 // Do we need the shift?
2116 if (shift != 0) {
2117 // Shift RDX by 'shift' bits.
2118 OpRegImm(kOpAsr, rs_r2q, shift);
2119 }
2120
2121 // Move RDX to RAX.
2122 OpRegCopyWide(rs_r0q, rs_r2q);
2123
2124 // Move sign bit to bit 0, zeroing the rest.
2125 OpRegImm(kOpLsr, rs_r2q, 63);
2126
2127 // RDX = RDX + RAX.
2128 OpRegReg(kOpAdd, rs_r2q, rs_r0q);
2129
2130 // Quotient is in RDX.
2131 if (!is_div) {
2132 // We need to compute the remainder.
2133 // Remainder is divisor - (quotient * imm).
2134 DCHECK(numerator_reg.Valid());
2135 OpRegCopyWide(rs_r0q, numerator_reg);
2136
2137 // Imul doesn't support 64-bit imms.
2138 if (imm > std::numeric_limits<int32_t>::max() ||
2139 imm < std::numeric_limits<int32_t>::min()) {
2140 RegStorage rs_temp = AllocTempWide();
2141 LoadConstantWide(rs_temp, imm);
2142
2143 // RAX = numerator * imm.
2144 NewLIR2(kX86Imul64RR, rs_r2q.GetReg(), rs_temp.GetReg());
2145
2146 FreeTemp(rs_temp);
2147 } else {
2148 // RAX = numerator * imm.
2149 int short_imm = static_cast<int>(imm);
2150 NewLIR3(kX86Imul64RRI, rs_r2q.GetReg(), rs_r2q.GetReg(), short_imm);
2151 }
2152
Mark Mendell3a91f442014-09-02 12:44:24 -04002153 // RAX -= RDX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002154 OpRegReg(kOpSub, rs_r0q, rs_r2q);
2155
Mark Mendell3a91f442014-09-02 12:44:24 -04002156 // Result in RAX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002157 } else {
Mark Mendell3a91f442014-09-02 12:44:24 -04002158 // Result in RDX.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002159 }
2160 StoreValueWide(rl_dest, rl_result);
2161 FreeTemp(rs_r0q);
2162 FreeTemp(rs_r2q);
2163 }
2164}
2165
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002166void X86Mir2Lir::GenDivRemLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002167 RegLocation rl_src2, bool is_div) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002168 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002169 LOG(FATAL) << "Unexpected use GenDivRemLong()";
2170 return;
2171 }
2172
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002173 if (rl_src2.is_const) {
2174 DCHECK(rl_src2.wide);
2175 int64_t imm = mir_graph_->ConstantValueWide(rl_src2);
2176 GenDivRemLongLit(rl_dest, rl_src1, imm, is_div);
2177 return;
2178 }
2179
Chao-ying Fua0147762014-06-06 18:38:49 -07002180 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002181 // Prepare for explicit register usage.
2182 ExplicitTempRegisterLock(this, 4, &rs_r0q, &rs_r1q, &rs_r2q, &rs_r6q);
Chao-ying Fua0147762014-06-06 18:38:49 -07002183
2184 // Load LHS into RAX.
2185 LoadValueDirectWideFixed(rl_src1, rs_r0q);
2186
2187 // Load RHS into RCX.
2188 LoadValueDirectWideFixed(rl_src2, rs_r1q);
2189
2190 // Copy LHS sign bit into RDX.
2191 NewLIR0(kx86Cqo64Da);
2192
2193 // Handle division by zero case.
2194 GenDivZeroCheckWide(rs_r1q);
2195
2196 // Have to catch 0x8000000000000000/-1 case, or we will get an exception!
2197 NewLIR2(kX86Cmp64RI8, rs_r1q.GetReg(), -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002198 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002199
2200 // RHS is -1.
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002201 LoadConstantWide(rs_r6q, 0x8000000000000000);
2202 NewLIR2(kX86Cmp64RR, rs_r0q.GetReg(), rs_r6q.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002203 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002204
2205 // In 0x8000000000000000/-1 case.
2206 if (!is_div) {
2207 // For DIV, RAX is already right. For REM, we need RDX 0.
2208 NewLIR2(kX86Xor64RR, rs_r2q.GetReg(), rs_r2q.GetReg());
2209 }
2210 LIR* done = NewLIR1(kX86Jmp8, 0);
2211
2212 // Expected case.
2213 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
2214 minint_branch->target = minus_one_branch->target;
2215 NewLIR1(kX86Idivmod64DaR, rs_r1q.GetReg());
2216 done->target = NewLIR0(kPseudoTargetLabel);
2217
2218 // Result is in RAX for div and RDX for rem.
2219 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, rs_r0q, INVALID_SREG, INVALID_SREG};
2220 if (!is_div) {
2221 rl_result.reg.SetReg(r2q);
2222 }
2223
2224 StoreValueWide(rl_dest, rl_result);
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002225}
2226
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002227void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002228 rl_src = LoadValueWide(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002229 RegLocation rl_result;
Elena Sayapinadd644502014-07-01 18:39:52 +07002230 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002231 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2232 OpRegReg(kOpNeg, rl_result.reg, rl_src.reg);
2233 } else {
2234 rl_result = ForceTempWide(rl_src);
2235 if (((rl_dest.location == kLocPhysReg) && (rl_src.location == kLocPhysReg)) &&
2236 ((rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()))) {
2237 // The registers are the same, so we would clobber it before the use.
2238 RegStorage temp_reg = AllocTemp();
2239 OpRegCopy(temp_reg, rl_result.reg);
2240 rl_result.reg.SetHighReg(temp_reg.GetReg());
2241 }
2242 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
2243 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
2244 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Mark Mendelle02d48f2014-01-15 11:19:23 -08002245 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002246 StoreValueWide(rl_dest, rl_result);
2247}
2248
buzbee091cc402014-03-31 10:14:40 -07002249void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<4> thread_offset) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07002250 DCHECK_EQ(kX86, cu_->instruction_set);
2251 X86OpCode opcode = kX86Bkpt;
2252 switch (op) {
2253 case kOpCmp: opcode = kX86Cmp32RT; break;
2254 case kOpMov: opcode = kX86Mov32RT; break;
2255 default:
2256 LOG(FATAL) << "Bad opcode: " << op;
2257 break;
2258 }
2259 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
2260}
2261
2262void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<8> thread_offset) {
2263 DCHECK_EQ(kX86_64, cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002264 X86OpCode opcode = kX86Bkpt;
Elena Sayapinadd644502014-07-01 18:39:52 +07002265 if (cu_->target64 && r_dest.Is64BitSolo()) {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +07002266 switch (op) {
2267 case kOpCmp: opcode = kX86Cmp64RT; break;
2268 case kOpMov: opcode = kX86Mov64RT; break;
2269 default:
2270 LOG(FATAL) << "Bad opcode(OpRegThreadMem 64): " << op;
2271 break;
2272 }
2273 } else {
2274 switch (op) {
2275 case kOpCmp: opcode = kX86Cmp32RT; break;
2276 case kOpMov: opcode = kX86Mov32RT; break;
2277 default:
2278 LOG(FATAL) << "Bad opcode: " << op;
2279 break;
2280 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002281 }
buzbee091cc402014-03-31 10:14:40 -07002282 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07002283}
2284
2285/*
2286 * Generate array load
2287 */
2288void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002289 RegLocation rl_index, RegLocation rl_dest, int scale) {
buzbee091cc402014-03-31 10:14:40 -07002290 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002291 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07002292 RegLocation rl_result;
buzbeea0cd2d72014-06-01 09:33:49 -07002293 rl_array = LoadValue(rl_array, kRefReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002294
Mark Mendell343adb52013-12-18 06:02:17 -08002295 int data_offset;
buzbee695d13a2014-04-19 13:32:20 -07002296 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002297 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2298 } else {
2299 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2300 }
2301
Mark Mendell343adb52013-12-18 06:02:17 -08002302 bool constant_index = rl_index.is_const;
2303 int32_t constant_index_value = 0;
2304 if (!constant_index) {
2305 rl_index = LoadValue(rl_index, kCoreReg);
2306 } else {
2307 constant_index_value = mir_graph_->ConstantValue(rl_index);
2308 // If index is constant, just fold it into the data offset
2309 data_offset += constant_index_value << scale;
2310 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002311 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002312 }
2313
Brian Carlstrom7940e442013-07-12 13:46:57 -07002314 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002315 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002316
2317 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002318 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002319 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002320 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002321 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002322 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002323 }
Mark Mendell343adb52013-12-18 06:02:17 -08002324 rl_result = EvalLoc(rl_dest, reg_class, true);
Vladimir Marko3bf7c602014-05-07 14:55:43 +01002325 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg, size);
buzbee695d13a2014-04-19 13:32:20 -07002326 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002327 StoreValueWide(rl_dest, rl_result);
2328 } else {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002329 StoreValue(rl_dest, rl_result);
2330 }
2331}
2332
2333/*
2334 * Generate array store
2335 *
2336 */
2337void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002338 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
buzbee091cc402014-03-31 10:14:40 -07002339 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002340 int len_offset = mirror::Array::LengthOffset().Int32Value();
2341 int data_offset;
2342
buzbee695d13a2014-04-19 13:32:20 -07002343 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002344 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2345 } else {
2346 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2347 }
2348
buzbeea0cd2d72014-06-01 09:33:49 -07002349 rl_array = LoadValue(rl_array, kRefReg);
Mark Mendell343adb52013-12-18 06:02:17 -08002350 bool constant_index = rl_index.is_const;
2351 int32_t constant_index_value = 0;
2352 if (!constant_index) {
2353 rl_index = LoadValue(rl_index, kCoreReg);
2354 } else {
2355 // If index is constant, just fold it into the data offset
2356 constant_index_value = mir_graph_->ConstantValue(rl_index);
2357 data_offset += constant_index_value << scale;
2358 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002359 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002360 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002361
2362 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002363 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002364
2365 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002366 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002367 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002368 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002369 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002370 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002371 }
buzbee695d13a2014-04-19 13:32:20 -07002372 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002373 rl_src = LoadValueWide(rl_src, reg_class);
2374 } else {
2375 rl_src = LoadValue(rl_src, reg_class);
2376 }
2377 // If the src reg can't be byte accessed, move it to a temp first.
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002378 if ((size == kSignedByte || size == kUnsignedByte) && !IsByteRegister(rl_src.reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002379 RegStorage temp = AllocTemp();
2380 OpRegCopy(temp, rl_src.reg);
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002381 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002382 } else {
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002383 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002384 }
Ian Rogersa9a82542013-10-04 11:17:26 -07002385 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07002386 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08002387 if (!constant_index) {
buzbee091cc402014-03-31 10:14:40 -07002388 FreeTemp(rl_index.reg);
Mark Mendell343adb52013-12-18 06:02:17 -08002389 }
buzbee2700f7e2014-03-07 09:46:20 -08002390 MarkGCCard(rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002391 }
2392}
2393
Mark Mendell4708dcd2014-01-22 09:05:18 -08002394RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
2395 RegLocation rl_src, int shift_amount) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002396 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Elena Sayapinadd644502014-07-01 18:39:52 +07002397 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002398 OpKind op = static_cast<OpKind>(0); /* Make gcc happy */
2399 switch (opcode) {
2400 case Instruction::SHL_LONG:
2401 case Instruction::SHL_LONG_2ADDR:
2402 op = kOpLsl;
2403 break;
2404 case Instruction::SHR_LONG:
2405 case Instruction::SHR_LONG_2ADDR:
2406 op = kOpAsr;
2407 break;
2408 case Instruction::USHR_LONG:
2409 case Instruction::USHR_LONG_2ADDR:
2410 op = kOpLsr;
2411 break;
2412 default:
2413 LOG(FATAL) << "Unexpected case";
2414 }
2415 OpRegRegImm(op, rl_result.reg, rl_src.reg, shift_amount);
2416 } else {
2417 switch (opcode) {
2418 case Instruction::SHL_LONG:
2419 case Instruction::SHL_LONG_2ADDR:
2420 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
2421 if (shift_amount == 32) {
2422 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2423 LoadConstant(rl_result.reg.GetLow(), 0);
2424 } else if (shift_amount > 31) {
2425 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2426 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
2427 LoadConstant(rl_result.reg.GetLow(), 0);
2428 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002429 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002430 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2431 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(),
2432 shift_amount);
2433 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
2434 }
2435 break;
2436 case Instruction::SHR_LONG:
2437 case Instruction::SHR_LONG_2ADDR:
2438 if (shift_amount == 32) {
2439 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2440 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2441 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2442 } else if (shift_amount > 31) {
2443 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2444 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2445 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2446 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2447 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002448 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002449 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2450 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2451 shift_amount);
2452 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
2453 }
2454 break;
2455 case Instruction::USHR_LONG:
2456 case Instruction::USHR_LONG_2ADDR:
2457 if (shift_amount == 32) {
2458 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2459 LoadConstant(rl_result.reg.GetHigh(), 0);
2460 } else if (shift_amount > 31) {
2461 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2462 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2463 LoadConstant(rl_result.reg.GetHigh(), 0);
2464 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002465 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002466 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2467 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2468 shift_amount);
2469 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
2470 }
2471 break;
2472 default:
2473 LOG(FATAL) << "Unexpected case";
2474 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08002475 }
2476 return rl_result;
2477}
2478
Brian Carlstrom7940e442013-07-12 13:46:57 -07002479void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Mark Mendell4708dcd2014-01-22 09:05:18 -08002480 RegLocation rl_src, RegLocation rl_shift) {
2481 // Per spec, we only care about low 6 bits of shift amount.
2482 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
2483 if (shift_amount == 0) {
2484 rl_src = LoadValueWide(rl_src, kCoreReg);
2485 StoreValueWide(rl_dest, rl_src);
2486 return;
2487 } else if (shift_amount == 1 &&
2488 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
2489 // Need to handle this here to avoid calling StoreValueWide twice.
Andreas Gampec76c6142014-08-04 16:30:03 -07002490 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src);
Mark Mendell4708dcd2014-01-22 09:05:18 -08002491 return;
2492 }
Alexei Zavjalovd8c3e362014-10-08 15:51:59 +07002493 if (PartiallyIntersects(rl_src, rl_dest)) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08002494 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
2495 return;
2496 }
2497 rl_src = LoadValueWide(rl_src, kCoreReg);
2498 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount);
2499 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002500}
2501
2502void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002503 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002504 bool isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002505 switch (opcode) {
2506 case Instruction::ADD_LONG:
2507 case Instruction::AND_LONG:
2508 case Instruction::OR_LONG:
2509 case Instruction::XOR_LONG:
2510 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002511 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002512 } else {
2513 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002514 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002515 }
2516 break;
2517 case Instruction::SUB_LONG:
2518 case Instruction::SUB_LONG_2ADDR:
2519 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002520 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002521 } else {
Andreas Gampec76c6142014-08-04 16:30:03 -07002522 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002523 isConstSuccess = true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002524 }
2525 break;
2526 case Instruction::ADD_LONG_2ADDR:
2527 case Instruction::OR_LONG_2ADDR:
2528 case Instruction::XOR_LONG_2ADDR:
2529 case Instruction::AND_LONG_2ADDR:
2530 if (rl_src2.is_const) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002531 if (GenerateTwoOperandInstructions()) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002532 isConstSuccess = GenLongImm(rl_dest, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002533 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07002534 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002535 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002536 } else {
2537 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002538 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002539 }
2540 break;
2541 default:
Chao-ying Fua0147762014-06-06 18:38:49 -07002542 isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002543 break;
2544 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002545
2546 if (!isConstSuccess) {
2547 // Default - bail to non-const handler.
2548 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
2549 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002550}
2551
2552bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
2553 switch (op) {
2554 case Instruction::AND_LONG_2ADDR:
2555 case Instruction::AND_LONG:
2556 return value == -1;
2557 case Instruction::OR_LONG:
2558 case Instruction::OR_LONG_2ADDR:
2559 case Instruction::XOR_LONG:
2560 case Instruction::XOR_LONG_2ADDR:
2561 return value == 0;
2562 default:
2563 return false;
2564 }
2565}
2566
2567X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
2568 bool is_high_op) {
2569 bool rhs_in_mem = rhs.location != kLocPhysReg;
2570 bool dest_in_mem = dest.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002571 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002572 DCHECK(!rhs_in_mem || !dest_in_mem);
2573 switch (op) {
2574 case Instruction::ADD_LONG:
2575 case Instruction::ADD_LONG_2ADDR:
2576 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002577 return is64Bit ? kX86Add64MR : is_high_op ? kX86Adc32MR : kX86Add32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002578 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002579 return is64Bit ? kX86Add64RM : is_high_op ? kX86Adc32RM : kX86Add32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002580 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002581 return is64Bit ? kX86Add64RR : is_high_op ? kX86Adc32RR : kX86Add32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002582 case Instruction::SUB_LONG:
2583 case Instruction::SUB_LONG_2ADDR:
2584 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002585 return is64Bit ? kX86Sub64MR : is_high_op ? kX86Sbb32MR : kX86Sub32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002586 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002587 return is64Bit ? kX86Sub64RM : is_high_op ? kX86Sbb32RM : kX86Sub32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002588 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002589 return is64Bit ? kX86Sub64RR : is_high_op ? kX86Sbb32RR : kX86Sub32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002590 case Instruction::AND_LONG_2ADDR:
2591 case Instruction::AND_LONG:
2592 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002593 return is64Bit ? kX86And64MR : kX86And32MR;
2594 }
2595 if (is64Bit) {
2596 return rhs_in_mem ? kX86And64RM : kX86And64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002597 }
2598 return rhs_in_mem ? kX86And32RM : kX86And32RR;
2599 case Instruction::OR_LONG:
2600 case Instruction::OR_LONG_2ADDR:
2601 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002602 return is64Bit ? kX86Or64MR : kX86Or32MR;
2603 }
2604 if (is64Bit) {
2605 return rhs_in_mem ? kX86Or64RM : kX86Or64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002606 }
2607 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
2608 case Instruction::XOR_LONG:
2609 case Instruction::XOR_LONG_2ADDR:
2610 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002611 return is64Bit ? kX86Xor64MR : kX86Xor32MR;
2612 }
2613 if (is64Bit) {
2614 return rhs_in_mem ? kX86Xor64RM : kX86Xor64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002615 }
2616 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
2617 default:
2618 LOG(FATAL) << "Unexpected opcode: " << op;
2619 return kX86Add32RR;
2620 }
2621}
2622
2623X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
2624 int32_t value) {
2625 bool in_mem = loc.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002626 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002627 bool byte_imm = IS_SIMM8(value);
buzbee091cc402014-03-31 10:14:40 -07002628 DCHECK(in_mem || !loc.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002629 switch (op) {
2630 case Instruction::ADD_LONG:
2631 case Instruction::ADD_LONG_2ADDR:
2632 if (byte_imm) {
2633 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002634 return is64Bit ? kX86Add64MI8 : is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002635 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002636 return is64Bit ? kX86Add64RI8 : is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002637 }
2638 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002639 return is64Bit ? kX86Add64MI : is_high_op ? kX86Adc32MI : kX86Add32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002640 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002641 return is64Bit ? kX86Add64RI : is_high_op ? kX86Adc32RI : kX86Add32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002642 case Instruction::SUB_LONG:
2643 case Instruction::SUB_LONG_2ADDR:
2644 if (byte_imm) {
2645 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002646 return is64Bit ? kX86Sub64MI8 : is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002647 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002648 return is64Bit ? kX86Sub64RI8 : is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002649 }
2650 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002651 return is64Bit ? kX86Sub64MI : is_high_op ? kX86Sbb32MI : kX86Sub32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002652 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002653 return is64Bit ? kX86Sub64RI : is_high_op ? kX86Sbb32RI : kX86Sub32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002654 case Instruction::AND_LONG_2ADDR:
2655 case Instruction::AND_LONG:
2656 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002657 if (is64Bit) {
2658 return in_mem ? kX86And64MI8 : kX86And64RI8;
2659 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002660 return in_mem ? kX86And32MI8 : kX86And32RI8;
2661 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002662 if (is64Bit) {
2663 return in_mem ? kX86And64MI : kX86And64RI;
2664 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002665 return in_mem ? kX86And32MI : kX86And32RI;
2666 case Instruction::OR_LONG:
2667 case Instruction::OR_LONG_2ADDR:
2668 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002669 if (is64Bit) {
2670 return in_mem ? kX86Or64MI8 : kX86Or64RI8;
2671 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002672 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
2673 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002674 if (is64Bit) {
2675 return in_mem ? kX86Or64MI : kX86Or64RI;
2676 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002677 return in_mem ? kX86Or32MI : kX86Or32RI;
2678 case Instruction::XOR_LONG:
2679 case Instruction::XOR_LONG_2ADDR:
2680 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002681 if (is64Bit) {
2682 return in_mem ? kX86Xor64MI8 : kX86Xor64RI8;
2683 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002684 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
2685 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002686 if (is64Bit) {
2687 return in_mem ? kX86Xor64MI : kX86Xor64RI;
2688 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002689 return in_mem ? kX86Xor32MI : kX86Xor32RI;
2690 default:
2691 LOG(FATAL) << "Unexpected opcode: " << op;
2692 return kX86Add32MI;
2693 }
2694}
2695
Chao-ying Fua0147762014-06-06 18:38:49 -07002696bool X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002697 DCHECK(rl_src.is_const);
2698 int64_t val = mir_graph_->ConstantValueWide(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07002699
Elena Sayapinadd644502014-07-01 18:39:52 +07002700 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002701 // We can do with imm only if it fits 32 bit
2702 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2703 return false;
2704 }
2705
2706 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
2707
2708 if ((rl_dest.location == kLocDalvikFrame) ||
2709 (rl_dest.location == kLocCompilerTemp)) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002710 int r_base = rs_rX86_SP.GetReg();
Chao-ying Fua0147762014-06-06 18:38:49 -07002711 int displacement = SRegOffset(rl_dest.s_reg_low);
2712
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002713 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002714 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
2715 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val);
2716 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2717 true /* is_load */, true /* is64bit */);
2718 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2719 false /* is_load */, true /* is64bit */);
2720 return true;
2721 }
2722
2723 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2724 DCHECK_EQ(rl_result.location, kLocPhysReg);
2725 DCHECK(!rl_result.reg.IsFloat());
2726
2727 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2728 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2729
2730 StoreValueWide(rl_dest, rl_result);
2731 return true;
2732 }
2733
Mark Mendelle02d48f2014-01-15 11:19:23 -08002734 int32_t val_lo = Low32Bits(val);
2735 int32_t val_hi = High32Bits(val);
buzbee30adc732014-05-09 15:10:18 -07002736 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002737
2738 // Can we just do this into memory?
2739 if ((rl_dest.location == kLocDalvikFrame) ||
2740 (rl_dest.location == kLocCompilerTemp)) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002741 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002742 int displacement = SRegOffset(rl_dest.s_reg_low);
2743
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002744 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002745 if (!IsNoOp(op, val_lo)) {
2746 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002747 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002748 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002749 true /* is_load */, true /* is64bit */);
2750 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002751 false /* is_load */, true /* is64bit */);
2752 }
2753 if (!IsNoOp(op, val_hi)) {
2754 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08002755 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002756 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002757 true /* is_load */, true /* is64bit */);
2758 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002759 false /* is_load */, true /* is64bit */);
2760 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002761 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002762 }
2763
2764 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2765 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee091cc402014-03-31 10:14:40 -07002766 DCHECK(!rl_result.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002767
2768 if (!IsNoOp(op, val_lo)) {
2769 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002770 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002771 }
2772 if (!IsNoOp(op, val_hi)) {
2773 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002774 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002775 }
2776 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002777 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002778}
2779
Chao-ying Fua0147762014-06-06 18:38:49 -07002780bool X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002781 RegLocation rl_src2, Instruction::Code op) {
2782 DCHECK(rl_src2.is_const);
2783 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002784
Elena Sayapinadd644502014-07-01 18:39:52 +07002785 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002786 // We can do with imm only if it fits 32 bit
2787 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2788 return false;
2789 }
2790 if (rl_dest.location == kLocPhysReg &&
2791 rl_src1.location == kLocPhysReg && !rl_dest.reg.IsFloat()) {
2792 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002793 OpRegCopy(rl_dest.reg, rl_src1.reg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002794 NewLIR2(x86op, rl_dest.reg.GetReg(), val);
2795 StoreFinalValueWide(rl_dest, rl_dest);
2796 return true;
2797 }
2798
2799 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2800 // We need the values to be in a temporary
2801 RegLocation rl_result = ForceTempWide(rl_src1);
2802
2803 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2804 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2805
2806 StoreFinalValueWide(rl_dest, rl_result);
2807 return true;
2808 }
2809
Mark Mendelle02d48f2014-01-15 11:19:23 -08002810 int32_t val_lo = Low32Bits(val);
2811 int32_t val_hi = High32Bits(val);
buzbee30adc732014-05-09 15:10:18 -07002812 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
2813 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002814
2815 // Can we do this directly into the destination registers?
2816 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08002817 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
buzbee091cc402014-03-31 10:14:40 -07002818 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() && !rl_dest.reg.IsFloat()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002819 if (!IsNoOp(op, val_lo)) {
2820 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002821 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002822 }
2823 if (!IsNoOp(op, val_hi)) {
2824 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002825 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002826 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07002827
2828 StoreFinalValueWide(rl_dest, rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07002829 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002830 }
2831
2832 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2833 DCHECK_EQ(rl_src1.location, kLocPhysReg);
2834
2835 // We need the values to be in a temporary
2836 RegLocation rl_result = ForceTempWide(rl_src1);
2837 if (!IsNoOp(op, val_lo)) {
2838 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002839 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002840 }
2841 if (!IsNoOp(op, val_hi)) {
2842 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002843 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002844 }
2845
2846 StoreFinalValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002847 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07002848}
2849
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002850// For final classes there are no sub-classes to check and so we can answer the instance-of
2851// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
2852void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
2853 RegLocation rl_dest, RegLocation rl_src) {
buzbeea0cd2d72014-06-01 09:33:49 -07002854 RegLocation object = LoadValue(rl_src, kRefReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002855 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002856 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002857
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002858 // For 32-bit, SETcc only works with EAX..EDX.
Chao-ying Fua77ee512014-07-01 17:43:41 -07002859 RegStorage object_32reg = object.reg.Is64Bit() ? As32BitReg(object.reg) : object.reg;
Dmitry Petrochenko407f5c12014-07-01 01:21:38 +07002860 if (result_reg.GetRegNum() == object_32reg.GetRegNum() || !IsByteRegister(result_reg)) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002861 result_reg = AllocateByteRegister();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002862 }
2863
2864 // Assume that there is no match.
2865 LoadConstant(result_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -08002866 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, NULL);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002867
Mark Mendellade54a22014-06-09 12:49:55 -04002868 // We will use this register to compare to memory below.
2869 // References are 32 bit in memory, and 64 bit in registers (in 64 bit mode).
2870 // For this reason, force allocation of a 32 bit register to use, so that the
2871 // compare to memory will be done using a 32 bit comparision.
2872 // The LoadRefDisp(s) below will work normally, even in 64 bit mode.
2873 RegStorage check_class = AllocTemp();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002874
2875 // If Method* is already in a register, we can save a copy.
2876 RegLocation rl_method = mir_graph_->GetMethodLoc();
Andreas Gampeccc60262014-07-04 18:02:38 -07002877 int32_t offset_of_type = mirror::Array::DataOffset(
2878 sizeof(mirror::HeapReference<mirror::Class*>)).Int32Value() +
2879 (sizeof(mirror::HeapReference<mirror::Class*>) * type_idx);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002880
2881 if (rl_method.location == kLocPhysReg) {
2882 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002883 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002884 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002885 } else {
buzbee695d13a2014-04-19 13:32:20 -07002886 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002887 check_class, kNotVolatile);
2888 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002889 }
2890 } else {
2891 LoadCurrMethodDirect(check_class);
2892 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002893 LoadRefDisp(check_class, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002894 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002895 } else {
buzbee695d13a2014-04-19 13:32:20 -07002896 LoadRefDisp(check_class, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002897 check_class, kNotVolatile);
2898 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002899 }
2900 }
2901
2902 // Compare the computed class to the class in the object.
2903 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08002904 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002905
2906 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08002907 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002908
2909 LIR* target = NewLIR0(kPseudoTargetLabel);
2910 null_branchover->target = target;
2911 FreeTemp(check_class);
2912 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002913 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002914 FreeTemp(result_reg);
2915 }
2916 StoreValue(rl_dest, rl_result);
2917}
2918
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002919void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
2920 RegLocation rl_lhs, RegLocation rl_rhs) {
2921 OpKind op = kOpBkpt;
2922 bool is_div_rem = false;
2923 bool unary = false;
2924 bool shift_op = false;
2925 bool is_two_addr = false;
2926 RegLocation rl_result;
2927 switch (opcode) {
2928 case Instruction::NEG_INT:
2929 op = kOpNeg;
2930 unary = true;
2931 break;
2932 case Instruction::NOT_INT:
2933 op = kOpMvn;
2934 unary = true;
2935 break;
2936 case Instruction::ADD_INT_2ADDR:
2937 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002938 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002939 case Instruction::ADD_INT:
2940 op = kOpAdd;
2941 break;
2942 case Instruction::SUB_INT_2ADDR:
2943 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002944 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002945 case Instruction::SUB_INT:
2946 op = kOpSub;
2947 break;
2948 case Instruction::MUL_INT_2ADDR:
2949 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002950 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002951 case Instruction::MUL_INT:
2952 op = kOpMul;
2953 break;
2954 case Instruction::DIV_INT_2ADDR:
2955 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002956 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002957 case Instruction::DIV_INT:
2958 op = kOpDiv;
2959 is_div_rem = true;
2960 break;
2961 /* NOTE: returns in kArg1 */
2962 case Instruction::REM_INT_2ADDR:
2963 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002964 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002965 case Instruction::REM_INT:
2966 op = kOpRem;
2967 is_div_rem = true;
2968 break;
2969 case Instruction::AND_INT_2ADDR:
2970 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002971 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002972 case Instruction::AND_INT:
2973 op = kOpAnd;
2974 break;
2975 case Instruction::OR_INT_2ADDR:
2976 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002977 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002978 case Instruction::OR_INT:
2979 op = kOpOr;
2980 break;
2981 case Instruction::XOR_INT_2ADDR:
2982 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002983 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002984 case Instruction::XOR_INT:
2985 op = kOpXor;
2986 break;
2987 case Instruction::SHL_INT_2ADDR:
2988 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002989 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002990 case Instruction::SHL_INT:
2991 shift_op = true;
2992 op = kOpLsl;
2993 break;
2994 case Instruction::SHR_INT_2ADDR:
2995 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07002996 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002997 case Instruction::SHR_INT:
2998 shift_op = true;
2999 op = kOpAsr;
3000 break;
3001 case Instruction::USHR_INT_2ADDR:
3002 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003003 FALLTHROUGH_INTENDED;
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003004 case Instruction::USHR_INT:
3005 shift_op = true;
3006 op = kOpLsr;
3007 break;
3008 default:
3009 LOG(FATAL) << "Invalid word arith op: " << opcode;
3010 }
3011
Mark Mendelle87f9b52014-04-30 14:13:18 -04003012 // Can we convert to a two address instruction?
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003013 if (!is_two_addr &&
3014 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3015 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04003016 is_two_addr = true;
3017 }
3018
3019 if (!GenerateTwoOperandInstructions()) {
3020 is_two_addr = false;
3021 }
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003022
3023 // Get the div/rem stuff out of the way.
3024 if (is_div_rem) {
3025 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, true);
3026 StoreValue(rl_dest, rl_result);
3027 return;
3028 }
3029
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003030 // If we generate any memory access below, it will reference a dalvik reg.
3031 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
3032
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003033 if (unary) {
3034 rl_lhs = LoadValue(rl_lhs, kCoreReg);
buzbee30adc732014-05-09 15:10:18 -07003035 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003036 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003037 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003038 } else {
3039 if (shift_op) {
3040 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003041 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003042 LoadValueDirectFixed(rl_rhs, t_reg);
3043 if (is_two_addr) {
3044 // Can we do this directly into memory?
Serguei Katkova4644662014-09-08 12:42:27 +07003045 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003046 if (rl_result.location != kLocPhysReg) {
3047 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08003048 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003049 FreeTemp(t_reg);
3050 return;
buzbee091cc402014-03-31 10:14:40 -07003051 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003052 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08003053 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003054 FreeTemp(t_reg);
3055 StoreFinalValue(rl_dest, rl_result);
3056 return;
3057 }
3058 }
3059 // Three address form, or we can't do directly.
3060 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3061 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003062 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003063 FreeTemp(t_reg);
3064 } else {
3065 // Multiply is 3 operand only (sort of).
3066 if (is_two_addr && op != kOpMul) {
3067 // Can we do this directly into memory?
buzbee30adc732014-05-09 15:10:18 -07003068 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003069 if (rl_result.location == kLocPhysReg) {
Serguei Katkov366f8ae2014-04-15 16:55:26 +07003070 // Ensure res is in a core reg
3071 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003072 // Can we do this from memory directly?
buzbee30adc732014-05-09 15:10:18 -07003073 rl_rhs = UpdateLocTyped(rl_rhs, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003074 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08003075 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003076 StoreFinalValue(rl_dest, rl_result);
3077 return;
buzbee091cc402014-03-31 10:14:40 -07003078 } else if (!rl_rhs.reg.IsFloat()) {
buzbee2700f7e2014-03-07 09:46:20 -08003079 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003080 StoreFinalValue(rl_dest, rl_result);
3081 return;
3082 }
3083 }
3084 rl_rhs = LoadValue(rl_rhs, kCoreReg);
Serguei Katkovd293fb42014-05-19 15:45:42 +07003085 // It might happen rl_rhs and rl_dest are the same VR
3086 // in this case rl_dest is in reg after LoadValue while
3087 // rl_result is not updated yet, so do this
3088 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003089 if (rl_result.location != kLocPhysReg) {
3090 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00003091 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003092 return;
buzbee091cc402014-03-31 10:14:40 -07003093 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003094 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08003095 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003096 StoreFinalValue(rl_dest, rl_result);
3097 return;
3098 } else {
3099 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3100 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003101 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003102 }
3103 } else {
3104 // Try to use reg/memory instructions.
buzbee30adc732014-05-09 15:10:18 -07003105 rl_lhs = UpdateLocTyped(rl_lhs, kCoreReg);
3106 rl_rhs = UpdateLocTyped(rl_rhs, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003107 // We can't optimize with FP registers.
3108 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
3109 // Something is difficult, so fall back to the standard case.
3110 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3111 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3112 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003113 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003114 } else {
3115 // We can optimize by moving to result and using memory operands.
3116 if (rl_rhs.location != kLocPhysReg) {
3117 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07003118 // We should be careful with order here
3119 // If rl_dest and rl_lhs points to the same VR we should load first
3120 // If the are different we should find a register first for dest
Chao-ying Fua0147762014-06-06 18:38:49 -07003121 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3122 mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
Serguei Katkov66da1362014-03-14 13:33:33 +07003123 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3124 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendelle87f9b52014-04-30 14:13:18 -04003125 // No-op if these are the same.
3126 OpRegCopy(rl_result.reg, rl_lhs.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003127 } else {
3128 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003129 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003130 }
buzbee2700f7e2014-03-07 09:46:20 -08003131 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003132 } else if (rl_lhs.location != kLocPhysReg) {
3133 // RHS is in a register; LHS is in memory.
3134 if (op != kOpSub) {
3135 // Force RHS into result and operate on memory.
3136 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003137 OpRegCopy(rl_result.reg, rl_rhs.reg);
3138 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003139 } else {
3140 // Subtraction isn't commutative.
3141 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3142 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3143 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003144 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003145 }
3146 } else {
3147 // Both are in registers.
3148 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3149 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3150 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003151 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003152 }
3153 }
3154 }
3155 }
3156 }
3157 StoreValue(rl_dest, rl_result);
3158}
3159
3160bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
3161 // If we have non-core registers, then we can't do good things.
buzbee091cc402014-03-31 10:14:40 -07003162 if (rl_lhs.location == kLocPhysReg && rl_lhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003163 return false;
3164 }
buzbee091cc402014-03-31 10:14:40 -07003165 if (rl_rhs.location == kLocPhysReg && rl_rhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003166 return false;
3167 }
3168
3169 // Everything will be fine :-).
3170 return true;
3171}
Chao-ying Fua0147762014-06-06 18:38:49 -07003172
3173void X86Mir2Lir::GenIntToLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003174 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07003175 Mir2Lir::GenIntToLong(rl_dest, rl_src);
3176 return;
3177 }
Serguei Katkove63d9d42014-06-25 00:25:35 +07003178 rl_src = UpdateLocTyped(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003179 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
3180 if (rl_src.location == kLocPhysReg) {
3181 NewLIR2(kX86MovsxdRR, rl_result.reg.GetReg(), rl_src.reg.GetReg());
3182 } else {
3183 int displacement = SRegOffset(rl_src.s_reg_low);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003184 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003185 LIR *m = NewLIR3(kX86MovsxdRM, rl_result.reg.GetReg(), rs_rX86_SP.GetReg(),
3186 displacement + LOWORD_OFFSET);
3187 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
3188 true /* is_load */, true /* is_64bit */);
3189 }
3190 StoreValueWide(rl_dest, rl_result);
3191}
3192
3193void X86Mir2Lir::GenShiftOpLong(Instruction::Code opcode, RegLocation rl_dest,
3194 RegLocation rl_src1, RegLocation rl_shift) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003195 if (!cu_->target64) {
Yixin Shouf40f8902014-08-14 14:10:32 -04003196 // Long shift operations in 32-bit. Use shld or shrd to create a 32-bit register filled from
3197 // the other half, shift the other half, if the shift amount is less than 32 we're done,
3198 // otherwise move one register to the other and place zero or sign bits in the other.
3199 LIR* branch;
3200 FlushAllRegs();
3201 LockCallTemps();
3202 LoadValueDirectFixed(rl_shift, rs_rCX);
3203 RegStorage r_tmp = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
3204 LoadValueDirectWideFixed(rl_src1, r_tmp);
3205 switch (opcode) {
3206 case Instruction::SHL_LONG:
3207 case Instruction::SHL_LONG_2ADDR:
3208 NewLIR3(kX86Shld32RRC, r_tmp.GetHighReg(), r_tmp.GetLowReg(), rs_rCX.GetReg());
3209 NewLIR2(kX86Sal32RC, r_tmp.GetLowReg(), rs_rCX.GetReg());
3210 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3211 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3212 OpRegCopy(r_tmp.GetHigh(), r_tmp.GetLow());
3213 LoadConstant(r_tmp.GetLow(), 0);
3214 branch->target = NewLIR0(kPseudoTargetLabel);
3215 break;
3216 case Instruction::SHR_LONG:
3217 case Instruction::SHR_LONG_2ADDR:
3218 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(), rs_rCX.GetReg());
3219 NewLIR2(kX86Sar32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3220 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3221 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3222 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3223 NewLIR2(kX86Sar32RI, r_tmp.GetHighReg(), 31);
3224 branch->target = NewLIR0(kPseudoTargetLabel);
3225 break;
3226 case Instruction::USHR_LONG:
3227 case Instruction::USHR_LONG_2ADDR:
3228 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(),
3229 rs_rCX.GetReg());
3230 NewLIR2(kX86Shr32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3231 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3232 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3233 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3234 LoadConstant(r_tmp.GetHigh(), 0);
3235 branch->target = NewLIR0(kPseudoTargetLabel);
3236 break;
3237 default:
3238 LOG(FATAL) << "Unexpected case: " << opcode;
3239 return;
3240 }
3241 RegLocation rl_result = LocCReturnWide();
3242 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07003243 return;
3244 }
3245
3246 bool is_two_addr = false;
3247 OpKind op = kOpBkpt;
3248 RegLocation rl_result;
3249
3250 switch (opcode) {
3251 case Instruction::SHL_LONG_2ADDR:
3252 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003253 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003254 case Instruction::SHL_LONG:
3255 op = kOpLsl;
3256 break;
3257 case Instruction::SHR_LONG_2ADDR:
3258 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003259 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003260 case Instruction::SHR_LONG:
3261 op = kOpAsr;
3262 break;
3263 case Instruction::USHR_LONG_2ADDR:
3264 is_two_addr = true;
Ian Rogersfc787ec2014-10-09 21:56:44 -07003265 FALLTHROUGH_INTENDED;
Chao-ying Fua0147762014-06-06 18:38:49 -07003266 case Instruction::USHR_LONG:
3267 op = kOpLsr;
3268 break;
3269 default:
3270 op = kOpBkpt;
3271 }
3272
3273 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003274 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Chao-ying Fua0147762014-06-06 18:38:49 -07003275 LoadValueDirectFixed(rl_shift, t_reg);
3276 if (is_two_addr) {
3277 // Can we do this directly into memory?
3278 rl_result = UpdateLocWideTyped(rl_dest, kCoreReg);
3279 if (rl_result.location != kLocPhysReg) {
3280 // Okay, we can do this into memory
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003281 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003282 OpMemReg(op, rl_result, t_reg.GetReg());
3283 } else if (!rl_result.reg.IsFloat()) {
3284 // Can do this directly into the result register
3285 OpRegReg(op, rl_result.reg, t_reg);
3286 StoreFinalValueWide(rl_dest, rl_result);
3287 }
3288 } else {
3289 // Three address form, or we can't do directly.
3290 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
3291 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
3292 OpRegRegReg(op, rl_result.reg, rl_src1.reg, t_reg);
3293 StoreFinalValueWide(rl_dest, rl_result);
3294 }
3295
3296 FreeTemp(t_reg);
3297}
3298
Brian Carlstrom7940e442013-07-12 13:46:57 -07003299} // namespace art