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