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);
340 bool _do_scheduling; // True if we intend to do scheduling
341 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
342 bool _do_vector_loop; // True if allowed to execute loop in parallel iterations
343 bool _use_cmove; // True if CMove should be used without profitability analysis
344 bool _do_aliasing; // True if we intend to do aliasing
345 bool _print_assembly; // True if we should dump assembly code for this compilation
346 bool _print_inlining; // True if we should print inlining for this compilation
347 bool _print_intrinsics; // True if we should print intrinsics for this compilation
348 #ifndef PRODUCT
349 uint _igv_idx; // Counter for IGV node identifiers
350 uint _igv_phase_iter[PHASE_NUM_TYPES]; // Counters for IGV phase iterations
351 bool _trace_opto_output;
352 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
353 #endif
354 bool _has_irreducible_loop; // Found irreducible loops
355 // JSR 292
356 bool _has_method_handle_invokes; // True if this method has MethodHandle invokes.
357 bool _has_monitors; // Metadata transfered to nmethod to enable Continuations lock-detection fastpath
358 bool _has_scoped_access; // For shared scope closure
359 bool _clinit_barrier_on_entry; // True if clinit barrier is needed on nmethod entry
360 int _loop_opts_cnt; // loop opts round
361 uint _stress_seed; // Seed for stress testing
362
363 // Compilation environment.
364 Arena _comp_arena; // Arena with lifetime equivalent to Compile
365 void* _barrier_set_state; // Potential GC barrier state for Compile
366 ciEnv* _env; // CI interface
367 DirectiveSet* _directive; // Compiler directive
368 CompileLog* _log; // from CompilerThread
369 CHeapStringHolder _failure_reason; // for record_failure/failing pattern
370 CompilationFailureInfo* _first_failure_details; // Details for the first failure happening during compilation
371 GrowableArray<CallGenerator*> _intrinsics; // List of intrinsics.
372 GrowableArray<Node*> _macro_nodes; // List of nodes which need to be expanded before matching.
373 GrowableArray<ParsePredicateNode*> _parse_predicates; // List of Parse Predicates.
374 // List of OpaqueTemplateAssertionPredicateNode nodes for Template Assertion Predicates which can be seen as list
375 // of Template Assertion Predicates themselves.
376 GrowableArray<OpaqueTemplateAssertionPredicateNode*> _template_assertion_predicate_opaques;
377 GrowableArray<Node*> _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
378 GrowableArray<Node*> _for_post_loop_igvn; // List of nodes for IGVN after loop opts are over
379 GrowableArray<Node*> _for_merge_stores_igvn; // List of nodes for IGVN merge stores
543 int compile_id() const { return _compile_id; }
544 DirectiveSet* directive() const { return _directive; }
545
546 // Does this compilation allow instructions to subsume loads? User
547 // instructions that subsume a load may result in an unschedulable
548 // instruction sequence.
549 bool subsume_loads() const { return _options._subsume_loads; }
550 /** Do escape analysis. */
551 bool do_escape_analysis() const { return _options._do_escape_analysis; }
552 bool do_iterative_escape_analysis() const { return _options._do_iterative_escape_analysis; }
553 bool do_reduce_allocation_merges() const { return _options._do_reduce_allocation_merges; }
554 /** Do boxing elimination. */
555 bool eliminate_boxing() const { return _options._eliminate_boxing; }
556 /** Do aggressive boxing elimination. */
557 bool aggressive_unboxing() const { return _options._eliminate_boxing && AggressiveUnboxing; }
558 bool should_install_code() const { return _options._install_code; }
559 /** Do locks coarsening. */
560 bool do_locks_coarsening() const { return _options._do_locks_coarsening; }
561 bool do_superword() const { return _options._do_superword; }
562
563 // Other fixed compilation parameters.
564 ciMethod* method() const { return _method; }
565 int entry_bci() const { return _entry_bci; }
566 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
567 bool is_method_compilation() const { return (_method != nullptr && !_method->flags().is_native()); }
568 const TypeFunc* tf() const { assert(_tf!=nullptr, ""); return _tf; }
569 void init_tf(const TypeFunc* tf) { assert(_tf==nullptr, ""); _tf = tf; }
570 InlineTree* ilt() const { return _ilt; }
571 address stub_function() const { return _stub_function; }
572 const char* stub_name() const { return _stub_name; }
573 address stub_entry_point() const { return _stub_entry_point; }
574 void set_stub_entry_point(address z) { _stub_entry_point = z; }
575
576 // Control of this compilation.
577 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
578 void set_fixed_slots(int n) { _fixed_slots = n; }
579 int major_progress() const { return _major_progress; }
580 void set_inlining_progress(bool z) { _inlining_progress = z; }
581 int inlining_progress() const { return _inlining_progress; }
582 void set_inlining_incrementally(bool z) { _inlining_incrementally = z; }
621 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
622 bool do_vector_loop() const { return _do_vector_loop; }
623 void set_do_vector_loop(bool z) { _do_vector_loop = z; }
624 bool use_cmove() const { return _use_cmove; }
625 void set_use_cmove(bool z) { _use_cmove = z; }
626 bool do_aliasing() const { return _do_aliasing; }
627 bool print_assembly() const { return _print_assembly; }
628 void set_print_assembly(bool z) { _print_assembly = z; }
629 bool print_inlining() const { return _print_inlining; }
630 void set_print_inlining(bool z) { _print_inlining = z; }
631 bool print_intrinsics() const { return _print_intrinsics; }
632 void set_print_intrinsics(bool z) { _print_intrinsics = z; }
633 uint max_node_limit() const { return (uint)_max_node_limit; }
634 void set_max_node_limit(uint n) { _max_node_limit = n; }
635 bool clinit_barrier_on_entry() { return _clinit_barrier_on_entry; }
636 void set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
637 bool has_monitors() const { return _has_monitors; }
638 void set_has_monitors(bool v) { _has_monitors = v; }
639 bool has_scoped_access() const { return _has_scoped_access; }
640 void set_has_scoped_access(bool v) { _has_scoped_access = v; }
641
642 // check the CompilerOracle for special behaviours for this compile
643 bool method_has_option(CompileCommandEnum option) {
644 return method() != nullptr && method()->has_option(option);
645 }
646
647 #ifndef PRODUCT
648 uint next_igv_idx() { return _igv_idx++; }
649 bool trace_opto_output() const { return _trace_opto_output; }
650 void print_ideal_ir(const char* phase_name);
651 bool should_print_ideal() const { return _directive->PrintIdealOption; }
652 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
653 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
654 int _in_dump_cnt; // Required for dumping ir nodes.
655 #endif
656 bool has_irreducible_loop() const { return _has_irreducible_loop; }
657 void set_has_irreducible_loop(bool z) { _has_irreducible_loop = z; }
658
659 // JSR 292
660 bool has_method_handle_invokes() const { return _has_method_handle_invokes; }
|
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);
344 bool _do_scheduling; // True if we intend to do scheduling
345 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
346 bool _do_vector_loop; // True if allowed to execute loop in parallel iterations
347 bool _use_cmove; // True if CMove should be used without profitability analysis
348 bool _do_aliasing; // True if we intend to do aliasing
349 bool _print_assembly; // True if we should dump assembly code for this compilation
350 bool _print_inlining; // True if we should print inlining for this compilation
351 bool _print_intrinsics; // True if we should print intrinsics for this compilation
352 #ifndef PRODUCT
353 uint _igv_idx; // Counter for IGV node identifiers
354 uint _igv_phase_iter[PHASE_NUM_TYPES]; // Counters for IGV phase iterations
355 bool _trace_opto_output;
356 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
357 #endif
358 bool _has_irreducible_loop; // Found irreducible loops
359 // JSR 292
360 bool _has_method_handle_invokes; // True if this method has MethodHandle invokes.
361 bool _has_monitors; // Metadata transfered to nmethod to enable Continuations lock-detection fastpath
362 bool _has_scoped_access; // For shared scope closure
363 bool _clinit_barrier_on_entry; // True if clinit barrier is needed on nmethod entry
364 bool _has_clinit_barriers; // True if compiled code has clinit barriers
365 int _loop_opts_cnt; // loop opts round
366 uint _stress_seed; // Seed for stress testing
367
368 // Compilation environment.
369 Arena _comp_arena; // Arena with lifetime equivalent to Compile
370 void* _barrier_set_state; // Potential GC barrier state for Compile
371 ciEnv* _env; // CI interface
372 DirectiveSet* _directive; // Compiler directive
373 CompileLog* _log; // from CompilerThread
374 CHeapStringHolder _failure_reason; // for record_failure/failing pattern
375 CompilationFailureInfo* _first_failure_details; // Details for the first failure happening during compilation
376 GrowableArray<CallGenerator*> _intrinsics; // List of intrinsics.
377 GrowableArray<Node*> _macro_nodes; // List of nodes which need to be expanded before matching.
378 GrowableArray<ParsePredicateNode*> _parse_predicates; // List of Parse Predicates.
379 // List of OpaqueTemplateAssertionPredicateNode nodes for Template Assertion Predicates which can be seen as list
380 // of Template Assertion Predicates themselves.
381 GrowableArray<OpaqueTemplateAssertionPredicateNode*> _template_assertion_predicate_opaques;
382 GrowableArray<Node*> _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
383 GrowableArray<Node*> _for_post_loop_igvn; // List of nodes for IGVN after loop opts are over
384 GrowableArray<Node*> _for_merge_stores_igvn; // List of nodes for IGVN merge stores
548 int compile_id() const { return _compile_id; }
549 DirectiveSet* directive() const { return _directive; }
550
551 // Does this compilation allow instructions to subsume loads? User
552 // instructions that subsume a load may result in an unschedulable
553 // instruction sequence.
554 bool subsume_loads() const { return _options._subsume_loads; }
555 /** Do escape analysis. */
556 bool do_escape_analysis() const { return _options._do_escape_analysis; }
557 bool do_iterative_escape_analysis() const { return _options._do_iterative_escape_analysis; }
558 bool do_reduce_allocation_merges() const { return _options._do_reduce_allocation_merges; }
559 /** Do boxing elimination. */
560 bool eliminate_boxing() const { return _options._eliminate_boxing; }
561 /** Do aggressive boxing elimination. */
562 bool aggressive_unboxing() const { return _options._eliminate_boxing && AggressiveUnboxing; }
563 bool should_install_code() const { return _options._install_code; }
564 /** Do locks coarsening. */
565 bool do_locks_coarsening() const { return _options._do_locks_coarsening; }
566 bool do_superword() const { return _options._do_superword; }
567
568 bool do_clinit_barriers() const { return _options._for_preload; }
569 bool for_preload() const { return _options._for_preload; }
570
571 // Other fixed compilation parameters.
572 ciMethod* method() const { return _method; }
573 int entry_bci() const { return _entry_bci; }
574 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
575 bool is_method_compilation() const { return (_method != nullptr && !_method->flags().is_native()); }
576 const TypeFunc* tf() const { assert(_tf!=nullptr, ""); return _tf; }
577 void init_tf(const TypeFunc* tf) { assert(_tf==nullptr, ""); _tf = tf; }
578 InlineTree* ilt() const { return _ilt; }
579 address stub_function() const { return _stub_function; }
580 const char* stub_name() const { return _stub_name; }
581 address stub_entry_point() const { return _stub_entry_point; }
582 void set_stub_entry_point(address z) { _stub_entry_point = z; }
583
584 // Control of this compilation.
585 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
586 void set_fixed_slots(int n) { _fixed_slots = n; }
587 int major_progress() const { return _major_progress; }
588 void set_inlining_progress(bool z) { _inlining_progress = z; }
589 int inlining_progress() const { return _inlining_progress; }
590 void set_inlining_incrementally(bool z) { _inlining_incrementally = z; }
629 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
630 bool do_vector_loop() const { return _do_vector_loop; }
631 void set_do_vector_loop(bool z) { _do_vector_loop = z; }
632 bool use_cmove() const { return _use_cmove; }
633 void set_use_cmove(bool z) { _use_cmove = z; }
634 bool do_aliasing() const { return _do_aliasing; }
635 bool print_assembly() const { return _print_assembly; }
636 void set_print_assembly(bool z) { _print_assembly = z; }
637 bool print_inlining() const { return _print_inlining; }
638 void set_print_inlining(bool z) { _print_inlining = z; }
639 bool print_intrinsics() const { return _print_intrinsics; }
640 void set_print_intrinsics(bool z) { _print_intrinsics = z; }
641 uint max_node_limit() const { return (uint)_max_node_limit; }
642 void set_max_node_limit(uint n) { _max_node_limit = n; }
643 bool clinit_barrier_on_entry() { return _clinit_barrier_on_entry; }
644 void set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
645 bool has_monitors() const { return _has_monitors; }
646 void set_has_monitors(bool v) { _has_monitors = v; }
647 bool has_scoped_access() const { return _has_scoped_access; }
648 void set_has_scoped_access(bool v) { _has_scoped_access = v; }
649 bool has_clinit_barriers() { return _has_clinit_barriers; }
650 void set_has_clinit_barriers(bool z) { _has_clinit_barriers = z; }
651
652 // check the CompilerOracle for special behaviours for this compile
653 bool method_has_option(CompileCommandEnum option) {
654 return method() != nullptr && method()->has_option(option);
655 }
656
657 #ifndef PRODUCT
658 uint next_igv_idx() { return _igv_idx++; }
659 bool trace_opto_output() const { return _trace_opto_output; }
660 void print_ideal_ir(const char* phase_name);
661 bool should_print_ideal() const { return _directive->PrintIdealOption; }
662 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
663 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
664 int _in_dump_cnt; // Required for dumping ir nodes.
665 #endif
666 bool has_irreducible_loop() const { return _has_irreducible_loop; }
667 void set_has_irreducible_loop(bool z) { _has_irreducible_loop = z; }
668
669 // JSR 292
670 bool has_method_handle_invokes() const { return _has_method_handle_invokes; }
|