1 /*
2 * Copyright (c) 1997, 2015, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "code/codeCacheExtensions.hpp"
27 #include "interpreter/interpreter.hpp"
28 #include "interpreter/interpreterRuntime.hpp"
29 #include "interpreter/interp_masm.hpp"
30 #include "interpreter/templateInterpreter.hpp"
31 #include "interpreter/templateInterpreterGenerator.hpp"
32 #include "interpreter/templateTable.hpp"
33
34 #ifndef CC_INTERP
35
36 # define __ _masm->
37
38 TemplateInterpreterGenerator::TemplateInterpreterGenerator(StubQueue* _code): AbstractInterpreterGenerator(_code) {
39 _unimplemented_bytecode = NULL;
40 _illegal_bytecode_sequence = NULL;
41 generate_all();
42 }
43
44 static const BasicType types[Interpreter::number_of_result_handlers] = {
45 T_BOOLEAN,
46 T_CHAR ,
47 T_BYTE ,
48 T_SHORT ,
49 T_INT ,
50 T_LONG ,
51 T_VOID ,
52 T_FLOAT ,
53 T_DOUBLE ,
54 T_OBJECT
55 };
56
57 void TemplateInterpreterGenerator::generate_all() {
58 // Loop, in case we need several variants of the interpreter entries
59 do {
60 if (!CodeCacheExtensions::skip_code_generation()) {
61 // bypass code generation when useless
62 { CodeletMark cm(_masm, "slow signature handler");
63 AbstractInterpreter::_slow_signature_handler = generate_slow_signature_handler();
64 }
65
66 { CodeletMark cm(_masm, "error exits");
67 _unimplemented_bytecode = generate_error_exit("unimplemented bytecode");
68 _illegal_bytecode_sequence = generate_error_exit("illegal bytecode sequence - method not verified");
69 }
70
71 #ifndef PRODUCT
72 if (TraceBytecodes) {
73 CodeletMark cm(_masm, "bytecode tracing support");
74 Interpreter::_trace_code =
75 EntryPoint(
76 generate_trace_code(btos),
77 generate_trace_code(ztos),
78 generate_trace_code(ctos),
79 generate_trace_code(stos),
80 generate_trace_code(atos),
81 generate_trace_code(itos),
82 generate_trace_code(ltos),
83 generate_trace_code(ftos),
84 generate_trace_code(dtos),
85 generate_trace_code(vtos)
86 );
87 }
88 #endif // !PRODUCT
89
90 { CodeletMark cm(_masm, "return entry points");
91 const int index_size = sizeof(u2);
92 for (int i = 0; i < Interpreter::number_of_return_entries; i++) {
93 Interpreter::_return_entry[i] =
94 EntryPoint(
95 generate_return_entry_for(itos, i, index_size),
96 generate_return_entry_for(itos, i, index_size),
97 generate_return_entry_for(itos, i, index_size),
98 generate_return_entry_for(itos, i, index_size),
99 generate_return_entry_for(atos, i, index_size),
100 generate_return_entry_for(itos, i, index_size),
101 generate_return_entry_for(ltos, i, index_size),
102 generate_return_entry_for(ftos, i, index_size),
103 generate_return_entry_for(dtos, i, index_size),
104 generate_return_entry_for(vtos, i, index_size)
105 );
106 }
107 }
108
109 { CodeletMark cm(_masm, "invoke return entry points");
110 // These states are in order specified in TosState, except btos/ztos/ctos/stos are
111 // really the same as itos since there is no top of stack optimization for these types
112 const TosState states[] = {itos, itos, itos, itos, itos, ltos, ftos, dtos, atos, vtos, ilgl};
113 const int invoke_length = Bytecodes::length_for(Bytecodes::_invokestatic);
114 const int invokeinterface_length = Bytecodes::length_for(Bytecodes::_invokeinterface);
115 const int invokedynamic_length = Bytecodes::length_for(Bytecodes::_invokedynamic);
116
117 for (int i = 0; i < Interpreter::number_of_return_addrs; i++) {
118 TosState state = states[i];
119 assert(state != ilgl, "states array is wrong above");
120 Interpreter::_invoke_return_entry[i] = generate_return_entry_for(state, invoke_length, sizeof(u2));
121 Interpreter::_invokeinterface_return_entry[i] = generate_return_entry_for(state, invokeinterface_length, sizeof(u2));
122 Interpreter::_invokedynamic_return_entry[i] = generate_return_entry_for(state, invokedynamic_length, sizeof(u4));
123 }
124 }
125
126 { CodeletMark cm(_masm, "earlyret entry points");
127 Interpreter::_earlyret_entry =
128 EntryPoint(
129 generate_earlyret_entry_for(btos),
130 generate_earlyret_entry_for(ztos),
131 generate_earlyret_entry_for(ctos),
132 generate_earlyret_entry_for(stos),
133 generate_earlyret_entry_for(atos),
134 generate_earlyret_entry_for(itos),
135 generate_earlyret_entry_for(ltos),
136 generate_earlyret_entry_for(ftos),
137 generate_earlyret_entry_for(dtos),
138 generate_earlyret_entry_for(vtos)
139 );
140 }
141
142 { CodeletMark cm(_masm, "deoptimization entry points");
143 for (int i = 0; i < Interpreter::number_of_deopt_entries; i++) {
144 Interpreter::_deopt_entry[i] =
145 EntryPoint(
146 generate_deopt_entry_for(itos, i),
147 generate_deopt_entry_for(itos, i),
148 generate_deopt_entry_for(itos, i),
149 generate_deopt_entry_for(itos, i),
150 generate_deopt_entry_for(atos, i),
151 generate_deopt_entry_for(itos, i),
152 generate_deopt_entry_for(ltos, i),
153 generate_deopt_entry_for(ftos, i),
154 generate_deopt_entry_for(dtos, i),
155 generate_deopt_entry_for(vtos, i)
156 );
157 }
158 }
159
160 { CodeletMark cm(_masm, "result handlers for native calls");
161 // The various result converter stublets.
162 int is_generated[Interpreter::number_of_result_handlers];
163 memset(is_generated, 0, sizeof(is_generated));
164
165 for (int i = 0; i < Interpreter::number_of_result_handlers; i++) {
166 BasicType type = types[i];
167 if (!is_generated[Interpreter::BasicType_as_index(type)]++) {
168 Interpreter::_native_abi_to_tosca[Interpreter::BasicType_as_index(type)] = generate_result_handler_for(type);
169 }
170 }
171 }
172
173 { CodeletMark cm(_masm, "continuation entry points");
174 Interpreter::_continuation_entry =
175 EntryPoint(
176 generate_continuation_for(btos),
177 generate_continuation_for(ztos),
178 generate_continuation_for(ctos),
179 generate_continuation_for(stos),
180 generate_continuation_for(atos),
181 generate_continuation_for(itos),
182 generate_continuation_for(ltos),
183 generate_continuation_for(ftos),
184 generate_continuation_for(dtos),
185 generate_continuation_for(vtos)
186 );
187 }
188
189 { CodeletMark cm(_masm, "safepoint entry points");
190 Interpreter::_safept_entry =
191 EntryPoint(
192 generate_safept_entry_for(btos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
193 generate_safept_entry_for(ztos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
194 generate_safept_entry_for(ctos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
195 generate_safept_entry_for(stos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
196 generate_safept_entry_for(atos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
197 generate_safept_entry_for(itos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
198 generate_safept_entry_for(ltos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
199 generate_safept_entry_for(ftos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
200 generate_safept_entry_for(dtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
201 generate_safept_entry_for(vtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint))
202 );
203 }
204
205 { CodeletMark cm(_masm, "exception handling");
206 // (Note: this is not safepoint safe because thread may return to compiled code)
207 generate_throw_exception();
208 }
209
210 { CodeletMark cm(_masm, "throw exception entrypoints");
211 Interpreter::_throw_ArrayIndexOutOfBoundsException_entry = generate_ArrayIndexOutOfBounds_handler("java/lang/ArrayIndexOutOfBoundsException");
212 Interpreter::_throw_ArrayStoreException_entry = generate_klass_exception_handler("java/lang/ArrayStoreException" );
213 Interpreter::_throw_ArithmeticException_entry = generate_exception_handler("java/lang/ArithmeticException" , "/ by zero");
214 Interpreter::_throw_ClassCastException_entry = generate_ClassCastException_handler();
215 Interpreter::_throw_NullPointerException_entry = generate_exception_handler("java/lang/NullPointerException" , NULL );
216 Interpreter::_throw_StackOverflowError_entry = generate_StackOverflowError_handler();
217 }
218
219
220
221 #define method_entry(kind) \
222 { CodeletMark cm(_masm, "method entry point (kind = " #kind ")"); \
223 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind); \
224 Interpreter::update_cds_entry_table(Interpreter::kind); \
225 }
226
227 // all non-native method kinds
228 method_entry(zerolocals)
229 method_entry(zerolocals_synchronized)
230 method_entry(empty)
231 method_entry(accessor)
232 method_entry(abstract)
233 method_entry(java_lang_math_sin )
234 method_entry(java_lang_math_cos )
235 method_entry(java_lang_math_tan )
236 method_entry(java_lang_math_abs )
237 method_entry(java_lang_math_sqrt )
238 method_entry(java_lang_math_log )
239 method_entry(java_lang_math_log10)
240 method_entry(java_lang_math_exp )
241 method_entry(java_lang_math_pow )
242 if (UseFMA) {
243 method_entry(java_lang_math_fmaF )
244 method_entry(java_lang_math_fmaD )
245 }
246 method_entry(java_lang_ref_reference_get)
247
248 AbstractInterpreter::initialize_method_handle_entries();
249
250 // all native method kinds (must be one contiguous block)
251 Interpreter::_native_entry_begin = Interpreter::code()->code_end();
252 method_entry(native)
253 method_entry(native_synchronized)
254 Interpreter::_native_entry_end = Interpreter::code()->code_end();
255
256 if (UseCRC32Intrinsics) {
257 method_entry(java_util_zip_CRC32_update)
258 method_entry(java_util_zip_CRC32_updateBytes)
259 method_entry(java_util_zip_CRC32_updateByteBuffer)
260 }
261
262 if (UseCRC32CIntrinsics) {
263 method_entry(java_util_zip_CRC32C_updateBytes)
264 method_entry(java_util_zip_CRC32C_updateDirectByteBuffer)
265 }
266
267 method_entry(java_lang_Float_intBitsToFloat);
268 method_entry(java_lang_Float_floatToRawIntBits);
269 method_entry(java_lang_Double_longBitsToDouble);
270 method_entry(java_lang_Double_doubleToRawLongBits);
271
272 #undef method_entry
273
274 // Bytecodes
275 set_entry_points_for_all_bytes();
276 }
277 } while (CodeCacheExtensions::needs_other_interpreter_variant());
278
279 // installation of code in other places in the runtime
280 // (ExcutableCodeManager calls not needed to copy the entries)
281 set_safepoints_for_all_bytes();
282 }
283
284 //------------------------------------------------------------------------------------------------------------------------
285
286 address TemplateInterpreterGenerator::generate_error_exit(const char* msg) {
287 address entry = __ pc();
288 __ stop(msg);
289 return entry;
290 }
291
292
293 //------------------------------------------------------------------------------------------------------------------------
294
295 void TemplateInterpreterGenerator::set_entry_points_for_all_bytes() {
296 for (int i = 0; i < DispatchTable::length; i++) {
297 Bytecodes::Code code = (Bytecodes::Code)i;
298 if (Bytecodes::is_defined(code)) {
299 set_entry_points(code);
300 } else {
301 set_unimplemented(i);
302 }
303 }
304 }
305
306
307 void TemplateInterpreterGenerator::set_safepoints_for_all_bytes() {
308 for (int i = 0; i < DispatchTable::length; i++) {
309 Bytecodes::Code code = (Bytecodes::Code)i;
310 if (Bytecodes::is_defined(code)) Interpreter::_safept_table.set_entry(code, Interpreter::_safept_entry);
311 }
312 }
313
314
315 void TemplateInterpreterGenerator::set_unimplemented(int i) {
316 address e = _unimplemented_bytecode;
317 EntryPoint entry(e, e, e, e, e, e, e, e, e, e);
318 Interpreter::_normal_table.set_entry(i, entry);
319 Interpreter::_wentry_point[i] = _unimplemented_bytecode;
320 }
321
322
323 void TemplateInterpreterGenerator::set_entry_points(Bytecodes::Code code) {
324 if (CodeCacheExtensions::skip_template_interpreter_entries(code)) {
325 return;
326 }
327 CodeletMark cm(_masm, Bytecodes::name(code), code);
328 // initialize entry points
329 assert(_unimplemented_bytecode != NULL, "should have been generated before");
330 assert(_illegal_bytecode_sequence != NULL, "should have been generated before");
331 address bep = _illegal_bytecode_sequence;
332 address zep = _illegal_bytecode_sequence;
333 address cep = _illegal_bytecode_sequence;
334 address sep = _illegal_bytecode_sequence;
335 address aep = _illegal_bytecode_sequence;
336 address iep = _illegal_bytecode_sequence;
337 address lep = _illegal_bytecode_sequence;
338 address fep = _illegal_bytecode_sequence;
339 address dep = _illegal_bytecode_sequence;
340 address vep = _unimplemented_bytecode;
341 address wep = _unimplemented_bytecode;
342 // code for short & wide version of bytecode
343 if (Bytecodes::is_defined(code)) {
344 Template* t = TemplateTable::template_for(code);
345 assert(t->is_valid(), "just checking");
346 set_short_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep);
347 }
348 if (Bytecodes::wide_is_defined(code)) {
349 Template* t = TemplateTable::template_for_wide(code);
350 assert(t->is_valid(), "just checking");
351 set_wide_entry_point(t, wep);
352 }
353 // set entry points
354 EntryPoint entry(bep, zep, cep, sep, aep, iep, lep, fep, dep, vep);
355 Interpreter::_normal_table.set_entry(code, entry);
356 Interpreter::_wentry_point[code] = wep;
357 CodeCacheExtensions::completed_template_interpreter_entries(_masm, code);
358 }
359
360
361 void TemplateInterpreterGenerator::set_wide_entry_point(Template* t, address& wep) {
362 assert(t->is_valid(), "template must exist");
363 assert(t->tos_in() == vtos, "only vtos tos_in supported for wide instructions");
364 wep = __ pc(); generate_and_dispatch(t);
365 }
366
367
368 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) {
369 assert(t->is_valid(), "template must exist");
370 switch (t->tos_in()) {
371 case btos:
372 case ztos:
373 case ctos:
374 case stos:
375 ShouldNotReachHere(); // btos/ctos/stos should use itos.
376 break;
377 case atos: vep = __ pc(); __ pop(atos); aep = __ pc(); generate_and_dispatch(t); break;
378 case itos: vep = __ pc(); __ pop(itos); iep = __ pc(); generate_and_dispatch(t); break;
379 case ltos: vep = __ pc(); __ pop(ltos); lep = __ pc(); generate_and_dispatch(t); break;
380 case ftos: vep = __ pc(); __ pop(ftos); fep = __ pc(); generate_and_dispatch(t); break;
381 case dtos: vep = __ pc(); __ pop(dtos); dep = __ pc(); generate_and_dispatch(t); break;
382 case vtos: set_vtos_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep); break;
383 default : ShouldNotReachHere(); break;
384 }
385 }
386
387
388 //------------------------------------------------------------------------------------------------------------------------
389
390 void TemplateInterpreterGenerator::generate_and_dispatch(Template* t, TosState tos_out) {
391 if (PrintBytecodeHistogram) histogram_bytecode(t);
392 #ifndef PRODUCT
393 // debugging code
394 if (CountBytecodes || TraceBytecodes || StopInterpreterAt > 0) count_bytecode();
395 if (PrintBytecodePairHistogram) histogram_bytecode_pair(t);
396 if (TraceBytecodes) trace_bytecode(t);
397 if (StopInterpreterAt > 0) stop_interpreter_at();
398 __ verify_FPU(1, t->tos_in());
399 #endif // !PRODUCT
400 int step = 0;
401 if (!t->does_dispatch()) {
402 step = t->is_wide() ? Bytecodes::wide_length_for(t->bytecode()) : Bytecodes::length_for(t->bytecode());
403 if (tos_out == ilgl) tos_out = t->tos_out();
404 // compute bytecode size
405 assert(step > 0, "just checkin'");
406 // setup stuff for dispatching next bytecode
407 if (ProfileInterpreter && VerifyDataPointer
408 && MethodData::bytecode_has_profile(t->bytecode())) {
409 __ verify_method_data_pointer();
410 }
411 __ dispatch_prolog(tos_out, step);
412 }
413 // generate template
414 t->generate(_masm);
415 // advance
416 if (t->does_dispatch()) {
417 #ifdef ASSERT
418 // make sure execution doesn't go beyond this point if code is broken
419 __ should_not_reach_here();
420 #endif // ASSERT
421 } else {
422 // dispatch to next bytecode
423 __ dispatch_epilog(tos_out, step);
424 }
425 }
426
427 // Generate method entries
428 address TemplateInterpreterGenerator::generate_method_entry(
429 AbstractInterpreter::MethodKind kind) {
430 // determine code generation flags
431 bool native = false;
432 bool synchronized = false;
433 address entry_point = NULL;
434
435 switch (kind) {
436 case Interpreter::zerolocals : break;
437 case Interpreter::zerolocals_synchronized: synchronized = true; break;
438 case Interpreter::native : native = true; break;
439 case Interpreter::native_synchronized : native = true; synchronized = true; break;
440 case Interpreter::empty : break;
441 case Interpreter::accessor : break;
442 case Interpreter::abstract : entry_point = generate_abstract_entry(); break;
443
444 case Interpreter::java_lang_math_sin : // fall thru
445 case Interpreter::java_lang_math_cos : // fall thru
446 case Interpreter::java_lang_math_tan : // fall thru
447 case Interpreter::java_lang_math_abs : // fall thru
448 case Interpreter::java_lang_math_log : // fall thru
449 case Interpreter::java_lang_math_log10 : // fall thru
450 case Interpreter::java_lang_math_sqrt : // fall thru
451 case Interpreter::java_lang_math_pow : // fall thru
452 case Interpreter::java_lang_math_exp : // fall thru
453 case Interpreter::java_lang_math_fmaD : // fall thru
454 case Interpreter::java_lang_math_fmaF : entry_point = generate_math_entry(kind); break;
455 case Interpreter::java_lang_ref_reference_get
456 : entry_point = generate_Reference_get_entry(); break;
457 case Interpreter::java_util_zip_CRC32_update
458 : native = true; entry_point = generate_CRC32_update_entry(); break;
459 case Interpreter::java_util_zip_CRC32_updateBytes
460 : // fall thru
461 case Interpreter::java_util_zip_CRC32_updateByteBuffer
462 : native = true; entry_point = generate_CRC32_updateBytes_entry(kind); break;
463 case Interpreter::java_util_zip_CRC32C_updateBytes
464 : // fall thru
465 case Interpreter::java_util_zip_CRC32C_updateDirectByteBuffer
466 : entry_point = generate_CRC32C_updateBytes_entry(kind); break;
467 #ifdef IA32
468 // On x86_32 platforms, a special entry is generated for the following four methods.
469 // On other platforms the normal entry is used to enter these methods.
470 case Interpreter::java_lang_Float_intBitsToFloat
471 : native = true; entry_point = generate_Float_intBitsToFloat_entry(); break;
472 case Interpreter::java_lang_Float_floatToRawIntBits
473 : native = true; entry_point = generate_Float_floatToRawIntBits_entry(); break;
474 case Interpreter::java_lang_Double_longBitsToDouble
475 : native = true; entry_point = generate_Double_longBitsToDouble_entry(); break;
476 case Interpreter::java_lang_Double_doubleToRawLongBits
477 : native = true; entry_point = generate_Double_doubleToRawLongBits_entry(); break;
478 #else
479 case Interpreter::java_lang_Float_intBitsToFloat:
480 case Interpreter::java_lang_Float_floatToRawIntBits:
481 case Interpreter::java_lang_Double_longBitsToDouble:
482 case Interpreter::java_lang_Double_doubleToRawLongBits:
483 native = true;
484 break;
485 #endif // defined(TARGET_ARCH_x86) && !defined(_LP64)
486 default:
487 fatal("unexpected method kind: %d", kind);
488 break;
489 }
490
491 if (entry_point) {
492 return entry_point;
493 }
494
495 // We expect the normal and native entry points to be generated first so we can reuse them.
496 if (native) {
497 entry_point = Interpreter::entry_for_kind(synchronized ? Interpreter::native_synchronized : Interpreter::native);
498 if (entry_point == NULL) {
499 entry_point = generate_native_entry(synchronized);
500 }
501 } else {
502 entry_point = Interpreter::entry_for_kind(synchronized ? Interpreter::zerolocals_synchronized : Interpreter::zerolocals);
503 if (entry_point == NULL) {
504 entry_point = generate_normal_entry(synchronized);
505 }
506 }
507
508 return entry_point;
509 }
510 #endif // !CC_INTERP