blob: ef2d9a6816538e47d83ffaf5c8670b2af25b2f79 [file] [log] [blame]
Brian Carlstrom7940e442013-07-12 13:46:57 -07001/*
2 * Copyright (C) 2012 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17/* This file contains codegen for the X86 ISA */
18
19#include "codegen_x86.h"
20#include "dex/quick/mir_to_lir-inl.h"
buzbeeb5860fb2014-06-21 15:31:01 -070021#include "dex/reg_storage_eq.h"
Mingyao Yang98d1cc82014-05-15 17:02:16 -070022#include "mirror/art_method.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070023#include "mirror/array.h"
24#include "x86_lir.h"
25
26namespace art {
27
28/*
Brian Carlstrom7940e442013-07-12 13:46:57 -070029 * Compare two 64-bit values
30 * x = y return 0
31 * x < y return -1
32 * x > y return 1
33 */
34void X86Mir2Lir::GenCmpLong(RegLocation rl_dest, RegLocation rl_src1,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070035 RegLocation rl_src2) {
Elena Sayapinadd644502014-07-01 18:39:52 +070036 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -070037 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
38 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
39 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Chao-ying Fua0147762014-06-06 18:38:49 -070040 RegStorage temp_reg = AllocTemp();
Serguei Katkov1c557032014-06-23 13:23:38 +070041 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
42 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondG); // result = (src1 > src2) ? 1 : 0
43 NewLIR2(kX86Set8R, temp_reg.GetReg(), kX86CondL); // temp = (src1 >= src2) ? 0 : 1
44 NewLIR2(kX86Sub8RR, rl_result.reg.GetReg(), temp_reg.GetReg());
45 NewLIR2(kX86Movsx8qRR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Serguei Katkov04982232014-06-20 18:17:16 +070046
Chao-ying Fua0147762014-06-06 18:38:49 -070047 StoreValue(rl_dest, rl_result);
48 FreeTemp(temp_reg);
49 return;
50 }
51
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +070052 // Prepare for explicit register usage
53 ExplicitTempRegisterLock(this, 4, &rs_r0, &rs_r1, &rs_r2, &rs_r3);
buzbee091cc402014-03-31 10:14:40 -070054 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
55 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -080056 LoadValueDirectWideFixed(rl_src1, r_tmp1);
57 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Brian Carlstrom7940e442013-07-12 13:46:57 -070058 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -080059 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
60 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
buzbee091cc402014-03-31 10:14:40 -070061 NewLIR2(kX86Set8R, rs_r2.GetReg(), kX86CondL); // r2 = (r1:r0) < (r3:r2) ? 1 : 0
62 NewLIR2(kX86Movzx8RR, rs_r2.GetReg(), rs_r2.GetReg());
buzbee2700f7e2014-03-07 09:46:20 -080063 OpReg(kOpNeg, rs_r2); // r2 = -r2
64 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = high | low - sets ZF
buzbee091cc402014-03-31 10:14:40 -070065 NewLIR2(kX86Set8R, rs_r0.GetReg(), kX86CondNz); // r0 = (r1:r0) != (r3:r2) ? 1 : 0
Brian Carlstrom7940e442013-07-12 13:46:57 -070066 NewLIR2(kX86Movzx8RR, r0, r0);
buzbee2700f7e2014-03-07 09:46:20 -080067 OpRegReg(kOpOr, rs_r0, rs_r2); // r0 = r0 | r2
Brian Carlstrom7940e442013-07-12 13:46:57 -070068 RegLocation rl_result = LocCReturn();
69 StoreValue(rl_dest, rl_result);
70}
71
72X86ConditionCode X86ConditionEncoding(ConditionCode cond) {
73 switch (cond) {
74 case kCondEq: return kX86CondEq;
75 case kCondNe: return kX86CondNe;
76 case kCondCs: return kX86CondC;
77 case kCondCc: return kX86CondNc;
Vladimir Marko58af1f92013-12-19 13:31:15 +000078 case kCondUlt: return kX86CondC;
79 case kCondUge: return kX86CondNc;
Brian Carlstrom7940e442013-07-12 13:46:57 -070080 case kCondMi: return kX86CondS;
81 case kCondPl: return kX86CondNs;
82 case kCondVs: return kX86CondO;
83 case kCondVc: return kX86CondNo;
84 case kCondHi: return kX86CondA;
85 case kCondLs: return kX86CondBe;
86 case kCondGe: return kX86CondGe;
87 case kCondLt: return kX86CondL;
88 case kCondGt: return kX86CondG;
89 case kCondLe: return kX86CondLe;
90 case kCondAl:
91 case kCondNv: LOG(FATAL) << "Should not reach here";
92 }
93 return kX86CondO;
94}
95
buzbee2700f7e2014-03-07 09:46:20 -080096LIR* X86Mir2Lir::OpCmpBranch(ConditionCode cond, RegStorage src1, RegStorage src2, LIR* target) {
Chao-ying Fua77ee512014-07-01 17:43:41 -070097 NewLIR2(src1.Is64Bit() ? kX86Cmp64RR : kX86Cmp32RR, src1.GetReg(), src2.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -070098 X86ConditionCode cc = X86ConditionEncoding(cond);
99 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ ,
100 cc);
101 branch->target = target;
102 return branch;
103}
104
buzbee2700f7e2014-03-07 09:46:20 -0800105LIR* X86Mir2Lir::OpCmpImmBranch(ConditionCode cond, RegStorage reg,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700106 int check_value, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700107 if ((check_value == 0) && (cond == kCondEq || cond == kCondNe)) {
108 // TODO: when check_value == 0 and reg is rCX, use the jcxz/nz opcode
Chao-ying Fua77ee512014-07-01 17:43:41 -0700109 NewLIR2(reg.Is64Bit() ? kX86Test64RR: kX86Test32RR, reg.GetReg(), reg.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700110 } else {
Chao-ying Fua77ee512014-07-01 17:43:41 -0700111 if (reg.Is64Bit()) {
112 NewLIR2(IS_SIMM8(check_value) ? kX86Cmp64RI8 : kX86Cmp64RI, reg.GetReg(), check_value);
113 } else {
114 NewLIR2(IS_SIMM8(check_value) ? kX86Cmp32RI8 : kX86Cmp32RI, reg.GetReg(), check_value);
115 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700116 }
117 X86ConditionCode cc = X86ConditionEncoding(cond);
118 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ , cc);
119 branch->target = target;
120 return branch;
121}
122
buzbee2700f7e2014-03-07 09:46:20 -0800123LIR* X86Mir2Lir::OpRegCopyNoInsert(RegStorage r_dest, RegStorage r_src) {
124 // If src or dest is a pair, we'll be using low reg.
125 if (r_dest.IsPair()) {
126 r_dest = r_dest.GetLow();
127 }
128 if (r_src.IsPair()) {
129 r_src = r_src.GetLow();
130 }
buzbee091cc402014-03-31 10:14:40 -0700131 if (r_dest.IsFloat() || r_src.IsFloat())
Brian Carlstrom7940e442013-07-12 13:46:57 -0700132 return OpFpRegCopy(r_dest, r_src);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700133 LIR* res = RawLIR(current_dalvik_offset_, r_dest.Is64Bit() ? kX86Mov64RR : kX86Mov32RR,
buzbee2700f7e2014-03-07 09:46:20 -0800134 r_dest.GetReg(), r_src.GetReg());
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800135 if (!(cu_->disable_opt & (1 << kSafeOptimizations)) && r_dest == r_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700136 res->flags.is_nop = true;
137 }
138 return res;
139}
140
buzbee7a11ab02014-04-28 20:02:38 -0700141void X86Mir2Lir::OpRegCopy(RegStorage r_dest, RegStorage r_src) {
142 if (r_dest != r_src) {
143 LIR *res = OpRegCopyNoInsert(r_dest, r_src);
144 AppendLIR(res);
145 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700146}
147
buzbee2700f7e2014-03-07 09:46:20 -0800148void X86Mir2Lir::OpRegCopyWide(RegStorage r_dest, RegStorage r_src) {
buzbee7a11ab02014-04-28 20:02:38 -0700149 if (r_dest != r_src) {
buzbee091cc402014-03-31 10:14:40 -0700150 bool dest_fp = r_dest.IsFloat();
151 bool src_fp = r_src.IsFloat();
buzbee7a11ab02014-04-28 20:02:38 -0700152 if (dest_fp) {
153 if (src_fp) {
buzbee091cc402014-03-31 10:14:40 -0700154 OpRegCopy(r_dest, r_src);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700155 } else {
buzbee7a11ab02014-04-28 20:02:38 -0700156 // TODO: Prevent this from happening in the code. The result is often
157 // unused or could have been loaded more easily from memory.
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700158 if (!r_src.IsPair()) {
159 DCHECK(!r_dest.IsPair());
160 NewLIR2(kX86MovqxrRR, r_dest.GetReg(), r_src.GetReg());
161 } else {
162 NewLIR2(kX86MovdxrRR, r_dest.GetReg(), r_src.GetLowReg());
163 RegStorage r_tmp = AllocTempDouble();
164 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), r_src.GetHighReg());
165 NewLIR2(kX86PunpckldqRR, r_dest.GetReg(), r_tmp.GetReg());
166 FreeTemp(r_tmp);
167 }
buzbee7a11ab02014-04-28 20:02:38 -0700168 }
169 } else {
170 if (src_fp) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700171 if (!r_dest.IsPair()) {
172 DCHECK(!r_src.IsPair());
173 NewLIR2(kX86MovqrxRR, r_dest.GetReg(), r_src.GetReg());
buzbee7a11ab02014-04-28 20:02:38 -0700174 } else {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700175 NewLIR2(kX86MovdrxRR, r_dest.GetLowReg(), r_src.GetReg());
176 RegStorage temp_reg = AllocTempDouble();
177 NewLIR2(kX86MovsdRR, temp_reg.GetReg(), r_src.GetReg());
178 NewLIR2(kX86PsrlqRI, temp_reg.GetReg(), 32);
179 NewLIR2(kX86MovdrxRR, r_dest.GetHighReg(), temp_reg.GetReg());
180 }
181 } else {
182 DCHECK_EQ(r_dest.IsPair(), r_src.IsPair());
183 if (!r_src.IsPair()) {
184 // Just copy the register directly.
185 OpRegCopy(r_dest, r_src);
186 } else {
187 // Handle overlap
188 if (r_src.GetHighReg() == r_dest.GetLowReg() &&
189 r_src.GetLowReg() == r_dest.GetHighReg()) {
190 // Deal with cycles.
191 RegStorage temp_reg = AllocTemp();
192 OpRegCopy(temp_reg, r_dest.GetHigh());
193 OpRegCopy(r_dest.GetHigh(), r_dest.GetLow());
194 OpRegCopy(r_dest.GetLow(), temp_reg);
195 FreeTemp(temp_reg);
196 } else if (r_src.GetHighReg() == r_dest.GetLowReg()) {
197 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
198 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
199 } else {
200 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
201 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
202 }
buzbee7a11ab02014-04-28 20:02:38 -0700203 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700204 }
205 }
206 }
207}
208
Andreas Gampe90969af2014-07-15 23:02:11 -0700209void X86Mir2Lir::GenSelectConst32(RegStorage left_op, RegStorage right_op, ConditionCode code,
210 int32_t true_val, int32_t false_val, RegStorage rs_dest,
211 int dest_reg_class) {
Serguei Katkov9ee45192014-07-17 14:39:03 +0700212 DCHECK(!left_op.IsPair() && !right_op.IsPair() && !rs_dest.IsPair());
213 DCHECK(!left_op.IsFloat() && !right_op.IsFloat() && !rs_dest.IsFloat());
214
215 // We really need this check for correctness, otherwise we will need to do more checks in
216 // non zero/one case
217 if (true_val == false_val) {
218 LoadConstantNoClobber(rs_dest, true_val);
219 return;
Andreas Gampe90969af2014-07-15 23:02:11 -0700220 }
221
Serguei Katkov9ee45192014-07-17 14:39:03 +0700222 const bool dest_intersect = IsSameReg(rs_dest, left_op) || IsSameReg(rs_dest, right_op);
223
224 const bool zero_one_case = (true_val == 0 && false_val == 1) || (true_val == 1 && false_val == 0);
225 if (zero_one_case && IsByteRegister(rs_dest)) {
226 if (!dest_intersect) {
227 LoadConstantNoClobber(rs_dest, 0);
228 }
229 OpRegReg(kOpCmp, left_op, right_op);
230 // Set the low byte of the result to 0 or 1 from the compare condition code.
231 NewLIR2(kX86Set8R, rs_dest.GetReg(),
232 X86ConditionEncoding(true_val == 1 ? code : FlipComparisonOrder(code)));
233 if (dest_intersect) {
234 NewLIR2(rs_dest.Is64Bit() ? kX86Movzx8qRR : kX86Movzx8RR, rs_dest.GetReg(), rs_dest.GetReg());
235 }
236 } else {
237 // Be careful rs_dest can be changed only after cmp because it can be the same as one of ops
238 // and it cannot use xor because it makes cc flags to be dirty
239 RegStorage temp_reg = AllocTypedTemp(false, dest_reg_class, false);
240 if (temp_reg.Valid()) {
241 if (false_val == 0 && dest_intersect) {
242 code = FlipComparisonOrder(code);
243 std::swap(true_val, false_val);
244 }
245 if (!dest_intersect) {
246 LoadConstantNoClobber(rs_dest, false_val);
247 }
248 LoadConstantNoClobber(temp_reg, true_val);
249 OpRegReg(kOpCmp, left_op, right_op);
250 if (dest_intersect) {
251 LoadConstantNoClobber(rs_dest, false_val);
252 DCHECK(!last_lir_insn_->u.m.def_mask->HasBit(ResourceMask::kCCode));
253 }
254 OpCondRegReg(kOpCmov, code, rs_dest, temp_reg);
255 FreeTemp(temp_reg);
256 } else {
257 // slow path
258 LIR* cmp_branch = OpCmpBranch(code, left_op, right_op, nullptr);
259 LoadConstantNoClobber(rs_dest, false_val);
260 LIR* that_is_it = NewLIR1(kX86Jmp8, 0);
261 LIR* true_case = NewLIR0(kPseudoTargetLabel);
262 cmp_branch->target = true_case;
263 LoadConstantNoClobber(rs_dest, true_val);
264 LIR* end = NewLIR0(kPseudoTargetLabel);
265 that_is_it->target = end;
266 }
267 }
Andreas Gampe90969af2014-07-15 23:02:11 -0700268}
269
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700270void X86Mir2Lir::GenSelect(BasicBlock* bb, MIR* mir) {
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800271 RegLocation rl_result;
272 RegLocation rl_src = mir_graph_->GetSrc(mir, 0);
273 RegLocation rl_dest = mir_graph_->GetDest(mir);
buzbeea0cd2d72014-06-01 09:33:49 -0700274 // Avoid using float regs here.
275 RegisterClass src_reg_class = rl_src.ref ? kRefReg : kCoreReg;
276 RegisterClass result_reg_class = rl_dest.ref ? kRefReg : kCoreReg;
Vladimir Markoa1a70742014-03-03 10:28:05 +0000277 ConditionCode ccode = mir->meta.ccode;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800278
279 // The kMirOpSelect has two variants, one for constants and one for moves.
280 const bool is_constant_case = (mir->ssa_rep->num_uses == 1);
281
282 if (is_constant_case) {
283 int true_val = mir->dalvikInsn.vB;
284 int false_val = mir->dalvikInsn.vC;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800285
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700286 // simplest strange case
287 if (true_val == false_val) {
288 rl_result = EvalLoc(rl_dest, result_reg_class, true);
289 LoadConstantNoClobber(rl_result.reg, true_val);
290 } else {
291 // TODO: use GenSelectConst32 and handle additional opcode patterns such as
292 // "cmp; setcc; movzx" or "cmp; sbb r0,r0; and r0,$mask; add r0,$literal".
293 rl_src = LoadValue(rl_src, src_reg_class);
294 rl_result = EvalLoc(rl_dest, result_reg_class, true);
295 /*
296 * For ccode == kCondEq:
297 *
298 * 1) When the true case is zero and result_reg is not same as src_reg:
299 * xor result_reg, result_reg
300 * cmp $0, src_reg
301 * mov t1, $false_case
302 * cmovnz result_reg, t1
303 * 2) When the false case is zero and result_reg is not same as src_reg:
304 * xor result_reg, result_reg
305 * cmp $0, src_reg
306 * mov t1, $true_case
307 * cmovz result_reg, t1
308 * 3) All other cases (we do compare first to set eflags):
309 * cmp $0, src_reg
310 * mov result_reg, $false_case
311 * mov t1, $true_case
312 * cmovz result_reg, t1
313 */
314 // FIXME: depending on how you use registers you could get a false != mismatch when dealing
315 // with different views of the same underlying physical resource (i.e. solo32 vs. solo64).
316 const bool result_reg_same_as_src =
317 (rl_src.location == kLocPhysReg && rl_src.reg.GetRegNum() == rl_result.reg.GetRegNum());
318 const bool true_zero_case = (true_val == 0 && false_val != 0 && !result_reg_same_as_src);
319 const bool false_zero_case = (false_val == 0 && true_val != 0 && !result_reg_same_as_src);
320 const bool catch_all_case = !(true_zero_case || false_zero_case);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800321
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700322 if (true_zero_case || false_zero_case) {
323 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
324 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800325
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700326 if (true_zero_case || false_zero_case || catch_all_case) {
327 OpRegImm(kOpCmp, rl_src.reg, 0);
328 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800329
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700330 if (catch_all_case) {
331 OpRegImm(kOpMov, rl_result.reg, false_val);
332 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800333
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700334 if (true_zero_case || false_zero_case || catch_all_case) {
335 ConditionCode cc = true_zero_case ? NegateComparison(ccode) : ccode;
336 int immediateForTemp = true_zero_case ? false_val : true_val;
337 RegStorage temp1_reg = AllocTypedTemp(false, result_reg_class);
338 OpRegImm(kOpMov, temp1_reg, immediateForTemp);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800339
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700340 OpCondRegReg(kOpCmov, cc, rl_result.reg, temp1_reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800341
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700342 FreeTemp(temp1_reg);
343 }
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800344 }
345 } else {
Jean Christophe Beyler3f51e7d2014-09-04 08:34:28 -0700346 rl_src = LoadValue(rl_src, src_reg_class);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800347 RegLocation rl_true = mir_graph_->GetSrc(mir, 1);
348 RegLocation rl_false = mir_graph_->GetSrc(mir, 2);
buzbeea0cd2d72014-06-01 09:33:49 -0700349 rl_true = LoadValue(rl_true, result_reg_class);
350 rl_false = LoadValue(rl_false, result_reg_class);
351 rl_result = EvalLoc(rl_dest, result_reg_class, true);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800352
353 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000354 * For ccode == kCondEq:
355 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800356 * 1) When true case is already in place:
357 * cmp $0, src_reg
358 * cmovnz result_reg, false_reg
359 * 2) When false case is already in place:
360 * cmp $0, src_reg
361 * cmovz result_reg, true_reg
362 * 3) When neither cases are in place:
363 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000364 * mov result_reg, false_reg
365 * cmovz result_reg, true_reg
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800366 */
367
368 // kMirOpSelect is generated just for conditional cases when comparison is done with zero.
buzbee2700f7e2014-03-07 09:46:20 -0800369 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800370
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000371 if (rl_result.reg.GetReg() == rl_true.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800372 OpCondRegReg(kOpCmov, NegateComparison(ccode), rl_result.reg, rl_false.reg);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000373 } else if (rl_result.reg.GetReg() == rl_false.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800374 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800375 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800376 OpRegCopy(rl_result.reg, rl_false.reg);
377 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800378 }
379 }
380
381 StoreValue(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700382}
383
384void X86Mir2Lir::GenFusedLongCmpBranch(BasicBlock* bb, MIR* mir) {
buzbee0d829482013-10-11 15:24:55 -0700385 LIR* taken = &block_label_list_[bb->taken];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700386 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
387 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
Vladimir Markoa8946072014-01-22 10:30:44 +0000388 ConditionCode ccode = mir->meta.ccode;
Mark Mendell412d4f82013-12-18 13:32:36 -0800389
390 if (rl_src1.is_const) {
391 std::swap(rl_src1, rl_src2);
392 ccode = FlipComparisonOrder(ccode);
393 }
394 if (rl_src2.is_const) {
395 // Do special compare/branch against simple const operand
396 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
397 GenFusedLongCmpImmBranch(bb, rl_src1, val, ccode);
398 return;
399 }
400
Elena Sayapinadd644502014-07-01 18:39:52 +0700401 if (cu_->target64) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700402 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
403 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
404
405 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
406 OpCondBranch(ccode, taken);
407 return;
408 }
409
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700410 // Prepare for explicit register usage
411 ExplicitTempRegisterLock(this, 4, &rs_r0, &rs_r1, &rs_r2, &rs_r3);
buzbee091cc402014-03-31 10:14:40 -0700412 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
413 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -0800414 LoadValueDirectWideFixed(rl_src1, r_tmp1);
415 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700416
Brian Carlstrom7940e442013-07-12 13:46:57 -0700417 // Swap operands and condition code to prevent use of zero flag.
418 if (ccode == kCondLe || ccode == kCondGt) {
419 // Compute (r3:r2) = (r3:r2) - (r1:r0)
buzbee2700f7e2014-03-07 09:46:20 -0800420 OpRegReg(kOpSub, rs_r2, rs_r0); // r2 = r2 - r0
421 OpRegReg(kOpSbc, rs_r3, rs_r1); // r3 = r3 - r1 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700422 } else {
423 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -0800424 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
425 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700426 }
427 switch (ccode) {
428 case kCondEq:
429 case kCondNe:
buzbee2700f7e2014-03-07 09:46:20 -0800430 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = r0 | r1
Brian Carlstrom7940e442013-07-12 13:46:57 -0700431 break;
432 case kCondLe:
433 ccode = kCondGe;
434 break;
435 case kCondGt:
436 ccode = kCondLt;
437 break;
438 case kCondLt:
439 case kCondGe:
440 break;
441 default:
442 LOG(FATAL) << "Unexpected ccode: " << ccode;
443 }
444 OpCondBranch(ccode, taken);
445}
446
Mark Mendell412d4f82013-12-18 13:32:36 -0800447void X86Mir2Lir::GenFusedLongCmpImmBranch(BasicBlock* bb, RegLocation rl_src1,
448 int64_t val, ConditionCode ccode) {
449 int32_t val_lo = Low32Bits(val);
450 int32_t val_hi = High32Bits(val);
451 LIR* taken = &block_label_list_[bb->taken];
Mark Mendell412d4f82013-12-18 13:32:36 -0800452 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Mark Mendell752e2052014-05-01 10:19:04 -0400453 bool is_equality_test = ccode == kCondEq || ccode == kCondNe;
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700454
Elena Sayapinadd644502014-07-01 18:39:52 +0700455 if (cu_->target64) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700456 if (is_equality_test && val == 0) {
457 // We can simplify of comparing for ==, != to 0.
458 NewLIR2(kX86Test64RR, rl_src1.reg.GetReg(), rl_src1.reg.GetReg());
459 } else if (is_equality_test && val_hi == 0 && val_lo > 0) {
460 OpRegImm(kOpCmp, rl_src1.reg, val_lo);
461 } else {
462 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
463 LoadConstantWide(tmp, val);
464 OpRegReg(kOpCmp, rl_src1.reg, tmp);
465 FreeTemp(tmp);
466 }
467 OpCondBranch(ccode, taken);
468 return;
469 }
470
Mark Mendell752e2052014-05-01 10:19:04 -0400471 if (is_equality_test && val != 0) {
472 rl_src1 = ForceTempWide(rl_src1);
473 }
buzbee2700f7e2014-03-07 09:46:20 -0800474 RegStorage low_reg = rl_src1.reg.GetLow();
475 RegStorage high_reg = rl_src1.reg.GetHigh();
Mark Mendell412d4f82013-12-18 13:32:36 -0800476
Mark Mendell752e2052014-05-01 10:19:04 -0400477 if (is_equality_test) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700478 // We can simplify of comparing for ==, != to 0.
Mark Mendell752e2052014-05-01 10:19:04 -0400479 if (val == 0) {
480 if (IsTemp(low_reg)) {
481 OpRegReg(kOpOr, low_reg, high_reg);
482 // We have now changed it; ignore the old values.
483 Clobber(rl_src1.reg);
484 } else {
485 RegStorage t_reg = AllocTemp();
486 OpRegRegReg(kOpOr, t_reg, low_reg, high_reg);
487 FreeTemp(t_reg);
488 }
489 OpCondBranch(ccode, taken);
490 return;
491 }
492
493 // Need to compute the actual value for ==, !=.
494 OpRegImm(kOpSub, low_reg, val_lo);
495 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
496 OpRegReg(kOpOr, high_reg, low_reg);
497 Clobber(rl_src1.reg);
498 } else if (ccode == kCondLe || ccode == kCondGt) {
499 // Swap operands and condition code to prevent use of zero flag.
500 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
501 LoadConstantWide(tmp, val);
502 OpRegReg(kOpSub, tmp.GetLow(), low_reg);
503 OpRegReg(kOpSbc, tmp.GetHigh(), high_reg);
504 ccode = (ccode == kCondLe) ? kCondGe : kCondLt;
505 FreeTemp(tmp);
506 } else {
507 // We can use a compare for the low word to set CF.
508 OpRegImm(kOpCmp, low_reg, val_lo);
509 if (IsTemp(high_reg)) {
510 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
511 // We have now changed it; ignore the old values.
512 Clobber(rl_src1.reg);
513 } else {
514 // mov temp_reg, high_reg; sbb temp_reg, high_constant
515 RegStorage t_reg = AllocTemp();
516 OpRegCopy(t_reg, high_reg);
517 NewLIR2(kX86Sbb32RI, t_reg.GetReg(), val_hi);
518 FreeTemp(t_reg);
519 }
Mark Mendell412d4f82013-12-18 13:32:36 -0800520 }
521
Mark Mendell752e2052014-05-01 10:19:04 -0400522 OpCondBranch(ccode, taken);
Mark Mendell412d4f82013-12-18 13:32:36 -0800523}
524
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700525void X86Mir2Lir::CalculateMagicAndShift(int64_t divisor, int64_t& magic, int& shift, bool is_long) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800526 // It does not make sense to calculate magic and shift for zero divisor.
527 DCHECK_NE(divisor, 0);
528
529 /* According to H.S.Warren's Hacker's Delight Chapter 10 and
530 * T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
531 * The magic number M and shift S can be calculated in the following way:
532 * Let nc be the most positive value of numerator(n) such that nc = kd - 1,
533 * where divisor(d) >=2.
534 * Let nc be the most negative value of numerator(n) such that nc = kd + 1,
535 * where divisor(d) <= -2.
536 * Thus nc can be calculated like:
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700537 * nc = exp + exp % d - 1, where d >= 2 and exp = 2^31 for int or 2^63 for long
538 * nc = -exp + (exp + 1) % d, where d >= 2 and exp = 2^31 for int or 2^63 for long
Mark Mendell2bf31e62014-01-23 12:13:40 -0800539 *
540 * So the shift p is the smallest p satisfying
541 * 2^p > nc * (d - 2^p % d), where d >= 2
542 * 2^p > nc * (d + 2^p % d), where d <= -2.
543 *
544 * the magic number M is calcuated by
545 * M = (2^p + d - 2^p % d) / d, where d >= 2
546 * M = (2^p - d - 2^p % d) / d, where d <= -2.
547 *
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700548 * Notice that p is always bigger than or equal to 32/64, so we just return 32-p/64-p as
Mark Mendell2bf31e62014-01-23 12:13:40 -0800549 * the shift number S.
550 */
551
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700552 int64_t p = (is_long) ? 63 : 31;
553 const uint64_t exp = (is_long) ? 0x8000000000000000ULL : 0x80000000U;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800554
555 // Initialize the computations.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700556 uint64_t abs_d = (divisor >= 0) ? divisor : -divisor;
557 uint64_t tmp = exp + ((is_long) ? static_cast<uint64_t>(divisor) >> 63 :
558 static_cast<uint32_t>(divisor) >> 31);
559 uint64_t abs_nc = tmp - 1 - tmp % abs_d;
560 uint64_t quotient1 = exp / abs_nc;
561 uint64_t remainder1 = exp % abs_nc;
562 uint64_t quotient2 = exp / abs_d;
563 uint64_t remainder2 = exp % abs_d;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800564
565 /*
566 * To avoid handling both positive and negative divisor, Hacker's Delight
567 * introduces a method to handle these 2 cases together to avoid duplication.
568 */
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700569 uint64_t delta;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800570 do {
571 p++;
572 quotient1 = 2 * quotient1;
573 remainder1 = 2 * remainder1;
574 if (remainder1 >= abs_nc) {
575 quotient1++;
576 remainder1 = remainder1 - abs_nc;
577 }
578 quotient2 = 2 * quotient2;
579 remainder2 = 2 * remainder2;
580 if (remainder2 >= abs_d) {
581 quotient2++;
582 remainder2 = remainder2 - abs_d;
583 }
584 delta = abs_d - remainder2;
585 } while (quotient1 < delta || (quotient1 == delta && remainder1 == 0));
586
587 magic = (divisor > 0) ? (quotient2 + 1) : (-quotient2 - 1);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700588
589 if (!is_long) {
590 magic = static_cast<int>(magic);
591 }
592
593 shift = (is_long) ? p - 64 : p - 32;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800594}
595
buzbee2700f7e2014-03-07 09:46:20 -0800596RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegStorage reg_lo, int lit, bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700597 LOG(FATAL) << "Unexpected use of GenDivRemLit for x86";
598 return rl_dest;
599}
600
Mark Mendell2bf31e62014-01-23 12:13:40 -0800601RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegLocation rl_src,
602 int imm, bool is_div) {
603 // Use a multiply (and fixup) to perform an int div/rem by a constant.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700604 RegLocation rl_result;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800605
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700606 if (imm == 1) {
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700607 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800608 if (is_div) {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700609 // x / 1 == x.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700610 LoadValueDirectFixed(rl_src, rl_result.reg);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700611 } else {
612 // x % 1 == 0.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700613 LoadConstantNoClobber(rl_result.reg, 0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700614 }
615 } else if (imm == -1) { // handle 0x80000000 / -1 special case.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700616 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700617 if (is_div) {
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700618 LoadValueDirectFixed(rl_src, rl_result.reg);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400619
620 // Check if numerator is 0
621 OpRegImm(kOpCmp, rl_result.reg, 0);
622 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
623
624 // handle 0x80000000 / -1
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700625 OpRegImm(kOpCmp, rl_result.reg, 0x80000000);
626 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800627
628 // for x != MIN_INT, x / -1 == -x.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700629 NewLIR1(kX86Neg32R, rl_result.reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800630
Mark Mendell2bf31e62014-01-23 12:13:40 -0800631 // EAX already contains the right value (0x80000000),
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700632 minint_branch->target = NewLIR0(kPseudoTargetLabel);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400633 branch->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800634 } else {
635 // x % -1 == 0.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700636 LoadConstantNoClobber(rl_result.reg, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800637 }
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700638 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
639 // Division using shifting.
640 rl_src = LoadValue(rl_src, kCoreReg);
641 rl_result = EvalLoc(rl_dest, kCoreReg, true);
642 if (IsSameReg(rl_result.reg, rl_src.reg)) {
643 RegStorage rs_temp = AllocTypedTemp(false, kCoreReg);
644 rl_result.reg.SetReg(rs_temp.GetReg());
645 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400646
647 // Check if numerator is 0
648 OpRegImm(kOpCmp, rl_src.reg, 0);
649 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
650 LoadConstantNoClobber(rl_result.reg, 0);
651 LIR* done = NewLIR1(kX86Jmp8, 0);
652 branch->target = NewLIR0(kPseudoTargetLabel);
653
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700654 NewLIR3(kX86Lea32RM, rl_result.reg.GetReg(), rl_src.reg.GetReg(), std::abs(imm) - 1);
655 NewLIR2(kX86Test32RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
656 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
657 int shift_amount = LowestSetBit(imm);
658 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
659 if (imm < 0) {
660 OpReg(kOpNeg, rl_result.reg);
661 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400662 done->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800663 } else {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700664 CHECK(imm <= -2 || imm >= 2);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700665
Mark Mendell2bf31e62014-01-23 12:13:40 -0800666 // Use H.S.Warren's Hacker's Delight Chapter 10 and
667 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700668 int64_t magic;
669 int shift;
670 CalculateMagicAndShift((int64_t)imm, magic, shift, false /* is_long */);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800671
672 /*
673 * For imm >= 2,
674 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
675 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
676 * For imm <= -2,
677 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
678 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
679 * We implement this algorithm in the following way:
680 * 1. multiply magic number m and numerator n, get the higher 32bit result in EDX
681 * 2. if imm > 0 and magic < 0, add numerator to EDX
682 * if imm < 0 and magic > 0, sub numerator from EDX
683 * 3. if S !=0, SAR S bits for EDX
684 * 4. add 1 to EDX if EDX < 0
685 * 5. Thus, EDX is the quotient
686 */
687
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700688 FlushReg(rs_r0);
689 Clobber(rs_r0);
690 LockTemp(rs_r0);
691 FlushReg(rs_r2);
692 Clobber(rs_r2);
693 LockTemp(rs_r2);
694
695 // Assume that the result will be in EDX.
696 rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, rs_r2, INVALID_SREG, INVALID_SREG};
697
Mark Mendell2bf31e62014-01-23 12:13:40 -0800698 // Numerator into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800699 RegStorage numerator_reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800700 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
701 // We will need the value later.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700702 rl_src = LoadValue(rl_src, kCoreReg);
703 numerator_reg = rl_src.reg;
buzbee2700f7e2014-03-07 09:46:20 -0800704 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800705 } else {
706 // Only need this once. Just put it into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800707 LoadValueDirectFixed(rl_src, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800708 }
709
Yixin Shou2ddd1752014-08-26 15:15:13 -0400710 // Check if numerator is 0
711 OpRegImm(kOpCmp, rs_r0, 0);
712 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
713 LoadConstantNoClobber(rs_r2, 0);
714 LIR* done = NewLIR1(kX86Jmp8, 0);
715 branch->target = NewLIR0(kPseudoTargetLabel);
716
Mark Mendell2bf31e62014-01-23 12:13:40 -0800717 // EDX = magic.
buzbee2700f7e2014-03-07 09:46:20 -0800718 LoadConstantNoClobber(rs_r2, magic);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800719
720 // EDX:EAX = magic & dividend.
buzbee091cc402014-03-31 10:14:40 -0700721 NewLIR1(kX86Imul32DaR, rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800722
723 if (imm > 0 && magic < 0) {
724 // Add numerator to EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800725 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700726 NewLIR2(kX86Add32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800727 } else if (imm < 0 && magic > 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800728 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700729 NewLIR2(kX86Sub32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800730 }
731
732 // Do we need the shift?
733 if (shift != 0) {
734 // Shift EDX by 'shift' bits.
buzbee091cc402014-03-31 10:14:40 -0700735 NewLIR2(kX86Sar32RI, rs_r2.GetReg(), shift);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800736 }
737
738 // Add 1 to EDX if EDX < 0.
739
740 // Move EDX to EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800741 OpRegCopy(rs_r0, rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800742
743 // Move sign bit to bit 0, zeroing the rest.
buzbee091cc402014-03-31 10:14:40 -0700744 NewLIR2(kX86Shr32RI, rs_r2.GetReg(), 31);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800745
746 // EDX = EDX + EAX.
buzbee091cc402014-03-31 10:14:40 -0700747 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r0.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800748
749 // Quotient is in EDX.
750 if (!is_div) {
751 // We need to compute the remainder.
752 // Remainder is divisor - (quotient * imm).
buzbee2700f7e2014-03-07 09:46:20 -0800753 DCHECK(numerator_reg.Valid());
754 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800755
756 // EAX = numerator * imm.
buzbee2700f7e2014-03-07 09:46:20 -0800757 OpRegRegImm(kOpMul, rs_r2, rs_r2, imm);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800758
759 // EDX -= EAX.
buzbee091cc402014-03-31 10:14:40 -0700760 NewLIR2(kX86Sub32RR, rs_r0.GetReg(), rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800761
762 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000763 rl_result.reg.SetReg(r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800764 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400765 done->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800766 }
767
768 return rl_result;
769}
770
buzbee2700f7e2014-03-07 09:46:20 -0800771RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegStorage reg_lo, RegStorage reg_hi,
772 bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700773 LOG(FATAL) << "Unexpected use of GenDivRem for x86";
774 return rl_dest;
775}
776
Mark Mendell2bf31e62014-01-23 12:13:40 -0800777RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegLocation rl_src1,
778 RegLocation rl_src2, bool is_div, bool check_zero) {
779 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700780
781 // Prepare for explicit register usage.
782 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800783
784 // Load LHS into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800785 LoadValueDirectFixed(rl_src1, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800786
787 // Load RHS into EBX.
buzbee2700f7e2014-03-07 09:46:20 -0800788 LoadValueDirectFixed(rl_src2, rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800789
790 // Copy LHS sign bit into EDX.
791 NewLIR0(kx86Cdq32Da);
792
793 if (check_zero) {
794 // Handle division by zero case.
Mingyao Yange643a172014-04-08 11:02:52 -0700795 GenDivZeroCheck(rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800796 }
797
Yixin Shou2ddd1752014-08-26 15:15:13 -0400798 // Check if numerator is 0
799 OpRegImm(kOpCmp, rs_r0, 0);
800 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
801
Mark Mendell2bf31e62014-01-23 12:13:40 -0800802 // Have to catch 0x80000000/-1 case, or we will get an exception!
buzbee2700f7e2014-03-07 09:46:20 -0800803 OpRegImm(kOpCmp, rs_r1, -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700804 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800805
806 // RHS is -1.
buzbee2700f7e2014-03-07 09:46:20 -0800807 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700808 LIR* minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800809
Yixin Shou2ddd1752014-08-26 15:15:13 -0400810 branch->target = NewLIR0(kPseudoTargetLabel);
811
Mark Mendell2bf31e62014-01-23 12:13:40 -0800812 // In 0x80000000/-1 case.
813 if (!is_div) {
814 // For DIV, EAX is already right. For REM, we need EDX 0.
buzbee2700f7e2014-03-07 09:46:20 -0800815 LoadConstantNoClobber(rs_r2, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800816 }
817 LIR* done = NewLIR1(kX86Jmp8, 0);
818
819 // Expected case.
820 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
821 minint_branch->target = minus_one_branch->target;
buzbee091cc402014-03-31 10:14:40 -0700822 NewLIR1(kX86Idivmod32DaR, rs_r1.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800823 done->target = NewLIR0(kPseudoTargetLabel);
824
825 // Result is in EAX for div and EDX for rem.
buzbee091cc402014-03-31 10:14:40 -0700826 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 -0800827 if (!is_div) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000828 rl_result.reg.SetReg(r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800829 }
830 return rl_result;
831}
832
Serban Constantinescu23abec92014-07-02 16:13:38 +0100833bool X86Mir2Lir::GenInlinedMinMax(CallInfo* info, bool is_min, bool is_long) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700834 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800835
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700836 if (is_long && !cu_->target64) {
837 /*
838 * We want to implement the following algorithm
839 * mov eax, low part of arg1
840 * mov edx, high part of arg1
841 * mov ebx, low part of arg2
842 * mov ecx, high part of arg2
843 * mov edi, eax
844 * sub edi, ebx
845 * mov edi, edx
846 * sbb edi, ecx
847 * is_min ? "cmovgel eax, ebx" : "cmovll eax, ebx"
848 * is_min ? "cmovgel edx, ecx" : "cmovll edx, ecx"
849 *
850 * The algorithm above needs 5 registers: a pair for the first operand
851 * (which later will be used as result), a pair for the second operand
852 * and a temp register (e.g. 'edi') for intermediate calculations.
853 * Ideally we have 6 GP caller-save registers in 32-bit mode. They are:
854 * 'eax', 'ebx', 'ecx', 'edx', 'esi' and 'edi'. So there should be
855 * always enough registers to operate on. Practically, there is a pair
856 * of registers 'edi' and 'esi' which holds promoted values and
857 * sometimes should be treated as 'callee save'. If one of the operands
858 * is in the promoted registers then we have enough register to
859 * operate on. Otherwise there is lack of resources and we have to
860 * save 'edi' before calculations and restore after.
861 */
862
863 RegLocation rl_src1 = info->args[0];
864 RegLocation rl_src2 = info->args[2];
865 RegLocation rl_dest = InlineTargetWide(info);
866 int res_vreg, src1_vreg, src2_vreg;
867
868 /*
869 * If the result register is the same as the second element, then we
870 * need to be careful. The reason is that the first copy will
871 * inadvertently clobber the second element with the first one thus
872 * yielding the wrong result. Thus we do a swap in that case.
873 */
874 res_vreg = mir_graph_->SRegToVReg(rl_dest.s_reg_low);
875 src2_vreg = mir_graph_->SRegToVReg(rl_src2.s_reg_low);
876 if (res_vreg == src2_vreg) {
877 std::swap(rl_src1, rl_src2);
878 }
879
880 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
881 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
882
883 // Pick the first integer as min/max.
884 OpRegCopyWide(rl_result.reg, rl_src1.reg);
885
886 /*
887 * If the integers are both in the same register, then there is
888 * nothing else to do because they are equal and we have already
889 * moved one into the result.
890 */
891 src1_vreg = mir_graph_->SRegToVReg(rl_src1.s_reg_low);
892 src2_vreg = mir_graph_->SRegToVReg(rl_src2.s_reg_low);
893 if (src1_vreg == src2_vreg) {
894 StoreValueWide(rl_dest, rl_result);
895 return true;
896 }
897
898 // Free registers to make some room for the second operand.
899 // But don't try to free ourselves or promoted registers.
900 if (res_vreg != src1_vreg &&
901 IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
902 FreeTemp(rl_src1.reg);
903 }
904 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
905
906 // Do we have a free register for intermediate calculations?
907 RegStorage tmp = AllocTemp(false);
908 if (tmp == RegStorage::InvalidReg()) {
909 /*
910 * No, will use 'edi'.
911 *
912 * As mentioned above we have 4 temporary and 2 promotable
913 * caller-save registers. Therefore, we assume that a free
914 * register can be allocated only if 'esi' and 'edi' are
915 * already used as operands. If number of promotable registers
916 * increases from 2 to 4 then our assumption fails and operand
917 * data is corrupted.
918 * Let's DCHECK it.
919 */
920 DCHECK(IsTemp(rl_src2.reg.GetLow()) &&
921 IsTemp(rl_src2.reg.GetHigh()) &&
922 IsTemp(rl_result.reg.GetLow()) &&
923 IsTemp(rl_result.reg.GetHigh()));
924 tmp = rs_rDI;
925 NewLIR1(kX86Push32R, tmp.GetReg());
926 }
927
928 // Now we are ready to do calculations.
929 OpRegReg(kOpMov, tmp, rl_result.reg.GetLow());
930 OpRegReg(kOpSub, tmp, rl_src2.reg.GetLow());
931 OpRegReg(kOpMov, tmp, rl_result.reg.GetHigh());
932 OpRegReg(kOpSbc, tmp, rl_src2.reg.GetHigh());
933
934 // Let's put pop 'edi' here to break a bit the dependency chain.
935 if (tmp == rs_rDI) {
936 NewLIR1(kX86Pop32R, tmp.GetReg());
937 }
938
939 // Conditionally move the other integer into the destination register.
940 ConditionCode cc = is_min ? kCondGe : kCondLt;
941 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetLow(), rl_src2.reg.GetLow());
942 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetHigh(), rl_src2.reg.GetHigh());
943 StoreValueWide(rl_dest, rl_result);
944 return true;
Serban Constantinescu23abec92014-07-02 16:13:38 +0100945 }
946
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800947 // Get the two arguments to the invoke and place them in GP registers.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700948 RegLocation rl_src1 = info->args[0];
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700949 RegLocation rl_src2 = (is_long) ? info->args[2] : info->args[1];
950 rl_src1 = (is_long) ? LoadValueWide(rl_src1, kCoreReg) : LoadValue(rl_src1, kCoreReg);
951 rl_src2 = (is_long) ? LoadValueWide(rl_src2, kCoreReg) : LoadValue(rl_src2, kCoreReg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800952
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700953 RegLocation rl_dest = (is_long) ? InlineTargetWide(info) : InlineTarget(info);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700954 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800955
956 /*
957 * If the result register is the same as the second element, then we need to be careful.
958 * The reason is that the first copy will inadvertently clobber the second element with
959 * the first one thus yielding the wrong result. Thus we do a swap in that case.
960 */
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000961 if (rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800962 std::swap(rl_src1, rl_src2);
963 }
964
965 // Pick the first integer as min/max.
buzbee2700f7e2014-03-07 09:46:20 -0800966 OpRegCopy(rl_result.reg, rl_src1.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800967
968 // If the integers are both in the same register, then there is nothing else to do
969 // because they are equal and we have already moved one into the result.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000970 if (rl_src1.reg.GetReg() != rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800971 // It is possible we didn't pick correctly so do the actual comparison now.
buzbee2700f7e2014-03-07 09:46:20 -0800972 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800973
974 // Conditionally move the other integer into the destination register.
975 ConditionCode condition_code = is_min ? kCondGt : kCondLt;
buzbee2700f7e2014-03-07 09:46:20 -0800976 OpCondRegReg(kOpCmov, condition_code, rl_result.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800977 }
978
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700979 if (is_long) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000980 StoreValueWide(rl_dest, rl_result);
981 } else {
Vladimir Markoe508a202013-11-04 15:24:22 +0000982 StoreValue(rl_dest, rl_result);
983 }
984 return true;
985}
986
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700987bool X86Mir2Lir::GenInlinedPeek(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +0700988 RegLocation rl_src_address = info->args[0]; // long address
989 RegLocation rl_address;
990 if (!cu_->target64) {
991 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
992 rl_address = LoadValue(rl_src_address, kCoreReg);
993 } else {
994 rl_address = LoadValueWide(rl_src_address, kCoreReg);
995 }
996 RegLocation rl_dest = size == k64 ? InlineTargetWide(info) : InlineTarget(info);
997 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
998 // Unaligned access is allowed on x86.
999 LoadBaseDisp(rl_address.reg, 0, rl_result.reg, size, kNotVolatile);
1000 if (size == k64) {
1001 StoreValueWide(rl_dest, rl_result);
1002 } else {
1003 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
1004 StoreValue(rl_dest, rl_result);
1005 }
1006 return true;
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001007}
1008
Vladimir Markoe508a202013-11-04 15:24:22 +00001009bool X86Mir2Lir::GenInlinedPoke(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +07001010 RegLocation rl_src_address = info->args[0]; // long address
1011 RegLocation rl_address;
1012 if (!cu_->target64) {
1013 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
1014 rl_address = LoadValue(rl_src_address, kCoreReg);
1015 } else {
1016 rl_address = LoadValueWide(rl_src_address, kCoreReg);
1017 }
1018 RegLocation rl_src_value = info->args[2]; // [size] value
1019 RegLocation rl_value;
1020 if (size == k64) {
1021 // Unaligned access is allowed on x86.
1022 rl_value = LoadValueWide(rl_src_value, kCoreReg);
1023 } else {
1024 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
1025 // In 32-bit mode the only EAX..EDX registers can be used with Mov8MR.
1026 if (!cu_->target64 && size == kSignedByte) {
1027 rl_src_value = UpdateLocTyped(rl_src_value, kCoreReg);
1028 if (rl_src_value.location == kLocPhysReg && !IsByteRegister(rl_src_value.reg)) {
1029 RegStorage temp = AllocateByteRegister();
1030 OpRegCopy(temp, rl_src_value.reg);
1031 rl_value.reg = temp;
1032 } else {
1033 rl_value = LoadValue(rl_src_value, kCoreReg);
1034 }
1035 } else {
1036 rl_value = LoadValue(rl_src_value, kCoreReg);
1037 }
1038 }
1039 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size, kNotVolatile);
1040 return true;
Vladimir Markoe508a202013-11-04 15:24:22 +00001041}
1042
buzbee2700f7e2014-03-07 09:46:20 -08001043void X86Mir2Lir::OpLea(RegStorage r_base, RegStorage reg1, RegStorage reg2, int scale, int offset) {
1044 NewLIR5(kX86Lea32RA, r_base.GetReg(), reg1.GetReg(), reg2.GetReg(), scale, offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001045}
1046
Ian Rogersdd7624d2014-03-14 17:43:00 -07001047void X86Mir2Lir::OpTlsCmp(ThreadOffset<4> offset, int val) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001048 DCHECK_EQ(kX86, cu_->instruction_set);
1049 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
1050}
1051
1052void X86Mir2Lir::OpTlsCmp(ThreadOffset<8> offset, int val) {
1053 DCHECK_EQ(kX86_64, cu_->instruction_set);
Ian Rogers468532e2013-08-05 10:56:33 -07001054 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001055}
1056
buzbee2700f7e2014-03-07 09:46:20 -08001057static bool IsInReg(X86Mir2Lir *pMir2Lir, const RegLocation &rl, RegStorage reg) {
1058 return rl.reg.Valid() && rl.reg.GetReg() == reg.GetReg() && (pMir2Lir->IsLive(reg) || rl.home);
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001059}
1060
Vladimir Marko1c282e22013-11-21 14:49:47 +00001061bool X86Mir2Lir::GenInlinedCas(CallInfo* info, bool is_long, bool is_object) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +07001062 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001063 // Unused - RegLocation rl_src_unsafe = info->args[0];
1064 RegLocation rl_src_obj = info->args[1]; // Object - known non-null
1065 RegLocation rl_src_offset = info->args[2]; // long low
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001066 if (!cu_->target64) {
1067 rl_src_offset = NarrowRegLoc(rl_src_offset); // ignore high half in info->args[3]
1068 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001069 RegLocation rl_src_expected = info->args[4]; // int, long or Object
1070 // If is_long, high half is in info->args[5]
1071 RegLocation rl_src_new_value = info->args[is_long ? 6 : 5]; // int, long or Object
1072 // If is_long, high half is in info->args[7]
1073
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001074 if (is_long && cu_->target64) {
1075 // 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 -07001076 FlushReg(rs_r0q);
1077 Clobber(rs_r0q);
1078 LockTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001079
1080 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
1081 RegLocation rl_new_value = LoadValueWide(rl_src_new_value, kCoreReg);
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001082 RegLocation rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1083 LoadValueDirectWide(rl_src_expected, rs_r0q);
Andreas Gampeccc60262014-07-04 18:02:38 -07001084 NewLIR5(kX86LockCmpxchg64AR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1085 rl_new_value.reg.GetReg());
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001086
1087 // After a store we need to insert barrier in case of potential load. Since the
1088 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
Hans Boehm48f5c472014-06-27 14:50:10 -07001089 GenMemBarrier(kAnyAny);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001090
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001091 FreeTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001092 } else if (is_long) {
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001093 // TODO: avoid unnecessary loads of SI and DI when the values are in registers.
1094 // TODO: CFI support.
Vladimir Marko70b797d2013-12-03 15:25:24 +00001095 FlushAllRegs();
1096 LockCallTemps();
buzbee091cc402014-03-31 10:14:40 -07001097 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
1098 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_rBX, rs_rCX);
buzbee2700f7e2014-03-07 09:46:20 -08001099 LoadValueDirectWideFixed(rl_src_expected, r_tmp1);
1100 LoadValueDirectWideFixed(rl_src_new_value, r_tmp2);
buzbee695d13a2014-04-19 13:32:20 -07001101 // FIXME: needs 64-bit update.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001102 const bool obj_in_di = IsInReg(this, rl_src_obj, rs_rDI);
1103 const bool obj_in_si = IsInReg(this, rl_src_obj, rs_rSI);
1104 DCHECK(!obj_in_si || !obj_in_di);
1105 const bool off_in_di = IsInReg(this, rl_src_offset, rs_rDI);
1106 const bool off_in_si = IsInReg(this, rl_src_offset, rs_rSI);
1107 DCHECK(!off_in_si || !off_in_di);
1108 // If obj/offset is in a reg, use that reg. Otherwise, use the empty reg.
1109 RegStorage rs_obj = obj_in_di ? rs_rDI : obj_in_si ? rs_rSI : !off_in_di ? rs_rDI : rs_rSI;
1110 RegStorage rs_off = off_in_si ? rs_rSI : off_in_di ? rs_rDI : !obj_in_si ? rs_rSI : rs_rDI;
1111 bool push_di = (!obj_in_di && !off_in_di) && (rs_obj == rs_rDI || rs_off == rs_rDI);
1112 bool push_si = (!obj_in_si && !off_in_si) && (rs_obj == rs_rSI || rs_off == rs_rSI);
1113 if (push_di) {
1114 NewLIR1(kX86Push32R, rs_rDI.GetReg());
1115 MarkTemp(rs_rDI);
1116 LockTemp(rs_rDI);
1117 }
1118 if (push_si) {
1119 NewLIR1(kX86Push32R, rs_rSI.GetReg());
1120 MarkTemp(rs_rSI);
1121 LockTemp(rs_rSI);
1122 }
1123 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1124 const size_t push_offset = (push_si ? 4u : 0u) + (push_di ? 4u : 0u);
1125 if (!obj_in_si && !obj_in_di) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07001126 LoadWordDisp(rs_rX86_SP, SRegOffset(rl_src_obj.s_reg_low) + push_offset, rs_obj);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001127 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1128 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1129 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1130 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1131 }
1132 if (!off_in_si && !off_in_di) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07001133 LoadWordDisp(rs_rX86_SP, SRegOffset(rl_src_offset.s_reg_low) + push_offset, rs_off);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001134 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1135 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1136 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1137 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1138 }
1139 NewLIR4(kX86LockCmpxchg64A, rs_obj.GetReg(), rs_off.GetReg(), 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001140
Hans Boehm48f5c472014-06-27 14:50:10 -07001141 // After a store we need to insert barrier to prevent reordering with either
1142 // earlier or later memory accesses. Since
1143 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1144 // and it will be associated with the cmpxchg instruction, preventing both.
1145 GenMemBarrier(kAnyAny);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001146
1147 if (push_si) {
1148 FreeTemp(rs_rSI);
1149 UnmarkTemp(rs_rSI);
1150 NewLIR1(kX86Pop32R, rs_rSI.GetReg());
1151 }
1152 if (push_di) {
1153 FreeTemp(rs_rDI);
1154 UnmarkTemp(rs_rDI);
1155 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
1156 }
Vladimir Marko70b797d2013-12-03 15:25:24 +00001157 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +00001158 } else {
1159 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -08001160 FlushReg(rs_r0);
buzbee091cc402014-03-31 10:14:40 -07001161 Clobber(rs_r0);
buzbee2700f7e2014-03-07 09:46:20 -08001162 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001163
buzbeea0cd2d72014-06-01 09:33:49 -07001164 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
1165 RegLocation rl_new_value = LoadValue(rl_src_new_value);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001166
1167 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
1168 // Mark card for object assuming new value is stored.
buzbee091cc402014-03-31 10:14:40 -07001169 FreeTemp(rs_r0); // Temporarily release EAX for MarkGCCard().
buzbee2700f7e2014-03-07 09:46:20 -08001170 MarkGCCard(rl_new_value.reg, rl_object.reg);
buzbee091cc402014-03-31 10:14:40 -07001171 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001172 }
1173
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001174 RegLocation rl_offset;
1175 if (cu_->target64) {
1176 rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1177 } else {
1178 rl_offset = LoadValue(rl_src_offset, kCoreReg);
1179 }
buzbee2700f7e2014-03-07 09:46:20 -08001180 LoadValueDirect(rl_src_expected, rs_r0);
Andreas Gampeccc60262014-07-04 18:02:38 -07001181 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1182 rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +00001183
Hans Boehm48f5c472014-06-27 14:50:10 -07001184 // After a store we need to insert barrier to prevent reordering with either
1185 // earlier or later memory accesses. Since
1186 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1187 // and it will be associated with the cmpxchg instruction, preventing both.
1188 GenMemBarrier(kAnyAny);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001189
buzbee091cc402014-03-31 10:14:40 -07001190 FreeTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001191 }
1192
1193 // Convert ZF to boolean
1194 RegLocation rl_dest = InlineTarget(info); // boolean place for result
1195 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001196 RegStorage result_reg = rl_result.reg;
1197
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001198 // For 32-bit, SETcc only works with EAX..EDX.
1199 if (!IsByteRegister(result_reg)) {
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001200 result_reg = AllocateByteRegister();
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001201 }
1202 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondZ);
1203 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), result_reg.GetReg());
1204 if (IsTemp(result_reg)) {
1205 FreeTemp(result_reg);
1206 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001207 StoreValue(rl_dest, rl_result);
1208 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001209}
1210
Yixin Shou8c914c02014-07-28 14:17:09 -04001211void X86Mir2Lir::SwapBits(RegStorage result_reg, int shift, int32_t value) {
1212 RegStorage r_temp = AllocTemp();
1213 OpRegCopy(r_temp, result_reg);
1214 OpRegImm(kOpLsr, result_reg, shift);
1215 OpRegImm(kOpAnd, r_temp, value);
1216 OpRegImm(kOpAnd, result_reg, value);
1217 OpRegImm(kOpLsl, r_temp, shift);
1218 OpRegReg(kOpOr, result_reg, r_temp);
1219 FreeTemp(r_temp);
1220}
1221
1222void X86Mir2Lir::SwapBits64(RegStorage result_reg, int shift, int64_t value) {
1223 RegStorage r_temp = AllocTempWide();
1224 OpRegCopy(r_temp, result_reg);
1225 OpRegImm(kOpLsr, result_reg, shift);
1226 RegStorage r_value = AllocTempWide();
1227 LoadConstantWide(r_value, value);
1228 OpRegReg(kOpAnd, r_temp, r_value);
1229 OpRegReg(kOpAnd, result_reg, r_value);
1230 OpRegImm(kOpLsl, r_temp, shift);
1231 OpRegReg(kOpOr, result_reg, r_temp);
1232 FreeTemp(r_temp);
1233 FreeTemp(r_value);
1234}
1235
1236bool X86Mir2Lir::GenInlinedReverseBits(CallInfo* info, OpSize size) {
1237 RegLocation rl_src_i = info->args[0];
1238 RegLocation rl_i = (size == k64) ? LoadValueWide(rl_src_i, kCoreReg)
1239 : LoadValue(rl_src_i, kCoreReg);
1240 RegLocation rl_dest = (size == k64) ? InlineTargetWide(info) : InlineTarget(info);
1241 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1242 if (size == k64) {
1243 if (cu_->instruction_set == kX86_64) {
1244 /* Use one bswap instruction to reverse byte order first and then use 3 rounds of
1245 swapping bits to reverse bits in a long number x. Using bswap to save instructions
1246 compared to generic luni implementation which has 5 rounds of swapping bits.
1247 x = bswap x
1248 x = (x & 0x5555555555555555) << 1 | (x >> 1) & 0x5555555555555555;
1249 x = (x & 0x3333333333333333) << 2 | (x >> 2) & 0x3333333333333333;
1250 x = (x & 0x0F0F0F0F0F0F0F0F) << 4 | (x >> 4) & 0x0F0F0F0F0F0F0F0F;
1251 */
1252 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1253 SwapBits64(rl_result.reg, 1, 0x5555555555555555);
1254 SwapBits64(rl_result.reg, 2, 0x3333333333333333);
1255 SwapBits64(rl_result.reg, 4, 0x0f0f0f0f0f0f0f0f);
1256 StoreValueWide(rl_dest, rl_result);
1257 return true;
1258 }
1259 RegStorage r_i_low = rl_i.reg.GetLow();
1260 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1261 // First REV shall clobber rl_result.reg.GetLowReg(), save the value in a temp for the second
1262 // REV.
1263 r_i_low = AllocTemp();
1264 OpRegCopy(r_i_low, rl_i.reg);
1265 }
1266 OpRegReg(kOpRev, rl_result.reg.GetLow(), rl_i.reg.GetHigh());
1267 OpRegReg(kOpRev, rl_result.reg.GetHigh(), r_i_low);
1268 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1269 FreeTemp(r_i_low);
1270 }
1271 SwapBits(rl_result.reg.GetLow(), 1, 0x55555555);
1272 SwapBits(rl_result.reg.GetLow(), 2, 0x33333333);
1273 SwapBits(rl_result.reg.GetLow(), 4, 0x0f0f0f0f);
1274 SwapBits(rl_result.reg.GetHigh(), 1, 0x55555555);
1275 SwapBits(rl_result.reg.GetHigh(), 2, 0x33333333);
1276 SwapBits(rl_result.reg.GetHigh(), 4, 0x0f0f0f0f);
1277 StoreValueWide(rl_dest, rl_result);
1278 } else {
1279 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1280 SwapBits(rl_result.reg, 1, 0x55555555);
1281 SwapBits(rl_result.reg, 2, 0x33333333);
1282 SwapBits(rl_result.reg, 4, 0x0f0f0f0f);
1283 StoreValue(rl_dest, rl_result);
1284 }
1285 return true;
1286}
1287
buzbee2700f7e2014-03-07 09:46:20 -08001288LIR* X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001289 CHECK(base_of_code_ != nullptr);
1290
1291 // Address the start of the method
1292 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07001293 if (rl_method.wide) {
1294 LoadValueDirectWideFixed(rl_method, reg);
1295 } else {
1296 LoadValueDirectFixed(rl_method, reg);
1297 }
Mark Mendell55d0eac2014-02-06 11:02:52 -08001298 store_method_addr_used_ = true;
1299
1300 // Load the proper value from the literal area.
1301 // We don't know the proper offset for the value, so pick one that will force
1302 // 4 byte offset. We will fix this up in the assembler later to have the right
1303 // value.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001304 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
buzbee2700f7e2014-03-07 09:46:20 -08001305 LIR *res = RawLIR(current_dalvik_offset_, kX86Mov32RM, reg.GetReg(), reg.GetReg(), 256,
1306 0, 0, target);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001307 res->target = target;
1308 res->flags.fixup = kFixupLoad;
Mark Mendell55d0eac2014-02-06 11:02:52 -08001309 store_method_addr_used_ = true;
1310 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001311}
1312
buzbee2700f7e2014-03-07 09:46:20 -08001313LIR* X86Mir2Lir::OpVldm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001314 LOG(FATAL) << "Unexpected use of OpVldm for x86";
1315 return NULL;
1316}
1317
buzbee2700f7e2014-03-07 09:46:20 -08001318LIR* X86Mir2Lir::OpVstm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001319 LOG(FATAL) << "Unexpected use of OpVstm for x86";
1320 return NULL;
1321}
1322
1323void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
1324 RegLocation rl_result, int lit,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001325 int first_bit, int second_bit) {
buzbee2700f7e2014-03-07 09:46:20 -08001326 RegStorage t_reg = AllocTemp();
1327 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
1328 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001329 FreeTemp(t_reg);
1330 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -08001331 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001332 }
1333}
1334
Mingyao Yange643a172014-04-08 11:02:52 -07001335void X86Mir2Lir::GenDivZeroCheckWide(RegStorage reg) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001336 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001337 DCHECK(reg.Is64Bit());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001338
Chao-ying Fua0147762014-06-06 18:38:49 -07001339 NewLIR2(kX86Cmp64RI8, reg.GetReg(), 0);
1340 } else {
1341 DCHECK(reg.IsPair());
1342
1343 // We are not supposed to clobber the incoming storage, so allocate a temporary.
1344 RegStorage t_reg = AllocTemp();
1345 // Doing an OR is a quick way to check if both registers are zero. This will set the flags.
1346 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
1347 // The temp is no longer needed so free it at this time.
1348 FreeTemp(t_reg);
1349 }
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001350
1351 // In case of zero, throw ArithmeticException.
Mingyao Yange643a172014-04-08 11:02:52 -07001352 GenDivZeroCheck(kCondEq);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001353}
1354
Mingyao Yang80365d92014-04-18 12:10:58 -07001355void X86Mir2Lir::GenArrayBoundsCheck(RegStorage index,
1356 RegStorage array_base,
1357 int len_offset) {
1358 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1359 public:
1360 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
1361 RegStorage index, RegStorage array_base, int32_t len_offset)
1362 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
1363 index_(index), array_base_(array_base), len_offset_(len_offset) {
1364 }
1365
1366 void Compile() OVERRIDE {
1367 m2l_->ResetRegPool();
1368 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001369 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001370
1371 RegStorage new_index = index_;
1372 // Move index out of kArg1, either directly to kArg0, or to kArg2.
Serguei Katkov4c7cc152014-06-24 00:50:02 +07001373 // TODO: clean-up to check not a number but with type
Andreas Gampeccc60262014-07-04 18:02:38 -07001374 if (index_ == m2l_->TargetReg(kArg1, kNotWide)) {
1375 if (array_base_ == m2l_->TargetReg(kArg0, kRef)) {
1376 m2l_->OpRegCopy(m2l_->TargetReg(kArg2, kNotWide), index_);
1377 new_index = m2l_->TargetReg(kArg2, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001378 } else {
Andreas Gampeccc60262014-07-04 18:02:38 -07001379 m2l_->OpRegCopy(m2l_->TargetReg(kArg0, kNotWide), index_);
1380 new_index = m2l_->TargetReg(kArg0, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001381 }
1382 }
1383 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001384 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1385 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1386 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, new_index,
1387 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001388 }
1389
1390 private:
1391 const RegStorage index_;
1392 const RegStorage array_base_;
1393 const int32_t len_offset_;
1394 };
1395
1396 OpRegMem(kOpCmp, index, array_base, len_offset);
Dave Allison69dfe512014-07-11 17:11:58 +00001397 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001398 LIR* branch = OpCondBranch(kCondUge, nullptr);
1399 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1400 index, array_base, len_offset));
1401}
1402
1403void X86Mir2Lir::GenArrayBoundsCheck(int32_t index,
1404 RegStorage array_base,
1405 int32_t len_offset) {
1406 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1407 public:
1408 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
1409 int32_t index, RegStorage array_base, int32_t len_offset)
1410 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
1411 index_(index), array_base_(array_base), len_offset_(len_offset) {
1412 }
1413
1414 void Compile() OVERRIDE {
1415 m2l_->ResetRegPool();
1416 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001417 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001418
1419 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001420 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1421 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1422 x86_m2l->LoadConstant(m2l_->TargetReg(kArg0, kNotWide), index_);
1423 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, m2l_->TargetReg(kArg0, kNotWide),
1424 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001425 }
1426
1427 private:
1428 const int32_t index_;
1429 const RegStorage array_base_;
1430 const int32_t len_offset_;
1431 };
1432
1433 NewLIR3(IS_SIMM8(index) ? kX86Cmp32MI8 : kX86Cmp32MI, array_base.GetReg(), len_offset, index);
Dave Allison69dfe512014-07-11 17:11:58 +00001434 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001435 LIR* branch = OpCondBranch(kCondLs, nullptr);
1436 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1437 index, array_base, len_offset));
1438}
1439
Brian Carlstrom7940e442013-07-12 13:46:57 -07001440// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001441LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
buzbee33ae5582014-06-12 14:56:32 -07001442 if (cu_->target64) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001443 OpTlsCmp(Thread::ThreadFlagsOffset<8>(), 0);
1444 } else {
1445 OpTlsCmp(Thread::ThreadFlagsOffset<4>(), 0);
1446 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001447 return OpCondBranch((target == NULL) ? kCondNe : kCondEq, target);
1448}
1449
1450// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -08001451LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001452 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -08001453 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001454}
1455
buzbee11b63d12013-08-27 07:34:17 -07001456bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001457 RegLocation rl_src, RegLocation rl_dest, int lit) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001458 LOG(FATAL) << "Unexpected use of smallLiteralDive in x86";
1459 return false;
1460}
1461
Ian Rogerse2143c02014-03-28 08:47:16 -07001462bool X86Mir2Lir::EasyMultiply(RegLocation rl_src, RegLocation rl_dest, int lit) {
1463 LOG(FATAL) << "Unexpected use of easyMultiply in x86";
1464 return false;
1465}
1466
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001467LIR* X86Mir2Lir::OpIT(ConditionCode cond, const char* guide) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001468 LOG(FATAL) << "Unexpected use of OpIT in x86";
1469 return NULL;
1470}
1471
Dave Allison3da67a52014-04-02 17:03:45 -07001472void X86Mir2Lir::OpEndIT(LIR* it) {
1473 LOG(FATAL) << "Unexpected use of OpEndIT in x86";
1474}
1475
buzbee2700f7e2014-03-07 09:46:20 -08001476void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001477 switch (val) {
1478 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001479 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001480 break;
1481 case 1:
1482 OpRegCopy(dest, src);
1483 break;
1484 default:
1485 OpRegRegImm(kOpMul, dest, src, val);
1486 break;
1487 }
1488}
1489
buzbee2700f7e2014-03-07 09:46:20 -08001490void X86Mir2Lir::GenImulMemImm(RegStorage dest, int sreg, int displacement, int val) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001491 // All memory accesses below reference dalvik regs.
1492 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1493
Mark Mendell4708dcd2014-01-22 09:05:18 -08001494 LIR *m;
1495 switch (val) {
1496 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001497 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001498 break;
1499 case 1:
Andreas Gampe3c12c512014-06-24 18:46:29 +00001500 LoadBaseDisp(rs_rX86_SP, displacement, dest, k32, kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001501 break;
1502 default:
buzbee091cc402014-03-31 10:14:40 -07001503 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(),
1504 rs_rX86_SP.GetReg(), displacement, val);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001505 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
1506 break;
1507 }
1508}
1509
Andreas Gampec76c6142014-08-04 16:30:03 -07001510void X86Mir2Lir::GenArithOpLong(Instruction::Code opcode, RegLocation rl_dest, RegLocation rl_src1,
1511 RegLocation rl_src2) {
1512 if (!cu_->target64) {
1513 // Some x86 32b ops are fallback.
1514 switch (opcode) {
1515 case Instruction::NOT_LONG:
1516 case Instruction::DIV_LONG:
1517 case Instruction::DIV_LONG_2ADDR:
1518 case Instruction::REM_LONG:
1519 case Instruction::REM_LONG_2ADDR:
1520 Mir2Lir::GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
1521 return;
1522
1523 default:
1524 // Everything else we can handle.
1525 break;
1526 }
1527 }
1528
1529 switch (opcode) {
1530 case Instruction::NOT_LONG:
1531 GenNotLong(rl_dest, rl_src2);
1532 return;
1533
1534 case Instruction::ADD_LONG:
1535 case Instruction::ADD_LONG_2ADDR:
1536 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1537 return;
1538
1539 case Instruction::SUB_LONG:
1540 case Instruction::SUB_LONG_2ADDR:
1541 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1542 return;
1543
1544 case Instruction::MUL_LONG:
1545 case Instruction::MUL_LONG_2ADDR:
1546 GenMulLong(opcode, rl_dest, rl_src1, rl_src2);
1547 return;
1548
1549 case Instruction::DIV_LONG:
1550 case Instruction::DIV_LONG_2ADDR:
1551 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ true);
1552 return;
1553
1554 case Instruction::REM_LONG:
1555 case Instruction::REM_LONG_2ADDR:
1556 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ false);
1557 return;
1558
1559 case Instruction::AND_LONG_2ADDR:
1560 case Instruction::AND_LONG:
1561 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1562 return;
1563
1564 case Instruction::OR_LONG:
1565 case Instruction::OR_LONG_2ADDR:
1566 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1567 return;
1568
1569 case Instruction::XOR_LONG:
1570 case Instruction::XOR_LONG_2ADDR:
1571 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1572 return;
1573
1574 case Instruction::NEG_LONG:
1575 GenNegLong(rl_dest, rl_src2);
1576 return;
1577
1578 default:
1579 LOG(FATAL) << "Invalid long arith op";
1580 return;
1581 }
1582}
1583
1584bool X86Mir2Lir::GenMulLongConst(RegLocation rl_dest, RegLocation rl_src1, int64_t val) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001585 // All memory accesses below reference dalvik regs.
1586 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1587
Andreas Gampec76c6142014-08-04 16:30:03 -07001588 if (val == 0) {
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001589 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Andreas Gampec76c6142014-08-04 16:30:03 -07001590 if (cu_->target64) {
1591 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001592 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001593 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
1594 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001595 }
Andreas Gampec76c6142014-08-04 16:30:03 -07001596 StoreValueWide(rl_dest, rl_result);
1597 return true;
1598 } else if (val == 1) {
1599 StoreValueWide(rl_dest, rl_src1);
1600 return true;
1601 } else if (val == 2) {
1602 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1);
1603 return true;
1604 } else if (IsPowerOfTwo(val)) {
1605 int shift_amount = LowestSetBit(val);
1606 if (!BadOverlap(rl_src1, rl_dest)) {
1607 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1608 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest, rl_src1,
1609 shift_amount);
1610 StoreValueWide(rl_dest, rl_result);
1611 return true;
1612 }
1613 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001614
Andreas Gampec76c6142014-08-04 16:30:03 -07001615 // Okay, on 32b just bite the bullet and do it, still better than the general case.
1616 if (!cu_->target64) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001617 int32_t val_lo = Low32Bits(val);
1618 int32_t val_hi = High32Bits(val);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001619 // Prepare for explicit register usage.
1620 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
buzbee30adc732014-05-09 15:10:18 -07001621 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001622 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1623 int displacement = SRegOffset(rl_src1.s_reg_low);
1624
1625 // ECX <- 1H * 2L
1626 // EAX <- 1L * 2H
1627 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001628 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
1629 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001630 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001631 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
1632 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001633 }
1634
1635 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001636 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001637
1638 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001639 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001640
1641 // EDX:EAX <- 2L * 1L (double precision)
1642 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001643 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001644 } else {
buzbee091cc402014-03-31 10:14:40 -07001645 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001646 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1647 true /* is_load */, true /* is_64bit */);
1648 }
1649
1650 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001651 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001652
1653 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001654 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
1655 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001656 StoreValueWide(rl_dest, rl_result);
Andreas Gampec76c6142014-08-04 16:30:03 -07001657 return true;
1658 }
1659 return false;
1660}
1661
1662void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
1663 RegLocation rl_src2) {
1664 if (rl_src1.is_const) {
1665 std::swap(rl_src1, rl_src2);
1666 }
1667
1668 if (rl_src2.is_const) {
1669 if (GenMulLongConst(rl_dest, rl_src1, mir_graph_->ConstantValueWide(rl_src2))) {
1670 return;
1671 }
1672 }
1673
1674 // All memory accesses below reference dalvik regs.
1675 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1676
1677 if (cu_->target64) {
1678 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1679 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1680 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1681 if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1682 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1683 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
1684 } else if (rl_result.reg.GetReg() != rl_src1.reg.GetReg() &&
1685 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1686 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src1.reg.GetReg());
1687 } else if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1688 rl_result.reg.GetReg() != rl_src2.reg.GetReg()) {
1689 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1690 } else {
1691 OpRegCopy(rl_result.reg, rl_src1.reg);
1692 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1693 }
1694 StoreValueWide(rl_dest, rl_result);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001695 return;
1696 }
1697
Andreas Gampec76c6142014-08-04 16:30:03 -07001698 // Not multiplying by a constant. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001699 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1700 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1701 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1702
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001703 // Prepare for explicit register usage.
1704 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
buzbee30adc732014-05-09 15:10:18 -07001705 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
1706 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001707
1708 // At this point, the VRs are in their home locations.
1709 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1710 bool src2_in_reg = rl_src2.location == kLocPhysReg;
1711
1712 // ECX <- 1H
1713 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001714 NewLIR2(kX86Mov32RR, rs_r1.GetReg(), rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001715 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001716 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1, k32,
1717 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001718 }
1719
Mark Mendellde99bba2014-02-14 12:15:02 -08001720 if (is_square) {
1721 // Take advantage of the fact that the values are the same.
1722 // ECX <- ECX * 2L (1H * 2L)
1723 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001724 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001725 } else {
1726 int displacement = SRegOffset(rl_src2.s_reg_low);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001727 LIR* m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001728 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001729 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1730 true /* is_load */, true /* is_64bit */);
1731 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001732
Mark Mendellde99bba2014-02-14 12:15:02 -08001733 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001734 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001735 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001736 // EAX <- 2H
1737 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001738 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001739 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001740 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0, k32,
1741 kNotVolatile);
Mark Mendellde99bba2014-02-14 12:15:02 -08001742 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001743
Mark Mendellde99bba2014-02-14 12:15:02 -08001744 // EAX <- EAX * 1L (2H * 1L)
1745 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001746 NewLIR2(kX86Imul32RR, rs_r0.GetReg(), rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001747 } else {
1748 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001749 LIR *m = NewLIR3(kX86Imul32RM, rs_r0.GetReg(), rs_rX86_SP.GetReg(),
1750 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001751 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1752 true /* is_load */, true /* is_64bit */);
1753 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001754
Mark Mendellde99bba2014-02-14 12:15:02 -08001755 // ECX <- ECX * 2L (1H * 2L)
1756 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001757 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001758 } else {
1759 int displacement = SRegOffset(rl_src2.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001760 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
1761 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001762 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1763 true /* is_load */, true /* is_64bit */);
1764 }
1765
1766 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001767 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001768 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001769
1770 // EAX <- 2L
1771 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001772 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001773 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001774 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0, k32,
1775 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001776 }
1777
1778 // EDX:EAX <- 2L * 1L (double precision)
1779 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001780 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001781 } else {
1782 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001783 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001784 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1785 true /* is_load */, true /* is_64bit */);
1786 }
1787
1788 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001789 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001790
1791 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001792 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
buzbee2700f7e2014-03-07 09:46:20 -08001793 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001794 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001795}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001796
1797void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1798 Instruction::Code op) {
1799 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1800 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1801 if (rl_src.location == kLocPhysReg) {
1802 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001803 // But we must ensure that rl_src is in pair
Elena Sayapinadd644502014-07-01 18:39:52 +07001804 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001805 NewLIR2(x86op, rl_dest.reg.GetReg(), rl_src.reg.GetReg());
1806 } else {
1807 rl_src = LoadValueWide(rl_src, kCoreReg);
1808 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
1809 // The registers are the same, so we would clobber it before the use.
1810 RegStorage temp_reg = AllocTemp();
1811 OpRegCopy(temp_reg, rl_dest.reg);
1812 rl_src.reg.SetHighReg(temp_reg.GetReg());
1813 }
1814 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001815
Chao-ying Fua0147762014-06-06 18:38:49 -07001816 x86op = GetOpcode(op, rl_dest, rl_src, true);
1817 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
1818 FreeTemp(rl_src.reg); // ???
1819 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001820 return;
1821 }
1822
1823 // RHS is in memory.
1824 DCHECK((rl_src.location == kLocDalvikFrame) ||
1825 (rl_src.location == kLocCompilerTemp));
Chao-ying Fua77ee512014-07-01 17:43:41 -07001826 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001827 int displacement = SRegOffset(rl_src.s_reg_low);
1828
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001829 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Andreas Gampeccc60262014-07-04 18:02:38 -07001830 LIR *lir = NewLIR3(x86op, cu_->target64 ? rl_dest.reg.GetReg() : rl_dest.reg.GetLowReg(),
1831 r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001832 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1833 true /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001834 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001835 x86op = GetOpcode(op, rl_dest, rl_src, true);
1836 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001837 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1838 true /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001839 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001840}
1841
Mark Mendelle02d48f2014-01-15 11:19:23 -08001842void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
buzbee30adc732014-05-09 15:10:18 -07001843 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001844 if (rl_dest.location == kLocPhysReg) {
1845 // Ensure we are in a register pair
1846 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1847
buzbee30adc732014-05-09 15:10:18 -07001848 rl_src = UpdateLocWideTyped(rl_src, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001849 GenLongRegOrMemOp(rl_result, rl_src, op);
1850 StoreFinalValueWide(rl_dest, rl_result);
1851 return;
1852 }
1853
1854 // It wasn't in registers, so it better be in memory.
1855 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1856 (rl_dest.location == kLocCompilerTemp));
1857 rl_src = LoadValueWide(rl_src, kCoreReg);
1858
1859 // Operate directly into memory.
1860 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
Chao-ying Fua77ee512014-07-01 17:43:41 -07001861 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001862 int displacement = SRegOffset(rl_dest.s_reg_low);
1863
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001864 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07001865 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET,
Elena Sayapinadd644502014-07-01 18:39:52 +07001866 cu_->target64 ? rl_src.reg.GetReg() : rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001867 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001868 true /* is_load */, true /* is64bit */);
1869 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001870 false /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001871 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001872 x86op = GetOpcode(op, rl_dest, rl_src, true);
1873 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001874 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1875 true /* is_load */, true /* is64bit */);
1876 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1877 false /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001878 }
buzbee2700f7e2014-03-07 09:46:20 -08001879 FreeTemp(rl_src.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001880}
1881
Mark Mendelle02d48f2014-01-15 11:19:23 -08001882void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
1883 RegLocation rl_src2, Instruction::Code op,
1884 bool is_commutative) {
1885 // Is this really a 2 operand operation?
1886 switch (op) {
1887 case Instruction::ADD_LONG_2ADDR:
1888 case Instruction::SUB_LONG_2ADDR:
1889 case Instruction::AND_LONG_2ADDR:
1890 case Instruction::OR_LONG_2ADDR:
1891 case Instruction::XOR_LONG_2ADDR:
Mark Mendelle87f9b52014-04-30 14:13:18 -04001892 if (GenerateTwoOperandInstructions()) {
1893 GenLongArith(rl_dest, rl_src2, op);
1894 return;
1895 }
1896 break;
1897
Mark Mendelle02d48f2014-01-15 11:19:23 -08001898 default:
1899 break;
1900 }
1901
1902 if (rl_dest.location == kLocPhysReg) {
1903 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
1904
1905 // We are about to clobber the LHS, so it needs to be a temp.
1906 rl_result = ForceTempWide(rl_result);
1907
1908 // Perform the operation using the RHS.
buzbee30adc732014-05-09 15:10:18 -07001909 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001910 GenLongRegOrMemOp(rl_result, rl_src2, op);
1911
1912 // And now record that the result is in the temp.
1913 StoreFinalValueWide(rl_dest, rl_result);
1914 return;
1915 }
1916
1917 // It wasn't in registers, so it better be in memory.
1918 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1919 (rl_dest.location == kLocCompilerTemp));
buzbee30adc732014-05-09 15:10:18 -07001920 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
1921 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001922
1923 // Get one of the source operands into temporary register.
1924 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +07001925 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001926 if (IsTemp(rl_src1.reg)) {
1927 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1928 } else if (is_commutative) {
1929 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1930 // We need at least one of them to be a temporary.
1931 if (!IsTemp(rl_src2.reg)) {
1932 rl_src1 = ForceTempWide(rl_src1);
1933 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1934 } else {
1935 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1936 StoreFinalValueWide(rl_dest, rl_src2);
1937 return;
1938 }
1939 } else {
1940 // Need LHS to be the temp.
Mark Mendelle02d48f2014-01-15 11:19:23 -08001941 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07001942 GenLongRegOrMemOp(rl_src1, rl_src2, op);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001943 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001944 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07001945 if (IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
1946 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1947 } else if (is_commutative) {
1948 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1949 // We need at least one of them to be a temporary.
1950 if (!(IsTemp(rl_src2.reg.GetLow()) && IsTemp(rl_src2.reg.GetHigh()))) {
1951 rl_src1 = ForceTempWide(rl_src1);
1952 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1953 } else {
1954 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1955 StoreFinalValueWide(rl_dest, rl_src2);
1956 return;
1957 }
1958 } else {
1959 // Need LHS to be the temp.
1960 rl_src1 = ForceTempWide(rl_src1);
1961 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1962 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001963 }
1964
1965 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001966}
1967
Serban Constantinescued65c5e2014-05-22 15:10:18 +01001968void X86Mir2Lir::GenNotLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001969 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001970 rl_src = LoadValueWide(rl_src, kCoreReg);
1971 RegLocation rl_result;
1972 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1973 OpRegCopy(rl_result.reg, rl_src.reg);
1974 OpReg(kOpNot, rl_result.reg);
1975 StoreValueWide(rl_dest, rl_result);
1976 } else {
1977 LOG(FATAL) << "Unexpected use GenNotLong()";
1978 }
Serban Constantinescued65c5e2014-05-22 15:10:18 +01001979}
1980
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07001981void X86Mir2Lir::GenDivRemLongLit(RegLocation rl_dest, RegLocation rl_src,
1982 int64_t imm, bool is_div) {
1983 if (imm == 0) {
1984 GenDivZeroException();
1985 } else if (imm == 1) {
1986 if (is_div) {
1987 // x / 1 == x.
1988 StoreValueWide(rl_dest, rl_src);
1989 } else {
1990 // x % 1 == 0.
1991 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1992 LoadConstantWide(rl_result.reg, 0);
1993 StoreValueWide(rl_dest, rl_result);
1994 }
1995 } else if (imm == -1) { // handle 0x8000000000000000 / -1 special case.
1996 if (is_div) {
1997 rl_src = LoadValueWide(rl_src, kCoreReg);
1998 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1999 RegStorage rs_temp = AllocTempWide();
2000
2001 OpRegCopy(rl_result.reg, rl_src.reg);
2002 LoadConstantWide(rs_temp, 0x8000000000000000);
2003
2004 // If x == MIN_LONG, return MIN_LONG.
2005 OpRegReg(kOpCmp, rl_src.reg, rs_temp);
2006 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
2007
2008 // For x != MIN_LONG, x / -1 == -x.
2009 OpReg(kOpNeg, rl_result.reg);
2010
2011 minint_branch->target = NewLIR0(kPseudoTargetLabel);
2012 FreeTemp(rs_temp);
2013 StoreValueWide(rl_dest, rl_result);
2014 } else {
2015 // x % -1 == 0.
2016 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2017 LoadConstantWide(rl_result.reg, 0);
2018 StoreValueWide(rl_dest, rl_result);
2019 }
2020 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
2021 // Division using shifting.
2022 rl_src = LoadValueWide(rl_src, kCoreReg);
2023 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2024 if (IsSameReg(rl_result.reg, rl_src.reg)) {
2025 RegStorage rs_temp = AllocTypedTempWide(false, kCoreReg);
2026 rl_result.reg.SetReg(rs_temp.GetReg());
2027 }
2028 LoadConstantWide(rl_result.reg, std::abs(imm) - 1);
2029 OpRegReg(kOpAdd, rl_result.reg, rl_src.reg);
2030 NewLIR2(kX86Test64RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
2031 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
2032 int shift_amount = LowestSetBit(imm);
2033 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
2034 if (imm < 0) {
2035 OpReg(kOpNeg, rl_result.reg);
2036 }
2037 StoreValueWide(rl_dest, rl_result);
2038 } else {
2039 CHECK(imm <= -2 || imm >= 2);
2040
2041 FlushReg(rs_r0q);
2042 Clobber(rs_r0q);
2043 LockTemp(rs_r0q);
2044 FlushReg(rs_r2q);
2045 Clobber(rs_r2q);
2046 LockTemp(rs_r2q);
2047
2048 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, rs_r2q, INVALID_SREG, INVALID_SREG};
2049
2050 // Use H.S.Warren's Hacker's Delight Chapter 10 and
2051 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
2052 int64_t magic;
2053 int shift;
2054 CalculateMagicAndShift(imm, magic, shift, true /* is_long */);
2055
2056 /*
2057 * For imm >= 2,
2058 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
2059 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
2060 * For imm <= -2,
2061 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
2062 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
2063 * We implement this algorithm in the following way:
2064 * 1. multiply magic number m and numerator n, get the higher 64bit result in RDX
2065 * 2. if imm > 0 and magic < 0, add numerator to RDX
2066 * if imm < 0 and magic > 0, sub numerator from RDX
2067 * 3. if S !=0, SAR S bits for RDX
2068 * 4. add 1 to RDX if RDX < 0
2069 * 5. Thus, RDX is the quotient
2070 */
2071
2072 // Numerator into RAX.
2073 RegStorage numerator_reg;
2074 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
2075 // We will need the value later.
2076 rl_src = LoadValueWide(rl_src, kCoreReg);
2077 numerator_reg = rl_src.reg;
2078 OpRegCopyWide(rs_r0q, numerator_reg);
2079 } else {
2080 // Only need this once. Just put it into RAX.
2081 LoadValueDirectWideFixed(rl_src, rs_r0q);
2082 }
2083
2084 // RDX = magic.
2085 LoadConstantWide(rs_r2q, magic);
2086
2087 // RDX:RAX = magic & dividend.
2088 NewLIR1(kX86Imul64DaR, rs_r2q.GetReg());
2089
2090 if (imm > 0 && magic < 0) {
2091 // Add numerator to RDX.
2092 DCHECK(numerator_reg.Valid());
2093 OpRegReg(kOpAdd, rs_r2q, numerator_reg);
2094 } else if (imm < 0 && magic > 0) {
2095 DCHECK(numerator_reg.Valid());
2096 OpRegReg(kOpSub, rs_r2q, numerator_reg);
2097 }
2098
2099 // Do we need the shift?
2100 if (shift != 0) {
2101 // Shift RDX by 'shift' bits.
2102 OpRegImm(kOpAsr, rs_r2q, shift);
2103 }
2104
2105 // Move RDX to RAX.
2106 OpRegCopyWide(rs_r0q, rs_r2q);
2107
2108 // Move sign bit to bit 0, zeroing the rest.
2109 OpRegImm(kOpLsr, rs_r2q, 63);
2110
2111 // RDX = RDX + RAX.
2112 OpRegReg(kOpAdd, rs_r2q, rs_r0q);
2113
2114 // Quotient is in RDX.
2115 if (!is_div) {
2116 // We need to compute the remainder.
2117 // Remainder is divisor - (quotient * imm).
2118 DCHECK(numerator_reg.Valid());
2119 OpRegCopyWide(rs_r0q, numerator_reg);
2120
2121 // Imul doesn't support 64-bit imms.
2122 if (imm > std::numeric_limits<int32_t>::max() ||
2123 imm < std::numeric_limits<int32_t>::min()) {
2124 RegStorage rs_temp = AllocTempWide();
2125 LoadConstantWide(rs_temp, imm);
2126
2127 // RAX = numerator * imm.
2128 NewLIR2(kX86Imul64RR, rs_r2q.GetReg(), rs_temp.GetReg());
2129
2130 FreeTemp(rs_temp);
2131 } else {
2132 // RAX = numerator * imm.
2133 int short_imm = static_cast<int>(imm);
2134 NewLIR3(kX86Imul64RRI, rs_r2q.GetReg(), rs_r2q.GetReg(), short_imm);
2135 }
2136
2137 // RDX -= RAX.
2138 OpRegReg(kOpSub, rs_r0q, rs_r2q);
2139
2140 // Store result.
2141 OpRegCopyWide(rl_result.reg, rs_r0q);
2142 } else {
2143 // Store result.
2144 OpRegCopyWide(rl_result.reg, rs_r2q);
2145 }
2146 StoreValueWide(rl_dest, rl_result);
2147 FreeTemp(rs_r0q);
2148 FreeTemp(rs_r2q);
2149 }
2150}
2151
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002152void X86Mir2Lir::GenDivRemLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002153 RegLocation rl_src2, bool is_div) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002154 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002155 LOG(FATAL) << "Unexpected use GenDivRemLong()";
2156 return;
2157 }
2158
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002159 if (rl_src2.is_const) {
2160 DCHECK(rl_src2.wide);
2161 int64_t imm = mir_graph_->ConstantValueWide(rl_src2);
2162 GenDivRemLongLit(rl_dest, rl_src1, imm, is_div);
2163 return;
2164 }
2165
Chao-ying Fua0147762014-06-06 18:38:49 -07002166 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002167 // Prepare for explicit register usage.
2168 ExplicitTempRegisterLock(this, 4, &rs_r0q, &rs_r1q, &rs_r2q, &rs_r6q);
Chao-ying Fua0147762014-06-06 18:38:49 -07002169
2170 // Load LHS into RAX.
2171 LoadValueDirectWideFixed(rl_src1, rs_r0q);
2172
2173 // Load RHS into RCX.
2174 LoadValueDirectWideFixed(rl_src2, rs_r1q);
2175
2176 // Copy LHS sign bit into RDX.
2177 NewLIR0(kx86Cqo64Da);
2178
2179 // Handle division by zero case.
2180 GenDivZeroCheckWide(rs_r1q);
2181
2182 // Have to catch 0x8000000000000000/-1 case, or we will get an exception!
2183 NewLIR2(kX86Cmp64RI8, rs_r1q.GetReg(), -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002184 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002185
2186 // RHS is -1.
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002187 LoadConstantWide(rs_r6q, 0x8000000000000000);
2188 NewLIR2(kX86Cmp64RR, rs_r0q.GetReg(), rs_r6q.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002189 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002190
2191 // In 0x8000000000000000/-1 case.
2192 if (!is_div) {
2193 // For DIV, RAX is already right. For REM, we need RDX 0.
2194 NewLIR2(kX86Xor64RR, rs_r2q.GetReg(), rs_r2q.GetReg());
2195 }
2196 LIR* done = NewLIR1(kX86Jmp8, 0);
2197
2198 // Expected case.
2199 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
2200 minint_branch->target = minus_one_branch->target;
2201 NewLIR1(kX86Idivmod64DaR, rs_r1q.GetReg());
2202 done->target = NewLIR0(kPseudoTargetLabel);
2203
2204 // Result is in RAX for div and RDX for rem.
2205 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, rs_r0q, INVALID_SREG, INVALID_SREG};
2206 if (!is_div) {
2207 rl_result.reg.SetReg(r2q);
2208 }
2209
2210 StoreValueWide(rl_dest, rl_result);
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002211}
2212
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002213void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002214 rl_src = LoadValueWide(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002215 RegLocation rl_result;
Elena Sayapinadd644502014-07-01 18:39:52 +07002216 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002217 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2218 OpRegReg(kOpNeg, rl_result.reg, rl_src.reg);
2219 } else {
2220 rl_result = ForceTempWide(rl_src);
2221 if (((rl_dest.location == kLocPhysReg) && (rl_src.location == kLocPhysReg)) &&
2222 ((rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()))) {
2223 // The registers are the same, so we would clobber it before the use.
2224 RegStorage temp_reg = AllocTemp();
2225 OpRegCopy(temp_reg, rl_result.reg);
2226 rl_result.reg.SetHighReg(temp_reg.GetReg());
2227 }
2228 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
2229 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
2230 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Mark Mendelle02d48f2014-01-15 11:19:23 -08002231 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002232 StoreValueWide(rl_dest, rl_result);
2233}
2234
buzbee091cc402014-03-31 10:14:40 -07002235void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<4> thread_offset) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07002236 DCHECK_EQ(kX86, cu_->instruction_set);
2237 X86OpCode opcode = kX86Bkpt;
2238 switch (op) {
2239 case kOpCmp: opcode = kX86Cmp32RT; break;
2240 case kOpMov: opcode = kX86Mov32RT; break;
2241 default:
2242 LOG(FATAL) << "Bad opcode: " << op;
2243 break;
2244 }
2245 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
2246}
2247
2248void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<8> thread_offset) {
2249 DCHECK_EQ(kX86_64, cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002250 X86OpCode opcode = kX86Bkpt;
Elena Sayapinadd644502014-07-01 18:39:52 +07002251 if (cu_->target64 && r_dest.Is64BitSolo()) {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +07002252 switch (op) {
2253 case kOpCmp: opcode = kX86Cmp64RT; break;
2254 case kOpMov: opcode = kX86Mov64RT; break;
2255 default:
2256 LOG(FATAL) << "Bad opcode(OpRegThreadMem 64): " << op;
2257 break;
2258 }
2259 } else {
2260 switch (op) {
2261 case kOpCmp: opcode = kX86Cmp32RT; break;
2262 case kOpMov: opcode = kX86Mov32RT; break;
2263 default:
2264 LOG(FATAL) << "Bad opcode: " << op;
2265 break;
2266 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002267 }
buzbee091cc402014-03-31 10:14:40 -07002268 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07002269}
2270
2271/*
2272 * Generate array load
2273 */
2274void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002275 RegLocation rl_index, RegLocation rl_dest, int scale) {
buzbee091cc402014-03-31 10:14:40 -07002276 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002277 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07002278 RegLocation rl_result;
buzbeea0cd2d72014-06-01 09:33:49 -07002279 rl_array = LoadValue(rl_array, kRefReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002280
Mark Mendell343adb52013-12-18 06:02:17 -08002281 int data_offset;
buzbee695d13a2014-04-19 13:32:20 -07002282 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002283 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2284 } else {
2285 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2286 }
2287
Mark Mendell343adb52013-12-18 06:02:17 -08002288 bool constant_index = rl_index.is_const;
2289 int32_t constant_index_value = 0;
2290 if (!constant_index) {
2291 rl_index = LoadValue(rl_index, kCoreReg);
2292 } else {
2293 constant_index_value = mir_graph_->ConstantValue(rl_index);
2294 // If index is constant, just fold it into the data offset
2295 data_offset += constant_index_value << scale;
2296 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002297 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002298 }
2299
Brian Carlstrom7940e442013-07-12 13:46:57 -07002300 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002301 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002302
2303 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002304 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002305 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002306 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002307 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002308 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002309 }
Mark Mendell343adb52013-12-18 06:02:17 -08002310 rl_result = EvalLoc(rl_dest, reg_class, true);
Vladimir Marko3bf7c602014-05-07 14:55:43 +01002311 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg, size);
buzbee695d13a2014-04-19 13:32:20 -07002312 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002313 StoreValueWide(rl_dest, rl_result);
2314 } else {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002315 StoreValue(rl_dest, rl_result);
2316 }
2317}
2318
2319/*
2320 * Generate array store
2321 *
2322 */
2323void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002324 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
buzbee091cc402014-03-31 10:14:40 -07002325 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002326 int len_offset = mirror::Array::LengthOffset().Int32Value();
2327 int data_offset;
2328
buzbee695d13a2014-04-19 13:32:20 -07002329 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002330 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2331 } else {
2332 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2333 }
2334
buzbeea0cd2d72014-06-01 09:33:49 -07002335 rl_array = LoadValue(rl_array, kRefReg);
Mark Mendell343adb52013-12-18 06:02:17 -08002336 bool constant_index = rl_index.is_const;
2337 int32_t constant_index_value = 0;
2338 if (!constant_index) {
2339 rl_index = LoadValue(rl_index, kCoreReg);
2340 } else {
2341 // If index is constant, just fold it into the data offset
2342 constant_index_value = mir_graph_->ConstantValue(rl_index);
2343 data_offset += constant_index_value << scale;
2344 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002345 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002346 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002347
2348 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002349 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002350
2351 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002352 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002353 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002354 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002355 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002356 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002357 }
buzbee695d13a2014-04-19 13:32:20 -07002358 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002359 rl_src = LoadValueWide(rl_src, reg_class);
2360 } else {
2361 rl_src = LoadValue(rl_src, reg_class);
2362 }
2363 // If the src reg can't be byte accessed, move it to a temp first.
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002364 if ((size == kSignedByte || size == kUnsignedByte) && !IsByteRegister(rl_src.reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002365 RegStorage temp = AllocTemp();
2366 OpRegCopy(temp, rl_src.reg);
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002367 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002368 } else {
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002369 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002370 }
Ian Rogersa9a82542013-10-04 11:17:26 -07002371 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07002372 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08002373 if (!constant_index) {
buzbee091cc402014-03-31 10:14:40 -07002374 FreeTemp(rl_index.reg);
Mark Mendell343adb52013-12-18 06:02:17 -08002375 }
buzbee2700f7e2014-03-07 09:46:20 -08002376 MarkGCCard(rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002377 }
2378}
2379
Mark Mendell4708dcd2014-01-22 09:05:18 -08002380RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
2381 RegLocation rl_src, int shift_amount) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002382 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Elena Sayapinadd644502014-07-01 18:39:52 +07002383 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002384 OpKind op = static_cast<OpKind>(0); /* Make gcc happy */
2385 switch (opcode) {
2386 case Instruction::SHL_LONG:
2387 case Instruction::SHL_LONG_2ADDR:
2388 op = kOpLsl;
2389 break;
2390 case Instruction::SHR_LONG:
2391 case Instruction::SHR_LONG_2ADDR:
2392 op = kOpAsr;
2393 break;
2394 case Instruction::USHR_LONG:
2395 case Instruction::USHR_LONG_2ADDR:
2396 op = kOpLsr;
2397 break;
2398 default:
2399 LOG(FATAL) << "Unexpected case";
2400 }
2401 OpRegRegImm(op, rl_result.reg, rl_src.reg, shift_amount);
2402 } else {
2403 switch (opcode) {
2404 case Instruction::SHL_LONG:
2405 case Instruction::SHL_LONG_2ADDR:
2406 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
2407 if (shift_amount == 32) {
2408 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2409 LoadConstant(rl_result.reg.GetLow(), 0);
2410 } else if (shift_amount > 31) {
2411 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2412 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
2413 LoadConstant(rl_result.reg.GetLow(), 0);
2414 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002415 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002416 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2417 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(),
2418 shift_amount);
2419 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
2420 }
2421 break;
2422 case Instruction::SHR_LONG:
2423 case Instruction::SHR_LONG_2ADDR:
2424 if (shift_amount == 32) {
2425 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2426 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2427 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2428 } else if (shift_amount > 31) {
2429 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2430 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2431 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2432 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2433 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002434 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002435 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2436 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2437 shift_amount);
2438 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
2439 }
2440 break;
2441 case Instruction::USHR_LONG:
2442 case Instruction::USHR_LONG_2ADDR:
2443 if (shift_amount == 32) {
2444 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2445 LoadConstant(rl_result.reg.GetHigh(), 0);
2446 } else if (shift_amount > 31) {
2447 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2448 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2449 LoadConstant(rl_result.reg.GetHigh(), 0);
2450 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002451 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002452 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2453 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2454 shift_amount);
2455 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
2456 }
2457 break;
2458 default:
2459 LOG(FATAL) << "Unexpected case";
2460 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08002461 }
2462 return rl_result;
2463}
2464
Brian Carlstrom7940e442013-07-12 13:46:57 -07002465void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Mark Mendell4708dcd2014-01-22 09:05:18 -08002466 RegLocation rl_src, RegLocation rl_shift) {
2467 // Per spec, we only care about low 6 bits of shift amount.
2468 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
2469 if (shift_amount == 0) {
2470 rl_src = LoadValueWide(rl_src, kCoreReg);
2471 StoreValueWide(rl_dest, rl_src);
2472 return;
2473 } else if (shift_amount == 1 &&
2474 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
2475 // Need to handle this here to avoid calling StoreValueWide twice.
Andreas Gampec76c6142014-08-04 16:30:03 -07002476 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src);
Mark Mendell4708dcd2014-01-22 09:05:18 -08002477 return;
2478 }
2479 if (BadOverlap(rl_src, rl_dest)) {
2480 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
2481 return;
2482 }
2483 rl_src = LoadValueWide(rl_src, kCoreReg);
2484 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount);
2485 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002486}
2487
2488void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002489 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002490 bool isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002491 switch (opcode) {
2492 case Instruction::ADD_LONG:
2493 case Instruction::AND_LONG:
2494 case Instruction::OR_LONG:
2495 case Instruction::XOR_LONG:
2496 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002497 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002498 } else {
2499 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002500 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002501 }
2502 break;
2503 case Instruction::SUB_LONG:
2504 case Instruction::SUB_LONG_2ADDR:
2505 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002506 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002507 } else {
Andreas Gampec76c6142014-08-04 16:30:03 -07002508 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002509 isConstSuccess = true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002510 }
2511 break;
2512 case Instruction::ADD_LONG_2ADDR:
2513 case Instruction::OR_LONG_2ADDR:
2514 case Instruction::XOR_LONG_2ADDR:
2515 case Instruction::AND_LONG_2ADDR:
2516 if (rl_src2.is_const) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002517 if (GenerateTwoOperandInstructions()) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002518 isConstSuccess = GenLongImm(rl_dest, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002519 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07002520 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002521 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002522 } else {
2523 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002524 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002525 }
2526 break;
2527 default:
Chao-ying Fua0147762014-06-06 18:38:49 -07002528 isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002529 break;
2530 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002531
2532 if (!isConstSuccess) {
2533 // Default - bail to non-const handler.
2534 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
2535 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002536}
2537
2538bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
2539 switch (op) {
2540 case Instruction::AND_LONG_2ADDR:
2541 case Instruction::AND_LONG:
2542 return value == -1;
2543 case Instruction::OR_LONG:
2544 case Instruction::OR_LONG_2ADDR:
2545 case Instruction::XOR_LONG:
2546 case Instruction::XOR_LONG_2ADDR:
2547 return value == 0;
2548 default:
2549 return false;
2550 }
2551}
2552
2553X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
2554 bool is_high_op) {
2555 bool rhs_in_mem = rhs.location != kLocPhysReg;
2556 bool dest_in_mem = dest.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002557 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002558 DCHECK(!rhs_in_mem || !dest_in_mem);
2559 switch (op) {
2560 case Instruction::ADD_LONG:
2561 case Instruction::ADD_LONG_2ADDR:
2562 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002563 return is64Bit ? kX86Add64MR : is_high_op ? kX86Adc32MR : kX86Add32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002564 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002565 return is64Bit ? kX86Add64RM : is_high_op ? kX86Adc32RM : kX86Add32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002566 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002567 return is64Bit ? kX86Add64RR : is_high_op ? kX86Adc32RR : kX86Add32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002568 case Instruction::SUB_LONG:
2569 case Instruction::SUB_LONG_2ADDR:
2570 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002571 return is64Bit ? kX86Sub64MR : is_high_op ? kX86Sbb32MR : kX86Sub32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002572 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002573 return is64Bit ? kX86Sub64RM : is_high_op ? kX86Sbb32RM : kX86Sub32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002574 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002575 return is64Bit ? kX86Sub64RR : is_high_op ? kX86Sbb32RR : kX86Sub32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002576 case Instruction::AND_LONG_2ADDR:
2577 case Instruction::AND_LONG:
2578 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002579 return is64Bit ? kX86And64MR : kX86And32MR;
2580 }
2581 if (is64Bit) {
2582 return rhs_in_mem ? kX86And64RM : kX86And64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002583 }
2584 return rhs_in_mem ? kX86And32RM : kX86And32RR;
2585 case Instruction::OR_LONG:
2586 case Instruction::OR_LONG_2ADDR:
2587 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002588 return is64Bit ? kX86Or64MR : kX86Or32MR;
2589 }
2590 if (is64Bit) {
2591 return rhs_in_mem ? kX86Or64RM : kX86Or64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002592 }
2593 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
2594 case Instruction::XOR_LONG:
2595 case Instruction::XOR_LONG_2ADDR:
2596 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002597 return is64Bit ? kX86Xor64MR : kX86Xor32MR;
2598 }
2599 if (is64Bit) {
2600 return rhs_in_mem ? kX86Xor64RM : kX86Xor64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002601 }
2602 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
2603 default:
2604 LOG(FATAL) << "Unexpected opcode: " << op;
2605 return kX86Add32RR;
2606 }
2607}
2608
2609X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
2610 int32_t value) {
2611 bool in_mem = loc.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002612 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002613 bool byte_imm = IS_SIMM8(value);
buzbee091cc402014-03-31 10:14:40 -07002614 DCHECK(in_mem || !loc.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002615 switch (op) {
2616 case Instruction::ADD_LONG:
2617 case Instruction::ADD_LONG_2ADDR:
2618 if (byte_imm) {
2619 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002620 return is64Bit ? kX86Add64MI8 : is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002621 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002622 return is64Bit ? kX86Add64RI8 : is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002623 }
2624 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002625 return is64Bit ? kX86Add64MI : is_high_op ? kX86Adc32MI : kX86Add32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002626 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002627 return is64Bit ? kX86Add64RI : is_high_op ? kX86Adc32RI : kX86Add32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002628 case Instruction::SUB_LONG:
2629 case Instruction::SUB_LONG_2ADDR:
2630 if (byte_imm) {
2631 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002632 return is64Bit ? kX86Sub64MI8 : is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002633 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002634 return is64Bit ? kX86Sub64RI8 : is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002635 }
2636 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002637 return is64Bit ? kX86Sub64MI : is_high_op ? kX86Sbb32MI : kX86Sub32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002638 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002639 return is64Bit ? kX86Sub64RI : is_high_op ? kX86Sbb32RI : kX86Sub32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002640 case Instruction::AND_LONG_2ADDR:
2641 case Instruction::AND_LONG:
2642 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002643 if (is64Bit) {
2644 return in_mem ? kX86And64MI8 : kX86And64RI8;
2645 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002646 return in_mem ? kX86And32MI8 : kX86And32RI8;
2647 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002648 if (is64Bit) {
2649 return in_mem ? kX86And64MI : kX86And64RI;
2650 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002651 return in_mem ? kX86And32MI : kX86And32RI;
2652 case Instruction::OR_LONG:
2653 case Instruction::OR_LONG_2ADDR:
2654 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002655 if (is64Bit) {
2656 return in_mem ? kX86Or64MI8 : kX86Or64RI8;
2657 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002658 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
2659 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002660 if (is64Bit) {
2661 return in_mem ? kX86Or64MI : kX86Or64RI;
2662 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002663 return in_mem ? kX86Or32MI : kX86Or32RI;
2664 case Instruction::XOR_LONG:
2665 case Instruction::XOR_LONG_2ADDR:
2666 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002667 if (is64Bit) {
2668 return in_mem ? kX86Xor64MI8 : kX86Xor64RI8;
2669 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002670 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
2671 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002672 if (is64Bit) {
2673 return in_mem ? kX86Xor64MI : kX86Xor64RI;
2674 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002675 return in_mem ? kX86Xor32MI : kX86Xor32RI;
2676 default:
2677 LOG(FATAL) << "Unexpected opcode: " << op;
2678 return kX86Add32MI;
2679 }
2680}
2681
Chao-ying Fua0147762014-06-06 18:38:49 -07002682bool X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002683 DCHECK(rl_src.is_const);
2684 int64_t val = mir_graph_->ConstantValueWide(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07002685
Elena Sayapinadd644502014-07-01 18:39:52 +07002686 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002687 // We can do with imm only if it fits 32 bit
2688 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2689 return false;
2690 }
2691
2692 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
2693
2694 if ((rl_dest.location == kLocDalvikFrame) ||
2695 (rl_dest.location == kLocCompilerTemp)) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002696 int r_base = rs_rX86_SP.GetReg();
Chao-ying Fua0147762014-06-06 18:38:49 -07002697 int displacement = SRegOffset(rl_dest.s_reg_low);
2698
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002699 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002700 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
2701 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val);
2702 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2703 true /* is_load */, true /* is64bit */);
2704 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2705 false /* is_load */, true /* is64bit */);
2706 return true;
2707 }
2708
2709 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2710 DCHECK_EQ(rl_result.location, kLocPhysReg);
2711 DCHECK(!rl_result.reg.IsFloat());
2712
2713 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2714 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2715
2716 StoreValueWide(rl_dest, rl_result);
2717 return true;
2718 }
2719
Mark Mendelle02d48f2014-01-15 11:19:23 -08002720 int32_t val_lo = Low32Bits(val);
2721 int32_t val_hi = High32Bits(val);
buzbee30adc732014-05-09 15:10:18 -07002722 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002723
2724 // Can we just do this into memory?
2725 if ((rl_dest.location == kLocDalvikFrame) ||
2726 (rl_dest.location == kLocCompilerTemp)) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002727 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002728 int displacement = SRegOffset(rl_dest.s_reg_low);
2729
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002730 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002731 if (!IsNoOp(op, val_lo)) {
2732 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002733 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002734 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002735 true /* is_load */, true /* is64bit */);
2736 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002737 false /* is_load */, true /* is64bit */);
2738 }
2739 if (!IsNoOp(op, val_hi)) {
2740 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08002741 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002742 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002743 true /* is_load */, true /* is64bit */);
2744 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002745 false /* is_load */, true /* is64bit */);
2746 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002747 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002748 }
2749
2750 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2751 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee091cc402014-03-31 10:14:40 -07002752 DCHECK(!rl_result.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002753
2754 if (!IsNoOp(op, val_lo)) {
2755 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002756 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002757 }
2758 if (!IsNoOp(op, val_hi)) {
2759 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002760 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002761 }
2762 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002763 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002764}
2765
Chao-ying Fua0147762014-06-06 18:38:49 -07002766bool X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002767 RegLocation rl_src2, Instruction::Code op) {
2768 DCHECK(rl_src2.is_const);
2769 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002770
Elena Sayapinadd644502014-07-01 18:39:52 +07002771 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002772 // We can do with imm only if it fits 32 bit
2773 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2774 return false;
2775 }
2776 if (rl_dest.location == kLocPhysReg &&
2777 rl_src1.location == kLocPhysReg && !rl_dest.reg.IsFloat()) {
2778 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002779 OpRegCopy(rl_dest.reg, rl_src1.reg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002780 NewLIR2(x86op, rl_dest.reg.GetReg(), val);
2781 StoreFinalValueWide(rl_dest, rl_dest);
2782 return true;
2783 }
2784
2785 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2786 // We need the values to be in a temporary
2787 RegLocation rl_result = ForceTempWide(rl_src1);
2788
2789 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2790 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2791
2792 StoreFinalValueWide(rl_dest, rl_result);
2793 return true;
2794 }
2795
Mark Mendelle02d48f2014-01-15 11:19:23 -08002796 int32_t val_lo = Low32Bits(val);
2797 int32_t val_hi = High32Bits(val);
buzbee30adc732014-05-09 15:10:18 -07002798 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
2799 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002800
2801 // Can we do this directly into the destination registers?
2802 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08002803 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
buzbee091cc402014-03-31 10:14:40 -07002804 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() && !rl_dest.reg.IsFloat()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002805 if (!IsNoOp(op, val_lo)) {
2806 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002807 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002808 }
2809 if (!IsNoOp(op, val_hi)) {
2810 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002811 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002812 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07002813
2814 StoreFinalValueWide(rl_dest, rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07002815 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002816 }
2817
2818 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2819 DCHECK_EQ(rl_src1.location, kLocPhysReg);
2820
2821 // We need the values to be in a temporary
2822 RegLocation rl_result = ForceTempWide(rl_src1);
2823 if (!IsNoOp(op, val_lo)) {
2824 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002825 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002826 }
2827 if (!IsNoOp(op, val_hi)) {
2828 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002829 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002830 }
2831
2832 StoreFinalValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002833 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07002834}
2835
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002836// For final classes there are no sub-classes to check and so we can answer the instance-of
2837// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
2838void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
2839 RegLocation rl_dest, RegLocation rl_src) {
buzbeea0cd2d72014-06-01 09:33:49 -07002840 RegLocation object = LoadValue(rl_src, kRefReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002841 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002842 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002843
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002844 // For 32-bit, SETcc only works with EAX..EDX.
Chao-ying Fua77ee512014-07-01 17:43:41 -07002845 RegStorage object_32reg = object.reg.Is64Bit() ? As32BitReg(object.reg) : object.reg;
Dmitry Petrochenko407f5c12014-07-01 01:21:38 +07002846 if (result_reg.GetRegNum() == object_32reg.GetRegNum() || !IsByteRegister(result_reg)) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002847 result_reg = AllocateByteRegister();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002848 }
2849
2850 // Assume that there is no match.
2851 LoadConstant(result_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -08002852 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, NULL);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002853
Mark Mendellade54a22014-06-09 12:49:55 -04002854 // We will use this register to compare to memory below.
2855 // References are 32 bit in memory, and 64 bit in registers (in 64 bit mode).
2856 // For this reason, force allocation of a 32 bit register to use, so that the
2857 // compare to memory will be done using a 32 bit comparision.
2858 // The LoadRefDisp(s) below will work normally, even in 64 bit mode.
2859 RegStorage check_class = AllocTemp();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002860
2861 // If Method* is already in a register, we can save a copy.
2862 RegLocation rl_method = mir_graph_->GetMethodLoc();
Andreas Gampeccc60262014-07-04 18:02:38 -07002863 int32_t offset_of_type = mirror::Array::DataOffset(
2864 sizeof(mirror::HeapReference<mirror::Class*>)).Int32Value() +
2865 (sizeof(mirror::HeapReference<mirror::Class*>) * type_idx);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002866
2867 if (rl_method.location == kLocPhysReg) {
2868 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002869 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002870 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002871 } else {
buzbee695d13a2014-04-19 13:32:20 -07002872 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002873 check_class, kNotVolatile);
2874 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002875 }
2876 } else {
2877 LoadCurrMethodDirect(check_class);
2878 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002879 LoadRefDisp(check_class, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002880 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002881 } else {
buzbee695d13a2014-04-19 13:32:20 -07002882 LoadRefDisp(check_class, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002883 check_class, kNotVolatile);
2884 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002885 }
2886 }
2887
2888 // Compare the computed class to the class in the object.
2889 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08002890 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002891
2892 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08002893 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002894
2895 LIR* target = NewLIR0(kPseudoTargetLabel);
2896 null_branchover->target = target;
2897 FreeTemp(check_class);
2898 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002899 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002900 FreeTemp(result_reg);
2901 }
2902 StoreValue(rl_dest, rl_result);
2903}
2904
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002905void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
2906 RegLocation rl_lhs, RegLocation rl_rhs) {
2907 OpKind op = kOpBkpt;
2908 bool is_div_rem = false;
2909 bool unary = false;
2910 bool shift_op = false;
2911 bool is_two_addr = false;
2912 RegLocation rl_result;
2913 switch (opcode) {
2914 case Instruction::NEG_INT:
2915 op = kOpNeg;
2916 unary = true;
2917 break;
2918 case Instruction::NOT_INT:
2919 op = kOpMvn;
2920 unary = true;
2921 break;
2922 case Instruction::ADD_INT_2ADDR:
2923 is_two_addr = true;
2924 // Fallthrough
2925 case Instruction::ADD_INT:
2926 op = kOpAdd;
2927 break;
2928 case Instruction::SUB_INT_2ADDR:
2929 is_two_addr = true;
2930 // Fallthrough
2931 case Instruction::SUB_INT:
2932 op = kOpSub;
2933 break;
2934 case Instruction::MUL_INT_2ADDR:
2935 is_two_addr = true;
2936 // Fallthrough
2937 case Instruction::MUL_INT:
2938 op = kOpMul;
2939 break;
2940 case Instruction::DIV_INT_2ADDR:
2941 is_two_addr = true;
2942 // Fallthrough
2943 case Instruction::DIV_INT:
2944 op = kOpDiv;
2945 is_div_rem = true;
2946 break;
2947 /* NOTE: returns in kArg1 */
2948 case Instruction::REM_INT_2ADDR:
2949 is_two_addr = true;
2950 // Fallthrough
2951 case Instruction::REM_INT:
2952 op = kOpRem;
2953 is_div_rem = true;
2954 break;
2955 case Instruction::AND_INT_2ADDR:
2956 is_two_addr = true;
2957 // Fallthrough
2958 case Instruction::AND_INT:
2959 op = kOpAnd;
2960 break;
2961 case Instruction::OR_INT_2ADDR:
2962 is_two_addr = true;
2963 // Fallthrough
2964 case Instruction::OR_INT:
2965 op = kOpOr;
2966 break;
2967 case Instruction::XOR_INT_2ADDR:
2968 is_two_addr = true;
2969 // Fallthrough
2970 case Instruction::XOR_INT:
2971 op = kOpXor;
2972 break;
2973 case Instruction::SHL_INT_2ADDR:
2974 is_two_addr = true;
2975 // Fallthrough
2976 case Instruction::SHL_INT:
2977 shift_op = true;
2978 op = kOpLsl;
2979 break;
2980 case Instruction::SHR_INT_2ADDR:
2981 is_two_addr = true;
2982 // Fallthrough
2983 case Instruction::SHR_INT:
2984 shift_op = true;
2985 op = kOpAsr;
2986 break;
2987 case Instruction::USHR_INT_2ADDR:
2988 is_two_addr = true;
2989 // Fallthrough
2990 case Instruction::USHR_INT:
2991 shift_op = true;
2992 op = kOpLsr;
2993 break;
2994 default:
2995 LOG(FATAL) << "Invalid word arith op: " << opcode;
2996 }
2997
Mark Mendelle87f9b52014-04-30 14:13:18 -04002998 // Can we convert to a two address instruction?
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002999 if (!is_two_addr &&
3000 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3001 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04003002 is_two_addr = true;
3003 }
3004
3005 if (!GenerateTwoOperandInstructions()) {
3006 is_two_addr = false;
3007 }
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003008
3009 // Get the div/rem stuff out of the way.
3010 if (is_div_rem) {
3011 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, true);
3012 StoreValue(rl_dest, rl_result);
3013 return;
3014 }
3015
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003016 // If we generate any memory access below, it will reference a dalvik reg.
3017 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
3018
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003019 if (unary) {
3020 rl_lhs = LoadValue(rl_lhs, kCoreReg);
buzbee30adc732014-05-09 15:10:18 -07003021 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003022 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003023 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003024 } else {
3025 if (shift_op) {
3026 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003027 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003028 LoadValueDirectFixed(rl_rhs, t_reg);
3029 if (is_two_addr) {
3030 // Can we do this directly into memory?
buzbee30adc732014-05-09 15:10:18 -07003031 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003032 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3033 if (rl_result.location != kLocPhysReg) {
3034 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08003035 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003036 FreeTemp(t_reg);
3037 return;
buzbee091cc402014-03-31 10:14:40 -07003038 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003039 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08003040 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003041 FreeTemp(t_reg);
3042 StoreFinalValue(rl_dest, rl_result);
3043 return;
3044 }
3045 }
3046 // Three address form, or we can't do directly.
3047 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3048 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003049 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003050 FreeTemp(t_reg);
3051 } else {
3052 // Multiply is 3 operand only (sort of).
3053 if (is_two_addr && op != kOpMul) {
3054 // Can we do this directly into memory?
buzbee30adc732014-05-09 15:10:18 -07003055 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003056 if (rl_result.location == kLocPhysReg) {
Serguei Katkov366f8ae2014-04-15 16:55:26 +07003057 // Ensure res is in a core reg
3058 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003059 // Can we do this from memory directly?
buzbee30adc732014-05-09 15:10:18 -07003060 rl_rhs = UpdateLocTyped(rl_rhs, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003061 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08003062 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003063 StoreFinalValue(rl_dest, rl_result);
3064 return;
buzbee091cc402014-03-31 10:14:40 -07003065 } else if (!rl_rhs.reg.IsFloat()) {
buzbee2700f7e2014-03-07 09:46:20 -08003066 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003067 StoreFinalValue(rl_dest, rl_result);
3068 return;
3069 }
3070 }
3071 rl_rhs = LoadValue(rl_rhs, kCoreReg);
Serguei Katkovd293fb42014-05-19 15:45:42 +07003072 // It might happen rl_rhs and rl_dest are the same VR
3073 // in this case rl_dest is in reg after LoadValue while
3074 // rl_result is not updated yet, so do this
3075 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003076 if (rl_result.location != kLocPhysReg) {
3077 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00003078 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003079 return;
buzbee091cc402014-03-31 10:14:40 -07003080 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003081 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08003082 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003083 StoreFinalValue(rl_dest, rl_result);
3084 return;
3085 } else {
3086 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3087 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003088 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003089 }
3090 } else {
3091 // Try to use reg/memory instructions.
buzbee30adc732014-05-09 15:10:18 -07003092 rl_lhs = UpdateLocTyped(rl_lhs, kCoreReg);
3093 rl_rhs = UpdateLocTyped(rl_rhs, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003094 // We can't optimize with FP registers.
3095 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
3096 // Something is difficult, so fall back to the standard case.
3097 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3098 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3099 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003100 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003101 } else {
3102 // We can optimize by moving to result and using memory operands.
3103 if (rl_rhs.location != kLocPhysReg) {
3104 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07003105 // We should be careful with order here
3106 // If rl_dest and rl_lhs points to the same VR we should load first
3107 // If the are different we should find a register first for dest
Chao-ying Fua0147762014-06-06 18:38:49 -07003108 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3109 mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
Serguei Katkov66da1362014-03-14 13:33:33 +07003110 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3111 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendelle87f9b52014-04-30 14:13:18 -04003112 // No-op if these are the same.
3113 OpRegCopy(rl_result.reg, rl_lhs.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003114 } else {
3115 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003116 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003117 }
buzbee2700f7e2014-03-07 09:46:20 -08003118 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003119 } else if (rl_lhs.location != kLocPhysReg) {
3120 // RHS is in a register; LHS is in memory.
3121 if (op != kOpSub) {
3122 // Force RHS into result and operate on memory.
3123 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003124 OpRegCopy(rl_result.reg, rl_rhs.reg);
3125 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003126 } else {
3127 // Subtraction isn't commutative.
3128 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3129 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3130 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003131 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003132 }
3133 } else {
3134 // Both are in registers.
3135 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3136 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3137 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003138 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003139 }
3140 }
3141 }
3142 }
3143 }
3144 StoreValue(rl_dest, rl_result);
3145}
3146
3147bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
3148 // If we have non-core registers, then we can't do good things.
buzbee091cc402014-03-31 10:14:40 -07003149 if (rl_lhs.location == kLocPhysReg && rl_lhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003150 return false;
3151 }
buzbee091cc402014-03-31 10:14:40 -07003152 if (rl_rhs.location == kLocPhysReg && rl_rhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003153 return false;
3154 }
3155
3156 // Everything will be fine :-).
3157 return true;
3158}
Chao-ying Fua0147762014-06-06 18:38:49 -07003159
3160void X86Mir2Lir::GenIntToLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003161 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07003162 Mir2Lir::GenIntToLong(rl_dest, rl_src);
3163 return;
3164 }
Serguei Katkove63d9d42014-06-25 00:25:35 +07003165 rl_src = UpdateLocTyped(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003166 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
3167 if (rl_src.location == kLocPhysReg) {
3168 NewLIR2(kX86MovsxdRR, rl_result.reg.GetReg(), rl_src.reg.GetReg());
3169 } else {
3170 int displacement = SRegOffset(rl_src.s_reg_low);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003171 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003172 LIR *m = NewLIR3(kX86MovsxdRM, rl_result.reg.GetReg(), rs_rX86_SP.GetReg(),
3173 displacement + LOWORD_OFFSET);
3174 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
3175 true /* is_load */, true /* is_64bit */);
3176 }
3177 StoreValueWide(rl_dest, rl_result);
3178}
3179
3180void X86Mir2Lir::GenShiftOpLong(Instruction::Code opcode, RegLocation rl_dest,
3181 RegLocation rl_src1, RegLocation rl_shift) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003182 if (!cu_->target64) {
Yixin Shouf40f8902014-08-14 14:10:32 -04003183 // Long shift operations in 32-bit. Use shld or shrd to create a 32-bit register filled from
3184 // the other half, shift the other half, if the shift amount is less than 32 we're done,
3185 // otherwise move one register to the other and place zero or sign bits in the other.
3186 LIR* branch;
3187 FlushAllRegs();
3188 LockCallTemps();
3189 LoadValueDirectFixed(rl_shift, rs_rCX);
3190 RegStorage r_tmp = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
3191 LoadValueDirectWideFixed(rl_src1, r_tmp);
3192 switch (opcode) {
3193 case Instruction::SHL_LONG:
3194 case Instruction::SHL_LONG_2ADDR:
3195 NewLIR3(kX86Shld32RRC, r_tmp.GetHighReg(), r_tmp.GetLowReg(), rs_rCX.GetReg());
3196 NewLIR2(kX86Sal32RC, r_tmp.GetLowReg(), rs_rCX.GetReg());
3197 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3198 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3199 OpRegCopy(r_tmp.GetHigh(), r_tmp.GetLow());
3200 LoadConstant(r_tmp.GetLow(), 0);
3201 branch->target = NewLIR0(kPseudoTargetLabel);
3202 break;
3203 case Instruction::SHR_LONG:
3204 case Instruction::SHR_LONG_2ADDR:
3205 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(), rs_rCX.GetReg());
3206 NewLIR2(kX86Sar32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3207 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3208 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3209 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3210 NewLIR2(kX86Sar32RI, r_tmp.GetHighReg(), 31);
3211 branch->target = NewLIR0(kPseudoTargetLabel);
3212 break;
3213 case Instruction::USHR_LONG:
3214 case Instruction::USHR_LONG_2ADDR:
3215 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(),
3216 rs_rCX.GetReg());
3217 NewLIR2(kX86Shr32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3218 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3219 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3220 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3221 LoadConstant(r_tmp.GetHigh(), 0);
3222 branch->target = NewLIR0(kPseudoTargetLabel);
3223 break;
3224 default:
3225 LOG(FATAL) << "Unexpected case: " << opcode;
3226 return;
3227 }
3228 RegLocation rl_result = LocCReturnWide();
3229 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07003230 return;
3231 }
3232
3233 bool is_two_addr = false;
3234 OpKind op = kOpBkpt;
3235 RegLocation rl_result;
3236
3237 switch (opcode) {
3238 case Instruction::SHL_LONG_2ADDR:
3239 is_two_addr = true;
3240 // Fallthrough
3241 case Instruction::SHL_LONG:
3242 op = kOpLsl;
3243 break;
3244 case Instruction::SHR_LONG_2ADDR:
3245 is_two_addr = true;
3246 // Fallthrough
3247 case Instruction::SHR_LONG:
3248 op = kOpAsr;
3249 break;
3250 case Instruction::USHR_LONG_2ADDR:
3251 is_two_addr = true;
3252 // Fallthrough
3253 case Instruction::USHR_LONG:
3254 op = kOpLsr;
3255 break;
3256 default:
3257 op = kOpBkpt;
3258 }
3259
3260 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003261 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Chao-ying Fua0147762014-06-06 18:38:49 -07003262 LoadValueDirectFixed(rl_shift, t_reg);
3263 if (is_two_addr) {
3264 // Can we do this directly into memory?
3265 rl_result = UpdateLocWideTyped(rl_dest, kCoreReg);
3266 if (rl_result.location != kLocPhysReg) {
3267 // Okay, we can do this into memory
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003268 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003269 OpMemReg(op, rl_result, t_reg.GetReg());
3270 } else if (!rl_result.reg.IsFloat()) {
3271 // Can do this directly into the result register
3272 OpRegReg(op, rl_result.reg, t_reg);
3273 StoreFinalValueWide(rl_dest, rl_result);
3274 }
3275 } else {
3276 // Three address form, or we can't do directly.
3277 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
3278 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
3279 OpRegRegReg(op, rl_result.reg, rl_src1.reg, t_reg);
3280 StoreFinalValueWide(rl_dest, rl_result);
3281 }
3282
3283 FreeTemp(t_reg);
3284}
3285
Brian Carlstrom7940e442013-07-12 13:46:57 -07003286} // namespace art