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