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