1 /*
2 * Copyright (c) 1997, 2016, 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 };
55
56 void TemplateInterpreterGenerator::generate_all() {
57 { CodeletMark cm(_masm, "slow signature handler");
58 AbstractInterpreter::_slow_signature_handler = generate_slow_signature_handler();
59 }
60
61 { CodeletMark cm(_masm, "error exits");
62 _unimplemented_bytecode = generate_error_exit("unimplemented bytecode");
63 _illegal_bytecode_sequence = generate_error_exit("illegal bytecode sequence - method not verified");
64 }
65
66 #ifndef PRODUCT
67 if (TraceBytecodes) {
68 CodeletMark cm(_masm, "bytecode tracing support");
69 Interpreter::_trace_code =
70 EntryPoint(
71 generate_trace_code(btos),
72 generate_trace_code(ztos),
73 generate_trace_code(ctos),
74 generate_trace_code(stos),
75 generate_trace_code(atos),
76 generate_trace_code(itos),
77 generate_trace_code(ltos),
78 generate_trace_code(ftos),
79 generate_trace_code(dtos),
80 generate_trace_code(vtos)
81 );
82 }
83 #endif // !PRODUCT
84
85 { CodeletMark cm(_masm, "return entry points");
86 const int index_size = sizeof(u2);
87 for (int i = 0; i < Interpreter::number_of_return_entries; i++) {
88 Interpreter::_return_entry[i] =
89 EntryPoint(
90 generate_return_entry_for(itos, i, index_size),
91 generate_return_entry_for(itos, i, index_size),
92 generate_return_entry_for(itos, i, index_size),
93 generate_return_entry_for(itos, i, index_size),
94 generate_return_entry_for(atos, i, index_size),
95 generate_return_entry_for(itos, i, index_size),
96 generate_return_entry_for(ltos, i, index_size),
97 generate_return_entry_for(ftos, i, index_size),
98 generate_return_entry_for(dtos, i, index_size),
99 generate_return_entry_for(vtos, i, index_size)
100 );
101 }
102 }
103
104 { CodeletMark cm(_masm, "invoke return entry points");
105 // These states are in order specified in TosState, except btos/ztos/ctos/stos are
106 // really the same as itos since there is no top of stack optimization for these types
107 const TosState states[] = {itos, itos, itos, itos, itos, ltos, ftos, dtos, atos, vtos, ilgl};
108 const int invoke_length = Bytecodes::length_for(Bytecodes::_invokestatic);
109 const int invokeinterface_length = Bytecodes::length_for(Bytecodes::_invokeinterface);
110 const int invokedynamic_length = Bytecodes::length_for(Bytecodes::_invokedynamic);
111
112 for (int i = 0; i < Interpreter::number_of_return_addrs; i++) {
113 TosState state = states[i];
114 assert(state != ilgl, "states array is wrong above");
115 Interpreter::_invoke_return_entry[i] = generate_return_entry_for(state, invoke_length, sizeof(u2));
116 Interpreter::_invokeinterface_return_entry[i] = generate_return_entry_for(state, invokeinterface_length, sizeof(u2));
117 Interpreter::_invokedynamic_return_entry[i] = generate_return_entry_for(state, invokedynamic_length, sizeof(u4));
118 }
119 }
120
121 { CodeletMark cm(_masm, "earlyret entry points");
122 Interpreter::_earlyret_entry =
123 EntryPoint(
124 generate_earlyret_entry_for(btos),
125 generate_earlyret_entry_for(ztos),
126 generate_earlyret_entry_for(ctos),
127 generate_earlyret_entry_for(stos),
128 generate_earlyret_entry_for(atos),
129 generate_earlyret_entry_for(itos),
130 generate_earlyret_entry_for(ltos),
131 generate_earlyret_entry_for(ftos),
132 generate_earlyret_entry_for(dtos),
133 generate_earlyret_entry_for(vtos)
134 );
135 }
136
137 { CodeletMark cm(_masm, "deoptimization entry points");
138 for (int i = 0; i < Interpreter::number_of_deopt_entries; i++) {
139 Interpreter::_deopt_entry[i] =
140 EntryPoint(
141 generate_deopt_entry_for(itos, i),
142 generate_deopt_entry_for(itos, i),
143 generate_deopt_entry_for(itos, i),
144 generate_deopt_entry_for(itos, i),
145 generate_deopt_entry_for(atos, i),
146 generate_deopt_entry_for(itos, i),
147 generate_deopt_entry_for(ltos, i),
148 generate_deopt_entry_for(ftos, i),
149 generate_deopt_entry_for(dtos, i),
150 generate_deopt_entry_for(vtos, i)
151 );
152 }
153 }
154
155 { CodeletMark cm(_masm, "result handlers for native calls");
156 // The various result converter stublets.
157 int is_generated[Interpreter::number_of_result_handlers];
158 memset(is_generated, 0, sizeof(is_generated));
159
160 for (int i = 0; i < Interpreter::number_of_result_handlers; i++) {
161 BasicType type = types[i];
162 if (!is_generated[Interpreter::BasicType_as_index(type)]++) {
163 Interpreter::_native_abi_to_tosca[Interpreter::BasicType_as_index(type)] = generate_result_handler_for(type);
164 }
165 }
166 }
167
168 { CodeletMark cm(_masm, "continuation entry points");
169 Interpreter::_continuation_entry =
170 EntryPoint(
171 generate_continuation_for(btos),
172 generate_continuation_for(ztos),
173 generate_continuation_for(ctos),
174 generate_continuation_for(stos),
175 generate_continuation_for(atos),
176 generate_continuation_for(itos),
177 generate_continuation_for(ltos),
178 generate_continuation_for(ftos),
179 generate_continuation_for(dtos),
180 generate_continuation_for(vtos)
181 );
182 }
183
184 { CodeletMark cm(_masm, "safepoint entry points");
185 Interpreter::_safept_entry =
186 EntryPoint(
187 generate_safept_entry_for(btos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
188 generate_safept_entry_for(ztos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
189 generate_safept_entry_for(ctos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
190 generate_safept_entry_for(stos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
191 generate_safept_entry_for(atos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
192 generate_safept_entry_for(itos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
193 generate_safept_entry_for(ltos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
194 generate_safept_entry_for(ftos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
195 generate_safept_entry_for(dtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
196 generate_safept_entry_for(vtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint))
197 );
198 }
199
200 { CodeletMark cm(_masm, "exception handling");
201 // (Note: this is not safepoint safe because thread may return to compiled code)
202 generate_throw_exception();
203 }
204
205 { CodeletMark cm(_masm, "throw exception entrypoints");
206 Interpreter::_throw_ArrayIndexOutOfBoundsException_entry = generate_ArrayIndexOutOfBounds_handler("java/lang/ArrayIndexOutOfBoundsException");
207 Interpreter::_throw_ArrayStoreException_entry = generate_klass_exception_handler("java/lang/ArrayStoreException" );
208 Interpreter::_throw_ArithmeticException_entry = generate_exception_handler("java/lang/ArithmeticException" , "/ by zero");
209 Interpreter::_throw_ClassCastException_entry = generate_ClassCastException_handler();
210 Interpreter::_throw_NullPointerException_entry = generate_exception_handler("java/lang/NullPointerException" , NULL );
211 Interpreter::_throw_StackOverflowError_entry = generate_StackOverflowError_handler();
212 }
213
214
215
216 #define method_entry(kind) \
217 { CodeletMark cm(_masm, "method entry point (kind = " #kind ")"); \
218 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind); \
219 Interpreter::update_cds_entry_table(Interpreter::kind); \
220 }
221
222 // all non-native method kinds
223 method_entry(zerolocals)
224 method_entry(zerolocals_synchronized)
225 method_entry(empty)
226 method_entry(accessor)
227 method_entry(abstract)
228 method_entry(java_lang_math_sin )
229 method_entry(java_lang_math_cos )
230 method_entry(java_lang_math_tan )
231 method_entry(java_lang_math_abs )
232 method_entry(java_lang_math_sqrt )
233 method_entry(java_lang_math_log )
234 method_entry(java_lang_math_log10)
235 method_entry(java_lang_math_exp )
236 method_entry(java_lang_math_pow )
237 method_entry(java_lang_math_fmaF )
238 method_entry(java_lang_math_fmaD )
239 method_entry(java_lang_ref_reference_get)
240
241 AbstractInterpreter::initialize_method_handle_entries();
242
243 // all native method kinds (must be one contiguous block)
244 Interpreter::_native_entry_begin = Interpreter::code()->code_end();
245 method_entry(native)
246 method_entry(native_synchronized)
247 Interpreter::_native_entry_end = Interpreter::code()->code_end();
248
249 method_entry(java_util_zip_CRC32_update)
250 method_entry(java_util_zip_CRC32_updateBytes)
251 method_entry(java_util_zip_CRC32_updateByteBuffer)
252 method_entry(java_util_zip_CRC32C_updateBytes)
253 method_entry(java_util_zip_CRC32C_updateDirectByteBuffer)
254
255 method_entry(java_lang_Float_intBitsToFloat);
256 method_entry(java_lang_Float_floatToRawIntBits);
257 method_entry(java_lang_Double_longBitsToDouble);
258 method_entry(java_lang_Double_doubleToRawLongBits);
259
260 #undef method_entry
261
262 // Bytecodes
263 set_entry_points_for_all_bytes();
264
265 // installation of code in other places in the runtime
266 // (ExcutableCodeManager calls not needed to copy the entries)
267 set_safepoints_for_all_bytes();
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);
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 vep = _unimplemented_bytecode;
324 address wep = _unimplemented_bytecode;
325 // code for short & wide version of bytecode
326 if (Bytecodes::is_defined(code)) {
327 Template* t = TemplateTable::template_for(code);
328 assert(t->is_valid(), "just checking");
329 set_short_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep);
330 }
331 if (Bytecodes::wide_is_defined(code)) {
332 Template* t = TemplateTable::template_for_wide(code);
333 assert(t->is_valid(), "just checking");
334 set_wide_entry_point(t, wep);
335 }
336 // set entry points
337 EntryPoint entry(bep, zep, cep, sep, aep, iep, lep, fep, dep, vep);
338 Interpreter::_normal_table.set_entry(code, entry);
339 Interpreter::_wentry_point[code] = wep;
340 }
341
342
343 void TemplateInterpreterGenerator::set_wide_entry_point(Template* t, address& wep) {
344 assert(t->is_valid(), "template must exist");
345 assert(t->tos_in() == vtos, "only vtos tos_in supported for wide instructions");
346 wep = __ pc(); generate_and_dispatch(t);
347 }
348
349
350 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) {
351 assert(t->is_valid(), "template must exist");
352 switch (t->tos_in()) {
353 case btos:
354 case ztos:
355 case ctos:
356 case stos:
357 ShouldNotReachHere(); // btos/ctos/stos should use itos.
358 break;
359 case atos: vep = __ pc(); __ pop(atos); aep = __ pc(); generate_and_dispatch(t); break;
360 case itos: vep = __ pc(); __ pop(itos); iep = __ pc(); generate_and_dispatch(t); break;
361 case ltos: vep = __ pc(); __ pop(ltos); lep = __ pc(); generate_and_dispatch(t); break;
362 case ftos: vep = __ pc(); __ pop(ftos); fep = __ pc(); generate_and_dispatch(t); break;
363 case dtos: vep = __ pc(); __ pop(dtos); dep = __ pc(); generate_and_dispatch(t); break;
364 case vtos: set_vtos_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep); break;
365 default : ShouldNotReachHere(); break;
366 }
367 }
368
369
370 //------------------------------------------------------------------------------------------------------------------------
371
372 void TemplateInterpreterGenerator::generate_and_dispatch(Template* t, TosState tos_out) {
373 if (PrintBytecodeHistogram) histogram_bytecode(t);
374 #ifndef PRODUCT
375 // debugging code
376 if (CountBytecodes || TraceBytecodes || StopInterpreterAt > 0) count_bytecode();
377 if (PrintBytecodePairHistogram) histogram_bytecode_pair(t);
378 if (TraceBytecodes) trace_bytecode(t);
379 if (StopInterpreterAt > 0) stop_interpreter_at();
380 __ verify_FPU(1, t->tos_in());
381 #endif // !PRODUCT
382 int step = 0;
383 if (!t->does_dispatch()) {
384 step = t->is_wide() ? Bytecodes::wide_length_for(t->bytecode()) : Bytecodes::length_for(t->bytecode());
385 if (tos_out == ilgl) tos_out = t->tos_out();
386 // compute bytecode size
387 assert(step > 0, "just checkin'");
388 // setup stuff for dispatching next bytecode
389 if (ProfileInterpreter && VerifyDataPointer
390 && MethodData::bytecode_has_profile(t->bytecode())) {
391 __ verify_method_data_pointer();
392 }
393 __ dispatch_prolog(tos_out, step);
394 }
395 // generate template
396 t->generate(_masm);
397 // advance
398 if (t->does_dispatch()) {
399 #ifdef ASSERT
400 // make sure execution doesn't go beyond this point if code is broken
401 __ should_not_reach_here();
402 #endif // ASSERT
403 } else {
404 // dispatch to next bytecode
405 __ dispatch_epilog(tos_out, step);
406 }
407 }
408
409 // Generate method entries
410 address TemplateInterpreterGenerator::generate_method_entry(
411 AbstractInterpreter::MethodKind kind) {
412 // determine code generation flags
413 bool native = false;
414 bool synchronized = false;
415 address entry_point = NULL;
416
417 switch (kind) {
418 case Interpreter::zerolocals : break;
419 case Interpreter::zerolocals_synchronized: synchronized = true; break;
420 case Interpreter::native : native = true; break;
421 case Interpreter::native_synchronized : native = true; synchronized = true; break;
422 case Interpreter::empty : break;
423 case Interpreter::accessor : break;
424 case Interpreter::abstract : entry_point = generate_abstract_entry(); break;
425
426 case Interpreter::java_lang_math_sin : // fall thru
427 case Interpreter::java_lang_math_cos : // fall thru
428 case Interpreter::java_lang_math_tan : // fall thru
429 case Interpreter::java_lang_math_abs : // fall thru
430 case Interpreter::java_lang_math_log : // fall thru
431 case Interpreter::java_lang_math_log10 : // fall thru
432 case Interpreter::java_lang_math_sqrt : // fall thru
433 case Interpreter::java_lang_math_pow : // fall thru
434 case Interpreter::java_lang_math_exp : // fall thru
435 case Interpreter::java_lang_math_fmaD : // fall thru
436 case Interpreter::java_lang_math_fmaF : entry_point = generate_math_entry(kind); break;
437 case Interpreter::java_lang_ref_reference_get
438 : entry_point = generate_Reference_get_entry(); break;
439 case Interpreter::java_util_zip_CRC32_update
440 : native = true; entry_point = generate_CRC32_update_entry(); break;
441 case Interpreter::java_util_zip_CRC32_updateBytes
442 : // fall thru
443 case Interpreter::java_util_zip_CRC32_updateByteBuffer
444 : native = true; entry_point = generate_CRC32_updateBytes_entry(kind); break;
445 case Interpreter::java_util_zip_CRC32C_updateBytes
446 : // fall thru
447 case Interpreter::java_util_zip_CRC32C_updateDirectByteBuffer
448 : entry_point = generate_CRC32C_updateBytes_entry(kind); break;
449 #ifdef IA32
450 // On x86_32 platforms, a special entry is generated for the following four methods.
451 // On other platforms the normal entry is used to enter these methods.
452 case Interpreter::java_lang_Float_intBitsToFloat
453 : native = true; entry_point = generate_Float_intBitsToFloat_entry(); break;
454 case Interpreter::java_lang_Float_floatToRawIntBits
455 : native = true; entry_point = generate_Float_floatToRawIntBits_entry(); break;
456 case Interpreter::java_lang_Double_longBitsToDouble
457 : native = true; entry_point = generate_Double_longBitsToDouble_entry(); break;
458 case Interpreter::java_lang_Double_doubleToRawLongBits
459 : native = true; entry_point = generate_Double_doubleToRawLongBits_entry(); break;
460 #else
461 case Interpreter::java_lang_Float_intBitsToFloat:
462 case Interpreter::java_lang_Float_floatToRawIntBits:
463 case Interpreter::java_lang_Double_longBitsToDouble:
464 case Interpreter::java_lang_Double_doubleToRawLongBits:
465 native = true;
466 break;
467 #endif // !IA32
468 default:
469 fatal("unexpected method kind: %d", kind);
470 break;
471 }
472
473 if (entry_point) {
474 return entry_point;
475 }
476
477 // We expect the normal and native entry points to be generated first so we can reuse them.
478 if (native) {
479 entry_point = Interpreter::entry_for_kind(synchronized ? Interpreter::native_synchronized : Interpreter::native);
480 if (entry_point == NULL) {
481 entry_point = generate_native_entry(synchronized);
482 }
483 } else {
484 entry_point = Interpreter::entry_for_kind(synchronized ? Interpreter::zerolocals_synchronized : Interpreter::zerolocals);
485 if (entry_point == NULL) {
486 entry_point = generate_normal_entry(synchronized);
487 }
488 }
489
490 return entry_point;
491 }
492 #endif // !CC_INTERP