1 /* 2 * Copyright (c) 1997, 2022, 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 "prims/vectorSupport.hpp" 32 #include "runtime/continuation.hpp" 33 #include "runtime/interfaceSupport.inline.hpp" 34 #include "runtime/timerTrace.hpp" 35 #include "runtime/sharedRuntime.hpp" 36 #include "runtime/stubRoutines.hpp" 37 #include "utilities/align.hpp" 38 #include "utilities/copy.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_cmpxchg_entry = NULL; 71 address StubRoutines::_atomic_cmpxchg_long_entry = NULL; 72 address StubRoutines::_atomic_add_entry = NULL; 73 address StubRoutines::_fence_entry = NULL; 74 75 // Compiled code entry points default values 76 // The default functions don't have separate disjoint versions. 77 address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); 78 address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); 79 address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); 80 address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); 81 address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); 82 address StubRoutines::_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit); 83 address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); 84 address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); 85 address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); 86 address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); 87 address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); 88 address StubRoutines::_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit); 89 90 address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); 91 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); 92 address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); 93 address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); 94 address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); 95 address StubRoutines::_arrayof_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit); 96 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); 97 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); 98 address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); 99 address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); 100 address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); 101 address StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit); 102 103 address StubRoutines::_data_cache_writeback = NULL; 104 address StubRoutines::_data_cache_writeback_sync = NULL; 105 106 address StubRoutines::_checkcast_arraycopy = NULL; 107 address StubRoutines::_checkcast_arraycopy_uninit = NULL; 108 address StubRoutines::_unsafe_arraycopy = NULL; 109 address StubRoutines::_generic_arraycopy = NULL; 110 111 address StubRoutines::_jbyte_fill; 112 address StubRoutines::_jshort_fill; 113 address StubRoutines::_jint_fill; 114 address StubRoutines::_arrayof_jbyte_fill; 115 address StubRoutines::_arrayof_jshort_fill; 116 address StubRoutines::_arrayof_jint_fill; 117 118 address StubRoutines::_aescrypt_encryptBlock = NULL; 119 address StubRoutines::_aescrypt_decryptBlock = NULL; 120 address StubRoutines::_cipherBlockChaining_encryptAESCrypt = NULL; 121 address StubRoutines::_cipherBlockChaining_decryptAESCrypt = NULL; 122 address StubRoutines::_electronicCodeBook_encryptAESCrypt = NULL; 123 address StubRoutines::_electronicCodeBook_decryptAESCrypt = NULL; 124 address StubRoutines::_counterMode_AESCrypt = NULL; 125 address StubRoutines::_galoisCounterMode_AESCrypt = NULL; 126 address StubRoutines::_ghash_processBlocks = NULL; 127 address StubRoutines::_chacha20Block = NULL; 128 address StubRoutines::_base64_encodeBlock = NULL; 129 address StubRoutines::_base64_decodeBlock = NULL; 130 address StubRoutines::_poly1305_processBlocks = NULL; 131 132 address StubRoutines::_md5_implCompress = NULL; 133 address StubRoutines::_md5_implCompressMB = NULL; 134 address StubRoutines::_sha1_implCompress = NULL; 135 address StubRoutines::_sha1_implCompressMB = NULL; 136 address StubRoutines::_sha256_implCompress = NULL; 137 address StubRoutines::_sha256_implCompressMB = NULL; 138 address StubRoutines::_sha512_implCompress = NULL; 139 address StubRoutines::_sha512_implCompressMB = NULL; 140 address StubRoutines::_sha3_implCompress = NULL; 141 address StubRoutines::_sha3_implCompressMB = NULL; 142 143 address StubRoutines::_updateBytesCRC32 = NULL; 144 address StubRoutines::_crc_table_adr = NULL; 145 146 address StubRoutines::_crc32c_table_addr = NULL; 147 address StubRoutines::_updateBytesCRC32C = NULL; 148 address StubRoutines::_updateBytesAdler32 = NULL; 149 150 address StubRoutines::_multiplyToLen = NULL; 151 address StubRoutines::_squareToLen = NULL; 152 address StubRoutines::_mulAdd = NULL; 153 address StubRoutines::_montgomeryMultiply = NULL; 154 address StubRoutines::_montgomerySquare = NULL; 155 address StubRoutines::_bigIntegerRightShiftWorker = NULL; 156 address StubRoutines::_bigIntegerLeftShiftWorker = 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::_load_inline_type_fields_in_regs = NULL; 172 address StubRoutines::_store_inline_type_fields_to_buf = NULL; 173 174 address StubRoutines::_vector_f_math[VectorSupport::NUM_VEC_SIZES][VectorSupport::NUM_SVML_OP] = {{NULL}, {NULL}}; 175 address StubRoutines::_vector_d_math[VectorSupport::NUM_VEC_SIZES][VectorSupport::NUM_SVML_OP] = {{NULL}, {NULL}}; 176 177 address StubRoutines::_cont_thaw = NULL; 178 address StubRoutines::_cont_returnBarrier = NULL; 179 address StubRoutines::_cont_returnBarrierExc = NULL; 180 181 JFR_ONLY(RuntimeStub* StubRoutines::_jfr_write_checkpoint_stub = NULL;) 182 JFR_ONLY(address StubRoutines::_jfr_write_checkpoint = NULL;) 183 184 // Initialization 185 // 186 // Note: to break cycle with universe initialization, stubs are generated in two phases. 187 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry). 188 // The second phase includes all other stubs (which may depend on universe being initialized.) 189 190 extern void StubGenerator_generate(CodeBuffer* code, int phase); // only interface to generators 191 192 void UnsafeCopyMemory::create_table(int max_size) { 193 UnsafeCopyMemory::_table = new UnsafeCopyMemory[max_size]; 194 UnsafeCopyMemory::_table_max_length = max_size; 195 } 196 197 bool UnsafeCopyMemory::contains_pc(address pc) { 198 for (int i = 0; i < UnsafeCopyMemory::_table_length; i++) { 199 UnsafeCopyMemory* entry = &UnsafeCopyMemory::_table[i]; 200 if (pc >= entry->start_pc() && pc < entry->end_pc()) { 201 return true; 202 } 203 } 204 return false; 205 } 206 207 address UnsafeCopyMemory::page_error_continue_pc(address pc) { 208 for (int i = 0; i < UnsafeCopyMemory::_table_length; i++) { 209 UnsafeCopyMemory* entry = &UnsafeCopyMemory::_table[i]; 210 if (pc >= entry->start_pc() && pc < entry->end_pc()) { 211 return entry->error_exit_pc(); 212 } 213 } 214 return NULL; 215 } 216 217 void StubRoutines::initialize1() { 218 if (_code1 == NULL) { 219 ResourceMark rm; 220 TraceTime timer("StubRoutines generation 1", TRACETIME_LOG(Info, startuptime)); 221 // Add extra space for large CodeEntryAlignment 222 int max_aligned_stubs = 10; 223 int size = code_size1 + CodeEntryAlignment * max_aligned_stubs; 224 _code1 = BufferBlob::create("StubRoutines (1)", size); 225 if (_code1 == NULL) { 226 vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)"); 227 } 228 CodeBuffer buffer(_code1); 229 StubGenerator_generate(&buffer, 0); 230 // When new stubs added we need to make sure there is some space left 231 // to catch situation when we should increase size again. 232 assert(code_size1 == 0 || buffer.insts_remaining() > 200, "increase code_size1"); 233 } 234 } 235 236 #ifdef ASSERT 237 typedef void (*arraycopy_fn)(address src, address dst, int count); 238 239 // simple tests of generated arraycopy functions 240 static void test_arraycopy_func(address func, int alignment) { 241 int v = 0xcc; 242 int v2 = 0x11; 243 jlong lbuffer[8]; 244 jlong lbuffer2[8]; 245 address fbuffer = (address) lbuffer; 246 address fbuffer2 = (address) lbuffer2; 247 unsigned int i; 248 for (i = 0; i < sizeof(lbuffer); i++) { 249 fbuffer[i] = v; fbuffer2[i] = v2; 250 } 251 // C++ does not guarantee jlong[] array alignment to 8 bytes. 252 // Use middle of array to check that memory before it is not modified. 253 address buffer = align_up((address)&lbuffer[4], BytesPerLong); 254 address buffer2 = align_up((address)&lbuffer2[4], BytesPerLong); 255 // do an aligned copy 256 ((arraycopy_fn)func)(buffer, buffer2, 0); 257 for (i = 0; i < sizeof(lbuffer); i++) { 258 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 259 } 260 // adjust destination alignment 261 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0); 262 for (i = 0; i < sizeof(lbuffer); i++) { 263 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 264 } 265 // adjust source alignment 266 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0); 267 for (i = 0; i < sizeof(lbuffer); i++) { 268 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 269 } 270 } 271 #endif // ASSERT 272 273 void StubRoutines::initializeContinuationStubs() { 274 if (_code3 == NULL) { 275 ResourceMark rm; 276 TraceTime timer("StubRoutines generation 3", TRACETIME_LOG(Info, startuptime)); 277 _code3 = BufferBlob::create("StubRoutines (3)", code_size2); 278 if (_code3 == NULL) { 279 vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (3)"); 280 } 281 CodeBuffer buffer(_code3); 282 StubGenerator_generate(&buffer, 1); 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_size3"); 286 } 287 } 288 289 void StubRoutines::initialize2() { 290 if (_code2 == NULL) { 291 ResourceMark rm; 292 TraceTime timer("StubRoutines generation 2", TRACETIME_LOG(Info, startuptime)); 293 // Add extra space for large CodeEntryAlignment 294 int max_aligned_stubs = 100; 295 int size = code_size2 + CodeEntryAlignment * max_aligned_stubs; 296 _code2 = BufferBlob::create("StubRoutines (2)", size); 297 if (_code2 == NULL) { 298 vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)"); 299 } 300 CodeBuffer buffer(_code2); 301 StubGenerator_generate(&buffer, 2); 302 // When new stubs added we need to make sure there is some space left 303 // to catch situation when we should increase size again. 304 assert(code_size2 == 0 || buffer.insts_remaining() > 200, "increase code_size2"); 305 } 306 307 #ifdef ASSERT 308 309 MACOS_AARCH64_ONLY(os::current_thread_enable_wx(WXExec)); 310 311 #define TEST_ARRAYCOPY(type) \ 312 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \ 313 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \ 314 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \ 315 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord)) 316 317 // Make sure all the arraycopy stubs properly handle zero count 318 TEST_ARRAYCOPY(jbyte); 319 TEST_ARRAYCOPY(jshort); 320 TEST_ARRAYCOPY(jint); 321 TEST_ARRAYCOPY(jlong); 322 323 #undef TEST_ARRAYCOPY 324 325 #define TEST_FILL(type) \ 326 if (_##type##_fill != NULL) { \ 327 union { \ 328 double d; \ 329 type body[96]; \ 330 } s; \ 331 \ 332 int v = 32; \ 333 for (int offset = -2; offset <= 2; offset++) { \ 334 for (int i = 0; i < 96; i++) { \ 335 s.body[i] = 1; \ 336 } \ 337 type* start = s.body + 8 + offset; \ 338 for (int aligned = 0; aligned < 2; aligned++) { \ 339 if (aligned) { \ 340 if (((intptr_t)start) % HeapWordSize == 0) { \ 341 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \ 342 } else { \ 343 continue; \ 344 } \ 345 } else { \ 346 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \ 347 } \ 348 for (int i = 0; i < 96; i++) { \ 349 if (i < (8 + offset) || i >= (88 + offset)) { \ 350 assert(s.body[i] == 1, "what?"); \ 351 } else { \ 352 assert(s.body[i] == 32, "what?"); \ 353 } \ 354 } \ 355 } \ 356 } \ 357 } \ 358 359 TEST_FILL(jbyte); 360 TEST_FILL(jshort); 361 TEST_FILL(jint); 362 363 #undef TEST_FILL 364 365 #define TEST_COPYRTN(type) \ 366 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \ 367 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type))) 368 369 // Make sure all the copy runtime routines properly handle zero count 370 TEST_COPYRTN(jbyte); 371 TEST_COPYRTN(jshort); 372 TEST_COPYRTN(jint); 373 TEST_COPYRTN(jlong); 374 375 #undef TEST_COPYRTN 376 377 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord)); 378 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord)); 379 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord)); 380 // Aligned to BytesPerLong 381 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong)); 382 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong)); 383 384 MACOS_AARCH64_ONLY(os::current_thread_enable_wx(WXWrite)); 385 386 #endif 387 } 388 389 390 void stubRoutines_init1() { StubRoutines::initialize1(); } 391 void stubRoutines_init2() { StubRoutines::initialize2(); } 392 void stubRoutines_initContinuationStubs() { StubRoutines::initializeContinuationStubs(); } 393 394 // 395 // Default versions of arraycopy functions 396 // 397 398 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count)) 399 #ifndef PRODUCT 400 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy 401 #endif // !PRODUCT 402 Copy::conjoint_jbytes_atomic(src, dest, count); 403 JRT_END 404 405 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count)) 406 #ifndef PRODUCT 407 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy 408 #endif // !PRODUCT 409 Copy::conjoint_jshorts_atomic(src, dest, count); 410 JRT_END 411 412 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count)) 413 #ifndef PRODUCT 414 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy 415 #endif // !PRODUCT 416 Copy::conjoint_jints_atomic(src, dest, count); 417 JRT_END 418 419 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count)) 420 #ifndef PRODUCT 421 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy 422 #endif // !PRODUCT 423 Copy::conjoint_jlongs_atomic(src, dest, count); 424 JRT_END 425 426 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count)) 427 #ifndef PRODUCT 428 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 429 #endif // !PRODUCT 430 assert(count != 0, "count should be non-zero"); 431 ArrayAccess<>::oop_arraycopy_raw((HeapWord*)src, (HeapWord*)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 ArrayAccess<IS_DEST_UNINITIALIZED>::oop_arraycopy_raw((HeapWord*)src, (HeapWord*)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 ArrayAccess<ARRAYCOPY_ARRAYOF>::oop_arraycopy_raw(src, dest, count); 476 JRT_END 477 478 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count)) 479 #ifndef PRODUCT 480 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 481 #endif // !PRODUCT 482 assert(count != 0, "count should be non-zero"); 483 ArrayAccess<ARRAYCOPY_ARRAYOF | IS_DEST_UNINITIALIZED>::oop_arraycopy_raw(src, dest, count); 484 JRT_END 485 486 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) { 487 #define RETURN_STUB(xxx_fill) { \ 488 name = #xxx_fill; \ 489 return StubRoutines::xxx_fill(); } 490 491 switch (t) { 492 case T_BYTE: 493 case T_BOOLEAN: 494 if (!aligned) RETURN_STUB(jbyte_fill); 495 RETURN_STUB(arrayof_jbyte_fill); 496 case T_CHAR: 497 case T_SHORT: 498 if (!aligned) RETURN_STUB(jshort_fill); 499 RETURN_STUB(arrayof_jshort_fill); 500 case T_INT: 501 case T_FLOAT: 502 if (!aligned) RETURN_STUB(jint_fill); 503 RETURN_STUB(arrayof_jint_fill); 504 case T_DOUBLE: 505 case T_LONG: 506 case T_ARRAY: 507 case T_PRIMITIVE_OBJECT: 508 case T_OBJECT: 509 case T_NARROWOOP: 510 case T_NARROWKLASS: 511 case T_ADDRESS: 512 case T_VOID: 513 // Currently unsupported 514 return NULL; 515 516 default: 517 ShouldNotReachHere(); 518 return NULL; 519 } 520 521 #undef RETURN_STUB 522 } 523 524 // constants for computing the copy function 525 enum { 526 COPYFUNC_UNALIGNED = 0, 527 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize 528 COPYFUNC_CONJOINT = 0, 529 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend 530 }; 531 532 // Note: The condition "disjoint" applies also for overlapping copies 533 // where an descending copy is permitted (i.e., dest_offset <= src_offset). 534 address 535 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) { 536 int selector = 537 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) + 538 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT); 539 540 #define RETURN_STUB(xxx_arraycopy) { \ 541 name = #xxx_arraycopy; \ 542 return StubRoutines::xxx_arraycopy(); } 543 544 #define RETURN_STUB_PARM(xxx_arraycopy, parm) { \ 545 name = parm ? #xxx_arraycopy "_uninit": #xxx_arraycopy; \ 546 return StubRoutines::xxx_arraycopy(parm); } 547 548 switch (t) { 549 case T_BYTE: 550 case T_BOOLEAN: 551 switch (selector) { 552 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy); 553 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy); 554 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy); 555 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy); 556 } 557 case T_CHAR: 558 case T_SHORT: 559 switch (selector) { 560 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy); 561 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy); 562 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy); 563 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy); 564 } 565 case T_INT: 566 case T_FLOAT: 567 switch (selector) { 568 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy); 569 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy); 570 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy); 571 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy); 572 } 573 case T_DOUBLE: 574 case T_LONG: 575 switch (selector) { 576 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy); 577 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy); 578 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy); 579 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy); 580 } 581 case T_ARRAY: 582 case T_OBJECT: 583 switch (selector) { 584 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized); 585 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized); 586 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized); 587 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized); 588 } 589 default: 590 ShouldNotReachHere(); 591 return NULL; 592 } 593 594 #undef RETURN_STUB 595 #undef RETURN_STUB_PARM 596 } 597 598 UnsafeCopyMemoryMark::UnsafeCopyMemoryMark(StubCodeGenerator* cgen, bool add_entry, bool continue_at_scope_end, address error_exit_pc) { 599 _cgen = cgen; 600 _ucm_entry = NULL; 601 if (add_entry) { 602 address err_exit_pc = NULL; 603 if (!continue_at_scope_end) { 604 err_exit_pc = error_exit_pc != NULL ? error_exit_pc : UnsafeCopyMemory::common_exit_stub_pc(); 605 } 606 assert(err_exit_pc != NULL || continue_at_scope_end, "error exit not set"); 607 _ucm_entry = UnsafeCopyMemory::add_to_table(_cgen->assembler()->pc(), NULL, err_exit_pc); 608 } 609 } 610 611 UnsafeCopyMemoryMark::~UnsafeCopyMemoryMark() { 612 if (_ucm_entry != NULL) { 613 _ucm_entry->set_end_pc(_cgen->assembler()->pc()); 614 if (_ucm_entry->error_exit_pc() == NULL) { 615 _ucm_entry->set_error_exit_pc(_cgen->assembler()->pc()); 616 } 617 } 618 }