1 /*
2 * Copyright (c) 1997, 2015, 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_byte_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
82 // The default functions don't have separate disjoint versions.
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);
88 address StubRoutines::_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
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);
94 address StubRoutines::_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
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);
101 address StubRoutines::_arrayof_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
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);
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
109 address StubRoutines::_zero_aligned_words = CAST_FROM_FN_PTR(address, Copy::zero_to_words);
110
111 address StubRoutines::_checkcast_arraycopy = NULL;
112 address StubRoutines::_checkcast_arraycopy_uninit = NULL;
113 address StubRoutines::_unsafe_arraycopy = NULL;
114 address StubRoutines::_generic_arraycopy = NULL;
115
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
124 address StubRoutines::_aescrypt_encryptBlock = NULL;
125 address StubRoutines::_aescrypt_decryptBlock = NULL;
126 address StubRoutines::_cipherBlockChaining_encryptAESCrypt = NULL;
127 address StubRoutines::_cipherBlockChaining_decryptAESCrypt = NULL;
128 address StubRoutines::_ghash_processBlocks = NULL;
129
130 address StubRoutines::_sha1_implCompress = NULL;
131 address StubRoutines::_sha1_implCompressMB = NULL;
132 address StubRoutines::_sha256_implCompress = NULL;
133 address StubRoutines::_sha256_implCompressMB = NULL;
134 address StubRoutines::_sha512_implCompress = NULL;
135 address StubRoutines::_sha512_implCompressMB = NULL;
136
137 address StubRoutines::_updateBytesCRC32 = NULL;
138 address StubRoutines::_crc_table_adr = NULL;
139
140 address StubRoutines::_crc32c_table_addr = NULL;
141 address StubRoutines::_updateBytesCRC32C = NULL;
142
143 address StubRoutines::_multiplyToLen = NULL;
144 address StubRoutines::_squareToLen = NULL;
145 address StubRoutines::_mulAdd = NULL;
146
147 double (* StubRoutines::_intrinsic_log )(double) = NULL;
148 double (* StubRoutines::_intrinsic_log10 )(double) = NULL;
149 double (* StubRoutines::_intrinsic_exp )(double) = NULL;
150 double (* StubRoutines::_intrinsic_pow )(double, double) = NULL;
151 double (* StubRoutines::_intrinsic_sin )(double) = NULL;
152 double (* StubRoutines::_intrinsic_cos )(double) = NULL;
153 double (* StubRoutines::_intrinsic_tan )(double) = NULL;
154
155 address StubRoutines::_safefetch32_entry = NULL;
156 address StubRoutines::_safefetch32_fault_pc = NULL;
157 address StubRoutines::_safefetch32_continuation_pc = NULL;
158 address StubRoutines::_safefetchN_entry = NULL;
159 address StubRoutines::_safefetchN_fault_pc = NULL;
160 address StubRoutines::_safefetchN_continuation_pc = NULL;
161
162 // Initialization
163 //
164 // Note: to break cycle with universe initialization, stubs are generated in two phases.
165 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry).
166 // The second phase includes all other stubs (which may depend on universe being initialized.)
167
168 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators
169
170 void StubRoutines::initialize1() {
171 if (_code1 == NULL) {
172 ResourceMark rm;
173 TraceTime timer("StubRoutines generation 1", TraceStartupTime);
174 _code1 = BufferBlob::create("StubRoutines (1)", code_size1);
175 if (_code1 == NULL) {
176 vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)");
177 }
178 CodeBuffer buffer(_code1);
179 StubGenerator_generate(&buffer, false);
180 // When new stubs added we need to make sure there is some space left
181 // to catch situation when we should increase size again.
182 assert(buffer.insts_remaining() > 200, "increase code_size1");
183 }
184 }
185
186
187 #ifdef ASSERT
188 typedef void (*arraycopy_fn)(address src, address dst, int count);
189
190 // simple tests of generated arraycopy functions
191 static void test_arraycopy_func(address func, int alignment) {
192 int v = 0xcc;
193 int v2 = 0x11;
194 jlong lbuffer[8];
195 jlong lbuffer2[8];
196 address fbuffer = (address) lbuffer;
197 address fbuffer2 = (address) lbuffer2;
198 unsigned int i;
199 for (i = 0; i < sizeof(lbuffer); i++) {
200 fbuffer[i] = v; fbuffer2[i] = v2;
201 }
202 // C++ does not guarantee jlong[] array alignment to 8 bytes.
203 // Use middle of array to check that memory before it is not modified.
204 address buffer = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong);
205 address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong);
206 // do an aligned copy
207 ((arraycopy_fn)func)(buffer, buffer2, 0);
208 for (i = 0; i < sizeof(lbuffer); i++) {
209 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
210 }
211 // adjust destination alignment
212 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0);
213 for (i = 0; i < sizeof(lbuffer); i++) {
214 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
215 }
216 // adjust source alignment
217 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0);
218 for (i = 0; i < sizeof(lbuffer); i++) {
219 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
220 }
221 }
222
223 // simple test for SafeFetch32
224 static void test_safefetch32() {
225 if (CanUseSafeFetch32()) {
226 int dummy = 17;
227 int* const p_invalid = (int*) get_segfault_address();
228 int* const p_valid = &dummy;
229 int result_invalid = SafeFetch32(p_invalid, 0xABC);
230 assert(result_invalid == 0xABC, "SafeFetch32 error");
231 int result_valid = SafeFetch32(p_valid, 0xABC);
232 assert(result_valid == 17, "SafeFetch32 error");
233 }
234 }
235
236 // simple test for SafeFetchN
237 static void test_safefetchN() {
238 if (CanUseSafeFetchN()) {
239 #ifdef _LP64
240 const intptr_t v1 = UCONST64(0xABCD00000000ABCD);
241 const intptr_t v2 = UCONST64(0xDEFD00000000DEFD);
242 #else
243 const intptr_t v1 = 0xABCDABCD;
244 const intptr_t v2 = 0xDEFDDEFD;
245 #endif
246 intptr_t dummy = v1;
247 intptr_t* const p_invalid = (intptr_t*) get_segfault_address();
248 intptr_t* const p_valid = &dummy;
249 intptr_t result_invalid = SafeFetchN(p_invalid, v2);
250 assert(result_invalid == v2, "SafeFetchN error");
251 intptr_t result_valid = SafeFetchN(p_valid, v2);
252 assert(result_valid == v1, "SafeFetchN error");
253 }
254 }
255 #endif
256
257 void StubRoutines::initialize2() {
258 if (_code2 == NULL) {
259 ResourceMark rm;
260 TraceTime timer("StubRoutines generation 2", TraceStartupTime);
261 _code2 = BufferBlob::create("StubRoutines (2)", code_size2);
262 if (_code2 == NULL) {
263 vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)");
264 }
265 CodeBuffer buffer(_code2);
266 StubGenerator_generate(&buffer, true);
267 // When new stubs added we need to make sure there is some space left
268 // to catch situation when we should increase size again.
269 assert(buffer.insts_remaining() > 200, "increase code_size2");
270 }
271
272 #ifdef ASSERT
273
274 #define TEST_ARRAYCOPY(type) \
275 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \
276 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \
277 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \
278 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord))
279
280 // Make sure all the arraycopy stubs properly handle zero count
281 TEST_ARRAYCOPY(jbyte);
282 TEST_ARRAYCOPY(jshort);
283 TEST_ARRAYCOPY(jint);
284 TEST_ARRAYCOPY(jlong);
285
286 #undef TEST_ARRAYCOPY
287
288 #define TEST_FILL(type) \
289 if (_##type##_fill != NULL) { \
290 union { \
291 double d; \
292 type body[96]; \
293 } s; \
294 \
295 int v = 32; \
296 for (int offset = -2; offset <= 2; offset++) { \
297 for (int i = 0; i < 96; i++) { \
298 s.body[i] = 1; \
299 } \
300 type* start = s.body + 8 + offset; \
301 for (int aligned = 0; aligned < 2; aligned++) { \
302 if (aligned) { \
303 if (((intptr_t)start) % HeapWordSize == 0) { \
304 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \
305 } else { \
306 continue; \
307 } \
308 } else { \
309 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \
310 } \
311 for (int i = 0; i < 96; i++) { \
312 if (i < (8 + offset) || i >= (88 + offset)) { \
313 assert(s.body[i] == 1, "what?"); \
314 } else { \
315 assert(s.body[i] == 32, "what?"); \
316 } \
317 } \
318 } \
319 } \
320 } \
321
322 TEST_FILL(jbyte);
323 TEST_FILL(jshort);
324 TEST_FILL(jint);
325
326 #undef TEST_FILL
327
328 #define TEST_COPYRTN(type) \
329 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \
330 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type)))
331
332 // Make sure all the copy runtime routines properly handle zero count
333 TEST_COPYRTN(jbyte);
334 TEST_COPYRTN(jshort);
335 TEST_COPYRTN(jint);
336 TEST_COPYRTN(jlong);
337
338 #undef TEST_COPYRTN
339
340 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord));
341 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord));
342 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord));
343 // Aligned to BytesPerLong
344 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong));
345 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong));
346
347 // test safefetch routines
348 // Not on Windows 32bit until 8074860 is fixed
349 #if ! (defined(_WIN32) && defined(_M_IX86))
350 test_safefetch32();
351 test_safefetchN();
352 #endif
353
354 #endif
355 }
356
357
358 void stubRoutines_init1() { StubRoutines::initialize1(); }
359 void stubRoutines_init2() { StubRoutines::initialize2(); }
360
361 //
362 // Default versions of arraycopy functions
363 //
364
365 static void gen_arraycopy_barrier_pre(oop* dest, size_t count, bool dest_uninitialized) {
366 assert(count != 0, "count should be non-zero");
367 assert(count <= (size_t)max_intx, "count too large");
368 BarrierSet* bs = Universe::heap()->barrier_set();
369 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt");
370 bs->write_ref_array_pre(dest, (int)count, dest_uninitialized);
371 }
372
373 static void gen_arraycopy_barrier(oop* dest, size_t count) {
374 assert(count != 0, "count should be non-zero");
375 BarrierSet* bs = Universe::heap()->barrier_set();
376 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
377 bs->write_ref_array((HeapWord*)dest, count);
378 }
379
380 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
381 #ifndef PRODUCT
382 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
383 #endif // !PRODUCT
384 Copy::conjoint_jbytes_atomic(src, dest, count);
385 JRT_END
386
387 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
388 #ifndef PRODUCT
389 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
390 #endif // !PRODUCT
391 Copy::conjoint_jshorts_atomic(src, dest, count);
392 JRT_END
393
394 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
395 #ifndef PRODUCT
396 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
397 #endif // !PRODUCT
398 Copy::conjoint_jints_atomic(src, dest, count);
399 JRT_END
400
401 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
402 #ifndef PRODUCT
403 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy
404 #endif // !PRODUCT
405 Copy::conjoint_jlongs_atomic(src, dest, count);
406 JRT_END
407
408 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
409 #ifndef PRODUCT
410 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
411 #endif // !PRODUCT
412 assert(count != 0, "count should be non-zero");
413 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false);
414 Copy::conjoint_oops_atomic(src, dest, count);
415 gen_arraycopy_barrier(dest, count);
416 JRT_END
417
418 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count))
419 #ifndef PRODUCT
420 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
421 #endif // !PRODUCT
422 assert(count != 0, "count should be non-zero");
423 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true);
424 Copy::conjoint_oops_atomic(src, dest, count);
425 gen_arraycopy_barrier(dest, count);
426 JRT_END
427
428 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
429 #ifndef PRODUCT
430 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
431 #endif // !PRODUCT
432 Copy::arrayof_conjoint_jbytes(src, dest, count);
433 JRT_END
434
435 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
436 #ifndef PRODUCT
437 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
438 #endif // !PRODUCT
439 Copy::arrayof_conjoint_jshorts(src, dest, count);
440 JRT_END
441
442 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count))
443 #ifndef PRODUCT
444 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
445 #endif // !PRODUCT
446 Copy::arrayof_conjoint_jints(src, dest, count);
447 JRT_END
448
449 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
450 #ifndef PRODUCT
451 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy
452 #endif // !PRODUCT
453 Copy::arrayof_conjoint_jlongs(src, dest, count);
454 JRT_END
455
456 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count))
457 #ifndef PRODUCT
458 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
459 #endif // !PRODUCT
460 assert(count != 0, "count should be non-zero");
461 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/false);
462 Copy::arrayof_conjoint_oops(src, dest, count);
463 gen_arraycopy_barrier((oop *) dest, count);
464 JRT_END
465
466 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count))
467 #ifndef PRODUCT
468 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
469 #endif // !PRODUCT
470 assert(count != 0, "count should be non-zero");
471 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/true);
472 Copy::arrayof_conjoint_oops(src, dest, count);
473 gen_arraycopy_barrier((oop *) dest, count);
474 JRT_END
475
476 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) {
477 #define RETURN_STUB(xxx_fill) { \
478 name = #xxx_fill; \
479 return StubRoutines::xxx_fill(); }
480
481 switch (t) {
482 case T_BYTE:
483 case T_BOOLEAN:
484 if (!aligned) RETURN_STUB(jbyte_fill);
485 RETURN_STUB(arrayof_jbyte_fill);
486 case T_CHAR:
487 case T_SHORT:
488 if (!aligned) RETURN_STUB(jshort_fill);
489 RETURN_STUB(arrayof_jshort_fill);
490 case T_INT:
491 case T_FLOAT:
492 if (!aligned) RETURN_STUB(jint_fill);
493 RETURN_STUB(arrayof_jint_fill);
494 case T_DOUBLE:
495 case T_LONG:
496 case T_ARRAY:
497 case T_OBJECT:
498 case T_NARROWOOP:
499 case T_NARROWKLASS:
500 case T_ADDRESS:
501 // Currently unsupported
502 return NULL;
503
504 default:
505 ShouldNotReachHere();
506 return NULL;
507 }
508
509 #undef RETURN_STUB
510 }
511
512 // constants for computing the copy function
513 enum {
514 COPYFUNC_UNALIGNED = 0,
515 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize
516 COPYFUNC_CONJOINT = 0,
517 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend
518 };
519
520 // Note: The condition "disjoint" applies also for overlapping copies
521 // where an descending copy is permitted (i.e., dest_offset <= src_offset).
522 address
523 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) {
524 int selector =
525 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) +
526 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT);
527
528 #define RETURN_STUB(xxx_arraycopy) { \
529 name = #xxx_arraycopy; \
530 return StubRoutines::xxx_arraycopy(); }
531
532 #define RETURN_STUB_PARM(xxx_arraycopy, parm) { \
533 name = #xxx_arraycopy; \
534 return StubRoutines::xxx_arraycopy(parm); }
535
536 switch (t) {
537 case T_BYTE:
538 case T_BOOLEAN:
539 switch (selector) {
540 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy);
541 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy);
542 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy);
543 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy);
544 }
545 case T_CHAR:
546 case T_SHORT:
547 switch (selector) {
548 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy);
549 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy);
550 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy);
551 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy);
552 }
553 case T_INT:
554 case T_FLOAT:
555 switch (selector) {
556 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy);
557 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy);
558 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy);
559 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy);
560 }
561 case T_DOUBLE:
562 case T_LONG:
563 switch (selector) {
564 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy);
565 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy);
566 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy);
567 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy);
568 }
569 case T_ARRAY:
570 case T_OBJECT:
571 switch (selector) {
572 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized);
573 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized);
574 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized);
575 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized);
576 }
577 default:
578 ShouldNotReachHere();
579 return NULL;
580 }
581
582 #undef RETURN_STUB
583 #undef RETURN_STUB_PARM
584 }