1 /*
   2  * Copyright (c) 1997, 2021, 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_OPTO_COMPILE_HPP
  26 #define SHARE_OPTO_COMPILE_HPP
  27 
  28 #include "asm/codeBuffer.hpp"
  29 #include "ci/compilerInterface.hpp"
  30 #include "code/debugInfoRec.hpp"
  31 #include "compiler/compiler_globals.hpp"
  32 #include "compiler/compilerOracle.hpp"
  33 #include "compiler/compileBroker.hpp"
  34 #include "compiler/compilerEvent.hpp"
  35 #include "libadt/dict.hpp"
  36 #include "libadt/vectset.hpp"
  37 #include "memory/resourceArea.hpp"
  38 #include "oops/methodData.hpp"
  39 #include "opto/idealGraphPrinter.hpp"
  40 #include "opto/phasetype.hpp"
  41 #include "opto/phase.hpp"
  42 #include "opto/regmask.hpp"
  43 #include "runtime/deoptimization.hpp"
  44 #include "runtime/sharedRuntime.hpp"
  45 #include "runtime/timerTrace.hpp"
  46 #include "runtime/vmThread.hpp"
  47 #include "utilities/ticks.hpp"
  48 
  49 class AbstractLockNode;
  50 class AddPNode;
  51 class Block;
  52 class Bundle;
  53 class CallGenerator;
  54 class CloneMap;
  55 class ConnectionGraph;
  56 class IdealGraphPrinter;
  57 class InlineTree;
  58 class Int_Array;
  59 class Matcher;
  60 class MachConstantNode;
  61 class MachConstantBaseNode;
  62 class MachNode;
  63 class MachOper;
  64 class MachSafePointNode;
  65 class Node;
  66 class Node_Array;
  67 class Node_List;
  68 class Node_Notes;
  69 class NodeCloneInfo;
  70 class OptoReg;
  71 class PhaseCFG;
  72 class PhaseGVN;
  73 class PhaseIterGVN;
  74 class PhaseRegAlloc;
  75 class PhaseCCP;
  76 class PhaseOutput;
  77 class RootNode;
  78 class relocInfo;
  79 class Scope;
  80 class StartNode;
  81 class SafePointNode;
  82 class JVMState;
  83 class Type;
  84 class TypeData;
  85 class TypeInt;
  86 class TypeInteger;
  87 class TypePtr;
  88 class TypeOopPtr;
  89 class TypeFunc;
  90 class TypeVect;
  91 class Unique_Node_List;
  92 class nmethod;
  93 class Node_Stack;
  94 struct Final_Reshape_Counts;
  95 
  96 enum LoopOptsMode {
  97   LoopOptsDefault,
  98   LoopOptsNone,
  99   LoopOptsMaxUnroll,
 100   LoopOptsShenandoahExpand,
 101   LoopOptsShenandoahPostExpand,
 102   LoopOptsSkipSplitIf,
 103   LoopOptsVerify
 104 };
 105 
 106 typedef unsigned int node_idx_t;
 107 class NodeCloneInfo {
 108  private:
 109   uint64_t _idx_clone_orig;
 110  public:
 111 
 112   void set_idx(node_idx_t idx) {
 113     _idx_clone_orig = (_idx_clone_orig & CONST64(0xFFFFFFFF00000000)) | idx;
 114   }
 115   node_idx_t idx() const { return (node_idx_t)(_idx_clone_orig & 0xFFFFFFFF); }
 116 
 117   void set_gen(int generation) {
 118     uint64_t g = (uint64_t)generation << 32;
 119     _idx_clone_orig = (_idx_clone_orig & 0xFFFFFFFF) | g;
 120   }
 121   int gen() const { return (int)(_idx_clone_orig >> 32); }
 122 
 123   void set(uint64_t x) { _idx_clone_orig = x; }
 124   void set(node_idx_t x, int g) { set_idx(x); set_gen(g); }
 125   uint64_t get() const { return _idx_clone_orig; }
 126 
 127   NodeCloneInfo(uint64_t idx_clone_orig) : _idx_clone_orig(idx_clone_orig) {}
 128   NodeCloneInfo(node_idx_t x, int g) : _idx_clone_orig(0) { set(x, g); }
 129 
 130   void dump() const;
 131 };
 132 
 133 class CloneMap {
 134   friend class Compile;
 135  private:
 136   bool      _debug;
 137   Dict*     _dict;
 138   int       _clone_idx;   // current cloning iteration/generation in loop unroll
 139  public:
 140   void*     _2p(node_idx_t key)   const          { return (void*)(intptr_t)key; } // 2 conversion functions to make gcc happy
 141   node_idx_t _2_node_idx_t(const void* k) const  { return (node_idx_t)(intptr_t)k; }
 142   Dict*     dict()                const          { return _dict; }
 143   void insert(node_idx_t key, uint64_t val)      { assert(_dict->operator[](_2p(key)) == NULL, "key existed"); _dict->Insert(_2p(key), (void*)val); }
 144   void insert(node_idx_t key, NodeCloneInfo& ci) { insert(key, ci.get()); }
 145   void remove(node_idx_t key)                    { _dict->Delete(_2p(key)); }
 146   uint64_t value(node_idx_t key)  const          { return (uint64_t)_dict->operator[](_2p(key)); }
 147   node_idx_t idx(node_idx_t key)  const          { return NodeCloneInfo(value(key)).idx(); }
 148   int gen(node_idx_t key)         const          { return NodeCloneInfo(value(key)).gen(); }
 149   int gen(const void* k)          const          { return gen(_2_node_idx_t(k)); }
 150   int max_gen()                   const;
 151   void clone(Node* old, Node* nnn, int gen);
 152   void verify_insert_and_clone(Node* old, Node* nnn, int gen);
 153   void dump(node_idx_t key)       const;
 154 
 155   int  clone_idx() const                         { return _clone_idx; }
 156   void set_clone_idx(int x)                      { _clone_idx = x; }
 157   bool is_debug()                 const          { return _debug; }
 158   void set_debug(bool debug)                     { _debug = debug; }
 159   static const char* debug_option_name;
 160 
 161   bool same_idx(node_idx_t k1, node_idx_t k2)  const { return idx(k1) == idx(k2); }
 162   bool same_gen(node_idx_t k1, node_idx_t k2)  const { return gen(k1) == gen(k2); }
 163 };
 164 
 165 class Options {
 166   friend class Compile;
 167   friend class VMStructs;
 168  private:
 169   const bool _subsume_loads;         // Load can be matched as part of a larger op.
 170   const bool _do_escape_analysis;    // Do escape analysis.
 171   const bool _eliminate_boxing;      // Do boxing elimination.
 172   const bool _do_locks_coarsening;   // Do locks coarsening
 173   const bool _install_code;          // Install the code that was compiled
 174  public:
 175   Options(bool subsume_loads, bool do_escape_analysis,
 176           bool eliminate_boxing, bool do_locks_coarsening,
 177           bool install_code) :
 178           _subsume_loads(subsume_loads),
 179           _do_escape_analysis(do_escape_analysis),
 180           _eliminate_boxing(eliminate_boxing),
 181           _do_locks_coarsening(do_locks_coarsening),
 182           _install_code(install_code) {
 183   }
 184 
 185   static Options for_runtime_stub() {
 186     return Options(
 187        /* subsume_loads = */ true,
 188        /* do_escape_analysis = */ false,
 189        /* eliminate_boxing = */ false,
 190        /* do_lock_coarsening = */ false,
 191        /* install_code = */ true
 192     );
 193   }
 194 };
 195 
 196 //------------------------------Compile----------------------------------------
 197 // This class defines a top-level Compiler invocation.
 198 
 199 class Compile : public Phase {
 200   friend class VMStructs;
 201 
 202  public:
 203   // Fixed alias indexes.  (See also MergeMemNode.)
 204   enum {
 205     AliasIdxTop = 1,  // pseudo-index, aliases to nothing (used as sentinel value)
 206     AliasIdxBot = 2,  // pseudo-index, aliases to everything
 207     AliasIdxRaw = 3   // hard-wired index for TypeRawPtr::BOTTOM
 208   };
 209 
 210   // Variant of TraceTime(NULL, &_t_accumulator, CITime);
 211   // Integrated with logging.  If logging is turned on, and CITimeVerbose is true,
 212   // then brackets are put into the log, with time stamps and node counts.
 213   // (The time collection itself is always conditionalized on CITime.)
 214   class TracePhase : public TraceTime {
 215    private:
 216     Compile*    C;
 217     CompileLog* _log;
 218     const char* _phase_name;
 219     bool _dolog;
 220    public:
 221     TracePhase(const char* name, elapsedTimer* accumulator);
 222     ~TracePhase();
 223   };
 224 
 225   // Information per category of alias (memory slice)
 226   class AliasType {
 227    private:
 228     friend class Compile;
 229 
 230     int             _index;         // unique index, used with MergeMemNode
 231     const TypePtr*  _adr_type;      // normalized address type
 232     ciField*        _field;         // relevant instance field, or null if none
 233     const Type*     _element;       // relevant array element type, or null if none
 234     bool            _is_rewritable; // false if the memory is write-once only
 235     int             _general_index; // if this is type is an instance, the general
 236                                     // type that this is an instance of
 237 
 238     void Init(int i, const TypePtr* at);
 239 
 240    public:
 241     int             index()         const { return _index; }
 242     const TypePtr*  adr_type()      const { return _adr_type; }
 243     ciField*        field()         const { return _field; }
 244     const Type*     element()       const { return _element; }
 245     bool            is_rewritable() const { return _is_rewritable; }
 246     bool            is_volatile()   const { return (_field ? _field->is_volatile() : false); }
 247     int             general_index() const { return (_general_index != 0) ? _general_index : _index; }
 248 
 249     void set_rewritable(bool z) { _is_rewritable = z; }
 250     void set_field(ciField* f) {
 251       assert(!_field,"");
 252       _field = f;
 253       if (f->is_final() || f->is_stable()) {
 254         // In the case of @Stable, multiple writes are possible but may be assumed to be no-ops.
 255         _is_rewritable = false;
 256       }
 257     }
 258     void set_element(const Type* e) {
 259       assert(_element == NULL, "");
 260       _element = e;
 261     }
 262 
 263     BasicType basic_type() const;
 264 
 265     void print_on(outputStream* st) PRODUCT_RETURN;
 266   };
 267 
 268   enum {
 269     logAliasCacheSize = 6,
 270     AliasCacheSize = (1<<logAliasCacheSize)
 271   };
 272   struct AliasCacheEntry { const TypePtr* _adr_type; int _index; };  // simple duple type
 273   enum {
 274     trapHistLength = MethodData::_trap_hist_limit
 275   };
 276 
 277  private:
 278   // Fixed parameters to this compilation.
 279   const int             _compile_id;
 280   const Options         _options;               // Compilation options
 281   ciMethod*             _method;                // The method being compiled.
 282   int                   _entry_bci;             // entry bci for osr methods.
 283   const TypeFunc*       _tf;                    // My kind of signature
 284   InlineTree*           _ilt;                   // Ditto (temporary).
 285   address               _stub_function;         // VM entry for stub being compiled, or NULL
 286   const char*           _stub_name;             // Name of stub or adapter being compiled, or NULL
 287   address               _stub_entry_point;      // Compile code entry for generated stub, or NULL
 288 
 289   // Control of this compilation.
 290   int                   _max_inline_size;       // Max inline size for this compilation
 291   int                   _freq_inline_size;      // Max hot method inline size for this compilation
 292   int                   _fixed_slots;           // count of frame slots not allocated by the register
 293                                                 // allocator i.e. locks, original deopt pc, etc.
 294   uintx                 _max_node_limit;        // Max unique node count during a single compilation.
 295 
 296   bool                  _post_loop_opts_phase;  // Loop opts are finished.
 297 
 298   int                   _major_progress;        // Count of something big happening
 299   bool                  _inlining_progress;     // progress doing incremental inlining?
 300   bool                  _inlining_incrementally;// Are we doing incremental inlining (post parse)
 301   bool                  _do_cleanup;            // Cleanup is needed before proceeding with incremental inlining
 302   bool                  _has_loops;             // True if the method _may_ have some loops
 303   bool                  _has_split_ifs;         // True if the method _may_ have some split-if
 304   bool                  _has_unsafe_access;     // True if the method _may_ produce faults in unsafe loads or stores.
 305   bool                  _has_stringbuilder;     // True StringBuffers or StringBuilders are allocated
 306   bool                  _has_boxed_value;       // True if a boxed object is allocated
 307   bool                  _has_reserved_stack_access; // True if the method or an inlined method is annotated with ReservedStackAccess
 308   uint                  _max_vector_size;       // Maximum size of generated vectors
 309   bool                  _clear_upper_avx;       // Clear upper bits of ymm registers using vzeroupper
 310   uint                  _trap_hist[trapHistLength];  // Cumulative traps
 311   bool                  _trap_can_recompile;    // Have we emitted a recompiling trap?
 312   uint                  _decompile_count;       // Cumulative decompilation counts.
 313   bool                  _do_inlining;           // True if we intend to do inlining
 314   bool                  _do_scheduling;         // True if we intend to do scheduling
 315   bool                  _do_freq_based_layout;  // True if we intend to do frequency based block layout
 316   bool                  _do_vector_loop;        // True if allowed to execute loop in parallel iterations
 317   bool                  _use_cmove;             // True if CMove should be used without profitability analysis
 318   bool                  _age_code;              // True if we need to profile code age (decrement the aging counter)
 319   int                   _AliasLevel;            // Locally-adjusted version of AliasLevel flag.
 320   bool                  _print_assembly;        // True if we should dump assembly code for this compilation
 321   bool                  _print_inlining;        // True if we should print inlining for this compilation
 322   bool                  _print_intrinsics;      // True if we should print intrinsics for this compilation
 323 #ifndef PRODUCT
 324   uint                  _igv_idx;               // Counter for IGV node identifiers
 325   bool                  _trace_opto_output;
 326   bool                  _print_ideal;
 327   bool                  _parsed_irreducible_loop; // True if ciTypeFlow detected irreducible loops during parsing
 328 #endif
 329   bool                  _has_irreducible_loop;  // Found irreducible loops
 330   // JSR 292
 331   bool                  _has_method_handle_invokes; // True if this method has MethodHandle invokes.
 332   RTMState              _rtm_state;             // State of Restricted Transactional Memory usage
 333   int                   _loop_opts_cnt;         // loop opts round
 334   bool                  _clinit_barrier_on_entry; // True if clinit barrier is needed on nmethod entry
 335   uint                  _stress_seed;           // Seed for stress testing
 336 
 337   // Compilation environment.
 338   Arena                 _comp_arena;            // Arena with lifetime equivalent to Compile
 339   void*                 _barrier_set_state;     // Potential GC barrier state for Compile
 340   ciEnv*                _env;                   // CI interface
 341   DirectiveSet*         _directive;             // Compiler directive
 342   CompileLog*           _log;                   // from CompilerThread
 343   const char*           _failure_reason;        // for record_failure/failing pattern
 344   GrowableArray<CallGenerator*> _intrinsics;    // List of intrinsics.
 345   GrowableArray<Node*>  _macro_nodes;           // List of nodes which need to be expanded before matching.
 346   GrowableArray<Node*>  _predicate_opaqs;       // List of Opaque1 nodes for the loop predicates.
 347   GrowableArray<Node*>  _skeleton_predicate_opaqs; // List of Opaque4 nodes for the loop skeleton predicates.
 348   GrowableArray<Node*>  _expensive_nodes;       // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
 349   GrowableArray<Node*>  _for_post_loop_igvn;    // List of nodes for IGVN after loop opts are over
 350   GrowableArray<Node_List*> _coarsened_locks;   // List of coarsened Lock and Unlock nodes
 351   ConnectionGraph*      _congraph;
 352 #ifndef PRODUCT
 353   IdealGraphPrinter*    _printer;
 354   static IdealGraphPrinter* _debug_file_printer;
 355   static IdealGraphPrinter* _debug_network_printer;
 356 #endif
 357 
 358 
 359   // Node management
 360   uint                  _unique;                // Counter for unique Node indices
 361   VectorSet             _dead_node_list;        // Set of dead nodes
 362   uint                  _dead_node_count;       // Number of dead nodes; VectorSet::Size() is O(N).
 363                                                 // So use this to keep count and make the call O(1).
 364   DEBUG_ONLY(Unique_Node_List* _modified_nodes;)   // List of nodes which inputs were modified
 365   DEBUG_ONLY(bool       _phase_optimize_finished;) // Used for live node verification while creating new nodes
 366 
 367   debug_only(static int _debug_idx;)            // Monotonic counter (not reset), use -XX:BreakAtNode=<idx>
 368   Arena                 _node_arena;            // Arena for new-space Nodes
 369   Arena                 _old_arena;             // Arena for old-space Nodes, lifetime during xform
 370   RootNode*             _root;                  // Unique root of compilation, or NULL after bail-out.
 371   Node*                 _top;                   // Unique top node.  (Reset by various phases.)
 372 
 373   Node*                 _immutable_memory;      // Initial memory state
 374 
 375   Node*                 _recent_alloc_obj;
 376   Node*                 _recent_alloc_ctl;
 377 
 378   // Constant table
 379   MachConstantBaseNode* _mach_constant_base_node;  // Constant table base node singleton.
 380 
 381 
 382   // Blocked array of debugging and profiling information,
 383   // tracked per node.
 384   enum { _log2_node_notes_block_size = 8,
 385          _node_notes_block_size = (1<<_log2_node_notes_block_size)
 386   };
 387   GrowableArray<Node_Notes*>* _node_note_array;
 388   Node_Notes*           _default_node_notes;  // default notes for new nodes
 389 
 390   // After parsing and every bulk phase we hang onto the Root instruction.
 391   // The RootNode instruction is where the whole program begins.  It produces
 392   // the initial Control and BOTTOM for everybody else.
 393 
 394   // Type management
 395   Arena                 _Compile_types;         // Arena for all types
 396   Arena*                _type_arena;            // Alias for _Compile_types except in Initialize_shared()
 397   Dict*                 _type_dict;             // Intern table
 398   CloneMap              _clone_map;             // used for recording history of cloned nodes
 399   size_t                _type_last_size;        // Last allocation size (see Type::operator new/delete)
 400   ciMethod*             _last_tf_m;             // Cache for
 401   const TypeFunc*       _last_tf;               //  TypeFunc::make
 402   AliasType**           _alias_types;           // List of alias types seen so far.
 403   int                   _num_alias_types;       // Logical length of _alias_types
 404   int                   _max_alias_types;       // Physical length of _alias_types
 405   AliasCacheEntry       _alias_cache[AliasCacheSize]; // Gets aliases w/o data structure walking
 406 
 407   // Parsing, optimization
 408   PhaseGVN*             _initial_gvn;           // Results of parse-time PhaseGVN
 409   Unique_Node_List*     _for_igvn;              // Initial work-list for next round of Iterative GVN
 410 
 411   GrowableArray<CallGenerator*> _late_inlines;        // List of CallGenerators to be revisited after main parsing has finished.
 412   GrowableArray<CallGenerator*> _string_late_inlines; // same but for string operations
 413   GrowableArray<CallGenerator*> _boxing_late_inlines; // same but for boxing operations
 414 
 415   GrowableArray<CallGenerator*> _vector_reboxing_late_inlines; // same but for vector reboxing operations
 416 
 417   int                           _late_inlines_pos;    // Where in the queue should the next late inlining candidate go (emulate depth first inlining)
 418   uint                          _number_of_mh_late_inlines; // number of method handle late inlining still pending
 419 
 420   GrowableArray<RuntimeStub*>   _native_invokers;
 421 
 422   // Inlining may not happen in parse order which would make
 423   // PrintInlining output confusing. Keep track of PrintInlining
 424   // pieces in order.
 425   class PrintInliningBuffer : public CHeapObj<mtCompiler> {
 426    private:
 427     CallGenerator* _cg;
 428     stringStream   _ss;
 429     static const size_t default_stream_buffer_size = 128;
 430 
 431    public:
 432     PrintInliningBuffer()
 433       : _cg(NULL), _ss(default_stream_buffer_size) {}
 434 
 435     stringStream* ss()             { return &_ss; }
 436     CallGenerator* cg()            { return _cg; }
 437     void set_cg(CallGenerator* cg) { _cg = cg; }
 438   };
 439 
 440   stringStream* _print_inlining_stream;
 441   GrowableArray<PrintInliningBuffer*>* _print_inlining_list;
 442   int _print_inlining_idx;
 443   char* _print_inlining_output;
 444 
 445   // Only keep nodes in the expensive node list that need to be optimized
 446   void cleanup_expensive_nodes(PhaseIterGVN &igvn);
 447   // Use for sorting expensive nodes to bring similar nodes together
 448   static int cmp_expensive_nodes(Node** n1, Node** n2);
 449   // Expensive nodes list already sorted?
 450   bool expensive_nodes_sorted() const;
 451   // Remove the speculative part of types and clean up the graph
 452   void remove_speculative_types(PhaseIterGVN &igvn);
 453 
 454   void* _replay_inline_data; // Pointer to data loaded from file
 455 
 456   void print_inlining_stream_free();
 457   void print_inlining_init();
 458   void print_inlining_reinit();
 459   void print_inlining_commit();
 460   void print_inlining_push();
 461   PrintInliningBuffer* print_inlining_current();
 462 
 463   void log_late_inline_failure(CallGenerator* cg, const char* msg);
 464   DEBUG_ONLY(bool _exception_backedge;)
 465 
 466  public:
 467 
 468   void* barrier_set_state() const { return _barrier_set_state; }
 469 
 470   outputStream* print_inlining_stream() const {
 471     assert(print_inlining() || print_intrinsics(), "PrintInlining off?");
 472     return _print_inlining_stream;
 473   }
 474 
 475   void print_inlining_update(CallGenerator* cg);
 476   void print_inlining_update_delayed(CallGenerator* cg);
 477   void print_inlining_move_to(CallGenerator* cg);
 478   void print_inlining_assert_ready();
 479   void print_inlining_reset();
 480 
 481   void print_inlining(ciMethod* method, int inline_level, int bci, const char* msg = NULL) {
 482     stringStream ss;
 483     CompileTask::print_inlining_inner(&ss, method, inline_level, bci, msg);
 484     print_inlining_stream()->print("%s", ss.as_string());
 485   }
 486 
 487 #ifndef PRODUCT
 488   IdealGraphPrinter* printer() { return _printer; }
 489 #endif
 490 
 491   void log_late_inline(CallGenerator* cg);
 492   void log_inline_id(CallGenerator* cg);
 493   void log_inline_failure(const char* msg);
 494 
 495   void* replay_inline_data() const { return _replay_inline_data; }
 496 
 497   // Dump inlining replay data to the stream.
 498   void dump_inline_data(outputStream* out);
 499 
 500  private:
 501   // Matching, CFG layout, allocation, code generation
 502   PhaseCFG*             _cfg;                   // Results of CFG finding
 503   int                   _java_calls;            // Number of java calls in the method
 504   int                   _inner_loops;           // Number of inner loops in the method
 505   Matcher*              _matcher;               // Engine to map ideal to machine instructions
 506   PhaseRegAlloc*        _regalloc;              // Results of register allocation.
 507   RegMask               _FIRST_STACK_mask;      // All stack slots usable for spills (depends on frame layout)
 508   Arena*                _indexSet_arena;        // control IndexSet allocation within PhaseChaitin
 509   void*                 _indexSet_free_block_list; // free list of IndexSet bit blocks
 510   int                   _interpreter_frame_size;
 511 
 512   PhaseOutput*          _output;
 513 
 514  public:
 515   // Accessors
 516 
 517   // The Compile instance currently active in this (compiler) thread.
 518   static Compile* current() {
 519     return (Compile*) ciEnv::current()->compiler_data();
 520   }
 521 
 522   int interpreter_frame_size() const            { return _interpreter_frame_size; }
 523 
 524   PhaseOutput*      output() const              { return _output; }
 525   void              set_output(PhaseOutput* o)  { _output = o; }
 526 
 527   // ID for this compilation.  Useful for setting breakpoints in the debugger.
 528   int               compile_id() const          { return _compile_id; }
 529   DirectiveSet*     directive() const           { return _directive; }
 530 
 531   // Does this compilation allow instructions to subsume loads?  User
 532   // instructions that subsume a load may result in an unschedulable
 533   // instruction sequence.
 534   bool              subsume_loads() const       { return _options._subsume_loads; }
 535   /** Do escape analysis. */
 536   bool              do_escape_analysis() const  { return _options._do_escape_analysis; }
 537   /** Do boxing elimination. */
 538   bool              eliminate_boxing() const    { return _options._eliminate_boxing; }
 539   /** Do aggressive boxing elimination. */
 540   bool              aggressive_unboxing() const { return _options._eliminate_boxing && AggressiveUnboxing; }
 541   bool              should_install_code() const { return _options._install_code; }
 542   /** Do locks coarsening. */
 543   bool              do_locks_coarsening() const { return _options._do_locks_coarsening; }
 544 
 545   // Other fixed compilation parameters.
 546   ciMethod*         method() const              { return _method; }
 547   int               entry_bci() const           { return _entry_bci; }
 548   bool              is_osr_compilation() const  { return _entry_bci != InvocationEntryBci; }
 549   bool              is_method_compilation() const { return (_method != NULL && !_method->flags().is_native()); }
 550   const TypeFunc*   tf() const                  { assert(_tf!=NULL, ""); return _tf; }
 551   void         init_tf(const TypeFunc* tf)      { assert(_tf==NULL, ""); _tf = tf; }
 552   InlineTree*       ilt() const                 { return _ilt; }
 553   address           stub_function() const       { return _stub_function; }
 554   const char*       stub_name() const           { return _stub_name; }
 555   address           stub_entry_point() const    { return _stub_entry_point; }
 556   void          set_stub_entry_point(address z) { _stub_entry_point = z; }
 557 
 558   // Control of this compilation.
 559   int               fixed_slots() const         { assert(_fixed_slots >= 0, "");         return _fixed_slots; }
 560   void          set_fixed_slots(int n)          { _fixed_slots = n; }
 561   int               major_progress() const      { return _major_progress; }
 562   void          set_inlining_progress(bool z)   { _inlining_progress = z; }
 563   int               inlining_progress() const   { return _inlining_progress; }
 564   void          set_inlining_incrementally(bool z) { _inlining_incrementally = z; }
 565   int               inlining_incrementally() const { return _inlining_incrementally; }
 566   void          set_do_cleanup(bool z)          { _do_cleanup = z; }
 567   int               do_cleanup() const          { return _do_cleanup; }
 568   void          set_major_progress()            { _major_progress++; }
 569   void          restore_major_progress(int progress) { _major_progress += progress; }
 570   void        clear_major_progress()            { _major_progress = 0; }
 571   int               max_inline_size() const     { return _max_inline_size; }
 572   void          set_freq_inline_size(int n)     { _freq_inline_size = n; }
 573   int               freq_inline_size() const    { return _freq_inline_size; }
 574   void          set_max_inline_size(int n)      { _max_inline_size = n; }
 575   bool              has_loops() const           { return _has_loops; }
 576   void          set_has_loops(bool z)           { _has_loops = z; }
 577   bool              has_split_ifs() const       { return _has_split_ifs; }
 578   void          set_has_split_ifs(bool z)       { _has_split_ifs = z; }
 579   bool              has_unsafe_access() const   { return _has_unsafe_access; }
 580   void          set_has_unsafe_access(bool z)   { _has_unsafe_access = z; }
 581   bool              has_stringbuilder() const   { return _has_stringbuilder; }
 582   void          set_has_stringbuilder(bool z)   { _has_stringbuilder = z; }
 583   bool              has_boxed_value() const     { return _has_boxed_value; }
 584   void          set_has_boxed_value(bool z)     { _has_boxed_value = z; }
 585   bool              has_reserved_stack_access() const { return _has_reserved_stack_access; }
 586   void          set_has_reserved_stack_access(bool z) { _has_reserved_stack_access = z; }
 587   uint              max_vector_size() const     { return _max_vector_size; }
 588   void          set_max_vector_size(uint s)     { _max_vector_size = s; }
 589   bool              clear_upper_avx() const     { return _clear_upper_avx; }
 590   void          set_clear_upper_avx(bool s)     { _clear_upper_avx = s; }
 591   void          set_trap_count(uint r, uint c)  { assert(r < trapHistLength, "oob");        _trap_hist[r] = c; }
 592   uint              trap_count(uint r) const    { assert(r < trapHistLength, "oob"); return _trap_hist[r]; }
 593   bool              trap_can_recompile() const  { return _trap_can_recompile; }
 594   void          set_trap_can_recompile(bool z)  { _trap_can_recompile = z; }
 595   uint              decompile_count() const     { return _decompile_count; }
 596   void          set_decompile_count(uint c)     { _decompile_count = c; }
 597   bool              allow_range_check_smearing() const;
 598   bool              do_inlining() const         { return _do_inlining; }
 599   void          set_do_inlining(bool z)         { _do_inlining = z; }
 600   bool              do_scheduling() const       { return _do_scheduling; }
 601   void          set_do_scheduling(bool z)       { _do_scheduling = z; }
 602   bool              do_freq_based_layout() const{ return _do_freq_based_layout; }
 603   void          set_do_freq_based_layout(bool z){ _do_freq_based_layout = z; }
 604   bool              do_vector_loop() const      { return _do_vector_loop; }
 605   void          set_do_vector_loop(bool z)      { _do_vector_loop = z; }
 606   bool              use_cmove() const           { return _use_cmove; }
 607   void          set_use_cmove(bool z)           { _use_cmove = z; }
 608   bool              age_code() const             { return _age_code; }
 609   void          set_age_code(bool z)             { _age_code = z; }
 610   int               AliasLevel() const           { return _AliasLevel; }
 611   bool              print_assembly() const       { return _print_assembly; }
 612   void          set_print_assembly(bool z)       { _print_assembly = z; }
 613   bool              print_inlining() const       { return _print_inlining; }
 614   void          set_print_inlining(bool z)       { _print_inlining = z; }
 615   bool              print_intrinsics() const     { return _print_intrinsics; }
 616   void          set_print_intrinsics(bool z)     { _print_intrinsics = z; }
 617   RTMState          rtm_state()  const           { return _rtm_state; }
 618   void          set_rtm_state(RTMState s)        { _rtm_state = s; }
 619   bool              use_rtm() const              { return (_rtm_state & NoRTM) == 0; }
 620   bool          profile_rtm() const              { return _rtm_state == ProfileRTM; }
 621   uint              max_node_limit() const       { return (uint)_max_node_limit; }
 622   void          set_max_node_limit(uint n)       { _max_node_limit = n; }
 623   bool              clinit_barrier_on_entry()       { return _clinit_barrier_on_entry; }
 624   void          set_clinit_barrier_on_entry(bool z) { _clinit_barrier_on_entry = z; }
 625 
 626   // check the CompilerOracle for special behaviours for this compile
 627   bool          method_has_option(enum CompileCommand option) {
 628     return method() != NULL && method()->has_option(option);
 629   }
 630 
 631 #ifndef PRODUCT
 632   uint          next_igv_idx()                  { return _igv_idx++; }
 633   bool          trace_opto_output() const       { return _trace_opto_output; }
 634   bool          print_ideal() const             { return _print_ideal; }
 635   bool              parsed_irreducible_loop() const { return _parsed_irreducible_loop; }
 636   void          set_parsed_irreducible_loop(bool z) { _parsed_irreducible_loop = z; }
 637   int _in_dump_cnt;  // Required for dumping ir nodes.
 638 #endif
 639   bool              has_irreducible_loop() const { return _has_irreducible_loop; }
 640   void          set_has_irreducible_loop(bool z) { _has_irreducible_loop = z; }
 641 
 642   // JSR 292
 643   bool              has_method_handle_invokes() const { return _has_method_handle_invokes;     }
 644   void          set_has_method_handle_invokes(bool z) {        _has_method_handle_invokes = z; }
 645 
 646   Ticks _latest_stage_start_counter;
 647 
 648   void begin_method(int level = 1) {
 649 #ifndef PRODUCT
 650     if (_method != NULL && should_print(level)) {
 651       _printer->begin_method();
 652     }
 653 #endif
 654     C->_latest_stage_start_counter.stamp();
 655   }
 656 
 657   bool should_print(int level = 1) {
 658 #ifndef PRODUCT
 659     if (PrintIdealGraphLevel < 0) { // disabled by the user
 660       return false;
 661     }
 662 
 663     bool need = directive()->IGVPrintLevelOption >= level;
 664     if (need && !_printer) {
 665       _printer = IdealGraphPrinter::printer();
 666       assert(_printer != NULL, "_printer is NULL when we need it!");
 667       _printer->set_compile(this);
 668     }
 669     return need;
 670 #else
 671     return false;
 672 #endif
 673   }
 674 
 675   void print_method(CompilerPhaseType cpt, const char *name, int level = 1);
 676   void print_method(CompilerPhaseType cpt, int level = 1, int idx = 0);
 677   void print_method(CompilerPhaseType cpt, Node* n, int level = 3);
 678 
 679 #ifndef PRODUCT
 680   void igv_print_method_to_file(const char* phase_name = "Debug", bool append = false);
 681   void igv_print_method_to_network(const char* phase_name = "Debug");
 682   static IdealGraphPrinter* debug_file_printer() { return _debug_file_printer; }
 683   static IdealGraphPrinter* debug_network_printer() { return _debug_network_printer; }
 684 #endif
 685 
 686   void end_method(int level = 1);
 687 
 688   int           macro_count()             const { return _macro_nodes.length(); }
 689   int           predicate_count()         const { return _predicate_opaqs.length(); }
 690   int           skeleton_predicate_count() const { return _skeleton_predicate_opaqs.length(); }
 691   int           expensive_count()         const { return _expensive_nodes.length(); }
 692   int           coarsened_count()         const { return _coarsened_locks.length(); }
 693 
 694   Node*         macro_node(int idx)       const { return _macro_nodes.at(idx); }
 695   Node*         predicate_opaque1_node(int idx) const { return _predicate_opaqs.at(idx); }
 696   Node*         skeleton_predicate_opaque4_node(int idx) const { return _skeleton_predicate_opaqs.at(idx); }
 697   Node*         expensive_node(int idx)   const { return _expensive_nodes.at(idx); }
 698 
 699   ConnectionGraph* congraph()                   { return _congraph;}
 700   void set_congraph(ConnectionGraph* congraph)  { _congraph = congraph;}
 701   void add_macro_node(Node * n) {
 702     //assert(n->is_macro(), "must be a macro node");
 703     assert(!_macro_nodes.contains(n), "duplicate entry in expand list");
 704     _macro_nodes.append(n);
 705   }
 706   void remove_macro_node(Node* n) {
 707     // this function may be called twice for a node so we can only remove it
 708     // if it's still existing.
 709     _macro_nodes.remove_if_existing(n);
 710     // remove from _predicate_opaqs list also if it is there
 711     if (predicate_count() > 0) {
 712       _predicate_opaqs.remove_if_existing(n);
 713     }
 714     // Remove from coarsened locks list if present
 715     if (coarsened_count() > 0) {
 716       remove_coarsened_lock(n);
 717     }
 718   }
 719   void add_expensive_node(Node* n);
 720   void remove_expensive_node(Node* n) {
 721     _expensive_nodes.remove_if_existing(n);
 722   }
 723   void add_predicate_opaq(Node* n) {
 724     assert(!_predicate_opaqs.contains(n), "duplicate entry in predicate opaque1");
 725     assert(_macro_nodes.contains(n), "should have already been in macro list");
 726     _predicate_opaqs.append(n);
 727   }
 728   void add_skeleton_predicate_opaq(Node* n) {
 729     assert(!_skeleton_predicate_opaqs.contains(n), "duplicate entry in skeleton predicate opaque4 list");
 730     _skeleton_predicate_opaqs.append(n);
 731   }
 732   void remove_skeleton_predicate_opaq(Node* n) {
 733     if (skeleton_predicate_count() > 0) {
 734       _skeleton_predicate_opaqs.remove_if_existing(n);
 735     }
 736   }
 737   void add_coarsened_locks(GrowableArray<AbstractLockNode*>& locks);
 738   void remove_coarsened_lock(Node* n);
 739   bool coarsened_locks_consistent();
 740 
 741   bool       post_loop_opts_phase() { return _post_loop_opts_phase;  }
 742   void   set_post_loop_opts_phase() { _post_loop_opts_phase = true;  }
 743   void reset_post_loop_opts_phase() { _post_loop_opts_phase = false; }
 744 
 745   void record_for_post_loop_opts_igvn(Node* n);
 746   void remove_from_post_loop_opts_igvn(Node* n);
 747   void process_for_post_loop_opts_igvn(PhaseIterGVN& igvn);
 748 
 749   void sort_macro_nodes();
 750 
 751   // remove the opaque nodes that protect the predicates so that the unused checks and
 752   // uncommon traps will be eliminated from the graph.
 753   void cleanup_loop_predicates(PhaseIterGVN &igvn);
 754   bool is_predicate_opaq(Node* n) {
 755     return _predicate_opaqs.contains(n);
 756   }
 757 
 758   // Are there candidate expensive nodes for optimization?
 759   bool should_optimize_expensive_nodes(PhaseIterGVN &igvn);
 760   // Check whether n1 and n2 are similar
 761   static int cmp_expensive_nodes(Node* n1, Node* n2);
 762   // Sort expensive nodes to locate similar expensive nodes
 763   void sort_expensive_nodes();
 764 
 765   // Compilation environment.
 766   Arena*      comp_arena()           { return &_comp_arena; }
 767   ciEnv*      env() const            { return _env; }
 768   CompileLog* log() const            { return _log; }
 769   bool        failing() const        { return _env->failing() || _failure_reason != NULL; }
 770   const char* failure_reason() const { return (_env->failing()) ? _env->failure_reason() : _failure_reason; }
 771 
 772   bool failure_reason_is(const char* r) const {
 773     return (r == _failure_reason) || (r != NULL && _failure_reason != NULL && strcmp(r, _failure_reason) == 0);
 774   }
 775 
 776   void record_failure(const char* reason);
 777   void record_method_not_compilable(const char* reason) {
 778     env()->record_method_not_compilable(reason);
 779     // Record failure reason.
 780     record_failure(reason);
 781   }
 782   bool check_node_count(uint margin, const char* reason) {
 783     if (live_nodes() + margin > max_node_limit()) {
 784       record_method_not_compilable(reason);
 785       return true;
 786     } else {
 787       return false;
 788     }
 789   }
 790 
 791   // Node management
 792   uint         unique() const              { return _unique; }
 793   uint         next_unique()               { return _unique++; }
 794   void         set_unique(uint i)          { _unique = i; }
 795   static int   debug_idx()                 { return debug_only(_debug_idx)+0; }
 796   static void  set_debug_idx(int i)        { debug_only(_debug_idx = i); }
 797   Arena*       node_arena()                { return &_node_arena; }
 798   Arena*       old_arena()                 { return &_old_arena; }
 799   RootNode*    root() const                { return _root; }
 800   void         set_root(RootNode* r)       { _root = r; }
 801   StartNode*   start() const;              // (Derived from root.)
 802   void         init_start(StartNode* s);
 803   Node*        immutable_memory();
 804 
 805   Node*        recent_alloc_ctl() const    { return _recent_alloc_ctl; }
 806   Node*        recent_alloc_obj() const    { return _recent_alloc_obj; }
 807   void         set_recent_alloc(Node* ctl, Node* obj) {
 808                                                   _recent_alloc_ctl = ctl;
 809                                                   _recent_alloc_obj = obj;
 810                                            }
 811   void         record_dead_node(uint idx)  { if (_dead_node_list.test_set(idx)) return;
 812                                              _dead_node_count++;
 813                                            }
 814   void         reset_dead_node_list()      { _dead_node_list.reset();
 815                                              _dead_node_count = 0;
 816                                            }
 817   uint          live_nodes() const         {
 818     int  val = _unique - _dead_node_count;
 819     assert (val >= 0, "number of tracked dead nodes %d more than created nodes %d", _unique, _dead_node_count);
 820             return (uint) val;
 821                                            }
 822 #ifdef ASSERT
 823   void         set_phase_optimize_finished() { _phase_optimize_finished = true; }
 824   bool         phase_optimize_finished() const { return _phase_optimize_finished; }
 825   uint         count_live_nodes_by_graph_walk();
 826   void         print_missing_nodes();
 827 #endif
 828 
 829   // Record modified nodes to check that they are put on IGVN worklist
 830   void         record_modified_node(Node* n) NOT_DEBUG_RETURN;
 831   void         remove_modified_node(Node* n) NOT_DEBUG_RETURN;
 832   DEBUG_ONLY( Unique_Node_List*   modified_nodes() const { return _modified_nodes; } )
 833 
 834   MachConstantBaseNode*     mach_constant_base_node();
 835   bool                  has_mach_constant_base_node() const { return _mach_constant_base_node != NULL; }
 836   // Generated by adlc, true if CallNode requires MachConstantBase.
 837   bool                      needs_deep_clone_jvms();
 838 
 839   // Handy undefined Node
 840   Node*             top() const                 { return _top; }
 841 
 842   // these are used by guys who need to know about creation and transformation of top:
 843   Node*             cached_top_node()           { return _top; }
 844   void          set_cached_top_node(Node* tn);
 845 
 846   GrowableArray<Node_Notes*>* node_note_array() const { return _node_note_array; }
 847   void set_node_note_array(GrowableArray<Node_Notes*>* arr) { _node_note_array = arr; }
 848   Node_Notes* default_node_notes() const        { return _default_node_notes; }
 849   void    set_default_node_notes(Node_Notes* n) { _default_node_notes = n; }
 850 
 851   Node_Notes*       node_notes_at(int idx) {
 852     return locate_node_notes(_node_note_array, idx, false);
 853   }
 854   inline bool   set_node_notes_at(int idx, Node_Notes* value);
 855 
 856   // Copy notes from source to dest, if they exist.
 857   // Overwrite dest only if source provides something.
 858   // Return true if information was moved.
 859   bool copy_node_notes_to(Node* dest, Node* source);
 860 
 861   // Workhorse function to sort out the blocked Node_Notes array:
 862   inline Node_Notes* locate_node_notes(GrowableArray<Node_Notes*>* arr,
 863                                        int idx, bool can_grow = false);
 864 
 865   void grow_node_notes(GrowableArray<Node_Notes*>* arr, int grow_by);
 866 
 867   // Type management
 868   Arena*            type_arena()                { return _type_arena; }
 869   Dict*             type_dict()                 { return _type_dict; }
 870   size_t            type_last_size()            { return _type_last_size; }
 871   int               num_alias_types()           { return _num_alias_types; }
 872 
 873   void          init_type_arena()                       { _type_arena = &_Compile_types; }
 874   void          set_type_arena(Arena* a)                { _type_arena = a; }
 875   void          set_type_dict(Dict* d)                  { _type_dict = d; }
 876   void          set_type_last_size(size_t sz)           { _type_last_size = sz; }
 877 
 878   const TypeFunc* last_tf(ciMethod* m) {
 879     return (m == _last_tf_m) ? _last_tf : NULL;
 880   }
 881   void set_last_tf(ciMethod* m, const TypeFunc* tf) {
 882     assert(m != NULL || tf == NULL, "");
 883     _last_tf_m = m;
 884     _last_tf = tf;
 885   }
 886 
 887   AliasType*        alias_type(int                idx)  { assert(idx < num_alias_types(), "oob"); return _alias_types[idx]; }
 888   AliasType*        alias_type(const TypePtr* adr_type, ciField* field = NULL) { return find_alias_type(adr_type, false, field); }
 889   bool         have_alias_type(const TypePtr* adr_type);
 890   AliasType*        alias_type(ciField*         field);
 891 
 892   int               get_alias_index(const TypePtr* at)  { return alias_type(at)->index(); }
 893   const TypePtr*    get_adr_type(uint aidx)             { return alias_type(aidx)->adr_type(); }
 894   int               get_general_index(uint aidx)        { return alias_type(aidx)->general_index(); }
 895 
 896   // Building nodes
 897   void              rethrow_exceptions(JVMState* jvms);
 898   void              return_values(JVMState* jvms);
 899   JVMState*         build_start_state(StartNode* start, const TypeFunc* tf);
 900 
 901   // Decide how to build a call.
 902   // The profile factor is a discount to apply to this site's interp. profile.
 903   CallGenerator*    call_generator(ciMethod* call_method, int vtable_index, bool call_does_dispatch,
 904                                    JVMState* jvms, bool allow_inline, float profile_factor, ciKlass* speculative_receiver_type = NULL,
 905                                    bool allow_intrinsics = true);
 906   bool should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
 907     return should_delay_string_inlining(call_method, jvms) ||
 908            should_delay_boxing_inlining(call_method, jvms) ||
 909            should_delay_vector_inlining(call_method, jvms);
 910   }
 911   bool should_delay_string_inlining(ciMethod* call_method, JVMState* jvms);
 912   bool should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms);
 913   bool should_delay_vector_inlining(ciMethod* call_method, JVMState* jvms);
 914   bool should_delay_vector_reboxing_inlining(ciMethod* call_method, JVMState* jvms);
 915 
 916   // Helper functions to identify inlining potential at call-site
 917   ciMethod* optimize_virtual_call(ciMethod* caller, ciInstanceKlass* klass,
 918                                   ciKlass* holder, ciMethod* callee,
 919                                   const TypeOopPtr* receiver_type, bool is_virtual,
 920                                   bool &call_does_dispatch, int &vtable_index,
 921                                   bool check_access = true);
 922   ciMethod* optimize_inlining(ciMethod* caller, ciInstanceKlass* klass, ciKlass* holder,
 923                               ciMethod* callee, const TypeOopPtr* receiver_type,
 924                               bool check_access = true);
 925 
 926   // Report if there were too many traps at a current method and bci.
 927   // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
 928   // If there is no MDO at all, report no trap unless told to assume it.
 929   bool too_many_traps(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
 930   // This version, unspecific to a particular bci, asks if
 931   // PerMethodTrapLimit was exceeded for all inlined methods seen so far.
 932   bool too_many_traps(Deoptimization::DeoptReason reason,
 933                       // Privately used parameter for logging:
 934                       ciMethodData* logmd = NULL);
 935   // Report if there were too many recompiles at a method and bci.
 936   bool too_many_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason);
 937   // Report if there were too many traps or recompiles at a method and bci.
 938   bool too_many_traps_or_recompiles(ciMethod* method, int bci, Deoptimization::DeoptReason reason) {
 939     return too_many_traps(method, bci, reason) ||
 940            too_many_recompiles(method, bci, reason);
 941   }
 942   // Return a bitset with the reasons where deoptimization is allowed,
 943   // i.e., where there were not too many uncommon traps.
 944   int _allowed_reasons;
 945   int      allowed_deopt_reasons() { return _allowed_reasons; }
 946   void set_allowed_deopt_reasons();
 947 
 948   // Parsing, optimization
 949   PhaseGVN*         initial_gvn()               { return _initial_gvn; }
 950   Unique_Node_List* for_igvn()                  { return _for_igvn; }
 951   inline void       record_for_igvn(Node* n);   // Body is after class Unique_Node_List.
 952   void          set_initial_gvn(PhaseGVN *gvn)           { _initial_gvn = gvn; }
 953   void          set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; }
 954 
 955   // Replace n by nn using initial_gvn, calling hash_delete and
 956   // record_for_igvn as needed.
 957   void gvn_replace_by(Node* n, Node* nn);
 958 
 959 
 960   void              identify_useful_nodes(Unique_Node_List &useful);
 961   void              update_dead_node_list(Unique_Node_List &useful);
 962   void              remove_useless_nodes (Unique_Node_List &useful);
 963 
 964   void              remove_useless_node(Node* dead);
 965 
 966   // Record this CallGenerator for inlining at the end of parsing.
 967   void              add_late_inline(CallGenerator* cg)        {
 968     _late_inlines.insert_before(_late_inlines_pos, cg);
 969     _late_inlines_pos++;
 970   }
 971 
 972   void              prepend_late_inline(CallGenerator* cg)    {
 973     _late_inlines.insert_before(0, cg);
 974   }
 975 
 976   void              add_string_late_inline(CallGenerator* cg) {
 977     _string_late_inlines.push(cg);
 978   }
 979 
 980   void              add_boxing_late_inline(CallGenerator* cg) {
 981     _boxing_late_inlines.push(cg);
 982   }
 983 
 984   void              add_vector_reboxing_late_inline(CallGenerator* cg) {
 985     _vector_reboxing_late_inlines.push(cg);
 986   }
 987 
 988   void add_native_invoker(RuntimeStub* stub);
 989 
 990   const GrowableArray<RuntimeStub*> native_invokers() const { return _native_invokers; }
 991 
 992   void remove_useless_nodes       (GrowableArray<Node*>&        node_list, Unique_Node_List &useful);
 993 
 994   void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful);
 995   void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Node* dead);
 996 
 997   void remove_useless_coarsened_locks(Unique_Node_List& useful);
 998 
 999   void process_print_inlining();
