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