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