duke@435: /* duke@435: * Copyright 1997-2007 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: // This file contains the platform-independant parts duke@435: // of the template interpreter and the template interpreter generator. duke@435: duke@435: #ifndef CC_INTERP duke@435: duke@435: //------------------------------------------------------------------------------------------------------------------------ duke@435: // A little wrapper class to group tosca-specific entry points into a unit. duke@435: // (tosca = Top-Of-Stack CAche) duke@435: duke@435: class EntryPoint VALUE_OBJ_CLASS_SPEC { duke@435: private: duke@435: address _entry[number_of_states]; duke@435: duke@435: public: duke@435: // Construction duke@435: EntryPoint(); duke@435: EntryPoint(address bentry, address centry, address sentry, address aentry, address ientry, address lentry, address fentry, address dentry, address ventry); duke@435: duke@435: // Attributes duke@435: address entry(TosState state) const; // return target address for a given tosca state duke@435: void set_entry(TosState state, address entry); // set target address for a given tosca state duke@435: void print(); duke@435: duke@435: // Comparison duke@435: bool operator == (const EntryPoint& y); // for debugging only duke@435: }; duke@435: duke@435: duke@435: //------------------------------------------------------------------------------------------------------------------------ duke@435: // A little wrapper class to group tosca-specific dispatch tables into a unit. duke@435: duke@435: class DispatchTable VALUE_OBJ_CLASS_SPEC { duke@435: public: duke@435: enum { length = 1 << BitsPerByte }; // an entry point for each byte value (also for undefined bytecodes) duke@435: duke@435: private: duke@435: address _table[number_of_states][length]; // dispatch tables, indexed by tosca and bytecode duke@435: duke@435: public: duke@435: // Attributes duke@435: EntryPoint entry(int i) const; // return entry point for a given bytecode i duke@435: void set_entry(int i, EntryPoint& entry); // set entry point for a given bytecode i duke@435: address* table_for(TosState state) { return _table[state]; } duke@435: address* table_for() { return table_for((TosState)0); } duke@435: int distance_from(address *table) { return table - table_for(); } duke@435: int distance_from(TosState state) { return distance_from(table_for(state)); } duke@435: duke@435: // Comparison duke@435: bool operator == (DispatchTable& y); // for debugging only duke@435: }; duke@435: duke@435: class TemplateInterpreter: public AbstractInterpreter { duke@435: friend class VMStructs; duke@435: friend class InterpreterMacroAssembler; duke@435: friend class TemplateInterpreterGenerator; duke@435: friend class TemplateTable; duke@435: // friend class Interpreter; duke@435: public: duke@435: duke@435: enum MoreConstants { duke@435: number_of_return_entries = 9, // number of return entry points duke@435: number_of_deopt_entries = 9, // number of deoptimization entry points duke@435: number_of_return_addrs = 9 // number of return addresses duke@435: }; duke@435: duke@435: protected: duke@435: duke@435: static address _throw_ArrayIndexOutOfBoundsException_entry; duke@435: static address _throw_ArrayStoreException_entry; duke@435: static address _throw_ArithmeticException_entry; duke@435: static address _throw_ClassCastException_entry; duke@435: static address _throw_NullPointerException_entry; duke@435: static address _throw_exception_entry; duke@435: duke@435: static address _throw_StackOverflowError_entry; duke@435: duke@435: static address _remove_activation_entry; // continuation address if an exception is not handled by current frame duke@435: #ifdef HOTSWAP duke@435: static address _remove_activation_preserving_args_entry; // continuation address when current frame is being popped duke@435: #endif // HOTSWAP duke@435: duke@435: #ifndef PRODUCT duke@435: static EntryPoint _trace_code; duke@435: #endif // !PRODUCT duke@435: static EntryPoint _return_entry[number_of_return_entries]; // entry points to return to from a call duke@435: static EntryPoint _earlyret_entry; // entry point to return early from a call duke@435: static EntryPoint _deopt_entry[number_of_deopt_entries]; // entry points to return to from a deoptimization duke@435: static EntryPoint _continuation_entry; duke@435: static EntryPoint _safept_entry; duke@435: duke@435: static address _return_3_addrs_by_index[number_of_return_addrs]; // for invokevirtual return entries duke@435: static address _return_5_addrs_by_index[number_of_return_addrs]; // for invokeinterface return entries duke@435: duke@435: static DispatchTable _active_table; // the active dispatch table (used by the interpreter for dispatch) duke@435: static DispatchTable _normal_table; // the normal dispatch table (used to set the active table in normal mode) duke@435: static DispatchTable _safept_table; // the safepoint dispatch table (used to set the active table for safepoints) duke@435: static address _wentry_point[DispatchTable::length]; // wide instructions only (vtos tosca always) duke@435: duke@435: duke@435: public: duke@435: // Initialization/debugging duke@435: static void initialize(); duke@435: // this only returns whether a pc is within generated code for the interpreter. duke@435: static bool contains(address pc) { return _code != NULL && _code->contains(pc); } duke@435: duke@435: public: duke@435: duke@435: static address remove_activation_early_entry(TosState state) { return _earlyret_entry.entry(state); } duke@435: #ifdef HOTSWAP duke@435: static address remove_activation_preserving_args_entry() { return _remove_activation_preserving_args_entry; } duke@435: #endif // HOTSWAP duke@435: duke@435: static address remove_activation_entry() { return _remove_activation_entry; } duke@435: static address throw_exception_entry() { return _throw_exception_entry; } duke@435: static address throw_ArithmeticException_entry() { return _throw_ArithmeticException_entry; } duke@435: static address throw_NullPointerException_entry() { return _throw_NullPointerException_entry; } duke@435: static address throw_StackOverflowError_entry() { return _throw_StackOverflowError_entry; } duke@435: duke@435: // Code generation duke@435: #ifndef PRODUCT duke@435: static address trace_code (TosState state) { return _trace_code.entry(state); } duke@435: #endif // !PRODUCT duke@435: static address continuation (TosState state) { return _continuation_entry.entry(state); } duke@435: static address* dispatch_table(TosState state) { return _active_table.table_for(state); } duke@435: static address* dispatch_table() { return _active_table.table_for(); } duke@435: static int distance_from_dispatch_table(TosState state){ return _active_table.distance_from(state); } duke@435: static address* normal_table(TosState state) { return _normal_table.table_for(state); } duke@435: static address* normal_table() { return _normal_table.table_for(); } duke@435: duke@435: // Support for invokes duke@435: static address* return_3_addrs_by_index_table() { return _return_3_addrs_by_index; } duke@435: static address* return_5_addrs_by_index_table() { return _return_5_addrs_by_index; } duke@435: static int TosState_as_index(TosState state); // computes index into return_3_entry_by_index table duke@435: duke@435: static address return_entry (TosState state, int length); duke@435: static address deopt_entry (TosState state, int length); duke@435: duke@435: // Safepoint support duke@435: static void notice_safepoints(); // stops the thread when reaching a safepoint duke@435: static void ignore_safepoints(); // ignores safepoints duke@435: duke@435: // Deoptimization support duke@435: static address continuation_for(methodOop method, duke@435: address bcp, duke@435: int callee_parameters, duke@435: bool is_top_frame, duke@435: bool& use_next_mdp); duke@435: duke@435: #include "incls/_templateInterpreter_pd.hpp.incl" duke@435: duke@435: }; duke@435: duke@435: #endif // !CC_INTERP