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/interp_masm.hpp"
 27 #include "interpreter/interpreter.hpp"
 28 #include "interpreter/interpreterRuntime.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_sinh )
200   method_entry(java_lang_math_tanh )
201   method_entry(java_lang_math_cbrt )
202   method_entry(java_lang_math_abs  )
203   method_entry(java_lang_math_sqrt )
204   method_entry(java_lang_math_sqrt_strict)
205   method_entry(java_lang_math_log  )
206   method_entry(java_lang_math_log10)
207   method_entry(java_lang_math_exp  )
208   method_entry(java_lang_math_pow  )
209   method_entry(java_lang_math_fmaF )
210   method_entry(java_lang_math_fmaD )
211   method_entry(java_lang_ref_reference_get0)
212   AbstractInterpreter::initialize_method_handle_entries();
213 
214   method_entry(java_util_zip_CRC32C_updateBytes)
215   method_entry(java_util_zip_CRC32C_updateDirectByteBuffer)
216 
217   method_entry(java_lang_Float_float16ToFloat);
218   method_entry(java_lang_Float_floatToFloat16);
219 
220 #undef method_entry
221 
222   // all native method kinds
223 #define native_method_entry(kind)                                                                  \
224   { CodeletMark cm(_masm, "native method entry point (kind = " #kind ")");                         \
225     Interpreter::_entry_table[Interpreter::kind] = generate_method_entry(Interpreter::kind, true); \
226   }
227 
228   native_method_entry(native)
229   native_method_entry(native_synchronized)
230   native_method_entry(native_upcalls)
231   native_method_entry(native_synchronized_upcalls)
232 
233   // Entries to intrinsics for native methods should follow
234   // entries for `native` methods to use the same address in case
235   // intrinsic is disabled.
236   native_method_entry(java_lang_Thread_currentThread)
237   native_method_entry(java_lang_ref_reference_get0)
238 
239   native_method_entry(java_util_zip_CRC32_update)
240   native_method_entry(java_util_zip_CRC32_updateBytes)
241   native_method_entry(java_util_zip_CRC32_updateByteBuffer)
242 
243 #undef native_method_entry
244 
245   // Bytecodes
246   set_entry_points_for_all_bytes();
247 
248   // installation of code in other places in the runtime
249   set_safepoints_for_all_bytes();
250 
251   { CodeletMark cm(_masm, "deoptimization entry points");
252     Interpreter::_deopt_entry[0] = EntryPoint();
253     Interpreter::_deopt_entry[0].set_entry(vtos, generate_deopt_entry_for(vtos, 0));
254     for (int i = 1; i < Interpreter::number_of_deopt_entries; i++) {
255       Interpreter::_deopt_entry[i] =
256         EntryPoint(
257                    generate_deopt_entry_for(atos, i),
258                    generate_deopt_entry_for(itos, i),
259                    generate_deopt_entry_for(ltos, i),
260                    generate_deopt_entry_for(ftos, i),
261                    generate_deopt_entry_for(dtos, i),
262                    generate_deopt_entry_for(vtos, i)
263                    );
264     }
265     address return_continuation = Interpreter::_normal_table.entry(Bytecodes::_return).entry(vtos);
266     vmassert(return_continuation != nullptr, "return entry not generated yet");
267     Interpreter::_deopt_reexecute_return_entry = generate_deopt_entry_for(vtos, 0, return_continuation);
268   }
269 
270 }
271 
272 //------------------------------------------------------------------------------------------------------------------------
273 
274 address TemplateInterpreterGenerator::generate_error_exit(const char* msg) {
275   address entry = __ pc();
276   __ stop(msg);
277   return entry;
278 }
279 
280 
281 //------------------------------------------------------------------------------------------------------------------------
282 
283 void TemplateInterpreterGenerator::set_entry_points_for_all_bytes() {
284   for (int i = 0; i < DispatchTable::length; i++) {
285     Bytecodes::Code code = (Bytecodes::Code)i;
286     if (Bytecodes::is_defined(code)) {
287       set_entry_points(code);
288     } else {
289       set_unimplemented(i);
290     }
291   }
292 }
293 
294 
295 void TemplateInterpreterGenerator::set_safepoints_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)) Interpreter::_safept_table.set_entry(code, Interpreter::_safept_entry);
299   }
300 }
301 
302 
303 void TemplateInterpreterGenerator::set_unimplemented(int i) {
304   address e = _unimplemented_bytecode;
305   EntryPoint entry(e, e, e, e, e, e, e, e, e, e);
306   Interpreter::_normal_table.set_entry(i, entry);
307   Interpreter::_wentry_point[i] = _unimplemented_bytecode;
308 }
309 
310 
311 void TemplateInterpreterGenerator::set_entry_points(Bytecodes::Code code) {
312   CodeletMark cm(_masm, Bytecodes::name(code), code);
313   // initialize entry points
314   assert(_unimplemented_bytecode    != nullptr, "should have been generated before");
315   assert(_illegal_bytecode_sequence != nullptr, "should have been generated before");
316   address bep = _illegal_bytecode_sequence;
317   address zep = _illegal_bytecode_sequence;
318   address cep = _illegal_bytecode_sequence;
319   address sep = _illegal_bytecode_sequence;
320   address aep = _illegal_bytecode_sequence;
321   address iep = _illegal_bytecode_sequence;
322   address lep = _illegal_bytecode_sequence;
323   address fep = _illegal_bytecode_sequence;
324   address dep = _illegal_bytecode_sequence;
325   address vep = _unimplemented_bytecode;
326   address wep = _unimplemented_bytecode;
327   // code for short & wide version of bytecode
328   if (Bytecodes::is_defined(code)) {
329     Template* t = TemplateTable::template_for(code);
330     assert(t->is_valid(), "just checking");
331     set_short_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep);
332   }
333   if (Bytecodes::wide_is_defined(code)) {
334     Template* t = TemplateTable::template_for_wide(code);
335     assert(t->is_valid(), "just checking");
336     set_wide_entry_point(t, wep);
337   }
338   // set entry points
339   EntryPoint entry(bep, zep, cep, sep, aep, iep, lep, fep, dep, vep);
340   Interpreter::_normal_table.set_entry(code, entry);
341   Interpreter::_wentry_point[code] = wep;
342 }
343 
344 
345 void TemplateInterpreterGenerator::set_wide_entry_point(Template* t, address& wep) {
346   assert(t->is_valid(), "template must exist");
347   assert(t->tos_in() == vtos, "only vtos tos_in supported for wide instructions");
348   wep = __ pc(); generate_and_dispatch(t);
349 }
350 
351 
352 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) {
353   assert(t->is_valid(), "template must exist");
354   switch (t->tos_in()) {
355     case btos:
356     case ztos:
357     case ctos:
358     case stos:
359       ShouldNotReachHere();  // btos/ctos/stos should use itos.
360       break;
361     case atos: vep = __ pc(); __ pop(atos); aep = __ pc(); generate_and_dispatch(t); break;
362     case itos: vep = __ pc(); __ pop(itos); iep = __ pc(); generate_and_dispatch(t); break;
363     case ltos: vep = __ pc(); __ pop(ltos); lep = __ pc(); generate_and_dispatch(t); break;
364     case ftos: vep = __ pc(); __ pop(ftos); fep = __ pc(); generate_and_dispatch(t); break;
365     case dtos: vep = __ pc(); __ pop(dtos); dep = __ pc(); generate_and_dispatch(t); break;
366     case vtos: set_vtos_entry_points(t, bep, cep, sep, aep, iep, lep, fep, dep, vep);     break;
367     default  : ShouldNotReachHere();                                                 break;
368   }
369 }
370 
371 
372 //------------------------------------------------------------------------------------------------------------------------
373 
374 void TemplateInterpreterGenerator::generate_and_dispatch(Template* t, TosState tos_out) {
375   if (CountBytecodes || CountBytecodesPerThread || TraceBytecodes || StopInterpreterAt > 0) {
376     count_bytecode();
377   }
378   if (PrintBytecodeHistogram)                                    histogram_bytecode(t);
379 #ifndef PRODUCT
380   // debugging code
381   if (PrintBytecodePairHistogram)                                histogram_bytecode_pair(t);
382   if (TraceBytecodes)                                            trace_bytecode(t);
383   if (StopInterpreterAt > 0)                                     stop_interpreter_at();
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 bool TemplateInterpreterGenerator::is_synchronized_method(AbstractInterpreter::MethodKind kind) {
413   switch (kind) {
414     case Interpreter::zerolocals_synchronized        : // fall thru
415     case Interpreter::zerolocals_synchronized_upcalls: // fall thru
416     case Interpreter::native_synchronized            : // fall thru
417     case Interpreter::native_synchronized_upcalls    :
418       return true;
419     default:
420       return false;
421   }
422 }
423 
424 bool TemplateInterpreterGenerator::is_runtime_upcalls_method(AbstractInterpreter::MethodKind kind) {
425   switch (kind) {
426     case Interpreter::zerolocals_upcalls             : // fall thru
427     case Interpreter::zerolocals_synchronized_upcalls: // fall thru
428     case Interpreter::native_upcalls                 : // fall thru
429     case Interpreter::native_synchronized_upcalls    : // fall thru
430     case Interpreter::empty_upcalls                  :
431       return true;
432     default:
433       return false;
434   }
435 }
436 
437 bool TemplateInterpreterGenerator::is_intrinsic_method(AbstractInterpreter::MethodKind kind) {
438   switch (kind) {
439     case Interpreter::zerolocals                     : // fall thru
440     case Interpreter::zerolocals_synchronized        : // fall thru
441     case Interpreter::zerolocals_upcalls             : // fall thru
442     case Interpreter::zerolocals_synchronized_upcalls: // fall thru
443     case Interpreter::native                         : // fall thru
444     case Interpreter::native_synchronized            : // fall thru
445     case Interpreter::native_upcalls                 : // fall thru
446     case Interpreter::native_synchronized_upcalls    : // fall thru
447     case Interpreter::empty                          : // fall thru
448     case Interpreter::empty_upcalls                  : // fall thru
449     case Interpreter::getter                         : // fall thru
450     case Interpreter::setter                         : // fall thru
451     case Interpreter::abstract                       :
452       return false;
453     default:
454       return true;
455   }
456 }
457 
458 bool TemplateInterpreterGenerator::is_abstract_method(AbstractInterpreter::MethodKind kind) {
459   switch (kind) {
460     case Interpreter::abstract:
461       return true;
462     default:
463       return false;
464   }
465 }
466 
467 // Generate method entries
468 address TemplateInterpreterGenerator::generate_method_entry(
469                                         AbstractInterpreter::MethodKind kind, bool native) {
470   address entry_point = nullptr;
471 
472   if (is_abstract_method(kind)) {
473     entry_point = generate_abstract_entry();
474   } else if (is_intrinsic_method(kind)) {
475     entry_point = generate_intrinsic_entry(kind);
476   }
477 
478   if (entry_point) {
479     return entry_point;
480   }
481 
482   bool synchronized = is_synchronized_method(kind);
483   bool upcalls = is_runtime_upcalls_method(kind);
484 
485   // We expect the normal and native entry points to be generated first so we can reuse them.
486   if (!synchronized && !upcalls) {
487     entry_point = Interpreter::entry_for_kind(native ? Interpreter::native
488                                                      : Interpreter::zerolocals);
489   } else if (synchronized && !upcalls) {
490     entry_point = Interpreter::entry_for_kind(native ? Interpreter::native_synchronized
491                                                      : Interpreter::zerolocals_synchronized);
492   } else if (!synchronized && upcalls) {
493     entry_point = Interpreter::entry_for_kind(native ? Interpreter::native_upcalls
494                                                      : Interpreter::zerolocals_upcalls);
495   } else if (synchronized && upcalls) {
496     entry_point = Interpreter::entry_for_kind(native ? Interpreter::native_synchronized_upcalls
497                                                      : Interpreter::zerolocals_synchronized_upcalls);
498   }
499 
500   if (entry_point == nullptr) {
501       entry_point = native ? generate_native_entry(synchronized, upcalls)
502                            : generate_normal_entry(synchronized, upcalls);
503   }
504 
505   return entry_point;
506 }
507 
508 // Generate intrinsic method entries
509 address TemplateInterpreterGenerator::generate_intrinsic_entry(AbstractInterpreter::MethodKind kind) {
510   if (!InlineIntrinsics || !vmIntrinsics::is_intrinsic_available(AbstractInterpreter::method_intrinsic(kind))) {
511     return nullptr;
512   }
513 
514   address entry_point = nullptr;
515 
516   switch (kind) {
517   case Interpreter::java_lang_math_sin     : // fall thru
518   case Interpreter::java_lang_math_cos     : // fall thru
519   case Interpreter::java_lang_math_tan     : // fall thru
520   case Interpreter::java_lang_math_sinh    : // fall thru
521   case Interpreter::java_lang_math_tanh    : // fall thru
522   case Interpreter::java_lang_math_cbrt    : // fall thru
523   case Interpreter::java_lang_math_abs     : // fall thru
524   case Interpreter::java_lang_math_log     : // fall thru
525   case Interpreter::java_lang_math_log10   : // fall thru
526   case Interpreter::java_lang_math_sqrt    : // fall thru
527   case Interpreter::java_lang_math_pow     : // fall thru
528   case Interpreter::java_lang_math_exp     : // fall thru
529   case Interpreter::java_lang_math_fmaD    : // fall thru
530   case Interpreter::java_lang_math_fmaF    : entry_point = generate_math_entry(kind);      break;
531   case Interpreter::java_lang_math_sqrt_strict
532                                            : entry_point = generate_math_entry(Interpreter::java_lang_math_sqrt); break;
533   case Interpreter::java_lang_ref_reference_get0
534                                            : entry_point = generate_Reference_get_entry(); break;
535   case Interpreter::java_util_zip_CRC32_update
536                                            : entry_point = generate_CRC32_update_entry();  break;
537   case Interpreter::java_util_zip_CRC32_updateBytes
538                                            : // fall thru
539   case Interpreter::java_util_zip_CRC32_updateByteBuffer
540                                            : entry_point = generate_CRC32_updateBytes_entry(kind); break;
541   case Interpreter::java_util_zip_CRC32C_updateBytes
542                                            : // fall thru
543   case Interpreter::java_util_zip_CRC32C_updateDirectByteBuffer
544                                            : entry_point = generate_CRC32C_updateBytes_entry(kind); break;
545   case Interpreter::java_lang_Thread_currentThread
546                                            : entry_point = generate_currentThread(); break;
547   case Interpreter::java_lang_Float_float16ToFloat
548                                            : entry_point = generate_Float_float16ToFloat_entry(); break;
549   case Interpreter::java_lang_Float_floatToFloat16
550                                            : entry_point = generate_Float_floatToFloat16_entry(); break;
551   default:
552     fatal("unexpected intrinsic method kind: %d", kind);
553     break;
554   }
555   return entry_point;
556 }