compile.hpp revision 3602:da91efe96a93
1254721Semaste/* 2254721Semaste * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. 3254721Semaste * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4254721Semaste * 5254721Semaste * This code is free software; you can redistribute it and/or modify it 6254721Semaste * under the terms of the GNU General Public License version 2 only, as 7254721Semaste * published by the Free Software Foundation. 8254721Semaste * 9254721Semaste * This code is distributed in the hope that it will be useful, but WITHOUT 10254721Semaste * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11254721Semaste * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12254721Semaste * version 2 for more details (a copy is included in the LICENSE file that 13254721Semaste * accompanied this code). 14254721Semaste * 15254721Semaste * You should have received a copy of the GNU General Public License version 16254721Semaste * 2 along with this work; if not, write to the Free Software Foundation, 17254721Semaste * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18254721Semaste * 19254721Semaste * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20254721Semaste * or visit www.oracle.com if you need additional information or have any 21254721Semaste * questions. 22254721Semaste * 23254721Semaste */ 24254721Semaste 25254721Semaste#ifndef SHARE_VM_OPTO_COMPILE_HPP 26254721Semaste#define SHARE_VM_OPTO_COMPILE_HPP 27254721Semaste 28254721Semaste#include "asm/codeBuffer.hpp" 29254721Semaste#include "ci/compilerInterface.hpp" 30254721Semaste#include "code/debugInfoRec.hpp" 31254721Semaste#include "code/exceptionHandlerTable.hpp" 32254721Semaste#include "compiler/compilerOracle.hpp" 33254721Semaste#include "libadt/dict.hpp" 34254721Semaste#include "libadt/port.hpp" 35254721Semaste#include "libadt/vectset.hpp" 36254721Semaste#include "memory/resourceArea.hpp" 37254721Semaste#include "opto/idealGraphPrinter.hpp" 38254721Semaste#include "opto/phase.hpp" 39254721Semaste#include "opto/regmask.hpp" 40254721Semaste#include "runtime/deoptimization.hpp" 41254721Semaste#include "runtime/vmThread.hpp" 42254721Semaste 43254721Semasteclass Block; 44254721Semasteclass Bundle; 45254721Semasteclass C2Compiler; 46254721Semasteclass CallGenerator; 47254721Semasteclass ConnectionGraph; 48254721Semasteclass InlineTree; 49254721Semasteclass Int_Array; 50254721Semasteclass Matcher; 51254721Semasteclass MachConstantNode; 52254721Semasteclass MachConstantBaseNode; 53254721Semasteclass MachNode; 54254721Semasteclass MachOper; 55254721Semasteclass MachSafePointNode; 56254721Semasteclass Node; 57254721Semasteclass Node_Array; 58254721Semasteclass Node_Notes; 59254721Semasteclass OptoReg; 60254721Semasteclass PhaseCFG; 61254721Semasteclass PhaseGVN; 62254721Semasteclass PhaseIterGVN; 63254721Semasteclass PhaseRegAlloc; 64254721Semasteclass PhaseCCP; 65254721Semasteclass PhaseCCP_DCE; 66254721Semasteclass RootNode; 67254721Semasteclass relocInfo; 68254721Semasteclass Scope; 69254721Semasteclass StartNode; 70254721Semasteclass SafePointNode; 71254721Semasteclass JVMState; 72254721Semasteclass TypeData; 73254721Semasteclass TypePtr; 74254721Semasteclass TypeFunc; 75254721Semasteclass Unique_Node_List; 76254721Semasteclass nmethod; 77254721Semasteclass WarmCallInfo; 78254721Semaste 79254721Semaste//------------------------------Compile---------------------------------------- 80254721Semaste// This class defines a top-level Compiler invocation. 81254721Semaste 82254721Semasteclass Compile : public Phase { 83254721Semaste friend class VMStructs; 84254721Semaste 85254721Semaste public: 86254721Semaste // Fixed alias indexes. (See also MergeMemNode.) 87254721Semaste enum { 88254721Semaste AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value) 89254721Semaste AliasIdxBot = 2, // pseudo-index, aliases to everything 90254721Semaste AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM 91254721Semaste }; 92254721Semaste 93254721Semaste // Variant of TraceTime(NULL, &_t_accumulator, TimeCompiler); 94254721Semaste // Integrated with logging. If logging is turned on, and dolog is true, 95254721Semaste // then brackets are put into the log, with time stamps and node counts. 96254721Semaste // (The time collection itself is always conditionalized on TimeCompiler.) 97254721Semaste class TracePhase : public TraceTime { 98254721Semaste private: 99254721Semaste Compile* C; 100254721Semaste CompileLog* _log; 101254721Semaste public: 102254721Semaste TracePhase(const char* name, elapsedTimer* accumulator, bool dolog); 103254721Semaste ~TracePhase(); 104254721Semaste }; 105254721Semaste 106254721Semaste // Information per category of alias (memory slice) 107254721Semaste class AliasType { 108254721Semaste private: 109254721Semaste friend class Compile; 110254721Semaste 111254721Semaste int _index; // unique index, used with MergeMemNode 112254721Semaste const TypePtr* _adr_type; // normalized address type 113254721Semaste ciField* _field; // relevant instance field, or null if none 114254721Semaste bool _is_rewritable; // false if the memory is write-once only 115254721Semaste int _general_index; // if this is type is an instance, the general 116254721Semaste // type that this is an instance of 117254721Semaste 118254721Semaste void Init(int i, const TypePtr* at); 119254721Semaste 120254721Semaste public: 121254721Semaste int index() const { return _index; } 122254721Semaste const TypePtr* adr_type() const { return _adr_type; } 123254721Semaste ciField* field() const { return _field; } 124254721Semaste bool is_rewritable() const { return _is_rewritable; } 125254721Semaste bool is_volatile() const { return (_field ? _field->is_volatile() : false); } 126254721Semaste int general_index() const { return (_general_index != 0) ? _general_index : _index; } 127254721Semaste 128254721Semaste void set_rewritable(bool z) { _is_rewritable = z; } 129254721Semaste void set_field(ciField* f) { 130254721Semaste assert(!_field,""); 131254721Semaste _field = f; 132254721Semaste if (f->is_final()) _is_rewritable = false; 133254721Semaste } 134254721Semaste 135254721Semaste void print_on(outputStream* st) PRODUCT_RETURN; 136254721Semaste }; 137254721Semaste 138254721Semaste enum { 139254721Semaste logAliasCacheSize = 6, 140254721Semaste AliasCacheSize = (1<<logAliasCacheSize) 141254721Semaste }; 142254721Semaste struct AliasCacheEntry { const TypePtr* _adr_type; int _index; }; // simple duple type 143254721Semaste enum { 144254721Semaste trapHistLength = MethodData::_trap_hist_limit 145254721Semaste }; 146254721Semaste 147254721Semaste // Constant entry of the constant table. 148254721Semaste class Constant { 149254721Semaste private: 150254721Semaste BasicType _type; 151254721Semaste union { 152254721Semaste jvalue _value; 153254721Semaste Metadata* _metadata; 154254721Semaste } _v; 155254721Semaste int _offset; // offset of this constant (in bytes) relative to the constant table base. 156254721Semaste float _freq; 157254721Semaste bool _can_be_reused; // true (default) if the value can be shared with other users. 158254721Semaste 159254721Semaste public: 160254721Semaste Constant() : _type(T_ILLEGAL), _offset(-1), _freq(0.0f), _can_be_reused(true) { _v._value.l = 0; } 161254721Semaste Constant(BasicType type, jvalue value, float freq = 0.0f, bool can_be_reused = true) : 162254721Semaste _type(type), 163254721Semaste _offset(-1), 164254721Semaste _freq(freq), 165254721Semaste _can_be_reused(can_be_reused) 166254721Semaste { 167254721Semaste assert(type != T_METADATA, "wrong constructor"); 168254721Semaste _v._value = value; 169254721Semaste } 170254721Semaste Constant(Metadata* metadata, bool can_be_reused = true) : 171254721Semaste _type(T_METADATA), 172254721Semaste _offset(-1), 173254721Semaste _freq(0.0f), 174254721Semaste _can_be_reused(can_be_reused) 175254721Semaste { 176254721Semaste _v._metadata = metadata; 177254721Semaste } 178254721Semaste 179254721Semaste bool operator==(const Constant& other); 180254721Semaste 181254721Semaste BasicType type() const { return _type; } 182254721Semaste 183254721Semaste jlong get_jlong() const { return _v._value.j; } 184254721Semaste jfloat get_jfloat() const { return _v._value.f; } 185254721Semaste jdouble get_jdouble() const { return _v._value.d; } 186254721Semaste jobject get_jobject() const { return _v._value.l; } 187254721Semaste 188254721Semaste Metadata* get_metadata() const { return _v._metadata; } 189254721Semaste 190254721Semaste int offset() const { return _offset; } 191254721Semaste void set_offset(int offset) { _offset = offset; } 192254721Semaste 193254721Semaste float freq() const { return _freq; } 194254721Semaste void inc_freq(float freq) { _freq += freq; } 195254721Semaste 196254721Semaste bool can_be_reused() const { return _can_be_reused; } 197254721Semaste }; 198254721Semaste 199254721Semaste // Constant table. 200254721Semaste class ConstantTable { 201254721Semaste private: 202254721Semaste GrowableArray<Constant> _constants; // Constants of this table. 203254721Semaste int _size; // Size in bytes the emitted constant table takes (including padding). 204254721Semaste int _table_base_offset; // Offset of the table base that gets added to the constant offsets. 205254721Semaste int _nof_jump_tables; // Number of jump-tables in this constant table. 206254721Semaste 207254721Semaste static int qsort_comparator(Constant* a, Constant* b); 208254721Semaste 209254721Semaste // We use negative frequencies to keep the order of the 210254721Semaste // jump-tables in which they were added. Otherwise we get into 211254721Semaste // trouble with relocation. 212254721Semaste float next_jump_table_freq() { return -1.0f * (++_nof_jump_tables); } 213254721Semaste 214254721Semaste public: 215254721Semaste ConstantTable() : 216254721Semaste _size(-1), 217254721Semaste _table_base_offset(-1), // We can use -1 here since the constant table is always bigger than 2 bytes (-(size / 2), see MachConstantBaseNode::emit). 218254721Semaste _nof_jump_tables(0) 219254721Semaste {} 220254721Semaste 221254721Semaste int size() const { assert(_size != -1, "not calculated yet"); return _size; } 222254721Semaste 223254721Semaste int calculate_table_base_offset() const; // AD specific 224254721Semaste void set_table_base_offset(int x) { assert(_table_base_offset == -1 || x == _table_base_offset, "can't change"); _table_base_offset = x; } 225254721Semaste int table_base_offset() const { assert(_table_base_offset != -1, "not set yet"); return _table_base_offset; } 226254721Semaste 227254721Semaste void emit(CodeBuffer& cb); 228254721Semaste 229254721Semaste // Returns the offset of the last entry (the top) of the constant table. 230254721Semaste int top_offset() const { assert(_constants.top().offset() != -1, "not bound yet"); return _constants.top().offset(); } 231254721Semaste 232254721Semaste void calculate_offsets_and_size(); 233254721Semaste int find_offset(Constant& con) const; 234254721Semaste 235254721Semaste void add(Constant& con); 236254721Semaste Constant add(MachConstantNode* n, BasicType type, jvalue value); 237254721Semaste Constant add(Metadata* metadata); 238254721Semaste Constant add(MachConstantNode* n, MachOper* oper); 239254721Semaste Constant add(MachConstantNode* n, jfloat f) { 240254721Semaste jvalue value; value.f = f; 241254721Semaste return add(n, T_FLOAT, value); 242254721Semaste } 243254721Semaste Constant add(MachConstantNode* n, jdouble d) { 244254721Semaste jvalue value; value.d = d; 245254721Semaste return add(n, T_DOUBLE, value); 246254721Semaste } 247254721Semaste 248254721Semaste // Jump-table 249254721Semaste Constant add_jump_table(MachConstantNode* n); 250254721Semaste void fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const; 251254721Semaste }; 252254721Semaste 253254721Semaste private: 254254721Semaste // Fixed parameters to this compilation. 255254721Semaste const int _compile_id; 256254721Semaste const bool _save_argument_registers; // save/restore arg regs for trampolines 257254721Semaste const bool _subsume_loads; // Load can be matched as part of a larger op. 258254721Semaste const bool _do_escape_analysis; // Do escape analysis. 259254721Semaste ciMethod* _method; // The method being compiled. 260254721Semaste int _entry_bci; // entry bci for osr methods. 261254721Semaste const TypeFunc* _tf; // My kind of signature 262254721Semaste InlineTree* _ilt; // Ditto (temporary). 263254721Semaste address _stub_function; // VM entry for stub being compiled, or NULL 264254721Semaste const char* _stub_name; // Name of stub or adapter being compiled, or NULL 265254721Semaste address _stub_entry_point; // Compile code entry for generated stub, or NULL 266254721Semaste 267254721Semaste // Control of this compilation. 268254721Semaste int _num_loop_opts; // Number of iterations for doing loop optimiztions 269254721Semaste int _max_inline_size; // Max inline size for this compilation 270254721Semaste int _freq_inline_size; // Max hot method inline size for this compilation 271254721Semaste int _fixed_slots; // count of frame slots not allocated by the register 272254721Semaste // allocator i.e. locks, original deopt pc, etc. 273254721Semaste // For deopt 274254721Semaste int _orig_pc_slot; 275254721Semaste int _orig_pc_slot_offset_in_bytes; 276254721Semaste 277254721Semaste int _major_progress; // Count of something big happening 278254721Semaste bool _has_loops; // True if the method _may_ have some loops 279254721Semaste bool _has_split_ifs; // True if the method _may_ have some split-if 280254721Semaste bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores. 281254721Semaste bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated 282254721Semaste uint _trap_hist[trapHistLength]; // Cumulative traps 283254721Semaste bool _trap_can_recompile; // Have we emitted a recompiling trap? 284254721Semaste uint _decompile_count; // Cumulative decompilation counts. 285254721Semaste bool _do_inlining; // True if we intend to do inlining 286254721Semaste bool _do_scheduling; // True if we intend to do scheduling 287254721Semaste bool _do_freq_based_layout; // True if we intend to do frequency based block layout 288254721Semaste bool _do_count_invocations; // True if we generate code to count invocations 289254721Semaste bool _do_method_data_update; // True if we generate code to update MethodData*s 290254721Semaste int _AliasLevel; // Locally-adjusted version of AliasLevel flag. 291254721Semaste bool _print_assembly; // True if we should dump assembly code for this compilation 292254721Semaste#ifndef PRODUCT 293254721Semaste bool _trace_opto_output; 294254721Semaste bool _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing 295254721Semaste#endif 296254721Semaste 297254721Semaste // JSR 292 298254721Semaste bool _has_method_handle_invokes; // True if this method has MethodHandle invokes. 299254721Semaste 300254721Semaste // Compilation environment. 301254721Semaste Arena _comp_arena; // Arena with lifetime equivalent to Compile 302254721Semaste ciEnv* _env; // CI interface 303254721Semaste CompileLog* _log; // from CompilerThread 304254721Semaste const char* _failure_reason; // for record_failure/failing pattern 305254721Semaste GrowableArray<CallGenerator*>* _intrinsics; // List of intrinsics. 306254721Semaste GrowableArray<Node*>* _macro_nodes; // List of nodes which need to be expanded before matching. 307254721Semaste GrowableArray<Node*>* _predicate_opaqs; // List of Opaque1 nodes for the loop predicates. 308254721Semaste ConnectionGraph* _congraph; 309254721Semaste#ifndef PRODUCT 310254721Semaste IdealGraphPrinter* _printer; 311254721Semaste#endif 312254721Semaste 313254721Semaste // Node management 314254721Semaste uint _unique; // Counter for unique Node indices 315254721Semaste debug_only(static int _debug_idx;) // Monotonic counter (not reset), use -XX:BreakAtNode=<idx> 316254721Semaste Arena _node_arena; // Arena for new-space Nodes 317254721Semaste Arena _old_arena; // Arena for old-space Nodes, lifetime during xform 318254721Semaste RootNode* _root; // Unique root of compilation, or NULL after bail-out. 319254721Semaste Node* _top; // Unique top node. (Reset by various phases.) 320254721Semaste 321254721Semaste Node* _immutable_memory; // Initial memory state 322254721Semaste 323254721Semaste Node* _recent_alloc_obj; 324254721Semaste Node* _recent_alloc_ctl; 325254721Semaste 326254721Semaste // Constant table 327254721Semaste ConstantTable _constant_table; // The constant table for this compile. 328254721Semaste MachConstantBaseNode* _mach_constant_base_node; // Constant table base node singleton. 329254721Semaste 330254721Semaste 331254721Semaste // Blocked array of debugging and profiling information, 332254721Semaste // tracked per node. 333254721Semaste enum { _log2_node_notes_block_size = 8, 334254721Semaste _node_notes_block_size = (1<<_log2_node_notes_block_size) 335254721Semaste }; 336254721Semaste GrowableArray<Node_Notes*>* _node_note_array; 337254721Semaste Node_Notes* _default_node_notes; // default notes for new nodes 338254721Semaste 339254721Semaste // After parsing and every bulk phase we hang onto the Root instruction. 340254721Semaste // The RootNode instruction is where the whole program begins. It produces 341254721Semaste // the initial Control and BOTTOM for everybody else. 342254721Semaste 343254721Semaste // Type management 344254721Semaste Arena _Compile_types; // Arena for all types 345254721Semaste Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared() 346254721Semaste Dict* _type_dict; // Intern table 347254721Semaste void* _type_hwm; // Last allocation (see Type::operator new/delete) 348254721Semaste size_t _type_last_size; // Last allocation size (see Type::operator new/delete) 349254721Semaste ciMethod* _last_tf_m; // Cache for 350254721Semaste const TypeFunc* _last_tf; // TypeFunc::make 351254721Semaste AliasType** _alias_types; // List of alias types seen so far. 352254721Semaste int _num_alias_types; // Logical length of _alias_types 353254721Semaste int _max_alias_types; // Physical length of _alias_types 354254721Semaste AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking 355254721Semaste 356254721Semaste // Parsing, optimization 357254721Semaste PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN 358254721Semaste Unique_Node_List* _for_igvn; // Initial work-list for next round of Iterative GVN 359254721Semaste WarmCallInfo* _warm_calls; // Sorted work-list for heat-based inlining. 360254721Semaste 361254721Semaste GrowableArray<CallGenerator*> _late_inlines; // List of CallGenerators to be revisited after 362254721Semaste // main parsing has finished. 363254721Semaste 364254721Semaste // Matching, CFG layout, allocation, code generation 365254721Semaste PhaseCFG* _cfg; // Results of CFG finding 366254721Semaste bool _select_24_bit_instr; // We selected an instruction with a 24-bit result 367254721Semaste bool _in_24_bit_fp_mode; // We are emitting instructions with 24-bit results 368254721Semaste int _java_calls; // Number of java calls in the method 369254721Semaste int _inner_loops; // Number of inner loops in the method 370254721Semaste Matcher* _matcher; // Engine to map ideal to machine instructions 371254721Semaste PhaseRegAlloc* _regalloc; // Results of register allocation. 372254721Semaste int _frame_slots; // Size of total frame in stack slots 373254721Semaste CodeOffsets _code_offsets; // Offsets into the code for various interesting entries 374254721Semaste RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout) 375254721Semaste Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin 376254721Semaste void* _indexSet_free_block_list; // free list of IndexSet bit blocks 377254721Semaste 378254721Semaste uint _node_bundling_limit; 379254721Semaste Bundle* _node_bundling_base; // Information for instruction bundling 380254721Semaste 381254721Semaste // Instruction bits passed off to the VM 382254721Semaste int _method_size; // Size of nmethod code segment in bytes 383254721Semaste CodeBuffer _code_buffer; // Where the code is assembled 384254721Semaste int _first_block_size; // Size of unvalidated entry point code / OSR poison code 385254721Semaste ExceptionHandlerTable _handler_table; // Table of native-code exception handlers 386254721Semaste ImplicitExceptionTable _inc_table; // Table of implicit null checks in native code 387254721Semaste OopMapSet* _oop_map_set; // Table of oop maps (one for each safepoint location) 388254721Semaste static int _CompiledZap_count; // counter compared against CompileZap[First/Last] 389254721Semaste BufferBlob* _scratch_buffer_blob; // For temporary code buffers. 390254721Semaste relocInfo* _scratch_locs_memory; // For temporary code buffers. 391254721Semaste int _scratch_const_size; // For temporary code buffers. 392254721Semaste bool _in_scratch_emit_size; // true when in scratch_emit_size. 393254721Semaste 394254721Semaste public: 395 // Accessors 396 397 // The Compile instance currently active in this (compiler) thread. 398 static Compile* current() { 399 return (Compile*) ciEnv::current()->compiler_data(); 400 } 401 402 // ID for this compilation. Useful for setting breakpoints in the debugger. 403 int compile_id() const { return _compile_id; } 404 405 // Does this compilation allow instructions to subsume loads? User 406 // instructions that subsume a load may result in an unschedulable 407 // instruction sequence. 408 bool subsume_loads() const { return _subsume_loads; } 409 // Do escape analysis. 410 bool do_escape_analysis() const { return _do_escape_analysis; } 411 bool save_argument_registers() const { return _save_argument_registers; } 412 413 414 // Other fixed compilation parameters. 415 ciMethod* method() const { return _method; } 416 int entry_bci() const { return _entry_bci; } 417 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; } 418 bool is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); } 419 const TypeFunc* tf() const { assert(_tf!=NULL, ""); return _tf; } 420 void init_tf(const TypeFunc* tf) { assert(_tf==NULL, ""); _tf = tf; } 421 InlineTree* ilt() const { return _ilt; } 422 address stub_function() const { return _stub_function; } 423 const char* stub_name() const { return _stub_name; } 424 address stub_entry_point() const { return _stub_entry_point; } 425 426 // Control of this compilation. 427 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; } 428 void set_fixed_slots(int n) { _fixed_slots = n; } 429 int major_progress() const { return _major_progress; } 430 void set_major_progress() { _major_progress++; } 431 void clear_major_progress() { _major_progress = 0; } 432 int num_loop_opts() const { return _num_loop_opts; } 433 void set_num_loop_opts(int n) { _num_loop_opts = n; } 434 int max_inline_size() const { return _max_inline_size; } 435 void set_freq_inline_size(int n) { _freq_inline_size = n; } 436 int freq_inline_size() const { return _freq_inline_size; } 437 void set_max_inline_size(int n) { _max_inline_size = n; } 438 bool has_loops() const { return _has_loops; } 439 void set_has_loops(bool z) { _has_loops = z; } 440 bool has_split_ifs() const { return _has_split_ifs; } 441 void set_has_split_ifs(bool z) { _has_split_ifs = z; } 442 bool has_unsafe_access() const { return _has_unsafe_access; } 443 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; } 444 bool has_stringbuilder() const { return _has_stringbuilder; } 445 void set_has_stringbuilder(bool z) { _has_stringbuilder = z; } 446 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; } 447 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; } 448 bool trap_can_recompile() const { return _trap_can_recompile; } 449 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; } 450 uint decompile_count() const { return _decompile_count; } 451 void set_decompile_count(uint c) { _decompile_count = c; } 452 bool allow_range_check_smearing() const; 453 bool do_inlining() const { return _do_inlining; } 454 void set_do_inlining(bool z) { _do_inlining = z; } 455 bool do_scheduling() const { return _do_scheduling; } 456 void set_do_scheduling(bool z) { _do_scheduling = z; } 457 bool do_freq_based_layout() const{ return _do_freq_based_layout; } 458 void set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; } 459 bool do_count_invocations() const{ return _do_count_invocations; } 460 void set_do_count_invocations(bool z){ _do_count_invocations = z; } 461 bool do_method_data_update() const { return _do_method_data_update; } 462 void set_do_method_data_update(bool z) { _do_method_data_update = z; } 463 int AliasLevel() const { return _AliasLevel; } 464 bool print_assembly() const { return _print_assembly; } 465 void set_print_assembly(bool z) { _print_assembly = z; } 466 // check the CompilerOracle for special behaviours for this compile 467 bool method_has_option(const char * option) { 468 return method() != NULL && method()->has_option(option); 469 } 470#ifndef PRODUCT 471 bool trace_opto_output() const { return _trace_opto_output; } 472 bool parsed_irreducible_loop() const { return _parsed_irreducible_loop; } 473 void set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; } 474#endif 475 476 // JSR 292 477 bool has_method_handle_invokes() const { return _has_method_handle_invokes; } 478 void set_has_method_handle_invokes(bool z) { _has_method_handle_invokes = z; } 479 480 void begin_method() { 481#ifndef PRODUCT 482 if (_printer) _printer->begin_method(this); 483#endif 484 } 485 void print_method(const char * name, int level = 1) { 486#ifndef PRODUCT 487 if (_printer) _printer->print_method(this, name, level); 488#endif 489 } 490 void end_method() { 491#ifndef PRODUCT 492 if (_printer) _printer->end_method(); 493#endif 494 } 495 496 int macro_count() { return _macro_nodes->length(); } 497 int predicate_count() { return _predicate_opaqs->length();} 498 Node* macro_node(int idx) { return _macro_nodes->at(idx); } 499 Node* predicate_opaque1_node(int idx) { return _predicate_opaqs->at(idx);} 500 ConnectionGraph* congraph() { return _congraph;} 501 void set_congraph(ConnectionGraph* congraph) { _congraph = congraph;} 502 void add_macro_node(Node * n) { 503 //assert(n->is_macro(), "must be a macro node"); 504 assert(!_macro_nodes->contains(n), " duplicate entry in expand list"); 505 _macro_nodes->append(n); 506 } 507 void remove_macro_node(Node * n) { 508 // this function may be called twice for a node so check 509 // that the node is in the array before attempting to remove it 510 if (_macro_nodes->contains(n)) 511 _macro_nodes->remove(n); 512 // remove from _predicate_opaqs list also if it is there 513 if (predicate_count() > 0 && _predicate_opaqs->contains(n)){ 514 _predicate_opaqs->remove(n); 515 } 516 } 517 void add_predicate_opaq(Node * n) { 518 assert(!_predicate_opaqs->contains(n), " duplicate entry in predicate opaque1"); 519 assert(_macro_nodes->contains(n), "should have already been in macro list"); 520 _predicate_opaqs->append(n); 521 } 522 // remove the opaque nodes that protect the predicates so that the unused checks and 523 // uncommon traps will be eliminated from the graph. 524 void cleanup_loop_predicates(PhaseIterGVN &igvn); 525 bool is_predicate_opaq(Node * n) { 526 return _predicate_opaqs->contains(n); 527 } 528 529 // Compilation environment. 530 Arena* comp_arena() { return &_comp_arena; } 531 ciEnv* env() const { return _env; } 532 CompileLog* log() const { return _log; } 533 bool failing() const { return _env->failing() || _failure_reason != NULL; } 534 const char* failure_reason() { return _failure_reason; } 535 bool failure_reason_is(const char* r) { return (r==_failure_reason) || (r!=NULL && _failure_reason!=NULL && strcmp(r, _failure_reason)==0); } 536 537 void record_failure(const char* reason); 538 void record_method_not_compilable(const char* reason, bool all_tiers = false) { 539 // All bailouts cover "all_tiers" when TieredCompilation is off. 540 if (!TieredCompilation) all_tiers = true; 541 env()->record_method_not_compilable(reason, all_tiers); 542 // Record failure reason. 543 record_failure(reason); 544 } 545 void record_method_not_compilable_all_tiers(const char* reason) { 546 record_method_not_compilable(reason, true); 547 } 548 bool check_node_count(uint margin, const char* reason) { 549 if (unique() + margin > (uint)MaxNodeLimit) { 550 record_method_not_compilable(reason); 551 return true; 552 } else { 553 return false; 554 } 555 } 556 557 // Node management 558 uint unique() const { return _unique; } 559 uint next_unique() { return _unique++; } 560 void set_unique(uint i) { _unique = i; } 561 static int debug_idx() { return debug_only(_debug_idx)+0; } 562 static void set_debug_idx(int i) { debug_only(_debug_idx = i); } 563 Arena* node_arena() { return &_node_arena; } 564 Arena* old_arena() { return &_old_arena; } 565 RootNode* root() const { return _root; } 566 void set_root(RootNode* r) { _root = r; } 567 StartNode* start() const; // (Derived from root.) 568 void init_start(StartNode* s); 569 Node* immutable_memory(); 570 571 Node* recent_alloc_ctl() const { return _recent_alloc_ctl; } 572 Node* recent_alloc_obj() const { return _recent_alloc_obj; } 573 void set_recent_alloc(Node* ctl, Node* obj) { 574 _recent_alloc_ctl = ctl; 575 _recent_alloc_obj = obj; 576 } 577 578 // Constant table 579 ConstantTable& constant_table() { return _constant_table; } 580 581 MachConstantBaseNode* mach_constant_base_node(); 582 bool has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; } 583 584 // Handy undefined Node 585 Node* top() const { return _top; } 586 587 // these are used by guys who need to know about creation and transformation of top: 588 Node* cached_top_node() { return _top; } 589 void set_cached_top_node(Node* tn); 590 591 GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; } 592 void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; } 593 Node_Notes* default_node_notes() const { return _default_node_notes; } 594 void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; } 595 596 Node_Notes* node_notes_at(int idx) { 597 return locate_node_notes(_node_note_array, idx, false); 598 } 599 inline bool set_node_notes_at(int idx, Node_Notes* value); 600 601 // Copy notes from source to dest, if they exist. 602 // Overwrite dest only if source provides something. 603 // Return true if information was moved. 604 bool copy_node_notes_to(Node* dest, Node* source); 605 606 // Workhorse function to sort out the blocked Node_Notes array: 607 inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr, 608 int idx, bool can_grow = false); 609 610 void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by); 611 612 // Type management 613 Arena* type_arena() { return _type_arena; } 614 Dict* type_dict() { return _type_dict; } 615 void* type_hwm() { return _type_hwm; } 616 size_t type_last_size() { return _type_last_size; } 617 int num_alias_types() { return _num_alias_types; } 618 619 void init_type_arena() { _type_arena = &_Compile_types; } 620 void set_type_arena(Arena* a) { _type_arena = a; } 621 void set_type_dict(Dict* d) { _type_dict = d; } 622 void set_type_hwm(void* p) { _type_hwm = p; } 623 void set_type_last_size(size_t sz) { _type_last_size = sz; } 624 625 const TypeFunc* last_tf(ciMethod* m) { 626 return (m == _last_tf_m) ? _last_tf : NULL; 627 } 628 void set_last_tf(ciMethod* m, const TypeFunc* tf) { 629 assert(m != NULL || tf == NULL, ""); 630 _last_tf_m = m; 631 _last_tf = tf; 632 } 633 634 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; } 635 AliasType* alias_type(const TypePtr* adr_type, ciField* field = NULL) { return find_alias_type(adr_type, false, field); } 636 bool have_alias_type(const TypePtr* adr_type); 637 AliasType* alias_type(ciField* field); 638 639 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); } 640 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); } 641 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); } 642 643 // Building nodes 644 void rethrow_exceptions(JVMState* jvms); 645 void return_values(JVMState* jvms); 646 JVMState* build_start_state(StartNode* start, const TypeFunc* tf); 647 648 // Decide how to build a call. 649 // The profile factor is a discount to apply to this site's interp. profile. 650 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_is_virtual, JVMState* jvms, bool allow_inline, float profile_factor, bool allow_intrinsics = true); 651 bool should_delay_inlining(ciMethod* call_method, JVMState* jvms); 652 653 // Report if there were too many traps at a current method and bci. 654 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded. 655 // If there is no MDO at all, report no trap unless told to assume it. 656 bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason); 657 // This version, unspecific to a particular bci, asks if 658 // PerMethodTrapLimit was exceeded for all inlined methods seen so far. 659 bool too_many_traps(Deoptimization::DeoptReason reason, 660 // Privately used parameter for logging: 661 ciMethodData* logmd = NULL); 662 // Report if there were too many recompiles at a method and bci. 663 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason); 664 665 // Parsing, optimization 666 PhaseGVN* initial_gvn() { return _initial_gvn; } 667 Unique_Node_List* for_igvn() { return _for_igvn; } 668 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List. 669 void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; } 670 void set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; } 671 672 // Replace n by nn using initial_gvn, calling hash_delete and 673 // record_for_igvn as needed. 674 void gvn_replace_by(Node* n, Node* nn); 675 676 677 void identify_useful_nodes(Unique_Node_List &useful); 678 void remove_useless_nodes (Unique_Node_List &useful); 679 680 WarmCallInfo* warm_calls() const { return _warm_calls; } 681 void set_warm_calls(WarmCallInfo* l) { _warm_calls = l; } 682 WarmCallInfo* pop_warm_call(); 683 684 // Record this CallGenerator for inlining at the end of parsing. 685 void add_late_inline(CallGenerator* cg) { _late_inlines.push(cg); } 686 687 // Matching, CFG layout, allocation, code generation 688 PhaseCFG* cfg() { return _cfg; } 689 bool select_24_bit_instr() const { return _select_24_bit_instr; } 690 bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; } 691 bool has_java_calls() const { return _java_calls > 0; } 692 int java_calls() const { return _java_calls; } 693 int inner_loops() const { return _inner_loops; } 694 Matcher* matcher() { return _matcher; } 695 PhaseRegAlloc* regalloc() { return _regalloc; } 696 int frame_slots() const { return _frame_slots; } 697 int frame_size_in_words() const; // frame_slots in units of the polymorphic 'words' 698 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; } 699 Arena* indexSet_arena() { return _indexSet_arena; } 700 void* indexSet_free_block_list() { return _indexSet_free_block_list; } 701 uint node_bundling_limit() { return _node_bundling_limit; } 702 Bundle* node_bundling_base() { return _node_bundling_base; } 703 void set_node_bundling_limit(uint n) { _node_bundling_limit = n; } 704 void set_node_bundling_base(Bundle* b) { _node_bundling_base = b; } 705 bool starts_bundle(const Node *n) const; 706 bool need_stack_bang(int frame_size_in_bytes) const; 707 bool need_register_stack_bang() const; 708 709 void set_matcher(Matcher* m) { _matcher = m; } 710//void set_regalloc(PhaseRegAlloc* ra) { _regalloc = ra; } 711 void set_indexSet_arena(Arena* a) { _indexSet_arena = a; } 712 void set_indexSet_free_block_list(void* p) { _indexSet_free_block_list = p; } 713 714 // Remember if this compilation changes hardware mode to 24-bit precision 715 void set_24_bit_selection_and_mode(bool selection, bool mode) { 716 _select_24_bit_instr = selection; 717 _in_24_bit_fp_mode = mode; 718 } 719 720 void set_java_calls(int z) { _java_calls = z; } 721 void set_inner_loops(int z) { _inner_loops = z; } 722 723 // Instruction bits passed off to the VM 724 int code_size() { return _method_size; } 725 CodeBuffer* code_buffer() { return &_code_buffer; } 726 int first_block_size() { return _first_block_size; } 727 void set_frame_complete(int off) { _code_offsets.set_value(CodeOffsets::Frame_Complete, off); } 728 ExceptionHandlerTable* handler_table() { return &_handler_table; } 729 ImplicitExceptionTable* inc_table() { return &_inc_table; } 730 OopMapSet* oop_map_set() { return _oop_map_set; } 731 DebugInformationRecorder* debug_info() { return env()->debug_info(); } 732 Dependencies* dependencies() { return env()->dependencies(); } 733 static int CompiledZap_count() { return _CompiledZap_count; } 734 BufferBlob* scratch_buffer_blob() { return _scratch_buffer_blob; } 735 void init_scratch_buffer_blob(int const_size); 736 void clear_scratch_buffer_blob(); 737 void set_scratch_buffer_blob(BufferBlob* b) { _scratch_buffer_blob = b; } 738 relocInfo* scratch_locs_memory() { return _scratch_locs_memory; } 739 void set_scratch_locs_memory(relocInfo* b) { _scratch_locs_memory = b; } 740 741 // emit to scratch blob, report resulting size 742 uint scratch_emit_size(const Node* n); 743 void set_in_scratch_emit_size(bool x) { _in_scratch_emit_size = x; } 744 bool in_scratch_emit_size() const { return _in_scratch_emit_size; } 745 746 enum ScratchBufferBlob { 747 MAX_inst_size = 1024, 748 MAX_locs_size = 128, // number of relocInfo elements 749 MAX_const_size = 128, 750 MAX_stubs_size = 128 751 }; 752 753 // Major entry point. Given a Scope, compile the associated method. 754 // For normal compilations, entry_bci is InvocationEntryBci. For on stack 755 // replacement, entry_bci indicates the bytecode for which to compile a 756 // continuation. 757 Compile(ciEnv* ci_env, C2Compiler* compiler, ciMethod* target, 758 int entry_bci, bool subsume_loads, bool do_escape_analysis); 759 760 // Second major entry point. From the TypeFunc signature, generate code 761 // to pass arguments from the Java calling convention to the C calling 762 // convention. 763 Compile(ciEnv* ci_env, const TypeFunc *(*gen)(), 764 address stub_function, const char *stub_name, 765 int is_fancy_jump, bool pass_tls, 766 bool save_arg_registers, bool return_pc); 767 768 // From the TypeFunc signature, generate code to pass arguments 769 // from Compiled calling convention to Interpreter's calling convention 770 void Generate_Compiled_To_Interpreter_Graph(const TypeFunc *tf, address interpreter_entry); 771 772 // From the TypeFunc signature, generate code to pass arguments 773 // from Interpreter's calling convention to Compiler's calling convention 774 void Generate_Interpreter_To_Compiled_Graph(const TypeFunc *tf); 775 776 // Are we compiling a method? 777 bool has_method() { return method() != NULL; } 778 779 // Maybe print some information about this compile. 780 void print_compile_messages(); 781 782 // Final graph reshaping, a post-pass after the regular optimizer is done. 783 bool final_graph_reshaping(); 784 785 // returns true if adr is completely contained in the given alias category 786 bool must_alias(const TypePtr* adr, int alias_idx); 787 788 // returns true if adr overlaps with the given alias category 789 bool can_alias(const TypePtr* adr, int alias_idx); 790 791 // Driver for converting compiler's IR into machine code bits 792 void Output(); 793 794 // Accessors for node bundling info. 795 Bundle* node_bundling(const Node *n); 796 bool valid_bundle_info(const Node *n); 797 798 // Schedule and Bundle the instructions 799 void ScheduleAndBundle(); 800 801 // Build OopMaps for each GC point 802 void BuildOopMaps(); 803 804 // Append debug info for the node "local" at safepoint node "sfpt" to the 805 // "array", May also consult and add to "objs", which describes the 806 // scalar-replaced objects. 807 void FillLocArray( int idx, MachSafePointNode* sfpt, 808 Node *local, GrowableArray<ScopeValue*> *array, 809 GrowableArray<ScopeValue*> *objs ); 810 811 // If "objs" contains an ObjectValue whose id is "id", returns it, else NULL. 812 static ObjectValue* sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id); 813 // Requres that "objs" does not contains an ObjectValue whose id matches 814 // that of "sv. Appends "sv". 815 static void set_sv_for_object_node(GrowableArray<ScopeValue*> *objs, 816 ObjectValue* sv ); 817 818 // Process an OopMap Element while emitting nodes 819 void Process_OopMap_Node(MachNode *mach, int code_offset); 820 821 // Initialize code buffer 822 CodeBuffer* init_buffer(uint* blk_starts); 823 824 // Write out basic block data to code buffer 825 void fill_buffer(CodeBuffer* cb, uint* blk_starts); 826 827 // Determine which variable sized branches can be shortened 828 void shorten_branches(uint* blk_starts, int& code_size, int& reloc_size, int& stub_size); 829 830 // Compute the size of first NumberOfLoopInstrToAlign instructions 831 // at the head of a loop. 832 void compute_loop_first_inst_sizes(); 833 834 // Compute the information for the exception tables 835 void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels); 836 837 // Stack slots that may be unused by the calling convention but must 838 // otherwise be preserved. On Intel this includes the return address. 839 // On PowerPC it includes the 4 words holding the old TOC & LR glue. 840 uint in_preserve_stack_slots(); 841 842 // "Top of Stack" slots that may be unused by the calling convention but must 843 // otherwise be preserved. 844 // On Intel these are not necessary and the value can be zero. 845 // On Sparc this describes the words reserved for storing a register window 846 // when an interrupt occurs. 847 static uint out_preserve_stack_slots(); 848 849 // Number of outgoing stack slots killed above the out_preserve_stack_slots 850 // for calls to C. Supports the var-args backing area for register parms. 851 uint varargs_C_out_slots_killed() const; 852 853 // Number of Stack Slots consumed by a synchronization entry 854 int sync_stack_slots() const; 855 856 // Compute the name of old_SP. See <arch>.ad for frame layout. 857 OptoReg::Name compute_old_SP(); 858 859#ifdef ENABLE_ZAP_DEAD_LOCALS 860 static bool is_node_getting_a_safepoint(Node*); 861 void Insert_zap_nodes(); 862 Node* call_zap_node(MachSafePointNode* n, int block_no); 863#endif 864 865 private: 866 // Phase control: 867 void Init(int aliaslevel); // Prepare for a single compilation 868 int Inline_Warm(); // Find more inlining work. 869 void Finish_Warm(); // Give up on further inlines. 870 void Optimize(); // Given a graph, optimize it 871 void Code_Gen(); // Generate code from a graph 872 873 // Management of the AliasType table. 874 void grow_alias_types(); 875 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type); 876 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const; 877 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field); 878 879 void verify_top(Node*) const PRODUCT_RETURN; 880 881 // Intrinsic setup. 882 void register_library_intrinsics(); // initializer 883 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor 884 int intrinsic_insertion_index(ciMethod* m, bool is_virtual); // helper 885 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn 886 void register_intrinsic(CallGenerator* cg); // update fn 887 888#ifndef PRODUCT 889 static juint _intrinsic_hist_count[vmIntrinsics::ID_LIMIT]; 890 static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT]; 891#endif 892 893 public: 894 895 // Note: Histogram array size is about 1 Kb. 896 enum { // flag bits: 897 _intrinsic_worked = 1, // succeeded at least once 898 _intrinsic_failed = 2, // tried it but it failed 899 _intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps) 900 _intrinsic_virtual = 8, // was seen in the virtual form (rare) 901 _intrinsic_both = 16 // was seen in the non-virtual form (usual) 902 }; 903 // Update histogram. Return boolean if this is a first-time occurrence. 904 static bool gather_intrinsic_statistics(vmIntrinsics::ID id, 905 bool is_virtual, int flags) PRODUCT_RETURN0; 906 static void print_intrinsic_statistics() PRODUCT_RETURN; 907 908 // Graph verification code 909 // Walk the node list, verifying that there is a one-to-one 910 // correspondence between Use-Def edges and Def-Use edges 911 // The option no_dead_code enables stronger checks that the 912 // graph is strongly connected from root in both directions. 913 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN; 914 915 // End-of-run dumps. 916 static void print_statistics() PRODUCT_RETURN; 917 918 // Dump formatted assembly 919 void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN; 920 void dump_pc(int *pcs, int pc_limit, Node *n); 921 922 // Verify ADLC assumptions during startup 923 static void adlc_verification() PRODUCT_RETURN; 924 925 // Definitions of pd methods 926 static void pd_compiler2_init(); 927}; 928 929#endif // SHARE_VM_OPTO_COMPILE_HPP 930