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