Mercurial > jdk8-mips64-public > hotspot / file revision
src/share/vm/runtime/stubRoutines.cpp@ec173c8f3739
src/share/vm/runtime/stubRoutines.cpp
Thu, 11 Jul 2013 01:11:52 -0700
- author
- roland
- date
- Thu, 11 Jul 2013 01:11:52 -0700
- changeset 5385
- ec173c8f3739
- parent 5353
- b800986664f4
- child 5400
- 980532a806a5
- permissions
- -rw-r--r--
Merge
1 /*
2 * Copyright (c) 1997, 2013, 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 */
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
39 // Implementation of StubRoutines - for a description
40 // of how to extend it, see the header file.
42 // Class Variables
44 BufferBlob* StubRoutines::_code1 = NULL;
45 BufferBlob* StubRoutines::_code2 = NULL;
47 address StubRoutines::_call_stub_return_address = NULL;
48 address StubRoutines::_call_stub_entry = NULL;
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;
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 };
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);
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);
108 address StubRoutines::_zero_aligned_words = CAST_FROM_FN_PTR(address, Copy::zero_to_words);
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;
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;
123 address StubRoutines::_aescrypt_encryptBlock = NULL;
124 address StubRoutines::_aescrypt_decryptBlock = NULL;
125 address StubRoutines::_cipherBlockChaining_encryptAESCrypt = NULL;
126 address StubRoutines::_cipherBlockChaining_decryptAESCrypt = NULL;
128 address StubRoutines::_updateBytesCRC32 = NULL;
129 address StubRoutines::_crc_table_adr = NULL;
131 double (* StubRoutines::_intrinsic_log )(double) = NULL;
132 double (* StubRoutines::_intrinsic_log10 )(double) = NULL;
133 double (* StubRoutines::_intrinsic_exp )(double) = NULL;
134 double (* StubRoutines::_intrinsic_pow )(double, double) = NULL;
135 double (* StubRoutines::_intrinsic_sin )(double) = NULL;
136 double (* StubRoutines::_intrinsic_cos )(double) = NULL;
137 double (* StubRoutines::_intrinsic_tan )(double) = NULL;
139 // Initialization
140 //
141 // Note: to break cycle with universe initialization, stubs are generated in two phases.
142 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry).
143 // The second phase includes all other stubs (which may depend on universe being initialized.)
145 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators
147 void StubRoutines::initialize1() {
148 if (_code1 == NULL) {
149 ResourceMark rm;
150 TraceTime timer("StubRoutines generation 1", TraceStartupTime);
151 _code1 = BufferBlob::create("StubRoutines (1)", code_size1);
152 if (_code1 == NULL) {
153 vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)");
154 }
155 CodeBuffer buffer(_code1);
156 StubGenerator_generate(&buffer, false);
157 }
158 }
161 #ifdef ASSERT
162 typedef void (*arraycopy_fn)(address src, address dst, int count);
164 // simple tests of generated arraycopy functions
165 static void test_arraycopy_func(address func, int alignment) {
166 int v = 0xcc;
167 int v2 = 0x11;
168 jlong lbuffer[8];
169 jlong lbuffer2[8];
170 address fbuffer = (address) lbuffer;
171 address fbuffer2 = (address) lbuffer2;
172 unsigned int i;
173 for (i = 0; i < sizeof(lbuffer); i++) {
174 fbuffer[i] = v; fbuffer2[i] = v2;
175 }
176 // C++ does not guarantee jlong[] array alignment to 8 bytes.
177 // Use middle of array to check that memory before it is not modified.
178 address buffer = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong);
179 address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong);
180 // do an aligned copy
181 ((arraycopy_fn)func)(buffer, buffer2, 0);
182 for (i = 0; i < sizeof(lbuffer); i++) {
183 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
184 }
185 // adjust destination alignment
186 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0);
187 for (i = 0; i < sizeof(lbuffer); i++) {
188 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
189 }
190 // adjust source alignment
191 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0);
192 for (i = 0; i < sizeof(lbuffer); i++) {
193 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
194 }
195 }
196 #endif
199 void StubRoutines::initialize2() {
200 if (_code2 == NULL) {
201 ResourceMark rm;
202 TraceTime timer("StubRoutines generation 2", TraceStartupTime);
203 _code2 = BufferBlob::create("StubRoutines (2)", code_size2);
204 if (_code2 == NULL) {
205 vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)");
206 }
207 CodeBuffer buffer(_code2);
208 StubGenerator_generate(&buffer, true);
209 }
211 #ifdef ASSERT
213 #define TEST_ARRAYCOPY(type) \
214 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \
215 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \
216 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \
217 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord))
219 // Make sure all the arraycopy stubs properly handle zero count
220 TEST_ARRAYCOPY(jbyte);
221 TEST_ARRAYCOPY(jshort);
222 TEST_ARRAYCOPY(jint);
223 TEST_ARRAYCOPY(jlong);
225 #undef TEST_ARRAYCOPY
227 #define TEST_FILL(type) \
228 if (_##type##_fill != NULL) { \
229 union { \
230 double d; \
231 type body[96]; \
232 } s; \
233 \
234 int v = 32; \
235 for (int offset = -2; offset <= 2; offset++) { \
236 for (int i = 0; i < 96; i++) { \
237 s.body[i] = 1; \
238 } \
239 type* start = s.body + 8 + offset; \
240 for (int aligned = 0; aligned < 2; aligned++) { \
241 if (aligned) { \
242 if (((intptr_t)start) % HeapWordSize == 0) { \
243 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \
244 } else { \
245 continue; \
246 } \
247 } else { \
248 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \
249 } \
250 for (int i = 0; i < 96; i++) { \
251 if (i < (8 + offset) || i >= (88 + offset)) { \
252 assert(s.body[i] == 1, "what?"); \
253 } else { \
254 assert(s.body[i] == 32, "what?"); \
255 } \
256 } \
257 } \
258 } \
259 } \
261 TEST_FILL(jbyte);
262 TEST_FILL(jshort);
263 TEST_FILL(jint);
265 #undef TEST_FILL
267 #define TEST_COPYRTN(type) \
268 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \
269 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type)))
271 // Make sure all the copy runtime routines properly handle zero count
272 TEST_COPYRTN(jbyte);
273 TEST_COPYRTN(jshort);
274 TEST_COPYRTN(jint);
275 TEST_COPYRTN(jlong);
277 #undef TEST_COPYRTN
279 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord));
280 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord));
281 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord));
282 // Aligned to BytesPerLong
283 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong));
284 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong));
286 #endif
287 }
290 void stubRoutines_init1() { StubRoutines::initialize1(); }
291 void stubRoutines_init2() { StubRoutines::initialize2(); }
293 //
294 // Default versions of arraycopy functions
295 //
297 static void gen_arraycopy_barrier_pre(oop* dest, size_t count, bool dest_uninitialized) {
298 assert(count != 0, "count should be non-zero");
299 assert(count <= (size_t)max_intx, "count too large");
300 BarrierSet* bs = Universe::heap()->barrier_set();
301 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt");
302 bs->write_ref_array_pre(dest, (int)count, dest_uninitialized);
303 }
305 static void gen_arraycopy_barrier(oop* dest, size_t count) {
306 assert(count != 0, "count should be non-zero");
307 BarrierSet* bs = Universe::heap()->barrier_set();
308 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
309 bs->write_ref_array((HeapWord*)dest, count);
310 }
312 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
313 #ifndef PRODUCT
314 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
315 #endif // !PRODUCT
316 Copy::conjoint_jbytes_atomic(src, dest, count);
317 JRT_END
319 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
320 #ifndef PRODUCT
321 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
322 #endif // !PRODUCT
323 Copy::conjoint_jshorts_atomic(src, dest, count);
324 JRT_END
326 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
327 #ifndef PRODUCT
328 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
329 #endif // !PRODUCT
330 Copy::conjoint_jints_atomic(src, dest, count);
331 JRT_END
333 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
334 #ifndef PRODUCT
335 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy
336 #endif // !PRODUCT
337 Copy::conjoint_jlongs_atomic(src, dest, count);
338 JRT_END
340 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
341 #ifndef PRODUCT
342 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
343 #endif // !PRODUCT
344 assert(count != 0, "count should be non-zero");
345 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false);
346 Copy::conjoint_oops_atomic(src, dest, count);
347 gen_arraycopy_barrier(dest, count);
348 JRT_END
350 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count))
351 #ifndef PRODUCT
352 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
353 #endif // !PRODUCT
354 assert(count != 0, "count should be non-zero");
355 gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true);
356 Copy::conjoint_oops_atomic(src, dest, count);
357 gen_arraycopy_barrier(dest, count);
358 JRT_END
360 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
361 #ifndef PRODUCT
362 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
363 #endif // !PRODUCT
364 Copy::arrayof_conjoint_jbytes(src, dest, count);
365 JRT_END
367 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
368 #ifndef PRODUCT
369 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
370 #endif // !PRODUCT
371 Copy::arrayof_conjoint_jshorts(src, dest, count);
372 JRT_END
374 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count))
375 #ifndef PRODUCT
376 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
377 #endif // !PRODUCT
378 Copy::arrayof_conjoint_jints(src, dest, count);
379 JRT_END
381 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
382 #ifndef PRODUCT
383 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy
384 #endif // !PRODUCT
385 Copy::arrayof_conjoint_jlongs(src, dest, count);
386 JRT_END
388 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count))
389 #ifndef PRODUCT
390 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
391 #endif // !PRODUCT
392 assert(count != 0, "count should be non-zero");
393 gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/false);
394 Copy::arrayof_conjoint_oops(src, dest, count);
395 gen_arraycopy_barrier((oop *) dest, count);
396 JRT_END
398 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* 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((oop *) dest, count, /*dest_uninitialized*/true);
404 Copy::arrayof_conjoint_oops(src, dest, count);
405 gen_arraycopy_barrier((oop *) dest, count);
406 JRT_END
408 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) {
409 #define RETURN_STUB(xxx_fill) { \
410 name = #xxx_fill; \
411 return StubRoutines::xxx_fill(); }
413 switch (t) {
414 case T_BYTE:
415 case T_BOOLEAN:
416 if (!aligned) RETURN_STUB(jbyte_fill);
417 RETURN_STUB(arrayof_jbyte_fill);
418 case T_CHAR:
419 case T_SHORT:
420 if (!aligned) RETURN_STUB(jshort_fill);
421 RETURN_STUB(arrayof_jshort_fill);
422 case T_INT:
423 case T_FLOAT:
424 if (!aligned) RETURN_STUB(jint_fill);
425 RETURN_STUB(arrayof_jint_fill);
426 case T_DOUBLE:
427 case T_LONG:
428 case T_ARRAY:
429 case T_OBJECT:
430 case T_NARROWOOP:
431 case T_NARROWKLASS:
432 case T_ADDRESS:
433 // Currently unsupported
434 return NULL;
436 default:
437 ShouldNotReachHere();
438 return NULL;
439 }
441 #undef RETURN_STUB
442 }
444 // constants for computing the copy function
445 enum {
446 COPYFUNC_UNALIGNED = 0,
447 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize
448 COPYFUNC_CONJOINT = 0,
449 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend
450 };
452 // Note: The condition "disjoint" applies also for overlapping copies
453 // where an descending copy is permitted (i.e., dest_offset <= src_offset).
454 address
455 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) {
456 int selector =
457 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) +
458 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT);
460 #define RETURN_STUB(xxx_arraycopy) { \
461 name = #xxx_arraycopy; \
462 return StubRoutines::xxx_arraycopy(); }
464 #define RETURN_STUB_PARM(xxx_arraycopy, parm) { \
465 name = #xxx_arraycopy; \
466 return StubRoutines::xxx_arraycopy(parm); }
468 switch (t) {
469 case T_BYTE:
470 case T_BOOLEAN:
471 switch (selector) {
472 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy);
473 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy);
474 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy);
475 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy);
476 }
477 case T_CHAR:
478 case T_SHORT:
479 switch (selector) {
480 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy);
481 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy);
482 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy);
483 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy);
484 }
485 case T_INT:
486 case T_FLOAT:
487 switch (selector) {
488 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy);
489 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy);
490 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy);
491 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy);
492 }
493 case T_DOUBLE:
494 case T_LONG:
495 switch (selector) {
496 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy);
497 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy);
498 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy);
499 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy);
500 }
501 case T_ARRAY:
502 case T_OBJECT:
503 switch (selector) {
504 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized);
505 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized);
506 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized);
507 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized);
508 }
509 default:
510 ShouldNotReachHere();
511 return NULL;
512 }
514 #undef RETURN_STUB
515 #undef RETURN_STUB_PARM
516 }
