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