1 /*
2 * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_OPTO_COMPILE_HPP
26 #define SHARE_OPTO_COMPILE_HPP
27
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;
78 class ParsePredicateNode;
79 class PhaseCFG;
80 class PhaseGVN;
81 class PhaseIterGVN;
82 class PhaseRegAlloc;
83 class PhaseCCP;
84 class PhaseOutput;
85 class ReachabilityFenceNode;
86 class RootNode;
87 class relocInfo;
88 class StartNode;
89 class SafePointNode;
90 class JVMState;
91 class Type;
92 class TypeInt;
93 class TypeInteger;
94 class TypeKlassPtr;
95 class TypePtr;
96 class TypeOopPtr;
97 class TypeFunc;
98 class TypeVect;
99 class Type_Array;
100 class Unique_Node_List;
101 class UnstableIfTrap;
102 class InlineTypeNode;
103 class nmethod;
104 class Node_Stack;
105 struct Final_Reshape_Counts;
106 class VerifyMeetResult;
107
108 enum LoopOptsMode {
109 LoopOptsDefault,
110 LoopOptsNone,
111 LoopOptsMaxUnroll,
112 LoopOptsShenandoahExpand,
113 LoopOptsSkipSplitIf,
114 LoopOptsVerify,
115 PostLoopOptsExpandReachabilityFences
116 };
117
118 // The type of all node counts and indexes.
119 // It must hold at least 16 bits, but must also be fast to load and store.
120 // This type, if less than 32 bits, could limit the number of possible nodes.
121 // (To make this type platform-specific, move to globalDefinitions_xxx.hpp.)
122 typedef unsigned int node_idx_t;
123
124 class NodeCloneInfo {
125 private:
126 uint64_t _idx_clone_orig;
127 public:
128
129 void set_idx(node_idx_t idx) {
130 _idx_clone_orig = (_idx_clone_orig & CONST64(0xFFFFFFFF00000000)) | idx;
131 }
132 node_idx_t idx() const { return (node_idx_t)(_idx_clone_orig & 0xFFFFFFFF); }
133
134 void set_gen(int generation) {
135 uint64_t g = (uint64_t)generation << 32;
136 _idx_clone_orig = (_idx_clone_orig & 0xFFFFFFFF) | g;
137 }
138 int gen() const { return (int)(_idx_clone_orig >> 32); }
139
140 void set(uint64_t x) { _idx_clone_orig = x; }
141 void set(node_idx_t x, int g) { set_idx(x); set_gen(g); }
142 uint64_t get() const { return _idx_clone_orig; }
143
144 NodeCloneInfo(uint64_t idx_clone_orig) : _idx_clone_orig(idx_clone_orig) {}
145 NodeCloneInfo(node_idx_t x, int g) : _idx_clone_orig(0) { set(x, g); }
146
147 void dump_on(outputStream* st) const;
148 };
149
150 class CloneMap {
151 friend class Compile;
152 private:
153 bool _debug;
154 Dict* _dict;
155 int _clone_idx; // current cloning iteration/generation in loop unroll
156 public:
157 void* _2p(node_idx_t key) const { return (void*)(intptr_t)key; } // 2 conversion functions to make gcc happy
158 node_idx_t _2_node_idx_t(const void* k) const { return (node_idx_t)(intptr_t)k; }
159 Dict* dict() const { return _dict; }
160 void insert(node_idx_t key, uint64_t val) { assert(_dict->operator[](_2p(key)) == nullptr, "key existed"); _dict->Insert(_2p(key), (void*)val); }
161 void insert(node_idx_t key, NodeCloneInfo& ci) { insert(key, ci.get()); }
162 void remove(node_idx_t key) { _dict->Delete(_2p(key)); }
163 uint64_t value(node_idx_t key) const { return (uint64_t)_dict->operator[](_2p(key)); }
164 node_idx_t idx(node_idx_t key) const { return NodeCloneInfo(value(key)).idx(); }
165 int gen(node_idx_t key) const { return NodeCloneInfo(value(key)).gen(); }
166 int gen(const void* k) const { return gen(_2_node_idx_t(k)); }
167 int max_gen() const;
168 void clone(Node* old, Node* nnn, int gen);
169 void verify_insert_and_clone(Node* old, Node* nnn, int gen);
170 void dump(node_idx_t key, outputStream* st) const;
171
172 int clone_idx() const { return _clone_idx; }
173 void set_clone_idx(int x) { _clone_idx = x; }
174 bool is_debug() const { return _debug; }
175 void set_debug(bool debug) { _debug = debug; }
176
177 bool same_idx(node_idx_t k1, node_idx_t k2) const { return idx(k1) == idx(k2); }
178 bool same_gen(node_idx_t k1, node_idx_t k2) const { return gen(k1) == gen(k2); }
179 };
180
181 class Options {
182 friend class Compile;
183 private:
184 const bool _subsume_loads; // Load can be matched as part of a larger op.
185 const bool _do_escape_analysis; // Do escape analysis.
186 const bool _do_iterative_escape_analysis; // Do iterative escape analysis.
187 const bool _do_reduce_allocation_merges; // Do try to reduce allocation merges.
188 const bool _eliminate_boxing; // Do boxing elimination.
189 const bool _do_locks_coarsening; // Do locks coarsening
190 const bool _do_superword; // Do SuperWord
191 const bool _install_code; // Install the code that was compiled
192 public:
193 Options(bool subsume_loads,
194 bool do_escape_analysis,
195 bool do_iterative_escape_analysis,
196 bool do_reduce_allocation_merges,
197 bool eliminate_boxing,
198 bool do_locks_coarsening,
199 bool do_superword,
200 bool install_code) :
201 _subsume_loads(subsume_loads),
202 _do_escape_analysis(do_escape_analysis),
203 _do_iterative_escape_analysis(do_iterative_escape_analysis),
204 _do_reduce_allocation_merges(do_reduce_allocation_merges),
205 _eliminate_boxing(eliminate_boxing),
206 _do_locks_coarsening(do_locks_coarsening),
207 _do_superword(do_superword),
208 _install_code(install_code) {
209 }
210
211 static Options for_runtime_stub() {
212 return Options(
213 /* subsume_loads = */ true,
214 /* do_escape_analysis = */ false,
215 /* do_iterative_escape_analysis = */ false,
216 /* do_reduce_allocation_merges = */ false,
217 /* eliminate_boxing = */ false,
218 /* do_lock_coarsening = */ false,
219 /* do_superword = */ true,
220 /* install_code = */ true
221 );
222 }
223 };
224
225 //------------------------------Compile----------------------------------------
226 // This class defines a top-level Compiler invocation.
227
228 class Compile : public Phase {
229
230 public:
231 // Fixed alias indexes. (See also MergeMemNode.)
232 enum {
233 AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value)
234 AliasIdxBot = 2, // pseudo-index, aliases to everything
235 AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM
236 };
237
238 // Variant of TraceTime(nullptr, &_t_accumulator, CITime);
239 // Integrated with logging. If logging is turned on, and CITimeVerbose is true,
240 // then brackets are put into the log, with time stamps and node counts.
241 // (The time collection itself is always conditionalized on CITime.)
242 class TracePhase : public TraceTime {
243 private:
244 Compile* const _compile;
245 CompileLog* _log;
246 const bool _dolog;
247 public:
248 TracePhase(PhaseTraceId phaseTraceId);
249 TracePhase(const char* name, PhaseTraceId phaseTraceId);
250 ~TracePhase();
251 const char* phase_name() const { return title(); }
252 };
253
254 // Information per category of alias (memory slice)
255 class AliasType {
256 private:
257 friend class Compile;
258
259 int _index; // unique index, used with MergeMemNode
260 const TypePtr* _adr_type; // normalized address type
261 ciField* _field; // relevant instance field, or null if none
262 const Type* _element; // relevant array element type, or null if none
263 bool _is_rewritable; // false if the memory is write-once only
264 int _general_index; // if this is type is an instance, the general
265 // type that this is an instance of
266
267 void Init(int i, const TypePtr* at);
268
269 public:
270 int index() const { return _index; }
271 const TypePtr* adr_type() const { return _adr_type; }
272 ciField* field() const { return _field; }
273 const Type* element() const { return _element; }
274 bool is_rewritable() const { return _is_rewritable; }
275 bool is_volatile() const { return (_field ? _field->is_volatile() : false); }
276 int general_index() const { return (_general_index != 0) ? _general_index : _index; }
277
278 void set_rewritable(bool z) { _is_rewritable = z; }
279 void set_field(ciField* f) {
280 assert(!_field,"");
281 _field = f;
282 if (f->is_final() || f->is_stable()) {
283 // In the case of @Stable, multiple writes are possible but may be assumed to be no-ops.
284 _is_rewritable = false;
285 }
286 }
287 void set_element(const Type* e) {
288 assert(_element == nullptr, "");
289 _element = e;
290 }
291
292 BasicType basic_type() const;
293
294 void print_on(outputStream* st) PRODUCT_RETURN;
295 };
296
297 enum {
298 logAliasCacheSize = 6,
299 AliasCacheSize = (1<<logAliasCacheSize)
300 };
301 struct AliasCacheEntry { const TypePtr* _adr_type; int _index; }; // simple duple type
302 enum {
303 trapHistLength = MethodData::_trap_hist_limit
304 };
305
306 private:
307 // Fixed parameters to this compilation.
308 const int _compile_id;
309 const Options _options; // Compilation options
310 ciMethod* _method; // The method being compiled.
311 int _entry_bci; // entry bci for osr methods.
312 const TypeFunc* _tf; // My kind of signature
313 InlineTree* _ilt; // Ditto (temporary).
314 address _stub_function; // VM entry for stub being compiled, or null
315 const char* _stub_name; // Name of stub or adapter being compiled, or null
316 StubId _stub_id; // unique id for stub or NO_STUBID
317 address _stub_entry_point; // Compile code entry for generated stub, or null
318
319 // Control of this compilation.
320 int _max_inline_size; // Max inline size for this compilation
321 int _freq_inline_size; // Max hot method inline size for this compilation
322 int _fixed_slots; // count of frame slots not allocated by the register
323 // allocator i.e. locks, original deopt pc, etc.
324 uintx _max_node_limit; // Max unique node count during a single compilation.
325 uint _node_count_inlining_cutoff; // Number of nodes in the graph above which inlining is denied
326
327 bool _post_loop_opts_phase; // Loop opts are finished.
328 bool _merge_stores_phase; // Phase for merging stores, after post loop opts phase.
329 bool _allow_macro_nodes; // True if we allow creation of macro nodes.
330
331 /* If major progress is set:
332 * Marks that the loop tree information (get_ctrl, idom, get_loop, etc.) could be invalid, and we need to rebuild the loop tree.
333 * It also indicates that the graph was changed in a way that is promising to be able to apply more loop optimization.
334 * If major progress is not set:
335 * Loop tree information is valid.
336 * 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.
337 *
338 * This is not 100% accurate, the semantics of major progress has become less clear over time, but this is the general idea.
339 */
340 bool _major_progress;
341 bool _inlining_progress; // progress doing incremental inlining?
342 bool _inlining_incrementally;// Are we doing incremental inlining (post parse)
343 bool _strength_reduction; // Are we doing strength reduction to direct call
344 bool _do_cleanup; // Cleanup is needed before proceeding with incremental inlining
345 bool _has_loops; // True if the method _may_ have some loops
346 bool _has_split_ifs; // True if the method _may_ have some split-if
347 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
348 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
349 bool _has_boxed_value; // True if a boxed object is allocated
350 bool _has_reserved_stack_access; // True if the method or an inlined method is annotated with ReservedStackAccess
351 bool _has_circular_inline_type; // True if method loads an inline type with a circular, non-flat field
352 bool _needs_nm_slot; // True if an extra stack slot is needed to hold the null marker at scalarized returns
353 uint _max_vector_size; // Maximum size of generated vectors
354 bool _clear_upper_avx; // Clear upper bits of ymm registers using vzeroupper
355 uint _trap_hist[trapHistLength]; // Cumulative traps
356 bool _trap_can_recompile; // Have we emitted a recompiling trap?
357 uint _decompile_count; // Cumulative decompilation counts.
358 bool _do_inlining; // True if we intend to do inlining
359 bool _do_scheduling; // True if we intend to do scheduling
360 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
361 bool _do_vector_loop; // True if allowed to execute loop in parallel iterations
362 bool _use_cmove; // True if CMove should be used without profitability analysis
363 bool _do_aliasing; // True if we intend to do aliasing
364 bool _print_assembly; // True if we should dump assembly code for this compilation
365 bool _print_inlining; // True if we should print inlining for this compilation
366 bool _print_intrinsics; // True if we should print intrinsics for this compilation
367 bool _print_phase_loop_opts; // True if we should print before and after loop opts phase
368 #ifndef PRODUCT
369 uint _phase_counter; // Counter for the number of already printed phases
370 uint _igv_idx; // Counter for IGV node identifiers
371 uint _igv_phase_iter[PHASE_NUM_TYPES]; // Counters for IGV phase iterations
372 bool _trace_opto_output;
373 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
374 #endif
375 bool _has_irreducible_loop; // Found irreducible loops
376 bool _has_monitors; // Metadata transfered to nmethod to enable Continuations lock-detection fastpath
377 bool _has_scoped_access; // For shared scope closure
378 bool _clinit_barrier_on_entry; // True if clinit barrier is needed on nmethod entry
379 int _loop_opts_cnt; // loop opts round
380 bool _has_flat_accesses; // Any known flat array accesses?
381 bool _flat_accesses_share_alias; // Initially all flat array share a single slice
382 bool _scalarize_in_safepoints; // Scalarize inline types in safepoint debug info
383 uint _stress_seed; // Seed for stress testing
384
385 // Compilation environment.
386 Arena _comp_arena; // Arena with lifetime equivalent to Compile
387 void* _barrier_set_state; // Potential GC barrier state for Compile
388 ciEnv* _env; // CI interface
389 DirectiveSet* _directive; // Compiler directive
390 CompileLog* _log; // from CompilerThread
391 CHeapStringHolder _failure_reason; // for record_failure/failing pattern
392 CompilationFailureInfo* _first_failure_details; // Details for the first failure happening during compilation
393 GrowableArray<CallGenerator*> _intrinsics; // List of intrinsics.
394 GrowableArray<Node*> _macro_nodes; // List of nodes which need to be expanded before matching.
395 GrowableArray<ParsePredicateNode*> _parse_predicates; // List of Parse Predicates.
396 // List of OpaqueTemplateAssertionPredicateNode nodes for Template Assertion Predicates which can be seen as list
397 // of Template Assertion Predicates themselves.
398 GrowableArray<OpaqueTemplateAssertionPredicateNode*> _template_assertion_predicate_opaques;
399 GrowableArray<Node*> _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
400 GrowableArray<ReachabilityFenceNode*> _reachability_fences; // List of reachability fences
401 GrowableArray<Node*> _for_post_loop_igvn; // List of nodes for IGVN after loop opts are over
402 GrowableArray<Node*> _inline_type_nodes; // List of InlineType nodes
403 GrowableArray<Node*> _flat_access_nodes; // List of LoadFlat and StoreFlat nodes
404 GrowableArray<Node*> _for_merge_stores_igvn; // List of nodes for IGVN merge stores
405 GrowableArray<UnstableIfTrap*> _unstable_if_traps; // List of ifnodes after IGVN
406 GrowableArray<Node_List*> _coarsened_locks; // List of coarsened Lock and Unlock nodes
407 ConnectionGraph* _congraph;
408 #ifndef PRODUCT
409 IdealGraphPrinter* _igv_printer;
410 static IdealGraphPrinter* _debug_file_printer;
411 static IdealGraphPrinter* _debug_network_printer;
412 #endif
413
414
415 // Node management
416 uint _unique; // Counter for unique Node indices
417 uint _dead_node_count; // Number of dead nodes; VectorSet::Size() is O(N).
418 // So use this to keep count and make the call O(1).
419 VectorSet _dead_node_list; // Set of dead nodes
420 DEBUG_ONLY(Unique_Node_List* _modified_nodes;) // List of nodes which inputs were modified
421 DEBUG_ONLY(bool _phase_optimize_finished;) // Used for live node verification while creating new nodes
422
423 DEBUG_ONLY(bool _phase_verify_ideal_loop;) // Are we in PhaseIdealLoop verification?
424
425 // Arenas for new-space and old-space nodes.
426 // Swapped between using _node_arena.
427 // The lifetime of the old-space nodes is during xform.
428 Arena _node_arena_one;
429 Arena _node_arena_two;
430 Arena* _node_arena;
431 public:
432 Arena* swap_old_and_new() {
433 Arena* filled_arena_ptr = _node_arena;
434 Arena* old_arena_ptr = old_arena();
435 old_arena_ptr->destruct_contents();
436 _node_arena = old_arena_ptr;
437 return filled_arena_ptr;
438 }
439 private:
440 RootNode* _root; // Unique root of compilation, or null after bail-out.
441 Node* _top; // Unique top node. (Reset by various phases.)
442
443 Node* _immutable_memory; // Initial memory state
444
445 Node* _recent_alloc_obj;
446 Node* _recent_alloc_ctl;
447
448 // Constant table
449 MachConstantBaseNode* _mach_constant_base_node; // Constant table base node singleton.
450
451
452 // Blocked array of debugging and profiling information,
453 // tracked per node.
454 enum { _log2_node_notes_block_size = 8,
455 _node_notes_block_size = (1<<_log2_node_notes_block_size)
456 };
457 GrowableArray<Node_Notes*>* _node_note_array;
458 Node_Notes* _default_node_notes; // default notes for new nodes
459
460 // After parsing and every bulk phase we hang onto the Root instruction.
461 // The RootNode instruction is where the whole program begins. It produces
462 // the initial Control and BOTTOM for everybody else.
463
464 // Type management
465 Arena _Compile_types; // Arena for all types
466 Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared()
467 Dict* _type_dict; // Intern table
468 CloneMap _clone_map; // used for recording history of cloned nodes
469 size_t _type_last_size; // Last allocation size (see Type::operator new/delete)
470 ciMethod* _last_tf_m; // Cache for
471 const TypeFunc* _last_tf; // TypeFunc::make
472 AliasType** _alias_types; // List of alias types seen so far.
473 int _num_alias_types; // Logical length of _alias_types
474 int _max_alias_types; // Physical length of _alias_types
475 AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
476
477 // Parsing, optimization
478 PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN
479
480 // Shared worklist for all IGVN rounds. Nodes can be pushed to it at any time.
481 // If pushed outside IGVN, the Node is processed in the next IGVN round.
482 Unique_Node_List* _igvn_worklist;
483
484 // Shared type array for GVN, IGVN and CCP. It maps node idx -> Type*.
485 Type_Array* _types;
486
487 // Shared node hash table for GVN, IGVN and CCP.
488 NodeHash* _node_hash;
489
490 GrowableArray<CallGenerator*> _late_inlines; // List of CallGenerators to be revisited after main parsing has finished.
491 GrowableArray<CallGenerator*> _string_late_inlines; // same but for string operations
492 GrowableArray<CallGenerator*> _boxing_late_inlines; // same but for boxing operations
493
494 GrowableArray<CallGenerator*> _vector_reboxing_late_inlines; // same but for vector reboxing operations
495
496 int _late_inlines_pos; // Where in the queue should the next late inlining candidate go (emulate depth first inlining)
497 bool _has_mh_late_inlines; // Can there still be a method handle late inlining pending?
498 // false: there can't be one
499 // true: we've enqueued one at some point so there may still be one
500
501 // "MemLimit" directive was specified and the memory limit was hit during compilation
502 bool _oom;
503
504 // Only keep nodes in the expensive node list that need to be optimized
505 void cleanup_expensive_nodes(PhaseIterGVN &igvn);
506 // Use for sorting expensive nodes to bring similar nodes together
507 static int cmp_expensive_nodes(Node** n1, Node** n2);
508 // Expensive nodes list already sorted?
509 bool expensive_nodes_sorted() const;
510 // Remove the speculative part of types and clean up the graph
511 void remove_speculative_types(PhaseIterGVN &igvn);
512
513 void* _replay_inline_data; // Pointer to data loaded from file
514
515 void log_late_inline_failure(CallGenerator* cg, const char* msg);
516 DEBUG_ONLY(bool _exception_backedge;)
517
518 void record_method_not_compilable_oom();
519
520 InlinePrinter _inline_printer;
521
522 public:
523 void* barrier_set_state() const { return _barrier_set_state; }
524
525 InlinePrinter* inline_printer() { return &_inline_printer; }
526
527 #ifndef PRODUCT
528 IdealGraphPrinter* igv_printer() { return _igv_printer; }
529 void reset_igv_phase_iter(CompilerPhaseType cpt) { _igv_phase_iter[cpt] = 0; }
530 #endif
531
532 void log_late_inline(CallGenerator* cg);
533 void log_inline_id(CallGenerator* cg);
534 void log_inline_failure(const char* msg);
535
536 void* replay_inline_data() const { return _replay_inline_data; }
537
538 // Dump inlining replay data to the stream.
539 void dump_inline_data(outputStream* out);
540 void dump_inline_data_reduced(outputStream* out);
541
542 private:
543 // Matching, CFG layout, allocation, code generation
544 PhaseCFG* _cfg; // Results of CFG finding
545 int _java_calls; // Number of java calls in the method
546 int _inner_loops; // Number of inner loops in the method
547 Matcher* _matcher; // Engine to map ideal to machine instructions
548 PhaseRegAlloc* _regalloc; // Results of register allocation.
549 RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout)
550 Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin
551 void* _indexSet_free_block_list; // free list of IndexSet bit blocks
552 int _interpreter_frame_size;
553
554 // Holds dynamically allocated extensions of short-lived register masks. Such
555 // extensions are potentially quite large and need tight resource marks which
556 // may conflict with other allocations in the default resource area.
557 // Therefore, we use a dedicated resource area for register masks.
558 ResourceArea _regmask_arena;
559
560 PhaseOutput* _output;
561
562 public:
563 // Accessors
564
565 // The Compile instance currently active in this (compiler) thread.
566 static Compile* current() {
567 return (Compile*) ciEnv::current()->compiler_data();
568 }
569
570 int interpreter_frame_size() const { return _interpreter_frame_size; }
571
572 PhaseOutput* output() const { return _output; }
573 void set_output(PhaseOutput* o) { _output = o; }
574
575 // ID for this compilation. Useful for setting breakpoints in the debugger.
576 int compile_id() const { return _compile_id; }
577 DirectiveSet* directive() const { return _directive; }
578
579 // Does this compilation allow instructions to subsume loads? User
580 // instructions that subsume a load may result in an unschedulable
581 // instruction sequence.
582 bool subsume_loads() const { return _options._subsume_loads; }
583 /** Do escape analysis. */
584 bool do_escape_analysis() const { return _options._do_escape_analysis; }
585 bool do_iterative_escape_analysis() const { return _options._do_iterative_escape_analysis; }
586 bool do_reduce_allocation_merges() const { return _options._do_reduce_allocation_merges; }
587 /** Do boxing elimination. */
588 bool eliminate_boxing() const { return _options._eliminate_boxing; }
589 /** Do aggressive boxing elimination. */
590 bool aggressive_unboxing() const { return _options._eliminate_boxing && AggressiveUnboxing; }
591 bool should_install_code() const { return _options._install_code; }
592 /** Do locks coarsening. */
593 bool do_locks_coarsening() const { return _options._do_locks_coarsening; }
594 bool do_superword() const { return _options._do_superword; }
595
596 // Other fixed compilation parameters.
597 ciMethod* method() const { return _method; }
598 int entry_bci() const { return _entry_bci; }
599 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
600 bool is_method_compilation() const { return (_method != nullptr && !_method->flags().is_native()); }
601 const TypeFunc* tf() const { assert(_tf!=nullptr, ""); return _tf; }
602 void init_tf(const TypeFunc* tf) { assert(_tf==nullptr, ""); _tf = tf; }
603 InlineTree* ilt() const { return _ilt; }
604 address stub_function() const { return _stub_function; }
605 const char* stub_name() const { return _stub_name; }
606 StubId stub_id() const { return _stub_id; }
607 address stub_entry_point() const { return _stub_entry_point; }
608 void set_stub_entry_point(address z) { _stub_entry_point = z; }
609
610 // Control of this compilation.
611 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
612 void set_fixed_slots(int n) { _fixed_slots = n; }
613 void set_inlining_progress(bool z) { _inlining_progress = z; }
614 bool inlining_progress() const { return _inlining_progress; }
615 void set_inlining_incrementally(bool z) { _inlining_incrementally = z; }
616 bool inlining_incrementally() const { return _inlining_incrementally; }
617 void set_strength_reduction(bool z) { _strength_reduction = z; }
618 bool strength_reduction() const { return _strength_reduction; }
619 void set_do_cleanup(bool z) { _do_cleanup = z; }
620 bool do_cleanup() const { return _do_cleanup; }
621 bool major_progress() const { return _major_progress; }
622 void set_major_progress() { _major_progress = true; }
623 void restore_major_progress(bool progress) { _major_progress = _major_progress || progress; }
624 void clear_major_progress() { _major_progress = false; }
625 int max_inline_size() const { return _max_inline_size; }
626 void set_freq_inline_size(int n) { _freq_inline_size = n; }
627 int freq_inline_size() const { return _freq_inline_size; }
628 void set_max_inline_size(int n) { _max_inline_size = n; }
629 bool has_loops() const { return _has_loops; }
630 void set_has_loops(bool z) { _has_loops = z; }
631 bool has_split_ifs() const { return _has_split_ifs; }
632 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
633 bool has_unsafe_access() const { return _has_unsafe_access; }
634 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
635 bool has_stringbuilder() const { return _has_stringbuilder; }
636 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
637 bool has_boxed_value() const { return _has_boxed_value; }
638 void set_has_boxed_value(bool z) { _has_boxed_value = z; }
639 bool has_reserved_stack_access() const { return _has_reserved_stack_access; }
640 void set_has_reserved_stack_access(bool z) { _has_reserved_stack_access = z; }
641 bool has_circular_inline_type() const { return _has_circular_inline_type; }
642 void set_has_circular_inline_type(bool z) { _has_circular_inline_type = z; }
643 uint max_vector_size() const { return _max_vector_size; }
644 void set_max_vector_size(uint s) { _max_vector_size = s; }
645 bool clear_upper_avx() const { return _clear_upper_avx; }
646 void set_clear_upper_avx(bool s) { _clear_upper_avx = s; }
647 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
648 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
649 bool trap_can_recompile() const { return _trap_can_recompile; }
650 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
651 uint decompile_count() const { return _decompile_count; }
652 void set_decompile_count(uint c) { _decompile_count = c; }
653 bool allow_range_check_smearing() const;
654 bool do_inlining() const { return _do_inlining; }
655 void set_do_inlining(bool z) { _do_inlining = z; }
656 bool do_scheduling() const { return _do_scheduling; }
657 void set_do_scheduling(bool z) { _do_scheduling = z; }
658 bool do_freq_based_layout() const{ return _do_freq_based_layout; }
659 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
660 bool do_vector_loop() const { return _do_vector_loop; }
661 void set_do_vector_loop(bool z) { _do_vector_loop = z; }
662 bool use_cmove() const { return _use_cmove; }
663 void set_use_cmove(bool z) { _use_cmove = z; }
664 bool do_aliasing() const { return _do_aliasing; }
665 bool print_assembly() const { return _print_assembly; }
666 void set_print_assembly(bool z) { _print_assembly = z; }
667 bool print_inlining() const { return _print_inlining; }
668 void set_print_inlining(bool z) { _print_inlining = z; }
669 bool print_intrinsics() const { return _print_intrinsics; }
670 void set_print_intrinsics(bool z) { _print_intrinsics = z; }
671 uint max_node_limit() const { return (uint)_max_node_limit; }
672 void set_max_node_limit(uint n) { _max_node_limit = n; }
673 uint node_count_inlining_cutoff() const { return _node_count_inlining_cutoff; }
674 void set_node_count_inlining_cutoff(uint n) { _node_count_inlining_cutoff = n; }
675 bool clinit_barrier_on_entry() { return _clinit_barrier_on_entry; }
676 void set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
677 void set_flat_accesses() { _has_flat_accesses = true; }
678 bool flat_accesses_share_alias() const { return _flat_accesses_share_alias; }
679 void set_flat_accesses_share_alias(bool z) { _flat_accesses_share_alias = z; }
680 bool scalarize_in_safepoints() const { return _scalarize_in_safepoints; }
681 void set_scalarize_in_safepoints(bool z) { _scalarize_in_safepoints = z; }
682
683 // Support for scalarized inline type calling convention
684 bool has_scalarized_args() const { return _method != nullptr && _method->has_scalarized_args(); }
685 bool needs_stack_repair() const { return _method != nullptr && _method->c2_needs_stack_repair(); }
686 bool needs_nm_slot() const { return _needs_nm_slot; }
687 void set_needs_nm_slot(bool v) { _needs_nm_slot = v; }
688
689 bool has_monitors() const { return _has_monitors; }
690 void set_has_monitors(bool v) { _has_monitors = v; }
691 bool has_scoped_access() const { return _has_scoped_access; }
692 void set_has_scoped_access(bool v) { _has_scoped_access = v; }
693
694 // check the CompilerOracle for special behaviours for this compile
695 bool method_has_option(CompileCommandEnum option) const {
696 return method() != nullptr && method()->has_option(option);
697 }
698
699 #ifndef PRODUCT
700 uint next_igv_idx() { return _igv_idx++; }
701 bool trace_opto_output() const { return _trace_opto_output; }
702 void print_phase(const char* phase_name);
703 void print_ideal_ir(const char* compile_phase_name) const;
704 bool should_print_ideal() const { return _directive->PrintIdealOption; }
705 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
706 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
707 int _in_dump_cnt; // Required for dumping ir nodes.
708 #endif
709 bool has_irreducible_loop() const { return _has_irreducible_loop; }
710 void set_has_irreducible_loop(bool z) { _has_irreducible_loop = z; }
711
712 Ticks _latest_stage_start_counter;
713
714 void begin_method();
715 void end_method();
716
717 void print_method(CompilerPhaseType compile_phase, int level, Node* n = nullptr);
718
719 #ifndef PRODUCT
720 bool should_print_igv(int level);
721 bool should_print_phase(int level) const;
722 bool should_print_ideal_phase(CompilerPhaseType cpt) const;
723 void init_igv();
724 void dump_igv(const char* graph_name, int level = 3) {
725 if (should_print_igv(level)) {
726 _igv_printer->print_graph(graph_name, nullptr);
727 }
728 }
729
730 void igv_print_method_to_file(const char* phase_name = nullptr, bool append = false, const frame* fr = nullptr);
731 void igv_print_method_to_network(const char* phase_name = nullptr, const frame* fr = nullptr);
732 void igv_print_graph_to_network(const char* name, GrowableArray<const Node*>& visible_nodes, const frame* fr);
733 static IdealGraphPrinter* debug_file_printer() { return _debug_file_printer; }
734 static IdealGraphPrinter* debug_network_printer() { return _debug_network_printer; }
735 #endif
736
737 const GrowableArray<ParsePredicateNode*>& parse_predicates() const {
738 return _parse_predicates;
739 }
740
741 const GrowableArray<OpaqueTemplateAssertionPredicateNode*>& template_assertion_predicate_opaques() const {
742 return _template_assertion_predicate_opaques;
743 }
744
745 int macro_count() const { return _macro_nodes.length(); }
746 int parse_predicate_count() const { return _parse_predicates.length(); }
747 int template_assertion_predicate_count() const { return _template_assertion_predicate_opaques.length(); }
748 int expensive_count() const { return _expensive_nodes.length(); }
749 int coarsened_count() const { return _coarsened_locks.length(); }
750 Node* macro_node(int idx) const { return _macro_nodes.at(idx); }
751
752 Node* expensive_node(int idx) const { return _expensive_nodes.at(idx); }
753
754 ReachabilityFenceNode* reachability_fence(int idx) const { return _reachability_fences.at(idx); }
755 int reachability_fences_count() const { return _reachability_fences.length(); }
756
757 ConnectionGraph* congraph() { return _congraph;}
758 void set_congraph(ConnectionGraph* congraph) { _congraph = congraph;}
759 void add_macro_node(Node * n) {
760 //assert(n->is_macro(), "must be a macro node");
761 assert(!_macro_nodes.contains(n), "duplicate entry in expand list");
762 _macro_nodes.append(n);
763 }
764 void remove_macro_node(Node* n) {
765 // this function may be called twice for a node so we can only remove it
766 // if it's still existing.
767 _macro_nodes.remove_if_existing(n);
768 // Remove from coarsened locks list if present
769 if (coarsened_count() > 0) {
770 remove_coarsened_lock(n);
771 }
772 }
773 void add_expensive_node(Node* n);
774 void remove_expensive_node(Node* n) {
775 _expensive_nodes.remove_if_existing(n);
776 }
777
778 void add_reachability_fence(ReachabilityFenceNode* rf) {
779 _reachability_fences.append(rf);
780 }
781
782 void remove_reachability_fence(ReachabilityFenceNode* n) {
783 _reachability_fences.remove_if_existing(n);
784 }
785
786 void add_parse_predicate(ParsePredicateNode* n) {
787 assert(!_parse_predicates.contains(n), "duplicate entry in Parse Predicate list");
788 _parse_predicates.append(n);
789 }
790
791 void remove_parse_predicate(ParsePredicateNode* n) {
792 if (parse_predicate_count() > 0) {
793 _parse_predicates.remove_if_existing(n);
794 }
795 }
796
797 void add_template_assertion_predicate_opaque(OpaqueTemplateAssertionPredicateNode* n) {
798 assert(!_template_assertion_predicate_opaques.contains(n),
799 "Duplicate entry in Template Assertion Predicate OpaqueTemplateAssertionPredicate list");
800 _template_assertion_predicate_opaques.append(n);
801 }
802
803 void remove_template_assertion_predicate_opaque(OpaqueTemplateAssertionPredicateNode* n) {
804 if (template_assertion_predicate_count() > 0) {
805 _template_assertion_predicate_opaques.remove_if_existing(n);
806 }
807 }
808 void add_coarsened_locks(GrowableArray<AbstractLockNode*>& locks);
809 void remove_coarsened_lock(Node* n);
810 bool coarsened_locks_consistent();
811 void mark_unbalanced_boxes() const;
812
813 bool post_loop_opts_phase() { return _post_loop_opts_phase; }
814 void set_post_loop_opts_phase() { _post_loop_opts_phase = true; }
815 void reset_post_loop_opts_phase() { _post_loop_opts_phase = false; }
816
817 #ifdef ASSERT
818 bool phase_verify_ideal_loop() const { return _phase_verify_ideal_loop; }
819 void set_phase_verify_ideal_loop() { _phase_verify_ideal_loop = true; }
820 void reset_phase_verify_ideal_loop() { _phase_verify_ideal_loop = false; }
821 #endif
822
823 bool allow_macro_nodes() { return _allow_macro_nodes; }
824 void reset_allow_macro_nodes() { _allow_macro_nodes = false; }
825
826 void record_for_post_loop_opts_igvn(Node* n);
827 void remove_from_post_loop_opts_igvn(Node* n);
828 void process_for_post_loop_opts_igvn(PhaseIterGVN& igvn);
829
830 // Keep track of inline type nodes for later processing
831 void add_inline_type(Node* n);
832 void remove_inline_type(Node* n);
833
834 bool clear_argument_if_only_used_as_buffer_at_calls(Node* result_cast, PhaseIterGVN& igvn);
835
836 void process_inline_types(PhaseIterGVN &igvn, bool remove = false);
837
838 void add_flat_access(Node* n);
839 void remove_flat_access(Node* n);
840 void process_flat_accesses(PhaseIterGVN& igvn);
841
842 template <class F>
843 void for_each_flat_access(F consumer) {
844 for (int i = _flat_access_nodes.length() - 1; i >= 0; i--) {
845 consumer(_flat_access_nodes.at(i));
846 }
847 }
848
849 void adjust_flat_array_access_aliases(PhaseIterGVN& igvn);
850
851 void record_unstable_if_trap(UnstableIfTrap* trap);
852 bool remove_unstable_if_trap(CallStaticJavaNode* unc, bool yield);
853 void remove_useless_unstable_if_traps(Unique_Node_List &useful);
854 void process_for_unstable_if_traps(PhaseIterGVN& igvn);
855
856 bool merge_stores_phase() { return _merge_stores_phase; }
857 void set_merge_stores_phase() { _merge_stores_phase = true; }
858 void record_for_merge_stores_igvn(Node* n);
859 void remove_from_merge_stores_igvn(Node* n);
860 void process_for_merge_stores_igvn(PhaseIterGVN& igvn);
861
862 void shuffle_late_inlines();
863 void shuffle_macro_nodes();
864 void sort_macro_nodes();
865
866 void mark_parse_predicate_nodes_useless(PhaseIterGVN& igvn);
867
868 // Are there candidate expensive nodes for optimization?
869 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
870 // Check whether n1 and n2 are similar
871 static int cmp_expensive_nodes(Node* n1, Node* n2);
872 // Sort expensive nodes to locate similar expensive nodes
873 void sort_expensive_nodes();
874
875 // Compilation environment.
876 Arena* comp_arena() { return &_comp_arena; }
877 ciEnv* env() const { return _env; }
878 CompileLog* log() const { return _log; }
879
880 bool failing_internal() const {
881 return _env->failing() ||
882 _failure_reason.get() != nullptr;
883 }
884
885 const char* failure_reason() const {
886 return _env->failing() ? _env->failure_reason()
887 : _failure_reason.get();
888 }
889
890 const CompilationFailureInfo* first_failure_details() const { return _first_failure_details; }
891
892 bool failing() {
893 if (failing_internal()) {
894 return true;
895 }
896 #ifdef ASSERT
897 // Disable stress code for PhaseIdealLoop verification (would have cascading effects).
898 if (phase_verify_ideal_loop()) {
899 return false;
900 }
901 if (StressBailout) {
902 return fail_randomly();
903 }
904 #endif
905 return false;
906 }
907
908 #ifdef ASSERT
909 bool fail_randomly();
910 bool failure_is_artificial();
911 #endif
912
913 bool failure_reason_is(const char* r) const {
914 return (r == _failure_reason.get()) ||
915 (r != nullptr &&
916 _failure_reason.get() != nullptr &&
917 strcmp(r, _failure_reason.get()) == 0);
918 }
919
920 void record_failure(const char* reason DEBUG_ONLY(COMMA bool allow_multiple_failures = false));
921 void record_method_not_compilable(const char* reason DEBUG_ONLY(COMMA bool allow_multiple_failures = false)) {
922 env()->record_method_not_compilable(reason);
923 // Record failure reason.
924 record_failure(reason DEBUG_ONLY(COMMA allow_multiple_failures));
925 }
926 bool check_node_count(uint margin, const char* reason) {
927 if (oom()) {
928 record_method_not_compilable_oom();
929 return true;
930 }
931 if (live_nodes() + margin > max_node_limit()) {
932 record_method_not_compilable(reason);
933 return true;
934 } else {
935 return false;
936 }
937 }
938 bool oom() const { return _oom; }
939 void set_oom() { _oom = true; }
940
941 // Node management
942 uint unique() const { return _unique; }
943 uint next_unique() { return _unique++; }
944 void set_unique(uint i) { _unique = i; }
945 Arena* node_arena() { return _node_arena; }
946 Arena* old_arena() { return (&_node_arena_one == _node_arena) ? &_node_arena_two : &_node_arena_one; }
947 RootNode* root() const { return _root; }
948 void set_root(RootNode* r) { _root = r; }
949 StartNode* start() const; // (Derived from root.)
950 void verify_start(StartNode* s) const NOT_DEBUG_RETURN;
951 Node* immutable_memory();
952
953 Node* recent_alloc_ctl() const { return _recent_alloc_ctl; }
954 Node* recent_alloc_obj() const { return _recent_alloc_obj; }
955 void set_recent_alloc(Node* ctl, Node* obj) {
956 _recent_alloc_ctl = ctl;
957 _recent_alloc_obj = obj;
958 }
959 void record_dead_node(uint idx) { if (_dead_node_list.test_set(idx)) return;
960 _dead_node_count++;
961 }
962 void reset_dead_node_list() { _dead_node_list.reset();
963 _dead_node_count = 0;
964 }
965 uint live_nodes() const {
966 int val = _unique - _dead_node_count;
967 assert (val >= 0, "number of tracked dead nodes %d more than created nodes %d", _unique, _dead_node_count);
968 return (uint) val;
969 }
970 #ifdef ASSERT
971 void set_phase_optimize_finished() { _phase_optimize_finished = true; }
972 bool phase_optimize_finished() const { return _phase_optimize_finished; }
973 uint count_live_nodes_by_graph_walk();
974 void print_missing_nodes();
975 #endif
976
977 // Record modified nodes to check that they are put on IGVN worklist
978 void record_modified_node(Node* n) NOT_DEBUG_RETURN;
979 void remove_modified_node(Node* n) NOT_DEBUG_RETURN;
980 DEBUG_ONLY( Unique_Node_List* modified_nodes() const { return _modified_nodes; } )
981
982 MachConstantBaseNode* mach_constant_base_node();
983 bool has_mach_constant_base_node() const { return _mach_constant_base_node != nullptr; }
984 // Generated by adlc, true if CallNode requires MachConstantBase.
985 bool needs_deep_clone_jvms();
986
987 // Handy undefined Node
988 Node* top() const { return _top; }
989
990 // these are used by guys who need to know about creation and transformation of top:
991 Node* cached_top_node() { return _top; }
992 void set_cached_top_node(Node* tn);
993
994 GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
995 void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
996 Node_Notes* default_node_notes() const { return _default_node_notes; }
997 void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
998
999 Node_Notes* node_notes_at(int idx);
1000
1001 inline bool set_node_notes_at(int idx, Node_Notes* value);
1002 // Copy notes from source to dest, if they exist.
1003 // Overwrite dest only if source provides something.
1004 // Return true if information was moved.
1005 bool copy_node_notes_to(Node* dest, Node* source);
1006
1007 // Workhorse function to sort out the blocked Node_Notes array:
1008 Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
1009 int idx, bool can_grow = false);
1010
1011 void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
1012
1013 // Type management
1014 Arena* type_arena() { return _type_arena; }
1015 Dict* type_dict() { return _type_dict; }
1016 size_t type_last_size() { return _type_last_size; }
1017 int num_alias_types() { return _num_alias_types; }
1018
1019 void init_type_arena() { _type_arena = &_Compile_types; }
1020 void set_type_arena(Arena* a) { _type_arena = a; }
1021 void set_type_dict(Dict* d) { _type_dict = d; }
1022 void set_type_last_size(size_t sz) { _type_last_size = sz; }
1023
1024 const TypeFunc* last_tf(ciMethod* m) {
1025 return (m == _last_tf_m) ? _last_tf : nullptr;
1026 }
1027 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
1028 assert(m != nullptr || tf == nullptr, "");
1029 _last_tf_m = m;
1030 _last_tf = tf;
1031 }
1032
1033 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
1034 AliasType* alias_type(const TypePtr* adr_type, ciField* field = nullptr, bool uncached = false) { return find_alias_type(adr_type, false, field, uncached); }
1035 bool have_alias_type(const TypePtr* adr_type);
1036 AliasType* alias_type(ciField* field);
1037
1038 int get_alias_index(const TypePtr* at, bool uncached = false) { return alias_type(at, nullptr, uncached)->index(); }
1039 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
1040 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
1041
1042 // Building nodes
1043 void rethrow_exceptions(JVMState* jvms);
1044 void return_values(JVMState* jvms);
1045 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
1046
1047 // Decide how to build a call.
1048 // The profile factor is a discount to apply to this site's interp. profile.
1049 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch,
1050 JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = nullptr,
1051 bool allow_intrinsics = true);
1052 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
1053 return C->directive()->should_delay_inline(call_method) ||
1054 should_delay_string_inlining(call_method, jvms) ||
1055 should_delay_boxing_inlining(call_method, jvms) ||
1056 should_delay_vector_inlining(call_method, jvms);
1057 }
1058 bool should_delay_after_inlining_cutoff(ciMethod* callee, ciMethod* caller);
1059 bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
1060 bool should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms);
1061 bool should_delay_vector_inlining(ciMethod* call_method, JVMState* jvms);
1062 bool should_delay_vector_reboxing_inlining(ciMethod* call_method, JVMState* jvms);
1063
1064 // Helper functions to identify inlining potential at call-site
1065 ciMethod* optimize_virtual_call(ciMethod* caller, ciInstanceKlass* klass,
1066 ciKlass* holder, ciMethod* callee,
1067 const TypeOopPtr* receiver_type, bool is_virtual,
1068 bool &call_does_dispatch, int &vtable_index,
1069 bool check_access = true);
1070 ciMethod* optimize_inlining(ciMethod* caller, ciInstanceKlass* klass, ciKlass* holder,
1071 ciMethod* callee, const TypeOopPtr* receiver_type,
1072 bool check_access = true);
1073
1074 // Report if there were too many traps at a current method and bci.
1075 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
1076 // If there is no MDO at all, report no trap unless told to assume it.
1077 bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
1078 // This version, unspecific to a particular bci, asks if
1079 // PerMethodTrapLimit was exceeded for all inlined methods seen so far.
1080 bool too_many_traps(Deoptimization::DeoptReason reason,
1081 // Privately used parameter for logging:
1082 ciMethodData* logmd = nullptr);
1083 // Report if there were too many recompiles at a method and bci.
1084 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
1085 // Report if there were too many traps or recompiles at a method and bci.
1086 bool too_many_traps_or_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason) {
1087 return too_many_traps(method, bci, reason) ||
1088 too_many_recompiles(method, bci, reason);
1089 }
1090 // Return a bitset with the reasons where deoptimization is allowed,
1091 // i.e., where there were not too many uncommon traps.
1092 int _allowed_reasons;
1093 int allowed_deopt_reasons() { return _allowed_reasons; }
1094 void set_allowed_deopt_reasons();
1095
1096 // Parsing, optimization
1097 PhaseGVN* initial_gvn() { return _initial_gvn; }
1098 Unique_Node_List* igvn_worklist() {
1099 assert(_igvn_worklist != nullptr, "must be created in Compile::Compile");
1100 return _igvn_worklist;
1101 }
1102 Type_Array* types() {
1103 assert(_types != nullptr, "must be created in Compile::Compile");
1104 return _types;
1105 }
1106 NodeHash* node_hash() {
1107 assert(_node_hash != nullptr, "must be created in Compile::Compile");
1108 return _node_hash;
1109 }
1110 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List in node.hpp.
1111 inline void remove_for_igvn(Node* n); // Body is after class Unique_Node_List in node.hpp.
1112 void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; }
1113
1114 // Replace n by nn using initial_gvn, calling hash_delete and
1115 // record_for_igvn as needed.
1116 void gvn_replace_by(Node* n, Node* nn);
1117
1118
1119 void identify_useful_nodes(Unique_Node_List &useful);
1120 void update_dead_node_list(Unique_Node_List &useful);
1121 void disconnect_useless_nodes(Unique_Node_List& useful, Unique_Node_List& worklist, const Unique_Node_List* root_and_safepoints = nullptr);
1122
1123 void remove_useless_node(Node* dead);
1124
1125 // Record this CallGenerator for inlining at the end of parsing.
1126 void add_late_inline(CallGenerator* cg) {
1127 _late_inlines.insert_before(_late_inlines_pos, cg);
1128 if (StressIncrementalInlining) {
1129 assert(_late_inlines_pos < _late_inlines.length(), "unthinkable!");
1130 if (_late_inlines.length() - _late_inlines_pos >= 2) {
1131 int j = (C->random() % (_late_inlines.length() - _late_inlines_pos)) + _late_inlines_pos;
1132 swap(_late_inlines.at(_late_inlines_pos), _late_inlines.at(j));
1133 }
1134 }
1135 _late_inlines_pos++;
1136 }
1137
1138 void prepend_late_inline(CallGenerator* cg) {
1139 _late_inlines.insert_before(0, cg);
1140 }
1141
1142 void add_string_late_inline(CallGenerator* cg) {
1143 _string_late_inlines.push(cg);
1144 }
1145
1146 void add_boxing_late_inline(CallGenerator* cg) {
1147 _boxing_late_inlines.push(cg);
1148 }
1149
1150 void add_vector_reboxing_late_inline(CallGenerator* cg) {
1151 _vector_reboxing_late_inlines.push(cg);
1152 }
1153
1154 template<typename N, ENABLE_IF(std::is_base_of<Node, N>::value)>
1155 void remove_useless_nodes(GrowableArray<N*>& node_list, Unique_Node_List& useful);
1156
1157 void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful);
1158 void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Node* dead);
1159
1160 void remove_useless_coarsened_locks(Unique_Node_List& useful);
1161
1162 void dump_print_inlining();
1163
1164 bool over_inlining_cutoff() const {
1165 if (!inlining_incrementally()) {
1166 return unique() > (uint)NodeCountInliningCutoff;
1167 } else {
1168 // Give some room for incremental inlining algorithm to "breathe"
1169 // and avoid thrashing when live node count is close to the limit.
1170 // Keep in mind that live_nodes() isn't accurate during inlining until
1171 // dead node elimination step happens (see Compile::inline_incrementally).
1172 return live_nodes() > node_count_inlining_cutoff() * 11 / 10;
1173 }
1174 }
1175
1176 void mark_has_mh_late_inlines() { _has_mh_late_inlines = true; }
1177 bool has_mh_late_inlines() const { return _has_mh_late_inlines; }
1178
1179 bool inline_incrementally_one();
1180 void inline_incrementally_cleanup(PhaseIterGVN& igvn);
1181 void inline_incrementally(PhaseIterGVN& igvn);
1182 bool should_stress_inlining() { return StressIncrementalInlining && (random() % 2) == 0; }
1183 bool should_delay_inlining() { return AlwaysIncrementalInline || should_stress_inlining(); }
1184 void inline_string_calls(bool parse_time);
1185 void inline_boxing_calls(PhaseIterGVN& igvn);
1186 bool optimize_loops(PhaseIterGVN& igvn, LoopOptsMode mode);
1187 void remove_root_to_sfpts_edges(PhaseIterGVN& igvn);
1188
1189 void inline_vector_reboxing_calls();
1190 bool has_vbox_nodes();
1191
1192 void process_late_inline_calls_no_inline(PhaseIterGVN& igvn);
1193
1194 // Matching, CFG layout, allocation, code generation
1195 PhaseCFG* cfg() { return _cfg; }
1196 bool has_java_calls() const { return _java_calls > 0; }
1197 int java_calls() const { return _java_calls; }
1198 int inner_loops() const { return _inner_loops; }
1199 Matcher* matcher() { return _matcher; }
1200 PhaseRegAlloc* regalloc() { return _regalloc; }
1201 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; }
1202 ResourceArea* regmask_arena() { return &_regmask_arena; }
1203 Arena* indexSet_arena() { return _indexSet_arena; }
1204 void* indexSet_free_block_list() { return _indexSet_free_block_list; }
1205 DebugInformationRecorder* debug_info() { return env()->debug_info(); }
1206
1207 void update_interpreter_frame_size(int size) {
1208 if (_interpreter_frame_size < size) {
1209 _interpreter_frame_size = size;
1210 }
1211 }
1212
1213 void set_matcher(Matcher* m) { _matcher = m; }
1214 //void set_regalloc(PhaseRegAlloc* ra) { _regalloc = ra; }
1215 void set_indexSet_arena(Arena* a) { _indexSet_arena = a; }
1216 void set_indexSet_free_block_list(void* p) { _indexSet_free_block_list = p; }
1217
1218 void set_java_calls(int z) { _java_calls = z; }
1219 void set_inner_loops(int z) { _inner_loops = z; }
1220
1221 Dependencies* dependencies() { return env()->dependencies(); }
1222
1223 // Major entry point. Given a Scope, compile the associated method.
1224 // For normal compilations, entry_bci is InvocationEntryBci. For on stack
1225 // replacement, entry_bci indicates the bytecode for which to compile a
1226 // continuation.
1227 Compile(ciEnv* ci_env, ciMethod* target,
1228 int entry_bci, Options options, DirectiveSet* directive);
1229
1230 // Second major entry point. From the TypeFunc signature, generate code
1231 // to pass arguments from the Java calling convention to the C calling
1232 // convention.
1233 Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
1234 address stub_function, const char *stub_name,
1235 StubId stub_id, int is_fancy_jump, bool pass_tls,
1236 bool return_pc, DirectiveSet* directive);
1237
1238 ~Compile();
1239
1240 // Are we compiling a method?
1241 bool has_method() { return method() != nullptr; }
1242
1243 // Maybe print some information about this compile.
1244 void print_compile_messages();
1245
1246 // Final graph reshaping, a post-pass after the regular optimizer is done.
1247 bool final_graph_reshaping();
1248
1249 // returns true if adr is completely contained in the given alias category
1250 bool must_alias(const TypePtr* adr, int alias_idx);
1251
1252 // returns true if adr overlaps with the given alias category
1253 bool can_alias(const TypePtr* adr, int alias_idx);
1254
1255 // Stack slots that may be unused by the calling convention but must
1256 // otherwise be preserved. On Intel this includes the return address.
1257 // On PowerPC it includes the 4 words holding the old TOC & LR glue.
1258 uint in_preserve_stack_slots() {
1259 return SharedRuntime::in_preserve_stack_slots();
1260 }
1261
1262 // "Top of Stack" slots that may be unused by the calling convention but must
1263 // otherwise be preserved.
1264 // On Intel these are not necessary and the value can be zero.
1265 static uint out_preserve_stack_slots() {
1266 return SharedRuntime::out_preserve_stack_slots();
1267 }
1268
1269 // Number of outgoing stack slots killed above the out_preserve_stack_slots
1270 // for calls to C. Supports the var-args backing area for register parms.
1271 uint varargs_C_out_slots_killed() const;
1272
1273 // Number of Stack Slots consumed by a synchronization entry
1274 int sync_stack_slots() const;
1275
1276 // Compute the name of old_SP. See <arch>.ad for frame layout.
1277 OptoReg::Name compute_old_SP();
1278
1279 private:
1280 // Phase control:
1281 void Init(bool aliasing); // Prepare for a single compilation
1282 void Optimize(); // Given a graph, optimize it
1283 void Code_Gen(); // Generate code from a graph
1284
1285 // Management of the AliasType table.
1286 void grow_alias_types();
1287 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1288 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1289 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field, bool uncached = false);
1290
1291 void verify_top(Node*) const PRODUCT_RETURN;
1292
1293 // Intrinsic setup.
1294 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
1295 int intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found); // helper
1296 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
1297 void register_intrinsic(CallGenerator* cg); // update fn
1298
1299 #ifndef PRODUCT
1300 static juint _intrinsic_hist_count[];
1301 static jubyte _intrinsic_hist_flags[];
1302 #endif
1303 // Function calls made by the public function final_graph_reshaping.
1304 // No need to be made public as they are not called elsewhere.
1305 void final_graph_reshaping_impl(Node *n, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1306 void final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop, Unique_Node_List& dead_nodes);
1307 void final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1308 void handle_div_mod_op(Node* n, BasicType bt, bool is_unsigned);
1309
1310 // Logic cone optimization.
1311 void optimize_logic_cones(PhaseIterGVN &igvn);
1312 void collect_logic_cone_roots(Unique_Node_List& list);
1313 void process_logic_cone_root(PhaseIterGVN &igvn, Node* n, VectorSet& visited);
1314 bool compute_logic_cone(Node* n, Unique_Node_List& partition, Unique_Node_List& inputs);
1315 uint compute_truth_table(Unique_Node_List& partition, Unique_Node_List& inputs);
1316 uint eval_macro_logic_op(uint func, uint op1, uint op2, uint op3);
1317 Node* xform_to_MacroLogicV(PhaseIterGVN &igvn, const TypeVect* vt, Unique_Node_List& partitions, Unique_Node_List& inputs);
1318 void check_no_dead_use() const NOT_DEBUG_RETURN;
1319
1320 public:
1321
1322 // Note: Histogram array size is about 1 Kb.
1323 enum { // flag bits:
1324 _intrinsic_worked = 1, // succeeded at least once
1325 _intrinsic_failed = 2, // tried it but it failed
1326 _intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
1327 _intrinsic_virtual = 8, // was seen in the virtual form (rare)
1328 _intrinsic_both = 16 // was seen in the non-virtual form (usual)
1329 };
1330 // Update histogram. Return boolean if this is a first-time occurrence.
1331 static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
1332 bool is_virtual, int flags) PRODUCT_RETURN0;
1333 static void print_intrinsic_statistics() PRODUCT_RETURN;
1334
1335 // Graph verification code
1336 // Walk the node list, verifying that there is a one-to-one correspondence
1337 // between Use-Def edges and Def-Use edges. The option no_dead_code enables
1338 // stronger checks that the graph is strongly connected from starting points
1339 // in both directions.
1340 // root_and_safepoints is used to give the starting points for the traversal.
1341 // If not supplied, only root is used. When this check is called after CCP,
1342 // we need to start traversal from Root and safepoints, just like CCP does its
1343 // own traversal (see PhaseCCP::transform for reasons).
1344 //
1345 // To call this function, there are 2 ways to go:
1346 // - give root_and_safepoints to start traversal everywhere needed (like after CCP)
1347 // - if the whole graph is assumed to be reachable from Root's input,
1348 // root_and_safepoints is not needed (like in PhaseRemoveUseless).
1349 //
1350 // Failure to specify root_and_safepoints in case the graph is not fully
1351 // reachable from Root's input make this check unsound (can miss inconsistencies)
1352 // and even incomplete (can make up non-existing problems) if no_dead_code is
1353 // true.
1354 void verify_graph_edges(bool no_dead_code = false, const Unique_Node_List* root_and_safepoints = nullptr) const PRODUCT_RETURN;
1355
1356 // Verify bi-directional correspondence of edges
1357 void verify_bidirectional_edges(Unique_Node_List& visited, const Unique_Node_List* root_and_safepoints = nullptr) const;
1358
1359 // End-of-run dumps.
1360 static void print_statistics() PRODUCT_RETURN;
1361
1362 // Verify ADLC assumptions during startup
1363 static void adlc_verification() PRODUCT_RETURN;
1364
1365 // Definitions of pd methods
1366 static void pd_compiler2_init();
1367
1368 // Materialize reachability fences from reachability edges on safepoints.
1369 void expand_reachability_edges(Unique_Node_List& safepoints);
1370
1371 // Static parse-time type checking logic for gen_subtype_check:
1372 enum SubTypeCheckResult { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test };
1373 SubTypeCheckResult static_subtype_check(const TypeKlassPtr* superk, const TypeKlassPtr* subk, bool skip = StressReflectiveCode);
1374
1375 static Node* conv_I2X_index(PhaseGVN* phase, Node* offset, const TypeInt* sizetype,
1376 // Optional control dependency (for example, on range check)
1377 Node* ctrl = nullptr);
1378
1379 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check)
1380 static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl, bool carry_dependency = false);
1381
1382 // Auxiliary method for randomized fuzzing/stressing
1383 int random();
1384 bool randomized_select(int count);
1385
1386 // seed random number generation and log the seed for repeatability.
1387 void initialize_stress_seed(const DirectiveSet* directive);
1388
1389 // supporting clone_map
1390 CloneMap& clone_map();
1391 void set_clone_map(Dict* d);
1392
1393 bool needs_clinit_barrier(ciField* ik, ciMethod* accessing_method);
1394 bool needs_clinit_barrier(ciMethod* ik, ciMethod* accessing_method);
1395 bool needs_clinit_barrier(ciInstanceKlass* ik, ciMethod* accessing_method);
1396
1397 #ifdef ASSERT
1398 VerifyMeetResult* _type_verify;
1399 void set_exception_backedge() { _exception_backedge = true; }
1400 bool has_exception_backedge() const { return _exception_backedge; }
1401 #endif
1402
1403 static bool push_thru_add(PhaseGVN* phase, Node* z, const TypeInteger* tz, const TypeInteger*& rx, const TypeInteger*& ry,
1404 BasicType out_bt, BasicType in_bt);
1405
1406 static Node* narrow_value(BasicType bt, Node* value, const Type* type, PhaseGVN* phase, bool transform_res);
1407
1408 #ifndef PRODUCT
1409 private:
1410 // getting rid of the template makes things easier
1411 Node* make_debug_print_call(const char* str, address call_addr, PhaseGVN* gvn,
1412 Node* parm0 = nullptr, Node* parm1 = nullptr,
1413 Node* parm2 = nullptr, Node* parm3 = nullptr,
1414 Node* parm4 = nullptr, Node* parm5 = nullptr,
1415 Node* parm6 = nullptr) const;
1416
1417 public:
1418 // Creates a CallLeafNode for a runtime call that prints a static string and the values of the
1419 // nodes passed as arguments.
1420 // This function also takes care of doing the necessary wiring, including finding a suitable control
1421 // based on the nodes that need to be printed. Note that passing nodes that have incompatible controls
1422 // is undefined behavior.
1423 template <typename... TT, typename... NN>
1424 Node* make_debug_print(const char* str, PhaseGVN* gvn, NN... in) {
1425 address call_addr = CAST_FROM_FN_PTR(address, SharedRuntime::debug_print<TT...>);
1426 return make_debug_print_call(str, call_addr, gvn, in...);
1427 }
1428 #endif
1429 };
1430
1431 #endif // SHARE_OPTO_COMPILE_HPP