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