Mercurial > jdk8-mips64-public > hotspot / annotate

src/share/vm/interpreter/templateInterpreter.cpp@bd02caa94611 (annotated)

src/share/vm/interpreter/templateInterpreter.cpp

Tue, 28 Jul 2009 12:12:40 -0700

author
xdono
date
Tue, 28 Jul 2009 12:12:40 -0700
changeset 1279
bd02caa94611
parent 1161
be93aad57795
child 1335
9987d9d5eb0e
permissions
-rw-r--r--

6862919: Update copyright year
Summary: Update copyright for files that have been modified in 2009, up to 07/09
Reviewed-by: tbell, ohair

duke@435 1 /*
jrose@1145 2 * Copyright 1997-2009 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
duke@435 25 #include "incls/_precompiled.incl"
duke@435 26 #include "incls/_templateInterpreter.cpp.incl"
duke@435 27
duke@435 28 #ifndef CC_INTERP
duke@435 29
duke@435 30 # define __ _masm->
duke@435 31
duke@435 32 void TemplateInterpreter::initialize() {
duke@435 33 if (_code != NULL) return;
duke@435 34 // assertions
duke@435 35 assert((int)Bytecodes::number_of_codes <= (int)DispatchTable::length,
duke@435 36 "dispatch table too small");
duke@435 37
duke@435 38 AbstractInterpreter::initialize();
duke@435 39
duke@435 40 TemplateTable::initialize();
duke@435 41
duke@435 42 // generate interpreter
duke@435 43 { ResourceMark rm;
duke@435 44 TraceTime timer("Interpreter generation", TraceStartupTime);
duke@435 45 int code_size = InterpreterCodeSize;
duke@435 46 NOT_PRODUCT(code_size *= 4;) // debug uses extra interpreter code space
duke@435 47 _code = new StubQueue(new InterpreterCodeletInterface, code_size, NULL,
duke@435 48 "Interpreter");
duke@435 49 InterpreterGenerator g(_code);
duke@435 50 if (PrintInterpreter) print();
duke@435 51 }
duke@435 52
duke@435 53 // initialize dispatch table
duke@435 54 _active_table = _normal_table;
duke@435 55 }
duke@435 56
duke@435 57 //------------------------------------------------------------------------------------------------------------------------
duke@435 58 // Implementation of EntryPoint
duke@435 59
duke@435 60 EntryPoint::EntryPoint() {
duke@435 61 assert(number_of_states == 9, "check the code below");
duke@435 62 _entry[btos] = NULL;
duke@435 63 _entry[ctos] = NULL;
duke@435 64 _entry[stos] = NULL;
duke@435 65 _entry[atos] = NULL;
duke@435 66 _entry[itos] = NULL;
duke@435 67 _entry[ltos] = NULL;
duke@435 68 _entry[ftos] = NULL;
duke@435 69 _entry[dtos] = NULL;
duke@435 70 _entry[vtos] = NULL;
duke@435 71 }
duke@435 72
duke@435 73
duke@435 74 EntryPoint::EntryPoint(address bentry, address centry, address sentry, address aentry, address ientry, address lentry, address fentry, address dentry, address ventry) {
duke@435 75 assert(number_of_states == 9, "check the code below");
duke@435 76 _entry[btos] = bentry;
duke@435 77 _entry[ctos] = centry;
duke@435 78 _entry[stos] = sentry;
duke@435 79 _entry[atos] = aentry;
duke@435 80 _entry[itos] = ientry;
duke@435 81 _entry[ltos] = lentry;
duke@435 82 _entry[ftos] = fentry;
duke@435 83 _entry[dtos] = dentry;
duke@435 84 _entry[vtos] = ventry;
duke@435 85 }
duke@435 86
duke@435 87
duke@435 88 void EntryPoint::set_entry(TosState state, address entry) {
duke@435 89 assert(0 <= state && state < number_of_states, "state out of bounds");
duke@435 90 _entry[state] = entry;
duke@435 91 }
duke@435 92
duke@435 93
duke@435 94 address EntryPoint::entry(TosState state) const {
duke@435 95 assert(0 <= state && state < number_of_states, "state out of bounds");
duke@435 96 return _entry[state];
duke@435 97 }
duke@435 98
duke@435 99
duke@435 100 void EntryPoint::print() {
duke@435 101 tty->print("[");
duke@435 102 for (int i = 0; i < number_of_states; i++) {
duke@435 103 if (i > 0) tty->print(", ");
duke@435 104 tty->print(INTPTR_FORMAT, _entry[i]);
duke@435 105 }
duke@435 106 tty->print("]");
duke@435 107 }
duke@435 108
duke@435 109
duke@435 110 bool EntryPoint::operator == (const EntryPoint& y) {
duke@435 111 int i = number_of_states;
duke@435 112 while (i-- > 0) {
duke@435 113 if (_entry[i] != y._entry[i]) return false;
duke@435 114 }
duke@435 115 return true;
duke@435 116 }
duke@435 117
duke@435 118
duke@435 119 //------------------------------------------------------------------------------------------------------------------------
duke@435 120 // Implementation of DispatchTable
duke@435 121
duke@435 122 EntryPoint DispatchTable::entry(int i) const {
duke@435 123 assert(0 <= i && i < length, "index out of bounds");
duke@435 124 return
duke@435 125 EntryPoint(
duke@435 126 _table[btos][i],
duke@435 127 _table[ctos][i],
duke@435 128 _table[stos][i],
duke@435 129 _table[atos][i],
duke@435 130 _table[itos][i],
duke@435 131 _table[ltos][i],
duke@435 132 _table[ftos][i],
duke@435 133 _table[dtos][i],
duke@435 134 _table[vtos][i]
duke@435 135 );
duke@435 136 }
duke@435 137
duke@435 138
duke@435 139 void DispatchTable::set_entry(int i, EntryPoint& entry) {
duke@435 140 assert(0 <= i && i < length, "index out of bounds");
duke@435 141 assert(number_of_states == 9, "check the code below");
duke@435 142 _table[btos][i] = entry.entry(btos);
duke@435 143 _table[ctos][i] = entry.entry(ctos);
duke@435 144 _table[stos][i] = entry.entry(stos);
duke@435 145 _table[atos][i] = entry.entry(atos);
duke@435 146 _table[itos][i] = entry.entry(itos);
duke@435 147 _table[ltos][i] = entry.entry(ltos);
duke@435 148 _table[ftos][i] = entry.entry(ftos);
duke@435 149 _table[dtos][i] = entry.entry(dtos);
duke@435 150 _table[vtos][i] = entry.entry(vtos);
duke@435 151 }
duke@435 152
duke@435 153
duke@435 154 bool DispatchTable::operator == (DispatchTable& y) {
duke@435 155 int i = length;
duke@435 156 while (i-- > 0) {
duke@435 157 EntryPoint t = y.entry(i); // for compiler compatibility (BugId 4150096)
duke@435 158 if (!(entry(i) == t)) return false;
duke@435 159 }
duke@435 160 return true;
duke@435 161 }
duke@435 162
duke@435 163 address TemplateInterpreter::_remove_activation_entry = NULL;
duke@435 164 address TemplateInterpreter::_remove_activation_preserving_args_entry = NULL;
duke@435 165
duke@435 166
duke@435 167 address TemplateInterpreter::_throw_ArrayIndexOutOfBoundsException_entry = NULL;
duke@435 168 address TemplateInterpreter::_throw_ArrayStoreException_entry = NULL;
duke@435 169 address TemplateInterpreter::_throw_ArithmeticException_entry = NULL;
duke@435 170 address TemplateInterpreter::_throw_ClassCastException_entry = NULL;
jrose@1145 171 address TemplateInterpreter::_throw_WrongMethodType_entry = NULL;
duke@435 172 address TemplateInterpreter::_throw_NullPointerException_entry = NULL;
duke@435 173 address TemplateInterpreter::_throw_StackOverflowError_entry = NULL;
duke@435 174 address TemplateInterpreter::_throw_exception_entry = NULL;
duke@435 175
duke@435 176 #ifndef PRODUCT
duke@435 177 EntryPoint TemplateInterpreter::_trace_code;
duke@435 178 #endif // !PRODUCT
duke@435 179 EntryPoint TemplateInterpreter::_return_entry[TemplateInterpreter::number_of_return_entries];
duke@435 180 EntryPoint TemplateInterpreter::_earlyret_entry;
jrose@1161 181 EntryPoint TemplateInterpreter::_return_unbox_entry;
duke@435 182 EntryPoint TemplateInterpreter::_deopt_entry [TemplateInterpreter::number_of_deopt_entries ];
duke@435 183 EntryPoint TemplateInterpreter::_continuation_entry;
duke@435 184 EntryPoint TemplateInterpreter::_safept_entry;
duke@435 185
duke@435 186 address TemplateInterpreter::_return_3_addrs_by_index[TemplateInterpreter::number_of_return_addrs];
duke@435 187 address TemplateInterpreter::_return_5_addrs_by_index[TemplateInterpreter::number_of_return_addrs];
jrose@1161 188 address TemplateInterpreter::_return_5_unbox_addrs_by_index[TemplateInterpreter::number_of_return_addrs];
duke@435 189
duke@435 190 DispatchTable TemplateInterpreter::_active_table;
duke@435 191 DispatchTable TemplateInterpreter::_normal_table;
duke@435 192 DispatchTable TemplateInterpreter::_safept_table;
duke@435 193 address TemplateInterpreter::_wentry_point[DispatchTable::length];
duke@435 194
duke@435 195 TemplateInterpreterGenerator::TemplateInterpreterGenerator(StubQueue* _code): AbstractInterpreterGenerator(_code) {
duke@435 196 _unimplemented_bytecode = NULL;
duke@435 197 _illegal_bytecode_sequence = NULL;
duke@435 198 }
duke@435 199
duke@435 200 static const BasicType types[Interpreter::number_of_result_handlers] = {
duke@435 201 T_BOOLEAN,
duke@435 202 T_CHAR ,
duke@435 203 T_BYTE ,
duke@435 204 T_SHORT ,
duke@435 205 T_INT ,
duke@435 206 T_LONG ,
duke@435 207 T_VOID ,
duke@435 208 T_FLOAT ,
duke@435 209 T_DOUBLE ,
duke@435 210 T_OBJECT
duke@435 211 };
duke@435 212
duke@435 213 void TemplateInterpreterGenerator::generate_all() {
duke@435 214 AbstractInterpreterGenerator::generate_all();
duke@435 215
duke@435 216 { CodeletMark cm(_masm, "error exits");
duke@435 217 _unimplemented_bytecode = generate_error_exit("unimplemented bytecode");
duke@435 218 _illegal_bytecode_sequence = generate_error_exit("illegal bytecode sequence - method not verified");
duke@435 219 }
duke@435 220
duke@435 221 #ifndef PRODUCT
duke@435 222 if (TraceBytecodes) {
duke@435 223 CodeletMark cm(_masm, "bytecode tracing support");
duke@435 224 Interpreter::_trace_code =
duke@435 225 EntryPoint(
duke@435 226 generate_trace_code(btos),
duke@435 227 generate_trace_code(ctos),
duke@435 228 generate_trace_code(stos),
duke@435 229 generate_trace_code(atos),
duke@435 230 generate_trace_code(itos),
duke@435 231 generate_trace_code(ltos),
duke@435 232 generate_trace_code(ftos),
duke@435 233 generate_trace_code(dtos),
duke@435 234 generate_trace_code(vtos)
duke@435 235 );
duke@435 236 }
duke@435 237 #endif // !PRODUCT
duke@435 238
duke@435 239 { CodeletMark cm(_masm, "return entry points");
duke@435 240 for (int i = 0; i < Interpreter::number_of_return_entries; i++) {
duke@435 241 Interpreter::_return_entry[i] =
duke@435 242 EntryPoint(
duke@435 243 generate_return_entry_for(itos, i),
duke@435 244 generate_return_entry_for(itos, i),
duke@435 245 generate_return_entry_for(itos, i),
duke@435 246 generate_return_entry_for(atos, i),
duke@435 247 generate_return_entry_for(itos, i),
duke@435 248 generate_return_entry_for(ltos, i),
duke@435 249 generate_return_entry_for(ftos, i),
duke@435 250 generate_return_entry_for(dtos, i),
duke@435 251 generate_return_entry_for(vtos, i)
duke@435 252 );
duke@435 253 }
duke@435 254 }
duke@435 255
jrose@1161 256 if (EnableInvokeDynamic) {
jrose@1161 257 CodeletMark cm(_masm, "unboxing return entry points");
jrose@1161 258 Interpreter::_return_unbox_entry =
jrose@1161 259 EntryPoint(
jrose@1161 260 generate_return_unbox_entry_for(btos, 5),
jrose@1161 261 generate_return_unbox_entry_for(ctos, 5),
jrose@1161 262 generate_return_unbox_entry_for(stos, 5),
jrose@1161 263 generate_return_unbox_entry_for(atos, 5), // cast conversion
jrose@1161 264 generate_return_unbox_entry_for(itos, 5),
jrose@1161 265 generate_return_unbox_entry_for(ltos, 5),
jrose@1161 266 generate_return_unbox_entry_for(ftos, 5),
jrose@1161 267 generate_return_unbox_entry_for(dtos, 5),
jrose@1161 268 Interpreter::_return_entry[5].entry(vtos) // no unboxing for void
jrose@1161 269 );
jrose@1161 270 }
jrose@1161 271
duke@435 272 { CodeletMark cm(_masm, "earlyret entry points");
duke@435 273 Interpreter::_earlyret_entry =
duke@435 274 EntryPoint(
duke@435 275 generate_earlyret_entry_for(btos),
duke@435 276 generate_earlyret_entry_for(ctos),
duke@435 277 generate_earlyret_entry_for(stos),
duke@435 278 generate_earlyret_entry_for(atos),
duke@435 279 generate_earlyret_entry_for(itos),
duke@435 280 generate_earlyret_entry_for(ltos),
duke@435 281 generate_earlyret_entry_for(ftos),
duke@435 282 generate_earlyret_entry_for(dtos),
duke@435 283 generate_earlyret_entry_for(vtos)
duke@435 284 );
duke@435 285 }
duke@435 286
duke@435 287 { CodeletMark cm(_masm, "deoptimization entry points");
duke@435 288 for (int i = 0; i < Interpreter::number_of_deopt_entries; i++) {
duke@435 289 Interpreter::_deopt_entry[i] =
duke@435 290 EntryPoint(
duke@435 291 generate_deopt_entry_for(itos, i),
duke@435 292 generate_deopt_entry_for(itos, i),
duke@435 293 generate_deopt_entry_for(itos, i),
duke@435 294 generate_deopt_entry_for(atos, i),
duke@435 295 generate_deopt_entry_for(itos, i),
duke@435 296 generate_deopt_entry_for(ltos, i),
duke@435 297 generate_deopt_entry_for(ftos, i),
duke@435 298 generate_deopt_entry_for(dtos, i),
duke@435 299 generate_deopt_entry_for(vtos, i)
duke@435 300 );
duke@435 301 }
duke@435 302 }
duke@435 303
duke@435 304 { CodeletMark cm(_masm, "result handlers for native calls");
duke@435 305 // The various result converter stublets.
duke@435 306 int is_generated[Interpreter::number_of_result_handlers];
duke@435 307 memset(is_generated, 0, sizeof(is_generated));
duke@435 308
duke@435 309 for (int i = 0; i < Interpreter::number_of_result_handlers; i++) {
duke@435 310 BasicType type = types[i];
duke@435 311 if (!is_generated[Interpreter::BasicType_as_index(type)]++) {
duke@435 312 Interpreter::_native_abi_to_tosca[Interpreter::BasicType_as_index(type)] = generate_result_handler_for(type);
duke@435 313 }
duke@435 314 }
duke@435 315 }
duke@435 316
duke@435 317 for (int j = 0; j < number_of_states; j++) {
duke@435 318 const TosState states[] = {btos, ctos, stos, itos, ltos, ftos, dtos, atos, vtos};
jrose@1161 319 int index = Interpreter::TosState_as_index(states[j]);
jrose@1161 320 Interpreter::_return_3_addrs_by_index[index] = Interpreter::return_entry(states[j], 3);
jrose@1161 321 Interpreter::_return_5_addrs_by_index[index] = Interpreter::return_entry(states[j], 5);
jrose@1161 322 if (EnableInvokeDynamic)
jrose@1161 323 Interpreter::_return_5_unbox_addrs_by_index[index] = Interpreter::return_unbox_entry(states[j], 5);
duke@435 324 }
duke@435 325
duke@435 326 { CodeletMark cm(_masm, "continuation entry points");
duke@435 327 Interpreter::_continuation_entry =
duke@435 328 EntryPoint(
duke@435 329 generate_continuation_for(btos),
duke@435 330 generate_continuation_for(ctos),
duke@435 331 generate_continuation_for(stos),
duke@435 332 generate_continuation_for(atos),
duke@435 333 generate_continuation_for(itos),
duke@435 334 generate_continuation_for(ltos),
duke@435 335 generate_continuation_for(ftos),
duke@435 336 generate_continuation_for(dtos),
duke@435 337 generate_continuation_for(vtos)
duke@435 338 );
duke@435 339 }
duke@435 340
duke@435 341 { CodeletMark cm(_masm, "safepoint entry points");
duke@435 342 Interpreter::_safept_entry =
duke@435 343 EntryPoint(
duke@435 344 generate_safept_entry_for(btos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 345 generate_safept_entry_for(ctos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 346 generate_safept_entry_for(stos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 347 generate_safept_entry_for(atos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 348 generate_safept_entry_for(itos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 349 generate_safept_entry_for(ltos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 350 generate_safept_entry_for(ftos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 351 generate_safept_entry_for(dtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 352 generate_safept_entry_for(vtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint))
duke@435 353 );
duke@435 354 }
duke@435 355
duke@435 356 { CodeletMark cm(_masm, "exception handling");
duke@435 357 // (Note: this is not safepoint safe because thread may return to compiled code)
duke@435 358 generate_throw_exception();
duke@435 359 }
duke@435 360
duke@435 361 { CodeletMark cm(_masm, "throw exception entrypoints");
duke@435 362 Interpreter::_throw_ArrayIndexOutOfBoundsException_entry = generate_ArrayIndexOutOfBounds_handler("java/lang/ArrayIndexOutOfBoundsException");
duke@435 363 Interpreter::_throw_ArrayStoreException_entry = generate_klass_exception_handler("java/lang/ArrayStoreException" );
duke@435 364 Interpreter::_throw_ArithmeticException_entry = generate_exception_handler("java/lang/ArithmeticException" , "/ by zero");
duke@435 365 Interpreter::_throw_ClassCastException_entry = generate_ClassCastException_handler();
jrose@1145 366 Interpreter::_throw_WrongMethodType_entry = generate_WrongMethodType_handler();
duke@435 367 Interpreter::_throw_NullPointerException_entry = generate_exception_handler("java/lang/NullPointerException" , NULL );
duke@435 368 Interpreter::_throw_StackOverflowError_entry = generate_StackOverflowError_handler();
duke@435 369 }
duke@435 370
duke@435 371
duke@435 372
duke@435 373 #define method_entry(kind) \
duke@435 374 { CodeletMark cm(_masm, "method entry point (kind = " #kind ")"); \
duke@435 375 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind); \
duke@435 376 }
duke@435 377
duke@435 378 // all non-native method kinds
duke@435 379 method_entry(zerolocals)
duke@435 380 method_entry(zerolocals_synchronized)
duke@435 381 method_entry(empty)
duke@435 382 method_entry(accessor)
duke@435 383 method_entry(abstract)
jrose@1145 384 method_entry(method_handle)
duke@435 385 method_entry(java_lang_math_sin )
duke@435 386 method_entry(java_lang_math_cos )
duke@435 387 method_entry(java_lang_math_tan )
duke@435 388 method_entry(java_lang_math_abs )
duke@435 389 method_entry(java_lang_math_sqrt )
duke@435 390 method_entry(java_lang_math_log )
duke@435 391 method_entry(java_lang_math_log10)
duke@435 392
duke@435 393 // all native method kinds (must be one contiguous block)
duke@435 394 Interpreter::_native_entry_begin = Interpreter::code()->code_end();
duke@435 395 method_entry(native)
duke@435 396 method_entry(native_synchronized)
duke@435 397 Interpreter::_native_entry_end = Interpreter::code()->code_end();
duke@435 398
duke@435 399 #undef method_entry
duke@435 400
duke@435 401 // Bytecodes
duke@435 402 set_entry_points_for_all_bytes();
duke@435 403 set_safepoints_for_all_bytes();
duke@435 404 }
duke@435 405
duke@435 406 //------------------------------------------------------------------------------------------------------------------------
duke@435 407
duke@435 408 address TemplateInterpreterGenerator::generate_error_exit(const char* msg) {
duke@435 409 address entry = __ pc();
duke@435 410 __ stop(msg);
duke@435 411 return entry;
duke@435 412 }
duke@435 413
duke@435 414
duke@435 415 //------------------------------------------------------------------------------------------------------------------------
duke@435 416
duke@435 417 void TemplateInterpreterGenerator::set_entry_points_for_all_bytes() {
duke@435 418 for (int i = 0; i < DispatchTable::length; i++) {
duke@435 419 Bytecodes::Code code = (Bytecodes::Code)i;
duke@435 420 if (Bytecodes::is_defined(code)) {
duke@435 421 set_entry_points(code);
duke@435 422 } else {
duke@435 423 set_unimplemented(i);
duke@435 424 }
duke@435 425 }
duke@435 426 }
duke@435 427
duke@435 428
duke@435 429 void TemplateInterpreterGenerator::set_safepoints_for_all_bytes() {
duke@435 430 for (int i = 0; i < DispatchTable::length; i++) {
duke@435 431 Bytecodes::Code code = (Bytecodes::Code)i;
duke@435 432 if (Bytecodes::is_defined(code)) Interpreter::_safept_table.set_entry(code, Interpreter::_safept_entry);
duke@435 433 }
duke@435 434 }
duke@435 435
duke@435 436
duke@435 437 void TemplateInterpreterGenerator::set_unimplemented(int i) {
duke@435 438 address e = _unimplemented_bytecode;
duke@435 439 EntryPoint entry(e, e, e, e, e, e, e, e, e);
duke@435 440 Interpreter::_normal_table.set_entry(i, entry);
duke@435 441 Interpreter::_wentry_point[i] = _unimplemented_bytecode;
duke@435 442 }
duke@435 443
duke@435 444
duke@435 445 void TemplateInterpreterGenerator::set_entry_points(Bytecodes::Code code) {
duke@435 446 CodeletMark cm(_masm, Bytecodes::name(code), code);
duke@435 447 // initialize entry points
duke@435 448 assert(_unimplemented_bytecode != NULL, "should have been generated before");
duke@435 449 assert(_illegal_bytecode_sequence != NULL, "should have been generated before");
duke@435 450 address bep = _illegal_bytecode_sequence;
duke@435 451 address cep = _illegal_bytecode_sequence;
duke@435 452 address sep = _illegal_bytecode_sequence;
duke@435 453 address aep = _illegal_bytecode_sequence;
duke@435 454 address iep = _illegal_bytecode_sequence;
duke@435 455 address lep = _illegal_bytecode_sequence;
duke@435 456 address fep = _illegal_bytecode_sequence;
duke@435 457 address dep = _illegal_bytecode_sequence;
duke@435 458 address vep = _unimplemented_bytecode;
duke@435 459 address wep = _unimplemented_bytecode;
duke@435 460 // code for short & wide version of bytecode
duke@435 461 if (Bytecodes::is_defined(code)) {
duke@435 462 Template* t = TemplateTable::template_for(code);
duke@435 463 assert(t->is_valid(), "just checking");
duke@435 464 set_short_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep);
duke@435 465 }
duke@435 466 if (Bytecodes::wide_is_defined(code)) {
duke@435 467 Template* t = TemplateTable::template_for_wide(code);
duke@435 468 assert(t->is_valid(), "just checking");
duke@435 469 set_wide_entry_point(t, wep);
duke@435 470 }
duke@435 471 // set entry points
duke@435 472 EntryPoint entry(bep, cep, sep, aep, iep, lep, fep, dep, vep);
duke@435 473 Interpreter::_normal_table.set_entry(code, entry);
duke@435 474 Interpreter::_wentry_point[code] = wep;
duke@435 475 }
duke@435 476
duke@435 477
duke@435 478 void TemplateInterpreterGenerator::set_wide_entry_point(Template* t, address& wep) {
duke@435 479 assert(t->is_valid(), "template must exist");
duke@435 480 assert(t->tos_in() == vtos, "only vtos tos_in supported for wide instructions")
duke@435 481 wep = __ pc(); generate_and_dispatch(t);
duke@435 482 }
duke@435 483
duke@435 484
duke@435 485 void TemplateInterpreterGenerator::set_short_entry_points(Template* t, address& bep, address& cep, address& sep, address& aep, address& iep, address& lep, address& fep, address& dep, address& vep) {
duke@435 486 assert(t->is_valid(), "template must exist");
duke@435 487 switch (t->tos_in()) {
duke@435 488 case btos: vep = __ pc(); __ pop(btos); bep = __ pc(); generate_and_dispatch(t); break;
duke@435 489 case ctos: vep = __ pc(); __ pop(ctos); sep = __ pc(); generate_and_dispatch(t); break;
duke@435 490 case stos: vep = __ pc(); __ pop(stos); sep = __ pc(); generate_and_dispatch(t); break;
duke@435 491 case atos: vep = __ pc(); __ pop(atos); aep = __ pc(); generate_and_dispatch(t); break;
duke@435 492 case itos: vep = __ pc(); __ pop(itos); iep = __ pc(); generate_and_dispatch(t); break;
duke@435 493 case ltos: vep = __ pc(); __ pop(ltos); lep = __ pc(); generate_and_dispatch(t); break;
duke@435 494 case ftos: vep = __ pc(); __ pop(ftos); fep = __ pc(); generate_and_dispatch(t); break;
duke@435 495 case dtos: vep = __ pc(); __ pop(dtos); dep = __ pc(); generate_and_dispatch(t); break;
duke@435 496 case vtos: set_vtos_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep); break;
duke@435 497 default : ShouldNotReachHere(); break;
duke@435 498 }
duke@435 499 }
duke@435 500
duke@435 501
duke@435 502 //------------------------------------------------------------------------------------------------------------------------
duke@435 503
duke@435 504 void TemplateInterpreterGenerator::generate_and_dispatch(Template* t, TosState tos_out) {
duke@435 505 if (PrintBytecodeHistogram) histogram_bytecode(t);
duke@435 506 #ifndef PRODUCT
duke@435 507 // debugging code
duke@435 508 if (CountBytecodes || TraceBytecodes || StopInterpreterAt > 0) count_bytecode();
duke@435 509 if (PrintBytecodePairHistogram) histogram_bytecode_pair(t);
duke@435 510 if (TraceBytecodes) trace_bytecode(t);
duke@435 511 if (StopInterpreterAt > 0) stop_interpreter_at();
duke@435 512 __ verify_FPU(1, t->tos_in());
duke@435 513 #endif // !PRODUCT
duke@435 514 int step;
duke@435 515 if (!t->does_dispatch()) {
duke@435 516 step = t->is_wide() ? Bytecodes::wide_length_for(t->bytecode()) : Bytecodes::length_for(t->bytecode());
duke@435 517 if (tos_out == ilgl) tos_out = t->tos_out();
duke@435 518 // compute bytecode size
duke@435 519 assert(step > 0, "just checkin'");
duke@435 520 // setup stuff for dispatching next bytecode
duke@435 521 if (ProfileInterpreter && VerifyDataPointer
duke@435 522 && methodDataOopDesc::bytecode_has_profile(t->bytecode())) {
duke@435 523 __ verify_method_data_pointer();
duke@435 524 }
duke@435 525 __ dispatch_prolog(tos_out, step);
duke@435 526 }
duke@435 527 // generate template
duke@435 528 t->generate(_masm);
duke@435 529 // advance
duke@435 530 if (t->does_dispatch()) {
duke@435 531 #ifdef ASSERT
duke@435 532 // make sure execution doesn't go beyond this point if code is broken
duke@435 533 __ should_not_reach_here();
duke@435 534 #endif // ASSERT
duke@435 535 } else {
duke@435 536 // dispatch to next bytecode
duke@435 537 __ dispatch_epilog(tos_out, step);
duke@435 538 }
duke@435 539 }
duke@435 540
duke@435 541 //------------------------------------------------------------------------------------------------------------------------
duke@435 542 // Entry points
duke@435 543
duke@435 544 address TemplateInterpreter::return_entry(TosState state, int length) {
duke@435 545 guarantee(0 <= length && length < Interpreter::number_of_return_entries, "illegal length");
duke@435 546 return _return_entry[length].entry(state);
duke@435 547 }
duke@435 548
duke@435 549
jrose@1161 550 address TemplateInterpreter::return_unbox_entry(TosState state, int length) {
jrose@1161 551 assert(EnableInvokeDynamic, "");
jrose@1161 552 if (state == vtos) {
jrose@1161 553 // no unboxing to do, actually
jrose@1161 554 return return_entry(state, length);
jrose@1161 555 } else {
jrose@1161 556 assert(length == 5, "unboxing entries generated for invokedynamic only");
jrose@1161 557 return _return_unbox_entry.entry(state);
jrose@1161 558 }
jrose@1161 559 }
jrose@1161 560
jrose@1161 561
duke@435 562 address TemplateInterpreter::deopt_entry(TosState state, int length) {
duke@435 563 guarantee(0 <= length && length < Interpreter::number_of_deopt_entries, "illegal length");
duke@435 564 return _deopt_entry[length].entry(state);
duke@435 565 }
duke@435 566
duke@435 567 //------------------------------------------------------------------------------------------------------------------------
duke@435 568 // Suport for invokes
duke@435 569
duke@435 570 int TemplateInterpreter::TosState_as_index(TosState state) {
duke@435 571 assert( state < number_of_states , "Invalid state in TosState_as_index");
duke@435 572 assert(0 <= (int)state && (int)state < TemplateInterpreter::number_of_return_addrs, "index out of bounds");
duke@435 573 return (int)state;
duke@435 574 }
duke@435 575
duke@435 576
duke@435 577 //------------------------------------------------------------------------------------------------------------------------
duke@435 578 // Safepoint suppport
duke@435 579
duke@435 580 static inline void copy_table(address* from, address* to, int size) {
duke@435 581 // Copy non-overlapping tables. The copy has to occur word wise for MT safety.
duke@435 582 while (size-- > 0) *to++ = *from++;
duke@435 583 }
duke@435 584
duke@435 585 void TemplateInterpreter::notice_safepoints() {
duke@435 586 if (!_notice_safepoints) {
duke@435 587 // switch to safepoint dispatch table
duke@435 588 _notice_safepoints = true;
duke@435 589 copy_table((address*)&_safept_table, (address*)&_active_table, sizeof(_active_table) / sizeof(address));
duke@435 590 }
duke@435 591 }
duke@435 592
duke@435 593 // switch from the dispatch table which notices safepoints back to the
duke@435 594 // normal dispatch table. So that we can notice single stepping points,
duke@435 595 // keep the safepoint dispatch table if we are single stepping in JVMTI.
duke@435 596 // Note that the should_post_single_step test is exactly as fast as the
duke@435 597 // JvmtiExport::_enabled test and covers both cases.
duke@435 598 void TemplateInterpreter::ignore_safepoints() {
duke@435 599 if (_notice_safepoints) {
duke@435 600 if (!JvmtiExport::should_post_single_step()) {
duke@435 601 // switch to normal dispatch table
duke@435 602 _notice_safepoints = false;
duke@435 603 copy_table((address*)&_normal_table, (address*)&_active_table, sizeof(_active_table) / sizeof(address));
duke@435 604 }
duke@435 605 }
duke@435 606 }
duke@435 607
duke@435 608 // If deoptimization happens, this method returns the point where to continue in
duke@435 609 // interpreter. For calls (invokexxxx, newxxxx) the continuation is at next
duke@435 610 // bci and the top of stack is in eax/edx/FPU tos.
duke@435 611 // For putfield/getfield, put/getstatic, the continuation is at the same
duke@435 612 // bci and the TOS is on stack.
duke@435 613
duke@435 614 // Note: deopt_entry(type, 0) means reexecute bytecode
duke@435 615 // deopt_entry(type, length) means continue at next bytecode
duke@435 616
duke@435 617 address TemplateInterpreter::continuation_for(methodOop method, address bcp, int callee_parameters, bool is_top_frame, bool& use_next_mdp) {
duke@435 618 assert(method->contains(bcp), "just checkin'");
duke@435 619 Bytecodes::Code code = Bytecodes::java_code_at(bcp);
duke@435 620 if (code == Bytecodes::_return) {
duke@435 621 // This is used for deopt during registration of finalizers
duke@435 622 // during Object.<init>. We simply need to resume execution at
duke@435 623 // the standard return vtos bytecode to pop the frame normally.
duke@435 624 // reexecuting the real bytecode would cause double registration
duke@435 625 // of the finalizable object.
duke@435 626 assert(is_top_frame, "must be on top");
duke@435 627 return _normal_table.entry(Bytecodes::_return).entry(vtos);
duke@435 628 } else {
duke@435 629 return AbstractInterpreter::continuation_for(method, bcp, callee_parameters, is_top_frame, use_next_mdp);
duke@435 630 }
duke@435 631 }
duke@435 632
duke@435 633 #endif // !CC_INTERP

Mercurial Repository: jdk8-mips64-public/hotspot

mercurial