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