blob: 4446f4338eddc079529bcab51e96e1597c41c2a8 [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];
328 LIR* not_taken = &block_label_list_[bb->fall_through];
329 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800330 RegStorage low_reg = rl_src1.reg.GetLow();
331 RegStorage high_reg = rl_src1.reg.GetHigh();
Mark Mendell412d4f82013-12-18 13:32:36 -0800332
333 if (val == 0 && (ccode == kCondEq || ccode == kCondNe)) {
buzbee2700f7e2014-03-07 09:46:20 -0800334 RegStorage t_reg = AllocTemp();
Mark Mendell412d4f82013-12-18 13:32:36 -0800335 OpRegRegReg(kOpOr, t_reg, low_reg, high_reg);
336 FreeTemp(t_reg);
337 OpCondBranch(ccode, taken);
338 return;
339 }
340
341 OpRegImm(kOpCmp, high_reg, val_hi);
342 switch (ccode) {
343 case kCondEq:
344 case kCondNe:
345 OpCondBranch(kCondNe, (ccode == kCondEq) ? not_taken : taken);
346 break;
347 case kCondLt:
348 OpCondBranch(kCondLt, taken);
349 OpCondBranch(kCondGt, not_taken);
350 ccode = kCondUlt;
351 break;
352 case kCondLe:
353 OpCondBranch(kCondLt, taken);
354 OpCondBranch(kCondGt, not_taken);
355 ccode = kCondLs;
356 break;
357 case kCondGt:
358 OpCondBranch(kCondGt, taken);
359 OpCondBranch(kCondLt, not_taken);
360 ccode = kCondHi;
361 break;
362 case kCondGe:
363 OpCondBranch(kCondGt, taken);
364 OpCondBranch(kCondLt, not_taken);
365 ccode = kCondUge;
366 break;
367 default:
368 LOG(FATAL) << "Unexpected ccode: " << ccode;
369 }
370 OpCmpImmBranch(ccode, low_reg, val_lo, taken);
371}
372
Mark Mendell2bf31e62014-01-23 12:13:40 -0800373void X86Mir2Lir::CalculateMagicAndShift(int divisor, int& magic, int& shift) {
374 // It does not make sense to calculate magic and shift for zero divisor.
375 DCHECK_NE(divisor, 0);
376
377 /* According to H.S.Warren's Hacker's Delight Chapter 10 and
378 * T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
379 * The magic number M and shift S can be calculated in the following way:
380 * Let nc be the most positive value of numerator(n) such that nc = kd - 1,
381 * where divisor(d) >=2.
382 * Let nc be the most negative value of numerator(n) such that nc = kd + 1,
383 * where divisor(d) <= -2.
384 * Thus nc can be calculated like:
385 * nc = 2^31 + 2^31 % d - 1, where d >= 2
386 * nc = -2^31 + (2^31 + 1) % d, where d >= 2.
387 *
388 * So the shift p is the smallest p satisfying
389 * 2^p > nc * (d - 2^p % d), where d >= 2
390 * 2^p > nc * (d + 2^p % d), where d <= -2.
391 *
392 * the magic number M is calcuated by
393 * M = (2^p + d - 2^p % d) / d, where d >= 2
394 * M = (2^p - d - 2^p % d) / d, where d <= -2.
395 *
396 * Notice that p is always bigger than or equal to 32, so we just return 32-p as
397 * the shift number S.
398 */
399
400 int32_t p = 31;
401 const uint32_t two31 = 0x80000000U;
402
403 // Initialize the computations.
404 uint32_t abs_d = (divisor >= 0) ? divisor : -divisor;
405 uint32_t tmp = two31 + (static_cast<uint32_t>(divisor) >> 31);
406 uint32_t abs_nc = tmp - 1 - tmp % abs_d;
407 uint32_t quotient1 = two31 / abs_nc;
408 uint32_t remainder1 = two31 % abs_nc;
409 uint32_t quotient2 = two31 / abs_d;
410 uint32_t remainder2 = two31 % abs_d;
411
412 /*
413 * To avoid handling both positive and negative divisor, Hacker's Delight
414 * introduces a method to handle these 2 cases together to avoid duplication.
415 */
416 uint32_t delta;
417 do {
418 p++;
419 quotient1 = 2 * quotient1;
420 remainder1 = 2 * remainder1;
421 if (remainder1 >= abs_nc) {
422 quotient1++;
423 remainder1 = remainder1 - abs_nc;
424 }
425 quotient2 = 2 * quotient2;
426 remainder2 = 2 * remainder2;
427 if (remainder2 >= abs_d) {
428 quotient2++;
429 remainder2 = remainder2 - abs_d;
430 }
431 delta = abs_d - remainder2;
432 } while (quotient1 < delta || (quotient1 == delta && remainder1 == 0));
433
434 magic = (divisor > 0) ? (quotient2 + 1) : (-quotient2 - 1);
435 shift = p - 32;
436}
437
buzbee2700f7e2014-03-07 09:46:20 -0800438RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegStorage reg_lo, int lit, bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700439 LOG(FATAL) << "Unexpected use of GenDivRemLit for x86";
440 return rl_dest;
441}
442
Mark Mendell2bf31e62014-01-23 12:13:40 -0800443RegLocation X86Mir2Lir::GenDivRemLit(RegLocation rl_dest, RegLocation rl_src,
444 int imm, bool is_div) {
445 // Use a multiply (and fixup) to perform an int div/rem by a constant.
446
447 // We have to use fixed registers, so flush all the temps.
448 FlushAllRegs();
449 LockCallTemps(); // Prepare for explicit register usage.
450
451 // Assume that the result will be in EDX.
buzbee091cc402014-03-31 10:14:40 -0700452 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 -0800453
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700454 // handle div/rem by 1 special case.
455 if (imm == 1) {
Mark Mendell2bf31e62014-01-23 12:13:40 -0800456 if (is_div) {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700457 // x / 1 == x.
458 StoreValue(rl_result, rl_src);
459 } else {
460 // x % 1 == 0.
buzbee2700f7e2014-03-07 09:46:20 -0800461 LoadConstantNoClobber(rs_r0, 0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700462 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000463 rl_result.reg.SetReg(r0);
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700464 }
465 } else if (imm == -1) { // handle 0x80000000 / -1 special case.
466 if (is_div) {
467 LIR *minint_branch = 0;
buzbee2700f7e2014-03-07 09:46:20 -0800468 LoadValueDirectFixed(rl_src, rs_r0);
469 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800470 minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondEq);
471
472 // for x != MIN_INT, x / -1 == -x.
473 NewLIR1(kX86Neg32R, r0);
474
475 LIR* branch_around = NewLIR1(kX86Jmp8, 0);
476 // The target for cmp/jmp above.
477 minint_branch->target = NewLIR0(kPseudoTargetLabel);
478 // EAX already contains the right value (0x80000000),
479 branch_around->target = NewLIR0(kPseudoTargetLabel);
480 } else {
481 // x % -1 == 0.
buzbee2700f7e2014-03-07 09:46:20 -0800482 LoadConstantNoClobber(rs_r0, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800483 }
484 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000485 rl_result.reg.SetReg(r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800486 } else {
Alexei Zavjalov79aa4232014-02-13 13:55:50 +0700487 CHECK(imm <= -2 || imm >= 2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800488 // Use H.S.Warren's Hacker's Delight Chapter 10 and
489 // T,Grablund, P.L.Montogomery's Division by invariant integers using multiplication.
490 int magic, shift;
491 CalculateMagicAndShift(imm, magic, shift);
492
493 /*
494 * For imm >= 2,
495 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n > 0
496 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1, while n < 0.
497 * For imm <= -2,
498 * int(n/imm) = ceil(n/imm) = floor(M*n/2^S) +1 , while n > 0
499 * int(n/imm) = floor(n/imm) = floor(M*n/2^S), while n < 0.
500 * We implement this algorithm in the following way:
501 * 1. multiply magic number m and numerator n, get the higher 32bit result in EDX
502 * 2. if imm > 0 and magic < 0, add numerator to EDX
503 * if imm < 0 and magic > 0, sub numerator from EDX
504 * 3. if S !=0, SAR S bits for EDX
505 * 4. add 1 to EDX if EDX < 0
506 * 5. Thus, EDX is the quotient
507 */
508
509 // Numerator into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800510 RegStorage numerator_reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800511 if (!is_div || (imm > 0 && magic < 0) || (imm < 0 && magic > 0)) {
512 // We will need the value later.
513 if (rl_src.location == kLocPhysReg) {
514 // We can use it directly.
buzbee091cc402014-03-31 10:14:40 -0700515 DCHECK(rl_src.reg.GetReg() != rs_r0.GetReg() && rl_src.reg.GetReg() != rs_r2.GetReg());
buzbee2700f7e2014-03-07 09:46:20 -0800516 numerator_reg = rl_src.reg;
Mark Mendell2bf31e62014-01-23 12:13:40 -0800517 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800518 numerator_reg = rs_r1;
519 LoadValueDirectFixed(rl_src, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800520 }
buzbee2700f7e2014-03-07 09:46:20 -0800521 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800522 } else {
523 // Only need this once. Just put it into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800524 LoadValueDirectFixed(rl_src, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800525 }
526
527 // EDX = magic.
buzbee2700f7e2014-03-07 09:46:20 -0800528 LoadConstantNoClobber(rs_r2, magic);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800529
530 // EDX:EAX = magic & dividend.
buzbee091cc402014-03-31 10:14:40 -0700531 NewLIR1(kX86Imul32DaR, rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800532
533 if (imm > 0 && magic < 0) {
534 // Add numerator to EDX.
buzbee2700f7e2014-03-07 09:46:20 -0800535 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700536 NewLIR2(kX86Add32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800537 } else if (imm < 0 && magic > 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800538 DCHECK(numerator_reg.Valid());
buzbee091cc402014-03-31 10:14:40 -0700539 NewLIR2(kX86Sub32RR, rs_r2.GetReg(), numerator_reg.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800540 }
541
542 // Do we need the shift?
543 if (shift != 0) {
544 // Shift EDX by 'shift' bits.
buzbee091cc402014-03-31 10:14:40 -0700545 NewLIR2(kX86Sar32RI, rs_r2.GetReg(), shift);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800546 }
547
548 // Add 1 to EDX if EDX < 0.
549
550 // Move EDX to EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800551 OpRegCopy(rs_r0, rs_r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800552
553 // Move sign bit to bit 0, zeroing the rest.
buzbee091cc402014-03-31 10:14:40 -0700554 NewLIR2(kX86Shr32RI, rs_r2.GetReg(), 31);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800555
556 // EDX = EDX + EAX.
buzbee091cc402014-03-31 10:14:40 -0700557 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r0.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800558
559 // Quotient is in EDX.
560 if (!is_div) {
561 // We need to compute the remainder.
562 // Remainder is divisor - (quotient * imm).
buzbee2700f7e2014-03-07 09:46:20 -0800563 DCHECK(numerator_reg.Valid());
564 OpRegCopy(rs_r0, numerator_reg);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800565
566 // EAX = numerator * imm.
buzbee2700f7e2014-03-07 09:46:20 -0800567 OpRegRegImm(kOpMul, rs_r2, rs_r2, imm);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800568
569 // EDX -= EAX.
buzbee091cc402014-03-31 10:14:40 -0700570 NewLIR2(kX86Sub32RR, rs_r0.GetReg(), rs_r2.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800571
572 // For this case, return the result in EAX.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000573 rl_result.reg.SetReg(r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800574 }
575 }
576
577 return rl_result;
578}
579
buzbee2700f7e2014-03-07 09:46:20 -0800580RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegStorage reg_lo, RegStorage reg_hi,
581 bool is_div) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700582 LOG(FATAL) << "Unexpected use of GenDivRem for x86";
583 return rl_dest;
584}
585
Mark Mendell2bf31e62014-01-23 12:13:40 -0800586RegLocation X86Mir2Lir::GenDivRem(RegLocation rl_dest, RegLocation rl_src1,
587 RegLocation rl_src2, bool is_div, bool check_zero) {
588 // We have to use fixed registers, so flush all the temps.
589 FlushAllRegs();
590 LockCallTemps(); // Prepare for explicit register usage.
591
592 // Load LHS into EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800593 LoadValueDirectFixed(rl_src1, rs_r0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800594
595 // Load RHS into EBX.
buzbee2700f7e2014-03-07 09:46:20 -0800596 LoadValueDirectFixed(rl_src2, rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800597
598 // Copy LHS sign bit into EDX.
599 NewLIR0(kx86Cdq32Da);
600
601 if (check_zero) {
602 // Handle division by zero case.
Mingyao Yange643a172014-04-08 11:02:52 -0700603 GenDivZeroCheck(rs_r1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800604 }
605
606 // Have to catch 0x80000000/-1 case, or we will get an exception!
buzbee2700f7e2014-03-07 09:46:20 -0800607 OpRegImm(kOpCmp, rs_r1, -1);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800608 LIR *minus_one_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
609
610 // RHS is -1.
buzbee2700f7e2014-03-07 09:46:20 -0800611 OpRegImm(kOpCmp, rs_r0, 0x80000000);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800612 LIR * minint_branch = NewLIR2(kX86Jcc8, 0, kX86CondNe);
613
614 // In 0x80000000/-1 case.
615 if (!is_div) {
616 // For DIV, EAX is already right. For REM, we need EDX 0.
buzbee2700f7e2014-03-07 09:46:20 -0800617 LoadConstantNoClobber(rs_r2, 0);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800618 }
619 LIR* done = NewLIR1(kX86Jmp8, 0);
620
621 // Expected case.
622 minus_one_branch->target = NewLIR0(kPseudoTargetLabel);
623 minint_branch->target = minus_one_branch->target;
buzbee091cc402014-03-31 10:14:40 -0700624 NewLIR1(kX86Idivmod32DaR, rs_r1.GetReg());
Mark Mendell2bf31e62014-01-23 12:13:40 -0800625 done->target = NewLIR0(kPseudoTargetLabel);
626
627 // Result is in EAX for div and EDX for rem.
buzbee091cc402014-03-31 10:14:40 -0700628 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 -0800629 if (!is_div) {
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000630 rl_result.reg.SetReg(r2);
Mark Mendell2bf31e62014-01-23 12:13:40 -0800631 }
632 return rl_result;
633}
634
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700635bool X86Mir2Lir::GenInlinedMinMaxInt(CallInfo* info, bool is_min) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700636 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800637
638 // Get the two arguments to the invoke and place them in GP registers.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700639 RegLocation rl_src1 = info->args[0];
640 RegLocation rl_src2 = info->args[1];
641 rl_src1 = LoadValue(rl_src1, kCoreReg);
642 rl_src2 = LoadValue(rl_src2, kCoreReg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800643
Brian Carlstrom7940e442013-07-12 13:46:57 -0700644 RegLocation rl_dest = InlineTarget(info);
645 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800646
647 /*
648 * If the result register is the same as the second element, then we need to be careful.
649 * The reason is that the first copy will inadvertently clobber the second element with
650 * the first one thus yielding the wrong result. Thus we do a swap in that case.
651 */
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000652 if (rl_result.reg.GetReg() == rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800653 std::swap(rl_src1, rl_src2);
654 }
655
656 // Pick the first integer as min/max.
buzbee2700f7e2014-03-07 09:46:20 -0800657 OpRegCopy(rl_result.reg, rl_src1.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800658
659 // If the integers are both in the same register, then there is nothing else to do
660 // because they are equal and we have already moved one into the result.
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000661 if (rl_src1.reg.GetReg() != rl_src2.reg.GetReg()) {
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800662 // It is possible we didn't pick correctly so do the actual comparison now.
buzbee2700f7e2014-03-07 09:46:20 -0800663 OpRegReg(kOpCmp, rl_src1.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800664
665 // Conditionally move the other integer into the destination register.
666 ConditionCode condition_code = is_min ? kCondGt : kCondLt;
buzbee2700f7e2014-03-07 09:46:20 -0800667 OpCondRegReg(kOpCmov, condition_code, rl_result.reg, rl_src2.reg);
Razvan A Lupusorubd288c22013-12-20 17:27:23 -0800668 }
669
Brian Carlstrom7940e442013-07-12 13:46:57 -0700670 StoreValue(rl_dest, rl_result);
671 return true;
672}
673
Vladimir Markoe508a202013-11-04 15:24:22 +0000674bool X86Mir2Lir::GenInlinedPeek(CallInfo* info, OpSize size) {
675 RegLocation rl_src_address = info->args[0]; // long address
buzbee2700f7e2014-03-07 09:46:20 -0800676 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[1]
buzbee695d13a2014-04-19 13:32:20 -0700677 RegLocation rl_dest = size == k64 ? InlineTargetWide(info) : InlineTarget(info);
Vladimir Markoe508a202013-11-04 15:24:22 +0000678 RegLocation rl_address = LoadValue(rl_src_address, kCoreReg);
679 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee695d13a2014-04-19 13:32:20 -0700680 if (size == k64) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000681 // Unaligned access is allowed on x86.
buzbee2700f7e2014-03-07 09:46:20 -0800682 LoadBaseDispWide(rl_address.reg, 0, rl_result.reg, INVALID_SREG);
Vladimir Markoe508a202013-11-04 15:24:22 +0000683 StoreValueWide(rl_dest, rl_result);
684 } else {
buzbee695d13a2014-04-19 13:32:20 -0700685 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
Vladimir Markoe508a202013-11-04 15:24:22 +0000686 // Unaligned access is allowed on x86.
buzbee2700f7e2014-03-07 09:46:20 -0800687 LoadBaseDisp(rl_address.reg, 0, rl_result.reg, size, INVALID_SREG);
Vladimir Markoe508a202013-11-04 15:24:22 +0000688 StoreValue(rl_dest, rl_result);
689 }
690 return true;
691}
692
693bool X86Mir2Lir::GenInlinedPoke(CallInfo* info, OpSize size) {
694 RegLocation rl_src_address = info->args[0]; // long address
buzbee2700f7e2014-03-07 09:46:20 -0800695 rl_src_address = NarrowRegLoc(rl_src_address); // ignore high half in info->args[1]
Vladimir Markoe508a202013-11-04 15:24:22 +0000696 RegLocation rl_src_value = info->args[2]; // [size] value
697 RegLocation rl_address = LoadValue(rl_src_address, kCoreReg);
buzbee695d13a2014-04-19 13:32:20 -0700698 if (size == k64) {
Vladimir Markoe508a202013-11-04 15:24:22 +0000699 // Unaligned access is allowed on x86.
700 RegLocation rl_value = LoadValueWide(rl_src_value, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800701 StoreBaseDispWide(rl_address.reg, 0, rl_value.reg);
Vladimir Markoe508a202013-11-04 15:24:22 +0000702 } else {
buzbee695d13a2014-04-19 13:32:20 -0700703 DCHECK(size == kSignedByte || size == kSignedHalf || size == k32);
Vladimir Markoe508a202013-11-04 15:24:22 +0000704 // Unaligned access is allowed on x86.
705 RegLocation rl_value = LoadValue(rl_src_value, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800706 StoreBaseDisp(rl_address.reg, 0, rl_value.reg, size);
Vladimir Markoe508a202013-11-04 15:24:22 +0000707 }
708 return true;
709}
710
buzbee2700f7e2014-03-07 09:46:20 -0800711void X86Mir2Lir::OpLea(RegStorage r_base, RegStorage reg1, RegStorage reg2, int scale, int offset) {
712 NewLIR5(kX86Lea32RA, r_base.GetReg(), reg1.GetReg(), reg2.GetReg(), scale, offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700713}
714
Ian Rogersdd7624d2014-03-14 17:43:00 -0700715void X86Mir2Lir::OpTlsCmp(ThreadOffset<4> offset, int val) {
Ian Rogers468532e2013-08-05 10:56:33 -0700716 NewLIR2(kX86Cmp16TI8, offset.Int32Value(), val);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700717}
718
buzbee2700f7e2014-03-07 09:46:20 -0800719static bool IsInReg(X86Mir2Lir *pMir2Lir, const RegLocation &rl, RegStorage reg) {
720 return rl.reg.Valid() && rl.reg.GetReg() == reg.GetReg() && (pMir2Lir->IsLive(reg) || rl.home);
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700721}
722
Vladimir Marko1c282e22013-11-21 14:49:47 +0000723bool X86Mir2Lir::GenInlinedCas(CallInfo* info, bool is_long, bool is_object) {
Dmitry Petrochenko6a58cb12014-04-02 17:27:59 +0700724 DCHECK(cu_->instruction_set == kX86 || cu_->instruction_set == kX86_64);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000725 // Unused - RegLocation rl_src_unsafe = info->args[0];
726 RegLocation rl_src_obj = info->args[1]; // Object - known non-null
727 RegLocation rl_src_offset = info->args[2]; // long low
buzbee2700f7e2014-03-07 09:46:20 -0800728 rl_src_offset = NarrowRegLoc(rl_src_offset); // ignore high half in info->args[3]
Vladimir Markoc29bb612013-11-27 16:47:25 +0000729 RegLocation rl_src_expected = info->args[4]; // int, long or Object
730 // If is_long, high half is in info->args[5]
731 RegLocation rl_src_new_value = info->args[is_long ? 6 : 5]; // int, long or Object
732 // If is_long, high half is in info->args[7]
733
734 if (is_long) {
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700735 // TODO: avoid unnecessary loads of SI and DI when the values are in registers.
736 // TODO: CFI support.
Vladimir Marko70b797d2013-12-03 15:25:24 +0000737 FlushAllRegs();
738 LockCallTemps();
buzbee091cc402014-03-31 10:14:40 -0700739 RegStorage r_tmp1 = RegStorage::MakeRegPair(rs_rAX, rs_rDX);
740 RegStorage r_tmp2 = RegStorage::MakeRegPair(rs_rBX, rs_rCX);
buzbee2700f7e2014-03-07 09:46:20 -0800741 LoadValueDirectWideFixed(rl_src_expected, r_tmp1);
742 LoadValueDirectWideFixed(rl_src_new_value, r_tmp2);
buzbee091cc402014-03-31 10:14:40 -0700743 NewLIR1(kX86Push32R, rs_rDI.GetReg());
744 MarkTemp(rs_rDI);
745 LockTemp(rs_rDI);
746 NewLIR1(kX86Push32R, rs_rSI.GetReg());
747 MarkTemp(rs_rSI);
748 LockTemp(rs_rSI);
Vladimir Markoa6fd8ba2013-12-13 10:53:49 +0000749 const int push_offset = 4 /* push edi */ + 4 /* push esi */;
buzbee2700f7e2014-03-07 09:46:20 -0800750 int srcObjSp = IsInReg(this, rl_src_obj, rs_rSI) ? 0
751 : (IsInReg(this, rl_src_obj, rs_rDI) ? 4
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700752 : (SRegOffset(rl_src_obj.s_reg_low) + push_offset));
buzbee695d13a2014-04-19 13:32:20 -0700753 // FIXME: needs 64-bit update.
buzbee2700f7e2014-03-07 09:46:20 -0800754 LoadWordDisp(TargetReg(kSp), srcObjSp, rs_rDI);
755 int srcOffsetSp = IsInReg(this, rl_src_offset, rs_rSI) ? 0
756 : (IsInReg(this, rl_src_offset, rs_rDI) ? 4
Yevgeny Rouband3a2dfa2014-03-18 15:55:16 +0700757 : (SRegOffset(rl_src_offset.s_reg_low) + push_offset));
buzbee2700f7e2014-03-07 09:46:20 -0800758 LoadWordDisp(TargetReg(kSp), srcOffsetSp, rs_rSI);
buzbee091cc402014-03-31 10:14:40 -0700759 NewLIR4(kX86LockCmpxchg8bA, rs_rDI.GetReg(), rs_rSI.GetReg(), 0, 0);
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800760
761 // After a store we need to insert barrier in case of potential load. Since the
762 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
763 GenMemBarrier(kStoreLoad);
764
buzbee091cc402014-03-31 10:14:40 -0700765 FreeTemp(rs_rSI);
766 UnmarkTemp(rs_rSI);
767 NewLIR1(kX86Pop32R, rs_rSI.GetReg());
768 FreeTemp(rs_rDI);
769 UnmarkTemp(rs_rDI);
770 NewLIR1(kX86Pop32R, rs_rDI.GetReg());
Vladimir Marko70b797d2013-12-03 15:25:24 +0000771 FreeCallTemps();
Vladimir Markoc29bb612013-11-27 16:47:25 +0000772 } else {
773 // EAX must hold expected for CMPXCHG. Neither rl_new_value, nor r_ptr may be in EAX.
buzbee2700f7e2014-03-07 09:46:20 -0800774 FlushReg(rs_r0);
buzbee091cc402014-03-31 10:14:40 -0700775 Clobber(rs_r0);
buzbee2700f7e2014-03-07 09:46:20 -0800776 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000777
Vladimir Markoc29bb612013-11-27 16:47:25 +0000778 RegLocation rl_object = LoadValue(rl_src_obj, kCoreReg);
779 RegLocation rl_new_value = LoadValue(rl_src_new_value, kCoreReg);
780
781 if (is_object && !mir_graph_->IsConstantNullRef(rl_new_value)) {
782 // Mark card for object assuming new value is stored.
buzbee091cc402014-03-31 10:14:40 -0700783 FreeTemp(rs_r0); // Temporarily release EAX for MarkGCCard().
buzbee2700f7e2014-03-07 09:46:20 -0800784 MarkGCCard(rl_new_value.reg, rl_object.reg);
buzbee091cc402014-03-31 10:14:40 -0700785 LockTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000786 }
787
788 RegLocation rl_offset = LoadValue(rl_src_offset, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -0800789 LoadValueDirect(rl_src_expected, rs_r0);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000790 NewLIR5(kX86LockCmpxchgAR, rl_object.reg.GetReg(), rl_offset.reg.GetReg(), 0, 0, rl_new_value.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +0000791
Razvan A Lupusoru99ad7232014-02-25 17:41:08 -0800792 // After a store we need to insert barrier in case of potential load. Since the
793 // locked cmpxchg has full barrier semantics, only a scheduling barrier will be generated.
794 GenMemBarrier(kStoreLoad);
795
buzbee091cc402014-03-31 10:14:40 -0700796 FreeTemp(rs_r0);
Vladimir Markoc29bb612013-11-27 16:47:25 +0000797 }
798
799 // Convert ZF to boolean
800 RegLocation rl_dest = InlineTarget(info); // boolean place for result
801 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000802 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondZ);
803 NewLIR2(kX86Movzx8RR, rl_result.reg.GetReg(), rl_result.reg.GetReg());
Vladimir Markoc29bb612013-11-27 16:47:25 +0000804 StoreValue(rl_dest, rl_result);
805 return true;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700806}
807
buzbee2700f7e2014-03-07 09:46:20 -0800808LIR* X86Mir2Lir::OpPcRelLoad(RegStorage reg, LIR* target) {
Mark Mendell55d0eac2014-02-06 11:02:52 -0800809 CHECK(base_of_code_ != nullptr);
810
811 // Address the start of the method
812 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
813 LoadValueDirectFixed(rl_method, reg);
814 store_method_addr_used_ = true;
815
816 // Load the proper value from the literal area.
817 // We don't know the proper offset for the value, so pick one that will force
818 // 4 byte offset. We will fix this up in the assembler later to have the right
819 // value.
buzbee2700f7e2014-03-07 09:46:20 -0800820 LIR *res = RawLIR(current_dalvik_offset_, kX86Mov32RM, reg.GetReg(), reg.GetReg(), 256,
821 0, 0, target);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800822 res->target = target;
823 res->flags.fixup = kFixupLoad;
824 SetMemRefType(res, true, kLiteral);
825 store_method_addr_used_ = true;
826 return res;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700827}
828
buzbee2700f7e2014-03-07 09:46:20 -0800829LIR* X86Mir2Lir::OpVldm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700830 LOG(FATAL) << "Unexpected use of OpVldm for x86";
831 return NULL;
832}
833
buzbee2700f7e2014-03-07 09:46:20 -0800834LIR* X86Mir2Lir::OpVstm(RegStorage r_base, int count) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700835 LOG(FATAL) << "Unexpected use of OpVstm for x86";
836 return NULL;
837}
838
839void X86Mir2Lir::GenMultiplyByTwoBitMultiplier(RegLocation rl_src,
840 RegLocation rl_result, int lit,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700841 int first_bit, int second_bit) {
buzbee2700f7e2014-03-07 09:46:20 -0800842 RegStorage t_reg = AllocTemp();
843 OpRegRegImm(kOpLsl, t_reg, rl_src.reg, second_bit - first_bit);
844 OpRegRegReg(kOpAdd, rl_result.reg, rl_src.reg, t_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700845 FreeTemp(t_reg);
846 if (first_bit != 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800847 OpRegRegImm(kOpLsl, rl_result.reg, rl_result.reg, first_bit);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700848 }
849}
850
Mingyao Yange643a172014-04-08 11:02:52 -0700851void X86Mir2Lir::GenDivZeroCheckWide(RegStorage reg) {
buzbee2700f7e2014-03-07 09:46:20 -0800852 DCHECK(reg.IsPair()); // TODO: allow 64BitSolo.
853 // We are not supposed to clobber the incoming storage, so allocate a temporary.
854 RegStorage t_reg = AllocTemp();
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800855
856 // 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 -0800857 OpRegRegReg(kOpOr, t_reg, reg.GetLow(), reg.GetHigh());
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800858
859 // In case of zero, throw ArithmeticException.
Mingyao Yange643a172014-04-08 11:02:52 -0700860 GenDivZeroCheck(kCondEq);
Razvan A Lupusoru090dd442013-12-20 14:35:03 -0800861
862 // The temp is no longer needed so free it at this time.
Brian Carlstrom7940e442013-07-12 13:46:57 -0700863 FreeTemp(t_reg);
864}
865
Mingyao Yang80365d92014-04-18 12:10:58 -0700866void X86Mir2Lir::GenArrayBoundsCheck(RegStorage index,
867 RegStorage array_base,
868 int len_offset) {
869 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
870 public:
871 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
872 RegStorage index, RegStorage array_base, int32_t len_offset)
873 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
874 index_(index), array_base_(array_base), len_offset_(len_offset) {
875 }
876
877 void Compile() OVERRIDE {
878 m2l_->ResetRegPool();
879 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -0700880 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -0700881
882 RegStorage new_index = index_;
883 // Move index out of kArg1, either directly to kArg0, or to kArg2.
884 if (index_.GetReg() == m2l_->TargetReg(kArg1).GetReg()) {
885 if (array_base_.GetReg() == m2l_->TargetReg(kArg0).GetReg()) {
886 m2l_->OpRegCopy(m2l_->TargetReg(kArg2), index_);
887 new_index = m2l_->TargetReg(kArg2);
888 } else {
889 m2l_->OpRegCopy(m2l_->TargetReg(kArg0), index_);
890 new_index = m2l_->TargetReg(kArg0);
891 }
892 }
893 // Load array length to kArg1.
894 m2l_->OpRegMem(kOpMov, m2l_->TargetReg(kArg1), array_base_, len_offset_);
895 m2l_->CallRuntimeHelperRegReg(QUICK_ENTRYPOINT_OFFSET(4, pThrowArrayBounds),
896 new_index, m2l_->TargetReg(kArg1), true);
897 }
898
899 private:
900 const RegStorage index_;
901 const RegStorage array_base_;
902 const int32_t len_offset_;
903 };
904
905 OpRegMem(kOpCmp, index, array_base, len_offset);
906 LIR* branch = OpCondBranch(kCondUge, nullptr);
907 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
908 index, array_base, len_offset));
909}
910
911void X86Mir2Lir::GenArrayBoundsCheck(int32_t index,
912 RegStorage array_base,
913 int32_t len_offset) {
914 class ArrayBoundsCheckSlowPath : public Mir2Lir::LIRSlowPath {
915 public:
916 ArrayBoundsCheckSlowPath(Mir2Lir* m2l, LIR* branch,
917 int32_t index, RegStorage array_base, int32_t len_offset)
918 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch),
919 index_(index), array_base_(array_base), len_offset_(len_offset) {
920 }
921
922 void Compile() OVERRIDE {
923 m2l_->ResetRegPool();
924 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -0700925 GenerateTargetLabel(kPseudoThrowTarget);
Mingyao Yang80365d92014-04-18 12:10:58 -0700926
927 // Load array length to kArg1.
928 m2l_->OpRegMem(kOpMov, m2l_->TargetReg(kArg1), array_base_, len_offset_);
929 m2l_->LoadConstant(m2l_->TargetReg(kArg0), index_);
930 m2l_->CallRuntimeHelperRegReg(QUICK_ENTRYPOINT_OFFSET(4, pThrowArrayBounds),
931 m2l_->TargetReg(kArg0), m2l_->TargetReg(kArg1), true);
932 }
933
934 private:
935 const int32_t index_;
936 const RegStorage array_base_;
937 const int32_t len_offset_;
938 };
939
940 NewLIR3(IS_SIMM8(index) ? kX86Cmp32MI8 : kX86Cmp32MI, array_base.GetReg(), len_offset, index);
941 LIR* branch = OpCondBranch(kCondLs, nullptr);
942 AddSlowPath(new (arena_) ArrayBoundsCheckSlowPath(this, branch,
943 index, array_base, len_offset));
944}
945
Brian Carlstrom7940e442013-07-12 13:46:57 -0700946// Test suspend flag, return target of taken suspend branch
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700947LIR* X86Mir2Lir::OpTestSuspend(LIR* target) {
Ian Rogersdd7624d2014-03-14 17:43:00 -0700948 OpTlsCmp(Thread::ThreadFlagsOffset<4>(), 0);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700949 return OpCondBranch((target == NULL) ? kCondNe : kCondEq, target);
950}
951
952// Decrement register and branch on condition
buzbee2700f7e2014-03-07 09:46:20 -0800953LIR* X86Mir2Lir::OpDecAndBranch(ConditionCode c_code, RegStorage reg, LIR* target) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700954 OpRegImm(kOpSub, reg, 1);
Yixin Shoua0dac3e2014-01-23 05:01:22 -0800955 return OpCondBranch(c_code, target);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700956}
957
buzbee11b63d12013-08-27 07:34:17 -0700958bool X86Mir2Lir::SmallLiteralDivRem(Instruction::Code dalvik_opcode, bool is_div,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700959 RegLocation rl_src, RegLocation rl_dest, int lit) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700960 LOG(FATAL) << "Unexpected use of smallLiteralDive in x86";
961 return false;
962}
963
Ian Rogerse2143c02014-03-28 08:47:16 -0700964bool X86Mir2Lir::EasyMultiply(RegLocation rl_src, RegLocation rl_dest, int lit) {
965 LOG(FATAL) << "Unexpected use of easyMultiply in x86";
966 return false;
967}
968
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700969LIR* X86Mir2Lir::OpIT(ConditionCode cond, const char* guide) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700970 LOG(FATAL) << "Unexpected use of OpIT in x86";
971 return NULL;
972}
973
Dave Allison3da67a52014-04-02 17:03:45 -0700974void X86Mir2Lir::OpEndIT(LIR* it) {
975 LOG(FATAL) << "Unexpected use of OpEndIT in x86";
976}
977
buzbee2700f7e2014-03-07 09:46:20 -0800978void X86Mir2Lir::GenImulRegImm(RegStorage dest, RegStorage src, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -0800979 switch (val) {
980 case 0:
buzbee2700f7e2014-03-07 09:46:20 -0800981 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -0800982 break;
983 case 1:
984 OpRegCopy(dest, src);
985 break;
986 default:
987 OpRegRegImm(kOpMul, dest, src, val);
988 break;
989 }
990}
991
buzbee2700f7e2014-03-07 09:46:20 -0800992void X86Mir2Lir::GenImulMemImm(RegStorage dest, int sreg, int displacement, int val) {
Mark Mendell4708dcd2014-01-22 09:05:18 -0800993 LIR *m;
994 switch (val) {
995 case 0:
buzbee2700f7e2014-03-07 09:46:20 -0800996 NewLIR2(kX86Xor32RR, dest.GetReg(), dest.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -0800997 break;
998 case 1:
buzbee695d13a2014-04-19 13:32:20 -0700999 LoadBaseDisp(rs_rX86_SP, displacement, dest, k32, sreg);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001000 break;
1001 default:
buzbee091cc402014-03-31 10:14:40 -07001002 m = NewLIR4(IS_SIMM8(val) ? kX86Imul32RMI8 : kX86Imul32RMI, dest.GetReg(),
1003 rs_rX86_SP.GetReg(), displacement, val);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001004 AnnotateDalvikRegAccess(m, displacement >> 2, true /* is_load */, true /* is_64bit */);
1005 break;
1006 }
1007}
1008
Mark Mendelle02d48f2014-01-15 11:19:23 -08001009void X86Mir2Lir::GenMulLong(Instruction::Code, RegLocation rl_dest, RegLocation rl_src1,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001010 RegLocation rl_src2) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001011 if (rl_src1.is_const) {
1012 std::swap(rl_src1, rl_src2);
1013 }
1014 // Are we multiplying by a constant?
1015 if (rl_src2.is_const) {
1016 // Do special compare/branch against simple const operand
1017 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
1018 if (val == 0) {
1019 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001020 OpRegReg(kOpXor, rl_result.reg.GetLow(), rl_result.reg.GetLow());
1021 OpRegReg(kOpXor, rl_result.reg.GetHigh(), rl_result.reg.GetHigh());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001022 StoreValueWide(rl_dest, rl_result);
1023 return;
1024 } else if (val == 1) {
Mark Mendell4708dcd2014-01-22 09:05:18 -08001025 StoreValueWide(rl_dest, rl_src1);
1026 return;
1027 } else if (val == 2) {
1028 GenAddLong(Instruction::ADD_LONG, rl_dest, rl_src1, rl_src1);
1029 return;
1030 } else if (IsPowerOfTwo(val)) {
1031 int shift_amount = LowestSetBit(val);
1032 if (!BadOverlap(rl_src1, rl_dest)) {
1033 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1034 RegLocation rl_result = GenShiftImmOpLong(Instruction::SHL_LONG, rl_dest,
1035 rl_src1, shift_amount);
1036 StoreValueWide(rl_dest, rl_result);
1037 return;
1038 }
1039 }
1040
1041 // Okay, just bite the bullet and do it.
1042 int32_t val_lo = Low32Bits(val);
1043 int32_t val_hi = High32Bits(val);
1044 FlushAllRegs();
1045 LockCallTemps(); // Prepare for explicit register usage.
1046 rl_src1 = UpdateLocWide(rl_src1);
1047 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1048 int displacement = SRegOffset(rl_src1.s_reg_low);
1049
1050 // ECX <- 1H * 2L
1051 // EAX <- 1L * 2H
1052 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001053 GenImulRegImm(rs_r1, rl_src1.reg.GetHigh(), val_lo);
1054 GenImulRegImm(rs_r0, rl_src1.reg.GetLow(), val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001055 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001056 GenImulMemImm(rs_r1, GetSRegHi(rl_src1.s_reg_low), displacement + HIWORD_OFFSET, val_lo);
1057 GenImulMemImm(rs_r0, rl_src1.s_reg_low, displacement + LOWORD_OFFSET, val_hi);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001058 }
1059
1060 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001061 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001062
1063 // EAX <- 2L
buzbee2700f7e2014-03-07 09:46:20 -08001064 LoadConstantNoClobber(rs_r0, val_lo);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001065
1066 // EDX:EAX <- 2L * 1L (double precision)
1067 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001068 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001069 } else {
buzbee091cc402014-03-31 10:14:40 -07001070 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001071 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1072 true /* is_load */, true /* is_64bit */);
1073 }
1074
1075 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001076 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001077
1078 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001079 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
1080 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001081 StoreValueWide(rl_dest, rl_result);
1082 return;
1083 }
1084
1085 // Nope. Do it the hard way
Mark Mendellde99bba2014-02-14 12:15:02 -08001086 // Check for V*V. We can eliminate a multiply in that case, as 2L*1H == 2H*1L.
1087 bool is_square = mir_graph_->SRegToVReg(rl_src1.s_reg_low) ==
1088 mir_graph_->SRegToVReg(rl_src2.s_reg_low);
1089
Mark Mendell4708dcd2014-01-22 09:05:18 -08001090 FlushAllRegs();
1091 LockCallTemps(); // Prepare for explicit register usage.
1092 rl_src1 = UpdateLocWide(rl_src1);
1093 rl_src2 = UpdateLocWide(rl_src2);
1094
1095 // At this point, the VRs are in their home locations.
1096 bool src1_in_reg = rl_src1.location == kLocPhysReg;
1097 bool src2_in_reg = rl_src2.location == kLocPhysReg;
1098
1099 // ECX <- 1H
1100 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001101 NewLIR2(kX86Mov32RR, rs_r1.GetReg(), rl_src1.reg.GetHighReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001102 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001103 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src1.s_reg_low) + HIWORD_OFFSET, rs_r1,
buzbee695d13a2014-04-19 13:32:20 -07001104 k32, GetSRegHi(rl_src1.s_reg_low));
Mark Mendell4708dcd2014-01-22 09:05:18 -08001105 }
1106
Mark Mendellde99bba2014-02-14 12:15:02 -08001107 if (is_square) {
1108 // Take advantage of the fact that the values are the same.
1109 // ECX <- ECX * 2L (1H * 2L)
1110 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001111 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001112 } else {
1113 int displacement = SRegOffset(rl_src2.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001114 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
1115 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001116 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1117 true /* is_load */, true /* is_64bit */);
1118 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001119
Mark Mendellde99bba2014-02-14 12:15:02 -08001120 // ECX <- 2*ECX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001121 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001122 } else {
Mark Mendellde99bba2014-02-14 12:15:02 -08001123 // EAX <- 2H
1124 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001125 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetHighReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001126 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001127 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + HIWORD_OFFSET, rs_r0,
buzbee695d13a2014-04-19 13:32:20 -07001128 k32, GetSRegHi(rl_src2.s_reg_low));
Mark Mendellde99bba2014-02-14 12:15:02 -08001129 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001130
Mark Mendellde99bba2014-02-14 12:15:02 -08001131 // EAX <- EAX * 1L (2H * 1L)
1132 if (src1_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001133 NewLIR2(kX86Imul32RR, rs_r0.GetReg(), rl_src1.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001134 } else {
1135 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001136 LIR *m = NewLIR3(kX86Imul32RM, rs_r0.GetReg(), rs_rX86_SP.GetReg(),
1137 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001138 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1139 true /* is_load */, true /* is_64bit */);
1140 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001141
Mark Mendellde99bba2014-02-14 12:15:02 -08001142 // ECX <- ECX * 2L (1H * 2L)
1143 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001144 NewLIR2(kX86Imul32RR, rs_r1.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001145 } else {
1146 int displacement = SRegOffset(rl_src2.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001147 LIR *m = NewLIR3(kX86Imul32RM, rs_r1.GetReg(), rs_rX86_SP.GetReg(),
1148 displacement + LOWORD_OFFSET);
Mark Mendellde99bba2014-02-14 12:15:02 -08001149 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1150 true /* is_load */, true /* is_64bit */);
1151 }
1152
1153 // ECX <- ECX + EAX (2H * 1L) + (1H * 2L)
buzbee091cc402014-03-31 10:14:40 -07001154 NewLIR2(kX86Add32RR, rs_r1.GetReg(), rs_r0.GetReg());
Mark Mendellde99bba2014-02-14 12:15:02 -08001155 }
Mark Mendell4708dcd2014-01-22 09:05:18 -08001156
1157 // EAX <- 2L
1158 if (src2_in_reg) {
buzbee091cc402014-03-31 10:14:40 -07001159 NewLIR2(kX86Mov32RR, rs_r0.GetReg(), rl_src2.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001160 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001161 LoadBaseDisp(rs_rX86_SP, SRegOffset(rl_src2.s_reg_low) + LOWORD_OFFSET, rs_r0,
buzbee695d13a2014-04-19 13:32:20 -07001162 k32, rl_src2.s_reg_low);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001163 }
1164
1165 // EDX:EAX <- 2L * 1L (double precision)
1166 if (src1_in_reg) {
buzbee2700f7e2014-03-07 09:46:20 -08001167 NewLIR1(kX86Mul32DaR, rl_src1.reg.GetLowReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001168 } else {
1169 int displacement = SRegOffset(rl_src1.s_reg_low);
buzbee091cc402014-03-31 10:14:40 -07001170 LIR *m = NewLIR2(kX86Mul32DaM, rs_rX86_SP.GetReg(), displacement + LOWORD_OFFSET);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001171 AnnotateDalvikRegAccess(m, (displacement + LOWORD_OFFSET) >> 2,
1172 true /* is_load */, true /* is_64bit */);
1173 }
1174
1175 // EDX <- EDX + ECX (add high words)
buzbee091cc402014-03-31 10:14:40 -07001176 NewLIR2(kX86Add32RR, rs_r2.GetReg(), rs_r1.GetReg());
Mark Mendell4708dcd2014-01-22 09:05:18 -08001177
1178 // Result is EDX:EAX
buzbee091cc402014-03-31 10:14:40 -07001179 RegLocation rl_result = {kLocPhysReg, 1, 0, 0, 0, 0, 0, 0, 1,
buzbee2700f7e2014-03-07 09:46:20 -08001180 RegStorage::MakeRegPair(rs_r0, rs_r2), INVALID_SREG, INVALID_SREG};
Mark Mendell4708dcd2014-01-22 09:05:18 -08001181 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001182}
Mark Mendelle02d48f2014-01-15 11:19:23 -08001183
1184void X86Mir2Lir::GenLongRegOrMemOp(RegLocation rl_dest, RegLocation rl_src,
1185 Instruction::Code op) {
1186 DCHECK_EQ(rl_dest.location, kLocPhysReg);
1187 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
1188 if (rl_src.location == kLocPhysReg) {
1189 // Both operands are in registers.
Serguei Katkovab5545f2014-03-25 10:51:15 +07001190 // But we must ensure that rl_src is in pair
1191 rl_src = EvalLocWide(rl_src, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001192 if (rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001193 // The registers are the same, so we would clobber it before the use.
buzbee2700f7e2014-03-07 09:46:20 -08001194 RegStorage temp_reg = AllocTemp();
1195 OpRegCopy(temp_reg, rl_dest.reg);
1196 rl_src.reg.SetHighReg(temp_reg.GetReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001197 }
buzbee2700f7e2014-03-07 09:46:20 -08001198 NewLIR2(x86op, rl_dest.reg.GetLowReg(), rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001199
1200 x86op = GetOpcode(op, rl_dest, rl_src, true);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001201 NewLIR2(x86op, rl_dest.reg.GetHighReg(), rl_src.reg.GetHighReg());
buzbee2700f7e2014-03-07 09:46:20 -08001202 FreeTemp(rl_src.reg);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001203 return;
1204 }
1205
1206 // RHS is in memory.
1207 DCHECK((rl_src.location == kLocDalvikFrame) ||
1208 (rl_src.location == kLocCompilerTemp));
buzbee2700f7e2014-03-07 09:46:20 -08001209 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001210 int displacement = SRegOffset(rl_src.s_reg_low);
1211
buzbee2700f7e2014-03-07 09:46:20 -08001212 LIR *lir = NewLIR3(x86op, rl_dest.reg.GetLowReg(), r_base, displacement + LOWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001213 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
1214 true /* is_load */, true /* is64bit */);
1215 x86op = GetOpcode(op, rl_dest, rl_src, true);
buzbee2700f7e2014-03-07 09:46:20 -08001216 lir = NewLIR3(x86op, rl_dest.reg.GetHighReg(), r_base, displacement + HIWORD_OFFSET);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001217 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
1218 true /* is_load */, true /* is64bit */);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001219}
1220
Mark Mendelle02d48f2014-01-15 11:19:23 -08001221void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
1222 rl_dest = UpdateLocWide(rl_dest);
1223 if (rl_dest.location == kLocPhysReg) {
1224 // Ensure we are in a register pair
1225 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1226
1227 rl_src = UpdateLocWide(rl_src);
1228 GenLongRegOrMemOp(rl_result, rl_src, op);
1229 StoreFinalValueWide(rl_dest, rl_result);
1230 return;
1231 }
1232
1233 // It wasn't in registers, so it better be in memory.
1234 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1235 (rl_dest.location == kLocCompilerTemp));
1236 rl_src = LoadValueWide(rl_src, kCoreReg);
1237
1238 // Operate directly into memory.
1239 X86OpCode x86op = GetOpcode(op, rl_dest, rl_src, false);
buzbee2700f7e2014-03-07 09:46:20 -08001240 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001241 int displacement = SRegOffset(rl_dest.s_reg_low);
1242
buzbee2700f7e2014-03-07 09:46:20 -08001243 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, rl_src.reg.GetLowReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001244 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001245 true /* is_load */, true /* is64bit */);
1246 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001247 false /* is_load */, true /* is64bit */);
1248 x86op = GetOpcode(op, rl_dest, rl_src, true);
buzbee2700f7e2014-03-07 09:46:20 -08001249 lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, rl_src.reg.GetHighReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001250 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001251 true /* is_load */, true /* is64bit */);
1252 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001253 false /* is_load */, true /* is64bit */);
buzbee2700f7e2014-03-07 09:46:20 -08001254 FreeTemp(rl_src.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001255}
1256
Mark Mendelle02d48f2014-01-15 11:19:23 -08001257void X86Mir2Lir::GenLongArith(RegLocation rl_dest, RegLocation rl_src1,
1258 RegLocation rl_src2, Instruction::Code op,
1259 bool is_commutative) {
1260 // Is this really a 2 operand operation?
1261 switch (op) {
1262 case Instruction::ADD_LONG_2ADDR:
1263 case Instruction::SUB_LONG_2ADDR:
1264 case Instruction::AND_LONG_2ADDR:
1265 case Instruction::OR_LONG_2ADDR:
1266 case Instruction::XOR_LONG_2ADDR:
1267 GenLongArith(rl_dest, rl_src2, op);
1268 return;
1269 default:
1270 break;
1271 }
1272
1273 if (rl_dest.location == kLocPhysReg) {
1274 RegLocation rl_result = LoadValueWide(rl_src1, kCoreReg);
1275
1276 // We are about to clobber the LHS, so it needs to be a temp.
1277 rl_result = ForceTempWide(rl_result);
1278
1279 // Perform the operation using the RHS.
1280 rl_src2 = UpdateLocWide(rl_src2);
1281 GenLongRegOrMemOp(rl_result, rl_src2, op);
1282
1283 // And now record that the result is in the temp.
1284 StoreFinalValueWide(rl_dest, rl_result);
1285 return;
1286 }
1287
1288 // It wasn't in registers, so it better be in memory.
1289 DCHECK((rl_dest.location == kLocDalvikFrame) ||
1290 (rl_dest.location == kLocCompilerTemp));
1291 rl_src1 = UpdateLocWide(rl_src1);
1292 rl_src2 = UpdateLocWide(rl_src2);
1293
1294 // Get one of the source operands into temporary register.
1295 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
buzbee091cc402014-03-31 10:14:40 -07001296 if (IsTemp(rl_src1.reg.GetLow()) && IsTemp(rl_src1.reg.GetHigh())) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001297 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1298 } else if (is_commutative) {
1299 rl_src2 = LoadValueWide(rl_src2, kCoreReg);
1300 // We need at least one of them to be a temporary.
buzbee091cc402014-03-31 10:14:40 -07001301 if (!(IsTemp(rl_src2.reg.GetLow()) && IsTemp(rl_src2.reg.GetHigh()))) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001302 rl_src1 = ForceTempWide(rl_src1);
Yevgeny Rouban91b6ffa2014-03-07 14:35:44 +07001303 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1304 } else {
1305 GenLongRegOrMemOp(rl_src2, rl_src1, op);
1306 StoreFinalValueWide(rl_dest, rl_src2);
1307 return;
Mark Mendelle02d48f2014-01-15 11:19:23 -08001308 }
Mark Mendelle02d48f2014-01-15 11:19:23 -08001309 } else {
1310 // Need LHS to be the temp.
1311 rl_src1 = ForceTempWide(rl_src1);
1312 GenLongRegOrMemOp(rl_src1, rl_src2, op);
1313 }
1314
1315 StoreFinalValueWide(rl_dest, rl_src1);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001316}
1317
Mark Mendelle02d48f2014-01-15 11:19:23 -08001318void X86Mir2Lir::GenAddLong(Instruction::Code opcode, RegLocation rl_dest,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001319 RegLocation rl_src1, RegLocation rl_src2) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001320 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1321}
1322
1323void X86Mir2Lir::GenSubLong(Instruction::Code opcode, RegLocation rl_dest,
1324 RegLocation rl_src1, RegLocation rl_src2) {
1325 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, false);
1326}
1327
1328void X86Mir2Lir::GenAndLong(Instruction::Code opcode, RegLocation rl_dest,
1329 RegLocation rl_src1, RegLocation rl_src2) {
1330 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1331}
1332
1333void X86Mir2Lir::GenOrLong(Instruction::Code opcode, RegLocation rl_dest,
1334 RegLocation rl_src1, RegLocation rl_src2) {
1335 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
1336}
1337
1338void X86Mir2Lir::GenXorLong(Instruction::Code opcode, RegLocation rl_dest,
1339 RegLocation rl_src1, RegLocation rl_src2) {
1340 GenLongArith(rl_dest, rl_src1, rl_src2, opcode, true);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001341}
1342
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001343void X86Mir2Lir::GenNegLong(RegLocation rl_dest, RegLocation rl_src) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001344 rl_src = LoadValueWide(rl_src, kCoreReg);
1345 RegLocation rl_result = ForceTempWide(rl_src);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001346 if (((rl_dest.location == kLocPhysReg) && (rl_src.location == kLocPhysReg)) &&
buzbee2700f7e2014-03-07 09:46:20 -08001347 ((rl_dest.reg.GetLowReg() == rl_src.reg.GetHighReg()))) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001348 // The registers are the same, so we would clobber it before the use.
buzbee2700f7e2014-03-07 09:46:20 -08001349 RegStorage temp_reg = AllocTemp();
1350 OpRegCopy(temp_reg, rl_result.reg);
1351 rl_result.reg.SetHighReg(temp_reg.GetReg());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001352 }
buzbee2700f7e2014-03-07 09:46:20 -08001353 OpRegReg(kOpNeg, rl_result.reg.GetLow(), rl_result.reg.GetLow()); // rLow = -rLow
1354 OpRegImm(kOpAdc, rl_result.reg.GetHigh(), 0); // rHigh = rHigh + CF
1355 OpRegReg(kOpNeg, rl_result.reg.GetHigh(), rl_result.reg.GetHigh()); // rHigh = -rHigh
Brian Carlstrom7940e442013-07-12 13:46:57 -07001356 StoreValueWide(rl_dest, rl_result);
1357}
1358
buzbee091cc402014-03-31 10:14:40 -07001359void X86Mir2Lir::OpRegThreadMem(OpKind op, RegStorage r_dest, ThreadOffset<4> thread_offset) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001360 X86OpCode opcode = kX86Bkpt;
1361 switch (op) {
1362 case kOpCmp: opcode = kX86Cmp32RT; break;
1363 case kOpMov: opcode = kX86Mov32RT; break;
1364 default:
1365 LOG(FATAL) << "Bad opcode: " << op;
1366 break;
1367 }
buzbee091cc402014-03-31 10:14:40 -07001368 NewLIR2(opcode, r_dest.GetReg(), thread_offset.Int32Value());
Brian Carlstrom7940e442013-07-12 13:46:57 -07001369}
1370
1371/*
1372 * Generate array load
1373 */
1374void X86Mir2Lir::GenArrayGet(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07001375 RegLocation rl_index, RegLocation rl_dest, int scale) {
buzbee091cc402014-03-31 10:14:40 -07001376 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001377 int len_offset = mirror::Array::LengthOffset().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -07001378 RegLocation rl_result;
1379 rl_array = LoadValue(rl_array, kCoreReg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001380
Mark Mendell343adb52013-12-18 06:02:17 -08001381 int data_offset;
buzbee695d13a2014-04-19 13:32:20 -07001382 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001383 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
1384 } else {
1385 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
1386 }
1387
Mark Mendell343adb52013-12-18 06:02:17 -08001388 bool constant_index = rl_index.is_const;
1389 int32_t constant_index_value = 0;
1390 if (!constant_index) {
1391 rl_index = LoadValue(rl_index, kCoreReg);
1392 } else {
1393 constant_index_value = mir_graph_->ConstantValue(rl_index);
1394 // If index is constant, just fold it into the data offset
1395 data_offset += constant_index_value << scale;
1396 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08001397 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08001398 }
1399
Brian Carlstrom7940e442013-07-12 13:46:57 -07001400 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08001401 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001402
1403 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08001404 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001405 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001406 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07001407 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001408 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001409 }
Mark Mendell343adb52013-12-18 06:02:17 -08001410 rl_result = EvalLoc(rl_dest, reg_class, true);
buzbee091cc402014-03-31 10:14:40 -07001411 LoadBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_result.reg, size,
1412 INVALID_SREG);
buzbee695d13a2014-04-19 13:32:20 -07001413 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001414 StoreValueWide(rl_dest, rl_result);
1415 } else {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001416 StoreValue(rl_dest, rl_result);
1417 }
1418}
1419
1420/*
1421 * Generate array store
1422 *
1423 */
1424void X86Mir2Lir::GenArrayPut(int opt_flags, OpSize size, RegLocation rl_array,
Ian Rogersa9a82542013-10-04 11:17:26 -07001425 RegLocation rl_index, RegLocation rl_src, int scale, bool card_mark) {
buzbee091cc402014-03-31 10:14:40 -07001426 RegisterClass reg_class = RegClassBySize(size);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001427 int len_offset = mirror::Array::LengthOffset().Int32Value();
1428 int data_offset;
1429
buzbee695d13a2014-04-19 13:32:20 -07001430 if (size == k64 || size == kDouble) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001431 data_offset = mirror::Array::DataOffset(sizeof(int64_t)).Int32Value();
1432 } else {
1433 data_offset = mirror::Array::DataOffset(sizeof(int32_t)).Int32Value();
1434 }
1435
1436 rl_array = LoadValue(rl_array, kCoreReg);
Mark Mendell343adb52013-12-18 06:02:17 -08001437 bool constant_index = rl_index.is_const;
1438 int32_t constant_index_value = 0;
1439 if (!constant_index) {
1440 rl_index = LoadValue(rl_index, kCoreReg);
1441 } else {
1442 // If index is constant, just fold it into the data offset
1443 constant_index_value = mir_graph_->ConstantValue(rl_index);
1444 data_offset += constant_index_value << scale;
1445 // treat as non array below
buzbee2700f7e2014-03-07 09:46:20 -08001446 rl_index.reg = RegStorage::InvalidReg();
Mark Mendell343adb52013-12-18 06:02:17 -08001447 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001448
1449 /* null object? */
buzbee2700f7e2014-03-07 09:46:20 -08001450 GenNullCheck(rl_array.reg, opt_flags);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001451
1452 if (!(opt_flags & MIR_IGNORE_RANGE_CHECK)) {
Mark Mendell343adb52013-12-18 06:02:17 -08001453 if (constant_index) {
Mingyao Yang80365d92014-04-18 12:10:58 -07001454 GenArrayBoundsCheck(constant_index_value, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001455 } else {
Mingyao Yang80365d92014-04-18 12:10:58 -07001456 GenArrayBoundsCheck(rl_index.reg, rl_array.reg, len_offset);
Mark Mendell343adb52013-12-18 06:02:17 -08001457 }
Brian Carlstrom7940e442013-07-12 13:46:57 -07001458 }
buzbee695d13a2014-04-19 13:32:20 -07001459 if ((size == k64) || (size == kDouble)) {
Brian Carlstrom7940e442013-07-12 13:46:57 -07001460 rl_src = LoadValueWide(rl_src, reg_class);
1461 } else {
1462 rl_src = LoadValue(rl_src, reg_class);
1463 }
1464 // If the src reg can't be byte accessed, move it to a temp first.
buzbee091cc402014-03-31 10:14:40 -07001465 if ((size == kSignedByte || size == kUnsignedByte) &&
1466 rl_src.reg.GetRegNum() >= rs_rX86_SP.GetRegNum()) {
buzbee2700f7e2014-03-07 09:46:20 -08001467 RegStorage temp = AllocTemp();
1468 OpRegCopy(temp, rl_src.reg);
buzbee091cc402014-03-31 10:14:40 -07001469 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, temp, size, INVALID_SREG);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001470 } else {
buzbee091cc402014-03-31 10:14:40 -07001471 StoreBaseIndexedDisp(rl_array.reg, rl_index.reg, scale, data_offset, rl_src.reg, size,
1472 INVALID_SREG);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001473 }
Ian Rogersa9a82542013-10-04 11:17:26 -07001474 if (card_mark) {
Ian Rogers773aab12013-10-14 13:50:10 -07001475 // Free rl_index if its a temp. Ensures there are 2 free regs for card mark.
Mark Mendell343adb52013-12-18 06:02:17 -08001476 if (!constant_index) {
buzbee091cc402014-03-31 10:14:40 -07001477 FreeTemp(rl_index.reg);
Mark Mendell343adb52013-12-18 06:02:17 -08001478 }
buzbee2700f7e2014-03-07 09:46:20 -08001479 MarkGCCard(rl_src.reg, rl_array.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001480 }
1481}
1482
Mark Mendell4708dcd2014-01-22 09:05:18 -08001483RegLocation X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
1484 RegLocation rl_src, int shift_amount) {
1485 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
1486 switch (opcode) {
1487 case Instruction::SHL_LONG:
1488 case Instruction::SHL_LONG_2ADDR:
1489 DCHECK_NE(shift_amount, 1); // Prevent a double store from happening.
1490 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001491 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
1492 LoadConstant(rl_result.reg.GetLow(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001493 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001494 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetLow());
buzbee091cc402014-03-31 10:14:40 -07001495 FreeTemp(rl_src.reg.GetHigh());
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001496 NewLIR2(kX86Sal32RI, rl_result.reg.GetHighReg(), shift_amount - 32);
buzbee2700f7e2014-03-07 09:46:20 -08001497 LoadConstant(rl_result.reg.GetLow(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001498 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001499 OpRegCopy(rl_result.reg, rl_src.reg);
1500 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1501 NewLIR3(kX86Shld32RRI, rl_result.reg.GetHighReg(), rl_result.reg.GetLowReg(), shift_amount);
1502 NewLIR2(kX86Sal32RI, rl_result.reg.GetLowReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001503 }
1504 break;
1505 case Instruction::SHR_LONG:
1506 case Instruction::SHR_LONG_2ADDR:
1507 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001508 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1509 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001510 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001511 } else if (shift_amount > 31) {
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());
1514 NewLIR2(kX86Sar32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001515 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), 31);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001516 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001517 OpRegCopy(rl_result.reg, rl_src.reg);
1518 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1519 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(), shift_amount);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001520 NewLIR2(kX86Sar32RI, rl_result.reg.GetHighReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001521 }
1522 break;
1523 case Instruction::USHR_LONG:
1524 case Instruction::USHR_LONG_2ADDR:
1525 if (shift_amount == 32) {
buzbee2700f7e2014-03-07 09:46:20 -08001526 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1527 LoadConstant(rl_result.reg.GetHigh(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001528 } else if (shift_amount > 31) {
buzbee2700f7e2014-03-07 09:46:20 -08001529 OpRegCopy(rl_result.reg.GetLow(), rl_src.reg.GetHigh());
1530 NewLIR2(kX86Shr32RI, rl_result.reg.GetLowReg(), shift_amount - 32);
1531 LoadConstant(rl_result.reg.GetHigh(), 0);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001532 } else {
buzbee2700f7e2014-03-07 09:46:20 -08001533 OpRegCopy(rl_result.reg, rl_src.reg);
1534 OpRegCopy(rl_result.reg.GetHigh(), rl_src.reg.GetHigh());
1535 NewLIR3(kX86Shrd32RRI, rl_result.reg.GetLowReg(), rl_result.reg.GetHighReg(), shift_amount);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001536 NewLIR2(kX86Shr32RI, rl_result.reg.GetHighReg(), shift_amount);
Mark Mendell4708dcd2014-01-22 09:05:18 -08001537 }
1538 break;
1539 default:
1540 LOG(FATAL) << "Unexpected case";
1541 }
1542 return rl_result;
1543}
1544
Brian Carlstrom7940e442013-07-12 13:46:57 -07001545void X86Mir2Lir::GenShiftImmOpLong(Instruction::Code opcode, RegLocation rl_dest,
Mark Mendell4708dcd2014-01-22 09:05:18 -08001546 RegLocation rl_src, RegLocation rl_shift) {
1547 // Per spec, we only care about low 6 bits of shift amount.
1548 int shift_amount = mir_graph_->ConstantValue(rl_shift) & 0x3f;
1549 if (shift_amount == 0) {
1550 rl_src = LoadValueWide(rl_src, kCoreReg);
1551 StoreValueWide(rl_dest, rl_src);
1552 return;
1553 } else if (shift_amount == 1 &&
1554 (opcode == Instruction::SHL_LONG || opcode == Instruction::SHL_LONG_2ADDR)) {
1555 // Need to handle this here to avoid calling StoreValueWide twice.
1556 GenAddLong(Instruction::ADD_LONG, rl_dest, rl_src, rl_src);
1557 return;
1558 }
1559 if (BadOverlap(rl_src, rl_dest)) {
1560 GenShiftOpLong(opcode, rl_dest, rl_src, rl_shift);
1561 return;
1562 }
1563 rl_src = LoadValueWide(rl_src, kCoreReg);
1564 RegLocation rl_result = GenShiftImmOpLong(opcode, rl_dest, rl_src, shift_amount);
1565 StoreValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001566}
1567
1568void X86Mir2Lir::GenArithImmOpLong(Instruction::Code opcode,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -07001569 RegLocation rl_dest, RegLocation rl_src1, RegLocation rl_src2) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001570 switch (opcode) {
1571 case Instruction::ADD_LONG:
1572 case Instruction::AND_LONG:
1573 case Instruction::OR_LONG:
1574 case Instruction::XOR_LONG:
1575 if (rl_src2.is_const) {
1576 GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
1577 } else {
1578 DCHECK(rl_src1.is_const);
1579 GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
1580 }
1581 break;
1582 case Instruction::SUB_LONG:
1583 case Instruction::SUB_LONG_2ADDR:
1584 if (rl_src2.is_const) {
1585 GenLongLongImm(rl_dest, rl_src1, rl_src2, opcode);
1586 } else {
1587 GenSubLong(opcode, rl_dest, rl_src1, rl_src2);
1588 }
1589 break;
1590 case Instruction::ADD_LONG_2ADDR:
1591 case Instruction::OR_LONG_2ADDR:
1592 case Instruction::XOR_LONG_2ADDR:
1593 case Instruction::AND_LONG_2ADDR:
1594 if (rl_src2.is_const) {
1595 GenLongImm(rl_dest, rl_src2, opcode);
1596 } else {
1597 DCHECK(rl_src1.is_const);
1598 GenLongLongImm(rl_dest, rl_src2, rl_src1, opcode);
1599 }
1600 break;
1601 default:
1602 // Default - bail to non-const handler.
1603 GenArithOpLong(opcode, rl_dest, rl_src1, rl_src2);
1604 break;
1605 }
1606}
1607
1608bool X86Mir2Lir::IsNoOp(Instruction::Code op, int32_t value) {
1609 switch (op) {
1610 case Instruction::AND_LONG_2ADDR:
1611 case Instruction::AND_LONG:
1612 return value == -1;
1613 case Instruction::OR_LONG:
1614 case Instruction::OR_LONG_2ADDR:
1615 case Instruction::XOR_LONG:
1616 case Instruction::XOR_LONG_2ADDR:
1617 return value == 0;
1618 default:
1619 return false;
1620 }
1621}
1622
1623X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation dest, RegLocation rhs,
1624 bool is_high_op) {
1625 bool rhs_in_mem = rhs.location != kLocPhysReg;
1626 bool dest_in_mem = dest.location != kLocPhysReg;
1627 DCHECK(!rhs_in_mem || !dest_in_mem);
1628 switch (op) {
1629 case Instruction::ADD_LONG:
1630 case Instruction::ADD_LONG_2ADDR:
1631 if (dest_in_mem) {
1632 return is_high_op ? kX86Adc32MR : kX86Add32MR;
1633 } else if (rhs_in_mem) {
1634 return is_high_op ? kX86Adc32RM : kX86Add32RM;
1635 }
1636 return is_high_op ? kX86Adc32RR : kX86Add32RR;
1637 case Instruction::SUB_LONG:
1638 case Instruction::SUB_LONG_2ADDR:
1639 if (dest_in_mem) {
1640 return is_high_op ? kX86Sbb32MR : kX86Sub32MR;
1641 } else if (rhs_in_mem) {
1642 return is_high_op ? kX86Sbb32RM : kX86Sub32RM;
1643 }
1644 return is_high_op ? kX86Sbb32RR : kX86Sub32RR;
1645 case Instruction::AND_LONG_2ADDR:
1646 case Instruction::AND_LONG:
1647 if (dest_in_mem) {
1648 return kX86And32MR;
1649 }
1650 return rhs_in_mem ? kX86And32RM : kX86And32RR;
1651 case Instruction::OR_LONG:
1652 case Instruction::OR_LONG_2ADDR:
1653 if (dest_in_mem) {
1654 return kX86Or32MR;
1655 }
1656 return rhs_in_mem ? kX86Or32RM : kX86Or32RR;
1657 case Instruction::XOR_LONG:
1658 case Instruction::XOR_LONG_2ADDR:
1659 if (dest_in_mem) {
1660 return kX86Xor32MR;
1661 }
1662 return rhs_in_mem ? kX86Xor32RM : kX86Xor32RR;
1663 default:
1664 LOG(FATAL) << "Unexpected opcode: " << op;
1665 return kX86Add32RR;
1666 }
1667}
1668
1669X86OpCode X86Mir2Lir::GetOpcode(Instruction::Code op, RegLocation loc, bool is_high_op,
1670 int32_t value) {
1671 bool in_mem = loc.location != kLocPhysReg;
1672 bool byte_imm = IS_SIMM8(value);
buzbee091cc402014-03-31 10:14:40 -07001673 DCHECK(in_mem || !loc.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001674 switch (op) {
1675 case Instruction::ADD_LONG:
1676 case Instruction::ADD_LONG_2ADDR:
1677 if (byte_imm) {
1678 if (in_mem) {
1679 return is_high_op ? kX86Adc32MI8 : kX86Add32MI8;
1680 }
1681 return is_high_op ? kX86Adc32RI8 : kX86Add32RI8;
1682 }
1683 if (in_mem) {
1684 return is_high_op ? kX86Adc32MI : kX86Add32MI;
1685 }
1686 return is_high_op ? kX86Adc32RI : kX86Add32RI;
1687 case Instruction::SUB_LONG:
1688 case Instruction::SUB_LONG_2ADDR:
1689 if (byte_imm) {
1690 if (in_mem) {
1691 return is_high_op ? kX86Sbb32MI8 : kX86Sub32MI8;
1692 }
1693 return is_high_op ? kX86Sbb32RI8 : kX86Sub32RI8;
1694 }
1695 if (in_mem) {
1696 return is_high_op ? kX86Sbb32MI : kX86Sub32MI;
1697 }
1698 return is_high_op ? kX86Sbb32RI : kX86Sub32RI;
1699 case Instruction::AND_LONG_2ADDR:
1700 case Instruction::AND_LONG:
1701 if (byte_imm) {
1702 return in_mem ? kX86And32MI8 : kX86And32RI8;
1703 }
1704 return in_mem ? kX86And32MI : kX86And32RI;
1705 case Instruction::OR_LONG:
1706 case Instruction::OR_LONG_2ADDR:
1707 if (byte_imm) {
1708 return in_mem ? kX86Or32MI8 : kX86Or32RI8;
1709 }
1710 return in_mem ? kX86Or32MI : kX86Or32RI;
1711 case Instruction::XOR_LONG:
1712 case Instruction::XOR_LONG_2ADDR:
1713 if (byte_imm) {
1714 return in_mem ? kX86Xor32MI8 : kX86Xor32RI8;
1715 }
1716 return in_mem ? kX86Xor32MI : kX86Xor32RI;
1717 default:
1718 LOG(FATAL) << "Unexpected opcode: " << op;
1719 return kX86Add32MI;
1720 }
1721}
1722
1723void X86Mir2Lir::GenLongImm(RegLocation rl_dest, RegLocation rl_src, Instruction::Code op) {
1724 DCHECK(rl_src.is_const);
1725 int64_t val = mir_graph_->ConstantValueWide(rl_src);
1726 int32_t val_lo = Low32Bits(val);
1727 int32_t val_hi = High32Bits(val);
1728 rl_dest = UpdateLocWide(rl_dest);
1729
1730 // Can we just do this into memory?
1731 if ((rl_dest.location == kLocDalvikFrame) ||
1732 (rl_dest.location == kLocCompilerTemp)) {
buzbee2700f7e2014-03-07 09:46:20 -08001733 int r_base = TargetReg(kSp).GetReg();
Mark Mendelle02d48f2014-01-15 11:19:23 -08001734 int displacement = SRegOffset(rl_dest.s_reg_low);
1735
1736 if (!IsNoOp(op, val_lo)) {
1737 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001738 LIR *lir = NewLIR3(x86op, r_base, displacement + LOWORD_OFFSET, val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001739 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001740 true /* is_load */, true /* is64bit */);
1741 AnnotateDalvikRegAccess(lir, (displacement + LOWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001742 false /* is_load */, true /* is64bit */);
1743 }
1744 if (!IsNoOp(op, val_hi)) {
1745 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
buzbee2700f7e2014-03-07 09:46:20 -08001746 LIR *lir = NewLIR3(x86op, r_base, displacement + HIWORD_OFFSET, val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001747 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Serguei Katkov217fe732014-03-27 14:41:56 +07001748 true /* is_load */, true /* is64bit */);
1749 AnnotateDalvikRegAccess(lir, (displacement + HIWORD_OFFSET) >> 2,
Mark Mendelle02d48f2014-01-15 11:19:23 -08001750 false /* is_load */, true /* is64bit */);
1751 }
1752 return;
1753 }
1754
1755 RegLocation rl_result = EvalLocWide(rl_dest, kCoreReg, true);
1756 DCHECK_EQ(rl_result.location, kLocPhysReg);
buzbee091cc402014-03-31 10:14:40 -07001757 DCHECK(!rl_result.reg.IsFloat());
Mark Mendelle02d48f2014-01-15 11:19:23 -08001758
1759 if (!IsNoOp(op, val_lo)) {
1760 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001761 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001762 }
1763 if (!IsNoOp(op, val_hi)) {
1764 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001765 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001766 }
1767 StoreValueWide(rl_dest, rl_result);
1768}
1769
1770void X86Mir2Lir::GenLongLongImm(RegLocation rl_dest, RegLocation rl_src1,
1771 RegLocation rl_src2, Instruction::Code op) {
1772 DCHECK(rl_src2.is_const);
1773 int64_t val = mir_graph_->ConstantValueWide(rl_src2);
1774 int32_t val_lo = Low32Bits(val);
1775 int32_t val_hi = High32Bits(val);
1776 rl_dest = UpdateLocWide(rl_dest);
1777 rl_src1 = UpdateLocWide(rl_src1);
1778
1779 // Can we do this directly into the destination registers?
1780 if (rl_dest.location == kLocPhysReg && rl_src1.location == kLocPhysReg &&
buzbee2700f7e2014-03-07 09:46:20 -08001781 rl_dest.reg.GetLowReg() == rl_src1.reg.GetLowReg() &&
buzbee091cc402014-03-31 10:14:40 -07001782 rl_dest.reg.GetHighReg() == rl_src1.reg.GetHighReg() && !rl_dest.reg.IsFloat()) {
Mark Mendelle02d48f2014-01-15 11:19:23 -08001783 if (!IsNoOp(op, val_lo)) {
1784 X86OpCode x86op = GetOpcode(op, rl_dest, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001785 NewLIR2(x86op, rl_dest.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001786 }
1787 if (!IsNoOp(op, val_hi)) {
1788 X86OpCode x86op = GetOpcode(op, rl_dest, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001789 NewLIR2(x86op, rl_dest.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001790 }
Maxim Kazantsev653f2bf2014-02-13 15:11:17 +07001791
1792 StoreFinalValueWide(rl_dest, rl_dest);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001793 return;
1794 }
1795
1796 rl_src1 = LoadValueWide(rl_src1, kCoreReg);
1797 DCHECK_EQ(rl_src1.location, kLocPhysReg);
1798
1799 // We need the values to be in a temporary
1800 RegLocation rl_result = ForceTempWide(rl_src1);
1801 if (!IsNoOp(op, val_lo)) {
1802 X86OpCode x86op = GetOpcode(op, rl_result, false, val_lo);
buzbee2700f7e2014-03-07 09:46:20 -08001803 NewLIR2(x86op, rl_result.reg.GetLowReg(), val_lo);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001804 }
1805 if (!IsNoOp(op, val_hi)) {
1806 X86OpCode x86op = GetOpcode(op, rl_result, true, val_hi);
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001807 NewLIR2(x86op, rl_result.reg.GetHighReg(), val_hi);
Mark Mendelle02d48f2014-01-15 11:19:23 -08001808 }
1809
1810 StoreFinalValueWide(rl_dest, rl_result);
Brian Carlstrom7940e442013-07-12 13:46:57 -07001811}
1812
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001813// For final classes there are no sub-classes to check and so we can answer the instance-of
1814// question with simple comparisons. Use compares to memory and SETEQ to optimize for x86.
1815void X86Mir2Lir::GenInstanceofFinal(bool use_declaring_class, uint32_t type_idx,
1816 RegLocation rl_dest, RegLocation rl_src) {
1817 RegLocation object = LoadValue(rl_src, kCoreReg);
1818 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08001819 RegStorage result_reg = rl_result.reg;
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001820
1821 // SETcc only works with EAX..EDX.
buzbee091cc402014-03-31 10:14:40 -07001822 if (result_reg == object.reg || result_reg.GetRegNum() >= rs_rX86_SP.GetRegNum()) {
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001823 result_reg = AllocTypedTemp(false, kCoreReg);
buzbee091cc402014-03-31 10:14:40 -07001824 DCHECK_LT(result_reg.GetRegNum(), rs_rX86_SP.GetRegNum());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001825 }
1826
1827 // Assume that there is no match.
1828 LoadConstant(result_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -08001829 LIR* null_branchover = OpCmpImmBranch(kCondEq, object.reg, 0, NULL);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001830
buzbee2700f7e2014-03-07 09:46:20 -08001831 RegStorage check_class = AllocTypedTemp(false, kCoreReg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001832
1833 // If Method* is already in a register, we can save a copy.
1834 RegLocation rl_method = mir_graph_->GetMethodLoc();
1835 int32_t offset_of_type = mirror::Array::DataOffset(sizeof(mirror::Class*)).Int32Value() +
1836 (sizeof(mirror::Class*) * type_idx);
1837
1838 if (rl_method.location == kLocPhysReg) {
1839 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07001840 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001841 check_class);
1842 } else {
buzbee695d13a2014-04-19 13:32:20 -07001843 LoadRefDisp(rl_method.reg, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001844 check_class);
buzbee695d13a2014-04-19 13:32:20 -07001845 LoadRefDisp(check_class, offset_of_type, check_class);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001846 }
1847 } else {
1848 LoadCurrMethodDirect(check_class);
1849 if (use_declaring_class) {
buzbee695d13a2014-04-19 13:32:20 -07001850 LoadRefDisp(check_class, mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001851 check_class);
1852 } else {
buzbee695d13a2014-04-19 13:32:20 -07001853 LoadRefDisp(check_class, mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001854 check_class);
buzbee695d13a2014-04-19 13:32:20 -07001855 LoadRefDisp(check_class, offset_of_type, check_class);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001856 }
1857 }
1858
1859 // Compare the computed class to the class in the object.
1860 DCHECK_EQ(object.location, kLocPhysReg);
buzbee2700f7e2014-03-07 09:46:20 -08001861 OpRegMem(kOpCmp, check_class, object.reg, mirror::Object::ClassOffset().Int32Value());
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001862
1863 // Set the low byte of the result to 0 or 1 from the compare condition code.
buzbee2700f7e2014-03-07 09:46:20 -08001864 NewLIR2(kX86Set8R, result_reg.GetReg(), kX86CondEq);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001865
1866 LIR* target = NewLIR0(kPseudoTargetLabel);
1867 null_branchover->target = target;
1868 FreeTemp(check_class);
1869 if (IsTemp(result_reg)) {
buzbee2700f7e2014-03-07 09:46:20 -08001870 OpRegCopy(rl_result.reg, result_reg);
Mark Mendelldf8ee2e2014-01-27 16:37:47 -08001871 FreeTemp(result_reg);
1872 }
1873 StoreValue(rl_dest, rl_result);
1874}
1875
Mark Mendell6607d972014-02-10 06:54:18 -08001876void X86Mir2Lir::GenInstanceofCallingHelper(bool needs_access_check, bool type_known_final,
1877 bool type_known_abstract, bool use_declaring_class,
1878 bool can_assume_type_is_in_dex_cache,
1879 uint32_t type_idx, RegLocation rl_dest,
1880 RegLocation rl_src) {
1881 FlushAllRegs();
1882 // May generate a call - use explicit registers.
1883 LockCallTemps();
1884 LoadCurrMethodDirect(TargetReg(kArg1)); // kArg1 gets current Method*.
buzbee2700f7e2014-03-07 09:46:20 -08001885 RegStorage class_reg = TargetReg(kArg2); // kArg2 will hold the Class*.
Mark Mendell6607d972014-02-10 06:54:18 -08001886 // Reference must end up in kArg0.
1887 if (needs_access_check) {
1888 // Check we have access to type_idx and if not throw IllegalAccessError,
1889 // Caller function returns Class* in kArg0.
Ian Rogersdd7624d2014-03-14 17:43:00 -07001890 CallRuntimeHelperImm(QUICK_ENTRYPOINT_OFFSET(4, pInitializeTypeAndVerifyAccess),
Mark Mendell6607d972014-02-10 06:54:18 -08001891 type_idx, true);
1892 OpRegCopy(class_reg, TargetReg(kRet0));
1893 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
1894 } else if (use_declaring_class) {
1895 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
buzbee695d13a2014-04-19 13:32:20 -07001896 LoadRefDisp(TargetReg(kArg1), mirror::ArtMethod::DeclaringClassOffset().Int32Value(),
buzbee2700f7e2014-03-07 09:46:20 -08001897 class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001898 } else {
1899 // Load dex cache entry into class_reg (kArg2).
1900 LoadValueDirectFixed(rl_src, TargetReg(kArg0));
buzbee695d13a2014-04-19 13:32:20 -07001901 LoadRefDisp(TargetReg(kArg1), mirror::ArtMethod::DexCacheResolvedTypesOffset().Int32Value(),
buzbee2700f7e2014-03-07 09:46:20 -08001902 class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001903 int32_t offset_of_type =
1904 mirror::Array::DataOffset(sizeof(mirror::Class*)).Int32Value() + (sizeof(mirror::Class*)
1905 * type_idx);
buzbee695d13a2014-04-19 13:32:20 -07001906 LoadRefDisp(class_reg, offset_of_type, class_reg);
Mark Mendell6607d972014-02-10 06:54:18 -08001907 if (!can_assume_type_is_in_dex_cache) {
1908 // Need to test presence of type in dex cache at runtime.
1909 LIR* hop_branch = OpCmpImmBranch(kCondNe, class_reg, 0, NULL);
1910 // Type is not resolved. Call out to helper, which will return resolved type in kRet0/kArg0.
Ian Rogersdd7624d2014-03-14 17:43:00 -07001911 CallRuntimeHelperImm(QUICK_ENTRYPOINT_OFFSET(4, pInitializeType), type_idx, true);
Mark Mendell6607d972014-02-10 06:54:18 -08001912 OpRegCopy(TargetReg(kArg2), TargetReg(kRet0)); // Align usage with fast path.
1913 LoadValueDirectFixed(rl_src, TargetReg(kArg0)); /* Reload Ref. */
1914 // Rejoin code paths
1915 LIR* hop_target = NewLIR0(kPseudoTargetLabel);
1916 hop_branch->target = hop_target;
1917 }
1918 }
1919 /* kArg0 is ref, kArg2 is class. If ref==null, use directly as bool result. */
1920 RegLocation rl_result = GetReturn(false);
1921
1922 // SETcc only works with EAX..EDX.
buzbee091cc402014-03-31 10:14:40 -07001923 DCHECK_LT(rl_result.reg.GetRegNum(), 4);
Mark Mendell6607d972014-02-10 06:54:18 -08001924
1925 // Is the class NULL?
1926 LIR* branch1 = OpCmpImmBranch(kCondEq, TargetReg(kArg0), 0, NULL);
1927
1928 /* Load object->klass_. */
1929 DCHECK_EQ(mirror::Object::ClassOffset().Int32Value(), 0);
buzbee695d13a2014-04-19 13:32:20 -07001930 LoadRefDisp(TargetReg(kArg0), mirror::Object::ClassOffset().Int32Value(), TargetReg(kArg1));
Mark Mendell6607d972014-02-10 06:54:18 -08001931 /* kArg0 is ref, kArg1 is ref->klass_, kArg2 is class. */
1932 LIR* branchover = nullptr;
1933 if (type_known_final) {
1934 // Ensure top 3 bytes of result are 0.
buzbee2700f7e2014-03-07 09:46:20 -08001935 LoadConstant(rl_result.reg, 0);
Mark Mendell6607d972014-02-10 06:54:18 -08001936 OpRegReg(kOpCmp, TargetReg(kArg1), TargetReg(kArg2));
1937 // Set the low byte of the result to 0 or 1 from the compare condition code.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00001938 NewLIR2(kX86Set8R, rl_result.reg.GetReg(), kX86CondEq);
Mark Mendell6607d972014-02-10 06:54:18 -08001939 } else {
1940 if (!type_known_abstract) {
buzbee2700f7e2014-03-07 09:46:20 -08001941 LoadConstant(rl_result.reg, 1); // Assume result succeeds.
Mark Mendell6607d972014-02-10 06:54:18 -08001942 branchover = OpCmpBranch(kCondEq, TargetReg(kArg1), TargetReg(kArg2), NULL);
1943 }
1944 OpRegCopy(TargetReg(kArg0), TargetReg(kArg2));
Ian Rogersdd7624d2014-03-14 17:43:00 -07001945 OpThreadMem(kOpBlx, QUICK_ENTRYPOINT_OFFSET(4, pInstanceofNonTrivial));
Mark Mendell6607d972014-02-10 06:54:18 -08001946 }
1947 // TODO: only clobber when type isn't final?
1948 ClobberCallerSave();
1949 /* Branch targets here. */
1950 LIR* target = NewLIR0(kPseudoTargetLabel);
1951 StoreValue(rl_dest, rl_result);
1952 branch1->target = target;
1953 if (branchover != nullptr) {
1954 branchover->target = target;
1955 }
1956}
1957
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08001958void X86Mir2Lir::GenArithOpInt(Instruction::Code opcode, RegLocation rl_dest,
1959 RegLocation rl_lhs, RegLocation rl_rhs) {
1960 OpKind op = kOpBkpt;
1961 bool is_div_rem = false;
1962 bool unary = false;
1963 bool shift_op = false;
1964 bool is_two_addr = false;
1965 RegLocation rl_result;
1966 switch (opcode) {
1967 case Instruction::NEG_INT:
1968 op = kOpNeg;
1969 unary = true;
1970 break;
1971 case Instruction::NOT_INT:
1972 op = kOpMvn;
1973 unary = true;
1974 break;
1975 case Instruction::ADD_INT_2ADDR:
1976 is_two_addr = true;
1977 // Fallthrough
1978 case Instruction::ADD_INT:
1979 op = kOpAdd;
1980 break;
1981 case Instruction::SUB_INT_2ADDR:
1982 is_two_addr = true;
1983 // Fallthrough
1984 case Instruction::SUB_INT:
1985 op = kOpSub;
1986 break;
1987 case Instruction::MUL_INT_2ADDR:
1988 is_two_addr = true;
1989 // Fallthrough
1990 case Instruction::MUL_INT:
1991 op = kOpMul;
1992 break;
1993 case Instruction::DIV_INT_2ADDR:
1994 is_two_addr = true;
1995 // Fallthrough
1996 case Instruction::DIV_INT:
1997 op = kOpDiv;
1998 is_div_rem = true;
1999 break;
2000 /* NOTE: returns in kArg1 */
2001 case Instruction::REM_INT_2ADDR:
2002 is_two_addr = true;
2003 // Fallthrough
2004 case Instruction::REM_INT:
2005 op = kOpRem;
2006 is_div_rem = true;
2007 break;
2008 case Instruction::AND_INT_2ADDR:
2009 is_two_addr = true;
2010 // Fallthrough
2011 case Instruction::AND_INT:
2012 op = kOpAnd;
2013 break;
2014 case Instruction::OR_INT_2ADDR:
2015 is_two_addr = true;
2016 // Fallthrough
2017 case Instruction::OR_INT:
2018 op = kOpOr;
2019 break;
2020 case Instruction::XOR_INT_2ADDR:
2021 is_two_addr = true;
2022 // Fallthrough
2023 case Instruction::XOR_INT:
2024 op = kOpXor;
2025 break;
2026 case Instruction::SHL_INT_2ADDR:
2027 is_two_addr = true;
2028 // Fallthrough
2029 case Instruction::SHL_INT:
2030 shift_op = true;
2031 op = kOpLsl;
2032 break;
2033 case Instruction::SHR_INT_2ADDR:
2034 is_two_addr = true;
2035 // Fallthrough
2036 case Instruction::SHR_INT:
2037 shift_op = true;
2038 op = kOpAsr;
2039 break;
2040 case Instruction::USHR_INT_2ADDR:
2041 is_two_addr = true;
2042 // Fallthrough
2043 case Instruction::USHR_INT:
2044 shift_op = true;
2045 op = kOpLsr;
2046 break;
2047 default:
2048 LOG(FATAL) << "Invalid word arith op: " << opcode;
2049 }
2050
2051 // Can we convert to a two address instruction?
2052 if (!is_two_addr &&
2053 (mir_graph_->SRegToVReg(rl_dest.s_reg_low) ==
2054 mir_graph_->SRegToVReg(rl_lhs.s_reg_low))) {
2055 is_two_addr = true;
2056 }
2057
2058 // Get the div/rem stuff out of the way.
2059 if (is_div_rem) {
2060 rl_result = GenDivRem(rl_dest, rl_lhs, rl_rhs, op == kOpDiv, true);
2061 StoreValue(rl_dest, rl_result);
2062 return;
2063 }
2064
2065 if (unary) {
2066 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2067 rl_result = UpdateLoc(rl_dest);
2068 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002069 OpRegReg(op, rl_result.reg, rl_lhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002070 } else {
2071 if (shift_op) {
2072 // X86 doesn't require masking and must use ECX.
buzbee2700f7e2014-03-07 09:46:20 -08002073 RegStorage t_reg = TargetReg(kCount); // rCX
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002074 LoadValueDirectFixed(rl_rhs, t_reg);
2075 if (is_two_addr) {
2076 // Can we do this directly into memory?
2077 rl_result = UpdateLoc(rl_dest);
2078 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2079 if (rl_result.location != kLocPhysReg) {
2080 // Okay, we can do this into memory
buzbee2700f7e2014-03-07 09:46:20 -08002081 OpMemReg(op, rl_result, t_reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002082 FreeTemp(t_reg);
2083 return;
buzbee091cc402014-03-31 10:14:40 -07002084 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002085 // Can do this directly into the result register
buzbee2700f7e2014-03-07 09:46:20 -08002086 OpRegReg(op, rl_result.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002087 FreeTemp(t_reg);
2088 StoreFinalValue(rl_dest, rl_result);
2089 return;
2090 }
2091 }
2092 // Three address form, or we can't do directly.
2093 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2094 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002095 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, t_reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002096 FreeTemp(t_reg);
2097 } else {
2098 // Multiply is 3 operand only (sort of).
2099 if (is_two_addr && op != kOpMul) {
2100 // Can we do this directly into memory?
2101 rl_result = UpdateLoc(rl_dest);
2102 if (rl_result.location == kLocPhysReg) {
Serguei Katkov366f8ae2014-04-15 16:55:26 +07002103 // Ensure res is in a core reg
2104 rl_result = EvalLoc(rl_dest, kCoreReg, true);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002105 // Can we do this from memory directly?
2106 rl_rhs = UpdateLoc(rl_rhs);
2107 if (rl_rhs.location != kLocPhysReg) {
buzbee2700f7e2014-03-07 09:46:20 -08002108 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002109 StoreFinalValue(rl_dest, rl_result);
2110 return;
buzbee091cc402014-03-31 10:14:40 -07002111 } else if (!rl_rhs.reg.IsFloat()) {
buzbee2700f7e2014-03-07 09:46:20 -08002112 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002113 StoreFinalValue(rl_dest, rl_result);
2114 return;
2115 }
2116 }
2117 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2118 if (rl_result.location != kLocPhysReg) {
2119 // Okay, we can do this into memory.
Bill Buzbee00e1ec62014-02-27 23:44:13 +00002120 OpMemReg(op, rl_result, rl_rhs.reg.GetReg());
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002121 return;
buzbee091cc402014-03-31 10:14:40 -07002122 } else if (!rl_result.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002123 // Can do this directly into the result register.
buzbee2700f7e2014-03-07 09:46:20 -08002124 OpRegReg(op, rl_result.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002125 StoreFinalValue(rl_dest, rl_result);
2126 return;
2127 } else {
2128 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2129 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002130 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002131 }
2132 } else {
2133 // Try to use reg/memory instructions.
2134 rl_lhs = UpdateLoc(rl_lhs);
2135 rl_rhs = UpdateLoc(rl_rhs);
2136 // We can't optimize with FP registers.
2137 if (!IsOperationSafeWithoutTemps(rl_lhs, rl_rhs)) {
2138 // Something is difficult, so fall back to the standard case.
2139 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2140 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2141 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002142 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002143 } else {
2144 // We can optimize by moving to result and using memory operands.
2145 if (rl_rhs.location != kLocPhysReg) {
2146 // Force LHS into result.
Serguei Katkov66da1362014-03-14 13:33:33 +07002147 // We should be careful with order here
2148 // If rl_dest and rl_lhs points to the same VR we should load first
2149 // If the are different we should find a register first for dest
2150 if (mir_graph_->SRegToVReg(rl_dest.s_reg_low) == mir_graph_->SRegToVReg(rl_lhs.s_reg_low)) {
2151 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2152 rl_result = EvalLoc(rl_dest, kCoreReg, true);
2153 } else {
2154 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002155 LoadValueDirect(rl_lhs, rl_result.reg);
Serguei Katkov66da1362014-03-14 13:33:33 +07002156 }
buzbee2700f7e2014-03-07 09:46:20 -08002157 OpRegMem(op, rl_result.reg, rl_rhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002158 } else if (rl_lhs.location != kLocPhysReg) {
2159 // RHS is in a register; LHS is in memory.
2160 if (op != kOpSub) {
2161 // Force RHS into result and operate on memory.
2162 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002163 OpRegCopy(rl_result.reg, rl_rhs.reg);
2164 OpRegMem(op, rl_result.reg, rl_lhs);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002165 } else {
2166 // Subtraction isn't commutative.
2167 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2168 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2169 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002170 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002171 }
2172 } else {
2173 // Both are in registers.
2174 rl_lhs = LoadValue(rl_lhs, kCoreReg);
2175 rl_rhs = LoadValue(rl_rhs, kCoreReg);
2176 rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -08002177 OpRegRegReg(op, rl_result.reg, rl_lhs.reg, rl_rhs.reg);
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002178 }
2179 }
2180 }
2181 }
2182 }
2183 StoreValue(rl_dest, rl_result);
2184}
2185
2186bool X86Mir2Lir::IsOperationSafeWithoutTemps(RegLocation rl_lhs, RegLocation rl_rhs) {
2187 // If we have non-core registers, then we can't do good things.
buzbee091cc402014-03-31 10:14:40 -07002188 if (rl_lhs.location == kLocPhysReg && rl_lhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002189 return false;
2190 }
buzbee091cc402014-03-31 10:14:40 -07002191 if (rl_rhs.location == kLocPhysReg && rl_rhs.reg.IsFloat()) {
Mark Mendellfeb2b4e2014-01-28 12:59:49 -08002192 return false;
2193 }
2194
2195 // Everything will be fine :-).
2196 return true;
2197}
Brian Carlstrom7940e442013-07-12 13:46:57 -07002198} // namespace art