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