Mercurial > hg > truffle
annotate src/share/vm/runtime/stubRoutines.cpp @ 3714:b648304ba4ff
Change Graal monitor enter and exit from BasicObjectLock to BasicLock
author | Christian Wimmer <christian.wimmer@oracle.com> |
---|---|
date | Tue, 13 Dec 2011 21:17:46 -0800 |
parents | 38fa55e5e792 |
children | baf763f388e6 |
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; | |
3451
38fa55e5e792
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 | |
0 | 111 |
112 address StubRoutines::_checkcast_arraycopy = NULL; | |
2324 | 113 address StubRoutines::_checkcast_arraycopy_uninit = NULL; |
0 | 114 address StubRoutines::_unsafe_arraycopy = NULL; |
115 address StubRoutines::_generic_arraycopy = NULL; | |
116 | |
1763 | 117 |
118 address StubRoutines::_jbyte_fill; | |
119 address StubRoutines::_jshort_fill; | |
120 address StubRoutines::_jint_fill; | |
121 address StubRoutines::_arrayof_jbyte_fill; | |
122 address StubRoutines::_arrayof_jshort_fill; | |
123 address StubRoutines::_arrayof_jint_fill; | |
124 | |
125 | |
1174
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
126 double (* StubRoutines::_intrinsic_log )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
127 double (* StubRoutines::_intrinsic_log10 )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
128 double (* StubRoutines::_intrinsic_exp )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
129 double (* StubRoutines::_intrinsic_pow )(double, double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
130 double (* StubRoutines::_intrinsic_sin )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
131 double (* StubRoutines::_intrinsic_cos )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
132 double (* StubRoutines::_intrinsic_tan )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
133 |
0 | 134 // Initialization |
135 // | |
136 // Note: to break cycle with universe initialization, stubs are generated in two phases. | |
137 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry). | |
138 // The second phase includes all other stubs (which may depend on universe being initialized.) | |
139 | |
140 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators | |
141 | |
142 void StubRoutines::initialize1() { | |
143 if (_code1 == NULL) { | |
144 ResourceMark rm; | |
145 TraceTime timer("StubRoutines generation 1", TraceStartupTime); | |
146 _code1 = BufferBlob::create("StubRoutines (1)", code_size1); | |
1490
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
147 if (_code1 == NULL) { |
1748 | 148 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
|
149 } |
1748 | 150 CodeBuffer buffer(_code1); |
0 | 151 StubGenerator_generate(&buffer, false); |
152 } | |
153 } | |
154 | |
155 | |
156 #ifdef ASSERT | |
157 typedef void (*arraycopy_fn)(address src, address dst, int count); | |
158 | |
159 // simple tests of generated arraycopy functions | |
160 static void test_arraycopy_func(address func, int alignment) { | |
161 int v = 0xcc; | |
162 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
|
163 jlong lbuffer[8]; |
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
164 jlong lbuffer2[8]; |
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
165 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
|
166 address fbuffer2 = (address) lbuffer2; |
0 | 167 unsigned int i; |
168 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
|
169 fbuffer[i] = v; fbuffer2[i] = v2; |
0 | 170 } |
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
171 // 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
|
172 // 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
|
173 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
|
174 address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong); |
0 | 175 // do an aligned copy |
176 ((arraycopy_fn)func)(buffer, buffer2, 0); | |
177 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
|
178 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); |
0 | 179 } |
180 // adjust destination alignment | |
181 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0); | |
182 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
|
183 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); |
0 | 184 } |
185 // adjust source alignment | |
186 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0); | |
187 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
|
188 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); |
0 | 189 } |
190 } | |
191 #endif | |
192 | |
193 | |
194 void StubRoutines::initialize2() { | |
195 if (_code2 == NULL) { | |
196 ResourceMark rm; | |
197 TraceTime timer("StubRoutines generation 2", TraceStartupTime); | |
198 _code2 = BufferBlob::create("StubRoutines (2)", code_size2); | |
1490
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
199 if (_code2 == NULL) { |
1748 | 200 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
|
201 } |
1748 | 202 CodeBuffer buffer(_code2); |
0 | 203 StubGenerator_generate(&buffer, true); |
204 } | |
205 | |
206 #ifdef ASSERT | |
207 | |
208 #define TEST_ARRAYCOPY(type) \ | |
209 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \ | |
210 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \ | |
211 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \ | |
212 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord)) | |
213 | |
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
214 // Make sure all the arraycopy stubs properly handle zero count |
0 | 215 TEST_ARRAYCOPY(jbyte); |
216 TEST_ARRAYCOPY(jshort); | |
217 TEST_ARRAYCOPY(jint); | |
218 TEST_ARRAYCOPY(jlong); | |
219 | |
220 #undef TEST_ARRAYCOPY | |
221 | |
1763 | 222 #define TEST_FILL(type) \ |
223 if (_##type##_fill != NULL) { \ | |
224 union { \ | |
225 double d; \ | |
226 type body[96]; \ | |
227 } s; \ | |
228 \ | |
229 int v = 32; \ | |
230 for (int offset = -2; offset <= 2; offset++) { \ | |
231 for (int i = 0; i < 96; i++) { \ | |
232 s.body[i] = 1; \ | |
233 } \ | |
234 type* start = s.body + 8 + offset; \ | |
235 for (int aligned = 0; aligned < 2; aligned++) { \ | |
236 if (aligned) { \ | |
237 if (((intptr_t)start) % HeapWordSize == 0) { \ | |
238 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \ | |
239 } else { \ | |
240 continue; \ | |
241 } \ | |
242 } else { \ | |
243 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \ | |
244 } \ | |
245 for (int i = 0; i < 96; i++) { \ | |
246 if (i < (8 + offset) || i >= (88 + offset)) { \ | |
247 assert(s.body[i] == 1, "what?"); \ | |
248 } else { \ | |
249 assert(s.body[i] == 32, "what?"); \ | |
250 } \ | |
251 } \ | |
252 } \ | |
253 } \ | |
254 } \ | |
255 | |
256 TEST_FILL(jbyte); | |
257 TEST_FILL(jshort); | |
258 TEST_FILL(jint); | |
259 | |
260 #undef TEST_FILL | |
261 | |
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
262 #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
|
263 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
|
264 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
|
265 |
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
266 // 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
|
267 TEST_COPYRTN(jbyte); |
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
268 TEST_COPYRTN(jshort); |
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
269 TEST_COPYRTN(jint); |
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
270 TEST_COPYRTN(jlong); |
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
271 |
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
272 #undef TEST_COPYRTN |
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
273 |
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
274 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
|
275 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
|
276 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
|
277 // Aligned to BytesPerLong |
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::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
|
279 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
|
280 |
0 | 281 #endif |
282 } | |
283 | |
284 | |
285 void stubRoutines_init1() { StubRoutines::initialize1(); } | |
286 void stubRoutines_init2() { StubRoutines::initialize2(); } | |
287 | |
288 // | |
289 // Default versions of arraycopy functions | |
290 // | |
291 | |
2324 | 292 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
|
293 assert(count != 0, "count should be non-zero"); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
294 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
|
295 BarrierSet* bs = Universe::heap()->barrier_set(); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
296 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt"); |
2324 | 297 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
|
298 } |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
299 |
0 | 300 static void gen_arraycopy_barrier(oop* dest, size_t count) { |
301 assert(count != 0, "count should be non-zero"); | |
302 BarrierSet* bs = Universe::heap()->barrier_set(); | |
303 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
|
304 bs->write_ref_array((HeapWord*)dest, count); |
0 | 305 } |
306 | |
307 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count)) | |
308 #ifndef PRODUCT | |
309 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy | |
310 #endif // !PRODUCT | |
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
311 Copy::conjoint_jbytes_atomic(src, dest, count); |
0 | 312 JRT_END |
313 | |
314 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count)) | |
315 #ifndef PRODUCT | |
316 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy | |
317 #endif // !PRODUCT | |
318 Copy::conjoint_jshorts_atomic(src, dest, count); | |
319 JRT_END | |
320 | |
321 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count)) | |
322 #ifndef PRODUCT | |
323 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy | |
324 #endif // !PRODUCT | |
325 Copy::conjoint_jints_atomic(src, dest, count); | |
326 JRT_END | |
327 | |
328 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count)) | |
329 #ifndef PRODUCT | |
330 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy | |
331 #endif // !PRODUCT | |
332 Copy::conjoint_jlongs_atomic(src, dest, count); | |
333 JRT_END | |
334 | |
335 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count)) | |
336 #ifndef PRODUCT | |
337 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy | |
338 #endif // !PRODUCT | |
339 assert(count != 0, "count should be non-zero"); | |
2324 | 340 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false); |
341 Copy::conjoint_oops_atomic(src, dest, count); | |
342 gen_arraycopy_barrier(dest, count); | |
343 JRT_END | |
344 | |
345 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count)) | |
346 #ifndef PRODUCT | |
347 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy | |
348 #endif // !PRODUCT | |
349 assert(count != 0, "count should be non-zero"); | |
350 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true); | |
0 | 351 Copy::conjoint_oops_atomic(src, dest, count); |
352 gen_arraycopy_barrier(dest, count); | |
353 JRT_END | |
354 | |
355 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
356 #ifndef PRODUCT | |
357 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy | |
358 #endif // !PRODUCT | |
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1552
diff
changeset
|
359 Copy::arrayof_conjoint_jbytes(src, dest, count); |
0 | 360 JRT_END |
361 | |
362 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
363 #ifndef PRODUCT | |
364 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy | |
365 #endif // !PRODUCT | |
366 Copy::arrayof_conjoint_jshorts(src, dest, count); | |
367 JRT_END | |
368 | |
369 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
370 #ifndef PRODUCT | |
371 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy | |
372 #endif // !PRODUCT | |
373 Copy::arrayof_conjoint_jints(src, dest, count); | |
374 JRT_END | |
375 | |
376 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
377 #ifndef PRODUCT | |
378 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy | |
379 #endif // !PRODUCT | |
380 Copy::arrayof_conjoint_jlongs(src, dest, count); | |
381 JRT_END | |
382 | |
383 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
384 #ifndef PRODUCT | |
385 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy | |
386 #endif // !PRODUCT | |
387 assert(count != 0, "count should be non-zero"); | |
2324 | 388 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/false); |
0 | 389 Copy::arrayof_conjoint_oops(src, dest, count); |
390 gen_arraycopy_barrier((oop *) dest, count); | |
391 JRT_END | |
1763 | 392 |
2324 | 393 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count)) |
394 #ifndef PRODUCT | |
395 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy | |
396 #endif // !PRODUCT | |
397 assert(count != 0, "count should be non-zero"); | |
398 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/true); | |
399 Copy::arrayof_conjoint_oops(src, dest, count); | |
400 gen_arraycopy_barrier((oop *) dest, count); | |
401 JRT_END | |
1763 | 402 |
403 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) { | |
404 #define RETURN_STUB(xxx_fill) { \ | |
405 name = #xxx_fill; \ | |
406 return StubRoutines::xxx_fill(); } | |
407 | |
408 switch (t) { | |
409 case T_BYTE: | |
410 case T_BOOLEAN: | |
411 if (!aligned) RETURN_STUB(jbyte_fill); | |
412 RETURN_STUB(arrayof_jbyte_fill); | |
413 case T_CHAR: | |
414 case T_SHORT: | |
415 if (!aligned) RETURN_STUB(jshort_fill); | |
416 RETURN_STUB(arrayof_jshort_fill); | |
417 case T_INT: | |
418 case T_FLOAT: | |
419 if (!aligned) RETURN_STUB(jint_fill); | |
420 RETURN_STUB(arrayof_jint_fill); | |
421 case T_DOUBLE: | |
422 case T_LONG: | |
423 case T_ARRAY: | |
424 case T_OBJECT: | |
425 case T_NARROWOOP: | |
426 case T_ADDRESS: | |
427 // Currently unsupported | |
428 return NULL; | |
429 | |
430 default: | |
431 ShouldNotReachHere(); | |
432 return NULL; | |
433 } | |
434 | |
435 #undef RETURN_STUB | |
436 } | |
2446 | 437 |
438 // constants for computing the copy function | |
439 enum { | |
440 COPYFUNC_UNALIGNED = 0, | |
441 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize | |
442 COPYFUNC_CONJOINT = 0, | |
443 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend | |
444 }; | |
445 | |
446 // Note: The condition "disjoint" applies also for overlapping copies | |
447 // where an descending copy is permitted (i.e., dest_offset <= src_offset). | |
448 address | |
449 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) { | |
450 int selector = | |
451 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) + | |
452 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT); | |
453 | |
454 #define RETURN_STUB(xxx_arraycopy) { \ | |
455 name = #xxx_arraycopy; \ | |
456 return StubRoutines::xxx_arraycopy(); } | |
457 | |
458 #define RETURN_STUB_PARM(xxx_arraycopy, parm) { \ | |
459 name = #xxx_arraycopy; \ | |
460 return StubRoutines::xxx_arraycopy(parm); } | |
461 | |
462 switch (t) { | |
463 case T_BYTE: | |
464 case T_BOOLEAN: | |
465 switch (selector) { | |
466 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy); | |
467 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy); | |
468 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy); | |
469 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy); | |
470 } | |
471 case T_CHAR: | |
472 case T_SHORT: | |
473 switch (selector) { | |
474 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy); | |
475 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy); | |
476 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy); | |
477 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy); | |
478 } | |
479 case T_INT: | |
480 case T_FLOAT: | |
481 switch (selector) { | |
482 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy); | |
483 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy); | |
484 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy); | |
485 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy); | |
486 } | |
487 case T_DOUBLE: | |
488 case T_LONG: | |
489 switch (selector) { | |
490 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy); | |
491 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy); | |
492 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy); | |
493 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy); | |
494 } | |
495 case T_ARRAY: | |
496 case T_OBJECT: | |
497 switch (selector) { | |
498 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized); | |
499 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized); | |
500 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized); | |
501 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized); | |
502 } | |
503 default: | |
504 ShouldNotReachHere(); | |
505 return NULL; | |
506 } | |
507 | |
508 #undef RETURN_STUB | |
509 #undef RETURN_STUB_PARM | |
510 } |