1 /*
   2  * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #ifndef SHARE_VM_OPTO_COMPILE_HPP
  26 #define SHARE_VM_OPTO_COMPILE_HPP
  27 
  28 #include "asm/codeBuffer.hpp"
  29 #include "ci/compilerInterface.hpp"
  30 #include "code/debugInfoRec.hpp"
  31 #include "code/exceptionHandlerTable.hpp"
  32 #include "compiler/compilerOracle.hpp"
  33 #include "compiler/compileBroker.hpp"
  34 #include "libadt/dict.hpp"
  35 #include "libadt/port.hpp"
  36 #include "libadt/vectset.hpp"
  37 #include "memory/resourceArea.hpp"
  38 #include "opto/idealGraphPrinter.hpp"
  39 #include "opto/phasetype.hpp"
  40 #include "opto/phase.hpp"
  41 #include "opto/regmask.hpp"
  42 #include "runtime/deoptimization.hpp"
  43 #include "runtime/vmThread.hpp"
  44 #include "trace/tracing.hpp"
  45 
  46 class Block;
  47 class Bundle;
  48 class C2Compiler;
  49 class CallGenerator;
  50 class ConnectionGraph;
  51 class InlineTree;
  52 class Int_Array;
  53 class Matcher;
  54 class MachConstantNode;
  55 class MachConstantBaseNode;
  56 class MachNode;
  57 class MachOper;
  58 class MachSafePointNode;
  59 class Node;
  60 class Node_Array;
  61 class Node_Notes;
  62 class OptoReg;
  63 class PhaseCFG;
  64 class PhaseGVN;
  65 class PhaseIterGVN;
  66 class PhaseRegAlloc;
  67 class PhaseCCP;
  68 class PhaseCCP_DCE;
  69 class RootNode;
  70 class relocInfo;
  71 class Scope;
  72 class StartNode;
  73 class SafePointNode;
  74 class JVMState;
  75 class Type;
  76 class TypeData;
  77 class TypePtr;
  78 class TypeOopPtr;
  79 class TypeFunc;
  80 class Unique_Node_List;
  81 class nmethod;
  82 class WarmCallInfo;
  83 class Node_Stack;
  84 struct Final_Reshape_Counts;
  85 
  86 //------------------------------Compile----------------------------------------
  87 // This class defines a top-level Compiler invocation.
  88 
  89 class Compile : public Phase {
  90   friend class VMStructs;
  91 
  92  public:
  93   // Fixed alias indexes.  (See also MergeMemNode.)
  94   enum {
  95     AliasIdxTop = 1,  // pseudo-index, aliases to nothing (used as sentinel value)
  96     AliasIdxBot = 2,  // pseudo-index, aliases to everything
  97     AliasIdxRaw = 3   // hard-wired index for TypeRawPtr::BOTTOM
  98   };
  99 
 100   // Variant of TraceTime(NULL, &_t_accumulator, TimeCompiler);
 101   // Integrated with logging.  If logging is turned on, and dolog is true,
 102   // then brackets are put into the log, with time stamps and node counts.
 103   // (The time collection itself is always conditionalized on TimeCompiler.)
 104   class TracePhase : public TraceTime {
 105    private:
 106     Compile*    C;
 107     CompileLog* _log;
 108     const char* _phase_name;
 109     bool _dolog;
 110    public:
 111     TracePhase(const char* name, elapsedTimer* accumulator, bool dolog);
 112     ~TracePhase();
 113   };
 114 
 115   // Information per category of alias (memory slice)
 116   class AliasType {
 117    private:
 118     friend class Compile;
 119 
 120     int             _index;         // unique index, used with MergeMemNode
 121     const TypePtr*  _adr_type;      // normalized address type
 122     ciField*        _field;         // relevant instance field, or null if none
 123     const Type*     _element;       // relevant array element type, or null if none
 124     bool            _is_rewritable; // false if the memory is write-once only
 125     int             _general_index; // if this is type is an instance, the general
 126                                     // type that this is an instance of
 127 
 128     void Init(int i, const TypePtr* at);
 129 
 130    public:
 131     int             index()         const { return _index; }
 132     const TypePtr*  adr_type()      const { return _adr_type; }
 133     ciField*        field()         const { return _field; }
 134     const Type*     element()       const { return _element; }
 135     bool            is_rewritable() const { return _is_rewritable; }
 136     bool            is_volatile()   const { return (_field ? _field->is_volatile() : false); }
 137     int             general_index() const { return (_general_index != 0) ? _general_index : _index; }
 138 
 139     void set_rewritable(bool z) { _is_rewritable = z; }
 140     void set_field(ciField* f) {
 141       assert(!_field,"");
 142       _field = f;
 143       if (f->is_final() || f->is_stable()) {
 144         // In the case of @Stable, multiple writes are possible but may be assumed to be no-ops.
 145         _is_rewritable = false;
 146       }
 147     }
 148     void set_element(const Type* e) {
 149       assert(_element == NULL, "");
 150       _element = e;
 151     }
 152 
 153     void print_on(outputStream* st) PRODUCT_RETURN;
 154   };
 155 
 156   enum {
 157     logAliasCacheSize = 6,
 158     AliasCacheSize = (1<<logAliasCacheSize)
 159   };
 160   struct AliasCacheEntry { const TypePtr* _adr_type; int _index; };  // simple duple type
 161   enum {
 162     trapHistLength = MethodData::_trap_hist_limit
 163   };
 164 
 165   // Constant entry of the constant table.
 166   class Constant {
 167   private:
 168     BasicType _type;
 169     union {
 170       jvalue    _value;
 171       Metadata* _metadata;
 172     } _v;
 173     int       _offset;         // offset of this constant (in bytes) relative to the constant table base.
 174     float     _freq;
 175     bool      _can_be_reused;  // true (default) if the value can be shared with other users.
 176 
 177   public:
 178     Constant() : _type(T_ILLEGAL), _offset(-1), _freq(0.0f), _can_be_reused(true) { _v._value.l = 0; }
 179     Constant(BasicType type, jvalue value, float freq = 0.0f, bool can_be_reused = true) :
 180       _type(type),
 181       _offset(-1),
 182       _freq(freq),
 183       _can_be_reused(can_be_reused)
 184     {
 185       assert(type != T_METADATA, "wrong constructor");
 186       _v._value = value;
 187     }
 188     Constant(Metadata* metadata, bool can_be_reused = true) :
 189       _type(T_METADATA),
 190       _offset(-1),
 191       _freq(0.0f),
 192       _can_be_reused(can_be_reused)
 193     {
 194       _v._metadata = metadata;
 195     }
 196 
 197     bool operator==(const Constant& other);
 198 
 199     BasicType type()      const    { return _type; }
 200 
 201     jlong   get_jlong()   const    { return _v._value.j; }
 202     jfloat  get_jfloat()  const    { return _v._value.f; }
 203     jdouble get_jdouble() const    { return _v._value.d; }
 204     jobject get_jobject() const    { return _v._value.l; }
 205 
 206     Metadata* get_metadata() const { return _v._metadata; }
 207 
 208     int         offset()  const    { return _offset; }
 209     void    set_offset(int offset) {        _offset = offset; }
 210 
 211     float       freq()    const    { return _freq;         }
 212     void    inc_freq(float freq)   {        _freq += freq; }
 213 
 214     bool    can_be_reused() const  { return _can_be_reused; }
 215   };
 216 
 217   // Constant table.
 218   class ConstantTable {
 219   private:
 220     GrowableArray<Constant> _constants;          // Constants of this table.
 221     int                     _size;               // Size in bytes the emitted constant table takes (including padding).
 222     int                     _table_base_offset;  // Offset of the table base that gets added to the constant offsets.
 223     int                     _nof_jump_tables;    // Number of jump-tables in this constant table.
 224 
 225     static int qsort_comparator(Constant* a, Constant* b);
 226 
 227     // We use negative frequencies to keep the order of the
 228     // jump-tables in which they were added.  Otherwise we get into
 229     // trouble with relocation.
 230     float next_jump_table_freq() { return -1.0f * (++_nof_jump_tables); }
 231 
 232   public:
 233     ConstantTable() :
 234       _size(-1),
 235       _table_base_offset(-1),  // We can use -1 here since the constant table is always bigger than 2 bytes (-(size / 2), see MachConstantBaseNode::emit).
 236       _nof_jump_tables(0)
 237     {}
 238 
 239     int size() const { assert(_size != -1, "not calculated yet"); return _size; }
 240 
 241     int calculate_table_base_offset() const;  // AD specific
 242     void set_table_base_offset(int x)  { assert(_table_base_offset == -1 || x == _table_base_offset, "can't change"); _table_base_offset = x; }
 243     int      table_base_offset() const { assert(_table_base_offset != -1, "not set yet");                      return _table_base_offset; }
 244 
 245     void emit(CodeBuffer& cb);
 246 
 247     // Returns the offset of the last entry (the top) of the constant table.
 248     int  top_offset() const { assert(_constants.top().offset() != -1, "not bound yet"); return _constants.top().offset(); }
 249 
 250     void calculate_offsets_and_size();
 251     int  find_offset(Constant& con) const;
 252 
 253     void     add(Constant& con);
 254     Constant add(MachConstantNode* n, BasicType type, jvalue value);
 255     Constant add(Metadata* metadata);
 256     Constant add(MachConstantNode* n, MachOper* oper);
 257     Constant add(MachConstantNode* n, jfloat f) {
 258       jvalue value; value.f = f;
 259       return add(n, T_FLOAT, value);
 260     }
 261     Constant add(MachConstantNode* n, jdouble d) {
 262       jvalue value; value.d = d;
 263       return add(n, T_DOUBLE, value);
 264     }
 265 
 266     // Jump-table
 267     Constant  add_jump_table(MachConstantNode* n);
 268     void     fill_jump_table(CodeBuffer& cb, MachConstantNode* n, GrowableArray<Label*> labels) const;
 269   };
 270 
 271  private:
 272   // Fixed parameters to this compilation.
 273   const int             _compile_id;
 274   const bool            _save_argument_registers; // save/restore arg regs for trampolines
 275   const bool            _subsume_loads;         // Load can be matched as part of a larger op.
 276   const bool            _do_escape_analysis;    // Do escape analysis.
 277   const bool            _eliminate_boxing;      // Do boxing elimination.
 278   ciMethod*             _method;                // The method being compiled.
 279   int                   _entry_bci;             // entry bci for osr methods.
 280   const TypeFunc*       _tf;                    // My kind of signature
 281   InlineTree*           _ilt;                   // Ditto (temporary).
 282   address               _stub_function;         // VM entry for stub being compiled, or NULL
 283   const char*           _stub_name;             // Name of stub or adapter being compiled, or NULL
 284   address               _stub_entry_point;      // Compile code entry for generated stub, or NULL
 285 
 286   // Control of this compilation.
 287   int                   _num_loop_opts;         // Number of iterations for doing loop optimiztions
 288   int                   _max_inline_size;       // Max inline size for this compilation
 289   int                   _freq_inline_size;      // Max hot method inline size for this compilation
 290   int                   _fixed_slots;           // count of frame slots not allocated by the register
 291                                                 // allocator i.e. locks, original deopt pc, etc.
 292   // For deopt
 293   int                   _orig_pc_slot;
 294   int                   _orig_pc_slot_offset_in_bytes;
 295 
 296   int                   _major_progress;        // Count of something big happening
 297   bool                  _inlining_progress;     // progress doing incremental inlining?
 298   bool                  _inlining_incrementally;// Are we doing incremental inlining (post parse)
 299   bool                  _has_loops;             // True if the method _may_ have some loops
 300   bool                  _has_split_ifs;         // True if the method _may_ have some split-if
 301   bool                  _has_unsafe_access;     // True if the method _may_ produce faults in unsafe loads or stores.
 302   bool                  _has_stringbuilder;     // True StringBuffers or StringBuilders are allocated
 303   bool                  _has_boxed_value;       // True if a boxed object is allocated
 304   int                   _max_vector_size;       // Maximum size of generated vectors
 305   uint                  _trap_hist[trapHistLength];  // Cumulative traps
 306   bool                  _trap_can_recompile;    // Have we emitted a recompiling trap?
 307   uint                  _decompile_count;       // Cumulative decompilation counts.
 308   bool                  _do_inlining;           // True if we intend to do inlining
 309   bool                  _do_scheduling;         // True if we intend to do scheduling
 310   bool                  _do_freq_based_layout;  // True if we intend to do frequency based block layout
 311   bool                  _do_count_invocations;  // True if we generate code to count invocations
 312   bool                  _do_method_data_update; // True if we generate code to update MethodData*s
 313   int                   _AliasLevel;            // Locally-adjusted version of AliasLevel flag.
 314   bool                  _print_assembly;        // True if we should dump assembly code for this compilation


 315 #ifndef PRODUCT
 316   bool                  _trace_opto_output;
 317   bool                  _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
 318 #endif
 319 
 320   // JSR 292
 321   bool                  _has_method_handle_invokes; // True if this method has MethodHandle invokes.
 322 
 323   // Compilation environment.
 324   Arena                 _comp_arena;            // Arena with lifetime equivalent to Compile
 325   ciEnv*                _env;                   // CI interface
 326   CompileLog*           _log;                   // from CompilerThread
 327   const char*           _failure_reason;        // for record_failure/failing pattern
 328   GrowableArray<CallGenerator*>* _intrinsics;   // List of intrinsics.
 329   GrowableArray<Node*>* _macro_nodes;           // List of nodes which need to be expanded before matching.
 330   GrowableArray<Node*>* _predicate_opaqs;       // List of Opaque1 nodes for the loop predicates.
 331   GrowableArray<Node*>* _expensive_nodes;       // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
 332   ConnectionGraph*      _congraph;
 333 #ifndef PRODUCT
 334   IdealGraphPrinter*    _printer;
 335 #endif
 336 
 337 
 338   // Node management
 339   uint                  _unique;                // Counter for unique Node indices
 340   VectorSet             _dead_node_list;        // Set of dead nodes
 341   uint                  _dead_node_count;       // Number of dead nodes; VectorSet::Size() is O(N).
 342                                                 // So use this to keep count and make the call O(1).
 343   debug_only(static int _debug_idx;)            // Monotonic counter (not reset), use -XX:BreakAtNode=<idx>
 344   Arena                 _node_arena;            // Arena for new-space Nodes
 345   Arena                 _old_arena;             // Arena for old-space Nodes, lifetime during xform
 346   RootNode*             _root;                  // Unique root of compilation, or NULL after bail-out.
 347   Node*                 _top;                   // Unique top node.  (Reset by various phases.)
 348 
 349   Node*                 _immutable_memory;      // Initial memory state
 350 
 351   Node*                 _recent_alloc_obj;
 352   Node*                 _recent_alloc_ctl;
 353 
 354   // Constant table
 355   ConstantTable         _constant_table;        // The constant table for this compile.
 356   MachConstantBaseNode* _mach_constant_base_node;  // Constant table base node singleton.
 357 
 358 
 359   // Blocked array of debugging and profiling information,
 360   // tracked per node.
 361   enum { _log2_node_notes_block_size = 8,
 362          _node_notes_block_size = (1<<_log2_node_notes_block_size)
 363   };
 364   GrowableArray<Node_Notes*>* _node_note_array;
 365   Node_Notes*           _default_node_notes;  // default notes for new nodes
 366 
 367   // After parsing and every bulk phase we hang onto the Root instruction.
 368   // The RootNode instruction is where the whole program begins.  It produces
 369   // the initial Control and BOTTOM for everybody else.
 370 
 371   // Type management
 372   Arena                 _Compile_types;         // Arena for all types
 373   Arena*                _type_arena;            // Alias for _Compile_types except in Initialize_shared()
 374   Dict*                 _type_dict;             // Intern table
 375   void*                 _type_hwm;              // Last allocation (see Type::operator new/delete)
 376   size_t                _type_last_size;        // Last allocation size (see Type::operator new/delete)
 377   ciMethod*             _last_tf_m;             // Cache for
 378   const TypeFunc*       _last_tf;               //  TypeFunc::make
 379   AliasType**           _alias_types;           // List of alias types seen so far.
 380   int                   _num_alias_types;       // Logical length of _alias_types
 381   int                   _max_alias_types;       // Physical length of _alias_types
 382   AliasCacheEntry       _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
 383 
 384   // Parsing, optimization
 385   PhaseGVN*             _initial_gvn;           // Results of parse-time PhaseGVN
 386   Unique_Node_List*     _for_igvn;              // Initial work-list for next round of Iterative GVN
 387   WarmCallInfo*         _warm_calls;            // Sorted work-list for heat-based inlining.
 388 
 389   GrowableArray<CallGenerator*> _late_inlines;        // List of CallGenerators to be revisited after
 390                                                       // main parsing has finished.
 391   GrowableArray<CallGenerator*> _string_late_inlines; // same but for string operations
 392 
 393   GrowableArray<CallGenerator*> _boxing_late_inlines; // same but for boxing operations
 394 
 395   int                           _late_inlines_pos;    // Where in the queue should the next late inlining candidate go (emulate depth first inlining)
 396   uint                          _number_of_mh_late_inlines; // number of method handle late inlining still pending
 397 
 398 
 399   // Inlining may not happen in parse order which would make
 400   // PrintInlining output confusing. Keep track of PrintInlining
 401   // pieces in order.
 402   class PrintInliningBuffer : public ResourceObj {
 403    private:
 404     CallGenerator* _cg;
 405     stringStream* _ss;
 406 
 407    public:
 408     PrintInliningBuffer()
 409       : _cg(NULL) { _ss = new stringStream(); }
 410 
 411     stringStream* ss() const { return _ss; }
 412     CallGenerator* cg() const { return _cg; }
 413     void set_cg(CallGenerator* cg) { _cg = cg; }
 414   };
 415 
 416   GrowableArray<PrintInliningBuffer>* _print_inlining_list;
 417   int _print_inlining;
 418 
 419   // Only keep nodes in the expensive node list that need to be optimized
 420   void cleanup_expensive_nodes(PhaseIterGVN &igvn);
 421   // Use for sorting expensive nodes to bring similar nodes together
 422   static int cmp_expensive_nodes(Node** n1, Node** n2);
 423   // Expensive nodes list already sorted?
 424   bool expensive_nodes_sorted() const;
 425 
 426  public:
 427 
 428   outputStream* print_inlining_stream() const {
 429     return _print_inlining_list->at(_print_inlining).ss();
 430   }
 431 
 432   void print_inlining_skip(CallGenerator* cg) {
 433     if (PrintInlining) {
 434       _print_inlining_list->at(_print_inlining).set_cg(cg);
 435       _print_inlining++;
 436       _print_inlining_list->insert_before(_print_inlining, PrintInliningBuffer());
 437     }
 438   }
 439 
 440   void print_inlining_insert(CallGenerator* cg) {
 441     if (PrintInlining) {
 442       for (int i = 0; i < _print_inlining_list->length(); i++) {
 443         if (_print_inlining_list->at(i).cg() == cg) {
 444           _print_inlining_list->insert_before(i+1, PrintInliningBuffer());
 445           _print_inlining = i+1;
 446           _print_inlining_list->at(i).set_cg(NULL);
 447           return;
 448         }
 449       }
 450       ShouldNotReachHere();
 451     }
 452   }
 453 
 454   void print_inlining(ciMethod* method, int inline_level, int bci, const char* msg = NULL) {
 455     stringStream ss;
 456     CompileTask::print_inlining(&ss, method, inline_level, bci, msg);
 457     print_inlining_stream()->print(ss.as_string());
 458   }
 459 
 460  private:
 461   // Matching, CFG layout, allocation, code generation
 462   PhaseCFG*             _cfg;                   // Results of CFG finding
 463   bool                  _select_24_bit_instr;   // We selected an instruction with a 24-bit result
 464   bool                  _in_24_bit_fp_mode;     // We are emitting instructions with 24-bit results
 465   int                   _java_calls;            // Number of java calls in the method
 466   int                   _inner_loops;           // Number of inner loops in the method
 467   Matcher*              _matcher;               // Engine to map ideal to machine instructions
 468   PhaseRegAlloc*        _regalloc;              // Results of register allocation.
 469   int                   _frame_slots;           // Size of total frame in stack slots
 470   CodeOffsets           _code_offsets;          // Offsets into the code for various interesting entries
 471   RegMask               _FIRST_STACK_mask;      // All stack slots usable for spills (depends on frame layout)
 472   Arena*                _indexSet_arena;        // control IndexSet allocation within PhaseChaitin
 473   void*                 _indexSet_free_block_list; // free list of IndexSet bit blocks
 474 
 475   uint                  _node_bundling_limit;
 476   Bundle*               _node_bundling_base;    // Information for instruction bundling
 477 
 478   // Instruction bits passed off to the VM
 479   int                   _method_size;           // Size of nmethod code segment in bytes
 480   CodeBuffer            _code_buffer;           // Where the code is assembled
 481   int                   _first_block_size;      // Size of unvalidated entry point code / OSR poison code
 482   ExceptionHandlerTable _handler_table;         // Table of native-code exception handlers
 483   ImplicitExceptionTable _inc_table;            // Table of implicit null checks in native code
 484   OopMapSet*            _oop_map_set;           // Table of oop maps (one for each safepoint location)
 485   static int            _CompiledZap_count;     // counter compared against CompileZap[First/Last]
 486   BufferBlob*           _scratch_buffer_blob;   // For temporary code buffers.
 487   relocInfo*            _scratch_locs_memory;   // For temporary code buffers.
 488   int                   _scratch_const_size;    // For temporary code buffers.
 489   bool                  _in_scratch_emit_size;  // true when in scratch_emit_size.
 490 
 491  public:
 492   // Accessors
 493 
 494   // The Compile instance currently active in this (compiler) thread.
 495   static Compile* current() {
 496     return (Compile*) ciEnv::current()->compiler_data();
 497   }
 498 
 499   // ID for this compilation.  Useful for setting breakpoints in the debugger.
 500   int               compile_id() const          { return _compile_id; }
 501 
 502   // Does this compilation allow instructions to subsume loads?  User
 503   // instructions that subsume a load may result in an unschedulable
 504   // instruction sequence.
 505   bool              subsume_loads() const       { return _subsume_loads; }
 506   /** Do escape analysis. */
 507   bool              do_escape_analysis() const  { return _do_escape_analysis; }
 508   /** Do boxing elimination. */
 509   bool              eliminate_boxing() const    { return _eliminate_boxing; }
 510   /** Do aggressive boxing elimination. */
 511   bool              aggressive_unboxing() const { return _eliminate_boxing && AggressiveUnboxing; }
 512   bool              save_argument_registers() const { return _save_argument_registers; }
 513 
 514 
 515   // Other fixed compilation parameters.
 516   ciMethod*         method() const              { return _method; }
 517   int               entry_bci() const           { return _entry_bci; }
 518   bool              is_osr_compilation() const  { return _entry_bci != InvocationEntryBci; }
 519   bool              is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); }
 520   const TypeFunc*   tf() const                  { assert(_tf!=NULL, ""); return _tf; }
 521   void         init_tf(const TypeFunc* tf)      { assert(_tf==NULL, ""); _tf = tf; }
 522   InlineTree*       ilt() const                 { return _ilt; }
 523   address           stub_function() const       { return _stub_function; }
 524   const char*       stub_name() const           { return _stub_name; }
 525   address           stub_entry_point() const    { return _stub_entry_point; }
 526 
 527   // Control of this compilation.
 528   int               fixed_slots() const         { assert(_fixed_slots >= 0, "");         return _fixed_slots; }
 529   void          set_fixed_slots(int n)          { _fixed_slots = n; }
 530   int               major_progress() const      { return _major_progress; }
 531   void          set_inlining_progress(bool z)   { _inlining_progress = z; }
 532   int               inlining_progress() const   { return _inlining_progress; }
 533   void          set_inlining_incrementally(bool z) { _inlining_incrementally = z; }
 534   int               inlining_incrementally() const { return _inlining_incrementally; }
 535   void          set_major_progress()            { _major_progress++; }
 536   void        clear_major_progress()            { _major_progress = 0; }
 537   int               num_loop_opts() const       { return _num_loop_opts; }
 538   void          set_num_loop_opts(int n)        { _num_loop_opts = n; }
 539   int               max_inline_size() const     { return _max_inline_size; }
 540   void          set_freq_inline_size(int n)     { _freq_inline_size = n; }
 541   int               freq_inline_size() const    { return _freq_inline_size; }
 542   void          set_max_inline_size(int n)      { _max_inline_size = n; }
 543   bool              has_loops() const           { return _has_loops; }
 544   void          set_has_loops(bool z)           { _has_loops = z; }
 545   bool              has_split_ifs() const       { return _has_split_ifs; }
 546   void          set_has_split_ifs(bool z)       { _has_split_ifs = z; }
 547   bool              has_unsafe_access() const   { return _has_unsafe_access; }
 548   void          set_has_unsafe_access(bool z)   { _has_unsafe_access = z; }
 549   bool              has_stringbuilder() const   { return _has_stringbuilder; }
 550   void          set_has_stringbuilder(bool z)   { _has_stringbuilder = z; }
 551   bool              has_boxed_value() const     { return _has_boxed_value; }
 552   void          set_has_boxed_value(bool z)     { _has_boxed_value = z; }
 553   int               max_vector_size() const     { return _max_vector_size; }
 554   void          set_max_vector_size(int s)      { _max_vector_size = s; }
 555   void          set_trap_count(uint r, uint c)  { assert(r < trapHistLength, "oob");        _trap_hist[r] = c; }
 556   uint              trap_count(uint r) const    { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
 557   bool              trap_can_recompile() const  { return _trap_can_recompile; }
 558   void          set_trap_can_recompile(bool z)  { _trap_can_recompile = z; }
 559   uint              decompile_count() const     { return _decompile_count; }
 560   void          set_decompile_count(uint c)     { _decompile_count = c; }
 561   bool              allow_range_check_smearing() const;
 562   bool              do_inlining() const         { return _do_inlining; }
 563   void          set_do_inlining(bool z)         { _do_inlining = z; }
 564   bool              do_scheduling() const       { return _do_scheduling; }
 565   void          set_do_scheduling(bool z)       { _do_scheduling = z; }
 566   bool              do_freq_based_layout() const{ return _do_freq_based_layout; }
 567   void          set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
 568   bool              do_count_invocations() const{ return _do_count_invocations; }
 569   void          set_do_count_invocations(bool z){ _do_count_invocations = z; }
 570   bool              do_method_data_update() const { return _do_method_data_update; }
 571   void          set_do_method_data_update(bool z) { _do_method_data_update = z; }
 572   int               AliasLevel() const          { return _AliasLevel; }
 573   bool              print_assembly() const       { return _print_assembly; }
 574   void          set_print_assembly(bool z)       { _print_assembly = z; }




 575   // check the CompilerOracle for special behaviours for this compile
 576   bool          method_has_option(const char * option) {
 577     return method() != NULL && method()->has_option(option);
 578   }
 579 #ifndef PRODUCT
 580   bool          trace_opto_output() const       { return _trace_opto_output; }
 581   bool              parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
 582   void          set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
 583 #endif
 584 
 585   // JSR 292
 586   bool              has_method_handle_invokes() const { return _has_method_handle_invokes;     }
 587   void          set_has_method_handle_invokes(bool z) {        _has_method_handle_invokes = z; }
 588 
 589   jlong _latest_stage_start_counter;
 590 
 591   void begin_method() {
 592 #ifndef PRODUCT
 593     if (_printer) _printer->begin_method(this);
 594 #endif
 595     C->_latest_stage_start_counter = os::elapsed_counter();
 596   }
 597 
 598   void print_method(CompilerPhaseType cpt, int level = 1) {
 599     EventCompilerPhase event(UNTIMED);
 600     if (event.should_commit()) {
 601       event.set_starttime(C->_latest_stage_start_counter);
 602       event.set_endtime(os::elapsed_counter());
 603       event.set_phase((u1) cpt);
 604       event.set_compileID(C->_compile_id);
 605       event.set_phaseLevel(level);
 606       event.commit();
 607     }
 608 
 609 
 610 #ifndef PRODUCT
 611     if (_printer) _printer->print_method(this, CompilerPhaseTypeHelper::to_string(cpt), level);
 612 #endif
 613     C->_latest_stage_start_counter = os::elapsed_counter();
 614   }
 615 
 616   void end_method(int level = 1) {
 617     EventCompilerPhase event(UNTIMED);
 618     if (event.should_commit()) {
 619       event.set_starttime(C->_latest_stage_start_counter);
 620       event.set_endtime(os::elapsed_counter());
 621       event.set_phase((u1) PHASE_END);
 622       event.set_compileID(C->_compile_id);
 623       event.set_phaseLevel(level);
 624       event.commit();
 625     }
 626 #ifndef PRODUCT
 627     if (_printer) _printer->end_method();
 628 #endif
 629   }
 630 
 631   int           macro_count()             const { return _macro_nodes->length(); }
 632   int           predicate_count()         const { return _predicate_opaqs->length();}
 633   int           expensive_count()         const { return _expensive_nodes->length(); }
 634   Node*         macro_node(int idx)       const { return _macro_nodes->at(idx); }
 635   Node*         predicate_opaque1_node(int idx) const { return _predicate_opaqs->at(idx);}
 636   Node*         expensive_node(int idx)   const { return _expensive_nodes->at(idx); }
 637   ConnectionGraph* congraph()                   { return _congraph;}
 638   void set_congraph(ConnectionGraph* congraph)  { _congraph = congraph;}
 639   void add_macro_node(Node * n) {
 640     //assert(n->is_macro(), "must be a macro node");
 641     assert(!_macro_nodes->contains(n), " duplicate entry in expand list");
 642     _macro_nodes->append(n);
 643   }
 644   void remove_macro_node(Node * n) {
 645     // this function may be called twice for a node so check
 646     // that the node is in the array before attempting to remove it
 647     if (_macro_nodes->contains(n))
 648       _macro_nodes->remove(n);
 649     // remove from _predicate_opaqs list also if it is there
 650     if (predicate_count() > 0 && _predicate_opaqs->contains(n)){
 651       _predicate_opaqs->remove(n);
 652     }
 653   }
 654   void add_expensive_node(Node * n);
 655   void remove_expensive_node(Node * n) {
 656     if (_expensive_nodes->contains(n)) {
 657       _expensive_nodes->remove(n);
 658     }
 659   }
 660   void add_predicate_opaq(Node * n) {
 661     assert(!_predicate_opaqs->contains(n), " duplicate entry in predicate opaque1");
 662     assert(_macro_nodes->contains(n), "should have already been in macro list");
 663     _predicate_opaqs->append(n);
 664   }
 665   // remove the opaque nodes that protect the predicates so that the unused checks and
 666   // uncommon traps will be eliminated from the graph.
 667   void cleanup_loop_predicates(PhaseIterGVN &igvn);
 668   bool is_predicate_opaq(Node * n) {
 669     return _predicate_opaqs->contains(n);
 670   }
 671 
 672   // Are there candidate expensive nodes for optimization?
 673   bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
 674   // Check whether n1 and n2 are similar
 675   static int cmp_expensive_nodes(Node* n1, Node* n2);
 676   // Sort expensive nodes to locate similar expensive nodes
 677   void sort_expensive_nodes();
 678 
 679   // Compilation environment.
 680   Arena*            comp_arena()                { return &_comp_arena; }
 681   ciEnv*            env() const                 { return _env; }
 682   CompileLog*       log() const                 { return _log; }
 683   bool              failing() const             { return _env->failing() || _failure_reason != NULL; }
 684   const char*       failure_reason() { return _failure_reason; }
 685   bool              failure_reason_is(const char* r) { return (r==_failure_reason) || (r!=NULL && _failure_reason!=NULL && strcmp(r, _failure_reason)==0); }
 686 
 687   void record_failure(const char* reason);
 688   void record_method_not_compilable(const char* reason, bool all_tiers = false) {
 689     // All bailouts cover "all_tiers" when TieredCompilation is off.
 690     if (!TieredCompilation) all_tiers = true;
 691     env()->record_method_not_compilable(reason, all_tiers);
 692     // Record failure reason.
 693     record_failure(reason);
 694   }
 695   void record_method_not_compilable_all_tiers(const char* reason) {
 696     record_method_not_compilable(reason, true);
 697   }
 698   bool check_node_count(uint margin, const char* reason) {
 699     if (live_nodes() + margin > (uint)MaxNodeLimit) {
 700       record_method_not_compilable(reason);
 701       return true;
 702     } else {
 703       return false;
 704     }
 705   }
 706 
 707   // Node management
 708   uint         unique() const              { return _unique; }
 709   uint         next_unique()               { return _unique++; }
 710   void         set_unique(uint i)          { _unique = i; }
 711   static int   debug_idx()                 { return debug_only(_debug_idx)+0; }
 712   static void  set_debug_idx(int i)        { debug_only(_debug_idx = i); }
 713   Arena*       node_arena()                { return &_node_arena; }
 714   Arena*       old_arena()                 { return &_old_arena; }
 715   RootNode*    root() const                { return _root; }
 716   void         set_root(RootNode* r)       { _root = r; }
 717   StartNode*   start() const;              // (Derived from root.)
 718   void         init_start(StartNode* s);
 719   Node*        immutable_memory();
 720 
 721   Node*        recent_alloc_ctl() const    { return _recent_alloc_ctl; }
 722   Node*        recent_alloc_obj() const    { return _recent_alloc_obj; }
 723   void         set_recent_alloc(Node* ctl, Node* obj) {
 724                                                   _recent_alloc_ctl = ctl;
 725                                                   _recent_alloc_obj = obj;
 726                                            }
 727   void         record_dead_node(uint idx)  { if (_dead_node_list.test_set(idx)) return;
 728                                              _dead_node_count++;
 729                                            }
 730   bool         is_dead_node(uint idx)      { return _dead_node_list.test(idx) != 0; }
 731   uint         dead_node_count()           { return _dead_node_count; }
 732   void         reset_dead_node_list()      { _dead_node_list.Reset();
 733                                              _dead_node_count = 0;
 734                                            }
 735   uint          live_nodes() const         {
 736     int  val = _unique - _dead_node_count;
 737     assert (val >= 0, err_msg_res("number of tracked dead nodes %d more than created nodes %d", _unique, _dead_node_count));
 738             return (uint) val;
 739                                            }
 740 #ifdef ASSERT
 741   uint         count_live_nodes_by_graph_walk();
 742   void         print_missing_nodes();
 743 #endif
 744 
 745   // Constant table
 746   ConstantTable&   constant_table() { return _constant_table; }
 747 
 748   MachConstantBaseNode*     mach_constant_base_node();
 749   bool                  has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; }
 750 
 751   // Handy undefined Node
 752   Node*             top() const                 { return _top; }
 753 
 754   // these are used by guys who need to know about creation and transformation of top:
 755   Node*             cached_top_node()           { return _top; }
 756   void          set_cached_top_node(Node* tn);
 757 
 758   GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
 759   void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
 760   Node_Notes* default_node_notes() const        { return _default_node_notes; }
 761   void    set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
 762 
 763   Node_Notes*       node_notes_at(int idx) {
 764     return locate_node_notes(_node_note_array, idx, false);
 765   }
 766   inline bool   set_node_notes_at(int idx, Node_Notes* value);
 767 
 768   // Copy notes from source to dest, if they exist.
 769   // Overwrite dest only if source provides something.
 770   // Return true if information was moved.
 771   bool copy_node_notes_to(Node* dest, Node* source);
 772 
 773   // Workhorse function to sort out the blocked Node_Notes array:
 774   inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
 775                                        int idx, bool can_grow = false);
 776 
 777   void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
 778 
 779   // Type management
 780   Arena*            type_arena()                { return _type_arena; }
 781   Dict*             type_dict()                 { return _type_dict; }
 782   void*             type_hwm()                  { return _type_hwm; }
 783   size_t            type_last_size()            { return _type_last_size; }
 784   int               num_alias_types()           { return _num_alias_types; }
 785 
 786   void          init_type_arena()                       { _type_arena = &_Compile_types; }
 787   void          set_type_arena(Arena* a)                { _type_arena = a; }
 788   void          set_type_dict(Dict* d)                  { _type_dict = d; }
 789   void          set_type_hwm(void* p)                   { _type_hwm = p; }
 790   void          set_type_last_size(size_t sz)           { _type_last_size = sz; }
 791 
 792   const TypeFunc* last_tf(ciMethod* m) {
 793     return (m == _last_tf_m) ? _last_tf : NULL;
 794   }
 795   void set_last_tf(ciMethod* m, const TypeFunc* tf) {
 796     assert(m != NULL || tf == NULL, "");
 797     _last_tf_m = m;
 798     _last_tf = tf;
 799   }
 800 
 801   AliasType*        alias_type(int                idx)  { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
 802   AliasType*        alias_type(const TypePtr* adr_type, ciField* field = NULL) { return find_alias_type(adr_type, false, field); }
 803   bool         have_alias_type(const TypePtr* adr_type);
 804   AliasType*        alias_type(ciField*         field);
 805 
 806   int               get_alias_index(const TypePtr* at)  { return alias_type(at)->index(); }
 807   const TypePtr*    get_adr_type(uint aidx)             { return alias_type(aidx)->adr_type(); }
 808   int               get_general_index(uint aidx)        { return alias_type(aidx)->general_index(); }
 809 
 810   // Building nodes
 811   void              rethrow_exceptions(JVMState* jvms);
 812   void              return_values(JVMState* jvms);
 813   JVMState*         build_start_state(StartNode* start, const TypeFunc* tf);
 814 
 815   // Decide how to build a call.
 816   // The profile factor is a discount to apply to this site's interp. profile.
 817   CallGenerator*    call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch, JVMState* jvms, bool allow_inline, float profile_factor, bool allow_intrinsics = true, bool delayed_forbidden = false);
 818   bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
 819     return should_delay_string_inlining(call_method, jvms) ||
 820            should_delay_boxing_inlining(call_method, jvms);
 821   }
 822   bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
 823   bool should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms);
 824 
 825   // Helper functions to identify inlining potential at call-site
 826   ciMethod* optimize_virtual_call(ciMethod* caller, int bci, ciInstanceKlass* klass,
 827                                   ciMethod* callee, const TypeOopPtr* receiver_type,
 828                                   bool is_virtual,
 829                                   bool &call_does_dispatch, int &vtable_index);
 830   ciMethod* optimize_inlining(ciMethod* caller, int bci, ciInstanceKlass* klass,
 831                               ciMethod* callee, const TypeOopPtr* receiver_type);
 832 
 833   // Report if there were too many traps at a current method and bci.
 834   // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
 835   // If there is no MDO at all, report no trap unless told to assume it.
 836   bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
 837   // This version, unspecific to a particular bci, asks if
 838   // PerMethodTrapLimit was exceeded for all inlined methods seen so far.
 839   bool too_many_traps(Deoptimization::DeoptReason reason,
 840                       // Privately used parameter for logging:
 841                       ciMethodData* logmd = NULL);
 842   // Report if there were too many recompiles at a method and bci.
 843   bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
 844 
 845   // Parsing, optimization
 846   PhaseGVN*         initial_gvn()               { return _initial_gvn; }
 847   Unique_Node_List* for_igvn()                  { return _for_igvn; }
 848   inline void       record_for_igvn(Node* n);   // Body is after class Unique_Node_List.
 849   void          set_initial_gvn(PhaseGVN *gvn)           { _initial_gvn = gvn; }
 850   void          set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; }
 851 
 852   // Replace n by nn using initial_gvn, calling hash_delete and
 853   // record_for_igvn as needed.
 854   void gvn_replace_by(Node* n, Node* nn);
 855 
 856 
 857   void              identify_useful_nodes(Unique_Node_List &useful);
 858   void              update_dead_node_list(Unique_Node_List &useful);
 859   void              remove_useless_nodes (Unique_Node_List &useful);
 860 
 861   WarmCallInfo*     warm_calls() const          { return _warm_calls; }
 862   void          set_warm_calls(WarmCallInfo* l) { _warm_calls = l; }
 863   WarmCallInfo* pop_warm_call();
 864 
 865   // Record this CallGenerator for inlining at the end of parsing.
 866   void              add_late_inline(CallGenerator* cg)        {
 867     _late_inlines.insert_before(_late_inlines_pos, cg);
 868     _late_inlines_pos++;
 869   }
 870 
 871   void              prepend_late_inline(CallGenerator* cg)    {
 872     _late_inlines.insert_before(0, cg);
 873   }
 874 
 875   void              add_string_late_inline(CallGenerator* cg) {
 876     _string_late_inlines.push(cg);
 877   }
 878 
 879   void              add_boxing_late_inline(CallGenerator* cg) {
 880     _boxing_late_inlines.push(cg);
 881   }
 882 
 883   void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful);
 884 
 885   void dump_inlining();
 886 
 887   bool over_inlining_cutoff() const {
 888     if (!inlining_incrementally()) {
 889       return unique() > (uint)NodeCountInliningCutoff;
 890     } else {
 891       return live_nodes() > (uint)LiveNodeCountInliningCutoff;
 892     }
 893   }
 894 
 895   void inc_number_of_mh_late_inlines() { _number_of_mh_late_inlines++; }
 896   void dec_number_of_mh_late_inlines() { assert(_number_of_mh_late_inlines > 0, "_number_of_mh_late_inlines < 0 !"); _number_of_mh_late_inlines--; }
 897   bool has_mh_late_inlines() const     { return _number_of_mh_late_inlines > 0; }
 898 
 899   void inline_incrementally_one(PhaseIterGVN& igvn);
 900   void inline_incrementally(PhaseIterGVN& igvn);
 901   void inline_string_calls(bool parse_time);
 902   void inline_boxing_calls(PhaseIterGVN& igvn);
 903 
 904   // Matching, CFG layout, allocation, code generation
 905   PhaseCFG*         cfg()                       { return _cfg; }
 906   bool              select_24_bit_instr() const { return _select_24_bit_instr; }
 907   bool              in_24_bit_fp_mode() const   { return _in_24_bit_fp_mode; }
 908   bool              has_java_calls() const      { return _java_calls > 0; }
 909   int               java_calls() const          { return _java_calls; }
 910   int               inner_loops() const         { return _inner_loops; }
 911   Matcher*          matcher()                   { return _matcher; }
 912   PhaseRegAlloc*    regalloc()                  { return _regalloc; }
 913   int               frame_slots() const         { return _frame_slots; }
 914   int               frame_size_in_words() const; // frame_slots in units of the polymorphic 'words'
 915   RegMask&          FIRST_STACK_mask()          { return _FIRST_STACK_mask; }
 916   Arena*            indexSet_arena()            { return _indexSet_arena; }
 917   void*             indexSet_free_block_list()  { return _indexSet_free_block_list; }
 918   uint              node_bundling_limit()       { return _node_bundling_limit; }
 919   Bundle*           node_bundling_base()        { return _node_bundling_base; }
 920   void          set_node_bundling_limit(uint n) { _node_bundling_limit = n; }
 921   void          set_node_bundling_base(Bundle* b) { _node_bundling_base = b; }
 922   bool          starts_bundle(const Node *n) const;
 923   bool          need_stack_bang(int frame_size_in_bytes) const;
 924   bool          need_register_stack_bang() const;
 925 
 926   void          set_matcher(Matcher* m)                 { _matcher = m; }
 927 //void          set_regalloc(PhaseRegAlloc* ra)           { _regalloc = ra; }
 928   void          set_indexSet_arena(Arena* a)            { _indexSet_arena = a; }
 929   void          set_indexSet_free_block_list(void* p)   { _indexSet_free_block_list = p; }
 930 
 931   // Remember if this compilation changes hardware mode to 24-bit precision
 932   void set_24_bit_selection_and_mode(bool selection, bool mode) {
 933     _select_24_bit_instr = selection;
 934     _in_24_bit_fp_mode   = mode;
 935   }
 936 
 937   void  set_java_calls(int z) { _java_calls  = z; }
 938   void set_inner_loops(int z) { _inner_loops = z; }
 939 
 940   // Instruction bits passed off to the VM
 941   int               code_size()                 { return _method_size; }
 942   CodeBuffer*       code_buffer()               { return &_code_buffer; }
 943   int               first_block_size()          { return _first_block_size; }
 944   void              set_frame_complete(int off) { _code_offsets.set_value(CodeOffsets::Frame_Complete, off); }
 945   ExceptionHandlerTable*  handler_table()       { return &_handler_table; }
 946   ImplicitExceptionTable* inc_table()           { return &_inc_table; }
 947   OopMapSet*        oop_map_set()               { return _oop_map_set; }
 948   DebugInformationRecorder* debug_info()        { return env()->debug_info(); }
 949   Dependencies*     dependencies()              { return env()->dependencies(); }
 950   static int        CompiledZap_count()         { return _CompiledZap_count; }
 951   BufferBlob*       scratch_buffer_blob()       { return _scratch_buffer_blob; }
 952   void         init_scratch_buffer_blob(int const_size);
 953   void        clear_scratch_buffer_blob();
 954   void          set_scratch_buffer_blob(BufferBlob* b) { _scratch_buffer_blob = b; }
 955   relocInfo*        scratch_locs_memory()       { return _scratch_locs_memory; }
 956   void          set_scratch_locs_memory(relocInfo* b)  { _scratch_locs_memory = b; }
 957 
 958   // emit to scratch blob, report resulting size
 959   uint              scratch_emit_size(const Node* n);
 960   void       set_in_scratch_emit_size(bool x)   {        _in_scratch_emit_size = x; }
 961   bool           in_scratch_emit_size() const   { return _in_scratch_emit_size;     }
 962 
 963   enum ScratchBufferBlob {
 964     MAX_inst_size       = 1024,
 965     MAX_locs_size       = 128, // number of relocInfo elements
 966     MAX_const_size      = 128,
 967     MAX_stubs_size      = 128
 968   };
 969 
 970   // Major entry point.  Given a Scope, compile the associated method.
 971   // For normal compilations, entry_bci is InvocationEntryBci.  For on stack
 972   // replacement, entry_bci indicates the bytecode for which to compile a
 973   // continuation.
 974   Compile(ciEnv* ci_env, C2Compiler* compiler, ciMethod* target,
 975           int entry_bci, bool subsume_loads, bool do_escape_analysis,
 976           bool eliminate_boxing);
 977 
 978   // Second major entry point.  From the TypeFunc signature, generate code
 979   // to pass arguments from the Java calling convention to the C calling
 980   // convention.
 981   Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
 982           address stub_function, const char *stub_name,
 983           int is_fancy_jump, bool pass_tls,
 984           bool save_arg_registers, bool return_pc);
 985 
 986   // From the TypeFunc signature, generate code to pass arguments
 987   // from Compiled calling convention to Interpreter's calling convention
 988   void Generate_Compiled_To_Interpreter_Graph(const TypeFunc *tf, address interpreter_entry);
 989 
 990   // From the TypeFunc signature, generate code to pass arguments
 991   // from Interpreter's calling convention to Compiler's calling convention
 992   void Generate_Interpreter_To_Compiled_Graph(const TypeFunc *tf);
 993 
 994   // Are we compiling a method?
 995   bool has_method() { return method() != NULL; }
 996 
 997   // Maybe print some information about this compile.
 998   void print_compile_messages();
 999 
