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