11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
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 #include "ci/ciMethod.hpp"
26 #include "classfile/javaClasses.hpp"
27 #include "opto/callGenerator.hpp"
28 #include "opto/graphKit.hpp"
29 #include "opto/castnode.hpp"
30 #include "opto/convertnode.hpp"
31 #include "opto/intrinsicnode.hpp"
32 #include "opto/movenode.hpp"
33
34 class LibraryIntrinsic : public InlineCallGenerator {
35 // Extend the set of intrinsics known to the runtime:
36 public:
37 private:
38 bool _is_virtual;
39 bool _does_virtual_dispatch;
40 int8_t _predicates_count; // Intrinsic is predicated by several conditions
41 int8_t _last_predicate; // Last generated predicate
42 vmIntrinsics::ID _intrinsic_id;
43
44 public:
45 LibraryIntrinsic(ciMethod* m, bool is_virtual, int predicates_count, bool does_virtual_dispatch, vmIntrinsics::ID id)
46 : InlineCallGenerator(m),
47 _is_virtual(is_virtual),
48 _does_virtual_dispatch(does_virtual_dispatch),
49 _predicates_count((int8_t)predicates_count),
50 _last_predicate((int8_t)-1),
88 ciSignature* declared_signature = nullptr;
89 ciMethod* ignored_callee = caller()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
90 const int nargs = declared_signature->arg_size_for_bc(caller()->java_code_at_bci(bci()));
91 _reexecute_sp = sp() + nargs; // "push" arguments back on stack
92 }
93 }
94
95 virtual LibraryCallKit* is_LibraryCallKit() const { return (LibraryCallKit*)this; }
96
97 ciMethod* caller() const { return jvms()->method(); }
98 int bci() const { return jvms()->bci(); }
99 LibraryIntrinsic* intrinsic() const { return _intrinsic; }
100 vmIntrinsics::ID intrinsic_id() const { return _intrinsic->intrinsic_id(); }
101 ciMethod* callee() const { return _intrinsic->method(); }
102
103 bool try_to_inline(int predicate);
104 Node* try_to_predicate(int predicate);
105
106 void push_result() {
107 // Push the result onto the stack.
108 if (!stopped() && result() != nullptr) {
109 if (result()->is_top()) {
110 assert(false, "Can't determine return value.");
111 C->record_method_not_compilable("Can't determine return value.");
112 }
113 BasicType bt = result()->bottom_type()->basic_type();
114 push_node(bt, result());
115 }
116 }
117
118 private:
119 void fatal_unexpected_iid(vmIntrinsics::ID iid) {
120 fatal("unexpected intrinsic %d: %s", vmIntrinsics::as_int(iid), vmIntrinsics::name_at(iid));
121 }
122
123 void set_result(Node* n) { assert(_result == nullptr, "only set once"); _result = n; }
124 void set_result(RegionNode* region, PhiNode* value);
125 Node* result() { return _result; }
126
127 virtual int reexecute_sp() { return _reexecute_sp; }
128
129 // Helper functions to inline natives
130 Node* generate_guard(Node* test, RegionNode* region, float true_prob);
131 Node* generate_slow_guard(Node* test, RegionNode* region);
132 Node* generate_fair_guard(Node* test, RegionNode* region);
133 Node* generate_negative_guard(Node* index, RegionNode* region,
134 // resulting CastII of index:
135 Node* *pos_index = nullptr);
136 Node* generate_limit_guard(Node* offset, Node* subseq_length,
137 Node* array_length,
138 RegionNode* region);
139 void generate_string_range_check(Node* array, Node* offset,
140 Node* length, bool char_count);
141 Node* current_thread_helper(Node* &tls_output, ByteSize handle_offset,
142 bool is_immutable);
143 Node* generate_current_thread(Node* &tls_output);
144 Node* generate_virtual_thread(Node* threadObj);
145 Node* load_mirror_from_klass(Node* klass);
146 Node* load_klass_from_mirror_common(Node* mirror, bool never_see_null,
147 RegionNode* region, int null_path,
148 int offset);
149 Node* load_klass_from_mirror(Node* mirror, bool never_see_null,
150 RegionNode* region, int null_path) {
151 int offset = java_lang_Class::klass_offset();
152 return load_klass_from_mirror_common(mirror, never_see_null,
153 region, null_path,
154 offset);
155 }
156 Node* load_array_klass_from_mirror(Node* mirror, bool never_see_null,
157 RegionNode* region, int null_path) {
158 int offset = java_lang_Class::array_klass_offset();
159 return load_klass_from_mirror_common(mirror, never_see_null,
160 region, null_path,
161 offset);
162 }
163 Node* generate_klass_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region,
164 ByteSize offset, const Type* type, BasicType bt);
165 Node* generate_misc_flags_guard(Node* kls,
166 int modifier_mask, int modifier_bits,
167 RegionNode* region);
168 Node* generate_interface_guard(Node* kls, RegionNode* region);
169 Node* generate_hidden_class_guard(Node* kls, RegionNode* region);
170 Node* generate_array_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
171 return generate_array_guard_common(kls, region, false, false, obj);
172 }
173 Node* generate_non_array_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
174 return generate_array_guard_common(kls, region, false, true, obj);
175 }
176 Node* generate_objArray_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
177 return generate_array_guard_common(kls, region, true, false, obj);
178 }
179 Node* generate_non_objArray_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
180 return generate_array_guard_common(kls, region, true, true, obj);
181 }
182 Node* generate_array_guard_common(Node* kls, RegionNode* region,
183 bool obj_array, bool not_array, Node** obj = nullptr);
184 Node* generate_virtual_guard(Node* obj_klass, RegionNode* slow_region);
185 CallJavaNode* generate_method_call(vmIntrinsicID method_id, bool is_virtual, bool is_static, bool res_not_null);
186 CallJavaNode* generate_method_call_static(vmIntrinsicID method_id, bool res_not_null) {
187 return generate_method_call(method_id, false, true, res_not_null);
188 }
189 Node* load_field_from_object(Node* fromObj, const char* fieldName, const char* fieldTypeString, DecoratorSet decorators = IN_HEAP, bool is_static = false, ciInstanceKlass* fromKls = nullptr);
190 Node* field_address_from_object(Node* fromObj, const char* fieldName, const char* fieldTypeString, bool is_exact = true, bool is_static = false, ciInstanceKlass* fromKls = nullptr);
191
192 Node* make_string_method_node(int opcode, Node* str1_start, Node* cnt1, Node* str2_start, Node* cnt2, StrIntrinsicNode::ArgEnc ae);
193 bool inline_string_compareTo(StrIntrinsicNode::ArgEnc ae);
194 bool inline_string_indexOf(StrIntrinsicNode::ArgEnc ae);
195 bool inline_string_indexOfI(StrIntrinsicNode::ArgEnc ae);
196 Node* make_indexOf_node(Node* src_start, Node* src_count, Node* tgt_start, Node* tgt_count,
197 RegionNode* region, Node* phi, StrIntrinsicNode::ArgEnc ae);
198 bool inline_string_indexOfChar(StrIntrinsicNode::ArgEnc ae);
199 bool inline_string_equals(StrIntrinsicNode::ArgEnc ae);
200 bool inline_vectorizedHashCode();
201 bool inline_string_toBytesU();
202 bool inline_string_getCharsU();
203 bool inline_string_copy(bool compress);
211 bool inline_math_overflow(Node* arg1, Node* arg2);
212 void inline_math_mathExact(Node* math, Node* test);
213 bool inline_math_addExactI(bool is_increment);
214 bool inline_math_addExactL(bool is_increment);
215 bool inline_math_multiplyExactI();
216 bool inline_math_multiplyExactL();
217 bool inline_math_multiplyHigh();
218 bool inline_math_unsignedMultiplyHigh();
219 bool inline_math_negateExactI();
220 bool inline_math_negateExactL();
221 bool inline_math_subtractExactI(bool is_decrement);
222 bool inline_math_subtractExactL(bool is_decrement);
223 bool inline_min_max(vmIntrinsics::ID id);
224 bool inline_notify(vmIntrinsics::ID id);
225 // This returns Type::AnyPtr, RawPtr, or OopPtr.
226 int classify_unsafe_addr(Node* &base, Node* &offset, BasicType type);
227 Node* make_unsafe_address(Node*& base, Node* offset, BasicType type = T_ILLEGAL, bool can_cast = false);
228
229 typedef enum { Relaxed, Opaque, Volatile, Acquire, Release } AccessKind;
230 DecoratorSet mo_decorator_for_access_kind(AccessKind kind);
231 bool inline_unsafe_access(bool is_store, BasicType type, AccessKind kind, bool is_unaligned);
232 static bool klass_needs_init_guard(Node* kls);
233 bool inline_unsafe_allocate();
234 bool inline_unsafe_newArray(bool uninitialized);
235 bool inline_unsafe_writeback0();
236 bool inline_unsafe_writebackSync0(bool is_pre);
237 bool inline_unsafe_copyMemory();
238 bool inline_unsafe_setMemory();
239
240 bool inline_native_currentCarrierThread();
241 bool inline_native_currentThread();
242 bool inline_native_setCurrentThread();
243
244 bool inline_native_scopedValueCache();
245 const Type* scopedValueCache_type();
246 Node* scopedValueCache_helper();
247 bool inline_native_setScopedValueCache();
248 bool inline_native_Continuation_pinning(bool unpin);
249
250 bool inline_native_time_funcs(address method, const char* funcName);
251 #if INCLUDE_JVMTI
252 bool inline_native_notify_jvmti_funcs(address funcAddr, const char* funcName, bool is_start, bool is_end);
253 bool inline_native_notify_jvmti_hide();
254 bool inline_native_notify_jvmti_sync();
255 #endif
256
257 #ifdef JFR_HAVE_INTRINSICS
258 bool inline_native_classID();
259 bool inline_native_getEventWriter();
260 bool inline_native_jvm_commit();
261 void extend_setCurrentThread(Node* jt, Node* thread);
262 #endif
263 bool inline_native_Class_query(vmIntrinsics::ID id);
264 bool inline_native_subtype_check();
265 bool inline_native_getLength();
266 bool inline_array_copyOf(bool is_copyOfRange);
267 bool inline_array_equals(StrIntrinsicNode::ArgEnc ae);
268 bool inline_preconditions_checkIndex(BasicType bt);
269 void copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array);
270 bool inline_native_clone(bool is_virtual);
271 bool inline_native_Reflection_getCallerClass();
272 // Helper function for inlining native object hash method
273 bool inline_native_hashcode(bool is_virtual, bool is_static);
274 bool inline_native_getClass();
275
276 // Helper functions for inlining arraycopy
277 bool inline_arraycopy();
278 AllocateArrayNode* tightly_coupled_allocation(Node* ptr);
279 static CallStaticJavaNode* get_uncommon_trap_from_success_proj(Node* node);
280 SafePointNode* create_safepoint_with_state_before_array_allocation(const AllocateArrayNode* alloc) const;
281 void replace_unrelated_uncommon_traps_with_alloc_state(AllocateArrayNode* alloc, JVMState* saved_jvms_before_guards);
282 void replace_unrelated_uncommon_traps_with_alloc_state(JVMState* saved_jvms_before_guards);
283 void create_new_uncommon_trap(CallStaticJavaNode* uncommon_trap_call);
|
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
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 #include "ci/ciMethod.hpp"
26 #include "classfile/javaClasses.hpp"
27 #include "opto/callGenerator.hpp"
28 #include "opto/graphKit.hpp"
29 #include "opto/castnode.hpp"
30 #include "opto/convertnode.hpp"
31 #include "opto/inlinetypenode.hpp"
32 #include "opto/intrinsicnode.hpp"
33 #include "opto/movenode.hpp"
34
35 class LibraryIntrinsic : public InlineCallGenerator {
36 // Extend the set of intrinsics known to the runtime:
37 public:
38 private:
39 bool _is_virtual;
40 bool _does_virtual_dispatch;
41 int8_t _predicates_count; // Intrinsic is predicated by several conditions
42 int8_t _last_predicate; // Last generated predicate
43 vmIntrinsics::ID _intrinsic_id;
44
45 public:
46 LibraryIntrinsic(ciMethod* m, bool is_virtual, int predicates_count, bool does_virtual_dispatch, vmIntrinsics::ID id)
47 : InlineCallGenerator(m),
48 _is_virtual(is_virtual),
49 _does_virtual_dispatch(does_virtual_dispatch),
50 _predicates_count((int8_t)predicates_count),
51 _last_predicate((int8_t)-1),
89 ciSignature* declared_signature = nullptr;
90 ciMethod* ignored_callee = caller()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
91 const int nargs = declared_signature->arg_size_for_bc(caller()->java_code_at_bci(bci()));
92 _reexecute_sp = sp() + nargs; // "push" arguments back on stack
93 }
94 }
95
96 virtual LibraryCallKit* is_LibraryCallKit() const { return (LibraryCallKit*)this; }
97
98 ciMethod* caller() const { return jvms()->method(); }
99 int bci() const { return jvms()->bci(); }
100 LibraryIntrinsic* intrinsic() const { return _intrinsic; }
101 vmIntrinsics::ID intrinsic_id() const { return _intrinsic->intrinsic_id(); }
102 ciMethod* callee() const { return _intrinsic->method(); }
103
104 bool try_to_inline(int predicate);
105 Node* try_to_predicate(int predicate);
106
107 void push_result() {
108 // Push the result onto the stack.
109 Node* res = result();
110 if (!stopped() && res != nullptr) {
111 if (res->is_top()) {
112 assert(false, "Can't determine return value.");
113 C->record_method_not_compilable("Can't determine return value.");
114 }
115 BasicType bt = res->bottom_type()->basic_type();
116 if (C->inlining_incrementally() && res->is_InlineType()) {
117 // The caller expects an oop when incrementally inlining an intrinsic that returns an
118 // inline type. Make sure the call is re-executed if the allocation triggers a deoptimization.
119 PreserveReexecuteState preexecs(this);
120 jvms()->set_should_reexecute(true);
121 res = res->as_InlineType()->buffer(this);
122 }
123 push_node(bt, res);
124 }
125 }
126
127 private:
128 void fatal_unexpected_iid(vmIntrinsics::ID iid) {
129 fatal("unexpected intrinsic %d: %s", vmIntrinsics::as_int(iid), vmIntrinsics::name_at(iid));
130 }
131
132 void set_result(Node* n) { assert(_result == nullptr, "only set once"); _result = n; }
133 void set_result(RegionNode* region, PhiNode* value);
134 Node* result() { return _result; }
135
136 virtual int reexecute_sp() { return _reexecute_sp; }
137
138 // Helper functions to inline natives
139 Node* generate_guard(Node* test, RegionNode* region, float true_prob);
140 Node* generate_slow_guard(Node* test, RegionNode* region);
141 Node* generate_fair_guard(Node* test, RegionNode* region);
142 Node* generate_negative_guard(Node* index, RegionNode* region,
143 // resulting CastII of index:
144 Node* *pos_index = nullptr);
145 Node* generate_limit_guard(Node* offset, Node* subseq_length,
146 Node* array_length,
147 RegionNode* region);
148 void generate_string_range_check(Node* array, Node* offset,
149 Node* length, bool char_count);
150 Node* current_thread_helper(Node* &tls_output, ByteSize handle_offset,
151 bool is_immutable);
152 Node* generate_current_thread(Node* &tls_output);
153 Node* generate_virtual_thread(Node* threadObj);
154 Node* load_klass_from_mirror_common(Node* mirror, bool never_see_null,
155 RegionNode* region, int null_path,
156 int offset);
157 Node* load_klass_from_mirror(Node* mirror, bool never_see_null,
158 RegionNode* region, int null_path) {
159 int offset = java_lang_Class::klass_offset();
160 return load_klass_from_mirror_common(mirror, never_see_null,
161 region, null_path,
162 offset);
163 }
164 Node* load_array_klass_from_mirror(Node* mirror, bool never_see_null,
165 RegionNode* region, int null_path) {
166 int offset = java_lang_Class::array_klass_offset();
167 return load_klass_from_mirror_common(mirror, never_see_null,
168 region, null_path,
169 offset);
170 }
171 Node* generate_klass_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region,
172 ByteSize offset, const Type* type, BasicType bt);
173 Node* generate_misc_flags_guard(Node* kls,
174 int modifier_mask, int modifier_bits,
175 RegionNode* region);
176 Node* generate_interface_guard(Node* kls, RegionNode* region);
177
178 enum ArrayKind {
179 AnyArray,
180 NonArray,
181 ObjectArray,
182 NonObjectArray,
183 TypeArray
184 };
185
186 Node* generate_hidden_class_guard(Node* kls, RegionNode* region);
187
188 Node* generate_array_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
189 return generate_array_guard_common(kls, region, AnyArray, obj);
190 }
191 Node* generate_non_array_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
192 return generate_array_guard_common(kls, region, NonArray, obj);
193 }
194 Node* generate_objArray_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
195 return generate_array_guard_common(kls, region, ObjectArray, obj);
196 }
197 Node* generate_non_objArray_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
198 return generate_array_guard_common(kls, region, NonObjectArray, obj);
199 }
200 Node* generate_typeArray_guard(Node* kls, RegionNode* region, Node** obj = nullptr) {
201 return generate_array_guard_common(kls, region, TypeArray, obj);
202 }
203 Node* generate_array_guard_common(Node* kls, RegionNode* region, ArrayKind kind, Node** obj = nullptr);
204 Node* generate_virtual_guard(Node* obj_klass, RegionNode* slow_region);
205 CallJavaNode* generate_method_call(vmIntrinsicID method_id, bool is_virtual, bool is_static, bool res_not_null);
206 CallJavaNode* generate_method_call_static(vmIntrinsicID method_id, bool res_not_null) {
207 return generate_method_call(method_id, false, true, res_not_null);
208 }
209 Node* load_field_from_object(Node* fromObj, const char* fieldName, const char* fieldTypeString, DecoratorSet decorators = IN_HEAP, bool is_static = false, ciInstanceKlass* fromKls = nullptr);
210 Node* field_address_from_object(Node* fromObj, const char* fieldName, const char* fieldTypeString, bool is_exact = true, bool is_static = false, ciInstanceKlass* fromKls = nullptr);
211
212 Node* make_string_method_node(int opcode, Node* str1_start, Node* cnt1, Node* str2_start, Node* cnt2, StrIntrinsicNode::ArgEnc ae);
213 bool inline_string_compareTo(StrIntrinsicNode::ArgEnc ae);
214 bool inline_string_indexOf(StrIntrinsicNode::ArgEnc ae);
215 bool inline_string_indexOfI(StrIntrinsicNode::ArgEnc ae);
216 Node* make_indexOf_node(Node* src_start, Node* src_count, Node* tgt_start, Node* tgt_count,
217 RegionNode* region, Node* phi, StrIntrinsicNode::ArgEnc ae);
218 bool inline_string_indexOfChar(StrIntrinsicNode::ArgEnc ae);
219 bool inline_string_equals(StrIntrinsicNode::ArgEnc ae);
220 bool inline_vectorizedHashCode();
221 bool inline_string_toBytesU();
222 bool inline_string_getCharsU();
223 bool inline_string_copy(bool compress);
231 bool inline_math_overflow(Node* arg1, Node* arg2);
232 void inline_math_mathExact(Node* math, Node* test);
233 bool inline_math_addExactI(bool is_increment);
234 bool inline_math_addExactL(bool is_increment);
235 bool inline_math_multiplyExactI();
236 bool inline_math_multiplyExactL();
237 bool inline_math_multiplyHigh();
238 bool inline_math_unsignedMultiplyHigh();
239 bool inline_math_negateExactI();
240 bool inline_math_negateExactL();
241 bool inline_math_subtractExactI(bool is_decrement);
242 bool inline_math_subtractExactL(bool is_decrement);
243 bool inline_min_max(vmIntrinsics::ID id);
244 bool inline_notify(vmIntrinsics::ID id);
245 // This returns Type::AnyPtr, RawPtr, or OopPtr.
246 int classify_unsafe_addr(Node* &base, Node* &offset, BasicType type);
247 Node* make_unsafe_address(Node*& base, Node* offset, BasicType type = T_ILLEGAL, bool can_cast = false);
248
249 typedef enum { Relaxed, Opaque, Volatile, Acquire, Release } AccessKind;
250 DecoratorSet mo_decorator_for_access_kind(AccessKind kind);
251 bool inline_unsafe_access(bool is_store, BasicType type, AccessKind kind, bool is_unaligned, bool is_flat = false);
252 static bool klass_needs_init_guard(Node* kls);
253 bool inline_unsafe_allocate();
254 bool inline_unsafe_newArray(bool uninitialized);
255 bool inline_newArray(bool null_free, bool atomic);
256 bool inline_unsafe_writeback0();
257 bool inline_unsafe_writebackSync0(bool is_pre);
258 bool inline_unsafe_copyMemory();
259 bool inline_unsafe_isFlatArray();
260 bool inline_unsafe_make_private_buffer();
261 bool inline_unsafe_finish_private_buffer();
262 bool inline_unsafe_setMemory();
263
264 bool inline_native_currentCarrierThread();
265 bool inline_native_currentThread();
266 bool inline_native_setCurrentThread();
267
268 bool inline_native_scopedValueCache();
269 const Type* scopedValueCache_type();
270 Node* scopedValueCache_helper();
271 bool inline_native_setScopedValueCache();
272 bool inline_native_Continuation_pinning(bool unpin);
273
274 bool inline_native_time_funcs(address method, const char* funcName);
275 #if INCLUDE_JVMTI
276 bool inline_native_notify_jvmti_funcs(address funcAddr, const char* funcName, bool is_start, bool is_end);
277 bool inline_native_notify_jvmti_hide();
278 bool inline_native_notify_jvmti_sync();
279 #endif
280
281 #ifdef JFR_HAVE_INTRINSICS
282 bool inline_native_classID();
283 bool inline_native_getEventWriter();
284 bool inline_native_jvm_commit();
285 void extend_setCurrentThread(Node* jt, Node* thread);
286 #endif
287 bool inline_native_Class_query(vmIntrinsics::ID id);
288 bool inline_primitive_Class_conversion(vmIntrinsics::ID id);
289 bool inline_native_subtype_check();
290 bool inline_native_getLength();
291 bool inline_array_copyOf(bool is_copyOfRange);
292 bool inline_array_equals(StrIntrinsicNode::ArgEnc ae);
293 bool inline_preconditions_checkIndex(BasicType bt);
294 void copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array);
295 bool inline_native_clone(bool is_virtual);
296 bool inline_native_Reflection_getCallerClass();
297 // Helper function for inlining native object hash method
298 bool inline_native_hashcode(bool is_virtual, bool is_static);
299 bool inline_native_getClass();
300
301 // Helper functions for inlining arraycopy
302 bool inline_arraycopy();
303 AllocateArrayNode* tightly_coupled_allocation(Node* ptr);
304 static CallStaticJavaNode* get_uncommon_trap_from_success_proj(Node* node);
305 SafePointNode* create_safepoint_with_state_before_array_allocation(const AllocateArrayNode* alloc) const;
306 void replace_unrelated_uncommon_traps_with_alloc_state(AllocateArrayNode* alloc, JVMState* saved_jvms_before_guards);
307 void replace_unrelated_uncommon_traps_with_alloc_state(JVMState* saved_jvms_before_guards);
308 void create_new_uncommon_trap(CallStaticJavaNode* uncommon_trap_call);
|