1 /*
   2  * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #ifndef SHARE_VM_OPTO_PARSE_HPP
  26 #define SHARE_VM_OPTO_PARSE_HPP
  27 
  28 #include "ci/ciMethodData.hpp"
  29 #include "ci/ciTypeFlow.hpp"
  30 #include "compiler/methodLiveness.hpp"
  31 #include "libadt/vectset.hpp"
  32 #include "oops/generateOopMap.hpp"
  33 #include "opto/graphKit.hpp"
  34 #include "opto/subnode.hpp"
  35 
  36 class BytecodeParseHistogram;
  37 class InlineTree;
  38 class Parse;
  39 class SwitchRange;
  40 
  41 
  42 //------------------------------InlineTree-------------------------------------
  43 class InlineTree : public ResourceObj {
  44   friend class VMStructs;
  45 
  46   Compile*    C;                  // cache
  47   JVMState*   _caller_jvms;       // state of caller
  48   ciMethod*   _method;            // method being called by the caller_jvms
  49   InlineTree* _caller_tree;
  50   uint        _count_inline_bcs;  // Accumulated count of inlined bytecodes
  51   // Call-site count / interpreter invocation count, scaled recursively.
  52   // Always between 0.0 and 1.0.  Represents the percentage of the method's
  53   // total execution time used at this call site.
  54   const float _site_invoke_ratio;
  55   const int   _max_inline_level;  // the maximum inline level for this sub-tree (may be adjusted)
  56   float compute_callee_frequency( int caller_bci ) const;
  57 
  58   GrowableArray<InlineTree*> _subtrees;
  59 
  60   void print_impl(outputStream* stj, int indent) const PRODUCT_RETURN;
  61   const char* _msg;
  62 protected:
  63   InlineTree(Compile* C,
  64              const InlineTree* caller_tree,
  65              ciMethod* callee_method,
  66              JVMState* caller_jvms,
  67              int caller_bci,
  68              float site_invoke_ratio,
  69              int max_inline_level);
  70   InlineTree *build_inline_tree_for_callee(ciMethod* callee_method,
  71                                            JVMState* caller_jvms,
  72                                            int caller_bci);
  73   bool        try_to_inline(ciMethod* callee_method,
  74                             ciMethod* caller_method,
  75                             int caller_bci,
  76                             JVMState* jvms,
  77                             ciCallProfile& profile,
  78                             WarmCallInfo* wci_result,
  79                             bool& should_delay);
  80   bool        should_inline(ciMethod* callee_method,
  81                             ciMethod* caller_method,
  82                             int caller_bci,
  83                             ciCallProfile& profile,
  84                             WarmCallInfo* wci_result);
  85   bool        should_not_inline(ciMethod* callee_method,
  86                                 ciMethod* caller_method,
  87                                 JVMState* jvms,
  88                                 WarmCallInfo* wci_result);
  89   void        print_inlining(ciMethod* callee_method, int caller_bci,
  90                              ciMethod* caller_method, bool success) const;
  91 
  92   InlineTree* caller_tree()       const { return _caller_tree;  }
  93   InlineTree* callee_at(int bci, ciMethod* m) const;
  94   int         inline_level()      const { return stack_depth(); }
  95   int         stack_depth()       const { return _caller_jvms ? _caller_jvms->depth() : 0; }
  96   const char* msg()               const { return _msg; }
  97   void        set_msg(const char* msg)  { _msg = msg; }
  98 public:
  99   static const char* check_can_parse(ciMethod* callee);
 100 
 101   static InlineTree* build_inline_tree_root();
 102   static InlineTree* find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee);
 103 
 104   // For temporary (stack-allocated, stateless) ilts:
 105   InlineTree(Compile* c, ciMethod* callee_method, JVMState* caller_jvms, float site_invoke_ratio, int max_inline_level);
 106 
 107   // See if it is OK to inline.
 108   // The receiver is the inline tree for the caller.
 109   //
 110   // The result is a temperature indication.  If it is hot or cold,
 111   // inlining is immediate or undesirable.  Otherwise, the info block
 112   // returned is newly allocated and may be enqueued.
 113   //
 114   // If the method is inlinable, a new inline subtree is created on the fly,
 115   // and may be accessed by find_subtree_from_root.
 116   // The call_method is the dest_method for a special or static invocation.
 117   // The call_method is an optimized virtual method candidate otherwise.
 118   WarmCallInfo* ok_to_inline(ciMethod *call_method, JVMState* caller_jvms, ciCallProfile& profile, WarmCallInfo* wci, bool& should_delay);
 119 
 120   // Information about inlined method
 121   JVMState*   caller_jvms()       const { return _caller_jvms; }
 122   ciMethod   *method()            const { return _method; }
 123   int         caller_bci()        const { return _caller_jvms ? _caller_jvms->bci() : InvocationEntryBci; }
 124   uint        count_inline_bcs()  const { return _count_inline_bcs; }
 125   float       site_invoke_ratio() const { return _site_invoke_ratio; };
 126 
 127 #ifndef PRODUCT
 128 private:
 129   uint        _count_inlines;     // Count of inlined methods
 130 public:
 131   // Debug information collected during parse
 132   uint        count_inlines()     const { return _count_inlines; };
 133 #endif
 134   GrowableArray<InlineTree*> subtrees() { return _subtrees; }
 135 
 136   void print_value_on(outputStream* st) const PRODUCT_RETURN;
 137 
 138   bool        _forced_inline;     // Inlining was forced by CompilerOracle, ciReplay or annotation
 139   bool        forced_inline()     const { return _forced_inline; }
 140   // Count number of nodes in this subtree
 141   int         count() const;
 142   // Dump inlining replay data to the stream.
 143   void dump_replay_data(outputStream* out);
 144 };
 145 
 146 
 147 //-----------------------------------------------------------------------------
 148 //------------------------------Parse------------------------------------------
 149 // Parse bytecodes, build a Graph
 150 class Parse : public GraphKit {
 151  public:
 152   // Per-block information needed by the parser:
 153   class Block {
 154    private:
 155     ciTypeFlow::Block* _flow;
 156     int                _pred_count;     // how many predecessors in CFG?
 157     int                _preds_parsed;   // how many of these have been parsed?
 158     uint               _count;          // how many times executed?  Currently only set by _goto's
 159     bool               _is_parsed;      // has this block been parsed yet?
 160     bool               _is_handler;     // is this block an exception handler?
 161     bool               _has_merged_backedge; // does this block have merged backedge?
 162     SafePointNode*     _start_map;      // all values flowing into this block
 163     MethodLivenessResult _live_locals;  // lazily initialized liveness bitmap
 164     bool               _has_predicates; // Were predicates added before parsing of the loop head?
 165 
 166     int                _num_successors; // Includes only normal control flow.
 167     int                _all_successors; // Include exception paths also.
 168     Block**            _successors;
 169 
 170    public:
 171 
 172     // Set up the block data structure itself.
 173     Block(Parse* outer, int rpo);
 174 
 175     // Set up the block's relations to other blocks.
 176     void init_graph(Parse* outer);
 177 
 178     ciTypeFlow::Block* flow() const        { return _flow; }
 179     int pred_count() const                 { return _pred_count; }
 180     int preds_parsed() const               { return _preds_parsed; }
 181     bool is_parsed() const                 { return _is_parsed; }
 182     bool is_handler() const                { return _is_handler; }
 183     void set_count( uint x )               { _count = x; }
 184     uint count() const                     { return _count; }
 185 
 186     SafePointNode* start_map() const       { assert(is_merged(),"");   return _start_map; }
 187     void set_start_map(SafePointNode* m)   { assert(!is_merged(), ""); _start_map = m; }
 188 
 189     // True after any predecessor flows control into this block
 190     bool is_merged() const                 { return _start_map != NULL; }
 191 
 192 #ifdef ASSERT
 193     // True after backedge predecessor flows control into this block
 194     bool has_merged_backedge() const       { return _has_merged_backedge; }
 195     void mark_merged_backedge(Block* pred) {
 196       assert(is_SEL_head(), "should be loop head");
 197       if (pred != NULL && is_SEL_backedge(pred)) {
 198         assert(is_parsed(), "block should be parsed before merging backedges");
 199         _has_merged_backedge = true;
 200       }
 201     }
 202 #endif
 203 
 204     // True when all non-exception predecessors have been parsed.
 205     bool is_ready() const                  { return preds_parsed() == pred_count(); }
 206 
 207     bool has_predicates() const            { return _has_predicates; }
 208     void set_has_predicates()              { _has_predicates = true; }
 209 
 210     int num_successors() const             { return _num_successors; }
 211     int all_successors() const             { return _all_successors; }
 212     Block* successor_at(int i) const {
 213       assert((uint)i < (uint)all_successors(), "");
 214       return _successors[i];
 215     }
 216     Block* successor_for_bci(int bci);
 217 
 218     int start() const                      { return flow()->start(); }
 219     int limit() const                      { return flow()->limit(); }
 220     int rpo() const                        { return flow()->rpo(); }
 221     int start_sp() const                   { return flow()->stack_size(); }
 222 
 223     bool is_loop_head() const              { return flow()->is_loop_head(); }
 224     bool is_SEL_head() const               { return flow()->is_single_entry_loop_head(); }
 225     bool is_SEL_backedge(Block* pred) const{ return is_SEL_head() && pred->rpo() >= rpo(); }
 226     bool is_invariant_local(uint i) const  {
 227       const JVMState* jvms = start_map()->jvms();
 228       if (!jvms->is_loc(i) || flow()->outer()->has_irreducible_entry()) return false;
 229       return flow()->is_invariant_local(i - jvms->locoff());
 230     }
 231     bool can_elide_SEL_phi(uint i) const  { assert(is_SEL_head(),""); return is_invariant_local(i); }
 232 
 233     const Type* peek(int off=0) const      { return stack_type_at(start_sp() - (off+1)); }
 234 
 235     const Type* stack_type_at(int i) const;
 236     const Type* local_type_at(int i) const;
 237     static const Type* get_type(ciType* t) { return Type::get_typeflow_type(t); }
 238 
 239     bool has_trap_at(int bci) const        { return flow()->has_trap() && flow()->trap_bci() == bci; }
 240 
 241     // Call this just before parsing a block.
 242     void mark_parsed() {
 243       assert(!_is_parsed, "must parse each block exactly once");
 244       _is_parsed = true;
 245     }
 246 
 247     // Return the phi/region input index for the "current" pred,
 248     // and bump the pred number.  For historical reasons these index
 249     // numbers are handed out in descending order.  The last index is
 250     // always PhiNode::Input (i.e., 1).  The value returned is known
 251     // as a "path number" because it distinguishes by which path we are
 252     // entering the block.
 253     int next_path_num() {
 254       assert(preds_parsed() < pred_count(), "too many preds?");
 255       return pred_count() - _preds_parsed++;
 256     }
 257 
 258     // Add a previously unaccounted predecessor to this block.
 259     // This operates by increasing the size of the block's region
 260     // and all its phi nodes (if any).  The value returned is a
 261     // path number ("pnum").
 262     int add_new_path();
 263 
 264     // Initialize me by recording the parser's map.  My own map must be NULL.
 265     void record_state(Parse* outer);
 266   };
 267 
 268 #ifndef PRODUCT
 269   // BytecodeParseHistogram collects number of bytecodes parsed, nodes constructed, and transformations.
 270   class BytecodeParseHistogram : public ResourceObj {
 271    private:
 272     enum BPHType {
 273       BPH_transforms,
 274       BPH_values
 275     };
 276     static bool _initialized;
 277     static uint _bytecodes_parsed [Bytecodes::number_of_codes];
 278     static uint _nodes_constructed[Bytecodes::number_of_codes];
 279     static uint _nodes_transformed[Bytecodes::number_of_codes];
 280     static uint _new_values       [Bytecodes::number_of_codes];
 281 
 282     Bytecodes::Code _initial_bytecode;
 283     int             _initial_node_count;
 284     int             _initial_transforms;
 285     int             _initial_values;
 286 
 287     Parse     *_parser;
 288     Compile   *_compiler;
 289 
 290     // Initialization
 291     static void reset();
 292 
 293     // Return info being collected, select with global flag 'BytecodeParseInfo'
 294     int current_count(BPHType info_selector);
 295 
 296    public:
 297     BytecodeParseHistogram(Parse *p, Compile *c);
 298     static bool initialized();
 299 
 300     // Record info when starting to parse one bytecode
 301     void set_initial_state( Bytecodes::Code bc );
 302     // Record results of parsing one bytecode
 303     void record_change();
 304 
 305     // Profile printing
 306     static void print(float cutoff = 0.01F); // cutoff in percent
 307   };
 308 
 309   public:
 310     // Record work done during parsing
 311     BytecodeParseHistogram* _parse_histogram;
 312     void set_parse_histogram(BytecodeParseHistogram *bph) { _parse_histogram = bph; }
 313     BytecodeParseHistogram* parse_histogram()      { return _parse_histogram; }
 314 #endif
 315 
 316  private:
 317   friend class Block;
 318 
 319   // Variables which characterize this compilation as a whole:
 320 
 321   JVMState*     _caller;        // JVMS which carries incoming args & state.
 322   float         _expected_uses; // expected number of calls to this code
 323   float         _prof_factor;   // discount applied to my profile counts
 324   int           _depth;         // Inline tree depth, for debug printouts
 325   const TypeFunc*_tf;           // My kind of function type
 326   int           _entry_bci;     // the osr bci or InvocationEntryBci
 327 
 328   ciTypeFlow*   _flow;          // Results of previous flow pass.
 329   Block*        _blocks;        // Array of basic-block structs.
 330   int           _block_count;   // Number of elements in _blocks.
 331 
 332   GraphKit      _exits;         // Record all normal returns and throws here.
 333   bool          _wrote_final;   // Did we write a final field?
 334   bool          _wrote_volatile;     // Did we write a volatile field?
 335   bool          _wrote_stable;       // Did we write a @Stable field?
 336   bool          _wrote_fields;       // Did we write any field?
 337   bool          _count_invocations;  // update and test invocation counter
 338   bool          _method_data_update; // update method data oop
 339   Node*         _alloc_with_final;   // An allocation node with final field
 340 
 341   // Variables which track Java semantics during bytecode parsing:
 342 
 343   Block*            _block;     // block currently getting parsed
 344   ciBytecodeStream  _iter;      // stream of this method's bytecodes
 345 
 346   const FastLockNode* _synch_lock; // FastLockNode for synchronized method
 347 
 348 #ifndef PRODUCT
 349   int _max_switch_depth;        // Debugging SwitchRanges.
 350   int _est_switch_depth;        // Debugging SwitchRanges.
 351 #endif
 352 
 353   bool         _first_return;                  // true if return is the first to be parsed
 354   bool         _replaced_nodes_for_exceptions; // needs processing of replaced nodes in exception paths?
 355   uint         _new_idx;                       // any node with _idx above were new during this parsing. Used to trim the replaced nodes list.
 356 
 357  public:
 358   // Constructor
 359   Parse(JVMState* caller, ciMethod* parse_method, float expected_uses);
 360 
 361   virtual Parse* is_Parse() const { return (Parse*)this; }
 362 
 363   // Accessors.
 364   JVMState*     caller()        const { return _caller; }
 365   float         expected_uses() const { return _expected_uses; }
 366   float         prof_factor()   const { return _prof_factor; }
 367   int           depth()         const { return _depth; }
 368   const TypeFunc* tf()          const { return _tf; }
 369   //            entry_bci()     -- see osr_bci, etc.
 370 
 371   ciTypeFlow*   flow()          const { return _flow; }
 372   //            blocks()        -- see rpo_at, start_block, etc.
 373   int           block_count()   const { return _block_count; }
 374 
 375   GraphKit&     exits()               { return _exits; }
 376   bool          wrote_final() const   { return _wrote_final; }
 377   void      set_wrote_final(bool z)   { _wrote_final = z; }
 378   bool          wrote_volatile() const { return _wrote_volatile; }
 379   void      set_wrote_volatile(bool z) { _wrote_volatile = z; }
 380   bool          wrote_stable() const  { return _wrote_stable; }
 381   void      set_wrote_stable(bool z)  { _wrote_stable = z; }
 382   bool         wrote_fields() const   { return _wrote_fields; }
 383   void     set_wrote_fields(bool z)   { _wrote_fields = z; }
 384   bool          count_invocations() const  { return _count_invocations; }
 385   bool          method_data_update() const { return _method_data_update; }
 386   Node*    alloc_with_final() const   { return _alloc_with_final; }
 387   void set_alloc_with_final(Node* n)  {
 388     assert((_alloc_with_final == NULL) || (_alloc_with_final == n), "different init objects?");
 389     _alloc_with_final = n;
 390   }
 391 
 392   Block*             block()    const { return _block; }
 393   ciBytecodeStream&  iter()           { return _iter; }
 394   Bytecodes::Code    bc()       const { return _iter.cur_bc(); }
 395 
 396   void set_block(Block* b)            { _block = b; }
 397 
 398   // Derived accessors:
 399   bool is_normal_parse() const  { return _entry_bci == InvocationEntryBci; }
 400   bool is_osr_parse() const     { return _entry_bci != InvocationEntryBci; }
 401   int osr_bci() const           { assert(is_osr_parse(),""); return _entry_bci; }
 402 
 403   void set_parse_bci(int bci);
 404 
 405   // Must this parse be aborted?
 406   bool failing()                { return C->failing(); }
 407 
 408   Block* rpo_at(int rpo) {
 409     assert(0 <= rpo && rpo < _block_count, "oob");
 410     return &_blocks[rpo];
 411   }
 412   Block* start_block() {
 413     return rpo_at(flow()->start_block()->rpo());
 414   }
 415   // Can return NULL if the flow pass did not complete a block.
 416   Block* successor_for_bci(int bci) {
 417     return block()->successor_for_bci(bci);
 418   }
 419 
 420  private:
 421   // Create a JVMS & map for the initial state of this method.
 422   SafePointNode* create_entry_map();
 423 
 424   // OSR helpers
 425   Node *fetch_interpreter_state(int index, BasicType bt, Node *local_addrs, Node *local_addrs_base);
 426   Node* check_interpreter_type(Node* l, const Type* type, SafePointNode* &bad_type_exit);
 427   void  load_interpreter_state(Node* osr_buf);
 428 
 429   // Functions for managing basic blocks:
 430   void init_blocks();
 431   void load_state_from(Block* b);
 432   void store_state_to(Block* b) { b->record_state(this); }
 433 
 434   // Parse all the basic blocks.
 435   void do_all_blocks();
 436 
 437   // Parse the current basic block
 438   void do_one_block();
 439 
 440   // Raise an error if we get a bad ciTypeFlow CFG.
 441   void handle_missing_successor(int bci);
 442 
 443   // first actions (before BCI 0)
 444   void do_method_entry();
 445 
 446   // implementation of monitorenter/monitorexit
 447   void do_monitor_enter();
 448   void do_monitor_exit();
 449 
 450   // Eagerly create phie throughout the state, to cope with back edges.
 451   void ensure_phis_everywhere();
 452 
 453   // Merge the current mapping into the basic block starting at bci
 454   void merge(          int target_bci);
 455   // Same as plain merge, except that it allocates a new path number.
 456   void merge_new_path( int target_bci);
 457   // Merge the current mapping into an exception handler.
 458   void merge_exception(int target_bci);
 459   // Helper: Merge the current mapping into the given basic block
 460   void merge_common(Block* target, int pnum);
 461   // Helper functions for merging individual cells.
 462   PhiNode *ensure_phi(       int idx, bool nocreate = false);
 463   PhiNode *ensure_memory_phi(int idx, bool nocreate = false);
 464   // Helper to merge the current memory state into the given basic block
 465   void merge_memory_edges(MergeMemNode* n, int pnum, bool nophi);
 466 
 467   // Parse this bytecode, and alter the Parsers JVM->Node mapping
 468   void do_one_bytecode();
 469 
 470   // helper function to generate array store check
 471   void array_store_check();
 472   // Helper function to generate array load
 473   void array_load(BasicType etype);
 474   // Helper function to generate array store
 475   void array_store(BasicType etype);
 476   // Helper function to compute array addressing
 477   Node* array_addressing(BasicType type, int vals, const Type* *result2=NULL);
 478 
 479   void rtm_deopt();
 480 
 481   // Pass current map to exits
 482   void return_current(Node* value);
 483 
 484   // Register finalizers on return from Object.<init>
 485   void call_register_finalizer();
 486 
 487   // Insert a compiler safepoint into the graph
 488   void add_safepoint();
 489 
 490   // Insert a compiler safepoint into the graph, if there is a back-branch.
 491   void maybe_add_safepoint(int target_bci) {
 492     if (UseLoopSafepoints && target_bci <= bci()) {
 493       add_safepoint();
 494     }
 495   }
 496 
 497   // Note:  Intrinsic generation routines may be found in library_call.cpp.
 498 
 499   // Helper function to setup Ideal Call nodes
 500   void do_call();
 501 
 502   // Helper function to uncommon-trap or bailout for non-compilable call-sites
 503   bool can_not_compile_call_site(ciMethod *dest_method, ciInstanceKlass *klass);
 504 
 505   // Helper function to setup for type-profile based inlining
 506   bool prepare_type_profile_inline(ciInstanceKlass* prof_klass, ciMethod* prof_method);
 507 
 508   // Helper functions for type checking bytecodes:
 509   void  do_checkcast();
 510   void  do_instanceof();
 511 
 512   // Helper functions for shifting & arithmetic
 513   void modf();
 514   void modd();
 515   void l2f();
 516 
 517   void do_irem();
 518 
 519   // implementation of _get* and _put* bytecodes
 520   void do_getstatic() { do_field_access(true,  false); }
 521   void do_getfield () { do_field_access(true,  true); }
 522   void do_putstatic() { do_field_access(false, false); }
 523   void do_putfield () { do_field_access(false, true); }
 524 
 525   // common code for making initial checks and forming addresses
 526   void do_field_access(bool is_get, bool is_field);
 527   bool static_field_ok_in_clinit(ciField *field, ciMethod *method);
 528 
 529   // common code for actually performing the load or store
 530   void do_get_xxx(Node* obj, ciField* field, bool is_field);
 531   void do_put_xxx(Node* obj, ciField* field, bool is_field);
 532 
 533   // implementation of object creation bytecodes
 534   void emit_guard_for_new(ciInstanceKlass* klass);
 535   void do_new();
 536   void do_newarray(BasicType elemtype);
 537   void do_anewarray();
 538   void do_multianewarray();
 539   Node* expand_multianewarray(ciArrayKlass* array_klass, Node* *lengths, int ndimensions, int nargs);
 540 
 541   // implementation of jsr/ret
 542   void do_jsr();
 543   void do_ret();
 544 
 545   float   dynamic_branch_prediction(float &cnt, BoolTest::mask btest, Node* test);
 546   float   branch_prediction(float &cnt, BoolTest::mask btest, int target_bci, Node* test);
 547   bool    seems_never_taken(float prob) const;
 548   bool    path_is_suitable_for_uncommon_trap(float prob) const;
 549   bool    seems_stable_comparison() const;
 550 
 551   void    do_ifnull(BoolTest::mask btest, Node* c);
 552   void    do_if(BoolTest::mask btest, Node* c);
 553   int     repush_if_args();
 554   void    adjust_map_after_if(BoolTest::mask btest, Node* c, float prob,
 555                               Block* path, Block* other_path);
 556   void    sharpen_type_after_if(BoolTest::mask btest,
 557                                 Node* con, const Type* tcon,
 558                                 Node* val, const Type* tval);
 559   void    maybe_add_predicate_after_if(Block* path);
 560   IfNode* jump_if_fork_int(Node* a, Node* b, BoolTest::mask mask, float prob, float cnt);
 561   Node*   jump_if_join(Node* iffalse, Node* iftrue);
 562   void    jump_if_true_fork(IfNode *ifNode, int dest_bci_if_true, int prof_table_index, bool unc);
 563   void    jump_if_false_fork(IfNode *ifNode, int dest_bci_if_false, int prof_table_index, bool unc);
 564   void    jump_if_always_fork(int dest_bci_if_true, int prof_table_index, bool unc);
 565 
 566   friend class SwitchRange;
 567   void    do_tableswitch();
 568   void    do_lookupswitch();
 569   void    jump_switch_ranges(Node* a, SwitchRange* lo, SwitchRange* hi, int depth = 0);
 570   bool    create_jump_tables(Node* a, SwitchRange* lo, SwitchRange* hi);
 571   void    linear_search_switch_ranges(Node* key_val, SwitchRange*& lo, SwitchRange*& hi);
 572 
 573   void decrement_age();
 574   // helper functions for methodData style profiling
 575   void test_counter_against_threshold(Node* cnt, int limit);
 576   void increment_and_test_invocation_counter(int limit);
 577   void test_for_osr_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize offset, int limit);
 578   Node* method_data_addressing(ciMethodData* md, ciProfileData* data, ByteSize offset, Node* idx = NULL, uint stride = 0);
 579   void increment_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize offset, Node* idx = NULL, uint stride = 0);
 580   void set_md_flag_at(ciMethodData* md, ciProfileData* data, int flag_constant);
 581 
 582   void profile_method_entry();
 583   void profile_taken_branch(int target_bci, bool force_update = false);
 584   void profile_not_taken_branch(bool force_update = false);
 585   void profile_call(Node* receiver);
 586   void profile_generic_call();
 587   void profile_receiver_type(Node* receiver);
 588   void profile_ret(int target_bci);
 589   void profile_null_checkcast();
 590   void profile_switch_case(int table_index);
 591 
 592   // helper function for call statistics
 593   void count_compiled_calls(bool at_method_entry, bool is_inline) PRODUCT_RETURN;
 594 
 595   Node_Notes* make_node_notes(Node_Notes* caller_nn);
 596 
 597   // Helper functions for handling normal and abnormal exits.
 598   void build_exits();
 599 
 600   // Fix up all exceptional control flow exiting a single bytecode.
 601   void do_exceptions();
 602 
 603   // Fix up all exiting control flow at the end of the parse.
 604   void do_exits();
 605 
 606   // Add Catch/CatchProjs
 607   // The call is either a Java call or the VM's rethrow stub
 608   void catch_call_exceptions(ciExceptionHandlerStream&);
 609 
 610   // Handle all exceptions thrown by the inlined method.
 611   // Also handles exceptions for individual bytecodes.
 612   void catch_inline_exceptions(SafePointNode* ex_map);
 613 
 614   // Merge the given map into correct exceptional exit state.
 615   // Assumes that there is no applicable local handler.
 616   void throw_to_exit(SafePointNode* ex_map);
 617 
 618   // Use speculative type to optimize CmpP node
 619   Node* optimize_cmp_with_klass(Node* c);
 620 
 621  public:
 622 #ifndef PRODUCT
 623   // Handle PrintOpto, etc.
 624   void show_parse_info();
 625   void dump_map_adr_mem() const;
 626   static void print_statistics(); // Print some performance counters
 627   void dump();
 628   void dump_bci(int bci);
 629 #endif
 630 };
 631 
 632 #endif // SHARE_VM_OPTO_PARSE_HPP