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