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