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