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