annotate src/share/vm/opto/compile.hpp @ 4154:8b3da8d14c93

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