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 double (* StubRoutines::_intrinsic_log )(double) = NULL; 152 double (* StubRoutines::_intrinsic_log10 )(double) = NULL; 153 double (* StubRoutines::_intrinsic_exp )(double) = NULL; 154 double (* StubRoutines::_intrinsic_pow )(double, double) = NULL; 155 double (* StubRoutines::_intrinsic_sin )(double) = NULL; 156 double (* StubRoutines::_intrinsic_cos )(double) = NULL; 157 double (* StubRoutines::_intrinsic_tan )(double) = NULL; 158 159 address StubRoutines::_safefetch32_entry = NULL; 160 address StubRoutines::_safefetch32_fault_pc = NULL; 161 address StubRoutines::_safefetch32_continuation_pc = NULL; 162 address StubRoutines::_safefetchN_entry = NULL; 163 address StubRoutines::_safefetchN_fault_pc = NULL; 164 address StubRoutines::_safefetchN_continuation_pc = NULL; 165 166 // Initialization 167 // 168 // Note: to break cycle with universe initialization, stubs are generated in two phases. 169 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry). 170 // The second phase includes all other stubs (which may depend on universe being initialized.) 171 172 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators 173 174 void StubRoutines::initialize1() { 175 if (_code1 == NULL) { 176 ResourceMark rm; 177 TraceTime timer("StubRoutines generation 1", TraceStartupTime); 178 _code1 = BufferBlob::create("StubRoutines (1)", code_size1); 179 if (_code1 == NULL) { 180 vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)"); 181 } 182 CodeBuffer buffer(_code1); 183 StubGenerator_generate(&buffer, false); 184 // When new stubs added we need to make sure there is some space left 185 // to catch situation when we should increase size again. 186 assert(code_size1 == 0 || buffer.insts_remaining() > 200, "increase code_size1"); 187 } 188 } 189 190 191 #ifdef ASSERT 192 typedef void (*arraycopy_fn)(address src, address dst, int count); 193 194 // simple tests of generated arraycopy functions 195 static void test_arraycopy_func(address func, int alignment) { 196 if (CodeCacheExtensions::use_pregenerated_interpreter() || !CodeCacheExtensions::is_executable(func)) { 197 // Exit safely if stubs were generated but cannot be used. 198 // Also excluding pregenerated interpreter since the code may depend on 199 // some registers being properly initialized (for instance Rthread) 200 return; 201 } 202 int v = 0xcc; 203 int v2 = 0x11; 204 jlong lbuffer[8]; 205 jlong lbuffer2[8]; 206 address fbuffer = (address) lbuffer; 207 address fbuffer2 = (address) lbuffer2; 208 unsigned int i; 209 for (i = 0; i < sizeof(lbuffer); i++) { 210 fbuffer[i] = v; fbuffer2[i] = v2; 211 } 212 // C++ does not guarantee jlong[] array alignment to 8 bytes. 213 // Use middle of array to check that memory before it is not modified. 214 address buffer = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong); 215 address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong); 216 // do an aligned copy 217 ((arraycopy_fn)func)(buffer, buffer2, 0); 218 for (i = 0; i < sizeof(lbuffer); i++) { 219 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 220 } 221 // adjust destination alignment 222 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 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 source alignment 227 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0); 228 for (i = 0; i < sizeof(lbuffer); i++) { 229 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 230 } 231 } 232 233 // simple test for SafeFetch32 234 static void test_safefetch32() { 235 if (CanUseSafeFetch32()) { 236 int dummy = 17; 237 int* const p_invalid = (int*) get_segfault_address(); 238 int* const p_valid = &dummy; 239 int result_invalid = SafeFetch32(p_invalid, 0xABC); 240 assert(result_invalid == 0xABC, "SafeFetch32 error"); 241 int result_valid = SafeFetch32(p_valid, 0xABC); 242 assert(result_valid == 17, "SafeFetch32 error"); 243 } 244 } 245 246 // simple test for SafeFetchN 247 static void test_safefetchN() { 248 if (CanUseSafeFetchN()) { 249 #ifdef _LP64 250 const intptr_t v1 = UCONST64(0xABCD00000000ABCD); 251 const intptr_t v2 = UCONST64(0xDEFD00000000DEFD); 252 #else 253 const intptr_t v1 = 0xABCDABCD; 254 const intptr_t v2 = 0xDEFDDEFD; 255 #endif 256 intptr_t dummy = v1; 257 intptr_t* const p_invalid = (intptr_t*) get_segfault_address(); 258 intptr_t* const p_valid = &dummy; 259 intptr_t result_invalid = SafeFetchN(p_invalid, v2); 260 assert(result_invalid == v2, "SafeFetchN error"); 261 intptr_t result_valid = SafeFetchN(p_valid, v2); 262 assert(result_valid == v1, "SafeFetchN error"); 263 } 264 } 265 #endif 266 267 void StubRoutines::initialize2() { 268 if (_code2 == NULL) { 269 ResourceMark rm; 270 TraceTime timer("StubRoutines generation 2", TraceStartupTime); 271 _code2 = BufferBlob::create("StubRoutines (2)", code_size2); 272 if (_code2 == NULL) { 273 vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)"); 274 } 275 CodeBuffer buffer(_code2); 276 StubGenerator_generate(&buffer, true); 277 // When new stubs added we need to make sure there is some space left 278 // to catch situation when we should increase size again. 279 assert(code_size2 == 0 || buffer.insts_remaining() > 200, "increase code_size2"); 280 } 281 282 #ifdef ASSERT 283 284 #define TEST_ARRAYCOPY(type) \ 285 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \ 286 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \ 287 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \ 288 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord)) 289 290 // Make sure all the arraycopy stubs properly handle zero count 291 TEST_ARRAYCOPY(jbyte); 292 TEST_ARRAYCOPY(jshort); 293 TEST_ARRAYCOPY(jint); 294 TEST_ARRAYCOPY(jlong); 295 296 #undef TEST_ARRAYCOPY 297 298 #define TEST_FILL(type) \ 299 if (_##type##_fill != NULL) { \ 300 union { \ 301 double d; \ 302 type body[96]; \ 303 } s; \ 304 \ 305 int v = 32; \ 306 for (int offset = -2; offset <= 2; offset++) { \ 307 for (int i = 0; i < 96; i++) { \ 308 s.body[i] = 1; \ 309 } \ 310 type* start = s.body + 8 + offset; \ 311 for (int aligned = 0; aligned < 2; aligned++) { \ 312 if (aligned) { \ 313 if (((intptr_t)start) % HeapWordSize == 0) { \ 314 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \ 315 } else { \ 316 continue; \ 317 } \ 318 } else { \ 319 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \ 320 } \ 321 for (int i = 0; i < 96; i++) { \ 322 if (i < (8 + offset) || i >= (88 + offset)) { \ 323 assert(s.body[i] == 1, "what?"); \ 324 } else { \ 325 assert(s.body[i] == 32, "what?"); \ 326 } \ 327 } \ 328 } \ 329 } \ 330 } \ 331 332 TEST_FILL(jbyte); 333 TEST_FILL(jshort); 334 TEST_FILL(jint); 335 336 #undef TEST_FILL 337 338 #define TEST_COPYRTN(type) \ 339 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \ 340 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type))) 341 342 // Make sure all the copy runtime routines properly handle zero count 343 TEST_COPYRTN(jbyte); 344 TEST_COPYRTN(jshort); 345 TEST_COPYRTN(jint); 346 TEST_COPYRTN(jlong); 347 348 #undef TEST_COPYRTN 349 350 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord)); 351 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord)); 352 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord)); 353 // Aligned to BytesPerLong 354 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong)); 355 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong)); 356 357 // test safefetch routines 358 // Not on Windows 32bit until 8074860 is fixed 359 #if ! (defined(_WIN32) && defined(_M_IX86)) 360 test_safefetch32(); 361 test_safefetchN(); 362 #endif 363 364 #endif 365 } 366 367 368 void stubRoutines_init1() { StubRoutines::initialize1(); } 369 void stubRoutines_init2() { StubRoutines::initialize2(); } 370 371 // 372 // Default versions of arraycopy functions 373 // 374 375 static void gen_arraycopy_barrier_pre(oop* dest, size_t count, bool dest_uninitialized) { 376 assert(count != 0, "count should be non-zero"); 377 assert(count <= (size_t)max_intx, "count too large"); 378 BarrierSet* bs = Universe::heap()->barrier_set(); 379 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt"); 380 bs->write_ref_array_pre(dest, (int)count, dest_uninitialized); 381 } 382 383 static void gen_arraycopy_barrier(oop* dest, size_t count) { 384 assert(count != 0, "count should be non-zero"); 385 BarrierSet* bs = Universe::heap()->barrier_set(); 386 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); 387 bs->write_ref_array((HeapWord*)dest, count); 388 } 389 390 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count)) 391 #ifndef PRODUCT 392 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy 393 #endif // !PRODUCT 394 Copy::conjoint_jbytes_atomic(src, dest, count); 395 JRT_END 396 397 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count)) 398 #ifndef PRODUCT 399 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy 400 #endif // !PRODUCT 401 Copy::conjoint_jshorts_atomic(src, dest, count); 402 JRT_END 403 404 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count)) 405 #ifndef PRODUCT 406 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy 407 #endif // !PRODUCT 408 Copy::conjoint_jints_atomic(src, dest, count); 409 JRT_END 410 411 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count)) 412 #ifndef PRODUCT 413 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy 414 #endif // !PRODUCT 415 Copy::conjoint_jlongs_atomic(src, dest, count); 416 JRT_END 417 418 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count)) 419 #ifndef PRODUCT 420 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 421 #endif // !PRODUCT 422 assert(count != 0, "count should be non-zero"); 423 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false); 424 Copy::conjoint_oops_atomic(src, dest, count); 425 gen_arraycopy_barrier(dest, count); 426 JRT_END 427 428 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count)) 429 #ifndef PRODUCT 430 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 431 #endif // !PRODUCT 432 assert(count != 0, "count should be non-zero"); 433 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true); 434 Copy::conjoint_oops_atomic(src, dest, count); 435 gen_arraycopy_barrier(dest, count); 436 JRT_END 437 438 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count)) 439 #ifndef PRODUCT 440 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy 441 #endif // !PRODUCT 442 Copy::arrayof_conjoint_jbytes(src, dest, count); 443 JRT_END 444 445 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count)) 446 #ifndef PRODUCT 447 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy 448 #endif // !PRODUCT 449 Copy::arrayof_conjoint_jshorts(src, dest, count); 450 JRT_END 451 452 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count)) 453 #ifndef PRODUCT 454 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy 455 #endif // !PRODUCT 456 Copy::arrayof_conjoint_jints(src, dest, count); 457 JRT_END 458 459 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count)) 460 #ifndef PRODUCT 461 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy 462 #endif // !PRODUCT 463 Copy::arrayof_conjoint_jlongs(src, dest, count); 464 JRT_END 465 466 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count)) 467 #ifndef PRODUCT 468 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 469 #endif // !PRODUCT 470 assert(count != 0, "count should be non-zero"); 471 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/false); 472 Copy::arrayof_conjoint_oops(src, dest, count); 473 gen_arraycopy_barrier((oop *) dest, count); 474 JRT_END 475 476 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count)) 477 #ifndef PRODUCT 478 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 479 #endif // !PRODUCT 480 assert(count != 0, "count should be non-zero"); 481 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/true); 482 Copy::arrayof_conjoint_oops(src, dest, count); 483 gen_arraycopy_barrier((oop *) 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_OBJECT: 508 case T_NARROWOOP: 509 case T_NARROWKLASS: 510 case T_ADDRESS: 511 // Currently unsupported 512 return NULL; 513 514 default: 515 ShouldNotReachHere(); 516 return NULL; 517 } 518 519 #undef RETURN_STUB 520 } 521 522 // constants for computing the copy function 523 enum { 524 COPYFUNC_UNALIGNED = 0, 525 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize 526 COPYFUNC_CONJOINT = 0, 527 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend 528 }; 529 530 // Note: The condition "disjoint" applies also for overlapping copies 531 // where an descending copy is permitted (i.e., dest_offset <= src_offset). 532 address 533 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) { 534 int selector = 535 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) + 536 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT); 537 538 #define RETURN_STUB(xxx_arraycopy) { \ 539 name = #xxx_arraycopy; \ 540 return StubRoutines::xxx_arraycopy(); } 541 542 #define RETURN_STUB_PARM(xxx_arraycopy, parm) { \ 543 name = #xxx_arraycopy; \ 544 return StubRoutines::xxx_arraycopy(parm); } 545 546 switch (t) { 547 case T_BYTE: 548 case T_BOOLEAN: 549 switch (selector) { 550 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy); 551 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy); 552 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy); 553 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy); 554 } 555 case T_CHAR: 556 case T_SHORT: 557 switch (selector) { 558 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy); 559 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy); 560 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy); 561 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy); 562 } 563 case T_INT: 564 case T_FLOAT: 565 switch (selector) { 566 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy); 567 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy); 568 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy); 569 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy); 570 } 571 case T_DOUBLE: 572 case T_LONG: 573 switch (selector) { 574 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy); 575 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy); 576 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy); 577 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy); 578 } 579 case T_ARRAY: 580 case T_OBJECT: 581 switch (selector) { 582 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized); 583 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized); 584 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized); 585 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized); 586 } 587 default: 588 ShouldNotReachHere(); 589 return NULL; 590 } 591 592 #undef RETURN_STUB 593 #undef RETURN_STUB_PARM 594 }