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