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