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