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