1000   void dump_print_inlining();
1001 
1002   bool over_inlining_cutoff() const {
1003     if (!inlining_incrementally()) {
1004       return unique() > (uint)NodeCountInliningCutoff;
1005     } else {
1006       // Give some room for incremental inlining algorithm to "breathe"
1007       // and avoid thrashing when live node count is close to the limit.
1008       // Keep in mind that live_nodes() isn't accurate during inlining until
1009       // dead node elimination step happens (see Compile::inline_incrementally).
1010       return live_nodes() > (uint)LiveNodeCountInliningCutoff * 11 / 10;
1011     }
1012   }
1013 
1014   void inc_number_of_mh_late_inlines() { _number_of_mh_late_inlines++; }
1015   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--; }
1016   bool has_mh_late_inlines() const     { return _number_of_mh_late_inlines > 0; }
1017 
1018   bool inline_incrementally_one();
1019   void inline_incrementally_cleanup(PhaseIterGVN& igvn);
1020   void inline_incrementally(PhaseIterGVN& igvn);
1021   void inline_string_calls(bool parse_time);
1022   void inline_boxing_calls(PhaseIterGVN& igvn);
1023   bool optimize_loops(PhaseIterGVN& igvn, LoopOptsMode mode);
1024   void remove_root_to_sfpts_edges(PhaseIterGVN& igvn);
1025 
1026   void inline_vector_reboxing_calls();
1027   bool has_vbox_nodes();
1028 
1029   void process_late_inline_calls_no_inline(PhaseIterGVN& igvn);
1030 
1031   // Matching, CFG layout, allocation, code generation
1032   PhaseCFG*         cfg()                       { return _cfg; }
1033   bool              has_java_calls() const      { return _java_calls > 0; }
1034   int               java_calls() const          { return _java_calls; }
1035   int               inner_loops() const         { return _inner_loops; }
1036   Matcher*          matcher()                   { return _matcher; }
1037   PhaseRegAlloc*    regalloc()                  { return _regalloc; }
1038   RegMask&          FIRST_STACK_mask()          { return _FIRST_STACK_mask; }
1039   Arena*            indexSet_arena()            { return _indexSet_arena; }
1040   void*             indexSet_free_block_list()  { return _indexSet_free_block_list; }
1041   DebugInformationRecorder* debug_info()        { return env()->debug_info(); }
1042 
1043   void  update_interpreter_frame_size(int size) {
1044     if (_interpreter_frame_size < size) {
1045       _interpreter_frame_size = size;
1046     }
1047   }
1048 
1049   void          set_matcher(Matcher* m)                 { _matcher = m; }
1050 //void          set_regalloc(PhaseRegAlloc* ra)           { _regalloc = ra; }
1051   void          set_indexSet_arena(Arena* a)            { _indexSet_arena = a; }
1052   void          set_indexSet_free_block_list(void* p)   { _indexSet_free_block_list = p; }
1053 
1054   void  set_java_calls(int z) { _java_calls  = z; }
1055   void set_inner_loops(int z) { _inner_loops = z; }
1056 
1057   Dependencies* dependencies() { return env()->dependencies(); }
1058 
1059   // Major entry point.  Given a Scope, compile the associated method.
1060   // For normal compilations, entry_bci is InvocationEntryBci.  For on stack
1061   // replacement, entry_bci indicates the bytecode for which to compile a
1062   // continuation.
1063   Compile(ciEnv* ci_env, ciMethod* target,
1064           int entry_bci, Options options, DirectiveSet* directive);
1065 
1066   // Second major entry point.  From the TypeFunc signature, generate code
1067   // to pass arguments from the Java calling convention to the C calling
1068   // convention.
1069   Compile(ciEnv* ci_env, const TypeFunc *(*gen)(),
1070           address stub_function, const char *stub_name,
1071           int is_fancy_jump, bool pass_tls,
1072           bool return_pc, DirectiveSet* directive);
1073 
1074   // Are we compiling a method?
1075   bool has_method() { return method() != NULL; }
1076 
1077   // Maybe print some information about this compile.
1078   void print_compile_messages();
1079 
1080   // Final graph reshaping, a post-pass after the regular optimizer is done.
1081   bool final_graph_reshaping();
1082 
1083   // returns true if adr is completely contained in the given alias category
1084   bool must_alias(const TypePtr* adr, int alias_idx);
1085 
1086   // returns true if adr overlaps with the given alias category
1087   bool can_alias(const TypePtr* adr, int alias_idx);
1088 
1089   // Stack slots that may be unused by the calling convention but must
1090   // otherwise be preserved.  On Intel this includes the return address.
1091   // On PowerPC it includes the 4 words holding the old TOC & LR glue.
1092   uint in_preserve_stack_slots() {
1093     return SharedRuntime::in_preserve_stack_slots();
1094   }
1095 
1096   // "Top of Stack" slots that may be unused by the calling convention but must
1097   // otherwise be preserved.
1098   // On Intel these are not necessary and the value can be zero.
1099   static uint out_preserve_stack_slots() {
1100     return SharedRuntime::out_preserve_stack_slots();
1101   }
1102 
1103   // Number of outgoing stack slots killed above the out_preserve_stack_slots
1104   // for calls to C.  Supports the var-args backing area for register parms.
1105   uint varargs_C_out_slots_killed() const;
1106 
1107   // Number of Stack Slots consumed by a synchronization entry
1108   int sync_stack_slots() const;
1109 
1110   // Compute the name of old_SP.  See <arch>.ad for frame layout.
1111   OptoReg::Name compute_old_SP();
1112 
1113  private:
1114   // Phase control:
1115   void Init(int aliaslevel);                     // Prepare for a single compilation
1116   int  Inline_Warm();                            // Find more inlining work.
1117   void Finish_Warm();                            // Give up on further inlines.
1118   void Optimize();                               // Given a graph, optimize it
1119   void Code_Gen();                               // Generate code from a graph
1120 
1121   // Management of the AliasType table.
1122   void grow_alias_types();
1123   AliasCacheEntry* probe_alias_cache(const TypePtr* adr_type);
1124   const TypePtr *flatten_alias_type(const TypePtr* adr_type) const;
1125   AliasType* find_alias_type(const TypePtr* adr_type, bool no_create, ciField* field);
1126 
1127   void verify_top(Node*) const PRODUCT_RETURN;
1128 
1129   // Intrinsic setup.
1130   CallGenerator* make_vm_intrinsic(ciMethod* m, bool is_virtual);          // constructor
1131   int            intrinsic_insertion_index(ciMethod* m, bool is_virtual, bool& found);  // helper
1132   CallGenerator* find_intrinsic(ciMethod* m, bool is_virtual);             // query fn
1133   void           register_intrinsic(CallGenerator* cg);                    // update fn
1134 
1135 #ifndef PRODUCT
1136   static juint  _intrinsic_hist_count[];
1137   static jubyte _intrinsic_hist_flags[];
1138 #endif
1139   // Function calls made by the public function final_graph_reshaping.
1140   // No need to be made public as they are not called elsewhere.
1141   void final_graph_reshaping_impl( Node *n, Final_Reshape_Counts &frc);
1142   void final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop);
1143   void final_graph_reshaping_walk( Node_Stack &nstack, Node *root, Final_Reshape_Counts &frc );
1144   void eliminate_redundant_card_marks(Node* n);
1145 
1146   // Logic cone optimization.
1147   void optimize_logic_cones(PhaseIterGVN &igvn);
1148   void collect_logic_cone_roots(Unique_Node_List& list);
1149   void process_logic_cone_root(PhaseIterGVN &igvn, Node* n, VectorSet& visited);
1150   bool compute_logic_cone(Node* n, Unique_Node_List& partition, Unique_Node_List& inputs);
1151   uint compute_truth_table(Unique_Node_List& partition, Unique_Node_List& inputs);
1152   uint eval_macro_logic_op(uint func, uint op1, uint op2, uint op3);
1153   Node* xform_to_MacroLogicV(PhaseIterGVN &igvn, const TypeVect* vt, Unique_Node_List& partitions, Unique_Node_List& inputs);
1154   void check_no_dead_use() const NOT_DEBUG_RETURN;
1155 
1156  public:
1157 
1158   // Note:  Histogram array size is about 1 Kb.
1159   enum {                        // flag bits:
1160     _intrinsic_worked = 1,      // succeeded at least once
1161     _intrinsic_failed = 2,      // tried it but it failed
1162     _intrinsic_disabled = 4,    // was requested but disabled (e.g., -XX:-InlineUnsafeOps)
1163     _intrinsic_virtual = 8,     // was seen in the virtual form (rare)
1164     _intrinsic_both = 16        // was seen in the non-virtual form (usual)
1165   };
1166   // Update histogram.  Return boolean if this is a first-time occurrence.
1167   static bool gather_intrinsic_statistics(vmIntrinsics::ID id,
1168                                           bool is_virtual, int flags) PRODUCT_RETURN0;
1169   static void print_intrinsic_statistics() PRODUCT_RETURN;
1170 
1171   // Graph verification code
1172   // Walk the node list, verifying that there is a one-to-one
1173   // correspondence between Use-Def edges and Def-Use edges
1174   // The option no_dead_code enables stronger checks that the
1175   // graph is strongly connected from root in both directions.
1176   void verify_graph_edges(bool no_dead_code = false) PRODUCT_RETURN;
1177 
1178   // End-of-run dumps.
1179   static void print_statistics() PRODUCT_RETURN;
1180 
1181   // Verify ADLC assumptions during startup
1182   static void adlc_verification() PRODUCT_RETURN;
1183 
1184   // Definitions of pd methods
1185   static void pd_compiler2_init();
1186 
1187   // Static parse-time type checking logic for gen_subtype_check:
1188   enum { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test };
1189   int static_subtype_check(ciKlass* superk, ciKlass* subk);
1190 
1191   static Node* conv_I2X_index(PhaseGVN* phase, Node* offset, const TypeInt* sizetype,
1192                               // Optional control dependency (for example, on range check)
1193                               Node* ctrl = NULL);
1194 
1195   // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check)
1196   static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl, bool carry_dependency = false);
1197 
1198   // Auxiliary methods for randomized fuzzing/stressing
1199   int random();
1200   bool randomized_select(int count);
1201 
1202   // supporting clone_map
1203   CloneMap&     clone_map();
1204   void          set_clone_map(Dict* d);
1205 
1206   bool needs_clinit_barrier(ciField* ik,         ciMethod* accessing_method);
1207   bool needs_clinit_barrier(ciMethod* ik,        ciMethod* accessing_method);
1208   bool needs_clinit_barrier(ciInstanceKlass* ik, ciMethod* accessing_method);
1209 
1210 #ifdef IA32
1211  private:
1212   bool _select_24_bit_instr;   // We selected an instruction with a 24-bit result
1213   bool _in_24_bit_fp_mode;     // We are emitting instructions with 24-bit results
1214 
1215   // Remember if this compilation changes hardware mode to 24-bit precision.
1216   void set_24_bit_selection_and_mode(bool selection, bool mode) {
1217     _select_24_bit_instr = selection;
1218     _in_24_bit_fp_mode   = mode;
1219   }
1220 
1221  public:
1222   bool select_24_bit_instr() const { return _select_24_bit_instr; }
1223   bool in_24_bit_fp_mode() const   { return _in_24_bit_fp_mode; }
1224 #endif // IA32
1225 #ifdef ASSERT
1226   bool _type_verify_symmetry;
1227   void set_exception_backedge() { _exception_backedge = true; }
1228   bool has_exception_backedge() const { return _exception_backedge; }
1229 #endif
1230 
1231   static bool push_thru_add(PhaseGVN* phase, Node* z, const TypeInteger* tz, const TypeInteger*& rx, const TypeInteger*& ry,
1232                             BasicType bt);
1233 
1234   static Node* narrow_value(BasicType bt, Node* value, const Type* type, PhaseGVN* phase, bool transform_res);
1235 };
1236 
1237 #endif // SHARE_OPTO_COMPILE_HPP