Tue, 23 Nov 2010 13:22:55 -0800
6989984: Use standard include model for Hospot
Summary: Replaced MakeDeps and the includeDB files with more standardized solutions.
Reviewed-by: coleenp, kvn, kamg
duke@435 | 1 | /* |
trims@1907 | 2 | * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "asm/codeBuffer.hpp" |
stefank@2314 | 27 | #include "memory/resourceArea.hpp" |
stefank@2314 | 28 | #include "oops/oop.inline.hpp" |
stefank@2314 | 29 | #include "runtime/interfaceSupport.hpp" |
stefank@2314 | 30 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 31 | #include "runtime/stubRoutines.hpp" |
stefank@2314 | 32 | #include "runtime/timer.hpp" |
stefank@2314 | 33 | #include "utilities/copy.hpp" |
stefank@2314 | 34 | #ifdef COMPILER2 |
stefank@2314 | 35 | #include "opto/runtime.hpp" |
stefank@2314 | 36 | #endif |
duke@435 | 37 | |
duke@435 | 38 | |
duke@435 | 39 | // Implementation of StubRoutines - for a description |
duke@435 | 40 | // of how to extend it, see the header file. |
duke@435 | 41 | |
duke@435 | 42 | // Class Variables |
duke@435 | 43 | |
duke@435 | 44 | BufferBlob* StubRoutines::_code1 = NULL; |
duke@435 | 45 | BufferBlob* StubRoutines::_code2 = NULL; |
duke@435 | 46 | |
duke@435 | 47 | address StubRoutines::_call_stub_return_address = NULL; |
duke@435 | 48 | address StubRoutines::_call_stub_entry = NULL; |
duke@435 | 49 | |
duke@435 | 50 | address StubRoutines::_catch_exception_entry = NULL; |
duke@435 | 51 | address StubRoutines::_forward_exception_entry = NULL; |
duke@435 | 52 | address StubRoutines::_throw_AbstractMethodError_entry = NULL; |
dcubed@451 | 53 | address StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL; |
duke@435 | 54 | address StubRoutines::_throw_ArithmeticException_entry = NULL; |
duke@435 | 55 | address StubRoutines::_throw_NullPointerException_entry = NULL; |
duke@435 | 56 | address StubRoutines::_throw_NullPointerException_at_call_entry = NULL; |
duke@435 | 57 | address StubRoutines::_throw_StackOverflowError_entry = NULL; |
duke@435 | 58 | address StubRoutines::_handler_for_unsafe_access_entry = NULL; |
duke@435 | 59 | jint StubRoutines::_verify_oop_count = 0; |
duke@435 | 60 | address StubRoutines::_verify_oop_subroutine_entry = NULL; |
duke@435 | 61 | address StubRoutines::_atomic_xchg_entry = NULL; |
duke@435 | 62 | address StubRoutines::_atomic_xchg_ptr_entry = NULL; |
duke@435 | 63 | address StubRoutines::_atomic_store_entry = NULL; |
duke@435 | 64 | address StubRoutines::_atomic_store_ptr_entry = NULL; |
duke@435 | 65 | address StubRoutines::_atomic_cmpxchg_entry = NULL; |
duke@435 | 66 | address StubRoutines::_atomic_cmpxchg_ptr_entry = NULL; |
duke@435 | 67 | address StubRoutines::_atomic_cmpxchg_long_entry = NULL; |
duke@435 | 68 | address StubRoutines::_atomic_add_entry = NULL; |
duke@435 | 69 | address StubRoutines::_atomic_add_ptr_entry = NULL; |
duke@435 | 70 | address StubRoutines::_fence_entry = NULL; |
duke@435 | 71 | address StubRoutines::_d2i_wrapper = NULL; |
duke@435 | 72 | address StubRoutines::_d2l_wrapper = NULL; |
duke@435 | 73 | |
duke@435 | 74 | jint StubRoutines::_fpu_cntrl_wrd_std = 0; |
duke@435 | 75 | jint StubRoutines::_fpu_cntrl_wrd_24 = 0; |
duke@435 | 76 | jint StubRoutines::_fpu_cntrl_wrd_64 = 0; |
duke@435 | 77 | jint StubRoutines::_fpu_cntrl_wrd_trunc = 0; |
duke@435 | 78 | jint StubRoutines::_mxcsr_std = 0; |
duke@435 | 79 | jint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 }; |
duke@435 | 80 | jint StubRoutines::_fpu_subnormal_bias2[3] = { 0, 0, 0 }; |
duke@435 | 81 | |
duke@435 | 82 | // Compiled code entry points default values |
duke@435 | 83 | // The dafault functions don't have separate disjoint versions. |
duke@435 | 84 | address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); |
duke@435 | 85 | address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); |
duke@435 | 86 | address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); |
duke@435 | 87 | address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); |
duke@435 | 88 | address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); |
duke@435 | 89 | address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); |
duke@435 | 90 | address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); |
duke@435 | 91 | address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); |
duke@435 | 92 | address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); |
duke@435 | 93 | address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); |
duke@435 | 94 | |
duke@435 | 95 | address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); |
duke@435 | 96 | address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); |
duke@435 | 97 | address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); |
duke@435 | 98 | address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); |
duke@435 | 99 | address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); |
duke@435 | 100 | address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); |
duke@435 | 101 | address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); |
duke@435 | 102 | address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); |
duke@435 | 103 | address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); |
duke@435 | 104 | address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); |
duke@435 | 105 | |
duke@435 | 106 | address StubRoutines::_checkcast_arraycopy = NULL; |
duke@435 | 107 | address StubRoutines::_unsafe_arraycopy = NULL; |
duke@435 | 108 | address StubRoutines::_generic_arraycopy = NULL; |
duke@435 | 109 | |
never@2118 | 110 | |
never@2118 | 111 | address StubRoutines::_jbyte_fill; |
never@2118 | 112 | address StubRoutines::_jshort_fill; |
never@2118 | 113 | address StubRoutines::_jint_fill; |
never@2118 | 114 | address StubRoutines::_arrayof_jbyte_fill; |
never@2118 | 115 | address StubRoutines::_arrayof_jshort_fill; |
never@2118 | 116 | address StubRoutines::_arrayof_jint_fill; |
never@2118 | 117 | |
never@2118 | 118 | |
never@1609 | 119 | double (* StubRoutines::_intrinsic_log )(double) = NULL; |
never@1609 | 120 | double (* StubRoutines::_intrinsic_log10 )(double) = NULL; |
never@1609 | 121 | double (* StubRoutines::_intrinsic_exp )(double) = NULL; |
never@1609 | 122 | double (* StubRoutines::_intrinsic_pow )(double, double) = NULL; |
never@1609 | 123 | double (* StubRoutines::_intrinsic_sin )(double) = NULL; |
never@1609 | 124 | double (* StubRoutines::_intrinsic_cos )(double) = NULL; |
never@1609 | 125 | double (* StubRoutines::_intrinsic_tan )(double) = NULL; |
never@1609 | 126 | |
duke@435 | 127 | // Initialization |
duke@435 | 128 | // |
duke@435 | 129 | // Note: to break cycle with universe initialization, stubs are generated in two phases. |
duke@435 | 130 | // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry). |
duke@435 | 131 | // The second phase includes all other stubs (which may depend on universe being initialized.) |
duke@435 | 132 | |
duke@435 | 133 | extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators |
duke@435 | 134 | |
duke@435 | 135 | void StubRoutines::initialize1() { |
duke@435 | 136 | if (_code1 == NULL) { |
duke@435 | 137 | ResourceMark rm; |
duke@435 | 138 | TraceTime timer("StubRoutines generation 1", TraceStartupTime); |
duke@435 | 139 | _code1 = BufferBlob::create("StubRoutines (1)", code_size1); |
jcoomes@1845 | 140 | if (_code1 == NULL) { |
twisti@2103 | 141 | vm_exit_out_of_memory(code_size1, "CodeCache: no room for StubRoutines (1)"); |
jcoomes@1845 | 142 | } |
twisti@2103 | 143 | CodeBuffer buffer(_code1); |
duke@435 | 144 | StubGenerator_generate(&buffer, false); |
duke@435 | 145 | } |
duke@435 | 146 | } |
duke@435 | 147 | |
duke@435 | 148 | |
duke@435 | 149 | #ifdef ASSERT |
duke@435 | 150 | typedef void (*arraycopy_fn)(address src, address dst, int count); |
duke@435 | 151 | |
duke@435 | 152 | // simple tests of generated arraycopy functions |
duke@435 | 153 | static void test_arraycopy_func(address func, int alignment) { |
duke@435 | 154 | int v = 0xcc; |
duke@435 | 155 | int v2 = 0x11; |
kvn@1958 | 156 | jlong lbuffer[8]; |
kvn@1958 | 157 | jlong lbuffer2[8]; |
kvn@1958 | 158 | address fbuffer = (address) lbuffer; |
kvn@1958 | 159 | address fbuffer2 = (address) lbuffer2; |
duke@435 | 160 | unsigned int i; |
duke@435 | 161 | for (i = 0; i < sizeof(lbuffer); i++) { |
kvn@1958 | 162 | fbuffer[i] = v; fbuffer2[i] = v2; |
duke@435 | 163 | } |
kvn@1958 | 164 | // C++ does not guarantee jlong[] array alignment to 8 bytes. |
kvn@1958 | 165 | // Use middle of array to check that memory before it is not modified. |
kvn@1958 | 166 | address buffer = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong); |
kvn@1958 | 167 | address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong); |
duke@435 | 168 | // do an aligned copy |
duke@435 | 169 | ((arraycopy_fn)func)(buffer, buffer2, 0); |
duke@435 | 170 | for (i = 0; i < sizeof(lbuffer); i++) { |
kvn@1958 | 171 | assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); |
duke@435 | 172 | } |
duke@435 | 173 | // adjust destination alignment |
duke@435 | 174 | ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0); |
duke@435 | 175 | for (i = 0; i < sizeof(lbuffer); i++) { |
kvn@1958 | 176 | assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); |
duke@435 | 177 | } |
duke@435 | 178 | // adjust source alignment |
duke@435 | 179 | ((arraycopy_fn)func)(buffer + alignment, buffer2, 0); |
duke@435 | 180 | for (i = 0; i < sizeof(lbuffer); i++) { |
kvn@1958 | 181 | assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); |
duke@435 | 182 | } |
duke@435 | 183 | } |
duke@435 | 184 | #endif |
duke@435 | 185 | |
duke@435 | 186 | |
duke@435 | 187 | void StubRoutines::initialize2() { |
duke@435 | 188 | if (_code2 == NULL) { |
duke@435 | 189 | ResourceMark rm; |
duke@435 | 190 | TraceTime timer("StubRoutines generation 2", TraceStartupTime); |
duke@435 | 191 | _code2 = BufferBlob::create("StubRoutines (2)", code_size2); |
jcoomes@1845 | 192 | if (_code2 == NULL) { |
twisti@2103 | 193 | vm_exit_out_of_memory(code_size2, "CodeCache: no room for StubRoutines (2)"); |
jcoomes@1845 | 194 | } |
twisti@2103 | 195 | CodeBuffer buffer(_code2); |
duke@435 | 196 | StubGenerator_generate(&buffer, true); |
duke@435 | 197 | } |
duke@435 | 198 | |
duke@435 | 199 | #ifdef ASSERT |
duke@435 | 200 | |
duke@435 | 201 | #define TEST_ARRAYCOPY(type) \ |
duke@435 | 202 | test_arraycopy_func( type##_arraycopy(), sizeof(type)); \ |
duke@435 | 203 | test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \ |
duke@435 | 204 | test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \ |
duke@435 | 205 | test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord)) |
duke@435 | 206 | |
kvn@1958 | 207 | // Make sure all the arraycopy stubs properly handle zero count |
duke@435 | 208 | TEST_ARRAYCOPY(jbyte); |
duke@435 | 209 | TEST_ARRAYCOPY(jshort); |
duke@435 | 210 | TEST_ARRAYCOPY(jint); |
duke@435 | 211 | TEST_ARRAYCOPY(jlong); |
duke@435 | 212 | |
duke@435 | 213 | #undef TEST_ARRAYCOPY |
duke@435 | 214 | |
never@2118 | 215 | #define TEST_FILL(type) \ |
never@2118 | 216 | if (_##type##_fill != NULL) { \ |
never@2118 | 217 | union { \ |
never@2118 | 218 | double d; \ |
never@2118 | 219 | type body[96]; \ |
never@2118 | 220 | } s; \ |
never@2118 | 221 | \ |
never@2118 | 222 | int v = 32; \ |
never@2118 | 223 | for (int offset = -2; offset <= 2; offset++) { \ |
never@2118 | 224 | for (int i = 0; i < 96; i++) { \ |
never@2118 | 225 | s.body[i] = 1; \ |
never@2118 | 226 | } \ |
never@2118 | 227 | type* start = s.body + 8 + offset; \ |
never@2118 | 228 | for (int aligned = 0; aligned < 2; aligned++) { \ |
never@2118 | 229 | if (aligned) { \ |
never@2118 | 230 | if (((intptr_t)start) % HeapWordSize == 0) { \ |
never@2118 | 231 | ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \ |
never@2118 | 232 | } else { \ |
never@2118 | 233 | continue; \ |
never@2118 | 234 | } \ |
never@2118 | 235 | } else { \ |
never@2118 | 236 | ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \ |
never@2118 | 237 | } \ |
never@2118 | 238 | for (int i = 0; i < 96; i++) { \ |
never@2118 | 239 | if (i < (8 + offset) || i >= (88 + offset)) { \ |
never@2118 | 240 | assert(s.body[i] == 1, "what?"); \ |
never@2118 | 241 | } else { \ |
never@2118 | 242 | assert(s.body[i] == 32, "what?"); \ |
never@2118 | 243 | } \ |
never@2118 | 244 | } \ |
never@2118 | 245 | } \ |
never@2118 | 246 | } \ |
never@2118 | 247 | } \ |
never@2118 | 248 | |
never@2118 | 249 | TEST_FILL(jbyte); |
never@2118 | 250 | TEST_FILL(jshort); |
never@2118 | 251 | TEST_FILL(jint); |
never@2118 | 252 | |
never@2118 | 253 | #undef TEST_FILL |
never@2118 | 254 | |
kvn@1958 | 255 | #define TEST_COPYRTN(type) \ |
kvn@1958 | 256 | test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \ |
kvn@1958 | 257 | test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type))) |
kvn@1958 | 258 | |
kvn@1958 | 259 | // Make sure all the copy runtime routines properly handle zero count |
kvn@1958 | 260 | TEST_COPYRTN(jbyte); |
kvn@1958 | 261 | TEST_COPYRTN(jshort); |
kvn@1958 | 262 | TEST_COPYRTN(jint); |
kvn@1958 | 263 | TEST_COPYRTN(jlong); |
kvn@1958 | 264 | |
kvn@1958 | 265 | #undef TEST_COPYRTN |
kvn@1958 | 266 | |
kvn@1958 | 267 | test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord)); |
kvn@1958 | 268 | test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord)); |
kvn@1958 | 269 | test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord)); |
kvn@1958 | 270 | // Aligned to BytesPerLong |
kvn@1958 | 271 | test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong)); |
kvn@1958 | 272 | test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong)); |
kvn@1958 | 273 | |
duke@435 | 274 | #endif |
duke@435 | 275 | } |
duke@435 | 276 | |
duke@435 | 277 | |
duke@435 | 278 | void stubRoutines_init1() { StubRoutines::initialize1(); } |
duke@435 | 279 | void stubRoutines_init2() { StubRoutines::initialize2(); } |
duke@435 | 280 | |
duke@435 | 281 | // |
duke@435 | 282 | // Default versions of arraycopy functions |
duke@435 | 283 | // |
duke@435 | 284 | |
ysr@1680 | 285 | static void gen_arraycopy_barrier_pre(oop* dest, size_t count) { |
ysr@1680 | 286 | assert(count != 0, "count should be non-zero"); |
ysr@1680 | 287 | assert(count <= (size_t)max_intx, "count too large"); |
ysr@1680 | 288 | BarrierSet* bs = Universe::heap()->barrier_set(); |
ysr@1680 | 289 | assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt"); |
ysr@1680 | 290 | bs->write_ref_array_pre(dest, (int)count); |
ysr@1680 | 291 | } |
ysr@1680 | 292 | |
duke@435 | 293 | static void gen_arraycopy_barrier(oop* dest, size_t count) { |
duke@435 | 294 | assert(count != 0, "count should be non-zero"); |
duke@435 | 295 | BarrierSet* bs = Universe::heap()->barrier_set(); |
duke@435 | 296 | assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); |
ysr@1680 | 297 | bs->write_ref_array((HeapWord*)dest, count); |
duke@435 | 298 | } |
duke@435 | 299 | |
duke@435 | 300 | JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count)) |
duke@435 | 301 | #ifndef PRODUCT |
duke@435 | 302 | SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy |
duke@435 | 303 | #endif // !PRODUCT |
kvn@1958 | 304 | Copy::conjoint_jbytes_atomic(src, dest, count); |
duke@435 | 305 | JRT_END |
duke@435 | 306 | |
duke@435 | 307 | JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count)) |
duke@435 | 308 | #ifndef PRODUCT |
duke@435 | 309 | SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy |
duke@435 | 310 | #endif // !PRODUCT |
duke@435 | 311 | Copy::conjoint_jshorts_atomic(src, dest, count); |
duke@435 | 312 | JRT_END |
duke@435 | 313 | |
duke@435 | 314 | JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count)) |
duke@435 | 315 | #ifndef PRODUCT |
duke@435 | 316 | SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy |
duke@435 | 317 | #endif // !PRODUCT |
duke@435 | 318 | Copy::conjoint_jints_atomic(src, dest, count); |
duke@435 | 319 | JRT_END |
duke@435 | 320 | |
duke@435 | 321 | JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count)) |
duke@435 | 322 | #ifndef PRODUCT |
duke@435 | 323 | SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy |
duke@435 | 324 | #endif // !PRODUCT |
duke@435 | 325 | Copy::conjoint_jlongs_atomic(src, dest, count); |
duke@435 | 326 | JRT_END |
duke@435 | 327 | |
duke@435 | 328 | JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count)) |
duke@435 | 329 | #ifndef PRODUCT |
duke@435 | 330 | SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy |
duke@435 | 331 | #endif // !PRODUCT |
duke@435 | 332 | assert(count != 0, "count should be non-zero"); |
ysr@1680 | 333 | gen_arraycopy_barrier_pre(dest, count); |
duke@435 | 334 | Copy::conjoint_oops_atomic(src, dest, count); |
duke@435 | 335 | gen_arraycopy_barrier(dest, count); |
duke@435 | 336 | JRT_END |
duke@435 | 337 | |
duke@435 | 338 | JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count)) |
duke@435 | 339 | #ifndef PRODUCT |
duke@435 | 340 | SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy |
duke@435 | 341 | #endif // !PRODUCT |
kvn@1958 | 342 | Copy::arrayof_conjoint_jbytes(src, dest, count); |
duke@435 | 343 | JRT_END |
duke@435 | 344 | |
duke@435 | 345 | JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count)) |
duke@435 | 346 | #ifndef PRODUCT |
duke@435 | 347 | SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy |
duke@435 | 348 | #endif // !PRODUCT |
duke@435 | 349 | Copy::arrayof_conjoint_jshorts(src, dest, count); |
duke@435 | 350 | JRT_END |
duke@435 | 351 | |
duke@435 | 352 | JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count)) |
duke@435 | 353 | #ifndef PRODUCT |
duke@435 | 354 | SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy |
duke@435 | 355 | #endif // !PRODUCT |
duke@435 | 356 | Copy::arrayof_conjoint_jints(src, dest, count); |
duke@435 | 357 | JRT_END |
duke@435 | 358 | |
duke@435 | 359 | JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count)) |
duke@435 | 360 | #ifndef PRODUCT |
duke@435 | 361 | SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy |
duke@435 | 362 | #endif // !PRODUCT |
duke@435 | 363 | Copy::arrayof_conjoint_jlongs(src, dest, count); |
duke@435 | 364 | JRT_END |
duke@435 | 365 | |
duke@435 | 366 | JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count)) |
duke@435 | 367 | #ifndef PRODUCT |
duke@435 | 368 | SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy |
duke@435 | 369 | #endif // !PRODUCT |
duke@435 | 370 | assert(count != 0, "count should be non-zero"); |
ysr@1680 | 371 | gen_arraycopy_barrier_pre((oop *) dest, count); |
duke@435 | 372 | Copy::arrayof_conjoint_oops(src, dest, count); |
duke@435 | 373 | gen_arraycopy_barrier((oop *) dest, count); |
duke@435 | 374 | JRT_END |
never@2118 | 375 | |
never@2118 | 376 | |
never@2118 | 377 | address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) { |
never@2118 | 378 | #define RETURN_STUB(xxx_fill) { \ |
never@2118 | 379 | name = #xxx_fill; \ |
never@2118 | 380 | return StubRoutines::xxx_fill(); } |
never@2118 | 381 | |
never@2118 | 382 | switch (t) { |
never@2118 | 383 | case T_BYTE: |
never@2118 | 384 | case T_BOOLEAN: |
never@2118 | 385 | if (!aligned) RETURN_STUB(jbyte_fill); |
never@2118 | 386 | RETURN_STUB(arrayof_jbyte_fill); |
never@2118 | 387 | case T_CHAR: |
never@2118 | 388 | case T_SHORT: |
never@2118 | 389 | if (!aligned) RETURN_STUB(jshort_fill); |
never@2118 | 390 | RETURN_STUB(arrayof_jshort_fill); |
never@2118 | 391 | case T_INT: |
never@2118 | 392 | case T_FLOAT: |
never@2118 | 393 | if (!aligned) RETURN_STUB(jint_fill); |
never@2118 | 394 | RETURN_STUB(arrayof_jint_fill); |
never@2118 | 395 | case T_DOUBLE: |
never@2118 | 396 | case T_LONG: |
never@2118 | 397 | case T_ARRAY: |
never@2118 | 398 | case T_OBJECT: |
never@2118 | 399 | case T_NARROWOOP: |
never@2118 | 400 | case T_ADDRESS: |
never@2118 | 401 | // Currently unsupported |
never@2118 | 402 | return NULL; |
never@2118 | 403 | |
never@2118 | 404 | default: |
never@2118 | 405 | ShouldNotReachHere(); |
never@2118 | 406 | return NULL; |
never@2118 | 407 | } |
never@2118 | 408 | |
never@2118 | 409 | #undef RETURN_STUB |
never@2118 | 410 | } |