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