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