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);
552 // procedure must indicate that the store requires `release'
553 // semantics, if the stored value is an object reference that might
554 // point to a new object and may become externally visible.
555 // Return the new StoreXNode
556 Node* store_to_memory(Node* ctl, Node* adr, Node* val, BasicType bt,
557 MemNode::MemOrd,
558 bool require_atomic_access = false,
559 bool unaligned = false,
560 bool mismatched = false,
561 bool unsafe = false,
562 int barrier_data = 0);
563
564 // Perform decorated accesses
565
566 Node* access_store_at(Node* obj, // containing obj
567 Node* adr, // actual address to store val at
568 const TypePtr* adr_type,
569 Node* val,
570 const Type* val_type,
571 BasicType bt,
572 DecoratorSet decorators);
573
574 Node* access_load_at(Node* obj, // containing obj
575 Node* adr, // actual address to load val at
576 const TypePtr* adr_type,
577 const Type* val_type,
578 BasicType bt,
579 DecoratorSet decorators);
580
581 Node* access_load(Node* adr, // actual address to load val at
582 const Type* val_type,
583 BasicType bt,
584 DecoratorSet decorators);
585
586 Node* access_atomic_cmpxchg_val_at(Node* obj,
587 Node* adr,
588 const TypePtr* adr_type,
589 int alias_idx,
590 Node* expected_val,
591 Node* new_val,
592 const Type* value_type,
593 BasicType bt,
594 DecoratorSet decorators);
595
596 Node* access_atomic_cmpxchg_bool_at(Node* obj,
597 Node* adr,
598 const TypePtr* adr_type,
599 int alias_idx,
612 BasicType bt,
613 DecoratorSet decorators);
614
615 Node* access_atomic_add_at(Node* obj,
616 Node* adr,
617 const TypePtr* adr_type,
618 int alias_idx,
619 Node* new_val,
620 const Type* value_type,
621 BasicType bt,
622 DecoratorSet decorators);
623
624 void access_clone(Node* src, Node* dst, Node* size, bool is_array);
625
626 // Return addressing for an array element.
627 Node* array_element_address(Node* ary, Node* idx, BasicType elembt,
628 // Optional constraint on the array size:
629 const TypeInt* sizetype = nullptr,
630 // Optional control dependency (for example, on range check)
631 Node* ctrl = nullptr);
632
633 // Return a load of array element at idx.
634 Node* load_array_element(Node* ary, Node* idx, const TypeAryPtr* arytype, bool set_ctrl);
635
636 //---------------- Dtrace support --------------------
637 void make_dtrace_method_entry_exit(ciMethod* method, bool is_entry);
638 void make_dtrace_method_entry(ciMethod* method) {
639 make_dtrace_method_entry_exit(method, true);
640 }
641 void make_dtrace_method_exit(ciMethod* method) {
642 make_dtrace_method_entry_exit(method, false);
643 }
644
645 //--------------- stub generation -------------------
646 public:
647 void gen_stub(address C_function,
648 const char *name,
649 int is_fancy_jump,
650 bool pass_tls,
651 bool return_pc);
652
653 //---------- help for generating calls --------------
654
655 // Do a null check on the receiver as it would happen before the call to
656 // callee (with all arguments still on the stack).
657 Node* null_check_receiver_before_call(ciMethod* callee) {
658 assert(!callee->is_static(), "must be a virtual method");
659 // Callsite signature can be different from actual method being called (i.e _linkTo* sites).
660 // Use callsite signature always.
661 ciMethod* declared_method = method()->get_method_at_bci(bci());
662 const int nargs = declared_method->arg_size();
663 inc_sp(nargs);
664 Node* n = null_check_receiver();
665 dec_sp(nargs);
666 return n;
667 }
668
669 // Fill in argument edges for the call from argument(0), argument(1), ...
670 // (The next step is to call set_edges_for_java_call.)
671 void set_arguments_for_java_call(CallJavaNode* call);
672
673 // Fill in non-argument edges for the call.
674 // Transform the call, and update the basics: control, i_o, memory.
675 // (The next step is usually to call set_results_for_java_call.)
676 void set_edges_for_java_call(CallJavaNode* call,
677 bool must_throw = false, bool separate_io_proj = false);
678
679 // Finish up a java call that was started by set_edges_for_java_call.
680 // Call add_exception on any throw arising from the call.
681 // Return the call result (transformed).
682 Node* set_results_for_java_call(CallJavaNode* call, bool separate_io_proj = false, bool deoptimize = false);
683
684 // Similar to set_edges_for_java_call, but simplified for runtime calls.
685 void set_predefined_output_for_runtime_call(Node* call) {
686 set_predefined_output_for_runtime_call(call, nullptr, nullptr);
687 }
688 void set_predefined_output_for_runtime_call(Node* call,
689 Node* keep_mem,
690 const TypePtr* hook_mem);
691 Node* set_predefined_input_for_runtime_call(SafePointNode* call, Node* narrow_mem = nullptr);
781 void merge_memory(Node* new_mem, Node* region, int new_path);
782 void make_slow_call_ex(Node* call, ciInstanceKlass* ex_klass, bool separate_io_proj, bool deoptimize = false);
783
784 // Helper functions to build synchronizations
785 int next_monitor();
786 Node* insert_mem_bar(int opcode, Node* precedent = nullptr);
787 Node* insert_mem_bar_volatile(int opcode, int alias_idx, Node* precedent = nullptr);
788 // Optional 'precedent' is appended as an extra edge, to force ordering.
789 FastLockNode* shared_lock(Node* obj);
790 void shared_unlock(Node* box, Node* obj);
791
792 // helper functions for the fast path/slow path idioms
793 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);
794
795 // Generate an instance-of idiom. Used by both the instance-of bytecode
796 // and the reflective instance-of call.
797 Node* gen_instanceof(Node *subobj, Node* superkls, bool safe_for_replace = false);
798
799 // Generate a check-cast idiom. Used by both the check-cast bytecode
800 // and the array-store bytecode
801 Node* gen_checkcast( Node *subobj, Node* superkls,
802 Node* *failure_control = nullptr );
803
804 Node* gen_subtype_check(Node* obj, Node* superklass);
805
806 // Exact type check used for predicted calls and casts.
807 // Rewrites (*casted_receiver) to be casted to the stronger type.
808 // (Caller is responsible for doing replace_in_map.)
809 Node* type_check_receiver(Node* receiver, ciKlass* klass, float prob,
810 Node* *casted_receiver);
811
812 // Inexact type check used for predicted calls.
813 Node* subtype_check_receiver(Node* receiver, ciKlass* klass,
814 Node** casted_receiver);
815
816 // implementation of object creation
817 Node* set_output_for_allocation(AllocateNode* alloc,
818 const TypeOopPtr* oop_type,
819 bool deoptimize_on_exception=false);
820 Node* get_layout_helper(Node* klass_node, jint& constant_value);
821 Node* new_instance(Node* klass_node,
822 Node* slow_test = nullptr,
823 Node* *return_size_val = nullptr,
824 bool deoptimize_on_exception = false);
825 Node* new_array(Node* klass_node, Node* count_val, int nargs,
826 Node* *return_size_val = nullptr,
827 bool deoptimize_on_exception = false);
828
829 // java.lang.String helpers
830 Node* load_String_length(Node* str, bool set_ctrl);
831 Node* load_String_value(Node* str, bool set_ctrl);
832 Node* load_String_coder(Node* str, bool set_ctrl);
833 void store_String_value(Node* str, Node* value);
834 void store_String_coder(Node* str, Node* value);
835 Node* capture_memory(const TypePtr* src_type, const TypePtr* dst_type);
836 Node* compress_string(Node* src, const TypeAryPtr* src_type, Node* dst, Node* count);
837 void inflate_string(Node* src, Node* dst, const TypeAryPtr* dst_type, Node* count);
838 void inflate_string_slow(Node* src, Node* dst, Node* start, Node* count);
839
840 // Handy for making control flow
841 IfNode* create_and_map_if(Node* ctrl, Node* tst, float prob, float cnt) {
842 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
843 _gvn.set_type(iff, iff->Value(&_gvn)); // Value may be known at parse-time
844 // Place 'if' on worklist if it will be in graph
845 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
846 return iff;
847 }
848
849 IfNode* create_and_xform_if(Node* ctrl, Node* tst, float prob, float cnt) {
850 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
851 _gvn.transform(iff); // Value may be known at parse-time
852 // Place 'if' on worklist if it will be in graph
853 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
854 return iff;
855 }
856
857 void add_parse_predicates(int nargs = 0);
858 void add_parse_predicate(Deoptimization::DeoptReason reason, int nargs);
859
860 Node* make_constant_from_field(ciField* field, Node* obj);
861
862 // Vector API support (implemented in vectorIntrinsics.cpp)
863 Node* box_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool deoptimize_on_exception = false);
864 Node* unbox_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem);
865 Node* vector_shift_count(Node* cnt, int shift_op, BasicType bt, int num_elem);
866 };
867
868 // Helper class to support building of control flow branches. Upon
869 // creation the map and sp at bci are cloned and restored upon de-
870 // struction. Typical use:
871 //
872 // { PreserveJVMState pjvms(this);
873 // // code of new branch
874 // }
875 // // here the JVM state at bci is established
876
877 class PreserveJVMState: public StackObj {
878 protected:
879 GraphKit* _kit;
880 #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);
563 // procedure must indicate that the store requires `release'
564 // semantics, if the stored value is an object reference that might
565 // point to a new object and may become externally visible.
566 // Return the new StoreXNode
567 Node* store_to_memory(Node* ctl, Node* adr, Node* val, BasicType bt,
568 MemNode::MemOrd,
569 bool require_atomic_access = false,
570 bool unaligned = false,
571 bool mismatched = false,
572 bool unsafe = false,
573 int barrier_data = 0);
574
575 // Perform decorated accesses
576
577 Node* access_store_at(Node* obj, // containing obj
578 Node* adr, // actual address to store val at
579 const TypePtr* adr_type,
580 Node* val,
581 const Type* val_type,
582 BasicType bt,
583 DecoratorSet decorators,
584 bool safe_for_replace = true,
585 const InlineTypeNode* vt = nullptr);
586
587 Node* access_load_at(Node* obj, // containing obj
588 Node* adr, // actual address to load val at
589 const TypePtr* adr_type,
590 const Type* val_type,
591 BasicType bt,
592 DecoratorSet decorators,
593 Node* ctl = nullptr);
594
595 Node* access_load(Node* adr, // actual address to load val at
596 const Type* val_type,
597 BasicType bt,
598 DecoratorSet decorators);
599
600 Node* access_atomic_cmpxchg_val_at(Node* obj,
601 Node* adr,
602 const TypePtr* adr_type,
603 int alias_idx,
604 Node* expected_val,
605 Node* new_val,
606 const Type* value_type,
607 BasicType bt,
608 DecoratorSet decorators);
609
610 Node* access_atomic_cmpxchg_bool_at(Node* obj,
611 Node* adr,
612 const TypePtr* adr_type,
613 int alias_idx,
626 BasicType bt,
627 DecoratorSet decorators);
628
629 Node* access_atomic_add_at(Node* obj,
630 Node* adr,
631 const TypePtr* adr_type,
632 int alias_idx,
633 Node* new_val,
634 const Type* value_type,
635 BasicType bt,
636 DecoratorSet decorators);
637
638 void access_clone(Node* src, Node* dst, Node* size, bool is_array);
639
640 // Return addressing for an array element.
641 Node* array_element_address(Node* ary, Node* idx, BasicType elembt,
642 // Optional constraint on the array size:
643 const TypeInt* sizetype = nullptr,
644 // Optional control dependency (for example, on range check)
645 Node* ctrl = nullptr);
646 Node* flat_array_element_address(Node*& array, Node* idx, ciInlineKlass* vk, bool is_null_free,
647 bool is_not_null_free, bool is_atomic);
648
649 // Return a load of array element at idx.
650 Node* load_array_element(Node* ary, Node* idx, const TypeAryPtr* arytype, bool set_ctrl);
651
652 //---------------- Dtrace support --------------------
653 void make_dtrace_method_entry_exit(ciMethod* method, bool is_entry);
654 void make_dtrace_method_entry(ciMethod* method) {
655 make_dtrace_method_entry_exit(method, true);
656 }
657 void make_dtrace_method_exit(ciMethod* method) {
658 make_dtrace_method_entry_exit(method, false);
659 }
660
661 //--------------- stub generation -------------------
662 public:
663 void gen_stub(address C_function,
664 const char *name,
665 int is_fancy_jump,
666 bool pass_tls,
667 bool return_pc);
668
669 //---------- help for generating calls --------------
670
671 // Do a null check on the receiver as it would happen before the call to
672 // callee (with all arguments still on the stack).
673 Node* null_check_receiver_before_call(ciMethod* callee) {
674 assert(!callee->is_static(), "must be a virtual method");
675 // Callsite signature can be different from actual method being called (i.e _linkTo* sites).
676 // Use callsite signature always.
677 ciMethod* declared_method = method()->get_method_at_bci(bci());
678 const int nargs = declared_method->arg_size();
679 inc_sp(nargs);
680 Node* n = null_check_receiver();
681 dec_sp(nargs);
682 return n;
683 }
684
685 // Fill in argument edges for the call from argument(0), argument(1), ...
686 // (The next step is to call set_edges_for_java_call.)
687 void set_arguments_for_java_call(CallJavaNode* call, bool is_late_inline = false);
688
689 // Fill in non-argument edges for the call.
690 // Transform the call, and update the basics: control, i_o, memory.
691 // (The next step is usually to call set_results_for_java_call.)
692 void set_edges_for_java_call(CallJavaNode* call,
693 bool must_throw = false, bool separate_io_proj = false);
694
695 // Finish up a java call that was started by set_edges_for_java_call.
696 // Call add_exception on any throw arising from the call.
697 // Return the call result (transformed).
698 Node* set_results_for_java_call(CallJavaNode* call, bool separate_io_proj = false, bool deoptimize = false);
699
700 // Similar to set_edges_for_java_call, but simplified for runtime calls.
701 void set_predefined_output_for_runtime_call(Node* call) {
702 set_predefined_output_for_runtime_call(call, nullptr, nullptr);
703 }
704 void set_predefined_output_for_runtime_call(Node* call,
705 Node* keep_mem,
706 const TypePtr* hook_mem);
707 Node* set_predefined_input_for_runtime_call(SafePointNode* call, Node* narrow_mem = nullptr);
797 void merge_memory(Node* new_mem, Node* region, int new_path);
798 void make_slow_call_ex(Node* call, ciInstanceKlass* ex_klass, bool separate_io_proj, bool deoptimize = false);
799
800 // Helper functions to build synchronizations
801 int next_monitor();
802 Node* insert_mem_bar(int opcode, Node* precedent = nullptr);
803 Node* insert_mem_bar_volatile(int opcode, int alias_idx, Node* precedent = nullptr);
804 // Optional 'precedent' is appended as an extra edge, to force ordering.
805 FastLockNode* shared_lock(Node* obj);
806 void shared_unlock(Node* box, Node* obj);
807
808 // helper functions for the fast path/slow path idioms
809 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);
810
811 // Generate an instance-of idiom. Used by both the instance-of bytecode
812 // and the reflective instance-of call.
813 Node* gen_instanceof(Node *subobj, Node* superkls, bool safe_for_replace = false);
814
815 // Generate a check-cast idiom. Used by both the check-cast bytecode
816 // and the array-store bytecode
817 Node* gen_checkcast(Node *subobj, Node* superkls, Node* *failure_control = nullptr, bool null_free = false);
818
819 // Inline types
820 Node* mark_word_test(Node* obj, uintptr_t mask_val, bool eq, bool check_lock = true);
821 Node* inline_type_test(Node* obj, bool is_inline = true);
822 Node* flat_array_test(Node* array_or_klass, bool flat = true);
823 Node* null_free_array_test(Node* array, bool null_free = true);
824 Node* null_free_atomic_array_test(Node* array, ciInlineKlass* vk);
825 Node* inline_array_null_guard(Node* ary, Node* val, int nargs, bool safe_for_replace = false);
826
827 Node* gen_subtype_check(Node* obj, Node* superklass);
828
829 // Exact type check used for predicted calls and casts.
830 // Rewrites (*casted_receiver) to be casted to the stronger type.
831 // (Caller is responsible for doing replace_in_map.)
832 Node* type_check_receiver(Node* receiver, ciKlass* klass, float prob,
833 Node* *casted_receiver);
834 Node* type_check(Node* recv_klass, const TypeKlassPtr* tklass, float prob);
835
836 // Inexact type check used for predicted calls.
837 Node* subtype_check_receiver(Node* receiver, ciKlass* klass,
838 Node** casted_receiver);
839
840 // implementation of object creation
841 Node* set_output_for_allocation(AllocateNode* alloc,
842 const TypeOopPtr* oop_type,
843 bool deoptimize_on_exception=false);
844 Node* get_layout_helper(Node* klass_node, jint& constant_value);
845 Node* new_instance(Node* klass_node,
846 Node* slow_test = nullptr,
847 Node* *return_size_val = nullptr,
848 bool deoptimize_on_exception = false,
849 InlineTypeNode* inline_type_node = nullptr);
850 Node* new_array(Node* klass_node, Node* count_val, int nargs,
851 Node* *return_size_val = nullptr,
852 bool deoptimize_on_exception = false,
853 Node* init_val = nullptr);
854
855 // java.lang.String helpers
856 Node* load_String_length(Node* str, bool set_ctrl);
857 Node* load_String_value(Node* str, bool set_ctrl);
858 Node* load_String_coder(Node* str, bool set_ctrl);
859 void store_String_value(Node* str, Node* value);
860 void store_String_coder(Node* str, Node* value);
861 Node* capture_memory(const TypePtr* src_type, const TypePtr* dst_type);
862 Node* compress_string(Node* src, const TypeAryPtr* src_type, Node* dst, Node* count);
863 void inflate_string(Node* src, Node* dst, const TypeAryPtr* dst_type, Node* count);
864 void inflate_string_slow(Node* src, Node* dst, Node* start, Node* count);
865
866 // Handy for making control flow
867 IfNode* create_and_map_if(Node* ctrl, Node* tst, float prob, float cnt) {
868 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
869 _gvn.set_type(iff, iff->Value(&_gvn)); // Value may be known at parse-time
870 // Place 'if' on worklist if it will be in graph
871 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
872 return iff;
873 }
874
875 IfNode* create_and_xform_if(Node* ctrl, Node* tst, float prob, float cnt) {
876 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
877 _gvn.transform(iff); // Value may be known at parse-time
878 // Place 'if' on worklist if it will be in graph
879 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
880 return iff;
881 }
882
883 void add_parse_predicates(int nargs = 0);
884 void add_parse_predicate(Deoptimization::DeoptReason reason, int nargs);
885
886 Node* make_constant_from_field(ciField* field, Node* obj);
887 Node* load_mirror_from_klass(Node* klass);
888
889 // Vector API support (implemented in vectorIntrinsics.cpp)
890 Node* box_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool deoptimize_on_exception = false);
891 Node* unbox_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem);
892 Node* vector_shift_count(Node* cnt, int shift_op, BasicType bt, int num_elem);
893 };
894
895 // Helper class to support building of control flow branches. Upon
896 // creation the map and sp at bci are cloned and restored upon de-
897 // struction. Typical use:
898 //
899 // { PreserveJVMState pjvms(this);
900 // // code of new branch
901 // }
902 // // here the JVM state at bci is established
903
904 class PreserveJVMState: public StackObj {
905 protected:
906 GraphKit* _kit;
907 #ifdef ASSERT
|