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