annotate src/share/vm/opto/compile.hpp @ 63:eac007780a58

6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint Summary: Values of non-static fields of a scalarized object should be saved in debug info to reallocate the object during deoptimization. Reviewed-by: never
author kvn
date Thu, 13 Mar 2008 16:06:34 -0700
parents b789bcaf2dd9
children 99269dbf4ba8
rev   line source
duke@0 1 /*
duke@0 2 * Copyright 1997-2007 Sun Microsystems, Inc. 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 *
duke@0 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@0 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@0 21 * have any questions.
duke@0 22 *
duke@0 23 */
duke@0 24
duke@0 25 class Block;
duke@0 26 class Bundle;
duke@0 27 class C2Compiler;
duke@0 28 class CallGenerator;
duke@0 29 class ConnectionGraph;
duke@0 30 class InlineTree;
duke@0 31 class Int_Array;
duke@0 32 class Matcher;
duke@0 33 class MachNode;
kvn@38 34 class MachSafePointNode;
duke@0 35 class Node;
duke@0 36 class Node_Array;
duke@0 37 class Node_Notes;
duke@0 38 class OptoReg;
duke@0 39 class PhaseCFG;
duke@0 40 class PhaseGVN;
duke@0 41 class PhaseRegAlloc;
duke@0 42 class PhaseCCP;
duke@0 43 class PhaseCCP_DCE;
duke@0 44 class RootNode;
duke@0 45 class relocInfo;
duke@0 46 class Scope;
duke@0 47 class StartNode;
duke@0 48 class SafePointNode;
duke@0 49 class JVMState;
duke@0 50 class TypeData;
duke@0 51 class TypePtr;
duke@0 52 class TypeFunc;
duke@0 53 class Unique_Node_List;
duke@0 54 class nmethod;
duke@0 55 class WarmCallInfo;
duke@0 56
duke@0 57 //------------------------------Compile----------------------------------------
duke@0 58 // This class defines a top-level Compiler invocation.
duke@0 59
duke@0 60 class Compile : public Phase {
duke@0 61 public:
duke@0 62 // Fixed alias indexes. (See also MergeMemNode.)
duke@0 63 enum {
duke@0 64 AliasIdxTop = 1, // pseudo-index, aliases to nothing (used as sentinel value)
duke@0 65 AliasIdxBot = 2, // pseudo-index, aliases to everything
duke@0 66 AliasIdxRaw = 3 // hard-wired index for TypeRawPtr::BOTTOM
duke@0 67 };
duke@0 68
duke@0 69 // Variant of TraceTime(NULL, &_t_accumulator, TimeCompiler);
duke@0 70 // Integrated with logging. If logging is turned on, and dolog is true,
duke@0 71 // then brackets are put into the log, with time stamps and node counts.
duke@0 72 // (The time collection itself is always conditionalized on TimeCompiler.)
duke@0 73 class TracePhase : public TraceTime {
duke@0 74 private:
duke@0 75 Compile* C;
duke@0 76 CompileLog* _log;
duke@0 77 public:
duke@0 78 TracePhase(const char* name, elapsedTimer* accumulator, bool dolog);
duke@0 79 ~TracePhase();
duke@0 80 };
duke@0 81
duke@0 82 // Information per category of alias (memory slice)
duke@0 83 class AliasType {
duke@0 84 private:
duke@0 85 friend class Compile;
duke@0 86
duke@0 87 int _index; // unique index, used with MergeMemNode
duke@0 88 const TypePtr* _adr_type; // normalized address type
duke@0 89 ciField* _field; // relevant instance field, or null if none
duke@0 90 bool _is_rewritable; // false if the memory is write-once only
duke@0 91 int _general_index; // if this is type is an instance, the general
duke@0 92 // type that this is an instance of
duke@0 93
duke@0 94 void Init(int i, const TypePtr* at);
duke@0 95
duke@0 96 public:
duke@0 97 int index() const { return _index; }
duke@0 98 const TypePtr* adr_type() const { return _adr_type; }
duke@0 99 ciField* field() const { return _field; }
duke@0 100 bool is_rewritable() const { return _is_rewritable; }
duke@0 101 bool is_volatile() const { return (_field ? _field->is_volatile() : false); }
duke@0 102 int general_index() const { return (_general_index != 0) ? _general_index : _index; }
duke@0 103
duke@0 104 void set_rewritable(bool z) { _is_rewritable = z; }
duke@0 105 void set_field(ciField* f) {
duke@0 106 assert(!_field,"");
duke@0 107 _field = f;
duke@0 108 if (f->is_final()) _is_rewritable = false;
duke@0 109 }
duke@0 110
duke@0 111 void print_on(outputStream* st) PRODUCT_RETURN;
duke@0 112 };
duke@0 113
duke@0 114 enum {
duke@0 115 logAliasCacheSize = 6,
duke@0 116 AliasCacheSize = (1<<logAliasCacheSize)
duke@0 117 };
duke@0 118 struct AliasCacheEntry { const TypePtr* _adr_type; int _index; }; // simple duple type
duke@0 119 enum {
duke@0 120 trapHistLength = methodDataOopDesc::_trap_hist_limit
duke@0 121 };
duke@0 122
duke@0 123 private:
duke@0 124 // Fixed parameters to this compilation.
duke@0 125 const int _compile_id;
duke@0 126 const bool _save_argument_registers; // save/restore arg regs for trampolines
duke@0 127 const bool _subsume_loads; // Load can be matched as part of a larger op.
kvn@38 128 const bool _do_escape_analysis; // Do escape analysis.
duke@0 129 ciMethod* _method; // The method being compiled.
duke@0 130 int _entry_bci; // entry bci for osr methods.
duke@0 131 const TypeFunc* _tf; // My kind of signature
duke@0 132 InlineTree* _ilt; // Ditto (temporary).
duke@0 133 address _stub_function; // VM entry for stub being compiled, or NULL
duke@0 134 const char* _stub_name; // Name of stub or adapter being compiled, or NULL
duke@0 135 address _stub_entry_point; // Compile code entry for generated stub, or NULL
duke@0 136
duke@0 137 // Control of this compilation.
duke@0 138 int _num_loop_opts; // Number of iterations for doing loop optimiztions
duke@0 139 int _max_inline_size; // Max inline size for this compilation
duke@0 140 int _freq_inline_size; // Max hot method inline size for this compilation
duke@0 141 int _fixed_slots; // count of frame slots not allocated by the register
duke@0 142 // allocator i.e. locks, original deopt pc, etc.
duke@0 143 // For deopt
duke@0 144 int _orig_pc_slot;
duke@0 145 int _orig_pc_slot_offset_in_bytes;
duke@0 146
duke@0 147 int _major_progress; // Count of something big happening
duke@0 148 bool _deopt_happens; // TRUE if de-optimization CAN happen
duke@0 149 bool _has_loops; // True if the method _may_ have some loops
duke@0 150 bool _has_split_ifs; // True if the method _may_ have some split-if
duke@0 151 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
duke@0 152 uint _trap_hist[trapHistLength]; // Cumulative traps
duke@0 153 bool _trap_can_recompile; // Have we emitted a recompiling trap?
duke@0 154 uint _decompile_count; // Cumulative decompilation counts.
duke@0 155 bool _do_inlining; // True if we intend to do inlining
duke@0 156 bool _do_scheduling; // True if we intend to do scheduling
duke@0 157 bool _do_count_invocations; // True if we generate code to count invocations
duke@0 158 bool _do_method_data_update; // True if we generate code to update methodDataOops
duke@0 159 int _AliasLevel; // Locally-adjusted version of AliasLevel flag.
duke@0 160 bool _print_assembly; // True if we should dump assembly code for this compilation
duke@0 161 #ifndef PRODUCT
duke@0 162 bool _trace_opto_output;
duke@0 163 #endif
duke@0 164
duke@0 165 // Compilation environment.
duke@0 166 Arena _comp_arena; // Arena with lifetime equivalent to Compile
duke@0 167 ciEnv* _env; // CI interface
duke@0 168 CompileLog* _log; // from CompilerThread
duke@0 169 const char* _failure_reason; // for record_failure/failing pattern
duke@0 170 GrowableArray<CallGenerator*>* _intrinsics; // List of intrinsics.
duke@0 171 GrowableArray<Node*>* _macro_nodes; // List of nodes which need to be expanded before matching.
duke@0 172 ConnectionGraph* _congraph;
duke@0 173 #ifndef PRODUCT
duke@0 174 IdealGraphPrinter* _printer;
duke@0 175 #endif
duke@0 176
duke@0 177 // Node management
duke@0 178 uint _unique; // Counter for unique Node indices
duke@0 179 debug_only(static int _debug_idx;) // Monotonic counter (not reset), use -XX:BreakAtNode=<idx>
duke@0 180 Arena _node_arena; // Arena for new-space Nodes
duke@0 181 Arena _old_arena; // Arena for old-space Nodes, lifetime during xform
duke@0 182 RootNode* _root; // Unique root of compilation, or NULL after bail-out.
duke@0 183 Node* _top; // Unique top node. (Reset by various phases.)
duke@0 184
duke@0 185 Node* _immutable_memory; // Initial memory state
duke@0 186
duke@0 187 Node* _recent_alloc_obj;
duke@0 188 Node* _recent_alloc_ctl;
duke@0 189
duke@0 190 // Blocked array of debugging and profiling information,
duke@0 191 // tracked per node.
duke@0 192 enum { _log2_node_notes_block_size = 8,
duke@0 193 _node_notes_block_size = (1<<_log2_node_notes_block_size)
duke@0 194 };
duke@0 195 GrowableArray<Node_Notes*>* _node_note_array;
duke@0 196 Node_Notes* _default_node_notes; // default notes for new nodes
duke@0 197
duke@0 198 // After parsing and every bulk phase we hang onto the Root instruction.
duke@0 199 // The RootNode instruction is where the whole program begins. It produces
duke@0 200 // the initial Control and BOTTOM for everybody else.
duke@0 201
duke@0 202 // Type management
duke@0 203 Arena _Compile_types; // Arena for all types
duke@0 204 Arena* _type_arena; // Alias for _Compile_types except in Initialize_shared()
duke@0 205 Dict* _type_dict; // Intern table
duke@0 206 void* _type_hwm; // Last allocation (see Type::operator new/delete)
duke@0 207 size_t _type_last_size; // Last allocation size (see Type::operator new/delete)
duke@0 208 ciMethod* _last_tf_m; // Cache for
duke@0 209 const TypeFunc* _last_tf; // TypeFunc::make
duke@0 210 AliasType** _alias_types; // List of alias types seen so far.
duke@0 211 int _num_alias_types; // Logical length of _alias_types
duke@0 212 int _max_alias_types; // Physical length of _alias_types
duke@0 213 AliasCacheEntry _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
duke@0 214
duke@0 215 // Parsing, optimization
duke@0 216 PhaseGVN* _initial_gvn; // Results of parse-time PhaseGVN
duke@0 217 Unique_Node_List* _for_igvn; // Initial work-list for next round of Iterative GVN
duke@0 218 WarmCallInfo* _warm_calls; // Sorted work-list for heat-based inlining.
duke@0 219
duke@0 220 // Matching, CFG layout, allocation, code generation
duke@0 221 PhaseCFG* _cfg; // Results of CFG finding
duke@0 222 bool _select_24_bit_instr; // We selected an instruction with a 24-bit result
duke@0 223 bool _in_24_bit_fp_mode; // We are emitting instructions with 24-bit results
duke@0 224 bool _has_java_calls; // True if the method has java calls
duke@0 225 Matcher* _matcher; // Engine to map ideal to machine instructions
duke@0 226 PhaseRegAlloc* _regalloc; // Results of register allocation.
duke@0 227 int _frame_slots; // Size of total frame in stack slots
duke@0 228 CodeOffsets _code_offsets; // Offsets into the code for various interesting entries
duke@0 229 RegMask _FIRST_STACK_mask; // All stack slots usable for spills (depends on frame layout)
duke@0 230 Arena* _indexSet_arena; // control IndexSet allocation within PhaseChaitin
duke@0 231 void* _indexSet_free_block_list; // free list of IndexSet bit blocks
duke@0 232
duke@0 233 uint _node_bundling_limit;
duke@0 234 Bundle* _node_bundling_base; // Information for instruction bundling
duke@0 235
duke@0 236 // Instruction bits passed off to the VM
duke@0 237 int _method_size; // Size of nmethod code segment in bytes
duke@0 238 CodeBuffer _code_buffer; // Where the code is assembled
duke@0 239 int _first_block_size; // Size of unvalidated entry point code / OSR poison code
duke@0 240 ExceptionHandlerTable _handler_table; // Table of native-code exception handlers
duke@0 241 ImplicitExceptionTable _inc_table; // Table of implicit null checks in native code
duke@0 242 OopMapSet* _oop_map_set; // Table of oop maps (one for each safepoint location)
duke@0 243 static int _CompiledZap_count; // counter compared against CompileZap[First/Last]
duke@0 244 BufferBlob* _scratch_buffer_blob; // For temporary code buffers.
duke@0 245 relocInfo* _scratch_locs_memory; // For temporary code buffers.
duke@0 246
duke@0 247 public:
duke@0 248 // Accessors
duke@0 249
duke@0 250 // The Compile instance currently active in this (compiler) thread.
duke@0 251 static Compile* current() {
duke@0 252 return (Compile*) ciEnv::current()->compiler_data();
duke@0 253 }
duke@0 254
duke@0 255 // ID for this compilation. Useful for setting breakpoints in the debugger.
duke@0 256 int compile_id() const { return _compile_id; }
duke@0 257
duke@0 258 // Does this compilation allow instructions to subsume loads? User
duke@0 259 // instructions that subsume a load may result in an unschedulable
duke@0 260 // instruction sequence.
duke@0 261 bool subsume_loads() const { return _subsume_loads; }
kvn@38 262 // Do escape analysis.
kvn@38 263 bool do_escape_analysis() const { return _do_escape_analysis; }
duke@0 264 bool save_argument_registers() const { return _save_argument_registers; }
duke@0 265
duke@0 266
duke@0 267 // Other fixed compilation parameters.
duke@0 268 ciMethod* method() const { return _method; }
duke@0 269 int entry_bci() const { return _entry_bci; }
duke@0 270 bool is_osr_compilation() const { return _entry_bci != InvocationEntryBci; }
duke@0 271 bool is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); }
duke@0 272 const TypeFunc* tf() const { assert(_tf!=NULL, ""); return _tf; }
duke@0 273 void init_tf(const TypeFunc* tf) { assert(_tf==NULL, ""); _tf = tf; }
duke@0 274 InlineTree* ilt() const { return _ilt; }
duke@0 275 address stub_function() const { return _stub_function; }
duke@0 276 const char* stub_name() const { return _stub_name; }
duke@0 277 address stub_entry_point() const { return _stub_entry_point; }
duke@0 278
duke@0 279 // Control of this compilation.
duke@0 280 int fixed_slots() const { assert(_fixed_slots >= 0, ""); return _fixed_slots; }
duke@0 281 void set_fixed_slots(int n) { _fixed_slots = n; }
duke@0 282 int major_progress() const { return _major_progress; }
duke@0 283 void set_major_progress() { _major_progress++; }
duke@0 284 void clear_major_progress() { _major_progress = 0; }
duke@0 285 int num_loop_opts() const { return _num_loop_opts; }
duke@0 286 void set_num_loop_opts(int n) { _num_loop_opts = n; }
duke@0 287 int max_inline_size() const { return _max_inline_size; }
duke@0 288 void set_freq_inline_size(int n) { _freq_inline_size = n; }
duke@0 289 int freq_inline_size() const { return _freq_inline_size; }
duke@0 290 void set_max_inline_size(int n) { _max_inline_size = n; }
duke@0 291 bool deopt_happens() const { return _deopt_happens; }
duke@0 292 bool has_loops() const { return _has_loops; }
duke@0 293 void set_has_loops(bool z) { _has_loops = z; }
duke@0 294 bool has_split_ifs() const { return _has_split_ifs; }
duke@0 295 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
duke@0 296 bool has_unsafe_access() const { return _has_unsafe_access; }
duke@0 297 void set_has_unsafe_access(bool z) { _has_unsafe_access = z; }
duke@0 298 void set_trap_count(uint r, uint c) { assert(r < trapHistLength, "oob"); _trap_hist[r] = c; }
duke@0 299 uint trap_count(uint r) const { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
duke@0 300 bool trap_can_recompile() const { return _trap_can_recompile; }
duke@0 301 void set_trap_can_recompile(bool z) { _trap_can_recompile = z; }
duke@0 302 uint decompile_count() const { return _decompile_count; }
duke@0 303 void set_decompile_count(uint c) { _decompile_count = c; }
duke@0 304 bool allow_range_check_smearing() const;
duke@0 305 bool do_inlining() const { return _do_inlining; }
duke@0 306 void set_do_inlining(bool z) { _do_inlining = z; }
duke@0 307 bool do_scheduling() const { return _do_scheduling; }
duke@0 308 void set_do_scheduling(bool z) { _do_scheduling = z; }
duke@0 309 bool do_count_invocations() const{ return _do_count_invocations; }
duke@0 310 void set_do_count_invocations(bool z){ _do_count_invocations = z; }
duke@0 311 bool do_method_data_update() const { return _do_method_data_update; }
duke@0 312 void set_do_method_data_update(bool z) { _do_method_data_update = z; }
duke@0 313 int AliasLevel() const { return _AliasLevel; }
duke@0 314 bool print_assembly() const { return _print_assembly; }
duke@0 315 void set_print_assembly(bool z) { _print_assembly = z; }
duke@0 316 // check the CompilerOracle for special behaviours for this compile
duke@0 317 bool method_has_option(const char * option) {
duke@0 318 return method() != NULL && method()->has_option(option);
duke@0 319 }
duke@0 320 #ifndef PRODUCT
duke@0 321 bool trace_opto_output() const { return _trace_opto_output; }
duke@0 322 #endif
duke@0 323
duke@0 324 void begin_method() {
duke@0 325 #ifndef PRODUCT
duke@0 326 if (_printer) _printer->begin_method(this);
duke@0 327 #endif
duke@0 328 }
duke@0 329 void print_method(const char * name, int level = 1) {
duke@0 330 #ifndef PRODUCT
duke@0 331 if (_printer) _printer->print_method(this, name, level);
duke@0 332 #endif
duke@0 333 }
duke@0 334 void end_method() {
duke@0 335 #ifndef PRODUCT
duke@0 336 if (_printer) _printer->end_method();
duke@0 337 #endif
duke@0 338 }
duke@0 339
duke@0 340 int macro_count() { return _macro_nodes->length(); }
duke@0 341 Node* macro_node(int idx) { return _macro_nodes->at(idx); }
duke@0 342 ConnectionGraph* congraph() { return _congraph;}
duke@0 343 void add_macro_node(Node * n) {
duke@0 344 //assert(n->is_macro(), "must be a macro node");
duke@0 345 assert(!_macro_nodes->contains(n), " duplicate entry in expand list");
duke@0 346 _macro_nodes->append(n);
duke@0 347 }
duke@0 348 void remove_macro_node(Node * n) {
duke@0 349 // this function may be called twice for a node so check
duke@0 350 // that the node is in the array before attempting to remove it
duke@0 351 if (_macro_nodes->contains(n))
duke@0 352 _macro_nodes->remove(n);
duke@0 353 }
duke@0 354
duke@0 355 // Compilation environment.
duke@0 356 Arena* comp_arena() { return &_comp_arena; }
duke@0 357 ciEnv* env() const { return _env; }
duke@0 358 CompileLog* log() const { return _log; }
duke@0 359 bool failing() const { return _env->failing() || _failure_reason != NULL; }
duke@0 360 const char* failure_reason() { return _failure_reason; }
duke@0 361 bool failure_reason_is(const char* r) { return (r==_failure_reason) || (r!=NULL && _failure_reason!=NULL && strcmp(r, _failure_reason)==0); }
duke@0 362
duke@0 363 void record_failure(const char* reason);
duke@0 364 void record_method_not_compilable(const char* reason, bool all_tiers = false) {
duke@0 365 // All bailouts cover "all_tiers" when TieredCompilation is off.
duke@0 366 if (!TieredCompilation) all_tiers = true;
duke@0 367 env()->record_method_not_compilable(reason, all_tiers);
duke@0 368 // Record failure reason.
duke@0 369 record_failure(reason);
duke@0 370 }
duke@0 371 void record_method_not_compilable_all_tiers(const char* reason) {
duke@0 372 record_method_not_compilable(reason, true);
duke@0 373 }
duke@0 374 bool check_node_count(uint margin, const char* reason) {
duke@0 375 if (unique() + margin > (uint)MaxNodeLimit) {
duke@0 376 record_method_not_compilable(reason);
duke@0 377 return true;
duke@0 378 } else {
duke@0 379 return false;
duke@0 380 }
duke@0 381 }
duke@0 382
duke@0 383 // Node management
duke@0 384 uint unique() const { return _unique; }
duke@0 385 uint next_unique() { return _unique++; }
duke@0 386 void set_unique(uint i) { _unique = i; }
duke@0 387 static int debug_idx() { return debug_only(_debug_idx)+0; }
duke@0 388 static void set_debug_idx(int i) { debug_only(_debug_idx = i); }
duke@0 389 Arena* node_arena() { return &_node_arena; }
duke@0 390 Arena* old_arena() { return &_old_arena; }
duke@0 391 RootNode* root() const { return _root; }
duke@0 392 void set_root(RootNode* r) { _root = r; }
duke@0 393 StartNode* start() const; // (Derived from root.)
duke@0 394 void init_start(StartNode* s);
duke@0 395 Node* immutable_memory();
duke@0 396
duke@0 397 Node* recent_alloc_ctl() const { return _recent_alloc_ctl; }
duke@0 398 Node* recent_alloc_obj() const { return _recent_alloc_obj; }
duke@0 399 void set_recent_alloc(Node* ctl, Node* obj) {
duke@0 400 _recent_alloc_ctl = ctl;
duke@0 401 _recent_alloc_obj = obj;
duke@0 402 }
duke@0 403
duke@0 404 // Handy undefined Node
duke@0 405 Node* top() const { return _top; }
duke@0 406
duke@0 407 // these are used by guys who need to know about creation and transformation of top:
duke@0 408 Node* cached_top_node() { return _top; }
duke@0 409 void set_cached_top_node(Node* tn);
duke@0 410
duke@0 411 GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
duke@0 412 void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
duke@0 413 Node_Notes* default_node_notes() const { return _default_node_notes; }
duke@0 414 void set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
duke@0 415
duke@0 416 Node_Notes* node_notes_at(int idx) {
duke@0 417 return locate_node_notes(_node_note_array, idx, false);
duke@0 418 }
duke@0 419 inline bool set_node_notes_at(int idx, Node_Notes* value);
duke@0 420
duke@0 421 // Copy notes from source to dest, if they exist.
duke@0 422 // Overwrite dest only if source provides something.
duke@0 423 // Return true if information was moved.
duke@0 424 bool copy_node_notes_to(Node* dest, Node* source);
duke@0 425
duke@0 426 // Workhorse function to sort out the blocked Node_Notes array:
duke@0 427 inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
duke@0 428 int idx, bool can_grow = false);
duke@0 429
duke@0 430 void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
duke@0 431
duke@0 432 // Type management
duke@0 433 Arena* type_arena() { return _type_arena; }
duke@0 434 Dict* type_dict() { return _type_dict; }
duke@0 435 void* type_hwm() { return _type_hwm; }
duke@0 436 size_t type_last_size() { return _type_last_size; }
duke@0 437 int num_alias_types() { return _num_alias_types; }
duke@0 438
duke@0 439 void init_type_arena() { _type_arena = &_Compile_types; }
duke@0 440 void set_type_arena(Arena* a) { _type_arena = a; }
duke@0 441 void set_type_dict(Dict* d) { _type_dict = d; }
duke@0 442 void set_type_hwm(void* p) { _type_hwm = p; }
duke@0 443 void set_type_last_size(size_t sz) { _type_last_size = sz; }
duke@0 444
duke@0 445 const TypeFunc* last_tf(ciMethod* m) {
duke@0 446 return (m == _last_tf_m) ? _last_tf : NULL;
duke@0 447 }
duke@0 448 void set_last_tf(ciMethod* m, const TypeFunc* tf) {
duke@0 449 assert(m != NULL || tf == NULL, "");
duke@0 450 _last_tf_m = m;
duke@0 451 _last_tf = tf;
duke@0 452 }
duke@0 453
duke@0 454 AliasType* alias_type(int idx) { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
duke@0 455 AliasType* alias_type(const TypePtr* adr_type) { return find_alias_type(adr_type, false); }
duke@0 456 bool have_alias_type(const TypePtr* adr_type);
duke@0 457 AliasType* alias_type(ciField* field);
duke@0 458
duke@0 459 int get_alias_index(const TypePtr* at) { return alias_type(at)->index(); }
duke@0 460 const TypePtr* get_adr_type(uint aidx) { return alias_type(aidx)->adr_type(); }
duke@0 461 int get_general_index(uint aidx) { return alias_type(aidx)->general_index(); }
duke@0 462
duke@0 463 // Building nodes
duke@0 464 void rethrow_exceptions(JVMState* jvms);
duke@0 465 void return_values(JVMState* jvms);
duke@0 466 JVMState* build_start_state(StartNode* start, const TypeFunc* tf);
duke@0 467
duke@0 468 // Decide how to build a call.
duke@0 469 // The profile factor is a discount to apply to this site's interp. profile.
duke@0 470 CallGenerator* call_generator(ciMethod* call_method, int vtable_index, bool call_is_virtual, JVMState* jvms, bool allow_inline, float profile_factor);
duke@0 471
duke@0 472 // Report if there were too many traps at a current method and bci.
duke@0 473 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
duke@0 474 // If there is no MDO at all, report no trap unless told to assume it.
duke@0 475 bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
duke@0 476 // This version, unspecific to a particular bci, asks if
duke@0 477 // PerMethodTrapLimit was exceeded for all inlined methods seen so far.
duke@0 478 bool too_many_traps(Deoptimization::DeoptReason reason,
duke@0 479 // Privately used parameter for logging:
duke@0 480 ciMethodData* logmd = NULL);
duke@0 481 // Report if there were too many recompiles at a method and bci.
duke@0 482 bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
duke@0 483
duke@0 484 // Parsing, optimization
duke@0 485 PhaseGVN* initial_gvn() { return _initial_gvn; }
duke@0 486 Unique_Node_List* for_igvn() { return _for_igvn; }
duke@0 487 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List.
duke@0 488 void record_for_escape_analysis(Node* n);
duke@0 489 void set_initial_gvn(PhaseGVN *gvn) { _initial_gvn = gvn; }
duke@0 490 void set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; }
duke@0 491
duke@0 492 void identify_useful_nodes(Unique_Node_List &useful);
duke@0 493 void remove_useless_nodes (Unique_Node_List &useful);
duke@0 494
duke@0 495 WarmCallInfo* warm_calls() const { return _warm_calls; }
duke@0 496 void set_warm_calls(WarmCallInfo* l) { _warm_calls = l; }
duke@0 497 WarmCallInfo* pop_warm_call();
duke@0 498
duke@0 499 // Matching, CFG layout, allocation, code generation
duke@0 500 PhaseCFG* cfg() { return _cfg; }
duke@0 501 bool select_24_bit_instr() const { return _select_24_bit_instr; }
duke@0 502 bool in_24_bit_fp_mode() const { return _in_24_bit_fp_mode; }
duke@0 503 bool has_java_calls() const { return _has_java_calls; }
duke@0 504 Matcher* matcher() { return _matcher; }
duke@0 505 PhaseRegAlloc* regalloc() { return _regalloc; }
duke@0 506 int frame_slots() const { return _frame_slots; }
duke@0 507 int frame_size_in_words() const; // frame_slots in units of the polymorphic 'words'
duke@0 508 RegMask& FIRST_STACK_mask() { return _FIRST_STACK_mask; }
duke@0 509 Arena* indexSet_arena() { return _indexSet_arena; }
duke@0 510 void* indexSet_free_block_list() { return _indexSet_free_block_list; }
duke@0 511 uint node_bundling_limit() { return _node_bundling_limit; }
duke@0 512 Bundle* node_bundling_base() { return _node_bundling_base; }
duke@0 513 void set_node_bundling_limit(uint n) { _node_bundling_limit = n; }
duke@0 514 void set_node_bundling_base(Bundle* b) { _node_bundling_base = b; }
duke@0 515 bool starts_bundle(const Node *n) const;
duke@0 516 bool need_stack_bang(int frame_size_in_bytes) const;
duke@0 517 bool need_register_stack_bang() const;
duke@0 518
duke@0 519 void set_matcher(Matcher* m) { _matcher = m; }
duke@0 520 //void set_regalloc(PhaseRegAlloc* ra) { _regalloc = ra; }
duke@0 521 void set_indexSet_arena(Arena* a) { _indexSet_arena = a; }
duke@0 522 void set_indexSet_free_block_list(void* p) { _indexSet_free_block_list = p; }
duke@0 523
duke@0 524 // Remember if this compilation changes hardware mode to 24-bit precision
duke@0 525 void set_24_bit_selection_and_mode(bool selection, bool mode) {
duke@0 526 _select_24_bit_instr = selection;
duke@0 527 _in_24_bit_fp_mode = mode;
duke@0 528 }
duke@0 529
duke@0 530 void set_has_java_calls(bool z) { _has_java_calls = z; }
duke@0 531
duke@0 532 // Instruction bits passed off to the VM
duke@0 533 int code_size() { return _method_size; }
duke@0 534 CodeBuffer* code_buffer() { return &_code_buffer; }
duke@0 535 int first_block_size() { return _first_block_size; }
duke@0 536 void set_frame_complete(int off) { _code_offsets.set_value(CodeOffsets::Frame_Complete, off); }
duke@0 537 ExceptionHandlerTable* handler_table() { return &_handler_table; }
duke@0 538 ImplicitExceptionTable* inc_table() { return &_inc_table; }
duke@0 539 OopMapSet* oop_map_set() { return _oop_map_set; }
duke@0 540 DebugInformationRecorder* debug_info() { return env()->debug_info(); }
duke@0 541 Dependencies* dependencies() { return env()->dependencies(); }
duke@0 542 static int CompiledZap_count() { return _CompiledZap_count; }
duke@0 543 BufferBlob* scratch_buffer_blob() { return _scratch_buffer_blob; }
duke@0 544 void init_scratch_buffer_blob();
duke@0 545 void set_scratch_buffer_blob(BufferBlob* b) { _scratch_buffer_blob = b; }
duke@0 546 relocInfo* scratch_locs_memory() { return _scratch_locs_memory; }
duke@0 547 void set_scratch_locs_memory(relocInfo* b) { _scratch_locs_memory = b; }
duke@0 548
duke@0 549 // emit to scratch blob, report resulting size
duke@0 550 uint scratch_emit_size(const Node* n);
duke@0 551
duke@0 552 enum ScratchBufferBlob {
duke@0 553 MAX_inst_size = 1024,
duke@0 554 MAX_locs_size = 128, // number of relocInfo elements
duke@0 555 MAX_const_size = 128,
duke@0 556 MAX_stubs_size = 128
duke@0 557 };
duke@0 558
duke@0 559 // Major entry point. Given a Scope, compile the associated method.
duke@0 560 // For normal compilations, entry_bci is InvocationEntryBci. For on stack
duke@0 561 // replacement, entry_bci indicates the bytecode for which to compile a
duke@0 562 // continuation.
duke@0 563 Compile(ciEnv* ci_env, C2Compiler* compiler, ciMethod* target,
kvn@38 564 int entry_bci, bool subsume_loads, bool do_escape_analysis);
duke@0 565
duke@0 566 // Second major entry point. From the TypeFunc signature, generate code
duke@0 567 // to pass arguments from the Java calling convention to the C calling
duke@0 568 // convention.
duke@0 569 Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
duke@0 570 address stub_function, const char *stub_name,
duke@0 571 int is_fancy_jump, bool pass_tls,
duke@0 572 bool save_arg_registers, bool return_pc);
duke@0 573
duke@0 574 // From the TypeFunc signature, generate code to pass arguments
duke@0 575 // from Compiled calling convention to Interpreter's calling convention
duke@0 576 void Generate_Compiled_To_Interpreter_Graph(const TypeFunc *tf, address interpreter_entry);
duke@0 577
duke@0 578 // From the TypeFunc signature, generate code to pass arguments
duke@0 579 // from Interpreter's calling convention to Compiler's calling convention
duke@0 580 void Generate_Interpreter_To_Compiled_Graph(const TypeFunc *tf);
duke@0 581
duke@0 582 // Are we compiling a method?
duke@0 583 bool has_method() { return method() != NULL; }
duke@0 584
duke@0 585 // Maybe print some information about this compile.
duke@0 586 void print_compile_messages();
duke@0 587
duke@0 588 // Final graph reshaping, a post-pass after the regular optimizer is done.
duke@0 589 bool final_graph_reshaping();
duke@0 590
duke@0 591 // returns true if adr is completely contained in the given alias category
duke@0 592 bool must_alias(const TypePtr* adr, int alias_idx);
duke@0 593
duke@0 594 // returns true if adr overlaps with the given alias category
duke@0 595 bool can_alias(const TypePtr* adr, int alias_idx);
duke@0 596
duke@0 597 // Driver for converting compiler's IR into machine code bits
duke@0 598 void Output();
duke@0 599
duke@0 600 // Accessors for node bundling info.
duke@0 601 Bundle* node_bundling(const Node *n);
duke@0 602 bool valid_bundle_info(const Node *n);
duke@0 603
duke@0 604 // Schedule and Bundle the instructions
duke@0 605 void ScheduleAndBundle();
duke@0 606
duke@0 607 // Build OopMaps for each GC point
duke@0 608 void BuildOopMaps();
kvn@63 609
kvn@63 610 // Append debug info for the node "local" at safepoint node "sfpt" to the
kvn@63 611 // "array", May also consult and add to "objs", which describes the
kvn@63 612 // scalar-replaced objects.
kvn@63 613 void FillLocArray( int idx, MachSafePointNode* sfpt,
kvn@63 614 Node *local, GrowableArray<ScopeValue*> *array,
kvn@63 615 GrowableArray<ScopeValue*> *objs );
kvn@63 616
kvn@63 617 // If "objs" contains an ObjectValue whose id is "id", returns it, else NULL.
kvn@63 618 static ObjectValue* sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id);
kvn@63 619 // Requres that "objs" does not contains an ObjectValue whose id matches
kvn@63 620 // that of "sv. Appends "sv".
kvn@63 621 static void set_sv_for_object_node(GrowableArray<ScopeValue*> *objs,
kvn@63 622 ObjectValue* sv );
duke@0 623
duke@0 624 // Process an OopMap Element while emitting nodes
duke@0 625 void Process_OopMap_Node(MachNode *mach, int code_offset);
duke@0 626
duke@0 627 // Write out basic block data to code buffer
duke@0 628 void Fill_buffer();
duke@0 629
duke@0 630 // Determine which variable sized branches can be shortened
duke@0 631 void Shorten_branches(Label *labels, int& code_size, int& reloc_size, int& stub_size, int& const_size);
duke@0 632
duke@0 633 // Compute the size of first NumberOfLoopInstrToAlign instructions
duke@0 634 // at the head of a loop.
duke@0 635 void compute_loop_first_inst_sizes();
duke@0 636
duke@0 637 // Compute the information for the exception tables
duke@0 638 void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels);
duke@0 639
duke@0 640 // Stack slots that may be unused by the calling convention but must
duke@0 641 // otherwise be preserved. On Intel this includes the return address.
duke@0 642 // On PowerPC it includes the 4 words holding the old TOC & LR glue.
duke@0 643 uint in_preserve_stack_slots();
duke@0 644
duke@0 645 // "Top of Stack" slots that may be unused by the calling convention but must
duke@0 646 // otherwise be preserved.
duke@0 647 // On Intel these are not necessary and the value can be zero.
duke@0 648 // On Sparc this describes the words reserved for storing a register window
duke@0 649 // when an interrupt occurs.
duke@0 650 static uint out_preserve_stack_slots();
duke@0 651
duke@0 652 // Number of outgoing stack slots killed above the out_preserve_stack_slots
duke@0 653 // for calls to C. Supports the var-args backing area for register parms.
duke@0 654 uint varargs_C_out_slots_killed() const;
duke@0 655
duke@0 656 // Number of Stack Slots consumed by a synchronization entry
duke@0 657 int sync_stack_slots() const;
duke@0 658
duke@0 659 // Compute the name of old_SP. See <arch>.ad for frame layout.
duke@0 660 OptoReg::Name compute_old_SP();
duke@0 661
duke@0 662 #ifdef ENABLE_ZAP_DEAD_LOCALS
duke@0 663 static bool is_node_getting_a_safepoint(Node*);
duke@0 664 void Insert_zap_nodes();
duke@0 665 Node* call_zap_node(MachSafePointNode* n, int block_no);
duke@0 666 #endif
duke@0 667
duke@0 668 private:
duke@0 669 // Phase control:
duke@0 670 void Init(int aliaslevel); // Prepare for a single compilation
duke@0 671 int Inline_Warm(); // Find more inlining work.
duke@0 672 void Finish_Warm(); // Give up on further inlines.
duke@0 673 void Optimize(); // Given a graph, optimize it
duke@0 674 void Code_Gen(); // Generate code from a graph
duke@0 675
duke@0 676 // Management of the AliasType table.
duke@0 677 void grow_alias_types();
duke@0 678 AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
duke@0 679 const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
duke@0 680 AliasType* find_alias_type(const TypePtr* adr_type, bool no_create);
duke@0 681
duke@0 682 void verify_top(Node*) const PRODUCT_RETURN;
duke@0 683
duke@0 684 // Intrinsic setup.
duke@0 685 void register_library_intrinsics(); // initializer
duke@0 686 CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual); // constructor
duke@0 687 int intrinsic_insertion_index(ciMethod* m, bool is_virtual); // helper
duke@0 688 CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual); // query fn
duke@0 689 void register_intrinsic(CallGenerator* cg); // update fn
duke@0 690
duke@0 691 #ifndef PRODUCT
duke@0 692 static juint _intrinsic_hist_count[vmIntrinsics::ID_LIMIT];
duke@0 693 static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT];
duke@0 694 #endif
duke@0 695
duke@0 696 public:
duke@0 697
duke@0 698 // Note: Histogram array size is about 1 Kb.
duke@0 699 enum { // flag bits:
duke@0 700 _intrinsic_worked = 1, // succeeded at least once
duke@0 701 _intrinsic_failed = 2, // tried it but it failed
duke@0 702 _intrinsic_disabled = 4, // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
duke@0 703 _intrinsic_virtual = 8, // was seen in the virtual form (rare)
duke@0 704 _intrinsic_both = 16 // was seen in the non-virtual form (usual)
duke@0 705 };
duke@0 706 // Update histogram. Return boolean if this is a first-time occurrence.
duke@0 707 static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
duke@0 708 bool is_virtual, int flags) PRODUCT_RETURN0;
duke@0 709 static void print_intrinsic_statistics() PRODUCT_RETURN;
duke@0 710
duke@0 711 // Graph verification code
duke@0 712 // Walk the node list, verifying that there is a one-to-one
duke@0 713 // correspondence between Use-Def edges and Def-Use edges
duke@0 714 // The option no_dead_code enables stronger checks that the
duke@0 715 // graph is strongly connected from root in both directions.
duke@0 716 void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN;
duke@0 717
duke@0 718 // Print bytecodes, including the scope inlining tree
duke@0 719 void print_codes();
duke@0 720
duke@0 721 // End-of-run dumps.
duke@0 722 static void print_statistics() PRODUCT_RETURN;
duke@0 723
duke@0 724 // Dump formatted assembly
duke@0 725 void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN;
duke@0 726 void dump_pc(int *pcs, int pc_limit, Node *n);
duke@0 727
duke@0 728 // Verify ADLC assumptions during startup
duke@0 729 static void adlc_verification() PRODUCT_RETURN;
duke@0 730
duke@0 731 // Definitions of pd methods
duke@0 732 static void pd_compiler2_init();
duke@0 733 };