blob: 5a5b4c3ad7d04fac478ce4e9136a8d330762e6b7 [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
buzbee091cc402014-03-31 10:14:40 -070036 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
37 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -080038 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
buzbee091cc402014-03-31 10:14:40 -070043 NewLIR2(kX86Set8R, rs_r2.GetReg(), kX86CondL); // r2 = (r1:r0) < (r3:r2) ? 1 : 0
44 NewLIR2(kX86Movzx8RR, rs_r2.GetReg(), rs_r2.GetReg());
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
buzbee091cc402014-03-31 10:14:40 -070047 NewLIR2(kX86Set8R, rs_r0.GetReg(), kX86CondNz); // r0 = (r1:r0) != (r3:r2) ? 1 : 0
Brian Carlstrom7940e442013-07-12 13:46:57 -070048 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 }
buzbee091cc402014-03-31 10:14:40 -0700109 if (r_dest.IsFloat() || r_src.IsFloat())
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) {
buzbee091cc402014-03-31 10:14:40 -0700128 bool dest_fp = r_dest.IsFloat();
129 bool src_fp = r_src.IsFloat();
buzbee7a11ab02014-04-28 20:02:38 -0700130 if (dest_fp) {
131 if (src_fp) {
buzbee091cc402014-03-31 10:14:40 -0700132 OpRegCopy(r_dest, r_src);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700133 } else {
buzbee7a11ab02014-04-28 20:02:38 -0700134 // TODO: Prevent this from happening in the code. The result is often
135 // unused or could have been loaded more easily from memory.
buzbee091cc402014-03-31 10:14:40 -0700136 NewLIR2(kX86MovdxrRR, r_dest.GetReg(), r_src.GetLowReg());
buzbee7a11ab02014-04-28 20:02:38 -0700137 RegStorage r_tmp = AllocTempDouble();
buzbee091cc402014-03-31 10:14:40 -0700138 NewLIR2(kX86MovdxrRR, r_tmp.GetReg(), r_src.GetHighReg());
139 NewLIR2(kX86PunpckldqRR, r_dest.GetReg(), r_tmp.GetReg());
buzbee7a11ab02014-04-28 20:02:38 -0700140 FreeTemp(r_tmp);
141 }
142 } else {
143 if (src_fp) {
buzbee091cc402014-03-31 10:14:40 -0700144 NewLIR2(kX86MovdrxRR, r_dest.GetLowReg(), r_src.GetReg());
145 NewLIR2(kX86PsrlqRI, r_src.GetReg(), 32);
146 NewLIR2(kX86MovdrxRR, r_dest.GetHighReg(), r_src.GetReg());
buzbee7a11ab02014-04-28 20:02:38 -0700147 } else {
buzbee091cc402014-03-31 10:14:40 -0700148 DCHECK(r_dest.IsPair());
149 DCHECK(r_src.IsPair());
buzbee7a11ab02014-04-28 20:02:38 -0700150 // Handle overlap
151 if (r_src.GetHighReg() == r_dest.GetLowReg() && r_src.GetLowReg() == r_dest.GetHighReg()) {
152 // Deal with cycles.
153 RegStorage temp_reg = AllocTemp();
154 OpRegCopy(temp_reg, r_dest.GetHigh());
155 OpRegCopy(r_dest.GetHigh(), r_dest.GetLow());
156 OpRegCopy(r_dest.GetLow(), temp_reg);
157 FreeTemp(temp_reg);
158 } else if (r_src.GetHighReg() == r_dest.GetLowReg()) {
159 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
160 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
161 } else {
162 OpRegCopy(r_dest.GetLow(), r_src.GetLow());
163 OpRegCopy(r_dest.GetHigh(), r_src.GetHigh());
164 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700165 }
166 }
167 }
168}
169
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700170void X86Mir2Lir::GenSelect(BasicBlock* bb, MIR* mir) {
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800171 RegLocation rl_result;
172 RegLocation rl_src = mir_graph_->GetSrc(mir, 0);
173 RegLocation rl_dest = mir_graph_->GetDest(mir);
174 rl_src = LoadValue(rl_src, kCoreReg);
Vladimir Markoa1a70742014-03-03 10:28:05 +0000175 ConditionCode ccode = mir->meta.ccode;
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800176
177 // The kMirOpSelect has two variants, one for constants and one for moves.
178 const bool is_constant_case = (mir->ssa_rep->num_uses == 1);
179
180 if (is_constant_case) {
181 int true_val = mir->dalvikInsn.vB;
182 int false_val = mir->dalvikInsn.vC;
183 rl_result = EvalLoc(rl_dest, kCoreReg, true);
184
185 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000186 * For ccode == kCondEq:
187 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800188 * 1) When the true case is zero and result_reg is not same as src_reg:
189 * xor result_reg, result_reg
190 * cmp $0, src_reg
191 * mov t1, $false_case
192 * cmovnz result_reg, t1
193 * 2) When the false case is zero and result_reg is not same as src_reg:
194 * xor result_reg, result_reg
195 * cmp $0, src_reg
196 * mov t1, $true_case
197 * cmovz result_reg, t1
198 * 3) All other cases (we do compare first to set eflags):
199 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000200 * mov result_reg, $false_case
201 * mov t1, $true_case
202 * cmovz result_reg, t1
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800203 */
buzbee2700f7e2014-03-07 09:46:20 -0800204 const bool result_reg_same_as_src =
205 (rl_src.location == kLocPhysReg && rl_src.reg.GetReg() == rl_result.reg.GetReg());
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800206 const bool true_zero_case = (true_val == 0 && false_val != 0 && !result_reg_same_as_src);
207 const bool false_zero_case = (false_val == 0 && true_val != 0 && !result_reg_same_as_src);
208 const bool catch_all_case = !(true_zero_case || false_zero_case);
209
210 if (true_zero_case || false_zero_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800211 OpRegReg(kOpXor, rl_result.reg, rl_result.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800212 }
213
214 if (true_zero_case || false_zero_case || catch_all_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800215 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800216 }
217
218 if (catch_all_case) {
buzbee2700f7e2014-03-07 09:46:20 -0800219 OpRegImm(kOpMov, rl_result.reg, false_val);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800220 }
221
222 if (true_zero_case || false_zero_case || catch_all_case) {
Vladimir Markoa1a70742014-03-03 10:28:05 +0000223 ConditionCode cc = true_zero_case ? NegateComparison(ccode) : ccode;
224 int immediateForTemp = true_zero_case ? false_val : true_val;
buzbee2700f7e2014-03-07 09:46:20 -0800225 RegStorage temp1_reg = AllocTemp();
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800226 OpRegImm(kOpMov, temp1_reg, immediateForTemp);
227
buzbee2700f7e2014-03-07 09:46:20 -0800228 OpCondRegReg(kOpCmov, cc, rl_result.reg, temp1_reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800229
230 FreeTemp(temp1_reg);
231 }
232 } else {
233 RegLocation rl_true = mir_graph_->GetSrc(mir, 1);
234 RegLocation rl_false = mir_graph_->GetSrc(mir, 2);
235 rl_true = LoadValue(rl_true, kCoreReg);
236 rl_false = LoadValue(rl_false, kCoreReg);
237 rl_result = EvalLoc(rl_dest, kCoreReg, true);
238
239 /*
Vladimir Markoa1a70742014-03-03 10:28:05 +0000240 * For ccode == kCondEq:
241 *
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800242 * 1) When true case is already in place:
243 * cmp $0, src_reg
244 * cmovnz result_reg, false_reg
245 * 2) When false case is already in place:
246 * cmp $0, src_reg
247 * cmovz result_reg, true_reg
248 * 3) When neither cases are in place:
249 * cmp $0, src_reg
Vladimir Markoa1a70742014-03-03 10:28:05 +0000250 * mov result_reg, false_reg
251 * cmovz result_reg, true_reg
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800252 */
253
254 // kMirOpSelect is generated just for conditional cases when comparison is done with zero.
buzbee2700f7e2014-03-07 09:46:20 -0800255 OpRegImm(kOpCmp, rl_src.reg, 0);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800256
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000257 if (rl_result.reg.GetReg() == rl_true.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800258 OpCondRegReg(kOpCmov, NegateComparison(ccode), rl_result.reg, rl_false.reg);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000259 } else if (rl_result.reg.GetReg() == rl_false.reg.GetReg()) {
buzbee2700f7e2014-03-07 09:46:20 -0800260 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800261 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800262 OpRegCopy(rl_result.reg, rl_false.reg);
263 OpCondRegReg(kOpCmov, ccode, rl_result.reg, rl_true.reg);
Razvan A Lupusorue27b3bf2014-01-23 09:41:45 -0800264 }
265 }
266
267 StoreValue(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700268}
269
270void X86Mir2Lir::GenFusedLongCmpBranch(BasicBlock* bb, MIR* mir) {
buzbee0d829482013-10-11 15:24:55 -0700271 LIR* taken = &block_label_list_[bb->taken];
Brian Carlstrom7940e442013-07-12 13:46:57 -0700272 RegLocation rl_src1 = mir_graph_->GetSrcWide(mir, 0);
273 RegLocation rl_src2 = mir_graph_->GetSrcWide(mir, 2);
Vladimir Markoa8946072014-01-22 10:30:44 +0000274 ConditionCode ccode = mir->meta.ccode;
Mark Mendell412d4f82013-12-18 13:32:36 -0800275
276 if (rl_src1.is_const) {
277 std::swap(rl_src1, rl_src2);
278 ccode = FlipComparisonOrder(ccode);
279 }
280 if (rl_src2.is_const) {
281 // Do special compare/branch against simple const operand
282 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
283 GenFusedLongCmpImmBranch(bb, rl_src1, val, ccode);
284 return;
285 }
286
Brian Carlstrom7940e442013-07-12 13:46:57 -0700287 FlushAllRegs();
288 LockCallTemps(); // Prepare for explicit register usage
buzbee091cc402014-03-31 10:14:40 -0700289 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_r0, rs_r1);
290 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_r2, rs_r3);
buzbee2700f7e2014-03-07 09:46:20 -0800291 LoadValueDirectWideFixed(rl_src1, r_tmp1);
292 LoadValueDirectWideFixed(rl_src2, r_tmp2);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700293 // Swap operands and condition code to prevent use of zero flag.
294 if (ccode == kCondLe || ccode == kCondGt) {
295 // Compute (r3:r2) = (r3:r2) - (r1:r0)
buzbee2700f7e2014-03-07 09:46:20 -0800296 OpRegReg(kOpSub, rs_r2, rs_r0); // r2 = r2 - r0
297 OpRegReg(kOpSbc, rs_r3, rs_r1); // r3 = r3 - r1 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700298 } else {
299 // Compute (r1:r0) = (r1:r0) - (r3:r2)
buzbee2700f7e2014-03-07 09:46:20 -0800300 OpRegReg(kOpSub, rs_r0, rs_r2); // r0 = r0 - r2
301 OpRegReg(kOpSbc, rs_r1, rs_r3); // r1 = r1 - r3 - CF
Brian Carlstrom7940e442013-07-12 13:46:57 -0700302 }
303 switch (ccode) {
304 case kCondEq:
305 case kCondNe:
buzbee2700f7e2014-03-07 09:46:20 -0800306 OpRegReg(kOpOr, rs_r0, rs_r1); // r0 = r0 | r1
Brian Carlstrom7940e442013-07-12 13:46:57 -0700307 break;
308 case kCondLe:
309 ccode = kCondGe;
310 break;
311 case kCondGt:
312 ccode = kCondLt;
313 break;
314 case kCondLt:
315 case kCondGe:
316 break;
317 default:
318 LOG(FATAL) << "Unexpected ccode: " << ccode;
319 }
320 OpCondBranch(ccode, taken);
321}
322
Mark Mendell412d4f82013-12-18 13:32:36 -0800323void X86Mir2Lir::GenFusedLongCmpImmBranch(BasicBlock* bb, RegLocation rl_src1,
324 int64_t val, ConditionCode ccode) {
325 int32_t val_lo = Low32Bits(val);
326 int32_t val_hi = High32Bits(val);
327 LIR* taken = &block_label_list_[bb->taken];
Mark Mendell412d4f82013-12-18 13:32:36 -0800328 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
Mark Mendell752e2052014-05-01 10:19:04 -0400329 bool is_equality_test = ccode == kCondEq || ccode == kCondNe;
330 if (is_equality_test && val != 0) {
331 rl_src1 = ForceTempWide(rl_src1);
332 }
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
Mark Mendell752e2052014-05-01 10:19:04 -0400336 if (is_equality_test) {
337 // We can simpolify of comparing for ==, != to 0.
338 if (val == 0) {
339 if (IsTemp(low_reg)) {
340 OpRegReg(kOpOr, low_reg, high_reg);
341 // We have now changed it; ignore the old values.
342 Clobber(rl_src1.reg);
343 } else {
344 RegStorage t_reg = AllocTemp();
345 OpRegRegReg(kOpOr, t_reg, low_reg, high_reg);
346 FreeTemp(t_reg);
347 }
348 OpCondBranch(ccode, taken);
349 return;
350 }
351
352 // Need to compute the actual value for ==, !=.
353 OpRegImm(kOpSub, low_reg, val_lo);
354 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
355 OpRegReg(kOpOr, high_reg, low_reg);
356 Clobber(rl_src1.reg);
357 } else if (ccode == kCondLe || ccode == kCondGt) {
358 // Swap operands and condition code to prevent use of zero flag.
359 RegStorage tmp = AllocTypedTempWide(false, kCoreReg);
360 LoadConstantWide(tmp, val);
361 OpRegReg(kOpSub, tmp.GetLow(), low_reg);
362 OpRegReg(kOpSbc, tmp.GetHigh(), high_reg);
363 ccode = (ccode == kCondLe) ? kCondGe : kCondLt;
364 FreeTemp(tmp);
365 } else {
366 // We can use a compare for the low word to set CF.
367 OpRegImm(kOpCmp, low_reg, val_lo);
368 if (IsTemp(high_reg)) {
369 NewLIR2(kX86Sbb32RI, high_reg.GetReg(), val_hi);
370 // We have now changed it; ignore the old values.
371 Clobber(rl_src1.reg);
372 } else {
373 // mov temp_reg, high_reg; sbb temp_reg, high_constant
374 RegStorage t_reg = AllocTemp();
375 OpRegCopy(t_reg, high_reg);
376 NewLIR2(kX86Sbb32RI, t_reg.GetReg(), val_hi);
377 FreeTemp(t_reg);
378 }
Mark Mendell412d4f82013-12-18 13:32:36 -0800379 }
380
Mark Mendell752e2052014-05-01 10:19:04 -0400381 OpCondBranch(ccode, taken);
Mark Mendell412d4f82013-12-18 13:32:36 -0800382}
383
Mark Mendell2bf31e62014-01-23 12:13:40 -0800384void X86Mir2Lir::CalculateMagicAndShift(int divisor, int& magic, int& shift) {
385 // It does not make sense to calculate magic and shift for zero divisor.
386 DCHECK_NE(divisor, 0);
387
388 /* According to H.S.Warren's Hacker's Delight Chapter 10 and
389 * T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
390 * The magic number M and shift S can be calculated in the following way:
391 * Let nc be the most positive value of numerator(n) such that nc = kd - 1,
392 * where divisor(d) >=2.
393 * Let nc be the most negative value of numerator(n) such that nc = kd + 1,
394 * where divisor(d) <= -2.
395 * Thus nc can be calculated like:
396 * nc = 2^31 + 2^31 % d - 1, where d >= 2
397 * nc = -2^31 + (2^31 + 1) % d, where d >= 2.
398 *
399 * So the shift p is the smallest p satisfying
400 * 2^p > nc * (d - 2^p % d), where d >= 2
401 * 2^p > nc * (d + 2^p % d), where d <= -2.
402 *
403 * the magic number M is calcuated by
404 * M = (2^p + d - 2^p % d) / d, where d >= 2
405 * M = (2^p - d - 2^p % d) / d, where d <= -2.
406 *
407 * Notice that p is always bigger than or equal to 32, so we just return 32-p as
408 * the shift number S.
409 */
410
411 int32_t p = 31;
412 const uint32_t two31 = 0x80000000U;
413
414 // Initialize the computations.
415 uint32_t abs_d = (divisor >= 0) ? divisor : -divisor;
416 uint32_t tmp = two31 + (static_cast<uint32_t>(divisor) >> 31);
417 uint32_t abs_nc = tmp - 1 - tmp % abs_d;
418 uint32_t quotient1 = two31 / abs_nc;
419 uint32_t remainder1 = two31 % abs_nc;
420 uint32_t quotient2 = two31 / abs_d;
421 uint32_t remainder2 = two31 % abs_d;
422
423 /*
424 * To avoid handling both positive and negative divisor, Hacker's Delight
425 * introduces a method to handle these 2 cases together to avoid duplication.
426 */
427 uint32_t delta;
428 do {
429 p++;
430 quotient1 = 2 * quotient1;
431 remainder1 = 2 * remainder1;
432 if (remainder1 >= abs_nc) {
433 quotient1++;
434 remainder1 = remainder1 - abs_nc;
435 }
436 quotient2 = 2 * quotient2;
437 remainder2 = 2 * remainder2;
438 if (remainder2 >= abs_d) {
439 quotient2++;
440 remainder2 = remainder2 - abs_d;
441 }
442 delta = abs_d - remainder2;
443 } while (quotient1 < delta || (quotient1 == delta && remainder1 == 0));
444
445 magic = (divisor > 0) ? (quotient2 + 1) : (-quotient2 - 1);
446 shift = p - 32;
447}
448
buzbee2700f7e2014-03-07 09:46:20 -0800449RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegStorage reg_lo, int lit, bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700450 LOG(FATAL) << "Unexpected use of GenDivRemLit for x86";
451 return rl_dest;
452}
453
Mark Mendell2bf31e62014-01-23 12:13:40 -0800454RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegLocation rl_src,
455 int imm, bool is_div) {
456 // Use a multiply (and fixup) to perform an int div/rem by a constant.
457
458 // We have to use fixed registers, so flush all the temps.
459 FlushAllRegs();
460 LockCallTemps(); // Prepare for explicit register usage.
461
462 // Assume that the result will be in EDX.
buzbee091cc402014-03-31 10:14:40 -0700463 RegLocation rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, rs_r2, INVALID_SREG, INVALID_SREG};
Mark Mendell2bf31e62014-01-23 12:13:40 -0800464
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700465 // handle div/rem by 1 special case.
466 if (imm == 1) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800467 if (is_div) {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700468 // x / 1 == x.
469 StoreValue(rl_result, rl_src);
470 } else {
471 // x % 1 == 0.
buzbee2700f7e2014-03-07 09:46:20 -0800472 LoadConstantNoClobber(rs_r0, 0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700473 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000474 rl_result.reg.SetReg(r0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700475 }
476 } else if (imm == -1) { // handle 0x80000000 / -1 special case.
477 if (is_div) {
478 LIR *minint_branch = 0;
buzbee2700f7e2014-03-07 09:46:20 -0800479 LoadValueDirectFixed(rl_src, rs_r0);
480 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800481 minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
482
483 // for x != MIN_INT, x / -1 == -x.
484 NewLIR1(kX86Neg32R, r0);
485
486 LIR* branch_around = NewLIR1(kX86Jmp8, 0);
487 // The target for cmp/jmp above.
488 minint_branch->target = NewLIR0(kPseudoTargetLabel);
489 // EAX already contains the right value (0x80000000),
490 branch_around->target = NewLIR0(kPseudoTargetLabel);
491 } else {
492 // x % -1 == 0.
buzbee2700f7e2014-03-07 09:46:20 -0800493 LoadConstantNoClobber(rs_r0, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800494 }
495 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000496 rl_result.reg.SetReg(r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800497 } else {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700498 CHECK(imm <= -2 || imm >= 2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800499 // Use H.S.Warren's Hacker's Delight Chapter 10 and
500 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
501 int magic, shift;
502 CalculateMagicAndShift(imm, magic, shift);
503
504 /*
505 * For imm >= 2,
506 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
507 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
508 * For imm <= -2,
509 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
510 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
511 * We implement this algorithm in the following way:
512 * 1. multiply magic number m and numerator n, get the higher 32bit result in EDX
513 * 2. if imm > 0 and magic < 0, add numerator to EDX
514 * if imm < 0 and magic > 0, sub numerator from EDX
515 * 3. if S !=0, SAR S bits for EDX
516 * 4. add 1 to EDX if EDX < 0
517 * 5. Thus, EDX is the quotient
518 */
519
520 // Numerator into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800521 RegStorage numerator_reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800522 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
523 // We will need the value later.
524 if (rl_src.location == kLocPhysReg) {
525 // We can use it directly.
buzbee091cc402014-03-31 10:14:40 -0700526 DCHECK(rl_src.reg.GetReg() != rs_r0.GetReg() && rl_src.reg.GetReg() != rs_r2.GetReg());
buzbee2700f7e2014-03-07 09:46:20 -0800527 numerator_reg = rl_src.reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800528 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800529 numerator_reg = rs_r1;
530 LoadValueDirectFixed(rl_src, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800531 }
buzbee2700f7e2014-03-07 09:46:20 -0800532 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800533 } else {
534 // Only need this once. Just put it into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800535 LoadValueDirectFixed(rl_src, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800536 }
537
538 // EDX = magic.
buzbee2700f7e2014-03-07 09:46:20 -0800539 LoadConstantNoClobber(rs_r2, magic);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800540
541 // EDX:EAX = magic & dividend.
buzbee091cc402014-03-31 10:14:40 -0700542 NewLIR1(kX86Imul32DaR, rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800543
544 if (imm > 0 && magic < 0) {
545 // Add numerator to EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800546 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700547 NewLIR2(kX86Add32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800548 } else if (imm < 0 && magic > 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800549 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700550 NewLIR2(kX86Sub32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800551 }
552
553 // Do we need the shift?
554 if (shift != 0) {
555 // Shift EDX by 'shift' bits.
buzbee091cc402014-03-31 10:14:40 -0700556 NewLIR2(kX86Sar32RI, rs_r2.GetReg(), shift);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800557 }
558
559 // Add 1 to EDX if EDX < 0.
560
561 // Move EDX to EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800562 OpRegCopy(rs_r0, rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800563
564 // Move sign bit to bit 0, zeroing the rest.
buzbee091cc402014-03-31 10:14:40 -0700565 NewLIR2(kX86Shr32RI, rs_r2.GetReg(), 31);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800566
567 // EDX = EDX + EAX.
buzbee091cc402014-03-31 10:14:40 -0700568 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r0.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800569
570 // Quotient is in EDX.
571 if (!is_div) {
572 // We need to compute the remainder.
573 // Remainder is divisor - (quotient * imm).
buzbee2700f7e2014-03-07 09:46:20 -0800574 DCHECK(numerator_reg.Valid());
575 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800576
577 // EAX = numerator * imm.
buzbee2700f7e2014-03-07 09:46:20 -0800578 OpRegRegImm(kOpMul, rs_r2, rs_r2, imm);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800579
580 // EDX -= EAX.
buzbee091cc402014-03-31 10:14:40 -0700581 NewLIR2(kX86Sub32RR, rs_r0.GetReg(), rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800582
583 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000584 rl_result.reg.SetReg(r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800585 }
586 }
587
588 return rl_result;
589}
590
buzbee2700f7e2014-03-07 09:46:20 -0800591RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegStorage reg_lo, RegStorage reg_hi,
592 bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700593 LOG(FATAL) << "Unexpected use of GenDivRem for x86";
594 return rl_dest;
595}
596
Mark Mendell2bf31e62014-01-23 12:13:40 -0800597RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegLocation rl_src1,
598 RegLocation rl_src2, bool is_div, bool check_zero) {
599 // We have to use fixed registers, so flush all the temps.
600 FlushAllRegs();
601 LockCallTemps(); // Prepare for explicit register usage.
602
603 // Load LHS into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800604 LoadValueDirectFixed(rl_src1, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800605
606 // Load RHS into EBX.
buzbee2700f7e2014-03-07 09:46:20 -0800607 LoadValueDirectFixed(rl_src2, rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800608
609 // Copy LHS sign bit into EDX.
610 NewLIR0(kx86Cdq32Da);
611
612 if (check_zero) {
613 // Handle division by zero case.
Mingyao Yange643a172014-04-08 11:02:52 -0700614 GenDivZeroCheck(rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800615 }
616
617 // Have to catch 0x80000000/-1 case, or we will get an exception!
buzbee2700f7e2014-03-07 09:46:20 -0800618 OpRegImm(kOpCmp, rs_r1, -1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800619 LIR *minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
620
621 // RHS is -1.
buzbee2700f7e2014-03-07 09:46:20 -0800622 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800623 LIR * minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
624
625 // In 0x80000000/-1 case.
626 if (!is_div) {
627 // For DIV, EAX is already right. For REM, we need EDX 0.
buzbee2700f7e2014-03-07 09:46:20 -0800628 LoadConstantNoClobber(rs_r2, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800629 }
630 LIR* done = NewLIR1(kX86Jmp8, 0);
631
632 // Expected case.
633 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
634 minint_branch->target = minus_one_branch->target;
buzbee091cc402014-03-31 10:14:40 -0700635 NewLIR1(kX86Idivmod32DaR, rs_r1.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800636 done->target = NewLIR0(kPseudoTargetLabel);
637
638 // Result is in EAX for div and EDX for rem.
buzbee091cc402014-03-31 10:14:40 -0700639 RegLocation rl_result = {kLocPhysReg, 0, 0, 0, 0, 0, 0, 0, 1, rs_r0, INVALID_SREG, INVALID_SREG};
Mark Mendell2bf31e62014-01-23 12:13:40 -0800640 if (!is_div) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000641 rl_result.reg.SetReg(r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800642 }
643 return rl_result;
644}
645
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700646bool X86Mir2Lir::GenInlinedMinMaxInt(CallInfo* info, bool is_min) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700647 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800648
649 // Get the two arguments to the invoke and place them in GP registers.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700650 RegLocation rl_src1 = info->args[0];
651 RegLocation rl_src2 = info->args[1];
652 rl_src1 = LoadValue(rl_src1, kCoreReg);
653 rl_src2 = LoadValue(rl_src2, kCoreReg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800654
Brian Carlstrom7940e442013-07-12 13:46:57 -0700655 RegLocation rl_dest = InlineTarget(info);
656 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800657
658 /*
659 * If the result register is the same as the second element, then we need to be careful.
660 * The reason is that the first copy will inadvertently clobber the second element with
661 * the first one thus yielding the wrong result. Thus we do a swap in that case.
662 */
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000663 if (rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800664 std::swap(rl_src1, rl_src2);
665 }
666
667 // Pick the first integer as min/max.
buzbee2700f7e2014-03-07 09:46:20 -0800668 OpRegCopy(rl_result.reg, rl_src1.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800669
670 // If the integers are both in the same register, then there is nothing else to do
671 // because they are equal and we have already moved one into the result.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000672 if (rl_src1.reg.GetReg() != rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800673 // It is possible we didn't pick correctly so do the actual comparison now.
buzbee2700f7e2014-03-07 09:46:20 -0800674 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800675
676 // Conditionally move the other integer into the destination register.
677 ConditionCode condition_code = is_min ? kCondGt : kCondLt;
buzbee2700f7e2014-03-07 09:46:20 -0800678 OpCondRegReg(kOpCmov, condition_code, rl_result.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800679 }
680
Brian Carlstrom7940e442013-07-12 13:46:57 -0700681 StoreValue(rl_dest, rl_result);
682 return true;
683}
684
Vladimir Markoe508a202013-11-04 15:24:22 +0000685bool X86Mir2Lir::GenInlinedPeek(CallInfo* info, OpSize size) {
686 RegLocation rl_src_address = info->args[0]; // long address
buzbee2700f7e2014-03-07 09:46:20 -0800687 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[1]
buzbee695d13a2014-04-19 13:32:20 -0700688 RegLocation rl_dest = size == k64 ? InlineTargetWide(info) : InlineTarget(info);
Vladimir Markoe508a202013-11-04 15:24:22 +0000689 RegLocation rl_address = LoadValue(rl_src_address, kCoreReg);
690 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Vladimir Marko455759b2014-05-06 20:49:36 +0100691 // Unaligned access is allowed on x86.
Vladimir Marko3bf7c602014-05-07 14:55:43 +0100692 LoadBaseDisp(rl_address.reg, 0, rl_result.reg, size);
buzbee695d13a2014-04-19 13:32:20 -0700693 if (size == k64) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000694 StoreValueWide(rl_dest, rl_result);
695 } else {
buzbee695d13a2014-04-19 13:32:20 -0700696 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
Vladimir Markoe508a202013-11-04 15:24:22 +0000697 StoreValue(rl_dest, rl_result);
698 }
699 return true;
700}
701
702bool X86Mir2Lir::GenInlinedPoke(CallInfo* info, OpSize size) {
703 RegLocation rl_src_address = info->args[0]; // long address
buzbee2700f7e2014-03-07 09:46:20 -0800704 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[1]
Vladimir Markoe508a202013-11-04 15:24:22 +0000705 RegLocation rl_src_value = info->args[2]; // [size] value
706 RegLocation rl_address = LoadValue(rl_src_address, kCoreReg);
buzbee695d13a2014-04-19 13:32:20 -0700707 if (size == k64) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000708 // Unaligned access is allowed on x86.
709 RegLocation rl_value = LoadValueWide(rl_src_value, kCoreReg);
Vladimir Marko455759b2014-05-06 20:49:36 +0100710 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size);
Vladimir Markoe508a202013-11-04 15:24:22 +0000711 } else {
buzbee695d13a2014-04-19 13:32:20 -0700712 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
Vladimir Markoe508a202013-11-04 15:24:22 +0000713 // Unaligned access is allowed on x86.
714 RegLocation rl_value = LoadValue(rl_src_value, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800715 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size);
Vladimir Markoe508a202013-11-04 15:24:22 +0000716 }
717 return true;
718}
719
buzbee2700f7e2014-03-07 09:46:20 -0800720void X86Mir2Lir::OpLea(RegStorage r_base, RegStorage reg1, RegStorage reg2, int scale, int offset) {
721 NewLIR5(kX86Lea32RA, r_base.GetReg(), reg1.GetReg(), reg2.GetReg(), scale, offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700722}
723
Ian Rogersdd7624d2014-03-14 17:43:00 -0700724void X86Mir2Lir::OpTlsCmp(ThreadOffset<4> offset, int val) {
Ian Rogers468532e2013-08-05 10:56:33 -0700725 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700726}
727
buzbee2700f7e2014-03-07 09:46:20 -0800728static bool IsInReg(X86Mir2Lir *pMir2Lir, const RegLocation &rl, RegStorage reg) {
729 return rl.reg.Valid() && rl.reg.GetReg() == reg.GetReg() && (pMir2Lir->IsLive(reg) || rl.home);
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700730}
731
Vladimir Marko1c282e22013-11-21 14:49:47 +0000732bool X86Mir2Lir::GenInlinedCas(CallInfo* info, bool is_long, bool is_object) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700733 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000734 // Unused - RegLocation rl_src_unsafe = info->args[0];
735 RegLocation rl_src_obj = info->args[1]; // Object - known non-null
736 RegLocation rl_src_offset = info->args[2]; // long low
buzbee2700f7e2014-03-07 09:46:20 -0800737 rl_src_offset = NarrowRegLoc(rl_src_offset); // ignore high half in info->args[3]
Vladimir Markoc29bb612013-11-27 16:47:25 +0000738 RegLocation rl_src_expected = info->args[4]; // int, long or Object
739 // If is_long, high half is in info->args[5]
740 RegLocation rl_src_new_value = info->args[is_long ? 6 : 5]; // int, long or Object
741 // If is_long, high half is in info->args[7]
742
743 if (is_long) {
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700744 // TODO: avoid unnecessary loads of SI and DI when the values are in registers.
745 // TODO: CFI support.
Vladimir Marko70b797d2013-12-03 15:25:24 +0000746 FlushAllRegs();
747 LockCallTemps();
buzbee091cc402014-03-31 10:14:40 -0700748 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
749 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_rBX, rs_rCX);
buzbee2700f7e2014-03-07 09:46:20 -0800750 LoadValueDirectWideFixed(rl_src_expected, r_tmp1);
751 LoadValueDirectWideFixed(rl_src_new_value, r_tmp2);
buzbee091cc402014-03-31 10:14:40 -0700752 NewLIR1(kX86Push32R, rs_rDI.GetReg());
753 MarkTemp(rs_rDI);
754 LockTemp(rs_rDI);
755 NewLIR1(kX86Push32R, rs_rSI.GetReg());
756 MarkTemp(rs_rSI);
757 LockTemp(rs_rSI);
Vladimir Markoa6fd8ba2013-12-13 10:53:49 +0000758 const int push_offset = 4 /* push edi */ + 4 /* push esi */;
buzbee2700f7e2014-03-07 09:46:20 -0800759 int srcObjSp = IsInReg(this, rl_src_obj, rs_rSI) ? 0
760 : (IsInReg(this, rl_src_obj, rs_rDI) ? 4
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700761 : (SRegOffset(rl_src_obj.s_reg_low) + push_offset));
buzbee695d13a2014-04-19 13:32:20 -0700762 // FIXME: needs 64-bit update.
buzbee2700f7e2014-03-07 09:46:20 -0800763 LoadWordDisp(TargetReg(kSp), srcObjSp, rs_rDI);
764 int srcOffsetSp = IsInReg(this, rl_src_offset, rs_rSI) ? 0
765 : (IsInReg(this, rl_src_offset, rs_rDI) ? 4
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700766 : (SRegOffset(rl_src_offset.s_reg_low) + push_offset));
buzbee2700f7e2014-03-07 09:46:20 -0800767 LoadWordDisp(TargetReg(kSp), srcOffsetSp, rs_rSI);
buzbee091cc402014-03-31 10:14:40 -0700768 NewLIR4(kX86LockCmpxchg8bA, rs_rDI.GetReg(), rs_rSI.GetReg(), 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800769
770 // After a store we need to insert barrier in case of potential load. Since the
771 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
772 GenMemBarrier(kStoreLoad);
773
buzbee091cc402014-03-31 10:14:40 -0700774 FreeTemp(rs_rSI);
775 UnmarkTemp(rs_rSI);
776 NewLIR1(kX86Pop32R, rs_rSI.GetReg());
777 FreeTemp(rs_rDI);
778 UnmarkTemp(rs_rDI);
779 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
Vladimir Marko70b797d2013-12-03 15:25:24 +0000780 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +0000781 } else {
782 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800783 FlushReg(rs_r0);
buzbee091cc402014-03-31 10:14:40 -0700784 Clobber(rs_r0);
buzbee2700f7e2014-03-07 09:46:20 -0800785 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000786
Vladimir Markoc29bb612013-11-27 16:47:25 +0000787 RegLocation rl_object = LoadValue(rl_src_obj, kCoreReg);
788 RegLocation rl_new_value = LoadValue(rl_src_new_value, kCoreReg);
789
790 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
791 // Mark card for object assuming new value is stored.
buzbee091cc402014-03-31 10:14:40 -0700792 FreeTemp(rs_r0); // Temporarily release EAX for MarkGCCard().
buzbee2700f7e2014-03-07 09:46:20 -0800793 MarkGCCard(rl_new_value.reg, rl_object.reg);
buzbee091cc402014-03-31 10:14:40 -0700794 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000795 }
796
797 RegLocation rl_offset = LoadValue(rl_src_offset, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800798 LoadValueDirect(rl_src_expected, rs_r0);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000799 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0, rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +0000800
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800801 // After a store we need to insert barrier in case of potential load. Since the
802 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
803 GenMemBarrier(kStoreLoad);
804
buzbee091cc402014-03-31 10:14:40 -0700805 FreeTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000806 }
807
808 // Convert ZF to boolean
809 RegLocation rl_dest = InlineTarget(info); // boolean place for result
810 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000811 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondZ);
812 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +0000813 StoreValue(rl_dest, rl_result);
814 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700815}
816
buzbee2700f7e2014-03-07 09:46:20 -0800817LIR* X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800818 CHECK(base_of_code_ != nullptr);
819
820 // Address the start of the method
821 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
822 LoadValueDirectFixed(rl_method, reg);
823 store_method_addr_used_ = true;
824
825 // Load the proper value from the literal area.
826 // We don't know the proper offset for the value, so pick one that will force
827 // 4 byte offset. We will fix this up in the assembler later to have the right
828 // value.
buzbee2700f7e2014-03-07 09:46:20 -0800829 LIR *res = RawLIR(current_dalvik_offset_, kX86Mov32RM, reg.GetReg(), reg.GetReg(), 256,
830 0, 0, target);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800831 res->target = target;
832 res->flags.fixup = kFixupLoad;
833 SetMemRefType(res, true, kLiteral);
834 store_method_addr_used_ = true;
835 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700836}
837
buzbee2700f7e2014-03-07 09:46:20 -0800838LIR* X86Mir2Lir::OpVldm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700839 LOG(FATAL) << "Unexpected use of OpVldm for x86";
840 return NULL;
841}
842
buzbee2700f7e2014-03-07 09:46:20 -0800843LIR* X86Mir2Lir::OpVstm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700844 LOG(FATAL) << "Unexpected use of OpVstm for x86";
845 return NULL;
846}
847
848void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
849 RegLocation rl_result, int lit,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700850 int first_bit, int second_bit) {
buzbee2700f7e2014-03-07 09:46:20 -0800851 RegStorage t_reg = AllocTemp();
852 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
853 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700854 FreeTemp(t_reg);
855 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800856 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700857 }
858}
859
Mingyao Yange643a172014-04-08 11:02:52 -0700860void X86Mir2Lir::GenDivZeroCheckWide(RegStorage reg) {
buzbee2700f7e2014-03-07 09:46:20 -0800861 DCHECK(reg.IsPair()); // TODO: allow 64BitSolo.
862 // We are not supposed to clobber the incoming storage, so allocate a temporary.
863 RegStorage t_reg = AllocTemp();
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800864
865 // 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 -0800866 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800867
868 // In case of zero, throw ArithmeticException.
Mingyao Yange643a172014-04-08 11:02:52 -0700869 GenDivZeroCheck(kCondEq);
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800870
871 // The temp is no longer needed so free it at this time.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700872 FreeTemp(t_reg);
873}
874
Mingyao Yang80365d92014-04-18 12:10:58 -0700875void X86Mir2Lir::GenArrayBoundsCheck(RegStorage index,
876 RegStorage array_base,
877 int len_offset) {
878 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
879 public:
880 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
881 RegStorage index, RegStorage array_base, int32_t len_offset)
882 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
883 index_(index), array_base_(array_base), len_offset_(len_offset) {
884 }
885
886 void Compile() OVERRIDE {
887 m2l_->ResetRegPool();
888 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -0700889 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -0700890
891 RegStorage new_index = index_;
892 // Move index out of kArg1, either directly to kArg0, or to kArg2.
893 if (index_.GetReg() == m2l_->TargetReg(kArg1).GetReg()) {
894 if (array_base_.GetReg() == m2l_->TargetReg(kArg0).GetReg()) {
895 m2l_->OpRegCopy(m2l_->TargetReg(kArg2), index_);
896 new_index = m2l_->TargetReg(kArg2);
897 } else {
898 m2l_->OpRegCopy(m2l_->TargetReg(kArg0), index_);
899 new_index = m2l_->TargetReg(kArg0);
900 }
901 }
902 // Load array length to kArg1.
903 m2l_->OpRegMem(kOpMov, m2l_->TargetReg(kArg1), array_base_, len_offset_);
904 m2l_->CallRuntimeHelperRegReg(QUICK_ENTRYPOINT_OFFSET(4, pThrowArrayBounds),
905 new_index, m2l_->TargetReg(kArg1), true);
906 }
907
908 private:
909 const RegStorage index_;
910 const RegStorage array_base_;
911 const int32_t len_offset_;
912 };
913
914 OpRegMem(kOpCmp, index, array_base, len_offset);
915 LIR* branch = OpCondBranch(kCondUge, nullptr);
916 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
917 index, array_base, len_offset));
918}
919
920void X86Mir2Lir::GenArrayBoundsCheck(int32_t index,
921 RegStorage array_base,
922 int32_t len_offset) {
923 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
924 public:
925 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
926 int32_t index, RegStorage array_base, int32_t len_offset)
927 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
928 index_(index), array_base_(array_base), len_offset_(len_offset) {
929 }
930
931 void Compile() OVERRIDE {
932 m2l_->ResetRegPool();
933 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -0700934 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -0700935
936 // Load array length to kArg1.
937 m2l_->OpRegMem(kOpMov, m2l_->TargetReg(kArg1), array_base_, len_offset_);
938 m2l_->LoadConstant(m2l_->TargetReg(kArg0), index_);
939 m2l_->CallRuntimeHelperRegReg(QUICK_ENTRYPOINT_OFFSET(4, pThrowArrayBounds),
940 m2l_->TargetReg(kArg0), m2l_->TargetReg(kArg1), true);
941 }
942
943 private:
944 const int32_t index_;
945 const RegStorage array_base_;
946 const int32_t len_offset_;
947 };
948
949 NewLIR3(IS_SIMM8(index) ? kX86Cmp32MI8 : kX86Cmp32MI, array_base.GetReg(), len_offset, index);
950 LIR* branch = OpCondBranch(kCondLs, nullptr);
951 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
952 index, array_base, len_offset));
953}
954
Brian Carlstrom7940e442013-07-12 13:46:57 -0700955// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700956LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
Ian Rogersdd7624d2014-03-14 17:43:00 -0700957 OpTlsCmp(Thread::ThreadFlagsOffset<4>(), 0);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700958 return OpCondBranch((target == NULL) ? kCondNe : kCondEq, target);
959}
960
961// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -0800962LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700963 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -0800964 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700965}
966
buzbee11b63d12013-08-27 07:34:17 -0700967bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700968 RegLocation rl_src, RegLocation rl_dest, int lit) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700969 LOG(FATAL) << "Unexpected use of smallLiteralDive in x86";
970 return false;
971}
972
Ian Rogerse2143c02014-03-28 08:47:16 -0700973bool X86Mir2Lir::EasyMultiply(RegLocation rl_src, RegLocation rl_dest, int lit) {
974 LOG(FATAL) << "Unexpected use of easyMultiply in x86";
975 return false;
976}
977
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700978LIR* X86Mir2Lir::OpIT(ConditionCode cond, const char* guide) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700979 LOG(FATAL) << "Unexpected use of OpIT in x86";
980 return NULL;
981}
982
Dave Allison3da67a52014-04-02 17:03:45 -0700983void X86Mir2Lir::OpEndIT(LIR* it) {
984 LOG(FATAL) << "Unexpected use of OpEndIT in x86";
985}
986
buzbee2700f7e2014-03-07 09:46:20 -0800987void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -0800988 switch (val) {
989 case 0:
buzbee2700f7e2014-03-07 09:46:20 -0800990 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -0800991 break;
992 case 1:
993 OpRegCopy(dest, src);
994 break;
995 default:
996 OpRegRegImm(kOpMul, dest, src, val);
997 break;
998 }
999}
1000
buzbee2700f7e2014-03-07 09:46:20 -08001001void X86Mir2Lir::GenImulMemImm(RegStorage dest, int sreg, int displacement, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001002 LIR *m;
1003 switch (val) {
1004 case 0:
buzbee2700f7e2014-03-07 09:46:20 -08001005 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001006 break;
1007 case 1:
Vladimir Marko3bf7c602014-05-07 14:55:43 +01001008 LoadBaseDisp(rs_rX86_SP, displacement, dest, k32);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001009 break;
1010 default:
buzbee091cc402014-03-31 10:14:40 -07001011 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(),
1012 rs_rX86_SP.GetReg(), displacement, val);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001013 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
1014 break;
1015 }
1016}
1017
Mark Mendelle02d48f2014-01-15 11:19:23 -08001018void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001019 RegLocation rl_src2) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001020 if (rl_src1.is_const) {
1021 std::swap(rl_src1, rl_src2);
1022 }
1023 // Are we multiplying by a constant?
1024 if (rl_src2.is_const) {
1025 // Do special compare/branch against simple const operand
1026 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
1027 if (val == 0) {
1028 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001029 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
1030 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001031 StoreValueWide(rl_dest, rl_result);
1032 return;
1033 } else if (val == 1) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001034 StoreValueWide(rl_dest, rl_src1);
1035 return;
1036 } else if (val == 2) {
1037 GenAddLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1);
1038 return;
1039 } else if (IsPowerOfTwo(val)) {
1040 int shift_amount = LowestSetBit(val);
1041 if (!BadOverlap(rl_src1, rl_dest)) {
1042 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1043 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest,
1044 rl_src1, shift_amount);
1045 StoreValueWide(rl_dest, rl_result);
1046 return;
1047 }
1048 }
1049
1050 // Okay, just bite the bullet and do it.
1051 int32_t val_lo = Low32Bits(val);
1052 int32_t val_hi = High32Bits(val);
1053 FlushAllRegs();
1054 LockCallTemps(); // Prepare for explicit register usage.
1055 rl_src1 = UpdateLocWide(rl_src1);
1056 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1057 int displacement = SRegOffset(rl_src1.s_reg_low);
1058
1059 // ECX <- 1H * 2L
1060 // EAX <- 1L * 2H
1061 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001062 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
1063 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001064 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001065 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
1066 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001067 }
1068
1069 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001070 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001071
1072 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001073 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001074
1075 // EDX:EAX <- 2L * 1L (double precision)
1076 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001077 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001078 } else {
buzbee091cc402014-03-31 10:14:40 -07001079 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001080 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1081 true /* is_load */, true /* is_64bit */);
1082 }
1083
1084 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001085 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001086
1087 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001088 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
1089 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001090 StoreValueWide(rl_dest, rl_result);
1091 return;
1092 }
1093
1094 // Nope. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001095 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1096 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1097 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1098
Mark Mendell4708dcd2014-01-22 09:05:18 -08001099 FlushAllRegs();
1100 LockCallTemps(); // Prepare for explicit register usage.
1101 rl_src1 = UpdateLocWide(rl_src1);
1102 rl_src2 = UpdateLocWide(rl_src2);
1103
1104 // At this point, the VRs are in their home locations.
1105 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1106 bool src2_in_reg = rl_src2.location == kLocPhysReg;
1107
1108 // ECX <- 1H
1109 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001110 NewLIR2(kX86Mov32RR, rs_r1.GetReg(), rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001111 } else {
Vladimir Marko3bf7c602014-05-07 14:55:43 +01001112 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1, k32);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001113 }
1114
Mark Mendellde99bba2014-02-14 12:15:02 -08001115 if (is_square) {
1116 // Take advantage of the fact that the values are the same.
1117 // ECX <- ECX * 2L (1H * 2L)
1118 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001119 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001120 } else {
1121 int displacement = SRegOffset(rl_src2.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001122 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
1123 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001124 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1125 true /* is_load */, true /* is_64bit */);
1126 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001127
Mark Mendellde99bba2014-02-14 12:15:02 -08001128 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001129 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001130 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001131 // EAX <- 2H
1132 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001133 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001134 } else {
Vladimir Marko3bf7c602014-05-07 14:55:43 +01001135 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0, k32);
Mark Mendellde99bba2014-02-14 12:15:02 -08001136 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001137
Mark Mendellde99bba2014-02-14 12:15:02 -08001138 // EAX <- EAX * 1L (2H * 1L)
1139 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001140 NewLIR2(kX86Imul32RR, rs_r0.GetReg(), rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001141 } else {
1142 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001143 LIR *m = NewLIR3(kX86Imul32RM, rs_r0.GetReg(), rs_rX86_SP.GetReg(),
1144 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001145 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1146 true /* is_load */, true /* is_64bit */);
1147 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001148
Mark Mendellde99bba2014-02-14 12:15:02 -08001149 // ECX <- ECX * 2L (1H * 2L)
1150 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001151 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001152 } else {
1153 int displacement = SRegOffset(rl_src2.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001154 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
1155 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001156 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1157 true /* is_load */, true /* is_64bit */);
1158 }
1159
1160 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001161 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001162 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001163
1164 // EAX <- 2L
1165 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001166 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001167 } else {
Vladimir Marko3bf7c602014-05-07 14:55:43 +01001168 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0, k32);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001169 }
1170
1171 // EDX:EAX <- 2L * 1L (double precision)
1172 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001173 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001174 } else {
1175 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001176 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001177 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1178 true /* is_load */, true /* is_64bit */);
1179 }
1180
1181 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001182 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001183
1184 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001185 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
buzbee2700f7e2014-03-07 09:46:20 -08001186 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001187 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001188}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001189
1190void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1191 Instruction::Code op) {
1192 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1193 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1194 if (rl_src.location == kLocPhysReg) {
1195 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001196 // But we must ensure that rl_src is in pair
1197 rl_src = EvalLocWide(rl_src, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001198 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001199 // The registers are the same, so we would clobber it before the use.
buzbee2700f7e2014-03-07 09:46:20 -08001200 RegStorage temp_reg = AllocTemp();
1201 OpRegCopy(temp_reg, rl_dest.reg);
1202 rl_src.reg.SetHighReg(temp_reg.GetReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001203 }
buzbee2700f7e2014-03-07 09:46:20 -08001204 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001205
1206 x86op = GetOpcode(op, rl_dest, rl_src, true);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001207 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
buzbee2700f7e2014-03-07 09:46:20 -08001208 FreeTemp(rl_src.reg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001209 return;
1210 }
1211
1212 // RHS is in memory.
1213 DCHECK((rl_src.location == kLocDalvikFrame) ||
1214 (rl_src.location == kLocCompilerTemp));
buzbee2700f7e2014-03-07 09:46:20 -08001215 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001216 int displacement = SRegOffset(rl_src.s_reg_low);
1217
buzbee2700f7e2014-03-07 09:46:20 -08001218 LIR *lir = NewLIR3(x86op, rl_dest.reg.GetLowReg(), r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001219 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1220 true /* is_load */, true /* is64bit */);
1221 x86op = GetOpcode(op, rl_dest, rl_src, true);
buzbee2700f7e2014-03-07 09:46:20 -08001222 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001223 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1224 true /* is_load */, true /* is64bit */);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001225}
1226
Mark Mendelle02d48f2014-01-15 11:19:23 -08001227void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
1228 rl_dest = UpdateLocWide(rl_dest);
1229 if (rl_dest.location == kLocPhysReg) {
1230 // Ensure we are in a register pair
1231 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1232
1233 rl_src = UpdateLocWide(rl_src);
1234 GenLongRegOrMemOp(rl_result, rl_src, op);
1235 StoreFinalValueWide(rl_dest, rl_result);
1236 return;
1237 }
1238
1239 // It wasn't in registers, so it better be in memory.
1240 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1241 (rl_dest.location == kLocCompilerTemp));
1242 rl_src = LoadValueWide(rl_src, kCoreReg);
1243
1244 // Operate directly into memory.
1245 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
buzbee2700f7e2014-03-07 09:46:20 -08001246 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001247 int displacement = SRegOffset(rl_dest.s_reg_low);
1248
buzbee2700f7e2014-03-07 09:46:20 -08001249 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001250 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001251 true /* is_load */, true /* is64bit */);
1252 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001253 false /* is_load */, true /* is64bit */);
1254 x86op = GetOpcode(op, rl_dest, rl_src, true);
buzbee2700f7e2014-03-07 09:46:20 -08001255 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001256 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001257 true /* is_load */, true /* is64bit */);
1258 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001259 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -08001260 FreeTemp(rl_src.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001261}
1262
Mark Mendelle02d48f2014-01-15 11:19:23 -08001263void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
1264 RegLocation rl_src2, Instruction::Code op,
1265 bool is_commutative) {
1266 // Is this really a 2 operand operation?
1267 switch (op) {
1268 case Instruction::ADD_LONG_2ADDR:
1269 case Instruction::SUB_LONG_2ADDR:
1270 case Instruction::AND_LONG_2ADDR:
1271 case Instruction::OR_LONG_2ADDR:
1272 case Instruction::XOR_LONG_2ADDR:
1273 GenLongArith(rl_dest, rl_src2, op);
1274 return;
1275 default:
1276 break;
1277 }
1278
1279 if (rl_dest.location == kLocPhysReg) {
1280 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
1281
1282 // We are about to clobber the LHS, so it needs to be a temp.
1283 rl_result = ForceTempWide(rl_result);
1284
1285 // Perform the operation using the RHS.
1286 rl_src2 = UpdateLocWide(rl_src2);
1287 GenLongRegOrMemOp(rl_result, rl_src2, op);
1288
1289 // And now record that the result is in the temp.
1290 StoreFinalValueWide(rl_dest, rl_result);
1291 return;
1292 }
1293
1294 // It wasn't in registers, so it better be in memory.
1295 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1296 (rl_dest.location == kLocCompilerTemp));
1297 rl_src1 = UpdateLocWide(rl_src1);
1298 rl_src2 = UpdateLocWide(rl_src2);
1299
1300 // Get one of the source operands into temporary register.
1301 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
buzbee091cc402014-03-31 10:14:40 -07001302 if (IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001303 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1304 } else if (is_commutative) {
1305 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1306 // We need at least one of them to be a temporary.
buzbee091cc402014-03-31 10:14:40 -07001307 if (!(IsTemp(rl_src2.reg.GetLow()) && IsTemp(rl_src2.reg.GetHigh()))) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001308 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07001309 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1310 } else {
1311 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1312 StoreFinalValueWide(rl_dest, rl_src2);
1313 return;
Mark Mendelle02d48f2014-01-15 11:19:23 -08001314 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001315 } else {
1316 // Need LHS to be the temp.
1317 rl_src1 = ForceTempWide(rl_src1);
1318 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1319 }
1320
1321 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001322}
1323
Mark Mendelle02d48f2014-01-15 11:19:23 -08001324void X86Mir2Lir::GenAddLong(Instruction::Code opcode, RegLocation rl_dest,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001325 RegLocation rl_src1, RegLocation rl_src2) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001326 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1327}
1328
1329void X86Mir2Lir::GenSubLong(Instruction::Code opcode, RegLocation rl_dest,
1330 RegLocation rl_src1, RegLocation rl_src2) {
1331 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1332}
1333
1334void X86Mir2Lir::GenAndLong(Instruction::Code opcode, RegLocation rl_dest,
1335 RegLocation rl_src1, RegLocation rl_src2) {
1336 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1337}
1338
1339void X86Mir2Lir::GenOrLong(Instruction::Code opcode, RegLocation rl_dest,
1340 RegLocation rl_src1, RegLocation rl_src2) {
1341 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1342}
1343
1344void X86Mir2Lir::GenXorLong(Instruction::Code opcode, RegLocation rl_dest,
1345 RegLocation rl_src1, RegLocation rl_src2) {
1346 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001347}
1348
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001349void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001350 rl_src = LoadValueWide(rl_src, kCoreReg);
1351 RegLocation rl_result = ForceTempWide(rl_src);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001352 if (((rl_dest.location == kLocPhysReg) && (rl_src.location == kLocPhysReg)) &&
buzbee2700f7e2014-03-07 09:46:20 -08001353 ((rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()))) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001354 // The registers are the same, so we would clobber it before the use.
buzbee2700f7e2014-03-07 09:46:20 -08001355 RegStorage temp_reg = AllocTemp();
1356 OpRegCopy(temp_reg, rl_result.reg);
1357 rl_result.reg.SetHighReg(temp_reg.GetReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001358 }
buzbee2700f7e2014-03-07 09:46:20 -08001359 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
1360 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
1361 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Brian Carlstrom7940e442013-07-12 13:46:57 -07001362 StoreValueWide(rl_dest, rl_result);
1363}
1364
buzbee091cc402014-03-31 10:14:40 -07001365void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<4> thread_offset) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001366 X86OpCode opcode = kX86Bkpt;
1367 switch (op) {
1368 case kOpCmp: opcode = kX86Cmp32RT; break;
1369 case kOpMov: opcode = kX86Mov32RT; break;
1370 default:
1371 LOG(FATAL) << "Bad opcode: " << op;
1372 break;
1373 }
buzbee091cc402014-03-31 10:14:40 -07001374 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07001375}
1376
1377/*
1378 * Generate array load
1379 */
1380void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07001381 RegLocation rl_index, RegLocation rl_dest, int scale) {
buzbee091cc402014-03-31 10:14:40 -07001382 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001383 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001384 RegLocation rl_result;
1385 rl_array = LoadValue(rl_array, kCoreReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001386
Mark Mendell343adb52013-12-18 06:02:17 -08001387 int data_offset;
buzbee695d13a2014-04-19 13:32:20 -07001388 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001389 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
1390 } else {
1391 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
1392 }
1393
Mark Mendell343adb52013-12-18 06:02:17 -08001394 bool constant_index = rl_index.is_const;
1395 int32_t constant_index_value = 0;
1396 if (!constant_index) {
1397 rl_index = LoadValue(rl_index, kCoreReg);
1398 } else {
1399 constant_index_value = mir_graph_->ConstantValue(rl_index);
1400 // If index is constant, just fold it into the data offset
1401 data_offset += constant_index_value << scale;
1402 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08001403 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08001404 }
1405
Brian Carlstrom7940e442013-07-12 13:46:57 -07001406 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08001407 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001408
1409 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08001410 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001411 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001412 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07001413 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001414 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001415 }
Mark Mendell343adb52013-12-18 06:02:17 -08001416 rl_result = EvalLoc(rl_dest, reg_class, true);
Vladimir Marko3bf7c602014-05-07 14:55:43 +01001417 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg, size);
buzbee695d13a2014-04-19 13:32:20 -07001418 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001419 StoreValueWide(rl_dest, rl_result);
1420 } else {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001421 StoreValue(rl_dest, rl_result);
1422 }
1423}
1424
1425/*
1426 * Generate array store
1427 *
1428 */
1429void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07001430 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
buzbee091cc402014-03-31 10:14:40 -07001431 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001432 int len_offset = mirror::Array::LengthOffset().Int32Value();
1433 int data_offset;
1434
buzbee695d13a2014-04-19 13:32:20 -07001435 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001436 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
1437 } else {
1438 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
1439 }
1440
1441 rl_array = LoadValue(rl_array, kCoreReg);
Mark Mendell343adb52013-12-18 06:02:17 -08001442 bool constant_index = rl_index.is_const;
1443 int32_t constant_index_value = 0;
1444 if (!constant_index) {
1445 rl_index = LoadValue(rl_index, kCoreReg);
1446 } else {
1447 // If index is constant, just fold it into the data offset
1448 constant_index_value = mir_graph_->ConstantValue(rl_index);
1449 data_offset += constant_index_value << scale;
1450 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08001451 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08001452 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001453
1454 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08001455 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001456
1457 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08001458 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001459 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001460 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07001461 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001462 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001463 }
buzbee695d13a2014-04-19 13:32:20 -07001464 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001465 rl_src = LoadValueWide(rl_src, reg_class);
1466 } else {
1467 rl_src = LoadValue(rl_src, reg_class);
1468 }
1469 // If the src reg can't be byte accessed, move it to a temp first.
buzbee091cc402014-03-31 10:14:40 -07001470 if ((size == kSignedByte || size == kUnsignedByte) &&
1471 rl_src.reg.GetRegNum() >= rs_rX86_SP.GetRegNum()) {
buzbee2700f7e2014-03-07 09:46:20 -08001472 RegStorage temp = AllocTemp();
1473 OpRegCopy(temp, rl_src.reg);
Vladimir Marko3bf7c602014-05-07 14:55:43 +01001474 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp, size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001475 } else {
Vladimir Marko3bf7c602014-05-07 14:55:43 +01001476 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg, size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001477 }
Ian Rogersa9a82542013-10-04 11:17:26 -07001478 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07001479 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08001480 if (!constant_index) {
buzbee091cc402014-03-31 10:14:40 -07001481 FreeTemp(rl_index.reg);
Mark Mendell343adb52013-12-18 06:02:17 -08001482 }
buzbee2700f7e2014-03-07 09:46:20 -08001483 MarkGCCard(rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001484 }
1485}
1486
Mark Mendell4708dcd2014-01-22 09:05:18 -08001487RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
1488 RegLocation rl_src, int shift_amount) {
1489 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1490 switch (opcode) {
1491 case Instruction::SHL_LONG:
1492 case Instruction::SHL_LONG_2ADDR:
1493 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
1494 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001495 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
1496 LoadConstant(rl_result.reg.GetLow(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001497 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001498 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
buzbee091cc402014-03-31 10:14:40 -07001499 FreeTemp(rl_src.reg.GetHigh());
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001500 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
buzbee2700f7e2014-03-07 09:46:20 -08001501 LoadConstant(rl_result.reg.GetLow(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001502 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001503 OpRegCopy(rl_result.reg, rl_src.reg);
1504 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1505 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(), shift_amount);
1506 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001507 }
1508 break;
1509 case Instruction::SHR_LONG:
1510 case Instruction::SHR_LONG_2ADDR:
1511 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001512 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1513 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001514 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001515 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001516 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1517 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1518 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001519 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001520 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001521 OpRegCopy(rl_result.reg, rl_src.reg);
1522 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1523 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(), shift_amount);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001524 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001525 }
1526 break;
1527 case Instruction::USHR_LONG:
1528 case Instruction::USHR_LONG_2ADDR:
1529 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001530 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1531 LoadConstant(rl_result.reg.GetHigh(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001532 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001533 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1534 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
1535 LoadConstant(rl_result.reg.GetHigh(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001536 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001537 OpRegCopy(rl_result.reg, rl_src.reg);
1538 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1539 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(), shift_amount);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001540 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001541 }
1542 break;
1543 default:
1544 LOG(FATAL) << "Unexpected case";
1545 }
1546 return rl_result;
1547}
1548
Brian Carlstrom7940e442013-07-12 13:46:57 -07001549void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Mark Mendell4708dcd2014-01-22 09:05:18 -08001550 RegLocation rl_src, RegLocation rl_shift) {
1551 // Per spec, we only care about low 6 bits of shift amount.
1552 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
1553 if (shift_amount == 0) {
1554 rl_src = LoadValueWide(rl_src, kCoreReg);
1555 StoreValueWide(rl_dest, rl_src);
1556 return;
1557 } else if (shift_amount == 1 &&
1558 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
1559 // Need to handle this here to avoid calling StoreValueWide twice.
1560 GenAddLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src);
1561 return;
1562 }
1563 if (BadOverlap(rl_src, rl_dest)) {
1564 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
1565 return;
1566 }
1567 rl_src = LoadValueWide(rl_src, kCoreReg);
1568 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount);
1569 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001570}
1571
1572void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001573 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001574 switch (opcode) {
1575 case Instruction::ADD_LONG:
1576 case Instruction::AND_LONG:
1577 case Instruction::OR_LONG:
1578 case Instruction::XOR_LONG:
1579 if (rl_src2.is_const) {
1580 GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
1581 } else {
1582 DCHECK(rl_src1.is_const);
1583 GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
1584 }
1585 break;
1586 case Instruction::SUB_LONG:
1587 case Instruction::SUB_LONG_2ADDR:
1588 if (rl_src2.is_const) {
1589 GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
1590 } else {
1591 GenSubLong(opcode, rl_dest, rl_src1, rl_src2);
1592 }
1593 break;
1594 case Instruction::ADD_LONG_2ADDR:
1595 case Instruction::OR_LONG_2ADDR:
1596 case Instruction::XOR_LONG_2ADDR:
1597 case Instruction::AND_LONG_2ADDR:
1598 if (rl_src2.is_const) {
1599 GenLongImm(rl_dest, rl_src2, opcode);
1600 } else {
1601 DCHECK(rl_src1.is_const);
1602 GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
1603 }
1604 break;
1605 default:
1606 // Default - bail to non-const handler.
1607 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
1608 break;
1609 }
1610}
1611
1612bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
1613 switch (op) {
1614 case Instruction::AND_LONG_2ADDR:
1615 case Instruction::AND_LONG:
1616 return value == -1;
1617 case Instruction::OR_LONG:
1618 case Instruction::OR_LONG_2ADDR:
1619 case Instruction::XOR_LONG:
1620 case Instruction::XOR_LONG_2ADDR:
1621 return value == 0;
1622 default:
1623 return false;
1624 }
1625}
1626
1627X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
1628 bool is_high_op) {
1629 bool rhs_in_mem = rhs.location != kLocPhysReg;
1630 bool dest_in_mem = dest.location != kLocPhysReg;
1631 DCHECK(!rhs_in_mem || !dest_in_mem);
1632 switch (op) {
1633 case Instruction::ADD_LONG:
1634 case Instruction::ADD_LONG_2ADDR:
1635 if (dest_in_mem) {
1636 return is_high_op ? kX86Adc32MR : kX86Add32MR;
1637 } else if (rhs_in_mem) {
1638 return is_high_op ? kX86Adc32RM : kX86Add32RM;
1639 }
1640 return is_high_op ? kX86Adc32RR : kX86Add32RR;
1641 case Instruction::SUB_LONG:
1642 case Instruction::SUB_LONG_2ADDR:
1643 if (dest_in_mem) {
1644 return is_high_op ? kX86Sbb32MR : kX86Sub32MR;
1645 } else if (rhs_in_mem) {
1646 return is_high_op ? kX86Sbb32RM : kX86Sub32RM;
1647 }
1648 return is_high_op ? kX86Sbb32RR : kX86Sub32RR;
1649 case Instruction::AND_LONG_2ADDR:
1650 case Instruction::AND_LONG:
1651 if (dest_in_mem) {
1652 return kX86And32MR;
1653 }
1654 return rhs_in_mem ? kX86And32RM : kX86And32RR;
1655 case Instruction::OR_LONG:
1656 case Instruction::OR_LONG_2ADDR:
1657 if (dest_in_mem) {
1658 return kX86Or32MR;
1659 }
1660 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
1661 case Instruction::XOR_LONG:
1662 case Instruction::XOR_LONG_2ADDR:
1663 if (dest_in_mem) {
1664 return kX86Xor32MR;
1665 }
1666 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
1667 default:
1668 LOG(FATAL) << "Unexpected opcode: " << op;
1669 return kX86Add32RR;
1670 }
1671}
1672
1673X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
1674 int32_t value) {
1675 bool in_mem = loc.location != kLocPhysReg;
1676 bool byte_imm = IS_SIMM8(value);
buzbee091cc402014-03-31 10:14:40 -07001677 DCHECK(in_mem || !loc.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001678 switch (op) {
1679 case Instruction::ADD_LONG:
1680 case Instruction::ADD_LONG_2ADDR:
1681 if (byte_imm) {
1682 if (in_mem) {
1683 return is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
1684 }
1685 return is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
1686 }
1687 if (in_mem) {
1688 return is_high_op ? kX86Adc32MI : kX86Add32MI;
1689 }
1690 return is_high_op ? kX86Adc32RI : kX86Add32RI;
1691 case Instruction::SUB_LONG:
1692 case Instruction::SUB_LONG_2ADDR:
1693 if (byte_imm) {
1694 if (in_mem) {
1695 return is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
1696 }
1697 return is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
1698 }
1699 if (in_mem) {
1700 return is_high_op ? kX86Sbb32MI : kX86Sub32MI;
1701 }
1702 return is_high_op ? kX86Sbb32RI : kX86Sub32RI;
1703 case Instruction::AND_LONG_2ADDR:
1704 case Instruction::AND_LONG:
1705 if (byte_imm) {
1706 return in_mem ? kX86And32MI8 : kX86And32RI8;
1707 }
1708 return in_mem ? kX86And32MI : kX86And32RI;
1709 case Instruction::OR_LONG:
1710 case Instruction::OR_LONG_2ADDR:
1711 if (byte_imm) {
1712 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
1713 }
1714 return in_mem ? kX86Or32MI : kX86Or32RI;
1715 case Instruction::XOR_LONG:
1716 case Instruction::XOR_LONG_2ADDR:
1717 if (byte_imm) {
1718 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
1719 }
1720 return in_mem ? kX86Xor32MI : kX86Xor32RI;
1721 default:
1722 LOG(FATAL) << "Unexpected opcode: " << op;
1723 return kX86Add32MI;
1724 }
1725}
1726
1727void X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
1728 DCHECK(rl_src.is_const);
1729 int64_t val = mir_graph_->ConstantValueWide(rl_src);
1730 int32_t val_lo = Low32Bits(val);
1731 int32_t val_hi = High32Bits(val);
1732 rl_dest = UpdateLocWide(rl_dest);
1733
1734 // Can we just do this into memory?
1735 if ((rl_dest.location == kLocDalvikFrame) ||
1736 (rl_dest.location == kLocCompilerTemp)) {
buzbee2700f7e2014-03-07 09:46:20 -08001737 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001738 int displacement = SRegOffset(rl_dest.s_reg_low);
1739
1740 if (!IsNoOp(op, val_lo)) {
1741 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001742 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001743 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001744 true /* is_load */, true /* is64bit */);
1745 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001746 false /* is_load */, true /* is64bit */);
1747 }
1748 if (!IsNoOp(op, val_hi)) {
1749 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08001750 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001751 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001752 true /* is_load */, true /* is64bit */);
1753 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001754 false /* is_load */, true /* is64bit */);
1755 }
1756 return;
1757 }
1758
1759 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1760 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee091cc402014-03-31 10:14:40 -07001761 DCHECK(!rl_result.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001762
1763 if (!IsNoOp(op, val_lo)) {
1764 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001765 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001766 }
1767 if (!IsNoOp(op, val_hi)) {
1768 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001769 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001770 }
1771 StoreValueWide(rl_dest, rl_result);
1772}
1773
1774void X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
1775 RegLocation rl_src2, Instruction::Code op) {
1776 DCHECK(rl_src2.is_const);
1777 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
1778 int32_t val_lo = Low32Bits(val);
1779 int32_t val_hi = High32Bits(val);
1780 rl_dest = UpdateLocWide(rl_dest);
1781 rl_src1 = UpdateLocWide(rl_src1);
1782
1783 // Can we do this directly into the destination registers?
1784 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08001785 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
buzbee091cc402014-03-31 10:14:40 -07001786 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() && !rl_dest.reg.IsFloat()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001787 if (!IsNoOp(op, val_lo)) {
1788 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001789 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001790 }
1791 if (!IsNoOp(op, val_hi)) {
1792 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001793 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001794 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07001795
1796 StoreFinalValueWide(rl_dest, rl_dest);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001797 return;
1798 }
1799
1800 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1801 DCHECK_EQ(rl_src1.location, kLocPhysReg);
1802
1803 // We need the values to be in a temporary
1804 RegLocation rl_result = ForceTempWide(rl_src1);
1805 if (!IsNoOp(op, val_lo)) {
1806 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001807 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001808 }
1809 if (!IsNoOp(op, val_hi)) {
1810 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001811 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001812 }
1813
1814 StoreFinalValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001815}
1816
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001817// For final classes there are no sub-classes to check and so we can answer the instance-of
1818// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
1819void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
1820 RegLocation rl_dest, RegLocation rl_src) {
1821 RegLocation object = LoadValue(rl_src, kCoreReg);
1822 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001823 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001824
1825 // SETcc only works with EAX..EDX.
buzbee091cc402014-03-31 10:14:40 -07001826 if (result_reg == object.reg || result_reg.GetRegNum() >= rs_rX86_SP.GetRegNum()) {
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001827 result_reg = AllocTypedTemp(false, kCoreReg);
buzbee091cc402014-03-31 10:14:40 -07001828 DCHECK_LT(result_reg.GetRegNum(), rs_rX86_SP.GetRegNum());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001829 }
1830
1831 // Assume that there is no match.
1832 LoadConstant(result_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -08001833 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, NULL);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001834
buzbee2700f7e2014-03-07 09:46:20 -08001835 RegStorage check_class = AllocTypedTemp(false, kCoreReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001836
1837 // If Method* is already in a register, we can save a copy.
1838 RegLocation rl_method = mir_graph_->GetMethodLoc();
1839 int32_t offset_of_type = mirror::Array::DataOffset(sizeof(mirror::Class*)).Int32Value() +
1840 (sizeof(mirror::Class*) * type_idx);
1841
1842 if (rl_method.location == kLocPhysReg) {
1843 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07001844 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001845 check_class);
1846 } else {
buzbee695d13a2014-04-19 13:32:20 -07001847 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001848 check_class);
buzbee695d13a2014-04-19 13:32:20 -07001849 LoadRefDisp(check_class, offset_of_type, check_class);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001850 }
1851 } else {
1852 LoadCurrMethodDirect(check_class);
1853 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07001854 LoadRefDisp(check_class, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001855 check_class);
1856 } else {
buzbee695d13a2014-04-19 13:32:20 -07001857 LoadRefDisp(check_class, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001858 check_class);
buzbee695d13a2014-04-19 13:32:20 -07001859 LoadRefDisp(check_class, offset_of_type, check_class);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001860 }
1861 }
1862
1863 // Compare the computed class to the class in the object.
1864 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08001865 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001866
1867 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08001868 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001869
1870 LIR* target = NewLIR0(kPseudoTargetLabel);
1871 null_branchover->target = target;
1872 FreeTemp(check_class);
1873 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08001874 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001875 FreeTemp(result_reg);
1876 }
1877 StoreValue(rl_dest, rl_result);
1878}
1879
Mark Mendell6607d972014-02-10 06:54:18 -08001880void X86Mir2Lir::GenInstanceofCallingHelper(bool needs_access_check, bool type_known_final,
1881 bool type_known_abstract, bool use_declaring_class,
1882 bool can_assume_type_is_in_dex_cache,
1883 uint32_t type_idx, RegLocation rl_dest,
1884 RegLocation rl_src) {
1885 FlushAllRegs();
1886 // May generate a call - use explicit registers.
1887 LockCallTemps();
1888 LoadCurrMethodDirect(TargetReg(kArg1)); // kArg1 gets current Method*.
buzbee2700f7e2014-03-07 09:46:20 -08001889 RegStorage class_reg = TargetReg(kArg2); // kArg2 will hold the Class*.
Mark Mendell6607d972014-02-10 06:54:18 -08001890 // Reference must end up in kArg0.
1891 if (needs_access_check) {
1892 // Check we have access to type_idx and if not throw IllegalAccessError,
1893 // Caller function returns Class* in kArg0.
Ian Rogersdd7624d2014-03-14 17:43:00 -07001894 CallRuntimeHelperImm(QUICK_ENTRYPOINT_OFFSET(4, pInitializeTypeAndVerifyAccess),
Mark Mendell6607d972014-02-10 06:54:18 -08001895 type_idx, true);
1896 OpRegCopy(class_reg, TargetReg(kRet0));
1897 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
1898 } else if (use_declaring_class) {
1899 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
buzbee695d13a2014-04-19 13:32:20 -07001900 LoadRefDisp(TargetReg(kArg1), mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
buzbee2700f7e2014-03-07 09:46:20 -08001901 class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001902 } else {
1903 // Load dex cache entry into class_reg (kArg2).
1904 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
buzbee695d13a2014-04-19 13:32:20 -07001905 LoadRefDisp(TargetReg(kArg1), mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
buzbee2700f7e2014-03-07 09:46:20 -08001906 class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001907 int32_t offset_of_type =
1908 mirror::Array::DataOffset(sizeof(mirror::Class*)).Int32Value() + (sizeof(mirror::Class*)
1909 * type_idx);
buzbee695d13a2014-04-19 13:32:20 -07001910 LoadRefDisp(class_reg, offset_of_type, class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001911 if (!can_assume_type_is_in_dex_cache) {
1912 // Need to test presence of type in dex cache at runtime.
1913 LIR* hop_branch = OpCmpImmBranch(kCondNe, class_reg, 0, NULL);
1914 // Type is not resolved. Call out to helper, which will return resolved type in kRet0/kArg0.
Ian Rogersdd7624d2014-03-14 17:43:00 -07001915 CallRuntimeHelperImm(QUICK_ENTRYPOINT_OFFSET(4, pInitializeType), type_idx, true);
Mark Mendell6607d972014-02-10 06:54:18 -08001916 OpRegCopy(TargetReg(kArg2), TargetReg(kRet0)); // Align usage with fast path.
1917 LoadValueDirectFixed(rl_src, TargetReg(kArg0)); /* Reload Ref. */
1918 // Rejoin code paths
1919 LIR* hop_target = NewLIR0(kPseudoTargetLabel);
1920 hop_branch->target = hop_target;
1921 }
1922 }
1923 /* kArg0 is ref, kArg2 is class. If ref==null, use directly as bool result. */
1924 RegLocation rl_result = GetReturn(false);
1925
1926 // SETcc only works with EAX..EDX.
buzbee091cc402014-03-31 10:14:40 -07001927 DCHECK_LT(rl_result.reg.GetRegNum(), 4);
Mark Mendell6607d972014-02-10 06:54:18 -08001928
1929 // Is the class NULL?
1930 LIR* branch1 = OpCmpImmBranch(kCondEq, TargetReg(kArg0), 0, NULL);
1931
1932 /* Load object->klass_. */
1933 DCHECK_EQ(mirror::Object::ClassOffset().Int32Value(), 0);
buzbee695d13a2014-04-19 13:32:20 -07001934 LoadRefDisp(TargetReg(kArg0), mirror::Object::ClassOffset().Int32Value(), TargetReg(kArg1));
Mark Mendell6607d972014-02-10 06:54:18 -08001935 /* kArg0 is ref, kArg1 is ref->klass_, kArg2 is class. */
1936 LIR* branchover = nullptr;
1937 if (type_known_final) {
1938 // Ensure top 3 bytes of result are 0.
buzbee2700f7e2014-03-07 09:46:20 -08001939 LoadConstant(rl_result.reg, 0);
Mark Mendell6607d972014-02-10 06:54:18 -08001940 OpRegReg(kOpCmp, TargetReg(kArg1), TargetReg(kArg2));
1941 // Set the low byte of the result to 0 or 1 from the compare condition code.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001942 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondEq);
Mark Mendell6607d972014-02-10 06:54:18 -08001943 } else {
1944 if (!type_known_abstract) {
buzbee2700f7e2014-03-07 09:46:20 -08001945 LoadConstant(rl_result.reg, 1); // Assume result succeeds.
Mark Mendell6607d972014-02-10 06:54:18 -08001946 branchover = OpCmpBranch(kCondEq, TargetReg(kArg1), TargetReg(kArg2), NULL);
1947 }
1948 OpRegCopy(TargetReg(kArg0), TargetReg(kArg2));
Ian Rogersdd7624d2014-03-14 17:43:00 -07001949 OpThreadMem(kOpBlx, QUICK_ENTRYPOINT_OFFSET(4, pInstanceofNonTrivial));
Mark Mendell6607d972014-02-10 06:54:18 -08001950 }
1951 // TODO: only clobber when type isn't final?
1952 ClobberCallerSave();
1953 /* Branch targets here. */
1954 LIR* target = NewLIR0(kPseudoTargetLabel);
1955 StoreValue(rl_dest, rl_result);
1956 branch1->target = target;
1957 if (branchover != nullptr) {
1958 branchover->target = target;
1959 }
1960}
1961
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08001962void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
1963 RegLocation rl_lhs, RegLocation rl_rhs) {
1964 OpKind op = kOpBkpt;
1965 bool is_div_rem = false;
1966 bool unary = false;
1967 bool shift_op = false;
1968 bool is_two_addr = false;
1969 RegLocation rl_result;
1970 switch (opcode) {
1971 case Instruction::NEG_INT:
1972 op = kOpNeg;
1973 unary = true;
1974 break;
1975 case Instruction::NOT_INT:
1976 op = kOpMvn;
1977 unary = true;
1978 break;
1979 case Instruction::ADD_INT_2ADDR:
1980 is_two_addr = true;
1981 // Fallthrough
1982 case Instruction::ADD_INT:
1983 op = kOpAdd;
1984 break;
1985 case Instruction::SUB_INT_2ADDR:
1986 is_two_addr = true;
1987 // Fallthrough
1988 case Instruction::SUB_INT:
1989 op = kOpSub;
1990 break;
1991 case Instruction::MUL_INT_2ADDR:
1992 is_two_addr = true;
1993 // Fallthrough
1994 case Instruction::MUL_INT:
1995 op = kOpMul;
1996 break;
1997 case Instruction::DIV_INT_2ADDR:
1998 is_two_addr = true;
1999 // Fallthrough
2000 case Instruction::DIV_INT:
2001 op = kOpDiv;
2002 is_div_rem = true;
2003 break;
2004 /* NOTE: returns in kArg1 */
2005 case Instruction::REM_INT_2ADDR:
2006 is_two_addr = true;
2007 // Fallthrough
2008 case Instruction::REM_INT:
2009 op = kOpRem;
2010 is_div_rem = true;
2011 break;
2012 case Instruction::AND_INT_2ADDR:
2013 is_two_addr = true;
2014 // Fallthrough
2015 case Instruction::AND_INT:
2016 op = kOpAnd;
2017 break;
2018 case Instruction::OR_INT_2ADDR:
2019 is_two_addr = true;
2020 // Fallthrough
2021 case Instruction::OR_INT:
2022 op = kOpOr;
2023 break;
2024 case Instruction::XOR_INT_2ADDR:
2025 is_two_addr = true;
2026 // Fallthrough
2027 case Instruction::XOR_INT:
2028 op = kOpXor;
2029 break;
2030 case Instruction::SHL_INT_2ADDR:
2031 is_two_addr = true;
2032 // Fallthrough
2033 case Instruction::SHL_INT:
2034 shift_op = true;
2035 op = kOpLsl;
2036 break;
2037 case Instruction::SHR_INT_2ADDR:
2038 is_two_addr = true;
2039 // Fallthrough
2040 case Instruction::SHR_INT:
2041 shift_op = true;
2042 op = kOpAsr;
2043 break;
2044 case Instruction::USHR_INT_2ADDR:
2045 is_two_addr = true;
2046 // Fallthrough
2047 case Instruction::USHR_INT:
2048 shift_op = true;
2049 op = kOpLsr;
2050 break;
2051 default:
2052 LOG(FATAL) << "Invalid word arith op: " << opcode;
2053 }
2054
2055 // Can we convert to a two address instruction?
2056 if (!is_two_addr &&
2057 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
2058 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
2059 is_two_addr = true;
2060 }
2061
2062 // Get the div/rem stuff out of the way.
2063 if (is_div_rem) {
2064 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, true);
2065 StoreValue(rl_dest, rl_result);
2066 return;
2067 }
2068
2069 if (unary) {
2070 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2071 rl_result = UpdateLoc(rl_dest);
2072 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002073 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002074 } else {
2075 if (shift_op) {
2076 // X86 doesn't require masking and must use ECX.
buzbee2700f7e2014-03-07 09:46:20 -08002077 RegStorage t_reg = TargetReg(kCount); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002078 LoadValueDirectFixed(rl_rhs, t_reg);
2079 if (is_two_addr) {
2080 // Can we do this directly into memory?
2081 rl_result = UpdateLoc(rl_dest);
2082 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2083 if (rl_result.location != kLocPhysReg) {
2084 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08002085 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002086 FreeTemp(t_reg);
2087 return;
buzbee091cc402014-03-31 10:14:40 -07002088 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002089 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08002090 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002091 FreeTemp(t_reg);
2092 StoreFinalValue(rl_dest, rl_result);
2093 return;
2094 }
2095 }
2096 // Three address form, or we can't do directly.
2097 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2098 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002099 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002100 FreeTemp(t_reg);
2101 } else {
2102 // Multiply is 3 operand only (sort of).
2103 if (is_two_addr && op != kOpMul) {
2104 // Can we do this directly into memory?
2105 rl_result = UpdateLoc(rl_dest);
2106 if (rl_result.location == kLocPhysReg) {
Serguei Katkov366f8ae2014-04-15 16:55:26 +07002107 // Ensure res is in a core reg
2108 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002109 // Can we do this from memory directly?
2110 rl_rhs = UpdateLoc(rl_rhs);
2111 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08002112 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002113 StoreFinalValue(rl_dest, rl_result);
2114 return;
buzbee091cc402014-03-31 10:14:40 -07002115 } else if (!rl_rhs.reg.IsFloat()) {
buzbee2700f7e2014-03-07 09:46:20 -08002116 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002117 StoreFinalValue(rl_dest, rl_result);
2118 return;
2119 }
2120 }
2121 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2122 if (rl_result.location != kLocPhysReg) {
2123 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002124 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002125 return;
buzbee091cc402014-03-31 10:14:40 -07002126 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002127 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08002128 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002129 StoreFinalValue(rl_dest, rl_result);
2130 return;
2131 } else {
2132 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2133 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002134 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002135 }
2136 } else {
2137 // Try to use reg/memory instructions.
2138 rl_lhs = UpdateLoc(rl_lhs);
2139 rl_rhs = UpdateLoc(rl_rhs);
2140 // We can't optimize with FP registers.
2141 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
2142 // Something is difficult, so fall back to the standard case.
2143 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2144 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2145 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002146 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002147 } else {
2148 // We can optimize by moving to result and using memory operands.
2149 if (rl_rhs.location != kLocPhysReg) {
2150 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07002151 // We should be careful with order here
2152 // If rl_dest and rl_lhs points to the same VR we should load first
2153 // If the are different we should find a register first for dest
2154 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) == mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
2155 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2156 rl_result = EvalLoc(rl_dest, kCoreReg, true);
2157 } else {
2158 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002159 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07002160 }
buzbee2700f7e2014-03-07 09:46:20 -08002161 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002162 } else if (rl_lhs.location != kLocPhysReg) {
2163 // RHS is in a register; LHS is in memory.
2164 if (op != kOpSub) {
2165 // Force RHS into result and operate on memory.
2166 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002167 OpRegCopy(rl_result.reg, rl_rhs.reg);
2168 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002169 } else {
2170 // Subtraction isn't commutative.
2171 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2172 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2173 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002174 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002175 }
2176 } else {
2177 // Both are in registers.
2178 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2179 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2180 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002181 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002182 }
2183 }
2184 }
2185 }
2186 }
2187 StoreValue(rl_dest, rl_result);
2188}
2189
2190bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
2191 // If we have non-core registers, then we can't do good things.
buzbee091cc402014-03-31 10:14:40 -07002192 if (rl_lhs.location == kLocPhysReg && rl_lhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002193 return false;
2194 }
buzbee091cc402014-03-31 10:14:40 -07002195 if (rl_rhs.location == kLocPhysReg && rl_rhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002196 return false;
2197 }
2198
2199 // Everything will be fine :-).
2200 return true;
2201}
Brian Carlstrom7940e442013-07-12 13:46:57 -07002202} // namespace art