< prev index next >

src/hotspot/share/opto/library_call.hpp

Print this page

 14  *
 15  * You should have received a copy of the GNU General Public License version
 16  * 2 along with this work; if not, write to the Free Software Foundation,
 17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 18  *
 19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 20  * or visit www.oracle.com if you need additional information or have any
 21  * questions.
 22  *
 23  */
 24 
 25 #ifndef SHARE_OPTO_LIBRARY_CALL_HPP
 26 #define SHARE_OPTO_LIBRARY_CALL_HPP
 27 
 28 #include "ci/ciMethod.hpp"
 29 #include "classfile/javaClasses.hpp"
 30 #include "opto/callGenerator.hpp"
 31 #include "opto/castnode.hpp"
 32 #include "opto/convertnode.hpp"
 33 #include "opto/graphKit.hpp"

 34 #include "opto/intrinsicnode.hpp"
 35 #include "opto/movenode.hpp"
 36 
 37 class LibraryIntrinsic : public InlineCallGenerator {
 38   // Extend the set of intrinsics known to the runtime:
 39  public:
 40  private:
 41   bool             _is_virtual;
 42   bool             _does_virtual_dispatch;
 43   int8_t           _predicates_count;  // Intrinsic is predicated by several conditions
 44   int8_t           _last_predicate; // Last generated predicate
 45   vmIntrinsics::ID _intrinsic_id;
 46 
 47  public:
 48   LibraryIntrinsic(ciMethod* m, bool is_virtual, int predicates_count, bool does_virtual_dispatch, vmIntrinsics::ID id)
 49     : InlineCallGenerator(m),
 50       _is_virtual(is_virtual),
 51       _does_virtual_dispatch(does_virtual_dispatch),
 52       _predicates_count((int8_t)predicates_count),
 53       _last_predicate((int8_t)-1),

 91       ciSignature* declared_signature = nullptr;
 92       ciMethod* ignored_callee = caller()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
 93       const int nargs = declared_signature->arg_size_for_bc(caller()->java_code_at_bci(bci()));
 94       _reexecute_sp = sp() + nargs;  // "push" arguments back on stack
 95     }
 96   }
 97 
 98   virtual LibraryCallKit* is_LibraryCallKit() const { return (LibraryCallKit*)this; }
 99 
