1 /*
2 * Copyright (c) 1997, 2025, 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 "compiler/disassembler.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 #include "oops/methodData.hpp"
33
34 #define __ Disassembler::hook<InterpreterMacroAssembler>(__FILE__, __LINE__, _masm)->
35
36 TemplateInterpreterGenerator::TemplateInterpreterGenerator(): AbstractInterpreterGenerator() {
37 _unimplemented_bytecode = nullptr;
38 _illegal_bytecode_sequence = nullptr;
39 generate_all();
40 }
41
42 static const BasicType types[Interpreter::number_of_result_handlers] = {
43 T_BOOLEAN,
44 T_CHAR ,
45 T_BYTE ,
46 T_SHORT ,
47 T_INT ,
48 T_LONG ,
49 T_VOID ,
50 T_FLOAT ,
51 T_DOUBLE ,
52 T_OBJECT
53 };
54
55 void TemplateInterpreterGenerator::generate_all() {
56 { CodeletMark cm(_masm, "slow signature handler");
57 AbstractInterpreter::_slow_signature_handler = generate_slow_signature_handler();
58 }
59
60 { CodeletMark cm(_masm, "error exits");
61 _unimplemented_bytecode = generate_error_exit("unimplemented bytecode");
62 _illegal_bytecode_sequence = generate_error_exit("illegal bytecode sequence - method not verified");
63 }
64
65 #ifndef PRODUCT
66 if (TraceBytecodes) {
67 CodeletMark cm(_masm, "bytecode tracing support");
68 Interpreter::_trace_code =
69 EntryPoint(
70 generate_trace_code(atos),
71 generate_trace_code(itos),
72 generate_trace_code(ltos),
73 generate_trace_code(ftos),
74 generate_trace_code(dtos),
75 generate_trace_code(vtos)
76 );
77 }
78 #endif // !PRODUCT
79
80 { CodeletMark cm(_masm, "return entry points");
81 Interpreter::_return_entry[0] = EntryPoint();
82 for (int i = 1; i < Interpreter::number_of_return_entries; i++) {
83 Interpreter::_return_entry[i] =
84 EntryPoint(
85 generate_return_entry_for(atos, i, sizeof(u2)),
86 generate_return_entry_for(itos, i, sizeof(u2)),
87 generate_return_entry_for(ltos, i, sizeof(u2)),
88 generate_return_entry_for(ftos, i, sizeof(u2)),
89 generate_return_entry_for(dtos, i, sizeof(u2)),
90 generate_return_entry_for(vtos, i, sizeof(u2))
91 );
92 }
93 }
94
95 { CodeletMark cm(_masm, "invoke return entry points");
96 // These states are in order specified in TosState, except btos/ztos/ctos/stos which
97 // are the same as itos since there is no top of stack optimization for these types
98 const TosState states[] = {ilgl, ilgl, ilgl, ilgl, itos, ltos, ftos, dtos, atos, vtos, ilgl};
99 const int invoke_length = Bytecodes::length_for(Bytecodes::_invokestatic);
100 const int invokeinterface_length = Bytecodes::length_for(Bytecodes::_invokeinterface);
101 const int invokedynamic_length = Bytecodes::length_for(Bytecodes::_invokedynamic);
102
103 assert(invoke_length >= 0 && invoke_length < Interpreter::number_of_return_entries, "invariant");
104 assert(invokeinterface_length >= 0 && invokeinterface_length < Interpreter::number_of_return_entries, "invariant");
105
106 for (int i = itos; i < Interpreter::number_of_return_addrs; i++) {
107 TosState state = states[i];
108 assert(state != ilgl, "states array is wrong above");
109
110 // Reuse generated entry points
111 Interpreter::_invoke_return_entry[i] = Interpreter::_return_entry[invoke_length].entry(state);
112 Interpreter::_invokeinterface_return_entry[i] = Interpreter::_return_entry[invokeinterface_length].entry(state);
113
114 Interpreter::_invokedynamic_return_entry[i] = generate_return_entry_for(state, invokedynamic_length, sizeof(u4));
115 }
116
117 // set itos entry points for btos/ztos/ctos/stos
118 for (int i = 0; i < itos; i++) {
119 Interpreter::_invoke_return_entry[i] = Interpreter::_invoke_return_entry[itos];
120 Interpreter::_invokeinterface_return_entry[i] = Interpreter::_invokeinterface_return_entry[itos];
121 Interpreter::_invokedynamic_return_entry[i] = Interpreter::_invokedynamic_return_entry[itos];
122 }
123 }
124
125 { CodeletMark cm(_masm, "earlyret entry points");
126 Interpreter::_earlyret_entry =
127 EntryPoint(
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, "result handlers for native calls");
138 // The various result converter stublets.
139 int is_generated[Interpreter::number_of_result_handlers];
140 memset(is_generated, 0, sizeof(is_generated));
141
142 for (int i = 0; i < Interpreter::number_of_result_handlers; i++) {
143 BasicType type = types[i];
144 if (!is_generated[Interpreter::BasicType_as_index(type)]++) {
145 Interpreter::_native_abi_to_tosca[Interpreter::BasicType_as_index(type)] = generate_result_handler_for(type);
146 }
147 }
148 }
149
150
151 { CodeletMark cm(_masm, "safepoint entry points");
152 Interpreter::_safept_entry =
153 EntryPoint(
154 generate_safept_entry_for(atos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
155 generate_safept_entry_for(itos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
156 generate_safept_entry_for(ltos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
157 generate_safept_entry_for(ftos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
158 generate_safept_entry_for(dtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint)),
159 generate_safept_entry_for(vtos, CAST_FROM_FN_PTR(address, InterpreterRuntime::at_safepoint))
160 );
161 }
162
163 { CodeletMark cm(_masm, "exception handling");
164 // (Note: this is not safepoint safe because thread may return to compiled code)
165 generate_throw_exception();
166 }
167
168 { CodeletMark cm(_masm, "throw exception entrypoints");
169 Interpreter::_throw_ArrayIndexOutOfBoundsException_entry = generate_ArrayIndexOutOfBounds_handler();
170 Interpreter::_throw_ArrayStoreException_entry = generate_klass_exception_handler("java/lang/ArrayStoreException");
171 Interpreter::_throw_ArithmeticException_entry = generate_exception_handler("java/lang/ArithmeticException", "/ by zero");
172 Interpreter::_throw_ClassCastException_entry = generate_ClassCastException_handler();
173 Interpreter::_throw_NullPointerException_entry = generate_exception_handler("java/lang/NullPointerException", nullptr);
174 Interpreter::_throw_StackOverflowError_entry = generate_StackOverflowError_handler();
175 }
176
177 { CodeletMark cm(_masm, "preemption resume adapter");
178 Interpreter::_cont_resume_interpreter_adapter = generate_cont_resume_interpreter_adapter();
179 }
180
181 #define method_entry(kind) \
182 { CodeletMark cm(_masm, "method entry point (kind = " #kind ")"); \
183 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind, false); \
184 }
185
186 // all non-native method kinds
187 method_entry(zerolocals)
188 method_entry(zerolocals_synchronized)
189 method_entry(zerolocals_upcalls)
190 method_entry(zerolocals_synchronized_upcalls)
191 method_entry(empty)
192 method_entry(empty_upcalls)
193 method_entry(getter)
194 method_entry(setter)
195 method_entry(abstract)
196 method_entry(java_lang_math_sin )
197 method_entry(java_lang_math_cos )
198 method_entry(java_lang_math_tan )
199 method_entry(java_lang_math_tanh )
200 method_entry(java_lang_math_abs )
201 method_entry(java_lang_math_sqrt )
202 method_entry(java_lang_math_sqrt_strict)
203 method_entry(java_lang_math_log )
204 method_entry(java_lang_math_log10)
205 method_entry(java_lang_math_exp )
206 method_entry(java_lang_math_pow )
207 method_entry(java_lang_math_fmaF )
208 method_entry(java_lang_math_fmaD )
209 method_entry(java_lang_ref_reference_get)
210 AbstractInterpreter::initialize_method_handle_entries();
211
212 method_entry(java_util_zip_CRC32C_updateBytes)
213 method_entry(java_util_zip_CRC32C_updateDirectByteBuffer)
214
215 method_entry(java_lang_Float_float16ToFloat);
216 method_entry(java_lang_Float_floatToFloat16);
217
218 #undef method_entry
219
220 // all native method kinds
221 #define native_method_entry(kind) \
222 { CodeletMark cm(_masm, "native method entry point (kind = " #kind ")"); \
223 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind, true); \
224 }
225
226 native_method_entry(native)
227 native_method_entry(native_synchronized)
228 native_method_entry(native_upcalls)
229 native_method_entry(native_synchronized_upcalls)
230
231 // Entries to intrinsics for native methods should follow
232 // entries for `native` methods to use the same address in case
233 // intrinsic is disabled.
234 native_method_entry(java_lang_Thread_currentThread)
235
236 native_method_entry(java_util_zip_CRC32_update)
237 native_method_entry(java_util_zip_CRC32_updateBytes)
238 native_method_entry(java_util_zip_CRC32_updateByteBuffer)
239
240 native_method_entry(java_lang_Float_intBitsToFloat)
241 native_method_entry(java_lang_Float_floatToRawIntBits)
242 native_method_entry(java_lang_Double_longBitsToDouble)
243 native_method_entry(java_lang_Double_doubleToRawLongBits)
244
245 #undef native_method_entry
246
247 // Bytecodes
248 set_entry_points_for_all_bytes();
249
250 // installation of code in other places in the runtime
251 set_safepoints_for_all_bytes();
252
253 { CodeletMark cm(_masm, "deoptimization entry points");
254 Interpreter::_deopt_entry[0] = EntryPoint();
255 Interpreter::_deopt_entry[0].set_entry(vtos, generate_deopt_entry_for(vtos, 0));
256 for (int i = 1; i < Interpreter::number_of_deopt_entries; i++) {
257 Interpreter::_deopt_entry[i] =
258 EntryPoint(
259 generate_deopt_entry_for(atos, i),
260 generate_deopt_entry_for(itos, i),
261 generate_deopt_entry_for(ltos, i),
262 generate_deopt_entry_for(ftos, i),
263 generate_deopt_entry_for(dtos, i),
264 generate_deopt_entry_for(vtos, i)
265 );
266 }
267 address return_continuation = Interpreter::_normal_table.entry(Bytecodes::_return).entry(vtos);
268 vmassert(return_continuation != nullptr, "return entry not generated yet");
269 Interpreter::_deopt_reexecute_return_entry = generate_deopt_entry_for(vtos, 0, return_continuation);
270 }
271
272 }
273
274 //------------------------------------------------------------------------------------------------------------------------
275
276 address TemplateInterpreterGenerator::generate_error_exit(const char* msg) {
277 address entry = __ pc();
278 __ stop(msg);
279 return entry;
280 }
281
282
283 //------------------------------------------------------------------------------------------------------------------------
284
285 void TemplateInterpreterGenerator::set_entry_points_for_all_bytes() {
286 for (int i = 0; i < DispatchTable::length; i++) {
287 Bytecodes::Code code = (Bytecodes::Code)i;
288 if (Bytecodes::is_defined(code)) {
289 set_entry_points(code);
290 } else {
291 set_unimplemented(i);
292 }
293 }
294 }
295
296
297 void TemplateInterpreterGenerator::set_safepoints_for_all_bytes() {
298 for (int i = 0; i < DispatchTable::length; i++) {
299 Bytecodes::Code code = (Bytecodes::Code)i;
300 if (Bytecodes::is_defined(code)) Interpreter::_safept_table.set_entry(code, Interpreter::_safept_entry);
301 }
302 }
303
304
305 void TemplateInterpreterGenerator::set_unimplemented(int i) {
306 address e = _unimplemented_bytecode;
307 EntryPoint entry(e, e, e, e, e, e, e, e, e, e);
308 Interpreter::_normal_table.set_entry(i, entry);
309 Interpreter::_wentry_point[i] = _unimplemented_bytecode;
310 }
311
312
313 void TemplateInterpreterGenerator::set_entry_points(Bytecodes::Code code) {
314 CodeletMark cm(_masm, Bytecodes::name(code), code);
315 // initialize entry points
316 assert(_unimplemented_bytecode != nullptr, "should have been generated before");
317 assert(_illegal_bytecode_sequence != nullptr, "should have been generated before");
318 address bep = _illegal_bytecode_sequence;
319 address zep = _illegal_bytecode_sequence;
320 address cep = _illegal_bytecode_sequence;
321 address sep = _illegal_bytecode_sequence;
322 address aep = _illegal_bytecode_sequence;
323 address iep = _illegal_bytecode_sequence;
324 address lep = _illegal_bytecode_sequence;
325 address fep = _illegal_bytecode_sequence;
326 address dep = _illegal_bytecode_sequence;
327 address vep = _unimplemented_bytecode;
328 address wep = _unimplemented_bytecode;
329 // code for short & wide version of bytecode
330 if (Bytecodes::is_defined(code)) {
331 Template* t = TemplateTable::template_for(code);
332 assert(t->is_valid(), "just checking");
333 set_short_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep);
334 }
335 if (Bytecodes::wide_is_defined(code)) {
336 Template* t = TemplateTable::template_for_wide(code);
337 assert(t->is_valid(), "just checking");
338 set_wide_entry_point(t, wep);
339 }
340 // set entry points
341 EntryPoint entry(bep, zep, cep, sep, aep, iep, lep, fep, dep, vep);
342 Interpreter::_normal_table.set_entry(code, entry);
343 Interpreter::_wentry_point[code] = wep;
344 }
345
346
347 void TemplateInterpreterGenerator::set_wide_entry_point(Template* t, address& wep) {
348 assert(t->is_valid(), "template must exist");
349 assert(t->tos_in() == vtos, "only vtos tos_in supported for wide instructions");
350 wep = __ pc(); generate_and_dispatch(t);
351 }
352
353
354 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) {
355 assert(t->is_valid(), "template must exist");
356 switch (t->tos_in()) {
357 case btos:
358 case ztos:
359 case ctos:
360 case stos:
361 ShouldNotReachHere(); // btos/ctos/stos should use itos.
362 break;
363 case atos: vep = __ pc(); __ pop(atos); aep = __ pc(); generate_and_dispatch(t); break;
364 case itos: vep = __ pc(); __ pop(itos); iep = __ pc(); generate_and_dispatch(t); break;
365 case ltos: vep = __ pc(); __ pop(ltos); lep = __ pc(); generate_and_dispatch(t); break;
366 case ftos: vep = __ pc(); __ pop(ftos); fep = __ pc(); generate_and_dispatch(t); break;
367 case dtos: vep = __ pc(); __ pop(dtos); dep = __ pc(); generate_and_dispatch(t); break;
368 case vtos: set_vtos_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep); break;
369 default : ShouldNotReachHere(); break;
370 }
371 }
372
373
374 //------------------------------------------------------------------------------------------------------------------------
375
376 void TemplateInterpreterGenerator::generate_and_dispatch(Template* t, TosState tos_out) {
377 if (CountBytecodes || CountBytecodesPerThread || TraceBytecodes || StopInterpreterAt > 0) {
378 count_bytecode();
379 }
380 if (PrintBytecodeHistogram) histogram_bytecode(t);
381 #ifndef PRODUCT
382 // debugging code
383 if (PrintBytecodePairHistogram) histogram_bytecode_pair(t);
384 if (TraceBytecodes) trace_bytecode(t);
385 if (StopInterpreterAt > 0) stop_interpreter_at();
386 __ verify_FPU(1, t->tos_in());
387 #endif // !PRODUCT
388 int step = 0;
389 if (!t->does_dispatch()) {
390 step = t->is_wide() ? Bytecodes::wide_length_for(t->bytecode()) : Bytecodes::length_for(t->bytecode());
391 if (tos_out == ilgl) tos_out = t->tos_out();
392 // compute bytecode size
393 assert(step > 0, "just checkin'");
394 // setup stuff for dispatching next bytecode
395 if (ProfileInterpreter && VerifyDataPointer
396 && MethodData::bytecode_has_profile(t->bytecode())) {
397 __ verify_method_data_pointer();
398 }
399 __ dispatch_prolog(tos_out, step);
400 }
401 // generate template
402 t->generate(_masm);
403 // advance
404 if (t->does_dispatch()) {
405 #ifdef ASSERT
406 // make sure execution doesn't go beyond this point if code is broken
407 __ should_not_reach_here();
408 #endif // ASSERT
409 } else {
410 // dispatch to next bytecode
411 __ dispatch_epilog(tos_out, step);
412 }
413 }
414
415 bool TemplateInterpreterGenerator::is_synchronized_method(AbstractInterpreter::MethodKind kind) {
416 switch (kind) {
417 case Interpreter::zerolocals_synchronized : // fall thru
418 case Interpreter::zerolocals_synchronized_upcalls: // fall thru
419 case Interpreter::native_synchronized : // fall thru
420 case Interpreter::native_synchronized_upcalls :
421 return true;
422 default:
423 return false;
424 }
425 }
426
427 bool TemplateInterpreterGenerator::is_runtime_upcalls_method(AbstractInterpreter::MethodKind kind) {
428 switch (kind) {
429 case Interpreter::zerolocals_upcalls : // fall thru
430 case Interpreter::zerolocals_synchronized_upcalls: // fall thru
431 case Interpreter::native_upcalls : // fall thru
432 case Interpreter::native_synchronized_upcalls : // fall thru
433 case Interpreter::empty_upcalls :
434 return true;
435 default:
436 return false;
437 }
438 }
439
440 bool TemplateInterpreterGenerator::is_intrinsic_method(AbstractInterpreter::MethodKind kind) {
441 switch (kind) {
442 case Interpreter::zerolocals : // fall thru
443 case Interpreter::zerolocals_synchronized : // fall thru
444 case Interpreter::zerolocals_upcalls : // fall thru
445 case Interpreter::zerolocals_synchronized_upcalls: // fall thru
446 case Interpreter::native : // fall thru
447 case Interpreter::native_synchronized : // fall thru
448 case Interpreter::native_upcalls : // fall thru
449 case Interpreter::native_synchronized_upcalls : // fall thru
450 case Interpreter::empty : // fall thru
451 case Interpreter::empty_upcalls : // fall thru
452 case Interpreter::getter : // fall thru
453 case Interpreter::setter : // fall thru
454 case Interpreter::abstract :
455 return false;
456 default:
457 return true;
458 }
459 }
460
461 bool TemplateInterpreterGenerator::is_abstract_method(AbstractInterpreter::MethodKind kind) {
462 switch (kind) {
463 case Interpreter::abstract:
464 return true;
465 default:
466 return false;
467 }
468 }
469
470 // Generate method entries
471 address TemplateInterpreterGenerator::generate_method_entry(
472 AbstractInterpreter::MethodKind kind, bool native) {
473 address entry_point = nullptr;
474
475 if (is_abstract_method(kind)) {
476 entry_point = generate_abstract_entry();
477 } else if (is_intrinsic_method(kind)) {
478 entry_point = generate_intrinsic_entry(kind);
479 }
480
481 if (entry_point) {
482 return entry_point;
483 }
484
485 bool synchronized = is_synchronized_method(kind);
486 bool upcalls = is_runtime_upcalls_method(kind);
487
488 // We expect the normal and native entry points to be generated first so we can reuse them.
489 if (!synchronized && !upcalls) {
490 entry_point = Interpreter::entry_for_kind(native ? Interpreter::native
491 : Interpreter::zerolocals);
492 } else if (synchronized && !upcalls) {
493 entry_point = Interpreter::entry_for_kind(native ? Interpreter::native_synchronized
494 : Interpreter::zerolocals_synchronized);
495 } else if (!synchronized && upcalls) {
496 entry_point = Interpreter::entry_for_kind(native ? Interpreter::native_upcalls
497 : Interpreter::zerolocals_upcalls);
498 } else if (synchronized && upcalls) {
499 entry_point = Interpreter::entry_for_kind(native ? Interpreter::native_synchronized_upcalls
500 : Interpreter::zerolocals_synchronized_upcalls);
501 }
502
503 if (entry_point == nullptr) {
504 entry_point = native ? generate_native_entry(synchronized, upcalls)
505 : generate_normal_entry(synchronized, upcalls);
506 }
507
508 return entry_point;
509 }
510
511 // Generate intrinsic method entries
512 address TemplateInterpreterGenerator::generate_intrinsic_entry(AbstractInterpreter::MethodKind kind) {
513 if (!InlineIntrinsics || !vmIntrinsics::is_intrinsic_available(AbstractInterpreter::method_intrinsic(kind))) {
514 return nullptr;
515 }
516
517 address entry_point = nullptr;
518
519 switch (kind) {
520 case Interpreter::java_lang_math_sin : // fall thru
521 case Interpreter::java_lang_math_cos : // fall thru
522 case Interpreter::java_lang_math_tan : // fall thru
523 case Interpreter::java_lang_math_tanh : // fall thru
524 case Interpreter::java_lang_math_abs : // fall thru
525 case Interpreter::java_lang_math_log : // fall thru
526 case Interpreter::java_lang_math_log10 : // fall thru
527 case Interpreter::java_lang_math_sqrt : // fall thru
528 case Interpreter::java_lang_math_pow : // fall thru
529 case Interpreter::java_lang_math_exp : // fall thru
530 case Interpreter::java_lang_math_fmaD : // fall thru
531 case Interpreter::java_lang_math_fmaF : entry_point = generate_math_entry(kind); break;
532 case Interpreter::java_lang_math_sqrt_strict
533 : entry_point = generate_math_entry(Interpreter::java_lang_math_sqrt); break;
534 case Interpreter::java_lang_ref_reference_get
535 : entry_point = generate_Reference_get_entry(); break;
536 case Interpreter::java_util_zip_CRC32_update
537 : entry_point = generate_CRC32_update_entry(); break;
538 case Interpreter::java_util_zip_CRC32_updateBytes
539 : // fall thru
540 case Interpreter::java_util_zip_CRC32_updateByteBuffer
541 : entry_point = generate_CRC32_updateBytes_entry(kind); break;
542 case Interpreter::java_util_zip_CRC32C_updateBytes
543 : // fall thru
544 case Interpreter::java_util_zip_CRC32C_updateDirectByteBuffer
545 : entry_point = generate_CRC32C_updateBytes_entry(kind); break;
546 case Interpreter::java_lang_Thread_currentThread
547 : entry_point = generate_currentThread(); break;
548 case Interpreter::java_lang_Float_float16ToFloat
549 : entry_point = generate_Float_float16ToFloat_entry(); break;
550 case Interpreter::java_lang_Float_floatToFloat16
551 : entry_point = generate_Float_floatToFloat16_entry(); break;
552
553 // On x86_32 platforms, a special entry is generated for the following four methods.
554 // On other platforms the native entry is used to enter these methods.
555 case Interpreter::java_lang_Float_intBitsToFloat
556 : entry_point = generate_Float_intBitsToFloat_entry(); break;
557 case Interpreter::java_lang_Float_floatToRawIntBits
558 : entry_point = generate_Float_floatToRawIntBits_entry(); break;
559 case Interpreter::java_lang_Double_longBitsToDouble
560 : entry_point = generate_Double_longBitsToDouble_entry(); break;
561 case Interpreter::java_lang_Double_doubleToRawLongBits
562 : entry_point = generate_Double_doubleToRawLongBits_entry(); break;
563 default:
564 fatal("unexpected intrinsic method kind: %d", kind);
565 break;
566 }
567 return entry_point;
568 }
569