duke@435: /* stefank@2314: * Copyright (c) 1997, 2010, Oracle and/or its affiliates. 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: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #ifndef SHARE_VM_OOPS_GENERATEOOPMAP_HPP stefank@2314: #define SHARE_VM_OOPS_GENERATEOOPMAP_HPP stefank@2314: stefank@2314: #include "interpreter/bytecodeStream.hpp" stefank@2314: #include "memory/allocation.inline.hpp" stefank@2314: #include "memory/universe.inline.hpp" stefank@2314: #include "oops/methodOop.hpp" stefank@2314: #include "oops/oopsHierarchy.hpp" stefank@2314: #include "runtime/signature.hpp" stefank@2314: duke@435: // Forward definition duke@435: class MethodOopMap; duke@435: class GenerateOopMap; duke@435: class BasicBlock; duke@435: class CellTypeState; duke@435: class StackMap; duke@435: duke@435: // These two should be removed. But requires som code to be cleaned up duke@435: #define MAXARGSIZE 256 // This should be enough duke@435: #define MAX_LOCAL_VARS 65536 // 16-bit entry duke@435: duke@435: typedef void (*jmpFct_t)(GenerateOopMap *c, int bcpDelta, int* data); duke@435: duke@435: duke@435: // RetTable duke@435: // duke@435: // Contains maping between jsr targets and there return addresses. One-to-many mapping duke@435: // duke@435: class RetTableEntry : public ResourceObj { duke@435: private: duke@435: static int _init_nof_jsrs; // Default size of jsrs list duke@435: int _target_bci; // Target PC address of jump (bytecode index) duke@435: GrowableArray * _jsrs; // List of return addresses (bytecode index) duke@435: RetTableEntry *_next; // Link to next entry duke@435: public: duke@435: RetTableEntry(int target, RetTableEntry *next) { _target_bci=target; _jsrs = new GrowableArray(_init_nof_jsrs); _next = next; } duke@435: duke@435: // Query duke@435: int target_bci() const { return _target_bci; } duke@435: int nof_jsrs() const { return _jsrs->length(); } duke@435: int jsrs(int i) const { assert(i>=0 && iat(i); } duke@435: duke@435: // Update entry duke@435: void add_jsr (int return_bci) { _jsrs->append(return_bci); } duke@435: void add_delta (int bci, int delta); duke@435: RetTableEntry * next() const { return _next; } duke@435: }; duke@435: duke@435: duke@435: class RetTable VALUE_OBJ_CLASS_SPEC { duke@435: private: duke@435: RetTableEntry *_first; duke@435: static int _init_nof_entries; duke@435: duke@435: void add_jsr(int return_bci, int target_bci); // Adds entry to list duke@435: public: duke@435: RetTable() { _first = NULL; } duke@435: void compute_ret_table(methodHandle method); duke@435: void update_ret_table(int bci, int delta); duke@435: RetTableEntry* find_jsrs_for_target(int targBci); duke@435: }; duke@435: duke@435: // duke@435: // CellTypeState duke@435: // duke@435: class CellTypeState VALUE_OBJ_CLASS_SPEC { duke@435: private: duke@435: unsigned int _state; duke@435: duke@435: // Masks for separating the BITS and INFO portions of a CellTypeState duke@435: enum { info_mask = right_n_bits(28), duke@435: bits_mask = (int)(~info_mask) }; duke@435: duke@435: // These constant are used for manipulating the BITS portion of a duke@435: // CellTypeState duke@435: enum { uninit_bit = (int)(nth_bit(31)), duke@435: ref_bit = nth_bit(30), duke@435: val_bit = nth_bit(29), duke@435: addr_bit = nth_bit(28), duke@435: live_bits_mask = (int)(bits_mask & ~uninit_bit) }; duke@435: duke@435: // These constants are used for manipulating the INFO portion of a duke@435: // CellTypeState duke@435: enum { top_info_bit = nth_bit(27), duke@435: not_bottom_info_bit = nth_bit(26), duke@435: info_data_mask = right_n_bits(26), duke@435: info_conflict = info_mask }; duke@435: duke@435: // Within the INFO data, these values are used to distinguish different duke@435: // kinds of references. duke@435: enum { ref_not_lock_bit = nth_bit(25), // 0 if this reference is locked as a monitor duke@435: ref_slot_bit = nth_bit(24), // 1 if this reference is a "slot" reference, duke@435: // 0 if it is a "line" reference. duke@435: ref_data_mask = right_n_bits(24) }; duke@435: duke@435: duke@435: // These values are used to initialize commonly used CellTypeState duke@435: // constants. duke@435: enum { bottom_value = 0, duke@435: uninit_value = (int)(uninit_bit | info_conflict), duke@435: ref_value = ref_bit, duke@435: ref_conflict = ref_bit | info_conflict, duke@435: val_value = val_bit | info_conflict, duke@435: addr_value = addr_bit, duke@435: addr_conflict = addr_bit | info_conflict }; duke@435: duke@435: public: duke@435: duke@435: // Since some C++ constructors generate poor code for declarations of the duke@435: // form... duke@435: // duke@435: // CellTypeState vector[length]; duke@435: // duke@435: // ...we avoid making a constructor for this class. CellTypeState values duke@435: // should be constructed using one of the make_* methods: duke@435: duke@435: static CellTypeState make_any(int state) { duke@435: CellTypeState s; duke@435: s._state = state; duke@435: // Causes SS10 warning. duke@435: // assert(s.is_valid_state(), "check to see if CellTypeState is valid"); duke@435: return s; duke@435: } duke@435: duke@435: static CellTypeState make_bottom() { duke@435: return make_any(0); duke@435: } duke@435: duke@435: static CellTypeState make_top() { duke@435: return make_any(AllBits); duke@435: } duke@435: duke@435: static CellTypeState make_addr(int bci) { duke@435: assert((bci >= 0) && (bci < info_data_mask), "check to see if ret addr is valid"); duke@435: return make_any(addr_bit | not_bottom_info_bit | (bci & info_data_mask)); duke@435: } duke@435: duke@435: static CellTypeState make_slot_ref(int slot_num) { duke@435: assert(slot_num >= 0 && slot_num < ref_data_mask, "slot out of range"); duke@435: return make_any(ref_bit | not_bottom_info_bit | ref_not_lock_bit | ref_slot_bit | duke@435: (slot_num & ref_data_mask)); duke@435: } duke@435: duke@435: static CellTypeState make_line_ref(int bci) { duke@435: assert(bci >= 0 && bci < ref_data_mask, "line out of range"); duke@435: return make_any(ref_bit | not_bottom_info_bit | ref_not_lock_bit | duke@435: (bci & ref_data_mask)); duke@435: } duke@435: duke@435: static CellTypeState make_lock_ref(int bci) { duke@435: assert(bci >= 0 && bci < ref_data_mask, "line out of range"); duke@435: return make_any(ref_bit | not_bottom_info_bit | (bci & ref_data_mask)); duke@435: } duke@435: duke@435: // Query methods: duke@435: bool is_bottom() const { return _state == 0; } duke@435: bool is_live() const { return ((_state & live_bits_mask) != 0); } duke@435: bool is_valid_state() const { duke@435: // Uninitialized and value cells must contain no data in their info field: duke@435: if ((can_be_uninit() || can_be_value()) && !is_info_top()) { duke@435: return false; duke@435: } duke@435: // The top bit is only set when all info bits are set: duke@435: if (is_info_top() && ((_state & info_mask) != info_mask)) { duke@435: return false; duke@435: } duke@435: // The not_bottom_bit must be set when any other info bit is set: duke@435: if (is_info_bottom() && ((_state & info_mask) != 0)) { duke@435: return false; duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: bool is_address() const { return ((_state & bits_mask) == addr_bit); } duke@435: bool is_reference() const { return ((_state & bits_mask) == ref_bit); } duke@435: bool is_value() const { return ((_state & bits_mask) == val_bit); } duke@435: bool is_uninit() const { return ((_state & bits_mask) == (uint)uninit_bit); } duke@435: duke@435: bool can_be_address() const { return ((_state & addr_bit) != 0); } duke@435: bool can_be_reference() const { return ((_state & ref_bit) != 0); } duke@435: bool can_be_value() const { return ((_state & val_bit) != 0); } duke@435: bool can_be_uninit() const { return ((_state & uninit_bit) != 0); } duke@435: duke@435: bool is_info_bottom() const { return ((_state & not_bottom_info_bit) == 0); } duke@435: bool is_info_top() const { return ((_state & top_info_bit) != 0); } duke@435: int get_info() const { duke@435: assert((!is_info_top() && !is_info_bottom()), duke@435: "check to make sure top/bottom info is not used"); duke@435: return (_state & info_data_mask); duke@435: } duke@435: duke@435: bool is_good_address() const { return is_address() && !is_info_top(); } duke@435: bool is_lock_reference() const { duke@435: return ((_state & (bits_mask | top_info_bit | ref_not_lock_bit)) == ref_bit); duke@435: } duke@435: bool is_nonlock_reference() const { duke@435: return ((_state & (bits_mask | top_info_bit | ref_not_lock_bit)) == (ref_bit | ref_not_lock_bit)); duke@435: } duke@435: duke@435: bool equal(CellTypeState a) const { return _state == a._state; } duke@435: bool equal_kind(CellTypeState a) const { duke@435: return (_state & bits_mask) == (a._state & bits_mask); duke@435: } duke@435: duke@435: char to_char() const; duke@435: duke@435: // Merge duke@435: CellTypeState merge (CellTypeState cts, int slot) const; duke@435: duke@435: // Debugging output duke@435: void print(outputStream *os); duke@435: duke@435: // Default values of common values duke@435: static CellTypeState bottom; duke@435: static CellTypeState uninit; duke@435: static CellTypeState ref; duke@435: static CellTypeState value; duke@435: static CellTypeState refUninit; duke@435: static CellTypeState varUninit; duke@435: static CellTypeState top; duke@435: static CellTypeState addr; duke@435: }; duke@435: duke@435: duke@435: // duke@435: // BasicBlockStruct duke@435: // duke@435: class BasicBlock: ResourceObj { duke@435: private: duke@435: bool _changed; // Reached a fixpoint or not duke@435: public: duke@435: enum Constants { duke@435: _dead_basic_block = -2, duke@435: _unreached = -1 // Alive but not yet reached by analysis duke@435: // >=0 // Alive and has a merged state duke@435: }; duke@435: duke@435: int _bci; // Start of basic block duke@435: int _end_bci; // Bci of last instruction in basicblock duke@435: int _max_locals; // Determines split between vars and stack duke@435: int _max_stack; // Determines split between stack and monitors duke@435: CellTypeState* _state; // State (vars, stack) at entry. duke@435: int _stack_top; // -1 indicates bottom stack value. duke@435: int _monitor_top; // -1 indicates bottom monitor stack value. duke@435: duke@435: CellTypeState* vars() { return _state; } duke@435: CellTypeState* stack() { return _state + _max_locals; } duke@435: duke@435: bool changed() { return _changed; } duke@435: void set_changed(bool s) { _changed = s; } duke@435: duke@435: bool is_reachable() const { return _stack_top >= 0; } // Analysis has reached this basicblock duke@435: duke@435: // All basicblocks that are unreachable are going to have a _stack_top == _dead_basic_block. duke@435: // This info. is setup in a pre-parse before the real abstract interpretation starts. duke@435: bool is_dead() const { return _stack_top == _dead_basic_block; } duke@435: bool is_alive() const { return _stack_top != _dead_basic_block; } duke@435: void mark_as_alive() { assert(is_dead(), "must be dead"); _stack_top = _unreached; } duke@435: }; duke@435: duke@435: duke@435: // duke@435: // GenerateOopMap duke@435: // duke@435: // Main class used to compute the pointer-maps in a MethodOop duke@435: // duke@435: class GenerateOopMap VALUE_OBJ_CLASS_SPEC { duke@435: protected: duke@435: duke@435: // _monitor_top is set to this constant to indicate that a monitor matching duke@435: // problem was encountered prior to this point in control flow. duke@435: enum { bad_monitors = -1 }; duke@435: duke@435: // Main variables duke@435: methodHandle _method; // The method we are examine duke@435: RetTable _rt; // Contains the return address mappings duke@435: int _max_locals; // Cached value of no. of locals duke@435: int _max_stack; // Cached value of max. stack depth duke@435: int _max_monitors; // Cached value of max. monitor stack depth duke@435: int _has_exceptions; // True, if exceptions exist for method twisti@1040: bool _got_error; // True, if an error occurred during interpretation. duke@435: Handle _exception; // Exception if got_error is true. duke@435: bool _did_rewriting; // was bytecodes rewritten duke@435: bool _did_relocation; // was relocation neccessary duke@435: bool _monitor_safe; // The monitors in this method have been determined duke@435: // to be safe. duke@435: duke@435: // Working Cell type state duke@435: int _state_len; // Size of states duke@435: CellTypeState *_state; // list of states duke@435: char *_state_vec_buf; // Buffer used to print a readable version of a state duke@435: int _stack_top; duke@435: int _monitor_top; duke@435: duke@435: // Timing and statistics duke@435: static elapsedTimer _total_oopmap_time; // Holds cumulative oopmap generation time duke@435: static long _total_byte_count; // Holds cumulative number of bytes inspected duke@435: duke@435: // Cell type methods duke@435: void init_state(); duke@435: void make_context_uninitialized (); coleenp@2497: int methodsig_to_effect (Symbol* signature, bool isStatic, CellTypeState* effect); duke@435: bool merge_local_state_vectors (CellTypeState* cts, CellTypeState* bbts); duke@435: bool merge_monitor_state_vectors(CellTypeState* cts, CellTypeState* bbts); duke@435: void copy_state (CellTypeState *dst, CellTypeState *src); duke@435: void merge_state_into_bb (BasicBlock *bb); duke@435: static void merge_state (GenerateOopMap *gom, int bcidelta, int* data); duke@435: void set_var (int localNo, CellTypeState cts); duke@435: CellTypeState get_var (int localNo); duke@435: CellTypeState pop (); duke@435: void push (CellTypeState cts); duke@435: CellTypeState monitor_pop (); duke@435: void monitor_push (CellTypeState cts); duke@435: CellTypeState * vars () { return _state; } duke@435: CellTypeState * stack () { return _state+_max_locals; } duke@435: CellTypeState * monitors () { return _state+_max_locals+_max_stack; } duke@435: duke@435: void replace_all_CTS_matches (CellTypeState match, duke@435: CellTypeState replace); duke@435: void print_states (outputStream *os, CellTypeState *vector, int num); duke@435: void print_current_state (outputStream *os, duke@435: BytecodeStream *itr, duke@435: bool detailed); duke@435: void report_monitor_mismatch (const char *msg); duke@435: duke@435: // Basicblock info duke@435: BasicBlock * _basic_blocks; // Array of basicblock info duke@435: int _gc_points; duke@435: int _bb_count; ysr@777: BitMap _bb_hdr_bits; duke@435: duke@435: // Basicblocks methods duke@435: void initialize_bb (); duke@435: void mark_bbheaders_and_count_gc_points(); ysr@777: bool is_bb_header (int bci) const { ysr@777: return _bb_hdr_bits.at(bci); ysr@777: } duke@435: int gc_points () const { return _gc_points; } duke@435: int bb_count () const { return _bb_count; } ysr@777: void set_bbmark_bit (int bci) { ysr@777: _bb_hdr_bits.at_put(bci, true); ysr@777: } ysr@777: void clear_bbmark_bit (int bci) { ysr@777: _bb_hdr_bits.at_put(bci, false); ysr@777: } duke@435: BasicBlock * get_basic_block_at (int bci) const; duke@435: BasicBlock * get_basic_block_containing (int bci) const; duke@435: void interp_bb (BasicBlock *bb); duke@435: void restore_state (BasicBlock *bb); duke@435: int next_bb_start_pc (BasicBlock *bb); duke@435: void update_basic_blocks (int bci, int delta, int new_method_size); duke@435: static void bb_mark_fct (GenerateOopMap *c, int deltaBci, int *data); duke@435: duke@435: // Dead code detection duke@435: void mark_reachable_code(); duke@435: static void reachable_basicblock (GenerateOopMap *c, int deltaBci, int *data); duke@435: duke@435: // Interpretation methods (primary) duke@435: void do_interpretation (); duke@435: void init_basic_blocks (); duke@435: void setup_method_entry_state (); duke@435: void interp_all (); duke@435: duke@435: // Interpretation methods (secondary) duke@435: void interp1 (BytecodeStream *itr); duke@435: void do_exception_edge (BytecodeStream *itr); duke@435: void check_type (CellTypeState expected, CellTypeState actual); duke@435: void ppstore (CellTypeState *in, int loc_no); duke@435: void ppload (CellTypeState *out, int loc_no); duke@435: void ppush1 (CellTypeState in); duke@435: void ppush (CellTypeState *in); duke@435: void ppop1 (CellTypeState out); duke@435: void ppop (CellTypeState *out); duke@435: void ppop_any (int poplen); duke@435: void pp (CellTypeState *in, CellTypeState *out); duke@435: void pp_new_ref (CellTypeState *in, int bci); duke@435: void ppdupswap (int poplen, const char *out); jrose@2265: void do_ldc (int bci); duke@435: void do_astore (int idx); duke@435: void do_jsr (int delta); duke@435: void do_field (int is_get, int is_static, int idx, int bci); duke@435: void do_method (int is_static, int is_interface, int idx, int bci); duke@435: void do_multianewarray (int dims, int bci); duke@435: void do_monitorenter (int bci); duke@435: void do_monitorexit (int bci); duke@435: void do_return_monitor_check (); duke@435: void do_checkcast (); duke@435: CellTypeState *sigchar_to_effect (char sigch, int bci, CellTypeState *out); duke@435: int copy_cts (CellTypeState *dst, CellTypeState *src); duke@435: duke@435: // Error handling duke@435: void error_work (const char *format, va_list ap); duke@435: void report_error (const char *format, ...); duke@435: void verify_error (const char *format, ...); duke@435: bool got_error() { return _got_error; } duke@435: duke@435: // Create result set duke@435: bool _report_result; duke@435: bool _report_result_for_send; // Unfortunatly, stackmaps for sends are special, so we need some extra duke@435: BytecodeStream *_itr_send; // variables to handle them properly. duke@435: duke@435: void report_result (); duke@435: duke@435: // Initvars duke@435: GrowableArray * _init_vars; duke@435: duke@435: void initialize_vars (); duke@435: void add_to_ref_init_set (int localNo); duke@435: duke@435: // Conflicts rewrite logic twisti@1040: bool _conflict; // True, if a conflict occurred during interpretation duke@435: int _nof_refval_conflicts; // No. of conflicts that require rewrites duke@435: int * _new_var_map; duke@435: duke@435: void record_refval_conflict (int varNo); duke@435: void rewrite_refval_conflicts (); duke@435: void rewrite_refval_conflict (int from, int to); duke@435: bool rewrite_refval_conflict_inst (BytecodeStream *i, int from, int to); duke@435: bool rewrite_load_or_store (BytecodeStream *i, Bytecodes::Code bc, Bytecodes::Code bc0, unsigned int varNo); duke@435: duke@435: void expand_current_instr (int bci, int ilen, int newIlen, u_char inst_buffer[]); duke@435: bool is_astore (BytecodeStream *itr, int *index); duke@435: bool is_aload (BytecodeStream *itr, int *index); duke@435: duke@435: // List of bci's where a return address is on top of the stack duke@435: GrowableArray *_ret_adr_tos; duke@435: duke@435: bool stack_top_holds_ret_addr (int bci); duke@435: void compute_ret_adr_at_TOS (); duke@435: void update_ret_adr_at_TOS (int bci, int delta); duke@435: duke@435: int binsToHold (int no) { return ((no+(BitsPerWord-1))/BitsPerWord); } duke@435: char *state_vec_to_string (CellTypeState* vec, int len); duke@435: duke@435: // Helper method. Can be used in subclasses to fx. calculate gc_points. If the current instuction duke@435: // is a control transfer, then calls the jmpFct all possible destinations. duke@435: void ret_jump_targets_do (BytecodeStream *bcs, jmpFct_t jmpFct, int varNo,int *data); duke@435: bool jump_targets_do (BytecodeStream *bcs, jmpFct_t jmpFct, int *data); duke@435: duke@435: friend class RelocCallback; duke@435: public: duke@435: GenerateOopMap(methodHandle method); duke@435: duke@435: // Compute the map. duke@435: void compute_map(TRAPS); duke@435: void result_for_basicblock(int bci); // Do a callback on fill_stackmap_for_opcodes for basicblock containing bci duke@435: duke@435: // Query duke@435: int max_locals() const { return _max_locals; } duke@435: methodOop method() const { return _method(); } duke@435: methodHandle method_as_handle() const { return _method; } duke@435: duke@435: bool did_rewriting() { return _did_rewriting; } duke@435: bool did_relocation() { return _did_relocation; } duke@435: duke@435: static void print_time(); duke@435: duke@435: // Monitor query duke@435: bool monitor_safe() { return _monitor_safe; } duke@435: duke@435: // Specialization methods. Intended use: duke@435: // - possible_gc_point must return true for every bci for which the stackmaps must be returned duke@435: // - fill_stackmap_prolog is called just before the result is reported. The arguments tells the estimated duke@435: // number of gc points duke@435: // - fill_stackmap_for_opcodes is called once for each bytecode index in order (0...code_length-1) duke@435: // - fill_stackmap_epilog is called after all results has been reported. Note: Since the algorithm does not report duke@435: // stackmaps for deadcode, fewer gc_points might have been encounted than assumed during the epilog. It is the duke@435: // responsibility of the subclass to count the correct number. duke@435: // - fill_init_vars are called once with the result of the init_vars computation duke@435: // duke@435: // All these methods are used during a call to: compute_map. Note: Non of the return results are valid duke@435: // after compute_map returns, since all values are allocated as resource objects. duke@435: // duke@435: // All virtual method must be implemented in subclasses duke@435: virtual bool allow_rewrites () const { return false; } duke@435: virtual bool report_results () const { return true; } duke@435: virtual bool report_init_vars () const { return true; } duke@435: virtual bool possible_gc_point (BytecodeStream *bcs) { ShouldNotReachHere(); return false; } duke@435: virtual void fill_stackmap_prolog (int nof_gc_points) { ShouldNotReachHere(); } duke@435: virtual void fill_stackmap_epilog () { ShouldNotReachHere(); } duke@435: virtual void fill_stackmap_for_opcodes (BytecodeStream *bcs, duke@435: CellTypeState* vars, duke@435: CellTypeState* stack, duke@435: int stackTop) { ShouldNotReachHere(); } duke@435: virtual void fill_init_vars (GrowableArray *init_vars) { ShouldNotReachHere();; } duke@435: }; duke@435: duke@435: // duke@435: // Subclass of the GenerateOopMap Class that just do rewrites of the method, if needed. duke@435: // It does not store any oopmaps. duke@435: // duke@435: class ResolveOopMapConflicts: public GenerateOopMap { duke@435: private: duke@435: duke@435: bool _must_clear_locals; duke@435: duke@435: virtual bool report_results() const { return false; } duke@435: virtual bool report_init_vars() const { return true; } duke@435: virtual bool allow_rewrites() const { return true; } duke@435: virtual bool possible_gc_point (BytecodeStream *bcs) { return false; } duke@435: virtual void fill_stackmap_prolog (int nof_gc_points) {} duke@435: virtual void fill_stackmap_epilog () {} duke@435: virtual void fill_stackmap_for_opcodes (BytecodeStream *bcs, duke@435: CellTypeState* vars, duke@435: CellTypeState* stack, duke@435: int stack_top) {} duke@435: virtual void fill_init_vars (GrowableArray *init_vars) { _must_clear_locals = init_vars->length() > 0; } duke@435: duke@435: #ifndef PRODUCT duke@435: // Statistics duke@435: static int _nof_invocations; duke@435: static int _nof_rewrites; duke@435: static int _nof_relocations; duke@435: #endif duke@435: duke@435: public: duke@435: ResolveOopMapConflicts(methodHandle method) : GenerateOopMap(method) { _must_clear_locals = false; }; duke@435: duke@435: methodHandle do_potential_rewrite(TRAPS); duke@435: bool must_clear_locals() const { return _must_clear_locals; } duke@435: }; duke@435: duke@435: duke@435: // duke@435: // Subclass used by the compiler to generate pairing infomation duke@435: // duke@435: class GeneratePairingInfo: public GenerateOopMap { duke@435: private: duke@435: duke@435: virtual bool report_results() const { return false; } duke@435: virtual bool report_init_vars() const { return false; } duke@435: virtual bool allow_rewrites() const { return false; } duke@435: virtual bool possible_gc_point (BytecodeStream *bcs) { return false; } duke@435: virtual void fill_stackmap_prolog (int nof_gc_points) {} duke@435: virtual void fill_stackmap_epilog () {} duke@435: virtual void fill_stackmap_for_opcodes (BytecodeStream *bcs, duke@435: CellTypeState* vars, duke@435: CellTypeState* stack, duke@435: int stack_top) {} duke@435: virtual void fill_init_vars (GrowableArray *init_vars) {} duke@435: public: duke@435: GeneratePairingInfo(methodHandle method) : GenerateOopMap(method) {}; duke@435: duke@435: // Call compute_map(CHECK) to generate info. duke@435: }; stefank@2314: stefank@2314: #endif // SHARE_VM_OOPS_GENERATEOOPMAP_HPP