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