1 /*
2 * Copyright (c) 1997, 2016, 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 "code/codeCacheExtensions.hpp"
28 #include "memory/resourceArea.hpp"
29 #include "oops/oop.inline.hpp"
30 #include "runtime/interfaceSupport.hpp"
31 #include "runtime/timerTrace.hpp"
32 #include "runtime/sharedRuntime.hpp"
33 #include "runtime/stubRoutines.hpp"
34 #include "utilities/copy.hpp"
35 #ifdef COMPILER2
36 #include "opto/runtime.hpp"
37 #endif
38
39
40 // Implementation of StubRoutines - for a description
41 // of how to extend it, see the header file.
42
43 // Class Variables
44
45 BufferBlob* StubRoutines::_code1 = NULL;
46 BufferBlob* StubRoutines::_code2 = NULL;
47
48 address StubRoutines::_call_stub_return_address = NULL;
49 address StubRoutines::_call_stub_entry = NULL;
50
51 address StubRoutines::_catch_exception_entry = NULL;
52 address StubRoutines::_forward_exception_entry = NULL;
53 address StubRoutines::_throw_AbstractMethodError_entry = NULL;
54 address StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL;
55 address StubRoutines::_throw_NullPointerException_at_call_entry = NULL;
56 address StubRoutines::_throw_StackOverflowError_entry = NULL;
57 address StubRoutines::_throw_delayed_StackOverflowError_entry = NULL;
58 jint StubRoutines::_verify_oop_count = 0;
59 address StubRoutines::_verify_oop_subroutine_entry = NULL;
60 address StubRoutines::_atomic_xchg_entry = NULL;
61 address StubRoutines::_atomic_xchg_ptr_entry = NULL;
62 address StubRoutines::_atomic_store_entry = NULL;
63 address StubRoutines::_atomic_store_ptr_entry = NULL;
64 address StubRoutines::_atomic_cmpxchg_entry = NULL;
65 address StubRoutines::_atomic_cmpxchg_ptr_entry = NULL;
66 address StubRoutines::_atomic_cmpxchg_byte_entry = NULL;
67 address StubRoutines::_atomic_cmpxchg_long_entry = NULL;
68 address StubRoutines::_atomic_add_entry = NULL;
69 address StubRoutines::_atomic_add_ptr_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_64 = 0;
77 jint StubRoutines::_fpu_cntrl_wrd_trunc = 0;
78 jint StubRoutines::_mxcsr_std = 0;
79 jint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 };
80 jint StubRoutines::_fpu_subnormal_bias2[3] = { 0, 0, 0 };
81
82 // Compiled code entry points default values
83 // The default functions don't have separate disjoint versions.
84 address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
85 address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
86 address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
87 address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
88 address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
89 address StubRoutines::_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
90 address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
91 address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
92 address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
93 address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
94 address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
95 address StubRoutines::_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
96
97 address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
98 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
99 address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
100 address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
101 address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
102 address StubRoutines::_arrayof_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
103 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
104 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
105 address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
106 address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
107 address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
108 address StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
109
110 address StubRoutines::_zero_aligned_words = CAST_FROM_FN_PTR(address, Copy::zero_to_words);
111
112 address StubRoutines::_checkcast_arraycopy = NULL;
113 address StubRoutines::_checkcast_arraycopy_uninit = NULL;
114 address StubRoutines::_unsafe_arraycopy = NULL;
115 address StubRoutines::_generic_arraycopy = NULL;
116
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 address StubRoutines::_aescrypt_encryptBlock = NULL;
126 address StubRoutines::_aescrypt_decryptBlock = NULL;
127 address StubRoutines::_cipherBlockChaining_encryptAESCrypt = NULL;
128 address StubRoutines::_cipherBlockChaining_decryptAESCrypt = NULL;
129 address StubRoutines::_counterMode_AESCrypt = NULL;
130 address StubRoutines::_ghash_processBlocks = 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 double (* StubRoutines::_intrinsic_log10 )(double) = NULL;
166 double (* StubRoutines::_intrinsic_sin )(double) = NULL;
167 double (* StubRoutines::_intrinsic_cos )(double) = NULL;
168 double (* StubRoutines::_intrinsic_tan )(double) = NULL;
169
170 address StubRoutines::_safefetch32_entry = NULL;
171 address StubRoutines::_safefetch32_fault_pc = NULL;
172 address StubRoutines::_safefetch32_continuation_pc = NULL;
173 address StubRoutines::_safefetchN_entry = NULL;
174 address StubRoutines::_safefetchN_fault_pc = NULL;
175 address StubRoutines::_safefetchN_continuation_pc = NULL;
176
177 // Initialization
178 //
179 // Note: to break cycle with universe initialization, stubs are generated in two phases.
180 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry).
181 // The second phase includes all other stubs (which may depend on universe being initialized.)
182
183 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators
184
185 void StubRoutines::initialize1() {
186 if (_code1 == NULL) {
187 ResourceMark rm;
188 TraceTime timer("StubRoutines generation 1", TRACETIME_LOG(Info, startuptime));
189 _code1 = BufferBlob::create("StubRoutines (1)", code_size1);
190 if (_code1 == NULL) {
191 vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)");
192 }
193 CodeBuffer buffer(_code1);
194 StubGenerator_generate(&buffer, false);
195 // When new stubs added we need to make sure there is some space left
196 // to catch situation when we should increase size again.
197 assert(code_size1 == 0 || buffer.insts_remaining() > 200, "increase code_size1");
198 }
199 }
200
201
202 #ifdef ASSERT
203 typedef void (*arraycopy_fn)(address src, address dst, int count);
204
205 // simple tests of generated arraycopy functions
206 static void test_arraycopy_func(address func, int alignment) {
207 if (CodeCacheExtensions::use_pregenerated_interpreter() || !CodeCacheExtensions::is_executable(func)) {
208 // Exit safely if stubs were generated but cannot be used.
209 // Also excluding pregenerated interpreter since the code may depend on
210 // some registers being properly initialized (for instance Rthread)
211 return;
212 }
213 int v = 0xcc;
214 int v2 = 0x11;
215 jlong lbuffer[8];
216 jlong lbuffer2[8];
217 address fbuffer = (address) lbuffer;
218 address fbuffer2 = (address) lbuffer2;
219 unsigned int i;
220 for (i = 0; i < sizeof(lbuffer); i++) {
221 fbuffer[i] = v; fbuffer2[i] = v2;
222 }
223 // C++ does not guarantee jlong[] array alignment to 8 bytes.
224 // Use middle of array to check that memory before it is not modified.
225 address buffer = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong);
226 address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong);
227 // do an aligned copy
228 ((arraycopy_fn)func)(buffer, buffer2, 0);
229 for (i = 0; i < sizeof(lbuffer); i++) {
230 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
231 }
232 // adjust destination alignment
233 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0);
234 for (i = 0; i < sizeof(lbuffer); i++) {
235 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
236 }
237 // adjust source alignment
238 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0);
239 for (i = 0; i < sizeof(lbuffer); i++) {
240 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
241 }
242 }
243
244 // simple test for SafeFetch32
245 static void test_safefetch32() {
246 if (CanUseSafeFetch32()) {
247 int dummy = 17;
248 int* const p_invalid = (int*) get_segfault_address();
249 int* const p_valid = &dummy;
250 int result_invalid = SafeFetch32(p_invalid, 0xABC);
251 assert(result_invalid == 0xABC, "SafeFetch32 error");
252 int result_valid = SafeFetch32(p_valid, 0xABC);
253 assert(result_valid == 17, "SafeFetch32 error");
254 }
255 }
256
257 // simple test for SafeFetchN
258 static void test_safefetchN() {
259 if (CanUseSafeFetchN()) {
260 #ifdef _LP64
261 const intptr_t v1 = UCONST64(0xABCD00000000ABCD);
262 const intptr_t v2 = UCONST64(0xDEFD00000000DEFD);
263 #else
264 const intptr_t v1 = 0xABCDABCD;
265 const intptr_t v2 = 0xDEFDDEFD;
266 #endif
267 intptr_t dummy = v1;
268 intptr_t* const p_invalid = (intptr_t*) get_segfault_address();
269 intptr_t* const p_valid = &dummy;
270 intptr_t result_invalid = SafeFetchN(p_invalid, v2);
271 assert(result_invalid == v2, "SafeFetchN error");
272 intptr_t result_valid = SafeFetchN(p_valid, v2);
273 assert(result_valid == v1, "SafeFetchN error");
274 }
275 }
276 #endif
277
278 void StubRoutines::initialize2() {
279 if (_code2 == NULL) {
280 ResourceMark rm;
281 TraceTime timer("StubRoutines generation 2", TRACETIME_LOG(Info, startuptime));
282 _code2 = BufferBlob::create("StubRoutines (2)", code_size2);
283 if (_code2 == NULL) {
284 vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)");
285 }
286 CodeBuffer buffer(_code2);
287 StubGenerator_generate(&buffer, true);
288 // When new stubs added we need to make sure there is some space left
289 // to catch situation when we should increase size again.
290 assert(code_size2 == 0 || buffer.insts_remaining() > 200, "increase code_size2");
291 }
292
293 #ifdef ASSERT
294
295 #define TEST_ARRAYCOPY(type) \
296 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \
297 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \
298 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \
299 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord))
300
301 // Make sure all the arraycopy stubs properly handle zero count
302 TEST_ARRAYCOPY(jbyte);
303 TEST_ARRAYCOPY(jshort);
304 TEST_ARRAYCOPY(jint);
305 TEST_ARRAYCOPY(jlong);
306
307 #undef TEST_ARRAYCOPY
308
309 #define TEST_FILL(type) \
310 if (_##type##_fill != NULL) { \
311 union { \
312 double d; \
313 type body[96]; \
314 } s; \
315 \
316 int v = 32; \
317 for (int offset = -2; offset <= 2; offset++) { \
318 for (int i = 0; i < 96; i++) { \
319 s.body[i] = 1; \
320 } \
321 type* start = s.body + 8 + offset; \
322 for (int aligned = 0; aligned < 2; aligned++) { \
323 if (aligned) { \
324 if (((intptr_t)start) % HeapWordSize == 0) { \
325 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \
326 } else { \
327 continue; \
328 } \
329 } else { \
330 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \
331 } \
332 for (int i = 0; i < 96; i++) { \
333 if (i < (8 + offset) || i >= (88 + offset)) { \
334 assert(s.body[i] == 1, "what?"); \
335 } else { \
336 assert(s.body[i] == 32, "what?"); \
337 } \
338 } \
339 } \
340 } \
341 } \
342
343 TEST_FILL(jbyte);
344 TEST_FILL(jshort);
345 TEST_FILL(jint);
346
347 #undef TEST_FILL
348
349 #define TEST_COPYRTN(type) \
350 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \
351 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type)))
352
353 // Make sure all the copy runtime routines properly handle zero count
354 TEST_COPYRTN(jbyte);
355 TEST_COPYRTN(jshort);
356 TEST_COPYRTN(jint);
357 TEST_COPYRTN(jlong);
358
359 #undef TEST_COPYRTN
360
361 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord));
362 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord));
363 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord));
364 // Aligned to BytesPerLong
365 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong));
366 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong));
367
368 // test safefetch routines
369 // Not on Windows 32bit until 8074860 is fixed
370 #if ! (defined(_WIN32) && defined(_M_IX86))
371 test_safefetch32();
372 test_safefetchN();
373 #endif
374
375 #endif
376 }
377
378
379 void stubRoutines_init1() { StubRoutines::initialize1(); }
380 void stubRoutines_init2() { StubRoutines::initialize2(); }
381
382 //
383 // Default versions of arraycopy functions
384 //
385
386 static void gen_arraycopy_barrier_pre(oop* dest, size_t count, bool dest_uninitialized) {
387 assert(count != 0, "count should be non-zero");
388 assert(count <= (size_t)max_intx, "count too large");
389 BarrierSet* bs = Universe::heap()->barrier_set();
390 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt");
391 bs->write_ref_array_pre(dest, (int)count, dest_uninitialized);
392 }
393
394 static void gen_arraycopy_barrier(oop* dest, size_t count) {
395 assert(count != 0, "count should be non-zero");
396 BarrierSet* bs = Universe::heap()->barrier_set();
397 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
398 bs->write_ref_array((HeapWord*)dest, count);
399 }
400
401 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
402 #ifndef PRODUCT
403 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
404 #endif // !PRODUCT
405 Copy::conjoint_jbytes_atomic(src, dest, count);
406 JRT_END
407
408 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
409 #ifndef PRODUCT
410 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
411 #endif // !PRODUCT
412 Copy::conjoint_jshorts_atomic(src, dest, count);
413 JRT_END
414
415 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
416 #ifndef PRODUCT
417 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
418 #endif // !PRODUCT
419 Copy::conjoint_jints_atomic(src, dest, count);
420 JRT_END
421
422 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
423 #ifndef PRODUCT
424 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy
425 #endif // !PRODUCT
426 Copy::conjoint_jlongs_atomic(src, dest, count);
427 JRT_END
428
429 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
430 #ifndef PRODUCT
431 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
432 #endif // !PRODUCT
433 assert(count != 0, "count should be non-zero");
434 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false);
435 Copy::conjoint_oops_atomic(src, dest, count);
436 gen_arraycopy_barrier(dest, count);
437 JRT_END
438
439 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count))
440 #ifndef PRODUCT
441 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
442 #endif // !PRODUCT
443 assert(count != 0, "count should be non-zero");
444 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true);
445 Copy::conjoint_oops_atomic(src, dest, count);
446 gen_arraycopy_barrier(dest, count);
447 JRT_END
448
449 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
450 #ifndef PRODUCT
451 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
452 #endif // !PRODUCT
453 Copy::arrayof_conjoint_jbytes(src, dest, count);
454 JRT_END
455
456 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
457 #ifndef PRODUCT
458 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
459 #endif // !PRODUCT
460 Copy::arrayof_conjoint_jshorts(src, dest, count);
461 JRT_END
462
463 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count))
464 #ifndef PRODUCT
465 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
466 #endif // !PRODUCT
467 Copy::arrayof_conjoint_jints(src, dest, count);
468 JRT_END
469
470 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
471 #ifndef PRODUCT
472 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy
473 #endif // !PRODUCT
474 Copy::arrayof_conjoint_jlongs(src, dest, count);
475 JRT_END
476
477 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count))
478 #ifndef PRODUCT
479 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
480 #endif // !PRODUCT
481 assert(count != 0, "count should be non-zero");
482 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/false);
483 Copy::arrayof_conjoint_oops(src, dest, count);
484 gen_arraycopy_barrier((oop *) dest, count);
485 JRT_END
486
487 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count))
488 #ifndef PRODUCT
489 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
490 #endif // !PRODUCT
491 assert(count != 0, "count should be non-zero");
492 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/true);
493 Copy::arrayof_conjoint_oops(src, dest, count);
494 gen_arraycopy_barrier((oop *) dest, count);
495 JRT_END
496
497 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) {
498 #define RETURN_STUB(xxx_fill) { \
499 name = #xxx_fill; \
500 return StubRoutines::xxx_fill(); }
501
502 switch (t) {
503 case T_BYTE:
504 case T_BOOLEAN:
505 if (!aligned) RETURN_STUB(jbyte_fill);
506 RETURN_STUB(arrayof_jbyte_fill);
507 case T_CHAR:
508 case T_SHORT:
509 if (!aligned) RETURN_STUB(jshort_fill);
510 RETURN_STUB(arrayof_jshort_fill);
511 case T_INT:
512 case T_FLOAT:
513 if (!aligned) RETURN_STUB(jint_fill);
514 RETURN_STUB(arrayof_jint_fill);
515 case T_DOUBLE:
516 case T_LONG:
517 case T_ARRAY:
518 case T_OBJECT:
519 case T_NARROWOOP:
520 case T_NARROWKLASS:
521 case T_ADDRESS:
522 // Currently unsupported
523 return NULL;
524
525 default:
526 ShouldNotReachHere();
527 return NULL;
528 }
529
530 #undef RETURN_STUB
531 }
532
533 // constants for computing the copy function
534 enum {
535 COPYFUNC_UNALIGNED = 0,
536 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize
537 COPYFUNC_CONJOINT = 0,
538 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend
539 };
540
541 // Note: The condition "disjoint" applies also for overlapping copies
542 // where an descending copy is permitted (i.e., dest_offset <= src_offset).
543 address
544 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) {
545 int selector =
546 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) +
547 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT);
548
549 #define RETURN_STUB(xxx_arraycopy) { \
550 name = #xxx_arraycopy; \
551 return StubRoutines::xxx_arraycopy(); }
552
553 #define RETURN_STUB_PARM(xxx_arraycopy, parm) { \
554 name = #xxx_arraycopy; \
555 return StubRoutines::xxx_arraycopy(parm); }
556
557 switch (t) {
558 case T_BYTE:
559 case T_BOOLEAN:
560 switch (selector) {
561 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy);
562 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy);
563 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy);
564 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy);
565 }
566 case T_CHAR:
567 case T_SHORT:
568 switch (selector) {
569 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy);
570 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy);
571 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy);
572 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy);
573 }
574 case T_INT:
575 case T_FLOAT:
576 switch (selector) {
577 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy);
578 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy);
579 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy);
580 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy);
581 }
582 case T_DOUBLE:
583 case T_LONG:
584 switch (selector) {
585 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy);
586 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy);
587 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy);
588 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy);
589 }
590 case T_ARRAY:
591 case T_OBJECT:
592 switch (selector) {
593 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized);
594 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized);
595 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized);
596 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized);
597 }
598 default:
599 ShouldNotReachHere();
600 return NULL;
601 }
602
603 #undef RETURN_STUB
604 #undef RETURN_STUB_PARM
605 }