1 /*
   2  * Copyright (c) 1998, 2014, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "classfile/systemDictionary.hpp"
  27 #include "classfile/vmSymbols.hpp"
  28 #include "code/codeCache.hpp"
  29 #include "code/compiledIC.hpp"
  30 #include "code/icBuffer.hpp"
  31 #include "code/nmethod.hpp"
  32 #include "code/pcDesc.hpp"
  33 #include "code/scopeDesc.hpp"
  34 #include "code/vtableStubs.hpp"
  35 #include "compiler/compileBroker.hpp"
  36 #include "compiler/compilerOracle.hpp"
  37 #include "compiler/oopMap.hpp"
  38 #include "gc_implementation/g1/g1SATBCardTableModRefBS.hpp"
  39 #include "gc_implementation/g1/heapRegion.hpp"
  40 #include "gc_interface/collectedHeap.hpp"
  41 #include "interpreter/bytecode.hpp"
  42 #include "interpreter/interpreter.hpp"
  43 #include "interpreter/linkResolver.hpp"
  44 #include "memory/barrierSet.hpp"
  45 #include "memory/gcLocker.inline.hpp"
  46 #include "memory/oopFactory.hpp"
  47 #include "oops/objArrayKlass.hpp"
  48 #include "oops/oop.inline.hpp"
  49 #include "opto/ad.hpp"
  50 #include "opto/addnode.hpp"
  51 #include "opto/callnode.hpp"
  52 #include "opto/cfgnode.hpp"
  53 #include "opto/graphKit.hpp"
  54 #include "opto/machnode.hpp"
  55 #include "opto/matcher.hpp"
  56 #include "opto/memnode.hpp"
  57 #include "opto/mulnode.hpp"
  58 #include "opto/runtime.hpp"
  59 #include "opto/subnode.hpp"
  60 #include "runtime/atomic.inline.hpp"
  61 #include "runtime/fprofiler.hpp"
  62 #include "runtime/handles.inline.hpp"
  63 #include "runtime/interfaceSupport.hpp"
  64 #include "runtime/javaCalls.hpp"
  65 #include "runtime/sharedRuntime.hpp"
  66 #include "runtime/signature.hpp"
  67 #include "runtime/threadCritical.hpp"
  68 #include "runtime/vframe.hpp"
  69 #include "runtime/vframeArray.hpp"
  70 #include "runtime/vframe_hp.hpp"
  71 #include "utilities/copy.hpp"
  72 #include "utilities/preserveException.hpp"
  73 
  74 
  75 // For debugging purposes:
  76 //  To force FullGCALot inside a runtime function, add the following two lines
  77 //
  78 //  Universe::release_fullgc_alot_dummy();
  79 //  MarkSweep::invoke(0, "Debugging");
  80 //
  81 // At command line specify the parameters: -XX:+FullGCALot -XX:FullGCALotStart=100000000
  82 
  83 
  84 
  85 
  86 // Compiled code entry points
  87 address OptoRuntime::_new_instance_Java                           = NULL;
  88 address OptoRuntime::_new_array_Java                              = NULL;
  89 address OptoRuntime::_new_array_nozero_Java                       = NULL;
  90 address OptoRuntime::_multianewarray2_Java                        = NULL;
  91 address OptoRuntime::_multianewarray3_Java                        = NULL;
  92 address OptoRuntime::_multianewarray4_Java                        = NULL;
  93 address OptoRuntime::_multianewarray5_Java                        = NULL;
  94 address OptoRuntime::_multianewarrayN_Java                        = NULL;
  95 address OptoRuntime::_g1_wb_pre_Java                              = NULL;
  96 address OptoRuntime::_g1_wb_post_Java                             = NULL;
  97 address OptoRuntime::_vtable_must_compile_Java                    = NULL;
  98 address OptoRuntime::_complete_monitor_locking_Java               = NULL;
  99 address OptoRuntime::_rethrow_Java                                = NULL;
 100 
 101 address OptoRuntime::_slow_arraycopy_Java                         = NULL;
 102 address OptoRuntime::_register_finalizer_Java                     = NULL;
 103 
 104 # ifdef ENABLE_ZAP_DEAD_LOCALS
 105 address OptoRuntime::_zap_dead_Java_locals_Java                   = NULL;
 106 address OptoRuntime::_zap_dead_native_locals_Java                 = NULL;
 107 # endif
 108 
 109 ExceptionBlob* OptoRuntime::_exception_blob;
 110 
 111 // This should be called in an assertion at the start of OptoRuntime routines
 112 // which are entered from compiled code (all of them)
 113 #ifdef ASSERT
 114 static bool check_compiled_frame(JavaThread* thread) {
 115   assert(thread->last_frame().is_runtime_frame(), "cannot call runtime directly from compiled code");
 116   RegisterMap map(thread, false);
 117   frame caller = thread->last_frame().sender(&map);
 118   assert(caller.is_compiled_frame(), "not being called from compiled like code");
 119   return true;
 120 }
 121 #endif // ASSERT
 122 
 123 
 124 #define gen(env, var, type_func_gen, c_func, fancy_jump, pass_tls, save_arg_regs, return_pc) \
 125   var = generate_stub(env, type_func_gen, CAST_FROM_FN_PTR(address, c_func), #var, fancy_jump, pass_tls, save_arg_regs, return_pc); \
 126   if (var == NULL) { return false; }
 127 
 128 bool OptoRuntime::generate(ciEnv* env) {
 129 
 130   generate_exception_blob();
 131 
 132   // Note: tls: Means fetching the return oop out of the thread-local storage
 133   //
 134   //   variable/name                       type-function-gen              , runtime method                  ,fncy_jp, tls,save_args,retpc
 135   // -------------------------------------------------------------------------------------------------------------------------------
 136   gen(env, _new_instance_Java              , new_instance_Type            , new_instance_C                  ,    0 , true , false, false);
 137   gen(env, _new_array_Java                 , new_array_Type               , new_array_C                     ,    0 , true , false, false);
 138   gen(env, _new_array_nozero_Java          , new_array_Type               , new_array_nozero_C              ,    0 , true , false, false);
 139   gen(env, _multianewarray2_Java           , multianewarray2_Type         , multianewarray2_C               ,    0 , true , false, false);
 140   gen(env, _multianewarray3_Java           , multianewarray3_Type         , multianewarray3_C               ,    0 , true , false, false);
 141   gen(env, _multianewarray4_Java           , multianewarray4_Type         , multianewarray4_C               ,    0 , true , false, false);
 142   gen(env, _multianewarray5_Java           , multianewarray5_Type         , multianewarray5_C               ,    0 , true , false, false);
 143   gen(env, _multianewarrayN_Java           , multianewarrayN_Type         , multianewarrayN_C               ,    0 , true , false, false);
 144   gen(env, _g1_wb_pre_Java                 , g1_wb_pre_Type               , SharedRuntime::g1_wb_pre        ,    0 , false, false, false);
 145   gen(env, _g1_wb_post_Java                , g1_wb_post_Type              , SharedRuntime::g1_wb_post       ,    0 , false, false, false);
 146   gen(env, _complete_monitor_locking_Java  , complete_monitor_enter_Type  , SharedRuntime::complete_monitor_locking_C, 0, false, false, false);
 147   gen(env, _rethrow_Java                   , rethrow_Type                 , rethrow_C                       ,    2 , true , false, true );
 148 
 149   gen(env, _slow_arraycopy_Java            , slow_arraycopy_Type          , SharedRuntime::slow_arraycopy_C ,    0 , false, false, false);
 150   gen(env, _register_finalizer_Java        , register_finalizer_Type      , register_finalizer              ,    0 , false, false, false);
 151 
 152 # ifdef ENABLE_ZAP_DEAD_LOCALS
 153   gen(env, _zap_dead_Java_locals_Java      , zap_dead_locals_Type         , zap_dead_Java_locals_C          ,    0 , false, true , false );
 154   gen(env, _zap_dead_native_locals_Java    , zap_dead_locals_Type         , zap_dead_native_locals_C        ,    0 , false, true , false );
 155 # endif
 156   return true;
 157 }
 158 
 159 #undef gen
 160 
 161 
 162 // Helper method to do generation of RunTimeStub's
 163 address OptoRuntime::generate_stub( ciEnv* env,
 164                                     TypeFunc_generator gen, address C_function,
 165                                     const char *name, int is_fancy_jump,
 166                                     bool pass_tls,
 167                                     bool save_argument_registers,
 168                                     bool return_pc ) {
 169   ResourceMark rm;
 170   Compile C( env, gen, C_function, name, is_fancy_jump, pass_tls, save_argument_registers, return_pc );
 171   return  C.stub_entry_point();
 172 }
 173 
 174 const char* OptoRuntime::stub_name(address entry) {
 175 #ifndef PRODUCT
 176   CodeBlob* cb = CodeCache::find_blob(entry);
 177   RuntimeStub* rs =(RuntimeStub *)cb;
 178   assert(rs != NULL && rs->is_runtime_stub(), "not a runtime stub");
 179   return rs->name();
 180 #else
 181   // Fast implementation for product mode (maybe it should be inlined too)
 182   return "runtime stub";
 183 #endif
 184 }
 185 
 186 
 187 //=============================================================================
 188 // Opto compiler runtime routines
 189 //=============================================================================
 190 
 191 
 192 //=============================allocation======================================
 193 // We failed the fast-path allocation.  Now we need to do a scavenge or GC
 194 // and try allocation again.
 195 
 196 void OptoRuntime::new_store_pre_barrier(JavaThread* thread) {
 197   // After any safepoint, just before going back to compiled code,
 198   // we inform the GC that we will be doing initializing writes to
 199   // this object in the future without emitting card-marks, so
 200   // GC may take any compensating steps.
 201   // NOTE: Keep this code consistent with GraphKit::store_barrier.
 202 
 203   oop new_obj = thread->vm_result();
 204   if (new_obj == NULL)  return;
 205 
 206   assert(Universe::heap()->can_elide_tlab_store_barriers(),
 207          "compiler must check this first");
 208   // GC may decide to give back a safer copy of new_obj.
 209   new_obj = Universe::heap()->new_store_pre_barrier(thread, new_obj);
 210   thread->set_vm_result(new_obj);
 211 }
 212 
 213 // object allocation
 214 JRT_BLOCK_ENTRY(void, OptoRuntime::new_instance_C(Klass* klass, JavaThread* thread))
 215   JRT_BLOCK;
 216 #ifndef PRODUCT
 217   SharedRuntime::_new_instance_ctr++;         // new instance requires GC
 218 #endif
 219   assert(check_compiled_frame(thread), "incorrect caller");
 220 
 221   // These checks are cheap to make and support reflective allocation.
 222   int lh = klass->layout_helper();
 223   if (Klass::layout_helper_needs_slow_path(lh)
 224       || !InstanceKlass::cast(klass)->is_initialized()) {
 225     KlassHandle kh(THREAD, klass);
 226     kh->check_valid_for_instantiation(false, THREAD);
 227     if (!HAS_PENDING_EXCEPTION) {
 228       InstanceKlass::cast(kh())->initialize(THREAD);
 229     }
 230     if (!HAS_PENDING_EXCEPTION) {
 231       klass = kh();
 232     } else {
 233       klass = NULL;
 234     }
 235   }
 236 
 237   if (klass != NULL) {
 238     // Scavenge and allocate an instance.
 239     oop result = InstanceKlass::cast(klass)->allocate_instance(THREAD);
 240     thread->set_vm_result(result);
 241 
 242     // Pass oops back through thread local storage.  Our apparent type to Java
 243     // is that we return an oop, but we can block on exit from this routine and
 244     // a GC can trash the oop in C's return register.  The generated stub will
 245     // fetch the oop from TLS after any possible GC.
 246   }
 247 
 248   deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
 249   JRT_BLOCK_END;
 250 
 251   if (GraphKit::use_ReduceInitialCardMarks()) {
 252     // inform GC that we won't do card marks for initializing writes.
 253     new_store_pre_barrier(thread);
 254   }
 255 JRT_END
 256 
 257 
 258 // array allocation
 259 JRT_BLOCK_ENTRY(void, OptoRuntime::new_array_C(Klass* array_type, int len, JavaThread *thread))
 260   JRT_BLOCK;
 261 #ifndef PRODUCT
 262   SharedRuntime::_new_array_ctr++;            // new array requires GC
 263 #endif
 264   assert(check_compiled_frame(thread), "incorrect caller");
 265 
 266   // Scavenge and allocate an instance.
 267   oop result;
 268 
 269   if (array_type->oop_is_typeArray()) {
 270     // The oopFactory likes to work with the element type.
 271     // (We could bypass the oopFactory, since it doesn't add much value.)
 272     BasicType elem_type = TypeArrayKlass::cast(array_type)->element_type();
 273     result = oopFactory::new_typeArray(elem_type, len, THREAD);
 274   } else {
 275     // Although the oopFactory likes to work with the elem_type,
 276     // the compiler prefers the array_type, since it must already have
 277     // that latter value in hand for the fast path.
 278     Klass* elem_type = ObjArrayKlass::cast(array_type)->element_klass();
 279     result = oopFactory::new_objArray(elem_type, len, THREAD);
 280   }
 281 
 282   // Pass oops back through thread local storage.  Our apparent type to Java
 283   // is that we return an oop, but we can block on exit from this routine and
 284   // a GC can trash the oop in C's return register.  The generated stub will
 285   // fetch the oop from TLS after any possible GC.
 286   deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
 287   thread->set_vm_result(result);
 288   JRT_BLOCK_END;
 289 
 290   if (GraphKit::use_ReduceInitialCardMarks()) {
 291     // inform GC that we won't do card marks for initializing writes.
 292     new_store_pre_barrier(thread);
 293   }
 294 JRT_END
 295 
 296 // array allocation without zeroing
 297 JRT_BLOCK_ENTRY(void, OptoRuntime::new_array_nozero_C(Klass* array_type, int len, JavaThread *thread))
 298   JRT_BLOCK;
 299 #ifndef PRODUCT
 300   SharedRuntime::_new_array_ctr++;            // new array requires GC
 301 #endif
 302   assert(check_compiled_frame(thread), "incorrect caller");
 303 
 304   // Scavenge and allocate an instance.
 305   oop result;
 306 
 307   assert(array_type->oop_is_typeArray(), "should be called only for type array");
 308   // The oopFactory likes to work with the element type.
 309   BasicType elem_type = TypeArrayKlass::cast(array_type)->element_type();
 310   result = oopFactory::new_typeArray_nozero(elem_type, len, THREAD);
 311 
 312   // Pass oops back through thread local storage.  Our apparent type to Java
 313   // is that we return an oop, but we can block on exit from this routine and
 314   // a GC can trash the oop in C's return register.  The generated stub will
 315   // fetch the oop from TLS after any possible GC.
 316   deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
 317   thread->set_vm_result(result);
 318   JRT_BLOCK_END;
 319 
 320   if (GraphKit::use_ReduceInitialCardMarks()) {
 321     // inform GC that we won't do card marks for initializing writes.
 322     new_store_pre_barrier(thread);
 323   }
 324 
 325   oop result = thread->vm_result();
 326   if ((len > 0) && (result != NULL) &&
 327       is_deoptimized_caller_frame(thread)) {
 328     // Zero array here if the caller is deoptimized.
 329     int size = ((typeArrayOop)result)->object_size();
 330     BasicType elem_type = TypeArrayKlass::cast(array_type)->element_type();
 331     const size_t hs = arrayOopDesc::header_size(elem_type);
 332     // Align to next 8 bytes to avoid trashing arrays's length.
 333     const size_t aligned_hs = align_object_offset(hs);
 334     HeapWord* obj = (HeapWord*)result;
 335     if (aligned_hs > hs) {
 336       Copy::zero_to_words(obj+hs, aligned_hs-hs);
 337     }
 338     // Optimized zeroing.
 339     Copy::fill_to_aligned_words(obj+aligned_hs, size-aligned_hs);
 340   }
 341 
 342 JRT_END
 343 
 344 // Note: multianewarray for one dimension is handled inline by GraphKit::new_array.
 345 
 346 // multianewarray for 2 dimensions
 347 JRT_ENTRY(void, OptoRuntime::multianewarray2_C(Klass* elem_type, int len1, int len2, JavaThread *thread))
 348 #ifndef PRODUCT
 349   SharedRuntime::_multi2_ctr++;                // multianewarray for 1 dimension
 350 #endif
 351   assert(check_compiled_frame(thread), "incorrect caller");
 352   assert(elem_type->is_klass(), "not a class");
 353   jint dims[2];
 354   dims[0] = len1;
 355   dims[1] = len2;
 356   oop obj = ArrayKlass::cast(elem_type)->multi_allocate(2, dims, THREAD);
 357   deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
 358   thread->set_vm_result(obj);
 359 JRT_END
 360 
 361 // multianewarray for 3 dimensions
 362 JRT_ENTRY(void, OptoRuntime::multianewarray3_C(Klass* elem_type, int len1, int len2, int len3, JavaThread *thread))
 363 #ifndef PRODUCT
 364   SharedRuntime::_multi3_ctr++;                // multianewarray for 1 dimension
 365 #endif
 366   assert(check_compiled_frame(thread), "incorrect caller");
 367   assert(elem_type->is_klass(), "not a class");
 368   jint dims[3];
 369   dims[0] = len1;
 370   dims[1] = len2;
 371   dims[2] = len3;
 372   oop obj = ArrayKlass::cast(elem_type)->multi_allocate(3, dims, THREAD);
 373   deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
 374   thread->set_vm_result(obj);
 375 JRT_END
 376 
 377 // multianewarray for 4 dimensions
 378 JRT_ENTRY(void, OptoRuntime::multianewarray4_C(Klass* elem_type, int len1, int len2, int len3, int len4, JavaThread *thread))
 379 #ifndef PRODUCT
 380   SharedRuntime::_multi4_ctr++;                // multianewarray for 1 dimension
 381 #endif
 382   assert(check_compiled_frame(thread), "incorrect caller");
 383   assert(elem_type->is_klass(), "not a class");
 384   jint dims[4];
 385   dims[0] = len1;
 386   dims[1] = len2;
 387   dims[2] = len3;
 388   dims[3] = len4;
 389   oop obj = ArrayKlass::cast(elem_type)->multi_allocate(4, dims, THREAD);
 390   deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
 391   thread->set_vm_result(obj);
 392 JRT_END
 393 
 394 // multianewarray for 5 dimensions
 395 JRT_ENTRY(void, OptoRuntime::multianewarray5_C(Klass* elem_type, int len1, int len2, int len3, int len4, int len5, JavaThread *thread))
 396 #ifndef PRODUCT
 397   SharedRuntime::_multi5_ctr++;                // multianewarray for 1 dimension
 398 #endif
 399   assert(check_compiled_frame(thread), "incorrect caller");
 400   assert(elem_type->is_klass(), "not a class");
 401   jint dims[5];
 402   dims[0] = len1;
 403   dims[1] = len2;
 404   dims[2] = len3;
 405   dims[3] = len4;
 406   dims[4] = len5;
 407   oop obj = ArrayKlass::cast(elem_type)->multi_allocate(5, dims, THREAD);
 408   deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
 409   thread->set_vm_result(obj);
 410 JRT_END
 411 
 412 JRT_ENTRY(void, OptoRuntime::multianewarrayN_C(Klass* elem_type, arrayOopDesc* dims, JavaThread *thread))
 413   assert(check_compiled_frame(thread), "incorrect caller");
 414   assert(elem_type->is_klass(), "not a class");
 415   assert(oop(dims)->is_typeArray(), "not an array");
 416 
 417   ResourceMark rm;
 418   jint len = dims->length();
 419   assert(len > 0, "Dimensions array should contain data");
 420   jint *j_dims = typeArrayOop(dims)->int_at_addr(0);
 421   jint *c_dims = NEW_RESOURCE_ARRAY(jint, len);
 422   Copy::conjoint_jints_atomic(j_dims, c_dims, len);
 423 
 424   oop obj = ArrayKlass::cast(elem_type)->multi_allocate(len, c_dims, THREAD);
 425   deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
 426   thread->set_vm_result(obj);
 427 JRT_END
 428 
 429 
 430 const TypeFunc *OptoRuntime::new_instance_Type() {
 431   // create input type (domain)
 432   const Type **fields = TypeTuple::fields(1);
 433   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Klass to be allocated
 434   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
 435 
 436   // create result type (range)
 437   fields = TypeTuple::fields(1);
 438   fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
 439 
 440   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 441 
 442   return TypeFunc::make(domain, range);
 443 }
 444 
 445 
 446 const TypeFunc *OptoRuntime::athrow_Type() {
 447   // create input type (domain)
 448   const Type **fields = TypeTuple::fields(1);
 449   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Klass to be allocated
 450   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
 451 
 452   // create result type (range)
 453   fields = TypeTuple::fields(0);
 454 
 455   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 456 
 457   return TypeFunc::make(domain, range);
 458 }
 459 
 460 
 461 const TypeFunc *OptoRuntime::new_array_Type() {
 462   // create input type (domain)
 463   const Type **fields = TypeTuple::fields(2);
 464   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;   // element klass
 465   fields[TypeFunc::Parms+1] = TypeInt::INT;       // array size
 466   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 467 
 468   // create result type (range)
 469   fields = TypeTuple::fields(1);
 470   fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
 471 
 472   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 473 
 474   return TypeFunc::make(domain, range);
 475 }
 476 
 477 const TypeFunc *OptoRuntime::multianewarray_Type(int ndim) {
 478   // create input type (domain)
 479   const int nargs = ndim + 1;
 480   const Type **fields = TypeTuple::fields(nargs);
 481   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;   // element klass
 482   for( int i = 1; i < nargs; i++ )
 483     fields[TypeFunc::Parms + i] = TypeInt::INT;       // array size
 484   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+nargs, fields);
 485 
 486   // create result type (range)
 487   fields = TypeTuple::fields(1);
 488   fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
 489   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 490 
 491   return TypeFunc::make(domain, range);
 492 }
 493 
 494 const TypeFunc *OptoRuntime::multianewarray2_Type() {
 495   return multianewarray_Type(2);
 496 }
 497 
 498 const TypeFunc *OptoRuntime::multianewarray3_Type() {
 499   return multianewarray_Type(3);
 500 }
 501 
 502 const TypeFunc *OptoRuntime::multianewarray4_Type() {
 503   return multianewarray_Type(4);
 504 }
 505 
 506 const TypeFunc *OptoRuntime::multianewarray5_Type() {
 507   return multianewarray_Type(5);
 508 }
 509 
 510 const TypeFunc *OptoRuntime::multianewarrayN_Type() {
 511   // create input type (domain)
 512   const Type **fields = TypeTuple::fields(2);
 513   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;   // element klass
 514   fields[TypeFunc::Parms+1] = TypeInstPtr::NOTNULL;   // array of dim sizes
 515   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 516 
 517   // create result type (range)
 518   fields = TypeTuple::fields(1);
 519   fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
 520   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 521 
 522   return TypeFunc::make(domain, range);
 523 }
 524 
 525 const TypeFunc *OptoRuntime::g1_wb_pre_Type() {
 526   const Type **fields = TypeTuple::fields(2);
 527   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // original field value
 528   fields[TypeFunc::Parms+1] = TypeRawPtr::NOTNULL; // thread
 529   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 530 
 531   // create result type (range)
 532   fields = TypeTuple::fields(0);
 533   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 534 
 535   return TypeFunc::make(domain, range);
 536 }
 537 
 538 const TypeFunc *OptoRuntime::g1_wb_post_Type() {
 539 
 540   const Type **fields = TypeTuple::fields(2);
 541   fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL;  // Card addr
 542   fields[TypeFunc::Parms+1] = TypeRawPtr::NOTNULL;  // thread
 543   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 544 
 545   // create result type (range)
 546   fields = TypeTuple::fields(0);
 547   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
 548 
 549   return TypeFunc::make(domain, range);
 550 }
 551 
 552 const TypeFunc *OptoRuntime::uncommon_trap_Type() {
 553   // create input type (domain)
 554   const Type **fields = TypeTuple::fields(1);
 555   fields[TypeFunc::Parms+0] = TypeInt::INT; // trap_reason (deopt reason and action)
 556   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
 557 
 558   // create result type (range)
 559   fields = TypeTuple::fields(0);
 560   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 561 
 562   return TypeFunc::make(domain, range);
 563 }
 564 
 565 # ifdef ENABLE_ZAP_DEAD_LOCALS
 566 // Type used for stub generation for zap_dead_locals.
 567 // No inputs or outputs
 568 const TypeFunc *OptoRuntime::zap_dead_locals_Type() {
 569   // create input type (domain)
 570   const Type **fields = TypeTuple::fields(0);
 571   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms,fields);
 572 
 573   // create result type (range)
 574   fields = TypeTuple::fields(0);
 575   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms,fields);
 576 
 577   return TypeFunc::make(domain,range);
 578 }
 579 # endif
 580 
 581 
 582 //-----------------------------------------------------------------------------
 583 // Monitor Handling
 584 const TypeFunc *OptoRuntime::complete_monitor_enter_Type() {
 585   // create input type (domain)
 586   const Type **fields = TypeTuple::fields(2);
 587   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;  // Object to be Locked
 588   fields[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM;   // Address of stack location for lock
 589   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
 590 
 591   // create result type (range)
 592   fields = TypeTuple::fields(0);
 593 
 594   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
 595 
 596   return TypeFunc::make(domain,range);
 597 }
 598 
 599 
 600 //-----------------------------------------------------------------------------
 601 const TypeFunc *OptoRuntime::complete_monitor_exit_Type() {
 602   // create input type (domain)
 603   const Type **fields = TypeTuple::fields(2);
 604   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;  // Object to be Locked
 605   fields[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM;   // Address of stack location for lock
 606   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
 607 
 608   // create result type (range)
 609   fields = TypeTuple::fields(0);
 610 
 611   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
 612 
 613   return TypeFunc::make(domain,range);
 614 }
 615 
 616 const TypeFunc* OptoRuntime::flush_windows_Type() {
 617   // create input type (domain)
 618   const Type** fields = TypeTuple::fields(1);
 619   fields[TypeFunc::Parms+0] = NULL; // void
 620   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms, fields);
 621 
 622   // create result type
 623   fields = TypeTuple::fields(1);
 624   fields[TypeFunc::Parms+0] = NULL; // void
 625   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
 626 
 627   return TypeFunc::make(domain, range);
 628 }
 629 
 630 const TypeFunc* OptoRuntime::l2f_Type() {
 631   // create input type (domain)
 632   const Type **fields = TypeTuple::fields(2);
 633   fields[TypeFunc::Parms+0] = TypeLong::LONG;
 634   fields[TypeFunc::Parms+1] = Type::HALF;
 635   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 636 
 637   // create result type (range)
 638   fields = TypeTuple::fields(1);
 639   fields[TypeFunc::Parms+0] = Type::FLOAT;
 640   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 641 
 642   return TypeFunc::make(domain, range);
 643 }
 644 
 645 const TypeFunc* OptoRuntime::modf_Type() {
 646   const Type **fields = TypeTuple::fields(2);
 647   fields[TypeFunc::Parms+0] = Type::FLOAT;
 648   fields[TypeFunc::Parms+1] = Type::FLOAT;
 649   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 650 
 651   // create result type (range)
 652   fields = TypeTuple::fields(1);
 653   fields[TypeFunc::Parms+0] = Type::FLOAT;
 654 
 655   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 656 
 657   return TypeFunc::make(domain, range);
 658 }
 659 
 660 const TypeFunc *OptoRuntime::Math_D_D_Type() {
 661   // create input type (domain)
 662   const Type **fields = TypeTuple::fields(2);
 663   // Symbol* name of class to be loaded
 664   fields[TypeFunc::Parms+0] = Type::DOUBLE;
 665   fields[TypeFunc::Parms+1] = Type::HALF;
 666   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 667 
 668   // create result type (range)
 669   fields = TypeTuple::fields(2);
 670   fields[TypeFunc::Parms+0] = Type::DOUBLE;
 671   fields[TypeFunc::Parms+1] = Type::HALF;
 672   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+2, fields);
 673 
 674   return TypeFunc::make(domain, range);
 675 }
 676 
 677 const TypeFunc* OptoRuntime::Math_DD_D_Type() {
 678   const Type **fields = TypeTuple::fields(4);
 679   fields[TypeFunc::Parms+0] = Type::DOUBLE;
 680   fields[TypeFunc::Parms+1] = Type::HALF;
 681   fields[TypeFunc::Parms+2] = Type::DOUBLE;
 682   fields[TypeFunc::Parms+3] = Type::HALF;
 683   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+4, fields);
 684 
 685   // create result type (range)
 686   fields = TypeTuple::fields(2);
 687   fields[TypeFunc::Parms+0] = Type::DOUBLE;
 688   fields[TypeFunc::Parms+1] = Type::HALF;
 689   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+2, fields);
 690 
 691   return TypeFunc::make(domain, range);
 692 }
 693 
 694 //-------------- currentTimeMillis, currentTimeNanos, etc
 695 
 696 const TypeFunc* OptoRuntime::void_long_Type() {
 697   // create input type (domain)
 698   const Type **fields = TypeTuple::fields(0);
 699   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+0, fields);
 700 
 701   // create result type (range)
 702   fields = TypeTuple::fields(2);
 703   fields[TypeFunc::Parms+0] = TypeLong::LONG;
 704   fields[TypeFunc::Parms+1] = Type::HALF;
 705   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+2, fields);
 706 
 707   return TypeFunc::make(domain, range);
 708 }
 709 
 710 // arraycopy stub variations:
 711 enum ArrayCopyType {
 712   ac_fast,                      // void(ptr, ptr, size_t)
 713   ac_checkcast,                 //  int(ptr, ptr, size_t, size_t, ptr)
 714   ac_slow,                      // void(ptr, int, ptr, int, int)
 715   ac_generic                    //  int(ptr, int, ptr, int, int)
 716 };
 717 
 718 static const TypeFunc* make_arraycopy_Type(ArrayCopyType act) {
 719   // create input type (domain)
 720   int num_args      = (act == ac_fast ? 3 : 5);
 721   int num_size_args = (act == ac_fast ? 1 : act == ac_checkcast ? 2 : 0);
 722   int argcnt = num_args;
 723   LP64_ONLY(argcnt += num_size_args); // halfwords for lengths
 724   const Type** fields = TypeTuple::fields(argcnt);
 725   int argp = TypeFunc::Parms;
 726   fields[argp++] = TypePtr::NOTNULL;    // src
 727   if (num_size_args == 0) {
 728     fields[argp++] = TypeInt::INT;      // src_pos
 729   }
 730   fields[argp++] = TypePtr::NOTNULL;    // dest
 731   if (num_size_args == 0) {
 732     fields[argp++] = TypeInt::INT;      // dest_pos
 733     fields[argp++] = TypeInt::INT;      // length
 734   }
 735   while (num_size_args-- > 0) {
 736     fields[argp++] = TypeX_X;               // size in whatevers (size_t)
 737     LP64_ONLY(fields[argp++] = Type::HALF); // other half of long length
 738   }
 739   if (act == ac_checkcast) {
 740     fields[argp++] = TypePtr::NOTNULL;  // super_klass
 741   }
 742   assert(argp == TypeFunc::Parms+argcnt, "correct decoding of act");
 743   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 744 
 745   // create result type if needed
 746   int retcnt = (act == ac_checkcast || act == ac_generic ? 1 : 0);
 747   fields = TypeTuple::fields(1);
 748   if (retcnt == 0)
 749     fields[TypeFunc::Parms+0] = NULL; // void
 750   else
 751     fields[TypeFunc::Parms+0] = TypeInt::INT; // status result, if needed
 752   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+retcnt, fields);
 753   return TypeFunc::make(domain, range);
 754 }
 755 
 756 const TypeFunc* OptoRuntime::fast_arraycopy_Type() {
 757   // This signature is simple:  Two base pointers and a size_t.
 758   return make_arraycopy_Type(ac_fast);
 759 }
 760 
 761 const TypeFunc* OptoRuntime::checkcast_arraycopy_Type() {
 762   // An extension of fast_arraycopy_Type which adds type checking.
 763   return make_arraycopy_Type(ac_checkcast);
 764 }
 765 
 766 const TypeFunc* OptoRuntime::slow_arraycopy_Type() {
 767   // This signature is exactly the same as System.arraycopy.
 768   // There are no intptr_t (int/long) arguments.
 769   return make_arraycopy_Type(ac_slow);
 770 }
 771 
 772 const TypeFunc* OptoRuntime::generic_arraycopy_Type() {
 773   // This signature is like System.arraycopy, except that it returns status.
 774   return make_arraycopy_Type(ac_generic);
 775 }
 776 
 777 
 778 const TypeFunc* OptoRuntime::array_fill_Type() {
 779   const Type** fields;
 780   int argp = TypeFunc::Parms;
 781   if (CCallingConventionRequiresIntsAsLongs) {
 782   // create input type (domain): pointer, int, size_t
 783     fields = TypeTuple::fields(3 LP64_ONLY( + 2));
 784     fields[argp++] = TypePtr::NOTNULL;
 785     fields[argp++] = TypeLong::LONG;
 786     fields[argp++] = Type::HALF;
 787   } else {
 788     // create input type (domain): pointer, int, size_t
 789     fields = TypeTuple::fields(3 LP64_ONLY( + 1));
 790     fields[argp++] = TypePtr::NOTNULL;
 791     fields[argp++] = TypeInt::INT;
 792   }
 793   fields[argp++] = TypeX_X;               // size in whatevers (size_t)
 794   LP64_ONLY(fields[argp++] = Type::HALF); // other half of long length
 795   const TypeTuple *domain = TypeTuple::make(argp, fields);
 796 
 797   // create result type
 798   fields = TypeTuple::fields(1);
 799   fields[TypeFunc::Parms+0] = NULL; // void
 800   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
 801 
 802   return TypeFunc::make(domain, range);
 803 }
 804 
 805 // for aescrypt encrypt/decrypt operations, just three pointers returning void (length is constant)
 806 const TypeFunc* OptoRuntime::aescrypt_block_Type() {
 807   // create input type (domain)
 808   int num_args      = 3;
 809   if (Matcher::pass_original_key_for_aes()) {
 810     num_args = 4;
 811   }
 812   int argcnt = num_args;
 813   const Type** fields = TypeTuple::fields(argcnt);
 814   int argp = TypeFunc::Parms;
 815   fields[argp++] = TypePtr::NOTNULL;    // src
 816   fields[argp++] = TypePtr::NOTNULL;    // dest
 817   fields[argp++] = TypePtr::NOTNULL;    // k array
 818   if (Matcher::pass_original_key_for_aes()) {
 819     fields[argp++] = TypePtr::NOTNULL;    // original k array
 820   }
 821   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
 822   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 823 
 824   // no result type needed
 825   fields = TypeTuple::fields(1);
 826   fields[TypeFunc::Parms+0] = NULL; // void
 827   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
 828   return TypeFunc::make(domain, range);
 829 }
 830 
 831 /**
 832  * int updateBytesCRC32(int crc, byte* b, int len)
 833  */
 834 const TypeFunc* OptoRuntime::updateBytesCRC32_Type() {
 835   // create input type (domain)
 836   int num_args      = 3;
 837   int argcnt = num_args;
 838   const Type** fields = TypeTuple::fields(argcnt);
 839   int argp = TypeFunc::Parms;
 840   fields[argp++] = TypeInt::INT;        // crc
 841   fields[argp++] = TypePtr::NOTNULL;    // src
 842   fields[argp++] = TypeInt::INT;        // len
 843   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
 844   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 845 
 846   // result type needed
 847   fields = TypeTuple::fields(1);
 848   fields[TypeFunc::Parms+0] = TypeInt::INT; // crc result
 849   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
 850   return TypeFunc::make(domain, range);
 851 }
 852 
 853 // for cipherBlockChaining calls of aescrypt encrypt/decrypt, four pointers and a length, returning int
 854 const TypeFunc* OptoRuntime::cipherBlockChaining_aescrypt_Type() {
 855   // create input type (domain)
 856   int num_args      = 5;
 857   if (Matcher::pass_original_key_for_aes()) {
 858     num_args = 6;
 859   }
 860   int argcnt = num_args;
 861   const Type** fields = TypeTuple::fields(argcnt);
 862   int argp = TypeFunc::Parms;
 863   fields[argp++] = TypePtr::NOTNULL;    // src
 864   fields[argp++] = TypePtr::NOTNULL;    // dest
 865   fields[argp++] = TypePtr::NOTNULL;    // k array
 866   fields[argp++] = TypePtr::NOTNULL;    // r array
 867   fields[argp++] = TypeInt::INT;        // src len
 868   if (Matcher::pass_original_key_for_aes()) {
 869     fields[argp++] = TypePtr::NOTNULL;    // original k array
 870   }
 871   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
 872   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 873 
 874   // returning cipher len (int)
 875   fields = TypeTuple::fields(1);
 876   fields[TypeFunc::Parms+0] = TypeInt::INT;
 877   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
 878   return TypeFunc::make(domain, range);
 879 }
 880 
 881 /*
 882  * void implCompress(byte[] buf, int ofs)
 883  */
 884 const TypeFunc* OptoRuntime::sha_implCompress_Type() {
 885   // create input type (domain)
 886   int num_args = 2;
 887   int argcnt = num_args;
 888   const Type** fields = TypeTuple::fields(argcnt);
 889   int argp = TypeFunc::Parms;
 890   fields[argp++] = TypePtr::NOTNULL; // buf
 891   fields[argp++] = TypePtr::NOTNULL; // state
 892   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
 893   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 894 
 895   // no result type needed
 896   fields = TypeTuple::fields(1);
 897   fields[TypeFunc::Parms+0] = NULL; // void
 898   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
 899   return TypeFunc::make(domain, range);
 900 }
 901 
 902 /*
 903  * int implCompressMultiBlock(byte[] b, int ofs, int limit)
 904  */
 905 const TypeFunc* OptoRuntime::digestBase_implCompressMB_Type() {
 906   // create input type (domain)
 907   int num_args = 4;
 908   int argcnt = num_args;
 909   const Type** fields = TypeTuple::fields(argcnt);
 910   int argp = TypeFunc::Parms;
 911   fields[argp++] = TypePtr::NOTNULL; // buf
 912   fields[argp++] = TypePtr::NOTNULL; // state
 913   fields[argp++] = TypeInt::INT;     // ofs
 914   fields[argp++] = TypeInt::INT;     // limit
 915   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
 916   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 917 
 918   // returning ofs (int)
 919   fields = TypeTuple::fields(1);
 920   fields[TypeFunc::Parms+0] = TypeInt::INT; // ofs
 921   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
 922   return TypeFunc::make(domain, range);
 923 }
 924 
 925 const TypeFunc* OptoRuntime::multiplyToLen_Type() {
 926   // create input type (domain)
 927   int num_args      = 6;
 928   int argcnt = num_args;
 929   const Type** fields = TypeTuple::fields(argcnt);
 930   int argp = TypeFunc::Parms;
 931   fields[argp++] = TypePtr::NOTNULL;    // x
 932   fields[argp++] = TypeInt::INT;        // xlen
 933   fields[argp++] = TypePtr::NOTNULL;    // y
 934   fields[argp++] = TypeInt::INT;        // ylen
 935   fields[argp++] = TypePtr::NOTNULL;    // z
 936   fields[argp++] = TypeInt::INT;        // zlen
 937   assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
 938   const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
 939 
 940   // no result type needed
 941   fields = TypeTuple::fields(1);
 942   fields[TypeFunc::Parms+0] = NULL;
 943   const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
 944   return TypeFunc::make(domain, range);
 945 }
 946 
 947 
 948 
 949 //------------- Interpreter state access for on stack replacement
 950 const TypeFunc* OptoRuntime::osr_end_Type() {
 951   // create input type (domain)
 952   const Type **fields = TypeTuple::fields(1);
 953   fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // OSR temp buf
 954   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
 955 
 956   // create result type
 957   fields = TypeTuple::fields(1);
 958   // fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // locked oop
 959   fields[TypeFunc::Parms+0] = NULL; // void
 960   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
 961   return TypeFunc::make(domain, range);
 962 }
 963 
 964 //-------------- methodData update helpers
 965 
 966 const TypeFunc* OptoRuntime::profile_receiver_type_Type() {
 967   // create input type (domain)
 968   const Type **fields = TypeTuple::fields(2);
 969   fields[TypeFunc::Parms+0] = TypeAryPtr::NOTNULL;    // methodData pointer
 970   fields[TypeFunc::Parms+1] = TypeInstPtr::BOTTOM;    // receiver oop
 971   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 972 
 973   // create result type
 974   fields = TypeTuple::fields(1);
 975   fields[TypeFunc::Parms+0] = NULL; // void
 976   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
 977   return TypeFunc::make(domain,range);
 978 }
 979 
 980 JRT_LEAF(void, OptoRuntime::profile_receiver_type_C(DataLayout* data, oopDesc* receiver))
 981   if (receiver == NULL) return;
 982   Klass* receiver_klass = receiver->klass();
 983 
 984   intptr_t* mdp = ((intptr_t*)(data)) + DataLayout::header_size_in_cells();
 985   int empty_row = -1;           // free row, if any is encountered
 986 
 987   // ReceiverTypeData* vc = new ReceiverTypeData(mdp);
 988   for (uint row = 0; row < ReceiverTypeData::row_limit(); row++) {
 989     // if (vc->receiver(row) == receiver_klass)
 990     int receiver_off = ReceiverTypeData::receiver_cell_index(row);
 991     intptr_t row_recv = *(mdp + receiver_off);
 992     if (row_recv == (intptr_t) receiver_klass) {
 993       // vc->set_receiver_count(row, vc->receiver_count(row) + DataLayout::counter_increment);
 994       int count_off = ReceiverTypeData::receiver_count_cell_index(row);
 995       *(mdp + count_off) += DataLayout::counter_increment;
 996       return;
 997     } else if (row_recv == 0) {
 998       // else if (vc->receiver(row) == NULL)
 999       empty_row = (int) row;
1000     }
1001   }
1002 
1003   if (empty_row != -1) {
1004     int receiver_off = ReceiverTypeData::receiver_cell_index(empty_row);
1005     // vc->set_receiver(empty_row, receiver_klass);
1006     *(mdp + receiver_off) = (intptr_t) receiver_klass;
1007     // vc->set_receiver_count(empty_row, DataLayout::counter_increment);
1008     int count_off = ReceiverTypeData::receiver_count_cell_index(empty_row);
1009     *(mdp + count_off) = DataLayout::counter_increment;
1010   } else {
1011     // Receiver did not match any saved receiver and there is no empty row for it.
1012     // Increment total counter to indicate polymorphic case.
1013     intptr_t* count_p = (intptr_t*)(((uint8_t*)(data)) + in_bytes(CounterData::count_offset()));
1014     *count_p += DataLayout::counter_increment;
1015   }
1016 JRT_END
1017 
1018 //-------------------------------------------------------------------------------------
1019 // register policy
1020 
1021 bool OptoRuntime::is_callee_saved_register(MachRegisterNumbers reg) {
1022   assert(reg >= 0 && reg < _last_Mach_Reg, "must be a machine register");
1023   switch (register_save_policy[reg]) {
1024     case 'C': return false; //SOC
1025     case 'E': return true ; //SOE
1026     case 'N': return false; //NS
1027     case 'A': return false; //AS
1028   }
1029   ShouldNotReachHere();
1030   return false;
1031 }
1032 
1033 //-----------------------------------------------------------------------
1034 // Exceptions
1035 //
1036 
1037 static void trace_exception(oop exception_oop, address exception_pc, const char* msg) PRODUCT_RETURN;
1038 
1039 // The method is an entry that is always called by a C++ method not
1040 // directly from compiled code. Compiled code will call the C++ method following.
1041 // We can't allow async exception to be installed during  exception processing.
1042 JRT_ENTRY_NO_ASYNC(address, OptoRuntime::handle_exception_C_helper(JavaThread* thread, nmethod* &nm))
1043 
1044   // Do not confuse exception_oop with pending_exception. The exception_oop
1045   // is only used to pass arguments into the method. Not for general
1046   // exception handling.  DO NOT CHANGE IT to use pending_exception, since
1047   // the runtime stubs checks this on exit.
1048   assert(thread->exception_oop() != NULL, "exception oop is found");
1049   address handler_address = NULL;
1050 
1051   Handle exception(thread, thread->exception_oop());
1052   address pc = thread->exception_pc();
1053 
1054   // Clear out the exception oop and pc since looking up an
1055   // exception handler can cause class loading, which might throw an
1056   // exception and those fields are expected to be clear during
1057   // normal bytecode execution.
1058   thread->clear_exception_oop_and_pc();
1059 
1060   if (TraceExceptions) {
1061     trace_exception(exception(), pc, "");
1062   }
1063 
1064   // for AbortVMOnException flag
1065   NOT_PRODUCT(Exceptions::debug_check_abort(exception));
1066 
1067 #ifdef ASSERT
1068   if (!(exception->is_a(SystemDictionary::Throwable_klass()))) {
1069     // should throw an exception here
1070     ShouldNotReachHere();
1071   }
1072 #endif
1073 
1074   // new exception handling: this method is entered only from adapters
1075   // exceptions from compiled java methods are handled in compiled code
1076   // using rethrow node
1077 
1078   nm = CodeCache::find_nmethod(pc);
1079   assert(nm != NULL, "No NMethod found");
1080   if (nm->is_native_method()) {
1081     fatal("Native method should not have path to exception handling");
1082   } else {
1083     // we are switching to old paradigm: search for exception handler in caller_frame
1084     // instead in exception handler of caller_frame.sender()
1085 
1086     if (JvmtiExport::can_post_on_exceptions()) {
1087       // "Full-speed catching" is not necessary here,
1088       // since we're notifying the VM on every catch.
1089       // Force deoptimization and the rest of the lookup
1090       // will be fine.
1091       deoptimize_caller_frame(thread);
1092     }
1093 
1094     // Check the stack guard pages.  If enabled, look for handler in this frame;
1095     // otherwise, forcibly unwind the frame.
1096     //
1097     // 4826555: use default current sp for reguard_stack instead of &nm: it's more accurate.
1098     bool force_unwind = !thread->reguard_stack();
1099     bool deopting = false;
1100     if (nm->is_deopt_pc(pc)) {
1101       deopting = true;
1102       RegisterMap map(thread, false);
1103       frame deoptee = thread->last_frame().sender(&map);
1104       assert(deoptee.is_deoptimized_frame(), "must be deopted");
1105       // Adjust the pc back to the original throwing pc
1106       pc = deoptee.pc();
1107     }
1108 
1109     // If we are forcing an unwind because of stack overflow then deopt is
1110     // irrelevant since we are throwing the frame away anyway.
1111 
1112     if (deopting && !force_unwind) {
1113       handler_address = SharedRuntime::deopt_blob()->unpack_with_exception();
1114     } else {
1115 
1116       handler_address =
1117         force_unwind ? NULL : nm->handler_for_exception_and_pc(exception, pc);
1118 
1119       if (handler_address == NULL) {
1120         Handle original_exception(thread, exception());
1121         handler_address = SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, force_unwind, true);
1122         assert (handler_address != NULL, "must have compiled handler");
1123         // Update the exception cache only when the unwind was not forced
1124         // and there didn't happen another exception during the computation of the
1125         // compiled exception handler.
1126         if (!force_unwind && original_exception() == exception()) {
1127           nm->add_handler_for_exception_and_pc(exception,pc,handler_address);
1128         }
1129       } else {
1130         assert(handler_address == SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, force_unwind, true), "Must be the same");
1131       }
1132     }
1133 
1134     thread->set_exception_pc(pc);
1135     thread->set_exception_handler_pc(handler_address);
1136 
1137     // Check if the exception PC is a MethodHandle call site.
1138     thread->set_is_method_handle_return(nm->is_method_handle_return(pc));
1139   }
1140 
1141   // Restore correct return pc.  Was saved above.
1142   thread->set_exception_oop(exception());
1143   return handler_address;
1144 
1145 JRT_END
1146 
1147 // We are entering here from exception_blob
1148 // If there is a compiled exception handler in this method, we will continue there;
1149 // otherwise we will unwind the stack and continue at the caller of top frame method
1150 // Note we enter without the usual JRT wrapper. We will call a helper routine that
1151 // will do the normal VM entry. We do it this way so that we can see if the nmethod
1152 // we looked up the handler for has been deoptimized in the meantime. If it has been
1153 // we must not use the handler and instead return the deopt blob.
1154 address OptoRuntime::handle_exception_C(JavaThread* thread) {
1155 //
1156 // We are in Java not VM and in debug mode we have a NoHandleMark
1157 //
1158 #ifndef PRODUCT
1159   SharedRuntime::_find_handler_ctr++;          // find exception handler
1160 #endif
1161   debug_only(NoHandleMark __hm;)
1162   nmethod* nm = NULL;
1163   address handler_address = NULL;
1164   {
1165     // Enter the VM
1166 
1167     ResetNoHandleMark rnhm;
1168     handler_address = handle_exception_C_helper(thread, nm);
1169   }
1170 
1171   // Back in java: Use no oops, DON'T safepoint
1172 
1173   // Now check to see if the handler we are returning is in a now
1174   // deoptimized frame
1175 
1176   if (nm != NULL) {
1177     RegisterMap map(thread, false);
1178     frame caller = thread->last_frame().sender(&map);
1179 #ifdef ASSERT
1180     assert(caller.is_compiled_frame(), "must be");
1181 #endif // ASSERT
1182     if (caller.is_deoptimized_frame()) {
1183       handler_address = SharedRuntime::deopt_blob()->unpack_with_exception();
1184     }
1185   }
1186   return handler_address;
1187 }
1188 
1189 //------------------------------rethrow----------------------------------------
1190 // We get here after compiled code has executed a 'RethrowNode'.  The callee
1191 // is either throwing or rethrowing an exception.  The callee-save registers
1192 // have been restored, synchronized objects have been unlocked and the callee
1193 // stack frame has been removed.  The return address was passed in.
1194 // Exception oop is passed as the 1st argument.  This routine is then called
1195 // from the stub.  On exit, we know where to jump in the caller's code.
1196 // After this C code exits, the stub will pop his frame and end in a jump
1197 // (instead of a return).  We enter the caller's default handler.
1198 //
1199 // This must be JRT_LEAF:
1200 //     - caller will not change its state as we cannot block on exit,
1201 //       therefore raw_exception_handler_for_return_address is all it takes
1202 //       to handle deoptimized blobs
1203 //
1204 // However, there needs to be a safepoint check in the middle!  So compiled
1205 // safepoints are completely watertight.
1206 //
1207 // Thus, it cannot be a leaf since it contains the No_GC_Verifier.
1208 //
1209 // *THIS IS NOT RECOMMENDED PROGRAMMING STYLE*
1210 //
1211 address OptoRuntime::rethrow_C(oopDesc* exception, JavaThread* thread, address ret_pc) {
1212 #ifndef PRODUCT
1213   SharedRuntime::_rethrow_ctr++;               // count rethrows
1214 #endif
1215   assert (exception != NULL, "should have thrown a NULLPointerException");
1216 #ifdef ASSERT
1217   if (!(exception->is_a(SystemDictionary::Throwable_klass()))) {
1218     // should throw an exception here
1219     ShouldNotReachHere();
1220   }
1221 #endif
1222 
1223   thread->set_vm_result(exception);
1224   // Frame not compiled (handles deoptimization blob)
1225   return SharedRuntime::raw_exception_handler_for_return_address(thread, ret_pc);
1226 }
1227 
1228 
1229 const TypeFunc *OptoRuntime::rethrow_Type() {
1230   // create input type (domain)
1231   const Type **fields = TypeTuple::fields(1);
1232   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Exception oop
1233   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1,fields);
1234 
1235   // create result type (range)
1236   fields = TypeTuple::fields(1);
1237   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Exception oop
1238   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
1239 
1240   return TypeFunc::make(domain, range);
1241 }
1242 
1243 
1244 void OptoRuntime::deoptimize_caller_frame(JavaThread *thread, bool doit) {
1245   // Deoptimize the caller before continuing, as the compiled
1246   // exception handler table may not be valid.
1247   if (!StressCompiledExceptionHandlers && doit) {
1248     deoptimize_caller_frame(thread);
1249   }
1250 }
1251 
1252 void OptoRuntime::deoptimize_caller_frame(JavaThread *thread) {
1253   // Called from within the owner thread, so no need for safepoint
1254   RegisterMap reg_map(thread);
1255   frame stub_frame = thread->last_frame();
1256   assert(stub_frame.is_runtime_frame() || exception_blob()->contains(stub_frame.pc()), "sanity check");
1257   frame caller_frame = stub_frame.sender(&reg_map);
1258 
1259   // Deoptimize the caller frame.
1260   Deoptimization::deoptimize_frame(thread, caller_frame.id());
1261 }
1262 
1263 
1264 bool OptoRuntime::is_deoptimized_caller_frame(JavaThread *thread) {
1265   // Called from within the owner thread, so no need for safepoint
1266   RegisterMap reg_map(thread);
1267   frame stub_frame = thread->last_frame();
1268   assert(stub_frame.is_runtime_frame() || exception_blob()->contains(stub_frame.pc()), "sanity check");
1269   frame caller_frame = stub_frame.sender(&reg_map);
1270   return caller_frame.is_deoptimized_frame();
1271 }
1272 
1273 
1274 const TypeFunc *OptoRuntime::register_finalizer_Type() {
1275   // create input type (domain)
1276   const Type **fields = TypeTuple::fields(1);
1277   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;  // oop;          Receiver
1278   // // The JavaThread* is passed to each routine as the last argument
1279   // fields[TypeFunc::Parms+1] = TypeRawPtr::NOTNULL;  // JavaThread *; Executing thread
1280   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1,fields);
1281 
1282   // create result type (range)
1283   fields = TypeTuple::fields(0);
1284 
1285   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
1286 
1287   return TypeFunc::make(domain,range);
1288 }
1289 
1290 
1291 //-----------------------------------------------------------------------------
1292 // Dtrace support.  entry and exit probes have the same signature
1293 const TypeFunc *OptoRuntime::dtrace_method_entry_exit_Type() {
1294   // create input type (domain)
1295   const Type **fields = TypeTuple::fields(2);
1296   fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // Thread-local storage
1297   fields[TypeFunc::Parms+1] = TypeMetadataPtr::BOTTOM;  // Method*;    Method we are entering
1298   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
1299 
1300   // create result type (range)
1301   fields = TypeTuple::fields(0);
1302 
1303   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
1304 
1305   return TypeFunc::make(domain,range);
1306 }
1307 
1308 const TypeFunc *OptoRuntime::dtrace_object_alloc_Type() {
1309   // create input type (domain)
1310   const Type **fields = TypeTuple::fields(2);
1311   fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // Thread-local storage
1312   fields[TypeFunc::Parms+1] = TypeInstPtr::NOTNULL;  // oop;    newly allocated object
1313 
1314   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
1315 
1316   // create result type (range)
1317   fields = TypeTuple::fields(0);
1318 
1319   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
1320 
1321   return TypeFunc::make(domain,range);
1322 }
1323 
1324 
1325 JRT_ENTRY_NO_ASYNC(void, OptoRuntime::register_finalizer(oopDesc* obj, JavaThread* thread))
1326   assert(obj->is_oop(), "must be a valid oop");
1327   assert(obj->klass()->has_finalizer(), "shouldn't be here otherwise");
1328   InstanceKlass::register_finalizer(instanceOop(obj), CHECK);
1329 JRT_END
1330 
1331 //-----------------------------------------------------------------------------
1332 
1333 NamedCounter * volatile OptoRuntime::_named_counters = NULL;
1334 
1335 //
1336 // dump the collected NamedCounters.
1337 //
1338 void OptoRuntime::print_named_counters() {
1339   int total_lock_count = 0;
1340   int eliminated_lock_count = 0;
1341 
1342   NamedCounter* c = _named_counters;
1343   while (c) {
1344     if (c->tag() == NamedCounter::LockCounter || c->tag() == NamedCounter::EliminatedLockCounter) {
1345       int count = c->count();
1346       if (count > 0) {
1347         bool eliminated = c->tag() == NamedCounter::EliminatedLockCounter;
1348         if (Verbose) {
1349           tty->print_cr("%d %s%s", count, c->name(), eliminated ? " (eliminated)" : "");
1350         }
1351         total_lock_count += count;
1352         if (eliminated) {
1353           eliminated_lock_count += count;
1354         }
1355       }
1356     } else if (c->tag() == NamedCounter::BiasedLockingCounter) {
1357       BiasedLockingCounters* blc = ((BiasedLockingNamedCounter*)c)->counters();
1358       if (blc->nonzero()) {
1359         tty->print_cr("%s", c->name());
1360         blc->print_on(tty);
1361       }
1362 #if INCLUDE_RTM_OPT
1363     } else if (c->tag() == NamedCounter::RTMLockingCounter) {
1364       RTMLockingCounters* rlc = ((RTMLockingNamedCounter*)c)->counters();
1365       if (rlc->nonzero()) {
1366         tty->print_cr("%s", c->name());
1367         rlc->print_on(tty);
1368       }
1369 #endif
1370     }
1371     c = c->next();
1372   }
1373   if (total_lock_count > 0) {
1374     tty->print_cr("dynamic locks: %d", total_lock_count);
1375     if (eliminated_lock_count) {
1376       tty->print_cr("eliminated locks: %d (%d%%)", eliminated_lock_count,
1377                     (int)(eliminated_lock_count * 100.0 / total_lock_count));
1378     }
1379   }
1380 }
1381 
1382 //
1383 //  Allocate a new NamedCounter.  The JVMState is used to generate the
1384 //  name which consists of method@line for the inlining tree.
1385 //
1386 
1387 NamedCounter* OptoRuntime::new_named_counter(JVMState* youngest_jvms, NamedCounter::CounterTag tag) {
1388   int max_depth = youngest_jvms->depth();
1389 
1390   // Visit scopes from youngest to oldest.
1391   bool first = true;
1392   stringStream st;
1393   for (int depth = max_depth; depth >= 1; depth--) {
1394     JVMState* jvms = youngest_jvms->of_depth(depth);
1395     ciMethod* m = jvms->has_method() ? jvms->method() : NULL;
1396     if (!first) {
1397       st.print(" ");
1398     } else {
1399       first = false;
1400     }
1401     int bci = jvms->bci();
1402     if (bci < 0) bci = 0;
1403     st.print("%s.%s@%d", m->holder()->name()->as_utf8(), m->name()->as_utf8(), bci);
1404     // To print linenumbers instead of bci use: m->line_number_from_bci(bci)
1405   }
1406   NamedCounter* c;
1407   if (tag == NamedCounter::BiasedLockingCounter) {
1408     c = new BiasedLockingNamedCounter(st.as_string());
1409   } else if (tag == NamedCounter::RTMLockingCounter) {
1410     c = new RTMLockingNamedCounter(st.as_string());
1411   } else {
1412     c = new NamedCounter(st.as_string(), tag);
1413   }
1414 
1415   // atomically add the new counter to the head of the list.  We only
1416   // add counters so this is safe.
1417   NamedCounter* head;
1418   do {
1419     c->set_next(NULL);
1420     head = _named_counters;
1421     c->set_next(head);
1422   } while (Atomic::cmpxchg_ptr(c, &_named_counters, head) != head);
1423   return c;
1424 }
1425 
1426 //-----------------------------------------------------------------------------
1427 // Non-product code
1428 #ifndef PRODUCT
1429 
1430 int trace_exception_counter = 0;
1431 static void trace_exception(oop exception_oop, address exception_pc, const char* msg) {
1432   ttyLocker ttyl;
1433   trace_exception_counter++;
1434   tty->print("%d [Exception (%s): ", trace_exception_counter, msg);
1435   exception_oop->print_value();
1436   tty->print(" in ");
1437   CodeBlob* blob = CodeCache::find_blob(exception_pc);
1438   if (blob->is_nmethod()) {
1439     nmethod* nm = blob->as_nmethod_or_null();
1440     nm->method()->print_value();
1441   } else if (blob->is_runtime_stub()) {
1442     tty->print("<runtime-stub>");
1443   } else {
1444     tty->print("<unknown>");
1445   }
1446   tty->print(" at " INTPTR_FORMAT,  p2i(exception_pc));
1447   tty->print_cr("]");
1448 }
1449 
1450 #endif  // PRODUCT
1451 
1452 
1453 # ifdef ENABLE_ZAP_DEAD_LOCALS
1454 // Called from call sites in compiled code with oop maps (actually safepoints)
1455 // Zaps dead locals in first java frame.
1456 // Is entry because may need to lock to generate oop maps
1457 // Currently, only used for compiler frames, but someday may be used
1458 // for interpreter frames, too.
1459 
1460 int OptoRuntime::ZapDeadCompiledLocals_count = 0;
1461 
1462 // avoid pointers to member funcs with these helpers
1463 static bool is_java_frame(  frame* f) { return f->is_java_frame();   }
1464 static bool is_native_frame(frame* f) { return f->is_native_frame(); }
1465 
1466 
1467 void OptoRuntime::zap_dead_java_or_native_locals(JavaThread* thread,
1468                                                 bool (*is_this_the_right_frame_to_zap)(frame*)) {
1469   assert(JavaThread::current() == thread, "is this needed?");
1470 
1471   if ( !ZapDeadCompiledLocals )  return;
1472 
1473   bool skip = false;
1474 
1475        if ( ZapDeadCompiledLocalsFirst  ==  0  ) ; // nothing special
1476   else if ( ZapDeadCompiledLocalsFirst  >  ZapDeadCompiledLocals_count )  skip = true;
1477   else if ( ZapDeadCompiledLocalsFirst  == ZapDeadCompiledLocals_count )
1478     warning("starting zapping after skipping");
1479 
1480        if ( ZapDeadCompiledLocalsLast  ==  -1  ) ; // nothing special
1481   else if ( ZapDeadCompiledLocalsLast  <   ZapDeadCompiledLocals_count )  skip = true;
1482   else if ( ZapDeadCompiledLocalsLast  ==  ZapDeadCompiledLocals_count )
1483     warning("about to zap last zap");
1484 
1485   ++ZapDeadCompiledLocals_count; // counts skipped zaps, too
1486 
1487   if ( skip )  return;
1488 
1489   // find java frame and zap it
1490 
1491   for (StackFrameStream sfs(thread);  !sfs.is_done();  sfs.next()) {
1492     if (is_this_the_right_frame_to_zap(sfs.current()) ) {
1493       sfs.current()->zap_dead_locals(thread, sfs.register_map());
1494       return;
1495     }
1496   }
1497   warning("no frame found to zap in zap_dead_Java_locals_C");
1498 }
1499 
1500 JRT_LEAF(void, OptoRuntime::zap_dead_Java_locals_C(JavaThread* thread))
1501   zap_dead_java_or_native_locals(thread, is_java_frame);
1502 JRT_END
1503 
1504 // The following does not work because for one thing, the
1505 // thread state is wrong; it expects java, but it is native.
1506 // Also, the invariants in a native stub are different and
1507 // I'm not sure it is safe to have a MachCalRuntimeDirectNode
1508 // in there.
1509 // So for now, we do not zap in native stubs.
1510 
1511 JRT_LEAF(void, OptoRuntime::zap_dead_native_locals_C(JavaThread* thread))
1512   zap_dead_java_or_native_locals(thread, is_native_frame);
1513 JRT_END
1514 
1515 # endif