duke@435: /*
xdono@631:  * Copyright 2001-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 ciBitData;
duke@435: class ciCounterData;
duke@435: class ciJumpData;
duke@435: class ciReceiverTypeData;
duke@435: class ciRetData;
duke@435: class ciBranchData;
duke@435: class ciArrayData;
duke@435: class ciMultiBranchData;
kvn@480: class ciArgInfoData;
duke@435: 
duke@435: typedef ProfileData ciProfileData;
duke@435: 
duke@435: class ciBitData : public BitData {
duke@435: public:
duke@435:   ciBitData(DataLayout* layout) : BitData(layout) {};
duke@435: };
duke@435: 
duke@435: class ciCounterData : public CounterData {
duke@435: public:
duke@435:   ciCounterData(DataLayout* layout) : CounterData(layout) {};
duke@435: };
duke@435: 
duke@435: class ciJumpData : public JumpData {
duke@435: public:
duke@435:   ciJumpData(DataLayout* layout) : JumpData(layout) {};
duke@435: };
duke@435: 
duke@435: class ciReceiverTypeData : public ReceiverTypeData {
duke@435: public:
duke@435:   ciReceiverTypeData(DataLayout* layout) : ReceiverTypeData(layout) {};
duke@435: 
duke@435:   void set_receiver(uint row, ciKlass* recv) {
duke@435:     assert((uint)row < row_limit(), "oob");
duke@435:     set_intptr_at(receiver0_offset + row * receiver_type_row_cell_count,
duke@435:                   (intptr_t) recv);
duke@435:   }
duke@435: 
duke@435:   ciKlass* receiver(uint row) {
duke@435:     assert((uint)row < row_limit(), "oob");
duke@435:     ciObject* recv = (ciObject*)intptr_at(receiver0_offset + row * receiver_type_row_cell_count);
duke@435:     assert(recv == NULL || recv->is_klass(), "wrong type");
duke@435:     return (ciKlass*)recv;
duke@435:   }
duke@435: 
duke@435:   // Copy & translate from oop based ReceiverTypeData
duke@435:   virtual void translate_from(ProfileData* data) {
duke@435:     translate_receiver_data_from(data);
duke@435:   }
duke@435:   void translate_receiver_data_from(ProfileData* data);
duke@435: #ifndef PRODUCT
duke@435:   void print_data_on(outputStream* st);
duke@435:   void print_receiver_data_on(outputStream* st);
duke@435: #endif
duke@435: };
duke@435: 
duke@435: class ciVirtualCallData : public VirtualCallData {
duke@435:   // Fake multiple inheritance...  It's a ciReceiverTypeData also.
duke@435:   ciReceiverTypeData* rtd_super() { return (ciReceiverTypeData*) this; }
duke@435: 
duke@435: public:
duke@435:   ciVirtualCallData(DataLayout* layout) : VirtualCallData(layout) {};
duke@435: 
duke@435:   void set_receiver(uint row, ciKlass* recv) {
duke@435:     rtd_super()->set_receiver(row, recv);
duke@435:   }
duke@435: 
duke@435:   ciKlass* receiver(uint row) {
duke@435:     return rtd_super()->receiver(row);
duke@435:   }
duke@435: 
duke@435:   // Copy & translate from oop based VirtualCallData
duke@435:   virtual void translate_from(ProfileData* data) {
duke@435:     rtd_super()->translate_receiver_data_from(data);
duke@435:   }
duke@435: #ifndef PRODUCT
duke@435:   void print_data_on(outputStream* st);
duke@435: #endif
duke@435: };
duke@435: 
duke@435: 
duke@435: class ciRetData : public RetData {
duke@435: public:
duke@435:   ciRetData(DataLayout* layout) : RetData(layout) {};
duke@435: };
duke@435: 
duke@435: class ciBranchData : public BranchData {
duke@435: public:
duke@435:   ciBranchData(DataLayout* layout) : BranchData(layout) {};
duke@435: };
duke@435: 
duke@435: class ciArrayData : public ArrayData {
duke@435: public:
duke@435:   ciArrayData(DataLayout* layout) : ArrayData(layout) {};
duke@435: };
duke@435: 
duke@435: class ciMultiBranchData : public MultiBranchData {
duke@435: public:
duke@435:   ciMultiBranchData(DataLayout* layout) : MultiBranchData(layout) {};
duke@435: };
duke@435: 
kvn@480: class ciArgInfoData : public ArgInfoData {
kvn@480: public:
kvn@480:   ciArgInfoData(DataLayout* layout) : ArgInfoData(layout) {};
kvn@480: };
kvn@480: 
duke@435: // ciMethodData
duke@435: //
duke@435: // This class represents a methodDataOop in the HotSpot virtual
duke@435: // machine.
duke@435: 
duke@435: class ciMethodData : public ciObject {
duke@435:   CI_PACKAGE_ACCESS
duke@435: 
duke@435: private:
duke@435:   // Size in bytes
duke@435:   int _data_size;
duke@435:   int _extra_data_size;
duke@435: 
duke@435:   // Data entries
duke@435:   intptr_t* _data;
duke@435: 
duke@435:   // Cached hint for data_before()
duke@435:   int _hint_di;
duke@435: 
duke@435:   // Is data attached?  And is it mature?
duke@435:   enum { empty_state, immature_state, mature_state };
duke@435:   u_char _state;
duke@435: 
duke@435:   // Set this true if empty extra_data slots are ever witnessed.
duke@435:   u_char _saw_free_extra_data;
duke@435: 
duke@435:   // Support for interprocedural escape analysis
duke@435:   intx              _eflags;          // flags on escape information
duke@435:   intx              _arg_local;       // bit set of non-escaping arguments
duke@435:   intx              _arg_stack;       // bit set of stack-allocatable arguments
duke@435:   intx              _arg_returned;    // bit set of returned arguments
duke@435: 
duke@435:   // Maturity of the oop when the snapshot is taken.
duke@435:   int _current_mileage;
duke@435: 
duke@435:   // Coherent snapshot of original header.
duke@435:   methodDataOopDesc _orig;
duke@435: 
duke@435:   ciMethodData(methodDataHandle h_md);
duke@435:   ciMethodData();
duke@435: 
duke@435:   // Accessors
kvn@480:   int data_size() const { return _data_size; }
kvn@480:   int extra_data_size() const { return _extra_data_size; }
kvn@480:   intptr_t * data() const { return _data; }
duke@435: 
duke@435:   methodDataOop get_methodDataOop() const {
duke@435:     if (handle() == NULL) return NULL;
duke@435:     methodDataOop mdo = (methodDataOop)get_oop();
duke@435:     assert(mdo != NULL, "illegal use of unloaded method data");
duke@435:     return mdo;
duke@435:   }
duke@435: 
duke@435:   const char* type_string()                      { return "ciMethodData"; }
duke@435: 
duke@435:   void print_impl(outputStream* st);
duke@435: 
kvn@480:   DataLayout* data_layout_at(int data_index) const {
duke@435:     assert(data_index % sizeof(intptr_t) == 0, "unaligned");
duke@435:     return (DataLayout*) (((address)_data) + data_index);
duke@435:   }
duke@435: 
duke@435:   bool out_of_bounds(int data_index) {
duke@435:     return data_index >= data_size();
duke@435:   }
duke@435: 
duke@435:   // hint accessors
duke@435:   int      hint_di() const  { return _hint_di; }
duke@435:   void set_hint_di(int di)  {
duke@435:     assert(!out_of_bounds(di), "hint_di out of bounds");
duke@435:     _hint_di = di;
duke@435:   }
duke@435:   ciProfileData* data_before(int bci) {
duke@435:     // avoid SEGV on this edge case
duke@435:     if (data_size() == 0)
duke@435:       return NULL;
duke@435:     int hint = hint_di();
duke@435:     if (data_layout_at(hint)->bci() <= bci)
duke@435:       return data_at(hint);
duke@435:     return first_data();
duke@435:   }
duke@435: 
duke@435: 
duke@435:   // What is the index of the first data entry?
duke@435:   int first_di() { return 0; }
duke@435: 
kvn@480:   ciArgInfoData *arg_info() const;
kvn@480: 
duke@435: public:
duke@435:   bool is_method_data()  { return true; }
duke@435:   bool is_empty() { return _state == empty_state; }
duke@435:   bool is_mature() { return _state == mature_state; }
duke@435: 
duke@435:   int creation_mileage() { return _orig.creation_mileage(); }
duke@435:   int current_mileage()  { return _current_mileage; }
duke@435: 
duke@435:   void load_data();
duke@435: 
duke@435:   // Convert a dp (data pointer) to a di (data index).
duke@435:   int dp_to_di(address dp) {
duke@435:     return dp - ((address)_data);
duke@435:   }
duke@435: 
duke@435:   // Get the data at an arbitrary (sort of) data index.
duke@435:   ciProfileData* data_at(int data_index);
duke@435: 
duke@435:   // Walk through the data in order.
duke@435:   ciProfileData* first_data() { return data_at(first_di()); }
duke@435:   ciProfileData* next_data(ciProfileData* current);
duke@435:   bool is_valid(ciProfileData* current) { return current != NULL; }
duke@435: 
duke@435:   // Get the data at an arbitrary bci, or NULL if there is none.
duke@435:   ciProfileData* bci_to_data(int bci);
duke@435:   ciProfileData* bci_to_extra_data(int bci, bool create_if_missing);
duke@435: 
duke@435:   uint overflow_trap_count() const {
duke@435:     return _orig.overflow_trap_count();
duke@435:   }
duke@435:   uint overflow_recompile_count() const {
duke@435:     return _orig.overflow_recompile_count();
duke@435:   }
duke@435:   uint decompile_count() const {
duke@435:     return _orig.decompile_count();
duke@435:   }
duke@435:   uint trap_count(int reason) const {
duke@435:     return _orig.trap_count(reason);
duke@435:   }
duke@435:   uint trap_reason_limit() const { return _orig.trap_reason_limit(); }
duke@435:   uint trap_count_limit()  const { return _orig.trap_count_limit(); }
duke@435: 
duke@435:   // Helpful query functions that decode trap_state.
duke@435:   int has_trap_at(ciProfileData* data, int reason);
duke@435:   int has_trap_at(int bci, int reason) {
duke@435:     return has_trap_at(bci_to_data(bci), reason);
duke@435:   }
duke@435:   int trap_recompiled_at(ciProfileData* data);
duke@435:   int trap_recompiled_at(int bci) {
duke@435:     return trap_recompiled_at(bci_to_data(bci));
duke@435:   }
duke@435: 
duke@435:   void clear_escape_info();
duke@435:   bool has_escape_info();
duke@435:   void update_escape_info();
duke@435: 
duke@435:   void set_eflag(methodDataOopDesc::EscapeFlag f);
duke@435:   void clear_eflag(methodDataOopDesc::EscapeFlag f);
duke@435:   bool eflag_set(methodDataOopDesc::EscapeFlag f) const;
duke@435: 
duke@435:   void set_arg_local(int i);
duke@435:   void set_arg_stack(int i);
duke@435:   void set_arg_returned(int i);
kvn@480:   void set_arg_modified(int arg, uint val);
duke@435: 
duke@435:   bool is_arg_local(int i) const;
duke@435:   bool is_arg_stack(int i) const;
duke@435:   bool is_arg_returned(int i) const;
kvn@480:   uint arg_modified(int arg) const;
duke@435: 
duke@435:   // Code generation helper
duke@435:   ByteSize offset_of_slot(ciProfileData* data, ByteSize slot_offset_in_data);
duke@435:   int      byte_offset_of_slot(ciProfileData* data, ByteSize slot_offset_in_data) { return in_bytes(offset_of_slot(data, slot_offset_in_data)); }
duke@435: 
duke@435: #ifndef PRODUCT
duke@435:   // printing support for method data
duke@435:   void print();
duke@435:   void print_data_on(outputStream* st);
duke@435: #endif
duke@435: };