annotate src/share/vm/opto/compile.hpp @ 5223:edb5ab0f3fe5

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