28 #include "asm/codeBuffer.hpp"
29 #include "ci/compilerInterface.hpp"
30 #include "code/debugInfoRec.hpp"
31 #include "compiler/cHeapStringHolder.hpp"
32 #include "compiler/compileBroker.hpp"
33 #include "compiler/compiler_globals.hpp"
34 #include "compiler/compilerEvent.hpp"
35 #include "libadt/dict.hpp"
36 #include "libadt/vectset.hpp"
37 #include "memory/resourceArea.hpp"
38 #include "oops/methodData.hpp"
39 #include "opto/idealGraphPrinter.hpp"
40 #include "opto/phase.hpp"
41 #include "opto/phasetype.hpp"
42 #include "opto/printinlining.hpp"
43 #include "opto/regmask.hpp"
44 #include "runtime/deoptimization.hpp"
45 #include "runtime/sharedRuntime.hpp"
46 #include "runtime/timerTrace.hpp"
47 #include "runtime/vmThread.hpp"
48 #include "utilities/ticks.hpp"
49 #include "utilities/vmEnums.hpp"
50
51 class AbstractLockNode;
52 class AddPNode;
53 class Block;
54 class Bundle;
55 class CallGenerator;
56 class CallStaticJavaNode;
57 class CloneMap;
58 class CompilationFailureInfo;
59 class ConnectionGraph;
60 class IdealGraphPrinter;
61 class InlineTree;
62 class Matcher;
63 class MachConstantNode;
64 class MachConstantBaseNode;
65 class MachNode;
66 class MachOper;
67 class MachSafePointNode;
68 class Node;
69 class Node_Array;
70 class Node_List;
71 class Node_Notes;
72 class NodeHash;
73 class NodeCloneInfo;
74 class OpaqueTemplateAssertionPredicateNode;
75 class OptoReg;
79 class PhaseIterGVN;
80 class PhaseRegAlloc;
81 class PhaseCCP;
82 class PhaseOutput;
83 class RootNode;
84 class relocInfo;
85 class StartNode;
86 class SafePointNode;
87 class JVMState;
88 class Type;
89 class TypeInt;
90 class TypeInteger;
91 class TypeKlassPtr;
92 class TypePtr;
93 class TypeOopPtr;
94 class TypeFunc;
95 class TypeVect;
96 class Type_Array;
97 class Unique_Node_List;
98 class UnstableIfTrap;
99 class nmethod;
100 class Node_Stack;
101 struct Final_Reshape_Counts;
102 class VerifyMeetResult;
103
104 enum LoopOptsMode {
105 LoopOptsDefault,
106 LoopOptsNone,
107 LoopOptsMaxUnroll,
108 LoopOptsShenandoahExpand,
109 LoopOptsSkipSplitIf,
110 LoopOptsVerify
111 };
112
113 // The type of all node counts and indexes.
114 // It must hold at least 16 bits, but must also be fast to load and store.
115 // This type, if less than 32 bits, could limit the number of possible nodes.
116 // (To make this type platform-specific, move to globalDefinitions_xxx.hpp.)
117 typedef unsigned int node_idx_t;
118
315 int _max_inline_size; // Max inline size for this compilation
316 int _freq_inline_size; // Max hot method inline size for this compilation
317 int _fixed_slots; // count of frame slots not allocated by the register
318 // allocator i.e. locks, original deopt pc, etc.
319 uintx _max_node_limit; // Max unique node count during a single compilation.
320
321 bool _post_loop_opts_phase; // Loop opts are finished.
322 bool _merge_stores_phase; // Phase for merging stores, after post loop opts phase.
323 bool _allow_macro_nodes; // True if we allow creation of macro nodes.
324
325 int _major_progress; // Count of something big happening
326 bool _inlining_progress; // progress doing incremental inlining?
327 bool _inlining_incrementally;// Are we doing incremental inlining (post parse)
328 bool _do_cleanup; // Cleanup is needed before proceeding with incremental inlining
329 bool _has_loops; // True if the method _may_ have some loops
330 bool _has_split_ifs; // True if the method _may_ have some split-if
331 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
332 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
333 bool _has_boxed_value; // True if a boxed object is allocated
334 bool _has_reserved_stack_access; // True if the method or an inlined method is annotated with ReservedStackAccess
335 uint _max_vector_size; // Maximum size of generated vectors
336 bool _clear_upper_avx; // Clear upper bits of ymm registers using vzeroupper
337 uint _trap_hist[trapHistLength]; // Cumulative traps
338 bool _trap_can_recompile; // Have we emitted a recompiling trap?
339 uint _decompile_count; // Cumulative decompilation counts.
340 bool _do_inlining; // True if we intend to do inlining
341 bool _do_scheduling; // True if we intend to do scheduling
342 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
343 bool _do_vector_loop; // True if allowed to execute loop in parallel iterations
344 bool _use_cmove; // True if CMove should be used without profitability analysis
345 bool _do_aliasing; // True if we intend to do aliasing
346 bool _print_assembly; // True if we should dump assembly code for this compilation
347 bool _print_inlining; // True if we should print inlining for this compilation
348 bool _print_intrinsics; // True if we should print intrinsics for this compilation
349 #ifndef PRODUCT
350 uint _phase_counter; // Counter for the number of already printed phases
351 uint _igv_idx; // Counter for IGV node identifiers
352 uint _igv_phase_iter[PHASE_NUM_TYPES]; // Counters for IGV phase iterations
353 bool _trace_opto_output;
354 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
355 #endif
356 bool _has_irreducible_loop; // Found irreducible loops
357 bool _has_monitors; // Metadata transfered to nmethod to enable Continuations lock-detection fastpath
358 bool _has_scoped_access; // For shared scope closure
359 bool _clinit_barrier_on_entry; // True if clinit barrier is needed on nmethod entry
360 int _loop_opts_cnt; // loop opts round
361 uint _stress_seed; // Seed for stress testing
362
363 // Compilation environment.
364 Arena _comp_arena; // Arena with lifetime equivalent to Compile
365 void* _barrier_set_state; // Potential GC barrier state for Compile
366 ciEnv* _env; // CI interface
367 DirectiveSet* _directive; // Compiler directive
368 CompileLog* _log; // from CompilerThread
369 CHeapStringHolder _failure_reason; // for record_failure/failing pattern
370 CompilationFailureInfo* _first_failure_details; // Details for the first failure happening during compilation
371 GrowableArray<CallGenerator*> _intrinsics; // List of intrinsics.
372 GrowableArray<Node*> _macro_nodes; // List of nodes which need to be expanded before matching.
373 GrowableArray<ParsePredicateNode*> _parse_predicates; // List of Parse Predicates.
374 // List of OpaqueTemplateAssertionPredicateNode nodes for Template Assertion Predicates which can be seen as list
375 // of Template Assertion Predicates themselves.
376 GrowableArray<OpaqueTemplateAssertionPredicateNode*> _template_assertion_predicate_opaques;
377 GrowableArray<Node*> _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
378 GrowableArray<Node*> _for_post_loop_igvn; // List of nodes for IGVN after loop opts are over
379 GrowableArray<Node*> _for_merge_stores_igvn; // List of nodes for IGVN merge stores
380 GrowableArray<UnstableIfTrap*> _unstable_if_traps; // List of ifnodes after IGVN
381 GrowableArray<Node_List*> _coarsened_locks; // List of coarsened Lock and Unlock nodes
382 ConnectionGraph* _congraph;
383 #ifndef PRODUCT
384 IdealGraphPrinter* _igv_printer;
385 static IdealGraphPrinter* _debug_file_printer;
386 static IdealGraphPrinter* _debug_network_printer;
387 #endif
388
389
390 // Node management
391 uint _unique; // Counter for unique Node indices
392 uint _dead_node_count; // Number of dead nodes; VectorSet::Size() is O(N).
393 // So use this to keep count and make the call O(1).
394 VectorSet _dead_node_list; // Set of dead nodes
395 DEBUG_ONLY(Unique_Node_List* _modified_nodes;) // List of nodes which inputs were modified
396 DEBUG_ONLY(bool _phase_optimize_finished;) // Used for live node verification while creating new nodes
397
398 DEBUG_ONLY(bool _phase_verify_ideal_loop;) // Are we in PhaseIdealLoop verification?
592 int do_cleanup() const { return _do_cleanup; }
593 void set_major_progress() { _major_progress++; }
594 void restore_major_progress(int progress) { _major_progress += progress; }
595 void clear_major_progress() { _major_progress = 0; }
596 int max_inline_size() const { return _max_inline_size; }
597 void set_freq_inline_size(int n) { _freq_inline_size = n; }
598 int freq_inline_size() const { return _freq_inline_size; }
599 void set_max_inline_size(int n) { _max_inline_size = n; }
600 bool has_loops() const { return _has_loops; }
601 void set_has_loops(bool z) { _has_loops = z; }
602 bool has_split_ifs() const { return _has_split_ifs; }
603 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
604 bool has_unsafe_access() const { return _has_unsafe_access; }
605 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
606 bool has_stringbuilder() const { return _has_stringbuilder; }
607 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
608 bool has_boxed_value() const { return _has_boxed_value; }
609 void set_has_boxed_value(bool z) { _has_boxed_value = z; }
610 bool has_reserved_stack_access() const { return _has_reserved_stack_access; }
611 void set_has_reserved_stack_access(bool z) { _has_reserved_stack_access = z; }
612 uint max_vector_size() const { return _max_vector_size; }
613 void set_max_vector_size(uint s) { _max_vector_size = s; }
614 bool clear_upper_avx() const { return _clear_upper_avx; }
615 void set_clear_upper_avx(bool s) { _clear_upper_avx = s; }
616 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
617 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
618 bool trap_can_recompile() const { return _trap_can_recompile; }
619 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
620 uint decompile_count() const { return _decompile_count; }
621 void set_decompile_count(uint c) { _decompile_count = c; }
622 bool allow_range_check_smearing() const;
623 bool do_inlining() const { return _do_inlining; }
624 void set_do_inlining(bool z) { _do_inlining = z; }
625 bool do_scheduling() const { return _do_scheduling; }
626 void set_do_scheduling(bool z) { _do_scheduling = z; }
627 bool do_freq_based_layout() const{ return _do_freq_based_layout; }
628 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
629 bool do_vector_loop() const { return _do_vector_loop; }
630 void set_do_vector_loop(bool z) { _do_vector_loop = z; }
631 bool use_cmove() const { return _use_cmove; }
632 void set_use_cmove(bool z) { _use_cmove = z; }
633 bool do_aliasing() const { return _do_aliasing; }
634 bool print_assembly() const { return _print_assembly; }
635 void set_print_assembly(bool z) { _print_assembly = z; }
636 bool print_inlining() const { return _print_inlining; }
637 void set_print_inlining(bool z) { _print_inlining = z; }
638 bool print_intrinsics() const { return _print_intrinsics; }
639 void set_print_intrinsics(bool z) { _print_intrinsics = z; }
640 uint max_node_limit() const { return (uint)_max_node_limit; }
641 void set_max_node_limit(uint n) { _max_node_limit = n; }
642 bool clinit_barrier_on_entry() { return _clinit_barrier_on_entry; }
643 void set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
644 bool has_monitors() const { return _has_monitors; }
645 void set_has_monitors(bool v) { _has_monitors = v; }
646 bool has_scoped_access() const { return _has_scoped_access; }
647 void set_has_scoped_access(bool v) { _has_scoped_access = v; }
648
649 // check the CompilerOracle for special behaviours for this compile
650 bool method_has_option(CompileCommandEnum option) const {
651 return method() != nullptr && method()->has_option(option);
652 }
653
654 #ifndef PRODUCT
655 uint next_igv_idx() { return _igv_idx++; }
656 bool trace_opto_output() const { return _trace_opto_output; }
657 void print_phase(const char* phase_name);
658 void print_ideal_ir(const char* phase_name);
659 bool should_print_ideal() const { return _directive->PrintIdealOption; }
660 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
661 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
662 int _in_dump_cnt; // Required for dumping ir nodes.
663 #endif
755 bool coarsened_locks_consistent();
756 void mark_unbalanced_boxes() const;
757
758 bool post_loop_opts_phase() { return _post_loop_opts_phase; }
759 void set_post_loop_opts_phase() { _post_loop_opts_phase = true; }
760 void reset_post_loop_opts_phase() { _post_loop_opts_phase = false; }
761
762 #ifdef ASSERT
763 bool phase_verify_ideal_loop() const { return _phase_verify_ideal_loop; }
764 void set_phase_verify_ideal_loop() { _phase_verify_ideal_loop = true; }
765 void reset_phase_verify_ideal_loop() { _phase_verify_ideal_loop = false; }
766 #endif
767
768 bool allow_macro_nodes() { return _allow_macro_nodes; }
769 void reset_allow_macro_nodes() { _allow_macro_nodes = false; }
770
771 void record_for_post_loop_opts_igvn(Node* n);
772 void remove_from_post_loop_opts_igvn(Node* n);
773 void process_for_post_loop_opts_igvn(PhaseIterGVN& igvn);
774
775 void record_unstable_if_trap(UnstableIfTrap* trap);
776 bool remove_unstable_if_trap(CallStaticJavaNode* unc, bool yield);
777 void remove_useless_unstable_if_traps(Unique_Node_List &useful);
778 void process_for_unstable_if_traps(PhaseIterGVN& igvn);
779
780 bool merge_stores_phase() { return _merge_stores_phase; }
781 void set_merge_stores_phase() { _merge_stores_phase = true; }
782 void record_for_merge_stores_igvn(Node* n);
783 void remove_from_merge_stores_igvn(Node* n);
784 void process_for_merge_stores_igvn(PhaseIterGVN& igvn);
785
786 void shuffle_macro_nodes();
787 void sort_macro_nodes();
788
789 void mark_parse_predicate_nodes_useless(PhaseIterGVN& igvn);
790
791 // Are there candidate expensive nodes for optimization?
792 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
793 // Check whether n1 and n2 are similar
794 static int cmp_expensive_nodes(Node* n1, Node* n2);
937 Arena* type_arena() { return _type_arena; }
938 Dict* type_dict() { return _type_dict; }
939 size_t type_last_size() { return _type_last_size; }
940 int num_alias_types() { return _num_alias_types; }
941
942 void init_type_arena() { _type_arena = &_Compile_types; }
943 void set_type_arena(Arena* a) { _type_arena = a; }
944 void set_type_dict(Dict* d) { _type_dict = d; }
945 void set_type_last_size(size_t sz) { _type_last_size = sz; }
946
947 const TypeFunc* last_tf(ciMethod* m) {
948 return (m == _last_tf_m) ? _last_tf : nullptr;
949 }
950 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
951 assert(m != nullptr || tf == nullptr, "");
952 _last_tf_m = m;
953 _last_tf = tf;
954 }
955
956 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
957 AliasType* alias_type(const TypePtr* adr_type, ciField* field = nullptr) { return find_alias_type(adr_type, false, field); }
958 bool have_alias_type(const TypePtr* adr_type);
959 AliasType* alias_type(ciField* field);
960
961 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); }
962 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
963 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
964
965 // Building nodes
966 void rethrow_exceptions(JVMState* jvms);
967 void return_values(JVMState* jvms);
968 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
969
970 // Decide how to build a call.
971 // The profile factor is a discount to apply to this site's interp. profile.
972 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch,
973 JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = nullptr,
974 bool allow_intrinsics = true);
975 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
976 return should_delay_string_inlining(call_method, jvms) ||
977 should_delay_boxing_inlining(call_method, jvms) ||
978 should_delay_vector_inlining(call_method, jvms);
979 }
980 bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
981 bool should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms);
1184 // Number of outgoing stack slots killed above the out_preserve_stack_slots
1185 // for calls to C. Supports the var-args backing area for register parms.
1186 uint varargs_C_out_slots_killed() const;
1187
1188 // Number of Stack Slots consumed by a synchronization entry
1189 int sync_stack_slots() const;
1190
1191 // Compute the name of old_SP. See <arch>.ad for frame layout.
1192 OptoReg::Name compute_old_SP();
1193
1194 private:
1195 // Phase control:
1196 void Init(bool aliasing); // Prepare for a single compilation
1197 void Optimize(); // Given a graph, optimize it
1198 void Code_Gen(); // Generate code from a graph
1199
1200 // Management of the AliasType table.
1201 void grow_alias_types();
1202 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1203 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1204 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field);
1205
1206 void verify_top(Node*) const PRODUCT_RETURN;
1207
1208 // Intrinsic setup.
1209 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
1210 int intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found); // helper
1211 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
1212 void register_intrinsic(CallGenerator* cg); // update fn
1213
1214 #ifndef PRODUCT
1215 static juint _intrinsic_hist_count[];
1216 static jubyte _intrinsic_hist_flags[];
1217 #endif
1218 // Function calls made by the public function final_graph_reshaping.
1219 // No need to be made public as they are not called elsewhere.
1220 void final_graph_reshaping_impl(Node *n, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1221 void final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop, Unique_Node_List& dead_nodes);
1222 void final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1223 void handle_div_mod_op(Node* n, BasicType bt, bool is_unsigned);
1224
1274 // End-of-run dumps.
1275 static void print_statistics() PRODUCT_RETURN;
1276
1277 // Verify ADLC assumptions during startup
1278 static void adlc_verification() PRODUCT_RETURN;
1279
1280 // Definitions of pd methods
1281 static void pd_compiler2_init();
1282
1283 // Static parse-time type checking logic for gen_subtype_check:
1284 enum SubTypeCheckResult { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test };
1285 SubTypeCheckResult static_subtype_check(const TypeKlassPtr* superk, const TypeKlassPtr* subk, bool skip = StressReflectiveCode);
1286
1287 static Node* conv_I2X_index(PhaseGVN* phase, Node* offset, const TypeInt* sizetype,
1288 // Optional control dependency (for example, on range check)
1289 Node* ctrl = nullptr);
1290
1291 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check)
1292 static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl, bool carry_dependency = false);
1293
1294 // Auxiliary methods for randomized fuzzing/stressing
1295 int random();
1296 bool randomized_select(int count);
1297
1298 // seed random number generation and log the seed for repeatability.
1299 void initialize_stress_seed(const DirectiveSet* directive);
1300
1301 // supporting clone_map
1302 CloneMap& clone_map();
1303 void set_clone_map(Dict* d);
1304
1305 bool needs_clinit_barrier(ciField* ik, ciMethod* accessing_method);
1306 bool needs_clinit_barrier(ciMethod* ik, ciMethod* accessing_method);
1307 bool needs_clinit_barrier(ciInstanceKlass* ik, ciMethod* accessing_method);
1308
1309 #ifdef ASSERT
1310 VerifyMeetResult* _type_verify;
1311 void set_exception_backedge() { _exception_backedge = true; }
1312 bool has_exception_backedge() const { return _exception_backedge; }
1313 #endif
1314
|
28 #include "asm/codeBuffer.hpp"
29 #include "ci/compilerInterface.hpp"
30 #include "code/debugInfoRec.hpp"
31 #include "compiler/cHeapStringHolder.hpp"
32 #include "compiler/compileBroker.hpp"
33 #include "compiler/compiler_globals.hpp"
34 #include "compiler/compilerEvent.hpp"
35 #include "libadt/dict.hpp"
36 #include "libadt/vectset.hpp"
37 #include "memory/resourceArea.hpp"
38 #include "oops/methodData.hpp"
39 #include "opto/idealGraphPrinter.hpp"
40 #include "opto/phase.hpp"
41 #include "opto/phasetype.hpp"
42 #include "opto/printinlining.hpp"
43 #include "opto/regmask.hpp"
44 #include "runtime/deoptimization.hpp"
45 #include "runtime/sharedRuntime.hpp"
46 #include "runtime/timerTrace.hpp"
47 #include "runtime/vmThread.hpp"
48 #include "utilities/growableArray.hpp"
49 #include "utilities/ticks.hpp"
50 #include "utilities/vmEnums.hpp"
51
52 class AbstractLockNode;
53 class AddPNode;
54 class Block;
55 class Bundle;
56 class CallGenerator;
57 class CallNode;
58 class CallStaticJavaNode;
59 class CloneMap;
60 class CompilationFailureInfo;
61 class ConnectionGraph;
62 class IdealGraphPrinter;
63 class InlineTree;
64 class Matcher;
65 class MachConstantNode;
66 class MachConstantBaseNode;
67 class MachNode;
68 class MachOper;
69 class MachSafePointNode;
70 class Node;
71 class Node_Array;
72 class Node_List;
73 class Node_Notes;
74 class NodeHash;
75 class NodeCloneInfo;
76 class OpaqueTemplateAssertionPredicateNode;
77 class OptoReg;
81 class PhaseIterGVN;
82 class PhaseRegAlloc;
83 class PhaseCCP;
84 class PhaseOutput;
85 class RootNode;
86 class relocInfo;
87 class StartNode;
88 class SafePointNode;
89 class JVMState;
90 class Type;
91 class TypeInt;
92 class TypeInteger;
93 class TypeKlassPtr;
94 class TypePtr;
95 class TypeOopPtr;
96 class TypeFunc;
97 class TypeVect;
98 class Type_Array;
99 class Unique_Node_List;
100 class UnstableIfTrap;
101 class InlineTypeNode;
102 class nmethod;
103 class Node_Stack;
104 struct Final_Reshape_Counts;
105 class VerifyMeetResult;
106
107 enum LoopOptsMode {
108 LoopOptsDefault,
109 LoopOptsNone,
110 LoopOptsMaxUnroll,
111 LoopOptsShenandoahExpand,
112 LoopOptsSkipSplitIf,
113 LoopOptsVerify
114 };
115
116 // The type of all node counts and indexes.
117 // It must hold at least 16 bits, but must also be fast to load and store.
118 // This type, if less than 32 bits, could limit the number of possible nodes.
119 // (To make this type platform-specific, move to globalDefinitions_xxx.hpp.)
120 typedef unsigned int node_idx_t;
121
318 int _max_inline_size; // Max inline size for this compilation
319 int _freq_inline_size; // Max hot method inline size for this compilation
320 int _fixed_slots; // count of frame slots not allocated by the register
321 // allocator i.e. locks, original deopt pc, etc.
322 uintx _max_node_limit; // Max unique node count during a single compilation.
323
324 bool _post_loop_opts_phase; // Loop opts are finished.
325 bool _merge_stores_phase; // Phase for merging stores, after post loop opts phase.
326 bool _allow_macro_nodes; // True if we allow creation of macro nodes.
327
328 int _major_progress; // Count of something big happening
329 bool _inlining_progress; // progress doing incremental inlining?
330 bool _inlining_incrementally;// Are we doing incremental inlining (post parse)
331 bool _do_cleanup; // Cleanup is needed before proceeding with incremental inlining
332 bool _has_loops; // True if the method _may_ have some loops
333 bool _has_split_ifs; // True if the method _may_ have some split-if
334 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
335 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
336 bool _has_boxed_value; // True if a boxed object is allocated
337 bool _has_reserved_stack_access; // True if the method or an inlined method is annotated with ReservedStackAccess
338 bool _has_circular_inline_type; // True if method loads an inline type with a circular, non-flat field
339 uint _max_vector_size; // Maximum size of generated vectors
340 bool _clear_upper_avx; // Clear upper bits of ymm registers using vzeroupper
341 uint _trap_hist[trapHistLength]; // Cumulative traps
342 bool _trap_can_recompile; // Have we emitted a recompiling trap?
343 uint _decompile_count; // Cumulative decompilation counts.
344 bool _do_inlining; // True if we intend to do inlining
345 bool _do_scheduling; // True if we intend to do scheduling
346 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
347 bool _do_vector_loop; // True if allowed to execute loop in parallel iterations
348 bool _use_cmove; // True if CMove should be used without profitability analysis
349 bool _do_aliasing; // True if we intend to do aliasing
350 bool _print_assembly; // True if we should dump assembly code for this compilation
351 bool _print_inlining; // True if we should print inlining for this compilation
352 bool _print_intrinsics; // True if we should print intrinsics for this compilation
353 #ifndef PRODUCT
354 uint _phase_counter; // Counter for the number of already printed phases
355 uint _igv_idx; // Counter for IGV node identifiers
356 uint _igv_phase_iter[PHASE_NUM_TYPES]; // Counters for IGV phase iterations
357 bool _trace_opto_output;
358 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
359 #endif
360 bool _has_irreducible_loop; // Found irreducible loops
361 bool _has_monitors; // Metadata transfered to nmethod to enable Continuations lock-detection fastpath
362 bool _has_scoped_access; // For shared scope closure
363 bool _clinit_barrier_on_entry; // True if clinit barrier is needed on nmethod entry
364 int _loop_opts_cnt; // loop opts round
365 bool _has_flat_accesses; // Any known flat array accesses?
366 bool _flat_accesses_share_alias; // Initially all flat array share a single slice
367 bool _scalarize_in_safepoints; // Scalarize inline types in safepoint debug info
368 uint _stress_seed; // Seed for stress testing
369
370 // Compilation environment.
371 Arena _comp_arena; // Arena with lifetime equivalent to Compile
372 void* _barrier_set_state; // Potential GC barrier state for Compile
373 ciEnv* _env; // CI interface
374 DirectiveSet* _directive; // Compiler directive
375 CompileLog* _log; // from CompilerThread
376 CHeapStringHolder _failure_reason; // for record_failure/failing pattern
377 CompilationFailureInfo* _first_failure_details; // Details for the first failure happening during compilation
378 GrowableArray<CallGenerator*> _intrinsics; // List of intrinsics.
379 GrowableArray<Node*> _macro_nodes; // List of nodes which need to be expanded before matching.
380 GrowableArray<ParsePredicateNode*> _parse_predicates; // List of Parse Predicates.
381 // List of OpaqueTemplateAssertionPredicateNode nodes for Template Assertion Predicates which can be seen as list
382 // of Template Assertion Predicates themselves.
383 GrowableArray<OpaqueTemplateAssertionPredicateNode*> _template_assertion_predicate_opaques;
384 GrowableArray<Node*> _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
385 GrowableArray<Node*> _for_post_loop_igvn; // List of nodes for IGVN after loop opts are over
386 GrowableArray<Node*> _inline_type_nodes; // List of InlineType nodes
387 GrowableArray<Node*> _flat_access_nodes; // List of LoadFlat and StoreFlat nodes
388 GrowableArray<Node*> _for_merge_stores_igvn; // List of nodes for IGVN merge stores
389 GrowableArray<UnstableIfTrap*> _unstable_if_traps; // List of ifnodes after IGVN
390 GrowableArray<Node_List*> _coarsened_locks; // List of coarsened Lock and Unlock nodes
391 ConnectionGraph* _congraph;
392 #ifndef PRODUCT
393 IdealGraphPrinter* _igv_printer;
394 static IdealGraphPrinter* _debug_file_printer;
395 static IdealGraphPrinter* _debug_network_printer;
396 #endif
397
398
399 // Node management
400 uint _unique; // Counter for unique Node indices
401 uint _dead_node_count; // Number of dead nodes; VectorSet::Size() is O(N).
402 // So use this to keep count and make the call O(1).
403 VectorSet _dead_node_list; // Set of dead nodes
404 DEBUG_ONLY(Unique_Node_List* _modified_nodes;) // List of nodes which inputs were modified
405 DEBUG_ONLY(bool _phase_optimize_finished;) // Used for live node verification while creating new nodes
406
407 DEBUG_ONLY(bool _phase_verify_ideal_loop;) // Are we in PhaseIdealLoop verification?
601 int do_cleanup() const { return _do_cleanup; }
602 void set_major_progress() { _major_progress++; }
603 void restore_major_progress(int progress) { _major_progress += progress; }
604 void clear_major_progress() { _major_progress = 0; }
605 int max_inline_size() const { return _max_inline_size; }
606 void set_freq_inline_size(int n) { _freq_inline_size = n; }
607 int freq_inline_size() const { return _freq_inline_size; }
608 void set_max_inline_size(int n) { _max_inline_size = n; }
609 bool has_loops() const { return _has_loops; }
610 void set_has_loops(bool z) { _has_loops = z; }
611 bool has_split_ifs() const { return _has_split_ifs; }
612 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
613 bool has_unsafe_access() const { return _has_unsafe_access; }
614 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
615 bool has_stringbuilder() const { return _has_stringbuilder; }
616 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
617 bool has_boxed_value() const { return _has_boxed_value; }
618 void set_has_boxed_value(bool z) { _has_boxed_value = z; }
619 bool has_reserved_stack_access() const { return _has_reserved_stack_access; }
620 void set_has_reserved_stack_access(bool z) { _has_reserved_stack_access = z; }
621 bool has_circular_inline_type() const { return _has_circular_inline_type; }
622 void set_has_circular_inline_type(bool z) { _has_circular_inline_type = z; }
623 uint max_vector_size() const { return _max_vector_size; }
624 void set_max_vector_size(uint s) { _max_vector_size = s; }
625 bool clear_upper_avx() const { return _clear_upper_avx; }
626 void set_clear_upper_avx(bool s) { _clear_upper_avx = s; }
627 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
628 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
629 bool trap_can_recompile() const { return _trap_can_recompile; }
630 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
631 uint decompile_count() const { return _decompile_count; }
632 void set_decompile_count(uint c) { _decompile_count = c; }
633 bool allow_range_check_smearing() const;
634 bool do_inlining() const { return _do_inlining; }
635 void set_do_inlining(bool z) { _do_inlining = z; }
636 bool do_scheduling() const { return _do_scheduling; }
637 void set_do_scheduling(bool z) { _do_scheduling = z; }
638 bool do_freq_based_layout() const{ return _do_freq_based_layout; }
639 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
640 bool do_vector_loop() const { return _do_vector_loop; }
641 void set_do_vector_loop(bool z) { _do_vector_loop = z; }
642 bool use_cmove() const { return _use_cmove; }
643 void set_use_cmove(bool z) { _use_cmove = z; }
644 bool do_aliasing() const { return _do_aliasing; }
645 bool print_assembly() const { return _print_assembly; }
646 void set_print_assembly(bool z) { _print_assembly = z; }
647 bool print_inlining() const { return _print_inlining; }
648 void set_print_inlining(bool z) { _print_inlining = z; }
649 bool print_intrinsics() const { return _print_intrinsics; }
650 void set_print_intrinsics(bool z) { _print_intrinsics = z; }
651 uint max_node_limit() const { return (uint)_max_node_limit; }
652 void set_max_node_limit(uint n) { _max_node_limit = n; }
653 bool clinit_barrier_on_entry() { return _clinit_barrier_on_entry; }
654 void set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
655 void set_flat_accesses() { _has_flat_accesses = true; }
656 bool flat_accesses_share_alias() const { return _flat_accesses_share_alias; }
657 void set_flat_accesses_share_alias(bool z) { _flat_accesses_share_alias = z; }
658 bool scalarize_in_safepoints() const { return _scalarize_in_safepoints; }
659 void set_scalarize_in_safepoints(bool z) { _scalarize_in_safepoints = z; }
660
661 // Support for scalarized inline type calling convention
662 bool has_scalarized_args() const { return _method != nullptr && _method->has_scalarized_args(); }
663 bool needs_stack_repair() const { return _method != nullptr && _method->get_Method()->c2_needs_stack_repair(); }
664
665 bool has_monitors() const { return _has_monitors; }
666 void set_has_monitors(bool v) { _has_monitors = v; }
667 bool has_scoped_access() const { return _has_scoped_access; }
668 void set_has_scoped_access(bool v) { _has_scoped_access = v; }
669
670 // check the CompilerOracle for special behaviours for this compile
671 bool method_has_option(CompileCommandEnum option) const {
672 return method() != nullptr && method()->has_option(option);
673 }
674
675 #ifndef PRODUCT
676 uint next_igv_idx() { return _igv_idx++; }
677 bool trace_opto_output() const { return _trace_opto_output; }
678 void print_phase(const char* phase_name);
679 void print_ideal_ir(const char* phase_name);
680 bool should_print_ideal() const { return _directive->PrintIdealOption; }
681 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
682 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
683 int _in_dump_cnt; // Required for dumping ir nodes.
684 #endif
776 bool coarsened_locks_consistent();
777 void mark_unbalanced_boxes() const;
778
779 bool post_loop_opts_phase() { return _post_loop_opts_phase; }
780 void set_post_loop_opts_phase() { _post_loop_opts_phase = true; }
781 void reset_post_loop_opts_phase() { _post_loop_opts_phase = false; }
782
783 #ifdef ASSERT
784 bool phase_verify_ideal_loop() const { return _phase_verify_ideal_loop; }
785 void set_phase_verify_ideal_loop() { _phase_verify_ideal_loop = true; }
786 void reset_phase_verify_ideal_loop() { _phase_verify_ideal_loop = false; }
787 #endif
788
789 bool allow_macro_nodes() { return _allow_macro_nodes; }
790 void reset_allow_macro_nodes() { _allow_macro_nodes = false; }
791
792 void record_for_post_loop_opts_igvn(Node* n);
793 void remove_from_post_loop_opts_igvn(Node* n);
794 void process_for_post_loop_opts_igvn(PhaseIterGVN& igvn);
795
796 // Keep track of inline type nodes for later processing
797 void add_inline_type(Node* n);
798 void remove_inline_type(Node* n);
799 void process_inline_types(PhaseIterGVN &igvn, bool remove = false);
800
801 void add_flat_access(Node* n);
802 void remove_flat_access(Node* n);
803 void process_flat_accesses(PhaseIterGVN& igvn);
804
805 template <class F>
806 void for_each_flat_access(F consumer) {
807 for (int i = _flat_access_nodes.length() - 1; i >= 0; i--) {
808 consumer(_flat_access_nodes.at(i));
809 }
810 }
811
812 void adjust_flat_array_access_aliases(PhaseIterGVN& igvn);
813
814 void record_unstable_if_trap(UnstableIfTrap* trap);
815 bool remove_unstable_if_trap(CallStaticJavaNode* unc, bool yield);
816 void remove_useless_unstable_if_traps(Unique_Node_List &useful);
817 void process_for_unstable_if_traps(PhaseIterGVN& igvn);
818
819 bool merge_stores_phase() { return _merge_stores_phase; }
820 void set_merge_stores_phase() { _merge_stores_phase = true; }
821 void record_for_merge_stores_igvn(Node* n);
822 void remove_from_merge_stores_igvn(Node* n);
823 void process_for_merge_stores_igvn(PhaseIterGVN& igvn);
824
825 void shuffle_macro_nodes();
826 void sort_macro_nodes();
827
828 void mark_parse_predicate_nodes_useless(PhaseIterGVN& igvn);
829
830 // Are there candidate expensive nodes for optimization?
831 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
832 // Check whether n1 and n2 are similar
833 static int cmp_expensive_nodes(Node* n1, Node* n2);
976 Arena* type_arena() { return _type_arena; }
977 Dict* type_dict() { return _type_dict; }
978 size_t type_last_size() { return _type_last_size; }
979 int num_alias_types() { return _num_alias_types; }
980
981 void init_type_arena() { _type_arena = &_Compile_types; }
982 void set_type_arena(Arena* a) { _type_arena = a; }
983 void set_type_dict(Dict* d) { _type_dict = d; }
984 void set_type_last_size(size_t sz) { _type_last_size = sz; }
985
986 const TypeFunc* last_tf(ciMethod* m) {
987 return (m == _last_tf_m) ? _last_tf : nullptr;
988 }
989 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
990 assert(m != nullptr || tf == nullptr, "");
991 _last_tf_m = m;
992 _last_tf = tf;
993 }
994
995 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
996 AliasType* alias_type(const TypePtr* adr_type, ciField* field = nullptr, bool uncached = false) { return find_alias_type(adr_type, false, field, uncached); }
997 bool have_alias_type(const TypePtr* adr_type);
998 AliasType* alias_type(ciField* field);
999
1000 int get_alias_index(const TypePtr* at, bool uncached = false) { return alias_type(at, nullptr, uncached)->index(); }
1001 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
1002 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
1003
1004 // Building nodes
1005 void rethrow_exceptions(JVMState* jvms);
1006 void return_values(JVMState* jvms);
1007 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
1008
1009 // Decide how to build a call.
1010 // The profile factor is a discount to apply to this site's interp. profile.
1011 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch,
1012 JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = nullptr,
1013 bool allow_intrinsics = true);
1014 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
1015 return should_delay_string_inlining(call_method, jvms) ||
1016 should_delay_boxing_inlining(call_method, jvms) ||
1017 should_delay_vector_inlining(call_method, jvms);
1018 }
1019 bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
1020 bool should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms);
1223 // Number of outgoing stack slots killed above the out_preserve_stack_slots
1224 // for calls to C. Supports the var-args backing area for register parms.
1225 uint varargs_C_out_slots_killed() const;
1226
1227 // Number of Stack Slots consumed by a synchronization entry
1228 int sync_stack_slots() const;
1229
1230 // Compute the name of old_SP. See <arch>.ad for frame layout.
1231 OptoReg::Name compute_old_SP();
1232
1233 private:
1234 // Phase control:
1235 void Init(bool aliasing); // Prepare for a single compilation
1236 void Optimize(); // Given a graph, optimize it
1237 void Code_Gen(); // Generate code from a graph
1238
1239 // Management of the AliasType table.
1240 void grow_alias_types();
1241 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1242 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1243 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field, bool uncached = false);
1244
1245 void verify_top(Node*) const PRODUCT_RETURN;
1246
1247 // Intrinsic setup.
1248 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
1249 int intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found); // helper
1250 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
1251 void register_intrinsic(CallGenerator* cg); // update fn
1252
1253 #ifndef PRODUCT
1254 static juint _intrinsic_hist_count[];
1255 static jubyte _intrinsic_hist_flags[];
1256 #endif
1257 // Function calls made by the public function final_graph_reshaping.
1258 // No need to be made public as they are not called elsewhere.
1259 void final_graph_reshaping_impl(Node *n, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1260 void final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop, Unique_Node_List& dead_nodes);
1261 void final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1262 void handle_div_mod_op(Node* n, BasicType bt, bool is_unsigned);
1263
1313 // End-of-run dumps.
1314 static void print_statistics() PRODUCT_RETURN;
1315
1316 // Verify ADLC assumptions during startup
1317 static void adlc_verification() PRODUCT_RETURN;
1318
1319 // Definitions of pd methods
1320 static void pd_compiler2_init();
1321
1322 // Static parse-time type checking logic for gen_subtype_check:
1323 enum SubTypeCheckResult { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test };
1324 SubTypeCheckResult static_subtype_check(const TypeKlassPtr* superk, const TypeKlassPtr* subk, bool skip = StressReflectiveCode);
1325
1326 static Node* conv_I2X_index(PhaseGVN* phase, Node* offset, const TypeInt* sizetype,
1327 // Optional control dependency (for example, on range check)
1328 Node* ctrl = nullptr);
1329
1330 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check)
1331 static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl, bool carry_dependency = false);
1332
1333 Node* optimize_acmp(PhaseGVN* phase, Node* a, Node* b);
1334
1335 // Auxiliary method for randomized fuzzing/stressing
1336 int random();
1337 bool randomized_select(int count);
1338
1339 // seed random number generation and log the seed for repeatability.
1340 void initialize_stress_seed(const DirectiveSet* directive);
1341
1342 // supporting clone_map
1343 CloneMap& clone_map();
1344 void set_clone_map(Dict* d);
1345
1346 bool needs_clinit_barrier(ciField* ik, ciMethod* accessing_method);
1347 bool needs_clinit_barrier(ciMethod* ik, ciMethod* accessing_method);
1348 bool needs_clinit_barrier(ciInstanceKlass* ik, ciMethod* accessing_method);
1349
1350 #ifdef ASSERT
1351 VerifyMeetResult* _type_verify;
1352 void set_exception_backedge() { _exception_backedge = true; }
1353 bool has_exception_backedge() const { return _exception_backedge; }
1354 #endif
1355
|