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_GRAPHKIT_HPP
26 #define SHARE_OPTO_GRAPHKIT_HPP
27
28 #include "ci/ciEnv.hpp"
29 #include "ci/ciMethodData.hpp"
30 #include "gc/shared/c2/barrierSetC2.hpp"
31 #include "opto/addnode.hpp"
32 #include "opto/callnode.hpp"
33 #include "opto/cfgnode.hpp"
34 #include "opto/compile.hpp"
35 #include "opto/divnode.hpp"
36 #include "opto/mulnode.hpp"
37 #include "opto/phaseX.hpp"
38 #include "opto/subnode.hpp"
39 #include "opto/type.hpp"
40 #include "runtime/deoptimization.hpp"
41
42 class BarrierSetC2;
43 class FastLockNode;
44 class FastUnlockNode;
45 class IdealKit;
46 class LibraryCallKit;
47 class Parse;
48 class RootNode;
49
50 //-----------------------------------------------------------------------------
51 //----------------------------GraphKit-----------------------------------------
52 // Toolkit for building the common sorts of subgraphs.
53 // Does not know about bytecode parsing or type-flow results.
54 // It is able to create graphs implementing the semantics of most
55 // or all bytecodes, so that it can expand intrinsics and calls.
56 // It may depend on JVMState structure, but it must not depend
57 // on specific bytecode streams.
58 class GraphKit : public Phase {
59 friend class PreserveJVMState;
60
61 protected:
62 ciEnv* _env; // Compilation environment
63 PhaseGVN &_gvn; // Some optimizations while parsing
64 SafePointNode* _map; // Parser map from JVM to Nodes
65 SafePointNode* _exceptions;// Parser map(s) for exception state(s)
66 int _bci; // JVM Bytecode Pointer
67 ciMethod* _method; // JVM Current Method
68 BarrierSetC2* _barrier_set;
69
70 private:
71 int _sp; // JVM Expression Stack Pointer; don't modify directly!
72
73 private:
74 SafePointNode* map_not_null() const {
75 assert(_map != nullptr, "must call stopped() to test for reset compiler map");
76 return _map;
77 }
78
79 public:
80 GraphKit(); // empty constructor
81 GraphKit(JVMState* jvms); // the JVM state on which to operate
82
83 #ifdef ASSERT
84 ~GraphKit() {
85 assert(failing() || !has_exceptions(),
86 "unless compilation failed, user must call transfer_exceptions_into_jvms");
87 }
88 #endif
89
90 virtual Parse* is_Parse() const { return nullptr; }
91 virtual LibraryCallKit* is_LibraryCallKit() const { return nullptr; }
92
93 ciEnv* env() const { return _env; }
94 PhaseGVN& gvn() const { return _gvn; }
95 void* barrier_set_state() const { return C->barrier_set_state(); }
96
97 void record_for_igvn(Node* n) const { C->record_for_igvn(n); } // delegate to Compile
98 void remove_for_igvn(Node* n) const { C->remove_for_igvn(n); }
99
100 // Handy well-known nodes:
101 Node* null() const { return zerocon(T_OBJECT); }
102 Node* top() const { return C->top(); }
103 RootNode* root() const { return C->root(); }
104
105 // Create or find a constant node
106 Node* intcon(jint con) const { return _gvn.intcon(con); }
107 Node* longcon(jlong con) const { return _gvn.longcon(con); }
108 Node* integercon(jlong con, BasicType bt) const {
109 if (bt == T_INT) {
110 return intcon(checked_cast<jint>(con));
111 }
112 assert(bt == T_LONG, "basic type not an int or long");
113 return longcon(con);
114 }
115 Node* makecon(const Type *t) const { return _gvn.makecon(t); }
116 Node* zerocon(BasicType bt) const { return _gvn.zerocon(bt); }
117 // (See also macro MakeConX in type.hpp, which uses intcon or longcon.)
344 Node* ConvL2I(Node* offset);
345 // Find out the klass of an object.
346 Node* load_object_klass(Node* object);
347 // Find out the length of an array.
348 Node* load_array_length(Node* array);
349 // Cast array allocation's length as narrow as possible.
350 // If replace_length_in_map is true, replace length with CastIINode in map.
351 // This method is invoked after creating/moving ArrayAllocationNode or in load_array_length
352 Node* array_ideal_length(AllocateArrayNode* alloc,
353 const TypeOopPtr* oop_type,
354 bool replace_length_in_map);
355
356
357 // Helper function to do a null pointer check or ZERO check based on type.
358 // Throw an exception if a given value is null.
359 // Return the value cast to not-null.
360 // Be clever about equivalent dominating null checks.
361 Node* null_check_common(Node* value, BasicType type,
362 bool assert_null = false,
363 Node* *null_control = nullptr,
364 bool speculative = false);
365 Node* null_check(Node* value, BasicType type = T_OBJECT) {
366 return null_check_common(value, type, false, nullptr, !_gvn.type(value)->speculative_maybe_null());
367 }
368 Node* null_check_receiver() {
369 assert(argument(0)->bottom_type()->isa_ptr(), "must be");
370 return null_check(argument(0));
371 }
372 Node* zero_check_int(Node* value) {
373 assert(value->bottom_type()->basic_type() == T_INT,
374 "wrong type: %s", type2name(value->bottom_type()->basic_type()));
375 return null_check_common(value, T_INT);
376 }
377 Node* zero_check_long(Node* value) {
378 assert(value->bottom_type()->basic_type() == T_LONG,
379 "wrong type: %s", type2name(value->bottom_type()->basic_type()));
380 return null_check_common(value, T_LONG);
381 }
382 // Throw an uncommon trap if a given value is __not__ null.
383 // Return the value cast to null, and be clever about dominating checks.
384 Node* null_assert(Node* value, BasicType type = T_OBJECT) {
385 return null_check_common(value, type, true, nullptr, _gvn.type(value)->speculative_always_null());
386 }
387
388 // Check if value is null and abort if it is
389 Node* must_be_not_null(Node* value, bool do_replace_in_map);
587 }
588 // This is the base version which is given alias index
589 // Return the new StoreXNode
590 Node* store_to_memory(Node* ctl, Node* adr, Node* val, BasicType bt,
591 int adr_idx,
592 MemNode::MemOrd,
593 bool require_atomic_access = false,
594 bool unaligned = false,
595 bool mismatched = false,
596 bool unsafe = false,
597 int barrier_data = 0);
598
599 // Perform decorated accesses
600
601 Node* access_store_at(Node* obj, // containing obj
602 Node* adr, // actual address to store val at
603 const TypePtr* adr_type,
604 Node* val,
605 const Type* val_type,
606 BasicType bt,
607 DecoratorSet decorators);
608
609 Node* access_load_at(Node* obj, // containing obj
610 Node* adr, // actual address to load val at
611 const TypePtr* adr_type,
612 const Type* val_type,
613 BasicType bt,
614 DecoratorSet decorators);
615
616 Node* access_load(Node* adr, // actual address to load val at
617 const Type* val_type,
618 BasicType bt,
619 DecoratorSet decorators);
620
621 Node* access_atomic_cmpxchg_val_at(Node* obj,
622 Node* adr,
623 const TypePtr* adr_type,
624 int alias_idx,
625 Node* expected_val,
626 Node* new_val,
627 const Type* value_type,
628 BasicType bt,
629 DecoratorSet decorators);
630
631 Node* access_atomic_cmpxchg_bool_at(Node* obj,
632 Node* adr,
633 const TypePtr* adr_type,
634 int alias_idx,
686 bool return_pc);
687
688 //---------- help for generating calls --------------
689
690 // Do a null check on the receiver as it would happen before the call to
691 // callee (with all arguments still on the stack).
692 Node* null_check_receiver_before_call(ciMethod* callee) {
693 assert(!callee->is_static(), "must be a virtual method");
694 // Callsite signature can be different from actual method being called (i.e _linkTo* sites).
695 // Use callsite signature always.
696 ciMethod* declared_method = method()->get_method_at_bci(bci());
697 const int nargs = declared_method->arg_size();
698 inc_sp(nargs);
699 Node* n = null_check_receiver();
700 dec_sp(nargs);
701 return n;
702 }
703
704 // Fill in argument edges for the call from argument(0), argument(1), ...
705 // (The next step is to call set_edges_for_java_call.)
706 void set_arguments_for_java_call(CallJavaNode* call);
707
708 // Fill in non-argument edges for the call.
709 // Transform the call, and update the basics: control, i_o, memory.
710 // (The next step is usually to call set_results_for_java_call.)
711 void set_edges_for_java_call(CallJavaNode* call,
712 bool must_throw = false, bool separate_io_proj = false);
713
714 // Finish up a java call that was started by set_edges_for_java_call.
715 // Call add_exception on any throw arising from the call.
716 // Return the call result (transformed).
717 Node* set_results_for_java_call(CallJavaNode* call, bool separate_io_proj = false, bool deoptimize = false);
718
719 // Similar to set_edges_for_java_call, but simplified for runtime calls.
720 void set_predefined_output_for_runtime_call(Node* call) {
721 set_predefined_output_for_runtime_call(call, nullptr, nullptr);
722 }
723 void set_predefined_output_for_runtime_call(Node* call,
724 Node* keep_mem,
725 const TypePtr* hook_mem);
726 Node* set_predefined_input_for_runtime_call(SafePointNode* call, Node* narrow_mem = nullptr);
825 void merge_memory(Node* new_mem, Node* region, int new_path);
826 void make_slow_call_ex(Node* call, ciInstanceKlass* ex_klass, bool separate_io_proj, bool deoptimize = false);
827
828 // Helper functions to build synchronizations
829 int next_monitor();
830 Node* insert_mem_bar(int opcode, Node* precedent = nullptr);
831 Node* insert_mem_bar_volatile(int opcode, int alias_idx, Node* precedent = nullptr);
832 // Optional 'precedent' is appended as an extra edge, to force ordering.
833 FastLockNode* shared_lock(Node* obj);
834 void shared_unlock(Node* box, Node* obj);
835
836 // helper functions for the fast path/slow path idioms
837 Node* fast_and_slow(Node* in, const Type *result_type, Node* null_result, IfNode* fast_test, Node* fast_result, address slow_call, const TypeFunc *slow_call_type, Node* slow_arg, Klass* ex_klass, Node* slow_result);
838
839 // Generate an instance-of idiom. Used by both the instance-of bytecode
840 // and the reflective instance-of call.
841 Node* gen_instanceof(Node *subobj, Node* superkls, bool safe_for_replace = false);
842
843 // Generate a check-cast idiom. Used by both the check-cast bytecode
844 // and the array-store bytecode
845 Node* gen_checkcast( Node *subobj, Node* superkls,
846 Node* *failure_control = nullptr );
847
848 Node* gen_subtype_check(Node* obj, Node* superklass);
849
850 // Exact type check used for predicted calls and casts.
851 // Rewrites (*casted_receiver) to be casted to the stronger type.
852 // (Caller is responsible for doing replace_in_map.)
853 Node* type_check_receiver(Node* receiver, ciKlass* klass, float prob,
854 Node* *casted_receiver);
855
856 // Inexact type check used for predicted calls.
857 Node* subtype_check_receiver(Node* receiver, ciKlass* klass,
858 Node** casted_receiver);
859
860 // implementation of object creation
861 Node* set_output_for_allocation(AllocateNode* alloc,
862 const TypeOopPtr* oop_type,
863 bool deoptimize_on_exception=false);
864 Node* get_layout_helper(Node* klass_node, jint& constant_value);
865 Node* new_instance(Node* klass_node,
866 Node* slow_test = nullptr,
867 Node* *return_size_val = nullptr,
868 bool deoptimize_on_exception = false);
869 Node* new_array(Node* klass_node, Node* count_val, int nargs,
870 Node* *return_size_val = nullptr,
871 bool deoptimize_on_exception = false);
872
873 // java.lang.String helpers
874 Node* load_String_length(Node* str, bool set_ctrl);
875 Node* load_String_value(Node* str, bool set_ctrl);
876 Node* load_String_coder(Node* str, bool set_ctrl);
877 void store_String_value(Node* str, Node* value);
878 void store_String_coder(Node* str, Node* value);
879 Node* capture_memory(const TypePtr* src_type, const TypePtr* dst_type);
880 Node* compress_string(Node* src, const TypeAryPtr* src_type, Node* dst, Node* count);
881 void inflate_string(Node* src, Node* dst, const TypeAryPtr* dst_type, Node* count);
882 void inflate_string_slow(Node* src, Node* dst, Node* start, Node* count);
883
884 // Handy for making control flow
885 IfNode* create_and_map_if(Node* ctrl, Node* tst, float prob, float cnt) {
886 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
887 _gvn.set_type(iff, iff->Value(&_gvn)); // Value may be known at parse-time
888 // Place 'if' on worklist if it will be in graph
889 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
890 return iff;
891 }
892
893 IfNode* create_and_xform_if(Node* ctrl, Node* tst, float prob, float cnt) {
894 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
895 _gvn.transform(iff); // Value may be known at parse-time
896 // Place 'if' on worklist if it will be in graph
897 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
898 return iff;
899 }
900
901 void add_parse_predicates(int nargs = 0);
902 void add_parse_predicate(Deoptimization::DeoptReason reason, int nargs);
903
904 Node* make_constant_from_field(ciField* field, Node* obj);
905
906 // Vector API support (implemented in vectorIntrinsics.cpp)
907 Node* box_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool deoptimize_on_exception = false);
908 Node* unbox_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool shuffle_to_vector = false);
909 Node* vector_shift_count(Node* cnt, int shift_op, BasicType bt, int num_elem);
910 };
911
912 // Helper class to support building of control flow branches. Upon
913 // creation the map and sp at bci are cloned and restored upon de-
914 // struction. Typical use:
915 //
916 // { PreserveJVMState pjvms(this);
917 // // code of new branch
918 // }
919 // // here the JVM state at bci is established
920
921 class PreserveJVMState: public StackObj {
922 protected:
923 GraphKit* _kit;
924 #ifdef ASSERT
|
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_GRAPHKIT_HPP
26 #define SHARE_OPTO_GRAPHKIT_HPP
27
28 #include "ci/ciEnv.hpp"
29 #include "ci/ciMethodData.hpp"
30 #include "gc/shared/c2/barrierSetC2.hpp"
31 #include "opto/addnode.hpp"
32 #include "opto/callnode.hpp"
33 #include "opto/cfgnode.hpp"
34 #include "opto/compile.hpp"
35 #include "opto/divnode.hpp"
36 #include "opto/inlinetypenode.hpp"
37 #include "opto/mulnode.hpp"
38 #include "opto/phaseX.hpp"
39 #include "opto/subnode.hpp"
40 #include "opto/type.hpp"
41 #include "runtime/deoptimization.hpp"
42
43 class BarrierSetC2;
44 class FastLockNode;
45 class FastUnlockNode;
46 class IdealKit;
47 class LibraryCallKit;
48 class Parse;
49 class RootNode;
50
51 //-----------------------------------------------------------------------------
52 //----------------------------GraphKit-----------------------------------------
53 // Toolkit for building the common sorts of subgraphs.
54 // Does not know about bytecode parsing or type-flow results.
55 // It is able to create graphs implementing the semantics of most
56 // or all bytecodes, so that it can expand intrinsics and calls.
57 // It may depend on JVMState structure, but it must not depend
58 // on specific bytecode streams.
59 class GraphKit : public Phase {
60 friend class PreserveJVMState;
61
62 protected:
63 ciEnv* _env; // Compilation environment
64 PhaseGVN &_gvn; // Some optimizations while parsing
65 SafePointNode* _map; // Parser map from JVM to Nodes
66 SafePointNode* _exceptions;// Parser map(s) for exception state(s)
67 int _bci; // JVM Bytecode Pointer
68 ciMethod* _method; // JVM Current Method
69 BarrierSetC2* _barrier_set;
70 #ifdef ASSERT
71 uint _worklist_size;
72 #endif
73
74 private:
75 int _sp; // JVM Expression Stack Pointer; don't modify directly!
76
77 private:
78 SafePointNode* map_not_null() const {
79 assert(_map != nullptr, "must call stopped() to test for reset compiler map");
80 return _map;
81 }
82
83 public:
84 GraphKit(); // empty constructor
85 GraphKit(JVMState* jvms, PhaseGVN* gvn = nullptr); // the JVM state on which to operate
86
87 #ifdef ASSERT
88 ~GraphKit() {
89 assert(failing() || !has_exceptions(),
90 "unless compilation failed, user must call transfer_exceptions_into_jvms");
91 #if 0
92 // During incremental inlining, the Node_Array of the C->for_igvn() worklist and the IGVN
93 // worklist are shared but the _in_worklist VectorSet is not. To avoid inconsistencies,
94 // we should not add nodes to the _for_igvn worklist when using IGVN for the GraphKit.
95 assert((_gvn.is_IterGVN() == nullptr) || (_gvn.C->for_igvn()->size() == _worklist_size),
96 "GraphKit should not modify _for_igvn worklist after parsing");
97 #endif
98 }
99 #endif
100
101 virtual Parse* is_Parse() const { return nullptr; }
102 virtual LibraryCallKit* is_LibraryCallKit() const { return nullptr; }
103
104 ciEnv* env() const { return _env; }
105 PhaseGVN& gvn() const { return _gvn; }
106 void* barrier_set_state() const { return C->barrier_set_state(); }
107
108 void record_for_igvn(Node* n) const { _gvn.record_for_igvn(n); }
109 void remove_for_igvn(Node* n) const { C->remove_for_igvn(n); }
110
111 // Handy well-known nodes:
112 Node* null() const { return zerocon(T_OBJECT); }
113 Node* top() const { return C->top(); }
114 RootNode* root() const { return C->root(); }
115
116 // Create or find a constant node
117 Node* intcon(jint con) const { return _gvn.intcon(con); }
118 Node* longcon(jlong con) const { return _gvn.longcon(con); }
119 Node* integercon(jlong con, BasicType bt) const {
120 if (bt == T_INT) {
121 return intcon(checked_cast<jint>(con));
122 }
123 assert(bt == T_LONG, "basic type not an int or long");
124 return longcon(con);
125 }
126 Node* makecon(const Type *t) const { return _gvn.makecon(t); }
127 Node* zerocon(BasicType bt) const { return _gvn.zerocon(bt); }
128 // (See also macro MakeConX in type.hpp, which uses intcon or longcon.)
355 Node* ConvL2I(Node* offset);
356 // Find out the klass of an object.
357 Node* load_object_klass(Node* object);
358 // Find out the length of an array.
359 Node* load_array_length(Node* array);
360 // Cast array allocation's length as narrow as possible.
361 // If replace_length_in_map is true, replace length with CastIINode in map.
362 // This method is invoked after creating/moving ArrayAllocationNode or in load_array_length
363 Node* array_ideal_length(AllocateArrayNode* alloc,
364 const TypeOopPtr* oop_type,
365 bool replace_length_in_map);
366
367
368 // Helper function to do a null pointer check or ZERO check based on type.
369 // Throw an exception if a given value is null.
370 // Return the value cast to not-null.
371 // Be clever about equivalent dominating null checks.
372 Node* null_check_common(Node* value, BasicType type,
373 bool assert_null = false,
374 Node* *null_control = nullptr,
375 bool speculative = false,
376 bool is_init_check = false);
377 Node* null_check(Node* value, BasicType type = T_OBJECT) {
378 return null_check_common(value, type, false, nullptr, !_gvn.type(value)->speculative_maybe_null());
379 }
380 Node* null_check_receiver() {
381 return null_check(argument(0));
382 }
383 Node* zero_check_int(Node* value) {
384 assert(value->bottom_type()->basic_type() == T_INT,
385 "wrong type: %s", type2name(value->bottom_type()->basic_type()));
386 return null_check_common(value, T_INT);
387 }
388 Node* zero_check_long(Node* value) {
389 assert(value->bottom_type()->basic_type() == T_LONG,
390 "wrong type: %s", type2name(value->bottom_type()->basic_type()));
391 return null_check_common(value, T_LONG);
392 }
393 // Throw an uncommon trap if a given value is __not__ null.
394 // Return the value cast to null, and be clever about dominating checks.
395 Node* null_assert(Node* value, BasicType type = T_OBJECT) {
396 return null_check_common(value, type, true, nullptr, _gvn.type(value)->speculative_always_null());
397 }
398
399 // Check if value is null and abort if it is
400 Node* must_be_not_null(Node* value, bool do_replace_in_map);
598 }
599 // This is the base version which is given alias index
600 // Return the new StoreXNode
601 Node* store_to_memory(Node* ctl, Node* adr, Node* val, BasicType bt,
602 int adr_idx,
603 MemNode::MemOrd,
604 bool require_atomic_access = false,
605 bool unaligned = false,
606 bool mismatched = false,
607 bool unsafe = false,
608 int barrier_data = 0);
609
610 // Perform decorated accesses
611
612 Node* access_store_at(Node* obj, // containing obj
613 Node* adr, // actual address to store val at
614 const TypePtr* adr_type,
615 Node* val,
616 const Type* val_type,
617 BasicType bt,
618 DecoratorSet decorators,
619 bool safe_for_replace = true);
620
621 Node* access_load_at(Node* obj, // containing obj
622 Node* adr, // actual address to load val at
623 const TypePtr* adr_type,
624 const Type* val_type,
625 BasicType bt,
626 DecoratorSet decorators,
627 Node* ctl = nullptr);
628
629 Node* access_load(Node* adr, // actual address to load val at
630 const Type* val_type,
631 BasicType bt,
632 DecoratorSet decorators);
633
634 Node* access_atomic_cmpxchg_val_at(Node* obj,
635 Node* adr,
636 const TypePtr* adr_type,
637 int alias_idx,
638 Node* expected_val,
639 Node* new_val,
640 const Type* value_type,
641 BasicType bt,
642 DecoratorSet decorators);
643
644 Node* access_atomic_cmpxchg_bool_at(Node* obj,
645 Node* adr,
646 const TypePtr* adr_type,
647 int alias_idx,
699 bool return_pc);
700
701 //---------- help for generating calls --------------
702
703 // Do a null check on the receiver as it would happen before the call to
704 // callee (with all arguments still on the stack).
705 Node* null_check_receiver_before_call(ciMethod* callee) {
706 assert(!callee->is_static(), "must be a virtual method");
707 // Callsite signature can be different from actual method being called (i.e _linkTo* sites).
708 // Use callsite signature always.
709 ciMethod* declared_method = method()->get_method_at_bci(bci());
710 const int nargs = declared_method->arg_size();
711 inc_sp(nargs);
712 Node* n = null_check_receiver();
713 dec_sp(nargs);
714 return n;
715 }
716
717 // Fill in argument edges for the call from argument(0), argument(1), ...
718 // (The next step is to call set_edges_for_java_call.)
719 void set_arguments_for_java_call(CallJavaNode* call, bool is_late_inline = false);
720
721 // Fill in non-argument edges for the call.
722 // Transform the call, and update the basics: control, i_o, memory.
723 // (The next step is usually to call set_results_for_java_call.)
724 void set_edges_for_java_call(CallJavaNode* call,
725 bool must_throw = false, bool separate_io_proj = false);
726
727 // Finish up a java call that was started by set_edges_for_java_call.
728 // Call add_exception on any throw arising from the call.
729 // Return the call result (transformed).
730 Node* set_results_for_java_call(CallJavaNode* call, bool separate_io_proj = false, bool deoptimize = false);
731
732 // Similar to set_edges_for_java_call, but simplified for runtime calls.
733 void set_predefined_output_for_runtime_call(Node* call) {
734 set_predefined_output_for_runtime_call(call, nullptr, nullptr);
735 }
736 void set_predefined_output_for_runtime_call(Node* call,
737 Node* keep_mem,
738 const TypePtr* hook_mem);
739 Node* set_predefined_input_for_runtime_call(SafePointNode* call, Node* narrow_mem = nullptr);
838 void merge_memory(Node* new_mem, Node* region, int new_path);
839 void make_slow_call_ex(Node* call, ciInstanceKlass* ex_klass, bool separate_io_proj, bool deoptimize = false);
840
841 // Helper functions to build synchronizations
842 int next_monitor();
843 Node* insert_mem_bar(int opcode, Node* precedent = nullptr);
844 Node* insert_mem_bar_volatile(int opcode, int alias_idx, Node* precedent = nullptr);
845 // Optional 'precedent' is appended as an extra edge, to force ordering.
846 FastLockNode* shared_lock(Node* obj);
847 void shared_unlock(Node* box, Node* obj);
848
849 // helper functions for the fast path/slow path idioms
850 Node* fast_and_slow(Node* in, const Type *result_type, Node* null_result, IfNode* fast_test, Node* fast_result, address slow_call, const TypeFunc *slow_call_type, Node* slow_arg, Klass* ex_klass, Node* slow_result);
851
852 // Generate an instance-of idiom. Used by both the instance-of bytecode
853 // and the reflective instance-of call.
854 Node* gen_instanceof(Node *subobj, Node* superkls, bool safe_for_replace = false);
855
856 // Generate a check-cast idiom. Used by both the check-cast bytecode
857 // and the array-store bytecode
858 Node* gen_checkcast(Node *subobj, Node* superkls, Node* *failure_control = nullptr, bool null_free = false);
859
860 // Inline types
861 Node* inline_type_test(Node* obj, bool is_inline = true);
862 Node* array_lh_test(Node* kls, jint mask, jint val, bool eq = true);
863 Node* flat_array_test(Node* array_or_klass, bool flat = true);
864 Node* null_free_array_test(Node* klass, bool null_free = true);
865 Node* inline_array_null_guard(Node* ary, Node* val, int nargs, bool safe_for_replace = false);
866
867 Node* gen_subtype_check(Node* obj, Node* superklass);
868
869 // Exact type check used for predicted calls and casts.
870 // Rewrites (*casted_receiver) to be casted to the stronger type.
871 // (Caller is responsible for doing replace_in_map.)
872 Node* type_check_receiver(Node* receiver, ciKlass* klass, float prob,
873 Node* *casted_receiver);
874 Node* type_check(Node* recv_klass, const TypeKlassPtr* tklass, float prob);
875
876 // Inexact type check used for predicted calls.
877 Node* subtype_check_receiver(Node* receiver, ciKlass* klass,
878 Node** casted_receiver);
879
880 // implementation of object creation
881 Node* set_output_for_allocation(AllocateNode* alloc,
882 const TypeOopPtr* oop_type,
883 bool deoptimize_on_exception=false);
884 Node* get_layout_helper(Node* klass_node, jint& constant_value);
885 Node* new_instance(Node* klass_node,
886 Node* slow_test = nullptr,
887 Node* *return_size_val = nullptr,
888 bool deoptimize_on_exception = false,
889 InlineTypeNode* inline_type_node = nullptr);
890 Node* new_array(Node* klass_node, Node* count_val, int nargs,
891 Node* *return_size_val = nullptr,
892 bool deoptimize_on_exception = false);
893
894 // java.lang.String helpers
895 Node* load_String_length(Node* str, bool set_ctrl);
896 Node* load_String_value(Node* str, bool set_ctrl);
897 Node* load_String_coder(Node* str, bool set_ctrl);
898 void store_String_value(Node* str, Node* value);
899 void store_String_coder(Node* str, Node* value);
900 Node* capture_memory(const TypePtr* src_type, const TypePtr* dst_type);
901 Node* compress_string(Node* src, const TypeAryPtr* src_type, Node* dst, Node* count);
902 void inflate_string(Node* src, Node* dst, const TypeAryPtr* dst_type, Node* count);
903 void inflate_string_slow(Node* src, Node* dst, Node* start, Node* count);
904
905 // Handy for making control flow
906 IfNode* create_and_map_if(Node* ctrl, Node* tst, float prob, float cnt) {
907 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
908 _gvn.set_type(iff, iff->Value(&_gvn)); // Value may be known at parse-time
909 // Place 'if' on worklist if it will be in graph
910 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
911 return iff;
912 }
913
914 IfNode* create_and_xform_if(Node* ctrl, Node* tst, float prob, float cnt) {
915 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
916 _gvn.transform(iff); // Value may be known at parse-time
917 // Place 'if' on worklist if it will be in graph
918 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
919 return iff;
920 }
921
922 void add_parse_predicates(int nargs = 0);
923 void add_parse_predicate(Deoptimization::DeoptReason reason, int nargs);
924
925 Node* make_constant_from_field(ciField* field, Node* obj);
926 Node* load_mirror_from_klass(Node* klass);
927
928 // Vector API support (implemented in vectorIntrinsics.cpp)
929 Node* box_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool deoptimize_on_exception = false);
930 Node* unbox_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool shuffle_to_vector = false);
931 Node* vector_shift_count(Node* cnt, int shift_op, BasicType bt, int num_elem);
932 };
933
934 // Helper class to support building of control flow branches. Upon
935 // creation the map and sp at bci are cloned and restored upon de-
936 // struction. Typical use:
937 //
938 // { PreserveJVMState pjvms(this);
939 // // code of new branch
940 // }
941 // // here the JVM state at bci is established
942
943 class PreserveJVMState: public StackObj {
944 protected:
945 GraphKit* _kit;
946 #ifdef ASSERT
|