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