100   ciMethod*         caller()    const    { return jvms()->method(); }
101   int               bci()       const    { return jvms()->bci(); }
102   LibraryIntrinsic* intrinsic() const    { return _intrinsic; }
103   vmIntrinsics::ID  intrinsic_id() const { return _intrinsic->intrinsic_id(); }
104   ciMethod*         callee()    const    { return _intrinsic->method(); }
105 
106   bool  try_to_inline(int predicate);
107   Node* try_to_predicate(int predicate);
108 
109   void push_result() {
110     // Push the result onto the stack.
111     if (!stopped() && result() != nullptr) {
112       if (result()->is_top()) {

113         assert(false, "Can't determine return value.");
114         C->record_method_not_compilable("Can't determine return value.");
115       }
116       BasicType bt = result()->bottom_type()->basic_type();
117       push_node(bt, result());







118     }
119   }
120 
121  private:
122   void fatal_unexpected_iid(vmIntrinsics::ID iid) {
123     fatal("unexpected intrinsic %d: %s", vmIntrinsics::as_int(iid), vmIntrinsics::name_at(iid));
124   }
125 
126   void  set_result(Node* n) { assert(_result == nullptr, "only set once"); _result = n; }
127   void  set_result(RegionNode* region, PhiNode* value);
128   Node*     result() { return _result; }
129 
130   virtual int reexecute_sp() { return _reexecute_sp; }
131 
132   /* When an intrinsic makes changes before bailing out, it's necessary to restore the graph
133    * as it was. See JDK-8359344 for what can happen wrong. It's also not always possible to
134    * bailout before making changes because the bailing out decision might depend on new nodes
135    * (their types, for instance).
136    *
137    * So, if an intrinsic might cause this situation, one must start by saving the state in a

152     void discard();
153   };
154 
155   // Helper functions to inline natives
156   Node* generate_guard(Node* test, RegionNode* region, float true_prob);
157   Node* generate_slow_guard(Node* test, RegionNode* region);
158   Node* generate_fair_guard(Node* test, RegionNode* region);
159   Node* generate_negative_guard(Node* index, RegionNode* region,
160                                 // resulting CastII of index:
161                                 Node* *pos_index = nullptr);
162   Node* generate_limit_guard(Node* offset, Node* subseq_length,
163                              Node* array_length,
164                              RegionNode* region);
165   void  generate_string_range_check(Node* array, Node* offset,
166                                     Node* length, bool char_count,
167                                     bool halt_on_oob = false);
168   Node* current_thread_helper(Node* &tls_output, ByteSize handle_offset,
169                               bool is_immutable);
170   Node* generate_current_thread(Node* &tls_output);
171   Node* generate_virtual_thread(Node* threadObj);
172   Node* load_mirror_from_klass(Node* klass);
173   Node* load_klass_from_mirror_common(Node* mirror, bool never_see_null,
174                                       RegionNode* region, int null_path,
175                                       int offset);
176   Node* load_klass_from_mirror(Node* mirror, bool never_see_null,
177                                RegionNode* region, int null_path) {
178     int offset = java_lang_Class::klass_offset();
179     return load_klass_from_mirror_common(mirror, never_see_null,
180                                          region, null_path,
181                                          offset);
182   }
183   Node* load_array_klass_from_mirror(Node* mirror, bool never_see_null,
184                                      RegionNode* region, int null_path) {
185     int offset = java_lang_Class::array_klass_offset();
186     return load_klass_from_mirror_common(mirror, never_see_null,
187                                          region, null_path,
188                                          offset);
189   }


190   Node* generate_klass_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region,
191                                    ByteSize offset, const Type* type, BasicType bt);
192   Node* generate_misc_flags_guard(Node* kls,
193                                   int modifier_mask, int modifier_bits,
194                                   RegionNode* region);
195   Node* generate_interface_guard(Node* kls, RegionNode* region);









196   Node* generate_hidden_class_guard(Node* kls, RegionNode* region);

197   Node* generate_array_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
198     return generate_array_guard_common(kls, region, false, false, obj);
199   }
200   Node* generate_non_array_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
201     return generate_array_guard_common(kls, region, false, true, obj);



202   }
203   Node* generate_objArray_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
204     return generate_array_guard_common(kls, region, true, false, obj);
205   }
206   Node* generate_non_objArray_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
207     return generate_array_guard_common(kls, region, true, true, obj);
208   }
209   Node* generate_array_guard_common(Node* kls, RegionNode* region,
210                                     bool obj_array, bool not_array, Node** obj = nullptr);
211   Node* generate_virtual_guard(Node* obj_klass, RegionNode* slow_region);
212   CallJavaNode* generate_method_call(vmIntrinsicID method_id, bool is_virtual, bool is_static, bool res_not_null);
213   CallJavaNode* generate_method_call_static(vmIntrinsicID method_id, bool res_not_null) {
214     return generate_method_call(method_id, false, true, res_not_null);
215   }
216   Node* load_field_from_object(Node* fromObj, const char* fieldName, const char* fieldTypeString, DecoratorSet decorators = IN_HEAP, bool is_static = false, ciInstanceKlass* fromKls = nullptr);
217   Node* field_address_from_object(Node* fromObj, const char* fieldName, const char* fieldTypeString, bool is_exact = true, bool is_static = false, ciInstanceKlass* fromKls = nullptr);
218 
219   Node* make_string_method_node(int opcode, Node* str1_start, Node* cnt1, Node* str2_start, Node* cnt2, StrIntrinsicNode::ArgEnc ae);
220   bool inline_string_compareTo(StrIntrinsicNode::ArgEnc ae);
221   bool inline_string_indexOf(StrIntrinsicNode::ArgEnc ae);
222   bool inline_string_indexOfI(StrIntrinsicNode::ArgEnc ae);
223   Node* make_indexOf_node(Node* src_start, Node* src_count, Node* tgt_start, Node* tgt_count,
224                           RegionNode* region, Node* phi, StrIntrinsicNode::ArgEnc ae);
225   bool inline_string_indexOfChar(StrIntrinsicNode::ArgEnc ae);
226   bool inline_string_equals(StrIntrinsicNode::ArgEnc ae);
227   bool inline_vectorizedHashCode();
228   bool inline_string_toBytesU();
229   bool inline_string_getCharsU();
230   bool inline_string_copy(bool compress);

238   bool inline_math_overflow(Node* arg1, Node* arg2);
239   bool inline_math_mathExact(Node* math, Node* test);
240   bool inline_math_addExactI(bool is_increment);
241   bool inline_math_addExactL(bool is_increment);
242   bool inline_math_multiplyExactI();
243   bool inline_math_multiplyExactL();
244   bool inline_math_multiplyHigh();
245   bool inline_math_unsignedMultiplyHigh();
246   bool inline_math_negateExactI();
247   bool inline_math_negateExactL();
248   bool inline_math_subtractExactI(bool is_decrement);
249   bool inline_math_subtractExactL(bool is_decrement);
250   bool inline_min_max(vmIntrinsics::ID id);
251   bool inline_notify(vmIntrinsics::ID id);
252   // This returns Type::AnyPtr, RawPtr, or OopPtr.
253   int classify_unsafe_addr(Node* &base, Node* &offset, BasicType type);
254   Node* make_unsafe_address(Node*& base, Node* offset, BasicType type = T_ILLEGAL, bool can_cast = false);
255 
256   typedef enum { Relaxed, Opaque, Volatile, Acquire, Release } AccessKind;
257   DecoratorSet mo_decorator_for_access_kind(AccessKind kind);
258   bool inline_unsafe_access(bool is_store, BasicType type, AccessKind kind, bool is_unaligned);

259   static bool klass_needs_init_guard(Node* kls);
260   bool inline_unsafe_allocate();
261   bool inline_unsafe_newArray(bool uninitialized);

262   bool inline_unsafe_writeback0();
263   bool inline_unsafe_writebackSync0(bool is_pre);
264   bool inline_unsafe_copyMemory();


265   bool inline_unsafe_setMemory();
266 
267   bool inline_native_currentCarrierThread();
268   bool inline_native_currentThread();
269   bool inline_native_setCurrentThread();
270 
271   bool inline_native_scopedValueCache();
272   const Type* scopedValueCache_type();
273   Node* scopedValueCache_helper();
274   bool inline_native_setScopedValueCache();
275   bool inline_native_Continuation_pinning(bool unpin);
276 
277   bool inline_native_time_funcs(address method, const char* funcName);
278 #if INCLUDE_JVMTI
279   bool inline_native_notify_jvmti_funcs(address funcAddr, const char* funcName, bool is_start, bool is_end);
280   bool inline_native_notify_jvmti_hide();
281   bool inline_native_notify_jvmti_sync();
282 #endif
283 
284 #ifdef JFR_HAVE_INTRINSICS
285   bool inline_native_classID();
286   bool inline_native_getEventWriter();
287   bool inline_native_jvm_commit();
288   void extend_setCurrentThread(Node* jt, Node* thread);
289 #endif
290   bool inline_native_Class_query(vmIntrinsics::ID id);

291   bool inline_native_subtype_check();
292   bool inline_native_getLength();
293   bool inline_array_copyOf(bool is_copyOfRange);
294   bool inline_array_equals(StrIntrinsicNode::ArgEnc ae);
295   bool inline_preconditions_checkIndex(BasicType bt);
296   void copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array);
297   bool inline_native_clone(bool is_virtual);
298   bool inline_native_Reflection_getCallerClass();
299   // Helper function for inlining native object hash method
300   bool inline_native_hashcode(bool is_virtual, bool is_static);
301   bool inline_native_getClass();
302 
303   // Helper functions for inlining arraycopy
304   bool inline_arraycopy();
305   AllocateArrayNode* tightly_coupled_allocation(Node* ptr);
306   static CallStaticJavaNode* get_uncommon_trap_from_success_proj(Node* node);
307   SafePointNode* create_safepoint_with_state_before_array_allocation(const AllocateArrayNode* alloc) const;
308   void replace_unrelated_uncommon_traps_with_alloc_state(AllocateArrayNode* alloc, JVMState* saved_jvms_before_guards);
309   void replace_unrelated_uncommon_traps_with_alloc_state(JVMState* saved_jvms_before_guards);
310   void create_new_uncommon_trap(CallStaticJavaNode* uncommon_trap_call);

 14  *
 15  * You should have received a copy of the GNU General Public License version
 16  * 2 along with this work; if not, write to the Free Software Foundation,
 17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 18  *
 19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 20  * or visit www.oracle.com if you need additional information or have any
 21  * questions.
 22  *
 23  */
 24 
 25 #ifndef SHARE_OPTO_LIBRARY_CALL_HPP
 26 #define SHARE_OPTO_LIBRARY_CALL_HPP
 27 
 28 #include "ci/ciMethod.hpp"
 29 #include "classfile/javaClasses.hpp"
 30 #include "opto/callGenerator.hpp"
 31 #include "opto/castnode.hpp"
 32 #include "opto/convertnode.hpp"
 33 #include "opto/graphKit.hpp"
 34 #include "opto/inlinetypenode.hpp"
 35 #include "opto/intrinsicnode.hpp"
 36 #include "opto/movenode.hpp"
 37 
 38 class LibraryIntrinsic : public InlineCallGenerator {
 39   // Extend the set of intrinsics known to the runtime:
 40  public:
 41  private:
 42   bool             _is_virtual;
 43   bool             _does_virtual_dispatch;
 44   int8_t           _predicates_count;  // Intrinsic is predicated by several conditions
 45   int8_t           _last_predicate; // Last generated predicate
 46   vmIntrinsics::ID _intrinsic_id;
 47 
 48  public:
 49   LibraryIntrinsic(ciMethod* m, bool is_virtual, int predicates_count, bool does_virtual_dispatch, vmIntrinsics::ID id)
 50     : InlineCallGenerator(m),
 51       _is_virtual(is_virtual),
 52       _does_virtual_dispatch(does_virtual_dispatch),
 53       _predicates_count((int8_t)predicates_count),
 54       _last_predicate((int8_t)-1),

 92       ciSignature* declared_signature = nullptr;
 93       ciMethod* ignored_callee = caller()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
 94       const int nargs = declared_signature->arg_size_for_bc(caller()->java_code_at_bci(bci()));
 95       _reexecute_sp = sp() + nargs;  // "push" arguments back on stack
 96     }
 97   }
 98 
 99   virtual LibraryCallKit* is_LibraryCallKit() const { return (LibraryCallKit*)this; }
