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