1 /*
2 * Copyright (c) 1997, 2020, 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 "asm/macroAssembler.inline.hpp"
28 #include "memory/resourceArea.hpp"
29 #include "oops/access.inline.hpp"
30 #include "oops/oop.inline.hpp"
31 #include "runtime/interfaceSupport.inline.hpp"
32 #include "runtime/timerTrace.hpp"
33 #include "runtime/sharedRuntime.hpp"
34 #include "runtime/stubRoutines.hpp"
35 #include "utilities/align.hpp"
36 #include "utilities/copy.hpp"
37 #include "utilities/vmError.hpp"
38 #ifdef COMPILER2
39 #include "opto/runtime.hpp"
40 #endif
41
42 UnsafeCopyMemory* UnsafeCopyMemory::_table = NULL;
43 int UnsafeCopyMemory::_table_length = 0;
44 int UnsafeCopyMemory::_table_max_length = 0;
45 address UnsafeCopyMemory::_common_exit_stub_pc = NULL;
46
47 // Implementation of StubRoutines - for a description
48 // of how to extend it, see the header file.
49
50 // Class Variables
51
52 BufferBlob* StubRoutines::_code1 = NULL;
53 BufferBlob* StubRoutines::_code2 = NULL;
54
55 address StubRoutines::_call_stub_return_address = NULL;
56 address StubRoutines::_call_stub_entry = NULL;
57
58 address StubRoutines::_catch_exception_entry = NULL;
59 address StubRoutines::_forward_exception_entry = NULL;
60 address StubRoutines::_throw_AbstractMethodError_entry = NULL;
61 address StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL;
62 address StubRoutines::_throw_NullPointerException_at_call_entry = NULL;
63 address StubRoutines::_throw_StackOverflowError_entry = NULL;
64 address StubRoutines::_throw_delayed_StackOverflowError_entry = NULL;
65 jint StubRoutines::_verify_oop_count = 0;
66 address StubRoutines::_verify_oop_subroutine_entry = NULL;
67 address StubRoutines::_atomic_xchg_entry = NULL;
68 address StubRoutines::_atomic_xchg_long_entry = NULL;
69 address StubRoutines::_atomic_store_entry = NULL;
70 address StubRoutines::_atomic_cmpxchg_entry = NULL;
71 address StubRoutines::_atomic_cmpxchg_byte_entry = NULL;
72 address StubRoutines::_atomic_cmpxchg_long_entry = NULL;
73 address StubRoutines::_atomic_add_entry = NULL;
74 address StubRoutines::_atomic_add_long_entry = NULL;
75 address StubRoutines::_fence_entry = NULL;
76 address StubRoutines::_d2i_wrapper = NULL;
77 address StubRoutines::_d2l_wrapper = NULL;
78
79 jint StubRoutines::_fpu_cntrl_wrd_std = 0;
80 jint StubRoutines::_fpu_cntrl_wrd_24 = 0;
81 jint StubRoutines::_fpu_cntrl_wrd_trunc = 0;
82 jint StubRoutines::_mxcsr_std = 0;
83 jint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 };
84 jint StubRoutines::_fpu_subnormal_bias2[3] = { 0, 0, 0 };
85
86 // Compiled code entry points default values
87 // The default functions don't have separate disjoint versions.
88 address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
89 address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
90 address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
91 address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
92 address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
93 address StubRoutines::_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
94 address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
95 address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
96 address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
97 address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
98 address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
99 address StubRoutines::_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
100
101 address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
102 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
103 address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
104 address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
105 address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
106 address StubRoutines::_arrayof_oop_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
107 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
108 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
109 address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
110 address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
111 address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
112 address StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
113
114 address StubRoutines::_zero_aligned_words = CAST_FROM_FN_PTR(address, Copy::zero_to_words);
115
116 address StubRoutines::_data_cache_writeback = NULL;
117 address StubRoutines::_data_cache_writeback_sync = NULL;
118
119 address StubRoutines::_checkcast_arraycopy = NULL;
120 address StubRoutines::_checkcast_arraycopy_uninit = NULL;
121 address StubRoutines::_unsafe_arraycopy = NULL;
122 address StubRoutines::_generic_arraycopy = NULL;
123
124 address StubRoutines::_jbyte_fill;
125 address StubRoutines::_jshort_fill;
126 address StubRoutines::_jint_fill;
127 address StubRoutines::_arrayof_jbyte_fill;
128 address StubRoutines::_arrayof_jshort_fill;
129 address StubRoutines::_arrayof_jint_fill;
130
131 address StubRoutines::_aescrypt_encryptBlock = NULL;
132 address StubRoutines::_aescrypt_decryptBlock = NULL;
133 address StubRoutines::_cipherBlockChaining_encryptAESCrypt = NULL;
134 address StubRoutines::_cipherBlockChaining_decryptAESCrypt = NULL;
135 address StubRoutines::_electronicCodeBook_encryptAESCrypt = NULL;
136 address StubRoutines::_electronicCodeBook_decryptAESCrypt = NULL;
137 address StubRoutines::_counterMode_AESCrypt = NULL;
138 address StubRoutines::_ghash_processBlocks = NULL;
139 address StubRoutines::_base64_encodeBlock = NULL;
140
141 address StubRoutines::_md5_implCompress = NULL;
142 address StubRoutines::_md5_implCompressMB = NULL;
143 address StubRoutines::_sha1_implCompress = NULL;
144 address StubRoutines::_sha1_implCompressMB = NULL;
145 address StubRoutines::_sha256_implCompress = NULL;
146 address StubRoutines::_sha256_implCompressMB = NULL;
147 address StubRoutines::_sha512_implCompress = NULL;
148 address StubRoutines::_sha512_implCompressMB = NULL;
149
150 address StubRoutines::_updateBytesCRC32 = NULL;
151 address StubRoutines::_crc_table_adr = NULL;
152
153 address StubRoutines::_crc32c_table_addr = NULL;
154 address StubRoutines::_updateBytesCRC32C = NULL;
155 address StubRoutines::_updateBytesAdler32 = NULL;
156
157 address StubRoutines::_multiplyToLen = NULL;
158 address StubRoutines::_squareToLen = NULL;
159 address StubRoutines::_mulAdd = NULL;
160 address StubRoutines::_montgomeryMultiply = NULL;
161 address StubRoutines::_montgomerySquare = NULL;
162 address StubRoutines::_bigIntegerRightShiftWorker = NULL;
163 address StubRoutines::_bigIntegerLeftShiftWorker = NULL;
164
165 address StubRoutines::_vectorizedMismatch = NULL;
166
167 address StubRoutines::_dexp = NULL;
168 address StubRoutines::_dlog = NULL;
169 address StubRoutines::_dlog10 = NULL;
170 address StubRoutines::_dpow = NULL;
171 address StubRoutines::_dsin = NULL;
172 address StubRoutines::_dcos = NULL;
173 address StubRoutines::_dlibm_sin_cos_huge = NULL;
174 address StubRoutines::_dlibm_reduce_pi04l = NULL;
175 address StubRoutines::_dlibm_tan_cot_huge = NULL;
176 address StubRoutines::_dtan = NULL;
177
178 address StubRoutines::_safefetch32_entry = NULL;
179 address StubRoutines::_safefetch32_fault_pc = NULL;
180 address StubRoutines::_safefetch32_continuation_pc = NULL;
181 address StubRoutines::_safefetchN_entry = NULL;
182 address StubRoutines::_safefetchN_fault_pc = NULL;
183 address StubRoutines::_safefetchN_continuation_pc = NULL;
184
185 // Initialization
186 //
187 // Note: to break cycle with universe initialization, stubs are generated in two phases.
188 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry).
189 // The second phase includes all other stubs (which may depend on universe being initialized.)
190
191 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators
192
193 void UnsafeCopyMemory::create_table(int max_size) {
194 UnsafeCopyMemory::_table = new UnsafeCopyMemory[max_size];
195 UnsafeCopyMemory::_table_max_length = max_size;
196 }
197
198 bool UnsafeCopyMemory::contains_pc(address pc) {
199 for (int i = 0; i < UnsafeCopyMemory::_table_length; i++) {
200 UnsafeCopyMemory* entry = &UnsafeCopyMemory::_table[i];
201 if (pc >= entry->start_pc() && pc < entry->end_pc()) {
202 return true;
203 }
204 }
205 return false;
206 }
207
208 address UnsafeCopyMemory::page_error_continue_pc(address pc) {
209 for (int i = 0; i < UnsafeCopyMemory::_table_length; i++) {
210 UnsafeCopyMemory* entry = &UnsafeCopyMemory::_table[i];
211 if (pc >= entry->start_pc() && pc < entry->end_pc()) {
212 return entry->error_exit_pc();
213 }
214 }
215 return NULL;
216 }
217
218 void StubRoutines::initialize1() {
219 if (_code1 == NULL) {
220 ResourceMark rm;
221 TraceTime timer("StubRoutines generation 1", TRACETIME_LOG(Info, startuptime));
222 _code1 = BufferBlob::create("StubRoutines (1)", code_size1);
223 if (_code1 == NULL) {
224 vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)");
225 }
226 CodeBuffer buffer(_code1);
227 StubGenerator_generate(&buffer, false);
228 // When new stubs added we need to make sure there is some space left
229 // to catch situation when we should increase size again.
230 assert(code_size1 == 0 || buffer.insts_remaining() > 200, "increase code_size1");
231 }
232 }
233
234
235 #ifdef ASSERT
236 typedef void (*arraycopy_fn)(address src, address dst, int count);
237
238 // simple tests of generated arraycopy functions
239 static void test_arraycopy_func(address func, int alignment) {
240 int v = 0xcc;
241 int v2 = 0x11;
242 jlong lbuffer[8];
243 jlong lbuffer2[8];
244 address fbuffer = (address) lbuffer;
245 address fbuffer2 = (address) lbuffer2;
246 unsigned int i;
247 for (i = 0; i < sizeof(lbuffer); i++) {
248 fbuffer[i] = v; fbuffer2[i] = v2;
249 }
250 // C++ does not guarantee jlong[] array alignment to 8 bytes.
251 // Use middle of array to check that memory before it is not modified.
252 address buffer = align_up((address)&lbuffer[4], BytesPerLong);
253 address buffer2 = align_up((address)&lbuffer2[4], BytesPerLong);
254 // do an aligned copy
255 ((arraycopy_fn)func)(buffer, buffer2, 0);
256 for (i = 0; i < sizeof(lbuffer); i++) {
257 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
258 }
259 // adjust destination alignment
260 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0);
261 for (i = 0; i < sizeof(lbuffer); i++) {
262 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
263 }
264 // adjust source alignment
265 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0);
266 for (i = 0; i < sizeof(lbuffer); i++) {
267 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
268 }
269 }
270
271 // simple test for SafeFetch32
272 static void test_safefetch32() {
273 if (CanUseSafeFetch32()) {
274 int dummy = 17;
275 int* const p_invalid = (int*) VMError::get_segfault_address();
276 int* const p_valid = &dummy;
277 int result_invalid = SafeFetch32(p_invalid, 0xABC);
278 assert(result_invalid == 0xABC, "SafeFetch32 error");
279 int result_valid = SafeFetch32(p_valid, 0xABC);
280 assert(result_valid == 17, "SafeFetch32 error");
281 }
282 }
283
284 // simple test for SafeFetchN
285 static void test_safefetchN() {
286 if (CanUseSafeFetchN()) {
287 #ifdef _LP64
288 const intptr_t v1 = UCONST64(0xABCD00000000ABCD);
289 const intptr_t v2 = UCONST64(0xDEFD00000000DEFD);
290 #else
291 const intptr_t v1 = 0xABCDABCD;
292 const intptr_t v2 = 0xDEFDDEFD;
293 #endif
294 intptr_t dummy = v1;
295 intptr_t* const p_invalid = (intptr_t*) VMError::get_segfault_address();
296 intptr_t* const p_valid = &dummy;
297 intptr_t result_invalid = SafeFetchN(p_invalid, v2);
298 assert(result_invalid == v2, "SafeFetchN error");
299 intptr_t result_valid = SafeFetchN(p_valid, v2);
300 assert(result_valid == v1, "SafeFetchN error");
301 }
302 }
303 #endif
304
305 void StubRoutines::initialize2() {
306 if (_code2 == NULL) {
307 ResourceMark rm;
308 TraceTime timer("StubRoutines generation 2", TRACETIME_LOG(Info, startuptime));
309 _code2 = BufferBlob::create("StubRoutines (2)", code_size2);
310 if (_code2 == NULL) {
311 vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)");
312 }
313 CodeBuffer buffer(_code2);
314 StubGenerator_generate(&buffer, true);
315 // When new stubs added we need to make sure there is some space left
316 // to catch situation when we should increase size again.
317 assert(code_size2 == 0 || buffer.insts_remaining() > 200, "increase code_size2");
318 }
319
320 #ifdef ASSERT
321
322 #define TEST_ARRAYCOPY(type) \
323 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \
324 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \
325 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \
326 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord))
327
328 // Make sure all the arraycopy stubs properly handle zero count
329 TEST_ARRAYCOPY(jbyte);
330 TEST_ARRAYCOPY(jshort);
331 TEST_ARRAYCOPY(jint);
332 TEST_ARRAYCOPY(jlong);
333
334 #undef TEST_ARRAYCOPY
335
336 #define TEST_FILL(type) \
337 if (_##type##_fill != NULL) { \
338 union { \
339 double d; \
340 type body[96]; \
341 } s; \
342 \
343 int v = 32; \
344 for (int offset = -2; offset <= 2; offset++) { \
345 for (int i = 0; i < 96; i++) { \
346 s.body[i] = 1; \
347 } \
348 type* start = s.body + 8 + offset; \
349 for (int aligned = 0; aligned < 2; aligned++) { \
350 if (aligned) { \
351 if (((intptr_t)start) % HeapWordSize == 0) { \
352 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \
353 } else { \
354 continue; \
355 } \
356 } else { \
357 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \
358 } \
359 for (int i = 0; i < 96; i++) { \
360 if (i < (8 + offset) || i >= (88 + offset)) { \
361 assert(s.body[i] == 1, "what?"); \
362 } else { \
363 assert(s.body[i] == 32, "what?"); \
364 } \
365 } \
366 } \
367 } \
368 } \
369
370 TEST_FILL(jbyte);
371 TEST_FILL(jshort);
372 TEST_FILL(jint);
373
374 #undef TEST_FILL
375
376 #define TEST_COPYRTN(type) \
377 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \
378 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type)))
379
380 // Make sure all the copy runtime routines properly handle zero count
381 TEST_COPYRTN(jbyte);
382 TEST_COPYRTN(jshort);
383 TEST_COPYRTN(jint);
384 TEST_COPYRTN(jlong);
385
386 #undef TEST_COPYRTN
387
388 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord));
389 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord));
390 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord));
391 // Aligned to BytesPerLong
392 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong));
393 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong));
394
395 // test safefetch routines
396 // Not on Windows 32bit until 8074860 is fixed
397 #if ! (defined(_WIN32) && defined(_M_IX86))
398 test_safefetch32();
399 test_safefetchN();
400 #endif
401
402 #endif
403 }
404
405
406 void stubRoutines_init1() { StubRoutines::initialize1(); }
407 void stubRoutines_init2() { StubRoutines::initialize2(); }
408
409 //
410 // Default versions of arraycopy functions
411 //
412
413 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
414 #ifndef PRODUCT
415 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
416 #endif // !PRODUCT
417 Copy::conjoint_jbytes_atomic(src, dest, count);
418 JRT_END
419
420 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
421 #ifndef PRODUCT
422 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
423 #endif // !PRODUCT
424 Copy::conjoint_jshorts_atomic(src, dest, count);
425 JRT_END
426
427 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
428 #ifndef PRODUCT
429 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
430 #endif // !PRODUCT
431 Copy::conjoint_jints_atomic(src, dest, count);
432 JRT_END
433
434 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
435 #ifndef PRODUCT
436 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy
437 #endif // !PRODUCT
438 Copy::conjoint_jlongs_atomic(src, dest, count);
439 JRT_END
440
441 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
442 #ifndef PRODUCT
443 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
444 #endif // !PRODUCT
445 assert(count != 0, "count should be non-zero");
446 ArrayAccess<>::oop_arraycopy_raw((HeapWord*)src, (HeapWord*)dest, count);
447 JRT_END
448
449 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count))
450 #ifndef PRODUCT
451 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
452 #endif // !PRODUCT
453 assert(count != 0, "count should be non-zero");
454 ArrayAccess<IS_DEST_UNINITIALIZED>::oop_arraycopy_raw((HeapWord*)src, (HeapWord*)dest, count);
455 JRT_END
456
457 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
458 #ifndef PRODUCT
459 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
460 #endif // !PRODUCT
461 Copy::arrayof_conjoint_jbytes(src, dest, count);
462 JRT_END
463
464 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
465 #ifndef PRODUCT
466 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
467 #endif // !PRODUCT
468 Copy::arrayof_conjoint_jshorts(src, dest, count);
469 JRT_END
470
471 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count))
472 #ifndef PRODUCT
473 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
474 #endif // !PRODUCT
475 Copy::arrayof_conjoint_jints(src, dest, count);
476 JRT_END
477
478 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
479 #ifndef PRODUCT
480 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy
481 #endif // !PRODUCT
482 Copy::arrayof_conjoint_jlongs(src, dest, count);
483 JRT_END
484
485 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count))
486 #ifndef PRODUCT
487 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
488 #endif // !PRODUCT
489 assert(count != 0, "count should be non-zero");
490 ArrayAccess<ARRAYCOPY_ARRAYOF>::oop_arraycopy_raw(src, dest, count);
491 JRT_END
492
493 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count))
494 #ifndef PRODUCT
495 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
496 #endif // !PRODUCT
497 assert(count != 0, "count should be non-zero");
498 ArrayAccess<ARRAYCOPY_ARRAYOF | IS_DEST_UNINITIALIZED>::oop_arraycopy_raw(src, dest, count);
499 JRT_END
500
501 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) {
502 #define RETURN_STUB(xxx_fill) { \
503 name = #xxx_fill; \
504 return StubRoutines::xxx_fill(); }
505
506 switch (t) {
507 case T_BYTE:
508 case T_BOOLEAN:
509 if (!aligned) RETURN_STUB(jbyte_fill);
510 RETURN_STUB(arrayof_jbyte_fill);
511 case T_CHAR:
512 case T_SHORT:
513 if (!aligned) RETURN_STUB(jshort_fill);
514 RETURN_STUB(arrayof_jshort_fill);
515 case T_INT:
516 case T_FLOAT:
517 if (!aligned) RETURN_STUB(jint_fill);
518 RETURN_STUB(arrayof_jint_fill);
519 case T_DOUBLE:
520 case T_LONG:
521 case T_ARRAY:
522 case T_OBJECT:
523 case T_NARROWOOP:
524 case T_NARROWKLASS:
525 case T_ADDRESS:
526 // Currently unsupported
527 return NULL;
528
529 default:
530 ShouldNotReachHere();
531 return NULL;
532 }
533
534 #undef RETURN_STUB
535 }
536
537 // constants for computing the copy function
538 enum {
539 COPYFUNC_UNALIGNED = 0,
540 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize
541 COPYFUNC_CONJOINT = 0,
542 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend
543 };
544
545 // Note: The condition "disjoint" applies also for overlapping copies
546 // where an descending copy is permitted (i.e., dest_offset <= src_offset).
547 address
548 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) {
549 int selector =
550 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) +
551 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT);
552
553 #define RETURN_STUB(xxx_arraycopy) { \
554 name = #xxx_arraycopy; \
555 return StubRoutines::xxx_arraycopy(); }
556
557 #define RETURN_STUB_PARM(xxx_arraycopy, parm) { \
558 name = #xxx_arraycopy; \
559 return StubRoutines::xxx_arraycopy(parm); }
560
561 switch (t) {
562 case T_BYTE:
563 case T_BOOLEAN:
564 switch (selector) {
565 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy);
566 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy);
567 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy);
568 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy);
569 }
570 case T_CHAR:
571 case T_SHORT:
572 switch (selector) {
573 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy);
574 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy);
575 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy);
576 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy);
577 }
578 case T_INT:
579 case T_FLOAT:
580 switch (selector) {
581 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy);
582 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy);
583 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy);
584 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy);
585 }
586 case T_DOUBLE:
587 case T_LONG:
588 switch (selector) {
589 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy);
590 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy);
591 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy);
592 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy);
593 }
594 case T_ARRAY:
595 case T_OBJECT:
596 switch (selector) {
597 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized);
598 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized);
599 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized);
600 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized);
601 }
602 default:
603 ShouldNotReachHere();
604 return NULL;
605 }
606
607 #undef RETURN_STUB
608 #undef RETURN_STUB_PARM
609 }
610
611 UnsafeCopyMemoryMark::UnsafeCopyMemoryMark(StubCodeGenerator* cgen, bool add_entry, bool continue_at_scope_end, address error_exit_pc) {
612 _cgen = cgen;
613 _ucm_entry = NULL;
614 if (add_entry) {
615 address err_exit_pc = NULL;
616 if (!continue_at_scope_end) {
617 err_exit_pc = error_exit_pc != NULL ? error_exit_pc : UnsafeCopyMemory::common_exit_stub_pc();
618 }
619 assert(err_exit_pc != NULL || continue_at_scope_end, "error exit not set");
620 _ucm_entry = UnsafeCopyMemory::add_to_table(_cgen->assembler()->pc(), NULL, err_exit_pc);
621 }
622 }
623
624 UnsafeCopyMemoryMark::~UnsafeCopyMemoryMark() {
625 if (_ucm_entry != NULL) {
626 _ucm_entry->set_end_pc(_cgen->assembler()->pc());
627 if (_ucm_entry->error_exit_pc() == NULL) {
628 _ucm_entry->set_error_exit_pc(_cgen->assembler()->pc());
629 }
630 }
631 }