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_cbrt )
201 method_entry(java_lang_math_abs )
202 method_entry(java_lang_math_sqrt )
203 method_entry(java_lang_math_sqrt_strict)
204 method_entry(java_lang_math_log )
205 method_entry(java_lang_math_log10)
206 method_entry(java_lang_math_exp )
207 method_entry(java_lang_math_pow )
208 method_entry(java_lang_math_fmaF )
209 method_entry(java_lang_math_fmaD )
210 method_entry(java_lang_ref_reference_get)
211 AbstractInterpreter::initialize_method_handle_entries();
212
213 method_entry(java_util_zip_CRC32C_updateBytes)
214 method_entry(java_util_zip_CRC32C_updateDirectByteBuffer)
215
216 method_entry(java_lang_Float_float16ToFloat);
217 method_entry(java_lang_Float_floatToFloat16);
218
219 #undef method_entry
220
221 // all native method kinds
222 #define native_method_entry(kind) \
223 { CodeletMark cm(_masm, "native method entry point (kind = " #kind ")"); \
224 Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind, true); \
225 }
226
227 native_method_entry(native)
228 native_method_entry(native_synchronized)
229 native_method_entry(native_upcalls)
230 native_method_entry(native_synchronized_upcalls)
231
232 // Entries to intrinsics for native methods should follow
233 // entries for `native` methods to use the same address in case
234 // intrinsic is disabled.
235 native_method_entry(java_lang_Thread_currentThread)
236
237 native_method_entry(java_util_zip_CRC32_update)
238 native_method_entry(java_util_zip_CRC32_updateBytes)
239 native_method_entry(java_util_zip_CRC32_updateByteBuffer)
240
241 #undef native_method_entry
242
243 // Bytecodes
244 set_entry_points_for_all_bytes();
245
246 // installation of code in other places in the runtime
247 set_safepoints_for_all_bytes();
248
249 { CodeletMark cm(_masm, "deoptimization entry points");
250 Interpreter::_deopt_entry[0] = EntryPoint();
251 Interpreter::_deopt_entry[0].set_entry(vtos, generate_deopt_entry_for(vtos, 0));
252 for (int i = 1; i < Interpreter::number_of_deopt_entries; i++) {
253 Interpreter::_deopt_entry[i] =
254 EntryPoint(
255 generate_deopt_entry_for(atos, i),
256 generate_deopt_entry_for(itos, i),
257 generate_deopt_entry_for(ltos, i),
258 generate_deopt_entry_for(ftos, i),
259 generate_deopt_entry_for(dtos, 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 != nullptr, "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);
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 != nullptr, "should have been generated before");
313 assert(_illegal_bytecode_sequence != nullptr, "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 (CountBytecodes || CountBytecodesPerThread || TraceBytecodes || StopInterpreterAt > 0) {
374 count_bytecode();
375 }
376 if (PrintBytecodeHistogram) histogram_bytecode(t);
377 #ifndef PRODUCT
378 // debugging code
379 if (PrintBytecodePairHistogram) histogram_bytecode_pair(t);
380 if (TraceBytecodes) trace_bytecode(t);
381 if (StopInterpreterAt > 0) stop_interpreter_at();
382 #endif // !PRODUCT
383 int step = 0;
384 if (!t->does_dispatch()) {
385 step = t->is_wide() ? Bytecodes::wide_length_for(t->bytecode()) : Bytecodes::length_for(t->bytecode());
386 if (tos_out == ilgl) tos_out = t->tos_out();
387 // compute bytecode size
388 assert(step > 0, "just checkin'");
389 // setup stuff for dispatching next bytecode
390 if (ProfileInterpreter && VerifyDataPointer
391 && MethodData::bytecode_has_profile(t->bytecode())) {
392 __ verify_method_data_pointer();
393 }
394 __ dispatch_prolog(tos_out, step);
395 }
396 // generate template
397 t->generate(_masm);
398 // advance
399 if (t->does_dispatch()) {
400 #ifdef ASSERT
401 // make sure execution doesn't go beyond this point if code is broken
402 __ should_not_reach_here();
403 #endif // ASSERT
404 } else {
405 // dispatch to next bytecode
406 __ dispatch_epilog(tos_out, step);
407 }
408 }
409
410 bool TemplateInterpreterGenerator::is_synchronized_method(AbstractInterpreter::MethodKind kind) {
411 switch (kind) {
412 case Interpreter::zerolocals_synchronized : // fall thru
413 case Interpreter::zerolocals_synchronized_upcalls: // fall thru
414 case Interpreter::native_synchronized : // fall thru
415 case Interpreter::native_synchronized_upcalls :
416 return true;
417 default:
418 return false;
419 }
420 }
421
422 bool TemplateInterpreterGenerator::is_runtime_upcalls_method(AbstractInterpreter::MethodKind kind) {
423 switch (kind) {
424 case Interpreter::zerolocals_upcalls : // fall thru
425 case Interpreter::zerolocals_synchronized_upcalls: // fall thru
426 case Interpreter::native_upcalls : // fall thru
427 case Interpreter::native_synchronized_upcalls : // fall thru
428 case Interpreter::empty_upcalls :
429 return true;
430 default:
431 return false;
432 }
433 }
434
435 bool TemplateInterpreterGenerator::is_intrinsic_method(AbstractInterpreter::MethodKind kind) {
436 switch (kind) {
437 case Interpreter::zerolocals : // fall thru
438 case Interpreter::zerolocals_synchronized : // fall thru
439 case Interpreter::zerolocals_upcalls : // fall thru
440 case Interpreter::zerolocals_synchronized_upcalls: // fall thru
441 case Interpreter::native : // fall thru
442 case Interpreter::native_synchronized : // fall thru
443 case Interpreter::native_upcalls : // fall thru
444 case Interpreter::native_synchronized_upcalls : // fall thru
445 case Interpreter::empty : // fall thru
446 case Interpreter::empty_upcalls : // fall thru
447 case Interpreter::getter : // fall thru
448 case Interpreter::setter : // fall thru
449 case Interpreter::abstract :
450 return false;
451 default:
452 return true;
453 }
454 }
455
456 bool TemplateInterpreterGenerator::is_abstract_method(AbstractInterpreter::MethodKind kind) {
457 switch (kind) {
458 case Interpreter::abstract:
459 return true;
460 default:
461 return false;
462 }
463 }
464
465 // Generate method entries
466 address TemplateInterpreterGenerator::generate_method_entry(
467 AbstractInterpreter::MethodKind kind, bool native) {
468 address entry_point = nullptr;
469
470 if (is_abstract_method(kind)) {
471 entry_point = generate_abstract_entry();
472 } else if (is_intrinsic_method(kind)) {
473 entry_point = generate_intrinsic_entry(kind);
474 }
475
476 if (entry_point) {
477 return entry_point;
478 }
479
480 bool synchronized = is_synchronized_method(kind);
481 bool upcalls = is_runtime_upcalls_method(kind);
482
483 // We expect the normal and native entry points to be generated first so we can reuse them.
484 if (!synchronized && !upcalls) {
485 entry_point = Interpreter::entry_for_kind(native ? Interpreter::native
486 : Interpreter::zerolocals);
487 } else if (synchronized && !upcalls) {
488 entry_point = Interpreter::entry_for_kind(native ? Interpreter::native_synchronized
489 : Interpreter::zerolocals_synchronized);
490 } else if (!synchronized && upcalls) {
491 entry_point = Interpreter::entry_for_kind(native ? Interpreter::native_upcalls
492 : Interpreter::zerolocals_upcalls);
493 } else if (synchronized && upcalls) {
494 entry_point = Interpreter::entry_for_kind(native ? Interpreter::native_synchronized_upcalls
495 : Interpreter::zerolocals_synchronized_upcalls);
496 }
497
498 if (entry_point == nullptr) {
499 entry_point = native ? generate_native_entry(synchronized, upcalls)
500 : generate_normal_entry(synchronized, upcalls);
501 }
502
503 return entry_point;
504 }
505
506 // Generate intrinsic method entries
507 address TemplateInterpreterGenerator::generate_intrinsic_entry(AbstractInterpreter::MethodKind kind) {
508 if (!InlineIntrinsics || !vmIntrinsics::is_intrinsic_available(AbstractInterpreter::method_intrinsic(kind))) {
509 return nullptr;
510 }
511
512 address entry_point = nullptr;
513
514 switch (kind) {
515 case Interpreter::java_lang_math_sin : // fall thru
516 case Interpreter::java_lang_math_cos : // fall thru
517 case Interpreter::java_lang_math_tan : // fall thru
518 case Interpreter::java_lang_math_tanh : // fall thru
519 case Interpreter::java_lang_math_cbrt : // fall thru
520 case Interpreter::java_lang_math_abs : // fall thru
521 case Interpreter::java_lang_math_log : // fall thru
522 case Interpreter::java_lang_math_log10 : // fall thru
523 case Interpreter::java_lang_math_sqrt : // fall thru
524 case Interpreter::java_lang_math_pow : // fall thru
525 case Interpreter::java_lang_math_exp : // fall thru
526 case Interpreter::java_lang_math_fmaD : // fall thru
527 case Interpreter::java_lang_math_fmaF : entry_point = generate_math_entry(kind); break;
528 case Interpreter::java_lang_math_sqrt_strict
529 : entry_point = generate_math_entry(Interpreter::java_lang_math_sqrt); break;
530 case Interpreter::java_lang_ref_reference_get
531 : entry_point = generate_Reference_get_entry(); break;
532 case Interpreter::java_util_zip_CRC32_update
533 : entry_point = generate_CRC32_update_entry(); break;
534 case Interpreter::java_util_zip_CRC32_updateBytes
535 : // fall thru
536 case Interpreter::java_util_zip_CRC32_updateByteBuffer
537 : entry_point = generate_CRC32_updateBytes_entry(kind); break;
538 case Interpreter::java_util_zip_CRC32C_updateBytes
539 : // fall thru
540 case Interpreter::java_util_zip_CRC32C_updateDirectByteBuffer
541 : entry_point = generate_CRC32C_updateBytes_entry(kind); break;
542 case Interpreter::java_lang_Thread_currentThread
543 : entry_point = generate_currentThread(); break;
544 case Interpreter::java_lang_Float_float16ToFloat
545 : entry_point = generate_Float_float16ToFloat_entry(); break;
546 case Interpreter::java_lang_Float_floatToFloat16
547 : entry_point = generate_Float_floatToFloat16_entry(); break;
548 default:
549 fatal("unexpected intrinsic method kind: %d", kind);
550 break;
551 }
552 return entry_point;
553 }