blob: 863dd1c6f6276b20a388a14601ed2087147e39b2 [file] [log] [blame]
Andreas Gampe71fb52f2014-12-29 17:43:08 -08001/*
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#ifndef ART_COMPILER_OPTIMIZING_INTRINSICS_H_
18#define ART_COMPILER_OPTIMIZING_INTRINSICS_H_
19
Roland Levillainec525fc2015-04-28 15:50:20 +010020#include "code_generator.h"
Andreas Gampe71fb52f2014-12-29 17:43:08 -080021#include "nodes.h"
22#include "optimization.h"
Roland Levillainec525fc2015-04-28 15:50:20 +010023#include "parallel_move_resolver.h"
Andreas Gampe71fb52f2014-12-29 17:43:08 -080024
25namespace art {
26
27class CompilerDriver;
28class DexFile;
29
Andreas Gampee6d0d8d2015-12-28 09:54:29 -080030// Temporary measure until we have caught up with the Java 7 definition of Math.round. b/26327751
31static constexpr bool kRoundIsPlusPointFive = false;
32
Andreas Gampe71fb52f2014-12-29 17:43:08 -080033// Recognize intrinsics from HInvoke nodes.
34class IntrinsicsRecognizer : public HOptimization {
35 public:
Jean-Philippe Halimi38e9e802016-02-18 16:42:03 +010036 IntrinsicsRecognizer(HGraph* graph, CompilerDriver* driver, OptimizingCompilerStats* stats)
37 : HOptimization(graph, kIntrinsicsRecognizerPassName, stats),
Nicolas Geoffrayd5111bf2015-05-22 15:37:09 +010038 driver_(driver) {}
Andreas Gampe71fb52f2014-12-29 17:43:08 -080039
40 void Run() OVERRIDE;
41
Andreas Gampe7c3952f2015-02-19 18:21:24 -080042 static constexpr const char* kIntrinsicsRecognizerPassName = "intrinsics_recognition";
43
Andreas Gampe71fb52f2014-12-29 17:43:08 -080044 private:
Andreas Gampe71fb52f2014-12-29 17:43:08 -080045 CompilerDriver* driver_;
46
47 DISALLOW_COPY_AND_ASSIGN(IntrinsicsRecognizer);
48};
49
50class IntrinsicVisitor : public ValueObject {
51 public:
52 virtual ~IntrinsicVisitor() {}
53
54 // Dispatch logic.
55
56 void Dispatch(HInvoke* invoke) {
57 switch (invoke->GetIntrinsic()) {
58 case Intrinsics::kNone:
59 return;
Aart Bik5d75afe2015-12-14 11:57:01 -080060#define OPTIMIZING_INTRINSICS(Name, IsStatic, NeedsEnvironment, SideEffects, Exceptions) \
61 case Intrinsics::k ## Name: \
62 Visit ## Name(invoke); \
Andreas Gampe71fb52f2014-12-29 17:43:08 -080063 return;
64#include "intrinsics_list.h"
65INTRINSICS_LIST(OPTIMIZING_INTRINSICS)
66#undef INTRINSICS_LIST
67#undef OPTIMIZING_INTRINSICS
68
69 // Do not put a default case. That way the compiler will complain if we missed a case.
70 }
71 }
72
73 // Define visitor methods.
74
Aart Bik5d75afe2015-12-14 11:57:01 -080075#define OPTIMIZING_INTRINSICS(Name, IsStatic, NeedsEnvironment, SideEffects, Exceptions) \
Andreas Gampe71fb52f2014-12-29 17:43:08 -080076 virtual void Visit ## Name(HInvoke* invoke ATTRIBUTE_UNUSED) { \
77 }
78#include "intrinsics_list.h"
79INTRINSICS_LIST(OPTIMIZING_INTRINSICS)
80#undef INTRINSICS_LIST
81#undef OPTIMIZING_INTRINSICS
82
Roland Levillainec525fc2015-04-28 15:50:20 +010083 static void MoveArguments(HInvoke* invoke,
84 CodeGenerator* codegen,
85 InvokeDexCallingConventionVisitor* calling_convention_visitor) {
86 if (kIsDebugBuild && invoke->IsInvokeStaticOrDirect()) {
87 HInvokeStaticOrDirect* invoke_static_or_direct = invoke->AsInvokeStaticOrDirect();
David Brazdil58282f42016-01-14 12:45:10 +000088 // Explicit clinit checks triggered by static invokes must have been
89 // pruned by art::PrepareForRegisterAllocation.
90 DCHECK(!invoke_static_or_direct->IsStaticWithExplicitClinitCheck());
Roland Levillainec525fc2015-04-28 15:50:20 +010091 }
92
93 if (invoke->GetNumberOfArguments() == 0) {
94 // No argument to move.
95 return;
96 }
97
98 LocationSummary* locations = invoke->GetLocations();
99
100 // We're moving potentially two or more locations to locations that could overlap, so we need
101 // a parallel move resolver.
102 HParallelMove parallel_move(codegen->GetGraph()->GetArena());
103
104 for (size_t i = 0; i < invoke->GetNumberOfArguments(); i++) {
105 HInstruction* input = invoke->InputAt(i);
106 Location cc_loc = calling_convention_visitor->GetNextLocation(input->GetType());
107 Location actual_loc = locations->InAt(i);
108
109 parallel_move.AddMove(actual_loc, cc_loc, input->GetType(), nullptr);
110 }
111
112 codegen->GetMoveResolver()->EmitNativeCode(&parallel_move);
113 }
114
Andreas Gampe71fb52f2014-12-29 17:43:08 -0800115 protected:
116 IntrinsicVisitor() {}
117
118 private:
119 DISALLOW_COPY_AND_ASSIGN(IntrinsicVisitor);
120};
121
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +0100122#define GENERIC_OPTIMIZATION(name, bit) \
Nicolas Geoffray12be6622015-10-07 11:52:21 +0100123public: \
124void Set##name() { SetBit(k##name); } \
125bool Get##name() const { return IsBitSet(k##name); } \
126private: \
Roland Levillainebea3d22016-04-12 15:42:57 +0100127static constexpr size_t k##name = bit
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +0100128
129class IntrinsicOptimizations : public ValueObject {
130 public:
Roland Levillainebea3d22016-04-12 15:42:57 +0100131 explicit IntrinsicOptimizations(HInvoke* invoke)
132 : value_(invoke->GetIntrinsicOptimizations()) {}
Nicolas Geoffray12be6622015-10-07 11:52:21 +0100133 explicit IntrinsicOptimizations(const HInvoke& invoke)
134 : value_(invoke.GetIntrinsicOptimizations()) {}
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +0100135
136 static constexpr int kNumberOfGenericOptimizations = 2;
137 GENERIC_OPTIMIZATION(DoesNotNeedDexCache, 0);
138 GENERIC_OPTIMIZATION(DoesNotNeedEnvironment, 1);
139
140 protected:
141 bool IsBitSet(uint32_t bit) const {
Roland Levillainebea3d22016-04-12 15:42:57 +0100142 DCHECK_LT(bit, sizeof(uint32_t) * kBitsPerByte);
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +0100143 return (*value_ & (1 << bit)) != 0u;
144 }
145
146 void SetBit(uint32_t bit) {
Roland Levillainebea3d22016-04-12 15:42:57 +0100147 DCHECK_LT(bit, sizeof(uint32_t) * kBitsPerByte);
148 *(const_cast<uint32_t* const>(value_)) |= (1 << bit);
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +0100149 }
150
151 private:
Roland Levillainebea3d22016-04-12 15:42:57 +0100152 const uint32_t* const value_;
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +0100153
154 DISALLOW_COPY_AND_ASSIGN(IntrinsicOptimizations);
155};
156
157#undef GENERIC_OPTIMIZATION
158
159#define INTRINSIC_OPTIMIZATION(name, bit) \
Nicolas Geoffray12be6622015-10-07 11:52:21 +0100160public: \
161void Set##name() { SetBit(k##name); } \
162bool Get##name() const { return IsBitSet(k##name); } \
163private: \
Roland Levillainebea3d22016-04-12 15:42:57 +0100164static constexpr size_t k##name = bit + kNumberOfGenericOptimizations
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +0100165
166class StringEqualsOptimizations : public IntrinsicOptimizations {
167 public:
Nicolas Geoffray12be6622015-10-07 11:52:21 +0100168 explicit StringEqualsOptimizations(HInvoke* invoke) : IntrinsicOptimizations(invoke) {}
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +0100169
170 INTRINSIC_OPTIMIZATION(ArgumentNotNull, 0);
171 INTRINSIC_OPTIMIZATION(ArgumentIsString, 1);
172
173 private:
174 DISALLOW_COPY_AND_ASSIGN(StringEqualsOptimizations);
175};
176
Nicolas Geoffrayee3cf072015-10-06 11:45:02 +0100177class SystemArrayCopyOptimizations : public IntrinsicOptimizations {
178 public:
179 explicit SystemArrayCopyOptimizations(HInvoke* invoke) : IntrinsicOptimizations(invoke) {}
180
181 INTRINSIC_OPTIMIZATION(SourceIsNotNull, 0);
182 INTRINSIC_OPTIMIZATION(DestinationIsNotNull, 1);
183 INTRINSIC_OPTIMIZATION(DestinationIsSource, 2);
184 INTRINSIC_OPTIMIZATION(CountIsSourceLength, 3);
185 INTRINSIC_OPTIMIZATION(CountIsDestinationLength, 4);
186 INTRINSIC_OPTIMIZATION(DoesNotNeedTypeCheck, 5);
187 INTRINSIC_OPTIMIZATION(DestinationIsTypedObjectArray, 6);
188 INTRINSIC_OPTIMIZATION(DestinationIsNonPrimitiveArray, 7);
189 INTRINSIC_OPTIMIZATION(DestinationIsPrimitiveArray, 8);
190 INTRINSIC_OPTIMIZATION(SourceIsNonPrimitiveArray, 9);
191 INTRINSIC_OPTIMIZATION(SourceIsPrimitiveArray, 10);
192
193 private:
194 DISALLOW_COPY_AND_ASSIGN(SystemArrayCopyOptimizations);
195};
196
Nicolas Geoffraya83a54d2015-10-02 17:30:26 +0100197#undef INTRISIC_OPTIMIZATION
198
Aart Bik2f9fcc92016-03-01 15:16:54 -0800199//
200// Macros for use in the intrinsics code generators.
201//
202
203// Defines an unimplemented intrinsic: that is, a method call that is recognized as an
204// intrinsic to exploit e.g. no side-effects or exceptions, but otherwise not handled
205// by this architecture-specific intrinsics code generator. Eventually it is implemented
206// as a true method call.
207#define UNIMPLEMENTED_INTRINSIC(Arch, Name) \
208void IntrinsicLocationsBuilder ## Arch::Visit ## Name(HInvoke* invoke ATTRIBUTE_UNUSED) { \
209} \
210void IntrinsicCodeGenerator ## Arch::Visit ## Name(HInvoke* invoke ATTRIBUTE_UNUSED) { \
211}
212
213// Defines a list of unreached intrinsics: that is, method calls that are recognized as
214// an intrinsic, and then always converted into HIR instructions before they reach any
215// architecture-specific intrinsics code generator.
216#define UNREACHABLE_INTRINSIC(Arch, Name) \
217void IntrinsicLocationsBuilder ## Arch::Visit ## Name(HInvoke* invoke) { \
218 LOG(FATAL) << "Unreachable: intrinsic " << invoke->GetIntrinsic() \
219 << " should have been converted to HIR"; \
220} \
221void IntrinsicCodeGenerator ## Arch::Visit ## Name(HInvoke* invoke) { \
222 LOG(FATAL) << "Unreachable: intrinsic " << invoke->GetIntrinsic() \
223 << " should have been converted to HIR"; \
224}
225#define UNREACHABLE_INTRINSICS(Arch) \
226UNREACHABLE_INTRINSIC(Arch, FloatFloatToIntBits) \
227UNREACHABLE_INTRINSIC(Arch, DoubleDoubleToLongBits) \
228UNREACHABLE_INTRINSIC(Arch, FloatIsNaN) \
229UNREACHABLE_INTRINSIC(Arch, DoubleIsNaN) \
230UNREACHABLE_INTRINSIC(Arch, IntegerRotateLeft) \
231UNREACHABLE_INTRINSIC(Arch, LongRotateLeft) \
232UNREACHABLE_INTRINSIC(Arch, IntegerRotateRight) \
233UNREACHABLE_INTRINSIC(Arch, LongRotateRight) \
234UNREACHABLE_INTRINSIC(Arch, IntegerCompare) \
235UNREACHABLE_INTRINSIC(Arch, LongCompare) \
236UNREACHABLE_INTRINSIC(Arch, IntegerSignum) \
Aart Bik11932592016-03-08 12:42:25 -0800237UNREACHABLE_INTRINSIC(Arch, LongSignum) \
238UNREACHABLE_INTRINSIC(Arch, UnsafeLoadFence) \
239UNREACHABLE_INTRINSIC(Arch, UnsafeStoreFence) \
240UNREACHABLE_INTRINSIC(Arch, UnsafeFullFence)
Aart Bik2f9fcc92016-03-01 15:16:54 -0800241
Andreas Gampe71fb52f2014-12-29 17:43:08 -0800242} // namespace art
243
244#endif // ART_COMPILER_OPTIMIZING_INTRINSICS_H_