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