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
324
325 /* If major progress is set:
326 * Marks that the loop tree information (get_ctrl, idom, get_loop, etc.) could be invalid, and we need to rebuild the loop tree.
327 * It also indicates that the graph was changed in a way that is promising to be able to apply more loop optimization.
328 * If major progress is not set:
329 * Loop tree information is valid.
330 * If major progress is not set at the end of a loop opts phase, then we can stop loop opts, because we do not expect any further progress if we did more loop opts phases.
331 *
332 * This is not 100% accurate, the semantics of major progress has become less clear over time, but this is the general idea.
333 */
334 bool _major_progress;
335 bool _inlining_progress; // progress doing incremental inlining?
336 bool _inlining_incrementally;// Are we doing incremental inlining (post parse)
337 bool _do_cleanup; // Cleanup is needed before proceeding with incremental inlining
338 bool _has_loops; // True if the method _may_ have some loops
339 bool _has_split_ifs; // True if the method _may_ have some split-if
340 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
341 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
342 bool _has_boxed_value; // True if a boxed object is allocated
343 bool _has_reserved_stack_access; // True if the method or an inlined method is annotated with ReservedStackAccess
344 uint _max_vector_size; // Maximum size of generated vectors
345 bool _clear_upper_avx; // Clear upper bits of ymm registers using vzeroupper
346 uint _trap_hist[trapHistLength]; // Cumulative traps
347 bool _trap_can_recompile; // Have we emitted a recompiling trap?
348 uint _decompile_count; // Cumulative decompilation counts.
349 bool _do_inlining; // True if we intend to do inlining
350 bool _do_scheduling; // True if we intend to do scheduling
351 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
352 bool _do_vector_loop; // True if allowed to execute loop in parallel iterations
353 bool _use_cmove; // True if CMove should be used without profitability analysis
354 bool _do_aliasing; // True if we intend to do aliasing
355 bool _print_assembly; // True if we should dump assembly code for this compilation
356 bool _print_inlining; // True if we should print inlining for this compilation
357 bool _print_intrinsics; // True if we should print intrinsics for this compilation
358 #ifndef PRODUCT
359 uint _phase_counter; // Counter for the number of already printed phases
360 uint _igv_idx; // Counter for IGV node identifiers
361 uint _igv_phase_iter[PHASE_NUM_TYPES]; // Counters for IGV phase iterations
362 bool _trace_opto_output;
363 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
364 #endif
365 bool _has_irreducible_loop; // Found irreducible loops
366 bool _has_monitors; // Metadata transfered to nmethod to enable Continuations lock-detection fastpath
367 bool _has_scoped_access; // For shared scope closure
368 bool _clinit_barrier_on_entry; // True if clinit barrier is needed on nmethod entry
369 int _loop_opts_cnt; // loop opts round
370 uint _stress_seed; // Seed for stress testing
371
372 // Compilation environment.
373 Arena _comp_arena; // Arena with lifetime equivalent to Compile
374 void* _barrier_set_state; // Potential GC barrier state for Compile
375 ciEnv* _env; // CI interface
376 DirectiveSet* _directive; // Compiler directive
377 CompileLog* _log; // from CompilerThread
378 CHeapStringHolder _failure_reason; // for record_failure/failing pattern
379 CompilationFailureInfo* _first_failure_details; // Details for the first failure happening during compilation
380 GrowableArray<CallGenerator*> _intrinsics; // List of intrinsics.
381 GrowableArray<Node*> _macro_nodes; // List of nodes which need to be expanded before matching.
382 GrowableArray<ParsePredicateNode*> _parse_predicates; // List of Parse Predicates.
383 // List of OpaqueTemplateAssertionPredicateNode nodes for Template Assertion Predicates which can be seen as list
384 // of Template Assertion Predicates themselves.
385 GrowableArray<OpaqueTemplateAssertionPredicateNode*> _template_assertion_predicate_opaques;
386 GrowableArray<Node*> _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
387 GrowableArray<Node*> _for_post_loop_igvn; // List of nodes for IGVN after loop opts are over
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 bool major_progress() const { return _major_progress; }
602 void set_major_progress() { _major_progress = true; }
603 void restore_major_progress(bool progress) { _major_progress = _major_progress || progress; }
604 void clear_major_progress() { _major_progress = false; }
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 uint max_vector_size() const { return _max_vector_size; }
622 void set_max_vector_size(uint s) { _max_vector_size = s; }
623 bool clear_upper_avx() const { return _clear_upper_avx; }
624 void set_clear_upper_avx(bool s) { _clear_upper_avx = s; }
625 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
626 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
627 bool trap_can_recompile() const { return _trap_can_recompile; }
628 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
629 uint decompile_count() const { return _decompile_count; }
630 void set_decompile_count(uint c) { _decompile_count = c; }
631 bool allow_range_check_smearing() const;
632 bool do_inlining() const { return _do_inlining; }
633 void set_do_inlining(bool z) { _do_inlining = z; }
634 bool do_scheduling() const { return _do_scheduling; }
635 void set_do_scheduling(bool z) { _do_scheduling = z; }
636 bool do_freq_based_layout() const{ return _do_freq_based_layout; }
637 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
638 bool do_vector_loop() const { return _do_vector_loop; }
639 void set_do_vector_loop(bool z) { _do_vector_loop = z; }
640 bool use_cmove() const { return _use_cmove; }
641 void set_use_cmove(bool z) { _use_cmove = z; }
642 bool do_aliasing() const { return _do_aliasing; }
643 bool print_assembly() const { return _print_assembly; }
644 void set_print_assembly(bool z) { _print_assembly = z; }
645 bool print_inlining() const { return _print_inlining; }
646 void set_print_inlining(bool z) { _print_inlining = z; }
647 bool print_intrinsics() const { return _print_intrinsics; }
648 void set_print_intrinsics(bool z) { _print_intrinsics = z; }
649 uint max_node_limit() const { return (uint)_max_node_limit; }
650 void set_max_node_limit(uint n) { _max_node_limit = n; }
651 bool clinit_barrier_on_entry() { return _clinit_barrier_on_entry; }
652 void set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
653 bool has_monitors() const { return _has_monitors; }
654 void set_has_monitors(bool v) { _has_monitors = v; }
655 bool has_scoped_access() const { return _has_scoped_access; }
656 void set_has_scoped_access(bool v) { _has_scoped_access = v; }
657
658 // check the CompilerOracle for special behaviours for this compile
659 bool method_has_option(CompileCommandEnum option) const {
660 return method() != nullptr && method()->has_option(option);
661 }
662
663 #ifndef PRODUCT
664 uint next_igv_idx() { return _igv_idx++; }
665 bool trace_opto_output() const { return _trace_opto_output; }
666 void print_phase(const char* phase_name);
667 void print_ideal_ir(const char* phase_name);
668 bool should_print_ideal() const { return _directive->PrintIdealOption; }
669 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
670 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
671 int _in_dump_cnt; // Required for dumping ir nodes.
672 #endif
764 bool coarsened_locks_consistent();
765 void mark_unbalanced_boxes() const;
766
767 bool post_loop_opts_phase() { return _post_loop_opts_phase; }
768 void set_post_loop_opts_phase() { _post_loop_opts_phase = true; }
769 void reset_post_loop_opts_phase() { _post_loop_opts_phase = false; }
770
771 #ifdef ASSERT
772 bool phase_verify_ideal_loop() const { return _phase_verify_ideal_loop; }
773 void set_phase_verify_ideal_loop() { _phase_verify_ideal_loop = true; }
774 void reset_phase_verify_ideal_loop() { _phase_verify_ideal_loop = false; }
775 #endif
776
777 bool allow_macro_nodes() { return _allow_macro_nodes; }
778 void reset_allow_macro_nodes() { _allow_macro_nodes = false; }
779
780 void record_for_post_loop_opts_igvn(Node* n);
781 void remove_from_post_loop_opts_igvn(Node* n);
782 void process_for_post_loop_opts_igvn(PhaseIterGVN& igvn);
783
784 void record_unstable_if_trap(UnstableIfTrap* trap);
785 bool remove_unstable_if_trap(CallStaticJavaNode* unc, bool yield);
786 void remove_useless_unstable_if_traps(Unique_Node_List &useful);
787 void process_for_unstable_if_traps(PhaseIterGVN& igvn);
788
789 bool merge_stores_phase() { return _merge_stores_phase; }
790 void set_merge_stores_phase() { _merge_stores_phase = true; }
791 void record_for_merge_stores_igvn(Node* n);
792 void remove_from_merge_stores_igvn(Node* n);
793 void process_for_merge_stores_igvn(PhaseIterGVN& igvn);
794
795 void shuffle_macro_nodes();
796 void sort_macro_nodes();
797
798 void mark_parse_predicate_nodes_useless(PhaseIterGVN& igvn);
799
800 // Are there candidate expensive nodes for optimization?
801 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
802 // Check whether n1 and n2 are similar
803 static int cmp_expensive_nodes(Node* n1, Node* n2);
946 Arena* type_arena() { return _type_arena; }
947 Dict* type_dict() { return _type_dict; }
948 size_t type_last_size() { return _type_last_size; }
949 int num_alias_types() { return _num_alias_types; }
950
951 void init_type_arena() { _type_arena = &_Compile_types; }
952 void set_type_arena(Arena* a) { _type_arena = a; }
953 void set_type_dict(Dict* d) { _type_dict = d; }
954 void set_type_last_size(size_t sz) { _type_last_size = sz; }
955
956 const TypeFunc* last_tf(ciMethod* m) {
957 return (m == _last_tf_m) ? _last_tf : nullptr;
958 }
959 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
960 assert(m != nullptr || tf == nullptr, "");
961 _last_tf_m = m;
962 _last_tf = tf;
963 }
964
965 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
966 AliasType* alias_type(const TypePtr* adr_type, ciField* field = nullptr) { return find_alias_type(adr_type, false, field); }
967 bool have_alias_type(const TypePtr* adr_type);
968 AliasType* alias_type(ciField* field);
969
970 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); }
971 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
972 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
973
974 // Building nodes
975 void rethrow_exceptions(JVMState* jvms);
976 void return_values(JVMState* jvms);
977 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
978
979 // Decide how to build a call.
980 // The profile factor is a discount to apply to this site's interp. profile.
981 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch,
982 JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = nullptr,
983 bool allow_intrinsics = true);
984 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
985 return should_delay_string_inlining(call_method, jvms) ||
986 should_delay_boxing_inlining(call_method, jvms) ||
987 should_delay_vector_inlining(call_method, jvms);
988 }
989 bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
990 bool should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms);
1193 // Number of outgoing stack slots killed above the out_preserve_stack_slots
1194 // for calls to C. Supports the var-args backing area for register parms.
1195 uint varargs_C_out_slots_killed() const;
1196
1197 // Number of Stack Slots consumed by a synchronization entry
1198 int sync_stack_slots() const;
1199
1200 // Compute the name of old_SP. See <arch>.ad for frame layout.
1201 OptoReg::Name compute_old_SP();
1202
1203 private:
1204 // Phase control:
1205 void Init(bool aliasing); // Prepare for a single compilation
1206 void Optimize(); // Given a graph, optimize it
1207 void Code_Gen(); // Generate code from a graph
1208
1209 // Management of the AliasType table.
1210 void grow_alias_types();
1211 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1212 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1213 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field);
1214
1215 void verify_top(Node*) const PRODUCT_RETURN;
1216
1217 // Intrinsic setup.
1218 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
1219 int intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found); // helper
1220 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
1221 void register_intrinsic(CallGenerator* cg); // update fn
1222
1223 #ifndef PRODUCT
1224 static juint _intrinsic_hist_count[];
1225 static jubyte _intrinsic_hist_flags[];
1226 #endif
1227 // Function calls made by the public function final_graph_reshaping.
1228 // No need to be made public as they are not called elsewhere.
1229 void final_graph_reshaping_impl(Node *n, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1230 void final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop, Unique_Node_List& dead_nodes);
1231 void final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1232 void handle_div_mod_op(Node* n, BasicType bt, bool is_unsigned);
1233
1283 // End-of-run dumps.
1284 static void print_statistics() PRODUCT_RETURN;
1285
1286 // Verify ADLC assumptions during startup
1287 static void adlc_verification() PRODUCT_RETURN;
1288
1289 // Definitions of pd methods
1290 static void pd_compiler2_init();
1291
1292 // Static parse-time type checking logic for gen_subtype_check:
1293 enum SubTypeCheckResult { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test };
1294 SubTypeCheckResult static_subtype_check(const TypeKlassPtr* superk, const TypeKlassPtr* subk, bool skip = StressReflectiveCode);
1295
1296 static Node* conv_I2X_index(PhaseGVN* phase, Node* offset, const TypeInt* sizetype,
1297 // Optional control dependency (for example, on range check)
1298 Node* ctrl = nullptr);
1299
1300 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check)
1301 static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl, bool carry_dependency = false);
1302
1303 // Auxiliary methods for randomized fuzzing/stressing
1304 int random();
1305 bool randomized_select(int count);
1306
1307 // seed random number generation and log the seed for repeatability.
1308 void initialize_stress_seed(const DirectiveSet* directive);
1309
1310 // supporting clone_map
1311 CloneMap& clone_map();
1312 void set_clone_map(Dict* d);
1313
1314 bool needs_clinit_barrier(ciField* ik, ciMethod* accessing_method);
1315 bool needs_clinit_barrier(ciMethod* ik, ciMethod* accessing_method);
1316 bool needs_clinit_barrier(ciInstanceKlass* ik, ciMethod* accessing_method);
1317
1318 #ifdef ASSERT
1319 VerifyMeetResult* _type_verify;
1320 void set_exception_backedge() { _exception_backedge = true; }
1321 bool has_exception_backedge() const { return _exception_backedge; }
1322 #endif
1323
|
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
327
328 /* If major progress is set:
329 * Marks that the loop tree information (get_ctrl, idom, get_loop, etc.) could be invalid, and we need to rebuild the loop tree.
330 * It also indicates that the graph was changed in a way that is promising to be able to apply more loop optimization.
331 * If major progress is not set:
332 * Loop tree information is valid.
333 * If major progress is not set at the end of a loop opts phase, then we can stop loop opts, because we do not expect any further progress if we did more loop opts phases.
334 *
335 * This is not 100% accurate, the semantics of major progress has become less clear over time, but this is the general idea.
336 */
337 bool _major_progress;
338 bool _inlining_progress; // progress doing incremental inlining?
339 bool _inlining_incrementally;// Are we doing incremental inlining (post parse)
340 bool _do_cleanup; // Cleanup is needed before proceeding with incremental inlining
341 bool _has_loops; // True if the method _may_ have some loops
342 bool _has_split_ifs; // True if the method _may_ have some split-if
343 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
344 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
345 bool _has_boxed_value; // True if a boxed object is allocated
346 bool _has_reserved_stack_access; // True if the method or an inlined method is annotated with ReservedStackAccess
347 bool _has_circular_inline_type; // True if method loads an inline type with a circular, non-flat field
348 uint _max_vector_size; // Maximum size of generated vectors
349 bool _clear_upper_avx; // Clear upper bits of ymm registers using vzeroupper
350 uint _trap_hist[trapHistLength]; // Cumulative traps
351 bool _trap_can_recompile; // Have we emitted a recompiling trap?
352 uint _decompile_count; // Cumulative decompilation counts.
353 bool _do_inlining; // True if we intend to do inlining
354 bool _do_scheduling; // True if we intend to do scheduling
355 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
356 bool _do_vector_loop; // True if allowed to execute loop in parallel iterations
357 bool _use_cmove; // True if CMove should be used without profitability analysis
358 bool _do_aliasing; // True if we intend to do aliasing
359 bool _print_assembly; // True if we should dump assembly code for this compilation
360 bool _print_inlining; // True if we should print inlining for this compilation
361 bool _print_intrinsics; // True if we should print intrinsics for this compilation
362 #ifndef PRODUCT
363 uint _phase_counter; // Counter for the number of already printed phases
364 uint _igv_idx; // Counter for IGV node identifiers
365 uint _igv_phase_iter[PHASE_NUM_TYPES]; // Counters for IGV phase iterations
366 bool _trace_opto_output;
367 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
368 #endif
369 bool _has_irreducible_loop; // Found irreducible loops
370 bool _has_monitors; // Metadata transfered to nmethod to enable Continuations lock-detection fastpath
371 bool _has_scoped_access; // For shared scope closure
372 bool _clinit_barrier_on_entry; // True if clinit barrier is needed on nmethod entry
373 int _loop_opts_cnt; // loop opts round
374 bool _has_flat_accesses; // Any known flat array accesses?
375 bool _flat_accesses_share_alias; // Initially all flat array share a single slice
376 bool _scalarize_in_safepoints; // Scalarize inline types in safepoint debug info
377 uint _stress_seed; // Seed for stress testing
378
379 // Compilation environment.
380 Arena _comp_arena; // Arena with lifetime equivalent to Compile
381 void* _barrier_set_state; // Potential GC barrier state for Compile
382 ciEnv* _env; // CI interface
383 DirectiveSet* _directive; // Compiler directive
384 CompileLog* _log; // from CompilerThread
385 CHeapStringHolder _failure_reason; // for record_failure/failing pattern
386 CompilationFailureInfo* _first_failure_details; // Details for the first failure happening during compilation
387 GrowableArray<CallGenerator*> _intrinsics; // List of intrinsics.
388 GrowableArray<Node*> _macro_nodes; // List of nodes which need to be expanded before matching.
389 GrowableArray<ParsePredicateNode*> _parse_predicates; // List of Parse Predicates.
390 // List of OpaqueTemplateAssertionPredicateNode nodes for Template Assertion Predicates which can be seen as list
391 // of Template Assertion Predicates themselves.
392 GrowableArray<OpaqueTemplateAssertionPredicateNode*> _template_assertion_predicate_opaques;
393 GrowableArray<Node*> _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
394 GrowableArray<Node*> _for_post_loop_igvn; // List of nodes for IGVN after loop opts are over
395 GrowableArray<Node*> _inline_type_nodes; // List of InlineType nodes
396 GrowableArray<Node*> _flat_access_nodes; // List of LoadFlat and StoreFlat nodes
397 GrowableArray<Node*> _for_merge_stores_igvn; // List of nodes for IGVN merge stores
398 GrowableArray<UnstableIfTrap*> _unstable_if_traps; // List of ifnodes after IGVN
399 GrowableArray<Node_List*> _coarsened_locks; // List of coarsened Lock and Unlock nodes
400 ConnectionGraph* _congraph;
401 #ifndef PRODUCT
402 IdealGraphPrinter* _igv_printer;
403 static IdealGraphPrinter* _debug_file_printer;
404 static IdealGraphPrinter* _debug_network_printer;
405 #endif
406
407
408 // Node management
409 uint _unique; // Counter for unique Node indices
410 uint _dead_node_count; // Number of dead nodes; VectorSet::Size() is O(N).
411 // So use this to keep count and make the call O(1).
412 VectorSet _dead_node_list; // Set of dead nodes
413 DEBUG_ONLY(Unique_Node_List* _modified_nodes;) // List of nodes which inputs were modified
414 DEBUG_ONLY(bool _phase_optimize_finished;) // Used for live node verification while creating new nodes
415
416 DEBUG_ONLY(bool _phase_verify_ideal_loop;) // Are we in PhaseIdealLoop verification?
610 bool major_progress() const { return _major_progress; }
611 void set_major_progress() { _major_progress = true; }
612 void restore_major_progress(bool progress) { _major_progress = _major_progress || progress; }
613 void clear_major_progress() { _major_progress = false; }
614 int max_inline_size() const { return _max_inline_size; }
615 void set_freq_inline_size(int n) { _freq_inline_size = n; }
616 int freq_inline_size() const { return _freq_inline_size; }
617 void set_max_inline_size(int n) { _max_inline_size = n; }
618 bool has_loops() const { return _has_loops; }
619 void set_has_loops(bool z) { _has_loops = z; }
620 bool has_split_ifs() const { return _has_split_ifs; }
621 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
622 bool has_unsafe_access() const { return _has_unsafe_access; }
623 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
624 bool has_stringbuilder() const { return _has_stringbuilder; }
625 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
626 bool has_boxed_value() const { return _has_boxed_value; }
627 void set_has_boxed_value(bool z) { _has_boxed_value = z; }
628 bool has_reserved_stack_access() const { return _has_reserved_stack_access; }
629 void set_has_reserved_stack_access(bool z) { _has_reserved_stack_access = z; }
630 bool has_circular_inline_type() const { return _has_circular_inline_type; }
631 void set_has_circular_inline_type(bool z) { _has_circular_inline_type = z; }
632 uint max_vector_size() const { return _max_vector_size; }
633 void set_max_vector_size(uint s) { _max_vector_size = s; }
634 bool clear_upper_avx() const { return _clear_upper_avx; }
635 void set_clear_upper_avx(bool s) { _clear_upper_avx = s; }
636 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
637 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
638 bool trap_can_recompile() const { return _trap_can_recompile; }
639 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
640 uint decompile_count() const { return _decompile_count; }
641 void set_decompile_count(uint c) { _decompile_count = c; }
642 bool allow_range_check_smearing() const;
643 bool do_inlining() const { return _do_inlining; }
644 void set_do_inlining(bool z) { _do_inlining = z; }
645 bool do_scheduling() const { return _do_scheduling; }
646 void set_do_scheduling(bool z) { _do_scheduling = z; }
647 bool do_freq_based_layout() const{ return _do_freq_based_layout; }
648 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
649 bool do_vector_loop() const { return _do_vector_loop; }
650 void set_do_vector_loop(bool z) { _do_vector_loop = z; }
651 bool use_cmove() const { return _use_cmove; }
652 void set_use_cmove(bool z) { _use_cmove = z; }
653 bool do_aliasing() const { return _do_aliasing; }
654 bool print_assembly() const { return _print_assembly; }
655 void set_print_assembly(bool z) { _print_assembly = z; }
656 bool print_inlining() const { return _print_inlining; }
657 void set_print_inlining(bool z) { _print_inlining = z; }
658 bool print_intrinsics() const { return _print_intrinsics; }
659 void set_print_intrinsics(bool z) { _print_intrinsics = z; }
660 uint max_node_limit() const { return (uint)_max_node_limit; }
661 void set_max_node_limit(uint n) { _max_node_limit = n; }
662 bool clinit_barrier_on_entry() { return _clinit_barrier_on_entry; }
663 void set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
664 void set_flat_accesses() { _has_flat_accesses = true; }
665 bool flat_accesses_share_alias() const { return _flat_accesses_share_alias; }
666 void set_flat_accesses_share_alias(bool z) { _flat_accesses_share_alias = z; }
667 bool scalarize_in_safepoints() const { return _scalarize_in_safepoints; }
668 void set_scalarize_in_safepoints(bool z) { _scalarize_in_safepoints = z; }
669
670 // Support for scalarized inline type calling convention
671 bool has_scalarized_args() const { return _method != nullptr && _method->has_scalarized_args(); }
672 bool needs_stack_repair() const { return _method != nullptr && _method->get_Method()->c2_needs_stack_repair(); }
673
674 bool has_monitors() const { return _has_monitors; }
675 void set_has_monitors(bool v) { _has_monitors = v; }
676 bool has_scoped_access() const { return _has_scoped_access; }
677 void set_has_scoped_access(bool v) { _has_scoped_access = v; }
678
679 // check the CompilerOracle for special behaviours for this compile
680 bool method_has_option(CompileCommandEnum option) const {
681 return method() != nullptr && method()->has_option(option);
682 }
683
684 #ifndef PRODUCT
685 uint next_igv_idx() { return _igv_idx++; }
686 bool trace_opto_output() const { return _trace_opto_output; }
687 void print_phase(const char* phase_name);
688 void print_ideal_ir(const char* phase_name);
689 bool should_print_ideal() const { return _directive->PrintIdealOption; }
690 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
691 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
692 int _in_dump_cnt; // Required for dumping ir nodes.
693 #endif
785 bool coarsened_locks_consistent();
786 void mark_unbalanced_boxes() const;
787
788 bool post_loop_opts_phase() { return _post_loop_opts_phase; }
789 void set_post_loop_opts_phase() { _post_loop_opts_phase = true; }
790 void reset_post_loop_opts_phase() { _post_loop_opts_phase = false; }
791
792 #ifdef ASSERT
793 bool phase_verify_ideal_loop() const { return _phase_verify_ideal_loop; }
794 void set_phase_verify_ideal_loop() { _phase_verify_ideal_loop = true; }
795 void reset_phase_verify_ideal_loop() { _phase_verify_ideal_loop = false; }
796 #endif
797
798 bool allow_macro_nodes() { return _allow_macro_nodes; }
799 void reset_allow_macro_nodes() { _allow_macro_nodes = false; }
800
801 void record_for_post_loop_opts_igvn(Node* n);
802 void remove_from_post_loop_opts_igvn(Node* n);
803 void process_for_post_loop_opts_igvn(PhaseIterGVN& igvn);
804
805 // Keep track of inline type nodes for later processing
806 void add_inline_type(Node* n);
807 void remove_inline_type(Node* n);
808 void process_inline_types(PhaseIterGVN &igvn, bool remove = false);
809
810 void add_flat_access(Node* n);
811 void remove_flat_access(Node* n);
812 void process_flat_accesses(PhaseIterGVN& igvn);
813
814 template <class F>
815 void for_each_flat_access(F consumer) {
816 for (int i = _flat_access_nodes.length() - 1; i >= 0; i--) {
817 consumer(_flat_access_nodes.at(i));
818 }
819 }
820
821 void adjust_flat_array_access_aliases(PhaseIterGVN& igvn);
822
823 void record_unstable_if_trap(UnstableIfTrap* trap);
824 bool remove_unstable_if_trap(CallStaticJavaNode* unc, bool yield);
825 void remove_useless_unstable_if_traps(Unique_Node_List &useful);
826 void process_for_unstable_if_traps(PhaseIterGVN& igvn);
827
828 bool merge_stores_phase() { return _merge_stores_phase; }
829 void set_merge_stores_phase() { _merge_stores_phase = true; }
830 void record_for_merge_stores_igvn(Node* n);
831 void remove_from_merge_stores_igvn(Node* n);
832 void process_for_merge_stores_igvn(PhaseIterGVN& igvn);
833
834 void shuffle_macro_nodes();
835 void sort_macro_nodes();
836
837 void mark_parse_predicate_nodes_useless(PhaseIterGVN& igvn);
838
839 // Are there candidate expensive nodes for optimization?
840 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
841 // Check whether n1 and n2 are similar
842 static int cmp_expensive_nodes(Node* n1, Node* n2);
985 Arena* type_arena() { return _type_arena; }
986 Dict* type_dict() { return _type_dict; }
987 size_t type_last_size() { return _type_last_size; }
988 int num_alias_types() { return _num_alias_types; }
989
990 void init_type_arena() { _type_arena = &_Compile_types; }
991 void set_type_arena(Arena* a) { _type_arena = a; }
992 void set_type_dict(Dict* d) { _type_dict = d; }
993 void set_type_last_size(size_t sz) { _type_last_size = sz; }
994
995 const TypeFunc* last_tf(ciMethod* m) {
996 return (m == _last_tf_m) ? _last_tf : nullptr;
997 }
998 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
999 assert(m != nullptr || tf == nullptr, "");
1000 _last_tf_m = m;
1001 _last_tf = tf;
1002 }
1003
1004 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
1005 AliasType* alias_type(const TypePtr* adr_type, ciField* field = nullptr, bool uncached = false) { return find_alias_type(adr_type, false, field, uncached); }
1006 bool have_alias_type(const TypePtr* adr_type);
1007 AliasType* alias_type(ciField* field);
1008
1009 int get_alias_index(const TypePtr* at, bool uncached = false) { return alias_type(at, nullptr, uncached)->index(); }
1010 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
1011 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
1012
1013 // Building nodes
1014 void rethrow_exceptions(JVMState* jvms);
1015 void return_values(JVMState* jvms);
1016 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
1017
1018 // Decide how to build a call.
1019 // The profile factor is a discount to apply to this site's interp. profile.
1020 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch,
1021 JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = nullptr,
1022 bool allow_intrinsics = true);
1023 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
1024 return should_delay_string_inlining(call_method, jvms) ||
1025 should_delay_boxing_inlining(call_method, jvms) ||
1026 should_delay_vector_inlining(call_method, jvms);
1027 }
1028 bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
1029 bool should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms);
1232 // Number of outgoing stack slots killed above the out_preserve_stack_slots
1233 // for calls to C. Supports the var-args backing area for register parms.
1234 uint varargs_C_out_slots_killed() const;
1235
1236 // Number of Stack Slots consumed by a synchronization entry
1237 int sync_stack_slots() const;
1238
1239 // Compute the name of old_SP. See <arch>.ad for frame layout.
1240 OptoReg::Name compute_old_SP();
1241
1242 private:
1243 // Phase control:
1244 void Init(bool aliasing); // Prepare for a single compilation
1245 void Optimize(); // Given a graph, optimize it
1246 void Code_Gen(); // Generate code from a graph
1247
1248 // Management of the AliasType table.
1249 void grow_alias_types();
1250 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1251 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1252 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field, bool uncached = false);
1253
1254 void verify_top(Node*) const PRODUCT_RETURN;
1255
1256 // Intrinsic setup.
1257 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
1258 int intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found); // helper
1259 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
1260 void register_intrinsic(CallGenerator* cg); // update fn
1261
1262 #ifndef PRODUCT
1263 static juint _intrinsic_hist_count[];
1264 static jubyte _intrinsic_hist_flags[];
1265 #endif
1266 // Function calls made by the public function final_graph_reshaping.
1267 // No need to be made public as they are not called elsewhere.
1268 void final_graph_reshaping_impl(Node *n, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1269 void final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop, Unique_Node_List& dead_nodes);
1270 void final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1271 void handle_div_mod_op(Node* n, BasicType bt, bool is_unsigned);
1272
1322 // End-of-run dumps.
1323 static void print_statistics() PRODUCT_RETURN;
1324
1325 // Verify ADLC assumptions during startup
1326 static void adlc_verification() PRODUCT_RETURN;
1327
1328 // Definitions of pd methods
1329 static void pd_compiler2_init();
1330
1331 // Static parse-time type checking logic for gen_subtype_check:
1332 enum SubTypeCheckResult { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test };
1333 SubTypeCheckResult static_subtype_check(const TypeKlassPtr* superk, const TypeKlassPtr* subk, bool skip = StressReflectiveCode);
1334
1335 static Node* conv_I2X_index(PhaseGVN* phase, Node* offset, const TypeInt* sizetype,
1336 // Optional control dependency (for example, on range check)
1337 Node* ctrl = nullptr);
1338
1339 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check)
1340 static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl, bool carry_dependency = false);
1341
1342 Node* optimize_acmp(PhaseGVN* phase, Node* a, Node* b);
1343
1344 // Auxiliary method for randomized fuzzing/stressing
1345 int random();
1346 bool randomized_select(int count);
1347
1348 // seed random number generation and log the seed for repeatability.
1349 void initialize_stress_seed(const DirectiveSet* directive);
1350
1351 // supporting clone_map
1352 CloneMap& clone_map();
1353 void set_clone_map(Dict* d);
1354
1355 bool needs_clinit_barrier(ciField* ik, ciMethod* accessing_method);
1356 bool needs_clinit_barrier(ciMethod* ik, ciMethod* accessing_method);
1357 bool needs_clinit_barrier(ciInstanceKlass* ik, ciMethod* accessing_method);
1358
1359 #ifdef ASSERT
1360 VerifyMeetResult* _type_verify;
1361 void set_exception_backedge() { _exception_backedge = true; }
1362 bool has_exception_backedge() const { return _exception_backedge; }
1363 #endif
1364
|