Mercurial > jdk8-mips64-public > hotspot / annotate

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

src/share/vm/interpreter/templateInterpreter.cpp

Sun, 11 Oct 2009 16:19:25 -0700

author
jcoomes
date
Sun, 11 Oct 2009 16:19:25 -0700
changeset 1844
cff162798819
parent 1506
b18963243361
child 1907
c18cbe5936b8
permissions
-rw-r--r--

6888953: some calls to function-like macros are missing semicolons
Reviewed-by: pbk, kvn

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;
duke@435 181 EntryPoint TemplateInterpreter::_deopt_entry [TemplateInterpreter::number_of_deopt_entries ];
duke@435 182 EntryPoint TemplateInterpreter::_continuation_entry;
duke@435 183 EntryPoint TemplateInterpreter::_safept_entry;
duke@435 184
duke@435 185 address TemplateInterpreter::_return_3_addrs_by_index[TemplateInterpreter::number_of_return_addrs];
duke@435 186 address TemplateInterpreter::_return_5_addrs_by_index[TemplateInterpreter::number_of_return_addrs];
duke@435 187
duke@435 188 DispatchTable TemplateInterpreter::_active_table;
duke@435 189 DispatchTable TemplateInterpreter::_normal_table;
duke@435 190 DispatchTable TemplateInterpreter::_safept_table;
duke@435 191 address TemplateInterpreter::_wentry_point[DispatchTable::length];
duke@435 192
duke@435 193 TemplateInterpreterGenerator::TemplateInterpreterGenerator(StubQueue* _code): AbstractInterpreterGenerator(_code) {
duke@435 194 _unimplemented_bytecode = NULL;
duke@435 195 _illegal_bytecode_sequence = NULL;
duke@435 196 }
duke@435 197
duke@435 198 static const BasicType types[Interpreter::number_of_result_handlers] = {
duke@435 199 T_BOOLEAN,
duke@435 200 T_CHAR ,
duke@435 201 T_BYTE ,
duke@435 202 T_SHORT ,
duke@435 203 T_INT ,
duke@435 204 T_LONG ,
duke@435 205 T_VOID ,
duke@435 206 T_FLOAT ,
duke@435 207 T_DOUBLE ,
duke@435 208 T_OBJECT
duke@435 209 };
duke@435 210
duke@435 211 void TemplateInterpreterGenerator::generate_all() {
duke@435 212 AbstractInterpreterGenerator::generate_all();
duke@435 213
duke@435 214 { CodeletMark cm(_masm, "error exits");
duke@435 215 _unimplemented_bytecode = generate_error_exit("unimplemented bytecode");
duke@435 216 _illegal_bytecode_sequence = generate_error_exit("illegal bytecode sequence - method not verified");
duke@435 217 }
duke@435 218
duke@435 219 #ifndef PRODUCT
duke@435 220 if (TraceBytecodes) {
duke@435 221 CodeletMark cm(_masm, "bytecode tracing support");
duke@435 222 Interpreter::_trace_code =
duke@435 223 EntryPoint(
duke@435 224 generate_trace_code(btos),
duke@435 225 generate_trace_code(ctos),
duke@435 226 generate_trace_code(stos),
duke@435 227 generate_trace_code(atos),
duke@435 228 generate_trace_code(itos),
duke@435 229 generate_trace_code(ltos),
duke@435 230 generate_trace_code(ftos),
duke@435 231 generate_trace_code(dtos),
duke@435 232 generate_trace_code(vtos)
duke@435 233 );
duke@435 234 }
duke@435 235 #endif // !PRODUCT
duke@435 236
duke@435 237 { CodeletMark cm(_masm, "return entry points");
duke@435 238 for (int i = 0; i < Interpreter::number_of_return_entries; i++) {
duke@435 239 Interpreter::_return_entry[i] =
duke@435 240 EntryPoint(
duke@435 241 generate_return_entry_for(itos, i),
duke@435 242 generate_return_entry_for(itos, i),
duke@435 243 generate_return_entry_for(itos, i),
duke@435 244 generate_return_entry_for(atos, i),
duke@435 245 generate_return_entry_for(itos, i),
duke@435 246 generate_return_entry_for(ltos, i),
duke@435 247 generate_return_entry_for(ftos, i),
duke@435 248 generate_return_entry_for(dtos, i),
duke@435 249 generate_return_entry_for(vtos, i)
duke@435 250 );
duke@435 251 }
duke@435 252 }
duke@435 253
duke@435 254 { CodeletMark cm(_masm, "earlyret entry points");
duke@435 255 Interpreter::_earlyret_entry =
duke@435 256 EntryPoint(
duke@435 257 generate_earlyret_entry_for(btos),
duke@435 258 generate_earlyret_entry_for(ctos),
duke@435 259 generate_earlyret_entry_for(stos),
duke@435 260 generate_earlyret_entry_for(atos),
duke@435 261 generate_earlyret_entry_for(itos),
duke@435 262 generate_earlyret_entry_for(ltos),
duke@435 263 generate_earlyret_entry_for(ftos),
duke@435 264 generate_earlyret_entry_for(dtos),
duke@435 265 generate_earlyret_entry_for(vtos)
duke@435 266 );
duke@435 267 }
duke@435 268
duke@435 269 { CodeletMark cm(_masm, "deoptimization entry points");
duke@435 270 for (int i = 0; i < Interpreter::number_of_deopt_entries; i++) {
duke@435 271 Interpreter::_deopt_entry[i] =
duke@435 272 EntryPoint(
duke@435 273 generate_deopt_entry_for(itos, i),
duke@435 274 generate_deopt_entry_for(itos, i),
duke@435 275 generate_deopt_entry_for(itos, i),
duke@435 276 generate_deopt_entry_for(atos, i),
duke@435 277 generate_deopt_entry_for(itos, i),
duke@435 278 generate_deopt_entry_for(ltos, i),
duke@435 279 generate_deopt_entry_for(ftos, i),
duke@435 280 generate_deopt_entry_for(dtos, i),
duke@435 281 generate_deopt_entry_for(vtos, i)
duke@435 282 );
duke@435 283 }
duke@435 284 }
duke@435 285
duke@435 286 { CodeletMark cm(_masm, "result handlers for native calls");
duke@435 287 // The various result converter stublets.
duke@435 288 int is_generated[Interpreter::number_of_result_handlers];
duke@435 289 memset(is_generated, 0, sizeof(is_generated));
duke@435 290
duke@435 291 for (int i = 0; i < Interpreter::number_of_result_handlers; i++) {
duke@435 292 BasicType type = types[i];
duke@435 293 if (!is_generated[Interpreter::BasicType_as_index(type)]++) {
duke@435 294 Interpreter::_native_abi_to_tosca[Interpreter::BasicType_as_index(type)] = generate_result_handler_for(type);
duke@435 295 }
duke@435 296 }
duke@435 297 }
duke@435 298
duke@435 299 for (int j = 0; j < number_of_states; j++) {
duke@435 300 const TosState states[] = {btos, ctos, stos, itos, ltos, ftos, dtos, atos, vtos};
jrose@1161 301 int index = Interpreter::TosState_as_index(states[j]);
jrose@1161 302 Interpreter::_return_3_addrs_by_index[index] = Interpreter::return_entry(states[j], 3);
jrose@1161 303 Interpreter::_return_5_addrs_by_index[index] = Interpreter::return_entry(states[j], 5);
duke@435 304 }
duke@435 305
duke@435 306 { CodeletMark cm(_masm, "continuation entry points");
duke@435 307 Interpreter::_continuation_entry =
duke@435 308 EntryPoint(
duke@435 309 generate_continuation_for(btos),
duke@435 310 generate_continuation_for(ctos),
duke@435 311 generate_continuation_for(stos),
duke@435 312 generate_continuation_for(atos),
duke@435 313 generate_continuation_for(itos),
duke@435 314 generate_continuation_for(ltos),
duke@435 315 generate_continuation_for(ftos),
duke@435 316 generate_continuation_for(dtos),
duke@435 317 generate_continuation_for(vtos)
duke@435 318 );
duke@435 319 }
duke@435 320
duke@435 321 { CodeletMark cm(_masm, "safepoint entry points");
duke@435 322 Interpreter::_safept_entry =
duke@435 323 EntryPoint(
duke@435 324 generate_safept_entry_for(btos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 325 generate_safept_entry_for(ctos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 326 generate_safept_entry_for(stos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 327 generate_safept_entry_for(atos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 328 generate_safept_entry_for(itos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 329 generate_safept_entry_for(ltos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 330 generate_safept_entry_for(ftos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 331 generate_safept_entry_for(dtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
duke@435 332 generate_safept_entry_for(vtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint))
duke@435 333 );
duke@435 334 }
duke@435 335
duke@435 336 { CodeletMark cm(_masm, "exception handling");
duke@435 337 // (Note: this is not safepoint safe because thread may return to compiled code)
duke@435 338 generate_throw_exception();
duke@435 339 }
duke@435 340
duke@435 341 { CodeletMark cm(_masm, "throw exception entrypoints");
duke@435 342 Interpreter::_throw_ArrayIndexOutOfBoundsException_entry = generate_ArrayIndexOutOfBounds_handler("java/lang/ArrayIndexOutOfBoundsException");
duke@435 343 Interpreter::_throw_ArrayStoreException_entry = generate_klass_exception_handler("java/lang/ArrayStoreException" );
duke@435 344 Interpreter::_throw_ArithmeticException_entry = generate_exception_handler("java/lang/ArithmeticException" , "/ by zero");
duke@435 345 Interpreter::_throw_ClassCastException_entry = generate_ClassCastException_handler();
jrose@1145 346 Interpreter::_throw_WrongMethodType_entry = generate_WrongMethodType_handler();
duke@435 347 Interpreter::_throw_NullPointerException_entry = generate_exception_handler("java/lang/NullPointerException" , NULL );
duke@435 348 Interpreter::_throw_StackOverflowError_entry = generate_StackOverflowError_handler();
duke@435 349 }
duke@435 350
duke@435 351
duke@435 352
duke@435 353 #define method_entry(kind) \
duke@435 354 { CodeletMark cm(_masm, "method entry point (kind = " #kind ")"); \
duke@435 355 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind); \
duke@435 356 }
duke@435 357
duke@435 358 // all non-native method kinds
duke@435 359 method_entry(zerolocals)
duke@435 360 method_entry(zerolocals_synchronized)
duke@435 361 method_entry(empty)
duke@435 362 method_entry(accessor)
duke@435 363 method_entry(abstract)
jrose@1145 364 method_entry(method_handle)
duke@435 365 method_entry(java_lang_math_sin )
duke@435 366 method_entry(java_lang_math_cos )
duke@435 367 method_entry(java_lang_math_tan )
duke@435 368 method_entry(java_lang_math_abs )
duke@435 369 method_entry(java_lang_math_sqrt )
duke@435 370 method_entry(java_lang_math_log )
duke@435 371 method_entry(java_lang_math_log10)
duke@435 372
duke@435 373 // all native method kinds (must be one contiguous block)
duke@435 374 Interpreter::_native_entry_begin = Interpreter::code()->code_end();
duke@435 375 method_entry(native)
duke@435 376 method_entry(native_synchronized)
duke@435 377 Interpreter::_native_entry_end = Interpreter::code()->code_end();
duke@435 378
duke@435 379 #undef method_entry
duke@435 380
duke@435 381 // Bytecodes
duke@435 382 set_entry_points_for_all_bytes();
duke@435 383 set_safepoints_for_all_bytes();
duke@435 384 }
duke@435 385
duke@435 386 //------------------------------------------------------------------------------------------------------------------------
duke@435 387
duke@435 388 address TemplateInterpreterGenerator::generate_error_exit(const char* msg) {
duke@435 389 address entry = __ pc();
duke@435 390 __ stop(msg);
duke@435 391 return entry;
duke@435 392 }
duke@435 393
duke@435 394
duke@435 395 //------------------------------------------------------------------------------------------------------------------------
duke@435 396
duke@435 397 void TemplateInterpreterGenerator::set_entry_points_for_all_bytes() {
duke@435 398 for (int i = 0; i < DispatchTable::length; i++) {
duke@435 399 Bytecodes::Code code = (Bytecodes::Code)i;
duke@435 400 if (Bytecodes::is_defined(code)) {
duke@435 401 set_entry_points(code);
duke@435 402 } else {
duke@435 403 set_unimplemented(i);
duke@435 404 }
duke@435 405 }
duke@435 406 }
duke@435 407
duke@435 408
duke@435 409 void TemplateInterpreterGenerator::set_safepoints_for_all_bytes() {
duke@435 410 for (int i = 0; i < DispatchTable::length; i++) {
duke@435 411 Bytecodes::Code code = (Bytecodes::Code)i;
duke@435 412 if (Bytecodes::is_defined(code)) Interpreter::_safept_table.set_entry(code, Interpreter::_safept_entry);
duke@435 413 }
duke@435 414 }
duke@435 415
duke@435 416
duke@435 417 void TemplateInterpreterGenerator::set_unimplemented(int i) {
duke@435 418 address e = _unimplemented_bytecode;
duke@435 419 EntryPoint entry(e, e, e, e, e, e, e, e, e);
duke@435 420 Interpreter::_normal_table.set_entry(i, entry);
duke@435 421 Interpreter::_wentry_point[i] = _unimplemented_bytecode;
duke@435 422 }
duke@435 423
duke@435 424
duke@435 425 void TemplateInterpreterGenerator::set_entry_points(Bytecodes::Code code) {
duke@435 426 CodeletMark cm(_masm, Bytecodes::name(code), code);
duke@435 427 // initialize entry points
duke@435 428 assert(_unimplemented_bytecode != NULL, "should have been generated before");
duke@435 429 assert(_illegal_bytecode_sequence != NULL, "should have been generated before");
duke@435 430 address bep = _illegal_bytecode_sequence;
duke@435 431 address cep = _illegal_bytecode_sequence;
duke@435 432 address sep = _illegal_bytecode_sequence;
duke@435 433 address aep = _illegal_bytecode_sequence;
duke@435 434 address iep = _illegal_bytecode_sequence;
duke@435 435 address lep = _illegal_bytecode_sequence;
duke@435 436 address fep = _illegal_bytecode_sequence;
duke@435 437 address dep = _illegal_bytecode_sequence;
duke@435 438 address vep = _unimplemented_bytecode;
duke@435 439 address wep = _unimplemented_bytecode;
duke@435 440 // code for short & wide version of bytecode
duke@435 441 if (Bytecodes::is_defined(code)) {
duke@435 442 Template* t = TemplateTable::template_for(code);
duke@435 443 assert(t->is_valid(), "just checking");
duke@435 444 set_short_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep);
duke@435 445 }
duke@435 446 if (Bytecodes::wide_is_defined(code)) {
duke@435 447 Template* t = TemplateTable::template_for_wide(code);
duke@435 448 assert(t->is_valid(), "just checking");
duke@435 449 set_wide_entry_point(t, wep);
duke@435 450 }
duke@435 451 // set entry points
duke@435 452 EntryPoint entry(bep, cep, sep, aep, iep, lep, fep, dep, vep);
duke@435 453 Interpreter::_normal_table.set_entry(code, entry);
duke@435 454 Interpreter::_wentry_point[code] = wep;
duke@435 455 }
duke@435 456
duke@435 457
duke@435 458 void TemplateInterpreterGenerator::set_wide_entry_point(Template* t, address& wep) {
duke@435 459 assert(t->is_valid(), "template must exist");
jcoomes@1844 460 assert(t->tos_in() == vtos, "only vtos tos_in supported for wide instructions");
duke@435 461 wep = __ pc(); generate_and_dispatch(t);
duke@435 462 }
duke@435 463
duke@435 464
duke@435 465 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 466 assert(t->is_valid(), "template must exist");
duke@435 467 switch (t->tos_in()) {
twisti@1506 468 case btos:
twisti@1506 469 case ctos:
twisti@1506 470 case stos:
twisti@1506 471 ShouldNotReachHere(); // btos/ctos/stos should use itos.
twisti@1506 472 break;
duke@435 473 case atos: vep = __ pc(); __ pop(atos); aep = __ pc(); generate_and_dispatch(t); break;
duke@435 474 case itos: vep = __ pc(); __ pop(itos); iep = __ pc(); generate_and_dispatch(t); break;
duke@435 475 case ltos: vep = __ pc(); __ pop(ltos); lep = __ pc(); generate_and_dispatch(t); break;
duke@435 476 case ftos: vep = __ pc(); __ pop(ftos); fep = __ pc(); generate_and_dispatch(t); break;
duke@435 477 case dtos: vep = __ pc(); __ pop(dtos); dep = __ pc(); generate_and_dispatch(t); break;
duke@435 478 case vtos: set_vtos_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep); break;
duke@435 479 default : ShouldNotReachHere(); break;
duke@435 480 }
duke@435 481 }
duke@435 482
duke@435 483
duke@435 484 //------------------------------------------------------------------------------------------------------------------------
duke@435 485
duke@435 486 void TemplateInterpreterGenerator::generate_and_dispatch(Template* t, TosState tos_out) {
duke@435 487 if (PrintBytecodeHistogram) histogram_bytecode(t);
duke@435 488 #ifndef PRODUCT
duke@435 489 // debugging code
duke@435 490 if (CountBytecodes || TraceBytecodes || StopInterpreterAt > 0) count_bytecode();
duke@435 491 if (PrintBytecodePairHistogram) histogram_bytecode_pair(t);
duke@435 492 if (TraceBytecodes) trace_bytecode(t);
duke@435 493 if (StopInterpreterAt > 0) stop_interpreter_at();
duke@435 494 __ verify_FPU(1, t->tos_in());
duke@435 495 #endif // !PRODUCT
duke@435 496 int step;
duke@435 497 if (!t->does_dispatch()) {
duke@435 498 step = t->is_wide() ? Bytecodes::wide_length_for(t->bytecode()) : Bytecodes::length_for(t->bytecode());
duke@435 499 if (tos_out == ilgl) tos_out = t->tos_out();
duke@435 500 // compute bytecode size
duke@435 501 assert(step > 0, "just checkin'");
duke@435 502 // setup stuff for dispatching next bytecode
duke@435 503 if (ProfileInterpreter && VerifyDataPointer
duke@435 504 && methodDataOopDesc::bytecode_has_profile(t->bytecode())) {
duke@435 505 __ verify_method_data_pointer();
duke@435 506 }
duke@435 507 __ dispatch_prolog(tos_out, step);
duke@435 508 }
duke@435 509 // generate template
duke@435 510 t->generate(_masm);
duke@435 511 // advance
duke@435 512 if (t->does_dispatch()) {
duke@435 513 #ifdef ASSERT
duke@435 514 // make sure execution doesn't go beyond this point if code is broken
duke@435 515 __ should_not_reach_here();
duke@435 516 #endif // ASSERT
duke@435 517 } else {
duke@435 518 // dispatch to next bytecode
duke@435 519 __ dispatch_epilog(tos_out, step);
duke@435 520 }
duke@435 521 }
duke@435 522
duke@435 523 //------------------------------------------------------------------------------------------------------------------------
duke@435 524 // Entry points
duke@435 525
duke@435 526 address TemplateInterpreter::return_entry(TosState state, int length) {
duke@435 527 guarantee(0 <= length && length < Interpreter::number_of_return_entries, "illegal length");
duke@435 528 return _return_entry[length].entry(state);
duke@435 529 }
duke@435 530
duke@435 531
duke@435 532 address TemplateInterpreter::deopt_entry(TosState state, int length) {
duke@435 533 guarantee(0 <= length && length < Interpreter::number_of_deopt_entries, "illegal length");
duke@435 534 return _deopt_entry[length].entry(state);
duke@435 535 }
duke@435 536
duke@435 537 //------------------------------------------------------------------------------------------------------------------------
duke@435 538 // Suport for invokes
duke@435 539
duke@435 540 int TemplateInterpreter::TosState_as_index(TosState state) {
duke@435 541 assert( state < number_of_states , "Invalid state in TosState_as_index");
duke@435 542 assert(0 <= (int)state && (int)state < TemplateInterpreter::number_of_return_addrs, "index out of bounds");
duke@435 543 return (int)state;
duke@435 544 }
duke@435 545
duke@435 546
duke@435 547 //------------------------------------------------------------------------------------------------------------------------
duke@435 548 // Safepoint suppport
duke@435 549
duke@435 550 static inline void copy_table(address* from, address* to, int size) {
duke@435 551 // Copy non-overlapping tables. The copy has to occur word wise for MT safety.
duke@435 552 while (size-- > 0) *to++ = *from++;
duke@435 553 }
duke@435 554
duke@435 555 void TemplateInterpreter::notice_safepoints() {
duke@435 556 if (!_notice_safepoints) {
duke@435 557 // switch to safepoint dispatch table
duke@435 558 _notice_safepoints = true;
duke@435 559 copy_table((address*)&_safept_table, (address*)&_active_table, sizeof(_active_table) / sizeof(address));
duke@435 560 }
duke@435 561 }
duke@435 562
duke@435 563 // switch from the dispatch table which notices safepoints back to the
duke@435 564 // normal dispatch table. So that we can notice single stepping points,
duke@435 565 // keep the safepoint dispatch table if we are single stepping in JVMTI.
duke@435 566 // Note that the should_post_single_step test is exactly as fast as the
duke@435 567 // JvmtiExport::_enabled test and covers both cases.
duke@435 568 void TemplateInterpreter::ignore_safepoints() {
duke@435 569 if (_notice_safepoints) {
duke@435 570 if (!JvmtiExport::should_post_single_step()) {
duke@435 571 // switch to normal dispatch table
duke@435 572 _notice_safepoints = false;
duke@435 573 copy_table((address*)&_normal_table, (address*)&_active_table, sizeof(_active_table) / sizeof(address));
duke@435 574 }
duke@435 575 }
duke@435 576 }
duke@435 577
cfang@1335 578 //------------------------------------------------------------------------------------------------------------------------
cfang@1335 579 // Deoptimization support
duke@435 580
cfang@1335 581 // If deoptimization happens, this function returns the point of next bytecode to continue execution
cfang@1335 582 address TemplateInterpreter::deopt_continue_after_entry(methodOop method, address bcp, int callee_parameters, bool is_top_frame) {
cfang@1335 583 return AbstractInterpreter::deopt_continue_after_entry(method, bcp, callee_parameters, is_top_frame);
cfang@1335 584 }
duke@435 585
cfang@1335 586 // If deoptimization happens, this function returns the point where the interpreter reexecutes
cfang@1335 587 // the bytecode.
cfang@1335 588 // Note: Bytecodes::_athrow (C1 only) and Bytecodes::_return are the special cases
cfang@1335 589 // that do not return "Interpreter::deopt_entry(vtos, 0)"
cfang@1335 590 address TemplateInterpreter::deopt_reexecute_entry(methodOop method, address bcp) {
duke@435 591 assert(method->contains(bcp), "just checkin'");
duke@435 592 Bytecodes::Code code = Bytecodes::java_code_at(bcp);
duke@435 593 if (code == Bytecodes::_return) {
cfang@1335 594 // This is used for deopt during registration of finalizers
cfang@1335 595 // during Object.<init>. We simply need to resume execution at
cfang@1335 596 // the standard return vtos bytecode to pop the frame normally.
cfang@1335 597 // reexecuting the real bytecode would cause double registration
cfang@1335 598 // of the finalizable object.
cfang@1335 599 return _normal_table.entry(Bytecodes::_return).entry(vtos);
duke@435 600 } else {
cfang@1335 601 return AbstractInterpreter::deopt_reexecute_entry(method, bcp);
cfang@1335 602 }
cfang@1335 603 }
cfang@1335 604
cfang@1335 605 // If deoptimization happens, the interpreter should reexecute this bytecode.
cfang@1335 606 // This function mainly helps the compilers to set up the reexecute bit.
cfang@1335 607 bool TemplateInterpreter::bytecode_should_reexecute(Bytecodes::Code code) {
cfang@1335 608 if (code == Bytecodes::_return) {
cfang@1335 609 //Yes, we consider Bytecodes::_return as a special case of reexecution
cfang@1335 610 return true;
cfang@1335 611 } else {
cfang@1335 612 return AbstractInterpreter::bytecode_should_reexecute(code);
duke@435 613 }
duke@435 614 }
duke@435 615
duke@435 616 #endif // !CC_INTERP

Mercurial Repository: jdk8-mips64-public/hotspot

mercurial