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