1 /*
2 * Copyright (c) 1997, 2023, 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/compiler_globals.hpp"
32 #include "compiler/compilerOracle.hpp"
33 #include "compiler/compileBroker.hpp"
34 #include "compiler/compilerEvent.hpp"
35 #include "compiler/cHeapStringHolder.hpp"
36 #include "libadt/dict.hpp"
37 #include "libadt/vectset.hpp"
38 #include "memory/resourceArea.hpp"
39 #include "oops/methodData.hpp"
40 #include "opto/idealGraphPrinter.hpp"
41 #include "opto/phasetype.hpp"
42 #include "opto/phase.hpp"
43 #include "opto/regmask.hpp"
44 #include "runtime/deoptimization.hpp"
45 #include "runtime/sharedRuntime.hpp"
46 #include "runtime/timerTrace.hpp"
47 #include "runtime/vmThread.hpp"
48 #include "utilities/ticks.hpp"
49
50 class AbstractLockNode;
51 class AddPNode;
52 class Block;
53 class Bundle;
54 class CallGenerator;
55 class CallStaticJavaNode;
56 class CloneMap;
57 class ConnectionGraph;
58 class IdealGraphPrinter;
59 class InlineTree;
60 class Matcher;
61 class MachConstantNode;
62 class MachConstantBaseNode;
63 class MachNode;
64 class MachOper;
65 class MachSafePointNode;
66 class Node;
67 class Node_Array;
68 class Node_List;
69 class Node_Notes;
70 class NodeHash;
71 class NodeCloneInfo;
72 class OptoReg;
73 class PhaseCFG;
74 class PhaseGVN;
75 class PhaseIterGVN;
76 class PhaseRegAlloc;
77 class PhaseCCP;
78 class PhaseOutput;
79 class RootNode;
80 class relocInfo;
81 class StartNode;
82 class SafePointNode;
83 class JVMState;
84 class Type;
85 class TypeInt;
86 class TypeInteger;
87 class TypeKlassPtr;
88 class TypePtr;
89 class TypeOopPtr;
90 class TypeFunc;
91 class TypeVect;
92 class Type_Array;
93 class Unique_Node_List;
94 class UnstableIfTrap;
95 class nmethod;
96 class Node_Stack;
97 struct Final_Reshape_Counts;
98 class VerifyMeetResult;
99
100 enum LoopOptsMode {
101 LoopOptsDefault,
102 LoopOptsNone,
103 LoopOptsMaxUnroll,
104 LoopOptsShenandoahExpand,
105 LoopOptsSkipSplitIf,
106 LoopOptsVerify
107 };
108
109 // The type of all node counts and indexes.
110 // It must hold at least 16 bits, but must also be fast to load and store.
111 // This type, if less than 32 bits, could limit the number of possible nodes.
112 // (To make this type platform-specific, move to globalDefinitions_xxx.hpp.)
113 typedef unsigned int node_idx_t;
114
115 class NodeCloneInfo {
116 private:
117 uint64_t _idx_clone_orig;
118 public:
119
120 void set_idx(node_idx_t idx) {
121 _idx_clone_orig = (_idx_clone_orig & CONST64(0xFFFFFFFF00000000)) | idx;
122 }
123 node_idx_t idx() const { return (node_idx_t)(_idx_clone_orig & 0xFFFFFFFF); }
124
125 void set_gen(int generation) {
126 uint64_t g = (uint64_t)generation << 32;
127 _idx_clone_orig = (_idx_clone_orig & 0xFFFFFFFF) | g;
128 }
129 int gen() const { return (int)(_idx_clone_orig >> 32); }
130
131 void set(uint64_t x) { _idx_clone_orig = x; }
132 void set(node_idx_t x, int g) { set_idx(x); set_gen(g); }
133 uint64_t get() const { return _idx_clone_orig; }
134
135 NodeCloneInfo(uint64_t idx_clone_orig) : _idx_clone_orig(idx_clone_orig) {}
136 NodeCloneInfo(node_idx_t x, int g) : _idx_clone_orig(0) { set(x, g); }
137
138 void dump_on(outputStream* st) const;
139 };
140
141 class CloneMap {
142 friend class Compile;
143 private:
144 bool _debug;
145 Dict* _dict;
146 int _clone_idx; // current cloning iteration/generation in loop unroll
147 public:
148 void* _2p(node_idx_t key) const { return (void*)(intptr_t)key; } // 2 conversion functions to make gcc happy
149 node_idx_t _2_node_idx_t(const void* k) const { return (node_idx_t)(intptr_t)k; }
150 Dict* dict() const { return _dict; }
151 void insert(node_idx_t key, uint64_t val) { assert(_dict->operator[](_2p(key)) == nullptr, "key existed"); _dict->Insert(_2p(key), (void*)val); }
152 void insert(node_idx_t key, NodeCloneInfo& ci) { insert(key, ci.get()); }
153 void remove(node_idx_t key) { _dict->Delete(_2p(key)); }
154 uint64_t value(node_idx_t key) const { return (uint64_t)_dict->operator[](_2p(key)); }
155 node_idx_t idx(node_idx_t key) const { return NodeCloneInfo(value(key)).idx(); }
156 int gen(node_idx_t key) const { return NodeCloneInfo(value(key)).gen(); }
157 int gen(const void* k) const { return gen(_2_node_idx_t(k)); }
158 int max_gen() const;
159 void clone(Node* old, Node* nnn, int gen);
160 void verify_insert_and_clone(Node* old, Node* nnn, int gen);
161 void dump(node_idx_t key, outputStream* st) const;
162
163 int clone_idx() const { return _clone_idx; }
164 void set_clone_idx(int x) { _clone_idx = x; }
165 bool is_debug() const { return _debug; }
166 void set_debug(bool debug) { _debug = debug; }
167
168 bool same_idx(node_idx_t k1, node_idx_t k2) const { return idx(k1) == idx(k2); }
169 bool same_gen(node_idx_t k1, node_idx_t k2) const { return gen(k1) == gen(k2); }
170 };
171
172 class Options {
173 friend class Compile;
174 friend class VMStructs;
175 private:
176 const bool _subsume_loads; // Load can be matched as part of a larger op.
177 const bool _do_escape_analysis; // Do escape analysis.
178 const bool _do_iterative_escape_analysis; // Do iterative escape analysis.
179 const bool _eliminate_boxing; // Do boxing elimination.
180 const bool _do_locks_coarsening; // Do locks coarsening
181 const bool _install_code; // Install the code that was compiled
182 public:
183 Options(bool subsume_loads, bool do_escape_analysis,
184 bool do_iterative_escape_analysis,
185 bool eliminate_boxing, bool do_locks_coarsening,
186 bool install_code) :
187 _subsume_loads(subsume_loads),
188 _do_escape_analysis(do_escape_analysis),
189 _do_iterative_escape_analysis(do_iterative_escape_analysis),
190 _eliminate_boxing(eliminate_boxing),
191 _do_locks_coarsening(do_locks_coarsening),
192 _install_code(install_code) {
193 }
194
195 static Options for_runtime_stub() {
196 return Options(
197 /* subsume_loads = */ true,
198 /* do_escape_analysis = */ false,
199 /* do_iterative_escape_analysis = */ false,
200 /* eliminate_boxing = */ false,
201 /* do_lock_coarsening = */ false,
202 /* install_code = */ true
203 );
204 }
205 };
206
207 //------------------------------Compile----------------------------------------
208 // This class defines a top-level Compiler invocation.
209
210 class Compile : public Phase {
211 friend class VMStructs;
212
213 public:
214 // Fixed alias indexes. (See also MergeMemNode.)
215 enum {
216 AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value)
217 AliasIdxBot = 2, // pseudo-index, aliases to everything
218 AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM
219 };
220
221 // Variant of TraceTime(nullptr, &_t_accumulator, CITime);
222 // Integrated with logging. If logging is turned on, and CITimeVerbose is true,
223 // then brackets are put into the log, with time stamps and node counts.
224 // (The time collection itself is always conditionalized on CITime.)
225 class TracePhase : public TraceTime {
226 private:
227 Compile* C;
228 CompileLog* _log;
229 const char* _phase_name;
230 bool _dolog;
231 public:
232 TracePhase(const char* name, elapsedTimer* accumulator);
233 ~TracePhase();
234 };
235
236 // Information per category of alias (memory slice)
237 class AliasType {
238 private:
239 friend class Compile;
240
241 int _index; // unique index, used with MergeMemNode
242 const TypePtr* _adr_type; // normalized address type
243 ciField* _field; // relevant instance field, or null if none
244 const Type* _element; // relevant array element type, or null if none
245 bool _is_rewritable; // false if the memory is write-once only
246 int _general_index; // if this is type is an instance, the general
247 // type that this is an instance of
248
249 void Init(int i, const TypePtr* at);
250
251 public:
252 int index() const { return _index; }
253 const TypePtr* adr_type() const { return _adr_type; }
254 ciField* field() const { return _field; }
255 const Type* element() const { return _element; }
256 bool is_rewritable() const { return _is_rewritable; }
257 bool is_volatile() const { return (_field ? _field->is_volatile() : false); }
258 int general_index() const { return (_general_index != 0) ? _general_index : _index; }
259
260 void set_rewritable(bool z) { _is_rewritable = z; }
261 void set_field(ciField* f) {
262 assert(!_field,"");
263 _field = f;
264 if (f->is_final() || f->is_stable()) {
265 // In the case of @Stable, multiple writes are possible but may be assumed to be no-ops.
266 _is_rewritable = false;
267 }
268 }
269 void set_element(const Type* e) {
270 assert(_element == nullptr, "");
271 _element = e;
272 }
273
274 BasicType basic_type() const;
275
276 void print_on(outputStream* st) PRODUCT_RETURN;
277 };
278
279 enum {
280 logAliasCacheSize = 6,
281 AliasCacheSize = (1<<logAliasCacheSize)
282 };
283 struct AliasCacheEntry { const TypePtr* _adr_type; int _index; }; // simple duple type
284 enum {
285 trapHistLength = MethodData::_trap_hist_limit
286 };
287
288 private:
289 // Fixed parameters to this compilation.
290 const int _compile_id;
291 const Options _options; // Compilation options
292 ciMethod* _method; // The method being compiled.
293 int _entry_bci; // entry bci for osr methods.
294 const TypeFunc* _tf; // My kind of signature
295 InlineTree* _ilt; // Ditto (temporary).
296 address _stub_function; // VM entry for stub being compiled, or null
297 const char* _stub_name; // Name of stub or adapter being compiled, or null
298 address _stub_entry_point; // Compile code entry for generated stub, or null
299
300 // Control of this compilation.
301 int _max_inline_size; // Max inline size for this compilation
302 int _freq_inline_size; // Max hot method inline size for this compilation
303 int _fixed_slots; // count of frame slots not allocated by the register
304 // allocator i.e. locks, original deopt pc, etc.
305 uintx _max_node_limit; // Max unique node count during a single compilation.
306
307 bool _post_loop_opts_phase; // Loop opts are finished.
308
309 int _major_progress; // Count of something big happening
310 bool _inlining_progress; // progress doing incremental inlining?
311 bool _inlining_incrementally;// Are we doing incremental inlining (post parse)
312 bool _do_cleanup; // Cleanup is needed before proceeding with incremental inlining
313 bool _has_loops; // True if the method _may_ have some loops
314 bool _has_split_ifs; // True if the method _may_ have some split-if
315 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
316 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
317 bool _has_boxed_value; // True if a boxed object is allocated
318 bool _has_reserved_stack_access; // True if the method or an inlined method is annotated with ReservedStackAccess
319 uint _max_vector_size; // Maximum size of generated vectors
320 bool _clear_upper_avx; // Clear upper bits of ymm registers using vzeroupper
321 uint _trap_hist[trapHistLength]; // Cumulative traps
322 bool _trap_can_recompile; // Have we emitted a recompiling trap?
323 uint _decompile_count; // Cumulative decompilation counts.
324 bool _do_inlining; // True if we intend to do inlining
325 bool _do_scheduling; // True if we intend to do scheduling
326 bool _do_freq_based_layout; // True if we intend to do frequency based block layout
327 bool _do_vector_loop; // True if allowed to execute loop in parallel iterations
328 bool _use_cmove; // True if CMove should be used without profitability analysis
329 bool _do_aliasing; // True if we intend to do aliasing
330 bool _print_assembly; // True if we should dump assembly code for this compilation
331 bool _print_inlining; // True if we should print inlining for this compilation
332 bool _print_intrinsics; // True if we should print intrinsics for this compilation
333 #ifndef PRODUCT
334 uint _igv_idx; // Counter for IGV node identifiers
335 bool _trace_opto_output;
336 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
337 #endif
338 bool _has_irreducible_loop; // Found irreducible loops
339 // JSR 292
340 bool _has_method_handle_invokes; // True if this method has MethodHandle invokes.
341 bool _has_monitors; // Metadata transfered to nmethod to enable Continuations lock-detection fastpath
342 RTMState _rtm_state; // State of Restricted Transactional Memory usage
343 int _loop_opts_cnt; // loop opts round
344 bool _clinit_barrier_on_entry; // True if clinit barrier is needed on nmethod entry
345 uint _stress_seed; // Seed for stress testing
346
347 // Compilation environment.
348 Arena _comp_arena; // Arena with lifetime equivalent to Compile
349 void* _barrier_set_state; // Potential GC barrier state for Compile
350 ciEnv* _env; // CI interface
351 DirectiveSet* _directive; // Compiler directive
352 CompileLog* _log; // from CompilerThread
353 CHeapStringHolder _failure_reason; // for record_failure/failing pattern
354 GrowableArray<CallGenerator*> _intrinsics; // List of intrinsics.
355 GrowableArray<Node*> _macro_nodes; // List of nodes which need to be expanded before matching.
356 GrowableArray<Node*> _parse_predicate_opaqs; // List of Opaque1 nodes for the Parse Predicates.
357 GrowableArray<Node*> _template_assertion_predicate_opaqs; // List of Opaque4 nodes for Template Assertion Predicates.
358 GrowableArray<Node*> _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
359 GrowableArray<Node*> _for_post_loop_igvn; // List of nodes for IGVN after loop opts are over
360 GrowableArray<UnstableIfTrap*> _unstable_if_traps; // List of ifnodes after IGVN
361 GrowableArray<Node_List*> _coarsened_locks; // List of coarsened Lock and Unlock nodes
362 ConnectionGraph* _congraph;
363 #ifndef PRODUCT
364 IdealGraphPrinter* _igv_printer;
365 static IdealGraphPrinter* _debug_file_printer;
366 static IdealGraphPrinter* _debug_network_printer;
367 #endif
368
369
370 // Node management
371 uint _unique; // Counter for unique Node indices
372 VectorSet _dead_node_list; // Set of dead nodes
373 uint _dead_node_count; // Number of dead nodes; VectorSet::Size() is O(N).
374 // So use this to keep count and make the call O(1).
375 DEBUG_ONLY(Unique_Node_List* _modified_nodes;) // List of nodes which inputs were modified
376 DEBUG_ONLY(bool _phase_optimize_finished;) // Used for live node verification while creating new nodes
377
378 Arena _node_arena; // Arena for new-space Nodes
379 Arena _old_arena; // Arena for old-space Nodes, lifetime during xform
380 RootNode* _root; // Unique root of compilation, or null after bail-out.
381 Node* _top; // Unique top node. (Reset by various phases.)
382
383 Node* _immutable_memory; // Initial memory state
384
385 Node* _recent_alloc_obj;
386 Node* _recent_alloc_ctl;
387
388 // Constant table
389 MachConstantBaseNode* _mach_constant_base_node; // Constant table base node singleton.
390
391
392 // Blocked array of debugging and profiling information,
393 // tracked per node.
394 enum { _log2_node_notes_block_size = 8,
395 _node_notes_block_size = (1<<_log2_node_notes_block_size)
396 };
397 GrowableArray<Node_Notes*>* _node_note_array;
398 Node_Notes* _default_node_notes; // default notes for new nodes
399
400 // After parsing and every bulk phase we hang onto the Root instruction.
401 // The RootNode instruction is where the whole program begins. It produces
402 // the initial Control and BOTTOM for everybody else.
403
404 // Type management
405 Arena _Compile_types; // Arena for all types
406 Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared()
407 Dict* _type_dict; // Intern table
408 CloneMap _clone_map; // used for recording history of cloned nodes
409 size_t _type_last_size; // Last allocation size (see Type::operator new/delete)
410 ciMethod* _last_tf_m; // Cache for
411 const TypeFunc* _last_tf; // TypeFunc::make
412 AliasType** _alias_types; // List of alias types seen so far.
413 int _num_alias_types; // Logical length of _alias_types
414 int _max_alias_types; // Physical length of _alias_types
415 AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
416
417 // Parsing, optimization
418 PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN
419
420 // Shared worklist for all IGVN rounds. Nodes can be pushed to it at any time.
421 // If pushed outside IGVN, the Node is processed in the next IGVN round.
422 Unique_Node_List* _igvn_worklist;
423
424 // Shared type array for GVN, IGVN and CCP. It maps node idx -> Type*.
425 Type_Array* _types;
426
427 // Shared node hash table for GVN, IGVN and CCP.
428 NodeHash* _node_hash;
429
430 GrowableArray<CallGenerator*> _late_inlines; // List of CallGenerators to be revisited after main parsing has finished.
431 GrowableArray<CallGenerator*> _string_late_inlines; // same but for string operations
432 GrowableArray<CallGenerator*> _boxing_late_inlines; // same but for boxing operations
433
434 GrowableArray<CallGenerator*> _vector_reboxing_late_inlines; // same but for vector reboxing operations
435
436 int _late_inlines_pos; // Where in the queue should the next late inlining candidate go (emulate depth first inlining)
437 uint _number_of_mh_late_inlines; // number of method handle late inlining still pending
438
439 // Inlining may not happen in parse order which would make
440 // PrintInlining output confusing. Keep track of PrintInlining
441 // pieces in order.
442 class PrintInliningBuffer : public CHeapObj<mtCompiler> {
443 private:
444 CallGenerator* _cg;
445 stringStream _ss;
446 static const size_t default_stream_buffer_size = 128;
447
448 public:
449 PrintInliningBuffer()
450 : _cg(nullptr), _ss(default_stream_buffer_size) {}
451
452 stringStream* ss() { return &_ss; }
453 CallGenerator* cg() { return _cg; }
454 void set_cg(CallGenerator* cg) { _cg = cg; }
455 };
456
457 stringStream* _print_inlining_stream;
458 GrowableArray<PrintInliningBuffer*>* _print_inlining_list;
459 int _print_inlining_idx;
460 char* _print_inlining_output;
461
462 // Only keep nodes in the expensive node list that need to be optimized
463 void cleanup_expensive_nodes(PhaseIterGVN &igvn);
464 // Use for sorting expensive nodes to bring similar nodes together
465 static int cmp_expensive_nodes(Node** n1, Node** n2);
466 // Expensive nodes list already sorted?
467 bool expensive_nodes_sorted() const;
468 // Remove the speculative part of types and clean up the graph
469 void remove_speculative_types(PhaseIterGVN &igvn);
470
471 void* _replay_inline_data; // Pointer to data loaded from file
472
473 void print_inlining_init();
474 void print_inlining_reinit();
475 void print_inlining_commit();
476 void print_inlining_push();
477 PrintInliningBuffer* print_inlining_current();
478
479 void log_late_inline_failure(CallGenerator* cg, const char* msg);
480 DEBUG_ONLY(bool _exception_backedge;)
481
482 public:
483
484 void* barrier_set_state() const { return _barrier_set_state; }
485
486 stringStream* print_inlining_stream() {
487 assert(print_inlining() || print_intrinsics(), "PrintInlining off?");
488 return _print_inlining_stream;
489 }
490
491 void print_inlining_update(CallGenerator* cg);
492 void print_inlining_update_delayed(CallGenerator* cg);
493 void print_inlining_move_to(CallGenerator* cg);
494 void print_inlining_assert_ready();
495 void print_inlining_reset();
496
497 void print_inlining(ciMethod* method, int inline_level, int bci, const char* msg = nullptr) {
498 stringStream ss;
499 CompileTask::print_inlining_inner(&ss, method, inline_level, bci, msg);
500 print_inlining_stream()->print("%s", ss.freeze());
501 }
502
503 #ifndef PRODUCT
504 IdealGraphPrinter* igv_printer() { return _igv_printer; }
505 #endif
506
507 void log_late_inline(CallGenerator* cg);
508 void log_inline_id(CallGenerator* cg);
509 void log_inline_failure(const char* msg);
510
511 void* replay_inline_data() const { return _replay_inline_data; }
512
513 // Dump inlining replay data to the stream.
514 void dump_inline_data(outputStream* out);
515 void dump_inline_data_reduced(outputStream* out);
516
517 private:
518 // Matching, CFG layout, allocation, code generation
519 PhaseCFG* _cfg; // Results of CFG finding
520 int _java_calls; // Number of java calls in the method
521 int _inner_loops; // Number of inner loops in the method
522 Matcher* _matcher; // Engine to map ideal to machine instructions
523 PhaseRegAlloc* _regalloc; // Results of register allocation.
524 RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout)
525 Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin
526 void* _indexSet_free_block_list; // free list of IndexSet bit blocks
527 int _interpreter_frame_size;
528
529 PhaseOutput* _output;
530
531 public:
532 // Accessors
533
534 // The Compile instance currently active in this (compiler) thread.
535 static Compile* current() {
536 return (Compile*) ciEnv::current()->compiler_data();
537 }
538
539 int interpreter_frame_size() const { return _interpreter_frame_size; }
540
541 PhaseOutput* output() const { return _output; }
542 void set_output(PhaseOutput* o) { _output = o; }
543
544 // ID for this compilation. Useful for setting breakpoints in the debugger.
545 int compile_id() const { return _compile_id; }
546 DirectiveSet* directive() const { return _directive; }
547
548 // Does this compilation allow instructions to subsume loads? User
549 // instructions that subsume a load may result in an unschedulable
550 // instruction sequence.
551 bool subsume_loads() const { return _options._subsume_loads; }
552 /** Do escape analysis. */
553 bool do_escape_analysis() const { return _options._do_escape_analysis; }
554 bool do_iterative_escape_analysis() const { return _options._do_iterative_escape_analysis; }
555 /** Do boxing elimination. */
556 bool eliminate_boxing() const { return _options._eliminate_boxing; }
557 /** Do aggressive boxing elimination. */
558 bool aggressive_unboxing() const { return _options._eliminate_boxing && AggressiveUnboxing; }
559 bool should_install_code() const { return _options._install_code; }
560 /** Do locks coarsening. */
561 bool do_locks_coarsening() const { return _options._do_locks_coarsening; }
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; }
583 int inlining_incrementally() const { return _inlining_incrementally; }
584 void set_do_cleanup(bool z) { _do_cleanup = z; }
585 int do_cleanup() const { return _do_cleanup; }
586 void set_major_progress() { _major_progress++; }
587 void restore_major_progress(int progress) { _major_progress += progress; }
588 void clear_major_progress() { _major_progress = 0; }
589 int max_inline_size() const { return _max_inline_size; }
590 void set_freq_inline_size(int n) { _freq_inline_size = n; }
591 int freq_inline_size() const { return _freq_inline_size; }
592 void set_max_inline_size(int n) { _max_inline_size = n; }
593 bool has_loops() const { return _has_loops; }
594 void set_has_loops(bool z) { _has_loops = z; }
595 bool has_split_ifs() const { return _has_split_ifs; }
596 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
597 bool has_unsafe_access() const { return _has_unsafe_access; }
598 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
599 bool has_stringbuilder() const { return _has_stringbuilder; }
600 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; }
601 bool has_boxed_value() const { return _has_boxed_value; }
602 void set_has_boxed_value(bool z) { _has_boxed_value = z; }
603 bool has_reserved_stack_access() const { return _has_reserved_stack_access; }
604 void set_has_reserved_stack_access(bool z) { _has_reserved_stack_access = z; }
605 uint max_vector_size() const { return _max_vector_size; }
606 void set_max_vector_size(uint s) { _max_vector_size = s; }
607 bool clear_upper_avx() const { return _clear_upper_avx; }
608 void set_clear_upper_avx(bool s) { _clear_upper_avx = s; }
609 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
610 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
611 bool trap_can_recompile() const { return _trap_can_recompile; }
612 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
613 uint decompile_count() const { return _decompile_count; }
614 void set_decompile_count(uint c) { _decompile_count = c; }
615 bool allow_range_check_smearing() const;
616 bool do_inlining() const { return _do_inlining; }
617 void set_do_inlining(bool z) { _do_inlining = z; }
618 bool do_scheduling() const { return _do_scheduling; }
619 void set_do_scheduling(bool z) { _do_scheduling = z; }
620 bool do_freq_based_layout() const{ return _do_freq_based_layout; }
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 RTMState rtm_state() const { return _rtm_state; }
634 void set_rtm_state(RTMState s) { _rtm_state = s; }
635 bool use_rtm() const { return (_rtm_state & NoRTM) == 0; }
636 bool profile_rtm() const { return _rtm_state == ProfileRTM; }
637 uint max_node_limit() const { return (uint)_max_node_limit; }
638 void set_max_node_limit(uint n) { _max_node_limit = n; }
639 bool clinit_barrier_on_entry() { return _clinit_barrier_on_entry; }
640 void set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
641 bool has_monitors() const { return _has_monitors; }
642 void set_has_monitors(bool v) { _has_monitors = v; }
643
644 // check the CompilerOracle for special behaviours for this compile
645 bool method_has_option(enum CompileCommand option) {
646 return method() != nullptr && method()->has_option(option);
647 }
648
649 #ifndef PRODUCT
650 uint next_igv_idx() { return _igv_idx++; }
651 bool trace_opto_output() const { return _trace_opto_output; }
652 void print_ideal_ir(const char* phase_name);
653 bool should_print_ideal() const { return _directive->PrintIdealOption; }
654 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
655 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
656 int _in_dump_cnt; // Required for dumping ir nodes.
657 #endif
658 bool has_irreducible_loop() const { return _has_irreducible_loop; }
659 void set_has_irreducible_loop(bool z) { _has_irreducible_loop = z; }
660
661 // JSR 292
662 bool has_method_handle_invokes() const { return _has_method_handle_invokes; }
663 void set_has_method_handle_invokes(bool z) { _has_method_handle_invokes = z; }
664
665 Ticks _latest_stage_start_counter;
666
667 void begin_method();
668 void end_method();
669 bool should_print_igv(int level);
670 bool should_print_phase(CompilerPhaseType cpt);
671
672 void print_method(CompilerPhaseType cpt, int level, Node* n = nullptr);
673
674 #ifndef PRODUCT
675 void dump_igv(const char* graph_name, int level = 3) {
676 if (should_print_igv(level)) {
677 _igv_printer->print_method(graph_name, level);
678 }
679 }
680
681 void igv_print_method_to_file(const char* phase_name = "Debug", bool append = false);
682 void igv_print_method_to_network(const char* phase_name = "Debug");
683 static IdealGraphPrinter* debug_file_printer() { return _debug_file_printer; }
684 static IdealGraphPrinter* debug_network_printer() { return _debug_network_printer; }
685 #endif
686
687 int macro_count() const { return _macro_nodes.length(); }
688 int parse_predicate_count() const { return _parse_predicate_opaqs.length(); }
689 int template_assertion_predicate_count() const { return _template_assertion_predicate_opaqs.length(); }
690 int expensive_count() const { return _expensive_nodes.length(); }
691 int coarsened_count() const { return _coarsened_locks.length(); }
692
693 Node* macro_node(int idx) const { return _macro_nodes.at(idx); }
694 Node* parse_predicate_opaque1_node(int idx) const { return _parse_predicate_opaqs.at(idx); }
695
696 Node* template_assertion_predicate_opaq_node(int idx) const {
697 return _template_assertion_predicate_opaqs.at(idx);
698 }
699
700 Node* expensive_node(int idx) const { return _expensive_nodes.at(idx); }
701
702 ConnectionGraph* congraph() { return _congraph;}
703 void set_congraph(ConnectionGraph* congraph) { _congraph = congraph;}
704 void add_macro_node(Node * n) {
705 //assert(n->is_macro(), "must be a macro node");
706 assert(!_macro_nodes.contains(n), "duplicate entry in expand list");
707 _macro_nodes.append(n);
708 }
709 void remove_macro_node(Node* n) {
710 // this function may be called twice for a node so we can only remove it
711 // if it's still existing.
712 _macro_nodes.remove_if_existing(n);
713 // remove from _parse_predicate_opaqs list also if it is there
714 if (parse_predicate_count() > 0) {
715 _parse_predicate_opaqs.remove_if_existing(n);
716 }
717 // Remove from coarsened locks list if present
718 if (coarsened_count() > 0) {
719 remove_coarsened_lock(n);
720 }
721 }
722 void add_expensive_node(Node* n);
723 void remove_expensive_node(Node* n) {
724 _expensive_nodes.remove_if_existing(n);
725 }
726 void add_parse_predicate_opaq(Node* n) {
727 assert(!_parse_predicate_opaqs.contains(n), "duplicate entry in Parse Predicate opaque1 list");
728 assert(_macro_nodes.contains(n), "should have already been in macro list");
729 _parse_predicate_opaqs.append(n);
730 }
731 void add_template_assertion_predicate_opaq(Node* n) {
732 assert(!_template_assertion_predicate_opaqs.contains(n),
733 "duplicate entry in template assertion predicate opaque4 list");
734 _template_assertion_predicate_opaqs.append(n);
735 }
736 void remove_template_assertion_predicate_opaq(Node* n) {
737 if (template_assertion_predicate_count() > 0) {
738 _template_assertion_predicate_opaqs.remove_if_existing(n);
739 }
740 }
741 void add_coarsened_locks(GrowableArray<AbstractLockNode*>& locks);
742 void remove_coarsened_lock(Node* n);
743 bool coarsened_locks_consistent();
744 void mark_unbalanced_boxes() const;
745
746 bool post_loop_opts_phase() { return _post_loop_opts_phase; }
747 void set_post_loop_opts_phase() { _post_loop_opts_phase = true; }
748 void reset_post_loop_opts_phase() { _post_loop_opts_phase = false; }
749
750 void record_for_post_loop_opts_igvn(Node* n);
751 void remove_from_post_loop_opts_igvn(Node* n);
752 void process_for_post_loop_opts_igvn(PhaseIterGVN& igvn);
753
754 void record_unstable_if_trap(UnstableIfTrap* trap);
755 bool remove_unstable_if_trap(CallStaticJavaNode* unc, bool yield);
756 void remove_useless_unstable_if_traps(Unique_Node_List &useful);
757 void process_for_unstable_if_traps(PhaseIterGVN& igvn);
758
759 void sort_macro_nodes();
760
761 // Remove the opaque nodes that protect the Parse Predicates so that the unused checks and
762 // uncommon traps will be eliminated from the graph.
763 void cleanup_parse_predicates(PhaseIterGVN &igvn) const;
764 bool is_predicate_opaq(Node* n) const {
765 return _parse_predicate_opaqs.contains(n);
766 }
767
768 // Are there candidate expensive nodes for optimization?
769 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
770 // Check whether n1 and n2 are similar
771 static int cmp_expensive_nodes(Node* n1, Node* n2);
772 // Sort expensive nodes to locate similar expensive nodes
773 void sort_expensive_nodes();
774
775 // Compilation environment.
776 Arena* comp_arena() { return &_comp_arena; }
777 ciEnv* env() const { return _env; }
778 CompileLog* log() const { return _log; }
779
780 bool failing() const {
781 return _env->failing() ||
782 _failure_reason.get() != nullptr;
783 }
784
785 const char* failure_reason() const {
786 return _env->failing() ? _env->failure_reason()
787 : _failure_reason.get();
788 }
789
790 bool failure_reason_is(const char* r) const {
791 return (r == _failure_reason.get()) ||
792 (r != nullptr &&
793 _failure_reason.get() != nullptr &&
794 strcmp(r, _failure_reason.get()) == 0);
795 }
796
797 void record_failure(const char* reason);
798 void record_method_not_compilable(const char* reason) {
799 env()->record_method_not_compilable(reason);
800 // Record failure reason.
801 record_failure(reason);
802 }
803 bool check_node_count(uint margin, const char* reason) {
804 if (live_nodes() + margin > max_node_limit()) {
805 record_method_not_compilable(reason);
806 return true;
807 } else {
808 return false;
809 }
810 }
811
812 // Node management
813 uint unique() const { return _unique; }
814 uint next_unique() { return _unique++; }
815 void set_unique(uint i) { _unique = i; }
816 Arena* node_arena() { return &_node_arena; }
817 Arena* old_arena() { return &_old_arena; }
818 RootNode* root() const { return _root; }
819 void set_root(RootNode* r) { _root = r; }
820 StartNode* start() const; // (Derived from root.)
821 void init_start(StartNode* s);
822 Node* immutable_memory();
823
824 Node* recent_alloc_ctl() const { return _recent_alloc_ctl; }
825 Node* recent_alloc_obj() const { return _recent_alloc_obj; }
826 void set_recent_alloc(Node* ctl, Node* obj) {
827 _recent_alloc_ctl = ctl;
828 _recent_alloc_obj = obj;
829 }
830 void record_dead_node(uint idx) { if (_dead_node_list.test_set(idx)) return;
831 _dead_node_count++;
832 }
833 void reset_dead_node_list() { _dead_node_list.reset();
834 _dead_node_count = 0;
835 }
836 uint live_nodes() const {
837 int val = _unique - _dead_node_count;
838 assert (val >= 0, "number of tracked dead nodes %d more than created nodes %d", _unique, _dead_node_count);
839 return (uint) val;
840 }
841 #ifdef ASSERT
842 void set_phase_optimize_finished() { _phase_optimize_finished = true; }
843 bool phase_optimize_finished() const { return _phase_optimize_finished; }
844 uint count_live_nodes_by_graph_walk();
845 void print_missing_nodes();
846 #endif
847
848 // Record modified nodes to check that they are put on IGVN worklist
849 void record_modified_node(Node* n) NOT_DEBUG_RETURN;
850 void remove_modified_node(Node* n) NOT_DEBUG_RETURN;
851 DEBUG_ONLY( Unique_Node_List* modified_nodes() const { return _modified_nodes; } )
852
853 MachConstantBaseNode* mach_constant_base_node();
854 bool has_mach_constant_base_node() const { return _mach_constant_base_node != nullptr; }
855 // Generated by adlc, true if CallNode requires MachConstantBase.
856 bool needs_deep_clone_jvms();
857
858 // Handy undefined Node
859 Node* top() const { return _top; }
860
861 // these are used by guys who need to know about creation and transformation of top:
862 Node* cached_top_node() { return _top; }
863 void set_cached_top_node(Node* tn);
864
865 GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
866 void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
867 Node_Notes* default_node_notes() const { return _default_node_notes; }
868 void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
869
870 Node_Notes* node_notes_at(int idx) {
871 return locate_node_notes(_node_note_array, idx, false);
872 }
873 inline bool set_node_notes_at(int idx, Node_Notes* value);
874
875 // Copy notes from source to dest, if they exist.
876 // Overwrite dest only if source provides something.
877 // Return true if information was moved.
878 bool copy_node_notes_to(Node* dest, Node* source);
879
880 // Workhorse function to sort out the blocked Node_Notes array:
881 inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
882 int idx, bool can_grow = false);
883
884 void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
885
886 // Type management
887 Arena* type_arena() { return _type_arena; }
888 Dict* type_dict() { return _type_dict; }
889 size_t type_last_size() { return _type_last_size; }
890 int num_alias_types() { return _num_alias_types; }
891
892 void init_type_arena() { _type_arena = &_Compile_types; }
893 void set_type_arena(Arena* a) { _type_arena = a; }
894 void set_type_dict(Dict* d) { _type_dict = d; }
895 void set_type_last_size(size_t sz) { _type_last_size = sz; }
896
897 const TypeFunc* last_tf(ciMethod* m) {
898 return (m == _last_tf_m) ? _last_tf : nullptr;
899 }
900 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
901 assert(m != nullptr || tf == nullptr, "");
902 _last_tf_m = m;
903 _last_tf = tf;
904 }
905
906 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
907 AliasType* alias_type(const TypePtr* adr_type, ciField* field = nullptr) { return find_alias_type(adr_type, false, field); }
908 bool have_alias_type(const TypePtr* adr_type);
909 AliasType* alias_type(ciField* field);
910
911 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); }
912 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
913 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
914
915 // Building nodes
916 void rethrow_exceptions(JVMState* jvms);
917 void return_values(JVMState* jvms);
918 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
919
920 // Decide how to build a call.
921 // The profile factor is a discount to apply to this site's interp. profile.
922 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch,
923 JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = nullptr,
924 bool allow_intrinsics = true);
925 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
926 return should_delay_string_inlining(call_method, jvms) ||
927 should_delay_boxing_inlining(call_method, jvms) ||
928 should_delay_vector_inlining(call_method, jvms);
929 }
930 bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
931 bool should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms);
932 bool should_delay_vector_inlining(ciMethod* call_method, JVMState* jvms);
933 bool should_delay_vector_reboxing_inlining(ciMethod* call_method, JVMState* jvms);
934
935 // Helper functions to identify inlining potential at call-site
936 ciMethod* optimize_virtual_call(ciMethod* caller, ciInstanceKlass* klass,
937 ciKlass* holder, ciMethod* callee,
938 const TypeOopPtr* receiver_type, bool is_virtual,
939 bool &call_does_dispatch, int &vtable_index,
940 bool check_access = true);
941 ciMethod* optimize_inlining(ciMethod* caller, ciInstanceKlass* klass, ciKlass* holder,
942 ciMethod* callee, const TypeOopPtr* receiver_type,
943 bool check_access = true);
944
945 // Report if there were too many traps at a current method and bci.
946 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
947 // If there is no MDO at all, report no trap unless told to assume it.
948 bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
949 // This version, unspecific to a particular bci, asks if
950 // PerMethodTrapLimit was exceeded for all inlined methods seen so far.
951 bool too_many_traps(Deoptimization::DeoptReason reason,
952 // Privately used parameter for logging:
953 ciMethodData* logmd = nullptr);
954 // Report if there were too many recompiles at a method and bci.
955 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
956 // Report if there were too many traps or recompiles at a method and bci.
957 bool too_many_traps_or_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason) {
958 return too_many_traps(method, bci, reason) ||
959 too_many_recompiles(method, bci, reason);
960 }
961 // Return a bitset with the reasons where deoptimization is allowed,
962 // i.e., where there were not too many uncommon traps.
963 int _allowed_reasons;
964 int allowed_deopt_reasons() { return _allowed_reasons; }
965 void set_allowed_deopt_reasons();
966
967 // Parsing, optimization
968 PhaseGVN* initial_gvn() { return _initial_gvn; }
969 Unique_Node_List* igvn_worklist() {
970 assert(_igvn_worklist != nullptr, "must be created in Compile::Compile");
971 return _igvn_worklist;
972 }
973 Type_Array* types() {
974 assert(_types != nullptr, "must be created in Compile::Compile");
975 return _types;
976 }
977 NodeHash* node_hash() {
978 assert(_node_hash != nullptr, "must be created in Compile::Compile");
979 return _node_hash;
980 }
981 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List in node.hpp.
982 inline void remove_for_igvn(Node* n); // Body is after class Unique_Node_List in node.hpp.
983 void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; }
984
985 // Replace n by nn using initial_gvn, calling hash_delete and
986 // record_for_igvn as needed.
987 void gvn_replace_by(Node* n, Node* nn);
988
989
990 void identify_useful_nodes(Unique_Node_List &useful);
991 void update_dead_node_list(Unique_Node_List &useful);
992 void disconnect_useless_nodes(Unique_Node_List& useful, Unique_Node_List& worklist);
993
994 void remove_useless_node(Node* dead);
995
996 // Record this CallGenerator for inlining at the end of parsing.
997 void add_late_inline(CallGenerator* cg) {
998 _late_inlines.insert_before(_late_inlines_pos, cg);
999 _late_inlines_pos++;
1000 }
1001
1002 void prepend_late_inline(CallGenerator* cg) {
1003 _late_inlines.insert_before(0, cg);
1004 }
1005
1006 void add_string_late_inline(CallGenerator* cg) {
1007 _string_late_inlines.push(cg);
1008 }
1009
1010 void add_boxing_late_inline(CallGenerator* cg) {
1011 _boxing_late_inlines.push(cg);
1012 }
1013
1014 void add_vector_reboxing_late_inline(CallGenerator* cg) {
1015 _vector_reboxing_late_inlines.push(cg);
1016 }
1017
1018 void remove_useless_nodes (GrowableArray<Node*>& node_list, Unique_Node_List &useful);
1019
1020 void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful);
1021 void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Node* dead);
1022
1023 void remove_useless_coarsened_locks(Unique_Node_List& useful);
1024
1025 void process_print_inlining();
1026 void dump_print_inlining();
1027
1028 bool over_inlining_cutoff() const {
1029 if (!inlining_incrementally()) {
1030 return unique() > (uint)NodeCountInliningCutoff;
1031 } else {
1032 // Give some room for incremental inlining algorithm to "breathe"
1033 // and avoid thrashing when live node count is close to the limit.
1034 // Keep in mind that live_nodes() isn't accurate during inlining until
1035 // dead node elimination step happens (see Compile::inline_incrementally).
1036 return live_nodes() > (uint)LiveNodeCountInliningCutoff * 11 / 10;
1037 }
1038 }
1039
1040 void inc_number_of_mh_late_inlines() { _number_of_mh_late_inlines++; }
1041 void dec_number_of_mh_late_inlines() { assert(_number_of_mh_late_inlines > 0, "_number_of_mh_late_inlines < 0 !"); _number_of_mh_late_inlines--; }
1042 bool has_mh_late_inlines() const { return _number_of_mh_late_inlines > 0; }
1043
1044 bool inline_incrementally_one();
1045 void inline_incrementally_cleanup(PhaseIterGVN& igvn);
1046 void inline_incrementally(PhaseIterGVN& igvn);
1047 bool should_delay_inlining() { return AlwaysIncrementalInline || (StressIncrementalInlining && (random() % 2) == 0); }
1048 void inline_string_calls(bool parse_time);
1049 void inline_boxing_calls(PhaseIterGVN& igvn);
1050 bool optimize_loops(PhaseIterGVN& igvn, LoopOptsMode mode);
1051 void remove_root_to_sfpts_edges(PhaseIterGVN& igvn);
1052
1053 void inline_vector_reboxing_calls();
1054 bool has_vbox_nodes();
1055
1056 void process_late_inline_calls_no_inline(PhaseIterGVN& igvn);
1057
1058 // Matching, CFG layout, allocation, code generation
1059 PhaseCFG* cfg() { return _cfg; }
1060 bool has_java_calls() const { return _java_calls > 0; }
1061 int java_calls() const { return _java_calls; }
1062 int inner_loops() const { return _inner_loops; }
1063 Matcher* matcher() { return _matcher; }
1064 PhaseRegAlloc* regalloc() { return _regalloc; }
1065 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; }
1066 Arena* indexSet_arena() { return _indexSet_arena; }
1067 void* indexSet_free_block_list() { return _indexSet_free_block_list; }
1068 DebugInformationRecorder* debug_info() { return env()->debug_info(); }
1069
1070 void update_interpreter_frame_size(int size) {
1071 if (_interpreter_frame_size < size) {
1072 _interpreter_frame_size = size;
1073 }
1074 }
1075
1076 void set_matcher(Matcher* m) { _matcher = m; }
1077 //void set_regalloc(PhaseRegAlloc* ra) { _regalloc = ra; }
1078 void set_indexSet_arena(Arena* a) { _indexSet_arena = a; }
1079 void set_indexSet_free_block_list(void* p) { _indexSet_free_block_list = p; }
1080
1081 void set_java_calls(int z) { _java_calls = z; }
1082 void set_inner_loops(int z) { _inner_loops = z; }
1083
1084 Dependencies* dependencies() { return env()->dependencies(); }
1085
1086 // Major entry point. Given a Scope, compile the associated method.
1087 // For normal compilations, entry_bci is InvocationEntryBci. For on stack
1088 // replacement, entry_bci indicates the bytecode for which to compile a
1089 // continuation.
1090 Compile(ciEnv* ci_env, ciMethod* target,
1091 int entry_bci, Options options, DirectiveSet* directive);
1092
1093 // Second major entry point. From the TypeFunc signature, generate code
1094 // to pass arguments from the Java calling convention to the C calling
1095 // convention.
1096 Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
1097 address stub_function, const char *stub_name,
1098 int is_fancy_jump, bool pass_tls,
1099 bool return_pc, DirectiveSet* directive);
1100
1101 ~Compile() {
1102 delete _print_inlining_stream;
1103 };
1104
1105 // Are we compiling a method?
1106 bool has_method() { return method() != nullptr; }
1107
1108 // Maybe print some information about this compile.
1109 void print_compile_messages();
1110
1111 // Final graph reshaping, a post-pass after the regular optimizer is done.
1112 bool final_graph_reshaping();
1113
1114 // returns true if adr is completely contained in the given alias category
1115 bool must_alias(const TypePtr* adr, int alias_idx);
1116
1117 // returns true if adr overlaps with the given alias category
1118 bool can_alias(const TypePtr* adr, int alias_idx);
1119
1120 // Stack slots that may be unused by the calling convention but must
1121 // otherwise be preserved. On Intel this includes the return address.
1122 // On PowerPC it includes the 4 words holding the old TOC & LR glue.
1123 uint in_preserve_stack_slots() {
1124 return SharedRuntime::in_preserve_stack_slots();
1125 }
1126
1127 // "Top of Stack" slots that may be unused by the calling convention but must
1128 // otherwise be preserved.
1129 // On Intel these are not necessary and the value can be zero.
1130 static uint out_preserve_stack_slots() {
1131 return SharedRuntime::out_preserve_stack_slots();
1132 }
1133
1134 // Number of outgoing stack slots killed above the out_preserve_stack_slots
1135 // for calls to C. Supports the var-args backing area for register parms.
1136 uint varargs_C_out_slots_killed() const;
1137
1138 // Number of Stack Slots consumed by a synchronization entry
1139 int sync_stack_slots() const;
1140
1141 // Compute the name of old_SP. See <arch>.ad for frame layout.
1142 OptoReg::Name compute_old_SP();
1143
1144 private:
1145 // Phase control:
1146 void Init(bool aliasing); // Prepare for a single compilation
1147 void Optimize(); // Given a graph, optimize it
1148 void Code_Gen(); // Generate code from a graph
1149
1150 // Management of the AliasType table.
1151 void grow_alias_types();
1152 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1153 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1154 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field);
1155
1156 void verify_top(Node*) const PRODUCT_RETURN;
1157
1158 // Intrinsic setup.
1159 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
1160 int intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found); // helper
1161 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
1162 void register_intrinsic(CallGenerator* cg); // update fn
1163
1164 #ifndef PRODUCT
1165 static juint _intrinsic_hist_count[];
1166 static jubyte _intrinsic_hist_flags[];
1167 #endif
1168 // Function calls made by the public function final_graph_reshaping.
1169 // No need to be made public as they are not called elsewhere.
1170 void final_graph_reshaping_impl(Node *n, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1171 void final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop, Unique_Node_List& dead_nodes);
1172 void final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_Reshape_Counts& frc, Unique_Node_List& dead_nodes);
1173 void eliminate_redundant_card_marks(Node* n);
1174
1175 // Logic cone optimization.
1176 void optimize_logic_cones(PhaseIterGVN &igvn);
1177 void collect_logic_cone_roots(Unique_Node_List& list);
1178 void process_logic_cone_root(PhaseIterGVN &igvn, Node* n, VectorSet& visited);
1179 bool compute_logic_cone(Node* n, Unique_Node_List& partition, Unique_Node_List& inputs);
1180 uint compute_truth_table(Unique_Node_List& partition, Unique_Node_List& inputs);
1181 uint eval_macro_logic_op(uint func, uint op1, uint op2, uint op3);
1182 Node* xform_to_MacroLogicV(PhaseIterGVN &igvn, const TypeVect* vt, Unique_Node_List& partitions, Unique_Node_List& inputs);
1183 void check_no_dead_use() const NOT_DEBUG_RETURN;
1184
1185 public:
1186
1187 // Note: Histogram array size is about 1 Kb.
1188 enum { // flag bits:
1189 _intrinsic_worked = 1, // succeeded at least once
1190 _intrinsic_failed = 2, // tried it but it failed
1191 _intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
1192 _intrinsic_virtual = 8, // was seen in the virtual form (rare)
1193 _intrinsic_both = 16 // was seen in the non-virtual form (usual)
1194 };
1195 // Update histogram. Return boolean if this is a first-time occurrence.
1196 static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
1197 bool is_virtual, int flags) PRODUCT_RETURN0;
1198 static void print_intrinsic_statistics() PRODUCT_RETURN;
1199
1200 // Graph verification code
1201 // Walk the node list, verifying that there is a one-to-one
1202 // correspondence between Use-Def edges and Def-Use edges
1203 // The option no_dead_code enables stronger checks that the
1204 // graph is strongly connected from root in both directions.
1205 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN;
1206
1207 // Verify bi-directional correspondence of edges
1208 void verify_bidirectional_edges(Unique_Node_List &visited);
1209
1210 // End-of-run dumps.
1211 static void print_statistics() PRODUCT_RETURN;
1212
1213 // Verify ADLC assumptions during startup
1214 static void adlc_verification() PRODUCT_RETURN;
1215
1216 // Definitions of pd methods
1217 static void pd_compiler2_init();
1218
1219 // Static parse-time type checking logic for gen_subtype_check:
1220 enum SubTypeCheckResult { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test };
1221 SubTypeCheckResult static_subtype_check(const TypeKlassPtr* superk, const TypeKlassPtr* subk, bool skip = StressReflectiveCode);
1222
1223 static Node* conv_I2X_index(PhaseGVN* phase, Node* offset, const TypeInt* sizetype,
1224 // Optional control dependency (for example, on range check)
1225 Node* ctrl = nullptr);
1226
1227 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check)
1228 static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl, bool carry_dependency = false);
1229
1230 // Auxiliary methods for randomized fuzzing/stressing
1231 int random();
1232 bool randomized_select(int count);
1233
1234 // supporting clone_map
1235 CloneMap& clone_map();
1236 void set_clone_map(Dict* d);
1237
1238 bool needs_clinit_barrier(ciField* ik, ciMethod* accessing_method);
1239 bool needs_clinit_barrier(ciMethod* ik, ciMethod* accessing_method);
1240 bool needs_clinit_barrier(ciInstanceKlass* ik, ciMethod* accessing_method);
1241
1242 #ifdef IA32
1243 private:
1244 bool _select_24_bit_instr; // We selected an instruction with a 24-bit result
1245 bool _in_24_bit_fp_mode; // We are emitting instructions with 24-bit results
1246
1247 // Remember if this compilation changes hardware mode to 24-bit precision.
1248 void set_24_bit_selection_and_mode(bool selection, bool mode) {
1249 _select_24_bit_instr = selection;
1250 _in_24_bit_fp_mode = mode;
1251 }
1252
1253 public:
1254 bool select_24_bit_instr() const { return _select_24_bit_instr; }
1255 bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; }
1256 #endif // IA32
1257 #ifdef ASSERT
1258 VerifyMeetResult* _type_verify;
1259 void set_exception_backedge() { _exception_backedge = true; }
1260 bool has_exception_backedge() const { return _exception_backedge; }
1261 #endif
1262
1263 static bool push_thru_add(PhaseGVN* phase, Node* z, const TypeInteger* tz, const TypeInteger*& rx, const TypeInteger*& ry,
1264 BasicType out_bt, BasicType in_bt);
1265
1266 static Node* narrow_value(BasicType bt, Node* value, const Type* type, PhaseGVN* phase, bool transform_res);
1267 };
1268
1269 #endif // SHARE_OPTO_COMPILE_HPP