1 /*
2 * Copyright (c) 1997, 2017, 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 "interpreter/interpreter.hpp"
27 #include "interpreter/interpreterRuntime.hpp"
28 #include "interpreter/interp_masm.hpp"
29 #include "interpreter/templateInterpreter.hpp"
30 #include "interpreter/templateInterpreterGenerator.hpp"
31 #include "interpreter/templateTable.hpp"
32
33 #ifndef CC_INTERP
34
35 # define __ _masm->
36
37 TemplateInterpreterGenerator::TemplateInterpreterGenerator(StubQueue* _code): AbstractInterpreterGenerator(_code) {
38 _unimplemented_bytecode = NULL;
39 _illegal_bytecode_sequence = NULL;
40 generate_all();
41 }
42
43 static const BasicType types[Interpreter::number_of_result_handlers] = {
44 T_BOOLEAN,
45 T_CHAR ,
46 T_BYTE ,
47 T_SHORT ,
48 T_INT ,
49 T_LONG ,
50 T_VOID ,
51 T_FLOAT ,
52 T_DOUBLE ,
53 T_OBJECT ,
54 T_VALUETYPE
55 };
56
57 void TemplateInterpreterGenerator::generate_all() {
58 { CodeletMark cm(_masm, "slow signature handler");
59 AbstractInterpreter::_slow_signature_handler = generate_slow_signature_handler();
60 }
61
62 { CodeletMark cm(_masm, "error exits");
63 _unimplemented_bytecode = generate_error_exit("unimplemented bytecode");
64 _illegal_bytecode_sequence = generate_error_exit("illegal bytecode sequence - method not verified");
65 }
66
67 #ifndef PRODUCT
68 if (TraceBytecodes) {
69 CodeletMark cm(_masm, "bytecode tracing support");
70 Interpreter::_trace_code =
71 EntryPoint(
72 generate_trace_code(btos),
73 generate_trace_code(ztos),
74 generate_trace_code(ctos),
75 generate_trace_code(stos),
76 generate_trace_code(atos),
77 generate_trace_code(itos),
78 generate_trace_code(ltos),
79 generate_trace_code(ftos),
80 generate_trace_code(dtos),
81 generate_trace_code(qtos),
82 generate_trace_code(vtos)
83 );
84 }
85 #endif // !PRODUCT
86
87 { CodeletMark cm(_masm, "return entry points");
88 const int index_size = sizeof(u2);
89 Interpreter::_return_entry[0] = EntryPoint();
90 for (int i = 1; i < Interpreter::number_of_return_entries; i++) {
91 address return_itos = generate_return_entry_for(itos, i, index_size);
92 Interpreter::_return_entry[i] =
93 EntryPoint(
94 return_itos,
95 return_itos,
96 return_itos,
97 return_itos,
98 generate_return_entry_for(atos, i, index_size),
99 return_itos,
100 generate_return_entry_for(ltos, i, index_size),
101 generate_return_entry_for(ftos, i, index_size),
102 generate_return_entry_for(dtos, i, index_size),
103 generate_return_entry_for(qtos, 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, qtos, 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(qtos),
139 generate_earlyret_entry_for(vtos)
140 );
141 }
142
143 { CodeletMark cm(_masm, "result handlers for native calls");
144 // The various result converter stublets.
145 int is_generated[Interpreter::number_of_result_handlers];
146 memset(is_generated, 0, sizeof(is_generated));
147
148 for (int i = 0; i < Interpreter::number_of_result_handlers; i++) {
149 BasicType type = types[i];
150 if (!is_generated[Interpreter::BasicType_as_index(type)]++) {
151 Interpreter::_native_abi_to_tosca[Interpreter::BasicType_as_index(type)] = generate_result_handler_for(type);
152 }
153 }
154 }
155
156
157 { CodeletMark cm(_masm, "safepoint entry points");
158 Interpreter::_safept_entry =
159 EntryPoint(
160 generate_safept_entry_for(btos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
161 generate_safept_entry_for(ztos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
162 generate_safept_entry_for(ctos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
163 generate_safept_entry_for(stos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
164 generate_safept_entry_for(atos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
165 generate_safept_entry_for(itos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
166 generate_safept_entry_for(ltos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
167 generate_safept_entry_for(ftos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
168 generate_safept_entry_for(dtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
169 generate_safept_entry_for(qtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
170 generate_safept_entry_for(vtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint))
171 );
172 }
173
174 { CodeletMark cm(_masm, "exception handling");
175 // (Note: this is not safepoint safe because thread may return to compiled code)
176 generate_throw_exception();
177 }
178
179 { CodeletMark cm(_masm, "throw exception entrypoints");
180 Interpreter::_throw_ArrayIndexOutOfBoundsException_entry = generate_ArrayIndexOutOfBounds_handler("java/lang/ArrayIndexOutOfBoundsException");
181 Interpreter::_throw_ArrayStoreException_entry = generate_klass_exception_handler("java/lang/ArrayStoreException" );
182 Interpreter::_throw_ArithmeticException_entry = generate_exception_handler("java/lang/ArithmeticException" , "/ by zero");
183 Interpreter::_throw_ClassCastException_entry = generate_ClassCastException_handler();
184 Interpreter::_throw_NullPointerException_entry = generate_exception_handler("java/lang/NullPointerException" , NULL );
185 Interpreter::_throw_StackOverflowError_entry = generate_StackOverflowError_handler();
186 }
187
188
189
190 #define method_entry(kind) \
191 { CodeletMark cm(_masm, "method entry point (kind = " #kind ")"); \
192 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind); \
193 Interpreter::update_cds_entry_table(Interpreter::kind); \
194 }
195
196 // all non-native method kinds
197 method_entry(zerolocals)
198 method_entry(zerolocals_synchronized)
199 method_entry(empty)
200 method_entry(accessor)
201 method_entry(abstract)
202 method_entry(java_lang_math_sin )
203 method_entry(java_lang_math_cos )
204 method_entry(java_lang_math_tan )
205 method_entry(java_lang_math_abs )
206 method_entry(java_lang_math_sqrt )
207 method_entry(java_lang_math_log )
208 method_entry(java_lang_math_log10)
209 method_entry(java_lang_math_exp )
210 method_entry(java_lang_math_pow )
211 method_entry(java_lang_math_fmaF )
212 method_entry(java_lang_math_fmaD )
213 method_entry(java_lang_ref_reference_get)
214
215 AbstractInterpreter::initialize_method_handle_entries();
216
217 // all native method kinds (must be one contiguous block)
218 Interpreter::_native_entry_begin = Interpreter::code()->code_end();
219 method_entry(native)
220 method_entry(native_synchronized)
221 Interpreter::_native_entry_end = Interpreter::code()->code_end();
222
223 method_entry(java_util_zip_CRC32_update)
224 method_entry(java_util_zip_CRC32_updateBytes)
225 method_entry(java_util_zip_CRC32_updateByteBuffer)
226 method_entry(java_util_zip_CRC32C_updateBytes)
227 method_entry(java_util_zip_CRC32C_updateDirectByteBuffer)
228
229 method_entry(java_lang_Float_intBitsToFloat);
230 method_entry(java_lang_Float_floatToRawIntBits);
231 method_entry(java_lang_Double_longBitsToDouble);
232 method_entry(java_lang_Double_doubleToRawLongBits);
233
234 #undef method_entry
235
236 // Bytecodes
237 set_entry_points_for_all_bytes();
238
239 // installation of code in other places in the runtime
240 // (ExcutableCodeManager calls not needed to copy the entries)
241 set_safepoints_for_all_bytes();
242
243 { CodeletMark cm(_masm, "deoptimization entry points");
244 Interpreter::_deopt_entry[0] = EntryPoint();
245 Interpreter::_deopt_entry[0].set_entry(vtos, generate_deopt_entry_for(vtos, 0));
246 for (int i = 1; i < Interpreter::number_of_deopt_entries; i++) {
247 address deopt_itos = generate_deopt_entry_for(itos, i);
248 Interpreter::_deopt_entry[i] =
249 EntryPoint(
250 deopt_itos, /* btos */
251 deopt_itos, /* ztos */
252 deopt_itos, /* ctos */
253 deopt_itos, /* stos */
254 generate_deopt_entry_for(atos, i),
255 deopt_itos, /* itos */
256 generate_deopt_entry_for(ltos, i),
257 generate_deopt_entry_for(ftos, i),
258 generate_deopt_entry_for(dtos, i),
259 generate_deopt_entry_for(qtos, i),
260 generate_deopt_entry_for(vtos, i)
261 );
262 }
263 address return_continuation = Interpreter::_normal_table.entry(Bytecodes::_return).entry(vtos);
264 vmassert(return_continuation != NULL, "return entry not generated yet");
265 Interpreter::_deopt_reexecute_return_entry = generate_deopt_entry_for(vtos, 0, return_continuation);
266 }
267
268 }
269
270 //------------------------------------------------------------------------------------------------------------------------
271
272 address TemplateInterpreterGenerator::generate_error_exit(const char* msg) {
273 address entry = __ pc();
274 __ stop(msg);
275 return entry;
276 }
277
278
279 //------------------------------------------------------------------------------------------------------------------------
280
281 void TemplateInterpreterGenerator::set_entry_points_for_all_bytes() {
282 for (int i = 0; i < DispatchTable::length; i++) {
283 Bytecodes::Code code = (Bytecodes::Code)i;
284 if (Bytecodes::is_defined(code)) {
285 set_entry_points(code);
286 } else {
287 set_unimplemented(i);
288 }
289 }
290 }
291
292
293 void TemplateInterpreterGenerator::set_safepoints_for_all_bytes() {
294 for (int i = 0; i < DispatchTable::length; i++) {
295 Bytecodes::Code code = (Bytecodes::Code)i;
296 if (Bytecodes::is_defined(code)) Interpreter::_safept_table.set_entry(code, Interpreter::_safept_entry);
297 }
298 }
299
300
301 void TemplateInterpreterGenerator::set_unimplemented(int i) {
302 address e = _unimplemented_bytecode;
303 EntryPoint entry(e, e, e, e, e, e, e, e, e, e, e);
304 Interpreter::_normal_table.set_entry(i, entry);
305 Interpreter::_wentry_point[i] = _unimplemented_bytecode;
306 }
307
308
309 void TemplateInterpreterGenerator::set_entry_points(Bytecodes::Code code) {
310 CodeletMark cm(_masm, Bytecodes::name(code), code);
311 // initialize entry points
312 assert(_unimplemented_bytecode != NULL, "should have been generated before");
313 assert(_illegal_bytecode_sequence != NULL, "should have been generated before");
314 address bep = _illegal_bytecode_sequence;
315 address zep = _illegal_bytecode_sequence;
316 address cep = _illegal_bytecode_sequence;
317 address sep = _illegal_bytecode_sequence;
318 address aep = _illegal_bytecode_sequence;
319 address iep = _illegal_bytecode_sequence;
320 address lep = _illegal_bytecode_sequence;
321 address fep = _illegal_bytecode_sequence;
322 address dep = _illegal_bytecode_sequence;
323 address qep = _illegal_bytecode_sequence;
324 address vep = _unimplemented_bytecode;
325 address wep = _unimplemented_bytecode;
326 // code for short & wide version of bytecode
327 if (Bytecodes::is_defined(code)) {
328 Template* t = TemplateTable::template_for(code);
329 assert(t->is_valid(), "just checking");
330 set_short_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, qep, vep);
331 }
332 if (Bytecodes::wide_is_defined(code)) {
333 Template* t = TemplateTable::template_for_wide(code);
334 assert(t->is_valid(), "just checking");
335 set_wide_entry_point(t, wep);
336 }
337 // set entry points
338 EntryPoint entry(bep, zep, cep, sep, aep, iep, lep, fep, dep, qep, vep);
339 Interpreter::_normal_table.set_entry(code, entry);
340 Interpreter::_wentry_point[code] = wep;
341 }
342
343
344 void TemplateInterpreterGenerator::set_wide_entry_point(Template* t, address& wep) {
345 assert(t->is_valid(), "template must exist");
346 assert(t->tos_in() == vtos, "only vtos tos_in supported for wide instructions");
347 wep = __ pc(); generate_and_dispatch(t);
348 }
349
350
351 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& qep, address& vep) {
352 assert(t->is_valid(), "template must exist");
353 switch (t->tos_in()) {
354 case btos:
355 case ztos:
356 case ctos:
357 case stos:
358 ShouldNotReachHere(); // btos/ctos/stos should use itos.
359 break;
360 case atos: vep = __ pc(); __ pop(atos); aep = __ pc(); generate_and_dispatch(t); break;
361 case itos: vep = __ pc(); __ pop(itos); iep = __ pc(); generate_and_dispatch(t); break;
362 case ltos: vep = __ pc(); __ pop(ltos); lep = __ pc(); generate_and_dispatch(t); break;
363 case ftos: vep = __ pc(); __ pop(ftos); fep = __ pc(); generate_and_dispatch(t); break;
364 case dtos: vep = __ pc(); __ pop(dtos); dep = __ pc(); generate_and_dispatch(t); break;
365 case qtos: vep = __ pc(); __ pop(qtos); qep = __ pc(); generate_and_dispatch(t); break;
366 case vtos: set_vtos_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, qep, vep); break;
367 case ptos: vep = __ pc(); __ pop(ptos); aep = __ pc(); qep = __ pc(); generate_and_dispatch(t); break;
368 default : ShouldNotReachHere(); break;
369 }
370 }
371
372
373 //------------------------------------------------------------------------------------------------------------------------
374
375 void TemplateInterpreterGenerator::generate_and_dispatch(Template* t, TosState tos_out) {
376 if (PrintBytecodeHistogram) histogram_bytecode(t);
377 #ifndef PRODUCT
378 // debugging code
379 if (CountBytecodes || TraceBytecodes || StopInterpreterAt > 0) count_bytecode();
380 if (PrintBytecodePairHistogram) histogram_bytecode_pair(t);
381 if (TraceBytecodes) trace_bytecode(t);
382 if (StopInterpreterAt > 0) stop_interpreter_at();
383 __ verify_FPU(1, t->tos_in());
384 #endif // !PRODUCT
385 int step = 0;
386 if (!t->does_dispatch()) {
387 step = t->is_wide() ? Bytecodes::wide_length_for(t->bytecode()) : Bytecodes::length_for(t->bytecode());
388 if (tos_out == ilgl) tos_out = t->tos_out();
389 // compute bytecode size
390 assert(step > 0, "just checkin'");
391 // setup stuff for dispatching next bytecode
392 if (ProfileInterpreter && VerifyDataPointer
393 && MethodData::bytecode_has_profile(t->bytecode())) {
394 __ verify_method_data_pointer();
395 }
396 __ dispatch_prolog(tos_out, step);
397 }
398 // generate template
399 t->generate(_masm);
400 // advance
401 if (t->does_dispatch()) {
402 #ifdef ASSERT
403 // make sure execution doesn't go beyond this point if code is broken
404 __ should_not_reach_here();
405 #endif // ASSERT
406 } else {
407 // dispatch to next bytecode
408 __ dispatch_epilog(tos_out, step);
409 }
410 }
411
412 // Generate method entries
413 address TemplateInterpreterGenerator::generate_method_entry(
414 AbstractInterpreter::MethodKind kind) {
415 // determine code generation flags
416 bool native = false;
417 bool synchronized = false;
418 address entry_point = NULL;
419
420 switch (kind) {
421 case Interpreter::zerolocals : break;
422 case Interpreter::zerolocals_synchronized: synchronized = true; break;
423 case Interpreter::native : native = true; break;
424 case Interpreter::native_synchronized : native = true; synchronized = true; break;
425 case Interpreter::empty : break;
426 case Interpreter::accessor : break;
427 case Interpreter::abstract : entry_point = generate_abstract_entry(); break;
428
429 case Interpreter::java_lang_math_sin : // fall thru
430 case Interpreter::java_lang_math_cos : // fall thru
431 case Interpreter::java_lang_math_tan : // fall thru
432 case Interpreter::java_lang_math_abs : // fall thru
433 case Interpreter::java_lang_math_log : // fall thru
434 case Interpreter::java_lang_math_log10 : // fall thru
435 case Interpreter::java_lang_math_sqrt : // fall thru
436 case Interpreter::java_lang_math_pow : // fall thru
437 case Interpreter::java_lang_math_exp : // fall thru
438 case Interpreter::java_lang_math_fmaD : // fall thru
439 case Interpreter::java_lang_math_fmaF : entry_point = generate_math_entry(kind); break;
440 case Interpreter::java_lang_ref_reference_get
441 : entry_point = generate_Reference_get_entry(); break;
442 case Interpreter::java_util_zip_CRC32_update
443 : native = true; entry_point = generate_CRC32_update_entry(); break;
444 case Interpreter::java_util_zip_CRC32_updateBytes
445 : // fall thru
446 case Interpreter::java_util_zip_CRC32_updateByteBuffer
447 : native = true; entry_point = generate_CRC32_updateBytes_entry(kind); break;
448 case Interpreter::java_util_zip_CRC32C_updateBytes
449 : // fall thru
450 case Interpreter::java_util_zip_CRC32C_updateDirectByteBuffer
451 : entry_point = generate_CRC32C_updateBytes_entry(kind); break;
452 #ifdef IA32
453 // On x86_32 platforms, a special entry is generated for the following four methods.
454 // On other platforms the normal entry is used to enter these methods.
455 case Interpreter::java_lang_Float_intBitsToFloat
456 : native = true; entry_point = generate_Float_intBitsToFloat_entry(); break;
457 case Interpreter::java_lang_Float_floatToRawIntBits
458 : native = true; entry_point = generate_Float_floatToRawIntBits_entry(); break;
459 case Interpreter::java_lang_Double_longBitsToDouble
460 : native = true; entry_point = generate_Double_longBitsToDouble_entry(); break;
461 case Interpreter::java_lang_Double_doubleToRawLongBits
462 : native = true; entry_point = generate_Double_doubleToRawLongBits_entry(); break;
463 #else
464 case Interpreter::java_lang_Float_intBitsToFloat:
465 case Interpreter::java_lang_Float_floatToRawIntBits:
466 case Interpreter::java_lang_Double_longBitsToDouble:
467 case Interpreter::java_lang_Double_doubleToRawLongBits:
468 native = true;
469 break;
470 #endif // !IA32
471 default:
472 fatal("unexpected method kind: %d", kind);
473 break;
474 }
475
476 if (entry_point) {
477 return entry_point;
478 }
479
480 // We expect the normal and native entry points to be generated first so we can reuse them.
481 if (native) {
482 entry_point = Interpreter::entry_for_kind(synchronized ? Interpreter::native_synchronized : Interpreter::native);
483 if (entry_point == NULL) {
484 entry_point = generate_native_entry(synchronized);
485 }
486 } else {
487 entry_point = Interpreter::entry_for_kind(synchronized ? Interpreter::zerolocals_synchronized : Interpreter::zerolocals);
488 if (entry_point == NULL) {
489 entry_point = generate_normal_entry(synchronized);
490 }
491 }
492
493 return entry_point;
494 }
495 #endif // !CC_INTERP