blob: 06ab46f536df790e9f009c9624cd6259510e66be [file] [log] [blame]
Mark Mendell09ed1a32015-03-25 08:30:06 -04001/*
2 * Copyright (C) 2015 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#include "intrinsics_x86.h"
18
Andreas Gampe21030dd2015-05-07 14:46:15 -070019#include <limits>
20
Mark Mendellfb8d2792015-03-31 22:16:59 -040021#include "arch/x86/instruction_set_features_x86.h"
Mathieu Chartiere401d142015-04-22 13:56:20 -070022#include "art_method.h"
Mark Mendelld5897672015-08-12 21:16:41 -040023#include "base/bit_utils.h"
Mark Mendell09ed1a32015-03-25 08:30:06 -040024#include "code_generator_x86.h"
25#include "entrypoints/quick/quick_entrypoints.h"
26#include "intrinsics.h"
Andreas Gampe85b62f22015-09-09 13:15:38 -070027#include "intrinsics_utils.h"
Mark Mendell09ed1a32015-03-25 08:30:06 -040028#include "mirror/array-inl.h"
Mark Mendell09ed1a32015-03-25 08:30:06 -040029#include "mirror/string.h"
30#include "thread.h"
31#include "utils/x86/assembler_x86.h"
32#include "utils/x86/constants_x86.h"
33
34namespace art {
35
36namespace x86 {
37
38static constexpr int kDoubleNaNHigh = 0x7FF80000;
39static constexpr int kDoubleNaNLow = 0x00000000;
Mark P Mendell2f10a5f2016-01-25 14:47:50 +000040static constexpr int64_t kDoubleNaN = INT64_C(0x7FF8000000000000);
41static constexpr int32_t kFloatNaN = INT32_C(0x7FC00000);
Mark Mendell09ed1a32015-03-25 08:30:06 -040042
Mark Mendellfb8d2792015-03-31 22:16:59 -040043IntrinsicLocationsBuilderX86::IntrinsicLocationsBuilderX86(CodeGeneratorX86* codegen)
Mark P Mendell2f10a5f2016-01-25 14:47:50 +000044 : arena_(codegen->GetGraph()->GetArena()),
45 codegen_(codegen) {
Mark Mendellfb8d2792015-03-31 22:16:59 -040046}
47
48
Mark Mendell09ed1a32015-03-25 08:30:06 -040049X86Assembler* IntrinsicCodeGeneratorX86::GetAssembler() {
Roland Levillainb488b782015-10-22 11:38:49 +010050 return down_cast<X86Assembler*>(codegen_->GetAssembler());
Mark Mendell09ed1a32015-03-25 08:30:06 -040051}
52
53ArenaAllocator* IntrinsicCodeGeneratorX86::GetAllocator() {
54 return codegen_->GetGraph()->GetArena();
55}
56
57bool IntrinsicLocationsBuilderX86::TryDispatch(HInvoke* invoke) {
58 Dispatch(invoke);
59 LocationSummary* res = invoke->GetLocations();
Roland Levillain0d5a2812015-11-13 10:07:31 +000060 if (res == nullptr) {
61 return false;
62 }
Roland Levillain0d5a2812015-11-13 10:07:31 +000063 return res->Intrinsified();
Mark Mendell09ed1a32015-03-25 08:30:06 -040064}
65
Roland Levillainec525fc2015-04-28 15:50:20 +010066static void MoveArguments(HInvoke* invoke, CodeGeneratorX86* codegen) {
Roland Levillain2d27c8e2015-04-28 15:48:45 +010067 InvokeDexCallingConventionVisitorX86 calling_convention_visitor;
Roland Levillainec525fc2015-04-28 15:50:20 +010068 IntrinsicVisitor::MoveArguments(invoke, codegen, &calling_convention_visitor);
Mark Mendell09ed1a32015-03-25 08:30:06 -040069}
70
Andreas Gampe85b62f22015-09-09 13:15:38 -070071using IntrinsicSlowPathX86 = IntrinsicSlowPath<InvokeDexCallingConventionVisitorX86>;
Mark Mendell09ed1a32015-03-25 08:30:06 -040072
Roland Levillain0b671c02016-08-19 12:02:34 +010073// NOLINT on __ macro to suppress wrong warning/fix (misc-macro-parentheses) from clang-tidy.
74#define __ down_cast<X86Assembler*>(codegen->GetAssembler())-> // NOLINT
75
76// Slow path implementing the SystemArrayCopy intrinsic copy loop with read barriers.
77class ReadBarrierSystemArrayCopySlowPathX86 : public SlowPathCode {
78 public:
79 explicit ReadBarrierSystemArrayCopySlowPathX86(HInstruction* instruction)
80 : SlowPathCode(instruction) {
81 DCHECK(kEmitCompilerReadBarrier);
82 DCHECK(kUseBakerReadBarrier);
83 }
84
85 void EmitNativeCode(CodeGenerator* codegen) OVERRIDE {
86 CodeGeneratorX86* x86_codegen = down_cast<CodeGeneratorX86*>(codegen);
87 LocationSummary* locations = instruction_->GetLocations();
88 DCHECK(locations->CanCall());
89 DCHECK(instruction_->IsInvokeStaticOrDirect())
90 << "Unexpected instruction in read barrier arraycopy slow path: "
91 << instruction_->DebugName();
92 DCHECK(instruction_->GetLocations()->Intrinsified());
93 DCHECK_EQ(instruction_->AsInvoke()->GetIntrinsic(), Intrinsics::kSystemArrayCopy);
94
95 int32_t element_size = Primitive::ComponentSize(Primitive::kPrimNot);
96 uint32_t offset = mirror::Array::DataOffset(element_size).Uint32Value();
97
98 Register src = locations->InAt(0).AsRegister<Register>();
99 Location src_pos = locations->InAt(1);
100 Register dest = locations->InAt(2).AsRegister<Register>();
101 Location dest_pos = locations->InAt(3);
102 Location length = locations->InAt(4);
103 Location temp1_loc = locations->GetTemp(0);
104 Register temp1 = temp1_loc.AsRegister<Register>();
105 Register temp2 = locations->GetTemp(1).AsRegister<Register>();
106 Register temp3 = locations->GetTemp(2).AsRegister<Register>();
107
108 __ Bind(GetEntryLabel());
109 // In this code path, registers `temp1`, `temp2`, and `temp3`
110 // (resp.) are not used for the base source address, the base
111 // destination address, and the end source address (resp.), as in
112 // other SystemArrayCopy intrinsic code paths. Instead they are
113 // (resp.) used for:
114 // - the loop index (`i`);
115 // - the source index (`src_index`) and the loaded (source)
116 // reference (`value`); and
117 // - the destination index (`dest_index`).
118
119 // i = 0
120 __ xorl(temp1, temp1);
121 NearLabel loop;
122 __ Bind(&loop);
123 // value = src_array[i + src_pos]
124 if (src_pos.IsConstant()) {
125 int32_t constant = src_pos.GetConstant()->AsIntConstant()->GetValue();
126 int32_t adjusted_offset = offset + constant * element_size;
127 __ movl(temp2, Address(src, temp1, ScaleFactor::TIMES_4, adjusted_offset));
128 } else {
129 __ leal(temp2, Address(src_pos.AsRegister<Register>(), temp1, ScaleFactor::TIMES_1, 0));
130 __ movl(temp2, Address(src, temp2, ScaleFactor::TIMES_4, offset));
131 }
132 __ MaybeUnpoisonHeapReference(temp2);
133 // TODO: Inline the mark bit check before calling the runtime?
134 // value = ReadBarrier::Mark(value)
135 // No need to save live registers; it's taken care of by the
136 // entrypoint. Also, there is no need to update the stack mask,
137 // as this runtime call will not trigger a garbage collection.
138 // (See ReadBarrierMarkSlowPathX86::EmitNativeCode for more
139 // explanations.)
140 DCHECK_NE(temp2, ESP);
141 DCHECK(0 <= temp2 && temp2 < kNumberOfCpuRegisters) << temp2;
142 int32_t entry_point_offset =
143 CodeGenerator::GetReadBarrierMarkEntryPointsOffset<kX86PointerSize>(temp2);
144 // This runtime call does not require a stack map.
145 x86_codegen->InvokeRuntimeWithoutRecordingPcInfo(entry_point_offset, instruction_, this);
146 __ MaybePoisonHeapReference(temp2);
147 // dest_array[i + dest_pos] = value
148 if (dest_pos.IsConstant()) {
149 int32_t constant = dest_pos.GetConstant()->AsIntConstant()->GetValue();
150 int32_t adjusted_offset = offset + constant * element_size;
151 __ movl(Address(dest, temp1, ScaleFactor::TIMES_4, adjusted_offset), temp2);
152 } else {
153 __ leal(temp3, Address(dest_pos.AsRegister<Register>(), temp1, ScaleFactor::TIMES_1, 0));
154 __ movl(Address(dest, temp3, ScaleFactor::TIMES_4, offset), temp2);
155 }
156 // ++i
157 __ addl(temp1, Immediate(1));
158 // if (i != length) goto loop
159 x86_codegen->GenerateIntCompare(temp1_loc, length);
160 __ j(kNotEqual, &loop);
161 __ jmp(GetExitLabel());
162 }
163
164 const char* GetDescription() const OVERRIDE { return "ReadBarrierSystemArrayCopySlowPathX86"; }
165
166 private:
167 DISALLOW_COPY_AND_ASSIGN(ReadBarrierSystemArrayCopySlowPathX86);
168};
169
170#undef __
171
Mark Mendell09ed1a32015-03-25 08:30:06 -0400172#define __ assembler->
173
174static void CreateFPToIntLocations(ArenaAllocator* arena, HInvoke* invoke, bool is64bit) {
175 LocationSummary* locations = new (arena) LocationSummary(invoke,
176 LocationSummary::kNoCall,
177 kIntrinsified);
178 locations->SetInAt(0, Location::RequiresFpuRegister());
179 locations->SetOut(Location::RequiresRegister());
180 if (is64bit) {
181 locations->AddTemp(Location::RequiresFpuRegister());
182 }
183}
184
185static void CreateIntToFPLocations(ArenaAllocator* arena, HInvoke* invoke, bool is64bit) {
186 LocationSummary* locations = new (arena) LocationSummary(invoke,
187 LocationSummary::kNoCall,
188 kIntrinsified);
189 locations->SetInAt(0, Location::RequiresRegister());
190 locations->SetOut(Location::RequiresFpuRegister());
191 if (is64bit) {
192 locations->AddTemp(Location::RequiresFpuRegister());
193 locations->AddTemp(Location::RequiresFpuRegister());
194 }
195}
196
197static void MoveFPToInt(LocationSummary* locations, bool is64bit, X86Assembler* assembler) {
198 Location input = locations->InAt(0);
199 Location output = locations->Out();
200 if (is64bit) {
201 // Need to use the temporary.
202 XmmRegister temp = locations->GetTemp(0).AsFpuRegister<XmmRegister>();
203 __ movsd(temp, input.AsFpuRegister<XmmRegister>());
204 __ movd(output.AsRegisterPairLow<Register>(), temp);
205 __ psrlq(temp, Immediate(32));
206 __ movd(output.AsRegisterPairHigh<Register>(), temp);
207 } else {
208 __ movd(output.AsRegister<Register>(), input.AsFpuRegister<XmmRegister>());
209 }
210}
211
212static void MoveIntToFP(LocationSummary* locations, bool is64bit, X86Assembler* assembler) {
213 Location input = locations->InAt(0);
214 Location output = locations->Out();
215 if (is64bit) {
216 // Need to use the temporary.
217 XmmRegister temp1 = locations->GetTemp(0).AsFpuRegister<XmmRegister>();
218 XmmRegister temp2 = locations->GetTemp(1).AsFpuRegister<XmmRegister>();
219 __ movd(temp1, input.AsRegisterPairLow<Register>());
220 __ movd(temp2, input.AsRegisterPairHigh<Register>());
221 __ punpckldq(temp1, temp2);
222 __ movsd(output.AsFpuRegister<XmmRegister>(), temp1);
223 } else {
224 __ movd(output.AsFpuRegister<XmmRegister>(), input.AsRegister<Register>());
225 }
226}
227
228void IntrinsicLocationsBuilderX86::VisitDoubleDoubleToRawLongBits(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000229 CreateFPToIntLocations(arena_, invoke, /* is64bit */ true);
Mark Mendell09ed1a32015-03-25 08:30:06 -0400230}
231void IntrinsicLocationsBuilderX86::VisitDoubleLongBitsToDouble(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000232 CreateIntToFPLocations(arena_, invoke, /* is64bit */ true);
Mark Mendell09ed1a32015-03-25 08:30:06 -0400233}
234
235void IntrinsicCodeGeneratorX86::VisitDoubleDoubleToRawLongBits(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000236 MoveFPToInt(invoke->GetLocations(), /* is64bit */ true, GetAssembler());
Mark Mendell09ed1a32015-03-25 08:30:06 -0400237}
238void IntrinsicCodeGeneratorX86::VisitDoubleLongBitsToDouble(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000239 MoveIntToFP(invoke->GetLocations(), /* is64bit */ true, GetAssembler());
Mark Mendell09ed1a32015-03-25 08:30:06 -0400240}
241
242void IntrinsicLocationsBuilderX86::VisitFloatFloatToRawIntBits(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000243 CreateFPToIntLocations(arena_, invoke, /* is64bit */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -0400244}
245void IntrinsicLocationsBuilderX86::VisitFloatIntBitsToFloat(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000246 CreateIntToFPLocations(arena_, invoke, /* is64bit */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -0400247}
248
249void IntrinsicCodeGeneratorX86::VisitFloatFloatToRawIntBits(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000250 MoveFPToInt(invoke->GetLocations(), /* is64bit */ false, GetAssembler());
Mark Mendell09ed1a32015-03-25 08:30:06 -0400251}
252void IntrinsicCodeGeneratorX86::VisitFloatIntBitsToFloat(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000253 MoveIntToFP(invoke->GetLocations(), /* is64bit */ false, GetAssembler());
Mark Mendell09ed1a32015-03-25 08:30:06 -0400254}
255
256static void CreateIntToIntLocations(ArenaAllocator* arena, HInvoke* invoke) {
257 LocationSummary* locations = new (arena) LocationSummary(invoke,
258 LocationSummary::kNoCall,
259 kIntrinsified);
260 locations->SetInAt(0, Location::RequiresRegister());
261 locations->SetOut(Location::SameAsFirstInput());
262}
263
264static void CreateLongToIntLocations(ArenaAllocator* arena, HInvoke* invoke) {
265 LocationSummary* locations = new (arena) LocationSummary(invoke,
266 LocationSummary::kNoCall,
267 kIntrinsified);
268 locations->SetInAt(0, Location::RequiresRegister());
269 locations->SetOut(Location::RequiresRegister());
270}
271
272static void CreateLongToLongLocations(ArenaAllocator* arena, HInvoke* invoke) {
273 LocationSummary* locations = new (arena) LocationSummary(invoke,
274 LocationSummary::kNoCall,
275 kIntrinsified);
276 locations->SetInAt(0, Location::RequiresRegister());
277 locations->SetOut(Location::RequiresRegister(), Location::kOutputOverlap);
278}
279
280static void GenReverseBytes(LocationSummary* locations,
281 Primitive::Type size,
282 X86Assembler* assembler) {
283 Register out = locations->Out().AsRegister<Register>();
284
285 switch (size) {
286 case Primitive::kPrimShort:
287 // TODO: Can be done with an xchg of 8b registers. This is straight from Quick.
288 __ bswapl(out);
289 __ sarl(out, Immediate(16));
290 break;
291 case Primitive::kPrimInt:
292 __ bswapl(out);
293 break;
294 default:
295 LOG(FATAL) << "Unexpected size for reverse-bytes: " << size;
296 UNREACHABLE();
297 }
298}
299
300void IntrinsicLocationsBuilderX86::VisitIntegerReverseBytes(HInvoke* invoke) {
301 CreateIntToIntLocations(arena_, invoke);
302}
303
304void IntrinsicCodeGeneratorX86::VisitIntegerReverseBytes(HInvoke* invoke) {
305 GenReverseBytes(invoke->GetLocations(), Primitive::kPrimInt, GetAssembler());
306}
307
Mark Mendell58d25fd2015-04-03 14:52:31 -0400308void IntrinsicLocationsBuilderX86::VisitLongReverseBytes(HInvoke* invoke) {
309 CreateLongToLongLocations(arena_, invoke);
310}
311
312void IntrinsicCodeGeneratorX86::VisitLongReverseBytes(HInvoke* invoke) {
313 LocationSummary* locations = invoke->GetLocations();
314 Location input = locations->InAt(0);
315 Register input_lo = input.AsRegisterPairLow<Register>();
316 Register input_hi = input.AsRegisterPairHigh<Register>();
317 Location output = locations->Out();
318 Register output_lo = output.AsRegisterPairLow<Register>();
319 Register output_hi = output.AsRegisterPairHigh<Register>();
320
321 X86Assembler* assembler = GetAssembler();
322 // Assign the inputs to the outputs, mixing low/high.
323 __ movl(output_lo, input_hi);
324 __ movl(output_hi, input_lo);
325 __ bswapl(output_lo);
326 __ bswapl(output_hi);
327}
328
Mark Mendell09ed1a32015-03-25 08:30:06 -0400329void IntrinsicLocationsBuilderX86::VisitShortReverseBytes(HInvoke* invoke) {
330 CreateIntToIntLocations(arena_, invoke);
331}
332
333void IntrinsicCodeGeneratorX86::VisitShortReverseBytes(HInvoke* invoke) {
334 GenReverseBytes(invoke->GetLocations(), Primitive::kPrimShort, GetAssembler());
335}
336
337
338// TODO: Consider Quick's way of doing Double abs through integer operations, as the immediate we
339// need is 64b.
340
341static void CreateFloatToFloat(ArenaAllocator* arena, HInvoke* invoke) {
342 // TODO: Enable memory operations when the assembler supports them.
343 LocationSummary* locations = new (arena) LocationSummary(invoke,
344 LocationSummary::kNoCall,
345 kIntrinsified);
346 locations->SetInAt(0, Location::RequiresFpuRegister());
Mark Mendell09ed1a32015-03-25 08:30:06 -0400347 locations->SetOut(Location::SameAsFirstInput());
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000348 HInvokeStaticOrDirect* static_or_direct = invoke->AsInvokeStaticOrDirect();
349 DCHECK(static_or_direct != nullptr);
Nicolas Geoffray97793072016-02-16 15:33:54 +0000350 if (static_or_direct->HasSpecialInput() &&
351 invoke->InputAt(static_or_direct->GetSpecialInputIndex())->IsX86ComputeBaseMethodAddress()) {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000352 // We need addressibility for the constant area.
353 locations->SetInAt(1, Location::RequiresRegister());
354 // We need a temporary to hold the constant.
355 locations->AddTemp(Location::RequiresFpuRegister());
356 }
Mark Mendell09ed1a32015-03-25 08:30:06 -0400357}
358
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000359static void MathAbsFP(LocationSummary* locations,
360 bool is64bit,
361 X86Assembler* assembler,
362 CodeGeneratorX86* codegen) {
Mark Mendell09ed1a32015-03-25 08:30:06 -0400363 Location output = locations->Out();
364
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000365 DCHECK(output.IsFpuRegister());
Nicolas Geoffray97793072016-02-16 15:33:54 +0000366 if (locations->GetInputCount() == 2 && locations->InAt(1).IsValid()) {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000367 DCHECK(locations->InAt(1).IsRegister());
368 // We also have a constant area pointer.
369 Register constant_area = locations->InAt(1).AsRegister<Register>();
370 XmmRegister temp = locations->GetTemp(0).AsFpuRegister<XmmRegister>();
371 if (is64bit) {
372 __ movsd(temp, codegen->LiteralInt64Address(INT64_C(0x7FFFFFFFFFFFFFFF), constant_area));
373 __ andpd(output.AsFpuRegister<XmmRegister>(), temp);
374 } else {
375 __ movss(temp, codegen->LiteralInt32Address(INT32_C(0x7FFFFFFF), constant_area));
376 __ andps(output.AsFpuRegister<XmmRegister>(), temp);
377 }
378 } else {
Mark Mendell09ed1a32015-03-25 08:30:06 -0400379 // Create the right constant on an aligned stack.
380 if (is64bit) {
381 __ subl(ESP, Immediate(8));
382 __ pushl(Immediate(0x7FFFFFFF));
383 __ pushl(Immediate(0xFFFFFFFF));
384 __ andpd(output.AsFpuRegister<XmmRegister>(), Address(ESP, 0));
385 } else {
386 __ subl(ESP, Immediate(12));
387 __ pushl(Immediate(0x7FFFFFFF));
388 __ andps(output.AsFpuRegister<XmmRegister>(), Address(ESP, 0));
389 }
390 __ addl(ESP, Immediate(16));
Mark Mendell09ed1a32015-03-25 08:30:06 -0400391 }
392}
393
394void IntrinsicLocationsBuilderX86::VisitMathAbsDouble(HInvoke* invoke) {
395 CreateFloatToFloat(arena_, invoke);
396}
397
398void IntrinsicCodeGeneratorX86::VisitMathAbsDouble(HInvoke* invoke) {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000399 MathAbsFP(invoke->GetLocations(), /* is64bit */ true, GetAssembler(), codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -0400400}
401
402void IntrinsicLocationsBuilderX86::VisitMathAbsFloat(HInvoke* invoke) {
403 CreateFloatToFloat(arena_, invoke);
404}
405
406void IntrinsicCodeGeneratorX86::VisitMathAbsFloat(HInvoke* invoke) {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000407 MathAbsFP(invoke->GetLocations(), /* is64bit */ false, GetAssembler(), codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -0400408}
409
410static void CreateAbsIntLocation(ArenaAllocator* arena, HInvoke* invoke) {
411 LocationSummary* locations = new (arena) LocationSummary(invoke,
412 LocationSummary::kNoCall,
413 kIntrinsified);
414 locations->SetInAt(0, Location::RegisterLocation(EAX));
415 locations->SetOut(Location::SameAsFirstInput());
416 locations->AddTemp(Location::RegisterLocation(EDX));
417}
418
419static void GenAbsInteger(LocationSummary* locations, X86Assembler* assembler) {
420 Location output = locations->Out();
421 Register out = output.AsRegister<Register>();
422 DCHECK_EQ(out, EAX);
423 Register temp = locations->GetTemp(0).AsRegister<Register>();
424 DCHECK_EQ(temp, EDX);
425
426 // Sign extend EAX into EDX.
427 __ cdq();
428
429 // XOR EAX with sign.
430 __ xorl(EAX, EDX);
431
432 // Subtract out sign to correct.
433 __ subl(EAX, EDX);
434
435 // The result is in EAX.
436}
437
438static void CreateAbsLongLocation(ArenaAllocator* arena, HInvoke* invoke) {
439 LocationSummary* locations = new (arena) LocationSummary(invoke,
440 LocationSummary::kNoCall,
441 kIntrinsified);
442 locations->SetInAt(0, Location::RequiresRegister());
443 locations->SetOut(Location::RequiresRegister(), Location::kOutputOverlap);
444 locations->AddTemp(Location::RequiresRegister());
445}
446
447static void GenAbsLong(LocationSummary* locations, X86Assembler* assembler) {
448 Location input = locations->InAt(0);
449 Register input_lo = input.AsRegisterPairLow<Register>();
450 Register input_hi = input.AsRegisterPairHigh<Register>();
451 Location output = locations->Out();
452 Register output_lo = output.AsRegisterPairLow<Register>();
453 Register output_hi = output.AsRegisterPairHigh<Register>();
454 Register temp = locations->GetTemp(0).AsRegister<Register>();
455
456 // Compute the sign into the temporary.
457 __ movl(temp, input_hi);
458 __ sarl(temp, Immediate(31));
459
460 // Store the sign into the output.
461 __ movl(output_lo, temp);
462 __ movl(output_hi, temp);
463
464 // XOR the input to the output.
465 __ xorl(output_lo, input_lo);
466 __ xorl(output_hi, input_hi);
467
468 // Subtract the sign.
469 __ subl(output_lo, temp);
470 __ sbbl(output_hi, temp);
471}
472
473void IntrinsicLocationsBuilderX86::VisitMathAbsInt(HInvoke* invoke) {
474 CreateAbsIntLocation(arena_, invoke);
475}
476
477void IntrinsicCodeGeneratorX86::VisitMathAbsInt(HInvoke* invoke) {
478 GenAbsInteger(invoke->GetLocations(), GetAssembler());
479}
480
481void IntrinsicLocationsBuilderX86::VisitMathAbsLong(HInvoke* invoke) {
482 CreateAbsLongLocation(arena_, invoke);
483}
484
485void IntrinsicCodeGeneratorX86::VisitMathAbsLong(HInvoke* invoke) {
486 GenAbsLong(invoke->GetLocations(), GetAssembler());
487}
488
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000489static void GenMinMaxFP(LocationSummary* locations,
490 bool is_min,
491 bool is_double,
492 X86Assembler* assembler,
493 CodeGeneratorX86* codegen) {
Mark Mendell09ed1a32015-03-25 08:30:06 -0400494 Location op1_loc = locations->InAt(0);
495 Location op2_loc = locations->InAt(1);
496 Location out_loc = locations->Out();
497 XmmRegister out = out_loc.AsFpuRegister<XmmRegister>();
498
499 // Shortcut for same input locations.
500 if (op1_loc.Equals(op2_loc)) {
501 DCHECK(out_loc.Equals(op1_loc));
502 return;
503 }
504
505 // (out := op1)
506 // out <=? op2
507 // if Nan jmp Nan_label
508 // if out is min jmp done
509 // if op2 is min jmp op2_label
510 // handle -0/+0
511 // jmp done
512 // Nan_label:
513 // out := NaN
514 // op2_label:
515 // out := op2
516 // done:
517 //
518 // This removes one jmp, but needs to copy one input (op1) to out.
519 //
520 // TODO: This is straight from Quick (except literal pool). Make NaN an out-of-line slowpath?
521
522 XmmRegister op2 = op2_loc.AsFpuRegister<XmmRegister>();
523
Mark Mendell0c9497d2015-08-21 09:30:05 -0400524 NearLabel nan, done, op2_label;
Mark Mendell09ed1a32015-03-25 08:30:06 -0400525 if (is_double) {
526 __ ucomisd(out, op2);
527 } else {
528 __ ucomiss(out, op2);
529 }
530
531 __ j(Condition::kParityEven, &nan);
532
533 __ j(is_min ? Condition::kAbove : Condition::kBelow, &op2_label);
534 __ j(is_min ? Condition::kBelow : Condition::kAbove, &done);
535
536 // Handle 0.0/-0.0.
537 if (is_min) {
538 if (is_double) {
539 __ orpd(out, op2);
540 } else {
541 __ orps(out, op2);
542 }
543 } else {
544 if (is_double) {
545 __ andpd(out, op2);
546 } else {
547 __ andps(out, op2);
548 }
549 }
550 __ jmp(&done);
551
552 // NaN handling.
553 __ Bind(&nan);
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000554 // Do we have a constant area pointer?
Nicolas Geoffray97793072016-02-16 15:33:54 +0000555 if (locations->GetInputCount() == 3 && locations->InAt(2).IsValid()) {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000556 DCHECK(locations->InAt(2).IsRegister());
557 Register constant_area = locations->InAt(2).AsRegister<Register>();
558 if (is_double) {
559 __ movsd(out, codegen->LiteralInt64Address(kDoubleNaN, constant_area));
560 } else {
561 __ movss(out, codegen->LiteralInt32Address(kFloatNaN, constant_area));
562 }
Mark Mendell09ed1a32015-03-25 08:30:06 -0400563 } else {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000564 if (is_double) {
565 __ pushl(Immediate(kDoubleNaNHigh));
566 __ pushl(Immediate(kDoubleNaNLow));
567 __ movsd(out, Address(ESP, 0));
568 __ addl(ESP, Immediate(8));
569 } else {
570 __ pushl(Immediate(kFloatNaN));
571 __ movss(out, Address(ESP, 0));
572 __ addl(ESP, Immediate(4));
573 }
Mark Mendell09ed1a32015-03-25 08:30:06 -0400574 }
575 __ jmp(&done);
576
577 // out := op2;
578 __ Bind(&op2_label);
579 if (is_double) {
580 __ movsd(out, op2);
581 } else {
582 __ movss(out, op2);
583 }
584
585 // Done.
586 __ Bind(&done);
587}
588
589static void CreateFPFPToFPLocations(ArenaAllocator* arena, HInvoke* invoke) {
590 LocationSummary* locations = new (arena) LocationSummary(invoke,
591 LocationSummary::kNoCall,
592 kIntrinsified);
593 locations->SetInAt(0, Location::RequiresFpuRegister());
594 locations->SetInAt(1, Location::RequiresFpuRegister());
595 // The following is sub-optimal, but all we can do for now. It would be fine to also accept
596 // the second input to be the output (we can simply swap inputs).
597 locations->SetOut(Location::SameAsFirstInput());
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000598 HInvokeStaticOrDirect* static_or_direct = invoke->AsInvokeStaticOrDirect();
599 DCHECK(static_or_direct != nullptr);
Nicolas Geoffray97793072016-02-16 15:33:54 +0000600 if (static_or_direct->HasSpecialInput() &&
601 invoke->InputAt(static_or_direct->GetSpecialInputIndex())->IsX86ComputeBaseMethodAddress()) {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000602 locations->SetInAt(2, Location::RequiresRegister());
603 }
Mark Mendell09ed1a32015-03-25 08:30:06 -0400604}
605
606void IntrinsicLocationsBuilderX86::VisitMathMinDoubleDouble(HInvoke* invoke) {
607 CreateFPFPToFPLocations(arena_, invoke);
608}
609
610void IntrinsicCodeGeneratorX86::VisitMathMinDoubleDouble(HInvoke* invoke) {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000611 GenMinMaxFP(invoke->GetLocations(),
612 /* is_min */ true,
613 /* is_double */ true,
614 GetAssembler(),
615 codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -0400616}
617
618void IntrinsicLocationsBuilderX86::VisitMathMinFloatFloat(HInvoke* invoke) {
619 CreateFPFPToFPLocations(arena_, invoke);
620}
621
622void IntrinsicCodeGeneratorX86::VisitMathMinFloatFloat(HInvoke* invoke) {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000623 GenMinMaxFP(invoke->GetLocations(),
624 /* is_min */ true,
625 /* is_double */ false,
626 GetAssembler(),
627 codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -0400628}
629
630void IntrinsicLocationsBuilderX86::VisitMathMaxDoubleDouble(HInvoke* invoke) {
631 CreateFPFPToFPLocations(arena_, invoke);
632}
633
634void IntrinsicCodeGeneratorX86::VisitMathMaxDoubleDouble(HInvoke* invoke) {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000635 GenMinMaxFP(invoke->GetLocations(),
636 /* is_min */ false,
637 /* is_double */ true,
638 GetAssembler(),
639 codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -0400640}
641
642void IntrinsicLocationsBuilderX86::VisitMathMaxFloatFloat(HInvoke* invoke) {
643 CreateFPFPToFPLocations(arena_, invoke);
644}
645
646void IntrinsicCodeGeneratorX86::VisitMathMaxFloatFloat(HInvoke* invoke) {
Mark P Mendell2f10a5f2016-01-25 14:47:50 +0000647 GenMinMaxFP(invoke->GetLocations(),
648 /* is_min */ false,
649 /* is_double */ false,
650 GetAssembler(),
651 codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -0400652}
653
654static void GenMinMax(LocationSummary* locations, bool is_min, bool is_long,
655 X86Assembler* assembler) {
656 Location op1_loc = locations->InAt(0);
657 Location op2_loc = locations->InAt(1);
658
659 // Shortcut for same input locations.
660 if (op1_loc.Equals(op2_loc)) {
661 // Can return immediately, as op1_loc == out_loc.
662 // Note: if we ever support separate registers, e.g., output into memory, we need to check for
663 // a copy here.
664 DCHECK(locations->Out().Equals(op1_loc));
665 return;
666 }
667
668 if (is_long) {
669 // Need to perform a subtract to get the sign right.
670 // op1 is already in the same location as the output.
671 Location output = locations->Out();
672 Register output_lo = output.AsRegisterPairLow<Register>();
673 Register output_hi = output.AsRegisterPairHigh<Register>();
674
675 Register op2_lo = op2_loc.AsRegisterPairLow<Register>();
676 Register op2_hi = op2_loc.AsRegisterPairHigh<Register>();
677
678 // Spare register to compute the subtraction to set condition code.
679 Register temp = locations->GetTemp(0).AsRegister<Register>();
680
681 // Subtract off op2_low.
682 __ movl(temp, output_lo);
683 __ subl(temp, op2_lo);
684
685 // Now use the same tempo and the borrow to finish the subtraction of op2_hi.
686 __ movl(temp, output_hi);
687 __ sbbl(temp, op2_hi);
688
689 // Now the condition code is correct.
690 Condition cond = is_min ? Condition::kGreaterEqual : Condition::kLess;
691 __ cmovl(cond, output_lo, op2_lo);
692 __ cmovl(cond, output_hi, op2_hi);
693 } else {
694 Register out = locations->Out().AsRegister<Register>();
695 Register op2 = op2_loc.AsRegister<Register>();
696
697 // (out := op1)
698 // out <=? op2
699 // if out is min jmp done
700 // out := op2
701 // done:
702
703 __ cmpl(out, op2);
704 Condition cond = is_min ? Condition::kGreater : Condition::kLess;
705 __ cmovl(cond, out, op2);
706 }
707}
708
709static void CreateIntIntToIntLocations(ArenaAllocator* arena, HInvoke* invoke) {
710 LocationSummary* locations = new (arena) LocationSummary(invoke,
711 LocationSummary::kNoCall,
712 kIntrinsified);
713 locations->SetInAt(0, Location::RequiresRegister());
714 locations->SetInAt(1, Location::RequiresRegister());
715 locations->SetOut(Location::SameAsFirstInput());
716}
717
718static void CreateLongLongToLongLocations(ArenaAllocator* arena, HInvoke* invoke) {
719 LocationSummary* locations = new (arena) LocationSummary(invoke,
720 LocationSummary::kNoCall,
721 kIntrinsified);
722 locations->SetInAt(0, Location::RequiresRegister());
723 locations->SetInAt(1, Location::RequiresRegister());
724 locations->SetOut(Location::SameAsFirstInput());
725 // Register to use to perform a long subtract to set cc.
726 locations->AddTemp(Location::RequiresRegister());
727}
728
729void IntrinsicLocationsBuilderX86::VisitMathMinIntInt(HInvoke* invoke) {
730 CreateIntIntToIntLocations(arena_, invoke);
731}
732
733void IntrinsicCodeGeneratorX86::VisitMathMinIntInt(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000734 GenMinMax(invoke->GetLocations(), /* is_min */ true, /* is_long */ false, GetAssembler());
Mark Mendell09ed1a32015-03-25 08:30:06 -0400735}
736
737void IntrinsicLocationsBuilderX86::VisitMathMinLongLong(HInvoke* invoke) {
738 CreateLongLongToLongLocations(arena_, invoke);
739}
740
741void IntrinsicCodeGeneratorX86::VisitMathMinLongLong(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000742 GenMinMax(invoke->GetLocations(), /* is_min */ true, /* is_long */ true, GetAssembler());
Mark Mendell09ed1a32015-03-25 08:30:06 -0400743}
744
745void IntrinsicLocationsBuilderX86::VisitMathMaxIntInt(HInvoke* invoke) {
746 CreateIntIntToIntLocations(arena_, invoke);
747}
748
749void IntrinsicCodeGeneratorX86::VisitMathMaxIntInt(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000750 GenMinMax(invoke->GetLocations(), /* is_min */ false, /* is_long */ false, GetAssembler());
Mark Mendell09ed1a32015-03-25 08:30:06 -0400751}
752
753void IntrinsicLocationsBuilderX86::VisitMathMaxLongLong(HInvoke* invoke) {
754 CreateLongLongToLongLocations(arena_, invoke);
755}
756
757void IntrinsicCodeGeneratorX86::VisitMathMaxLongLong(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +0000758 GenMinMax(invoke->GetLocations(), /* is_min */ false, /* is_long */ true, GetAssembler());
Mark Mendell09ed1a32015-03-25 08:30:06 -0400759}
760
761static void CreateFPToFPLocations(ArenaAllocator* arena, HInvoke* invoke) {
762 LocationSummary* locations = new (arena) LocationSummary(invoke,
763 LocationSummary::kNoCall,
764 kIntrinsified);
765 locations->SetInAt(0, Location::RequiresFpuRegister());
766 locations->SetOut(Location::RequiresFpuRegister());
767}
768
769void IntrinsicLocationsBuilderX86::VisitMathSqrt(HInvoke* invoke) {
770 CreateFPToFPLocations(arena_, invoke);
771}
772
773void IntrinsicCodeGeneratorX86::VisitMathSqrt(HInvoke* invoke) {
774 LocationSummary* locations = invoke->GetLocations();
775 XmmRegister in = locations->InAt(0).AsFpuRegister<XmmRegister>();
776 XmmRegister out = locations->Out().AsFpuRegister<XmmRegister>();
777
778 GetAssembler()->sqrtsd(out, in);
779}
780
Mark Mendellfb8d2792015-03-31 22:16:59 -0400781static void InvokeOutOfLineIntrinsic(CodeGeneratorX86* codegen, HInvoke* invoke) {
Roland Levillainec525fc2015-04-28 15:50:20 +0100782 MoveArguments(invoke, codegen);
Mark Mendellfb8d2792015-03-31 22:16:59 -0400783
784 DCHECK(invoke->IsInvokeStaticOrDirect());
Nicolas Geoffray94015b92015-06-04 18:21:04 +0100785 codegen->GenerateStaticOrDirectCall(invoke->AsInvokeStaticOrDirect(),
786 Location::RegisterLocation(EAX));
Mingyao Yange90db122015-04-03 17:56:54 -0700787 codegen->RecordPcInfo(invoke, invoke->GetDexPc());
Mark Mendellfb8d2792015-03-31 22:16:59 -0400788
789 // Copy the result back to the expected output.
790 Location out = invoke->GetLocations()->Out();
791 if (out.IsValid()) {
792 DCHECK(out.IsRegister());
Andreas Gampe85b62f22015-09-09 13:15:38 -0700793 codegen->MoveFromReturnRegister(out, invoke->GetType());
Mark Mendellfb8d2792015-03-31 22:16:59 -0400794 }
795}
796
797static void CreateSSE41FPToFPLocations(ArenaAllocator* arena,
798 HInvoke* invoke,
799 CodeGeneratorX86* codegen) {
800 // Do we have instruction support?
801 if (codegen->GetInstructionSetFeatures().HasSSE4_1()) {
802 CreateFPToFPLocations(arena, invoke);
803 return;
804 }
805
806 // We have to fall back to a call to the intrinsic.
807 LocationSummary* locations = new (arena) LocationSummary(invoke,
Serban Constantinescu54ff4822016-07-07 18:03:19 +0100808 LocationSummary::kCallOnMainOnly);
Mark Mendellfb8d2792015-03-31 22:16:59 -0400809 InvokeRuntimeCallingConvention calling_convention;
810 locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetFpuRegisterAt(0)));
811 locations->SetOut(Location::FpuRegisterLocation(XMM0));
812 // Needs to be EAX for the invoke.
813 locations->AddTemp(Location::RegisterLocation(EAX));
814}
815
816static void GenSSE41FPToFPIntrinsic(CodeGeneratorX86* codegen,
817 HInvoke* invoke,
818 X86Assembler* assembler,
819 int round_mode) {
820 LocationSummary* locations = invoke->GetLocations();
821 if (locations->WillCall()) {
822 InvokeOutOfLineIntrinsic(codegen, invoke);
823 } else {
824 XmmRegister in = locations->InAt(0).AsFpuRegister<XmmRegister>();
825 XmmRegister out = locations->Out().AsFpuRegister<XmmRegister>();
826 __ roundsd(out, in, Immediate(round_mode));
827 }
828}
829
830void IntrinsicLocationsBuilderX86::VisitMathCeil(HInvoke* invoke) {
831 CreateSSE41FPToFPLocations(arena_, invoke, codegen_);
832}
833
834void IntrinsicCodeGeneratorX86::VisitMathCeil(HInvoke* invoke) {
835 GenSSE41FPToFPIntrinsic(codegen_, invoke, GetAssembler(), 2);
836}
837
838void IntrinsicLocationsBuilderX86::VisitMathFloor(HInvoke* invoke) {
839 CreateSSE41FPToFPLocations(arena_, invoke, codegen_);
840}
841
842void IntrinsicCodeGeneratorX86::VisitMathFloor(HInvoke* invoke) {
843 GenSSE41FPToFPIntrinsic(codegen_, invoke, GetAssembler(), 1);
844}
845
846void IntrinsicLocationsBuilderX86::VisitMathRint(HInvoke* invoke) {
847 CreateSSE41FPToFPLocations(arena_, invoke, codegen_);
848}
849
850void IntrinsicCodeGeneratorX86::VisitMathRint(HInvoke* invoke) {
851 GenSSE41FPToFPIntrinsic(codegen_, invoke, GetAssembler(), 0);
852}
853
Mark Mendellfb8d2792015-03-31 22:16:59 -0400854void IntrinsicLocationsBuilderX86::VisitMathRoundFloat(HInvoke* invoke) {
855 // Do we have instruction support?
856 if (codegen_->GetInstructionSetFeatures().HasSSE4_1()) {
Aart Bik2c9f4952016-08-01 16:52:27 -0700857 HInvokeStaticOrDirect* static_or_direct = invoke->AsInvokeStaticOrDirect();
858 DCHECK(static_or_direct != nullptr);
Mark Mendellfb8d2792015-03-31 22:16:59 -0400859 LocationSummary* locations = new (arena_) LocationSummary(invoke,
860 LocationSummary::kNoCall,
861 kIntrinsified);
862 locations->SetInAt(0, Location::RequiresFpuRegister());
Aart Bik2c9f4952016-08-01 16:52:27 -0700863 if (static_or_direct->HasSpecialInput() &&
864 invoke->InputAt(
865 static_or_direct->GetSpecialInputIndex())->IsX86ComputeBaseMethodAddress()) {
866 locations->SetInAt(1, Location::RequiresRegister());
867 }
Nicolas Geoffrayd9b92402015-04-21 10:02:22 +0100868 locations->SetOut(Location::RequiresRegister());
Mark Mendellfb8d2792015-03-31 22:16:59 -0400869 locations->AddTemp(Location::RequiresFpuRegister());
870 locations->AddTemp(Location::RequiresFpuRegister());
871 return;
872 }
873
874 // We have to fall back to a call to the intrinsic.
875 LocationSummary* locations = new (arena_) LocationSummary(invoke,
Aart Bik2c9f4952016-08-01 16:52:27 -0700876 LocationSummary::kCallOnMainOnly);
Mark Mendellfb8d2792015-03-31 22:16:59 -0400877 InvokeRuntimeCallingConvention calling_convention;
878 locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetFpuRegisterAt(0)));
879 locations->SetOut(Location::RegisterLocation(EAX));
880 // Needs to be EAX for the invoke.
881 locations->AddTemp(Location::RegisterLocation(EAX));
882}
883
884void IntrinsicCodeGeneratorX86::VisitMathRoundFloat(HInvoke* invoke) {
885 LocationSummary* locations = invoke->GetLocations();
Aart Bik2c9f4952016-08-01 16:52:27 -0700886 if (locations->WillCall()) { // TODO: can we reach this?
Mark Mendellfb8d2792015-03-31 22:16:59 -0400887 InvokeOutOfLineIntrinsic(codegen_, invoke);
888 return;
889 }
890
Mark Mendellfb8d2792015-03-31 22:16:59 -0400891 XmmRegister in = locations->InAt(0).AsFpuRegister<XmmRegister>();
Aart Bik2c9f4952016-08-01 16:52:27 -0700892 XmmRegister t1 = locations->GetTemp(0).AsFpuRegister<XmmRegister>();
893 XmmRegister t2 = locations->GetTemp(1).AsFpuRegister<XmmRegister>();
Mark Mendellfb8d2792015-03-31 22:16:59 -0400894 Register out = locations->Out().AsRegister<Register>();
Aart Bik2c9f4952016-08-01 16:52:27 -0700895 NearLabel skip_incr, done;
Mark Mendellfb8d2792015-03-31 22:16:59 -0400896 X86Assembler* assembler = GetAssembler();
897
Aart Bik2c9f4952016-08-01 16:52:27 -0700898 // Since no direct x86 rounding instruction matches the required semantics,
899 // this intrinsic is implemented as follows:
900 // result = floor(in);
901 // if (in - result >= 0.5f)
902 // result = result + 1.0f;
903 __ movss(t2, in);
904 __ roundss(t1, in, Immediate(1));
905 __ subss(t2, t1);
Aart Bik0cf8d9c2016-08-10 14:05:54 -0700906 if (locations->GetInputCount() == 2 && locations->InAt(1).IsValid()) {
907 // Direct constant area available.
908 Register constant_area = locations->InAt(1).AsRegister<Register>();
909 __ comiss(t2, codegen_->LiteralInt32Address(bit_cast<int32_t, float>(0.5f), constant_area));
910 __ j(kBelow, &skip_incr);
911 __ addss(t1, codegen_->LiteralInt32Address(bit_cast<int32_t, float>(1.0f), constant_area));
912 __ Bind(&skip_incr);
913 } else {
914 // No constant area: go through stack.
915 __ pushl(Immediate(bit_cast<int32_t, float>(0.5f)));
916 __ pushl(Immediate(bit_cast<int32_t, float>(1.0f)));
917 __ comiss(t2, Address(ESP, 4));
918 __ j(kBelow, &skip_incr);
919 __ addss(t1, Address(ESP, 0));
920 __ Bind(&skip_incr);
921 __ addl(ESP, Immediate(8));
922 }
Mark Mendellfb8d2792015-03-31 22:16:59 -0400923
Aart Bik2c9f4952016-08-01 16:52:27 -0700924 // Final conversion to an integer. Unfortunately this also does not have a
925 // direct x86 instruction, since NaN should map to 0 and large positive
926 // values need to be clipped to the extreme value.
Mark Mendellfb8d2792015-03-31 22:16:59 -0400927 __ movl(out, Immediate(kPrimIntMax));
Aart Bik2c9f4952016-08-01 16:52:27 -0700928 __ cvtsi2ss(t2, out);
929 __ comiss(t1, t2);
930 __ j(kAboveEqual, &done); // clipped to max (already in out), does not jump on unordered
931 __ movl(out, Immediate(0)); // does not change flags
932 __ j(kUnordered, &done); // NaN mapped to 0 (just moved in out)
933 __ cvttss2si(out, t1);
Mark Mendellfb8d2792015-03-31 22:16:59 -0400934 __ Bind(&done);
935}
936
Mark Mendella4f12202015-08-06 15:23:34 -0400937static void CreateFPToFPCallLocations(ArenaAllocator* arena,
938 HInvoke* invoke) {
939 LocationSummary* locations = new (arena) LocationSummary(invoke,
Serban Constantinescu54ff4822016-07-07 18:03:19 +0100940 LocationSummary::kCallOnMainOnly,
Mark Mendella4f12202015-08-06 15:23:34 -0400941 kIntrinsified);
942 InvokeRuntimeCallingConvention calling_convention;
943 locations->SetInAt(0, Location::FpuRegisterLocation(calling_convention.GetFpuRegisterAt(0)));
944 locations->SetOut(Location::FpuRegisterLocation(XMM0));
945}
946
947static void GenFPToFPCall(HInvoke* invoke, CodeGeneratorX86* codegen, QuickEntrypointEnum entry) {
948 LocationSummary* locations = invoke->GetLocations();
949 DCHECK(locations->WillCall());
950 DCHECK(invoke->IsInvokeStaticOrDirect());
951 X86Assembler* assembler = codegen->GetAssembler();
952
953 // We need some place to pass the parameters.
954 __ subl(ESP, Immediate(16));
955 __ cfi().AdjustCFAOffset(16);
956
957 // Pass the parameters at the bottom of the stack.
958 __ movsd(Address(ESP, 0), XMM0);
959
960 // If we have a second parameter, pass it next.
961 if (invoke->GetNumberOfArguments() == 2) {
962 __ movsd(Address(ESP, 8), XMM1);
963 }
964
965 // Now do the actual call.
Serban Constantinescuba45db02016-07-12 22:53:02 +0100966 codegen->InvokeRuntime(entry, invoke, invoke->GetDexPc());
Mark Mendella4f12202015-08-06 15:23:34 -0400967
968 // Extract the return value from the FP stack.
969 __ fstpl(Address(ESP, 0));
970 __ movsd(XMM0, Address(ESP, 0));
971
972 // And clean up the stack.
973 __ addl(ESP, Immediate(16));
974 __ cfi().AdjustCFAOffset(-16);
Mark Mendella4f12202015-08-06 15:23:34 -0400975}
976
977void IntrinsicLocationsBuilderX86::VisitMathCos(HInvoke* invoke) {
978 CreateFPToFPCallLocations(arena_, invoke);
979}
980
981void IntrinsicCodeGeneratorX86::VisitMathCos(HInvoke* invoke) {
982 GenFPToFPCall(invoke, codegen_, kQuickCos);
983}
984
985void IntrinsicLocationsBuilderX86::VisitMathSin(HInvoke* invoke) {
986 CreateFPToFPCallLocations(arena_, invoke);
987}
988
989void IntrinsicCodeGeneratorX86::VisitMathSin(HInvoke* invoke) {
990 GenFPToFPCall(invoke, codegen_, kQuickSin);
991}
992
993void IntrinsicLocationsBuilderX86::VisitMathAcos(HInvoke* invoke) {
994 CreateFPToFPCallLocations(arena_, invoke);
995}
996
997void IntrinsicCodeGeneratorX86::VisitMathAcos(HInvoke* invoke) {
998 GenFPToFPCall(invoke, codegen_, kQuickAcos);
999}
1000
1001void IntrinsicLocationsBuilderX86::VisitMathAsin(HInvoke* invoke) {
1002 CreateFPToFPCallLocations(arena_, invoke);
1003}
1004
1005void IntrinsicCodeGeneratorX86::VisitMathAsin(HInvoke* invoke) {
1006 GenFPToFPCall(invoke, codegen_, kQuickAsin);
1007}
1008
1009void IntrinsicLocationsBuilderX86::VisitMathAtan(HInvoke* invoke) {
1010 CreateFPToFPCallLocations(arena_, invoke);
1011}
1012
1013void IntrinsicCodeGeneratorX86::VisitMathAtan(HInvoke* invoke) {
1014 GenFPToFPCall(invoke, codegen_, kQuickAtan);
1015}
1016
1017void IntrinsicLocationsBuilderX86::VisitMathCbrt(HInvoke* invoke) {
1018 CreateFPToFPCallLocations(arena_, invoke);
1019}
1020
1021void IntrinsicCodeGeneratorX86::VisitMathCbrt(HInvoke* invoke) {
1022 GenFPToFPCall(invoke, codegen_, kQuickCbrt);
1023}
1024
1025void IntrinsicLocationsBuilderX86::VisitMathCosh(HInvoke* invoke) {
1026 CreateFPToFPCallLocations(arena_, invoke);
1027}
1028
1029void IntrinsicCodeGeneratorX86::VisitMathCosh(HInvoke* invoke) {
1030 GenFPToFPCall(invoke, codegen_, kQuickCosh);
1031}
1032
1033void IntrinsicLocationsBuilderX86::VisitMathExp(HInvoke* invoke) {
1034 CreateFPToFPCallLocations(arena_, invoke);
1035}
1036
1037void IntrinsicCodeGeneratorX86::VisitMathExp(HInvoke* invoke) {
1038 GenFPToFPCall(invoke, codegen_, kQuickExp);
1039}
1040
1041void IntrinsicLocationsBuilderX86::VisitMathExpm1(HInvoke* invoke) {
1042 CreateFPToFPCallLocations(arena_, invoke);
1043}
1044
1045void IntrinsicCodeGeneratorX86::VisitMathExpm1(HInvoke* invoke) {
1046 GenFPToFPCall(invoke, codegen_, kQuickExpm1);
1047}
1048
1049void IntrinsicLocationsBuilderX86::VisitMathLog(HInvoke* invoke) {
1050 CreateFPToFPCallLocations(arena_, invoke);
1051}
1052
1053void IntrinsicCodeGeneratorX86::VisitMathLog(HInvoke* invoke) {
1054 GenFPToFPCall(invoke, codegen_, kQuickLog);
1055}
1056
1057void IntrinsicLocationsBuilderX86::VisitMathLog10(HInvoke* invoke) {
1058 CreateFPToFPCallLocations(arena_, invoke);
1059}
1060
1061void IntrinsicCodeGeneratorX86::VisitMathLog10(HInvoke* invoke) {
1062 GenFPToFPCall(invoke, codegen_, kQuickLog10);
1063}
1064
1065void IntrinsicLocationsBuilderX86::VisitMathSinh(HInvoke* invoke) {
1066 CreateFPToFPCallLocations(arena_, invoke);
1067}
1068
1069void IntrinsicCodeGeneratorX86::VisitMathSinh(HInvoke* invoke) {
1070 GenFPToFPCall(invoke, codegen_, kQuickSinh);
1071}
1072
1073void IntrinsicLocationsBuilderX86::VisitMathTan(HInvoke* invoke) {
1074 CreateFPToFPCallLocations(arena_, invoke);
1075}
1076
1077void IntrinsicCodeGeneratorX86::VisitMathTan(HInvoke* invoke) {
1078 GenFPToFPCall(invoke, codegen_, kQuickTan);
1079}
1080
1081void IntrinsicLocationsBuilderX86::VisitMathTanh(HInvoke* invoke) {
1082 CreateFPToFPCallLocations(arena_, invoke);
1083}
1084
1085void IntrinsicCodeGeneratorX86::VisitMathTanh(HInvoke* invoke) {
1086 GenFPToFPCall(invoke, codegen_, kQuickTanh);
1087}
1088
1089static void CreateFPFPToFPCallLocations(ArenaAllocator* arena,
1090 HInvoke* invoke) {
1091 LocationSummary* locations = new (arena) LocationSummary(invoke,
Serban Constantinescu54ff4822016-07-07 18:03:19 +01001092 LocationSummary::kCallOnMainOnly,
Mark Mendella4f12202015-08-06 15:23:34 -04001093 kIntrinsified);
1094 InvokeRuntimeCallingConvention calling_convention;
1095 locations->SetInAt(0, Location::FpuRegisterLocation(calling_convention.GetFpuRegisterAt(0)));
1096 locations->SetInAt(1, Location::FpuRegisterLocation(calling_convention.GetFpuRegisterAt(1)));
1097 locations->SetOut(Location::FpuRegisterLocation(XMM0));
1098}
1099
1100void IntrinsicLocationsBuilderX86::VisitMathAtan2(HInvoke* invoke) {
1101 CreateFPFPToFPCallLocations(arena_, invoke);
1102}
1103
1104void IntrinsicCodeGeneratorX86::VisitMathAtan2(HInvoke* invoke) {
1105 GenFPToFPCall(invoke, codegen_, kQuickAtan2);
1106}
1107
1108void IntrinsicLocationsBuilderX86::VisitMathHypot(HInvoke* invoke) {
1109 CreateFPFPToFPCallLocations(arena_, invoke);
1110}
1111
1112void IntrinsicCodeGeneratorX86::VisitMathHypot(HInvoke* invoke) {
1113 GenFPToFPCall(invoke, codegen_, kQuickHypot);
1114}
1115
1116void IntrinsicLocationsBuilderX86::VisitMathNextAfter(HInvoke* invoke) {
1117 CreateFPFPToFPCallLocations(arena_, invoke);
1118}
1119
1120void IntrinsicCodeGeneratorX86::VisitMathNextAfter(HInvoke* invoke) {
1121 GenFPToFPCall(invoke, codegen_, kQuickNextAfter);
1122}
1123
Mark Mendell6bc53a92015-07-01 14:26:52 -04001124void IntrinsicLocationsBuilderX86::VisitSystemArrayCopyChar(HInvoke* invoke) {
1125 // We need at least two of the positions or length to be an integer constant,
1126 // or else we won't have enough free registers.
1127 HIntConstant* src_pos = invoke->InputAt(1)->AsIntConstant();
1128 HIntConstant* dest_pos = invoke->InputAt(3)->AsIntConstant();
1129 HIntConstant* length = invoke->InputAt(4)->AsIntConstant();
1130
1131 int num_constants =
1132 ((src_pos != nullptr) ? 1 : 0)
1133 + ((dest_pos != nullptr) ? 1 : 0)
1134 + ((length != nullptr) ? 1 : 0);
1135
1136 if (num_constants < 2) {
1137 // Not enough free registers.
1138 return;
1139 }
1140
1141 // As long as we are checking, we might as well check to see if the src and dest
1142 // positions are >= 0.
1143 if ((src_pos != nullptr && src_pos->GetValue() < 0) ||
1144 (dest_pos != nullptr && dest_pos->GetValue() < 0)) {
1145 // We will have to fail anyways.
1146 return;
1147 }
1148
1149 // And since we are already checking, check the length too.
1150 if (length != nullptr) {
1151 int32_t len = length->GetValue();
1152 if (len < 0) {
1153 // Just call as normal.
1154 return;
1155 }
1156 }
1157
1158 // Okay, it is safe to generate inline code.
1159 LocationSummary* locations =
1160 new (arena_) LocationSummary(invoke, LocationSummary::kCallOnSlowPath, kIntrinsified);
1161 // arraycopy(Object src, int srcPos, Object dest, int destPos, int length).
1162 locations->SetInAt(0, Location::RequiresRegister());
1163 locations->SetInAt(1, Location::RegisterOrConstant(invoke->InputAt(1)));
1164 locations->SetInAt(2, Location::RequiresRegister());
1165 locations->SetInAt(3, Location::RegisterOrConstant(invoke->InputAt(3)));
1166 locations->SetInAt(4, Location::RegisterOrConstant(invoke->InputAt(4)));
1167
1168 // And we need some temporaries. We will use REP MOVSW, so we need fixed registers.
1169 locations->AddTemp(Location::RegisterLocation(ESI));
1170 locations->AddTemp(Location::RegisterLocation(EDI));
1171 locations->AddTemp(Location::RegisterLocation(ECX));
1172}
1173
1174static void CheckPosition(X86Assembler* assembler,
1175 Location pos,
1176 Register input,
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01001177 Location length,
Andreas Gampe85b62f22015-09-09 13:15:38 -07001178 SlowPathCode* slow_path,
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01001179 Register temp,
1180 bool length_is_input_length = false) {
1181 // Where is the length in the Array?
Mark Mendell6bc53a92015-07-01 14:26:52 -04001182 const uint32_t length_offset = mirror::Array::LengthOffset().Uint32Value();
1183
1184 if (pos.IsConstant()) {
1185 int32_t pos_const = pos.GetConstant()->AsIntConstant()->GetValue();
1186 if (pos_const == 0) {
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01001187 if (!length_is_input_length) {
1188 // Check that length(input) >= length.
1189 if (length.IsConstant()) {
1190 __ cmpl(Address(input, length_offset),
1191 Immediate(length.GetConstant()->AsIntConstant()->GetValue()));
1192 } else {
1193 __ cmpl(Address(input, length_offset), length.AsRegister<Register>());
1194 }
1195 __ j(kLess, slow_path->GetEntryLabel());
1196 }
Mark Mendell6bc53a92015-07-01 14:26:52 -04001197 } else {
1198 // Check that length(input) >= pos.
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01001199 __ movl(temp, Address(input, length_offset));
1200 __ subl(temp, Immediate(pos_const));
Mark Mendell6bc53a92015-07-01 14:26:52 -04001201 __ j(kLess, slow_path->GetEntryLabel());
1202
1203 // Check that (length(input) - pos) >= length.
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01001204 if (length.IsConstant()) {
1205 __ cmpl(temp, Immediate(length.GetConstant()->AsIntConstant()->GetValue()));
1206 } else {
1207 __ cmpl(temp, length.AsRegister<Register>());
1208 }
Mark Mendell6bc53a92015-07-01 14:26:52 -04001209 __ j(kLess, slow_path->GetEntryLabel());
1210 }
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01001211 } else if (length_is_input_length) {
1212 // The only way the copy can succeed is if pos is zero.
1213 Register pos_reg = pos.AsRegister<Register>();
1214 __ testl(pos_reg, pos_reg);
1215 __ j(kNotEqual, slow_path->GetEntryLabel());
Mark Mendell6bc53a92015-07-01 14:26:52 -04001216 } else {
1217 // Check that pos >= 0.
1218 Register pos_reg = pos.AsRegister<Register>();
1219 __ testl(pos_reg, pos_reg);
1220 __ j(kLess, slow_path->GetEntryLabel());
1221
1222 // Check that pos <= length(input).
1223 __ cmpl(Address(input, length_offset), pos_reg);
1224 __ j(kLess, slow_path->GetEntryLabel());
1225
1226 // Check that (length(input) - pos) >= length.
1227 __ movl(temp, Address(input, length_offset));
1228 __ subl(temp, pos_reg);
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01001229 if (length.IsConstant()) {
1230 __ cmpl(temp, Immediate(length.GetConstant()->AsIntConstant()->GetValue()));
1231 } else {
1232 __ cmpl(temp, length.AsRegister<Register>());
1233 }
Mark Mendell6bc53a92015-07-01 14:26:52 -04001234 __ j(kLess, slow_path->GetEntryLabel());
1235 }
1236}
1237
1238void IntrinsicCodeGeneratorX86::VisitSystemArrayCopyChar(HInvoke* invoke) {
1239 X86Assembler* assembler = GetAssembler();
1240 LocationSummary* locations = invoke->GetLocations();
1241
1242 Register src = locations->InAt(0).AsRegister<Register>();
1243 Location srcPos = locations->InAt(1);
1244 Register dest = locations->InAt(2).AsRegister<Register>();
1245 Location destPos = locations->InAt(3);
1246 Location length = locations->InAt(4);
1247
1248 // Temporaries that we need for MOVSW.
1249 Register src_base = locations->GetTemp(0).AsRegister<Register>();
1250 DCHECK_EQ(src_base, ESI);
1251 Register dest_base = locations->GetTemp(1).AsRegister<Register>();
1252 DCHECK_EQ(dest_base, EDI);
1253 Register count = locations->GetTemp(2).AsRegister<Register>();
1254 DCHECK_EQ(count, ECX);
1255
Andreas Gampe85b62f22015-09-09 13:15:38 -07001256 SlowPathCode* slow_path = new (GetAllocator()) IntrinsicSlowPathX86(invoke);
Mark Mendell6bc53a92015-07-01 14:26:52 -04001257 codegen_->AddSlowPath(slow_path);
1258
1259 // Bail out if the source and destination are the same (to handle overlap).
1260 __ cmpl(src, dest);
1261 __ j(kEqual, slow_path->GetEntryLabel());
1262
1263 // Bail out if the source is null.
1264 __ testl(src, src);
1265 __ j(kEqual, slow_path->GetEntryLabel());
1266
1267 // Bail out if the destination is null.
1268 __ testl(dest, dest);
1269 __ j(kEqual, slow_path->GetEntryLabel());
1270
1271 // If the length is negative, bail out.
1272 // We have already checked in the LocationsBuilder for the constant case.
1273 if (!length.IsConstant()) {
1274 __ cmpl(length.AsRegister<Register>(), length.AsRegister<Register>());
1275 __ j(kLess, slow_path->GetEntryLabel());
1276 }
1277
1278 // We need the count in ECX.
1279 if (length.IsConstant()) {
1280 __ movl(count, Immediate(length.GetConstant()->AsIntConstant()->GetValue()));
1281 } else {
1282 __ movl(count, length.AsRegister<Register>());
1283 }
1284
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01001285 // Validity checks: source. Use src_base as a temporary register.
1286 CheckPosition(assembler, srcPos, src, Location::RegisterLocation(count), slow_path, src_base);
Mark Mendell6bc53a92015-07-01 14:26:52 -04001287
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01001288 // Validity checks: dest. Use src_base as a temporary register.
1289 CheckPosition(assembler, destPos, dest, Location::RegisterLocation(count), slow_path, src_base);
Mark Mendell6bc53a92015-07-01 14:26:52 -04001290
1291 // Okay, everything checks out. Finally time to do the copy.
1292 // Check assumption that sizeof(Char) is 2 (used in scaling below).
1293 const size_t char_size = Primitive::ComponentSize(Primitive::kPrimChar);
1294 DCHECK_EQ(char_size, 2u);
1295
1296 const uint32_t data_offset = mirror::Array::DataOffset(char_size).Uint32Value();
1297
1298 if (srcPos.IsConstant()) {
1299 int32_t srcPos_const = srcPos.GetConstant()->AsIntConstant()->GetValue();
1300 __ leal(src_base, Address(src, char_size * srcPos_const + data_offset));
1301 } else {
1302 __ leal(src_base, Address(src, srcPos.AsRegister<Register>(),
1303 ScaleFactor::TIMES_2, data_offset));
1304 }
1305 if (destPos.IsConstant()) {
1306 int32_t destPos_const = destPos.GetConstant()->AsIntConstant()->GetValue();
1307
1308 __ leal(dest_base, Address(dest, char_size * destPos_const + data_offset));
1309 } else {
1310 __ leal(dest_base, Address(dest, destPos.AsRegister<Register>(),
1311 ScaleFactor::TIMES_2, data_offset));
1312 }
1313
1314 // Do the move.
1315 __ rep_movsw();
1316
1317 __ Bind(slow_path->GetExitLabel());
1318}
1319
Nicolas Geoffrayd75948a2015-03-27 09:53:16 +00001320void IntrinsicLocationsBuilderX86::VisitStringCompareTo(HInvoke* invoke) {
1321 // The inputs plus one temp.
1322 LocationSummary* locations = new (arena_) LocationSummary(invoke,
Serban Constantinescu806f0122016-03-09 11:10:16 +00001323 LocationSummary::kCallOnMainAndSlowPath,
Nicolas Geoffrayd75948a2015-03-27 09:53:16 +00001324 kIntrinsified);
1325 InvokeRuntimeCallingConvention calling_convention;
1326 locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(0)));
1327 locations->SetInAt(1, Location::RegisterLocation(calling_convention.GetRegisterAt(1)));
1328 locations->SetOut(Location::RegisterLocation(EAX));
Nicolas Geoffrayd75948a2015-03-27 09:53:16 +00001329}
1330
1331void IntrinsicCodeGeneratorX86::VisitStringCompareTo(HInvoke* invoke) {
1332 X86Assembler* assembler = GetAssembler();
1333 LocationSummary* locations = invoke->GetLocations();
1334
Nicolas Geoffray512e04d2015-03-27 17:21:24 +00001335 // Note that the null check must have been done earlier.
Calin Juravle641547a2015-04-21 22:08:51 +01001336 DCHECK(!invoke->CanDoImplicitNullCheckOn(invoke->InputAt(0)));
Nicolas Geoffrayd75948a2015-03-27 09:53:16 +00001337
1338 Register argument = locations->InAt(1).AsRegister<Register>();
1339 __ testl(argument, argument);
Andreas Gampe85b62f22015-09-09 13:15:38 -07001340 SlowPathCode* slow_path = new (GetAllocator()) IntrinsicSlowPathX86(invoke);
Nicolas Geoffrayd75948a2015-03-27 09:53:16 +00001341 codegen_->AddSlowPath(slow_path);
1342 __ j(kEqual, slow_path->GetEntryLabel());
1343
Serban Constantinescuba45db02016-07-12 22:53:02 +01001344 codegen_->InvokeRuntime(kQuickStringCompareTo, invoke, invoke->GetDexPc(), slow_path);
Nicolas Geoffrayd75948a2015-03-27 09:53:16 +00001345 __ Bind(slow_path->GetExitLabel());
1346}
1347
Agi Csakid7138c82015-08-13 17:46:44 -07001348void IntrinsicLocationsBuilderX86::VisitStringEquals(HInvoke* invoke) {
1349 LocationSummary* locations = new (arena_) LocationSummary(invoke,
1350 LocationSummary::kNoCall,
1351 kIntrinsified);
1352 locations->SetInAt(0, Location::RequiresRegister());
1353 locations->SetInAt(1, Location::RequiresRegister());
1354
1355 // Request temporary registers, ECX and EDI needed for repe_cmpsl instruction.
1356 locations->AddTemp(Location::RegisterLocation(ECX));
1357 locations->AddTemp(Location::RegisterLocation(EDI));
1358
1359 // Set output, ESI needed for repe_cmpsl instruction anyways.
1360 locations->SetOut(Location::RegisterLocation(ESI), Location::kOutputOverlap);
1361}
1362
1363void IntrinsicCodeGeneratorX86::VisitStringEquals(HInvoke* invoke) {
1364 X86Assembler* assembler = GetAssembler();
1365 LocationSummary* locations = invoke->GetLocations();
1366
1367 Register str = locations->InAt(0).AsRegister<Register>();
1368 Register arg = locations->InAt(1).AsRegister<Register>();
1369 Register ecx = locations->GetTemp(0).AsRegister<Register>();
1370 Register edi = locations->GetTemp(1).AsRegister<Register>();
1371 Register esi = locations->Out().AsRegister<Register>();
1372
Mark Mendell0c9497d2015-08-21 09:30:05 -04001373 NearLabel end, return_true, return_false;
Agi Csakid7138c82015-08-13 17:46:44 -07001374
1375 // Get offsets of count, value, and class fields within a string object.
1376 const uint32_t count_offset = mirror::String::CountOffset().Uint32Value();
1377 const uint32_t value_offset = mirror::String::ValueOffset().Uint32Value();
1378 const uint32_t class_offset = mirror::Object::ClassOffset().Uint32Value();
1379
1380 // Note that the null check must have been done earlier.
1381 DCHECK(!invoke->CanDoImplicitNullCheckOn(invoke->InputAt(0)));
1382
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +01001383 StringEqualsOptimizations optimizations(invoke);
1384 if (!optimizations.GetArgumentNotNull()) {
1385 // Check if input is null, return false if it is.
1386 __ testl(arg, arg);
1387 __ j(kEqual, &return_false);
1388 }
Agi Csakid7138c82015-08-13 17:46:44 -07001389
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +01001390 if (!optimizations.GetArgumentIsString()) {
Vladimir Marko53b52002016-05-24 19:30:45 +01001391 // Instanceof check for the argument by comparing class fields.
1392 // All string objects must have the same type since String cannot be subclassed.
1393 // Receiver must be a string object, so its class field is equal to all strings' class fields.
1394 // If the argument is a string object, its class field must be equal to receiver's class field.
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +01001395 __ movl(ecx, Address(str, class_offset));
1396 __ cmpl(ecx, Address(arg, class_offset));
1397 __ j(kNotEqual, &return_false);
1398 }
Agi Csakid7138c82015-08-13 17:46:44 -07001399
1400 // Reference equality check, return true if same reference.
1401 __ cmpl(str, arg);
1402 __ j(kEqual, &return_true);
1403
jessicahandojo4877b792016-09-08 19:49:13 -07001404 // Load length and compression flag of receiver string.
Agi Csakid7138c82015-08-13 17:46:44 -07001405 __ movl(ecx, Address(str, count_offset));
jessicahandojo4877b792016-09-08 19:49:13 -07001406 // Check if lengths and compression flags are equal, return false if they're not.
1407 // Two identical strings will always have same compression style since
1408 // compression style is decided on alloc.
Agi Csakid7138c82015-08-13 17:46:44 -07001409 __ cmpl(ecx, Address(arg, count_offset));
1410 __ j(kNotEqual, &return_false);
Vladimir Markofdaf0f42016-10-13 19:29:53 +01001411 // Return true if strings are empty. Even with string compression `count == 0` means empty.
1412 static_assert(static_cast<uint32_t>(mirror::StringCompressionFlag::kCompressed) == 0u,
1413 "Expecting 0=compressed, 1=uncompressed");
1414 __ jecxz(&return_true);
Agi Csakid7138c82015-08-13 17:46:44 -07001415
jessicahandojo4877b792016-09-08 19:49:13 -07001416 if (mirror::kUseStringCompression) {
1417 NearLabel string_uncompressed;
Vladimir Markofdaf0f42016-10-13 19:29:53 +01001418 // Extract length and differentiate between both compressed or both uncompressed.
1419 // Different compression style is cut above.
1420 __ shrl(ecx, Immediate(1));
1421 __ j(kCarrySet, &string_uncompressed);
jessicahandojo4877b792016-09-08 19:49:13 -07001422 // Divide string length by 2, rounding up, and continue as if uncompressed.
Vladimir Markofdaf0f42016-10-13 19:29:53 +01001423 __ addl(ecx, Immediate(1));
jessicahandojo4877b792016-09-08 19:49:13 -07001424 __ shrl(ecx, Immediate(1));
1425 __ Bind(&string_uncompressed);
1426 }
Agi Csakid7138c82015-08-13 17:46:44 -07001427 // Load starting addresses of string values into ESI/EDI as required for repe_cmpsl instruction.
1428 __ leal(esi, Address(str, value_offset));
1429 __ leal(edi, Address(arg, value_offset));
1430
jessicahandojo4877b792016-09-08 19:49:13 -07001431 // Divide string length by 2 to compare characters 2 at a time and adjust for lengths not
1432 // divisible by 2.
Agi Csakid7138c82015-08-13 17:46:44 -07001433 __ addl(ecx, Immediate(1));
1434 __ shrl(ecx, Immediate(1));
1435
jessicahandojo4877b792016-09-08 19:49:13 -07001436 // Assertions that must hold in order to compare strings 2 characters (uncompressed)
1437 // or 4 characters (compressed) at a time.
Agi Csakid7138c82015-08-13 17:46:44 -07001438 DCHECK_ALIGNED(value_offset, 4);
1439 static_assert(IsAligned<4>(kObjectAlignment), "String of odd length is not zero padded");
1440
1441 // Loop to compare strings two characters at a time starting at the beginning of the string.
1442 __ repe_cmpsl();
1443 // If strings are not equal, zero flag will be cleared.
1444 __ j(kNotEqual, &return_false);
1445
1446 // Return true and exit the function.
1447 // If loop does not result in returning false, we return true.
1448 __ Bind(&return_true);
1449 __ movl(esi, Immediate(1));
1450 __ jmp(&end);
1451
1452 // Return false and exit the function.
1453 __ Bind(&return_false);
1454 __ xorl(esi, esi);
1455 __ Bind(&end);
1456}
1457
Andreas Gampe21030dd2015-05-07 14:46:15 -07001458static void CreateStringIndexOfLocations(HInvoke* invoke,
1459 ArenaAllocator* allocator,
1460 bool start_at_zero) {
1461 LocationSummary* locations = new (allocator) LocationSummary(invoke,
1462 LocationSummary::kCallOnSlowPath,
1463 kIntrinsified);
1464 // The data needs to be in EDI for scasw. So request that the string is there, anyways.
1465 locations->SetInAt(0, Location::RegisterLocation(EDI));
1466 // If we look for a constant char, we'll still have to copy it into EAX. So just request the
1467 // allocator to do that, anyways. We can still do the constant check by checking the parameter
1468 // of the instruction explicitly.
1469 // Note: This works as we don't clobber EAX anywhere.
1470 locations->SetInAt(1, Location::RegisterLocation(EAX));
1471 if (!start_at_zero) {
1472 locations->SetInAt(2, Location::RequiresRegister()); // The starting index.
1473 }
1474 // As we clobber EDI during execution anyways, also use it as the output.
1475 locations->SetOut(Location::SameAsFirstInput());
1476
1477 // repne scasw uses ECX as the counter.
1478 locations->AddTemp(Location::RegisterLocation(ECX));
1479 // Need another temporary to be able to compute the result.
1480 locations->AddTemp(Location::RequiresRegister());
jessicahandojo4877b792016-09-08 19:49:13 -07001481 if (mirror::kUseStringCompression) {
1482 // Need another temporary to be able to save unflagged string length.
1483 locations->AddTemp(Location::RequiresRegister());
1484 }
Andreas Gampe21030dd2015-05-07 14:46:15 -07001485}
1486
1487static void GenerateStringIndexOf(HInvoke* invoke,
1488 X86Assembler* assembler,
1489 CodeGeneratorX86* codegen,
1490 ArenaAllocator* allocator,
1491 bool start_at_zero) {
1492 LocationSummary* locations = invoke->GetLocations();
1493
1494 // Note that the null check must have been done earlier.
1495 DCHECK(!invoke->CanDoImplicitNullCheckOn(invoke->InputAt(0)));
1496
1497 Register string_obj = locations->InAt(0).AsRegister<Register>();
1498 Register search_value = locations->InAt(1).AsRegister<Register>();
1499 Register counter = locations->GetTemp(0).AsRegister<Register>();
1500 Register string_length = locations->GetTemp(1).AsRegister<Register>();
1501 Register out = locations->Out().AsRegister<Register>();
jessicahandojo4877b792016-09-08 19:49:13 -07001502 // Only used when string compression feature is on.
1503 Register string_length_flagged;
Andreas Gampe21030dd2015-05-07 14:46:15 -07001504
1505 // Check our assumptions for registers.
1506 DCHECK_EQ(string_obj, EDI);
1507 DCHECK_EQ(search_value, EAX);
1508 DCHECK_EQ(counter, ECX);
1509 DCHECK_EQ(out, EDI);
1510
1511 // Check for code points > 0xFFFF. Either a slow-path check when we don't know statically,
Vladimir Markofb6c90a2016-05-06 15:52:12 +01001512 // or directly dispatch for a large constant, or omit slow-path for a small constant or a char.
Andreas Gampe85b62f22015-09-09 13:15:38 -07001513 SlowPathCode* slow_path = nullptr;
Vladimir Markofb6c90a2016-05-06 15:52:12 +01001514 HInstruction* code_point = invoke->InputAt(1);
1515 if (code_point->IsIntConstant()) {
Vladimir Markoda051082016-05-17 16:10:20 +01001516 if (static_cast<uint32_t>(code_point->AsIntConstant()->GetValue()) >
Andreas Gampe21030dd2015-05-07 14:46:15 -07001517 std::numeric_limits<uint16_t>::max()) {
1518 // Always needs the slow-path. We could directly dispatch to it, but this case should be
1519 // rare, so for simplicity just put the full slow-path down and branch unconditionally.
1520 slow_path = new (allocator) IntrinsicSlowPathX86(invoke);
1521 codegen->AddSlowPath(slow_path);
1522 __ jmp(slow_path->GetEntryLabel());
1523 __ Bind(slow_path->GetExitLabel());
1524 return;
1525 }
Vladimir Markofb6c90a2016-05-06 15:52:12 +01001526 } else if (code_point->GetType() != Primitive::kPrimChar) {
Andreas Gampe21030dd2015-05-07 14:46:15 -07001527 __ cmpl(search_value, Immediate(std::numeric_limits<uint16_t>::max()));
1528 slow_path = new (allocator) IntrinsicSlowPathX86(invoke);
1529 codegen->AddSlowPath(slow_path);
1530 __ j(kAbove, slow_path->GetEntryLabel());
1531 }
1532
1533 // From here down, we know that we are looking for a char that fits in 16 bits.
1534 // Location of reference to data array within the String object.
1535 int32_t value_offset = mirror::String::ValueOffset().Int32Value();
1536 // Location of count within the String object.
1537 int32_t count_offset = mirror::String::CountOffset().Int32Value();
1538
Vladimir Markofdaf0f42016-10-13 19:29:53 +01001539 // Load the count field of the string containing the length and compression flag.
Andreas Gampe21030dd2015-05-07 14:46:15 -07001540 __ movl(string_length, Address(string_obj, count_offset));
1541
Vladimir Markofdaf0f42016-10-13 19:29:53 +01001542 // Do a zero-length check. Even with string compression `count == 0` means empty.
1543 static_assert(static_cast<uint32_t>(mirror::StringCompressionFlag::kCompressed) == 0u,
1544 "Expecting 0=compressed, 1=uncompressed");
Andreas Gampe21030dd2015-05-07 14:46:15 -07001545 // TODO: Support jecxz.
Mark Mendell0c9497d2015-08-21 09:30:05 -04001546 NearLabel not_found_label;
Andreas Gampe21030dd2015-05-07 14:46:15 -07001547 __ testl(string_length, string_length);
1548 __ j(kEqual, &not_found_label);
1549
Vladimir Markofdaf0f42016-10-13 19:29:53 +01001550 if (mirror::kUseStringCompression) {
1551 string_length_flagged = locations->GetTemp(2).AsRegister<Register>();
1552 __ movl(string_length_flagged, string_length);
1553 // Extract the length and shift out the least significant bit used as compression flag.
1554 __ shrl(string_length, Immediate(1));
1555 }
1556
Andreas Gampe21030dd2015-05-07 14:46:15 -07001557 if (start_at_zero) {
1558 // Number of chars to scan is the same as the string length.
1559 __ movl(counter, string_length);
1560
1561 // Move to the start of the string.
1562 __ addl(string_obj, Immediate(value_offset));
1563 } else {
1564 Register start_index = locations->InAt(2).AsRegister<Register>();
1565
1566 // Do a start_index check.
1567 __ cmpl(start_index, string_length);
1568 __ j(kGreaterEqual, &not_found_label);
1569
1570 // Ensure we have a start index >= 0;
1571 __ xorl(counter, counter);
1572 __ cmpl(start_index, Immediate(0));
1573 __ cmovl(kGreater, counter, start_index);
1574
jessicahandojo4877b792016-09-08 19:49:13 -07001575 if (mirror::kUseStringCompression) {
1576 NearLabel modify_counter, offset_uncompressed_label;
Vladimir Markofdaf0f42016-10-13 19:29:53 +01001577 __ testl(string_length_flagged, Immediate(1));
1578 __ j(kNotZero, &offset_uncompressed_label);
jessicahandojo4877b792016-09-08 19:49:13 -07001579 // Move to the start of the string: string_obj + value_offset + start_index.
1580 __ leal(string_obj, Address(string_obj, counter, ScaleFactor::TIMES_1, value_offset));
1581 __ jmp(&modify_counter);
Andreas Gampe21030dd2015-05-07 14:46:15 -07001582
jessicahandojo4877b792016-09-08 19:49:13 -07001583 // Move to the start of the string: string_obj + value_offset + 2 * start_index.
1584 __ Bind(&offset_uncompressed_label);
1585 __ leal(string_obj, Address(string_obj, counter, ScaleFactor::TIMES_2, value_offset));
1586
1587 // Now update ecx (the repne scasw work counter). We have string.length - start_index left to
1588 // compare.
1589 __ Bind(&modify_counter);
1590 } else {
1591 __ leal(string_obj, Address(string_obj, counter, ScaleFactor::TIMES_2, value_offset));
1592 }
Andreas Gampe21030dd2015-05-07 14:46:15 -07001593 __ negl(counter);
1594 __ leal(counter, Address(string_length, counter, ScaleFactor::TIMES_1, 0));
1595 }
1596
jessicahandojo4877b792016-09-08 19:49:13 -07001597 if (mirror::kUseStringCompression) {
1598 NearLabel uncompressed_string_comparison;
1599 NearLabel comparison_done;
Vladimir Markofdaf0f42016-10-13 19:29:53 +01001600 __ testl(string_length_flagged, Immediate(1));
1601 __ j(kNotZero, &uncompressed_string_comparison);
Andreas Gampe21030dd2015-05-07 14:46:15 -07001602
jessicahandojo4877b792016-09-08 19:49:13 -07001603 // Check if EAX (search_value) is ASCII.
1604 __ cmpl(search_value, Immediate(127));
1605 __ j(kGreater, &not_found_label);
1606 // Comparing byte-per-byte.
1607 __ repne_scasb();
1608 __ jmp(&comparison_done);
1609
1610 // Everything is set up for repne scasw:
1611 // * Comparison address in EDI.
1612 // * Counter in ECX.
1613 __ Bind(&uncompressed_string_comparison);
1614 __ repne_scasw();
1615 __ Bind(&comparison_done);
1616 } else {
1617 __ repne_scasw();
1618 }
Andreas Gampe21030dd2015-05-07 14:46:15 -07001619 // Did we find a match?
1620 __ j(kNotEqual, &not_found_label);
1621
1622 // Yes, we matched. Compute the index of the result.
1623 __ subl(string_length, counter);
1624 __ leal(out, Address(string_length, -1));
1625
Mark Mendell0c9497d2015-08-21 09:30:05 -04001626 NearLabel done;
Andreas Gampe21030dd2015-05-07 14:46:15 -07001627 __ jmp(&done);
1628
1629 // Failed to match; return -1.
1630 __ Bind(&not_found_label);
1631 __ movl(out, Immediate(-1));
1632
1633 // And join up at the end.
1634 __ Bind(&done);
1635 if (slow_path != nullptr) {
1636 __ Bind(slow_path->GetExitLabel());
1637 }
1638}
1639
1640void IntrinsicLocationsBuilderX86::VisitStringIndexOf(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00001641 CreateStringIndexOfLocations(invoke, arena_, /* start_at_zero */ true);
Andreas Gampe21030dd2015-05-07 14:46:15 -07001642}
1643
1644void IntrinsicCodeGeneratorX86::VisitStringIndexOf(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00001645 GenerateStringIndexOf(invoke, GetAssembler(), codegen_, GetAllocator(), /* start_at_zero */ true);
Andreas Gampe21030dd2015-05-07 14:46:15 -07001646}
1647
1648void IntrinsicLocationsBuilderX86::VisitStringIndexOfAfter(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00001649 CreateStringIndexOfLocations(invoke, arena_, /* start_at_zero */ false);
Andreas Gampe21030dd2015-05-07 14:46:15 -07001650}
1651
1652void IntrinsicCodeGeneratorX86::VisitStringIndexOfAfter(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00001653 GenerateStringIndexOf(
1654 invoke, GetAssembler(), codegen_, GetAllocator(), /* start_at_zero */ false);
Andreas Gampe21030dd2015-05-07 14:46:15 -07001655}
1656
Jeff Hao848f70a2014-01-15 13:49:50 -08001657void IntrinsicLocationsBuilderX86::VisitStringNewStringFromBytes(HInvoke* invoke) {
1658 LocationSummary* locations = new (arena_) LocationSummary(invoke,
Serban Constantinescu806f0122016-03-09 11:10:16 +00001659 LocationSummary::kCallOnMainAndSlowPath,
Jeff Hao848f70a2014-01-15 13:49:50 -08001660 kIntrinsified);
1661 InvokeRuntimeCallingConvention calling_convention;
1662 locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(0)));
1663 locations->SetInAt(1, Location::RegisterLocation(calling_convention.GetRegisterAt(1)));
1664 locations->SetInAt(2, Location::RegisterLocation(calling_convention.GetRegisterAt(2)));
1665 locations->SetInAt(3, Location::RegisterLocation(calling_convention.GetRegisterAt(3)));
1666 locations->SetOut(Location::RegisterLocation(EAX));
Jeff Hao848f70a2014-01-15 13:49:50 -08001667}
1668
1669void IntrinsicCodeGeneratorX86::VisitStringNewStringFromBytes(HInvoke* invoke) {
1670 X86Assembler* assembler = GetAssembler();
1671 LocationSummary* locations = invoke->GetLocations();
1672
1673 Register byte_array = locations->InAt(0).AsRegister<Register>();
1674 __ testl(byte_array, byte_array);
Andreas Gampe85b62f22015-09-09 13:15:38 -07001675 SlowPathCode* slow_path = new (GetAllocator()) IntrinsicSlowPathX86(invoke);
Jeff Hao848f70a2014-01-15 13:49:50 -08001676 codegen_->AddSlowPath(slow_path);
1677 __ j(kEqual, slow_path->GetEntryLabel());
1678
Serban Constantinescuba45db02016-07-12 22:53:02 +01001679 codegen_->InvokeRuntime(kQuickAllocStringFromBytes, invoke, invoke->GetDexPc());
Roland Levillainf969a202016-03-09 16:14:00 +00001680 CheckEntrypointTypes<kQuickAllocStringFromBytes, void*, void*, int32_t, int32_t, int32_t>();
Jeff Hao848f70a2014-01-15 13:49:50 -08001681 __ Bind(slow_path->GetExitLabel());
1682}
1683
1684void IntrinsicLocationsBuilderX86::VisitStringNewStringFromChars(HInvoke* invoke) {
1685 LocationSummary* locations = new (arena_) LocationSummary(invoke,
Serban Constantinescu54ff4822016-07-07 18:03:19 +01001686 LocationSummary::kCallOnMainOnly,
Jeff Hao848f70a2014-01-15 13:49:50 -08001687 kIntrinsified);
1688 InvokeRuntimeCallingConvention calling_convention;
1689 locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(0)));
1690 locations->SetInAt(1, Location::RegisterLocation(calling_convention.GetRegisterAt(1)));
1691 locations->SetInAt(2, Location::RegisterLocation(calling_convention.GetRegisterAt(2)));
1692 locations->SetOut(Location::RegisterLocation(EAX));
1693}
1694
1695void IntrinsicCodeGeneratorX86::VisitStringNewStringFromChars(HInvoke* invoke) {
Roland Levillaincc3839c2016-02-29 16:23:48 +00001696 // No need to emit code checking whether `locations->InAt(2)` is a null
1697 // pointer, as callers of the native method
1698 //
1699 // java.lang.StringFactory.newStringFromChars(int offset, int charCount, char[] data)
1700 //
1701 // all include a null check on `data` before calling that method.
Serban Constantinescuba45db02016-07-12 22:53:02 +01001702 codegen_->InvokeRuntime(kQuickAllocStringFromChars, invoke, invoke->GetDexPc());
Roland Levillainf969a202016-03-09 16:14:00 +00001703 CheckEntrypointTypes<kQuickAllocStringFromChars, void*, int32_t, int32_t, void*>();
Jeff Hao848f70a2014-01-15 13:49:50 -08001704}
1705
1706void IntrinsicLocationsBuilderX86::VisitStringNewStringFromString(HInvoke* invoke) {
1707 LocationSummary* locations = new (arena_) LocationSummary(invoke,
Serban Constantinescu806f0122016-03-09 11:10:16 +00001708 LocationSummary::kCallOnMainAndSlowPath,
Jeff Hao848f70a2014-01-15 13:49:50 -08001709 kIntrinsified);
1710 InvokeRuntimeCallingConvention calling_convention;
1711 locations->SetInAt(0, Location::RegisterLocation(calling_convention.GetRegisterAt(0)));
1712 locations->SetOut(Location::RegisterLocation(EAX));
Jeff Hao848f70a2014-01-15 13:49:50 -08001713}
1714
1715void IntrinsicCodeGeneratorX86::VisitStringNewStringFromString(HInvoke* invoke) {
1716 X86Assembler* assembler = GetAssembler();
1717 LocationSummary* locations = invoke->GetLocations();
1718
1719 Register string_to_copy = locations->InAt(0).AsRegister<Register>();
1720 __ testl(string_to_copy, string_to_copy);
Andreas Gampe85b62f22015-09-09 13:15:38 -07001721 SlowPathCode* slow_path = new (GetAllocator()) IntrinsicSlowPathX86(invoke);
Jeff Hao848f70a2014-01-15 13:49:50 -08001722 codegen_->AddSlowPath(slow_path);
1723 __ j(kEqual, slow_path->GetEntryLabel());
1724
Serban Constantinescuba45db02016-07-12 22:53:02 +01001725 codegen_->InvokeRuntime(kQuickAllocStringFromString, invoke, invoke->GetDexPc());
Roland Levillainf969a202016-03-09 16:14:00 +00001726 CheckEntrypointTypes<kQuickAllocStringFromString, void*, void*>();
Jeff Hao848f70a2014-01-15 13:49:50 -08001727 __ Bind(slow_path->GetExitLabel());
1728}
1729
Mark Mendell8f8926a2015-08-17 11:39:06 -04001730void IntrinsicLocationsBuilderX86::VisitStringGetCharsNoCheck(HInvoke* invoke) {
1731 // public void getChars(int srcBegin, int srcEnd, char[] dst, int dstBegin);
1732 LocationSummary* locations = new (arena_) LocationSummary(invoke,
1733 LocationSummary::kNoCall,
1734 kIntrinsified);
1735 locations->SetInAt(0, Location::RequiresRegister());
1736 locations->SetInAt(1, Location::RegisterOrConstant(invoke->InputAt(1)));
1737 // Place srcEnd in ECX to save a move below.
1738 locations->SetInAt(2, Location::RegisterLocation(ECX));
1739 locations->SetInAt(3, Location::RequiresRegister());
1740 locations->SetInAt(4, Location::RequiresRegister());
1741
1742 // And we need some temporaries. We will use REP MOVSW, so we need fixed registers.
1743 // We don't have enough registers to also grab ECX, so handle below.
1744 locations->AddTemp(Location::RegisterLocation(ESI));
1745 locations->AddTemp(Location::RegisterLocation(EDI));
1746}
1747
1748void IntrinsicCodeGeneratorX86::VisitStringGetCharsNoCheck(HInvoke* invoke) {
1749 X86Assembler* assembler = GetAssembler();
1750 LocationSummary* locations = invoke->GetLocations();
1751
1752 size_t char_component_size = Primitive::ComponentSize(Primitive::kPrimChar);
1753 // Location of data in char array buffer.
1754 const uint32_t data_offset = mirror::Array::DataOffset(char_component_size).Uint32Value();
1755 // Location of char array data in string.
1756 const uint32_t value_offset = mirror::String::ValueOffset().Uint32Value();
1757
1758 // public void getChars(int srcBegin, int srcEnd, char[] dst, int dstBegin);
1759 Register obj = locations->InAt(0).AsRegister<Register>();
1760 Location srcBegin = locations->InAt(1);
1761 int srcBegin_value =
1762 srcBegin.IsConstant() ? srcBegin.GetConstant()->AsIntConstant()->GetValue() : 0;
1763 Register srcEnd = locations->InAt(2).AsRegister<Register>();
1764 Register dst = locations->InAt(3).AsRegister<Register>();
1765 Register dstBegin = locations->InAt(4).AsRegister<Register>();
1766
1767 // Check assumption that sizeof(Char) is 2 (used in scaling below).
1768 const size_t char_size = Primitive::ComponentSize(Primitive::kPrimChar);
1769 DCHECK_EQ(char_size, 2u);
1770
Mark Mendell8f8926a2015-08-17 11:39:06 -04001771 // Compute the number of chars (words) to move.
jessicahandojo4877b792016-09-08 19:49:13 -07001772 // Save ECX, since we don't know if it will be used later.
Mark Mendell8f8926a2015-08-17 11:39:06 -04001773 __ pushl(ECX);
1774 int stack_adjust = kX86WordSize;
1775 __ cfi().AdjustCFAOffset(stack_adjust);
1776 DCHECK_EQ(srcEnd, ECX);
1777 if (srcBegin.IsConstant()) {
jessicahandojo4877b792016-09-08 19:49:13 -07001778 __ subl(ECX, Immediate(srcBegin_value));
Mark Mendell8f8926a2015-08-17 11:39:06 -04001779 } else {
1780 DCHECK(srcBegin.IsRegister());
1781 __ subl(ECX, srcBegin.AsRegister<Register>());
1782 }
1783
jessicahandojo4877b792016-09-08 19:49:13 -07001784 NearLabel done;
1785 if (mirror::kUseStringCompression) {
1786 // Location of count in string
1787 const uint32_t count_offset = mirror::String::CountOffset().Uint32Value();
1788 const size_t c_char_size = Primitive::ComponentSize(Primitive::kPrimByte);
1789 DCHECK_EQ(c_char_size, 1u);
1790 __ pushl(EAX);
1791 __ cfi().AdjustCFAOffset(stack_adjust);
1792
1793 NearLabel copy_loop, copy_uncompressed;
Vladimir Markofdaf0f42016-10-13 19:29:53 +01001794 __ testl(Address(obj, count_offset), Immediate(1));
1795 static_assert(static_cast<uint32_t>(mirror::StringCompressionFlag::kCompressed) == 0u,
1796 "Expecting 0=compressed, 1=uncompressed");
1797 __ j(kNotZero, &copy_uncompressed);
jessicahandojo4877b792016-09-08 19:49:13 -07001798 // Compute the address of the source string by adding the number of chars from
1799 // the source beginning to the value offset of a string.
1800 __ leal(ESI, CodeGeneratorX86::ArrayAddress(obj, srcBegin, TIMES_1, value_offset));
1801
1802 // Start the loop to copy String's value to Array of Char.
1803 __ leal(EDI, Address(dst, dstBegin, ScaleFactor::TIMES_2, data_offset));
1804 __ Bind(&copy_loop);
1805 __ jecxz(&done);
1806 // Use EAX temporary (convert byte from ESI to word).
1807 // TODO: Use LODSB/STOSW (not supported by X86Assembler) with AH initialized to 0.
1808 __ movzxb(EAX, Address(ESI, 0));
1809 __ movw(Address(EDI, 0), EAX);
1810 __ leal(EDI, Address(EDI, char_size));
1811 __ leal(ESI, Address(ESI, c_char_size));
1812 // TODO: Add support for LOOP to X86Assembler.
1813 __ subl(ECX, Immediate(1));
1814 __ jmp(&copy_loop);
1815 __ Bind(&copy_uncompressed);
1816 }
1817
1818 // Do the copy for uncompressed string.
1819 // Compute the address of the destination buffer.
1820 __ leal(EDI, Address(dst, dstBegin, ScaleFactor::TIMES_2, data_offset));
1821 __ leal(ESI, CodeGeneratorX86::ArrayAddress(obj, srcBegin, TIMES_2, value_offset));
Mark Mendell8f8926a2015-08-17 11:39:06 -04001822 __ rep_movsw();
1823
jessicahandojo4877b792016-09-08 19:49:13 -07001824 __ Bind(&done);
1825 if (mirror::kUseStringCompression) {
1826 // Restore EAX.
1827 __ popl(EAX);
1828 __ cfi().AdjustCFAOffset(-stack_adjust);
1829 }
1830 // Restore ECX.
Mark Mendell8f8926a2015-08-17 11:39:06 -04001831 __ popl(ECX);
1832 __ cfi().AdjustCFAOffset(-stack_adjust);
1833}
1834
Mark Mendell09ed1a32015-03-25 08:30:06 -04001835static void GenPeek(LocationSummary* locations, Primitive::Type size, X86Assembler* assembler) {
1836 Register address = locations->InAt(0).AsRegisterPairLow<Register>();
1837 Location out_loc = locations->Out();
1838 // x86 allows unaligned access. We do not have to check the input or use specific instructions
1839 // to avoid a SIGBUS.
1840 switch (size) {
1841 case Primitive::kPrimByte:
1842 __ movsxb(out_loc.AsRegister<Register>(), Address(address, 0));
1843 break;
1844 case Primitive::kPrimShort:
1845 __ movsxw(out_loc.AsRegister<Register>(), Address(address, 0));
1846 break;
1847 case Primitive::kPrimInt:
1848 __ movl(out_loc.AsRegister<Register>(), Address(address, 0));
1849 break;
1850 case Primitive::kPrimLong:
1851 __ movl(out_loc.AsRegisterPairLow<Register>(), Address(address, 0));
1852 __ movl(out_loc.AsRegisterPairHigh<Register>(), Address(address, 4));
1853 break;
1854 default:
1855 LOG(FATAL) << "Type not recognized for peek: " << size;
1856 UNREACHABLE();
1857 }
1858}
1859
1860void IntrinsicLocationsBuilderX86::VisitMemoryPeekByte(HInvoke* invoke) {
1861 CreateLongToIntLocations(arena_, invoke);
1862}
1863
1864void IntrinsicCodeGeneratorX86::VisitMemoryPeekByte(HInvoke* invoke) {
1865 GenPeek(invoke->GetLocations(), Primitive::kPrimByte, GetAssembler());
1866}
1867
1868void IntrinsicLocationsBuilderX86::VisitMemoryPeekIntNative(HInvoke* invoke) {
1869 CreateLongToIntLocations(arena_, invoke);
1870}
1871
1872void IntrinsicCodeGeneratorX86::VisitMemoryPeekIntNative(HInvoke* invoke) {
1873 GenPeek(invoke->GetLocations(), Primitive::kPrimInt, GetAssembler());
1874}
1875
1876void IntrinsicLocationsBuilderX86::VisitMemoryPeekLongNative(HInvoke* invoke) {
1877 CreateLongToLongLocations(arena_, invoke);
1878}
1879
1880void IntrinsicCodeGeneratorX86::VisitMemoryPeekLongNative(HInvoke* invoke) {
1881 GenPeek(invoke->GetLocations(), Primitive::kPrimLong, GetAssembler());
1882}
1883
1884void IntrinsicLocationsBuilderX86::VisitMemoryPeekShortNative(HInvoke* invoke) {
1885 CreateLongToIntLocations(arena_, invoke);
1886}
1887
1888void IntrinsicCodeGeneratorX86::VisitMemoryPeekShortNative(HInvoke* invoke) {
1889 GenPeek(invoke->GetLocations(), Primitive::kPrimShort, GetAssembler());
1890}
1891
1892static void CreateLongIntToVoidLocations(ArenaAllocator* arena, Primitive::Type size,
1893 HInvoke* invoke) {
1894 LocationSummary* locations = new (arena) LocationSummary(invoke,
1895 LocationSummary::kNoCall,
1896 kIntrinsified);
1897 locations->SetInAt(0, Location::RequiresRegister());
Roland Levillain4c0eb422015-04-24 16:43:49 +01001898 HInstruction* value = invoke->InputAt(1);
Mark Mendell09ed1a32015-03-25 08:30:06 -04001899 if (size == Primitive::kPrimByte) {
1900 locations->SetInAt(1, Location::ByteRegisterOrConstant(EDX, value));
1901 } else {
1902 locations->SetInAt(1, Location::RegisterOrConstant(value));
1903 }
1904}
1905
1906static void GenPoke(LocationSummary* locations, Primitive::Type size, X86Assembler* assembler) {
1907 Register address = locations->InAt(0).AsRegisterPairLow<Register>();
1908 Location value_loc = locations->InAt(1);
1909 // x86 allows unaligned access. We do not have to check the input or use specific instructions
1910 // to avoid a SIGBUS.
1911 switch (size) {
1912 case Primitive::kPrimByte:
1913 if (value_loc.IsConstant()) {
1914 __ movb(Address(address, 0),
1915 Immediate(value_loc.GetConstant()->AsIntConstant()->GetValue()));
1916 } else {
1917 __ movb(Address(address, 0), value_loc.AsRegister<ByteRegister>());
1918 }
1919 break;
1920 case Primitive::kPrimShort:
1921 if (value_loc.IsConstant()) {
1922 __ movw(Address(address, 0),
1923 Immediate(value_loc.GetConstant()->AsIntConstant()->GetValue()));
1924 } else {
1925 __ movw(Address(address, 0), value_loc.AsRegister<Register>());
1926 }
1927 break;
1928 case Primitive::kPrimInt:
1929 if (value_loc.IsConstant()) {
1930 __ movl(Address(address, 0),
1931 Immediate(value_loc.GetConstant()->AsIntConstant()->GetValue()));
1932 } else {
1933 __ movl(Address(address, 0), value_loc.AsRegister<Register>());
1934 }
1935 break;
1936 case Primitive::kPrimLong:
1937 if (value_loc.IsConstant()) {
1938 int64_t value = value_loc.GetConstant()->AsLongConstant()->GetValue();
1939 __ movl(Address(address, 0), Immediate(Low32Bits(value)));
1940 __ movl(Address(address, 4), Immediate(High32Bits(value)));
1941 } else {
1942 __ movl(Address(address, 0), value_loc.AsRegisterPairLow<Register>());
1943 __ movl(Address(address, 4), value_loc.AsRegisterPairHigh<Register>());
1944 }
1945 break;
1946 default:
1947 LOG(FATAL) << "Type not recognized for poke: " << size;
1948 UNREACHABLE();
1949 }
1950}
1951
1952void IntrinsicLocationsBuilderX86::VisitMemoryPokeByte(HInvoke* invoke) {
1953 CreateLongIntToVoidLocations(arena_, Primitive::kPrimByte, invoke);
1954}
1955
1956void IntrinsicCodeGeneratorX86::VisitMemoryPokeByte(HInvoke* invoke) {
1957 GenPoke(invoke->GetLocations(), Primitive::kPrimByte, GetAssembler());
1958}
1959
1960void IntrinsicLocationsBuilderX86::VisitMemoryPokeIntNative(HInvoke* invoke) {
1961 CreateLongIntToVoidLocations(arena_, Primitive::kPrimInt, invoke);
1962}
1963
1964void IntrinsicCodeGeneratorX86::VisitMemoryPokeIntNative(HInvoke* invoke) {
1965 GenPoke(invoke->GetLocations(), Primitive::kPrimInt, GetAssembler());
1966}
1967
1968void IntrinsicLocationsBuilderX86::VisitMemoryPokeLongNative(HInvoke* invoke) {
1969 CreateLongIntToVoidLocations(arena_, Primitive::kPrimLong, invoke);
1970}
1971
1972void IntrinsicCodeGeneratorX86::VisitMemoryPokeLongNative(HInvoke* invoke) {
1973 GenPoke(invoke->GetLocations(), Primitive::kPrimLong, GetAssembler());
1974}
1975
1976void IntrinsicLocationsBuilderX86::VisitMemoryPokeShortNative(HInvoke* invoke) {
1977 CreateLongIntToVoidLocations(arena_, Primitive::kPrimShort, invoke);
1978}
1979
1980void IntrinsicCodeGeneratorX86::VisitMemoryPokeShortNative(HInvoke* invoke) {
1981 GenPoke(invoke->GetLocations(), Primitive::kPrimShort, GetAssembler());
1982}
1983
1984void IntrinsicLocationsBuilderX86::VisitThreadCurrentThread(HInvoke* invoke) {
1985 LocationSummary* locations = new (arena_) LocationSummary(invoke,
1986 LocationSummary::kNoCall,
1987 kIntrinsified);
1988 locations->SetOut(Location::RequiresRegister());
1989}
1990
1991void IntrinsicCodeGeneratorX86::VisitThreadCurrentThread(HInvoke* invoke) {
1992 Register out = invoke->GetLocations()->Out().AsRegister<Register>();
Andreas Gampe542451c2016-07-26 09:02:02 -07001993 GetAssembler()->fs()->movl(out, Address::Absolute(Thread::PeerOffset<kX86PointerSize>()));
Mark Mendell09ed1a32015-03-25 08:30:06 -04001994}
1995
Roland Levillain0d5a2812015-11-13 10:07:31 +00001996static void GenUnsafeGet(HInvoke* invoke,
1997 Primitive::Type type,
1998 bool is_volatile,
1999 CodeGeneratorX86* codegen) {
2000 X86Assembler* assembler = down_cast<X86Assembler*>(codegen->GetAssembler());
2001 LocationSummary* locations = invoke->GetLocations();
2002 Location base_loc = locations->InAt(1);
2003 Register base = base_loc.AsRegister<Register>();
2004 Location offset_loc = locations->InAt(2);
2005 Register offset = offset_loc.AsRegisterPairLow<Register>();
2006 Location output_loc = locations->Out();
Mark Mendell09ed1a32015-03-25 08:30:06 -04002007
2008 switch (type) {
Roland Levillain7c1559a2015-12-15 10:55:36 +00002009 case Primitive::kPrimInt: {
Roland Levillain0d5a2812015-11-13 10:07:31 +00002010 Register output = output_loc.AsRegister<Register>();
2011 __ movl(output, Address(base, offset, ScaleFactor::TIMES_1, 0));
Roland Levillain7c1559a2015-12-15 10:55:36 +00002012 break;
2013 }
2014
2015 case Primitive::kPrimNot: {
2016 Register output = output_loc.AsRegister<Register>();
2017 if (kEmitCompilerReadBarrier) {
2018 if (kUseBakerReadBarrier) {
Sang, Chunlei0fcd2b82016-04-05 17:12:59 +08002019 Address src(base, offset, ScaleFactor::TIMES_1, 0);
2020 codegen->GenerateReferenceLoadWithBakerReadBarrier(
Vladimir Marko953437b2016-08-24 08:30:46 +00002021 invoke, output_loc, base, src, /* needs_null_check */ false);
Roland Levillain7c1559a2015-12-15 10:55:36 +00002022 } else {
2023 __ movl(output, Address(base, offset, ScaleFactor::TIMES_1, 0));
2024 codegen->GenerateReadBarrierSlow(
2025 invoke, output_loc, output_loc, base_loc, 0U, offset_loc);
2026 }
2027 } else {
2028 __ movl(output, Address(base, offset, ScaleFactor::TIMES_1, 0));
2029 __ MaybeUnpoisonHeapReference(output);
Roland Levillain4d027112015-07-01 15:41:14 +01002030 }
Mark Mendell09ed1a32015-03-25 08:30:06 -04002031 break;
Roland Levillain4d027112015-07-01 15:41:14 +01002032 }
Mark Mendell09ed1a32015-03-25 08:30:06 -04002033
2034 case Primitive::kPrimLong: {
Roland Levillain0d5a2812015-11-13 10:07:31 +00002035 Register output_lo = output_loc.AsRegisterPairLow<Register>();
2036 Register output_hi = output_loc.AsRegisterPairHigh<Register>();
Mark Mendell09ed1a32015-03-25 08:30:06 -04002037 if (is_volatile) {
2038 // Need to use a XMM to read atomically.
2039 XmmRegister temp = locations->GetTemp(0).AsFpuRegister<XmmRegister>();
2040 __ movsd(temp, Address(base, offset, ScaleFactor::TIMES_1, 0));
2041 __ movd(output_lo, temp);
2042 __ psrlq(temp, Immediate(32));
2043 __ movd(output_hi, temp);
2044 } else {
2045 __ movl(output_lo, Address(base, offset, ScaleFactor::TIMES_1, 0));
2046 __ movl(output_hi, Address(base, offset, ScaleFactor::TIMES_1, 4));
2047 }
2048 }
2049 break;
2050
2051 default:
2052 LOG(FATAL) << "Unsupported op size " << type;
2053 UNREACHABLE();
2054 }
2055}
2056
Roland Levillain7c1559a2015-12-15 10:55:36 +00002057static void CreateIntIntIntToIntLocations(ArenaAllocator* arena,
2058 HInvoke* invoke,
2059 Primitive::Type type,
2060 bool is_volatile) {
Roland Levillain0d5a2812015-11-13 10:07:31 +00002061 bool can_call = kEmitCompilerReadBarrier &&
2062 (invoke->GetIntrinsic() == Intrinsics::kUnsafeGetObject ||
2063 invoke->GetIntrinsic() == Intrinsics::kUnsafeGetObjectVolatile);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002064 LocationSummary* locations = new (arena) LocationSummary(invoke,
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002065 (can_call
2066 ? LocationSummary::kCallOnSlowPath
2067 : LocationSummary::kNoCall),
Mark Mendell09ed1a32015-03-25 08:30:06 -04002068 kIntrinsified);
Vladimir Marko70e97462016-08-09 11:04:26 +01002069 if (can_call && kUseBakerReadBarrier) {
Vladimir Marko804b03f2016-09-14 16:26:36 +01002070 locations->SetCustomSlowPathCallerSaves(RegisterSet::Empty()); // No caller-save registers.
Vladimir Marko70e97462016-08-09 11:04:26 +01002071 }
Mark Mendell09ed1a32015-03-25 08:30:06 -04002072 locations->SetInAt(0, Location::NoLocation()); // Unused receiver.
2073 locations->SetInAt(1, Location::RequiresRegister());
2074 locations->SetInAt(2, Location::RequiresRegister());
Roland Levillain7c1559a2015-12-15 10:55:36 +00002075 if (type == Primitive::kPrimLong) {
Mark Mendell09ed1a32015-03-25 08:30:06 -04002076 if (is_volatile) {
2077 // Need to use XMM to read volatile.
2078 locations->AddTemp(Location::RequiresFpuRegister());
Roland Levillain3d312422016-06-23 13:53:42 +01002079 locations->SetOut(Location::RequiresRegister(), Location::kNoOutputOverlap);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002080 } else {
2081 locations->SetOut(Location::RequiresRegister(), Location::kOutputOverlap);
2082 }
2083 } else {
Roland Levillain3d312422016-06-23 13:53:42 +01002084 locations->SetOut(Location::RequiresRegister(),
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002085 (can_call ? Location::kOutputOverlap : Location::kNoOutputOverlap));
Mark Mendell09ed1a32015-03-25 08:30:06 -04002086 }
2087}
2088
2089void IntrinsicLocationsBuilderX86::VisitUnsafeGet(HInvoke* invoke) {
Roland Levillain7c1559a2015-12-15 10:55:36 +00002090 CreateIntIntIntToIntLocations(arena_, invoke, Primitive::kPrimInt, /* is_volatile */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002091}
2092void IntrinsicLocationsBuilderX86::VisitUnsafeGetVolatile(HInvoke* invoke) {
Roland Levillain7c1559a2015-12-15 10:55:36 +00002093 CreateIntIntIntToIntLocations(arena_, invoke, Primitive::kPrimInt, /* is_volatile */ true);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002094}
2095void IntrinsicLocationsBuilderX86::VisitUnsafeGetLong(HInvoke* invoke) {
Roland Levillain7c1559a2015-12-15 10:55:36 +00002096 CreateIntIntIntToIntLocations(arena_, invoke, Primitive::kPrimLong, /* is_volatile */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002097}
2098void IntrinsicLocationsBuilderX86::VisitUnsafeGetLongVolatile(HInvoke* invoke) {
Roland Levillain7c1559a2015-12-15 10:55:36 +00002099 CreateIntIntIntToIntLocations(arena_, invoke, Primitive::kPrimLong, /* is_volatile */ true);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002100}
2101void IntrinsicLocationsBuilderX86::VisitUnsafeGetObject(HInvoke* invoke) {
Roland Levillain7c1559a2015-12-15 10:55:36 +00002102 CreateIntIntIntToIntLocations(arena_, invoke, Primitive::kPrimNot, /* is_volatile */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002103}
2104void IntrinsicLocationsBuilderX86::VisitUnsafeGetObjectVolatile(HInvoke* invoke) {
Roland Levillain7c1559a2015-12-15 10:55:36 +00002105 CreateIntIntIntToIntLocations(arena_, invoke, Primitive::kPrimNot, /* is_volatile */ true);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002106}
2107
2108
2109void IntrinsicCodeGeneratorX86::VisitUnsafeGet(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002110 GenUnsafeGet(invoke, Primitive::kPrimInt, /* is_volatile */ false, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002111}
2112void IntrinsicCodeGeneratorX86::VisitUnsafeGetVolatile(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002113 GenUnsafeGet(invoke, Primitive::kPrimInt, /* is_volatile */ true, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002114}
2115void IntrinsicCodeGeneratorX86::VisitUnsafeGetLong(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002116 GenUnsafeGet(invoke, Primitive::kPrimLong, /* is_volatile */ false, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002117}
2118void IntrinsicCodeGeneratorX86::VisitUnsafeGetLongVolatile(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002119 GenUnsafeGet(invoke, Primitive::kPrimLong, /* is_volatile */ true, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002120}
2121void IntrinsicCodeGeneratorX86::VisitUnsafeGetObject(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002122 GenUnsafeGet(invoke, Primitive::kPrimNot, /* is_volatile */ false, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002123}
2124void IntrinsicCodeGeneratorX86::VisitUnsafeGetObjectVolatile(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002125 GenUnsafeGet(invoke, Primitive::kPrimNot, /* is_volatile */ true, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002126}
2127
2128
2129static void CreateIntIntIntIntToVoidPlusTempsLocations(ArenaAllocator* arena,
2130 Primitive::Type type,
2131 HInvoke* invoke,
2132 bool is_volatile) {
2133 LocationSummary* locations = new (arena) LocationSummary(invoke,
2134 LocationSummary::kNoCall,
2135 kIntrinsified);
2136 locations->SetInAt(0, Location::NoLocation()); // Unused receiver.
2137 locations->SetInAt(1, Location::RequiresRegister());
2138 locations->SetInAt(2, Location::RequiresRegister());
2139 locations->SetInAt(3, Location::RequiresRegister());
2140 if (type == Primitive::kPrimNot) {
2141 // Need temp registers for card-marking.
Roland Levillain4d027112015-07-01 15:41:14 +01002142 locations->AddTemp(Location::RequiresRegister()); // Possibly used for reference poisoning too.
Mark Mendell09ed1a32015-03-25 08:30:06 -04002143 // Ensure the value is in a byte register.
2144 locations->AddTemp(Location::RegisterLocation(ECX));
2145 } else if (type == Primitive::kPrimLong && is_volatile) {
2146 locations->AddTemp(Location::RequiresFpuRegister());
2147 locations->AddTemp(Location::RequiresFpuRegister());
2148 }
2149}
2150
2151void IntrinsicLocationsBuilderX86::VisitUnsafePut(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002152 CreateIntIntIntIntToVoidPlusTempsLocations(
2153 arena_, Primitive::kPrimInt, invoke, /* is_volatile */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002154}
2155void IntrinsicLocationsBuilderX86::VisitUnsafePutOrdered(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002156 CreateIntIntIntIntToVoidPlusTempsLocations(
2157 arena_, Primitive::kPrimInt, invoke, /* is_volatile */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002158}
2159void IntrinsicLocationsBuilderX86::VisitUnsafePutVolatile(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002160 CreateIntIntIntIntToVoidPlusTempsLocations(
2161 arena_, Primitive::kPrimInt, invoke, /* is_volatile */ true);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002162}
2163void IntrinsicLocationsBuilderX86::VisitUnsafePutObject(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002164 CreateIntIntIntIntToVoidPlusTempsLocations(
2165 arena_, Primitive::kPrimNot, invoke, /* is_volatile */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002166}
2167void IntrinsicLocationsBuilderX86::VisitUnsafePutObjectOrdered(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002168 CreateIntIntIntIntToVoidPlusTempsLocations(
2169 arena_, Primitive::kPrimNot, invoke, /* is_volatile */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002170}
2171void IntrinsicLocationsBuilderX86::VisitUnsafePutObjectVolatile(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002172 CreateIntIntIntIntToVoidPlusTempsLocations(
2173 arena_, Primitive::kPrimNot, invoke, /* is_volatile */ true);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002174}
2175void IntrinsicLocationsBuilderX86::VisitUnsafePutLong(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002176 CreateIntIntIntIntToVoidPlusTempsLocations(
2177 arena_, Primitive::kPrimLong, invoke, /* is_volatile */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002178}
2179void IntrinsicLocationsBuilderX86::VisitUnsafePutLongOrdered(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002180 CreateIntIntIntIntToVoidPlusTempsLocations(
2181 arena_, Primitive::kPrimLong, invoke, /* is_volatile */ false);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002182}
2183void IntrinsicLocationsBuilderX86::VisitUnsafePutLongVolatile(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002184 CreateIntIntIntIntToVoidPlusTempsLocations(
2185 arena_, Primitive::kPrimLong, invoke, /* is_volatile */ true);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002186}
2187
2188// We don't care for ordered: it requires an AnyStore barrier, which is already given by the x86
2189// memory model.
2190static void GenUnsafePut(LocationSummary* locations,
2191 Primitive::Type type,
2192 bool is_volatile,
2193 CodeGeneratorX86* codegen) {
Roland Levillainb488b782015-10-22 11:38:49 +01002194 X86Assembler* assembler = down_cast<X86Assembler*>(codegen->GetAssembler());
Mark Mendell09ed1a32015-03-25 08:30:06 -04002195 Register base = locations->InAt(1).AsRegister<Register>();
2196 Register offset = locations->InAt(2).AsRegisterPairLow<Register>();
2197 Location value_loc = locations->InAt(3);
2198
2199 if (type == Primitive::kPrimLong) {
2200 Register value_lo = value_loc.AsRegisterPairLow<Register>();
2201 Register value_hi = value_loc.AsRegisterPairHigh<Register>();
2202 if (is_volatile) {
2203 XmmRegister temp1 = locations->GetTemp(0).AsFpuRegister<XmmRegister>();
2204 XmmRegister temp2 = locations->GetTemp(1).AsFpuRegister<XmmRegister>();
2205 __ movd(temp1, value_lo);
2206 __ movd(temp2, value_hi);
2207 __ punpckldq(temp1, temp2);
2208 __ movsd(Address(base, offset, ScaleFactor::TIMES_1, 0), temp1);
2209 } else {
2210 __ movl(Address(base, offset, ScaleFactor::TIMES_1, 0), value_lo);
2211 __ movl(Address(base, offset, ScaleFactor::TIMES_1, 4), value_hi);
2212 }
Roland Levillain4d027112015-07-01 15:41:14 +01002213 } else if (kPoisonHeapReferences && type == Primitive::kPrimNot) {
2214 Register temp = locations->GetTemp(0).AsRegister<Register>();
2215 __ movl(temp, value_loc.AsRegister<Register>());
2216 __ PoisonHeapReference(temp);
2217 __ movl(Address(base, offset, ScaleFactor::TIMES_1, 0), temp);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002218 } else {
2219 __ movl(Address(base, offset, ScaleFactor::TIMES_1, 0), value_loc.AsRegister<Register>());
2220 }
2221
2222 if (is_volatile) {
Mark P Mendell17077d82015-12-16 19:15:59 +00002223 codegen->MemoryFence();
Mark Mendell09ed1a32015-03-25 08:30:06 -04002224 }
2225
2226 if (type == Primitive::kPrimNot) {
Nicolas Geoffray07276db2015-05-18 14:22:09 +01002227 bool value_can_be_null = true; // TODO: Worth finding out this information?
Mark Mendell09ed1a32015-03-25 08:30:06 -04002228 codegen->MarkGCCard(locations->GetTemp(0).AsRegister<Register>(),
2229 locations->GetTemp(1).AsRegister<Register>(),
2230 base,
Nicolas Geoffray07276db2015-05-18 14:22:09 +01002231 value_loc.AsRegister<Register>(),
2232 value_can_be_null);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002233 }
2234}
2235
2236void IntrinsicCodeGeneratorX86::VisitUnsafePut(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002237 GenUnsafePut(invoke->GetLocations(), Primitive::kPrimInt, /* is_volatile */ false, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002238}
2239void IntrinsicCodeGeneratorX86::VisitUnsafePutOrdered(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002240 GenUnsafePut(invoke->GetLocations(), Primitive::kPrimInt, /* is_volatile */ false, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002241}
2242void IntrinsicCodeGeneratorX86::VisitUnsafePutVolatile(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002243 GenUnsafePut(invoke->GetLocations(), Primitive::kPrimInt, /* is_volatile */ true, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002244}
2245void IntrinsicCodeGeneratorX86::VisitUnsafePutObject(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002246 GenUnsafePut(invoke->GetLocations(), Primitive::kPrimNot, /* is_volatile */ false, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002247}
2248void IntrinsicCodeGeneratorX86::VisitUnsafePutObjectOrdered(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002249 GenUnsafePut(invoke->GetLocations(), Primitive::kPrimNot, /* is_volatile */ false, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002250}
2251void IntrinsicCodeGeneratorX86::VisitUnsafePutObjectVolatile(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002252 GenUnsafePut(invoke->GetLocations(), Primitive::kPrimNot, /* is_volatile */ true, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002253}
2254void IntrinsicCodeGeneratorX86::VisitUnsafePutLong(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002255 GenUnsafePut(invoke->GetLocations(), Primitive::kPrimLong, /* is_volatile */ false, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002256}
2257void IntrinsicCodeGeneratorX86::VisitUnsafePutLongOrdered(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002258 GenUnsafePut(invoke->GetLocations(), Primitive::kPrimLong, /* is_volatile */ false, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002259}
2260void IntrinsicCodeGeneratorX86::VisitUnsafePutLongVolatile(HInvoke* invoke) {
Roland Levillainbf84a3d2015-12-04 14:33:02 +00002261 GenUnsafePut(invoke->GetLocations(), Primitive::kPrimLong, /* is_volatile */ true, codegen_);
Mark Mendell09ed1a32015-03-25 08:30:06 -04002262}
2263
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002264static void CreateIntIntIntIntIntToInt(ArenaAllocator* arena,
2265 Primitive::Type type,
Mark Mendell58d25fd2015-04-03 14:52:31 -04002266 HInvoke* invoke) {
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002267 bool can_call = kEmitCompilerReadBarrier &&
2268 kUseBakerReadBarrier &&
2269 (invoke->GetIntrinsic() == Intrinsics::kUnsafeCASObject);
Mark Mendell58d25fd2015-04-03 14:52:31 -04002270 LocationSummary* locations = new (arena) LocationSummary(invoke,
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002271 (can_call
2272 ? LocationSummary::kCallOnSlowPath
2273 : LocationSummary::kNoCall),
Mark Mendell58d25fd2015-04-03 14:52:31 -04002274 kIntrinsified);
2275 locations->SetInAt(0, Location::NoLocation()); // Unused receiver.
2276 locations->SetInAt(1, Location::RequiresRegister());
2277 // Offset is a long, but in 32 bit mode, we only need the low word.
2278 // Can we update the invoke here to remove a TypeConvert to Long?
2279 locations->SetInAt(2, Location::RequiresRegister());
2280 // Expected value must be in EAX or EDX:EAX.
2281 // For long, new value must be in ECX:EBX.
2282 if (type == Primitive::kPrimLong) {
2283 locations->SetInAt(3, Location::RegisterPairLocation(EAX, EDX));
2284 locations->SetInAt(4, Location::RegisterPairLocation(EBX, ECX));
2285 } else {
2286 locations->SetInAt(3, Location::RegisterLocation(EAX));
2287 locations->SetInAt(4, Location::RequiresRegister());
2288 }
2289
2290 // Force a byte register for the output.
2291 locations->SetOut(Location::RegisterLocation(EAX));
2292 if (type == Primitive::kPrimNot) {
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002293 // Need temporary registers for card-marking, and possibly for
2294 // (Baker) read barrier.
Roland Levillainb488b782015-10-22 11:38:49 +01002295 locations->AddTemp(Location::RequiresRegister()); // Possibly used for reference poisoning too.
Mark Mendell58d25fd2015-04-03 14:52:31 -04002296 // Need a byte register for marking.
2297 locations->AddTemp(Location::RegisterLocation(ECX));
2298 }
2299}
2300
2301void IntrinsicLocationsBuilderX86::VisitUnsafeCASInt(HInvoke* invoke) {
2302 CreateIntIntIntIntIntToInt(arena_, Primitive::kPrimInt, invoke);
2303}
2304
2305void IntrinsicLocationsBuilderX86::VisitUnsafeCASLong(HInvoke* invoke) {
2306 CreateIntIntIntIntIntToInt(arena_, Primitive::kPrimLong, invoke);
2307}
2308
2309void IntrinsicLocationsBuilderX86::VisitUnsafeCASObject(HInvoke* invoke) {
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002310 // The only read barrier implementation supporting the
2311 // UnsafeCASObject intrinsic is the Baker-style read barriers.
2312 if (kEmitCompilerReadBarrier && !kUseBakerReadBarrier) {
Roland Levillain391b8662015-12-18 11:43:38 +00002313 return;
2314 }
2315
Mark Mendell58d25fd2015-04-03 14:52:31 -04002316 CreateIntIntIntIntIntToInt(arena_, Primitive::kPrimNot, invoke);
2317}
2318
2319static void GenCAS(Primitive::Type type, HInvoke* invoke, CodeGeneratorX86* codegen) {
Roland Levillainb488b782015-10-22 11:38:49 +01002320 X86Assembler* assembler = down_cast<X86Assembler*>(codegen->GetAssembler());
Mark Mendell58d25fd2015-04-03 14:52:31 -04002321 LocationSummary* locations = invoke->GetLocations();
2322
2323 Register base = locations->InAt(1).AsRegister<Register>();
2324 Register offset = locations->InAt(2).AsRegisterPairLow<Register>();
2325 Location out = locations->Out();
2326 DCHECK_EQ(out.AsRegister<Register>(), EAX);
2327
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002328 // The address of the field within the holding object.
2329 Address field_addr(base, offset, ScaleFactor::TIMES_1, 0);
2330
Roland Levillainb488b782015-10-22 11:38:49 +01002331 if (type == Primitive::kPrimNot) {
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002332 // The only read barrier implementation supporting the
2333 // UnsafeCASObject intrinsic is the Baker-style read barriers.
2334 DCHECK(!kEmitCompilerReadBarrier || kUseBakerReadBarrier);
2335
2336 Location temp1_loc = locations->GetTemp(0);
2337 Register temp1 = temp1_loc.AsRegister<Register>();
2338 Register temp2 = locations->GetTemp(1).AsRegister<Register>();
2339
Roland Levillain4d027112015-07-01 15:41:14 +01002340 Register expected = locations->InAt(3).AsRegister<Register>();
Roland Levillainb488b782015-10-22 11:38:49 +01002341 // Ensure `expected` is in EAX (required by the CMPXCHG instruction).
Roland Levillain4d027112015-07-01 15:41:14 +01002342 DCHECK_EQ(expected, EAX);
Mark Mendell58d25fd2015-04-03 14:52:31 -04002343 Register value = locations->InAt(4).AsRegister<Register>();
Roland Levillain4d027112015-07-01 15:41:14 +01002344
Roland Levillainb488b782015-10-22 11:38:49 +01002345 // Mark card for object assuming new value is stored.
2346 bool value_can_be_null = true; // TODO: Worth finding out this information?
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002347 codegen->MarkGCCard(temp1, temp2, base, value, value_can_be_null);
2348
2349 if (kEmitCompilerReadBarrier && kUseBakerReadBarrier) {
2350 // Need to make sure the reference stored in the field is a to-space
2351 // one before attempting the CAS or the CAS could fail incorrectly.
2352 codegen->GenerateReferenceLoadWithBakerReadBarrier(
2353 invoke,
2354 temp1_loc, // Unused, used only as a "temporary" within the read barrier.
2355 base,
2356 field_addr,
2357 /* needs_null_check */ false,
2358 /* always_update_field */ true,
2359 &temp2);
2360 }
Roland Levillainb488b782015-10-22 11:38:49 +01002361
2362 bool base_equals_value = (base == value);
2363 if (kPoisonHeapReferences) {
2364 if (base_equals_value) {
2365 // If `base` and `value` are the same register location, move
2366 // `value` to a temporary register. This way, poisoning
2367 // `value` won't invalidate `base`.
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002368 value = temp1;
Roland Levillainb488b782015-10-22 11:38:49 +01002369 __ movl(value, base);
Roland Levillain4d027112015-07-01 15:41:14 +01002370 }
Roland Levillainb488b782015-10-22 11:38:49 +01002371
2372 // Check that the register allocator did not assign the location
2373 // of `expected` (EAX) to `value` nor to `base`, so that heap
2374 // poisoning (when enabled) works as intended below.
2375 // - If `value` were equal to `expected`, both references would
2376 // be poisoned twice, meaning they would not be poisoned at
2377 // all, as heap poisoning uses address negation.
2378 // - If `base` were equal to `expected`, poisoning `expected`
2379 // would invalidate `base`.
2380 DCHECK_NE(value, expected);
2381 DCHECK_NE(base, expected);
2382
2383 __ PoisonHeapReference(expected);
2384 __ PoisonHeapReference(value);
Mark Mendell58d25fd2015-04-03 14:52:31 -04002385 }
2386
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002387 __ LockCmpxchgl(field_addr, value);
Mark Mendell58d25fd2015-04-03 14:52:31 -04002388
Roland Levillain0d5a2812015-11-13 10:07:31 +00002389 // LOCK CMPXCHG has full barrier semantics, and we don't need
Roland Levillainb488b782015-10-22 11:38:49 +01002390 // scheduling barriers at this time.
Mark Mendell58d25fd2015-04-03 14:52:31 -04002391
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002392 // Convert ZF into the Boolean result.
Roland Levillainb488b782015-10-22 11:38:49 +01002393 __ setb(kZero, out.AsRegister<Register>());
2394 __ movzxb(out.AsRegister<Register>(), out.AsRegister<ByteRegister>());
Roland Levillain4d027112015-07-01 15:41:14 +01002395
Roland Levillain391b8662015-12-18 11:43:38 +00002396 // If heap poisoning is enabled, we need to unpoison the values
2397 // that were poisoned earlier.
Roland Levillainb488b782015-10-22 11:38:49 +01002398 if (kPoisonHeapReferences) {
2399 if (base_equals_value) {
2400 // `value` has been moved to a temporary register, no need to
2401 // unpoison it.
2402 } else {
2403 // Ensure `value` is different from `out`, so that unpoisoning
2404 // the former does not invalidate the latter.
2405 DCHECK_NE(value, out.AsRegister<Register>());
2406 __ UnpoisonHeapReference(value);
2407 }
2408 // Do not unpoison the reference contained in register
2409 // `expected`, as it is the same as register `out` (EAX).
2410 }
2411 } else {
2412 if (type == Primitive::kPrimInt) {
2413 // Ensure the expected value is in EAX (required by the CMPXCHG
2414 // instruction).
2415 DCHECK_EQ(locations->InAt(3).AsRegister<Register>(), EAX);
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002416 __ LockCmpxchgl(field_addr, locations->InAt(4).AsRegister<Register>());
Roland Levillainb488b782015-10-22 11:38:49 +01002417 } else if (type == Primitive::kPrimLong) {
2418 // Ensure the expected value is in EAX:EDX and that the new
2419 // value is in EBX:ECX (required by the CMPXCHG8B instruction).
2420 DCHECK_EQ(locations->InAt(3).AsRegisterPairLow<Register>(), EAX);
2421 DCHECK_EQ(locations->InAt(3).AsRegisterPairHigh<Register>(), EDX);
2422 DCHECK_EQ(locations->InAt(4).AsRegisterPairLow<Register>(), EBX);
2423 DCHECK_EQ(locations->InAt(4).AsRegisterPairHigh<Register>(), ECX);
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002424 __ LockCmpxchg8b(field_addr);
Roland Levillainb488b782015-10-22 11:38:49 +01002425 } else {
2426 LOG(FATAL) << "Unexpected CAS type " << type;
2427 }
2428
Roland Levillain0d5a2812015-11-13 10:07:31 +00002429 // LOCK CMPXCHG/LOCK CMPXCHG8B have full barrier semantics, and we
2430 // don't need scheduling barriers at this time.
Roland Levillainb488b782015-10-22 11:38:49 +01002431
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002432 // Convert ZF into the Boolean result.
Roland Levillainb488b782015-10-22 11:38:49 +01002433 __ setb(kZero, out.AsRegister<Register>());
2434 __ movzxb(out.AsRegister<Register>(), out.AsRegister<ByteRegister>());
Roland Levillain4d027112015-07-01 15:41:14 +01002435 }
Mark Mendell58d25fd2015-04-03 14:52:31 -04002436}
2437
2438void IntrinsicCodeGeneratorX86::VisitUnsafeCASInt(HInvoke* invoke) {
2439 GenCAS(Primitive::kPrimInt, invoke, codegen_);
2440}
2441
2442void IntrinsicCodeGeneratorX86::VisitUnsafeCASLong(HInvoke* invoke) {
2443 GenCAS(Primitive::kPrimLong, invoke, codegen_);
2444}
2445
2446void IntrinsicCodeGeneratorX86::VisitUnsafeCASObject(HInvoke* invoke) {
Roland Levillaina1aa3b12016-10-26 13:03:38 +01002447 // The only read barrier implementation supporting the
2448 // UnsafeCASObject intrinsic is the Baker-style read barriers.
2449 DCHECK(!kEmitCompilerReadBarrier || kUseBakerReadBarrier);
Roland Levillain3d312422016-06-23 13:53:42 +01002450
Mark Mendell58d25fd2015-04-03 14:52:31 -04002451 GenCAS(Primitive::kPrimNot, invoke, codegen_);
2452}
2453
2454void IntrinsicLocationsBuilderX86::VisitIntegerReverse(HInvoke* invoke) {
2455 LocationSummary* locations = new (arena_) LocationSummary(invoke,
2456 LocationSummary::kNoCall,
2457 kIntrinsified);
2458 locations->SetInAt(0, Location::RequiresRegister());
2459 locations->SetOut(Location::SameAsFirstInput());
2460 locations->AddTemp(Location::RequiresRegister());
2461}
2462
2463static void SwapBits(Register reg, Register temp, int32_t shift, int32_t mask,
2464 X86Assembler* assembler) {
2465 Immediate imm_shift(shift);
2466 Immediate imm_mask(mask);
2467 __ movl(temp, reg);
2468 __ shrl(reg, imm_shift);
2469 __ andl(temp, imm_mask);
2470 __ andl(reg, imm_mask);
2471 __ shll(temp, imm_shift);
2472 __ orl(reg, temp);
2473}
2474
2475void IntrinsicCodeGeneratorX86::VisitIntegerReverse(HInvoke* invoke) {
Aart Bika19616e2016-02-01 18:57:58 -08002476 X86Assembler* assembler = GetAssembler();
Mark Mendell58d25fd2015-04-03 14:52:31 -04002477 LocationSummary* locations = invoke->GetLocations();
2478
2479 Register reg = locations->InAt(0).AsRegister<Register>();
2480 Register temp = locations->GetTemp(0).AsRegister<Register>();
2481
2482 /*
2483 * Use one bswap instruction to reverse byte order first and then use 3 rounds of
2484 * swapping bits to reverse bits in a number x. Using bswap to save instructions
2485 * compared to generic luni implementation which has 5 rounds of swapping bits.
2486 * x = bswap x
2487 * x = (x & 0x55555555) << 1 | (x >> 1) & 0x55555555;
2488 * x = (x & 0x33333333) << 2 | (x >> 2) & 0x33333333;
2489 * x = (x & 0x0F0F0F0F) << 4 | (x >> 4) & 0x0F0F0F0F;
2490 */
2491 __ bswapl(reg);
2492 SwapBits(reg, temp, 1, 0x55555555, assembler);
2493 SwapBits(reg, temp, 2, 0x33333333, assembler);
2494 SwapBits(reg, temp, 4, 0x0f0f0f0f, assembler);
2495}
2496
2497void IntrinsicLocationsBuilderX86::VisitLongReverse(HInvoke* invoke) {
2498 LocationSummary* locations = new (arena_) LocationSummary(invoke,
2499 LocationSummary::kNoCall,
2500 kIntrinsified);
2501 locations->SetInAt(0, Location::RequiresRegister());
2502 locations->SetOut(Location::SameAsFirstInput());
2503 locations->AddTemp(Location::RequiresRegister());
2504}
2505
2506void IntrinsicCodeGeneratorX86::VisitLongReverse(HInvoke* invoke) {
Aart Bika19616e2016-02-01 18:57:58 -08002507 X86Assembler* assembler = GetAssembler();
Mark Mendell58d25fd2015-04-03 14:52:31 -04002508 LocationSummary* locations = invoke->GetLocations();
2509
2510 Register reg_low = locations->InAt(0).AsRegisterPairLow<Register>();
2511 Register reg_high = locations->InAt(0).AsRegisterPairHigh<Register>();
2512 Register temp = locations->GetTemp(0).AsRegister<Register>();
2513
2514 // We want to swap high/low, then bswap each one, and then do the same
2515 // as a 32 bit reverse.
2516 // Exchange high and low.
2517 __ movl(temp, reg_low);
2518 __ movl(reg_low, reg_high);
2519 __ movl(reg_high, temp);
2520
2521 // bit-reverse low
2522 __ bswapl(reg_low);
2523 SwapBits(reg_low, temp, 1, 0x55555555, assembler);
2524 SwapBits(reg_low, temp, 2, 0x33333333, assembler);
2525 SwapBits(reg_low, temp, 4, 0x0f0f0f0f, assembler);
2526
2527 // bit-reverse high
2528 __ bswapl(reg_high);
2529 SwapBits(reg_high, temp, 1, 0x55555555, assembler);
2530 SwapBits(reg_high, temp, 2, 0x33333333, assembler);
2531 SwapBits(reg_high, temp, 4, 0x0f0f0f0f, assembler);
2532}
2533
Aart Bikc39dac12016-01-21 08:59:48 -08002534static void CreateBitCountLocations(
2535 ArenaAllocator* arena, CodeGeneratorX86* codegen, HInvoke* invoke, bool is_long) {
2536 if (!codegen->GetInstructionSetFeatures().HasPopCnt()) {
2537 // Do nothing if there is no popcnt support. This results in generating
2538 // a call for the intrinsic rather than direct code.
2539 return;
2540 }
2541 LocationSummary* locations = new (arena) LocationSummary(invoke,
2542 LocationSummary::kNoCall,
2543 kIntrinsified);
2544 if (is_long) {
Aart Bikc39dac12016-01-21 08:59:48 -08002545 locations->AddTemp(Location::RequiresRegister());
Aart Bikc39dac12016-01-21 08:59:48 -08002546 }
Aart Bik2a946072016-01-21 12:49:00 -08002547 locations->SetInAt(0, Location::Any());
Aart Bikc39dac12016-01-21 08:59:48 -08002548 locations->SetOut(Location::RequiresRegister());
2549}
2550
Aart Bika19616e2016-02-01 18:57:58 -08002551static void GenBitCount(X86Assembler* assembler,
2552 CodeGeneratorX86* codegen,
2553 HInvoke* invoke, bool is_long) {
Aart Bikc39dac12016-01-21 08:59:48 -08002554 LocationSummary* locations = invoke->GetLocations();
2555 Location src = locations->InAt(0);
2556 Register out = locations->Out().AsRegister<Register>();
2557
2558 if (invoke->InputAt(0)->IsConstant()) {
2559 // Evaluate this at compile time.
2560 int64_t value = Int64FromConstant(invoke->InputAt(0)->AsConstant());
Roland Levillainfa3912e2016-04-01 18:21:55 +01002561 int32_t result = is_long
Aart Bikc39dac12016-01-21 08:59:48 -08002562 ? POPCOUNT(static_cast<uint64_t>(value))
2563 : POPCOUNT(static_cast<uint32_t>(value));
Roland Levillainfa3912e2016-04-01 18:21:55 +01002564 codegen->Load32BitValue(out, result);
Aart Bikc39dac12016-01-21 08:59:48 -08002565 return;
2566 }
2567
2568 // Handle the non-constant cases.
2569 if (!is_long) {
2570 if (src.IsRegister()) {
2571 __ popcntl(out, src.AsRegister<Register>());
2572 } else {
2573 DCHECK(src.IsStackSlot());
2574 __ popcntl(out, Address(ESP, src.GetStackIndex()));
2575 }
Aart Bik2a946072016-01-21 12:49:00 -08002576 } else {
2577 // The 64-bit case needs to worry about two parts.
2578 Register temp = locations->GetTemp(0).AsRegister<Register>();
2579 if (src.IsRegisterPair()) {
2580 __ popcntl(temp, src.AsRegisterPairLow<Register>());
2581 __ popcntl(out, src.AsRegisterPairHigh<Register>());
2582 } else {
2583 DCHECK(src.IsDoubleStackSlot());
2584 __ popcntl(temp, Address(ESP, src.GetStackIndex()));
2585 __ popcntl(out, Address(ESP, src.GetHighStackIndex(kX86WordSize)));
2586 }
2587 __ addl(out, temp);
Aart Bikc39dac12016-01-21 08:59:48 -08002588 }
Aart Bikc39dac12016-01-21 08:59:48 -08002589}
2590
2591void IntrinsicLocationsBuilderX86::VisitIntegerBitCount(HInvoke* invoke) {
2592 CreateBitCountLocations(arena_, codegen_, invoke, /* is_long */ false);
2593}
2594
2595void IntrinsicCodeGeneratorX86::VisitIntegerBitCount(HInvoke* invoke) {
Aart Bika19616e2016-02-01 18:57:58 -08002596 GenBitCount(GetAssembler(), codegen_, invoke, /* is_long */ false);
Aart Bikc39dac12016-01-21 08:59:48 -08002597}
2598
2599void IntrinsicLocationsBuilderX86::VisitLongBitCount(HInvoke* invoke) {
2600 CreateBitCountLocations(arena_, codegen_, invoke, /* is_long */ true);
2601}
2602
2603void IntrinsicCodeGeneratorX86::VisitLongBitCount(HInvoke* invoke) {
Aart Bika19616e2016-02-01 18:57:58 -08002604 GenBitCount(GetAssembler(), codegen_, invoke, /* is_long */ true);
Aart Bikc39dac12016-01-21 08:59:48 -08002605}
2606
Mark Mendelld5897672015-08-12 21:16:41 -04002607static void CreateLeadingZeroLocations(ArenaAllocator* arena, HInvoke* invoke, bool is_long) {
2608 LocationSummary* locations = new (arena) LocationSummary(invoke,
2609 LocationSummary::kNoCall,
2610 kIntrinsified);
2611 if (is_long) {
2612 locations->SetInAt(0, Location::RequiresRegister());
2613 } else {
2614 locations->SetInAt(0, Location::Any());
2615 }
2616 locations->SetOut(Location::RequiresRegister());
2617}
2618
Aart Bika19616e2016-02-01 18:57:58 -08002619static void GenLeadingZeros(X86Assembler* assembler,
2620 CodeGeneratorX86* codegen,
2621 HInvoke* invoke, bool is_long) {
Mark Mendelld5897672015-08-12 21:16:41 -04002622 LocationSummary* locations = invoke->GetLocations();
2623 Location src = locations->InAt(0);
2624 Register out = locations->Out().AsRegister<Register>();
2625
2626 if (invoke->InputAt(0)->IsConstant()) {
2627 // Evaluate this at compile time.
2628 int64_t value = Int64FromConstant(invoke->InputAt(0)->AsConstant());
2629 if (value == 0) {
2630 value = is_long ? 64 : 32;
2631 } else {
2632 value = is_long ? CLZ(static_cast<uint64_t>(value)) : CLZ(static_cast<uint32_t>(value));
2633 }
Aart Bika19616e2016-02-01 18:57:58 -08002634 codegen->Load32BitValue(out, value);
Mark Mendelld5897672015-08-12 21:16:41 -04002635 return;
2636 }
2637
2638 // Handle the non-constant cases.
2639 if (!is_long) {
2640 if (src.IsRegister()) {
2641 __ bsrl(out, src.AsRegister<Register>());
2642 } else {
2643 DCHECK(src.IsStackSlot());
2644 __ bsrl(out, Address(ESP, src.GetStackIndex()));
2645 }
2646
2647 // BSR sets ZF if the input was zero, and the output is undefined.
Mark Mendell0c9497d2015-08-21 09:30:05 -04002648 NearLabel all_zeroes, done;
Mark Mendelld5897672015-08-12 21:16:41 -04002649 __ j(kEqual, &all_zeroes);
2650
2651 // Correct the result from BSR to get the final CLZ result.
2652 __ xorl(out, Immediate(31));
2653 __ jmp(&done);
2654
2655 // Fix the zero case with the expected result.
2656 __ Bind(&all_zeroes);
2657 __ movl(out, Immediate(32));
2658
2659 __ Bind(&done);
2660 return;
2661 }
2662
2663 // 64 bit case needs to worry about both parts of the register.
2664 DCHECK(src.IsRegisterPair());
2665 Register src_lo = src.AsRegisterPairLow<Register>();
2666 Register src_hi = src.AsRegisterPairHigh<Register>();
Mark Mendell0c9497d2015-08-21 09:30:05 -04002667 NearLabel handle_low, done, all_zeroes;
Mark Mendelld5897672015-08-12 21:16:41 -04002668
2669 // Is the high word zero?
2670 __ testl(src_hi, src_hi);
2671 __ j(kEqual, &handle_low);
2672
2673 // High word is not zero. We know that the BSR result is defined in this case.
2674 __ bsrl(out, src_hi);
2675
2676 // Correct the result from BSR to get the final CLZ result.
2677 __ xorl(out, Immediate(31));
2678 __ jmp(&done);
2679
2680 // High word was zero. We have to compute the low word count and add 32.
2681 __ Bind(&handle_low);
2682 __ bsrl(out, src_lo);
2683 __ j(kEqual, &all_zeroes);
2684
2685 // We had a valid result. Use an XOR to both correct the result and add 32.
2686 __ xorl(out, Immediate(63));
2687 __ jmp(&done);
2688
2689 // All zero case.
2690 __ Bind(&all_zeroes);
2691 __ movl(out, Immediate(64));
2692
2693 __ Bind(&done);
2694}
2695
2696void IntrinsicLocationsBuilderX86::VisitIntegerNumberOfLeadingZeros(HInvoke* invoke) {
2697 CreateLeadingZeroLocations(arena_, invoke, /* is_long */ false);
2698}
2699
2700void IntrinsicCodeGeneratorX86::VisitIntegerNumberOfLeadingZeros(HInvoke* invoke) {
Aart Bika19616e2016-02-01 18:57:58 -08002701 GenLeadingZeros(GetAssembler(), codegen_, invoke, /* is_long */ false);
Mark Mendelld5897672015-08-12 21:16:41 -04002702}
2703
2704void IntrinsicLocationsBuilderX86::VisitLongNumberOfLeadingZeros(HInvoke* invoke) {
2705 CreateLeadingZeroLocations(arena_, invoke, /* is_long */ true);
2706}
2707
2708void IntrinsicCodeGeneratorX86::VisitLongNumberOfLeadingZeros(HInvoke* invoke) {
Aart Bika19616e2016-02-01 18:57:58 -08002709 GenLeadingZeros(GetAssembler(), codegen_, invoke, /* is_long */ true);
Mark Mendelld5897672015-08-12 21:16:41 -04002710}
2711
Mark Mendell2d554792015-09-15 21:45:18 -04002712static void CreateTrailingZeroLocations(ArenaAllocator* arena, HInvoke* invoke, bool is_long) {
2713 LocationSummary* locations = new (arena) LocationSummary(invoke,
2714 LocationSummary::kNoCall,
2715 kIntrinsified);
2716 if (is_long) {
2717 locations->SetInAt(0, Location::RequiresRegister());
2718 } else {
2719 locations->SetInAt(0, Location::Any());
2720 }
2721 locations->SetOut(Location::RequiresRegister());
2722}
2723
Aart Bika19616e2016-02-01 18:57:58 -08002724static void GenTrailingZeros(X86Assembler* assembler,
2725 CodeGeneratorX86* codegen,
2726 HInvoke* invoke, bool is_long) {
Mark Mendell2d554792015-09-15 21:45:18 -04002727 LocationSummary* locations = invoke->GetLocations();
2728 Location src = locations->InAt(0);
2729 Register out = locations->Out().AsRegister<Register>();
2730
2731 if (invoke->InputAt(0)->IsConstant()) {
2732 // Evaluate this at compile time.
2733 int64_t value = Int64FromConstant(invoke->InputAt(0)->AsConstant());
2734 if (value == 0) {
2735 value = is_long ? 64 : 32;
2736 } else {
2737 value = is_long ? CTZ(static_cast<uint64_t>(value)) : CTZ(static_cast<uint32_t>(value));
2738 }
Aart Bika19616e2016-02-01 18:57:58 -08002739 codegen->Load32BitValue(out, value);
Mark Mendell2d554792015-09-15 21:45:18 -04002740 return;
2741 }
2742
2743 // Handle the non-constant cases.
2744 if (!is_long) {
2745 if (src.IsRegister()) {
2746 __ bsfl(out, src.AsRegister<Register>());
2747 } else {
2748 DCHECK(src.IsStackSlot());
2749 __ bsfl(out, Address(ESP, src.GetStackIndex()));
2750 }
2751
2752 // BSF sets ZF if the input was zero, and the output is undefined.
2753 NearLabel done;
2754 __ j(kNotEqual, &done);
2755
2756 // Fix the zero case with the expected result.
2757 __ movl(out, Immediate(32));
2758
2759 __ Bind(&done);
2760 return;
2761 }
2762
2763 // 64 bit case needs to worry about both parts of the register.
2764 DCHECK(src.IsRegisterPair());
2765 Register src_lo = src.AsRegisterPairLow<Register>();
2766 Register src_hi = src.AsRegisterPairHigh<Register>();
2767 NearLabel done, all_zeroes;
2768
2769 // If the low word is zero, then ZF will be set. If not, we have the answer.
2770 __ bsfl(out, src_lo);
2771 __ j(kNotEqual, &done);
2772
2773 // Low word was zero. We have to compute the high word count and add 32.
2774 __ bsfl(out, src_hi);
2775 __ j(kEqual, &all_zeroes);
2776
2777 // We had a valid result. Add 32 to account for the low word being zero.
2778 __ addl(out, Immediate(32));
2779 __ jmp(&done);
2780
2781 // All zero case.
2782 __ Bind(&all_zeroes);
2783 __ movl(out, Immediate(64));
2784
2785 __ Bind(&done);
2786}
2787
2788void IntrinsicLocationsBuilderX86::VisitIntegerNumberOfTrailingZeros(HInvoke* invoke) {
2789 CreateTrailingZeroLocations(arena_, invoke, /* is_long */ false);
2790}
2791
2792void IntrinsicCodeGeneratorX86::VisitIntegerNumberOfTrailingZeros(HInvoke* invoke) {
Aart Bika19616e2016-02-01 18:57:58 -08002793 GenTrailingZeros(GetAssembler(), codegen_, invoke, /* is_long */ false);
Mark Mendell2d554792015-09-15 21:45:18 -04002794}
2795
2796void IntrinsicLocationsBuilderX86::VisitLongNumberOfTrailingZeros(HInvoke* invoke) {
2797 CreateTrailingZeroLocations(arena_, invoke, /* is_long */ true);
2798}
2799
2800void IntrinsicCodeGeneratorX86::VisitLongNumberOfTrailingZeros(HInvoke* invoke) {
Aart Bika19616e2016-02-01 18:57:58 -08002801 GenTrailingZeros(GetAssembler(), codegen_, invoke, /* is_long */ true);
Mark Mendell2d554792015-09-15 21:45:18 -04002802}
2803
Serguei Katkov288c7a82016-05-16 11:53:15 +06002804void IntrinsicLocationsBuilderX86::VisitReferenceGetReferent(HInvoke* invoke) {
2805 if (kEmitCompilerReadBarrier) {
2806 // Do not intrinsify this call with the read barrier configuration.
2807 return;
2808 }
2809 LocationSummary* locations = new (arena_) LocationSummary(invoke,
2810 LocationSummary::kCallOnSlowPath,
2811 kIntrinsified);
2812 locations->SetInAt(0, Location::RequiresRegister());
2813 locations->SetOut(Location::SameAsFirstInput());
2814 locations->AddTemp(Location::RequiresRegister());
2815}
2816
2817void IntrinsicCodeGeneratorX86::VisitReferenceGetReferent(HInvoke* invoke) {
2818 DCHECK(!kEmitCompilerReadBarrier);
2819 LocationSummary* locations = invoke->GetLocations();
2820 X86Assembler* assembler = GetAssembler();
2821
2822 Register obj = locations->InAt(0).AsRegister<Register>();
2823 Register out = locations->Out().AsRegister<Register>();
2824
2825 SlowPathCode* slow_path = new (GetAllocator()) IntrinsicSlowPathX86(invoke);
2826 codegen_->AddSlowPath(slow_path);
2827
2828 // Load ArtMethod first.
2829 HInvokeStaticOrDirect* invoke_direct = invoke->AsInvokeStaticOrDirect();
2830 DCHECK(invoke_direct != nullptr);
2831 Location temp_loc = codegen_->GenerateCalleeMethodStaticOrDirectCall(
2832 invoke_direct, locations->GetTemp(0));
2833 DCHECK(temp_loc.Equals(locations->GetTemp(0)));
2834 Register temp = temp_loc.AsRegister<Register>();
2835
2836 // Now get declaring class.
2837 __ movl(temp, Address(temp, ArtMethod::DeclaringClassOffset().Int32Value()));
2838
2839 uint32_t slow_path_flag_offset = codegen_->GetReferenceSlowFlagOffset();
2840 uint32_t disable_flag_offset = codegen_->GetReferenceDisableFlagOffset();
2841 DCHECK_NE(slow_path_flag_offset, 0u);
2842 DCHECK_NE(disable_flag_offset, 0u);
2843 DCHECK_NE(slow_path_flag_offset, disable_flag_offset);
2844
2845 // Check static flags preventing us for using intrinsic.
2846 if (slow_path_flag_offset == disable_flag_offset + 1) {
2847 __ cmpw(Address(temp, disable_flag_offset), Immediate(0));
2848 __ j(kNotEqual, slow_path->GetEntryLabel());
2849 } else {
2850 __ cmpb(Address(temp, disable_flag_offset), Immediate(0));
2851 __ j(kNotEqual, slow_path->GetEntryLabel());
2852 __ cmpb(Address(temp, slow_path_flag_offset), Immediate(0));
2853 __ j(kNotEqual, slow_path->GetEntryLabel());
2854 }
2855
2856 // Fast path.
2857 __ movl(out, Address(obj, mirror::Reference::ReferentOffset().Int32Value()));
2858 codegen_->MaybeRecordImplicitNullCheck(invoke);
2859 __ MaybeUnpoisonHeapReference(out);
2860 __ Bind(slow_path->GetExitLabel());
2861}
2862
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002863static bool IsSameInput(HInstruction* instruction, size_t input0, size_t input1) {
2864 return instruction->InputAt(input0) == instruction->InputAt(input1);
2865}
2866
2867void IntrinsicLocationsBuilderX86::VisitSystemArrayCopy(HInvoke* invoke) {
Roland Levillain0b671c02016-08-19 12:02:34 +01002868 // The only read barrier implementation supporting the
2869 // SystemArrayCopy intrinsic is the Baker-style read barriers.
2870 if (kEmitCompilerReadBarrier && !kUseBakerReadBarrier) {
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002871 return;
2872 }
2873
2874 CodeGenerator::CreateSystemArrayCopyLocationSummary(invoke);
2875 if (invoke->GetLocations() != nullptr) {
2876 // Need a byte register for marking.
2877 invoke->GetLocations()->SetTempAt(1, Location::RegisterLocation(ECX));
2878
2879 static constexpr size_t kSrc = 0;
2880 static constexpr size_t kSrcPos = 1;
2881 static constexpr size_t kDest = 2;
2882 static constexpr size_t kDestPos = 3;
2883 static constexpr size_t kLength = 4;
2884
2885 if (!invoke->InputAt(kSrcPos)->IsIntConstant() &&
2886 !invoke->InputAt(kDestPos)->IsIntConstant() &&
2887 !invoke->InputAt(kLength)->IsIntConstant()) {
2888 if (!IsSameInput(invoke, kSrcPos, kDestPos) &&
2889 !IsSameInput(invoke, kSrcPos, kLength) &&
2890 !IsSameInput(invoke, kDestPos, kLength) &&
2891 !IsSameInput(invoke, kSrc, kDest)) {
2892 // Not enough registers, make the length also take a stack slot.
2893 invoke->GetLocations()->SetInAt(kLength, Location::Any());
2894 }
2895 }
2896 }
2897}
2898
2899void IntrinsicCodeGeneratorX86::VisitSystemArrayCopy(HInvoke* invoke) {
Roland Levillain0b671c02016-08-19 12:02:34 +01002900 // The only read barrier implementation supporting the
2901 // SystemArrayCopy intrinsic is the Baker-style read barriers.
2902 DCHECK(!kEmitCompilerReadBarrier || kUseBakerReadBarrier);
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002903
2904 X86Assembler* assembler = GetAssembler();
2905 LocationSummary* locations = invoke->GetLocations();
2906
2907 uint32_t class_offset = mirror::Object::ClassOffset().Int32Value();
2908 uint32_t super_offset = mirror::Class::SuperClassOffset().Int32Value();
2909 uint32_t component_offset = mirror::Class::ComponentTypeOffset().Int32Value();
2910 uint32_t primitive_offset = mirror::Class::PrimitiveTypeOffset().Int32Value();
Roland Levillain0b671c02016-08-19 12:02:34 +01002911 uint32_t monitor_offset = mirror::Object::MonitorOffset().Int32Value();
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002912
2913 Register src = locations->InAt(0).AsRegister<Register>();
2914 Location src_pos = locations->InAt(1);
2915 Register dest = locations->InAt(2).AsRegister<Register>();
2916 Location dest_pos = locations->InAt(3);
Roland Levillain0b671c02016-08-19 12:02:34 +01002917 Location length_arg = locations->InAt(4);
2918 Location length = length_arg;
2919 Location temp1_loc = locations->GetTemp(0);
2920 Register temp1 = temp1_loc.AsRegister<Register>();
2921 Location temp2_loc = locations->GetTemp(1);
2922 Register temp2 = temp2_loc.AsRegister<Register>();
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002923
Roland Levillain0b671c02016-08-19 12:02:34 +01002924 SlowPathCode* intrinsic_slow_path = new (GetAllocator()) IntrinsicSlowPathX86(invoke);
2925 codegen_->AddSlowPath(intrinsic_slow_path);
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002926
2927 NearLabel conditions_on_positions_validated;
2928 SystemArrayCopyOptimizations optimizations(invoke);
2929
2930 // If source and destination are the same, we go to slow path if we need to do
2931 // forward copying.
2932 if (src_pos.IsConstant()) {
2933 int32_t src_pos_constant = src_pos.GetConstant()->AsIntConstant()->GetValue();
2934 if (dest_pos.IsConstant()) {
2935 int32_t dest_pos_constant = dest_pos.GetConstant()->AsIntConstant()->GetValue();
2936 if (optimizations.GetDestinationIsSource()) {
2937 // Checked when building locations.
2938 DCHECK_GE(src_pos_constant, dest_pos_constant);
2939 } else if (src_pos_constant < dest_pos_constant) {
2940 __ cmpl(src, dest);
Roland Levillain0b671c02016-08-19 12:02:34 +01002941 __ j(kEqual, intrinsic_slow_path->GetEntryLabel());
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002942 }
2943 } else {
2944 if (!optimizations.GetDestinationIsSource()) {
2945 __ cmpl(src, dest);
2946 __ j(kNotEqual, &conditions_on_positions_validated);
2947 }
2948 __ cmpl(dest_pos.AsRegister<Register>(), Immediate(src_pos_constant));
Roland Levillain0b671c02016-08-19 12:02:34 +01002949 __ j(kGreater, intrinsic_slow_path->GetEntryLabel());
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002950 }
2951 } else {
2952 if (!optimizations.GetDestinationIsSource()) {
2953 __ cmpl(src, dest);
2954 __ j(kNotEqual, &conditions_on_positions_validated);
2955 }
2956 if (dest_pos.IsConstant()) {
2957 int32_t dest_pos_constant = dest_pos.GetConstant()->AsIntConstant()->GetValue();
2958 __ cmpl(src_pos.AsRegister<Register>(), Immediate(dest_pos_constant));
Roland Levillain0b671c02016-08-19 12:02:34 +01002959 __ j(kLess, intrinsic_slow_path->GetEntryLabel());
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002960 } else {
2961 __ cmpl(src_pos.AsRegister<Register>(), dest_pos.AsRegister<Register>());
Roland Levillain0b671c02016-08-19 12:02:34 +01002962 __ j(kLess, intrinsic_slow_path->GetEntryLabel());
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002963 }
2964 }
2965
2966 __ Bind(&conditions_on_positions_validated);
2967
2968 if (!optimizations.GetSourceIsNotNull()) {
2969 // Bail out if the source is null.
2970 __ testl(src, src);
Roland Levillain0b671c02016-08-19 12:02:34 +01002971 __ j(kEqual, intrinsic_slow_path->GetEntryLabel());
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002972 }
2973
2974 if (!optimizations.GetDestinationIsNotNull() && !optimizations.GetDestinationIsSource()) {
2975 // Bail out if the destination is null.
2976 __ testl(dest, dest);
Roland Levillain0b671c02016-08-19 12:02:34 +01002977 __ j(kEqual, intrinsic_slow_path->GetEntryLabel());
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002978 }
2979
Roland Levillain0b671c02016-08-19 12:02:34 +01002980 Location temp3_loc = locations->GetTemp(2);
2981 Register temp3 = temp3_loc.AsRegister<Register>();
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002982 if (length.IsStackSlot()) {
2983 __ movl(temp3, Address(ESP, length.GetStackIndex()));
2984 length = Location::RegisterLocation(temp3);
2985 }
2986
2987 // If the length is negative, bail out.
2988 // We have already checked in the LocationsBuilder for the constant case.
2989 if (!length.IsConstant() &&
2990 !optimizations.GetCountIsSourceLength() &&
2991 !optimizations.GetCountIsDestinationLength()) {
2992 __ testl(length.AsRegister<Register>(), length.AsRegister<Register>());
Roland Levillain0b671c02016-08-19 12:02:34 +01002993 __ j(kLess, intrinsic_slow_path->GetEntryLabel());
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01002994 }
2995
2996 // Validity checks: source.
2997 CheckPosition(assembler,
2998 src_pos,
2999 src,
3000 length,
Roland Levillain0b671c02016-08-19 12:02:34 +01003001 intrinsic_slow_path,
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003002 temp1,
3003 optimizations.GetCountIsSourceLength());
3004
3005 // Validity checks: dest.
3006 CheckPosition(assembler,
3007 dest_pos,
3008 dest,
3009 length,
Roland Levillain0b671c02016-08-19 12:02:34 +01003010 intrinsic_slow_path,
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003011 temp1,
3012 optimizations.GetCountIsDestinationLength());
3013
3014 if (!optimizations.GetDoesNotNeedTypeCheck()) {
3015 // Check whether all elements of the source array are assignable to the component
3016 // type of the destination array. We do two checks: the classes are the same,
3017 // or the destination is Object[]. If none of these checks succeed, we go to the
3018 // slow path.
Roland Levillain0b671c02016-08-19 12:02:34 +01003019
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003020 if (!optimizations.GetSourceIsNonPrimitiveArray()) {
Roland Levillain0b671c02016-08-19 12:02:34 +01003021 if (kEmitCompilerReadBarrier && kUseBakerReadBarrier) {
3022 // /* HeapReference<Class> */ temp1 = src->klass_
3023 codegen_->GenerateFieldLoadWithBakerReadBarrier(
Vladimir Marko953437b2016-08-24 08:30:46 +00003024 invoke, temp1_loc, src, class_offset, /* needs_null_check */ false);
Roland Levillain0b671c02016-08-19 12:02:34 +01003025 // Bail out if the source is not a non primitive array.
3026 // /* HeapReference<Class> */ temp1 = temp1->component_type_
3027 codegen_->GenerateFieldLoadWithBakerReadBarrier(
Vladimir Marko953437b2016-08-24 08:30:46 +00003028 invoke, temp1_loc, temp1, component_offset, /* needs_null_check */ false);
Roland Levillain0b671c02016-08-19 12:02:34 +01003029 __ testl(temp1, temp1);
3030 __ j(kEqual, intrinsic_slow_path->GetEntryLabel());
3031 // If heap poisoning is enabled, `temp1` has been unpoisoned
3032 // by the the previous call to GenerateFieldLoadWithBakerReadBarrier.
3033 } else {
3034 // /* HeapReference<Class> */ temp1 = src->klass_
3035 __ movl(temp1, Address(src, class_offset));
3036 __ MaybeUnpoisonHeapReference(temp1);
3037 // Bail out if the source is not a non primitive array.
3038 // /* HeapReference<Class> */ temp1 = temp1->component_type_
3039 __ movl(temp1, Address(temp1, component_offset));
3040 __ testl(temp1, temp1);
3041 __ j(kEqual, intrinsic_slow_path->GetEntryLabel());
3042 __ MaybeUnpoisonHeapReference(temp1);
3043 }
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003044 __ cmpw(Address(temp1, primitive_offset), Immediate(Primitive::kPrimNot));
Roland Levillain0b671c02016-08-19 12:02:34 +01003045 __ j(kNotEqual, intrinsic_slow_path->GetEntryLabel());
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003046 }
3047
Roland Levillain0b671c02016-08-19 12:02:34 +01003048 if (kEmitCompilerReadBarrier && kUseBakerReadBarrier) {
3049 if (length.Equals(Location::RegisterLocation(temp3))) {
3050 // When Baker read barriers are enabled, register `temp3`,
3051 // which in the present case contains the `length` parameter,
3052 // will be overwritten below. Make the `length` location
3053 // reference the original stack location; it will be moved
3054 // back to `temp3` later if necessary.
3055 DCHECK(length_arg.IsStackSlot());
3056 length = length_arg;
3057 }
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003058
Roland Levillain0b671c02016-08-19 12:02:34 +01003059 // /* HeapReference<Class> */ temp1 = dest->klass_
3060 codegen_->GenerateFieldLoadWithBakerReadBarrier(
Vladimir Marko953437b2016-08-24 08:30:46 +00003061 invoke, temp1_loc, dest, class_offset, /* needs_null_check */ false);
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003062
Roland Levillain0b671c02016-08-19 12:02:34 +01003063 if (!optimizations.GetDestinationIsNonPrimitiveArray()) {
3064 // Bail out if the destination is not a non primitive array.
3065 //
3066 // Register `temp1` is not trashed by the read barrier emitted
3067 // by GenerateFieldLoadWithBakerReadBarrier below, as that
3068 // method produces a call to a ReadBarrierMarkRegX entry point,
3069 // which saves all potentially live registers, including
3070 // temporaries such a `temp1`.
3071 // /* HeapReference<Class> */ temp2 = temp1->component_type_
3072 codegen_->GenerateFieldLoadWithBakerReadBarrier(
Vladimir Marko953437b2016-08-24 08:30:46 +00003073 invoke, temp2_loc, temp1, component_offset, /* needs_null_check */ false);
Roland Levillain0b671c02016-08-19 12:02:34 +01003074 __ testl(temp2, temp2);
3075 __ j(kEqual, intrinsic_slow_path->GetEntryLabel());
3076 // If heap poisoning is enabled, `temp2` has been unpoisoned
3077 // by the the previous call to GenerateFieldLoadWithBakerReadBarrier.
3078 __ cmpw(Address(temp2, primitive_offset), Immediate(Primitive::kPrimNot));
3079 __ j(kNotEqual, intrinsic_slow_path->GetEntryLabel());
3080 }
3081
3082 // For the same reason given earlier, `temp1` is not trashed by the
3083 // read barrier emitted by GenerateFieldLoadWithBakerReadBarrier below.
3084 // /* HeapReference<Class> */ temp2 = src->klass_
3085 codegen_->GenerateFieldLoadWithBakerReadBarrier(
Vladimir Marko953437b2016-08-24 08:30:46 +00003086 invoke, temp2_loc, src, class_offset, /* needs_null_check */ false);
Roland Levillain0b671c02016-08-19 12:02:34 +01003087 // Note: if heap poisoning is on, we are comparing two unpoisoned references here.
3088 __ cmpl(temp1, temp2);
3089
3090 if (optimizations.GetDestinationIsTypedObjectArray()) {
3091 NearLabel do_copy;
3092 __ j(kEqual, &do_copy);
3093 // /* HeapReference<Class> */ temp1 = temp1->component_type_
3094 codegen_->GenerateFieldLoadWithBakerReadBarrier(
Vladimir Marko953437b2016-08-24 08:30:46 +00003095 invoke, temp1_loc, temp1, component_offset, /* needs_null_check */ false);
Roland Levillain0b671c02016-08-19 12:02:34 +01003096 // We do not need to emit a read barrier for the following
3097 // heap reference load, as `temp1` is only used in a
3098 // comparison with null below, and this reference is not
3099 // kept afterwards.
3100 __ cmpl(Address(temp1, super_offset), Immediate(0));
3101 __ j(kNotEqual, intrinsic_slow_path->GetEntryLabel());
3102 __ Bind(&do_copy);
3103 } else {
3104 __ j(kNotEqual, intrinsic_slow_path->GetEntryLabel());
3105 }
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003106 } else {
Roland Levillain0b671c02016-08-19 12:02:34 +01003107 // Non read barrier code.
3108
3109 // /* HeapReference<Class> */ temp1 = dest->klass_
3110 __ movl(temp1, Address(dest, class_offset));
3111 if (!optimizations.GetDestinationIsNonPrimitiveArray()) {
3112 __ MaybeUnpoisonHeapReference(temp1);
3113 // Bail out if the destination is not a non primitive array.
3114 // /* HeapReference<Class> */ temp2 = temp1->component_type_
3115 __ movl(temp2, Address(temp1, component_offset));
3116 __ testl(temp2, temp2);
3117 __ j(kEqual, intrinsic_slow_path->GetEntryLabel());
3118 __ MaybeUnpoisonHeapReference(temp2);
3119 __ cmpw(Address(temp2, primitive_offset), Immediate(Primitive::kPrimNot));
3120 __ j(kNotEqual, intrinsic_slow_path->GetEntryLabel());
3121 // Re-poison the heap reference to make the compare instruction below
3122 // compare two poisoned references.
3123 __ PoisonHeapReference(temp1);
3124 }
3125
3126 // Note: if heap poisoning is on, we are comparing two poisoned references here.
3127 __ cmpl(temp1, Address(src, class_offset));
3128
3129 if (optimizations.GetDestinationIsTypedObjectArray()) {
3130 NearLabel do_copy;
3131 __ j(kEqual, &do_copy);
3132 __ MaybeUnpoisonHeapReference(temp1);
3133 // /* HeapReference<Class> */ temp1 = temp1->component_type_
3134 __ movl(temp1, Address(temp1, component_offset));
3135 __ MaybeUnpoisonHeapReference(temp1);
3136 __ cmpl(Address(temp1, super_offset), Immediate(0));
3137 __ j(kNotEqual, intrinsic_slow_path->GetEntryLabel());
3138 __ Bind(&do_copy);
3139 } else {
3140 __ j(kNotEqual, intrinsic_slow_path->GetEntryLabel());
3141 }
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003142 }
3143 } else if (!optimizations.GetSourceIsNonPrimitiveArray()) {
3144 DCHECK(optimizations.GetDestinationIsNonPrimitiveArray());
3145 // Bail out if the source is not a non primitive array.
Roland Levillain0b671c02016-08-19 12:02:34 +01003146 if (kEmitCompilerReadBarrier && kUseBakerReadBarrier) {
3147 // /* HeapReference<Class> */ temp1 = src->klass_
3148 codegen_->GenerateFieldLoadWithBakerReadBarrier(
Vladimir Marko953437b2016-08-24 08:30:46 +00003149 invoke, temp1_loc, src, class_offset, /* needs_null_check */ false);
Roland Levillain0b671c02016-08-19 12:02:34 +01003150 // /* HeapReference<Class> */ temp1 = temp1->component_type_
3151 codegen_->GenerateFieldLoadWithBakerReadBarrier(
Vladimir Marko953437b2016-08-24 08:30:46 +00003152 invoke, temp1_loc, temp1, component_offset, /* needs_null_check */ false);
Roland Levillain0b671c02016-08-19 12:02:34 +01003153 __ testl(temp1, temp1);
3154 __ j(kEqual, intrinsic_slow_path->GetEntryLabel());
3155 // If heap poisoning is enabled, `temp1` has been unpoisoned
3156 // by the the previous call to GenerateFieldLoadWithBakerReadBarrier.
3157 } else {
3158 // /* HeapReference<Class> */ temp1 = src->klass_
3159 __ movl(temp1, Address(src, class_offset));
3160 __ MaybeUnpoisonHeapReference(temp1);
3161 // /* HeapReference<Class> */ temp1 = temp1->component_type_
3162 __ movl(temp1, Address(temp1, component_offset));
3163 __ testl(temp1, temp1);
3164 __ j(kEqual, intrinsic_slow_path->GetEntryLabel());
3165 __ MaybeUnpoisonHeapReference(temp1);
3166 }
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003167 __ cmpw(Address(temp1, primitive_offset), Immediate(Primitive::kPrimNot));
Roland Levillain0b671c02016-08-19 12:02:34 +01003168 __ j(kNotEqual, intrinsic_slow_path->GetEntryLabel());
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003169 }
3170
Roland Levillain0b671c02016-08-19 12:02:34 +01003171 // Compute the base source address in `temp1`.
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003172 int32_t element_size = Primitive::ComponentSize(Primitive::kPrimNot);
3173 DCHECK_EQ(element_size, 4);
3174 uint32_t offset = mirror::Array::DataOffset(element_size).Uint32Value();
3175 if (src_pos.IsConstant()) {
3176 int32_t constant = src_pos.GetConstant()->AsIntConstant()->GetValue();
3177 __ leal(temp1, Address(src, element_size * constant + offset));
3178 } else {
3179 __ leal(temp1, Address(src, src_pos.AsRegister<Register>(), ScaleFactor::TIMES_4, offset));
3180 }
3181
Roland Levillain0b671c02016-08-19 12:02:34 +01003182 if (kEmitCompilerReadBarrier && kUseBakerReadBarrier) {
3183 // If it is needed (in the case of the fast-path loop), the base
3184 // destination address is computed later, as `temp2` is used for
3185 // intermediate computations.
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003186
Roland Levillain0b671c02016-08-19 12:02:34 +01003187 // Compute the end source address in `temp3`.
3188 if (length.IsConstant()) {
3189 int32_t constant = length.GetConstant()->AsIntConstant()->GetValue();
3190 __ leal(temp3, Address(temp1, element_size * constant));
3191 } else {
3192 if (length.IsStackSlot()) {
3193 // Location `length` is again pointing at a stack slot, as
3194 // register `temp3` (which was containing the length parameter
3195 // earlier) has been overwritten; restore it now
3196 DCHECK(length.Equals(length_arg));
3197 __ movl(temp3, Address(ESP, length.GetStackIndex()));
3198 length = Location::RegisterLocation(temp3);
3199 }
3200 __ leal(temp3, Address(temp1, length.AsRegister<Register>(), ScaleFactor::TIMES_4, 0));
3201 }
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003202
Roland Levillain0b671c02016-08-19 12:02:34 +01003203 // SystemArrayCopy implementation for Baker read barriers (see
3204 // also CodeGeneratorX86::GenerateReferenceLoadWithBakerReadBarrier):
3205 //
3206 // if (src_ptr != end_ptr) {
3207 // uint32_t rb_state = Lockword(src->monitor_).ReadBarrierState();
3208 // lfence; // Load fence or artificial data dependency to prevent load-load reordering
Hiroshi Yamauchi12b58b22016-11-01 11:55:29 -07003209 // bool is_gray = (rb_state == ReadBarrier::GrayState());
Roland Levillain0b671c02016-08-19 12:02:34 +01003210 // if (is_gray) {
3211 // // Slow-path copy.
3212 // for (size_t i = 0; i != length; ++i) {
3213 // dest_array[dest_pos + i] =
3214 // MaybePoison(ReadBarrier::Mark(MaybeUnpoison(src_array[src_pos + i])));
3215 // }
3216 // } else {
3217 // // Fast-path copy.
3218 // do {
3219 // *dest_ptr++ = *src_ptr++;
3220 // } while (src_ptr != end_ptr)
3221 // }
3222 // }
3223
3224 NearLabel loop, done;
3225
3226 // Don't enter copy loop if `length == 0`.
3227 __ cmpl(temp1, temp3);
3228 __ j(kEqual, &done);
3229
Vladimir Marko953437b2016-08-24 08:30:46 +00003230 // Given the numeric representation, it's enough to check the low bit of the rb_state.
Hiroshi Yamauchi12b58b22016-11-01 11:55:29 -07003231 static_assert(ReadBarrier::WhiteState() == 0, "Expecting white to have value 0");
3232 static_assert(ReadBarrier::GrayState() == 1, "Expecting gray to have value 1");
Vladimir Marko953437b2016-08-24 08:30:46 +00003233 constexpr uint32_t gray_byte_position = LockWord::kReadBarrierStateShift / kBitsPerByte;
3234 constexpr uint32_t gray_bit_position = LockWord::kReadBarrierStateShift % kBitsPerByte;
3235 constexpr int32_t test_value = static_cast<int8_t>(1 << gray_bit_position);
3236
Hiroshi Yamauchi12b58b22016-11-01 11:55:29 -07003237 // if (rb_state == ReadBarrier::GrayState())
Vladimir Marko953437b2016-08-24 08:30:46 +00003238 // goto slow_path;
3239 // At this point, just do the "if" and make sure that flags are preserved until the branch.
3240 __ testb(Address(src, monitor_offset + gray_byte_position), Immediate(test_value));
Roland Levillain0b671c02016-08-19 12:02:34 +01003241
3242 // Load fence to prevent load-load reordering.
3243 // Note that this is a no-op, thanks to the x86 memory model.
3244 codegen_->GenerateMemoryBarrier(MemBarrierKind::kLoadAny);
3245
3246 // Slow path used to copy array when `src` is gray.
3247 SlowPathCode* read_barrier_slow_path =
3248 new (GetAllocator()) ReadBarrierSystemArrayCopySlowPathX86(invoke);
3249 codegen_->AddSlowPath(read_barrier_slow_path);
3250
Vladimir Marko953437b2016-08-24 08:30:46 +00003251 // We have done the "if" of the gray bit check above, now branch based on the flags.
3252 __ j(kNotZero, read_barrier_slow_path->GetEntryLabel());
Roland Levillain0b671c02016-08-19 12:02:34 +01003253
3254 // Fast-path copy.
3255
3256 // Set the base destination address in `temp2`.
3257 if (dest_pos.IsConstant()) {
3258 int32_t constant = dest_pos.GetConstant()->AsIntConstant()->GetValue();
3259 __ leal(temp2, Address(dest, element_size * constant + offset));
3260 } else {
3261 __ leal(temp2, Address(dest, dest_pos.AsRegister<Register>(), ScaleFactor::TIMES_4, offset));
3262 }
3263
3264 // Iterate over the arrays and do a raw copy of the objects. We don't need to
3265 // poison/unpoison.
3266 __ Bind(&loop);
3267 __ pushl(Address(temp1, 0));
3268 __ cfi().AdjustCFAOffset(4);
3269 __ popl(Address(temp2, 0));
3270 __ cfi().AdjustCFAOffset(-4);
3271 __ addl(temp1, Immediate(element_size));
3272 __ addl(temp2, Immediate(element_size));
3273 __ cmpl(temp1, temp3);
3274 __ j(kNotEqual, &loop);
3275
3276 __ Bind(read_barrier_slow_path->GetExitLabel());
3277 __ Bind(&done);
3278 } else {
3279 // Non read barrier code.
3280
3281 // Compute the base destination address in `temp2`.
3282 if (dest_pos.IsConstant()) {
3283 int32_t constant = dest_pos.GetConstant()->AsIntConstant()->GetValue();
3284 __ leal(temp2, Address(dest, element_size * constant + offset));
3285 } else {
3286 __ leal(temp2, Address(dest, dest_pos.AsRegister<Register>(), ScaleFactor::TIMES_4, offset));
3287 }
3288
3289 // Compute the end source address in `temp3`.
3290 if (length.IsConstant()) {
3291 int32_t constant = length.GetConstant()->AsIntConstant()->GetValue();
3292 __ leal(temp3, Address(temp1, element_size * constant));
3293 } else {
3294 __ leal(temp3, Address(temp1, length.AsRegister<Register>(), ScaleFactor::TIMES_4, 0));
3295 }
3296
3297 // Iterate over the arrays and do a raw copy of the objects. We don't need to
3298 // poison/unpoison.
3299 NearLabel loop, done;
3300 __ cmpl(temp1, temp3);
3301 __ j(kEqual, &done);
3302 __ Bind(&loop);
3303 __ pushl(Address(temp1, 0));
3304 __ cfi().AdjustCFAOffset(4);
3305 __ popl(Address(temp2, 0));
3306 __ cfi().AdjustCFAOffset(-4);
3307 __ addl(temp1, Immediate(element_size));
3308 __ addl(temp2, Immediate(element_size));
3309 __ cmpl(temp1, temp3);
3310 __ j(kNotEqual, &loop);
3311 __ Bind(&done);
3312 }
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003313
3314 // We only need one card marking on the destination array.
3315 codegen_->MarkGCCard(temp1,
3316 temp2,
3317 dest,
3318 Register(kNoRegister),
3319 /* value_can_be_null */ false);
3320
Roland Levillain0b671c02016-08-19 12:02:34 +01003321 __ Bind(intrinsic_slow_path->GetExitLabel());
Nicolas Geoffrayfea1abd2016-07-06 12:09:12 +01003322}
3323
Aart Bik2f9fcc92016-03-01 15:16:54 -08003324UNIMPLEMENTED_INTRINSIC(X86, MathRoundDouble)
Aart Bik2f9fcc92016-03-01 15:16:54 -08003325UNIMPLEMENTED_INTRINSIC(X86, FloatIsInfinite)
3326UNIMPLEMENTED_INTRINSIC(X86, DoubleIsInfinite)
3327UNIMPLEMENTED_INTRINSIC(X86, IntegerHighestOneBit)
3328UNIMPLEMENTED_INTRINSIC(X86, LongHighestOneBit)
3329UNIMPLEMENTED_INTRINSIC(X86, IntegerLowestOneBit)
3330UNIMPLEMENTED_INTRINSIC(X86, LongLowestOneBit)
Mark Mendell09ed1a32015-03-25 08:30:06 -04003331
Aart Bikff7d89c2016-11-07 08:49:28 -08003332UNIMPLEMENTED_INTRINSIC(X86, StringStringIndexOf);
3333UNIMPLEMENTED_INTRINSIC(X86, StringStringIndexOfAfter);
3334
Aart Bik0e54c012016-03-04 12:08:31 -08003335// 1.8.
3336UNIMPLEMENTED_INTRINSIC(X86, UnsafeGetAndAddInt)
3337UNIMPLEMENTED_INTRINSIC(X86, UnsafeGetAndAddLong)
3338UNIMPLEMENTED_INTRINSIC(X86, UnsafeGetAndSetInt)
3339UNIMPLEMENTED_INTRINSIC(X86, UnsafeGetAndSetLong)
3340UNIMPLEMENTED_INTRINSIC(X86, UnsafeGetAndSetObject)
Aart Bik0e54c012016-03-04 12:08:31 -08003341
Aart Bik2f9fcc92016-03-01 15:16:54 -08003342UNREACHABLE_INTRINSICS(X86)
Roland Levillain4d027112015-07-01 15:41:14 +01003343
3344#undef __
3345
Mark Mendell09ed1a32015-03-25 08:30:06 -04003346} // namespace x86
3347} // namespace art