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