blob: 851f4481a62cd3dfe15092e0292624b67ec46ef2 [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"
21#include "mirror/array.h"
22#include "x86_lir.h"
23
24namespace art {
25
26/*
27 * Perform register memory operation.
28 */
buzbee2700f7e2014-03-07 09:46:20 -080029LIR* X86Mir2Lir::GenRegMemCheck(ConditionCode c_code, RegStorage reg1, RegStorage base,
30 int offset, ThrowKind kind) {
Brian Carlstrom7940e442013-07-12 13:46:57 -070031 LIR* tgt = RawLIR(0, kPseudoThrowTarget, kind,
buzbee2700f7e2014-03-07 09:46:20 -080032 current_dalvik_offset_, reg1.GetReg(), base.GetReg(), offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -070033 OpRegMem(kOpCmp, reg1, base, offset);
34 LIR* branch = OpCondBranch(c_code, tgt);
35 // Remember branch target - will process later
36 throw_launchpads_.Insert(tgt);
37 return branch;
38}
39
40/*
Mark Mendell343adb52013-12-18 06:02:17 -080041 * Perform a compare of memory to immediate value
42 */
buzbee2700f7e2014-03-07 09:46:20 -080043LIR* X86Mir2Lir::GenMemImmedCheck(ConditionCode c_code, RegStorage base, int offset,
44 int check_value, ThrowKind kind) {
Mark Mendell343adb52013-12-18 06:02:17 -080045 LIR* tgt = RawLIR(0, kPseudoThrowTarget, kind,
buzbee2700f7e2014-03-07 09:46:20 -080046 current_dalvik_offset_, base.GetReg(), check_value, 0);
47 NewLIR3(IS_SIMM8(check_value) ? kX86Cmp32MI8 : kX86Cmp32MI, base.GetReg(), offset, check_value);
Mark Mendell343adb52013-12-18 06:02:17 -080048 LIR* branch = OpCondBranch(c_code, tgt);
49 // Remember branch target - will process later
50 throw_launchpads_.Insert(tgt);
51 return branch;
52}
53
54/*
Brian Carlstrom7940e442013-07-12 13:46:57 -070055 * Compare two 64-bit values
56 * x = y return 0
57 * x < y return -1
58 * x > y return 1
59 */
60void X86Mir2Lir::GenCmpLong(RegLocation rl_dest, RegLocation rl_src1,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070061 RegLocation rl_src2) {
Brian Carlstrom7940e442013-07-12 13:46:57 -070062 FlushAllRegs();
63 LockCallTemps(); // Prepare for explicit register usage
buzbee2700f7e2014-03-07 09:46:20 -080064 RegStorage r_tmp1(RegStorage::k64BitPair, r0, r1);
65 RegStorage r_tmp2(RegStorage::k64BitPair, r2, r3);
66 LoadValueDirectWideFixed(rl_src1, r_tmp1);
67 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Brian Carlstrom7940e442013-07-12 13:46:57 -070068 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -080069 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
70 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -070071 NewLIR2(kX86Set8R, r2, kX86CondL); // r2 = (r1:r0) < (r3:r2) ? 1 : 0
72 NewLIR2(kX86Movzx8RR, r2, r2);
buzbee2700f7e2014-03-07 09:46:20 -080073 OpReg(kOpNeg, rs_r2); // r2 = -r2
74 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = high | low - sets ZF
Brian Carlstrom7940e442013-07-12 13:46:57 -070075 NewLIR2(kX86Set8R, r0, kX86CondNz); // r0 = (r1:r0) != (r3:r2) ? 1 : 0
76 NewLIR2(kX86Movzx8RR, r0, r0);
buzbee2700f7e2014-03-07 09:46:20 -080077 OpRegReg(kOpOr, rs_r0, rs_r2); // r0 = r0 | r2
Brian Carlstrom7940e442013-07-12 13:46:57 -070078 RegLocation rl_result = LocCReturn();
79 StoreValue(rl_dest, rl_result);
80}
81
82X86ConditionCode X86ConditionEncoding(ConditionCode cond) {
83 switch (cond) {
84 case kCondEq: return kX86CondEq;
85 case kCondNe: return kX86CondNe;
86 case kCondCs: return kX86CondC;
87 case kCondCc: return kX86CondNc;
Vladimir Marko58af1f92013-12-19 13:31:15 +000088 case kCondUlt: return kX86CondC;
89 case kCondUge: return kX86CondNc;
Brian Carlstrom7940e442013-07-12 13:46:57 -070090 case kCondMi: return kX86CondS;
91 case kCondPl: return kX86CondNs;
92 case kCondVs: return kX86CondO;
93 case kCondVc: return kX86CondNo;
94 case kCondHi: return kX86CondA;
95 case kCondLs: return kX86CondBe;
96 case kCondGe: return kX86CondGe;
97 case kCondLt: return kX86CondL;
98 case kCondGt: return kX86CondG;
99 case kCondLe: return kX86CondLe;
100 case kCondAl:
101 case kCondNv: LOG(FATAL) << "Should not reach here";
102 }
103 return kX86CondO;
104}
105
buzbee2700f7e2014-03-07 09:46:20 -0800106LIR* X86Mir2Lir::OpCmpBranch(ConditionCode cond, RegStorage src1, RegStorage src2, LIR* target) {
107 NewLIR2(kX86Cmp32RR, src1.GetReg(), src2.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700108 X86ConditionCode cc = X86ConditionEncoding(cond);
109 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ ,
110 cc);
111 branch->target = target;
112 return branch;
113}
114
buzbee2700f7e2014-03-07 09:46:20 -0800115LIR* X86Mir2Lir::OpCmpImmBranch(ConditionCode cond, RegStorage reg,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700116 int check_value, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700117 if ((check_value == 0) && (cond == kCondEq || cond == kCondNe)) {
118 // TODO: when check_value == 0 and reg is rCX, use the jcxz/nz opcode
buzbee2700f7e2014-03-07 09:46:20 -0800119 NewLIR2(kX86Test32RR, reg.GetReg(), reg.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700120 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800121 NewLIR2(IS_SIMM8(check_value) ? kX86Cmp32RI8 : kX86Cmp32RI, reg.GetReg(), check_value);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700122 }
123 X86ConditionCode cc = X86ConditionEncoding(cond);
124 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ , cc);
125 branch->target = target;
126 return branch;
127}
128
buzbee2700f7e2014-03-07 09:46:20 -0800129LIR* X86Mir2Lir::OpRegCopyNoInsert(RegStorage r_dest, RegStorage r_src) {
130 // If src or dest is a pair, we'll be using low reg.
131 if (r_dest.IsPair()) {
132 r_dest = r_dest.GetLow();
133 }
134 if (r_src.IsPair()) {
135 r_src = r_src.GetLow();
136 }
137 if (X86_FPREG(r_dest.GetReg()) || X86_FPREG(r_src.GetReg()))
Brian Carlstrom7940e442013-07-12 13:46:57 -0700138 return OpFpRegCopy(r_dest, r_src);
139 LIR* res = RawLIR(current_dalvik_offset_, kX86Mov32RR,
buzbee2700f7e2014-03-07 09:46:20 -0800140 r_dest.GetReg(), r_src.GetReg());
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800141 if (!(cu_->disable_opt & (1 << kSafeOptimizations)) && r_dest == r_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700142 res->flags.is_nop = true;
143 }
144 return res;
145}
146
buzbee2700f7e2014-03-07 09:46:20 -0800147LIR* X86Mir2Lir::OpRegCopy(RegStorage r_dest, RegStorage r_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700148 LIR *res = OpRegCopyNoInsert(r_dest, r_src);
149 AppendLIR(res);
150 return res;
151}
152
buzbee2700f7e2014-03-07 09:46:20 -0800153void X86Mir2Lir::OpRegCopyWide(RegStorage r_dest, RegStorage r_src) {
154 // FIXME: handle k64BitSolo when we start using them.
155 DCHECK(r_dest.IsPair());
156 DCHECK(r_src.IsPair());
157 bool dest_fp = X86_FPREG(r_dest.GetLowReg());
158 bool src_fp = X86_FPREG(r_src.GetLowReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700159 if (dest_fp) {
160 if (src_fp) {
buzbee2700f7e2014-03-07 09:46:20 -0800161 // TODO: we ought to handle this case here - reserve OpRegCopy for 32-bit copies.
162 OpRegCopy(RegStorage::Solo64(S2d(r_dest.GetLowReg(), r_dest.GetHighReg())),
163 RegStorage::Solo64(S2d(r_src.GetLowReg(), r_src.GetHighReg())));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700164 } else {
165 // TODO: Prevent this from happening in the code. The result is often
166 // unused or could have been loaded more easily from memory.
buzbee2700f7e2014-03-07 09:46:20 -0800167 NewLIR2(kX86MovdxrRR, r_dest.GetLowReg(), r_src.GetLowReg());
168 RegStorage r_tmp = AllocTempDouble();
169 NewLIR2(kX86MovdxrRR, r_tmp.GetLowReg(), r_src.GetHighReg());
170 NewLIR2(kX86PunpckldqRR, r_dest.GetLowReg(), r_tmp.GetLowReg());
171 FreeTemp(r_tmp);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700172 }
173 } else {
174 if (src_fp) {
buzbee2700f7e2014-03-07 09:46:20 -0800175 NewLIR2(kX86MovdrxRR, r_dest.GetLowReg(), r_src.GetLowReg());
176 NewLIR2(kX86PsrlqRI, r_src.GetLowReg(), 32);
177 NewLIR2(kX86MovdrxRR, r_dest.GetHighReg(), r_src.GetLowReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700178 } else {
179 // Handle overlap
buzbee2700f7e2014-03-07 09:46:20 -0800180 if (r_src.GetHighReg() == r_dest.GetLowReg() && r_src.GetLowReg() == r_dest.GetHighReg()) {
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800181 // Deal with cycles.
buzbee2700f7e2014-03-07 09:46:20 -0800182 RegStorage temp_reg = AllocTemp();
183 OpRegCopy(temp_reg, r_dest.GetHigh());
184 OpRegCopy(r_dest.GetHigh(), r_dest.GetLow());
185 OpRegCopy(r_dest.GetLow(), temp_reg);
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800186 FreeTemp(temp_reg);
buzbee2700f7e2014-03-07 09:46:20 -0800187 } else if (r_src.GetHighReg() == r_dest.GetLowReg()) {
188 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
189 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700190 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800191 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
192 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700193 }
194 }
195 }
196}
197
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700198void X86Mir2Lir::GenSelect(BasicBlock* bb, MIR* mir) {
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800199 RegLocation rl_result;
200 RegLocation rl_src = mir_graph_->GetSrc(mir, 0);
201 RegLocation rl_dest = mir_graph_->GetDest(mir);
202 rl_src = LoadValue(rl_src, kCoreReg);
Vladimir Markoa1a70742014-03-03 10:28:05 +0000203 ConditionCode ccode = mir->meta.ccode;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800204
205 // The kMirOpSelect has two variants, one for constants and one for moves.
206 const bool is_constant_case = (mir->ssa_rep->num_uses == 1);
207
208 if (is_constant_case) {
209 int true_val = mir->dalvikInsn.vB;
210 int false_val = mir->dalvikInsn.vC;
211 rl_result = EvalLoc(rl_dest, kCoreReg, true);
212
213 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000214 * For ccode == kCondEq:
215 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800216 * 1) When the true case is zero and result_reg is not same as src_reg:
217 * xor result_reg, result_reg
218 * cmp $0, src_reg
219 * mov t1, $false_case
220 * cmovnz result_reg, t1
221 * 2) When the false case is zero and result_reg is not same as src_reg:
222 * xor result_reg, result_reg
223 * cmp $0, src_reg
224 * mov t1, $true_case
225 * cmovz result_reg, t1
226 * 3) All other cases (we do compare first to set eflags):
227 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000228 * mov result_reg, $false_case
229 * mov t1, $true_case
230 * cmovz result_reg, t1
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800231 */
buzbee2700f7e2014-03-07 09:46:20 -0800232 const bool result_reg_same_as_src =
233 (rl_src.location == kLocPhysReg && rl_src.reg.GetReg() == rl_result.reg.GetReg());
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800234 const bool true_zero_case = (true_val == 0 && false_val != 0 && !result_reg_same_as_src);
235 const bool false_zero_case = (false_val == 0 && true_val != 0 && !result_reg_same_as_src);
236 const bool catch_all_case = !(true_zero_case || false_zero_case);
237
238 if (true_zero_case || false_zero_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800239 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800240 }
241
242 if (true_zero_case || false_zero_case || catch_all_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800243 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800244 }
245
246 if (catch_all_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800247 OpRegImm(kOpMov, rl_result.reg, false_val);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800248 }
249
250 if (true_zero_case || false_zero_case || catch_all_case) {
Vladimir Markoa1a70742014-03-03 10:28:05 +0000251 ConditionCode cc = true_zero_case ? NegateComparison(ccode) : ccode;
252 int immediateForTemp = true_zero_case ? false_val : true_val;
buzbee2700f7e2014-03-07 09:46:20 -0800253 RegStorage temp1_reg = AllocTemp();
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800254 OpRegImm(kOpMov, temp1_reg, immediateForTemp);
255
buzbee2700f7e2014-03-07 09:46:20 -0800256 OpCondRegReg(kOpCmov, cc, rl_result.reg, temp1_reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800257
258 FreeTemp(temp1_reg);
259 }
260 } else {
261 RegLocation rl_true = mir_graph_->GetSrc(mir, 1);
262 RegLocation rl_false = mir_graph_->GetSrc(mir, 2);
263 rl_true = LoadValue(rl_true, kCoreReg);
264 rl_false = LoadValue(rl_false, kCoreReg);
265 rl_result = EvalLoc(rl_dest, kCoreReg, true);
266
267 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000268 * For ccode == kCondEq:
269 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800270 * 1) When true case is already in place:
271 * cmp $0, src_reg
272 * cmovnz result_reg, false_reg
273 * 2) When false case is already in place:
274 * cmp $0, src_reg
275 * cmovz result_reg, true_reg
276 * 3) When neither cases are in place:
277 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000278 * mov result_reg, false_reg
279 * cmovz result_reg, true_reg
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800280 */
281
282 // kMirOpSelect is generated just for conditional cases when comparison is done with zero.
buzbee2700f7e2014-03-07 09:46:20 -0800283 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800284
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000285 if (rl_result.reg.GetReg() == rl_true.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800286 OpCondRegReg(kOpCmov, NegateComparison(ccode), rl_result.reg, rl_false.reg);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000287 } else if (rl_result.reg.GetReg() == rl_false.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800288 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800289 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800290 OpRegCopy(rl_result.reg, rl_false.reg);
291 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800292 }
293 }
294
295 StoreValue(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700296}
297
298void X86Mir2Lir::GenFusedLongCmpBranch(BasicBlock* bb, MIR* mir) {
buzbee0d829482013-10-11 15:24:55 -0700299 LIR* taken = &block_label_list_[bb->taken];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700300 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
301 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
Vladimir Markoa8946072014-01-22 10:30:44 +0000302 ConditionCode ccode = mir->meta.ccode;
Mark Mendell412d4f82013-12-18 13:32:36 -0800303
304 if (rl_src1.is_const) {
305 std::swap(rl_src1, rl_src2);
306 ccode = FlipComparisonOrder(ccode);
307 }
308 if (rl_src2.is_const) {
309 // Do special compare/branch against simple const operand
310 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
311 GenFusedLongCmpImmBranch(bb, rl_src1, val, ccode);
312 return;
313 }
314
Brian Carlstrom7940e442013-07-12 13:46:57 -0700315 FlushAllRegs();
316 LockCallTemps(); // Prepare for explicit register usage
buzbee2700f7e2014-03-07 09:46:20 -0800317 RegStorage r_tmp1(RegStorage::k64BitPair, r0, r1);
318 RegStorage r_tmp2(RegStorage::k64BitPair, r2, r3);
319 LoadValueDirectWideFixed(rl_src1, r_tmp1);
320 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700321 // Swap operands and condition code to prevent use of zero flag.
322 if (ccode == kCondLe || ccode == kCondGt) {
323 // Compute (r3:r2) = (r3:r2) - (r1:r0)
buzbee2700f7e2014-03-07 09:46:20 -0800324 OpRegReg(kOpSub, rs_r2, rs_r0); // r2 = r2 - r0
325 OpRegReg(kOpSbc, rs_r3, rs_r1); // r3 = r3 - r1 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700326 } else {
327 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -0800328 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
329 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700330 }
331 switch (ccode) {
332 case kCondEq:
333 case kCondNe:
buzbee2700f7e2014-03-07 09:46:20 -0800334 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = r0 | r1
Brian Carlstrom7940e442013-07-12 13:46:57 -0700335 break;
336 case kCondLe:
337 ccode = kCondGe;
338 break;
339 case kCondGt:
340 ccode = kCondLt;
341 break;
342 case kCondLt:
343 case kCondGe:
344 break;
345 default:
346 LOG(FATAL) << "Unexpected ccode: " << ccode;
347 }
348 OpCondBranch(ccode, taken);
349}
350
Mark Mendell412d4f82013-12-18 13:32:36 -0800351void X86Mir2Lir::GenFusedLongCmpImmBranch(BasicBlock* bb, RegLocation rl_src1,
352 int64_t val, ConditionCode ccode) {
353 int32_t val_lo = Low32Bits(val);
354 int32_t val_hi = High32Bits(val);
355 LIR* taken = &block_label_list_[bb->taken];
356 LIR* not_taken = &block_label_list_[bb->fall_through];
357 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800358 RegStorage low_reg = rl_src1.reg.GetLow();
359 RegStorage high_reg = rl_src1.reg.GetHigh();
Mark Mendell412d4f82013-12-18 13:32:36 -0800360
361 if (val == 0 && (ccode == kCondEq || ccode == kCondNe)) {
buzbee2700f7e2014-03-07 09:46:20 -0800362 RegStorage t_reg = AllocTemp();
Mark Mendell412d4f82013-12-18 13:32:36 -0800363 OpRegRegReg(kOpOr, t_reg, low_reg, high_reg);
364 FreeTemp(t_reg);
365 OpCondBranch(ccode, taken);
366 return;
367 }
368
369 OpRegImm(kOpCmp, high_reg, val_hi);
370 switch (ccode) {
371 case kCondEq:
372 case kCondNe:
373 OpCondBranch(kCondNe, (ccode == kCondEq) ? not_taken : taken);
374 break;
375 case kCondLt:
376 OpCondBranch(kCondLt, taken);
377 OpCondBranch(kCondGt, not_taken);
378 ccode = kCondUlt;
379 break;
380 case kCondLe:
381 OpCondBranch(kCondLt, taken);
382 OpCondBranch(kCondGt, not_taken);
383 ccode = kCondLs;
384 break;
385 case kCondGt:
386 OpCondBranch(kCondGt, taken);
387 OpCondBranch(kCondLt, not_taken);
388 ccode = kCondHi;
389 break;
390 case kCondGe:
391 OpCondBranch(kCondGt, taken);
392 OpCondBranch(kCondLt, not_taken);
393 ccode = kCondUge;
394 break;
395 default:
396 LOG(FATAL) << "Unexpected ccode: " << ccode;
397 }
398 OpCmpImmBranch(ccode, low_reg, val_lo, taken);
399}
400
Mark Mendell2bf31e62014-01-23 12:13:40 -0800401void X86Mir2Lir::CalculateMagicAndShift(int divisor, int& magic, int& shift) {
402 // It does not make sense to calculate magic and shift for zero divisor.
403 DCHECK_NE(divisor, 0);
404
405 /* According to H.S.Warren's Hacker's Delight Chapter 10 and
406 * T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
407 * The magic number M and shift S can be calculated in the following way:
408 * Let nc be the most positive value of numerator(n) such that nc = kd - 1,
409 * where divisor(d) >=2.
410 * Let nc be the most negative value of numerator(n) such that nc = kd + 1,
411 * where divisor(d) <= -2.
412 * Thus nc can be calculated like:
413 * nc = 2^31 + 2^31 % d - 1, where d >= 2
414 * nc = -2^31 + (2^31 + 1) % d, where d >= 2.
415 *
416 * So the shift p is the smallest p satisfying
417 * 2^p > nc * (d - 2^p % d), where d >= 2
418 * 2^p > nc * (d + 2^p % d), where d <= -2.
419 *
420 * the magic number M is calcuated by
421 * M = (2^p + d - 2^p % d) / d, where d >= 2
422 * M = (2^p - d - 2^p % d) / d, where d <= -2.
423 *
424 * Notice that p is always bigger than or equal to 32, so we just return 32-p as
425 * the shift number S.
426 */
427
428 int32_t p = 31;
429 const uint32_t two31 = 0x80000000U;
430
431 // Initialize the computations.
432 uint32_t abs_d = (divisor >= 0) ? divisor : -divisor;
433 uint32_t tmp = two31 + (static_cast<uint32_t>(divisor) >> 31);
434 uint32_t abs_nc = tmp - 1 - tmp % abs_d;
435 uint32_t quotient1 = two31 / abs_nc;
436 uint32_t remainder1 = two31 % abs_nc;
437 uint32_t quotient2 = two31 / abs_d;
438 uint32_t remainder2 = two31 % abs_d;
439
440 /*
441 * To avoid handling both positive and negative divisor, Hacker's Delight
442 * introduces a method to handle these 2 cases together to avoid duplication.
443 */
444 uint32_t delta;
445 do {
446 p++;
447 quotient1 = 2 * quotient1;
448 remainder1 = 2 * remainder1;
449 if (remainder1 >= abs_nc) {
450 quotient1++;
451 remainder1 = remainder1 - abs_nc;
452 }
453 quotient2 = 2 * quotient2;
454 remainder2 = 2 * remainder2;
455 if (remainder2 >= abs_d) {
456 quotient2++;
457 remainder2 = remainder2 - abs_d;
458 }
459 delta = abs_d - remainder2;
460 } while (quotient1 < delta || (quotient1 == delta && remainder1 == 0));
461
462 magic = (divisor > 0) ? (quotient2 + 1) : (-quotient2 - 1);
463 shift = p - 32;
464}
465
buzbee2700f7e2014-03-07 09:46:20 -0800466RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegStorage reg_lo, int lit, bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700467 LOG(FATAL) << "Unexpected use of GenDivRemLit for x86";
468 return rl_dest;
469}
470
Mark Mendell2bf31e62014-01-23 12:13:40 -0800471RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegLocation rl_src,
472 int imm, bool is_div) {
473 // Use a multiply (and fixup) to perform an int div/rem by a constant.
474
475 // We have to use fixed registers, so flush all the temps.
476 FlushAllRegs();
477 LockCallTemps(); // Prepare for explicit register usage.
478
479 // Assume that the result will be in EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800480 RegLocation rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, kVectorNotUsed, rs_r2,
481 INVALID_SREG, INVALID_SREG};
Mark Mendell2bf31e62014-01-23 12:13:40 -0800482
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700483 // handle div/rem by 1 special case.
484 if (imm == 1) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800485 if (is_div) {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700486 // x / 1 == x.
487 StoreValue(rl_result, rl_src);
488 } else {
489 // x % 1 == 0.
buzbee2700f7e2014-03-07 09:46:20 -0800490 LoadConstantNoClobber(rs_r0, 0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700491 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000492 rl_result.reg.SetReg(r0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700493 }
494 } else if (imm == -1) { // handle 0x80000000 / -1 special case.
495 if (is_div) {
496 LIR *minint_branch = 0;
buzbee2700f7e2014-03-07 09:46:20 -0800497 LoadValueDirectFixed(rl_src, rs_r0);
498 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800499 minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
500
501 // for x != MIN_INT, x / -1 == -x.
502 NewLIR1(kX86Neg32R, r0);
503
504 LIR* branch_around = NewLIR1(kX86Jmp8, 0);
505 // The target for cmp/jmp above.
506 minint_branch->target = NewLIR0(kPseudoTargetLabel);
507 // EAX already contains the right value (0x80000000),
508 branch_around->target = NewLIR0(kPseudoTargetLabel);
509 } else {
510 // x % -1 == 0.
buzbee2700f7e2014-03-07 09:46:20 -0800511 LoadConstantNoClobber(rs_r0, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800512 }
513 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000514 rl_result.reg.SetReg(r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800515 } else {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700516 CHECK(imm <= -2 || imm >= 2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800517 // Use H.S.Warren's Hacker's Delight Chapter 10 and
518 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
519 int magic, shift;
520 CalculateMagicAndShift(imm, magic, shift);
521
522 /*
523 * For imm >= 2,
524 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
525 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
526 * For imm <= -2,
527 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
528 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
529 * We implement this algorithm in the following way:
530 * 1. multiply magic number m and numerator n, get the higher 32bit result in EDX
531 * 2. if imm > 0 and magic < 0, add numerator to EDX
532 * if imm < 0 and magic > 0, sub numerator from EDX
533 * 3. if S !=0, SAR S bits for EDX
534 * 4. add 1 to EDX if EDX < 0
535 * 5. Thus, EDX is the quotient
536 */
537
538 // Numerator into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800539 RegStorage numerator_reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800540 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
541 // We will need the value later.
542 if (rl_src.location == kLocPhysReg) {
543 // We can use it directly.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000544 DCHECK(rl_src.reg.GetReg() != r0 && rl_src.reg.GetReg() != r2);
buzbee2700f7e2014-03-07 09:46:20 -0800545 numerator_reg = rl_src.reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800546 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800547 numerator_reg = rs_r1;
548 LoadValueDirectFixed(rl_src, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800549 }
buzbee2700f7e2014-03-07 09:46:20 -0800550 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800551 } else {
552 // Only need this once. Just put it into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800553 LoadValueDirectFixed(rl_src, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800554 }
555
556 // EDX = magic.
buzbee2700f7e2014-03-07 09:46:20 -0800557 LoadConstantNoClobber(rs_r2, magic);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800558
559 // EDX:EAX = magic & dividend.
560 NewLIR1(kX86Imul32DaR, r2);
561
562 if (imm > 0 && magic < 0) {
563 // Add numerator to EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800564 DCHECK(numerator_reg.Valid());
565 NewLIR2(kX86Add32RR, r2, numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800566 } else if (imm < 0 && magic > 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800567 DCHECK(numerator_reg.Valid());
568 NewLIR2(kX86Sub32RR, r2, numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800569 }
570
571 // Do we need the shift?
572 if (shift != 0) {
573 // Shift EDX by 'shift' bits.
574 NewLIR2(kX86Sar32RI, r2, shift);
575 }
576
577 // Add 1 to EDX if EDX < 0.
578
579 // Move EDX to EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800580 OpRegCopy(rs_r0, rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800581
582 // Move sign bit to bit 0, zeroing the rest.
583 NewLIR2(kX86Shr32RI, r2, 31);
584
585 // EDX = EDX + EAX.
586 NewLIR2(kX86Add32RR, r2, r0);
587
588 // Quotient is in EDX.
589 if (!is_div) {
590 // We need to compute the remainder.
591 // Remainder is divisor - (quotient * imm).
buzbee2700f7e2014-03-07 09:46:20 -0800592 DCHECK(numerator_reg.Valid());
593 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800594
595 // EAX = numerator * imm.
buzbee2700f7e2014-03-07 09:46:20 -0800596 OpRegRegImm(kOpMul, rs_r2, rs_r2, imm);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800597
598 // EDX -= EAX.
599 NewLIR2(kX86Sub32RR, r0, r2);
600
601 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000602 rl_result.reg.SetReg(r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800603 }
604 }
605
606 return rl_result;
607}
608
buzbee2700f7e2014-03-07 09:46:20 -0800609RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegStorage reg_lo, RegStorage reg_hi,
610 bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700611 LOG(FATAL) << "Unexpected use of GenDivRem for x86";
612 return rl_dest;
613}
614
Mark Mendell2bf31e62014-01-23 12:13:40 -0800615RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegLocation rl_src1,
616 RegLocation rl_src2, bool is_div, bool check_zero) {
617 // We have to use fixed registers, so flush all the temps.
618 FlushAllRegs();
619 LockCallTemps(); // Prepare for explicit register usage.
620
621 // Load LHS into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800622 LoadValueDirectFixed(rl_src1, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800623
624 // Load RHS into EBX.
buzbee2700f7e2014-03-07 09:46:20 -0800625 LoadValueDirectFixed(rl_src2, rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800626
627 // Copy LHS sign bit into EDX.
628 NewLIR0(kx86Cdq32Da);
629
630 if (check_zero) {
631 // Handle division by zero case.
buzbee2700f7e2014-03-07 09:46:20 -0800632 GenImmedCheck(kCondEq, rs_r1, 0, kThrowDivZero);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800633 }
634
635 // Have to catch 0x80000000/-1 case, or we will get an exception!
buzbee2700f7e2014-03-07 09:46:20 -0800636 OpRegImm(kOpCmp, rs_r1, -1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800637 LIR *minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
638
639 // RHS is -1.
buzbee2700f7e2014-03-07 09:46:20 -0800640 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800641 LIR * minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
642
643 // In 0x80000000/-1 case.
644 if (!is_div) {
645 // For DIV, EAX is already right. For REM, we need EDX 0.
buzbee2700f7e2014-03-07 09:46:20 -0800646 LoadConstantNoClobber(rs_r2, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800647 }
648 LIR* done = NewLIR1(kX86Jmp8, 0);
649
650 // Expected case.
651 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
652 minint_branch->target = minus_one_branch->target;
653 NewLIR1(kX86Idivmod32DaR, r1);
654 done->target = NewLIR0(kPseudoTargetLabel);
655
656 // Result is in EAX for div and EDX for rem.
buzbee2700f7e2014-03-07 09:46:20 -0800657 RegLocation rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, kVectorNotUsed, rs_r0,
658 INVALID_SREG, INVALID_SREG};
Mark Mendell2bf31e62014-01-23 12:13:40 -0800659 if (!is_div) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000660 rl_result.reg.SetReg(r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800661 }
662 return rl_result;
663}
664
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700665bool X86Mir2Lir::GenInlinedMinMaxInt(CallInfo* info, bool is_min) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700666 DCHECK_EQ(cu_->instruction_set, kX86);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800667
668 // Get the two arguments to the invoke and place them in GP registers.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700669 RegLocation rl_src1 = info->args[0];
670 RegLocation rl_src2 = info->args[1];
671 rl_src1 = LoadValue(rl_src1, kCoreReg);
672 rl_src2 = LoadValue(rl_src2, kCoreReg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800673
Brian Carlstrom7940e442013-07-12 13:46:57 -0700674 RegLocation rl_dest = InlineTarget(info);
675 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800676
677 /*
678 * If the result register is the same as the second element, then we need to be careful.
679 * The reason is that the first copy will inadvertently clobber the second element with
680 * the first one thus yielding the wrong result. Thus we do a swap in that case.
681 */
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000682 if (rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800683 std::swap(rl_src1, rl_src2);
684 }
685
686 // Pick the first integer as min/max.
buzbee2700f7e2014-03-07 09:46:20 -0800687 OpRegCopy(rl_result.reg, rl_src1.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800688
689 // If the integers are both in the same register, then there is nothing else to do
690 // because they are equal and we have already moved one into the result.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000691 if (rl_src1.reg.GetReg() != rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800692 // It is possible we didn't pick correctly so do the actual comparison now.
buzbee2700f7e2014-03-07 09:46:20 -0800693 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800694
695 // Conditionally move the other integer into the destination register.
696 ConditionCode condition_code = is_min ? kCondGt : kCondLt;
buzbee2700f7e2014-03-07 09:46:20 -0800697 OpCondRegReg(kOpCmov, condition_code, rl_result.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800698 }
699
Brian Carlstrom7940e442013-07-12 13:46:57 -0700700 StoreValue(rl_dest, rl_result);
701 return true;
702}
703
Vladimir Markoe508a202013-11-04 15:24:22 +0000704bool X86Mir2Lir::GenInlinedPeek(CallInfo* info, OpSize size) {
705 RegLocation rl_src_address = info->args[0]; // long address
buzbee2700f7e2014-03-07 09:46:20 -0800706 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[1]
Mark Mendell55d0eac2014-02-06 11:02:52 -0800707 RegLocation rl_dest = size == kLong ? InlineTargetWide(info) : InlineTarget(info);
Vladimir Markoe508a202013-11-04 15:24:22 +0000708 RegLocation rl_address = LoadValue(rl_src_address, kCoreReg);
709 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
710 if (size == kLong) {
711 // Unaligned access is allowed on x86.
buzbee2700f7e2014-03-07 09:46:20 -0800712 LoadBaseDispWide(rl_address.reg, 0, rl_result.reg, INVALID_SREG);
Vladimir Markoe508a202013-11-04 15:24:22 +0000713 StoreValueWide(rl_dest, rl_result);
714 } else {
715 DCHECK(size == kSignedByte || size == kSignedHalf || size == kWord);
716 // Unaligned access is allowed on x86.
buzbee2700f7e2014-03-07 09:46:20 -0800717 LoadBaseDisp(rl_address.reg, 0, rl_result.reg, size, INVALID_SREG);
Vladimir Markoe508a202013-11-04 15:24:22 +0000718 StoreValue(rl_dest, rl_result);
719 }
720 return true;
721}
722
723bool X86Mir2Lir::GenInlinedPoke(CallInfo* info, OpSize size) {
724 RegLocation rl_src_address = info->args[0]; // long address
buzbee2700f7e2014-03-07 09:46:20 -0800725 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[1]
Vladimir Markoe508a202013-11-04 15:24:22 +0000726 RegLocation rl_src_value = info->args[2]; // [size] value
727 RegLocation rl_address = LoadValue(rl_src_address, kCoreReg);
728 if (size == kLong) {
729 // Unaligned access is allowed on x86.
730 RegLocation rl_value = LoadValueWide(rl_src_value, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800731 StoreBaseDispWide(rl_address.reg, 0, rl_value.reg);
Vladimir Markoe508a202013-11-04 15:24:22 +0000732 } else {
733 DCHECK(size == kSignedByte || size == kSignedHalf || size == kWord);
734 // Unaligned access is allowed on x86.
735 RegLocation rl_value = LoadValue(rl_src_value, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800736 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size);
Vladimir Markoe508a202013-11-04 15:24:22 +0000737 }
738 return true;
739}
740
buzbee2700f7e2014-03-07 09:46:20 -0800741void X86Mir2Lir::OpLea(RegStorage r_base, RegStorage reg1, RegStorage reg2, int scale, int offset) {
742 NewLIR5(kX86Lea32RA, r_base.GetReg(), reg1.GetReg(), reg2.GetReg(), scale, offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700743}
744
Ian Rogers468532e2013-08-05 10:56:33 -0700745void X86Mir2Lir::OpTlsCmp(ThreadOffset offset, int val) {
746 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700747}
748
buzbee2700f7e2014-03-07 09:46:20 -0800749static bool IsInReg(X86Mir2Lir *pMir2Lir, const RegLocation &rl, RegStorage reg) {
750 return rl.reg.Valid() && rl.reg.GetReg() == reg.GetReg() && (pMir2Lir->IsLive(reg) || rl.home);
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700751}
752
Vladimir Marko1c282e22013-11-21 14:49:47 +0000753bool X86Mir2Lir::GenInlinedCas(CallInfo* info, bool is_long, bool is_object) {
Vladimir Markoc29bb612013-11-27 16:47:25 +0000754 DCHECK_EQ(cu_->instruction_set, kX86);
755 // Unused - RegLocation rl_src_unsafe = info->args[0];
756 RegLocation rl_src_obj = info->args[1]; // Object - known non-null
757 RegLocation rl_src_offset = info->args[2]; // long low
buzbee2700f7e2014-03-07 09:46:20 -0800758 rl_src_offset = NarrowRegLoc(rl_src_offset); // ignore high half in info->args[3]
Vladimir Markoc29bb612013-11-27 16:47:25 +0000759 RegLocation rl_src_expected = info->args[4]; // int, long or Object
760 // If is_long, high half is in info->args[5]
761 RegLocation rl_src_new_value = info->args[is_long ? 6 : 5]; // int, long or Object
762 // If is_long, high half is in info->args[7]
763
764 if (is_long) {
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700765 // TODO: avoid unnecessary loads of SI and DI when the values are in registers.
766 // TODO: CFI support.
Vladimir Marko70b797d2013-12-03 15:25:24 +0000767 FlushAllRegs();
768 LockCallTemps();
buzbee2700f7e2014-03-07 09:46:20 -0800769 RegStorage r_tmp1(RegStorage::k64BitPair, rAX, rDX);
770 RegStorage r_tmp2(RegStorage::k64BitPair, rBX, rCX);
771 LoadValueDirectWideFixed(rl_src_expected, r_tmp1);
772 LoadValueDirectWideFixed(rl_src_new_value, r_tmp2);
Vladimir Marko70b797d2013-12-03 15:25:24 +0000773 NewLIR1(kX86Push32R, rDI);
774 MarkTemp(rDI);
775 LockTemp(rDI);
776 NewLIR1(kX86Push32R, rSI);
777 MarkTemp(rSI);
778 LockTemp(rSI);
Vladimir Markoa6fd8ba2013-12-13 10:53:49 +0000779 const int push_offset = 4 /* push edi */ + 4 /* push esi */;
buzbee2700f7e2014-03-07 09:46:20 -0800780 int srcObjSp = IsInReg(this, rl_src_obj, rs_rSI) ? 0
781 : (IsInReg(this, rl_src_obj, rs_rDI) ? 4
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700782 : (SRegOffset(rl_src_obj.s_reg_low) + push_offset));
buzbee2700f7e2014-03-07 09:46:20 -0800783 LoadWordDisp(TargetReg(kSp), srcObjSp, rs_rDI);
784 int srcOffsetSp = IsInReg(this, rl_src_offset, rs_rSI) ? 0
785 : (IsInReg(this, rl_src_offset, rs_rDI) ? 4
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700786 : (SRegOffset(rl_src_offset.s_reg_low) + push_offset));
buzbee2700f7e2014-03-07 09:46:20 -0800787 LoadWordDisp(TargetReg(kSp), srcOffsetSp, rs_rSI);
Vladimir Marko70b797d2013-12-03 15:25:24 +0000788 NewLIR4(kX86LockCmpxchg8bA, rDI, rSI, 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800789
790 // After a store we need to insert barrier in case of potential load. Since the
791 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
792 GenMemBarrier(kStoreLoad);
793
Vladimir Marko70b797d2013-12-03 15:25:24 +0000794 FreeTemp(rSI);
795 UnmarkTemp(rSI);
796 NewLIR1(kX86Pop32R, rSI);
797 FreeTemp(rDI);
798 UnmarkTemp(rDI);
799 NewLIR1(kX86Pop32R, rDI);
800 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +0000801 } else {
802 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800803 FlushReg(rs_r0);
804 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000805
Vladimir Markoc29bb612013-11-27 16:47:25 +0000806 RegLocation rl_object = LoadValue(rl_src_obj, kCoreReg);
807 RegLocation rl_new_value = LoadValue(rl_src_new_value, kCoreReg);
808
809 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
810 // Mark card for object assuming new value is stored.
811 FreeTemp(r0); // Temporarily release EAX for MarkGCCard().
buzbee2700f7e2014-03-07 09:46:20 -0800812 MarkGCCard(rl_new_value.reg, rl_object.reg);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000813 LockTemp(r0);
814 }
815
816 RegLocation rl_offset = LoadValue(rl_src_offset, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800817 LoadValueDirect(rl_src_expected, rs_r0);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000818 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0, rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +0000819
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800820 // After a store we need to insert barrier in case of potential load. Since the
821 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
822 GenMemBarrier(kStoreLoad);
823
Vladimir Markoc29bb612013-11-27 16:47:25 +0000824 FreeTemp(r0);
825 }
826
827 // Convert ZF to boolean
828 RegLocation rl_dest = InlineTarget(info); // boolean place for result
829 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000830 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondZ);
831 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +0000832 StoreValue(rl_dest, rl_result);
833 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700834}
835
buzbee2700f7e2014-03-07 09:46:20 -0800836LIR* X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800837 CHECK(base_of_code_ != nullptr);
838
839 // Address the start of the method
840 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
841 LoadValueDirectFixed(rl_method, reg);
842 store_method_addr_used_ = true;
843
844 // Load the proper value from the literal area.
845 // We don't know the proper offset for the value, so pick one that will force
846 // 4 byte offset. We will fix this up in the assembler later to have the right
847 // value.
buzbee2700f7e2014-03-07 09:46:20 -0800848 LIR *res = RawLIR(current_dalvik_offset_, kX86Mov32RM, reg.GetReg(), reg.GetReg(), 256,
849 0, 0, target);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800850 res->target = target;
851 res->flags.fixup = kFixupLoad;
852 SetMemRefType(res, true, kLiteral);
853 store_method_addr_used_ = true;
854 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700855}
856
buzbee2700f7e2014-03-07 09:46:20 -0800857LIR* X86Mir2Lir::OpVldm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700858 LOG(FATAL) << "Unexpected use of OpVldm for x86";
859 return NULL;
860}
861
buzbee2700f7e2014-03-07 09:46:20 -0800862LIR* X86Mir2Lir::OpVstm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700863 LOG(FATAL) << "Unexpected use of OpVstm for x86";
864 return NULL;
865}
866
867void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
868 RegLocation rl_result, int lit,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700869 int first_bit, int second_bit) {
buzbee2700f7e2014-03-07 09:46:20 -0800870 RegStorage t_reg = AllocTemp();
871 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
872 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700873 FreeTemp(t_reg);
874 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800875 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700876 }
877}
878
buzbee2700f7e2014-03-07 09:46:20 -0800879void X86Mir2Lir::GenDivZeroCheck(RegStorage reg) {
880 DCHECK(reg.IsPair()); // TODO: allow 64BitSolo.
881 // We are not supposed to clobber the incoming storage, so allocate a temporary.
882 RegStorage t_reg = AllocTemp();
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800883
884 // Doing an OR is a quick way to check if both registers are zero. This will set the flags.
buzbee2700f7e2014-03-07 09:46:20 -0800885 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800886
887 // In case of zero, throw ArithmeticException.
888 GenCheck(kCondEq, kThrowDivZero);
889
890 // The temp is no longer needed so free it at this time.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700891 FreeTemp(t_reg);
892}
893
894// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700895LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
Ian Rogers468532e2013-08-05 10:56:33 -0700896 OpTlsCmp(Thread::ThreadFlagsOffset(), 0);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700897 return OpCondBranch((target == NULL) ? kCondNe : kCondEq, target);
898}
899
900// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -0800901LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700902 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -0800903 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700904}
905
buzbee11b63d12013-08-27 07:34:17 -0700906bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700907 RegLocation rl_src, RegLocation rl_dest, int lit) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700908 LOG(FATAL) << "Unexpected use of smallLiteralDive in x86";
909 return false;
910}
911
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700912LIR* X86Mir2Lir::OpIT(ConditionCode cond, const char* guide) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700913 LOG(FATAL) << "Unexpected use of OpIT in x86";
914 return NULL;
915}
916
buzbee2700f7e2014-03-07 09:46:20 -0800917void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -0800918 switch (val) {
919 case 0:
buzbee2700f7e2014-03-07 09:46:20 -0800920 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -0800921 break;
922 case 1:
923 OpRegCopy(dest, src);
924 break;
925 default:
926 OpRegRegImm(kOpMul, dest, src, val);
927 break;
928 }
929}
930
buzbee2700f7e2014-03-07 09:46:20 -0800931void X86Mir2Lir::GenImulMemImm(RegStorage dest, int sreg, int displacement, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -0800932 LIR *m;
933 switch (val) {
934 case 0:
buzbee2700f7e2014-03-07 09:46:20 -0800935 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -0800936 break;
937 case 1:
buzbee2700f7e2014-03-07 09:46:20 -0800938 LoadBaseDisp(rs_rX86_SP, displacement, dest, kWord, sreg);
Mark Mendell4708dcd2014-01-22 09:05:18 -0800939 break;
940 default:
buzbee2700f7e2014-03-07 09:46:20 -0800941 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(), rX86_SP,
Mark Mendell4708dcd2014-01-22 09:05:18 -0800942 displacement, val);
943 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
944 break;
945 }
946}
947
Mark Mendelle02d48f2014-01-15 11:19:23 -0800948void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700949 RegLocation rl_src2) {
Mark Mendell4708dcd2014-01-22 09:05:18 -0800950 if (rl_src1.is_const) {
951 std::swap(rl_src1, rl_src2);
952 }
953 // Are we multiplying by a constant?
954 if (rl_src2.is_const) {
955 // Do special compare/branch against simple const operand
956 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
957 if (val == 0) {
958 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -0800959 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
960 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -0800961 StoreValueWide(rl_dest, rl_result);
962 return;
963 } else if (val == 1) {
Mark Mendell4708dcd2014-01-22 09:05:18 -0800964 StoreValueWide(rl_dest, rl_src1);
965 return;
966 } else if (val == 2) {
967 GenAddLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1);
968 return;
969 } else if (IsPowerOfTwo(val)) {
970 int shift_amount = LowestSetBit(val);
971 if (!BadOverlap(rl_src1, rl_dest)) {
972 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
973 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest,
974 rl_src1, shift_amount);
975 StoreValueWide(rl_dest, rl_result);
976 return;
977 }
978 }
979
980 // Okay, just bite the bullet and do it.
981 int32_t val_lo = Low32Bits(val);
982 int32_t val_hi = High32Bits(val);
983 FlushAllRegs();
984 LockCallTemps(); // Prepare for explicit register usage.
985 rl_src1 = UpdateLocWide(rl_src1);
986 bool src1_in_reg = rl_src1.location == kLocPhysReg;
987 int displacement = SRegOffset(rl_src1.s_reg_low);
988
989 // ECX <- 1H * 2L
990 // EAX <- 1L * 2H
991 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -0800992 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
993 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -0800994 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800995 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
996 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -0800997 }
998
999 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
1000 NewLIR2(kX86Add32RR, r1, r0);
1001
1002 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001003 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001004
1005 // EDX:EAX <- 2L * 1L (double precision)
1006 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001007 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001008 } else {
1009 LIR *m = NewLIR2(kX86Mul32DaM, rX86_SP, displacement + LOWORD_OFFSET);
1010 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1011 true /* is_load */, true /* is_64bit */);
1012 }
1013
1014 // EDX <- EDX + ECX (add high words)
1015 NewLIR2(kX86Add32RR, r2, r1);
1016
1017 // Result is EDX:EAX
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001018 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, kVectorNotUsed,
buzbee2700f7e2014-03-07 09:46:20 -08001019 RegStorage::MakeRegPair(rs_r0, rs_r2),
Mark Mendell4708dcd2014-01-22 09:05:18 -08001020 INVALID_SREG, INVALID_SREG};
1021 StoreValueWide(rl_dest, rl_result);
1022 return;
1023 }
1024
1025 // Nope. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001026 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1027 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1028 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1029
Mark Mendell4708dcd2014-01-22 09:05:18 -08001030 FlushAllRegs();
1031 LockCallTemps(); // Prepare for explicit register usage.
1032 rl_src1 = UpdateLocWide(rl_src1);
1033 rl_src2 = UpdateLocWide(rl_src2);
1034
1035 // At this point, the VRs are in their home locations.
1036 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1037 bool src2_in_reg = rl_src2.location == kLocPhysReg;
1038
1039 // ECX <- 1H
1040 if (src1_in_reg) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001041 NewLIR2(kX86Mov32RR, r1, rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001042 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001043 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1,
Mark Mendell4708dcd2014-01-22 09:05:18 -08001044 kWord, GetSRegHi(rl_src1.s_reg_low));
1045 }
1046
Mark Mendellde99bba2014-02-14 12:15:02 -08001047 if (is_square) {
1048 // Take advantage of the fact that the values are the same.
1049 // ECX <- ECX * 2L (1H * 2L)
1050 if (src2_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001051 NewLIR2(kX86Imul32RR, r1, rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001052 } else {
1053 int displacement = SRegOffset(rl_src2.s_reg_low);
1054 LIR *m = NewLIR3(kX86Imul32RM, r1, rX86_SP, displacement + LOWORD_OFFSET);
1055 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1056 true /* is_load */, true /* is_64bit */);
1057 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001058
Mark Mendellde99bba2014-02-14 12:15:02 -08001059 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
1060 NewLIR2(kX86Add32RR, r1, r1);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001061 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001062 // EAX <- 2H
1063 if (src2_in_reg) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001064 NewLIR2(kX86Mov32RR, r0, rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001065 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001066 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0,
Mark Mendellde99bba2014-02-14 12:15:02 -08001067 kWord, GetSRegHi(rl_src2.s_reg_low));
1068 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001069
Mark Mendellde99bba2014-02-14 12:15:02 -08001070 // EAX <- EAX * 1L (2H * 1L)
1071 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001072 NewLIR2(kX86Imul32RR, r0, rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001073 } else {
1074 int displacement = SRegOffset(rl_src1.s_reg_low);
1075 LIR *m = NewLIR3(kX86Imul32RM, r0, rX86_SP, displacement + LOWORD_OFFSET);
1076 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1077 true /* is_load */, true /* is_64bit */);
1078 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001079
Mark Mendellde99bba2014-02-14 12:15:02 -08001080 // ECX <- ECX * 2L (1H * 2L)
1081 if (src2_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001082 NewLIR2(kX86Imul32RR, r1, rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001083 } else {
1084 int displacement = SRegOffset(rl_src2.s_reg_low);
1085 LIR *m = NewLIR3(kX86Imul32RM, r1, rX86_SP, displacement + LOWORD_OFFSET);
1086 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1087 true /* is_load */, true /* is_64bit */);
1088 }
1089
1090 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
1091 NewLIR2(kX86Add32RR, r1, r0);
1092 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001093
1094 // EAX <- 2L
1095 if (src2_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001096 NewLIR2(kX86Mov32RR, r0, rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001097 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001098 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0,
Mark Mendell4708dcd2014-01-22 09:05:18 -08001099 kWord, rl_src2.s_reg_low);
1100 }
1101
1102 // EDX:EAX <- 2L * 1L (double precision)
1103 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001104 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001105 } else {
1106 int displacement = SRegOffset(rl_src1.s_reg_low);
1107 LIR *m = NewLIR2(kX86Mul32DaM, rX86_SP, displacement + LOWORD_OFFSET);
1108 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1109 true /* is_load */, true /* is_64bit */);
1110 }
1111
1112 // EDX <- EDX + ECX (add high words)
1113 NewLIR2(kX86Add32RR, r2, r1);
1114
1115 // Result is EDX:EAX
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001116 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, kVectorNotUsed,
buzbee2700f7e2014-03-07 09:46:20 -08001117 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001118 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001119}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001120
1121void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1122 Instruction::Code op) {
1123 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1124 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1125 if (rl_src.location == kLocPhysReg) {
1126 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001127 // But we must ensure that rl_src is in pair
1128 rl_src = EvalLocWide(rl_src, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001129 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001130 // The registers are the same, so we would clobber it before the use.
buzbee2700f7e2014-03-07 09:46:20 -08001131 RegStorage temp_reg = AllocTemp();
1132 OpRegCopy(temp_reg, rl_dest.reg);
1133 rl_src.reg.SetHighReg(temp_reg.GetReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001134 }
buzbee2700f7e2014-03-07 09:46:20 -08001135 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001136
1137 x86op = GetOpcode(op, rl_dest, rl_src, true);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001138 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
buzbee2700f7e2014-03-07 09:46:20 -08001139 FreeTemp(rl_src.reg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001140 return;
1141 }
1142
1143 // RHS is in memory.
1144 DCHECK((rl_src.location == kLocDalvikFrame) ||
1145 (rl_src.location == kLocCompilerTemp));
buzbee2700f7e2014-03-07 09:46:20 -08001146 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001147 int displacement = SRegOffset(rl_src.s_reg_low);
1148
buzbee2700f7e2014-03-07 09:46:20 -08001149 LIR *lir = NewLIR3(x86op, rl_dest.reg.GetLowReg(), r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001150 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1151 true /* is_load */, true /* is64bit */);
1152 x86op = GetOpcode(op, rl_dest, rl_src, true);
buzbee2700f7e2014-03-07 09:46:20 -08001153 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001154 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1155 true /* is_load */, true /* is64bit */);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001156}
1157
Mark Mendelle02d48f2014-01-15 11:19:23 -08001158void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
1159 rl_dest = UpdateLocWide(rl_dest);
1160 if (rl_dest.location == kLocPhysReg) {
1161 // Ensure we are in a register pair
1162 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1163
1164 rl_src = UpdateLocWide(rl_src);
1165 GenLongRegOrMemOp(rl_result, rl_src, op);
1166 StoreFinalValueWide(rl_dest, rl_result);
1167 return;
1168 }
1169
1170 // It wasn't in registers, so it better be in memory.
1171 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1172 (rl_dest.location == kLocCompilerTemp));
1173 rl_src = LoadValueWide(rl_src, kCoreReg);
1174
1175 // Operate directly into memory.
1176 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
buzbee2700f7e2014-03-07 09:46:20 -08001177 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001178 int displacement = SRegOffset(rl_dest.s_reg_low);
1179
buzbee2700f7e2014-03-07 09:46:20 -08001180 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001181 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001182 true /* is_load */, true /* is64bit */);
1183 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001184 false /* is_load */, true /* is64bit */);
1185 x86op = GetOpcode(op, rl_dest, rl_src, true);
buzbee2700f7e2014-03-07 09:46:20 -08001186 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001187 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001188 true /* is_load */, true /* is64bit */);
1189 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001190 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -08001191 FreeTemp(rl_src.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001192}
1193
Mark Mendelle02d48f2014-01-15 11:19:23 -08001194void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
1195 RegLocation rl_src2, Instruction::Code op,
1196 bool is_commutative) {
1197 // Is this really a 2 operand operation?
1198 switch (op) {
1199 case Instruction::ADD_LONG_2ADDR:
1200 case Instruction::SUB_LONG_2ADDR:
1201 case Instruction::AND_LONG_2ADDR:
1202 case Instruction::OR_LONG_2ADDR:
1203 case Instruction::XOR_LONG_2ADDR:
1204 GenLongArith(rl_dest, rl_src2, op);
1205 return;
1206 default:
1207 break;
1208 }
1209
1210 if (rl_dest.location == kLocPhysReg) {
1211 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
1212
1213 // We are about to clobber the LHS, so it needs to be a temp.
1214 rl_result = ForceTempWide(rl_result);
1215
1216 // Perform the operation using the RHS.
1217 rl_src2 = UpdateLocWide(rl_src2);
1218 GenLongRegOrMemOp(rl_result, rl_src2, op);
1219
1220 // And now record that the result is in the temp.
1221 StoreFinalValueWide(rl_dest, rl_result);
1222 return;
1223 }
1224
1225 // It wasn't in registers, so it better be in memory.
1226 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1227 (rl_dest.location == kLocCompilerTemp));
1228 rl_src1 = UpdateLocWide(rl_src1);
1229 rl_src2 = UpdateLocWide(rl_src2);
1230
1231 // Get one of the source operands into temporary register.
1232 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -08001233 if (IsTemp(rl_src1.reg.GetLowReg()) && IsTemp(rl_src1.reg.GetHighReg())) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001234 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1235 } else if (is_commutative) {
1236 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1237 // We need at least one of them to be a temporary.
buzbee2700f7e2014-03-07 09:46:20 -08001238 if (!(IsTemp(rl_src2.reg.GetLowReg()) && IsTemp(rl_src2.reg.GetHighReg()))) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001239 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07001240 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1241 } else {
1242 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1243 StoreFinalValueWide(rl_dest, rl_src2);
1244 return;
Mark Mendelle02d48f2014-01-15 11:19:23 -08001245 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001246 } else {
1247 // Need LHS to be the temp.
1248 rl_src1 = ForceTempWide(rl_src1);
1249 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1250 }
1251
1252 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001253}
1254
Mark Mendelle02d48f2014-01-15 11:19:23 -08001255void X86Mir2Lir::GenAddLong(Instruction::Code opcode, RegLocation rl_dest,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001256 RegLocation rl_src1, RegLocation rl_src2) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001257 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1258}
1259
1260void X86Mir2Lir::GenSubLong(Instruction::Code opcode, RegLocation rl_dest,
1261 RegLocation rl_src1, RegLocation rl_src2) {
1262 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1263}
1264
1265void X86Mir2Lir::GenAndLong(Instruction::Code opcode, RegLocation rl_dest,
1266 RegLocation rl_src1, RegLocation rl_src2) {
1267 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1268}
1269
1270void X86Mir2Lir::GenOrLong(Instruction::Code opcode, RegLocation rl_dest,
1271 RegLocation rl_src1, RegLocation rl_src2) {
1272 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1273}
1274
1275void X86Mir2Lir::GenXorLong(Instruction::Code opcode, RegLocation rl_dest,
1276 RegLocation rl_src1, RegLocation rl_src2) {
1277 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001278}
1279
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001280void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001281 rl_src = LoadValueWide(rl_src, kCoreReg);
1282 RegLocation rl_result = ForceTempWide(rl_src);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001283 if (((rl_dest.location == kLocPhysReg) && (rl_src.location == kLocPhysReg)) &&
buzbee2700f7e2014-03-07 09:46:20 -08001284 ((rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()))) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001285 // The registers are the same, so we would clobber it before the use.
buzbee2700f7e2014-03-07 09:46:20 -08001286 RegStorage temp_reg = AllocTemp();
1287 OpRegCopy(temp_reg, rl_result.reg);
1288 rl_result.reg.SetHighReg(temp_reg.GetReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001289 }
buzbee2700f7e2014-03-07 09:46:20 -08001290 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
1291 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
1292 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Brian Carlstrom7940e442013-07-12 13:46:57 -07001293 StoreValueWide(rl_dest, rl_result);
1294}
1295
Ian Rogers468532e2013-08-05 10:56:33 -07001296void X86Mir2Lir::OpRegThreadMem(OpKind op, int r_dest, ThreadOffset thread_offset) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001297 X86OpCode opcode = kX86Bkpt;
1298 switch (op) {
1299 case kOpCmp: opcode = kX86Cmp32RT; break;
1300 case kOpMov: opcode = kX86Mov32RT; break;
1301 default:
1302 LOG(FATAL) << "Bad opcode: " << op;
1303 break;
1304 }
Ian Rogers468532e2013-08-05 10:56:33 -07001305 NewLIR2(opcode, r_dest, thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07001306}
1307
1308/*
1309 * Generate array load
1310 */
1311void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07001312 RegLocation rl_index, RegLocation rl_dest, int scale) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001313 RegisterClass reg_class = oat_reg_class_by_size(size);
1314 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001315 RegLocation rl_result;
1316 rl_array = LoadValue(rl_array, kCoreReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001317
Mark Mendell343adb52013-12-18 06:02:17 -08001318 int data_offset;
Brian Carlstrom7940e442013-07-12 13:46:57 -07001319 if (size == kLong || size == kDouble) {
1320 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
1321 } else {
1322 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
1323 }
1324
Mark Mendell343adb52013-12-18 06:02:17 -08001325 bool constant_index = rl_index.is_const;
1326 int32_t constant_index_value = 0;
1327 if (!constant_index) {
1328 rl_index = LoadValue(rl_index, kCoreReg);
1329 } else {
1330 constant_index_value = mir_graph_->ConstantValue(rl_index);
1331 // If index is constant, just fold it into the data offset
1332 data_offset += constant_index_value << scale;
1333 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08001334 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08001335 }
1336
Brian Carlstrom7940e442013-07-12 13:46:57 -07001337 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08001338 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001339
1340 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08001341 if (constant_index) {
buzbee2700f7e2014-03-07 09:46:20 -08001342 GenMemImmedCheck(kCondLs, rl_array.reg, len_offset,
Mark Mendell343adb52013-12-18 06:02:17 -08001343 constant_index_value, kThrowConstantArrayBounds);
1344 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001345 GenRegMemCheck(kCondUge, rl_index.reg, rl_array.reg, len_offset, kThrowArrayBounds);
Mark Mendell343adb52013-12-18 06:02:17 -08001346 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001347 }
Mark Mendell343adb52013-12-18 06:02:17 -08001348 rl_result = EvalLoc(rl_dest, reg_class, true);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001349 if ((size == kLong) || (size == kDouble)) {
buzbee2700f7e2014-03-07 09:46:20 -08001350 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg.GetLow(),
1351 rl_result.reg.GetHigh(), size, INVALID_SREG);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001352 StoreValueWide(rl_dest, rl_result);
1353 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001354 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg,
1355 RegStorage::InvalidReg(), size, INVALID_SREG);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001356 StoreValue(rl_dest, rl_result);
1357 }
1358}
1359
1360/*
1361 * Generate array store
1362 *
1363 */
1364void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07001365 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001366 RegisterClass reg_class = oat_reg_class_by_size(size);
1367 int len_offset = mirror::Array::LengthOffset().Int32Value();
1368 int data_offset;
1369
1370 if (size == kLong || size == kDouble) {
1371 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
1372 } else {
1373 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
1374 }
1375
1376 rl_array = LoadValue(rl_array, kCoreReg);
Mark Mendell343adb52013-12-18 06:02:17 -08001377 bool constant_index = rl_index.is_const;
1378 int32_t constant_index_value = 0;
1379 if (!constant_index) {
1380 rl_index = LoadValue(rl_index, kCoreReg);
1381 } else {
1382 // If index is constant, just fold it into the data offset
1383 constant_index_value = mir_graph_->ConstantValue(rl_index);
1384 data_offset += constant_index_value << scale;
1385 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08001386 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08001387 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001388
1389 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08001390 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001391
1392 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08001393 if (constant_index) {
buzbee2700f7e2014-03-07 09:46:20 -08001394 GenMemImmedCheck(kCondLs, rl_array.reg, len_offset,
Mark Mendell343adb52013-12-18 06:02:17 -08001395 constant_index_value, kThrowConstantArrayBounds);
1396 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001397 GenRegMemCheck(kCondUge, rl_index.reg, rl_array.reg, len_offset, kThrowArrayBounds);
Mark Mendell343adb52013-12-18 06:02:17 -08001398 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001399 }
1400 if ((size == kLong) || (size == kDouble)) {
1401 rl_src = LoadValueWide(rl_src, reg_class);
1402 } else {
1403 rl_src = LoadValue(rl_src, reg_class);
1404 }
1405 // If the src reg can't be byte accessed, move it to a temp first.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001406 if ((size == kSignedByte || size == kUnsignedByte) && rl_src.reg.GetReg() >= 4) {
buzbee2700f7e2014-03-07 09:46:20 -08001407 RegStorage temp = AllocTemp();
1408 OpRegCopy(temp, rl_src.reg);
1409 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp,
1410 RegStorage::InvalidReg(), size, INVALID_SREG);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001411 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001412 if (rl_src.wide) {
1413 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg.GetLow(),
1414 rl_src.reg.GetHigh(), size, INVALID_SREG);
1415 } else {
1416 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg,
1417 RegStorage::InvalidReg(), size, INVALID_SREG);
1418 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001419 }
Ian Rogersa9a82542013-10-04 11:17:26 -07001420 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07001421 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08001422 if (!constant_index) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001423 FreeTemp(rl_index.reg.GetReg());
Mark Mendell343adb52013-12-18 06:02:17 -08001424 }
buzbee2700f7e2014-03-07 09:46:20 -08001425 MarkGCCard(rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001426 }
1427}
1428
Mark Mendell4708dcd2014-01-22 09:05:18 -08001429RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
1430 RegLocation rl_src, int shift_amount) {
1431 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1432 switch (opcode) {
1433 case Instruction::SHL_LONG:
1434 case Instruction::SHL_LONG_2ADDR:
1435 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
1436 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001437 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
1438 LoadConstant(rl_result.reg.GetLow(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001439 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001440 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001441 FreeTemp(rl_src.reg.GetHighReg());
1442 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
buzbee2700f7e2014-03-07 09:46:20 -08001443 LoadConstant(rl_result.reg.GetLow(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001444 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001445 OpRegCopy(rl_result.reg, rl_src.reg);
1446 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1447 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(), shift_amount);
1448 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001449 }
1450 break;
1451 case Instruction::SHR_LONG:
1452 case Instruction::SHR_LONG_2ADDR:
1453 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001454 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1455 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001456 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001457 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001458 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1459 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1460 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001461 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001462 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001463 OpRegCopy(rl_result.reg, rl_src.reg);
1464 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1465 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(), shift_amount);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001466 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001467 }
1468 break;
1469 case Instruction::USHR_LONG:
1470 case Instruction::USHR_LONG_2ADDR:
1471 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001472 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1473 LoadConstant(rl_result.reg.GetHigh(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001474 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001475 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1476 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
1477 LoadConstant(rl_result.reg.GetHigh(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001478 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001479 OpRegCopy(rl_result.reg, rl_src.reg);
1480 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1481 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(), shift_amount);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001482 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001483 }
1484 break;
1485 default:
1486 LOG(FATAL) << "Unexpected case";
1487 }
1488 return rl_result;
1489}
1490
Brian Carlstrom7940e442013-07-12 13:46:57 -07001491void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Mark Mendell4708dcd2014-01-22 09:05:18 -08001492 RegLocation rl_src, RegLocation rl_shift) {
1493 // Per spec, we only care about low 6 bits of shift amount.
1494 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
1495 if (shift_amount == 0) {
1496 rl_src = LoadValueWide(rl_src, kCoreReg);
1497 StoreValueWide(rl_dest, rl_src);
1498 return;
1499 } else if (shift_amount == 1 &&
1500 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
1501 // Need to handle this here to avoid calling StoreValueWide twice.
1502 GenAddLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src);
1503 return;
1504 }
1505 if (BadOverlap(rl_src, rl_dest)) {
1506 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
1507 return;
1508 }
1509 rl_src = LoadValueWide(rl_src, kCoreReg);
1510 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount);
1511 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001512}
1513
1514void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001515 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001516 switch (opcode) {
1517 case Instruction::ADD_LONG:
1518 case Instruction::AND_LONG:
1519 case Instruction::OR_LONG:
1520 case Instruction::XOR_LONG:
1521 if (rl_src2.is_const) {
1522 GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
1523 } else {
1524 DCHECK(rl_src1.is_const);
1525 GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
1526 }
1527 break;
1528 case Instruction::SUB_LONG:
1529 case Instruction::SUB_LONG_2ADDR:
1530 if (rl_src2.is_const) {
1531 GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
1532 } else {
1533 GenSubLong(opcode, rl_dest, rl_src1, rl_src2);
1534 }
1535 break;
1536 case Instruction::ADD_LONG_2ADDR:
1537 case Instruction::OR_LONG_2ADDR:
1538 case Instruction::XOR_LONG_2ADDR:
1539 case Instruction::AND_LONG_2ADDR:
1540 if (rl_src2.is_const) {
1541 GenLongImm(rl_dest, rl_src2, opcode);
1542 } else {
1543 DCHECK(rl_src1.is_const);
1544 GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
1545 }
1546 break;
1547 default:
1548 // Default - bail to non-const handler.
1549 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
1550 break;
1551 }
1552}
1553
1554bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
1555 switch (op) {
1556 case Instruction::AND_LONG_2ADDR:
1557 case Instruction::AND_LONG:
1558 return value == -1;
1559 case Instruction::OR_LONG:
1560 case Instruction::OR_LONG_2ADDR:
1561 case Instruction::XOR_LONG:
1562 case Instruction::XOR_LONG_2ADDR:
1563 return value == 0;
1564 default:
1565 return false;
1566 }
1567}
1568
1569X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
1570 bool is_high_op) {
1571 bool rhs_in_mem = rhs.location != kLocPhysReg;
1572 bool dest_in_mem = dest.location != kLocPhysReg;
1573 DCHECK(!rhs_in_mem || !dest_in_mem);
1574 switch (op) {
1575 case Instruction::ADD_LONG:
1576 case Instruction::ADD_LONG_2ADDR:
1577 if (dest_in_mem) {
1578 return is_high_op ? kX86Adc32MR : kX86Add32MR;
1579 } else if (rhs_in_mem) {
1580 return is_high_op ? kX86Adc32RM : kX86Add32RM;
1581 }
1582 return is_high_op ? kX86Adc32RR : kX86Add32RR;
1583 case Instruction::SUB_LONG:
1584 case Instruction::SUB_LONG_2ADDR:
1585 if (dest_in_mem) {
1586 return is_high_op ? kX86Sbb32MR : kX86Sub32MR;
1587 } else if (rhs_in_mem) {
1588 return is_high_op ? kX86Sbb32RM : kX86Sub32RM;
1589 }
1590 return is_high_op ? kX86Sbb32RR : kX86Sub32RR;
1591 case Instruction::AND_LONG_2ADDR:
1592 case Instruction::AND_LONG:
1593 if (dest_in_mem) {
1594 return kX86And32MR;
1595 }
1596 return rhs_in_mem ? kX86And32RM : kX86And32RR;
1597 case Instruction::OR_LONG:
1598 case Instruction::OR_LONG_2ADDR:
1599 if (dest_in_mem) {
1600 return kX86Or32MR;
1601 }
1602 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
1603 case Instruction::XOR_LONG:
1604 case Instruction::XOR_LONG_2ADDR:
1605 if (dest_in_mem) {
1606 return kX86Xor32MR;
1607 }
1608 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
1609 default:
1610 LOG(FATAL) << "Unexpected opcode: " << op;
1611 return kX86Add32RR;
1612 }
1613}
1614
1615X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
1616 int32_t value) {
1617 bool in_mem = loc.location != kLocPhysReg;
1618 bool byte_imm = IS_SIMM8(value);
buzbee2700f7e2014-03-07 09:46:20 -08001619 DCHECK(in_mem || !IsFpReg(loc.reg));
Mark Mendelle02d48f2014-01-15 11:19:23 -08001620 switch (op) {
1621 case Instruction::ADD_LONG:
1622 case Instruction::ADD_LONG_2ADDR:
1623 if (byte_imm) {
1624 if (in_mem) {
1625 return is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
1626 }
1627 return is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
1628 }
1629 if (in_mem) {
1630 return is_high_op ? kX86Adc32MI : kX86Add32MI;
1631 }
1632 return is_high_op ? kX86Adc32RI : kX86Add32RI;
1633 case Instruction::SUB_LONG:
1634 case Instruction::SUB_LONG_2ADDR:
1635 if (byte_imm) {
1636 if (in_mem) {
1637 return is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
1638 }
1639 return is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
1640 }
1641 if (in_mem) {
1642 return is_high_op ? kX86Sbb32MI : kX86Sub32MI;
1643 }
1644 return is_high_op ? kX86Sbb32RI : kX86Sub32RI;
1645 case Instruction::AND_LONG_2ADDR:
1646 case Instruction::AND_LONG:
1647 if (byte_imm) {
1648 return in_mem ? kX86And32MI8 : kX86And32RI8;
1649 }
1650 return in_mem ? kX86And32MI : kX86And32RI;
1651 case Instruction::OR_LONG:
1652 case Instruction::OR_LONG_2ADDR:
1653 if (byte_imm) {
1654 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
1655 }
1656 return in_mem ? kX86Or32MI : kX86Or32RI;
1657 case Instruction::XOR_LONG:
1658 case Instruction::XOR_LONG_2ADDR:
1659 if (byte_imm) {
1660 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
1661 }
1662 return in_mem ? kX86Xor32MI : kX86Xor32RI;
1663 default:
1664 LOG(FATAL) << "Unexpected opcode: " << op;
1665 return kX86Add32MI;
1666 }
1667}
1668
1669void X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
1670 DCHECK(rl_src.is_const);
1671 int64_t val = mir_graph_->ConstantValueWide(rl_src);
1672 int32_t val_lo = Low32Bits(val);
1673 int32_t val_hi = High32Bits(val);
1674 rl_dest = UpdateLocWide(rl_dest);
1675
1676 // Can we just do this into memory?
1677 if ((rl_dest.location == kLocDalvikFrame) ||
1678 (rl_dest.location == kLocCompilerTemp)) {
buzbee2700f7e2014-03-07 09:46:20 -08001679 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001680 int displacement = SRegOffset(rl_dest.s_reg_low);
1681
1682 if (!IsNoOp(op, val_lo)) {
1683 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001684 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001685 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001686 true /* is_load */, true /* is64bit */);
1687 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001688 false /* is_load */, true /* is64bit */);
1689 }
1690 if (!IsNoOp(op, val_hi)) {
1691 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08001692 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001693 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001694 true /* is_load */, true /* is64bit */);
1695 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001696 false /* is_load */, true /* is64bit */);
1697 }
1698 return;
1699 }
1700
1701 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1702 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08001703 DCHECK(!IsFpReg(rl_result.reg));
Mark Mendelle02d48f2014-01-15 11:19:23 -08001704
1705 if (!IsNoOp(op, val_lo)) {
1706 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001707 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001708 }
1709 if (!IsNoOp(op, val_hi)) {
1710 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001711 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001712 }
1713 StoreValueWide(rl_dest, rl_result);
1714}
1715
1716void X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
1717 RegLocation rl_src2, Instruction::Code op) {
1718 DCHECK(rl_src2.is_const);
1719 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
1720 int32_t val_lo = Low32Bits(val);
1721 int32_t val_hi = High32Bits(val);
1722 rl_dest = UpdateLocWide(rl_dest);
1723 rl_src1 = UpdateLocWide(rl_src1);
1724
1725 // Can we do this directly into the destination registers?
1726 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08001727 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
1728 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() &&
1729 !IsFpReg(rl_dest.reg)) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001730 if (!IsNoOp(op, val_lo)) {
1731 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001732 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001733 }
1734 if (!IsNoOp(op, val_hi)) {
1735 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001736 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001737 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07001738
1739 StoreFinalValueWide(rl_dest, rl_dest);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001740 return;
1741 }
1742
1743 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1744 DCHECK_EQ(rl_src1.location, kLocPhysReg);
1745
1746 // We need the values to be in a temporary
1747 RegLocation rl_result = ForceTempWide(rl_src1);
1748 if (!IsNoOp(op, val_lo)) {
1749 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001750 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001751 }
1752 if (!IsNoOp(op, val_hi)) {
1753 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001754 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001755 }
1756
1757 StoreFinalValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001758}
1759
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001760// For final classes there are no sub-classes to check and so we can answer the instance-of
1761// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
1762void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
1763 RegLocation rl_dest, RegLocation rl_src) {
1764 RegLocation object = LoadValue(rl_src, kCoreReg);
1765 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001766 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001767
1768 // SETcc only works with EAX..EDX.
buzbee2700f7e2014-03-07 09:46:20 -08001769 if (result_reg == object.reg || result_reg.GetReg() >= 4) {
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001770 result_reg = AllocTypedTemp(false, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -08001771 DCHECK_LT(result_reg.GetReg(), 4);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001772 }
1773
1774 // Assume that there is no match.
1775 LoadConstant(result_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -08001776 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, NULL);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001777
buzbee2700f7e2014-03-07 09:46:20 -08001778 RegStorage check_class = AllocTypedTemp(false, kCoreReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001779
1780 // If Method* is already in a register, we can save a copy.
1781 RegLocation rl_method = mir_graph_->GetMethodLoc();
1782 int32_t offset_of_type = mirror::Array::DataOffset(sizeof(mirror::Class*)).Int32Value() +
1783 (sizeof(mirror::Class*) * type_idx);
1784
1785 if (rl_method.location == kLocPhysReg) {
1786 if (use_declaring_class) {
buzbee2700f7e2014-03-07 09:46:20 -08001787 LoadWordDisp(rl_method.reg, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001788 check_class);
1789 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001790 LoadWordDisp(rl_method.reg, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001791 check_class);
1792 LoadWordDisp(check_class, offset_of_type, check_class);
1793 }
1794 } else {
1795 LoadCurrMethodDirect(check_class);
1796 if (use_declaring_class) {
buzbee2700f7e2014-03-07 09:46:20 -08001797 LoadWordDisp(check_class, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001798 check_class);
1799 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001800 LoadWordDisp(check_class, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001801 check_class);
1802 LoadWordDisp(check_class, offset_of_type, check_class);
1803 }
1804 }
1805
1806 // Compare the computed class to the class in the object.
1807 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08001808 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001809
1810 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08001811 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001812
1813 LIR* target = NewLIR0(kPseudoTargetLabel);
1814 null_branchover->target = target;
1815 FreeTemp(check_class);
1816 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08001817 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001818 FreeTemp(result_reg);
1819 }
1820 StoreValue(rl_dest, rl_result);
1821}
1822
Mark Mendell6607d972014-02-10 06:54:18 -08001823void X86Mir2Lir::GenInstanceofCallingHelper(bool needs_access_check, bool type_known_final,
1824 bool type_known_abstract, bool use_declaring_class,
1825 bool can_assume_type_is_in_dex_cache,
1826 uint32_t type_idx, RegLocation rl_dest,
1827 RegLocation rl_src) {
1828 FlushAllRegs();
1829 // May generate a call - use explicit registers.
1830 LockCallTemps();
1831 LoadCurrMethodDirect(TargetReg(kArg1)); // kArg1 gets current Method*.
buzbee2700f7e2014-03-07 09:46:20 -08001832 RegStorage class_reg = TargetReg(kArg2); // kArg2 will hold the Class*.
Mark Mendell6607d972014-02-10 06:54:18 -08001833 // Reference must end up in kArg0.
1834 if (needs_access_check) {
1835 // Check we have access to type_idx and if not throw IllegalAccessError,
1836 // Caller function returns Class* in kArg0.
1837 CallRuntimeHelperImm(QUICK_ENTRYPOINT_OFFSET(pInitializeTypeAndVerifyAccess),
1838 type_idx, true);
1839 OpRegCopy(class_reg, TargetReg(kRet0));
1840 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
1841 } else if (use_declaring_class) {
1842 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
buzbee2700f7e2014-03-07 09:46:20 -08001843 LoadWordDisp(TargetReg(kArg1), mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
1844 class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001845 } else {
1846 // Load dex cache entry into class_reg (kArg2).
1847 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
buzbee2700f7e2014-03-07 09:46:20 -08001848 LoadWordDisp(TargetReg(kArg1), mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
1849 class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001850 int32_t offset_of_type =
1851 mirror::Array::DataOffset(sizeof(mirror::Class*)).Int32Value() + (sizeof(mirror::Class*)
1852 * type_idx);
1853 LoadWordDisp(class_reg, offset_of_type, class_reg);
1854 if (!can_assume_type_is_in_dex_cache) {
1855 // Need to test presence of type in dex cache at runtime.
1856 LIR* hop_branch = OpCmpImmBranch(kCondNe, class_reg, 0, NULL);
1857 // Type is not resolved. Call out to helper, which will return resolved type in kRet0/kArg0.
1858 CallRuntimeHelperImm(QUICK_ENTRYPOINT_OFFSET(pInitializeType), type_idx, true);
1859 OpRegCopy(TargetReg(kArg2), TargetReg(kRet0)); // Align usage with fast path.
1860 LoadValueDirectFixed(rl_src, TargetReg(kArg0)); /* Reload Ref. */
1861 // Rejoin code paths
1862 LIR* hop_target = NewLIR0(kPseudoTargetLabel);
1863 hop_branch->target = hop_target;
1864 }
1865 }
1866 /* kArg0 is ref, kArg2 is class. If ref==null, use directly as bool result. */
1867 RegLocation rl_result = GetReturn(false);
1868
1869 // SETcc only works with EAX..EDX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001870 DCHECK_LT(rl_result.reg.GetReg(), 4);
Mark Mendell6607d972014-02-10 06:54:18 -08001871
1872 // Is the class NULL?
1873 LIR* branch1 = OpCmpImmBranch(kCondEq, TargetReg(kArg0), 0, NULL);
1874
1875 /* Load object->klass_. */
1876 DCHECK_EQ(mirror::Object::ClassOffset().Int32Value(), 0);
1877 LoadWordDisp(TargetReg(kArg0), mirror::Object::ClassOffset().Int32Value(), TargetReg(kArg1));
1878 /* kArg0 is ref, kArg1 is ref->klass_, kArg2 is class. */
1879 LIR* branchover = nullptr;
1880 if (type_known_final) {
1881 // Ensure top 3 bytes of result are 0.
buzbee2700f7e2014-03-07 09:46:20 -08001882 LoadConstant(rl_result.reg, 0);
Mark Mendell6607d972014-02-10 06:54:18 -08001883 OpRegReg(kOpCmp, TargetReg(kArg1), TargetReg(kArg2));
1884 // Set the low byte of the result to 0 or 1 from the compare condition code.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001885 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondEq);
Mark Mendell6607d972014-02-10 06:54:18 -08001886 } else {
1887 if (!type_known_abstract) {
buzbee2700f7e2014-03-07 09:46:20 -08001888 LoadConstant(rl_result.reg, 1); // Assume result succeeds.
Mark Mendell6607d972014-02-10 06:54:18 -08001889 branchover = OpCmpBranch(kCondEq, TargetReg(kArg1), TargetReg(kArg2), NULL);
1890 }
1891 OpRegCopy(TargetReg(kArg0), TargetReg(kArg2));
1892 OpThreadMem(kOpBlx, QUICK_ENTRYPOINT_OFFSET(pInstanceofNonTrivial));
1893 }
1894 // TODO: only clobber when type isn't final?
1895 ClobberCallerSave();
1896 /* Branch targets here. */
1897 LIR* target = NewLIR0(kPseudoTargetLabel);
1898 StoreValue(rl_dest, rl_result);
1899 branch1->target = target;
1900 if (branchover != nullptr) {
1901 branchover->target = target;
1902 }
1903}
1904
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08001905void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
1906 RegLocation rl_lhs, RegLocation rl_rhs) {
1907 OpKind op = kOpBkpt;
1908 bool is_div_rem = false;
1909 bool unary = false;
1910 bool shift_op = false;
1911 bool is_two_addr = false;
1912 RegLocation rl_result;
1913 switch (opcode) {
1914 case Instruction::NEG_INT:
1915 op = kOpNeg;
1916 unary = true;
1917 break;
1918 case Instruction::NOT_INT:
1919 op = kOpMvn;
1920 unary = true;
1921 break;
1922 case Instruction::ADD_INT_2ADDR:
1923 is_two_addr = true;
1924 // Fallthrough
1925 case Instruction::ADD_INT:
1926 op = kOpAdd;
1927 break;
1928 case Instruction::SUB_INT_2ADDR:
1929 is_two_addr = true;
1930 // Fallthrough
1931 case Instruction::SUB_INT:
1932 op = kOpSub;
1933 break;
1934 case Instruction::MUL_INT_2ADDR:
1935 is_two_addr = true;
1936 // Fallthrough
1937 case Instruction::MUL_INT:
1938 op = kOpMul;
1939 break;
1940 case Instruction::DIV_INT_2ADDR:
1941 is_two_addr = true;
1942 // Fallthrough
1943 case Instruction::DIV_INT:
1944 op = kOpDiv;
1945 is_div_rem = true;
1946 break;
1947 /* NOTE: returns in kArg1 */
1948 case Instruction::REM_INT_2ADDR:
1949 is_two_addr = true;
1950 // Fallthrough
1951 case Instruction::REM_INT:
1952 op = kOpRem;
1953 is_div_rem = true;
1954 break;
1955 case Instruction::AND_INT_2ADDR:
1956 is_two_addr = true;
1957 // Fallthrough
1958 case Instruction::AND_INT:
1959 op = kOpAnd;
1960 break;
1961 case Instruction::OR_INT_2ADDR:
1962 is_two_addr = true;
1963 // Fallthrough
1964 case Instruction::OR_INT:
1965 op = kOpOr;
1966 break;
1967 case Instruction::XOR_INT_2ADDR:
1968 is_two_addr = true;
1969 // Fallthrough
1970 case Instruction::XOR_INT:
1971 op = kOpXor;
1972 break;
1973 case Instruction::SHL_INT_2ADDR:
1974 is_two_addr = true;
1975 // Fallthrough
1976 case Instruction::SHL_INT:
1977 shift_op = true;
1978 op = kOpLsl;
1979 break;
1980 case Instruction::SHR_INT_2ADDR:
1981 is_two_addr = true;
1982 // Fallthrough
1983 case Instruction::SHR_INT:
1984 shift_op = true;
1985 op = kOpAsr;
1986 break;
1987 case Instruction::USHR_INT_2ADDR:
1988 is_two_addr = true;
1989 // Fallthrough
1990 case Instruction::USHR_INT:
1991 shift_op = true;
1992 op = kOpLsr;
1993 break;
1994 default:
1995 LOG(FATAL) << "Invalid word arith op: " << opcode;
1996 }
1997
1998 // Can we convert to a two address instruction?
1999 if (!is_two_addr &&
2000 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
2001 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
2002 is_two_addr = true;
2003 }
2004
2005 // Get the div/rem stuff out of the way.
2006 if (is_div_rem) {
2007 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, true);
2008 StoreValue(rl_dest, rl_result);
2009 return;
2010 }
2011
2012 if (unary) {
2013 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2014 rl_result = UpdateLoc(rl_dest);
2015 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002016 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002017 } else {
2018 if (shift_op) {
2019 // X86 doesn't require masking and must use ECX.
buzbee2700f7e2014-03-07 09:46:20 -08002020 RegStorage t_reg = TargetReg(kCount); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002021 LoadValueDirectFixed(rl_rhs, t_reg);
2022 if (is_two_addr) {
2023 // Can we do this directly into memory?
2024 rl_result = UpdateLoc(rl_dest);
2025 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2026 if (rl_result.location != kLocPhysReg) {
2027 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08002028 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002029 FreeTemp(t_reg);
2030 return;
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002031 } else if (!IsFpReg(rl_result.reg.GetReg())) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002032 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08002033 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002034 FreeTemp(t_reg);
2035 StoreFinalValue(rl_dest, rl_result);
2036 return;
2037 }
2038 }
2039 // Three address form, or we can't do directly.
2040 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2041 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002042 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002043 FreeTemp(t_reg);
2044 } else {
2045 // Multiply is 3 operand only (sort of).
2046 if (is_two_addr && op != kOpMul) {
2047 // Can we do this directly into memory?
2048 rl_result = UpdateLoc(rl_dest);
2049 if (rl_result.location == kLocPhysReg) {
2050 // Can we do this from memory directly?
2051 rl_rhs = UpdateLoc(rl_rhs);
2052 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08002053 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002054 StoreFinalValue(rl_dest, rl_result);
2055 return;
buzbee2700f7e2014-03-07 09:46:20 -08002056 } else if (!IsFpReg(rl_rhs.reg)) {
2057 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002058 StoreFinalValue(rl_dest, rl_result);
2059 return;
2060 }
2061 }
2062 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2063 if (rl_result.location != kLocPhysReg) {
2064 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002065 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002066 return;
buzbee2700f7e2014-03-07 09:46:20 -08002067 } else if (!IsFpReg(rl_result.reg)) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002068 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08002069 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002070 StoreFinalValue(rl_dest, rl_result);
2071 return;
2072 } else {
2073 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2074 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002075 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002076 }
2077 } else {
2078 // Try to use reg/memory instructions.
2079 rl_lhs = UpdateLoc(rl_lhs);
2080 rl_rhs = UpdateLoc(rl_rhs);
2081 // We can't optimize with FP registers.
2082 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
2083 // Something is difficult, so fall back to the standard case.
2084 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2085 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2086 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002087 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002088 } else {
2089 // We can optimize by moving to result and using memory operands.
2090 if (rl_rhs.location != kLocPhysReg) {
2091 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07002092 // We should be careful with order here
2093 // If rl_dest and rl_lhs points to the same VR we should load first
2094 // If the are different we should find a register first for dest
2095 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) == mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
2096 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2097 rl_result = EvalLoc(rl_dest, kCoreReg, true);
2098 } else {
2099 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002100 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07002101 }
buzbee2700f7e2014-03-07 09:46:20 -08002102 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002103 } else if (rl_lhs.location != kLocPhysReg) {
2104 // RHS is in a register; LHS is in memory.
2105 if (op != kOpSub) {
2106 // Force RHS into result and operate on memory.
2107 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002108 OpRegCopy(rl_result.reg, rl_rhs.reg);
2109 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002110 } else {
2111 // Subtraction isn't commutative.
2112 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2113 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2114 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002115 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002116 }
2117 } else {
2118 // Both are in registers.
2119 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2120 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2121 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002122 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002123 }
2124 }
2125 }
2126 }
2127 }
2128 StoreValue(rl_dest, rl_result);
2129}
2130
2131bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
2132 // If we have non-core registers, then we can't do good things.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002133 if (rl_lhs.location == kLocPhysReg && IsFpReg(rl_lhs.reg.GetReg())) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002134 return false;
2135 }
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002136 if (rl_rhs.location == kLocPhysReg && IsFpReg(rl_rhs.reg.GetReg())) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002137 return false;
2138 }
2139
2140 // Everything will be fine :-).
2141 return true;
2142}
Brian Carlstrom7940e442013-07-12 13:46:57 -07002143} // namespace art