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