duke@435: /* xdono@631: * Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * duke@435: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, duke@435: * CA 95054 USA or visit www.sun.com if you need additional information or duke@435: * have any questions. duke@435: * duke@435: */ duke@435: duke@435: class BytecodeParseHistogram; duke@435: class InlineTree; duke@435: class Parse; duke@435: class SwitchRange; duke@435: duke@435: duke@435: //------------------------------InlineTree------------------------------------- duke@435: class InlineTree : public ResourceObj { duke@435: Compile* C; // cache duke@435: JVMState* _caller_jvms; // state of caller duke@435: ciMethod* _method; // method being called by the caller_jvms duke@435: InlineTree* _caller_tree; duke@435: uint _count_inline_bcs; // Accumulated count of inlined bytecodes duke@435: // Call-site count / interpreter invocation count, scaled recursively. duke@435: // Always between 0.0 and 1.0. Represents the percentage of the method's duke@435: // total execution time used at this call site. duke@435: const float _site_invoke_ratio; duke@435: float compute_callee_frequency( int caller_bci ) const; duke@435: duke@435: GrowableArray _subtrees; duke@435: friend class Compile; duke@435: duke@435: protected: duke@435: InlineTree(Compile* C, duke@435: const InlineTree* caller_tree, duke@435: ciMethod* callee_method, duke@435: JVMState* caller_jvms, duke@435: int caller_bci, duke@435: float site_invoke_ratio); duke@435: InlineTree *build_inline_tree_for_callee(ciMethod* callee_method, duke@435: JVMState* caller_jvms, duke@435: int caller_bci); kvn@476: const char* try_to_inline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result); kvn@476: const char* shouldInline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result) const; kvn@476: const char* shouldNotInline(ciMethod* callee_method, ciMethod* caller_method, WarmCallInfo* wci_result) const; duke@435: void print_inlining(ciMethod *callee_method, int caller_bci, const char *failure_msg) const PRODUCT_RETURN; duke@435: duke@435: InlineTree *caller_tree() const { return _caller_tree; } duke@435: InlineTree* callee_at(int bci, ciMethod* m) const; duke@435: int inline_depth() const { return _caller_jvms ? _caller_jvms->depth() : 0; } duke@435: duke@435: public: duke@435: static InlineTree* build_inline_tree_root(); duke@435: static InlineTree* find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee, bool create_if_not_found = false); duke@435: duke@435: // For temporary (stack-allocated, stateless) ilts: duke@435: InlineTree(Compile* c, ciMethod* callee_method, JVMState* caller_jvms, float site_invoke_ratio); duke@435: duke@435: // InlineTree enum duke@435: enum InlineStyle { duke@435: Inline_do_not_inline = 0, // duke@435: Inline_cha_is_monomorphic = 1, // duke@435: Inline_type_profile_monomorphic = 2 // duke@435: }; duke@435: duke@435: // See if it is OK to inline. twisti@1040: // The receiver is the inline tree for the caller. duke@435: // duke@435: // The result is a temperature indication. If it is hot or cold, duke@435: // inlining is immediate or undesirable. Otherwise, the info block duke@435: // returned is newly allocated and may be enqueued. duke@435: // duke@435: // If the method is inlinable, a new inline subtree is created on the fly, duke@435: // and may be accessed by find_subtree_from_root. duke@435: // The call_method is the dest_method for a special or static invocation. duke@435: // The call_method is an optimized virtual method candidate otherwise. duke@435: WarmCallInfo* ok_to_inline(ciMethod *call_method, JVMState* caller_jvms, ciCallProfile& profile, WarmCallInfo* wci); duke@435: duke@435: // Information about inlined method duke@435: JVMState* caller_jvms() const { return _caller_jvms; } duke@435: ciMethod *method() const { return _method; } duke@435: int caller_bci() const { return _caller_jvms ? _caller_jvms->bci() : InvocationEntryBci; } duke@435: uint count_inline_bcs() const { return _count_inline_bcs; } duke@435: float site_invoke_ratio() const { return _site_invoke_ratio; }; duke@435: duke@435: #ifndef PRODUCT duke@435: private: duke@435: uint _count_inlines; // Count of inlined methods duke@435: public: duke@435: // Debug information collected during parse duke@435: uint count_inlines() const { return _count_inlines; }; duke@435: #endif duke@435: GrowableArray subtrees() { return _subtrees; } duke@435: }; duke@435: duke@435: duke@435: //----------------------------------------------------------------------------- duke@435: //------------------------------Parse------------------------------------------ duke@435: // Parse bytecodes, build a Graph duke@435: class Parse : public GraphKit { duke@435: public: duke@435: // Per-block information needed by the parser: duke@435: class Block { duke@435: private: duke@435: ciTypeFlow::Block* _flow; duke@435: int _pred_count; // how many predecessors in CFG? duke@435: int _preds_parsed; // how many of these have been parsed? duke@435: uint _count; // how many times executed? Currently only set by _goto's duke@435: bool _is_parsed; // has this block been parsed yet? duke@435: bool _is_handler; // is this block an exception handler? duke@435: SafePointNode* _start_map; // all values flowing into this block duke@435: MethodLivenessResult _live_locals; // lazily initialized liveness bitmap duke@435: duke@435: int _num_successors; // Includes only normal control flow. duke@435: int _all_successors; // Include exception paths also. duke@435: Block** _successors; duke@435: duke@435: // Use init_node/init_graph to initialize Blocks. duke@435: // Block() : _live_locals((uintptr_t*)NULL,0) { ShouldNotReachHere(); } duke@435: Block() : _live_locals(NULL,0) { ShouldNotReachHere(); } duke@435: duke@435: public: duke@435: duke@435: // Set up the block data structure itself. duke@435: void init_node(Parse* outer, int po); duke@435: // Set up the block's relations to other blocks. duke@435: void init_graph(Parse* outer); duke@435: duke@435: ciTypeFlow::Block* flow() const { return _flow; } duke@435: int pred_count() const { return _pred_count; } duke@435: int preds_parsed() const { return _preds_parsed; } duke@435: bool is_parsed() const { return _is_parsed; } duke@435: bool is_handler() const { return _is_handler; } duke@435: void set_count( uint x ) { _count = x; } duke@435: uint count() const { return _count; } duke@435: duke@435: SafePointNode* start_map() const { assert(is_merged(),""); return _start_map; } duke@435: void set_start_map(SafePointNode* m) { assert(!is_merged(), ""); _start_map = m; } duke@435: duke@435: // True after any predecessor flows control into this block duke@435: bool is_merged() const { return _start_map != NULL; } duke@435: duke@435: // True when all non-exception predecessors have been parsed. duke@435: bool is_ready() const { return preds_parsed() == pred_count(); } duke@435: duke@435: int num_successors() const { return _num_successors; } duke@435: int all_successors() const { return _all_successors; } duke@435: Block* successor_at(int i) const { duke@435: assert((uint)i < (uint)all_successors(), ""); duke@435: return _successors[i]; duke@435: } duke@435: Block* successor_for_bci(int bci); duke@435: duke@435: int start() const { return flow()->start(); } duke@435: int limit() const { return flow()->limit(); } never@802: int rpo() const { return flow()->rpo(); } duke@435: int start_sp() const { return flow()->stack_size(); } duke@435: never@802: bool is_loop_head() const { return flow()->is_loop_head(); } never@802: bool is_SEL_head() const { return flow()->is_single_entry_loop_head(); } never@802: bool is_SEL_backedge(Block* pred) const{ return is_SEL_head() && pred->rpo() >= rpo(); } never@802: bool is_invariant_local(uint i) const { never@802: const JVMState* jvms = start_map()->jvms(); kvn@870: if (!jvms->is_loc(i) || flow()->outer()->has_irreducible_entry()) return false; never@802: return flow()->is_invariant_local(i - jvms->locoff()); never@802: } never@802: bool can_elide_SEL_phi(uint i) const { assert(is_SEL_head(),""); return is_invariant_local(i); } never@802: duke@435: const Type* peek(int off=0) const { return stack_type_at(start_sp() - (off+1)); } duke@435: duke@435: const Type* stack_type_at(int i) const; duke@435: const Type* local_type_at(int i) const; duke@435: static const Type* get_type(ciType* t) { return Type::get_typeflow_type(t); } duke@435: duke@435: bool has_trap_at(int bci) const { return flow()->has_trap() && flow()->trap_bci() == bci; } duke@435: duke@435: // Call this just before parsing a block. duke@435: void mark_parsed() { duke@435: assert(!_is_parsed, "must parse each block exactly once"); duke@435: _is_parsed = true; duke@435: } duke@435: duke@435: // Return the phi/region input index for the "current" pred, duke@435: // and bump the pred number. For historical reasons these index duke@435: // numbers are handed out in descending order. The last index is duke@435: // always PhiNode::Input (i.e., 1). The value returned is known duke@435: // as a "path number" because it distinguishes by which path we are duke@435: // entering the block. duke@435: int next_path_num() { duke@435: assert(preds_parsed() < pred_count(), "too many preds?"); duke@435: return pred_count() - _preds_parsed++; duke@435: } duke@435: duke@435: // Add a previously unaccounted predecessor to this block. duke@435: // This operates by increasing the size of the block's region duke@435: // and all its phi nodes (if any). The value returned is a duke@435: // path number ("pnum"). duke@435: int add_new_path(); duke@435: duke@435: // Initialize me by recording the parser's map. My own map must be NULL. duke@435: void record_state(Parse* outer); duke@435: }; duke@435: duke@435: #ifndef PRODUCT duke@435: // BytecodeParseHistogram collects number of bytecodes parsed, nodes constructed, and transformations. duke@435: class BytecodeParseHistogram : public ResourceObj { duke@435: private: duke@435: enum BPHType { duke@435: BPH_transforms, duke@435: BPH_values duke@435: }; duke@435: static bool _initialized; duke@435: static uint _bytecodes_parsed [Bytecodes::number_of_codes]; duke@435: static uint _nodes_constructed[Bytecodes::number_of_codes]; duke@435: static uint _nodes_transformed[Bytecodes::number_of_codes]; duke@435: static uint _new_values [Bytecodes::number_of_codes]; duke@435: duke@435: Bytecodes::Code _initial_bytecode; duke@435: int _initial_node_count; duke@435: int _initial_transforms; duke@435: int _initial_values; duke@435: duke@435: Parse *_parser; duke@435: Compile *_compiler; duke@435: duke@435: // Initialization duke@435: static void reset(); duke@435: duke@435: // Return info being collected, select with global flag 'BytecodeParseInfo' duke@435: int current_count(BPHType info_selector); duke@435: duke@435: public: duke@435: BytecodeParseHistogram(Parse *p, Compile *c); duke@435: static bool initialized(); duke@435: duke@435: // Record info when starting to parse one bytecode duke@435: void set_initial_state( Bytecodes::Code bc ); duke@435: // Record results of parsing one bytecode duke@435: void record_change(); duke@435: duke@435: // Profile printing duke@435: static void print(float cutoff = 0.01F); // cutoff in percent duke@435: }; duke@435: duke@435: public: duke@435: // Record work done during parsing duke@435: BytecodeParseHistogram* _parse_histogram; duke@435: void set_parse_histogram(BytecodeParseHistogram *bph) { _parse_histogram = bph; } duke@435: BytecodeParseHistogram* parse_histogram() { return _parse_histogram; } duke@435: #endif duke@435: duke@435: private: duke@435: friend class Block; duke@435: duke@435: // Variables which characterize this compilation as a whole: duke@435: duke@435: JVMState* _caller; // JVMS which carries incoming args & state. duke@435: float _expected_uses; // expected number of calls to this code duke@435: float _prof_factor; // discount applied to my profile counts duke@435: int _depth; // Inline tree depth, for debug printouts duke@435: const TypeFunc*_tf; // My kind of function type duke@435: int _entry_bci; // the osr bci or InvocationEntryBci duke@435: duke@435: ciTypeFlow* _flow; // Results of previous flow pass. duke@435: Block* _blocks; // Array of basic-block structs. duke@435: int _block_count; // Number of elements in _blocks. duke@435: duke@435: GraphKit _exits; // Record all normal returns and throws here. duke@435: bool _wrote_final; // Did we write a final field? duke@435: bool _count_invocations; // update and test invocation counter duke@435: bool _method_data_update; // update method data oop duke@435: duke@435: // Variables which track Java semantics during bytecode parsing: duke@435: duke@435: Block* _block; // block currently getting parsed duke@435: ciBytecodeStream _iter; // stream of this method's bytecodes duke@435: duke@435: int _blocks_merged; // Progress meter: state merges from BB preds duke@435: int _blocks_parsed; // Progress meter: BBs actually parsed duke@435: duke@435: const FastLockNode* _synch_lock; // FastLockNode for synchronized method duke@435: duke@435: #ifndef PRODUCT duke@435: int _max_switch_depth; // Debugging SwitchRanges. duke@435: int _est_switch_depth; // Debugging SwitchRanges. duke@435: #endif duke@435: duke@435: public: duke@435: // Constructor duke@435: Parse(JVMState* caller, ciMethod* parse_method, float expected_uses); duke@435: duke@435: virtual Parse* is_Parse() const { return (Parse*)this; } duke@435: duke@435: public: duke@435: // Accessors. duke@435: JVMState* caller() const { return _caller; } duke@435: float expected_uses() const { return _expected_uses; } duke@435: float prof_factor() const { return _prof_factor; } duke@435: int depth() const { return _depth; } duke@435: const TypeFunc* tf() const { return _tf; } duke@435: // entry_bci() -- see osr_bci, etc. duke@435: duke@435: ciTypeFlow* flow() const { return _flow; } never@802: // blocks() -- see rpo_at, start_block, etc. duke@435: int block_count() const { return _block_count; } duke@435: duke@435: GraphKit& exits() { return _exits; } duke@435: bool wrote_final() const { return _wrote_final; } duke@435: void set_wrote_final(bool z) { _wrote_final = z; } duke@435: bool count_invocations() const { return _count_invocations; } duke@435: bool method_data_update() const { return _method_data_update; } duke@435: duke@435: Block* block() const { return _block; } duke@435: ciBytecodeStream& iter() { return _iter; } duke@435: Bytecodes::Code bc() const { return _iter.cur_bc(); } duke@435: duke@435: void set_block(Block* b) { _block = b; } duke@435: duke@435: // Derived accessors: duke@435: bool is_normal_parse() const { return _entry_bci == InvocationEntryBci; } duke@435: bool is_osr_parse() const { return _entry_bci != InvocationEntryBci; } duke@435: int osr_bci() const { assert(is_osr_parse(),""); return _entry_bci; } duke@435: duke@435: void set_parse_bci(int bci); duke@435: duke@435: // Must this parse be aborted? duke@435: bool failing() { return C->failing(); } duke@435: never@802: Block* rpo_at(int rpo) { never@802: assert(0 <= rpo && rpo < _block_count, "oob"); never@802: return &_blocks[rpo]; duke@435: } duke@435: Block* start_block() { never@802: return rpo_at(flow()->start_block()->rpo()); duke@435: } duke@435: // Can return NULL if the flow pass did not complete a block. duke@435: Block* successor_for_bci(int bci) { duke@435: return block()->successor_for_bci(bci); duke@435: } duke@435: duke@435: private: duke@435: // Create a JVMS & map for the initial state of this method. duke@435: SafePointNode* create_entry_map(); duke@435: duke@435: // OSR helpers duke@435: Node *fetch_interpreter_state(int index, BasicType bt, Node *local_addrs, Node *local_addrs_base); duke@435: Node* check_interpreter_type(Node* l, const Type* type, SafePointNode* &bad_type_exit); duke@435: void load_interpreter_state(Node* osr_buf); duke@435: duke@435: // Functions for managing basic blocks: duke@435: void init_blocks(); duke@435: void load_state_from(Block* b); duke@435: void store_state_to(Block* b) { b->record_state(this); } duke@435: duke@435: // Parse all the basic blocks. duke@435: void do_all_blocks(); duke@435: duke@435: // Parse the current basic block duke@435: void do_one_block(); duke@435: duke@435: // Raise an error if we get a bad ciTypeFlow CFG. duke@435: void handle_missing_successor(int bci); duke@435: duke@435: // first actions (before BCI 0) duke@435: void do_method_entry(); duke@435: duke@435: // implementation of monitorenter/monitorexit duke@435: void do_monitor_enter(); duke@435: void do_monitor_exit(); duke@435: duke@435: // Eagerly create phie throughout the state, to cope with back edges. duke@435: void ensure_phis_everywhere(); duke@435: duke@435: // Merge the current mapping into the basic block starting at bci duke@435: void merge( int target_bci); duke@435: // Same as plain merge, except that it allocates a new path number. duke@435: void merge_new_path( int target_bci); duke@435: // Merge the current mapping into an exception handler. duke@435: void merge_exception(int target_bci); duke@435: // Helper: Merge the current mapping into the given basic block duke@435: void merge_common(Block* target, int pnum); duke@435: // Helper functions for merging individual cells. duke@435: PhiNode *ensure_phi( int idx, bool nocreate = false); duke@435: PhiNode *ensure_memory_phi(int idx, bool nocreate = false); duke@435: // Helper to merge the current memory state into the given basic block duke@435: void merge_memory_edges(MergeMemNode* n, int pnum, bool nophi); duke@435: duke@435: // Parse this bytecode, and alter the Parsers JVM->Node mapping duke@435: void do_one_bytecode(); duke@435: duke@435: // helper function to generate array store check duke@435: void array_store_check(); duke@435: // Helper function to generate array load duke@435: void array_load(BasicType etype); duke@435: // Helper function to generate array store duke@435: void array_store(BasicType etype); duke@435: // Helper function to compute array addressing duke@435: Node* array_addressing(BasicType type, int vals, const Type* *result2=NULL); duke@435: duke@435: // Pass current map to exits duke@435: void return_current(Node* value); duke@435: duke@435: // Register finalizers on return from Object. duke@435: void call_register_finalizer(); duke@435: duke@435: // Insert a compiler safepoint into the graph duke@435: void add_safepoint(); duke@435: duke@435: // Insert a compiler safepoint into the graph, if there is a back-branch. duke@435: void maybe_add_safepoint(int target_bci) { duke@435: if (UseLoopSafepoints && target_bci <= bci()) { duke@435: add_safepoint(); duke@435: } duke@435: } duke@435: duke@435: // Note: Intrinsic generation routines may be found in library_call.cpp. duke@435: duke@435: // Helper function to setup Ideal Call nodes duke@435: void do_call(); duke@435: duke@435: // Helper function to uncommon-trap or bailout for non-compilable call-sites duke@435: bool can_not_compile_call_site(ciMethod *dest_method, ciInstanceKlass *klass); duke@435: duke@435: // Helper function to identify inlining potential at call-site duke@435: ciMethod* optimize_inlining(ciMethod* caller, int bci, ciInstanceKlass* klass, duke@435: ciMethod *dest_method, const TypeOopPtr* receiver_type); duke@435: duke@435: // Helper function to setup for type-profile based inlining duke@435: bool prepare_type_profile_inline(ciInstanceKlass* prof_klass, ciMethod* prof_method); duke@435: duke@435: // Helper functions for type checking bytecodes: duke@435: void do_checkcast(); duke@435: void do_instanceof(); duke@435: duke@435: // Helper functions for shifting & arithmetic duke@435: void modf(); duke@435: void modd(); duke@435: void l2f(); duke@435: duke@435: void do_irem(); duke@435: duke@435: // implementation of _get* and _put* bytecodes duke@435: void do_getstatic() { do_field_access(true, false); } duke@435: void do_getfield () { do_field_access(true, true); } duke@435: void do_putstatic() { do_field_access(false, false); } duke@435: void do_putfield () { do_field_access(false, true); } duke@435: duke@435: // common code for making initial checks and forming addresses duke@435: void do_field_access(bool is_get, bool is_field); duke@435: bool static_field_ok_in_clinit(ciField *field, ciMethod *method); duke@435: duke@435: // common code for actually performing the load or store duke@435: void do_get_xxx(const TypePtr* obj_type, Node* obj, ciField* field, bool is_field); duke@435: void do_put_xxx(const TypePtr* obj_type, Node* obj, ciField* field, bool is_field); duke@435: duke@435: // loading from a constant field or the constant pool duke@435: // returns false if push failed (non-perm field constants only, not ldcs) duke@435: bool push_constant(ciConstant con); duke@435: duke@435: // implementation of object creation bytecodes duke@435: void do_new(); duke@435: void do_newarray(BasicType elemtype); duke@435: void do_anewarray(); duke@435: void do_multianewarray(); duke@435: Node* expand_multianewarray(ciArrayKlass* array_klass, Node* *lengths, int ndimensions); duke@435: duke@435: // implementation of jsr/ret duke@435: void do_jsr(); duke@435: void do_ret(); duke@435: duke@435: float dynamic_branch_prediction(float &cnt); duke@435: float branch_prediction(float &cnt, BoolTest::mask btest, int target_bci); duke@435: bool seems_never_taken(float prob); duke@435: rasbold@683: void do_ifnull(BoolTest::mask btest, Node* c); duke@435: void do_if(BoolTest::mask btest, Node* c); duke@435: void repush_if_args(); duke@435: void adjust_map_after_if(BoolTest::mask btest, Node* c, float prob, duke@435: Block* path, Block* other_path); duke@435: IfNode* jump_if_fork_int(Node* a, Node* b, BoolTest::mask mask); duke@435: Node* jump_if_join(Node* iffalse, Node* iftrue); duke@435: void jump_if_true_fork(IfNode *ifNode, int dest_bci_if_true, int prof_table_index); duke@435: void jump_if_false_fork(IfNode *ifNode, int dest_bci_if_false, int prof_table_index); duke@435: void jump_if_always_fork(int dest_bci_if_true, int prof_table_index); duke@435: duke@435: friend class SwitchRange; duke@435: void do_tableswitch(); duke@435: void do_lookupswitch(); duke@435: void jump_switch_ranges(Node* a, SwitchRange* lo, SwitchRange* hi, int depth = 0); duke@435: bool create_jump_tables(Node* a, SwitchRange* lo, SwitchRange* hi); duke@435: duke@435: // helper functions for methodData style profiling duke@435: void test_counter_against_threshold(Node* cnt, int limit); duke@435: void increment_and_test_invocation_counter(int limit); duke@435: void test_for_osr_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize offset, int limit); duke@435: Node* method_data_addressing(ciMethodData* md, ciProfileData* data, ByteSize offset, Node* idx = NULL, uint stride = 0); duke@435: void increment_md_counter_at(ciMethodData* md, ciProfileData* data, ByteSize offset, Node* idx = NULL, uint stride = 0); duke@435: void set_md_flag_at(ciMethodData* md, ciProfileData* data, int flag_constant); duke@435: duke@435: void profile_method_entry(); duke@435: void profile_taken_branch(int target_bci, bool force_update = false); duke@435: void profile_not_taken_branch(bool force_update = false); duke@435: void profile_call(Node* receiver); duke@435: void profile_generic_call(); duke@435: void profile_receiver_type(Node* receiver); duke@435: void profile_ret(int target_bci); duke@435: void profile_null_checkcast(); duke@435: void profile_switch_case(int table_index); duke@435: duke@435: // helper function for call statistics duke@435: void count_compiled_calls(bool at_method_entry, bool is_inline) PRODUCT_RETURN; duke@435: duke@435: Node_Notes* make_node_notes(Node_Notes* caller_nn); duke@435: duke@435: // Helper functions for handling normal and abnormal exits. duke@435: void build_exits(); duke@435: duke@435: // Fix up all exceptional control flow exiting a single bytecode. duke@435: void do_exceptions(); duke@435: duke@435: // Fix up all exiting control flow at the end of the parse. duke@435: void do_exits(); duke@435: duke@435: // Add Catch/CatchProjs duke@435: // The call is either a Java call or the VM's rethrow stub duke@435: void catch_call_exceptions(ciExceptionHandlerStream&); duke@435: duke@435: // Handle all exceptions thrown by the inlined method. duke@435: // Also handles exceptions for individual bytecodes. duke@435: void catch_inline_exceptions(SafePointNode* ex_map); duke@435: duke@435: // Bytecode classifier, helps decide to use uncommon_trap vs. rethrow_C. duke@435: bool can_rerun_bytecode(); duke@435: duke@435: // Merge the given map into correct exceptional exit state. duke@435: // Assumes that there is no applicable local handler. duke@435: void throw_to_exit(SafePointNode* ex_map); duke@435: duke@435: public: duke@435: #ifndef PRODUCT duke@435: // Handle PrintOpto, etc. duke@435: void show_parse_info(); duke@435: void dump_map_adr_mem() const; duke@435: static void print_statistics(); // Print some performance counters duke@435: void dump(); duke@435: void dump_bci(int bci); duke@435: #endif duke@435: };