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_internal() || !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.)
345 Node* ConvL2I(Node* offset);
346 // Find out the klass of an object.
347 Node* load_object_klass(Node* object);
348 // Find out the length of an array.
349 Node* load_array_length(Node* array);
350 // Cast array allocation's length as narrow as possible.
351 // If replace_length_in_map is true, replace length with CastIINode in map.
352 // This method is invoked after creating/moving ArrayAllocationNode or in load_array_length
353 Node* array_ideal_length(AllocateArrayNode* alloc,
354 const TypeOopPtr* oop_type,
355 bool replace_length_in_map);
356
357
358 // Helper function to do a null pointer check or ZERO check based on type.
359 // Throw an exception if a given value is null.
360 // Return the value cast to not-null.
361 // Be clever about equivalent dominating null checks.
362 Node* null_check_common(Node* value, BasicType type,
363 bool assert_null = false,
364 Node* *null_control = nullptr,
365 bool speculative = false);
366 Node* null_check(Node* value, BasicType type = T_OBJECT) {
367 return null_check_common(value, type, false, nullptr, !_gvn.type(value)->speculative_maybe_null());
368 }
369 Node* null_check_receiver() {
370 assert(argument(0)->bottom_type()->isa_ptr(), "must be");
371 return null_check(argument(0));
372 }
373 Node* zero_check_int(Node* value) {
374 assert(value->bottom_type()->basic_type() == T_INT,
375 "wrong type: %s", type2name(value->bottom_type()->basic_type()));
376 return null_check_common(value, T_INT);
377 }
378 Node* zero_check_long(Node* value) {
379 assert(value->bottom_type()->basic_type() == T_LONG,
380 "wrong type: %s", type2name(value->bottom_type()->basic_type()));
381 return null_check_common(value, T_LONG);
382 }
383 // Throw an uncommon trap if a given value is __not__ null.
384 // Return the value cast to null, and be clever about dominating checks.
385 Node* null_assert(Node* value, BasicType type = T_OBJECT) {
386 return null_check_common(value, type, true, nullptr, _gvn.type(value)->speculative_always_null());
387 }
388
389 // Check if value is null and abort if it is
390 Node* must_be_not_null(Node* value, bool do_replace_in_map);
590 }
591 // This is the base version which is given alias index
592 // Return the new StoreXNode
593 Node* store_to_memory(Node* ctl, Node* adr, Node* val, BasicType bt,
594 int adr_idx,
595 MemNode::MemOrd,
596 bool require_atomic_access = false,
597 bool unaligned = false,
598 bool mismatched = false,
599 bool unsafe = false,
600 int barrier_data = 0);
601
602 // Perform decorated accesses
603
604 Node* access_store_at(Node* obj, // containing obj
605 Node* adr, // actual address to store val at
606 const TypePtr* adr_type,
607 Node* val,
608 const Type* val_type,
609 BasicType bt,
610 DecoratorSet decorators);
611
612 Node* access_load_at(Node* obj, // containing obj
613 Node* adr, // actual address to load val at
614 const TypePtr* adr_type,
615 const Type* val_type,
616 BasicType bt,
617 DecoratorSet decorators);
618
619 Node* access_load(Node* adr, // actual address to load val at
620 const Type* val_type,
621 BasicType bt,
622 DecoratorSet decorators);
623
624 Node* access_atomic_cmpxchg_val_at(Node* obj,
625 Node* adr,
626 const TypePtr* adr_type,
627 int alias_idx,
628 Node* expected_val,
629 Node* new_val,
630 const Type* value_type,
631 BasicType bt,
632 DecoratorSet decorators);
633
634 Node* access_atomic_cmpxchg_bool_at(Node* obj,
635 Node* adr,
636 const TypePtr* adr_type,
637 int alias_idx,
689 bool return_pc);
690
691 //---------- help for generating calls --------------
692
693 // Do a null check on the receiver as it would happen before the call to
694 // callee (with all arguments still on the stack).
695 Node* null_check_receiver_before_call(ciMethod* callee) {
696 assert(!callee->is_static(), "must be a virtual method");
697 // Callsite signature can be different from actual method being called (i.e _linkTo* sites).
698 // Use callsite signature always.
699 ciMethod* declared_method = method()->get_method_at_bci(bci());
700 const int nargs = declared_method->arg_size();
701 inc_sp(nargs);
702 Node* n = null_check_receiver();
703 dec_sp(nargs);
704 return n;
705 }
706
707 // Fill in argument edges for the call from argument(0), argument(1), ...
708 // (The next step is to call set_edges_for_java_call.)
709 void set_arguments_for_java_call(CallJavaNode* call);
710
711 // Fill in non-argument edges for the call.
712 // Transform the call, and update the basics: control, i_o, memory.
713 // (The next step is usually to call set_results_for_java_call.)
714 void set_edges_for_java_call(CallJavaNode* call,
715 bool must_throw = false, bool separate_io_proj = false);
716
717 // Finish up a java call that was started by set_edges_for_java_call.
718 // Call add_exception on any throw arising from the call.
719 // Return the call result (transformed).
720 Node* set_results_for_java_call(CallJavaNode* call, bool separate_io_proj = false, bool deoptimize = false);
721
722 // Similar to set_edges_for_java_call, but simplified for runtime calls.
723 void set_predefined_output_for_runtime_call(Node* call) {
724 set_predefined_output_for_runtime_call(call, nullptr, nullptr);
725 }
726 void set_predefined_output_for_runtime_call(Node* call,
727 Node* keep_mem,
728 const TypePtr* hook_mem);
729 Node* set_predefined_input_for_runtime_call(SafePointNode* call, Node* narrow_mem = nullptr);
828 void merge_memory(Node* new_mem, Node* region, int new_path);
829 void make_slow_call_ex(Node* call, ciInstanceKlass* ex_klass, bool separate_io_proj, bool deoptimize = false);
830
831 // Helper functions to build synchronizations
832 int next_monitor();
833 Node* insert_mem_bar(int opcode, Node* precedent = nullptr);
834 Node* insert_mem_bar_volatile(int opcode, int alias_idx, Node* precedent = nullptr);
835 // Optional 'precedent' is appended as an extra edge, to force ordering.
836 FastLockNode* shared_lock(Node* obj);
837 void shared_unlock(Node* box, Node* obj);
838
839 // helper functions for the fast path/slow path idioms
840 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);
841
842 // Generate an instance-of idiom. Used by both the instance-of bytecode
843 // and the reflective instance-of call.
844 Node* gen_instanceof(Node *subobj, Node* superkls, bool safe_for_replace = false);
845
846 // Generate a check-cast idiom. Used by both the check-cast bytecode
847 // and the array-store bytecode
848 Node* gen_checkcast( Node *subobj, Node* superkls,
849 Node* *failure_control = nullptr );
850
851 Node* gen_subtype_check(Node* obj, Node* superklass);
852
853 // Exact type check used for predicted calls and casts.
854 // Rewrites (*casted_receiver) to be casted to the stronger type.
855 // (Caller is responsible for doing replace_in_map.)
856 Node* type_check_receiver(Node* receiver, ciKlass* klass, float prob,
857 Node* *casted_receiver);
858
859 // Inexact type check used for predicted calls.
860 Node* subtype_check_receiver(Node* receiver, ciKlass* klass,
861 Node** casted_receiver);
862
863 // implementation of object creation
864 Node* set_output_for_allocation(AllocateNode* alloc,
865 const TypeOopPtr* oop_type,
866 bool deoptimize_on_exception=false);
867 Node* get_layout_helper(Node* klass_node, jint& constant_value);
868 Node* new_instance(Node* klass_node,
869 Node* slow_test = nullptr,
870 Node* *return_size_val = nullptr,
871 bool deoptimize_on_exception = false);
872 Node* new_array(Node* klass_node, Node* count_val, int nargs,
873 Node* *return_size_val = nullptr,
874 bool deoptimize_on_exception = false);
875
876 // java.lang.String helpers
877 Node* load_String_length(Node* str, bool set_ctrl);
878 Node* load_String_value(Node* str, bool set_ctrl);
879 Node* load_String_coder(Node* str, bool set_ctrl);
880 void store_String_value(Node* str, Node* value);
881 void store_String_coder(Node* str, Node* value);
882 Node* capture_memory(const TypePtr* src_type, const TypePtr* dst_type);
883 Node* compress_string(Node* src, const TypeAryPtr* src_type, Node* dst, Node* count);
884 void inflate_string(Node* src, Node* dst, const TypeAryPtr* dst_type, Node* count);
885 void inflate_string_slow(Node* src, Node* dst, Node* start, Node* count);
886
887 // Handy for making control flow
888 IfNode* create_and_map_if(Node* ctrl, Node* tst, float prob, float cnt) {
889 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
890 _gvn.set_type(iff, iff->Value(&_gvn)); // Value may be known at parse-time
891 // Place 'if' on worklist if it will be in graph
892 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
893 return iff;
894 }
895
896 IfNode* create_and_xform_if(Node* ctrl, Node* tst, float prob, float cnt) {
897 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
898 _gvn.transform(iff); // Value may be known at parse-time
899 // Place 'if' on worklist if it will be in graph
900 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
901 return iff;
902 }
903
904 void add_parse_predicates(int nargs = 0);
905 void add_parse_predicate(Deoptimization::DeoptReason reason, int nargs);
906
907 Node* make_constant_from_field(ciField* field, Node* obj);
908
909 // Vector API support (implemented in vectorIntrinsics.cpp)
910 Node* box_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool deoptimize_on_exception = false);
911 Node* unbox_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool shuffle_to_vector = false);
912 Node* vector_shift_count(Node* cnt, int shift_op, BasicType bt, int num_elem);
913 };
914
915 // Helper class to support building of control flow branches. Upon
916 // creation the map and sp at bci are cloned and restored upon de-
917 // struction. Typical use:
918 //
919 // { PreserveJVMState pjvms(this);
920 // // code of new branch
921 // }
922 // // here the JVM state at bci is established
923
924 class PreserveJVMState: public StackObj {
925 protected:
926 GraphKit* _kit;
927 #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_internal() || !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.)
356 Node* ConvL2I(Node* offset);
357 // Find out the klass of an object.
358 Node* load_object_klass(Node* object);
359 // Find out the length of an array.
360 Node* load_array_length(Node* array);
361 // Cast array allocation's length as narrow as possible.
362 // If replace_length_in_map is true, replace length with CastIINode in map.
363 // This method is invoked after creating/moving ArrayAllocationNode or in load_array_length
364 Node* array_ideal_length(AllocateArrayNode* alloc,
365 const TypeOopPtr* oop_type,
366 bool replace_length_in_map);
367
368
369 // Helper function to do a null pointer check or ZERO check based on type.
370 // Throw an exception if a given value is null.
371 // Return the value cast to not-null.
372 // Be clever about equivalent dominating null checks.
373 Node* null_check_common(Node* value, BasicType type,
374 bool assert_null = false,
375 Node* *null_control = nullptr,
376 bool speculative = false,
377 bool is_init_check = false);
378 Node* null_check(Node* value, BasicType type = T_OBJECT) {
379 return null_check_common(value, type, false, nullptr, !_gvn.type(value)->speculative_maybe_null());
380 }
381 Node* null_check_receiver() {
382 return null_check(argument(0));
383 }
384 Node* zero_check_int(Node* value) {
385 assert(value->bottom_type()->basic_type() == T_INT,
386 "wrong type: %s", type2name(value->bottom_type()->basic_type()));
387 return null_check_common(value, T_INT);
388 }
389 Node* zero_check_long(Node* value) {
390 assert(value->bottom_type()->basic_type() == T_LONG,
391 "wrong type: %s", type2name(value->bottom_type()->basic_type()));
392 return null_check_common(value, T_LONG);
393 }
394 // Throw an uncommon trap if a given value is __not__ null.
395 // Return the value cast to null, and be clever about dominating checks.
396 Node* null_assert(Node* value, BasicType type = T_OBJECT) {
397 return null_check_common(value, type, true, nullptr, _gvn.type(value)->speculative_always_null());
398 }
399
400 // Check if value is null and abort if it is
401 Node* must_be_not_null(Node* value, bool do_replace_in_map);
601 }
602 // This is the base version which is given alias index
603 // Return the new StoreXNode
604 Node* store_to_memory(Node* ctl, Node* adr, Node* val, BasicType bt,
605 int adr_idx,
606 MemNode::MemOrd,
607 bool require_atomic_access = false,
608 bool unaligned = false,
609 bool mismatched = false,
610 bool unsafe = false,
611 int barrier_data = 0);
612
613 // Perform decorated accesses
614
615 Node* access_store_at(Node* obj, // containing obj
616 Node* adr, // actual address to store val at
617 const TypePtr* adr_type,
618 Node* val,
619 const Type* val_type,
620 BasicType bt,
621 DecoratorSet decorators,
622 bool safe_for_replace = true);
623
624 Node* access_load_at(Node* obj, // containing obj
625 Node* adr, // actual address to load val at
626 const TypePtr* adr_type,
627 const Type* val_type,
628 BasicType bt,
629 DecoratorSet decorators,
630 Node* ctl = nullptr);
631
632 Node* access_load(Node* adr, // actual address to load val at
633 const Type* val_type,
634 BasicType bt,
635 DecoratorSet decorators);
636
637 Node* access_atomic_cmpxchg_val_at(Node* obj,
638 Node* adr,
639 const TypePtr* adr_type,
640 int alias_idx,
641 Node* expected_val,
642 Node* new_val,
643 const Type* value_type,
644 BasicType bt,
645 DecoratorSet decorators);
646
647 Node* access_atomic_cmpxchg_bool_at(Node* obj,
648 Node* adr,
649 const TypePtr* adr_type,
650 int alias_idx,
702 bool return_pc);
703
704 //---------- help for generating calls --------------
705
706 // Do a null check on the receiver as it would happen before the call to
707 // callee (with all arguments still on the stack).
708 Node* null_check_receiver_before_call(ciMethod* callee) {
709 assert(!callee->is_static(), "must be a virtual method");
710 // Callsite signature can be different from actual method being called (i.e _linkTo* sites).
711 // Use callsite signature always.
712 ciMethod* declared_method = method()->get_method_at_bci(bci());
713 const int nargs = declared_method->arg_size();
714 inc_sp(nargs);
715 Node* n = null_check_receiver();
716 dec_sp(nargs);
717 return n;
718 }
719
720 // Fill in argument edges for the call from argument(0), argument(1), ...
721 // (The next step is to call set_edges_for_java_call.)
722 void set_arguments_for_java_call(CallJavaNode* call, bool is_late_inline = false);
723
724 // Fill in non-argument edges for the call.
725 // Transform the call, and update the basics: control, i_o, memory.
726 // (The next step is usually to call set_results_for_java_call.)
727 void set_edges_for_java_call(CallJavaNode* call,
728 bool must_throw = false, bool separate_io_proj = false);
729
730 // Finish up a java call that was started by set_edges_for_java_call.
731 // Call add_exception on any throw arising from the call.
732 // Return the call result (transformed).
733 Node* set_results_for_java_call(CallJavaNode* call, bool separate_io_proj = false, bool deoptimize = false);
734
735 // Similar to set_edges_for_java_call, but simplified for runtime calls.
736 void set_predefined_output_for_runtime_call(Node* call) {
737 set_predefined_output_for_runtime_call(call, nullptr, nullptr);
738 }
739 void set_predefined_output_for_runtime_call(Node* call,
740 Node* keep_mem,
741 const TypePtr* hook_mem);
742 Node* set_predefined_input_for_runtime_call(SafePointNode* call, Node* narrow_mem = nullptr);
841 void merge_memory(Node* new_mem, Node* region, int new_path);
842 void make_slow_call_ex(Node* call, ciInstanceKlass* ex_klass, bool separate_io_proj, bool deoptimize = false);
843
844 // Helper functions to build synchronizations
845 int next_monitor();
846 Node* insert_mem_bar(int opcode, Node* precedent = nullptr);
847 Node* insert_mem_bar_volatile(int opcode, int alias_idx, Node* precedent = nullptr);
848 // Optional 'precedent' is appended as an extra edge, to force ordering.
849 FastLockNode* shared_lock(Node* obj);
850 void shared_unlock(Node* box, Node* obj);
851
852 // helper functions for the fast path/slow path idioms
853 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);
854
855 // Generate an instance-of idiom. Used by both the instance-of bytecode
856 // and the reflective instance-of call.
857 Node* gen_instanceof(Node *subobj, Node* superkls, bool safe_for_replace = false);
858
859 // Generate a check-cast idiom. Used by both the check-cast bytecode
860 // and the array-store bytecode
861 Node* gen_checkcast(Node *subobj, Node* superkls, Node* *failure_control = nullptr, bool null_free = false);
862
863 // Inline types
864 Node* mark_word_test(Node* obj, uintptr_t mask_val, bool eq, bool check_lock = true);
865 Node* inline_type_test(Node* obj, bool is_inline = true);
866 Node* flat_array_test(Node* array_or_klass, bool flat = true);
867 Node* null_free_array_test(Node* array, bool null_free = true);
868 Node* inline_array_null_guard(Node* ary, Node* val, int nargs, bool safe_for_replace = false);
869
870 Node* gen_subtype_check(Node* obj, Node* superklass);
871
872 // Exact type check used for predicted calls and casts.
873 // Rewrites (*casted_receiver) to be casted to the stronger type.
874 // (Caller is responsible for doing replace_in_map.)
875 Node* type_check_receiver(Node* receiver, ciKlass* klass, float prob,
876 Node* *casted_receiver);
877 Node* type_check(Node* recv_klass, const TypeKlassPtr* tklass, float prob);
878
879 // Inexact type check used for predicted calls.
880 Node* subtype_check_receiver(Node* receiver, ciKlass* klass,
881 Node** casted_receiver);
882
883 // implementation of object creation
884 Node* set_output_for_allocation(AllocateNode* alloc,
885 const TypeOopPtr* oop_type,
886 bool deoptimize_on_exception=false);
887 Node* get_layout_helper(Node* klass_node, jint& constant_value);
888 Node* new_instance(Node* klass_node,
889 Node* slow_test = nullptr,
890 Node* *return_size_val = nullptr,
891 bool deoptimize_on_exception = false,
892 InlineTypeNode* inline_type_node = nullptr);
893 Node* new_array(Node* klass_node, Node* count_val, int nargs,
894 Node* *return_size_val = nullptr,
895 bool deoptimize_on_exception = false);
896
897 // java.lang.String helpers
898 Node* load_String_length(Node* str, bool set_ctrl);
899 Node* load_String_value(Node* str, bool set_ctrl);
900 Node* load_String_coder(Node* str, bool set_ctrl);
901 void store_String_value(Node* str, Node* value);
902 void store_String_coder(Node* str, Node* value);
903 Node* capture_memory(const TypePtr* src_type, const TypePtr* dst_type);
904 Node* compress_string(Node* src, const TypeAryPtr* src_type, Node* dst, Node* count);
905 void inflate_string(Node* src, Node* dst, const TypeAryPtr* dst_type, Node* count);
906 void inflate_string_slow(Node* src, Node* dst, Node* start, Node* count);
907
908 // Handy for making control flow
909 IfNode* create_and_map_if(Node* ctrl, Node* tst, float prob, float cnt) {
910 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
911 _gvn.set_type(iff, iff->Value(&_gvn)); // Value may be known at parse-time
912 // Place 'if' on worklist if it will be in graph
913 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
914 return iff;
915 }
916
917 IfNode* create_and_xform_if(Node* ctrl, Node* tst, float prob, float cnt) {
918 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
919 _gvn.transform(iff); // Value may be known at parse-time
920 // Place 'if' on worklist if it will be in graph
921 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
922 return iff;
923 }
924
925 void add_parse_predicates(int nargs = 0);
926 void add_parse_predicate(Deoptimization::DeoptReason reason, int nargs);
927
928 Node* make_constant_from_field(ciField* field, Node* obj);
929 Node* load_mirror_from_klass(Node* klass);
930
931 // Vector API support (implemented in vectorIntrinsics.cpp)
932 Node* box_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool deoptimize_on_exception = false);
933 Node* unbox_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool shuffle_to_vector = false);
934 Node* vector_shift_count(Node* cnt, int shift_op, BasicType bt, int num_elem);
935 };
936
937 // Helper class to support building of control flow branches. Upon
938 // creation the map and sp at bci are cloned and restored upon de-
939 // struction. Typical use:
940 //
941 // { PreserveJVMState pjvms(this);
942 // // code of new branch
943 // }
944 // // here the JVM state at bci is established
945
946 class PreserveJVMState: public StackObj {
947 protected:
948 GraphKit* _kit;
949 #ifdef ASSERT
|