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