1 /* 2 * Copyright (c) 1997, 2015, 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 "code/codeCacheExtensions.hpp" 28 #include "memory/resourceArea.hpp" 29 #include "oops/oop.inline.hpp" 30 #include "runtime/interfaceSupport.hpp" 31 #include "runtime/sharedRuntime.hpp" 32 #include "runtime/stubRoutines.hpp" 33 #include "runtime/timer.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::_handler_for_unsafe_access_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::_ghash_processBlocks = NULL; 130 131 address StubRoutines::_sha1_implCompress = NULL; 132 address StubRoutines::_sha1_implCompressMB = NULL; 133 address StubRoutines::_sha256_implCompress = NULL; 134 address StubRoutines::_sha256_implCompressMB = NULL; 135 address StubRoutines::_sha512_implCompress = NULL; 136 address StubRoutines::_sha512_implCompressMB = NULL; 137 138 address StubRoutines::_updateBytesCRC32 = NULL; 139 address StubRoutines::_crc_table_adr = NULL; 140 141 address StubRoutines::_crc32c_table_addr = NULL; 142 address StubRoutines::_updateBytesCRC32C = NULL; 143 address StubRoutines::_updateBytesAdler32 = NULL; 144 145 address StubRoutines::_multiplyToLen = NULL; 146 address StubRoutines::_squareToLen = NULL; 147 address StubRoutines::_mulAdd = NULL; 148 address StubRoutines::_montgomeryMultiply = NULL; 149 address StubRoutines::_montgomerySquare = NULL; 150 151 address StubRoutines::_dexp = NULL; 152 address StubRoutines::_dlog = NULL; 153 154 double (* StubRoutines::_intrinsic_log )(double) = NULL; 155 double (* StubRoutines::_intrinsic_log10 )(double) = NULL; 156 double (* StubRoutines::_intrinsic_pow )(double, double) = NULL; 157 double (* StubRoutines::_intrinsic_sin )(double) = NULL; 158 double (* StubRoutines::_intrinsic_cos )(double) = NULL; 159 double (* StubRoutines::_intrinsic_tan )(double) = NULL; 160 161 address StubRoutines::_safefetch32_entry = NULL; 162 address StubRoutines::_safefetch32_fault_pc = NULL; 163 address StubRoutines::_safefetch32_continuation_pc = NULL; 164 address StubRoutines::_safefetchN_entry = NULL; 165 address StubRoutines::_safefetchN_fault_pc = NULL; 166 address StubRoutines::_safefetchN_continuation_pc = NULL; 167 168 // Initialization 169 // 170 // Note: to break cycle with universe initialization, stubs are generated in two phases. 171 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry). 172 // The second phase includes all other stubs (which may depend on universe being initialized.) 173 174 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators 175 176 void StubRoutines::initialize1() { 177 if (_code1 == NULL) { 178 ResourceMark rm; 179 TraceTime timer("StubRoutines generation 1", TraceStartupTime); 180 _code1 = BufferBlob::create("StubRoutines (1)", code_size1); 181 if (_code1 == NULL) { 182 vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)"); 183 } 184 CodeBuffer buffer(_code1); 185 StubGenerator_generate(&buffer, false); 186 // When new stubs added we need to make sure there is some space left 187 // to catch situation when we should increase size again. 188 assert(code_size1 == 0 || buffer.insts_remaining() > 200, "increase code_size1"); 189 } 190 } 191 192 193 #ifdef ASSERT 194 typedef void (*arraycopy_fn)(address src, address dst, int count); 195 196 // simple tests of generated arraycopy functions 197 static void test_arraycopy_func(address func, int alignment) { 198 if (CodeCacheExtensions::use_pregenerated_interpreter() || !CodeCacheExtensions::is_executable(func)) { 199 // Exit safely if stubs were generated but cannot be used. 200 // Also excluding pregenerated interpreter since the code may depend on 201 // some registers being properly initialized (for instance Rthread) 202 return; 203 } 204 int v = 0xcc; 205 int v2 = 0x11; 206 jlong lbuffer[8]; 207 jlong lbuffer2[8]; 208 address fbuffer = (address) lbuffer; 209 address fbuffer2 = (address) lbuffer2; 210 unsigned int i; 211 for (i = 0; i < sizeof(lbuffer); i++) { 212 fbuffer[i] = v; fbuffer2[i] = v2; 213 } 214 // C++ does not guarantee jlong[] array alignment to 8 bytes. 215 // Use middle of array to check that memory before it is not modified. 216 address buffer = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong); 217 address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong); 218 // do an aligned copy 219 ((arraycopy_fn)func)(buffer, buffer2, 0); 220 for (i = 0; i < sizeof(lbuffer); i++) { 221 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 222 } 223 // adjust destination alignment 224 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0); 225 for (i = 0; i < sizeof(lbuffer); i++) { 226 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 227 } 228 // adjust source alignment 229 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0); 230 for (i = 0; i < sizeof(lbuffer); i++) { 231 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 232 } 233 } 234 235 // simple test for SafeFetch32 236 static void test_safefetch32() { 237 if (CanUseSafeFetch32()) { 238 int dummy = 17; 239 int* const p_invalid = (int*) get_segfault_address(); 240 int* const p_valid = &dummy; 241 int result_invalid = SafeFetch32(p_invalid, 0xABC); 242 assert(result_invalid == 0xABC, "SafeFetch32 error"); 243 int result_valid = SafeFetch32(p_valid, 0xABC); 244 assert(result_valid == 17, "SafeFetch32 error"); 245 } 246 } 247 248 // simple test for SafeFetchN 249 static void test_safefetchN() { 250 if (CanUseSafeFetchN()) { 251 #ifdef _LP64 252 const intptr_t v1 = UCONST64(0xABCD00000000ABCD); 253 const intptr_t v2 = UCONST64(0xDEFD00000000DEFD); 254 #else 255 const intptr_t v1 = 0xABCDABCD; 256 const intptr_t v2 = 0xDEFDDEFD; 257 #endif 258 intptr_t dummy = v1; 259 intptr_t* const p_invalid = (intptr_t*) get_segfault_address(); 260 intptr_t* const p_valid = &dummy; 261 intptr_t result_invalid = SafeFetchN(p_invalid, v2); 262 assert(result_invalid == v2, "SafeFetchN error"); 263 intptr_t result_valid = SafeFetchN(p_valid, v2); 264 assert(result_valid == v1, "SafeFetchN error"); 265 } 266 } 267 #endif 268 269 void StubRoutines::initialize2() { 270 if (_code2 == NULL) { 271 ResourceMark rm; 272 TraceTime timer("StubRoutines generation 2", TraceStartupTime); 273 _code2 = BufferBlob::create("StubRoutines (2)", code_size2); 274 if (_code2 == NULL) { 275 vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)"); 276 } 277 CodeBuffer buffer(_code2); 278 StubGenerator_generate(&buffer, true); 279 // When new stubs added we need to make sure there is some space left 280 // to catch situation when we should increase size again. 281 assert(code_size2 == 0 || buffer.insts_remaining() > 200, "increase code_size2"); 282 } 283 284 #ifdef ASSERT 285 286 #define TEST_ARRAYCOPY(type) \ 287 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \ 288 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \ 289 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \ 290 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord)) 291 292 // Make sure all the arraycopy stubs properly handle zero count 293 TEST_ARRAYCOPY(jbyte); 294 TEST_ARRAYCOPY(jshort); 295 TEST_ARRAYCOPY(jint); 296 TEST_ARRAYCOPY(jlong); 297 298 #undef TEST_ARRAYCOPY 299 300 #define TEST_FILL(type) \ 301 if (_##type##_fill != NULL) { \ 302 union { \ 303 double d; \ 304 type body[96]; \ 305 } s; \ 306 \ 307 int v = 32; \ 308 for (int offset = -2; offset <= 2; offset++) { \ 309 for (int i = 0; i < 96; i++) { \ 310 s.body[i] = 1; \ 311 } \ 312 type* start = s.body + 8 + offset; \ 313 for (int aligned = 0; aligned < 2; aligned++) { \ 314 if (aligned) { \ 315 if (((intptr_t)start) % HeapWordSize == 0) { \ 316 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \ 317 } else { \ 318 continue; \ 319 } \ 320 } else { \ 321 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \ 322 } \ 323 for (int i = 0; i < 96; i++) { \ 324 if (i < (8 + offset) || i >= (88 + offset)) { \ 325 assert(s.body[i] == 1, "what?"); \ 326 } else { \ 327 assert(s.body[i] == 32, "what?"); \ 328 } \ 329 } \ 330 } \ 331 } \ 332 } \ 333 334 TEST_FILL(jbyte); 335 TEST_FILL(jshort); 336 TEST_FILL(jint); 337 338 #undef TEST_FILL 339 340 #define TEST_COPYRTN(type) \ 341 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \ 342 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type))) 343 344 // Make sure all the copy runtime routines properly handle zero count 345 TEST_COPYRTN(jbyte); 346 TEST_COPYRTN(jshort); 347 TEST_COPYRTN(jint); 348 TEST_COPYRTN(jlong); 349 350 #undef TEST_COPYRTN 351 352 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord)); 353 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord)); 354 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord)); 355 // Aligned to BytesPerLong 356 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong)); 357 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong)); 358 359 // test safefetch routines 360 // Not on Windows 32bit until 8074860 is fixed 361 #if ! (defined(_WIN32) && defined(_M_IX86)) 362 test_safefetch32(); 363 test_safefetchN(); 364 #endif 365 366 #endif 367 } 368 369 370 void stubRoutines_init1() { StubRoutines::initialize1(); } 371 void stubRoutines_init2() { StubRoutines::initialize2(); } 372 373 // 374 // Default versions of arraycopy functions 375 // 376 377 static void gen_arraycopy_barrier_pre(oop* dest, size_t count, bool dest_uninitialized) { 378 assert(count != 0, "count should be non-zero"); 379 assert(count <= (size_t)max_intx, "count too large"); 380 BarrierSet* bs = Universe::heap()->barrier_set(); 381 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt"); 382 bs->write_ref_array_pre(dest, (int)count, dest_uninitialized); 383 } 384 385 static void gen_arraycopy_barrier(oop* dest, size_t count) { 386 assert(count != 0, "count should be non-zero"); 387 BarrierSet* bs = Universe::heap()->barrier_set(); 388 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); 389 bs->write_ref_array((HeapWord*)dest, count); 390 } 391 392 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count)) 393 #ifndef PRODUCT 394 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy 395 #endif // !PRODUCT 396 Copy::conjoint_jbytes_atomic(src, dest, count); 397 JRT_END 398 399 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count)) 400 #ifndef PRODUCT 401 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy 402 #endif // !PRODUCT 403 Copy::conjoint_jshorts_atomic(src, dest, count); 404 JRT_END 405 406 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count)) 407 #ifndef PRODUCT 408 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy 409 #endif // !PRODUCT 410 Copy::conjoint_jints_atomic(src, dest, count); 411 JRT_END 412 413 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count)) 414 #ifndef PRODUCT 415 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy 416 #endif // !PRODUCT 417 Copy::conjoint_jlongs_atomic(src, dest, count); 418 JRT_END 419 420 JRT_LEAF(void, StubRoutines::oop_copy(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 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false); 426 Copy::conjoint_oops_atomic(src, dest, count); 427 gen_arraycopy_barrier(dest, count); 428 JRT_END 429 430 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count)) 431 #ifndef PRODUCT 432 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 433 #endif // !PRODUCT 434 assert(count != 0, "count should be non-zero"); 435 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true); 436 Copy::conjoint_oops_atomic(src, dest, count); 437 gen_arraycopy_barrier(dest, count); 438 JRT_END 439 440 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count)) 441 #ifndef PRODUCT 442 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy 443 #endif // !PRODUCT 444 Copy::arrayof_conjoint_jbytes(src, dest, count); 445 JRT_END 446 447 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count)) 448 #ifndef PRODUCT 449 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy 450 #endif // !PRODUCT 451 Copy::arrayof_conjoint_jshorts(src, dest, count); 452 JRT_END 453 454 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count)) 455 #ifndef PRODUCT 456 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy 457 #endif // !PRODUCT 458 Copy::arrayof_conjoint_jints(src, dest, count); 459 JRT_END 460 461 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count)) 462 #ifndef PRODUCT 463 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy 464 #endif // !PRODUCT 465 Copy::arrayof_conjoint_jlongs(src, dest, count); 466 JRT_END 467 468 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* 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 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/false); 474 Copy::arrayof_conjoint_oops(src, dest, count); 475 gen_arraycopy_barrier((oop *) 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 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/true); 484 Copy::arrayof_conjoint_oops(src, dest, count); 485 gen_arraycopy_barrier((oop *) dest, count); 486 JRT_END 487 488 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) { 489 #define RETURN_STUB(xxx_fill) { \ 490 name = #xxx_fill; \ 491 return StubRoutines::xxx_fill(); } 492 493 switch (t) { 494 case T_BYTE: 495 case T_BOOLEAN: 496 if (!aligned) RETURN_STUB(jbyte_fill); 497 RETURN_STUB(arrayof_jbyte_fill); 498 case T_CHAR: 499 case T_SHORT: 500 if (!aligned) RETURN_STUB(jshort_fill); 501 RETURN_STUB(arrayof_jshort_fill); 502 case T_INT: 503 case T_FLOAT: 504 if (!aligned) RETURN_STUB(jint_fill); 505 RETURN_STUB(arrayof_jint_fill); 506 case T_DOUBLE: 507 case T_LONG: 508 case T_ARRAY: 509 case T_OBJECT: 510 case T_NARROWOOP: 511 case T_NARROWKLASS: 512 case T_ADDRESS: 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 = #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 }