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