Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 1 | /* |
| 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 Levillain | ec525fc | 2015-04-28 15:50:20 +0100 | [diff] [blame] | 20 | #include "code_generator.h" |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 21 | #include "nodes.h" |
| 22 | #include "optimization.h" |
Roland Levillain | ec525fc | 2015-04-28 15:50:20 +0100 | [diff] [blame] | 23 | #include "parallel_move_resolver.h" |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 24 | |
Vladimir Marko | 0a51605 | 2019-10-14 13:00:44 +0000 | [diff] [blame] | 25 | namespace art { |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 26 | |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 27 | class DexFile; |
| 28 | |
Anton Kirilov | a3ffea2 | 2016-04-07 17:02:37 +0100 | [diff] [blame] | 29 | // Positive floating-point infinities. |
| 30 | static constexpr uint32_t kPositiveInfinityFloat = 0x7f800000U; |
| 31 | static constexpr uint64_t kPositiveInfinityDouble = UINT64_C(0x7ff0000000000000); |
| 32 | |
xueliang.zhong | c032e74 | 2016-03-28 16:44:32 +0100 | [diff] [blame] | 33 | static constexpr uint32_t kNanFloat = 0x7fc00000U; |
| 34 | static constexpr uint64_t kNanDouble = 0x7ff8000000000000; |
| 35 | |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 36 | class IntrinsicVisitor : public ValueObject { |
| 37 | public: |
| 38 | virtual ~IntrinsicVisitor() {} |
| 39 | |
| 40 | // Dispatch logic. |
| 41 | |
| 42 | void Dispatch(HInvoke* invoke) { |
| 43 | switch (invoke->GetIntrinsic()) { |
| 44 | case Intrinsics::kNone: |
| 45 | return; |
Nicolas Geoffray | 762869d | 2016-07-15 15:28:35 +0100 | [diff] [blame] | 46 | #define OPTIMIZING_INTRINSICS(Name, ...) \ |
Aart Bik | 5d75afe | 2015-12-14 11:57:01 -0800 | [diff] [blame] | 47 | case Intrinsics::k ## Name: \ |
| 48 | Visit ## Name(invoke); \ |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 49 | return; |
| 50 | #include "intrinsics_list.h" |
Andreas Gampe | 8cf9cb3 | 2017-07-19 09:28:38 -0700 | [diff] [blame] | 51 | INTRINSICS_LIST(OPTIMIZING_INTRINSICS) |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 52 | #undef INTRINSICS_LIST |
| 53 | #undef OPTIMIZING_INTRINSICS |
| 54 | |
| 55 | // Do not put a default case. That way the compiler will complain if we missed a case. |
| 56 | } |
| 57 | } |
| 58 | |
| 59 | // Define visitor methods. |
| 60 | |
Nicolas Geoffray | 762869d | 2016-07-15 15:28:35 +0100 | [diff] [blame] | 61 | #define OPTIMIZING_INTRINSICS(Name, ...) \ |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 62 | virtual void Visit ## Name(HInvoke* invoke ATTRIBUTE_UNUSED) { \ |
| 63 | } |
| 64 | #include "intrinsics_list.h" |
Andreas Gampe | 8cf9cb3 | 2017-07-19 09:28:38 -0700 | [diff] [blame] | 65 | INTRINSICS_LIST(OPTIMIZING_INTRINSICS) |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 66 | #undef INTRINSICS_LIST |
| 67 | #undef OPTIMIZING_INTRINSICS |
| 68 | |
Roland Levillain | ec525fc | 2015-04-28 15:50:20 +0100 | [diff] [blame] | 69 | static void MoveArguments(HInvoke* invoke, |
| 70 | CodeGenerator* codegen, |
| 71 | InvokeDexCallingConventionVisitor* calling_convention_visitor) { |
| 72 | if (kIsDebugBuild && invoke->IsInvokeStaticOrDirect()) { |
| 73 | HInvokeStaticOrDirect* invoke_static_or_direct = invoke->AsInvokeStaticOrDirect(); |
David Brazdil | 58282f4 | 2016-01-14 12:45:10 +0000 | [diff] [blame] | 74 | // Explicit clinit checks triggered by static invokes must have been |
| 75 | // pruned by art::PrepareForRegisterAllocation. |
| 76 | DCHECK(!invoke_static_or_direct->IsStaticWithExplicitClinitCheck()); |
Roland Levillain | ec525fc | 2015-04-28 15:50:20 +0100 | [diff] [blame] | 77 | } |
| 78 | |
| 79 | if (invoke->GetNumberOfArguments() == 0) { |
| 80 | // No argument to move. |
| 81 | return; |
| 82 | } |
| 83 | |
| 84 | LocationSummary* locations = invoke->GetLocations(); |
| 85 | |
| 86 | // We're moving potentially two or more locations to locations that could overlap, so we need |
| 87 | // a parallel move resolver. |
Vladimir Marko | ca6fff8 | 2017-10-03 14:49:14 +0100 | [diff] [blame] | 88 | HParallelMove parallel_move(codegen->GetGraph()->GetAllocator()); |
Roland Levillain | ec525fc | 2015-04-28 15:50:20 +0100 | [diff] [blame] | 89 | |
| 90 | for (size_t i = 0; i < invoke->GetNumberOfArguments(); i++) { |
| 91 | HInstruction* input = invoke->InputAt(i); |
| 92 | Location cc_loc = calling_convention_visitor->GetNextLocation(input->GetType()); |
| 93 | Location actual_loc = locations->InAt(i); |
| 94 | |
| 95 | parallel_move.AddMove(actual_loc, cc_loc, input->GetType(), nullptr); |
| 96 | } |
| 97 | |
| 98 | codegen->GetMoveResolver()->EmitNativeCode(¶llel_move); |
| 99 | } |
| 100 | |
Nicolas Geoffray | 331605a | 2017-03-01 11:01:41 +0000 | [diff] [blame] | 101 | static void ComputeIntegerValueOfLocations(HInvoke* invoke, |
| 102 | CodeGenerator* codegen, |
| 103 | Location return_location, |
| 104 | Location first_argument_location); |
| 105 | |
Vladimir Marko | eebb821 | 2018-06-05 14:57:24 +0100 | [diff] [blame] | 106 | // Temporary data structure for holding Integer.valueOf data for generating code. |
| 107 | // We only use it if the boot image contains the IntegerCache objects. |
Nicolas Geoffray | 331605a | 2017-03-01 11:01:41 +0000 | [diff] [blame] | 108 | struct IntegerValueOfInfo { |
Vladimir Marko | 6fd1606 | 2018-06-26 11:02:04 +0100 | [diff] [blame] | 109 | static constexpr uint32_t kInvalidReference = static_cast<uint32_t>(-1); |
| 110 | |
Vladimir Marko | eebb821 | 2018-06-05 14:57:24 +0100 | [diff] [blame] | 111 | IntegerValueOfInfo(); |
Nicolas Geoffray | 331605a | 2017-03-01 11:01:41 +0000 | [diff] [blame] | 112 | |
Vladimir Marko | eebb821 | 2018-06-05 14:57:24 +0100 | [diff] [blame] | 113 | // Offset of the Integer.value field for initializing a newly allocated instance. |
| 114 | uint32_t value_offset; |
| 115 | // The low value in the cache. |
Nicolas Geoffray | 331605a | 2017-03-01 11:01:41 +0000 | [diff] [blame] | 116 | int32_t low; |
Vladimir Marko | eebb821 | 2018-06-05 14:57:24 +0100 | [diff] [blame] | 117 | // The length of the cache array. |
| 118 | uint32_t length; |
| 119 | |
Vladimir Marko | 6fd1606 | 2018-06-26 11:02:04 +0100 | [diff] [blame] | 120 | // This union contains references to the boot image. For app AOT or JIT compilation, |
| 121 | // these are the boot image offsets of the target. For boot image compilation, the |
| 122 | // location shall be known only at link time, so we encode a symbolic reference using |
| 123 | // IntrinsicObjects::EncodePatch(). |
| 124 | union { |
| 125 | // The target value for a constant input in the cache range. If the constant input |
| 126 | // is out of range (use `low` and `length` to check), this value is bogus (set to |
| 127 | // kInvalidReference) and the code must allocate a new Integer. |
| 128 | uint32_t value_boot_image_reference; |
| 129 | |
| 130 | // The cache array data used for a non-constant input in the cache range. |
Vladimir Marko | eebb821 | 2018-06-05 14:57:24 +0100 | [diff] [blame] | 131 | // If the input is out of range, the code must allocate a new Integer. |
Vladimir Marko | 6fd1606 | 2018-06-26 11:02:04 +0100 | [diff] [blame] | 132 | uint32_t array_data_boot_image_reference; |
Vladimir Marko | eebb821 | 2018-06-05 14:57:24 +0100 | [diff] [blame] | 133 | }; |
Nicolas Geoffray | 331605a | 2017-03-01 11:01:41 +0000 | [diff] [blame] | 134 | }; |
| 135 | |
Vladimir Marko | 6fd1606 | 2018-06-26 11:02:04 +0100 | [diff] [blame] | 136 | static IntegerValueOfInfo ComputeIntegerValueOfInfo( |
| 137 | HInvoke* invoke, const CompilerOptions& compiler_options); |
Nicolas Geoffray | 331605a | 2017-03-01 11:01:41 +0000 | [diff] [blame] | 138 | |
Vladimir Marko | 01b6552 | 2020-10-28 15:43:54 +0000 | [diff] [blame] | 139 | static MemberOffset GetReferenceDisableIntrinsicOffset(); |
| 140 | static MemberOffset GetReferenceSlowPathEnabledOffset(); |
| 141 | static void CreateReferenceGetReferentLocations(HInvoke* invoke, CodeGenerator* codegen); |
| 142 | |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 143 | protected: |
| 144 | IntrinsicVisitor() {} |
| 145 | |
Roland Levillain | 1d775d2 | 2018-09-07 13:56:57 +0100 | [diff] [blame] | 146 | static void AssertNonMovableStringClass(); |
| 147 | |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 148 | private: |
| 149 | DISALLOW_COPY_AND_ASSIGN(IntrinsicVisitor); |
| 150 | }; |
| 151 | |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 152 | #define GENERIC_OPTIMIZATION(name, bit) \ |
Nicolas Geoffray | 12be662 | 2015-10-07 11:52:21 +0100 | [diff] [blame] | 153 | public: \ |
| 154 | void Set##name() { SetBit(k##name); } \ |
| 155 | bool Get##name() const { return IsBitSet(k##name); } \ |
| 156 | private: \ |
Roland Levillain | ebea3d2 | 2016-04-12 15:42:57 +0100 | [diff] [blame] | 157 | static constexpr size_t k##name = bit |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 158 | |
| 159 | class IntrinsicOptimizations : public ValueObject { |
| 160 | public: |
Roland Levillain | ebea3d2 | 2016-04-12 15:42:57 +0100 | [diff] [blame] | 161 | explicit IntrinsicOptimizations(HInvoke* invoke) |
| 162 | : value_(invoke->GetIntrinsicOptimizations()) {} |
Nicolas Geoffray | 12be662 | 2015-10-07 11:52:21 +0100 | [diff] [blame] | 163 | explicit IntrinsicOptimizations(const HInvoke& invoke) |
| 164 | : value_(invoke.GetIntrinsicOptimizations()) {} |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 165 | |
Nicolas Geoffray | 8f2eb25 | 2020-11-06 13:39:54 +0000 | [diff] [blame] | 166 | static constexpr int kNumberOfGenericOptimizations = 1; |
| 167 | GENERIC_OPTIMIZATION(DoesNotNeedEnvironment, 0); |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 168 | |
| 169 | protected: |
| 170 | bool IsBitSet(uint32_t bit) const { |
Roland Levillain | ebea3d2 | 2016-04-12 15:42:57 +0100 | [diff] [blame] | 171 | DCHECK_LT(bit, sizeof(uint32_t) * kBitsPerByte); |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 172 | return (*value_ & (1 << bit)) != 0u; |
| 173 | } |
| 174 | |
| 175 | void SetBit(uint32_t bit) { |
Roland Levillain | ebea3d2 | 2016-04-12 15:42:57 +0100 | [diff] [blame] | 176 | DCHECK_LT(bit, sizeof(uint32_t) * kBitsPerByte); |
| 177 | *(const_cast<uint32_t* const>(value_)) |= (1 << bit); |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 178 | } |
| 179 | |
| 180 | private: |
Roland Levillain | ebea3d2 | 2016-04-12 15:42:57 +0100 | [diff] [blame] | 181 | const uint32_t* const value_; |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 182 | |
| 183 | DISALLOW_COPY_AND_ASSIGN(IntrinsicOptimizations); |
| 184 | }; |
| 185 | |
| 186 | #undef GENERIC_OPTIMIZATION |
| 187 | |
| 188 | #define INTRINSIC_OPTIMIZATION(name, bit) \ |
Nicolas Geoffray | 12be662 | 2015-10-07 11:52:21 +0100 | [diff] [blame] | 189 | public: \ |
| 190 | void Set##name() { SetBit(k##name); } \ |
| 191 | bool Get##name() const { return IsBitSet(k##name); } \ |
| 192 | private: \ |
Chih-Hung Hsieh | fba3997 | 2016-05-11 11:26:48 -0700 | [diff] [blame] | 193 | static constexpr size_t k##name = (bit) + kNumberOfGenericOptimizations |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 194 | |
| 195 | class StringEqualsOptimizations : public IntrinsicOptimizations { |
| 196 | public: |
Nicolas Geoffray | 12be662 | 2015-10-07 11:52:21 +0100 | [diff] [blame] | 197 | explicit StringEqualsOptimizations(HInvoke* invoke) : IntrinsicOptimizations(invoke) {} |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 198 | |
| 199 | INTRINSIC_OPTIMIZATION(ArgumentNotNull, 0); |
| 200 | INTRINSIC_OPTIMIZATION(ArgumentIsString, 1); |
| 201 | |
| 202 | private: |
| 203 | DISALLOW_COPY_AND_ASSIGN(StringEqualsOptimizations); |
| 204 | }; |
| 205 | |
Nicolas Geoffray | ee3cf07 | 2015-10-06 11:45:02 +0100 | [diff] [blame] | 206 | class SystemArrayCopyOptimizations : public IntrinsicOptimizations { |
| 207 | public: |
| 208 | explicit SystemArrayCopyOptimizations(HInvoke* invoke) : IntrinsicOptimizations(invoke) {} |
| 209 | |
| 210 | INTRINSIC_OPTIMIZATION(SourceIsNotNull, 0); |
| 211 | INTRINSIC_OPTIMIZATION(DestinationIsNotNull, 1); |
| 212 | INTRINSIC_OPTIMIZATION(DestinationIsSource, 2); |
| 213 | INTRINSIC_OPTIMIZATION(CountIsSourceLength, 3); |
| 214 | INTRINSIC_OPTIMIZATION(CountIsDestinationLength, 4); |
| 215 | INTRINSIC_OPTIMIZATION(DoesNotNeedTypeCheck, 5); |
| 216 | INTRINSIC_OPTIMIZATION(DestinationIsTypedObjectArray, 6); |
| 217 | INTRINSIC_OPTIMIZATION(DestinationIsNonPrimitiveArray, 7); |
| 218 | INTRINSIC_OPTIMIZATION(DestinationIsPrimitiveArray, 8); |
| 219 | INTRINSIC_OPTIMIZATION(SourceIsNonPrimitiveArray, 9); |
| 220 | INTRINSIC_OPTIMIZATION(SourceIsPrimitiveArray, 10); |
| 221 | |
| 222 | private: |
| 223 | DISALLOW_COPY_AND_ASSIGN(SystemArrayCopyOptimizations); |
| 224 | }; |
| 225 | |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 226 | #undef INTRISIC_OPTIMIZATION |
| 227 | |
Aart Bik | 2f9fcc9 | 2016-03-01 15:16:54 -0800 | [diff] [blame] | 228 | // |
| 229 | // Macros for use in the intrinsics code generators. |
| 230 | // |
| 231 | |
| 232 | // Defines an unimplemented intrinsic: that is, a method call that is recognized as an |
| 233 | // intrinsic to exploit e.g. no side-effects or exceptions, but otherwise not handled |
| 234 | // by this architecture-specific intrinsics code generator. Eventually it is implemented |
| 235 | // as a true method call. |
| 236 | #define UNIMPLEMENTED_INTRINSIC(Arch, Name) \ |
| 237 | void IntrinsicLocationsBuilder ## Arch::Visit ## Name(HInvoke* invoke ATTRIBUTE_UNUSED) { \ |
| 238 | } \ |
| 239 | void IntrinsicCodeGenerator ## Arch::Visit ## Name(HInvoke* invoke ATTRIBUTE_UNUSED) { \ |
| 240 | } |
| 241 | |
| 242 | // Defines a list of unreached intrinsics: that is, method calls that are recognized as |
| 243 | // an intrinsic, and then always converted into HIR instructions before they reach any |
Nicolas Geoffray | acc56ac | 2018-10-09 08:45:24 +0100 | [diff] [blame] | 244 | // architecture-specific intrinsics code generator. This only applies to non-baseline |
| 245 | // compilation. |
Aart Bik | 2f9fcc9 | 2016-03-01 15:16:54 -0800 | [diff] [blame] | 246 | #define UNREACHABLE_INTRINSIC(Arch, Name) \ |
| 247 | void IntrinsicLocationsBuilder ## Arch::Visit ## Name(HInvoke* invoke) { \ |
Nicolas Geoffray | 075456e | 2018-12-14 08:54:21 +0000 | [diff] [blame] | 248 | if (Runtime::Current()->IsAotCompiler() && \ |
| 249 | !codegen_->GetCompilerOptions().IsBaseline()) { \ |
Nicolas Geoffray | acc56ac | 2018-10-09 08:45:24 +0100 | [diff] [blame] | 250 | LOG(FATAL) << "Unreachable: intrinsic " << invoke->GetIntrinsic() \ |
| 251 | << " should have been converted to HIR"; \ |
| 252 | } \ |
Aart Bik | 2f9fcc9 | 2016-03-01 15:16:54 -0800 | [diff] [blame] | 253 | } \ |
| 254 | void IntrinsicCodeGenerator ## Arch::Visit ## Name(HInvoke* invoke) { \ |
| 255 | LOG(FATAL) << "Unreachable: intrinsic " << invoke->GetIntrinsic() \ |
| 256 | << " should have been converted to HIR"; \ |
| 257 | } |
Orion Hodson | 43f0cdb | 2017-10-10 14:47:32 +0100 | [diff] [blame] | 258 | #define UNREACHABLE_INTRINSICS(Arch) \ |
Aart Bik | 1f8d51b | 2018-02-15 10:42:37 -0800 | [diff] [blame] | 259 | UNREACHABLE_INTRINSIC(Arch, MathMinIntInt) \ |
| 260 | UNREACHABLE_INTRINSIC(Arch, MathMinLongLong) \ |
| 261 | UNREACHABLE_INTRINSIC(Arch, MathMinFloatFloat) \ |
| 262 | UNREACHABLE_INTRINSIC(Arch, MathMinDoubleDouble) \ |
| 263 | UNREACHABLE_INTRINSIC(Arch, MathMaxIntInt) \ |
| 264 | UNREACHABLE_INTRINSIC(Arch, MathMaxLongLong) \ |
| 265 | UNREACHABLE_INTRINSIC(Arch, MathMaxFloatFloat) \ |
| 266 | UNREACHABLE_INTRINSIC(Arch, MathMaxDoubleDouble) \ |
Aart Bik | 3dad341 | 2018-02-28 12:01:46 -0800 | [diff] [blame] | 267 | UNREACHABLE_INTRINSIC(Arch, MathAbsInt) \ |
| 268 | UNREACHABLE_INTRINSIC(Arch, MathAbsLong) \ |
| 269 | UNREACHABLE_INTRINSIC(Arch, MathAbsFloat) \ |
| 270 | UNREACHABLE_INTRINSIC(Arch, MathAbsDouble) \ |
Orion Hodson | 43f0cdb | 2017-10-10 14:47:32 +0100 | [diff] [blame] | 271 | UNREACHABLE_INTRINSIC(Arch, FloatFloatToIntBits) \ |
| 272 | UNREACHABLE_INTRINSIC(Arch, DoubleDoubleToLongBits) \ |
| 273 | UNREACHABLE_INTRINSIC(Arch, FloatIsNaN) \ |
| 274 | UNREACHABLE_INTRINSIC(Arch, DoubleIsNaN) \ |
| 275 | UNREACHABLE_INTRINSIC(Arch, IntegerRotateLeft) \ |
| 276 | UNREACHABLE_INTRINSIC(Arch, LongRotateLeft) \ |
| 277 | UNREACHABLE_INTRINSIC(Arch, IntegerRotateRight) \ |
| 278 | UNREACHABLE_INTRINSIC(Arch, LongRotateRight) \ |
| 279 | UNREACHABLE_INTRINSIC(Arch, IntegerCompare) \ |
| 280 | UNREACHABLE_INTRINSIC(Arch, LongCompare) \ |
| 281 | UNREACHABLE_INTRINSIC(Arch, IntegerSignum) \ |
| 282 | UNREACHABLE_INTRINSIC(Arch, LongSignum) \ |
| 283 | UNREACHABLE_INTRINSIC(Arch, StringCharAt) \ |
| 284 | UNREACHABLE_INTRINSIC(Arch, StringIsEmpty) \ |
| 285 | UNREACHABLE_INTRINSIC(Arch, StringLength) \ |
| 286 | UNREACHABLE_INTRINSIC(Arch, UnsafeLoadFence) \ |
| 287 | UNREACHABLE_INTRINSIC(Arch, UnsafeStoreFence) \ |
Vladimir Marko | eff9b01 | 2020-11-06 14:22:08 +0000 | [diff] [blame] | 288 | UNREACHABLE_INTRINSIC(Arch, UnsafeFullFence) \ |
| 289 | UNREACHABLE_INTRINSIC(Arch, VarHandleFullFence) \ |
| 290 | UNREACHABLE_INTRINSIC(Arch, VarHandleAcquireFence) \ |
| 291 | UNREACHABLE_INTRINSIC(Arch, VarHandleReleaseFence) \ |
| 292 | UNREACHABLE_INTRINSIC(Arch, VarHandleLoadLoadFence) \ |
| 293 | UNREACHABLE_INTRINSIC(Arch, VarHandleStoreStoreFence) |
Aart Bik | 2f9fcc9 | 2016-03-01 15:16:54 -0800 | [diff] [blame] | 294 | |
Vladimir Marko | 68c981f | 2016-08-26 13:13:33 +0100 | [diff] [blame] | 295 | template <typename IntrinsicLocationsBuilder, typename Codegenerator> |
| 296 | bool IsCallFreeIntrinsic(HInvoke* invoke, Codegenerator* codegen) { |
| 297 | if (invoke->GetIntrinsic() != Intrinsics::kNone) { |
| 298 | // This invoke may have intrinsic code generation defined. However, we must |
| 299 | // now also determine if this code generation is truly there and call-free |
| 300 | // (not unimplemented, no bail on instruction features, or call on slow path). |
| 301 | // This is done by actually calling the locations builder on the instruction |
| 302 | // and clearing out the locations once result is known. We assume this |
| 303 | // call only has creating locations as side effects! |
| 304 | // TODO: Avoid wasting Arena memory. |
| 305 | IntrinsicLocationsBuilder builder(codegen); |
| 306 | bool success = builder.TryDispatch(invoke) && !invoke->GetLocations()->CanCall(); |
| 307 | invoke->SetLocations(nullptr); |
| 308 | return success; |
| 309 | } |
| 310 | return false; |
| 311 | } |
| 312 | |
Andreas Gampe | 71fb52f | 2014-12-29 17:43:08 -0800 | [diff] [blame] | 313 | } // namespace art |
| 314 | |
| 315 | #endif // ART_COMPILER_OPTIMIZING_INTRINSICS_H_ |