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