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