       1 /*
       2  * Copyright (c) 1997, 2014, 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 "memory/resourceArea.hpp"
      28 #include "oops/oop.inline.hpp"
      29 #include "runtime/interfaceSupport.hpp"
      30 #include "runtime/sharedRuntime.hpp"
      31 #include "runtime/stubRoutines.hpp"
      32 #include "runtime/timer.hpp"
      33 #include "utilities/copy.hpp"
      34 #ifdef COMPILER2
      35 #include "opto/runtime.hpp"
      36 #endif
      37
      38
      39 // Implementation of StubRoutines - for a description
      40 // of how to extend it, see the header file.
      41
      42 // Class Variables
      43
      44 BufferBlob* StubRoutines::_code1                                = NULL;
      45 BufferBlob* StubRoutines::_code2                                = NULL;
      46
      47 address StubRoutines::_call_stub_return_address                 = NULL;
      48 address StubRoutines::_call_stub_entry                          = NULL;
      49
      50 address StubRoutines::_catch_exception_entry                    = NULL;
      51 address StubRoutines::_forward_exception_entry                  = NULL;
      52 address StubRoutines::_throw_AbstractMethodError_entry          = NULL;
      53 address StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL;
      54 address StubRoutines::_throw_NullPointerException_at_call_entry = NULL;
      55 address StubRoutines::_throw_StackOverflowError_entry           = NULL;
      56 address StubRoutines::_handler_for_unsafe_access_entry          = NULL;
      57 jint    StubRoutines::_verify_oop_count                         = 0;
      58 address StubRoutines::_verify_oop_subroutine_entry              = NULL;
      59 address StubRoutines::_atomic_xchg_entry                        = NULL;
      60 address StubRoutines::_atomic_xchg_ptr_entry                    = NULL;
      61 address StubRoutines::_atomic_store_entry                       = NULL;
      62 address StubRoutines::_atomic_store_ptr_entry                   = NULL;
      63 address StubRoutines::_atomic_cmpxchg_entry                     = NULL;
      64 address StubRoutines::_atomic_cmpxchg_ptr_entry                 = NULL;
      65 address StubRoutines::_atomic_cmpxchg_byte_entry                = NULL;
      66 address StubRoutines::_atomic_cmpxchg_long_entry                = NULL;
      67 address StubRoutines::_atomic_add_entry                         = NULL;
      68 address StubRoutines::_atomic_add_ptr_entry                     = NULL;
      69 address StubRoutines::_fence_entry                              = NULL;
      70 address StubRoutines::_d2i_wrapper                              = NULL;
      71 address StubRoutines::_d2l_wrapper                              = NULL;
      72
      73 jint    StubRoutines::_fpu_cntrl_wrd_std                        = 0;
      74 jint    StubRoutines::_fpu_cntrl_wrd_24                         = 0;
      75 jint    StubRoutines::_fpu_cntrl_wrd_64                         = 0;
      76 jint    StubRoutines::_fpu_cntrl_wrd_trunc                      = 0;
      77 jint    StubRoutines::_mxcsr_std                                = 0;
      78 jint    StubRoutines::_fpu_subnormal_bias1[3]                   = { 0, 0, 0 };
      79 jint    StubRoutines::_fpu_subnormal_bias2[3]                   = { 0, 0, 0 };
      80
      81 // Compiled code entry points default values
      82 // The default functions don't have separate disjoint versions.
      83 address StubRoutines::_jbyte_arraycopy          = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
      84 address StubRoutines::_jshort_arraycopy         = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
      85 address StubRoutines::_jint_arraycopy           = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
      86 address StubRoutines::_jlong_arraycopy          = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
      87 address StubRoutines::_oop_arraycopy            = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
      88 address StubRoutines::_oop_arraycopy_uninit     = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
      89 address StubRoutines::_jbyte_disjoint_arraycopy          = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
      90 address StubRoutines::_jshort_disjoint_arraycopy         = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
      91 address StubRoutines::_jint_disjoint_arraycopy           = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
      92 address StubRoutines::_jlong_disjoint_arraycopy          = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
      93 address StubRoutines::_oop_disjoint_arraycopy            = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
      94 address StubRoutines::_oop_disjoint_arraycopy_uninit     = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_uninit);
      95
      96 address StubRoutines::_arrayof_jbyte_arraycopy  = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
      97 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
      98 address StubRoutines::_arrayof_jint_arraycopy   = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
      99 address StubRoutines::_arrayof_jlong_arraycopy  = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
     100 address StubRoutines::_arrayof_oop_arraycopy    = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
     101 address StubRoutines::_arrayof_oop_arraycopy_uninit      = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
     102 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy  = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
     103 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
     104 address StubRoutines::_arrayof_jint_disjoint_arraycopy   = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
     105 address StubRoutines::_arrayof_jlong_disjoint_arraycopy  = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
     106 address StubRoutines::_arrayof_oop_disjoint_arraycopy    = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
     107 address StubRoutines::_arrayof_oop_disjoint_arraycopy_uninit  = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_uninit);
     108
     109 address StubRoutines::_zero_aligned_words = CAST_FROM_FN_PTR(address, Copy::zero_to_words);
     110
     111 address StubRoutines::_checkcast_arraycopy               = NULL;
     112 address StubRoutines::_checkcast_arraycopy_uninit        = NULL;
     113 address StubRoutines::_unsafe_arraycopy                  = NULL;
     114 address StubRoutines::_generic_arraycopy                 = NULL;
     115
     116
     117 address StubRoutines::_jbyte_fill;
     118 address StubRoutines::_jshort_fill;
     119 address StubRoutines::_jint_fill;
     120 address StubRoutines::_arrayof_jbyte_fill;
     121 address StubRoutines::_arrayof_jshort_fill;
     122 address StubRoutines::_arrayof_jint_fill;
     123
     124 address StubRoutines::_aescrypt_encryptBlock               = NULL;
     125 address StubRoutines::_aescrypt_decryptBlock               = NULL;
     126 address StubRoutines::_cipherBlockChaining_encryptAESCrypt = NULL;
     127 address StubRoutines::_cipherBlockChaining_decryptAESCrypt = NULL;
     128
     129 address StubRoutines::_sha1_implCompress     = NULL;
     130 address StubRoutines::_sha1_implCompressMB   = NULL;
     131 address StubRoutines::_sha256_implCompress   = NULL;
     132 address StubRoutines::_sha256_implCompressMB = NULL;
     133 address StubRoutines::_sha512_implCompress   = NULL;
     134 address StubRoutines::_sha512_implCompressMB = NULL;
     135
     136 address StubRoutines::_updateBytesCRC32 = NULL;
     137 address StubRoutines::_crc_table_adr = NULL;
     138
     139 address StubRoutines::_multiplyToLen = NULL;
     140
     141 double (* StubRoutines::_intrinsic_log   )(double) = NULL;
     142 double (* StubRoutines::_intrinsic_log10 )(double) = NULL;
     143 double (* StubRoutines::_intrinsic_exp   )(double) = NULL;
     144 double (* StubRoutines::_intrinsic_pow   )(double, double) = NULL;
     145 double (* StubRoutines::_intrinsic_sin   )(double) = NULL;
     146 double (* StubRoutines::_intrinsic_cos   )(double) = NULL;
     147 double (* StubRoutines::_intrinsic_tan   )(double) = NULL;
     148
     149 address StubRoutines::_safefetch32_entry                 = NULL;
     150 address StubRoutines::_safefetch32_fault_pc              = NULL;
     151 address StubRoutines::_safefetch32_continuation_pc       = NULL;
     152 address StubRoutines::_safefetchN_entry                  = NULL;
     153 address StubRoutines::_safefetchN_fault_pc               = NULL;
     154 address StubRoutines::_safefetchN_continuation_pc        = NULL;
     155
     156 // Initialization
     157 //
     158 // Note: to break cycle with universe initialization, stubs are generated in two phases.
     159 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry).
     160 // The second phase includes all other stubs (which may depend on universe being initialized.)
     161
     162 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators
     163
     164 void StubRoutines::initialize1() {
     165   if (_code1 == NULL) {
     166     ResourceMark rm;
     167     TraceTime timer("StubRoutines generation 1", TraceStartupTime);
     168     _code1 = BufferBlob::create("StubRoutines (1)", code_size1);
     169     if (_code1 == NULL) {
     170       vm_exit_out_of_memory(code_size1, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (1)");
     171     }
     172     CodeBuffer buffer(_code1);
     173     StubGenerator_generate(&buffer, false);
     174   }
     175 }
     176
     177
     178 #ifdef ASSERT
     179 typedef void (*arraycopy_fn)(address src, address dst, int count);
     180
     181 // simple tests of generated arraycopy functions
     182 static void test_arraycopy_func(address func, int alignment) {
     183   int v = 0xcc;
     184   int v2 = 0x11;
     185   jlong lbuffer[8];
     186   jlong lbuffer2[8];
     187   address fbuffer  = (address) lbuffer;
     188   address fbuffer2 = (address) lbuffer2;
     189   unsigned int i;
     190   for (i = 0; i < sizeof(lbuffer); i++) {
     191     fbuffer[i] = v; fbuffer2[i] = v2;
     192   }
     193   // C++ does not guarantee jlong[] array alignment to 8 bytes.
     194   // Use middle of array to check that memory before it is not modified.
     195   address buffer  = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong);
     196   address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong);
     197   // do an aligned copy
     198   ((arraycopy_fn)func)(buffer, buffer2, 0);
     199   for (i = 0; i < sizeof(lbuffer); i++) {
     200     assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
     201   }
     202   // adjust destination alignment
     203   ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0);
     204   for (i = 0; i < sizeof(lbuffer); i++) {
     205     assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
     206   }
     207   // adjust source alignment
     208   ((arraycopy_fn)func)(buffer + alignment, buffer2, 0);
     209   for (i = 0; i < sizeof(lbuffer); i++) {
     210     assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
     211   }
     212 }
     213 #endif
     214
     215
     216 void StubRoutines::initialize2() {
     217   if (_code2 == NULL) {
     218     ResourceMark rm;
     219     TraceTime timer("StubRoutines generation 2", TraceStartupTime);
     220     _code2 = BufferBlob::create("StubRoutines (2)", code_size2);
     221     if (_code2 == NULL) {
     222       vm_exit_out_of_memory(code_size2, OOM_MALLOC_ERROR, "CodeCache: no room for StubRoutines (2)");
     223     }
     224     CodeBuffer buffer(_code2);
     225     StubGenerator_generate(&buffer, true);
     226   }
     227
     228 #ifdef ASSERT
     229
     230 #define TEST_ARRAYCOPY(type)                                                    \
     231   test_arraycopy_func(          type##_arraycopy(),          sizeof(type));     \
     232   test_arraycopy_func(          type##_disjoint_arraycopy(), sizeof(type));     \
     233   test_arraycopy_func(arrayof_##type##_arraycopy(),          sizeof(HeapWord)); \
     234   test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord))
     235
     236   // Make sure all the arraycopy stubs properly handle zero count
     237   TEST_ARRAYCOPY(jbyte);
     238   TEST_ARRAYCOPY(jshort);
     239   TEST_ARRAYCOPY(jint);
     240   TEST_ARRAYCOPY(jlong);
     241
     242 #undef TEST_ARRAYCOPY
     243
     244 #define TEST_FILL(type)                                                                      \
     245   if (_##type##_fill != NULL) {                                                              \
     246     union {                                                                                  \
     247       double d;                                                                              \
     248       type body[96];                                                                         \
     249     } s;                                                                                     \
     250                                                                                              \
     251     int v = 32;                                                                              \
     252     for (int offset = -2; offset <= 2; offset++) {                                           \
     253       for (int i = 0; i < 96; i++) {                                                         \
     254         s.body[i] = 1;                                                                       \
     255       }                                                                                      \
     256       type* start = s.body + 8 + offset;                                                     \
     257       for (int aligned = 0; aligned < 2; aligned++) {                                        \
     258         if (aligned) {                                                                       \
     259           if (((intptr_t)start) % HeapWordSize == 0) {                                       \
     260             ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \
     261           } else {                                                                           \
     262             continue;                                                                        \
     263           }                                                                                  \
     264         } else {                                                                             \
     265           ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80);           \
     266         }                                                                                    \
     267         for (int i = 0; i < 96; i++) {                                                       \
     268           if (i < (8 + offset) || i >= (88 + offset)) {                                      \
     269             assert(s.body[i] == 1, "what?");                                                 \
     270           } else {                                                                           \
     271             assert(s.body[i] == 32, "what?");                                                \
     272           }                                                                                  \
     273         }                                                                                    \
     274       }                                                                                      \
     275     }                                                                                        \
     276   }                                                                                          \
     277
     278   TEST_FILL(jbyte);
     279   TEST_FILL(jshort);
     280   TEST_FILL(jint);
     281
     282 #undef TEST_FILL
     283
     284 #define TEST_COPYRTN(type) \
     285   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic),  sizeof(type)); \
     286   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type)))
     287
     288   // Make sure all the copy runtime routines properly handle zero count
     289   TEST_COPYRTN(jbyte);
     290   TEST_COPYRTN(jshort);
     291   TEST_COPYRTN(jint);
     292   TEST_COPYRTN(jlong);
     293
     294 #undef TEST_COPYRTN
     295
     296   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord));
     297   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord));
     298   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord));
     299   // Aligned to BytesPerLong
     300   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong));
     301   test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong));
     302
     303 #endif
     304 }
     305
     306
     307 void stubRoutines_init1() { StubRoutines::initialize1(); }
     308 void stubRoutines_init2() { StubRoutines::initialize2(); }
     309
     310 //
     311 // Default versions of arraycopy functions
     312 //
     313
     314 static void gen_arraycopy_barrier_pre(oop* dest, size_t count, bool dest_uninitialized) {
     315     assert(count != 0, "count should be non-zero");
     316     assert(count <= (size_t)max_intx, "count too large");
     317     BarrierSet* bs = Universe::heap()->barrier_set();
     318     assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt");
     319     bs->write_ref_array_pre(dest, (int)count, dest_uninitialized);
     320 }
     321
     322 static void gen_arraycopy_barrier(oop* dest, size_t count) {
     323     assert(count != 0, "count should be non-zero");
     324     BarrierSet* bs = Universe::heap()->barrier_set();
     325     assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
     326     bs->write_ref_array((HeapWord*)dest, count);
     327 }
     328
     329 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
     330 #ifndef PRODUCT
     331   SharedRuntime::_jbyte_array_copy_ctr++;      // Slow-path byte array copy
     332 #endif // !PRODUCT
     333   Copy::conjoint_jbytes_atomic(src, dest, count);
     334 JRT_END
     335
     336 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
     337 #ifndef PRODUCT
     338   SharedRuntime::_jshort_array_copy_ctr++;     // Slow-path short/char array copy
     339 #endif // !PRODUCT
     340   Copy::conjoint_jshorts_atomic(src, dest, count);
     341 JRT_END
     342
     343 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
     344 #ifndef PRODUCT
     345   SharedRuntime::_jint_array_copy_ctr++;       // Slow-path int/float array copy
     346 #endif // !PRODUCT
     347   Copy::conjoint_jints_atomic(src, dest, count);
     348 JRT_END
     349
     350 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
     351 #ifndef PRODUCT
     352   SharedRuntime::_jlong_array_copy_ctr++;      // Slow-path long/double array copy
     353 #endif // !PRODUCT
     354   Copy::conjoint_jlongs_atomic(src, dest, count);
     355 JRT_END
     356
     357 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
     358 #ifndef PRODUCT
     359   SharedRuntime::_oop_array_copy_ctr++;        // Slow-path oop array copy
     360 #endif // !PRODUCT
     361   assert(count != 0, "count should be non-zero");
     362   gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/false);
     363   Copy::conjoint_oops_atomic(src, dest, count);
     364   gen_arraycopy_barrier(dest, count);
     365 JRT_END
     366
     367 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count))
     368 #ifndef PRODUCT
     369   SharedRuntime::_oop_array_copy_ctr++;        // Slow-path oop array copy
     370 #endif // !PRODUCT
     371   assert(count != 0, "count should be non-zero");
     372   gen_arraycopy_barrier_pre(dest, count, /*dest_uninitialized*/true);
     373   Copy::conjoint_oops_atomic(src, dest, count);
     374   gen_arraycopy_barrier(dest, count);
     375 JRT_END
     376
     377 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
     378 #ifndef PRODUCT
     379   SharedRuntime::_jbyte_array_copy_ctr++;      // Slow-path byte array copy
     380 #endif // !PRODUCT
     381   Copy::arrayof_conjoint_jbytes(src, dest, count);
     382 JRT_END
     383
     384 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
     385 #ifndef PRODUCT
     386   SharedRuntime::_jshort_array_copy_ctr++;     // Slow-path short/char array copy
     387 #endif // !PRODUCT
     388   Copy::arrayof_conjoint_jshorts(src, dest, count);
     389 JRT_END
     390
     391 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count))
     392 #ifndef PRODUCT
     393   SharedRuntime::_jint_array_copy_ctr++;       // Slow-path int/float array copy
     394 #endif // !PRODUCT
     395   Copy::arrayof_conjoint_jints(src, dest, count);
     396 JRT_END
     397
     398 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
     399 #ifndef PRODUCT
     400   SharedRuntime::_jlong_array_copy_ctr++;       // Slow-path int/float array copy
     401 #endif // !PRODUCT
     402   Copy::arrayof_conjoint_jlongs(src, dest, count);
     403 JRT_END
     404
     405 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count))
     406 #ifndef PRODUCT
     407   SharedRuntime::_oop_array_copy_ctr++;        // Slow-path oop array copy
     408 #endif // !PRODUCT
     409   assert(count != 0, "count should be non-zero");
     410   gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/false);
     411   Copy::arrayof_conjoint_oops(src, dest, count);
     412   gen_arraycopy_barrier((oop *) dest, count);
     413 JRT_END
     414
     415 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count))
     416 #ifndef PRODUCT
     417   SharedRuntime::_oop_array_copy_ctr++;        // Slow-path oop array copy
     418 #endif // !PRODUCT
     419   assert(count != 0, "count should be non-zero");
     420   gen_arraycopy_barrier_pre((oop *) dest, count, /*dest_uninitialized*/true);
     421   Copy::arrayof_conjoint_oops(src, dest, count);
     422   gen_arraycopy_barrier((oop *) dest, count);
     423 JRT_END
     424
     425 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) {
     426 #define RETURN_STUB(xxx_fill) { \
     427   name = #xxx_fill; \
     428   return StubRoutines::xxx_fill(); }
     429
     430   switch (t) {
     431   case T_BYTE:
     432   case T_BOOLEAN:
     433     if (!aligned) RETURN_STUB(jbyte_fill);
     434     RETURN_STUB(arrayof_jbyte_fill);
     435   case T_CHAR:
     436   case T_SHORT:
     437     if (!aligned) RETURN_STUB(jshort_fill);
     438     RETURN_STUB(arrayof_jshort_fill);
     439   case T_INT:
     440   case T_FLOAT:
     441     if (!aligned) RETURN_STUB(jint_fill);
     442     RETURN_STUB(arrayof_jint_fill);
     443   case T_DOUBLE:
     444   case T_LONG:
     445   case T_ARRAY:
     446   case T_OBJECT:
     447   case T_NARROWOOP:
     448   case T_NARROWKLASS:
     449   case T_ADDRESS:
     450     // Currently unsupported
     451     return NULL;
     452
     453   default:
     454     ShouldNotReachHere();
     455     return NULL;
     456   }
     457
     458 #undef RETURN_STUB
     459 }
     460
     461 // constants for computing the copy function
     462 enum {
     463   COPYFUNC_UNALIGNED = 0,
     464   COPYFUNC_ALIGNED = 1,                 // src, dest aligned to HeapWordSize
     465   COPYFUNC_CONJOINT = 0,
     466   COPYFUNC_DISJOINT = 2                 // src != dest, or transfer can descend
     467 };
     468
     469 // Note:  The condition "disjoint" applies also for overlapping copies
     470 // where an descending copy is permitted (i.e., dest_offset <= src_offset).
     471 address
     472 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) {
     473   int selector =
     474     (aligned  ? COPYFUNC_ALIGNED  : COPYFUNC_UNALIGNED) +
     475     (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT);
     476
     477 #define RETURN_STUB(xxx_arraycopy) { \
     478   name = #xxx_arraycopy; \
     479   return StubRoutines::xxx_arraycopy(); }
     480
     481 #define RETURN_STUB_PARM(xxx_arraycopy, parm) {           \
     482   name = #xxx_arraycopy; \
     483   return StubRoutines::xxx_arraycopy(parm); }
     484
     485   switch (t) {
     486   case T_BYTE:
     487   case T_BOOLEAN:
     488     switch (selector) {
     489     case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jbyte_arraycopy);
     490     case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jbyte_arraycopy);
     491     case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jbyte_disjoint_arraycopy);
     492     case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jbyte_disjoint_arraycopy);
     493     }
     494   case T_CHAR:
     495   case T_SHORT:
     496     switch (selector) {
     497     case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jshort_arraycopy);
     498     case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jshort_arraycopy);
     499     case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jshort_disjoint_arraycopy);
     500     case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jshort_disjoint_arraycopy);
     501     }
     502   case T_INT:
     503   case T_FLOAT:
     504     switch (selector) {
     505     case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jint_arraycopy);
     506     case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jint_arraycopy);
     507     case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jint_disjoint_arraycopy);
     508     case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jint_disjoint_arraycopy);
     509     }
     510   case T_DOUBLE:
     511   case T_LONG:
     512     switch (selector) {
     513     case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jlong_arraycopy);
     514     case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jlong_arraycopy);
     515     case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jlong_disjoint_arraycopy);
     516     case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jlong_disjoint_arraycopy);
     517     }
     518   case T_ARRAY:
     519   case T_OBJECT:
     520     switch (selector) {
     521     case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized);
     522     case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized);
     523     case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized);
     524     case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized);
     525     }
     526   default:
     527     ShouldNotReachHere();
     528     return NULL;
     529   }
     530
     531 #undef RETURN_STUB
     532 #undef RETURN_STUB_PARM
     533 }