annotate src/share/vm/opto/compile.hpp @ 4675:6f3fd5150b67

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