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