165 void dump(node_idx_t key, outputStream* st) const;
166
167 int clone_idx() const { return _clone_idx; }
168 void set_clone_idx(int x) { _clone_idx = x; }
169 bool is_debug() const { return _debug; }
170 void set_debug(bool debug) { _debug = debug; }
171
172 bool same_idx(node_idx_t k1, node_idx_t k2) const { return idx(k1) == idx(k2); }
173 bool same_gen(node_idx_t k1, node_idx_t k2) const { return gen(k1) == gen(k2); }
174 };
175
176 class Options {
177 friend class Compile;
178 private:
179 const bool _subsume_loads; // Load can be matched as part of a larger op.
180 const bool _do_escape_analysis; // Do escape analysis.
181 const bool _do_iterative_escape_analysis; // Do iterative escape analysis.
182 const bool _do_reduce_allocation_merges; // Do try to reduce allocation merges.
183 const bool _eliminate_boxing; // Do boxing elimination.
184 const bool _do_locks_coarsening; // Do locks coarsening
185 const bool _do_superword; // Do SuperWord
186 const bool _install_code; // Install the code that was compiled
187 public:
188 Options(bool subsume_loads,
189 bool do_escape_analysis,
190 bool do_iterative_escape_analysis,
191 bool do_reduce_allocation_merges,
192 bool eliminate_boxing,
193 bool do_locks_coarsening,
194 bool do_superword,
195 bool install_code) :
196 _subsume_loads(subsume_loads),
197 _do_escape_analysis(do_escape_analysis),
198 _do_iterative_escape_analysis(do_iterative_escape_analysis),
199 _do_reduce_allocation_merges(do_reduce_allocation_merges),
200 _eliminate_boxing(eliminate_boxing),
201 _do_locks_coarsening(do_locks_coarsening),
202 _do_superword(do_superword),
203 _install_code(install_code) {
204 }
205
206 static Options for_runtime_stub() {
207 return Options(
208 /* subsume_loads = */ true,
209 /* do_escape_analysis = */ false,
210 /* do_iterative_escape_analysis = */ false,
211 /* do_reduce_allocation_merges = */ false,
212 /* eliminate_boxing = */ false,
213 /* do_lock_coarsening = */ false,
214 /* do_superword = */ true,
215 /* install_code = */ true
216 );
217 }
218 };
219
220 //------------------------------Compile----------------------------------------
221 // This class defines a top-level Compiler invocation.
222
223 class Compile : public Phase {
224
225 public:
226 // Fixed alias indexes. (See also MergeMemNode.)
227 enum {
228 AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value)
229 AliasIdxBot = 2, // pseudo-index, aliases to everything
230 AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM
231 };
232
233 // Variant of TraceTime(nullptr, &_t_accumulator, CITime);
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
558 int compile_id() const { return _compile_id; }
559 DirectiveSet* directive() const { return _directive; }
560
561 // Does this compilation allow instructions to subsume loads? User
562 // instructions that subsume a load may result in an unschedulable
563 // instruction sequence.
564 bool subsume_loads() const { return _options._subsume_loads; }
565 /** Do escape analysis. */
566 bool do_escape_analysis() const { return _options._do_escape_analysis; }
567 bool do_iterative_escape_analysis() const { return _options._do_iterative_escape_analysis; }
568 bool do_reduce_allocation_merges() const { return _options._do_reduce_allocation_merges; }
569 /** Do boxing elimination. */
570 bool eliminate_boxing() const { return _options._eliminate_boxing; }
571 /** Do aggressive boxing elimination. */
572 bool aggressive_unboxing() const { return _options._eliminate_boxing && AggressiveUnboxing; }
573 bool should_install_code() const { return _options._install_code; }
574 /** Do locks coarsening. */
575 bool do_locks_coarsening() const { return _options._do_locks_coarsening; }
576 bool do_superword() const { return _options._do_superword; }
577
578 // Other fixed compilation parameters.
579 ciMethod* method() const { return _method; }
580 int entry_bci() const { return _entry_bci; }
581 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
582 bool is_method_compilation() const { return (_method != nullptr && !_method->flags().is_native()); }
583 const TypeFunc* tf() const { assert(_tf!=nullptr, ""); return _tf; }
584 void init_tf(const TypeFunc* tf) { assert(_tf==nullptr, ""); _tf = tf; }
585 InlineTree* ilt() const { return _ilt; }
586 address stub_function() const { return _stub_function; }
587 const char* stub_name() const { return _stub_name; }
588 StubId stub_id() const { return _stub_id; }
589 address stub_entry_point() const { return _stub_entry_point; }
590 void set_stub_entry_point(address z) { _stub_entry_point = z; }
591
592 // Control of this compilation.
593 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
594 void set_fixed_slots(int n) { _fixed_slots = n; }
595 void set_inlining_progress(bool z) { _inlining_progress = z; }
596 int inlining_progress() const { return _inlining_progress; }
597 void set_inlining_incrementally(bool z) { _inlining_incrementally = z; }
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
673 bool has_irreducible_loop() const { return _has_irreducible_loop; }
674 void set_has_irreducible_loop(bool z) { _has_irreducible_loop = z; }
675
676 Ticks _latest_stage_start_counter;
|
165 void dump(node_idx_t key, outputStream* st) const;
166
167 int clone_idx() const { return _clone_idx; }
168 void set_clone_idx(int x) { _clone_idx = x; }
169 bool is_debug() const { return _debug; }
170 void set_debug(bool debug) { _debug = debug; }
171
172 bool same_idx(node_idx_t k1, node_idx_t k2) const { return idx(k1) == idx(k2); }
173 bool same_gen(node_idx_t k1, node_idx_t k2) const { return gen(k1) == gen(k2); }
174 };
175
176 class Options {
177 friend class Compile;
178 private:
179 const bool _subsume_loads; // Load can be matched as part of a larger op.
180 const bool _do_escape_analysis; // Do escape analysis.
181 const bool _do_iterative_escape_analysis; // Do iterative escape analysis.
182 const bool _do_reduce_allocation_merges; // Do try to reduce allocation merges.
183 const bool _eliminate_boxing; // Do boxing elimination.
184 const bool _do_locks_coarsening; // Do locks coarsening
185 const bool _for_preload; // Generate code for preload (before Java method execution), do class init barriers
186 const bool _do_superword; // Do SuperWord
187 const bool _install_code; // Install the code that was compiled
188 public:
189 Options(bool subsume_loads,
190 bool do_escape_analysis,
191 bool do_iterative_escape_analysis,
192 bool do_reduce_allocation_merges,
193 bool eliminate_boxing,
194 bool do_locks_coarsening,
195 bool do_superword,
196 bool for_preload,
197 bool install_code) :
198 _subsume_loads(subsume_loads),
199 _do_escape_analysis(do_escape_analysis),
200 _do_iterative_escape_analysis(do_iterative_escape_analysis),
201 _do_reduce_allocation_merges(do_reduce_allocation_merges),
202 _eliminate_boxing(eliminate_boxing),
203 _do_locks_coarsening(do_locks_coarsening),
204 _for_preload(for_preload),
205 _do_superword(do_superword),
206 _install_code(install_code) {
207 }
208
209 static Options for_runtime_stub() {
210 return Options(
211 /* subsume_loads = */ true,
212 /* do_escape_analysis = */ false,
213 /* do_iterative_escape_analysis = */ false,
214 /* do_reduce_allocation_merges = */ false,
215 /* eliminate_boxing = */ false,
216 /* do_lock_coarsening = */ false,
217 /* for_preload = */ false,
218 /* do_superword = */ true,
219 /* install_code = */ true
220 );
221 }
222 };
223
224 //------------------------------Compile----------------------------------------
225 // This class defines a top-level Compiler invocation.
226
227 class Compile : public Phase {
228
229 public:
230 // Fixed alias indexes. (See also MergeMemNode.)
231 enum {
232 AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value)
233 AliasIdxBot = 2, // pseudo-index, aliases to everything
234 AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM
235 };
236
237 // Variant of TraceTime(nullptr, &_t_accumulator, CITime);
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 bool _has_clinit_barriers; // True if compiled code has clinit barriers
374 int _loop_opts_cnt; // loop opts round
375 uint _stress_seed; // Seed for stress testing
376
377 // Compilation environment.
378 Arena _comp_arena; // Arena with lifetime equivalent to Compile
379 void* _barrier_set_state; // Potential GC barrier state for Compile
380 ciEnv* _env; // CI interface
381 DirectiveSet* _directive; // Compiler directive
382 CompileLog* _log; // from CompilerThread
383 CHeapStringHolder _failure_reason; // for record_failure/failing pattern
384 CompilationFailureInfo* _first_failure_details; // Details for the first failure happening during compilation
385 GrowableArray<CallGenerator*> _intrinsics; // List of intrinsics.
386 GrowableArray<Node*> _macro_nodes; // List of nodes which need to be expanded before matching.
387 GrowableArray<ParsePredicateNode*> _parse_predicates; // List of Parse Predicates.
388 // List of OpaqueTemplateAssertionPredicateNode nodes for Template Assertion Predicates which can be seen as list
389 // of Template Assertion Predicates themselves.
390 GrowableArray<OpaqueTemplateAssertionPredicateNode*> _template_assertion_predicate_opaques;
391 GrowableArray<Node*> _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
392 GrowableArray<Node*> _for_post_loop_igvn; // List of nodes for IGVN after loop opts are over
393 GrowableArray<Node*> _for_merge_stores_igvn; // List of nodes for IGVN merge stores
563 int compile_id() const { return _compile_id; }
564 DirectiveSet* directive() const { return _directive; }
565
566 // Does this compilation allow instructions to subsume loads? User
567 // instructions that subsume a load may result in an unschedulable
568 // instruction sequence.
569 bool subsume_loads() const { return _options._subsume_loads; }
570 /** Do escape analysis. */
571 bool do_escape_analysis() const { return _options._do_escape_analysis; }
572 bool do_iterative_escape_analysis() const { return _options._do_iterative_escape_analysis; }
573 bool do_reduce_allocation_merges() const { return _options._do_reduce_allocation_merges; }
574 /** Do boxing elimination. */
575 bool eliminate_boxing() const { return _options._eliminate_boxing; }
576 /** Do aggressive boxing elimination. */
577 bool aggressive_unboxing() const { return _options._eliminate_boxing && AggressiveUnboxing; }
578 bool should_install_code() const { return _options._install_code; }
579 /** Do locks coarsening. */
580 bool do_locks_coarsening() const { return _options._do_locks_coarsening; }
581 bool do_superword() const { return _options._do_superword; }
582
583 bool do_clinit_barriers() const { return _options._for_preload; }
584 bool for_preload() const { return _options._for_preload; }
585
586 // Other fixed compilation parameters.
587 ciMethod* method() const { return _method; }
588 int entry_bci() const { return _entry_bci; }
589 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
590 bool is_method_compilation() const { return (_method != nullptr && !_method->flags().is_native()); }
591 const TypeFunc* tf() const { assert(_tf!=nullptr, ""); return _tf; }
592 void init_tf(const TypeFunc* tf) { assert(_tf==nullptr, ""); _tf = tf; }
593 InlineTree* ilt() const { return _ilt; }
594 address stub_function() const { return _stub_function; }
595 const char* stub_name() const { return _stub_name; }
596 StubId stub_id() const { return _stub_id; }
597 address stub_entry_point() const { return _stub_entry_point; }
598 void set_stub_entry_point(address z) { _stub_entry_point = z; }
599
600 // Control of this compilation.
601 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
602 void set_fixed_slots(int n) { _fixed_slots = n; }
603 void set_inlining_progress(bool z) { _inlining_progress = z; }
604 int inlining_progress() const { return _inlining_progress; }
605 void set_inlining_incrementally(bool z) { _inlining_incrementally = z; }
645 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
646 bool do_vector_loop() const { return _do_vector_loop; }
647 void set_do_vector_loop(bool z) { _do_vector_loop = z; }
648 bool use_cmove() const { return _use_cmove; }
649 void set_use_cmove(bool z) { _use_cmove = z; }
650 bool do_aliasing() const { return _do_aliasing; }
651 bool print_assembly() const { return _print_assembly; }
652 void set_print_assembly(bool z) { _print_assembly = z; }
653 bool print_inlining() const { return _print_inlining; }
654 void set_print_inlining(bool z) { _print_inlining = z; }
655 bool print_intrinsics() const { return _print_intrinsics; }
656 void set_print_intrinsics(bool z) { _print_intrinsics = z; }
657 uint max_node_limit() const { return (uint)_max_node_limit; }
658 void set_max_node_limit(uint n) { _max_node_limit = n; }
659 bool clinit_barrier_on_entry() { return _clinit_barrier_on_entry; }
660 void set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
661 bool has_monitors() const { return _has_monitors; }
662 void set_has_monitors(bool v) { _has_monitors = v; }
663 bool has_scoped_access() const { return _has_scoped_access; }
664 void set_has_scoped_access(bool v) { _has_scoped_access = v; }
665 bool has_clinit_barriers() { return _has_clinit_barriers; }
666 void set_has_clinit_barriers(bool z) { _has_clinit_barriers = z; }
667
668 // check the CompilerOracle for special behaviours for this compile
669 bool method_has_option(CompileCommandEnum option) const {
670 return method() != nullptr && method()->has_option(option);
671 }
672
673 #ifndef PRODUCT
674 uint next_igv_idx() { return _igv_idx++; }
675 bool trace_opto_output() const { return _trace_opto_output; }
676 void print_phase(const char* phase_name);
677 void print_ideal_ir(const char* phase_name);
678 bool should_print_ideal() const { return _directive->PrintIdealOption; }
679 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
680 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
681 int _in_dump_cnt; // Required for dumping ir nodes.
682 #endif
683 bool has_irreducible_loop() const { return _has_irreducible_loop; }
684 void set_has_irreducible_loop(bool z) { _has_irreducible_loop = z; }
685
686 Ticks _latest_stage_start_counter;
|