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