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