1 /* 2 * Copyright (c) 1997, 2018, 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_VM_OPTO_COMPILE_HPP 26 #define SHARE_VM_OPTO_COMPILE_HPP 27 28 #include "asm/codeBuffer.hpp" 29 #include "ci/compilerInterface.hpp" 30 #include "code/debugInfoRec.hpp" 31 #include "code/exceptionHandlerTable.hpp" 32 #include "compiler/compilerOracle.hpp" 33 #include "compiler/compileBroker.hpp" 34 #include "libadt/dict.hpp" 35 #include "libadt/vectset.hpp" 36 #include "jfr/jfrEvents.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/timerTrace.hpp" 45 #include "runtime/vmThread.hpp" 46 #include "utilities/ticks.hpp" 47 48 class AddPNode; 49 class Block; 50 class Bundle; 51 class C2Compiler; 52 class CallGenerator; 53 class CloneMap; 54 class ConnectionGraph; 55 class InlineTree; 56 class Int_Array; 57 class LoadBarrierNode; 58 class Matcher; 59 class MachConstantNode; 60 class MachConstantBaseNode; 61 class MachNode; 62 class MachOper; 63 class MachSafePointNode; 64 class Node; 65 class Node_Array; 66 class Node_Notes; 67 class NodeCloneInfo; 68 class OptoReg; 69 class PhaseCFG; 70 class PhaseGVN; 71 class PhaseIterGVN; 72 class PhaseRegAlloc; 73 class PhaseCCP; 74 class PhaseCCP_DCE; 75 class RootNode; 76 class relocInfo; 77 class Scope; 78 class StartNode; 79 class SafePointNode; 80 class JVMState; 81 class Type; 82 class TypeData; 83 class TypeInt; 84 class TypePtr; 85 class TypeOopPtr; 86 class TypeFunc; 87 class Unique_Node_List; 88 class nmethod; 89 class WarmCallInfo; 90 class Node_Stack; 91 struct Final_Reshape_Counts; 92 93 enum LoopOptsMode { 94 LoopOptsDefault, 95 LoopOptsNone, 96 LoopOptsShenandoahExpand, 97 LoopOptsShenandoahPostExpand, 98 LoopOptsSkipSplitIf, 99 LoopOptsVerify, 100 LoopOptsLastRound 101 }; 102 103 typedef unsigned int node_idx_t; 104 class NodeCloneInfo { 105 private: 106 uint64_t _idx_clone_orig; 107 public: 108 set_idx(node_idx_t idx)109 void set_idx(node_idx_t idx) { 110 _idx_clone_orig = (_idx_clone_orig & CONST64(0xFFFFFFFF00000000)) | idx; 111 } idx() const112 node_idx_t idx() const { return (node_idx_t)(_idx_clone_orig & 0xFFFFFFFF); } 113 set_gen(int generation)114 void set_gen(int generation) { 115 uint64_t g = (uint64_t)generation << 32; 116 _idx_clone_orig = (_idx_clone_orig & 0xFFFFFFFF) | g; 117 } gen() const118 int gen() const { return (int)(_idx_clone_orig >> 32); } 119 set(uint64_t x)120 void set(uint64_t x) { _idx_clone_orig = x; } set(node_idx_t x,int g)121 void set(node_idx_t x, int g) { set_idx(x); set_gen(g); } get() const122 uint64_t get() const { return _idx_clone_orig; } 123 NodeCloneInfo(uint64_t idx_clone_orig)124 NodeCloneInfo(uint64_t idx_clone_orig) : _idx_clone_orig(idx_clone_orig) {} NodeCloneInfo(node_idx_t x,int g)125 NodeCloneInfo(node_idx_t x, int g) : _idx_clone_orig(0) { set(x, g); } 126 127 void dump() const; 128 }; 129 130 class CloneMap { 131 friend class Compile; 132 private: 133 bool _debug; 134 Dict* _dict; 135 int _clone_idx; // current cloning iteration/generation in loop unroll 136 public: _2p(node_idx_t key) const137 void* _2p(node_idx_t key) const { return (void*)(intptr_t)key; } // 2 conversion functions to make gcc happy _2_node_idx_t(const void * k) const138 node_idx_t _2_node_idx_t(const void* k) const { return (node_idx_t)(intptr_t)k; } dict() const139 Dict* dict() const { return _dict; } insert(node_idx_t key,uint64_t val)140 void insert(node_idx_t key, uint64_t val) { assert(_dict->operator[](_2p(key)) == NULL, "key existed"); _dict->Insert(_2p(key), (void*)val); } insert(node_idx_t key,NodeCloneInfo & ci)141 void insert(node_idx_t key, NodeCloneInfo& ci) { insert(key, ci.get()); } remove(node_idx_t key)142 void remove(node_idx_t key) { _dict->Delete(_2p(key)); } value(node_idx_t key) const143 uint64_t value(node_idx_t key) const { return (uint64_t)_dict->operator[](_2p(key)); } idx(node_idx_t key) const144 node_idx_t idx(node_idx_t key) const { return NodeCloneInfo(value(key)).idx(); } gen(node_idx_t key) const145 int gen(node_idx_t key) const { return NodeCloneInfo(value(key)).gen(); } gen(const void * k) const146 int gen(const void* k) const { return gen(_2_node_idx_t(k)); } 147 int max_gen() const; 148 void clone(Node* old, Node* nnn, int gen); 149 void verify_insert_and_clone(Node* old, Node* nnn, int gen); 150 void dump(node_idx_t key) const; 151 clone_idx() const152 int clone_idx() const { return _clone_idx; } set_clone_idx(int x)153 void set_clone_idx(int x) { _clone_idx = x; } is_debug() const154 bool is_debug() const { return _debug; } set_debug(bool debug)155 void set_debug(bool debug) { _debug = debug; } 156 static const char* debug_option_name; 157 same_idx(node_idx_t k1,node_idx_t k2) const158 bool same_idx(node_idx_t k1, node_idx_t k2) const { return idx(k1) == idx(k2); } same_gen(node_idx_t k1,node_idx_t k2) const159 bool same_gen(node_idx_t k1, node_idx_t k2) const { return gen(k1) == gen(k2); } 160 }; 161 162 //------------------------------Compile---------------------------------------- 163 // This class defines a top-level Compiler invocation. 164 165 class Compile : public Phase { 166 friend class VMStructs; 167 168 public: 169 // Fixed alias indexes. (See also MergeMemNode.) 170 enum { 171 AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value) 172 AliasIdxBot = 2, // pseudo-index, aliases to everything 173 AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM 174 }; 175 176 // Variant of TraceTime(NULL, &_t_accumulator, CITime); 177 // Integrated with logging. If logging is turned on, and CITimeVerbose is true, 178 // then brackets are put into the log, with time stamps and node counts. 179 // (The time collection itself is always conditionalized on CITime.) 180 class TracePhase : public TraceTime { 181 private: 182 Compile* C; 183 CompileLog* _log; 184 const char* _phase_name; 185 bool _dolog; 186 public: 187 TracePhase(const char* name, elapsedTimer* accumulator); 188 ~TracePhase(); 189 }; 190 191 // Information per category of alias (memory slice) 192 class AliasType { 193 private: 194 friend class Compile; 195 196 int _index; // unique index, used with MergeMemNode 197 const TypePtr* _adr_type; // normalized address type 198 ciField* _field; // relevant instance field, or null if none 199 const Type* _element; // relevant array element type, or null if none 200 bool _is_rewritable; // false if the memory is write-once only 201 int _general_index; // if this is type is an instance, the general 202 // type that this is an instance of 203 204 void Init(int i, const TypePtr* at); 205 206 public: index() const207 int index() const { return _index; } adr_type() const208 const TypePtr* adr_type() const { return _adr_type; } field() const209 ciField* field() const { return _field; } element() const210 const Type* element() const { return _element; } is_rewritable() const211 bool is_rewritable() const { return _is_rewritable; } is_volatile() const212 bool is_volatile() const { return (_field ? _field->is_volatile() : false); } general_index() const213 int general_index() const { return (_general_index != 0) ? _general_index : _index; } 214 set_rewritable(bool z)215 void set_rewritable(bool z) { _is_rewritable = z; } set_field(ciField * f)216 void set_field(ciField* f) { 217 assert(!_field,""); 218 _field = f; 219 if (f->is_final() || f->is_stable()) { 220 // In the case of @Stable, multiple writes are possible but may be assumed to be no-ops. 221 _is_rewritable = false; 222 } 223 } set_element(const Type * e)224 void set_element(const Type* e) { 225 assert(_element == NULL, ""); 226 _element = e; 227 } 228 229 BasicType basic_type() const; 230 231 void print_on(outputStream* st) PRODUCT_RETURN; 232 }; 233 234 enum { 235 logAliasCacheSize = 6, 236 AliasCacheSize = (1<<logAliasCacheSize) 237 }; 238 struct AliasCacheEntry { const TypePtr* _adr_type; int _index; }; // simple duple type 239 enum { 240 trapHistLength = MethodData::_trap_hist_limit 241 }; 242 243 // Constant entry of the constant table. 244 class Constant { 245 private: 246 BasicType _type; 247 union { 248 jvalue _value; 249 Metadata* _metadata; 250 } _v; 251 int _offset; // offset of this constant (in bytes) relative to the constant table base. 252 float _freq; 253 bool _can_be_reused; // true (default) if the value can be shared with other users. 254 255 public: Constant()256 Constant() : _type(T_ILLEGAL), _offset(-1), _freq(0.0f), _can_be_reused(true) { _v._value.l = 0; } Constant(BasicType type,jvalue value,float freq=0.0f,bool can_be_reused=true)257 Constant(BasicType type, jvalue value, float freq = 0.0f, bool can_be_reused = true) : 258 _type(type), 259 _offset(-1), 260 _freq(freq), 261 _can_be_reused(can_be_reused) 262 { 263 assert(type != T_METADATA, "wrong constructor"); 264 _v._value = value; 265 } Constant(Metadata * metadata,bool can_be_reused=true)266 Constant(Metadata* metadata, bool can_be_reused = true) : 267 _type(T_METADATA), 268 _offset(-1), 269 _freq(0.0f), 270 _can_be_reused(can_be_reused) 271 { 272 _v._metadata = metadata; 273 } 274 275 bool operator==(const Constant& other); 276 type() const277 BasicType type() const { return _type; } 278 get_jint() const279 jint get_jint() const { return _v._value.i; } get_jlong() const280 jlong get_jlong() const { return _v._value.j; } get_jfloat() const281 jfloat get_jfloat() const { return _v._value.f; } get_jdouble() const282 jdouble get_jdouble() const { return _v._value.d; } get_jobject() const283 jobject get_jobject() const { return _v._value.l; } 284 get_metadata() const285 Metadata* get_metadata() const { return _v._metadata; } 286 offset() const287 int offset() const { return _offset; } set_offset(int offset)288 void set_offset(int offset) { _offset = offset; } 289 freq() const290 float freq() const { return _freq; } inc_freq(float freq)291 void inc_freq(float freq) { _freq += freq; } 292 can_be_reused() const293 bool can_be_reused() const { return _can_be_reused; } 294 }; 295 296 // Constant table. 297 class ConstantTable { 298 private: 299 GrowableArray<Constant> _constants; // Constants of this table. 300 int _size; // Size in bytes the emitted constant table takes (including padding). 301 int _table_base_offset; // Offset of the table base that gets added to the constant offsets. 302 int _nof_jump_tables; // Number of jump-tables in this constant table. 303 304 static int qsort_comparator(Constant* a, Constant* b); 305 306 // We use negative frequencies to keep the order of the 307 // jump-tables in which they were added. Otherwise we get into 308 // trouble with relocation. next_jump_table_freq()309 float next_jump_table_freq() { return -1.0f * (++_nof_jump_tables); } 310 311 public: ConstantTable()312 ConstantTable() : 313 _size(-1), 314 _table_base_offset(-1), // We can use -1 here since the constant table is always bigger than 2 bytes (-(size / 2), see MachConstantBaseNode::emit). 315 _nof_jump_tables(0) 316 {} 317 size() const318 int size() const { assert(_size != -1, "not calculated yet"); return _size; } 319 320 int calculate_table_base_offset() const; // AD specific set_table_base_offset(int x)321 void set_table_base_offset(int x) { assert(_table_base_offset == -1 || x == _table_base_offset, "can't change"); _table_base_offset = x; } table_base_offset() const322 int table_base_offset() const { assert(_table_base_offset != -1, "not set yet"); return _table_base_offset; } 323 324 void emit(CodeBuffer& cb); 325 326 // Returns the offset of the last entry (the top) of the constant table. top_offset() const327 int top_offset() const { assert(_constants.top().offset() != -1, "not bound yet"); return _constants.top().offset(); } 328 329 void calculate_offsets_and_size(); 330 int find_offset(Constant& con) const; 331 332 void add(Constant& con); 333 Constant add(MachConstantNode* n, BasicType type, jvalue value); 334 Constant add(Metadata* metadata); 335 Constant add(MachConstantNode* n, MachOper* oper); add(MachConstantNode * n,jint i)336 Constant add(MachConstantNode* n, jint i) { 337 jvalue value; value.i = i; 338 return add(n, T_INT, value); 339 } add(MachConstantNode * n,jlong j)340 Constant add(MachConstantNode* n, jlong j) { 341 jvalue value; value.j = j; 342 return add(n, T_LONG, value); 343 } add(MachConstantNode * n,jfloat f)344 Constant add(MachConstantNode* n, jfloat f) { 345 jvalue value; value.f = f; 346 return add(n, T_FLOAT, value); 347 } add(MachConstantNode * n,jdouble d)348 Constant add(MachConstantNode* n, jdouble d) { 349 jvalue value; value.d = d; 350 return add(n, T_DOUBLE, value); 351 } 352 353 // Jump-table 354 Constant add_jump_table(MachConstantNode* n); 355 void fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const; 356 }; 357 358 private: 359 // Fixed parameters to this compilation. 360 const int _compile_id; 361 const bool _save_argument_registers; // save/restore arg regs for trampolines 362 const bool _subsume_loads; // Load can be matched as part of a larger op. 363 const bool _do_escape_analysis; // Do escape analysis. 364 const bool _eliminate_boxing; // Do boxing elimination. 365 ciMethod* _method; // The method being compiled. 366 int _entry_bci; // entry bci for osr methods. 367 const TypeFunc* _tf; // My kind of signature 368 InlineTree* _ilt; // Ditto (temporary). 369 address _stub_function; // VM entry for stub being compiled, or NULL 370 const char* _stub_name; // Name of stub or adapter being compiled, or NULL 371 address _stub_entry_point; // Compile code entry for generated stub, or NULL 372 373 // Control of this compilation. 374 int _max_inline_size; // Max inline size for this compilation 375 int _freq_inline_size; // Max hot method inline size for this compilation 376 int _fixed_slots; // count of frame slots not allocated by the register 377 // allocator i.e. locks, original deopt pc, etc. 378 uintx _max_node_limit; // Max unique node count during a single compilation. 379 // For deopt 380 int _orig_pc_slot; 381 int _orig_pc_slot_offset_in_bytes; 382 383 int _major_progress; // Count of something big happening 384 bool _inlining_progress; // progress doing incremental inlining? 385 bool _inlining_incrementally;// Are we doing incremental inlining (post parse) 386 bool _has_loops; // True if the method _may_ have some loops 387 bool _has_split_ifs; // True if the method _may_ have some split-if 388 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores. 389 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated 390 bool _has_boxed_value; // True if a boxed object is allocated 391 bool _has_reserved_stack_access; // True if the method or an inlined method is annotated with ReservedStackAccess 392 uint _max_vector_size; // Maximum size of generated vectors 393 bool _clear_upper_avx; // Clear upper bits of ymm registers using vzeroupper 394 uint _trap_hist[trapHistLength]; // Cumulative traps 395 bool _trap_can_recompile; // Have we emitted a recompiling trap? 396 uint _decompile_count; // Cumulative decompilation counts. 397 bool _do_inlining; // True if we intend to do inlining 398 bool _do_scheduling; // True if we intend to do scheduling 399 bool _do_freq_based_layout; // True if we intend to do frequency based block layout 400 bool _do_count_invocations; // True if we generate code to count invocations 401 bool _do_method_data_update; // True if we generate code to update MethodData*s 402 bool _do_vector_loop; // True if allowed to execute loop in parallel iterations 403 bool _use_cmove; // True if CMove should be used without profitability analysis 404 bool _age_code; // True if we need to profile code age (decrement the aging counter) 405 int _AliasLevel; // Locally-adjusted version of AliasLevel flag. 406 bool _print_assembly; // True if we should dump assembly code for this compilation 407 bool _print_inlining; // True if we should print inlining for this compilation 408 bool _print_intrinsics; // True if we should print intrinsics for this compilation 409 #ifndef PRODUCT 410 bool _trace_opto_output; 411 bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing 412 #endif 413 bool _has_irreducible_loop; // Found irreducible loops 414 // JSR 292 415 bool _has_method_handle_invokes; // True if this method has MethodHandle invokes. 416 RTMState _rtm_state; // State of Restricted Transactional Memory usage 417 int _loop_opts_cnt; // loop opts round 418 419 // Compilation environment. 420 Arena _comp_arena; // Arena with lifetime equivalent to Compile 421 void* _barrier_set_state; // Potential GC barrier state for Compile 422 ciEnv* _env; // CI interface 423 DirectiveSet* _directive; // Compiler directive 424 CompileLog* _log; // from CompilerThread 425 const char* _failure_reason; // for record_failure/failing pattern 426 GrowableArray<CallGenerator*>* _intrinsics; // List of intrinsics. 427 GrowableArray<Node*>* _macro_nodes; // List of nodes which need to be expanded before matching. 428 GrowableArray<Node*>* _predicate_opaqs; // List of Opaque1 nodes for the loop predicates. 429 GrowableArray<Node*>* _expensive_nodes; // List of nodes that are expensive to compute and that we'd better not let the GVN freely common 430 GrowableArray<Node*>* _range_check_casts; // List of CastII nodes with a range check dependency 431 GrowableArray<Node*>* _opaque4_nodes; // List of Opaque4 nodes that have a default value 432 ConnectionGraph* _congraph; 433 #ifndef PRODUCT 434 IdealGraphPrinter* _printer; 435 #endif 436 437 438 // Node management 439 uint _unique; // Counter for unique Node indices 440 VectorSet _dead_node_list; // Set of dead nodes 441 uint _dead_node_count; // Number of dead nodes; VectorSet::Size() is O(N). 442 // So use this to keep count and make the call O(1). 443 DEBUG_ONLY( Unique_Node_List* _modified_nodes; ) // List of nodes which inputs were modified 444 445 debug_only(static int _debug_idx;) // Monotonic counter (not reset), use -XX:BreakAtNode=<idx> 446 Arena _node_arena; // Arena for new-space Nodes 447 Arena _old_arena; // Arena for old-space Nodes, lifetime during xform 448 RootNode* _root; // Unique root of compilation, or NULL after bail-out. 449 Node* _top; // Unique top node. (Reset by various phases.) 450 451 Node* _immutable_memory; // Initial memory state 452 453 Node* _recent_alloc_obj; 454 Node* _recent_alloc_ctl; 455 456 // Constant table 457 ConstantTable _constant_table; // The constant table for this compile. 458 MachConstantBaseNode* _mach_constant_base_node; // Constant table base node singleton. 459 460 461 // Blocked array of debugging and profiling information, 462 // tracked per node. 463 enum { _log2_node_notes_block_size = 8, 464 _node_notes_block_size = (1<<_log2_node_notes_block_size) 465 }; 466 GrowableArray<Node_Notes*>* _node_note_array; 467 Node_Notes* _default_node_notes; // default notes for new nodes 468 469 // After parsing and every bulk phase we hang onto the Root instruction. 470 // The RootNode instruction is where the whole program begins. It produces 471 // the initial Control and BOTTOM for everybody else. 472 473 // Type management 474 Arena _Compile_types; // Arena for all types 475 Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared() 476 Dict* _type_dict; // Intern table 477 CloneMap _clone_map; // used for recording history of cloned nodes 478 void* _type_hwm; // Last allocation (see Type::operator new/delete) 479 size_t _type_last_size; // Last allocation size (see Type::operator new/delete) 480 ciMethod* _last_tf_m; // Cache for 481 const TypeFunc* _last_tf; // TypeFunc::make 482 AliasType** _alias_types; // List of alias types seen so far. 483 int _num_alias_types; // Logical length of _alias_types 484 int _max_alias_types; // Physical length of _alias_types 485 AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking 486 487 // Parsing, optimization 488 PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN 489 Unique_Node_List* _for_igvn; // Initial work-list for next round of Iterative GVN 490 WarmCallInfo* _warm_calls; // Sorted work-list for heat-based inlining. 491 492 GrowableArray<CallGenerator*> _late_inlines; // List of CallGenerators to be revisited after 493 // main parsing has finished. 494 GrowableArray<CallGenerator*> _string_late_inlines; // same but for string operations 495 496 GrowableArray<CallGenerator*> _boxing_late_inlines; // same but for boxing operations 497 498 int _late_inlines_pos; // Where in the queue should the next late inlining candidate go (emulate depth first inlining) 499 uint _number_of_mh_late_inlines; // number of method handle late inlining still pending 500 501 502 // Inlining may not happen in parse order which would make 503 // PrintInlining output confusing. Keep track of PrintInlining 504 // pieces in order. 505 class PrintInliningBuffer : public ResourceObj { 506 private: 507 CallGenerator* _cg; 508 stringStream* _ss; 509 510 public: PrintInliningBuffer()511 PrintInliningBuffer() 512 : _cg(NULL) { _ss = new stringStream(); } 513 ss() const514 stringStream* ss() const { return _ss; } cg() const515 CallGenerator* cg() const { return _cg; } set_cg(CallGenerator * cg)516 void set_cg(CallGenerator* cg) { _cg = cg; } 517 }; 518 519 stringStream* _print_inlining_stream; 520 GrowableArray<PrintInliningBuffer>* _print_inlining_list; 521 int _print_inlining_idx; 522 char* _print_inlining_output; 523 524 // Only keep nodes in the expensive node list that need to be optimized 525 void cleanup_expensive_nodes(PhaseIterGVN &igvn); 526 // Use for sorting expensive nodes to bring similar nodes together 527 static int cmp_expensive_nodes(Node** n1, Node** n2); 528 // Expensive nodes list already sorted? 529 bool expensive_nodes_sorted() const; 530 // Remove the speculative part of types and clean up the graph 531 void remove_speculative_types(PhaseIterGVN &igvn); 532 533 void* _replay_inline_data; // Pointer to data loaded from file 534 535 void print_inlining_init(); 536 void print_inlining_reinit(); 537 void print_inlining_commit(); 538 void print_inlining_push(); 539 PrintInliningBuffer& print_inlining_current(); 540 541 void log_late_inline_failure(CallGenerator* cg, const char* msg); 542 543 public: 544 barrier_set_state() const545 void* barrier_set_state() const { return _barrier_set_state; } 546 print_inlining_stream() const547 outputStream* print_inlining_stream() const { 548 assert(print_inlining() || print_intrinsics(), "PrintInlining off?"); 549 return _print_inlining_stream; 550 } 551 552 void print_inlining_update(CallGenerator* cg); 553 void print_inlining_update_delayed(CallGenerator* cg); 554 void print_inlining_move_to(CallGenerator* cg); 555 void print_inlining_assert_ready(); 556 void print_inlining_reset(); 557 print_inlining(ciMethod * method,int inline_level,int bci,const char * msg=NULL)558 void print_inlining(ciMethod* method, int inline_level, int bci, const char* msg = NULL) { 559 stringStream ss; 560 CompileTask::print_inlining_inner(&ss, method, inline_level, bci, msg); 561 print_inlining_stream()->print("%s", ss.as_string()); 562 } 563 564 #ifndef PRODUCT printer()565 IdealGraphPrinter* printer() { return _printer; } 566 #endif 567 568 void log_late_inline(CallGenerator* cg); 569 void log_inline_id(CallGenerator* cg); 570 void log_inline_failure(const char* msg); 571 replay_inline_data() const572 void* replay_inline_data() const { return _replay_inline_data; } 573 574 // Dump inlining replay data to the stream. 575 void dump_inline_data(outputStream* out); 576 577 private: 578 // Matching, CFG layout, allocation, code generation 579 PhaseCFG* _cfg; // Results of CFG finding 580 bool _select_24_bit_instr; // We selected an instruction with a 24-bit result 581 bool _in_24_bit_fp_mode; // We are emitting instructions with 24-bit results 582 int _java_calls; // Number of java calls in the method 583 int _inner_loops; // Number of inner loops in the method 584 Matcher* _matcher; // Engine to map ideal to machine instructions 585 PhaseRegAlloc* _regalloc; // Results of register allocation. 586 int _frame_slots; // Size of total frame in stack slots 587 CodeOffsets _code_offsets; // Offsets into the code for various interesting entries 588 RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout) 589 Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin 590 void* _indexSet_free_block_list; // free list of IndexSet bit blocks 591 int _interpreter_frame_size; 592 593 uint _node_bundling_limit; 594 Bundle* _node_bundling_base; // Information for instruction bundling 595 596 // Instruction bits passed off to the VM 597 int _method_size; // Size of nmethod code segment in bytes 598 CodeBuffer _code_buffer; // Where the code is assembled 599 int _first_block_size; // Size of unvalidated entry point code / OSR poison code 600 ExceptionHandlerTable _handler_table; // Table of native-code exception handlers 601 ImplicitExceptionTable _inc_table; // Table of implicit null checks in native code 602 OopMapSet* _oop_map_set; // Table of oop maps (one for each safepoint location) 603 static int _CompiledZap_count; // counter compared against CompileZap[First/Last] 604 BufferBlob* _scratch_buffer_blob; // For temporary code buffers. 605 relocInfo* _scratch_locs_memory; // For temporary code buffers. 606 int _scratch_const_size; // For temporary code buffers. 607 bool _in_scratch_emit_size; // true when in scratch_emit_size. 608 609 void reshape_address(AddPNode* n); 610 611 public: 612 // Accessors 613 614 // The Compile instance currently active in this (compiler) thread. current()615 static Compile* current() { 616 return (Compile*) ciEnv::current()->compiler_data(); 617 } 618 619 // ID for this compilation. Useful for setting breakpoints in the debugger. compile_id() const620 int compile_id() const { return _compile_id; } directive() const621 DirectiveSet* directive() const { return _directive; } 622 623 // Does this compilation allow instructions to subsume loads? User 624 // instructions that subsume a load may result in an unschedulable 625 // instruction sequence. subsume_loads() const626 bool subsume_loads() const { return _subsume_loads; } 627 /** Do escape analysis. */ do_escape_analysis() const628 bool do_escape_analysis() const { return _do_escape_analysis; } 629 /** Do boxing elimination. */ eliminate_boxing() const630 bool eliminate_boxing() const { return _eliminate_boxing; } 631 /** Do aggressive boxing elimination. */ aggressive_unboxing() const632 bool aggressive_unboxing() const { return _eliminate_boxing && AggressiveUnboxing; } save_argument_registers() const633 bool save_argument_registers() const { return _save_argument_registers; } 634 635 636 // Other fixed compilation parameters. method() const637 ciMethod* method() const { return _method; } entry_bci() const638 int entry_bci() const { return _entry_bci; } is_osr_compilation() const639 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; } is_method_compilation() const640 bool is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); } tf() const641 const TypeFunc* tf() const { assert(_tf!=NULL, ""); return _tf; } init_tf(const TypeFunc * tf)642 void init_tf(const TypeFunc* tf) { assert(_tf==NULL, ""); _tf = tf; } ilt() const643 InlineTree* ilt() const { return _ilt; } stub_function() const644 address stub_function() const { return _stub_function; } stub_name() const645 const char* stub_name() const { return _stub_name; } stub_entry_point() const646 address stub_entry_point() const { return _stub_entry_point; } 647 648 // Control of this compilation. fixed_slots() const649 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; } set_fixed_slots(int n)650 void set_fixed_slots(int n) { _fixed_slots = n; } major_progress() const651 int major_progress() const { return _major_progress; } set_inlining_progress(bool z)652 void set_inlining_progress(bool z) { _inlining_progress = z; } inlining_progress() const653 int inlining_progress() const { return _inlining_progress; } set_inlining_incrementally(bool z)654 void set_inlining_incrementally(bool z) { _inlining_incrementally = z; } inlining_incrementally() const655 int inlining_incrementally() const { return _inlining_incrementally; } set_major_progress()656 void set_major_progress() { _major_progress++; } clear_major_progress()657 void clear_major_progress() { _major_progress = 0; } max_inline_size() const658 int max_inline_size() const { return _max_inline_size; } set_freq_inline_size(int n)659 void set_freq_inline_size(int n) { _freq_inline_size = n; } freq_inline_size() const660 int freq_inline_size() const { return _freq_inline_size; } set_max_inline_size(int n)661 void set_max_inline_size(int n) { _max_inline_size = n; } has_loops() const662 bool has_loops() const { return _has_loops; } set_has_loops(bool z)663 void set_has_loops(bool z) { _has_loops = z; } has_split_ifs() const664 bool has_split_ifs() const { return _has_split_ifs; } set_has_split_ifs(bool z)665 void set_has_split_ifs(bool z) { _has_split_ifs = z; } has_unsafe_access() const666 bool has_unsafe_access() const { return _has_unsafe_access; } set_has_unsafe_access(bool z)667 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; } has_stringbuilder() const668 bool has_stringbuilder() const { return _has_stringbuilder; } set_has_stringbuilder(bool z)669 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; } has_boxed_value() const670 bool has_boxed_value() const { return _has_boxed_value; } set_has_boxed_value(bool z)671 void set_has_boxed_value(bool z) { _has_boxed_value = z; } has_reserved_stack_access() const672 bool has_reserved_stack_access() const { return _has_reserved_stack_access; } set_has_reserved_stack_access(bool z)673 void set_has_reserved_stack_access(bool z) { _has_reserved_stack_access = z; } max_vector_size() const674 uint max_vector_size() const { return _max_vector_size; } set_max_vector_size(uint s)675 void set_max_vector_size(uint s) { _max_vector_size = s; } clear_upper_avx() const676 bool clear_upper_avx() const { return _clear_upper_avx; } set_clear_upper_avx(bool s)677 void set_clear_upper_avx(bool s) { _clear_upper_avx = s; } set_trap_count(uint r,uint c)678 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; } trap_count(uint r) const679 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; } trap_can_recompile() const680 bool trap_can_recompile() const { return _trap_can_recompile; } set_trap_can_recompile(bool z)681 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; } decompile_count() const682 uint decompile_count() const { return _decompile_count; } set_decompile_count(uint c)683 void set_decompile_count(uint c) { _decompile_count = c; } 684 bool allow_range_check_smearing() const; do_inlining() const685 bool do_inlining() const { return _do_inlining; } set_do_inlining(bool z)686 void set_do_inlining(bool z) { _do_inlining = z; } do_scheduling() const687 bool do_scheduling() const { return _do_scheduling; } set_do_scheduling(bool z)688 void set_do_scheduling(bool z) { _do_scheduling = z; } do_freq_based_layout() const689 bool do_freq_based_layout() const{ return _do_freq_based_layout; } set_do_freq_based_layout(bool z)690 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; } do_count_invocations() const691 bool do_count_invocations() const{ return _do_count_invocations; } set_do_count_invocations(bool z)692 void set_do_count_invocations(bool z){ _do_count_invocations = z; } do_method_data_update() const693 bool do_method_data_update() const { return _do_method_data_update; } set_do_method_data_update(bool z)694 void set_do_method_data_update(bool z) { _do_method_data_update = z; } do_vector_loop() const695 bool do_vector_loop() const { return _do_vector_loop; } set_do_vector_loop(bool z)696 void set_do_vector_loop(bool z) { _do_vector_loop = z; } use_cmove() const697 bool use_cmove() const { return _use_cmove; } set_use_cmove(bool z)698 void set_use_cmove(bool z) { _use_cmove = z; } age_code() const699 bool age_code() const { return _age_code; } set_age_code(bool z)700 void set_age_code(bool z) { _age_code = z; } AliasLevel() const701 int AliasLevel() const { return _AliasLevel; } print_assembly() const702 bool print_assembly() const { return _print_assembly; } set_print_assembly(bool z)703 void set_print_assembly(bool z) { _print_assembly = z; } print_inlining() const704 bool print_inlining() const { return _print_inlining; } set_print_inlining(bool z)705 void set_print_inlining(bool z) { _print_inlining = z; } print_intrinsics() const706 bool print_intrinsics() const { return _print_intrinsics; } set_print_intrinsics(bool z)707 void set_print_intrinsics(bool z) { _print_intrinsics = z; } rtm_state() const708 RTMState rtm_state() const { return _rtm_state; } set_rtm_state(RTMState s)709 void set_rtm_state(RTMState s) { _rtm_state = s; } use_rtm() const710 bool use_rtm() const { return (_rtm_state & NoRTM) == 0; } profile_rtm() const711 bool profile_rtm() const { return _rtm_state == ProfileRTM; } max_node_limit() const712 uint max_node_limit() const { return (uint)_max_node_limit; } set_max_node_limit(uint n)713 void set_max_node_limit(uint n) { _max_node_limit = n; } 714 715 // check the CompilerOracle for special behaviours for this compile method_has_option(const char * option)716 bool method_has_option(const char * option) { 717 return method() != NULL && method()->has_option(option); 718 } 719 720 #ifndef PRODUCT trace_opto_output() const721 bool trace_opto_output() const { return _trace_opto_output; } parsed_irreducible_loop() const722 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; } set_parsed_irreducible_loop(bool z)723 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; } 724 int _in_dump_cnt; // Required for dumping ir nodes. 725 #endif has_irreducible_loop() const726 bool has_irreducible_loop() const { return _has_irreducible_loop; } set_has_irreducible_loop(bool z)727 void set_has_irreducible_loop(bool z) { _has_irreducible_loop = z; } 728 729 // JSR 292 has_method_handle_invokes() const730 bool has_method_handle_invokes() const { return _has_method_handle_invokes; } set_has_method_handle_invokes(bool z)731 void set_has_method_handle_invokes(bool z) { _has_method_handle_invokes = z; } 732 733 Ticks _latest_stage_start_counter; 734 begin_method()735 void begin_method() { 736 #ifndef PRODUCT 737 if (_printer && _printer->should_print(1)) { 738 _printer->begin_method(); 739 } 740 #endif 741 C->_latest_stage_start_counter.stamp(); 742 } 743 print_method(CompilerPhaseType cpt,int level=1)744 void print_method(CompilerPhaseType cpt, int level = 1) { 745 EventCompilerPhase event; 746 if (event.should_commit()) { 747 event.set_starttime(C->_latest_stage_start_counter); 748 event.set_phase((u1) cpt); 749 event.set_compileId(C->_compile_id); 750 event.set_phaseLevel(level); 751 event.commit(); 752 } 753 754 755 #ifndef PRODUCT 756 if (_printer && _printer->should_print(level)) { 757 _printer->print_method(CompilerPhaseTypeHelper::to_string(cpt), level); 758 } 759 #endif 760 C->_latest_stage_start_counter.stamp(); 761 } 762 end_method(int level=1)763 void end_method(int level = 1) { 764 EventCompilerPhase event; 765 if (event.should_commit()) { 766 event.set_starttime(C->_latest_stage_start_counter); 767 event.set_phase((u1) PHASE_END); 768 event.set_compileId(C->_compile_id); 769 event.set_phaseLevel(level); 770 event.commit(); 771 } 772 #ifndef PRODUCT 773 if (_printer && _printer->should_print(level)) { 774 _printer->end_method(); 775 } 776 #endif 777 } 778 macro_count() const779 int macro_count() const { return _macro_nodes->length(); } predicate_count() const780 int predicate_count() const { return _predicate_opaqs->length();} expensive_count() const781 int expensive_count() const { return _expensive_nodes->length(); } macro_node(int idx) const782 Node* macro_node(int idx) const { return _macro_nodes->at(idx); } predicate_opaque1_node(int idx) const783 Node* predicate_opaque1_node(int idx) const { return _predicate_opaqs->at(idx);} expensive_node(int idx) const784 Node* expensive_node(int idx) const { return _expensive_nodes->at(idx); } congraph()785 ConnectionGraph* congraph() { return _congraph;} set_congraph(ConnectionGraph * congraph)786 void set_congraph(ConnectionGraph* congraph) { _congraph = congraph;} add_macro_node(Node * n)787 void add_macro_node(Node * n) { 788 //assert(n->is_macro(), "must be a macro node"); 789 assert(!_macro_nodes->contains(n), "duplicate entry in expand list"); 790 _macro_nodes->append(n); 791 } remove_macro_node(Node * n)792 void remove_macro_node(Node * n) { 793 // this function may be called twice for a node so check 794 // that the node is in the array before attempting to remove it 795 if (_macro_nodes->contains(n)) 796 _macro_nodes->remove(n); 797 // remove from _predicate_opaqs list also if it is there 798 if (predicate_count() > 0 && _predicate_opaqs->contains(n)){ 799 _predicate_opaqs->remove(n); 800 } 801 } 802 void add_expensive_node(Node * n); remove_expensive_node(Node * n)803 void remove_expensive_node(Node * n) { 804 if (_expensive_nodes->contains(n)) { 805 _expensive_nodes->remove(n); 806 } 807 } add_predicate_opaq(Node * n)808 void add_predicate_opaq(Node * n) { 809 assert(!_predicate_opaqs->contains(n), "duplicate entry in predicate opaque1"); 810 assert(_macro_nodes->contains(n), "should have already been in macro list"); 811 _predicate_opaqs->append(n); 812 } 813 814 // Range check dependent CastII nodes that can be removed after loop optimizations 815 void add_range_check_cast(Node* n); remove_range_check_cast(Node * n)816 void remove_range_check_cast(Node* n) { 817 if (_range_check_casts->contains(n)) { 818 _range_check_casts->remove(n); 819 } 820 } range_check_cast_node(int idx) const821 Node* range_check_cast_node(int idx) const { return _range_check_casts->at(idx); } range_check_cast_count() const822 int range_check_cast_count() const { return _range_check_casts->length(); } 823 // Remove all range check dependent CastIINodes. 824 void remove_range_check_casts(PhaseIterGVN &igvn); 825 826 void add_opaque4_node(Node* n); remove_opaque4_node(Node * n)827 void remove_opaque4_node(Node* n) { 828 if (_opaque4_nodes->contains(n)) { 829 _opaque4_nodes->remove(n); 830 } 831 } opaque4_node(int idx) const832 Node* opaque4_node(int idx) const { return _opaque4_nodes->at(idx); } opaque4_count() const833 int opaque4_count() const { return _opaque4_nodes->length(); } 834 void remove_opaque4_nodes(PhaseIterGVN &igvn); 835 836 // remove the opaque nodes that protect the predicates so that the unused checks and 837 // uncommon traps will be eliminated from the graph. 838 void cleanup_loop_predicates(PhaseIterGVN &igvn); is_predicate_opaq(Node * n)839 bool is_predicate_opaq(Node * n) { 840 return _predicate_opaqs->contains(n); 841 } 842 843 // Are there candidate expensive nodes for optimization? 844 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn); 845 // Check whether n1 and n2 are similar 846 static int cmp_expensive_nodes(Node* n1, Node* n2); 847 // Sort expensive nodes to locate similar expensive nodes 848 void sort_expensive_nodes(); 849 850 // Compilation environment. comp_arena()851 Arena* comp_arena() { return &_comp_arena; } env() const852 ciEnv* env() const { return _env; } log() const853 CompileLog* log() const { return _log; } failing() const854 bool failing() const { return _env->failing() || _failure_reason != NULL; } failure_reason() const855 const char* failure_reason() const { return (_env->failing()) ? _env->failure_reason() : _failure_reason; } 856 failure_reason_is(const char * r) const857 bool failure_reason_is(const char* r) const { 858 return (r == _failure_reason) || (r != NULL && _failure_reason != NULL && strcmp(r, _failure_reason) == 0); 859 } 860 861 void record_failure(const char* reason); record_method_not_compilable(const char * reason)862 void record_method_not_compilable(const char* reason) { 863 // Bailouts cover "all_tiers" when TieredCompilation is off. 864 env()->record_method_not_compilable(reason, !TieredCompilation); 865 // Record failure reason. 866 record_failure(reason); 867 } check_node_count(uint margin,const char * reason)868 bool check_node_count(uint margin, const char* reason) { 869 if (live_nodes() + margin > max_node_limit()) { 870 record_method_not_compilable(reason); 871 return true; 872 } else { 873 return false; 874 } 875 } 876 877 // Node management unique() const878 uint unique() const { return _unique; } next_unique()879 uint next_unique() { return _unique++; } set_unique(uint i)880 void set_unique(uint i) { _unique = i; } debug_idx()881 static int debug_idx() { return debug_only(_debug_idx)+0; } set_debug_idx(int i)882 static void set_debug_idx(int i) { debug_only(_debug_idx = i); } node_arena()883 Arena* node_arena() { return &_node_arena; } old_arena()884 Arena* old_arena() { return &_old_arena; } root() const885 RootNode* root() const { return _root; } set_root(RootNode * r)886 void set_root(RootNode* r) { _root = r; } 887 StartNode* start() const; // (Derived from root.) 888 void init_start(StartNode* s); 889 Node* immutable_memory(); 890 recent_alloc_ctl() const891 Node* recent_alloc_ctl() const { return _recent_alloc_ctl; } recent_alloc_obj() const892 Node* recent_alloc_obj() const { return _recent_alloc_obj; } set_recent_alloc(Node * ctl,Node * obj)893 void set_recent_alloc(Node* ctl, Node* obj) { 894 _recent_alloc_ctl = ctl; 895 _recent_alloc_obj = obj; 896 } record_dead_node(uint idx)897 void record_dead_node(uint idx) { if (_dead_node_list.test_set(idx)) return; 898 _dead_node_count++; 899 } is_dead_node(uint idx)900 bool is_dead_node(uint idx) { return _dead_node_list.test(idx) != 0; } dead_node_count()901 uint dead_node_count() { return _dead_node_count; } reset_dead_node_list()902 void reset_dead_node_list() { _dead_node_list.Reset(); 903 _dead_node_count = 0; 904 } live_nodes() const905 uint live_nodes() const { 906 int val = _unique - _dead_node_count; 907 assert (val >= 0, "number of tracked dead nodes %d more than created nodes %d", _unique, _dead_node_count); 908 return (uint) val; 909 } 910 #ifdef ASSERT 911 uint count_live_nodes_by_graph_walk(); 912 void print_missing_nodes(); 913 #endif 914 915 // Record modified nodes to check that they are put on IGVN worklist 916 void record_modified_node(Node* n) NOT_DEBUG_RETURN; 917 void remove_modified_node(Node* n) NOT_DEBUG_RETURN; DEBUG_ONLY(Unique_Node_List * modified_nodes ()const{ return _modified_nodes; } )918 DEBUG_ONLY( Unique_Node_List* modified_nodes() const { return _modified_nodes; } ) 919 920 // Constant table 921 ConstantTable& constant_table() { return _constant_table; } 922 923 MachConstantBaseNode* mach_constant_base_node(); has_mach_constant_base_node() const924 bool has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; } 925 // Generated by adlc, true if CallNode requires MachConstantBase. 926 bool needs_clone_jvms(); 927 928 // Handy undefined Node top() const929 Node* top() const { return _top; } 930 931 // these are used by guys who need to know about creation and transformation of top: cached_top_node()932 Node* cached_top_node() { return _top; } 933 void set_cached_top_node(Node* tn); 934 node_note_array() const935 GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; } set_node_note_array(GrowableArray<Node_Notes * > * arr)936 void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; } default_node_notes() const937 Node_Notes* default_node_notes() const { return _default_node_notes; } set_default_node_notes(Node_Notes * n)938 void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; } 939 node_notes_at(int idx)940 Node_Notes* node_notes_at(int idx) { 941 return locate_node_notes(_node_note_array, idx, false); 942 } 943 inline bool set_node_notes_at(int idx, Node_Notes* value); 944 945 // Copy notes from source to dest, if they exist. 946 // Overwrite dest only if source provides something. 947 // Return true if information was moved. 948 bool copy_node_notes_to(Node* dest, Node* source); 949 950 // Workhorse function to sort out the blocked Node_Notes array: 951 inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr, 952 int idx, bool can_grow = false); 953 954 void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by); 955 956 // Type management type_arena()957 Arena* type_arena() { return _type_arena; } type_dict()958 Dict* type_dict() { return _type_dict; } type_hwm()959 void* type_hwm() { return _type_hwm; } type_last_size()960 size_t type_last_size() { return _type_last_size; } num_alias_types()961 int num_alias_types() { return _num_alias_types; } 962 init_type_arena()963 void init_type_arena() { _type_arena = &_Compile_types; } set_type_arena(Arena * a)964 void set_type_arena(Arena* a) { _type_arena = a; } set_type_dict(Dict * d)965 void set_type_dict(Dict* d) { _type_dict = d; } set_type_hwm(void * p)966 void set_type_hwm(void* p) { _type_hwm = p; } set_type_last_size(size_t sz)967 void set_type_last_size(size_t sz) { _type_last_size = sz; } 968 last_tf(ciMethod * m)969 const TypeFunc* last_tf(ciMethod* m) { 970 return (m == _last_tf_m) ? _last_tf : NULL; 971 } set_last_tf(ciMethod * m,const TypeFunc * tf)972 void set_last_tf(ciMethod* m, const TypeFunc* tf) { 973 assert(m != NULL || tf == NULL, ""); 974 _last_tf_m = m; 975 _last_tf = tf; 976 } 977 alias_type(int idx)978 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; } alias_type(const TypePtr * adr_type,ciField * field=NULL)979 AliasType* alias_type(const TypePtr* adr_type, ciField* field = NULL) { return find_alias_type(adr_type, false, field); } 980 bool have_alias_type(const TypePtr* adr_type); 981 AliasType* alias_type(ciField* field); 982 get_alias_index(const TypePtr * at)983 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); } get_adr_type(uint aidx)984 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); } get_general_index(uint aidx)985 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); } 986 987 // Building nodes 988 void rethrow_exceptions(JVMState* jvms); 989 void return_values(JVMState* jvms); 990 JVMState* build_start_state(StartNode* start, const TypeFunc* tf); 991 992 // Decide how to build a call. 993 // The profile factor is a discount to apply to this site's interp. profile. 994 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch, 995 JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = NULL, 996 bool allow_intrinsics = true, bool delayed_forbidden = false); should_delay_inlining(ciMethod * call_method,JVMState * jvms)997 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) { 998 return should_delay_string_inlining(call_method, jvms) || 999 should_delay_boxing_inlining(call_method, jvms); 1000 } 1001 bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms); 1002 bool should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms); 1003 1004 // Helper functions to identify inlining potential at call-site 1005 ciMethod* optimize_virtual_call(ciMethod* caller, int bci, ciInstanceKlass* klass, 1006 ciKlass* holder, ciMethod* callee, 1007 const TypeOopPtr* receiver_type, bool is_virtual, 1008 bool &call_does_dispatch, int &vtable_index, 1009 bool check_access = true); 1010 ciMethod* optimize_inlining(ciMethod* caller, int bci, ciInstanceKlass* klass, 1011 ciMethod* callee, const TypeOopPtr* receiver_type, 1012 bool check_access = true); 1013 1014 // Report if there were too many traps at a current method and bci. 1015 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded. 1016 // If there is no MDO at all, report no trap unless told to assume it. 1017 bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason); 1018 // This version, unspecific to a particular bci, asks if 1019 // PerMethodTrapLimit was exceeded for all inlined methods seen so far. 1020 bool too_many_traps(Deoptimization::DeoptReason reason, 1021 // Privately used parameter for logging: 1022 ciMethodData* logmd = NULL); 1023 // Report if there were too many recompiles at a method and bci. 1024 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason); 1025 // Return a bitset with the reasons where deoptimization is allowed, 1026 // i.e., where there were not too many uncommon traps. 1027 int _allowed_reasons; allowed_deopt_reasons()1028 int allowed_deopt_reasons() { return _allowed_reasons; } 1029 void set_allowed_deopt_reasons(); 1030 1031 // Parsing, optimization initial_gvn()1032 PhaseGVN* initial_gvn() { return _initial_gvn; } for_igvn()1033 Unique_Node_List* for_igvn() { return _for_igvn; } 1034 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List. set_initial_gvn(PhaseGVN * gvn)1035 void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; } set_for_igvn(Unique_Node_List * for_igvn)1036 void set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; } 1037 1038 // Replace n by nn using initial_gvn, calling hash_delete and 1039 // record_for_igvn as needed. 1040 void gvn_replace_by(Node* n, Node* nn); 1041 1042 1043 void identify_useful_nodes(Unique_Node_List &useful); 1044 void update_dead_node_list(Unique_Node_List &useful); 1045 void remove_useless_nodes (Unique_Node_List &useful); 1046 warm_calls() const1047 WarmCallInfo* warm_calls() const { return _warm_calls; } set_warm_calls(WarmCallInfo * l)1048 void set_warm_calls(WarmCallInfo* l) { _warm_calls = l; } 1049 WarmCallInfo* pop_warm_call(); 1050 1051 // Record this CallGenerator for inlining at the end of parsing. add_late_inline(CallGenerator * cg)1052 void add_late_inline(CallGenerator* cg) { 1053 _late_inlines.insert_before(_late_inlines_pos, cg); 1054 _late_inlines_pos++; 1055 } 1056 prepend_late_inline(CallGenerator * cg)1057 void prepend_late_inline(CallGenerator* cg) { 1058 _late_inlines.insert_before(0, cg); 1059 } 1060 add_string_late_inline(CallGenerator * cg)1061 void add_string_late_inline(CallGenerator* cg) { 1062 _string_late_inlines.push(cg); 1063 } 1064 add_boxing_late_inline(CallGenerator * cg)1065 void add_boxing_late_inline(CallGenerator* cg) { 1066 _boxing_late_inlines.push(cg); 1067 } 1068 1069 void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful); 1070 1071 void process_print_inlining(); 1072 void dump_print_inlining(); 1073 over_inlining_cutoff() const1074 bool over_inlining_cutoff() const { 1075 if (!inlining_incrementally()) { 1076 return unique() > (uint)NodeCountInliningCutoff; 1077 } else { 1078 return live_nodes() > (uint)LiveNodeCountInliningCutoff; 1079 } 1080 } 1081 inc_number_of_mh_late_inlines()1082 void inc_number_of_mh_late_inlines() { _number_of_mh_late_inlines++; } dec_number_of_mh_late_inlines()1083 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--; } has_mh_late_inlines() const1084 bool has_mh_late_inlines() const { return _number_of_mh_late_inlines > 0; } 1085 1086 void inline_incrementally_one(PhaseIterGVN& igvn); 1087 void inline_incrementally(PhaseIterGVN& igvn); 1088 void inline_string_calls(bool parse_time); 1089 void inline_boxing_calls(PhaseIterGVN& igvn); 1090 bool optimize_loops(PhaseIterGVN& igvn, LoopOptsMode mode); 1091 void remove_root_to_sfpts_edges(PhaseIterGVN& igvn); 1092 1093 // Matching, CFG layout, allocation, code generation cfg()1094 PhaseCFG* cfg() { return _cfg; } select_24_bit_instr() const1095 bool select_24_bit_instr() const { return _select_24_bit_instr; } in_24_bit_fp_mode() const1096 bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; } has_java_calls() const1097 bool has_java_calls() const { return _java_calls > 0; } java_calls() const1098 int java_calls() const { return _java_calls; } inner_loops() const1099 int inner_loops() const { return _inner_loops; } matcher()1100 Matcher* matcher() { return _matcher; } regalloc()1101 PhaseRegAlloc* regalloc() { return _regalloc; } frame_slots() const1102 int frame_slots() const { return _frame_slots; } 1103 int frame_size_in_words() const; // frame_slots in units of the polymorphic 'words' frame_size_in_bytes() const1104 int frame_size_in_bytes() const { return _frame_slots << LogBytesPerInt; } FIRST_STACK_mask()1105 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; } indexSet_arena()1106 Arena* indexSet_arena() { return _indexSet_arena; } indexSet_free_block_list()1107 void* indexSet_free_block_list() { return _indexSet_free_block_list; } node_bundling_limit()1108 uint node_bundling_limit() { return _node_bundling_limit; } node_bundling_base()1109 Bundle* node_bundling_base() { return _node_bundling_base; } set_node_bundling_limit(uint n)1110 void set_node_bundling_limit(uint n) { _node_bundling_limit = n; } set_node_bundling_base(Bundle * b)1111 void set_node_bundling_base(Bundle* b) { _node_bundling_base = b; } 1112 bool starts_bundle(const Node *n) const; 1113 bool need_stack_bang(int frame_size_in_bytes) const; 1114 bool need_register_stack_bang() const; 1115 update_interpreter_frame_size(int size)1116 void update_interpreter_frame_size(int size) { 1117 if (_interpreter_frame_size < size) { 1118 _interpreter_frame_size = size; 1119 } 1120 } 1121 int bang_size_in_bytes() const; 1122 set_matcher(Matcher * m)1123 void set_matcher(Matcher* m) { _matcher = m; } 1124 //void set_regalloc(PhaseRegAlloc* ra) { _regalloc = ra; } set_indexSet_arena(Arena * a)1125 void set_indexSet_arena(Arena* a) { _indexSet_arena = a; } set_indexSet_free_block_list(void * p)1126 void set_indexSet_free_block_list(void* p) { _indexSet_free_block_list = p; } 1127 1128 // Remember if this compilation changes hardware mode to 24-bit precision set_24_bit_selection_and_mode(bool selection,bool mode)1129 void set_24_bit_selection_and_mode(bool selection, bool mode) { 1130 _select_24_bit_instr = selection; 1131 _in_24_bit_fp_mode = mode; 1132 } 1133 set_java_calls(int z)1134 void set_java_calls(int z) { _java_calls = z; } set_inner_loops(int z)1135 void set_inner_loops(int z) { _inner_loops = z; } 1136 1137 // Instruction bits passed off to the VM code_size()1138 int code_size() { return _method_size; } code_buffer()1139 CodeBuffer* code_buffer() { return &_code_buffer; } first_block_size()1140 int first_block_size() { return _first_block_size; } set_frame_complete(int off)1141 void set_frame_complete(int off) { if (!in_scratch_emit_size()) { _code_offsets.set_value(CodeOffsets::Frame_Complete, off); } } handler_table()1142 ExceptionHandlerTable* handler_table() { return &_handler_table; } inc_table()1143 ImplicitExceptionTable* inc_table() { return &_inc_table; } oop_map_set()1144 OopMapSet* oop_map_set() { return _oop_map_set; } debug_info()1145 DebugInformationRecorder* debug_info() { return env()->debug_info(); } dependencies()1146 Dependencies* dependencies() { return env()->dependencies(); } CompiledZap_count()1147 static int CompiledZap_count() { return _CompiledZap_count; } scratch_buffer_blob()1148 BufferBlob* scratch_buffer_blob() { return _scratch_buffer_blob; } 1149 void init_scratch_buffer_blob(int const_size); 1150 void clear_scratch_buffer_blob(); set_scratch_buffer_blob(BufferBlob * b)1151 void set_scratch_buffer_blob(BufferBlob* b) { _scratch_buffer_blob = b; } scratch_locs_memory()1152 relocInfo* scratch_locs_memory() { return _scratch_locs_memory; } set_scratch_locs_memory(relocInfo * b)1153 void set_scratch_locs_memory(relocInfo* b) { _scratch_locs_memory = b; } 1154 1155 // emit to scratch blob, report resulting size 1156 uint scratch_emit_size(const Node* n); set_in_scratch_emit_size(bool x)1157 void set_in_scratch_emit_size(bool x) { _in_scratch_emit_size = x; } in_scratch_emit_size() const1158 bool in_scratch_emit_size() const { return _in_scratch_emit_size; } 1159 1160 enum ScratchBufferBlob { 1161 #if defined(PPC64) 1162 MAX_inst_size = 2048, 1163 #else 1164 MAX_inst_size = 1024, 1165 #endif 1166 MAX_locs_size = 128, // number of relocInfo elements 1167 MAX_const_size = 128, 1168 MAX_stubs_size = 128 1169 }; 1170 1171 // Major entry point. Given a Scope, compile the associated method. 1172 // For normal compilations, entry_bci is InvocationEntryBci. For on stack 1173 // replacement, entry_bci indicates the bytecode for which to compile a 1174 // continuation. 1175 Compile(ciEnv* ci_env, C2Compiler* compiler, ciMethod* target, 1176 int entry_bci, bool subsume_loads, bool do_escape_analysis, 1177 bool eliminate_boxing, DirectiveSet* directive); 1178 1179 // Second major entry point. From the TypeFunc signature, generate code 1180 // to pass arguments from the Java calling convention to the C calling 1181 // convention. 1182 Compile(ciEnv* ci_env, const TypeFunc *(*gen)(), 1183 address stub_function, const char *stub_name, 1184 int is_fancy_jump, bool pass_tls, 1185 bool save_arg_registers, bool return_pc, DirectiveSet* directive); 1186 1187 // From the TypeFunc signature, generate code to pass arguments 1188 // from Compiled calling convention to Interpreter's calling convention 1189 void Generate_Compiled_To_Interpreter_Graph(const TypeFunc *tf, address interpreter_entry); 1190 1191 // From the TypeFunc signature, generate code to pass arguments 1192 // from Interpreter's calling convention to Compiler's calling convention 1193 void Generate_Interpreter_To_Compiled_Graph(const TypeFunc *tf); 1194 1195 // Are we compiling a method? has_method()1196 bool has_method() { return method() != NULL; } 1197 1198 // Maybe print some information about this compile. 1199 void print_compile_messages(); 1200 1201 // Final graph reshaping, a post-pass after the regular optimizer is done. 1202 bool final_graph_reshaping(); 1203 1204 // returns true if adr is completely contained in the given alias category 1205 bool must_alias(const TypePtr* adr, int alias_idx); 1206 1207 // returns true if adr overlaps with the given alias category 1208 bool can_alias(const TypePtr* adr, int alias_idx); 1209 1210 // Driver for converting compiler's IR into machine code bits 1211 void Output(); 1212 1213 // Accessors for node bundling info. 1214 Bundle* node_bundling(const Node *n); 1215 bool valid_bundle_info(const Node *n); 1216 1217 // Schedule and Bundle the instructions 1218 void ScheduleAndBundle(); 1219 1220 // Build OopMaps for each GC point 1221 void BuildOopMaps(); 1222 1223 // Append debug info for the node "local" at safepoint node "sfpt" to the 1224 // "array", May also consult and add to "objs", which describes the 1225 // scalar-replaced objects. 1226 void FillLocArray( int idx, MachSafePointNode* sfpt, 1227 Node *local, GrowableArray<ScopeValue*> *array, 1228 GrowableArray<ScopeValue*> *objs ); 1229 1230 // If "objs" contains an ObjectValue whose id is "id", returns it, else NULL. 1231 static ObjectValue* sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id); 1232 // Requres that "objs" does not contains an ObjectValue whose id matches 1233 // that of "sv. Appends "sv". 1234 static void set_sv_for_object_node(GrowableArray<ScopeValue*> *objs, 1235 ObjectValue* sv ); 1236 1237 // Process an OopMap Element while emitting nodes 1238 void Process_OopMap_Node(MachNode *mach, int code_offset); 1239 1240 // Initialize code buffer 1241 CodeBuffer* init_buffer(uint* blk_starts); 1242 1243 // Write out basic block data to code buffer 1244 void fill_buffer(CodeBuffer* cb, uint* blk_starts); 1245 1246 // Determine which variable sized branches can be shortened 1247 void shorten_branches(uint* blk_starts, int& code_size, int& reloc_size, int& stub_size); 1248 1249 // Compute the size of first NumberOfLoopInstrToAlign instructions 1250 // at the head of a loop. 1251 void compute_loop_first_inst_sizes(); 1252 1253 // Compute the information for the exception tables 1254 void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels); 1255 1256 // Stack slots that may be unused by the calling convention but must 1257 // otherwise be preserved. On Intel this includes the return address. 1258 // On PowerPC it includes the 4 words holding the old TOC & LR glue. 1259 uint in_preserve_stack_slots(); 1260 1261 // "Top of Stack" slots that may be unused by the calling convention but must 1262 // otherwise be preserved. 1263 // On Intel these are not necessary and the value can be zero. 1264 // On Sparc this describes the words reserved for storing a register window 1265 // when an interrupt occurs. 1266 static uint out_preserve_stack_slots(); 1267 1268 // Number of outgoing stack slots killed above the out_preserve_stack_slots 1269 // for calls to C. Supports the var-args backing area for register parms. 1270 uint varargs_C_out_slots_killed() const; 1271 1272 // Number of Stack Slots consumed by a synchronization entry 1273 int sync_stack_slots() const; 1274 1275 // Compute the name of old_SP. See <arch>.ad for frame layout. 1276 OptoReg::Name compute_old_SP(); 1277 1278 private: 1279 // Phase control: 1280 void Init(int aliaslevel); // Prepare for a single compilation 1281 int Inline_Warm(); // Find more inlining work. 1282 void Finish_Warm(); // Give up on further inlines. 1283 void Optimize(); // Given a graph, optimize it 1284 void Code_Gen(); // Generate code from a graph 1285 1286 // Management of the AliasType table. 1287 void grow_alias_types(); 1288 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type); 1289 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const; 1290 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field); 1291 1292 void verify_top(Node*) const PRODUCT_RETURN; 1293 1294 // Intrinsic setup. 1295 void register_library_intrinsics(); // initializer 1296 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor 1297 int intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found); // helper 1298 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn 1299 void register_intrinsic(CallGenerator* cg); // update fn 1300 1301 #ifndef PRODUCT 1302 static juint _intrinsic_hist_count[vmIntrinsics::ID_LIMIT]; 1303 static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT]; 1304 #endif 1305 // Function calls made by the public function final_graph_reshaping. 1306 // No need to be made public as they are not called elsewhere. 1307 void final_graph_reshaping_impl( Node *n, Final_Reshape_Counts &frc); 1308 void final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop); 1309 void final_graph_reshaping_walk( Node_Stack &nstack, Node *root, Final_Reshape_Counts &frc ); 1310 void eliminate_redundant_card_marks(Node* n); 1311 1312 public: 1313 1314 // Note: Histogram array size is about 1 Kb. 1315 enum { // flag bits: 1316 _intrinsic_worked = 1, // succeeded at least once 1317 _intrinsic_failed = 2, // tried it but it failed 1318 _intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps) 1319 _intrinsic_virtual = 8, // was seen in the virtual form (rare) 1320 _intrinsic_both = 16 // was seen in the non-virtual form (usual) 1321 }; 1322 // Update histogram. Return boolean if this is a first-time occurrence. 1323 static bool gather_intrinsic_statistics(vmIntrinsics::ID id, 1324 bool is_virtual, int flags) PRODUCT_RETURN0; 1325 static void print_intrinsic_statistics() PRODUCT_RETURN; 1326 1327 // Graph verification code 1328 // Walk the node list, verifying that there is a one-to-one 1329 // correspondence between Use-Def edges and Def-Use edges 1330 // The option no_dead_code enables stronger checks that the 1331 // graph is strongly connected from root in both directions. 1332 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN; 1333 1334 // End-of-run dumps. 1335 static void print_statistics() PRODUCT_RETURN; 1336 1337 // Dump formatted assembly 1338 void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN; 1339 void dump_pc(int *pcs, int pc_limit, Node *n); 1340 1341 // Verify ADLC assumptions during startup 1342 static void adlc_verification() PRODUCT_RETURN; 1343 1344 // Definitions of pd methods 1345 static void pd_compiler2_init(); 1346 1347 // Static parse-time type checking logic for gen_subtype_check: 1348 enum { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test }; 1349 int static_subtype_check(ciKlass* superk, ciKlass* subk); 1350 1351 static Node* conv_I2X_index(PhaseGVN* phase, Node* offset, const TypeInt* sizetype, 1352 // Optional control dependency (for example, on range check) 1353 Node* ctrl = NULL); 1354 1355 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check) 1356 static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl); 1357 1358 // Auxiliary method for randomized fuzzing/stressing 1359 static bool randomized_select(int count); 1360 1361 // supporting clone_map 1362 CloneMap& clone_map(); 1363 void set_clone_map(Dict* d); 1364 1365 bool is_compiling_clinit_for(ciKlass* k); 1366 }; 1367 1368 #endif // SHARE_VM_OPTO_COMPILE_HPP 1369