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