stubRoutines.cpp revision 13249:a2753984d2c1
1139749Simp/* 2121468Ssimokawa * Copyright (c) 1997, 2017, Oracle and/or its affiliates. All rights reserved. 3121468Ssimokawa * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4121468Ssimokawa * 5121468Ssimokawa * This code is free software; you can redistribute it and/or modify it 6121468Ssimokawa * under the terms of the GNU General Public License version 2 only, as 7121468Ssimokawa * published by the Free Software Foundation. 8121468Ssimokawa * 9121468Ssimokawa * This code is distributed in the hope that it will be useful, but WITHOUT 10121468Ssimokawa * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11121468Ssimokawa * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12121468Ssimokawa * version 2 for more details (a copy is included in the LICENSE file that 13121468Ssimokawa * accompanied this code). 14121468Ssimokawa * 15121468Ssimokawa * You should have received a copy of the GNU General Public License version 16121468Ssimokawa * 2 along with this work; if not, write to the Free Software Foundation, 17121468Ssimokawa * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18121468Ssimokawa * 19121468Ssimokawa * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20121468Ssimokawa * or visit www.oracle.com if you need additional information or have any 21121468Ssimokawa * questions. 22121468Ssimokawa * 23121468Ssimokawa */ 24121468Ssimokawa 25121468Ssimokawa#include "precompiled.hpp" 26121468Ssimokawa#include "asm/codeBuffer.hpp" 27121468Ssimokawa#include "memory/resourceArea.hpp" 28121468Ssimokawa#include "oops/oop.inline.hpp" 29121468Ssimokawa#include "runtime/interfaceSupport.hpp" 30121468Ssimokawa#include "runtime/timerTrace.hpp" 31121468Ssimokawa#include "runtime/sharedRuntime.hpp" 32121468Ssimokawa#include "runtime/stubRoutines.hpp" 33121468Ssimokawa#include "utilities/align.hpp" 34121468Ssimokawa#include "utilities/copy.hpp" 35121468Ssimokawa#include "utilities/vmError.hpp" 36121468Ssimokawa#ifdef COMPILER2 37121468Ssimokawa#include "opto/runtime.hpp" 38121468Ssimokawa#endif 39121468Ssimokawa 40129879Sphk 41121468Ssimokawa// Implementation of StubRoutines - for a description 42121468Ssimokawa// of how to extend it, see the header file. 43121468Ssimokawa 44121468Ssimokawa// Class Variables 45121468Ssimokawa 46121468SsimokawaBufferBlob* StubRoutines::_code1 = NULL; 47121468SsimokawaBufferBlob* StubRoutines::_code2 = NULL; 48121468Ssimokawa 49136467Ssimokawaaddress StubRoutines::_call_stub_return_address = NULL; 50136467Ssimokawaaddress StubRoutines::_call_stub_entry = NULL; 51136467Ssimokawa 52136467Ssimokawaaddress StubRoutines::_catch_exception_entry = NULL; 53136467Ssimokawaaddress StubRoutines::_forward_exception_entry = NULL; 54136467Ssimokawaaddress StubRoutines::_throw_AbstractMethodError_entry = NULL; 55136467Ssimokawaaddress StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL; 56121468Ssimokawaaddress StubRoutines::_throw_NullPointerException_at_call_entry = NULL; 57121468Ssimokawaaddress StubRoutines::_throw_StackOverflowError_entry = NULL; 58121468Ssimokawaaddress StubRoutines::_throw_delayed_StackOverflowError_entry = NULL; 59121468Ssimokawajint StubRoutines::_verify_oop_count = 0; 60136467Ssimokawaaddress StubRoutines::_verify_oop_subroutine_entry = NULL; 61136467Ssimokawaaddress StubRoutines::_atomic_xchg_entry = NULL; 62121468Ssimokawaaddress StubRoutines::_atomic_xchg_ptr_entry = NULL; 63125862Ssimokawaaddress StubRoutines::_atomic_store_entry = NULL; 64125862Ssimokawaaddress StubRoutines::_atomic_store_ptr_entry = NULL; 65170420Ssimokawaaddress StubRoutines::_atomic_cmpxchg_entry = NULL; 66170420Ssimokawaaddress StubRoutines::_atomic_cmpxchg_ptr_entry = NULL; 67170420Ssimokawaaddress StubRoutines::_atomic_cmpxchg_byte_entry = NULL; 68170420Ssimokawaaddress StubRoutines::_atomic_cmpxchg_long_entry = NULL; 69170420Ssimokawaaddress StubRoutines::_atomic_add_entry = NULL; 70170420Ssimokawaaddress StubRoutines::_atomic_add_ptr_entry = NULL; 71170420Ssimokawaaddress StubRoutines::_fence_entry = NULL; 72170420Ssimokawaaddress StubRoutines::_d2i_wrapper = NULL; 73121468Ssimokawaaddress StubRoutines::_d2l_wrapper = NULL; 74121468Ssimokawa 75125862Ssimokawajint StubRoutines::_fpu_cntrl_wrd_std = 0; 76170018Ssimokawajint StubRoutines::_fpu_cntrl_wrd_24 = 0; 77125862Ssimokawajint StubRoutines::_fpu_cntrl_wrd_64 = 0; 78125862Ssimokawajint StubRoutines::_fpu_cntrl_wrd_trunc = 0; 79125862Ssimokawajint StubRoutines::_mxcsr_std = 0; 80121468Ssimokawajint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 }; 81121468Ssimokawajint StubRoutines::_fpu_subnormal_bias2[3] = { 0, 0, 0 }; 82121468Ssimokawa 83121468Ssimokawa// Compiled code entry points default values 84121468Ssimokawa// The default functions don't have separate disjoint versions. 85121468Ssimokawaaddress StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); 86121468Ssimokawaaddress StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); 87121468Ssimokawaaddress StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); 88121468Ssimokawaaddress StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); 89121468Ssimokawaaddress StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); 90121468Ssimokawaaddress StubRoutines::_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit); 91121468Ssimokawaaddress StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); 92121468Ssimokawaaddress StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); 93121468Ssimokawaaddress StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); 94121468Ssimokawaaddress StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); 95170408Ssimokawaaddress StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); 96121468Ssimokawaaddress StubRoutines::_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit); 97121468Ssimokawa 98121468Ssimokawaaddress StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); 99121468Ssimokawaaddress StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); 100121468Ssimokawaaddress StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); 101121468Ssimokawaaddress StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); 102121468Ssimokawaaddress StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); 103121468Ssimokawaaddress StubRoutines::_arrayof_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit); 104121468Ssimokawaaddress StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); 105121468Ssimokawaaddress StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); 106121468Ssimokawaaddress StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); 107121468Ssimokawaaddress StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); 108121468Ssimokawaaddress StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); 109121468Ssimokawaaddress StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit); 110121468Ssimokawa 111121468Ssimokawaaddress StubRoutines::_zero_aligned_words = CAST_FROM_FN_PTR(address, Copy::zero_to_words); 112121468Ssimokawa 113121468Ssimokawaaddress StubRoutines::_checkcast_arraycopy = NULL; 114121468Ssimokawaaddress StubRoutines::_checkcast_arraycopy_uninit = NULL; 115121468Ssimokawaaddress StubRoutines::_unsafe_arraycopy = NULL; 116121468Ssimokawaaddress StubRoutines::_generic_arraycopy = NULL; 117121468Ssimokawa 118121468Ssimokawa 119170420Ssimokawaaddress StubRoutines::_jbyte_fill; 120121468Ssimokawaaddress StubRoutines::_jshort_fill; 121170420Ssimokawaaddress StubRoutines::_jint_fill; 122170420Ssimokawaaddress StubRoutines::_arrayof_jbyte_fill; 123170420Ssimokawaaddress StubRoutines::_arrayof_jshort_fill; 124170420Ssimokawaaddress StubRoutines::_arrayof_jint_fill; 125170420Ssimokawa 126170420Ssimokawaaddress StubRoutines::_aescrypt_encryptBlock = NULL; 127170420Ssimokawaaddress StubRoutines::_aescrypt_decryptBlock = NULL; 128170420Ssimokawaaddress StubRoutines::_cipherBlockChaining_encryptAESCrypt = NULL; 129170420Ssimokawaaddress StubRoutines::_cipherBlockChaining_decryptAESCrypt = NULL; 130170420Ssimokawaaddress StubRoutines::_counterMode_AESCrypt = NULL; 131170420Ssimokawaaddress StubRoutines::_ghash_processBlocks = NULL; 132170420Ssimokawa 133121468Ssimokawaaddress StubRoutines::_sha1_implCompress = NULL; 134121468Ssimokawaaddress StubRoutines::_sha1_implCompressMB = NULL; 135121468Ssimokawaaddress StubRoutines::_sha256_implCompress = NULL; 136121468Ssimokawaaddress StubRoutines::_sha256_implCompressMB = NULL; 137121468Ssimokawaaddress StubRoutines::_sha512_implCompress = NULL; 138121468Ssimokawaaddress StubRoutines::_sha512_implCompressMB = NULL; 139121468Ssimokawa 140121468Ssimokawaaddress StubRoutines::_updateBytesCRC32 = NULL; 141121468Ssimokawaaddress StubRoutines::_crc_table_adr = NULL; 142121468Ssimokawa 143121468Ssimokawaaddress StubRoutines::_crc32c_table_addr = NULL; 144121468Ssimokawaaddress StubRoutines::_updateBytesCRC32C = NULL; 145121468Ssimokawaaddress StubRoutines::_updateBytesAdler32 = NULL; 146121468Ssimokawa 147121468Ssimokawaaddress StubRoutines::_multiplyToLen = NULL; 148121468Ssimokawaaddress StubRoutines::_squareToLen = NULL; 149121468Ssimokawaaddress StubRoutines::_mulAdd = NULL; 150121468Ssimokawaaddress StubRoutines::_montgomeryMultiply = NULL; 151121468Ssimokawaaddress StubRoutines::_montgomerySquare = NULL; 152170420Ssimokawa 153170420Ssimokawaaddress StubRoutines::_vectorizedMismatch = NULL; 154170420Ssimokawa 155121468Ssimokawaaddress StubRoutines::_dexp = NULL; 156121468Ssimokawaaddress StubRoutines::_dlog = NULL; 157121468Ssimokawaaddress StubRoutines::_dlog10 = NULL; 158121468Ssimokawaaddress StubRoutines::_dpow = NULL; 159121468Ssimokawaaddress StubRoutines::_dsin = NULL; 160121468Ssimokawaaddress StubRoutines::_dcos = NULL; 161122310Ssimokawaaddress StubRoutines::_dlibm_sin_cos_huge = NULL; 162121468Ssimokawaaddress StubRoutines::_dlibm_reduce_pi04l = NULL; 163121468Ssimokawaaddress StubRoutines::_dlibm_tan_cot_huge = NULL; 164121468Ssimokawaaddress StubRoutines::_dtan = NULL; 165121468Ssimokawa 166122310Ssimokawadouble (* StubRoutines::_intrinsic_log10 )(double) = NULL; 167122310Ssimokawadouble (* StubRoutines::_intrinsic_sin )(double) = NULL; 168122310Ssimokawadouble (* StubRoutines::_intrinsic_cos )(double) = NULL; 169122310Ssimokawadouble (* StubRoutines::_intrinsic_tan )(double) = NULL; 170122310Ssimokawa 171122310Ssimokawaaddress StubRoutines::_safefetch32_entry = NULL; 172122310Ssimokawaaddress StubRoutines::_safefetch32_fault_pc = NULL; 173122310Ssimokawaaddress StubRoutines::_safefetch32_continuation_pc = NULL; 174122310Ssimokawaaddress StubRoutines::_safefetchN_entry = NULL; 175122310Ssimokawaaddress StubRoutines::_safefetchN_fault_pc = NULL; 176122310Ssimokawaaddress StubRoutines::_safefetchN_continuation_pc = NULL; 177122310Ssimokawa 178122310Ssimokawa// Initialization 179122310Ssimokawa// 180122310Ssimokawa// Note: to break cycle with universe initialization, stubs are generated in two phases. 181125862Ssimokawa// The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry). 182125862Ssimokawa// The second phase includes all other stubs (which may depend on universe being initialized.) 183122310Ssimokawa 184125862Ssimokawaextern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators 185125862Ssimokawa 186125862Ssimokawavoid StubRoutines::initialize1() { 187125862Ssimokawa if (_code1 == NULL) { 188125862Ssimokawa ResourceMark rm; 189125862Ssimokawa TraceTime timer("StubRoutines generation 1", TRACETIME_LOG(Info, startuptime)); 190121468Ssimokawa _code1 = BufferBlob::create("StubRoutines (1)", code_size1); 191121468Ssimokawa if (_code1 == NULL) { 192170408Ssimokawa vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)"); 193170408Ssimokawa } 194170408Ssimokawa CodeBuffer buffer(_code1); 195170408Ssimokawa StubGenerator_generate(&buffer, false); 196170408Ssimokawa // When new stubs added we need to make sure there is some space left 197170408Ssimokawa // to catch situation when we should increase size again. 198170408Ssimokawa assert(code_size1 == 0 || buffer.insts_remaining() > 200, "increase code_size1"); 199170408Ssimokawa } 200121468Ssimokawa} 201121468Ssimokawa 202121468Ssimokawa 203121468Ssimokawa#ifdef ASSERT 204121468Ssimokawatypedef void (*arraycopy_fn)(address src, address dst, int count); 205121468Ssimokawa 206121468Ssimokawa// simple tests of generated arraycopy functions 207121468Ssimokawastatic void test_arraycopy_func(address func, int alignment) { 208186876Smarius int v = 0xcc; 209121468Ssimokawa int v2 = 0x11; 210186876Smarius jlong lbuffer[8]; 211186876Smarius jlong lbuffer2[8]; 212121468Ssimokawa address fbuffer = (address) lbuffer; 213121468Ssimokawa address fbuffer2 = (address) lbuffer2; 214121468Ssimokawa unsigned int i; 215121468Ssimokawa for (i = 0; i < sizeof(lbuffer); i++) { 216121468Ssimokawa fbuffer[i] = v; fbuffer2[i] = v2; 217121468Ssimokawa } 218121468Ssimokawa // C++ does not guarantee jlong[] array alignment to 8 bytes. 219186876Smarius // Use middle of array to check that memory before it is not modified. 220121468Ssimokawa address buffer = align_up((address)&lbuffer[4], BytesPerLong); 221121468Ssimokawa address buffer2 = align_up((address)&lbuffer2[4], BytesPerLong); 222121468Ssimokawa // do an aligned copy 223121468Ssimokawa ((arraycopy_fn)func)(buffer, buffer2, 0); 224121468Ssimokawa for (i = 0; i < sizeof(lbuffer); i++) { 225121468Ssimokawa assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 226125862Ssimokawa } 227121468Ssimokawa // adjust destination alignment 228121468Ssimokawa ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0); 229121468Ssimokawa for (i = 0; i < sizeof(lbuffer); i++) { 230121468Ssimokawa assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 231121468Ssimokawa } 232121468Ssimokawa // adjust source alignment 233121468Ssimokawa ((arraycopy_fn)func)(buffer + alignment, buffer2, 0); 234121468Ssimokawa for (i = 0; i < sizeof(lbuffer); i++) { 235186876Smarius assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); 236186876Smarius } 237186876Smarius} 238186876Smarius 239186876Smarius// simple test for SafeFetch32 240186876Smariusstatic void test_safefetch32() { 241125862Ssimokawa if (CanUseSafeFetch32()) { 242122310Ssimokawa int dummy = 17; 243186876Smarius int* const p_invalid = (int*) VMError::get_segfault_address(); 244186876Smarius int* const p_valid = &dummy; 245170408Ssimokawa int result_invalid = SafeFetch32(p_invalid, 0xABC); 246170408Ssimokawa assert(result_invalid == 0xABC, "SafeFetch32 error"); 247121468Ssimokawa int result_valid = SafeFetch32(p_valid, 0xABC); 248121468Ssimokawa assert(result_valid == 17, "SafeFetch32 error"); 249121468Ssimokawa } 250121468Ssimokawa} 251121468Ssimokawa 252121468Ssimokawa// simple test for SafeFetchN 253121468Ssimokawastatic void test_safefetchN() { 254121468Ssimokawa if (CanUseSafeFetchN()) { 255121468Ssimokawa#ifdef _LP64 256121468Ssimokawa const intptr_t v1 = UCONST64(0xABCD00000000ABCD); 257121468Ssimokawa const intptr_t v2 = UCONST64(0xDEFD00000000DEFD); 258121468Ssimokawa#else 259170408Ssimokawa const intptr_t v1 = 0xABCDABCD; 260170408Ssimokawa const intptr_t v2 = 0xDEFDDEFD; 261170408Ssimokawa#endif 262121468Ssimokawa intptr_t dummy = v1; 263125862Ssimokawa intptr_t* const p_invalid = (intptr_t*) VMError::get_segfault_address(); 264125862Ssimokawa intptr_t* const p_valid = &dummy; 265121468Ssimokawa intptr_t result_invalid = SafeFetchN(p_invalid, v2); 266121468Ssimokawa assert(result_invalid == v2, "SafeFetchN error"); 267121468Ssimokawa intptr_t result_valid = SafeFetchN(p_valid, v2); 268121468Ssimokawa assert(result_valid == v1, "SafeFetchN error"); 269121468Ssimokawa } 270121468Ssimokawa} 271121468Ssimokawa#endif 272121468Ssimokawa 273121468Ssimokawavoid StubRoutines::initialize2() { 274121468Ssimokawa if (_code2 == NULL) { 275121468Ssimokawa ResourceMark rm; 276121468Ssimokawa TraceTime timer("StubRoutines generation 2", TRACETIME_LOG(Info, startuptime)); 277121468Ssimokawa _code2 = BufferBlob::create("StubRoutines (2)", code_size2); 278121468Ssimokawa if (_code2 == NULL) { 279121468Ssimokawa vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)"); 280121468Ssimokawa } 281121468Ssimokawa CodeBuffer buffer(_code2); 282121468Ssimokawa StubGenerator_generate(&buffer, true); 283121468Ssimokawa // When new stubs added we need to make sure there is some space left 284121468Ssimokawa // to catch situation when we should increase size again. 285121468Ssimokawa assert(code_size2 == 0 || buffer.insts_remaining() > 200, "increase code_size2"); 286121468Ssimokawa } 287121468Ssimokawa 288121468Ssimokawa#ifdef ASSERT 289121468Ssimokawa 290121468Ssimokawa#define TEST_ARRAYCOPY(type) \ 291121468Ssimokawa test_arraycopy_func( type##_arraycopy(), sizeof(type)); \ 292121468Ssimokawa test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \ 293121468Ssimokawa test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \ 294121468Ssimokawa test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord)) 295121468Ssimokawa 296 // Make sure all the arraycopy stubs properly handle zero count 297 TEST_ARRAYCOPY(jbyte); 298 TEST_ARRAYCOPY(jshort); 299 TEST_ARRAYCOPY(jint); 300 TEST_ARRAYCOPY(jlong); 301 302#undef TEST_ARRAYCOPY 303 304#define TEST_FILL(type) \ 305 if (_##type##_fill != NULL) { \ 306 union { \ 307 double d; \ 308 type body[96]; \ 309 } s; \ 310 \ 311 int v = 32; \ 312 for (int offset = -2; offset <= 2; offset++) { \ 313 for (int i = 0; i < 96; i++) { \ 314 s.body[i] = 1; \ 315 } \ 316 type* start = s.body + 8 + offset; \ 317 for (int aligned = 0; aligned < 2; aligned++) { \ 318 if (aligned) { \ 319 if (((intptr_t)start) % HeapWordSize == 0) { \ 320 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \ 321 } else { \ 322 continue; \ 323 } \ 324 } else { \ 325 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \ 326 } \ 327 for (int i = 0; i < 96; i++) { \ 328 if (i < (8 + offset) || i >= (88 + offset)) { \ 329 assert(s.body[i] == 1, "what?"); \ 330 } else { \ 331 assert(s.body[i] == 32, "what?"); \ 332 } \ 333 } \ 334 } \ 335 } \ 336 } \ 337 338 TEST_FILL(jbyte); 339 TEST_FILL(jshort); 340 TEST_FILL(jint); 341 342#undef TEST_FILL 343 344#define TEST_COPYRTN(type) \ 345 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \ 346 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type))) 347 348 // Make sure all the copy runtime routines properly handle zero count 349 TEST_COPYRTN(jbyte); 350 TEST_COPYRTN(jshort); 351 TEST_COPYRTN(jint); 352 TEST_COPYRTN(jlong); 353 354#undef TEST_COPYRTN 355 356 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord)); 357 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord)); 358 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord)); 359 // Aligned to BytesPerLong 360 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong)); 361 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong)); 362 363 // test safefetch routines 364 // Not on Windows 32bit until 8074860 is fixed 365#if ! (defined(_WIN32) && defined(_M_IX86)) 366 test_safefetch32(); 367 test_safefetchN(); 368#endif 369 370#endif 371} 372 373 374void stubRoutines_init1() { StubRoutines::initialize1(); } 375void stubRoutines_init2() { StubRoutines::initialize2(); } 376 377// 378// Default versions of arraycopy functions 379// 380 381static void gen_arraycopy_barrier_pre(oop* dest, size_t count, bool dest_uninitialized) { 382 assert(count != 0, "count should be non-zero"); 383 assert(count <= (size_t)max_intx, "count too large"); 384 BarrierSet* bs = Universe::heap()->barrier_set(); 385 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt"); 386 bs->write_ref_array_pre(dest, (int)count, dest_uninitialized); 387} 388 389static void gen_arraycopy_barrier(oop* dest, size_t count) { 390 assert(count != 0, "count should be non-zero"); 391 BarrierSet* bs = Universe::heap()->barrier_set(); 392 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); 393 bs->write_ref_array((HeapWord*)dest, count); 394} 395 396JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count)) 397#ifndef PRODUCT 398 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy 399#endif // !PRODUCT 400 Copy::conjoint_jbytes_atomic(src, dest, count); 401JRT_END 402 403JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count)) 404#ifndef PRODUCT 405 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy 406#endif // !PRODUCT 407 Copy::conjoint_jshorts_atomic(src, dest, count); 408JRT_END 409 410JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count)) 411#ifndef PRODUCT 412 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy 413#endif // !PRODUCT 414 Copy::conjoint_jints_atomic(src, dest, count); 415JRT_END 416 417JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count)) 418#ifndef PRODUCT 419 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy 420#endif // !PRODUCT 421 Copy::conjoint_jlongs_atomic(src, dest, count); 422JRT_END 423 424JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count)) 425#ifndef PRODUCT 426 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 427#endif // !PRODUCT 428 assert(count != 0, "count should be non-zero"); 429 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false); 430 Copy::conjoint_oops_atomic(src, dest, count); 431 gen_arraycopy_barrier(dest, count); 432JRT_END 433 434JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count)) 435#ifndef PRODUCT 436 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 437#endif // !PRODUCT 438 assert(count != 0, "count should be non-zero"); 439 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true); 440 Copy::conjoint_oops_atomic(src, dest, count); 441 gen_arraycopy_barrier(dest, count); 442JRT_END 443 444JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count)) 445#ifndef PRODUCT 446 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy 447#endif // !PRODUCT 448 Copy::arrayof_conjoint_jbytes(src, dest, count); 449JRT_END 450 451JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count)) 452#ifndef PRODUCT 453 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy 454#endif // !PRODUCT 455 Copy::arrayof_conjoint_jshorts(src, dest, count); 456JRT_END 457 458JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count)) 459#ifndef PRODUCT 460 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy 461#endif // !PRODUCT 462 Copy::arrayof_conjoint_jints(src, dest, count); 463JRT_END 464 465JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count)) 466#ifndef PRODUCT 467 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy 468#endif // !PRODUCT 469 Copy::arrayof_conjoint_jlongs(src, dest, count); 470JRT_END 471 472JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count)) 473#ifndef PRODUCT 474 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 475#endif // !PRODUCT 476 assert(count != 0, "count should be non-zero"); 477 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/false); 478 Copy::arrayof_conjoint_oops(src, dest, count); 479 gen_arraycopy_barrier((oop *) dest, count); 480JRT_END 481 482JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count)) 483#ifndef PRODUCT 484 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy 485#endif // !PRODUCT 486 assert(count != 0, "count should be non-zero"); 487 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/true); 488 Copy::arrayof_conjoint_oops(src, dest, count); 489 gen_arraycopy_barrier((oop *) dest, count); 490JRT_END 491 492address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) { 493#define RETURN_STUB(xxx_fill) { \ 494 name = #xxx_fill; \ 495 return StubRoutines::xxx_fill(); } 496 497 switch (t) { 498 case T_BYTE: 499 case T_BOOLEAN: 500 if (!aligned) RETURN_STUB(jbyte_fill); 501 RETURN_STUB(arrayof_jbyte_fill); 502 case T_CHAR: 503 case T_SHORT: 504 if (!aligned) RETURN_STUB(jshort_fill); 505 RETURN_STUB(arrayof_jshort_fill); 506 case T_INT: 507 case T_FLOAT: 508 if (!aligned) RETURN_STUB(jint_fill); 509 RETURN_STUB(arrayof_jint_fill); 510 case T_DOUBLE: 511 case T_LONG: 512 case T_ARRAY: 513 case T_OBJECT: 514 case T_NARROWOOP: 515 case T_NARROWKLASS: 516 case T_ADDRESS: 517 // Currently unsupported 518 return NULL; 519 520 default: 521 ShouldNotReachHere(); 522 return NULL; 523 } 524 525#undef RETURN_STUB 526} 527 528// constants for computing the copy function 529enum { 530 COPYFUNC_UNALIGNED = 0, 531 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize 532 COPYFUNC_CONJOINT = 0, 533 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend 534}; 535 536// Note: The condition "disjoint" applies also for overlapping copies 537// where an descending copy is permitted (i.e., dest_offset <= src_offset). 538address 539StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) { 540 int selector = 541 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) + 542 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT); 543 544#define RETURN_STUB(xxx_arraycopy) { \ 545 name = #xxx_arraycopy; \ 546 return StubRoutines::xxx_arraycopy(); } 547 548#define RETURN_STUB_PARM(xxx_arraycopy, parm) { \ 549 name = #xxx_arraycopy; \ 550 return StubRoutines::xxx_arraycopy(parm); } 551 552 switch (t) { 553 case T_BYTE: 554 case T_BOOLEAN: 555 switch (selector) { 556 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy); 557 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy); 558 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy); 559 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy); 560 } 561 case T_CHAR: 562 case T_SHORT: 563 switch (selector) { 564 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy); 565 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy); 566 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy); 567 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy); 568 } 569 case T_INT: 570 case T_FLOAT: 571 switch (selector) { 572 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy); 573 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy); 574 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy); 575 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy); 576 } 577 case T_DOUBLE: 578 case T_LONG: 579 switch (selector) { 580 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy); 581 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy); 582 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy); 583 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy); 584 } 585 case T_ARRAY: 586 case T_OBJECT: 587 switch (selector) { 588 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized); 589 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized); 590 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized); 591 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized); 592 } 593 default: 594 ShouldNotReachHere(); 595 return NULL; 596 } 597 598#undef RETURN_STUB 599#undef RETURN_STUB_PARM 600} 601