1 /*
2 * Copyright (c) 1997, 2014, 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_long_entry = NULL;
66 address StubRoutines::_atomic_add_entry = NULL;
67 address StubRoutines::_atomic_add_ptr_entry = NULL;
68 address StubRoutines::_fence_entry = NULL;
69 address StubRoutines::_d2i_wrapper = NULL;
70 address StubRoutines::_d2l_wrapper = NULL;
71
72 jint StubRoutines::_fpu_cntrl_wrd_std = 0;
73 jint StubRoutines::_fpu_cntrl_wrd_24 = 0;
74 jint StubRoutines::_fpu_cntrl_wrd_64 = 0;
75 jint StubRoutines::_fpu_cntrl_wrd_trunc = 0;
76 jint StubRoutines::_mxcsr_std = 0;
77 jint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 };
78 jint StubRoutines::_fpu_subnormal_bias2[3] = { 0, 0, 0 };
79
80 // Compiled code entry points default values
81 // The default functions don't have separate disjoint versions.
82 address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
83 address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
84 address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
85 address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
86 address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
87 address StubRoutines::_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
88 address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
89 address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
90 address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
91 address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
92 address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
93 address StubRoutines::_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
94
95 address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
96 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
97 address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
98 address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
99 address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
100 address StubRoutines::_arrayof_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
101 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
102 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
103 address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
104 address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
105 address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
106 address StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
107
108 address StubRoutines::_zero_aligned_words = CAST_FROM_FN_PTR(address, Copy::zero_to_words);
109
110 address StubRoutines::_checkcast_arraycopy = NULL;
111 address StubRoutines::_checkcast_arraycopy_uninit = NULL;
112 address StubRoutines::_unsafe_arraycopy = NULL;
113 address StubRoutines::_generic_arraycopy = NULL;
114
115
116 address StubRoutines::_jbyte_fill;
117 address StubRoutines::_jshort_fill;
118 address StubRoutines::_jint_fill;
119 address StubRoutines::_arrayof_jbyte_fill;
120 address StubRoutines::_arrayof_jshort_fill;
121 address StubRoutines::_arrayof_jint_fill;
122
123 address StubRoutines::_aescrypt_encryptBlock = NULL;
124 address StubRoutines::_aescrypt_decryptBlock = NULL;
125 address StubRoutines::_cipherBlockChaining_encryptAESCrypt = NULL;
126 address StubRoutines::_cipherBlockChaining_decryptAESCrypt = NULL;
127
128 address StubRoutines::_sha1_implCompress = NULL;
129 address StubRoutines::_sha1_implCompressMB = NULL;
130 address StubRoutines::_sha256_implCompress = NULL;
131 address StubRoutines::_sha256_implCompressMB = NULL;
132 address StubRoutines::_sha512_implCompress = NULL;
133 address StubRoutines::_sha512_implCompressMB = NULL;
134
135 address StubRoutines::_updateBytesCRC32 = NULL;
136 address StubRoutines::_crc_table_adr = NULL;
137
138 address StubRoutines::_multiplyToLen = NULL;
139 address StubRoutines::_squareToLen = NULL;
140 address StubRoutines::_mulAdd = NULL;
141 address StubRoutines::_montgomeryMultiply = NULL;
142 address StubRoutines::_montgomerySquare = 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 #endif
217
218
219 void StubRoutines::initialize2() {
220 if (_code2 == NULL) {
221 ResourceMark rm;
222 TraceTime timer("StubRoutines generation 2", TraceStartupTime);
223 _code2 = BufferBlob::create("StubRoutines (2)", code_size2);
224 if (_code2 == NULL) {
225 vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)");
226 }
227 CodeBuffer buffer(_code2);
228 StubGenerator_generate(&buffer, true);
229 }
230
231 #ifdef ASSERT
232
233 #define TEST_ARRAYCOPY(type) \
234 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \
235 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \
236 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \
237 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord))
238
239 // Make sure all the arraycopy stubs properly handle zero count
240 TEST_ARRAYCOPY(jbyte);
241 TEST_ARRAYCOPY(jshort);
242 TEST_ARRAYCOPY(jint);
243 TEST_ARRAYCOPY(jlong);
244
245 #undef TEST_ARRAYCOPY
246
247 #define TEST_FILL(type) \
248 if (_##type##_fill != NULL) { \
249 union { \
250 double d; \
251 type body[96]; \
252 } s; \
253 \
254 int v = 32; \
255 for (int offset = -2; offset <= 2; offset++) { \
256 for (int i = 0; i < 96; i++) { \
257 s.body[i] = 1; \
258 } \
259 type* start = s.body + 8 + offset; \
260 for (int aligned = 0; aligned < 2; aligned++) { \
261 if (aligned) { \
262 if (((intptr_t)start) % HeapWordSize == 0) { \
263 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \
264 } else { \
265 continue; \
266 } \
267 } else { \
268 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \
269 } \
270 for (int i = 0; i < 96; i++) { \
271 if (i < (8 + offset) || i >= (88 + offset)) { \
272 assert(s.body[i] == 1, "what?"); \
273 } else { \
274 assert(s.body[i] == 32, "what?"); \
275 } \
276 } \
277 } \
278 } \
279 } \
280
281 TEST_FILL(jbyte);
282 TEST_FILL(jshort);
283 TEST_FILL(jint);
284
285 #undef TEST_FILL
286
287 #define TEST_COPYRTN(type) \
288 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \
289 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type)))
290
291 // Make sure all the copy runtime routines properly handle zero count
292 TEST_COPYRTN(jbyte);
293 TEST_COPYRTN(jshort);
294 TEST_COPYRTN(jint);
295 TEST_COPYRTN(jlong);
296
297 #undef TEST_COPYRTN
298
299 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord));
300 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord));
301 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord));
302 // Aligned to BytesPerLong
303 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong));
304 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong));
305
306 #endif
307 }
308
309
310 void stubRoutines_init1() { StubRoutines::initialize1(); }
311 void stubRoutines_init2() { StubRoutines::initialize2(); }
312
313 //
314 // Default versions of arraycopy functions
315 //
316
317 static void gen_arraycopy_barrier_pre(oop* dest, size_t count, bool dest_uninitialized) {
318 assert(count != 0, "count should be non-zero");
319 assert(count <= (size_t)max_intx, "count too large");
320 BarrierSet* bs = Universe::heap()->barrier_set();
321 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt");
322 bs->write_ref_array_pre(dest, (int)count, dest_uninitialized);
323 }
324
325 static void gen_arraycopy_barrier(oop* dest, size_t count) {
326 assert(count != 0, "count should be non-zero");
327 BarrierSet* bs = Universe::heap()->barrier_set();
328 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
329 bs->write_ref_array((HeapWord*)dest, count);
330 }
331
332 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
333 #ifndef PRODUCT
334 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
335 #endif // !PRODUCT
336 Copy::conjoint_jbytes_atomic(src, dest, count);
337 JRT_END
338
339 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
340 #ifndef PRODUCT
341 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
342 #endif // !PRODUCT
343 Copy::conjoint_jshorts_atomic(src, dest, count);
344 JRT_END
345
346 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
347 #ifndef PRODUCT
348 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
349 #endif // !PRODUCT
350 Copy::conjoint_jints_atomic(src, dest, count);
351 JRT_END
352
353 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
354 #ifndef PRODUCT
355 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy
356 #endif // !PRODUCT
357 Copy::conjoint_jlongs_atomic(src, dest, count);
358 JRT_END
359
360 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
361 #ifndef PRODUCT
362 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
363 #endif // !PRODUCT
364 assert(count != 0, "count should be non-zero");
365 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false);
366 Copy::conjoint_oops_atomic(src, dest, count);
367 gen_arraycopy_barrier(dest, count);
368 JRT_END
369
370 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count))
371 #ifndef PRODUCT
372 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
373 #endif // !PRODUCT
374 assert(count != 0, "count should be non-zero");
375 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true);
376 Copy::conjoint_oops_atomic(src, dest, count);
377 gen_arraycopy_barrier(dest, count);
378 JRT_END
379
380 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
381 #ifndef PRODUCT
382 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
383 #endif // !PRODUCT
384 Copy::arrayof_conjoint_jbytes(src, dest, count);
385 JRT_END
386
387 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
388 #ifndef PRODUCT
389 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
390 #endif // !PRODUCT
391 Copy::arrayof_conjoint_jshorts(src, dest, count);
392 JRT_END
393
394 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count))
395 #ifndef PRODUCT
396 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
397 #endif // !PRODUCT
398 Copy::arrayof_conjoint_jints(src, dest, count);
399 JRT_END
400
401 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
402 #ifndef PRODUCT
403 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy
404 #endif // !PRODUCT
405 Copy::arrayof_conjoint_jlongs(src, dest, count);
406 JRT_END
407
408 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* 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((oop *) dest, count, /*dest_uninitialized*/false);
414 Copy::arrayof_conjoint_oops(src, dest, count);
415 gen_arraycopy_barrier((oop *) dest, count);
416 JRT_END
417
418 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count))
419 #ifndef PRODUCT
420 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
421 #endif // !PRODUCT
422 assert(count != 0, "count should be non-zero");
423 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/true);
424 Copy::arrayof_conjoint_oops(src, dest, count);
425 gen_arraycopy_barrier((oop *) dest, count);
426 JRT_END
427
428 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) {
429 #define RETURN_STUB(xxx_fill) { \
430 name = #xxx_fill; \
431 return StubRoutines::xxx_fill(); }
432
433 switch (t) {
434 case T_BYTE:
435 case T_BOOLEAN:
436 if (!aligned) RETURN_STUB(jbyte_fill);
437 RETURN_STUB(arrayof_jbyte_fill);
438 case T_CHAR:
439 case T_SHORT:
440 if (!aligned) RETURN_STUB(jshort_fill);
441 RETURN_STUB(arrayof_jshort_fill);
442 case T_INT:
443 case T_FLOAT:
444 if (!aligned) RETURN_STUB(jint_fill);
445 RETURN_STUB(arrayof_jint_fill);
446 case T_DOUBLE:
447 case T_LONG:
448 case T_ARRAY:
449 case T_OBJECT:
450 case T_NARROWOOP:
451 case T_NARROWKLASS:
452 case T_ADDRESS:
453 // Currently unsupported
454 return NULL;
455
456 default:
457 ShouldNotReachHere();
458 return NULL;
459 }
460
461 #undef RETURN_STUB
462 }
463
464 // constants for computing the copy function
465 enum {
466 COPYFUNC_UNALIGNED = 0,
467 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize
468 COPYFUNC_CONJOINT = 0,
469 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend
470 };
471
472 // Note: The condition "disjoint" applies also for overlapping copies
473 // where an descending copy is permitted (i.e., dest_offset <= src_offset).
474 address
475 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) {
476 int selector =
477 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) +
478 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT);
479
480 #define RETURN_STUB(xxx_arraycopy) { \
481 name = #xxx_arraycopy; \
482 return StubRoutines::xxx_arraycopy(); }
483
484 #define RETURN_STUB_PARM(xxx_arraycopy, parm) { \
485 name = #xxx_arraycopy; \
486 return StubRoutines::xxx_arraycopy(parm); }
487
488 switch (t) {
489 case T_BYTE:
490 case T_BOOLEAN:
491 switch (selector) {
492 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy);
493 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy);
494 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy);
495 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy);
496 }
497 case T_CHAR:
498 case T_SHORT:
499 switch (selector) {
500 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy);
501 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy);
502 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy);
503 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy);
504 }
505 case T_INT:
506 case T_FLOAT:
507 switch (selector) {
508 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy);
509 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy);
510 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy);
511 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy);
512 }
513 case T_DOUBLE:
514 case T_LONG:
515 switch (selector) {
516 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy);
517 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy);
518 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy);
519 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy);
520 }
521 case T_ARRAY:
522 case T_OBJECT:
523 switch (selector) {
524 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized);
525 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized);
526 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized);
527 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized);
528 }
529 default:
530 ShouldNotReachHere();
531 return NULL;
532 }
533
534 #undef RETURN_STUB
535 #undef RETURN_STUB_PARM
536 }