Sun, 23 May 2010 01:38:26 -0700
6939207: refactor constant pool index processing
Summary: Factored cleanup of instruction decode which prepares for enhanced ldc semantics.
Reviewed-by: twisti
duke@435 | 1 | /* |
never@1609 | 2 | * Copyright 1997-2010 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
twisti@1040 | 25 | // This file contains the platform-independent parts |
duke@435 | 26 | // of the abstract interpreter and the abstract interpreter generator. |
duke@435 | 27 | |
duke@435 | 28 | // Organization of the interpreter(s). There exists two different interpreters in hotpot |
duke@435 | 29 | // an assembly language version (aka template interpreter) and a high level language version |
duke@435 | 30 | // (aka c++ interpreter). Th division of labor is as follows: |
duke@435 | 31 | |
duke@435 | 32 | // Template Interpreter C++ Interpreter Functionality |
duke@435 | 33 | // |
duke@435 | 34 | // templateTable* bytecodeInterpreter* actual interpretation of bytecodes |
duke@435 | 35 | // |
duke@435 | 36 | // templateInterpreter* cppInterpreter* generation of assembly code that creates |
duke@435 | 37 | // and manages interpreter runtime frames. |
duke@435 | 38 | // Also code for populating interpreter |
duke@435 | 39 | // frames created during deoptimization. |
duke@435 | 40 | // |
duke@435 | 41 | // For both template and c++ interpreter. There are common files for aspects of the interpreter |
duke@435 | 42 | // that are generic to both interpreters. This is the layout: |
duke@435 | 43 | // |
duke@435 | 44 | // abstractInterpreter.hpp: generic description of the interpreter. |
duke@435 | 45 | // interpreter*: generic frame creation and handling. |
duke@435 | 46 | // |
duke@435 | 47 | |
duke@435 | 48 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 49 | // The C++ interface to the bytecode interpreter(s). |
duke@435 | 50 | |
duke@435 | 51 | class AbstractInterpreter: AllStatic { |
duke@435 | 52 | friend class VMStructs; |
duke@435 | 53 | friend class Interpreter; |
duke@435 | 54 | friend class CppInterpreterGenerator; |
duke@435 | 55 | public: |
duke@435 | 56 | enum MethodKind { |
duke@435 | 57 | zerolocals, // method needs locals initialization |
duke@435 | 58 | zerolocals_synchronized, // method needs locals initialization & is synchronized |
duke@435 | 59 | native, // native method |
duke@435 | 60 | native_synchronized, // native method & is synchronized |
duke@435 | 61 | empty, // empty method (code: _return) |
duke@435 | 62 | accessor, // accessor method (code: _aload_0, _getfield, _(a|i)return) |
duke@435 | 63 | abstract, // abstract method (throws an AbstractMethodException) |
jrose@1145 | 64 | method_handle, // java.dyn.MethodHandles::invoke |
duke@435 | 65 | java_lang_math_sin, // implementation of java.lang.Math.sin (x) |
duke@435 | 66 | java_lang_math_cos, // implementation of java.lang.Math.cos (x) |
duke@435 | 67 | java_lang_math_tan, // implementation of java.lang.Math.tan (x) |
duke@435 | 68 | java_lang_math_abs, // implementation of java.lang.Math.abs (x) |
duke@435 | 69 | java_lang_math_sqrt, // implementation of java.lang.Math.sqrt (x) |
duke@435 | 70 | java_lang_math_log, // implementation of java.lang.Math.log (x) |
duke@435 | 71 | java_lang_math_log10, // implementation of java.lang.Math.log10 (x) |
duke@435 | 72 | number_of_method_entries, |
duke@435 | 73 | invalid = -1 |
duke@435 | 74 | }; |
duke@435 | 75 | |
duke@435 | 76 | enum SomeConstants { |
duke@435 | 77 | number_of_result_handlers = 10 // number of result handlers for native calls |
duke@435 | 78 | }; |
duke@435 | 79 | |
duke@435 | 80 | protected: |
duke@435 | 81 | static StubQueue* _code; // the interpreter code (codelets) |
duke@435 | 82 | |
duke@435 | 83 | static bool _notice_safepoints; // true if safepoints are activated |
duke@435 | 84 | |
duke@435 | 85 | static address _native_entry_begin; // Region for native entry code |
duke@435 | 86 | static address _native_entry_end; |
duke@435 | 87 | |
duke@435 | 88 | // method entry points |
duke@435 | 89 | static address _entry_table[number_of_method_entries]; // entry points for a given method |
duke@435 | 90 | static address _native_abi_to_tosca[number_of_result_handlers]; // for native method result handlers |
duke@435 | 91 | static address _slow_signature_handler; // the native method generic (slow) signature handler |
duke@435 | 92 | |
duke@435 | 93 | static address _rethrow_exception_entry; // rethrows an activation in previous frame |
duke@435 | 94 | |
duke@435 | 95 | friend class AbstractInterpreterGenerator; |
duke@435 | 96 | friend class InterpreterGenerator; |
duke@435 | 97 | friend class InterpreterMacroAssembler; |
duke@435 | 98 | |
duke@435 | 99 | public: |
duke@435 | 100 | // Initialization/debugging |
duke@435 | 101 | static void initialize(); |
duke@435 | 102 | static StubQueue* code() { return _code; } |
duke@435 | 103 | |
duke@435 | 104 | |
duke@435 | 105 | // Method activation |
duke@435 | 106 | static MethodKind method_kind(methodHandle m); |
duke@435 | 107 | static address entry_for_kind(MethodKind k) { assert(0 <= k && k < number_of_method_entries, "illegal kind"); return _entry_table[k]; } |
duke@435 | 108 | static address entry_for_method(methodHandle m) { return _entry_table[method_kind(m)]; } |
duke@435 | 109 | |
duke@435 | 110 | static void print_method_kind(MethodKind kind) PRODUCT_RETURN; |
duke@435 | 111 | |
never@1609 | 112 | static bool can_be_compiled(methodHandle m); |
never@1609 | 113 | |
duke@435 | 114 | // Runtime support |
duke@435 | 115 | |
duke@435 | 116 | // length = invoke bytecode length (to advance to next bytecode) |
duke@435 | 117 | static address deopt_entry (TosState state, int length) { ShouldNotReachHere(); return NULL; } |
duke@435 | 118 | static address return_entry (TosState state, int length) { ShouldNotReachHere(); return NULL; } |
duke@435 | 119 | |
duke@435 | 120 | static address rethrow_exception_entry() { return _rethrow_exception_entry; } |
duke@435 | 121 | |
duke@435 | 122 | // Activation size in words for a method that is just being called. |
duke@435 | 123 | // Parameters haven't been pushed so count them too. |
duke@435 | 124 | static int size_top_interpreter_activation(methodOop method); |
duke@435 | 125 | |
duke@435 | 126 | // Deoptimization support |
cfang@1335 | 127 | // Compute the entry address for continuation after |
cfang@1335 | 128 | static address deopt_continue_after_entry(methodOop method, |
cfang@1335 | 129 | address bcp, |
cfang@1335 | 130 | int callee_parameters, |
cfang@1335 | 131 | bool is_top_frame); |
cfang@1335 | 132 | // Compute the entry address for reexecution |
cfang@1335 | 133 | static address deopt_reexecute_entry(methodOop method, address bcp); |
cfang@1335 | 134 | // Deoptimization should reexecute this bytecode |
cfang@1335 | 135 | static bool bytecode_should_reexecute(Bytecodes::Code code); |
duke@435 | 136 | |
duke@435 | 137 | // share implementation of size_activation and layout_activation: |
duke@435 | 138 | static int size_activation(methodOop method, |
duke@435 | 139 | int temps, |
duke@435 | 140 | int popframe_args, |
duke@435 | 141 | int monitors, |
duke@435 | 142 | int callee_params, |
duke@435 | 143 | int callee_locals, |
duke@435 | 144 | bool is_top_frame); |
duke@435 | 145 | |
duke@435 | 146 | static int layout_activation(methodOop method, |
duke@435 | 147 | int temps, |
duke@435 | 148 | int popframe_args, |
duke@435 | 149 | int monitors, |
duke@435 | 150 | int callee_params, |
duke@435 | 151 | int callee_locals, |
duke@435 | 152 | frame* caller, |
duke@435 | 153 | frame* interpreter_frame, |
duke@435 | 154 | bool is_top_frame); |
duke@435 | 155 | |
duke@435 | 156 | // Runtime support |
duke@435 | 157 | static bool is_not_reached( methodHandle method, int bci); |
duke@435 | 158 | // Safepoint support |
duke@435 | 159 | static void notice_safepoints() { ShouldNotReachHere(); } // stops the thread when reaching a safepoint |
duke@435 | 160 | static void ignore_safepoints() { ShouldNotReachHere(); } // ignores safepoints |
duke@435 | 161 | |
duke@435 | 162 | // Support for native calls |
duke@435 | 163 | static address slow_signature_handler() { return _slow_signature_handler; } |
duke@435 | 164 | static address result_handler(BasicType type) { return _native_abi_to_tosca[BasicType_as_index(type)]; } |
duke@435 | 165 | static int BasicType_as_index(BasicType type); // computes index into result_handler_by_index table |
duke@435 | 166 | static bool in_native_entry(address pc) { return _native_entry_begin <= pc && pc < _native_entry_end; } |
duke@435 | 167 | // Debugging/printing |
duke@435 | 168 | static void print(); // prints the interpreter code |
duke@435 | 169 | |
duke@435 | 170 | public: |
twisti@1861 | 171 | // Interpreter helpers |
twisti@1861 | 172 | const static int stackElementWords = 1; |
twisti@1861 | 173 | const static int stackElementSize = stackElementWords * wordSize; |
twisti@1861 | 174 | const static int logStackElementSize = LogBytesPerWord; |
duke@435 | 175 | |
duke@435 | 176 | // Local values relative to locals[n] |
duke@435 | 177 | static int local_offset_in_bytes(int n) { |
twisti@1861 | 178 | return ((frame::interpreter_frame_expression_stack_direction() * n) * stackElementSize); |
duke@435 | 179 | } |
duke@435 | 180 | |
jrose@1161 | 181 | // access to stacked values according to type: |
jrose@1161 | 182 | static oop* oop_addr_in_slot(intptr_t* slot_addr) { |
jrose@1161 | 183 | return (oop*) slot_addr; |
jrose@1161 | 184 | } |
jrose@1161 | 185 | static jint* int_addr_in_slot(intptr_t* slot_addr) { |
jrose@1161 | 186 | if ((int) sizeof(jint) < wordSize && !Bytes::is_Java_byte_ordering_different()) |
jrose@1161 | 187 | // big-endian LP64 |
jrose@1161 | 188 | return (jint*)(slot_addr + 1) - 1; |
jrose@1161 | 189 | else |
jrose@1161 | 190 | return (jint*) slot_addr; |
jrose@1161 | 191 | } |
jrose@1161 | 192 | static jlong long_in_slot(intptr_t* slot_addr) { |
jrose@1161 | 193 | if (sizeof(intptr_t) >= sizeof(jlong)) { |
jrose@1161 | 194 | return *(jlong*) slot_addr; |
twisti@1861 | 195 | } else { |
jrose@1161 | 196 | return Bytes::get_native_u8((address)slot_addr); |
jrose@1161 | 197 | } |
jrose@1161 | 198 | } |
jrose@1161 | 199 | static void set_long_in_slot(intptr_t* slot_addr, jlong value) { |
jrose@1161 | 200 | if (sizeof(intptr_t) >= sizeof(jlong)) { |
jrose@1161 | 201 | *(jlong*) slot_addr = value; |
twisti@1861 | 202 | } else { |
jrose@1161 | 203 | Bytes::put_native_u8((address)slot_addr, value); |
jrose@1161 | 204 | } |
jrose@1161 | 205 | } |
jrose@1161 | 206 | static void get_jvalue_in_slot(intptr_t* slot_addr, BasicType type, jvalue* value) { |
jrose@1161 | 207 | switch (type) { |
jrose@1161 | 208 | case T_BOOLEAN: value->z = *int_addr_in_slot(slot_addr); break; |
jrose@1161 | 209 | case T_CHAR: value->c = *int_addr_in_slot(slot_addr); break; |
jrose@1161 | 210 | case T_BYTE: value->b = *int_addr_in_slot(slot_addr); break; |
jrose@1161 | 211 | case T_SHORT: value->s = *int_addr_in_slot(slot_addr); break; |
jrose@1161 | 212 | case T_INT: value->i = *int_addr_in_slot(slot_addr); break; |
jrose@1161 | 213 | case T_LONG: value->j = long_in_slot(slot_addr); break; |
jrose@1161 | 214 | case T_FLOAT: value->f = *(jfloat*)int_addr_in_slot(slot_addr); break; |
jrose@1161 | 215 | case T_DOUBLE: value->d = jdouble_cast(long_in_slot(slot_addr)); break; |
jrose@1161 | 216 | case T_OBJECT: value->l = (jobject)*oop_addr_in_slot(slot_addr); break; |
jrose@1161 | 217 | default: ShouldNotReachHere(); |
jrose@1161 | 218 | } |
jrose@1161 | 219 | } |
jrose@1161 | 220 | static void set_jvalue_in_slot(intptr_t* slot_addr, BasicType type, jvalue* value) { |
jrose@1161 | 221 | switch (type) { |
jrose@1161 | 222 | case T_BOOLEAN: *int_addr_in_slot(slot_addr) = (value->z != 0); break; |
jrose@1161 | 223 | case T_CHAR: *int_addr_in_slot(slot_addr) = value->c; break; |
jrose@1161 | 224 | case T_BYTE: *int_addr_in_slot(slot_addr) = value->b; break; |
jrose@1161 | 225 | case T_SHORT: *int_addr_in_slot(slot_addr) = value->s; break; |
jrose@1161 | 226 | case T_INT: *int_addr_in_slot(slot_addr) = value->i; break; |
jrose@1161 | 227 | case T_LONG: set_long_in_slot(slot_addr, value->j); break; |
jrose@1161 | 228 | case T_FLOAT: *(jfloat*)int_addr_in_slot(slot_addr) = value->f; break; |
jrose@1161 | 229 | case T_DOUBLE: set_long_in_slot(slot_addr, jlong_cast(value->d)); break; |
jrose@1161 | 230 | case T_OBJECT: *oop_addr_in_slot(slot_addr) = (oop) value->l; break; |
jrose@1161 | 231 | default: ShouldNotReachHere(); |
jrose@1161 | 232 | } |
jrose@1161 | 233 | } |
duke@435 | 234 | }; |
duke@435 | 235 | |
duke@435 | 236 | //------------------------------------------------------------------------------------------------------------------------ |
duke@435 | 237 | // The interpreter generator. |
duke@435 | 238 | |
duke@435 | 239 | class Template; |
duke@435 | 240 | class AbstractInterpreterGenerator: public StackObj { |
duke@435 | 241 | protected: |
duke@435 | 242 | InterpreterMacroAssembler* _masm; |
duke@435 | 243 | |
duke@435 | 244 | // shared code sequences |
duke@435 | 245 | // Converter for native abi result to tosca result |
duke@435 | 246 | address generate_result_handler_for(BasicType type); |
duke@435 | 247 | address generate_slow_signature_handler(); |
duke@435 | 248 | |
duke@435 | 249 | // entry point generator |
duke@435 | 250 | address generate_method_entry(AbstractInterpreter::MethodKind kind); |
duke@435 | 251 | |
duke@435 | 252 | void bang_stack_shadow_pages(bool native_call); |
duke@435 | 253 | |
duke@435 | 254 | void generate_all(); |
duke@435 | 255 | |
duke@435 | 256 | public: |
duke@435 | 257 | AbstractInterpreterGenerator(StubQueue* _code); |
duke@435 | 258 | }; |