blob: a745339ca4e825eee23829efa3ac8bca575f5fe4 [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;
277 rl_src = LoadValue(rl_src, src_reg_class);
Vladimir Markoa1a70742014-03-03 10:28:05 +0000278 ConditionCode ccode = mir->meta.ccode;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800279
280 // The kMirOpSelect has two variants, one for constants and one for moves.
281 const bool is_constant_case = (mir->ssa_rep->num_uses == 1);
282
283 if (is_constant_case) {
284 int true_val = mir->dalvikInsn.vB;
285 int false_val = mir->dalvikInsn.vC;
buzbeea0cd2d72014-06-01 09:33:49 -0700286 rl_result = EvalLoc(rl_dest, result_reg_class, true);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800287
288 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000289 * For ccode == kCondEq:
290 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800291 * 1) When the true case is zero and result_reg is not same as src_reg:
292 * xor result_reg, result_reg
293 * cmp $0, src_reg
294 * mov t1, $false_case
295 * cmovnz result_reg, t1
296 * 2) When the false case is zero and result_reg is not same as src_reg:
297 * xor result_reg, result_reg
298 * cmp $0, src_reg
299 * mov t1, $true_case
300 * cmovz result_reg, t1
301 * 3) All other cases (we do compare first to set eflags):
302 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000303 * mov result_reg, $false_case
304 * mov t1, $true_case
305 * cmovz result_reg, t1
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800306 */
buzbeea0cd2d72014-06-01 09:33:49 -0700307 // FIXME: depending on how you use registers you could get a false != mismatch when dealing
308 // with different views of the same underlying physical resource (i.e. solo32 vs. solo64).
buzbee2700f7e2014-03-07 09:46:20 -0800309 const bool result_reg_same_as_src =
Chao-ying Fua77ee512014-07-01 17:43:41 -0700310 (rl_src.location == kLocPhysReg && rl_src.reg.GetRegNum() == rl_result.reg.GetRegNum());
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800311 const bool true_zero_case = (true_val == 0 && false_val != 0 && !result_reg_same_as_src);
312 const bool false_zero_case = (false_val == 0 && true_val != 0 && !result_reg_same_as_src);
313 const bool catch_all_case = !(true_zero_case || false_zero_case);
314
315 if (true_zero_case || false_zero_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800316 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800317 }
318
319 if (true_zero_case || false_zero_case || catch_all_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800320 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800321 }
322
323 if (catch_all_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800324 OpRegImm(kOpMov, rl_result.reg, false_val);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800325 }
326
327 if (true_zero_case || false_zero_case || catch_all_case) {
Vladimir Markoa1a70742014-03-03 10:28:05 +0000328 ConditionCode cc = true_zero_case ? NegateComparison(ccode) : ccode;
329 int immediateForTemp = true_zero_case ? false_val : true_val;
buzbeea0cd2d72014-06-01 09:33:49 -0700330 RegStorage temp1_reg = AllocTypedTemp(false, result_reg_class);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800331 OpRegImm(kOpMov, temp1_reg, immediateForTemp);
332
buzbee2700f7e2014-03-07 09:46:20 -0800333 OpCondRegReg(kOpCmov, cc, rl_result.reg, temp1_reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800334
335 FreeTemp(temp1_reg);
336 }
337 } else {
338 RegLocation rl_true = mir_graph_->GetSrc(mir, 1);
339 RegLocation rl_false = mir_graph_->GetSrc(mir, 2);
buzbeea0cd2d72014-06-01 09:33:49 -0700340 rl_true = LoadValue(rl_true, result_reg_class);
341 rl_false = LoadValue(rl_false, result_reg_class);
342 rl_result = EvalLoc(rl_dest, result_reg_class, true);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800343
344 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000345 * For ccode == kCondEq:
346 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800347 * 1) When true case is already in place:
348 * cmp $0, src_reg
349 * cmovnz result_reg, false_reg
350 * 2) When false case is already in place:
351 * cmp $0, src_reg
352 * cmovz result_reg, true_reg
353 * 3) When neither cases are in place:
354 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000355 * mov result_reg, false_reg
356 * cmovz result_reg, true_reg
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800357 */
358
359 // kMirOpSelect is generated just for conditional cases when comparison is done with zero.
buzbee2700f7e2014-03-07 09:46:20 -0800360 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800361
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000362 if (rl_result.reg.GetReg() == rl_true.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800363 OpCondRegReg(kOpCmov, NegateComparison(ccode), rl_result.reg, rl_false.reg);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000364 } else if (rl_result.reg.GetReg() == rl_false.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800365 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800366 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800367 OpRegCopy(rl_result.reg, rl_false.reg);
368 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800369 }
370 }
371
372 StoreValue(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700373}
374
375void X86Mir2Lir::GenFusedLongCmpBranch(BasicBlock* bb, MIR* mir) {
buzbee0d829482013-10-11 15:24:55 -0700376 LIR* taken = &block_label_list_[bb->taken];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700377 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
378 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
Vladimir Markoa8946072014-01-22 10:30:44 +0000379 ConditionCode ccode = mir->meta.ccode;
Mark Mendell412d4f82013-12-18 13:32:36 -0800380
381 if (rl_src1.is_const) {
382 std::swap(rl_src1, rl_src2);
383 ccode = FlipComparisonOrder(ccode);
384 }
385 if (rl_src2.is_const) {
386 // Do special compare/branch against simple const operand
387 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
388 GenFusedLongCmpImmBranch(bb, rl_src1, val, ccode);
389 return;
390 }
391
Elena Sayapinadd644502014-07-01 18:39:52 +0700392 if (cu_->target64) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700393 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
394 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
395
396 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
397 OpCondBranch(ccode, taken);
398 return;
399 }
400
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700401 // Prepare for explicit register usage
402 ExplicitTempRegisterLock(this, 4, &rs_r0, &rs_r1, &rs_r2, &rs_r3);
buzbee091cc402014-03-31 10:14:40 -0700403 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
404 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -0800405 LoadValueDirectWideFixed(rl_src1, r_tmp1);
406 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700407
Brian Carlstrom7940e442013-07-12 13:46:57 -0700408 // Swap operands and condition code to prevent use of zero flag.
409 if (ccode == kCondLe || ccode == kCondGt) {
410 // Compute (r3:r2) = (r3:r2) - (r1:r0)
buzbee2700f7e2014-03-07 09:46:20 -0800411 OpRegReg(kOpSub, rs_r2, rs_r0); // r2 = r2 - r0
412 OpRegReg(kOpSbc, rs_r3, rs_r1); // r3 = r3 - r1 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700413 } else {
414 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -0800415 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
416 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700417 }
418 switch (ccode) {
419 case kCondEq:
420 case kCondNe:
buzbee2700f7e2014-03-07 09:46:20 -0800421 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = r0 | r1
Brian Carlstrom7940e442013-07-12 13:46:57 -0700422 break;
423 case kCondLe:
424 ccode = kCondGe;
425 break;
426 case kCondGt:
427 ccode = kCondLt;
428 break;
429 case kCondLt:
430 case kCondGe:
431 break;
432 default:
433 LOG(FATAL) << "Unexpected ccode: " << ccode;
434 }
435 OpCondBranch(ccode, taken);
436}
437
Mark Mendell412d4f82013-12-18 13:32:36 -0800438void X86Mir2Lir::GenFusedLongCmpImmBranch(BasicBlock* bb, RegLocation rl_src1,
439 int64_t val, ConditionCode ccode) {
440 int32_t val_lo = Low32Bits(val);
441 int32_t val_hi = High32Bits(val);
442 LIR* taken = &block_label_list_[bb->taken];
Mark Mendell412d4f82013-12-18 13:32:36 -0800443 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Mark Mendell752e2052014-05-01 10:19:04 -0400444 bool is_equality_test = ccode == kCondEq || ccode == kCondNe;
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700445
Elena Sayapinadd644502014-07-01 18:39:52 +0700446 if (cu_->target64) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700447 if (is_equality_test && val == 0) {
448 // We can simplify of comparing for ==, != to 0.
449 NewLIR2(kX86Test64RR, rl_src1.reg.GetReg(), rl_src1.reg.GetReg());
450 } else if (is_equality_test && val_hi == 0 && val_lo > 0) {
451 OpRegImm(kOpCmp, rl_src1.reg, val_lo);
452 } else {
453 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
454 LoadConstantWide(tmp, val);
455 OpRegReg(kOpCmp, rl_src1.reg, tmp);
456 FreeTemp(tmp);
457 }
458 OpCondBranch(ccode, taken);
459 return;
460 }
461
Mark Mendell752e2052014-05-01 10:19:04 -0400462 if (is_equality_test && val != 0) {
463 rl_src1 = ForceTempWide(rl_src1);
464 }
buzbee2700f7e2014-03-07 09:46:20 -0800465 RegStorage low_reg = rl_src1.reg.GetLow();
466 RegStorage high_reg = rl_src1.reg.GetHigh();
Mark Mendell412d4f82013-12-18 13:32:36 -0800467
Mark Mendell752e2052014-05-01 10:19:04 -0400468 if (is_equality_test) {
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +0700469 // We can simplify of comparing for ==, != to 0.
Mark Mendell752e2052014-05-01 10:19:04 -0400470 if (val == 0) {
471 if (IsTemp(low_reg)) {
472 OpRegReg(kOpOr, low_reg, high_reg);
473 // We have now changed it; ignore the old values.
474 Clobber(rl_src1.reg);
475 } else {
476 RegStorage t_reg = AllocTemp();
477 OpRegRegReg(kOpOr, t_reg, low_reg, high_reg);
478 FreeTemp(t_reg);
479 }
480 OpCondBranch(ccode, taken);
481 return;
482 }
483
484 // Need to compute the actual value for ==, !=.
485 OpRegImm(kOpSub, low_reg, val_lo);
486 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
487 OpRegReg(kOpOr, high_reg, low_reg);
488 Clobber(rl_src1.reg);
489 } else if (ccode == kCondLe || ccode == kCondGt) {
490 // Swap operands and condition code to prevent use of zero flag.
491 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
492 LoadConstantWide(tmp, val);
493 OpRegReg(kOpSub, tmp.GetLow(), low_reg);
494 OpRegReg(kOpSbc, tmp.GetHigh(), high_reg);
495 ccode = (ccode == kCondLe) ? kCondGe : kCondLt;
496 FreeTemp(tmp);
497 } else {
498 // We can use a compare for the low word to set CF.
499 OpRegImm(kOpCmp, low_reg, val_lo);
500 if (IsTemp(high_reg)) {
501 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
502 // We have now changed it; ignore the old values.
503 Clobber(rl_src1.reg);
504 } else {
505 // mov temp_reg, high_reg; sbb temp_reg, high_constant
506 RegStorage t_reg = AllocTemp();
507 OpRegCopy(t_reg, high_reg);
508 NewLIR2(kX86Sbb32RI, t_reg.GetReg(), val_hi);
509 FreeTemp(t_reg);
510 }
Mark Mendell412d4f82013-12-18 13:32:36 -0800511 }
512
Mark Mendell752e2052014-05-01 10:19:04 -0400513 OpCondBranch(ccode, taken);
Mark Mendell412d4f82013-12-18 13:32:36 -0800514}
515
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700516void X86Mir2Lir::CalculateMagicAndShift(int64_t divisor, int64_t& magic, int& shift, bool is_long) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800517 // It does not make sense to calculate magic and shift for zero divisor.
518 DCHECK_NE(divisor, 0);
519
520 /* According to H.S.Warren's Hacker's Delight Chapter 10 and
521 * T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
522 * The magic number M and shift S can be calculated in the following way:
523 * Let nc be the most positive value of numerator(n) such that nc = kd - 1,
524 * where divisor(d) >=2.
525 * Let nc be the most negative value of numerator(n) such that nc = kd + 1,
526 * where divisor(d) <= -2.
527 * Thus nc can be calculated like:
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700528 * nc = exp + exp % d - 1, where d >= 2 and exp = 2^31 for int or 2^63 for long
529 * 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 -0800530 *
531 * So the shift p is the smallest p satisfying
532 * 2^p > nc * (d - 2^p % d), where d >= 2
533 * 2^p > nc * (d + 2^p % d), where d <= -2.
534 *
535 * the magic number M is calcuated by
536 * M = (2^p + d - 2^p % d) / d, where d >= 2
537 * M = (2^p - d - 2^p % d) / d, where d <= -2.
538 *
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700539 * 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 -0800540 * the shift number S.
541 */
542
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700543 int64_t p = (is_long) ? 63 : 31;
544 const uint64_t exp = (is_long) ? 0x8000000000000000ULL : 0x80000000U;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800545
546 // Initialize the computations.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700547 uint64_t abs_d = (divisor >= 0) ? divisor : -divisor;
548 uint64_t tmp = exp + ((is_long) ? static_cast<uint64_t>(divisor) >> 63 :
549 static_cast<uint32_t>(divisor) >> 31);
550 uint64_t abs_nc = tmp - 1 - tmp % abs_d;
551 uint64_t quotient1 = exp / abs_nc;
552 uint64_t remainder1 = exp % abs_nc;
553 uint64_t quotient2 = exp / abs_d;
554 uint64_t remainder2 = exp % abs_d;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800555
556 /*
557 * To avoid handling both positive and negative divisor, Hacker's Delight
558 * introduces a method to handle these 2 cases together to avoid duplication.
559 */
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700560 uint64_t delta;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800561 do {
562 p++;
563 quotient1 = 2 * quotient1;
564 remainder1 = 2 * remainder1;
565 if (remainder1 >= abs_nc) {
566 quotient1++;
567 remainder1 = remainder1 - abs_nc;
568 }
569 quotient2 = 2 * quotient2;
570 remainder2 = 2 * remainder2;
571 if (remainder2 >= abs_d) {
572 quotient2++;
573 remainder2 = remainder2 - abs_d;
574 }
575 delta = abs_d - remainder2;
576 } while (quotient1 < delta || (quotient1 == delta && remainder1 == 0));
577
578 magic = (divisor > 0) ? (quotient2 + 1) : (-quotient2 - 1);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700579
580 if (!is_long) {
581 magic = static_cast<int>(magic);
582 }
583
584 shift = (is_long) ? p - 64 : p - 32;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800585}
586
buzbee2700f7e2014-03-07 09:46:20 -0800587RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegStorage reg_lo, int lit, bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700588 LOG(FATAL) << "Unexpected use of GenDivRemLit for x86";
589 return rl_dest;
590}
591
Mark Mendell2bf31e62014-01-23 12:13:40 -0800592RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegLocation rl_src,
593 int imm, bool is_div) {
594 // Use a multiply (and fixup) to perform an int div/rem by a constant.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700595 RegLocation rl_result;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800596
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700597 if (imm == 1) {
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700598 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800599 if (is_div) {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700600 // x / 1 == x.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700601 LoadValueDirectFixed(rl_src, rl_result.reg);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700602 } else {
603 // x % 1 == 0.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700604 LoadConstantNoClobber(rl_result.reg, 0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700605 }
606 } else if (imm == -1) { // handle 0x80000000 / -1 special case.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700607 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700608 if (is_div) {
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700609 LoadValueDirectFixed(rl_src, rl_result.reg);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400610
611 // Check if numerator is 0
612 OpRegImm(kOpCmp, rl_result.reg, 0);
613 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
614
615 // handle 0x80000000 / -1
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700616 OpRegImm(kOpCmp, rl_result.reg, 0x80000000);
617 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800618
619 // for x != MIN_INT, x / -1 == -x.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700620 NewLIR1(kX86Neg32R, rl_result.reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800621
Mark Mendell2bf31e62014-01-23 12:13:40 -0800622 // EAX already contains the right value (0x80000000),
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700623 minint_branch->target = NewLIR0(kPseudoTargetLabel);
Yixin Shou2ddd1752014-08-26 15:15:13 -0400624 branch->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800625 } else {
626 // x % -1 == 0.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700627 LoadConstantNoClobber(rl_result.reg, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800628 }
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700629 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
630 // Division using shifting.
631 rl_src = LoadValue(rl_src, kCoreReg);
632 rl_result = EvalLoc(rl_dest, kCoreReg, true);
633 if (IsSameReg(rl_result.reg, rl_src.reg)) {
634 RegStorage rs_temp = AllocTypedTemp(false, kCoreReg);
635 rl_result.reg.SetReg(rs_temp.GetReg());
636 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400637
638 // Check if numerator is 0
639 OpRegImm(kOpCmp, rl_src.reg, 0);
640 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
641 LoadConstantNoClobber(rl_result.reg, 0);
642 LIR* done = NewLIR1(kX86Jmp8, 0);
643 branch->target = NewLIR0(kPseudoTargetLabel);
644
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700645 NewLIR3(kX86Lea32RM, rl_result.reg.GetReg(), rl_src.reg.GetReg(), std::abs(imm) - 1);
646 NewLIR2(kX86Test32RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
647 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
648 int shift_amount = LowestSetBit(imm);
649 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
650 if (imm < 0) {
651 OpReg(kOpNeg, rl_result.reg);
652 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400653 done->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800654 } else {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700655 CHECK(imm <= -2 || imm >= 2);
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700656
Mark Mendell2bf31e62014-01-23 12:13:40 -0800657 // Use H.S.Warren's Hacker's Delight Chapter 10 and
658 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700659 int64_t magic;
660 int shift;
661 CalculateMagicAndShift((int64_t)imm, magic, shift, false /* is_long */);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800662
663 /*
664 * For imm >= 2,
665 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
666 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
667 * For imm <= -2,
668 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
669 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
670 * We implement this algorithm in the following way:
671 * 1. multiply magic number m and numerator n, get the higher 32bit result in EDX
672 * 2. if imm > 0 and magic < 0, add numerator to EDX
673 * if imm < 0 and magic > 0, sub numerator from EDX
674 * 3. if S !=0, SAR S bits for EDX
675 * 4. add 1 to EDX if EDX < 0
676 * 5. Thus, EDX is the quotient
677 */
678
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700679 FlushReg(rs_r0);
680 Clobber(rs_r0);
681 LockTemp(rs_r0);
682 FlushReg(rs_r2);
683 Clobber(rs_r2);
684 LockTemp(rs_r2);
685
686 // Assume that the result will be in EDX.
687 rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, rs_r2, INVALID_SREG, INVALID_SREG};
688
Mark Mendell2bf31e62014-01-23 12:13:40 -0800689 // Numerator into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800690 RegStorage numerator_reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800691 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
692 // We will need the value later.
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +0700693 rl_src = LoadValue(rl_src, kCoreReg);
694 numerator_reg = rl_src.reg;
buzbee2700f7e2014-03-07 09:46:20 -0800695 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800696 } else {
697 // Only need this once. Just put it into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800698 LoadValueDirectFixed(rl_src, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800699 }
700
Yixin Shou2ddd1752014-08-26 15:15:13 -0400701 // Check if numerator is 0
702 OpRegImm(kOpCmp, rs_r0, 0);
703 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
704 LoadConstantNoClobber(rs_r2, 0);
705 LIR* done = NewLIR1(kX86Jmp8, 0);
706 branch->target = NewLIR0(kPseudoTargetLabel);
707
Mark Mendell2bf31e62014-01-23 12:13:40 -0800708 // EDX = magic.
buzbee2700f7e2014-03-07 09:46:20 -0800709 LoadConstantNoClobber(rs_r2, magic);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800710
711 // EDX:EAX = magic & dividend.
buzbee091cc402014-03-31 10:14:40 -0700712 NewLIR1(kX86Imul32DaR, rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800713
714 if (imm > 0 && magic < 0) {
715 // Add numerator to EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800716 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700717 NewLIR2(kX86Add32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800718 } else if (imm < 0 && magic > 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800719 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700720 NewLIR2(kX86Sub32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800721 }
722
723 // Do we need the shift?
724 if (shift != 0) {
725 // Shift EDX by 'shift' bits.
buzbee091cc402014-03-31 10:14:40 -0700726 NewLIR2(kX86Sar32RI, rs_r2.GetReg(), shift);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800727 }
728
729 // Add 1 to EDX if EDX < 0.
730
731 // Move EDX to EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800732 OpRegCopy(rs_r0, rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800733
734 // Move sign bit to bit 0, zeroing the rest.
buzbee091cc402014-03-31 10:14:40 -0700735 NewLIR2(kX86Shr32RI, rs_r2.GetReg(), 31);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800736
737 // EDX = EDX + EAX.
buzbee091cc402014-03-31 10:14:40 -0700738 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r0.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800739
740 // Quotient is in EDX.
741 if (!is_div) {
742 // We need to compute the remainder.
743 // Remainder is divisor - (quotient * imm).
buzbee2700f7e2014-03-07 09:46:20 -0800744 DCHECK(numerator_reg.Valid());
745 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800746
747 // EAX = numerator * imm.
buzbee2700f7e2014-03-07 09:46:20 -0800748 OpRegRegImm(kOpMul, rs_r2, rs_r2, imm);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800749
750 // EDX -= EAX.
buzbee091cc402014-03-31 10:14:40 -0700751 NewLIR2(kX86Sub32RR, rs_r0.GetReg(), rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800752
753 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000754 rl_result.reg.SetReg(r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800755 }
Yixin Shou2ddd1752014-08-26 15:15:13 -0400756 done->target = NewLIR0(kPseudoTargetLabel);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800757 }
758
759 return rl_result;
760}
761
buzbee2700f7e2014-03-07 09:46:20 -0800762RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegStorage reg_lo, RegStorage reg_hi,
763 bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700764 LOG(FATAL) << "Unexpected use of GenDivRem for x86";
765 return rl_dest;
766}
767
Mark Mendell2bf31e62014-01-23 12:13:40 -0800768RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegLocation rl_src1,
769 RegLocation rl_src2, bool is_div, bool check_zero) {
770 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700771
772 // Prepare for explicit register usage.
773 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800774
775 // Load LHS into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800776 LoadValueDirectFixed(rl_src1, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800777
778 // Load RHS into EBX.
buzbee2700f7e2014-03-07 09:46:20 -0800779 LoadValueDirectFixed(rl_src2, rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800780
781 // Copy LHS sign bit into EDX.
782 NewLIR0(kx86Cdq32Da);
783
784 if (check_zero) {
785 // Handle division by zero case.
Mingyao Yange643a172014-04-08 11:02:52 -0700786 GenDivZeroCheck(rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800787 }
788
Yixin Shou2ddd1752014-08-26 15:15:13 -0400789 // Check if numerator is 0
790 OpRegImm(kOpCmp, rs_r0, 0);
791 LIR* branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
792
Mark Mendell2bf31e62014-01-23 12:13:40 -0800793 // Have to catch 0x80000000/-1 case, or we will get an exception!
buzbee2700f7e2014-03-07 09:46:20 -0800794 OpRegImm(kOpCmp, rs_r1, -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700795 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800796
797 // RHS is -1.
buzbee2700f7e2014-03-07 09:46:20 -0800798 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +0700799 LIR* minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800800
Yixin Shou2ddd1752014-08-26 15:15:13 -0400801 branch->target = NewLIR0(kPseudoTargetLabel);
802
Mark Mendell2bf31e62014-01-23 12:13:40 -0800803 // In 0x80000000/-1 case.
804 if (!is_div) {
805 // For DIV, EAX is already right. For REM, we need EDX 0.
buzbee2700f7e2014-03-07 09:46:20 -0800806 LoadConstantNoClobber(rs_r2, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800807 }
808 LIR* done = NewLIR1(kX86Jmp8, 0);
809
810 // Expected case.
811 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
812 minint_branch->target = minus_one_branch->target;
buzbee091cc402014-03-31 10:14:40 -0700813 NewLIR1(kX86Idivmod32DaR, rs_r1.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800814 done->target = NewLIR0(kPseudoTargetLabel);
815
816 // Result is in EAX for div and EDX for rem.
buzbee091cc402014-03-31 10:14:40 -0700817 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 -0800818 if (!is_div) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000819 rl_result.reg.SetReg(r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800820 }
821 return rl_result;
822}
823
Serban Constantinescu23abec92014-07-02 16:13:38 +0100824bool X86Mir2Lir::GenInlinedMinMax(CallInfo* info, bool is_min, bool is_long) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700825 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800826
nikolay serdjuk4ab6f502014-08-08 09:55:06 +0700827 if (is_long && !cu_->target64) {
828 /*
829 * We want to implement the following algorithm
830 * mov eax, low part of arg1
831 * mov edx, high part of arg1
832 * mov ebx, low part of arg2
833 * mov ecx, high part of arg2
834 * mov edi, eax
835 * sub edi, ebx
836 * mov edi, edx
837 * sbb edi, ecx
838 * is_min ? "cmovgel eax, ebx" : "cmovll eax, ebx"
839 * is_min ? "cmovgel edx, ecx" : "cmovll edx, ecx"
840 *
841 * The algorithm above needs 5 registers: a pair for the first operand
842 * (which later will be used as result), a pair for the second operand
843 * and a temp register (e.g. 'edi') for intermediate calculations.
844 * Ideally we have 6 GP caller-save registers in 32-bit mode. They are:
845 * 'eax', 'ebx', 'ecx', 'edx', 'esi' and 'edi'. So there should be
846 * always enough registers to operate on. Practically, there is a pair
847 * of registers 'edi' and 'esi' which holds promoted values and
848 * sometimes should be treated as 'callee save'. If one of the operands
849 * is in the promoted registers then we have enough register to
850 * operate on. Otherwise there is lack of resources and we have to
851 * save 'edi' before calculations and restore after.
852 */
853
854 RegLocation rl_src1 = info->args[0];
855 RegLocation rl_src2 = info->args[2];
856 RegLocation rl_dest = InlineTargetWide(info);
857 int res_vreg, src1_vreg, src2_vreg;
858
859 /*
860 * If the result register is the same as the second element, then we
861 * need to be careful. The reason is that the first copy will
862 * inadvertently clobber the second element with the first one thus
863 * yielding the wrong result. Thus we do a swap in that case.
864 */
865 res_vreg = mir_graph_->SRegToVReg(rl_dest.s_reg_low);
866 src2_vreg = mir_graph_->SRegToVReg(rl_src2.s_reg_low);
867 if (res_vreg == src2_vreg) {
868 std::swap(rl_src1, rl_src2);
869 }
870
871 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
872 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
873
874 // Pick the first integer as min/max.
875 OpRegCopyWide(rl_result.reg, rl_src1.reg);
876
877 /*
878 * If the integers are both in the same register, then there is
879 * nothing else to do because they are equal and we have already
880 * moved one into the result.
881 */
882 src1_vreg = mir_graph_->SRegToVReg(rl_src1.s_reg_low);
883 src2_vreg = mir_graph_->SRegToVReg(rl_src2.s_reg_low);
884 if (src1_vreg == src2_vreg) {
885 StoreValueWide(rl_dest, rl_result);
886 return true;
887 }
888
889 // Free registers to make some room for the second operand.
890 // But don't try to free ourselves or promoted registers.
891 if (res_vreg != src1_vreg &&
892 IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
893 FreeTemp(rl_src1.reg);
894 }
895 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
896
897 // Do we have a free register for intermediate calculations?
898 RegStorage tmp = AllocTemp(false);
899 if (tmp == RegStorage::InvalidReg()) {
900 /*
901 * No, will use 'edi'.
902 *
903 * As mentioned above we have 4 temporary and 2 promotable
904 * caller-save registers. Therefore, we assume that a free
905 * register can be allocated only if 'esi' and 'edi' are
906 * already used as operands. If number of promotable registers
907 * increases from 2 to 4 then our assumption fails and operand
908 * data is corrupted.
909 * Let's DCHECK it.
910 */
911 DCHECK(IsTemp(rl_src2.reg.GetLow()) &&
912 IsTemp(rl_src2.reg.GetHigh()) &&
913 IsTemp(rl_result.reg.GetLow()) &&
914 IsTemp(rl_result.reg.GetHigh()));
915 tmp = rs_rDI;
916 NewLIR1(kX86Push32R, tmp.GetReg());
917 }
918
919 // Now we are ready to do calculations.
920 OpRegReg(kOpMov, tmp, rl_result.reg.GetLow());
921 OpRegReg(kOpSub, tmp, rl_src2.reg.GetLow());
922 OpRegReg(kOpMov, tmp, rl_result.reg.GetHigh());
923 OpRegReg(kOpSbc, tmp, rl_src2.reg.GetHigh());
924
925 // Let's put pop 'edi' here to break a bit the dependency chain.
926 if (tmp == rs_rDI) {
927 NewLIR1(kX86Pop32R, tmp.GetReg());
928 }
929
930 // Conditionally move the other integer into the destination register.
931 ConditionCode cc = is_min ? kCondGe : kCondLt;
932 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetLow(), rl_src2.reg.GetLow());
933 OpCondRegReg(kOpCmov, cc, rl_result.reg.GetHigh(), rl_src2.reg.GetHigh());
934 StoreValueWide(rl_dest, rl_result);
935 return true;
Serban Constantinescu23abec92014-07-02 16:13:38 +0100936 }
937
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800938 // Get the two arguments to the invoke and place them in GP registers.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700939 RegLocation rl_src1 = info->args[0];
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700940 RegLocation rl_src2 = (is_long) ? info->args[2] : info->args[1];
941 rl_src1 = (is_long) ? LoadValueWide(rl_src1, kCoreReg) : LoadValue(rl_src1, kCoreReg);
942 rl_src2 = (is_long) ? LoadValueWide(rl_src2, kCoreReg) : LoadValue(rl_src2, kCoreReg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800943
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700944 RegLocation rl_dest = (is_long) ? InlineTargetWide(info) : InlineTarget(info);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700945 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800946
947 /*
948 * If the result register is the same as the second element, then we need to be careful.
949 * The reason is that the first copy will inadvertently clobber the second element with
950 * the first one thus yielding the wrong result. Thus we do a swap in that case.
951 */
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000952 if (rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800953 std::swap(rl_src1, rl_src2);
954 }
955
956 // Pick the first integer as min/max.
buzbee2700f7e2014-03-07 09:46:20 -0800957 OpRegCopy(rl_result.reg, rl_src1.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800958
959 // If the integers are both in the same register, then there is nothing else to do
960 // because they are equal and we have already moved one into the result.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000961 if (rl_src1.reg.GetReg() != rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800962 // It is possible we didn't pick correctly so do the actual comparison now.
buzbee2700f7e2014-03-07 09:46:20 -0800963 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800964
965 // Conditionally move the other integer into the destination register.
966 ConditionCode condition_code = is_min ? kCondGt : kCondLt;
buzbee2700f7e2014-03-07 09:46:20 -0800967 OpCondRegReg(kOpCmov, condition_code, rl_result.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800968 }
969
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700970 if (is_long) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000971 StoreValueWide(rl_dest, rl_result);
972 } else {
Vladimir Markoe508a202013-11-04 15:24:22 +0000973 StoreValue(rl_dest, rl_result);
974 }
975 return true;
976}
977
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700978bool X86Mir2Lir::GenInlinedPeek(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +0700979 RegLocation rl_src_address = info->args[0]; // long address
980 RegLocation rl_address;
981 if (!cu_->target64) {
982 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
983 rl_address = LoadValue(rl_src_address, kCoreReg);
984 } else {
985 rl_address = LoadValueWide(rl_src_address, kCoreReg);
986 }
987 RegLocation rl_dest = size == k64 ? InlineTargetWide(info) : InlineTarget(info);
988 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
989 // Unaligned access is allowed on x86.
990 LoadBaseDisp(rl_address.reg, 0, rl_result.reg, size, kNotVolatile);
991 if (size == k64) {
992 StoreValueWide(rl_dest, rl_result);
993 } else {
994 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
995 StoreValue(rl_dest, rl_result);
996 }
997 return true;
nikolay serdjukc5e4ce12014-06-10 17:07:10 +0700998}
999
Vladimir Markoe508a202013-11-04 15:24:22 +00001000bool X86Mir2Lir::GenInlinedPoke(CallInfo* info, OpSize size) {
Alexei Zavjaloveb24bae2014-07-08 16:27:17 +07001001 RegLocation rl_src_address = info->args[0]; // long address
1002 RegLocation rl_address;
1003 if (!cu_->target64) {
1004 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[0]
1005 rl_address = LoadValue(rl_src_address, kCoreReg);
1006 } else {
1007 rl_address = LoadValueWide(rl_src_address, kCoreReg);
1008 }
1009 RegLocation rl_src_value = info->args[2]; // [size] value
1010 RegLocation rl_value;
1011 if (size == k64) {
1012 // Unaligned access is allowed on x86.
1013 rl_value = LoadValueWide(rl_src_value, kCoreReg);
1014 } else {
1015 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
1016 // In 32-bit mode the only EAX..EDX registers can be used with Mov8MR.
1017 if (!cu_->target64 && size == kSignedByte) {
1018 rl_src_value = UpdateLocTyped(rl_src_value, kCoreReg);
1019 if (rl_src_value.location == kLocPhysReg && !IsByteRegister(rl_src_value.reg)) {
1020 RegStorage temp = AllocateByteRegister();
1021 OpRegCopy(temp, rl_src_value.reg);
1022 rl_value.reg = temp;
1023 } else {
1024 rl_value = LoadValue(rl_src_value, kCoreReg);
1025 }
1026 } else {
1027 rl_value = LoadValue(rl_src_value, kCoreReg);
1028 }
1029 }
1030 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size, kNotVolatile);
1031 return true;
Vladimir Markoe508a202013-11-04 15:24:22 +00001032}
1033
buzbee2700f7e2014-03-07 09:46:20 -08001034void X86Mir2Lir::OpLea(RegStorage r_base, RegStorage reg1, RegStorage reg2, int scale, int offset) {
1035 NewLIR5(kX86Lea32RA, r_base.GetReg(), reg1.GetReg(), reg2.GetReg(), scale, offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001036}
1037
Ian Rogersdd7624d2014-03-14 17:43:00 -07001038void X86Mir2Lir::OpTlsCmp(ThreadOffset<4> offset, int val) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001039 DCHECK_EQ(kX86, cu_->instruction_set);
1040 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
1041}
1042
1043void X86Mir2Lir::OpTlsCmp(ThreadOffset<8> offset, int val) {
1044 DCHECK_EQ(kX86_64, cu_->instruction_set);
Ian Rogers468532e2013-08-05 10:56:33 -07001045 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001046}
1047
buzbee2700f7e2014-03-07 09:46:20 -08001048static bool IsInReg(X86Mir2Lir *pMir2Lir, const RegLocation &rl, RegStorage reg) {
1049 return rl.reg.Valid() && rl.reg.GetReg() == reg.GetReg() && (pMir2Lir->IsLive(reg) || rl.home);
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001050}
1051
Vladimir Marko1c282e22013-11-21 14:49:47 +00001052bool X86Mir2Lir::GenInlinedCas(CallInfo* info, bool is_long, bool is_object) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +07001053 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001054 // Unused - RegLocation rl_src_unsafe = info->args[0];
1055 RegLocation rl_src_obj = info->args[1]; // Object - known non-null
1056 RegLocation rl_src_offset = info->args[2]; // long low
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001057 if (!cu_->target64) {
1058 rl_src_offset = NarrowRegLoc(rl_src_offset); // ignore high half in info->args[3]
1059 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001060 RegLocation rl_src_expected = info->args[4]; // int, long or Object
1061 // If is_long, high half is in info->args[5]
1062 RegLocation rl_src_new_value = info->args[is_long ? 6 : 5]; // int, long or Object
1063 // If is_long, high half is in info->args[7]
1064
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001065 if (is_long && cu_->target64) {
1066 // 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 -07001067 FlushReg(rs_r0q);
1068 Clobber(rs_r0q);
1069 LockTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001070
1071 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
1072 RegLocation rl_new_value = LoadValueWide(rl_src_new_value, kCoreReg);
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001073 RegLocation rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1074 LoadValueDirectWide(rl_src_expected, rs_r0q);
Andreas Gampeccc60262014-07-04 18:02:38 -07001075 NewLIR5(kX86LockCmpxchg64AR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1076 rl_new_value.reg.GetReg());
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001077
1078 // After a store we need to insert barrier in case of potential load. Since the
1079 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
Hans Boehm48f5c472014-06-27 14:50:10 -07001080 GenMemBarrier(kAnyAny);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001081
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001082 FreeTemp(rs_r0q);
nikolay serdjukc5e4ce12014-06-10 17:07:10 +07001083 } else if (is_long) {
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +07001084 // TODO: avoid unnecessary loads of SI and DI when the values are in registers.
1085 // TODO: CFI support.
Vladimir Marko70b797d2013-12-03 15:25:24 +00001086 FlushAllRegs();
1087 LockCallTemps();
buzbee091cc402014-03-31 10:14:40 -07001088 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
1089 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_rBX, rs_rCX);
buzbee2700f7e2014-03-07 09:46:20 -08001090 LoadValueDirectWideFixed(rl_src_expected, r_tmp1);
1091 LoadValueDirectWideFixed(rl_src_new_value, r_tmp2);
buzbee695d13a2014-04-19 13:32:20 -07001092 // FIXME: needs 64-bit update.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001093 const bool obj_in_di = IsInReg(this, rl_src_obj, rs_rDI);
1094 const bool obj_in_si = IsInReg(this, rl_src_obj, rs_rSI);
1095 DCHECK(!obj_in_si || !obj_in_di);
1096 const bool off_in_di = IsInReg(this, rl_src_offset, rs_rDI);
1097 const bool off_in_si = IsInReg(this, rl_src_offset, rs_rSI);
1098 DCHECK(!off_in_si || !off_in_di);
1099 // If obj/offset is in a reg, use that reg. Otherwise, use the empty reg.
1100 RegStorage rs_obj = obj_in_di ? rs_rDI : obj_in_si ? rs_rSI : !off_in_di ? rs_rDI : rs_rSI;
1101 RegStorage rs_off = off_in_si ? rs_rSI : off_in_di ? rs_rDI : !obj_in_si ? rs_rSI : rs_rDI;
1102 bool push_di = (!obj_in_di && !off_in_di) && (rs_obj == rs_rDI || rs_off == rs_rDI);
1103 bool push_si = (!obj_in_si && !off_in_si) && (rs_obj == rs_rSI || rs_off == rs_rSI);
1104 if (push_di) {
1105 NewLIR1(kX86Push32R, rs_rDI.GetReg());
1106 MarkTemp(rs_rDI);
1107 LockTemp(rs_rDI);
1108 }
1109 if (push_si) {
1110 NewLIR1(kX86Push32R, rs_rSI.GetReg());
1111 MarkTemp(rs_rSI);
1112 LockTemp(rs_rSI);
1113 }
1114 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1115 const size_t push_offset = (push_si ? 4u : 0u) + (push_di ? 4u : 0u);
1116 if (!obj_in_si && !obj_in_di) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07001117 LoadWordDisp(rs_rX86_SP, SRegOffset(rl_src_obj.s_reg_low) + push_offset, rs_obj);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001118 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1119 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1120 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1121 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1122 }
1123 if (!off_in_si && !off_in_di) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07001124 LoadWordDisp(rs_rX86_SP, SRegOffset(rl_src_offset.s_reg_low) + push_offset, rs_off);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001125 // Dalvik register annotation in LoadBaseIndexedDisp() used wrong offset. Fix it.
1126 DCHECK(!DECODE_ALIAS_INFO_WIDE(last_lir_insn_->flags.alias_info));
1127 int reg_id = DECODE_ALIAS_INFO_REG(last_lir_insn_->flags.alias_info) - push_offset / 4u;
1128 AnnotateDalvikRegAccess(last_lir_insn_, reg_id, true, false);
1129 }
1130 NewLIR4(kX86LockCmpxchg64A, rs_obj.GetReg(), rs_off.GetReg(), 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001131
Hans Boehm48f5c472014-06-27 14:50:10 -07001132 // After a store we need to insert barrier to prevent reordering with either
1133 // earlier or later memory accesses. Since
1134 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1135 // and it will be associated with the cmpxchg instruction, preventing both.
1136 GenMemBarrier(kAnyAny);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001137
1138 if (push_si) {
1139 FreeTemp(rs_rSI);
1140 UnmarkTemp(rs_rSI);
1141 NewLIR1(kX86Pop32R, rs_rSI.GetReg());
1142 }
1143 if (push_di) {
1144 FreeTemp(rs_rDI);
1145 UnmarkTemp(rs_rDI);
1146 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
1147 }
Vladimir Marko70b797d2013-12-03 15:25:24 +00001148 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +00001149 } else {
1150 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -08001151 FlushReg(rs_r0);
buzbee091cc402014-03-31 10:14:40 -07001152 Clobber(rs_r0);
buzbee2700f7e2014-03-07 09:46:20 -08001153 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001154
buzbeea0cd2d72014-06-01 09:33:49 -07001155 RegLocation rl_object = LoadValue(rl_src_obj, kRefReg);
1156 RegLocation rl_new_value = LoadValue(rl_src_new_value);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001157
1158 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
1159 // Mark card for object assuming new value is stored.
buzbee091cc402014-03-31 10:14:40 -07001160 FreeTemp(rs_r0); // Temporarily release EAX for MarkGCCard().
buzbee2700f7e2014-03-07 09:46:20 -08001161 MarkGCCard(rl_new_value.reg, rl_object.reg);
buzbee091cc402014-03-31 10:14:40 -07001162 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001163 }
1164
Chao-ying Fu021b60f2014-07-09 11:32:31 -07001165 RegLocation rl_offset;
1166 if (cu_->target64) {
1167 rl_offset = LoadValueWide(rl_src_offset, kCoreReg);
1168 } else {
1169 rl_offset = LoadValue(rl_src_offset, kCoreReg);
1170 }
buzbee2700f7e2014-03-07 09:46:20 -08001171 LoadValueDirect(rl_src_expected, rs_r0);
Andreas Gampeccc60262014-07-04 18:02:38 -07001172 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0,
1173 rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +00001174
Hans Boehm48f5c472014-06-27 14:50:10 -07001175 // After a store we need to insert barrier to prevent reordering with either
1176 // earlier or later memory accesses. Since
1177 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated,
1178 // and it will be associated with the cmpxchg instruction, preventing both.
1179 GenMemBarrier(kAnyAny);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -08001180
buzbee091cc402014-03-31 10:14:40 -07001181 FreeTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +00001182 }
1183
1184 // Convert ZF to boolean
1185 RegLocation rl_dest = InlineTarget(info); // boolean place for result
1186 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001187 RegStorage result_reg = rl_result.reg;
1188
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001189 // For 32-bit, SETcc only works with EAX..EDX.
1190 if (!IsByteRegister(result_reg)) {
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001191 result_reg = AllocateByteRegister();
Ian Rogers0f9b9c52014-06-09 01:32:12 -07001192 }
1193 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondZ);
1194 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), result_reg.GetReg());
1195 if (IsTemp(result_reg)) {
1196 FreeTemp(result_reg);
1197 }
Vladimir Markoc29bb612013-11-27 16:47:25 +00001198 StoreValue(rl_dest, rl_result);
1199 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001200}
1201
Yixin Shou8c914c02014-07-28 14:17:09 -04001202void X86Mir2Lir::SwapBits(RegStorage result_reg, int shift, int32_t value) {
1203 RegStorage r_temp = AllocTemp();
1204 OpRegCopy(r_temp, result_reg);
1205 OpRegImm(kOpLsr, result_reg, shift);
1206 OpRegImm(kOpAnd, r_temp, value);
1207 OpRegImm(kOpAnd, result_reg, value);
1208 OpRegImm(kOpLsl, r_temp, shift);
1209 OpRegReg(kOpOr, result_reg, r_temp);
1210 FreeTemp(r_temp);
1211}
1212
1213void X86Mir2Lir::SwapBits64(RegStorage result_reg, int shift, int64_t value) {
1214 RegStorage r_temp = AllocTempWide();
1215 OpRegCopy(r_temp, result_reg);
1216 OpRegImm(kOpLsr, result_reg, shift);
1217 RegStorage r_value = AllocTempWide();
1218 LoadConstantWide(r_value, value);
1219 OpRegReg(kOpAnd, r_temp, r_value);
1220 OpRegReg(kOpAnd, result_reg, r_value);
1221 OpRegImm(kOpLsl, r_temp, shift);
1222 OpRegReg(kOpOr, result_reg, r_temp);
1223 FreeTemp(r_temp);
1224 FreeTemp(r_value);
1225}
1226
1227bool X86Mir2Lir::GenInlinedReverseBits(CallInfo* info, OpSize size) {
1228 RegLocation rl_src_i = info->args[0];
1229 RegLocation rl_i = (size == k64) ? LoadValueWide(rl_src_i, kCoreReg)
1230 : LoadValue(rl_src_i, kCoreReg);
1231 RegLocation rl_dest = (size == k64) ? InlineTargetWide(info) : InlineTarget(info);
1232 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1233 if (size == k64) {
1234 if (cu_->instruction_set == kX86_64) {
1235 /* Use one bswap instruction to reverse byte order first and then use 3 rounds of
1236 swapping bits to reverse bits in a long number x. Using bswap to save instructions
1237 compared to generic luni implementation which has 5 rounds of swapping bits.
1238 x = bswap x
1239 x = (x & 0x5555555555555555) << 1 | (x >> 1) & 0x5555555555555555;
1240 x = (x & 0x3333333333333333) << 2 | (x >> 2) & 0x3333333333333333;
1241 x = (x & 0x0F0F0F0F0F0F0F0F) << 4 | (x >> 4) & 0x0F0F0F0F0F0F0F0F;
1242 */
1243 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1244 SwapBits64(rl_result.reg, 1, 0x5555555555555555);
1245 SwapBits64(rl_result.reg, 2, 0x3333333333333333);
1246 SwapBits64(rl_result.reg, 4, 0x0f0f0f0f0f0f0f0f);
1247 StoreValueWide(rl_dest, rl_result);
1248 return true;
1249 }
1250 RegStorage r_i_low = rl_i.reg.GetLow();
1251 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1252 // First REV shall clobber rl_result.reg.GetLowReg(), save the value in a temp for the second
1253 // REV.
1254 r_i_low = AllocTemp();
1255 OpRegCopy(r_i_low, rl_i.reg);
1256 }
1257 OpRegReg(kOpRev, rl_result.reg.GetLow(), rl_i.reg.GetHigh());
1258 OpRegReg(kOpRev, rl_result.reg.GetHigh(), r_i_low);
1259 if (rl_i.reg.GetLowReg() == rl_result.reg.GetLowReg()) {
1260 FreeTemp(r_i_low);
1261 }
1262 SwapBits(rl_result.reg.GetLow(), 1, 0x55555555);
1263 SwapBits(rl_result.reg.GetLow(), 2, 0x33333333);
1264 SwapBits(rl_result.reg.GetLow(), 4, 0x0f0f0f0f);
1265 SwapBits(rl_result.reg.GetHigh(), 1, 0x55555555);
1266 SwapBits(rl_result.reg.GetHigh(), 2, 0x33333333);
1267 SwapBits(rl_result.reg.GetHigh(), 4, 0x0f0f0f0f);
1268 StoreValueWide(rl_dest, rl_result);
1269 } else {
1270 OpRegReg(kOpRev, rl_result.reg, rl_i.reg);
1271 SwapBits(rl_result.reg, 1, 0x55555555);
1272 SwapBits(rl_result.reg, 2, 0x33333333);
1273 SwapBits(rl_result.reg, 4, 0x0f0f0f0f);
1274 StoreValue(rl_dest, rl_result);
1275 }
1276 return true;
1277}
1278
buzbee2700f7e2014-03-07 09:46:20 -08001279LIR* X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell55d0eac2014-02-06 11:02:52 -08001280 CHECK(base_of_code_ != nullptr);
1281
1282 // Address the start of the method
1283 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07001284 if (rl_method.wide) {
1285 LoadValueDirectWideFixed(rl_method, reg);
1286 } else {
1287 LoadValueDirectFixed(rl_method, reg);
1288 }
Mark Mendell55d0eac2014-02-06 11:02:52 -08001289 store_method_addr_used_ = true;
1290
1291 // Load the proper value from the literal area.
1292 // We don't know the proper offset for the value, so pick one that will force
1293 // 4 byte offset. We will fix this up in the assembler later to have the right
1294 // value.
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001295 ScopedMemRefType mem_ref_type(this, ResourceMask::kLiteral);
buzbee2700f7e2014-03-07 09:46:20 -08001296 LIR *res = RawLIR(current_dalvik_offset_, kX86Mov32RM, reg.GetReg(), reg.GetReg(), 256,
1297 0, 0, target);
Mark Mendell55d0eac2014-02-06 11:02:52 -08001298 res->target = target;
1299 res->flags.fixup = kFixupLoad;
Mark Mendell55d0eac2014-02-06 11:02:52 -08001300 store_method_addr_used_ = true;
1301 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001302}
1303
buzbee2700f7e2014-03-07 09:46:20 -08001304LIR* X86Mir2Lir::OpVldm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001305 LOG(FATAL) << "Unexpected use of OpVldm for x86";
1306 return NULL;
1307}
1308
buzbee2700f7e2014-03-07 09:46:20 -08001309LIR* X86Mir2Lir::OpVstm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001310 LOG(FATAL) << "Unexpected use of OpVstm for x86";
1311 return NULL;
1312}
1313
1314void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
1315 RegLocation rl_result, int lit,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001316 int first_bit, int second_bit) {
buzbee2700f7e2014-03-07 09:46:20 -08001317 RegStorage t_reg = AllocTemp();
1318 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
1319 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001320 FreeTemp(t_reg);
1321 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -08001322 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001323 }
1324}
1325
Mingyao Yange643a172014-04-08 11:02:52 -07001326void X86Mir2Lir::GenDivZeroCheckWide(RegStorage reg) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001327 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001328 DCHECK(reg.Is64Bit());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001329
Chao-ying Fua0147762014-06-06 18:38:49 -07001330 NewLIR2(kX86Cmp64RI8, reg.GetReg(), 0);
1331 } else {
1332 DCHECK(reg.IsPair());
1333
1334 // We are not supposed to clobber the incoming storage, so allocate a temporary.
1335 RegStorage t_reg = AllocTemp();
1336 // Doing an OR is a quick way to check if both registers are zero. This will set the flags.
1337 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
1338 // The temp is no longer needed so free it at this time.
1339 FreeTemp(t_reg);
1340 }
Razvan A Lupusoru090dd442013-12-20 14:35:03 -08001341
1342 // In case of zero, throw ArithmeticException.
Mingyao Yange643a172014-04-08 11:02:52 -07001343 GenDivZeroCheck(kCondEq);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001344}
1345
Mingyao Yang80365d92014-04-18 12:10:58 -07001346void X86Mir2Lir::GenArrayBoundsCheck(RegStorage index,
1347 RegStorage array_base,
1348 int len_offset) {
1349 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1350 public:
1351 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
1352 RegStorage index, RegStorage array_base, int32_t len_offset)
1353 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
1354 index_(index), array_base_(array_base), len_offset_(len_offset) {
1355 }
1356
1357 void Compile() OVERRIDE {
1358 m2l_->ResetRegPool();
1359 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001360 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001361
1362 RegStorage new_index = index_;
1363 // Move index out of kArg1, either directly to kArg0, or to kArg2.
Serguei Katkov4c7cc152014-06-24 00:50:02 +07001364 // TODO: clean-up to check not a number but with type
Andreas Gampeccc60262014-07-04 18:02:38 -07001365 if (index_ == m2l_->TargetReg(kArg1, kNotWide)) {
1366 if (array_base_ == m2l_->TargetReg(kArg0, kRef)) {
1367 m2l_->OpRegCopy(m2l_->TargetReg(kArg2, kNotWide), index_);
1368 new_index = m2l_->TargetReg(kArg2, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001369 } else {
Andreas Gampeccc60262014-07-04 18:02:38 -07001370 m2l_->OpRegCopy(m2l_->TargetReg(kArg0, kNotWide), index_);
1371 new_index = m2l_->TargetReg(kArg0, kNotWide);
Mingyao Yang80365d92014-04-18 12:10:58 -07001372 }
1373 }
1374 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001375 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1376 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1377 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, new_index,
1378 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001379 }
1380
1381 private:
1382 const RegStorage index_;
1383 const RegStorage array_base_;
1384 const int32_t len_offset_;
1385 };
1386
1387 OpRegMem(kOpCmp, index, array_base, len_offset);
Dave Allison69dfe512014-07-11 17:11:58 +00001388 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001389 LIR* branch = OpCondBranch(kCondUge, nullptr);
1390 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1391 index, array_base, len_offset));
1392}
1393
1394void X86Mir2Lir::GenArrayBoundsCheck(int32_t index,
1395 RegStorage array_base,
1396 int32_t len_offset) {
1397 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
1398 public:
1399 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
1400 int32_t index, RegStorage array_base, int32_t len_offset)
1401 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
1402 index_(index), array_base_(array_base), len_offset_(len_offset) {
1403 }
1404
1405 void Compile() OVERRIDE {
1406 m2l_->ResetRegPool();
1407 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -07001408 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -07001409
1410 // Load array length to kArg1.
Andreas Gampe98430592014-07-27 19:44:50 -07001411 X86Mir2Lir* x86_m2l = static_cast<X86Mir2Lir*>(m2l_);
1412 x86_m2l->OpRegMem(kOpMov, m2l_->TargetReg(kArg1, kNotWide), array_base_, len_offset_);
1413 x86_m2l->LoadConstant(m2l_->TargetReg(kArg0, kNotWide), index_);
1414 x86_m2l->CallRuntimeHelperRegReg(kQuickThrowArrayBounds, m2l_->TargetReg(kArg0, kNotWide),
1415 m2l_->TargetReg(kArg1, kNotWide), true);
Mingyao Yang80365d92014-04-18 12:10:58 -07001416 }
1417
1418 private:
1419 const int32_t index_;
1420 const RegStorage array_base_;
1421 const int32_t len_offset_;
1422 };
1423
1424 NewLIR3(IS_SIMM8(index) ? kX86Cmp32MI8 : kX86Cmp32MI, array_base.GetReg(), len_offset, index);
Dave Allison69dfe512014-07-11 17:11:58 +00001425 MarkPossibleNullPointerException(0);
Mingyao Yang80365d92014-04-18 12:10:58 -07001426 LIR* branch = OpCondBranch(kCondLs, nullptr);
1427 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
1428 index, array_base, len_offset));
1429}
1430
Brian Carlstrom7940e442013-07-12 13:46:57 -07001431// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001432LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
buzbee33ae5582014-06-12 14:56:32 -07001433 if (cu_->target64) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07001434 OpTlsCmp(Thread::ThreadFlagsOffset<8>(), 0);
1435 } else {
1436 OpTlsCmp(Thread::ThreadFlagsOffset<4>(), 0);
1437 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001438 return OpCondBranch((target == NULL) ? kCondNe : kCondEq, target);
1439}
1440
1441// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -08001442LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001443 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -08001444 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001445}
1446
buzbee11b63d12013-08-27 07:34:17 -07001447bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001448 RegLocation rl_src, RegLocation rl_dest, int lit) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001449 LOG(FATAL) << "Unexpected use of smallLiteralDive in x86";
1450 return false;
1451}
1452
Ian Rogerse2143c02014-03-28 08:47:16 -07001453bool X86Mir2Lir::EasyMultiply(RegLocation rl_src, RegLocation rl_dest, int lit) {
1454 LOG(FATAL) << "Unexpected use of easyMultiply in x86";
1455 return false;
1456}
1457
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001458LIR* X86Mir2Lir::OpIT(ConditionCode cond, const char* guide) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001459 LOG(FATAL) << "Unexpected use of OpIT in x86";
1460 return NULL;
1461}
1462
Dave Allison3da67a52014-04-02 17:03:45 -07001463void X86Mir2Lir::OpEndIT(LIR* it) {
1464 LOG(FATAL) << "Unexpected use of OpEndIT in x86";
1465}
1466
buzbee2700f7e2014-03-07 09:46:20 -08001467void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001468 switch (val) {
1469 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001470 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001471 break;
1472 case 1:
1473 OpRegCopy(dest, src);
1474 break;
1475 default:
1476 OpRegRegImm(kOpMul, dest, src, val);
1477 break;
1478 }
1479}
1480
buzbee2700f7e2014-03-07 09:46:20 -08001481void X86Mir2Lir::GenImulMemImm(RegStorage dest, int sreg, int displacement, int val) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001482 // All memory accesses below reference dalvik regs.
1483 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1484
Mark Mendell4708dcd2014-01-22 09:05:18 -08001485 LIR *m;
1486 switch (val) {
1487 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001488 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001489 break;
1490 case 1:
Andreas Gampe3c12c512014-06-24 18:46:29 +00001491 LoadBaseDisp(rs_rX86_SP, displacement, dest, k32, kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001492 break;
1493 default:
buzbee091cc402014-03-31 10:14:40 -07001494 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(),
1495 rs_rX86_SP.GetReg(), displacement, val);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001496 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
1497 break;
1498 }
1499}
1500
Andreas Gampec76c6142014-08-04 16:30:03 -07001501void X86Mir2Lir::GenArithOpLong(Instruction::Code opcode, RegLocation rl_dest, RegLocation rl_src1,
1502 RegLocation rl_src2) {
1503 if (!cu_->target64) {
1504 // Some x86 32b ops are fallback.
1505 switch (opcode) {
1506 case Instruction::NOT_LONG:
1507 case Instruction::DIV_LONG:
1508 case Instruction::DIV_LONG_2ADDR:
1509 case Instruction::REM_LONG:
1510 case Instruction::REM_LONG_2ADDR:
1511 Mir2Lir::GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
1512 return;
1513
1514 default:
1515 // Everything else we can handle.
1516 break;
1517 }
1518 }
1519
1520 switch (opcode) {
1521 case Instruction::NOT_LONG:
1522 GenNotLong(rl_dest, rl_src2);
1523 return;
1524
1525 case Instruction::ADD_LONG:
1526 case Instruction::ADD_LONG_2ADDR:
1527 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1528 return;
1529
1530 case Instruction::SUB_LONG:
1531 case Instruction::SUB_LONG_2ADDR:
1532 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1533 return;
1534
1535 case Instruction::MUL_LONG:
1536 case Instruction::MUL_LONG_2ADDR:
1537 GenMulLong(opcode, rl_dest, rl_src1, rl_src2);
1538 return;
1539
1540 case Instruction::DIV_LONG:
1541 case Instruction::DIV_LONG_2ADDR:
1542 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ true);
1543 return;
1544
1545 case Instruction::REM_LONG:
1546 case Instruction::REM_LONG_2ADDR:
1547 GenDivRemLong(opcode, rl_dest, rl_src1, rl_src2, /*is_div*/ false);
1548 return;
1549
1550 case Instruction::AND_LONG_2ADDR:
1551 case Instruction::AND_LONG:
1552 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1553 return;
1554
1555 case Instruction::OR_LONG:
1556 case Instruction::OR_LONG_2ADDR:
1557 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1558 return;
1559
1560 case Instruction::XOR_LONG:
1561 case Instruction::XOR_LONG_2ADDR:
1562 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1563 return;
1564
1565 case Instruction::NEG_LONG:
1566 GenNegLong(rl_dest, rl_src2);
1567 return;
1568
1569 default:
1570 LOG(FATAL) << "Invalid long arith op";
1571 return;
1572 }
1573}
1574
1575bool X86Mir2Lir::GenMulLongConst(RegLocation rl_dest, RegLocation rl_src1, int64_t val) {
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001576 // All memory accesses below reference dalvik regs.
1577 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1578
Andreas Gampec76c6142014-08-04 16:30:03 -07001579 if (val == 0) {
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001580 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Andreas Gampec76c6142014-08-04 16:30:03 -07001581 if (cu_->target64) {
1582 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Alexei Zavjalovd8191d02014-06-11 18:26:40 +07001583 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001584 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
1585 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001586 }
Andreas Gampec76c6142014-08-04 16:30:03 -07001587 StoreValueWide(rl_dest, rl_result);
1588 return true;
1589 } else if (val == 1) {
1590 StoreValueWide(rl_dest, rl_src1);
1591 return true;
1592 } else if (val == 2) {
1593 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1);
1594 return true;
1595 } else if (IsPowerOfTwo(val)) {
1596 int shift_amount = LowestSetBit(val);
1597 if (!BadOverlap(rl_src1, rl_dest)) {
1598 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1599 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest, rl_src1,
1600 shift_amount);
1601 StoreValueWide(rl_dest, rl_result);
1602 return true;
1603 }
1604 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001605
Andreas Gampec76c6142014-08-04 16:30:03 -07001606 // Okay, on 32b just bite the bullet and do it, still better than the general case.
1607 if (!cu_->target64) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001608 int32_t val_lo = Low32Bits(val);
1609 int32_t val_hi = High32Bits(val);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001610 // Prepare for explicit register usage.
1611 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
buzbee30adc732014-05-09 15:10:18 -07001612 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001613 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1614 int displacement = SRegOffset(rl_src1.s_reg_low);
1615
1616 // ECX <- 1H * 2L
1617 // EAX <- 1L * 2H
1618 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001619 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
1620 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001621 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001622 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
1623 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001624 }
1625
1626 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001627 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001628
1629 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001630 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001631
1632 // EDX:EAX <- 2L * 1L (double precision)
1633 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001634 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001635 } else {
buzbee091cc402014-03-31 10:14:40 -07001636 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001637 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1638 true /* is_load */, true /* is_64bit */);
1639 }
1640
1641 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001642 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001643
1644 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001645 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
1646 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001647 StoreValueWide(rl_dest, rl_result);
Andreas Gampec76c6142014-08-04 16:30:03 -07001648 return true;
1649 }
1650 return false;
1651}
1652
1653void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
1654 RegLocation rl_src2) {
1655 if (rl_src1.is_const) {
1656 std::swap(rl_src1, rl_src2);
1657 }
1658
1659 if (rl_src2.is_const) {
1660 if (GenMulLongConst(rl_dest, rl_src1, mir_graph_->ConstantValueWide(rl_src2))) {
1661 return;
1662 }
1663 }
1664
1665 // All memory accesses below reference dalvik regs.
1666 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
1667
1668 if (cu_->target64) {
1669 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1670 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1671 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1672 if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1673 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1674 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
1675 } else if (rl_result.reg.GetReg() != rl_src1.reg.GetReg() &&
1676 rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
1677 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src1.reg.GetReg());
1678 } else if (rl_result.reg.GetReg() == rl_src1.reg.GetReg() &&
1679 rl_result.reg.GetReg() != rl_src2.reg.GetReg()) {
1680 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1681 } else {
1682 OpRegCopy(rl_result.reg, rl_src1.reg);
1683 NewLIR2(kX86Imul64RR, rl_result.reg.GetReg(), rl_src2.reg.GetReg());
1684 }
1685 StoreValueWide(rl_dest, rl_result);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001686 return;
1687 }
1688
Andreas Gampec76c6142014-08-04 16:30:03 -07001689 // Not multiplying by a constant. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001690 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1691 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1692 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1693
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001694 // Prepare for explicit register usage.
1695 ExplicitTempRegisterLock(this, 3, &rs_r0, &rs_r1, &rs_r2);
buzbee30adc732014-05-09 15:10:18 -07001696 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
1697 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001698
1699 // At this point, the VRs are in their home locations.
1700 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1701 bool src2_in_reg = rl_src2.location == kLocPhysReg;
1702
1703 // ECX <- 1H
1704 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001705 NewLIR2(kX86Mov32RR, rs_r1.GetReg(), rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001706 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001707 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1, k32,
1708 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001709 }
1710
Mark Mendellde99bba2014-02-14 12:15:02 -08001711 if (is_square) {
1712 // Take advantage of the fact that the values are the same.
1713 // ECX <- ECX * 2L (1H * 2L)
1714 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001715 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001716 } else {
1717 int displacement = SRegOffset(rl_src2.s_reg_low);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07001718 LIR* m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
buzbee091cc402014-03-31 10:14:40 -07001719 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001720 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1721 true /* is_load */, true /* is_64bit */);
1722 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001723
Mark Mendellde99bba2014-02-14 12:15:02 -08001724 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001725 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001726 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001727 // EAX <- 2H
1728 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001729 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001730 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001731 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0, k32,
1732 kNotVolatile);
Mark Mendellde99bba2014-02-14 12:15:02 -08001733 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001734
Mark Mendellde99bba2014-02-14 12:15:02 -08001735 // EAX <- EAX * 1L (2H * 1L)
1736 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001737 NewLIR2(kX86Imul32RR, rs_r0.GetReg(), rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001738 } else {
1739 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001740 LIR *m = NewLIR3(kX86Imul32RM, rs_r0.GetReg(), rs_rX86_SP.GetReg(),
1741 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001742 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1743 true /* is_load */, true /* is_64bit */);
1744 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001745
Mark Mendellde99bba2014-02-14 12:15:02 -08001746 // ECX <- ECX * 2L (1H * 2L)
1747 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001748 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001749 } else {
1750 int displacement = SRegOffset(rl_src2.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001751 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
1752 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001753 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1754 true /* is_load */, true /* is_64bit */);
1755 }
1756
1757 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001758 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001759 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001760
1761 // EAX <- 2L
1762 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001763 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001764 } else {
Andreas Gampe3c12c512014-06-24 18:46:29 +00001765 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0, k32,
1766 kNotVolatile);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001767 }
1768
1769 // EDX:EAX <- 2L * 1L (double precision)
1770 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001771 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001772 } else {
1773 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001774 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001775 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1776 true /* is_load */, true /* is_64bit */);
1777 }
1778
1779 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001780 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001781
1782 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001783 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
buzbee2700f7e2014-03-07 09:46:20 -08001784 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001785 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001786}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001787
1788void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1789 Instruction::Code op) {
1790 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1791 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1792 if (rl_src.location == kLocPhysReg) {
1793 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001794 // But we must ensure that rl_src is in pair
Elena Sayapinadd644502014-07-01 18:39:52 +07001795 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001796 NewLIR2(x86op, rl_dest.reg.GetReg(), rl_src.reg.GetReg());
1797 } else {
1798 rl_src = LoadValueWide(rl_src, kCoreReg);
1799 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
1800 // The registers are the same, so we would clobber it before the use.
1801 RegStorage temp_reg = AllocTemp();
1802 OpRegCopy(temp_reg, rl_dest.reg);
1803 rl_src.reg.SetHighReg(temp_reg.GetReg());
1804 }
1805 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001806
Chao-ying Fua0147762014-06-06 18:38:49 -07001807 x86op = GetOpcode(op, rl_dest, rl_src, true);
1808 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
1809 FreeTemp(rl_src.reg); // ???
1810 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001811 return;
1812 }
1813
1814 // RHS is in memory.
1815 DCHECK((rl_src.location == kLocDalvikFrame) ||
1816 (rl_src.location == kLocCompilerTemp));
Chao-ying Fua77ee512014-07-01 17:43:41 -07001817 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001818 int displacement = SRegOffset(rl_src.s_reg_low);
1819
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001820 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Andreas Gampeccc60262014-07-04 18:02:38 -07001821 LIR *lir = NewLIR3(x86op, cu_->target64 ? rl_dest.reg.GetReg() : rl_dest.reg.GetLowReg(),
1822 r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001823 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1824 true /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001825 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001826 x86op = GetOpcode(op, rl_dest, rl_src, true);
1827 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001828 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1829 true /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001830 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001831}
1832
Mark Mendelle02d48f2014-01-15 11:19:23 -08001833void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
buzbee30adc732014-05-09 15:10:18 -07001834 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001835 if (rl_dest.location == kLocPhysReg) {
1836 // Ensure we are in a register pair
1837 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1838
buzbee30adc732014-05-09 15:10:18 -07001839 rl_src = UpdateLocWideTyped(rl_src, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001840 GenLongRegOrMemOp(rl_result, rl_src, op);
1841 StoreFinalValueWide(rl_dest, rl_result);
1842 return;
1843 }
1844
1845 // It wasn't in registers, so it better be in memory.
1846 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1847 (rl_dest.location == kLocCompilerTemp));
1848 rl_src = LoadValueWide(rl_src, kCoreReg);
1849
1850 // Operate directly into memory.
1851 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
Chao-ying Fua77ee512014-07-01 17:43:41 -07001852 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001853 int displacement = SRegOffset(rl_dest.s_reg_low);
1854
Vladimir Marko8dea81c2014-06-06 14:50:36 +01001855 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07001856 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET,
Elena Sayapinadd644502014-07-01 18:39:52 +07001857 cu_->target64 ? rl_src.reg.GetReg() : rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001858 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001859 true /* is_load */, true /* is64bit */);
1860 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001861 false /* is_load */, true /* is64bit */);
Elena Sayapinadd644502014-07-01 18:39:52 +07001862 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001863 x86op = GetOpcode(op, rl_dest, rl_src, true);
1864 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07001865 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1866 true /* is_load */, true /* is64bit */);
1867 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1868 false /* is_load */, true /* is64bit */);
Chao-ying Fua0147762014-06-06 18:38:49 -07001869 }
buzbee2700f7e2014-03-07 09:46:20 -08001870 FreeTemp(rl_src.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001871}
1872
Mark Mendelle02d48f2014-01-15 11:19:23 -08001873void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
1874 RegLocation rl_src2, Instruction::Code op,
1875 bool is_commutative) {
1876 // Is this really a 2 operand operation?
1877 switch (op) {
1878 case Instruction::ADD_LONG_2ADDR:
1879 case Instruction::SUB_LONG_2ADDR:
1880 case Instruction::AND_LONG_2ADDR:
1881 case Instruction::OR_LONG_2ADDR:
1882 case Instruction::XOR_LONG_2ADDR:
Mark Mendelle87f9b52014-04-30 14:13:18 -04001883 if (GenerateTwoOperandInstructions()) {
1884 GenLongArith(rl_dest, rl_src2, op);
1885 return;
1886 }
1887 break;
1888
Mark Mendelle02d48f2014-01-15 11:19:23 -08001889 default:
1890 break;
1891 }
1892
1893 if (rl_dest.location == kLocPhysReg) {
1894 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
1895
1896 // We are about to clobber the LHS, so it needs to be a temp.
1897 rl_result = ForceTempWide(rl_result);
1898
1899 // Perform the operation using the RHS.
buzbee30adc732014-05-09 15:10:18 -07001900 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001901 GenLongRegOrMemOp(rl_result, rl_src2, op);
1902
1903 // And now record that the result is in the temp.
1904 StoreFinalValueWide(rl_dest, rl_result);
1905 return;
1906 }
1907
1908 // It wasn't in registers, so it better be in memory.
1909 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1910 (rl_dest.location == kLocCompilerTemp));
buzbee30adc732014-05-09 15:10:18 -07001911 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
1912 rl_src2 = UpdateLocWideTyped(rl_src2, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001913
1914 // Get one of the source operands into temporary register.
1915 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Elena Sayapinadd644502014-07-01 18:39:52 +07001916 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001917 if (IsTemp(rl_src1.reg)) {
1918 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1919 } else if (is_commutative) {
1920 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1921 // We need at least one of them to be a temporary.
1922 if (!IsTemp(rl_src2.reg)) {
1923 rl_src1 = ForceTempWide(rl_src1);
1924 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1925 } else {
1926 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1927 StoreFinalValueWide(rl_dest, rl_src2);
1928 return;
1929 }
1930 } else {
1931 // Need LHS to be the temp.
Mark Mendelle02d48f2014-01-15 11:19:23 -08001932 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07001933 GenLongRegOrMemOp(rl_src1, rl_src2, op);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001934 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001935 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07001936 if (IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
1937 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1938 } else if (is_commutative) {
1939 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1940 // We need at least one of them to be a temporary.
1941 if (!(IsTemp(rl_src2.reg.GetLow()) && IsTemp(rl_src2.reg.GetHigh()))) {
1942 rl_src1 = ForceTempWide(rl_src1);
1943 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1944 } else {
1945 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1946 StoreFinalValueWide(rl_dest, rl_src2);
1947 return;
1948 }
1949 } else {
1950 // Need LHS to be the temp.
1951 rl_src1 = ForceTempWide(rl_src1);
1952 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1953 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001954 }
1955
1956 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001957}
1958
Serban Constantinescued65c5e2014-05-22 15:10:18 +01001959void X86Mir2Lir::GenNotLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07001960 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07001961 rl_src = LoadValueWide(rl_src, kCoreReg);
1962 RegLocation rl_result;
1963 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1964 OpRegCopy(rl_result.reg, rl_src.reg);
1965 OpReg(kOpNot, rl_result.reg);
1966 StoreValueWide(rl_dest, rl_result);
1967 } else {
1968 LOG(FATAL) << "Unexpected use GenNotLong()";
1969 }
Serban Constantinescued65c5e2014-05-22 15:10:18 +01001970}
1971
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07001972void X86Mir2Lir::GenDivRemLongLit(RegLocation rl_dest, RegLocation rl_src,
1973 int64_t imm, bool is_div) {
1974 if (imm == 0) {
1975 GenDivZeroException();
1976 } else if (imm == 1) {
1977 if (is_div) {
1978 // x / 1 == x.
1979 StoreValueWide(rl_dest, rl_src);
1980 } else {
1981 // x % 1 == 0.
1982 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1983 LoadConstantWide(rl_result.reg, 0);
1984 StoreValueWide(rl_dest, rl_result);
1985 }
1986 } else if (imm == -1) { // handle 0x8000000000000000 / -1 special case.
1987 if (is_div) {
1988 rl_src = LoadValueWide(rl_src, kCoreReg);
1989 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1990 RegStorage rs_temp = AllocTempWide();
1991
1992 OpRegCopy(rl_result.reg, rl_src.reg);
1993 LoadConstantWide(rs_temp, 0x8000000000000000);
1994
1995 // If x == MIN_LONG, return MIN_LONG.
1996 OpRegReg(kOpCmp, rl_src.reg, rs_temp);
1997 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
1998
1999 // For x != MIN_LONG, x / -1 == -x.
2000 OpReg(kOpNeg, rl_result.reg);
2001
2002 minint_branch->target = NewLIR0(kPseudoTargetLabel);
2003 FreeTemp(rs_temp);
2004 StoreValueWide(rl_dest, rl_result);
2005 } else {
2006 // x % -1 == 0.
2007 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2008 LoadConstantWide(rl_result.reg, 0);
2009 StoreValueWide(rl_dest, rl_result);
2010 }
2011 } else if (is_div && IsPowerOfTwo(std::abs(imm))) {
2012 // Division using shifting.
2013 rl_src = LoadValueWide(rl_src, kCoreReg);
2014 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2015 if (IsSameReg(rl_result.reg, rl_src.reg)) {
2016 RegStorage rs_temp = AllocTypedTempWide(false, kCoreReg);
2017 rl_result.reg.SetReg(rs_temp.GetReg());
2018 }
2019 LoadConstantWide(rl_result.reg, std::abs(imm) - 1);
2020 OpRegReg(kOpAdd, rl_result.reg, rl_src.reg);
2021 NewLIR2(kX86Test64RR, rl_src.reg.GetReg(), rl_src.reg.GetReg());
2022 OpCondRegReg(kOpCmov, kCondPl, rl_result.reg, rl_src.reg);
2023 int shift_amount = LowestSetBit(imm);
2024 OpRegImm(kOpAsr, rl_result.reg, shift_amount);
2025 if (imm < 0) {
2026 OpReg(kOpNeg, rl_result.reg);
2027 }
2028 StoreValueWide(rl_dest, rl_result);
2029 } else {
2030 CHECK(imm <= -2 || imm >= 2);
2031
2032 FlushReg(rs_r0q);
2033 Clobber(rs_r0q);
2034 LockTemp(rs_r0q);
2035 FlushReg(rs_r2q);
2036 Clobber(rs_r2q);
2037 LockTemp(rs_r2q);
2038
2039 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, rs_r2q, INVALID_SREG, INVALID_SREG};
2040
2041 // Use H.S.Warren's Hacker's Delight Chapter 10 and
2042 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
2043 int64_t magic;
2044 int shift;
2045 CalculateMagicAndShift(imm, magic, shift, true /* is_long */);
2046
2047 /*
2048 * For imm >= 2,
2049 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
2050 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
2051 * For imm <= -2,
2052 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
2053 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
2054 * We implement this algorithm in the following way:
2055 * 1. multiply magic number m and numerator n, get the higher 64bit result in RDX
2056 * 2. if imm > 0 and magic < 0, add numerator to RDX
2057 * if imm < 0 and magic > 0, sub numerator from RDX
2058 * 3. if S !=0, SAR S bits for RDX
2059 * 4. add 1 to RDX if RDX < 0
2060 * 5. Thus, RDX is the quotient
2061 */
2062
2063 // Numerator into RAX.
2064 RegStorage numerator_reg;
2065 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
2066 // We will need the value later.
2067 rl_src = LoadValueWide(rl_src, kCoreReg);
2068 numerator_reg = rl_src.reg;
2069 OpRegCopyWide(rs_r0q, numerator_reg);
2070 } else {
2071 // Only need this once. Just put it into RAX.
2072 LoadValueDirectWideFixed(rl_src, rs_r0q);
2073 }
2074
2075 // RDX = magic.
2076 LoadConstantWide(rs_r2q, magic);
2077
2078 // RDX:RAX = magic & dividend.
2079 NewLIR1(kX86Imul64DaR, rs_r2q.GetReg());
2080
2081 if (imm > 0 && magic < 0) {
2082 // Add numerator to RDX.
2083 DCHECK(numerator_reg.Valid());
2084 OpRegReg(kOpAdd, rs_r2q, numerator_reg);
2085 } else if (imm < 0 && magic > 0) {
2086 DCHECK(numerator_reg.Valid());
2087 OpRegReg(kOpSub, rs_r2q, numerator_reg);
2088 }
2089
2090 // Do we need the shift?
2091 if (shift != 0) {
2092 // Shift RDX by 'shift' bits.
2093 OpRegImm(kOpAsr, rs_r2q, shift);
2094 }
2095
2096 // Move RDX to RAX.
2097 OpRegCopyWide(rs_r0q, rs_r2q);
2098
2099 // Move sign bit to bit 0, zeroing the rest.
2100 OpRegImm(kOpLsr, rs_r2q, 63);
2101
2102 // RDX = RDX + RAX.
2103 OpRegReg(kOpAdd, rs_r2q, rs_r0q);
2104
2105 // Quotient is in RDX.
2106 if (!is_div) {
2107 // We need to compute the remainder.
2108 // Remainder is divisor - (quotient * imm).
2109 DCHECK(numerator_reg.Valid());
2110 OpRegCopyWide(rs_r0q, numerator_reg);
2111
2112 // Imul doesn't support 64-bit imms.
2113 if (imm > std::numeric_limits<int32_t>::max() ||
2114 imm < std::numeric_limits<int32_t>::min()) {
2115 RegStorage rs_temp = AllocTempWide();
2116 LoadConstantWide(rs_temp, imm);
2117
2118 // RAX = numerator * imm.
2119 NewLIR2(kX86Imul64RR, rs_r2q.GetReg(), rs_temp.GetReg());
2120
2121 FreeTemp(rs_temp);
2122 } else {
2123 // RAX = numerator * imm.
2124 int short_imm = static_cast<int>(imm);
2125 NewLIR3(kX86Imul64RRI, rs_r2q.GetReg(), rs_r2q.GetReg(), short_imm);
2126 }
2127
2128 // RDX -= RAX.
2129 OpRegReg(kOpSub, rs_r0q, rs_r2q);
2130
2131 // Store result.
2132 OpRegCopyWide(rl_result.reg, rs_r0q);
2133 } else {
2134 // Store result.
2135 OpRegCopyWide(rl_result.reg, rs_r2q);
2136 }
2137 StoreValueWide(rl_dest, rl_result);
2138 FreeTemp(rs_r0q);
2139 FreeTemp(rs_r2q);
2140 }
2141}
2142
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002143void X86Mir2Lir::GenDivRemLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002144 RegLocation rl_src2, bool is_div) {
Elena Sayapinadd644502014-07-01 18:39:52 +07002145 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002146 LOG(FATAL) << "Unexpected use GenDivRemLong()";
2147 return;
2148 }
2149
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002150 if (rl_src2.is_const) {
2151 DCHECK(rl_src2.wide);
2152 int64_t imm = mir_graph_->ConstantValueWide(rl_src2);
2153 GenDivRemLongLit(rl_dest, rl_src1, imm, is_div);
2154 return;
2155 }
2156
Chao-ying Fua0147762014-06-06 18:38:49 -07002157 // We have to use fixed registers, so flush all the temps.
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002158 // Prepare for explicit register usage.
2159 ExplicitTempRegisterLock(this, 4, &rs_r0q, &rs_r1q, &rs_r2q, &rs_r6q);
Chao-ying Fua0147762014-06-06 18:38:49 -07002160
2161 // Load LHS into RAX.
2162 LoadValueDirectWideFixed(rl_src1, rs_r0q);
2163
2164 // Load RHS into RCX.
2165 LoadValueDirectWideFixed(rl_src2, rs_r1q);
2166
2167 // Copy LHS sign bit into RDX.
2168 NewLIR0(kx86Cqo64Da);
2169
2170 // Handle division by zero case.
2171 GenDivZeroCheckWide(rs_r1q);
2172
2173 // Have to catch 0x8000000000000000/-1 case, or we will get an exception!
2174 NewLIR2(kX86Cmp64RI8, rs_r1q.GetReg(), -1);
Maxim Kazantsev6dccdc22014-08-18 18:43:55 +07002175 LIR* minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002176
2177 // RHS is -1.
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002178 LoadConstantWide(rs_r6q, 0x8000000000000000);
2179 NewLIR2(kX86Cmp64RR, rs_r0q.GetReg(), rs_r6q.GetReg());
Alexei Zavjalov6bbf0962014-07-15 02:19:41 +07002180 LIR *minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
Chao-ying Fua0147762014-06-06 18:38:49 -07002181
2182 // In 0x8000000000000000/-1 case.
2183 if (!is_div) {
2184 // For DIV, RAX is already right. For REM, we need RDX 0.
2185 NewLIR2(kX86Xor64RR, rs_r2q.GetReg(), rs_r2q.GetReg());
2186 }
2187 LIR* done = NewLIR1(kX86Jmp8, 0);
2188
2189 // Expected case.
2190 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
2191 minint_branch->target = minus_one_branch->target;
2192 NewLIR1(kX86Idivmod64DaR, rs_r1q.GetReg());
2193 done->target = NewLIR0(kPseudoTargetLabel);
2194
2195 // Result is in RAX for div and RDX for rem.
2196 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, rs_r0q, INVALID_SREG, INVALID_SREG};
2197 if (!is_div) {
2198 rl_result.reg.SetReg(r2q);
2199 }
2200
2201 StoreValueWide(rl_dest, rl_result);
Serban Constantinescued65c5e2014-05-22 15:10:18 +01002202}
2203
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002204void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002205 rl_src = LoadValueWide(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002206 RegLocation rl_result;
Elena Sayapinadd644502014-07-01 18:39:52 +07002207 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002208 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2209 OpRegReg(kOpNeg, rl_result.reg, rl_src.reg);
2210 } else {
2211 rl_result = ForceTempWide(rl_src);
2212 if (((rl_dest.location == kLocPhysReg) && (rl_src.location == kLocPhysReg)) &&
2213 ((rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()))) {
2214 // The registers are the same, so we would clobber it before the use.
2215 RegStorage temp_reg = AllocTemp();
2216 OpRegCopy(temp_reg, rl_result.reg);
2217 rl_result.reg.SetHighReg(temp_reg.GetReg());
2218 }
2219 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
2220 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
2221 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Mark Mendelle02d48f2014-01-15 11:19:23 -08002222 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002223 StoreValueWide(rl_dest, rl_result);
2224}
2225
buzbee091cc402014-03-31 10:14:40 -07002226void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<4> thread_offset) {
Andreas Gampe2f244e92014-05-08 03:35:25 -07002227 DCHECK_EQ(kX86, cu_->instruction_set);
2228 X86OpCode opcode = kX86Bkpt;
2229 switch (op) {
2230 case kOpCmp: opcode = kX86Cmp32RT; break;
2231 case kOpMov: opcode = kX86Mov32RT; break;
2232 default:
2233 LOG(FATAL) << "Bad opcode: " << op;
2234 break;
2235 }
2236 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
2237}
2238
2239void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<8> thread_offset) {
2240 DCHECK_EQ(kX86_64, cu_->instruction_set);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002241 X86OpCode opcode = kX86Bkpt;
Elena Sayapinadd644502014-07-01 18:39:52 +07002242 if (cu_->target64 && r_dest.Is64BitSolo()) {
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +07002243 switch (op) {
2244 case kOpCmp: opcode = kX86Cmp64RT; break;
2245 case kOpMov: opcode = kX86Mov64RT; break;
2246 default:
2247 LOG(FATAL) << "Bad opcode(OpRegThreadMem 64): " << op;
2248 break;
2249 }
2250 } else {
2251 switch (op) {
2252 case kOpCmp: opcode = kX86Cmp32RT; break;
2253 case kOpMov: opcode = kX86Mov32RT; break;
2254 default:
2255 LOG(FATAL) << "Bad opcode: " << op;
2256 break;
2257 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002258 }
buzbee091cc402014-03-31 10:14:40 -07002259 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07002260}
2261
2262/*
2263 * Generate array load
2264 */
2265void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002266 RegLocation rl_index, RegLocation rl_dest, int scale) {
buzbee091cc402014-03-31 10:14:40 -07002267 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002268 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07002269 RegLocation rl_result;
buzbeea0cd2d72014-06-01 09:33:49 -07002270 rl_array = LoadValue(rl_array, kRefReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002271
Mark Mendell343adb52013-12-18 06:02:17 -08002272 int data_offset;
buzbee695d13a2014-04-19 13:32:20 -07002273 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002274 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2275 } else {
2276 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2277 }
2278
Mark Mendell343adb52013-12-18 06:02:17 -08002279 bool constant_index = rl_index.is_const;
2280 int32_t constant_index_value = 0;
2281 if (!constant_index) {
2282 rl_index = LoadValue(rl_index, kCoreReg);
2283 } else {
2284 constant_index_value = mir_graph_->ConstantValue(rl_index);
2285 // If index is constant, just fold it into the data offset
2286 data_offset += constant_index_value << scale;
2287 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002288 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002289 }
2290
Brian Carlstrom7940e442013-07-12 13:46:57 -07002291 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002292 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002293
2294 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002295 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002296 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002297 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002298 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002299 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002300 }
Mark Mendell343adb52013-12-18 06:02:17 -08002301 rl_result = EvalLoc(rl_dest, reg_class, true);
Vladimir Marko3bf7c602014-05-07 14:55:43 +01002302 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg, size);
buzbee695d13a2014-04-19 13:32:20 -07002303 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002304 StoreValueWide(rl_dest, rl_result);
2305 } else {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002306 StoreValue(rl_dest, rl_result);
2307 }
2308}
2309
2310/*
2311 * Generate array store
2312 *
2313 */
2314void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07002315 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
buzbee091cc402014-03-31 10:14:40 -07002316 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002317 int len_offset = mirror::Array::LengthOffset().Int32Value();
2318 int data_offset;
2319
buzbee695d13a2014-04-19 13:32:20 -07002320 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002321 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
2322 } else {
2323 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
2324 }
2325
buzbeea0cd2d72014-06-01 09:33:49 -07002326 rl_array = LoadValue(rl_array, kRefReg);
Mark Mendell343adb52013-12-18 06:02:17 -08002327 bool constant_index = rl_index.is_const;
2328 int32_t constant_index_value = 0;
2329 if (!constant_index) {
2330 rl_index = LoadValue(rl_index, kCoreReg);
2331 } else {
2332 // If index is constant, just fold it into the data offset
2333 constant_index_value = mir_graph_->ConstantValue(rl_index);
2334 data_offset += constant_index_value << scale;
2335 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08002336 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08002337 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002338
2339 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08002340 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002341
2342 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08002343 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07002344 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002345 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07002346 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08002347 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07002348 }
buzbee695d13a2014-04-19 13:32:20 -07002349 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07002350 rl_src = LoadValueWide(rl_src, reg_class);
2351 } else {
2352 rl_src = LoadValue(rl_src, reg_class);
2353 }
2354 // If the src reg can't be byte accessed, move it to a temp first.
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002355 if ((size == kSignedByte || size == kUnsignedByte) && !IsByteRegister(rl_src.reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002356 RegStorage temp = AllocTemp();
2357 OpRegCopy(temp, rl_src.reg);
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002358 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002359 } else {
Jean Christophe Beylerb5bce7c2014-07-25 12:32:18 -07002360 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg, size, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002361 }
Ian Rogersa9a82542013-10-04 11:17:26 -07002362 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07002363 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08002364 if (!constant_index) {
buzbee091cc402014-03-31 10:14:40 -07002365 FreeTemp(rl_index.reg);
Mark Mendell343adb52013-12-18 06:02:17 -08002366 }
buzbee2700f7e2014-03-07 09:46:20 -08002367 MarkGCCard(rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002368 }
2369}
2370
Mark Mendell4708dcd2014-01-22 09:05:18 -08002371RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
2372 RegLocation rl_src, int shift_amount) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002373 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
Elena Sayapinadd644502014-07-01 18:39:52 +07002374 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002375 OpKind op = static_cast<OpKind>(0); /* Make gcc happy */
2376 switch (opcode) {
2377 case Instruction::SHL_LONG:
2378 case Instruction::SHL_LONG_2ADDR:
2379 op = kOpLsl;
2380 break;
2381 case Instruction::SHR_LONG:
2382 case Instruction::SHR_LONG_2ADDR:
2383 op = kOpAsr;
2384 break;
2385 case Instruction::USHR_LONG:
2386 case Instruction::USHR_LONG_2ADDR:
2387 op = kOpLsr;
2388 break;
2389 default:
2390 LOG(FATAL) << "Unexpected case";
2391 }
2392 OpRegRegImm(op, rl_result.reg, rl_src.reg, shift_amount);
2393 } else {
2394 switch (opcode) {
2395 case Instruction::SHL_LONG:
2396 case Instruction::SHL_LONG_2ADDR:
2397 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
2398 if (shift_amount == 32) {
2399 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2400 LoadConstant(rl_result.reg.GetLow(), 0);
2401 } else if (shift_amount > 31) {
2402 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
2403 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
2404 LoadConstant(rl_result.reg.GetLow(), 0);
2405 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002406 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002407 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2408 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(),
2409 shift_amount);
2410 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
2411 }
2412 break;
2413 case Instruction::SHR_LONG:
2414 case Instruction::SHR_LONG_2ADDR:
2415 if (shift_amount == 32) {
2416 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2417 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2418 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2419 } else if (shift_amount > 31) {
2420 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2421 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2422 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2423 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
2424 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002425 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002426 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2427 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2428 shift_amount);
2429 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
2430 }
2431 break;
2432 case Instruction::USHR_LONG:
2433 case Instruction::USHR_LONG_2ADDR:
2434 if (shift_amount == 32) {
2435 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2436 LoadConstant(rl_result.reg.GetHigh(), 0);
2437 } else if (shift_amount > 31) {
2438 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
2439 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
2440 LoadConstant(rl_result.reg.GetHigh(), 0);
2441 } else {
Mark Mendellb9b9d662014-06-16 13:03:42 -04002442 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetLow());
Chao-ying Fua0147762014-06-06 18:38:49 -07002443 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
2444 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(),
2445 shift_amount);
2446 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
2447 }
2448 break;
2449 default:
2450 LOG(FATAL) << "Unexpected case";
2451 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08002452 }
2453 return rl_result;
2454}
2455
Brian Carlstrom7940e442013-07-12 13:46:57 -07002456void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Mark Mendell4708dcd2014-01-22 09:05:18 -08002457 RegLocation rl_src, RegLocation rl_shift) {
2458 // Per spec, we only care about low 6 bits of shift amount.
2459 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
2460 if (shift_amount == 0) {
2461 rl_src = LoadValueWide(rl_src, kCoreReg);
2462 StoreValueWide(rl_dest, rl_src);
2463 return;
2464 } else if (shift_amount == 1 &&
2465 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
2466 // Need to handle this here to avoid calling StoreValueWide twice.
Andreas Gampec76c6142014-08-04 16:30:03 -07002467 GenArithOpLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src);
Mark Mendell4708dcd2014-01-22 09:05:18 -08002468 return;
2469 }
2470 if (BadOverlap(rl_src, rl_dest)) {
2471 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
2472 return;
2473 }
2474 rl_src = LoadValueWide(rl_src, kCoreReg);
2475 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount);
2476 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07002477}
2478
2479void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07002480 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002481 bool isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002482 switch (opcode) {
2483 case Instruction::ADD_LONG:
2484 case Instruction::AND_LONG:
2485 case Instruction::OR_LONG:
2486 case Instruction::XOR_LONG:
2487 if (rl_src2.is_const) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002488 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002489 } else {
2490 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002491 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002492 }
2493 break;
2494 case Instruction::SUB_LONG:
2495 case Instruction::SUB_LONG_2ADDR:
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 {
Andreas Gampec76c6142014-08-04 16:30:03 -07002499 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002500 isConstSuccess = true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002501 }
2502 break;
2503 case Instruction::ADD_LONG_2ADDR:
2504 case Instruction::OR_LONG_2ADDR:
2505 case Instruction::XOR_LONG_2ADDR:
2506 case Instruction::AND_LONG_2ADDR:
2507 if (rl_src2.is_const) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002508 if (GenerateTwoOperandInstructions()) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002509 isConstSuccess = GenLongImm(rl_dest, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002510 } else {
Chao-ying Fua0147762014-06-06 18:38:49 -07002511 isConstSuccess = GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
Mark Mendelle87f9b52014-04-30 14:13:18 -04002512 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002513 } else {
2514 DCHECK(rl_src1.is_const);
Chao-ying Fua0147762014-06-06 18:38:49 -07002515 isConstSuccess = GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002516 }
2517 break;
2518 default:
Chao-ying Fua0147762014-06-06 18:38:49 -07002519 isConstSuccess = false;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002520 break;
2521 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002522
2523 if (!isConstSuccess) {
2524 // Default - bail to non-const handler.
2525 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
2526 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002527}
2528
2529bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
2530 switch (op) {
2531 case Instruction::AND_LONG_2ADDR:
2532 case Instruction::AND_LONG:
2533 return value == -1;
2534 case Instruction::OR_LONG:
2535 case Instruction::OR_LONG_2ADDR:
2536 case Instruction::XOR_LONG:
2537 case Instruction::XOR_LONG_2ADDR:
2538 return value == 0;
2539 default:
2540 return false;
2541 }
2542}
2543
2544X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
2545 bool is_high_op) {
2546 bool rhs_in_mem = rhs.location != kLocPhysReg;
2547 bool dest_in_mem = dest.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002548 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002549 DCHECK(!rhs_in_mem || !dest_in_mem);
2550 switch (op) {
2551 case Instruction::ADD_LONG:
2552 case Instruction::ADD_LONG_2ADDR:
2553 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002554 return is64Bit ? kX86Add64MR : is_high_op ? kX86Adc32MR : kX86Add32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002555 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002556 return is64Bit ? kX86Add64RM : is_high_op ? kX86Adc32RM : kX86Add32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002557 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002558 return is64Bit ? kX86Add64RR : is_high_op ? kX86Adc32RR : kX86Add32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002559 case Instruction::SUB_LONG:
2560 case Instruction::SUB_LONG_2ADDR:
2561 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002562 return is64Bit ? kX86Sub64MR : is_high_op ? kX86Sbb32MR : kX86Sub32MR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002563 } else if (rhs_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002564 return is64Bit ? kX86Sub64RM : is_high_op ? kX86Sbb32RM : kX86Sub32RM;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002565 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002566 return is64Bit ? kX86Sub64RR : is_high_op ? kX86Sbb32RR : kX86Sub32RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002567 case Instruction::AND_LONG_2ADDR:
2568 case Instruction::AND_LONG:
2569 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002570 return is64Bit ? kX86And64MR : kX86And32MR;
2571 }
2572 if (is64Bit) {
2573 return rhs_in_mem ? kX86And64RM : kX86And64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002574 }
2575 return rhs_in_mem ? kX86And32RM : kX86And32RR;
2576 case Instruction::OR_LONG:
2577 case Instruction::OR_LONG_2ADDR:
2578 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002579 return is64Bit ? kX86Or64MR : kX86Or32MR;
2580 }
2581 if (is64Bit) {
2582 return rhs_in_mem ? kX86Or64RM : kX86Or64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002583 }
2584 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
2585 case Instruction::XOR_LONG:
2586 case Instruction::XOR_LONG_2ADDR:
2587 if (dest_in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002588 return is64Bit ? kX86Xor64MR : kX86Xor32MR;
2589 }
2590 if (is64Bit) {
2591 return rhs_in_mem ? kX86Xor64RM : kX86Xor64RR;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002592 }
2593 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
2594 default:
2595 LOG(FATAL) << "Unexpected opcode: " << op;
2596 return kX86Add32RR;
2597 }
2598}
2599
2600X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
2601 int32_t value) {
2602 bool in_mem = loc.location != kLocPhysReg;
Elena Sayapinadd644502014-07-01 18:39:52 +07002603 bool is64Bit = cu_->target64;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002604 bool byte_imm = IS_SIMM8(value);
buzbee091cc402014-03-31 10:14:40 -07002605 DCHECK(in_mem || !loc.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002606 switch (op) {
2607 case Instruction::ADD_LONG:
2608 case Instruction::ADD_LONG_2ADDR:
2609 if (byte_imm) {
2610 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002611 return is64Bit ? kX86Add64MI8 : is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002612 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002613 return is64Bit ? kX86Add64RI8 : is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002614 }
2615 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002616 return is64Bit ? kX86Add64MI : is_high_op ? kX86Adc32MI : kX86Add32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002617 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002618 return is64Bit ? kX86Add64RI : is_high_op ? kX86Adc32RI : kX86Add32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002619 case Instruction::SUB_LONG:
2620 case Instruction::SUB_LONG_2ADDR:
2621 if (byte_imm) {
2622 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002623 return is64Bit ? kX86Sub64MI8 : is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002624 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002625 return is64Bit ? kX86Sub64RI8 : is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002626 }
2627 if (in_mem) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002628 return is64Bit ? kX86Sub64MI : is_high_op ? kX86Sbb32MI : kX86Sub32MI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002629 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002630 return is64Bit ? kX86Sub64RI : is_high_op ? kX86Sbb32RI : kX86Sub32RI;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002631 case Instruction::AND_LONG_2ADDR:
2632 case Instruction::AND_LONG:
2633 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002634 if (is64Bit) {
2635 return in_mem ? kX86And64MI8 : kX86And64RI8;
2636 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002637 return in_mem ? kX86And32MI8 : kX86And32RI8;
2638 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002639 if (is64Bit) {
2640 return in_mem ? kX86And64MI : kX86And64RI;
2641 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002642 return in_mem ? kX86And32MI : kX86And32RI;
2643 case Instruction::OR_LONG:
2644 case Instruction::OR_LONG_2ADDR:
2645 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002646 if (is64Bit) {
2647 return in_mem ? kX86Or64MI8 : kX86Or64RI8;
2648 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002649 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
2650 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002651 if (is64Bit) {
2652 return in_mem ? kX86Or64MI : kX86Or64RI;
2653 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002654 return in_mem ? kX86Or32MI : kX86Or32RI;
2655 case Instruction::XOR_LONG:
2656 case Instruction::XOR_LONG_2ADDR:
2657 if (byte_imm) {
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002658 if (is64Bit) {
2659 return in_mem ? kX86Xor64MI8 : kX86Xor64RI8;
2660 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002661 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
2662 }
Chao-ying Fue0ccdc02014-06-06 17:32:37 -07002663 if (is64Bit) {
2664 return in_mem ? kX86Xor64MI : kX86Xor64RI;
2665 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08002666 return in_mem ? kX86Xor32MI : kX86Xor32RI;
2667 default:
2668 LOG(FATAL) << "Unexpected opcode: " << op;
2669 return kX86Add32MI;
2670 }
2671}
2672
Chao-ying Fua0147762014-06-06 18:38:49 -07002673bool X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002674 DCHECK(rl_src.is_const);
2675 int64_t val = mir_graph_->ConstantValueWide(rl_src);
Chao-ying Fua0147762014-06-06 18:38:49 -07002676
Elena Sayapinadd644502014-07-01 18:39:52 +07002677 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002678 // We can do with imm only if it fits 32 bit
2679 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2680 return false;
2681 }
2682
2683 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
2684
2685 if ((rl_dest.location == kLocDalvikFrame) ||
2686 (rl_dest.location == kLocCompilerTemp)) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002687 int r_base = rs_rX86_SP.GetReg();
Chao-ying Fua0147762014-06-06 18:38:49 -07002688 int displacement = SRegOffset(rl_dest.s_reg_low);
2689
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002690 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002691 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
2692 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val);
2693 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2694 true /* is_load */, true /* is64bit */);
2695 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
2696 false /* is_load */, true /* is64bit */);
2697 return true;
2698 }
2699
2700 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2701 DCHECK_EQ(rl_result.location, kLocPhysReg);
2702 DCHECK(!rl_result.reg.IsFloat());
2703
2704 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2705 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2706
2707 StoreValueWide(rl_dest, rl_result);
2708 return true;
2709 }
2710
Mark Mendelle02d48f2014-01-15 11:19:23 -08002711 int32_t val_lo = Low32Bits(val);
2712 int32_t val_hi = High32Bits(val);
buzbee30adc732014-05-09 15:10:18 -07002713 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002714
2715 // Can we just do this into memory?
2716 if ((rl_dest.location == kLocDalvikFrame) ||
2717 (rl_dest.location == kLocCompilerTemp)) {
Chao-ying Fua77ee512014-07-01 17:43:41 -07002718 int r_base = rs_rX86_SP.GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08002719 int displacement = SRegOffset(rl_dest.s_reg_low);
2720
Vladimir Marko8dea81c2014-06-06 14:50:36 +01002721 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002722 if (!IsNoOp(op, val_lo)) {
2723 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002724 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002725 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002726 true /* is_load */, true /* is64bit */);
2727 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002728 false /* is_load */, true /* is64bit */);
2729 }
2730 if (!IsNoOp(op, val_hi)) {
2731 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08002732 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002733 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07002734 true /* is_load */, true /* is64bit */);
2735 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002736 false /* is_load */, true /* is64bit */);
2737 }
Chao-ying Fua0147762014-06-06 18:38:49 -07002738 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002739 }
2740
2741 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
2742 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee091cc402014-03-31 10:14:40 -07002743 DCHECK(!rl_result.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08002744
2745 if (!IsNoOp(op, val_lo)) {
2746 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002747 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002748 }
2749 if (!IsNoOp(op, val_hi)) {
2750 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002751 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002752 }
2753 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002754 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002755}
2756
Chao-ying Fua0147762014-06-06 18:38:49 -07002757bool X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
Mark Mendelle02d48f2014-01-15 11:19:23 -08002758 RegLocation rl_src2, Instruction::Code op) {
2759 DCHECK(rl_src2.is_const);
2760 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
Chao-ying Fua0147762014-06-06 18:38:49 -07002761
Elena Sayapinadd644502014-07-01 18:39:52 +07002762 if (cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07002763 // We can do with imm only if it fits 32 bit
2764 if (val != (static_cast<int64_t>(static_cast<int32_t>(val)))) {
2765 return false;
2766 }
2767 if (rl_dest.location == kLocPhysReg &&
2768 rl_src1.location == kLocPhysReg && !rl_dest.reg.IsFloat()) {
2769 X86OpCode x86op = GetOpcode(op, rl_dest, false, val);
Dmitry Petrochenko3157f9a2014-06-18 19:11:41 +07002770 OpRegCopy(rl_dest.reg, rl_src1.reg);
Chao-ying Fua0147762014-06-06 18:38:49 -07002771 NewLIR2(x86op, rl_dest.reg.GetReg(), val);
2772 StoreFinalValueWide(rl_dest, rl_dest);
2773 return true;
2774 }
2775
2776 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2777 // We need the values to be in a temporary
2778 RegLocation rl_result = ForceTempWide(rl_src1);
2779
2780 X86OpCode x86op = GetOpcode(op, rl_result, false, val);
2781 NewLIR2(x86op, rl_result.reg.GetReg(), val);
2782
2783 StoreFinalValueWide(rl_dest, rl_result);
2784 return true;
2785 }
2786
Mark Mendelle02d48f2014-01-15 11:19:23 -08002787 int32_t val_lo = Low32Bits(val);
2788 int32_t val_hi = High32Bits(val);
buzbee30adc732014-05-09 15:10:18 -07002789 rl_dest = UpdateLocWideTyped(rl_dest, kCoreReg);
2790 rl_src1 = UpdateLocWideTyped(rl_src1, kCoreReg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002791
2792 // Can we do this directly into the destination registers?
2793 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08002794 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
buzbee091cc402014-03-31 10:14:40 -07002795 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() && !rl_dest.reg.IsFloat()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08002796 if (!IsNoOp(op, val_lo)) {
2797 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002798 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002799 }
2800 if (!IsNoOp(op, val_hi)) {
2801 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002802 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002803 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07002804
2805 StoreFinalValueWide(rl_dest, rl_dest);
Chao-ying Fua0147762014-06-06 18:38:49 -07002806 return true;
Mark Mendelle02d48f2014-01-15 11:19:23 -08002807 }
2808
2809 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
2810 DCHECK_EQ(rl_src1.location, kLocPhysReg);
2811
2812 // We need the values to be in a temporary
2813 RegLocation rl_result = ForceTempWide(rl_src1);
2814 if (!IsNoOp(op, val_lo)) {
2815 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08002816 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002817 }
2818 if (!IsNoOp(op, val_hi)) {
2819 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002820 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08002821 }
2822
2823 StoreFinalValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07002824 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -07002825}
2826
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002827// For final classes there are no sub-classes to check and so we can answer the instance-of
2828// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
2829void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
2830 RegLocation rl_dest, RegLocation rl_src) {
buzbeea0cd2d72014-06-01 09:33:49 -07002831 RegLocation object = LoadValue(rl_src, kRefReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002832 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002833 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002834
Chao-ying Fu7e399fd2014-06-10 18:11:11 -07002835 // For 32-bit, SETcc only works with EAX..EDX.
Chao-ying Fua77ee512014-07-01 17:43:41 -07002836 RegStorage object_32reg = object.reg.Is64Bit() ? As32BitReg(object.reg) : object.reg;
Dmitry Petrochenko407f5c12014-07-01 01:21:38 +07002837 if (result_reg.GetRegNum() == object_32reg.GetRegNum() || !IsByteRegister(result_reg)) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002838 result_reg = AllocateByteRegister();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002839 }
2840
2841 // Assume that there is no match.
2842 LoadConstant(result_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -08002843 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, NULL);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002844
Mark Mendellade54a22014-06-09 12:49:55 -04002845 // We will use this register to compare to memory below.
2846 // References are 32 bit in memory, and 64 bit in registers (in 64 bit mode).
2847 // For this reason, force allocation of a 32 bit register to use, so that the
2848 // compare to memory will be done using a 32 bit comparision.
2849 // The LoadRefDisp(s) below will work normally, even in 64 bit mode.
2850 RegStorage check_class = AllocTemp();
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002851
2852 // If Method* is already in a register, we can save a copy.
2853 RegLocation rl_method = mir_graph_->GetMethodLoc();
Andreas Gampeccc60262014-07-04 18:02:38 -07002854 int32_t offset_of_type = mirror::Array::DataOffset(
2855 sizeof(mirror::HeapReference<mirror::Class*>)).Int32Value() +
2856 (sizeof(mirror::HeapReference<mirror::Class*>) * type_idx);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002857
2858 if (rl_method.location == kLocPhysReg) {
2859 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002860 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002861 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002862 } else {
buzbee695d13a2014-04-19 13:32:20 -07002863 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002864 check_class, kNotVolatile);
2865 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002866 }
2867 } else {
2868 LoadCurrMethodDirect(check_class);
2869 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07002870 LoadRefDisp(check_class, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002871 check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002872 } else {
buzbee695d13a2014-04-19 13:32:20 -07002873 LoadRefDisp(check_class, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Andreas Gampe3c12c512014-06-24 18:46:29 +00002874 check_class, kNotVolatile);
2875 LoadRefDisp(check_class, offset_of_type, check_class, kNotVolatile);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002876 }
2877 }
2878
2879 // Compare the computed class to the class in the object.
2880 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08002881 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002882
2883 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08002884 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002885
2886 LIR* target = NewLIR0(kPseudoTargetLabel);
2887 null_branchover->target = target;
2888 FreeTemp(check_class);
2889 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08002890 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08002891 FreeTemp(result_reg);
2892 }
2893 StoreValue(rl_dest, rl_result);
2894}
2895
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002896void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
2897 RegLocation rl_lhs, RegLocation rl_rhs) {
2898 OpKind op = kOpBkpt;
2899 bool is_div_rem = false;
2900 bool unary = false;
2901 bool shift_op = false;
2902 bool is_two_addr = false;
2903 RegLocation rl_result;
2904 switch (opcode) {
2905 case Instruction::NEG_INT:
2906 op = kOpNeg;
2907 unary = true;
2908 break;
2909 case Instruction::NOT_INT:
2910 op = kOpMvn;
2911 unary = true;
2912 break;
2913 case Instruction::ADD_INT_2ADDR:
2914 is_two_addr = true;
2915 // Fallthrough
2916 case Instruction::ADD_INT:
2917 op = kOpAdd;
2918 break;
2919 case Instruction::SUB_INT_2ADDR:
2920 is_two_addr = true;
2921 // Fallthrough
2922 case Instruction::SUB_INT:
2923 op = kOpSub;
2924 break;
2925 case Instruction::MUL_INT_2ADDR:
2926 is_two_addr = true;
2927 // Fallthrough
2928 case Instruction::MUL_INT:
2929 op = kOpMul;
2930 break;
2931 case Instruction::DIV_INT_2ADDR:
2932 is_two_addr = true;
2933 // Fallthrough
2934 case Instruction::DIV_INT:
2935 op = kOpDiv;
2936 is_div_rem = true;
2937 break;
2938 /* NOTE: returns in kArg1 */
2939 case Instruction::REM_INT_2ADDR:
2940 is_two_addr = true;
2941 // Fallthrough
2942 case Instruction::REM_INT:
2943 op = kOpRem;
2944 is_div_rem = true;
2945 break;
2946 case Instruction::AND_INT_2ADDR:
2947 is_two_addr = true;
2948 // Fallthrough
2949 case Instruction::AND_INT:
2950 op = kOpAnd;
2951 break;
2952 case Instruction::OR_INT_2ADDR:
2953 is_two_addr = true;
2954 // Fallthrough
2955 case Instruction::OR_INT:
2956 op = kOpOr;
2957 break;
2958 case Instruction::XOR_INT_2ADDR:
2959 is_two_addr = true;
2960 // Fallthrough
2961 case Instruction::XOR_INT:
2962 op = kOpXor;
2963 break;
2964 case Instruction::SHL_INT_2ADDR:
2965 is_two_addr = true;
2966 // Fallthrough
2967 case Instruction::SHL_INT:
2968 shift_op = true;
2969 op = kOpLsl;
2970 break;
2971 case Instruction::SHR_INT_2ADDR:
2972 is_two_addr = true;
2973 // Fallthrough
2974 case Instruction::SHR_INT:
2975 shift_op = true;
2976 op = kOpAsr;
2977 break;
2978 case Instruction::USHR_INT_2ADDR:
2979 is_two_addr = true;
2980 // Fallthrough
2981 case Instruction::USHR_INT:
2982 shift_op = true;
2983 op = kOpLsr;
2984 break;
2985 default:
2986 LOG(FATAL) << "Invalid word arith op: " << opcode;
2987 }
2988
Mark Mendelle87f9b52014-04-30 14:13:18 -04002989 // Can we convert to a two address instruction?
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002990 if (!is_two_addr &&
2991 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
2992 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
Mark Mendelle87f9b52014-04-30 14:13:18 -04002993 is_two_addr = true;
2994 }
2995
2996 if (!GenerateTwoOperandInstructions()) {
2997 is_two_addr = false;
2998 }
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002999
3000 // Get the div/rem stuff out of the way.
3001 if (is_div_rem) {
3002 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, true);
3003 StoreValue(rl_dest, rl_result);
3004 return;
3005 }
3006
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003007 // If we generate any memory access below, it will reference a dalvik reg.
3008 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
3009
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003010 if (unary) {
3011 rl_lhs = LoadValue(rl_lhs, kCoreReg);
buzbee30adc732014-05-09 15:10:18 -07003012 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003013 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003014 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003015 } else {
3016 if (shift_op) {
3017 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003018 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003019 LoadValueDirectFixed(rl_rhs, t_reg);
3020 if (is_two_addr) {
3021 // Can we do this directly into memory?
buzbee30adc732014-05-09 15:10:18 -07003022 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003023 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3024 if (rl_result.location != kLocPhysReg) {
3025 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08003026 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003027 FreeTemp(t_reg);
3028 return;
buzbee091cc402014-03-31 10:14:40 -07003029 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003030 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08003031 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003032 FreeTemp(t_reg);
3033 StoreFinalValue(rl_dest, rl_result);
3034 return;
3035 }
3036 }
3037 // Three address form, or we can't do directly.
3038 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3039 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003040 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003041 FreeTemp(t_reg);
3042 } else {
3043 // Multiply is 3 operand only (sort of).
3044 if (is_two_addr && op != kOpMul) {
3045 // Can we do this directly into memory?
buzbee30adc732014-05-09 15:10:18 -07003046 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003047 if (rl_result.location == kLocPhysReg) {
Serguei Katkov366f8ae2014-04-15 16:55:26 +07003048 // Ensure res is in a core reg
3049 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003050 // Can we do this from memory directly?
buzbee30adc732014-05-09 15:10:18 -07003051 rl_rhs = UpdateLocTyped(rl_rhs, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003052 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08003053 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003054 StoreFinalValue(rl_dest, rl_result);
3055 return;
buzbee091cc402014-03-31 10:14:40 -07003056 } else if (!rl_rhs.reg.IsFloat()) {
buzbee2700f7e2014-03-07 09:46:20 -08003057 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003058 StoreFinalValue(rl_dest, rl_result);
3059 return;
3060 }
3061 }
3062 rl_rhs = LoadValue(rl_rhs, kCoreReg);
Serguei Katkovd293fb42014-05-19 15:45:42 +07003063 // It might happen rl_rhs and rl_dest are the same VR
3064 // in this case rl_dest is in reg after LoadValue while
3065 // rl_result is not updated yet, so do this
3066 rl_result = UpdateLocTyped(rl_dest, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003067 if (rl_result.location != kLocPhysReg) {
3068 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00003069 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003070 return;
buzbee091cc402014-03-31 10:14:40 -07003071 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003072 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08003073 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003074 StoreFinalValue(rl_dest, rl_result);
3075 return;
3076 } else {
3077 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3078 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003079 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003080 }
3081 } else {
3082 // Try to use reg/memory instructions.
buzbee30adc732014-05-09 15:10:18 -07003083 rl_lhs = UpdateLocTyped(rl_lhs, kCoreReg);
3084 rl_rhs = UpdateLocTyped(rl_rhs, kCoreReg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003085 // We can't optimize with FP registers.
3086 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
3087 // Something is difficult, so fall back to the standard case.
3088 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3089 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3090 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003091 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003092 } else {
3093 // We can optimize by moving to result and using memory operands.
3094 if (rl_rhs.location != kLocPhysReg) {
3095 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07003096 // We should be careful with order here
3097 // If rl_dest and rl_lhs points to the same VR we should load first
3098 // If the are different we should find a register first for dest
Chao-ying Fua0147762014-06-06 18:38:49 -07003099 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
3100 mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
Serguei Katkov66da1362014-03-14 13:33:33 +07003101 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3102 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendelle87f9b52014-04-30 14:13:18 -04003103 // No-op if these are the same.
3104 OpRegCopy(rl_result.reg, rl_lhs.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003105 } else {
3106 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003107 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07003108 }
buzbee2700f7e2014-03-07 09:46:20 -08003109 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003110 } else if (rl_lhs.location != kLocPhysReg) {
3111 // RHS is in a register; LHS is in memory.
3112 if (op != kOpSub) {
3113 // Force RHS into result and operate on memory.
3114 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003115 OpRegCopy(rl_result.reg, rl_rhs.reg);
3116 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003117 } else {
3118 // Subtraction isn't commutative.
3119 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3120 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3121 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003122 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003123 }
3124 } else {
3125 // Both are in registers.
3126 rl_lhs = LoadValue(rl_lhs, kCoreReg);
3127 rl_rhs = LoadValue(rl_rhs, kCoreReg);
3128 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08003129 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003130 }
3131 }
3132 }
3133 }
3134 }
3135 StoreValue(rl_dest, rl_result);
3136}
3137
3138bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
3139 // If we have non-core registers, then we can't do good things.
buzbee091cc402014-03-31 10:14:40 -07003140 if (rl_lhs.location == kLocPhysReg && rl_lhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003141 return false;
3142 }
buzbee091cc402014-03-31 10:14:40 -07003143 if (rl_rhs.location == kLocPhysReg && rl_rhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08003144 return false;
3145 }
3146
3147 // Everything will be fine :-).
3148 return true;
3149}
Chao-ying Fua0147762014-06-06 18:38:49 -07003150
3151void X86Mir2Lir::GenIntToLong(RegLocation rl_dest, RegLocation rl_src) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003152 if (!cu_->target64) {
Chao-ying Fua0147762014-06-06 18:38:49 -07003153 Mir2Lir::GenIntToLong(rl_dest, rl_src);
3154 return;
3155 }
Serguei Katkove63d9d42014-06-25 00:25:35 +07003156 rl_src = UpdateLocTyped(rl_src, kCoreReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003157 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
3158 if (rl_src.location == kLocPhysReg) {
3159 NewLIR2(kX86MovsxdRR, rl_result.reg.GetReg(), rl_src.reg.GetReg());
3160 } else {
3161 int displacement = SRegOffset(rl_src.s_reg_low);
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003162 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003163 LIR *m = NewLIR3(kX86MovsxdRM, rl_result.reg.GetReg(), rs_rX86_SP.GetReg(),
3164 displacement + LOWORD_OFFSET);
3165 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
3166 true /* is_load */, true /* is_64bit */);
3167 }
3168 StoreValueWide(rl_dest, rl_result);
3169}
3170
3171void X86Mir2Lir::GenShiftOpLong(Instruction::Code opcode, RegLocation rl_dest,
3172 RegLocation rl_src1, RegLocation rl_shift) {
Elena Sayapinadd644502014-07-01 18:39:52 +07003173 if (!cu_->target64) {
Yixin Shouf40f8902014-08-14 14:10:32 -04003174 // Long shift operations in 32-bit. Use shld or shrd to create a 32-bit register filled from
3175 // the other half, shift the other half, if the shift amount is less than 32 we're done,
3176 // otherwise move one register to the other and place zero or sign bits in the other.
3177 LIR* branch;
3178 FlushAllRegs();
3179 LockCallTemps();
3180 LoadValueDirectFixed(rl_shift, rs_rCX);
3181 RegStorage r_tmp = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
3182 LoadValueDirectWideFixed(rl_src1, r_tmp);
3183 switch (opcode) {
3184 case Instruction::SHL_LONG:
3185 case Instruction::SHL_LONG_2ADDR:
3186 NewLIR3(kX86Shld32RRC, r_tmp.GetHighReg(), r_tmp.GetLowReg(), rs_rCX.GetReg());
3187 NewLIR2(kX86Sal32RC, r_tmp.GetLowReg(), rs_rCX.GetReg());
3188 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3189 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3190 OpRegCopy(r_tmp.GetHigh(), r_tmp.GetLow());
3191 LoadConstant(r_tmp.GetLow(), 0);
3192 branch->target = NewLIR0(kPseudoTargetLabel);
3193 break;
3194 case Instruction::SHR_LONG:
3195 case Instruction::SHR_LONG_2ADDR:
3196 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(), rs_rCX.GetReg());
3197 NewLIR2(kX86Sar32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3198 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3199 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3200 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3201 NewLIR2(kX86Sar32RI, r_tmp.GetHighReg(), 31);
3202 branch->target = NewLIR0(kPseudoTargetLabel);
3203 break;
3204 case Instruction::USHR_LONG:
3205 case Instruction::USHR_LONG_2ADDR:
3206 NewLIR3(kX86Shrd32RRC, r_tmp.GetLowReg(), r_tmp.GetHighReg(),
3207 rs_rCX.GetReg());
3208 NewLIR2(kX86Shr32RC, r_tmp.GetHighReg(), rs_rCX.GetReg());
3209 NewLIR2(kX86Test8RI, rs_rCX.GetReg(), 32);
3210 branch = NewLIR2(kX86Jcc8, 0, kX86CondZ);
3211 OpRegCopy(r_tmp.GetLow(), r_tmp.GetHigh());
3212 LoadConstant(r_tmp.GetHigh(), 0);
3213 branch->target = NewLIR0(kPseudoTargetLabel);
3214 break;
3215 default:
3216 LOG(FATAL) << "Unexpected case: " << opcode;
3217 return;
3218 }
3219 RegLocation rl_result = LocCReturnWide();
3220 StoreValueWide(rl_dest, rl_result);
Chao-ying Fua0147762014-06-06 18:38:49 -07003221 return;
3222 }
3223
3224 bool is_two_addr = false;
3225 OpKind op = kOpBkpt;
3226 RegLocation rl_result;
3227
3228 switch (opcode) {
3229 case Instruction::SHL_LONG_2ADDR:
3230 is_two_addr = true;
3231 // Fallthrough
3232 case Instruction::SHL_LONG:
3233 op = kOpLsl;
3234 break;
3235 case Instruction::SHR_LONG_2ADDR:
3236 is_two_addr = true;
3237 // Fallthrough
3238 case Instruction::SHR_LONG:
3239 op = kOpAsr;
3240 break;
3241 case Instruction::USHR_LONG_2ADDR:
3242 is_two_addr = true;
3243 // Fallthrough
3244 case Instruction::USHR_LONG:
3245 op = kOpLsr;
3246 break;
3247 default:
3248 op = kOpBkpt;
3249 }
3250
3251 // X86 doesn't require masking and must use ECX.
Andreas Gampeccc60262014-07-04 18:02:38 -07003252 RegStorage t_reg = TargetReg(kCount, kNotWide); // rCX
Chao-ying Fua0147762014-06-06 18:38:49 -07003253 LoadValueDirectFixed(rl_shift, t_reg);
3254 if (is_two_addr) {
3255 // Can we do this directly into memory?
3256 rl_result = UpdateLocWideTyped(rl_dest, kCoreReg);
3257 if (rl_result.location != kLocPhysReg) {
3258 // Okay, we can do this into memory
Vladimir Marko8dea81c2014-06-06 14:50:36 +01003259 ScopedMemRefType mem_ref_type(this, ResourceMask::kDalvikReg);
Chao-ying Fua0147762014-06-06 18:38:49 -07003260 OpMemReg(op, rl_result, t_reg.GetReg());
3261 } else if (!rl_result.reg.IsFloat()) {
3262 // Can do this directly into the result register
3263 OpRegReg(op, rl_result.reg, t_reg);
3264 StoreFinalValueWide(rl_dest, rl_result);
3265 }
3266 } else {
3267 // Three address form, or we can't do directly.
3268 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
3269 rl_result = EvalLocWide(rl_dest, kCoreReg, true);
3270 OpRegRegReg(op, rl_result.reg, rl_src1.reg, t_reg);
3271 StoreFinalValueWide(rl_dest, rl_result);
3272 }
3273
3274 FreeTemp(t_reg);
3275}
3276
Brian Carlstrom7940e442013-07-12 13:46:57 -07003277} // namespace art