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