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