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