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?
603 bool major_progress() const { return _major_progress; }
604 void set_major_progress() { _major_progress = true; }
605 void restore_major_progress(bool progress) { _major_progress = _major_progress || progress; }
606 void clear_major_progress() { _major_progress = false; }
607 int max_inline_size() const { return _max_inline_size; }
608 void set_freq_inline_size(int n) { _freq_inline_size = n; }
609 int freq_inline_size() const { return _freq_inline_size; }
610 void set_max_inline_size(int n) { _max_inline_size = n; }
611 bool has_loops() const { return _has_loops; }
612 void set_has_loops(bool z) { _has_loops = z; }
613 bool has_split_ifs() const { return _has_split_ifs; }
614 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
615 bool has_unsafe_access() const { return _has_unsafe_access; }
616 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
617 bool has_stringbuilder() const { return _has_stringbuilder; }
618 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
619 bool has_boxed_value() const { return _has_boxed_value; }
620 void set_has_boxed_value(bool z) { _has_boxed_value = z; }
621 bool has_reserved_stack_access() const { return _has_reserved_stack_access; }
622 void set_has_reserved_stack_access(bool z) { _has_reserved_stack_access = 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 bool has_monitors() const { return _has_monitors; }
656 void set_has_monitors(bool v) { _has_monitors = v; }
657 bool has_scoped_access() const { return _has_scoped_access; }
658 void set_has_scoped_access(bool v) { _has_scoped_access = v; }
659
660 // check the CompilerOracle for special behaviours for this compile
661 bool method_has_option(CompileCommandEnum option) const {
662 return method() != nullptr && method()->has_option(option);
663 }
664
665 #ifndef PRODUCT
666 uint next_igv_idx() { return _igv_idx++; }
667 bool trace_opto_output() const { return _trace_opto_output; }
668 void print_phase(const char* phase_name);
669 void print_ideal_ir(const char* phase_name);
670 bool should_print_ideal() const { return _directive->PrintIdealOption; }
671 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
672 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
673 int _in_dump_cnt; // Required for dumping ir nodes.
674 #endif
766 bool coarsened_locks_consistent();
767 void mark_unbalanced_boxes() const;
768
769 bool post_loop_opts_phase() { return _post_loop_opts_phase; }
770 void set_post_loop_opts_phase() { _post_loop_opts_phase = true; }
771 void reset_post_loop_opts_phase() { _post_loop_opts_phase = false; }
772
773 #ifdef ASSERT
774 bool phase_verify_ideal_loop() const { return _phase_verify_ideal_loop; }
775 void set_phase_verify_ideal_loop() { _phase_verify_ideal_loop = true; }
776 void reset_phase_verify_ideal_loop() { _phase_verify_ideal_loop = false; }
777 #endif
778
779 bool allow_macro_nodes() { return _allow_macro_nodes; }
780 void reset_allow_macro_nodes() { _allow_macro_nodes = false; }
781
782 void record_for_post_loop_opts_igvn(Node* n);
783 void remove_from_post_loop_opts_igvn(Node* n);
784 void process_for_post_loop_opts_igvn(PhaseIterGVN& igvn);
785
786 void record_unstable_if_trap(UnstableIfTrap* trap);
787 bool remove_unstable_if_trap(CallStaticJavaNode* unc, bool yield);
788 void remove_useless_unstable_if_traps(Unique_Node_List &useful);
789 void process_for_unstable_if_traps(PhaseIterGVN& igvn);
790
791 bool merge_stores_phase() { return _merge_stores_phase; }
792 void set_merge_stores_phase() { _merge_stores_phase = true; }
793 void record_for_merge_stores_igvn(Node* n);
794 void remove_from_merge_stores_igvn(Node* n);
795 void process_for_merge_stores_igvn(PhaseIterGVN& igvn);
796
797 void shuffle_macro_nodes();
798 void sort_macro_nodes();
799
800 void mark_parse_predicate_nodes_useless(PhaseIterGVN& igvn);
801
802 // Are there candidate expensive nodes for optimization?
803 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
804 // Check whether n1 and n2 are similar
805 static int cmp_expensive_nodes(Node* n1, Node* n2);
948 Arena* type_arena() { return _type_arena; }
949 Dict* type_dict() { return _type_dict; }
950 size_t type_last_size() { return _type_last_size; }
951 int num_alias_types() { return _num_alias_types; }
952
953 void init_type_arena() { _type_arena = &_Compile_types; }
954 void set_type_arena(Arena* a) { _type_arena = a; }
955 void set_type_dict(Dict* d) { _type_dict = d; }
956 void set_type_last_size(size_t sz) { _type_last_size = sz; }
957
958 const TypeFunc* last_tf(ciMethod* m) {
959 return (m == _last_tf_m) ? _last_tf : nullptr;
960 }
961 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
962 assert(m != nullptr || tf == nullptr, "");
963 _last_tf_m = m;
964 _last_tf = tf;
965 }
966
967 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
968 AliasType* alias_type(const TypePtr* adr_type, ciField* field = nullptr) { return find_alias_type(adr_type, false, field); }
969 bool have_alias_type(const TypePtr* adr_type);
970 AliasType* alias_type(ciField* field);
971
972 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); }
973 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
974 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
975
976 // Building nodes
977 void rethrow_exceptions(JVMState* jvms);
978 void return_values(JVMState* jvms);
979 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
980
981 // Decide how to build a call.
982 // The profile factor is a discount to apply to this site's interp. profile.
983 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch,
984 JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = nullptr,
985 bool allow_intrinsics = true);
986 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
987 return C->directive()->should_delay_inline(call_method) ||
988 should_delay_string_inlining(call_method, jvms) ||
989 should_delay_boxing_inlining(call_method, jvms) ||
990 should_delay_vector_inlining(call_method, jvms);
991 }
992 bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
1195 // Number of outgoing stack slots killed above the out_preserve_stack_slots
1196 // for calls to C. Supports the var-args backing area for register parms.
1197 uint varargs_C_out_slots_killed() const;
1198
1199 // Number of Stack Slots consumed by a synchronization entry
1200 int sync_stack_slots() const;
1201
1202 // Compute the name of old_SP. See <arch>.ad for frame layout.
1203 OptoReg::Name compute_old_SP();
1204
1205 private:
1206 // Phase control:
1207 void Init(bool aliasing); // Prepare for a single compilation
1208 void Optimize(); // Given a graph, optimize it
1209 void Code_Gen(); // Generate code from a graph
1210
1211 // Management of the AliasType table.
1212 void grow_alias_types();
1213 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1214 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1215 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field);
1216
1217 void verify_top(Node*) const PRODUCT_RETURN;
1218
1219 // Intrinsic setup.
1220 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
1221 int intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found); // helper
1222 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
1223 void register_intrinsic(CallGenerator* cg); // update fn
1224
1225 #ifndef PRODUCT
1226 static juint _intrinsic_hist_count[];
1227 static jubyte _intrinsic_hist_flags[];
1228 #endif
1229 // Function calls made by the public function final_graph_reshaping.
1230 // No need to be made public as they are not called elsewhere.
1231 void final_graph_reshaping_impl(Node *n, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1232 void final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop, Unique_Node_List& dead_nodes);
1233 void final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1234 void handle_div_mod_op(Node* n, BasicType bt, bool is_unsigned);
1235
1285 // End-of-run dumps.
1286 static void print_statistics() PRODUCT_RETURN;
1287
1288 // Verify ADLC assumptions during startup
1289 static void adlc_verification() PRODUCT_RETURN;
1290
1291 // Definitions of pd methods
1292 static void pd_compiler2_init();
1293
1294 // Static parse-time type checking logic for gen_subtype_check:
1295 enum SubTypeCheckResult { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test };
1296 SubTypeCheckResult static_subtype_check(const TypeKlassPtr* superk, const TypeKlassPtr* subk, bool skip = StressReflectiveCode);
1297
1298 static Node* conv_I2X_index(PhaseGVN* phase, Node* offset, const TypeInt* sizetype,
1299 // Optional control dependency (for example, on range check)
1300 Node* ctrl = nullptr);
1301
1302 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check)
1303 static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl, bool carry_dependency = false);
1304
1305 // Auxiliary methods for randomized fuzzing/stressing
1306 int random();
1307 bool randomized_select(int count);
1308
1309 // seed random number generation and log the seed for repeatability.
1310 void initialize_stress_seed(const DirectiveSet* directive);
1311
1312 // supporting clone_map
1313 CloneMap& clone_map();
1314 void set_clone_map(Dict* d);
1315
1316 bool needs_clinit_barrier(ciField* ik, ciMethod* accessing_method);
1317 bool needs_clinit_barrier(ciMethod* ik, ciMethod* accessing_method);
1318 bool needs_clinit_barrier(ciInstanceKlass* ik, ciMethod* accessing_method);
1319
1320 #ifdef ASSERT
1321 VerifyMeetResult* _type_verify;
1322 void set_exception_backedge() { _exception_backedge = true; }
1323 bool has_exception_backedge() const { return _exception_backedge; }
1324 #endif
1325
|
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?
612 bool major_progress() const { return _major_progress; }
613 void set_major_progress() { _major_progress = true; }
614 void restore_major_progress(bool progress) { _major_progress = _major_progress || progress; }
615 void clear_major_progress() { _major_progress = false; }
616 int max_inline_size() const { return _max_inline_size; }
617 void set_freq_inline_size(int n) { _freq_inline_size = n; }
618 int freq_inline_size() const { return _freq_inline_size; }
619 void set_max_inline_size(int n) { _max_inline_size = n; }
620 bool has_loops() const { return _has_loops; }
621 void set_has_loops(bool z) { _has_loops = z; }
622 bool has_split_ifs() const { return _has_split_ifs; }
623 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
624 bool has_unsafe_access() const { return _has_unsafe_access; }
625 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
626 bool has_stringbuilder() const { return _has_stringbuilder; }
627 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
628 bool has_boxed_value() const { return _has_boxed_value; }
629 void set_has_boxed_value(bool z) { _has_boxed_value = z; }
630 bool has_reserved_stack_access() const { return _has_reserved_stack_access; }
631 void set_has_reserved_stack_access(bool z) { _has_reserved_stack_access = z; }
632 bool has_circular_inline_type() const { return _has_circular_inline_type; }
633 void set_has_circular_inline_type(bool z) { _has_circular_inline_type = z; }
634 uint max_vector_size() const { return _max_vector_size; }
635 void set_max_vector_size(uint s) { _max_vector_size = s; }
636 bool clear_upper_avx() const { return _clear_upper_avx; }
637 void set_clear_upper_avx(bool s) { _clear_upper_avx = s; }
638 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
639 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
640 bool trap_can_recompile() const { return _trap_can_recompile; }
641 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
642 uint decompile_count() const { return _decompile_count; }
643 void set_decompile_count(uint c) { _decompile_count = c; }
644 bool allow_range_check_smearing() const;
645 bool do_inlining() const { return _do_inlining; }
646 void set_do_inlining(bool z) { _do_inlining = z; }
647 bool do_scheduling() const { return _do_scheduling; }
648 void set_do_scheduling(bool z) { _do_scheduling = z; }
649 bool do_freq_based_layout() const{ return _do_freq_based_layout; }
650 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
651 bool do_vector_loop() const { return _do_vector_loop; }
652 void set_do_vector_loop(bool z) { _do_vector_loop = z; }
653 bool use_cmove() const { return _use_cmove; }
654 void set_use_cmove(bool z) { _use_cmove = z; }
655 bool do_aliasing() const { return _do_aliasing; }
656 bool print_assembly() const { return _print_assembly; }
657 void set_print_assembly(bool z) { _print_assembly = z; }
658 bool print_inlining() const { return _print_inlining; }
659 void set_print_inlining(bool z) { _print_inlining = z; }
660 bool print_intrinsics() const { return _print_intrinsics; }
661 void set_print_intrinsics(bool z) { _print_intrinsics = z; }
662 uint max_node_limit() const { return (uint)_max_node_limit; }
663 void set_max_node_limit(uint n) { _max_node_limit = n; }
664 bool clinit_barrier_on_entry() { return _clinit_barrier_on_entry; }
665 void set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
666 void set_flat_accesses() { _has_flat_accesses = true; }
667 bool flat_accesses_share_alias() const { return _flat_accesses_share_alias; }
668 void set_flat_accesses_share_alias(bool z) { _flat_accesses_share_alias = z; }
669 bool scalarize_in_safepoints() const { return _scalarize_in_safepoints; }
670 void set_scalarize_in_safepoints(bool z) { _scalarize_in_safepoints = z; }
671
672 // Support for scalarized inline type calling convention
673 bool has_scalarized_args() const { return _method != nullptr && _method->has_scalarized_args(); }
674 bool needs_stack_repair() const { return _method != nullptr && _method->get_Method()->c2_needs_stack_repair(); }
675
676 bool has_monitors() const { return _has_monitors; }
677 void set_has_monitors(bool v) { _has_monitors = v; }
678 bool has_scoped_access() const { return _has_scoped_access; }
679 void set_has_scoped_access(bool v) { _has_scoped_access = v; }
680
681 // check the CompilerOracle for special behaviours for this compile
682 bool method_has_option(CompileCommandEnum option) const {
683 return method() != nullptr && method()->has_option(option);
684 }
685
686 #ifndef PRODUCT
687 uint next_igv_idx() { return _igv_idx++; }
688 bool trace_opto_output() const { return _trace_opto_output; }
689 void print_phase(const char* phase_name);
690 void print_ideal_ir(const char* phase_name);
691 bool should_print_ideal() const { return _directive->PrintIdealOption; }
692 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
693 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
694 int _in_dump_cnt; // Required for dumping ir nodes.
695 #endif
787 bool coarsened_locks_consistent();
788 void mark_unbalanced_boxes() const;
789
790 bool post_loop_opts_phase() { return _post_loop_opts_phase; }
791 void set_post_loop_opts_phase() { _post_loop_opts_phase = true; }
792 void reset_post_loop_opts_phase() { _post_loop_opts_phase = false; }
793
794 #ifdef ASSERT
795 bool phase_verify_ideal_loop() const { return _phase_verify_ideal_loop; }
796 void set_phase_verify_ideal_loop() { _phase_verify_ideal_loop = true; }
797 void reset_phase_verify_ideal_loop() { _phase_verify_ideal_loop = false; }
798 #endif
799
800 bool allow_macro_nodes() { return _allow_macro_nodes; }
801 void reset_allow_macro_nodes() { _allow_macro_nodes = false; }
802
803 void record_for_post_loop_opts_igvn(Node* n);
804 void remove_from_post_loop_opts_igvn(Node* n);
805 void process_for_post_loop_opts_igvn(PhaseIterGVN& igvn);
806
807 // Keep track of inline type nodes for later processing
808 void add_inline_type(Node* n);
809 void remove_inline_type(Node* n);
810 void process_inline_types(PhaseIterGVN &igvn, bool remove = false);
811
812 void add_flat_access(Node* n);
813 void remove_flat_access(Node* n);
814 void process_flat_accesses(PhaseIterGVN& igvn);
815
816 template <class F>
817 void for_each_flat_access(F consumer) {
818 for (int i = _flat_access_nodes.length() - 1; i >= 0; i--) {
819 consumer(_flat_access_nodes.at(i));
820 }
821 }
822
823 void adjust_flat_array_access_aliases(PhaseIterGVN& igvn);
824
825 void record_unstable_if_trap(UnstableIfTrap* trap);
826 bool remove_unstable_if_trap(CallStaticJavaNode* unc, bool yield);
827 void remove_useless_unstable_if_traps(Unique_Node_List &useful);
828 void process_for_unstable_if_traps(PhaseIterGVN& igvn);
829
830 bool merge_stores_phase() { return _merge_stores_phase; }
831 void set_merge_stores_phase() { _merge_stores_phase = true; }
832 void record_for_merge_stores_igvn(Node* n);
833 void remove_from_merge_stores_igvn(Node* n);
834 void process_for_merge_stores_igvn(PhaseIterGVN& igvn);
835
836 void shuffle_macro_nodes();
837 void sort_macro_nodes();
838
839 void mark_parse_predicate_nodes_useless(PhaseIterGVN& igvn);
840
841 // Are there candidate expensive nodes for optimization?
842 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
843 // Check whether n1 and n2 are similar
844 static int cmp_expensive_nodes(Node* n1, Node* n2);
987 Arena* type_arena() { return _type_arena; }
988 Dict* type_dict() { return _type_dict; }
989 size_t type_last_size() { return _type_last_size; }
990 int num_alias_types() { return _num_alias_types; }
991
992 void init_type_arena() { _type_arena = &_Compile_types; }
993 void set_type_arena(Arena* a) { _type_arena = a; }
994 void set_type_dict(Dict* d) { _type_dict = d; }
995 void set_type_last_size(size_t sz) { _type_last_size = sz; }
996
997 const TypeFunc* last_tf(ciMethod* m) {
998 return (m == _last_tf_m) ? _last_tf : nullptr;
999 }
1000 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
1001 assert(m != nullptr || tf == nullptr, "");
1002 _last_tf_m = m;
1003 _last_tf = tf;
1004 }
1005
1006 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
1007 AliasType* alias_type(const TypePtr* adr_type, ciField* field = nullptr, bool uncached = false) { return find_alias_type(adr_type, false, field, uncached); }
1008 bool have_alias_type(const TypePtr* adr_type);
1009 AliasType* alias_type(ciField* field);
1010
1011 int get_alias_index(const TypePtr* at, bool uncached = false) { return alias_type(at, nullptr, uncached)->index(); }
1012 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
1013 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
1014
1015 // Building nodes
1016 void rethrow_exceptions(JVMState* jvms);
1017 void return_values(JVMState* jvms);
1018 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
1019
1020 // Decide how to build a call.
1021 // The profile factor is a discount to apply to this site's interp. profile.
1022 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch,
1023 JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = nullptr,
1024 bool allow_intrinsics = true);
1025 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
1026 return C->directive()->should_delay_inline(call_method) ||
1027 should_delay_string_inlining(call_method, jvms) ||
1028 should_delay_boxing_inlining(call_method, jvms) ||
1029 should_delay_vector_inlining(call_method, jvms);
1030 }
1031 bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
1234 // Number of outgoing stack slots killed above the out_preserve_stack_slots
1235 // for calls to C. Supports the var-args backing area for register parms.
1236 uint varargs_C_out_slots_killed() const;
1237
1238 // Number of Stack Slots consumed by a synchronization entry
1239 int sync_stack_slots() const;
1240
1241 // Compute the name of old_SP. See <arch>.ad for frame layout.
1242 OptoReg::Name compute_old_SP();
1243
1244 private:
1245 // Phase control:
1246 void Init(bool aliasing); // Prepare for a single compilation
1247 void Optimize(); // Given a graph, optimize it
1248 void Code_Gen(); // Generate code from a graph
1249
1250 // Management of the AliasType table.
1251 void grow_alias_types();
1252 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1253 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1254 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field, bool uncached = false);
1255
1256 void verify_top(Node*) const PRODUCT_RETURN;
1257
1258 // Intrinsic setup.
1259 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
1260 int intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found); // helper
1261 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
1262 void register_intrinsic(CallGenerator* cg); // update fn
1263
1264 #ifndef PRODUCT
1265 static juint _intrinsic_hist_count[];
1266 static jubyte _intrinsic_hist_flags[];
1267 #endif
1268 // Function calls made by the public function final_graph_reshaping.
1269 // No need to be made public as they are not called elsewhere.
1270 void final_graph_reshaping_impl(Node *n, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1271 void final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop, Unique_Node_List& dead_nodes);
1272 void final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1273 void handle_div_mod_op(Node* n, BasicType bt, bool is_unsigned);
1274
1324 // End-of-run dumps.
1325 static void print_statistics() PRODUCT_RETURN;
1326
1327 // Verify ADLC assumptions during startup
1328 static void adlc_verification() PRODUCT_RETURN;
1329
1330 // Definitions of pd methods
1331 static void pd_compiler2_init();
1332
1333 // Static parse-time type checking logic for gen_subtype_check:
1334 enum SubTypeCheckResult { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test };
1335 SubTypeCheckResult static_subtype_check(const TypeKlassPtr* superk, const TypeKlassPtr* subk, bool skip = StressReflectiveCode);
1336
1337 static Node* conv_I2X_index(PhaseGVN* phase, Node* offset, const TypeInt* sizetype,
1338 // Optional control dependency (for example, on range check)
1339 Node* ctrl = nullptr);
1340
1341 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check)
1342 static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl, bool carry_dependency = false);
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
|