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