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