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