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