1 /*
   2  * Copyright (c) 1998, 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 "classfile/vmClasses.hpp"
  26 #include "classfile/vmSymbols.hpp"
  27 #include "code/codeCache.hpp"
  28 #include "code/compiledIC.hpp"
  29 #include "code/nmethod.hpp"
  30 #include "code/pcDesc.hpp"
  31 #include "code/scopeDesc.hpp"
  32 #include "code/vtableStubs.hpp"
  33 #include "compiler/compilationMemoryStatistic.hpp"
  34 #include "compiler/compileBroker.hpp"
  35 #include "compiler/oopMap.hpp"
  36 #include "gc/g1/g1HeapRegion.hpp"
  37 #include "gc/shared/barrierSet.hpp"
  38 #include "gc/shared/collectedHeap.hpp"
  39 #include "gc/shared/gcLocker.hpp"
  40 #include "interpreter/bytecode.hpp"
  41 #include "interpreter/interpreter.hpp"
  42 #include "interpreter/linkResolver.hpp"
  43 #include "logging/log.hpp"
  44 #include "logging/logStream.hpp"
  45 #include "memory/oopFactory.hpp"
  46 #include "memory/resourceArea.hpp"
  47 #include "oops/objArrayKlass.hpp"
  48 #include "oops/klass.inline.hpp"
  49 #include "oops/oop.inline.hpp"
  50 #include "oops/typeArrayOop.inline.hpp"
  51 #include "opto/ad.hpp"
  52 #include "opto/addnode.hpp"
  53 #include "opto/callnode.hpp"
  54 #include "opto/cfgnode.hpp"
  55 #include "opto/graphKit.hpp"
  56 #include "opto/machnode.hpp"
  57 #include "opto/matcher.hpp"
  58 #include "opto/memnode.hpp"
  59 #include "opto/mulnode.hpp"
  60 #include "opto/output.hpp"
  61 #include "opto/runtime.hpp"
  62 #include "opto/subnode.hpp"
  63 #include "prims/jvmtiExport.hpp"
  64 #include "runtime/atomic.hpp"
  65 #include "runtime/frame.inline.hpp"
  66 #include "runtime/handles.inline.hpp"
  67 #include "runtime/interfaceSupport.inline.hpp"
  68 #include "runtime/javaCalls.hpp"
  69 #include "runtime/sharedRuntime.hpp"
  70 #include "runtime/signature.hpp"
  71 #include "runtime/stackWatermarkSet.hpp"
  72 #include "runtime/synchronizer.hpp"
  73 #include "runtime/threadCritical.hpp"
  74 #include "runtime/threadWXSetters.inline.hpp"
  75 #include "runtime/vframe.hpp"
  76 #include "runtime/vframeArray.hpp"
  77 #include "runtime/vframe_hp.hpp"
  78 #include "utilities/copy.hpp"
  79 #include "utilities/preserveException.hpp"
  80 
  81 
  82 // For debugging purposes:
  83 //  To force FullGCALot inside a runtime function, add the following two lines
  84 //
  85 //  Universe::release_fullgc_alot_dummy();
  86 //  Universe::heap()->collect();
  87 //
  88 // At command line specify the parameters: -XX:+FullGCALot -XX:FullGCALotStart=100000000
  89 
  90 
  91 #define C2_BLOB_FIELD_DEFINE(name, type) \
  92   type OptoRuntime:: BLOB_FIELD_NAME(name)  = nullptr;
  93 #define C2_STUB_FIELD_NAME(name) _ ## name ## _Java
  94 #define C2_STUB_FIELD_DEFINE(name, f, t, r) \
  95   address OptoRuntime:: C2_STUB_FIELD_NAME(name) = nullptr;
  96 #define C2_JVMTI_STUB_FIELD_DEFINE(name) \
  97   address OptoRuntime:: STUB_FIELD_NAME(name) = nullptr;
  98 C2_STUBS_DO(C2_BLOB_FIELD_DEFINE, C2_STUB_FIELD_DEFINE, C2_JVMTI_STUB_FIELD_DEFINE)
  99 #undef C2_BLOB_FIELD_DEFINE
 100 #undef C2_STUB_FIELD_DEFINE
 101 #undef C2_JVMTI_STUB_FIELD_DEFINE
 102 
 103 #define C2_BLOB_NAME_DEFINE(name, type)  "C2 Runtime " # name "_blob",
 104 #define C2_STUB_NAME_DEFINE(name, f, t, r)  "C2 Runtime " # name,
 105 #define C2_JVMTI_STUB_NAME_DEFINE(name)  "C2 Runtime " # name,
 106 const char* OptoRuntime::_stub_names[] = {
 107   C2_STUBS_DO(C2_BLOB_NAME_DEFINE, C2_STUB_NAME_DEFINE, C2_JVMTI_STUB_NAME_DEFINE)
 108 };
 109 #undef C2_BLOB_NAME_DEFINE
 110 #undef C2_STUB_NAME_DEFINE
 111 #undef C2_JVMTI_STUB_NAME_DEFINE
 112 
 113 // This should be called in an assertion at the start of OptoRuntime routines
 114 // which are entered from compiled code (all of them)
 115 #ifdef ASSERT
 116 static bool check_compiled_frame(JavaThread* thread) {
 117   assert(thread->last_frame().is_runtime_frame(), "cannot call runtime directly from compiled code");
 118   RegisterMap map(thread,
 119                   RegisterMap::UpdateMap::skip,
 120                   RegisterMap::ProcessFrames::include,
 121                   RegisterMap::WalkContinuation::skip);
 122   frame caller = thread->last_frame().sender(&map);
 123   assert(caller.is_compiled_frame(), "not being called from compiled like code");
 124   return true;
 125 }
 126 #endif // ASSERT
 127 
 128 /*
 129 #define gen(env, var, type_func_gen, c_func, fancy_jump, pass_tls, return_pc) \
 130   var = generate_stub(env, type_func_gen, CAST_FROM_FN_PTR(address, c_func), #var, fancy_jump, pass_tls, return_pc); \
 131   if (var == nullptr) { return false; }
 132 */
 133 
 134 #define GEN_C2_BLOB(name, type)                    \
 135   generate_ ## name ## _blob();
 136 
 137 // a few helper macros to conjure up generate_stub call arguments
 138 #define C2_STUB_FIELD_NAME(name) _ ## name ## _Java
 139 #define C2_STUB_TYPEFUNC(name) name ## _Type
 140 #define C2_STUB_C_FUNC(name) CAST_FROM_FN_PTR(address, name ## _C)
 141 #define C2_STUB_NAME(name) stub_name(OptoStubId::name ## _id)
 142 
 143 // Almost all the C functions targeted from the generated stubs are
 144 // implemented locally to OptoRuntime with names that can be generated
 145 // from the stub name by appending suffix '_C'. However, in two cases
 146 // a common target method also needs to be called from shared runtime
 147 // stubs. In these two cases the opto stubs rely on method
 148 // imlementations defined in class SharedRuntime. The following
 149 // defines temporarily rebind the generated names to reference the
 150 // relevant implementations.
 151 
 152 #define GEN_C2_STUB(name, fancy_jump, pass_tls, pass_retpc  )         \
 153   C2_STUB_FIELD_NAME(name) =                                          \
 154     generate_stub(env,                                                  \
 155                   C2_STUB_TYPEFUNC(name),                             \
 156                   C2_STUB_C_FUNC(name),                               \
 157                   C2_STUB_NAME(name),                                 \
 158                   fancy_jump,                                           \
 159                   pass_tls,                                             \
 160                   pass_retpc);                                          \
 161   if (C2_STUB_FIELD_NAME(name) == nullptr) { return false; }          \
 162 
 163 #define C2_JVMTI_STUB_C_FUNC(name) CAST_FROM_FN_PTR(address, SharedRuntime::name)
 164 
 165 #define GEN_C2_JVMTI_STUB(name)                                       \
 166   STUB_FIELD_NAME(name) =                                               \
 167     generate_stub(env,                                                  \
 168                   notify_jvmti_vthread_Type,                            \
 169                   C2_JVMTI_STUB_C_FUNC(name),                         \
 170                   C2_STUB_NAME(name),                                 \
 171                   0,                                                    \
 172                   true,                                                 \
 173                   false);                                               \
 174   if (STUB_FIELD_NAME(name) == nullptr) { return false; }               \
 175 
 176 bool OptoRuntime::generate(ciEnv* env) {
 177 
 178   C2_STUBS_DO(GEN_C2_BLOB, GEN_C2_STUB, GEN_C2_JVMTI_STUB)
 179 
 180   return true;
 181 }
 182 
 183 #undef GEN_C2_BLOB
 184 
 185 #undef C2_STUB_FIELD_NAME
 186 #undef C2_STUB_TYPEFUNC
 187 #undef C2_STUB_C_FUNC
 188 #undef C2_STUB_NAME
 189 #undef GEN_C2_STUB
 190 
 191 #undef C2_JVMTI_STUB_C_FUNC
 192 #undef GEN_C2_JVMTI_STUB
 193 // #undef gen
 194 
 195 const TypeFunc* OptoRuntime::_new_instance_Type                   = nullptr;
 196 const TypeFunc* OptoRuntime::_new_array_Type                      = nullptr;
 197 const TypeFunc* OptoRuntime::_multianewarray2_Type                = nullptr;
 198 const TypeFunc* OptoRuntime::_multianewarray3_Type                = nullptr;
 199 const TypeFunc* OptoRuntime::_multianewarray4_Type                = nullptr;
 200 const TypeFunc* OptoRuntime::_multianewarray5_Type                = nullptr;
 201 const TypeFunc* OptoRuntime::_multianewarrayN_Type                = nullptr;
 202 const TypeFunc* OptoRuntime::_complete_monitor_enter_Type         = nullptr;
 203 const TypeFunc* OptoRuntime::_complete_monitor_exit_Type          = nullptr;
 204 const TypeFunc* OptoRuntime::_monitor_notify_Type                 = nullptr;
 205 const TypeFunc* OptoRuntime::_uncommon_trap_Type                  = nullptr;
 206 const TypeFunc* OptoRuntime::_athrow_Type                         = nullptr;
 207 const TypeFunc* OptoRuntime::_rethrow_Type                        = nullptr;
 208 const TypeFunc* OptoRuntime::_Math_D_D_Type                       = nullptr;
 209 const TypeFunc* OptoRuntime::_Math_DD_D_Type                      = nullptr;
 210 const TypeFunc* OptoRuntime::_modf_Type                           = nullptr;
 211 const TypeFunc* OptoRuntime::_l2f_Type                            = nullptr;
 212 const TypeFunc* OptoRuntime::_void_long_Type                      = nullptr;
 213 const TypeFunc* OptoRuntime::_void_void_Type                      = nullptr;
 214 const TypeFunc* OptoRuntime::_jfr_write_checkpoint_Type           = nullptr;
 215 const TypeFunc* OptoRuntime::_flush_windows_Type                  = nullptr;
 216 const TypeFunc* OptoRuntime::_fast_arraycopy_Type                 = nullptr;
 217 const TypeFunc* OptoRuntime::_checkcast_arraycopy_Type            = nullptr;
 218 const TypeFunc* OptoRuntime::_generic_arraycopy_Type              = nullptr;
 219 const TypeFunc* OptoRuntime::_slow_arraycopy_Type                 = nullptr;
 220 const TypeFunc* OptoRuntime::_unsafe_setmemory_Type               = nullptr;
 221 const TypeFunc* OptoRuntime::_array_fill_Type                     = nullptr;
 222 const TypeFunc* OptoRuntime::_array_sort_Type                     = nullptr;
 223 const TypeFunc* OptoRuntime::_array_partition_Type                = nullptr;
 224 const TypeFunc* OptoRuntime::_aescrypt_block_Type                 = nullptr;
 225 const TypeFunc* OptoRuntime::_cipherBlockChaining_aescrypt_Type   = nullptr;
 226 const TypeFunc* OptoRuntime::_electronicCodeBook_aescrypt_Type    = nullptr;
 227 const TypeFunc* OptoRuntime::_counterMode_aescrypt_Type           = nullptr;
 228 const TypeFunc* OptoRuntime::_galoisCounterMode_aescrypt_Type     = nullptr;
 229 const TypeFunc* OptoRuntime::_digestBase_implCompress_with_sha3_Type      = nullptr;
 230 const TypeFunc* OptoRuntime::_digestBase_implCompress_without_sha3_Type   = nullptr;
 231 const TypeFunc* OptoRuntime::_digestBase_implCompressMB_with_sha3_Type    = nullptr;
 232 const TypeFunc* OptoRuntime::_digestBase_implCompressMB_without_sha3_Type = nullptr;
 233 const TypeFunc* OptoRuntime::_double_keccak_Type                  = nullptr;
 234 const TypeFunc* OptoRuntime::_multiplyToLen_Type                  = nullptr;
 235 const TypeFunc* OptoRuntime::_montgomeryMultiply_Type             = nullptr;
 236 const TypeFunc* OptoRuntime::_montgomerySquare_Type               = nullptr;
 237 const TypeFunc* OptoRuntime::_squareToLen_Type                    = nullptr;
 238 const TypeFunc* OptoRuntime::_mulAdd_Type                         = nullptr;
 239 const TypeFunc* OptoRuntime::_bigIntegerShift_Type                = nullptr;
 240 const TypeFunc* OptoRuntime::_vectorizedMismatch_Type             = nullptr;
 241 const TypeFunc* OptoRuntime::_ghash_processBlocks_Type            = nullptr;
 242 const TypeFunc* OptoRuntime::_chacha20Block_Type                  = nullptr;
 243 
 244 const TypeFunc* OptoRuntime::_dilithiumAlmostNtt_Type             = nullptr;
 245 const TypeFunc* OptoRuntime::_dilithiumAlmostInverseNtt_Type      = nullptr;
 246 const TypeFunc* OptoRuntime::_dilithiumNttMult_Type               = nullptr;
 247 const TypeFunc* OptoRuntime::_dilithiumMontMulByConstant_Type     = nullptr;
 248 const TypeFunc* OptoRuntime::_dilithiumDecomposePoly_Type         = nullptr;
 249 
 250 const TypeFunc* OptoRuntime::_base64_encodeBlock_Type             = nullptr;
 251 const TypeFunc* OptoRuntime::_base64_decodeBlock_Type             = nullptr;
 252 const TypeFunc* OptoRuntime::_string_IndexOf_Type                 = nullptr;
 253 const TypeFunc* OptoRuntime::_poly1305_processBlocks_Type         = nullptr;
 254 const TypeFunc* OptoRuntime::_intpoly_montgomeryMult_P256_Type    = nullptr;
 255 const TypeFunc* OptoRuntime::_intpoly_assign_Type                 = nullptr;
 256 const TypeFunc* OptoRuntime::_updateBytesCRC32_Type               = nullptr;
 257 const TypeFunc* OptoRuntime::_updateBytesCRC32C_Type              = nullptr;
 258 const TypeFunc* OptoRuntime::_updateBytesAdler32_Type             = nullptr;
 259 const TypeFunc* OptoRuntime::_osr_end_Type                        = nullptr;
 260 const TypeFunc* OptoRuntime::_register_finalizer_Type             = nullptr;
 261 #if INCLUDE_JFR
 262 const TypeFunc* OptoRuntime::_class_id_load_barrier_Type          = nullptr;
 263 #endif // INCLUDE_JFR
 264 #if INCLUDE_JVMTI
 265 const TypeFunc* OptoRuntime::_notify_jvmti_vthread_Type           = nullptr;
 266 #endif // INCLUDE_JVMTI
 267 const TypeFunc* OptoRuntime::_dtrace_method_entry_exit_Type       = nullptr;
 268 const TypeFunc* OptoRuntime::_dtrace_object_alloc_Type            = nullptr;
 269 
 270 // Helper method to do generation of RunTimeStub's
 271 address OptoRuntime::generate_stub(ciEnv* env,
 272                                    TypeFunc_generator gen, address C_function,
 273                                    const char *name, int is_fancy_jump,
 274                                    bool pass_tls,
 275                                    bool return_pc) {
 276 
 277   // Matching the default directive, we currently have no method to match.
 278   DirectiveSet* directive = DirectivesStack::getDefaultDirective(CompileBroker::compiler(CompLevel_full_optimization));
 279   CompilationMemoryStatisticMark cmsm(directive);
 280   ResourceMark rm;
 281   Compile C(env, gen, C_function, name, is_fancy_jump, pass_tls, return_pc, directive);
 282   DirectivesStack::release(directive);
 283   return  C.stub_entry_point();
 284 }
 285 
 286 const char* OptoRuntime::stub_name(address entry) {
 287 #ifndef PRODUCT
 288   CodeBlob* cb = CodeCache::find_blob(entry);
 289   RuntimeStub* rs =(RuntimeStub *)cb;
 290   assert(rs != nullptr && rs->is_runtime_stub(), "not a runtime stub");
 291   return rs->name();
 292 #else
 293   // Fast implementation for product mode (maybe it should be inlined too)
 294   return "runtime stub";
 295 #endif
 296 }
 297 
 298 // local methods passed as arguments to stub generator that forward
 299 // control to corresponding JRT methods of SharedRuntime
 300 
 301 void OptoRuntime::slow_arraycopy_C(oopDesc* src,  jint src_pos,
 302                                    oopDesc* dest, jint dest_pos,
 303                                    jint length, JavaThread* thread) {
 304   SharedRuntime::slow_arraycopy_C(src,  src_pos, dest, dest_pos, length, thread);
 305 }
 306 
 307 void OptoRuntime::complete_monitor_locking_C(oopDesc* obj, BasicLock* lock, JavaThread* current) {
 308   SharedRuntime::complete_monitor_locking_C(obj, lock, current);
 309 }
 310 
 311 
 312 //=============================================================================
 313 // Opto compiler runtime routines
 314 //=============================================================================
 315 
 316 
 317 //=============================allocation======================================
 318 // We failed the fast-path allocation.  Now we need to do a scavenge or GC
 319 // and try allocation again.
 320 
 321 // object allocation
 322 JRT_BLOCK_ENTRY(void, OptoRuntime::new_instance_C(Klass* klass, JavaThread* current))
 323   JRT_BLOCK;
 324 #ifndef PRODUCT
 325   SharedRuntime::_new_instance_ctr++;         // new instance requires GC
 326 #endif
 327   assert(check_compiled_frame(current), "incorrect caller");
 328 
 329   // These checks are cheap to make and support reflective allocation.
 330   int lh = klass->layout_helper();
 331   if (Klass::layout_helper_needs_slow_path(lh) || !InstanceKlass::cast(klass)->is_initialized()) {
 332     Handle holder(current, klass->klass_holder()); // keep the klass alive
 333     klass->check_valid_for_instantiation(false, THREAD);
 334     if (!HAS_PENDING_EXCEPTION) {
 335       InstanceKlass::cast(klass)->initialize(THREAD);
 336     }
 337   }
 338 
 339   if (!HAS_PENDING_EXCEPTION) {
 340     // Scavenge and allocate an instance.
 341     Handle holder(current, klass->klass_holder()); // keep the klass alive
 342     oop result = InstanceKlass::cast(klass)->allocate_instance(THREAD);
 343     current->set_vm_result(result);
 344 
 345     // Pass oops back through thread local storage.  Our apparent type to Java
 346     // is that we return an oop, but we can block on exit from this routine and
 347     // a GC can trash the oop in C's return register.  The generated stub will
 348     // fetch the oop from TLS after any possible GC.
 349   }
 350 
 351   deoptimize_caller_frame(current, HAS_PENDING_EXCEPTION);
 352   JRT_BLOCK_END;
 353 
 354   // inform GC that we won't do card marks for initializing writes.
 355   SharedRuntime::on_slowpath_allocation_exit(current);
 356 JRT_END
 357 
 358 
 359 // array allocation
 360 JRT_BLOCK_ENTRY(void, OptoRuntime::new_array_C(Klass* array_type, int len, JavaThread* current))
 361   JRT_BLOCK;
 362 #ifndef PRODUCT
 363   SharedRuntime::_new_array_ctr++;            // new array requires GC
 364 #endif
 365   assert(check_compiled_frame(current), "incorrect caller");
 366 
 367   // Scavenge and allocate an instance.
 368   oop result;
 369 
 370   if (array_type->is_typeArray_klass()) {
 371     // The oopFactory likes to work with the element type.
 372     // (We could bypass the oopFactory, since it doesn't add much value.)
 373     BasicType elem_type = TypeArrayKlass::cast(array_type)->element_type();
 374     result = oopFactory::new_typeArray(elem_type, len, THREAD);
 375   } else {
 376     // Although the oopFactory likes to work with the elem_type,
 377     // the compiler prefers the array_type, since it must already have
 378     // that latter value in hand for the fast path.
 379     Handle holder(current, array_type->klass_holder()); // keep the array klass alive
 380     Klass* elem_type = ObjArrayKlass::cast(array_type)->element_klass();
 381     result = oopFactory::new_objArray(elem_type, len, THREAD);
 382   }
 383 
 384   // Pass oops back through thread local storage.  Our apparent type to Java
 385   // is that we return an oop, but we can block on exit from this routine and
 386   // a GC can trash the oop in C's return register.  The generated stub will
 387   // fetch the oop from TLS after any possible GC.
 388   deoptimize_caller_frame(current, HAS_PENDING_EXCEPTION);
 389   current->set_vm_result(result);
 390   JRT_BLOCK_END;
 391 
 392   // inform GC that we won't do card marks for initializing writes.
 393   SharedRuntime::on_slowpath_allocation_exit(current);
 394 JRT_END
 395 
 396 // array allocation without zeroing
 397 JRT_BLOCK_ENTRY(void, OptoRuntime::new_array_nozero_C(Klass* array_type, int len, JavaThread* current))
 398   JRT_BLOCK;
 399 #ifndef PRODUCT
 400   SharedRuntime::_new_array_ctr++;            // new array requires GC
 401 #endif
 402   assert(check_compiled_frame(current), "incorrect caller");
 403 
 404   // Scavenge and allocate an instance.
 405   oop result;
 406 
 407   assert(array_type->is_typeArray_klass(), "should be called only for type array");
 408   // The oopFactory likes to work with the element type.
 409   BasicType elem_type = TypeArrayKlass::cast(array_type)->element_type();
 410   result = oopFactory::new_typeArray_nozero(elem_type, len, THREAD);
 411 
 412   // Pass oops back through thread local storage.  Our apparent type to Java
 413   // is that we return an oop, but we can block on exit from this routine and
 414   // a GC can trash the oop in C's return register.  The generated stub will
 415   // fetch the oop from TLS after any possible GC.
 416   deoptimize_caller_frame(current, HAS_PENDING_EXCEPTION);
 417   current->set_vm_result(result);
 418   JRT_BLOCK_END;
 419 
 420 
 421   // inform GC that we won't do card marks for initializing writes.
 422   SharedRuntime::on_slowpath_allocation_exit(current);
 423 
 424   oop result = current->vm_result();
 425   if ((len > 0) && (result != nullptr) &&
 426       is_deoptimized_caller_frame(current)) {
 427     // Zero array here if the caller is deoptimized.
 428     const size_t size = TypeArrayKlass::cast(array_type)->oop_size(result);
 429     BasicType elem_type = TypeArrayKlass::cast(array_type)->element_type();
 430     size_t hs_bytes = arrayOopDesc::base_offset_in_bytes(elem_type);
 431     assert(is_aligned(hs_bytes, BytesPerInt), "must be 4 byte aligned");
 432     HeapWord* obj = cast_from_oop<HeapWord*>(result);
 433     if (!is_aligned(hs_bytes, BytesPerLong)) {
 434       *reinterpret_cast<jint*>(reinterpret_cast<char*>(obj) + hs_bytes) = 0;
 435       hs_bytes += BytesPerInt;
 436     }
 437 
 438     // Optimized zeroing.
 439     assert(is_aligned(hs_bytes, BytesPerLong), "must be 8-byte aligned");
 440     const size_t aligned_hs = hs_bytes / BytesPerLong;
 441     Copy::fill_to_aligned_words(obj+aligned_hs, size-aligned_hs);
 442   }
 443 
 444 JRT_END
 445 
 446 // Note: multianewarray for one dimension is handled inline by GraphKit::new_array.
 447 
 448 // multianewarray for 2 dimensions
 449 JRT_ENTRY(void, OptoRuntime::multianewarray2_C(Klass* elem_type, int len1, int len2, JavaThread* current))
 450 #ifndef PRODUCT
 451   SharedRuntime::_multi2_ctr++;                // multianewarray for 1 dimension
 452 #endif
 453   assert(check_compiled_frame(current), "incorrect caller");
 454   assert(elem_type->is_klass(), "not a class");
 455   jint dims[2];
 456   dims[0] = len1;
 457   dims[1] = len2;
 458   Handle holder(current, elem_type->klass_holder()); // keep the klass alive
 459   oop obj = ArrayKlass::cast(elem_type)->multi_allocate(2, dims, THREAD);
 460   deoptimize_caller_frame(current, HAS_PENDING_EXCEPTION);
 461   current->set_vm_result(obj);
 462 JRT_END
 463 
 464 // multianewarray for 3 dimensions
 465 JRT_ENTRY(void, OptoRuntime::multianewarray3_C(Klass* elem_type, int len1, int len2, int len3, JavaThread* current))
 466 #ifndef PRODUCT
 467   SharedRuntime::_multi3_ctr++;                // multianewarray for 1 dimension
 468 #endif
 469   assert(check_compiled_frame(current), "incorrect caller");
 470   assert(elem_type->is_klass(), "not a class");
 471   jint dims[3];
 472   dims[0] = len1;
 473   dims[1] = len2;
 474   dims[2] = len3;
 475   Handle holder(current, elem_type->klass_holder()); // keep the klass alive
 476   oop obj = ArrayKlass::cast(elem_type)->multi_allocate(3, dims, THREAD);
 477   deoptimize_caller_frame(current, HAS_PENDING_EXCEPTION);
 478   current->set_vm_result(obj);
 479 JRT_END
 480 
 481 // multianewarray for 4 dimensions
 482 JRT_ENTRY(void, OptoRuntime::multianewarray4_C(Klass* elem_type, int len1, int len2, int len3, int len4, JavaThread* current))
 483 #ifndef PRODUCT
 484   SharedRuntime::_multi4_ctr++;                // multianewarray for 1 dimension
 485 #endif
 486   assert(check_compiled_frame(current), "incorrect caller");
 487   assert(elem_type->is_klass(), "not a class");
 488   jint dims[4];
 489   dims[0] = len1;
 490   dims[1] = len2;
 491   dims[2] = len3;
 492   dims[3] = len4;
 493   Handle holder(current, elem_type->klass_holder()); // keep the klass alive
 494   oop obj = ArrayKlass::cast(elem_type)->multi_allocate(4, dims, THREAD);
 495   deoptimize_caller_frame(current, HAS_PENDING_EXCEPTION);
 496   current->set_vm_result(obj);
 497 JRT_END
 498 
 499 // multianewarray for 5 dimensions
 500 JRT_ENTRY(void, OptoRuntime::multianewarray5_C(Klass* elem_type, int len1, int len2, int len3, int len4, int len5, JavaThread* current))
 501 #ifndef PRODUCT
 502   SharedRuntime::_multi5_ctr++;                // multianewarray for 1 dimension
 503 #endif
 504   assert(check_compiled_frame(current), "incorrect caller");
 505   assert(elem_type->is_klass(), "not a class");
 506   jint dims[5];
 507   dims[0] = len1;
 508   dims[1] = len2;
 509   dims[2] = len3;
 510   dims[3] = len4;
 511   dims[4] = len5;
 512   Handle holder(current, elem_type->klass_holder()); // keep the klass alive
 513   oop obj = ArrayKlass::cast(elem_type)->multi_allocate(5, dims, THREAD);
 514   deoptimize_caller_frame(current, HAS_PENDING_EXCEPTION);
 515   current->set_vm_result(obj);
 516 JRT_END
 517 
 518 JRT_ENTRY(void, OptoRuntime::multianewarrayN_C(Klass* elem_type, arrayOopDesc* dims, JavaThread* current))
 519   assert(check_compiled_frame(current), "incorrect caller");
 520   assert(elem_type->is_klass(), "not a class");
 521   assert(oop(dims)->is_typeArray(), "not an array");
 522 
 523   ResourceMark rm;
 524   jint len = dims->length();
 525   assert(len > 0, "Dimensions array should contain data");
 526   jint *c_dims = NEW_RESOURCE_ARRAY(jint, len);
 527   ArrayAccess<>::arraycopy_to_native<>(dims, typeArrayOopDesc::element_offset<jint>(0),
 528                                        c_dims, len);
 529 
 530   Handle holder(current, elem_type->klass_holder()); // keep the klass alive
 531   oop obj = ArrayKlass::cast(elem_type)->multi_allocate(len, c_dims, THREAD);
 532   deoptimize_caller_frame(current, HAS_PENDING_EXCEPTION);
 533   current->set_vm_result(obj);
 534 JRT_END
 535 
 536 JRT_BLOCK_ENTRY(void, OptoRuntime::monitor_notify_C(oopDesc* obj, JavaThread* current))
 537 
 538   // Very few notify/notifyAll operations find any threads on the waitset, so
 539   // the dominant fast-path is to simply return.
 540   // Relatedly, it's critical that notify/notifyAll be fast in order to
 541   // reduce lock hold times.
 542   if (!SafepointSynchronize::is_synchronizing()) {
 543     if (ObjectSynchronizer::quick_notify(obj, current, false)) {
 544       return;
 545     }
 546   }
 547 
 548   // This is the case the fast-path above isn't provisioned to handle.
 549   // The fast-path is designed to handle frequently arising cases in an efficient manner.
 550   // (The fast-path is just a degenerate variant of the slow-path).
 551   // Perform the dreaded state transition and pass control into the slow-path.
 552   JRT_BLOCK;
 553   Handle h_obj(current, obj);
 554   ObjectSynchronizer::notify(h_obj, CHECK);
 555   JRT_BLOCK_END;
 556 JRT_END
 557 
 558 JRT_BLOCK_ENTRY(void, OptoRuntime::monitor_notifyAll_C(oopDesc* obj, JavaThread* current))
 559 
 560   if (!SafepointSynchronize::is_synchronizing() ) {
 561     if (ObjectSynchronizer::quick_notify(obj, current, true)) {
 562       return;
 563     }
 564   }
 565 
 566   // This is the case the fast-path above isn't provisioned to handle.
 567   // The fast-path is designed to handle frequently arising cases in an efficient manner.
 568   // (The fast-path is just a degenerate variant of the slow-path).
 569   // Perform the dreaded state transition and pass control into the slow-path.
 570   JRT_BLOCK;
 571   Handle h_obj(current, obj);
 572   ObjectSynchronizer::notifyall(h_obj, CHECK);
 573   JRT_BLOCK_END;
 574 JRT_END
 575 
 576 static const TypeFunc* make_new_instance_Type() {
 577   // create input type (domain)
 578   const Type **fields = TypeTuple::fields(1);
 579   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Klass to be allocated
 580   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
 581 
 582   // create result type (range)
 583   fields = TypeTuple::fields(1);
 584   fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
 585 
 586   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 587 
 588   return TypeFunc::make(domain, range);
 589 }
 590 
 591 #if INCLUDE_JVMTI
 592 static const TypeFunc* make_notify_jvmti_vthread_Type() {
 593   // create input type (domain)
 594   const Type **fields = TypeTuple::fields(2);
 595   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // VirtualThread oop
 596   fields[TypeFunc::Parms+1] = TypeInt::BOOL;        // jboolean
 597   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
 598 
 599   // no result type needed
 600   fields = TypeTuple::fields(1);
 601   fields[TypeFunc::Parms+0] = nullptr; // void
 602   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
 603 
 604   return TypeFunc::make(domain,range);
 605 }
 606 #endif
 607 
 608 static const TypeFunc* make_athrow_Type() {
 609   // create input type (domain)
 610   const Type **fields = TypeTuple::fields(1);
 611   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Klass to be allocated
 612   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
 613 
 614   // create result type (range)
 615   fields = TypeTuple::fields(0);
 616 
 617   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 618 
 619   return TypeFunc::make(domain, range);
 620 }
 621 
 622 static const TypeFunc* make_new_array_Type() {
 623   // create input type (domain)
 624   const Type **fields = TypeTuple::fields(2);
 625   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;   // element klass
 626   fields[TypeFunc::Parms+1] = TypeInt::INT;       // array size
 627   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 628 
 629   // create result type (range)
 630   fields = TypeTuple::fields(1);
 631   fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
 632 
 633   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 634 
 635   return TypeFunc::make(domain, range);
 636 }
 637 
 638 const TypeFunc* OptoRuntime::multianewarray_Type(int ndim) {
 639   // create input type (domain)
 640   const int nargs = ndim + 1;
 641   const Type **fields = TypeTuple::fields(nargs);
 642   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;   // element klass
 643   for( int i = 1; i < nargs; i++ )
 644     fields[TypeFunc::Parms + i] = TypeInt::INT;       // array size
 645   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+nargs, fields);
 646 
 647   // create result type (range)
 648   fields = TypeTuple::fields(1);
 649   fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
 650   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 651 
 652   return TypeFunc::make(domain, range);
 653 }
 654 
 655 static const TypeFunc* make_multianewarrayN_Type() {
 656   // create input type (domain)
 657   const Type **fields = TypeTuple::fields(2);
 658   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;   // element klass
 659   fields[TypeFunc::Parms+1] = TypeInstPtr::NOTNULL;   // array of dim sizes
 660   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 661 
 662   // create result type (range)
 663   fields = TypeTuple::fields(1);
 664   fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
 665   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 666 
 667   return TypeFunc::make(domain, range);
 668 }
 669 
 670 static const TypeFunc* make_uncommon_trap_Type() {
 671   // create input type (domain)
 672   const Type **fields = TypeTuple::fields(1);
 673   fields[TypeFunc::Parms+0] = TypeInt::INT; // trap_reason (deopt reason and action)
 674   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
 675 
 676   // create result type (range)
 677   fields = TypeTuple::fields(0);
 678   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 679 
 680   return TypeFunc::make(domain, range);
 681 }
 682 
 683 //-----------------------------------------------------------------------------
 684 // Monitor Handling
 685 
 686 static const TypeFunc* make_complete_monitor_enter_Type() {
 687   // create input type (domain)
 688   const Type **fields = TypeTuple::fields(2);
 689   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;  // Object to be Locked
 690   fields[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM;   // Address of stack location for lock
 691   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
 692 
 693   // create result type (range)
 694   fields = TypeTuple::fields(0);
 695 
 696   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
 697 
 698   return TypeFunc::make(domain,range);
 699 }
 700 
 701 //-----------------------------------------------------------------------------
 702 
 703 static const TypeFunc* make_complete_monitor_exit_Type() {
 704   // create input type (domain)
 705   const Type **fields = TypeTuple::fields(3);
 706   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;  // Object to be Locked
 707   fields[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM;    // Address of stack location for lock - BasicLock
 708   fields[TypeFunc::Parms+2] = TypeRawPtr::BOTTOM;    // Thread pointer (Self)
 709   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+3, fields);
 710 
 711   // create result type (range)
 712   fields = TypeTuple::fields(0);
 713 
 714   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 715 
 716   return TypeFunc::make(domain, range);
 717 }
 718 
 719 static const TypeFunc* make_monitor_notify_Type() {
 720   // create input type (domain)
 721   const Type **fields = TypeTuple::fields(1);
 722   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;  // Object to be Locked
 723   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
 724 
 725   // create result type (range)
 726   fields = TypeTuple::fields(0);
 727   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 728   return TypeFunc::make(domain, range);
 729 }
 730 
 731 static const TypeFunc* make_flush_windows_Type() {
 732   // create input type (domain)
 733   const Type** fields = TypeTuple::fields(1);
 734   fields[TypeFunc::Parms+0] = nullptr; // void
 735   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms, fields);
 736 
 737   // create result type
 738   fields = TypeTuple::fields(1);
 739   fields[TypeFunc::Parms+0] = nullptr; // void
 740   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
 741 
 742   return TypeFunc::make(domain, range);
 743 }
 744 
 745 static const TypeFunc* make_l2f_Type() {
 746   // create input type (domain)
 747   const Type **fields = TypeTuple::fields(2);
 748   fields[TypeFunc::Parms+0] = TypeLong::LONG;
 749   fields[TypeFunc::Parms+1] = Type::HALF;
 750   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 751 
 752   // create result type (range)
 753   fields = TypeTuple::fields(1);
 754   fields[TypeFunc::Parms+0] = Type::FLOAT;
 755   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 756 
 757   return TypeFunc::make(domain, range);
 758 }
 759 
 760 static const TypeFunc* make_modf_Type() {
 761   const Type **fields = TypeTuple::fields(2);
 762   fields[TypeFunc::Parms+0] = Type::FLOAT;
 763   fields[TypeFunc::Parms+1] = Type::FLOAT;
 764   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 765 
 766   // create result type (range)
 767   fields = TypeTuple::fields(1);
 768   fields[TypeFunc::Parms+0] = Type::FLOAT;
 769 
 770   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 771 
 772   return TypeFunc::make(domain, range);
 773 }
 774 
 775 static const TypeFunc* make_Math_D_D_Type() {
 776   // create input type (domain)
 777   const Type **fields = TypeTuple::fields(2);
 778   // Symbol* name of class to be loaded
 779   fields[TypeFunc::Parms+0] = Type::DOUBLE;
 780   fields[TypeFunc::Parms+1] = Type::HALF;
 781   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 782 
 783   // create result type (range)
 784   fields = TypeTuple::fields(2);
 785   fields[TypeFunc::Parms+0] = Type::DOUBLE;
 786   fields[TypeFunc::Parms+1] = Type::HALF;
 787   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+2, fields);
 788 
 789   return TypeFunc::make(domain, range);
 790 }
 791 
 792 const TypeFunc* OptoRuntime::Math_Vector_Vector_Type(uint num_arg, const TypeVect* in_type, const TypeVect* out_type) {
 793   // create input type (domain)
 794   const Type **fields = TypeTuple::fields(num_arg);
 795   // Symbol* name of class to be loaded
 796   assert(num_arg > 0, "must have at least 1 input");
 797   for (uint i = 0; i < num_arg; i++) {
 798     fields[TypeFunc::Parms+i] = in_type;
 799   }
 800   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+num_arg, fields);
 801 
 802   // create result type (range)
 803   const uint num_ret = 1;
 804   fields = TypeTuple::fields(num_ret);
 805   fields[TypeFunc::Parms+0] = out_type;
 806   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+num_ret, fields);
 807 
 808   return TypeFunc::make(domain, range);
 809 }
 810 
 811 static const TypeFunc* make_Math_DD_D_Type() {
 812   const Type **fields = TypeTuple::fields(4);
 813   fields[TypeFunc::Parms+0] = Type::DOUBLE;
 814   fields[TypeFunc::Parms+1] = Type::HALF;
 815   fields[TypeFunc::Parms+2] = Type::DOUBLE;
 816   fields[TypeFunc::Parms+3] = Type::HALF;
 817   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+4, fields);
 818 
 819   // create result type (range)
 820   fields = TypeTuple::fields(2);
 821   fields[TypeFunc::Parms+0] = Type::DOUBLE;
 822   fields[TypeFunc::Parms+1] = Type::HALF;
 823   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+2, fields);
 824 
 825   return TypeFunc::make(domain, range);
 826 }
 827 
 828 //-------------- currentTimeMillis, currentTimeNanos, etc
 829 
 830 static const TypeFunc* make_void_long_Type() {
 831   // create input type (domain)
 832   const Type **fields = TypeTuple::fields(0);
 833   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+0, fields);
 834 
 835   // create result type (range)
 836   fields = TypeTuple::fields(2);
 837   fields[TypeFunc::Parms+0] = TypeLong::LONG;
 838   fields[TypeFunc::Parms+1] = Type::HALF;
 839   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+2, fields);
 840 
 841   return TypeFunc::make(domain, range);
 842 }
 843 
 844 static const TypeFunc* make_void_void_Type() {
 845   // create input type (domain)
 846   const Type **fields = TypeTuple::fields(0);
 847   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+0, fields);
 848 
 849   // create result type (range)
 850   fields = TypeTuple::fields(0);
 851   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 852   return TypeFunc::make(domain, range);
 853 }
 854 
 855 static const TypeFunc* make_jfr_write_checkpoint_Type() {
 856   // create input type (domain)
 857   const Type **fields = TypeTuple::fields(0);
 858   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms, fields);
 859 
 860   // create result type (range)
 861   fields = TypeTuple::fields(0);
 862   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
 863   return TypeFunc::make(domain, range);
 864 }
 865 
 866 
 867 // Takes as parameters:
 868 // void *dest
 869 // long size
 870 // uchar byte
 871 
 872 static const TypeFunc* make_setmemory_Type() {
 873   // create input type (domain)
 874   int argcnt = NOT_LP64(3) LP64_ONLY(4);
 875   const Type** fields = TypeTuple::fields(argcnt);
 876   int argp = TypeFunc::Parms;
 877   fields[argp++] = TypePtr::NOTNULL;        // dest
 878   fields[argp++] = TypeX_X;                 // size
 879   LP64_ONLY(fields[argp++] = Type::HALF);   // size
 880   fields[argp++] = TypeInt::UBYTE;          // bytevalue
 881   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
 882   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 883 
 884   // no result type needed
 885   fields = TypeTuple::fields(1);
 886   fields[TypeFunc::Parms+0] = nullptr; // void
 887   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
 888   return TypeFunc::make(domain, range);
 889 }
 890 
 891 // arraycopy stub variations:
 892 enum ArrayCopyType {
 893   ac_fast,                      // void(ptr, ptr, size_t)
 894   ac_checkcast,                 //  int(ptr, ptr, size_t, size_t, ptr)
 895   ac_slow,                      // void(ptr, int, ptr, int, int)
 896   ac_generic                    //  int(ptr, int, ptr, int, int)
 897 };
 898 
 899 static const TypeFunc* make_arraycopy_Type(ArrayCopyType act) {
 900   // create input type (domain)
 901   int num_args      = (act == ac_fast ? 3 : 5);
 902   int num_size_args = (act == ac_fast ? 1 : act == ac_checkcast ? 2 : 0);
 903   int argcnt = num_args;
 904   LP64_ONLY(argcnt += num_size_args); // halfwords for lengths
 905   const Type** fields = TypeTuple::fields(argcnt);
 906   int argp = TypeFunc::Parms;
 907   fields[argp++] = TypePtr::NOTNULL;    // src
 908   if (num_size_args == 0) {
 909     fields[argp++] = TypeInt::INT;      // src_pos
 910   }
 911   fields[argp++] = TypePtr::NOTNULL;    // dest
 912   if (num_size_args == 0) {
 913     fields[argp++] = TypeInt::INT;      // dest_pos
 914     fields[argp++] = TypeInt::INT;      // length
 915   }
 916   while (num_size_args-- > 0) {
 917     fields[argp++] = TypeX_X;               // size in whatevers (size_t)
 918     LP64_ONLY(fields[argp++] = Type::HALF); // other half of long length
 919   }
 920   if (act == ac_checkcast) {
 921     fields[argp++] = TypePtr::NOTNULL;  // super_klass
 922   }
 923   assert(argp == TypeFunc::Parms+argcnt, "correct decoding of act");
 924   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 925 
 926   // create result type if needed
 927   int retcnt = (act == ac_checkcast || act == ac_generic ? 1 : 0);
 928   fields = TypeTuple::fields(1);
 929   if (retcnt == 0)
 930     fields[TypeFunc::Parms+0] = nullptr; // void
 931   else
 932     fields[TypeFunc::Parms+0] = TypeInt::INT; // status result, if needed
 933   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+retcnt, fields);
 934   return TypeFunc::make(domain, range);
 935 }
 936 
 937 static const TypeFunc* make_array_fill_Type() {
 938   const Type** fields;
 939   int argp = TypeFunc::Parms;
 940   // create input type (domain): pointer, int, size_t
 941   fields = TypeTuple::fields(3 LP64_ONLY( + 1));
 942   fields[argp++] = TypePtr::NOTNULL;
 943   fields[argp++] = TypeInt::INT;
 944   fields[argp++] = TypeX_X;               // size in whatevers (size_t)
 945   LP64_ONLY(fields[argp++] = Type::HALF); // other half of long length
 946   const TypeTuple *domain = TypeTuple::make(argp, fields);
 947 
 948   // create result type
 949   fields = TypeTuple::fields(1);
 950   fields[TypeFunc::Parms+0] = nullptr; // void
 951   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
 952 
 953   return TypeFunc::make(domain, range);
 954 }
 955 
 956 static const TypeFunc* make_array_partition_Type() {
 957   // create input type (domain)
 958   int num_args = 7;
 959   int argcnt = num_args;
 960   const Type** fields = TypeTuple::fields(argcnt);
 961   int argp = TypeFunc::Parms;
 962   fields[argp++] = TypePtr::NOTNULL;  // array
 963   fields[argp++] = TypeInt::INT;      // element type
 964   fields[argp++] = TypeInt::INT;      // low
 965   fields[argp++] = TypeInt::INT;      // end
 966   fields[argp++] = TypePtr::NOTNULL;  // pivot_indices (int array)
 967   fields[argp++] = TypeInt::INT;      // indexPivot1
 968   fields[argp++] = TypeInt::INT;      // indexPivot2
 969   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
 970   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 971 
 972   // no result type needed
 973   fields = TypeTuple::fields(1);
 974   fields[TypeFunc::Parms+0] = nullptr; // void
 975   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
 976   return TypeFunc::make(domain, range);
 977 }
 978 
 979 static const TypeFunc* make_array_sort_Type() {
 980   // create input type (domain)
 981   int num_args      = 4;
 982   int argcnt = num_args;
 983   const Type** fields = TypeTuple::fields(argcnt);
 984   int argp = TypeFunc::Parms;
 985   fields[argp++] = TypePtr::NOTNULL;    // array
 986   fields[argp++] = TypeInt::INT;    // element type
 987   fields[argp++] = TypeInt::INT;    // fromIndex
 988   fields[argp++] = TypeInt::INT;    // toIndex
 989   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
 990   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 991 
 992   // no result type needed
 993   fields = TypeTuple::fields(1);
 994   fields[TypeFunc::Parms+0] = nullptr; // void
 995   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
 996   return TypeFunc::make(domain, range);
 997 }
 998 
 999 static const TypeFunc* make_aescrypt_block_Type() {
1000   // create input type (domain)
1001   int num_args      = 3;
1002   int argcnt = num_args;
1003   const Type** fields = TypeTuple::fields(argcnt);
1004   int argp = TypeFunc::Parms;
1005   fields[argp++] = TypePtr::NOTNULL;    // src
1006   fields[argp++] = TypePtr::NOTNULL;    // dest
1007   fields[argp++] = TypePtr::NOTNULL;    // k array
1008   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1009   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1010 
1011   // no result type needed
1012   fields = TypeTuple::fields(1);
1013   fields[TypeFunc::Parms+0] = nullptr; // void
1014   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1015   return TypeFunc::make(domain, range);
1016 }
1017 
1018 static const TypeFunc* make_updateBytesCRC32_Type() {
1019   // create input type (domain)
1020   int num_args      = 3;
1021   int argcnt = num_args;
1022   const Type** fields = TypeTuple::fields(argcnt);
1023   int argp = TypeFunc::Parms;
1024   fields[argp++] = TypeInt::INT;        // crc
1025   fields[argp++] = TypePtr::NOTNULL;    // src
1026   fields[argp++] = TypeInt::INT;        // len
1027   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1028   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1029 
1030   // result type needed
1031   fields = TypeTuple::fields(1);
1032   fields[TypeFunc::Parms+0] = TypeInt::INT; // crc result
1033   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
1034   return TypeFunc::make(domain, range);
1035 }
1036 
1037 static const TypeFunc* make_updateBytesCRC32C_Type() {
1038   // create input type (domain)
1039   int num_args      = 4;
1040   int argcnt = num_args;
1041   const Type** fields = TypeTuple::fields(argcnt);
1042   int argp = TypeFunc::Parms;
1043   fields[argp++] = TypeInt::INT;        // crc
1044   fields[argp++] = TypePtr::NOTNULL;    // buf
1045   fields[argp++] = TypeInt::INT;        // len
1046   fields[argp++] = TypePtr::NOTNULL;    // table
1047   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1048   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1049 
1050   // result type needed
1051   fields = TypeTuple::fields(1);
1052   fields[TypeFunc::Parms+0] = TypeInt::INT; // crc result
1053   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
1054   return TypeFunc::make(domain, range);
1055 }
1056 
1057 static const TypeFunc* make_updateBytesAdler32_Type() {
1058   // create input type (domain)
1059   int num_args      = 3;
1060   int argcnt = num_args;
1061   const Type** fields = TypeTuple::fields(argcnt);
1062   int argp = TypeFunc::Parms;
1063   fields[argp++] = TypeInt::INT;        // crc
1064   fields[argp++] = TypePtr::NOTNULL;    // src + offset
1065   fields[argp++] = TypeInt::INT;        // len
1066   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1067   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1068 
1069   // result type needed
1070   fields = TypeTuple::fields(1);
1071   fields[TypeFunc::Parms+0] = TypeInt::INT; // crc result
1072   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
1073   return TypeFunc::make(domain, range);
1074 }
1075 
1076 static const TypeFunc* make_cipherBlockChaining_aescrypt_Type() {
1077   // create input type (domain)
1078   int num_args      = 5;
1079   int argcnt = num_args;
1080   const Type** fields = TypeTuple::fields(argcnt);
1081   int argp = TypeFunc::Parms;
1082   fields[argp++] = TypePtr::NOTNULL;    // src
1083   fields[argp++] = TypePtr::NOTNULL;    // dest
1084   fields[argp++] = TypePtr::NOTNULL;    // k array
1085   fields[argp++] = TypePtr::NOTNULL;    // r array
1086   fields[argp++] = TypeInt::INT;        // src len
1087   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1088   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1089 
1090   // returning cipher len (int)
1091   fields = TypeTuple::fields(1);
1092   fields[TypeFunc::Parms+0] = TypeInt::INT;
1093   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
1094   return TypeFunc::make(domain, range);
1095 }
1096 
1097 static const TypeFunc* make_electronicCodeBook_aescrypt_Type() {
1098   // create input type (domain)
1099   int num_args = 4;
1100   int argcnt = num_args;
1101   const Type** fields = TypeTuple::fields(argcnt);
1102   int argp = TypeFunc::Parms;
1103   fields[argp++] = TypePtr::NOTNULL;    // src
1104   fields[argp++] = TypePtr::NOTNULL;    // dest
1105   fields[argp++] = TypePtr::NOTNULL;    // k array
1106   fields[argp++] = TypeInt::INT;        // src len
1107   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1108   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1109 
1110   // returning cipher len (int)
1111   fields = TypeTuple::fields(1);
1112   fields[TypeFunc::Parms + 0] = TypeInt::INT;
1113   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1114   return TypeFunc::make(domain, range);
1115 }
1116 
1117 static const TypeFunc* make_counterMode_aescrypt_Type() {
1118   // create input type (domain)
1119   int num_args = 7;
1120   int argcnt = num_args;
1121   const Type** fields = TypeTuple::fields(argcnt);
1122   int argp = TypeFunc::Parms;
1123   fields[argp++] = TypePtr::NOTNULL; // src
1124   fields[argp++] = TypePtr::NOTNULL; // dest
1125   fields[argp++] = TypePtr::NOTNULL; // k array
1126   fields[argp++] = TypePtr::NOTNULL; // counter array
1127   fields[argp++] = TypeInt::INT; // src len
1128   fields[argp++] = TypePtr::NOTNULL; // saved_encCounter
1129   fields[argp++] = TypePtr::NOTNULL; // saved used addr
1130   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1131   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1132   // returning cipher len (int)
1133   fields = TypeTuple::fields(1);
1134   fields[TypeFunc::Parms + 0] = TypeInt::INT;
1135   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1136   return TypeFunc::make(domain, range);
1137 }
1138 
1139 static const TypeFunc* make_galoisCounterMode_aescrypt_Type() {
1140   // create input type (domain)
1141   int num_args = 8;
1142   int argcnt = num_args;
1143   const Type** fields = TypeTuple::fields(argcnt);
1144   int argp = TypeFunc::Parms;
1145   fields[argp++] = TypePtr::NOTNULL; // byte[] in + inOfs
1146   fields[argp++] = TypeInt::INT;     // int len
1147   fields[argp++] = TypePtr::NOTNULL; // byte[] ct + ctOfs
1148   fields[argp++] = TypePtr::NOTNULL; // byte[] out + outOfs
1149   fields[argp++] = TypePtr::NOTNULL; // byte[] key from AESCrypt obj
1150   fields[argp++] = TypePtr::NOTNULL; // long[] state from GHASH obj
1151   fields[argp++] = TypePtr::NOTNULL; // long[] subkeyHtbl from GHASH obj
1152   fields[argp++] = TypePtr::NOTNULL; // byte[] counter from GCTR obj
1153 
1154   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1155   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1156   // returning cipher len (int)
1157   fields = TypeTuple::fields(1);
1158   fields[TypeFunc::Parms + 0] = TypeInt::INT;
1159   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1160   return TypeFunc::make(domain, range);
1161 }
1162 
1163 static const TypeFunc* make_digestBase_implCompress_Type(bool is_sha3) {
1164   // create input type (domain)
1165   int num_args = is_sha3 ? 3 : 2;
1166   int argcnt = num_args;
1167   const Type** fields = TypeTuple::fields(argcnt);
1168   int argp = TypeFunc::Parms;
1169   fields[argp++] = TypePtr::NOTNULL; // buf
1170   fields[argp++] = TypePtr::NOTNULL; // state
1171   if (is_sha3) fields[argp++] = TypeInt::INT; // block_size
1172   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1173   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1174 
1175   // no result type needed
1176   fields = TypeTuple::fields(1);
1177   fields[TypeFunc::Parms+0] = nullptr; // void
1178   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1179   return TypeFunc::make(domain, range);
1180 }
1181 
1182 /*
1183  * int implCompressMultiBlock(byte[] b, int ofs, int limit)
1184  */
1185 static const TypeFunc* make_digestBase_implCompressMB_Type(bool is_sha3) {
1186   // create input type (domain)
1187   int num_args = is_sha3 ? 5 : 4;
1188   int argcnt = num_args;
1189   const Type** fields = TypeTuple::fields(argcnt);
1190   int argp = TypeFunc::Parms;
1191   fields[argp++] = TypePtr::NOTNULL; // buf
1192   fields[argp++] = TypePtr::NOTNULL; // state
1193   if (is_sha3) fields[argp++] = TypeInt::INT; // block_size
1194   fields[argp++] = TypeInt::INT;     // ofs
1195   fields[argp++] = TypeInt::INT;     // limit
1196   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1197   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1198 
1199   // returning ofs (int)
1200   fields = TypeTuple::fields(1);
1201   fields[TypeFunc::Parms+0] = TypeInt::INT; // ofs
1202   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
1203   return TypeFunc::make(domain, range);
1204 }
1205 
1206 // SHAKE128Parallel doubleKeccak function
1207 static const TypeFunc* make_double_keccak_Type() {
1208     int argcnt = 2;
1209 
1210     const Type** fields = TypeTuple::fields(argcnt);
1211     int argp = TypeFunc::Parms;
1212     fields[argp++] = TypePtr::NOTNULL;      // status0
1213     fields[argp++] = TypePtr::NOTNULL;      // status1
1214 
1215     assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1216     const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1217 
1218     // result type needed
1219     fields = TypeTuple::fields(1);
1220     fields[TypeFunc::Parms + 0] = TypeInt::INT;
1221     const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1222     return TypeFunc::make(domain, range);
1223 }
1224 
1225 static const TypeFunc* make_multiplyToLen_Type() {
1226   // create input type (domain)
1227   int num_args      = 5;
1228   int argcnt = num_args;
1229   const Type** fields = TypeTuple::fields(argcnt);
1230   int argp = TypeFunc::Parms;
1231   fields[argp++] = TypePtr::NOTNULL;    // x
1232   fields[argp++] = TypeInt::INT;        // xlen
1233   fields[argp++] = TypePtr::NOTNULL;    // y
1234   fields[argp++] = TypeInt::INT;        // ylen
1235   fields[argp++] = TypePtr::NOTNULL;    // z
1236   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1237   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1238 
1239   // no result type needed
1240   fields = TypeTuple::fields(1);
1241   fields[TypeFunc::Parms+0] = nullptr;
1242   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1243   return TypeFunc::make(domain, range);
1244 }
1245 
1246 static const TypeFunc* make_squareToLen_Type() {
1247   // create input type (domain)
1248   int num_args      = 4;
1249   int argcnt = num_args;
1250   const Type** fields = TypeTuple::fields(argcnt);
1251   int argp = TypeFunc::Parms;
1252   fields[argp++] = TypePtr::NOTNULL;    // x
1253   fields[argp++] = TypeInt::INT;        // len
1254   fields[argp++] = TypePtr::NOTNULL;    // z
1255   fields[argp++] = TypeInt::INT;        // zlen
1256   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1257   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1258 
1259   // no result type needed
1260   fields = TypeTuple::fields(1);
1261   fields[TypeFunc::Parms+0] = nullptr;
1262   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1263   return TypeFunc::make(domain, range);
1264 }
1265 
1266 static const TypeFunc* make_mulAdd_Type() {
1267   // create input type (domain)
1268   int num_args      = 5;
1269   int argcnt = num_args;
1270   const Type** fields = TypeTuple::fields(argcnt);
1271   int argp = TypeFunc::Parms;
1272   fields[argp++] = TypePtr::NOTNULL;    // out
1273   fields[argp++] = TypePtr::NOTNULL;    // in
1274   fields[argp++] = TypeInt::INT;        // offset
1275   fields[argp++] = TypeInt::INT;        // len
1276   fields[argp++] = TypeInt::INT;        // k
1277   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1278   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1279 
1280   // returning carry (int)
1281   fields = TypeTuple::fields(1);
1282   fields[TypeFunc::Parms+0] = TypeInt::INT;
1283   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
1284   return TypeFunc::make(domain, range);
1285 }
1286 
1287 static const TypeFunc* make_montgomeryMultiply_Type() {
1288   // create input type (domain)
1289   int num_args      = 7;
1290   int argcnt = num_args;
1291   const Type** fields = TypeTuple::fields(argcnt);
1292   int argp = TypeFunc::Parms;
1293   fields[argp++] = TypePtr::NOTNULL;    // a
1294   fields[argp++] = TypePtr::NOTNULL;    // b
1295   fields[argp++] = TypePtr::NOTNULL;    // n
1296   fields[argp++] = TypeInt::INT;        // len
1297   fields[argp++] = TypeLong::LONG;      // inv
1298   fields[argp++] = Type::HALF;
1299   fields[argp++] = TypePtr::NOTNULL;    // result
1300   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1301   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1302 
1303   // result type needed
1304   fields = TypeTuple::fields(1);
1305   fields[TypeFunc::Parms+0] = TypePtr::NOTNULL;
1306 
1307   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1308   return TypeFunc::make(domain, range);
1309 }
1310 
1311 static const TypeFunc* make_montgomerySquare_Type() {
1312   // create input type (domain)
1313   int num_args      = 6;
1314   int argcnt = num_args;
1315   const Type** fields = TypeTuple::fields(argcnt);
1316   int argp = TypeFunc::Parms;
1317   fields[argp++] = TypePtr::NOTNULL;    // a
1318   fields[argp++] = TypePtr::NOTNULL;    // n
1319   fields[argp++] = TypeInt::INT;        // len
1320   fields[argp++] = TypeLong::LONG;      // inv
1321   fields[argp++] = Type::HALF;
1322   fields[argp++] = TypePtr::NOTNULL;    // result
1323   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1324   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1325 
1326   // result type needed
1327   fields = TypeTuple::fields(1);
1328   fields[TypeFunc::Parms+0] = TypePtr::NOTNULL;
1329 
1330   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1331   return TypeFunc::make(domain, range);
1332 }
1333 
1334 static const TypeFunc* make_bigIntegerShift_Type() {
1335   int argcnt = 5;
1336   const Type** fields = TypeTuple::fields(argcnt);
1337   int argp = TypeFunc::Parms;
1338   fields[argp++] = TypePtr::NOTNULL;    // newArr
1339   fields[argp++] = TypePtr::NOTNULL;    // oldArr
1340   fields[argp++] = TypeInt::INT;        // newIdx
1341   fields[argp++] = TypeInt::INT;        // shiftCount
1342   fields[argp++] = TypeInt::INT;        // numIter
1343   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1344   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1345 
1346   // no result type needed
1347   fields = TypeTuple::fields(1);
1348   fields[TypeFunc::Parms + 0] = nullptr;
1349   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1350   return TypeFunc::make(domain, range);
1351 }
1352 
1353 static const TypeFunc* make_vectorizedMismatch_Type() {
1354   // create input type (domain)
1355   int num_args = 4;
1356   int argcnt = num_args;
1357   const Type** fields = TypeTuple::fields(argcnt);
1358   int argp = TypeFunc::Parms;
1359   fields[argp++] = TypePtr::NOTNULL;    // obja
1360   fields[argp++] = TypePtr::NOTNULL;    // objb
1361   fields[argp++] = TypeInt::INT;        // length, number of elements
1362   fields[argp++] = TypeInt::INT;        // log2scale, element size
1363   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1364   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1365 
1366   //return mismatch index (int)
1367   fields = TypeTuple::fields(1);
1368   fields[TypeFunc::Parms + 0] = TypeInt::INT;
1369   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1370   return TypeFunc::make(domain, range);
1371 }
1372 
1373 static const TypeFunc* make_ghash_processBlocks_Type() {
1374   int argcnt = 4;
1375 
1376   const Type** fields = TypeTuple::fields(argcnt);
1377   int argp = TypeFunc::Parms;
1378   fields[argp++] = TypePtr::NOTNULL;    // state
1379   fields[argp++] = TypePtr::NOTNULL;    // subkeyH
1380   fields[argp++] = TypePtr::NOTNULL;    // data
1381   fields[argp++] = TypeInt::INT;        // blocks
1382   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
1383   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1384 
1385   // result type needed
1386   fields = TypeTuple::fields(1);
1387   fields[TypeFunc::Parms+0] = nullptr; // void
1388   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1389   return TypeFunc::make(domain, range);
1390 }
1391 
1392 static const TypeFunc* make_chacha20Block_Type() {
1393   int argcnt = 2;
1394 
1395   const Type** fields = TypeTuple::fields(argcnt);
1396   int argp = TypeFunc::Parms;
1397   fields[argp++] = TypePtr::NOTNULL;      // state
1398   fields[argp++] = TypePtr::NOTNULL;      // result
1399 
1400   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1401   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1402 
1403   // result type needed
1404   fields = TypeTuple::fields(1);
1405   fields[TypeFunc::Parms + 0] = TypeInt::INT;     // key stream outlen as int
1406   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1407   return TypeFunc::make(domain, range);
1408 }
1409 
1410 // Dilithium NTT function except for the final "normalization" to |coeff| < Q
1411 static const TypeFunc* make_dilithiumAlmostNtt_Type() {
1412     int argcnt = 2;
1413 
1414     const Type** fields = TypeTuple::fields(argcnt);
1415     int argp = TypeFunc::Parms;
1416     fields[argp++] = TypePtr::NOTNULL;      // coeffs
1417     fields[argp++] = TypePtr::NOTNULL;      // NTT zetas
1418 
1419     assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1420     const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1421 
1422     // result type needed
1423     fields = TypeTuple::fields(1);
1424     fields[TypeFunc::Parms + 0] = TypeInt::INT;
1425     const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1426     return TypeFunc::make(domain, range);
1427 }
1428 
1429 // Dilithium inverse NTT function except the final mod Q division by 2^256
1430 static const TypeFunc* make_dilithiumAlmostInverseNtt_Type() {
1431     int argcnt = 2;
1432 
1433     const Type** fields = TypeTuple::fields(argcnt);
1434     int argp = TypeFunc::Parms;
1435     fields[argp++] = TypePtr::NOTNULL;      // coeffs
1436     fields[argp++] = TypePtr::NOTNULL;      // inverse NTT zetas
1437 
1438     assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1439     const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1440 
1441     // result type needed
1442     fields = TypeTuple::fields(1);
1443     fields[TypeFunc::Parms + 0] = TypeInt::INT;
1444     const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1445     return TypeFunc::make(domain, range);
1446 }
1447 
1448 // Dilithium NTT multiply function
1449 static const TypeFunc* make_dilithiumNttMult_Type() {
1450     int argcnt = 3;
1451 
1452     const Type** fields = TypeTuple::fields(argcnt);
1453     int argp = TypeFunc::Parms;
1454     fields[argp++] = TypePtr::NOTNULL;      // result
1455     fields[argp++] = TypePtr::NOTNULL;      // ntta
1456     fields[argp++] = TypePtr::NOTNULL;      // nttb
1457 
1458     assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1459     const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1460 
1461     // result type needed
1462     fields = TypeTuple::fields(1);
1463     fields[TypeFunc::Parms + 0] = TypeInt::INT;
1464     const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1465     return TypeFunc::make(domain, range);
1466 }
1467 
1468 // Dilithium Montgomery multiply a polynome coefficient array by a constant
1469 static const TypeFunc* make_dilithiumMontMulByConstant_Type() {
1470     int argcnt = 2;
1471 
1472     const Type** fields = TypeTuple::fields(argcnt);
1473     int argp = TypeFunc::Parms;
1474     fields[argp++] = TypePtr::NOTNULL;      // coeffs
1475     fields[argp++] = TypeInt::INT;          // constant multiplier
1476 
1477     assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1478     const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1479 
1480     // result type needed
1481     fields = TypeTuple::fields(1);
1482     fields[TypeFunc::Parms + 0] = TypeInt::INT;
1483     const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1484     return TypeFunc::make(domain, range);
1485 }
1486 
1487 // Dilithium decompose polynomial
1488 static const TypeFunc* make_dilithiumDecomposePoly_Type() {
1489     int argcnt = 5;
1490 
1491     const Type** fields = TypeTuple::fields(argcnt);
1492     int argp = TypeFunc::Parms;
1493     fields[argp++] = TypePtr::NOTNULL;      // input
1494     fields[argp++] = TypePtr::NOTNULL;      // lowPart
1495     fields[argp++] = TypePtr::NOTNULL;      // highPart
1496     fields[argp++] = TypeInt::INT;          // 2 * gamma2
1497     fields[argp++] = TypeInt::INT;          // multiplier
1498 
1499     assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1500     const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms + argcnt, fields);
1501 
1502     // result type needed
1503     fields = TypeTuple::fields(1);
1504     fields[TypeFunc::Parms + 0] = TypeInt::INT;
1505     const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1506     return TypeFunc::make(domain, range);
1507 }
1508 
1509 static const TypeFunc* make_base64_encodeBlock_Type() {
1510   int argcnt = 6;
1511 
1512   const Type** fields = TypeTuple::fields(argcnt);
1513   int argp = TypeFunc::Parms;
1514   fields[argp++] = TypePtr::NOTNULL;    // src array
1515   fields[argp++] = TypeInt::INT;        // offset
1516   fields[argp++] = TypeInt::INT;        // length
1517   fields[argp++] = TypePtr::NOTNULL;    // dest array
1518   fields[argp++] = TypeInt::INT;       // dp
1519   fields[argp++] = TypeInt::BOOL;       // isURL
1520   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1521   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1522 
1523   // result type needed
1524   fields = TypeTuple::fields(1);
1525   fields[TypeFunc::Parms + 0] = nullptr; // void
1526   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1527   return TypeFunc::make(domain, range);
1528 }
1529 
1530 static const TypeFunc* make_string_IndexOf_Type() {
1531   int argcnt = 4;
1532 
1533   const Type** fields = TypeTuple::fields(argcnt);
1534   int argp = TypeFunc::Parms;
1535   fields[argp++] = TypePtr::NOTNULL;    // haystack array
1536   fields[argp++] = TypeInt::INT;        // haystack length
1537   fields[argp++] = TypePtr::NOTNULL;    // needle array
1538   fields[argp++] = TypeInt::INT;        // needle length
1539   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1540   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1541 
1542   // result type needed
1543   fields = TypeTuple::fields(1);
1544   fields[TypeFunc::Parms + 0] = TypeInt::INT; // Index of needle in haystack
1545   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1546   return TypeFunc::make(domain, range);
1547 }
1548 
1549 static const TypeFunc* make_base64_decodeBlock_Type() {
1550   int argcnt = 7;
1551 
1552   const Type** fields = TypeTuple::fields(argcnt);
1553   int argp = TypeFunc::Parms;
1554   fields[argp++] = TypePtr::NOTNULL;    // src array
1555   fields[argp++] = TypeInt::INT;        // src offset
1556   fields[argp++] = TypeInt::INT;        // src length
1557   fields[argp++] = TypePtr::NOTNULL;    // dest array
1558   fields[argp++] = TypeInt::INT;        // dest offset
1559   fields[argp++] = TypeInt::BOOL;       // isURL
1560   fields[argp++] = TypeInt::BOOL;       // isMIME
1561   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1562   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1563 
1564   // result type needed
1565   fields = TypeTuple::fields(1);
1566   fields[TypeFunc::Parms + 0] = TypeInt::INT; // count of bytes written to dst
1567   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms + 1, fields);
1568   return TypeFunc::make(domain, range);
1569 }
1570 
1571 static const TypeFunc* make_poly1305_processBlocks_Type() {
1572   int argcnt = 4;
1573 
1574   const Type** fields = TypeTuple::fields(argcnt);
1575   int argp = TypeFunc::Parms;
1576   fields[argp++] = TypePtr::NOTNULL;    // input array
1577   fields[argp++] = TypeInt::INT;        // input length
1578   fields[argp++] = TypePtr::NOTNULL;    // accumulator array
1579   fields[argp++] = TypePtr::NOTNULL;    // r array
1580   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1581   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1582 
1583   // result type needed
1584   fields = TypeTuple::fields(1);
1585   fields[TypeFunc::Parms + 0] = nullptr; // void
1586   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1587   return TypeFunc::make(domain, range);
1588 }
1589 
1590 static const TypeFunc* make_intpoly_montgomeryMult_P256_Type() {
1591   int argcnt = 3;
1592 
1593   const Type** fields = TypeTuple::fields(argcnt);
1594   int argp = TypeFunc::Parms;
1595   fields[argp++] = TypePtr::NOTNULL;    // a array
1596   fields[argp++] = TypePtr::NOTNULL;    // b array
1597   fields[argp++] = TypePtr::NOTNULL;    // r(esult) array
1598   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1599   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1600 
1601   // result type needed
1602   fields = TypeTuple::fields(1);
1603   fields[TypeFunc::Parms + 0] = nullptr; // void
1604   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1605   return TypeFunc::make(domain, range);
1606 }
1607 
1608 static const TypeFunc* make_intpoly_assign_Type() {
1609   int argcnt = 4;
1610 
1611   const Type** fields = TypeTuple::fields(argcnt);
1612   int argp = TypeFunc::Parms;
1613   fields[argp++] = TypeInt::INT;        // set flag
1614   fields[argp++] = TypePtr::NOTNULL;    // a array (result)
1615   fields[argp++] = TypePtr::NOTNULL;    // b array (if set is set)
1616   fields[argp++] = TypeInt::INT;        // array length
1617   assert(argp == TypeFunc::Parms + argcnt, "correct decoding");
1618   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
1619 
1620   // result type needed
1621   fields = TypeTuple::fields(1);
1622   fields[TypeFunc::Parms + 0] = nullptr; // void
1623   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
1624   return TypeFunc::make(domain, range);
1625 }
1626 
1627 //------------- Interpreter state for on stack replacement
1628 static const TypeFunc* make_osr_end_Type() {
1629   // create input type (domain)
1630   const Type **fields = TypeTuple::fields(1);
1631   fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // OSR temp buf
1632   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
1633 
1634   // create result type
1635   fields = TypeTuple::fields(1);
1636   // fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // locked oop
1637   fields[TypeFunc::Parms+0] = nullptr; // void
1638   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
1639   return TypeFunc::make(domain, range);
1640 }
1641 
1642 //-------------------------------------------------------------------------------------
1643 // register policy
1644 
1645 bool OptoRuntime::is_callee_saved_register(MachRegisterNumbers reg) {
1646   assert(reg >= 0 && reg < _last_Mach_Reg, "must be a machine register");
1647   switch (register_save_policy[reg]) {
1648     case 'C': return false; //SOC
1649     case 'E': return true ; //SOE
1650     case 'N': return false; //NS
1651     case 'A': return false; //AS
1652   }
1653   ShouldNotReachHere();
1654   return false;
1655 }
1656 
1657 //-----------------------------------------------------------------------
1658 // Exceptions
1659 //
1660 
1661 static void trace_exception(outputStream* st, oop exception_oop, address exception_pc, const char* msg);
1662 
1663 // The method is an entry that is always called by a C++ method not
1664 // directly from compiled code. Compiled code will call the C++ method following.
1665 // We can't allow async exception to be installed during  exception processing.
1666 JRT_ENTRY_NO_ASYNC(address, OptoRuntime::handle_exception_C_helper(JavaThread* current, nmethod* &nm))
1667   // The frame we rethrow the exception to might not have been processed by the GC yet.
1668   // The stack watermark barrier takes care of detecting that and ensuring the frame
1669   // has updated oops.
1670   StackWatermarkSet::after_unwind(current);
1671 
1672   // Do not confuse exception_oop with pending_exception. The exception_oop
1673   // is only used to pass arguments into the method. Not for general
1674   // exception handling.  DO NOT CHANGE IT to use pending_exception, since
1675   // the runtime stubs checks this on exit.
1676   assert(current->exception_oop() != nullptr, "exception oop is found");
1677   address handler_address = nullptr;
1678 
1679   Handle exception(current, current->exception_oop());
1680   address pc = current->exception_pc();
1681 
1682   // Clear out the exception oop and pc since looking up an
1683   // exception handler can cause class loading, which might throw an
1684   // exception and those fields are expected to be clear during
1685   // normal bytecode execution.
1686   current->clear_exception_oop_and_pc();
1687 
1688   LogTarget(Info, exceptions) lt;
1689   if (lt.is_enabled()) {
1690     ResourceMark rm;
1691     LogStream ls(lt);
1692     trace_exception(&ls, exception(), pc, "");
1693   }
1694 
1695   // for AbortVMOnException flag
1696   Exceptions::debug_check_abort(exception);
1697 
1698 #ifdef ASSERT
1699   if (!(exception->is_a(vmClasses::Throwable_klass()))) {
1700     // should throw an exception here
1701     ShouldNotReachHere();
1702   }
1703 #endif
1704 
1705   // new exception handling: this method is entered only from adapters
1706   // exceptions from compiled java methods are handled in compiled code
1707   // using rethrow node
1708 
1709   nm = CodeCache::find_nmethod(pc);
1710   assert(nm != nullptr, "No NMethod found");
1711   if (nm->is_native_method()) {
1712     fatal("Native method should not have path to exception handling");
1713   } else {
1714     // we are switching to old paradigm: search for exception handler in caller_frame
1715     // instead in exception handler of caller_frame.sender()
1716 
1717     if (JvmtiExport::can_post_on_exceptions()) {
1718       // "Full-speed catching" is not necessary here,
1719       // since we're notifying the VM on every catch.
1720       // Force deoptimization and the rest of the lookup
1721       // will be fine.
1722       deoptimize_caller_frame(current);
1723     }
1724 
1725     // Check the stack guard pages.  If enabled, look for handler in this frame;
1726     // otherwise, forcibly unwind the frame.
1727     //
1728     // 4826555: use default current sp for reguard_stack instead of &nm: it's more accurate.
1729     bool force_unwind = !current->stack_overflow_state()->reguard_stack();
1730     bool deopting = false;
1731     if (nm->is_deopt_pc(pc)) {
1732       deopting = true;
1733       RegisterMap map(current,
1734                       RegisterMap::UpdateMap::skip,
1735                       RegisterMap::ProcessFrames::include,
1736                       RegisterMap::WalkContinuation::skip);
1737       frame deoptee = current->last_frame().sender(&map);
1738       assert(deoptee.is_deoptimized_frame(), "must be deopted");
1739       // Adjust the pc back to the original throwing pc
1740       pc = deoptee.pc();
1741     }
1742 
1743     // If we are forcing an unwind because of stack overflow then deopt is
1744     // irrelevant since we are throwing the frame away anyway.
1745 
1746     if (deopting && !force_unwind) {
1747       handler_address = SharedRuntime::deopt_blob()->unpack_with_exception();
1748     } else {
1749 
1750       handler_address =
1751         force_unwind ? nullptr : nm->handler_for_exception_and_pc(exception, pc);
1752 
1753       if (handler_address == nullptr) {
1754         bool recursive_exception = false;
1755         handler_address = SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, force_unwind, true, recursive_exception);
1756         assert (handler_address != nullptr, "must have compiled handler");
1757         // Update the exception cache only when the unwind was not forced
1758         // and there didn't happen another exception during the computation of the
1759         // compiled exception handler. Checking for exception oop equality is not
1760         // sufficient because some exceptions are pre-allocated and reused.
1761         if (!force_unwind && !recursive_exception) {
1762           nm->add_handler_for_exception_and_pc(exception,pc,handler_address);
1763         }
1764       } else {
1765 #ifdef ASSERT
1766         bool recursive_exception = false;
1767         address computed_address = SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, force_unwind, true, recursive_exception);
1768         vmassert(recursive_exception || (handler_address == computed_address), "Handler address inconsistency: " PTR_FORMAT " != " PTR_FORMAT,
1769                  p2i(handler_address), p2i(computed_address));
1770 #endif
1771       }
1772     }
1773 
1774     current->set_exception_pc(pc);
1775     current->set_exception_handler_pc(handler_address);
1776 
1777     // Check if the exception PC is a MethodHandle call site.
1778     current->set_is_method_handle_return(nm->is_method_handle_return(pc));
1779   }
1780 
1781   // Restore correct return pc.  Was saved above.
1782   current->set_exception_oop(exception());
1783   return handler_address;
1784 
1785 JRT_END
1786 
1787 // We are entering here from exception_blob
1788 // If there is a compiled exception handler in this method, we will continue there;
1789 // otherwise we will unwind the stack and continue at the caller of top frame method
1790 // Note we enter without the usual JRT wrapper. We will call a helper routine that
1791 // will do the normal VM entry. We do it this way so that we can see if the nmethod
1792 // we looked up the handler for has been deoptimized in the meantime. If it has been
1793 // we must not use the handler and instead return the deopt blob.
1794 address OptoRuntime::handle_exception_C(JavaThread* current) {
1795 //
1796 // We are in Java not VM and in debug mode we have a NoHandleMark
1797 //
1798 #ifndef PRODUCT
1799   SharedRuntime::_find_handler_ctr++;          // find exception handler
1800 #endif
1801   debug_only(NoHandleMark __hm;)
1802   nmethod* nm = nullptr;
1803   address handler_address = nullptr;
1804   {
1805     // Enter the VM
1806 
1807     ResetNoHandleMark rnhm;
1808     handler_address = handle_exception_C_helper(current, nm);
1809   }
1810 
1811   // Back in java: Use no oops, DON'T safepoint
1812 
1813   // Now check to see if the handler we are returning is in a now
1814   // deoptimized frame
1815 
1816   if (nm != nullptr) {
1817     RegisterMap map(current,
1818                     RegisterMap::UpdateMap::skip,
1819                     RegisterMap::ProcessFrames::skip,
1820                     RegisterMap::WalkContinuation::skip);
1821     frame caller = current->last_frame().sender(&map);
1822 #ifdef ASSERT
1823     assert(caller.is_compiled_frame(), "must be");
1824 #endif // ASSERT
1825     if (caller.is_deoptimized_frame()) {
1826       handler_address = SharedRuntime::deopt_blob()->unpack_with_exception();
1827     }
1828   }
1829   return handler_address;
1830 }
1831 
1832 //------------------------------rethrow----------------------------------------
1833 // We get here after compiled code has executed a 'RethrowNode'.  The callee
1834 // is either throwing or rethrowing an exception.  The callee-save registers
1835 // have been restored, synchronized objects have been unlocked and the callee
1836 // stack frame has been removed.  The return address was passed in.
1837 // Exception oop is passed as the 1st argument.  This routine is then called
1838 // from the stub.  On exit, we know where to jump in the caller's code.
1839 // After this C code exits, the stub will pop his frame and end in a jump
1840 // (instead of a return).  We enter the caller's default handler.
1841 //
1842 // This must be JRT_LEAF:
1843 //     - caller will not change its state as we cannot block on exit,
1844 //       therefore raw_exception_handler_for_return_address is all it takes
1845 //       to handle deoptimized blobs
1846 //
1847 // However, there needs to be a safepoint check in the middle!  So compiled
1848 // safepoints are completely watertight.
1849 //
1850 // Thus, it cannot be a leaf since it contains the NoSafepointVerifier.
1851 //
1852 // *THIS IS NOT RECOMMENDED PROGRAMMING STYLE*
1853 //
1854 address OptoRuntime::rethrow_C(oopDesc* exception, JavaThread* thread, address ret_pc) {
1855   // ret_pc will have been loaded from the stack, so for AArch64 will be signed.
1856   AARCH64_PORT_ONLY(ret_pc = pauth_strip_verifiable(ret_pc));
1857 
1858 #ifndef PRODUCT
1859   SharedRuntime::_rethrow_ctr++;               // count rethrows
1860 #endif
1861   assert (exception != nullptr, "should have thrown a NullPointerException");
1862 #ifdef ASSERT
1863   if (!(exception->is_a(vmClasses::Throwable_klass()))) {
1864     // should throw an exception here
1865     ShouldNotReachHere();
1866   }
1867 #endif
1868 
1869   thread->set_vm_result(exception);
1870   // Frame not compiled (handles deoptimization blob)
1871   return SharedRuntime::raw_exception_handler_for_return_address(thread, ret_pc);
1872 }
1873 
1874 static const TypeFunc* make_rethrow_Type() {
1875   // create input type (domain)
1876   const Type **fields = TypeTuple::fields(1);
1877   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Exception oop
1878   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1,fields);
1879 
1880   // create result type (range)
1881   fields = TypeTuple::fields(1);
1882   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Exception oop
1883   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
1884 
1885   return TypeFunc::make(domain, range);
1886 }
1887 
1888 
1889 void OptoRuntime::deoptimize_caller_frame(JavaThread *thread, bool doit) {
1890   // Deoptimize the caller before continuing, as the compiled
1891   // exception handler table may not be valid.
1892   if (!StressCompiledExceptionHandlers && doit) {
1893     deoptimize_caller_frame(thread);
1894   }
1895 }
1896 
1897 void OptoRuntime::deoptimize_caller_frame(JavaThread *thread) {
1898   // Called from within the owner thread, so no need for safepoint
1899   RegisterMap reg_map(thread,
1900                       RegisterMap::UpdateMap::include,
1901                       RegisterMap::ProcessFrames::include,
1902                       RegisterMap::WalkContinuation::skip);
1903   frame stub_frame = thread->last_frame();
1904   assert(stub_frame.is_runtime_frame() || exception_blob()->contains(stub_frame.pc()), "sanity check");
1905   frame caller_frame = stub_frame.sender(&reg_map);
1906 
1907   // Deoptimize the caller frame.
1908   Deoptimization::deoptimize_frame(thread, caller_frame.id());
1909 }
1910 
1911 
1912 bool OptoRuntime::is_deoptimized_caller_frame(JavaThread *thread) {
1913   // Called from within the owner thread, so no need for safepoint
1914   RegisterMap reg_map(thread,
1915                       RegisterMap::UpdateMap::include,
1916                       RegisterMap::ProcessFrames::include,
1917                       RegisterMap::WalkContinuation::skip);
1918   frame stub_frame = thread->last_frame();
1919   assert(stub_frame.is_runtime_frame() || exception_blob()->contains(stub_frame.pc()), "sanity check");
1920   frame caller_frame = stub_frame.sender(&reg_map);
1921   return caller_frame.is_deoptimized_frame();
1922 }
1923 
1924 static const TypeFunc* make_register_finalizer_Type() {
1925   // create input type (domain)
1926   const Type **fields = TypeTuple::fields(1);
1927   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;  // oop;          Receiver
1928   // // The JavaThread* is passed to each routine as the last argument
1929   // fields[TypeFunc::Parms+1] = TypeRawPtr::NOTNULL;  // JavaThread *; Executing thread
1930   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1,fields);
1931 
1932   // create result type (range)
1933   fields = TypeTuple::fields(0);
1934 
1935   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
1936 
1937   return TypeFunc::make(domain,range);
1938 }
1939 
1940 #if INCLUDE_JFR
1941 static const TypeFunc* make_class_id_load_barrier_Type() {
1942   // create input type (domain)
1943   const Type **fields = TypeTuple::fields(1);
1944   fields[TypeFunc::Parms+0] = TypeInstPtr::KLASS;
1945   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms + 1, fields);
1946 
1947   // create result type (range)
1948   fields = TypeTuple::fields(0);
1949 
1950   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms + 0, fields);
1951 
1952   return TypeFunc::make(domain,range);
1953 }
1954 #endif // INCLUDE_JFR
1955 
1956 //-----------------------------------------------------------------------------
1957 static const TypeFunc* make_dtrace_method_entry_exit_Type() {
1958   // create input type (domain)
1959   const Type **fields = TypeTuple::fields(2);
1960   fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // Thread-local storage
1961   fields[TypeFunc::Parms+1] = TypeMetadataPtr::BOTTOM;  // Method*;    Method we are entering
1962   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
1963 
1964   // create result type (range)
1965   fields = TypeTuple::fields(0);
1966 
1967   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
1968 
1969   return TypeFunc::make(domain,range);
1970 }
1971 
1972 static const TypeFunc* make_dtrace_object_alloc_Type() {
1973   // create input type (domain)
1974   const Type **fields = TypeTuple::fields(2);
1975   fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // Thread-local storage
1976   fields[TypeFunc::Parms+1] = TypeInstPtr::NOTNULL;  // oop;    newly allocated object
1977 
1978   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
1979 
1980   // create result type (range)
1981   fields = TypeTuple::fields(0);
1982 
1983   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
1984 
1985   return TypeFunc::make(domain,range);
1986 }
1987 
1988 JRT_ENTRY_NO_ASYNC(void, OptoRuntime::register_finalizer_C(oopDesc* obj, JavaThread* current))
1989   assert(oopDesc::is_oop(obj), "must be a valid oop");
1990   assert(obj->klass()->has_finalizer(), "shouldn't be here otherwise");
1991   InstanceKlass::register_finalizer(instanceOop(obj), CHECK);
1992 JRT_END
1993 
1994 //-----------------------------------------------------------------------------
1995 
1996 NamedCounter * volatile OptoRuntime::_named_counters = nullptr;
1997 
1998 //
1999 // dump the collected NamedCounters.
2000 //
2001 void OptoRuntime::print_named_counters() {
2002   int total_lock_count = 0;
2003   int eliminated_lock_count = 0;
2004 
2005   NamedCounter* c = _named_counters;
2006   while (c) {
2007     if (c->tag() == NamedCounter::LockCounter || c->tag() == NamedCounter::EliminatedLockCounter) {
2008       int count = c->count();
2009       if (count > 0) {
2010         bool eliminated = c->tag() == NamedCounter::EliminatedLockCounter;
2011         if (Verbose) {
2012           tty->print_cr("%d %s%s", count, c->name(), eliminated ? " (eliminated)" : "");
2013         }
2014         total_lock_count += count;
2015         if (eliminated) {
2016           eliminated_lock_count += count;
2017         }
2018       }
2019     }
2020     c = c->next();
2021   }
2022   if (total_lock_count > 0) {
2023     tty->print_cr("dynamic locks: %d", total_lock_count);
2024     if (eliminated_lock_count) {
2025       tty->print_cr("eliminated locks: %d (%d%%)", eliminated_lock_count,
2026                     (int)(eliminated_lock_count * 100.0 / total_lock_count));
2027     }
2028   }
2029 }
2030 
2031 //
2032 //  Allocate a new NamedCounter.  The JVMState is used to generate the
2033 //  name which consists of method@line for the inlining tree.
2034 //
2035 
2036 NamedCounter* OptoRuntime::new_named_counter(JVMState* youngest_jvms, NamedCounter::CounterTag tag) {
2037   int max_depth = youngest_jvms->depth();
2038 
2039   // Visit scopes from youngest to oldest.
2040   bool first = true;
2041   stringStream st;
2042   for (int depth = max_depth; depth >= 1; depth--) {
2043     JVMState* jvms = youngest_jvms->of_depth(depth);
2044     ciMethod* m = jvms->has_method() ? jvms->method() : nullptr;
2045     if (!first) {
2046       st.print(" ");
2047     } else {
2048       first = false;
2049     }
2050     int bci = jvms->bci();
2051     if (bci < 0) bci = 0;
2052     if (m != nullptr) {
2053       st.print("%s.%s", m->holder()->name()->as_utf8(), m->name()->as_utf8());
2054     } else {
2055       st.print("no method");
2056     }
2057     st.print("@%d", bci);
2058     // To print linenumbers instead of bci use: m->line_number_from_bci(bci)
2059   }
2060   NamedCounter* c = new NamedCounter(st.freeze(), tag);
2061 
2062   // atomically add the new counter to the head of the list.  We only
2063   // add counters so this is safe.
2064   NamedCounter* head;
2065   do {
2066     c->set_next(nullptr);
2067     head = _named_counters;
2068     c->set_next(head);
2069   } while (Atomic::cmpxchg(&_named_counters, head, c) != head);
2070   return c;
2071 }
2072 
2073 void OptoRuntime::initialize_types() {
2074   _new_instance_Type                  = make_new_instance_Type();
2075   _new_array_Type                     = make_new_array_Type();
2076   _multianewarray2_Type               = multianewarray_Type(2);
2077   _multianewarray3_Type               = multianewarray_Type(3);
2078   _multianewarray4_Type               = multianewarray_Type(4);
2079   _multianewarray5_Type               = multianewarray_Type(5);
2080   _multianewarrayN_Type               = make_multianewarrayN_Type();
2081   _complete_monitor_enter_Type        = make_complete_monitor_enter_Type();
2082   _complete_monitor_exit_Type         = make_complete_monitor_exit_Type();
2083   _monitor_notify_Type                = make_monitor_notify_Type();
2084   _uncommon_trap_Type                 = make_uncommon_trap_Type();
2085   _athrow_Type                        = make_athrow_Type();
2086   _rethrow_Type                       = make_rethrow_Type();
2087   _Math_D_D_Type                      = make_Math_D_D_Type();
2088   _Math_DD_D_Type                     = make_Math_DD_D_Type();
2089   _modf_Type                          = make_modf_Type();
2090   _l2f_Type                           = make_l2f_Type();
2091   _void_long_Type                     = make_void_long_Type();
2092   _void_void_Type                     = make_void_void_Type();
2093   _jfr_write_checkpoint_Type          = make_jfr_write_checkpoint_Type();
2094   _flush_windows_Type                 = make_flush_windows_Type();
2095   _fast_arraycopy_Type                = make_arraycopy_Type(ac_fast);
2096   _checkcast_arraycopy_Type           = make_arraycopy_Type(ac_checkcast);
2097   _generic_arraycopy_Type             = make_arraycopy_Type(ac_generic);
2098   _slow_arraycopy_Type                = make_arraycopy_Type(ac_slow);
2099   _unsafe_setmemory_Type              = make_setmemory_Type();
2100   _array_fill_Type                    = make_array_fill_Type();
2101   _array_sort_Type                    = make_array_sort_Type();
2102   _array_partition_Type               = make_array_partition_Type();
2103   _aescrypt_block_Type                = make_aescrypt_block_Type();
2104   _cipherBlockChaining_aescrypt_Type  = make_cipherBlockChaining_aescrypt_Type();
2105   _electronicCodeBook_aescrypt_Type   = make_electronicCodeBook_aescrypt_Type();
2106   _counterMode_aescrypt_Type          = make_counterMode_aescrypt_Type();
2107   _galoisCounterMode_aescrypt_Type    = make_galoisCounterMode_aescrypt_Type();
2108   _digestBase_implCompress_with_sha3_Type      = make_digestBase_implCompress_Type(  /* is_sha3= */ true);
2109   _digestBase_implCompress_without_sha3_Type   = make_digestBase_implCompress_Type(  /* is_sha3= */ false);;
2110   _digestBase_implCompressMB_with_sha3_Type    = make_digestBase_implCompressMB_Type(/* is_sha3= */ true);
2111   _digestBase_implCompressMB_without_sha3_Type = make_digestBase_implCompressMB_Type(/* is_sha3= */ false);
2112   _double_keccak_Type                 = make_double_keccak_Type();
2113   _multiplyToLen_Type                 = make_multiplyToLen_Type();
2114   _montgomeryMultiply_Type            = make_montgomeryMultiply_Type();
2115   _montgomerySquare_Type              = make_montgomerySquare_Type();
2116   _squareToLen_Type                   = make_squareToLen_Type();
2117   _mulAdd_Type                        = make_mulAdd_Type();
2118   _bigIntegerShift_Type               = make_bigIntegerShift_Type();
2119   _vectorizedMismatch_Type            = make_vectorizedMismatch_Type();
2120   _ghash_processBlocks_Type           = make_ghash_processBlocks_Type();
2121   _chacha20Block_Type                 = make_chacha20Block_Type();
2122 
2123   _dilithiumAlmostNtt_Type            = make_dilithiumAlmostNtt_Type();
2124   _dilithiumAlmostInverseNtt_Type     = make_dilithiumAlmostInverseNtt_Type();
2125   _dilithiumNttMult_Type              = make_dilithiumNttMult_Type();
2126   _dilithiumMontMulByConstant_Type    = make_dilithiumMontMulByConstant_Type();
2127   _dilithiumDecomposePoly_Type        = make_dilithiumDecomposePoly_Type();
2128 
2129   _base64_encodeBlock_Type            = make_base64_encodeBlock_Type();
2130   _base64_decodeBlock_Type            = make_base64_decodeBlock_Type();
2131   _string_IndexOf_Type                = make_string_IndexOf_Type();
2132   _poly1305_processBlocks_Type        = make_poly1305_processBlocks_Type();
2133   _intpoly_montgomeryMult_P256_Type   = make_intpoly_montgomeryMult_P256_Type();
2134   _intpoly_assign_Type                = make_intpoly_assign_Type();
2135   _updateBytesCRC32_Type              = make_updateBytesCRC32_Type();
2136   _updateBytesCRC32C_Type             = make_updateBytesCRC32C_Type();
2137   _updateBytesAdler32_Type            = make_updateBytesAdler32_Type();
2138   _osr_end_Type                       = make_osr_end_Type();
2139   _register_finalizer_Type            = make_register_finalizer_Type();
2140   JFR_ONLY(
2141     _class_id_load_barrier_Type       = make_class_id_load_barrier_Type();
2142   )
2143 #if INCLUDE_JVMTI
2144   _notify_jvmti_vthread_Type          = make_notify_jvmti_vthread_Type();
2145 #endif // INCLUDE_JVMTI
2146   _dtrace_method_entry_exit_Type      = make_dtrace_method_entry_exit_Type();
2147   _dtrace_object_alloc_Type           = make_dtrace_object_alloc_Type();
2148 }
2149 
2150 int trace_exception_counter = 0;
2151 static void trace_exception(outputStream* st, oop exception_oop, address exception_pc, const char* msg) {
2152   trace_exception_counter++;
2153   stringStream tempst;
2154 
2155   tempst.print("%d [Exception (%s): ", trace_exception_counter, msg);
2156   exception_oop->print_value_on(&tempst);
2157   tempst.print(" in ");
2158   CodeBlob* blob = CodeCache::find_blob(exception_pc);
2159   if (blob->is_nmethod()) {
2160     blob->as_nmethod()->method()->print_value_on(&tempst);
2161   } else if (blob->is_runtime_stub()) {
2162     tempst.print("<runtime-stub>");
2163   } else {
2164     tempst.print("<unknown>");
2165   }
2166   tempst.print(" at " INTPTR_FORMAT,  p2i(exception_pc));
2167   tempst.print("]");
2168 
2169   st->print_raw_cr(tempst.freeze());
2170 }