1 /*
   2  * Copyright (c) 1997, 2015, 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 "asm/codeBuffer.hpp"
  27 #include "code/codeCacheExtensions.hpp"
  28 #include "memory/resourceArea.hpp"
  29 #include "oops/oop.inline.hpp"
  30 #include "runtime/interfaceSupport.hpp"
  31 #include "runtime/sharedRuntime.hpp"
  32 #include "runtime/stubRoutines.hpp"
  33 #include "runtime/timer.hpp"
  34 #include "utilities/copy.hpp"
  35 #ifdef COMPILER2
  36 #include "opto/runtime.hpp"
  37 #endif
  38 
  39 
  40 // Implementation of StubRoutines - for a description
  41 // of how to extend it, see the header file.
  42 
  43 // Class Variables
  44 
  45 BufferBlob* StubRoutines::_code1                                = NULL;
  46 BufferBlob* StubRoutines::_code2                                = NULL;
  47 
  48 address StubRoutines::_call_stub_return_address                 = NULL;
  49 address StubRoutines::_call_stub_entry                          = NULL;
  50 
  51 address StubRoutines::_catch_exception_entry                    = NULL;
  52 address StubRoutines::_forward_exception_entry                  = NULL;
  53 address StubRoutines::_throw_AbstractMethodError_entry          = NULL;
  54 address StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL;
  55 address StubRoutines::_throw_NullPointerException_at_call_entry = NULL;
  56 address StubRoutines::_throw_StackOverflowError_entry           = NULL;
  57 address StubRoutines::_throw_delayed_StackOverflowError_entry   = NULL;
  58 address StubRoutines::_handler_for_unsafe_access_entry          = NULL;
  59 jint    StubRoutines::_verify_oop_count                         = 0;
  60 address StubRoutines::_verify_oop_subroutine_entry              = NULL;
  61 address StubRoutines::_atomic_xchg_entry                        = NULL;
  62 address StubRoutines::_atomic_xchg_ptr_entry                    = NULL;
  63 address StubRoutines::_atomic_store_entry                       = NULL;
  64 address StubRoutines::_atomic_store_ptr_entry                   = NULL;
  65 address StubRoutines::_atomic_cmpxchg_entry                     = NULL;
  66 address StubRoutines::_atomic_cmpxchg_ptr_entry                 = NULL;
  67 address StubRoutines::_atomic_cmpxchg_byte_entry                = NULL;
  68 address StubRoutines::_atomic_cmpxchg_long_entry                = NULL;
  69 address StubRoutines::_atomic_add_entry                         = NULL;
  70 address StubRoutines::_atomic_add_ptr_entry                     = NULL;
  71 address StubRoutines::_fence_entry                              = NULL;
  72 address StubRoutines::_d2i_wrapper                              = NULL;
  73 address StubRoutines::_d2l_wrapper                              = NULL;
  74 
  75 jint    StubRoutines::_fpu_cntrl_wrd_std                        = 0;
  76 jint    StubRoutines::_fpu_cntrl_wrd_24                         = 0;
  77 jint    StubRoutines::_fpu_cntrl_wrd_64                         = 0;
  78 jint    StubRoutines::_fpu_cntrl_wrd_trunc                      = 0;
  79 jint    StubRoutines::_mxcsr_std                                = 0;
  80 jint    StubRoutines::_fpu_subnormal_bias1[3]                   = { 0, 0, 0 };
  81 jint    StubRoutines::_fpu_subnormal_bias2[3]                   = { 0, 0, 0 };
  82 
  83 // Compiled code entry points default values
  84 // The default functions don't have separate disjoint versions.
  85 address StubRoutines::_jbyte_arraycopy          = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
  86 address StubRoutines::_jshort_arraycopy         = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
  87 address StubRoutines::_jint_arraycopy           = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
  88 address StubRoutines::_jlong_arraycopy          = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
  89 address StubRoutines::_oop_arraycopy            = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
  90 address StubRoutines::_oop_arraycopy_uninit     = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
  91 address StubRoutines::_jbyte_disjoint_arraycopy          = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
  92 address StubRoutines::_jshort_disjoint_arraycopy         = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
  93 address StubRoutines::_jint_disjoint_arraycopy           = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
  94 address StubRoutines::_jlong_disjoint_arraycopy          = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
  95 address StubRoutines::_oop_disjoint_arraycopy            = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
  96 address StubRoutines::_oop_disjoint_arraycopy_uninit     = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
  97 
  98 address StubRoutines::_arrayof_jbyte_arraycopy  = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
  99 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
 100 address StubRoutines::_arrayof_jint_arraycopy   = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
 101 address StubRoutines::_arrayof_jlong_arraycopy  = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
 102 address StubRoutines::_arrayof_oop_arraycopy    = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
 103 address StubRoutines::_arrayof_oop_arraycopy_uninit      = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
 104 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy  = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
 105 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
 106 address StubRoutines::_arrayof_jint_disjoint_arraycopy   = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
 107 address StubRoutines::_arrayof_jlong_disjoint_arraycopy  = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
 108 address StubRoutines::_arrayof_oop_disjoint_arraycopy    = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
 109 address StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit  = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
 110 
 111 address StubRoutines::_zero_aligned_words = CAST_FROM_FN_PTR(address, Copy::zero_to_words);
 112 
 113 address StubRoutines::_checkcast_arraycopy               = NULL;
 114 address StubRoutines::_checkcast_arraycopy_uninit        = NULL;
 115 address StubRoutines::_unsafe_arraycopy                  = NULL;
 116 address StubRoutines::_generic_arraycopy                 = NULL;
 117 
 118 
 119 address StubRoutines::_jbyte_fill;
 120 address StubRoutines::_jshort_fill;
 121 address StubRoutines::_jint_fill;
 122 address StubRoutines::_arrayof_jbyte_fill;
 123 address StubRoutines::_arrayof_jshort_fill;
 124 address StubRoutines::_arrayof_jint_fill;
 125 
 126 address StubRoutines::_aescrypt_encryptBlock               = NULL;
 127 address StubRoutines::_aescrypt_decryptBlock               = NULL;
 128 address StubRoutines::_cipherBlockChaining_encryptAESCrypt = NULL;
 129 address StubRoutines::_cipherBlockChaining_decryptAESCrypt = NULL;
 130 address StubRoutines::_counterMode_AESCrypt                = NULL;
 131 address StubRoutines::_ghash_processBlocks                 = NULL;
 132 
 133 address StubRoutines::_sha1_implCompress     = NULL;
 134 address StubRoutines::_sha1_implCompressMB   = NULL;
 135 address StubRoutines::_sha256_implCompress   = NULL;
 136 address StubRoutines::_sha256_implCompressMB = NULL;
 137 address StubRoutines::_sha512_implCompress   = NULL;
 138 address StubRoutines::_sha512_implCompressMB = NULL;
 139 
 140 address StubRoutines::_updateBytesCRC32 = NULL;
 141 address StubRoutines::_crc_table_adr =    NULL;
 142 
 143 address StubRoutines::_crc32c_table_addr = NULL;
 144 address StubRoutines::_updateBytesCRC32C = NULL;
 145 address StubRoutines::_updateBytesAdler32 = NULL;
 146 
 147 address StubRoutines::_multiplyToLen = NULL;
 148 address StubRoutines::_squareToLen = NULL;
 149 address StubRoutines::_mulAdd = NULL;
 150 address StubRoutines::_montgomeryMultiply = NULL;
 151 address StubRoutines::_montgomerySquare = NULL;
 152 
 153 address StubRoutines::_vectorizedMismatch = NULL;
 154 
 155 address StubRoutines::_dexp = NULL;
 156 address StubRoutines::_dlog = NULL;
 157 address StubRoutines::_dpow = NULL;
 158 address StubRoutines::_dsin = NULL;
 159 address StubRoutines::_dcos = NULL;
 160 address StubRoutines::_dlibm_sin_cos_huge = NULL;
 161 address StubRoutines::_dlibm_reduce_pi04l = NULL;
 162 
 163 double (* StubRoutines::_intrinsic_log10 )(double) = NULL;
 164 double (* StubRoutines::_intrinsic_sin   )(double) = NULL;
 165 double (* StubRoutines::_intrinsic_cos   )(double) = NULL;
 166 double (* StubRoutines::_intrinsic_tan   )(double) = NULL;
 167 
 168 address StubRoutines::_safefetch32_entry                 = NULL;
 169 address StubRoutines::_safefetch32_fault_pc              = NULL;
 170 address StubRoutines::_safefetch32_continuation_pc       = NULL;
 171 address StubRoutines::_safefetchN_entry                  = NULL;
 172 address StubRoutines::_safefetchN_fault_pc               = NULL;
 173 address StubRoutines::_safefetchN_continuation_pc        = NULL;
 174 
 175 // Initialization
 176 //
 177 // Note: to break cycle with universe initialization, stubs are generated in two phases.
 178 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry).
 179 // The second phase includes all other stubs (which may depend on universe being initialized.)
 180 
 181 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators
 182 
 183 void StubRoutines::initialize1() {
 184   if (_code1 == NULL) {
 185     ResourceMark rm;
 186     TraceTime timer("StubRoutines generation 1", TraceStartupTime);
 187     _code1 = BufferBlob::create("StubRoutines (1)", code_size1);
 188     if (_code1 == NULL) {
 189       vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)");
 190     }
 191     CodeBuffer buffer(_code1);
 192     StubGenerator_generate(&buffer, false);
 193     // When new stubs added we need to make sure there is some space left
 194     // to catch situation when we should increase size again.
 195     assert(code_size1 == 0 || buffer.insts_remaining() > 200, "increase code_size1");
 196   }
 197 }
 198 
 199 
 200 #ifdef ASSERT
 201 typedef void (*arraycopy_fn)(address src, address dst, int count);
 202 
 203 // simple tests of generated arraycopy functions
 204 static void test_arraycopy_func(address func, int alignment) {
 205   if (CodeCacheExtensions::use_pregenerated_interpreter() || !CodeCacheExtensions::is_executable(func)) {
 206     // Exit safely if stubs were generated but cannot be used.
 207     // Also excluding pregenerated interpreter since the code may depend on
 208     // some registers being properly initialized (for instance Rthread)
 209     return;
 210   }
 211   int v = 0xcc;
 212   int v2 = 0x11;
 213   jlong lbuffer[8];
 214   jlong lbuffer2[8];
 215   address fbuffer  = (address) lbuffer;
 216   address fbuffer2 = (address) lbuffer2;
 217   unsigned int i;
 218   for (i = 0; i < sizeof(lbuffer); i++) {
 219     fbuffer[i] = v; fbuffer2[i] = v2;
 220   }
 221   // C++ does not guarantee jlong[] array alignment to 8 bytes.
 222   // Use middle of array to check that memory before it is not modified.
 223   address buffer  = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong);
 224   address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong);
 225   // do an aligned copy
 226   ((arraycopy_fn)func)(buffer, buffer2, 0);
 227   for (i = 0; i < sizeof(lbuffer); i++) {
 228     assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
 229   }
 230   // adjust destination alignment
 231   ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0);
 232   for (i = 0; i < sizeof(lbuffer); i++) {
 233     assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
 234   }
 235   // adjust source alignment
 236   ((arraycopy_fn)func)(buffer + alignment, buffer2, 0);
 237   for (i = 0; i < sizeof(lbuffer); i++) {
 238     assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
 239   }
 240 }
 241 
 242 // simple test for SafeFetch32
 243 static void test_safefetch32() {
 244   if (CanUseSafeFetch32()) {
 245     int dummy = 17;
 246     int* const p_invalid = (int*) get_segfault_address();
 247     int* const p_valid = &dummy;
 248     int result_invalid = SafeFetch32(p_invalid, 0xABC);
 249     assert(result_invalid == 0xABC, "SafeFetch32 error");
 250     int result_valid = SafeFetch32(p_valid, 0xABC);
 251     assert(result_valid == 17, "SafeFetch32 error");
 252   }
 253 }
 254 
 255 // simple test for SafeFetchN
 256 static void test_safefetchN() {
 257   if (CanUseSafeFetchN()) {
 258 #ifdef _LP64
 259     const intptr_t v1 = UCONST64(0xABCD00000000ABCD);
 260     const intptr_t v2 = UCONST64(0xDEFD00000000DEFD);
 261 #else
 262     const intptr_t v1 = 0xABCDABCD;
 263     const intptr_t v2 = 0xDEFDDEFD;
 264 #endif
 265     intptr_t dummy = v1;
 266     intptr_t* const p_invalid = (intptr_t*) get_segfault_address();
 267     intptr_t* const p_valid = &dummy;
 268     intptr_t result_invalid = SafeFetchN(p_invalid, v2);
 269     assert(result_invalid == v2, "SafeFetchN error");
 270     intptr_t result_valid = SafeFetchN(p_valid, v2);
 271     assert(result_valid == v1, "SafeFetchN error");
 272   }
 273 }
 274 #endif
 275 
 276 void StubRoutines::initialize2() {
 277   if (_code2 == NULL) {
 278     ResourceMark rm;
 279     TraceTime timer("StubRoutines generation 2", TraceStartupTime);
 280     _code2 = BufferBlob::create("StubRoutines (2)", code_size2);
 281     if (_code2 == NULL) {
 282       vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)");
 283     }
 284     CodeBuffer buffer(_code2);
 285     StubGenerator_generate(&buffer, true);
 286     // When new stubs added we need to make sure there is some space left
 287     // to catch situation when we should increase size again.
 288     assert(code_size2 == 0 || buffer.insts_remaining() > 200, "increase code_size2");
 289   }
 290 
 291 #ifdef ASSERT
 292 
 293 #define TEST_ARRAYCOPY(type)                                                    \
 294   test_arraycopy_func(          type##_arraycopy(),          sizeof(type));     \
 295   test_arraycopy_func(          type##_disjoint_arraycopy(), sizeof(type));     \
 296   test_arraycopy_func(arrayof_##type##_arraycopy(),          sizeof(HeapWord)); \
 297   test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord))
 298 
 299   // Make sure all the arraycopy stubs properly handle zero count
 300   TEST_ARRAYCOPY(jbyte);
 301   TEST_ARRAYCOPY(jshort);
 302   TEST_ARRAYCOPY(jint);
 303   TEST_ARRAYCOPY(jlong);
 304 
 305 #undef TEST_ARRAYCOPY
 306 
 307 #define TEST_FILL(type)                                                                      \
 308   if (_##type##_fill != NULL) {                                                              \
 309     union {                                                                                  \
 310       double d;                                                                              \
 311       type body[96];                                                                         \
 312     } s;                                                                                     \
 313                                                                                              \
 314     int v = 32;                                                                              \
 315     for (int offset = -2; offset <= 2; offset++) {                                           \
 316       for (int i = 0; i < 96; i++) {                                                         \
 317         s.body[i] = 1;                                                                       \
 318       }                                                                                      \
 319       type* start = s.body + 8 + offset;                                                     \
 320       for (int aligned = 0; aligned < 2; aligned++) {                                        \
 321         if (aligned) {                                                                       \
 322           if (((intptr_t)start) % HeapWordSize == 0) {                                       \
 323             ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \
 324           } else {                                                                           \
 325             continue;                                                                        \
 326           }                                                                                  \
 327         } else {                                                                             \
 328           ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80);           \
 329         }                                                                                    \
 330         for (int i = 0; i < 96; i++) {                                                       \
 331           if (i < (8 + offset) || i >= (88 + offset)) {                                      \
 332             assert(s.body[i] == 1, "what?");                                                 \
 333           } else {                                                                           \
 334             assert(s.body[i] == 32, "what?");                                                \
 335           }                                                                                  \
 336         }                                                                                    \
 337       }                                                                                      \
 338     }                                                                                        \
 339   }                                                                                          \
 340 
 341   TEST_FILL(jbyte);
 342   TEST_FILL(jshort);
 343   TEST_FILL(jint);
 344 
 345 #undef TEST_FILL
 346 
 347 #define TEST_COPYRTN(type) \
 348   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic),  sizeof(type)); \
 349   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type)))
 350 
 351   // Make sure all the copy runtime routines properly handle zero count
 352   TEST_COPYRTN(jbyte);
 353   TEST_COPYRTN(jshort);
 354   TEST_COPYRTN(jint);
 355   TEST_COPYRTN(jlong);
 356 
 357 #undef TEST_COPYRTN
 358 
 359   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord));
 360   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord));
 361   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord));
 362   // Aligned to BytesPerLong
 363   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong));
 364   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong));
 365 
 366   // test safefetch routines
 367   // Not on Windows 32bit until 8074860 is fixed
 368 #if ! (defined(_WIN32) && defined(_M_IX86))
 369   test_safefetch32();
 370   test_safefetchN();
 371 #endif
 372 
 373 #endif
 374 }
 375 
 376 
 377 void stubRoutines_init1() { StubRoutines::initialize1(); }
 378 void stubRoutines_init2() { StubRoutines::initialize2(); }
 379 
 380 //
 381 // Default versions of arraycopy functions
 382 //
 383 
 384 static void gen_arraycopy_barrier_pre(oop* dest, size_t count, bool dest_uninitialized) {
 385     assert(count != 0, "count should be non-zero");
 386     assert(count <= (size_t)max_intx, "count too large");
 387     BarrierSet* bs = Universe::heap()->barrier_set();
 388     assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt");
 389     bs->write_ref_array_pre(dest, (int)count, dest_uninitialized);
 390 }
 391 
 392 static void gen_arraycopy_barrier(oop* dest, size_t count) {
 393     assert(count != 0, "count should be non-zero");
 394     BarrierSet* bs = Universe::heap()->barrier_set();
 395     assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
 396     bs->write_ref_array((HeapWord*)dest, count);
 397 }
 398 
 399 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
 400 #ifndef PRODUCT
 401   SharedRuntime::_jbyte_array_copy_ctr++;      // Slow-path byte array copy
 402 #endif // !PRODUCT
 403   Copy::conjoint_jbytes_atomic(src, dest, count);
 404 JRT_END
 405 
 406 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
 407 #ifndef PRODUCT
 408   SharedRuntime::_jshort_array_copy_ctr++;     // Slow-path short/char array copy
 409 #endif // !PRODUCT
 410   Copy::conjoint_jshorts_atomic(src, dest, count);
 411 JRT_END
 412 
 413 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
 414 #ifndef PRODUCT
 415   SharedRuntime::_jint_array_copy_ctr++;       // Slow-path int/float array copy
 416 #endif // !PRODUCT
 417   Copy::conjoint_jints_atomic(src, dest, count);
 418 JRT_END
 419 
 420 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
 421 #ifndef PRODUCT
 422   SharedRuntime::_jlong_array_copy_ctr++;      // Slow-path long/double array copy
 423 #endif // !PRODUCT
 424   Copy::conjoint_jlongs_atomic(src, dest, count);
 425 JRT_END
 426 
 427 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
 428 #ifndef PRODUCT
 429   SharedRuntime::_oop_array_copy_ctr++;        // Slow-path oop array copy
 430 #endif // !PRODUCT
 431   assert(count != 0, "count should be non-zero");
 432   gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false);
 433   Copy::conjoint_oops_atomic(src, dest, count);
 434   gen_arraycopy_barrier(dest, count);
 435 JRT_END
 436 
 437 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count))
 438 #ifndef PRODUCT
 439   SharedRuntime::_oop_array_copy_ctr++;        // Slow-path oop array copy
 440 #endif // !PRODUCT
 441   assert(count != 0, "count should be non-zero");
 442   gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true);
 443   Copy::conjoint_oops_atomic(src, dest, count);
 444   gen_arraycopy_barrier(dest, count);
 445 JRT_END
 446 
 447 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
 448 #ifndef PRODUCT
 449   SharedRuntime::_jbyte_array_copy_ctr++;      // Slow-path byte array copy
 450 #endif // !PRODUCT
 451   Copy::arrayof_conjoint_jbytes(src, dest, count);
 452 JRT_END
 453 
 454 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
 455 #ifndef PRODUCT
 456   SharedRuntime::_jshort_array_copy_ctr++;     // Slow-path short/char array copy
 457 #endif // !PRODUCT
 458   Copy::arrayof_conjoint_jshorts(src, dest, count);
 459 JRT_END
 460 
 461 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count))
 462 #ifndef PRODUCT
 463   SharedRuntime::_jint_array_copy_ctr++;       // Slow-path int/float array copy
 464 #endif // !PRODUCT
 465   Copy::arrayof_conjoint_jints(src, dest, count);
 466 JRT_END
 467 
 468 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
 469 #ifndef PRODUCT
 470   SharedRuntime::_jlong_array_copy_ctr++;       // Slow-path int/float array copy
 471 #endif // !PRODUCT
 472   Copy::arrayof_conjoint_jlongs(src, dest, count);
 473 JRT_END
 474 
 475 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count))
 476 #ifndef PRODUCT
 477   SharedRuntime::_oop_array_copy_ctr++;        // Slow-path oop array copy
 478 #endif // !PRODUCT
 479   assert(count != 0, "count should be non-zero");
 480   gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/false);
 481   Copy::arrayof_conjoint_oops(src, dest, count);
 482   gen_arraycopy_barrier((oop *) dest, count);
 483 JRT_END
 484 
 485 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count))
 486 #ifndef PRODUCT
 487   SharedRuntime::_oop_array_copy_ctr++;        // Slow-path oop array copy
 488 #endif // !PRODUCT
 489   assert(count != 0, "count should be non-zero");
 490   gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/true);
 491   Copy::arrayof_conjoint_oops(src, dest, count);
 492   gen_arraycopy_barrier((oop *) dest, count);
 493 JRT_END
 494 
 495 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) {
 496 #define RETURN_STUB(xxx_fill) { \
 497   name = #xxx_fill; \
 498   return StubRoutines::xxx_fill(); }
 499 
 500   switch (t) {
 501   case T_BYTE:
 502   case T_BOOLEAN:
 503     if (!aligned) RETURN_STUB(jbyte_fill);
 504     RETURN_STUB(arrayof_jbyte_fill);
 505   case T_CHAR:
 506   case T_SHORT:
 507     if (!aligned) RETURN_STUB(jshort_fill);
 508     RETURN_STUB(arrayof_jshort_fill);
 509   case T_INT:
 510   case T_FLOAT:
 511     if (!aligned) RETURN_STUB(jint_fill);
 512     RETURN_STUB(arrayof_jint_fill);
 513   case T_DOUBLE:
 514   case T_LONG:
 515   case T_ARRAY:
 516   case T_OBJECT:
 517   case T_NARROWOOP:
 518   case T_NARROWKLASS:
 519   case T_ADDRESS:
 520     // Currently unsupported
 521     return NULL;
 522 
 523   default:
 524     ShouldNotReachHere();
 525     return NULL;
 526   }
 527 
 528 #undef RETURN_STUB
 529 }
 530 
 531 // constants for computing the copy function
 532 enum {
 533   COPYFUNC_UNALIGNED = 0,
 534   COPYFUNC_ALIGNED = 1,                 // src, dest aligned to HeapWordSize
 535   COPYFUNC_CONJOINT = 0,
 536   COPYFUNC_DISJOINT = 2                 // src != dest, or transfer can descend
 537 };
 538 
 539 // Note:  The condition "disjoint" applies also for overlapping copies
 540 // where an descending copy is permitted (i.e., dest_offset <= src_offset).
 541 address
 542 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) {
 543   int selector =
 544     (aligned  ? COPYFUNC_ALIGNED  : COPYFUNC_UNALIGNED) +
 545     (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT);
 546 
 547 #define RETURN_STUB(xxx_arraycopy) { \
 548   name = #xxx_arraycopy; \
 549   return StubRoutines::xxx_arraycopy(); }
 550 
 551 #define RETURN_STUB_PARM(xxx_arraycopy, parm) {           \
 552   name = #xxx_arraycopy; \
 553   return StubRoutines::xxx_arraycopy(parm); }
 554 
 555   switch (t) {
 556   case T_BYTE:
 557   case T_BOOLEAN:
 558     switch (selector) {
 559     case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jbyte_arraycopy);
 560     case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jbyte_arraycopy);
 561     case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jbyte_disjoint_arraycopy);
 562     case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jbyte_disjoint_arraycopy);
 563     }
 564   case T_CHAR:
 565   case T_SHORT:
 566     switch (selector) {
 567     case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jshort_arraycopy);
 568     case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jshort_arraycopy);
 569     case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jshort_disjoint_arraycopy);
 570     case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jshort_disjoint_arraycopy);
 571     }
 572   case T_INT:
 573   case T_FLOAT:
 574     switch (selector) {
 575     case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jint_arraycopy);
 576     case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jint_arraycopy);
 577     case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jint_disjoint_arraycopy);
 578     case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jint_disjoint_arraycopy);
 579     }
 580   case T_DOUBLE:
 581   case T_LONG:
 582     switch (selector) {
 583     case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jlong_arraycopy);
 584     case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jlong_arraycopy);
 585     case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jlong_disjoint_arraycopy);
 586     case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jlong_disjoint_arraycopy);
 587     }
 588   case T_ARRAY:
 589   case T_OBJECT:
 590     switch (selector) {
 591     case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized);
 592     case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized);
 593     case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized);
 594     case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized);
 595     }
 596   default:
 597     ShouldNotReachHere();
 598     return NULL;
 599   }
 600 
 601 #undef RETURN_STUB
 602 #undef RETURN_STUB_PARM
 603 }