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