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