blob: 96c4cbe2f5562391aed1314c58928fe867bc68b2 [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/*
Brian Carlstrom7940e442013-07-12 13:46:57 -070027 * Compare two 64-bit values
28 * x = y return 0
29 * x < y return -1
30 * x > y return 1
31 */
32void X86Mir2Lir::GenCmpLong(RegLocation rl_dest, RegLocation rl_src1,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070033 RegLocation rl_src2) {
Brian Carlstrom7940e442013-07-12 13:46:57 -070034 FlushAllRegs();
35 LockCallTemps(); // Prepare for explicit register usage
buzbee2700f7e2014-03-07 09:46:20 -080036 RegStorage r_tmp1(RegStorage::k64BitPair, r0, r1);
37 RegStorage r_tmp2(RegStorage::k64BitPair, r2, r3);
38 LoadValueDirectWideFixed(rl_src1, r_tmp1);
39 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Brian Carlstrom7940e442013-07-12 13:46:57 -070040 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -080041 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
42 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -070043 NewLIR2(kX86Set8R, r2, kX86CondL); // r2 = (r1:r0) < (r3:r2) ? 1 : 0
44 NewLIR2(kX86Movzx8RR, r2, r2);
buzbee2700f7e2014-03-07 09:46:20 -080045 OpReg(kOpNeg, rs_r2); // r2 = -r2
46 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = high | low - sets ZF
Brian Carlstrom7940e442013-07-12 13:46:57 -070047 NewLIR2(kX86Set8R, r0, kX86CondNz); // r0 = (r1:r0) != (r3:r2) ? 1 : 0
48 NewLIR2(kX86Movzx8RR, r0, r0);
buzbee2700f7e2014-03-07 09:46:20 -080049 OpRegReg(kOpOr, rs_r0, rs_r2); // r0 = r0 | r2
Brian Carlstrom7940e442013-07-12 13:46:57 -070050 RegLocation rl_result = LocCReturn();
51 StoreValue(rl_dest, rl_result);
52}
53
54X86ConditionCode X86ConditionEncoding(ConditionCode cond) {
55 switch (cond) {
56 case kCondEq: return kX86CondEq;
57 case kCondNe: return kX86CondNe;
58 case kCondCs: return kX86CondC;
59 case kCondCc: return kX86CondNc;
Vladimir Marko58af1f92013-12-19 13:31:15 +000060 case kCondUlt: return kX86CondC;
61 case kCondUge: return kX86CondNc;
Brian Carlstrom7940e442013-07-12 13:46:57 -070062 case kCondMi: return kX86CondS;
63 case kCondPl: return kX86CondNs;
64 case kCondVs: return kX86CondO;
65 case kCondVc: return kX86CondNo;
66 case kCondHi: return kX86CondA;
67 case kCondLs: return kX86CondBe;
68 case kCondGe: return kX86CondGe;
69 case kCondLt: return kX86CondL;
70 case kCondGt: return kX86CondG;
71 case kCondLe: return kX86CondLe;
72 case kCondAl:
73 case kCondNv: LOG(FATAL) << "Should not reach here";
74 }
75 return kX86CondO;
76}
77
buzbee2700f7e2014-03-07 09:46:20 -080078LIR* X86Mir2Lir::OpCmpBranch(ConditionCode cond, RegStorage src1, RegStorage src2, LIR* target) {
79 NewLIR2(kX86Cmp32RR, src1.GetReg(), src2.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -070080 X86ConditionCode cc = X86ConditionEncoding(cond);
81 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ ,
82 cc);
83 branch->target = target;
84 return branch;
85}
86
buzbee2700f7e2014-03-07 09:46:20 -080087LIR* X86Mir2Lir::OpCmpImmBranch(ConditionCode cond, RegStorage reg,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070088 int check_value, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -070089 if ((check_value == 0) && (cond == kCondEq || cond == kCondNe)) {
90 // TODO: when check_value == 0 and reg is rCX, use the jcxz/nz opcode
buzbee2700f7e2014-03-07 09:46:20 -080091 NewLIR2(kX86Test32RR, reg.GetReg(), reg.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -070092 } else {
buzbee2700f7e2014-03-07 09:46:20 -080093 NewLIR2(IS_SIMM8(check_value) ? kX86Cmp32RI8 : kX86Cmp32RI, reg.GetReg(), check_value);
Brian Carlstrom7940e442013-07-12 13:46:57 -070094 }
95 X86ConditionCode cc = X86ConditionEncoding(cond);
96 LIR* branch = NewLIR2(kX86Jcc8, 0 /* lir operand for Jcc offset */ , cc);
97 branch->target = target;
98 return branch;
99}
100
buzbee2700f7e2014-03-07 09:46:20 -0800101LIR* X86Mir2Lir::OpRegCopyNoInsert(RegStorage r_dest, RegStorage r_src) {
102 // If src or dest is a pair, we'll be using low reg.
103 if (r_dest.IsPair()) {
104 r_dest = r_dest.GetLow();
105 }
106 if (r_src.IsPair()) {
107 r_src = r_src.GetLow();
108 }
109 if (X86_FPREG(r_dest.GetReg()) || X86_FPREG(r_src.GetReg()))
Brian Carlstrom7940e442013-07-12 13:46:57 -0700110 return OpFpRegCopy(r_dest, r_src);
111 LIR* res = RawLIR(current_dalvik_offset_, kX86Mov32RR,
buzbee2700f7e2014-03-07 09:46:20 -0800112 r_dest.GetReg(), r_src.GetReg());
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800113 if (!(cu_->disable_opt & (1 << kSafeOptimizations)) && r_dest == r_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700114 res->flags.is_nop = true;
115 }
116 return res;
117}
118
buzbee7a11ab02014-04-28 20:02:38 -0700119void X86Mir2Lir::OpRegCopy(RegStorage r_dest, RegStorage r_src) {
120 if (r_dest != r_src) {
121 LIR *res = OpRegCopyNoInsert(r_dest, r_src);
122 AppendLIR(res);
123 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700124}
125
buzbee2700f7e2014-03-07 09:46:20 -0800126void X86Mir2Lir::OpRegCopyWide(RegStorage r_dest, RegStorage r_src) {
buzbee7a11ab02014-04-28 20:02:38 -0700127 if (r_dest != r_src) {
128 // FIXME: handle k64BitSolo when we start using them.
129 DCHECK(r_dest.IsPair());
130 DCHECK(r_src.IsPair());
131 bool dest_fp = X86_FPREG(r_dest.GetLowReg());
132 bool src_fp = X86_FPREG(r_src.GetLowReg());
133 if (dest_fp) {
134 if (src_fp) {
135 // TODO: we ought to handle this case here - reserve OpRegCopy for 32-bit copies.
136 OpRegCopy(RegStorage::Solo64(S2d(r_dest.GetLowReg(), r_dest.GetHighReg())),
137 RegStorage::Solo64(S2d(r_src.GetLowReg(), r_src.GetHighReg())));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700138 } else {
buzbee7a11ab02014-04-28 20:02:38 -0700139 // TODO: Prevent this from happening in the code. The result is often
140 // unused or could have been loaded more easily from memory.
141 NewLIR2(kX86MovdxrRR, r_dest.GetLowReg(), r_src.GetLowReg());
142 RegStorage r_tmp = AllocTempDouble();
143 NewLIR2(kX86MovdxrRR, r_tmp.GetLowReg(), r_src.GetHighReg());
144 NewLIR2(kX86PunpckldqRR, r_dest.GetLowReg(), r_tmp.GetLowReg());
145 FreeTemp(r_tmp);
146 }
147 } else {
148 if (src_fp) {
149 NewLIR2(kX86MovdrxRR, r_dest.GetLowReg(), r_src.GetLowReg());
150 NewLIR2(kX86PsrlqRI, r_src.GetLowReg(), 32);
151 NewLIR2(kX86MovdrxRR, r_dest.GetHighReg(), r_src.GetLowReg());
152 } else {
153 // Handle overlap
154 if (r_src.GetHighReg() == r_dest.GetLowReg() && r_src.GetLowReg() == r_dest.GetHighReg()) {
155 // Deal with cycles.
156 RegStorage temp_reg = AllocTemp();
157 OpRegCopy(temp_reg, r_dest.GetHigh());
158 OpRegCopy(r_dest.GetHigh(), r_dest.GetLow());
159 OpRegCopy(r_dest.GetLow(), temp_reg);
160 FreeTemp(temp_reg);
161 } else if (r_src.GetHighReg() == r_dest.GetLowReg()) {
162 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
163 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
164 } else {
165 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
166 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
167 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700168 }
169 }
170 }
171}
172
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700173void X86Mir2Lir::GenSelect(BasicBlock* bb, MIR* mir) {
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800174 RegLocation rl_result;
175 RegLocation rl_src = mir_graph_->GetSrc(mir, 0);
176 RegLocation rl_dest = mir_graph_->GetDest(mir);
177 rl_src = LoadValue(rl_src, kCoreReg);
Vladimir Markoa1a70742014-03-03 10:28:05 +0000178 ConditionCode ccode = mir->meta.ccode;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800179
180 // The kMirOpSelect has two variants, one for constants and one for moves.
181 const bool is_constant_case = (mir->ssa_rep->num_uses == 1);
182
183 if (is_constant_case) {
184 int true_val = mir->dalvikInsn.vB;
185 int false_val = mir->dalvikInsn.vC;
186 rl_result = EvalLoc(rl_dest, kCoreReg, true);
187
188 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000189 * For ccode == kCondEq:
190 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800191 * 1) When the true case is zero and result_reg is not same as src_reg:
192 * xor result_reg, result_reg
193 * cmp $0, src_reg
194 * mov t1, $false_case
195 * cmovnz result_reg, t1
196 * 2) When the false case is zero and result_reg is not same as src_reg:
197 * xor result_reg, result_reg
198 * cmp $0, src_reg
199 * mov t1, $true_case
200 * cmovz result_reg, t1
201 * 3) All other cases (we do compare first to set eflags):
202 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000203 * mov result_reg, $false_case
204 * mov t1, $true_case
205 * cmovz result_reg, t1
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800206 */
buzbee2700f7e2014-03-07 09:46:20 -0800207 const bool result_reg_same_as_src =
208 (rl_src.location == kLocPhysReg && rl_src.reg.GetReg() == rl_result.reg.GetReg());
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800209 const bool true_zero_case = (true_val == 0 && false_val != 0 && !result_reg_same_as_src);
210 const bool false_zero_case = (false_val == 0 && true_val != 0 && !result_reg_same_as_src);
211 const bool catch_all_case = !(true_zero_case || false_zero_case);
212
213 if (true_zero_case || false_zero_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800214 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800215 }
216
217 if (true_zero_case || false_zero_case || catch_all_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800218 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800219 }
220
221 if (catch_all_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800222 OpRegImm(kOpMov, rl_result.reg, false_val);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800223 }
224
225 if (true_zero_case || false_zero_case || catch_all_case) {
Vladimir Markoa1a70742014-03-03 10:28:05 +0000226 ConditionCode cc = true_zero_case ? NegateComparison(ccode) : ccode;
227 int immediateForTemp = true_zero_case ? false_val : true_val;
buzbee2700f7e2014-03-07 09:46:20 -0800228 RegStorage temp1_reg = AllocTemp();
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800229 OpRegImm(kOpMov, temp1_reg, immediateForTemp);
230
buzbee2700f7e2014-03-07 09:46:20 -0800231 OpCondRegReg(kOpCmov, cc, rl_result.reg, temp1_reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800232
233 FreeTemp(temp1_reg);
234 }
235 } else {
236 RegLocation rl_true = mir_graph_->GetSrc(mir, 1);
237 RegLocation rl_false = mir_graph_->GetSrc(mir, 2);
238 rl_true = LoadValue(rl_true, kCoreReg);
239 rl_false = LoadValue(rl_false, kCoreReg);
240 rl_result = EvalLoc(rl_dest, kCoreReg, true);
241
242 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000243 * For ccode == kCondEq:
244 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800245 * 1) When true case is already in place:
246 * cmp $0, src_reg
247 * cmovnz result_reg, false_reg
248 * 2) When false case is already in place:
249 * cmp $0, src_reg
250 * cmovz result_reg, true_reg
251 * 3) When neither cases are in place:
252 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000253 * mov result_reg, false_reg
254 * cmovz result_reg, true_reg
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800255 */
256
257 // kMirOpSelect is generated just for conditional cases when comparison is done with zero.
buzbee2700f7e2014-03-07 09:46:20 -0800258 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800259
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000260 if (rl_result.reg.GetReg() == rl_true.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800261 OpCondRegReg(kOpCmov, NegateComparison(ccode), rl_result.reg, rl_false.reg);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000262 } else if (rl_result.reg.GetReg() == rl_false.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800263 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800264 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800265 OpRegCopy(rl_result.reg, rl_false.reg);
266 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800267 }
268 }
269
270 StoreValue(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700271}
272
273void X86Mir2Lir::GenFusedLongCmpBranch(BasicBlock* bb, MIR* mir) {
buzbee0d829482013-10-11 15:24:55 -0700274 LIR* taken = &block_label_list_[bb->taken];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700275 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
276 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
Vladimir Markoa8946072014-01-22 10:30:44 +0000277 ConditionCode ccode = mir->meta.ccode;
Mark Mendell412d4f82013-12-18 13:32:36 -0800278
279 if (rl_src1.is_const) {
280 std::swap(rl_src1, rl_src2);
281 ccode = FlipComparisonOrder(ccode);
282 }
283 if (rl_src2.is_const) {
284 // Do special compare/branch against simple const operand
285 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
286 GenFusedLongCmpImmBranch(bb, rl_src1, val, ccode);
287 return;
288 }
289
Brian Carlstrom7940e442013-07-12 13:46:57 -0700290 FlushAllRegs();
291 LockCallTemps(); // Prepare for explicit register usage
buzbee2700f7e2014-03-07 09:46:20 -0800292 RegStorage r_tmp1(RegStorage::k64BitPair, r0, r1);
293 RegStorage r_tmp2(RegStorage::k64BitPair, r2, r3);
294 LoadValueDirectWideFixed(rl_src1, r_tmp1);
295 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700296 // Swap operands and condition code to prevent use of zero flag.
297 if (ccode == kCondLe || ccode == kCondGt) {
298 // Compute (r3:r2) = (r3:r2) - (r1:r0)
buzbee2700f7e2014-03-07 09:46:20 -0800299 OpRegReg(kOpSub, rs_r2, rs_r0); // r2 = r2 - r0
300 OpRegReg(kOpSbc, rs_r3, rs_r1); // r3 = r3 - r1 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700301 } else {
302 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -0800303 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
304 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700305 }
306 switch (ccode) {
307 case kCondEq:
308 case kCondNe:
buzbee2700f7e2014-03-07 09:46:20 -0800309 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = r0 | r1
Brian Carlstrom7940e442013-07-12 13:46:57 -0700310 break;
311 case kCondLe:
312 ccode = kCondGe;
313 break;
314 case kCondGt:
315 ccode = kCondLt;
316 break;
317 case kCondLt:
318 case kCondGe:
319 break;
320 default:
321 LOG(FATAL) << "Unexpected ccode: " << ccode;
322 }
323 OpCondBranch(ccode, taken);
324}
325
Mark Mendell412d4f82013-12-18 13:32:36 -0800326void X86Mir2Lir::GenFusedLongCmpImmBranch(BasicBlock* bb, RegLocation rl_src1,
327 int64_t val, ConditionCode ccode) {
328 int32_t val_lo = Low32Bits(val);
329 int32_t val_hi = High32Bits(val);
330 LIR* taken = &block_label_list_[bb->taken];
331 LIR* not_taken = &block_label_list_[bb->fall_through];
332 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800333 RegStorage low_reg = rl_src1.reg.GetLow();
334 RegStorage high_reg = rl_src1.reg.GetHigh();
Mark Mendell412d4f82013-12-18 13:32:36 -0800335
336 if (val == 0 && (ccode == kCondEq || ccode == kCondNe)) {
buzbee2700f7e2014-03-07 09:46:20 -0800337 RegStorage t_reg = AllocTemp();
Mark Mendell412d4f82013-12-18 13:32:36 -0800338 OpRegRegReg(kOpOr, t_reg, low_reg, high_reg);
339 FreeTemp(t_reg);
340 OpCondBranch(ccode, taken);
341 return;
342 }
343
344 OpRegImm(kOpCmp, high_reg, val_hi);
345 switch (ccode) {
346 case kCondEq:
347 case kCondNe:
348 OpCondBranch(kCondNe, (ccode == kCondEq) ? not_taken : taken);
349 break;
350 case kCondLt:
351 OpCondBranch(kCondLt, taken);
352 OpCondBranch(kCondGt, not_taken);
353 ccode = kCondUlt;
354 break;
355 case kCondLe:
356 OpCondBranch(kCondLt, taken);
357 OpCondBranch(kCondGt, not_taken);
358 ccode = kCondLs;
359 break;
360 case kCondGt:
361 OpCondBranch(kCondGt, taken);
362 OpCondBranch(kCondLt, not_taken);
363 ccode = kCondHi;
364 break;
365 case kCondGe:
366 OpCondBranch(kCondGt, taken);
367 OpCondBranch(kCondLt, not_taken);
368 ccode = kCondUge;
369 break;
370 default:
371 LOG(FATAL) << "Unexpected ccode: " << ccode;
372 }
373 OpCmpImmBranch(ccode, low_reg, val_lo, taken);
374}
375
Mark Mendell2bf31e62014-01-23 12:13:40 -0800376void X86Mir2Lir::CalculateMagicAndShift(int divisor, int& magic, int& shift) {
377 // It does not make sense to calculate magic and shift for zero divisor.
378 DCHECK_NE(divisor, 0);
379
380 /* According to H.S.Warren's Hacker's Delight Chapter 10 and
381 * T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
382 * The magic number M and shift S can be calculated in the following way:
383 * Let nc be the most positive value of numerator(n) such that nc = kd - 1,
384 * where divisor(d) >=2.
385 * Let nc be the most negative value of numerator(n) such that nc = kd + 1,
386 * where divisor(d) <= -2.
387 * Thus nc can be calculated like:
388 * nc = 2^31 + 2^31 % d - 1, where d >= 2
389 * nc = -2^31 + (2^31 + 1) % d, where d >= 2.
390 *
391 * So the shift p is the smallest p satisfying
392 * 2^p > nc * (d - 2^p % d), where d >= 2
393 * 2^p > nc * (d + 2^p % d), where d <= -2.
394 *
395 * the magic number M is calcuated by
396 * M = (2^p + d - 2^p % d) / d, where d >= 2
397 * M = (2^p - d - 2^p % d) / d, where d <= -2.
398 *
399 * Notice that p is always bigger than or equal to 32, so we just return 32-p as
400 * the shift number S.
401 */
402
403 int32_t p = 31;
404 const uint32_t two31 = 0x80000000U;
405
406 // Initialize the computations.
407 uint32_t abs_d = (divisor >= 0) ? divisor : -divisor;
408 uint32_t tmp = two31 + (static_cast<uint32_t>(divisor) >> 31);
409 uint32_t abs_nc = tmp - 1 - tmp % abs_d;
410 uint32_t quotient1 = two31 / abs_nc;
411 uint32_t remainder1 = two31 % abs_nc;
412 uint32_t quotient2 = two31 / abs_d;
413 uint32_t remainder2 = two31 % abs_d;
414
415 /*
416 * To avoid handling both positive and negative divisor, Hacker's Delight
417 * introduces a method to handle these 2 cases together to avoid duplication.
418 */
419 uint32_t delta;
420 do {
421 p++;
422 quotient1 = 2 * quotient1;
423 remainder1 = 2 * remainder1;
424 if (remainder1 >= abs_nc) {
425 quotient1++;
426 remainder1 = remainder1 - abs_nc;
427 }
428 quotient2 = 2 * quotient2;
429 remainder2 = 2 * remainder2;
430 if (remainder2 >= abs_d) {
431 quotient2++;
432 remainder2 = remainder2 - abs_d;
433 }
434 delta = abs_d - remainder2;
435 } while (quotient1 < delta || (quotient1 == delta && remainder1 == 0));
436
437 magic = (divisor > 0) ? (quotient2 + 1) : (-quotient2 - 1);
438 shift = p - 32;
439}
440
buzbee2700f7e2014-03-07 09:46:20 -0800441RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegStorage reg_lo, int lit, bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700442 LOG(FATAL) << "Unexpected use of GenDivRemLit for x86";
443 return rl_dest;
444}
445
Mark Mendell2bf31e62014-01-23 12:13:40 -0800446RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegLocation rl_src,
447 int imm, bool is_div) {
448 // Use a multiply (and fixup) to perform an int div/rem by a constant.
449
450 // We have to use fixed registers, so flush all the temps.
451 FlushAllRegs();
452 LockCallTemps(); // Prepare for explicit register usage.
453
454 // Assume that the result will be in EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800455 RegLocation rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, kVectorNotUsed, rs_r2,
456 INVALID_SREG, INVALID_SREG};
Mark Mendell2bf31e62014-01-23 12:13:40 -0800457
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700458 // handle div/rem by 1 special case.
459 if (imm == 1) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800460 if (is_div) {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700461 // x / 1 == x.
462 StoreValue(rl_result, rl_src);
463 } else {
464 // x % 1 == 0.
buzbee2700f7e2014-03-07 09:46:20 -0800465 LoadConstantNoClobber(rs_r0, 0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700466 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000467 rl_result.reg.SetReg(r0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700468 }
469 } else if (imm == -1) { // handle 0x80000000 / -1 special case.
470 if (is_div) {
471 LIR *minint_branch = 0;
buzbee2700f7e2014-03-07 09:46:20 -0800472 LoadValueDirectFixed(rl_src, rs_r0);
473 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800474 minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
475
476 // for x != MIN_INT, x / -1 == -x.
477 NewLIR1(kX86Neg32R, r0);
478
479 LIR* branch_around = NewLIR1(kX86Jmp8, 0);
480 // The target for cmp/jmp above.
481 minint_branch->target = NewLIR0(kPseudoTargetLabel);
482 // EAX already contains the right value (0x80000000),
483 branch_around->target = NewLIR0(kPseudoTargetLabel);
484 } else {
485 // x % -1 == 0.
buzbee2700f7e2014-03-07 09:46:20 -0800486 LoadConstantNoClobber(rs_r0, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800487 }
488 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000489 rl_result.reg.SetReg(r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800490 } else {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700491 CHECK(imm <= -2 || imm >= 2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800492 // Use H.S.Warren's Hacker's Delight Chapter 10 and
493 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
494 int magic, shift;
495 CalculateMagicAndShift(imm, magic, shift);
496
497 /*
498 * For imm >= 2,
499 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
500 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
501 * For imm <= -2,
502 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
503 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
504 * We implement this algorithm in the following way:
505 * 1. multiply magic number m and numerator n, get the higher 32bit result in EDX
506 * 2. if imm > 0 and magic < 0, add numerator to EDX
507 * if imm < 0 and magic > 0, sub numerator from EDX
508 * 3. if S !=0, SAR S bits for EDX
509 * 4. add 1 to EDX if EDX < 0
510 * 5. Thus, EDX is the quotient
511 */
512
513 // Numerator into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800514 RegStorage numerator_reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800515 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
516 // We will need the value later.
517 if (rl_src.location == kLocPhysReg) {
518 // We can use it directly.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000519 DCHECK(rl_src.reg.GetReg() != r0 && rl_src.reg.GetReg() != r2);
buzbee2700f7e2014-03-07 09:46:20 -0800520 numerator_reg = rl_src.reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800521 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800522 numerator_reg = rs_r1;
523 LoadValueDirectFixed(rl_src, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800524 }
buzbee2700f7e2014-03-07 09:46:20 -0800525 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800526 } else {
527 // Only need this once. Just put it into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800528 LoadValueDirectFixed(rl_src, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800529 }
530
531 // EDX = magic.
buzbee2700f7e2014-03-07 09:46:20 -0800532 LoadConstantNoClobber(rs_r2, magic);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800533
534 // EDX:EAX = magic & dividend.
535 NewLIR1(kX86Imul32DaR, r2);
536
537 if (imm > 0 && magic < 0) {
538 // Add numerator to EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800539 DCHECK(numerator_reg.Valid());
540 NewLIR2(kX86Add32RR, r2, numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800541 } else if (imm < 0 && magic > 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800542 DCHECK(numerator_reg.Valid());
543 NewLIR2(kX86Sub32RR, r2, numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800544 }
545
546 // Do we need the shift?
547 if (shift != 0) {
548 // Shift EDX by 'shift' bits.
549 NewLIR2(kX86Sar32RI, r2, shift);
550 }
551
552 // Add 1 to EDX if EDX < 0.
553
554 // Move EDX to EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800555 OpRegCopy(rs_r0, rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800556
557 // Move sign bit to bit 0, zeroing the rest.
558 NewLIR2(kX86Shr32RI, r2, 31);
559
560 // EDX = EDX + EAX.
561 NewLIR2(kX86Add32RR, r2, r0);
562
563 // Quotient is in EDX.
564 if (!is_div) {
565 // We need to compute the remainder.
566 // Remainder is divisor - (quotient * imm).
buzbee2700f7e2014-03-07 09:46:20 -0800567 DCHECK(numerator_reg.Valid());
568 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800569
570 // EAX = numerator * imm.
buzbee2700f7e2014-03-07 09:46:20 -0800571 OpRegRegImm(kOpMul, rs_r2, rs_r2, imm);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800572
573 // EDX -= EAX.
574 NewLIR2(kX86Sub32RR, r0, r2);
575
576 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000577 rl_result.reg.SetReg(r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800578 }
579 }
580
581 return rl_result;
582}
583
buzbee2700f7e2014-03-07 09:46:20 -0800584RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegStorage reg_lo, RegStorage reg_hi,
585 bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700586 LOG(FATAL) << "Unexpected use of GenDivRem for x86";
587 return rl_dest;
588}
589
Mark Mendell2bf31e62014-01-23 12:13:40 -0800590RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegLocation rl_src1,
591 RegLocation rl_src2, bool is_div, bool check_zero) {
592 // We have to use fixed registers, so flush all the temps.
593 FlushAllRegs();
594 LockCallTemps(); // Prepare for explicit register usage.
595
596 // Load LHS into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800597 LoadValueDirectFixed(rl_src1, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800598
599 // Load RHS into EBX.
buzbee2700f7e2014-03-07 09:46:20 -0800600 LoadValueDirectFixed(rl_src2, rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800601
602 // Copy LHS sign bit into EDX.
603 NewLIR0(kx86Cdq32Da);
604
605 if (check_zero) {
606 // Handle division by zero case.
Mingyao Yange643a172014-04-08 11:02:52 -0700607 GenDivZeroCheck(rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800608 }
609
610 // Have to catch 0x80000000/-1 case, or we will get an exception!
buzbee2700f7e2014-03-07 09:46:20 -0800611 OpRegImm(kOpCmp, rs_r1, -1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800612 LIR *minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
613
614 // RHS is -1.
buzbee2700f7e2014-03-07 09:46:20 -0800615 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800616 LIR * minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
617
618 // In 0x80000000/-1 case.
619 if (!is_div) {
620 // For DIV, EAX is already right. For REM, we need EDX 0.
buzbee2700f7e2014-03-07 09:46:20 -0800621 LoadConstantNoClobber(rs_r2, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800622 }
623 LIR* done = NewLIR1(kX86Jmp8, 0);
624
625 // Expected case.
626 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
627 minint_branch->target = minus_one_branch->target;
628 NewLIR1(kX86Idivmod32DaR, r1);
629 done->target = NewLIR0(kPseudoTargetLabel);
630
631 // Result is in EAX for div and EDX for rem.
buzbee2700f7e2014-03-07 09:46:20 -0800632 RegLocation rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, kVectorNotUsed, rs_r0,
633 INVALID_SREG, INVALID_SREG};
Mark Mendell2bf31e62014-01-23 12:13:40 -0800634 if (!is_div) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000635 rl_result.reg.SetReg(r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800636 }
637 return rl_result;
638}
639
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700640bool X86Mir2Lir::GenInlinedMinMaxInt(CallInfo* info, bool is_min) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700641 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800642
643 // Get the two arguments to the invoke and place them in GP registers.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700644 RegLocation rl_src1 = info->args[0];
645 RegLocation rl_src2 = info->args[1];
646 rl_src1 = LoadValue(rl_src1, kCoreReg);
647 rl_src2 = LoadValue(rl_src2, kCoreReg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800648
Brian Carlstrom7940e442013-07-12 13:46:57 -0700649 RegLocation rl_dest = InlineTarget(info);
650 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800651
652 /*
653 * If the result register is the same as the second element, then we need to be careful.
654 * The reason is that the first copy will inadvertently clobber the second element with
655 * the first one thus yielding the wrong result. Thus we do a swap in that case.
656 */
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000657 if (rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800658 std::swap(rl_src1, rl_src2);
659 }
660
661 // Pick the first integer as min/max.
buzbee2700f7e2014-03-07 09:46:20 -0800662 OpRegCopy(rl_result.reg, rl_src1.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800663
664 // If the integers are both in the same register, then there is nothing else to do
665 // because they are equal and we have already moved one into the result.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000666 if (rl_src1.reg.GetReg() != rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800667 // It is possible we didn't pick correctly so do the actual comparison now.
buzbee2700f7e2014-03-07 09:46:20 -0800668 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800669
670 // Conditionally move the other integer into the destination register.
671 ConditionCode condition_code = is_min ? kCondGt : kCondLt;
buzbee2700f7e2014-03-07 09:46:20 -0800672 OpCondRegReg(kOpCmov, condition_code, rl_result.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800673 }
674
Brian Carlstrom7940e442013-07-12 13:46:57 -0700675 StoreValue(rl_dest, rl_result);
676 return true;
677}
678
Vladimir Markoe508a202013-11-04 15:24:22 +0000679bool X86Mir2Lir::GenInlinedPeek(CallInfo* info, OpSize size) {
680 RegLocation rl_src_address = info->args[0]; // long address
buzbee2700f7e2014-03-07 09:46:20 -0800681 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[1]
buzbee695d13a2014-04-19 13:32:20 -0700682 RegLocation rl_dest = size == k64 ? InlineTargetWide(info) : InlineTarget(info);
Vladimir Markoe508a202013-11-04 15:24:22 +0000683 RegLocation rl_address = LoadValue(rl_src_address, kCoreReg);
684 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee695d13a2014-04-19 13:32:20 -0700685 if (size == k64) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000686 // Unaligned access is allowed on x86.
buzbee2700f7e2014-03-07 09:46:20 -0800687 LoadBaseDispWide(rl_address.reg, 0, rl_result.reg, INVALID_SREG);
Vladimir Markoe508a202013-11-04 15:24:22 +0000688 StoreValueWide(rl_dest, rl_result);
689 } else {
buzbee695d13a2014-04-19 13:32:20 -0700690 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
Vladimir Markoe508a202013-11-04 15:24:22 +0000691 // Unaligned access is allowed on x86.
buzbee2700f7e2014-03-07 09:46:20 -0800692 LoadBaseDisp(rl_address.reg, 0, rl_result.reg, size, INVALID_SREG);
Vladimir Markoe508a202013-11-04 15:24:22 +0000693 StoreValue(rl_dest, rl_result);
694 }
695 return true;
696}
697
698bool X86Mir2Lir::GenInlinedPoke(CallInfo* info, OpSize size) {
699 RegLocation rl_src_address = info->args[0]; // long address
buzbee2700f7e2014-03-07 09:46:20 -0800700 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[1]
Vladimir Markoe508a202013-11-04 15:24:22 +0000701 RegLocation rl_src_value = info->args[2]; // [size] value
702 RegLocation rl_address = LoadValue(rl_src_address, kCoreReg);
buzbee695d13a2014-04-19 13:32:20 -0700703 if (size == k64) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000704 // Unaligned access is allowed on x86.
705 RegLocation rl_value = LoadValueWide(rl_src_value, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800706 StoreBaseDispWide(rl_address.reg, 0, rl_value.reg);
Vladimir Markoe508a202013-11-04 15:24:22 +0000707 } else {
buzbee695d13a2014-04-19 13:32:20 -0700708 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
Vladimir Markoe508a202013-11-04 15:24:22 +0000709 // Unaligned access is allowed on x86.
710 RegLocation rl_value = LoadValue(rl_src_value, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800711 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size);
Vladimir Markoe508a202013-11-04 15:24:22 +0000712 }
713 return true;
714}
715
buzbee2700f7e2014-03-07 09:46:20 -0800716void X86Mir2Lir::OpLea(RegStorage r_base, RegStorage reg1, RegStorage reg2, int scale, int offset) {
717 NewLIR5(kX86Lea32RA, r_base.GetReg(), reg1.GetReg(), reg2.GetReg(), scale, offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700718}
719
Ian Rogersdd7624d2014-03-14 17:43:00 -0700720void X86Mir2Lir::OpTlsCmp(ThreadOffset<4> offset, int val) {
Ian Rogers468532e2013-08-05 10:56:33 -0700721 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700722}
723
buzbee2700f7e2014-03-07 09:46:20 -0800724static bool IsInReg(X86Mir2Lir *pMir2Lir, const RegLocation &rl, RegStorage reg) {
725 return rl.reg.Valid() && rl.reg.GetReg() == reg.GetReg() && (pMir2Lir->IsLive(reg) || rl.home);
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700726}
727
Vladimir Marko1c282e22013-11-21 14:49:47 +0000728bool X86Mir2Lir::GenInlinedCas(CallInfo* info, bool is_long, bool is_object) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700729 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000730 // Unused - RegLocation rl_src_unsafe = info->args[0];
731 RegLocation rl_src_obj = info->args[1]; // Object - known non-null
732 RegLocation rl_src_offset = info->args[2]; // long low
buzbee2700f7e2014-03-07 09:46:20 -0800733 rl_src_offset = NarrowRegLoc(rl_src_offset); // ignore high half in info->args[3]
Vladimir Markoc29bb612013-11-27 16:47:25 +0000734 RegLocation rl_src_expected = info->args[4]; // int, long or Object
735 // If is_long, high half is in info->args[5]
736 RegLocation rl_src_new_value = info->args[is_long ? 6 : 5]; // int, long or Object
737 // If is_long, high half is in info->args[7]
738
739 if (is_long) {
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700740 // TODO: avoid unnecessary loads of SI and DI when the values are in registers.
741 // TODO: CFI support.
Vladimir Marko70b797d2013-12-03 15:25:24 +0000742 FlushAllRegs();
743 LockCallTemps();
buzbee2700f7e2014-03-07 09:46:20 -0800744 RegStorage r_tmp1(RegStorage::k64BitPair, rAX, rDX);
745 RegStorage r_tmp2(RegStorage::k64BitPair, rBX, rCX);
746 LoadValueDirectWideFixed(rl_src_expected, r_tmp1);
747 LoadValueDirectWideFixed(rl_src_new_value, r_tmp2);
Vladimir Marko70b797d2013-12-03 15:25:24 +0000748 NewLIR1(kX86Push32R, rDI);
749 MarkTemp(rDI);
750 LockTemp(rDI);
751 NewLIR1(kX86Push32R, rSI);
752 MarkTemp(rSI);
753 LockTemp(rSI);
Vladimir Markoa6fd8ba2013-12-13 10:53:49 +0000754 const int push_offset = 4 /* push edi */ + 4 /* push esi */;
buzbee2700f7e2014-03-07 09:46:20 -0800755 int srcObjSp = IsInReg(this, rl_src_obj, rs_rSI) ? 0
756 : (IsInReg(this, rl_src_obj, rs_rDI) ? 4
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700757 : (SRegOffset(rl_src_obj.s_reg_low) + push_offset));
buzbee695d13a2014-04-19 13:32:20 -0700758 // FIXME: needs 64-bit update.
buzbee2700f7e2014-03-07 09:46:20 -0800759 LoadWordDisp(TargetReg(kSp), srcObjSp, rs_rDI);
760 int srcOffsetSp = IsInReg(this, rl_src_offset, rs_rSI) ? 0
761 : (IsInReg(this, rl_src_offset, rs_rDI) ? 4
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700762 : (SRegOffset(rl_src_offset.s_reg_low) + push_offset));
buzbee2700f7e2014-03-07 09:46:20 -0800763 LoadWordDisp(TargetReg(kSp), srcOffsetSp, rs_rSI);
Vladimir Marko70b797d2013-12-03 15:25:24 +0000764 NewLIR4(kX86LockCmpxchg8bA, rDI, rSI, 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800765
766 // After a store we need to insert barrier in case of potential load. Since the
767 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
768 GenMemBarrier(kStoreLoad);
769
Vladimir Marko70b797d2013-12-03 15:25:24 +0000770 FreeTemp(rSI);
771 UnmarkTemp(rSI);
772 NewLIR1(kX86Pop32R, rSI);
773 FreeTemp(rDI);
774 UnmarkTemp(rDI);
775 NewLIR1(kX86Pop32R, rDI);
776 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +0000777 } else {
778 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800779 FlushReg(rs_r0);
780 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000781
Vladimir Markoc29bb612013-11-27 16:47:25 +0000782 RegLocation rl_object = LoadValue(rl_src_obj, kCoreReg);
783 RegLocation rl_new_value = LoadValue(rl_src_new_value, kCoreReg);
784
785 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
786 // Mark card for object assuming new value is stored.
787 FreeTemp(r0); // Temporarily release EAX for MarkGCCard().
buzbee2700f7e2014-03-07 09:46:20 -0800788 MarkGCCard(rl_new_value.reg, rl_object.reg);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000789 LockTemp(r0);
790 }
791
792 RegLocation rl_offset = LoadValue(rl_src_offset, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800793 LoadValueDirect(rl_src_expected, rs_r0);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000794 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0, rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +0000795
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800796 // After a store we need to insert barrier in case of potential load. Since the
797 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
798 GenMemBarrier(kStoreLoad);
799
Vladimir Markoc29bb612013-11-27 16:47:25 +0000800 FreeTemp(r0);
801 }
802
803 // Convert ZF to boolean
804 RegLocation rl_dest = InlineTarget(info); // boolean place for result
805 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000806 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondZ);
807 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +0000808 StoreValue(rl_dest, rl_result);
809 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700810}
811
buzbee2700f7e2014-03-07 09:46:20 -0800812LIR* X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800813 CHECK(base_of_code_ != nullptr);
814
815 // Address the start of the method
816 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
817 LoadValueDirectFixed(rl_method, reg);
818 store_method_addr_used_ = true;
819
820 // Load the proper value from the literal area.
821 // We don't know the proper offset for the value, so pick one that will force
822 // 4 byte offset. We will fix this up in the assembler later to have the right
823 // value.
buzbee2700f7e2014-03-07 09:46:20 -0800824 LIR *res = RawLIR(current_dalvik_offset_, kX86Mov32RM, reg.GetReg(), reg.GetReg(), 256,
825 0, 0, target);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800826 res->target = target;
827 res->flags.fixup = kFixupLoad;
828 SetMemRefType(res, true, kLiteral);
829 store_method_addr_used_ = true;
830 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700831}
832
buzbee2700f7e2014-03-07 09:46:20 -0800833LIR* X86Mir2Lir::OpVldm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700834 LOG(FATAL) << "Unexpected use of OpVldm for x86";
835 return NULL;
836}
837
buzbee2700f7e2014-03-07 09:46:20 -0800838LIR* X86Mir2Lir::OpVstm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700839 LOG(FATAL) << "Unexpected use of OpVstm for x86";
840 return NULL;
841}
842
843void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
844 RegLocation rl_result, int lit,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700845 int first_bit, int second_bit) {
buzbee2700f7e2014-03-07 09:46:20 -0800846 RegStorage t_reg = AllocTemp();
847 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
848 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700849 FreeTemp(t_reg);
850 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800851 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700852 }
853}
854
Mingyao Yange643a172014-04-08 11:02:52 -0700855void X86Mir2Lir::GenDivZeroCheckWide(RegStorage reg) {
buzbee2700f7e2014-03-07 09:46:20 -0800856 DCHECK(reg.IsPair()); // TODO: allow 64BitSolo.
857 // We are not supposed to clobber the incoming storage, so allocate a temporary.
858 RegStorage t_reg = AllocTemp();
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800859
860 // 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 -0800861 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800862
863 // In case of zero, throw ArithmeticException.
Mingyao Yange643a172014-04-08 11:02:52 -0700864 GenDivZeroCheck(kCondEq);
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800865
866 // The temp is no longer needed so free it at this time.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700867 FreeTemp(t_reg);
868}
869
Mingyao Yang80365d92014-04-18 12:10:58 -0700870void X86Mir2Lir::GenArrayBoundsCheck(RegStorage index,
871 RegStorage array_base,
872 int len_offset) {
873 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
874 public:
875 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
876 RegStorage index, RegStorage array_base, int32_t len_offset)
877 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
878 index_(index), array_base_(array_base), len_offset_(len_offset) {
879 }
880
881 void Compile() OVERRIDE {
882 m2l_->ResetRegPool();
883 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -0700884 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -0700885
886 RegStorage new_index = index_;
887 // Move index out of kArg1, either directly to kArg0, or to kArg2.
888 if (index_.GetReg() == m2l_->TargetReg(kArg1).GetReg()) {
889 if (array_base_.GetReg() == m2l_->TargetReg(kArg0).GetReg()) {
890 m2l_->OpRegCopy(m2l_->TargetReg(kArg2), index_);
891 new_index = m2l_->TargetReg(kArg2);
892 } else {
893 m2l_->OpRegCopy(m2l_->TargetReg(kArg0), index_);
894 new_index = m2l_->TargetReg(kArg0);
895 }
896 }
897 // Load array length to kArg1.
898 m2l_->OpRegMem(kOpMov, m2l_->TargetReg(kArg1), array_base_, len_offset_);
899 m2l_->CallRuntimeHelperRegReg(QUICK_ENTRYPOINT_OFFSET(4, pThrowArrayBounds),
900 new_index, m2l_->TargetReg(kArg1), true);
901 }
902
903 private:
904 const RegStorage index_;
905 const RegStorage array_base_;
906 const int32_t len_offset_;
907 };
908
909 OpRegMem(kOpCmp, index, array_base, len_offset);
910 LIR* branch = OpCondBranch(kCondUge, nullptr);
911 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
912 index, array_base, len_offset));
913}
914
915void X86Mir2Lir::GenArrayBoundsCheck(int32_t index,
916 RegStorage array_base,
917 int32_t len_offset) {
918 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
919 public:
920 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
921 int32_t index, RegStorage array_base, int32_t len_offset)
922 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
923 index_(index), array_base_(array_base), len_offset_(len_offset) {
924 }
925
926 void Compile() OVERRIDE {
927 m2l_->ResetRegPool();
928 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -0700929 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -0700930
931 // Load array length to kArg1.
932 m2l_->OpRegMem(kOpMov, m2l_->TargetReg(kArg1), array_base_, len_offset_);
933 m2l_->LoadConstant(m2l_->TargetReg(kArg0), index_);
934 m2l_->CallRuntimeHelperRegReg(QUICK_ENTRYPOINT_OFFSET(4, pThrowArrayBounds),
935 m2l_->TargetReg(kArg0), m2l_->TargetReg(kArg1), true);
936 }
937
938 private:
939 const int32_t index_;
940 const RegStorage array_base_;
941 const int32_t len_offset_;
942 };
943
944 NewLIR3(IS_SIMM8(index) ? kX86Cmp32MI8 : kX86Cmp32MI, array_base.GetReg(), len_offset, index);
945 LIR* branch = OpCondBranch(kCondLs, nullptr);
946 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
947 index, array_base, len_offset));
948}
949
Brian Carlstrom7940e442013-07-12 13:46:57 -0700950// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700951LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
Ian Rogersdd7624d2014-03-14 17:43:00 -0700952 OpTlsCmp(Thread::ThreadFlagsOffset<4>(), 0);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700953 return OpCondBranch((target == NULL) ? kCondNe : kCondEq, target);
954}
955
956// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -0800957LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700958 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -0800959 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700960}
961
buzbee11b63d12013-08-27 07:34:17 -0700962bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700963 RegLocation rl_src, RegLocation rl_dest, int lit) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700964 LOG(FATAL) << "Unexpected use of smallLiteralDive in x86";
965 return false;
966}
967
Ian Rogerse2143c02014-03-28 08:47:16 -0700968bool X86Mir2Lir::EasyMultiply(RegLocation rl_src, RegLocation rl_dest, int lit) {
969 LOG(FATAL) << "Unexpected use of easyMultiply in x86";
970 return false;
971}
972
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700973LIR* X86Mir2Lir::OpIT(ConditionCode cond, const char* guide) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700974 LOG(FATAL) << "Unexpected use of OpIT in x86";
975 return NULL;
976}
977
Dave Allison3da67a52014-04-02 17:03:45 -0700978void X86Mir2Lir::OpEndIT(LIR* it) {
979 LOG(FATAL) << "Unexpected use of OpEndIT in x86";
980}
981
buzbee2700f7e2014-03-07 09:46:20 -0800982void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -0800983 switch (val) {
984 case 0:
buzbee2700f7e2014-03-07 09:46:20 -0800985 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -0800986 break;
987 case 1:
988 OpRegCopy(dest, src);
989 break;
990 default:
991 OpRegRegImm(kOpMul, dest, src, val);
992 break;
993 }
994}
995
buzbee2700f7e2014-03-07 09:46:20 -0800996void X86Mir2Lir::GenImulMemImm(RegStorage dest, int sreg, int displacement, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -0800997 LIR *m;
998 switch (val) {
999 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001000 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001001 break;
1002 case 1:
buzbee695d13a2014-04-19 13:32:20 -07001003 LoadBaseDisp(rs_rX86_SP, displacement, dest, k32, sreg);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001004 break;
1005 default:
buzbee2700f7e2014-03-07 09:46:20 -08001006 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(), rX86_SP,
Mark Mendell4708dcd2014-01-22 09:05:18 -08001007 displacement, val);
1008 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
1009 break;
1010 }
1011}
1012
Mark Mendelle02d48f2014-01-15 11:19:23 -08001013void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001014 RegLocation rl_src2) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001015 if (rl_src1.is_const) {
1016 std::swap(rl_src1, rl_src2);
1017 }
1018 // Are we multiplying by a constant?
1019 if (rl_src2.is_const) {
1020 // Do special compare/branch against simple const operand
1021 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
1022 if (val == 0) {
1023 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001024 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
1025 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001026 StoreValueWide(rl_dest, rl_result);
1027 return;
1028 } else if (val == 1) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001029 StoreValueWide(rl_dest, rl_src1);
1030 return;
1031 } else if (val == 2) {
1032 GenAddLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1);
1033 return;
1034 } else if (IsPowerOfTwo(val)) {
1035 int shift_amount = LowestSetBit(val);
1036 if (!BadOverlap(rl_src1, rl_dest)) {
1037 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1038 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest,
1039 rl_src1, shift_amount);
1040 StoreValueWide(rl_dest, rl_result);
1041 return;
1042 }
1043 }
1044
1045 // Okay, just bite the bullet and do it.
1046 int32_t val_lo = Low32Bits(val);
1047 int32_t val_hi = High32Bits(val);
1048 FlushAllRegs();
1049 LockCallTemps(); // Prepare for explicit register usage.
1050 rl_src1 = UpdateLocWide(rl_src1);
1051 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1052 int displacement = SRegOffset(rl_src1.s_reg_low);
1053
1054 // ECX <- 1H * 2L
1055 // EAX <- 1L * 2H
1056 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001057 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
1058 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001059 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001060 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
1061 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001062 }
1063
1064 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
1065 NewLIR2(kX86Add32RR, r1, r0);
1066
1067 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001068 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001069
1070 // EDX:EAX <- 2L * 1L (double precision)
1071 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001072 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001073 } else {
1074 LIR *m = NewLIR2(kX86Mul32DaM, rX86_SP, displacement + LOWORD_OFFSET);
1075 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1076 true /* is_load */, true /* is_64bit */);
1077 }
1078
1079 // EDX <- EDX + ECX (add high words)
1080 NewLIR2(kX86Add32RR, r2, r1);
1081
1082 // Result is EDX:EAX
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001083 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, kVectorNotUsed,
buzbee2700f7e2014-03-07 09:46:20 -08001084 RegStorage::MakeRegPair(rs_r0, rs_r2),
Mark Mendell4708dcd2014-01-22 09:05:18 -08001085 INVALID_SREG, INVALID_SREG};
1086 StoreValueWide(rl_dest, rl_result);
1087 return;
1088 }
1089
1090 // Nope. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001091 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1092 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1093 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1094
Mark Mendell4708dcd2014-01-22 09:05:18 -08001095 FlushAllRegs();
1096 LockCallTemps(); // Prepare for explicit register usage.
1097 rl_src1 = UpdateLocWide(rl_src1);
1098 rl_src2 = UpdateLocWide(rl_src2);
1099
1100 // At this point, the VRs are in their home locations.
1101 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1102 bool src2_in_reg = rl_src2.location == kLocPhysReg;
1103
1104 // ECX <- 1H
1105 if (src1_in_reg) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001106 NewLIR2(kX86Mov32RR, r1, rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001107 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001108 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1,
buzbee695d13a2014-04-19 13:32:20 -07001109 k32, GetSRegHi(rl_src1.s_reg_low));
Mark Mendell4708dcd2014-01-22 09:05:18 -08001110 }
1111
Mark Mendellde99bba2014-02-14 12:15:02 -08001112 if (is_square) {
1113 // Take advantage of the fact that the values are the same.
1114 // ECX <- ECX * 2L (1H * 2L)
1115 if (src2_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001116 NewLIR2(kX86Imul32RR, r1, rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001117 } else {
1118 int displacement = SRegOffset(rl_src2.s_reg_low);
1119 LIR *m = NewLIR3(kX86Imul32RM, r1, rX86_SP, displacement + LOWORD_OFFSET);
1120 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1121 true /* is_load */, true /* is_64bit */);
1122 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001123
Mark Mendellde99bba2014-02-14 12:15:02 -08001124 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
1125 NewLIR2(kX86Add32RR, r1, r1);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001126 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001127 // EAX <- 2H
1128 if (src2_in_reg) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001129 NewLIR2(kX86Mov32RR, r0, rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001130 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001131 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0,
buzbee695d13a2014-04-19 13:32:20 -07001132 k32, GetSRegHi(rl_src2.s_reg_low));
Mark Mendellde99bba2014-02-14 12:15:02 -08001133 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001134
Mark Mendellde99bba2014-02-14 12:15:02 -08001135 // EAX <- EAX * 1L (2H * 1L)
1136 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001137 NewLIR2(kX86Imul32RR, r0, rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001138 } else {
1139 int displacement = SRegOffset(rl_src1.s_reg_low);
1140 LIR *m = NewLIR3(kX86Imul32RM, r0, rX86_SP, displacement + LOWORD_OFFSET);
1141 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1142 true /* is_load */, true /* is_64bit */);
1143 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001144
Mark Mendellde99bba2014-02-14 12:15:02 -08001145 // ECX <- ECX * 2L (1H * 2L)
1146 if (src2_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001147 NewLIR2(kX86Imul32RR, r1, rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001148 } else {
1149 int displacement = SRegOffset(rl_src2.s_reg_low);
1150 LIR *m = NewLIR3(kX86Imul32RM, r1, rX86_SP, displacement + LOWORD_OFFSET);
1151 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1152 true /* is_load */, true /* is_64bit */);
1153 }
1154
1155 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
1156 NewLIR2(kX86Add32RR, r1, r0);
1157 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001158
1159 // EAX <- 2L
1160 if (src2_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001161 NewLIR2(kX86Mov32RR, r0, rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001162 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001163 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0,
buzbee695d13a2014-04-19 13:32:20 -07001164 k32, rl_src2.s_reg_low);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001165 }
1166
1167 // EDX:EAX <- 2L * 1L (double precision)
1168 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001169 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001170 } else {
1171 int displacement = SRegOffset(rl_src1.s_reg_low);
1172 LIR *m = NewLIR2(kX86Mul32DaM, rX86_SP, displacement + LOWORD_OFFSET);
1173 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1174 true /* is_load */, true /* is_64bit */);
1175 }
1176
1177 // EDX <- EDX + ECX (add high words)
1178 NewLIR2(kX86Add32RR, r2, r1);
1179
1180 // Result is EDX:EAX
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001181 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1, kVectorNotUsed,
buzbee2700f7e2014-03-07 09:46:20 -08001182 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001183 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001184}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001185
1186void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1187 Instruction::Code op) {
1188 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1189 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1190 if (rl_src.location == kLocPhysReg) {
1191 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001192 // But we must ensure that rl_src is in pair
1193 rl_src = EvalLocWide(rl_src, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001194 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001195 // The registers are the same, so we would clobber it before the use.
buzbee2700f7e2014-03-07 09:46:20 -08001196 RegStorage temp_reg = AllocTemp();
1197 OpRegCopy(temp_reg, rl_dest.reg);
1198 rl_src.reg.SetHighReg(temp_reg.GetReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001199 }
buzbee2700f7e2014-03-07 09:46:20 -08001200 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001201
1202 x86op = GetOpcode(op, rl_dest, rl_src, true);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001203 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
buzbee2700f7e2014-03-07 09:46:20 -08001204 FreeTemp(rl_src.reg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001205 return;
1206 }
1207
1208 // RHS is in memory.
1209 DCHECK((rl_src.location == kLocDalvikFrame) ||
1210 (rl_src.location == kLocCompilerTemp));
buzbee2700f7e2014-03-07 09:46:20 -08001211 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001212 int displacement = SRegOffset(rl_src.s_reg_low);
1213
buzbee2700f7e2014-03-07 09:46:20 -08001214 LIR *lir = NewLIR3(x86op, rl_dest.reg.GetLowReg(), r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001215 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1216 true /* is_load */, true /* is64bit */);
1217 x86op = GetOpcode(op, rl_dest, rl_src, true);
buzbee2700f7e2014-03-07 09:46:20 -08001218 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001219 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1220 true /* is_load */, true /* is64bit */);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001221}
1222
Mark Mendelle02d48f2014-01-15 11:19:23 -08001223void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
1224 rl_dest = UpdateLocWide(rl_dest);
1225 if (rl_dest.location == kLocPhysReg) {
1226 // Ensure we are in a register pair
1227 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1228
1229 rl_src = UpdateLocWide(rl_src);
1230 GenLongRegOrMemOp(rl_result, rl_src, op);
1231 StoreFinalValueWide(rl_dest, rl_result);
1232 return;
1233 }
1234
1235 // It wasn't in registers, so it better be in memory.
1236 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1237 (rl_dest.location == kLocCompilerTemp));
1238 rl_src = LoadValueWide(rl_src, kCoreReg);
1239
1240 // Operate directly into memory.
1241 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
buzbee2700f7e2014-03-07 09:46:20 -08001242 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001243 int displacement = SRegOffset(rl_dest.s_reg_low);
1244
buzbee2700f7e2014-03-07 09:46:20 -08001245 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001246 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001247 true /* is_load */, true /* is64bit */);
1248 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001249 false /* is_load */, true /* is64bit */);
1250 x86op = GetOpcode(op, rl_dest, rl_src, true);
buzbee2700f7e2014-03-07 09:46:20 -08001251 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001252 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001253 true /* is_load */, true /* is64bit */);
1254 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001255 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -08001256 FreeTemp(rl_src.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001257}
1258
Mark Mendelle02d48f2014-01-15 11:19:23 -08001259void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
1260 RegLocation rl_src2, Instruction::Code op,
1261 bool is_commutative) {
1262 // Is this really a 2 operand operation?
1263 switch (op) {
1264 case Instruction::ADD_LONG_2ADDR:
1265 case Instruction::SUB_LONG_2ADDR:
1266 case Instruction::AND_LONG_2ADDR:
1267 case Instruction::OR_LONG_2ADDR:
1268 case Instruction::XOR_LONG_2ADDR:
1269 GenLongArith(rl_dest, rl_src2, op);
1270 return;
1271 default:
1272 break;
1273 }
1274
1275 if (rl_dest.location == kLocPhysReg) {
1276 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
1277
1278 // We are about to clobber the LHS, so it needs to be a temp.
1279 rl_result = ForceTempWide(rl_result);
1280
1281 // Perform the operation using the RHS.
1282 rl_src2 = UpdateLocWide(rl_src2);
1283 GenLongRegOrMemOp(rl_result, rl_src2, op);
1284
1285 // And now record that the result is in the temp.
1286 StoreFinalValueWide(rl_dest, rl_result);
1287 return;
1288 }
1289
1290 // It wasn't in registers, so it better be in memory.
1291 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1292 (rl_dest.location == kLocCompilerTemp));
1293 rl_src1 = UpdateLocWide(rl_src1);
1294 rl_src2 = UpdateLocWide(rl_src2);
1295
1296 // Get one of the source operands into temporary register.
1297 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -08001298 if (IsTemp(rl_src1.reg.GetLowReg()) && IsTemp(rl_src1.reg.GetHighReg())) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001299 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1300 } else if (is_commutative) {
1301 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1302 // We need at least one of them to be a temporary.
buzbee2700f7e2014-03-07 09:46:20 -08001303 if (!(IsTemp(rl_src2.reg.GetLowReg()) && IsTemp(rl_src2.reg.GetHighReg()))) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001304 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07001305 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1306 } else {
1307 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1308 StoreFinalValueWide(rl_dest, rl_src2);
1309 return;
Mark Mendelle02d48f2014-01-15 11:19:23 -08001310 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001311 } else {
1312 // Need LHS to be the temp.
1313 rl_src1 = ForceTempWide(rl_src1);
1314 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1315 }
1316
1317 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001318}
1319
Mark Mendelle02d48f2014-01-15 11:19:23 -08001320void X86Mir2Lir::GenAddLong(Instruction::Code opcode, RegLocation rl_dest,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001321 RegLocation rl_src1, RegLocation rl_src2) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001322 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1323}
1324
1325void X86Mir2Lir::GenSubLong(Instruction::Code opcode, RegLocation rl_dest,
1326 RegLocation rl_src1, RegLocation rl_src2) {
1327 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1328}
1329
1330void X86Mir2Lir::GenAndLong(Instruction::Code opcode, RegLocation rl_dest,
1331 RegLocation rl_src1, RegLocation rl_src2) {
1332 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1333}
1334
1335void X86Mir2Lir::GenOrLong(Instruction::Code opcode, RegLocation rl_dest,
1336 RegLocation rl_src1, RegLocation rl_src2) {
1337 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1338}
1339
1340void X86Mir2Lir::GenXorLong(Instruction::Code opcode, RegLocation rl_dest,
1341 RegLocation rl_src1, RegLocation rl_src2) {
1342 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001343}
1344
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001345void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001346 rl_src = LoadValueWide(rl_src, kCoreReg);
1347 RegLocation rl_result = ForceTempWide(rl_src);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001348 if (((rl_dest.location == kLocPhysReg) && (rl_src.location == kLocPhysReg)) &&
buzbee2700f7e2014-03-07 09:46:20 -08001349 ((rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()))) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001350 // The registers are the same, so we would clobber it before the use.
buzbee2700f7e2014-03-07 09:46:20 -08001351 RegStorage temp_reg = AllocTemp();
1352 OpRegCopy(temp_reg, rl_result.reg);
1353 rl_result.reg.SetHighReg(temp_reg.GetReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001354 }
buzbee2700f7e2014-03-07 09:46:20 -08001355 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
1356 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
1357 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Brian Carlstrom7940e442013-07-12 13:46:57 -07001358 StoreValueWide(rl_dest, rl_result);
1359}
1360
Ian Rogersdd7624d2014-03-14 17:43:00 -07001361void X86Mir2Lir::OpRegThreadMem(OpKind op, int r_dest, ThreadOffset<4> thread_offset) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001362 X86OpCode opcode = kX86Bkpt;
1363 switch (op) {
1364 case kOpCmp: opcode = kX86Cmp32RT; break;
1365 case kOpMov: opcode = kX86Mov32RT; break;
1366 default:
1367 LOG(FATAL) << "Bad opcode: " << op;
1368 break;
1369 }
Ian Rogers468532e2013-08-05 10:56:33 -07001370 NewLIR2(opcode, r_dest, thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07001371}
1372
1373/*
1374 * Generate array load
1375 */
1376void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07001377 RegLocation rl_index, RegLocation rl_dest, int scale) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001378 RegisterClass reg_class = oat_reg_class_by_size(size);
1379 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001380 RegLocation rl_result;
1381 rl_array = LoadValue(rl_array, kCoreReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001382
Mark Mendell343adb52013-12-18 06:02:17 -08001383 int data_offset;
buzbee695d13a2014-04-19 13:32:20 -07001384 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001385 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
1386 } else {
1387 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
1388 }
1389
Mark Mendell343adb52013-12-18 06:02:17 -08001390 bool constant_index = rl_index.is_const;
1391 int32_t constant_index_value = 0;
1392 if (!constant_index) {
1393 rl_index = LoadValue(rl_index, kCoreReg);
1394 } else {
1395 constant_index_value = mir_graph_->ConstantValue(rl_index);
1396 // If index is constant, just fold it into the data offset
1397 data_offset += constant_index_value << scale;
1398 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08001399 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08001400 }
1401
Brian Carlstrom7940e442013-07-12 13:46:57 -07001402 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08001403 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001404
1405 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08001406 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001407 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001408 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07001409 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001410 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001411 }
Mark Mendell343adb52013-12-18 06:02:17 -08001412 rl_result = EvalLoc(rl_dest, reg_class, true);
buzbee695d13a2014-04-19 13:32:20 -07001413 if ((size == k64) || (size == kDouble)) {
buzbee2700f7e2014-03-07 09:46:20 -08001414 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg.GetLow(),
1415 rl_result.reg.GetHigh(), size, INVALID_SREG);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001416 StoreValueWide(rl_dest, rl_result);
1417 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001418 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg,
1419 RegStorage::InvalidReg(), size, INVALID_SREG);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001420 StoreValue(rl_dest, rl_result);
1421 }
1422}
1423
1424/*
1425 * Generate array store
1426 *
1427 */
1428void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07001429 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001430 RegisterClass reg_class = oat_reg_class_by_size(size);
1431 int len_offset = mirror::Array::LengthOffset().Int32Value();
1432 int data_offset;
1433
buzbee695d13a2014-04-19 13:32:20 -07001434 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001435 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
1436 } else {
1437 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
1438 }
1439
1440 rl_array = LoadValue(rl_array, kCoreReg);
Mark Mendell343adb52013-12-18 06:02:17 -08001441 bool constant_index = rl_index.is_const;
1442 int32_t constant_index_value = 0;
1443 if (!constant_index) {
1444 rl_index = LoadValue(rl_index, kCoreReg);
1445 } else {
1446 // If index is constant, just fold it into the data offset
1447 constant_index_value = mir_graph_->ConstantValue(rl_index);
1448 data_offset += constant_index_value << scale;
1449 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08001450 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08001451 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001452
1453 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08001454 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001455
1456 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08001457 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001458 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001459 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07001460 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001461 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001462 }
buzbee695d13a2014-04-19 13:32:20 -07001463 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001464 rl_src = LoadValueWide(rl_src, reg_class);
1465 } else {
1466 rl_src = LoadValue(rl_src, reg_class);
1467 }
1468 // If the src reg can't be byte accessed, move it to a temp first.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001469 if ((size == kSignedByte || size == kUnsignedByte) && rl_src.reg.GetReg() >= 4) {
buzbee2700f7e2014-03-07 09:46:20 -08001470 RegStorage temp = AllocTemp();
1471 OpRegCopy(temp, rl_src.reg);
1472 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp,
1473 RegStorage::InvalidReg(), size, INVALID_SREG);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001474 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001475 if (rl_src.wide) {
1476 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg.GetLow(),
1477 rl_src.reg.GetHigh(), size, INVALID_SREG);
1478 } else {
1479 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg,
1480 RegStorage::InvalidReg(), size, INVALID_SREG);
1481 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001482 }
Ian Rogersa9a82542013-10-04 11:17:26 -07001483 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07001484 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08001485 if (!constant_index) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001486 FreeTemp(rl_index.reg.GetReg());
Mark Mendell343adb52013-12-18 06:02:17 -08001487 }
buzbee2700f7e2014-03-07 09:46:20 -08001488 MarkGCCard(rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001489 }
1490}
1491
Mark Mendell4708dcd2014-01-22 09:05:18 -08001492RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
1493 RegLocation rl_src, int shift_amount) {
1494 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1495 switch (opcode) {
1496 case Instruction::SHL_LONG:
1497 case Instruction::SHL_LONG_2ADDR:
1498 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
1499 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001500 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
1501 LoadConstant(rl_result.reg.GetLow(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001502 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001503 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001504 FreeTemp(rl_src.reg.GetHighReg());
1505 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
buzbee2700f7e2014-03-07 09:46:20 -08001506 LoadConstant(rl_result.reg.GetLow(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001507 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001508 OpRegCopy(rl_result.reg, rl_src.reg);
1509 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1510 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(), shift_amount);
1511 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001512 }
1513 break;
1514 case Instruction::SHR_LONG:
1515 case Instruction::SHR_LONG_2ADDR:
1516 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001517 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1518 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001519 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001520 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001521 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1522 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1523 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001524 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001525 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001526 OpRegCopy(rl_result.reg, rl_src.reg);
1527 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1528 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(), shift_amount);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001529 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001530 }
1531 break;
1532 case Instruction::USHR_LONG:
1533 case Instruction::USHR_LONG_2ADDR:
1534 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001535 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1536 LoadConstant(rl_result.reg.GetHigh(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001537 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001538 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1539 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
1540 LoadConstant(rl_result.reg.GetHigh(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001541 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001542 OpRegCopy(rl_result.reg, rl_src.reg);
1543 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1544 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(), shift_amount);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001545 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001546 }
1547 break;
1548 default:
1549 LOG(FATAL) << "Unexpected case";
1550 }
1551 return rl_result;
1552}
1553
Brian Carlstrom7940e442013-07-12 13:46:57 -07001554void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Mark Mendell4708dcd2014-01-22 09:05:18 -08001555 RegLocation rl_src, RegLocation rl_shift) {
1556 // Per spec, we only care about low 6 bits of shift amount.
1557 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
1558 if (shift_amount == 0) {
1559 rl_src = LoadValueWide(rl_src, kCoreReg);
1560 StoreValueWide(rl_dest, rl_src);
1561 return;
1562 } else if (shift_amount == 1 &&
1563 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
1564 // Need to handle this here to avoid calling StoreValueWide twice.
1565 GenAddLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src);
1566 return;
1567 }
1568 if (BadOverlap(rl_src, rl_dest)) {
1569 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
1570 return;
1571 }
1572 rl_src = LoadValueWide(rl_src, kCoreReg);
1573 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount);
1574 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001575}
1576
1577void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001578 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001579 switch (opcode) {
1580 case Instruction::ADD_LONG:
1581 case Instruction::AND_LONG:
1582 case Instruction::OR_LONG:
1583 case Instruction::XOR_LONG:
1584 if (rl_src2.is_const) {
1585 GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
1586 } else {
1587 DCHECK(rl_src1.is_const);
1588 GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
1589 }
1590 break;
1591 case Instruction::SUB_LONG:
1592 case Instruction::SUB_LONG_2ADDR:
1593 if (rl_src2.is_const) {
1594 GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
1595 } else {
1596 GenSubLong(opcode, rl_dest, rl_src1, rl_src2);
1597 }
1598 break;
1599 case Instruction::ADD_LONG_2ADDR:
1600 case Instruction::OR_LONG_2ADDR:
1601 case Instruction::XOR_LONG_2ADDR:
1602 case Instruction::AND_LONG_2ADDR:
1603 if (rl_src2.is_const) {
1604 GenLongImm(rl_dest, rl_src2, opcode);
1605 } else {
1606 DCHECK(rl_src1.is_const);
1607 GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
1608 }
1609 break;
1610 default:
1611 // Default - bail to non-const handler.
1612 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
1613 break;
1614 }
1615}
1616
1617bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
1618 switch (op) {
1619 case Instruction::AND_LONG_2ADDR:
1620 case Instruction::AND_LONG:
1621 return value == -1;
1622 case Instruction::OR_LONG:
1623 case Instruction::OR_LONG_2ADDR:
1624 case Instruction::XOR_LONG:
1625 case Instruction::XOR_LONG_2ADDR:
1626 return value == 0;
1627 default:
1628 return false;
1629 }
1630}
1631
1632X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
1633 bool is_high_op) {
1634 bool rhs_in_mem = rhs.location != kLocPhysReg;
1635 bool dest_in_mem = dest.location != kLocPhysReg;
1636 DCHECK(!rhs_in_mem || !dest_in_mem);
1637 switch (op) {
1638 case Instruction::ADD_LONG:
1639 case Instruction::ADD_LONG_2ADDR:
1640 if (dest_in_mem) {
1641 return is_high_op ? kX86Adc32MR : kX86Add32MR;
1642 } else if (rhs_in_mem) {
1643 return is_high_op ? kX86Adc32RM : kX86Add32RM;
1644 }
1645 return is_high_op ? kX86Adc32RR : kX86Add32RR;
1646 case Instruction::SUB_LONG:
1647 case Instruction::SUB_LONG_2ADDR:
1648 if (dest_in_mem) {
1649 return is_high_op ? kX86Sbb32MR : kX86Sub32MR;
1650 } else if (rhs_in_mem) {
1651 return is_high_op ? kX86Sbb32RM : kX86Sub32RM;
1652 }
1653 return is_high_op ? kX86Sbb32RR : kX86Sub32RR;
1654 case Instruction::AND_LONG_2ADDR:
1655 case Instruction::AND_LONG:
1656 if (dest_in_mem) {
1657 return kX86And32MR;
1658 }
1659 return rhs_in_mem ? kX86And32RM : kX86And32RR;
1660 case Instruction::OR_LONG:
1661 case Instruction::OR_LONG_2ADDR:
1662 if (dest_in_mem) {
1663 return kX86Or32MR;
1664 }
1665 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
1666 case Instruction::XOR_LONG:
1667 case Instruction::XOR_LONG_2ADDR:
1668 if (dest_in_mem) {
1669 return kX86Xor32MR;
1670 }
1671 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
1672 default:
1673 LOG(FATAL) << "Unexpected opcode: " << op;
1674 return kX86Add32RR;
1675 }
1676}
1677
1678X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
1679 int32_t value) {
1680 bool in_mem = loc.location != kLocPhysReg;
1681 bool byte_imm = IS_SIMM8(value);
buzbee2700f7e2014-03-07 09:46:20 -08001682 DCHECK(in_mem || !IsFpReg(loc.reg));
Mark Mendelle02d48f2014-01-15 11:19:23 -08001683 switch (op) {
1684 case Instruction::ADD_LONG:
1685 case Instruction::ADD_LONG_2ADDR:
1686 if (byte_imm) {
1687 if (in_mem) {
1688 return is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
1689 }
1690 return is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
1691 }
1692 if (in_mem) {
1693 return is_high_op ? kX86Adc32MI : kX86Add32MI;
1694 }
1695 return is_high_op ? kX86Adc32RI : kX86Add32RI;
1696 case Instruction::SUB_LONG:
1697 case Instruction::SUB_LONG_2ADDR:
1698 if (byte_imm) {
1699 if (in_mem) {
1700 return is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
1701 }
1702 return is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
1703 }
1704 if (in_mem) {
1705 return is_high_op ? kX86Sbb32MI : kX86Sub32MI;
1706 }
1707 return is_high_op ? kX86Sbb32RI : kX86Sub32RI;
1708 case Instruction::AND_LONG_2ADDR:
1709 case Instruction::AND_LONG:
1710 if (byte_imm) {
1711 return in_mem ? kX86And32MI8 : kX86And32RI8;
1712 }
1713 return in_mem ? kX86And32MI : kX86And32RI;
1714 case Instruction::OR_LONG:
1715 case Instruction::OR_LONG_2ADDR:
1716 if (byte_imm) {
1717 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
1718 }
1719 return in_mem ? kX86Or32MI : kX86Or32RI;
1720 case Instruction::XOR_LONG:
1721 case Instruction::XOR_LONG_2ADDR:
1722 if (byte_imm) {
1723 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
1724 }
1725 return in_mem ? kX86Xor32MI : kX86Xor32RI;
1726 default:
1727 LOG(FATAL) << "Unexpected opcode: " << op;
1728 return kX86Add32MI;
1729 }
1730}
1731
1732void X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
1733 DCHECK(rl_src.is_const);
1734 int64_t val = mir_graph_->ConstantValueWide(rl_src);
1735 int32_t val_lo = Low32Bits(val);
1736 int32_t val_hi = High32Bits(val);
1737 rl_dest = UpdateLocWide(rl_dest);
1738
1739 // Can we just do this into memory?
1740 if ((rl_dest.location == kLocDalvikFrame) ||
1741 (rl_dest.location == kLocCompilerTemp)) {
buzbee2700f7e2014-03-07 09:46:20 -08001742 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001743 int displacement = SRegOffset(rl_dest.s_reg_low);
1744
1745 if (!IsNoOp(op, val_lo)) {
1746 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001747 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001748 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001749 true /* is_load */, true /* is64bit */);
1750 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001751 false /* is_load */, true /* is64bit */);
1752 }
1753 if (!IsNoOp(op, val_hi)) {
1754 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08001755 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001756 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001757 true /* is_load */, true /* is64bit */);
1758 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001759 false /* is_load */, true /* is64bit */);
1760 }
1761 return;
1762 }
1763
1764 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1765 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08001766 DCHECK(!IsFpReg(rl_result.reg));
Mark Mendelle02d48f2014-01-15 11:19:23 -08001767
1768 if (!IsNoOp(op, val_lo)) {
1769 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001770 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001771 }
1772 if (!IsNoOp(op, val_hi)) {
1773 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001774 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001775 }
1776 StoreValueWide(rl_dest, rl_result);
1777}
1778
1779void X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
1780 RegLocation rl_src2, Instruction::Code op) {
1781 DCHECK(rl_src2.is_const);
1782 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
1783 int32_t val_lo = Low32Bits(val);
1784 int32_t val_hi = High32Bits(val);
1785 rl_dest = UpdateLocWide(rl_dest);
1786 rl_src1 = UpdateLocWide(rl_src1);
1787
1788 // Can we do this directly into the destination registers?
1789 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08001790 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
1791 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() &&
1792 !IsFpReg(rl_dest.reg)) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001793 if (!IsNoOp(op, val_lo)) {
1794 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001795 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001796 }
1797 if (!IsNoOp(op, val_hi)) {
1798 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001799 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001800 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07001801
1802 StoreFinalValueWide(rl_dest, rl_dest);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001803 return;
1804 }
1805
1806 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1807 DCHECK_EQ(rl_src1.location, kLocPhysReg);
1808
1809 // We need the values to be in a temporary
1810 RegLocation rl_result = ForceTempWide(rl_src1);
1811 if (!IsNoOp(op, val_lo)) {
1812 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001813 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001814 }
1815 if (!IsNoOp(op, val_hi)) {
1816 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001817 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001818 }
1819
1820 StoreFinalValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001821}
1822
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001823// For final classes there are no sub-classes to check and so we can answer the instance-of
1824// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
1825void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
1826 RegLocation rl_dest, RegLocation rl_src) {
1827 RegLocation object = LoadValue(rl_src, kCoreReg);
1828 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001829 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001830
1831 // SETcc only works with EAX..EDX.
buzbee2700f7e2014-03-07 09:46:20 -08001832 if (result_reg == object.reg || result_reg.GetReg() >= 4) {
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001833 result_reg = AllocTypedTemp(false, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -08001834 DCHECK_LT(result_reg.GetReg(), 4);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001835 }
1836
1837 // Assume that there is no match.
1838 LoadConstant(result_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -08001839 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, NULL);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001840
buzbee2700f7e2014-03-07 09:46:20 -08001841 RegStorage check_class = AllocTypedTemp(false, kCoreReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001842
1843 // If Method* is already in a register, we can save a copy.
1844 RegLocation rl_method = mir_graph_->GetMethodLoc();
1845 int32_t offset_of_type = mirror::Array::DataOffset(sizeof(mirror::Class*)).Int32Value() +
1846 (sizeof(mirror::Class*) * type_idx);
1847
1848 if (rl_method.location == kLocPhysReg) {
1849 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07001850 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001851 check_class);
1852 } else {
buzbee695d13a2014-04-19 13:32:20 -07001853 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001854 check_class);
buzbee695d13a2014-04-19 13:32:20 -07001855 LoadRefDisp(check_class, offset_of_type, check_class);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001856 }
1857 } else {
1858 LoadCurrMethodDirect(check_class);
1859 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07001860 LoadRefDisp(check_class, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001861 check_class);
1862 } else {
buzbee695d13a2014-04-19 13:32:20 -07001863 LoadRefDisp(check_class, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001864 check_class);
buzbee695d13a2014-04-19 13:32:20 -07001865 LoadRefDisp(check_class, offset_of_type, check_class);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001866 }
1867 }
1868
1869 // Compare the computed class to the class in the object.
1870 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08001871 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001872
1873 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08001874 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001875
1876 LIR* target = NewLIR0(kPseudoTargetLabel);
1877 null_branchover->target = target;
1878 FreeTemp(check_class);
1879 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08001880 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001881 FreeTemp(result_reg);
1882 }
1883 StoreValue(rl_dest, rl_result);
1884}
1885
Mark Mendell6607d972014-02-10 06:54:18 -08001886void X86Mir2Lir::GenInstanceofCallingHelper(bool needs_access_check, bool type_known_final,
1887 bool type_known_abstract, bool use_declaring_class,
1888 bool can_assume_type_is_in_dex_cache,
1889 uint32_t type_idx, RegLocation rl_dest,
1890 RegLocation rl_src) {
1891 FlushAllRegs();
1892 // May generate a call - use explicit registers.
1893 LockCallTemps();
1894 LoadCurrMethodDirect(TargetReg(kArg1)); // kArg1 gets current Method*.
buzbee2700f7e2014-03-07 09:46:20 -08001895 RegStorage class_reg = TargetReg(kArg2); // kArg2 will hold the Class*.
Mark Mendell6607d972014-02-10 06:54:18 -08001896 // Reference must end up in kArg0.
1897 if (needs_access_check) {
1898 // Check we have access to type_idx and if not throw IllegalAccessError,
1899 // Caller function returns Class* in kArg0.
Ian Rogersdd7624d2014-03-14 17:43:00 -07001900 CallRuntimeHelperImm(QUICK_ENTRYPOINT_OFFSET(4, pInitializeTypeAndVerifyAccess),
Mark Mendell6607d972014-02-10 06:54:18 -08001901 type_idx, true);
1902 OpRegCopy(class_reg, TargetReg(kRet0));
1903 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
1904 } else if (use_declaring_class) {
1905 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
buzbee695d13a2014-04-19 13:32:20 -07001906 LoadRefDisp(TargetReg(kArg1), mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
buzbee2700f7e2014-03-07 09:46:20 -08001907 class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001908 } else {
1909 // Load dex cache entry into class_reg (kArg2).
1910 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
buzbee695d13a2014-04-19 13:32:20 -07001911 LoadRefDisp(TargetReg(kArg1), mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
buzbee2700f7e2014-03-07 09:46:20 -08001912 class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001913 int32_t offset_of_type =
1914 mirror::Array::DataOffset(sizeof(mirror::Class*)).Int32Value() + (sizeof(mirror::Class*)
1915 * type_idx);
buzbee695d13a2014-04-19 13:32:20 -07001916 LoadRefDisp(class_reg, offset_of_type, class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001917 if (!can_assume_type_is_in_dex_cache) {
1918 // Need to test presence of type in dex cache at runtime.
1919 LIR* hop_branch = OpCmpImmBranch(kCondNe, class_reg, 0, NULL);
1920 // Type is not resolved. Call out to helper, which will return resolved type in kRet0/kArg0.
Ian Rogersdd7624d2014-03-14 17:43:00 -07001921 CallRuntimeHelperImm(QUICK_ENTRYPOINT_OFFSET(4, pInitializeType), type_idx, true);
Mark Mendell6607d972014-02-10 06:54:18 -08001922 OpRegCopy(TargetReg(kArg2), TargetReg(kRet0)); // Align usage with fast path.
1923 LoadValueDirectFixed(rl_src, TargetReg(kArg0)); /* Reload Ref. */
1924 // Rejoin code paths
1925 LIR* hop_target = NewLIR0(kPseudoTargetLabel);
1926 hop_branch->target = hop_target;
1927 }
1928 }
1929 /* kArg0 is ref, kArg2 is class. If ref==null, use directly as bool result. */
1930 RegLocation rl_result = GetReturn(false);
1931
1932 // SETcc only works with EAX..EDX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001933 DCHECK_LT(rl_result.reg.GetReg(), 4);
Mark Mendell6607d972014-02-10 06:54:18 -08001934
1935 // Is the class NULL?
1936 LIR* branch1 = OpCmpImmBranch(kCondEq, TargetReg(kArg0), 0, NULL);
1937
1938 /* Load object->klass_. */
1939 DCHECK_EQ(mirror::Object::ClassOffset().Int32Value(), 0);
buzbee695d13a2014-04-19 13:32:20 -07001940 LoadRefDisp(TargetReg(kArg0), mirror::Object::ClassOffset().Int32Value(), TargetReg(kArg1));
Mark Mendell6607d972014-02-10 06:54:18 -08001941 /* kArg0 is ref, kArg1 is ref->klass_, kArg2 is class. */
1942 LIR* branchover = nullptr;
1943 if (type_known_final) {
1944 // Ensure top 3 bytes of result are 0.
buzbee2700f7e2014-03-07 09:46:20 -08001945 LoadConstant(rl_result.reg, 0);
Mark Mendell6607d972014-02-10 06:54:18 -08001946 OpRegReg(kOpCmp, TargetReg(kArg1), TargetReg(kArg2));
1947 // Set the low byte of the result to 0 or 1 from the compare condition code.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001948 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondEq);
Mark Mendell6607d972014-02-10 06:54:18 -08001949 } else {
1950 if (!type_known_abstract) {
buzbee2700f7e2014-03-07 09:46:20 -08001951 LoadConstant(rl_result.reg, 1); // Assume result succeeds.
Mark Mendell6607d972014-02-10 06:54:18 -08001952 branchover = OpCmpBranch(kCondEq, TargetReg(kArg1), TargetReg(kArg2), NULL);
1953 }
1954 OpRegCopy(TargetReg(kArg0), TargetReg(kArg2));
Ian Rogersdd7624d2014-03-14 17:43:00 -07001955 OpThreadMem(kOpBlx, QUICK_ENTRYPOINT_OFFSET(4, pInstanceofNonTrivial));
Mark Mendell6607d972014-02-10 06:54:18 -08001956 }
1957 // TODO: only clobber when type isn't final?
1958 ClobberCallerSave();
1959 /* Branch targets here. */
1960 LIR* target = NewLIR0(kPseudoTargetLabel);
1961 StoreValue(rl_dest, rl_result);
1962 branch1->target = target;
1963 if (branchover != nullptr) {
1964 branchover->target = target;
1965 }
1966}
1967
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08001968void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
1969 RegLocation rl_lhs, RegLocation rl_rhs) {
1970 OpKind op = kOpBkpt;
1971 bool is_div_rem = false;
1972 bool unary = false;
1973 bool shift_op = false;
1974 bool is_two_addr = false;
1975 RegLocation rl_result;
1976 switch (opcode) {
1977 case Instruction::NEG_INT:
1978 op = kOpNeg;
1979 unary = true;
1980 break;
1981 case Instruction::NOT_INT:
1982 op = kOpMvn;
1983 unary = true;
1984 break;
1985 case Instruction::ADD_INT_2ADDR:
1986 is_two_addr = true;
1987 // Fallthrough
1988 case Instruction::ADD_INT:
1989 op = kOpAdd;
1990 break;
1991 case Instruction::SUB_INT_2ADDR:
1992 is_two_addr = true;
1993 // Fallthrough
1994 case Instruction::SUB_INT:
1995 op = kOpSub;
1996 break;
1997 case Instruction::MUL_INT_2ADDR:
1998 is_two_addr = true;
1999 // Fallthrough
2000 case Instruction::MUL_INT:
2001 op = kOpMul;
2002 break;
2003 case Instruction::DIV_INT_2ADDR:
2004 is_two_addr = true;
2005 // Fallthrough
2006 case Instruction::DIV_INT:
2007 op = kOpDiv;
2008 is_div_rem = true;
2009 break;
2010 /* NOTE: returns in kArg1 */
2011 case Instruction::REM_INT_2ADDR:
2012 is_two_addr = true;
2013 // Fallthrough
2014 case Instruction::REM_INT:
2015 op = kOpRem;
2016 is_div_rem = true;
2017 break;
2018 case Instruction::AND_INT_2ADDR:
2019 is_two_addr = true;
2020 // Fallthrough
2021 case Instruction::AND_INT:
2022 op = kOpAnd;
2023 break;
2024 case Instruction::OR_INT_2ADDR:
2025 is_two_addr = true;
2026 // Fallthrough
2027 case Instruction::OR_INT:
2028 op = kOpOr;
2029 break;
2030 case Instruction::XOR_INT_2ADDR:
2031 is_two_addr = true;
2032 // Fallthrough
2033 case Instruction::XOR_INT:
2034 op = kOpXor;
2035 break;
2036 case Instruction::SHL_INT_2ADDR:
2037 is_two_addr = true;
2038 // Fallthrough
2039 case Instruction::SHL_INT:
2040 shift_op = true;
2041 op = kOpLsl;
2042 break;
2043 case Instruction::SHR_INT_2ADDR:
2044 is_two_addr = true;
2045 // Fallthrough
2046 case Instruction::SHR_INT:
2047 shift_op = true;
2048 op = kOpAsr;
2049 break;
2050 case Instruction::USHR_INT_2ADDR:
2051 is_two_addr = true;
2052 // Fallthrough
2053 case Instruction::USHR_INT:
2054 shift_op = true;
2055 op = kOpLsr;
2056 break;
2057 default:
2058 LOG(FATAL) << "Invalid word arith op: " << opcode;
2059 }
2060
2061 // Can we convert to a two address instruction?
2062 if (!is_two_addr &&
2063 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
2064 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
2065 is_two_addr = true;
2066 }
2067
2068 // Get the div/rem stuff out of the way.
2069 if (is_div_rem) {
2070 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, true);
2071 StoreValue(rl_dest, rl_result);
2072 return;
2073 }
2074
2075 if (unary) {
2076 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2077 rl_result = UpdateLoc(rl_dest);
2078 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002079 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002080 } else {
2081 if (shift_op) {
2082 // X86 doesn't require masking and must use ECX.
buzbee2700f7e2014-03-07 09:46:20 -08002083 RegStorage t_reg = TargetReg(kCount); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002084 LoadValueDirectFixed(rl_rhs, t_reg);
2085 if (is_two_addr) {
2086 // Can we do this directly into memory?
2087 rl_result = UpdateLoc(rl_dest);
2088 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2089 if (rl_result.location != kLocPhysReg) {
2090 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08002091 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002092 FreeTemp(t_reg);
2093 return;
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002094 } else if (!IsFpReg(rl_result.reg.GetReg())) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002095 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08002096 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002097 FreeTemp(t_reg);
2098 StoreFinalValue(rl_dest, rl_result);
2099 return;
2100 }
2101 }
2102 // Three address form, or we can't do directly.
2103 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2104 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002105 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002106 FreeTemp(t_reg);
2107 } else {
2108 // Multiply is 3 operand only (sort of).
2109 if (is_two_addr && op != kOpMul) {
2110 // Can we do this directly into memory?
2111 rl_result = UpdateLoc(rl_dest);
2112 if (rl_result.location == kLocPhysReg) {
Serguei Katkov366f8ae2014-04-15 16:55:26 +07002113 // Ensure res is in a core reg
2114 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002115 // Can we do this from memory directly?
2116 rl_rhs = UpdateLoc(rl_rhs);
2117 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08002118 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002119 StoreFinalValue(rl_dest, rl_result);
2120 return;
buzbee2700f7e2014-03-07 09:46:20 -08002121 } else if (!IsFpReg(rl_rhs.reg)) {
2122 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002123 StoreFinalValue(rl_dest, rl_result);
2124 return;
2125 }
2126 }
2127 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2128 if (rl_result.location != kLocPhysReg) {
2129 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002130 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002131 return;
buzbee2700f7e2014-03-07 09:46:20 -08002132 } else if (!IsFpReg(rl_result.reg)) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002133 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08002134 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002135 StoreFinalValue(rl_dest, rl_result);
2136 return;
2137 } else {
2138 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2139 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002140 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002141 }
2142 } else {
2143 // Try to use reg/memory instructions.
2144 rl_lhs = UpdateLoc(rl_lhs);
2145 rl_rhs = UpdateLoc(rl_rhs);
2146 // We can't optimize with FP registers.
2147 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
2148 // Something is difficult, so fall back to the standard case.
2149 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2150 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2151 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002152 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002153 } else {
2154 // We can optimize by moving to result and using memory operands.
2155 if (rl_rhs.location != kLocPhysReg) {
2156 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07002157 // We should be careful with order here
2158 // If rl_dest and rl_lhs points to the same VR we should load first
2159 // If the are different we should find a register first for dest
2160 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) == mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
2161 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2162 rl_result = EvalLoc(rl_dest, kCoreReg, true);
2163 } else {
2164 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002165 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07002166 }
buzbee2700f7e2014-03-07 09:46:20 -08002167 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002168 } else if (rl_lhs.location != kLocPhysReg) {
2169 // RHS is in a register; LHS is in memory.
2170 if (op != kOpSub) {
2171 // Force RHS into result and operate on memory.
2172 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002173 OpRegCopy(rl_result.reg, rl_rhs.reg);
2174 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002175 } else {
2176 // Subtraction isn't commutative.
2177 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2178 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2179 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002180 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002181 }
2182 } else {
2183 // Both are in registers.
2184 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2185 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2186 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002187 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002188 }
2189 }
2190 }
2191 }
2192 }
2193 StoreValue(rl_dest, rl_result);
2194}
2195
2196bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
2197 // If we have non-core registers, then we can't do good things.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002198 if (rl_lhs.location == kLocPhysReg && IsFpReg(rl_lhs.reg.GetReg())) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002199 return false;
2200 }
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002201 if (rl_rhs.location == kLocPhysReg && IsFpReg(rl_rhs.reg.GetReg())) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002202 return false;
2203 }
2204
2205 // Everything will be fine :-).
2206 return true;
2207}
Brian Carlstrom7940e442013-07-12 13:46:57 -07002208} // namespace art