100 
101   ciMethod*         caller()    const    { return jvms()->method(); }
102   int               bci()       const    { return jvms()->bci(); }
103   LibraryIntrinsic* intrinsic() const    { return _intrinsic; }
104   vmIntrinsics::ID  intrinsic_id() const { return _intrinsic->intrinsic_id(); }
105   ciMethod*         callee()    const    { return _intrinsic->method(); }
106 
107   bool  try_to_inline(int predicate);
108   Node* try_to_predicate(int predicate);
109 
110   void push_result() {
111     // Push the result onto the stack.
112     Node* res = result();
113     if (!stopped() && res != nullptr) {
114       if (res->is_top()) {
115         assert(false, "Can't determine return value.");
116         C->record_method_not_compilable("Can't determine return value.");
117       }
118       BasicType bt = res->bottom_type()->basic_type();
119       if (C->inlining_incrementally() && res->is_InlineType()) {
120         // The caller expects an oop when incrementally inlining an intrinsic that returns an
121         // inline type. Make sure the call is re-executed if the allocation triggers a deoptimization.
122         PreserveReexecuteState preexecs(this);
123         jvms()->set_should_reexecute(true);
124         res = res->as_InlineType()->buffer(this);
125       }
126       push_node(bt, res);
127     }
128   }
129 
130  private:
131   void fatal_unexpected_iid(vmIntrinsics::ID iid) {
132     fatal("unexpected intrinsic %d: %s", vmIntrinsics::as_int(iid), vmIntrinsics::name_at(iid));
133   }
134 
135   void  set_result(Node* n) { assert(_result == nullptr, "only set once"); _result = n; }
136   void  set_result(RegionNode* region, PhiNode* value);
137   Node*     result() { return _result; }
138 
139   virtual int reexecute_sp() { return _reexecute_sp; }
140 
141   /* When an intrinsic makes changes before bailing out, it's necessary to restore the graph
142    * as it was. See JDK-8359344 for what can happen wrong. It's also not always possible to
143    * bailout before making changes because the bailing out decision might depend on new nodes
144    * (their types, for instance).
145    *
146    * So, if an intrinsic might cause this situation, one must start by saving the state in a

161     void discard();
162   };
163 
164   // Helper functions to inline natives
165   Node* generate_guard(Node* test, RegionNode* region, float true_prob);
166   Node* generate_slow_guard(Node* test, RegionNode* region);
167   Node* generate_fair_guard(Node* test, RegionNode* region);
168   Node* generate_negative_guard(Node* index, RegionNode* region,
169                                 // resulting CastII of index:
170                                 Node* *pos_index = nullptr);
171   Node* generate_limit_guard(Node* offset, Node* subseq_length,
172                              Node* array_length,
173                              RegionNode* region);
174   void  generate_string_range_check(Node* array, Node* offset,
175                                     Node* length, bool char_count,
176                                     bool halt_on_oob = false);
177   Node* current_thread_helper(Node* &tls_output, ByteSize handle_offset,
178                               bool is_immutable);
179   Node* generate_current_thread(Node* &tls_output);
180   Node* generate_virtual_thread(Node* threadObj);

181   Node* load_klass_from_mirror_common(Node* mirror, bool never_see_null,
182                                       RegionNode* region, int null_path,
183                                       int offset);
184   Node* load_klass_from_mirror(Node* mirror, bool never_see_null,
185                                RegionNode* region, int null_path) {
186     int offset = java_lang_Class::klass_offset();
187     return load_klass_from_mirror_common(mirror, never_see_null,
188                                          region, null_path,
189                                          offset);
190   }
191   Node* load_array_klass_from_mirror(Node* mirror, bool never_see_null,
192                                      RegionNode* region, int null_path) {
193     int offset = java_lang_Class::array_klass_offset();
194     return load_klass_from_mirror_common(mirror, never_see_null,
195                                          region, null_path,
196                                          offset);
197   }
198   Node* load_default_array_klass(Node* klass_node);
199 
200   Node* generate_klass_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region,
201                                    ByteSize offset, const Type* type, BasicType bt);
202   Node* generate_misc_flags_guard(Node* kls,
203                                   int modifier_mask, int modifier_bits,
204                                   RegionNode* region);
205   Node* generate_interface_guard(Node* kls, RegionNode* region);
206 
207   enum ArrayKind {
208     AnyArray,
209     NonArray,
210     RefArray,
211     NonRefArray,
212     TypeArray
213   };
214 
215   Node* generate_hidden_class_guard(Node* kls, RegionNode* region);
216 
217   Node* generate_array_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
218     return generate_array_guard_common(kls, region, AnyArray, obj);
219   }
220   Node* generate_non_array_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
221     return generate_array_guard_common(kls, region, NonArray, obj);
222   }
223   Node* generate_refArray_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
224     return generate_array_guard_common(kls, region, RefArray, obj);
225   }
226   Node* generate_non_refArray_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
227     return generate_array_guard_common(kls, region, NonRefArray, obj);
228   }
229   Node* generate_typeArray_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
230     return generate_array_guard_common(kls, region, TypeArray, obj);
231   }
232   Node* generate_array_guard_common(Node* kls, RegionNode* region, ArrayKind kind, Node** obj = nullptr);

233   Node* generate_virtual_guard(Node* obj_klass, RegionNode* slow_region);
234   CallJavaNode* generate_method_call(vmIntrinsicID method_id, bool is_virtual, bool is_static, bool res_not_null);
235   CallJavaNode* generate_method_call_static(vmIntrinsicID method_id, bool res_not_null) {
236     return generate_method_call(method_id, false, true, res_not_null);
237   }
238   Node* load_field_from_object(Node* fromObj, const char* fieldName, const char* fieldTypeString, DecoratorSet decorators = IN_HEAP, bool is_static = false, ciInstanceKlass* fromKls = nullptr);
239   Node* field_address_from_object(Node* fromObj, const char* fieldName, const char* fieldTypeString, bool is_exact = true, bool is_static = false, ciInstanceKlass* fromKls = nullptr);
240 
241   Node* make_string_method_node(int opcode, Node* str1_start, Node* cnt1, Node* str2_start, Node* cnt2, StrIntrinsicNode::ArgEnc ae);
242   bool inline_string_compareTo(StrIntrinsicNode::ArgEnc ae);
243   bool inline_string_indexOf(StrIntrinsicNode::ArgEnc ae);
244   bool inline_string_indexOfI(StrIntrinsicNode::ArgEnc ae);
245   Node* make_indexOf_node(Node* src_start, Node* src_count, Node* tgt_start, Node* tgt_count,
246                           RegionNode* region, Node* phi, StrIntrinsicNode::ArgEnc ae);
247   bool inline_string_indexOfChar(StrIntrinsicNode::ArgEnc ae);
248   bool inline_string_equals(StrIntrinsicNode::ArgEnc ae);
249   bool inline_vectorizedHashCode();
250   bool inline_string_toBytesU();
251   bool inline_string_getCharsU();
252   bool inline_string_copy(bool compress);

260   bool inline_math_overflow(Node* arg1, Node* arg2);
261   bool inline_math_mathExact(Node* math, Node* test);
262   bool inline_math_addExactI(bool is_increment);
263   bool inline_math_addExactL(bool is_increment);
264   bool inline_math_multiplyExactI();
265   bool inline_math_multiplyExactL();
266   bool inline_math_multiplyHigh();
267   bool inline_math_unsignedMultiplyHigh();
268   bool inline_math_negateExactI();
269   bool inline_math_negateExactL();
270   bool inline_math_subtractExactI(bool is_decrement);
271   bool inline_math_subtractExactL(bool is_decrement);
272   bool inline_min_max(vmIntrinsics::ID id);
273   bool inline_notify(vmIntrinsics::ID id);
274   // This returns Type::AnyPtr, RawPtr, or OopPtr.
275   int classify_unsafe_addr(Node* &base, Node* &offset, BasicType type);
276   Node* make_unsafe_address(Node*& base, Node* offset, BasicType type = T_ILLEGAL, bool can_cast = false);
277 
278   typedef enum { Relaxed, Opaque, Volatile, Acquire, Release } AccessKind;
279   DecoratorSet mo_decorator_for_access_kind(AccessKind kind);
280   bool inline_unsafe_access(bool is_store, BasicType type, AccessKind kind, bool is_unaligned, bool is_flat = false);
281   bool inline_unsafe_flat_access(bool is_store, AccessKind kind);
282   static bool klass_needs_init_guard(Node* kls);
283   bool inline_unsafe_allocate();
284   bool inline_unsafe_newArray(bool uninitialized);
285   bool inline_newArray(bool null_free, bool atomic);
286   bool inline_unsafe_writeback0();
287   bool inline_unsafe_writebackSync0(bool is_pre);
288   bool inline_unsafe_copyMemory();
289   bool inline_unsafe_make_private_buffer();
290   bool inline_unsafe_finish_private_buffer();
291   bool inline_unsafe_setMemory();
292 
293   bool inline_native_currentCarrierThread();
294   bool inline_native_currentThread();
295   bool inline_native_setCurrentThread();
296 
297   bool inline_native_scopedValueCache();
298   const Type* scopedValueCache_type();
299   Node* scopedValueCache_helper();
300   bool inline_native_setScopedValueCache();
301   bool inline_native_Continuation_pinning(bool unpin);
302 
303   bool inline_native_time_funcs(address method, const char* funcName);
304 #if INCLUDE_JVMTI
305   bool inline_native_notify_jvmti_funcs(address funcAddr, const char* funcName, bool is_start, bool is_end);
306   bool inline_native_notify_jvmti_hide();
307   bool inline_native_notify_jvmti_sync();
308 #endif
309 
310 #ifdef JFR_HAVE_INTRINSICS
311   bool inline_native_classID();
312   bool inline_native_getEventWriter();
313   bool inline_native_jvm_commit();
314   void extend_setCurrentThread(Node* jt, Node* thread);
315 #endif
316   bool inline_native_Class_query(vmIntrinsics::ID id);
317   bool inline_primitive_Class_conversion(vmIntrinsics::ID id);
318   bool inline_native_subtype_check();
319   bool inline_native_getLength();
320   bool inline_array_copyOf(bool is_copyOfRange);
321   bool inline_array_equals(StrIntrinsicNode::ArgEnc ae);
322   bool inline_preconditions_checkIndex(BasicType bt);
323   void copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array);
324   bool inline_native_clone(bool is_virtual);
325   bool inline_native_Reflection_getCallerClass();
326   // Helper function for inlining native object hash method
327   bool inline_native_hashcode(bool is_virtual, bool is_static);
328   bool inline_native_getClass();
329 
330   // Helper functions for inlining arraycopy
331   bool inline_arraycopy();
332   AllocateArrayNode* tightly_coupled_allocation(Node* ptr);
333   static CallStaticJavaNode* get_uncommon_trap_from_success_proj(Node* node);
334   SafePointNode* create_safepoint_with_state_before_array_allocation(const AllocateArrayNode* alloc) const;
335   void replace_unrelated_uncommon_traps_with_alloc_state(AllocateArrayNode* alloc, JVMState* saved_jvms_before_guards);
336   void replace_unrelated_uncommon_traps_with_alloc_state(JVMState* saved_jvms_before_guards);
337   void create_new_uncommon_trap(CallStaticJavaNode* uncommon_trap_call);
< prev index next >