1000   // Final graph reshaping, a post-pass after the regular optimizer is done.
1001   bool final_graph_reshaping();
1002 
1003   // returns true if adr is completely contained in the given alias category
1004   bool must_alias(const TypePtr* adr, int alias_idx);
1005 
1006   // returns true if adr overlaps with the given alias category
1007   bool can_alias(const TypePtr* adr, int alias_idx);
1008 
1009   // Driver for converting compiler's IR into machine code bits
1010   void Output();
1011 
1012   // Accessors for node bundling info.
1013   Bundle* node_bundling(const Node *n);
1014   bool valid_bundle_info(const Node *n);
1015 
1016   // Schedule and Bundle the instructions
1017   void ScheduleAndBundle();
1018 
1019   // Build OopMaps for each GC point
1020   void BuildOopMaps();
1021 
1022   // Append debug info for the node "local" at safepoint node "sfpt" to the
1023   // "array",   May also consult and add to "objs", which describes the
1024   // scalar-replaced objects.
1025   void FillLocArray( int idx, MachSafePointNode* sfpt,
1026                      Node *local, GrowableArray<ScopeValue*> *array,
1027                      GrowableArray<ScopeValue*> *objs );
1028 
1029   // If "objs" contains an ObjectValue whose id is "id", returns it, else NULL.
1030   static ObjectValue* sv_for_node_id(GrowableArray<ScopeValue*> *objs, int id);
1031   // Requres that "objs" does not contains an ObjectValue whose id matches
1032   // that of "sv.  Appends "sv".
1033   static void set_sv_for_object_node(GrowableArray<ScopeValue*> *objs,
1034                                      ObjectValue* sv );
1035 
1036   // Process an OopMap Element while emitting nodes
1037   void Process_OopMap_Node(MachNode *mach, int code_offset);
1038 
1039   // Initialize code buffer
1040   CodeBuffer* init_buffer(uint* blk_starts);
1041 
1042   // Write out basic block data to code buffer
1043   void fill_buffer(CodeBuffer* cb, uint* blk_starts);
1044 
1045   // Determine which variable sized branches can be shortened
1046   void shorten_branches(uint* blk_starts, int& code_size, int& reloc_size, int& stub_size);
1047 
1048   // Compute the size of first NumberOfLoopInstrToAlign instructions
1049   // at the head of a loop.
1050   void compute_loop_first_inst_sizes();
1051 
1052   // Compute the information for the exception tables
1053   void FillExceptionTables(uint cnt, uint *call_returns, uint *inct_starts, Label *blk_labels);
1054 
1055   // Stack slots that may be unused by the calling convention but must
1056   // otherwise be preserved.  On Intel this includes the return address.
1057   // On PowerPC it includes the 4 words holding the old TOC & LR glue.
1058   uint in_preserve_stack_slots();
1059 
1060   // "Top of Stack" slots that may be unused by the calling convention but must
1061   // otherwise be preserved.
1062   // On Intel these are not necessary and the value can be zero.
1063   // On Sparc this describes the words reserved for storing a register window
1064   // when an interrupt occurs.
1065   static uint out_preserve_stack_slots();
1066 
1067   // Number of outgoing stack slots killed above the out_preserve_stack_slots
1068   // for calls to C.  Supports the var-args backing area for register parms.
1069   uint varargs_C_out_slots_killed() const;
1070 
1071   // Number of Stack Slots consumed by a synchronization entry
1072   int sync_stack_slots() const;
1073 
1074   // Compute the name of old_SP.  See <arch>.ad for frame layout.
1075   OptoReg::Name compute_old_SP();
1076 
1077 #ifdef ENABLE_ZAP_DEAD_LOCALS
1078   static bool is_node_getting_a_safepoint(Node*);
1079   void Insert_zap_nodes();
1080   Node* call_zap_node(MachSafePointNode* n, int block_no);
1081 #endif
1082 
1083  private:
1084   // Phase control:
1085   void Init(int aliaslevel);                     // Prepare for a single compilation
1086   int  Inline_Warm();                            // Find more inlining work.
1087   void Finish_Warm();                            // Give up on further inlines.
1088   void Optimize();                               // Given a graph, optimize it
1089   void Code_Gen();                               // Generate code from a graph
1090 
1091   // Management of the AliasType table.
1092   void grow_alias_types();
1093   AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1094   const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1095   AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field);
1096 
1097   void verify_top(Node*) const PRODUCT_RETURN;
1098 
1099   // Intrinsic setup.
1100   void           register_library_intrinsics();                            // initializer
1101   CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual);          // constructor
1102   int            intrinsic_insertion_index(ciMethod* m, bool is_virtual);  // helper
1103   CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual);             // query fn
1104   void           register_intrinsic(CallGenerator* cg);                    // update fn
1105 
1106 #ifndef PRODUCT
1107   static juint  _intrinsic_hist_count[vmIntrinsics::ID_LIMIT];
1108   static jubyte _intrinsic_hist_flags[vmIntrinsics::ID_LIMIT];
1109 #endif
1110   // Function calls made by the public function final_graph_reshaping.
1111   // No need to be made public as they are not called elsewhere.
1112   void final_graph_reshaping_impl( Node *n, Final_Reshape_Counts &frc);
1113   void final_graph_reshaping_walk( Node_Stack &nstack, Node *root, Final_Reshape_Counts &frc );
1114   void eliminate_redundant_card_marks(Node* n);
1115 
1116  public:
1117 
1118   // Note:  Histogram array size is about 1 Kb.
1119   enum {                        // flag bits:
1120     _intrinsic_worked = 1,      // succeeded at least once
1121     _intrinsic_failed = 2,      // tried it but it failed
1122     _intrinsic_disabled = 4,    // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
1123     _intrinsic_virtual = 8,     // was seen in the virtual form (rare)
1124     _intrinsic_both = 16        // was seen in the non-virtual form (usual)
1125   };
1126   // Update histogram.  Return boolean if this is a first-time occurrence.
1127   static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
1128                                           bool is_virtual, int flags) PRODUCT_RETURN0;
1129   static void print_intrinsic_statistics() PRODUCT_RETURN;
1130 
1131   // Graph verification code
1132   // Walk the node list, verifying that there is a one-to-one
1133   // correspondence between Use-Def edges and Def-Use edges
1134   // The option no_dead_code enables stronger checks that the
1135   // graph is strongly connected from root in both directions.
1136   void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN;
1137 
1138   // End-of-run dumps.
1139   static void print_statistics() PRODUCT_RETURN;
1140 
1141   // Dump formatted assembly
1142   void dump_asm(int *pcs = NULL, uint pc_limit = 0) PRODUCT_RETURN;
1143   void dump_pc(int *pcs, int pc_limit, Node *n);
1144 
1145   // Verify ADLC assumptions during startup
1146   static void adlc_verification() PRODUCT_RETURN;
1147 
1148   // Definitions of pd methods
1149   static void pd_compiler2_init();
1150 
1151   // Auxiliary method for randomized fuzzing/stressing
1152   static bool randomized_select(int count);
1153 };
1154 
1155 #endif // SHARE_VM_OPTO_COMPILE_HPP
--- EOF ---