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