src/share/vm/runtime/stubRoutines.cpp

Fri, 24 Jun 2016 17:12:13 +0800

author
aoqi<aoqi@loongson.cn>
date
Fri, 24 Jun 2016 17:12:13 +0800
changeset 25
873fd82b133d
parent 0
f90c822e73f8
child 6876
710a3c8b516e
permissions
-rw-r--r--

[Code Reorganization] Removed GC related modifications made by Loongson, for example, UseOldNUMA.

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

mercurial