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